{"version":3,"file":"anchor-link.bundle.js","sources":["../node_modules/core-js/internals/global.js","../node_modules/core-js/internals/fails.js","../node_modules/core-js/internals/descriptors.js","../node_modules/core-js/internals/object-property-is-enumerable.js","../node_modules/core-js/internals/create-property-descriptor.js","../node_modules/core-js/internals/classof-raw.js","../node_modules/core-js/internals/indexed-object.js","../node_modules/core-js/internals/require-object-coercible.js","../node_modules/core-js/internals/to-indexed-object.js","../node_modules/core-js/internals/is-object.js","../node_modules/core-js/internals/to-primitive.js","../node_modules/core-js/internals/to-object.js","../node_modules/core-js/internals/has.js","../node_modules/core-js/internals/document-create-element.js","../node_modules/core-js/internals/ie8-dom-define.js","../node_modules/core-js/internals/object-get-own-property-descriptor.js","../node_modules/core-js/internals/an-object.js","../node_modules/core-js/internals/object-define-property.js","../node_modules/core-js/internals/create-non-enumerable-property.js","../node_modules/core-js/internals/set-global.js","../node_modules/core-js/internals/shared-store.js","../node_modules/core-js/internals/inspect-source.js","../node_modules/core-js/internals/native-weak-map.js","../node_modules/core-js/internals/shared.js","../node_modules/core-js/internals/uid.js","../node_modules/core-js/internals/internal-state.js","../node_modules/core-js/internals/shared-key.js","../node_modules/core-js/internals/hidden-keys.js","../node_modules/core-js/internals/redefine.js","../node_modules/core-js/internals/path.js","../node_modules/core-js/internals/get-built-in.js","../node_modules/core-js/internals/to-integer.js","../node_modules/core-js/internals/to-length.js","../node_modules/core-js/internals/to-absolute-index.js","../node_modules/core-js/internals/array-includes.js","../node_modules/core-js/internals/object-keys-internal.js","../node_modules/core-js/internals/enum-bug-keys.js","../node_modules/core-js/internals/object-get-own-property-names.js","../node_modules/core-js/internals/object-get-own-property-symbols.js","../node_modules/core-js/internals/own-keys.js","../node_modules/core-js/internals/engine-v8-version.js","../node_modules/core-js/internals/copy-constructor-properties.js","../node_modules/core-js/internals/is-forced.js","../node_modules/core-js/internals/export.js","../node_modules/core-js/internals/engine-user-agent.js","../node_modules/core-js/internals/object-create.js","../node_modules/core-js/internals/native-symbol.js","../node_modules/core-js/internals/use-symbol-as-uid.js","../node_modules/core-js/internals/is-array.js","../node_modules/core-js/internals/object-keys.js","../node_modules/core-js/internals/object-define-properties.js","../node_modules/core-js/internals/html.js","../node_modules/core-js/internals/object-get-own-property-names-external.js","../node_modules/core-js/internals/well-known-symbol.js","../node_modules/core-js/internals/well-known-symbol-wrapped.js","../node_modules/core-js/internals/define-well-known-symbol.js","../node_modules/core-js/internals/set-to-string-tag.js","../node_modules/core-js/internals/a-function.js","../node_modules/core-js/internals/function-bind-context.js","../node_modules/core-js/internals/array-species-create.js","../node_modules/core-js/internals/array-iteration.js","../node_modules/core-js/modules/es.symbol.js","../node_modules/core-js/modules/es.symbol.description.js","../node_modules/core-js/internals/to-string-tag-support.js","../node_modules/core-js/internals/classof.js","../node_modules/core-js/internals/object-to-string.js","../node_modules/core-js/modules/es.object.to-string.js","../node_modules/core-js/modules/es.symbol.iterator.js","../node_modules/core-js/internals/add-to-unscopables.js","../node_modules/core-js/internals/iterators-core.js","../node_modules/core-js/internals/iterators.js","../node_modules/core-js/internals/correct-prototype-getter.js","../node_modules/core-js/internals/object-get-prototype-of.js","../node_modules/core-js/internals/create-iterator-constructor.js","../node_modules/core-js/internals/a-possible-prototype.js","../node_modules/core-js/internals/object-set-prototype-of.js","../node_modules/core-js/internals/define-iterator.js","../node_modules/core-js/modules/es.array.iterator.js","../node_modules/core-js/internals/string-multibyte.js","../node_modules/core-js/modules/es.string.iterator.js","../node_modules/core-js/internals/dom-iterables.js","../node_modules/core-js/modules/web.dom-collections.iterator.js","../node_modules/core-js/modules/es.symbol.async-iterator.js","../node_modules/core-js/modules/es.symbol.to-string-tag.js","../node_modules/core-js/modules/es.json.to-string-tag.js","../node_modules/core-js/modules/es.math.to-string-tag.js","../node_modules/core-js/modules/es.object.get-prototype-of.js","../node_modules/core-js/modules/es.function.name.js","../node_modules/core-js/internals/native-promise-constructor.js","../node_modules/core-js/internals/redefine-all.js","../node_modules/core-js/internals/set-species.js","../node_modules/core-js/internals/an-instance.js","../node_modules/core-js/internals/is-array-iterator-method.js","../node_modules/core-js/internals/get-iterator-method.js","../node_modules/core-js/internals/iterator-close.js","../node_modules/core-js/internals/iterate.js","../node_modules/core-js/internals/check-correctness-of-iteration.js","../node_modules/core-js/internals/task.js","../node_modules/core-js/internals/species-constructor.js","../node_modules/core-js/internals/engine-is-ios.js","../node_modules/core-js/internals/engine-is-node.js","../node_modules/core-js/internals/microtask.js","../node_modules/core-js/internals/engine-is-webos-webkit.js","../node_modules/core-js/internals/new-promise-capability.js","../node_modules/core-js/internals/promise-resolve.js","../node_modules/core-js/modules/es.promise.js","../node_modules/core-js/internals/host-report-errors.js","../node_modules/core-js/internals/engine-is-browser.js","../node_modules/core-js/internals/perform.js","../node_modules/core-js/internals/regexp-flags.js","../node_modules/core-js/modules/es.regexp.to-string.js","../node_modules/core-js/internals/array-method-is-strict.js","../node_modules/core-js/internals/array-for-each.js","../node_modules/core-js/modules/web.dom-collections.for-each.js","../node_modules/core-js/internals/create-property.js","../node_modules/core-js/internals/array-method-has-species-support.js","../node_modules/core-js/modules/es.array.slice.js","../node_modules/regenerator-runtime/runtime.js","../node_modules/core-js/modules/es.object.keys.js","../node_modules/core-js/modules/es.array.join.js","../node_modules/core-js/modules/es.array.map.js","../node_modules/core-js/internals/regexp-sticky-helpers.js","../node_modules/core-js/internals/regexp-exec.js","../node_modules/core-js/modules/es.regexp.exec.js","../node_modules/core-js/internals/fix-regexp-well-known-symbol-logic.js","../node_modules/core-js/internals/is-regexp.js","../node_modules/core-js/internals/advance-string-index.js","../node_modules/core-js/internals/regexp-exec-abstract.js","../node_modules/core-js/modules/es.string.split.js","../node_modules/core-js/internals/create-html.js","../node_modules/core-js/internals/string-html-forced.js","../node_modules/core-js/modules/es.string.link.js","../node_modules/core-js/internals/get-substitution.js","../node_modules/core-js/modules/es.string.replace.js","../node_modules/core-js/internals/whitespaces.js","../node_modules/core-js/internals/string-trim.js","../node_modules/core-js/internals/string-trim-forced.js","../node_modules/core-js/modules/es.string.trim.js","../node_modules/core-js/modules/es.array.concat.js","../node_modules/core-js/modules/es.array.includes.js","../node_modules/core-js/internals/not-a-regexp.js","../node_modules/core-js/internals/correct-is-regexp-logic.js","../node_modules/core-js/modules/es.string.includes.js","../node_modules/core-js/internals/freezing.js","../node_modules/core-js/internals/internal-metadata.js","../node_modules/core-js/internals/inherit-if-required.js","../node_modules/core-js/internals/collection.js","../node_modules/core-js/internals/collection-strong.js","../node_modules/core-js/modules/es.map.js","../node_modules/core-js/modules/es.array.find.js","../node_modules/core-js/modules/es.regexp.flags.js","../node_modules/core-js/modules/es.array.filter.js","../node_modules/core-js/modules/es.string.starts-with.js","../node_modules/core-js/modules/es.array.find-index.js","../node_modules/core-js/modules/es.array.splice.js","../node_modules/core-js/internals/array-buffer-view-core.js","../node_modules/core-js/internals/array-buffer-native.js","../node_modules/core-js/internals/typed-array-constructors-require-wrappers.js","../node_modules/core-js/internals/to-index.js","../node_modules/core-js/internals/ieee754.js","../node_modules/core-js/internals/array-fill.js","../node_modules/core-js/internals/array-buffer.js","../node_modules/core-js/internals/to-positive-integer.js","../node_modules/core-js/internals/to-offset.js","../node_modules/core-js/internals/typed-array-from.js","../node_modules/core-js/internals/typed-array-constructor.js","../node_modules/core-js/modules/es.typed-array.uint8-array.js","../node_modules/core-js/internals/array-copy-within.js","../node_modules/core-js/modules/es.typed-array.copy-within.js","../node_modules/core-js/modules/es.typed-array.every.js","../node_modules/core-js/modules/es.typed-array.fill.js","../node_modules/core-js/internals/typed-array-from-species-and-list.js","../node_modules/core-js/modules/es.typed-array.filter.js","../node_modules/core-js/modules/es.typed-array.find.js","../node_modules/core-js/modules/es.typed-array.find-index.js","../node_modules/core-js/modules/es.typed-array.for-each.js","../node_modules/core-js/modules/es.typed-array.includes.js","../node_modules/core-js/modules/es.typed-array.index-of.js","../node_modules/core-js/modules/es.typed-array.iterator.js","../node_modules/core-js/modules/es.typed-array.join.js","../node_modules/core-js/internals/array-last-index-of.js","../node_modules/core-js/modules/es.typed-array.last-index-of.js","../node_modules/core-js/modules/es.typed-array.map.js","../node_modules/core-js/internals/array-reduce.js","../node_modules/core-js/modules/es.typed-array.reduce.js","../node_modules/core-js/modules/es.typed-array.reduce-right.js","../node_modules/core-js/modules/es.typed-array.reverse.js","../node_modules/core-js/modules/es.typed-array.set.js","../node_modules/core-js/modules/es.typed-array.slice.js","../node_modules/core-js/modules/es.typed-array.some.js","../node_modules/core-js/modules/es.typed-array.sort.js","../node_modules/core-js/modules/es.typed-array.subarray.js","../node_modules/core-js/modules/es.typed-array.to-locale-string.js","../node_modules/core-js/modules/es.typed-array.to-string.js","../node_modules/core-js/modules/es.typed-array.uint32-array.js","../node_modules/core-js/modules/es.typed-array.uint16-array.js","../node_modules/core-js/modules/es.typed-array.int32-array.js","../node_modules/pako/dist/pako.esm.mjs","../node_modules/core-js/internals/string-repeat.js","../node_modules/core-js/internals/string-pad.js","../node_modules/core-js/internals/string-pad-webkit-bug.js","../node_modules/core-js/modules/es.string.pad-start.js","../node_modules/core-js/modules/es.array-buffer.constructor.js","../node_modules/core-js/modules/es.string.sub.js","../node_modules/core-js/modules/es.symbol.to-primitive.js","../node_modules/core-js/internals/date-to-primitive.js","../node_modules/core-js/modules/es.date.to-primitive.js","../node_modules/core-js/internals/number-is-finite.js","../node_modules/core-js/modules/es.number.is-finite.js","../node_modules/core-js/modules/es.number.constructor.js","../node_modules/core-js/modules/es.array.fill.js","../node_modules/core-js/modules/es.set.js","../node_modules/core-js/internals/call-with-safe-iteration-closing.js","../node_modules/core-js/internals/array-from.js","../node_modules/core-js/modules/es.array.from.js","../node_modules/core-js/internals/number-parse-float.js","../node_modules/core-js/modules/es.number.parse-float.js","../node_modules/core-js/internals/this-number-value.js","../node_modules/core-js/modules/es.number.to-fixed.js","../node_modules/core-js/modules/es.string.ends-with.js","../node_modules/core-js/internals/number-parse-int.js","../node_modules/core-js/modules/es.number.parse-int.js","../node_modules/core-js/modules/es.typed-array.int16-array.js","../node_modules/core-js/modules/web.url.to-json.js","../node_modules/core-js/modules/es.object.freeze.js","../node_modules/brorand/index.js","../node_modules/minimalistic-assert/index.js","../node_modules/inherits/inherits_browser.js","../node_modules/hash.js/lib/hash/utils.js","../node_modules/hash.js/lib/hash/common.js","../node_modules/hash.js/lib/hash/sha/common.js","../node_modules/hash.js/lib/hash/sha/1.js","../node_modules/hash.js/lib/hash/sha/256.js","../node_modules/hash.js/lib/hash/sha/224.js","../node_modules/hash.js/lib/hash/sha/512.js","../node_modules/hash.js/lib/hash/sha/384.js","../node_modules/hash.js/lib/hash/sha.js","../node_modules/hash.js/lib/hash/ripemd.js","../node_modules/hash.js/lib/hash/hmac.js","../node_modules/hash.js/lib/hash.js","../node_modules/core-js/modules/es.math.clz32.js","../node_modules/core-js/modules/es.math.imul.js","../node_modules/bn.js/lib/bn.js","../node_modules/minimalistic-crypto-utils/lib/utils.js","../node_modules/elliptic/lib/elliptic/utils.js","../node_modules/elliptic/lib/elliptic/curve/base.js","../node_modules/elliptic/lib/elliptic/curve/short.js","../node_modules/elliptic/lib/elliptic/curve/mont.js","../node_modules/elliptic/lib/elliptic/curve/edwards.js","../node_modules/elliptic/lib/elliptic/curve/index.js","../node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","../node_modules/elliptic/lib/elliptic/curves.js","../node_modules/hmac-drbg/lib/hmac-drbg.js","../node_modules/elliptic/lib/elliptic/ec/key.js","../node_modules/elliptic/lib/elliptic/ec/signature.js","../node_modules/elliptic/lib/elliptic/ec/index.js","../node_modules/elliptic/lib/elliptic/eddsa/key.js","../node_modules/elliptic/lib/elliptic/eddsa/signature.js","../node_modules/elliptic/lib/elliptic/eddsa/index.js","../node_modules/elliptic/lib/elliptic.js","../node_modules/core-js/internals/object-assign.js","../node_modules/core-js/modules/es.object.assign.js","../node_modules/core-js/modules/es.object.get-own-property-descriptor.js","../node_modules/tslib/tslib.es6.js","../node_modules/@greymass/eosio/lib/eosio-core.m.js","../node_modules/eosio-signing-request/lib/esr.m.js","../node_modules/core-js/modules/es.object.get-own-property-names.js","../node_modules/core-js/internals/native-url.js","../node_modules/core-js/internals/string-punycode-to-ascii.js","../node_modules/core-js/internals/get-iterator.js","../node_modules/core-js/modules/web.url-search-params.js","../node_modules/core-js/modules/web.url.js","../node_modules/fetch-ponyfill/build/fetch-browser.js","../node_modules/asmcrypto.js/asmcrypto.all.es8.js","../node_modules/uuid/dist/esm-browser/rng.js","../node_modules/uuid/dist/esm-browser/regex.js","../node_modules/uuid/dist/esm-browser/validate.js","../node_modules/uuid/dist/esm-browser/stringify.js","../node_modules/uuid/dist/esm-browser/v4.js","../node_modules/isomorphic-ws/browser.js","anchor-link.m.js"],"sourcesContent":["var check = function (it) {\n  return it && it.Math == Math && it;\n};\n\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nmodule.exports =\n  // eslint-disable-next-line es/no-global-this -- safe\n  check(typeof globalThis == 'object' && globalThis) ||\n  check(typeof window == 'object' && window) ||\n  // eslint-disable-next-line no-restricted-globals -- safe\n  check(typeof self == 'object' && self) ||\n  check(typeof global == 'object' && global) ||\n  // eslint-disable-next-line no-new-func -- fallback\n  (function () { return this; })() || Function('return this')();\n","module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (error) {\n    return true;\n  }\n};\n","var fails = require('../internals/fails');\n\n// Detect IE8's incomplete defineProperty implementation\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty({}, 1, { get: function () { return 7; } })[1] != 7;\n});\n","'use strict';\nvar $propertyIsEnumerable = {}.propertyIsEnumerable;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Nashorn ~ JDK8 bug\nvar NASHORN_BUG = getOwnPropertyDescriptor && !$propertyIsEnumerable.call({ 1: 2 }, 1);\n\n// `Object.prototype.propertyIsEnumerable` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.propertyisenumerable\nexports.f = NASHORN_BUG ? function propertyIsEnumerable(V) {\n  var descriptor = getOwnPropertyDescriptor(this, V);\n  return !!descriptor && descriptor.enumerable;\n} : $propertyIsEnumerable;\n","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","var toString = {}.toString;\n\nmodule.exports = function (it) {\n  return toString.call(it).slice(8, -1);\n};\n","var fails = require('../internals/fails');\nvar classof = require('../internals/classof-raw');\n\nvar split = ''.split;\n\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nmodule.exports = fails(function () {\n  // throws an error in rhino, see https://github.com/mozilla/rhino/issues/346\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  return !Object('z').propertyIsEnumerable(0);\n}) ? function (it) {\n  return classof(it) == 'String' ? split.call(it, '') : Object(it);\n} : Object;\n","// `RequireObjectCoercible` abstract operation\n// https://tc39.es/ecma262/#sec-requireobjectcoercible\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n  return it;\n};\n","// toObject with fallback for non-array-like ES3 strings\nvar IndexedObject = require('../internals/indexed-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nmodule.exports = function (it) {\n  return IndexedObject(requireObjectCoercible(it));\n};\n","module.exports = function (it) {\n  return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n","var isObject = require('../internals/is-object');\n\n// `ToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-toprimitive\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (input, PREFERRED_STRING) {\n  if (!isObject(input)) return input;\n  var fn, val;\n  if (PREFERRED_STRING && typeof (fn = input.toString) == 'function' && !isObject(val = fn.call(input))) return val;\n  if (typeof (fn = input.valueOf) == 'function' && !isObject(val = fn.call(input))) return val;\n  if (!PREFERRED_STRING && typeof (fn = input.toString) == 'function' && !isObject(val = fn.call(input))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","var requireObjectCoercible = require('../internals/require-object-coercible');\n\n// `ToObject` abstract operation\n// https://tc39.es/ecma262/#sec-toobject\nmodule.exports = function (argument) {\n  return Object(requireObjectCoercible(argument));\n};\n","var toObject = require('../internals/to-object');\n\nvar hasOwnProperty = {}.hasOwnProperty;\n\nmodule.exports = Object.hasOwn || function hasOwn(it, key) {\n  return hasOwnProperty.call(toObject(it), key);\n};\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar document = global.document;\n// typeof document.createElement is 'object' in old IE\nvar EXISTS = isObject(document) && isObject(document.createElement);\n\nmodule.exports = function (it) {\n  return EXISTS ? document.createElement(it) : {};\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar createElement = require('../internals/document-create-element');\n\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !DESCRIPTORS && !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- requied for testing\n  return Object.defineProperty(createElement('div'), 'a', {\n    get: function () { return 7; }\n  }).a != 7;\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPrimitive = require('../internals/to-primitive');\nvar has = require('../internals/has');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\n\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar $getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptor\nexports.f = DESCRIPTORS ? $getOwnPropertyDescriptor : function getOwnPropertyDescriptor(O, P) {\n  O = toIndexedObject(O);\n  P = toPrimitive(P, true);\n  if (IE8_DOM_DEFINE) try {\n    return $getOwnPropertyDescriptor(O, P);\n  } catch (error) { /* empty */ }\n  if (has(O, P)) return createPropertyDescriptor(!propertyIsEnumerableModule.f.call(O, P), O[P]);\n};\n","var isObject = require('../internals/is-object');\n\nmodule.exports = function (it) {\n  if (!isObject(it)) {\n    throw TypeError(String(it) + ' is not an object');\n  } return it;\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\nvar anObject = require('../internals/an-object');\nvar toPrimitive = require('../internals/to-primitive');\n\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar $defineProperty = Object.defineProperty;\n\n// `Object.defineProperty` method\n// https://tc39.es/ecma262/#sec-object.defineproperty\nexports.f = DESCRIPTORS ? $defineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPrimitive(P, true);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return $defineProperty(O, P, Attributes);\n  } catch (error) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = DESCRIPTORS ? function (object, key, value) {\n  return definePropertyModule.f(object, key, createPropertyDescriptor(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","var global = require('../internals/global');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nmodule.exports = function (key, value) {\n  try {\n    createNonEnumerableProperty(global, key, value);\n  } catch (error) {\n    global[key] = value;\n  } return value;\n};\n","var global = require('../internals/global');\nvar setGlobal = require('../internals/set-global');\n\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || setGlobal(SHARED, {});\n\nmodule.exports = store;\n","var store = require('../internals/shared-store');\n\nvar functionToString = Function.toString;\n\n// this helper broken in `core-js@3.4.1-3.4.4`, so we can't use `shared` helper\nif (typeof store.inspectSource != 'function') {\n  store.inspectSource = function (it) {\n    return functionToString.call(it);\n  };\n}\n\nmodule.exports = store.inspectSource;\n","var global = require('../internals/global');\nvar inspectSource = require('../internals/inspect-source');\n\nvar WeakMap = global.WeakMap;\n\nmodule.exports = typeof WeakMap === 'function' && /native code/.test(inspectSource(WeakMap));\n","var IS_PURE = require('../internals/is-pure');\nvar store = require('../internals/shared-store');\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: '3.13.1',\n  mode: IS_PURE ? 'pure' : 'global',\n  copyright: '© 2021 Denis Pushkarev (zloirock.ru)'\n});\n","var id = 0;\nvar postfix = Math.random();\n\nmodule.exports = function (key) {\n  return 'Symbol(' + String(key === undefined ? '' : key) + ')_' + (++id + postfix).toString(36);\n};\n","var NATIVE_WEAK_MAP = require('../internals/native-weak-map');\nvar global = require('../internals/global');\nvar isObject = require('../internals/is-object');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar objectHas = require('../internals/has');\nvar shared = require('../internals/shared-store');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar OBJECT_ALREADY_INITIALIZED = 'Object already initialized';\nvar WeakMap = global.WeakMap;\nvar set, get, has;\n\nvar enforce = function (it) {\n  return has(it) ? get(it) : set(it, {});\n};\n\nvar getterFor = function (TYPE) {\n  return function (it) {\n    var state;\n    if (!isObject(it) || (state = get(it)).type !== TYPE) {\n      throw TypeError('Incompatible receiver, ' + TYPE + ' required');\n    } return state;\n  };\n};\n\nif (NATIVE_WEAK_MAP || shared.state) {\n  var store = shared.state || (shared.state = new WeakMap());\n  var wmget = store.get;\n  var wmhas = store.has;\n  var wmset = store.set;\n  set = function (it, metadata) {\n    if (wmhas.call(store, it)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    wmset.call(store, it, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return wmget.call(store, it) || {};\n  };\n  has = function (it) {\n    return wmhas.call(store, it);\n  };\n} else {\n  var STATE = sharedKey('state');\n  hiddenKeys[STATE] = true;\n  set = function (it, metadata) {\n    if (objectHas(it, STATE)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    createNonEnumerableProperty(it, STATE, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return objectHas(it, STATE) ? it[STATE] : {};\n  };\n  has = function (it) {\n    return objectHas(it, STATE);\n  };\n}\n\nmodule.exports = {\n  set: set,\n  get: get,\n  has: has,\n  enforce: enforce,\n  getterFor: getterFor\n};\n","var shared = require('../internals/shared');\nvar uid = require('../internals/uid');\n\nvar keys = shared('keys');\n\nmodule.exports = function (key) {\n  return keys[key] || (keys[key] = uid(key));\n};\n","module.exports = {};\n","var global = require('../internals/global');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar has = require('../internals/has');\nvar setGlobal = require('../internals/set-global');\nvar inspectSource = require('../internals/inspect-source');\nvar InternalStateModule = require('../internals/internal-state');\n\nvar getInternalState = InternalStateModule.get;\nvar enforceInternalState = InternalStateModule.enforce;\nvar TEMPLATE = String(String).split('String');\n\n(module.exports = function (O, key, value, options) {\n  var unsafe = options ? !!options.unsafe : false;\n  var simple = options ? !!options.enumerable : false;\n  var noTargetGet = options ? !!options.noTargetGet : false;\n  var state;\n  if (typeof value == 'function') {\n    if (typeof key == 'string' && !has(value, 'name')) {\n      createNonEnumerableProperty(value, 'name', key);\n    }\n    state = enforceInternalState(value);\n    if (!state.source) {\n      state.source = TEMPLATE.join(typeof key == 'string' ? key : '');\n    }\n  }\n  if (O === global) {\n    if (simple) O[key] = value;\n    else setGlobal(key, value);\n    return;\n  } else if (!unsafe) {\n    delete O[key];\n  } else if (!noTargetGet && O[key]) {\n    simple = true;\n  }\n  if (simple) O[key] = value;\n  else createNonEnumerableProperty(O, key, value);\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, 'toString', function toString() {\n  return typeof this == 'function' && getInternalState(this).source || inspectSource(this);\n});\n","var global = require('../internals/global');\n\nmodule.exports = global;\n","var path = require('../internals/path');\nvar global = require('../internals/global');\n\nvar aFunction = function (variable) {\n  return typeof variable == 'function' ? variable : undefined;\n};\n\nmodule.exports = function (namespace, method) {\n  return arguments.length < 2 ? aFunction(path[namespace]) || aFunction(global[namespace])\n    : path[namespace] && path[namespace][method] || global[namespace] && global[namespace][method];\n};\n","var ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `ToInteger` abstract operation\n// https://tc39.es/ecma262/#sec-tointeger\nmodule.exports = function (argument) {\n  return isNaN(argument = +argument) ? 0 : (argument > 0 ? floor : ceil)(argument);\n};\n","var toInteger = require('../internals/to-integer');\n\nvar min = Math.min;\n\n// `ToLength` abstract operation\n// https://tc39.es/ecma262/#sec-tolength\nmodule.exports = function (argument) {\n  return argument > 0 ? min(toInteger(argument), 0x1FFFFFFFFFFFFF) : 0; // 2 ** 53 - 1 == 9007199254740991\n};\n","var toInteger = require('../internals/to-integer');\n\nvar max = Math.max;\nvar min = Math.min;\n\n// Helper for a popular repeating case of the spec:\n// Let integer be ? ToInteger(index).\n// If integer < 0, let result be max((length + integer), 0); else let result be min(integer, length).\nmodule.exports = function (index, length) {\n  var integer = toInteger(index);\n  return integer < 0 ? max(integer + length, 0) : min(integer, length);\n};\n","var toIndexedObject = require('../internals/to-indexed-object');\nvar toLength = require('../internals/to-length');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\n\n// `Array.prototype.{ indexOf, includes }` methods implementation\nvar createMethod = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIndexedObject($this);\n    var length = toLength(O.length);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare -- NaN check\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare -- NaN check\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) {\n      if ((IS_INCLUDES || index in O) && O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.includes` method\n  // https://tc39.es/ecma262/#sec-array.prototype.includes\n  includes: createMethod(true),\n  // `Array.prototype.indexOf` method\n  // https://tc39.es/ecma262/#sec-array.prototype.indexof\n  indexOf: createMethod(false)\n};\n","var has = require('../internals/has');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar indexOf = require('../internals/array-includes').indexOf;\nvar hiddenKeys = require('../internals/hidden-keys');\n\nmodule.exports = function (object, names) {\n  var O = toIndexedObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) !has(hiddenKeys, key) && has(O, key) && result.push(key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (has(O, key = names[i++])) {\n    ~indexOf(result, key) || result.push(key);\n  }\n  return result;\n};\n","// IE8- don't enum bug keys\nmodule.exports = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf'\n];\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\nvar hiddenKeys = enumBugKeys.concat('length', 'prototype');\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.es/ecma262/#sec-object.getownpropertynames\n// eslint-disable-next-line es/no-object-getownpropertynames -- safe\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return internalObjectKeys(O, hiddenKeys);\n};\n","// eslint-disable-next-line es/no-object-getownpropertysymbols -- safe\nexports.f = Object.getOwnPropertySymbols;\n","var getBuiltIn = require('../internals/get-built-in');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar anObject = require('../internals/an-object');\n\n// all object keys, includes non-enumerable and symbols\nmodule.exports = getBuiltIn('Reflect', 'ownKeys') || function ownKeys(it) {\n  var keys = getOwnPropertyNamesModule.f(anObject(it));\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  return getOwnPropertySymbols ? keys.concat(getOwnPropertySymbols(it)) : keys;\n};\n","var global = require('../internals/global');\nvar userAgent = require('../internals/engine-user-agent');\n\nvar process = global.process;\nvar versions = process && process.versions;\nvar v8 = versions && versions.v8;\nvar match, version;\n\nif (v8) {\n  match = v8.split('.');\n  version = match[0] < 4 ? 1 : match[0] + match[1];\n} else if (userAgent) {\n  match = userAgent.match(/Edge\\/(\\d+)/);\n  if (!match || match[1] >= 74) {\n    match = userAgent.match(/Chrome\\/(\\d+)/);\n    if (match) version = match[1];\n  }\n}\n\nmodule.exports = version && +version;\n","var has = require('../internals/has');\nvar ownKeys = require('../internals/own-keys');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\n\nmodule.exports = function (target, source) {\n  var keys = ownKeys(source);\n  var defineProperty = definePropertyModule.f;\n  var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    if (!has(target, key)) defineProperty(target, key, getOwnPropertyDescriptor(source, key));\n  }\n};\n","var fails = require('../internals/fails');\n\nvar replacement = /#|\\.prototype\\./;\n\nvar isForced = function (feature, detection) {\n  var value = data[normalize(feature)];\n  return value == POLYFILL ? true\n    : value == NATIVE ? false\n    : typeof detection == 'function' ? fails(detection)\n    : !!detection;\n};\n\nvar normalize = isForced.normalize = function (string) {\n  return String(string).replace(replacement, '.').toLowerCase();\n};\n\nvar data = isForced.data = {};\nvar NATIVE = isForced.NATIVE = 'N';\nvar POLYFILL = isForced.POLYFILL = 'P';\n\nmodule.exports = isForced;\n","var global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar setGlobal = require('../internals/set-global');\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\nvar isForced = require('../internals/is-forced');\n\n/*\n  options.target      - name of the target object\n  options.global      - target is the global object\n  options.stat        - export as static methods of target\n  options.proto       - export as prototype methods of target\n  options.real        - real prototype method for the `pure` version\n  options.forced      - export even if the native feature is available\n  options.bind        - bind methods to the target, required for the `pure` version\n  options.wrap        - wrap constructors to preventing global pollution, required for the `pure` version\n  options.unsafe      - use the simple assignment of property instead of delete + defineProperty\n  options.sham        - add a flag to not completely full polyfills\n  options.enumerable  - export as enumerable property\n  options.noTargetGet - prevent calling a getter on target\n*/\nmodule.exports = function (options, source) {\n  var TARGET = options.target;\n  var GLOBAL = options.global;\n  var STATIC = options.stat;\n  var FORCED, target, key, targetProperty, sourceProperty, descriptor;\n  if (GLOBAL) {\n    target = global;\n  } else if (STATIC) {\n    target = global[TARGET] || setGlobal(TARGET, {});\n  } else {\n    target = (global[TARGET] || {}).prototype;\n  }\n  if (target) for (key in source) {\n    sourceProperty = source[key];\n    if (options.noTargetGet) {\n      descriptor = getOwnPropertyDescriptor(target, key);\n      targetProperty = descriptor && descriptor.value;\n    } else targetProperty = target[key];\n    FORCED = isForced(GLOBAL ? key : TARGET + (STATIC ? '.' : '#') + key, options.forced);\n    // contained in target\n    if (!FORCED && targetProperty !== undefined) {\n      if (typeof sourceProperty === typeof targetProperty) continue;\n      copyConstructorProperties(sourceProperty, targetProperty);\n    }\n    // add a flag to not completely full polyfills\n    if (options.sham || (targetProperty && targetProperty.sham)) {\n      createNonEnumerableProperty(sourceProperty, 'sham', true);\n    }\n    // extend global\n    redefine(target, key, sourceProperty, options);\n  }\n};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('navigator', 'userAgent') || '';\n","var anObject = require('../internals/an-object');\nvar defineProperties = require('../internals/object-define-properties');\nvar enumBugKeys = require('../internals/enum-bug-keys');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar html = require('../internals/html');\nvar documentCreateElement = require('../internals/document-create-element');\nvar sharedKey = require('../internals/shared-key');\n\nvar GT = '>';\nvar LT = '<';\nvar PROTOTYPE = 'prototype';\nvar SCRIPT = 'script';\nvar IE_PROTO = sharedKey('IE_PROTO');\n\nvar EmptyConstructor = function () { /* empty */ };\n\nvar scriptTag = function (content) {\n  return LT + SCRIPT + GT + content + LT + '/' + SCRIPT + GT;\n};\n\n// Create object with fake `null` prototype: use ActiveX Object with cleared prototype\nvar NullProtoObjectViaActiveX = function (activeXDocument) {\n  activeXDocument.write(scriptTag(''));\n  activeXDocument.close();\n  var temp = activeXDocument.parentWindow.Object;\n  activeXDocument = null; // avoid memory leak\n  return temp;\n};\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar NullProtoObjectViaIFrame = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = documentCreateElement('iframe');\n  var JS = 'java' + SCRIPT + ':';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  html.appendChild(iframe);\n  // https://github.com/zloirock/core-js/issues/475\n  iframe.src = String(JS);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(scriptTag('document.F=Object'));\n  iframeDocument.close();\n  return iframeDocument.F;\n};\n\n// Check for document.domain and active x support\n// No need to use active x approach when document.domain is not set\n// see https://github.com/es-shims/es5-shim/issues/150\n// variation of https://github.com/kitcambridge/es5-shim/commit/4f738ac066346\n// avoid IE GC bug\nvar activeXDocument;\nvar NullProtoObject = function () {\n  try {\n    /* global ActiveXObject -- old IE */\n    activeXDocument = document.domain && new ActiveXObject('htmlfile');\n  } catch (error) { /* ignore */ }\n  NullProtoObject = activeXDocument ? NullProtoObjectViaActiveX(activeXDocument) : NullProtoObjectViaIFrame();\n  var length = enumBugKeys.length;\n  while (length--) delete NullProtoObject[PROTOTYPE][enumBugKeys[length]];\n  return NullProtoObject();\n};\n\nhiddenKeys[IE_PROTO] = true;\n\n// `Object.create` method\n// https://tc39.es/ecma262/#sec-object.create\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    EmptyConstructor[PROTOTYPE] = anObject(O);\n    result = new EmptyConstructor();\n    EmptyConstructor[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = NullProtoObject();\n  return Properties === undefined ? result : defineProperties(result, Properties);\n};\n","/* eslint-disable es/no-symbol -- required for testing */\nvar V8_VERSION = require('../internals/engine-v8-version');\nvar fails = require('../internals/fails');\n\n// eslint-disable-next-line es/no-object-getownpropertysymbols -- required for testing\nmodule.exports = !!Object.getOwnPropertySymbols && !fails(function () {\n  var symbol = Symbol();\n  // Chrome 38 Symbol has incorrect toString conversion\n  // `get-own-property-symbols` polyfill symbols converted to object are not Symbol instances\n  return !String(symbol) || !(Object(symbol) instanceof Symbol) ||\n    // Chrome 38-40 symbols are not inherited from DOM collections prototypes to instances\n    !Symbol.sham && V8_VERSION && V8_VERSION < 41;\n});\n","/* eslint-disable es/no-symbol -- required for testing */\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\n\nmodule.exports = NATIVE_SYMBOL\n  && !Symbol.sham\n  && typeof Symbol.iterator == 'symbol';\n","var classof = require('../internals/classof-raw');\n\n// `IsArray` abstract operation\n// https://tc39.es/ecma262/#sec-isarray\n// eslint-disable-next-line es/no-array-isarray -- safe\nmodule.exports = Array.isArray || function isArray(arg) {\n  return classof(arg) == 'Array';\n};\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\n// `Object.keys` method\n// https://tc39.es/ecma262/#sec-object.keys\n// eslint-disable-next-line es/no-object-keys -- safe\nmodule.exports = Object.keys || function keys(O) {\n  return internalObjectKeys(O, enumBugKeys);\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar anObject = require('../internals/an-object');\nvar objectKeys = require('../internals/object-keys');\n\n// `Object.defineProperties` method\n// https://tc39.es/ecma262/#sec-object.defineproperties\n// eslint-disable-next-line es/no-object-defineproperties -- safe\nmodule.exports = DESCRIPTORS ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var keys = objectKeys(Properties);\n  var length = keys.length;\n  var index = 0;\n  var key;\n  while (length > index) definePropertyModule.f(O, key = keys[index++], Properties[key]);\n  return O;\n};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('document', 'documentElement');\n","/* eslint-disable es/no-object-getownpropertynames -- safe */\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar $getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\n\nvar toString = {}.toString;\n\nvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\n  ? Object.getOwnPropertyNames(window) : [];\n\nvar getWindowNames = function (it) {\n  try {\n    return $getOwnPropertyNames(it);\n  } catch (error) {\n    return windowNames.slice();\n  }\n};\n\n// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\nmodule.exports.f = function getOwnPropertyNames(it) {\n  return windowNames && toString.call(it) == '[object Window]'\n    ? getWindowNames(it)\n    : $getOwnPropertyNames(toIndexedObject(it));\n};\n","var global = require('../internals/global');\nvar shared = require('../internals/shared');\nvar has = require('../internals/has');\nvar uid = require('../internals/uid');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar WellKnownSymbolsStore = shared('wks');\nvar Symbol = global.Symbol;\nvar createWellKnownSymbol = USE_SYMBOL_AS_UID ? Symbol : Symbol && Symbol.withoutSetter || uid;\n\nmodule.exports = function (name) {\n  if (!has(WellKnownSymbolsStore, name) || !(NATIVE_SYMBOL || typeof WellKnownSymbolsStore[name] == 'string')) {\n    if (NATIVE_SYMBOL && has(Symbol, name)) {\n      WellKnownSymbolsStore[name] = Symbol[name];\n    } else {\n      WellKnownSymbolsStore[name] = createWellKnownSymbol('Symbol.' + name);\n    }\n  } return WellKnownSymbolsStore[name];\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nexports.f = wellKnownSymbol;\n","var path = require('../internals/path');\nvar has = require('../internals/has');\nvar wrappedWellKnownSymbolModule = require('../internals/well-known-symbol-wrapped');\nvar defineProperty = require('../internals/object-define-property').f;\n\nmodule.exports = function (NAME) {\n  var Symbol = path.Symbol || (path.Symbol = {});\n  if (!has(Symbol, NAME)) defineProperty(Symbol, NAME, {\n    value: wrappedWellKnownSymbolModule.f(NAME)\n  });\n};\n","var defineProperty = require('../internals/object-define-property').f;\nvar has = require('../internals/has');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\n\nmodule.exports = function (it, TAG, STATIC) {\n  if (it && !has(it = STATIC ? it : it.prototype, TO_STRING_TAG)) {\n    defineProperty(it, TO_STRING_TAG, { configurable: true, value: TAG });\n  }\n};\n","module.exports = function (it) {\n  if (typeof it != 'function') {\n    throw TypeError(String(it) + ' is not a function');\n  } return it;\n};\n","var aFunction = require('../internals/a-function');\n\n// optional / simple context binding\nmodule.exports = function (fn, that, length) {\n  aFunction(fn);\n  if (that === undefined) return fn;\n  switch (length) {\n    case 0: return function () {\n      return fn.call(that);\n    };\n    case 1: return function (a) {\n      return fn.call(that, a);\n    };\n    case 2: return function (a, b) {\n      return fn.call(that, a, b);\n    };\n    case 3: return function (a, b, c) {\n      return fn.call(that, a, b, c);\n    };\n  }\n  return function (/* ...args */) {\n    return fn.apply(that, arguments);\n  };\n};\n","var isObject = require('../internals/is-object');\nvar isArray = require('../internals/is-array');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar SPECIES = wellKnownSymbol('species');\n\n// `ArraySpeciesCreate` abstract operation\n// https://tc39.es/ecma262/#sec-arrayspeciescreate\nmodule.exports = function (originalArray, length) {\n  var C;\n  if (isArray(originalArray)) {\n    C = originalArray.constructor;\n    // cross-realm fallback\n    if (typeof C == 'function' && (C === Array || isArray(C.prototype))) C = undefined;\n    else if (isObject(C)) {\n      C = C[SPECIES];\n      if (C === null) C = undefined;\n    }\n  } return new (C === undefined ? Array : C)(length === 0 ? 0 : length);\n};\n","var bind = require('../internals/function-bind-context');\nvar IndexedObject = require('../internals/indexed-object');\nvar toObject = require('../internals/to-object');\nvar toLength = require('../internals/to-length');\nvar arraySpeciesCreate = require('../internals/array-species-create');\n\nvar push = [].push;\n\n// `Array.prototype.{ forEach, map, filter, some, every, find, findIndex, filterOut }` methods implementation\nvar createMethod = function (TYPE) {\n  var IS_MAP = TYPE == 1;\n  var IS_FILTER = TYPE == 2;\n  var IS_SOME = TYPE == 3;\n  var IS_EVERY = TYPE == 4;\n  var IS_FIND_INDEX = TYPE == 6;\n  var IS_FILTER_OUT = TYPE == 7;\n  var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\n  return function ($this, callbackfn, that, specificCreate) {\n    var O = toObject($this);\n    var self = IndexedObject(O);\n    var boundFunction = bind(callbackfn, that, 3);\n    var length = toLength(self.length);\n    var index = 0;\n    var create = specificCreate || arraySpeciesCreate;\n    var target = IS_MAP ? create($this, length) : IS_FILTER || IS_FILTER_OUT ? create($this, 0) : undefined;\n    var value, result;\n    for (;length > index; index++) if (NO_HOLES || index in self) {\n      value = self[index];\n      result = boundFunction(value, index, O);\n      if (TYPE) {\n        if (IS_MAP) target[index] = result; // map\n        else if (result) switch (TYPE) {\n          case 3: return true;              // some\n          case 5: return value;             // find\n          case 6: return index;             // findIndex\n          case 2: push.call(target, value); // filter\n        } else switch (TYPE) {\n          case 4: return false;             // every\n          case 7: push.call(target, value); // filterOut\n        }\n      }\n    }\n    return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : target;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.forEach` method\n  // https://tc39.es/ecma262/#sec-array.prototype.foreach\n  forEach: createMethod(0),\n  // `Array.prototype.map` method\n  // https://tc39.es/ecma262/#sec-array.prototype.map\n  map: createMethod(1),\n  // `Array.prototype.filter` method\n  // https://tc39.es/ecma262/#sec-array.prototype.filter\n  filter: createMethod(2),\n  // `Array.prototype.some` method\n  // https://tc39.es/ecma262/#sec-array.prototype.some\n  some: createMethod(3),\n  // `Array.prototype.every` method\n  // https://tc39.es/ecma262/#sec-array.prototype.every\n  every: createMethod(4),\n  // `Array.prototype.find` method\n  // https://tc39.es/ecma262/#sec-array.prototype.find\n  find: createMethod(5),\n  // `Array.prototype.findIndex` method\n  // https://tc39.es/ecma262/#sec-array.prototype.findIndex\n  findIndex: createMethod(6),\n  // `Array.prototype.filterOut` method\n  // https://github.com/tc39/proposal-array-filtering\n  filterOut: createMethod(7)\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar IS_PURE = require('../internals/is-pure');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\nvar fails = require('../internals/fails');\nvar has = require('../internals/has');\nvar isArray = require('../internals/is-array');\nvar isObject = require('../internals/is-object');\nvar anObject = require('../internals/an-object');\nvar toObject = require('../internals/to-object');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPrimitive = require('../internals/to-primitive');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar nativeObjectCreate = require('../internals/object-create');\nvar objectKeys = require('../internals/object-keys');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertyNamesExternal = require('../internals/object-get-own-property-names-external');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar shared = require('../internals/shared');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar uid = require('../internals/uid');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar wrappedWellKnownSymbolModule = require('../internals/well-known-symbol-wrapped');\nvar defineWellKnownSymbol = require('../internals/define-well-known-symbol');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar InternalStateModule = require('../internals/internal-state');\nvar $forEach = require('../internals/array-iteration').forEach;\n\nvar HIDDEN = sharedKey('hidden');\nvar SYMBOL = 'Symbol';\nvar PROTOTYPE = 'prototype';\nvar TO_PRIMITIVE = wellKnownSymbol('toPrimitive');\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(SYMBOL);\nvar ObjectPrototype = Object[PROTOTYPE];\nvar $Symbol = global.Symbol;\nvar $stringify = getBuiltIn('JSON', 'stringify');\nvar nativeGetOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\nvar nativeDefineProperty = definePropertyModule.f;\nvar nativeGetOwnPropertyNames = getOwnPropertyNamesExternal.f;\nvar nativePropertyIsEnumerable = propertyIsEnumerableModule.f;\nvar AllSymbols = shared('symbols');\nvar ObjectPrototypeSymbols = shared('op-symbols');\nvar StringToSymbolRegistry = shared('string-to-symbol-registry');\nvar SymbolToStringRegistry = shared('symbol-to-string-registry');\nvar WellKnownSymbolsStore = shared('wks');\nvar QObject = global.QObject;\n// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\nvar USE_SETTER = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\n\n// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\nvar setSymbolDescriptor = DESCRIPTORS && fails(function () {\n  return nativeObjectCreate(nativeDefineProperty({}, 'a', {\n    get: function () { return nativeDefineProperty(this, 'a', { value: 7 }).a; }\n  })).a != 7;\n}) ? function (O, P, Attributes) {\n  var ObjectPrototypeDescriptor = nativeGetOwnPropertyDescriptor(ObjectPrototype, P);\n  if (ObjectPrototypeDescriptor) delete ObjectPrototype[P];\n  nativeDefineProperty(O, P, Attributes);\n  if (ObjectPrototypeDescriptor && O !== ObjectPrototype) {\n    nativeDefineProperty(ObjectPrototype, P, ObjectPrototypeDescriptor);\n  }\n} : nativeDefineProperty;\n\nvar wrap = function (tag, description) {\n  var symbol = AllSymbols[tag] = nativeObjectCreate($Symbol[PROTOTYPE]);\n  setInternalState(symbol, {\n    type: SYMBOL,\n    tag: tag,\n    description: description\n  });\n  if (!DESCRIPTORS) symbol.description = description;\n  return symbol;\n};\n\nvar isSymbol = USE_SYMBOL_AS_UID ? function (it) {\n  return typeof it == 'symbol';\n} : function (it) {\n  return Object(it) instanceof $Symbol;\n};\n\nvar $defineProperty = function defineProperty(O, P, Attributes) {\n  if (O === ObjectPrototype) $defineProperty(ObjectPrototypeSymbols, P, Attributes);\n  anObject(O);\n  var key = toPrimitive(P, true);\n  anObject(Attributes);\n  if (has(AllSymbols, key)) {\n    if (!Attributes.enumerable) {\n      if (!has(O, HIDDEN)) nativeDefineProperty(O, HIDDEN, createPropertyDescriptor(1, {}));\n      O[HIDDEN][key] = true;\n    } else {\n      if (has(O, HIDDEN) && O[HIDDEN][key]) O[HIDDEN][key] = false;\n      Attributes = nativeObjectCreate(Attributes, { enumerable: createPropertyDescriptor(0, false) });\n    } return setSymbolDescriptor(O, key, Attributes);\n  } return nativeDefineProperty(O, key, Attributes);\n};\n\nvar $defineProperties = function defineProperties(O, Properties) {\n  anObject(O);\n  var properties = toIndexedObject(Properties);\n  var keys = objectKeys(properties).concat($getOwnPropertySymbols(properties));\n  $forEach(keys, function (key) {\n    if (!DESCRIPTORS || $propertyIsEnumerable.call(properties, key)) $defineProperty(O, key, properties[key]);\n  });\n  return O;\n};\n\nvar $create = function create(O, Properties) {\n  return Properties === undefined ? nativeObjectCreate(O) : $defineProperties(nativeObjectCreate(O), Properties);\n};\n\nvar $propertyIsEnumerable = function propertyIsEnumerable(V) {\n  var P = toPrimitive(V, true);\n  var enumerable = nativePropertyIsEnumerable.call(this, P);\n  if (this === ObjectPrototype && has(AllSymbols, P) && !has(ObjectPrototypeSymbols, P)) return false;\n  return enumerable || !has(this, P) || !has(AllSymbols, P) || has(this, HIDDEN) && this[HIDDEN][P] ? enumerable : true;\n};\n\nvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(O, P) {\n  var it = toIndexedObject(O);\n  var key = toPrimitive(P, true);\n  if (it === ObjectPrototype && has(AllSymbols, key) && !has(ObjectPrototypeSymbols, key)) return;\n  var descriptor = nativeGetOwnPropertyDescriptor(it, key);\n  if (descriptor && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key])) {\n    descriptor.enumerable = true;\n  }\n  return descriptor;\n};\n\nvar $getOwnPropertyNames = function getOwnPropertyNames(O) {\n  var names = nativeGetOwnPropertyNames(toIndexedObject(O));\n  var result = [];\n  $forEach(names, function (key) {\n    if (!has(AllSymbols, key) && !has(hiddenKeys, key)) result.push(key);\n  });\n  return result;\n};\n\nvar $getOwnPropertySymbols = function getOwnPropertySymbols(O) {\n  var IS_OBJECT_PROTOTYPE = O === ObjectPrototype;\n  var names = nativeGetOwnPropertyNames(IS_OBJECT_PROTOTYPE ? ObjectPrototypeSymbols : toIndexedObject(O));\n  var result = [];\n  $forEach(names, function (key) {\n    if (has(AllSymbols, key) && (!IS_OBJECT_PROTOTYPE || has(ObjectPrototype, key))) {\n      result.push(AllSymbols[key]);\n    }\n  });\n  return result;\n};\n\n// `Symbol` constructor\n// https://tc39.es/ecma262/#sec-symbol-constructor\nif (!NATIVE_SYMBOL) {\n  $Symbol = function Symbol() {\n    if (this instanceof $Symbol) throw TypeError('Symbol is not a constructor');\n    var description = !arguments.length || arguments[0] === undefined ? undefined : String(arguments[0]);\n    var tag = uid(description);\n    var setter = function (value) {\n      if (this === ObjectPrototype) setter.call(ObjectPrototypeSymbols, value);\n      if (has(this, HIDDEN) && has(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\n      setSymbolDescriptor(this, tag, createPropertyDescriptor(1, value));\n    };\n    if (DESCRIPTORS && USE_SETTER) setSymbolDescriptor(ObjectPrototype, tag, { configurable: true, set: setter });\n    return wrap(tag, description);\n  };\n\n  redefine($Symbol[PROTOTYPE], 'toString', function toString() {\n    return getInternalState(this).tag;\n  });\n\n  redefine($Symbol, 'withoutSetter', function (description) {\n    return wrap(uid(description), description);\n  });\n\n  propertyIsEnumerableModule.f = $propertyIsEnumerable;\n  definePropertyModule.f = $defineProperty;\n  getOwnPropertyDescriptorModule.f = $getOwnPropertyDescriptor;\n  getOwnPropertyNamesModule.f = getOwnPropertyNamesExternal.f = $getOwnPropertyNames;\n  getOwnPropertySymbolsModule.f = $getOwnPropertySymbols;\n\n  wrappedWellKnownSymbolModule.f = function (name) {\n    return wrap(wellKnownSymbol(name), name);\n  };\n\n  if (DESCRIPTORS) {\n    // https://github.com/tc39/proposal-Symbol-description\n    nativeDefineProperty($Symbol[PROTOTYPE], 'description', {\n      configurable: true,\n      get: function description() {\n        return getInternalState(this).description;\n      }\n    });\n    if (!IS_PURE) {\n      redefine(ObjectPrototype, 'propertyIsEnumerable', $propertyIsEnumerable, { unsafe: true });\n    }\n  }\n}\n\n$({ global: true, wrap: true, forced: !NATIVE_SYMBOL, sham: !NATIVE_SYMBOL }, {\n  Symbol: $Symbol\n});\n\n$forEach(objectKeys(WellKnownSymbolsStore), function (name) {\n  defineWellKnownSymbol(name);\n});\n\n$({ target: SYMBOL, stat: true, forced: !NATIVE_SYMBOL }, {\n  // `Symbol.for` method\n  // https://tc39.es/ecma262/#sec-symbol.for\n  'for': function (key) {\n    var string = String(key);\n    if (has(StringToSymbolRegistry, string)) return StringToSymbolRegistry[string];\n    var symbol = $Symbol(string);\n    StringToSymbolRegistry[string] = symbol;\n    SymbolToStringRegistry[symbol] = string;\n    return symbol;\n  },\n  // `Symbol.keyFor` method\n  // https://tc39.es/ecma262/#sec-symbol.keyfor\n  keyFor: function keyFor(sym) {\n    if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol');\n    if (has(SymbolToStringRegistry, sym)) return SymbolToStringRegistry[sym];\n  },\n  useSetter: function () { USE_SETTER = true; },\n  useSimple: function () { USE_SETTER = false; }\n});\n\n$({ target: 'Object', stat: true, forced: !NATIVE_SYMBOL, sham: !DESCRIPTORS }, {\n  // `Object.create` method\n  // https://tc39.es/ecma262/#sec-object.create\n  create: $create,\n  // `Object.defineProperty` method\n  // https://tc39.es/ecma262/#sec-object.defineproperty\n  defineProperty: $defineProperty,\n  // `Object.defineProperties` method\n  // https://tc39.es/ecma262/#sec-object.defineproperties\n  defineProperties: $defineProperties,\n  // `Object.getOwnPropertyDescriptor` method\n  // https://tc39.es/ecma262/#sec-object.getownpropertydescriptors\n  getOwnPropertyDescriptor: $getOwnPropertyDescriptor\n});\n\n$({ target: 'Object', stat: true, forced: !NATIVE_SYMBOL }, {\n  // `Object.getOwnPropertyNames` method\n  // https://tc39.es/ecma262/#sec-object.getownpropertynames\n  getOwnPropertyNames: $getOwnPropertyNames,\n  // `Object.getOwnPropertySymbols` method\n  // https://tc39.es/ecma262/#sec-object.getownpropertysymbols\n  getOwnPropertySymbols: $getOwnPropertySymbols\n});\n\n// Chrome 38 and 39 `Object.getOwnPropertySymbols` fails on primitives\n// https://bugs.chromium.org/p/v8/issues/detail?id=3443\n$({ target: 'Object', stat: true, forced: fails(function () { getOwnPropertySymbolsModule.f(1); }) }, {\n  getOwnPropertySymbols: function getOwnPropertySymbols(it) {\n    return getOwnPropertySymbolsModule.f(toObject(it));\n  }\n});\n\n// `JSON.stringify` method behavior with symbols\n// https://tc39.es/ecma262/#sec-json.stringify\nif ($stringify) {\n  var FORCED_JSON_STRINGIFY = !NATIVE_SYMBOL || fails(function () {\n    var symbol = $Symbol();\n    // MS Edge converts symbol values to JSON as {}\n    return $stringify([symbol]) != '[null]'\n      // WebKit converts symbol values to JSON as null\n      || $stringify({ a: symbol }) != '{}'\n      // V8 throws on boxed symbols\n      || $stringify(Object(symbol)) != '{}';\n  });\n\n  $({ target: 'JSON', stat: true, forced: FORCED_JSON_STRINGIFY }, {\n    // eslint-disable-next-line no-unused-vars -- required for `.length`\n    stringify: function stringify(it, replacer, space) {\n      var args = [it];\n      var index = 1;\n      var $replacer;\n      while (arguments.length > index) args.push(arguments[index++]);\n      $replacer = replacer;\n      if (!isObject(replacer) && it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\n      if (!isArray(replacer)) replacer = function (key, value) {\n        if (typeof $replacer == 'function') value = $replacer.call(this, key, value);\n        if (!isSymbol(value)) return value;\n      };\n      args[1] = replacer;\n      return $stringify.apply(null, args);\n    }\n  });\n}\n\n// `Symbol.prototype[@@toPrimitive]` method\n// https://tc39.es/ecma262/#sec-symbol.prototype-@@toprimitive\nif (!$Symbol[PROTOTYPE][TO_PRIMITIVE]) {\n  createNonEnumerableProperty($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);\n}\n// `Symbol.prototype[@@toStringTag]` property\n// https://tc39.es/ecma262/#sec-symbol.prototype-@@tostringtag\nsetToStringTag($Symbol, SYMBOL);\n\nhiddenKeys[HIDDEN] = true;\n","// `Symbol.prototype.description` getter\n// https://tc39.es/ecma262/#sec-symbol.prototype.description\n'use strict';\nvar $ = require('../internals/export');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar has = require('../internals/has');\nvar isObject = require('../internals/is-object');\nvar defineProperty = require('../internals/object-define-property').f;\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\n\nvar NativeSymbol = global.Symbol;\n\nif (DESCRIPTORS && typeof NativeSymbol == 'function' && (!('description' in NativeSymbol.prototype) ||\n  // Safari 12 bug\n  NativeSymbol().description !== undefined\n)) {\n  var EmptyStringDescriptionStore = {};\n  // wrap Symbol constructor for correct work with undefined description\n  var SymbolWrapper = function Symbol() {\n    var description = arguments.length < 1 || arguments[0] === undefined ? undefined : String(arguments[0]);\n    var result = this instanceof SymbolWrapper\n      ? new NativeSymbol(description)\n      // in Edge 13, String(Symbol(undefined)) === 'Symbol(undefined)'\n      : description === undefined ? NativeSymbol() : NativeSymbol(description);\n    if (description === '') EmptyStringDescriptionStore[result] = true;\n    return result;\n  };\n  copyConstructorProperties(SymbolWrapper, NativeSymbol);\n  var symbolPrototype = SymbolWrapper.prototype = NativeSymbol.prototype;\n  symbolPrototype.constructor = SymbolWrapper;\n\n  var symbolToString = symbolPrototype.toString;\n  var native = String(NativeSymbol('test')) == 'Symbol(test)';\n  var regexp = /^Symbol\\((.*)\\)[^)]+$/;\n  defineProperty(symbolPrototype, 'description', {\n    configurable: true,\n    get: function description() {\n      var symbol = isObject(this) ? this.valueOf() : this;\n      var string = symbolToString.call(symbol);\n      if (has(EmptyStringDescriptionStore, symbol)) return '';\n      var desc = native ? string.slice(7, -1) : string.replace(regexp, '$1');\n      return desc === '' ? undefined : desc;\n    }\n  });\n\n  $({ global: true, forced: true }, {\n    Symbol: SymbolWrapper\n  });\n}\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar test = {};\n\ntest[TO_STRING_TAG] = 'z';\n\nmodule.exports = String(test) === '[object z]';\n","var TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar classofRaw = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\n// ES3 wrong here\nvar CORRECT_ARGUMENTS = classofRaw(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (error) { /* empty */ }\n};\n\n// getting tag from ES6+ `Object.prototype.toString`\nmodule.exports = TO_STRING_TAG_SUPPORT ? classofRaw : function (it) {\n  var O, tag, result;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (tag = tryGet(O = Object(it), TO_STRING_TAG)) == 'string' ? tag\n    // builtinTag case\n    : CORRECT_ARGUMENTS ? classofRaw(O)\n    // ES3 arguments fallback\n    : (result = classofRaw(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : result;\n};\n","'use strict';\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar classof = require('../internals/classof');\n\n// `Object.prototype.toString` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.tostring\nmodule.exports = TO_STRING_TAG_SUPPORT ? {}.toString : function toString() {\n  return '[object ' + classof(this) + ']';\n};\n","var TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar redefine = require('../internals/redefine');\nvar toString = require('../internals/object-to-string');\n\n// `Object.prototype.toString` method\n// https://tc39.es/ecma262/#sec-object.prototype.tostring\nif (!TO_STRING_TAG_SUPPORT) {\n  redefine(Object.prototype, 'toString', toString, { unsafe: true });\n}\n","var defineWellKnownSymbol = require('../internals/define-well-known-symbol');\n\n// `Symbol.iterator` well-known symbol\n// https://tc39.es/ecma262/#sec-symbol.iterator\ndefineWellKnownSymbol('iterator');\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar create = require('../internals/object-create');\nvar definePropertyModule = require('../internals/object-define-property');\n\nvar UNSCOPABLES = wellKnownSymbol('unscopables');\nvar ArrayPrototype = Array.prototype;\n\n// Array.prototype[@@unscopables]\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\nif (ArrayPrototype[UNSCOPABLES] == undefined) {\n  definePropertyModule.f(ArrayPrototype, UNSCOPABLES, {\n    configurable: true,\n    value: create(null)\n  });\n}\n\n// add a key to Array.prototype[@@unscopables]\nmodule.exports = function (key) {\n  ArrayPrototype[UNSCOPABLES][key] = true;\n};\n","'use strict';\nvar fails = require('../internals/fails');\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar has = require('../internals/has');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_PURE = require('../internals/is-pure');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar BUGGY_SAFARI_ITERATORS = false;\n\nvar returnThis = function () { return this; };\n\n// `%IteratorPrototype%` object\n// https://tc39.es/ecma262/#sec-%iteratorprototype%-object\nvar IteratorPrototype, PrototypeOfArrayIteratorPrototype, arrayIterator;\n\n/* eslint-disable es/no-array-prototype-keys -- safe */\nif ([].keys) {\n  arrayIterator = [].keys();\n  // Safari 8 has buggy iterators w/o `next`\n  if (!('next' in arrayIterator)) BUGGY_SAFARI_ITERATORS = true;\n  else {\n    PrototypeOfArrayIteratorPrototype = getPrototypeOf(getPrototypeOf(arrayIterator));\n    if (PrototypeOfArrayIteratorPrototype !== Object.prototype) IteratorPrototype = PrototypeOfArrayIteratorPrototype;\n  }\n}\n\nvar NEW_ITERATOR_PROTOTYPE = IteratorPrototype == undefined || fails(function () {\n  var test = {};\n  // FF44- legacy iterators case\n  return IteratorPrototype[ITERATOR].call(test) !== test;\n});\n\nif (NEW_ITERATOR_PROTOTYPE) IteratorPrototype = {};\n\n// `%IteratorPrototype%[@@iterator]()` method\n// https://tc39.es/ecma262/#sec-%iteratorprototype%-@@iterator\nif ((!IS_PURE || NEW_ITERATOR_PROTOTYPE) && !has(IteratorPrototype, ITERATOR)) {\n  createNonEnumerableProperty(IteratorPrototype, ITERATOR, returnThis);\n}\n\nmodule.exports = {\n  IteratorPrototype: IteratorPrototype,\n  BUGGY_SAFARI_ITERATORS: BUGGY_SAFARI_ITERATORS\n};\n","module.exports = {};\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  function F() { /* empty */ }\n  F.prototype.constructor = null;\n  // eslint-disable-next-line es/no-object-getprototypeof -- required for testing\n  return Object.getPrototypeOf(new F()) !== F.prototype;\n});\n","var has = require('../internals/has');\nvar toObject = require('../internals/to-object');\nvar sharedKey = require('../internals/shared-key');\nvar CORRECT_PROTOTYPE_GETTER = require('../internals/correct-prototype-getter');\n\nvar IE_PROTO = sharedKey('IE_PROTO');\nvar ObjectPrototype = Object.prototype;\n\n// `Object.getPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.getprototypeof\n// eslint-disable-next-line es/no-object-getprototypeof -- safe\nmodule.exports = CORRECT_PROTOTYPE_GETTER ? Object.getPrototypeOf : function (O) {\n  O = toObject(O);\n  if (has(O, IE_PROTO)) return O[IE_PROTO];\n  if (typeof O.constructor == 'function' && O instanceof O.constructor) {\n    return O.constructor.prototype;\n  } return O instanceof Object ? ObjectPrototype : null;\n};\n","'use strict';\nvar IteratorPrototype = require('../internals/iterators-core').IteratorPrototype;\nvar create = require('../internals/object-create');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar Iterators = require('../internals/iterators');\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (IteratorConstructor, NAME, next) {\n  var TO_STRING_TAG = NAME + ' Iterator';\n  IteratorConstructor.prototype = create(IteratorPrototype, { next: createPropertyDescriptor(1, next) });\n  setToStringTag(IteratorConstructor, TO_STRING_TAG, false, true);\n  Iterators[TO_STRING_TAG] = returnThis;\n  return IteratorConstructor;\n};\n","var isObject = require('../internals/is-object');\n\nmodule.exports = function (it) {\n  if (!isObject(it) && it !== null) {\n    throw TypeError(\"Can't set \" + String(it) + ' as a prototype');\n  } return it;\n};\n","/* eslint-disable no-proto -- safe */\nvar anObject = require('../internals/an-object');\nvar aPossiblePrototype = require('../internals/a-possible-prototype');\n\n// `Object.setPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.setprototypeof\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n// eslint-disable-next-line es/no-object-setprototypeof -- safe\nmodule.exports = Object.setPrototypeOf || ('__proto__' in {} ? function () {\n  var CORRECT_SETTER = false;\n  var test = {};\n  var setter;\n  try {\n    // eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\n    setter = Object.getOwnPropertyDescriptor(Object.prototype, '__proto__').set;\n    setter.call(test, []);\n    CORRECT_SETTER = test instanceof Array;\n  } catch (error) { /* empty */ }\n  return function setPrototypeOf(O, proto) {\n    anObject(O);\n    aPossiblePrototype(proto);\n    if (CORRECT_SETTER) setter.call(O, proto);\n    else O.__proto__ = proto;\n    return O;\n  };\n}() : undefined);\n","'use strict';\nvar $ = require('../internals/export');\nvar createIteratorConstructor = require('../internals/create-iterator-constructor');\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_PURE = require('../internals/is-pure');\nvar Iterators = require('../internals/iterators');\nvar IteratorsCore = require('../internals/iterators-core');\n\nvar IteratorPrototype = IteratorsCore.IteratorPrototype;\nvar BUGGY_SAFARI_ITERATORS = IteratorsCore.BUGGY_SAFARI_ITERATORS;\nvar ITERATOR = wellKnownSymbol('iterator');\nvar KEYS = 'keys';\nvar VALUES = 'values';\nvar ENTRIES = 'entries';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Iterable, NAME, IteratorConstructor, next, DEFAULT, IS_SET, FORCED) {\n  createIteratorConstructor(IteratorConstructor, NAME, next);\n\n  var getIterationMethod = function (KIND) {\n    if (KIND === DEFAULT && defaultIterator) return defaultIterator;\n    if (!BUGGY_SAFARI_ITERATORS && KIND in IterablePrototype) return IterablePrototype[KIND];\n    switch (KIND) {\n      case KEYS: return function keys() { return new IteratorConstructor(this, KIND); };\n      case VALUES: return function values() { return new IteratorConstructor(this, KIND); };\n      case ENTRIES: return function entries() { return new IteratorConstructor(this, KIND); };\n    } return function () { return new IteratorConstructor(this); };\n  };\n\n  var TO_STRING_TAG = NAME + ' Iterator';\n  var INCORRECT_VALUES_NAME = false;\n  var IterablePrototype = Iterable.prototype;\n  var nativeIterator = IterablePrototype[ITERATOR]\n    || IterablePrototype['@@iterator']\n    || DEFAULT && IterablePrototype[DEFAULT];\n  var defaultIterator = !BUGGY_SAFARI_ITERATORS && nativeIterator || getIterationMethod(DEFAULT);\n  var anyNativeIterator = NAME == 'Array' ? IterablePrototype.entries || nativeIterator : nativeIterator;\n  var CurrentIteratorPrototype, methods, KEY;\n\n  // fix native\n  if (anyNativeIterator) {\n    CurrentIteratorPrototype = getPrototypeOf(anyNativeIterator.call(new Iterable()));\n    if (IteratorPrototype !== Object.prototype && CurrentIteratorPrototype.next) {\n      if (!IS_PURE && getPrototypeOf(CurrentIteratorPrototype) !== IteratorPrototype) {\n        if (setPrototypeOf) {\n          setPrototypeOf(CurrentIteratorPrototype, IteratorPrototype);\n        } else if (typeof CurrentIteratorPrototype[ITERATOR] != 'function') {\n          createNonEnumerableProperty(CurrentIteratorPrototype, ITERATOR, returnThis);\n        }\n      }\n      // Set @@toStringTag to native iterators\n      setToStringTag(CurrentIteratorPrototype, TO_STRING_TAG, true, true);\n      if (IS_PURE) Iterators[TO_STRING_TAG] = returnThis;\n    }\n  }\n\n  // fix Array.prototype.{ values, @@iterator }.name in V8 / FF\n  if (DEFAULT == VALUES && nativeIterator && nativeIterator.name !== VALUES) {\n    INCORRECT_VALUES_NAME = true;\n    defaultIterator = function values() { return nativeIterator.call(this); };\n  }\n\n  // define iterator\n  if ((!IS_PURE || FORCED) && IterablePrototype[ITERATOR] !== defaultIterator) {\n    createNonEnumerableProperty(IterablePrototype, ITERATOR, defaultIterator);\n  }\n  Iterators[NAME] = defaultIterator;\n\n  // export additional methods\n  if (DEFAULT) {\n    methods = {\n      values: getIterationMethod(VALUES),\n      keys: IS_SET ? defaultIterator : getIterationMethod(KEYS),\n      entries: getIterationMethod(ENTRIES)\n    };\n    if (FORCED) for (KEY in methods) {\n      if (BUGGY_SAFARI_ITERATORS || INCORRECT_VALUES_NAME || !(KEY in IterablePrototype)) {\n        redefine(IterablePrototype, KEY, methods[KEY]);\n      }\n    } else $({ target: NAME, proto: true, forced: BUGGY_SAFARI_ITERATORS || INCORRECT_VALUES_NAME }, methods);\n  }\n\n  return methods;\n};\n","'use strict';\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar addToUnscopables = require('../internals/add-to-unscopables');\nvar Iterators = require('../internals/iterators');\nvar InternalStateModule = require('../internals/internal-state');\nvar defineIterator = require('../internals/define-iterator');\n\nvar ARRAY_ITERATOR = 'Array Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(ARRAY_ITERATOR);\n\n// `Array.prototype.entries` method\n// https://tc39.es/ecma262/#sec-array.prototype.entries\n// `Array.prototype.keys` method\n// https://tc39.es/ecma262/#sec-array.prototype.keys\n// `Array.prototype.values` method\n// https://tc39.es/ecma262/#sec-array.prototype.values\n// `Array.prototype[@@iterator]` method\n// https://tc39.es/ecma262/#sec-array.prototype-@@iterator\n// `CreateArrayIterator` internal method\n// https://tc39.es/ecma262/#sec-createarrayiterator\nmodule.exports = defineIterator(Array, 'Array', function (iterated, kind) {\n  setInternalState(this, {\n    type: ARRAY_ITERATOR,\n    target: toIndexedObject(iterated), // target\n    index: 0,                          // next index\n    kind: kind                         // kind\n  });\n// `%ArrayIteratorPrototype%.next` method\n// https://tc39.es/ecma262/#sec-%arrayiteratorprototype%.next\n}, function () {\n  var state = getInternalState(this);\n  var target = state.target;\n  var kind = state.kind;\n  var index = state.index++;\n  if (!target || index >= target.length) {\n    state.target = undefined;\n    return { value: undefined, done: true };\n  }\n  if (kind == 'keys') return { value: index, done: false };\n  if (kind == 'values') return { value: target[index], done: false };\n  return { value: [index, target[index]], done: false };\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values%\n// https://tc39.es/ecma262/#sec-createunmappedargumentsobject\n// https://tc39.es/ecma262/#sec-createmappedargumentsobject\nIterators.Arguments = Iterators.Array;\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n","var toInteger = require('../internals/to-integer');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\n// `String.prototype.{ codePointAt, at }` methods implementation\nvar createMethod = function (CONVERT_TO_STRING) {\n  return function ($this, pos) {\n    var S = String(requireObjectCoercible($this));\n    var position = toInteger(pos);\n    var size = S.length;\n    var first, second;\n    if (position < 0 || position >= size) return CONVERT_TO_STRING ? '' : undefined;\n    first = S.charCodeAt(position);\n    return first < 0xD800 || first > 0xDBFF || position + 1 === size\n      || (second = S.charCodeAt(position + 1)) < 0xDC00 || second > 0xDFFF\n        ? CONVERT_TO_STRING ? S.charAt(position) : first\n        : CONVERT_TO_STRING ? S.slice(position, position + 2) : (first - 0xD800 << 10) + (second - 0xDC00) + 0x10000;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.codePointAt` method\n  // https://tc39.es/ecma262/#sec-string.prototype.codepointat\n  codeAt: createMethod(false),\n  // `String.prototype.at` method\n  // https://github.com/mathiasbynens/String.prototype.at\n  charAt: createMethod(true)\n};\n","'use strict';\nvar charAt = require('../internals/string-multibyte').charAt;\nvar InternalStateModule = require('../internals/internal-state');\nvar defineIterator = require('../internals/define-iterator');\n\nvar STRING_ITERATOR = 'String Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(STRING_ITERATOR);\n\n// `String.prototype[@@iterator]` method\n// https://tc39.es/ecma262/#sec-string.prototype-@@iterator\ndefineIterator(String, 'String', function (iterated) {\n  setInternalState(this, {\n    type: STRING_ITERATOR,\n    string: String(iterated),\n    index: 0\n  });\n// `%StringIteratorPrototype%.next` method\n// https://tc39.es/ecma262/#sec-%stringiteratorprototype%.next\n}, function next() {\n  var state = getInternalState(this);\n  var string = state.string;\n  var index = state.index;\n  var point;\n  if (index >= string.length) return { value: undefined, done: true };\n  point = charAt(string, index);\n  state.index += point.length;\n  return { value: point, done: false };\n});\n","// iterable DOM collections\n// flag - `iterable` interface - 'entries', 'keys', 'values', 'forEach' methods\nmodule.exports = {\n  CSSRuleList: 0,\n  CSSStyleDeclaration: 0,\n  CSSValueList: 0,\n  ClientRectList: 0,\n  DOMRectList: 0,\n  DOMStringList: 0,\n  DOMTokenList: 1,\n  DataTransferItemList: 0,\n  FileList: 0,\n  HTMLAllCollection: 0,\n  HTMLCollection: 0,\n  HTMLFormElement: 0,\n  HTMLSelectElement: 0,\n  MediaList: 0,\n  MimeTypeArray: 0,\n  NamedNodeMap: 0,\n  NodeList: 1,\n  PaintRequestList: 0,\n  Plugin: 0,\n  PluginArray: 0,\n  SVGLengthList: 0,\n  SVGNumberList: 0,\n  SVGPathSegList: 0,\n  SVGPointList: 0,\n  SVGStringList: 0,\n  SVGTransformList: 0,\n  SourceBufferList: 0,\n  StyleSheetList: 0,\n  TextTrackCueList: 0,\n  TextTrackList: 0,\n  TouchList: 0\n};\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar ArrayIteratorMethods = require('../modules/es.array.iterator');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar ArrayValues = ArrayIteratorMethods.values;\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  var Collection = global[COLLECTION_NAME];\n  var CollectionPrototype = Collection && Collection.prototype;\n  if (CollectionPrototype) {\n    // some Chrome versions have non-configurable methods on DOMTokenList\n    if (CollectionPrototype[ITERATOR] !== ArrayValues) try {\n      createNonEnumerableProperty(CollectionPrototype, ITERATOR, ArrayValues);\n    } catch (error) {\n      CollectionPrototype[ITERATOR] = ArrayValues;\n    }\n    if (!CollectionPrototype[TO_STRING_TAG]) {\n      createNonEnumerableProperty(CollectionPrototype, TO_STRING_TAG, COLLECTION_NAME);\n    }\n    if (DOMIterables[COLLECTION_NAME]) for (var METHOD_NAME in ArrayIteratorMethods) {\n      // some Chrome versions have non-configurable methods on DOMTokenList\n      if (CollectionPrototype[METHOD_NAME] !== ArrayIteratorMethods[METHOD_NAME]) try {\n        createNonEnumerableProperty(CollectionPrototype, METHOD_NAME, ArrayIteratorMethods[METHOD_NAME]);\n      } catch (error) {\n        CollectionPrototype[METHOD_NAME] = ArrayIteratorMethods[METHOD_NAME];\n      }\n    }\n  }\n}\n","var defineWellKnownSymbol = require('../internals/define-well-known-symbol');\n\n// `Symbol.asyncIterator` well-known symbol\n// https://tc39.es/ecma262/#sec-symbol.asynciterator\ndefineWellKnownSymbol('asyncIterator');\n","var defineWellKnownSymbol = require('../internals/define-well-known-symbol');\n\n// `Symbol.toStringTag` well-known symbol\n// https://tc39.es/ecma262/#sec-symbol.tostringtag\ndefineWellKnownSymbol('toStringTag');\n","var global = require('../internals/global');\nvar setToStringTag = require('../internals/set-to-string-tag');\n\n// JSON[@@toStringTag] property\n// https://tc39.es/ecma262/#sec-json-@@tostringtag\nsetToStringTag(global.JSON, 'JSON', true);\n","var setToStringTag = require('../internals/set-to-string-tag');\n\n// Math[@@toStringTag] property\n// https://tc39.es/ecma262/#sec-math-@@tostringtag\nsetToStringTag(Math, 'Math', true);\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar toObject = require('../internals/to-object');\nvar nativeGetPrototypeOf = require('../internals/object-get-prototype-of');\nvar CORRECT_PROTOTYPE_GETTER = require('../internals/correct-prototype-getter');\n\nvar FAILS_ON_PRIMITIVES = fails(function () { nativeGetPrototypeOf(1); });\n\n// `Object.getPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.getprototypeof\n$({ target: 'Object', stat: true, forced: FAILS_ON_PRIMITIVES, sham: !CORRECT_PROTOTYPE_GETTER }, {\n  getPrototypeOf: function getPrototypeOf(it) {\n    return nativeGetPrototypeOf(toObject(it));\n  }\n});\n\n","var DESCRIPTORS = require('../internals/descriptors');\nvar defineProperty = require('../internals/object-define-property').f;\n\nvar FunctionPrototype = Function.prototype;\nvar FunctionPrototypeToString = FunctionPrototype.toString;\nvar nameRE = /^\\s*function ([^ (]*)/;\nvar NAME = 'name';\n\n// Function instances `.name` property\n// https://tc39.es/ecma262/#sec-function-instances-name\nif (DESCRIPTORS && !(NAME in FunctionPrototype)) {\n  defineProperty(FunctionPrototype, NAME, {\n    configurable: true,\n    get: function () {\n      try {\n        return FunctionPrototypeToString.call(this).match(nameRE)[1];\n      } catch (error) {\n        return '';\n      }\n    }\n  });\n}\n","var global = require('../internals/global');\n\nmodule.exports = global.Promise;\n","var redefine = require('../internals/redefine');\n\nmodule.exports = function (target, src, options) {\n  for (var key in src) redefine(target, key, src[key], options);\n  return target;\n};\n","'use strict';\nvar getBuiltIn = require('../internals/get-built-in');\nvar definePropertyModule = require('../internals/object-define-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar DESCRIPTORS = require('../internals/descriptors');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (CONSTRUCTOR_NAME) {\n  var Constructor = getBuiltIn(CONSTRUCTOR_NAME);\n  var defineProperty = definePropertyModule.f;\n\n  if (DESCRIPTORS && Constructor && !Constructor[SPECIES]) {\n    defineProperty(Constructor, SPECIES, {\n      configurable: true,\n      get: function () { return this; }\n    });\n  }\n};\n","module.exports = function (it, Constructor, name) {\n  if (!(it instanceof Constructor)) {\n    throw TypeError('Incorrect ' + (name ? name + ' ' : '') + 'invocation');\n  } return it;\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar Iterators = require('../internals/iterators');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar ArrayPrototype = Array.prototype;\n\n// check on default Array iterator\nmodule.exports = function (it) {\n  return it !== undefined && (Iterators.Array === it || ArrayPrototype[ITERATOR] === it);\n};\n","var classof = require('../internals/classof');\nvar Iterators = require('../internals/iterators');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\n\nmodule.exports = function (it) {\n  if (it != undefined) return it[ITERATOR]\n    || it['@@iterator']\n    || Iterators[classof(it)];\n};\n","var anObject = require('../internals/an-object');\n\nmodule.exports = function (iterator) {\n  var returnMethod = iterator['return'];\n  if (returnMethod !== undefined) {\n    return anObject(returnMethod.call(iterator)).value;\n  }\n};\n","var anObject = require('../internals/an-object');\nvar isArrayIteratorMethod = require('../internals/is-array-iterator-method');\nvar toLength = require('../internals/to-length');\nvar bind = require('../internals/function-bind-context');\nvar getIteratorMethod = require('../internals/get-iterator-method');\nvar iteratorClose = require('../internals/iterator-close');\n\nvar Result = function (stopped, result) {\n  this.stopped = stopped;\n  this.result = result;\n};\n\nmodule.exports = function (iterable, unboundFunction, options) {\n  var that = options && options.that;\n  var AS_ENTRIES = !!(options && options.AS_ENTRIES);\n  var IS_ITERATOR = !!(options && options.IS_ITERATOR);\n  var INTERRUPTED = !!(options && options.INTERRUPTED);\n  var fn = bind(unboundFunction, that, 1 + AS_ENTRIES + INTERRUPTED);\n  var iterator, iterFn, index, length, result, next, step;\n\n  var stop = function (condition) {\n    if (iterator) iteratorClose(iterator);\n    return new Result(true, condition);\n  };\n\n  var callFn = function (value) {\n    if (AS_ENTRIES) {\n      anObject(value);\n      return INTERRUPTED ? fn(value[0], value[1], stop) : fn(value[0], value[1]);\n    } return INTERRUPTED ? fn(value, stop) : fn(value);\n  };\n\n  if (IS_ITERATOR) {\n    iterator = iterable;\n  } else {\n    iterFn = getIteratorMethod(iterable);\n    if (typeof iterFn != 'function') throw TypeError('Target is not iterable');\n    // optimisation for array iterators\n    if (isArrayIteratorMethod(iterFn)) {\n      for (index = 0, length = toLength(iterable.length); length > index; index++) {\n        result = callFn(iterable[index]);\n        if (result && result instanceof Result) return result;\n      } return new Result(false);\n    }\n    iterator = iterFn.call(iterable);\n  }\n\n  next = iterator.next;\n  while (!(step = next.call(iterator)).done) {\n    try {\n      result = callFn(step.value);\n    } catch (error) {\n      iteratorClose(iterator);\n      throw error;\n    }\n    if (typeof result == 'object' && result && result instanceof Result) return result;\n  } return new Result(false);\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n  var called = 0;\n  var iteratorWithReturn = {\n    next: function () {\n      return { done: !!called++ };\n    },\n    'return': function () {\n      SAFE_CLOSING = true;\n    }\n  };\n  iteratorWithReturn[ITERATOR] = function () {\n    return this;\n  };\n  // eslint-disable-next-line es/no-array-from, no-throw-literal -- required for testing\n  Array.from(iteratorWithReturn, function () { throw 2; });\n} catch (error) { /* empty */ }\n\nmodule.exports = function (exec, SKIP_CLOSING) {\n  if (!SKIP_CLOSING && !SAFE_CLOSING) return false;\n  var ITERATION_SUPPORT = false;\n  try {\n    var object = {};\n    object[ITERATOR] = function () {\n      return {\n        next: function () {\n          return { done: ITERATION_SUPPORT = true };\n        }\n      };\n    };\n    exec(object);\n  } catch (error) { /* empty */ }\n  return ITERATION_SUPPORT;\n};\n","var global = require('../internals/global');\nvar fails = require('../internals/fails');\nvar bind = require('../internals/function-bind-context');\nvar html = require('../internals/html');\nvar createElement = require('../internals/document-create-element');\nvar IS_IOS = require('../internals/engine-is-ios');\nvar IS_NODE = require('../internals/engine-is-node');\n\nvar location = global.location;\nvar set = global.setImmediate;\nvar clear = global.clearImmediate;\nvar process = global.process;\nvar MessageChannel = global.MessageChannel;\nvar Dispatch = global.Dispatch;\nvar counter = 0;\nvar queue = {};\nvar ONREADYSTATECHANGE = 'onreadystatechange';\nvar defer, channel, port;\n\nvar run = function (id) {\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  if (queue.hasOwnProperty(id)) {\n    var fn = queue[id];\n    delete queue[id];\n    fn();\n  }\n};\n\nvar runner = function (id) {\n  return function () {\n    run(id);\n  };\n};\n\nvar listener = function (event) {\n  run(event.data);\n};\n\nvar post = function (id) {\n  // old engines have not location.origin\n  global.postMessage(id + '', location.protocol + '//' + location.host);\n};\n\n// Node.js 0.9+ & IE10+ has setImmediate, otherwise:\nif (!set || !clear) {\n  set = function setImmediate(fn) {\n    var args = [];\n    var i = 1;\n    while (arguments.length > i) args.push(arguments[i++]);\n    queue[++counter] = function () {\n      // eslint-disable-next-line no-new-func -- spec requirement\n      (typeof fn == 'function' ? fn : Function(fn)).apply(undefined, args);\n    };\n    defer(counter);\n    return counter;\n  };\n  clear = function clearImmediate(id) {\n    delete queue[id];\n  };\n  // Node.js 0.8-\n  if (IS_NODE) {\n    defer = function (id) {\n      process.nextTick(runner(id));\n    };\n  // Sphere (JS game engine) Dispatch API\n  } else if (Dispatch && Dispatch.now) {\n    defer = function (id) {\n      Dispatch.now(runner(id));\n    };\n  // Browsers with MessageChannel, includes WebWorkers\n  // except iOS - https://github.com/zloirock/core-js/issues/624\n  } else if (MessageChannel && !IS_IOS) {\n    channel = new MessageChannel();\n    port = channel.port2;\n    channel.port1.onmessage = listener;\n    defer = bind(port.postMessage, port, 1);\n  // Browsers with postMessage, skip WebWorkers\n  // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'\n  } else if (\n    global.addEventListener &&\n    typeof postMessage == 'function' &&\n    !global.importScripts &&\n    location && location.protocol !== 'file:' &&\n    !fails(post)\n  ) {\n    defer = post;\n    global.addEventListener('message', listener, false);\n  // IE8-\n  } else if (ONREADYSTATECHANGE in createElement('script')) {\n    defer = function (id) {\n      html.appendChild(createElement('script'))[ONREADYSTATECHANGE] = function () {\n        html.removeChild(this);\n        run(id);\n      };\n    };\n  // Rest old browsers\n  } else {\n    defer = function (id) {\n      setTimeout(runner(id), 0);\n    };\n  }\n}\n\nmodule.exports = {\n  set: set,\n  clear: clear\n};\n","var anObject = require('../internals/an-object');\nvar aFunction = require('../internals/a-function');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar SPECIES = wellKnownSymbol('species');\n\n// `SpeciesConstructor` abstract operation\n// https://tc39.es/ecma262/#sec-speciesconstructor\nmodule.exports = function (O, defaultConstructor) {\n  var C = anObject(O).constructor;\n  var S;\n  return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? defaultConstructor : aFunction(S);\n};\n","var userAgent = require('../internals/engine-user-agent');\n\nmodule.exports = /(?:iphone|ipod|ipad).*applewebkit/i.test(userAgent);\n","var classof = require('../internals/classof-raw');\nvar global = require('../internals/global');\n\nmodule.exports = classof(global.process) == 'process';\n","var global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar macrotask = require('../internals/task').set;\nvar IS_IOS = require('../internals/engine-is-ios');\nvar IS_WEBOS_WEBKIT = require('../internals/engine-is-webos-webkit');\nvar IS_NODE = require('../internals/engine-is-node');\n\nvar MutationObserver = global.MutationObserver || global.WebKitMutationObserver;\nvar document = global.document;\nvar process = global.process;\nvar Promise = global.Promise;\n// Node.js 11 shows ExperimentalWarning on getting `queueMicrotask`\nvar queueMicrotaskDescriptor = getOwnPropertyDescriptor(global, 'queueMicrotask');\nvar queueMicrotask = queueMicrotaskDescriptor && queueMicrotaskDescriptor.value;\n\nvar flush, head, last, notify, toggle, node, promise, then;\n\n// modern engines have queueMicrotask method\nif (!queueMicrotask) {\n  flush = function () {\n    var parent, fn;\n    if (IS_NODE && (parent = process.domain)) parent.exit();\n    while (head) {\n      fn = head.fn;\n      head = head.next;\n      try {\n        fn();\n      } catch (error) {\n        if (head) notify();\n        else last = undefined;\n        throw error;\n      }\n    } last = undefined;\n    if (parent) parent.enter();\n  };\n\n  // browsers with MutationObserver, except iOS - https://github.com/zloirock/core-js/issues/339\n  // also except WebOS Webkit https://github.com/zloirock/core-js/issues/898\n  if (!IS_IOS && !IS_NODE && !IS_WEBOS_WEBKIT && MutationObserver && document) {\n    toggle = true;\n    node = document.createTextNode('');\n    new MutationObserver(flush).observe(node, { characterData: true });\n    notify = function () {\n      node.data = toggle = !toggle;\n    };\n  // environments with maybe non-completely correct, but existent Promise\n  } else if (Promise && Promise.resolve) {\n    // Promise.resolve without an argument throws an error in LG WebOS 2\n    promise = Promise.resolve(undefined);\n    // workaround of WebKit ~ iOS Safari 10.1 bug\n    promise.constructor = Promise;\n    then = promise.then;\n    notify = function () {\n      then.call(promise, flush);\n    };\n  // Node.js without promises\n  } else if (IS_NODE) {\n    notify = function () {\n      process.nextTick(flush);\n    };\n  // for other environments - macrotask based on:\n  // - setImmediate\n  // - MessageChannel\n  // - window.postMessag\n  // - onreadystatechange\n  // - setTimeout\n  } else {\n    notify = function () {\n      // strange IE + webpack dev server bug - use .call(global)\n      macrotask.call(global, flush);\n    };\n  }\n}\n\nmodule.exports = queueMicrotask || function (fn) {\n  var task = { fn: fn, next: undefined };\n  if (last) last.next = task;\n  if (!head) {\n    head = task;\n    notify();\n  } last = task;\n};\n","var userAgent = require('../internals/engine-user-agent');\n\nmodule.exports = /web0s(?!.*chrome)/i.test(userAgent);\n","'use strict';\nvar aFunction = require('../internals/a-function');\n\nvar PromiseCapability = function (C) {\n  var resolve, reject;\n  this.promise = new C(function ($$resolve, $$reject) {\n    if (resolve !== undefined || reject !== undefined) throw TypeError('Bad Promise constructor');\n    resolve = $$resolve;\n    reject = $$reject;\n  });\n  this.resolve = aFunction(resolve);\n  this.reject = aFunction(reject);\n};\n\n// `NewPromiseCapability` abstract operation\n// https://tc39.es/ecma262/#sec-newpromisecapability\nmodule.exports.f = function (C) {\n  return new PromiseCapability(C);\n};\n","var anObject = require('../internals/an-object');\nvar isObject = require('../internals/is-object');\nvar newPromiseCapability = require('../internals/new-promise-capability');\n\nmodule.exports = function (C, x) {\n  anObject(C);\n  if (isObject(x) && x.constructor === C) return x;\n  var promiseCapability = newPromiseCapability.f(C);\n  var resolve = promiseCapability.resolve;\n  resolve(x);\n  return promiseCapability.promise;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar IS_PURE = require('../internals/is-pure');\nvar global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar NativePromise = require('../internals/native-promise-constructor');\nvar redefine = require('../internals/redefine');\nvar redefineAll = require('../internals/redefine-all');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar setSpecies = require('../internals/set-species');\nvar isObject = require('../internals/is-object');\nvar aFunction = require('../internals/a-function');\nvar anInstance = require('../internals/an-instance');\nvar inspectSource = require('../internals/inspect-source');\nvar iterate = require('../internals/iterate');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\nvar speciesConstructor = require('../internals/species-constructor');\nvar task = require('../internals/task').set;\nvar microtask = require('../internals/microtask');\nvar promiseResolve = require('../internals/promise-resolve');\nvar hostReportErrors = require('../internals/host-report-errors');\nvar newPromiseCapabilityModule = require('../internals/new-promise-capability');\nvar perform = require('../internals/perform');\nvar InternalStateModule = require('../internals/internal-state');\nvar isForced = require('../internals/is-forced');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_BROWSER = require('../internals/engine-is-browser');\nvar IS_NODE = require('../internals/engine-is-node');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar SPECIES = wellKnownSymbol('species');\nvar PROMISE = 'Promise';\nvar getInternalState = InternalStateModule.get;\nvar setInternalState = InternalStateModule.set;\nvar getInternalPromiseState = InternalStateModule.getterFor(PROMISE);\nvar NativePromisePrototype = NativePromise && NativePromise.prototype;\nvar PromiseConstructor = NativePromise;\nvar PromiseConstructorPrototype = NativePromisePrototype;\nvar TypeError = global.TypeError;\nvar document = global.document;\nvar process = global.process;\nvar newPromiseCapability = newPromiseCapabilityModule.f;\nvar newGenericPromiseCapability = newPromiseCapability;\nvar DISPATCH_EVENT = !!(document && document.createEvent && global.dispatchEvent);\nvar NATIVE_REJECTION_EVENT = typeof PromiseRejectionEvent == 'function';\nvar UNHANDLED_REJECTION = 'unhandledrejection';\nvar REJECTION_HANDLED = 'rejectionhandled';\nvar PENDING = 0;\nvar FULFILLED = 1;\nvar REJECTED = 2;\nvar HANDLED = 1;\nvar UNHANDLED = 2;\nvar SUBCLASSING = false;\nvar Internal, OwnPromiseCapability, PromiseWrapper, nativeThen;\n\nvar FORCED = isForced(PROMISE, function () {\n  var GLOBAL_CORE_JS_PROMISE = inspectSource(PromiseConstructor) !== String(PromiseConstructor);\n  // V8 6.6 (Node 10 and Chrome 66) have a bug with resolving custom thenables\n  // https://bugs.chromium.org/p/chromium/issues/detail?id=830565\n  // We can't detect it synchronously, so just check versions\n  if (!GLOBAL_CORE_JS_PROMISE && V8_VERSION === 66) return true;\n  // We need Promise#finally in the pure version for preventing prototype pollution\n  if (IS_PURE && !PromiseConstructorPrototype['finally']) return true;\n  // We can't use @@species feature detection in V8 since it causes\n  // deoptimization and performance degradation\n  // https://github.com/zloirock/core-js/issues/679\n  if (V8_VERSION >= 51 && /native code/.test(PromiseConstructor)) return false;\n  // Detect correctness of subclassing with @@species support\n  var promise = new PromiseConstructor(function (resolve) { resolve(1); });\n  var FakePromise = function (exec) {\n    exec(function () { /* empty */ }, function () { /* empty */ });\n  };\n  var constructor = promise.constructor = {};\n  constructor[SPECIES] = FakePromise;\n  SUBCLASSING = promise.then(function () { /* empty */ }) instanceof FakePromise;\n  if (!SUBCLASSING) return true;\n  // Unhandled rejections tracking support, NodeJS Promise without it fails @@species test\n  return !GLOBAL_CORE_JS_PROMISE && IS_BROWSER && !NATIVE_REJECTION_EVENT;\n});\n\nvar INCORRECT_ITERATION = FORCED || !checkCorrectnessOfIteration(function (iterable) {\n  PromiseConstructor.all(iterable)['catch'](function () { /* empty */ });\n});\n\n// helpers\nvar isThenable = function (it) {\n  var then;\n  return isObject(it) && typeof (then = it.then) == 'function' ? then : false;\n};\n\nvar notify = function (state, isReject) {\n  if (state.notified) return;\n  state.notified = true;\n  var chain = state.reactions;\n  microtask(function () {\n    var value = state.value;\n    var ok = state.state == FULFILLED;\n    var index = 0;\n    // variable length - can't use forEach\n    while (chain.length > index) {\n      var reaction = chain[index++];\n      var handler = ok ? reaction.ok : reaction.fail;\n      var resolve = reaction.resolve;\n      var reject = reaction.reject;\n      var domain = reaction.domain;\n      var result, then, exited;\n      try {\n        if (handler) {\n          if (!ok) {\n            if (state.rejection === UNHANDLED) onHandleUnhandled(state);\n            state.rejection = HANDLED;\n          }\n          if (handler === true) result = value;\n          else {\n            if (domain) domain.enter();\n            result = handler(value); // can throw\n            if (domain) {\n              domain.exit();\n              exited = true;\n            }\n          }\n          if (result === reaction.promise) {\n            reject(TypeError('Promise-chain cycle'));\n          } else if (then = isThenable(result)) {\n            then.call(result, resolve, reject);\n          } else resolve(result);\n        } else reject(value);\n      } catch (error) {\n        if (domain && !exited) domain.exit();\n        reject(error);\n      }\n    }\n    state.reactions = [];\n    state.notified = false;\n    if (isReject && !state.rejection) onUnhandled(state);\n  });\n};\n\nvar dispatchEvent = function (name, promise, reason) {\n  var event, handler;\n  if (DISPATCH_EVENT) {\n    event = document.createEvent('Event');\n    event.promise = promise;\n    event.reason = reason;\n    event.initEvent(name, false, true);\n    global.dispatchEvent(event);\n  } else event = { promise: promise, reason: reason };\n  if (!NATIVE_REJECTION_EVENT && (handler = global['on' + name])) handler(event);\n  else if (name === UNHANDLED_REJECTION) hostReportErrors('Unhandled promise rejection', reason);\n};\n\nvar onUnhandled = function (state) {\n  task.call(global, function () {\n    var promise = state.facade;\n    var value = state.value;\n    var IS_UNHANDLED = isUnhandled(state);\n    var result;\n    if (IS_UNHANDLED) {\n      result = perform(function () {\n        if (IS_NODE) {\n          process.emit('unhandledRejection', value, promise);\n        } else dispatchEvent(UNHANDLED_REJECTION, promise, value);\n      });\n      // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should\n      state.rejection = IS_NODE || isUnhandled(state) ? UNHANDLED : HANDLED;\n      if (result.error) throw result.value;\n    }\n  });\n};\n\nvar isUnhandled = function (state) {\n  return state.rejection !== HANDLED && !state.parent;\n};\n\nvar onHandleUnhandled = function (state) {\n  task.call(global, function () {\n    var promise = state.facade;\n    if (IS_NODE) {\n      process.emit('rejectionHandled', promise);\n    } else dispatchEvent(REJECTION_HANDLED, promise, state.value);\n  });\n};\n\nvar bind = function (fn, state, unwrap) {\n  return function (value) {\n    fn(state, value, unwrap);\n  };\n};\n\nvar internalReject = function (state, value, unwrap) {\n  if (state.done) return;\n  state.done = true;\n  if (unwrap) state = unwrap;\n  state.value = value;\n  state.state = REJECTED;\n  notify(state, true);\n};\n\nvar internalResolve = function (state, value, unwrap) {\n  if (state.done) return;\n  state.done = true;\n  if (unwrap) state = unwrap;\n  try {\n    if (state.facade === value) throw TypeError(\"Promise can't be resolved itself\");\n    var then = isThenable(value);\n    if (then) {\n      microtask(function () {\n        var wrapper = { done: false };\n        try {\n          then.call(value,\n            bind(internalResolve, wrapper, state),\n            bind(internalReject, wrapper, state)\n          );\n        } catch (error) {\n          internalReject(wrapper, error, state);\n        }\n      });\n    } else {\n      state.value = value;\n      state.state = FULFILLED;\n      notify(state, false);\n    }\n  } catch (error) {\n    internalReject({ done: false }, error, state);\n  }\n};\n\n// constructor polyfill\nif (FORCED) {\n  // 25.4.3.1 Promise(executor)\n  PromiseConstructor = function Promise(executor) {\n    anInstance(this, PromiseConstructor, PROMISE);\n    aFunction(executor);\n    Internal.call(this);\n    var state = getInternalState(this);\n    try {\n      executor(bind(internalResolve, state), bind(internalReject, state));\n    } catch (error) {\n      internalReject(state, error);\n    }\n  };\n  PromiseConstructorPrototype = PromiseConstructor.prototype;\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  Internal = function Promise(executor) {\n    setInternalState(this, {\n      type: PROMISE,\n      done: false,\n      notified: false,\n      parent: false,\n      reactions: [],\n      rejection: false,\n      state: PENDING,\n      value: undefined\n    });\n  };\n  Internal.prototype = redefineAll(PromiseConstructorPrototype, {\n    // `Promise.prototype.then` method\n    // https://tc39.es/ecma262/#sec-promise.prototype.then\n    then: function then(onFulfilled, onRejected) {\n      var state = getInternalPromiseState(this);\n      var reaction = newPromiseCapability(speciesConstructor(this, PromiseConstructor));\n      reaction.ok = typeof onFulfilled == 'function' ? onFulfilled : true;\n      reaction.fail = typeof onRejected == 'function' && onRejected;\n      reaction.domain = IS_NODE ? process.domain : undefined;\n      state.parent = true;\n      state.reactions.push(reaction);\n      if (state.state != PENDING) notify(state, false);\n      return reaction.promise;\n    },\n    // `Promise.prototype.catch` method\n    // https://tc39.es/ecma262/#sec-promise.prototype.catch\n    'catch': function (onRejected) {\n      return this.then(undefined, onRejected);\n    }\n  });\n  OwnPromiseCapability = function () {\n    var promise = new Internal();\n    var state = getInternalState(promise);\n    this.promise = promise;\n    this.resolve = bind(internalResolve, state);\n    this.reject = bind(internalReject, state);\n  };\n  newPromiseCapabilityModule.f = newPromiseCapability = function (C) {\n    return C === PromiseConstructor || C === PromiseWrapper\n      ? new OwnPromiseCapability(C)\n      : newGenericPromiseCapability(C);\n  };\n\n  if (!IS_PURE && typeof NativePromise == 'function' && NativePromisePrototype !== Object.prototype) {\n    nativeThen = NativePromisePrototype.then;\n\n    if (!SUBCLASSING) {\n      // make `Promise#then` return a polyfilled `Promise` for native promise-based APIs\n      redefine(NativePromisePrototype, 'then', function then(onFulfilled, onRejected) {\n        var that = this;\n        return new PromiseConstructor(function (resolve, reject) {\n          nativeThen.call(that, resolve, reject);\n        }).then(onFulfilled, onRejected);\n      // https://github.com/zloirock/core-js/issues/640\n      }, { unsafe: true });\n\n      // makes sure that native promise-based APIs `Promise#catch` properly works with patched `Promise#then`\n      redefine(NativePromisePrototype, 'catch', PromiseConstructorPrototype['catch'], { unsafe: true });\n    }\n\n    // make `.constructor === Promise` work for native promise-based APIs\n    try {\n      delete NativePromisePrototype.constructor;\n    } catch (error) { /* empty */ }\n\n    // make `instanceof Promise` work for native promise-based APIs\n    if (setPrototypeOf) {\n      setPrototypeOf(NativePromisePrototype, PromiseConstructorPrototype);\n    }\n  }\n}\n\n$({ global: true, wrap: true, forced: FORCED }, {\n  Promise: PromiseConstructor\n});\n\nsetToStringTag(PromiseConstructor, PROMISE, false, true);\nsetSpecies(PROMISE);\n\nPromiseWrapper = getBuiltIn(PROMISE);\n\n// statics\n$({ target: PROMISE, stat: true, forced: FORCED }, {\n  // `Promise.reject` method\n  // https://tc39.es/ecma262/#sec-promise.reject\n  reject: function reject(r) {\n    var capability = newPromiseCapability(this);\n    capability.reject.call(undefined, r);\n    return capability.promise;\n  }\n});\n\n$({ target: PROMISE, stat: true, forced: IS_PURE || FORCED }, {\n  // `Promise.resolve` method\n  // https://tc39.es/ecma262/#sec-promise.resolve\n  resolve: function resolve(x) {\n    return promiseResolve(IS_PURE && this === PromiseWrapper ? PromiseConstructor : this, x);\n  }\n});\n\n$({ target: PROMISE, stat: true, forced: INCORRECT_ITERATION }, {\n  // `Promise.all` method\n  // https://tc39.es/ecma262/#sec-promise.all\n  all: function all(iterable) {\n    var C = this;\n    var capability = newPromiseCapability(C);\n    var resolve = capability.resolve;\n    var reject = capability.reject;\n    var result = perform(function () {\n      var $promiseResolve = aFunction(C.resolve);\n      var values = [];\n      var counter = 0;\n      var remaining = 1;\n      iterate(iterable, function (promise) {\n        var index = counter++;\n        var alreadyCalled = false;\n        values.push(undefined);\n        remaining++;\n        $promiseResolve.call(C, promise).then(function (value) {\n          if (alreadyCalled) return;\n          alreadyCalled = true;\n          values[index] = value;\n          --remaining || resolve(values);\n        }, reject);\n      });\n      --remaining || resolve(values);\n    });\n    if (result.error) reject(result.value);\n    return capability.promise;\n  },\n  // `Promise.race` method\n  // https://tc39.es/ecma262/#sec-promise.race\n  race: function race(iterable) {\n    var C = this;\n    var capability = newPromiseCapability(C);\n    var reject = capability.reject;\n    var result = perform(function () {\n      var $promiseResolve = aFunction(C.resolve);\n      iterate(iterable, function (promise) {\n        $promiseResolve.call(C, promise).then(capability.resolve, reject);\n      });\n    });\n    if (result.error) reject(result.value);\n    return capability.promise;\n  }\n});\n","var global = require('../internals/global');\n\nmodule.exports = function (a, b) {\n  var console = global.console;\n  if (console && console.error) {\n    arguments.length === 1 ? console.error(a) : console.error(a, b);\n  }\n};\n","module.exports = typeof window == 'object';\n","module.exports = function (exec) {\n  try {\n    return { error: false, value: exec() };\n  } catch (error) {\n    return { error: true, value: error };\n  }\n};\n","'use strict';\nvar anObject = require('../internals/an-object');\n\n// `RegExp.prototype.flags` getter implementation\n// https://tc39.es/ecma262/#sec-get-regexp.prototype.flags\nmodule.exports = function () {\n  var that = anObject(this);\n  var result = '';\n  if (that.global) result += 'g';\n  if (that.ignoreCase) result += 'i';\n  if (that.multiline) result += 'm';\n  if (that.dotAll) result += 's';\n  if (that.unicode) result += 'u';\n  if (that.sticky) result += 'y';\n  return result;\n};\n","'use strict';\nvar redefine = require('../internals/redefine');\nvar anObject = require('../internals/an-object');\nvar fails = require('../internals/fails');\nvar flags = require('../internals/regexp-flags');\n\nvar TO_STRING = 'toString';\nvar RegExpPrototype = RegExp.prototype;\nvar nativeToString = RegExpPrototype[TO_STRING];\n\nvar NOT_GENERIC = fails(function () { return nativeToString.call({ source: 'a', flags: 'b' }) != '/a/b'; });\n// FF44- RegExp#toString has a wrong name\nvar INCORRECT_NAME = nativeToString.name != TO_STRING;\n\n// `RegExp.prototype.toString` method\n// https://tc39.es/ecma262/#sec-regexp.prototype.tostring\nif (NOT_GENERIC || INCORRECT_NAME) {\n  redefine(RegExp.prototype, TO_STRING, function toString() {\n    var R = anObject(this);\n    var p = String(R.source);\n    var rf = R.flags;\n    var f = String(rf === undefined && R instanceof RegExp && !('flags' in RegExpPrototype) ? flags.call(R) : rf);\n    return '/' + p + '/' + f;\n  }, { unsafe: true });\n}\n","'use strict';\nvar fails = require('../internals/fails');\n\nmodule.exports = function (METHOD_NAME, argument) {\n  var method = [][METHOD_NAME];\n  return !!method && fails(function () {\n    // eslint-disable-next-line no-useless-call,no-throw-literal -- required for testing\n    method.call(null, argument || function () { throw 1; }, 1);\n  });\n};\n","'use strict';\nvar $forEach = require('../internals/array-iteration').forEach;\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\n\nvar STRICT_METHOD = arrayMethodIsStrict('forEach');\n\n// `Array.prototype.forEach` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.foreach\nmodule.exports = !STRICT_METHOD ? function forEach(callbackfn /* , thisArg */) {\n  return $forEach(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n// eslint-disable-next-line es/no-array-prototype-foreach -- safe\n} : [].forEach;\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar forEach = require('../internals/array-for-each');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  var Collection = global[COLLECTION_NAME];\n  var CollectionPrototype = Collection && Collection.prototype;\n  // some Chrome versions have non-configurable methods on DOMTokenList\n  if (CollectionPrototype && CollectionPrototype.forEach !== forEach) try {\n    createNonEnumerableProperty(CollectionPrototype, 'forEach', forEach);\n  } catch (error) {\n    CollectionPrototype.forEach = forEach;\n  }\n}\n","'use strict';\nvar toPrimitive = require('../internals/to-primitive');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = function (object, key, value) {\n  var propertyKey = toPrimitive(key);\n  if (propertyKey in object) definePropertyModule.f(object, propertyKey, createPropertyDescriptor(0, value));\n  else object[propertyKey] = value;\n};\n","var fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (METHOD_NAME) {\n  // We can't use this feature detection in V8 since it causes\n  // deoptimization and serious performance degradation\n  // https://github.com/zloirock/core-js/issues/677\n  return V8_VERSION >= 51 || !fails(function () {\n    var array = [];\n    var constructor = array.constructor = {};\n    constructor[SPECIES] = function () {\n      return { foo: 1 };\n    };\n    return array[METHOD_NAME](Boolean).foo !== 1;\n  });\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar isObject = require('../internals/is-object');\nvar isArray = require('../internals/is-array');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar toLength = require('../internals/to-length');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar createProperty = require('../internals/create-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('slice');\n\nvar SPECIES = wellKnownSymbol('species');\nvar nativeSlice = [].slice;\nvar max = Math.max;\n\n// `Array.prototype.slice` method\n// https://tc39.es/ecma262/#sec-array.prototype.slice\n// fallback for not array-like ES3 strings and DOM objects\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  slice: function slice(start, end) {\n    var O = toIndexedObject(this);\n    var length = toLength(O.length);\n    var k = toAbsoluteIndex(start, length);\n    var fin = toAbsoluteIndex(end === undefined ? length : end, length);\n    // inline `ArraySpeciesCreate` for usage native `Array#slice` where it's possible\n    var Constructor, result, n;\n    if (isArray(O)) {\n      Constructor = O.constructor;\n      // cross-realm fallback\n      if (typeof Constructor == 'function' && (Constructor === Array || isArray(Constructor.prototype))) {\n        Constructor = undefined;\n      } else if (isObject(Constructor)) {\n        Constructor = Constructor[SPECIES];\n        if (Constructor === null) Constructor = undefined;\n      }\n      if (Constructor === Array || Constructor === undefined) {\n        return nativeSlice.call(O, k, fin);\n      }\n    }\n    result = new (Constructor === undefined ? Array : Constructor)(max(fin - k, 0));\n    for (n = 0; k < fin; k++, n++) if (k in O) createProperty(result, n, O[k]);\n    result.length = n;\n    return result;\n  }\n});\n","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function define(obj, key, value) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n    return obj[key];\n  }\n  try {\n    // IE 8 has a broken Object.defineProperty that only works on DOM objects.\n    define({}, \"\");\n  } catch (err) {\n    define = function(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunction.displayName = define(\n    GeneratorFunctionPrototype,\n    toStringTagSymbol,\n    \"GeneratorFunction\"\n  );\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      define(prototype, method, function(arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      define(genFun, toStringTagSymbol, \"GeneratorFunction\");\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  define(Gp, toStringTagSymbol, \"Generator\");\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n}\n","var $ = require('../internals/export');\nvar toObject = require('../internals/to-object');\nvar nativeKeys = require('../internals/object-keys');\nvar fails = require('../internals/fails');\n\nvar FAILS_ON_PRIMITIVES = fails(function () { nativeKeys(1); });\n\n// `Object.keys` method\n// https://tc39.es/ecma262/#sec-object.keys\n$({ target: 'Object', stat: true, forced: FAILS_ON_PRIMITIVES }, {\n  keys: function keys(it) {\n    return nativeKeys(toObject(it));\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar IndexedObject = require('../internals/indexed-object');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\n\nvar nativeJoin = [].join;\n\nvar ES3_STRINGS = IndexedObject != Object;\nvar STRICT_METHOD = arrayMethodIsStrict('join', ',');\n\n// `Array.prototype.join` method\n// https://tc39.es/ecma262/#sec-array.prototype.join\n$({ target: 'Array', proto: true, forced: ES3_STRINGS || !STRICT_METHOD }, {\n  join: function join(separator) {\n    return nativeJoin.call(toIndexedObject(this), separator === undefined ? ',' : separator);\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar $map = require('../internals/array-iteration').map;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('map');\n\n// `Array.prototype.map` method\n// https://tc39.es/ecma262/#sec-array.prototype.map\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  map: function map(callbackfn /* , thisArg */) {\n    return $map(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","'use strict';\n\nvar fails = require('./fails');\n\n// babel-minify transpiles RegExp('a', 'y') -> /a/y and it causes SyntaxError,\n// so we use an intermediate function.\nfunction RE(s, f) {\n  return RegExp(s, f);\n}\n\nexports.UNSUPPORTED_Y = fails(function () {\n  // babel-minify transpiles RegExp('a', 'y') -> /a/y and it causes SyntaxError\n  var re = RE('a', 'y');\n  re.lastIndex = 2;\n  return re.exec('abcd') != null;\n});\n\nexports.BROKEN_CARET = fails(function () {\n  // https://bugzilla.mozilla.org/show_bug.cgi?id=773687\n  var re = RE('^r', 'gy');\n  re.lastIndex = 2;\n  return re.exec('str') != null;\n});\n","'use strict';\n/* eslint-disable regexp/no-assertion-capturing-group, regexp/no-empty-group, regexp/no-lazy-ends -- testing */\n/* eslint-disable regexp/no-useless-quantifier -- testing */\nvar regexpFlags = require('./regexp-flags');\nvar stickyHelpers = require('./regexp-sticky-helpers');\nvar shared = require('./shared');\n\nvar nativeExec = RegExp.prototype.exec;\nvar nativeReplace = shared('native-string-replace', String.prototype.replace);\n\nvar patchedExec = nativeExec;\n\nvar UPDATES_LAST_INDEX_WRONG = (function () {\n  var re1 = /a/;\n  var re2 = /b*/g;\n  nativeExec.call(re1, 'a');\n  nativeExec.call(re2, 'a');\n  return re1.lastIndex !== 0 || re2.lastIndex !== 0;\n})();\n\nvar UNSUPPORTED_Y = stickyHelpers.UNSUPPORTED_Y || stickyHelpers.BROKEN_CARET;\n\n// nonparticipating capturing group, copied from es5-shim's String#split patch.\nvar NPCG_INCLUDED = /()??/.exec('')[1] !== undefined;\n\nvar PATCH = UPDATES_LAST_INDEX_WRONG || NPCG_INCLUDED || UNSUPPORTED_Y;\n\nif (PATCH) {\n  patchedExec = function exec(str) {\n    var re = this;\n    var lastIndex, reCopy, match, i;\n    var sticky = UNSUPPORTED_Y && re.sticky;\n    var flags = regexpFlags.call(re);\n    var source = re.source;\n    var charsAdded = 0;\n    var strCopy = str;\n\n    if (sticky) {\n      flags = flags.replace('y', '');\n      if (flags.indexOf('g') === -1) {\n        flags += 'g';\n      }\n\n      strCopy = String(str).slice(re.lastIndex);\n      // Support anchored sticky behavior.\n      if (re.lastIndex > 0 && (!re.multiline || re.multiline && str[re.lastIndex - 1] !== '\\n')) {\n        source = '(?: ' + source + ')';\n        strCopy = ' ' + strCopy;\n        charsAdded++;\n      }\n      // ^(? + rx + ) is needed, in combination with some str slicing, to\n      // simulate the 'y' flag.\n      reCopy = new RegExp('^(?:' + source + ')', flags);\n    }\n\n    if (NPCG_INCLUDED) {\n      reCopy = new RegExp('^' + source + '$(?!\\\\s)', flags);\n    }\n    if (UPDATES_LAST_INDEX_WRONG) lastIndex = re.lastIndex;\n\n    match = nativeExec.call(sticky ? reCopy : re, strCopy);\n\n    if (sticky) {\n      if (match) {\n        match.input = match.input.slice(charsAdded);\n        match[0] = match[0].slice(charsAdded);\n        match.index = re.lastIndex;\n        re.lastIndex += match[0].length;\n      } else re.lastIndex = 0;\n    } else if (UPDATES_LAST_INDEX_WRONG && match) {\n      re.lastIndex = re.global ? match.index + match[0].length : lastIndex;\n    }\n    if (NPCG_INCLUDED && match && match.length > 1) {\n      // Fix browsers whose `exec` methods don't consistently return `undefined`\n      // for NPCG, like IE8. NOTE: This doesn' work for /(.?)?/\n      nativeReplace.call(match[0], reCopy, function () {\n        for (i = 1; i < arguments.length - 2; i++) {\n          if (arguments[i] === undefined) match[i] = undefined;\n        }\n      });\n    }\n\n    return match;\n  };\n}\n\nmodule.exports = patchedExec;\n","'use strict';\nvar $ = require('../internals/export');\nvar exec = require('../internals/regexp-exec');\n\n// `RegExp.prototype.exec` method\n// https://tc39.es/ecma262/#sec-regexp.prototype.exec\n$({ target: 'RegExp', proto: true, forced: /./.exec !== exec }, {\n  exec: exec\n});\n","'use strict';\n// TODO: Remove from `core-js@4` since it's moved to entry points\nrequire('../modules/es.regexp.exec');\nvar redefine = require('../internals/redefine');\nvar regexpExec = require('../internals/regexp-exec');\nvar fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nvar SPECIES = wellKnownSymbol('species');\nvar RegExpPrototype = RegExp.prototype;\n\nvar REPLACE_SUPPORTS_NAMED_GROUPS = !fails(function () {\n  // #replace needs built-in support for named groups.\n  // #match works fine because it just return the exec results, even if it has\n  // a \"grops\" property.\n  var re = /./;\n  re.exec = function () {\n    var result = [];\n    result.groups = { a: '7' };\n    return result;\n  };\n  return ''.replace(re, '$<a>') !== '7';\n});\n\n// IE <= 11 replaces $0 with the whole match, as if it was $&\n// https://stackoverflow.com/questions/6024666/getting-ie-to-replace-a-regex-with-the-literal-string-0\nvar REPLACE_KEEPS_$0 = (function () {\n  // eslint-disable-next-line regexp/prefer-escape-replacement-dollar-char -- required for testing\n  return 'a'.replace(/./, '$0') === '$0';\n})();\n\nvar REPLACE = wellKnownSymbol('replace');\n// Safari <= 13.0.3(?) substitutes nth capture where n>m with an empty string\nvar REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE = (function () {\n  if (/./[REPLACE]) {\n    return /./[REPLACE]('a', '$0') === '';\n  }\n  return false;\n})();\n\n// Chrome 51 has a buggy \"split\" implementation when RegExp#exec !== nativeExec\n// Weex JS has frozen built-in prototypes, so use try / catch wrapper\nvar SPLIT_WORKS_WITH_OVERWRITTEN_EXEC = !fails(function () {\n  // eslint-disable-next-line regexp/no-empty-group -- required for testing\n  var re = /(?:)/;\n  var originalExec = re.exec;\n  re.exec = function () { return originalExec.apply(this, arguments); };\n  var result = 'ab'.split(re);\n  return result.length !== 2 || result[0] !== 'a' || result[1] !== 'b';\n});\n\nmodule.exports = function (KEY, length, exec, sham) {\n  var SYMBOL = wellKnownSymbol(KEY);\n\n  var DELEGATES_TO_SYMBOL = !fails(function () {\n    // String methods call symbol-named RegEp methods\n    var O = {};\n    O[SYMBOL] = function () { return 7; };\n    return ''[KEY](O) != 7;\n  });\n\n  var DELEGATES_TO_EXEC = DELEGATES_TO_SYMBOL && !fails(function () {\n    // Symbol-named RegExp methods call .exec\n    var execCalled = false;\n    var re = /a/;\n\n    if (KEY === 'split') {\n      // We can't use real regex here since it causes deoptimization\n      // and serious performance degradation in V8\n      // https://github.com/zloirock/core-js/issues/306\n      re = {};\n      // RegExp[@@split] doesn't call the regex's exec method, but first creates\n      // a new one. We need to return the patched regex when creating the new one.\n      re.constructor = {};\n      re.constructor[SPECIES] = function () { return re; };\n      re.flags = '';\n      re[SYMBOL] = /./[SYMBOL];\n    }\n\n    re.exec = function () { execCalled = true; return null; };\n\n    re[SYMBOL]('');\n    return !execCalled;\n  });\n\n  if (\n    !DELEGATES_TO_SYMBOL ||\n    !DELEGATES_TO_EXEC ||\n    (KEY === 'replace' && !(\n      REPLACE_SUPPORTS_NAMED_GROUPS &&\n      REPLACE_KEEPS_$0 &&\n      !REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE\n    )) ||\n    (KEY === 'split' && !SPLIT_WORKS_WITH_OVERWRITTEN_EXEC)\n  ) {\n    var nativeRegExpMethod = /./[SYMBOL];\n    var methods = exec(SYMBOL, ''[KEY], function (nativeMethod, regexp, str, arg2, forceStringMethod) {\n      var $exec = regexp.exec;\n      if ($exec === regexpExec || $exec === RegExpPrototype.exec) {\n        if (DELEGATES_TO_SYMBOL && !forceStringMethod) {\n          // The native String method already delegates to @@method (this\n          // polyfilled function), leasing to infinite recursion.\n          // We avoid it by directly calling the native @@method method.\n          return { done: true, value: nativeRegExpMethod.call(regexp, str, arg2) };\n        }\n        return { done: true, value: nativeMethod.call(str, regexp, arg2) };\n      }\n      return { done: false };\n    }, {\n      REPLACE_KEEPS_$0: REPLACE_KEEPS_$0,\n      REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE: REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE\n    });\n    var stringMethod = methods[0];\n    var regexMethod = methods[1];\n\n    redefine(String.prototype, KEY, stringMethod);\n    redefine(RegExpPrototype, SYMBOL, length == 2\n      // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue)\n      // 21.2.5.11 RegExp.prototype[@@split](string, limit)\n      ? function (string, arg) { return regexMethod.call(string, this, arg); }\n      // 21.2.5.6 RegExp.prototype[@@match](string)\n      // 21.2.5.9 RegExp.prototype[@@search](string)\n      : function (string) { return regexMethod.call(string, this); }\n    );\n  }\n\n  if (sham) createNonEnumerableProperty(RegExpPrototype[SYMBOL], 'sham', true);\n};\n","var isObject = require('../internals/is-object');\nvar classof = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar MATCH = wellKnownSymbol('match');\n\n// `IsRegExp` abstract operation\n// https://tc39.es/ecma262/#sec-isregexp\nmodule.exports = function (it) {\n  var isRegExp;\n  return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : classof(it) == 'RegExp');\n};\n","'use strict';\nvar charAt = require('../internals/string-multibyte').charAt;\n\n// `AdvanceStringIndex` abstract operation\n// https://tc39.es/ecma262/#sec-advancestringindex\nmodule.exports = function (S, index, unicode) {\n  return index + (unicode ? charAt(S, index).length : 1);\n};\n","var classof = require('./classof-raw');\nvar regexpExec = require('./regexp-exec');\n\n// `RegExpExec` abstract operation\n// https://tc39.es/ecma262/#sec-regexpexec\nmodule.exports = function (R, S) {\n  var exec = R.exec;\n  if (typeof exec === 'function') {\n    var result = exec.call(R, S);\n    if (typeof result !== 'object') {\n      throw TypeError('RegExp exec method returned something other than an Object or null');\n    }\n    return result;\n  }\n\n  if (classof(R) !== 'RegExp') {\n    throw TypeError('RegExp#exec called on incompatible receiver');\n  }\n\n  return regexpExec.call(R, S);\n};\n\n","'use strict';\nvar fixRegExpWellKnownSymbolLogic = require('../internals/fix-regexp-well-known-symbol-logic');\nvar isRegExp = require('../internals/is-regexp');\nvar anObject = require('../internals/an-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar speciesConstructor = require('../internals/species-constructor');\nvar advanceStringIndex = require('../internals/advance-string-index');\nvar toLength = require('../internals/to-length');\nvar callRegExpExec = require('../internals/regexp-exec-abstract');\nvar regexpExec = require('../internals/regexp-exec');\nvar stickyHelpers = require('../internals/regexp-sticky-helpers');\n\nvar UNSUPPORTED_Y = stickyHelpers.UNSUPPORTED_Y;\nvar arrayPush = [].push;\nvar min = Math.min;\nvar MAX_UINT32 = 0xFFFFFFFF;\n\n// @@split logic\nfixRegExpWellKnownSymbolLogic('split', 2, function (SPLIT, nativeSplit, maybeCallNative) {\n  var internalSplit;\n  if (\n    'abbc'.split(/(b)*/)[1] == 'c' ||\n    // eslint-disable-next-line regexp/no-empty-group -- required for testing\n    'test'.split(/(?:)/, -1).length != 4 ||\n    'ab'.split(/(?:ab)*/).length != 2 ||\n    '.'.split(/(.?)(.?)/).length != 4 ||\n    // eslint-disable-next-line regexp/no-assertion-capturing-group, regexp/no-empty-group -- required for testing\n    '.'.split(/()()/).length > 1 ||\n    ''.split(/.?/).length\n  ) {\n    // based on es5-shim implementation, need to rework it\n    internalSplit = function (separator, limit) {\n      var string = String(requireObjectCoercible(this));\n      var lim = limit === undefined ? MAX_UINT32 : limit >>> 0;\n      if (lim === 0) return [];\n      if (separator === undefined) return [string];\n      // If `separator` is not a regex, use native split\n      if (!isRegExp(separator)) {\n        return nativeSplit.call(string, separator, lim);\n      }\n      var output = [];\n      var flags = (separator.ignoreCase ? 'i' : '') +\n                  (separator.multiline ? 'm' : '') +\n                  (separator.unicode ? 'u' : '') +\n                  (separator.sticky ? 'y' : '');\n      var lastLastIndex = 0;\n      // Make `global` and avoid `lastIndex` issues by working with a copy\n      var separatorCopy = new RegExp(separator.source, flags + 'g');\n      var match, lastIndex, lastLength;\n      while (match = regexpExec.call(separatorCopy, string)) {\n        lastIndex = separatorCopy.lastIndex;\n        if (lastIndex > lastLastIndex) {\n          output.push(string.slice(lastLastIndex, match.index));\n          if (match.length > 1 && match.index < string.length) arrayPush.apply(output, match.slice(1));\n          lastLength = match[0].length;\n          lastLastIndex = lastIndex;\n          if (output.length >= lim) break;\n        }\n        if (separatorCopy.lastIndex === match.index) separatorCopy.lastIndex++; // Avoid an infinite loop\n      }\n      if (lastLastIndex === string.length) {\n        if (lastLength || !separatorCopy.test('')) output.push('');\n      } else output.push(string.slice(lastLastIndex));\n      return output.length > lim ? output.slice(0, lim) : output;\n    };\n  // Chakra, V8\n  } else if ('0'.split(undefined, 0).length) {\n    internalSplit = function (separator, limit) {\n      return separator === undefined && limit === 0 ? [] : nativeSplit.call(this, separator, limit);\n    };\n  } else internalSplit = nativeSplit;\n\n  return [\n    // `String.prototype.split` method\n    // https://tc39.es/ecma262/#sec-string.prototype.split\n    function split(separator, limit) {\n      var O = requireObjectCoercible(this);\n      var splitter = separator == undefined ? undefined : separator[SPLIT];\n      return splitter !== undefined\n        ? splitter.call(separator, O, limit)\n        : internalSplit.call(String(O), separator, limit);\n    },\n    // `RegExp.prototype[@@split]` method\n    // https://tc39.es/ecma262/#sec-regexp.prototype-@@split\n    //\n    // NOTE: This cannot be properly polyfilled in engines that don't support\n    // the 'y' flag.\n    function (regexp, limit) {\n      var res = maybeCallNative(internalSplit, regexp, this, limit, internalSplit !== nativeSplit);\n      if (res.done) return res.value;\n\n      var rx = anObject(regexp);\n      var S = String(this);\n      var C = speciesConstructor(rx, RegExp);\n\n      var unicodeMatching = rx.unicode;\n      var flags = (rx.ignoreCase ? 'i' : '') +\n                  (rx.multiline ? 'm' : '') +\n                  (rx.unicode ? 'u' : '') +\n                  (UNSUPPORTED_Y ? 'g' : 'y');\n\n      // ^(? + rx + ) is needed, in combination with some S slicing, to\n      // simulate the 'y' flag.\n      var splitter = new C(UNSUPPORTED_Y ? '^(?:' + rx.source + ')' : rx, flags);\n      var lim = limit === undefined ? MAX_UINT32 : limit >>> 0;\n      if (lim === 0) return [];\n      if (S.length === 0) return callRegExpExec(splitter, S) === null ? [S] : [];\n      var p = 0;\n      var q = 0;\n      var A = [];\n      while (q < S.length) {\n        splitter.lastIndex = UNSUPPORTED_Y ? 0 : q;\n        var z = callRegExpExec(splitter, UNSUPPORTED_Y ? S.slice(q) : S);\n        var e;\n        if (\n          z === null ||\n          (e = min(toLength(splitter.lastIndex + (UNSUPPORTED_Y ? q : 0)), S.length)) === p\n        ) {\n          q = advanceStringIndex(S, q, unicodeMatching);\n        } else {\n          A.push(S.slice(p, q));\n          if (A.length === lim) return A;\n          for (var i = 1; i <= z.length - 1; i++) {\n            A.push(z[i]);\n            if (A.length === lim) return A;\n          }\n          q = p = e;\n        }\n      }\n      A.push(S.slice(p));\n      return A;\n    }\n  ];\n}, UNSUPPORTED_Y);\n","var requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar quot = /\"/g;\n\n// `CreateHTML` abstract operation\n// https://tc39.es/ecma262/#sec-createhtml\nmodule.exports = function (string, tag, attribute, value) {\n  var S = String(requireObjectCoercible(string));\n  var p1 = '<' + tag;\n  if (attribute !== '') p1 += ' ' + attribute + '=\"' + String(value).replace(quot, '&quot;') + '\"';\n  return p1 + '>' + S + '</' + tag + '>';\n};\n","var fails = require('../internals/fails');\n\n// check the existence of a method, lowercase\n// of a tag and escaping quotes in arguments\nmodule.exports = function (METHOD_NAME) {\n  return fails(function () {\n    var test = ''[METHOD_NAME]('\"');\n    return test !== test.toLowerCase() || test.split('\"').length > 3;\n  });\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar createHTML = require('../internals/create-html');\nvar forcedStringHTMLMethod = require('../internals/string-html-forced');\n\n// `String.prototype.link` method\n// https://tc39.es/ecma262/#sec-string.prototype.link\n$({ target: 'String', proto: true, forced: forcedStringHTMLMethod('link') }, {\n  link: function link(url) {\n    return createHTML(this, 'a', 'href', url);\n  }\n});\n","var toObject = require('../internals/to-object');\n\nvar floor = Math.floor;\nvar replace = ''.replace;\nvar SUBSTITUTION_SYMBOLS = /\\$([$&'`]|\\d{1,2}|<[^>]*>)/g;\nvar SUBSTITUTION_SYMBOLS_NO_NAMED = /\\$([$&'`]|\\d{1,2})/g;\n\n// `GetSubstitution` abstract operation\n// https://tc39.es/ecma262/#sec-getsubstitution\nmodule.exports = function (matched, str, position, captures, namedCaptures, replacement) {\n  var tailPos = position + matched.length;\n  var m = captures.length;\n  var symbols = SUBSTITUTION_SYMBOLS_NO_NAMED;\n  if (namedCaptures !== undefined) {\n    namedCaptures = toObject(namedCaptures);\n    symbols = SUBSTITUTION_SYMBOLS;\n  }\n  return replace.call(replacement, symbols, function (match, ch) {\n    var capture;\n    switch (ch.charAt(0)) {\n      case '$': return '$';\n      case '&': return matched;\n      case '`': return str.slice(0, position);\n      case \"'\": return str.slice(tailPos);\n      case '<':\n        capture = namedCaptures[ch.slice(1, -1)];\n        break;\n      default: // \\d\\d?\n        var n = +ch;\n        if (n === 0) return match;\n        if (n > m) {\n          var f = floor(n / 10);\n          if (f === 0) return match;\n          if (f <= m) return captures[f - 1] === undefined ? ch.charAt(1) : captures[f - 1] + ch.charAt(1);\n          return match;\n        }\n        capture = captures[n - 1];\n    }\n    return capture === undefined ? '' : capture;\n  });\n};\n","'use strict';\nvar fixRegExpWellKnownSymbolLogic = require('../internals/fix-regexp-well-known-symbol-logic');\nvar anObject = require('../internals/an-object');\nvar toLength = require('../internals/to-length');\nvar toInteger = require('../internals/to-integer');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar advanceStringIndex = require('../internals/advance-string-index');\nvar getSubstitution = require('../internals/get-substitution');\nvar regExpExec = require('../internals/regexp-exec-abstract');\n\nvar max = Math.max;\nvar min = Math.min;\n\nvar maybeToString = function (it) {\n  return it === undefined ? it : String(it);\n};\n\n// @@replace logic\nfixRegExpWellKnownSymbolLogic('replace', 2, function (REPLACE, nativeReplace, maybeCallNative, reason) {\n  var REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE = reason.REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE;\n  var REPLACE_KEEPS_$0 = reason.REPLACE_KEEPS_$0;\n  var UNSAFE_SUBSTITUTE = REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE ? '$' : '$0';\n\n  return [\n    // `String.prototype.replace` method\n    // https://tc39.es/ecma262/#sec-string.prototype.replace\n    function replace(searchValue, replaceValue) {\n      var O = requireObjectCoercible(this);\n      var replacer = searchValue == undefined ? undefined : searchValue[REPLACE];\n      return replacer !== undefined\n        ? replacer.call(searchValue, O, replaceValue)\n        : nativeReplace.call(String(O), searchValue, replaceValue);\n    },\n    // `RegExp.prototype[@@replace]` method\n    // https://tc39.es/ecma262/#sec-regexp.prototype-@@replace\n    function (regexp, replaceValue) {\n      if (\n        (!REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE && REPLACE_KEEPS_$0) ||\n        (typeof replaceValue === 'string' && replaceValue.indexOf(UNSAFE_SUBSTITUTE) === -1)\n      ) {\n        var res = maybeCallNative(nativeReplace, regexp, this, replaceValue);\n        if (res.done) return res.value;\n      }\n\n      var rx = anObject(regexp);\n      var S = String(this);\n\n      var functionalReplace = typeof replaceValue === 'function';\n      if (!functionalReplace) replaceValue = String(replaceValue);\n\n      var global = rx.global;\n      if (global) {\n        var fullUnicode = rx.unicode;\n        rx.lastIndex = 0;\n      }\n      var results = [];\n      while (true) {\n        var result = regExpExec(rx, S);\n        if (result === null) break;\n\n        results.push(result);\n        if (!global) break;\n\n        var matchStr = String(result[0]);\n        if (matchStr === '') rx.lastIndex = advanceStringIndex(S, toLength(rx.lastIndex), fullUnicode);\n      }\n\n      var accumulatedResult = '';\n      var nextSourcePosition = 0;\n      for (var i = 0; i < results.length; i++) {\n        result = results[i];\n\n        var matched = String(result[0]);\n        var position = max(min(toInteger(result.index), S.length), 0);\n        var captures = [];\n        // NOTE: This is equivalent to\n        //   captures = result.slice(1).map(maybeToString)\n        // but for some reason `nativeSlice.call(result, 1, result.length)` (called in\n        // the slice polyfill when slicing native arrays) \"doesn't work\" in safari 9 and\n        // causes a crash (https://pastebin.com/N21QzeQA) when trying to debug it.\n        for (var j = 1; j < result.length; j++) captures.push(maybeToString(result[j]));\n        var namedCaptures = result.groups;\n        if (functionalReplace) {\n          var replacerArgs = [matched].concat(captures, position, S);\n          if (namedCaptures !== undefined) replacerArgs.push(namedCaptures);\n          var replacement = String(replaceValue.apply(undefined, replacerArgs));\n        } else {\n          replacement = getSubstitution(matched, S, position, captures, namedCaptures, replaceValue);\n        }\n        if (position >= nextSourcePosition) {\n          accumulatedResult += S.slice(nextSourcePosition, position) + replacement;\n          nextSourcePosition = position + matched.length;\n        }\n      }\n      return accumulatedResult + S.slice(nextSourcePosition);\n    }\n  ];\n});\n","// a string of all valid unicode whitespaces\nmodule.exports = '\\u0009\\u000A\\u000B\\u000C\\u000D\\u0020\\u00A0\\u1680\\u2000\\u2001\\u2002' +\n  '\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028\\u2029\\uFEFF';\n","var requireObjectCoercible = require('../internals/require-object-coercible');\nvar whitespaces = require('../internals/whitespaces');\n\nvar whitespace = '[' + whitespaces + ']';\nvar ltrim = RegExp('^' + whitespace + whitespace + '*');\nvar rtrim = RegExp(whitespace + whitespace + '*$');\n\n// `String.prototype.{ trim, trimStart, trimEnd, trimLeft, trimRight }` methods implementation\nvar createMethod = function (TYPE) {\n  return function ($this) {\n    var string = String(requireObjectCoercible($this));\n    if (TYPE & 1) string = string.replace(ltrim, '');\n    if (TYPE & 2) string = string.replace(rtrim, '');\n    return string;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.{ trimLeft, trimStart }` methods\n  // https://tc39.es/ecma262/#sec-string.prototype.trimstart\n  start: createMethod(1),\n  // `String.prototype.{ trimRight, trimEnd }` methods\n  // https://tc39.es/ecma262/#sec-string.prototype.trimend\n  end: createMethod(2),\n  // `String.prototype.trim` method\n  // https://tc39.es/ecma262/#sec-string.prototype.trim\n  trim: createMethod(3)\n};\n","var fails = require('../internals/fails');\nvar whitespaces = require('../internals/whitespaces');\n\nvar non = '\\u200B\\u0085\\u180E';\n\n// check that a method works with the correct list\n// of whitespaces and has a correct name\nmodule.exports = function (METHOD_NAME) {\n  return fails(function () {\n    return !!whitespaces[METHOD_NAME]() || non[METHOD_NAME]() != non || whitespaces[METHOD_NAME].name !== METHOD_NAME;\n  });\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar $trim = require('../internals/string-trim').trim;\nvar forcedStringTrimMethod = require('../internals/string-trim-forced');\n\n// `String.prototype.trim` method\n// https://tc39.es/ecma262/#sec-string.prototype.trim\n$({ target: 'String', proto: true, forced: forcedStringTrimMethod('trim') }, {\n  trim: function trim() {\n    return $trim(this);\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar isArray = require('../internals/is-array');\nvar isObject = require('../internals/is-object');\nvar toObject = require('../internals/to-object');\nvar toLength = require('../internals/to-length');\nvar createProperty = require('../internals/create-property');\nvar arraySpeciesCreate = require('../internals/array-species-create');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar IS_CONCAT_SPREADABLE = wellKnownSymbol('isConcatSpreadable');\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;\nvar MAXIMUM_ALLOWED_INDEX_EXCEEDED = 'Maximum allowed index exceeded';\n\n// We can't use this feature detection in V8 since it causes\n// deoptimization and serious performance degradation\n// https://github.com/zloirock/core-js/issues/679\nvar IS_CONCAT_SPREADABLE_SUPPORT = V8_VERSION >= 51 || !fails(function () {\n  var array = [];\n  array[IS_CONCAT_SPREADABLE] = false;\n  return array.concat()[0] !== array;\n});\n\nvar SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('concat');\n\nvar isConcatSpreadable = function (O) {\n  if (!isObject(O)) return false;\n  var spreadable = O[IS_CONCAT_SPREADABLE];\n  return spreadable !== undefined ? !!spreadable : isArray(O);\n};\n\nvar FORCED = !IS_CONCAT_SPREADABLE_SUPPORT || !SPECIES_SUPPORT;\n\n// `Array.prototype.concat` method\n// https://tc39.es/ecma262/#sec-array.prototype.concat\n// with adding support of @@isConcatSpreadable and @@species\n$({ target: 'Array', proto: true, forced: FORCED }, {\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  concat: function concat(arg) {\n    var O = toObject(this);\n    var A = arraySpeciesCreate(O, 0);\n    var n = 0;\n    var i, k, length, len, E;\n    for (i = -1, length = arguments.length; i < length; i++) {\n      E = i === -1 ? O : arguments[i];\n      if (isConcatSpreadable(E)) {\n        len = toLength(E.length);\n        if (n + len > MAX_SAFE_INTEGER) throw TypeError(MAXIMUM_ALLOWED_INDEX_EXCEEDED);\n        for (k = 0; k < len; k++, n++) if (k in E) createProperty(A, n, E[k]);\n      } else {\n        if (n >= MAX_SAFE_INTEGER) throw TypeError(MAXIMUM_ALLOWED_INDEX_EXCEEDED);\n        createProperty(A, n++, E);\n      }\n    }\n    A.length = n;\n    return A;\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar $includes = require('../internals/array-includes').includes;\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\n// `Array.prototype.includes` method\n// https://tc39.es/ecma262/#sec-array.prototype.includes\n$({ target: 'Array', proto: true }, {\n  includes: function includes(el /* , fromIndex = 0 */) {\n    return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('includes');\n","var isRegExp = require('../internals/is-regexp');\n\nmodule.exports = function (it) {\n  if (isRegExp(it)) {\n    throw TypeError(\"The method doesn't accept regular expressions\");\n  } return it;\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar MATCH = wellKnownSymbol('match');\n\nmodule.exports = function (METHOD_NAME) {\n  var regexp = /./;\n  try {\n    '/./'[METHOD_NAME](regexp);\n  } catch (error1) {\n    try {\n      regexp[MATCH] = false;\n      return '/./'[METHOD_NAME](regexp);\n    } catch (error2) { /* empty */ }\n  } return false;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar notARegExp = require('../internals/not-a-regexp');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar correctIsRegExpLogic = require('../internals/correct-is-regexp-logic');\n\n// `String.prototype.includes` method\n// https://tc39.es/ecma262/#sec-string.prototype.includes\n$({ target: 'String', proto: true, forced: !correctIsRegExpLogic('includes') }, {\n  includes: function includes(searchString /* , position = 0 */) {\n    return !!~String(requireObjectCoercible(this))\n      .indexOf(notARegExp(searchString), arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-object-isextensible, es/no-object-preventextensions -- required for testing\n  return Object.isExtensible(Object.preventExtensions({}));\n});\n","var hiddenKeys = require('../internals/hidden-keys');\nvar isObject = require('../internals/is-object');\nvar has = require('../internals/has');\nvar defineProperty = require('../internals/object-define-property').f;\nvar uid = require('../internals/uid');\nvar FREEZING = require('../internals/freezing');\n\nvar METADATA = uid('meta');\nvar id = 0;\n\n// eslint-disable-next-line es/no-object-isextensible -- safe\nvar isExtensible = Object.isExtensible || function () {\n  return true;\n};\n\nvar setMetadata = function (it) {\n  defineProperty(it, METADATA, { value: {\n    objectID: 'O' + ++id, // object ID\n    weakData: {}          // weak collections IDs\n  } });\n};\n\nvar fastKey = function (it, create) {\n  // return a primitive with prefix\n  if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n  if (!has(it, METADATA)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return 'F';\n    // not necessary to add metadata\n    if (!create) return 'E';\n    // add missing metadata\n    setMetadata(it);\n  // return object ID\n  } return it[METADATA].objectID;\n};\n\nvar getWeakData = function (it, create) {\n  if (!has(it, METADATA)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return true;\n    // not necessary to add metadata\n    if (!create) return false;\n    // add missing metadata\n    setMetadata(it);\n  // return the store of weak collections IDs\n  } return it[METADATA].weakData;\n};\n\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n  if (FREEZING && meta.REQUIRED && isExtensible(it) && !has(it, METADATA)) setMetadata(it);\n  return it;\n};\n\nvar meta = module.exports = {\n  REQUIRED: false,\n  fastKey: fastKey,\n  getWeakData: getWeakData,\n  onFreeze: onFreeze\n};\n\nhiddenKeys[METADATA] = true;\n","var isObject = require('../internals/is-object');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\n\n// makes subclassing work correct for wrapped built-ins\nmodule.exports = function ($this, dummy, Wrapper) {\n  var NewTarget, NewTargetPrototype;\n  if (\n    // it can work only with native `setPrototypeOf`\n    setPrototypeOf &&\n    // we haven't completely correct pre-ES6 way for getting `new.target`, so use this\n    typeof (NewTarget = dummy.constructor) == 'function' &&\n    NewTarget !== Wrapper &&\n    isObject(NewTargetPrototype = NewTarget.prototype) &&\n    NewTargetPrototype !== Wrapper.prototype\n  ) setPrototypeOf($this, NewTargetPrototype);\n  return $this;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar InternalMetadataModule = require('../internals/internal-metadata');\nvar iterate = require('../internals/iterate');\nvar anInstance = require('../internals/an-instance');\nvar isObject = require('../internals/is-object');\nvar fails = require('../internals/fails');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar inheritIfRequired = require('../internals/inherit-if-required');\n\nmodule.exports = function (CONSTRUCTOR_NAME, wrapper, common) {\n  var IS_MAP = CONSTRUCTOR_NAME.indexOf('Map') !== -1;\n  var IS_WEAK = CONSTRUCTOR_NAME.indexOf('Weak') !== -1;\n  var ADDER = IS_MAP ? 'set' : 'add';\n  var NativeConstructor = global[CONSTRUCTOR_NAME];\n  var NativePrototype = NativeConstructor && NativeConstructor.prototype;\n  var Constructor = NativeConstructor;\n  var exported = {};\n\n  var fixMethod = function (KEY) {\n    var nativeMethod = NativePrototype[KEY];\n    redefine(NativePrototype, KEY,\n      KEY == 'add' ? function add(value) {\n        nativeMethod.call(this, value === 0 ? 0 : value);\n        return this;\n      } : KEY == 'delete' ? function (key) {\n        return IS_WEAK && !isObject(key) ? false : nativeMethod.call(this, key === 0 ? 0 : key);\n      } : KEY == 'get' ? function get(key) {\n        return IS_WEAK && !isObject(key) ? undefined : nativeMethod.call(this, key === 0 ? 0 : key);\n      } : KEY == 'has' ? function has(key) {\n        return IS_WEAK && !isObject(key) ? false : nativeMethod.call(this, key === 0 ? 0 : key);\n      } : function set(key, value) {\n        nativeMethod.call(this, key === 0 ? 0 : key, value);\n        return this;\n      }\n    );\n  };\n\n  var REPLACE = isForced(\n    CONSTRUCTOR_NAME,\n    typeof NativeConstructor != 'function' || !(IS_WEAK || NativePrototype.forEach && !fails(function () {\n      new NativeConstructor().entries().next();\n    }))\n  );\n\n  if (REPLACE) {\n    // create collection constructor\n    Constructor = common.getConstructor(wrapper, CONSTRUCTOR_NAME, IS_MAP, ADDER);\n    InternalMetadataModule.REQUIRED = true;\n  } else if (isForced(CONSTRUCTOR_NAME, true)) {\n    var instance = new Constructor();\n    // early implementations not supports chaining\n    var HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance;\n    // V8 ~ Chromium 40- weak-collections throws on primitives, but should return false\n    var THROWS_ON_PRIMITIVES = fails(function () { instance.has(1); });\n    // most early implementations doesn't supports iterables, most modern - not close it correctly\n    // eslint-disable-next-line no-new -- required for testing\n    var ACCEPT_ITERABLES = checkCorrectnessOfIteration(function (iterable) { new NativeConstructor(iterable); });\n    // for early implementations -0 and +0 not the same\n    var BUGGY_ZERO = !IS_WEAK && fails(function () {\n      // V8 ~ Chromium 42- fails only with 5+ elements\n      var $instance = new NativeConstructor();\n      var index = 5;\n      while (index--) $instance[ADDER](index, index);\n      return !$instance.has(-0);\n    });\n\n    if (!ACCEPT_ITERABLES) {\n      Constructor = wrapper(function (dummy, iterable) {\n        anInstance(dummy, Constructor, CONSTRUCTOR_NAME);\n        var that = inheritIfRequired(new NativeConstructor(), dummy, Constructor);\n        if (iterable != undefined) iterate(iterable, that[ADDER], { that: that, AS_ENTRIES: IS_MAP });\n        return that;\n      });\n      Constructor.prototype = NativePrototype;\n      NativePrototype.constructor = Constructor;\n    }\n\n    if (THROWS_ON_PRIMITIVES || BUGGY_ZERO) {\n      fixMethod('delete');\n      fixMethod('has');\n      IS_MAP && fixMethod('get');\n    }\n\n    if (BUGGY_ZERO || HASNT_CHAINING) fixMethod(ADDER);\n\n    // weak collections should not contains .clear method\n    if (IS_WEAK && NativePrototype.clear) delete NativePrototype.clear;\n  }\n\n  exported[CONSTRUCTOR_NAME] = Constructor;\n  $({ global: true, forced: Constructor != NativeConstructor }, exported);\n\n  setToStringTag(Constructor, CONSTRUCTOR_NAME);\n\n  if (!IS_WEAK) common.setStrong(Constructor, CONSTRUCTOR_NAME, IS_MAP);\n\n  return Constructor;\n};\n","'use strict';\nvar defineProperty = require('../internals/object-define-property').f;\nvar create = require('../internals/object-create');\nvar redefineAll = require('../internals/redefine-all');\nvar bind = require('../internals/function-bind-context');\nvar anInstance = require('../internals/an-instance');\nvar iterate = require('../internals/iterate');\nvar defineIterator = require('../internals/define-iterator');\nvar setSpecies = require('../internals/set-species');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fastKey = require('../internals/internal-metadata').fastKey;\nvar InternalStateModule = require('../internals/internal-state');\n\nvar setInternalState = InternalStateModule.set;\nvar internalStateGetterFor = InternalStateModule.getterFor;\n\nmodule.exports = {\n  getConstructor: function (wrapper, CONSTRUCTOR_NAME, IS_MAP, ADDER) {\n    var C = wrapper(function (that, iterable) {\n      anInstance(that, C, CONSTRUCTOR_NAME);\n      setInternalState(that, {\n        type: CONSTRUCTOR_NAME,\n        index: create(null),\n        first: undefined,\n        last: undefined,\n        size: 0\n      });\n      if (!DESCRIPTORS) that.size = 0;\n      if (iterable != undefined) iterate(iterable, that[ADDER], { that: that, AS_ENTRIES: IS_MAP });\n    });\n\n    var getInternalState = internalStateGetterFor(CONSTRUCTOR_NAME);\n\n    var define = function (that, key, value) {\n      var state = getInternalState(that);\n      var entry = getEntry(that, key);\n      var previous, index;\n      // change existing entry\n      if (entry) {\n        entry.value = value;\n      // create new entry\n      } else {\n        state.last = entry = {\n          index: index = fastKey(key, true),\n          key: key,\n          value: value,\n          previous: previous = state.last,\n          next: undefined,\n          removed: false\n        };\n        if (!state.first) state.first = entry;\n        if (previous) previous.next = entry;\n        if (DESCRIPTORS) state.size++;\n        else that.size++;\n        // add to index\n        if (index !== 'F') state.index[index] = entry;\n      } return that;\n    };\n\n    var getEntry = function (that, key) {\n      var state = getInternalState(that);\n      // fast case\n      var index = fastKey(key);\n      var entry;\n      if (index !== 'F') return state.index[index];\n      // frozen object case\n      for (entry = state.first; entry; entry = entry.next) {\n        if (entry.key == key) return entry;\n      }\n    };\n\n    redefineAll(C.prototype, {\n      // `{ Map, Set }.prototype.clear()` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.clear\n      // https://tc39.es/ecma262/#sec-set.prototype.clear\n      clear: function clear() {\n        var that = this;\n        var state = getInternalState(that);\n        var data = state.index;\n        var entry = state.first;\n        while (entry) {\n          entry.removed = true;\n          if (entry.previous) entry.previous = entry.previous.next = undefined;\n          delete data[entry.index];\n          entry = entry.next;\n        }\n        state.first = state.last = undefined;\n        if (DESCRIPTORS) state.size = 0;\n        else that.size = 0;\n      },\n      // `{ Map, Set }.prototype.delete(key)` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.delete\n      // https://tc39.es/ecma262/#sec-set.prototype.delete\n      'delete': function (key) {\n        var that = this;\n        var state = getInternalState(that);\n        var entry = getEntry(that, key);\n        if (entry) {\n          var next = entry.next;\n          var prev = entry.previous;\n          delete state.index[entry.index];\n          entry.removed = true;\n          if (prev) prev.next = next;\n          if (next) next.previous = prev;\n          if (state.first == entry) state.first = next;\n          if (state.last == entry) state.last = prev;\n          if (DESCRIPTORS) state.size--;\n          else that.size--;\n        } return !!entry;\n      },\n      // `{ Map, Set }.prototype.forEach(callbackfn, thisArg = undefined)` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.foreach\n      // https://tc39.es/ecma262/#sec-set.prototype.foreach\n      forEach: function forEach(callbackfn /* , that = undefined */) {\n        var state = getInternalState(this);\n        var boundFunction = bind(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3);\n        var entry;\n        while (entry = entry ? entry.next : state.first) {\n          boundFunction(entry.value, entry.key, this);\n          // revert to the last existing entry\n          while (entry && entry.removed) entry = entry.previous;\n        }\n      },\n      // `{ Map, Set}.prototype.has(key)` methods\n      // https://tc39.es/ecma262/#sec-map.prototype.has\n      // https://tc39.es/ecma262/#sec-set.prototype.has\n      has: function has(key) {\n        return !!getEntry(this, key);\n      }\n    });\n\n    redefineAll(C.prototype, IS_MAP ? {\n      // `Map.prototype.get(key)` method\n      // https://tc39.es/ecma262/#sec-map.prototype.get\n      get: function get(key) {\n        var entry = getEntry(this, key);\n        return entry && entry.value;\n      },\n      // `Map.prototype.set(key, value)` method\n      // https://tc39.es/ecma262/#sec-map.prototype.set\n      set: function set(key, value) {\n        return define(this, key === 0 ? 0 : key, value);\n      }\n    } : {\n      // `Set.prototype.add(value)` method\n      // https://tc39.es/ecma262/#sec-set.prototype.add\n      add: function add(value) {\n        return define(this, value = value === 0 ? 0 : value, value);\n      }\n    });\n    if (DESCRIPTORS) defineProperty(C.prototype, 'size', {\n      get: function () {\n        return getInternalState(this).size;\n      }\n    });\n    return C;\n  },\n  setStrong: function (C, CONSTRUCTOR_NAME, IS_MAP) {\n    var ITERATOR_NAME = CONSTRUCTOR_NAME + ' Iterator';\n    var getInternalCollectionState = internalStateGetterFor(CONSTRUCTOR_NAME);\n    var getInternalIteratorState = internalStateGetterFor(ITERATOR_NAME);\n    // `{ Map, Set }.prototype.{ keys, values, entries, @@iterator }()` methods\n    // https://tc39.es/ecma262/#sec-map.prototype.entries\n    // https://tc39.es/ecma262/#sec-map.prototype.keys\n    // https://tc39.es/ecma262/#sec-map.prototype.values\n    // https://tc39.es/ecma262/#sec-map.prototype-@@iterator\n    // https://tc39.es/ecma262/#sec-set.prototype.entries\n    // https://tc39.es/ecma262/#sec-set.prototype.keys\n    // https://tc39.es/ecma262/#sec-set.prototype.values\n    // https://tc39.es/ecma262/#sec-set.prototype-@@iterator\n    defineIterator(C, CONSTRUCTOR_NAME, function (iterated, kind) {\n      setInternalState(this, {\n        type: ITERATOR_NAME,\n        target: iterated,\n        state: getInternalCollectionState(iterated),\n        kind: kind,\n        last: undefined\n      });\n    }, function () {\n      var state = getInternalIteratorState(this);\n      var kind = state.kind;\n      var entry = state.last;\n      // revert to the last existing entry\n      while (entry && entry.removed) entry = entry.previous;\n      // get next entry\n      if (!state.target || !(state.last = entry = entry ? entry.next : state.state.first)) {\n        // or finish the iteration\n        state.target = undefined;\n        return { value: undefined, done: true };\n      }\n      // return step by kind\n      if (kind == 'keys') return { value: entry.key, done: false };\n      if (kind == 'values') return { value: entry.value, done: false };\n      return { value: [entry.key, entry.value], done: false };\n    }, IS_MAP ? 'entries' : 'values', !IS_MAP, true);\n\n    // `{ Map, Set }.prototype[@@species]` accessors\n    // https://tc39.es/ecma262/#sec-get-map-@@species\n    // https://tc39.es/ecma262/#sec-get-set-@@species\n    setSpecies(CONSTRUCTOR_NAME);\n  }\n};\n","'use strict';\nvar collection = require('../internals/collection');\nvar collectionStrong = require('../internals/collection-strong');\n\n// `Map` constructor\n// https://tc39.es/ecma262/#sec-map-objects\nmodule.exports = collection('Map', function (init) {\n  return function Map() { return init(this, arguments.length ? arguments[0] : undefined); };\n}, collectionStrong);\n","'use strict';\nvar $ = require('../internals/export');\nvar $find = require('../internals/array-iteration').find;\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\nvar FIND = 'find';\nvar SKIPS_HOLES = true;\n\n// Shouldn't skip holes\nif (FIND in []) Array(1)[FIND](function () { SKIPS_HOLES = false; });\n\n// `Array.prototype.find` method\n// https://tc39.es/ecma262/#sec-array.prototype.find\n$({ target: 'Array', proto: true, forced: SKIPS_HOLES }, {\n  find: function find(callbackfn /* , that = undefined */) {\n    return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables(FIND);\n","var DESCRIPTORS = require('../internals/descriptors');\nvar objectDefinePropertyModule = require('../internals/object-define-property');\nvar regExpFlags = require('../internals/regexp-flags');\nvar UNSUPPORTED_Y = require('../internals/regexp-sticky-helpers').UNSUPPORTED_Y;\n\n// `RegExp.prototype.flags` getter\n// https://tc39.es/ecma262/#sec-get-regexp.prototype.flags\n// eslint-disable-next-line es/no-regexp-prototype-flags -- required for testing\nif (DESCRIPTORS && (/./g.flags != 'g' || UNSUPPORTED_Y)) {\n  objectDefinePropertyModule.f(RegExp.prototype, 'flags', {\n    configurable: true,\n    get: regExpFlags\n  });\n}\n","'use strict';\nvar $ = require('../internals/export');\nvar $filter = require('../internals/array-iteration').filter;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('filter');\n\n// `Array.prototype.filter` method\n// https://tc39.es/ecma262/#sec-array.prototype.filter\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  filter: function filter(callbackfn /* , thisArg */) {\n    return $filter(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar toLength = require('../internals/to-length');\nvar notARegExp = require('../internals/not-a-regexp');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar correctIsRegExpLogic = require('../internals/correct-is-regexp-logic');\nvar IS_PURE = require('../internals/is-pure');\n\n// eslint-disable-next-line es/no-string-prototype-startswith -- safe\nvar $startsWith = ''.startsWith;\nvar min = Math.min;\n\nvar CORRECT_IS_REGEXP_LOGIC = correctIsRegExpLogic('startsWith');\n// https://github.com/zloirock/core-js/pull/702\nvar MDN_POLYFILL_BUG = !IS_PURE && !CORRECT_IS_REGEXP_LOGIC && !!function () {\n  var descriptor = getOwnPropertyDescriptor(String.prototype, 'startsWith');\n  return descriptor && !descriptor.writable;\n}();\n\n// `String.prototype.startsWith` method\n// https://tc39.es/ecma262/#sec-string.prototype.startswith\n$({ target: 'String', proto: true, forced: !MDN_POLYFILL_BUG && !CORRECT_IS_REGEXP_LOGIC }, {\n  startsWith: function startsWith(searchString /* , position = 0 */) {\n    var that = String(requireObjectCoercible(this));\n    notARegExp(searchString);\n    var index = toLength(min(arguments.length > 1 ? arguments[1] : undefined, that.length));\n    var search = String(searchString);\n    return $startsWith\n      ? $startsWith.call(that, search, index)\n      : that.slice(index, index + search.length) === search;\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar $findIndex = require('../internals/array-iteration').findIndex;\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\nvar FIND_INDEX = 'findIndex';\nvar SKIPS_HOLES = true;\n\n// Shouldn't skip holes\nif (FIND_INDEX in []) Array(1)[FIND_INDEX](function () { SKIPS_HOLES = false; });\n\n// `Array.prototype.findIndex` method\n// https://tc39.es/ecma262/#sec-array.prototype.findindex\n$({ target: 'Array', proto: true, forced: SKIPS_HOLES }, {\n  findIndex: function findIndex(callbackfn /* , that = undefined */) {\n    return $findIndex(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables(FIND_INDEX);\n","'use strict';\nvar $ = require('../internals/export');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar toInteger = require('../internals/to-integer');\nvar toLength = require('../internals/to-length');\nvar toObject = require('../internals/to-object');\nvar arraySpeciesCreate = require('../internals/array-species-create');\nvar createProperty = require('../internals/create-property');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('splice');\n\nvar max = Math.max;\nvar min = Math.min;\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;\nvar MAXIMUM_ALLOWED_LENGTH_EXCEEDED = 'Maximum allowed length exceeded';\n\n// `Array.prototype.splice` method\n// https://tc39.es/ecma262/#sec-array.prototype.splice\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  splice: function splice(start, deleteCount /* , ...items */) {\n    var O = toObject(this);\n    var len = toLength(O.length);\n    var actualStart = toAbsoluteIndex(start, len);\n    var argumentsLength = arguments.length;\n    var insertCount, actualDeleteCount, A, k, from, to;\n    if (argumentsLength === 0) {\n      insertCount = actualDeleteCount = 0;\n    } else if (argumentsLength === 1) {\n      insertCount = 0;\n      actualDeleteCount = len - actualStart;\n    } else {\n      insertCount = argumentsLength - 2;\n      actualDeleteCount = min(max(toInteger(deleteCount), 0), len - actualStart);\n    }\n    if (len + insertCount - actualDeleteCount > MAX_SAFE_INTEGER) {\n      throw TypeError(MAXIMUM_ALLOWED_LENGTH_EXCEEDED);\n    }\n    A = arraySpeciesCreate(O, actualDeleteCount);\n    for (k = 0; k < actualDeleteCount; k++) {\n      from = actualStart + k;\n      if (from in O) createProperty(A, k, O[from]);\n    }\n    A.length = actualDeleteCount;\n    if (insertCount < actualDeleteCount) {\n      for (k = actualStart; k < len - actualDeleteCount; k++) {\n        from = k + actualDeleteCount;\n        to = k + insertCount;\n        if (from in O) O[to] = O[from];\n        else delete O[to];\n      }\n      for (k = len; k > len - actualDeleteCount + insertCount; k--) delete O[k - 1];\n    } else if (insertCount > actualDeleteCount) {\n      for (k = len - actualDeleteCount; k > actualStart; k--) {\n        from = k + actualDeleteCount - 1;\n        to = k + insertCount - 1;\n        if (from in O) O[to] = O[from];\n        else delete O[to];\n      }\n    }\n    for (k = 0; k < insertCount; k++) {\n      O[k + actualStart] = arguments[k + 2];\n    }\n    O.length = len - actualDeleteCount + insertCount;\n    return A;\n  }\n});\n","'use strict';\nvar NATIVE_ARRAY_BUFFER = require('../internals/array-buffer-native');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar isObject = require('../internals/is-object');\nvar has = require('../internals/has');\nvar classof = require('../internals/classof');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar defineProperty = require('../internals/object-define-property').f;\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar uid = require('../internals/uid');\n\nvar Int8Array = global.Int8Array;\nvar Int8ArrayPrototype = Int8Array && Int8Array.prototype;\nvar Uint8ClampedArray = global.Uint8ClampedArray;\nvar Uint8ClampedArrayPrototype = Uint8ClampedArray && Uint8ClampedArray.prototype;\nvar TypedArray = Int8Array && getPrototypeOf(Int8Array);\nvar TypedArrayPrototype = Int8ArrayPrototype && getPrototypeOf(Int8ArrayPrototype);\nvar ObjectPrototype = Object.prototype;\nvar isPrototypeOf = ObjectPrototype.isPrototypeOf;\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar TYPED_ARRAY_TAG = uid('TYPED_ARRAY_TAG');\n// Fixing native typed arrays in Opera Presto crashes the browser, see #595\nvar NATIVE_ARRAY_BUFFER_VIEWS = NATIVE_ARRAY_BUFFER && !!setPrototypeOf && classof(global.opera) !== 'Opera';\nvar TYPED_ARRAY_TAG_REQIRED = false;\nvar NAME;\n\nvar TypedArrayConstructorsList = {\n  Int8Array: 1,\n  Uint8Array: 1,\n  Uint8ClampedArray: 1,\n  Int16Array: 2,\n  Uint16Array: 2,\n  Int32Array: 4,\n  Uint32Array: 4,\n  Float32Array: 4,\n  Float64Array: 8\n};\n\nvar BigIntArrayConstructorsList = {\n  BigInt64Array: 8,\n  BigUint64Array: 8\n};\n\nvar isView = function isView(it) {\n  if (!isObject(it)) return false;\n  var klass = classof(it);\n  return klass === 'DataView'\n    || has(TypedArrayConstructorsList, klass)\n    || has(BigIntArrayConstructorsList, klass);\n};\n\nvar isTypedArray = function (it) {\n  if (!isObject(it)) return false;\n  var klass = classof(it);\n  return has(TypedArrayConstructorsList, klass)\n    || has(BigIntArrayConstructorsList, klass);\n};\n\nvar aTypedArray = function (it) {\n  if (isTypedArray(it)) return it;\n  throw TypeError('Target is not a typed array');\n};\n\nvar aTypedArrayConstructor = function (C) {\n  if (setPrototypeOf) {\n    if (isPrototypeOf.call(TypedArray, C)) return C;\n  } else for (var ARRAY in TypedArrayConstructorsList) if (has(TypedArrayConstructorsList, NAME)) {\n    var TypedArrayConstructor = global[ARRAY];\n    if (TypedArrayConstructor && (C === TypedArrayConstructor || isPrototypeOf.call(TypedArrayConstructor, C))) {\n      return C;\n    }\n  } throw TypeError('Target is not a typed array constructor');\n};\n\nvar exportTypedArrayMethod = function (KEY, property, forced) {\n  if (!DESCRIPTORS) return;\n  if (forced) for (var ARRAY in TypedArrayConstructorsList) {\n    var TypedArrayConstructor = global[ARRAY];\n    if (TypedArrayConstructor && has(TypedArrayConstructor.prototype, KEY)) try {\n      delete TypedArrayConstructor.prototype[KEY];\n    } catch (error) { /* empty */ }\n  }\n  if (!TypedArrayPrototype[KEY] || forced) {\n    redefine(TypedArrayPrototype, KEY, forced ? property\n      : NATIVE_ARRAY_BUFFER_VIEWS && Int8ArrayPrototype[KEY] || property);\n  }\n};\n\nvar exportTypedArrayStaticMethod = function (KEY, property, forced) {\n  var ARRAY, TypedArrayConstructor;\n  if (!DESCRIPTORS) return;\n  if (setPrototypeOf) {\n    if (forced) for (ARRAY in TypedArrayConstructorsList) {\n      TypedArrayConstructor = global[ARRAY];\n      if (TypedArrayConstructor && has(TypedArrayConstructor, KEY)) try {\n        delete TypedArrayConstructor[KEY];\n      } catch (error) { /* empty */ }\n    }\n    if (!TypedArray[KEY] || forced) {\n      // V8 ~ Chrome 49-50 `%TypedArray%` methods are non-writable non-configurable\n      try {\n        return redefine(TypedArray, KEY, forced ? property : NATIVE_ARRAY_BUFFER_VIEWS && TypedArray[KEY] || property);\n      } catch (error) { /* empty */ }\n    } else return;\n  }\n  for (ARRAY in TypedArrayConstructorsList) {\n    TypedArrayConstructor = global[ARRAY];\n    if (TypedArrayConstructor && (!TypedArrayConstructor[KEY] || forced)) {\n      redefine(TypedArrayConstructor, KEY, property);\n    }\n  }\n};\n\nfor (NAME in TypedArrayConstructorsList) {\n  if (!global[NAME]) NATIVE_ARRAY_BUFFER_VIEWS = false;\n}\n\n// WebKit bug - typed arrays constructors prototype is Object.prototype\nif (!NATIVE_ARRAY_BUFFER_VIEWS || typeof TypedArray != 'function' || TypedArray === Function.prototype) {\n  // eslint-disable-next-line no-shadow -- safe\n  TypedArray = function TypedArray() {\n    throw TypeError('Incorrect invocation');\n  };\n  if (NATIVE_ARRAY_BUFFER_VIEWS) for (NAME in TypedArrayConstructorsList) {\n    if (global[NAME]) setPrototypeOf(global[NAME], TypedArray);\n  }\n}\n\nif (!NATIVE_ARRAY_BUFFER_VIEWS || !TypedArrayPrototype || TypedArrayPrototype === ObjectPrototype) {\n  TypedArrayPrototype = TypedArray.prototype;\n  if (NATIVE_ARRAY_BUFFER_VIEWS) for (NAME in TypedArrayConstructorsList) {\n    if (global[NAME]) setPrototypeOf(global[NAME].prototype, TypedArrayPrototype);\n  }\n}\n\n// WebKit bug - one more object in Uint8ClampedArray prototype chain\nif (NATIVE_ARRAY_BUFFER_VIEWS && getPrototypeOf(Uint8ClampedArrayPrototype) !== TypedArrayPrototype) {\n  setPrototypeOf(Uint8ClampedArrayPrototype, TypedArrayPrototype);\n}\n\nif (DESCRIPTORS && !has(TypedArrayPrototype, TO_STRING_TAG)) {\n  TYPED_ARRAY_TAG_REQIRED = true;\n  defineProperty(TypedArrayPrototype, TO_STRING_TAG, { get: function () {\n    return isObject(this) ? this[TYPED_ARRAY_TAG] : undefined;\n  } });\n  for (NAME in TypedArrayConstructorsList) if (global[NAME]) {\n    createNonEnumerableProperty(global[NAME], TYPED_ARRAY_TAG, NAME);\n  }\n}\n\nmodule.exports = {\n  NATIVE_ARRAY_BUFFER_VIEWS: NATIVE_ARRAY_BUFFER_VIEWS,\n  TYPED_ARRAY_TAG: TYPED_ARRAY_TAG_REQIRED && TYPED_ARRAY_TAG,\n  aTypedArray: aTypedArray,\n  aTypedArrayConstructor: aTypedArrayConstructor,\n  exportTypedArrayMethod: exportTypedArrayMethod,\n  exportTypedArrayStaticMethod: exportTypedArrayStaticMethod,\n  isView: isView,\n  isTypedArray: isTypedArray,\n  TypedArray: TypedArray,\n  TypedArrayPrototype: TypedArrayPrototype\n};\n","// eslint-disable-next-line es/no-typed-arrays -- safe\nmodule.exports = typeof ArrayBuffer !== 'undefined' && typeof DataView !== 'undefined';\n","/* eslint-disable no-new -- required for testing */\nvar global = require('../internals/global');\nvar fails = require('../internals/fails');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\nvar NATIVE_ARRAY_BUFFER_VIEWS = require('../internals/array-buffer-view-core').NATIVE_ARRAY_BUFFER_VIEWS;\n\nvar ArrayBuffer = global.ArrayBuffer;\nvar Int8Array = global.Int8Array;\n\nmodule.exports = !NATIVE_ARRAY_BUFFER_VIEWS || !fails(function () {\n  Int8Array(1);\n}) || !fails(function () {\n  new Int8Array(-1);\n}) || !checkCorrectnessOfIteration(function (iterable) {\n  new Int8Array();\n  new Int8Array(null);\n  new Int8Array(1.5);\n  new Int8Array(iterable);\n}, true) || fails(function () {\n  // Safari (11+) bug - a reason why even Safari 13 should load a typed array polyfill\n  return new Int8Array(new ArrayBuffer(2), 1, undefined).length !== 1;\n});\n","var toInteger = require('../internals/to-integer');\nvar toLength = require('../internals/to-length');\n\n// `ToIndex` abstract operation\n// https://tc39.es/ecma262/#sec-toindex\nmodule.exports = function (it) {\n  if (it === undefined) return 0;\n  var number = toInteger(it);\n  var length = toLength(number);\n  if (number !== length) throw RangeError('Wrong length or index');\n  return length;\n};\n","// IEEE754 conversions based on https://github.com/feross/ieee754\nvar abs = Math.abs;\nvar pow = Math.pow;\nvar floor = Math.floor;\nvar log = Math.log;\nvar LN2 = Math.LN2;\n\nvar pack = function (number, mantissaLength, bytes) {\n  var buffer = new Array(bytes);\n  var exponentLength = bytes * 8 - mantissaLength - 1;\n  var eMax = (1 << exponentLength) - 1;\n  var eBias = eMax >> 1;\n  var rt = mantissaLength === 23 ? pow(2, -24) - pow(2, -77) : 0;\n  var sign = number < 0 || number === 0 && 1 / number < 0 ? 1 : 0;\n  var index = 0;\n  var exponent, mantissa, c;\n  number = abs(number);\n  // eslint-disable-next-line no-self-compare -- NaN check\n  if (number != number || number === Infinity) {\n    // eslint-disable-next-line no-self-compare -- NaN check\n    mantissa = number != number ? 1 : 0;\n    exponent = eMax;\n  } else {\n    exponent = floor(log(number) / LN2);\n    if (number * (c = pow(2, -exponent)) < 1) {\n      exponent--;\n      c *= 2;\n    }\n    if (exponent + eBias >= 1) {\n      number += rt / c;\n    } else {\n      number += rt * pow(2, 1 - eBias);\n    }\n    if (number * c >= 2) {\n      exponent++;\n      c /= 2;\n    }\n    if (exponent + eBias >= eMax) {\n      mantissa = 0;\n      exponent = eMax;\n    } else if (exponent + eBias >= 1) {\n      mantissa = (number * c - 1) * pow(2, mantissaLength);\n      exponent = exponent + eBias;\n    } else {\n      mantissa = number * pow(2, eBias - 1) * pow(2, mantissaLength);\n      exponent = 0;\n    }\n  }\n  for (; mantissaLength >= 8; buffer[index++] = mantissa & 255, mantissa /= 256, mantissaLength -= 8);\n  exponent = exponent << mantissaLength | mantissa;\n  exponentLength += mantissaLength;\n  for (; exponentLength > 0; buffer[index++] = exponent & 255, exponent /= 256, exponentLength -= 8);\n  buffer[--index] |= sign * 128;\n  return buffer;\n};\n\nvar unpack = function (buffer, mantissaLength) {\n  var bytes = buffer.length;\n  var exponentLength = bytes * 8 - mantissaLength - 1;\n  var eMax = (1 << exponentLength) - 1;\n  var eBias = eMax >> 1;\n  var nBits = exponentLength - 7;\n  var index = bytes - 1;\n  var sign = buffer[index--];\n  var exponent = sign & 127;\n  var mantissa;\n  sign >>= 7;\n  for (; nBits > 0; exponent = exponent * 256 + buffer[index], index--, nBits -= 8);\n  mantissa = exponent & (1 << -nBits) - 1;\n  exponent >>= -nBits;\n  nBits += mantissaLength;\n  for (; nBits > 0; mantissa = mantissa * 256 + buffer[index], index--, nBits -= 8);\n  if (exponent === 0) {\n    exponent = 1 - eBias;\n  } else if (exponent === eMax) {\n    return mantissa ? NaN : sign ? -Infinity : Infinity;\n  } else {\n    mantissa = mantissa + pow(2, mantissaLength);\n    exponent = exponent - eBias;\n  } return (sign ? -1 : 1) * mantissa * pow(2, exponent - mantissaLength);\n};\n\nmodule.exports = {\n  pack: pack,\n  unpack: unpack\n};\n","'use strict';\nvar toObject = require('../internals/to-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar toLength = require('../internals/to-length');\n\n// `Array.prototype.fill` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.fill\nmodule.exports = function fill(value /* , start = 0, end = @length */) {\n  var O = toObject(this);\n  var length = toLength(O.length);\n  var argumentsLength = arguments.length;\n  var index = toAbsoluteIndex(argumentsLength > 1 ? arguments[1] : undefined, length);\n  var end = argumentsLength > 2 ? arguments[2] : undefined;\n  var endPos = end === undefined ? length : toAbsoluteIndex(end, length);\n  while (endPos > index) O[index++] = value;\n  return O;\n};\n","'use strict';\nvar global = require('../internals/global');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar NATIVE_ARRAY_BUFFER = require('../internals/array-buffer-native');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefineAll = require('../internals/redefine-all');\nvar fails = require('../internals/fails');\nvar anInstance = require('../internals/an-instance');\nvar toInteger = require('../internals/to-integer');\nvar toLength = require('../internals/to-length');\nvar toIndex = require('../internals/to-index');\nvar IEEE754 = require('../internals/ieee754');\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar defineProperty = require('../internals/object-define-property').f;\nvar arrayFill = require('../internals/array-fill');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar InternalStateModule = require('../internals/internal-state');\n\nvar getInternalState = InternalStateModule.get;\nvar setInternalState = InternalStateModule.set;\nvar ARRAY_BUFFER = 'ArrayBuffer';\nvar DATA_VIEW = 'DataView';\nvar PROTOTYPE = 'prototype';\nvar WRONG_LENGTH = 'Wrong length';\nvar WRONG_INDEX = 'Wrong index';\nvar NativeArrayBuffer = global[ARRAY_BUFFER];\nvar $ArrayBuffer = NativeArrayBuffer;\nvar $DataView = global[DATA_VIEW];\nvar $DataViewPrototype = $DataView && $DataView[PROTOTYPE];\nvar ObjectPrototype = Object.prototype;\nvar RangeError = global.RangeError;\n\nvar packIEEE754 = IEEE754.pack;\nvar unpackIEEE754 = IEEE754.unpack;\n\nvar packInt8 = function (number) {\n  return [number & 0xFF];\n};\n\nvar packInt16 = function (number) {\n  return [number & 0xFF, number >> 8 & 0xFF];\n};\n\nvar packInt32 = function (number) {\n  return [number & 0xFF, number >> 8 & 0xFF, number >> 16 & 0xFF, number >> 24 & 0xFF];\n};\n\nvar unpackInt32 = function (buffer) {\n  return buffer[3] << 24 | buffer[2] << 16 | buffer[1] << 8 | buffer[0];\n};\n\nvar packFloat32 = function (number) {\n  return packIEEE754(number, 23, 4);\n};\n\nvar packFloat64 = function (number) {\n  return packIEEE754(number, 52, 8);\n};\n\nvar addGetter = function (Constructor, key) {\n  defineProperty(Constructor[PROTOTYPE], key, { get: function () { return getInternalState(this)[key]; } });\n};\n\nvar get = function (view, count, index, isLittleEndian) {\n  var intIndex = toIndex(index);\n  var store = getInternalState(view);\n  if (intIndex + count > store.byteLength) throw RangeError(WRONG_INDEX);\n  var bytes = getInternalState(store.buffer).bytes;\n  var start = intIndex + store.byteOffset;\n  var pack = bytes.slice(start, start + count);\n  return isLittleEndian ? pack : pack.reverse();\n};\n\nvar set = function (view, count, index, conversion, value, isLittleEndian) {\n  var intIndex = toIndex(index);\n  var store = getInternalState(view);\n  if (intIndex + count > store.byteLength) throw RangeError(WRONG_INDEX);\n  var bytes = getInternalState(store.buffer).bytes;\n  var start = intIndex + store.byteOffset;\n  var pack = conversion(+value);\n  for (var i = 0; i < count; i++) bytes[start + i] = pack[isLittleEndian ? i : count - i - 1];\n};\n\nif (!NATIVE_ARRAY_BUFFER) {\n  $ArrayBuffer = function ArrayBuffer(length) {\n    anInstance(this, $ArrayBuffer, ARRAY_BUFFER);\n    var byteLength = toIndex(length);\n    setInternalState(this, {\n      bytes: arrayFill.call(new Array(byteLength), 0),\n      byteLength: byteLength\n    });\n    if (!DESCRIPTORS) this.byteLength = byteLength;\n  };\n\n  $DataView = function DataView(buffer, byteOffset, byteLength) {\n    anInstance(this, $DataView, DATA_VIEW);\n    anInstance(buffer, $ArrayBuffer, DATA_VIEW);\n    var bufferLength = getInternalState(buffer).byteLength;\n    var offset = toInteger(byteOffset);\n    if (offset < 0 || offset > bufferLength) throw RangeError('Wrong offset');\n    byteLength = byteLength === undefined ? bufferLength - offset : toLength(byteLength);\n    if (offset + byteLength > bufferLength) throw RangeError(WRONG_LENGTH);\n    setInternalState(this, {\n      buffer: buffer,\n      byteLength: byteLength,\n      byteOffset: offset\n    });\n    if (!DESCRIPTORS) {\n      this.buffer = buffer;\n      this.byteLength = byteLength;\n      this.byteOffset = offset;\n    }\n  };\n\n  if (DESCRIPTORS) {\n    addGetter($ArrayBuffer, 'byteLength');\n    addGetter($DataView, 'buffer');\n    addGetter($DataView, 'byteLength');\n    addGetter($DataView, 'byteOffset');\n  }\n\n  redefineAll($DataView[PROTOTYPE], {\n    getInt8: function getInt8(byteOffset) {\n      return get(this, 1, byteOffset)[0] << 24 >> 24;\n    },\n    getUint8: function getUint8(byteOffset) {\n      return get(this, 1, byteOffset)[0];\n    },\n    getInt16: function getInt16(byteOffset /* , littleEndian */) {\n      var bytes = get(this, 2, byteOffset, arguments.length > 1 ? arguments[1] : undefined);\n      return (bytes[1] << 8 | bytes[0]) << 16 >> 16;\n    },\n    getUint16: function getUint16(byteOffset /* , littleEndian */) {\n      var bytes = get(this, 2, byteOffset, arguments.length > 1 ? arguments[1] : undefined);\n      return bytes[1] << 8 | bytes[0];\n    },\n    getInt32: function getInt32(byteOffset /* , littleEndian */) {\n      return unpackInt32(get(this, 4, byteOffset, arguments.length > 1 ? arguments[1] : undefined));\n    },\n    getUint32: function getUint32(byteOffset /* , littleEndian */) {\n      return unpackInt32(get(this, 4, byteOffset, arguments.length > 1 ? arguments[1] : undefined)) >>> 0;\n    },\n    getFloat32: function getFloat32(byteOffset /* , littleEndian */) {\n      return unpackIEEE754(get(this, 4, byteOffset, arguments.length > 1 ? arguments[1] : undefined), 23);\n    },\n    getFloat64: function getFloat64(byteOffset /* , littleEndian */) {\n      return unpackIEEE754(get(this, 8, byteOffset, arguments.length > 1 ? arguments[1] : undefined), 52);\n    },\n    setInt8: function setInt8(byteOffset, value) {\n      set(this, 1, byteOffset, packInt8, value);\n    },\n    setUint8: function setUint8(byteOffset, value) {\n      set(this, 1, byteOffset, packInt8, value);\n    },\n    setInt16: function setInt16(byteOffset, value /* , littleEndian */) {\n      set(this, 2, byteOffset, packInt16, value, arguments.length > 2 ? arguments[2] : undefined);\n    },\n    setUint16: function setUint16(byteOffset, value /* , littleEndian */) {\n      set(this, 2, byteOffset, packInt16, value, arguments.length > 2 ? arguments[2] : undefined);\n    },\n    setInt32: function setInt32(byteOffset, value /* , littleEndian */) {\n      set(this, 4, byteOffset, packInt32, value, arguments.length > 2 ? arguments[2] : undefined);\n    },\n    setUint32: function setUint32(byteOffset, value /* , littleEndian */) {\n      set(this, 4, byteOffset, packInt32, value, arguments.length > 2 ? arguments[2] : undefined);\n    },\n    setFloat32: function setFloat32(byteOffset, value /* , littleEndian */) {\n      set(this, 4, byteOffset, packFloat32, value, arguments.length > 2 ? arguments[2] : undefined);\n    },\n    setFloat64: function setFloat64(byteOffset, value /* , littleEndian */) {\n      set(this, 8, byteOffset, packFloat64, value, arguments.length > 2 ? arguments[2] : undefined);\n    }\n  });\n} else {\n  /* eslint-disable no-new -- required for testing */\n  if (!fails(function () {\n    NativeArrayBuffer(1);\n  }) || !fails(function () {\n    new NativeArrayBuffer(-1);\n  }) || fails(function () {\n    new NativeArrayBuffer();\n    new NativeArrayBuffer(1.5);\n    new NativeArrayBuffer(NaN);\n    return NativeArrayBuffer.name != ARRAY_BUFFER;\n  })) {\n  /* eslint-enable no-new -- required for testing */\n    $ArrayBuffer = function ArrayBuffer(length) {\n      anInstance(this, $ArrayBuffer);\n      return new NativeArrayBuffer(toIndex(length));\n    };\n    var ArrayBufferPrototype = $ArrayBuffer[PROTOTYPE] = NativeArrayBuffer[PROTOTYPE];\n    for (var keys = getOwnPropertyNames(NativeArrayBuffer), j = 0, key; keys.length > j;) {\n      if (!((key = keys[j++]) in $ArrayBuffer)) {\n        createNonEnumerableProperty($ArrayBuffer, key, NativeArrayBuffer[key]);\n      }\n    }\n    ArrayBufferPrototype.constructor = $ArrayBuffer;\n  }\n\n  // WebKit bug - the same parent prototype for typed arrays and data view\n  if (setPrototypeOf && getPrototypeOf($DataViewPrototype) !== ObjectPrototype) {\n    setPrototypeOf($DataViewPrototype, ObjectPrototype);\n  }\n\n  // iOS Safari 7.x bug\n  var testView = new $DataView(new $ArrayBuffer(2));\n  var $setInt8 = $DataViewPrototype.setInt8;\n  testView.setInt8(0, 2147483648);\n  testView.setInt8(1, 2147483649);\n  if (testView.getInt8(0) || !testView.getInt8(1)) redefineAll($DataViewPrototype, {\n    setInt8: function setInt8(byteOffset, value) {\n      $setInt8.call(this, byteOffset, value << 24 >> 24);\n    },\n    setUint8: function setUint8(byteOffset, value) {\n      $setInt8.call(this, byteOffset, value << 24 >> 24);\n    }\n  }, { unsafe: true });\n}\n\nsetToStringTag($ArrayBuffer, ARRAY_BUFFER);\nsetToStringTag($DataView, DATA_VIEW);\n\nmodule.exports = {\n  ArrayBuffer: $ArrayBuffer,\n  DataView: $DataView\n};\n","var toInteger = require('../internals/to-integer');\n\nmodule.exports = function (it) {\n  var result = toInteger(it);\n  if (result < 0) throw RangeError(\"The argument can't be less than 0\");\n  return result;\n};\n","var toPositiveInteger = require('../internals/to-positive-integer');\n\nmodule.exports = function (it, BYTES) {\n  var offset = toPositiveInteger(it);\n  if (offset % BYTES) throw RangeError('Wrong offset');\n  return offset;\n};\n","var toObject = require('../internals/to-object');\nvar toLength = require('../internals/to-length');\nvar getIteratorMethod = require('../internals/get-iterator-method');\nvar isArrayIteratorMethod = require('../internals/is-array-iterator-method');\nvar bind = require('../internals/function-bind-context');\nvar aTypedArrayConstructor = require('../internals/array-buffer-view-core').aTypedArrayConstructor;\n\nmodule.exports = function from(source /* , mapfn, thisArg */) {\n  var O = toObject(source);\n  var argumentsLength = arguments.length;\n  var mapfn = argumentsLength > 1 ? arguments[1] : undefined;\n  var mapping = mapfn !== undefined;\n  var iteratorMethod = getIteratorMethod(O);\n  var i, length, result, step, iterator, next;\n  if (iteratorMethod != undefined && !isArrayIteratorMethod(iteratorMethod)) {\n    iterator = iteratorMethod.call(O);\n    next = iterator.next;\n    O = [];\n    while (!(step = next.call(iterator)).done) {\n      O.push(step.value);\n    }\n  }\n  if (mapping && argumentsLength > 2) {\n    mapfn = bind(mapfn, arguments[2], 2);\n  }\n  length = toLength(O.length);\n  result = new (aTypedArrayConstructor(this))(length);\n  for (i = 0; length > i; i++) {\n    result[i] = mapping ? mapfn(O[i], i) : O[i];\n  }\n  return result;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar TYPED_ARRAYS_CONSTRUCTORS_REQUIRES_WRAPPERS = require('../internals/typed-array-constructors-require-wrappers');\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar ArrayBufferModule = require('../internals/array-buffer');\nvar anInstance = require('../internals/an-instance');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar toLength = require('../internals/to-length');\nvar toIndex = require('../internals/to-index');\nvar toOffset = require('../internals/to-offset');\nvar toPrimitive = require('../internals/to-primitive');\nvar has = require('../internals/has');\nvar classof = require('../internals/classof');\nvar isObject = require('../internals/is-object');\nvar create = require('../internals/object-create');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar typedArrayFrom = require('../internals/typed-array-from');\nvar forEach = require('../internals/array-iteration').forEach;\nvar setSpecies = require('../internals/set-species');\nvar definePropertyModule = require('../internals/object-define-property');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar InternalStateModule = require('../internals/internal-state');\nvar inheritIfRequired = require('../internals/inherit-if-required');\n\nvar getInternalState = InternalStateModule.get;\nvar setInternalState = InternalStateModule.set;\nvar nativeDefineProperty = definePropertyModule.f;\nvar nativeGetOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\nvar round = Math.round;\nvar RangeError = global.RangeError;\nvar ArrayBuffer = ArrayBufferModule.ArrayBuffer;\nvar DataView = ArrayBufferModule.DataView;\nvar NATIVE_ARRAY_BUFFER_VIEWS = ArrayBufferViewCore.NATIVE_ARRAY_BUFFER_VIEWS;\nvar TYPED_ARRAY_TAG = ArrayBufferViewCore.TYPED_ARRAY_TAG;\nvar TypedArray = ArrayBufferViewCore.TypedArray;\nvar TypedArrayPrototype = ArrayBufferViewCore.TypedArrayPrototype;\nvar aTypedArrayConstructor = ArrayBufferViewCore.aTypedArrayConstructor;\nvar isTypedArray = ArrayBufferViewCore.isTypedArray;\nvar BYTES_PER_ELEMENT = 'BYTES_PER_ELEMENT';\nvar WRONG_LENGTH = 'Wrong length';\n\nvar fromList = function (C, list) {\n  var index = 0;\n  var length = list.length;\n  var result = new (aTypedArrayConstructor(C))(length);\n  while (length > index) result[index] = list[index++];\n  return result;\n};\n\nvar addGetter = function (it, key) {\n  nativeDefineProperty(it, key, { get: function () {\n    return getInternalState(this)[key];\n  } });\n};\n\nvar isArrayBuffer = function (it) {\n  var klass;\n  return it instanceof ArrayBuffer || (klass = classof(it)) == 'ArrayBuffer' || klass == 'SharedArrayBuffer';\n};\n\nvar isTypedArrayIndex = function (target, key) {\n  return isTypedArray(target)\n    && typeof key != 'symbol'\n    && key in target\n    && String(+key) == String(key);\n};\n\nvar wrappedGetOwnPropertyDescriptor = function getOwnPropertyDescriptor(target, key) {\n  return isTypedArrayIndex(target, key = toPrimitive(key, true))\n    ? createPropertyDescriptor(2, target[key])\n    : nativeGetOwnPropertyDescriptor(target, key);\n};\n\nvar wrappedDefineProperty = function defineProperty(target, key, descriptor) {\n  if (isTypedArrayIndex(target, key = toPrimitive(key, true))\n    && isObject(descriptor)\n    && has(descriptor, 'value')\n    && !has(descriptor, 'get')\n    && !has(descriptor, 'set')\n    // TODO: add validation descriptor w/o calling accessors\n    && !descriptor.configurable\n    && (!has(descriptor, 'writable') || descriptor.writable)\n    && (!has(descriptor, 'enumerable') || descriptor.enumerable)\n  ) {\n    target[key] = descriptor.value;\n    return target;\n  } return nativeDefineProperty(target, key, descriptor);\n};\n\nif (DESCRIPTORS) {\n  if (!NATIVE_ARRAY_BUFFER_VIEWS) {\n    getOwnPropertyDescriptorModule.f = wrappedGetOwnPropertyDescriptor;\n    definePropertyModule.f = wrappedDefineProperty;\n    addGetter(TypedArrayPrototype, 'buffer');\n    addGetter(TypedArrayPrototype, 'byteOffset');\n    addGetter(TypedArrayPrototype, 'byteLength');\n    addGetter(TypedArrayPrototype, 'length');\n  }\n\n  $({ target: 'Object', stat: true, forced: !NATIVE_ARRAY_BUFFER_VIEWS }, {\n    getOwnPropertyDescriptor: wrappedGetOwnPropertyDescriptor,\n    defineProperty: wrappedDefineProperty\n  });\n\n  module.exports = function (TYPE, wrapper, CLAMPED) {\n    var BYTES = TYPE.match(/\\d+$/)[0] / 8;\n    var CONSTRUCTOR_NAME = TYPE + (CLAMPED ? 'Clamped' : '') + 'Array';\n    var GETTER = 'get' + TYPE;\n    var SETTER = 'set' + TYPE;\n    var NativeTypedArrayConstructor = global[CONSTRUCTOR_NAME];\n    var TypedArrayConstructor = NativeTypedArrayConstructor;\n    var TypedArrayConstructorPrototype = TypedArrayConstructor && TypedArrayConstructor.prototype;\n    var exported = {};\n\n    var getter = function (that, index) {\n      var data = getInternalState(that);\n      return data.view[GETTER](index * BYTES + data.byteOffset, true);\n    };\n\n    var setter = function (that, index, value) {\n      var data = getInternalState(that);\n      if (CLAMPED) value = (value = round(value)) < 0 ? 0 : value > 0xFF ? 0xFF : value & 0xFF;\n      data.view[SETTER](index * BYTES + data.byteOffset, value, true);\n    };\n\n    var addElement = function (that, index) {\n      nativeDefineProperty(that, index, {\n        get: function () {\n          return getter(this, index);\n        },\n        set: function (value) {\n          return setter(this, index, value);\n        },\n        enumerable: true\n      });\n    };\n\n    if (!NATIVE_ARRAY_BUFFER_VIEWS) {\n      TypedArrayConstructor = wrapper(function (that, data, offset, $length) {\n        anInstance(that, TypedArrayConstructor, CONSTRUCTOR_NAME);\n        var index = 0;\n        var byteOffset = 0;\n        var buffer, byteLength, length;\n        if (!isObject(data)) {\n          length = toIndex(data);\n          byteLength = length * BYTES;\n          buffer = new ArrayBuffer(byteLength);\n        } else if (isArrayBuffer(data)) {\n          buffer = data;\n          byteOffset = toOffset(offset, BYTES);\n          var $len = data.byteLength;\n          if ($length === undefined) {\n            if ($len % BYTES) throw RangeError(WRONG_LENGTH);\n            byteLength = $len - byteOffset;\n            if (byteLength < 0) throw RangeError(WRONG_LENGTH);\n          } else {\n            byteLength = toLength($length) * BYTES;\n            if (byteLength + byteOffset > $len) throw RangeError(WRONG_LENGTH);\n          }\n          length = byteLength / BYTES;\n        } else if (isTypedArray(data)) {\n          return fromList(TypedArrayConstructor, data);\n        } else {\n          return typedArrayFrom.call(TypedArrayConstructor, data);\n        }\n        setInternalState(that, {\n          buffer: buffer,\n          byteOffset: byteOffset,\n          byteLength: byteLength,\n          length: length,\n          view: new DataView(buffer)\n        });\n        while (index < length) addElement(that, index++);\n      });\n\n      if (setPrototypeOf) setPrototypeOf(TypedArrayConstructor, TypedArray);\n      TypedArrayConstructorPrototype = TypedArrayConstructor.prototype = create(TypedArrayPrototype);\n    } else if (TYPED_ARRAYS_CONSTRUCTORS_REQUIRES_WRAPPERS) {\n      TypedArrayConstructor = wrapper(function (dummy, data, typedArrayOffset, $length) {\n        anInstance(dummy, TypedArrayConstructor, CONSTRUCTOR_NAME);\n        return inheritIfRequired(function () {\n          if (!isObject(data)) return new NativeTypedArrayConstructor(toIndex(data));\n          if (isArrayBuffer(data)) return $length !== undefined\n            ? new NativeTypedArrayConstructor(data, toOffset(typedArrayOffset, BYTES), $length)\n            : typedArrayOffset !== undefined\n              ? new NativeTypedArrayConstructor(data, toOffset(typedArrayOffset, BYTES))\n              : new NativeTypedArrayConstructor(data);\n          if (isTypedArray(data)) return fromList(TypedArrayConstructor, data);\n          return typedArrayFrom.call(TypedArrayConstructor, data);\n        }(), dummy, TypedArrayConstructor);\n      });\n\n      if (setPrototypeOf) setPrototypeOf(TypedArrayConstructor, TypedArray);\n      forEach(getOwnPropertyNames(NativeTypedArrayConstructor), function (key) {\n        if (!(key in TypedArrayConstructor)) {\n          createNonEnumerableProperty(TypedArrayConstructor, key, NativeTypedArrayConstructor[key]);\n        }\n      });\n      TypedArrayConstructor.prototype = TypedArrayConstructorPrototype;\n    }\n\n    if (TypedArrayConstructorPrototype.constructor !== TypedArrayConstructor) {\n      createNonEnumerableProperty(TypedArrayConstructorPrototype, 'constructor', TypedArrayConstructor);\n    }\n\n    if (TYPED_ARRAY_TAG) {\n      createNonEnumerableProperty(TypedArrayConstructorPrototype, TYPED_ARRAY_TAG, CONSTRUCTOR_NAME);\n    }\n\n    exported[CONSTRUCTOR_NAME] = TypedArrayConstructor;\n\n    $({\n      global: true, forced: TypedArrayConstructor != NativeTypedArrayConstructor, sham: !NATIVE_ARRAY_BUFFER_VIEWS\n    }, exported);\n\n    if (!(BYTES_PER_ELEMENT in TypedArrayConstructor)) {\n      createNonEnumerableProperty(TypedArrayConstructor, BYTES_PER_ELEMENT, BYTES);\n    }\n\n    if (!(BYTES_PER_ELEMENT in TypedArrayConstructorPrototype)) {\n      createNonEnumerableProperty(TypedArrayConstructorPrototype, BYTES_PER_ELEMENT, BYTES);\n    }\n\n    setSpecies(CONSTRUCTOR_NAME);\n  };\n} else module.exports = function () { /* empty */ };\n","var createTypedArrayConstructor = require('../internals/typed-array-constructor');\n\n// `Uint8Array` constructor\n// https://tc39.es/ecma262/#sec-typedarray-objects\ncreateTypedArrayConstructor('Uint8', function (init) {\n  return function Uint8Array(data, byteOffset, length) {\n    return init(this, data, byteOffset, length);\n  };\n});\n","'use strict';\nvar toObject = require('../internals/to-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar toLength = require('../internals/to-length');\n\nvar min = Math.min;\n\n// `Array.prototype.copyWithin` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.copywithin\n// eslint-disable-next-line es/no-array-prototype-copywithin -- safe\nmodule.exports = [].copyWithin || function copyWithin(target /* = 0 */, start /* = 0, end = @length */) {\n  var O = toObject(this);\n  var len = toLength(O.length);\n  var to = toAbsoluteIndex(target, len);\n  var from = toAbsoluteIndex(start, len);\n  var end = arguments.length > 2 ? arguments[2] : undefined;\n  var count = min((end === undefined ? len : toAbsoluteIndex(end, len)) - from, len - to);\n  var inc = 1;\n  if (from < to && to < from + count) {\n    inc = -1;\n    from += count - 1;\n    to += count - 1;\n  }\n  while (count-- > 0) {\n    if (from in O) O[to] = O[from];\n    else delete O[to];\n    to += inc;\n    from += inc;\n  } return O;\n};\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $copyWithin = require('../internals/array-copy-within');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.copyWithin` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.copywithin\nexportTypedArrayMethod('copyWithin', function copyWithin(target, start /* , end */) {\n  return $copyWithin.call(aTypedArray(this), target, start, arguments.length > 2 ? arguments[2] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $every = require('../internals/array-iteration').every;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.every` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.every\nexportTypedArrayMethod('every', function every(callbackfn /* , thisArg */) {\n  return $every(aTypedArray(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $fill = require('../internals/array-fill');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.fill` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.fill\n// eslint-disable-next-line no-unused-vars -- required for `.length`\nexportTypedArrayMethod('fill', function fill(value /* , start, end */) {\n  return $fill.apply(aTypedArray(this), arguments);\n});\n","var aTypedArrayConstructor = require('../internals/array-buffer-view-core').aTypedArrayConstructor;\nvar speciesConstructor = require('../internals/species-constructor');\n\nmodule.exports = function (instance, list) {\n  var C = speciesConstructor(instance, instance.constructor);\n  var index = 0;\n  var length = list.length;\n  var result = new (aTypedArrayConstructor(C))(length);\n  while (length > index) result[index] = list[index++];\n  return result;\n};\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $filter = require('../internals/array-iteration').filter;\nvar fromSpeciesAndList = require('../internals/typed-array-from-species-and-list');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.filter` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.filter\nexportTypedArrayMethod('filter', function filter(callbackfn /* , thisArg */) {\n  var list = $filter(aTypedArray(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  return fromSpeciesAndList(this, list);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $find = require('../internals/array-iteration').find;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.find` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.find\nexportTypedArrayMethod('find', function find(predicate /* , thisArg */) {\n  return $find(aTypedArray(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $findIndex = require('../internals/array-iteration').findIndex;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.findIndex` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.findindex\nexportTypedArrayMethod('findIndex', function findIndex(predicate /* , thisArg */) {\n  return $findIndex(aTypedArray(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $forEach = require('../internals/array-iteration').forEach;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.forEach` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.foreach\nexportTypedArrayMethod('forEach', function forEach(callbackfn /* , thisArg */) {\n  $forEach(aTypedArray(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $includes = require('../internals/array-includes').includes;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.includes` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.includes\nexportTypedArrayMethod('includes', function includes(searchElement /* , fromIndex */) {\n  return $includes(aTypedArray(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $indexOf = require('../internals/array-includes').indexOf;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.indexOf` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.indexof\nexportTypedArrayMethod('indexOf', function indexOf(searchElement /* , fromIndex */) {\n  return $indexOf(aTypedArray(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar global = require('../internals/global');\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar ArrayIterators = require('../modules/es.array.iterator');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar Uint8Array = global.Uint8Array;\nvar arrayValues = ArrayIterators.values;\nvar arrayKeys = ArrayIterators.keys;\nvar arrayEntries = ArrayIterators.entries;\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\nvar nativeTypedArrayIterator = Uint8Array && Uint8Array.prototype[ITERATOR];\n\nvar CORRECT_ITER_NAME = !!nativeTypedArrayIterator\n  && (nativeTypedArrayIterator.name == 'values' || nativeTypedArrayIterator.name == undefined);\n\nvar typedArrayValues = function values() {\n  return arrayValues.call(aTypedArray(this));\n};\n\n// `%TypedArray%.prototype.entries` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.entries\nexportTypedArrayMethod('entries', function entries() {\n  return arrayEntries.call(aTypedArray(this));\n});\n// `%TypedArray%.prototype.keys` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.keys\nexportTypedArrayMethod('keys', function keys() {\n  return arrayKeys.call(aTypedArray(this));\n});\n// `%TypedArray%.prototype.values` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.values\nexportTypedArrayMethod('values', typedArrayValues, !CORRECT_ITER_NAME);\n// `%TypedArray%.prototype[@@iterator]` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype-@@iterator\nexportTypedArrayMethod(ITERATOR, typedArrayValues, !CORRECT_ITER_NAME);\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\nvar $join = [].join;\n\n// `%TypedArray%.prototype.join` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.join\n// eslint-disable-next-line no-unused-vars -- required for `.length`\nexportTypedArrayMethod('join', function join(separator) {\n  return $join.apply(aTypedArray(this), arguments);\n});\n","'use strict';\n/* eslint-disable es/no-array-prototype-lastindexof -- safe */\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toInteger = require('../internals/to-integer');\nvar toLength = require('../internals/to-length');\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\n\nvar min = Math.min;\nvar $lastIndexOf = [].lastIndexOf;\nvar NEGATIVE_ZERO = !!$lastIndexOf && 1 / [1].lastIndexOf(1, -0) < 0;\nvar STRICT_METHOD = arrayMethodIsStrict('lastIndexOf');\nvar FORCED = NEGATIVE_ZERO || !STRICT_METHOD;\n\n// `Array.prototype.lastIndexOf` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.lastindexof\nmodule.exports = FORCED ? function lastIndexOf(searchElement /* , fromIndex = @[*-1] */) {\n  // convert -0 to +0\n  if (NEGATIVE_ZERO) return $lastIndexOf.apply(this, arguments) || 0;\n  var O = toIndexedObject(this);\n  var length = toLength(O.length);\n  var index = length - 1;\n  if (arguments.length > 1) index = min(index, toInteger(arguments[1]));\n  if (index < 0) index = length + index;\n  for (;index >= 0; index--) if (index in O && O[index] === searchElement) return index || 0;\n  return -1;\n} : $lastIndexOf;\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $lastIndexOf = require('../internals/array-last-index-of');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.lastIndexOf` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.lastindexof\n// eslint-disable-next-line no-unused-vars -- required for `.length`\nexportTypedArrayMethod('lastIndexOf', function lastIndexOf(searchElement /* , fromIndex */) {\n  return $lastIndexOf.apply(aTypedArray(this), arguments);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $map = require('../internals/array-iteration').map;\nvar speciesConstructor = require('../internals/species-constructor');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar aTypedArrayConstructor = ArrayBufferViewCore.aTypedArrayConstructor;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.map` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.map\nexportTypedArrayMethod('map', function map(mapfn /* , thisArg */) {\n  return $map(aTypedArray(this), mapfn, arguments.length > 1 ? arguments[1] : undefined, function (O, length) {\n    return new (aTypedArrayConstructor(speciesConstructor(O, O.constructor)))(length);\n  });\n});\n","var aFunction = require('../internals/a-function');\nvar toObject = require('../internals/to-object');\nvar IndexedObject = require('../internals/indexed-object');\nvar toLength = require('../internals/to-length');\n\n// `Array.prototype.{ reduce, reduceRight }` methods implementation\nvar createMethod = function (IS_RIGHT) {\n  return function (that, callbackfn, argumentsLength, memo) {\n    aFunction(callbackfn);\n    var O = toObject(that);\n    var self = IndexedObject(O);\n    var length = toLength(O.length);\n    var index = IS_RIGHT ? length - 1 : 0;\n    var i = IS_RIGHT ? -1 : 1;\n    if (argumentsLength < 2) while (true) {\n      if (index in self) {\n        memo = self[index];\n        index += i;\n        break;\n      }\n      index += i;\n      if (IS_RIGHT ? index < 0 : length <= index) {\n        throw TypeError('Reduce of empty array with no initial value');\n      }\n    }\n    for (;IS_RIGHT ? index >= 0 : length > index; index += i) if (index in self) {\n      memo = callbackfn(memo, self[index], index, O);\n    }\n    return memo;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.reduce` method\n  // https://tc39.es/ecma262/#sec-array.prototype.reduce\n  left: createMethod(false),\n  // `Array.prototype.reduceRight` method\n  // https://tc39.es/ecma262/#sec-array.prototype.reduceright\n  right: createMethod(true)\n};\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $reduce = require('../internals/array-reduce').left;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.reduce` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.reduce\nexportTypedArrayMethod('reduce', function reduce(callbackfn /* , initialValue */) {\n  return $reduce(aTypedArray(this), callbackfn, arguments.length, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $reduceRight = require('../internals/array-reduce').right;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.reduceRicht` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.reduceright\nexportTypedArrayMethod('reduceRight', function reduceRight(callbackfn /* , initialValue */) {\n  return $reduceRight(aTypedArray(this), callbackfn, arguments.length, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\nvar floor = Math.floor;\n\n// `%TypedArray%.prototype.reverse` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.reverse\nexportTypedArrayMethod('reverse', function reverse() {\n  var that = this;\n  var length = aTypedArray(that).length;\n  var middle = floor(length / 2);\n  var index = 0;\n  var value;\n  while (index < middle) {\n    value = that[index];\n    that[index++] = that[--length];\n    that[length] = value;\n  } return that;\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar toLength = require('../internals/to-length');\nvar toOffset = require('../internals/to-offset');\nvar toObject = require('../internals/to-object');\nvar fails = require('../internals/fails');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\nvar FORCED = fails(function () {\n  // eslint-disable-next-line es/no-typed-arrays -- required for testing\n  new Int8Array(1).set({});\n});\n\n// `%TypedArray%.prototype.set` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.set\nexportTypedArrayMethod('set', function set(arrayLike /* , offset */) {\n  aTypedArray(this);\n  var offset = toOffset(arguments.length > 1 ? arguments[1] : undefined, 1);\n  var length = this.length;\n  var src = toObject(arrayLike);\n  var len = toLength(src.length);\n  var index = 0;\n  if (len + offset > length) throw RangeError('Wrong length');\n  while (index < len) this[offset + index] = src[index++];\n}, FORCED);\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar speciesConstructor = require('../internals/species-constructor');\nvar fails = require('../internals/fails');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar aTypedArrayConstructor = ArrayBufferViewCore.aTypedArrayConstructor;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\nvar $slice = [].slice;\n\nvar FORCED = fails(function () {\n  // eslint-disable-next-line es/no-typed-arrays -- required for testing\n  new Int8Array(1).slice();\n});\n\n// `%TypedArray%.prototype.slice` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.slice\nexportTypedArrayMethod('slice', function slice(start, end) {\n  var list = $slice.call(aTypedArray(this), start, end);\n  var C = speciesConstructor(this, this.constructor);\n  var index = 0;\n  var length = list.length;\n  var result = new (aTypedArrayConstructor(C))(length);\n  while (length > index) result[index] = list[index++];\n  return result;\n}, FORCED);\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar $some = require('../internals/array-iteration').some;\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.some` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.some\nexportTypedArrayMethod('some', function some(callbackfn /* , thisArg */) {\n  return $some(aTypedArray(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\nvar $sort = [].sort;\n\n// `%TypedArray%.prototype.sort` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.sort\nexportTypedArrayMethod('sort', function sort(comparefn) {\n  return $sort.call(aTypedArray(this), comparefn);\n});\n","'use strict';\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar toLength = require('../internals/to-length');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar speciesConstructor = require('../internals/species-constructor');\n\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\n\n// `%TypedArray%.prototype.subarray` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.subarray\nexportTypedArrayMethod('subarray', function subarray(begin, end) {\n  var O = aTypedArray(this);\n  var length = O.length;\n  var beginIndex = toAbsoluteIndex(begin, length);\n  return new (speciesConstructor(O, O.constructor))(\n    O.buffer,\n    O.byteOffset + beginIndex * O.BYTES_PER_ELEMENT,\n    toLength((end === undefined ? length : toAbsoluteIndex(end, length)) - beginIndex)\n  );\n});\n","'use strict';\nvar global = require('../internals/global');\nvar ArrayBufferViewCore = require('../internals/array-buffer-view-core');\nvar fails = require('../internals/fails');\n\nvar Int8Array = global.Int8Array;\nvar aTypedArray = ArrayBufferViewCore.aTypedArray;\nvar exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;\nvar $toLocaleString = [].toLocaleString;\nvar $slice = [].slice;\n\n// iOS Safari 6.x fails here\nvar TO_LOCALE_STRING_BUG = !!Int8Array && fails(function () {\n  $toLocaleString.call(new Int8Array(1));\n});\n\nvar FORCED = fails(function () {\n  return [1, 2].toLocaleString() != new Int8Array([1, 2]).toLocaleString();\n}) || !fails(function () {\n  Int8Array.prototype.toLocaleString.call([1, 2]);\n});\n\n// `%TypedArray%.prototype.toLocaleString` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.tolocalestring\nexportTypedArrayMethod('toLocaleString', function toLocaleString() {\n  return $toLocaleString.apply(TO_LOCALE_STRING_BUG ? $slice.call(aTypedArray(this)) : aTypedArray(this), arguments);\n}, FORCED);\n","'use strict';\nvar exportTypedArrayMethod = require('../internals/array-buffer-view-core').exportTypedArrayMethod;\nvar fails = require('../internals/fails');\nvar global = require('../internals/global');\n\nvar Uint8Array = global.Uint8Array;\nvar Uint8ArrayPrototype = Uint8Array && Uint8Array.prototype || {};\nvar arrayToString = [].toString;\nvar arrayJoin = [].join;\n\nif (fails(function () { arrayToString.call({}); })) {\n  arrayToString = function toString() {\n    return arrayJoin.call(this);\n  };\n}\n\nvar IS_NOT_ARRAY_METHOD = Uint8ArrayPrototype.toString != arrayToString;\n\n// `%TypedArray%.prototype.toString` method\n// https://tc39.es/ecma262/#sec-%typedarray%.prototype.tostring\nexportTypedArrayMethod('toString', arrayToString, IS_NOT_ARRAY_METHOD);\n","var createTypedArrayConstructor = require('../internals/typed-array-constructor');\n\n// `Uint32Array` constructor\n// https://tc39.es/ecma262/#sec-typedarray-objects\ncreateTypedArrayConstructor('Uint32', function (init) {\n  return function Uint32Array(data, byteOffset, length) {\n    return init(this, data, byteOffset, length);\n  };\n});\n","var createTypedArrayConstructor = require('../internals/typed-array-constructor');\n\n// `Uint16Array` constructor\n// https://tc39.es/ecma262/#sec-typedarray-objects\ncreateTypedArrayConstructor('Uint16', function (init) {\n  return function Uint16Array(data, byteOffset, length) {\n    return init(this, data, byteOffset, length);\n  };\n});\n","var createTypedArrayConstructor = require('../internals/typed-array-constructor');\n\n// `Int32Array` constructor\n// https://tc39.es/ecma262/#sec-typedarray-objects\ncreateTypedArrayConstructor('Int32', function (init) {\n  return function Int32Array(data, byteOffset, length) {\n    return init(this, data, byteOffset, length);\n  };\n});\n","\n/*! pako 2.0.3 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN             = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH    = 3;\nconst MAX_MATCH    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES       = 30;\n/* number of distance codes */\n\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\n\nconst MAX_BITS      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) =>\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n{\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Trace((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) =>\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n{\n  const next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS; bits++) {\n    next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.last_lit = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nconst copy_block = (s, buf, len, header) =>\n//DeflateState *s;\n//charf    *buf;    /* the input data */\n//unsigned len;     /* its length */\n//int      header;  /* true if block header must be written */\n{\n  bi_windup(s);        /* align on byte boundary */\n\n  if (header) {\n    put_short(s, len);\n    put_short(s, ~len);\n  }\n//  while (len--) {\n//    put_byte(s, *buf++);\n//  }\n  s.pending_buf.set(s.window.subarray(buf, buf + len), s.pending);\n  s.pending += len;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) =>\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n{\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) =>\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n{\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let lx = 0;         /* running index in l_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.last_lit !== 0) {\n    do {\n      dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n      lc = s.pending_buf[s.l_buf + lx];\n      lx++;\n\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n      //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n      //       \"pendingBuf overflow\");\n\n    } while (lx < s.last_lit);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) =>\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n{\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) =>\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n{\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) =>\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n{\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) =>\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"black list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* black_mask is the bit mask of black-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let black_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"black-listed\") bytes. */\n  for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n    if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"white-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"black-listed\" or \"white-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block = (s, buf, stored_len, last) =>\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  copy_block(s, buf, stored_len, true); /* with header */\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nconst _tr_flush_block = (s, buf, stored_len, last) =>\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->last_lit));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally = (s, dist, lc) =>\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n  //let out_length, in_length, dcode;\n\n  s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;\n  s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n  s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n  s.last_lit++;\n\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n//  /* Try to guess if it is profitable to stop the current block here */\n//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n//    /* Compute an upper bound for the compressed length */\n//    out_length = s.last_lit*8;\n//    in_length = s.strstart - s.block_start;\n//\n//    for (dcode = 0; dcode < D_CODES; dcode++) {\n//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n//    }\n//    out_length >>>= 3;\n//    //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n//    //       s->last_lit, in_length, out_length,\n//    //       100L - out_length*100L/in_length));\n//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n//      return true;\n//    }\n//  }\n//#endif\n\n  return (s.last_lit === s.lit_bufsize - 1);\n  /* We avoid equality with lit_bufsize because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n};\n\nvar _tr_init_1  = _tr_init;\nvar _tr_stored_block_1 = _tr_stored_block;\nvar _tr_flush_block_1  = _tr_flush_block;\nvar _tr_tally_1 = _tr_tally;\nvar _tr_align_1 = _tr_align;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init: _tr_init$1, _tr_stored_block: _tr_stored_block$1, _tr_flush_block: _tr_flush_block$1, _tr_tally: _tr_tally$1, _tr_align: _tr_align$1 } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_PARTIAL_FLUSH, Z_FULL_FLUSH, Z_FINISH, Z_BLOCK,\n  Z_OK, Z_STREAM_END, Z_STREAM_ERROR, Z_DATA_ERROR, Z_BUF_ERROR,\n  Z_DEFAULT_COMPRESSION,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED: Z_FIXED$1, Z_DEFAULT_STRATEGY,\n  Z_UNKNOWN: Z_UNKNOWN$1,\n  Z_DEFLATED\n} = constants;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES$1       = 30;\n/* number of distance codes */\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\nconst MAX_BITS$1  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH$1 = 3;\nconst MAX_MATCH$1 = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH$1 + MIN_MATCH$1 + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42;\nconst EXTRA_STATE = 69;\nconst NAME_STATE = 73;\nconst COMMENT_STATE = 91;\nconst HCRC_STATE = 103;\nconst BUSY_STATE = 113;\nconst FINISH_STATE = 666;\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) << 1) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero$1 = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out += len;\n  s.pending_out += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block$1(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH$1;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH$1 - (strend - scan);\n    scan = strend - MAX_MATCH$1;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let p, n, m, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n\n      /* Slide the hash table (could be avoided with 32 bit values\n       at the expense of memory usage). We slide even when level == 0\n       to keep the hash table consistent if we switch back to level > 0\n       later. (Using level 0 permanently is not an optimal usage of\n       zlib, so we don't care about this pathological case.)\n       */\n\n      n = s.hash_size;\n      p = n;\n\n      do {\n        m = s.head[--p];\n        s.head[p] = (m >= _w_size ? m - _w_size : 0);\n      } while (--n);\n\n      n = _w_size;\n      p = n;\n\n      do {\n        m = s.prev[--p];\n        s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n        /* If n is not on any hash chain, prev[n] is garbage but\n         * its value will never be used.\n         */\n      } while (--n);\n\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH$1) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH$1 - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH$1) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n   * to pending_buf_size, and each stored block has a 5 byte header:\n   */\n  let max_block_size = 0xffff;\n\n  if (max_block_size > s.pending_buf_size - 5) {\n    max_block_size = s.pending_buf_size - 5;\n  }\n\n  /* Copy as much as possible from input to output: */\n  for (;;) {\n    /* Fill the window as much as possible: */\n    if (s.lookahead <= 1) {\n\n      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n      //  s->block_start >= (long)s->w_size, \"slide too late\");\n//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n//        s.block_start >= s.w_size)) {\n//        throw  new Error(\"slide too late\");\n//      }\n\n      fill_window(s);\n      if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n\n      if (s.lookahead === 0) {\n        break;\n      }\n      /* flush the current block */\n    }\n    //Assert(s->block_start >= 0L, \"block gone\");\n//    if (s.block_start < 0) throw new Error(\"block gone\");\n\n    s.strstart += s.lookahead;\n    s.lookahead = 0;\n\n    /* Emit a stored block if pending_buf will be full: */\n    const max_start = s.block_start + max_block_size;\n\n    if (s.strstart === 0 || s.strstart >= max_start) {\n      /* strstart == 0 is possible when wraparound on 16-bit machine */\n      s.lookahead = s.strstart - max_start;\n      s.strstart = max_start;\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n\n\n    }\n    /* Flush if we may have to slide, otherwise block_start may become\n     * negative and the data will be gone:\n     */\n    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n\n  s.insert = 0;\n\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n\n  if (s.strstart > s.block_start) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_NEED_MORE;\n};\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH$1) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH$1 - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH$1) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally$1(s, s.strstart - s.match_start, s.match_length - MIN_MATCH$1);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH$1) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH$1 - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally$1(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH$1 - 1)) ? s.strstart : MIN_MATCH$1 - 1);\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH$1) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH$1 - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH$1 - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH$1 && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH$1 - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH$1 && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH$1;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally$1(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH$1);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH$1 - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH$1 - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally$1(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally$1(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH$1 - 1 ? s.strstart : MIN_MATCH$1 - 1;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH$1) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH$1 && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH$1 && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH$1;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH$1 - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH$1) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally$1(s, 1, s.match_length - MIN_MATCH$1);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally$1(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally$1(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero$1(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH$1 - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE$1 * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES$1 + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES$1 + 1) * 2);\n  zero$1(this.dyn_ltree);\n  zero$1(this.dyn_dtree);\n  zero$1(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES$1 + 1);  /* heap used to build the Huffman trees */\n  zero$1(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES$1 + 1); //uch depth[2*L_CODES+1];\n  zero$1(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.l_buf = 0;          /* buffer index for literals or lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.last_lit = 0;      /* running index in l_buf */\n\n  this.d_buf = 0;\n  /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n   * the same number of elements. To use different lengths, an extra flag\n   * array would be necessary.\n   */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (!strm || !strm.state) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN$1;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = Z_NO_FLUSH;\n  _tr_init$1(s);\n  return Z_OK;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n  strm.state.gzhead = head;\n  return Z_OK;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED$1) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH$1 - 1) / MIN_MATCH$1);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n\n  //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n  //s->pending_buf = (uchf *) overlay;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n  s.d_buf = 1 * s.lit_bufsize;\n\n  //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n  s.l_buf = (1 + 2) * s.lit_bufsize;\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n};\n\n\nconst deflate = (strm, flush) => {\n\n  let beg, val; // for gzip header write only\n\n  if (!strm || !strm.state ||\n    flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (!strm.input && strm.avail_in !== 0) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  s.strm = strm; /* just in case */\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Write the header */\n  if (s.status === INIT_STATE) {\n\n    if (s.wrap === 2) { // GZIP header\n      strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n      put_byte(s, 31);\n      put_byte(s, 139);\n      put_byte(s, 8);\n      if (!s.gzhead) { // s->gzhead == Z_NULL\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, OS_CODE);\n        s.status = BUSY_STATE;\n      }\n      else {\n        put_byte(s, (s.gzhead.text ? 1 : 0) +\n                    (s.gzhead.hcrc ? 2 : 0) +\n                    (!s.gzhead.extra ? 0 : 4) +\n                    (!s.gzhead.name ? 0 : 8) +\n                    (!s.gzhead.comment ? 0 : 16)\n        );\n        put_byte(s, s.gzhead.time & 0xff);\n        put_byte(s, (s.gzhead.time >> 8) & 0xff);\n        put_byte(s, (s.gzhead.time >> 16) & 0xff);\n        put_byte(s, (s.gzhead.time >> 24) & 0xff);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, s.gzhead.os & 0xff);\n        if (s.gzhead.extra && s.gzhead.extra.length) {\n          put_byte(s, s.gzhead.extra.length & 0xff);\n          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n        }\n        if (s.gzhead.hcrc) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n        }\n        s.gzindex = 0;\n        s.status = EXTRA_STATE;\n      }\n    }\n    else // DEFLATE header\n    {\n      let header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n      let level_flags = -1;\n\n      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n        level_flags = 0;\n      } else if (s.level < 6) {\n        level_flags = 1;\n      } else if (s.level === 6) {\n        level_flags = 2;\n      } else {\n        level_flags = 3;\n      }\n      header |= (level_flags << 6);\n      if (s.strstart !== 0) { header |= PRESET_DICT; }\n      header += 31 - (header % 31);\n\n      s.status = BUSY_STATE;\n      putShortMSB(s, header);\n\n      /* Save the adler32 of the preset dictionary: */\n      if (s.strstart !== 0) {\n        putShortMSB(s, strm.adler >>> 16);\n        putShortMSB(s, strm.adler & 0xffff);\n      }\n      strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    }\n  }\n\n//#ifdef GZIP\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n\n      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            break;\n          }\n        }\n        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n        s.gzindex++;\n      }\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (s.gzindex === s.gzhead.extra.length) {\n        s.gzindex = 0;\n        s.status = NAME_STATE;\n      }\n    }\n    else {\n      s.status = NAME_STATE;\n    }\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.gzindex = 0;\n        s.status = COMMENT_STATE;\n      }\n    }\n    else {\n      s.status = COMMENT_STATE;\n    }\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.status = HCRC_STATE;\n      }\n    }\n    else {\n      s.status = HCRC_STATE;\n    }\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n      }\n      if (s.pending + 2 <= s.pending_buf_size) {\n        put_byte(s, strm.adler & 0xff);\n        put_byte(s, (strm.adler >> 8) & 0xff);\n        strm.adler = 0; //crc32(0L, Z_NULL, 0);\n        s.status = BUSY_STATE;\n      }\n    }\n    else {\n      s.status = BUSY_STATE;\n    }\n  }\n//#endif\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n    let bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n      (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n        configuration_table[s.level].func(s, flush));\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align$1(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block$1(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero$1(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK;\n      }\n    }\n  }\n  //Assert(strm->avail_out > 0, \"bug2\");\n  //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n  if (flush !== Z_FINISH) { return Z_OK; }\n  if (s.wrap <= 0) { return Z_STREAM_END; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  const status = strm.state.status;\n  if (status !== INIT_STATE &&\n    status !== EXTRA_STATE &&\n    status !== NAME_STATE &&\n    status !== COMMENT_STATE &&\n    status !== HCRC_STATE &&\n    status !== BUSY_STATE &&\n    status !== FINISH_STATE\n  ) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero$1(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH$1) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH$1 - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH$1 - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH$1 - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH$1 - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2 = deflate;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  let i, out;\n  const len = max || buf.length;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$1,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION$1,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY$1\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$1) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$1) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$1 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH$1) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$1) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$1;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$1) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1 = Deflate;\nvar deflate_2$1 = deflate$1;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar constants$1 = constants;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_2$1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD = 30;       /* got a data error -- remain here until reset */\nconst TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n  let base_index = 0;\n//  let shoextra;    /* extra bits table to use */\n  let end;                    /* use base and extra for symbol > end */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n  let extra_index = 0;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES) {\n    base = extra = work;    /* dummy value--not used */\n    end = 19;\n\n  } else if (type === LENS) {\n    base = lbase;\n    base_index -= 257;\n    extra = lext;\n    extra_index -= 257;\n    end = 256;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    end = -1;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS && used > ENOUGH_LENS) ||\n    (type === DISTS && used > ENOUGH_DISTS)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] < end) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] > end) {\n      here_op = extra[extra_index + work[sym]];\n      here_val = base[base_index + work[sym]];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS && used > ENOUGH_LENS) ||\n        (type === DISTS && used > ENOUGH_DISTS)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$2, Z_BLOCK: Z_BLOCK$1, Z_TREES,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2, Z_NEED_DICT, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 1;       /* i: waiting for magic header */\nconst    FLAGS = 2;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 3;       /* i: waiting for modification time (gzip) */\nconst    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 5;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 7;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 8;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 9;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 10;    /* i: waiting for dictionary check value */\nconst    DICT = 11;      /* waiting for inflateSetDictionary() call */\nconst        TYPE$1 = 12;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 14;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 17;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 18;   /* i: waiting for code length code lengths */\nconst        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 20;      /* i: same as LEN below, but only first time in */\nconst            LEN = 21;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 22;    /* i: waiting for length extra bits */\nconst            DIST = 23;      /* i: waiting for distance code */\nconst            DISTEXT = 24;   /* i: waiting for distance extra bits */\nconst            MATCH = 25;     /* o: waiting for output space to copy string */\nconst            LIT = 26;       /* o: waiting for output space to write literal */\nconst    CHECK = 27;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 29;      /* finished check, done -- remain here until reset */\nconst    BAD$1 = 30;       /* got a data error -- remain here until reset */\nconst    MEM = 31;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS$1;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.mode = 0;             /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib) */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS$1);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS$1);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$2;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 1;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.window = null/*Z_NULL*/;\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$2) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS$1,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS$1, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (!strm || !strm.state || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE$1) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$2;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        state.flags = 0;           /* expect zlib header */\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD$1;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED$2) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD$1;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        else if (len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD$1;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE$1;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED$2) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD$1;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD$1;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if (state.flags & 0x0200) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if (state.flags & 0x0200) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if (state.flags & 0x0200) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if (state.flags & 0x0200) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD$1;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE$1;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE$1;\n        /* falls through */\n      case TYPE$1:\n        if (flush === Z_BLOCK$1 || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD$1;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD$1;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE$1;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD$1;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES$1, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD$1;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD$1;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD$1;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD$1) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD$1;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS$1, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD$1;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS$1, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD$1;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE$1) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE$1;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD$1;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD$1;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD$1;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if (_out) {\n            strm.adler = state.check =\n                /*UPDATE(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD$1;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD$1;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$2;\n        break inf_leave;\n      case BAD$1:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD$1 &&\n                      (state.mode < CHECK || flush !== Z_FINISH$2))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if (state.wrap && _out) {\n    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE$1 ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$2) && ret === Z_OK$2) {\n    ret = Z_BUF_ERROR$1;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$2;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$2;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$2;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2 = inflate;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\n*/\n\nvar inflate_1 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_FINISH: Z_FINISH$3,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_MEM_ERROR: Z_MEM_ERROR$1\n} = constants;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK$3) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK$3) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$3 : Z_NO_FLUSH$2;\n\n  // Convert data if needed\n  if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT$1 && dictionary) {\n      status = inflate_1.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK$3) {\n        status = inflate_1.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR$2) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT$1;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END$3 &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1.inflateReset(strm);\n      status = inflate_1.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR$2:\n      case Z_DATA_ERROR$2:\n      case Z_NEED_DICT$1:\n      case Z_MEM_ERROR$1:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END$3) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK$3 && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END$3) {\n      status = inflate_1.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$3) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err)\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1 = Inflate;\nvar inflate_2$1 = inflate$1;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip = inflate$1;\nvar constants$2 = constants;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1,\n\tinflate: inflate_2$1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip,\n\tconstants: constants$2\n};\n\nconst { Deflate: Deflate$1, deflate: deflate$2, deflateRaw: deflateRaw$1, gzip: gzip$1 } = deflate_1$1;\n\nconst { Inflate: Inflate$1, inflate: inflate$2, inflateRaw: inflateRaw$1, ungzip: ungzip$1 } = inflate_1$1;\n\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_1$2 = deflate$2;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar Inflate_1$1 = Inflate$1;\nvar inflate_1$2 = inflate$2;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip_1 = ungzip$1;\nvar constants_1 = constants;\n\nvar pako = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_1$2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tInflate: Inflate_1$1,\n\tinflate: inflate_1$2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport default pako;\nexport { Deflate_1$1 as Deflate, Inflate_1$1 as Inflate, constants_1 as constants, deflate_1$2 as deflate, deflateRaw_1$1 as deflateRaw, gzip_1$1 as gzip, inflate_1$2 as inflate, inflateRaw_1$1 as inflateRaw, ungzip_1 as ungzip };\n","'use strict';\nvar toInteger = require('../internals/to-integer');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\n// `String.prototype.repeat` method implementation\n// https://tc39.es/ecma262/#sec-string.prototype.repeat\nmodule.exports = function repeat(count) {\n  var str = String(requireObjectCoercible(this));\n  var result = '';\n  var n = toInteger(count);\n  if (n < 0 || n == Infinity) throw RangeError('Wrong number of repetitions');\n  for (;n > 0; (n >>>= 1) && (str += str)) if (n & 1) result += str;\n  return result;\n};\n","// https://github.com/tc39/proposal-string-pad-start-end\nvar toLength = require('../internals/to-length');\nvar repeat = require('../internals/string-repeat');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar ceil = Math.ceil;\n\n// `String.prototype.{ padStart, padEnd }` methods implementation\nvar createMethod = function (IS_END) {\n  return function ($this, maxLength, fillString) {\n    var S = String(requireObjectCoercible($this));\n    var stringLength = S.length;\n    var fillStr = fillString === undefined ? ' ' : String(fillString);\n    var intMaxLength = toLength(maxLength);\n    var fillLen, stringFiller;\n    if (intMaxLength <= stringLength || fillStr == '') return S;\n    fillLen = intMaxLength - stringLength;\n    stringFiller = repeat.call(fillStr, ceil(fillLen / fillStr.length));\n    if (stringFiller.length > fillLen) stringFiller = stringFiller.slice(0, fillLen);\n    return IS_END ? S + stringFiller : stringFiller + S;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.padStart` method\n  // https://tc39.es/ecma262/#sec-string.prototype.padstart\n  start: createMethod(false),\n  // `String.prototype.padEnd` method\n  // https://tc39.es/ecma262/#sec-string.prototype.padend\n  end: createMethod(true)\n};\n","// https://github.com/zloirock/core-js/issues/280\nvar userAgent = require('../internals/engine-user-agent');\n\n// eslint-disable-next-line unicorn/no-unsafe-regex -- safe\nmodule.exports = /Version\\/10(?:\\.\\d+){1,2}(?: [\\w./]+)?(?: Mobile\\/\\w+)? Safari\\//.test(userAgent);\n","'use strict';\nvar $ = require('../internals/export');\nvar $padStart = require('../internals/string-pad').start;\nvar WEBKIT_BUG = require('../internals/string-pad-webkit-bug');\n\n// `String.prototype.padStart` method\n// https://tc39.es/ecma262/#sec-string.prototype.padstart\n$({ target: 'String', proto: true, forced: WEBKIT_BUG }, {\n  padStart: function padStart(maxLength /* , fillString = ' ' */) {\n    return $padStart(this, maxLength, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar arrayBufferModule = require('../internals/array-buffer');\nvar setSpecies = require('../internals/set-species');\n\nvar ARRAY_BUFFER = 'ArrayBuffer';\nvar ArrayBuffer = arrayBufferModule[ARRAY_BUFFER];\nvar NativeArrayBuffer = global[ARRAY_BUFFER];\n\n// `ArrayBuffer` constructor\n// https://tc39.es/ecma262/#sec-arraybuffer-constructor\n$({ global: true, forced: NativeArrayBuffer !== ArrayBuffer }, {\n  ArrayBuffer: ArrayBuffer\n});\n\nsetSpecies(ARRAY_BUFFER);\n","'use strict';\nvar $ = require('../internals/export');\nvar createHTML = require('../internals/create-html');\nvar forcedStringHTMLMethod = require('../internals/string-html-forced');\n\n// `String.prototype.sub` method\n// https://tc39.es/ecma262/#sec-string.prototype.sub\n$({ target: 'String', proto: true, forced: forcedStringHTMLMethod('sub') }, {\n  sub: function sub() {\n    return createHTML(this, 'sub', '', '');\n  }\n});\n","var defineWellKnownSymbol = require('../internals/define-well-known-symbol');\n\n// `Symbol.toPrimitive` well-known symbol\n// https://tc39.es/ecma262/#sec-symbol.toprimitive\ndefineWellKnownSymbol('toPrimitive');\n","'use strict';\nvar anObject = require('../internals/an-object');\nvar toPrimitive = require('../internals/to-primitive');\n\n// `Date.prototype[@@toPrimitive](hint)` method implementation\n// https://tc39.es/ecma262/#sec-date.prototype-@@toprimitive\nmodule.exports = function (hint) {\n  if (hint !== 'string' && hint !== 'number' && hint !== 'default') {\n    throw TypeError('Incorrect hint');\n  } return toPrimitive(anObject(this), hint !== 'number');\n};\n","var createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar dateToPrimitive = require('../internals/date-to-primitive');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_PRIMITIVE = wellKnownSymbol('toPrimitive');\nvar DatePrototype = Date.prototype;\n\n// `Date.prototype[@@toPrimitive]` method\n// https://tc39.es/ecma262/#sec-date.prototype-@@toprimitive\nif (!(TO_PRIMITIVE in DatePrototype)) {\n  createNonEnumerableProperty(DatePrototype, TO_PRIMITIVE, dateToPrimitive);\n}\n","var global = require('../internals/global');\n\nvar globalIsFinite = global.isFinite;\n\n// `Number.isFinite` method\n// https://tc39.es/ecma262/#sec-number.isfinite\n// eslint-disable-next-line es/no-number-isfinite -- safe\nmodule.exports = Number.isFinite || function isFinite(it) {\n  return typeof it == 'number' && globalIsFinite(it);\n};\n","var $ = require('../internals/export');\nvar numberIsFinite = require('../internals/number-is-finite');\n\n// `Number.isFinite` method\n// https://tc39.es/ecma262/#sec-number.isfinite\n$({ target: 'Number', stat: true }, { isFinite: numberIsFinite });\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar has = require('../internals/has');\nvar classof = require('../internals/classof-raw');\nvar inheritIfRequired = require('../internals/inherit-if-required');\nvar toPrimitive = require('../internals/to-primitive');\nvar fails = require('../internals/fails');\nvar create = require('../internals/object-create');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar defineProperty = require('../internals/object-define-property').f;\nvar trim = require('../internals/string-trim').trim;\n\nvar NUMBER = 'Number';\nvar NativeNumber = global[NUMBER];\nvar NumberPrototype = NativeNumber.prototype;\n\n// Opera ~12 has broken Object#toString\nvar BROKEN_CLASSOF = classof(create(NumberPrototype)) == NUMBER;\n\n// `ToNumber` abstract operation\n// https://tc39.es/ecma262/#sec-tonumber\nvar toNumber = function (argument) {\n  var it = toPrimitive(argument, false);\n  var first, third, radix, maxCode, digits, length, index, code;\n  if (typeof it == 'string' && it.length > 2) {\n    it = trim(it);\n    first = it.charCodeAt(0);\n    if (first === 43 || first === 45) {\n      third = it.charCodeAt(2);\n      if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\n    } else if (first === 48) {\n      switch (it.charCodeAt(1)) {\n        case 66: case 98: radix = 2; maxCode = 49; break; // fast equal of /^0b[01]+$/i\n        case 79: case 111: radix = 8; maxCode = 55; break; // fast equal of /^0o[0-7]+$/i\n        default: return +it;\n      }\n      digits = it.slice(2);\n      length = digits.length;\n      for (index = 0; index < length; index++) {\n        code = digits.charCodeAt(index);\n        // parseInt parses a string to a first unavailable symbol\n        // but ToNumber should return NaN if a string contains unavailable symbols\n        if (code < 48 || code > maxCode) return NaN;\n      } return parseInt(digits, radix);\n    }\n  } return +it;\n};\n\n// `Number` constructor\n// https://tc39.es/ecma262/#sec-number-constructor\nif (isForced(NUMBER, !NativeNumber(' 0o1') || !NativeNumber('0b1') || NativeNumber('+0x1'))) {\n  var NumberWrapper = function Number(value) {\n    var it = arguments.length < 1 ? 0 : value;\n    var dummy = this;\n    return dummy instanceof NumberWrapper\n      // check on 1..constructor(foo) case\n      && (BROKEN_CLASSOF ? fails(function () { NumberPrototype.valueOf.call(dummy); }) : classof(dummy) != NUMBER)\n        ? inheritIfRequired(new NativeNumber(toNumber(it)), dummy, NumberWrapper) : toNumber(it);\n  };\n  for (var keys = DESCRIPTORS ? getOwnPropertyNames(NativeNumber) : (\n    // ES3:\n    'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\n    // ES2015 (in case, if modules with ES2015 Number statics required before):\n    'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' +\n    'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger,' +\n    // ESNext\n    'fromString,range'\n  ).split(','), j = 0, key; keys.length > j; j++) {\n    if (has(NativeNumber, key = keys[j]) && !has(NumberWrapper, key)) {\n      defineProperty(NumberWrapper, key, getOwnPropertyDescriptor(NativeNumber, key));\n    }\n  }\n  NumberWrapper.prototype = NumberPrototype;\n  NumberPrototype.constructor = NumberWrapper;\n  redefine(global, NUMBER, NumberWrapper);\n}\n","var $ = require('../internals/export');\nvar fill = require('../internals/array-fill');\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\n// `Array.prototype.fill` method\n// https://tc39.es/ecma262/#sec-array.prototype.fill\n$({ target: 'Array', proto: true }, {\n  fill: fill\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('fill');\n","'use strict';\nvar collection = require('../internals/collection');\nvar collectionStrong = require('../internals/collection-strong');\n\n// `Set` constructor\n// https://tc39.es/ecma262/#sec-set-objects\nmodule.exports = collection('Set', function (init) {\n  return function Set() { return init(this, arguments.length ? arguments[0] : undefined); };\n}, collectionStrong);\n","var anObject = require('../internals/an-object');\nvar iteratorClose = require('../internals/iterator-close');\n\n// call something on iterator step with safe closing on error\nmodule.exports = function (iterator, fn, value, ENTRIES) {\n  try {\n    return ENTRIES ? fn(anObject(value)[0], value[1]) : fn(value);\n  } catch (error) {\n    iteratorClose(iterator);\n    throw error;\n  }\n};\n","'use strict';\nvar bind = require('../internals/function-bind-context');\nvar toObject = require('../internals/to-object');\nvar callWithSafeIterationClosing = require('../internals/call-with-safe-iteration-closing');\nvar isArrayIteratorMethod = require('../internals/is-array-iterator-method');\nvar toLength = require('../internals/to-length');\nvar createProperty = require('../internals/create-property');\nvar getIteratorMethod = require('../internals/get-iterator-method');\n\n// `Array.from` method implementation\n// https://tc39.es/ecma262/#sec-array.from\nmodule.exports = function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\n  var O = toObject(arrayLike);\n  var C = typeof this == 'function' ? this : Array;\n  var argumentsLength = arguments.length;\n  var mapfn = argumentsLength > 1 ? arguments[1] : undefined;\n  var mapping = mapfn !== undefined;\n  var iteratorMethod = getIteratorMethod(O);\n  var index = 0;\n  var length, result, step, iterator, next, value;\n  if (mapping) mapfn = bind(mapfn, argumentsLength > 2 ? arguments[2] : undefined, 2);\n  // if the target is not iterable or it's an array with the default iterator - use a simple case\n  if (iteratorMethod != undefined && !(C == Array && isArrayIteratorMethod(iteratorMethod))) {\n    iterator = iteratorMethod.call(O);\n    next = iterator.next;\n    result = new C();\n    for (;!(step = next.call(iterator)).done; index++) {\n      value = mapping ? callWithSafeIterationClosing(iterator, mapfn, [step.value, index], true) : step.value;\n      createProperty(result, index, value);\n    }\n  } else {\n    length = toLength(O.length);\n    result = new C(length);\n    for (;length > index; index++) {\n      value = mapping ? mapfn(O[index], index) : O[index];\n      createProperty(result, index, value);\n    }\n  }\n  result.length = index;\n  return result;\n};\n","var $ = require('../internals/export');\nvar from = require('../internals/array-from');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\n\nvar INCORRECT_ITERATION = !checkCorrectnessOfIteration(function (iterable) {\n  // eslint-disable-next-line es/no-array-from -- required for testing\n  Array.from(iterable);\n});\n\n// `Array.from` method\n// https://tc39.es/ecma262/#sec-array.from\n$({ target: 'Array', stat: true, forced: INCORRECT_ITERATION }, {\n  from: from\n});\n","var global = require('../internals/global');\nvar trim = require('../internals/string-trim').trim;\nvar whitespaces = require('../internals/whitespaces');\n\nvar $parseFloat = global.parseFloat;\nvar FORCED = 1 / $parseFloat(whitespaces + '-0') !== -Infinity;\n\n// `parseFloat` method\n// https://tc39.es/ecma262/#sec-parsefloat-string\nmodule.exports = FORCED ? function parseFloat(string) {\n  var trimmedString = trim(String(string));\n  var result = $parseFloat(trimmedString);\n  return result === 0 && trimmedString.charAt(0) == '-' ? -0 : result;\n} : $parseFloat;\n","var $ = require('../internals/export');\nvar parseFloat = require('../internals/number-parse-float');\n\n// `Number.parseFloat` method\n// https://tc39.es/ecma262/#sec-number.parseFloat\n// eslint-disable-next-line es/no-number-parsefloat -- required for testing\n$({ target: 'Number', stat: true, forced: Number.parseFloat != parseFloat }, {\n  parseFloat: parseFloat\n});\n","var classof = require('../internals/classof-raw');\n\n// `thisNumberValue` abstract operation\n// https://tc39.es/ecma262/#sec-thisnumbervalue\nmodule.exports = function (value) {\n  if (typeof value != 'number' && classof(value) != 'Number') {\n    throw TypeError('Incorrect invocation');\n  }\n  return +value;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar toInteger = require('../internals/to-integer');\nvar thisNumberValue = require('../internals/this-number-value');\nvar repeat = require('../internals/string-repeat');\nvar fails = require('../internals/fails');\n\nvar nativeToFixed = 1.0.toFixed;\nvar floor = Math.floor;\n\nvar pow = function (x, n, acc) {\n  return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);\n};\n\nvar log = function (x) {\n  var n = 0;\n  var x2 = x;\n  while (x2 >= 4096) {\n    n += 12;\n    x2 /= 4096;\n  }\n  while (x2 >= 2) {\n    n += 1;\n    x2 /= 2;\n  } return n;\n};\n\nvar multiply = function (data, n, c) {\n  var index = -1;\n  var c2 = c;\n  while (++index < 6) {\n    c2 += n * data[index];\n    data[index] = c2 % 1e7;\n    c2 = floor(c2 / 1e7);\n  }\n};\n\nvar divide = function (data, n) {\n  var index = 6;\n  var c = 0;\n  while (--index >= 0) {\n    c += data[index];\n    data[index] = floor(c / n);\n    c = (c % n) * 1e7;\n  }\n};\n\nvar dataToString = function (data) {\n  var index = 6;\n  var s = '';\n  while (--index >= 0) {\n    if (s !== '' || index === 0 || data[index] !== 0) {\n      var t = String(data[index]);\n      s = s === '' ? t : s + repeat.call('0', 7 - t.length) + t;\n    }\n  } return s;\n};\n\nvar FORCED = nativeToFixed && (\n  0.00008.toFixed(3) !== '0.000' ||\n  0.9.toFixed(0) !== '1' ||\n  1.255.toFixed(2) !== '1.25' ||\n  1000000000000000128.0.toFixed(0) !== '1000000000000000128'\n) || !fails(function () {\n  // V8 ~ Android 4.3-\n  nativeToFixed.call({});\n});\n\n// `Number.prototype.toFixed` method\n// https://tc39.es/ecma262/#sec-number.prototype.tofixed\n$({ target: 'Number', proto: true, forced: FORCED }, {\n  toFixed: function toFixed(fractionDigits) {\n    var number = thisNumberValue(this);\n    var fractDigits = toInteger(fractionDigits);\n    var data = [0, 0, 0, 0, 0, 0];\n    var sign = '';\n    var result = '0';\n    var e, z, j, k;\n\n    if (fractDigits < 0 || fractDigits > 20) throw RangeError('Incorrect fraction digits');\n    // eslint-disable-next-line no-self-compare -- NaN check\n    if (number != number) return 'NaN';\n    if (number <= -1e21 || number >= 1e21) return String(number);\n    if (number < 0) {\n      sign = '-';\n      number = -number;\n    }\n    if (number > 1e-21) {\n      e = log(number * pow(2, 69, 1)) - 69;\n      z = e < 0 ? number * pow(2, -e, 1) : number / pow(2, e, 1);\n      z *= 0x10000000000000;\n      e = 52 - e;\n      if (e > 0) {\n        multiply(data, 0, z);\n        j = fractDigits;\n        while (j >= 7) {\n          multiply(data, 1e7, 0);\n          j -= 7;\n        }\n        multiply(data, pow(10, j, 1), 0);\n        j = e - 1;\n        while (j >= 23) {\n          divide(data, 1 << 23);\n          j -= 23;\n        }\n        divide(data, 1 << j);\n        multiply(data, 1, 1);\n        divide(data, 2);\n        result = dataToString(data);\n      } else {\n        multiply(data, 0, z);\n        multiply(data, 1 << -e, 0);\n        result = dataToString(data) + repeat.call('0', fractDigits);\n      }\n    }\n    if (fractDigits > 0) {\n      k = result.length;\n      result = sign + (k <= fractDigits\n        ? '0.' + repeat.call('0', fractDigits - k) + result\n        : result.slice(0, k - fractDigits) + '.' + result.slice(k - fractDigits));\n    } else {\n      result = sign + result;\n    } return result;\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar toLength = require('../internals/to-length');\nvar notARegExp = require('../internals/not-a-regexp');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar correctIsRegExpLogic = require('../internals/correct-is-regexp-logic');\nvar IS_PURE = require('../internals/is-pure');\n\n// eslint-disable-next-line es/no-string-prototype-endswith -- safe\nvar $endsWith = ''.endsWith;\nvar min = Math.min;\n\nvar CORRECT_IS_REGEXP_LOGIC = correctIsRegExpLogic('endsWith');\n// https://github.com/zloirock/core-js/pull/702\nvar MDN_POLYFILL_BUG = !IS_PURE && !CORRECT_IS_REGEXP_LOGIC && !!function () {\n  var descriptor = getOwnPropertyDescriptor(String.prototype, 'endsWith');\n  return descriptor && !descriptor.writable;\n}();\n\n// `String.prototype.endsWith` method\n// https://tc39.es/ecma262/#sec-string.prototype.endswith\n$({ target: 'String', proto: true, forced: !MDN_POLYFILL_BUG && !CORRECT_IS_REGEXP_LOGIC }, {\n  endsWith: function endsWith(searchString /* , endPosition = @length */) {\n    var that = String(requireObjectCoercible(this));\n    notARegExp(searchString);\n    var endPosition = arguments.length > 1 ? arguments[1] : undefined;\n    var len = toLength(that.length);\n    var end = endPosition === undefined ? len : min(toLength(endPosition), len);\n    var search = String(searchString);\n    return $endsWith\n      ? $endsWith.call(that, search, end)\n      : that.slice(end - search.length, end) === search;\n  }\n});\n","var global = require('../internals/global');\nvar trim = require('../internals/string-trim').trim;\nvar whitespaces = require('../internals/whitespaces');\n\nvar $parseInt = global.parseInt;\nvar hex = /^[+-]?0[Xx]/;\nvar FORCED = $parseInt(whitespaces + '08') !== 8 || $parseInt(whitespaces + '0x16') !== 22;\n\n// `parseInt` method\n// https://tc39.es/ecma262/#sec-parseint-string-radix\nmodule.exports = FORCED ? function parseInt(string, radix) {\n  var S = trim(String(string));\n  return $parseInt(S, (radix >>> 0) || (hex.test(S) ? 16 : 10));\n} : $parseInt;\n","var $ = require('../internals/export');\nvar parseInt = require('../internals/number-parse-int');\n\n// `Number.parseInt` method\n// https://tc39.es/ecma262/#sec-number.parseint\n// eslint-disable-next-line es/no-number-parseint -- required for testing\n$({ target: 'Number', stat: true, forced: Number.parseInt != parseInt }, {\n  parseInt: parseInt\n});\n","var createTypedArrayConstructor = require('../internals/typed-array-constructor');\n\n// `Int16Array` constructor\n// https://tc39.es/ecma262/#sec-typedarray-objects\ncreateTypedArrayConstructor('Int16', function (init) {\n  return function Int16Array(data, byteOffset, length) {\n    return init(this, data, byteOffset, length);\n  };\n});\n","'use strict';\nvar $ = require('../internals/export');\n\n// `URL.prototype.toJSON` method\n// https://url.spec.whatwg.org/#dom-url-tojson\n$({ target: 'URL', proto: true, enumerable: true }, {\n  toJSON: function toJSON() {\n    return URL.prototype.toString.call(this);\n  }\n});\n","var $ = require('../internals/export');\nvar FREEZING = require('../internals/freezing');\nvar fails = require('../internals/fails');\nvar isObject = require('../internals/is-object');\nvar onFreeze = require('../internals/internal-metadata').onFreeze;\n\n// eslint-disable-next-line es/no-object-freeze -- safe\nvar $freeze = Object.freeze;\nvar FAILS_ON_PRIMITIVES = fails(function () { $freeze(1); });\n\n// `Object.freeze` method\n// https://tc39.es/ecma262/#sec-object.freeze\n$({ target: 'Object', stat: true, forced: FAILS_ON_PRIMITIVES, sham: !FREEZING }, {\n  freeze: function freeze(it) {\n    return $freeze && isObject(it) ? $freeze(onFreeze(it)) : it;\n  }\n});\n","var r;\n\nmodule.exports = function rand(len) {\n  if (!r)\n    r = new Rand(null);\n\n  return r.generate(len);\n};\n\nfunction Rand(rand) {\n  this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n  return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n  if (this.rand.getBytes)\n    return this.rand.getBytes(n);\n\n  var res = new Uint8Array(n);\n  for (var i = 0; i < res.length; i++)\n    res[i] = this.rand.getByte();\n  return res;\n};\n\nif (typeof self === 'object') {\n  if (self.crypto && self.crypto.getRandomValues) {\n    // Modern browsers\n    Rand.prototype._rand = function _rand(n) {\n      var arr = new Uint8Array(n);\n      self.crypto.getRandomValues(arr);\n      return arr;\n    };\n  } else if (self.msCrypto && self.msCrypto.getRandomValues) {\n    // IE\n    Rand.prototype._rand = function _rand(n) {\n      var arr = new Uint8Array(n);\n      self.msCrypto.getRandomValues(arr);\n      return arr;\n    };\n\n  // Safari's WebWorkers do not have `crypto`\n  } else if (typeof window === 'object') {\n    // Old junk\n    Rand.prototype._rand = function() {\n      throw new Error('Not implemented yet');\n    };\n  }\n} else {\n  // Node.js or Web worker with no crypto support\n  try {\n    var crypto = require('crypto');\n    if (typeof crypto.randomBytes !== 'function')\n      throw new Error('Not supported');\n\n    Rand.prototype._rand = function _rand(n) {\n      return crypto.randomBytes(n);\n    };\n  } catch (e) {\n  }\n}\n","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","if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      ctor.prototype = Object.create(superCtor.prototype, {\n        constructor: {\n          value: ctor,\n          enumerable: false,\n          writable: true,\n          configurable: true\n        }\n      })\n    }\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      var TempCtor = function () {}\n      TempCtor.prototype = superCtor.prototype\n      ctor.prototype = new TempCtor()\n      ctor.prototype.constructor = ctor\n    }\n  }\n}\n","'use strict';\n\nvar 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","var $ = require('../internals/export');\n\nvar floor = Math.floor;\nvar log = Math.log;\nvar LOG2E = Math.LOG2E;\n\n// `Math.clz32` method\n// https://tc39.es/ecma262/#sec-math.clz32\n$({ target: 'Math', stat: true }, {\n  clz32: function clz32(x) {\n    return (x >>>= 0) ? 31 - floor(log(x + 0.5) * LOG2E) : 32;\n  }\n});\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\n\n// eslint-disable-next-line es/no-math-imul -- required for testing\nvar $imul = Math.imul;\n\nvar FORCED = fails(function () {\n  return $imul(0xFFFFFFFF, 5) != -5 || $imul.length != 2;\n});\n\n// `Math.imul` method\n// https://tc39.es/ecma262/#sec-math.imul\n// some WebKit versions fails with big numbers, some has wrong arity\n$({ target: 'Math', stat: true, forced: FORCED }, {\n  imul: function imul(x, y) {\n    var UINT16 = 0xFFFF;\n    var xn = +x;\n    var yn = +y;\n    var xl = UINT16 & xn;\n    var yl = UINT16 & yn;\n    return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0);\n  }\n});\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [ number & 0x3ffffff ];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [ 0 ];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this.strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // 'A' - 'F'\n    if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    // '0' - '9'\n    } else {\n      return (c - 48) & 0xf;\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this.strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is BN v4 instance\n        r.strip();\n      } else {\n        // r is BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","'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  naf.fill(0);\n\n  var ws = 1 << (w + 1);\n  var k = num.clone();\n\n  for (var i = 0; i < naf.length; i++) {\n    var z;\n    var mod = k.andln(ws - 1);\n    if (k.isOdd()) {\n      if (mod > (ws >> 1) - 1)\n        z = (ws >> 1) - mod;\n      else\n        z = mod;\n      k.isubn(z);\n    } else {\n      z = 0;\n    }\n\n    naf[i] = z;\n    k.iushrn(1);\n  }\n\n  return naf;\n}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n  var jsf = [\n    [],\n    [],\n  ];\n\n  k1 = k1.clone();\n  k2 = k2.clone();\n  var d1 = 0;\n  var d2 = 0;\n  var m8;\n  while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n    // First phase\n    var m14 = (k1.andln(3) + d1) & 3;\n    var m24 = (k2.andln(3) + d2) & 3;\n    if (m14 === 3)\n      m14 = -1;\n    if (m24 === 3)\n      m24 = -1;\n    var u1;\n    if ((m14 & 1) === 0) {\n      u1 = 0;\n    } else {\n      m8 = (k1.andln(7) + d1) & 7;\n      if ((m8 === 3 || m8 === 5) && m24 === 2)\n        u1 = -m14;\n      else\n        u1 = m14;\n    }\n    jsf[0].push(u1);\n\n    var u2;\n    if ((m24 & 1) === 0) {\n      u2 = 0;\n    } else {\n      m8 = (k2.andln(7) + d2) & 7;\n      if ((m8 === 3 || m8 === 5) && m14 === 2)\n        u2 = -m24;\n      else\n        u2 = m24;\n    }\n    jsf[1].push(u2);\n\n    // Second phase\n    if (2 * d1 === u1 + 1)\n      d1 = 1 - d1;\n    if (2 * d2 === u2 + 1)\n      d2 = 1 - d2;\n    k1.iushrn(1);\n    k2.iushrn(1);\n  }\n\n  return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n  var key = '_' + name;\n  obj.prototype[name] = function cachedProperty() {\n    return this[key] !== undefined ? this[key] :\n      this[key] = computer.call(this);\n  };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n  return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n    bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n  return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","'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","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) {\n  return this.ec.verify(msg, signature, this);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n  return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) +\n         ' pub: ' + (this.pub && this.pub.inspect()) + ' >';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n  if (options instanceof Signature)\n    return options;\n\n  if (this._importDER(options, enc))\n    return;\n\n  assert(options.r && options.s, 'Signature without r or s');\n  this.r = new BN(options.r, 16);\n  this.s = new BN(options.s, 16);\n  if (options.recoveryParam === undefined)\n    this.recoveryParam = null;\n  else\n    this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n  this.place = 0;\n}\n\nfunction getLength(buf, p) {\n  var initial = buf[p.place++];\n  if (!(initial & 0x80)) {\n    return initial;\n  }\n  var octetLen = initial & 0xf;\n\n  // Indefinite length or overflow\n  if (octetLen === 0 || octetLen > 4) {\n    return false;\n  }\n\n  var val = 0;\n  for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n    val <<= 8;\n    val |= buf[off];\n    val >>>= 0;\n  }\n\n  // Leading zeroes\n  if (val <= 0x7f) {\n    return false;\n  }\n\n  p.place = off;\n  return val;\n}\n\nfunction rmPadding(buf) {\n  var i = 0;\n  var len = buf.length - 1;\n  while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n    i++;\n  }\n  if (i === 0) {\n    return buf;\n  }\n  return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n  data = utils.toArray(data, enc);\n  var p = new Position();\n  if (data[p.place++] !== 0x30) {\n    return false;\n  }\n  var len = getLength(data, p);\n  if (len === false) {\n    return false;\n  }\n  if ((len + p.place) !== data.length) {\n    return false;\n  }\n  if (data[p.place++] !== 0x02) {\n    return false;\n  }\n  var rlen = getLength(data, p);\n  if (rlen === false) {\n    return false;\n  }\n  var r = data.slice(p.place, rlen + p.place);\n  p.place += rlen;\n  if (data[p.place++] !== 0x02) {\n    return false;\n  }\n  var slen = getLength(data, p);\n  if (slen === false) {\n    return false;\n  }\n  if (data.length !== slen + p.place) {\n    return false;\n  }\n  var s = data.slice(p.place, slen + p.place);\n  if (r[0] === 0) {\n    if (r[1] & 0x80) {\n      r = r.slice(1);\n    } else {\n      // Leading zeroes\n      return false;\n    }\n  }\n  if (s[0] === 0) {\n    if (s[1] & 0x80) {\n      s = s.slice(1);\n    } else {\n      // Leading zeroes\n      return false;\n    }\n  }\n\n  this.r = new BN(r);\n  this.s = new BN(s);\n  this.recoveryParam = null;\n\n  return true;\n};\n\nfunction constructLength(arr, len) {\n  if (len < 0x80) {\n    arr.push(len);\n    return;\n  }\n  var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n  arr.push(octets | 0x80);\n  while (--octets) {\n    arr.push((len >>> (octets << 3)) & 0xff);\n  }\n  arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n  var r = this.r.toArray();\n  var s = this.s.toArray();\n\n  // Pad values\n  if (r[0] & 0x80)\n    r = [ 0 ].concat(r);\n  // Pad values\n  if (s[0] & 0x80)\n    s = [ 0 ].concat(s);\n\n  r = rmPadding(r);\n  s = rmPadding(s);\n\n  while (!s[0] && !(s[1] & 0x80)) {\n    s = s.slice(1);\n  }\n  var arr = [ 0x02 ];\n  constructLength(arr, r.length);\n  arr = arr.concat(r);\n  arr.push(0x02);\n  constructLength(arr, s.length);\n  var backHalf = arr.concat(s);\n  var res = [ 0x30 ];\n  constructLength(res, backHalf.length);\n  res = res.concat(backHalf);\n  return utils.encode(res, enc);\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n  if (!(this instanceof EC))\n    return new EC(options);\n\n  // Shortcut `elliptic.ec(curve-name)`\n  if (typeof options === 'string') {\n    assert(Object.prototype.hasOwnProperty.call(curves, options),\n      'Unknown curve ' + options);\n\n    options = curves[options];\n  }\n\n  // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n  if (options instanceof curves.PresetCurve)\n    options = { curve: options };\n\n  this.curve = options.curve.curve;\n  this.n = this.curve.n;\n  this.nh = this.n.ushrn(1);\n  this.g = this.curve.g;\n\n  // Point on curve\n  this.g = options.curve.g;\n  this.g.precompute(options.curve.n.bitLength() + 1);\n\n  // Hash for function for DRBG\n  this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n  return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n  return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n  return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n  if (!options)\n    options = {};\n\n  // Instantiate Hmac_DRBG\n  var drbg = new HmacDRBG({\n    hash: this.hash,\n    pers: options.pers,\n    persEnc: options.persEnc || 'utf8',\n    entropy: options.entropy || rand(this.hash.hmacStrength),\n    entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n    nonce: this.n.toArray(),\n  });\n\n  var bytes = this.n.byteLength();\n  var ns2 = this.n.sub(new BN(2));\n  for (;;) {\n    var priv = new BN(drbg.generate(bytes));\n    if (priv.cmp(ns2) > 0)\n      continue;\n\n    priv.iaddn(1);\n    return this.keyFromPrivate(priv);\n  }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly) {\n  var delta = msg.byteLength() * 8 - this.n.bitLength();\n  if (delta > 0)\n    msg = msg.ushrn(delta);\n  if (!truncOnly && msg.cmp(this.n) >= 0)\n    return msg.sub(this.n);\n  else\n    return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n  if (typeof enc === 'object') {\n    options = enc;\n    enc = null;\n  }\n  if (!options)\n    options = {};\n\n  key = this.keyFromPrivate(key, enc);\n  msg = this._truncateToN(new BN(msg, 16));\n\n  // Zero-extend key to provide enough entropy\n  var bytes = this.n.byteLength();\n  var bkey = key.getPrivate().toArray('be', bytes);\n\n  // Zero-extend nonce to have the same byte size as N\n  var nonce = msg.toArray('be', bytes);\n\n  // Instantiate Hmac_DRBG\n  var drbg = new HmacDRBG({\n    hash: this.hash,\n    entropy: bkey,\n    nonce: nonce,\n    pers: options.pers,\n    persEnc: options.persEnc || 'utf8',\n  });\n\n  // Number of bytes to generate\n  var ns1 = this.n.sub(new BN(1));\n\n  for (var iter = 0; ; iter++) {\n    var k = options.k ?\n      options.k(iter) :\n      new BN(drbg.generate(this.n.byteLength()));\n    k = this._truncateToN(k, true);\n    if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n      continue;\n\n    var kp = this.g.mul(k);\n    if (kp.isInfinity())\n      continue;\n\n    var kpX = kp.getX();\n    var r = kpX.umod(this.n);\n    if (r.cmpn(0) === 0)\n      continue;\n\n    var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n    s = s.umod(this.n);\n    if (s.cmpn(0) === 0)\n      continue;\n\n    var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n                        (kpX.cmp(r) !== 0 ? 2 : 0);\n\n    // Use complement of `s`, if it is > `n / 2`\n    if (options.canonical && s.cmp(this.nh) > 0) {\n      s = this.n.sub(s);\n      recoveryParam ^= 1;\n    }\n\n    return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n  }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc) {\n  msg = this._truncateToN(new BN(msg, 16));\n  key = this.keyFromPublic(key, enc);\n  signature = new Signature(signature, 'hex');\n\n  // Perform primitive values validation\n  var r = signature.r;\n  var s = signature.s;\n  if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n    return false;\n  if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n    return false;\n\n  // Validate signature\n  var sinv = s.invm(this.n);\n  var u1 = sinv.mul(msg).umod(this.n);\n  var u2 = sinv.mul(r).umod(this.n);\n  var p;\n\n  if (!this.curve._maxwellTrick) {\n    p = this.g.mulAdd(u1, key.getPublic(), u2);\n    if (p.isInfinity())\n      return false;\n\n    return p.getX().umod(this.n).cmp(r) === 0;\n  }\n\n  // NOTE: Greg Maxwell's trick, inspired by:\n  // https://git.io/vad3K\n\n  p = this.g.jmulAdd(u1, key.getPublic(), u2);\n  if (p.isInfinity())\n    return false;\n\n  // Compare `p.x` of Jacobian point with `r`,\n  // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n  // inverse of `p.z^2`\n  return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n  assert((3 & j) === j, 'The recovery param is more than two bits');\n  signature = new Signature(signature, enc);\n\n  var n = this.n;\n  var e = new BN(msg);\n  var r = signature.r;\n  var s = signature.s;\n\n  // A set LSB signifies that the y-coordinate is odd\n  var isYOdd = j & 1;\n  var isSecondKey = j >> 1;\n  if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n    throw new Error('Unable to find sencond key candinate');\n\n  // 1.1. Let x = r + jn.\n  if (isSecondKey)\n    r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n  else\n    r = this.curve.pointFromX(r, isYOdd);\n\n  var rInv = signature.r.invm(n);\n  var s1 = n.sub(e).mul(rInv).umod(n);\n  var s2 = s.mul(rInv).umod(n);\n\n  // 1.6.1 Compute Q = r^-1 (sR -  eG)\n  //               Q = r^-1 (sR + -eG)\n  return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n  signature = new Signature(signature, enc);\n  if (signature.recoveryParam !== null)\n    return signature.recoveryParam;\n\n  for (var i = 0; i < 4; i++) {\n    var Qprime;\n    try {\n      Qprime = this.recoverPubKey(e, signature, i);\n    } catch (e) {\n      continue;\n    }\n\n    if (Qprime.eq(Q))\n      return i;\n  }\n  throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array<Byte>} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array<Byte>} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n  this.eddsa = eddsa;\n  this._secret = parseBytes(params.secret);\n  if (eddsa.isPoint(params.pub))\n    this._pub = params.pub;\n  else\n    this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n  if (pub instanceof KeyPair)\n    return pub;\n  return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n  if (secret instanceof KeyPair)\n    return secret;\n  return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n  return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n  return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n  if (this._pubBytes)\n    return this.eddsa.decodePoint(this._pubBytes);\n  return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n  var eddsa = this.eddsa;\n  var hash = this.hash();\n  var lastIx = eddsa.encodingLength - 1;\n\n  var a = hash.slice(0, eddsa.encodingLength);\n  a[0] &= 248;\n  a[lastIx] &= 127;\n  a[lastIx] |= 64;\n\n  return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n  return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n  return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n  return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n  assert(this._secret, 'KeyPair can only verify');\n  return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n  return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n  assert(this._secret, 'KeyPair is public only');\n  return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n  return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array<Bytes>|Object} sig -\n* @param {Array<Bytes>|Point} [sig.R] - R point as Point or bytes\n* @param {Array<Bytes>|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array<Bytes>} [sig.Rencoded] - R point encoded\n* @param {Array<Bytes>} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n  this.eddsa = eddsa;\n\n  if (typeof sig !== 'object')\n    sig = parseBytes(sig);\n\n  if (Array.isArray(sig)) {\n    sig = {\n      R: sig.slice(0, eddsa.encodingLength),\n      S: sig.slice(eddsa.encodingLength),\n    };\n  }\n\n  assert(sig.R && sig.S, 'Signature without R or S');\n\n  if (eddsa.isPoint(sig.R))\n    this._R = sig.R;\n  if (sig.S instanceof BN)\n    this._S = sig.S;\n\n  this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n  this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n  return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n  return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n  return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n  return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n  return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n  return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n  assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n  if (!(this instanceof EDDSA))\n    return new EDDSA(curve);\n\n  curve = curves[curve].curve;\n  this.curve = curve;\n  this.g = curve.g;\n  this.g.precompute(curve.n.bitLength() + 1);\n\n  this.pointClass = curve.point().constructor;\n  this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n  this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n  message = parseBytes(message);\n  var key = this.keyFromSecret(secret);\n  var r = this.hashInt(key.messagePrefix(), message);\n  var R = this.g.mul(r);\n  var Rencoded = this.encodePoint(R);\n  var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n    .mul(key.priv());\n  var S = r.add(s_).umod(this.curve.n);\n  return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n  message = parseBytes(message);\n  sig = this.makeSignature(sig);\n  var key = this.keyFromPublic(pub);\n  var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n  var SG = this.g.mul(sig.S());\n  var RplusAh = sig.R().add(key.pub().mul(h));\n  return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n  var hash = this.hash();\n  for (var i = 0; i < arguments.length; i++)\n    hash.update(arguments[i]);\n  return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n  return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n  return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n  if (sig instanceof Signature)\n    return sig;\n  return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n  var enc = point.getY().toArray('le', this.encodingLength);\n  enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n  return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n  bytes = utils.parseBytes(bytes);\n\n  var lastIx = bytes.length - 1;\n  var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n  var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n  var y = utils.intFromLE(normed);\n  return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n  return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n  return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n  return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar elliptic = exports;\n\nelliptic.version = require('../package.json').version;\nelliptic.utils = require('./elliptic/utils');\nelliptic.rand = require('brorand');\nelliptic.curve = require('./elliptic/curve');\nelliptic.curves = require('./elliptic/curves');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar objectKeys = require('../internals/object-keys');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar toObject = require('../internals/to-object');\nvar IndexedObject = require('../internals/indexed-object');\n\n// eslint-disable-next-line es/no-object-assign -- safe\nvar $assign = Object.assign;\n// eslint-disable-next-line es/no-object-defineproperty -- required for testing\nvar defineProperty = Object.defineProperty;\n\n// `Object.assign` method\n// https://tc39.es/ecma262/#sec-object.assign\nmodule.exports = !$assign || fails(function () {\n  // should have correct order of operations (Edge bug)\n  if (DESCRIPTORS && $assign({ b: 1 }, $assign(defineProperty({}, 'a', {\n    enumerable: true,\n    get: function () {\n      defineProperty(this, 'b', {\n        value: 3,\n        enumerable: false\n      });\n    }\n  }), { b: 2 })).b !== 1) return true;\n  // should work with symbols and should have deterministic property order (V8 bug)\n  var A = {};\n  var B = {};\n  // eslint-disable-next-line es/no-symbol -- safe\n  var symbol = Symbol();\n  var alphabet = 'abcdefghijklmnopqrst';\n  A[symbol] = 7;\n  alphabet.split('').forEach(function (chr) { B[chr] = chr; });\n  return $assign({}, A)[symbol] != 7 || objectKeys($assign({}, B)).join('') != alphabet;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars -- required for `.length`\n  var T = toObject(target);\n  var argumentsLength = arguments.length;\n  var index = 1;\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  var propertyIsEnumerable = propertyIsEnumerableModule.f;\n  while (argumentsLength > index) {\n    var S = IndexedObject(arguments[index++]);\n    var keys = getOwnPropertySymbols ? objectKeys(S).concat(getOwnPropertySymbols(S)) : objectKeys(S);\n    var length = keys.length;\n    var j = 0;\n    var key;\n    while (length > j) {\n      key = keys[j++];\n      if (!DESCRIPTORS || propertyIsEnumerable.call(S, key)) T[key] = S[key];\n    }\n  } return T;\n} : $assign;\n","var $ = require('../internals/export');\nvar assign = require('../internals/object-assign');\n\n// `Object.assign` method\n// https://tc39.es/ecma262/#sec-object.assign\n// eslint-disable-next-line es/no-object-assign -- required for testing\n$({ target: 'Object', stat: true, forced: Object.assign !== assign }, {\n  assign: assign\n});\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar nativeGetOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar DESCRIPTORS = require('../internals/descriptors');\n\nvar FAILS_ON_PRIMITIVES = fails(function () { nativeGetOwnPropertyDescriptor(1); });\nvar FORCED = !DESCRIPTORS || FAILS_ON_PRIMITIVES;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptor\n$({ target: 'Object', stat: true, forced: FORCED, sham: !DESCRIPTORS }, {\n  getOwnPropertyDescriptor: function getOwnPropertyDescriptor(it, key) {\n    return nativeGetOwnPropertyDescriptor(toIndexedObject(it), key);\n  }\n});\n","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from) {\r\n    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\r\n        to[j] = from[i];\r\n    return to;\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n","/**\n * EOSIO Core v0.4.6\n * https://github.com/greymass/eosio-core\n *\n * @license\n * Copyright (c) 2020 FFF00 Agents AB & Greymass Inc. All Rights Reserved.\n * \n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n * \n *  1. Redistribution of source code must retain the above copyright notice, this\n *     list of conditions and the following disclaimer.\n * \n *  2. Redistribution in binary form must reproduce the above copyright notice,\n *     this list of conditions and the following disclaimer in the documentation\n *     and/or other materials provided with the distribution.\n * \n *  3. Neither the name of the copyright holder nor the names of its contributors\n *     may be used to endorse or promote products derived from this software without\n *     specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n * YOU ACKNOWLEDGE THAT THIS SOFTWARE IS NOT DESIGNED, LICENSED OR INTENDED FOR USE\n * IN THE DESIGN, CONSTRUCTION, OPERATION OR MAINTENANCE OF ANY MILITARY FACILITY.\n */\nimport rand from 'brorand';\nimport { sha256, sha512, ripemd160 } from 'hash.js';\nimport BN from 'bn.js';\nimport { ec } from 'elliptic';\nimport { __decorate } from 'tslib';\n\nfunction arrayEquals(a, b) {\n    const len = a.length;\n    if (len !== b.length) {\n        return false;\n    }\n    for (let i = 0; i < len; i++) {\n        if (a[i] !== b[i]) {\n            return false;\n        }\n    }\n    return true;\n}\nfunction arrayEquatableEquals(a, b) {\n    const len = a.length;\n    if (len !== b.length) {\n        return false;\n    }\n    for (let i = 0; i < len; i++) {\n        if (!a[i].equals(b[i])) {\n            return false;\n        }\n    }\n    return true;\n}\nconst hexLookup = {};\nfunction buildHexLookup() {\n    hexLookup.enc = new Array(0xff);\n    hexLookup.dec = {};\n    for (let i = 0; i <= 0xff; ++i) {\n        const b = i.toString(16).padStart(2, '0');\n        hexLookup.enc[i] = b;\n        hexLookup.dec[b] = i;\n    }\n}\nfunction arrayToHex(array) {\n    if (!hexLookup.enc) {\n        buildHexLookup();\n    }\n    const len = array.length;\n    const rv = new Array(len);\n    for (let i = 0; i < len; ++i) {\n        rv[i] = hexLookup.enc[array[i]];\n    }\n    return rv.join('');\n}\nfunction hexToArray(hex) {\n    if (!hexLookup.dec) {\n        buildHexLookup();\n    }\n    if (typeof hex !== 'string') {\n        throw new Error('Expected string containing hex digits');\n    }\n    if (hex.length % 2) {\n        throw new Error('Odd number of hex digits');\n    }\n    hex = hex.toLowerCase();\n    const len = hex.length / 2;\n    const result = new Uint8Array(len);\n    for (let i = 0; i < len; i++) {\n        const b = hexLookup.dec[hex[i * 2] + hex[i * 2 + 1]];\n        if (b === undefined) {\n            throw new Error('Expected hex string');\n        }\n        result[i] = b;\n    }\n    return result;\n}\n/** Generate N random bytes, throws if a secure random source isn't available. */\nfunction secureRandom(length) {\n    return rand(length);\n}\n/** Used in isInstanceOf checks so we don't spam with warnings. */\nlet didWarn = false;\n/** Check if object in instance of class. */\nfunction isInstanceOf(object, someClass) {\n    if (object instanceof someClass) {\n        return true;\n    }\n    if (object == null || typeof object !== 'object') {\n        return false;\n    }\n    // not an actual instance but since bundlers can fail to dedupe stuff or\n    // multiple versions can be included we check for compatibility if possible\n    const className = someClass['__className'] || someClass['abiName'];\n    if (!className) {\n        return false;\n    }\n    let instanceClass = object.constructor;\n    let isAlienInstance = false;\n    while (instanceClass && !isAlienInstance) {\n        const instanceClassName = instanceClass['__className'] || instanceClass['abiName'];\n        if (!instanceClassName) {\n            break;\n        }\n        isAlienInstance = className == instanceClassName;\n        instanceClass = Object.getPrototypeOf(instanceClass);\n    }\n    if (isAlienInstance && !didWarn) {\n        // eslint-disable-next-line no-console\n        console.warn(`Detected alien instance of ${className}, this usually means more than one version of @greymass/eosio has been included in your bundle.`);\n        didWarn = true;\n    }\n    return isAlienInstance;\n}\n\nclass Bytes {\n    constructor(array = new Uint8Array()) {\n        this.array = array;\n    }\n    static from(value, encoding) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        if (typeof value === 'string') {\n            return this.fromString(value, encoding);\n        }\n        if (isInstanceOf(value, Uint8Array)) {\n            return new this(value);\n        }\n        return new this(new Uint8Array(value));\n    }\n    static fromString(value, encoding = 'hex') {\n        if (encoding === 'hex') {\n            const array = hexToArray(value);\n            return new this(array);\n        }\n        else if (encoding == 'utf8') {\n            const encoder = new TextEncoder();\n            return new this(encoder.encode(value));\n        }\n        else {\n            throw new Error(`Unknown encoding: ${encoding}`);\n        }\n    }\n    static fromABI(decoder) {\n        const len = decoder.readVaruint32();\n        return new this(decoder.readArray(len));\n    }\n    static equal(a, b) {\n        return this.from(a).equals(this.from(b));\n    }\n    static random(length) {\n        return new this(secureRandom(length));\n    }\n    /** Return true if given value is a valid `BytesType`. */\n    static isBytes(value) {\n        if (isInstanceOf(value, Bytes) || isInstanceOf(value, Uint8Array)) {\n            return true;\n        }\n        if (Array.isArray(value) && value.every((v) => typeof v === 'number')) {\n            return true;\n        }\n        if (typeof value === 'string' && (/[\\da-f]/i.test(value) || value === '')) {\n            return true;\n        }\n        return false;\n    }\n    get hexString() {\n        return arrayToHex(this.array);\n    }\n    get utf8String() {\n        return new TextDecoder().decode(this.array);\n    }\n    appending(other) {\n        other = Bytes.from(other);\n        const newSize = this.array.byteLength + other.array.byteLength;\n        const buffer = new ArrayBuffer(newSize);\n        const array = new Uint8Array(buffer);\n        array.set(this.array);\n        array.set(other.array, this.array.byteLength);\n        return new Bytes(array);\n    }\n    droppingFirst(n = 1) {\n        return new Bytes(this.array.subarray(n));\n    }\n    copy() {\n        const buffer = new ArrayBuffer(this.array.byteLength);\n        const array = new Uint8Array(buffer);\n        array.set(this.array);\n        return new Bytes(array);\n    }\n    equals(other) {\n        return arrayEquals(this.array, Bytes.from(other).array);\n    }\n    toString(encoding = 'hex') {\n        if (encoding === 'hex') {\n            return this.hexString;\n        }\n        else if (encoding === 'utf8') {\n            return this.utf8String;\n        }\n        else {\n            throw new Error(`Unknown encoding: ${encoding}`);\n        }\n    }\n    toABI(encoder) {\n        encoder.writeVaruint32(this.array.byteLength);\n        encoder.writeArray(this.array);\n    }\n    toJSON() {\n        return this.hexString;\n    }\n}\nBytes.abiName = 'bytes';\n\nclass Checksum {\n    constructor(array) {\n        const byteSize = this.constructor.byteSize;\n        if (array.byteLength !== byteSize) {\n            throw new Error(`Checksum size mismatch, expected ${byteSize} bytes got ${array.byteLength}`);\n        }\n        this.array = array;\n    }\n    static from(value) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        if (isInstanceOf(value, Checksum)) {\n            return new this(value.array);\n        }\n        return new this(Bytes.from(value).array);\n    }\n    static fromABI(decoder) {\n        return new this(decoder.readArray(this.byteSize));\n    }\n    equals(other) {\n        const self = this.constructor;\n        try {\n            return arrayEquals(this.array, self.from(other).array);\n        }\n        catch {\n            return false;\n        }\n    }\n    get hexString() {\n        return arrayToHex(this.array);\n    }\n    toABI(encoder) {\n        encoder.writeArray(this.array);\n    }\n    toString() {\n        return this.hexString;\n    }\n    toJSON() {\n        return this.toString();\n    }\n}\nChecksum.abiName = '__checksum';\nclass Checksum256 extends Checksum {\n    static from(value) {\n        return super.from(value);\n    }\n    static hash(data) {\n        const digest = new Uint8Array(sha256().update(Bytes.from(data).array).digest());\n        return new Checksum256(digest);\n    }\n}\nChecksum256.abiName = 'checksum256';\nChecksum256.byteSize = 32;\nclass Checksum512 extends Checksum {\n    static from(value) {\n        return super.from(value);\n    }\n    static hash(data) {\n        const digest = new Uint8Array(sha512().update(Bytes.from(data).array).digest());\n        return new Checksum512(digest);\n    }\n}\nChecksum512.abiName = 'checksum512';\nChecksum512.byteSize = 64;\nclass Checksum160 extends Checksum {\n    static from(value) {\n        return super.from(value);\n    }\n    static hash(data) {\n        const digest = new Uint8Array(ripemd160().update(Bytes.from(data).array).digest());\n        return new Checksum160(digest);\n    }\n}\nChecksum160.abiName = 'checksum160';\nChecksum160.byteSize = 20;\n\n/** Supported EOSIO curve types. */\nvar CurveType;\n(function (CurveType) {\n    CurveType[\"K1\"] = \"K1\";\n    CurveType[\"R1\"] = \"R1\";\n    CurveType[\"WA\"] = \"WA\";\n})(CurveType || (CurveType = {}));\n(function (CurveType) {\n    function indexFor(value) {\n        switch (value) {\n            case CurveType.K1:\n                return 0;\n            case CurveType.R1:\n                return 1;\n            case CurveType.WA:\n                return 2;\n            default:\n                throw new Error(`Unknown curve type: ${value}`);\n        }\n    }\n    CurveType.indexFor = indexFor;\n    function from(value) {\n        let index;\n        if (typeof value !== 'number') {\n            index = CurveType.indexFor(value);\n        }\n        else {\n            index = value;\n        }\n        switch (index) {\n            case 0:\n                return CurveType.K1;\n            case 1:\n                return CurveType.R1;\n            case 2:\n                return CurveType.WA;\n            default:\n                throw new Error('Unknown curve type');\n        }\n    }\n    CurveType.from = from;\n})(CurveType || (CurveType = {}));\n\n/**\n * Binary integer with the underlying value represented by a BN.js instance.\n * Follows C++11 standard for arithmetic operators and conversions.\n * @note This type is optimized for correctness not speed, if you plan to manipulate\n *       integers in a tight loop you're advised to use the underlying BN.js value or\n *       convert to a JavaScript number first.\n */\nclass Int {\n    /**\n     * Create a new instance, don't use this directly. Use the `.from` factory method instead.\n     * @throws If the value over- or under-flows the integer type.\n     */\n    constructor(value) {\n        const self = this.constructor;\n        if (self.isSigned === undefined || self.byteWidth === undefined) {\n            throw new Error('Cannot instantiate abstract class Int');\n        }\n        if (value.gt(self.max)) {\n            throw new Error(`Number ${value} overflows ${self.abiName}`);\n        }\n        if (value.lt(self.min)) {\n            throw new Error(`Number ${value} underflows ${self.abiName}`);\n        }\n        this.value = value;\n    }\n    /** Largest value that can be represented by this integer type. */\n    static get max() {\n        return new BN(2).pow(new BN(this.byteWidth * 8 - (this.isSigned ? 1 : 0))).isubn(1);\n    }\n    /** Smallest value that can be represented by this integer type. */\n    static get min() {\n        return this.isSigned ? this.max.ineg().isubn(1) : new BN(0);\n    }\n    /** Add `lhs` to `rhs` and return the resulting value. */\n    static add(lhs, rhs, overflow = 'truncate') {\n        return Int.operator(lhs, rhs, overflow, (a, b) => a.add(b));\n    }\n    /** Add `lhs` to `rhs` and return the resulting value. */\n    static sub(lhs, rhs, overflow) {\n        return Int.operator(lhs, rhs, overflow, (a, b) => a.sub(b));\n    }\n    /** Multiply `lhs` by `rhs` and return the resulting value. */\n    static mul(lhs, rhs, overflow) {\n        return Int.operator(lhs, rhs, overflow, (a, b) => a.mul(b));\n    }\n    /**\n     * Divide `lhs` by `rhs` and return the quotient, dropping the remainder.\n     * @throws When dividing by zero.\n     */\n    static div(lhs, rhs, overflow) {\n        return Int.operator(lhs, rhs, overflow, (a, b) => {\n            if (b.isZero()) {\n                throw new Error('Division by zero');\n            }\n            return a.div(b);\n        });\n    }\n    /**\n     * Divide `lhs` by `rhs` and return the quotient + remainder rounded to the closest integer.\n     * @throws When dividing by zero.\n     */\n    static divRound(lhs, rhs, overflow) {\n        return Int.operator(lhs, rhs, overflow, (a, b) => {\n            if (b.isZero()) {\n                throw new Error('Division by zero');\n            }\n            return a.divRound(b);\n        });\n    }\n    /**\n     * Divide `lhs` by `rhs` and return the quotient + remainder rounded up to the closest integer.\n     * @throws When dividing by zero.\n     */\n    static divCeil(lhs, rhs, overflow) {\n        return Int.operator(lhs, rhs, overflow, (a, b) => {\n            if (b.isZero()) {\n                throw new Error('Division by zero');\n            }\n            const dm = a.divmod(b);\n            if (dm.mod.isZero())\n                return dm.div;\n            return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n        });\n    }\n    /**\n     * Can be used to implement custom operator.\n     * @internal\n     */\n    static operator(lhs, rhs, overflow = 'truncate', fn) {\n        const { a, b } = convert(lhs, rhs);\n        const type = a.constructor;\n        const result = fn(a.value, b.value);\n        return type.from(result, overflow);\n    }\n    static from(value, overflow) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        let fromType = this;\n        let bn;\n        if (isInstanceOf(value, Int)) {\n            fromType = value.constructor;\n            bn = value.value.clone();\n        }\n        else if (value instanceof Uint8Array) {\n            bn = new BN(value, undefined, 'le');\n            if (fromType.isSigned) {\n                bn = bn.fromTwos(fromType.byteWidth * 8);\n            }\n        }\n        else {\n            if ((typeof value === 'string' && !/[0-9]+/.test(value)) ||\n                (typeof value === 'number' && !Number.isFinite(value))) {\n                throw new Error('Invalid number');\n            }\n            bn = BN.isBN(value) ? value.clone() : new BN(value, 10);\n            if (bn.isNeg() && !fromType.isSigned) {\n                fromType = { byteWidth: fromType.byteWidth, isSigned: true };\n            }\n        }\n        switch (overflow) {\n            case 'clamp':\n                bn = clamp(bn, this.min, this.max);\n                break;\n            case 'truncate':\n                bn = truncate(bn, fromType, this);\n                break;\n        }\n        return new this(bn);\n    }\n    static fromABI(decoder) {\n        return this.from(decoder.readArray(this.byteWidth));\n    }\n    static random() {\n        return this.from(secureRandom(this.byteWidth));\n    }\n    cast(type, overflow = 'truncate') {\n        if (this.constructor === type) {\n            return this;\n        }\n        return type.from(this, overflow);\n    }\n    /** Number as bytes in little endian (matches memory layout in C++ contract). */\n    get byteArray() {\n        const self = this.constructor;\n        const value = self.isSigned ? this.value.toTwos(self.byteWidth * 8) : this.value;\n        return value.toArrayLike(Uint8Array, 'le', self.byteWidth);\n    }\n    /**\n     * Compare two integers, if strict is set to true the test will only consider integers\n     * of the exact same type. I.e. Int64.from(1).equals(UInt64.from(1)) will return false.\n     */\n    equals(other, strict = false) {\n        const self = this.constructor;\n        if (strict === true && isInstanceOf(other, Int)) {\n            const otherType = other.constructor;\n            if (self.byteWidth !== otherType.byteWidth || self.isSigned !== otherType.isSigned) {\n                return false;\n            }\n        }\n        try {\n            return this.value.eq(self.from(other).value);\n        }\n        catch {\n            return false;\n        }\n    }\n    /** Mutating add. */\n    add(num) {\n        this.value = this.operator(num, Int.add).value;\n    }\n    /** Non-mutating add. */\n    adding(num) {\n        return this.operator(num, Int.add);\n    }\n    /** Mutating subtract. */\n    subtract(num) {\n        this.value = this.operator(num, Int.sub).value;\n    }\n    /** Non-mutating subtract. */\n    subtracting(num) {\n        return this.operator(num, Int.sub);\n    }\n    /** Mutating multiply. */\n    multiply(by) {\n        this.value = this.operator(by, Int.mul).value;\n    }\n    /** Non-mutating multiply. */\n    multiplying(by) {\n        return this.operator(by, Int.mul);\n    }\n    /**\n     * Mutating divide.\n     * @param behavior How to handle the remainder, default is to floor (round down).\n     * @throws When dividing by zero.\n     */\n    divide(by, behavior) {\n        this.value = this.dividing(by, behavior).value;\n    }\n    /**\n     * Non-mutating divide.\n     * @param behavior How to handle the remainder, default is to floor (round down).\n     * @throws When dividing by zero.\n     */\n    dividing(by, behavior) {\n        let op = Int.div;\n        switch (behavior) {\n            case 'ceil':\n                op = Int.divCeil;\n                break;\n            case 'round':\n                op = Int.divRound;\n                break;\n        }\n        return this.operator(by, op);\n    }\n    /**\n     * Run operator with C++11 implicit conversion.\n     * @internal\n     */\n    operator(other, fn) {\n        let rhs;\n        if (isInstanceOf(other, Int)) {\n            rhs = other;\n        }\n        else {\n            rhs = Int64.from(other, 'truncate');\n        }\n        return fn(this, rhs).cast(this.constructor);\n    }\n    /**\n     * Convert to a JavaScript number.\n     * @throws If the number cannot be represented by 53-bits.\n     **/\n    toNumber() {\n        return this.value.toNumber();\n    }\n    toString() {\n        return this.value.toString();\n    }\n    [Symbol.toPrimitive](type) {\n        if (type === 'number') {\n            return this.toNumber();\n        }\n        else {\n            return this.toString();\n        }\n    }\n    toABI(encoder) {\n        encoder.writeArray(this.byteArray);\n    }\n    toJSON() {\n        // match FCs behavior and return strings for anything above 32-bit\n        if (this.value.bitLength() > 32) {\n            return this.value.toString();\n        }\n        else {\n            return this.value.toNumber();\n        }\n    }\n}\nInt.abiName = '__int';\nclass Int8 extends Int {\n}\nInt8.abiName = 'int8';\nInt8.byteWidth = 1;\nInt8.isSigned = true;\nclass Int16 extends Int {\n}\nInt16.abiName = 'int16';\nInt16.byteWidth = 2;\nInt16.isSigned = true;\nclass Int32 extends Int {\n}\nInt32.abiName = 'int32';\nInt32.byteWidth = 4;\nInt32.isSigned = true;\nclass Int64 extends Int {\n}\nInt64.abiName = 'int64';\nInt64.byteWidth = 8;\nInt64.isSigned = true;\nclass Int128 extends Int {\n}\nInt128.abiName = 'int128';\nInt128.byteWidth = 16;\nInt128.isSigned = true;\nclass UInt8 extends Int {\n}\nUInt8.abiName = 'uint8';\nUInt8.byteWidth = 1;\nUInt8.isSigned = false;\nclass UInt16 extends Int {\n}\nUInt16.abiName = 'uint16';\nUInt16.byteWidth = 2;\nUInt16.isSigned = false;\nclass UInt32 extends Int {\n}\nUInt32.abiName = 'uint32';\nUInt32.byteWidth = 4;\nUInt32.isSigned = false;\nclass UInt64 extends Int {\n}\nUInt64.abiName = 'uint64';\nUInt64.byteWidth = 8;\nUInt64.isSigned = false;\nclass UInt128 extends Int {\n}\nUInt128.abiName = 'uint128';\nUInt128.byteWidth = 16;\nUInt128.isSigned = false;\nclass VarInt extends Int {\n    static fromABI(decoder) {\n        return new this(new BN(decoder.readVarint32()));\n    }\n    toABI(encoder) {\n        encoder.writeVarint32(Number(this));\n    }\n}\nVarInt.abiName = 'varint32';\nVarInt.byteWidth = 32;\nVarInt.isSigned = true;\nclass VarUInt extends Int {\n    static fromABI(decoder) {\n        return new this(new BN(decoder.readVaruint32()));\n    }\n    toABI(encoder) {\n        encoder.writeVaruint32(Number(this));\n    }\n}\nVarUInt.abiName = 'varuint32';\nVarUInt.byteWidth = 32;\nVarUInt.isSigned = false;\n/** Clamp number between min and max. */\nfunction clamp(num, min, max) {\n    return BN.min(BN.max(num, min), max);\n}\n/**\n * Create new BN with the same bit pattern as the passed value,\n * extending or truncating the value’s representation as necessary.\n */\nfunction truncate(value, from, to) {\n    const fill = value.isNeg() ? 255 : 0;\n    const fromValue = from.isSigned ? value.toTwos(from.byteWidth * 8) : value;\n    const fromBytes = fromValue.toArrayLike(Uint8Array, 'le');\n    const toBytes = new Uint8Array(to.byteWidth);\n    toBytes.fill(fill);\n    toBytes.set(fromBytes.slice(0, to.byteWidth));\n    const toValue = new BN(toBytes, undefined, 'le');\n    return to.isSigned ? toValue.fromTwos(to.byteWidth * 8) : toValue;\n}\n/** C++11 implicit integer conversions. */\nfunction convert(a, b) {\n    // The integral promotions (4.5) shall be performed on both operands.\n    a = promote(a);\n    b = promote(b);\n    const aType = a.constructor;\n    const bType = b.constructor;\n    // If both operands have the same type, no further conversion is needed\n    if (aType !== bType) {\n        // Otherwise, if both operands have signed integer types or both have unsigned integer types,\n        // the operand with the type of lesser integer conversion rank shall be converted to the type\n        // of the operand with greater rank.\n        if (aType.isSigned === bType.isSigned) {\n            if (aType.byteWidth > bType.byteWidth) {\n                b = b.cast(aType);\n            }\n            else if (bType.byteWidth > aType.byteWidth) {\n                a = a.cast(bType);\n            }\n        }\n        else {\n            // Otherwise, if the operand that has unsigned integer type has rank greater than or equal\n            // to the rank of the type of the other operand, the operand with signed integer type\n            // shall be converted to the type of the operand with unsigned integer type.\n            if (aType.isSigned === false && aType.byteWidth >= bType.byteWidth) {\n                b = b.cast(aType);\n            }\n            else if (bType.isSigned === false && bType.byteWidth >= aType.byteWidth) {\n                a = a.cast(bType);\n            }\n            else {\n                // Otherwise, if the type of the operand with signed integer type can represent all of the\n                // values of the type of the operand with unsigned integer type, the operand with unsigned\n                // integer type shall be converted to the type of the operand with signed integer type.\n                if (aType.isSigned === true &&\n                    aType.max.gte(bType.max) &&\n                    aType.min.lte(bType.min)) {\n                    b = b.cast(aType);\n                }\n                else if (bType.isSigned === true &&\n                    bType.max.gte(aType.max) &&\n                    bType.min.lte(aType.min)) {\n                    a = a.cast(bType);\n                }\n                else ;\n            }\n        }\n    }\n    return { a, b };\n}\n/** C++11 integral promotion. */\nfunction promote(n) {\n    // An rvalue of type char, signed char, unsigned char, short int, or\n    // unsigned short int can be converted to an rvalue of type int if int\n    // can represent all the values of the source type; otherwise, the source\n    // rvalue can be converted to an rvalue of type unsigned int.\n    let rv = n;\n    const type = n.constructor;\n    if (type.byteWidth < 4) {\n        rv = n.cast(Int32);\n    }\n    return rv;\n}\n\n/** Return a ABI definition for given ABISerializableType. */\nfunction synthesizeABI(type) {\n    const structs = [];\n    const variants = [];\n    const aliases = [];\n    const seen = new Set();\n    const resolveAbiType = (t) => {\n        let typeName;\n        if (typeof t.type !== 'string') {\n            typeName = resolve(t.type);\n        }\n        else {\n            typeName = t.type;\n        }\n        if (t.array === true) {\n            typeName += '[]';\n        }\n        if (t.extension === true) {\n            typeName += '$';\n        }\n        if (t.optional === true) {\n            typeName += '?';\n        }\n        return typeName;\n    };\n    const resolve = (t) => {\n        if (!t.abiName) {\n            throw new Error('Encountered non-conforming type');\n        }\n        else if (t.abiName === '__struct') {\n            throw new Error('Misconfigured Struct subclass, did you forget @Struct.type?');\n        }\n        if (seen.has(t)) {\n            return t.abiName;\n        }\n        seen.add(t);\n        if (t.abiAlias) {\n            aliases.push({\n                new_type_name: t.abiName,\n                type: resolveAbiType(t.abiAlias),\n            });\n        }\n        else if (t.abiFields) {\n            const fields = t.abiFields.map((field) => {\n                return {\n                    name: field.name,\n                    type: resolveAbiType(field),\n                };\n            });\n            const struct = {\n                base: t.abiBase ? resolve(t.abiBase) : '',\n                name: t.abiName,\n                fields,\n            };\n            structs.push(struct);\n        }\n        else if (t.abiVariant) {\n            const variant = {\n                name: t.abiName,\n                types: t.abiVariant.map(resolveAbiType),\n            };\n            variants.push(variant);\n        }\n        return t.abiName;\n    };\n    const root = resolve(type);\n    return { abi: ABI.from({ structs, variants, types: aliases }), types: Array.from(seen), root };\n}\nfunction abiTypeString(type) {\n    let typeName = typeof type.type === 'string' ? type.type : type.type.abiName;\n    if (type.array === true) {\n        typeName += '[]';\n    }\n    if (type.extension === true) {\n        typeName += '$';\n    }\n    if (type.optional === true) {\n        typeName += '?';\n    }\n    return typeName;\n}\nfunction isTypeDescriptor(type) {\n    return (typeof type !== 'string' &&\n        type.abiName === undefined &&\n        type.type !== undefined);\n}\nfunction toTypeDescriptor(type) {\n    if (typeof type === 'string') {\n        return { type };\n    }\n    if (typeof type.abiName !== 'undefined') {\n        return { type: type };\n    }\n    return type;\n}\n\nconst StringType = {\n    abiName: 'string',\n    fromABI: (decoder) => {\n        return decoder.readString();\n    },\n    from: (string) => string,\n    toABI: (string, encoder) => {\n        encoder.writeString(string);\n    },\n};\nconst BoolType = {\n    abiName: 'bool',\n    fromABI: (decoder) => {\n        return decoder.readByte() === 1;\n    },\n    from: (value) => value,\n    toABI: (value, encoder) => {\n        encoder.writeByte(value === true ? 1 : 0);\n    },\n};\nfunction getBuiltins() {\n    return [\n        // types represented by JavaScript builtins\n        BoolType,\n        StringType,\n        // types represented by Classes\n        Asset,\n        Asset.Symbol,\n        Asset.SymbolCode,\n        BlockTimestamp,\n        Bytes,\n        Checksum160,\n        Checksum256,\n        Checksum512,\n        ExtendedAsset,\n        Float128,\n        Float32,\n        Float64,\n        Int128,\n        Int16,\n        Int32,\n        Int64,\n        Int8,\n        Name,\n        PublicKey,\n        Signature,\n        TimePoint,\n        TimePointSec,\n        UInt128,\n        UInt16,\n        UInt32,\n        UInt64,\n        UInt8,\n        VarInt,\n        VarUInt,\n    ];\n}\nfunction buildTypeLookup(additional = []) {\n    const rv = {};\n    const builtins = getBuiltins();\n    for (const type of builtins) {\n        rv[type.abiName] = type;\n    }\n    for (const type of additional) {\n        if (!type.abiName) {\n            throw new Error('Invalid type');\n        }\n        rv[type.abiName] = type;\n    }\n    return rv;\n}\nfunction getTypeName(object) {\n    if (object.constructor && object.constructor.abiName !== undefined) {\n        return object.constructor.abiName;\n    }\n    if (Array.isArray(object)) {\n        const types = object.map(getTypeName);\n        const type = types[0];\n        if (!type || !types.every((t) => t === type)) {\n            return;\n        }\n        return type + '[]';\n    }\n    switch (typeof object) {\n        case 'boolean':\n            return 'bool';\n        case 'string':\n            return 'string';\n    }\n}\nfunction getType(object, name = 'jsobj') {\n    var _a;\n    if (object.constructor && object.constructor.abiName !== undefined) {\n        return object.constructor;\n    }\n    if (Array.isArray(object)) {\n        // check for array of all ABISerializableType with same type name\n        const types = object.map((v) => {\n            return getType(v, name);\n        });\n        const type = types[0];\n        if (!type) {\n            return; // some type not known\n        }\n        if (!types.every((t) => t && t.abiName === type.abiName)) {\n            return; // not all types are the same\n        }\n        return type;\n    }\n    const objectType = typeof object;\n    if (objectType === 'object' && object !== null) {\n        const fields = Object.keys(object).map((key) => {\n            return { name: key, type: getType(object[key], name + '_nested') };\n        });\n        if (fields.find((field) => !field.type)) {\n            return; // encountered unknown type\n        }\n        return _a = class extends Struct {\n            },\n            _a.abiName = name,\n            _a.abiFields = fields,\n            _a;\n    }\n    switch (objectType) {\n        case 'boolean':\n            return BoolType;\n        case 'string':\n            return StringType;\n    }\n}\n\n/**\n * EOSIO ABI Decoder\n */\nclass DecodingError extends Error {\n    constructor(ctx, underlyingError) {\n        const path = ctx.codingPath\n            .map(({ field, type }) => {\n            if (typeof field === 'number') {\n                return field;\n            }\n            else {\n                return `${field}<${type.typeName}>`;\n            }\n        })\n            .join('.');\n        super(`Decoding error at ${path}: ${underlyingError.message}`);\n        this.stack = underlyingError.stack;\n        this.ctx = ctx;\n        this.underlyingError = underlyingError;\n    }\n}\nDecodingError.__className = 'DecodingError';\nfunction abiDecode(args) {\n    const descriptor = toTypeDescriptor(args.type);\n    const typeName = abiTypeString(descriptor);\n    const customTypes = args.customTypes || [];\n    let abi;\n    if (args.abi) {\n        abi = ABI.from(args.abi);\n    }\n    else {\n        try {\n            let type;\n            if (typeof descriptor.type === 'string') {\n                const lookup = buildTypeLookup(customTypes);\n                const rName = new ABI.ResolvedType(descriptor.type).name; // type name w/o suffixes\n                type = lookup[rName];\n                if (!type) {\n                    throw new Error(`Unknown type: ${descriptor.type}`);\n                }\n            }\n            else {\n                type = descriptor.type;\n            }\n            const synthesized = synthesizeABI(type);\n            abi = synthesized.abi;\n            customTypes.push(...synthesized.types);\n        }\n        catch (error) {\n            throw Error(`Unable to synthesize ABI for: ${typeName} (${error.message}). ` +\n                'To decode non-class types you need to pass the ABI definition manually.');\n        }\n    }\n    const resolved = abi.resolveType(typeName);\n    if (typeof descriptor.type !== 'string') {\n        customTypes.unshift(descriptor.type);\n    }\n    const ctx = {\n        types: buildTypeLookup(customTypes),\n        codingPath: [{ field: 'root', type: resolved }],\n    };\n    try {\n        if (args.data) {\n            let decoder;\n            if (isInstanceOf(args.data, ABIDecoder)) {\n                decoder = args.data;\n            }\n            else {\n                const bytes = Bytes.from(args.data);\n                decoder = new ABIDecoder(bytes.array);\n            }\n            if (args.metadata) {\n                decoder.metadata = args.metadata;\n            }\n            return decodeBinary(resolved, decoder, ctx);\n        }\n        else if (args.object !== undefined) {\n            return decodeObject(args.object, resolved, ctx);\n        }\n        else if (args.json) {\n            return decodeObject(JSON.parse(args.json), resolved, ctx);\n        }\n        else {\n            throw new Error('Nothing to decode, you must set one of data, json, object');\n        }\n    }\n    catch (error) {\n        throw new DecodingError(ctx, error);\n    }\n}\n/** Marker for objects when they have been resolved, i.e. their types `from` factory method will not need to resolve children. */\nconst Resolved = Symbol('Resolved');\nfunction decodeBinary(type, decoder, ctx) {\n    if (ctx.codingPath.length > 32) {\n        throw new Error('Maximum decoding depth exceeded');\n    }\n    if (type.isExtension) {\n        if (!decoder.canRead()) {\n            return undefined;\n        }\n    }\n    if (type.isOptional) {\n        if (decoder.readByte() === 0) {\n            return null;\n        }\n    }\n    if (type.isArray) {\n        const len = decoder.readVaruint32();\n        const rv = [];\n        for (let i = 0; i < len; i++) {\n            ctx.codingPath.push({ field: i, type });\n            rv.push(decodeInner());\n            ctx.codingPath.pop();\n        }\n        return rv;\n    }\n    else {\n        return decodeInner();\n    }\n    function decodeInner() {\n        const abiType = ctx.types[type.name];\n        if (abiType && abiType.fromABI) {\n            return abiType.fromABI(decoder);\n        }\n        else {\n            if (type.ref) {\n                // follow type alias\n                ctx.codingPath.push({ field: '', type: type.ref });\n                const rv = decodeBinary(type.ref, decoder, ctx);\n                ctx.codingPath.pop();\n                return rv;\n            }\n            else if (type.fields) {\n                const fields = type.allFields;\n                if (!fields) {\n                    throw new Error('Invalid struct fields');\n                }\n                const rv = {};\n                for (const field of fields) {\n                    ctx.codingPath.push({ field: field.name, type: field.type });\n                    rv[field.name] = decodeBinary(field.type, decoder, ctx);\n                    ctx.codingPath.pop();\n                }\n                if (abiType) {\n                    rv[Resolved] = true;\n                    return abiType.from(rv);\n                }\n                else {\n                    return rv;\n                }\n            }\n            else if (type.variant) {\n                const vIdx = decoder.readByte();\n                const vType = type.variant[vIdx];\n                if (!vType) {\n                    throw new Error(`Unknown variant idx: ${vIdx}`);\n                }\n                ctx.codingPath.push({ field: `v${vIdx}`, type: vType });\n                const rv = [vType.typeName, decodeBinary(vType, decoder, ctx)];\n                ctx.codingPath.pop();\n                if (abiType) {\n                    return abiType.from(rv);\n                }\n                else {\n                    return rv;\n                }\n            }\n            else if (abiType) {\n                throw new Error('Invalid type');\n            }\n            else {\n                throw new Error(type.name === 'any' ? \"Unable to decode 'any' type from binary\" : 'Unknown type');\n            }\n        }\n    }\n}\nfunction decodeObject(value, type, ctx) {\n    if (value === null || value === undefined) {\n        if (type.isOptional || type.isExtension) {\n            return null;\n        }\n        else {\n            throw new Error(`Unexpectedly encountered ${value} for non-optional`);\n        }\n    }\n    else if (type.isArray) {\n        if (!Array.isArray(value)) {\n            throw new Error('Expected array');\n        }\n        const rv = [];\n        const len = value.length;\n        for (let i = 0; i < len; i++) {\n            ctx.codingPath.push({ field: i, type });\n            rv.push(decodeInner(value[i]));\n            ctx.codingPath.pop();\n        }\n        return rv;\n    }\n    else {\n        return decodeInner(value);\n    }\n    function decodeInner(value) {\n        const abiType = ctx.types[type.name];\n        if (type.ref && !abiType) {\n            // follow type alias\n            return decodeObject(value, type.ref, ctx);\n        }\n        else if (type.fields) {\n            if (typeof value !== 'object') {\n                throw new Error('Expected object');\n            }\n            if (typeof abiType === 'function' && isInstanceOf(value, abiType)) {\n                return value;\n            }\n            const fields = type.allFields;\n            if (!fields) {\n                throw new Error('Invalid struct fields');\n            }\n            const struct = {};\n            for (const field of fields) {\n                ctx.codingPath.push({ field: field.name, type: field.type });\n                struct[field.name] = decodeObject(value[field.name], field.type, ctx);\n                ctx.codingPath.pop();\n            }\n            if (abiType) {\n                struct[Resolved] = true;\n                return abiType.from(struct);\n            }\n            else {\n                return struct;\n            }\n        }\n        else if (type.variant) {\n            let vName;\n            if (Array.isArray(value) && value.length === 2 && typeof value[0] === 'string') {\n                vName = value[0];\n                value = value[1];\n            }\n            else if (isInstanceOf(value, Variant)) {\n                vName = value.variantName;\n                value = value.value;\n            }\n            else {\n                vName = getTypeName(value);\n            }\n            const vIdx = type.variant.findIndex((t) => t.typeName === vName);\n            if (vIdx === -1) {\n                throw new Error(`Unknown variant type: ${vName}`);\n            }\n            const vType = type.variant[vIdx];\n            ctx.codingPath.push({ field: `v${vIdx}`, type: vType });\n            const rv = [vType.typeName, decodeObject(value, vType, ctx)];\n            ctx.codingPath.pop();\n            if (abiType) {\n                rv[Resolved] = true;\n                return abiType.from(rv);\n            }\n            else {\n                return rv;\n            }\n        }\n        else {\n            if (!abiType) {\n                // special case for `any` when decoding from object\n                if (type.name === 'any') {\n                    return value;\n                }\n                throw new Error('Unknown type');\n            }\n            return abiType.from(value);\n        }\n    }\n}\nclass ABIDecoder {\n    constructor(array) {\n        this.array = array;\n        this.pos = 0;\n        this.textDecoder = new TextDecoder('utf-8', { fatal: true });\n        /** User declared metadata, can be used to pass info to instances when decoding.  */\n        this.metadata = {};\n        this.data = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    }\n    canRead(bytes = 1) {\n        return !(this.pos + bytes > this.array.byteLength);\n    }\n    ensure(bytes) {\n        if (!this.canRead(bytes)) {\n            throw new Error('Read past end of buffer');\n        }\n    }\n    /** Read one byte. */\n    readByte() {\n        this.ensure(1);\n        return this.array[this.pos++];\n    }\n    /** Read floating point as JavaScript number, 32 or 64 bits. */\n    readFloat(byteWidth) {\n        this.ensure(byteWidth);\n        let rv;\n        switch (byteWidth) {\n            case 4:\n                rv = this.data.getFloat32(this.pos, true);\n                break;\n            case 8:\n                rv = this.data.getFloat64(this.pos, true);\n                break;\n            default:\n                throw new Error('Invalid float size');\n        }\n        this.pos += byteWidth;\n        return rv;\n    }\n    readVaruint32() {\n        let v = 0;\n        let bit = 0;\n        for (;;) {\n            const b = this.readByte();\n            v |= (b & 0x7f) << bit;\n            bit += 7;\n            if (!(b & 0x80)) {\n                break;\n            }\n        }\n        return v >>> 0;\n    }\n    readVarint32() {\n        const v = this.readVaruint32();\n        if (v & 1) {\n            return (~v >> 1) | 2147483648;\n        }\n        else {\n            return v >>> 1;\n        }\n    }\n    readArray(length) {\n        this.ensure(length);\n        const rv = this.array.subarray(this.pos, this.pos + length);\n        this.pos += length;\n        return rv;\n    }\n    readString() {\n        const length = this.readVaruint32();\n        return this.textDecoder.decode(this.readArray(length));\n    }\n}\nABIDecoder.__className = 'ABIDecoder';\n\n/**\n * EOSIO ABI Encoder\n */\nclass EncodingError extends Error {\n    constructor(ctx, underlyingError) {\n        const path = ctx.codingPath\n            .map(({ field, type }) => {\n            if (typeof field === 'number') {\n                return field;\n            }\n            else {\n                return `${field}<${type.typeName}>`;\n            }\n        })\n            .join('.');\n        super(`Encoding error at ${path}: ${underlyingError.message}`);\n        this.stack = underlyingError.stack;\n        this.ctx = ctx;\n        this.underlyingError = underlyingError;\n    }\n}\nEncodingError.__className = 'EncodingError';\nfunction abiEncode(args) {\n    let type;\n    let typeName;\n    if (typeof args.type === 'string') {\n        typeName = args.type;\n    }\n    else if (args.type && isTypeDescriptor(args.type)) {\n        if (typeof args.type.type !== 'string') {\n            type = args.type.type;\n        }\n        typeName = abiTypeString(args.type);\n    }\n    else if (args.type && args.type.abiName !== undefined) {\n        type = args.type;\n        typeName = args.type.abiName;\n    }\n    else {\n        type = getType(args.object);\n        if (type) {\n            typeName = type.abiName;\n            if (Array.isArray(args.object)) {\n                typeName += '[]';\n            }\n        }\n    }\n    const customTypes = args.customTypes ? args.customTypes.slice() : [];\n    if (type) {\n        customTypes.unshift(type);\n    }\n    else if (typeName) {\n        const rootName = new ABI.ResolvedType(typeName).name;\n        type = customTypes.find((t) => t.abiName === rootName);\n    }\n    let rootType;\n    if (args.abi && typeName) {\n        rootType = ABI.from(args.abi).resolveType(typeName);\n    }\n    else if (type) {\n        const synthesized = synthesizeABI(type);\n        rootType = synthesized.abi.resolveType(typeName || type.abiName);\n        customTypes.push(...synthesized.types);\n    }\n    else if (typeName) {\n        rootType = new ABI.ResolvedType(typeName);\n    }\n    else {\n        throw new Error('Unable to determine the type of the object to be encoded. ' +\n            'To encode custom ABI types you must pass the type argument.');\n    }\n    const types = buildTypeLookup(customTypes);\n    const encoder = args.encoder || new ABIEncoder();\n    if (args.metadata) {\n        encoder.metadata = args.metadata;\n    }\n    const ctx = {\n        types,\n        encoder,\n        codingPath: [{ field: 'root', type: rootType }],\n    };\n    try {\n        encodeAny(args.object, rootType, ctx);\n    }\n    catch (error) {\n        throw new EncodingError(ctx, error);\n    }\n    return Bytes.from(encoder.getData());\n}\nfunction encodeAny(value, type, ctx) {\n    const valueExists = value !== undefined && value !== null;\n    if (type.isOptional) {\n        ctx.encoder.writeByte(valueExists ? 1 : 0);\n        if (!valueExists) {\n            return;\n        }\n    }\n    if (type.isArray) {\n        if (!Array.isArray(value)) {\n            throw new Error(`Expected array for: ${type.typeName}`);\n        }\n        const len = value.length;\n        ctx.encoder.writeVaruint32(len);\n        for (let i = 0; i < len; i++) {\n            ctx.codingPath.push({ field: i, type });\n            encodeInner(value[i]);\n            ctx.codingPath.pop();\n        }\n    }\n    else {\n        encodeInner(value);\n    }\n    function encodeInner(value) {\n        const abiType = ctx.types[type.name];\n        if (type.ref && !abiType) {\n            // type is alias, follow it\n            encodeAny(value, type.ref, ctx);\n            return;\n        }\n        if (!valueExists) {\n            if (type.isExtension) {\n                return;\n            }\n            throw new Error(`Found ${value} for non-optional type: ${type.typeName}`);\n        }\n        if (abiType && abiType.toABI) {\n            // type explicitly handles encoding\n            abiType.toABI(value, ctx.encoder);\n        }\n        else if (typeof value.toABI === 'function' && value.constructor.abiName === type.name) {\n            // instance handles encoding\n            value.toABI(ctx.encoder);\n        }\n        else {\n            // encode according to abi def if possible\n            if (type.fields) {\n                if (typeof value !== 'object') {\n                    throw new Error(`Expected object for: ${type.name}`);\n                }\n                const fields = type.allFields;\n                if (!fields) {\n                    throw new Error('Invalid struct fields');\n                }\n                for (const field of fields) {\n                    ctx.codingPath.push({ field: field.name, type: field.type });\n                    encodeAny(value[field.name], field.type, ctx);\n                    ctx.codingPath.pop();\n                }\n            }\n            else if (type.variant) {\n                let vName;\n                if (Array.isArray(value) && value.length === 2 && typeof value[0] === 'string') {\n                    vName = value[0];\n                    value = value[1];\n                }\n                else if (isInstanceOf(value, Variant)) {\n                    vName = value.variantName;\n                    value = value.value;\n                }\n                else {\n                    vName = getTypeName(value);\n                }\n                const vIdx = type.variant.findIndex((t) => t.typeName === vName);\n                if (vIdx === -1) {\n                    const types = type.variant.map((t) => `'${t.typeName}'`).join(', ');\n                    throw new Error(`Unknown variant type '${vName}', expected one of ${types}`);\n                }\n                const vType = type.variant[vIdx];\n                ctx.encoder.writeVaruint32(vIdx);\n                ctx.codingPath.push({ field: `v${vIdx}`, type: vType });\n                encodeAny(value, vType, ctx);\n                ctx.codingPath.pop();\n            }\n            else {\n                if (!abiType) {\n                    throw new Error(type.name === 'any' ? 'Unable to encode any type to binary' : 'Unknown type');\n                }\n                const instance = abiType.from(value);\n                if (!instance.toABI) {\n                    throw new Error(`Invalid type ${type.name}, no encoding methods implemented`);\n                }\n                instance.toABI(ctx.encoder);\n            }\n        }\n    }\n}\nclass ABIEncoder {\n    constructor(pageSize = 1024) {\n        this.pageSize = pageSize;\n        this.pos = 0;\n        this.textEncoder = new TextEncoder();\n        /** User declared metadata, can be used to pass info to instances when encoding.  */\n        this.metadata = {};\n        const buffer = new ArrayBuffer(pageSize);\n        this.data = new DataView(buffer);\n        this.array = new Uint8Array(buffer);\n    }\n    ensure(bytes) {\n        if (this.data.byteLength >= this.pos + bytes) {\n            return;\n        }\n        const pages = Math.ceil(bytes / this.pageSize);\n        const newSize = this.data.byteLength + this.pageSize * pages;\n        const buffer = new ArrayBuffer(newSize);\n        const data = new DataView(buffer);\n        const array = new Uint8Array(buffer);\n        array.set(this.array);\n        this.data = data;\n        this.array = array;\n    }\n    /** Write a single byte. */\n    writeByte(byte) {\n        this.ensure(1);\n        this.array[this.pos++] = byte;\n    }\n    /** Write an array of bytes. */\n    writeArray(bytes) {\n        const size = bytes.length;\n        this.ensure(size);\n        this.array.set(bytes, this.pos);\n        this.pos += size;\n    }\n    writeFloat(value, byteWidth) {\n        this.ensure(byteWidth);\n        switch (byteWidth) {\n            case 4:\n                this.data.setFloat32(this.pos, value, true);\n                break;\n            case 8:\n                this.data.setFloat64(this.pos, value, true);\n                break;\n            default:\n                throw new Error('Invalid float size');\n        }\n        this.pos += byteWidth;\n    }\n    writeVaruint32(v) {\n        this.ensure(4);\n        for (;;) {\n            if (v >>> 7) {\n                this.array[this.pos++] = 0x80 | (v & 0x7f);\n                v = v >>> 7;\n            }\n            else {\n                this.array[this.pos++] = v;\n                break;\n            }\n        }\n    }\n    writeVarint32(v) {\n        this.writeVaruint32((v << 1) ^ (v >> 31));\n    }\n    writeString(v) {\n        const data = this.textEncoder.encode(v);\n        this.writeVaruint32(data.byteLength);\n        this.writeArray(data);\n    }\n    getData() {\n        return new Uint8Array(this.array.buffer, this.array.byteOffset, this.pos);\n    }\n}\nABIEncoder.__className = 'ABIEncoder';\n\nclass Struct {\n    /** @internal */\n    constructor(object) {\n        const self = this.constructor;\n        for (const field of self.structFields) {\n            this[field.name] = object[field.name];\n        }\n    }\n    static from(value) {\n        if (value[Resolved] === true) {\n            // objects already resolved\n            return new this(value);\n        }\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        const object = {};\n        for (const field of this.structFields) {\n            const v = value[field.name] === undefined ? field.default : value[field.name];\n            if (v === undefined && !(field.optional === true || field.name.includes('?'))) {\n                throw new Error(`Missing value for non optional field: ${field.name}`);\n            }\n            object[field.name] = v;\n        }\n        return abiDecode({ object, type: this });\n    }\n    static get structFields() {\n        const rv = [];\n        const walk = (t) => {\n            if (t.abiBase) {\n                walk(t.abiBase);\n            }\n            for (const field of t.abiFields || []) {\n                rv.push(field);\n            }\n        };\n        walk(this);\n        return rv;\n    }\n    /**\n     * Return true if this struct equals the other.\n     *\n     * Note: This compares the ABI encoded bytes of both structs, subclasses\n     *       should implement their own fast equality check when possible.\n     */\n    equals(other) {\n        const self = this.constructor;\n        if (other.constructor &&\n            typeof other.constructor.abiName === 'string' &&\n            other.constructor.abiName !== self.abiName) {\n            return false;\n        }\n        return abiEncode({ object: this }).equals(abiEncode({ object: self.from(other) }));\n    }\n    /** @internal */\n    toJSON() {\n        const self = this.constructor;\n        const rv = {};\n        for (const field of self.structFields) {\n            rv[field.name] = this[field.name];\n        }\n        return rv;\n    }\n}\nStruct.abiName = '__struct';\n(function (Struct) {\n    const FieldsOwner = Symbol('FieldsOwner');\n    function type(name) {\n        return function (struct) {\n            struct.abiName = name;\n            return struct;\n        };\n    }\n    Struct.type = type;\n    function field(type, options) {\n        if (!options)\n            options = {};\n        return (target, name) => {\n            const ctor = target.constructor;\n            if (!ctor.abiFields) {\n                ctor.abiFields = [];\n                ctor.abiFields[FieldsOwner] = ctor;\n            }\n            else if (ctor.abiFields[FieldsOwner] !== ctor) {\n                // if the target class isn't the owner we set the base and start new fields\n                ctor.abiBase = ctor.abiFields[FieldsOwner];\n                ctor.abiFields = [];\n                ctor.abiFields[FieldsOwner] = ctor;\n            }\n            ctor.abiFields.push({ ...options, name, type });\n        };\n    }\n    Struct.field = field;\n})(Struct || (Struct = {}));\n\nfunction TypeAlias(name) {\n    return function (typeAlias) {\n        typeAlias.abiAlias = { type: Object.getPrototypeOf(typeAlias.prototype).constructor };\n        typeAlias.abiName = name;\n        return typeAlias;\n    };\n}\n\nclass Variant {\n    /** @internal */\n    constructor(variant) {\n        const abiVariant = this.constructor.abiVariant;\n        this.value = variant[1];\n        const variantIdx = abiVariant.map(abiTypeString).findIndex((t) => t === variant[0]);\n        if (0 > variantIdx || abiVariant.length <= variantIdx) {\n            throw new Error(`Unknown variant ${variant[0]}`);\n        }\n        this.variantIdx = variantIdx;\n    }\n    static from(object) {\n        if (object[Resolved]) {\n            return new this(object);\n        }\n        if (isInstanceOf(object, this)) {\n            return object;\n        }\n        return abiDecode({ object, type: this });\n    }\n    /**\n     * Return true if this variant equals the other.\n     *\n     * Note: This compares the ABI encoded bytes of both variants, subclasses\n     *       should implement their own fast equality check when possible.\n     */\n    equals(other) {\n        const self = this.constructor;\n        const otherVariant = self.from(other);\n        if (this.variantIdx !== otherVariant.variantIdx) {\n            return false;\n        }\n        return abiEncode({ object: this }).equals(abiEncode({ object: otherVariant }));\n    }\n    get variantName() {\n        const variant = this.constructor.abiVariant[this.variantIdx];\n        return abiTypeString(variant);\n    }\n    /** @internal */\n    toJSON() {\n        return [this.variantName, this.value];\n    }\n}\nVariant.abiName = '__variant';\nVariant.abiVariant = [];\n(function (Variant) {\n    function type(name, types) {\n        return function (variant) {\n            variant.abiName = name;\n            variant.abiVariant = types.map(toTypeDescriptor);\n            return variant;\n        };\n    }\n    Variant.type = type;\n})(Variant || (Variant = {}));\n\nclass Float {\n    constructor(value) {\n        if (!Number.isFinite(value)) {\n            throw new Error('Invalid number');\n        }\n        this.value = value;\n    }\n    static from(value) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        if (typeof value === 'string') {\n            value = Number.parseFloat(value);\n        }\n        else if (isInstanceOf(value, Float)) {\n            value = value.value;\n        }\n        return new this(value);\n    }\n    static fromABI(decoder) {\n        return new this(decoder.readFloat(this.byteWidth));\n    }\n    static random() {\n        const bytes = secureRandom(this.byteWidth);\n        const decoder = new ABIDecoder(bytes);\n        return this.fromABI(decoder);\n    }\n    equals(other) {\n        const self = this.constructor;\n        return this.value === self.from(other).value;\n    }\n    toABI(encoder) {\n        const self = this.constructor;\n        encoder.writeFloat(this.value, self.byteWidth);\n    }\n    toString() {\n        return this.value.toString();\n    }\n    toJSON() {\n        return this.toString();\n    }\n}\nFloat.abiName = '__float';\nclass Float32 extends Float {\n    toString() {\n        return this.value.toFixed(7);\n    }\n}\nFloat32.abiName = 'float32';\nFloat32.byteWidth = 4;\nclass Float64 extends Float {\n}\nFloat64.abiName = 'float64';\nFloat64.byteWidth = 8;\nclass Float128 {\n    constructor(data) {\n        if (data.array.length !== 16) {\n            throw new Error('Invalid float128');\n        }\n        this.data = data;\n    }\n    static from(value) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        if (typeof value === 'string' && value.startsWith('0x')) {\n            value = value.slice(2);\n        }\n        return new this(Bytes.from(value));\n    }\n    static fromABI(decoder) {\n        return new this(new Bytes(decoder.readArray(this.byteWidth)));\n    }\n    static random() {\n        const bytes = secureRandom(16);\n        const decoder = new ABIDecoder(bytes);\n        return this.fromABI(decoder);\n    }\n    equals(other) {\n        const self = this.constructor;\n        return this.data.equals(self.from(other).data);\n    }\n    toABI(encoder) {\n        encoder.writeArray(this.data.array);\n    }\n    toString() {\n        // float128 uses 0x prefixed hex strings as opposed to everywhere else in where there is no prefix ¯\\_(ツ)_/¯\n        return '0x' + this.data.hexString;\n    }\n    toJSON() {\n        return this.toString();\n    }\n}\nFloat128.abiName = 'float128';\nFloat128.byteWidth = 16;\n\n/** EOSIO Name */\nclass Name {\n    constructor(value) {\n        this.value = value;\n    }\n    /**\n     * The raw representation of the name.\n     * @deprecated Use value instead.\n     */\n    get rawValue() {\n        return this.value;\n    }\n    /** Create a new Name instance from any of its representing types. */\n    static from(value) {\n        if (isInstanceOf(value, Name)) {\n            return value;\n        }\n        else if (typeof value === 'string') {\n            return new Name(stringToName(value));\n        }\n        else if (isInstanceOf(value, UInt64)) {\n            return new Name(value);\n        }\n        else {\n            throw new Error('Invalid name');\n        }\n    }\n    static fromABI(decoder) {\n        return new Name(UInt64.fromABI(decoder));\n    }\n    /** Return true if this name is equal to passed name. */\n    equals(other) {\n        return this.value.equals(Name.from(other).value);\n    }\n    /** Return string representation of this name. */\n    toString() {\n        return nameToString(this.value);\n    }\n    toABI(encoder) {\n        this.value.toABI(encoder);\n    }\n    /** @internal */\n    toJSON() {\n        return this.toString();\n    }\n}\nName.abiName = 'name';\n/** Regex pattern matching a EOSIO name, case-sensitive. */\nName.pattern = /^[a-z1-5.]{0,13}$/;\nfunction stringToName(s) {\n    function charToSymbol(c) {\n        if (c >= 'a'.charCodeAt(0) && c <= 'z'.charCodeAt(0)) {\n            return c - 'a'.charCodeAt(0) + 6;\n        }\n        if (c >= '1'.charCodeAt(0) && c <= '5'.charCodeAt(0)) {\n            return c - '1'.charCodeAt(0) + 1;\n        }\n        return 0;\n    }\n    const a = new Uint8Array(8);\n    let bit = 63;\n    for (let i = 0; i < s.length; ++i) {\n        let c = charToSymbol(s.charCodeAt(i));\n        if (bit < 5) {\n            c = c << 1;\n        }\n        for (let j = 4; j >= 0; --j) {\n            if (bit >= 0) {\n                a[Math.floor(bit / 8)] |= ((c >> j) & 1) << bit % 8;\n                --bit;\n            }\n        }\n    }\n    return UInt64.from(a);\n}\nfunction nameToString(n) {\n    const a = n.value.toArray('le', 8);\n    let result = '';\n    for (let bit = 63; bit >= 0;) {\n        let c = 0;\n        for (let i = 0; i < 5; ++i) {\n            if (bit >= 0) {\n                c = (c << 1) | ((a[Math.floor(bit / 8)] >> bit % 8) & 1);\n                --bit;\n            }\n        }\n        if (c >= 6) {\n            result += String.fromCharCode(c + 'a'.charCodeAt(0) - 6);\n        }\n        else if (c >= 1) {\n            result += String.fromCharCode(c + '1'.charCodeAt(0) - 1);\n        }\n        else {\n            result += '.';\n        }\n    }\n    while (result.endsWith('.')) {\n        result = result.substr(0, result.length - 1);\n    }\n    return result;\n}\n\nclass TimePointBase {\n    static from(value) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        if (isInstanceOf(value, TimePointBase)) {\n            // converting between types\n            return this.fromMilliseconds(value.toMilliseconds());\n        }\n        if (isInstanceOf(value, Date)) {\n            return this.fromDate(value);\n        }\n        if (typeof value === 'string') {\n            return this.fromString(value);\n        }\n        return this.fromInteger(value);\n    }\n    static fromString(string) {\n        const value = Date.parse(string + 'Z');\n        if (!Number.isFinite(value)) {\n            throw new Error('Invalid date string');\n        }\n        return this.fromMilliseconds(value);\n    }\n    static fromDate(date) {\n        return this.fromMilliseconds(date.getTime());\n    }\n    toABI(encoder) {\n        const self = this;\n        self.value.toABI(encoder);\n    }\n    equals(other) {\n        const self = this.constructor;\n        return this.toMilliseconds() === self.from(other).toMilliseconds();\n    }\n    toMilliseconds() {\n        throw new Error('Not implemented');\n    }\n    toDate() {\n        return new Date(this.toMilliseconds());\n    }\n    toJSON() {\n        return this.toString();\n    }\n}\nTimePointBase.abiName = '__time_point_base';\n/** Timestamp with microsecond accuracy. */\nclass TimePoint extends TimePointBase {\n    constructor(value) {\n        super();\n        this.value = value;\n    }\n    static fromMilliseconds(ms) {\n        return new TimePoint(Int64.from(Math.round(ms * 1000)));\n    }\n    static fromInteger(value) {\n        return new TimePoint(Int64.from(value));\n    }\n    static fromABI(decoder) {\n        return new this(Int64.fromABI(decoder));\n    }\n    toString() {\n        return this.toDate().toISOString().slice(0, -1);\n    }\n    toMilliseconds() {\n        return Number(this.value.dividing(1000, 'round'));\n    }\n}\nTimePoint.abiName = 'time_point';\n/** Timestamp with second accuracy. */\nclass TimePointSec extends TimePointBase {\n    constructor(value) {\n        super();\n        this.value = value;\n    }\n    static fromMilliseconds(ms) {\n        return new TimePointSec(UInt32.from(Math.round(ms / 1000)));\n    }\n    static fromInteger(value) {\n        return new TimePointSec(UInt32.from(value));\n    }\n    static fromABI(decoder) {\n        return new this(UInt32.fromABI(decoder));\n    }\n    toString() {\n        return this.toDate().toISOString().slice(0, -5);\n    }\n    toMilliseconds() {\n        return Number(this.value.cast(UInt64).multiplying(1000));\n    }\n}\nTimePointSec.abiName = 'time_point_sec';\nclass BlockTimestamp extends TimePointBase {\n    constructor(value) {\n        super();\n        this.value = value;\n    }\n    static fromMilliseconds(ms) {\n        return new TimePointSec(UInt32.from(Math.round((ms - 946684800000) / 500)));\n    }\n    static fromInteger(value) {\n        return new TimePointSec(UInt32.from(value));\n    }\n    static fromABI(decoder) {\n        return new this(UInt32.fromABI(decoder));\n    }\n    toString() {\n        return this.toDate().toISOString().slice(0, -1);\n    }\n    toMilliseconds() {\n        return Number(this.value.cast(UInt64).multiplying(500).adding(946684800000));\n    }\n}\nBlockTimestamp.abiName = 'block_timestamp_type';\n\nclass ABI {\n    constructor(args) {\n        this.version = args.version || ABI.version;\n        this.types = args.types || [];\n        this.variants = args.variants || [];\n        this.structs = args.structs || [];\n        this.actions = args.actions || [];\n        this.tables = args.tables || [];\n        this.ricardian_clauses = args.ricardian_clauses || [];\n    }\n    static from(value) {\n        if (isInstanceOf(value, ABI)) {\n            return value;\n        }\n        if (typeof value === 'string') {\n            return new ABI(JSON.parse(value));\n        }\n        return new ABI(value);\n    }\n    resolveType(name) {\n        const types = {};\n        return this.resolve({ name, types }, { id: 0 });\n    }\n    resolveAll() {\n        const types = {};\n        const ctx = { id: 0 };\n        return {\n            types: this.types.map((t) => this.resolve({ name: t.new_type_name, types }, ctx)),\n            variants: this.variants.map((t) => this.resolve({ name: t.name, types }, ctx)),\n            structs: this.structs.map((t) => this.resolve({ name: t.name, types }, ctx)),\n        };\n    }\n    resolve({ name, types }, ctx) {\n        const existing = types[name];\n        if (existing) {\n            return existing;\n        }\n        const type = new ABI.ResolvedType(name, ++ctx.id);\n        types[type.typeName] = type;\n        const alias = this.types.find((typeDef) => typeDef.new_type_name == type.name);\n        if (alias) {\n            type.ref = this.resolve({ name: alias.type, types }, ctx);\n            return type;\n        }\n        const struct = this.getStruct(type.name);\n        if (struct) {\n            if (struct.base) {\n                type.base = this.resolve({ name: struct.base, types }, ctx);\n            }\n            type.fields = struct.fields.map((field) => {\n                return {\n                    name: field.name,\n                    type: this.resolve({ name: field.type, types }, ctx),\n                };\n            });\n            return type;\n        }\n        const variant = this.getVariant(type.name);\n        if (variant) {\n            type.variant = variant.types.map((name) => this.resolve({ name, types }, ctx));\n            return type;\n        }\n        // builtin or unknown type\n        return type;\n    }\n    getStruct(name) {\n        return this.structs.find((struct) => struct.name == name);\n    }\n    getVariant(name) {\n        return this.variants.find((variant) => variant.name == name);\n    }\n    /** Return arguments type of an action in this ABI. */\n    getActionType(actionName) {\n        const name = Name.from(actionName).toString();\n        const action = this.actions.find((a) => a.name.toString() === name);\n        if (action) {\n            return action.type;\n        }\n    }\n}\nABI.__className = 'ABI';\nABI.version = 'eosio::abi/1.1';\n(function (ABI) {\n    class ResolvedType {\n        constructor(fullName, id = 0) {\n            let name = fullName;\n            if (name.endsWith('$')) {\n                name = name.slice(0, -1);\n                this.isExtension = true;\n            }\n            else {\n                this.isExtension = false;\n            }\n            if (name.endsWith('?')) {\n                name = name.slice(0, -1);\n                this.isOptional = true;\n            }\n            else {\n                this.isOptional = false;\n            }\n            if (name.endsWith('[]')) {\n                name = name.slice(0, -2);\n                this.isArray = true;\n            }\n            else {\n                this.isArray = false;\n            }\n            this.id = id;\n            this.name = name;\n        }\n        /**\n         * Type name including suffixes: [] array, ? optional, $ binary ext\n         */\n        get typeName() {\n            let rv = this.name;\n            if (this.isArray) {\n                rv += '[]';\n            }\n            if (this.isOptional) {\n                rv += '?';\n            }\n            if (this.isExtension) {\n                rv += '$';\n            }\n            return rv;\n        }\n        /** All fields including base struct(s), undefined if not a struct type. */\n        get allFields() {\n            // eslint-disable-next-line @typescript-eslint/no-this-alias\n            let current = this;\n            const rv = [];\n            const seen = new Set();\n            do {\n                if (!current.fields) {\n                    return; // invalid struct\n                }\n                if (seen.has(current.name)) {\n                    return; // circular ref\n                }\n                for (let i = current.fields.length - 1; i >= 0; i--) {\n                    rv.unshift(current.fields[i]);\n                }\n                seen.add(current.name);\n                current = current.base;\n            } while (current !== undefined);\n            return rv;\n        }\n    }\n    ABI.ResolvedType = ResolvedType;\n})(ABI || (ABI = {}));\n\nclass Asset {\n    constructor(units, symbol) {\n        this.units = units;\n        this.symbol = symbol;\n    }\n    static from(value, symbol) {\n        if (isInstanceOf(value, Asset)) {\n            return value;\n        }\n        switch (typeof value) {\n            case 'number':\n                if (!symbol) {\n                    throw new Error('Symbol is required when creating Asset from number');\n                }\n                return this.fromFloat(value, symbol);\n            case 'string':\n                return this.fromString(value);\n            default:\n                throw new Error('Invalid asset');\n        }\n    }\n    static fromString(value) {\n        const parts = (typeof value === 'string' ? value : '').split(' ');\n        if (parts.length !== 2) {\n            throw new Error('Invalid asset string');\n        }\n        const amount = parts[0].replace('.', '');\n        const precision = (parts[0].split('.')[1] || '').length;\n        const symbol = Asset.Symbol.fromParts(parts[1], precision);\n        return new Asset(Int64.from(amount), symbol);\n    }\n    static fromFloat(value, symbol) {\n        const s = Asset.Symbol.from(symbol);\n        return new Asset(s.convertFloat(value), s);\n    }\n    static fromUnits(value, symbol) {\n        return new Asset(Int64.from(value), Asset.Symbol.from(symbol));\n    }\n    static fromABI(decoder) {\n        const units = Int64.fromABI(decoder);\n        const symbol = Asset.Symbol.fromABI(decoder);\n        return new Asset(units, symbol);\n    }\n    equals(other) {\n        const { symbol, units } = Asset.from(other);\n        return this.symbol.value.equals(symbol.value) && this.units.equals(units);\n    }\n    get value() {\n        return this.symbol.convertUnits(this.units);\n    }\n    set value(newValue) {\n        this.units = this.symbol.convertFloat(newValue);\n    }\n    toABI(encoder) {\n        this.units.toABI(encoder);\n        this.symbol.toABI(encoder);\n    }\n    toString() {\n        const digits = this.units.toString().split('');\n        let negative = false;\n        if (digits[0] === '-') {\n            negative = true;\n            digits.shift();\n        }\n        const p = this.symbol.precision;\n        while (digits.length <= p) {\n            digits.unshift('0');\n        }\n        if (p > 0) {\n            digits.splice(digits.length - p, 0, '.');\n        }\n        let rv = digits.join('');\n        if (negative) {\n            rv = '-' + rv;\n        }\n        return rv + ' ' + this.symbol.name;\n    }\n    toJSON() {\n        return this.toString();\n    }\n}\nAsset.abiName = 'asset';\n(function (Asset) {\n    class Symbol {\n        constructor(value) {\n            if (toSymbolPrecision(value) > Symbol.maxPrecision) {\n                throw new Error('Invalid asset symbol, precision too large');\n            }\n            if (!Symbol.symbolNamePattern.test(toSymbolName(value))) {\n                throw new Error('Invalid asset symbol, name must be uppercase A-Z');\n            }\n            this.value = value;\n        }\n        static from(value) {\n            if (isInstanceOf(value, Symbol)) {\n                return value;\n            }\n            if (isInstanceOf(value, UInt64)) {\n                return new Symbol(value);\n            }\n            const parts = value.split(',');\n            if (parts.length !== 2) {\n                throw new Error('Invalid symbol string');\n            }\n            const precision = Number.parseInt(parts[0]);\n            return Symbol.fromParts(parts[1], precision);\n        }\n        static fromParts(name, precision) {\n            return new Symbol(toRawSymbol(name, precision));\n        }\n        // eslint-disable-next-line @typescript-eslint/ban-types\n        static fromABI(decoder) {\n            return new Symbol(UInt64.fromABI(decoder));\n        }\n        equals(other) {\n            return this.value.equals(Symbol.from(other).value);\n        }\n        get name() {\n            return toSymbolName(this.value);\n        }\n        get precision() {\n            return toSymbolPrecision(this.value);\n        }\n        get code() {\n            return new SymbolCode(UInt64.from(this.value.value.clone().iushrn(8)));\n        }\n        toABI(encoder) {\n            this.value.toABI(encoder);\n        }\n        /**\n         * Convert units to floating point number according to symbol precision.\n         * @throws If the given units can't be represented in 53 bits.\n         **/\n        convertUnits(units) {\n            return units.value.toNumber() / Math.pow(10, this.precision);\n        }\n        /**\n         * Convert floating point to units according to symbol precision.\n         * Note that the value will be rounded to closest precision.\n         **/\n        convertFloat(float) {\n            return Int64.from(float.toFixed(this.precision).replace('.', ''));\n        }\n        toString() {\n            return `${this.precision},${this.name}`;\n        }\n        toJSON() {\n            return this.toString();\n        }\n    }\n    Symbol.abiName = 'symbol';\n    Symbol.symbolNamePattern = /^[A-Z]{1,7}$/;\n    Symbol.maxPrecision = 18;\n    Asset.Symbol = Symbol;\n    class SymbolCode {\n        constructor(value) {\n            this.value = value;\n        }\n        static from(value) {\n            if (isInstanceOf(value, SymbolCode)) {\n                return value;\n            }\n            if (typeof value === 'string') {\n                value = UInt64.from(toRawSymbolCode(value));\n            }\n            return new this(UInt64.from(value));\n        }\n        static fromABI(decoder) {\n            return new SymbolCode(UInt64.fromABI(decoder));\n        }\n        equals(other) {\n            return this.value.equals(SymbolCode.from(other).value);\n        }\n        toABI(encoder) {\n            this.value.toABI(encoder);\n        }\n        toString() {\n            return charsToSymbolName(this.value.value.toArray('be'));\n        }\n        toJSON() {\n            return this.toString();\n        }\n    }\n    SymbolCode.abiName = 'symbol_code';\n    Asset.SymbolCode = SymbolCode;\n})(Asset || (Asset = {}));\nclass ExtendedAsset {\n    constructor(quantity, contract) {\n        this.quantity = quantity;\n        this.contract = contract;\n    }\n    static from(value) {\n        if (isInstanceOf(value, ExtendedAsset)) {\n            return value;\n        }\n        return new this(Asset.from(value.quantity), Name.from(value.contract));\n    }\n    static fromABI(decoder) {\n        return new ExtendedAsset(Asset.fromABI(decoder), Name.fromABI(decoder));\n    }\n    equals(other) {\n        return this.quantity.equals(other.quantity) && this.contract.equals(other.contract);\n    }\n    toABI(encoder) {\n        this.quantity.toABI(encoder);\n        this.contract.toABI(encoder);\n    }\n    toJSON() {\n        return {\n            quantity: this.quantity,\n            contract: this.contract,\n        };\n    }\n}\nExtendedAsset.abiName = 'extended_asset';\nfunction toSymbolPrecision(rawSymbol) {\n    return rawSymbol.value.and(UInt64.from(0xff).value).toNumber();\n}\nfunction toSymbolName(rawSymbol) {\n    const chars = rawSymbol.value.toArray('be').slice(0, -1);\n    return charsToSymbolName(chars);\n}\nfunction charsToSymbolName(chars) {\n    return chars\n        .map((char) => String.fromCharCode(char))\n        .reverse()\n        .join('');\n}\nfunction toRawSymbol(name, precision) {\n    const code = toRawSymbolCode(name);\n    const bytes = new Uint8Array(code.length + 1);\n    bytes[0] = precision;\n    bytes.set(code, 1);\n    return UInt64.from(bytes);\n}\nfunction toRawSymbolCode(name) {\n    const length = Math.min(name.length, 7);\n    const bytes = new Uint8Array(length);\n    for (let i = 0; i < length; i++) {\n        bytes[i] = name.charCodeAt(i);\n    }\n    return bytes;\n}\n\nvar Base58;\n(function (Base58) {\n    let ErrorCode;\n    (function (ErrorCode) {\n        ErrorCode[\"E_CHECKSUM\"] = \"E_CHECKSUM\";\n        ErrorCode[\"E_INVALID\"] = \"E_INVALID\";\n    })(ErrorCode = Base58.ErrorCode || (Base58.ErrorCode = {}));\n    class DecodingError extends Error {\n        constructor(message, code, info = {}) {\n            super(message);\n            this.code = code;\n            this.info = info;\n        }\n    }\n    DecodingError.__className = 'DecodingError';\n    Base58.DecodingError = DecodingError;\n    const chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\n    const charMap = new Int16Array(0xff).fill(-1);\n    for (let i = 0; i < 58; ++i) {\n        charMap[chars.charCodeAt(i)] = i;\n    }\n    /** Decode a Base58 encoded string. */\n    function decode(s, size) {\n        if (size == null) {\n            return decodeVar(s);\n        }\n        const result = new Uint8Array(size);\n        for (let i = 0; i < s.length; ++i) {\n            let carry = charMap[s.charCodeAt(i)];\n            if (carry < 0) {\n                throw new DecodingError('Invalid Base58 character encountered', ErrorCode.E_INVALID, { char: s[i] });\n            }\n            for (let j = 0; j < size; ++j) {\n                const x = result[j] * 58 + carry;\n                result[j] = x;\n                carry = x >> 8;\n            }\n            if (carry) {\n                throw new DecodingError('Base58 value is out of range', ErrorCode.E_INVALID);\n            }\n        }\n        result.reverse();\n        return new Bytes(result);\n    }\n    Base58.decode = decode;\n    /** Decode a Base58Check encoded string. */\n    function decodeCheck(encoded, size) {\n        const decoded = decode(encoded, size != null ? size + 4 : size);\n        const data = decoded.array.subarray(0, -4);\n        const expected = decoded.array.subarray(-4);\n        const actual = dsha256Checksum(data);\n        if (!arrayEquals(expected, actual)) {\n            throw new DecodingError('Checksum mismatch', ErrorCode.E_CHECKSUM, {\n                actual,\n                expected,\n                data,\n                hash: 'double_sha256',\n            });\n        }\n        return new Bytes(data);\n    }\n    Base58.decodeCheck = decodeCheck;\n    /** Decode a Base58Check encoded string that uses ripemd160 instead of double sha256 for the digest. */\n    function decodeRipemd160Check(encoded, size, suffix) {\n        const decoded = decode(encoded, size != null ? size + 4 : size);\n        const data = decoded.array.subarray(0, -4);\n        const expected = decoded.array.subarray(-4);\n        const actual = ripemd160Checksum(data, suffix);\n        if (!arrayEquals(expected, actual)) {\n            throw new DecodingError('Checksum mismatch', ErrorCode.E_CHECKSUM, {\n                actual,\n                expected,\n                data,\n                hash: 'ripemd160',\n            });\n        }\n        return new Bytes(data);\n    }\n    Base58.decodeRipemd160Check = decodeRipemd160Check;\n    /** Encode bytes to a Base58 string.  */\n    function encode(data) {\n        data = Bytes.from(data);\n        const result = [];\n        for (const byte of data.array) {\n            let carry = byte;\n            for (let j = 0; j < result.length; ++j) {\n                const x = (charMap[result[j]] << 8) + carry;\n                result[j] = chars.charCodeAt(x % 58);\n                carry = (x / 58) | 0;\n            }\n            while (carry) {\n                result.push(chars.charCodeAt(carry % 58));\n                carry = (carry / 58) | 0;\n            }\n        }\n        for (const byte of data.array) {\n            if (byte) {\n                break;\n            }\n            else {\n                result.push('1'.charCodeAt(0));\n            }\n        }\n        result.reverse();\n        return String.fromCharCode(...result);\n    }\n    Base58.encode = encode;\n    function encodeCheck(data) {\n        data = Bytes.from(data);\n        data = data.appending(dsha256Checksum(data.array));\n        return encode(data);\n    }\n    Base58.encodeCheck = encodeCheck;\n    function encodeRipemd160Check(data, suffix) {\n        data = Bytes.from(data);\n        data = data.appending(ripemd160Checksum(data.array, suffix));\n        return encode(data);\n    }\n    Base58.encodeRipemd160Check = encodeRipemd160Check;\n    /** @internal */\n    function decodeVar(s) {\n        const result = [];\n        for (let i = 0; i < s.length; ++i) {\n            let carry = charMap[s.charCodeAt(i)];\n            if (carry < 0) {\n                throw new DecodingError('Invalid Base58 character encountered', ErrorCode.E_INVALID, { char: s[i] });\n            }\n            for (let j = 0; j < result.length; ++j) {\n                const x = result[j] * 58 + carry;\n                result[j] = x & 0xff;\n                carry = x >> 8;\n            }\n            if (carry) {\n                result.push(carry);\n            }\n        }\n        for (const ch of s) {\n            if (ch === '1') {\n                result.push(0);\n            }\n            else {\n                break;\n            }\n        }\n        result.reverse();\n        return Bytes.from(result);\n    }\n    /** @internal */\n    function ripemd160Checksum(data, suffix) {\n        const hash = ripemd160().update(data);\n        if (suffix) {\n            hash.update(suffix);\n        }\n        return new Uint8Array(hash.digest().slice(0, 4));\n    }\n    /** @internal */\n    function dsha256Checksum(data) {\n        const round1 = sha256().update(data).digest();\n        const round2 = sha256().update(round1).digest();\n        return new Uint8Array(round2.slice(0, 4));\n    }\n})(Base58 || (Base58 = {}));\n\nclass PublicKey {\n    /** @internal */\n    constructor(type, data) {\n        this.type = type;\n        this.data = data;\n    }\n    /** Create PublicKey object from representing types. */\n    static from(value) {\n        if (isInstanceOf(value, PublicKey)) {\n            return value;\n        }\n        if (typeof value === 'object' && value.type && value.compressed) {\n            return new PublicKey(CurveType.from(value.type), new Bytes(value.compressed));\n        }\n        if (typeof value !== 'string') {\n            throw new Error('Invalid public key');\n        }\n        if (value.startsWith('PUB_')) {\n            const parts = value.split('_');\n            if (parts.length !== 3) {\n                throw new Error('Invalid public key string');\n            }\n            const type = CurveType.from(parts[1]);\n            const size = type === CurveType.K1 || type === CurveType.R1 ? 33 : undefined;\n            const data = Base58.decodeRipemd160Check(parts[2], size, type);\n            return new PublicKey(type, data);\n        }\n        else if (value.length >= 50) {\n            // Legacy EOS key\n            const data = Base58.decodeRipemd160Check(value.slice(-50));\n            return new PublicKey(CurveType.K1, data);\n        }\n        else {\n            throw new Error('Invalid public key string');\n        }\n    }\n    /** @internal */\n    static fromABI(decoder) {\n        const type = CurveType.from(decoder.readByte());\n        if (type == CurveType.WA) {\n            // \"WA\" keys pack some sort of metadata\n            // we probably need to restructure key data storage into containers like FC does\n            const data = new Bytes(decoder.readArray(33));\n            Bytes.fromABI(decoder); // throw away metadata for now\n            return new PublicKey(type, data);\n        }\n        return new PublicKey(type, new Bytes(decoder.readArray(33)));\n    }\n    equals(other) {\n        const otherKey = PublicKey.from(other);\n        return this.type === otherKey.type && this.data.equals(otherKey.data);\n    }\n    /**\n     * Return EOSIO legacy (`EOS<base58data>`) formatted key.\n     * @throws If the key type isn't `K1`\n     */\n    toLegacyString(prefix = 'EOS') {\n        if (this.type !== CurveType.K1) {\n            throw new Error('Unable to create legacy formatted string for non-K1 key');\n        }\n        return `${prefix}${Base58.encodeRipemd160Check(this.data)}`;\n    }\n    /** Return key in modern EOSIO format (`PUB_<type>_<base58data>`) */\n    toString() {\n        return `PUB_${this.type}_${Base58.encodeRipemd160Check(this.data, this.type)}`;\n    }\n    /** @internal */\n    toABI(encoder) {\n        if (this.type === CurveType.WA) {\n            throw new Error('WA keys are not supported yet');\n        }\n        encoder.writeByte(CurveType.indexFor(this.type));\n        encoder.writeArray(this.data.array);\n    }\n    /** @internal */\n    toJSON() {\n        return this.toString();\n    }\n}\nPublicKey.abiName = 'public_key';\n\nconst curves = {};\n/**\n * Get curve for key type.\n * @internal\n */\nfunction getCurve(type) {\n    let rv = curves[type];\n    if (!rv) {\n        if (type === 'K1') {\n            rv = curves[type] = new ec('secp256k1');\n        }\n        else if (type === 'R1') {\n            rv = curves[type] = new ec('p256');\n        }\n        else {\n            throw new Error(`Unknown curve type: ${type}`);\n        }\n    }\n    return rv;\n}\n\n/**\n * Recover public key from signature and recovery id.\n * @internal\n */\nfunction recover(signature, message, type) {\n    const curve = getCurve(type);\n    const recid = signature[0] - 31;\n    const r = signature.subarray(1, 33);\n    const s = signature.subarray(33);\n    const point = curve.recoverPubKey(message, { r, s }, recid);\n    return new Uint8Array(point.encodeCompressed());\n}\n\n/**\n * Verify signature using message and public key.\n * @internal\n */\nfunction verify(signature, message, pubkey, type) {\n    const curve = getCurve(type);\n    const r = signature.subarray(1, 33);\n    const s = signature.subarray(33);\n    return curve.verify(message, { r, s }, pubkey);\n}\n\nclass Signature {\n    /** @internal */\n    constructor(type, data) {\n        this.type = type;\n        this.data = data;\n    }\n    /** Create Signature object from representing types. */\n    static from(value) {\n        if (isInstanceOf(value, Signature)) {\n            return value;\n        }\n        if (typeof value === 'object' && value.r && value.s) {\n            const data = new Uint8Array(1 + 32 + 32);\n            let recid = value.recid;\n            const type = CurveType.from(value.type);\n            if (value.type === CurveType.K1 || value.type === CurveType.R1) {\n                recid += 31;\n            }\n            data[0] = recid;\n            data.set(value.r, 1);\n            data.set(value.s, 33);\n            return new Signature(type, new Bytes(data));\n        }\n        if (typeof value !== 'string') {\n            throw new Error('Invalid signature');\n        }\n        if (value.startsWith('SIG_')) {\n            const parts = value.split('_');\n            if (parts.length !== 3) {\n                throw new Error('Invalid signature string');\n            }\n            const type = CurveType.from(parts[1]);\n            const size = type === CurveType.K1 || type === CurveType.R1 ? 65 : undefined;\n            const data = Base58.decodeRipemd160Check(parts[2], size, type);\n            return new Signature(type, data);\n        }\n        else {\n            throw new Error('Invalid signature string');\n        }\n    }\n    /** @internal */\n    static fromABI(decoder) {\n        const type = CurveType.from(decoder.readByte());\n        if (type === CurveType.WA) {\n            // same as with public keys WA type has some extra data tacked on\n            const data = new Bytes(decoder.readArray(65)); // sig\n            Bytes.fromABI(decoder); // throw away for now\n            Bytes.fromABI(decoder);\n            return new Signature(CurveType.WA, data);\n        }\n        return new Signature(type, new Bytes(decoder.readArray(65)));\n    }\n    equals(other) {\n        const otherSig = Signature.from(other);\n        return this.type === otherSig.type && this.data.equals(otherSig.data);\n    }\n    /** Recover public key from given message digest. */\n    recoverDigest(digest) {\n        digest = Checksum256.from(digest);\n        const compressed = recover(this.data.array, digest.array, this.type);\n        return PublicKey.from({ compressed, type: this.type });\n    }\n    /** Recover public key from given message. */\n    recoverMessage(message) {\n        return this.recoverDigest(Checksum256.hash(message));\n    }\n    /** Verify this signature with given message digest and public key. */\n    verifyDigest(digest, publicKey) {\n        digest = Checksum256.from(digest);\n        return verify(this.data.array, digest.array, publicKey.data.array, this.type);\n    }\n    /** Verify this signature with given message and public key. */\n    verifyMessage(message, publicKey) {\n        return this.verifyDigest(Checksum256.hash(message), publicKey);\n    }\n    /** Base58check encoded string representation of this signature (`SIG_<type>_<data>`). */\n    toString() {\n        return `SIG_${this.type}_${Base58.encodeRipemd160Check(this.data, this.type)}`;\n    }\n    /** @internal */\n    toABI(encoder) {\n        if (this.type === CurveType.WA) {\n            throw new Error('WA signatures are not supported yet');\n        }\n        encoder.writeByte(CurveType.indexFor(this.type));\n        encoder.writeArray(this.data.array);\n    }\n    /** @internal */\n    toJSON() {\n        return this.toString();\n    }\n}\nSignature.abiName = 'signature';\n\n/**\n * Get public key corresponding to given private key.\n * @internal\n */\nfunction getPublic(privkey, type) {\n    const curve = getCurve(type);\n    const key = curve.keyFromPrivate(privkey);\n    const point = key.getPublic();\n    return new Uint8Array(point.encodeCompressed());\n}\n\n/**\n * Derive shared secret for key pair.\n * @internal\n */\nfunction sharedSecret(privkey, pubkey, type) {\n    const curve = getCurve(type);\n    const priv = curve.keyFromPrivate(privkey);\n    const pub = curve.keyFromPublic(pubkey).getPublic();\n    return priv.derive(pub).toArrayLike(Uint8Array, 'be');\n}\n\n/**\n * Sign digest using private key.\n * @internal\n */\nfunction sign(secret, message, type) {\n    const curve = getCurve(type);\n    const key = curve.keyFromPrivate(secret);\n    let sig;\n    let r;\n    let s;\n    if (type === 'K1') {\n        let attempt = 1;\n        do {\n            sig = key.sign(message, { canonical: true, pers: [attempt++] });\n            r = sig.r.toArrayLike(Uint8Array, 'be', 32);\n            s = sig.s.toArrayLike(Uint8Array, 'be', 32);\n        } while (!isCanonical(r, s));\n    }\n    else {\n        sig = key.sign(message, { canonical: true });\n        r = sig.r.toArrayLike(Uint8Array, 'be', 32);\n        s = sig.s.toArrayLike(Uint8Array, 'be', 32);\n    }\n    return { type, r, s, recid: sig.recoveryParam || 0 };\n}\n/**\n * Here be dragons\n * - https://github.com/steemit/steem/issues/1944\n * - https://github.com/EOSIO/eos/issues/6699\n * @internal\n */\nfunction isCanonical(r, s) {\n    return (!(r[0] & 0x80) &&\n        !(r[0] === 0 && !(r[1] & 0x80)) &&\n        !(s[0] & 0x80) &&\n        !(s[0] === 0 && !(s[1] & 0x80)));\n}\n\n/**\n * Generate a new private key for given type.\n * @internal\n */\nfunction generate(type) {\n    const curve = getCurve(type);\n    const privkey = curve.genKeyPair().getPrivate();\n    return privkey.toArrayLike(Uint8Array, 'be');\n}\n\nclass PrivateKey {\n    /** @internal */\n    constructor(type, data) {\n        this.type = type;\n        this.data = data;\n    }\n    /** Create PrivateKey object from representing types. */\n    static from(value) {\n        if (isInstanceOf(value, PrivateKey)) {\n            return value;\n        }\n        else {\n            return this.fromString(value);\n        }\n    }\n    /**\n     * Create PrivateKey object from a string representation.\n     * Accepts WIF (5...) and EOSIO (PVT_...) style private keys.\n     */\n    static fromString(string, ignoreChecksumError = false) {\n        try {\n            const { type, data } = decodeKey(string);\n            return new this(type, data);\n        }\n        catch (error) {\n            error.message = `Invalid private key (${error.message})`;\n            if (ignoreChecksumError &&\n                isInstanceOf(error, Base58.DecodingError) &&\n                error.code === Base58.ErrorCode.E_CHECKSUM) {\n                const type = string.startsWith('PVT_R1') ? CurveType.R1 : CurveType.K1;\n                let data = new Bytes(error.info.data);\n                if (data.array.length == 33) {\n                    data = data.droppingFirst();\n                }\n                return new this(type, data);\n            }\n            throw error;\n        }\n    }\n    /**\n     * Generate new PrivateKey.\n     * @throws If a secure random source isn't available.\n     */\n    static generate(type) {\n        return new PrivateKey(CurveType.from(type), new Bytes(generate(type)));\n    }\n    /**\n     * Sign message digest using this key.\n     * @throws If the key type isn't R1 or K1.\n     */\n    signDigest(digest) {\n        digest = Checksum256.from(digest);\n        return Signature.from(sign(this.data.array, digest.array, this.type));\n    }\n    /**\n     * Sign message using this key.\n     * @throws If the key type isn't R1 or K1.\n     */\n    signMessage(message) {\n        return this.signDigest(Checksum256.hash(message));\n    }\n    /**\n     * Derive the shared secret between this private key and given public key.\n     * @throws If the key type isn't R1 or K1.\n     */\n    sharedSecret(publicKey) {\n        const shared = sharedSecret(this.data.array, publicKey.data.array, this.type);\n        return Checksum512.hash(shared);\n    }\n    /**\n     * Get the corresponding public key.\n     * @throws If the key type isn't R1 or K1.\n     */\n    toPublic() {\n        const compressed = getPublic(this.data.array, this.type);\n        return PublicKey.from({ compressed, type: this.type });\n    }\n    /**\n     * Return WIF representation of this private key\n     * @throws If the key type isn't K1.\n     */\n    toWif() {\n        if (this.type !== CurveType.K1) {\n            throw new Error('Unable to generate WIF for non-k1 key');\n        }\n        return Base58.encodeCheck(Bytes.from([0x80]).appending(this.data));\n    }\n    /**\n     * Return the key in EOSIO PVT_<type>_<base58check> format.\n     */\n    toString() {\n        return `PVT_${this.type}_${Base58.encodeRipemd160Check(this.data, this.type)}`;\n    }\n    toJSON() {\n        return this.toString();\n    }\n}\n/** @internal */\nfunction decodeKey(value) {\n    const type = typeof value;\n    if (type !== 'string') {\n        throw new Error(`Expected string, got ${type}`);\n    }\n    if (value.startsWith('PVT_')) {\n        // EOSIO format\n        const parts = value.split('_');\n        if (parts.length !== 3) {\n            throw new Error('Invalid PVT format');\n        }\n        const type = CurveType.from(parts[1]);\n        let size;\n        switch (type) {\n            case CurveType.K1:\n            case CurveType.R1:\n                size = 32;\n                break;\n        }\n        const data = Base58.decodeRipemd160Check(parts[2], size, type);\n        return { type, data };\n    }\n    else {\n        // WIF format\n        const type = CurveType.K1;\n        const data = Base58.decodeCheck(value);\n        if (data.array[0] !== 0x80) {\n            throw new Error('Invalid WIF');\n        }\n        return { type, data: data.droppingFirst() };\n    }\n}\n\nvar PermissionLevel_1;\n/** EOSIO Permission Level, a.k.a \"auth\". */\nlet PermissionLevel = PermissionLevel_1 = class PermissionLevel extends Struct {\n    /** Create new permission level from representing types. Can be expressed as a string in the format `<actor>@<permission>`. */\n    static from(value) {\n        if (typeof value === 'string') {\n            const parts = value.split('@');\n            if (parts.length !== 2 && parts[0].length > 0 && parts[1].length > 0) {\n                throw new Error('Invalid permission level string, should be in the format <actor>@<permission>');\n            }\n            value = { actor: parts[0], permission: parts[1] };\n        }\n        return super.from(value);\n    }\n    /** Return true if this permission level equals other. */\n    equals(other) {\n        const otherPerm = PermissionLevel_1.from(other);\n        return this.actor.equals(otherPerm.actor) && this.permission.equals(otherPerm.permission);\n    }\n    toString() {\n        return `${this.actor}@${this.permission}`;\n    }\n};\n__decorate([\n    Struct.field('name')\n], PermissionLevel.prototype, \"actor\", void 0);\n__decorate([\n    Struct.field('name')\n], PermissionLevel.prototype, \"permission\", void 0);\nPermissionLevel = PermissionLevel_1 = __decorate([\n    Struct.type('permission_level')\n], PermissionLevel);\n\nvar Action_1;\nlet Action = Action_1 = class Action extends Struct {\n    static from(object, abi) {\n        const data = object.data;\n        if (!Bytes.isBytes(data)) {\n            let type;\n            if (abi) {\n                type = ABI.from(abi).getActionType(object.name);\n            }\n            else if (!data.constructor || data.constructor.abiName === undefined) {\n                throw new Error('Missing ABI definition when creating action with untyped action data');\n            }\n            object = {\n                ...object,\n                data: abiEncode({ object: data, type, abi }),\n            };\n        }\n        return super.from(object);\n    }\n    /** Return true if this Action is equal to given action. */\n    equals(other) {\n        const otherAction = Action_1.from(other);\n        return (this.account.equals(otherAction.account) &&\n            this.name.equals(otherAction.name) &&\n            arrayEquatableEquals(this.authorization, otherAction.authorization) &&\n            this.data.equals(otherAction.data));\n    }\n    decodeData(typeOrAbi) {\n        if (typeof typeOrAbi === 'string' || typeOrAbi.abiName) {\n            return abiDecode({\n                data: this.data,\n                type: typeOrAbi,\n            });\n        }\n        else {\n            const abi = ABI.from(typeOrAbi);\n            const type = abi.getActionType(this.name);\n            if (!type) {\n                throw new Error(`Action ${this.name} does not exist in provided ABI`);\n            }\n            return abiDecode({ data: this.data, type, abi });\n        }\n    }\n};\n__decorate([\n    Struct.field('name')\n], Action.prototype, \"account\", void 0);\n__decorate([\n    Struct.field('name')\n], Action.prototype, \"name\", void 0);\n__decorate([\n    Struct.field(PermissionLevel, { array: true })\n], Action.prototype, \"authorization\", void 0);\n__decorate([\n    Struct.field('bytes')\n], Action.prototype, \"data\", void 0);\nAction = Action_1 = __decorate([\n    Struct.type('action')\n], Action);\n\nvar Transaction_1;\nlet TransactionExtension = class TransactionExtension extends Struct {\n};\n__decorate([\n    Struct.field('uint16')\n], TransactionExtension.prototype, \"type\", void 0);\n__decorate([\n    Struct.field('bytes')\n], TransactionExtension.prototype, \"data\", void 0);\nTransactionExtension = __decorate([\n    Struct.type('transaction_extension')\n], TransactionExtension);\nlet TransactionHeader = class TransactionHeader extends Struct {\n    static from(object) {\n        return super.from(object);\n    }\n};\n__decorate([\n    Struct.field('time_point_sec')\n], TransactionHeader.prototype, \"expiration\", void 0);\n__decorate([\n    Struct.field('uint16')\n], TransactionHeader.prototype, \"ref_block_num\", void 0);\n__decorate([\n    Struct.field('uint32')\n], TransactionHeader.prototype, \"ref_block_prefix\", void 0);\n__decorate([\n    Struct.field('varuint32', { default: 0 })\n], TransactionHeader.prototype, \"max_net_usage_words\", void 0);\n__decorate([\n    Struct.field('uint8', { default: 0 })\n], TransactionHeader.prototype, \"max_cpu_usage_ms\", void 0);\n__decorate([\n    Struct.field('varuint32', { default: 0 })\n], TransactionHeader.prototype, \"delay_sec\", void 0);\nTransactionHeader = __decorate([\n    Struct.type('transaction_header')\n], TransactionHeader);\nlet Transaction = Transaction_1 = class Transaction extends TransactionHeader {\n    static from(object, abis) {\n        const abiFor = (contract) => {\n            if (!abis) {\n                return;\n            }\n            else if (Array.isArray(abis)) {\n                return abis\n                    .filter((abi) => Name.from(abi.contract).equals(contract))\n                    .map(({ abi }) => abi)[0];\n            }\n            else {\n                return abis;\n            }\n        };\n        const resolveAction = (action) => Action.from(action, abiFor(action.account));\n        const actions = (object.actions || []).map(resolveAction);\n        const context_free_actions = (object.context_free_actions || []).map(resolveAction);\n        const transaction = {\n            ...object,\n            context_free_actions,\n            actions,\n        };\n        return super.from(transaction);\n    }\n    /** Return true if this transaction is equal to given transaction. */\n    equals(other) {\n        const tx = Transaction_1.from(other);\n        return this.id.equals(tx.id);\n    }\n    get id() {\n        return Checksum256.hash(abiEncode({ object: this }));\n    }\n    signingDigest(chainId) {\n        let data = Bytes.from(Checksum256.from(chainId).array);\n        data = data.appending(abiEncode({ object: this }));\n        data = data.appending(new Uint8Array(32));\n        return Checksum256.hash(data);\n    }\n};\n__decorate([\n    Struct.field(Action, { array: true, default: [] })\n], Transaction.prototype, \"context_free_actions\", void 0);\n__decorate([\n    Struct.field(Action, { array: true, default: [] })\n], Transaction.prototype, \"actions\", void 0);\n__decorate([\n    Struct.field(TransactionExtension, { array: true, default: [] })\n], Transaction.prototype, \"transaction_extensions\", void 0);\nTransaction = Transaction_1 = __decorate([\n    Struct.type('transaction')\n], Transaction);\nlet SignedTransaction = class SignedTransaction extends Transaction {\n    static from(object) {\n        return super.from(object);\n    }\n};\n__decorate([\n    Struct.field('signature[]', { default: [] })\n], SignedTransaction.prototype, \"signatures\", void 0);\n__decorate([\n    Struct.field('bytes[]', { default: [] })\n], SignedTransaction.prototype, \"context_free_data\", void 0);\nSignedTransaction = __decorate([\n    Struct.type('signed_transaction')\n], SignedTransaction);\nlet PackedTransaction = class PackedTransaction extends Struct {\n    static fromSigned(signed) {\n        const tx = Transaction.from(signed);\n        return this.from({\n            signatures: signed.signatures,\n            packed_context_free_data: abiEncode({\n                object: signed.context_free_data,\n                type: 'bytes[]',\n            }),\n            packed_trx: abiEncode({ object: tx }),\n        });\n    }\n    getTransaction() {\n        if (Number(this.compression) !== 0) {\n            throw new Error('Transaction compression not supported yet');\n        }\n        return abiDecode({ data: this.packed_trx, type: Transaction });\n    }\n    getSignedTransaction() {\n        const transaction = this.getTransaction();\n        // TODO: decode context free data\n        return SignedTransaction.from({\n            ...transaction,\n            signatures: this.signatures,\n        });\n    }\n};\n__decorate([\n    Struct.field('signature[]')\n], PackedTransaction.prototype, \"signatures\", void 0);\n__decorate([\n    Struct.field('uint8', { default: 0 })\n], PackedTransaction.prototype, \"compression\", void 0);\n__decorate([\n    Struct.field('bytes')\n], PackedTransaction.prototype, \"packed_context_free_data\", void 0);\n__decorate([\n    Struct.field('bytes')\n], PackedTransaction.prototype, \"packed_trx\", void 0);\nPackedTransaction = __decorate([\n    Struct.type('packed_transaction')\n], PackedTransaction);\nlet TransactionReceipt = class TransactionReceipt extends Struct {\n};\n__decorate([\n    Struct.field('string')\n], TransactionReceipt.prototype, \"status\", void 0);\n__decorate([\n    Struct.field('uint32')\n], TransactionReceipt.prototype, \"cpu_usage_us\", void 0);\n__decorate([\n    Struct.field('uint32')\n], TransactionReceipt.prototype, \"net_usage_words\", void 0);\nTransactionReceipt = __decorate([\n    Struct.type('transaction_receipt')\n], TransactionReceipt);\n\nvar Authority_1;\nlet Weight = class Weight extends UInt16 {\n};\nWeight = __decorate([\n    TypeAlias('weight_type')\n], Weight);\nlet KeyWeight = class KeyWeight extends Struct {\n};\n__decorate([\n    Struct.field(PublicKey)\n], KeyWeight.prototype, \"key\", void 0);\n__decorate([\n    Struct.field(Weight)\n], KeyWeight.prototype, \"weight\", void 0);\nKeyWeight = __decorate([\n    Struct.type('key_weight')\n], KeyWeight);\nlet PermissionLevelWeight = class PermissionLevelWeight extends Struct {\n};\n__decorate([\n    Struct.field(PermissionLevel)\n], PermissionLevelWeight.prototype, \"permission\", void 0);\n__decorate([\n    Struct.field(Weight)\n], PermissionLevelWeight.prototype, \"weight\", void 0);\nPermissionLevelWeight = __decorate([\n    Struct.type('permission_level_weight')\n], PermissionLevelWeight);\nlet WaitWeight = class WaitWeight extends Struct {\n};\n__decorate([\n    Struct.field(UInt32)\n], WaitWeight.prototype, \"wait_sec\", void 0);\n__decorate([\n    Struct.field(Weight)\n], WaitWeight.prototype, \"weight\", void 0);\nWaitWeight = __decorate([\n    Struct.type('wait_weight')\n], WaitWeight);\nlet Authority = Authority_1 = class Authority extends Struct {\n    static from(value) {\n        if (isInstanceOf(value, Authority_1)) {\n            return value;\n        }\n        const rv = super.from({\n            keys: [],\n            accounts: [],\n            waits: [],\n            ...value,\n        });\n        rv.sort();\n        return rv;\n    }\n    /** Total weight of all waits. */\n    get waitThreshold() {\n        return this.waits.reduce((val, wait) => val + wait.weight.toNumber(), 0);\n    }\n    /** Weight a key needs to sign for this authority. */\n    get keyThreshold() {\n        return this.threshold.toNumber() - this.waitThreshold;\n    }\n    /** Return the weight for given public key, or zero if it is not included in this authority. */\n    keyWeight(publicKey) {\n        const weight = this.keys.find(({ key }) => key.equals(publicKey));\n        return weight ? weight.weight.toNumber() : 0;\n    }\n    /**\n     * Check if given public key has permission in this authority,\n     * @attention Does not take indirect permissions for the key via account weights into account.\n     * @param publicKey The key to check.\n     * @param includePartial Whether to consider auths where the key is included but can't be reached alone (e.g. multisig).\n     */\n    hasPermission(publicKey, includePartial = false) {\n        const threshold = includePartial ? 1 : this.keyThreshold;\n        const weight = this.keyWeight(publicKey);\n        return weight >= threshold;\n    }\n    /**\n     * Sorts the authority weights in place, should be called before including the authority in a `updateauth` action or it might be rejected.\n     */\n    sort() {\n        // This hack satisfies the constraints that authority weights, see: https://github.com/greymass/eosio-core/issues/8\n        this.keys.sort((a, b) => String(a.key).localeCompare(String(b.key)));\n        this.accounts.sort((a, b) => String(a.permission).localeCompare(String(b.permission)));\n        this.waits.sort((a, b) => String(a.wait_sec).localeCompare(String(b.wait_sec)));\n    }\n};\n__decorate([\n    Struct.field(UInt32)\n], Authority.prototype, \"threshold\", void 0);\n__decorate([\n    Struct.field(KeyWeight, { array: true })\n], Authority.prototype, \"keys\", void 0);\n__decorate([\n    Struct.field(PermissionLevelWeight, { array: true })\n], Authority.prototype, \"accounts\", void 0);\n__decorate([\n    Struct.field(WaitWeight, { array: true })\n], Authority.prototype, \"waits\", void 0);\nAuthority = Authority_1 = __decorate([\n    Struct.type('authority')\n], Authority);\n\nvar Serializer;\n(function (Serializer) {\n    Serializer.encode = abiEncode;\n    Serializer.decode = abiDecode;\n    /** Create an EOSIO ABI definition for given core type. */\n    function synthesize(type) {\n        return synthesizeABI(type).abi;\n    }\n    Serializer.synthesize = synthesize;\n    /** Create JSON representation of a core object. */\n    function stringify(object) {\n        return JSON.stringify(object);\n    }\n    Serializer.stringify = stringify;\n    /** Create a vanilla js representation of a core object. */\n    function objectify(object) {\n        const walk = (v) => {\n            switch (typeof v) {\n                case 'boolean':\n                case 'number':\n                case 'string':\n                    return v;\n                case 'object': {\n                    if (v === null) {\n                        return v;\n                    }\n                    if (typeof v.toJSON === 'function') {\n                        return walk(v.toJSON());\n                    }\n                    if (Array.isArray(v)) {\n                        return v.map(walk);\n                    }\n                    const rv = {};\n                    for (const key of Object.keys(v)) {\n                        rv[key] = walk(v[key]);\n                    }\n                    return rv;\n                }\n            }\n        };\n        return walk(object);\n    }\n    Serializer.objectify = objectify;\n})(Serializer || (Serializer = {}));\n\n/** Default provider that uses the Fetch API to call a single node. */\nclass FetchProvider {\n    constructor(url, options = {}) {\n        url = url.trim();\n        if (url.endsWith('/'))\n            url = url.slice(0, -1);\n        this.url = url;\n        if (!options.fetch) {\n            if (typeof window !== 'undefined' && window.fetch) {\n                this.fetch = window.fetch.bind(window);\n            }\n            else if (typeof global !== 'undefined' && global.fetch) {\n                this.fetch = global.fetch.bind(global);\n            }\n            else {\n                throw new Error('Missing fetch');\n            }\n        }\n        else {\n            this.fetch = options.fetch;\n        }\n    }\n    async call(path, params) {\n        const url = this.url + path;\n        const response = await this.fetch(url, {\n            method: 'POST',\n            body: params !== undefined ? JSON.stringify(params) : undefined,\n        });\n        try {\n            return response.json();\n        }\n        catch (error) {\n            if (!response.ok) {\n                throw Error(`HTTP ${response.status}: ${response.statusText}`);\n            }\n            error.message = `Unable to parse JSON response from server: ${error.message}`;\n            throw error;\n        }\n    }\n}\n\nlet AccountPermission = class AccountPermission extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], AccountPermission.prototype, \"perm_name\", void 0);\n__decorate([\n    Struct.field('name')\n], AccountPermission.prototype, \"parent\", void 0);\n__decorate([\n    Struct.field(Authority)\n], AccountPermission.prototype, \"required_auth\", void 0);\nAccountPermission = __decorate([\n    Struct.type('account_permission')\n], AccountPermission);\nlet AccountResourceLimit = class AccountResourceLimit extends Struct {\n};\n__decorate([\n    Struct.field('int64')\n], AccountResourceLimit.prototype, \"used\", void 0);\n__decorate([\n    Struct.field('int64')\n], AccountResourceLimit.prototype, \"available\", void 0);\n__decorate([\n    Struct.field('int64')\n], AccountResourceLimit.prototype, \"max\", void 0);\nAccountResourceLimit = __decorate([\n    Struct.type('account_resource_limit')\n], AccountResourceLimit);\nlet AccountTotalResources = class AccountTotalResources extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], AccountTotalResources.prototype, \"owner\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountTotalResources.prototype, \"net_weight\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountTotalResources.prototype, \"cpu_weight\", void 0);\n__decorate([\n    Struct.field('uint64')\n], AccountTotalResources.prototype, \"ram_bytes\", void 0);\nAccountTotalResources = __decorate([\n    Struct.type('account_total_resources')\n], AccountTotalResources);\nlet AccountSelfDelegatedBandwidth = class AccountSelfDelegatedBandwidth extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], AccountSelfDelegatedBandwidth.prototype, \"from\", void 0);\n__decorate([\n    Struct.field('name')\n], AccountSelfDelegatedBandwidth.prototype, \"to\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountSelfDelegatedBandwidth.prototype, \"net_weight\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountSelfDelegatedBandwidth.prototype, \"cpu_weight\", void 0);\nAccountSelfDelegatedBandwidth = __decorate([\n    Struct.type('account_self_delegated_bandwidth')\n], AccountSelfDelegatedBandwidth);\nlet AccountRefundRequest = class AccountRefundRequest extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], AccountRefundRequest.prototype, \"owner\", void 0);\n__decorate([\n    Struct.field('time_point')\n], AccountRefundRequest.prototype, \"request_time\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountRefundRequest.prototype, \"net_amount\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountRefundRequest.prototype, \"cpu_amount\", void 0);\nAccountRefundRequest = __decorate([\n    Struct.type('account_refund_request')\n], AccountRefundRequest);\nlet AccountVoterInfo = class AccountVoterInfo extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], AccountVoterInfo.prototype, \"owner\", void 0);\n__decorate([\n    Struct.field('name')\n], AccountVoterInfo.prototype, \"proxy\", void 0);\n__decorate([\n    Struct.field('name', { array: true })\n], AccountVoterInfo.prototype, \"producers\", void 0);\n__decorate([\n    Struct.field('int64', { optional: true })\n], AccountVoterInfo.prototype, \"staked\", void 0);\n__decorate([\n    Struct.field('bool')\n], AccountVoterInfo.prototype, \"is_proxy\", void 0);\n__decorate([\n    Struct.field('uint32', { optional: true })\n], AccountVoterInfo.prototype, \"flags1\", void 0);\n__decorate([\n    Struct.field('uint32')\n], AccountVoterInfo.prototype, \"reserved2\", void 0);\n__decorate([\n    Struct.field('string')\n], AccountVoterInfo.prototype, \"reserved3\", void 0);\nAccountVoterInfo = __decorate([\n    Struct.type('account_voter_info')\n], AccountVoterInfo);\nlet AccountRexInfoMaturities = class AccountRexInfoMaturities extends Struct {\n};\n__decorate([\n    Struct.field('time_point', { optional: true })\n], AccountRexInfoMaturities.prototype, \"key\", void 0);\n__decorate([\n    Struct.field('int64', { optional: true })\n], AccountRexInfoMaturities.prototype, \"value\", void 0);\n__decorate([\n    Struct.field('time_point', { optional: true })\n], AccountRexInfoMaturities.prototype, \"first\", void 0);\n__decorate([\n    Struct.field('int64', { optional: true })\n], AccountRexInfoMaturities.prototype, \"second\", void 0);\nAccountRexInfoMaturities = __decorate([\n    Struct.type('account_rex_info_maturities')\n], AccountRexInfoMaturities);\nlet AccountRexInfo = class AccountRexInfo extends Struct {\n};\n__decorate([\n    Struct.field('uint32')\n], AccountRexInfo.prototype, \"version\", void 0);\n__decorate([\n    Struct.field('name')\n], AccountRexInfo.prototype, \"owner\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountRexInfo.prototype, \"vote_stake\", void 0);\n__decorate([\n    Struct.field('asset')\n], AccountRexInfo.prototype, \"rex_balance\", void 0);\n__decorate([\n    Struct.field('int64')\n], AccountRexInfo.prototype, \"matured_rex\", void 0);\n__decorate([\n    Struct.field(AccountRexInfoMaturities, { array: true })\n], AccountRexInfo.prototype, \"rex_maturities\", void 0);\nAccountRexInfo = __decorate([\n    Struct.type('account_rex_info')\n], AccountRexInfo);\nlet AccountObject = class AccountObject extends Struct {\n    getPermission(permission) {\n        const name = Name.from(permission);\n        const match = this.permissions.find((p) => p.perm_name.equals(name));\n        if (!match) {\n            throw new Error(`Unknown permission ${name} on account ${this.account_name}.`);\n        }\n        return match;\n    }\n};\n__decorate([\n    Struct.field('name')\n], AccountObject.prototype, \"account_name\", void 0);\n__decorate([\n    Struct.field('uint32')\n], AccountObject.prototype, \"head_block_num\", void 0);\n__decorate([\n    Struct.field('time_point')\n], AccountObject.prototype, \"head_block_time\", void 0);\n__decorate([\n    Struct.field('bool')\n], AccountObject.prototype, \"privileged\", void 0);\n__decorate([\n    Struct.field('time_point')\n], AccountObject.prototype, \"last_code_update\", void 0);\n__decorate([\n    Struct.field('time_point')\n], AccountObject.prototype, \"created\", void 0);\n__decorate([\n    Struct.field('asset?')\n], AccountObject.prototype, \"core_liquid_balance\", void 0);\n__decorate([\n    Struct.field('int64')\n], AccountObject.prototype, \"ram_quota\", void 0);\n__decorate([\n    Struct.field('int64')\n], AccountObject.prototype, \"net_weight\", void 0);\n__decorate([\n    Struct.field('int64')\n], AccountObject.prototype, \"cpu_weight\", void 0);\n__decorate([\n    Struct.field(AccountResourceLimit)\n], AccountObject.prototype, \"net_limit\", void 0);\n__decorate([\n    Struct.field(AccountResourceLimit)\n], AccountObject.prototype, \"cpu_limit\", void 0);\n__decorate([\n    Struct.field('uint64')\n], AccountObject.prototype, \"ram_usage\", void 0);\n__decorate([\n    Struct.field(AccountPermission, { array: true })\n], AccountObject.prototype, \"permissions\", void 0);\n__decorate([\n    Struct.field(AccountTotalResources)\n], AccountObject.prototype, \"total_resources\", void 0);\n__decorate([\n    Struct.field(AccountSelfDelegatedBandwidth, { optional: true })\n], AccountObject.prototype, \"self_delegated_bandwidth\", void 0);\n__decorate([\n    Struct.field(AccountRefundRequest, { optional: true })\n], AccountObject.prototype, \"refund_request\", void 0);\n__decorate([\n    Struct.field(AccountVoterInfo, { optional: true })\n], AccountObject.prototype, \"voter_info\", void 0);\n__decorate([\n    Struct.field(AccountRexInfo, { optional: true })\n], AccountObject.prototype, \"rex_info\", void 0);\nAccountObject = __decorate([\n    Struct.type('account_object')\n], AccountObject);\nlet NewProducersEntry = class NewProducersEntry extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], NewProducersEntry.prototype, \"producer_name\", void 0);\n__decorate([\n    Struct.field('public_key')\n], NewProducersEntry.prototype, \"block_signing_key\", void 0);\nNewProducersEntry = __decorate([\n    Struct.type('new_producers_entry')\n], NewProducersEntry);\nlet NewProducers = class NewProducers extends Struct {\n};\n__decorate([\n    Struct.field('uint32')\n], NewProducers.prototype, \"version\", void 0);\n__decorate([\n    Struct.field(NewProducersEntry, { array: true })\n], NewProducers.prototype, \"producers\", void 0);\nNewProducers = __decorate([\n    Struct.type('new_producers')\n], NewProducers);\nlet BlockExtension = class BlockExtension extends Struct {\n};\n__decorate([\n    Struct.field('uint16')\n], BlockExtension.prototype, \"type\", void 0);\n__decorate([\n    Struct.field('bytes')\n], BlockExtension.prototype, \"data\", void 0);\nBlockExtension = __decorate([\n    Struct.type('block_extension')\n], BlockExtension);\nlet HeaderExtension = class HeaderExtension extends Struct {\n};\n__decorate([\n    Struct.field('uint16')\n], HeaderExtension.prototype, \"type\", void 0);\n__decorate([\n    Struct.field('bytes')\n], HeaderExtension.prototype, \"data\", void 0);\nHeaderExtension = __decorate([\n    Struct.type('header_extension')\n], HeaderExtension);\n// fc \"mutable variant\" returned by get_block api\nclass TrxVariant {\n    constructor(id, extra) {\n        this.id = id;\n        this.extra = extra;\n    }\n    static from(data) {\n        let id;\n        let extra;\n        if (typeof data === 'string') {\n            id = Checksum256.from(data);\n            extra = {};\n        }\n        else {\n            id = Checksum256.from(data.id);\n            extra = data;\n        }\n        return new this(id, extra);\n    }\n    get transaction() {\n        if (this.extra.packed_trx) {\n            return Serializer.decode({ data: this.extra.packed_trx, type: Transaction });\n        }\n    }\n    get signatures() {\n        if (this.extra.signatures) {\n            return this.extra.signatures.map(Signature.from);\n        }\n    }\n    equals(other) {\n        return this.id.equals(other.id);\n    }\n    toJSON() {\n        return this.id;\n    }\n}\nTrxVariant.abiName = 'trx_variant';\nlet GetBlockResponseTransactionReceipt = class GetBlockResponseTransactionReceipt extends TransactionReceipt {\n    get id() {\n        return this.trx.id;\n    }\n};\n__decorate([\n    Struct.field(TrxVariant)\n], GetBlockResponseTransactionReceipt.prototype, \"trx\", void 0);\nGetBlockResponseTransactionReceipt = __decorate([\n    Struct.type('get_block_response_receipt')\n], GetBlockResponseTransactionReceipt);\nlet GetBlockResponse = class GetBlockResponse extends Struct {\n};\n__decorate([\n    Struct.field('time_point')\n], GetBlockResponse.prototype, \"timestamp\", void 0);\n__decorate([\n    Struct.field('name')\n], GetBlockResponse.prototype, \"producer\", void 0);\n__decorate([\n    Struct.field('uint16')\n], GetBlockResponse.prototype, \"confirmed\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetBlockResponse.prototype, \"previous\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetBlockResponse.prototype, \"transaction_mroot\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetBlockResponse.prototype, \"action_mroot\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetBlockResponse.prototype, \"schedule_version\", void 0);\n__decorate([\n    Struct.field(NewProducers, { optional: true })\n], GetBlockResponse.prototype, \"new_producers\", void 0);\n__decorate([\n    Struct.field('header_extension', { optional: true })\n], GetBlockResponse.prototype, \"header_extensions\", void 0);\n__decorate([\n    Struct.field('any', { optional: true })\n], GetBlockResponse.prototype, \"new_protocol_features\", void 0);\n__decorate([\n    Struct.field('signature')\n], GetBlockResponse.prototype, \"producer_signature\", void 0);\n__decorate([\n    Struct.field(GetBlockResponseTransactionReceipt, { array: true })\n], GetBlockResponse.prototype, \"transactions\", void 0);\n__decorate([\n    Struct.field('block_extension', { optional: true })\n], GetBlockResponse.prototype, \"block_extensions\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetBlockResponse.prototype, \"id\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetBlockResponse.prototype, \"block_num\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetBlockResponse.prototype, \"ref_block_prefix\", void 0);\nGetBlockResponse = __decorate([\n    Struct.type('get_block_response')\n], GetBlockResponse);\nlet ActiveScheduleProducerAuthority = class ActiveScheduleProducerAuthority extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], ActiveScheduleProducerAuthority.prototype, \"producer_name\", void 0);\n__decorate([\n    Struct.field('any')\n], ActiveScheduleProducerAuthority.prototype, \"authority\", void 0);\nActiveScheduleProducerAuthority = __decorate([\n    Struct.type('active_schedule_producer_authority')\n], ActiveScheduleProducerAuthority);\nlet ActiveScheduleProducer = class ActiveScheduleProducer extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], ActiveScheduleProducer.prototype, \"producer_name\", void 0);\n__decorate([\n    Struct.field(ActiveScheduleProducerAuthority)\n], ActiveScheduleProducer.prototype, \"authority\", void 0);\nActiveScheduleProducer = __decorate([\n    Struct.type('active_schedule_producer')\n], ActiveScheduleProducer);\nlet ActiveSchedule = class ActiveSchedule extends Struct {\n};\n__decorate([\n    Struct.field('uint32')\n], ActiveSchedule.prototype, \"version\", void 0);\n__decorate([\n    Struct.field(ActiveScheduleProducer, { array: true })\n], ActiveSchedule.prototype, \"producers\", void 0);\nActiveSchedule = __decorate([\n    Struct.type('active_schedule')\n], ActiveSchedule);\nlet BlockStateHeader = class BlockStateHeader extends Struct {\n};\n__decorate([\n    Struct.field('time_point')\n], BlockStateHeader.prototype, \"timestamp\", void 0);\n__decorate([\n    Struct.field('name')\n], BlockStateHeader.prototype, \"producer\", void 0);\n__decorate([\n    Struct.field('uint16')\n], BlockStateHeader.prototype, \"confirmed\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], BlockStateHeader.prototype, \"previous\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], BlockStateHeader.prototype, \"transaction_mroot\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], BlockStateHeader.prototype, \"action_mroot\", void 0);\n__decorate([\n    Struct.field('uint32')\n], BlockStateHeader.prototype, \"schedule_version\", void 0);\n__decorate([\n    Struct.field(HeaderExtension, { array: true, optional: true })\n], BlockStateHeader.prototype, \"header_extensions\", void 0);\n__decorate([\n    Struct.field('signature')\n], BlockStateHeader.prototype, \"producer_signature\", void 0);\nBlockStateHeader = __decorate([\n    Struct.type('block_state_header')\n], BlockStateHeader);\nlet GetBlockHeaderStateResponse = class GetBlockHeaderStateResponse extends Struct {\n};\n__decorate([\n    Struct.field('uint32')\n], GetBlockHeaderStateResponse.prototype, \"block_num\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetBlockHeaderStateResponse.prototype, \"dpos_proposed_irreversible_blocknum\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetBlockHeaderStateResponse.prototype, \"dpos_irreversible_blocknum\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetBlockHeaderStateResponse.prototype, \"id\", void 0);\n__decorate([\n    Struct.field(BlockStateHeader)\n], GetBlockHeaderStateResponse.prototype, \"header\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"active_schedule\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"blockroot_merkle\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"producer_to_last_produced\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"producer_to_last_implied_irb\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"valid_block_signing_authority\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"confirm_count\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"pending_schedule\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"activated_protocol_features\", void 0);\n__decorate([\n    Struct.field('any')\n], GetBlockHeaderStateResponse.prototype, \"additional_signatures\", void 0);\nGetBlockHeaderStateResponse = __decorate([\n    Struct.type('get_block_header_state_response')\n], GetBlockHeaderStateResponse);\nlet GetInfoResponse = class GetInfoResponse extends Struct {\n    getTransactionHeader(secondsAhead = 120) {\n        const expiration = TimePointSec.fromMilliseconds(this.head_block_time.toMilliseconds() + secondsAhead * 1000);\n        const id = this.last_irreversible_block_id;\n        const prefixArray = id.array.subarray(8, 12);\n        const prefix = new Uint32Array(prefixArray.buffer, prefixArray.byteOffset, 1)[0];\n        return TransactionHeader.from({\n            expiration,\n            ref_block_num: Number(this.last_irreversible_block_num) & 0xffff,\n            ref_block_prefix: prefix,\n        });\n    }\n};\n__decorate([\n    Struct.field('string')\n], GetInfoResponse.prototype, \"server_version\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetInfoResponse.prototype, \"chain_id\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetInfoResponse.prototype, \"head_block_num\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetInfoResponse.prototype, \"last_irreversible_block_num\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetInfoResponse.prototype, \"last_irreversible_block_id\", void 0);\n__decorate([\n    Struct.field('checksum256')\n], GetInfoResponse.prototype, \"head_block_id\", void 0);\n__decorate([\n    Struct.field('time_point')\n], GetInfoResponse.prototype, \"head_block_time\", void 0);\n__decorate([\n    Struct.field('name')\n], GetInfoResponse.prototype, \"head_block_producer\", void 0);\n__decorate([\n    Struct.field('uint64')\n], GetInfoResponse.prototype, \"virtual_block_cpu_limit\", void 0);\n__decorate([\n    Struct.field('uint64')\n], GetInfoResponse.prototype, \"virtual_block_net_limit\", void 0);\n__decorate([\n    Struct.field('uint64')\n], GetInfoResponse.prototype, \"block_cpu_limit\", void 0);\n__decorate([\n    Struct.field('uint64')\n], GetInfoResponse.prototype, \"block_net_limit\", void 0);\n__decorate([\n    Struct.field('string?')\n], GetInfoResponse.prototype, \"server_version_string\", void 0);\n__decorate([\n    Struct.field('uint32?')\n], GetInfoResponse.prototype, \"fork_db_head_block_num\", void 0);\n__decorate([\n    Struct.field('checksum256?')\n], GetInfoResponse.prototype, \"fork_db_head_block_id\", void 0);\nGetInfoResponse = __decorate([\n    Struct.type('get_info_response')\n], GetInfoResponse);\nlet GetTableByScopeResponseRow = class GetTableByScopeResponseRow extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], GetTableByScopeResponseRow.prototype, \"code\", void 0);\n__decorate([\n    Struct.field('name')\n], GetTableByScopeResponseRow.prototype, \"scope\", void 0);\n__decorate([\n    Struct.field('name')\n], GetTableByScopeResponseRow.prototype, \"table\", void 0);\n__decorate([\n    Struct.field('name')\n], GetTableByScopeResponseRow.prototype, \"payer\", void 0);\n__decorate([\n    Struct.field('uint32')\n], GetTableByScopeResponseRow.prototype, \"count\", void 0);\nGetTableByScopeResponseRow = __decorate([\n    Struct.type('get_table_by_scope_response_row')\n], GetTableByScopeResponseRow);\nlet GetTableByScopeResponse = class GetTableByScopeResponse extends Struct {\n};\n__decorate([\n    Struct.field(GetTableByScopeResponseRow, { array: true })\n], GetTableByScopeResponse.prototype, \"rows\", void 0);\n__decorate([\n    Struct.field('string')\n], GetTableByScopeResponse.prototype, \"more\", void 0);\nGetTableByScopeResponse = __decorate([\n    Struct.type('get_table_by_scope_response')\n], GetTableByScopeResponse);\n\nvar types$1 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    get AccountPermission () { return AccountPermission; },\n    get AccountResourceLimit () { return AccountResourceLimit; },\n    get AccountTotalResources () { return AccountTotalResources; },\n    get AccountSelfDelegatedBandwidth () { return AccountSelfDelegatedBandwidth; },\n    get AccountRefundRequest () { return AccountRefundRequest; },\n    get AccountVoterInfo () { return AccountVoterInfo; },\n    get AccountRexInfoMaturities () { return AccountRexInfoMaturities; },\n    get AccountRexInfo () { return AccountRexInfo; },\n    get AccountObject () { return AccountObject; },\n    get NewProducersEntry () { return NewProducersEntry; },\n    get NewProducers () { return NewProducers; },\n    get BlockExtension () { return BlockExtension; },\n    get HeaderExtension () { return HeaderExtension; },\n    TrxVariant: TrxVariant,\n    get GetBlockResponseTransactionReceipt () { return GetBlockResponseTransactionReceipt; },\n    get GetBlockResponse () { return GetBlockResponse; },\n    get ActiveScheduleProducerAuthority () { return ActiveScheduleProducerAuthority; },\n    get ActiveScheduleProducer () { return ActiveScheduleProducer; },\n    get ActiveSchedule () { return ActiveSchedule; },\n    get BlockStateHeader () { return BlockStateHeader; },\n    get GetBlockHeaderStateResponse () { return GetBlockHeaderStateResponse; },\n    get GetInfoResponse () { return GetInfoResponse; },\n    get GetTableByScopeResponseRow () { return GetTableByScopeResponseRow; },\n    get GetTableByScopeResponse () { return GetTableByScopeResponse; }\n});\n\nclass ChainAPI {\n    constructor(client) {\n        this.client = client;\n    }\n    async get_abi(accountName) {\n        return this.client.call({\n            path: '/v1/chain/get_abi',\n            params: { account_name: Name.from(accountName) },\n        });\n    }\n    async get_account(accountName) {\n        return this.client.call({\n            path: '/v1/chain/get_account',\n            params: { account_name: Name.from(accountName) },\n            responseType: AccountObject,\n        });\n    }\n    async get_block(block_num_or_id) {\n        return this.client.call({\n            path: '/v1/chain/get_block',\n            params: { block_num_or_id },\n            responseType: GetBlockResponse,\n        });\n    }\n    async get_block_header_state(block_num_or_id) {\n        return this.client.call({\n            path: '/v1/chain/get_block_header_state',\n            params: { block_num_or_id },\n            responseType: GetBlockHeaderStateResponse,\n        });\n    }\n    async get_currency_balance(contract, accountName, symbol) {\n        const params = {\n            account: Name.from(accountName),\n            code: Name.from(contract),\n        };\n        if (symbol) {\n            params.symbol = symbol;\n        }\n        return this.client.call({\n            path: '/v1/chain/get_currency_balance',\n            params,\n            responseType: 'asset[]',\n        });\n    }\n    async get_info() {\n        return this.client.call({\n            path: '/v1/chain/get_info',\n            responseType: GetInfoResponse,\n        });\n    }\n    async push_transaction(tx) {\n        if (!isInstanceOf(tx, PackedTransaction)) {\n            tx = PackedTransaction.fromSigned(SignedTransaction.from(tx));\n        }\n        return this.client.call({\n            path: '/v1/chain/push_transaction',\n            params: tx,\n        });\n    }\n    async get_table_rows(params) {\n        const type = params.type;\n        let key_type = params.key_type;\n        const someBound = params.lower_bound || params.upper_bound;\n        if (!key_type && someBound) {\n            // determine key type from bounds type\n            if (isInstanceOf(someBound, UInt64)) {\n                key_type = 'i64';\n            }\n            else if (isInstanceOf(someBound, UInt128)) {\n                key_type = 'i128';\n            }\n            else if (isInstanceOf(someBound, Checksum256)) {\n                key_type = 'sha256';\n            }\n            else if (isInstanceOf(someBound, Checksum160)) {\n                key_type = 'ripemd160';\n            }\n        }\n        if (!key_type) {\n            key_type = 'name';\n        }\n        let json = params.json;\n        if (json === undefined) {\n            // if we know the row type don't ask the node to perform abi decoding\n            json = type === undefined;\n        }\n        let upper_bound = params.upper_bound;\n        if (upper_bound && typeof upper_bound !== 'string') {\n            upper_bound = String(upper_bound);\n        }\n        let lower_bound = params.lower_bound;\n        if (lower_bound && typeof lower_bound !== 'string') {\n            lower_bound = String(lower_bound);\n        }\n        let scope = params.scope;\n        if (typeof scope === 'undefined') {\n            scope = String(Name.from(params.code));\n        }\n        else if (typeof scope !== 'string') {\n            scope = String(scope);\n        }\n        // eslint-disable-next-line prefer-const\n        let { rows, more, next_key } = await this.client.call({\n            path: '/v1/chain/get_table_rows',\n            params: {\n                ...params,\n                code: Name.from(params.code),\n                table: Name.from(params.table),\n                limit: params.limit !== undefined ? UInt32.from(params.limit) : undefined,\n                scope,\n                key_type,\n                json,\n                upper_bound,\n                lower_bound,\n            },\n        });\n        let ram_payers;\n        if (params.show_payer) {\n            ram_payers = [];\n            rows = rows.map(({ data, payer }) => {\n                ram_payers.push(Name.from(payer));\n                return data;\n            });\n        }\n        if (type) {\n            if (json) {\n                rows = rows.map((value) => {\n                    if (typeof value === 'string' && Bytes.isBytes(value)) {\n                        // this handles the case where nodeos bails on abi decoding and just returns a hex string\n                        return Serializer.decode({ data: Bytes.from(value), type });\n                    }\n                    else {\n                        return Serializer.decode({ object: value, type });\n                    }\n                });\n            }\n            else {\n                rows = rows\n                    .map((hex) => Bytes.from(hex))\n                    .map((data) => Serializer.decode({ data, type }));\n            }\n        }\n        if (next_key && next_key.length > 0) {\n            let indexType;\n            // set index type so we can decode next_key in the response if present\n            switch (key_type) {\n                case 'i64':\n                    indexType = UInt64;\n                    break;\n                case 'i128':\n                    indexType = UInt128;\n                    break;\n                case 'name':\n                    indexType = Name;\n                    break;\n                case 'float64':\n                    indexType = Float64;\n                    break;\n                case 'float128':\n                    indexType = Float128;\n                    break;\n                case 'sha256':\n                    indexType = Checksum256;\n                    break;\n                case 'ripemd160':\n                    indexType = Checksum160;\n                    break;\n                default:\n                    throw new Error(`Unsupported key type: ${key_type}`);\n            }\n            if (indexType === Name) {\n                // names are sent back as an uint64 string instead of a name string..\n                next_key = Name.from(Serializer.decode({ object: next_key, type: UInt64 }));\n            }\n            else {\n                next_key = Serializer.decode({ object: next_key, type: indexType });\n            }\n        }\n        else {\n            next_key = undefined;\n        }\n        return { rows, more, next_key, ram_payers };\n    }\n    async get_table_by_scope(params) {\n        return this.client.call({\n            path: '/v1/chain/get_table_by_scope',\n            params,\n            responseType: GetTableByScopeResponse,\n        });\n    }\n}\n\nclass APIError extends Error {\n    constructor(path, error) {\n        super(`${APIError.formatError(error)} at ${path}`);\n        this.path = path;\n        this.error = error;\n    }\n    static formatError(error) {\n        if (error.what === 'unspecified' && error.details && error.details.length > 0) {\n            return error.details[0].message;\n        }\n        else if (error.what && error.what.length > 0) {\n            return error.what;\n        }\n        else {\n            return 'Unknown API error';\n        }\n    }\n    /** The nodeos error name, e.g. `tx_net_usage_exceeded` */\n    get name() {\n        return this.error.name || 'unspecified';\n    }\n    /** The nodeos error code, e.g. `3080002`. */\n    get code() {\n        return this.error.code || 0;\n    }\n    /** List of exceptions, if any. */\n    get details() {\n        return this.error.details;\n    }\n}\nAPIError.__className = 'APIError';\nclass APIClient {\n    constructor(options) {\n        this.v1 = {\n            chain: new ChainAPI(this),\n        };\n        if (options.provider) {\n            this.provider = options.provider;\n        }\n        else if (options.url) {\n            this.provider = new FetchProvider(options.url, options);\n        }\n        else {\n            throw new Error('Missing url or provider');\n        }\n    }\n    async call(args) {\n        const response = (await this.provider.call(args.path, args.params));\n        if (response.error) {\n            throw new APIError(args.path, response.error);\n        }\n        if (args.responseType) {\n            return abiDecode({ type: args.responseType, object: response });\n        }\n        return response;\n    }\n}\nAPIClient.__className = 'APIClient';\n\nvar types = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    v1: types$1\n});\n\nexport { ABI, ABIDecoder, ABIEncoder, types as API, APIClient, APIError, Action, Asset, Authority, Base58, BlockTimestamp, Bytes, Checksum160, Checksum256, Checksum512, CurveType, ExtendedAsset, FetchProvider, Float128, Float32, Float64, Int, Int128, Int16, Int32, Int64, Int8, Name, PackedTransaction, PermissionLevel, PrivateKey, PublicKey, Serializer, Signature, SignedTransaction, Struct, TimePoint, TimePointSec, Transaction, TransactionExtension, TransactionHeader, TransactionReceipt, TypeAlias, UInt128, UInt16, UInt32, UInt64, UInt8, VarInt, VarUInt, Variant, isInstanceOf };\n//# sourceMappingURL=eosio-core.m.js.map\n","/**\n * EOSIO Signing Request v2.2.2\n * https://github.com/greymass/eosio-signing-request\n *\n * @license\n * Copyright © 2021 Greymass Inc.\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the “Software”), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n * \n * YOU ACKNOWLEDGE THAT THIS SOFTWARE IS NOT DESIGNED, LICENSED OR\n * INTENDED FOR USE IN THE DESIGN, CONSTRUCTION, OPERATION OR\n * MAINTENANCE OF ANY MILITARY FACILITY.\n */\nimport { Checksum256, isInstanceOf, TypeAlias, UInt8, Variant, Name, Struct, PermissionLevel, Action, Transaction, Serializer, TimePointSec, Authority, Signature, Bytes, ABIEncoder, ABIDecoder, ABI, UInt16, UInt32 } from '@greymass/eosio';\nimport { __decorate } from 'tslib';\n\n/**\n * Base64u - URL-Safe Base64 variant no padding.\n * Based on https://gist.github.com/jonleighton/958841\n */\nconst baseCharset = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\nconst lookup = new Uint8Array(256);\nfor (let i = 0; i < 62; i++) {\n    lookup[baseCharset.charCodeAt(i)] = i;\n}\n// support both urlsafe and standard base64\nlookup[43] = lookup[45] = 62;\nlookup[47] = lookup[95] = 63;\nfunction encode(data, urlSafe = true) {\n    const byteLength = data.byteLength;\n    const byteRemainder = byteLength % 3;\n    const mainLength = byteLength - byteRemainder;\n    const charset = baseCharset + (urlSafe ? '-_' : '+/');\n    const parts = [];\n    let a;\n    let b;\n    let c;\n    let d;\n    let chunk;\n    // Main loop deals with bytes in chunks of 3\n    for (let i = 0; i < mainLength; i += 3) {\n        // Combine the three bytes into a single integer\n        chunk = (data[i] << 16) | (data[i + 1] << 8) | data[i + 2];\n        // Use bitmasks to extract 6-bit segments from the triplet\n        a = (chunk & 16515072) >> 18; // 16515072 = (2^6 - 1) << 18\n        b = (chunk & 258048) >> 12; // 258048   = (2^6 - 1) << 12\n        c = (chunk & 4032) >> 6; // 4032     = (2^6 - 1) << 6\n        d = chunk & 63; // 63       =  2^6 - 1\n        // Convert the raw binary segments to the appropriate ASCII encoding\n        parts.push(charset[a] + charset[b] + charset[c] + charset[d]);\n    }\n    // Deal with the remaining bytes\n    if (byteRemainder === 1) {\n        chunk = data[mainLength];\n        a = (chunk & 252) >> 2; // 252 = (2^6 - 1) << 2\n        // Set the 4 least significant bits to zero\n        b = (chunk & 3) << 4; // 3   = 2^2 - 1\n        parts.push(charset[a] + charset[b]);\n    }\n    else if (byteRemainder === 2) {\n        chunk = (data[mainLength] << 8) | data[mainLength + 1];\n        a = (chunk & 64512) >> 10; // 64512 = (2^6 - 1) << 10\n        b = (chunk & 1008) >> 4; // 1008  = (2^6 - 1) << 4\n        // Set the 2 least significant bits to zero\n        c = (chunk & 15) << 2; // 15    = 2^4 - 1\n        parts.push(charset[a] + charset[b] + charset[c]);\n    }\n    return parts.join('');\n}\nfunction decode(input) {\n    const byteLength = input.length * 0.75;\n    const data = new Uint8Array(byteLength);\n    let a;\n    let b;\n    let c;\n    let d;\n    let p = 0;\n    for (let i = 0; i < input.length; i += 4) {\n        a = lookup[input.charCodeAt(i)];\n        b = lookup[input.charCodeAt(i + 1)];\n        c = lookup[input.charCodeAt(i + 2)];\n        d = lookup[input.charCodeAt(i + 3)];\n        data[p++] = (a << 2) | (b >> 4);\n        data[p++] = ((b & 15) << 4) | (c >> 2);\n        data[p++] = ((c & 3) << 6) | (d & 63);\n    }\n    return data;\n}\n\nvar base64u = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode,\n    decode: decode\n});\n\n/** Chain ID aliases. */\nvar ChainName;\n(function (ChainName) {\n    ChainName[ChainName[\"UNKNOWN\"] = 0] = \"UNKNOWN\";\n    ChainName[ChainName[\"EOS\"] = 1] = \"EOS\";\n    ChainName[ChainName[\"TELOS\"] = 2] = \"TELOS\";\n    ChainName[ChainName[\"JUNGLE\"] = 3] = \"JUNGLE\";\n    ChainName[ChainName[\"KYLIN\"] = 4] = \"KYLIN\";\n    ChainName[ChainName[\"WORBLI\"] = 5] = \"WORBLI\";\n    ChainName[ChainName[\"BOS\"] = 6] = \"BOS\";\n    ChainName[ChainName[\"MEETONE\"] = 7] = \"MEETONE\";\n    ChainName[ChainName[\"INSIGHTS\"] = 8] = \"INSIGHTS\";\n    ChainName[ChainName[\"BEOS\"] = 9] = \"BEOS\";\n    ChainName[ChainName[\"WAX\"] = 10] = \"WAX\";\n    ChainName[ChainName[\"PROTON\"] = 11] = \"PROTON\";\n    ChainName[ChainName[\"FIO\"] = 12] = \"FIO\";\n})(ChainName || (ChainName = {}));\nlet ChainId = class ChainId extends Checksum256 {\n    static from(value) {\n        if (isInstanceOf(value, this)) {\n            return value;\n        }\n        if (typeof value === 'number') {\n            value = ChainIdLookup.get(value);\n            if (!value) {\n                throw new Error('Unknown chain id alias');\n            }\n        }\n        return super.from(value);\n    }\n    get chainVariant() {\n        const name = this.chainName;\n        if (name !== ChainName.UNKNOWN) {\n            return ChainIdVariant.from(['chain_alias', name]);\n        }\n        return ChainIdVariant.from(this);\n    }\n    get chainName() {\n        const cid = this.hexString;\n        for (const [n, id] of ChainIdLookup) {\n            if (id === cid) {\n                return n;\n            }\n        }\n        return ChainName.UNKNOWN;\n    }\n};\nChainId = __decorate([\n    TypeAlias('chain_id')\n], ChainId);\nlet ChainAlias = class ChainAlias extends UInt8 {\n};\nChainAlias = __decorate([\n    TypeAlias('chain_alias')\n], ChainAlias);\nlet ChainIdVariant = class ChainIdVariant extends Variant {\n    get chainId() {\n        if (isInstanceOf(this.value, ChainId)) {\n            return this.value;\n        }\n        return ChainId.from(Number(this.value.value));\n    }\n};\nChainIdVariant = __decorate([\n    Variant.type('variant_id', [ChainAlias, ChainId])\n], ChainIdVariant);\nconst ChainIdLookup = new Map([\n    [ChainName.EOS, 'aca376f206b8fc25a6ed44dbdc66547c36c6c33e3a119ffbeaef943642f0e906'],\n    [ChainName.TELOS, '4667b205c6838ef70ff7988f6e8257e8be0e1284a2f59699054a018f743b1d11'],\n    [ChainName.JUNGLE, 'e70aaab8997e1dfce58fbfac80cbbb8fecec7b99cf982a9444273cbc64c41473'],\n    [ChainName.KYLIN, '5fff1dae8dc8e2fc4d5b23b2c7665c97f9e9d8edf2b6485a86ba311c25639191'],\n    [ChainName.WORBLI, '73647cde120091e0a4b85bced2f3cfdb3041e266cbbe95cee59b73235a1b3b6f'],\n    [ChainName.BOS, 'd5a3d18fbb3c084e3b1f3fa98c21014b5f3db536cc15d08f9f6479517c6a3d86'],\n    [ChainName.MEETONE, 'cfe6486a83bad4962f232d48003b1824ab5665c36778141034d75e57b956e422'],\n    [ChainName.INSIGHTS, 'b042025541e25a472bffde2d62edd457b7e70cee943412b1ea0f044f88591664'],\n    [ChainName.BEOS, 'b912d19a6abd2b1b05611ae5be473355d64d95aeff0c09bedc8c166cd6468fe4'],\n    [ChainName.WAX, '1064487b3cd1a897ce03ae5b6a865651747e2e152090f99c1d19d44e01aea5a4'],\n    [ChainName.PROTON, '384da888112027f0321850a169f737c33e53b388aad48b5adace4bab97f437e0'],\n    [ChainName.FIO, '21dcae42c0182200e93f954a074011f9048a7624c6fe81d3c9541a614a88bd1c'],\n]);\n\n/** SigningRequest ABI and typedefs. */\nvar RequestFlags_1;\nlet AccountName = class AccountName extends Name {\n};\nAccountName = __decorate([\n    TypeAlias('account_name')\n], AccountName);\nlet PermissionName = class PermissionName extends Name {\n};\nPermissionName = __decorate([\n    TypeAlias('permission_name')\n], PermissionName);\nlet IdentityV2 = class IdentityV2 extends Struct {\n};\n__decorate([\n    Struct.field(PermissionLevel, { optional: true })\n], IdentityV2.prototype, \"permission\", void 0);\nIdentityV2 = __decorate([\n    Struct.type('identity')\n], IdentityV2);\nlet IdentityV3 = class IdentityV3 extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], IdentityV3.prototype, \"scope\", void 0);\n__decorate([\n    Struct.field(PermissionLevel, { optional: true })\n], IdentityV3.prototype, \"permission\", void 0);\nIdentityV3 = __decorate([\n    Struct.type('identity')\n], IdentityV3);\nlet RequestVariantV2 = class RequestVariantV2 extends Variant {\n};\nRequestVariantV2 = __decorate([\n    Variant.type('variant_req', [Action, { type: Action, array: true }, Transaction, IdentityV2])\n], RequestVariantV2);\nlet RequestVariantV3 = class RequestVariantV3 extends Variant {\n};\nRequestVariantV3 = __decorate([\n    Variant.type('variant_req', [Action, { type: Action, array: true }, Transaction, IdentityV3])\n], RequestVariantV3);\nlet RequestFlags = RequestFlags_1 = class RequestFlags extends UInt8 {\n    get broadcast() {\n        return (Number(this) & RequestFlags_1.broadcast) !== 0;\n    }\n    set broadcast(enabled) {\n        this.setFlag(RequestFlags_1.broadcast, enabled);\n    }\n    get background() {\n        return (Number(this) & RequestFlags_1.background) !== 0;\n    }\n    set background(enabled) {\n        this.setFlag(RequestFlags_1.background, enabled);\n    }\n    setFlag(flag, enabled) {\n        if (enabled) {\n            // TODO: implement bitwise operators in core, bn.js setbit does not work\n            this.value = UInt8.from(Number(this) | flag).value;\n        }\n        else {\n            this.value.imaskn(flag);\n        }\n    }\n};\nRequestFlags.broadcast = 1 << 0;\nRequestFlags.background = 1 << 1;\nRequestFlags = RequestFlags_1 = __decorate([\n    TypeAlias('request_flags')\n], RequestFlags);\nlet InfoPair = class InfoPair extends Struct {\n};\n__decorate([\n    Struct.field('string')\n], InfoPair.prototype, \"key\", void 0);\n__decorate([\n    Struct.field('bytes')\n], InfoPair.prototype, \"value\", void 0);\nInfoPair = __decorate([\n    Struct.type('info_pair')\n], InfoPair);\nlet RequestDataV2 = class RequestDataV2 extends Struct {\n};\n__decorate([\n    Struct.field(ChainIdVariant)\n], RequestDataV2.prototype, \"chain_id\", void 0);\n__decorate([\n    Struct.field(RequestVariantV2)\n], RequestDataV2.prototype, \"req\", void 0);\n__decorate([\n    Struct.field(RequestFlags)\n], RequestDataV2.prototype, \"flags\", void 0);\n__decorate([\n    Struct.field('string')\n], RequestDataV2.prototype, \"callback\", void 0);\n__decorate([\n    Struct.field(InfoPair, { array: true })\n], RequestDataV2.prototype, \"info\", void 0);\nRequestDataV2 = __decorate([\n    Struct.type('signing_request')\n], RequestDataV2);\nlet RequestDataV3 = class RequestDataV3 extends Struct {\n};\n__decorate([\n    Struct.field(ChainIdVariant)\n], RequestDataV3.prototype, \"chain_id\", void 0);\n__decorate([\n    Struct.field(RequestVariantV3)\n], RequestDataV3.prototype, \"req\", void 0);\n__decorate([\n    Struct.field(RequestFlags)\n], RequestDataV3.prototype, \"flags\", void 0);\n__decorate([\n    Struct.field('string')\n], RequestDataV3.prototype, \"callback\", void 0);\n__decorate([\n    Struct.field(InfoPair, { array: true })\n], RequestDataV3.prototype, \"info\", void 0);\nRequestDataV3 = __decorate([\n    Struct.type('signing_request')\n], RequestDataV3);\nlet RequestSignature = class RequestSignature extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], RequestSignature.prototype, \"signer\", void 0);\n__decorate([\n    Struct.field('signature')\n], RequestSignature.prototype, \"signature\", void 0);\nRequestSignature = __decorate([\n    Struct.type('request_signature')\n], RequestSignature);\n\nvar IdentityProof_1;\nlet IdentityProof = IdentityProof_1 = class IdentityProof extends Struct {\n    static from(value) {\n        if (isInstanceOf(value, IdentityProof_1)) {\n            return value;\n        }\n        else if (typeof value === 'string') {\n            return IdentityProof_1.fromString(value);\n        }\n        else {\n            return super.from(value);\n        }\n    }\n    /**\n     * Create a new instance from an EOSIO authorization header string.\n     * \"EOSIO <base64payload>\"\n     */\n    static fromString(string) {\n        const parts = string.split(' ');\n        if (parts.length !== 2 || parts[0] !== 'EOSIO') {\n            throw new Error('Invalid IdentityProof string');\n        }\n        const data = decode(parts[1]);\n        return Serializer.decode({ data, type: IdentityProof_1 });\n    }\n    /** Create a new instance from a callback payload. */\n    static fromPayload(payload, options = {}) {\n        const request = SigningRequest.from(payload.req, options);\n        if (!(request.version >= 3 && request.isIdentity())) {\n            throw new Error('Not an identity request');\n        }\n        return this.from({\n            chainId: payload.cid || request.getChainId(),\n            scope: request.getIdentityScope(),\n            expiration: payload.ex,\n            signer: { actor: payload.sa, permission: payload.sp },\n            signature: payload.sig,\n        });\n    }\n    /**\n     * Transaction this proof resolves to.\n     * @internal\n     */\n    get transaction() {\n        const action = Action.from({\n            account: '',\n            name: 'identity',\n            authorization: [this.signer],\n            data: IdentityV3.from({ scope: this.scope, permission: this.signer }),\n        });\n        return Transaction.from({\n            ref_block_num: 0,\n            ref_block_prefix: 0,\n            expiration: this.expiration,\n            actions: [action],\n        });\n    }\n    /**\n     * Recover the public key that signed this proof.\n     */\n    recover() {\n        return this.signature.recoverDigest(this.transaction.signingDigest(this.chainId));\n    }\n    /**\n     * Verify that given authority signed this proof.\n     * @param auth The accounts signing authority.\n     * @param currentTime Time to verify expiry against, if unset will use system time.\n     */\n    verify(auth, currentTime) {\n        const now = TimePointSec.from(currentTime || new Date()).toMilliseconds();\n        return (now < this.expiration.toMilliseconds() &&\n            Authority.from(auth).hasPermission(this.recover()));\n    }\n    /**\n     * Encode the proof to an `EOSIO` auth header string.\n     */\n    toString() {\n        const data = Serializer.encode({ object: this });\n        return `EOSIO ${encode(data.array, false)}`;\n    }\n};\n__decorate([\n    Struct.field(ChainId)\n], IdentityProof.prototype, \"chainId\", void 0);\n__decorate([\n    Struct.field(Name)\n], IdentityProof.prototype, \"scope\", void 0);\n__decorate([\n    Struct.field(TimePointSec)\n], IdentityProof.prototype, \"expiration\", void 0);\n__decorate([\n    Struct.field(PermissionLevel)\n], IdentityProof.prototype, \"signer\", void 0);\n__decorate([\n    Struct.field(Signature)\n], IdentityProof.prototype, \"signature\", void 0);\nIdentityProof = IdentityProof_1 = __decorate([\n    Struct.type('identity_proof')\n], IdentityProof);\n\n/**\n * EOSIO Signing Request (ESR).\n */\n/** Current supported protocol version, backwards compatible with version 2. */\nconst ProtocolVersion = 3;\n/**\n * The placeholder name: `............1` aka `uint64(1)`.\n * If used in action data will be resolved to current signer.\n * If used in as an authorization permission will be resolved to\n * the signers permission level.\n *\n * Example action:\n * ```\n * { account: \"eosio.token\",\n *   name: \"transfer\",\n *   authorization: [{actor: \"............1\", permission: \"............1\"}],\n *   data: {\n *     from: \"............1\",\n *     to: \"bar\",\n *     quantity: \"42.0000 EOS\",\n *     memo: \"Don't panic\" }}\n * ```\n * When signed by `foo@active` would resolve to:\n * ```\n * { account: \"eosio.token\",\n *   name: \"transfer\",\n *   authorization: [{actor: \"foo\", permission: \"active\"}],\n *   data: {\n *     from: \"foo\",\n *     to: \"bar\",\n *     quantity: \"42.0000 EOS\",\n *     memo: \"Don't panic\" }}\n * ```\n */\nconst PlaceholderName = Name.from('............1'); // aka uint64(1)\n/** Placeholder that will resolve to signer permission name. */\nconst PlaceholderPermission = Name.from('............2'); // aka uint64(2)\nconst PlaceholderAuth = PermissionLevel.from({\n    actor: PlaceholderName,\n    permission: PlaceholderPermission,\n});\nclass SigningRequest {\n    /**\n     * Create a new signing request.\n     * Normally not used directly, see the `create` and `from` class methods.\n     */\n    constructor(version, data, zlib, abiProvider, signature) {\n        if (data.flags.broadcast && data.req.variantName === 'identity') {\n            throw new Error('Invalid request (identity request cannot be broadcast)');\n        }\n        this.version = version;\n        this.data = data;\n        this.zlib = zlib;\n        this.abiProvider = abiProvider;\n        this.signature = signature;\n    }\n    /** Return the identity ABI for given version. */\n    static identityAbi(version) {\n        const abi = Serializer.synthesize(this.identityType(version));\n        abi.actions = [{ name: 'identity', type: 'identity', ricardian_contract: '' }];\n        return abi;\n    }\n    /** Return the ABISerializableType identity type for given version. */\n    static identityType(version) {\n        return version === 2 ? IdentityV2 : IdentityV3;\n    }\n    /** Return the ABISerializableType storage type for given version. */\n    static storageType(version) {\n        return version === 2 ? RequestDataV2 : RequestDataV3;\n    }\n    /** Create a new signing request. */\n    static async create(args, options = {}) {\n        let actions;\n        if (args.action) {\n            actions = [args.action];\n        }\n        else if (args.actions) {\n            actions = args.actions;\n        }\n        else if (args.transaction) {\n            actions = args.transaction.actions || [];\n        }\n        else {\n            actions = [];\n        }\n        const requiredAbis = actions\n            .filter((action) => !Bytes.isBytes(action.data) &&\n            action.data.constructor.abiName === undefined)\n            .map((action) => Name.from(action.account));\n        const abis = {};\n        if (requiredAbis.length > 0) {\n            const provider = options.abiProvider;\n            if (!provider) {\n                throw new Error('Missing abi provider');\n            }\n            const accountAbis = await Promise.all(requiredAbis.map((account) => provider.getAbi(account)));\n            for (const [idx, abi] of accountAbis.entries()) {\n                abis[requiredAbis[idx].toString()] = abi;\n            }\n        }\n        return this.createSync(args, options, abis);\n    }\n    /**\n     * Synchronously create a new signing request.\n     * @throws If an un-encoded action with no abi def is encountered.\n     */\n    static createSync(args, options = {}, abis = {}) {\n        let version = 2;\n        const data = {};\n        const encode = (action) => encodeAction(action, abis);\n        // multi-chain requests requires version 3\n        if (args.chainId === null) {\n            version = 3;\n        }\n        // set the request data\n        if (args.identity !== undefined) {\n            if (args.identity.scope) {\n                version = 3;\n            }\n            data.req = ['identity', this.identityType(version).from(args.identity)];\n        }\n        else if (args.action && !args.actions && !args.transaction) {\n            data.req = ['action', encode(args.action)];\n        }\n        else if (args.actions && !args.action && !args.transaction) {\n            if (args.actions.length === 1) {\n                data.req = ['action', encode(args.actions[0])];\n            }\n            else {\n                data.req = ['action[]', args.actions.map(encode)];\n            }\n        }\n        else if (args.transaction && !args.action && !args.actions) {\n            const tx = args.transaction;\n            // set default values if missing\n            if (tx.expiration === undefined) {\n                tx.expiration = '1970-01-01T00:00:00.000';\n            }\n            if (tx.ref_block_num === undefined) {\n                tx.ref_block_num = 0;\n            }\n            if (tx.ref_block_prefix === undefined) {\n                tx.ref_block_prefix = 0;\n            }\n            if (tx.context_free_actions === undefined) {\n                tx.context_free_actions = [];\n            }\n            if (tx.transaction_extensions === undefined) {\n                tx.transaction_extensions = [];\n            }\n            if (tx.delay_sec === undefined) {\n                tx.delay_sec = 0;\n            }\n            if (tx.max_cpu_usage_ms === undefined) {\n                tx.max_cpu_usage_ms = 0;\n            }\n            if (tx.max_net_usage_words === undefined) {\n                tx.max_net_usage_words = 0;\n            }\n            if (tx.actions === undefined) {\n                tx.actions = [];\n            }\n            if (tx.context_free_actions === undefined) {\n                tx.context_free_actions = [];\n            }\n            // encode actions if needed\n            tx.actions = tx.actions.map(encode);\n            data.req = ['transaction', tx];\n        }\n        else {\n            throw new TypeError('Invalid arguments: Must have exactly one of action, actions or transaction');\n        }\n        // set the chain id\n        if (args.chainId === null) {\n            data.chain_id = ChainIdVariant.from(['chain_alias', 0]);\n        }\n        else {\n            data.chain_id = ChainId.from(args.chainId || ChainName.EOS).chainVariant;\n        }\n        // request flags and callback\n        const flags = RequestFlags.from(0);\n        let callback = '';\n        flags.broadcast = args.broadcast !== undefined ? args.broadcast : data.req[0] !== 'identity';\n        if (typeof args.callback === 'string') {\n            callback = args.callback;\n        }\n        else if (typeof args.callback === 'object') {\n            callback = args.callback.url;\n            flags.background = args.callback.background || false;\n        }\n        data.flags = flags;\n        data.callback = callback;\n        // info pairs\n        data.info = [];\n        if (typeof args.info === 'object') {\n            for (const key in args.info) {\n                const isOwn = Object.prototype.hasOwnProperty.call(args.info, key);\n                if (isOwn) {\n                    let value = args.info[key];\n                    if (typeof value === 'string') {\n                        value = Bytes.from(value, 'utf8');\n                    }\n                    else if (!(value instanceof Bytes)) {\n                        value = Serializer.encode({ object: value });\n                    }\n                    data.info.push({ key, value });\n                }\n            }\n        }\n        if (args.chainIds && args.chainId === null) {\n            const ids = args.chainIds.map((id) => ChainId.from(id).chainVariant);\n            data.info.push({\n                key: 'chain_ids',\n                value: Serializer.encode({ object: ids, type: { type: ChainIdVariant, array: true } }),\n            });\n        }\n        const req = new SigningRequest(version, this.storageType(version).from(data), options.zlib, options.abiProvider);\n        // sign the request if given a signature provider\n        if (options.signatureProvider) {\n            req.sign(options.signatureProvider);\n        }\n        return req;\n    }\n    /** Creates an identity request. */\n    static identity(args, options = {}) {\n        let permission = {\n            actor: args.account || PlaceholderName,\n            permission: args.permission || PlaceholderPermission,\n        };\n        if (permission.actor === PlaceholderName &&\n            permission.permission === PlaceholderPermission) {\n            permission = undefined;\n        }\n        return this.createSync({\n            ...args,\n            identity: {\n                permission,\n                scope: args.scope,\n            },\n            broadcast: false,\n        }, options);\n    }\n    /**\n     * Create a request from a chain id and serialized transaction.\n     * @param chainId The chain id where the transaction is valid.\n     * @param serializedTransaction The serialized transaction.\n     * @param options Creation options.\n     */\n    static fromTransaction(chainId, serializedTransaction, options = {}) {\n        const id = ChainId.from(chainId);\n        serializedTransaction = Bytes.from(serializedTransaction);\n        const encoder = new ABIEncoder();\n        encoder.writeByte(2); // header\n        encoder.writeArray(Serializer.encode({ object: id.chainVariant }).array);\n        encoder.writeByte(2); // transaction variant\n        encoder.writeArray(Bytes.from(serializedTransaction).array);\n        encoder.writeByte(RequestFlags.broadcast);\n        encoder.writeByte(0); // callback\n        encoder.writeByte(0); // info\n        return SigningRequest.fromData(encoder.getData(), options);\n    }\n    /** Creates a signing request from encoded `esr:` uri string. */\n    static from(uri, options = {}) {\n        if (typeof uri !== 'string') {\n            throw new Error('Invalid request uri');\n        }\n        const [scheme, path] = uri.split(':');\n        if (scheme !== 'esr' && scheme !== 'web+esr') {\n            throw new Error('Invalid scheme');\n        }\n        const data = decode(path.startsWith('//') ? path.slice(2) : path);\n        return SigningRequest.fromData(data, options);\n    }\n    static fromData(data, options = {}) {\n        data = Bytes.from(data);\n        const header = data.array[0];\n        const version = header & ~(1 << 7);\n        if (version !== 2 && version !== 3) {\n            throw new Error('Unsupported protocol version');\n        }\n        let payload = data.droppingFirst(1);\n        if ((header & (1 << 7)) !== 0) {\n            if (!options.zlib) {\n                throw new Error('Compressed URI needs zlib');\n            }\n            payload = Bytes.from(options.zlib.inflateRaw(payload.array));\n        }\n        const decoder = new ABIDecoder(payload.array);\n        const req = Serializer.decode({ data: decoder, type: this.storageType(version) });\n        let sig;\n        if (decoder.canRead()) {\n            sig = Serializer.decode({ data: decoder, type: RequestSignature });\n        }\n        return new SigningRequest(version, req, options.zlib, options.abiProvider, sig);\n    }\n    /**\n     * Sign the request, mutating.\n     * @param signatureProvider The signature provider that provides a signature for the signer.\n     */\n    sign(signatureProvider) {\n        const message = this.getSignatureDigest();\n        this.signature = RequestSignature.from(signatureProvider.sign(message));\n    }\n    /**\n     * Get the signature digest for this request.\n     */\n    getSignatureDigest() {\n        // protocol version + utf8 \"request\"\n        const prefix = [this.version, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74];\n        return Checksum256.hash(Bytes.from(prefix).appending(this.getData()));\n    }\n    /**\n     * Set the signature data for this request, mutating.\n     * @param signer Account name of signer.\n     * @param signature The signature string.\n     */\n    setSignature(signer, signature) {\n        this.signature = RequestSignature.from({ signer, signature });\n    }\n    /**\n     * Set the request callback, mutating.\n     * @param url Where the callback should be sent.\n     * @param background Whether the callback should be sent in the background.\n     */\n    setCallback(url, background) {\n        this.data.callback = url;\n        this.data.flags.background = background;\n    }\n    /**\n     * Set broadcast flag.\n     * @param broadcast Whether the transaction should be broadcast by receiver.\n     */\n    setBroadcast(broadcast) {\n        this.data.flags.broadcast = broadcast;\n    }\n    /**\n     * Encode this request into an `esr:` uri.\n     * @argument compress Whether to compress the request data using zlib,\n     *                    defaults to true if omitted and zlib is present;\n     *                    otherwise false.\n     * @argument slashes Whether add slashes after the protocol scheme, i.e. `esr://`.\n     *                   Defaults to true.\n     * @returns An esr uri string.\n     */\n    encode(compress, slashes) {\n        const shouldCompress = compress !== undefined ? compress : this.zlib !== undefined;\n        if (shouldCompress && this.zlib === undefined) {\n            throw new Error('Need zlib to compress');\n        }\n        let header = this.version;\n        const data = this.getData();\n        const sigData = this.getSignatureData();\n        let array = new Uint8Array(data.byteLength + sigData.byteLength);\n        array.set(data, 0);\n        array.set(sigData, data.byteLength);\n        if (shouldCompress) {\n            const deflated = this.zlib.deflateRaw(array);\n            if (array.byteLength > deflated.byteLength) {\n                header |= 1 << 7;\n                array = deflated;\n            }\n        }\n        const out = new Uint8Array(1 + array.byteLength);\n        out[0] = header;\n        out.set(array, 1);\n        let scheme = 'esr:';\n        if (slashes !== false) {\n            scheme += '//';\n        }\n        return scheme + encode(out);\n    }\n    /** Get the request data without header or signature. */\n    getData() {\n        return Serializer.encode({ object: this.data }).array;\n    }\n    /** Get signature data, returns an empty array if request is not signed. */\n    getSignatureData() {\n        if (!this.signature) {\n            return new Uint8Array(0);\n        }\n        return Serializer.encode({ object: this.signature }).array;\n    }\n    /** ABI definitions required to resolve request. */\n    getRequiredAbis() {\n        return this.getRawActions()\n            .filter((action) => !isIdentity(action))\n            .map((action) => action.account)\n            .filter((value, index, self) => self.indexOf(value) === index);\n    }\n    /** Whether TaPoS values are required to resolve request. */\n    requiresTapos() {\n        const tx = this.getRawTransaction();\n        return !this.isIdentity() && !hasTapos(tx);\n    }\n    /** Resolve required ABI definitions. */\n    async fetchAbis(abiProvider) {\n        const required = this.getRequiredAbis();\n        if (required.length > 0) {\n            const provider = abiProvider || this.abiProvider;\n            if (!provider) {\n                throw new Error('Missing ABI provider');\n            }\n            const abis = new Map();\n            await Promise.all(required.map(async (account) => {\n                abis.set(account.toString(), ABI.from(await provider.getAbi(account)));\n            }));\n            return abis;\n        }\n        else {\n            return new Map();\n        }\n    }\n    /**\n     * Decode raw actions actions to object representations.\n     * @param abis ABI defenitions required to decode all actions.\n     * @param signer Placeholders in actions will be resolved to signer if set.\n     */\n    resolveActions(abis, signer) {\n        return this.getRawActions().map((rawAction) => {\n            let abi;\n            if (isIdentity(rawAction)) {\n                abi = this.constructor.identityAbi(this.version);\n            }\n            else {\n                const rawAbi = abis.get(rawAction.account.toString());\n                if (!rawAbi) {\n                    throw new Error(`Missing ABI definition for ${rawAction.account}`);\n                }\n                abi = ABI.from(rawAbi);\n            }\n            const type = abi.getActionType(rawAction.name);\n            if (!type) {\n                throw new Error(`Missing type for action ${rawAction.account}:${rawAction.name} in ABI`);\n            }\n            let data = rawAction.decodeData(abi);\n            let authorization = rawAction.authorization;\n            if (signer) {\n                const signerPerm = PermissionLevel.from(signer);\n                const resolve = (value) => {\n                    if (value instanceof Name) {\n                        if (value.equals(PlaceholderName)) {\n                            return signerPerm.actor;\n                        }\n                        else if (value.equals(PlaceholderPermission)) {\n                            return signerPerm.permission;\n                        }\n                        else {\n                            return value;\n                        }\n                    }\n                    else if (Array.isArray(value)) {\n                        return value.map(resolve);\n                    }\n                    else if (typeof value === 'object' && value !== null) {\n                        for (const key of Object.keys(value)) {\n                            value[key] = resolve(value[key]);\n                        }\n                        return value;\n                    }\n                    else {\n                        return value;\n                    }\n                };\n                data = resolve(data);\n                authorization = authorization.map((auth) => {\n                    let { actor, permission } = auth;\n                    if (actor.equals(PlaceholderName)) {\n                        actor = signerPerm.actor;\n                    }\n                    if (permission.equals(PlaceholderPermission)) {\n                        permission = signerPerm.permission;\n                    }\n                    // backwards compatibility, actor placeholder will also resolve to permission when used in auth\n                    if (permission.equals(PlaceholderName)) {\n                        permission = signerPerm.permission;\n                    }\n                    return PermissionLevel.from({ actor, permission });\n                });\n            }\n            return {\n                ...rawAction,\n                authorization,\n                data,\n            };\n        });\n    }\n    resolveTransaction(abis, signer, ctx = {}) {\n        const tx = this.getRawTransaction();\n        if (!this.isIdentity() && !hasTapos(tx)) {\n            if (ctx.expiration !== undefined &&\n                ctx.ref_block_num !== undefined &&\n                ctx.ref_block_prefix !== undefined) {\n                tx.expiration = TimePointSec.from(ctx.expiration);\n                tx.ref_block_num = UInt16.from(ctx.ref_block_num);\n                tx.ref_block_prefix = UInt32.from(ctx.ref_block_prefix);\n            }\n            else if (ctx.block_num !== undefined &&\n                ctx.ref_block_prefix !== undefined &&\n                ctx.timestamp !== undefined) {\n                tx.expiration = expirationTime(ctx.timestamp, ctx.expire_seconds);\n                tx.ref_block_num = UInt16.from(ctx.block_num);\n                tx.ref_block_prefix = UInt32.from(ctx.ref_block_prefix);\n            }\n            else {\n                throw new Error('Invalid transaction context, need either a reference block or explicit TaPoS values');\n            }\n        }\n        else if (this.isIdentity() && this.version > 2) {\n            // From ESR version 3 all identity requests have expiration\n            tx.expiration = ctx.expiration\n                ? TimePointSec.from(ctx.expiration)\n                : expirationTime(ctx.timestamp, ctx.expire_seconds);\n        }\n        const actions = this.resolveActions(abis, signer);\n        // TODO: resolve context free actions\n        const context_free_actions = tx.context_free_actions;\n        return { ...tx, context_free_actions, actions };\n    }\n    resolve(abis, signer, ctx = {}) {\n        const tx = this.resolveTransaction(abis, signer, ctx);\n        const actions = tx.actions.map((action) => {\n            let abi;\n            if (isIdentity(action)) {\n                abi = this.constructor.identityAbi(this.version);\n            }\n            else {\n                abi = abis.get(action.account.toString());\n            }\n            if (!abi) {\n                throw new Error(`Missing ABI definition for ${action.account}`);\n            }\n            const type = abi.getActionType(action.name);\n            const data = Serializer.encode({ object: action.data, type, abi });\n            return Action.from({ ...action, data });\n        });\n        const transaction = Transaction.from({ ...tx, actions });\n        let chainId;\n        if (this.isMultiChain()) {\n            if (!ctx.chainId) {\n                throw new Error('Missing chosen chain ID for multi-chain request');\n            }\n            chainId = ChainId.from(ctx.chainId);\n            const ids = this.getChainIds();\n            if (ids && !ids.some((id) => chainId.equals(id))) {\n                throw new Error('Trying to resolve for chain ID not defined in request');\n            }\n        }\n        else {\n            chainId = this.getChainId();\n        }\n        return new ResolvedSigningRequest(this, PermissionLevel.from(signer), transaction, tx, chainId);\n    }\n    /**\n     * Get the id of the chain where this request is valid.\n     * @returns The 32-byte chain id as hex encoded string.\n     */\n    getChainId() {\n        return this.data.chain_id.chainId;\n    }\n    /**\n     * Chain IDs this request is valid for, only valid for multi chain requests. Value of `null` when `isMultiChain` is true denotes any chain.\n     */\n    getChainIds() {\n        if (!this.isMultiChain()) {\n            return null;\n        }\n        const ids = this.getInfoKey('chain_ids', { type: ChainIdVariant, array: true });\n        if (ids) {\n            return ids.map((id) => id.chainId);\n        }\n        return null;\n    }\n    /**\n     * Set chain IDs this request is valid for, only considered for multi chain requests.\n     */\n    setChainIds(ids) {\n        const value = ids.map((id) => ChainId.from(id).chainVariant);\n        this.setInfoKey('chain_ids', value, { type: ChainIdVariant, array: true });\n    }\n    /**\n     * True if chainId is set to chain alias `0` which indicates that the request is valid for any chain.\n     */\n    isMultiChain() {\n        return (this.data.chain_id.variantIdx === 0 &&\n            this.data.chain_id.value.equals(ChainName.UNKNOWN));\n    }\n    /** Return the actions in this request with action data encoded. */\n    getRawActions() {\n        const req = this.data.req;\n        switch (req.variantName) {\n            case 'action':\n                return [req.value];\n            case 'action[]':\n                return req.value;\n            case 'identity': {\n                if (this.version === 2) {\n                    const id = req.value;\n                    let data = '0101000000000000000200000000000000'; // placeholder permission\n                    let authorization = [PlaceholderAuth];\n                    if (id.permission) {\n                        data = Serializer.encode({ object: id });\n                        authorization = [id.permission];\n                    }\n                    return [\n                        Action.from({\n                            account: '',\n                            name: 'identity',\n                            authorization,\n                            data,\n                        }),\n                    ];\n                }\n                else {\n                    // eslint-disable-next-line prefer-const\n                    let { scope, permission } = req.value;\n                    if (!permission) {\n                        permission = PlaceholderAuth;\n                    }\n                    const data = Serializer.encode({ object: { scope, permission }, type: IdentityV3 });\n                    return [\n                        Action.from({\n                            account: '',\n                            name: 'identity',\n                            authorization: [permission],\n                            data,\n                        }),\n                    ];\n                }\n            }\n            case 'transaction':\n                return req.value.actions;\n            default:\n                throw new Error('Invalid signing request data');\n        }\n    }\n    /** Unresolved transaction. */\n    getRawTransaction() {\n        const req = this.data.req;\n        switch (req.variantName) {\n            case 'transaction':\n                return Transaction.from({ ...req.value });\n            case 'action':\n            case 'action[]':\n            case 'identity':\n                return Transaction.from({\n                    actions: this.getRawActions(),\n                    context_free_actions: [],\n                    transaction_extensions: [],\n                    expiration: '1970-01-01T00:00:00.000',\n                    ref_block_num: 0,\n                    ref_block_prefix: 0,\n                    max_cpu_usage_ms: 0,\n                    max_net_usage_words: 0,\n                    delay_sec: 0,\n                });\n            default:\n                throw new Error('Invalid signing request data');\n        }\n    }\n    /** Whether the request is an identity request. */\n    isIdentity() {\n        return this.data.req.variantName === 'identity';\n    }\n    /** Whether the request should be broadcast by signer. */\n    shouldBroadcast() {\n        if (this.isIdentity()) {\n            return false;\n        }\n        return this.data.flags.broadcast;\n    }\n    /**\n     * Present if the request is an identity request and requests a specific account.\n     * @note This returns `nil` unless a specific identity has been requested,\n     *       use `isIdentity` to check id requests.\n     */\n    getIdentity() {\n        if (!this.isIdentity()) {\n            return null;\n        }\n        const id = this.data.req.value;\n        if (id.permission && !id.permission.actor.equals(PlaceholderName)) {\n            return id.permission.actor;\n        }\n        return null;\n    }\n    /**\n     * Present if the request is an identity request and requests a specific permission.\n     * @note This returns `nil` unless a specific permission has been requested,\n     *       use `isIdentity` to check id requests.\n     */\n    getIdentityPermission() {\n        if (!this.isIdentity()) {\n            return null;\n        }\n        const id = this.data.req.value;\n        if (id.permission && !id.permission.permission.equals(PlaceholderPermission)) {\n            return id.permission.permission;\n        }\n        return null;\n    }\n    /**\n     * Present if the request is an identity request and requests a specific permission.\n     * @note This returns `nil` unless a specific permission has been requested,\n     *       use `isIdentity` to check id requests.\n     */\n    getIdentityScope() {\n        if (!this.isIdentity() || this.version <= 2) {\n            return null;\n        }\n        const id = this.data.req.value;\n        return id.scope;\n    }\n    /** Get raw info dict */\n    getRawInfo() {\n        const rv = {};\n        for (const { key, value } of this.data.info) {\n            rv[key] = value;\n        }\n        return rv;\n    }\n    getRawInfoKey(key) {\n        const pair = this.data.info.find((pair) => pair.key === key);\n        if (pair) {\n            return pair.value;\n        }\n    }\n    setRawInfoKey(key, value) {\n        let pair = this.data.info.find((pair) => pair.key === key);\n        if (!pair) {\n            pair = InfoPair.from({ key, value });\n            this.data.info.push(pair);\n        }\n        else {\n            pair.value = Bytes.from(value);\n        }\n    }\n    /** Set a metadata key. */\n    setInfoKey(key, object, type) {\n        let data;\n        if (typeof object === 'string' && !type) {\n            // match old behavior where strings encode to raw utf8 as opposed to\n            // eosio-abi encoded strings (varuint32 length prefix + utf8 bytes)\n            data = Bytes.from(object, 'utf8');\n        }\n        else {\n            data = Serializer.encode({ object, type });\n        }\n        this.setRawInfoKey(key, data);\n    }\n    getInfoKey(key, type) {\n        const data = this.getRawInfoKey(key);\n        if (data) {\n            if (type) {\n                return Serializer.decode({ data, type });\n            }\n            else {\n                // assume utf8 string if no type is given\n                return data.utf8String;\n            }\n        }\n    }\n    /** Return a deep copy of this request. */\n    clone() {\n        let signature;\n        if (this.signature) {\n            signature = RequestSignature.from(JSON.parse(JSON.stringify(this.signature)));\n        }\n        const RequestData = this.constructor.storageType(this.version);\n        const data = RequestData.from(JSON.parse(JSON.stringify(this.data)));\n        return new SigningRequest(this.version, data, this.zlib, this.abiProvider, signature);\n    }\n    // Convenience methods.\n    toString() {\n        return this.encode();\n    }\n    toJSON() {\n        return this.encode();\n    }\n}\nclass ResolvedSigningRequest {\n    constructor(request, signer, transaction, resolvedTransaction, chainId) {\n        this.request = request;\n        this.signer = signer;\n        this.transaction = transaction;\n        this.resolvedTransaction = resolvedTransaction;\n        this.chainId = chainId;\n    }\n    /** Recreate a resolved request from a callback payload. */\n    static async fromPayload(payload, options = {}) {\n        const request = SigningRequest.from(payload.req, options);\n        const abis = await request.fetchAbis();\n        return request.resolve(abis, { actor: payload.sa, permission: payload.sp }, {\n            ref_block_num: payload.rbn,\n            ref_block_prefix: payload.rid,\n            expiration: payload.ex,\n            chainId: payload.cid || request.getChainId(),\n        });\n    }\n    get serializedTransaction() {\n        return Serializer.encode({ object: this.transaction }).array;\n    }\n    get signingDigest() {\n        return this.transaction.signingDigest(this.chainId);\n    }\n    getCallback(signatures, blockNum) {\n        const { callback, flags } = this.request.data;\n        if (!callback || callback.length === 0) {\n            return null;\n        }\n        if (!signatures || signatures.length === 0) {\n            throw new Error('Must have at least one signature to resolve callback');\n        }\n        const sigs = signatures.map((sig) => Signature.from(sig));\n        const payload = {\n            sig: String(sigs[0]),\n            tx: String(this.transaction.id),\n            rbn: String(this.transaction.ref_block_num),\n            rid: String(this.transaction.ref_block_prefix),\n            ex: String(this.transaction.expiration),\n            req: this.request.encode(),\n            sa: String(this.signer.actor),\n            sp: String(this.signer.permission),\n            cid: String(this.chainId),\n        };\n        for (const [n, sig] of sigs.slice(1).entries()) {\n            payload[`sig${n}`] = String(sig);\n        }\n        if (blockNum) {\n            payload.bn = String(UInt32.from(blockNum));\n        }\n        const url = callback.replace(/({{([a-z0-9]+)}})/g, (_1, _2, m) => {\n            return payload[m] || '';\n        });\n        return {\n            background: flags.background,\n            payload,\n            url,\n        };\n    }\n    getIdentityProof(signature) {\n        if (!this.request.isIdentity()) {\n            throw new Error('Not a identity request');\n        }\n        return IdentityProof.from({\n            chainId: this.chainId,\n            scope: this.request.getIdentityScope(),\n            expiration: this.transaction.expiration,\n            signer: this.signer,\n            signature,\n        });\n    }\n}\nfunction encodeAction(action, abis) {\n    if (Bytes.isBytes(action.data) || action.data.constructor.abiName !== undefined) {\n        return Action.from(action);\n    }\n    const abi = abis[String(Name.from(action.account))];\n    if (!abi) {\n        throw new Error(`Missing ABI for ${action.account}`);\n    }\n    return Action.from(action, abi);\n}\nfunction isIdentity(action) {\n    const account = Name.from(action.account);\n    const name = Name.from(action.name);\n    return account.rawValue.equals(0) && name.equals('identity');\n}\nfunction hasTapos(tx) {\n    return !(tx.expiration.equals(0) && tx.ref_block_num.equals(0) && tx.ref_block_prefix.equals(0));\n}\nfunction expirationTime(timestamp, expireSeconds = 60) {\n    const ts = TimePointSec.from(timestamp || new Date());\n    const exp = UInt32.from(expireSeconds);\n    return TimePointSec.fromInteger(ts.value.adding(exp));\n}\n\nexport { AccountName, base64u as Base64u, ChainAlias, ChainId, ChainIdVariant, ChainName, IdentityProof, IdentityV2, IdentityV3, InfoPair, PermissionName, PlaceholderAuth, PlaceholderName, PlaceholderPermission, ProtocolVersion, RequestDataV2, RequestDataV3, RequestFlags, RequestSignature, RequestVariantV2, RequestVariantV3, ResolvedSigningRequest, SigningRequest };\n//# sourceMappingURL=esr.m.js.map\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names-external').f;\n\n// eslint-disable-next-line es/no-object-getownpropertynames -- required for testing\nvar FAILS_ON_PRIMITIVES = fails(function () { return !Object.getOwnPropertyNames(1); });\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.es/ecma262/#sec-object.getownpropertynames\n$({ target: 'Object', stat: true, forced: FAILS_ON_PRIMITIVES }, {\n  getOwnPropertyNames: getOwnPropertyNames\n});\n","var fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_PURE = require('../internals/is-pure');\n\nvar ITERATOR = wellKnownSymbol('iterator');\n\nmodule.exports = !fails(function () {\n  var url = new URL('b?a=1&b=2&c=3', 'http://a');\n  var searchParams = url.searchParams;\n  var result = '';\n  url.pathname = 'c%20d';\n  searchParams.forEach(function (value, key) {\n    searchParams['delete']('b');\n    result += key + value;\n  });\n  return (IS_PURE && !url.toJSON)\n    || !searchParams.sort\n    || url.href !== 'http://a/c%20d?a=1&c=3'\n    || searchParams.get('c') !== '3'\n    || String(new URLSearchParams('?a=1')) !== 'a=1'\n    || !searchParams[ITERATOR]\n    // throws in Edge\n    || new URL('https://a@b').username !== 'a'\n    || new URLSearchParams(new URLSearchParams('a=b')).get('a') !== 'b'\n    // not punycoded in Edge\n    || new URL('http://тест').host !== 'xn--e1aybc'\n    // not escaped in Chrome 62-\n    || new URL('http://a#б').hash !== '#%D0%B1'\n    // fails in Chrome 66-\n    || result !== 'a1c3'\n    // throws in Safari\n    || new URL('http://x', undefined).host !== 'x';\n});\n","'use strict';\n// based on https://github.com/bestiejs/punycode.js/blob/master/punycode.js\nvar maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\nvar base = 36;\nvar tMin = 1;\nvar tMax = 26;\nvar skew = 38;\nvar damp = 700;\nvar initialBias = 72;\nvar initialN = 128; // 0x80\nvar delimiter = '-'; // '\\x2D'\nvar regexNonASCII = /[^\\0-\\u007E]/; // non-ASCII chars\nvar regexSeparators = /[.\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\nvar OVERFLOW_ERROR = 'Overflow: input needs wider integers to process';\nvar baseMinusTMin = base - tMin;\nvar floor = Math.floor;\nvar stringFromCharCode = String.fromCharCode;\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n */\nvar ucs2decode = function (string) {\n  var output = [];\n  var counter = 0;\n  var length = string.length;\n  while (counter < length) {\n    var value = string.charCodeAt(counter++);\n    if (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n      // It's a high surrogate, and there is a next character.\n      var extra = string.charCodeAt(counter++);\n      if ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n        output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n      } else {\n        // It's an unmatched surrogate; only append this code unit, in case the\n        // next code unit is the high surrogate of a surrogate pair.\n        output.push(value);\n        counter--;\n      }\n    } else {\n      output.push(value);\n    }\n  }\n  return output;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n */\nvar digitToBasic = function (digit) {\n  //  0..25 map to ASCII a..z or A..Z\n  // 26..35 map to ASCII 0..9\n  return digit + 22 + 75 * (digit < 26);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n */\nvar adapt = function (delta, numPoints, firstTime) {\n  var k = 0;\n  delta = firstTime ? floor(delta / damp) : delta >> 1;\n  delta += floor(delta / numPoints);\n  for (; delta > baseMinusTMin * tMax >> 1; k += base) {\n    delta = floor(delta / baseMinusTMin);\n  }\n  return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n */\n// eslint-disable-next-line max-statements -- TODO\nvar encode = function (input) {\n  var output = [];\n\n  // Convert the input in UCS-2 to an array of Unicode code points.\n  input = ucs2decode(input);\n\n  // Cache the length.\n  var inputLength = input.length;\n\n  // Initialize the state.\n  var n = initialN;\n  var delta = 0;\n  var bias = initialBias;\n  var i, currentValue;\n\n  // Handle the basic code points.\n  for (i = 0; i < input.length; i++) {\n    currentValue = input[i];\n    if (currentValue < 0x80) {\n      output.push(stringFromCharCode(currentValue));\n    }\n  }\n\n  var basicLength = output.length; // number of basic code points.\n  var handledCPCount = basicLength; // number of code points that have been handled;\n\n  // Finish the basic string with a delimiter unless it's empty.\n  if (basicLength) {\n    output.push(delimiter);\n  }\n\n  // Main encoding loop:\n  while (handledCPCount < inputLength) {\n    // All non-basic code points < n have been handled already. Find the next larger one:\n    var m = maxInt;\n    for (i = 0; i < input.length; i++) {\n      currentValue = input[i];\n      if (currentValue >= n && currentValue < m) {\n        m = currentValue;\n      }\n    }\n\n    // Increase `delta` enough to advance the decoder's <n,i> state to <m,0>, but guard against overflow.\n    var handledCPCountPlusOne = handledCPCount + 1;\n    if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n      throw RangeError(OVERFLOW_ERROR);\n    }\n\n    delta += (m - n) * handledCPCountPlusOne;\n    n = m;\n\n    for (i = 0; i < input.length; i++) {\n      currentValue = input[i];\n      if (currentValue < n && ++delta > maxInt) {\n        throw RangeError(OVERFLOW_ERROR);\n      }\n      if (currentValue == n) {\n        // Represent delta as a generalized variable-length integer.\n        var q = delta;\n        for (var k = base; /* no condition */; k += base) {\n          var t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n          if (q < t) break;\n          var qMinusT = q - t;\n          var baseMinusT = base - t;\n          output.push(stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT)));\n          q = floor(qMinusT / baseMinusT);\n        }\n\n        output.push(stringFromCharCode(digitToBasic(q)));\n        bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n        delta = 0;\n        ++handledCPCount;\n      }\n    }\n\n    ++delta;\n    ++n;\n  }\n  return output.join('');\n};\n\nmodule.exports = function (input) {\n  var encoded = [];\n  var labels = input.toLowerCase().replace(regexSeparators, '\\u002E').split('.');\n  var i, label;\n  for (i = 0; i < labels.length; i++) {\n    label = labels[i];\n    encoded.push(regexNonASCII.test(label) ? 'xn--' + encode(label) : label);\n  }\n  return encoded.join('.');\n};\n","var anObject = require('../internals/an-object');\nvar getIteratorMethod = require('../internals/get-iterator-method');\n\nmodule.exports = function (it) {\n  var iteratorMethod = getIteratorMethod(it);\n  if (typeof iteratorMethod != 'function') {\n    throw TypeError(String(it) + ' is not iterable');\n  } return anObject(iteratorMethod.call(it));\n};\n","'use strict';\n// TODO: in core-js@4, move /modules/ dependencies to public entries for better optimization by tools like `preset-env`\nrequire('../modules/es.array.iterator');\nvar $ = require('../internals/export');\nvar getBuiltIn = require('../internals/get-built-in');\nvar USE_NATIVE_URL = require('../internals/native-url');\nvar redefine = require('../internals/redefine');\nvar redefineAll = require('../internals/redefine-all');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar createIteratorConstructor = require('../internals/create-iterator-constructor');\nvar InternalStateModule = require('../internals/internal-state');\nvar anInstance = require('../internals/an-instance');\nvar hasOwn = require('../internals/has');\nvar bind = require('../internals/function-bind-context');\nvar classof = require('../internals/classof');\nvar anObject = require('../internals/an-object');\nvar isObject = require('../internals/is-object');\nvar create = require('../internals/object-create');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar getIterator = require('../internals/get-iterator');\nvar getIteratorMethod = require('../internals/get-iterator-method');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar $fetch = getBuiltIn('fetch');\nvar Headers = getBuiltIn('Headers');\nvar ITERATOR = wellKnownSymbol('iterator');\nvar URL_SEARCH_PARAMS = 'URLSearchParams';\nvar URL_SEARCH_PARAMS_ITERATOR = URL_SEARCH_PARAMS + 'Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalParamsState = InternalStateModule.getterFor(URL_SEARCH_PARAMS);\nvar getInternalIteratorState = InternalStateModule.getterFor(URL_SEARCH_PARAMS_ITERATOR);\n\nvar plus = /\\+/g;\nvar sequences = Array(4);\n\nvar percentSequence = function (bytes) {\n  return sequences[bytes - 1] || (sequences[bytes - 1] = RegExp('((?:%[\\\\da-f]{2}){' + bytes + '})', 'gi'));\n};\n\nvar percentDecode = function (sequence) {\n  try {\n    return decodeURIComponent(sequence);\n  } catch (error) {\n    return sequence;\n  }\n};\n\nvar deserialize = function (it) {\n  var result = it.replace(plus, ' ');\n  var bytes = 4;\n  try {\n    return decodeURIComponent(result);\n  } catch (error) {\n    while (bytes) {\n      result = result.replace(percentSequence(bytes--), percentDecode);\n    }\n    return result;\n  }\n};\n\nvar find = /[!'()~]|%20/g;\n\nvar replace = {\n  '!': '%21',\n  \"'\": '%27',\n  '(': '%28',\n  ')': '%29',\n  '~': '%7E',\n  '%20': '+'\n};\n\nvar replacer = function (match) {\n  return replace[match];\n};\n\nvar serialize = function (it) {\n  return encodeURIComponent(it).replace(find, replacer);\n};\n\nvar parseSearchParams = function (result, query) {\n  if (query) {\n    var attributes = query.split('&');\n    var index = 0;\n    var attribute, entry;\n    while (index < attributes.length) {\n      attribute = attributes[index++];\n      if (attribute.length) {\n        entry = attribute.split('=');\n        result.push({\n          key: deserialize(entry.shift()),\n          value: deserialize(entry.join('='))\n        });\n      }\n    }\n  }\n};\n\nvar updateSearchParams = function (query) {\n  this.entries.length = 0;\n  parseSearchParams(this.entries, query);\n};\n\nvar validateArgumentsLength = function (passed, required) {\n  if (passed < required) throw TypeError('Not enough arguments');\n};\n\nvar URLSearchParamsIterator = createIteratorConstructor(function Iterator(params, kind) {\n  setInternalState(this, {\n    type: URL_SEARCH_PARAMS_ITERATOR,\n    iterator: getIterator(getInternalParamsState(params).entries),\n    kind: kind\n  });\n}, 'Iterator', function next() {\n  var state = getInternalIteratorState(this);\n  var kind = state.kind;\n  var step = state.iterator.next();\n  var entry = step.value;\n  if (!step.done) {\n    step.value = kind === 'keys' ? entry.key : kind === 'values' ? entry.value : [entry.key, entry.value];\n  } return step;\n});\n\n// `URLSearchParams` constructor\n// https://url.spec.whatwg.org/#interface-urlsearchparams\nvar URLSearchParamsConstructor = function URLSearchParams(/* init */) {\n  anInstance(this, URLSearchParamsConstructor, URL_SEARCH_PARAMS);\n  var init = arguments.length > 0 ? arguments[0] : undefined;\n  var that = this;\n  var entries = [];\n  var iteratorMethod, iterator, next, step, entryIterator, entryNext, first, second, key;\n\n  setInternalState(that, {\n    type: URL_SEARCH_PARAMS,\n    entries: entries,\n    updateURL: function () { /* empty */ },\n    updateSearchParams: updateSearchParams\n  });\n\n  if (init !== undefined) {\n    if (isObject(init)) {\n      iteratorMethod = getIteratorMethod(init);\n      if (typeof iteratorMethod === 'function') {\n        iterator = iteratorMethod.call(init);\n        next = iterator.next;\n        while (!(step = next.call(iterator)).done) {\n          entryIterator = getIterator(anObject(step.value));\n          entryNext = entryIterator.next;\n          if (\n            (first = entryNext.call(entryIterator)).done ||\n            (second = entryNext.call(entryIterator)).done ||\n            !entryNext.call(entryIterator).done\n          ) throw TypeError('Expected sequence with length 2');\n          entries.push({ key: first.value + '', value: second.value + '' });\n        }\n      } else for (key in init) if (hasOwn(init, key)) entries.push({ key: key, value: init[key] + '' });\n    } else {\n      parseSearchParams(entries, typeof init === 'string' ? init.charAt(0) === '?' ? init.slice(1) : init : init + '');\n    }\n  }\n};\n\nvar URLSearchParamsPrototype = URLSearchParamsConstructor.prototype;\n\nredefineAll(URLSearchParamsPrototype, {\n  // `URLSearchParams.prototype.append` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-append\n  append: function append(name, value) {\n    validateArgumentsLength(arguments.length, 2);\n    var state = getInternalParamsState(this);\n    state.entries.push({ key: name + '', value: value + '' });\n    state.updateURL();\n  },\n  // `URLSearchParams.prototype.delete` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-delete\n  'delete': function (name) {\n    validateArgumentsLength(arguments.length, 1);\n    var state = getInternalParamsState(this);\n    var entries = state.entries;\n    var key = name + '';\n    var index = 0;\n    while (index < entries.length) {\n      if (entries[index].key === key) entries.splice(index, 1);\n      else index++;\n    }\n    state.updateURL();\n  },\n  // `URLSearchParams.prototype.get` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-get\n  get: function get(name) {\n    validateArgumentsLength(arguments.length, 1);\n    var entries = getInternalParamsState(this).entries;\n    var key = name + '';\n    var index = 0;\n    for (; index < entries.length; index++) {\n      if (entries[index].key === key) return entries[index].value;\n    }\n    return null;\n  },\n  // `URLSearchParams.prototype.getAll` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-getall\n  getAll: function getAll(name) {\n    validateArgumentsLength(arguments.length, 1);\n    var entries = getInternalParamsState(this).entries;\n    var key = name + '';\n    var result = [];\n    var index = 0;\n    for (; index < entries.length; index++) {\n      if (entries[index].key === key) result.push(entries[index].value);\n    }\n    return result;\n  },\n  // `URLSearchParams.prototype.has` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-has\n  has: function has(name) {\n    validateArgumentsLength(arguments.length, 1);\n    var entries = getInternalParamsState(this).entries;\n    var key = name + '';\n    var index = 0;\n    while (index < entries.length) {\n      if (entries[index++].key === key) return true;\n    }\n    return false;\n  },\n  // `URLSearchParams.prototype.set` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-set\n  set: function set(name, value) {\n    validateArgumentsLength(arguments.length, 1);\n    var state = getInternalParamsState(this);\n    var entries = state.entries;\n    var found = false;\n    var key = name + '';\n    var val = value + '';\n    var index = 0;\n    var entry;\n    for (; index < entries.length; index++) {\n      entry = entries[index];\n      if (entry.key === key) {\n        if (found) entries.splice(index--, 1);\n        else {\n          found = true;\n          entry.value = val;\n        }\n      }\n    }\n    if (!found) entries.push({ key: key, value: val });\n    state.updateURL();\n  },\n  // `URLSearchParams.prototype.sort` method\n  // https://url.spec.whatwg.org/#dom-urlsearchparams-sort\n  sort: function sort() {\n    var state = getInternalParamsState(this);\n    var entries = state.entries;\n    // Array#sort is not stable in some engines\n    var slice = entries.slice();\n    var entry, entriesIndex, sliceIndex;\n    entries.length = 0;\n    for (sliceIndex = 0; sliceIndex < slice.length; sliceIndex++) {\n      entry = slice[sliceIndex];\n      for (entriesIndex = 0; entriesIndex < sliceIndex; entriesIndex++) {\n        if (entries[entriesIndex].key > entry.key) {\n          entries.splice(entriesIndex, 0, entry);\n          break;\n        }\n      }\n      if (entriesIndex === sliceIndex) entries.push(entry);\n    }\n    state.updateURL();\n  },\n  // `URLSearchParams.prototype.forEach` method\n  forEach: function forEach(callback /* , thisArg */) {\n    var entries = getInternalParamsState(this).entries;\n    var boundFunction = bind(callback, arguments.length > 1 ? arguments[1] : undefined, 3);\n    var index = 0;\n    var entry;\n    while (index < entries.length) {\n      entry = entries[index++];\n      boundFunction(entry.value, entry.key, this);\n    }\n  },\n  // `URLSearchParams.prototype.keys` method\n  keys: function keys() {\n    return new URLSearchParamsIterator(this, 'keys');\n  },\n  // `URLSearchParams.prototype.values` method\n  values: function values() {\n    return new URLSearchParamsIterator(this, 'values');\n  },\n  // `URLSearchParams.prototype.entries` method\n  entries: function entries() {\n    return new URLSearchParamsIterator(this, 'entries');\n  }\n}, { enumerable: true });\n\n// `URLSearchParams.prototype[@@iterator]` method\nredefine(URLSearchParamsPrototype, ITERATOR, URLSearchParamsPrototype.entries);\n\n// `URLSearchParams.prototype.toString` method\n// https://url.spec.whatwg.org/#urlsearchparams-stringification-behavior\nredefine(URLSearchParamsPrototype, 'toString', function toString() {\n  var entries = getInternalParamsState(this).entries;\n  var result = [];\n  var index = 0;\n  var entry;\n  while (index < entries.length) {\n    entry = entries[index++];\n    result.push(serialize(entry.key) + '=' + serialize(entry.value));\n  } return result.join('&');\n}, { enumerable: true });\n\nsetToStringTag(URLSearchParamsConstructor, URL_SEARCH_PARAMS);\n\n$({ global: true, forced: !USE_NATIVE_URL }, {\n  URLSearchParams: URLSearchParamsConstructor\n});\n\n// Wrap `fetch` for correct work with polyfilled `URLSearchParams`\n// https://github.com/zloirock/core-js/issues/674\nif (!USE_NATIVE_URL && typeof $fetch == 'function' && typeof Headers == 'function') {\n  $({ global: true, enumerable: true, forced: true }, {\n    fetch: function fetch(input /* , init */) {\n      var args = [input];\n      var init, body, headers;\n      if (arguments.length > 1) {\n        init = arguments[1];\n        if (isObject(init)) {\n          body = init.body;\n          if (classof(body) === URL_SEARCH_PARAMS) {\n            headers = init.headers ? new Headers(init.headers) : new Headers();\n            if (!headers.has('content-type')) {\n              headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n            }\n            init = create(init, {\n              body: createPropertyDescriptor(0, String(body)),\n              headers: createPropertyDescriptor(0, headers)\n            });\n          }\n        }\n        args.push(init);\n      } return $fetch.apply(this, args);\n    }\n  });\n}\n\nmodule.exports = {\n  URLSearchParams: URLSearchParamsConstructor,\n  getState: getInternalParamsState\n};\n","'use strict';\n// TODO: in core-js@4, move /modules/ dependencies to public entries for better optimization by tools like `preset-env`\nrequire('../modules/es.string.iterator');\nvar $ = require('../internals/export');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar USE_NATIVE_URL = require('../internals/native-url');\nvar global = require('../internals/global');\nvar defineProperties = require('../internals/object-define-properties');\nvar redefine = require('../internals/redefine');\nvar anInstance = require('../internals/an-instance');\nvar has = require('../internals/has');\nvar assign = require('../internals/object-assign');\nvar arrayFrom = require('../internals/array-from');\nvar codeAt = require('../internals/string-multibyte').codeAt;\nvar toASCII = require('../internals/string-punycode-to-ascii');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar URLSearchParamsModule = require('../modules/web.url-search-params');\nvar InternalStateModule = require('../internals/internal-state');\n\nvar NativeURL = global.URL;\nvar URLSearchParams = URLSearchParamsModule.URLSearchParams;\nvar getInternalSearchParamsState = URLSearchParamsModule.getState;\nvar setInternalState = InternalStateModule.set;\nvar getInternalURLState = InternalStateModule.getterFor('URL');\nvar floor = Math.floor;\nvar pow = Math.pow;\n\nvar INVALID_AUTHORITY = 'Invalid authority';\nvar INVALID_SCHEME = 'Invalid scheme';\nvar INVALID_HOST = 'Invalid host';\nvar INVALID_PORT = 'Invalid port';\n\nvar ALPHA = /[A-Za-z]/;\n// eslint-disable-next-line regexp/no-obscure-range -- safe\nvar ALPHANUMERIC = /[\\d+-.A-Za-z]/;\nvar DIGIT = /\\d/;\nvar HEX_START = /^(0x|0X)/;\nvar OCT = /^[0-7]+$/;\nvar DEC = /^\\d+$/;\nvar HEX = /^[\\dA-Fa-f]+$/;\n/* eslint-disable no-control-regex -- safe */\nvar FORBIDDEN_HOST_CODE_POINT = /[\\0\\t\\n\\r #%/:?@[\\\\]]/;\nvar FORBIDDEN_HOST_CODE_POINT_EXCLUDING_PERCENT = /[\\0\\t\\n\\r #/:?@[\\\\]]/;\nvar LEADING_AND_TRAILING_C0_CONTROL_OR_SPACE = /^[\\u0000-\\u001F ]+|[\\u0000-\\u001F ]+$/g;\nvar TAB_AND_NEW_LINE = /[\\t\\n\\r]/g;\n/* eslint-enable no-control-regex -- safe */\nvar EOF;\n\nvar parseHost = function (url, input) {\n  var result, codePoints, index;\n  if (input.charAt(0) == '[') {\n    if (input.charAt(input.length - 1) != ']') return INVALID_HOST;\n    result = parseIPv6(input.slice(1, -1));\n    if (!result) return INVALID_HOST;\n    url.host = result;\n  // opaque host\n  } else if (!isSpecial(url)) {\n    if (FORBIDDEN_HOST_CODE_POINT_EXCLUDING_PERCENT.test(input)) return INVALID_HOST;\n    result = '';\n    codePoints = arrayFrom(input);\n    for (index = 0; index < codePoints.length; index++) {\n      result += percentEncode(codePoints[index], C0ControlPercentEncodeSet);\n    }\n    url.host = result;\n  } else {\n    input = toASCII(input);\n    if (FORBIDDEN_HOST_CODE_POINT.test(input)) return INVALID_HOST;\n    result = parseIPv4(input);\n    if (result === null) return INVALID_HOST;\n    url.host = result;\n  }\n};\n\nvar parseIPv4 = function (input) {\n  var parts = input.split('.');\n  var partsLength, numbers, index, part, radix, number, ipv4;\n  if (parts.length && parts[parts.length - 1] == '') {\n    parts.pop();\n  }\n  partsLength = parts.length;\n  if (partsLength > 4) return input;\n  numbers = [];\n  for (index = 0; index < partsLength; index++) {\n    part = parts[index];\n    if (part == '') return input;\n    radix = 10;\n    if (part.length > 1 && part.charAt(0) == '0') {\n      radix = HEX_START.test(part) ? 16 : 8;\n      part = part.slice(radix == 8 ? 1 : 2);\n    }\n    if (part === '') {\n      number = 0;\n    } else {\n      if (!(radix == 10 ? DEC : radix == 8 ? OCT : HEX).test(part)) return input;\n      number = parseInt(part, radix);\n    }\n    numbers.push(number);\n  }\n  for (index = 0; index < partsLength; index++) {\n    number = numbers[index];\n    if (index == partsLength - 1) {\n      if (number >= pow(256, 5 - partsLength)) return null;\n    } else if (number > 255) return null;\n  }\n  ipv4 = numbers.pop();\n  for (index = 0; index < numbers.length; index++) {\n    ipv4 += numbers[index] * pow(256, 3 - index);\n  }\n  return ipv4;\n};\n\n// eslint-disable-next-line max-statements -- TODO\nvar parseIPv6 = function (input) {\n  var address = [0, 0, 0, 0, 0, 0, 0, 0];\n  var pieceIndex = 0;\n  var compress = null;\n  var pointer = 0;\n  var value, length, numbersSeen, ipv4Piece, number, swaps, swap;\n\n  var char = function () {\n    return input.charAt(pointer);\n  };\n\n  if (char() == ':') {\n    if (input.charAt(1) != ':') return;\n    pointer += 2;\n    pieceIndex++;\n    compress = pieceIndex;\n  }\n  while (char()) {\n    if (pieceIndex == 8) return;\n    if (char() == ':') {\n      if (compress !== null) return;\n      pointer++;\n      pieceIndex++;\n      compress = pieceIndex;\n      continue;\n    }\n    value = length = 0;\n    while (length < 4 && HEX.test(char())) {\n      value = value * 16 + parseInt(char(), 16);\n      pointer++;\n      length++;\n    }\n    if (char() == '.') {\n      if (length == 0) return;\n      pointer -= length;\n      if (pieceIndex > 6) return;\n      numbersSeen = 0;\n      while (char()) {\n        ipv4Piece = null;\n        if (numbersSeen > 0) {\n          if (char() == '.' && numbersSeen < 4) pointer++;\n          else return;\n        }\n        if (!DIGIT.test(char())) return;\n        while (DIGIT.test(char())) {\n          number = parseInt(char(), 10);\n          if (ipv4Piece === null) ipv4Piece = number;\n          else if (ipv4Piece == 0) return;\n          else ipv4Piece = ipv4Piece * 10 + number;\n          if (ipv4Piece > 255) return;\n          pointer++;\n        }\n        address[pieceIndex] = address[pieceIndex] * 256 + ipv4Piece;\n        numbersSeen++;\n        if (numbersSeen == 2 || numbersSeen == 4) pieceIndex++;\n      }\n      if (numbersSeen != 4) return;\n      break;\n    } else if (char() == ':') {\n      pointer++;\n      if (!char()) return;\n    } else if (char()) return;\n    address[pieceIndex++] = value;\n  }\n  if (compress !== null) {\n    swaps = pieceIndex - compress;\n    pieceIndex = 7;\n    while (pieceIndex != 0 && swaps > 0) {\n      swap = address[pieceIndex];\n      address[pieceIndex--] = address[compress + swaps - 1];\n      address[compress + --swaps] = swap;\n    }\n  } else if (pieceIndex != 8) return;\n  return address;\n};\n\nvar findLongestZeroSequence = function (ipv6) {\n  var maxIndex = null;\n  var maxLength = 1;\n  var currStart = null;\n  var currLength = 0;\n  var index = 0;\n  for (; index < 8; index++) {\n    if (ipv6[index] !== 0) {\n      if (currLength > maxLength) {\n        maxIndex = currStart;\n        maxLength = currLength;\n      }\n      currStart = null;\n      currLength = 0;\n    } else {\n      if (currStart === null) currStart = index;\n      ++currLength;\n    }\n  }\n  if (currLength > maxLength) {\n    maxIndex = currStart;\n    maxLength = currLength;\n  }\n  return maxIndex;\n};\n\nvar serializeHost = function (host) {\n  var result, index, compress, ignore0;\n  // ipv4\n  if (typeof host == 'number') {\n    result = [];\n    for (index = 0; index < 4; index++) {\n      result.unshift(host % 256);\n      host = floor(host / 256);\n    } return result.join('.');\n  // ipv6\n  } else if (typeof host == 'object') {\n    result = '';\n    compress = findLongestZeroSequence(host);\n    for (index = 0; index < 8; index++) {\n      if (ignore0 && host[index] === 0) continue;\n      if (ignore0) ignore0 = false;\n      if (compress === index) {\n        result += index ? ':' : '::';\n        ignore0 = true;\n      } else {\n        result += host[index].toString(16);\n        if (index < 7) result += ':';\n      }\n    }\n    return '[' + result + ']';\n  } return host;\n};\n\nvar C0ControlPercentEncodeSet = {};\nvar fragmentPercentEncodeSet = assign({}, C0ControlPercentEncodeSet, {\n  ' ': 1, '\"': 1, '<': 1, '>': 1, '`': 1\n});\nvar pathPercentEncodeSet = assign({}, fragmentPercentEncodeSet, {\n  '#': 1, '?': 1, '{': 1, '}': 1\n});\nvar userinfoPercentEncodeSet = assign({}, pathPercentEncodeSet, {\n  '/': 1, ':': 1, ';': 1, '=': 1, '@': 1, '[': 1, '\\\\': 1, ']': 1, '^': 1, '|': 1\n});\n\nvar percentEncode = function (char, set) {\n  var code = codeAt(char, 0);\n  return code > 0x20 && code < 0x7F && !has(set, char) ? char : encodeURIComponent(char);\n};\n\nvar specialSchemes = {\n  ftp: 21,\n  file: null,\n  http: 80,\n  https: 443,\n  ws: 80,\n  wss: 443\n};\n\nvar isSpecial = function (url) {\n  return has(specialSchemes, url.scheme);\n};\n\nvar includesCredentials = function (url) {\n  return url.username != '' || url.password != '';\n};\n\nvar cannotHaveUsernamePasswordPort = function (url) {\n  return !url.host || url.cannotBeABaseURL || url.scheme == 'file';\n};\n\nvar isWindowsDriveLetter = function (string, normalized) {\n  var second;\n  return string.length == 2 && ALPHA.test(string.charAt(0))\n    && ((second = string.charAt(1)) == ':' || (!normalized && second == '|'));\n};\n\nvar startsWithWindowsDriveLetter = function (string) {\n  var third;\n  return string.length > 1 && isWindowsDriveLetter(string.slice(0, 2)) && (\n    string.length == 2 ||\n    ((third = string.charAt(2)) === '/' || third === '\\\\' || third === '?' || third === '#')\n  );\n};\n\nvar shortenURLsPath = function (url) {\n  var path = url.path;\n  var pathSize = path.length;\n  if (pathSize && (url.scheme != 'file' || pathSize != 1 || !isWindowsDriveLetter(path[0], true))) {\n    path.pop();\n  }\n};\n\nvar isSingleDot = function (segment) {\n  return segment === '.' || segment.toLowerCase() === '%2e';\n};\n\nvar isDoubleDot = function (segment) {\n  segment = segment.toLowerCase();\n  return segment === '..' || segment === '%2e.' || segment === '.%2e' || segment === '%2e%2e';\n};\n\n// States:\nvar SCHEME_START = {};\nvar SCHEME = {};\nvar NO_SCHEME = {};\nvar SPECIAL_RELATIVE_OR_AUTHORITY = {};\nvar PATH_OR_AUTHORITY = {};\nvar RELATIVE = {};\nvar RELATIVE_SLASH = {};\nvar SPECIAL_AUTHORITY_SLASHES = {};\nvar SPECIAL_AUTHORITY_IGNORE_SLASHES = {};\nvar AUTHORITY = {};\nvar HOST = {};\nvar HOSTNAME = {};\nvar PORT = {};\nvar FILE = {};\nvar FILE_SLASH = {};\nvar FILE_HOST = {};\nvar PATH_START = {};\nvar PATH = {};\nvar CANNOT_BE_A_BASE_URL_PATH = {};\nvar QUERY = {};\nvar FRAGMENT = {};\n\n// eslint-disable-next-line max-statements -- TODO\nvar parseURL = function (url, input, stateOverride, base) {\n  var state = stateOverride || SCHEME_START;\n  var pointer = 0;\n  var buffer = '';\n  var seenAt = false;\n  var seenBracket = false;\n  var seenPasswordToken = false;\n  var codePoints, char, bufferCodePoints, failure;\n\n  if (!stateOverride) {\n    url.scheme = '';\n    url.username = '';\n    url.password = '';\n    url.host = null;\n    url.port = null;\n    url.path = [];\n    url.query = null;\n    url.fragment = null;\n    url.cannotBeABaseURL = false;\n    input = input.replace(LEADING_AND_TRAILING_C0_CONTROL_OR_SPACE, '');\n  }\n\n  input = input.replace(TAB_AND_NEW_LINE, '');\n\n  codePoints = arrayFrom(input);\n\n  while (pointer <= codePoints.length) {\n    char = codePoints[pointer];\n    switch (state) {\n      case SCHEME_START:\n        if (char && ALPHA.test(char)) {\n          buffer += char.toLowerCase();\n          state = SCHEME;\n        } else if (!stateOverride) {\n          state = NO_SCHEME;\n          continue;\n        } else return INVALID_SCHEME;\n        break;\n\n      case SCHEME:\n        if (char && (ALPHANUMERIC.test(char) || char == '+' || char == '-' || char == '.')) {\n          buffer += char.toLowerCase();\n        } else if (char == ':') {\n          if (stateOverride && (\n            (isSpecial(url) != has(specialSchemes, buffer)) ||\n            (buffer == 'file' && (includesCredentials(url) || url.port !== null)) ||\n            (url.scheme == 'file' && !url.host)\n          )) return;\n          url.scheme = buffer;\n          if (stateOverride) {\n            if (isSpecial(url) && specialSchemes[url.scheme] == url.port) url.port = null;\n            return;\n          }\n          buffer = '';\n          if (url.scheme == 'file') {\n            state = FILE;\n          } else if (isSpecial(url) && base && base.scheme == url.scheme) {\n            state = SPECIAL_RELATIVE_OR_AUTHORITY;\n          } else if (isSpecial(url)) {\n            state = SPECIAL_AUTHORITY_SLASHES;\n          } else if (codePoints[pointer + 1] == '/') {\n            state = PATH_OR_AUTHORITY;\n            pointer++;\n          } else {\n            url.cannotBeABaseURL = true;\n            url.path.push('');\n            state = CANNOT_BE_A_BASE_URL_PATH;\n          }\n        } else if (!stateOverride) {\n          buffer = '';\n          state = NO_SCHEME;\n          pointer = 0;\n          continue;\n        } else return INVALID_SCHEME;\n        break;\n\n      case NO_SCHEME:\n        if (!base || (base.cannotBeABaseURL && char != '#')) return INVALID_SCHEME;\n        if (base.cannotBeABaseURL && char == '#') {\n          url.scheme = base.scheme;\n          url.path = base.path.slice();\n          url.query = base.query;\n          url.fragment = '';\n          url.cannotBeABaseURL = true;\n          state = FRAGMENT;\n          break;\n        }\n        state = base.scheme == 'file' ? FILE : RELATIVE;\n        continue;\n\n      case SPECIAL_RELATIVE_OR_AUTHORITY:\n        if (char == '/' && codePoints[pointer + 1] == '/') {\n          state = SPECIAL_AUTHORITY_IGNORE_SLASHES;\n          pointer++;\n        } else {\n          state = RELATIVE;\n          continue;\n        } break;\n\n      case PATH_OR_AUTHORITY:\n        if (char == '/') {\n          state = AUTHORITY;\n          break;\n        } else {\n          state = PATH;\n          continue;\n        }\n\n      case RELATIVE:\n        url.scheme = base.scheme;\n        if (char == EOF) {\n          url.username = base.username;\n          url.password = base.password;\n          url.host = base.host;\n          url.port = base.port;\n          url.path = base.path.slice();\n          url.query = base.query;\n        } else if (char == '/' || (char == '\\\\' && isSpecial(url))) {\n          state = RELATIVE_SLASH;\n        } else if (char == '?') {\n          url.username = base.username;\n          url.password = base.password;\n          url.host = base.host;\n          url.port = base.port;\n          url.path = base.path.slice();\n          url.query = '';\n          state = QUERY;\n        } else if (char == '#') {\n          url.username = base.username;\n          url.password = base.password;\n          url.host = base.host;\n          url.port = base.port;\n          url.path = base.path.slice();\n          url.query = base.query;\n          url.fragment = '';\n          state = FRAGMENT;\n        } else {\n          url.username = base.username;\n          url.password = base.password;\n          url.host = base.host;\n          url.port = base.port;\n          url.path = base.path.slice();\n          url.path.pop();\n          state = PATH;\n          continue;\n        } break;\n\n      case RELATIVE_SLASH:\n        if (isSpecial(url) && (char == '/' || char == '\\\\')) {\n          state = SPECIAL_AUTHORITY_IGNORE_SLASHES;\n        } else if (char == '/') {\n          state = AUTHORITY;\n        } else {\n          url.username = base.username;\n          url.password = base.password;\n          url.host = base.host;\n          url.port = base.port;\n          state = PATH;\n          continue;\n        } break;\n\n      case SPECIAL_AUTHORITY_SLASHES:\n        state = SPECIAL_AUTHORITY_IGNORE_SLASHES;\n        if (char != '/' || buffer.charAt(pointer + 1) != '/') continue;\n        pointer++;\n        break;\n\n      case SPECIAL_AUTHORITY_IGNORE_SLASHES:\n        if (char != '/' && char != '\\\\') {\n          state = AUTHORITY;\n          continue;\n        } break;\n\n      case AUTHORITY:\n        if (char == '@') {\n          if (seenAt) buffer = '%40' + buffer;\n          seenAt = true;\n          bufferCodePoints = arrayFrom(buffer);\n          for (var i = 0; i < bufferCodePoints.length; i++) {\n            var codePoint = bufferCodePoints[i];\n            if (codePoint == ':' && !seenPasswordToken) {\n              seenPasswordToken = true;\n              continue;\n            }\n            var encodedCodePoints = percentEncode(codePoint, userinfoPercentEncodeSet);\n            if (seenPasswordToken) url.password += encodedCodePoints;\n            else url.username += encodedCodePoints;\n          }\n          buffer = '';\n        } else if (\n          char == EOF || char == '/' || char == '?' || char == '#' ||\n          (char == '\\\\' && isSpecial(url))\n        ) {\n          if (seenAt && buffer == '') return INVALID_AUTHORITY;\n          pointer -= arrayFrom(buffer).length + 1;\n          buffer = '';\n          state = HOST;\n        } else buffer += char;\n        break;\n\n      case HOST:\n      case HOSTNAME:\n        if (stateOverride && url.scheme == 'file') {\n          state = FILE_HOST;\n          continue;\n        } else if (char == ':' && !seenBracket) {\n          if (buffer == '') return INVALID_HOST;\n          failure = parseHost(url, buffer);\n          if (failure) return failure;\n          buffer = '';\n          state = PORT;\n          if (stateOverride == HOSTNAME) return;\n        } else if (\n          char == EOF || char == '/' || char == '?' || char == '#' ||\n          (char == '\\\\' && isSpecial(url))\n        ) {\n          if (isSpecial(url) && buffer == '') return INVALID_HOST;\n          if (stateOverride && buffer == '' && (includesCredentials(url) || url.port !== null)) return;\n          failure = parseHost(url, buffer);\n          if (failure) return failure;\n          buffer = '';\n          state = PATH_START;\n          if (stateOverride) return;\n          continue;\n        } else {\n          if (char == '[') seenBracket = true;\n          else if (char == ']') seenBracket = false;\n          buffer += char;\n        } break;\n\n      case PORT:\n        if (DIGIT.test(char)) {\n          buffer += char;\n        } else if (\n          char == EOF || char == '/' || char == '?' || char == '#' ||\n          (char == '\\\\' && isSpecial(url)) ||\n          stateOverride\n        ) {\n          if (buffer != '') {\n            var port = parseInt(buffer, 10);\n            if (port > 0xFFFF) return INVALID_PORT;\n            url.port = (isSpecial(url) && port === specialSchemes[url.scheme]) ? null : port;\n            buffer = '';\n          }\n          if (stateOverride) return;\n          state = PATH_START;\n          continue;\n        } else return INVALID_PORT;\n        break;\n\n      case FILE:\n        url.scheme = 'file';\n        if (char == '/' || char == '\\\\') state = FILE_SLASH;\n        else if (base && base.scheme == 'file') {\n          if (char == EOF) {\n            url.host = base.host;\n            url.path = base.path.slice();\n            url.query = base.query;\n          } else if (char == '?') {\n            url.host = base.host;\n            url.path = base.path.slice();\n            url.query = '';\n            state = QUERY;\n          } else if (char == '#') {\n            url.host = base.host;\n            url.path = base.path.slice();\n            url.query = base.query;\n            url.fragment = '';\n            state = FRAGMENT;\n          } else {\n            if (!startsWithWindowsDriveLetter(codePoints.slice(pointer).join(''))) {\n              url.host = base.host;\n              url.path = base.path.slice();\n              shortenURLsPath(url);\n            }\n            state = PATH;\n            continue;\n          }\n        } else {\n          state = PATH;\n          continue;\n        } break;\n\n      case FILE_SLASH:\n        if (char == '/' || char == '\\\\') {\n          state = FILE_HOST;\n          break;\n        }\n        if (base && base.scheme == 'file' && !startsWithWindowsDriveLetter(codePoints.slice(pointer).join(''))) {\n          if (isWindowsDriveLetter(base.path[0], true)) url.path.push(base.path[0]);\n          else url.host = base.host;\n        }\n        state = PATH;\n        continue;\n\n      case FILE_HOST:\n        if (char == EOF || char == '/' || char == '\\\\' || char == '?' || char == '#') {\n          if (!stateOverride && isWindowsDriveLetter(buffer)) {\n            state = PATH;\n          } else if (buffer == '') {\n            url.host = '';\n            if (stateOverride) return;\n            state = PATH_START;\n          } else {\n            failure = parseHost(url, buffer);\n            if (failure) return failure;\n            if (url.host == 'localhost') url.host = '';\n            if (stateOverride) return;\n            buffer = '';\n            state = PATH_START;\n          } continue;\n        } else buffer += char;\n        break;\n\n      case PATH_START:\n        if (isSpecial(url)) {\n          state = PATH;\n          if (char != '/' && char != '\\\\') continue;\n        } else if (!stateOverride && char == '?') {\n          url.query = '';\n          state = QUERY;\n        } else if (!stateOverride && char == '#') {\n          url.fragment = '';\n          state = FRAGMENT;\n        } else if (char != EOF) {\n          state = PATH;\n          if (char != '/') continue;\n        } break;\n\n      case PATH:\n        if (\n          char == EOF || char == '/' ||\n          (char == '\\\\' && isSpecial(url)) ||\n          (!stateOverride && (char == '?' || char == '#'))\n        ) {\n          if (isDoubleDot(buffer)) {\n            shortenURLsPath(url);\n            if (char != '/' && !(char == '\\\\' && isSpecial(url))) {\n              url.path.push('');\n            }\n          } else if (isSingleDot(buffer)) {\n            if (char != '/' && !(char == '\\\\' && isSpecial(url))) {\n              url.path.push('');\n            }\n          } else {\n            if (url.scheme == 'file' && !url.path.length && isWindowsDriveLetter(buffer)) {\n              if (url.host) url.host = '';\n              buffer = buffer.charAt(0) + ':'; // normalize windows drive letter\n            }\n            url.path.push(buffer);\n          }\n          buffer = '';\n          if (url.scheme == 'file' && (char == EOF || char == '?' || char == '#')) {\n            while (url.path.length > 1 && url.path[0] === '') {\n              url.path.shift();\n            }\n          }\n          if (char == '?') {\n            url.query = '';\n            state = QUERY;\n          } else if (char == '#') {\n            url.fragment = '';\n            state = FRAGMENT;\n          }\n        } else {\n          buffer += percentEncode(char, pathPercentEncodeSet);\n        } break;\n\n      case CANNOT_BE_A_BASE_URL_PATH:\n        if (char == '?') {\n          url.query = '';\n          state = QUERY;\n        } else if (char == '#') {\n          url.fragment = '';\n          state = FRAGMENT;\n        } else if (char != EOF) {\n          url.path[0] += percentEncode(char, C0ControlPercentEncodeSet);\n        } break;\n\n      case QUERY:\n        if (!stateOverride && char == '#') {\n          url.fragment = '';\n          state = FRAGMENT;\n        } else if (char != EOF) {\n          if (char == \"'\" && isSpecial(url)) url.query += '%27';\n          else if (char == '#') url.query += '%23';\n          else url.query += percentEncode(char, C0ControlPercentEncodeSet);\n        } break;\n\n      case FRAGMENT:\n        if (char != EOF) url.fragment += percentEncode(char, fragmentPercentEncodeSet);\n        break;\n    }\n\n    pointer++;\n  }\n};\n\n// `URL` constructor\n// https://url.spec.whatwg.org/#url-class\nvar URLConstructor = function URL(url /* , base */) {\n  var that = anInstance(this, URLConstructor, 'URL');\n  var base = arguments.length > 1 ? arguments[1] : undefined;\n  var urlString = String(url);\n  var state = setInternalState(that, { type: 'URL' });\n  var baseState, failure;\n  if (base !== undefined) {\n    if (base instanceof URLConstructor) baseState = getInternalURLState(base);\n    else {\n      failure = parseURL(baseState = {}, String(base));\n      if (failure) throw TypeError(failure);\n    }\n  }\n  failure = parseURL(state, urlString, null, baseState);\n  if (failure) throw TypeError(failure);\n  var searchParams = state.searchParams = new URLSearchParams();\n  var searchParamsState = getInternalSearchParamsState(searchParams);\n  searchParamsState.updateSearchParams(state.query);\n  searchParamsState.updateURL = function () {\n    state.query = String(searchParams) || null;\n  };\n  if (!DESCRIPTORS) {\n    that.href = serializeURL.call(that);\n    that.origin = getOrigin.call(that);\n    that.protocol = getProtocol.call(that);\n    that.username = getUsername.call(that);\n    that.password = getPassword.call(that);\n    that.host = getHost.call(that);\n    that.hostname = getHostname.call(that);\n    that.port = getPort.call(that);\n    that.pathname = getPathname.call(that);\n    that.search = getSearch.call(that);\n    that.searchParams = getSearchParams.call(that);\n    that.hash = getHash.call(that);\n  }\n};\n\nvar URLPrototype = URLConstructor.prototype;\n\nvar serializeURL = function () {\n  var url = getInternalURLState(this);\n  var scheme = url.scheme;\n  var username = url.username;\n  var password = url.password;\n  var host = url.host;\n  var port = url.port;\n  var path = url.path;\n  var query = url.query;\n  var fragment = url.fragment;\n  var output = scheme + ':';\n  if (host !== null) {\n    output += '//';\n    if (includesCredentials(url)) {\n      output += username + (password ? ':' + password : '') + '@';\n    }\n    output += serializeHost(host);\n    if (port !== null) output += ':' + port;\n  } else if (scheme == 'file') output += '//';\n  output += url.cannotBeABaseURL ? path[0] : path.length ? '/' + path.join('/') : '';\n  if (query !== null) output += '?' + query;\n  if (fragment !== null) output += '#' + fragment;\n  return output;\n};\n\nvar getOrigin = function () {\n  var url = getInternalURLState(this);\n  var scheme = url.scheme;\n  var port = url.port;\n  if (scheme == 'blob') try {\n    return new URLConstructor(scheme.path[0]).origin;\n  } catch (error) {\n    return 'null';\n  }\n  if (scheme == 'file' || !isSpecial(url)) return 'null';\n  return scheme + '://' + serializeHost(url.host) + (port !== null ? ':' + port : '');\n};\n\nvar getProtocol = function () {\n  return getInternalURLState(this).scheme + ':';\n};\n\nvar getUsername = function () {\n  return getInternalURLState(this).username;\n};\n\nvar getPassword = function () {\n  return getInternalURLState(this).password;\n};\n\nvar getHost = function () {\n  var url = getInternalURLState(this);\n  var host = url.host;\n  var port = url.port;\n  return host === null ? ''\n    : port === null ? serializeHost(host)\n    : serializeHost(host) + ':' + port;\n};\n\nvar getHostname = function () {\n  var host = getInternalURLState(this).host;\n  return host === null ? '' : serializeHost(host);\n};\n\nvar getPort = function () {\n  var port = getInternalURLState(this).port;\n  return port === null ? '' : String(port);\n};\n\nvar getPathname = function () {\n  var url = getInternalURLState(this);\n  var path = url.path;\n  return url.cannotBeABaseURL ? path[0] : path.length ? '/' + path.join('/') : '';\n};\n\nvar getSearch = function () {\n  var query = getInternalURLState(this).query;\n  return query ? '?' + query : '';\n};\n\nvar getSearchParams = function () {\n  return getInternalURLState(this).searchParams;\n};\n\nvar getHash = function () {\n  var fragment = getInternalURLState(this).fragment;\n  return fragment ? '#' + fragment : '';\n};\n\nvar accessorDescriptor = function (getter, setter) {\n  return { get: getter, set: setter, configurable: true, enumerable: true };\n};\n\nif (DESCRIPTORS) {\n  defineProperties(URLPrototype, {\n    // `URL.prototype.href` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-href\n    href: accessorDescriptor(serializeURL, function (href) {\n      var url = getInternalURLState(this);\n      var urlString = String(href);\n      var failure = parseURL(url, urlString);\n      if (failure) throw TypeError(failure);\n      getInternalSearchParamsState(url.searchParams).updateSearchParams(url.query);\n    }),\n    // `URL.prototype.origin` getter\n    // https://url.spec.whatwg.org/#dom-url-origin\n    origin: accessorDescriptor(getOrigin),\n    // `URL.prototype.protocol` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-protocol\n    protocol: accessorDescriptor(getProtocol, function (protocol) {\n      var url = getInternalURLState(this);\n      parseURL(url, String(protocol) + ':', SCHEME_START);\n    }),\n    // `URL.prototype.username` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-username\n    username: accessorDescriptor(getUsername, function (username) {\n      var url = getInternalURLState(this);\n      var codePoints = arrayFrom(String(username));\n      if (cannotHaveUsernamePasswordPort(url)) return;\n      url.username = '';\n      for (var i = 0; i < codePoints.length; i++) {\n        url.username += percentEncode(codePoints[i], userinfoPercentEncodeSet);\n      }\n    }),\n    // `URL.prototype.password` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-password\n    password: accessorDescriptor(getPassword, function (password) {\n      var url = getInternalURLState(this);\n      var codePoints = arrayFrom(String(password));\n      if (cannotHaveUsernamePasswordPort(url)) return;\n      url.password = '';\n      for (var i = 0; i < codePoints.length; i++) {\n        url.password += percentEncode(codePoints[i], userinfoPercentEncodeSet);\n      }\n    }),\n    // `URL.prototype.host` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-host\n    host: accessorDescriptor(getHost, function (host) {\n      var url = getInternalURLState(this);\n      if (url.cannotBeABaseURL) return;\n      parseURL(url, String(host), HOST);\n    }),\n    // `URL.prototype.hostname` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-hostname\n    hostname: accessorDescriptor(getHostname, function (hostname) {\n      var url = getInternalURLState(this);\n      if (url.cannotBeABaseURL) return;\n      parseURL(url, String(hostname), HOSTNAME);\n    }),\n    // `URL.prototype.port` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-port\n    port: accessorDescriptor(getPort, function (port) {\n      var url = getInternalURLState(this);\n      if (cannotHaveUsernamePasswordPort(url)) return;\n      port = String(port);\n      if (port == '') url.port = null;\n      else parseURL(url, port, PORT);\n    }),\n    // `URL.prototype.pathname` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-pathname\n    pathname: accessorDescriptor(getPathname, function (pathname) {\n      var url = getInternalURLState(this);\n      if (url.cannotBeABaseURL) return;\n      url.path = [];\n      parseURL(url, pathname + '', PATH_START);\n    }),\n    // `URL.prototype.search` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-search\n    search: accessorDescriptor(getSearch, function (search) {\n      var url = getInternalURLState(this);\n      search = String(search);\n      if (search == '') {\n        url.query = null;\n      } else {\n        if ('?' == search.charAt(0)) search = search.slice(1);\n        url.query = '';\n        parseURL(url, search, QUERY);\n      }\n      getInternalSearchParamsState(url.searchParams).updateSearchParams(url.query);\n    }),\n    // `URL.prototype.searchParams` getter\n    // https://url.spec.whatwg.org/#dom-url-searchparams\n    searchParams: accessorDescriptor(getSearchParams),\n    // `URL.prototype.hash` accessors pair\n    // https://url.spec.whatwg.org/#dom-url-hash\n    hash: accessorDescriptor(getHash, function (hash) {\n      var url = getInternalURLState(this);\n      hash = String(hash);\n      if (hash == '') {\n        url.fragment = null;\n        return;\n      }\n      if ('#' == hash.charAt(0)) hash = hash.slice(1);\n      url.fragment = '';\n      parseURL(url, hash, FRAGMENT);\n    })\n  });\n}\n\n// `URL.prototype.toJSON` method\n// https://url.spec.whatwg.org/#dom-url-tojson\nredefine(URLPrototype, 'toJSON', function toJSON() {\n  return serializeURL.call(this);\n}, { enumerable: true });\n\n// `URL.prototype.toString` method\n// https://url.spec.whatwg.org/#URL-stringification-behavior\nredefine(URLPrototype, 'toString', function toString() {\n  return serializeURL.call(this);\n}, { enumerable: true });\n\nif (NativeURL) {\n  var nativeCreateObjectURL = NativeURL.createObjectURL;\n  var nativeRevokeObjectURL = NativeURL.revokeObjectURL;\n  // `URL.createObjectURL` method\n  // https://developer.mozilla.org/en-US/docs/Web/API/URL/createObjectURL\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  if (nativeCreateObjectURL) redefine(URLConstructor, 'createObjectURL', function createObjectURL(blob) {\n    return nativeCreateObjectURL.apply(NativeURL, arguments);\n  });\n  // `URL.revokeObjectURL` method\n  // https://developer.mozilla.org/en-US/docs/Web/API/URL/revokeObjectURL\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  if (nativeRevokeObjectURL) redefine(URLConstructor, 'revokeObjectURL', function revokeObjectURL(url) {\n    return nativeRevokeObjectURL.apply(NativeURL, arguments);\n  });\n}\n\nsetToStringTag(URLConstructor, 'URL');\n\n$({ global: true, forced: !USE_NATIVE_URL, sham: !DESCRIPTORS }, {\n  URL: URLConstructor\n});\n","(function (global) {\n  'use strict';\n\n  function fetchPonyfill(options) {\n    var Promise = options && options.Promise || global.Promise;\n    var XMLHttpRequest = options && options.XMLHttpRequest || global.XMLHttpRequest;\n\n    return (function () {\n      var globalThis = Object.create(global, {\n        fetch: {\n          value: undefined,\n          writable: true\n        }\n      });\n\n      (function (global, factory) {\n        typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n        typeof define === 'function' && define.amd ? define(['exports'], factory) :\n        (factory((global.WHATWGFetch = {})));\n      }(this, (function (exports) { 'use strict';\n\n        var global =\n          (typeof globalThis !== 'undefined' && globalThis) ||\n          (typeof self !== 'undefined' && self) ||\n          (typeof global !== 'undefined' && global);\n\n        var support = {\n          searchParams: 'URLSearchParams' in global,\n          iterable: 'Symbol' in global && 'iterator' in Symbol,\n          blob:\n            'FileReader' in global &&\n            'Blob' in global &&\n            (function() {\n              try {\n                new Blob();\n                return true\n              } catch (e) {\n                return false\n              }\n            })(),\n          formData: 'FormData' in global,\n          arrayBuffer: 'ArrayBuffer' in global\n        };\n\n        function isDataView(obj) {\n          return obj && DataView.prototype.isPrototypeOf(obj)\n        }\n\n        if (support.arrayBuffer) {\n          var viewClasses = [\n            '[object Int8Array]',\n            '[object Uint8Array]',\n            '[object Uint8ClampedArray]',\n            '[object Int16Array]',\n            '[object Uint16Array]',\n            '[object Int32Array]',\n            '[object Uint32Array]',\n            '[object Float32Array]',\n            '[object Float64Array]'\n          ];\n\n          var isArrayBufferView =\n            ArrayBuffer.isView ||\n            function(obj) {\n              return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n            };\n        }\n\n        function normalizeName(name) {\n          if (typeof name !== 'string') {\n            name = String(name);\n          }\n          if (/[^a-z0-9\\-#$%&'*+.^_`|~!]/i.test(name) || name === '') {\n            throw new TypeError('Invalid character in header field name')\n          }\n          return name.toLowerCase()\n        }\n\n        function normalizeValue(value) {\n          if (typeof value !== 'string') {\n            value = String(value);\n          }\n          return value\n        }\n\n        // Build a destructive iterator for the value list\n        function iteratorFor(items) {\n          var iterator = {\n            next: function() {\n              var value = items.shift();\n              return {done: value === undefined, value: value}\n            }\n          };\n\n          if (support.iterable) {\n            iterator[Symbol.iterator] = function() {\n              return iterator\n            };\n          }\n\n          return iterator\n        }\n\n        function Headers(headers) {\n          this.map = {};\n\n          if (headers instanceof Headers) {\n            headers.forEach(function(value, name) {\n              this.append(name, value);\n            }, this);\n          } else if (Array.isArray(headers)) {\n            headers.forEach(function(header) {\n              this.append(header[0], header[1]);\n            }, this);\n          } else if (headers) {\n            Object.getOwnPropertyNames(headers).forEach(function(name) {\n              this.append(name, headers[name]);\n            }, this);\n          }\n        }\n\n        Headers.prototype.append = function(name, value) {\n          name = normalizeName(name);\n          value = normalizeValue(value);\n          var oldValue = this.map[name];\n          this.map[name] = oldValue ? oldValue + ', ' + value : value;\n        };\n\n        Headers.prototype['delete'] = function(name) {\n          delete this.map[normalizeName(name)];\n        };\n\n        Headers.prototype.get = function(name) {\n          name = normalizeName(name);\n          return this.has(name) ? this.map[name] : null\n        };\n\n        Headers.prototype.has = function(name) {\n          return this.map.hasOwnProperty(normalizeName(name))\n        };\n\n        Headers.prototype.set = function(name, value) {\n          this.map[normalizeName(name)] = normalizeValue(value);\n        };\n\n        Headers.prototype.forEach = function(callback, thisArg) {\n          for (var name in this.map) {\n            if (this.map.hasOwnProperty(name)) {\n              callback.call(thisArg, this.map[name], name, this);\n            }\n          }\n        };\n\n        Headers.prototype.keys = function() {\n          var items = [];\n          this.forEach(function(value, name) {\n            items.push(name);\n          });\n          return iteratorFor(items)\n        };\n\n        Headers.prototype.values = function() {\n          var items = [];\n          this.forEach(function(value) {\n            items.push(value);\n          });\n          return iteratorFor(items)\n        };\n\n        Headers.prototype.entries = function() {\n          var items = [];\n          this.forEach(function(value, name) {\n            items.push([name, value]);\n          });\n          return iteratorFor(items)\n        };\n\n        if (support.iterable) {\n          Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n        }\n\n        function consumed(body) {\n          if (body.bodyUsed) {\n            return Promise.reject(new TypeError('Already read'))\n          }\n          body.bodyUsed = true;\n        }\n\n        function fileReaderReady(reader) {\n          return new Promise(function(resolve, reject) {\n            reader.onload = function() {\n              resolve(reader.result);\n            };\n            reader.onerror = function() {\n              reject(reader.error);\n            };\n          })\n        }\n\n        function readBlobAsArrayBuffer(blob) {\n          var reader = new FileReader();\n          var promise = fileReaderReady(reader);\n          reader.readAsArrayBuffer(blob);\n          return promise\n        }\n\n        function readBlobAsText(blob) {\n          var reader = new FileReader();\n          var promise = fileReaderReady(reader);\n          reader.readAsText(blob);\n          return promise\n        }\n\n        function readArrayBufferAsText(buf) {\n          var view = new Uint8Array(buf);\n          var chars = new Array(view.length);\n\n          for (var i = 0; i < view.length; i++) {\n            chars[i] = String.fromCharCode(view[i]);\n          }\n          return chars.join('')\n        }\n\n        function bufferClone(buf) {\n          if (buf.slice) {\n            return buf.slice(0)\n          } else {\n            var view = new Uint8Array(buf.byteLength);\n            view.set(new Uint8Array(buf));\n            return view.buffer\n          }\n        }\n\n        function Body() {\n          this.bodyUsed = false;\n\n          this._initBody = function(body) {\n            /*\n              fetch-mock wraps the Response object in an ES6 Proxy to\n              provide useful test harness features such as flush. However, on\n              ES5 browsers without fetch or Proxy support pollyfills must be used;\n              the proxy-pollyfill is unable to proxy an attribute unless it exists\n              on the object before the Proxy is created. This change ensures\n              Response.bodyUsed exists on the instance, while maintaining the\n              semantic of setting Request.bodyUsed in the constructor before\n              _initBody is called.\n            */\n            this.bodyUsed = this.bodyUsed;\n            this._bodyInit = body;\n            if (!body) {\n              this._bodyText = '';\n            } else if (typeof body === 'string') {\n              this._bodyText = body;\n            } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n              this._bodyBlob = body;\n            } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n              this._bodyFormData = body;\n            } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n              this._bodyText = body.toString();\n            } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n              this._bodyArrayBuffer = bufferClone(body.buffer);\n              // IE 10-11 can't handle a DataView body.\n              this._bodyInit = new Blob([this._bodyArrayBuffer]);\n            } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n              this._bodyArrayBuffer = bufferClone(body);\n            } else {\n              this._bodyText = body = Object.prototype.toString.call(body);\n            }\n\n            if (!this.headers.get('content-type')) {\n              if (typeof body === 'string') {\n                this.headers.set('content-type', 'text/plain;charset=UTF-8');\n              } else if (this._bodyBlob && this._bodyBlob.type) {\n                this.headers.set('content-type', this._bodyBlob.type);\n              } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n                this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n              }\n            }\n          };\n\n          if (support.blob) {\n            this.blob = function() {\n              var rejected = consumed(this);\n              if (rejected) {\n                return rejected\n              }\n\n              if (this._bodyBlob) {\n                return Promise.resolve(this._bodyBlob)\n              } else if (this._bodyArrayBuffer) {\n                return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n              } else if (this._bodyFormData) {\n                throw new Error('could not read FormData body as blob')\n              } else {\n                return Promise.resolve(new Blob([this._bodyText]))\n              }\n            };\n\n            this.arrayBuffer = function() {\n              if (this._bodyArrayBuffer) {\n                var isConsumed = consumed(this);\n                if (isConsumed) {\n                  return isConsumed\n                }\n                if (ArrayBuffer.isView(this._bodyArrayBuffer)) {\n                  return Promise.resolve(\n                    this._bodyArrayBuffer.buffer.slice(\n                      this._bodyArrayBuffer.byteOffset,\n                      this._bodyArrayBuffer.byteOffset + this._bodyArrayBuffer.byteLength\n                    )\n                  )\n                } else {\n                  return Promise.resolve(this._bodyArrayBuffer)\n                }\n              } else {\n                return this.blob().then(readBlobAsArrayBuffer)\n              }\n            };\n          }\n\n          this.text = function() {\n            var rejected = consumed(this);\n            if (rejected) {\n              return rejected\n            }\n\n            if (this._bodyBlob) {\n              return readBlobAsText(this._bodyBlob)\n            } else if (this._bodyArrayBuffer) {\n              return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n            } else if (this._bodyFormData) {\n              throw new Error('could not read FormData body as text')\n            } else {\n              return Promise.resolve(this._bodyText)\n            }\n          };\n\n          if (support.formData) {\n            this.formData = function() {\n              return this.text().then(decode)\n            };\n          }\n\n          this.json = function() {\n            return this.text().then(JSON.parse)\n          };\n\n          return this\n        }\n\n        // HTTP methods whose capitalization should be normalized\n        var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n        function normalizeMethod(method) {\n          var upcased = method.toUpperCase();\n          return methods.indexOf(upcased) > -1 ? upcased : method\n        }\n\n        function Request(input, options) {\n          if (!(this instanceof Request)) {\n            throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n          }\n\n          options = options || {};\n          var body = options.body;\n\n          if (input instanceof Request) {\n            if (input.bodyUsed) {\n              throw new TypeError('Already read')\n            }\n            this.url = input.url;\n            this.credentials = input.credentials;\n            if (!options.headers) {\n              this.headers = new Headers(input.headers);\n            }\n            this.method = input.method;\n            this.mode = input.mode;\n            this.signal = input.signal;\n            if (!body && input._bodyInit != null) {\n              body = input._bodyInit;\n              input.bodyUsed = true;\n            }\n          } else {\n            this.url = String(input);\n          }\n\n          this.credentials = options.credentials || this.credentials || 'same-origin';\n          if (options.headers || !this.headers) {\n            this.headers = new Headers(options.headers);\n          }\n          this.method = normalizeMethod(options.method || this.method || 'GET');\n          this.mode = options.mode || this.mode || null;\n          this.signal = options.signal || this.signal;\n          this.referrer = null;\n\n          if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n            throw new TypeError('Body not allowed for GET or HEAD requests')\n          }\n          this._initBody(body);\n\n          if (this.method === 'GET' || this.method === 'HEAD') {\n            if (options.cache === 'no-store' || options.cache === 'no-cache') {\n              // Search for a '_' parameter in the query string\n              var reParamSearch = /([?&])_=[^&]*/;\n              if (reParamSearch.test(this.url)) {\n                // If it already exists then set the value with the current time\n                this.url = this.url.replace(reParamSearch, '$1_=' + new Date().getTime());\n              } else {\n                // Otherwise add a new '_' parameter to the end with the current time\n                var reQueryString = /\\?/;\n                this.url += (reQueryString.test(this.url) ? '&' : '?') + '_=' + new Date().getTime();\n              }\n            }\n          }\n        }\n\n        Request.prototype.clone = function() {\n          return new Request(this, {body: this._bodyInit})\n        };\n\n        function decode(body) {\n          var form = new FormData();\n          body\n            .trim()\n            .split('&')\n            .forEach(function(bytes) {\n              if (bytes) {\n                var split = bytes.split('=');\n                var name = split.shift().replace(/\\+/g, ' ');\n                var value = split.join('=').replace(/\\+/g, ' ');\n                form.append(decodeURIComponent(name), decodeURIComponent(value));\n              }\n            });\n          return form\n        }\n\n        function parseHeaders(rawHeaders) {\n          var headers = new Headers();\n          // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n          // https://tools.ietf.org/html/rfc7230#section-3.2\n          var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n          // Avoiding split via regex to work around a common IE11 bug with the core-js 3.6.0 regex polyfill\n          // https://github.com/github/fetch/issues/748\n          // https://github.com/zloirock/core-js/issues/751\n          preProcessedHeaders\n            .split('\\r')\n            .map(function(header) {\n              return header.indexOf('\\n') === 0 ? header.substr(1, header.length) : header\n            })\n            .forEach(function(line) {\n              var parts = line.split(':');\n              var key = parts.shift().trim();\n              if (key) {\n                var value = parts.join(':').trim();\n                headers.append(key, value);\n              }\n            });\n          return headers\n        }\n\n        Body.call(Request.prototype);\n\n        function Response(bodyInit, options) {\n          if (!(this instanceof Response)) {\n            throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n          }\n          if (!options) {\n            options = {};\n          }\n\n          this.type = 'default';\n          this.status = options.status === undefined ? 200 : options.status;\n          this.ok = this.status >= 200 && this.status < 300;\n          this.statusText = 'statusText' in options ? options.statusText : '';\n          this.headers = new Headers(options.headers);\n          this.url = options.url || '';\n          this._initBody(bodyInit);\n        }\n\n        Body.call(Response.prototype);\n\n        Response.prototype.clone = function() {\n          return new Response(this._bodyInit, {\n            status: this.status,\n            statusText: this.statusText,\n            headers: new Headers(this.headers),\n            url: this.url\n          })\n        };\n\n        Response.error = function() {\n          var response = new Response(null, {status: 0, statusText: ''});\n          response.type = 'error';\n          return response\n        };\n\n        var redirectStatuses = [301, 302, 303, 307, 308];\n\n        Response.redirect = function(url, status) {\n          if (redirectStatuses.indexOf(status) === -1) {\n            throw new RangeError('Invalid status code')\n          }\n\n          return new Response(null, {status: status, headers: {location: url}})\n        };\n\n        exports.DOMException = global.DOMException;\n        try {\n          new exports.DOMException();\n        } catch (err) {\n          exports.DOMException = function(message, name) {\n            this.message = message;\n            this.name = name;\n            var error = Error(message);\n            this.stack = error.stack;\n          };\n          exports.DOMException.prototype = Object.create(Error.prototype);\n          exports.DOMException.prototype.constructor = exports.DOMException;\n        }\n\n        function fetch(input, init) {\n          return new Promise(function(resolve, reject) {\n            var request = new Request(input, init);\n\n            if (request.signal && request.signal.aborted) {\n              return reject(new exports.DOMException('Aborted', 'AbortError'))\n            }\n\n            var xhr = new XMLHttpRequest();\n\n            function abortXhr() {\n              xhr.abort();\n            }\n\n            xhr.onload = function() {\n              var options = {\n                status: xhr.status,\n                statusText: xhr.statusText,\n                headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n              };\n              options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n              var body = 'response' in xhr ? xhr.response : xhr.responseText;\n              setTimeout(function() {\n                resolve(new Response(body, options));\n              }, 0);\n            };\n\n            xhr.onerror = function() {\n              setTimeout(function() {\n                reject(new TypeError('Network request failed'));\n              }, 0);\n            };\n\n            xhr.ontimeout = function() {\n              setTimeout(function() {\n                reject(new TypeError('Network request failed'));\n              }, 0);\n            };\n\n            xhr.onabort = function() {\n              setTimeout(function() {\n                reject(new exports.DOMException('Aborted', 'AbortError'));\n              }, 0);\n            };\n\n            function fixUrl(url) {\n              try {\n                return url === '' && global.location.href ? global.location.href : url\n              } catch (e) {\n                return url\n              }\n            }\n\n            xhr.open(request.method, fixUrl(request.url), true);\n\n            if (request.credentials === 'include') {\n              xhr.withCredentials = true;\n            } else if (request.credentials === 'omit') {\n              xhr.withCredentials = false;\n            }\n\n            if ('responseType' in xhr) {\n              if (support.blob) {\n                xhr.responseType = 'blob';\n              } else if (\n                support.arrayBuffer &&\n                request.headers.get('Content-Type') &&\n                request.headers.get('Content-Type').indexOf('application/octet-stream') !== -1\n              ) {\n                xhr.responseType = 'arraybuffer';\n              }\n            }\n\n            if (init && typeof init.headers === 'object' && !(init.headers instanceof Headers)) {\n              Object.getOwnPropertyNames(init.headers).forEach(function(name) {\n                xhr.setRequestHeader(name, normalizeValue(init.headers[name]));\n              });\n            } else {\n              request.headers.forEach(function(value, name) {\n                xhr.setRequestHeader(name, value);\n              });\n            }\n\n            if (request.signal) {\n              request.signal.addEventListener('abort', abortXhr);\n\n              xhr.onreadystatechange = function() {\n                // DONE (success or failure)\n                if (xhr.readyState === 4) {\n                  request.signal.removeEventListener('abort', abortXhr);\n                }\n              };\n            }\n\n            xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n          })\n        }\n\n        fetch.polyfill = true;\n\n        if (!global.fetch) {\n          global.fetch = fetch;\n          global.Headers = Headers;\n          global.Request = Request;\n          global.Response = Response;\n        }\n\n        exports.Headers = Headers;\n        exports.Request = Request;\n        exports.Response = Response;\n        exports.fetch = fetch;\n\n        Object.defineProperty(exports, '__esModule', { value: true });\n\n      })));\n\n\n      return {\n        fetch: globalThis.fetch,\n        Headers: globalThis.Headers,\n        Request: globalThis.Request,\n        Response: globalThis.Response,\n        DOMException: globalThis.DOMException\n      };\n    }());\n  }\n\n  if (typeof define === 'function' && define.amd) {\n    define(function () {\n      return fetchPonyfill;\n    });\n  } else if (typeof exports === 'object') {\n    module.exports = fetchPonyfill;\n  } else {\n    global.fetchPonyfill = fetchPonyfill;\n  }\n}(typeof globalThis !== 'undefined' ? globalThis : typeof self !== 'undefined' ? self : typeof global !== 'undefined' ? global : this));\n\n","const local_atob = typeof atob === 'undefined' ? (str) => Buffer.from(str, 'base64').toString('binary') : atob;\nconst local_btoa = typeof btoa === 'undefined' ? (str) => Buffer.from(str, 'binary').toString('base64') : btoa;\nfunction string_to_bytes(str, utf8 = false) {\n    var len = str.length, bytes = new Uint8Array(utf8 ? 4 * len : len);\n    for (var i = 0, j = 0; i < len; i++) {\n        var c = str.charCodeAt(i);\n        if (utf8 && 0xd800 <= c && c <= 0xdbff) {\n            if (++i >= len)\n                throw new Error('Malformed string, low surrogate expected at position ' + i);\n            c = ((c ^ 0xd800) << 10) | 0x10000 | (str.charCodeAt(i) ^ 0xdc00);\n        }\n        else if (!utf8 && c >>> 8) {\n            throw new Error('Wide characters are not allowed.');\n        }\n        if (!utf8 || c <= 0x7f) {\n            bytes[j++] = c;\n        }\n        else if (c <= 0x7ff) {\n            bytes[j++] = 0xc0 | (c >> 6);\n            bytes[j++] = 0x80 | (c & 0x3f);\n        }\n        else if (c <= 0xffff) {\n            bytes[j++] = 0xe0 | (c >> 12);\n            bytes[j++] = 0x80 | ((c >> 6) & 0x3f);\n            bytes[j++] = 0x80 | (c & 0x3f);\n        }\n        else {\n            bytes[j++] = 0xf0 | (c >> 18);\n            bytes[j++] = 0x80 | ((c >> 12) & 0x3f);\n            bytes[j++] = 0x80 | ((c >> 6) & 0x3f);\n            bytes[j++] = 0x80 | (c & 0x3f);\n        }\n    }\n    return bytes.subarray(0, j);\n}\nfunction hex_to_bytes(str) {\n    var len = str.length;\n    if (len & 1) {\n        str = '0' + str;\n        len++;\n    }\n    var bytes = new Uint8Array(len >> 1);\n    for (var i = 0; i < len; i += 2) {\n        bytes[i >> 1] = parseInt(str.substr(i, 2), 16);\n    }\n    return bytes;\n}\nfunction base64_to_bytes(str) {\n    return string_to_bytes(local_atob(str));\n}\nfunction bytes_to_string(bytes, utf8 = false) {\n    var len = bytes.length, chars = new Array(len);\n    for (var i = 0, j = 0; i < len; i++) {\n        var b = bytes[i];\n        if (!utf8 || b < 128) {\n            chars[j++] = b;\n        }\n        else if (b >= 192 && b < 224 && i + 1 < len) {\n            chars[j++] = ((b & 0x1f) << 6) | (bytes[++i] & 0x3f);\n        }\n        else if (b >= 224 && b < 240 && i + 2 < len) {\n            chars[j++] = ((b & 0xf) << 12) | ((bytes[++i] & 0x3f) << 6) | (bytes[++i] & 0x3f);\n        }\n        else if (b >= 240 && b < 248 && i + 3 < len) {\n            var c = ((b & 7) << 18) | ((bytes[++i] & 0x3f) << 12) | ((bytes[++i] & 0x3f) << 6) | (bytes[++i] & 0x3f);\n            if (c <= 0xffff) {\n                chars[j++] = c;\n            }\n            else {\n                c ^= 0x10000;\n                chars[j++] = 0xd800 | (c >> 10);\n                chars[j++] = 0xdc00 | (c & 0x3ff);\n            }\n        }\n        else {\n            throw new Error('Malformed UTF8 character at byte offset ' + i);\n        }\n    }\n    var str = '', bs = 16384;\n    for (var i = 0; i < j; i += bs) {\n        str += String.fromCharCode.apply(String, chars.slice(i, i + bs <= j ? i + bs : j));\n    }\n    return str;\n}\nfunction bytes_to_hex(arr) {\n    var str = '';\n    for (var i = 0; i < arr.length; i++) {\n        var h = (arr[i] & 0xff).toString(16);\n        if (h.length < 2)\n            str += '0';\n        str += h;\n    }\n    return str;\n}\nfunction bytes_to_base64(arr) {\n    return local_btoa(bytes_to_string(arr));\n}\nfunction is_bytes(a) {\n    return a instanceof Uint8Array;\n}\nfunction _heap_init(heap, heapSize) {\n    const size = heap ? heap.byteLength : heapSize || 65536;\n    if (size & 0xfff || size <= 0)\n        throw new Error('heap size must be a positive integer and a multiple of 4096');\n    heap = heap || new Uint8Array(new ArrayBuffer(size));\n    return heap;\n}\nfunction _heap_write(heap, hpos, data, dpos, dlen) {\n    const hlen = heap.length - hpos;\n    const wlen = hlen < dlen ? hlen : dlen;\n    heap.set(data.subarray(dpos, dpos + wlen), hpos);\n    return wlen;\n}\nfunction joinBytes(...arg) {\n    const totalLenght = arg.reduce((sum, curr) => sum + curr.length, 0);\n    const ret = new Uint8Array(totalLenght);\n    let cursor = 0;\n    for (let i = 0; i < arg.length; i++) {\n        ret.set(arg[i], cursor);\n        cursor += arg[i].length;\n    }\n    return ret;\n}\n\n/**\n * Util exports\n */\n\nclass IllegalStateError extends Error {\n    constructor(...args) {\n        super(...args);\n    }\n}\nclass IllegalArgumentError extends Error {\n    constructor(...args) {\n        super(...args);\n    }\n}\nclass SecurityError extends Error {\n    constructor(...args) {\n        super(...args);\n    }\n}\n\n/**\n * @file {@link http://asmjs.org Asm.js} implementation of the {@link https://en.wikipedia.org/wiki/Advanced_Encryption_Standard Advanced Encryption Standard}.\n * @author Artem S Vybornov <vybornov@gmail.com>\n * @license MIT\n */\nvar AES_asm = function () {\n\n  /**\n   * Galois Field stuff init flag\n   */\n  var ginit_done = false;\n\n  /**\n   * Galois Field exponentiation and logarithm tables for 3 (the generator)\n   */\n  var gexp3, glog3;\n\n  /**\n   * Init Galois Field tables\n   */\n  function ginit() {\n    gexp3 = [],\n      glog3 = [];\n\n    var a = 1, c, d;\n    for (c = 0; c < 255; c++) {\n      gexp3[c] = a;\n\n      // Multiply by three\n      d = a & 0x80, a <<= 1, a &= 255;\n      if (d === 0x80) a ^= 0x1b;\n      a ^= gexp3[c];\n\n      // Set the log table value\n      glog3[gexp3[c]] = c;\n    }\n    gexp3[255] = gexp3[0];\n    glog3[0] = 0;\n\n    ginit_done = true;\n  }\n\n  /**\n   * Galois Field multiplication\n   * @param {number} a\n   * @param {number} b\n   * @return {number}\n   */\n  function gmul(a, b) {\n    var c = gexp3[(glog3[a] + glog3[b]) % 255];\n    if (a === 0 || b === 0) c = 0;\n    return c;\n  }\n\n  /**\n   * Galois Field reciprocal\n   * @param {number} a\n   * @return {number}\n   */\n  function ginv(a) {\n    var i = gexp3[255 - glog3[a]];\n    if (a === 0) i = 0;\n    return i;\n  }\n\n  /**\n   * AES stuff init flag\n   */\n  var aes_init_done = false;\n\n  /**\n   * Encryption, Decryption, S-Box and KeyTransform tables\n   *\n   * @type {number[]}\n   */\n  var aes_sbox;\n\n  /**\n   * @type {number[]}\n   */\n  var aes_sinv;\n\n  /**\n   * @type {number[][]}\n   */\n  var aes_enc;\n\n  /**\n   * @type {number[][]}\n   */\n  var aes_dec;\n\n  /**\n   * Init AES tables\n   */\n  function aes_init() {\n    if (!ginit_done) ginit();\n\n    // Calculates AES S-Box value\n    function _s(a) {\n      var c, s, x;\n      s = x = ginv(a);\n      for (c = 0; c < 4; c++) {\n        s = ((s << 1) | (s >>> 7)) & 255;\n        x ^= s;\n      }\n      x ^= 99;\n      return x;\n    }\n\n    // Tables\n    aes_sbox = [],\n      aes_sinv = [],\n      aes_enc = [[], [], [], []],\n      aes_dec = [[], [], [], []];\n\n    for (var i = 0; i < 256; i++) {\n      var s = _s(i);\n\n      // S-Box and its inverse\n      aes_sbox[i] = s;\n      aes_sinv[s] = i;\n\n      // Ecryption and Decryption tables\n      aes_enc[0][i] = (gmul(2, s) << 24) | (s << 16) | (s << 8) | gmul(3, s);\n      aes_dec[0][s] = (gmul(14, i) << 24) | (gmul(9, i) << 16) | (gmul(13, i) << 8) | gmul(11, i);\n      // Rotate tables\n      for (var t = 1; t < 4; t++) {\n        aes_enc[t][i] = (aes_enc[t - 1][i] >>> 8) | (aes_enc[t - 1][i] << 24);\n        aes_dec[t][s] = (aes_dec[t - 1][s] >>> 8) | (aes_dec[t - 1][s] << 24);\n      }\n    }\n\n    aes_init_done = true;\n  }\n\n  /**\n   * Asm.js module constructor.\n   *\n   * <p>\n   * Heap buffer layout by offset:\n   * <pre>\n   * 0x0000   encryption key schedule\n   * 0x0400   decryption key schedule\n   * 0x0800   sbox\n   * 0x0c00   inv sbox\n   * 0x1000   encryption tables\n   * 0x2000   decryption tables\n   * 0x3000   reserved (future GCM multiplication lookup table)\n   * 0x4000   data\n   * </pre>\n   * Don't touch anything before <code>0x400</code>.\n   * </p>\n   *\n   * @alias AES_asm\n   * @class\n   * @param foreign - <i>ignored</i>\n   * @param buffer - heap buffer to link with\n   */\n  var wrapper = function (foreign, buffer) {\n    // Init AES stuff for the first time\n    if (!aes_init_done) aes_init();\n\n    // Fill up AES tables\n    var heap = new Uint32Array(buffer);\n    heap.set(aes_sbox, 0x0800 >> 2);\n    heap.set(aes_sinv, 0x0c00 >> 2);\n    for (var i = 0; i < 4; i++) {\n      heap.set(aes_enc[i], (0x1000 + 0x400 * i) >> 2);\n      heap.set(aes_dec[i], (0x2000 + 0x400 * i) >> 2);\n    }\n\n    /**\n     * Calculate AES key schedules.\n     * @instance\n     * @memberof AES_asm\n     * @param {number} ks - key size, 4/6/8 (for 128/192/256-bit key correspondingly)\n     * @param {number} k0 - key vector components\n     * @param {number} k1 - key vector components\n     * @param {number} k2 - key vector components\n     * @param {number} k3 - key vector components\n     * @param {number} k4 - key vector components\n     * @param {number} k5 - key vector components\n     * @param {number} k6 - key vector components\n     * @param {number} k7 - key vector components\n     */\n    function set_key(ks, k0, k1, k2, k3, k4, k5, k6, k7) {\n      var ekeys = heap.subarray(0x000, 60),\n        dkeys = heap.subarray(0x100, 0x100 + 60);\n\n      // Encryption key schedule\n      ekeys.set([k0, k1, k2, k3, k4, k5, k6, k7]);\n      for (var i = ks, rcon = 1; i < 4 * ks + 28; i++) {\n        var k = ekeys[i - 1];\n        if ((i % ks === 0) || (ks === 8 && i % ks === 4)) {\n          k = aes_sbox[k >>> 24] << 24 ^ aes_sbox[k >>> 16 & 255] << 16 ^ aes_sbox[k >>> 8 & 255] << 8 ^ aes_sbox[k & 255];\n        }\n        if (i % ks === 0) {\n          k = (k << 8) ^ (k >>> 24) ^ (rcon << 24);\n          rcon = (rcon << 1) ^ ((rcon & 0x80) ? 0x1b : 0);\n        }\n        ekeys[i] = ekeys[i - ks] ^ k;\n      }\n\n      // Decryption key schedule\n      for (var j = 0; j < i; j += 4) {\n        for (var jj = 0; jj < 4; jj++) {\n          var k = ekeys[i - (4 + j) + (4 - jj) % 4];\n          if (j < 4 || j >= i - 4) {\n            dkeys[j + jj] = k;\n          } else {\n            dkeys[j + jj] = aes_dec[0][aes_sbox[k >>> 24]]\n              ^ aes_dec[1][aes_sbox[k >>> 16 & 255]]\n              ^ aes_dec[2][aes_sbox[k >>> 8 & 255]]\n              ^ aes_dec[3][aes_sbox[k & 255]];\n          }\n        }\n      }\n\n      // Set rounds number\n      asm.set_rounds(ks + 5);\n    }\n\n    // create library object with necessary properties\n    var stdlib = {Uint8Array: Uint8Array, Uint32Array: Uint32Array};\n\n    var asm = function (stdlib, foreign, buffer) {\n      \"use asm\";\n\n      var S0 = 0, S1 = 0, S2 = 0, S3 = 0,\n        I0 = 0, I1 = 0, I2 = 0, I3 = 0,\n        N0 = 0, N1 = 0, N2 = 0, N3 = 0,\n        M0 = 0, M1 = 0, M2 = 0, M3 = 0,\n        H0 = 0, H1 = 0, H2 = 0, H3 = 0,\n        R = 0;\n\n      var HEAP = new stdlib.Uint32Array(buffer),\n        DATA = new stdlib.Uint8Array(buffer);\n\n      /**\n       * AES core\n       * @param {number} k - precomputed key schedule offset\n       * @param {number} s - precomputed sbox table offset\n       * @param {number} t - precomputed round table offset\n       * @param {number} r - number of inner rounds to perform\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _core(k, s, t, r, x0, x1, x2, x3) {\n        k = k | 0;\n        s = s | 0;\n        t = t | 0;\n        r = r | 0;\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        var t1 = 0, t2 = 0, t3 = 0,\n          y0 = 0, y1 = 0, y2 = 0, y3 = 0,\n          i = 0;\n\n        t1 = t | 0x400, t2 = t | 0x800, t3 = t | 0xc00;\n\n        // round 0\n        x0 = x0 ^ HEAP[(k | 0) >> 2],\n          x1 = x1 ^ HEAP[(k | 4) >> 2],\n          x2 = x2 ^ HEAP[(k | 8) >> 2],\n          x3 = x3 ^ HEAP[(k | 12) >> 2];\n\n        // round 1..r\n        for (i = 16; (i | 0) <= (r << 4); i = (i + 16) | 0) {\n          y0 = HEAP[(t | x0 >> 22 & 1020) >> 2] ^ HEAP[(t1 | x1 >> 14 & 1020) >> 2] ^ HEAP[(t2 | x2 >> 6 & 1020) >> 2] ^ HEAP[(t3 | x3 << 2 & 1020) >> 2] ^ HEAP[(k | i | 0) >> 2],\n            y1 = HEAP[(t | x1 >> 22 & 1020) >> 2] ^ HEAP[(t1 | x2 >> 14 & 1020) >> 2] ^ HEAP[(t2 | x3 >> 6 & 1020) >> 2] ^ HEAP[(t3 | x0 << 2 & 1020) >> 2] ^ HEAP[(k | i | 4) >> 2],\n            y2 = HEAP[(t | x2 >> 22 & 1020) >> 2] ^ HEAP[(t1 | x3 >> 14 & 1020) >> 2] ^ HEAP[(t2 | x0 >> 6 & 1020) >> 2] ^ HEAP[(t3 | x1 << 2 & 1020) >> 2] ^ HEAP[(k | i | 8) >> 2],\n            y3 = HEAP[(t | x3 >> 22 & 1020) >> 2] ^ HEAP[(t1 | x0 >> 14 & 1020) >> 2] ^ HEAP[(t2 | x1 >> 6 & 1020) >> 2] ^ HEAP[(t3 | x2 << 2 & 1020) >> 2] ^ HEAP[(k | i | 12) >> 2];\n          x0 = y0, x1 = y1, x2 = y2, x3 = y3;\n        }\n\n        // final round\n        S0 = HEAP[(s | x0 >> 22 & 1020) >> 2] << 24 ^ HEAP[(s | x1 >> 14 & 1020) >> 2] << 16 ^ HEAP[(s | x2 >> 6 & 1020) >> 2] << 8 ^ HEAP[(s | x3 << 2 & 1020) >> 2] ^ HEAP[(k | i | 0) >> 2],\n          S1 = HEAP[(s | x1 >> 22 & 1020) >> 2] << 24 ^ HEAP[(s | x2 >> 14 & 1020) >> 2] << 16 ^ HEAP[(s | x3 >> 6 & 1020) >> 2] << 8 ^ HEAP[(s | x0 << 2 & 1020) >> 2] ^ HEAP[(k | i | 4) >> 2],\n          S2 = HEAP[(s | x2 >> 22 & 1020) >> 2] << 24 ^ HEAP[(s | x3 >> 14 & 1020) >> 2] << 16 ^ HEAP[(s | x0 >> 6 & 1020) >> 2] << 8 ^ HEAP[(s | x1 << 2 & 1020) >> 2] ^ HEAP[(k | i | 8) >> 2],\n          S3 = HEAP[(s | x3 >> 22 & 1020) >> 2] << 24 ^ HEAP[(s | x0 >> 14 & 1020) >> 2] << 16 ^ HEAP[(s | x1 >> 6 & 1020) >> 2] << 8 ^ HEAP[(s | x2 << 2 & 1020) >> 2] ^ HEAP[(k | i | 12) >> 2];\n      }\n\n      /**\n       * ECB mode encryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _ecb_enc(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        _core(\n          0x0000, 0x0800, 0x1000,\n          R,\n          x0,\n          x1,\n          x2,\n          x3\n        );\n      }\n\n      /**\n       * ECB mode decryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _ecb_dec(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        var t = 0;\n\n        _core(\n          0x0400, 0x0c00, 0x2000,\n          R,\n          x0,\n          x3,\n          x2,\n          x1\n        );\n\n        t = S1, S1 = S3, S3 = t;\n      }\n\n\n      /**\n       * CBC mode encryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _cbc_enc(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        _core(\n          0x0000, 0x0800, 0x1000,\n          R,\n          I0 ^ x0,\n          I1 ^ x1,\n          I2 ^ x2,\n          I3 ^ x3\n        );\n\n        I0 = S0,\n          I1 = S1,\n          I2 = S2,\n          I3 = S3;\n      }\n\n      /**\n       * CBC mode decryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _cbc_dec(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        var t = 0;\n\n        _core(\n          0x0400, 0x0c00, 0x2000,\n          R,\n          x0,\n          x3,\n          x2,\n          x1\n        );\n\n        t = S1, S1 = S3, S3 = t;\n\n        S0 = S0 ^ I0,\n          S1 = S1 ^ I1,\n          S2 = S2 ^ I2,\n          S3 = S3 ^ I3;\n\n        I0 = x0,\n          I1 = x1,\n          I2 = x2,\n          I3 = x3;\n      }\n\n      /**\n       * CFB mode encryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _cfb_enc(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        _core(\n          0x0000, 0x0800, 0x1000,\n          R,\n          I0,\n          I1,\n          I2,\n          I3\n        );\n\n        I0 = S0 = S0 ^ x0,\n          I1 = S1 = S1 ^ x1,\n          I2 = S2 = S2 ^ x2,\n          I3 = S3 = S3 ^ x3;\n      }\n\n\n      /**\n       * CFB mode decryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _cfb_dec(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        _core(\n          0x0000, 0x0800, 0x1000,\n          R,\n          I0,\n          I1,\n          I2,\n          I3\n        );\n\n        S0 = S0 ^ x0,\n          S1 = S1 ^ x1,\n          S2 = S2 ^ x2,\n          S3 = S3 ^ x3;\n\n        I0 = x0,\n          I1 = x1,\n          I2 = x2,\n          I3 = x3;\n      }\n\n      /**\n       * OFB mode encryption / decryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _ofb(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        _core(\n          0x0000, 0x0800, 0x1000,\n          R,\n          I0,\n          I1,\n          I2,\n          I3\n        );\n\n        I0 = S0,\n          I1 = S1,\n          I2 = S2,\n          I3 = S3;\n\n        S0 = S0 ^ x0,\n          S1 = S1 ^ x1,\n          S2 = S2 ^ x2,\n          S3 = S3 ^ x3;\n      }\n\n      /**\n       * CTR mode encryption / decryption\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _ctr(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        _core(\n          0x0000, 0x0800, 0x1000,\n          R,\n          N0,\n          N1,\n          N2,\n          N3\n        );\n\n        N3 = (~M3 & N3) | M3 & (N3 + 1);\n          N2 = (~M2 & N2) | M2 & (N2 + ((N3 | 0) == 0));\n          N1 = (~M1 & N1) | M1 & (N1 + ((N2 | 0) == 0));\n          N0 = (~M0 & N0) | M0 & (N0 + ((N1 | 0) == 0));\n\n        S0 = S0 ^ x0;\n          S1 = S1 ^ x1;\n          S2 = S2 ^ x2;\n          S3 = S3 ^ x3;\n      }\n\n      /**\n       * GCM mode MAC calculation\n       * @param {number} x0 - 128-bit input block vector\n       * @param {number} x1 - 128-bit input block vector\n       * @param {number} x2 - 128-bit input block vector\n       * @param {number} x3 - 128-bit input block vector\n       */\n      function _gcm_mac(x0, x1, x2, x3) {\n        x0 = x0 | 0;\n        x1 = x1 | 0;\n        x2 = x2 | 0;\n        x3 = x3 | 0;\n\n        var y0 = 0, y1 = 0, y2 = 0, y3 = 0,\n          z0 = 0, z1 = 0, z2 = 0, z3 = 0,\n          i = 0, c = 0;\n\n        x0 = x0 ^ I0,\n          x1 = x1 ^ I1,\n          x2 = x2 ^ I2,\n          x3 = x3 ^ I3;\n\n        y0 = H0 | 0,\n          y1 = H1 | 0,\n          y2 = H2 | 0,\n          y3 = H3 | 0;\n\n        for (; (i | 0) < 128; i = (i + 1) | 0) {\n          if (y0 >>> 31) {\n            z0 = z0 ^ x0,\n              z1 = z1 ^ x1,\n              z2 = z2 ^ x2,\n              z3 = z3 ^ x3;\n          }\n\n          y0 = (y0 << 1) | (y1 >>> 31),\n            y1 = (y1 << 1) | (y2 >>> 31),\n            y2 = (y2 << 1) | (y3 >>> 31),\n            y3 = (y3 << 1);\n\n          c = x3 & 1;\n\n          x3 = (x3 >>> 1) | (x2 << 31),\n            x2 = (x2 >>> 1) | (x1 << 31),\n            x1 = (x1 >>> 1) | (x0 << 31),\n            x0 = (x0 >>> 1);\n\n          if (c) x0 = x0 ^ 0xe1000000;\n        }\n\n        I0 = z0,\n          I1 = z1,\n          I2 = z2,\n          I3 = z3;\n      }\n\n      /**\n       * Set the internal rounds number.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} r - number if inner AES rounds\n       */\n      function set_rounds(r) {\n        r = r | 0;\n        R = r;\n      }\n\n      /**\n       * Populate the internal state of the module.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} s0 - state vector\n       * @param {number} s1 - state vector\n       * @param {number} s2 - state vector\n       * @param {number} s3 - state vector\n       */\n      function set_state(s0, s1, s2, s3) {\n        s0 = s0 | 0;\n        s1 = s1 | 0;\n        s2 = s2 | 0;\n        s3 = s3 | 0;\n\n        S0 = s0,\n          S1 = s1,\n          S2 = s2,\n          S3 = s3;\n      }\n\n      /**\n       * Populate the internal iv of the module.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} i0 - iv vector\n       * @param {number} i1 - iv vector\n       * @param {number} i2 - iv vector\n       * @param {number} i3 - iv vector\n       */\n      function set_iv(i0, i1, i2, i3) {\n        i0 = i0 | 0;\n        i1 = i1 | 0;\n        i2 = i2 | 0;\n        i3 = i3 | 0;\n\n        I0 = i0,\n          I1 = i1,\n          I2 = i2,\n          I3 = i3;\n      }\n\n      /**\n       * Set nonce for CTR-family modes.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} n0 - nonce vector\n       * @param {number} n1 - nonce vector\n       * @param {number} n2 - nonce vector\n       * @param {number} n3 - nonce vector\n       */\n      function set_nonce(n0, n1, n2, n3) {\n        n0 = n0 | 0;\n        n1 = n1 | 0;\n        n2 = n2 | 0;\n        n3 = n3 | 0;\n\n        N0 = n0,\n          N1 = n1,\n          N2 = n2,\n          N3 = n3;\n      }\n\n      /**\n       * Set counter mask for CTR-family modes.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} m0 - counter mask vector\n       * @param {number} m1 - counter mask vector\n       * @param {number} m2 - counter mask vector\n       * @param {number} m3 - counter mask vector\n       */\n      function set_mask(m0, m1, m2, m3) {\n        m0 = m0 | 0;\n        m1 = m1 | 0;\n        m2 = m2 | 0;\n        m3 = m3 | 0;\n\n        M0 = m0,\n          M1 = m1,\n          M2 = m2,\n          M3 = m3;\n      }\n\n      /**\n       * Set counter for CTR-family modes.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} c0 - counter vector\n       * @param {number} c1 - counter vector\n       * @param {number} c2 - counter vector\n       * @param {number} c3 - counter vector\n       */\n      function set_counter(c0, c1, c2, c3) {\n        c0 = c0 | 0;\n        c1 = c1 | 0;\n        c2 = c2 | 0;\n        c3 = c3 | 0;\n\n        N3 = (~M3 & N3) | M3 & c3,\n          N2 = (~M2 & N2) | M2 & c2,\n          N1 = (~M1 & N1) | M1 & c1,\n          N0 = (~M0 & N0) | M0 & c0;\n      }\n\n      /**\n       * Store the internal state vector into the heap.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} pos - offset where to put the data\n       * @return {number} The number of bytes have been written into the heap, always 16.\n       */\n      function get_state(pos) {\n        pos = pos | 0;\n\n        if (pos & 15) return -1;\n\n        DATA[pos | 0] = S0 >>> 24,\n          DATA[pos | 1] = S0 >>> 16 & 255,\n          DATA[pos | 2] = S0 >>> 8 & 255,\n          DATA[pos | 3] = S0 & 255,\n          DATA[pos | 4] = S1 >>> 24,\n          DATA[pos | 5] = S1 >>> 16 & 255,\n          DATA[pos | 6] = S1 >>> 8 & 255,\n          DATA[pos | 7] = S1 & 255,\n          DATA[pos | 8] = S2 >>> 24,\n          DATA[pos | 9] = S2 >>> 16 & 255,\n          DATA[pos | 10] = S2 >>> 8 & 255,\n          DATA[pos | 11] = S2 & 255,\n          DATA[pos | 12] = S3 >>> 24,\n          DATA[pos | 13] = S3 >>> 16 & 255,\n          DATA[pos | 14] = S3 >>> 8 & 255,\n          DATA[pos | 15] = S3 & 255;\n\n        return 16;\n      }\n\n      /**\n       * Store the internal iv vector into the heap.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} pos - offset where to put the data\n       * @return {number} The number of bytes have been written into the heap, always 16.\n       */\n      function get_iv(pos) {\n        pos = pos | 0;\n\n        if (pos & 15) return -1;\n\n        DATA[pos | 0] = I0 >>> 24,\n          DATA[pos | 1] = I0 >>> 16 & 255,\n          DATA[pos | 2] = I0 >>> 8 & 255,\n          DATA[pos | 3] = I0 & 255,\n          DATA[pos | 4] = I1 >>> 24,\n          DATA[pos | 5] = I1 >>> 16 & 255,\n          DATA[pos | 6] = I1 >>> 8 & 255,\n          DATA[pos | 7] = I1 & 255,\n          DATA[pos | 8] = I2 >>> 24,\n          DATA[pos | 9] = I2 >>> 16 & 255,\n          DATA[pos | 10] = I2 >>> 8 & 255,\n          DATA[pos | 11] = I2 & 255,\n          DATA[pos | 12] = I3 >>> 24,\n          DATA[pos | 13] = I3 >>> 16 & 255,\n          DATA[pos | 14] = I3 >>> 8 & 255,\n          DATA[pos | 15] = I3 & 255;\n\n        return 16;\n      }\n\n      /**\n       * GCM initialization.\n       * @instance\n       * @memberof AES_asm\n       */\n      function gcm_init() {\n        _ecb_enc(0, 0, 0, 0);\n        H0 = S0,\n          H1 = S1,\n          H2 = S2,\n          H3 = S3;\n      }\n\n      /**\n       * Perform ciphering operation on the supplied data.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} mode - block cipher mode (see {@link AES_asm} mode constants)\n       * @param {number} pos - offset of the data being processed\n       * @param {number} len - length of the data being processed\n       * @return {number} Actual amount of data have been processed.\n       */\n      function cipher(mode, pos, len) {\n        mode = mode | 0;\n        pos = pos | 0;\n        len = len | 0;\n\n        var ret = 0;\n\n        if (pos & 15) return -1;\n\n        while ((len | 0) >= 16) {\n          _cipher_modes[mode & 7](\n            DATA[pos | 0] << 24 | DATA[pos | 1] << 16 | DATA[pos | 2] << 8 | DATA[pos | 3],\n            DATA[pos | 4] << 24 | DATA[pos | 5] << 16 | DATA[pos | 6] << 8 | DATA[pos | 7],\n            DATA[pos | 8] << 24 | DATA[pos | 9] << 16 | DATA[pos | 10] << 8 | DATA[pos | 11],\n            DATA[pos | 12] << 24 | DATA[pos | 13] << 16 | DATA[pos | 14] << 8 | DATA[pos | 15]\n          );\n\n          DATA[pos | 0] = S0 >>> 24,\n            DATA[pos | 1] = S0 >>> 16 & 255,\n            DATA[pos | 2] = S0 >>> 8 & 255,\n            DATA[pos | 3] = S0 & 255,\n            DATA[pos | 4] = S1 >>> 24,\n            DATA[pos | 5] = S1 >>> 16 & 255,\n            DATA[pos | 6] = S1 >>> 8 & 255,\n            DATA[pos | 7] = S1 & 255,\n            DATA[pos | 8] = S2 >>> 24,\n            DATA[pos | 9] = S2 >>> 16 & 255,\n            DATA[pos | 10] = S2 >>> 8 & 255,\n            DATA[pos | 11] = S2 & 255,\n            DATA[pos | 12] = S3 >>> 24,\n            DATA[pos | 13] = S3 >>> 16 & 255,\n            DATA[pos | 14] = S3 >>> 8 & 255,\n            DATA[pos | 15] = S3 & 255;\n\n          ret = (ret + 16) | 0,\n            pos = (pos + 16) | 0,\n            len = (len - 16) | 0;\n        }\n\n        return ret | 0;\n      }\n\n      /**\n       * Calculates MAC of the supplied data.\n       * @instance\n       * @memberof AES_asm\n       * @param {number} mode - block cipher mode (see {@link AES_asm} mode constants)\n       * @param {number} pos - offset of the data being processed\n       * @param {number} len - length of the data being processed\n       * @return {number} Actual amount of data have been processed.\n       */\n      function mac(mode, pos, len) {\n        mode = mode | 0;\n        pos = pos | 0;\n        len = len | 0;\n\n        var ret = 0;\n\n        if (pos & 15) return -1;\n\n        while ((len | 0) >= 16) {\n          _mac_modes[mode & 1](\n            DATA[pos | 0] << 24 | DATA[pos | 1] << 16 | DATA[pos | 2] << 8 | DATA[pos | 3],\n            DATA[pos | 4] << 24 | DATA[pos | 5] << 16 | DATA[pos | 6] << 8 | DATA[pos | 7],\n            DATA[pos | 8] << 24 | DATA[pos | 9] << 16 | DATA[pos | 10] << 8 | DATA[pos | 11],\n            DATA[pos | 12] << 24 | DATA[pos | 13] << 16 | DATA[pos | 14] << 8 | DATA[pos | 15]\n          );\n\n          ret = (ret + 16) | 0,\n            pos = (pos + 16) | 0,\n            len = (len - 16) | 0;\n        }\n\n        return ret | 0;\n      }\n\n      /**\n       * AES cipher modes table (virual methods)\n       */\n      var _cipher_modes = [_ecb_enc, _ecb_dec, _cbc_enc, _cbc_dec, _cfb_enc, _cfb_dec, _ofb, _ctr];\n\n      /**\n       * AES MAC modes table (virual methods)\n       */\n      var _mac_modes = [_cbc_enc, _gcm_mac];\n\n      /**\n       * Asm.js module exports\n       */\n      return {\n        set_rounds: set_rounds,\n        set_state: set_state,\n        set_iv: set_iv,\n        set_nonce: set_nonce,\n        set_mask: set_mask,\n        set_counter: set_counter,\n        get_state: get_state,\n        get_iv: get_iv,\n        gcm_init: gcm_init,\n        cipher: cipher,\n        mac: mac,\n      };\n    }(stdlib, foreign, buffer);\n\n    asm.set_key = set_key;\n\n    return asm;\n  };\n\n  /**\n   * AES enciphering mode constants\n   * @enum {number}\n   * @const\n   */\n  wrapper.ENC = {\n    ECB: 0,\n    CBC: 2,\n    CFB: 4,\n    OFB: 6,\n    CTR: 7,\n  },\n\n    /**\n     * AES deciphering mode constants\n     * @enum {number}\n     * @const\n     */\n    wrapper.DEC = {\n      ECB: 1,\n      CBC: 3,\n      CFB: 5,\n      OFB: 6,\n      CTR: 7,\n    },\n\n    /**\n     * AES MAC mode constants\n     * @enum {number}\n     * @const\n     */\n    wrapper.MAC = {\n      CBC: 0,\n      GCM: 1,\n    };\n\n  /**\n   * Heap data offset\n   * @type {number}\n   * @const\n   */\n  wrapper.HEAP_DATA = 0x4000;\n\n  return wrapper;\n}();\n\nclass AES {\n    constructor(key, iv, padding = true, mode) {\n        this.pos = 0;\n        this.len = 0;\n        this.mode = mode;\n        // The AES \"worker\"\n        this.heap = _heap_init().subarray(AES_asm.HEAP_DATA);\n        this.asm = new AES_asm(null, this.heap.buffer);\n        // The AES object state\n        this.pos = 0;\n        this.len = 0;\n        // Key\n        const keylen = key.length;\n        if (keylen !== 16 && keylen !== 24 && keylen !== 32)\n            throw new IllegalArgumentError('illegal key size');\n        const keyview = new DataView(key.buffer, key.byteOffset, key.byteLength);\n        this.asm.set_key(keylen >> 2, keyview.getUint32(0), keyview.getUint32(4), keyview.getUint32(8), keyview.getUint32(12), keylen > 16 ? keyview.getUint32(16) : 0, keylen > 16 ? keyview.getUint32(20) : 0, keylen > 24 ? keyview.getUint32(24) : 0, keylen > 24 ? keyview.getUint32(28) : 0);\n        // IV\n        if (iv !== undefined) {\n            if (iv.length !== 16)\n                throw new IllegalArgumentError('illegal iv size');\n            let ivview = new DataView(iv.buffer, iv.byteOffset, iv.byteLength);\n            this.asm.set_iv(ivview.getUint32(0), ivview.getUint32(4), ivview.getUint32(8), ivview.getUint32(12));\n        }\n        else {\n            this.asm.set_iv(0, 0, 0, 0);\n        }\n        this.padding = padding;\n    }\n    AES_Encrypt_process(data) {\n        if (!is_bytes(data))\n            throw new TypeError(\"data isn't of expected type\");\n        let asm = this.asm;\n        let heap = this.heap;\n        let amode = AES_asm.ENC[this.mode];\n        let hpos = AES_asm.HEAP_DATA;\n        let pos = this.pos;\n        let len = this.len;\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let rpos = 0;\n        let rlen = (len + dlen) & -16;\n        let wlen = 0;\n        let result = new Uint8Array(rlen);\n        while (dlen > 0) {\n            wlen = _heap_write(heap, pos + len, data, dpos, dlen);\n            len += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.cipher(amode, hpos + pos, len);\n            if (wlen)\n                result.set(heap.subarray(pos, pos + wlen), rpos);\n            rpos += wlen;\n            if (wlen < len) {\n                pos += wlen;\n                len -= wlen;\n            }\n            else {\n                pos = 0;\n                len = 0;\n            }\n        }\n        this.pos = pos;\n        this.len = len;\n        return result;\n    }\n    AES_Encrypt_finish() {\n        let asm = this.asm;\n        let heap = this.heap;\n        let amode = AES_asm.ENC[this.mode];\n        let hpos = AES_asm.HEAP_DATA;\n        let pos = this.pos;\n        let len = this.len;\n        let plen = 16 - (len % 16);\n        let rlen = len;\n        if (this.hasOwnProperty('padding')) {\n            if (this.padding) {\n                for (let p = 0; p < plen; ++p) {\n                    heap[pos + len + p] = plen;\n                }\n                len += plen;\n                rlen = len;\n            }\n            else if (len % 16) {\n                throw new IllegalArgumentError('data length must be a multiple of the block size');\n            }\n        }\n        else {\n            len += plen;\n        }\n        const result = new Uint8Array(rlen);\n        if (len)\n            asm.cipher(amode, hpos + pos, len);\n        if (rlen)\n            result.set(heap.subarray(pos, pos + rlen));\n        this.pos = 0;\n        this.len = 0;\n        return result;\n    }\n    AES_Decrypt_process(data) {\n        if (!is_bytes(data))\n            throw new TypeError(\"data isn't of expected type\");\n        let asm = this.asm;\n        let heap = this.heap;\n        let amode = AES_asm.DEC[this.mode];\n        let hpos = AES_asm.HEAP_DATA;\n        let pos = this.pos;\n        let len = this.len;\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let rpos = 0;\n        let rlen = (len + dlen) & -16;\n        let plen = 0;\n        let wlen = 0;\n        if (this.padding) {\n            plen = len + dlen - rlen || 16;\n            rlen -= plen;\n        }\n        const result = new Uint8Array(rlen);\n        while (dlen > 0) {\n            wlen = _heap_write(heap, pos + len, data, dpos, dlen);\n            len += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.cipher(amode, hpos + pos, len - (!dlen ? plen : 0));\n            if (wlen)\n                result.set(heap.subarray(pos, pos + wlen), rpos);\n            rpos += wlen;\n            if (wlen < len) {\n                pos += wlen;\n                len -= wlen;\n            }\n            else {\n                pos = 0;\n                len = 0;\n            }\n        }\n        this.pos = pos;\n        this.len = len;\n        return result;\n    }\n    AES_Decrypt_finish() {\n        let asm = this.asm;\n        let heap = this.heap;\n        let amode = AES_asm.DEC[this.mode];\n        let hpos = AES_asm.HEAP_DATA;\n        let pos = this.pos;\n        let len = this.len;\n        let rlen = len;\n        if (len > 0) {\n            if (len % 16) {\n                if (this.hasOwnProperty('padding')) {\n                    throw new IllegalArgumentError('data length must be a multiple of the block size');\n                }\n                else {\n                    len += 16 - (len % 16);\n                }\n            }\n            asm.cipher(amode, hpos + pos, len);\n            if (this.hasOwnProperty('padding') && this.padding) {\n                let pad = heap[pos + rlen - 1];\n                if (pad < 1 || pad > 16 || pad > rlen)\n                    throw new SecurityError('bad padding');\n                let pcheck = 0;\n                for (let i = pad; i > 1; i--)\n                    pcheck |= pad ^ heap[pos + rlen - i];\n                if (pcheck)\n                    throw new SecurityError('bad padding');\n                rlen -= pad;\n            }\n        }\n        const result = new Uint8Array(rlen);\n        if (rlen > 0) {\n            result.set(heap.subarray(pos, pos + rlen));\n        }\n        this.pos = 0;\n        this.len = 0;\n        return result;\n    }\n}\n\nclass AES_CBC extends AES {\n    static encrypt(data, key, padding = true, iv) {\n        return new AES_CBC(key, iv, padding).encrypt(data);\n    }\n    static decrypt(data, key, padding = true, iv) {\n        return new AES_CBC(key, iv, padding).decrypt(data);\n    }\n    constructor(key, iv, padding = true) {\n        super(key, iv, padding, 'CBC');\n    }\n    encrypt(data) {\n        const r1 = this.AES_Encrypt_process(data);\n        const r2 = this.AES_Encrypt_finish();\n        return joinBytes(r1, r2);\n    }\n    decrypt(data) {\n        const r1 = this.AES_Decrypt_process(data);\n        const r2 = this.AES_Decrypt_finish();\n        return joinBytes(r1, r2);\n    }\n}\n\n/**\n * Counter with CBC-MAC (CCM)\n *\n * Due to JS limitations (52 bits of Number precision) maximum encrypted message length\n * is limited to ~4 PiB ( 2^52 - 16 ) per `nonce`-`key` pair.\n * That also limits `lengthSize` parameter maximum value to 7 (not 8 as described in RFC3610).\n *\n * Additional authenticated data `adata` maximum length is chosen to be no more than 65279 bytes ( 2^16 - 2^8 ),\n * which is considered enough for the most of use-cases.\n *\n * And one more important thing: in case of progressive ciphering of a data stream (in other\n * words when data can't be held in-memory at a whole and are ciphered chunk-by-chunk)\n * you have to know the `dataLength` in advance and pass that value to the cipher options.\n */\nconst _AES_CCM_adata_maxLength = 65279; // 2^16 - 2^8\nconst _AES_CCM_data_maxLength = 4503599627370480; // 2^52 - 2^4\nclass AES_CCM extends AES {\n    constructor(key, nonce, adata, tagSize = 16, dataLength) {\n        super(key, undefined, undefined, 'CCM');\n        this.counter = 1;\n        this.dataLength = -1;\n        // Tag size\n        if (tagSize < 4 || tagSize > 16 || tagSize & 1)\n            throw new IllegalArgumentError('illegal tagSize value');\n        this.tagSize = tagSize;\n        // Nonce\n        this.nonce = nonce;\n        if (nonce.length < 8 || nonce.length > 13)\n            throw new IllegalArgumentError('illegal nonce length');\n        this.lengthSize = 15 - nonce.length;\n        nonce = new Uint8Array(nonce.length + 1);\n        nonce[0] = this.lengthSize - 1;\n        nonce.set(this.nonce, 1);\n        if (dataLength < 0 || dataLength > _AES_CCM_data_maxLength || dataLength > Math.pow(2, 8 * this.lengthSize) - 16)\n            throw new IllegalArgumentError('illegal dataLength value');\n        if (adata !== undefined) {\n            if (adata.length > _AES_CCM_adata_maxLength)\n                throw new IllegalArgumentError('illegal adata length');\n            this.adata = adata.length ? adata : undefined;\n        }\n        this.dataLength = dataLength;\n        this.counter = 1;\n        this.AES_CCM_calculate_iv();\n        this.AES_CTR_set_options(nonce, this.counter, 8 * this.lengthSize);\n    }\n    static encrypt(clear, key, nonce, adata, tagsize = 16) {\n        return new AES_CCM(key, nonce, adata, tagsize, clear.length).encrypt(clear);\n    }\n    static decrypt(cipher, key, nonce, adata, tagsize = 16) {\n        return new AES_CCM(key, nonce, adata, tagsize, cipher.length - tagsize).decrypt(cipher);\n    }\n    encrypt(data) {\n        this.dataLength = data.length || 0;\n        const result1 = this.AES_CCM_Encrypt_process(data);\n        const result2 = this.AES_CCM_Encrypt_finish();\n        const result = new Uint8Array(result1.length + result2.length);\n        if (result1.length)\n            result.set(result1);\n        if (result2.length)\n            result.set(result2, result1.length);\n        return result;\n    }\n    decrypt(data) {\n        this.dataLength = data.length || 0;\n        const result1 = this.AES_CCM_Decrypt_process(data);\n        const result2 = this.AES_CCM_Decrypt_finish();\n        const result = new Uint8Array(result1.length + result2.length);\n        if (result1.length)\n            result.set(result1);\n        if (result2.length)\n            result.set(result2, result1.length);\n        return result;\n    }\n    AES_CCM_calculate_iv() {\n        const nonce = this.nonce;\n        const adata = this.adata;\n        const tagSize = this.tagSize;\n        const lengthSize = this.lengthSize;\n        const dataLength = this.dataLength;\n        const data = new Uint8Array(16 + (adata ? 2 + adata.length : 0));\n        // B0: flags(adata?, M', L'), nonce, len(data)\n        data[0] = (adata ? 64 : 0) | ((tagSize - 2) << 2) | (lengthSize - 1);\n        data.set(nonce, 1);\n        if (lengthSize > 6)\n            data[9] = ((dataLength / 0x100000000) >>> 16) & 15;\n        if (lengthSize > 5)\n            data[10] = ((dataLength / 0x100000000) >>> 8) & 255;\n        if (lengthSize > 4)\n            data[11] = (dataLength / 0x100000000) & 255;\n        if (lengthSize > 3)\n            data[12] = dataLength >>> 24;\n        if (lengthSize > 2)\n            data[13] = (dataLength >>> 16) & 255;\n        data[14] = (dataLength >>> 8) & 255;\n        data[15] = dataLength & 255;\n        // B*: len(adata), adata\n        if (adata) {\n            data[16] = (adata.length >>> 8) & 255;\n            data[17] = adata.length & 255;\n            data.set(adata, 18);\n        }\n        this._cbc_mac_process(data);\n        this.asm.get_state(AES_asm.HEAP_DATA);\n        const iv = new Uint8Array(this.heap.subarray(0, 16));\n        const ivview = new DataView(iv.buffer, iv.byteOffset, iv.byteLength);\n        this.asm.set_iv(ivview.getUint32(0), ivview.getUint32(4), ivview.getUint32(8), ivview.getUint32(12));\n    }\n    _cbc_mac_process(data) {\n        const heap = this.heap;\n        const asm = this.asm;\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let wlen = 0;\n        while (dlen > 0) {\n            wlen = _heap_write(heap, 0, data, dpos, dlen);\n            while (wlen & 15)\n                heap[wlen++] = 0;\n            dpos += wlen;\n            dlen -= wlen;\n            asm.mac(AES_asm.MAC.CBC, AES_asm.HEAP_DATA, wlen);\n        }\n    }\n    AES_CCM_Encrypt_process(data) {\n        const asm = this.asm;\n        const heap = this.heap;\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let counter = this.counter;\n        let pos = this.pos;\n        let len = this.len;\n        const rlen = (len + dlen) & -16;\n        let rpos = 0;\n        let wlen = 0;\n        if (((counter - 1) << 4) + len + dlen > _AES_CCM_data_maxLength)\n            // ??? should check against lengthSize\n            throw new RangeError('counter overflow');\n        const result = new Uint8Array(rlen);\n        while (dlen > 0) {\n            wlen = _heap_write(heap, pos + len, data, dpos, dlen);\n            len += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.mac(AES_asm.MAC.CBC, AES_asm.HEAP_DATA + pos, len);\n            wlen = asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA + pos, wlen);\n            if (wlen)\n                result.set(heap.subarray(pos, pos + wlen), rpos);\n            counter += wlen >>> 4;\n            rpos += wlen;\n            if (wlen < len) {\n                pos += wlen;\n                len -= wlen;\n            }\n            else {\n                pos = 0;\n                len = 0;\n            }\n        }\n        this.counter = counter;\n        this.pos = pos;\n        this.len = len;\n        return result;\n    }\n    AES_CCM_Encrypt_finish() {\n        const asm = this.asm;\n        const heap = this.heap;\n        const tagSize = this.tagSize;\n        const pos = this.pos;\n        const len = this.len;\n        const result = new Uint8Array(len + tagSize);\n        let i = len;\n        for (; i & 15; i++)\n            heap[pos + i] = 0;\n        asm.mac(AES_asm.MAC.CBC, AES_asm.HEAP_DATA + pos, i);\n        asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA + pos, i);\n        if (len)\n            result.set(heap.subarray(pos, pos + len));\n        asm.set_counter(0, 0, 0, 0);\n        asm.get_iv(AES_asm.HEAP_DATA);\n        asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA, 16);\n        result.set(heap.subarray(0, tagSize), len);\n        this.counter = 1;\n        this.pos = 0;\n        this.len = 0;\n        return result;\n    }\n    AES_CCM_Decrypt_process(data) {\n        let dpos = 0;\n        let dlen = data.length || 0;\n        const asm = this.asm;\n        const heap = this.heap;\n        let counter = this.counter;\n        const tagSize = this.tagSize;\n        let pos = this.pos;\n        let len = this.len;\n        let rpos = 0;\n        const rlen = len + dlen > tagSize ? (len + dlen - tagSize) & -16 : 0;\n        const tlen = len + dlen - rlen;\n        let wlen = 0;\n        if (((counter - 1) << 4) + len + dlen > _AES_CCM_data_maxLength)\n            throw new RangeError('counter overflow');\n        const result = new Uint8Array(rlen);\n        while (dlen > tlen) {\n            wlen = _heap_write(heap, pos + len, data, dpos, dlen - tlen);\n            len += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.cipher(AES_asm.DEC.CTR, AES_asm.HEAP_DATA + pos, wlen);\n            wlen = asm.mac(AES_asm.MAC.CBC, AES_asm.HEAP_DATA + pos, wlen);\n            if (wlen)\n                result.set(heap.subarray(pos, pos + wlen), rpos);\n            counter += wlen >>> 4;\n            rpos += wlen;\n            pos = 0;\n            len = 0;\n        }\n        if (dlen > 0) {\n            len += _heap_write(heap, 0, data, dpos, dlen);\n        }\n        this.counter = counter;\n        this.pos = pos;\n        this.len = len;\n        return result;\n    }\n    AES_CCM_Decrypt_finish() {\n        const asm = this.asm;\n        const heap = this.heap;\n        const tagSize = this.tagSize;\n        const pos = this.pos;\n        const len = this.len;\n        const rlen = len - tagSize;\n        if (len < tagSize)\n            throw new IllegalStateError('authentication tag not found');\n        const result = new Uint8Array(rlen);\n        const atag = new Uint8Array(heap.subarray(pos + rlen, pos + len));\n        asm.cipher(AES_asm.DEC.CTR, AES_asm.HEAP_DATA + pos, (rlen + 15) & -16);\n        result.set(heap.subarray(pos, pos + rlen));\n        let i = rlen;\n        for (; i & 15; i++)\n            heap[pos + i] = 0;\n        asm.mac(AES_asm.MAC.CBC, AES_asm.HEAP_DATA + pos, i);\n        asm.set_counter(0, 0, 0, 0);\n        asm.get_iv(AES_asm.HEAP_DATA);\n        asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA, 16);\n        let acheck = 0;\n        for (let j = 0; j < tagSize; ++j)\n            acheck |= atag[j] ^ heap[j];\n        if (acheck)\n            throw new SecurityError('data integrity check failed');\n        this.counter = 1;\n        this.pos = 0;\n        this.len = 0;\n        return result;\n    }\n    AES_CTR_set_options(nonce, counter, size) {\n        if (size < 8 || size > 48)\n            throw new IllegalArgumentError('illegal counter size');\n        const mask = Math.pow(2, size) - 1;\n        this.asm.set_mask(0, 0, (mask / 0x100000000) | 0, mask | 0);\n        const len = nonce.length;\n        if (!len || len > 16)\n            throw new IllegalArgumentError('illegal nonce size');\n        this.nonce = nonce;\n        const view = new DataView(new ArrayBuffer(16));\n        new Uint8Array(view.buffer).set(nonce);\n        this.asm.set_nonce(view.getUint32(0), view.getUint32(4), view.getUint32(8), view.getUint32(12));\n        if (counter < 0 || counter >= Math.pow(2, size))\n            throw new IllegalArgumentError('illegal counter value');\n        this.counter = counter;\n        this.asm.set_counter(0, 0, (counter / 0x100000000) | 0, counter | 0);\n    }\n}\n\nclass AES_CFB extends AES {\n    static encrypt(data, key, iv) {\n        return new AES_CFB(key, iv).encrypt(data);\n    }\n    static decrypt(data, key, iv) {\n        return new AES_CFB(key, iv).decrypt(data);\n    }\n    constructor(key, iv) {\n        super(key, iv, true, 'CFB');\n        delete this.padding;\n    }\n    encrypt(data) {\n        const r1 = this.AES_Encrypt_process(data);\n        const r2 = this.AES_Encrypt_finish();\n        return joinBytes(r1, r2);\n    }\n    decrypt(data) {\n        const r1 = this.AES_Decrypt_process(data);\n        const r2 = this.AES_Decrypt_finish();\n        return joinBytes(r1, r2);\n    }\n}\n\nclass AES_ECB extends AES {\n    static encrypt(data, key, padding = false) {\n        return new AES_ECB(key, padding).encrypt(data);\n    }\n    static decrypt(data, key, padding = false) {\n        return new AES_ECB(key, padding).decrypt(data);\n    }\n    constructor(key, padding = false) {\n        super(key, undefined, padding, 'ECB');\n    }\n    encrypt(data) {\n        const r1 = this.AES_Encrypt_process(data);\n        const r2 = this.AES_Encrypt_finish();\n        return joinBytes(r1, r2);\n    }\n    decrypt(data) {\n        const r1 = this.AES_Decrypt_process(data);\n        const r2 = this.AES_Decrypt_finish();\n        return joinBytes(r1, r2);\n    }\n}\n\nfunction mul2(data) {\n    const t = data[0] & 0x80;\n    for (let i = 0; i < 15; i++) {\n        data[i] = (data[i] << 1) ^ (data[i + 1] & 0x80 ? 1 : 0);\n    }\n    data[15] = (data[15] << 1) ^ (t ? 0x87 : 0);\n}\nclass AES_CMAC {\n    constructor(key) {\n        this.bufferLength = 0;\n        this.k = new AES_ECB(key).encrypt(new Uint8Array(16));\n        mul2(this.k);\n        this.cbc = new AES_CBC(key, new Uint8Array(16), false);\n        this.buffer = new Uint8Array(16);\n        this.result = null;\n    }\n    static bytes(data, key) {\n        return new AES_CMAC(key).process(data).finish().result;\n    }\n    process(data) {\n        if (this.bufferLength + data.length > 16) {\n            this.cbc.encrypt(this.buffer.subarray(0, this.bufferLength));\n            const offset = ((this.bufferLength + data.length - 1) & ~15) - this.bufferLength;\n            this.cbc.encrypt(data.subarray(0, offset));\n            this.buffer.set(data.subarray(offset));\n            this.bufferLength = data.length - offset;\n        }\n        else {\n            this.buffer.set(data, this.bufferLength);\n            this.bufferLength += data.length;\n        }\n        return this;\n    }\n    finish() {\n        if (this.bufferLength !== 16) {\n            this.buffer[this.bufferLength] = 0x80;\n            for (let i = this.bufferLength + 1; i < 16; i++) {\n                this.buffer[i] = 0;\n            }\n            mul2(this.k);\n        }\n        for (let i = 0; i < 16; i++) {\n            this.buffer[i] ^= this.k[i];\n        }\n        this.result = this.cbc.encrypt(this.buffer);\n        return this;\n    }\n}\n\nclass AES_CTR extends AES {\n    static encrypt(data, key, nonce) {\n        return new AES_CTR(key, nonce).encrypt(data);\n    }\n    static decrypt(data, key, nonce) {\n        return new AES_CTR(key, nonce).encrypt(data);\n    }\n    constructor(key, nonce) {\n        super(key, undefined, false, 'CTR');\n        delete this.padding;\n        this.AES_CTR_set_options(nonce);\n    }\n    encrypt(data) {\n        const r1 = this.AES_Encrypt_process(data);\n        const r2 = this.AES_Encrypt_finish();\n        return joinBytes(r1, r2);\n    }\n    decrypt(data) {\n        const r1 = this.AES_Encrypt_process(data);\n        const r2 = this.AES_Encrypt_finish();\n        return joinBytes(r1, r2);\n    }\n    AES_CTR_set_options(nonce, counter, size) {\n        if (size !== undefined) {\n            if (size < 8 || size > 48)\n                throw new IllegalArgumentError('illegal counter size');\n            let mask = Math.pow(2, size) - 1;\n            this.asm.set_mask(0, 0, (mask / 0x100000000) | 0, mask | 0);\n        }\n        else {\n            size = 48;\n            this.asm.set_mask(0, 0, 0xffff, 0xffffffff);\n        }\n        if (nonce !== undefined) {\n            let len = nonce.length;\n            if (!len || len > 16)\n                throw new IllegalArgumentError('illegal nonce size');\n            let view = new DataView(new ArrayBuffer(16));\n            new Uint8Array(view.buffer).set(nonce);\n            this.asm.set_nonce(view.getUint32(0), view.getUint32(4), view.getUint32(8), view.getUint32(12));\n        }\n        else {\n            throw new Error('nonce is required');\n        }\n        if (counter !== undefined) {\n            if (counter < 0 || counter >= Math.pow(2, size))\n                throw new IllegalArgumentError('illegal counter value');\n            this.asm.set_counter(0, 0, (counter / 0x100000000) | 0, counter | 0);\n        }\n    }\n}\n\nconst _AES_GCM_data_maxLength = 68719476704; // 2^36 - 2^5\nclass AES_GCM extends AES {\n    constructor(key, nonce, adata, tagSize = 16) {\n        super(key, undefined, false, 'CTR');\n        this.tagSize = tagSize;\n        this.gamma0 = 0;\n        this.counter = 1;\n        // Init GCM\n        this.asm.gcm_init();\n        // Tag size\n        if (this.tagSize < 4 || this.tagSize > 16)\n            throw new IllegalArgumentError('illegal tagSize value');\n        // Nonce\n        const noncelen = nonce.length || 0;\n        const noncebuf = new Uint8Array(16);\n        if (noncelen !== 12) {\n            this._gcm_mac_process(nonce);\n            this.heap[0] = 0;\n            this.heap[1] = 0;\n            this.heap[2] = 0;\n            this.heap[3] = 0;\n            this.heap[4] = 0;\n            this.heap[5] = 0;\n            this.heap[6] = 0;\n            this.heap[7] = 0;\n            this.heap[8] = 0;\n            this.heap[9] = 0;\n            this.heap[10] = 0;\n            this.heap[11] = noncelen >>> 29;\n            this.heap[12] = (noncelen >>> 21) & 255;\n            this.heap[13] = (noncelen >>> 13) & 255;\n            this.heap[14] = (noncelen >>> 5) & 255;\n            this.heap[15] = (noncelen << 3) & 255;\n            this.asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA, 16);\n            this.asm.get_iv(AES_asm.HEAP_DATA);\n            this.asm.set_iv(0, 0, 0, 0);\n            noncebuf.set(this.heap.subarray(0, 16));\n        }\n        else {\n            noncebuf.set(nonce);\n            noncebuf[15] = 1;\n        }\n        const nonceview = new DataView(noncebuf.buffer);\n        this.gamma0 = nonceview.getUint32(12);\n        this.asm.set_nonce(nonceview.getUint32(0), nonceview.getUint32(4), nonceview.getUint32(8), 0);\n        this.asm.set_mask(0, 0, 0, 0xffffffff);\n        // Associated data\n        if (adata !== undefined) {\n            if (adata.length > _AES_GCM_data_maxLength)\n                throw new IllegalArgumentError('illegal adata length');\n            if (adata.length) {\n                this.adata = adata;\n                this._gcm_mac_process(adata);\n            }\n            else {\n                this.adata = undefined;\n            }\n        }\n        else {\n            this.adata = undefined;\n        }\n        // Counter\n        if (this.counter < 1 || this.counter > 0xffffffff)\n            throw new RangeError('counter must be a positive 32-bit integer');\n        this.asm.set_counter(0, 0, 0, (this.gamma0 + this.counter) | 0);\n    }\n    static encrypt(cleartext, key, nonce, adata, tagsize) {\n        return new AES_GCM(key, nonce, adata, tagsize).encrypt(cleartext);\n    }\n    static decrypt(ciphertext, key, nonce, adata, tagsize) {\n        return new AES_GCM(key, nonce, adata, tagsize).decrypt(ciphertext);\n    }\n    encrypt(data) {\n        return this.AES_GCM_encrypt(data);\n    }\n    decrypt(data) {\n        return this.AES_GCM_decrypt(data);\n    }\n    AES_GCM_Encrypt_process(data) {\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let asm = this.asm;\n        let heap = this.heap;\n        let counter = this.counter;\n        let pos = this.pos;\n        let len = this.len;\n        let rpos = 0;\n        let rlen = (len + dlen) & -16;\n        let wlen = 0;\n        if (((counter - 1) << 4) + len + dlen > _AES_GCM_data_maxLength)\n            throw new RangeError('counter overflow');\n        const result = new Uint8Array(rlen);\n        while (dlen > 0) {\n            wlen = _heap_write(heap, pos + len, data, dpos, dlen);\n            len += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA + pos, len);\n            wlen = asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA + pos, wlen);\n            if (wlen)\n                result.set(heap.subarray(pos, pos + wlen), rpos);\n            counter += wlen >>> 4;\n            rpos += wlen;\n            if (wlen < len) {\n                pos += wlen;\n                len -= wlen;\n            }\n            else {\n                pos = 0;\n                len = 0;\n            }\n        }\n        this.counter = counter;\n        this.pos = pos;\n        this.len = len;\n        return result;\n    }\n    AES_GCM_Encrypt_finish() {\n        let asm = this.asm;\n        let heap = this.heap;\n        let counter = this.counter;\n        let tagSize = this.tagSize;\n        let adata = this.adata;\n        let pos = this.pos;\n        let len = this.len;\n        const result = new Uint8Array(len + tagSize);\n        asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA + pos, (len + 15) & -16);\n        if (len)\n            result.set(heap.subarray(pos, pos + len));\n        let i = len;\n        for (; i & 15; i++)\n            heap[pos + i] = 0;\n        asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA + pos, i);\n        const alen = adata !== undefined ? adata.length : 0;\n        const clen = ((counter - 1) << 4) + len;\n        heap[0] = 0;\n        heap[1] = 0;\n        heap[2] = 0;\n        heap[3] = alen >>> 29;\n        heap[4] = alen >>> 21;\n        heap[5] = (alen >>> 13) & 255;\n        heap[6] = (alen >>> 5) & 255;\n        heap[7] = (alen << 3) & 255;\n        heap[8] = heap[9] = heap[10] = 0;\n        heap[11] = clen >>> 29;\n        heap[12] = (clen >>> 21) & 255;\n        heap[13] = (clen >>> 13) & 255;\n        heap[14] = (clen >>> 5) & 255;\n        heap[15] = (clen << 3) & 255;\n        asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA, 16);\n        asm.get_iv(AES_asm.HEAP_DATA);\n        asm.set_counter(0, 0, 0, this.gamma0);\n        asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA, 16);\n        result.set(heap.subarray(0, tagSize), len);\n        this.counter = 1;\n        this.pos = 0;\n        this.len = 0;\n        return result;\n    }\n    AES_GCM_Decrypt_process(data) {\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let asm = this.asm;\n        let heap = this.heap;\n        let counter = this.counter;\n        let tagSize = this.tagSize;\n        let pos = this.pos;\n        let len = this.len;\n        let rpos = 0;\n        let rlen = len + dlen > tagSize ? (len + dlen - tagSize) & -16 : 0;\n        let tlen = len + dlen - rlen;\n        let wlen = 0;\n        if (((counter - 1) << 4) + len + dlen > _AES_GCM_data_maxLength)\n            throw new RangeError('counter overflow');\n        const result = new Uint8Array(rlen);\n        while (dlen > tlen) {\n            wlen = _heap_write(heap, pos + len, data, dpos, dlen - tlen);\n            len += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA + pos, wlen);\n            wlen = asm.cipher(AES_asm.DEC.CTR, AES_asm.HEAP_DATA + pos, wlen);\n            if (wlen)\n                result.set(heap.subarray(pos, pos + wlen), rpos);\n            counter += wlen >>> 4;\n            rpos += wlen;\n            pos = 0;\n            len = 0;\n        }\n        if (dlen > 0) {\n            len += _heap_write(heap, 0, data, dpos, dlen);\n        }\n        this.counter = counter;\n        this.pos = pos;\n        this.len = len;\n        return result;\n    }\n    AES_GCM_Decrypt_finish() {\n        let asm = this.asm;\n        let heap = this.heap;\n        let tagSize = this.tagSize;\n        let adata = this.adata;\n        let counter = this.counter;\n        let pos = this.pos;\n        let len = this.len;\n        let rlen = len - tagSize;\n        if (len < tagSize)\n            throw new IllegalStateError('authentication tag not found');\n        const result = new Uint8Array(rlen);\n        const atag = new Uint8Array(heap.subarray(pos + rlen, pos + len));\n        let i = rlen;\n        for (; i & 15; i++)\n            heap[pos + i] = 0;\n        asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA + pos, i);\n        asm.cipher(AES_asm.DEC.CTR, AES_asm.HEAP_DATA + pos, i);\n        if (rlen)\n            result.set(heap.subarray(pos, pos + rlen));\n        const alen = adata !== undefined ? adata.length : 0;\n        const clen = ((counter - 1) << 4) + len - tagSize;\n        heap[0] = 0;\n        heap[1] = 0;\n        heap[2] = 0;\n        heap[3] = alen >>> 29;\n        heap[4] = alen >>> 21;\n        heap[5] = (alen >>> 13) & 255;\n        heap[6] = (alen >>> 5) & 255;\n        heap[7] = (alen << 3) & 255;\n        heap[8] = heap[9] = heap[10] = 0;\n        heap[11] = clen >>> 29;\n        heap[12] = (clen >>> 21) & 255;\n        heap[13] = (clen >>> 13) & 255;\n        heap[14] = (clen >>> 5) & 255;\n        heap[15] = (clen << 3) & 255;\n        asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA, 16);\n        asm.get_iv(AES_asm.HEAP_DATA);\n        asm.set_counter(0, 0, 0, this.gamma0);\n        asm.cipher(AES_asm.ENC.CTR, AES_asm.HEAP_DATA, 16);\n        let acheck = 0;\n        for (let i = 0; i < tagSize; ++i)\n            acheck |= atag[i] ^ heap[i];\n        if (acheck)\n            throw new SecurityError('data integrity check failed');\n        this.counter = 1;\n        this.pos = 0;\n        this.len = 0;\n        return result;\n    }\n    AES_GCM_decrypt(data) {\n        const result1 = this.AES_GCM_Decrypt_process(data);\n        const result2 = this.AES_GCM_Decrypt_finish();\n        const result = new Uint8Array(result1.length + result2.length);\n        if (result1.length)\n            result.set(result1);\n        if (result2.length)\n            result.set(result2, result1.length);\n        return result;\n    }\n    AES_GCM_encrypt(data) {\n        const result1 = this.AES_GCM_Encrypt_process(data);\n        const result2 = this.AES_GCM_Encrypt_finish();\n        const result = new Uint8Array(result1.length + result2.length);\n        if (result1.length)\n            result.set(result1);\n        if (result2.length)\n            result.set(result2, result1.length);\n        return result;\n    }\n    _gcm_mac_process(data) {\n        const heap = this.heap;\n        const asm = this.asm;\n        let dpos = 0;\n        let dlen = data.length || 0;\n        let wlen = 0;\n        while (dlen > 0) {\n            wlen = _heap_write(heap, 0, data, dpos, dlen);\n            dpos += wlen;\n            dlen -= wlen;\n            while (wlen & 15)\n                heap[wlen++] = 0;\n            asm.mac(AES_asm.MAC.GCM, AES_asm.HEAP_DATA, wlen);\n        }\n    }\n}\n\nclass AES_OFB extends AES {\n    static encrypt(data, key, iv) {\n        return new AES_OFB(key, iv).encrypt(data);\n    }\n    static decrypt(data, key, iv) {\n        return new AES_OFB(key, iv).decrypt(data);\n    }\n    constructor(key, iv) {\n        super(key, iv, false, 'OFB');\n    }\n    encrypt(data) {\n        const r1 = this.AES_Encrypt_process(data);\n        const r2 = this.AES_Encrypt_finish();\n        return joinBytes(r1, r2);\n    }\n    decrypt(data) {\n        const r1 = this.AES_Decrypt_process(data);\n        const r2 = this.AES_Decrypt_finish();\n        return joinBytes(r1, r2);\n    }\n}\n\n/**\n * Integers are represented as little endian array of 32-bit limbs.\n * Limbs number is a power of 2 and a multiple of 8 (256 bits).\n * Negative values use two's complement representation.\n */\nvar bigint_asm = function ( stdlib, foreign, buffer ) {\n    \"use asm\";\n\n    var SP = 0;\n\n    var HEAP32 = new stdlib.Uint32Array(buffer);\n\n    var imul = stdlib.Math.imul;\n\n    /**\n     * Simple stack memory allocator\n     *\n     * Methods:\n     *  sreset\n     *  salloc\n     *  sfree\n     */\n\n    function sreset ( p ) {\n        p = p|0;\n        SP = p = (p + 31) & -32;\n        return p|0;\n    }\n\n    function salloc ( l ) {\n        l = l|0;\n        var p = 0; p = SP;\n        SP = p + ((l + 31) & -32)|0;\n        return p|0;\n    }\n\n    function sfree ( l ) {\n        l = l|0;\n        SP = SP - ((l + 31) & -32)|0;\n    }\n\n    /**\n     * Utility functions:\n     *  cp\n     *  z\n     */\n\n    function cp ( l, A, B ) {\n        l = l|0;\n        A = A|0;\n        B = B|0;\n\n        var i = 0;\n\n        if ( (A|0) > (B|0) ) {\n            for ( ; (i|0) < (l|0); i = (i+4)|0 ) {\n                HEAP32[(B+i)>>2] = HEAP32[(A+i)>>2];\n            }\n        }\n        else {\n            for ( i = (l-4)|0; (i|0) >= 0; i = (i-4)|0 ) {\n                HEAP32[(B+i)>>2] = HEAP32[(A+i)>>2];\n            }\n        }\n    }\n\n    function z ( l, z, A ) {\n        l = l|0;\n        z = z|0;\n        A = A|0;\n\n        var i = 0;\n\n        for ( ; (i|0) < (l|0); i = (i+4)|0 ) {\n            HEAP32[(A+i)>>2] = z;\n        }\n    }\n\n    /**\n     * Negate the argument\n     *\n     * Perform two's complement transformation:\n     *\n     *  -A = ~A + 1\n     *\n     * @param A offset of the argment being negated, 32-byte aligned\n     * @param lA length of the argument, multiple of 32\n     *\n     * @param R offset where to place the result to, 32-byte aligned\n     * @param lR length to truncate the result to, multiple of 32\n     */\n    function neg ( A, lA, R, lR ) {\n        A  =  A|0;\n        lA = lA|0;\n        R  =  R|0;\n        lR = lR|0;\n\n        var a = 0, c = 0, t = 0, r = 0, i = 0;\n\n        if ( (lR|0) <= 0 )\n            lR = lA;\n\n        if ( (lR|0) < (lA|0) )\n            lA = lR;\n\n        c = 1;\n        for ( ; (i|0) < (lA|0); i = (i+4)|0 ) {\n            a = ~HEAP32[(A+i)>>2];\n            t = (a & 0xffff) + c|0;\n            r = (a >>> 16) + (t >>> 16)|0;\n            HEAP32[(R+i)>>2] = (r << 16) | (t & 0xffff);\n            c = r >>> 16;\n        }\n\n        for ( ; (i|0) < (lR|0); i = (i+4)|0 ) {\n            HEAP32[(R+i)>>2] = (c-1)|0;\n        }\n\n        return c|0;\n    }\n\n    function cmp ( A, lA, B, lB ) {\n        A  =  A|0;\n        lA = lA|0;\n        B  =  B|0;\n        lB = lB|0;\n\n        var a = 0, b = 0, i = 0;\n\n        if ( (lA|0) > (lB|0) ) {\n            for ( i = (lA-4)|0; (i|0) >= (lB|0); i = (i-4)|0 ) {\n                if ( HEAP32[(A+i)>>2]|0 ) return 1;\n            }\n        }\n        else {\n            for ( i = (lB-4)|0; (i|0) >= (lA|0); i = (i-4)|0 ) {\n                if ( HEAP32[(B+i)>>2]|0 ) return -1;\n            }\n        }\n\n        for ( ; (i|0) >= 0; i = (i-4)|0 ) {\n            a = HEAP32[(A+i)>>2]|0, b = HEAP32[(B+i)>>2]|0;\n            if ( (a>>>0) < (b>>>0) ) return -1;\n            if ( (a>>>0) > (b>>>0) ) return 1;\n        }\n\n        return 0;\n    }\n\n    /**\n     * Test the argument\n     *\n     * Same as `cmp` with zero.\n     */\n    function tst ( A, lA ) {\n        A  =  A|0;\n        lA = lA|0;\n\n        var i = 0;\n\n        for ( i = (lA-4)|0; (i|0) >= 0; i = (i-4)|0 ) {\n            if ( HEAP32[(A+i)>>2]|0 ) return (i+4)|0;\n        }\n\n        return 0;\n    }\n\n    /**\n     * Conventional addition\n     *\n     * @param A offset of the first argument, 32-byte aligned\n     * @param lA length of the first argument, multiple of 32\n     *\n     * @param B offset of the second argument, 32-bit aligned\n     * @param lB length of the second argument, multiple of 32\n     *\n     * @param R offset where to place the result to, 32-byte aligned\n     * @param lR length to truncate the result to, multiple of 32\n     */\n    function add ( A, lA, B, lB, R, lR ) {\n        A  =  A|0;\n        lA = lA|0;\n        B  =  B|0;\n        lB = lB|0;\n        R  =  R|0;\n        lR = lR|0;\n\n        var a = 0, b = 0, c = 0, t = 0, r = 0, i = 0;\n\n        if ( (lA|0) < (lB|0) ) {\n            t = A, A = B, B = t;\n            t = lA, lA = lB, lB = t;\n        }\n\n        if ( (lR|0) <= 0 )\n            lR = lA+4|0;\n\n        if ( (lR|0) < (lB|0) )\n            lA = lB = lR;\n\n        for ( ; (i|0) < (lB|0); i = (i+4)|0 ) {\n            a = HEAP32[(A+i)>>2]|0;\n            b = HEAP32[(B+i)>>2]|0;\n            t = ( (a & 0xffff) + (b & 0xffff)|0 ) + c|0;\n            r = ( (a >>> 16) + (b >>> 16)|0 ) + (t >>> 16)|0;\n            HEAP32[(R+i)>>2] = (t & 0xffff) | (r << 16);\n            c = r >>> 16;\n        }\n\n        for ( ; (i|0) < (lA|0); i = (i+4)|0 ) {\n            a = HEAP32[(A+i)>>2]|0;\n            t = (a & 0xffff) + c|0;\n            r = (a >>> 16) + (t >>> 16)|0;\n            HEAP32[(R+i)>>2] = (t & 0xffff) | (r << 16);\n            c = r >>> 16;\n        }\n\n        for ( ; (i|0) < (lR|0); i = (i+4)|0 ) {\n            HEAP32[(R+i)>>2] = c|0;\n            c = 0;\n        }\n\n        return c|0;\n    }\n\n   /**\n     * Conventional subtraction\n     *\n     * @param A offset of the first argument, 32-byte aligned\n     * @param lA length of the first argument, multiple of 32\n     *\n     * @param B offset of the second argument, 32-bit aligned\n     * @param lB length of the second argument, multiple of 32\n     *\n     * @param R offset where to place the result to, 32-byte aligned\n     * @param lR length to truncate the result to, multiple of 32\n     */\n    function sub ( A, lA, B, lB, R, lR ) {\n        A  =  A|0;\n        lA = lA|0;\n        B  =  B|0;\n        lB = lB|0;\n        R  =  R|0;\n        lR = lR|0;\n\n        var a = 0, b = 0, c = 0, t = 0, r = 0, i = 0;\n\n        if ( (lR|0) <= 0 )\n            lR = (lA|0) > (lB|0) ? lA+4|0 : lB+4|0;\n\n        if ( (lR|0) < (lA|0) )\n            lA = lR;\n\n        if ( (lR|0) < (lB|0) )\n            lB = lR;\n\n        if ( (lA|0) < (lB|0) ) {\n            for ( ; (i|0) < (lA|0); i = (i+4)|0 ) {\n                a = HEAP32[(A+i)>>2]|0;\n                b = HEAP32[(B+i)>>2]|0;\n                t = ( (a & 0xffff) - (b & 0xffff)|0 ) + c|0;\n                r = ( (a >>> 16) - (b >>> 16)|0 ) + (t >> 16)|0;\n                HEAP32[(R+i)>>2] = (t & 0xffff) | (r << 16);\n                c = r >> 16;\n            }\n\n            for ( ; (i|0) < (lB|0); i = (i+4)|0 ) {\n                b = HEAP32[(B+i)>>2]|0;\n                t = c - (b & 0xffff)|0;\n                r = (t >> 16) - (b >>> 16)|0;\n                HEAP32[(R+i)>>2] = (t & 0xffff) | (r << 16);\n                c = r >> 16;\n            }\n        }\n        else {\n            for ( ; (i|0) < (lB|0); i = (i+4)|0 ) {\n                a = HEAP32[(A+i)>>2]|0;\n                b = HEAP32[(B+i)>>2]|0;\n                t = ( (a & 0xffff) - (b & 0xffff)|0 ) + c|0;\n                r = ( (a >>> 16) - (b >>> 16)|0 ) + (t >> 16)|0;\n                HEAP32[(R+i)>>2] = (t & 0xffff) | (r << 16);\n                c = r >> 16;\n            }\n\n            for ( ; (i|0) < (lA|0); i = (i+4)|0 ) {\n                a = HEAP32[(A+i)>>2]|0;\n                t = (a & 0xffff) + c|0;\n                r = (a >>> 16) + (t >> 16)|0;\n                HEAP32[(R+i)>>2] = (t & 0xffff) | (r << 16);\n                c = r >> 16;\n            }\n        }\n\n        for ( ; (i|0) < (lR|0); i = (i+4)|0 ) {\n            HEAP32[(R+i)>>2] = c|0;\n        }\n\n        return c|0;\n    }\n\n    /**\n     * Conventional multiplication\n     *\n     * TODO implement Karatsuba algorithm for large multiplicands\n     *\n     * @param A offset of the first argument, 32-byte aligned\n     * @param lA length of the first argument, multiple of 32\n     *\n     * @param B offset of the second argument, 32-byte aligned\n     * @param lB length of the second argument, multiple of 32\n     *\n     * @param R offset where to place the result to, 32-byte aligned\n     * @param lR length to truncate the result to, multiple of 32\n     */\n    function mul ( A, lA, B, lB, R, lR ) {\n        A  =  A|0;\n        lA = lA|0;\n        B  =  B|0;\n        lB = lB|0;\n        R  =  R|0;\n        lR = lR|0;\n\n        var al0 = 0, al1 = 0, al2 = 0, al3 = 0, al4 = 0, al5 = 0, al6 = 0, al7 = 0, ah0 = 0, ah1 = 0, ah2 = 0, ah3 = 0, ah4 = 0, ah5 = 0, ah6 = 0, ah7 = 0,\n            bl0 = 0, bl1 = 0, bl2 = 0, bl3 = 0, bl4 = 0, bl5 = 0, bl6 = 0, bl7 = 0, bh0 = 0, bh1 = 0, bh2 = 0, bh3 = 0, bh4 = 0, bh5 = 0, bh6 = 0, bh7 = 0,\n            r0 = 0, r1 = 0, r2 = 0, r3 = 0, r4 = 0, r5 = 0, r6 = 0, r7 = 0, r8 = 0, r9 = 0, r10 = 0, r11 = 0, r12 = 0, r13 = 0, r14 = 0, r15 = 0,\n            u = 0, v = 0, w = 0, m = 0,\n            i = 0, Ai = 0, j = 0, Bj = 0, Rk = 0;\n\n        if ( (lA|0) > (lB|0) ) {\n            u = A, v = lA;\n            A = B, lA = lB;\n            B = u, lB = v;\n        }\n\n        m = (lA+lB)|0;\n        if ( ( (lR|0) > (m|0) ) | ( (lR|0) <= 0 ) )\n            lR = m;\n\n        if ( (lR|0) < (lA|0) )\n            lA = lR;\n\n        if ( (lR|0) < (lB|0) )\n            lB = lR;\n\n        for ( ; (i|0) < (lA|0); i = (i+32)|0 ) {\n            Ai = (A+i)|0;\n\n            ah0 = HEAP32[(Ai|0)>>2]|0,\n            ah1 = HEAP32[(Ai|4)>>2]|0,\n            ah2 = HEAP32[(Ai|8)>>2]|0,\n            ah3 = HEAP32[(Ai|12)>>2]|0,\n            ah4 = HEAP32[(Ai|16)>>2]|0,\n            ah5 = HEAP32[(Ai|20)>>2]|0,\n            ah6 = HEAP32[(Ai|24)>>2]|0,\n            ah7 = HEAP32[(Ai|28)>>2]|0,\n            al0 = ah0 & 0xffff,\n            al1 = ah1 & 0xffff,\n            al2 = ah2 & 0xffff,\n            al3 = ah3 & 0xffff,\n            al4 = ah4 & 0xffff,\n            al5 = ah5 & 0xffff,\n            al6 = ah6 & 0xffff,\n            al7 = ah7 & 0xffff,\n            ah0 = ah0 >>> 16,\n            ah1 = ah1 >>> 16,\n            ah2 = ah2 >>> 16,\n            ah3 = ah3 >>> 16,\n            ah4 = ah4 >>> 16,\n            ah5 = ah5 >>> 16,\n            ah6 = ah6 >>> 16,\n            ah7 = ah7 >>> 16;\n\n            r8 = r9 = r10 = r11 = r12 = r13 = r14 = r15 = 0;\n\n            for ( j = 0; (j|0) < (lB|0); j = (j+32)|0 ) {\n                Bj = (B+j)|0;\n                Rk = (R+(i+j|0))|0;\n\n                bh0 = HEAP32[(Bj|0)>>2]|0,\n                bh1 = HEAP32[(Bj|4)>>2]|0,\n                bh2 = HEAP32[(Bj|8)>>2]|0,\n                bh3 = HEAP32[(Bj|12)>>2]|0,\n                bh4 = HEAP32[(Bj|16)>>2]|0,\n                bh5 = HEAP32[(Bj|20)>>2]|0,\n                bh6 = HEAP32[(Bj|24)>>2]|0,\n                bh7 = HEAP32[(Bj|28)>>2]|0,\n                bl0 = bh0 & 0xffff,\n                bl1 = bh1 & 0xffff,\n                bl2 = bh2 & 0xffff,\n                bl3 = bh3 & 0xffff,\n                bl4 = bh4 & 0xffff,\n                bl5 = bh5 & 0xffff,\n                bl6 = bh6 & 0xffff,\n                bl7 = bh7 & 0xffff,\n                bh0 = bh0 >>> 16,\n                bh1 = bh1 >>> 16,\n                bh2 = bh2 >>> 16,\n                bh3 = bh3 >>> 16,\n                bh4 = bh4 >>> 16,\n                bh5 = bh5 >>> 16,\n                bh6 = bh6 >>> 16,\n                bh7 = bh7 >>> 16;\n\n                r0 = HEAP32[(Rk|0)>>2]|0,\n                r1 = HEAP32[(Rk|4)>>2]|0,\n                r2 = HEAP32[(Rk|8)>>2]|0,\n                r3 = HEAP32[(Rk|12)>>2]|0,\n                r4 = HEAP32[(Rk|16)>>2]|0,\n                r5 = HEAP32[(Rk|20)>>2]|0,\n                r6 = HEAP32[(Rk|24)>>2]|0,\n                r7 = HEAP32[(Rk|28)>>2]|0;\n\n                u = ((imul(al0, bl0)|0) + (r8 & 0xffff)|0) + (r0 & 0xffff)|0;\n                v = ((imul(ah0, bl0)|0) + (r8 >>> 16)|0) + (r0 >>> 16)|0;\n                w = ((imul(al0, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r0 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl1)|0) + (m & 0xffff)|0) + (r1 & 0xffff)|0;\n                v = ((imul(ah0, bl1)|0) + (m >>> 16)|0) + (r1 >>> 16)|0;\n                w = ((imul(al0, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r1 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl2)|0) + (m & 0xffff)|0) + (r2 & 0xffff)|0;\n                v = ((imul(ah0, bl2)|0) + (m >>> 16)|0) + (r2 >>> 16)|0;\n                w = ((imul(al0, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r2 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl3)|0) + (m & 0xffff)|0) + (r3 & 0xffff)|0;\n                v = ((imul(ah0, bl3)|0) + (m >>> 16)|0) + (r3 >>> 16)|0;\n                w = ((imul(al0, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r3 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl4)|0) + (m & 0xffff)|0) + (r4 & 0xffff)|0;\n                v = ((imul(ah0, bl4)|0) + (m >>> 16)|0) + (r4 >>> 16)|0;\n                w = ((imul(al0, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r4 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl5)|0) + (m & 0xffff)|0) + (r5 & 0xffff)|0;\n                v = ((imul(ah0, bl5)|0) + (m >>> 16)|0) + (r5 >>> 16)|0;\n                w = ((imul(al0, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r5 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl6)|0) + (m & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah0, bl6)|0) + (m >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al0, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al0, bl7)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah0, bl7)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al0, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                r8 = m;\n\n                u = ((imul(al1, bl0)|0) + (r9 & 0xffff)|0) + (r1 & 0xffff)|0;\n                v = ((imul(ah1, bl0)|0) + (r9 >>> 16)|0) + (r1 >>> 16)|0;\n                w = ((imul(al1, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r1 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl1)|0) + (m & 0xffff)|0) + (r2 & 0xffff)|0;\n                v = ((imul(ah1, bl1)|0) + (m >>> 16)|0) + (r2 >>> 16)|0;\n                w = ((imul(al1, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r2 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl2)|0) + (m & 0xffff)|0) + (r3 & 0xffff)|0;\n                v = ((imul(ah1, bl2)|0) + (m >>> 16)|0) + (r3 >>> 16)|0;\n                w = ((imul(al1, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r3 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl3)|0) + (m & 0xffff)|0) + (r4 & 0xffff)|0;\n                v = ((imul(ah1, bl3)|0) + (m >>> 16)|0) + (r4 >>> 16)|0;\n                w = ((imul(al1, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r4 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl4)|0) + (m & 0xffff)|0) + (r5 & 0xffff)|0;\n                v = ((imul(ah1, bl4)|0) + (m >>> 16)|0) + (r5 >>> 16)|0;\n                w = ((imul(al1, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r5 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl5)|0) + (m & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah1, bl5)|0) + (m >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al1, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl6)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah1, bl6)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al1, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al1, bl7)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah1, bl7)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al1, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah1, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                r9 = m;\n\n                u = ((imul(al2, bl0)|0) + (r10 & 0xffff)|0) + (r2 & 0xffff)|0;\n                v = ((imul(ah2, bl0)|0) + (r10 >>> 16)|0) + (r2 >>> 16)|0;\n                w = ((imul(al2, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r2 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl1)|0) + (m & 0xffff)|0) + (r3 & 0xffff)|0;\n                v = ((imul(ah2, bl1)|0) + (m >>> 16)|0) + (r3 >>> 16)|0;\n                w = ((imul(al2, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r3 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl2)|0) + (m & 0xffff)|0) + (r4 & 0xffff)|0;\n                v = ((imul(ah2, bl2)|0) + (m >>> 16)|0) + (r4 >>> 16)|0;\n                w = ((imul(al2, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r4 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl3)|0) + (m & 0xffff)|0) + (r5 & 0xffff)|0;\n                v = ((imul(ah2, bl3)|0) + (m >>> 16)|0) + (r5 >>> 16)|0;\n                w = ((imul(al2, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r5 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl4)|0) + (m & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah2, bl4)|0) + (m >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al2, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl5)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah2, bl5)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al2, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl6)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah2, bl6)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al2, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al2, bl7)|0) + (m & 0xffff)|0) + (r9 & 0xffff)|0;\n                v = ((imul(ah2, bl7)|0) + (m >>> 16)|0) + (r9 >>> 16)|0;\n                w = ((imul(al2, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah2, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r9 = (w << 16) | (u & 0xffff);\n\n                r10 = m;\n\n                u = ((imul(al3, bl0)|0) + (r11 & 0xffff)|0) + (r3 & 0xffff)|0;\n                v = ((imul(ah3, bl0)|0) + (r11 >>> 16)|0) + (r3 >>> 16)|0;\n                w = ((imul(al3, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r3 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl1)|0) + (m & 0xffff)|0) + (r4 & 0xffff)|0;\n                v = ((imul(ah3, bl1)|0) + (m >>> 16)|0) + (r4 >>> 16)|0;\n                w = ((imul(al3, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r4 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl2)|0) + (m & 0xffff)|0) + (r5 & 0xffff)|0;\n                v = ((imul(ah3, bl2)|0) + (m >>> 16)|0) + (r5 >>> 16)|0;\n                w = ((imul(al3, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r5 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl3)|0) + (m & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah3, bl3)|0) + (m >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al3, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl4)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah3, bl4)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al3, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl5)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah3, bl5)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al3, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl6)|0) + (m & 0xffff)|0) + (r9 & 0xffff)|0;\n                v = ((imul(ah3, bl6)|0) + (m >>> 16)|0) + (r9 >>> 16)|0;\n                w = ((imul(al3, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r9 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al3, bl7)|0) + (m & 0xffff)|0) + (r10 & 0xffff)|0;\n                v = ((imul(ah3, bl7)|0) + (m >>> 16)|0) + (r10 >>> 16)|0;\n                w = ((imul(al3, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah3, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r10 = (w << 16) | (u & 0xffff);\n\n                r11 = m;\n\n                u = ((imul(al4, bl0)|0) + (r12 & 0xffff)|0) + (r4 & 0xffff)|0;\n                v = ((imul(ah4, bl0)|0) + (r12 >>> 16)|0) + (r4 >>> 16)|0;\n                w = ((imul(al4, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r4 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl1)|0) + (m & 0xffff)|0) + (r5 & 0xffff)|0;\n                v = ((imul(ah4, bl1)|0) + (m >>> 16)|0) + (r5 >>> 16)|0;\n                w = ((imul(al4, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r5 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl2)|0) + (m & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah4, bl2)|0) + (m >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al4, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl3)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah4, bl3)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al4, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl4)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah4, bl4)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al4, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl5)|0) + (m & 0xffff)|0) + (r9 & 0xffff)|0;\n                v = ((imul(ah4, bl5)|0) + (m >>> 16)|0) + (r9 >>> 16)|0;\n                w = ((imul(al4, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r9 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl6)|0) + (m & 0xffff)|0) + (r10 & 0xffff)|0;\n                v = ((imul(ah4, bl6)|0) + (m >>> 16)|0) + (r10 >>> 16)|0;\n                w = ((imul(al4, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r10 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al4, bl7)|0) + (m & 0xffff)|0) + (r11 & 0xffff)|0;\n                v = ((imul(ah4, bl7)|0) + (m >>> 16)|0) + (r11 >>> 16)|0;\n                w = ((imul(al4, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah4, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r11 = (w << 16) | (u & 0xffff);\n\n                r12 = m;\n\n                u = ((imul(al5, bl0)|0) + (r13 & 0xffff)|0) + (r5 & 0xffff)|0;\n                v = ((imul(ah5, bl0)|0) + (r13 >>> 16)|0) + (r5 >>> 16)|0;\n                w = ((imul(al5, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r5 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl1)|0) + (m & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah5, bl1)|0) + (m >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al5, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl2)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah5, bl2)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al5, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl3)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah5, bl3)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al5, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl4)|0) + (m & 0xffff)|0) + (r9 & 0xffff)|0;\n                v = ((imul(ah5, bl4)|0) + (m >>> 16)|0) + (r9 >>> 16)|0;\n                w = ((imul(al5, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r9 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl5)|0) + (m & 0xffff)|0) + (r10 & 0xffff)|0;\n                v = ((imul(ah5, bl5)|0) + (m >>> 16)|0) + (r10 >>> 16)|0;\n                w = ((imul(al5, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r10 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl6)|0) + (m & 0xffff)|0) + (r11 & 0xffff)|0;\n                v = ((imul(ah5, bl6)|0) + (m >>> 16)|0) + (r11 >>> 16)|0;\n                w = ((imul(al5, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r11 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al5, bl7)|0) + (m & 0xffff)|0) + (r12 & 0xffff)|0;\n                v = ((imul(ah5, bl7)|0) + (m >>> 16)|0) + (r12 >>> 16)|0;\n                w = ((imul(al5, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah5, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r12 = (w << 16) | (u & 0xffff);\n\n                r13 = m;\n\n                u = ((imul(al6, bl0)|0) + (r14 & 0xffff)|0) + (r6 & 0xffff)|0;\n                v = ((imul(ah6, bl0)|0) + (r14 >>> 16)|0) + (r6 >>> 16)|0;\n                w = ((imul(al6, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r6 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl1)|0) + (m & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah6, bl1)|0) + (m >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al6, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl2)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah6, bl2)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al6, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl3)|0) + (m & 0xffff)|0) + (r9 & 0xffff)|0;\n                v = ((imul(ah6, bl3)|0) + (m >>> 16)|0) + (r9 >>> 16)|0;\n                w = ((imul(al6, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r9 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl4)|0) + (m & 0xffff)|0) + (r10 & 0xffff)|0;\n                v = ((imul(ah6, bl4)|0) + (m >>> 16)|0) + (r10 >>> 16)|0;\n                w = ((imul(al6, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r10 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl5)|0) + (m & 0xffff)|0) + (r11 & 0xffff)|0;\n                v = ((imul(ah6, bl5)|0) + (m >>> 16)|0) + (r11 >>> 16)|0;\n                w = ((imul(al6, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r11 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl6)|0) + (m & 0xffff)|0) + (r12 & 0xffff)|0;\n                v = ((imul(ah6, bl6)|0) + (m >>> 16)|0) + (r12 >>> 16)|0;\n                w = ((imul(al6, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r12 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al6, bl7)|0) + (m & 0xffff)|0) + (r13 & 0xffff)|0;\n                v = ((imul(ah6, bl7)|0) + (m >>> 16)|0) + (r13 >>> 16)|0;\n                w = ((imul(al6, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah6, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r13 = (w << 16) | (u & 0xffff);\n\n                r14 = m;\n\n                u = ((imul(al7, bl0)|0) + (r15 & 0xffff)|0) + (r7 & 0xffff)|0;\n                v = ((imul(ah7, bl0)|0) + (r15 >>> 16)|0) + (r7 >>> 16)|0;\n                w = ((imul(al7, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r7 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl1)|0) + (m & 0xffff)|0) + (r8 & 0xffff)|0;\n                v = ((imul(ah7, bl1)|0) + (m >>> 16)|0) + (r8 >>> 16)|0;\n                w = ((imul(al7, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r8 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl2)|0) + (m & 0xffff)|0) + (r9 & 0xffff)|0;\n                v = ((imul(ah7, bl2)|0) + (m >>> 16)|0) + (r9 >>> 16)|0;\n                w = ((imul(al7, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r9 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl3)|0) + (m & 0xffff)|0) + (r10 & 0xffff)|0;\n                v = ((imul(ah7, bl3)|0) + (m >>> 16)|0) + (r10 >>> 16)|0;\n                w = ((imul(al7, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r10 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl4)|0) + (m & 0xffff)|0) + (r11 & 0xffff)|0;\n                v = ((imul(ah7, bl4)|0) + (m >>> 16)|0) + (r11 >>> 16)|0;\n                w = ((imul(al7, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r11 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl5)|0) + (m & 0xffff)|0) + (r12 & 0xffff)|0;\n                v = ((imul(ah7, bl5)|0) + (m >>> 16)|0) + (r12 >>> 16)|0;\n                w = ((imul(al7, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r12 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl6)|0) + (m & 0xffff)|0) + (r13 & 0xffff)|0;\n                v = ((imul(ah7, bl6)|0) + (m >>> 16)|0) + (r13 >>> 16)|0;\n                w = ((imul(al7, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r13 = (w << 16) | (u & 0xffff);\n\n                u = ((imul(al7, bl7)|0) + (m & 0xffff)|0) + (r14 & 0xffff)|0;\n                v = ((imul(ah7, bl7)|0) + (m >>> 16)|0) + (r14 >>> 16)|0;\n                w = ((imul(al7, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah7, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r14 = (w << 16) | (u & 0xffff);\n\n                r15 = m;\n\n                HEAP32[(Rk|0)>>2] = r0,\n                HEAP32[(Rk|4)>>2] = r1,\n                HEAP32[(Rk|8)>>2] = r2,\n                HEAP32[(Rk|12)>>2] = r3,\n                HEAP32[(Rk|16)>>2] = r4,\n                HEAP32[(Rk|20)>>2] = r5,\n                HEAP32[(Rk|24)>>2] = r6,\n                HEAP32[(Rk|28)>>2] = r7;\n            }\n\n            Rk = (R+(i+j|0))|0;\n            HEAP32[(Rk|0)>>2] = r8,\n            HEAP32[(Rk|4)>>2] = r9,\n            HEAP32[(Rk|8)>>2] = r10,\n            HEAP32[(Rk|12)>>2] = r11,\n            HEAP32[(Rk|16)>>2] = r12,\n            HEAP32[(Rk|20)>>2] = r13,\n            HEAP32[(Rk|24)>>2] = r14,\n            HEAP32[(Rk|28)>>2] = r15;\n        }\n/*\n        for ( i = lA & -32; (i|0) < (lA|0); i = (i+4)|0 ) {\n            Ai = (A+i)|0;\n\n            ah0 = HEAP32[Ai>>2]|0,\n            al0 = ah0 & 0xffff,\n            ah0 = ah0 >>> 16;\n\n            r1 = 0;\n\n            for ( j = 0; (j|0) < (lB|0); j = (j+4)|0 ) {\n                Bj = (B+j)|0;\n                Rk = (R+(i+j|0))|0;\n\n                bh0 = HEAP32[Bj>>2]|0,\n                bl0 = bh0 & 0xffff,\n                bh0 = bh0 >>> 16;\n\n                r0 = HEAP32[Rk>>2]|0;\n\n                u = ((imul(al0, bl0)|0) + (r1 & 0xffff)|0) + (r0 & 0xffff)|0;\n                v = ((imul(ah0, bl0)|0) + (r1 >>> 16)|0) + (r0 >>> 16)|0;\n                w = ((imul(al0, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                m = ((imul(ah0, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                r0 = (w << 16) | (u & 0xffff);\n\n                r1 = m;\n\n                HEAP32[Rk>>2] = r0;\n            }\n\n            Rk = (R+(i+j|0))|0;\n            HEAP32[Rk>>2] = r1;\n        }\n*/\n    }\n\n    /**\n     * Fast squaring\n     *\n     * Exploits the fact:\n     *\n     *  X² = ( X0 + X1*B )² = X0² + 2*X0*X1*B + X1²*B²,\n     *\n     * where B is a power of 2, so:\n     *\n     *  2*X0*X1*B = (X0*X1 << 1)*B\n     *\n     * @param A offset of the argument being squared, 32-byte aligned\n     * @param lA length of the argument, multiple of 32\n     *\n     * @param R offset where to place the result to, 32-byte aligned\n     */\n    function sqr ( A, lA, R ) {\n        A  =  A|0;\n        lA = lA|0;\n        R  =  R|0;\n\n        var al0 = 0, al1 = 0, al2 = 0, al3 = 0, al4 = 0, al5 = 0, al6 = 0, al7 = 0, ah0 = 0, ah1 = 0, ah2 = 0, ah3 = 0, ah4 = 0, ah5 = 0, ah6 = 0, ah7 = 0,\n            bl0 = 0, bl1 = 0, bl2 = 0, bl3 = 0, bl4 = 0, bl5 = 0, bl6 = 0, bl7 = 0, bh0 = 0, bh1 = 0, bh2 = 0, bh3 = 0, bh4 = 0, bh5 = 0, bh6 = 0, bh7 = 0,\n            r0 = 0, r1 = 0, r2 = 0, r3 = 0, r4 = 0, r5 = 0, r6 = 0, r7 = 0, r8 = 0, r9 = 0, r10 = 0, r11 = 0, r12 = 0, r13 = 0, r14 = 0, r15 = 0,\n            u = 0, v = 0, w = 0, c = 0, h = 0, m = 0, r = 0,\n            d = 0, dd = 0, p = 0, i = 0, j = 0, k = 0, Ai = 0, Aj = 0, Rk = 0;\n\n        // prepare for iterations\n        for ( ; (i|0) < (lA|0); i = (i+4)|0 ) {\n            Rk = R+(i<<1)|0;\n            ah0 = HEAP32[(A+i)>>2]|0, al0 = ah0 & 0xffff, ah0 = ah0 >>> 16;\n            u = imul(al0,al0)|0;\n            v = (imul(al0,ah0)|0) + (u >>> 17)|0;\n            w = (imul(ah0,ah0)|0) + (v >>> 15)|0;\n            HEAP32[(Rk)>>2] = (v << 17) | (u & 0x1ffff);\n            HEAP32[(Rk|4)>>2] = w;\n        }\n\n        // unrolled 1st iteration\n        for ( p = 0; (p|0) < (lA|0); p = (p+8)|0 ) {\n            Ai = A+p|0, Rk = R+(p<<1)|0;\n\n            ah0 = HEAP32[(Ai)>>2]|0, al0 = ah0 & 0xffff, ah0 = ah0 >>> 16;\n\n            bh0 = HEAP32[(Ai|4)>>2]|0, bl0 = bh0 & 0xffff, bh0 = bh0 >>> 16;\n\n            u = imul(al0,bl0)|0;\n            v = (imul(al0,bh0)|0) + (u >>> 16)|0;\n            w = (imul(ah0,bl0)|0) + (v & 0xffff)|0;\n            m = ((imul(ah0,bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n\n            r = HEAP32[(Rk|4)>>2]|0;\n            u = (r & 0xffff) + ((u & 0xffff) << 1)|0;\n            w = ((r >>> 16) + ((w & 0xffff) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|4)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|8)>>2]|0;\n            u = ((r & 0xffff) + ((m & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((m >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|8)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            if ( c ) {\n                r = HEAP32[(Rk|12)>>2]|0;\n                u = (r & 0xffff) + c|0;\n                w = (r >>> 16) + (u >>> 16)|0;\n                HEAP32[(Rk|12)>>2] = (w << 16) | (u & 0xffff);\n            }\n        }\n\n        // unrolled 2nd iteration\n        for ( p = 0; (p|0) < (lA|0); p = (p+16)|0 ) {\n            Ai = A+p|0, Rk = R+(p<<1)|0;\n\n            ah0 = HEAP32[(Ai)>>2]|0, al0 = ah0 & 0xffff, ah0 = ah0 >>> 16,\n            ah1 = HEAP32[(Ai|4)>>2]|0, al1 = ah1 & 0xffff, ah1 = ah1 >>> 16;\n\n            bh0 = HEAP32[(Ai|8)>>2]|0, bl0 = bh0 & 0xffff, bh0 = bh0 >>> 16,\n            bh1 = HEAP32[(Ai|12)>>2]|0, bl1 = bh1 & 0xffff, bh1 = bh1 >>> 16;\n\n            u = imul(al0, bl0)|0;\n            v = imul(ah0, bl0)|0;\n            w = ((imul(al0, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah0, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r0 = (w << 16) | (u & 0xffff);\n\n            u = (imul(al0, bl1)|0) + (m & 0xffff)|0;\n            v = (imul(ah0, bl1)|0) + (m >>> 16)|0;\n            w = ((imul(al0, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah0, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r1 = (w << 16) | (u & 0xffff);\n\n            r2 = m;\n\n            u = (imul(al1, bl0)|0) + (r1 & 0xffff)|0;\n            v = (imul(ah1, bl0)|0) + (r1 >>> 16)|0;\n            w = ((imul(al1, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah1, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r1 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al1, bl1)|0) + (r2 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah1, bl1)|0) + (r2 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al1, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah1, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r2 = (w << 16) | (u & 0xffff);\n\n            r3 = m;\n\n            r = HEAP32[(Rk|8)>>2]|0;\n            u = (r & 0xffff) + ((r0 & 0xffff) << 1)|0;\n            w = ((r >>> 16) + ((r0 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|8)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|12)>>2]|0;\n            u = ((r & 0xffff) + ((r1 & 0xffff) << 1)|0)  + c|0;\n            w = ((r >>> 16) + ((r1 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|12)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|16)>>2]|0;\n            u = ((r & 0xffff) + ((r2 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r2 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|16)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|20)>>2]|0;\n            u = ((r & 0xffff) + ((r3 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r3 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|20)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            for ( k = 24; !!c & ( (k|0) < 32 ); k = (k+4)|0 ) {\n                r = HEAP32[(Rk|k)>>2]|0;\n                u = (r & 0xffff) + c|0;\n                w = (r >>> 16) + (u >>> 16)|0;\n                HEAP32[(Rk|k)>>2] = (w << 16) | (u & 0xffff);\n                c = w >>> 16;\n            }\n        }\n\n        // unrolled 3rd iteration\n        for ( p = 0; (p|0) < (lA|0); p = (p+32)|0 ) {\n            Ai = A+p|0, Rk = R+(p<<1)|0;\n\n            ah0 = HEAP32[(Ai)>>2]|0, al0 = ah0 & 0xffff, ah0 = ah0 >>> 16,\n            ah1 = HEAP32[(Ai|4)>>2]|0, al1 = ah1 & 0xffff, ah1 = ah1 >>> 16,\n            ah2 = HEAP32[(Ai|8)>>2]|0, al2 = ah2 & 0xffff, ah2 = ah2 >>> 16,\n            ah3 = HEAP32[(Ai|12)>>2]|0, al3 = ah3 & 0xffff, ah3 = ah3 >>> 16;\n\n            bh0 = HEAP32[(Ai|16)>>2]|0, bl0 = bh0 & 0xffff, bh0 = bh0 >>> 16,\n            bh1 = HEAP32[(Ai|20)>>2]|0, bl1 = bh1 & 0xffff, bh1 = bh1 >>> 16,\n            bh2 = HEAP32[(Ai|24)>>2]|0, bl2 = bh2 & 0xffff, bh2 = bh2 >>> 16,\n            bh3 = HEAP32[(Ai|28)>>2]|0, bl3 = bh3 & 0xffff, bh3 = bh3 >>> 16;\n\n            u = imul(al0, bl0)|0;\n            v = imul(ah0, bl0)|0;\n            w = ((imul(al0, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah0, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r0 = (w << 16) | (u & 0xffff);\n\n            u = (imul(al0, bl1)|0) + (m & 0xffff)|0;\n            v = (imul(ah0, bl1)|0) + (m >>> 16)|0;\n            w = ((imul(al0, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah0, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r1 = (w << 16) | (u & 0xffff);\n\n            u = (imul(al0, bl2)|0) + (m & 0xffff)|0;\n            v = (imul(ah0, bl2)|0) + (m >>> 16)|0;\n            w = ((imul(al0, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah0, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r2 = (w << 16) | (u & 0xffff);\n\n            u = (imul(al0, bl3)|0) + (m & 0xffff)|0;\n            v = (imul(ah0, bl3)|0) + (m >>> 16)|0;\n            w = ((imul(al0, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah0, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r3 = (w << 16) | (u & 0xffff);\n\n            r4 = m;\n\n            u = (imul(al1, bl0)|0) + (r1 & 0xffff)|0;\n            v = (imul(ah1, bl0)|0) + (r1 >>> 16)|0;\n            w = ((imul(al1, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah1, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r1 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al1, bl1)|0) + (r2 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah1, bl1)|0) + (r2 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al1, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah1, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r2 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al1, bl2)|0) + (r3 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah1, bl2)|0) + (r3 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al1, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah1, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r3 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al1, bl3)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah1, bl3)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al1, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah1, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r4 = (w << 16) | (u & 0xffff);\n\n            r5 = m;\n\n            u = (imul(al2, bl0)|0) + (r2 & 0xffff)|0;\n            v = (imul(ah2, bl0)|0) + (r2 >>> 16)|0;\n            w = ((imul(al2, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah2, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r2 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al2, bl1)|0) + (r3 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah2, bl1)|0) + (r3 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al2, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah2, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r3 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al2, bl2)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah2, bl2)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al2, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah2, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r4 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al2, bl3)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah2, bl3)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al2, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah2, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r5 = (w << 16) | (u & 0xffff);\n\n            r6 = m;\n\n            u = (imul(al3, bl0)|0) + (r3 & 0xffff)|0;\n            v = (imul(ah3, bl0)|0) + (r3 >>> 16)|0;\n            w = ((imul(al3, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah3, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r3 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al3, bl1)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah3, bl1)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al3, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah3, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r4 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al3, bl2)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah3, bl2)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al3, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah3, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r5 = (w << 16) | (u & 0xffff);\n\n            u = ((imul(al3, bl3)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n            v = ((imul(ah3, bl3)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n            w = ((imul(al3, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n            m = ((imul(ah3, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n            r6 = (w << 16) | (u & 0xffff);\n\n            r7 = m;\n\n            r = HEAP32[(Rk|16)>>2]|0;\n            u = (r & 0xffff) + ((r0 & 0xffff) << 1)|0;\n            w = ((r >>> 16) + ((r0 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|16)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|20)>>2]|0;\n            u = ((r & 0xffff) + ((r1 & 0xffff) << 1)|0)  + c|0;\n            w = ((r >>> 16) + ((r1 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|20)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|24)>>2]|0;\n            u = ((r & 0xffff) + ((r2 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r2 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|24)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk|28)>>2]|0;\n            u = ((r & 0xffff) + ((r3 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r3 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk|28)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk+32)>>2]|0;\n            u = ((r & 0xffff) + ((r4 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r4 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk+32)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk+36)>>2]|0;\n            u = ((r & 0xffff) + ((r5 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r5 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk+36)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk+40)>>2]|0;\n            u = ((r & 0xffff) + ((r6 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r6 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk+40)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            r = HEAP32[(Rk+44)>>2]|0;\n            u = ((r & 0xffff) + ((r7 & 0xffff) << 1)|0) + c|0;\n            w = ((r >>> 16) + ((r7 >>> 16) << 1)|0) + (u >>> 16)|0;\n            HEAP32[(Rk+44)>>2] = (w << 16) | (u & 0xffff);\n            c = w >>> 16;\n\n            for ( k = 48; !!c & ( (k|0) < 64 ); k = (k+4)|0 ) {\n                r = HEAP32[(Rk+k)>>2]|0;\n                u = (r & 0xffff) + c|0;\n                w = (r >>> 16) + (u >>> 16)|0;\n                HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                c = w >>> 16;\n            }\n        }\n\n        // perform iterations\n        for ( d = 32; (d|0) < (lA|0); d = d << 1 ) { // depth loop\n            dd = d << 1;\n\n            for ( p = 0; (p|0) < (lA|0); p = (p+dd)|0 ) { // part loop\n                Rk = R+(p<<1)|0;\n\n                h = 0;\n                for ( i = 0; (i|0) < (d|0); i = (i+32)|0 ) { // multiply-and-add loop\n                    Ai = (A+p|0)+i|0;\n\n                    ah0 = HEAP32[(Ai)>>2]|0, al0 = ah0 & 0xffff, ah0 = ah0 >>> 16,\n                    ah1 = HEAP32[(Ai|4)>>2]|0, al1 = ah1 & 0xffff, ah1 = ah1 >>> 16,\n                    ah2 = HEAP32[(Ai|8)>>2]|0, al2 = ah2 & 0xffff, ah2 = ah2 >>> 16,\n                    ah3 = HEAP32[(Ai|12)>>2]|0, al3 = ah3 & 0xffff, ah3 = ah3 >>> 16,\n                    ah4 = HEAP32[(Ai|16)>>2]|0, al4 = ah4 & 0xffff, ah4 = ah4 >>> 16,\n                    ah5 = HEAP32[(Ai|20)>>2]|0, al5 = ah5 & 0xffff, ah5 = ah5 >>> 16,\n                    ah6 = HEAP32[(Ai|24)>>2]|0, al6 = ah6 & 0xffff, ah6 = ah6 >>> 16,\n                    ah7 = HEAP32[(Ai|28)>>2]|0, al7 = ah7 & 0xffff, ah7 = ah7 >>> 16;\n\n                    r8 = r9 = r10 = r11 = r12 = r13 = r14 = r15 = c = 0;\n\n                    for ( j = 0; (j|0) < (d|0); j = (j+32)|0 ) {\n                        Aj = ((A+p|0)+d|0)+j|0;\n\n                        bh0 = HEAP32[(Aj)>>2]|0, bl0 = bh0 & 0xffff, bh0 = bh0 >>> 16,\n                        bh1 = HEAP32[(Aj|4)>>2]|0, bl1 = bh1 & 0xffff, bh1 = bh1 >>> 16,\n                        bh2 = HEAP32[(Aj|8)>>2]|0, bl2 = bh2 & 0xffff, bh2 = bh2 >>> 16,\n                        bh3 = HEAP32[(Aj|12)>>2]|0, bl3 = bh3 & 0xffff, bh3 = bh3 >>> 16,\n                        bh4 = HEAP32[(Aj|16)>>2]|0, bl4 = bh4 & 0xffff, bh4 = bh4 >>> 16,\n                        bh5 = HEAP32[(Aj|20)>>2]|0, bl5 = bh5 & 0xffff, bh5 = bh5 >>> 16,\n                        bh6 = HEAP32[(Aj|24)>>2]|0, bl6 = bh6 & 0xffff, bh6 = bh6 >>> 16,\n                        bh7 = HEAP32[(Aj|28)>>2]|0, bl7 = bh7 & 0xffff, bh7 = bh7 >>> 16;\n\n                        r0 = r1 = r2 = r3 = r4 = r5 = r6 = r7 = 0;\n\n                        u = ((imul(al0, bl0)|0) + (r0 & 0xffff)|0) + (r8 & 0xffff)|0;\n                        v = ((imul(ah0, bl0)|0) + (r0 >>> 16)|0) + (r8 >>> 16)|0;\n                        w = ((imul(al0, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r0 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl1)|0) + (r1 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl1)|0) + (r1 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r1 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl2)|0) + (r2 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl2)|0) + (r2 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r2 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl3)|0) + (r3 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl3)|0) + (r3 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r3 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl4)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl4)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r4 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl5)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl5)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r5 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl6)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl6)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al0, bl7)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah0, bl7)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al0, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah0, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        r8 = m;\n\n                        u = ((imul(al1, bl0)|0) + (r1 & 0xffff)|0) + (r9 & 0xffff)|0;\n                        v = ((imul(ah1, bl0)|0) + (r1 >>> 16)|0) + (r9 >>> 16)|0;\n                        w = ((imul(al1, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r1 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl1)|0) + (r2 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl1)|0) + (r2 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r2 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl2)|0) + (r3 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl2)|0) + (r3 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r3 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl3)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl3)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r4 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl4)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl4)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r5 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl5)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl5)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl6)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl6)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al1, bl7)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah1, bl7)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al1, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah1, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        r9 = m;\n\n                        u = ((imul(al2, bl0)|0) + (r2 & 0xffff)|0) + (r10 & 0xffff)|0;\n                        v = ((imul(ah2, bl0)|0) + (r2 >>> 16)|0) + (r10 >>> 16)|0;\n                        w = ((imul(al2, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r2 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl1)|0) + (r3 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl1)|0) + (r3 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r3 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl2)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl2)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r4 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl3)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl3)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r5 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl4)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl4)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl5)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl5)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl6)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl6)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al2, bl7)|0) + (r9 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah2, bl7)|0) + (r9 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al2, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah2, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r9 = (w << 16) | (u & 0xffff);\n\n                        r10 = m;\n\n                        u = ((imul(al3, bl0)|0) + (r3 & 0xffff)|0) + (r11 & 0xffff)|0;\n                        v = ((imul(ah3, bl0)|0) + (r3 >>> 16)|0) + (r11 >>> 16)|0;\n                        w = ((imul(al3, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r3 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl1)|0) + (r4 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl1)|0) + (r4 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r4 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl2)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl2)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r5 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl3)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl3)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl4)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl4)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl5)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl5)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl6)|0) + (r9 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl6)|0) + (r9 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r9 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al3, bl7)|0) + (r10 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah3, bl7)|0) + (r10 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al3, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah3, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r10 = (w << 16) | (u & 0xffff);\n\n                        r11 = m;\n\n                        u = ((imul(al4, bl0)|0) + (r4 & 0xffff)|0) + (r12 & 0xffff)|0;\n                        v = ((imul(ah4, bl0)|0) + (r4 >>> 16)|0) + (r12 >>> 16)|0;\n                        w = ((imul(al4, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r4 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl1)|0) + (r5 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl1)|0) + (r5 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r5 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl2)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl2)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl3)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl3)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl4)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl4)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl5)|0) + (r9 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl5)|0) + (r9 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r9 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl6)|0) + (r10 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl6)|0) + (r10 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r10 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al4, bl7)|0) + (r11 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah4, bl7)|0) + (r11 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al4, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah4, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r11 = (w << 16) | (u & 0xffff);\n\n                        r12 = m;\n\n                        u = ((imul(al5, bl0)|0) + (r5 & 0xffff)|0) + (r13 & 0xffff)|0;\n                        v = ((imul(ah5, bl0)|0) + (r5 >>> 16)|0) + (r13 >>> 16)|0;\n                        w = ((imul(al5, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r5 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl1)|0) + (r6 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl1)|0) + (r6 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl2)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl2)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl3)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl3)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl4)|0) + (r9 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl4)|0) + (r9 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r9 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl5)|0) + (r10 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl5)|0) + (r10 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r10 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl6)|0) + (r11 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl6)|0) + (r11 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r11 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al5, bl7)|0) + (r12 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah5, bl7)|0) + (r12 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al5, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah5, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r12 = (w << 16) | (u & 0xffff);\n\n                        r13 = m;\n\n                        u = ((imul(al6, bl0)|0) + (r6 & 0xffff)|0) + (r14 & 0xffff)|0;\n                        v = ((imul(ah6, bl0)|0) + (r6 >>> 16)|0) + (r14 >>> 16)|0;\n                        w = ((imul(al6, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r6 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl1)|0) + (r7 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl1)|0) + (r7 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl2)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl2)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl3)|0) + (r9 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl3)|0) + (r9 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r9 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl4)|0) + (r10 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl4)|0) + (r10 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r10 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl5)|0) + (r11 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl5)|0) + (r11 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r11 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl6)|0) + (r12 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl6)|0) + (r12 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r12 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al6, bl7)|0) + (r13 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah6, bl7)|0) + (r13 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al6, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah6, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r13 = (w << 16) | (u & 0xffff);\n\n                        r14 = m;\n\n                        u = ((imul(al7, bl0)|0) + (r7 & 0xffff)|0) + (r15 & 0xffff)|0;\n                        v = ((imul(ah7, bl0)|0) + (r7 >>> 16)|0) + (r15 >>> 16)|0;\n                        w = ((imul(al7, bh0)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh0)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r7 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl1)|0) + (r8 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl1)|0) + (r8 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh1)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh1)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r8 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl2)|0) + (r9 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl2)|0) + (r9 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh2)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh2)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r9 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl3)|0) + (r10 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl3)|0) + (r10 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh3)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh3)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r10 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl4)|0) + (r11 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl4)|0) + (r11 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh4)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh4)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r11 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl5)|0) + (r12 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl5)|0) + (r12 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh5)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh5)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r12 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl6)|0) + (r13 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl6)|0) + (r13 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh6)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh6)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r13 = (w << 16) | (u & 0xffff);\n\n                        u = ((imul(al7, bl7)|0) + (r14 & 0xffff)|0) + (m & 0xffff)|0;\n                        v = ((imul(ah7, bl7)|0) + (r14 >>> 16)|0) + (m >>> 16)|0;\n                        w = ((imul(al7, bh7)|0) + (v & 0xffff)|0) + (u >>> 16)|0;\n                        m = ((imul(ah7, bh7)|0) + (v >>> 16)|0) + (w >>> 16)|0;\n                        r14 = (w << 16) | (u & 0xffff);\n\n                        r15 = m;\n\n                        k = d+(i+j|0)|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r0 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r0 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r1 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r1 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r2 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r2 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r3 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r3 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r4 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r4 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r5 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r5 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r6 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r6 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n\n                        k = k+4|0;\n                        r = HEAP32[(Rk+k)>>2]|0;\n                        u = ((r & 0xffff) + ((r7 & 0xffff) << 1)|0) + c|0;\n                        w = ((r >>> 16) + ((r7 >>> 16) << 1)|0) + (u >>> 16)|0;\n                        HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                        c = w >>> 16;\n                    }\n\n                    k = d+(i+j|0)|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = (((r & 0xffff) + ((r8 & 0xffff) << 1)|0) + c|0) + h|0;\n                    w = ((r >>> 16) + ((r8 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r9 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r9 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r10 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r10 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r11 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r11 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r12 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r12 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r13 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r13 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r14 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r14 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    c = w >>> 16;\n\n                    k = k+4|0;\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = ((r & 0xffff) + ((r15 & 0xffff) << 1)|0) + c|0;\n                    w = ((r >>> 16) + ((r15 >>> 16) << 1)|0) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    h = w >>> 16;\n                }\n\n                for ( k = k+4|0; !!h & ( (k|0) < (dd<<1) ); k = (k+4)|0 ) { // carry propagation loop\n                    r = HEAP32[(Rk+k)>>2]|0;\n                    u = (r & 0xffff) + h|0;\n                    w = (r >>> 16) + (u >>> 16)|0;\n                    HEAP32[(Rk+k)>>2] = (w << 16) | (u & 0xffff);\n                    h = w >>> 16;\n                }\n            }\n        }\n    }\n\n    /**\n     * Conventional division\n     *\n     * @param A offset of the numerator, 32-byte aligned\n     * @param lA length of the numerator, multiple of 32\n     *\n     * @param B offset of the divisor, 32-byte aligned\n     * @param lB length of the divisor, multiple of 32\n     *\n     * @param R offset where to place the remainder to, 32-byte aligned\n     *\n     * @param Q offser where to place the quotient to, 32-byte aligned\n     */\n\n    function div ( N, lN, D, lD, Q ) {\n        N  =  N|0;\n        lN = lN|0;\n        D  =  D|0;\n        lD = lD|0;\n        Q  =  Q|0;\n\n        var n = 0, d = 0, e = 0,\n            u1 = 0, u0 = 0,\n            v0 = 0, vh = 0, vl = 0,\n            qh = 0, ql = 0, rh = 0, rl = 0,\n            t1 = 0, t2 = 0, m = 0, c = 0,\n            i = 0, j = 0, k = 0;\n\n        // number of significant limbs in `N` (multiplied by 4)\n        for ( i = (lN-1) & -4; (i|0) >= 0; i = (i-4)|0 ) {\n            n = HEAP32[(N+i)>>2]|0;\n            if ( n ) {\n                lN = i;\n                break;\n            }\n        }\n\n        // number of significant limbs in `D` (multiplied by 4)\n        for ( i = (lD-1) & -4; (i|0) >= 0; i = (i-4)|0 ) {\n            d = HEAP32[(D+i)>>2]|0;\n            if ( d ) {\n                lD = i;\n                break;\n            }\n        }\n\n        // `D` is zero? WTF?!\n\n        // calculate `e` — the power of 2 of the normalization factor\n        while ( (d & 0x80000000) == 0 ) {\n            d = d << 1;\n            e = e + 1|0;\n        }\n\n        // normalize `N` in place\n        u0 = HEAP32[(N+lN)>>2]|0;\n        if ( e ) {\n            u1 = u0>>>(32-e|0);\n            for ( i = (lN-4)|0; (i|0) >= 0; i = (i-4)|0 ) {\n                n = HEAP32[(N+i)>>2]|0;\n                HEAP32[(N+i+4)>>2] = (u0 << e) | ( e ? n >>> (32-e|0) : 0 );\n                u0 = n;\n            }\n            HEAP32[N>>2] = u0 << e;\n        }\n\n        // normalize `D` in place\n        if ( e ) {\n            v0 = HEAP32[(D+lD)>>2]|0;\n            for ( i = (lD-4)|0; (i|0) >= 0; i = (i-4)|0 ) {\n                d = HEAP32[(D+i)>>2]|0;\n                HEAP32[(D+i+4)>>2] = (v0 << e) | ( d >>> (32-e|0) );\n                v0 = d;\n            }\n            HEAP32[D>>2] = v0 << e;\n        }\n\n        // divisor parts won't change\n        v0 = HEAP32[(D+lD)>>2]|0;\n        vh = v0 >>> 16, vl = v0 & 0xffff;\n\n        // perform division\n        for ( i = lN; (i|0) >= (lD|0); i = (i-4)|0 ) {\n            j = (i-lD)|0;\n\n            // estimate high part of the quotient\n            u0 = HEAP32[(N+i)>>2]|0;\n            qh = ( (u1>>>0) / (vh>>>0) )|0, rh = ( (u1>>>0) % (vh>>>0) )|0, t1 = imul(qh, vl)|0;\n            while ( ( (qh|0) == 0x10000 ) | ( (t1>>>0) > (((rh << 16)|(u0 >>> 16))>>>0) ) ) {\n                qh = (qh-1)|0, rh = (rh+vh)|0, t1 = (t1-vl)|0;\n                if ( (rh|0) >= 0x10000 ) break;\n            }\n\n            // bulk multiply-and-subtract\n            // m - multiplication carry, c - subtraction carry\n            m = 0, c = 0;\n            for ( k = 0; (k|0) <= (lD|0); k = (k+4)|0 ) {\n                d = HEAP32[(D+k)>>2]|0;\n                t1 = (imul(qh, d & 0xffff)|0) + (m >>> 16)|0;\n                t2 = (imul(qh, d >>> 16)|0) + (t1 >>> 16)|0;\n                d = (m & 0xffff) | (t1 << 16);\n                m = t2;\n                n = HEAP32[(N+j+k)>>2]|0;\n                t1 = ((n & 0xffff) - (d & 0xffff)|0) + c|0;\n                t2 = ((n >>> 16) - (d >>> 16)|0) + (t1 >> 16)|0;\n                HEAP32[(N+j+k)>>2] = (t2 << 16) | (t1 & 0xffff);\n                c = t2 >> 16;\n            }\n            t1 = ((u1 & 0xffff) - (m & 0xffff)|0) + c|0;\n            t2 = ((u1 >>> 16) - (m >>> 16)|0) + (t1 >> 16)|0;\n            u1 = (t2 << 16) | (t1 & 0xffff);\n            c = t2 >> 16;\n\n            // add `D` back if got carry-out\n            if ( c ) {\n                qh = (qh-1)|0;\n                c = 0;\n                for ( k = 0; (k|0) <= (lD|0); k = (k+4)|0 ) {\n                    d = HEAP32[(D+k)>>2]|0;\n                    n = HEAP32[(N+j+k)>>2]|0;\n                    t1 = (n & 0xffff) + c|0;\n                    t2 = (n >>> 16) + d + (t1 >>> 16)|0;\n                    HEAP32[(N+j+k)>>2] = (t2 << 16) | (t1 & 0xffff);\n                    c = t2 >>> 16;\n                }\n                u1 = (u1+c)|0;\n            }\n\n            // estimate low part of the quotient\n            u0 = HEAP32[(N+i)>>2]|0;\n            n = (u1 << 16) | (u0 >>> 16);\n            ql = ( (n>>>0) / (vh>>>0) )|0, rl = ( (n>>>0) % (vh>>>0) )|0, t1 = imul(ql, vl)|0;\n            while ( ( (ql|0) == 0x10000 ) | ( (t1>>>0) > (((rl << 16)|(u0 & 0xffff))>>>0) ) ) {\n                ql = (ql-1)|0, rl = (rl+vh)|0, t1 = (t1-vl)|0;\n                if ( (rl|0) >= 0x10000 ) break;\n            }\n\n            // bulk multiply-and-subtract\n            // m - multiplication carry, c - subtraction carry\n            m = 0, c = 0;\n            for ( k = 0; (k|0) <= (lD|0); k = (k+4)|0 ) {\n                d = HEAP32[(D+k)>>2]|0;\n                t1 = (imul(ql, d & 0xffff)|0) + (m & 0xffff)|0;\n                t2 = ((imul(ql, d >>> 16)|0) + (t1 >>> 16)|0) + (m >>> 16)|0;\n                d = (t1 & 0xffff) | (t2 << 16);\n                m = t2 >>> 16;\n                n = HEAP32[(N+j+k)>>2]|0;\n                t1 = ((n & 0xffff) - (d & 0xffff)|0) + c|0;\n                t2 = ((n >>> 16) - (d >>> 16)|0) + (t1 >> 16)|0;\n                c = t2 >> 16;\n                HEAP32[(N+j+k)>>2] = (t2 << 16) | (t1 & 0xffff);\n            }\n            t1 = ((u1 & 0xffff) - (m & 0xffff)|0) + c|0;\n            t2 = ((u1 >>> 16) - (m >>> 16)|0) + (t1 >> 16)|0;\n            c = t2 >> 16;\n\n            // add `D` back if got carry-out\n            if ( c ) {\n                ql = (ql-1)|0;\n                c = 0;\n                for ( k = 0; (k|0) <= (lD|0); k = (k+4)|0 ) {\n                    d = HEAP32[(D+k)>>2]|0;\n                    n = HEAP32[(N+j+k)>>2]|0;\n                    t1 = ((n & 0xffff) + (d & 0xffff)|0) + c|0;\n                    t2 = ((n >>> 16) + (d >>> 16)|0) + (t1 >>> 16)|0;\n                    c = t2 >>> 16;\n                    HEAP32[(N+j+k)>>2] = (t1 & 0xffff) | (t2 << 16);\n                }\n            }\n\n            // got quotient limb\n            HEAP32[(Q+j)>>2] = (qh << 16) | ql;\n\n            u1 = HEAP32[(N+i)>>2]|0;\n        }\n\n        if ( e ) {\n            // TODO denormalize `D` in place\n\n            // denormalize `N` in place\n            u0 = HEAP32[N>>2]|0;\n            for ( i = 4; (i|0) <= (lD|0); i = (i+4)|0 ) {\n                n = HEAP32[(N+i)>>2]|0;\n                HEAP32[(N+i-4)>>2] = ( n << (32-e|0) ) | (u0 >>> e);\n                u0 = n;\n            }\n            HEAP32[(N+lD)>>2] = u0 >>> e;\n        }\n    }\n\n    /**\n     * Montgomery modular reduction\n     *\n     * Definition:\n     *\n     *  MREDC(A) = A × X (mod N),\n     *  M × X = N × Y + 1,\n     *\n     * where M = 2^(32*m) such that N < M and A < N×M\n     *\n     * Numbers `X` and `Y` can be calculated using Extended Euclidean Algorithm.\n     */\n    function mredc ( A, lA, N, lN, y, R ) {\n        A  =  A|0;\n        lA = lA|0;\n        N  =  N|0;\n        lN = lN|0;\n        y  =  y|0;\n        R  =  R|0;\n\n        var T = 0,\n            c = 0, uh = 0, ul = 0, vl = 0, vh = 0, w0 = 0, w1 = 0, w2 = 0, r0 = 0, r1 = 0,\n            i = 0, j = 0, k = 0;\n\n        T = salloc(lN<<1)|0;\n        z(lN<<1, 0, T);\n\n        cp( lA, A, T );\n\n        // HAC 14.32\n        for ( i = 0; (i|0) < (lN|0); i = (i+4)|0 ) {\n            uh = HEAP32[(T+i)>>2]|0, ul = uh & 0xffff, uh = uh >>> 16;\n            vh = y >>> 16, vl = y & 0xffff;\n            w0 = imul(ul,vl)|0, w1 = ( (imul(ul,vh)|0) + (imul(uh,vl)|0) | 0 ) + (w0 >>> 16) | 0;\n            ul = w0 & 0xffff, uh = w1 & 0xffff;\n            r1 = 0;\n            for ( j = 0; (j|0) < (lN|0); j = (j+4)|0 ) {\n                k = (i+j)|0;\n                vh = HEAP32[(N+j)>>2]|0, vl = vh & 0xffff, vh = vh >>> 16;\n                r0 = HEAP32[(T+k)>>2]|0;\n                w0 = ((imul(ul, vl)|0) + (r1 & 0xffff)|0) + (r0 & 0xffff)|0;\n                w1 = ((imul(ul, vh)|0) + (r1 >>> 16)|0) + (r0 >>> 16)|0;\n                w2 = ((imul(uh, vl)|0) + (w1 & 0xffff)|0) + (w0 >>> 16)|0;\n                r1 = ((imul(uh, vh)|0) + (w2 >>> 16)|0) + (w1 >>> 16)|0;\n                r0 = (w2 << 16) | (w0 & 0xffff);\n                HEAP32[(T+k)>>2] = r0;\n            }\n            k = (i+j)|0;\n            r0 = HEAP32[(T+k)>>2]|0;\n            w0 = ((r0 & 0xffff) + (r1 & 0xffff)|0) + c|0;\n            w1 = ((r0 >>> 16) + (r1 >>> 16)|0) + (w0 >>> 16)|0;\n            HEAP32[(T+k)>>2] = (w1 << 16) | (w0 & 0xffff);\n            c = w1 >>> 16;\n        }\n\n        cp( lN, (T+lN)|0, R );\n\n        sfree(lN<<1);\n\n        if ( c | ( (cmp( N, lN, R, lN )|0) <= 0 ) ) {\n            sub( R, lN, N, lN, R, lN )|0;\n        }\n    }\n\n    return {\n        sreset: sreset,\n        salloc: salloc,\n        sfree:  sfree,\n        z: z,\n        tst: tst,\n        neg: neg,\n        cmp: cmp,\n        add: add,\n        sub: sub,\n        mul: mul,\n        sqr: sqr,\n        div: div,\n        mredc: mredc\n    };\n};\n\nfunction Number_extGCD(a, b) {\n    var sa = a < 0 ? -1 : 1, sb = b < 0 ? -1 : 1, xi = 1, xj = 0, yi = 0, yj = 1, r, q, t, a_cmp_b;\n    a *= sa;\n    b *= sb;\n    a_cmp_b = a < b;\n    if (a_cmp_b) {\n        t = a;\n        (a = b), (b = t);\n        t = sa;\n        sa = sb;\n        sb = t;\n    }\n    (q = Math.floor(a / b)), (r = a - q * b);\n    while (r) {\n        (t = xi - q * xj), (xi = xj), (xj = t);\n        (t = yi - q * yj), (yi = yj), (yj = t);\n        (a = b), (b = r);\n        (q = Math.floor(a / b)), (r = a - q * b);\n    }\n    xj *= sa;\n    yj *= sb;\n    if (a_cmp_b) {\n        t = xj;\n        (xj = yj), (yj = t);\n    }\n    return {\n        gcd: b,\n        x: xj,\n        y: yj,\n    };\n}\nfunction BigNumber_extGCD(a, b) {\n    let sa = a.sign;\n    let sb = b.sign;\n    if (sa < 0)\n        a = a.negate();\n    if (sb < 0)\n        b = b.negate();\n    const a_cmp_b = a.compare(b);\n    if (a_cmp_b < 0) {\n        let t = a;\n        (a = b), (b = t);\n        let t2 = sa;\n        sa = sb;\n        sb = t2;\n    }\n    var xi = BigNumber.ONE, xj = BigNumber.ZERO, lx = b.bitLength, yi = BigNumber.ZERO, yj = BigNumber.ONE, ly = a.bitLength, z, r, q;\n    z = a.divide(b);\n    while ((r = z.remainder) !== BigNumber.ZERO) {\n        q = z.quotient;\n        (z = xi.subtract(q.multiply(xj).clamp(lx)).clamp(lx)), (xi = xj), (xj = z);\n        (z = yi.subtract(q.multiply(yj).clamp(ly)).clamp(ly)), (yi = yj), (yj = z);\n        (a = b), (b = r);\n        z = a.divide(b);\n    }\n    if (sa < 0)\n        xj = xj.negate();\n    if (sb < 0)\n        yj = yj.negate();\n    if (a_cmp_b < 0) {\n        let t = xj;\n        (xj = yj), (yj = t);\n    }\n    return {\n        gcd: b,\n        x: xj,\n        y: yj,\n    };\n}\n\nfunction getRandomValues(buf) {\n    if (typeof process !== 'undefined') {\n        const nodeCrypto = require('crypto');\n        const bytes = nodeCrypto.randomBytes(buf.length);\n        buf.set(bytes);\n        return;\n    }\n    if (window.crypto && window.crypto.getRandomValues) {\n        window.crypto.getRandomValues(buf);\n        return;\n    }\n    if (self.crypto && self.crypto.getRandomValues) {\n        self.crypto.getRandomValues(buf);\n        return;\n    }\n    // @ts-ignore\n    if (window.msCrypto && window.msCrypto.getRandomValues) {\n        // @ts-ignore\n        window.msCrypto.getRandomValues(buf);\n        return;\n    }\n    throw new Error('No secure random number generator available.');\n}\n\n///////////////////////////////////////////////////////////////////////////////\nconst _bigint_stdlib = { Uint32Array: Uint32Array, Math: Math };\nconst _bigint_heap = new Uint32Array(0x100000);\nlet _bigint_asm;\nfunction _half_imul(a, b) {\n    return (a * b) | 0;\n}\nif (_bigint_stdlib.Math.imul === undefined) {\n    _bigint_stdlib.Math.imul = _half_imul;\n    _bigint_asm = bigint_asm(_bigint_stdlib, null, _bigint_heap.buffer);\n    delete _bigint_stdlib.Math.imul;\n}\nelse {\n    _bigint_asm = bigint_asm(_bigint_stdlib, null, _bigint_heap.buffer);\n}\n///////////////////////////////////////////////////////////////////////////////\nconst _BigNumber_ZERO_limbs = new Uint32Array(0);\nclass BigNumber {\n    constructor(num) {\n        let limbs = _BigNumber_ZERO_limbs;\n        let bitlen = 0;\n        let sign = 0;\n        if (num === undefined) ;\n        else {\n            for (var i = 0; !num[i]; i++)\n                ;\n            bitlen = (num.length - i) * 8;\n            if (!bitlen)\n                return BigNumber.ZERO;\n            limbs = new Uint32Array((bitlen + 31) >> 5);\n            for (var j = num.length - 4; j >= i; j -= 4) {\n                limbs[(num.length - 4 - j) >> 2] = (num[j] << 24) | (num[j + 1] << 16) | (num[j + 2] << 8) | num[j + 3];\n            }\n            if (i - j === 3) {\n                limbs[limbs.length - 1] = num[i];\n            }\n            else if (i - j === 2) {\n                limbs[limbs.length - 1] = (num[i] << 8) | num[i + 1];\n            }\n            else if (i - j === 1) {\n                limbs[limbs.length - 1] = (num[i] << 16) | (num[i + 1] << 8) | num[i + 2];\n            }\n            sign = 1;\n        }\n        this.limbs = limbs;\n        this.bitLength = bitlen;\n        this.sign = sign;\n    }\n    static fromString(str) {\n        const bytes = string_to_bytes(str);\n        return new BigNumber(bytes);\n    }\n    static fromNumber(num) {\n        let limbs = _BigNumber_ZERO_limbs;\n        let bitlen = 0;\n        let sign = 0;\n        var absnum = Math.abs(num);\n        if (absnum > 0xffffffff) {\n            limbs = new Uint32Array(2);\n            limbs[0] = absnum | 0;\n            limbs[1] = (absnum / 0x100000000) | 0;\n            bitlen = 52;\n        }\n        else if (absnum > 0) {\n            limbs = new Uint32Array(1);\n            limbs[0] = absnum;\n            bitlen = 32;\n        }\n        else {\n            limbs = _BigNumber_ZERO_limbs;\n            bitlen = 0;\n        }\n        sign = num < 0 ? -1 : 1;\n        return BigNumber.fromConfig({ limbs, bitLength: bitlen, sign });\n    }\n    static fromArrayBuffer(buffer) {\n        return new BigNumber(new Uint8Array(buffer));\n    }\n    static fromConfig(obj) {\n        const bn = new BigNumber();\n        bn.limbs = new Uint32Array(obj.limbs);\n        bn.bitLength = obj.bitLength;\n        bn.sign = obj.sign;\n        return bn;\n    }\n    toString(radix) {\n        radix = radix || 16;\n        const limbs = this.limbs;\n        const bitlen = this.bitLength;\n        let str = '';\n        if (radix === 16) {\n            // FIXME clamp last limb to (bitlen % 32)\n            for (var i = ((bitlen + 31) >> 5) - 1; i >= 0; i--) {\n                var h = limbs[i].toString(16);\n                str += '00000000'.substr(h.length);\n                str += h;\n            }\n            str = str.replace(/^0+/, '');\n            if (!str.length)\n                str = '0';\n        }\n        else {\n            throw new IllegalArgumentError('bad radix');\n        }\n        if (this.sign < 0)\n            str = '-' + str;\n        return str;\n    }\n    toBytes() {\n        const bitlen = this.bitLength;\n        const limbs = this.limbs;\n        if (bitlen === 0)\n            return new Uint8Array(0);\n        const bytelen = (bitlen + 7) >> 3;\n        const bytes = new Uint8Array(bytelen);\n        for (let i = 0; i < bytelen; i++) {\n            let j = bytelen - i - 1;\n            bytes[i] = limbs[j >> 2] >> ((j & 3) << 3);\n        }\n        return bytes;\n    }\n    /**\n     * Downgrade to Number\n     */\n    valueOf() {\n        const limbs = this.limbs;\n        const bits = this.bitLength;\n        const sign = this.sign;\n        if (!sign)\n            return 0;\n        if (bits <= 32)\n            return sign * (limbs[0] >>> 0);\n        if (bits <= 52)\n            return sign * (0x100000000 * (limbs[1] >>> 0) + (limbs[0] >>> 0));\n        // normalization\n        let i, l, e = 0;\n        for (i = limbs.length - 1; i >= 0; i--) {\n            if ((l = limbs[i]) === 0)\n                continue;\n            while (((l << e) & 0x80000000) === 0)\n                e++;\n            break;\n        }\n        if (i === 0)\n            return sign * (limbs[0] >>> 0);\n        return (sign *\n            (0x100000 * (((limbs[i] << e) | (e ? limbs[i - 1] >>> (32 - e) : 0)) >>> 0) +\n                (((limbs[i - 1] << e) | (e && i > 1 ? limbs[i - 2] >>> (32 - e) : 0)) >>> 12)) *\n            Math.pow(2, 32 * i - e - 52));\n    }\n    clamp(b) {\n        const limbs = this.limbs;\n        const bitlen = this.bitLength;\n        // FIXME check b is number and in a valid range\n        if (b >= bitlen)\n            return this;\n        const clamped = new BigNumber();\n        let n = (b + 31) >> 5;\n        let k = b % 32;\n        clamped.limbs = new Uint32Array(limbs.subarray(0, n));\n        clamped.bitLength = b;\n        clamped.sign = this.sign;\n        if (k)\n            clamped.limbs[n - 1] &= -1 >>> (32 - k);\n        return clamped;\n    }\n    slice(f, b) {\n        const limbs = this.limbs;\n        const bitlen = this.bitLength;\n        if (f < 0)\n            throw new RangeError('TODO');\n        if (f >= bitlen)\n            return BigNumber.ZERO;\n        if (b === undefined || b > bitlen - f)\n            b = bitlen - f;\n        const sliced = new BigNumber();\n        let n = f >> 5;\n        let m = (f + b + 31) >> 5;\n        let l = (b + 31) >> 5;\n        let t = f % 32;\n        let k = b % 32;\n        const slimbs = new Uint32Array(l);\n        if (t) {\n            for (var i = 0; i < m - n - 1; i++) {\n                slimbs[i] = (limbs[n + i] >>> t) | (limbs[n + i + 1] << (32 - t));\n            }\n            slimbs[i] = limbs[n + i] >>> t;\n        }\n        else {\n            slimbs.set(limbs.subarray(n, m));\n        }\n        if (k) {\n            slimbs[l - 1] &= -1 >>> (32 - k);\n        }\n        sliced.limbs = slimbs;\n        sliced.bitLength = b;\n        sliced.sign = this.sign;\n        return sliced;\n    }\n    negate() {\n        const negative = new BigNumber();\n        negative.limbs = this.limbs;\n        negative.bitLength = this.bitLength;\n        negative.sign = -1 * this.sign;\n        return negative;\n    }\n    compare(that) {\n        var alimbs = this.limbs, alimbcnt = alimbs.length, blimbs = that.limbs, blimbcnt = blimbs.length, z = 0;\n        if (this.sign < that.sign)\n            return -1;\n        if (this.sign > that.sign)\n            return 1;\n        _bigint_heap.set(alimbs, 0);\n        _bigint_heap.set(blimbs, alimbcnt);\n        z = _bigint_asm.cmp(0, alimbcnt << 2, alimbcnt << 2, blimbcnt << 2);\n        return z * this.sign;\n    }\n    add(that) {\n        if (!this.sign)\n            return that;\n        if (!that.sign)\n            return this;\n        var abitlen = this.bitLength, alimbs = this.limbs, alimbcnt = alimbs.length, asign = this.sign, bbitlen = that.bitLength, blimbs = that.limbs, blimbcnt = blimbs.length, bsign = that.sign, rbitlen, rlimbcnt, rsign, rof, result = new BigNumber();\n        rbitlen = (abitlen > bbitlen ? abitlen : bbitlen) + (asign * bsign > 0 ? 1 : 0);\n        rlimbcnt = (rbitlen + 31) >> 5;\n        _bigint_asm.sreset();\n        var pA = _bigint_asm.salloc(alimbcnt << 2), pB = _bigint_asm.salloc(blimbcnt << 2), pR = _bigint_asm.salloc(rlimbcnt << 2);\n        _bigint_asm.z(pR - pA + (rlimbcnt << 2), 0, pA);\n        _bigint_heap.set(alimbs, pA >> 2);\n        _bigint_heap.set(blimbs, pB >> 2);\n        if (asign * bsign > 0) {\n            _bigint_asm.add(pA, alimbcnt << 2, pB, blimbcnt << 2, pR, rlimbcnt << 2);\n            rsign = asign;\n        }\n        else if (asign > bsign) {\n            rof = _bigint_asm.sub(pA, alimbcnt << 2, pB, blimbcnt << 2, pR, rlimbcnt << 2);\n            rsign = rof ? bsign : asign;\n        }\n        else {\n            rof = _bigint_asm.sub(pB, blimbcnt << 2, pA, alimbcnt << 2, pR, rlimbcnt << 2);\n            rsign = rof ? asign : bsign;\n        }\n        if (rof)\n            _bigint_asm.neg(pR, rlimbcnt << 2, pR, rlimbcnt << 2);\n        if (_bigint_asm.tst(pR, rlimbcnt << 2) === 0)\n            return BigNumber.ZERO;\n        result.limbs = new Uint32Array(_bigint_heap.subarray(pR >> 2, (pR >> 2) + rlimbcnt));\n        result.bitLength = rbitlen;\n        result.sign = rsign;\n        return result;\n    }\n    subtract(that) {\n        return this.add(that.negate());\n    }\n    square() {\n        if (!this.sign)\n            return BigNumber.ZERO;\n        var abitlen = this.bitLength, alimbs = this.limbs, alimbcnt = alimbs.length, rbitlen, rlimbcnt, result = new BigNumber();\n        rbitlen = abitlen << 1;\n        rlimbcnt = (rbitlen + 31) >> 5;\n        _bigint_asm.sreset();\n        var pA = _bigint_asm.salloc(alimbcnt << 2), pR = _bigint_asm.salloc(rlimbcnt << 2);\n        _bigint_asm.z(pR - pA + (rlimbcnt << 2), 0, pA);\n        _bigint_heap.set(alimbs, pA >> 2);\n        _bigint_asm.sqr(pA, alimbcnt << 2, pR);\n        result.limbs = new Uint32Array(_bigint_heap.subarray(pR >> 2, (pR >> 2) + rlimbcnt));\n        result.bitLength = rbitlen;\n        result.sign = 1;\n        return result;\n    }\n    divide(that) {\n        var abitlen = this.bitLength, alimbs = this.limbs, alimbcnt = alimbs.length, bbitlen = that.bitLength, blimbs = that.limbs, blimbcnt = blimbs.length, qlimbcnt, rlimbcnt, quotient = BigNumber.ZERO, remainder = BigNumber.ZERO;\n        _bigint_asm.sreset();\n        var pA = _bigint_asm.salloc(alimbcnt << 2), pB = _bigint_asm.salloc(blimbcnt << 2), pQ = _bigint_asm.salloc(alimbcnt << 2);\n        _bigint_asm.z(pQ - pA + (alimbcnt << 2), 0, pA);\n        _bigint_heap.set(alimbs, pA >> 2);\n        _bigint_heap.set(blimbs, pB >> 2);\n        _bigint_asm.div(pA, alimbcnt << 2, pB, blimbcnt << 2, pQ);\n        qlimbcnt = _bigint_asm.tst(pQ, alimbcnt << 2) >> 2;\n        if (qlimbcnt) {\n            quotient = new BigNumber();\n            quotient.limbs = new Uint32Array(_bigint_heap.subarray(pQ >> 2, (pQ >> 2) + qlimbcnt));\n            quotient.bitLength = abitlen < qlimbcnt << 5 ? abitlen : qlimbcnt << 5;\n            quotient.sign = this.sign * that.sign;\n        }\n        rlimbcnt = _bigint_asm.tst(pA, blimbcnt << 2) >> 2;\n        if (rlimbcnt) {\n            remainder = new BigNumber();\n            remainder.limbs = new Uint32Array(_bigint_heap.subarray(pA >> 2, (pA >> 2) + rlimbcnt));\n            remainder.bitLength = bbitlen < rlimbcnt << 5 ? bbitlen : rlimbcnt << 5;\n            remainder.sign = this.sign;\n        }\n        return {\n            quotient: quotient,\n            remainder: remainder,\n        };\n    }\n    multiply(that) {\n        if (!this.sign || !that.sign)\n            return BigNumber.ZERO;\n        var abitlen = this.bitLength, alimbs = this.limbs, alimbcnt = alimbs.length, bbitlen = that.bitLength, blimbs = that.limbs, blimbcnt = blimbs.length, rbitlen, rlimbcnt, result = new BigNumber();\n        rbitlen = abitlen + bbitlen;\n        rlimbcnt = (rbitlen + 31) >> 5;\n        _bigint_asm.sreset();\n        var pA = _bigint_asm.salloc(alimbcnt << 2), pB = _bigint_asm.salloc(blimbcnt << 2), pR = _bigint_asm.salloc(rlimbcnt << 2);\n        _bigint_asm.z(pR - pA + (rlimbcnt << 2), 0, pA);\n        _bigint_heap.set(alimbs, pA >> 2);\n        _bigint_heap.set(blimbs, pB >> 2);\n        _bigint_asm.mul(pA, alimbcnt << 2, pB, blimbcnt << 2, pR, rlimbcnt << 2);\n        result.limbs = new Uint32Array(_bigint_heap.subarray(pR >> 2, (pR >> 2) + rlimbcnt));\n        result.sign = this.sign * that.sign;\n        result.bitLength = rbitlen;\n        return result;\n    }\n    isMillerRabinProbablePrime(rounds) {\n        var t = BigNumber.fromConfig(this), s = 0;\n        t.limbs[0] -= 1;\n        while (t.limbs[s >> 5] === 0)\n            s += 32;\n        while (((t.limbs[s >> 5] >> (s & 31)) & 1) === 0)\n            s++;\n        t = t.slice(s);\n        var m = new Modulus(this), m1 = this.subtract(BigNumber.ONE), a = BigNumber.fromConfig(this), l = this.limbs.length - 1;\n        while (a.limbs[l] === 0)\n            l--;\n        while (--rounds >= 0) {\n            getRandomValues(a.limbs);\n            if (a.limbs[0] < 2)\n                a.limbs[0] += 2;\n            while (a.compare(m1) >= 0)\n                a.limbs[l] >>>= 1;\n            var x = m.power(a, t);\n            if (x.compare(BigNumber.ONE) === 0)\n                continue;\n            if (x.compare(m1) === 0)\n                continue;\n            var c = s;\n            while (--c > 0) {\n                x = x.square().divide(m).remainder;\n                if (x.compare(BigNumber.ONE) === 0)\n                    return false;\n                if (x.compare(m1) === 0)\n                    break;\n            }\n            if (c === 0)\n                return false;\n        }\n        return true;\n    }\n    isProbablePrime(paranoia = 80) {\n        var limbs = this.limbs;\n        var i = 0;\n        // Oddity test\n        // (50% false positive probability)\n        if ((limbs[0] & 1) === 0)\n            return false;\n        if (paranoia <= 1)\n            return true;\n        // Magic divisors (3, 5, 17) test\n        // (~25% false positive probability)\n        var s3 = 0, s5 = 0, s17 = 0;\n        for (i = 0; i < limbs.length; i++) {\n            var l3 = limbs[i];\n            while (l3) {\n                s3 += l3 & 3;\n                l3 >>>= 2;\n            }\n            var l5 = limbs[i];\n            while (l5) {\n                s5 += l5 & 3;\n                l5 >>>= 2;\n                s5 -= l5 & 3;\n                l5 >>>= 2;\n            }\n            var l17 = limbs[i];\n            while (l17) {\n                s17 += l17 & 15;\n                l17 >>>= 4;\n                s17 -= l17 & 15;\n                l17 >>>= 4;\n            }\n        }\n        if (!(s3 % 3) || !(s5 % 5) || !(s17 % 17))\n            return false;\n        if (paranoia <= 2)\n            return true;\n        // Miller-Rabin test\n        // (≤ 4^(-k) false positive probability)\n        return this.isMillerRabinProbablePrime(paranoia >>> 1);\n    }\n}\nBigNumber.extGCD = BigNumber_extGCD;\nBigNumber.ZERO = BigNumber.fromNumber(0);\nBigNumber.ONE = BigNumber.fromNumber(1);\nclass Modulus extends BigNumber {\n    constructor(number) {\n        super();\n        this.limbs = number.limbs;\n        this.bitLength = number.bitLength;\n        this.sign = number.sign;\n        if (this.valueOf() < 1)\n            throw new RangeError();\n        if (this.bitLength <= 32)\n            return;\n        let comodulus;\n        if (this.limbs[0] & 1) {\n            const bitlen = ((this.bitLength + 31) & -32) + 1;\n            const limbs = new Uint32Array((bitlen + 31) >> 5);\n            limbs[limbs.length - 1] = 1;\n            comodulus = new BigNumber();\n            comodulus.sign = 1;\n            comodulus.bitLength = bitlen;\n            comodulus.limbs = limbs;\n            const k = Number_extGCD(0x100000000, this.limbs[0]).y;\n            this.coefficient = k < 0 ? -k : 0x100000000 - k;\n        }\n        else {\n            /**\n             * TODO even modulus reduction\n             * Modulus represented as `N = 2^U * V`, where `V` is odd and thus `GCD(2^U, V) = 1`.\n             * Calculation `A = TR' mod V` is made as for odd modulo using Montgomery method.\n             * Calculation `B = TR' mod 2^U` is easy as modulus is a power of 2.\n             * Using Chinese Remainder Theorem and Garner's Algorithm restore `TR' mod N` from `A` and `B`.\n             */\n            return;\n        }\n        this.comodulus = comodulus;\n        this.comodulusRemainder = comodulus.divide(this).remainder;\n        this.comodulusRemainderSquare = comodulus.square().divide(this).remainder;\n    }\n    /**\n     * Modular reduction\n     */\n    reduce(a) {\n        if (a.bitLength <= 32 && this.bitLength <= 32)\n            return BigNumber.fromNumber(a.valueOf() % this.valueOf());\n        if (a.compare(this) < 0)\n            return a;\n        return a.divide(this).remainder;\n    }\n    /**\n     * Modular inverse\n     */\n    inverse(a) {\n        a = this.reduce(a);\n        const r = BigNumber_extGCD(this, a);\n        if (r.gcd.valueOf() !== 1)\n            throw new Error('GCD is not 1');\n        if (r.y.sign < 0)\n            return r.y.add(this).clamp(this.bitLength);\n        return r.y;\n    }\n    /**\n     * Modular exponentiation\n     */\n    power(g, e) {\n        // count exponent set bits\n        let c = 0;\n        for (let i = 0; i < e.limbs.length; i++) {\n            let t = e.limbs[i];\n            while (t) {\n                if (t & 1)\n                    c++;\n                t >>>= 1;\n            }\n        }\n        // window size parameter\n        let k = 8;\n        if (e.bitLength <= 4536)\n            k = 7;\n        if (e.bitLength <= 1736)\n            k = 6;\n        if (e.bitLength <= 630)\n            k = 5;\n        if (e.bitLength <= 210)\n            k = 4;\n        if (e.bitLength <= 60)\n            k = 3;\n        if (e.bitLength <= 12)\n            k = 2;\n        if (c <= 1 << (k - 1))\n            k = 1;\n        // montgomerize base\n        g = Modulus._Montgomery_reduce(this.reduce(g).multiply(this.comodulusRemainderSquare), this);\n        // precompute odd powers\n        const g2 = Modulus._Montgomery_reduce(g.square(), this), gn = new Array(1 << (k - 1));\n        gn[0] = g;\n        gn[1] = Modulus._Montgomery_reduce(g.multiply(g2), this);\n        for (let i = 2; i < 1 << (k - 1); i++) {\n            gn[i] = Modulus._Montgomery_reduce(gn[i - 1].multiply(g2), this);\n        }\n        // perform exponentiation\n        const u = this.comodulusRemainder;\n        let r = u;\n        for (let i = e.limbs.length - 1; i >= 0; i--) {\n            let t = e.limbs[i];\n            for (let j = 32; j > 0;) {\n                if (t & 0x80000000) {\n                    let n = t >>> (32 - k), l = k;\n                    while ((n & 1) === 0) {\n                        n >>>= 1;\n                        l--;\n                    }\n                    var m = gn[n >>> 1];\n                    while (n) {\n                        n >>>= 1;\n                        if (r !== u)\n                            r = Modulus._Montgomery_reduce(r.square(), this);\n                    }\n                    r = r !== u ? Modulus._Montgomery_reduce(r.multiply(m), this) : m;\n                    (t <<= l), (j -= l);\n                }\n                else {\n                    if (r !== u)\n                        r = Modulus._Montgomery_reduce(r.square(), this);\n                    (t <<= 1), j--;\n                }\n            }\n        }\n        // de-montgomerize result\n        return Modulus._Montgomery_reduce(r, this);\n    }\n    static _Montgomery_reduce(a, n) {\n        const alimbs = a.limbs;\n        const alimbcnt = alimbs.length;\n        const nlimbs = n.limbs;\n        const nlimbcnt = nlimbs.length;\n        const y = n.coefficient;\n        _bigint_asm.sreset();\n        const pA = _bigint_asm.salloc(alimbcnt << 2), pN = _bigint_asm.salloc(nlimbcnt << 2), pR = _bigint_asm.salloc(nlimbcnt << 2);\n        _bigint_asm.z(pR - pA + (nlimbcnt << 2), 0, pA);\n        _bigint_heap.set(alimbs, pA >> 2);\n        _bigint_heap.set(nlimbs, pN >> 2);\n        _bigint_asm.mredc(pA, alimbcnt << 2, pN, nlimbcnt << 2, y, pR);\n        const result = new BigNumber();\n        result.limbs = new Uint32Array(_bigint_heap.subarray(pR >> 2, (pR >> 2) + nlimbcnt));\n        result.bitLength = n.bitLength;\n        result.sign = 1;\n        return result;\n    }\n}\n\nvar sha1_asm = function ( stdlib, foreign, buffer ) {\n    \"use asm\";\n\n    // SHA256 state\n    var H0 = 0, H1 = 0, H2 = 0, H3 = 0, H4 = 0,\n        TOTAL0 = 0, TOTAL1 = 0;\n\n    // HMAC state\n    var I0 = 0, I1 = 0, I2 = 0, I3 = 0, I4 = 0,\n        O0 = 0, O1 = 0, O2 = 0, O3 = 0, O4 = 0;\n\n    // I/O buffer\n    var HEAP = new stdlib.Uint8Array(buffer);\n\n    function _core ( w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15 ) {\n        w0 = w0|0;\n        w1 = w1|0;\n        w2 = w2|0;\n        w3 = w3|0;\n        w4 = w4|0;\n        w5 = w5|0;\n        w6 = w6|0;\n        w7 = w7|0;\n        w8 = w8|0;\n        w9 = w9|0;\n        w10 = w10|0;\n        w11 = w11|0;\n        w12 = w12|0;\n        w13 = w13|0;\n        w14 = w14|0;\n        w15 = w15|0;\n\n        var a = 0, b = 0, c = 0, d = 0, e = 0, n = 0, t = 0,\n            w16 = 0, w17 = 0, w18 = 0, w19 = 0,\n            w20 = 0, w21 = 0, w22 = 0, w23 = 0, w24 = 0, w25 = 0, w26 = 0, w27 = 0, w28 = 0, w29 = 0,\n            w30 = 0, w31 = 0, w32 = 0, w33 = 0, w34 = 0, w35 = 0, w36 = 0, w37 = 0, w38 = 0, w39 = 0,\n            w40 = 0, w41 = 0, w42 = 0, w43 = 0, w44 = 0, w45 = 0, w46 = 0, w47 = 0, w48 = 0, w49 = 0,\n            w50 = 0, w51 = 0, w52 = 0, w53 = 0, w54 = 0, w55 = 0, w56 = 0, w57 = 0, w58 = 0, w59 = 0,\n            w60 = 0, w61 = 0, w62 = 0, w63 = 0, w64 = 0, w65 = 0, w66 = 0, w67 = 0, w68 = 0, w69 = 0,\n            w70 = 0, w71 = 0, w72 = 0, w73 = 0, w74 = 0, w75 = 0, w76 = 0, w77 = 0, w78 = 0, w79 = 0;\n\n        a = H0;\n        b = H1;\n        c = H2;\n        d = H3;\n        e = H4;\n\n        // 0\n        t = ( w0 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 1\n        t = ( w1 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 2\n        t = ( w2 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 3\n        t = ( w3 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 4\n        t = ( w4 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 5\n        t = ( w5 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 6\n        t = ( w6 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 7\n        t = ( w7 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 8\n        t = ( w8 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 9\n        t = ( w9 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 10\n        t = ( w10 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 11\n        t = ( w11 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 12\n        t = ( w12 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 13\n        t = ( w13 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 14\n        t = ( w14 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 15\n        t = ( w15 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 16\n        n = w13 ^ w8 ^ w2 ^ w0;\n        w16 = (n << 1) | (n >>> 31);\n        t = (w16 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 17\n        n = w14 ^ w9 ^ w3 ^ w1;\n        w17 = (n << 1) | (n >>> 31);\n        t = (w17 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 18\n        n = w15 ^ w10 ^ w4 ^ w2;\n        w18 = (n << 1) | (n >>> 31);\n        t = (w18 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 19\n        n = w16 ^ w11 ^ w5 ^ w3;\n        w19 = (n << 1) | (n >>> 31);\n        t = (w19 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (~b & d)) + 0x5a827999 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 20\n        n = w17 ^ w12 ^ w6 ^ w4;\n        w20 = (n << 1) | (n >>> 31);\n        t = (w20 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 21\n        n = w18 ^ w13 ^ w7 ^ w5;\n        w21 = (n << 1) | (n >>> 31);\n        t = (w21 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 22\n        n = w19 ^ w14 ^ w8 ^ w6;\n        w22 = (n << 1) | (n >>> 31);\n        t = (w22 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 23\n        n = w20 ^ w15 ^ w9 ^ w7;\n        w23 = (n << 1) | (n >>> 31);\n        t = (w23 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 24\n        n = w21 ^ w16 ^ w10 ^ w8;\n        w24 = (n << 1) | (n >>> 31);\n        t = (w24 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 25\n        n = w22 ^ w17 ^ w11 ^ w9;\n        w25 = (n << 1) | (n >>> 31);\n        t = (w25 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 26\n        n = w23 ^ w18 ^ w12 ^ w10;\n        w26 = (n << 1) | (n >>> 31);\n        t = (w26 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 27\n        n = w24 ^ w19 ^ w13 ^ w11;\n        w27 = (n << 1) | (n >>> 31);\n        t = (w27 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 28\n        n = w25 ^ w20 ^ w14 ^ w12;\n        w28 = (n << 1) | (n >>> 31);\n        t = (w28 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 29\n        n = w26 ^ w21 ^ w15 ^ w13;\n        w29 = (n << 1) | (n >>> 31);\n        t = (w29 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 30\n        n = w27 ^ w22 ^ w16 ^ w14;\n        w30 = (n << 1) | (n >>> 31);\n        t = (w30 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 31\n        n = w28 ^ w23 ^ w17 ^ w15;\n        w31 = (n << 1) | (n >>> 31);\n        t = (w31 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 32\n        n = w29 ^ w24 ^ w18 ^ w16;\n        w32 = (n << 1) | (n >>> 31);\n        t = (w32 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 33\n        n = w30 ^ w25 ^ w19 ^ w17;\n        w33 = (n << 1) | (n >>> 31);\n        t = (w33 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 34\n        n = w31 ^ w26 ^ w20 ^ w18;\n        w34 = (n << 1) | (n >>> 31);\n        t = (w34 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 35\n        n = w32 ^ w27 ^ w21 ^ w19;\n        w35 = (n << 1) | (n >>> 31);\n        t = (w35 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 36\n        n = w33 ^ w28 ^ w22 ^ w20;\n        w36 = (n << 1) | (n >>> 31);\n        t = (w36 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 37\n        n = w34 ^ w29 ^ w23 ^ w21;\n        w37 = (n << 1) | (n >>> 31);\n        t = (w37 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 38\n        n = w35 ^ w30 ^ w24 ^ w22;\n        w38 = (n << 1) | (n >>> 31);\n        t = (w38 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 39\n        n = w36 ^ w31 ^ w25 ^ w23;\n        w39 = (n << 1) | (n >>> 31);\n        t = (w39 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) + 0x6ed9eba1 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 40\n        n = w37 ^ w32 ^ w26 ^ w24;\n        w40 = (n << 1) | (n >>> 31);\n        t = (w40 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 41\n        n = w38 ^ w33 ^ w27 ^ w25;\n        w41 = (n << 1) | (n >>> 31);\n        t = (w41 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 42\n        n = w39 ^ w34 ^ w28 ^ w26;\n        w42 = (n << 1) | (n >>> 31);\n        t = (w42 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 43\n        n = w40 ^ w35 ^ w29 ^ w27;\n        w43 = (n << 1) | (n >>> 31);\n        t = (w43 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 44\n        n = w41 ^ w36 ^ w30 ^ w28;\n        w44 = (n << 1) | (n >>> 31);\n        t = (w44 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 45\n        n = w42 ^ w37 ^ w31 ^ w29;\n        w45 = (n << 1) | (n >>> 31);\n        t = (w45 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 46\n        n = w43 ^ w38 ^ w32 ^ w30;\n        w46 = (n << 1) | (n >>> 31);\n        t = (w46 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 47\n        n = w44 ^ w39 ^ w33 ^ w31;\n        w47 = (n << 1) | (n >>> 31);\n        t = (w47 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 48\n        n = w45 ^ w40 ^ w34 ^ w32;\n        w48 = (n << 1) | (n >>> 31);\n        t = (w48 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 49\n        n = w46 ^ w41 ^ w35 ^ w33;\n        w49 = (n << 1) | (n >>> 31);\n        t = (w49 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 50\n        n = w47 ^ w42 ^ w36 ^ w34;\n        w50 = (n << 1) | (n >>> 31);\n        t = (w50 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 51\n        n = w48 ^ w43 ^ w37 ^ w35;\n        w51 = (n << 1) | (n >>> 31);\n        t = (w51 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 52\n        n = w49 ^ w44 ^ w38 ^ w36;\n        w52 = (n << 1) | (n >>> 31);\n        t = (w52 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 53\n        n = w50 ^ w45 ^ w39 ^ w37;\n        w53 = (n << 1) | (n >>> 31);\n        t = (w53 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 54\n        n = w51 ^ w46 ^ w40 ^ w38;\n        w54 = (n << 1) | (n >>> 31);\n        t = (w54 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 55\n        n = w52 ^ w47 ^ w41 ^ w39;\n        w55 = (n << 1) | (n >>> 31);\n        t = (w55 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 56\n        n = w53 ^ w48 ^ w42 ^ w40;\n        w56 = (n << 1) | (n >>> 31);\n        t = (w56 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 57\n        n = w54 ^ w49 ^ w43 ^ w41;\n        w57 = (n << 1) | (n >>> 31);\n        t = (w57 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 58\n        n = w55 ^ w50 ^ w44 ^ w42;\n        w58 = (n << 1) | (n >>> 31);\n        t = (w58 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 59\n        n = w56 ^ w51 ^ w45 ^ w43;\n        w59 = (n << 1) | (n >>> 31);\n        t = (w59 + ((a << 5) | (a >>> 27)) + e + ((b & c) | (b & d) | (c & d)) - 0x70e44324 )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 60\n        n = w57 ^ w52 ^ w46 ^ w44;\n        w60 = (n << 1) | (n >>> 31);\n        t = (w60 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 61\n        n = w58 ^ w53 ^ w47 ^ w45;\n        w61 = (n << 1) | (n >>> 31);\n        t = (w61 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 62\n        n = w59 ^ w54 ^ w48 ^ w46;\n        w62 = (n << 1) | (n >>> 31);\n        t = (w62 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 63\n        n = w60 ^ w55 ^ w49 ^ w47;\n        w63 = (n << 1) | (n >>> 31);\n        t = (w63 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 64\n        n = w61 ^ w56 ^ w50 ^ w48;\n        w64 = (n << 1) | (n >>> 31);\n        t = (w64 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 65\n        n = w62 ^ w57 ^ w51 ^ w49;\n        w65 = (n << 1) | (n >>> 31);\n        t = (w65 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 66\n        n = w63 ^ w58 ^ w52 ^ w50;\n        w66 = (n << 1) | (n >>> 31);\n        t = (w66 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 67\n        n = w64 ^ w59 ^ w53 ^ w51;\n        w67 = (n << 1) | (n >>> 31);\n        t = (w67 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 68\n        n = w65 ^ w60 ^ w54 ^ w52;\n        w68 = (n << 1) | (n >>> 31);\n        t = (w68 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 69\n        n = w66 ^ w61 ^ w55 ^ w53;\n        w69 = (n << 1) | (n >>> 31);\n        t = (w69 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 70\n        n = w67 ^ w62 ^ w56 ^ w54;\n        w70 = (n << 1) | (n >>> 31);\n        t = (w70 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 71\n        n = w68 ^ w63 ^ w57 ^ w55;\n        w71 = (n << 1) | (n >>> 31);\n        t = (w71 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 72\n        n = w69 ^ w64 ^ w58 ^ w56;\n        w72 = (n << 1) | (n >>> 31);\n        t = (w72 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 73\n        n = w70 ^ w65 ^ w59 ^ w57;\n        w73 = (n << 1) | (n >>> 31);\n        t = (w73 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 74\n        n = w71 ^ w66 ^ w60 ^ w58;\n        w74 = (n << 1) | (n >>> 31);\n        t = (w74 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 75\n        n = w72 ^ w67 ^ w61 ^ w59;\n        w75 = (n << 1) | (n >>> 31);\n        t = (w75 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 76\n        n = w73 ^ w68 ^ w62 ^ w60;\n        w76 = (n << 1) | (n >>> 31);\n        t = (w76 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 77\n        n = w74 ^ w69 ^ w63 ^ w61;\n        w77 = (n << 1) | (n >>> 31);\n        t = (w77 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 78\n        n = w75 ^ w70 ^ w64 ^ w62;\n        w78 = (n << 1) | (n >>> 31);\n        t = (w78 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        // 79\n        n = w76 ^ w71 ^ w65 ^ w63;\n        w79 = (n << 1) | (n >>> 31);\n        t = (w79 + ((a << 5) | (a >>> 27)) + e + (b ^ c ^ d) - 0x359d3e2a )|0;\n        e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n\n        H0 = ( H0 + a )|0;\n        H1 = ( H1 + b )|0;\n        H2 = ( H2 + c )|0;\n        H3 = ( H3 + d )|0;\n        H4 = ( H4 + e )|0;\n\n    }\n\n    function _core_heap ( offset ) {\n        offset = offset|0;\n\n        _core(\n            HEAP[offset|0]<<24 | HEAP[offset|1]<<16 | HEAP[offset|2]<<8 | HEAP[offset|3],\n            HEAP[offset|4]<<24 | HEAP[offset|5]<<16 | HEAP[offset|6]<<8 | HEAP[offset|7],\n            HEAP[offset|8]<<24 | HEAP[offset|9]<<16 | HEAP[offset|10]<<8 | HEAP[offset|11],\n            HEAP[offset|12]<<24 | HEAP[offset|13]<<16 | HEAP[offset|14]<<8 | HEAP[offset|15],\n            HEAP[offset|16]<<24 | HEAP[offset|17]<<16 | HEAP[offset|18]<<8 | HEAP[offset|19],\n            HEAP[offset|20]<<24 | HEAP[offset|21]<<16 | HEAP[offset|22]<<8 | HEAP[offset|23],\n            HEAP[offset|24]<<24 | HEAP[offset|25]<<16 | HEAP[offset|26]<<8 | HEAP[offset|27],\n            HEAP[offset|28]<<24 | HEAP[offset|29]<<16 | HEAP[offset|30]<<8 | HEAP[offset|31],\n            HEAP[offset|32]<<24 | HEAP[offset|33]<<16 | HEAP[offset|34]<<8 | HEAP[offset|35],\n            HEAP[offset|36]<<24 | HEAP[offset|37]<<16 | HEAP[offset|38]<<8 | HEAP[offset|39],\n            HEAP[offset|40]<<24 | HEAP[offset|41]<<16 | HEAP[offset|42]<<8 | HEAP[offset|43],\n            HEAP[offset|44]<<24 | HEAP[offset|45]<<16 | HEAP[offset|46]<<8 | HEAP[offset|47],\n            HEAP[offset|48]<<24 | HEAP[offset|49]<<16 | HEAP[offset|50]<<8 | HEAP[offset|51],\n            HEAP[offset|52]<<24 | HEAP[offset|53]<<16 | HEAP[offset|54]<<8 | HEAP[offset|55],\n            HEAP[offset|56]<<24 | HEAP[offset|57]<<16 | HEAP[offset|58]<<8 | HEAP[offset|59],\n            HEAP[offset|60]<<24 | HEAP[offset|61]<<16 | HEAP[offset|62]<<8 | HEAP[offset|63]\n        );\n    }\n\n    // offset — multiple of 32\n    function _state_to_heap ( output ) {\n        output = output|0;\n\n        HEAP[output|0] = H0>>>24;\n        HEAP[output|1] = H0>>>16&255;\n        HEAP[output|2] = H0>>>8&255;\n        HEAP[output|3] = H0&255;\n        HEAP[output|4] = H1>>>24;\n        HEAP[output|5] = H1>>>16&255;\n        HEAP[output|6] = H1>>>8&255;\n        HEAP[output|7] = H1&255;\n        HEAP[output|8] = H2>>>24;\n        HEAP[output|9] = H2>>>16&255;\n        HEAP[output|10] = H2>>>8&255;\n        HEAP[output|11] = H2&255;\n        HEAP[output|12] = H3>>>24;\n        HEAP[output|13] = H3>>>16&255;\n        HEAP[output|14] = H3>>>8&255;\n        HEAP[output|15] = H3&255;\n        HEAP[output|16] = H4>>>24;\n        HEAP[output|17] = H4>>>16&255;\n        HEAP[output|18] = H4>>>8&255;\n        HEAP[output|19] = H4&255;\n    }\n\n    function reset () {\n        H0 = 0x67452301;\n        H1 = 0xefcdab89;\n        H2 = 0x98badcfe;\n        H3 = 0x10325476;\n        H4 = 0xc3d2e1f0;\n        TOTAL0 = TOTAL1 = 0;\n    }\n\n    function init ( h0, h1, h2, h3, h4, total0, total1 ) {\n        h0 = h0|0;\n        h1 = h1|0;\n        h2 = h2|0;\n        h3 = h3|0;\n        h4 = h4|0;\n        total0 = total0|0;\n        total1 = total1|0;\n\n        H0 = h0;\n        H1 = h1;\n        H2 = h2;\n        H3 = h3;\n        H4 = h4;\n        TOTAL0 = total0;\n        TOTAL1 = total1;\n    }\n\n    // offset — multiple of 64\n    function process ( offset, length ) {\n        offset = offset|0;\n        length = length|0;\n\n        var hashed = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        while ( (length|0) >= 64 ) {\n            _core_heap(offset);\n\n            offset = ( offset + 64 )|0;\n            length = ( length - 64 )|0;\n\n            hashed = ( hashed + 64 )|0;\n        }\n\n        TOTAL0 = ( TOTAL0 + hashed )|0;\n        if ( TOTAL0>>>0 < hashed>>>0 ) TOTAL1 = ( TOTAL1 + 1 )|0;\n\n        return hashed|0;\n    }\n\n    // offset — multiple of 64\n    // output — multiple of 32\n    function finish ( offset, length, output ) {\n        offset = offset|0;\n        length = length|0;\n        output = output|0;\n\n        var hashed = 0,\n            i = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 31 )\n                return -1;\n\n        if ( (length|0) >= 64 ) {\n            hashed = process( offset, length )|0;\n            if ( (hashed|0) == -1 )\n                return -1;\n\n            offset = ( offset + hashed )|0;\n            length = ( length - hashed )|0;\n        }\n\n        hashed = ( hashed + length )|0;\n        TOTAL0 = ( TOTAL0 + length )|0;\n        if ( TOTAL0>>>0 < length>>>0 ) TOTAL1 = (TOTAL1 + 1)|0;\n\n        HEAP[offset|length] = 0x80;\n\n        if ( (length|0) >= 56 ) {\n            for ( i = (length+1)|0; (i|0) < 64; i = (i+1)|0 )\n                HEAP[offset|i] = 0x00;\n            _core_heap(offset);\n\n            length = 0;\n\n            HEAP[offset|0] = 0;\n        }\n\n        for ( i = (length+1)|0; (i|0) < 59; i = (i+1)|0 )\n            HEAP[offset|i] = 0;\n\n        HEAP[offset|56] = TOTAL1>>>21&255;\n        HEAP[offset|57] = TOTAL1>>>13&255;\n        HEAP[offset|58] = TOTAL1>>>5&255;\n        HEAP[offset|59] = TOTAL1<<3&255 | TOTAL0>>>29;\n        HEAP[offset|60] = TOTAL0>>>21&255;\n        HEAP[offset|61] = TOTAL0>>>13&255;\n        HEAP[offset|62] = TOTAL0>>>5&255;\n        HEAP[offset|63] = TOTAL0<<3&255;\n        _core_heap(offset);\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return hashed|0;\n    }\n\n    function hmac_reset () {\n        H0 = I0;\n        H1 = I1;\n        H2 = I2;\n        H3 = I3;\n        H4 = I4;\n        TOTAL0 = 64;\n        TOTAL1 = 0;\n    }\n\n    function _hmac_opad () {\n        H0 = O0;\n        H1 = O1;\n        H2 = O2;\n        H3 = O3;\n        H4 = O4;\n        TOTAL0 = 64;\n        TOTAL1 = 0;\n    }\n\n    function hmac_init ( p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15 ) {\n        p0 = p0|0;\n        p1 = p1|0;\n        p2 = p2|0;\n        p3 = p3|0;\n        p4 = p4|0;\n        p5 = p5|0;\n        p6 = p6|0;\n        p7 = p7|0;\n        p8 = p8|0;\n        p9 = p9|0;\n        p10 = p10|0;\n        p11 = p11|0;\n        p12 = p12|0;\n        p13 = p13|0;\n        p14 = p14|0;\n        p15 = p15|0;\n\n        // opad\n        reset();\n        _core(\n            p0 ^ 0x5c5c5c5c,\n            p1 ^ 0x5c5c5c5c,\n            p2 ^ 0x5c5c5c5c,\n            p3 ^ 0x5c5c5c5c,\n            p4 ^ 0x5c5c5c5c,\n            p5 ^ 0x5c5c5c5c,\n            p6 ^ 0x5c5c5c5c,\n            p7 ^ 0x5c5c5c5c,\n            p8 ^ 0x5c5c5c5c,\n            p9 ^ 0x5c5c5c5c,\n            p10 ^ 0x5c5c5c5c,\n            p11 ^ 0x5c5c5c5c,\n            p12 ^ 0x5c5c5c5c,\n            p13 ^ 0x5c5c5c5c,\n            p14 ^ 0x5c5c5c5c,\n            p15 ^ 0x5c5c5c5c\n        );\n        O0 = H0;\n        O1 = H1;\n        O2 = H2;\n        O3 = H3;\n        O4 = H4;\n\n        // ipad\n        reset();\n        _core(\n            p0 ^ 0x36363636,\n            p1 ^ 0x36363636,\n            p2 ^ 0x36363636,\n            p3 ^ 0x36363636,\n            p4 ^ 0x36363636,\n            p5 ^ 0x36363636,\n            p6 ^ 0x36363636,\n            p7 ^ 0x36363636,\n            p8 ^ 0x36363636,\n            p9 ^ 0x36363636,\n            p10 ^ 0x36363636,\n            p11 ^ 0x36363636,\n            p12 ^ 0x36363636,\n            p13 ^ 0x36363636,\n            p14 ^ 0x36363636,\n            p15 ^ 0x36363636\n        );\n        I0 = H0;\n        I1 = H1;\n        I2 = H2;\n        I3 = H3;\n        I4 = H4;\n\n        TOTAL0 = 64;\n        TOTAL1 = 0;\n    }\n\n    // offset — multiple of 64\n    // output — multiple of 32\n    function hmac_finish ( offset, length, output ) {\n        offset = offset|0;\n        length = length|0;\n        output = output|0;\n\n        var t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, hashed = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 31 )\n                return -1;\n\n        hashed = finish( offset, length, -1 )|0;\n        t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4;\n\n        _hmac_opad();\n        _core( t0, t1, t2, t3, t4, 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 672 );\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return hashed|0;\n    }\n\n    // salt is assumed to be already processed\n    // offset — multiple of 64\n    // output — multiple of 32\n    function pbkdf2_generate_block ( offset, length, block, count, output ) {\n        offset = offset|0;\n        length = length|0;\n        block = block|0;\n        count = count|0;\n        output = output|0;\n\n        var h0 = 0, h1 = 0, h2 = 0, h3 = 0, h4 = 0,\n            t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 31 )\n                return -1;\n\n        // pad block number into heap\n        // FIXME probable OOB write\n        HEAP[(offset+length)|0]   = block>>>24;\n        HEAP[(offset+length+1)|0] = block>>>16&255;\n        HEAP[(offset+length+2)|0] = block>>>8&255;\n        HEAP[(offset+length+3)|0] = block&255;\n\n        // finish first iteration\n        hmac_finish( offset, (length+4)|0, -1 )|0;\n        h0 = t0 = H0, h1 = t1 = H1, h2 = t2 = H2, h3 = t3 = H3, h4 = t4 = H4;\n        count = (count-1)|0;\n\n        // perform the rest iterations\n        while ( (count|0) > 0 ) {\n            hmac_reset();\n            _core( t0, t1, t2, t3, t4, 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 672 );\n            t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4;\n\n            _hmac_opad();\n            _core( t0, t1, t2, t3, t4, 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 672 );\n            t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4;\n\n            h0 = h0 ^ H0;\n            h1 = h1 ^ H1;\n            h2 = h2 ^ H2;\n            h3 = h3 ^ H3;\n            h4 = h4 ^ H4;\n\n            count = (count-1)|0;\n        }\n\n        H0 = h0;\n        H1 = h1;\n        H2 = h2;\n        H3 = h3;\n        H4 = h4;\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return 0;\n    }\n\n    return {\n      // SHA1\n      reset: reset,\n      init: init,\n      process: process,\n      finish: finish,\n\n      // HMAC-SHA1\n      hmac_reset: hmac_reset,\n      hmac_init: hmac_init,\n      hmac_finish: hmac_finish,\n\n      // PBKDF2-HMAC-SHA1\n      pbkdf2_generate_block: pbkdf2_generate_block\n    }\n};\n\nclass Hash {\n    constructor() {\n        this.pos = 0;\n        this.len = 0;\n    }\n    reset() {\n        this.result = null;\n        this.pos = 0;\n        this.len = 0;\n        this.asm.reset();\n        return this;\n    }\n    process(data) {\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        let asm = this.asm;\n        let heap = this.heap;\n        let hpos = this.pos;\n        let hlen = this.len;\n        let dpos = 0;\n        let dlen = data.length;\n        let wlen = 0;\n        while (dlen > 0) {\n            wlen = _heap_write(heap, hpos + hlen, data, dpos, dlen);\n            hlen += wlen;\n            dpos += wlen;\n            dlen -= wlen;\n            wlen = asm.process(hpos, hlen);\n            hpos += wlen;\n            hlen -= wlen;\n            if (!hlen)\n                hpos = 0;\n        }\n        this.pos = hpos;\n        this.len = hlen;\n        return this;\n    }\n    finish() {\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        this.asm.finish(this.pos, this.len, 0);\n        this.result = new Uint8Array(this.HASH_SIZE);\n        this.result.set(this.heap.subarray(0, this.HASH_SIZE));\n        this.pos = 0;\n        this.len = 0;\n        return this;\n    }\n}\n\nconst _sha1_block_size = 64;\nconst _sha1_hash_size = 20;\nclass Sha1 extends Hash {\n    constructor() {\n        super();\n        this.NAME = 'sha1';\n        this.BLOCK_SIZE = _sha1_block_size;\n        this.HASH_SIZE = _sha1_hash_size;\n        this.heap = _heap_init();\n        this.asm = sha1_asm({ Uint8Array: Uint8Array }, null, this.heap.buffer);\n        this.reset();\n    }\n}\nSha1.NAME = 'sha1';\n\nvar sha256_asm = function ( stdlib, foreign, buffer ) {\n    \"use asm\";\n\n    // SHA256 state\n    var H0 = 0, H1 = 0, H2 = 0, H3 = 0, H4 = 0, H5 = 0, H6 = 0, H7 = 0,\n        TOTAL0 = 0, TOTAL1 = 0;\n\n    // HMAC state\n    var I0 = 0, I1 = 0, I2 = 0, I3 = 0, I4 = 0, I5 = 0, I6 = 0, I7 = 0,\n        O0 = 0, O1 = 0, O2 = 0, O3 = 0, O4 = 0, O5 = 0, O6 = 0, O7 = 0;\n\n    // I/O buffer\n    var HEAP = new stdlib.Uint8Array(buffer);\n\n    function _core ( w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15 ) {\n        w0 = w0|0;\n        w1 = w1|0;\n        w2 = w2|0;\n        w3 = w3|0;\n        w4 = w4|0;\n        w5 = w5|0;\n        w6 = w6|0;\n        w7 = w7|0;\n        w8 = w8|0;\n        w9 = w9|0;\n        w10 = w10|0;\n        w11 = w11|0;\n        w12 = w12|0;\n        w13 = w13|0;\n        w14 = w14|0;\n        w15 = w15|0;\n\n        var a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0;\n\n        a = H0;\n        b = H1;\n        c = H2;\n        d = H3;\n        e = H4;\n        f = H5;\n        g = H6;\n        h = H7;\n        \n        // 0\n        h = ( w0 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0x428a2f98 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 1\n        g = ( w1 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0x71374491 )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 2\n        f = ( w2 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0xb5c0fbcf )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 3\n        e = ( w3 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0xe9b5dba5 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 4\n        d = ( w4 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0x3956c25b )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 5\n        c = ( w5 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0x59f111f1 )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 6\n        b = ( w6 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0x923f82a4 )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 7\n        a = ( w7 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0xab1c5ed5 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 8\n        h = ( w8 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0xd807aa98 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 9\n        g = ( w9 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0x12835b01 )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 10\n        f = ( w10 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0x243185be )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 11\n        e = ( w11 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0x550c7dc3 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 12\n        d = ( w12 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0x72be5d74 )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 13\n        c = ( w13 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0x80deb1fe )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 14\n        b = ( w14 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0x9bdc06a7 )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 15\n        a = ( w15 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0xc19bf174 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 16\n        w0 = ( ( w1>>>7  ^ w1>>>18 ^ w1>>>3  ^ w1<<25 ^ w1<<14 ) + ( w14>>>17 ^ w14>>>19 ^ w14>>>10 ^ w14<<15 ^ w14<<13 ) + w0 + w9 )|0;\n        h = ( w0 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0xe49b69c1 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 17\n        w1 = ( ( w2>>>7  ^ w2>>>18 ^ w2>>>3  ^ w2<<25 ^ w2<<14 ) + ( w15>>>17 ^ w15>>>19 ^ w15>>>10 ^ w15<<15 ^ w15<<13 ) + w1 + w10 )|0;\n        g = ( w1 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0xefbe4786 )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 18\n        w2 = ( ( w3>>>7  ^ w3>>>18 ^ w3>>>3  ^ w3<<25 ^ w3<<14 ) + ( w0>>>17 ^ w0>>>19 ^ w0>>>10 ^ w0<<15 ^ w0<<13 ) + w2 + w11 )|0;\n        f = ( w2 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0x0fc19dc6 )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 19\n        w3 = ( ( w4>>>7  ^ w4>>>18 ^ w4>>>3  ^ w4<<25 ^ w4<<14 ) + ( w1>>>17 ^ w1>>>19 ^ w1>>>10 ^ w1<<15 ^ w1<<13 ) + w3 + w12 )|0;\n        e = ( w3 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0x240ca1cc )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 20\n        w4 = ( ( w5>>>7  ^ w5>>>18 ^ w5>>>3  ^ w5<<25 ^ w5<<14 ) + ( w2>>>17 ^ w2>>>19 ^ w2>>>10 ^ w2<<15 ^ w2<<13 ) + w4 + w13 )|0;\n        d = ( w4 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0x2de92c6f )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 21\n        w5 = ( ( w6>>>7  ^ w6>>>18 ^ w6>>>3  ^ w6<<25 ^ w6<<14 ) + ( w3>>>17 ^ w3>>>19 ^ w3>>>10 ^ w3<<15 ^ w3<<13 ) + w5 + w14 )|0;\n        c = ( w5 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0x4a7484aa )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 22\n        w6 = ( ( w7>>>7  ^ w7>>>18 ^ w7>>>3  ^ w7<<25 ^ w7<<14 ) + ( w4>>>17 ^ w4>>>19 ^ w4>>>10 ^ w4<<15 ^ w4<<13 ) + w6 + w15 )|0;\n        b = ( w6 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0x5cb0a9dc )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 23\n        w7 = ( ( w8>>>7  ^ w8>>>18 ^ w8>>>3  ^ w8<<25 ^ w8<<14 ) + ( w5>>>17 ^ w5>>>19 ^ w5>>>10 ^ w5<<15 ^ w5<<13 ) + w7 + w0 )|0;\n        a = ( w7 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0x76f988da )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 24\n        w8 = ( ( w9>>>7  ^ w9>>>18 ^ w9>>>3  ^ w9<<25 ^ w9<<14 ) + ( w6>>>17 ^ w6>>>19 ^ w6>>>10 ^ w6<<15 ^ w6<<13 ) + w8 + w1 )|0;\n        h = ( w8 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0x983e5152 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 25\n        w9 = ( ( w10>>>7  ^ w10>>>18 ^ w10>>>3  ^ w10<<25 ^ w10<<14 ) + ( w7>>>17 ^ w7>>>19 ^ w7>>>10 ^ w7<<15 ^ w7<<13 ) + w9 + w2 )|0;\n        g = ( w9 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0xa831c66d )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 26\n        w10 = ( ( w11>>>7  ^ w11>>>18 ^ w11>>>3  ^ w11<<25 ^ w11<<14 ) + ( w8>>>17 ^ w8>>>19 ^ w8>>>10 ^ w8<<15 ^ w8<<13 ) + w10 + w3 )|0;\n        f = ( w10 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0xb00327c8 )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 27\n        w11 = ( ( w12>>>7  ^ w12>>>18 ^ w12>>>3  ^ w12<<25 ^ w12<<14 ) + ( w9>>>17 ^ w9>>>19 ^ w9>>>10 ^ w9<<15 ^ w9<<13 ) + w11 + w4 )|0;\n        e = ( w11 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0xbf597fc7 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 28\n        w12 = ( ( w13>>>7  ^ w13>>>18 ^ w13>>>3  ^ w13<<25 ^ w13<<14 ) + ( w10>>>17 ^ w10>>>19 ^ w10>>>10 ^ w10<<15 ^ w10<<13 ) + w12 + w5 )|0;\n        d = ( w12 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0xc6e00bf3 )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 29\n        w13 = ( ( w14>>>7  ^ w14>>>18 ^ w14>>>3  ^ w14<<25 ^ w14<<14 ) + ( w11>>>17 ^ w11>>>19 ^ w11>>>10 ^ w11<<15 ^ w11<<13 ) + w13 + w6 )|0;\n        c = ( w13 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0xd5a79147 )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 30\n        w14 = ( ( w15>>>7  ^ w15>>>18 ^ w15>>>3  ^ w15<<25 ^ w15<<14 ) + ( w12>>>17 ^ w12>>>19 ^ w12>>>10 ^ w12<<15 ^ w12<<13 ) + w14 + w7 )|0;\n        b = ( w14 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0x06ca6351 )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 31\n        w15 = ( ( w0>>>7  ^ w0>>>18 ^ w0>>>3  ^ w0<<25 ^ w0<<14 ) + ( w13>>>17 ^ w13>>>19 ^ w13>>>10 ^ w13<<15 ^ w13<<13 ) + w15 + w8 )|0;\n        a = ( w15 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0x14292967 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 32\n        w0 = ( ( w1>>>7  ^ w1>>>18 ^ w1>>>3  ^ w1<<25 ^ w1<<14 ) + ( w14>>>17 ^ w14>>>19 ^ w14>>>10 ^ w14<<15 ^ w14<<13 ) + w0 + w9 )|0;\n        h = ( w0 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0x27b70a85 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 33\n        w1 = ( ( w2>>>7  ^ w2>>>18 ^ w2>>>3  ^ w2<<25 ^ w2<<14 ) + ( w15>>>17 ^ w15>>>19 ^ w15>>>10 ^ w15<<15 ^ w15<<13 ) + w1 + w10 )|0;\n        g = ( w1 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0x2e1b2138 )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 34\n        w2 = ( ( w3>>>7  ^ w3>>>18 ^ w3>>>3  ^ w3<<25 ^ w3<<14 ) + ( w0>>>17 ^ w0>>>19 ^ w0>>>10 ^ w0<<15 ^ w0<<13 ) + w2 + w11 )|0;\n        f = ( w2 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0x4d2c6dfc )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 35\n        w3 = ( ( w4>>>7  ^ w4>>>18 ^ w4>>>3  ^ w4<<25 ^ w4<<14 ) + ( w1>>>17 ^ w1>>>19 ^ w1>>>10 ^ w1<<15 ^ w1<<13 ) + w3 + w12 )|0;\n        e = ( w3 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0x53380d13 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 36\n        w4 = ( ( w5>>>7  ^ w5>>>18 ^ w5>>>3  ^ w5<<25 ^ w5<<14 ) + ( w2>>>17 ^ w2>>>19 ^ w2>>>10 ^ w2<<15 ^ w2<<13 ) + w4 + w13 )|0;\n        d = ( w4 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0x650a7354 )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 37\n        w5 = ( ( w6>>>7  ^ w6>>>18 ^ w6>>>3  ^ w6<<25 ^ w6<<14 ) + ( w3>>>17 ^ w3>>>19 ^ w3>>>10 ^ w3<<15 ^ w3<<13 ) + w5 + w14 )|0;\n        c = ( w5 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0x766a0abb )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 38\n        w6 = ( ( w7>>>7  ^ w7>>>18 ^ w7>>>3  ^ w7<<25 ^ w7<<14 ) + ( w4>>>17 ^ w4>>>19 ^ w4>>>10 ^ w4<<15 ^ w4<<13 ) + w6 + w15 )|0;\n        b = ( w6 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0x81c2c92e )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 39\n        w7 = ( ( w8>>>7  ^ w8>>>18 ^ w8>>>3  ^ w8<<25 ^ w8<<14 ) + ( w5>>>17 ^ w5>>>19 ^ w5>>>10 ^ w5<<15 ^ w5<<13 ) + w7 + w0 )|0;\n        a = ( w7 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0x92722c85 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 40\n        w8 = ( ( w9>>>7  ^ w9>>>18 ^ w9>>>3  ^ w9<<25 ^ w9<<14 ) + ( w6>>>17 ^ w6>>>19 ^ w6>>>10 ^ w6<<15 ^ w6<<13 ) + w8 + w1 )|0;\n        h = ( w8 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0xa2bfe8a1 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 41\n        w9 = ( ( w10>>>7  ^ w10>>>18 ^ w10>>>3  ^ w10<<25 ^ w10<<14 ) + ( w7>>>17 ^ w7>>>19 ^ w7>>>10 ^ w7<<15 ^ w7<<13 ) + w9 + w2 )|0;\n        g = ( w9 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0xa81a664b )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 42\n        w10 = ( ( w11>>>7  ^ w11>>>18 ^ w11>>>3  ^ w11<<25 ^ w11<<14 ) + ( w8>>>17 ^ w8>>>19 ^ w8>>>10 ^ w8<<15 ^ w8<<13 ) + w10 + w3 )|0;\n        f = ( w10 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0xc24b8b70 )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 43\n        w11 = ( ( w12>>>7  ^ w12>>>18 ^ w12>>>3  ^ w12<<25 ^ w12<<14 ) + ( w9>>>17 ^ w9>>>19 ^ w9>>>10 ^ w9<<15 ^ w9<<13 ) + w11 + w4 )|0;\n        e = ( w11 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0xc76c51a3 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 44\n        w12 = ( ( w13>>>7  ^ w13>>>18 ^ w13>>>3  ^ w13<<25 ^ w13<<14 ) + ( w10>>>17 ^ w10>>>19 ^ w10>>>10 ^ w10<<15 ^ w10<<13 ) + w12 + w5 )|0;\n        d = ( w12 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0xd192e819 )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 45\n        w13 = ( ( w14>>>7  ^ w14>>>18 ^ w14>>>3  ^ w14<<25 ^ w14<<14 ) + ( w11>>>17 ^ w11>>>19 ^ w11>>>10 ^ w11<<15 ^ w11<<13 ) + w13 + w6 )|0;\n        c = ( w13 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0xd6990624 )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 46\n        w14 = ( ( w15>>>7  ^ w15>>>18 ^ w15>>>3  ^ w15<<25 ^ w15<<14 ) + ( w12>>>17 ^ w12>>>19 ^ w12>>>10 ^ w12<<15 ^ w12<<13 ) + w14 + w7 )|0;\n        b = ( w14 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0xf40e3585 )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 47\n        w15 = ( ( w0>>>7  ^ w0>>>18 ^ w0>>>3  ^ w0<<25 ^ w0<<14 ) + ( w13>>>17 ^ w13>>>19 ^ w13>>>10 ^ w13<<15 ^ w13<<13 ) + w15 + w8 )|0;\n        a = ( w15 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0x106aa070 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 48\n        w0 = ( ( w1>>>7  ^ w1>>>18 ^ w1>>>3  ^ w1<<25 ^ w1<<14 ) + ( w14>>>17 ^ w14>>>19 ^ w14>>>10 ^ w14<<15 ^ w14<<13 ) + w0 + w9 )|0;\n        h = ( w0 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0x19a4c116 )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 49\n        w1 = ( ( w2>>>7  ^ w2>>>18 ^ w2>>>3  ^ w2<<25 ^ w2<<14 ) + ( w15>>>17 ^ w15>>>19 ^ w15>>>10 ^ w15<<15 ^ w15<<13 ) + w1 + w10 )|0;\n        g = ( w1 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0x1e376c08 )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 50\n        w2 = ( ( w3>>>7  ^ w3>>>18 ^ w3>>>3  ^ w3<<25 ^ w3<<14 ) + ( w0>>>17 ^ w0>>>19 ^ w0>>>10 ^ w0<<15 ^ w0<<13 ) + w2 + w11 )|0;\n        f = ( w2 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0x2748774c )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 51\n        w3 = ( ( w4>>>7  ^ w4>>>18 ^ w4>>>3  ^ w4<<25 ^ w4<<14 ) + ( w1>>>17 ^ w1>>>19 ^ w1>>>10 ^ w1<<15 ^ w1<<13 ) + w3 + w12 )|0;\n        e = ( w3 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0x34b0bcb5 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 52\n        w4 = ( ( w5>>>7  ^ w5>>>18 ^ w5>>>3  ^ w5<<25 ^ w5<<14 ) + ( w2>>>17 ^ w2>>>19 ^ w2>>>10 ^ w2<<15 ^ w2<<13 ) + w4 + w13 )|0;\n        d = ( w4 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0x391c0cb3 )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 53\n        w5 = ( ( w6>>>7  ^ w6>>>18 ^ w6>>>3  ^ w6<<25 ^ w6<<14 ) + ( w3>>>17 ^ w3>>>19 ^ w3>>>10 ^ w3<<15 ^ w3<<13 ) + w5 + w14 )|0;\n        c = ( w5 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0x4ed8aa4a )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 54\n        w6 = ( ( w7>>>7  ^ w7>>>18 ^ w7>>>3  ^ w7<<25 ^ w7<<14 ) + ( w4>>>17 ^ w4>>>19 ^ w4>>>10 ^ w4<<15 ^ w4<<13 ) + w6 + w15 )|0;\n        b = ( w6 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0x5b9cca4f )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 55\n        w7 = ( ( w8>>>7  ^ w8>>>18 ^ w8>>>3  ^ w8<<25 ^ w8<<14 ) + ( w5>>>17 ^ w5>>>19 ^ w5>>>10 ^ w5<<15 ^ w5<<13 ) + w7 + w0 )|0;\n        a = ( w7 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0x682e6ff3 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        // 56\n        w8 = ( ( w9>>>7  ^ w9>>>18 ^ w9>>>3  ^ w9<<25 ^ w9<<14 ) + ( w6>>>17 ^ w6>>>19 ^ w6>>>10 ^ w6<<15 ^ w6<<13 ) + w8 + w1 )|0;\n        h = ( w8 + h + ( e>>>6 ^ e>>>11 ^ e>>>25 ^ e<<26 ^ e<<21 ^ e<<7 ) +  ( g ^ e & (f^g) ) + 0x748f82ee )|0;\n        d = ( d + h )|0;\n        h = ( h + ( (a & b) ^ ( c & (a ^ b) ) ) + ( a>>>2 ^ a>>>13 ^ a>>>22 ^ a<<30 ^ a<<19 ^ a<<10 ) )|0;\n\n        // 57\n        w9 = ( ( w10>>>7  ^ w10>>>18 ^ w10>>>3  ^ w10<<25 ^ w10<<14 ) + ( w7>>>17 ^ w7>>>19 ^ w7>>>10 ^ w7<<15 ^ w7<<13 ) + w9 + w2 )|0;\n        g = ( w9 + g + ( d>>>6 ^ d>>>11 ^ d>>>25 ^ d<<26 ^ d<<21 ^ d<<7 ) +  ( f ^ d & (e^f) ) + 0x78a5636f )|0;\n        c = ( c + g )|0;\n        g = ( g + ( (h & a) ^ ( b & (h ^ a) ) ) + ( h>>>2 ^ h>>>13 ^ h>>>22 ^ h<<30 ^ h<<19 ^ h<<10 ) )|0;\n\n        // 58\n        w10 = ( ( w11>>>7  ^ w11>>>18 ^ w11>>>3  ^ w11<<25 ^ w11<<14 ) + ( w8>>>17 ^ w8>>>19 ^ w8>>>10 ^ w8<<15 ^ w8<<13 ) + w10 + w3 )|0;\n        f = ( w10 + f + ( c>>>6 ^ c>>>11 ^ c>>>25 ^ c<<26 ^ c<<21 ^ c<<7 ) +  ( e ^ c & (d^e) ) + 0x84c87814 )|0;\n        b = ( b + f )|0;\n        f = ( f + ( (g & h) ^ ( a & (g ^ h) ) ) + ( g>>>2 ^ g>>>13 ^ g>>>22 ^ g<<30 ^ g<<19 ^ g<<10 ) )|0;\n\n        // 59\n        w11 = ( ( w12>>>7  ^ w12>>>18 ^ w12>>>3  ^ w12<<25 ^ w12<<14 ) + ( w9>>>17 ^ w9>>>19 ^ w9>>>10 ^ w9<<15 ^ w9<<13 ) + w11 + w4 )|0;\n        e = ( w11 + e + ( b>>>6 ^ b>>>11 ^ b>>>25 ^ b<<26 ^ b<<21 ^ b<<7 ) +  ( d ^ b & (c^d) ) + 0x8cc70208 )|0;\n        a = ( a + e )|0;\n        e = ( e + ( (f & g) ^ ( h & (f ^ g) ) ) + ( f>>>2 ^ f>>>13 ^ f>>>22 ^ f<<30 ^ f<<19 ^ f<<10 ) )|0;\n\n        // 60\n        w12 = ( ( w13>>>7  ^ w13>>>18 ^ w13>>>3  ^ w13<<25 ^ w13<<14 ) + ( w10>>>17 ^ w10>>>19 ^ w10>>>10 ^ w10<<15 ^ w10<<13 ) + w12 + w5 )|0;\n        d = ( w12 + d + ( a>>>6 ^ a>>>11 ^ a>>>25 ^ a<<26 ^ a<<21 ^ a<<7 ) +  ( c ^ a & (b^c) ) + 0x90befffa )|0;\n        h = ( h + d )|0;\n        d = ( d + ( (e & f) ^ ( g & (e ^ f) ) ) + ( e>>>2 ^ e>>>13 ^ e>>>22 ^ e<<30 ^ e<<19 ^ e<<10 ) )|0;\n\n        // 61\n        w13 = ( ( w14>>>7  ^ w14>>>18 ^ w14>>>3  ^ w14<<25 ^ w14<<14 ) + ( w11>>>17 ^ w11>>>19 ^ w11>>>10 ^ w11<<15 ^ w11<<13 ) + w13 + w6 )|0;\n        c = ( w13 + c + ( h>>>6 ^ h>>>11 ^ h>>>25 ^ h<<26 ^ h<<21 ^ h<<7 ) +  ( b ^ h & (a^b) ) + 0xa4506ceb )|0;\n        g = ( g + c )|0;\n        c = ( c + ( (d & e) ^ ( f & (d ^ e) ) ) + ( d>>>2 ^ d>>>13 ^ d>>>22 ^ d<<30 ^ d<<19 ^ d<<10 ) )|0;\n\n        // 62\n        w14 = ( ( w15>>>7  ^ w15>>>18 ^ w15>>>3  ^ w15<<25 ^ w15<<14 ) + ( w12>>>17 ^ w12>>>19 ^ w12>>>10 ^ w12<<15 ^ w12<<13 ) + w14 + w7 )|0;\n        b = ( w14 + b + ( g>>>6 ^ g>>>11 ^ g>>>25 ^ g<<26 ^ g<<21 ^ g<<7 ) +  ( a ^ g & (h^a) ) + 0xbef9a3f7 )|0;\n        f = ( f + b )|0;\n        b = ( b + ( (c & d) ^ ( e & (c ^ d) ) ) + ( c>>>2 ^ c>>>13 ^ c>>>22 ^ c<<30 ^ c<<19 ^ c<<10 ) )|0;\n\n        // 63\n        w15 = ( ( w0>>>7  ^ w0>>>18 ^ w0>>>3  ^ w0<<25 ^ w0<<14 ) + ( w13>>>17 ^ w13>>>19 ^ w13>>>10 ^ w13<<15 ^ w13<<13 ) + w15 + w8 )|0;\n        a = ( w15 + a + ( f>>>6 ^ f>>>11 ^ f>>>25 ^ f<<26 ^ f<<21 ^ f<<7 ) +  ( h ^ f & (g^h) ) + 0xc67178f2 )|0;\n        e = ( e + a )|0;\n        a = ( a + ( (b & c) ^ ( d & (b ^ c) ) ) + ( b>>>2 ^ b>>>13 ^ b>>>22 ^ b<<30 ^ b<<19 ^ b<<10 ) )|0;\n\n        H0 = ( H0 + a )|0;\n        H1 = ( H1 + b )|0;\n        H2 = ( H2 + c )|0;\n        H3 = ( H3 + d )|0;\n        H4 = ( H4 + e )|0;\n        H5 = ( H5 + f )|0;\n        H6 = ( H6 + g )|0;\n        H7 = ( H7 + h )|0;\n    }\n\n    function _core_heap ( offset ) {\n        offset = offset|0;\n\n        _core(\n            HEAP[offset|0]<<24 | HEAP[offset|1]<<16 | HEAP[offset|2]<<8 | HEAP[offset|3],\n            HEAP[offset|4]<<24 | HEAP[offset|5]<<16 | HEAP[offset|6]<<8 | HEAP[offset|7],\n            HEAP[offset|8]<<24 | HEAP[offset|9]<<16 | HEAP[offset|10]<<8 | HEAP[offset|11],\n            HEAP[offset|12]<<24 | HEAP[offset|13]<<16 | HEAP[offset|14]<<8 | HEAP[offset|15],\n            HEAP[offset|16]<<24 | HEAP[offset|17]<<16 | HEAP[offset|18]<<8 | HEAP[offset|19],\n            HEAP[offset|20]<<24 | HEAP[offset|21]<<16 | HEAP[offset|22]<<8 | HEAP[offset|23],\n            HEAP[offset|24]<<24 | HEAP[offset|25]<<16 | HEAP[offset|26]<<8 | HEAP[offset|27],\n            HEAP[offset|28]<<24 | HEAP[offset|29]<<16 | HEAP[offset|30]<<8 | HEAP[offset|31],\n            HEAP[offset|32]<<24 | HEAP[offset|33]<<16 | HEAP[offset|34]<<8 | HEAP[offset|35],\n            HEAP[offset|36]<<24 | HEAP[offset|37]<<16 | HEAP[offset|38]<<8 | HEAP[offset|39],\n            HEAP[offset|40]<<24 | HEAP[offset|41]<<16 | HEAP[offset|42]<<8 | HEAP[offset|43],\n            HEAP[offset|44]<<24 | HEAP[offset|45]<<16 | HEAP[offset|46]<<8 | HEAP[offset|47],\n            HEAP[offset|48]<<24 | HEAP[offset|49]<<16 | HEAP[offset|50]<<8 | HEAP[offset|51],\n            HEAP[offset|52]<<24 | HEAP[offset|53]<<16 | HEAP[offset|54]<<8 | HEAP[offset|55],\n            HEAP[offset|56]<<24 | HEAP[offset|57]<<16 | HEAP[offset|58]<<8 | HEAP[offset|59],\n            HEAP[offset|60]<<24 | HEAP[offset|61]<<16 | HEAP[offset|62]<<8 | HEAP[offset|63]\n        );\n    }\n\n    // offset — multiple of 32\n    function _state_to_heap ( output ) {\n        output = output|0;\n\n        HEAP[output|0] = H0>>>24;\n        HEAP[output|1] = H0>>>16&255;\n        HEAP[output|2] = H0>>>8&255;\n        HEAP[output|3] = H0&255;\n        HEAP[output|4] = H1>>>24;\n        HEAP[output|5] = H1>>>16&255;\n        HEAP[output|6] = H1>>>8&255;\n        HEAP[output|7] = H1&255;\n        HEAP[output|8] = H2>>>24;\n        HEAP[output|9] = H2>>>16&255;\n        HEAP[output|10] = H2>>>8&255;\n        HEAP[output|11] = H2&255;\n        HEAP[output|12] = H3>>>24;\n        HEAP[output|13] = H3>>>16&255;\n        HEAP[output|14] = H3>>>8&255;\n        HEAP[output|15] = H3&255;\n        HEAP[output|16] = H4>>>24;\n        HEAP[output|17] = H4>>>16&255;\n        HEAP[output|18] = H4>>>8&255;\n        HEAP[output|19] = H4&255;\n        HEAP[output|20] = H5>>>24;\n        HEAP[output|21] = H5>>>16&255;\n        HEAP[output|22] = H5>>>8&255;\n        HEAP[output|23] = H5&255;\n        HEAP[output|24] = H6>>>24;\n        HEAP[output|25] = H6>>>16&255;\n        HEAP[output|26] = H6>>>8&255;\n        HEAP[output|27] = H6&255;\n        HEAP[output|28] = H7>>>24;\n        HEAP[output|29] = H7>>>16&255;\n        HEAP[output|30] = H7>>>8&255;\n        HEAP[output|31] = H7&255;\n    }\n\n    function reset () {\n        H0 = 0x6a09e667;\n        H1 = 0xbb67ae85;\n        H2 = 0x3c6ef372;\n        H3 = 0xa54ff53a;\n        H4 = 0x510e527f;\n        H5 = 0x9b05688c;\n        H6 = 0x1f83d9ab;\n        H7 = 0x5be0cd19;\n        TOTAL0 = TOTAL1 = 0;\n    }\n\n    function init ( h0, h1, h2, h3, h4, h5, h6, h7, total0, total1 ) {\n        h0 = h0|0;\n        h1 = h1|0;\n        h2 = h2|0;\n        h3 = h3|0;\n        h4 = h4|0;\n        h5 = h5|0;\n        h6 = h6|0;\n        h7 = h7|0;\n        total0 = total0|0;\n        total1 = total1|0;\n\n        H0 = h0;\n        H1 = h1;\n        H2 = h2;\n        H3 = h3;\n        H4 = h4;\n        H5 = h5;\n        H6 = h6;\n        H7 = h7;\n        TOTAL0 = total0;\n        TOTAL1 = total1;\n    }\n\n    // offset — multiple of 64\n    function process ( offset, length ) {\n        offset = offset|0;\n        length = length|0;\n\n        var hashed = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        while ( (length|0) >= 64 ) {\n            _core_heap(offset);\n\n            offset = ( offset + 64 )|0;\n            length = ( length - 64 )|0;\n\n            hashed = ( hashed + 64 )|0;\n        }\n\n        TOTAL0 = ( TOTAL0 + hashed )|0;\n        if ( TOTAL0>>>0 < hashed>>>0 ) TOTAL1 = ( TOTAL1 + 1 )|0;\n\n        return hashed|0;\n    }\n\n    // offset — multiple of 64\n    // output — multiple of 32\n    function finish ( offset, length, output ) {\n        offset = offset|0;\n        length = length|0;\n        output = output|0;\n\n        var hashed = 0,\n            i = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 31 )\n                return -1;\n\n        if ( (length|0) >= 64 ) {\n            hashed = process( offset, length )|0;\n            if ( (hashed|0) == -1 )\n                return -1;\n\n            offset = ( offset + hashed )|0;\n            length = ( length - hashed )|0;\n        }\n\n        hashed = ( hashed + length )|0;\n        TOTAL0 = ( TOTAL0 + length )|0;\n        if ( TOTAL0>>>0 < length>>>0 ) TOTAL1 = ( TOTAL1 + 1 )|0;\n\n        HEAP[offset|length] = 0x80;\n\n        if ( (length|0) >= 56 ) {\n            for ( i = (length+1)|0; (i|0) < 64; i = (i+1)|0 )\n                HEAP[offset|i] = 0x00;\n\n            _core_heap(offset);\n\n            length = 0;\n\n            HEAP[offset|0] = 0;\n        }\n\n        for ( i = (length+1)|0; (i|0) < 59; i = (i+1)|0 )\n            HEAP[offset|i] = 0;\n\n        HEAP[offset|56] = TOTAL1>>>21&255;\n        HEAP[offset|57] = TOTAL1>>>13&255;\n        HEAP[offset|58] = TOTAL1>>>5&255;\n        HEAP[offset|59] = TOTAL1<<3&255 | TOTAL0>>>29;\n        HEAP[offset|60] = TOTAL0>>>21&255;\n        HEAP[offset|61] = TOTAL0>>>13&255;\n        HEAP[offset|62] = TOTAL0>>>5&255;\n        HEAP[offset|63] = TOTAL0<<3&255;\n        _core_heap(offset);\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return hashed|0;\n    }\n\n    function hmac_reset () {\n        H0 = I0;\n        H1 = I1;\n        H2 = I2;\n        H3 = I3;\n        H4 = I4;\n        H5 = I5;\n        H6 = I6;\n        H7 = I7;\n        TOTAL0 = 64;\n        TOTAL1 = 0;\n    }\n\n    function _hmac_opad () {\n        H0 = O0;\n        H1 = O1;\n        H2 = O2;\n        H3 = O3;\n        H4 = O4;\n        H5 = O5;\n        H6 = O6;\n        H7 = O7;\n        TOTAL0 = 64;\n        TOTAL1 = 0;\n    }\n\n    function hmac_init ( p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15 ) {\n        p0 = p0|0;\n        p1 = p1|0;\n        p2 = p2|0;\n        p3 = p3|0;\n        p4 = p4|0;\n        p5 = p5|0;\n        p6 = p6|0;\n        p7 = p7|0;\n        p8 = p8|0;\n        p9 = p9|0;\n        p10 = p10|0;\n        p11 = p11|0;\n        p12 = p12|0;\n        p13 = p13|0;\n        p14 = p14|0;\n        p15 = p15|0;\n\n        // opad\n        reset();\n        _core(\n            p0 ^ 0x5c5c5c5c,\n            p1 ^ 0x5c5c5c5c,\n            p2 ^ 0x5c5c5c5c,\n            p3 ^ 0x5c5c5c5c,\n            p4 ^ 0x5c5c5c5c,\n            p5 ^ 0x5c5c5c5c,\n            p6 ^ 0x5c5c5c5c,\n            p7 ^ 0x5c5c5c5c,\n            p8 ^ 0x5c5c5c5c,\n            p9 ^ 0x5c5c5c5c,\n            p10 ^ 0x5c5c5c5c,\n            p11 ^ 0x5c5c5c5c,\n            p12 ^ 0x5c5c5c5c,\n            p13 ^ 0x5c5c5c5c,\n            p14 ^ 0x5c5c5c5c,\n            p15 ^ 0x5c5c5c5c\n        );\n        O0 = H0;\n        O1 = H1;\n        O2 = H2;\n        O3 = H3;\n        O4 = H4;\n        O5 = H5;\n        O6 = H6;\n        O7 = H7;\n\n        // ipad\n        reset();\n        _core(\n            p0 ^ 0x36363636,\n            p1 ^ 0x36363636,\n            p2 ^ 0x36363636,\n            p3 ^ 0x36363636,\n            p4 ^ 0x36363636,\n            p5 ^ 0x36363636,\n            p6 ^ 0x36363636,\n            p7 ^ 0x36363636,\n            p8 ^ 0x36363636,\n            p9 ^ 0x36363636,\n            p10 ^ 0x36363636,\n            p11 ^ 0x36363636,\n            p12 ^ 0x36363636,\n            p13 ^ 0x36363636,\n            p14 ^ 0x36363636,\n            p15 ^ 0x36363636\n        );\n        I0 = H0;\n        I1 = H1;\n        I2 = H2;\n        I3 = H3;\n        I4 = H4;\n        I5 = H5;\n        I6 = H6;\n        I7 = H7;\n\n        TOTAL0 = 64;\n        TOTAL1 = 0;\n    }\n\n    // offset — multiple of 64\n    // output — multiple of 32\n    function hmac_finish ( offset, length, output ) {\n        offset = offset|0;\n        length = length|0;\n        output = output|0;\n\n        var t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0,\n            hashed = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 31 )\n                return -1;\n\n        hashed = finish( offset, length, -1 )|0;\n        t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4, t5 = H5, t6 = H6, t7 = H7;\n\n        _hmac_opad();\n        _core( t0, t1, t2, t3, t4, t5, t6, t7, 0x80000000, 0, 0, 0, 0, 0, 0, 768 );\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return hashed|0;\n    }\n\n    // salt is assumed to be already processed\n    // offset — multiple of 64\n    // output — multiple of 32\n    function pbkdf2_generate_block ( offset, length, block, count, output ) {\n        offset = offset|0;\n        length = length|0;\n        block = block|0;\n        count = count|0;\n        output = output|0;\n\n        var h0 = 0, h1 = 0, h2 = 0, h3 = 0, h4 = 0, h5 = 0, h6 = 0, h7 = 0,\n            t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0;\n\n        if ( offset & 63 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 31 )\n                return -1;\n\n        // pad block number into heap\n        // FIXME probable OOB write\n        HEAP[(offset+length)|0]   = block>>>24;\n        HEAP[(offset+length+1)|0] = block>>>16&255;\n        HEAP[(offset+length+2)|0] = block>>>8&255;\n        HEAP[(offset+length+3)|0] = block&255;\n\n        // finish first iteration\n        hmac_finish( offset, (length+4)|0, -1 )|0;\n        h0 = t0 = H0, h1 = t1 = H1, h2 = t2 = H2, h3 = t3 = H3, h4 = t4 = H4, h5 = t5 = H5, h6 = t6 = H6, h7 = t7 = H7;\n        count = (count-1)|0;\n\n        // perform the rest iterations\n        while ( (count|0) > 0 ) {\n            hmac_reset();\n            _core( t0, t1, t2, t3, t4, t5, t6, t7, 0x80000000, 0, 0, 0, 0, 0, 0, 768 );\n            t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4, t5 = H5, t6 = H6, t7 = H7;\n\n            _hmac_opad();\n            _core( t0, t1, t2, t3, t4, t5, t6, t7, 0x80000000, 0, 0, 0, 0, 0, 0, 768 );\n            t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4, t5 = H5, t6 = H6, t7 = H7;\n\n            h0 = h0 ^ H0;\n            h1 = h1 ^ H1;\n            h2 = h2 ^ H2;\n            h3 = h3 ^ H3;\n            h4 = h4 ^ H4;\n            h5 = h5 ^ H5;\n            h6 = h6 ^ H6;\n            h7 = h7 ^ H7;\n\n            count = (count-1)|0;\n        }\n\n        H0 = h0;\n        H1 = h1;\n        H2 = h2;\n        H3 = h3;\n        H4 = h4;\n        H5 = h5;\n        H6 = h6;\n        H7 = h7;\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return 0;\n    }\n\n    return {\n      // SHA256\n      reset: reset,\n      init: init,\n      process: process,\n      finish: finish,\n\n      // HMAC-SHA256\n      hmac_reset: hmac_reset,\n      hmac_init: hmac_init,\n      hmac_finish: hmac_finish,\n\n      // PBKDF2-HMAC-SHA256\n      pbkdf2_generate_block: pbkdf2_generate_block\n    }\n};\n\nconst _sha256_block_size = 64;\nconst _sha256_hash_size = 32;\nclass Sha256 extends Hash {\n    constructor() {\n        super();\n        this.NAME = 'sha256';\n        this.BLOCK_SIZE = _sha256_block_size;\n        this.HASH_SIZE = _sha256_hash_size;\n        this.heap = _heap_init();\n        this.asm = sha256_asm({ Uint8Array: Uint8Array }, null, this.heap.buffer);\n        this.reset();\n    }\n}\nSha256.NAME = 'sha256';\n\nvar sha512_asm = function ( stdlib, foreign, buffer ) {\n    \"use asm\";\n\n    // SHA512 state\n    var H0h = 0, H0l = 0, H1h = 0, H1l = 0, H2h = 0, H2l = 0, H3h = 0, H3l = 0,\n        H4h = 0, H4l = 0, H5h = 0, H5l = 0, H6h = 0, H6l = 0, H7h = 0, H7l = 0,\n        TOTAL0 = 0, TOTAL1 = 0;\n\n    // HMAC state\n    var I0h = 0, I0l = 0, I1h = 0, I1l = 0, I2h = 0, I2l = 0, I3h = 0, I3l = 0,\n        I4h = 0, I4l = 0, I5h = 0, I5l = 0, I6h = 0, I6l = 0, I7h = 0, I7l = 0,\n        O0h = 0, O0l = 0, O1h = 0, O1l = 0, O2h = 0, O2l = 0, O3h = 0, O3l = 0,\n        O4h = 0, O4l = 0, O5h = 0, O5l = 0, O6h = 0, O6l = 0, O7h = 0, O7l = 0;\n\n    // I/O buffer\n    var HEAP = new stdlib.Uint8Array(buffer);\n\n    function _core ( w0h, w0l, w1h, w1l, w2h, w2l, w3h, w3l, w4h, w4l, w5h, w5l, w6h, w6l, w7h, w7l, w8h, w8l, w9h, w9l, w10h, w10l, w11h, w11l, w12h, w12l, w13h, w13l, w14h, w14l, w15h, w15l ) {\n        w0h = w0h|0;\n        w0l = w0l|0;\n        w1h = w1h|0;\n        w1l = w1l|0;\n        w2h = w2h|0;\n        w2l = w2l|0;\n        w3h = w3h|0;\n        w3l = w3l|0;\n        w4h = w4h|0;\n        w4l = w4l|0;\n        w5h = w5h|0;\n        w5l = w5l|0;\n        w6h = w6h|0;\n        w6l = w6l|0;\n        w7h = w7h|0;\n        w7l = w7l|0;\n        w8h = w8h|0;\n        w8l = w8l|0;\n        w9h = w9h|0;\n        w9l = w9l|0;\n        w10h = w10h|0;\n        w10l = w10l|0;\n        w11h = w11h|0;\n        w11l = w11l|0;\n        w12h = w12h|0;\n        w12l = w12l|0;\n        w13h = w13h|0;\n        w13l = w13l|0;\n        w14h = w14h|0;\n        w14l = w14l|0;\n        w15h = w15h|0;\n        w15l = w15l|0;\n\n        var ah = 0, al = 0, bh = 0, bl = 0, ch = 0, cl = 0, dh = 0, dl = 0, eh = 0, el = 0, fh = 0, fl = 0, gh = 0, gl = 0, hh = 0, hl = 0,\n            th = 0, tl = 0, xl = 0;\n\n        ah = H0h;\n        al = H0l;\n        bh = H1h;\n        bl = H1l;\n        ch = H2h;\n        cl = H2l;\n        dh = H3h;\n        dl = H3l;\n        eh = H4h;\n        el = H4l;\n        fh = H5h;\n        fl = H5l;\n        gh = H6h;\n        gl = H6l;\n        hh = H7h;\n        hl = H7l;\n\n        // 0\n        tl = ( 0xd728ae22 + w0l )|0;\n        th = ( 0x428a2f98 + w0h + ((tl >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 1\n        tl = ( 0x23ef65cd + w1l )|0;\n        th = ( 0x71374491 + w1h + ((tl >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 2\n        tl = ( 0xec4d3b2f + w2l )|0;\n        th = ( 0xb5c0fbcf + w2h + ((tl >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 3\n        tl = ( 0x8189dbbc + w3l )|0;\n        th = ( 0xe9b5dba5 + w3h + ((tl >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 4\n        tl = ( 0xf348b538 + w4l )|0;\n        th = ( 0x3956c25b + w4h + ((tl >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 5\n        tl = ( 0xb605d019 + w5l )|0;\n        th = ( 0x59f111f1 + w5h + ((tl >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 6\n        tl = ( 0xaf194f9b + w6l )|0;\n        th = ( 0x923f82a4 + w6h + ((tl >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 7\n        tl = ( 0xda6d8118 + w7l )|0;\n        th = ( 0xab1c5ed5 + w7h + ((tl >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 8\n        tl = ( 0xa3030242 + w8l )|0;\n        th = ( 0xd807aa98 + w8h + ((tl >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 9\n        tl = ( 0x45706fbe + w9l )|0;\n        th = ( 0x12835b01 + w9h + ((tl >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 10\n        tl = ( 0x4ee4b28c + w10l )|0;\n        th = ( 0x243185be + w10h + ((tl >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 11\n        tl = ( 0xd5ffb4e2 + w11l )|0;\n        th = ( 0x550c7dc3 + w11h + ((tl >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 12\n        tl = ( 0xf27b896f + w12l )|0;\n        th = ( 0x72be5d74 + w12h + ((tl >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 13\n        tl = ( 0x3b1696b1 + w13l )|0;\n        th = ( 0x80deb1fe + w13h + ((tl >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 14\n        tl = ( 0x25c71235 + w14l )|0;\n        th = ( 0x9bdc06a7 + w14h + ((tl >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 15\n        tl = ( 0xcf692694 + w15l )|0;\n        th = ( 0xc19bf174 + w15h + ((tl >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 16\n        w0l = ( w0l + w9l )|0;\n        w0h = ( w0h + w9h + ((w0l >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 1) | (w1h << 31)) ^ ((w1l >>> 8) | (w1h << 24)) ^ ((w1l >>> 7) | (w1h << 25)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w1h >>> 1) | (w1l << 31)) ^ ((w1h >>> 8) | (w1l << 24)) ^ (w1h >>> 7) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 19) | (w14h << 13)) ^ ((w14l << 3) | (w14h >>> 29)) ^ ((w14l >>> 6) | (w14h << 26)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w14h >>> 19) | (w14l << 13)) ^ ((w14h << 3) | (w14l >>> 29)) ^ (w14h >>> 6) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x9ef14ad2 + w0l )|0;\n        th = ( 0xe49b69c1 + w0h + ((tl >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 17\n        w1l = ( w1l + w10l )|0;\n        w1h = ( w1h + w10h + ((w1l >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 1) | (w2h << 31)) ^ ((w2l >>> 8) | (w2h << 24)) ^ ((w2l >>> 7) | (w2h << 25)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w2h >>> 1) | (w2l << 31)) ^ ((w2h >>> 8) | (w2l << 24)) ^ (w2h >>> 7) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 19) | (w15h << 13)) ^ ((w15l << 3) | (w15h >>> 29)) ^ ((w15l >>> 6) | (w15h << 26)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w15h >>> 19) | (w15l << 13)) ^ ((w15h << 3) | (w15l >>> 29)) ^ (w15h >>> 6) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x384f25e3 + w1l )|0;\n        th = ( 0xefbe4786 + w1h + ((tl >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 18\n        w2l = ( w2l + w11l )|0;\n        w2h = ( w2h + w11h + ((w2l >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 1) | (w3h << 31)) ^ ((w3l >>> 8) | (w3h << 24)) ^ ((w3l >>> 7) | (w3h << 25)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w3h >>> 1) | (w3l << 31)) ^ ((w3h >>> 8) | (w3l << 24)) ^ (w3h >>> 7) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 19) | (w0h << 13)) ^ ((w0l << 3) | (w0h >>> 29)) ^ ((w0l >>> 6) | (w0h << 26)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w0h >>> 19) | (w0l << 13)) ^ ((w0h << 3) | (w0l >>> 29)) ^ (w0h >>> 6) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x8b8cd5b5 + w2l )|0;\n        th = ( 0xfc19dc6 + w2h + ((tl >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 19\n        w3l = ( w3l + w12l )|0;\n        w3h = ( w3h + w12h + ((w3l >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 1) | (w4h << 31)) ^ ((w4l >>> 8) | (w4h << 24)) ^ ((w4l >>> 7) | (w4h << 25)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w4h >>> 1) | (w4l << 31)) ^ ((w4h >>> 8) | (w4l << 24)) ^ (w4h >>> 7) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 19) | (w1h << 13)) ^ ((w1l << 3) | (w1h >>> 29)) ^ ((w1l >>> 6) | (w1h << 26)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w1h >>> 19) | (w1l << 13)) ^ ((w1h << 3) | (w1l >>> 29)) ^ (w1h >>> 6) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x77ac9c65 + w3l )|0;\n        th = ( 0x240ca1cc + w3h + ((tl >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 20\n        w4l = ( w4l + w13l )|0;\n        w4h = ( w4h + w13h + ((w4l >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 1) | (w5h << 31)) ^ ((w5l >>> 8) | (w5h << 24)) ^ ((w5l >>> 7) | (w5h << 25)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w5h >>> 1) | (w5l << 31)) ^ ((w5h >>> 8) | (w5l << 24)) ^ (w5h >>> 7) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 19) | (w2h << 13)) ^ ((w2l << 3) | (w2h >>> 29)) ^ ((w2l >>> 6) | (w2h << 26)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w2h >>> 19) | (w2l << 13)) ^ ((w2h << 3) | (w2l >>> 29)) ^ (w2h >>> 6) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x592b0275 + w4l )|0;\n        th = ( 0x2de92c6f + w4h + ((tl >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 21\n        w5l = ( w5l + w14l )|0;\n        w5h = ( w5h + w14h + ((w5l >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 1) | (w6h << 31)) ^ ((w6l >>> 8) | (w6h << 24)) ^ ((w6l >>> 7) | (w6h << 25)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w6h >>> 1) | (w6l << 31)) ^ ((w6h >>> 8) | (w6l << 24)) ^ (w6h >>> 7) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 19) | (w3h << 13)) ^ ((w3l << 3) | (w3h >>> 29)) ^ ((w3l >>> 6) | (w3h << 26)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w3h >>> 19) | (w3l << 13)) ^ ((w3h << 3) | (w3l >>> 29)) ^ (w3h >>> 6) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x6ea6e483 + w5l )|0;\n        th = ( 0x4a7484aa + w5h + ((tl >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 22\n        w6l = ( w6l + w15l )|0;\n        w6h = ( w6h + w15h + ((w6l >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 1) | (w7h << 31)) ^ ((w7l >>> 8) | (w7h << 24)) ^ ((w7l >>> 7) | (w7h << 25)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w7h >>> 1) | (w7l << 31)) ^ ((w7h >>> 8) | (w7l << 24)) ^ (w7h >>> 7) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 19) | (w4h << 13)) ^ ((w4l << 3) | (w4h >>> 29)) ^ ((w4l >>> 6) | (w4h << 26)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w4h >>> 19) | (w4l << 13)) ^ ((w4h << 3) | (w4l >>> 29)) ^ (w4h >>> 6) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xbd41fbd4 + w6l )|0;\n        th = ( 0x5cb0a9dc + w6h + ((tl >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 23\n        w7l = ( w7l + w0l )|0;\n        w7h = ( w7h + w0h + ((w7l >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 1) | (w8h << 31)) ^ ((w8l >>> 8) | (w8h << 24)) ^ ((w8l >>> 7) | (w8h << 25)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w8h >>> 1) | (w8l << 31)) ^ ((w8h >>> 8) | (w8l << 24)) ^ (w8h >>> 7) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 19) | (w5h << 13)) ^ ((w5l << 3) | (w5h >>> 29)) ^ ((w5l >>> 6) | (w5h << 26)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w5h >>> 19) | (w5l << 13)) ^ ((w5h << 3) | (w5l >>> 29)) ^ (w5h >>> 6) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x831153b5 + w7l )|0;\n        th = ( 0x76f988da + w7h + ((tl >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 24\n        w8l = ( w8l + w1l )|0;\n        w8h = ( w8h + w1h + ((w8l >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 1) | (w9h << 31)) ^ ((w9l >>> 8) | (w9h << 24)) ^ ((w9l >>> 7) | (w9h << 25)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w9h >>> 1) | (w9l << 31)) ^ ((w9h >>> 8) | (w9l << 24)) ^ (w9h >>> 7) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 19) | (w6h << 13)) ^ ((w6l << 3) | (w6h >>> 29)) ^ ((w6l >>> 6) | (w6h << 26)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w6h >>> 19) | (w6l << 13)) ^ ((w6h << 3) | (w6l >>> 29)) ^ (w6h >>> 6) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xee66dfab + w8l )|0;\n        th = ( 0x983e5152 + w8h + ((tl >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 25\n        w9l = ( w9l + w2l )|0;\n        w9h = ( w9h + w2h + ((w9l >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 1) | (w10h << 31)) ^ ((w10l >>> 8) | (w10h << 24)) ^ ((w10l >>> 7) | (w10h << 25)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w10h >>> 1) | (w10l << 31)) ^ ((w10h >>> 8) | (w10l << 24)) ^ (w10h >>> 7) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 19) | (w7h << 13)) ^ ((w7l << 3) | (w7h >>> 29)) ^ ((w7l >>> 6) | (w7h << 26)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w7h >>> 19) | (w7l << 13)) ^ ((w7h << 3) | (w7l >>> 29)) ^ (w7h >>> 6) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x2db43210 + w9l )|0;\n        th = ( 0xa831c66d + w9h + ((tl >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 26\n        w10l = ( w10l + w3l )|0;\n        w10h = ( w10h + w3h + ((w10l >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 1) | (w11h << 31)) ^ ((w11l >>> 8) | (w11h << 24)) ^ ((w11l >>> 7) | (w11h << 25)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w11h >>> 1) | (w11l << 31)) ^ ((w11h >>> 8) | (w11l << 24)) ^ (w11h >>> 7) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 19) | (w8h << 13)) ^ ((w8l << 3) | (w8h >>> 29)) ^ ((w8l >>> 6) | (w8h << 26)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w8h >>> 19) | (w8l << 13)) ^ ((w8h << 3) | (w8l >>> 29)) ^ (w8h >>> 6) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x98fb213f + w10l )|0;\n        th = ( 0xb00327c8 + w10h + ((tl >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 27\n        w11l = ( w11l + w4l )|0;\n        w11h = ( w11h + w4h + ((w11l >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 1) | (w12h << 31)) ^ ((w12l >>> 8) | (w12h << 24)) ^ ((w12l >>> 7) | (w12h << 25)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w12h >>> 1) | (w12l << 31)) ^ ((w12h >>> 8) | (w12l << 24)) ^ (w12h >>> 7) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 19) | (w9h << 13)) ^ ((w9l << 3) | (w9h >>> 29)) ^ ((w9l >>> 6) | (w9h << 26)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w9h >>> 19) | (w9l << 13)) ^ ((w9h << 3) | (w9l >>> 29)) ^ (w9h >>> 6) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xbeef0ee4 + w11l )|0;\n        th = ( 0xbf597fc7 + w11h + ((tl >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 28\n        w12l = ( w12l + w5l )|0;\n        w12h = ( w12h + w5h + ((w12l >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 1) | (w13h << 31)) ^ ((w13l >>> 8) | (w13h << 24)) ^ ((w13l >>> 7) | (w13h << 25)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w13h >>> 1) | (w13l << 31)) ^ ((w13h >>> 8) | (w13l << 24)) ^ (w13h >>> 7) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 19) | (w10h << 13)) ^ ((w10l << 3) | (w10h >>> 29)) ^ ((w10l >>> 6) | (w10h << 26)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w10h >>> 19) | (w10l << 13)) ^ ((w10h << 3) | (w10l >>> 29)) ^ (w10h >>> 6) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x3da88fc2 + w12l )|0;\n        th = ( 0xc6e00bf3 + w12h + ((tl >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 29\n        w13l = ( w13l + w6l )|0;\n        w13h = ( w13h + w6h + ((w13l >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 1) | (w14h << 31)) ^ ((w14l >>> 8) | (w14h << 24)) ^ ((w14l >>> 7) | (w14h << 25)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w14h >>> 1) | (w14l << 31)) ^ ((w14h >>> 8) | (w14l << 24)) ^ (w14h >>> 7) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 19) | (w11h << 13)) ^ ((w11l << 3) | (w11h >>> 29)) ^ ((w11l >>> 6) | (w11h << 26)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w11h >>> 19) | (w11l << 13)) ^ ((w11h << 3) | (w11l >>> 29)) ^ (w11h >>> 6) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x930aa725 + w13l )|0;\n        th = ( 0xd5a79147 + w13h + ((tl >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 30\n        w14l = ( w14l + w7l )|0;\n        w14h = ( w14h + w7h + ((w14l >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 1) | (w15h << 31)) ^ ((w15l >>> 8) | (w15h << 24)) ^ ((w15l >>> 7) | (w15h << 25)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w15h >>> 1) | (w15l << 31)) ^ ((w15h >>> 8) | (w15l << 24)) ^ (w15h >>> 7) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 19) | (w12h << 13)) ^ ((w12l << 3) | (w12h >>> 29)) ^ ((w12l >>> 6) | (w12h << 26)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w12h >>> 19) | (w12l << 13)) ^ ((w12h << 3) | (w12l >>> 29)) ^ (w12h >>> 6) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xe003826f + w14l )|0;\n        th = ( 0x6ca6351 + w14h + ((tl >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 31\n        w15l = ( w15l + w8l )|0;\n        w15h = ( w15h + w8h + ((w15l >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 1) | (w0h << 31)) ^ ((w0l >>> 8) | (w0h << 24)) ^ ((w0l >>> 7) | (w0h << 25)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w0h >>> 1) | (w0l << 31)) ^ ((w0h >>> 8) | (w0l << 24)) ^ (w0h >>> 7) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 19) | (w13h << 13)) ^ ((w13l << 3) | (w13h >>> 29)) ^ ((w13l >>> 6) | (w13h << 26)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w13h >>> 19) | (w13l << 13)) ^ ((w13h << 3) | (w13l >>> 29)) ^ (w13h >>> 6) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xa0e6e70 + w15l )|0;\n        th = ( 0x14292967 + w15h + ((tl >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 32\n        w0l = ( w0l + w9l )|0;\n        w0h = ( w0h + w9h + ((w0l >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 1) | (w1h << 31)) ^ ((w1l >>> 8) | (w1h << 24)) ^ ((w1l >>> 7) | (w1h << 25)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w1h >>> 1) | (w1l << 31)) ^ ((w1h >>> 8) | (w1l << 24)) ^ (w1h >>> 7) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 19) | (w14h << 13)) ^ ((w14l << 3) | (w14h >>> 29)) ^ ((w14l >>> 6) | (w14h << 26)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w14h >>> 19) | (w14l << 13)) ^ ((w14h << 3) | (w14l >>> 29)) ^ (w14h >>> 6) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x46d22ffc + w0l )|0;\n        th = ( 0x27b70a85 + w0h + ((tl >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 33\n        w1l = ( w1l + w10l )|0;\n        w1h = ( w1h + w10h + ((w1l >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 1) | (w2h << 31)) ^ ((w2l >>> 8) | (w2h << 24)) ^ ((w2l >>> 7) | (w2h << 25)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w2h >>> 1) | (w2l << 31)) ^ ((w2h >>> 8) | (w2l << 24)) ^ (w2h >>> 7) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 19) | (w15h << 13)) ^ ((w15l << 3) | (w15h >>> 29)) ^ ((w15l >>> 6) | (w15h << 26)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w15h >>> 19) | (w15l << 13)) ^ ((w15h << 3) | (w15l >>> 29)) ^ (w15h >>> 6) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x5c26c926 + w1l )|0;\n        th = ( 0x2e1b2138 + w1h + ((tl >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 34\n        w2l = ( w2l + w11l )|0;\n        w2h = ( w2h + w11h + ((w2l >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 1) | (w3h << 31)) ^ ((w3l >>> 8) | (w3h << 24)) ^ ((w3l >>> 7) | (w3h << 25)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w3h >>> 1) | (w3l << 31)) ^ ((w3h >>> 8) | (w3l << 24)) ^ (w3h >>> 7) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 19) | (w0h << 13)) ^ ((w0l << 3) | (w0h >>> 29)) ^ ((w0l >>> 6) | (w0h << 26)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w0h >>> 19) | (w0l << 13)) ^ ((w0h << 3) | (w0l >>> 29)) ^ (w0h >>> 6) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x5ac42aed + w2l )|0;\n        th = ( 0x4d2c6dfc + w2h + ((tl >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 35\n        w3l = ( w3l + w12l )|0;\n        w3h = ( w3h + w12h + ((w3l >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 1) | (w4h << 31)) ^ ((w4l >>> 8) | (w4h << 24)) ^ ((w4l >>> 7) | (w4h << 25)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w4h >>> 1) | (w4l << 31)) ^ ((w4h >>> 8) | (w4l << 24)) ^ (w4h >>> 7) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 19) | (w1h << 13)) ^ ((w1l << 3) | (w1h >>> 29)) ^ ((w1l >>> 6) | (w1h << 26)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w1h >>> 19) | (w1l << 13)) ^ ((w1h << 3) | (w1l >>> 29)) ^ (w1h >>> 6) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x9d95b3df + w3l )|0;\n        th = ( 0x53380d13 + w3h + ((tl >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 36\n        w4l = ( w4l + w13l )|0;\n        w4h = ( w4h + w13h + ((w4l >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 1) | (w5h << 31)) ^ ((w5l >>> 8) | (w5h << 24)) ^ ((w5l >>> 7) | (w5h << 25)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w5h >>> 1) | (w5l << 31)) ^ ((w5h >>> 8) | (w5l << 24)) ^ (w5h >>> 7) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 19) | (w2h << 13)) ^ ((w2l << 3) | (w2h >>> 29)) ^ ((w2l >>> 6) | (w2h << 26)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w2h >>> 19) | (w2l << 13)) ^ ((w2h << 3) | (w2l >>> 29)) ^ (w2h >>> 6) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x8baf63de + w4l )|0;\n        th = ( 0x650a7354 + w4h + ((tl >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 37\n        w5l = ( w5l + w14l )|0;\n        w5h = ( w5h + w14h + ((w5l >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 1) | (w6h << 31)) ^ ((w6l >>> 8) | (w6h << 24)) ^ ((w6l >>> 7) | (w6h << 25)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w6h >>> 1) | (w6l << 31)) ^ ((w6h >>> 8) | (w6l << 24)) ^ (w6h >>> 7) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 19) | (w3h << 13)) ^ ((w3l << 3) | (w3h >>> 29)) ^ ((w3l >>> 6) | (w3h << 26)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w3h >>> 19) | (w3l << 13)) ^ ((w3h << 3) | (w3l >>> 29)) ^ (w3h >>> 6) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x3c77b2a8 + w5l )|0;\n        th = ( 0x766a0abb + w5h + ((tl >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 38\n        w6l = ( w6l + w15l )|0;\n        w6h = ( w6h + w15h + ((w6l >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 1) | (w7h << 31)) ^ ((w7l >>> 8) | (w7h << 24)) ^ ((w7l >>> 7) | (w7h << 25)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w7h >>> 1) | (w7l << 31)) ^ ((w7h >>> 8) | (w7l << 24)) ^ (w7h >>> 7) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 19) | (w4h << 13)) ^ ((w4l << 3) | (w4h >>> 29)) ^ ((w4l >>> 6) | (w4h << 26)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w4h >>> 19) | (w4l << 13)) ^ ((w4h << 3) | (w4l >>> 29)) ^ (w4h >>> 6) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x47edaee6 + w6l )|0;\n        th = ( 0x81c2c92e + w6h + ((tl >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 39\n        w7l = ( w7l + w0l )|0;\n        w7h = ( w7h + w0h + ((w7l >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 1) | (w8h << 31)) ^ ((w8l >>> 8) | (w8h << 24)) ^ ((w8l >>> 7) | (w8h << 25)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w8h >>> 1) | (w8l << 31)) ^ ((w8h >>> 8) | (w8l << 24)) ^ (w8h >>> 7) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 19) | (w5h << 13)) ^ ((w5l << 3) | (w5h >>> 29)) ^ ((w5l >>> 6) | (w5h << 26)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w5h >>> 19) | (w5l << 13)) ^ ((w5h << 3) | (w5l >>> 29)) ^ (w5h >>> 6) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x1482353b + w7l )|0;\n        th = ( 0x92722c85 + w7h + ((tl >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 40\n        w8l = ( w8l + w1l )|0;\n        w8h = ( w8h + w1h + ((w8l >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 1) | (w9h << 31)) ^ ((w9l >>> 8) | (w9h << 24)) ^ ((w9l >>> 7) | (w9h << 25)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w9h >>> 1) | (w9l << 31)) ^ ((w9h >>> 8) | (w9l << 24)) ^ (w9h >>> 7) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 19) | (w6h << 13)) ^ ((w6l << 3) | (w6h >>> 29)) ^ ((w6l >>> 6) | (w6h << 26)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w6h >>> 19) | (w6l << 13)) ^ ((w6h << 3) | (w6l >>> 29)) ^ (w6h >>> 6) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x4cf10364 + w8l )|0;\n        th = ( 0xa2bfe8a1 + w8h + ((tl >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 41\n        w9l = ( w9l + w2l )|0;\n        w9h = ( w9h + w2h + ((w9l >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 1) | (w10h << 31)) ^ ((w10l >>> 8) | (w10h << 24)) ^ ((w10l >>> 7) | (w10h << 25)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w10h >>> 1) | (w10l << 31)) ^ ((w10h >>> 8) | (w10l << 24)) ^ (w10h >>> 7) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 19) | (w7h << 13)) ^ ((w7l << 3) | (w7h >>> 29)) ^ ((w7l >>> 6) | (w7h << 26)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w7h >>> 19) | (w7l << 13)) ^ ((w7h << 3) | (w7l >>> 29)) ^ (w7h >>> 6) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xbc423001 + w9l )|0;\n        th = ( 0xa81a664b + w9h + ((tl >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 42\n        w10l = ( w10l + w3l )|0;\n        w10h = ( w10h + w3h + ((w10l >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 1) | (w11h << 31)) ^ ((w11l >>> 8) | (w11h << 24)) ^ ((w11l >>> 7) | (w11h << 25)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w11h >>> 1) | (w11l << 31)) ^ ((w11h >>> 8) | (w11l << 24)) ^ (w11h >>> 7) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 19) | (w8h << 13)) ^ ((w8l << 3) | (w8h >>> 29)) ^ ((w8l >>> 6) | (w8h << 26)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w8h >>> 19) | (w8l << 13)) ^ ((w8h << 3) | (w8l >>> 29)) ^ (w8h >>> 6) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xd0f89791 + w10l )|0;\n        th = ( 0xc24b8b70 + w10h + ((tl >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 43\n        w11l = ( w11l + w4l )|0;\n        w11h = ( w11h + w4h + ((w11l >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 1) | (w12h << 31)) ^ ((w12l >>> 8) | (w12h << 24)) ^ ((w12l >>> 7) | (w12h << 25)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w12h >>> 1) | (w12l << 31)) ^ ((w12h >>> 8) | (w12l << 24)) ^ (w12h >>> 7) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 19) | (w9h << 13)) ^ ((w9l << 3) | (w9h >>> 29)) ^ ((w9l >>> 6) | (w9h << 26)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w9h >>> 19) | (w9l << 13)) ^ ((w9h << 3) | (w9l >>> 29)) ^ (w9h >>> 6) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x654be30 + w11l )|0;\n        th = ( 0xc76c51a3 + w11h + ((tl >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 44\n        w12l = ( w12l + w5l )|0;\n        w12h = ( w12h + w5h + ((w12l >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 1) | (w13h << 31)) ^ ((w13l >>> 8) | (w13h << 24)) ^ ((w13l >>> 7) | (w13h << 25)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w13h >>> 1) | (w13l << 31)) ^ ((w13h >>> 8) | (w13l << 24)) ^ (w13h >>> 7) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 19) | (w10h << 13)) ^ ((w10l << 3) | (w10h >>> 29)) ^ ((w10l >>> 6) | (w10h << 26)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w10h >>> 19) | (w10l << 13)) ^ ((w10h << 3) | (w10l >>> 29)) ^ (w10h >>> 6) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xd6ef5218 + w12l )|0;\n        th = ( 0xd192e819 + w12h + ((tl >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 45\n        w13l = ( w13l + w6l )|0;\n        w13h = ( w13h + w6h + ((w13l >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 1) | (w14h << 31)) ^ ((w14l >>> 8) | (w14h << 24)) ^ ((w14l >>> 7) | (w14h << 25)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w14h >>> 1) | (w14l << 31)) ^ ((w14h >>> 8) | (w14l << 24)) ^ (w14h >>> 7) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 19) | (w11h << 13)) ^ ((w11l << 3) | (w11h >>> 29)) ^ ((w11l >>> 6) | (w11h << 26)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w11h >>> 19) | (w11l << 13)) ^ ((w11h << 3) | (w11l >>> 29)) ^ (w11h >>> 6) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x5565a910 + w13l )|0;\n        th = ( 0xd6990624 + w13h + ((tl >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 46\n        w14l = ( w14l + w7l )|0;\n        w14h = ( w14h + w7h + ((w14l >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 1) | (w15h << 31)) ^ ((w15l >>> 8) | (w15h << 24)) ^ ((w15l >>> 7) | (w15h << 25)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w15h >>> 1) | (w15l << 31)) ^ ((w15h >>> 8) | (w15l << 24)) ^ (w15h >>> 7) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 19) | (w12h << 13)) ^ ((w12l << 3) | (w12h >>> 29)) ^ ((w12l >>> 6) | (w12h << 26)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w12h >>> 19) | (w12l << 13)) ^ ((w12h << 3) | (w12l >>> 29)) ^ (w12h >>> 6) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x5771202a + w14l )|0;\n        th = ( 0xf40e3585 + w14h + ((tl >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 47\n        w15l = ( w15l + w8l )|0;\n        w15h = ( w15h + w8h + ((w15l >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 1) | (w0h << 31)) ^ ((w0l >>> 8) | (w0h << 24)) ^ ((w0l >>> 7) | (w0h << 25)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w0h >>> 1) | (w0l << 31)) ^ ((w0h >>> 8) | (w0l << 24)) ^ (w0h >>> 7) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 19) | (w13h << 13)) ^ ((w13l << 3) | (w13h >>> 29)) ^ ((w13l >>> 6) | (w13h << 26)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w13h >>> 19) | (w13l << 13)) ^ ((w13h << 3) | (w13l >>> 29)) ^ (w13h >>> 6) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x32bbd1b8 + w15l )|0;\n        th = ( 0x106aa070 + w15h + ((tl >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 48\n        w0l = ( w0l + w9l )|0;\n        w0h = ( w0h + w9h + ((w0l >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 1) | (w1h << 31)) ^ ((w1l >>> 8) | (w1h << 24)) ^ ((w1l >>> 7) | (w1h << 25)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w1h >>> 1) | (w1l << 31)) ^ ((w1h >>> 8) | (w1l << 24)) ^ (w1h >>> 7) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 19) | (w14h << 13)) ^ ((w14l << 3) | (w14h >>> 29)) ^ ((w14l >>> 6) | (w14h << 26)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w14h >>> 19) | (w14l << 13)) ^ ((w14h << 3) | (w14l >>> 29)) ^ (w14h >>> 6) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xb8d2d0c8 + w0l )|0;\n        th = ( 0x19a4c116 + w0h + ((tl >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 49\n        w1l = ( w1l + w10l )|0;\n        w1h = ( w1h + w10h + ((w1l >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 1) | (w2h << 31)) ^ ((w2l >>> 8) | (w2h << 24)) ^ ((w2l >>> 7) | (w2h << 25)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w2h >>> 1) | (w2l << 31)) ^ ((w2h >>> 8) | (w2l << 24)) ^ (w2h >>> 7) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 19) | (w15h << 13)) ^ ((w15l << 3) | (w15h >>> 29)) ^ ((w15l >>> 6) | (w15h << 26)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w15h >>> 19) | (w15l << 13)) ^ ((w15h << 3) | (w15l >>> 29)) ^ (w15h >>> 6) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x5141ab53 + w1l )|0;\n        th = ( 0x1e376c08 + w1h + ((tl >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 50\n        w2l = ( w2l + w11l )|0;\n        w2h = ( w2h + w11h + ((w2l >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 1) | (w3h << 31)) ^ ((w3l >>> 8) | (w3h << 24)) ^ ((w3l >>> 7) | (w3h << 25)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w3h >>> 1) | (w3l << 31)) ^ ((w3h >>> 8) | (w3l << 24)) ^ (w3h >>> 7) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 19) | (w0h << 13)) ^ ((w0l << 3) | (w0h >>> 29)) ^ ((w0l >>> 6) | (w0h << 26)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w0h >>> 19) | (w0l << 13)) ^ ((w0h << 3) | (w0l >>> 29)) ^ (w0h >>> 6) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xdf8eeb99 + w2l )|0;\n        th = ( 0x2748774c + w2h + ((tl >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 51\n        w3l = ( w3l + w12l )|0;\n        w3h = ( w3h + w12h + ((w3l >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 1) | (w4h << 31)) ^ ((w4l >>> 8) | (w4h << 24)) ^ ((w4l >>> 7) | (w4h << 25)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w4h >>> 1) | (w4l << 31)) ^ ((w4h >>> 8) | (w4l << 24)) ^ (w4h >>> 7) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 19) | (w1h << 13)) ^ ((w1l << 3) | (w1h >>> 29)) ^ ((w1l >>> 6) | (w1h << 26)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w1h >>> 19) | (w1l << 13)) ^ ((w1h << 3) | (w1l >>> 29)) ^ (w1h >>> 6) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xe19b48a8 + w3l )|0;\n        th = ( 0x34b0bcb5 + w3h + ((tl >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 52\n        w4l = ( w4l + w13l )|0;\n        w4h = ( w4h + w13h + ((w4l >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 1) | (w5h << 31)) ^ ((w5l >>> 8) | (w5h << 24)) ^ ((w5l >>> 7) | (w5h << 25)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w5h >>> 1) | (w5l << 31)) ^ ((w5h >>> 8) | (w5l << 24)) ^ (w5h >>> 7) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 19) | (w2h << 13)) ^ ((w2l << 3) | (w2h >>> 29)) ^ ((w2l >>> 6) | (w2h << 26)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w2h >>> 19) | (w2l << 13)) ^ ((w2h << 3) | (w2l >>> 29)) ^ (w2h >>> 6) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xc5c95a63 + w4l )|0;\n        th = ( 0x391c0cb3 + w4h + ((tl >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 53\n        w5l = ( w5l + w14l )|0;\n        w5h = ( w5h + w14h + ((w5l >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 1) | (w6h << 31)) ^ ((w6l >>> 8) | (w6h << 24)) ^ ((w6l >>> 7) | (w6h << 25)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w6h >>> 1) | (w6l << 31)) ^ ((w6h >>> 8) | (w6l << 24)) ^ (w6h >>> 7) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 19) | (w3h << 13)) ^ ((w3l << 3) | (w3h >>> 29)) ^ ((w3l >>> 6) | (w3h << 26)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w3h >>> 19) | (w3l << 13)) ^ ((w3h << 3) | (w3l >>> 29)) ^ (w3h >>> 6) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xe3418acb + w5l )|0;\n        th = ( 0x4ed8aa4a + w5h + ((tl >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 54\n        w6l = ( w6l + w15l )|0;\n        w6h = ( w6h + w15h + ((w6l >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 1) | (w7h << 31)) ^ ((w7l >>> 8) | (w7h << 24)) ^ ((w7l >>> 7) | (w7h << 25)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w7h >>> 1) | (w7l << 31)) ^ ((w7h >>> 8) | (w7l << 24)) ^ (w7h >>> 7) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 19) | (w4h << 13)) ^ ((w4l << 3) | (w4h >>> 29)) ^ ((w4l >>> 6) | (w4h << 26)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w4h >>> 19) | (w4l << 13)) ^ ((w4h << 3) | (w4l >>> 29)) ^ (w4h >>> 6) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x7763e373 + w6l )|0;\n        th = ( 0x5b9cca4f + w6h + ((tl >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 55\n        w7l = ( w7l + w0l )|0;\n        w7h = ( w7h + w0h + ((w7l >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 1) | (w8h << 31)) ^ ((w8l >>> 8) | (w8h << 24)) ^ ((w8l >>> 7) | (w8h << 25)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w8h >>> 1) | (w8l << 31)) ^ ((w8h >>> 8) | (w8l << 24)) ^ (w8h >>> 7) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 19) | (w5h << 13)) ^ ((w5l << 3) | (w5h >>> 29)) ^ ((w5l >>> 6) | (w5h << 26)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w5h >>> 19) | (w5l << 13)) ^ ((w5h << 3) | (w5l >>> 29)) ^ (w5h >>> 6) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xd6b2b8a3 + w7l )|0;\n        th = ( 0x682e6ff3 + w7h + ((tl >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 56\n        w8l = ( w8l + w1l )|0;\n        w8h = ( w8h + w1h + ((w8l >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 1) | (w9h << 31)) ^ ((w9l >>> 8) | (w9h << 24)) ^ ((w9l >>> 7) | (w9h << 25)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w9h >>> 1) | (w9l << 31)) ^ ((w9h >>> 8) | (w9l << 24)) ^ (w9h >>> 7) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 19) | (w6h << 13)) ^ ((w6l << 3) | (w6h >>> 29)) ^ ((w6l >>> 6) | (w6h << 26)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w6h >>> 19) | (w6l << 13)) ^ ((w6h << 3) | (w6l >>> 29)) ^ (w6h >>> 6) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x5defb2fc + w8l )|0;\n        th = ( 0x748f82ee + w8h + ((tl >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 57\n        w9l = ( w9l + w2l )|0;\n        w9h = ( w9h + w2h + ((w9l >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 1) | (w10h << 31)) ^ ((w10l >>> 8) | (w10h << 24)) ^ ((w10l >>> 7) | (w10h << 25)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w10h >>> 1) | (w10l << 31)) ^ ((w10h >>> 8) | (w10l << 24)) ^ (w10h >>> 7) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 19) | (w7h << 13)) ^ ((w7l << 3) | (w7h >>> 29)) ^ ((w7l >>> 6) | (w7h << 26)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w7h >>> 19) | (w7l << 13)) ^ ((w7h << 3) | (w7l >>> 29)) ^ (w7h >>> 6) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x43172f60 + w9l )|0;\n        th = ( 0x78a5636f + w9h + ((tl >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 58\n        w10l = ( w10l + w3l )|0;\n        w10h = ( w10h + w3h + ((w10l >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 1) | (w11h << 31)) ^ ((w11l >>> 8) | (w11h << 24)) ^ ((w11l >>> 7) | (w11h << 25)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w11h >>> 1) | (w11l << 31)) ^ ((w11h >>> 8) | (w11l << 24)) ^ (w11h >>> 7) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 19) | (w8h << 13)) ^ ((w8l << 3) | (w8h >>> 29)) ^ ((w8l >>> 6) | (w8h << 26)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w8h >>> 19) | (w8l << 13)) ^ ((w8h << 3) | (w8l >>> 29)) ^ (w8h >>> 6) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xa1f0ab72 + w10l )|0;\n        th = ( 0x84c87814 + w10h + ((tl >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 59\n        w11l = ( w11l + w4l )|0;\n        w11h = ( w11h + w4h + ((w11l >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 1) | (w12h << 31)) ^ ((w12l >>> 8) | (w12h << 24)) ^ ((w12l >>> 7) | (w12h << 25)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w12h >>> 1) | (w12l << 31)) ^ ((w12h >>> 8) | (w12l << 24)) ^ (w12h >>> 7) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 19) | (w9h << 13)) ^ ((w9l << 3) | (w9h >>> 29)) ^ ((w9l >>> 6) | (w9h << 26)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w9h >>> 19) | (w9l << 13)) ^ ((w9h << 3) | (w9l >>> 29)) ^ (w9h >>> 6) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x1a6439ec + w11l )|0;\n        th = ( 0x8cc70208 + w11h + ((tl >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 60\n        w12l = ( w12l + w5l )|0;\n        w12h = ( w12h + w5h + ((w12l >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 1) | (w13h << 31)) ^ ((w13l >>> 8) | (w13h << 24)) ^ ((w13l >>> 7) | (w13h << 25)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w13h >>> 1) | (w13l << 31)) ^ ((w13h >>> 8) | (w13l << 24)) ^ (w13h >>> 7) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 19) | (w10h << 13)) ^ ((w10l << 3) | (w10h >>> 29)) ^ ((w10l >>> 6) | (w10h << 26)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w10h >>> 19) | (w10l << 13)) ^ ((w10h << 3) | (w10l >>> 29)) ^ (w10h >>> 6) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x23631e28 + w12l )|0;\n        th = ( 0x90befffa + w12h + ((tl >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 61\n        w13l = ( w13l + w6l )|0;\n        w13h = ( w13h + w6h + ((w13l >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 1) | (w14h << 31)) ^ ((w14l >>> 8) | (w14h << 24)) ^ ((w14l >>> 7) | (w14h << 25)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w14h >>> 1) | (w14l << 31)) ^ ((w14h >>> 8) | (w14l << 24)) ^ (w14h >>> 7) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 19) | (w11h << 13)) ^ ((w11l << 3) | (w11h >>> 29)) ^ ((w11l >>> 6) | (w11h << 26)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w11h >>> 19) | (w11l << 13)) ^ ((w11h << 3) | (w11l >>> 29)) ^ (w11h >>> 6) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xde82bde9 + w13l )|0;\n        th = ( 0xa4506ceb + w13h + ((tl >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 62\n        w14l = ( w14l + w7l )|0;\n        w14h = ( w14h + w7h + ((w14l >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 1) | (w15h << 31)) ^ ((w15l >>> 8) | (w15h << 24)) ^ ((w15l >>> 7) | (w15h << 25)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w15h >>> 1) | (w15l << 31)) ^ ((w15h >>> 8) | (w15l << 24)) ^ (w15h >>> 7) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 19) | (w12h << 13)) ^ ((w12l << 3) | (w12h >>> 29)) ^ ((w12l >>> 6) | (w12h << 26)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w12h >>> 19) | (w12l << 13)) ^ ((w12h << 3) | (w12l >>> 29)) ^ (w12h >>> 6) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xb2c67915 + w14l )|0;\n        th = ( 0xbef9a3f7 + w14h + ((tl >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 63\n        w15l = ( w15l + w8l )|0;\n        w15h = ( w15h + w8h + ((w15l >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 1) | (w0h << 31)) ^ ((w0l >>> 8) | (w0h << 24)) ^ ((w0l >>> 7) | (w0h << 25)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w0h >>> 1) | (w0l << 31)) ^ ((w0h >>> 8) | (w0l << 24)) ^ (w0h >>> 7) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 19) | (w13h << 13)) ^ ((w13l << 3) | (w13h >>> 29)) ^ ((w13l >>> 6) | (w13h << 26)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w13h >>> 19) | (w13l << 13)) ^ ((w13h << 3) | (w13l >>> 29)) ^ (w13h >>> 6) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xe372532b + w15l )|0;\n        th = ( 0xc67178f2 + w15h + ((tl >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 64\n        w0l = ( w0l + w9l )|0;\n        w0h = ( w0h + w9h + ((w0l >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 1) | (w1h << 31)) ^ ((w1l >>> 8) | (w1h << 24)) ^ ((w1l >>> 7) | (w1h << 25)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w1h >>> 1) | (w1l << 31)) ^ ((w1h >>> 8) | (w1l << 24)) ^ (w1h >>> 7) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 19) | (w14h << 13)) ^ ((w14l << 3) | (w14h >>> 29)) ^ ((w14l >>> 6) | (w14h << 26)) )|0;\n        w0l = ( w0l + xl)|0;\n        w0h = ( w0h + ( ((w14h >>> 19) | (w14l << 13)) ^ ((w14h << 3) | (w14l >>> 29)) ^ (w14h >>> 6) ) + ((w0l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xea26619c + w0l )|0;\n        th = ( 0xca273ece + w0h + ((tl >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 65\n        w1l = ( w1l + w10l )|0;\n        w1h = ( w1h + w10h + ((w1l >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 1) | (w2h << 31)) ^ ((w2l >>> 8) | (w2h << 24)) ^ ((w2l >>> 7) | (w2h << 25)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w2h >>> 1) | (w2l << 31)) ^ ((w2h >>> 8) | (w2l << 24)) ^ (w2h >>> 7) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 19) | (w15h << 13)) ^ ((w15l << 3) | (w15h >>> 29)) ^ ((w15l >>> 6) | (w15h << 26)) )|0;\n        w1l = ( w1l + xl)|0;\n        w1h = ( w1h + ( ((w15h >>> 19) | (w15l << 13)) ^ ((w15h << 3) | (w15l >>> 29)) ^ (w15h >>> 6) ) + ((w1l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x21c0c207 + w1l )|0;\n        th = ( 0xd186b8c7 + w1h + ((tl >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 66\n        w2l = ( w2l + w11l )|0;\n        w2h = ( w2h + w11h + ((w2l >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 1) | (w3h << 31)) ^ ((w3l >>> 8) | (w3h << 24)) ^ ((w3l >>> 7) | (w3h << 25)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w3h >>> 1) | (w3l << 31)) ^ ((w3h >>> 8) | (w3l << 24)) ^ (w3h >>> 7) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 19) | (w0h << 13)) ^ ((w0l << 3) | (w0h >>> 29)) ^ ((w0l >>> 6) | (w0h << 26)) )|0;\n        w2l = ( w2l + xl)|0;\n        w2h = ( w2h + ( ((w0h >>> 19) | (w0l << 13)) ^ ((w0h << 3) | (w0l >>> 29)) ^ (w0h >>> 6) ) + ((w2l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xcde0eb1e + w2l )|0;\n        th = ( 0xeada7dd6 + w2h + ((tl >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 67\n        w3l = ( w3l + w12l )|0;\n        w3h = ( w3h + w12h + ((w3l >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 1) | (w4h << 31)) ^ ((w4l >>> 8) | (w4h << 24)) ^ ((w4l >>> 7) | (w4h << 25)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w4h >>> 1) | (w4l << 31)) ^ ((w4h >>> 8) | (w4l << 24)) ^ (w4h >>> 7) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w1l >>> 19) | (w1h << 13)) ^ ((w1l << 3) | (w1h >>> 29)) ^ ((w1l >>> 6) | (w1h << 26)) )|0;\n        w3l = ( w3l + xl)|0;\n        w3h = ( w3h + ( ((w1h >>> 19) | (w1l << 13)) ^ ((w1h << 3) | (w1l >>> 29)) ^ (w1h >>> 6) ) + ((w3l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xee6ed178 + w3l )|0;\n        th = ( 0xf57d4f7f + w3h + ((tl >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 68\n        w4l = ( w4l + w13l )|0;\n        w4h = ( w4h + w13h + ((w4l >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 1) | (w5h << 31)) ^ ((w5l >>> 8) | (w5h << 24)) ^ ((w5l >>> 7) | (w5h << 25)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w5h >>> 1) | (w5l << 31)) ^ ((w5h >>> 8) | (w5l << 24)) ^ (w5h >>> 7) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w2l >>> 19) | (w2h << 13)) ^ ((w2l << 3) | (w2h >>> 29)) ^ ((w2l >>> 6) | (w2h << 26)) )|0;\n        w4l = ( w4l + xl)|0;\n        w4h = ( w4h + ( ((w2h >>> 19) | (w2l << 13)) ^ ((w2h << 3) | (w2l >>> 29)) ^ (w2h >>> 6) ) + ((w4l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x72176fba + w4l )|0;\n        th = ( 0x6f067aa + w4h + ((tl >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 69\n        w5l = ( w5l + w14l )|0;\n        w5h = ( w5h + w14h + ((w5l >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 1) | (w6h << 31)) ^ ((w6l >>> 8) | (w6h << 24)) ^ ((w6l >>> 7) | (w6h << 25)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w6h >>> 1) | (w6l << 31)) ^ ((w6h >>> 8) | (w6l << 24)) ^ (w6h >>> 7) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w3l >>> 19) | (w3h << 13)) ^ ((w3l << 3) | (w3h >>> 29)) ^ ((w3l >>> 6) | (w3h << 26)) )|0;\n        w5l = ( w5l + xl)|0;\n        w5h = ( w5h + ( ((w3h >>> 19) | (w3l << 13)) ^ ((w3h << 3) | (w3l >>> 29)) ^ (w3h >>> 6) ) + ((w5l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xa2c898a6 + w5l )|0;\n        th = ( 0xa637dc5 + w5h + ((tl >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 70\n        w6l = ( w6l + w15l )|0;\n        w6h = ( w6h + w15h + ((w6l >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 1) | (w7h << 31)) ^ ((w7l >>> 8) | (w7h << 24)) ^ ((w7l >>> 7) | (w7h << 25)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w7h >>> 1) | (w7l << 31)) ^ ((w7h >>> 8) | (w7l << 24)) ^ (w7h >>> 7) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w4l >>> 19) | (w4h << 13)) ^ ((w4l << 3) | (w4h >>> 29)) ^ ((w4l >>> 6) | (w4h << 26)) )|0;\n        w6l = ( w6l + xl)|0;\n        w6h = ( w6h + ( ((w4h >>> 19) | (w4l << 13)) ^ ((w4h << 3) | (w4l >>> 29)) ^ (w4h >>> 6) ) + ((w6l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xbef90dae + w6l )|0;\n        th = ( 0x113f9804 + w6h + ((tl >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 71\n        w7l = ( w7l + w0l )|0;\n        w7h = ( w7h + w0h + ((w7l >>> 0) < (w0l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 1) | (w8h << 31)) ^ ((w8l >>> 8) | (w8h << 24)) ^ ((w8l >>> 7) | (w8h << 25)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w8h >>> 1) | (w8l << 31)) ^ ((w8h >>> 8) | (w8l << 24)) ^ (w8h >>> 7) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w5l >>> 19) | (w5h << 13)) ^ ((w5l << 3) | (w5h >>> 29)) ^ ((w5l >>> 6) | (w5h << 26)) )|0;\n        w7l = ( w7l + xl)|0;\n        w7h = ( w7h + ( ((w5h >>> 19) | (w5l << 13)) ^ ((w5h << 3) | (w5l >>> 29)) ^ (w5h >>> 6) ) + ((w7l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x131c471b + w7l )|0;\n        th = ( 0x1b710b35 + w7h + ((tl >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 72\n        w8l = ( w8l + w1l )|0;\n        w8h = ( w8h + w1h + ((w8l >>> 0) < (w1l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 1) | (w9h << 31)) ^ ((w9l >>> 8) | (w9h << 24)) ^ ((w9l >>> 7) | (w9h << 25)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w9h >>> 1) | (w9l << 31)) ^ ((w9h >>> 8) | (w9l << 24)) ^ (w9h >>> 7) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w6l >>> 19) | (w6h << 13)) ^ ((w6l << 3) | (w6h >>> 29)) ^ ((w6l >>> 6) | (w6h << 26)) )|0;\n        w8l = ( w8l + xl)|0;\n        w8h = ( w8h + ( ((w6h >>> 19) | (w6l << 13)) ^ ((w6h << 3) | (w6l >>> 29)) ^ (w6h >>> 6) ) + ((w8l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x23047d84 + w8l )|0;\n        th = ( 0x28db77f5 + w8h + ((tl >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 73\n        w9l = ( w9l + w2l )|0;\n        w9h = ( w9h + w2h + ((w9l >>> 0) < (w2l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 1) | (w10h << 31)) ^ ((w10l >>> 8) | (w10h << 24)) ^ ((w10l >>> 7) | (w10h << 25)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w10h >>> 1) | (w10l << 31)) ^ ((w10h >>> 8) | (w10l << 24)) ^ (w10h >>> 7) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w7l >>> 19) | (w7h << 13)) ^ ((w7l << 3) | (w7h >>> 29)) ^ ((w7l >>> 6) | (w7h << 26)) )|0;\n        w9l = ( w9l + xl)|0;\n        w9h = ( w9h + ( ((w7h >>> 19) | (w7l << 13)) ^ ((w7h << 3) | (w7l >>> 29)) ^ (w7h >>> 6) ) + ((w9l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x40c72493 + w9l )|0;\n        th = ( 0x32caab7b + w9h + ((tl >>> 0) < (w9l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 74\n        w10l = ( w10l + w3l )|0;\n        w10h = ( w10h + w3h + ((w10l >>> 0) < (w3l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 1) | (w11h << 31)) ^ ((w11l >>> 8) | (w11h << 24)) ^ ((w11l >>> 7) | (w11h << 25)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w11h >>> 1) | (w11l << 31)) ^ ((w11h >>> 8) | (w11l << 24)) ^ (w11h >>> 7) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w8l >>> 19) | (w8h << 13)) ^ ((w8l << 3) | (w8h >>> 29)) ^ ((w8l >>> 6) | (w8h << 26)) )|0;\n        w10l = ( w10l + xl)|0;\n        w10h = ( w10h + ( ((w8h >>> 19) | (w8l << 13)) ^ ((w8h << 3) | (w8l >>> 29)) ^ (w8h >>> 6) ) + ((w10l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x15c9bebc + w10l )|0;\n        th = ( 0x3c9ebe0a + w10h + ((tl >>> 0) < (w10l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 75\n        w11l = ( w11l + w4l )|0;\n        w11h = ( w11h + w4h + ((w11l >>> 0) < (w4l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 1) | (w12h << 31)) ^ ((w12l >>> 8) | (w12h << 24)) ^ ((w12l >>> 7) | (w12h << 25)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w12h >>> 1) | (w12l << 31)) ^ ((w12h >>> 8) | (w12l << 24)) ^ (w12h >>> 7) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w9l >>> 19) | (w9h << 13)) ^ ((w9l << 3) | (w9h >>> 29)) ^ ((w9l >>> 6) | (w9h << 26)) )|0;\n        w11l = ( w11l + xl)|0;\n        w11h = ( w11h + ( ((w9h >>> 19) | (w9l << 13)) ^ ((w9h << 3) | (w9l >>> 29)) ^ (w9h >>> 6) ) + ((w11l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x9c100d4c + w11l )|0;\n        th = ( 0x431d67c4 + w11h + ((tl >>> 0) < (w11l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 76\n        w12l = ( w12l + w5l )|0;\n        w12h = ( w12h + w5h + ((w12l >>> 0) < (w5l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 1) | (w13h << 31)) ^ ((w13l >>> 8) | (w13h << 24)) ^ ((w13l >>> 7) | (w13h << 25)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w13h >>> 1) | (w13l << 31)) ^ ((w13h >>> 8) | (w13l << 24)) ^ (w13h >>> 7) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w10l >>> 19) | (w10h << 13)) ^ ((w10l << 3) | (w10h >>> 29)) ^ ((w10l >>> 6) | (w10h << 26)) )|0;\n        w12l = ( w12l + xl)|0;\n        w12h = ( w12h + ( ((w10h >>> 19) | (w10l << 13)) ^ ((w10h << 3) | (w10l >>> 29)) ^ (w10h >>> 6) ) + ((w12l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xcb3e42b6 + w12l )|0;\n        th = ( 0x4cc5d4be + w12h + ((tl >>> 0) < (w12l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 77\n        w13l = ( w13l + w6l )|0;\n        w13h = ( w13h + w6h + ((w13l >>> 0) < (w6l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w14l >>> 1) | (w14h << 31)) ^ ((w14l >>> 8) | (w14h << 24)) ^ ((w14l >>> 7) | (w14h << 25)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w14h >>> 1) | (w14l << 31)) ^ ((w14h >>> 8) | (w14l << 24)) ^ (w14h >>> 7) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w11l >>> 19) | (w11h << 13)) ^ ((w11l << 3) | (w11h >>> 29)) ^ ((w11l >>> 6) | (w11h << 26)) )|0;\n        w13l = ( w13l + xl)|0;\n        w13h = ( w13h + ( ((w11h >>> 19) | (w11l << 13)) ^ ((w11h << 3) | (w11l >>> 29)) ^ (w11h >>> 6) ) + ((w13l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0xfc657e2a + w13l )|0;\n        th = ( 0x597f299c + w13h + ((tl >>> 0) < (w13l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 78\n        w14l = ( w14l + w7l )|0;\n        w14h = ( w14h + w7h + ((w14l >>> 0) < (w7l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w15l >>> 1) | (w15h << 31)) ^ ((w15l >>> 8) | (w15h << 24)) ^ ((w15l >>> 7) | (w15h << 25)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w15h >>> 1) | (w15l << 31)) ^ ((w15h >>> 8) | (w15l << 24)) ^ (w15h >>> 7) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w12l >>> 19) | (w12h << 13)) ^ ((w12l << 3) | (w12h >>> 29)) ^ ((w12l >>> 6) | (w12h << 26)) )|0;\n        w14l = ( w14l + xl)|0;\n        w14h = ( w14h + ( ((w12h >>> 19) | (w12l << 13)) ^ ((w12h << 3) | (w12l >>> 29)) ^ (w12h >>> 6) ) + ((w14l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x3ad6faec + w14l )|0;\n        th = ( 0x5fcb6fab + w14h + ((tl >>> 0) < (w14l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        // 79\n        w15l = ( w15l + w8l )|0;\n        w15h = ( w15h + w8h + ((w15l >>> 0) < (w8l >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w0l >>> 1) | (w0h << 31)) ^ ((w0l >>> 8) | (w0h << 24)) ^ ((w0l >>> 7) | (w0h << 25)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w0h >>> 1) | (w0l << 31)) ^ ((w0h >>> 8) | (w0l << 24)) ^ (w0h >>> 7) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((w13l >>> 19) | (w13h << 13)) ^ ((w13l << 3) | (w13h >>> 29)) ^ ((w13l >>> 6) | (w13h << 26)) )|0;\n        w15l = ( w15l + xl)|0;\n        w15h = ( w15h + ( ((w13h >>> 19) | (w13l << 13)) ^ ((w13h << 3) | (w13l >>> 29)) ^ (w13h >>> 6) ) + ((w15l >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        tl = ( 0x4a475817 + w15l )|0;\n        th = ( 0x6c44198c + w15h + ((tl >>> 0) < (w15l >>> 0) ? 1 : 0) )|0;\n        tl = ( tl + hl )|0;\n        th = ( th + hh + ((tl >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + (((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9))) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        xl = ( ( gl ^ el & (fl^gl) ) )|0;\n        tl = ( tl + xl )|0;\n        th = ( th + ( gh ^ eh & (fh^gh) ) + ((tl >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n        hl = gl; hh = gh;\n        gl = fl; gh = fh;\n        fl = el; fh = eh;\n        el = ( dl + tl )|0; eh = ( dh + th + ((el >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        dl = cl; dh = ch;\n        cl = bl; ch = bh;\n        bl = al; bh = ah;\n        al = ( tl + ( (bl & cl) ^ ( dl & (bl ^ cl) ) ) )|0;\n        ah = ( th + ( (bh & ch) ^ ( dh & (bh ^ ch) ) ) + ((al >>> 0) < (tl >>> 0) ? 1 : 0) )|0;\n        xl = ( ((bl >>> 28) | (bh << 4)) ^ ((bl << 30) | (bh >>> 2)) ^ ((bl << 25) | (bh >>> 7)) )|0;\n        al = ( al + xl )|0;\n        ah = ( ah + (((bh >>> 28) | (bl << 4)) ^ ((bh << 30) | (bl >>> 2)) ^ ((bh << 25) | (bl >>> 7))) + ((al >>> 0) < (xl >>> 0) ? 1 : 0) )|0;\n\n        H0l = ( H0l + al )|0;\n        H0h = ( H0h + ah + ((H0l >>> 0) < (al >>> 0) ? 1 : 0) )|0;\n        H1l = ( H1l + bl )|0;\n        H1h = ( H1h + bh + ((H1l >>> 0) < (bl >>> 0) ? 1 : 0) )|0;\n        H2l = ( H2l + cl )|0;\n        H2h = ( H2h + ch + ((H2l >>> 0) < (cl >>> 0) ? 1 : 0) )|0;\n        H3l = ( H3l + dl )|0;\n        H3h = ( H3h + dh + ((H3l >>> 0) < (dl >>> 0) ? 1 : 0) )|0;\n        H4l = ( H4l + el )|0;\n        H4h = ( H4h + eh + ((H4l >>> 0) < (el >>> 0) ? 1 : 0) )|0;\n        H5l = ( H5l + fl )|0;\n        H5h = ( H5h + fh + ((H5l >>> 0) < (fl >>> 0) ? 1 : 0) )|0;\n        H6l = ( H6l + gl )|0;\n        H6h = ( H6h + gh + ((H6l >>> 0) < (gl >>> 0) ? 1 : 0) )|0;\n        H7l = ( H7l + hl )|0;\n        H7h = ( H7h + hh + ((H7l >>> 0) < (hl >>> 0) ? 1 : 0) )|0;\n    }\n\n    function _core_heap ( offset ) {\n        offset = offset|0;\n\n        _core(\n            HEAP[offset|0]<<24 | HEAP[offset|1]<<16 | HEAP[offset|2]<<8 | HEAP[offset|3],\n            HEAP[offset|4]<<24 | HEAP[offset|5]<<16 | HEAP[offset|6]<<8 | HEAP[offset|7],\n            HEAP[offset|8]<<24 | HEAP[offset|9]<<16 | HEAP[offset|10]<<8 | HEAP[offset|11],\n            HEAP[offset|12]<<24 | HEAP[offset|13]<<16 | HEAP[offset|14]<<8 | HEAP[offset|15],\n            HEAP[offset|16]<<24 | HEAP[offset|17]<<16 | HEAP[offset|18]<<8 | HEAP[offset|19],\n            HEAP[offset|20]<<24 | HEAP[offset|21]<<16 | HEAP[offset|22]<<8 | HEAP[offset|23],\n            HEAP[offset|24]<<24 | HEAP[offset|25]<<16 | HEAP[offset|26]<<8 | HEAP[offset|27],\n            HEAP[offset|28]<<24 | HEAP[offset|29]<<16 | HEAP[offset|30]<<8 | HEAP[offset|31],\n            HEAP[offset|32]<<24 | HEAP[offset|33]<<16 | HEAP[offset|34]<<8 | HEAP[offset|35],\n            HEAP[offset|36]<<24 | HEAP[offset|37]<<16 | HEAP[offset|38]<<8 | HEAP[offset|39],\n            HEAP[offset|40]<<24 | HEAP[offset|41]<<16 | HEAP[offset|42]<<8 | HEAP[offset|43],\n            HEAP[offset|44]<<24 | HEAP[offset|45]<<16 | HEAP[offset|46]<<8 | HEAP[offset|47],\n            HEAP[offset|48]<<24 | HEAP[offset|49]<<16 | HEAP[offset|50]<<8 | HEAP[offset|51],\n            HEAP[offset|52]<<24 | HEAP[offset|53]<<16 | HEAP[offset|54]<<8 | HEAP[offset|55],\n            HEAP[offset|56]<<24 | HEAP[offset|57]<<16 | HEAP[offset|58]<<8 | HEAP[offset|59],\n            HEAP[offset|60]<<24 | HEAP[offset|61]<<16 | HEAP[offset|62]<<8 | HEAP[offset|63],\n            HEAP[offset|64]<<24 | HEAP[offset|65]<<16 | HEAP[offset|66]<<8 | HEAP[offset|67],\n            HEAP[offset|68]<<24 | HEAP[offset|69]<<16 | HEAP[offset|70]<<8 | HEAP[offset|71],\n            HEAP[offset|72]<<24 | HEAP[offset|73]<<16 | HEAP[offset|74]<<8 | HEAP[offset|75],\n            HEAP[offset|76]<<24 | HEAP[offset|77]<<16 | HEAP[offset|78]<<8 | HEAP[offset|79],\n            HEAP[offset|80]<<24 | HEAP[offset|81]<<16 | HEAP[offset|82]<<8 | HEAP[offset|83],\n            HEAP[offset|84]<<24 | HEAP[offset|85]<<16 | HEAP[offset|86]<<8 | HEAP[offset|87],\n            HEAP[offset|88]<<24 | HEAP[offset|89]<<16 | HEAP[offset|90]<<8 | HEAP[offset|91],\n            HEAP[offset|92]<<24 | HEAP[offset|93]<<16 | HEAP[offset|94]<<8 | HEAP[offset|95],\n            HEAP[offset|96]<<24 | HEAP[offset|97]<<16 | HEAP[offset|98]<<8 | HEAP[offset|99],\n            HEAP[offset|100]<<24 | HEAP[offset|101]<<16 | HEAP[offset|102]<<8 | HEAP[offset|103],\n            HEAP[offset|104]<<24 | HEAP[offset|105]<<16 | HEAP[offset|106]<<8 | HEAP[offset|107],\n            HEAP[offset|108]<<24 | HEAP[offset|109]<<16 | HEAP[offset|110]<<8 | HEAP[offset|111],\n            HEAP[offset|112]<<24 | HEAP[offset|113]<<16 | HEAP[offset|114]<<8 | HEAP[offset|115],\n            HEAP[offset|116]<<24 | HEAP[offset|117]<<16 | HEAP[offset|118]<<8 | HEAP[offset|119],\n            HEAP[offset|120]<<24 | HEAP[offset|121]<<16 | HEAP[offset|122]<<8 | HEAP[offset|123],\n            HEAP[offset|124]<<24 | HEAP[offset|125]<<16 | HEAP[offset|126]<<8 | HEAP[offset|127]\n        );\n    }\n\n    // offset — multiple of 32\n    function _state_to_heap ( output ) {\n        output = output|0;\n\n        HEAP[output|0] = H0h>>>24;\n        HEAP[output|1] = H0h>>>16&255;\n        HEAP[output|2] = H0h>>>8&255;\n        HEAP[output|3] = H0h&255;\n        HEAP[output|4] = H0l>>>24;\n        HEAP[output|5] = H0l>>>16&255;\n        HEAP[output|6] = H0l>>>8&255;\n        HEAP[output|7] = H0l&255;\n        HEAP[output|8] = H1h>>>24;\n        HEAP[output|9] = H1h>>>16&255;\n        HEAP[output|10] = H1h>>>8&255;\n        HEAP[output|11] = H1h&255;\n        HEAP[output|12] = H1l>>>24;\n        HEAP[output|13] = H1l>>>16&255;\n        HEAP[output|14] = H1l>>>8&255;\n        HEAP[output|15] = H1l&255;\n        HEAP[output|16] = H2h>>>24;\n        HEAP[output|17] = H2h>>>16&255;\n        HEAP[output|18] = H2h>>>8&255;\n        HEAP[output|19] = H2h&255;\n        HEAP[output|20] = H2l>>>24;\n        HEAP[output|21] = H2l>>>16&255;\n        HEAP[output|22] = H2l>>>8&255;\n        HEAP[output|23] = H2l&255;\n        HEAP[output|24] = H3h>>>24;\n        HEAP[output|25] = H3h>>>16&255;\n        HEAP[output|26] = H3h>>>8&255;\n        HEAP[output|27] = H3h&255;\n        HEAP[output|28] = H3l>>>24;\n        HEAP[output|29] = H3l>>>16&255;\n        HEAP[output|30] = H3l>>>8&255;\n        HEAP[output|31] = H3l&255;\n        HEAP[output|32] = H4h>>>24;\n        HEAP[output|33] = H4h>>>16&255;\n        HEAP[output|34] = H4h>>>8&255;\n        HEAP[output|35] = H4h&255;\n        HEAP[output|36] = H4l>>>24;\n        HEAP[output|37] = H4l>>>16&255;\n        HEAP[output|38] = H4l>>>8&255;\n        HEAP[output|39] = H4l&255;\n        HEAP[output|40] = H5h>>>24;\n        HEAP[output|41] = H5h>>>16&255;\n        HEAP[output|42] = H5h>>>8&255;\n        HEAP[output|43] = H5h&255;\n        HEAP[output|44] = H5l>>>24;\n        HEAP[output|45] = H5l>>>16&255;\n        HEAP[output|46] = H5l>>>8&255;\n        HEAP[output|47] = H5l&255;\n        HEAP[output|48] = H6h>>>24;\n        HEAP[output|49] = H6h>>>16&255;\n        HEAP[output|50] = H6h>>>8&255;\n        HEAP[output|51] = H6h&255;\n        HEAP[output|52] = H6l>>>24;\n        HEAP[output|53] = H6l>>>16&255;\n        HEAP[output|54] = H6l>>>8&255;\n        HEAP[output|55] = H6l&255;\n        HEAP[output|56] = H7h>>>24;\n        HEAP[output|57] = H7h>>>16&255;\n        HEAP[output|58] = H7h>>>8&255;\n        HEAP[output|59] = H7h&255;\n        HEAP[output|60] = H7l>>>24;\n        HEAP[output|61] = H7l>>>16&255;\n        HEAP[output|62] = H7l>>>8&255;\n        HEAP[output|63] = H7l&255;\n    }\n\n    function reset () {\n        H0h = 0x6a09e667;\n        H0l = 0xf3bcc908;\n        H1h = 0xbb67ae85;\n        H1l = 0x84caa73b;\n        H2h = 0x3c6ef372;\n        H2l = 0xfe94f82b;\n        H3h = 0xa54ff53a;\n        H3l = 0x5f1d36f1;\n        H4h = 0x510e527f;\n        H4l = 0xade682d1;\n        H5h = 0x9b05688c;\n        H5l = 0x2b3e6c1f;\n        H6h = 0x1f83d9ab;\n        H6l = 0xfb41bd6b;\n        H7h = 0x5be0cd19;\n        H7l = 0x137e2179;\n\n        TOTAL0 = TOTAL1 = 0;\n    }\n\n    function init ( h0h, h0l, h1h, h1l, h2h, h2l, h3h, h3l, h4h, h4l, h5h, h5l, h6h, h6l, h7h, h7l, total0, total1 ) {\n        h0h = h0h|0;\n        h0l = h0l|0;\n        h1h = h1h|0;\n        h1l = h1l|0;\n        h2h = h2h|0;\n        h2l = h2l|0;\n        h3h = h3h|0;\n        h3l = h3l|0;\n        h4h = h4h|0;\n        h4l = h4l|0;\n        h5h = h5h|0;\n        h5l = h5l|0;\n        h6h = h6h|0;\n        h6l = h6l|0;\n        h7h = h7h|0;\n        h7l = h7l|0;\n        total0 = total0|0;\n        total1 = total1|0;\n\n        H0h = h0h;\n        H0l = h0l;\n        H1h = h1h;\n        H1l = h1l;\n        H2h = h2h;\n        H2l = h2l;\n        H3h = h3h;\n        H3l = h3l;\n        H4h = h4h;\n        H4l = h4l;\n        H5h = h5h;\n        H5l = h5l;\n        H6h = h6h;\n        H6l = h6l;\n        H7h = h7h;\n        H7l = h7l;\n        TOTAL0 = total0;\n        TOTAL1 = total1;\n    }\n\n    // offset — multiple of 128\n    function process ( offset, length ) {\n        offset = offset|0;\n        length = length|0;\n\n        var hashed = 0;\n\n        if ( offset & 127 )\n            return -1;\n\n        while ( (length|0) >= 128 ) {\n            _core_heap(offset);\n\n            offset = ( offset + 128 )|0;\n            length = ( length - 128 )|0;\n\n            hashed = ( hashed + 128 )|0;\n        }\n\n        TOTAL0 = ( TOTAL0 + hashed )|0;\n        if ( TOTAL0>>>0 < hashed>>>0 ) TOTAL1 = ( TOTAL1 + 1 )|0;\n\n        return hashed|0;\n    }\n\n    // offset — multiple of 128\n    // output — multiple of 64\n    function finish ( offset, length, output ) {\n        offset = offset|0;\n        length = length|0;\n        output = output|0;\n\n        var hashed = 0,\n            i = 0;\n\n        if ( offset & 127 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 63 )\n                return -1;\n\n        if ( (length|0) >= 128 ) {\n            hashed = process( offset, length )|0;\n            if ( (hashed|0) == -1 )\n                return -1;\n\n            offset = ( offset + hashed )|0;\n            length = ( length - hashed )|0;\n        }\n\n        hashed = ( hashed + length )|0;\n        TOTAL0 = ( TOTAL0 + length )|0;\n        if ( TOTAL0>>>0 < length>>>0 ) TOTAL1 = ( TOTAL1 + 1 )|0;\n\n        HEAP[offset|length] = 0x80;\n\n        if ( (length|0) >= 112 ) {\n            for ( i = (length+1)|0; (i|0) < 128; i = (i+1)|0 )\n                HEAP[offset|i] = 0x00;\n\n            _core_heap(offset);\n\n            length = 0;\n\n            HEAP[offset|0] = 0;\n        }\n\n        for ( i = (length+1)|0; (i|0) < 123; i = (i+1)|0 )\n            HEAP[offset|i] = 0;\n\n        HEAP[offset|120] = TOTAL1>>>21&255;\n        HEAP[offset|121] = TOTAL1>>>13&255;\n        HEAP[offset|122] = TOTAL1>>>5&255;\n        HEAP[offset|123] = TOTAL1<<3&255 | TOTAL0>>>29;\n        HEAP[offset|124] = TOTAL0>>>21&255;\n        HEAP[offset|125] = TOTAL0>>>13&255;\n        HEAP[offset|126] = TOTAL0>>>5&255;\n        HEAP[offset|127] = TOTAL0<<3&255;\n        _core_heap(offset);\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return hashed|0;\n    }\n\n    function hmac_reset () {\n        H0h = I0h;\n        H0l = I0l;\n        H1h = I1h;\n        H1l = I1l;\n        H2h = I2h;\n        H2l = I2l;\n        H3h = I3h;\n        H3l = I3l;\n        H4h = I4h;\n        H4l = I4l;\n        H5h = I5h;\n        H5l = I5l;\n        H6h = I6h;\n        H6l = I6l;\n        H7h = I7h;\n        H7l = I7l;\n        TOTAL0 = 128;\n        TOTAL1 = 0;\n    }\n\n    function _hmac_opad () {\n        H0h = O0h;\n        H0l = O0l;\n        H1h = O1h;\n        H1l = O1l;\n        H2h = O2h;\n        H2l = O2l;\n        H3h = O3h;\n        H3l = O3l;\n        H4h = O4h;\n        H4l = O4l;\n        H5h = O5h;\n        H5l = O5l;\n        H6h = O6h;\n        H6l = O6l;\n        H7h = O7h;\n        H7l = O7l;\n        TOTAL0 = 128;\n        TOTAL1 = 0;\n    }\n\n    function hmac_init ( p0h, p0l, p1h, p1l, p2h, p2l, p3h, p3l, p4h, p4l, p5h, p5l, p6h, p6l, p7h, p7l, p8h, p8l, p9h, p9l, p10h, p10l, p11h, p11l, p12h, p12l, p13h, p13l, p14h, p14l, p15h, p15l ) {\n        p0h = p0h|0;\n        p0l = p0l|0;\n        p1h = p1h|0;\n        p1l = p1l|0;\n        p2h = p2h|0;\n        p2l = p2l|0;\n        p3h = p3h|0;\n        p3l = p3l|0;\n        p4h = p4h|0;\n        p4l = p4l|0;\n        p5h = p5h|0;\n        p5l = p5l|0;\n        p6h = p6h|0;\n        p6l = p6l|0;\n        p7h = p7h|0;\n        p7l = p7l|0;\n        p8h = p8h|0;\n        p8l = p8l|0;\n        p9h = p9h|0;\n        p9l = p9l|0;\n        p10h = p10h|0;\n        p10l = p10l|0;\n        p11h = p11h|0;\n        p11l = p11l|0;\n        p12h = p12h|0;\n        p12l = p12l|0;\n        p13h = p13h|0;\n        p13l = p13l|0;\n        p14h = p14h|0;\n        p14l = p14l|0;\n        p15h = p15h|0;\n        p15l = p15l|0;\n\n        // opad\n        reset();\n        _core(\n            p0h ^ 0x5c5c5c5c,\n            p0l ^ 0x5c5c5c5c,\n            p1h ^ 0x5c5c5c5c,\n            p1l ^ 0x5c5c5c5c,\n            p2h ^ 0x5c5c5c5c,\n            p2l ^ 0x5c5c5c5c,\n            p3h ^ 0x5c5c5c5c,\n            p3l ^ 0x5c5c5c5c,\n            p4h ^ 0x5c5c5c5c,\n            p4l ^ 0x5c5c5c5c,\n            p5h ^ 0x5c5c5c5c,\n            p5l ^ 0x5c5c5c5c,\n            p6h ^ 0x5c5c5c5c,\n            p6l ^ 0x5c5c5c5c,\n            p7h ^ 0x5c5c5c5c,\n            p7l ^ 0x5c5c5c5c,\n            p8h ^ 0x5c5c5c5c,\n            p8l ^ 0x5c5c5c5c,\n            p9h ^ 0x5c5c5c5c,\n            p9l ^ 0x5c5c5c5c,\n            p10h ^ 0x5c5c5c5c,\n            p10l ^ 0x5c5c5c5c,\n            p11h ^ 0x5c5c5c5c,\n            p11l ^ 0x5c5c5c5c,\n            p12h ^ 0x5c5c5c5c,\n            p12l ^ 0x5c5c5c5c,\n            p13h ^ 0x5c5c5c5c,\n            p13l ^ 0x5c5c5c5c,\n            p14h ^ 0x5c5c5c5c,\n            p14l ^ 0x5c5c5c5c,\n            p15h ^ 0x5c5c5c5c,\n            p15l ^ 0x5c5c5c5c\n        );\n        O0h = H0h;\n        O0l = H0l;\n        O1h = H1h;\n        O1l = H1l;\n        O2h = H2h;\n        O2l = H2l;\n        O3h = H3h;\n        O3l = H3l;\n        O4h = H4h;\n        O4l = H4l;\n        O5h = H5h;\n        O5l = H5l;\n        O6h = H6h;\n        O6l = H6l;\n        O7h = H7h;\n        O7l = H7l;\n\n        // ipad\n        reset();\n        _core(\n           p0h ^ 0x36363636,\n           p0l ^ 0x36363636,\n           p1h ^ 0x36363636,\n           p1l ^ 0x36363636,\n           p2h ^ 0x36363636,\n           p2l ^ 0x36363636,\n           p3h ^ 0x36363636,\n           p3l ^ 0x36363636,\n           p4h ^ 0x36363636,\n           p4l ^ 0x36363636,\n           p5h ^ 0x36363636,\n           p5l ^ 0x36363636,\n           p6h ^ 0x36363636,\n           p6l ^ 0x36363636,\n           p7h ^ 0x36363636,\n           p7l ^ 0x36363636,\n           p8h ^ 0x36363636,\n           p8l ^ 0x36363636,\n           p9h ^ 0x36363636,\n           p9l ^ 0x36363636,\n           p10h ^ 0x36363636,\n           p10l ^ 0x36363636,\n           p11h ^ 0x36363636,\n           p11l ^ 0x36363636,\n           p12h ^ 0x36363636,\n           p12l ^ 0x36363636,\n           p13h ^ 0x36363636,\n           p13l ^ 0x36363636,\n           p14h ^ 0x36363636,\n           p14l ^ 0x36363636,\n           p15h ^ 0x36363636,\n           p15l ^ 0x36363636\n        );\n        I0h = H0h;\n        I0l = H0l;\n        I1h = H1h;\n        I1l = H1l;\n        I2h = H2h;\n        I2l = H2l;\n        I3h = H3h;\n        I3l = H3l;\n        I4h = H4h;\n        I4l = H4l;\n        I5h = H5h;\n        I5l = H5l;\n        I6h = H6h;\n        I6l = H6l;\n        I7h = H7h;\n        I7l = H7l;\n\n        TOTAL0 = 128;\n        TOTAL1 = 0;\n    }\n\n    // offset — multiple of 128\n    // output — multiple of 64\n    function hmac_finish ( offset, length, output ) {\n        offset = offset|0;\n        length = length|0;\n        output = output|0;\n\n        var t0h = 0, t0l = 0, t1h = 0, t1l = 0, t2h = 0, t2l = 0, t3h = 0, t3l = 0,\n            t4h = 0, t4l = 0, t5h = 0, t5l = 0, t6h = 0, t6l = 0, t7h = 0, t7l = 0,\n            hashed = 0;\n\n        if ( offset & 127 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 63 )\n                return -1;\n\n        hashed = finish( offset, length, -1 )|0;\n        t0h = H0h;\n        t0l = H0l;\n        t1h = H1h;\n        t1l = H1l;\n        t2h = H2h;\n        t2l = H2l;\n        t3h = H3h;\n        t3l = H3l;\n        t4h = H4h;\n        t4l = H4l;\n        t5h = H5h;\n        t5l = H5l;\n        t6h = H6h;\n        t6l = H6l;\n        t7h = H7h;\n        t7l = H7l;\n\n        _hmac_opad();\n        _core( t0h, t0l, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1536 );\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return hashed|0;\n    }\n\n    // salt is assumed to be already processed\n    // offset — multiple of 128\n    // output — multiple of 64\n    function pbkdf2_generate_block ( offset, length, block, count, output ) {\n        offset = offset|0;\n        length = length|0;\n        block = block|0;\n        count = count|0;\n        output = output|0;\n\n        var h0h = 0, h0l = 0, h1h = 0, h1l = 0, h2h = 0, h2l = 0, h3h = 0, h3l = 0,\n            h4h = 0, h4l = 0, h5h = 0, h5l = 0, h6h = 0, h6l = 0, h7h = 0, h7l = 0,\n            t0h = 0, t0l = 0, t1h = 0, t1l = 0, t2h = 0, t2l = 0, t3h = 0, t3l = 0,\n            t4h = 0, t4l = 0, t5h = 0, t5l = 0, t6h = 0, t6l = 0, t7h = 0, t7l = 0;\n\n        if ( offset & 127 )\n            return -1;\n\n        if ( ~output )\n            if ( output & 63 )\n                return -1;\n\n        // pad block number into heap\n        // FIXME probable OOB write\n        HEAP[(offset+length)|0]   = block>>>24;\n        HEAP[(offset+length+1)|0] = block>>>16&255;\n        HEAP[(offset+length+2)|0] = block>>>8&255;\n        HEAP[(offset+length+3)|0] = block&255;\n\n        // finish first iteration\n        hmac_finish( offset, (length+4)|0, -1 )|0;\n\n        h0h = t0h = H0h;\n        h0l = t0l = H0l;\n        h1h = t1h = H1h;\n        h1l = t1l = H1l;\n        h2h = t2h = H2h;\n        h2l = t2l = H2l;\n        h3h = t3h = H3h;\n        h3l = t3l = H3l;\n        h4h = t4h = H4h;\n        h4l = t4l = H4l;\n        h5h = t5h = H5h;\n        h5l = t5l = H5l;\n        h6h = t6h = H6h;\n        h6l = t6l = H6l;\n        h7h = t7h = H7h;\n        h7l = t7l = H7l;\n\n        count = (count-1)|0;\n\n        // perform the rest iterations\n        while ( (count|0) > 0 ) {\n            hmac_reset();\n            _core( t0h, t0l, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1536 );\n\n            t0h = H0h;\n            t0l = H0l;\n            t1h = H1h;\n            t1l = H1l;\n            t2h = H2h;\n            t2l = H2l;\n            t3h = H3h;\n            t3l = H3l;\n            t4h = H4h;\n            t4l = H4l;\n            t5h = H5h;\n            t5l = H5l;\n            t6h = H6h;\n            t6l = H6l;\n            t7h = H7h;\n            t7l = H7l;\n\n            _hmac_opad();\n            _core( t0h, t0l, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1536 );\n\n            t0h = H0h;\n            t0l = H0l;\n            t1h = H1h;\n            t1l = H1l;\n            t2h = H2h;\n            t2l = H2l;\n            t3h = H3h;\n            t3l = H3l;\n            t4h = H4h;\n            t4l = H4l;\n            t5h = H5h;\n            t5l = H5l;\n            t6h = H6h;\n            t6l = H6l;\n            t7h = H7h;\n            t7l = H7l;\n\n            h0h = h0h ^ H0h;\n            h0l = h0l ^ H0l;\n            h1h = h1h ^ H1h;\n            h1l = h1l ^ H1l;\n            h2h = h2h ^ H2h;\n            h2l = h2l ^ H2l;\n            h3h = h3h ^ H3h;\n            h3l = h3l ^ H3l;\n            h4h = h4h ^ H4h;\n            h4l = h4l ^ H4l;\n            h5h = h5h ^ H5h;\n            h5l = h5l ^ H5l;\n            h6h = h6h ^ H6h;\n            h6l = h6l ^ H6l;\n            h7h = h7h ^ H7h;\n            h7l = h7l ^ H7l;\n\n            count = (count-1)|0;\n        }\n\n        H0h = h0h;\n        H0l = h0l;\n        H1h = h1h;\n        H1l = h1l;\n        H2h = h2h;\n        H2l = h2l;\n        H3h = h3h;\n        H3l = h3l;\n        H4h = h4h;\n        H4l = h4l;\n        H5h = h5h;\n        H5l = h5l;\n        H6h = h6h;\n        H6l = h6l;\n        H7h = h7h;\n        H7l = h7l;\n\n        if ( ~output )\n            _state_to_heap(output);\n\n        return 0;\n    }\n\n    return {\n      // SHA512\n      reset: reset,\n      init: init,\n      process: process,\n      finish: finish,\n\n      // HMAC-SHA512\n      hmac_reset: hmac_reset,\n      hmac_init: hmac_init,\n      hmac_finish: hmac_finish,\n\n      // PBKDF2-HMAC-SHA512\n      pbkdf2_generate_block: pbkdf2_generate_block\n    }\n};\n\nconst _sha512_block_size = 128;\nconst _sha512_hash_size = 64;\nclass Sha512 extends Hash {\n    constructor() {\n        super();\n        this.NAME = 'sha512';\n        this.BLOCK_SIZE = _sha512_block_size;\n        this.HASH_SIZE = _sha512_hash_size;\n        this.heap = _heap_init();\n        this.asm = sha512_asm({ Uint8Array: Uint8Array }, null, this.heap.buffer);\n        this.reset();\n    }\n}\nSha512.NAME = 'sha512';\n\nclass Hmac {\n    constructor(hash, password, verify) {\n        if (!hash.HASH_SIZE)\n            throw new SyntaxError(\"option 'hash' supplied doesn't seem to be a valid hash function\");\n        this.hash = hash;\n        this.BLOCK_SIZE = this.hash.BLOCK_SIZE;\n        this.HMAC_SIZE = this.hash.HASH_SIZE;\n        this.result = null;\n        this.key = _hmac_key(this.hash, password);\n        const ipad = new Uint8Array(this.key);\n        for (let i = 0; i < ipad.length; ++i)\n            ipad[i] ^= 0x36;\n        this.hash.reset().process(ipad);\n        if (verify !== undefined) {\n            this._hmac_init_verify(verify);\n        }\n        else {\n            this.verify = null;\n        }\n    }\n    process(data) {\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        this.hash.process(data);\n        return this;\n    }\n    finish() {\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        const inner_result = this.hash.finish().result;\n        const opad = new Uint8Array(this.key);\n        for (let i = 0; i < opad.length; ++i)\n            opad[i] ^= 0x5c;\n        const verify = this.verify;\n        const result = this.hash\n            .reset()\n            .process(opad)\n            .process(inner_result)\n            .finish().result;\n        if (verify) {\n            if (verify.length === result.length) {\n                let diff = 0;\n                for (let i = 0; i < verify.length; i++) {\n                    diff |= verify[i] ^ result[i];\n                }\n                if (diff !== 0)\n                    throw new Error(\"HMAC verification failed, hash value doesn't match\");\n            }\n            else {\n                throw new Error(\"HMAC verification failed, lengths doesn't match\");\n            }\n        }\n        this.result = result;\n        return this;\n    }\n    _hmac_init_verify(verify) {\n        if (verify.length !== this.HMAC_SIZE)\n            throw new IllegalArgumentError('illegal verification tag size');\n        this.verify = verify;\n    }\n}\nfunction _hmac_key(hash, password) {\n    const key = new Uint8Array(hash.BLOCK_SIZE);\n    if (password.length > hash.BLOCK_SIZE) {\n        key.set(hash\n            .reset()\n            .process(password)\n            .finish().result);\n    }\n    else {\n        key.set(password);\n    }\n    return key;\n}\n\nclass HmacSha1 extends Hmac {\n    constructor(password, verify) {\n        const hash = new Sha1();\n        // Calculate ipad, init the underlying engine, calculate this.key\n        super(hash, password, verify);\n        this.reset();\n        if (verify !== undefined) {\n            this._hmac_init_verify(verify);\n        }\n        else {\n            this.verify = null;\n        }\n        return this;\n    }\n    reset() {\n        this.result = null;\n        const key = this.key;\n        this.hash\n            .reset()\n            .asm.hmac_init((key[0] << 24) | (key[1] << 16) | (key[2] << 8) | key[3], (key[4] << 24) | (key[5] << 16) | (key[6] << 8) | key[7], (key[8] << 24) | (key[9] << 16) | (key[10] << 8) | key[11], (key[12] << 24) | (key[13] << 16) | (key[14] << 8) | key[15], (key[16] << 24) | (key[17] << 16) | (key[18] << 8) | key[19], (key[20] << 24) | (key[21] << 16) | (key[22] << 8) | key[23], (key[24] << 24) | (key[25] << 16) | (key[26] << 8) | key[27], (key[28] << 24) | (key[29] << 16) | (key[30] << 8) | key[31], (key[32] << 24) | (key[33] << 16) | (key[34] << 8) | key[35], (key[36] << 24) | (key[37] << 16) | (key[38] << 8) | key[39], (key[40] << 24) | (key[41] << 16) | (key[42] << 8) | key[43], (key[44] << 24) | (key[45] << 16) | (key[46] << 8) | key[47], (key[48] << 24) | (key[49] << 16) | (key[50] << 8) | key[51], (key[52] << 24) | (key[53] << 16) | (key[54] << 8) | key[55], (key[56] << 24) | (key[57] << 16) | (key[58] << 8) | key[59], (key[60] << 24) | (key[61] << 16) | (key[62] << 8) | key[63]);\n        return this;\n    }\n    finish() {\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        const hash = this.hash;\n        const asm = this.hash.asm;\n        const heap = this.hash.heap;\n        asm.hmac_finish(hash.pos, hash.len, 0);\n        const verify = this.verify;\n        const result = new Uint8Array(_sha1_hash_size);\n        result.set(heap.subarray(0, _sha1_hash_size));\n        if (verify) {\n            if (verify.length === result.length) {\n                let diff = 0;\n                for (let i = 0; i < verify.length; i++) {\n                    diff |= verify[i] ^ result[i];\n                }\n                if (diff !== 0)\n                    throw new Error(\"HMAC verification failed, hash value doesn't match\");\n            }\n            else {\n                throw new Error(\"HMAC verification failed, lengths doesn't match\");\n            }\n        }\n        else {\n            this.result = result;\n        }\n        return this;\n    }\n}\n\nclass HmacSha256 extends Hmac {\n    constructor(password, verify) {\n        const hash = new Sha256();\n        // Calculate ipad, init the underlying engine, calculate this.key\n        super(hash, password, verify);\n        this.reset();\n        if (verify !== undefined) {\n            this._hmac_init_verify(verify);\n        }\n        else {\n            this.verify = null;\n        }\n        return this;\n    }\n    reset() {\n        const key = this.key;\n        this.hash\n            .reset()\n            .asm.hmac_init((key[0] << 24) | (key[1] << 16) | (key[2] << 8) | key[3], (key[4] << 24) | (key[5] << 16) | (key[6] << 8) | key[7], (key[8] << 24) | (key[9] << 16) | (key[10] << 8) | key[11], (key[12] << 24) | (key[13] << 16) | (key[14] << 8) | key[15], (key[16] << 24) | (key[17] << 16) | (key[18] << 8) | key[19], (key[20] << 24) | (key[21] << 16) | (key[22] << 8) | key[23], (key[24] << 24) | (key[25] << 16) | (key[26] << 8) | key[27], (key[28] << 24) | (key[29] << 16) | (key[30] << 8) | key[31], (key[32] << 24) | (key[33] << 16) | (key[34] << 8) | key[35], (key[36] << 24) | (key[37] << 16) | (key[38] << 8) | key[39], (key[40] << 24) | (key[41] << 16) | (key[42] << 8) | key[43], (key[44] << 24) | (key[45] << 16) | (key[46] << 8) | key[47], (key[48] << 24) | (key[49] << 16) | (key[50] << 8) | key[51], (key[52] << 24) | (key[53] << 16) | (key[54] << 8) | key[55], (key[56] << 24) | (key[57] << 16) | (key[58] << 8) | key[59], (key[60] << 24) | (key[61] << 16) | (key[62] << 8) | key[63]);\n        return this;\n    }\n    finish() {\n        if (this.key === null)\n            throw new IllegalStateError('no key is associated with the instance');\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        const hash = this.hash;\n        const asm = this.hash.asm;\n        const heap = this.hash.heap;\n        asm.hmac_finish(hash.pos, hash.len, 0);\n        const verify = this.verify;\n        const result = new Uint8Array(_sha256_hash_size);\n        result.set(heap.subarray(0, _sha256_hash_size));\n        if (verify) {\n            if (verify.length === result.length) {\n                let diff = 0;\n                for (let i = 0; i < verify.length; i++) {\n                    diff |= verify[i] ^ result[i];\n                }\n                if (diff !== 0)\n                    throw new Error(\"HMAC verification failed, hash value doesn't match\");\n            }\n            else {\n                throw new Error(\"HMAC verification failed, lengths doesn't match\");\n            }\n        }\n        else {\n            this.result = result;\n        }\n        return this;\n    }\n}\n\nclass HmacSha512 extends Hmac {\n    constructor(password, verify) {\n        const hash = new Sha512();\n        // Calculate ipad, init the underlying engine, calculate this.key\n        super(hash, password, verify);\n        this.reset();\n        if (verify !== undefined) {\n            this._hmac_init_verify(verify);\n        }\n        else {\n            this.verify = null;\n        }\n        return this;\n    }\n    reset() {\n        const key = this.key;\n        this.hash\n            .reset()\n            .asm.hmac_init((key[0] << 24) | (key[1] << 16) | (key[2] << 8) | key[3], (key[4] << 24) | (key[5] << 16) | (key[6] << 8) | key[7], (key[8] << 24) | (key[9] << 16) | (key[10] << 8) | key[11], (key[12] << 24) | (key[13] << 16) | (key[14] << 8) | key[15], (key[16] << 24) | (key[17] << 16) | (key[18] << 8) | key[19], (key[20] << 24) | (key[21] << 16) | (key[22] << 8) | key[23], (key[24] << 24) | (key[25] << 16) | (key[26] << 8) | key[27], (key[28] << 24) | (key[29] << 16) | (key[30] << 8) | key[31], (key[32] << 24) | (key[33] << 16) | (key[34] << 8) | key[35], (key[36] << 24) | (key[37] << 16) | (key[38] << 8) | key[39], (key[40] << 24) | (key[41] << 16) | (key[42] << 8) | key[43], (key[44] << 24) | (key[45] << 16) | (key[46] << 8) | key[47], (key[48] << 24) | (key[49] << 16) | (key[50] << 8) | key[51], (key[52] << 24) | (key[53] << 16) | (key[54] << 8) | key[55], (key[56] << 24) | (key[57] << 16) | (key[58] << 8) | key[59], (key[60] << 24) | (key[61] << 16) | (key[62] << 8) | key[63], (key[64] << 24) | (key[65] << 16) | (key[66] << 8) | key[67], (key[68] << 24) | (key[69] << 16) | (key[70] << 8) | key[71], (key[72] << 24) | (key[73] << 16) | (key[74] << 8) | key[75], (key[76] << 24) | (key[77] << 16) | (key[78] << 8) | key[79], (key[80] << 24) | (key[81] << 16) | (key[82] << 8) | key[83], (key[84] << 24) | (key[85] << 16) | (key[86] << 8) | key[87], (key[88] << 24) | (key[89] << 16) | (key[90] << 8) | key[91], (key[92] << 24) | (key[93] << 16) | (key[94] << 8) | key[95], (key[96] << 24) | (key[97] << 16) | (key[98] << 8) | key[99], (key[100] << 24) | (key[101] << 16) | (key[102] << 8) | key[103], (key[104] << 24) | (key[105] << 16) | (key[106] << 8) | key[107], (key[108] << 24) | (key[109] << 16) | (key[110] << 8) | key[111], (key[112] << 24) | (key[113] << 16) | (key[114] << 8) | key[115], (key[116] << 24) | (key[117] << 16) | (key[118] << 8) | key[119], (key[120] << 24) | (key[121] << 16) | (key[122] << 8) | key[123], (key[124] << 24) | (key[125] << 16) | (key[126] << 8) | key[127]);\n        return this;\n    }\n    finish() {\n        if (this.key === null)\n            throw new IllegalStateError('no key is associated with the instance');\n        if (this.result !== null)\n            throw new IllegalStateError('state must be reset before processing new data');\n        const hash = this.hash;\n        const asm = this.hash.asm;\n        const heap = this.hash.heap;\n        asm.hmac_finish(hash.pos, hash.len, 0);\n        const verify = this.verify;\n        const result = new Uint8Array(_sha512_hash_size);\n        result.set(heap.subarray(0, _sha512_hash_size));\n        if (verify) {\n            if (verify.length === result.length) {\n                let diff = 0;\n                for (let i = 0; i < verify.length; i++) {\n                    diff |= verify[i] ^ result[i];\n                }\n                if (diff !== 0)\n                    throw new Error(\"HMAC verification failed, hash value doesn't match\");\n            }\n            else {\n                throw new Error(\"HMAC verification failed, lengths doesn't match\");\n            }\n        }\n        else {\n            this.result = result;\n        }\n        return this;\n    }\n}\n\nfunction Pbkdf2HmacSha1(password, salt, count, length) {\n    const hmac = new HmacSha1(password);\n    const result = new Uint8Array(length);\n    const blocks = Math.ceil(length / hmac.HMAC_SIZE);\n    for (let i = 1; i <= blocks; ++i) {\n        const j = (i - 1) * hmac.HMAC_SIZE;\n        const l = (i < blocks ? 0 : length % hmac.HMAC_SIZE) || hmac.HMAC_SIZE;\n        hmac.reset().process(salt);\n        hmac.hash.asm.pbkdf2_generate_block(hmac.hash.pos, hmac.hash.len, i, count, 0);\n        result.set(hmac.hash.heap.subarray(0, l), j);\n    }\n    return result;\n}\n\nfunction Pbkdf2HmacSha256(password, salt, count, length) {\n    const hmac = new HmacSha256(password);\n    const result = new Uint8Array(length);\n    const blocks = Math.ceil(length / hmac.HMAC_SIZE);\n    for (let i = 1; i <= blocks; ++i) {\n        const j = (i - 1) * hmac.HMAC_SIZE;\n        const l = (i < blocks ? 0 : length % hmac.HMAC_SIZE) || hmac.HMAC_SIZE;\n        hmac.reset().process(salt);\n        hmac.hash.asm.pbkdf2_generate_block(hmac.hash.pos, hmac.hash.len, i, count, 0);\n        result.set(hmac.hash.heap.subarray(0, l), j);\n    }\n    return result;\n}\n\nfunction Pbkdf2HmacSha512(password, salt, count, length) {\n    const hmac = new HmacSha512(password);\n    const result = new Uint8Array(length);\n    const blocks = Math.ceil(length / hmac.HMAC_SIZE);\n    for (let i = 1; i <= blocks; ++i) {\n        const j = (i - 1) * hmac.HMAC_SIZE;\n        const l = (i < blocks ? 0 : length % hmac.HMAC_SIZE) || hmac.HMAC_SIZE;\n        hmac.reset().process(salt);\n        hmac.hash.asm.pbkdf2_generate_block(hmac.hash.pos, hmac.hash.len, i, count, 0);\n        result.set(hmac.hash.heap.subarray(0, l), j);\n    }\n    return result;\n}\n\nclass RSA {\n    constructor(key) {\n        const l = key.length;\n        if (l !== 2 && l !== 3 && l !== 8)\n            throw new SyntaxError('unexpected key type');\n        const k0 = new Modulus(new BigNumber(key[0]));\n        const k1 = new BigNumber(key[1]);\n        this.key = {\n            0: k0,\n            1: k1,\n        };\n        if (l > 2) {\n            this.key[2] = new BigNumber(key[2]);\n        }\n        if (l > 3) {\n            this.key[3] = new Modulus(new BigNumber(key[3]));\n            this.key[4] = new Modulus(new BigNumber(key[4]));\n            this.key[5] = new BigNumber(key[5]);\n            this.key[6] = new BigNumber(key[6]);\n            this.key[7] = new BigNumber(key[7]);\n        }\n    }\n    encrypt(msg) {\n        if (!this.key)\n            throw new IllegalStateError('no key is associated with the instance');\n        if (this.key[0].compare(msg) <= 0)\n            throw new RangeError('data too large');\n        const m = this.key[0];\n        const e = this.key[1];\n        let result = m.power(msg, e).toBytes();\n        const bytelen = (m.bitLength + 7) >> 3;\n        if (result.length < bytelen) {\n            const r = new Uint8Array(bytelen);\n            r.set(result, bytelen - result.length);\n            result = r;\n        }\n        this.result = result;\n        return this;\n    }\n    decrypt(msg) {\n        if (this.key[0].compare(msg) <= 0)\n            throw new RangeError('data too large');\n        let result;\n        let m;\n        if (this.key[3] !== undefined) {\n            m = this.key[0];\n            const p = this.key[3];\n            const q = this.key[4];\n            const dp = this.key[5];\n            const dq = this.key[6];\n            const u = this.key[7];\n            const x = p.power(msg, dp);\n            const y = q.power(msg, dq);\n            let t = x.subtract(y);\n            while (t.sign < 0)\n                t = t.add(p);\n            const h = p.reduce(u.multiply(t));\n            result = h\n                .multiply(q)\n                .add(y)\n                .clamp(m.bitLength)\n                .toBytes();\n        }\n        else {\n            m = this.key[0];\n            const d = this.key[2];\n            result = m.power(msg, d).toBytes();\n        }\n        const bytelen = (m.bitLength + 7) >> 3;\n        if (result.length < bytelen) {\n            let r = new Uint8Array(bytelen);\n            r.set(result, bytelen - result.length);\n            result = r;\n        }\n        this.result = result;\n        return this;\n    }\n}\n\nclass RSA_OAEP {\n    constructor(key, hash, label) {\n        this.rsa = new RSA(key);\n        this.hash = hash;\n        if (label !== undefined) {\n            this.label = label.length > 0 ? label : null;\n        }\n        else {\n            this.label = null;\n        }\n    }\n    encrypt(data, random) {\n        const key_size = Math.ceil(this.rsa.key[0].bitLength / 8);\n        const hash_size = this.hash.HASH_SIZE;\n        const data_length = data.byteLength || data.length || 0;\n        const ps_length = key_size - data_length - 2 * hash_size - 2;\n        if (data_length > key_size - 2 * this.hash.HASH_SIZE - 2)\n            throw new IllegalArgumentError('data too large');\n        const message = new Uint8Array(key_size);\n        const seed = message.subarray(1, hash_size + 1);\n        const data_block = message.subarray(hash_size + 1);\n        data_block.set(data, hash_size + ps_length + 1);\n        data_block.set(this.hash.process(this.label || new Uint8Array(0)).finish().result, 0);\n        data_block[hash_size + ps_length] = 1;\n        if (random !== undefined) {\n            if (seed.length !== random.length)\n                throw new IllegalArgumentError('random size must equal the hash size');\n            seed.set(random);\n        }\n        else {\n            getRandomValues(seed);\n        }\n        const data_block_mask = this.RSA_MGF1_generate(seed, data_block.length);\n        for (let i = 0; i < data_block.length; i++)\n            data_block[i] ^= data_block_mask[i];\n        const seed_mask = this.RSA_MGF1_generate(data_block, seed.length);\n        for (let i = 0; i < seed.length; i++)\n            seed[i] ^= seed_mask[i];\n        this.rsa.encrypt(new BigNumber(message));\n        return new Uint8Array(this.rsa.result);\n    }\n    decrypt(data) {\n        if (!this.rsa.key)\n            throw new IllegalStateError('no key is associated with the instance');\n        const key_size = Math.ceil(this.rsa.key[0].bitLength / 8);\n        const hash_size = this.hash.HASH_SIZE;\n        const data_length = data.byteLength || data.length || 0;\n        if (data_length !== key_size)\n            throw new IllegalArgumentError('bad data');\n        this.rsa.decrypt(new BigNumber(data));\n        const z = this.rsa.result[0];\n        const seed = this.rsa.result.subarray(1, hash_size + 1);\n        const data_block = this.rsa.result.subarray(hash_size + 1);\n        if (z !== 0)\n            throw new SecurityError('decryption failed');\n        const seed_mask = this.RSA_MGF1_generate(data_block, seed.length);\n        for (let i = 0; i < seed.length; i++)\n            seed[i] ^= seed_mask[i];\n        const data_block_mask = this.RSA_MGF1_generate(seed, data_block.length);\n        for (let i = 0; i < data_block.length; i++)\n            data_block[i] ^= data_block_mask[i];\n        const lhash = this.hash\n            .reset()\n            .process(this.label || new Uint8Array(0))\n            .finish().result;\n        for (let i = 0; i < hash_size; i++) {\n            if (lhash[i] !== data_block[i])\n                throw new SecurityError('decryption failed');\n        }\n        let ps_end = hash_size;\n        for (; ps_end < data_block.length; ps_end++) {\n            const psz = data_block[ps_end];\n            if (psz === 1)\n                break;\n            if (psz !== 0)\n                throw new SecurityError('decryption failed');\n        }\n        if (ps_end === data_block.length)\n            throw new SecurityError('decryption failed');\n        this.rsa.result = data_block.subarray(ps_end + 1);\n        return new Uint8Array(this.rsa.result);\n    }\n    RSA_MGF1_generate(seed, length = 0) {\n        const hash_size = this.hash.HASH_SIZE;\n        //    if ( length > (hash_size * 0x100000000) )\n        //        throw new IllegalArgumentError(\"mask length too large\");\n        const mask = new Uint8Array(length);\n        const counter = new Uint8Array(4);\n        const chunks = Math.ceil(length / hash_size);\n        for (let i = 0; i < chunks; i++) {\n            (counter[0] = i >>> 24), (counter[1] = (i >>> 16) & 255), (counter[2] = (i >>> 8) & 255), (counter[3] = i & 255);\n            const submask = mask.subarray(i * hash_size);\n            let chunk = this.hash\n                .reset()\n                .process(seed)\n                .process(counter)\n                .finish().result;\n            if (chunk.length > submask.length)\n                chunk = chunk.subarray(0, submask.length);\n            submask.set(chunk);\n        }\n        return mask;\n    }\n}\nclass RSA_PSS {\n    constructor(key, hash, saltLength = 4) {\n        this.rsa = new RSA(key);\n        this.hash = hash;\n        this.saltLength = saltLength;\n        if (this.saltLength < 0)\n            throw new TypeError('saltLength should be a non-negative number');\n        if (this.rsa.key !== null &&\n            Math.ceil((this.rsa.key[0].bitLength - 1) / 8) < this.hash.HASH_SIZE + this.saltLength + 2)\n            throw new SyntaxError('saltLength is too large');\n    }\n    sign(data, random) {\n        const key_bits = this.rsa.key[0].bitLength;\n        const hash_size = this.hash.HASH_SIZE;\n        const message_length = Math.ceil((key_bits - 1) / 8);\n        const salt_length = this.saltLength;\n        const ps_length = message_length - salt_length - hash_size - 2;\n        const message = new Uint8Array(message_length);\n        const h_block = message.subarray(message_length - hash_size - 1, message_length - 1);\n        const d_block = message.subarray(0, message_length - hash_size - 1);\n        const d_salt = d_block.subarray(ps_length + 1);\n        const m_block = new Uint8Array(8 + hash_size + salt_length);\n        const m_hash = m_block.subarray(8, 8 + hash_size);\n        const m_salt = m_block.subarray(8 + hash_size);\n        m_hash.set(this.hash.process(data).finish().result);\n        if (salt_length > 0) {\n            if (random !== undefined) {\n                if (m_salt.length !== random.length)\n                    throw new IllegalArgumentError('random size must equal the salt size');\n                m_salt.set(random);\n            }\n            else {\n                getRandomValues(m_salt);\n            }\n        }\n        d_block[ps_length] = 1;\n        d_salt.set(m_salt);\n        h_block.set(this.hash\n            .reset()\n            .process(m_block)\n            .finish().result);\n        const d_block_mask = this.RSA_MGF1_generate(h_block, d_block.length);\n        for (let i = 0; i < d_block.length; i++)\n            d_block[i] ^= d_block_mask[i];\n        message[message_length - 1] = 0xbc;\n        const zbits = 8 * message_length - key_bits + 1;\n        if (zbits % 8)\n            message[0] &= 0xff >>> zbits;\n        this.rsa.decrypt(new BigNumber(message));\n        return this.rsa.result;\n    }\n    verify(signature, data) {\n        const key_bits = this.rsa.key[0].bitLength;\n        const hash_size = this.hash.HASH_SIZE;\n        const message_length = Math.ceil((key_bits - 1) / 8);\n        const salt_length = this.saltLength;\n        const ps_length = message_length - salt_length - hash_size - 2;\n        this.rsa.encrypt(new BigNumber(signature));\n        const message = this.rsa.result;\n        if (message[message_length - 1] !== 0xbc)\n            throw new SecurityError('bad signature');\n        const h_block = message.subarray(message_length - hash_size - 1, message_length - 1);\n        const d_block = message.subarray(0, message_length - hash_size - 1);\n        const d_salt = d_block.subarray(ps_length + 1);\n        const zbits = 8 * message_length - key_bits + 1;\n        if (zbits % 8 && message[0] >>> (8 - zbits))\n            throw new SecurityError('bad signature');\n        const d_block_mask = this.RSA_MGF1_generate(h_block, d_block.length);\n        for (let i = 0; i < d_block.length; i++)\n            d_block[i] ^= d_block_mask[i];\n        if (zbits % 8)\n            message[0] &= 0xff >>> zbits;\n        for (let i = 0; i < ps_length; i++) {\n            if (d_block[i] !== 0)\n                throw new SecurityError('bad signature');\n        }\n        if (d_block[ps_length] !== 1)\n            throw new SecurityError('bad signature');\n        const m_block = new Uint8Array(8 + hash_size + salt_length);\n        const m_hash = m_block.subarray(8, 8 + hash_size);\n        const m_salt = m_block.subarray(8 + hash_size);\n        m_hash.set(this.hash\n            .reset()\n            .process(data)\n            .finish().result);\n        m_salt.set(d_salt);\n        const h_block_verify = this.hash\n            .reset()\n            .process(m_block)\n            .finish().result;\n        for (let i = 0; i < hash_size; i++) {\n            if (h_block[i] !== h_block_verify[i])\n                throw new SecurityError('bad signature');\n        }\n    }\n    RSA_MGF1_generate(seed, length = 0) {\n        const hash_size = this.hash.HASH_SIZE;\n        //    if ( length > (hash_size * 0x100000000) )\n        //        throw new IllegalArgumentError(\"mask length too large\");\n        const mask = new Uint8Array(length);\n        const counter = new Uint8Array(4);\n        const chunks = Math.ceil(length / hash_size);\n        for (let i = 0; i < chunks; i++) {\n            (counter[0] = i >>> 24), (counter[1] = (i >>> 16) & 255), (counter[2] = (i >>> 8) & 255), (counter[3] = i & 255);\n            const submask = mask.subarray(i * hash_size);\n            let chunk = this.hash\n                .reset()\n                .process(seed)\n                .process(counter)\n                .finish().result;\n            if (chunk.length > submask.length)\n                chunk = chunk.subarray(0, submask.length);\n            submask.set(chunk);\n        }\n        return mask;\n    }\n}\nclass RSA_PKCS1_v1_5 {\n    constructor(key, hash) {\n        this.rsa = new RSA(key);\n        this.hash = hash;\n    }\n    sign(data) {\n        if (!this.rsa.key) {\n            throw new IllegalStateError('no key is associated with the instance');\n        }\n        const prefix = getHashPrefix(this.hash);\n        const hash_size = this.hash.HASH_SIZE;\n        const t_len = prefix.length + hash_size;\n        const k = (this.rsa.key[0].bitLength + 7) >> 3;\n        if (k < t_len + 11) {\n            throw new Error('Message too long');\n        }\n        const m_hash = new Uint8Array(hash_size);\n        m_hash.set(this.hash.process(data).finish().result);\n        // EM = 0x00 || 0x01 || PS || 0x00 || T\n        const em = new Uint8Array(k);\n        let i = 0;\n        em[i++] = 0; // 0x00\n        em[i++] = 1; // 0x01\n        // PS\n        for (i; i < k - t_len - 1; i++) {\n            em[i] = 0xff;\n        }\n        em[i++] = 0;\n        em.set(prefix, i); // 0x00\n        // T\n        em.set(m_hash, em.length - hash_size);\n        this.rsa.decrypt(new BigNumber(em));\n        return this.rsa.result;\n    }\n    verify(signature, data) {\n        const prefix = getHashPrefix(this.hash);\n        const hash_size = this.hash.HASH_SIZE;\n        const t_len = prefix.length + hash_size;\n        const k = (this.rsa.key[0].bitLength + 7) >> 3;\n        if (k < t_len + 11) {\n            throw new SecurityError('Bad signature');\n        }\n        this.rsa.encrypt(new BigNumber(signature));\n        const m_hash = new Uint8Array(hash_size);\n        m_hash.set(this.hash.process(data).finish().result);\n        let res = 1;\n        // EM = 0x00 || 0x01 || PS || 0x00 || T\n        const decryptedSignature = this.rsa.result;\n        let i = 0;\n        res &= decryptedSignature[i++] === 0 ? 1 : 0; // 0x00\n        res &= decryptedSignature[i++] === 1 ? 1 : 0; // 0x01\n        // PS\n        for (i; i < k - t_len - 1; i++) {\n            res &= decryptedSignature[i] === 0xff ? 1 : 0;\n        }\n        res &= decryptedSignature[i++] === 0 ? 1 : 0; // 0x00\n        // T\n        let j = 0;\n        let n = i + prefix.length;\n        // prefix\n        for (i; i < n; i++) {\n            res &= decryptedSignature[i] === prefix[j++] ? 1 : 0;\n        }\n        j = 0;\n        n = i + m_hash.length;\n        // hash\n        for (i; i < n; i++) {\n            res &= decryptedSignature[i] === m_hash[j++] ? 1 : 0;\n        }\n        if (!res) {\n            throw new SecurityError('Bad signature');\n        }\n    }\n}\nconst HASH_PREFIXES = {\n    sha1: new Uint8Array([0x30, 0x21, 0x30, 0x09, 0x06, 0x05, 0x2b, 0x0e, 0x03, 0x02, 0x1a, 0x05, 0x00, 0x04, 0x14]),\n    sha256: new Uint8Array([\n        0x30,\n        0x31,\n        0x30,\n        0x0d,\n        0x06,\n        0x09,\n        0x60,\n        0x86,\n        0x48,\n        0x01,\n        0x65,\n        0x03,\n        0x04,\n        0x02,\n        0x01,\n        0x05,\n        0x00,\n        0x04,\n        0x20,\n    ]),\n    sha384: new Uint8Array([\n        0x30,\n        0x41,\n        0x30,\n        0x0d,\n        0x06,\n        0x09,\n        0x60,\n        0x86,\n        0x48,\n        0x01,\n        0x65,\n        0x03,\n        0x04,\n        0x02,\n        0x02,\n        0x05,\n        0x00,\n        0x04,\n        0x30,\n    ]),\n    sha512: new Uint8Array([\n        0x30,\n        0x51,\n        0x30,\n        0x0d,\n        0x06,\n        0x09,\n        0x60,\n        0x86,\n        0x48,\n        0x01,\n        0x65,\n        0x03,\n        0x04,\n        0x02,\n        0x03,\n        0x05,\n        0x00,\n        0x04,\n        0x40,\n    ]),\n};\nfunction getHashPrefix(hash) {\n    const prefix = HASH_PREFIXES[hash.NAME];\n    if (!prefix) {\n        throw new Error(\"Cannot get hash prefix for hash algorithm '\" + hash.NAME + \"'\");\n    }\n    return prefix;\n}\n\nexport { string_to_bytes, hex_to_bytes, base64_to_bytes, bytes_to_string, bytes_to_hex, bytes_to_base64, IllegalStateError, IllegalArgumentError, SecurityError, AES_CBC, AES_CCM, AES_CFB, AES_CMAC, AES_CTR, AES_ECB, AES_GCM, AES_OFB, BigNumber, Modulus, Sha1, Sha256, Sha512, HmacSha1, HmacSha256, HmacSha512, Pbkdf2HmacSha1, Pbkdf2HmacSha256, Pbkdf2HmacSha512, RSA_OAEP, RSA_PKCS1_v1_5, RSA_PSS, RSA };\n","// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nvar getRandomValues;\nvar rnds8 = new Uint8Array(16);\nexport default function rng() {\n  // lazy load so that environments that need to polyfill have a chance to do so\n  if (!getRandomValues) {\n    // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation. Also,\n    // find the complete implementation of crypto (msCrypto) on IE11.\n    getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto) || typeof msCrypto !== 'undefined' && typeof msCrypto.getRandomValues === 'function' && msCrypto.getRandomValues.bind(msCrypto);\n\n    if (!getRandomValues) {\n      throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n    }\n  }\n\n  return getRandomValues(rnds8);\n}","export default /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i;","import REGEX from './regex.js';\n\nfunction validate(uuid) {\n  return typeof uuid === 'string' && REGEX.test(uuid);\n}\n\nexport default validate;","import validate from './validate.js';\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nvar byteToHex = [];\n\nfor (var i = 0; i < 256; ++i) {\n  byteToHex.push((i + 0x100).toString(16).substr(1));\n}\n\nfunction stringify(arr) {\n  var offset = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  // Note: Be careful editing this code!  It's been tuned for performance\n  // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n  var uuid = (byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]]).toLowerCase(); // Consistency check for valid UUID.  If this throws, it's likely due to one\n  // of the following:\n  // - One or more input array values don't map to a hex octet (leading to\n  // \"undefined\" in the uuid)\n  // - Invalid input values for the RFC `version` or `variant` fields\n\n  if (!validate(uuid)) {\n    throw TypeError('Stringified UUID is invalid');\n  }\n\n  return uuid;\n}\n\nexport default stringify;","import rng from './rng.js';\nimport stringify from './stringify.js';\n\nfunction v4(options, buf, offset) {\n  options = options || {};\n  var rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n  rnds[6] = rnds[6] & 0x0f | 0x40;\n  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n  if (buf) {\n    offset = offset || 0;\n\n    for (var i = 0; i < 16; ++i) {\n      buf[offset + i] = rnds[i];\n    }\n\n    return buf;\n  }\n\n  return stringify(rnds);\n}\n\nexport default v4;","// https://github.com/maxogden/websocket-stream/blob/48dc3ddf943e5ada668c31ccd94e9186f02fafbd/ws-fallback.js\n\nvar ws = null\n\nif (typeof WebSocket !== 'undefined') {\n  ws = WebSocket\n} else if (typeof MozWebSocket !== 'undefined') {\n  ws = MozWebSocket\n} else if (typeof global !== 'undefined') {\n  ws = global.WebSocket || global.MozWebSocket\n} else if (typeof window !== 'undefined') {\n  ws = window.WebSocket || window.MozWebSocket\n} else if (typeof self !== 'undefined') {\n  ws = self.WebSocket || self.MozWebSocket\n}\n\nmodule.exports = ws\n","/**\n * Anchor Link v3.3.0\n * https://github.com/greymass/anchor-link\n *\n * @license\n * Copyright (c) 2020 Greymass Inc. All Rights Reserved.\n * \n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n * \n *  1. Redistribution of source code must retain the above copyright notice, this\n *     list of conditions and the following disclaimer.\n * \n *  2. Redistribution in binary form must reproduce the above copyright notice,\n *     this list of conditions and the following disclaimer in the documentation\n *     and/or other materials provided with the distribution.\n * \n *  3. Neither the name of the copyright holder nor the names of its contributors\n *     may be used to endorse or promote products derived from this software without\n *     specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n * YOU ACKNOWLEDGE THAT THIS SOFTWARE IS NOT DESIGNED, LICENSED OR INTENDED FOR USE\n * IN THE DESIGN, CONSTRUCTION, OPERATION OR MAINTENANCE OF ANY MILITARY FACILITY.\n */\nimport zlib from 'pako';\nimport { Struct, UInt64, Checksum512, Serializer, Bytes, Checksum256, PermissionLevel, PublicKey, Name, PrivateKey, APIClient, Signature, SignedTransaction } from '@greymass/eosio';\nexport * from '@greymass/eosio';\nimport { ChainId, SigningRequest, ResolvedSigningRequest, PlaceholderName, PlaceholderPermission } from 'eosio-signing-request';\nexport * from 'eosio-signing-request';\nexport { ChainId, ChainName, IdentityProof } from 'eosio-signing-request';\nimport { __decorate } from 'tslib';\nimport makeFetch from 'fetch-ponyfill';\nimport { AES_CBC } from 'asmcrypto.js';\nimport { v4 } from 'uuid';\nimport WebSocket from 'isomorphic-ws';\n\n/**\n * Error that is thrown if a [[LinkTransport]] cancels a request.\n * @internal\n */\nclass CancelError extends Error {\n    constructor(reason) {\n        super(`User canceled request ${reason ? '(' + reason + ')' : ''}`);\n        this.code = 'E_CANCEL';\n    }\n}\n/**\n * Error that is thrown if an identity request fails to verify.\n * @internal\n */\nclass IdentityError extends Error {\n    constructor(reason) {\n        super(`Unable to verify identity ${reason ? '(' + reason + ')' : ''}`);\n        this.code = 'E_IDENTITY';\n    }\n}\n/**\n * Error originating from a [[LinkSession]].\n * @internal\n */\nclass SessionError extends Error {\n    constructor(reason, code, session) {\n        super(reason);\n        this.code = code;\n        this.session = session;\n    }\n}\n\n/** @internal */\nvar LinkOptions;\n(function (LinkOptions) {\n    /** @internal */\n    LinkOptions.defaults = {\n        service: 'https://cb.anchor.link',\n        verifyProofs: false,\n        encodeChainIds: true,\n    };\n})(LinkOptions || (LinkOptions = {}));\n\nlet SealedMessage = class SealedMessage extends Struct {\n};\n__decorate([\n    Struct.field('public_key')\n], SealedMessage.prototype, \"from\", void 0);\n__decorate([\n    Struct.field('uint64')\n], SealedMessage.prototype, \"nonce\", void 0);\n__decorate([\n    Struct.field('bytes')\n], SealedMessage.prototype, \"ciphertext\", void 0);\n__decorate([\n    Struct.field('uint32')\n], SealedMessage.prototype, \"checksum\", void 0);\nSealedMessage = __decorate([\n    Struct.type('sealed_message')\n], SealedMessage);\nlet LinkCreate = class LinkCreate extends Struct {\n};\n__decorate([\n    Struct.field('name')\n], LinkCreate.prototype, \"session_name\", void 0);\n__decorate([\n    Struct.field('public_key')\n], LinkCreate.prototype, \"request_key\", void 0);\n__decorate([\n    Struct.field('string', { extension: true })\n], LinkCreate.prototype, \"user_agent\", void 0);\nLinkCreate = __decorate([\n    Struct.type('link_create')\n], LinkCreate);\nlet LinkInfo = class LinkInfo extends Struct {\n};\n__decorate([\n    Struct.field('time_point_sec')\n], LinkInfo.prototype, \"expiration\", void 0);\nLinkInfo = __decorate([\n    Struct.type('link_info')\n], LinkInfo);\n\n/** @internal */\nconst fetch = makeFetch().fetch;\n/**\n * Encrypt a message using AES and shared secret derived from given keys.\n * @internal\n */\nfunction sealMessage(message, privateKey, publicKey, nonce) {\n    const secret = privateKey.sharedSecret(publicKey);\n    if (!nonce) {\n        nonce = UInt64.random();\n    }\n    const key = Checksum512.hash(Serializer.encode({ object: nonce }).appending(secret.array));\n    const cbc = new AES_CBC(key.array.slice(0, 32), key.array.slice(32, 48));\n    const ciphertext = Bytes.from(cbc.encrypt(Bytes.from(message, 'utf8').array));\n    const checksumView = new DataView(Checksum256.hash(key.array).array.buffer);\n    const checksum = checksumView.getUint32(0, true);\n    return SealedMessage.from({\n        from: privateKey.toPublic(),\n        nonce,\n        ciphertext,\n        checksum,\n    });\n}\n/**\n * Extract session metadata from a callback payload and request.\n * @internal\n */\nfunction sessionMetadata(payload, request) {\n    const metadata = {\n        // backwards compat, can be removed next major release\n        sameDevice: request.getRawInfo()['return_path'] !== undefined,\n    };\n    // append extra metadata from the signer\n    if (payload.link_meta) {\n        try {\n            const parsed = JSON.parse(payload.link_meta);\n            for (const key of Object.keys(parsed)) {\n                // normalize key names to camelCase\n                metadata[snakeToCamel(key)] = parsed[key];\n            }\n        }\n        catch (error) {\n            // eslint-disable-next-line no-console\n            console.warn('Unable to parse link metadata', error, payload.link_meta);\n        }\n    }\n    return metadata;\n}\n/**\n * Return PascalCase version of snake_case string.\n * @internal\n */\nfunction snakeToPascal(name) {\n    return name\n        .split('_')\n        .map((v) => (v[0] ? v[0].toUpperCase() : '_') + v.slice(1))\n        .join('');\n}\n/**\n * Return camelCase version of snake_case string.\n * @internal\n */\nfunction snakeToCamel(name) {\n    const pascal = snakeToPascal(name);\n    return pascal[0].toLowerCase() + pascal.slice(1);\n}\n\n/**\n * Type describing a link session that can create a eosjs compatible\n * signature provider and transact for a specific auth.\n */\nclass LinkSession {\n    /** @internal */\n    constructor() { } // eslint-disable-line @typescript-eslint/no-empty-function\n    /**\n     * Convenience, remove this session from associated [[Link]] storage if set.\n     * Equivalent to:\n     * ```ts\n     * session.link.removeSession(session.identifier, session.auth, session.chainId)\n     * ```\n     */\n    async remove() {\n        if (this.link.storage) {\n            await this.link.removeSession(this.identifier, this.auth, this.chainId);\n        }\n    }\n    /** API client for the chain this session is valid on. */\n    get client() {\n        return this.link.getChain(this.chainId).client;\n    }\n    /** Restore a previously serialized session. */\n    static restore(link, data) {\n        switch (data.type) {\n            case 'channel':\n                return new LinkChannelSession(link, data.data, data.metadata);\n            case 'fallback':\n                return new LinkFallbackSession(link, data.data, data.metadata);\n            default:\n                throw new Error('Unable to restore, session data invalid');\n        }\n    }\n}\n/**\n * Link session that pushes requests over a channel.\n * @internal\n */\nclass LinkChannelSession extends LinkSession {\n    constructor(link, data, metadata) {\n        super();\n        this.type = 'channel';\n        this.timeout = 2 * 60 * 1000; // ms\n        this.link = link;\n        this.chainId = ChainId.from(data.chainId);\n        this.auth = PermissionLevel.from(data.auth);\n        this.publicKey = PublicKey.from(data.publicKey);\n        this.identifier = Name.from(data.identifier);\n        const privateKey = PrivateKey.from(data.requestKey);\n        this.channelKey = PublicKey.from(data.channel.key);\n        this.channelUrl = data.channel.url;\n        this.channelName = data.channel.name;\n        this.encrypt = (request) => {\n            return sealMessage(request.encode(true, false), privateKey, this.channelKey);\n        };\n        this.metadata = {\n            ...(metadata || {}),\n            timeout: this.timeout,\n            name: this.channelName,\n            request_key: privateKey.toPublic(),\n        };\n        this.serialize = () => ({\n            type: 'channel',\n            data: {\n                ...data,\n                channel: {\n                    url: this.channelUrl,\n                    key: this.channelKey,\n                    name: this.channelName,\n                },\n            },\n            metadata: this.metadata,\n        });\n    }\n    onSuccess(request, result) {\n        if (this.link.transport.onSuccess) {\n            this.link.transport.onSuccess(request, result);\n        }\n    }\n    onFailure(request, error) {\n        if (this.link.transport.onFailure) {\n            this.link.transport.onFailure(request, error);\n        }\n    }\n    onRequest(request, cancel) {\n        const info = LinkInfo.from({\n            expiration: new Date(Date.now() + this.timeout),\n        });\n        if (this.link.transport.onSessionRequest) {\n            this.link.transport.onSessionRequest(this, request, cancel);\n        }\n        const timer = setTimeout(() => {\n            cancel(new SessionError('Wallet did not respond in time', 'E_TIMEOUT', this));\n        }, this.timeout);\n        request.setInfoKey('link', info);\n        let payloadSent = false;\n        const payload = Serializer.encode({ object: this.encrypt(request) });\n        if (this.link.transport.sendSessionPayload) {\n            try {\n                payloadSent = this.link.transport.sendSessionPayload(payload, this);\n            }\n            catch (error) {\n                // eslint-disable-next-line no-console\n                console.warn('Unexpected error when transport tried to send session payload', error);\n            }\n        }\n        if (payloadSent) {\n            return;\n        }\n        fetch(this.channelUrl, {\n            method: 'POST',\n            body: payload.array,\n        })\n            .then((response) => {\n            if (response.status !== 200) {\n                clearTimeout(timer);\n                cancel(new SessionError('Unable to push message', 'E_DELIVERY', this));\n            }\n        })\n            .catch((error) => {\n            clearTimeout(timer);\n            cancel(new SessionError(`Unable to reach link service (${error.message || String(error)})`, 'E_DELIVERY', this));\n        });\n    }\n    addLinkInfo(request) {\n        const createInfo = LinkCreate.from({\n            session_name: this.identifier,\n            request_key: this.metadata.request_key,\n            user_agent: this.link.getUserAgent(),\n        });\n        request.setInfoKey('link', createInfo);\n    }\n    prepare(request) {\n        if (this.link.transport.prepare) {\n            return this.link.transport.prepare(request, this);\n        }\n        return Promise.resolve(request);\n    }\n    showLoading() {\n        if (this.link.transport.showLoading) {\n            return this.link.transport.showLoading();\n        }\n    }\n    recoverError(error, request) {\n        if (this.link.transport.recoverError) {\n            return this.link.transport.recoverError(error, request);\n        }\n        return false;\n    }\n    makeSignatureProvider() {\n        return this.link.makeSignatureProvider([this.publicKey.toString()], this.chainId, this);\n    }\n    async transact(args, options) {\n        const res = await this.link.transact(args, { ...options, chain: this.chainId }, this);\n        // update session if callback payload contains new channel info\n        if (res.payload.link_ch && res.payload.link_key && res.payload.link_name) {\n            try {\n                const metadata = {\n                    ...this.metadata,\n                    ...sessionMetadata(res.payload, res.resolved.request),\n                };\n                this.channelUrl = res.payload.link_ch;\n                this.channelKey = PublicKey.from(res.payload.link_key);\n                this.channelName = res.payload.link_name;\n                metadata.name = res.payload.link_name;\n                this.metadata = metadata;\n            }\n            catch (error) {\n                // eslint-disable-next-line no-console\n                console.warn('Unable to recover link session', error);\n            }\n        }\n        return res;\n    }\n}\n/**\n * Link session that sends every request over the transport.\n * @internal\n */\nclass LinkFallbackSession extends LinkSession {\n    constructor(link, data, metadata) {\n        super();\n        this.type = 'fallback';\n        this.link = link;\n        this.auth = PermissionLevel.from(data.auth);\n        this.publicKey = PublicKey.from(data.publicKey);\n        this.chainId = ChainId.from(data.chainId);\n        this.metadata = metadata || {};\n        this.identifier = Name.from(data.identifier);\n        this.serialize = () => ({\n            type: this.type,\n            data,\n            metadata: this.metadata,\n        });\n    }\n    onSuccess(request, result) {\n        if (this.link.transport.onSuccess) {\n            this.link.transport.onSuccess(request, result);\n        }\n    }\n    onFailure(request, error) {\n        if (this.link.transport.onFailure) {\n            this.link.transport.onFailure(request, error);\n        }\n    }\n    onRequest(request, cancel) {\n        if (this.link.transport.onSessionRequest) {\n            this.link.transport.onSessionRequest(this, request, cancel);\n        }\n        else {\n            this.link.transport.onRequest(request, cancel);\n        }\n    }\n    prepare(request) {\n        if (this.link.transport.prepare) {\n            return this.link.transport.prepare(request, this);\n        }\n        return Promise.resolve(request);\n    }\n    showLoading() {\n        if (this.link.transport.showLoading) {\n            return this.link.transport.showLoading();\n        }\n    }\n    makeSignatureProvider() {\n        return this.link.makeSignatureProvider([this.publicKey.toString()], this.chainId, this);\n    }\n    transact(args, options) {\n        return this.link.transact(args, { ...options, chain: this.chainId }, this);\n    }\n}\n\n/** @internal */\nclass BuoyCallbackService {\n    constructor(address) {\n        this.address = address.trim().replace(/\\/$/, '');\n    }\n    create() {\n        const url = `${this.address}/${v4()}`;\n        return new BuoyCallback(url);\n    }\n}\n/** @internal */\nclass BuoyCallback {\n    constructor(url) {\n        this.url = url;\n        this.ctx = {};\n    }\n    wait() {\n        if (this.url.includes('hyperbuoy')) {\n            return pollForCallback(this.url, this.ctx);\n        }\n        else {\n            return waitForCallback(this.url, this.ctx);\n        }\n    }\n    cancel() {\n        if (this.ctx.cancel) {\n            this.ctx.cancel();\n        }\n    }\n}\n/**\n * Connect to a WebSocket channel and wait for a message.\n * @internal\n */\nfunction waitForCallback(url, ctx) {\n    return new Promise((resolve, reject) => {\n        let active = true;\n        let retries = 0;\n        const socketUrl = url.replace(/^http/, 'ws');\n        const handleResponse = (response) => {\n            try {\n                resolve(JSON.parse(response));\n            }\n            catch (error) {\n                error.message = 'Unable to parse callback JSON: ' + error.message;\n                reject(error);\n            }\n        };\n        const connect = () => {\n            const socket = new WebSocket(socketUrl);\n            ctx.cancel = () => {\n                active = false;\n                if (socket.readyState === WebSocket.OPEN ||\n                    socket.readyState === WebSocket.CONNECTING) {\n                    socket.close();\n                }\n            };\n            socket.onmessage = (event) => {\n                active = false;\n                if (socket.readyState === WebSocket.OPEN) {\n                    socket.close();\n                }\n                if (typeof Blob !== 'undefined' && event.data instanceof Blob) {\n                    const reader = new FileReader();\n                    reader.onload = () => {\n                        handleResponse(reader.result);\n                    };\n                    reader.onerror = (error) => {\n                        reject(error);\n                    };\n                    reader.readAsText(event.data);\n                }\n                else {\n                    if (typeof event.data === 'string') {\n                        handleResponse(event.data);\n                    }\n                    else {\n                        handleResponse(event.data.toString());\n                    }\n                }\n            };\n            socket.onopen = () => {\n                retries = 0;\n            };\n            socket.onclose = () => {\n                if (active) {\n                    setTimeout(connect, backoff(retries++));\n                }\n            };\n        };\n        connect();\n    });\n}\n/**\n * Long-poll for message.\n * @internal\n */\nasync function pollForCallback(url, ctx) {\n    let active = true;\n    ctx.cancel = () => {\n        active = false;\n    };\n    while (active) {\n        try {\n            const res = await fetch(url);\n            if (res.status === 408) {\n                continue;\n            }\n            else if (res.status === 200) {\n                return await res.json();\n            }\n            else {\n                throw new Error(`HTTP ${res.status}: ${res.statusText}`);\n            }\n        }\n        catch (error) {\n            // eslint-disable-next-line no-console\n            console.warn('Unexpected hyperbuoy error', error);\n        }\n        await sleep(1000);\n    }\n    return null;\n}\n/**\n * Exponential backoff function that caps off at 10s after 10 tries.\n * https://i.imgur.com/IrUDcJp.png\n * @internal\n */\nfunction backoff(tries) {\n    return Math.min(Math.pow(tries * 10, 2), 10 * 1000);\n}\n/**\n * Return promise that resolves after given milliseconds.\n * @internal\n */\nfunction sleep(ms) {\n    return new Promise((resolve) => {\n        setTimeout(resolve, ms);\n    });\n}\n\n/**\n * Class representing a EOSIO chain.\n */\nclass LinkChain {\n    /** @internal */\n    constructor(chainId, clientOrUrl) {\n        this.abiCache = new Map();\n        this.pendingAbis = new Map();\n        this.chainId = ChainId.from(chainId);\n        this.client =\n            typeof clientOrUrl === 'string' ? new APIClient({ url: clientOrUrl }) : clientOrUrl;\n    }\n    /**\n     * Fetch the ABI for given account, cached.\n     * @internal\n     */\n    async getAbi(account) {\n        const key = String(account);\n        let rv = this.abiCache.get(key);\n        if (!rv) {\n            let getAbi = this.pendingAbis.get(key);\n            if (!getAbi) {\n                getAbi = this.client.v1.chain.get_abi(account);\n                this.pendingAbis.set(key, getAbi);\n            }\n            rv = (await getAbi).abi;\n            this.pendingAbis.delete(key);\n            if (rv) {\n                this.abiCache.set(key, rv);\n            }\n        }\n        return rv;\n    }\n}\n/**\n * Anchor Link main class.\n *\n * @example\n *\n * ```ts\n * import AnchorLink from 'anchor-link'\n * import ConsoleTransport from 'anchor-link-console-transport'\n *\n * const link = new AnchorLink({\n *     transport: new ConsoleTransport(),\n *     chains: [\n *         {\n *             chainId: 'aca376f206b8fc25a6ed44dbdc66547c36c6c33e3a119ffbeaef943642f0e906',\n *             nodeUrl: 'https://eos.greymass.com',\n *         },\n *     ],\n * })\n *\n * const result = await link.transact({actions: myActions})\n * ```\n */\nclass Link {\n    /** Create a new link instance. */\n    constructor(options) {\n        if (typeof options !== 'object') {\n            throw new TypeError('Missing options object');\n        }\n        if (!options.transport) {\n            throw new TypeError('options.transport is required');\n        }\n        let chains = options.chains || [];\n        if (options.chainId && options.client) {\n            chains = [{ chainId: options.chainId, nodeUrl: options.client }];\n        }\n        if (chains.length === 0) {\n            throw new TypeError('options.chains is required');\n        }\n        this.chains = chains.map(({ chainId, nodeUrl }) => {\n            if (!chainId) {\n                throw new Error('options.chains[].chainId is required');\n            }\n            if (!nodeUrl) {\n                throw new Error('options.chains[].nodeUrl is required');\n            }\n            return new LinkChain(chainId, nodeUrl);\n        });\n        if (options.service === undefined || typeof options.service === 'string') {\n            this.callbackService = new BuoyCallbackService(options.service || LinkOptions.defaults.service);\n        }\n        else {\n            this.callbackService = options.service;\n        }\n        this.transport = options.transport;\n        if (options.storage !== null) {\n            this.storage = options.storage || this.transport.storage;\n        }\n        this.verifyProofs =\n            options.verifyProofs !== undefined\n                ? options.verifyProofs\n                : LinkOptions.defaults.verifyProofs;\n        this.encodeChainIds =\n            options.encodeChainIds !== undefined\n                ? options.encodeChainIds\n                : LinkOptions.defaults.encodeChainIds;\n    }\n    /**\n     * The APIClient instance for communicating with the node.\n     * @note This returns the first APIClient when link is configured with multiple chains.\n     */\n    get client() {\n        return this.chains[0].client;\n    }\n    /**\n     * Return a [[LinkChain]] object for given chainId or chain reference.\n     * @throws If this link instance has no configured chain for given reference.\n     * @internal\n     */\n    getChain(chain) {\n        if (chain instanceof LinkChain) {\n            return chain;\n        }\n        if (typeof chain === 'number') {\n            const rv = this.chains[chain];\n            if (!rv) {\n                throw new Error(`Invalid chain index: ${chain}`);\n            }\n            return rv;\n        }\n        const id = ChainId.from(chain);\n        const rv = this.chains.find((c) => c.chainId.equals(id));\n        if (!rv) {\n            throw new Error(`Unsupported chain: ${id}`);\n        }\n        return rv;\n    }\n    /**\n     * Create a SigningRequest instance configured for this link.\n     * @internal\n     */\n    async createRequest(args, chain, transport) {\n        const t = transport || this.transport;\n        let request;\n        if (chain || this.chains.length === 1) {\n            const c = chain || this.chains[0];\n            request = await SigningRequest.create({\n                ...args,\n                chainId: c.chainId,\n                broadcast: false,\n            }, { abiProvider: c, zlib });\n        }\n        else {\n            // multi-chain request\n            request = await SigningRequest.create({\n                ...args,\n                chainId: null,\n                chainIds: this.encodeChainIds ? this.chains.map((c) => c.chainId) : undefined,\n                broadcast: false,\n            }, \n            // abi's will be pulled from the first chain and assumed to be identical on all chains\n            { abiProvider: this.chains[0], zlib });\n        }\n        if (t.prepare) {\n            request = await t.prepare(request);\n        }\n        const callback = this.callbackService.create();\n        request.setCallback(callback.url, true);\n        return { request, callback };\n    }\n    /**\n     * Send a SigningRequest instance using this link.\n     * @internal\n     */\n    async sendRequest(request, callback, chain, transport, broadcast = false) {\n        const t = transport || this.transport;\n        try {\n            const linkUrl = request.data.callback;\n            if (linkUrl !== callback.url) {\n                throw new Error('Invalid request callback');\n            }\n            if (request.data.flags.broadcast === true || request.data.flags.background === false) {\n                throw new Error('Invalid request flags');\n            }\n            // wait for callback or user cancel\n            let done = false;\n            const cancel = new Promise((resolve, reject) => {\n                t.onRequest(request, (reason) => {\n                    if (done) {\n                        // ignore any cancel calls once callbackResponse below has resolved\n                        return;\n                    }\n                    const error = typeof reason === 'string' ? new CancelError(reason) : reason;\n                    if (t.recoverError && t.recoverError(error, request) === true) {\n                        // transport was able to recover from the error\n                        return;\n                    }\n                    callback.cancel();\n                    reject(error);\n                });\n            });\n            const callbackResponse = await Promise.race([callback.wait(), cancel]);\n            done = true;\n            if (typeof callbackResponse.rejected === 'string') {\n                throw new CancelError(callbackResponse.rejected);\n            }\n            const payload = callbackResponse;\n            const signer = PermissionLevel.from({\n                actor: payload.sa,\n                permission: payload.sp,\n            });\n            const signatures = Object.keys(payload)\n                .filter((key) => key.startsWith('sig') && key !== 'sig0')\n                .map((key) => Signature.from(payload[key]));\n            let c;\n            if (!chain && this.chains.length > 1) {\n                if (!payload.cid) {\n                    throw new Error('Multi chain response payload must specify resolved chain id (cid)');\n                }\n                c = this.getChain(payload.cid);\n            }\n            else {\n                c = chain || this.getChain(0);\n                if (payload.cid && !c.chainId.equals(payload.cid)) {\n                    throw new Error('Got response for wrong chain id');\n                }\n            }\n            // recreate transaction from request response\n            const resolved = await ResolvedSigningRequest.fromPayload(payload, {\n                zlib,\n                abiProvider: c,\n            });\n            // prepend cosigner signature if present\n            const cosignerSig = resolved.request.getInfoKey('cosig', {\n                type: Signature,\n                array: true,\n            });\n            if (cosignerSig) {\n                signatures.unshift(...cosignerSig);\n            }\n            const result = {\n                resolved,\n                chain: c,\n                transaction: resolved.transaction,\n                resolvedTransaction: resolved.resolvedTransaction,\n                signatures,\n                payload,\n                signer,\n            };\n            if (broadcast) {\n                const signedTx = SignedTransaction.from({\n                    ...resolved.transaction,\n                    signatures,\n                });\n                const res = await c.client.v1.chain.push_transaction(signedTx);\n                result.processed = res.processed;\n            }\n            if (t.onSuccess) {\n                t.onSuccess(request, result);\n            }\n            return result;\n        }\n        catch (error) {\n            if (t.onFailure) {\n                t.onFailure(request, error);\n            }\n            throw error;\n        }\n    }\n    /**\n     * Sign and optionally broadcast a EOSIO transaction, action or actions.\n     *\n     * Example:\n     *\n     * ```ts\n     * let result = await myLink.transact({transaction: myTx})\n     * ```\n     *\n     * @param args The action, actions or transaction to use.\n     * @param options Options for this transact call.\n     * @param transport Transport override, for internal use.\n     */\n    async transact(args, options, transport) {\n        const o = options || {};\n        const t = transport || this.transport;\n        const c = o.chain !== undefined ? this.getChain(o.chain) : undefined;\n        const broadcast = o.broadcast !== false;\n        const noModify = o.noModify !== undefined ? o.noModify : !broadcast;\n        // Initialize the loading state of the transport\n        if (t && t.showLoading) {\n            t.showLoading();\n        }\n        // eosjs transact compat: upgrade to transaction if args have any header fields\n        const anyArgs = args;\n        if (args.actions &&\n            (anyArgs.expiration ||\n                anyArgs.ref_block_num ||\n                anyArgs.ref_block_prefix ||\n                anyArgs.max_net_usage_words ||\n                anyArgs.max_cpu_usage_ms ||\n                anyArgs.delay_sec)) {\n            args = {\n                transaction: {\n                    expiration: '1970-01-01T00:00:00',\n                    ref_block_num: 0,\n                    ref_block_prefix: 0,\n                    max_net_usage_words: 0,\n                    max_cpu_usage_ms: 0,\n                    delay_sec: 0,\n                    ...anyArgs,\n                },\n            };\n        }\n        const { request, callback } = await this.createRequest(args, c, t);\n        if (noModify) {\n            request.setInfoKey('no_modify', true, 'bool');\n        }\n        const result = await this.sendRequest(request, callback, c, t, broadcast);\n        return result;\n    }\n    /**\n     * Send an identity request and verify the identity proof if [[LinkOptions.verifyProofs]] is true.\n     * @param args.scope The scope of the identity request.\n     * @param args.requestPermission Optional request permission if the request is for a specific account or permission.\n     * @param args.info Metadata to add to the request.\n     * @note This is for advanced use-cases, you probably want to use [[Link.login]] instead.\n     */\n    async identify(args) {\n        const { request, callback } = await this.createRequest({\n            identity: { permission: args.requestPermission, scope: args.scope },\n            info: args.info,\n        });\n        const res = await this.sendRequest(request, callback);\n        if (!res.resolved.request.isIdentity()) {\n            throw new IdentityError('Unexpected response');\n        }\n        let account;\n        const proof = res.resolved.getIdentityProof(res.signatures[0]);\n        if (this.verifyProofs) {\n            account = await res.chain.client.v1.chain.get_account(res.signer.actor);\n            if (!account) {\n                throw new IdentityError(`Signature from unknown account: ${proof.signer.actor}`);\n            }\n            const accountPermission = account.permissions.find(({ perm_name }) => proof.signer.permission.equals(perm_name));\n            if (!accountPermission) {\n                throw new IdentityError(`${proof.signer.actor} signed for unknown permission: ${proof.signer.permission}`);\n            }\n            const proofValid = proof.verify(accountPermission.required_auth, account.head_block_time);\n            if (!proofValid) {\n                throw new IdentityError(`Invalid identify proof for: ${proof.signer}`);\n            }\n        }\n        if (args.requestPermission) {\n            const perm = PermissionLevel.from(args.requestPermission);\n            if ((!perm.actor.equals(PlaceholderName) && !perm.actor.equals(proof.signer.actor)) ||\n                (!perm.permission.equals(PlaceholderPermission) &&\n                    !perm.permission.equals(proof.signer.permission))) {\n                throw new IdentityError(`Identity proof singed by ${proof.signer}, expected: ${formatAuth(perm)} `);\n            }\n        }\n        return {\n            ...res,\n            account,\n            proof,\n        };\n    }\n    /**\n     * Login and create a persistent session.\n     * @param identifier The session identifier, an EOSIO name (`[a-z1-5]{1,12}`).\n     *                   Should be set to the contract account if applicable.\n     */\n    async login(identifier) {\n        const privateKey = PrivateKey.generate('K1');\n        const requestKey = privateKey.toPublic();\n        const createInfo = LinkCreate.from({\n            session_name: identifier,\n            request_key: requestKey,\n            user_agent: this.getUserAgent(),\n        });\n        const res = await this.identify({\n            scope: identifier,\n            info: {\n                link: createInfo,\n                scope: identifier,\n            },\n        });\n        const metadata = sessionMetadata(res.payload, res.resolved.request);\n        const signerKey = res.proof.recover();\n        let session;\n        if (res.payload.link_ch && res.payload.link_key && res.payload.link_name) {\n            session = new LinkChannelSession(this, {\n                identifier,\n                chainId: res.chain.chainId,\n                auth: res.signer,\n                publicKey: signerKey,\n                channel: {\n                    url: res.payload.link_ch,\n                    key: res.payload.link_key,\n                    name: res.payload.link_name,\n                },\n                requestKey: privateKey,\n            }, metadata);\n        }\n        else {\n            session = new LinkFallbackSession(this, {\n                identifier,\n                chainId: res.chain.chainId,\n                auth: res.signer,\n                publicKey: signerKey,\n            }, metadata);\n        }\n        await this.storeSession(session);\n        return {\n            ...res,\n            session,\n        };\n    }\n    /**\n     * Restore previous session, use [[login]] to create a new session.\n     * @param identifier The session identifier, must be same as what was used when creating the session with [[login]].\n     * @param auth A specific session auth to restore, if omitted the most recently used session will be restored.\n     * @param chainId If given function will only consider that specific chain when restoring session.\n     * @returns A [[LinkSession]] instance or null if no session can be found.\n     * @throws If no [[LinkStorage]] adapter is configured or there was an error retrieving the session data.\n     **/\n    async restoreSession(identifier, auth, chainId) {\n        if (!this.storage) {\n            throw new Error('Unable to restore session: No storage adapter configured');\n        }\n        let key;\n        if (auth && chainId) {\n            // both auth and chain id given, we can look up on specific key\n            key = this.sessionKey(identifier, formatAuth(PermissionLevel.from(auth)), String(ChainId.from(chainId)));\n        }\n        else {\n            // otherwise we use the session list to filter down to most recently used matching given params\n            let list = await this.listSessions(identifier);\n            if (auth) {\n                list = list.filter((item) => item.auth.equals(auth));\n            }\n            if (chainId) {\n                const id = ChainId.from(chainId);\n                list = list.filter((item) => item.chainId.equals(id));\n            }\n            const latest = list[0];\n            if (!latest) {\n                return null;\n            }\n            key = this.sessionKey(identifier, formatAuth(latest.auth), String(latest.chainId));\n        }\n        const data = await this.storage.read(key);\n        if (!data) {\n            return null;\n        }\n        let sessionData;\n        try {\n            sessionData = JSON.parse(data);\n        }\n        catch (error) {\n            throw new Error(`Unable to restore session: Stored JSON invalid (${error.message || String(error)})`);\n        }\n        const session = LinkSession.restore(this, sessionData);\n        if (auth || chainId) {\n            // update latest used\n            await this.touchSession(identifier, session.auth, session.chainId);\n        }\n        return session;\n    }\n    /**\n     * List stored session auths for given identifier.\n     * The most recently used session is at the top (index 0).\n     * @throws If no [[LinkStorage]] adapter is configured or there was an error retrieving the session list.\n     **/\n    async listSessions(identifier) {\n        if (!this.storage) {\n            throw new Error('Unable to list sessions: No storage adapter configured');\n        }\n        const key = this.sessionKey(identifier, 'list');\n        let list;\n        try {\n            list = JSON.parse((await this.storage.read(key)) || '[]');\n        }\n        catch (error) {\n            throw new Error(`Unable to list sessions: ${error.message || String(error)}`);\n        }\n        return list.map(({ auth, chainId }) => ({\n            auth: PermissionLevel.from(auth),\n            chainId: ChainId.from(chainId),\n        }));\n    }\n    /**\n     * Remove stored session for given identifier and auth.\n     * @throws If no [[LinkStorage]] adapter is configured or there was an error removing the session data.\n     */\n    async removeSession(identifier, auth, chainId) {\n        if (!this.storage) {\n            throw new Error('Unable to remove session: No storage adapter configured');\n        }\n        const key = this.sessionKey(identifier, formatAuth(auth), String(chainId));\n        await this.storage.remove(key);\n        await this.touchSession(identifier, auth, chainId, true);\n    }\n    /**\n     * Remove all stored sessions for given identifier.\n     * @throws If no [[LinkStorage]] adapter is configured or there was an error removing the session data.\n     */\n    async clearSessions(identifier) {\n        if (!this.storage) {\n            throw new Error('Unable to clear sessions: No storage adapter configured');\n        }\n        for (const { auth, chainId } of await this.listSessions(identifier)) {\n            await this.removeSession(identifier, auth, chainId);\n        }\n    }\n    /**\n     * Create an eosjs compatible signature provider using this link.\n     * @param availableKeys Keys the created provider will claim to be able to sign for.\n     * @param chain Chain to use when configured with multiple chains.\n     * @param transport (internal) Transport override for this call.\n     * @note We don't know what keys are available so those have to be provided,\n     *       to avoid this use [[LinkSession.makeSignatureProvider]] instead. Sessions can be created with [[Link.login]].\n     */\n    makeSignatureProvider(availableKeys, chain, transport) {\n        return {\n            getAvailableKeys: async () => availableKeys,\n            sign: async (args) => {\n                const t = transport || this.transport;\n                const c = chain ? this.getChain(chain) : this.chains[0];\n                let request = SigningRequest.fromTransaction(args.chainId, args.serializedTransaction, { abiProvider: c, zlib });\n                const callback = this.callbackService.create();\n                request.setCallback(callback.url, true);\n                request.setBroadcast(false);\n                if (t.prepare) {\n                    request = await t.prepare(request);\n                }\n                const { transaction, signatures } = await this.sendRequest(request, callback, c, t);\n                const serializedTransaction = Serializer.encode({ object: transaction });\n                return {\n                    ...args,\n                    serializedTransaction,\n                    signatures,\n                };\n            },\n        };\n    }\n    /** Makes sure session is in storage list of sessions and moves it to top (most recently used). */\n    async touchSession(identifier, auth, chainId, remove = false) {\n        const list = await this.listSessions(identifier);\n        const existing = list.findIndex((item) => item.auth.equals(auth) && item.chainId.equals(chainId));\n        if (existing >= 0) {\n            list.splice(existing, 1);\n        }\n        if (remove === false) {\n            list.unshift({ auth, chainId });\n        }\n        const key = this.sessionKey(identifier, 'list');\n        await this.storage.write(key, JSON.stringify(list));\n    }\n    /**\n     * Makes sure session is in storage list of sessions and moves it to top (most recently used).\n     * @internal\n     */\n    async storeSession(session) {\n        if (this.storage) {\n            const key = this.sessionKey(session.identifier, formatAuth(session.auth), String(session.chainId));\n            const data = JSON.stringify(session.serialize());\n            await this.storage.write(key, data);\n            await this.touchSession(session.identifier, session.auth, session.chainId);\n        }\n    }\n    /** Session storage key for identifier and suffix. */\n    sessionKey(identifier, ...suffix) {\n        return [String(Name.from(identifier)), ...suffix].join('-');\n    }\n    /**\n     * Return user agent of this link.\n     * @internal\n     */\n    getUserAgent() {\n        let rv = `AnchorLink/${Link.version}`;\n        if (this.transport.userAgent) {\n            rv += ' ' + this.transport.userAgent();\n        }\n        return rv;\n    }\n}\n/** Package version. */\nLink.version = '3.3.0'; // eslint-disable-line @typescript-eslint/no-inferrable-types\n/**\n * Format a EOSIO permission level in the format `actor@permission` taking placeholders into consideration.\n * @internal\n */\nfunction formatAuth(auth) {\n    const a = PermissionLevel.from(auth);\n    const actor = a.actor.equals(PlaceholderName) ? '<any>' : String(a.actor);\n    let permission;\n    if (a.permission.equals(PlaceholderName) || a.permission.equals(PlaceholderPermission)) {\n        permission = '<any>';\n    }\n    else {\n        permission = String(a.permission);\n    }\n    return `${actor}@${permission}`;\n}\n\n// export library\n\nexport default Link;\nexport { CancelError, IdentityError, Link, LinkChain, LinkChannelSession, LinkFallbackSession, LinkSession, SessionError };\n//# sourceMappingURL=anchor-link.m.js.map\n"],"names":["check","it","Math","global","globalThis","window","self","this","Function","fails","exec","error","descriptors","require$$0","Object","defineProperty","get","$propertyIsEnumerable","propertyIsEnumerable","getOwnPropertyDescriptor","NASHORN_BUG","call","1","V","descriptor","enumerable","createPropertyDescriptor","bitmap","value","configurable","writable","toString","classofRaw","slice","classof","require$$1","split","indexedObject","requireObjectCoercible","undefined","TypeError","IndexedObject","toIndexedObject","isObject","toPrimitive","input","PREFERRED_STRING","fn","val","valueOf","toObject","argument","hasOwnProperty","has","hasOwn","key","document","EXISTS","createElement","documentCreateElement","require$$2","ie8DomDefine","a","DESCRIPTORS","propertyIsEnumerableModule","require$$3","require$$4","require$$5","IE8_DOM_DEFINE","require$$6","$getOwnPropertyDescriptor","O","P","f","anObject","String","$defineProperty","Attributes","definePropertyModule","createNonEnumerableProperty","object","setGlobal","SHARED","sharedStore","store","functionToString","inspectSource","WeakMap","nativeWeakMap","test","sharedModule","push","version","mode","copyright","set","id","postfix","random","uid","shared","keys","sharedKey","hiddenKeys","NATIVE_WEAK_MAP","objectHas","require$$7","OBJECT_ALREADY_INITIALIZED","state","wmget","wmhas","wmset","metadata","facade","STATE","internalState","enforce","getterFor","TYPE","type","getInternalState","enforceInternalState","TEMPLATE","redefineModule","options","unsafe","simple","noTargetGet","source","join","prototype","path","aFunction","variable","getBuiltIn","namespace","method","arguments","length","ceil","floor","toInteger","isNaN","min","toLength","max","toAbsoluteIndex","index","integer","createMethod","IS_INCLUDES","$this","el","fromIndex","arrayIncludes","includes","indexOf","objectKeysInternal","names","i","result","enumBugKeys","internalObjectKeys","concat","getOwnPropertyNames","getOwnPropertySymbols","match","getOwnPropertyNamesModule","getOwnPropertySymbolsModule","ownKeys","getOwnPropertyDescriptorModule","copyConstructorProperties","target","replacement","isForced","feature","detection","data","normalize","POLYFILL","NATIVE","string","replace","toLowerCase","isForced_1","redefine","_export","targetProperty","sourceProperty","TARGET","GLOBAL","STATIC","stat","forced","sham","engineUserAgent","userAgent","process","versions","v8","activeXDocument","engineV8Version","V8_VERSION","nativeSymbol","symbol","Symbol","useSymbolAsUid","iterator","isArray","Array","arg","objectKeys","objectDefineProperties","defineProperties","Properties","html","IE_PROTO","EmptyConstructor","scriptTag","content","LT","NullProtoObject","domain","ActiveXObject","iframeDocument","iframe","write","close","temp","parentWindow","NullProtoObjectViaActiveX","style","display","appendChild","src","contentWindow","open","F","objectCreate","create","$getOwnPropertyNames","windowNames","getWindowNames","NATIVE_SYMBOL","USE_SYMBOL_AS_UID","WellKnownSymbolsStore","createWellKnownSymbol","withoutSetter","wellKnownSymbol","name","wrappedWellKnownSymbolModule","defineWellKnownSymbol","NAME","TO_STRING_TAG","setToStringTag","TAG","functionBindContext","that","b","c","apply","SPECIES","arraySpeciesCreate","originalArray","C","constructor","bind","IS_MAP","IS_FILTER","IS_SOME","IS_EVERY","IS_FIND_INDEX","IS_FILTER_OUT","NO_HOLES","callbackfn","specificCreate","boundFunction","arrayIteration","forEach","map","filter","some","every","find","findIndex","filterOut","$","require$$8","require$$9","require$$10","require$$11","require$$12","require$$13","require$$14","require$$15","nativeObjectCreate","require$$16","require$$17","require$$18","getOwnPropertyNamesExternal","require$$19","require$$20","require$$21","require$$22","require$$23","require$$24","require$$25","require$$26","require$$28","require$$29","require$$30","require$$31","require$$32","require$$33","InternalStateModule","require$$34","$forEach","require$$35","HIDDEN","require$$27","SYMBOL","TO_PRIMITIVE","setInternalState","ObjectPrototype","$Symbol","$stringify","nativeGetOwnPropertyDescriptor","nativeDefineProperty","nativeGetOwnPropertyNames","nativePropertyIsEnumerable","AllSymbols","ObjectPrototypeSymbols","StringToSymbolRegistry","SymbolToStringRegistry","QObject","USE_SETTER","findChild","setSymbolDescriptor","ObjectPrototypeDescriptor","wrap","tag","description","isSymbol","$defineProperties","properties","$getOwnPropertySymbols","IS_OBJECT_PROTOTYPE","setter","for","keyFor","sym","useSetter","useSimple","stringify","replacer","space","$replacer","args","NativeSymbol","EmptyStringDescriptionStore","SymbolWrapper","symbolPrototype","symbolToString","native","regexp","desc","toStringTagSupport","TO_STRING_TAG_SUPPORT","CORRECT_ARGUMENTS","tryGet","callee","objectToString","UNSCOPABLES","ArrayPrototype","IteratorPrototype","PrototypeOfArrayIteratorPrototype","arrayIterator","addToUnscopables","iterators","correctPrototypeGetter","getPrototypeOf","CORRECT_PROTOTYPE_GETTER","objectGetPrototypeOf","ITERATOR","BUGGY_SAFARI_ITERATORS","iteratorsCore","Iterators","returnThis","createIteratorConstructor","IteratorConstructor","next","aPossiblePrototype","objectSetPrototypeOf","setPrototypeOf","CORRECT_SETTER","proto","__proto__","KEYS","VALUES","ENTRIES","defineIterator","Iterable","DEFAULT","IS_SET","FORCED","CurrentIteratorPrototype","methods","KEY","getIterationMethod","KIND","defaultIterator","IterablePrototype","INCORRECT_VALUES_NAME","nativeIterator","anyNativeIterator","entries","values","ARRAY_ITERATOR","es_array_iterator","iterated","kind","done","Arguments","CONVERT_TO_STRING","pos","first","second","S","position","size","charCodeAt","charAt","stringMultibyte","codeAt","STRING_ITERATOR","point","domIterables","CSSRuleList","CSSStyleDeclaration","CSSValueList","ClientRectList","DOMRectList","DOMStringList","DOMTokenList","DataTransferItemList","FileList","HTMLAllCollection","HTMLCollection","HTMLFormElement","HTMLSelectElement","MediaList","MimeTypeArray","NamedNodeMap","NodeList","PaintRequestList","Plugin","PluginArray","SVGLengthList","SVGNumberList","SVGPathSegList","SVGPointList","SVGStringList","SVGTransformList","SourceBufferList","StyleSheetList","TextTrackCueList","TextTrackList","TouchList","DOMIterables","ArrayIteratorMethods","ArrayValues","COLLECTION_NAME","Collection","CollectionPrototype","METHOD_NAME","JSON","nativeGetPrototypeOf","FunctionPrototype","FunctionPrototypeToString","nameRE","nativePromiseConstructor","Promise","redefineAll","setSpecies","CONSTRUCTOR_NAME","Constructor","anInstance","isArrayIteratorMethod","getIteratorMethod","iteratorClose","returnMethod","Result","stopped","iterate","iterable","unboundFunction","iterFn","step","AS_ENTRIES","IS_ITERATOR","INTERRUPTED","stop","condition","callFn","SAFE_CLOSING","called","iteratorWithReturn","return","from","defer","channel","port","checkCorrectnessOfIteration","SKIP_CLOSING","ITERATION_SUPPORT","speciesConstructor","defaultConstructor","engineIsIos","engineIsNode","IS_IOS","IS_NODE","location","setImmediate","clear","clearImmediate","MessageChannel","Dispatch","counter","queue","ONREADYSTATECHANGE","run","runner","listener","event","post","postMessage","protocol","host","nextTick","now","port2","port1","onmessage","addEventListener","importScripts","removeChild","setTimeout","flush","head","last","notify","toggle","node","promise","then","task","engineIsWebosWebkit","macrotask","IS_WEBOS_WEBKIT","MutationObserver","WebKitMutationObserver","queueMicrotaskDescriptor","queueMicrotask","parent","exit","enter","resolve","createTextNode","observe","characterData","microtask","PromiseCapability","reject","$$resolve","$$reject","Internal","OwnPromiseCapability","PromiseWrapper","nativeThen","newPromiseCapability","engineIsBrowser","NativePromise","promiseResolve","x","promiseCapability","hostReportErrors","console","newPromiseCapabilityModule","perform","IS_BROWSER","PROMISE","getInternalPromiseState","NativePromisePrototype","PromiseConstructor","PromiseConstructorPrototype","newGenericPromiseCapability","DISPATCH_EVENT","createEvent","dispatchEvent","NATIVE_REJECTION_EVENT","PromiseRejectionEvent","UNHANDLED_REJECTION","SUBCLASSING","GLOBAL_CORE_JS_PROMISE","FakePromise","INCORRECT_ITERATION","all","isThenable","isReject","notified","chain","reactions","ok","exited","reaction","handler","fail","rejection","onHandleUnhandled","onUnhandled","reason","initEvent","isUnhandled","emit","unwrap","internalReject","internalResolve","wrapper","executor","onFulfilled","onRejected","catch","r","capability","$promiseResolve","remaining","alreadyCalled","race","regexpFlags","ignoreCase","multiline","dotAll","unicode","sticky","flags","TO_STRING","RegExpPrototype","RegExp","nativeToString","NOT_GENERIC","INCORRECT_NAME","R","p","rf","arrayMethodIsStrict","createProperty","propertyKey","arrayMethodHasSpeciesSupport","array","foo","Boolean","HAS_SPECIES_SUPPORT","nativeSlice","start","end","n","k","fin","runtime","exports","Op","iteratorSymbol","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","toStringTag","define","obj","err","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","context","Context","_invoke","GenStateSuspendedStart","GenStateExecuting","Error","GenStateCompleted","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","record","tryCatch","GenStateSuspendedYield","makeInvokeMethod","GeneratorFunction","GeneratorFunctionPrototype","getProto","NativeIteratorPrototype","Gp","defineIteratorMethods","AsyncIterator","PromiseImpl","invoke","_typeof","__await","unwrapped","previousPromise","callInvokeWithMethodAndArg","info","resultName","nextLoc","pushTryEntry","locs","entry","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","iteratorMethod","displayName","isGeneratorFunction","genFun","ctor","mark","awrap","async","iter","reverse","pop","skipTempReset","prev","rootRecord","rval","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","thrown","delegateYield","module","regeneratorRuntime","accidentalStrictMode","nativeKeys","nativeJoin","ES3_STRINGS","STRICT_METHOD","separator","$map","RE","s","re","lastIndex","re1","re2","stickyHelpers","nativeExec","nativeReplace","patchedExec","UPDATES_LAST_INDEX_WRONG","UNSUPPORTED_Y","BROKEN_CARET","NPCG_INCLUDED","str","reCopy","charsAdded","strCopy","regexpExec","REPLACE_SUPPORTS_NAMED_GROUPS","groups","REPLACE_KEEPS_$0","REPLACE","REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE","SPLIT_WORKS_WITH_OVERWRITTEN_EXEC","originalExec","fixRegexpWellKnownSymbolLogic","DELEGATES_TO_SYMBOL","DELEGATES_TO_EXEC","execCalled","nativeRegExpMethod","nativeMethod","arg2","forceStringMethod","$exec","stringMethod","regexMethod","MATCH","isRegexp","isRegExp","advanceStringIndex","regexpExecAbstract","fixRegExpWellKnownSymbolLogic","callRegExpExec","arrayPush","MAX_UINT32","SPLIT","nativeSplit","maybeCallNative","internalSplit","limit","lim","lastLength","output","lastLastIndex","separatorCopy","splitter","res","rx","unicodeMatching","q","A","e","z","quot","createHtml","attribute","p1","stringHtmlForced","createHTML","link","url","SUBSTITUTION_SYMBOLS","SUBSTITUTION_SYMBOLS_NO_NAMED","getSubstitution","matched","captures","namedCaptures","tailPos","m","symbols","ch","capture","regExpExec","UNSAFE_SUBSTITUTE","searchValue","replaceValue","functionalReplace","fullUnicode","results","accumulatedResult","nextSourcePosition","j","replacerArgs","whitespaces","whitespace","ltrim","rtrim","stringTrim","trim","$trim","forcedStringTrimMethod","IS_CONCAT_SPREADABLE","MAX_SAFE_INTEGER","MAXIMUM_ALLOWED_INDEX_EXCEEDED","IS_CONCAT_SPREADABLE_SUPPORT","SPECIES_SUPPORT","isConcatSpreadable","spreadable","len","E","$includes","notARegexp","correctIsRegexpLogic","error1","error2","notARegExp","searchString","freezing","isExtensible","preventExtensions","FREEZING","METADATA","setMetadata","objectID","weakData","meta","internalMetadataModule","REQUIRED","fastKey","getWeakData","onFreeze","inheritIfRequired","dummy","Wrapper","NewTarget","NewTargetPrototype","InternalMetadataModule","collection","common","IS_WEAK","ADDER","NativeConstructor","NativePrototype","exported","fixMethod","getConstructor","instance","HASNT_CHAINING","THROWS_ON_PRIMITIVES","ACCEPT_ITERABLES","BUGGY_ZERO","$instance","setStrong","internalStateGetterFor","collectionStrong","previous","getEntry","removed","delete","add","ITERATOR_NAME","getInternalCollectionState","getInternalIteratorState","init","$find","FIND","SKIPS_HOLES","objectDefinePropertyModule","regExpFlags","$filter","correctIsRegExpLogic","$startsWith","startsWith","CORRECT_IS_REGEXP_LOGIC","search","$findIndex","FIND_INDEX","MAXIMUM_ALLOWED_LENGTH_EXCEEDED","splice","deleteCount","insertCount","actualDeleteCount","to","actualStart","argumentsLength","arrayBufferNative","ArrayBuffer","DataView","NATIVE_ARRAY_BUFFER","Int8Array","Int8ArrayPrototype","Uint8ClampedArray","Uint8ClampedArrayPrototype","TypedArray","TypedArrayPrototype","isPrototypeOf","TYPED_ARRAY_TAG","NATIVE_ARRAY_BUFFER_VIEWS","opera","TYPED_ARRAY_TAG_REQIRED","TypedArrayConstructorsList","Uint8Array","Int16Array","Uint16Array","Int32Array","Uint32Array","Float32Array","Float64Array","BigIntArrayConstructorsList","BigInt64Array","BigUint64Array","isTypedArray","klass","arrayBufferViewCore","aTypedArray","aTypedArrayConstructor","ARRAY","TypedArrayConstructor","exportTypedArrayMethod","property","exportTypedArrayStaticMethod","isView","typedArrayConstructorsRequireWrappers","toIndex","number","RangeError","abs","pow","log","LN2","arrayFill","endPos","IEEE754","pack","mantissaLength","bytes","exponent","mantissa","buffer","exponentLength","eMax","eBias","rt","sign","Infinity","unpack","nBits","NaN","ARRAY_BUFFER","DATA_VIEW","WRONG_INDEX","NativeArrayBuffer","$ArrayBuffer","$DataView","$DataViewPrototype","packIEEE754","unpackIEEE754","packInt8","packInt16","packInt32","unpackInt32","packFloat32","packFloat64","addGetter","view","count","isLittleEndian","intIndex","byteLength","byteOffset","conversion","ArrayBufferPrototype","testView","$setInt8","setInt8","getInt8","setUint8","bufferLength","offset","getUint8","getInt16","getUint16","getInt32","getUint32","getFloat32","getFloat64","setInt16","setUint16","setInt32","setUint32","setFloat32","setFloat64","arrayBuffer","toPositiveInteger","toOffset","BYTES","TYPED_ARRAYS_CONSTRUCTORS_REQUIRES_WRAPPERS","ArrayBufferViewCore","ArrayBufferModule","typedArrayFrom","mapfn","mapping","round","BYTES_PER_ELEMENT","WRONG_LENGTH","fromList","list","isArrayBuffer","isTypedArrayIndex","wrappedGetOwnPropertyDescriptor","wrappedDefineProperty","typedArrayConstructorModule","CLAMPED","GETTER","SETTER","NativeTypedArrayConstructor","TypedArrayConstructorPrototype","addElement","getter","typedArrayOffset","$length","$len","$copyWithin","copyWithin","inc","$every","$fill","fromSpeciesAndList","predicate","searchElement","$indexOf","ArrayIterators","arrayValues","arrayKeys","arrayEntries","nativeTypedArrayIterator","CORRECT_ITER_NAME","typedArrayValues","$join","$lastIndexOf","lastIndexOf","NEGATIVE_ZERO","IS_RIGHT","memo","arrayReduce","left","right","$reduce","$reduceRight","middle","arrayLike","$slice","$some","$sort","sort","comparefn","begin","beginIndex","$toLocaleString","toLocaleString","TO_LOCALE_STRING_BUG","Uint8ArrayPrototype","arrayToString","arrayJoin","IS_NOT_ARRAY_METHOD","zero","buf","LITERALS","L_CODES","D_CODES","MAX_BITS","extra_lbits","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","_dist_code","_length_code","MAX_MATCH","base_length","static_l_desc","static_d_desc","static_bl_desc","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","TreeDesc","dyn_tree","stat_desc","max_code","d_code","dist","put_short","w","pending_buf","pending","send_bits","bi_valid","bi_buf","send_code","tree","bi_reverse","code","gen_codes","bl_count","bits","next_code","init_block","dyn_ltree","dyn_dtree","bl_tree","END_BLOCK","opt_len","static_len","last_lit","matches","bi_windup","smaller","depth","_n2","_m2","pqdownheap","v","heap","heap_len","compress_block","ltree","dtree","lc","extra","lx","d_buf","l_buf","build_tree","stree","heap_max","h","xbits","base","overflow","gen_bitlen","scan_tree","curlen","prevlen","nextlen","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","_tr_stored_block","stored_len","header","subarray","copy_block","trees","_tr_init","LENGTH_CODES","tr_static_init","l_desc","d_desc","bl_desc","_tr_flush_block","opt_lenb","static_lenb","max_blindex","level","strm","data_type","black_mask","detect_data_type","BL_CODES","build_bl_tree","strategy","lcodes","dcodes","blcodes","rank","send_all_trees","_tr_tally","lit_bufsize","_tr_align","STATIC_TREES","bi_flush","adler32_1","adler","s1","s2","crcTable","table","makeTable","crc32_1","crc","t","messages","constants","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_TREES","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_ERRNO","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Z_BUF_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_BINARY","Z_TEXT","Z_UNKNOWN","Z_DEFLATED","_tr_init$1","_tr_stored_block$1","_tr_flush_block$1","_tr_tally$1","_tr_align$1","Z_FIXED$1","Z_UNKNOWN$1","MAX_MATCH$1","MIN_LOOKAHEAD","HCRC_STATE","BUSY_STATE","FINISH_STATE","errorCode","msg","zero$1","HASH","hash_shift","hash_mask","flush_pending","avail_out","pending_out","next_out","total_out","flush_block_only","block_start","strstart","put_byte","putShortMSB","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","w_size","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","more","_w_size","window_size","hash_size","avail_in","next_in","total_in","insert","ins_h","deflate_fast","hash_head","bflush","match_length","max_lazy_match","MIN_MATCH$1","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","max_block_size","pending_buf_size","max_start","DeflateState","status","gzhead","gzindex","last_flush","w_bits","hash_bits","HEAP_SIZE$1","MAX_BITS$1","deflateResetKeep","deflateReset","ret","lm_init","deflateInit2","windowBits","memLevel","deflate_1","deflateInit","deflateSetHeader","deflate","beg","old_flush","text","hcrc","comment","time","os","bstate","deflate_huff","deflate_rle","deflateEnd","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","deflateInfo","_has","sources","shift","chunks","l","chunk","STR_APPLY_UIA_OK","fromCharCode","__","_utf8len","strings","c2","m_pos","str_len","buf_len","out","utf16buf","c_len","buf2binstring","zstream","Z_NO_FLUSH$1","Z_FULL_FLUSH$1","Z_FINISH$1","Z_OK$1","Z_STREAM_END$1","Z_DEFAULT_COMPRESSION$1","Z_DEFAULT_STRATEGY$1","Z_DEFLATED$1","Deflate","chunkSize","opt","raw","gzip","ended","dict","_dict_set","deflate$1","deflator","flush_mode","_flush_mode","onData","onEnd","deflate_1$1","deflateRaw","inffast","_in","_out","dmax","wsize","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","op","from_source","lencode","distcode","lenbits","distbits","top","dolen","dodist","sane","MAXBITS","lbase","lext","dbase","dext","inftrees","lens","lens_index","codes","table_index","work","opts","incr","fill","low","mask","here_bits","here_op","here_val","root","curr","drop","used","huff","base_index","offs","extra_index","Z_FINISH$2","Z_BLOCK$1","Z_OK$2","Z_STREAM_END$2","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_BUF_ERROR$1","Z_DEFLATED$2","TYPE$1","BAD$1","zswap32","InflateState","havedict","total","wbits","ncode","nlen","ndist","have","lendyn","distdyn","back","was","lenfix","distfix","inflateResetKeep","inflateReset","inflateReset2","inflateInit2","virgin","fixedtables","updatewindow","copy","inflate_1","inflateInit","inflate","put","last_bits","last_op","last_val","hbuf","order","inf_leave","xflags","extra_len","inflateEnd","inflateGetHeader","inflateSetDictionary","inflateInfo","gzheader","toString$1","Z_NO_FLUSH$2","Z_FINISH$3","Z_OK$3","Z_STREAM_END$3","Z_NEED_DICT$1","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_MEM_ERROR$1","Inflate","inflate$1","inflator","last_avail_out","next_out_utf8","tail","utf8str","inflate_1$1","inflateRaw","ungzip","pako","stringRepeat","repeat","IS_END","maxLength","fillString","fillLen","stringFiller","stringLength","fillStr","intMaxLength","stringPad","stringPadWebkitBug","$padStart","padStart","sub","dateToPrimitive","hint","DatePrototype","Date","globalIsFinite","isFinite","Number","NUMBER","NativeNumber","NumberPrototype","BROKEN_CLASSOF","toNumber","third","radix","maxCode","digits","parseInt","NumberWrapper","callWithSafeIterationClosing","arrayFrom","$parseFloat","parseFloat","trimmedString","thisNumberValue","nativeToFixed","toFixed","acc","multiply","divide","dataToString","fractionDigits","fractDigits","x2","$endsWith","endsWith","endPosition","$parseInt","hex","createTypedArrayConstructor","toJSON","URL","$freeze","freeze","Rand","rand","generate","_rand","getBytes","getByte","crypto","getRandomValues","arr","msCrypto","randomBytes","minimalisticAssert","assert","equal","inherits_browserModule","superCtor","super_","TempCtor","inherits","isSurrogatePair","htonl","zero2","word","zero8","enc","endian","d","ah","al","bh","lo","hi","bl","cl","dh","dl","carry","eh","num","utils","BlockHash","pendingTotal","blockSize","outSize","hmacStrength","padLength","_delta8","_delta32","update","toArray","join32","_update","digest","_pad","_digest","rotr32","ch32","y","maj32","p32","shaCommon","rotl32","sum32","sum32_5","ft_1","sha1_K","SHA1","W","_1","toHex32","split32","sum32_4","s0_256","s1_256","g0_256","g1_256","sha256_K","SHA256","_256","g","T1","T2","SHA224","_224","rotr64_hi","rotr64_lo","shr64_hi","shr64_lo","sum64","sum64_hi","sum64_lo","sum64_4_hi","sum64_4_lo","sum64_5_hi","sum64_5_lo","sha512_K","SHA512","_512","ch64_hi","xh","xl","yh","yl","zh","ch64_lo","zl","maj64_hi","maj64_lo","s0_512_hi","s0_512_lo","s1_512_hi","s1_512_lo","g0_512_hi","g0_512_lo","g1_512_hi","g1_512_lo","_prepareBlock","c0_hi","c0_lo","c1_hi","c1_lo","c2_hi","c2_lo","c3_hi","c3_lo","fh","fl","gh","gl","hh","hl","c4_hi","c4_lo","T1_hi","T1_lo","T2_hi","T2_lo","SHA384","_384","sum32_3","RIPEMD160","K","Kh","B","D","Ah","Bh","Ch","Dh","Eh","T","rh","sh","Hmac","hash","Hash","inner","outer","_init","hmac","sha","ripemd","sha1","sha256","sha224","sha384","sha512","ripemd160","LOG2E","clz32","$imul","imul","UINT16","xn","yn","BN","isBN","negative","words","red","Buffer","wordSize","parseHex4Bits","parseHexByte","lowerBound","parseBase","mul","cmp","_initNumber","_initArray","_parseHex","_parseBase","off","strip","limbLen","limbPow","mod","imuln","_iaddn","dest","clone","_expand","_normSign","inspect","zeros","groupSizes","groupBases","smallMulTo","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toBuffer","toArrayLike","ArrayType","reqLength","littleEndian","andln","iushrn","_countBits","_zeroBits","bitLength","zeroBits","toTwos","width","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","jumboMulTo","FFTM","mulp","mulTo","hncarry","bigMulTo","makeRBT","N","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","ie","ro","io","guessLen13b","odd","conjugate","normalize13b","ws","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","carryMask","newCarry","ishln","extended","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","egcd","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","tmp","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","_strip","outLen","mod3","one","nOne","lpow","inv","wnd","current","currentLen","mont","u","toHex","encode","minAssert","minUtils","getNAF","naf","getJSF","k1","k2","jsf","m8","d1","d2","u1","u2","m14","m24","cachedProperty","computer","parseBytes","intFromLE","BaseCurve","conf","two","pointFromJSON","gRed","_wnafT1","_wnafT2","_wnafT3","_wnafT4","_bitLength","adjustCount","redN","_maxwellTrick","BasePoint","curve","precomputed","validate","_fixedNafMul","doubles","_getDoubles","I","nafW","repr","jpoint","mixedAdd","points","toP","_wnafMul","nafPoints","_getNAFPoints","dblp","_wnafMulAdd","defW","coeffs","jacobianResult","wndWidth","comb","toJ","ja","jb","decodePoint","pointFromX","encodeCompressed","_encode","compact","getX","getY","precompute","power","beta","_getBeta","_hasDoubles","dbl","Base","ShortCurve","tinv","zeroA","threeA","endo","_getEndomorphism","_endoWnafT1","_endoWnafT2","short","Point","isRed","inf","JPoint","zOne","lambda","betas","_getEndoRoots","lambdas","basis","vec","_getEndoBasis","ntinv","prevR","aprxSqrt","y1","y2","len1","_endoSplit","v1","v2","c1","p2","q1","q2","ax","rhs","_endoWnafMulAdd","npoints","ncoeffs","fromJSON","pre","endoMul","parse","obj2point","isInfinity","nx","ny","ys1","dyinv","mulAdd","jmulAdd","_precompute","negate","zinv","zinv2","ay","pz2","z2","h2","h3","nz","jx","jy","jz","jz4","jyd","jx2","jyd2","jyd4","t1","t2","dny","_zeroDbl","_threeDbl","_dbl","xx","yy","yyyy","yyyy8","c8","gamma","alpha","beta4","beta8","ggamma8","jy2","jxd4","jyd8","trpl","zz","mm","ee","yyu4","kbase","z3","pz3","eqXToP","zs","xc","MontCurve","i4","a24","aa","bb","diffAdd","da","cb","jumlAdd","other","EdwardsCurve","twisted","mOneA","dd","oneC","edwards","_mulA","_mulC","lhs","pointFromY","_extDbl","nt","_projDbl","_extAdd","_projAdd","zi","secp256k1","curves","PresetCurve","defineCurve","HmacDRBG","predResist","minEntropy","_reseed","reseedInterval","entropy","entropyEnc","nonce","nonceEnc","pers","persEnc","hmacDrbg","seed","_hmac","kmac","reseed","addEnc","KeyPair","ec","priv","pub","_importPrivate","privEnc","_importPublic","pubEnc","fromPublic","fromPrivate","getPublic","getPrivate","derive","verify","signature","Signature","_importDER","recoveryParam","Position","place","getLength","initial","octetLen","rmPadding","constructLength","octets","slen","toDER","backHalf","EC","nh","keyPair","keyFromPrivate","keyFromPublic","genKeyPair","drbg","ns2","_truncateToN","truncOnly","bkey","ns1","kp","kpX","canonical","sinv","recoverPubKey","isYOdd","isSecondKey","rInv","getKeyRecoveryParam","Q","Qprime","eddsa","params","_secret","secret","isPoint","_pub","_pubBytes","fromSecret","encodePoint","lastIx","encodingLength","decodeInt","privBytes","message","sig","getSecret","pubBytes","_R","_S","_Rencoded","Rencoded","_Sencoded","Sencoded","encodeInt","toBytes","toUpperCase","EDDSA","pointClass","keyFromSecret","hashInt","messagePrefix","s_","makeSignature","SG","normed","xIsOdd","elliptic","$assign","assign","objectAssign","alphabet","chr","FAILS_ON_PRIMITIVES","__decorate","decorators","Reflect","decorate","arrayEquals","hexLookup","buildHexLookup","dec","arrayToHex","rv","hexToArray","secureRandom","didWarn","isInstanceOf","someClass","className","instanceClass","isAlienInstance","instanceClassName","warn","equals","baseCharset","lookup","urlSafe","byteRemainder","mainLength","charset","parts","_i","decode","_i2","nativeUrl","searchParams","pathname","href","URLSearchParams","username","maxInt","regexNonASCII","regexSeparators","OVERFLOW_ERROR","stringFromCharCode","digitToBasic","digit","adapt","numPoints","firstTime","baseMinusTMin","currentValue","inputLength","ucs2decode","bias","basicLength","handledCPCount","handledCPCountPlusOne","qMinusT","baseMinusT","USE_NATIVE_URL","getIterator","$fetch","Headers","URL_SEARCH_PARAMS","URL_SEARCH_PARAMS_ITERATOR","getInternalParamsState","plus","sequences","percentSequence","percentDecode","sequence","decodeURIComponent","deserialize","!","'","(",")","~","%20","serialize","encodeURIComponent","parseSearchParams","query","attributes","updateSearchParams","validateArgumentsLength","passed","required","URLSearchParamsIterator","URLSearchParamsConstructor","entryIterator","entryNext","updateURL","URLSearchParamsPrototype","append","getAll","found","entriesIndex","sliceIndex","callback","fetch","body","headers","EOF","web_urlSearchParams","getState","toASCII","label","encoded","labels","URLSearchParamsModule","NativeURL","getInternalSearchParamsState","getInternalURLState","INVALID_SCHEME","INVALID_HOST","INVALID_PORT","ALPHA","ALPHANUMERIC","DIGIT","HEX_START","OCT","DEC","HEX","FORBIDDEN_HOST_CODE_POINT","FORBIDDEN_HOST_CODE_POINT_EXCLUDING_PERCENT","LEADING_AND_TRAILING_C0_CONTROL_OR_SPACE","TAB_AND_NEW_LINE","parseHost","codePoints","parseIPv6","isSpecial","parseIPv4","percentEncode","C0ControlPercentEncodeSet","partsLength","numbers","part","ipv4","numbersSeen","ipv4Piece","swaps","swap","address","pieceIndex","compress","pointer","char","serializeHost","ignore0","unshift","ipv6","maxIndex","currStart","currLength","findLongestZeroSequence","fragmentPercentEncodeSet"," ","\"","<",">","`","pathPercentEncodeSet","#","?","{","}","userinfoPercentEncodeSet","/",":",";","=","@","[","\\","]","^","|","specialSchemes","ftp","file","http","https","wss","scheme","includesCredentials","password","cannotHaveUsernamePasswordPort","cannotBeABaseURL","isWindowsDriveLetter","normalized","startsWithWindowsDriveLetter","shortenURLsPath","pathSize","isSingleDot","segment","SCHEME_START","SCHEME","NO_SCHEME","SPECIAL_RELATIVE_OR_AUTHORITY","PATH_OR_AUTHORITY","RELATIVE","RELATIVE_SLASH","SPECIAL_AUTHORITY_SLASHES","SPECIAL_AUTHORITY_IGNORE_SLASHES","AUTHORITY","HOST","HOSTNAME","PORT","FILE","FILE_SLASH","FILE_HOST","PATH_START","PATH","CANNOT_BE_A_BASE_URL_PATH","QUERY","FRAGMENT","parseURL","stateOverride","bufferCodePoints","failure","seenAt","seenBracket","seenPasswordToken","fragment","codePoint","encodedCodePoints","URLConstructor","baseState","urlString","searchParamsState","serializeURL","origin","getOrigin","getProtocol","getUsername","getPassword","getHost","hostname","getHostname","getPort","getPathname","getSearch","getSearchParams","getHash","URLPrototype","accessorDescriptor","nativeCreateObjectURL","createObjectURL","nativeRevokeObjectURL","revokeObjectURL","blob","XMLHttpRequest","support","Blob","formData","isDataView","viewClasses","isArrayBufferView","normalizeName","normalizeValue","iteratorFor","items","consumed","bodyUsed","fileReaderReady","reader","onload","onerror","readBlobAsArrayBuffer","FileReader","readAsArrayBuffer","readBlobAsText","readAsText","readArrayBufferAsText","chars","bufferClone","Body","_initBody","_bodyInit","_bodyText","_bodyBlob","FormData","_bodyFormData","_bodyArrayBuffer","rejected","json","oldValue","thisArg","normalizeMethod","upcased","Request","credentials","signal","referrer","cache","reParamSearch","getTime","reQueryString","form","parseHeaders","rawHeaders","substr","line","Response","bodyInit","statusText","response","redirectStatuses","redirect","DOMException","stack","request","aborted","xhr","abortXhr","abort","fixUrl","getAllResponseHeaders","responseURL","responseText","ontimeout","onabort","withCredentials","responseType","setRequestHeader","onreadystatechange","readyState","removeEventListener","send","polyfill","factory","is_bytes","_heap_init","heapSize","_heap_write","hpos","dpos","dlen","hlen","wlen","joinBytes","totalLenght","reduce","sum","cursor","IllegalArgumentError","SecurityError","AES_asm","gexp3","glog3","ginit_done","gmul","aes_sbox","aes_sinv","aes_enc","aes_dec","aes_init_done","aes_init","_s","ginv","ginit","foreign","asm","stdlib","S0","S1","S2","S3","I0","I1","I2","I3","N0","N1","N2","N3","M0","M1","M2","M3","H0","H1","H2","H3","HEAP","DATA","_core","x0","x3","t3","y0","y3","_ecb_enc","_ecb_dec","_cbc_enc","_cbc_dec","_cfb_enc","_cfb_dec","_ofb","_ctr","_gcm_mac","z0","z1","set_rounds","set_state","s0","s3","set_iv","i0","i1","i2","i3","set_nonce","n0","n1","n2","n3","set_mask","m0","m1","m2","m3","set_counter","c0","c3","get_state","get_iv","gcm_init","cipher","_cipher_modes","mac","_mac_modes","set_key","ks","k0","k3","k4","k5","k6","k7","ekeys","dkeys","rcon","jj","ENC","ECB","CBC","CFB","OFB","CTR","MAC","GCM","HEAP_DATA","AES_CBC","iv","AES_Encrypt_process","AES_Encrypt_finish","AES_Decrypt_process","AES_Decrypt_finish","encrypt","decrypt","keylen","keyview","ivview","amode","rpos","plen","pad","pcheck","bigint_asm","SP","HEAP32","sreset","salloc","sfree","cp","lA","lR","lB","tst","r0","r1","r3","r4","r5","r6","r7","r8","r9","r10","r11","r12","r13","r14","r15","Ai","Bj","Rk","Aj","lN","lD","u0","v0","vh","vl","qh","ql","rl","mredc","uh","ul","BigNumber_extGCD","sa","sb","a_cmp_b","compare","xi","BigNumber","ONE","xj","ZERO","yi","yj","ly","remainder","quotient","subtract","clamp","require","_bigint_asm","_bigint_stdlib","_bigint_heap","_BigNumber_ZERO_limbs","limbs","bitlen","bytelen","clamped","sliced","slimbs","alimbs","alimbcnt","blimbs","blimbcnt","rbitlen","rlimbcnt","rsign","rof","abitlen","asign","bbitlen","bsign","pA","pB","pR","qlimbcnt","pQ","rounds","fromConfig","Modulus","square","paranoia","s5","s17","l3","l5","l17","isMillerRabinProbablePrime","utf8","string_to_bytes","absnum","bn","extGCD","fromNumber","comodulus","_this5","Number_extGCD","coefficient","comodulusRemainder","comodulusRemainderSquare","_Montgomery_reduce","g2","gn","nlimbs","nlimbcnt","pN","rnds8","rng","uuid","REGEX","byteToHex","v4","rnds","WebSocket","MozWebSocket","browser","CancelError","IdentityError","SessionError","session"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;oBAAA,IAAIA,EAAQ,SAAUC,GACpB,OAAOA,GAAMA,EAAGC,MAAQA,MAAQD,GAIlCE,EAEEH,EAA2B,iBAAdI,YAA0BA,aACvCJ,EAAuB,iBAAVK,QAAsBA,SAEnCL,EAAqB,iBAARM,MAAoBA,OACjCN,EAAuB,iBAAVG,GAAsBA,IAEnC,WAAe,OAAOI,KAAtB,IAAoCC,SAAS,cAATA,QCbtCC,EAAiB,SAAUC,GACzB,IACE,QAASA,IACT,MAAOC,GACP,OAAO,ICDXC,GAHYC,GAGY,WAEtB,OAA8E,GAAvEC,OAAOC,eAAe,GAAI,EAAG,CAAEC,IAAK,WAAc,OAAO,KAAQ,WCJtEC,EAAwB,GAAGC,qBAE3BC,EAA2BL,OAAOK,yBAGlCC,EAAcD,IAA6BF,EAAsBI,KAAK,CAAEC,EAAG,GAAK;KAIxEF,EAAc,SAA8BG,GACtD,IAAIC,EAAaL,EAAyBZ,KAAMgB,GAChD,QAASC,GAAcA,EAAWC,YAChCR,MCbJS,EAAiB,SAAUC,EAAQC,GACjC,MAAO,CACLH,aAAuB,EAATE,GACdE,eAAyB,EAATF,GAChBG,WAAqB,EAATH,GACZC,MAAOA,ICLPG,EAAW,GAAGA,SAElBC,EAAiB,SAAU/B,GACzB,OAAO8B,EAASV,KAAKpB,GAAIgC,MAAM,GAAI,ICFjCC,EAAUC,EAEVC,EAAQ,GAAGA,MAGfC,EANYxB,GAMW,WAGrB,OAAQC,OAAO,KAAKI,qBAAqB,MACtC,SAAUjB,GACb,MAAsB,UAAfiC,EAAQjC,GAAkBmC,EAAMf,KAAKpB,EAAI,IAAMa,OAAOb,IAC3Da,OCVJwB,EAAiB,SAAUrC,GACzB,GAAUsC,MAANtC,EAAiB,MAAMuC,UAAU,wBAA0BvC,GAC/D,OAAOA,GCHLwC,EAAgB5B,EAChByB,EAAyBH,EAE7BO,EAAiB,SAAUzC,GACzB,OAAOwC,EAAcH,EAAuBrC,KCL9C0C,EAAiB,SAAU1C;AACzB,MAAqB,iBAAPA,EAAyB,OAAPA,EAA4B,mBAAPA,GCDnD0C,EAAW9B,EAMf+B,EAAiB,SAAUC,EAAOC,GAChC,IAAKH,EAASE,GAAQ,OAAOA,EAC7B,IAAIE,EAAIC,EACR,GAAIF,GAAoD,mBAAxBC,EAAKF,EAAMd,YAA4BY,EAASK,EAAMD,EAAG1B,KAAKwB,IAAS,OAAOG,EAC9G,GAAmC,mBAAvBD,EAAKF,EAAMI,WAA2BN,EAASK,EAAMD,EAAG1B,KAAKwB,IAAS,OAAOG,EACzF,IAAKF,GAAoD,mBAAxBC,EAAKF,EAAMd,YAA4BY,EAASK,EAAMD,EAAG1B,KAAKwB,IAAS,OAAOG,EAC/G,MAAMR,UAAU,4CCZdF,EAAyBzB,EAI7BqC,EAAiB,SAAUC,GACzB,OAAOrC,OAAOwB,EAAuBa,KCLnCD,EAAWrC,EAEXuC,EAAiB,GAAGA,eAExBC,GAAiBvC,OAAOwC,QAAU,SAAgBrD,EAAIsD,GACpD,OAAOH,EAAe/B,KAAK6B,EAASjD,GAAKsD;ECJvCZ,GAAWR,EAEXqB,GAHS3C,EAGS2C,SAElBC,GAASd,GAASa,KAAab,GAASa,GAASE,eAErDC,GAAiB,SAAU1D,GACzB,OAAOwD,GAASD,GAASE,cAAczD,GAAM,ICN3CyD,GAAgBE,GAGpBC,IALkBhD,IACNsB,GAI4B,WAEtC,OAEQ,GAFDrB,OAAOC,eAAe2C,GAAc,OAAQ,IAAK,CACtD1C,IAAK,WAAc,OAAO,KACzB8C,KCTDC,GAAclD,EACdmD,GAA6B7B,EAC7BT,GAA2BkC,EAC3BlB,GAAkBuB,EAClBrB,GAAcsB,EACdb,GAAMc,GACNC,GAAiBC,GAGjBC,GAA4BxD,OAAOK,6BAI3B4C,GAAcO,GAA4B,SAAkCC,EAAGC,GAGzF,GAFAD,EAAI7B,GAAgB6B,GACpBC,EAAI5B,GAAY4B,GAAG,GACfJ,GAAgB,IAClB,OAAOE,GAA0BC,EAAGC,GACpC,MAAO7D,IACT,GAAI0C,GAAIkB,EAAGC,GAAI,OAAO9C,IAA0BsC,GAA2BS,EAAEpD,KAAKkD,EAAGC,GAAID,EAAEC,eCnBzF7B,GAAW9B,EAEf6D,GAAiB,SAAUzE,GACzB,IAAK0C,GAAS1C,GACZ,MAAMuC,UAAUmC,OAAO1E,GAAM,qBAC7B,OAAOA;ECLP8D,GAAclD,EACduD,GAAiBjC,GACjBuC,GAAWd,GACXhB,GAAcqB,EAGdW,GAAkB9D,OAAOC,oBAIjBgD,GAAca,GAAkB,SAAwBL,EAAGC,EAAGK,GAIxE,GAHAH,GAASH,GACTC,EAAI5B,GAAY4B,GAAG,GACnBE,GAASG,GACLT,GAAgB,IAClB,OAAOQ,GAAgBL,EAAGC,EAAGK,GAC7B,MAAOlE,IACT,GAAI,QAASkE,GAAc,QAASA,EAAY,MAAMrC,UAAU,2BAEhE,MADI,UAAWqC,IAAYN,EAAEC,GAAKK,EAAWjD,OACtC2C,GCnBT,IACIO,GAAuB3C,GACvBT,GAA2BkC,EAE/BmB,GAJkBlE,EAIa,SAAUmE,EAAQzB,EAAK3B,GACpD,OAAOkD,GAAqBL,EAAEO,EAAQzB,EAAK7B,GAAyB,EAAGE,KACrE,SAAUoD,EAAQzB,EAAK3B,GAEzB,OADAoD,EAAOzB,GAAO3B,EACPoD,mBCRL7E,GAASU,EACTkE,GAA8B5C,GAElC8C,GAAiB,SAAU1B,EAAK3B,GAC9B,IACEmD,GAA4B5E,GAAQoD,EAAK3B,GACzC,MAAOjB,GACPR,GAAOoD,GAAO3B,EACd,OAAOA,GCPPqD,GAAY9C,GAEZ+C,GAAS,qBAGbC,GANatE,EAIMqE,KAAWD,GAAUC,GAAQ,ICJ5CE,GAAQvE,GAERwE,GAAmB7E,SAASuB;CAGE,mBAAvBqD,GAAME,gBACfF,GAAME,cAAgB,SAAUrF,GAC9B,OAAOoF,GAAiBhE,KAAKpB,SAIjCqF,GAAiBF,GAAME,cCVnBA,GAAgBnD,GAEhBoD,GAHS1E,EAGQ0E,QAErBC,GAAoC,mBAAZD,IAA0B,cAAcE,KAAKH,GAAcC,qBCJ/EH,GAAQjD,IAEXuD,WAAiB,SAAUnC,EAAK3B,GAC/B,OAAOwD,GAAM7B,KAAS6B,GAAM7B,QAAiBhB,IAAVX,EAAsBA,EAAQ,MAChE,WAAY,IAAI+D,KAAK,CACtBC,QAAS,SACTC,KAAyB,SACzBC,UAAW,yCCRb,ICWIC,GAAK/E,GAAKqC,GDXV2C,GAAK,EACLC,GAAU/F,KAAKgG,SAEnBC,GAAiB,SAAU5C,GACzB,MAAO,UAAYoB,YAAepC,IAARgB,EAAoB,GAAKA,GAAO,QAAUyC,GAAKC,IAASlE,SAAS;EEJzFqE,GAASvF,WACTsF,GAAMhE,GAENkE,GAAOD,GAAO,QAElBE,GAAiB,SAAU/C,GACzB,OAAO8C,GAAK9C,KAAS8C,GAAK9C,GAAO4C,GAAI5C,KCNvCgD,GAAiB,GFAbC,GAAkB3F,GAElB8B,GAAWiB,EACXmB,GAA8Bd,GAC9BwC,GAAYvC,GACZkC,GAASjC,GACTmC,GAAYjC,GACZkC,GAAaG,GAEbC,GAA6B,6BAC7BpB,GATSpD,EASQoD,QAgBrB,GAAIiB,IAAmBJ,GAAOQ,MAAO,CACnC,IAAIxB,GAAQgB,GAAOQ,QAAUR,GAAOQ,MAAQ,IAAIrB,IAC5CsB,GAAQzB,GAAMpE,IACd8F,GAAQ1B,GAAM/B,IACd0D,GAAQ3B,GAAMW,IAClBA,GAAM,SAAU9F,EAAI+G,GAClB,GAAIF,GAAMzF,KAAK+D,GAAOnF,GAAK,MAAM,IAAIuC,UAAUmE,IAG/C,OAFAK,EAASC,OAAShH,EAClB8G,GAAM1F,KAAK+D,GAAOnF,EAAI+G,GACfA,GAEThG,GAAM,SAAUf,GACd,OAAO4G,GAAMxF,KAAK+D,GAAOnF,IAAO,IAElCoD,GAAM,SAAUpD,GACd,OAAO6G,GAAMzF,KAAK+D,GAAOnF,QAEtB,CACL,IAAIiH,GAAQZ,GAAU,SACtBC,GAAWW,KAAS,EACpBnB,GAAM,SAAU9F,EAAI+G;AAClB,GAAIP,GAAUxG,EAAIiH,IAAQ,MAAM,IAAI1E,UAAUmE,IAG9C,OAFAK,EAASC,OAAShH,EAClB8E,GAA4B9E,EAAIiH,GAAOF,GAChCA,GAEThG,GAAM,SAAUf,GACd,OAAOwG,GAAUxG,EAAIiH,IAASjH,EAAGiH,IAAS,IAE5C7D,GAAM,SAAUpD,GACd,OAAOwG,GAAUxG,EAAIiH,SAIzBC,GAAiB,CACfpB,IAAKA,GACL/E,IAAKA,GACLqC,IAAKA,GACL+D,QAnDY,SAAUnH,GACtB,OAAOoD,GAAIpD,GAAMe,GAAIf,GAAM8F,GAAI9F,EAAI,KAmDnCoH,UAhDc,SAAUC,GACxB,OAAO,SAAUrH,GACf,IAAI2G,EACJ,IAAKjE,GAAS1C,KAAQ2G,EAAQ5F,GAAIf,IAAKsH,OAASD,EAC9C,MAAM9E,UAAU,0BAA4B8E,EAAO,aACnD,OAAOV,KGtBTzG,GAASU,EACTkE,GAA8B5C,GAC9BkB,GAAMO,GACNqB,GAAYhB,GACZqB,GAAgBpB,GAGhBsD,GAFsBrD,GAEiBnD,IACvCyG,GAHsBtD,GAGqBiD,QAC3CM,GAAW/C,OAAOA,QAAQvC,MAAM,WAEnCuF,WAAiB,SAAUpD,EAAGhB,EAAK3B,EAAOgG;AACzC,IAGIhB,EAHAiB,IAASD,KAAYA,EAAQC,OAC7BC,IAASF,KAAYA,EAAQnG,WAC7BsG,IAAcH,KAAYA,EAAQG,YAElB,mBAATnG,IACS,iBAAP2B,GAAoBF,GAAIzB,EAAO,SACxCmD,GAA4BnD,EAAO,OAAQ2B,IAE7CqD,EAAQa,GAAqB7F,IAClBoG,SACTpB,EAAMoB,OAASN,GAASO,KAAmB,iBAAP1E,EAAkBA,EAAM,MAG5DgB,IAAMpE,IAIE0H,GAEAE,GAAexD,EAAEhB,KAC3BuE,GAAS,UAFFvD,EAAEhB,GAIPuE,EAAQvD,EAAEhB,GAAO3B,EAChBmD,GAA4BR,EAAGhB,EAAK3B,IATnCkG,EAAQvD,EAAEhB,GAAO3B,EAChBqD,GAAU1B,EAAK3B,KAUrBpB,SAAS0H,UAAW,YAAY,WACjC,MAAsB,mBAAR3H,MAAsBiH,GAAiBjH,MAAMyH,QAAU1C,GAAc/E,SCtCrF,IAEA4H,GAFatH,ECATsH,GAAOtH,GACPV,GAASgC,EAETiG,GAAY,SAAUC,GACxB,MAA0B,mBAAZA,EAAyBA,OAAW9F,GAGpD+F,GAAiB,SAAUC,EAAWC;AACpC,OAAOC,UAAUC,OAAS,EAAIN,GAAUD,GAAKI,KAAeH,GAAUjI,GAAOoI,IACzEJ,GAAKI,IAAcJ,GAAKI,GAAWC,IAAWrI,GAAOoI,IAAcpI,GAAOoI,GAAWC,UCTvFG,GAAOzI,KAAKyI,KACZC,GAAQ1I,KAAK0I,MAIjBC,GAAiB,SAAU1F,GACzB,OAAO2F,MAAM3F,GAAYA,GAAY,GAAKA,EAAW,EAAIyF,GAAQD,IAAMxF,ICNrE0F,GAAYhI,GAEZkI,GAAM7I,KAAK6I,IAIfC,GAAiB,SAAU7F,GACzB,OAAOA,EAAW,EAAI4F,GAAIF,GAAU1F,GAAW,kBAAoB,GCPjE0F,GAAYhI,GAEZoI,GAAM/I,KAAK+I,IACXF,GAAM7I,KAAK6I,IAKfG,GAAiB,SAAUC,EAAOT,GAChC,IAAIU,EAAUP,GAAUM,GACxB,OAAOC,EAAU,EAAIH,GAAIG,EAAUV,EAAQ,GAAKK,GAAIK,EAASV,ICV3DhG,GAAkB7B,EAClBmI,GAAW7G,GACX+G,GAAkBtF,GAGlByF,GAAe,SAAUC,GAC3B,OAAO,SAAUC,EAAOC,EAAIC,GAC1B,IAGI7H,EAHA2C,EAAI7B,GAAgB6G,GACpBb,EAASM,GAASzE,EAAEmE,QACpBS,EAAQD,GAAgBO,EAAWf,GAIvC,GAAIY,GAAeE,GAAMA,GAAI,KAAOd,EAASS,GAG3C,IAFAvH,EAAQ2C,EAAE4E,OAEGvH,EAAO,OAAO;MAEtB,KAAM8G,EAASS,EAAOA,IAC3B,IAAKG,GAAeH,KAAS5E,IAAMA,EAAE4E,KAAWK,EAAI,OAAOF,GAAeH,GAAS,EACnF,OAAQG,IAAgB,IAI9BI,GAAiB,CAGfC,SAAUN,IAAa,GAGvBO,QAASP,IAAa,IC9BpBhG,GAAMxC,GACN6B,GAAkBP,EAClByH,GAAUhG,GAAuCgG,QACjDrD,GAAatC,GAEjB4F,GAAiB,SAAU7E,EAAQ8E,GACjC,IAGIvG,EAHAgB,EAAI7B,GAAgBsC,GACpB+E,EAAI,EACJC,EAAS,GAEb,IAAKzG,KAAOgB,GAAIlB,GAAIkD,GAAYhD,IAAQF,GAAIkB,EAAGhB,IAAQyG,EAAOrE,KAAKpC,GAEnE,KAAOuG,EAAMpB,OAASqB,GAAO1G,GAAIkB,EAAGhB,EAAMuG,EAAMC,SAC7CH,GAAQI,EAAQzG,IAAQyG,EAAOrE,KAAKpC,IAEvC,OAAOyG,GCdTC,GAAiB,CACf,cACA,iBACA,gBACA,uBACA,iBACA,WACA,WCREC,GAAqBrJ,GAGrB0F,GAFcpE,GAEWgI,OAAO,SAAU,kBAKlCrJ,OAAOsJ,qBAAuB,SAA6B7F;AACrE,OAAO2F,GAAmB3F,EAAGgC,oBCRnBzF,OAAOuJ,sBCDnB,ICMIC,GAAO1E,GDLP2E,GAA4BpI,GAC5BqI,GAA8B5G,GAC9Bc,GAAWT,GAGfwG,GANiB5J,GAMW,UAAW,YAAc,SAAiBZ,GACpE,IAAIoG,EAAOkE,GAA0B9F,EAAEC,GAASzE,IAC5CoK,EAAwBG,GAA4B/F,EACxD,OAAO4F,EAAwBhE,EAAK8D,OAAOE,EAAsBpK,IAAOoG,GETtEhD,GAAMxC,GACN4J,GAAUtI,GACVuI,GAAiC9G,EACjCkB,GAAuBb,GAE3B0G,GAAiB,SAAUC,EAAQ5C,GAIjC,IAHA,IAAI3B,EAAOoE,GAAQzC,GACfjH,EAAiB+D,GAAqBL,EACtCtD,EAA2BuJ,GAA+BjG,EACrDsF,EAAI,EAAGA,EAAI1D,EAAKqC,OAAQqB,IAAK,CACpC,IAAIxG,EAAM8C,EAAK0D,GACV1G,GAAIuH,EAAQrH,IAAMxC,EAAe6J,EAAQrH,EAAKpC,EAAyB6G,EAAQzE,MCXpF9C,GAAQI,EAERgK,GAAc,kBAEdC,GAAW,SAAUC,EAASC,GAChC,IAAIpJ,EAAQqJ,GAAKC,GAAUH,IAC3B,OAAOnJ,GAASuJ,IACZvJ,GAASwJ,KACW,mBAAbJ,EAA0BvK,GAAMuK,KACrCA,IAGJE,GAAYJ,GAASI,UAAY,SAAUG,GAC7C,OAAO1G,OAAO0G,GAAQC,QAAQT,GAAa,KAAKU;EAG9CN,GAAOH,GAASG,KAAO,GACvBG,GAASN,GAASM,OAAS,IAC3BD,GAAWL,GAASK,SAAW,IAEnCK,GAAiBV,GCpBb3K,GAASU,EACTM,GAA2BgB,EAA2DsC,EACtFM,GAA8BnB,GAC9B6H,GAAWxH,WACXgB,GAAYf,GACZyG,GAA4BxG,GAC5B2G,GAAWzG,GAgBfqH,GAAiB,SAAU9D,EAASI,GAClC,IAGY4C,EAAQrH,EAAKoI,EAAgBC,EAAgBpK,EAHrDqK,EAASjE,EAAQgD,OACjBkB,EAASlE,EAAQzH,OACjB4L,EAASnE,EAAQoE,KASrB,GANEpB,EADEkB,EACO3L,GACA4L,EACA5L,GAAO0L,IAAW5G,GAAU4G,EAAQ,KAEnC1L,GAAO0L,IAAW,IAAI3D,UAEtB,IAAK3E,KAAOyE,EAAQ,CAQ9B,GAPA4D,EAAiB5D,EAAOzE,GAGtBoI,EAFE/D,EAAQG,aACVvG,EAAaL,GAAyByJ,EAAQrH,KACf/B,EAAWI,MACpBgJ,EAAOrH,IACtBuH,GAASgB,EAASvI,EAAMsI,GAAUE,EAAS,IAAM,KAAOxI,EAAKqE,EAAQqE,cAE5C1J,IAAnBoJ,EAA8B,CAC3C,UAAWC,UAA0BD,EAAgB,SACrDhB,GAA0BiB,EAAgBD,IAGxC/D,EAAQsE,MAASP,GAAkBA,EAAeO,OACpDnH,GAA4B6G,EAAgB,QAAQ,GAGtDH,GAASb,EAAQrH,EAAKqI,EAAgBhE;ECjD1CuE,GAFiBtL,GAEW,YAAa,cAAgB,GJDrDuL,GAAYjK,GAEZkK,GAHSxL,EAGQwL,QACjBC,GAAWD,IAAWA,GAAQC,SAC9BC,GAAKD,IAAYA,GAASC,GAG1BA,GAEF3G,IADA0E,GAAQiC,GAAGnK,MAAM,MACD,GAAK,EAAI,EAAIkI,GAAM,GAAKA,GAAM,GACrC8B,OACT9B,GAAQ8B,GAAU9B,MAAM,iBACVA,GAAM,IAAM,MACxBA,GAAQ8B,GAAU9B,MAAM,oBACb1E,GAAU0E,GAAM,QKoC3BkC,GLhCJC,GAAiB7G,KAAYA,GMlBzB8G,GAAa7L,GACbJ,GAAQ0B,EAGZwK,KAAmB7L,OAAOuJ,wBAA0B5J,IAAM,WACxD,IAAImM,EAASC,SAGb,OAAQlI,OAAOiI,MAAa9L,OAAO8L,aAAmBC,UAEnDA,OAAOX,MAAQQ,IAAcA,GAAa,MCR/CI,GAFoBjM,KAGdgM,OAAOX,MACkB,iBAAnBW,OAAOE,SCLf7K,GAAUrB,EAKdmM,GAAiBC,MAAMD,SAAW,SAAiBE;AACjD,MAAuB,SAAhBhL,GAAQgL,ICNbhD,GAAqBrJ,GACrBoJ,GAAc9H,GAKlBgL,GAAiBrM,OAAOuF,MAAQ,SAAc9B,GAC5C,OAAO2F,GAAmB3F,EAAG0F,KCN3BnF,GAAuB3C,GACvBuC,GAAWd,GACXuJ,GAAalJ,GAKjBmJ,GARkBvM,EAQaC,OAAOuM,iBAAmB,SAA0B9I,EAAG+I,GACpF5I,GAASH,GAKT,IAJA,IAGIhB,EAHA8C,EAAO8G,GAAWG,GAClB5E,EAASrC,EAAKqC,OACdS,EAAQ,EAELT,EAASS,GAAOrE,GAAqBL,EAAEF,EAAGhB,EAAM8C,EAAK8C,KAAUmE,EAAW/J,IACjF,OAAOgB,GCbTgJ,GAFiB1M,GAEW,WAAY,mBNFpC6D,GAAW7D,GACXwM,GAAmBlL,GACnB8H,GAAcrG,GACd2C,GAAatC,GACbsJ,GAAOrJ,GACPP,GAAwBQ,GAOxBqJ,GANYnJ,GAMS,YAErBoJ,GAAmB,aAEnBC,GAAY,SAAUC,GACxB,MAAOC,WAAmBD,EAAnBC,KAAAA,WAmCLC,GAAkB,WACpB,IAEErB,GAAkBhJ,SAASsK,QAAU,IAAIC,cAAc,YACvD,MAAOpN,IA1BoB,IAIzBqN,EAFAC,EAyBJJ,GAAkBrB,GApCY,SAAUA,GACxCA,EAAgB0B,MAAMR,GAAU;AAChClB,EAAgB2B,QAChB,IAAIC,EAAO5B,EAAgB6B,aAAavN,OAExC,OADA0L,EAAkB,KACX4B,EA+B6BE,CAA0B9B,MAzB1DyB,EAAStK,GAAsB,WAG5B4K,MAAMC,QAAU,OACvBjB,GAAKkB,YAAYR,GAEjBA,EAAOS,IAAM/J,OALJ,gBAMTqJ,EAAiBC,EAAOU,cAAcnL,UACvBoL,OACfZ,EAAeE,MAAMR,GAAU,sBAC/BM,EAAeG,QACRH,EAAea,GAgBtB,IADA,IAAInG,EAASuB,GAAYvB,OAClBA,YAAiBmF,GAAyB,UAAE5D,GAAYvB,IAC/D,OAAOmF,SAGEL,KAAY,MAIvBsB,GAAiBhO,OAAOiO,QAAU,SAAgBxK,EAAG+I,GACnD,IAAItD,EAQJ,OAPU,OAANzF,GACFkJ,GAA0B,UAAI/I,GAASH,GACvCyF,EAAS,IAAIyD,GACbA,GAA0B,UAAI,KAE9BzD,EAAOwD,IAAYjJ,GACdyF,EAAS6D,UACMtL,IAAf+K,EAA2BtD,EAASqD,GAAiBrD,EAAQsD;QO3ElE5K,GAAkB7B,EAClBmO,GAAuB7M,GAAsDsC,EAE7E1C,GAAW,GAAGA,SAEdkN,GAA+B,iBAAV5O,QAAsBA,QAAUS,OAAOsJ,oBAC5DtJ,OAAOsJ,oBAAoB/J,QAAU,QAWtB,SAA6BJ,GAC9C,OAAOgP,IAAoC,mBAArBlN,GAASV,KAAKpB,GAVjB,SAAUA,GAC7B,IACE,OAAO+O,GAAqB/O,GAC5B,MAAOU,GACP,OAAOsO,GAAYhN,SAOjBiN,CAAejP,GACf+O,GAAqBtM,GAAgBzC,KCrB3C,IAAIE,GAASU,EACTuF,GAASjE,WACTkB,GAAMO,GACNuC,GAAMlC,GACNkL,GAAgBjL,GAChBkL,GAAoBjL,GAEpBkL,GAAwBjJ,GAAO,OAC/ByG,GAAS1M,GAAO0M,OAChByC,GAAwBF,GAAoBvC,GAASA,IAAUA,GAAO0C,eAAiBpJ,GAE3FqJ,GAAiB,SAAUC,GAOvB,OANGpM,GAAIgM,GAAuBI,KAAWN,IAAuD,iBAA/BE,GAAsBI,MACnFN,IAAiB9L,GAAIwJ,GAAQ4C,GAC/BJ,GAAsBI,GAAQ5C,GAAO4C,GAErCJ,GAAsBI,GAAQH,GAAsB,UAAYG,IAE3DJ,GAAsBI;QClB7BD,GAAkB3O,QAEV2O,GCFZ,IAAIrH,GAAOtH,GACPwC,GAAMlB,GACNuN,GAA+B9L,GAC/B7C,GAAiBkD,GAA+CQ,EAEpEkL,GAAiB,SAAUC,GACzB,IAAI/C,EAAS1E,GAAK0E,SAAW1E,GAAK0E,OAAS,IACtCxJ,GAAIwJ,EAAQ+C,IAAO7O,GAAe8L,EAAQ+C,EAAM,CACnDhO,MAAO8N,GAA6BjL,EAAEmL,MCRtC7O,GAAiBF,GAA+C4D,EAChEpB,GAAMlB,GAGN0N,GAFkBjM,GAEc,eAEpCkM,GAAiB,SAAU7P,EAAI8P,EAAKhE,GAC9B9L,IAAOoD,GAAIpD,EAAK8L,EAAS9L,EAAKA,EAAGiI,UAAW2H,KAC9C9O,GAAed,EAAI4P,GAAe,CAAEhO,cAAc,EAAMD,MAAOmO,KCRnE3H,GAAiB,SAAUnI,GACzB,GAAiB,mBAANA,EACT,MAAMuC,UAAUmC,OAAO1E,GAAM,sBAC7B,OAAOA,GCHPmI,GAAYvH,GAGhBmP,GAAiB,SAAUjN,EAAIkN,EAAMvH,GAEnC,GADAN,GAAUrF,QACGR,IAAT0N,EAAoB,OAAOlN,EAC/B,OAAQ2F,GACN,KAAK,EAAG,OAAO,WACb,OAAO3F,EAAG1B,KAAK4O,IAEjB,KAAK,EAAG,OAAO,SAAUnM;AACvB,OAAOf,EAAG1B,KAAK4O,EAAMnM,IAEvB,KAAK,EAAG,OAAO,SAAUA,EAAGoM,GAC1B,OAAOnN,EAAG1B,KAAK4O,EAAMnM,EAAGoM,IAE1B,KAAK,EAAG,OAAO,SAAUpM,EAAGoM,EAAGC,GAC7B,OAAOpN,EAAG1B,KAAK4O,EAAMnM,EAAGoM,EAAGC,IAG/B,OAAO,WACL,OAAOpN,EAAGqN,MAAMH,EAAMxH,aCrBtB9F,GAAW9B,EACXmM,GAAU7K,GAGVkO,GAFkBzM,GAEQ,WAI9B0M,GAAiB,SAAUC,EAAe7H,GACxC,IAAI8H,EASF,OARExD,GAAQuD,KAGM,mBAFhBC,EAAID,EAAcE,cAEaD,IAAMvD,QAASD,GAAQwD,EAAEtI,WAC/CvF,GAAS6N,IAEN,QADVA,EAAIA,EAAEH,OACUG,OAAIjO,GAH+CiO,OAAIjO,GAKlE,SAAWA,IAANiO,EAAkBvD,MAAQuD,GAAc,IAAX9H,EAAe,EAAIA,IClB5DgI,GAAO7P,GACP4B,GAAgBN,EAChBe,GAAWU,EACXoF,GAAW/E,GACXqM,GAAqBpM,GAErByB,GAAO,GAAGA,KAGV0D,GAAe,SAAU/B,GAC3B,IAAIqJ,EAAiB,GAARrJ,EACTsJ,EAAoB,GAARtJ,EACZuJ,EAAkB,GAARvJ,EACVwJ,EAAmB,GAARxJ,EACXyJ,EAAwB,GAARzJ,EAChB0J,EAAwB,GAAR1J,EAChB2J,EAAmB,GAAR3J,GAAayJ;CAC5B,OAAO,SAAUxH,EAAO2H,EAAYjB,EAAMkB,GASxC,IARA,IAOIvP,EAAOoI,EAPPzF,EAAIrB,GAASqG,GACbjJ,EAAOmC,GAAc8B,GACrB6M,EAAgBV,GAAKQ,EAAYjB,EAAM,GACvCvH,EAASM,GAAS1I,EAAKoI,QACvBS,EAAQ,EACR4F,EAASoC,GAAkBb,GAC3B1F,EAAS+F,EAAS5B,EAAOxF,EAAOb,GAAUkI,GAAaI,EAAgBjC,EAAOxF,EAAO,QAAKhH,EAExFmG,EAASS,EAAOA,IAAS,IAAI8H,GAAY9H,KAAS7I,KAEtD0J,EAASoH,EADTxP,EAAQtB,EAAK6I,GACiBA,EAAO5E,GACjC+C,GACF,GAAIqJ,EAAQ/F,EAAOzB,GAASa,OACvB,GAAIA,EAAQ,OAAQ1C,GACvB,KAAK,EAAG,OAAO,EACf,KAAK,EAAG,OAAO1F,EACf,KAAK,EAAG,OAAOuH,EACf,KAAK,EAAGxD,GAAKtE,KAAKuJ,EAAQhJ,QACrB,OAAQ0F,GACb,KAAK,EAAG,OAAO,EACf,KAAK,EAAG3B,GAAKtE,KAAKuJ,EAAQhJ,GAIhC,OAAOmP,GAAiB,EAAIF,GAAWC,EAAWA,EAAWlG,IAIjEyG,GAAiB,CAGfC,QAASjI,GAAa,GAGtBkI,IAAKlI,GAAa,GAGlBmI,OAAQnI,GAAa,GAGrBoI,KAAMpI,GAAa,GAGnBqI,MAAOrI,GAAa,GAGpBsI,KAAMtI,GAAa,GAGnBuI,UAAWvI,GAAa,GAGxBwI,UAAWxI,GAAa;ECrEtByI,GAAIjR,GACJV,GAASgC,EACTmG,GAAa1E,GAEbG,GAAcG,EACdiL,GAAgBhL,GAChBiL,GAAoB/K,GACpB5D,GAAQiG,EACRrD,GAAM0O,GACN/E,GAAUgF,GACVrP,GAAWsP,EACXvN,GAAWwN,GACXhP,GAAWiP,EACXzP,GAAkB0P,EAClBxP,GAAcyP,EACd3Q,GAA2B4Q,EAC3BC,GAAqBC,GACrBrF,GAAasF,GACblI,GAA4BmI,GAC5BC,GAA8BC,GAC9BpI,GAA8BqI,GAC9BnI,GAAiCoI,EACjChO,GAAuBiO,GACvB/O,GAA6BgP,EAC7BjO,GAA8BkO,GAC9BxH,GAAWyH,WACX9M,GAAS+M,WAET5M,GAAa6M,GACbjN,GAAMkN,GACN7D,GAAkB8D,GAClB5D,GAA+B6D,GAC/B5D,GAAwB6D,GACxB1D,GAAiB2D,GACjBC,GAAsBC,GACtBC,GAAWC,GAAwCvC,QAEnDwC,GAVYC,GAUO,UACnBC,GAAS,SAETC,GAAezE,GAAgB,eAC/B0E,GAAmBR,GAAoB3N,IACvCyB,GAAmBkM,GAAoBrM,UAAU2M,IACjDG,GAAkBrT,OAAgB,UAClCsT,GAAUjU,GAAO0M,OACjBwH,GAAa/L,GAAW,OAAQ,aAChCgM,GAAiC5J,GAA+BjG,EAChE8P,GAAuBzP,GAAqBL,EAC5C+P,GAA4B7B,GAA4BlO,EACxDgQ,GAA6BzQ,GAA2BS,EACxDiQ,GAAatO,GAAO,WACpBuO,GAAyBvO,GAAO,cAChCwO,GAAyBxO,GAAO,6BAChCyO,GAAyBzO,GAAO,6BAChCiJ,GAAwBjJ,GAAO,OAC/B0O,GAAU3U,GAAO2U,QAEjBC,IAAcD,KAAYA,GAAiB,YAAMA,GAAiB,UAAEE,UAGpEC,GAAsBlR,IAAetD,IAAM;AAC7C,OAES,GAFF8R,GAAmBgC,GAAqB,GAAI,IAAK,CACtDvT,IAAK,WAAc,OAAOuT,GAAqBhU,KAAM,IAAK,CAAEqB,MAAO,IAAKkC,MACtEA,KACD,SAAUS,EAAGC,EAAGK,GACnB,IAAIqQ,EAA4BZ,GAA+BH,GAAiB3P,GAC5E0Q,UAAkCf,GAAgB3P,GACtD+P,GAAqBhQ,EAAGC,EAAGK,GACvBqQ,GAA6B3Q,IAAM4P,IACrCI,GAAqBJ,GAAiB3P,EAAG0Q,IAEzCX,GAEAY,GAAO,SAAUC,EAAKC,GACxB,IAAIzI,EAAS8H,GAAWU,GAAO7C,GAAmB6B,GAAiB,WAOnE,OANAF,GAAiBtH,EAAQ,CACvBrF,KAAMyM,GACNoB,IAAKA,EACLC,YAAaA,IAEVtR,KAAa6I,EAAOyI,YAAcA,GAChCzI,GAGL0I,GAAWlG,GAAoB,SAAUnP,GAC3C,MAAoB,iBAANA,GACZ,SAAUA,GACZ,OAAOa,OAAOb,aAAemU,IAG3BxP,GAAkB,SAAwBL,EAAGC,EAAGK,GAC9CN,IAAM4P,IAAiBvP,GAAgB+P,GAAwBnQ,EAAGK,GACtEH,GAASH,GACT,IAAIhB,EAAMX,GAAY4B,GAAG,GAEzB,OADAE,GAASG,GACLxB,GAAIqR,GAAYnR,IACbsB,EAAWpD,YAIV4B,GAAIkB,EAAGuP,KAAWvP,EAAEuP,IAAQvQ,KAAMgB,EAAEuP,IAAQvQ,IAAO;AACvDsB,EAAa0N,GAAmB1N,EAAY,CAAEpD,WAAYC,GAAyB,GAAG,OAJjF2B,GAAIkB,EAAGuP,KAASS,GAAqBhQ,EAAGuP,GAAQpS,GAAyB,EAAG,KACjF6C,EAAEuP,IAAQvQ,IAAO,GAIV0R,GAAoB1Q,EAAGhB,EAAKsB,IAC9B0P,GAAqBhQ,EAAGhB,EAAKsB,IAGpC0Q,GAAoB,SAA0BhR,EAAG+I,GACnD5I,GAASH,GACT,IAAIiR,EAAa9S,GAAgB4K,GAC7BjH,EAAO8G,GAAWqI,GAAYrL,OAAOsL,GAAuBD,IAIhE,OAHA5B,GAASvN,GAAM,SAAU9C,GAClBQ,KAAe9C,GAAsBI,KAAKmU,EAAYjS,IAAMqB,GAAgBL,EAAGhB,EAAKiS,EAAWjS,OAE/FgB,GAOLtD,GAAwB,SAA8BM,GACxD,IAAIiD,EAAI5B,GAAYrB,GAAG,GACnBE,EAAagT,GAA2BpT,KAAKd,KAAMiE,GACvD,QAAIjE,OAAS4T,IAAmB9Q,GAAIqR,GAAYlQ,KAAOnB,GAAIsR,GAAwBnQ,QAC5E/C,IAAe4B,GAAI9C,KAAMiE,KAAOnB,GAAIqR,GAAYlQ,IAAMnB,GAAI9C,KAAMuT,KAAWvT,KAAKuT,IAAQtP,KAAK/C,IAGlG6C,GAA4B,SAAkCC,EAAGC,GACnE,IAAIvE,EAAKyC,GAAgB6B,GACrBhB,EAAMX,GAAY4B,GAAG,GACzB,GAAIvE,IAAOkU,KAAmB9Q,GAAIqR,GAAYnR,IAASF,GAAIsR,GAAwBpR,GAAnF,CACA,IAAI/B,EAAa8S,GAA+BrU,EAAIsD;CAIpD,OAHI/B,IAAc6B,GAAIqR,GAAYnR,IAAUF,GAAIpD,EAAI6T,KAAW7T,EAAG6T,IAAQvQ,KACxE/B,EAAWC,YAAa,GAEnBD,IAGLwN,GAAuB,SAA6BzK,GACtD,IAAIuF,EAAQ0K,GAA0B9R,GAAgB6B,IAClDyF,EAAS,GAIb,OAHA4J,GAAS9J,GAAO,SAAUvG,GACnBF,GAAIqR,GAAYnR,IAASF,GAAIkD,GAAYhD,IAAMyG,EAAOrE,KAAKpC,MAE3DyG,GAGLyL,GAAyB,SAA+BlR,GAC1D,IAAImR,EAAsBnR,IAAM4P,GAC5BrK,EAAQ0K,GAA0BkB,EAAsBf,GAAyBjS,GAAgB6B,IACjGyF,EAAS,GAMb,OALA4J,GAAS9J,GAAO,SAAUvG,IACpBF,GAAIqR,GAAYnR,IAAUmS,IAAuBrS,GAAI8Q,GAAiB5Q,IACxEyG,EAAOrE,KAAK+O,GAAWnR,OAGpByG,IAKJmF,KAcH1D,IAbA2I,GAAU,WACR,GAAI7T,gBAAgB6T,GAAS,MAAM5R,UAAU,+BAC7C,IAAI6S,EAAe5M,UAAUC,aAA2BnG,IAAjBkG,UAAU,GAA+B9D,OAAO8D,UAAU,SAA7BlG,EAChE6S,EAAMjP,GAAIkP,GACVM,EAAS,SAAU/T,GACjBrB,OAAS4T,IAAiBwB,EAAOtU,KAAKsT,GAAwB/S;AAC9DyB,GAAI9C,KAAMuT,KAAWzQ,GAAI9C,KAAKuT,IAASsB,KAAM7U,KAAKuT,IAAQsB,IAAO,GACrEH,GAAoB1U,KAAM6U,EAAK1T,GAAyB,EAAGE,KAG7D,OADImC,IAAegR,IAAYE,GAAoBd,GAAiBiB,EAAK,CAAEvT,cAAc,EAAMkE,IAAK4P,IAC7FR,GAAKC,EAAKC,KAGO,UAAG,YAAY,WACvC,OAAO7N,GAAiBjH,MAAM6U,OAGhC3J,GAAS2I,GAAS,iBAAiB,SAAUiB,GAC3C,OAAOF,GAAKhP,GAAIkP,GAAcA,MAGhCrR,GAA2BS,EAAIxD,GAC/B6D,GAAqBL,EAAIG,GACzB8F,GAA+BjG,EAAIH,GACnCiG,GAA0B9F,EAAIkO,GAA4BlO,EAAIuK,GAC9DxE,GAA4B/F,EAAIgR,GAEhC/F,GAA6BjL,EAAI,SAAUgL,GACzC,OAAO0F,GAAK3F,GAAgBC,GAAOA,IAGjC1L,KAEFwQ,GAAqBH,GAAiB,UAAG,cAAe,CACtDvS,cAAc,EACdb,IAAK,WACH,OAAOwG,GAAiBjH,MAAM8U,eAIhC5J,GAAS0I,GAAiB,uBAAwBlT,GAAuB,CAAE4G,QAAQ,SAKvF,CAAE1H,QAAQ,EAAMgV,MAAM,EAAMlJ,QAASkD;AAAejD,MAAOiD,IAAiB,CAC5EtC,OAAQuH,QAGDjH,GAAWkC,KAAwB,SAAUI,GACpDE,GAAsBF,SAGtB,CAAE7E,OAAQoJ,GAAQhI,MAAM,EAAMC,QAASkD,IAAiB,CAGxDyG,IAAO,SAAUrS,GACf,IAAI8H,EAAS1G,OAAOpB,GACpB,GAAIF,GAAIuR,GAAwBvJ,GAAS,OAAOuJ,GAAuBvJ,GACvE,IAAIuB,EAASwH,GAAQ/I,GAGrB,OAFAuJ,GAAuBvJ,GAAUuB,EACjCiI,GAAuBjI,GAAUvB,EAC1BuB,GAITiJ,OAAQ,SAAgBC,GACtB,IAAKR,GAASQ,GAAM,MAAMtT,UAAUsT,EAAM,oBAC1C,GAAIzS,GAAIwR,GAAwBiB,GAAM,OAAOjB,GAAuBiB,IAEtEC,UAAW,WAAchB,IAAa,GACtCiB,UAAW,WAAcjB,IAAa,QAGtC,CAAEnK,OAAQ,SAAUoB,MAAM,EAAMC,QAASkD,GAAejD,MAAOnI,IAAe,CAG9EgL,OA3HY,SAAgBxK,EAAG+I,GAC/B,YAAsB/K,IAAf+K,EAA2BiF,GAAmBhO,GAAKgR,GAAkBhD,GAAmBhO,GAAI+I,IA6HnGvM,eAAgB6D,GAGhByI,iBAAkBkI;AAGlBpU,yBAA0BmD,QAG1B,CAAEsG,OAAQ,SAAUoB,MAAM,EAAMC,QAASkD,IAAiB,CAG1D/E,oBAAqB4E,GAGrB3E,sBAAuBoL,QAKvB,CAAE7K,OAAQ,SAAUoB,MAAM,EAAMC,OAAQxL,IAAM,WAAc+J,GAA4B/F,EAAE,OAAU,CACpG4F,sBAAuB,SAA+BpK,GACpD,OAAOuK,GAA4B/F,EAAEvB,GAASjD,OAM9CoU,KAWFvC,GAAE,CAAElH,OAAQ,OAAQoB,MAAM,EAAMC,QAVHkD,IAAiB1O,IAAM,WAClD,IAAImM,EAASwH,KAEb,MAA+B,UAAxBC,GAAW,CAACzH,KAEe,MAA7ByH,GAAW,CAAEvQ,EAAG8I,KAEc,MAA9ByH,GAAWvT,OAAO8L,QAGwC,CAE/DqJ,UAAW,SAAmBhW,EAAIiW,EAAUC,GAI1C,IAHA,IAEIC,EAFAC,EAAO,CAACpW,GACRkJ,EAAQ,EAELV,UAAUC,OAASS,GAAOkN,EAAK1Q,KAAK8C,UAAUU,MAErD,GADAiN,EAAYF;CACPvT,GAASuT,SAAoB3T,IAAPtC,KAAoBqV,GAASrV,GAMxD,OALK+M,GAAQkJ,KAAWA,EAAW,SAAU3S,EAAK3B,GAEhD,GADwB,mBAAbwU,IAAyBxU,EAAQwU,EAAU/U,KAAKd,KAAMgD,EAAK3B,KACjE0T,GAAS1T,GAAQ,OAAOA,IAE/ByU,EAAK,GAAKH,EACH7B,GAAWjE,MAAM,KAAMiG,MAO/BjC,GAAiB,UAAEH,KACtBlP,GAA4BqP,GAAiB,UAAGH,GAAcG,GAAiB,UAAEnR,YAIpEmR,GAASJ,OAEbF,KAAU,ECnTrB,IAAIhC,GAAIjR,GACJkD,GAAc5B,EACdhC,GAASyD,EACTP,GAAMY,GACNtB,GAAWuB,EACXnD,GAAiBoD,GAA+CM,EAChEkG,GAA4BtG,GAE5BiS,GAAenW,GAAO0M,OAE1B,GAAI9I,IAAsC,mBAAhBuS,OAAiC,gBAAiBA,GAAapO,iBAExD3F,IAA/B+T,KAAejB,aACd,CACD,IAAIkB,GAA8B,GAE9BC,GAAgB;AAClB,IAAInB,EAAc5M,UAAUC,OAAS,QAAsBnG,IAAjBkG,UAAU,QAAmBlG,EAAYoC,OAAO8D,UAAU,IAChGuB,EAASzJ,gBAAgBiW,GACzB,IAAIF,GAAajB,QAED9S,IAAhB8S,EAA4BiB,KAAiBA,GAAajB,GAE9D,MADoB,KAAhBA,IAAoBkB,GAA4BvM,IAAU,GACvDA,GAETW,GAA0B6L,GAAeF,IACzC,IAAIG,GAAkBD,GAActO,UAAYoO,GAAapO,UAC7DuO,GAAgBhG,YAAc+F,GAE9B,IAAIE,GAAiBD,GAAgB1U,SACjC4U,GAAyC,gBAAhChS,OAAO2R,GAAa,SAC7BM,GAAS,wBACb7V,GAAe0V,GAAiB,cAAe,CAC7C5U,cAAc,EACdb,IAAK,WACH,IAAI4L,EAASjK,GAASpC,MAAQA,KAAK0C,UAAY1C,KAC3C8K,EAASqL,GAAerV,KAAKuL,GACjC,GAAIvJ,GAAIkT,GAA6B3J,GAAS,MAAO,GACrD,IAAIiK,EAAOF,GAAStL,EAAOpJ,MAAM,GAAI,GAAKoJ,EAAOC,QAAQsL,GAAQ,MACjE,MAAgB,KAATC,OAActU,EAAYsU,KAIrC/E,GAAE;AAAE3R,QAAQ,EAAM8L,QAAQ,GAAQ,CAChCY,OAAQ2J,KC/CZ,IAGI/Q,GAAO,GAEXA,GALsB5E,GAEc,gBAGd,QAEtBiW,GAAkC,eAAjBnS,OAAOc,ICPpBsR,GAAwBlW,GACxBmB,GAAaG,EAGb0N,GAFkBjM,GAEc,eAEhCoT,GAAuE,aAAnDhV,GAAW,WAAc,OAAOyG,UAArB,IAUnCvG,GAAiB6U,GAAwB/U,GAAa,SAAU/B,GAC9D,IAAIsE,EAAG6Q,EAAKpL,EACZ,YAAczH,IAAPtC,EAAmB,YAAqB,OAAPA,EAAc,OAEM,iBAAhDmV,EAXD,SAAUnV,EAAIsD,GACzB,IACE,OAAOtD,EAAGsD,GACV,MAAO5C,KAQSsW,CAAO1S,EAAIzD,OAAOb,GAAK4P,KAA8BuF,EAEnE4B,GAAoBhV,GAAWuC,GAEH,WAA3ByF,EAAShI,GAAWuC,KAAsC,mBAAZA,EAAE2S,OAAuB,YAAclN,GCtBxF9H,GAAUC,GAIdgV,GAL4BtW,GAKa,GAAGkB,SAAW,WACrD,MAAO,WAAaG,GAAQ3B,MAAQ;ECPlCwW,GAAwBlW,GACxB4K,GAAWtJ,WACXJ,GAAW6B,GAIVmT,IACHtL,GAAS3K,OAAOoH,UAAW,WAAYnG,GAAU,CAAE8F,QAAQ,ICPjChH,GAIN,YCJtB,IACIkO,GAAS5M,GACT2C,GAAuBlB,GAEvBwT,GAJkBvW,GAIY,eAC9BwW,GAAiBpK,MAAM/E,UAIQ3F,MAA/B8U,GAAeD,KACjBtS,GAAqBL,EAAE4S,GAAgBD,GAAa,CAClDvV,cAAc,EACdD,MAAOmN,GAAO,YCGduI,GAAmBC,GAAmCC,GDE1DC,GAAiB,SAAUlU,GACzB8T,GAAeD,IAAa7T,IAAO,GElBrCmU,GAAiB,GCEjBC,IAFY9W,GAEY,WACtB,SAASgO,KAGT,OAFAA,EAAE3G,UAAUuI,YAAc,KAEnB3P,OAAO8W,eAAe,IAAI/I,KAASA,EAAE3G,aCN1C7E,GAAMxC,GACNqC,GAAWf,EAEX0V,GAA2B5T,GAE3BuJ,GAHY5J,GAGS,YACrBuQ,GAAkBrT,OAAOoH,UAK7B4P,GAAiBD,GAA2B/W,OAAO8W,eAAiB,SAAUrT,GAE5E,OADAA,EAAIrB,GAASqB;AACTlB,GAAIkB,EAAGiJ,IAAkBjJ,EAAEiJ,IACH,mBAAjBjJ,EAAEkM,aAA6BlM,aAAaA,EAAEkM,YAChDlM,EAAEkM,YAAYvI,UACd3D,aAAazD,OAASqT,GAAkB,MHf/C1T,GAAQI,EACR+W,GAAiBzV,GACjB4C,GAA8BnB,GAC9BP,GAAMY,GAIN8T,GAHkB7T,GAGS,YAC3B8T,IAAyB,EASzB,GAAG3R,OAGC,SAFNmR,GAAgB,GAAGnR,SAIjBkR,GAAoCK,GAAeA,GAAeJ,QACxB1W,OAAOoH,YAAWoP,GAAoBC,IAHlDS,IAAyB,IAOTzV,MAArB+U,IAAkC7W,IAAM,WACnE,IAAIgF,EAAO,GAEX,OAAO6R,GAAkBS,IAAU1W,KAAKoE,KAAUA,QAGxB6R,GAAoB,IAIHjU,GAAIiU,GAAmBS,KAClEhT,GAA4BuS,GAAmBS,IA5BhC,WAAc,OAAOxX,YA+BtC0X,GAAiB,CACfX,kBAAmBA,GACnBU,uBAAwBA,II3CtBV,GAAoBzW,GAAuCyW,kBAC3DvI,GAAS5M,GACTT,GAA2BkC,EAC3BkM,GAAiB7L,GACjBiU,GAAYhU,GAEZiU,GAAa;AAAc,OAAO5X,MAEtC6X,GAAiB,SAAUC,EAAqBzI,EAAM0I,GACpD,IAAIzI,EAAgBD,EAAO,YAI3B,OAHAyI,EAAoBnQ,UAAY6G,GAAOuI,GAAmB,CAAEgB,KAAM5W,GAAyB,EAAG4W,KAC9FxI,GAAeuI,EAAqBxI,GAAe,GACnDqI,GAAUrI,GAAiBsI,GACpBE,GCdL1V,GAAW9B,ECCX6D,GAAW7D,GACX0X,GDAa,SAAUtY,GACzB,IAAK0C,GAAS1C,IAAc,OAAPA,EACnB,MAAMuC,UAAU,aAAemC,OAAO1E,GAAM,mBAC5C,OAAOA,GCGXuY,GAAiB1X,OAAO2X,iBAAmB,aAAe,GAAK,WAC7D,IAEI9C,EAFA+C,GAAiB,EACjBjT,EAAO,GAEX,KAEEkQ,EAAS7U,OAAOK,yBAAyBL,OAAOoH,UAAW,aAAanC,KACjE1E,KAAKoE,EAAM,IAClBiT,EAAiBjT,aAAgBwH,MACjC,MAAOtM,IACT,OAAO,SAAwB4D,EAAGoU,GAKhC,OAJAjU,GAASH,GACTgU,GAAmBI,GACfD,EAAgB/C,EAAOtU,KAAKkD,EAAGoU,GAC9BpU,EAAEqU,UAAYD,EACZpU;CAfoD,QAiBzDhC,GCxBFuP,GAAIjR,GACJuX,GAA4BjW,GAC5ByV,GAAiBhU,GACjB6U,GAAiBxU,GACjB6L,GAAiB5L,GACjBa,GAA8BZ,GAC9BsH,GAAWpH,WAGX6T,GAAYlG,GAGZsF,GAFgBrF,GAEkBqF,kBAClCU,GAHgB/F,GAGuB+F,uBACvCD,GAPkBrR,GAOS,YAC3BmS,GAAO,OACPC,GAAS,SACTC,GAAU,UAEVZ,GAAa,WAAc,OAAO5X,MAEtCyY,GAAiB,SAAUC,EAAUrJ,EAAMyI,EAAqBC,EAAMY,EAASC,EAAQC,GACrFhB,GAA0BC,EAAqBzI,EAAM0I,GAErD,IAkBIe,EAA0BC,EAASC,EAlBnCC,EAAqB,SAAUC,GACjC,GAAIA,IAASP,GAAWQ,EAAiB,OAAOA,EAChD,IAAK1B,IAA0ByB,KAAQE,EAAmB,OAAOA,EAAkBF,GACnF,OAAQA,GACN,KAAKZ,GACL,KAAKC,GACL,KAAKC,GAAS,OAAO,WAAqB,OAAO,IAAIV,EAAoB9X,KAAMkZ,IAC/E,OAAO,WAAc,OAAO,IAAIpB,EAAoB9X;EAGpDsP,EAAgBD,EAAO,YACvBgK,GAAwB,EACxBD,EAAoBV,EAAS/Q,UAC7B2R,EAAiBF,EAAkB5B,KAClC4B,EAAkB,eAClBT,GAAWS,EAAkBT,GAC9BQ,GAAmB1B,IAA0B6B,GAAkBL,EAAmBN,GAClFY,EAA4B,SAARlK,GAAkB+J,EAAkBI,SAA4BF,EAiCxF,GA7BIC,IACFT,EAA2BzB,GAAekC,EAAkBzY,KAAK,IAAI4X,IACjE3B,KAAsBxW,OAAOoH,WAAamR,EAAyBf,OACrDV,GAAeyB,KAA8B/B,KACvDmB,GACFA,GAAeY,EAA0B/B,IACa,mBAAtC+B,EAAyBtB,KACzChT,GAA4BsU,EAA0BtB,GAAUI,KAIpErI,GAAeuJ,EAA0BxJ,GAAe,KAMxDqJ,GAAWJ,IAAUe,GAAkBA,EAAepK,OAASqJ,KACjEc,GAAwB,EACxBF,EAAkB,WAAoB,OAAOG,EAAexY,KAAKd,QAIvCoZ,EAAkB5B,MAAc2B,GAC1D3U,GAA4B4U,EAAmB5B,GAAU2B,GAE3DxB,GAAUtI,GAAQ8J,EAGdR,EAMF,GALAI,EAAU,CACRU,OAAQR,EAAmBV,IAC3BzS,KAAM8S,EAASO,EAAkBF,EAAmBX,IACpDkB,QAASP,EAAmBT,KAE1BK,EAAQ,IAAKG,KAAOD,GAClBtB,IAA0B4B,KAA2BL,KAAOI,KAC9DlO,GAASkO,EAAmBJ,EAAKD,EAAQC,SAEtCzH,GAAE,CAAElH,OAAQgF,EAAM+I,OAAO,EAAM1M,OAAQ+L,IAA0B4B,GAAyBN,GAGnG,OAAOA;ECvFL5W,GAAkB7B,EAClB4W,GAAmBtV,GACnB+V,GAAYtU,GACZ8P,GAAsBzP,GACtB+U,GAAiB9U,GAEjB+V,GAAiB,iBACjB/F,GAAmBR,GAAoB3N,IACvCyB,GAAmBkM,GAAoBrM,UAAU4S,IAYrDC,GAAiBlB,GAAe/L,MAAO,SAAS,SAAUkN,EAAUC,GAClElG,GAAiB3T,KAAM,CACrBgH,KAAM0S,GACNrP,OAAQlI,GAAgByX,GACxBhR,MAAO,EACPiR,KAAMA,OAIP,WACD,IAAIxT,EAAQY,GAAiBjH,MACzBqK,EAAShE,EAAMgE,OACfwP,EAAOxT,EAAMwT,KACbjR,EAAQvC,EAAMuC,QAClB,OAAKyB,GAAUzB,GAASyB,EAAOlC,QAC7B9B,EAAMgE,YAASrI,EACR,CAAEX,WAAOW,EAAW8X,MAAM,IAEvB,QAARD,EAAuB,CAAExY,MAAOuH,EAAOkR,MAAM,GACrC,UAARD,EAAyB,CAAExY,MAAOgJ,EAAOzB,GAAQkR,MAAM,GACpD,CAAEzY,MAAO,CAACuH,EAAOyB,EAAOzB,IAASkR,MAAM,KAC7C,aAKOC,UAAYpC,GAAUjL,SAGf,WACA,aACA,WCpDjB,IAAIpE,GAAYhI,GACZyB,GAAyBH,EAGzBkH,GAAe,SAAUkR,GAC3B,OAAO,SAAUhR,EAAOiR;AACtB,IAGIC,EAAOC,EAHPC,EAAIhW,OAAOrC,GAAuBiH,IAClCqR,EAAW/R,GAAU2R,GACrBK,EAAOF,EAAEjS,OAEb,OAAIkS,EAAW,GAAKA,GAAYC,EAAaN,EAAoB,QAAKhY,GACtEkY,EAAQE,EAAEG,WAAWF,IACN,OAAUH,EAAQ,OAAUG,EAAW,IAAMC,IACtDH,EAASC,EAAEG,WAAWF,EAAW,IAAM,OAAUF,EAAS,MAC1DH,EAAoBI,EAAEI,OAAOH,GAAYH,EACzCF,EAAoBI,EAAE1Y,MAAM2Y,EAAUA,EAAW,GAA+BF,EAAS,OAAlCD,EAAQ,OAAU,IAA0B,QAI7GO,GAAiB,CAGfC,OAAQ5R,IAAa,GAGrB0R,OAAQ1R,IAAa,ICxBnB0R,GAASla,GAAyCka,OAClDrH,GAAsBvR,GACtB6W,GAAiBpV,GAEjBsX,GAAkB,kBAClBhH,GAAmBR,GAAoB3N,IACvCyB,GAAmBkM,GAAoBrM,UAAU6T,OAItCvW,OAAQ,UAAU,SAAUwV,GACzCjG,GAAiB3T,KAAM,CACrBgH,KAAM2T,GACN7P,OAAQ1G,OAAOwV,GACfhR,MAAO,OAIR,WACD,IAGIgS,EAHAvU,EAAQY,GAAiBjH,MACzB8K,EAASzE,EAAMyE,OACflC,EAAQvC,EAAMuC,MAElB,OAAIA,GAASkC,EAAO3C,OAAe,CAAE9G,WAAOW,EAAW8X,MAAM;GAC7Dc,EAAQJ,GAAO1P,EAAQlC,GACvBvC,EAAMuC,OAASgS,EAAMzS,OACd,CAAE9G,MAAOuZ,EAAOd,MAAM,WCzB/Be,GAAiB,CACfC,YAAa,EACbC,oBAAqB,EACrBC,aAAc,EACdC,eAAgB,EAChBC,YAAa,EACbC,cAAe,EACfC,aAAc,EACdC,qBAAsB,EACtBC,SAAU,EACVC,kBAAmB,EACnBC,eAAgB,EAChBC,gBAAiB,EACjBC,kBAAmB,EACnBC,UAAW,EACXC,cAAe,EACfC,aAAc,EACdC,SAAU,EACVC,iBAAkB,EAClBC,OAAQ,EACRC,YAAa,EACbC,cAAe,EACfC,cAAe,EACfC,eAAgB,EAChBC,aAAc,EACdC,cAAe,EACfC,iBAAkB,EAClBC,iBAAkB;AAClBC,eAAgB,EAChBC,iBAAkB,EAClBC,cAAe,EACfC,UAAW,GCjCThd,GAASU,EACTuc,GAAejb,GACfkb,GAAuBzZ,GACvBmB,GAA8Bd,GAC9BuL,GAAkBtL,GAElB6T,GAAWvI,GAAgB,YAC3BK,GAAgBL,GAAgB,eAChC8N,GAAcD,GAAqBrD,OAEvC,IAAK,IAAIuD,MAAmBH,GAAc,CACxC,IAAII,GAAard,GAAOod,IACpBE,GAAsBD,IAAcA,GAAWtV,UACnD,GAAIuV,GAAqB,CAEvB,GAAIA,GAAoB1F,MAAcuF,GAAa,IACjDvY,GAA4B0Y,GAAqB1F,GAAUuF,IAC3D,MAAO3c,GACP8c,GAAoB1F,IAAYuF,GAKlC,GAHKG,GAAoB5N,KACvB9K,GAA4B0Y,GAAqB5N,GAAe0N,IAE9DH,GAAaG,IAAkB,IAAK,IAAIG,MAAeL,GAEzD,GAAII,GAAoBC,MAAiBL,GAAqBK,IAAc,IAC1E3Y,GAA4B0Y,GAAqBC,GAAaL,GAAqBK,KACnF,MAAO/c,GACP8c,GAAoBC,IAAeL,GAAqBK,MC5BpC7c,GAIN,iBCJMA,GAIN,eCHDsB,GADRtB,EAKS8c,KAAM,QAAQ,GCLf9c,GAINX,KAAM,QAAQ,GCJ7B,IAEIgD,GAAWU,EACXga,GAAuB3Z,GACvB4T,GAA2B3T,GAJvBrD,GAUN,CAAE+J,OAAQ,SAAUoB,MAAM;AAAMC,OATtB9J,GAKoB,WAAcyb,GAAqB,MAIJ1R,MAAO2L,IAA4B,CAChGD,eAAgB,SAAwB3X,GACtC,OAAO2d,GAAqB1a,GAASjD,OCZzC,IAAI8D,GAAclD,EACdE,GAAiBoB,GAA+CsC,EAEhEoZ,GAAoBrd,SAAS0H,UAC7B4V,GAA4BD,GAAkB9b,SAC9Cgc,GAAS,wBACTnO,GAAO,OAIP7L,MAAiB6L,MAAQiO,KAC3B9c,GAAe8c,GAAmBjO,GAAM,CACtC/N,cAAc,EACdb,IAAK,WACH,IACE,OAAO8c,GAA0Bzc,KAAKd,MAAM+J,MAAMyT,IAAQ,GAC1D,MAAOpd,GACP,MAAO,OCjBf,IAEAqd,GAFand,EAEWod,QCFpBxS,GAAW5K,WAEfqd,GAAiB,SAAUtT,EAAQ8D,EAAK9G,GACtC,IAAK,IAAIrE,KAAOmL,EAAKjD,GAASb,EAAQrH,EAAKmL,EAAInL,GAAMqE,GACrD,OAAOgD,GCHLtC,GAAazH,GACbiE,GAAuB3C,GAEvB4B,GAAcE,EAEdoM,GAHkBzM,GAGQ,WAE9Bua,GAAiB,SAAUC,GACzB,IAAIC,EAAc/V,GAAW8V,GACzBrd,EAAiB+D,GAAqBL,EAEtCV,IAAesa,IAAgBA,EAAYhO,KAC7CtP,EAAesd,EAAahO,GAAS,CACnCxO,cAAc;AACdb,IAAK,WAAc,OAAOT,SCfhC+d,GAAiB,SAAUre,EAAIoe,EAAa5O,GAC1C,KAAMxP,aAAcoe,GAClB,MAAM7b,UAAU,cAAgBiN,EAAOA,EAAO,IAAM,IAAM,cAC1D,OAAOxP,GCFPiY,GAAY/V,GAEZ4V,GAHkBlX,GAGS,YAC3BwW,GAAiBpK,MAAM/E,UAG3BqW,GAAiB,SAAUte,GACzB,YAAcsC,IAAPtC,IAAqBiY,GAAUjL,QAAUhN,GAAMoX,GAAeU,MAAc9X,ICRjFiC,GAAUrB,GACVqX,GAAY/V,GAGZ4V,GAFkBnU,GAES,YAE/B4a,GAAiB,SAAUve,GACzB,GAAUsC,MAANtC,EAAiB,OAAOA,EAAG8X,KAC1B9X,EAAG,eACHiY,GAAUhW,GAAQjC,KCTrByE,GAAW7D,GAEf4d,GAAiB,SAAU1R,GACzB,IAAI2R,EAAe3R,EAAiB,OACpC,QAAqBxK,IAAjBmc,EACF,OAAOha,GAASga,EAAard,KAAK0L,IAAWnL,OCL7C8C,GAAW7D,GACX0d,GAAwBpc,GACxB6G,GAAWpF,GACX8M,GAAOzM,GACPua,GAAoBta,GACpBua,GAAgBta,GAEhBwa,GAAS,SAAUC,EAAS5U,GAC9BzJ,KAAKqe,QAAUA,EACfre,KAAKyJ,OAASA;EAGhB6U,GAAiB,SAAUC,EAAUC,EAAiBnX,GACpD,IAKImF,EAAUiS,EAAQ7V,EAAOT,EAAQsB,EAAQsO,EAAM2G,EAL/ChP,EAAOrI,GAAWA,EAAQqI,KAC1BiP,KAAgBtX,IAAWA,EAAQsX,YACnCC,KAAiBvX,IAAWA,EAAQuX,aACpCC,KAAiBxX,IAAWA,EAAQwX,aACpCrc,EAAK2N,GAAKqO,EAAiB9O,EAAM,EAAIiP,EAAaE,GAGlDC,EAAO,SAAUC,GAEnB,OADIvS,GAAU0R,GAAc1R,GACrB,IAAI4R,IAAO,EAAMW,IAGtBC,EAAS,SAAU3d,GACrB,OAAIsd,GACFxa,GAAS9C,GACFwd,EAAcrc,EAAGnB,EAAM,GAAIA,EAAM,GAAIyd,GAAQtc,EAAGnB,EAAM,GAAIA,EAAM,KAChEwd,EAAcrc,EAAGnB,EAAOyd,GAAQtc,EAAGnB,IAG9C,GAAIud,EACFpS,EAAW+R,MACN,CAEL,GAAqB,mBADrBE,EAASR,GAAkBM,IACM,MAAMtc,UAAU,0BAEjD,GAAI+b,GAAsBS,GAAS,CACjC,IAAK7V,EAAQ,EAAGT,EAASM,GAAS8V,EAASpW,QAASA,EAASS,EAAOA,IAElE,IADAa,EAASuV,EAAOT,EAAS3V,MACXa,aAAkB2U,GAAQ,OAAO3U,EAC/C,OAAO,IAAI2U,IAAO,GAEtB5R,EAAWiS,EAAO3d,KAAKyd,GAIzB,IADAxG,EAAOvL,EAASuL,OACP2G,EAAO3G,EAAKjX,KAAK0L,IAAWsN,MAAM,CACzC;AACErQ,EAASuV,EAAON,EAAKrd,OACrB,MAAOjB,GAEP,MADA8d,GAAc1R,GACRpM,EAER,GAAqB,iBAAVqJ,GAAsBA,GAAUA,aAAkB2U,GAAQ,OAAO3U,EAC5E,OAAO,IAAI2U,IAAO,ICtDlB5G,GAFkBlX,GAES,YAC3B2e,IAAe,EAEnB,IACE,IAAIC,GAAS,EACTC,GAAqB,CACvBpH,KAAM,WACJ,MAAO,CAAE+B,OAAQoF,OAEnBE,OAAU,WACRH,IAAe,IAGnBE,GAAmB3H,IAAY,WAC7B,OAAOxX,MAGT0M,MAAM2S,KAAKF,IAAoB,WAAc,MAAM,KACnD,MAAO/e,QCHLkf,GAAOC,GAASC,GDKpBC,GAAiB,SAAUtf,EAAMuf,GAC/B,IAAKA,IAAiBT,GAAc,OAAO,EAC3C,IAAIU,GAAoB,EACxB,IACE,IAAIlb,EAAS,GACbA,EAAO+S,IAAY,WACjB,MAAO,CACLO,KAAM,WACJ,MAAO,CAAE+B,KAAM6F,GAAoB,MAIzCxf,EAAKsE,GACL,MAAOrE,IACT,OAAOuf,GEpCLxb,GAAW7D,GACXuH,GAAYjG,GAGZkO,GAFkBzM,GAEQ,WAI9Buc,GAAiB,SAAU5b,EAAG6b;AAC5B,IACIzF,EADAnK,EAAI9L,GAASH,GAAGkM,YAEpB,YAAalO,IAANiO,GAAiDjO,OAA7BoY,EAAIjW,GAAS8L,GAAGH,KAAyB+P,EAAqBhY,GAAUuS,ICTrG0F,GAAiB,qCAAqC5a,KAFtC5E,ICGhByf,GAA4C,WAH9Bzf,EACDsB,EAEmBkK,SHH5BlM,GAASU,EACTJ,GAAQ0B,EACRuO,GAAO9M,GACP2J,GAAOtJ,GACPP,GAAgBQ,GAChBqc,GAASpc,GACTqc,GAAUnc,GAEVoc,GAAWtgB,GAAOsgB,SAClB1a,GAAM5F,GAAOugB,aACbC,GAAQxgB,GAAOygB,eACfvU,GAAUlM,GAAOkM,QACjBwU,GAAiB1gB,GAAO0gB,eACxBC,GAAW3gB,GAAO2gB,SAClBC,GAAU,EACVC,GAAQ,GACRC,GAAqB,qBAGrBC,GAAM,SAAUlb,GAElB,GAAIgb,GAAM5d,eAAe4C,GAAK,CAC5B,IAAIjD,EAAKie,GAAMhb,UACRgb,GAAMhb,GACbjD,MAIAoe,GAAS,SAAUnb,GACrB,OAAO,WACLkb,GAAIlb,KAIJob,GAAW,SAAUC,GACvBH,GAAIG,EAAMpW,OAGRqW,GAAO,SAAUtb;AAEnB7F,GAAOohB,YAAYvb,EAAK,GAAIya,GAASe,SAAW,KAAOf,GAASgB,OAI7D1b,IAAQ4a,KACX5a,GAAM,SAAsBhD,GAG1B,IAFA,IAAIsT,EAAO,GACPtM,EAAI,EACDtB,UAAUC,OAASqB,GAAGsM,EAAK1Q,KAAK8C,UAAUsB,MAMjD,OALAiX,KAAQD,IAAW,YAEH,mBAANhe,EAAmBA,EAAKvC,SAASuC,IAAKqN,WAAM7N,EAAW8T,IAEjEwJ,GAAMkB,IACCA,IAETJ,GAAQ,SAAwB3a,UACvBgb,GAAMhb,IAGXwa,GACFX,GAAQ,SAAU7Z,GAChBqG,GAAQqV,SAASP,GAAOnb,KAGjB8a,IAAYA,GAASa,IAC9B9B,GAAQ,SAAU7Z,GAChB8a,GAASa,IAAIR,GAAOnb,KAIb6a,KAAmBN,IAE5BR,IADAD,GAAU,IAAIe,IACCe,MACf9B,GAAQ+B,MAAMC,UAAYV;AAC1BvB,GAAQnP,GAAKqP,GAAKwB,YAAaxB,GAAM,IAIrC5f,GAAO4hB,kBACe,mBAAfR,cACNphB,GAAO6hB,eACRvB,IAAkC,UAAtBA,GAASe,WACpB/gB,GAAM6gB,KAEPzB,GAAQyB,GACRnhB,GAAO4hB,iBAAiB,UAAWX,IAAU,IAG7CvB,GADSoB,MAAsBvd,GAAc,UACrC,SAAUsC,GAChBuH,GAAKkB,YAAY/K,GAAc,WAA6B,mBAAI,WAC9D6J,GAAK0U,YAAY1hB,MACjB2gB,GAAIlb,KAKA,SAAUA,GAChBkc,WAAWf,GAAOnb,GAAK,SInFzBmc,GAAOC,GAAMC,GAAMC,GAAQC,GAAQC,GAAMC,GAASC,GJwFtDC,GAAiB,CACf5c,IAAKA,GACL4a,MAAOA;EKvGTiC,GAAiB,qBAAqBnd,KAFtB5E,IDAZV,GAASU,EACTM,GAA2BgB,EAA2DsC,EACtFoe,GAAYjf,GAA6BmC,IACzCwa,GAAStc,GACT6e,GAAkB5e,GAClBsc,GAAUrc,GAEV4e,GAAmB5iB,GAAO4iB,kBAAoB5iB,GAAO6iB,uBACrDxf,GAAWrD,GAAOqD,SAClB6I,GAAUlM,GAAOkM,QACjB4R,GAAU9d,GAAO8d,QAEjBgF,GAA2B9hB,GAAyBhB,GAAQ,kBAC5D+iB,GAAiBD,IAA4BA,GAAyBrhB,MAKrEshB,KACHf,GAAQ,WACN,IAAIgB,EAAQpgB,EAEZ,IADIyd,KAAY2C,EAAS9W,GAAQyB,SAASqV,EAAOC,OAC1ChB,IAAM,CACXrf,EAAKqf,GAAKrf,GACVqf,GAAOA,GAAK9J,KACZ,IACEvV,IACA,MAAOpC,GAGP,MAFIyhB,GAAME,KACLD,QAAO9f,EACN5B,GAER0hB,QAAO9f,EACL4gB,GAAQA,EAAOE,SAKhB9C,IAAWC,IAAYsC,KAAmBC,KAAoBvf,GAQxDya,IAAWA,GAAQqF,UAE5Bb,GAAUxE,GAAQqF,aAAQ/gB,IAElBkO,YAAcwN,GACtByE,GAAOD,GAAQC,KACfJ,GAAS,WACPI,GAAKrhB,KAAKohB,GAASN,MAIrBG,GADS9B,GACA;AACPnU,GAAQqV,SAASS,KASV,WAEPU,GAAUxhB,KAAKlB,GAAQgiB,MA9BzBI,IAAS,EACTC,GAAOhf,GAAS+f,eAAe,IAC/B,IAAIR,GAAiBZ,IAAOqB,QAAQhB,GAAM,CAAEiB,eAAe,IAC3DnB,GAAS,WACPE,GAAKvX,KAAOsX,IAAUA,UA+B5BmB,GAAiBR,IAAkB,SAAUngB,GAC3C,IAAI4f,EAAO,CAAE5f,GAAIA,EAAIuV,UAAM/V,GACvB8f,KAAMA,GAAK/J,KAAOqK,GACjBP,KACHA,GAAOO,EACPL,MACAD,GAAOM,SE/EPva,GAAYvH,GAEZ8iB,GAAoB,SAAUnT,GAChC,IAAI8S,EAASM,EACbrjB,KAAKkiB,QAAU,IAAIjS,GAAE,SAAUqT,EAAWC,GACxC,QAAgBvhB,IAAZ+gB,QAAoC/gB,IAAXqhB,EAAsB,MAAMphB,UAAU,2BACnE8gB,EAAUO,EACVD,EAASE,KAEXvjB,KAAK+iB,QAAUlb,GAAUkb,GACzB/iB,KAAKqjB,OAASxb,GAAUwb,SAKP,SAAUpT,GAC3B,OAAO,IAAImT,GAAkBnT;CCjB/B,ICsDIuT,GAAUC,GAAsBC,GAAgBC,GDtDhDxf,GAAW7D,GACX8B,GAAWR,EACXgiB,GAAuBvgB,GEFvBzD,GAASU,ECAbujB,GAAkC,iBAAV/jB,OFCpByR,GAAIjR,GAEJV,GAASyD,EACT0E,GAAarE,GACbogB,GAAgBngB,GAChBuH,GAAWtH,WACX+Z,GAAc7Z,GACdoU,GAAiB/R,GACjBoJ,GAAiBiC,GACjBoM,GAAanM,GACbrP,GAAWsP,EACX7J,GAAY8J,GACZoM,GAAanM,GACb7M,GAAgB8M,GAChByM,GAAUxM,GACV2N,GAA8B1N,GAC9B6N,GAAqB3N,GACrBmQ,GAAOlQ,GAA6B1M,IACpC2d,GAAYhR,GACZ4R,GDhBa,SAAU9T,EAAG+T,GAE5B,GADA7f,GAAS8L,GACL7N,GAAS4hB,IAAMA,EAAE9T,cAAgBD,EAAG,OAAO+T,EAC/C,IAAIC,EAAoBL,GAAqB1f,EAAE+L,GAG/C,OADA8S,EADckB,EAAkBlB,SACxBiB,GACDC,EAAkB/B,SCWvBgC,GCnBa,SAAU3gB,EAAGoM,GAC5B,IAAIwU,EAAUvkB,GAAOukB,QACjBA,GAAWA,EAAQ/jB,QACA,IAArB8H,UAAUC,OAAegc,EAAQ/jB,MAAMmD,GAAK4gB,EAAQ/jB,MAAMmD,EAAGoM,KDiB7DyU,GAA6B7R,GAC7B8R,GGvBa,SAAUlkB,GACzB,IACE,MAAO,CAAEC,OAAO,EAAOiB,MAAOlB,KAC9B,MAAOC,GACP,MAAO,CAAEA,OAAO,EAAMiB,MAAOjB;EHoB7B+S,GAAsBV,GACtBlI,GAAWmI,GAEX4R,GAAa1R,GACbqN,GAAUzM,GACVrH,GAAa0G,GAEb/C,GALkB6C,GAKQ,WAC1B4R,GAAU,UACVtd,GAAmBkM,GAAoB1S,IACvCkT,GAAmBR,GAAoB3N,IACvCgf,GAA0BrR,GAAoBrM,UAAUyd,IACxDE,GAAyBX,IAAiBA,GAAcnc,UACxD+c,GAAqBZ,GACrBa,GAA8BF,GAC9BxiB,GAAYrC,GAAOqC,UACnBgB,GAAWrD,GAAOqD,SAClB6I,GAAUlM,GAAOkM,QACjB8X,GAAuBQ,GAA2BlgB,EAClD0gB,GAA8BhB,GAC9BiB,MAAoB5hB,IAAYA,GAAS6hB,aAAellB,GAAOmlB,eAC/DC,GAAyD,mBAAzBC,sBAChCC,GAAsB,qBAOtBC,IAAc,EAGdtM,GAAStO,GAASga,IAAS,WAC7B,IAAIa,EAAyBrgB,GAAc2f,MAAwBtgB,OAAOsgB,IAI1E,IAAKU,GAAyC,KAAfjZ,GAAmB,OAAO,EAMzD,GAAIA,IAAc,IAAM,cAAcjH,KAAKwf,IAAqB,OAAO,EAEvE,IAAIxC,EAAU,IAAIwC,IAAmB,SAAU3B,GAAWA,EAAQ,MAC9DsC,EAAc,SAAUllB;AAC1BA,GAAK,eAA6B,gBAKpC,OAHkB+hB,EAAQhS,YAAc,IAC5BJ,IAAWuV,IACvBF,GAAcjD,EAAQC,MAAK,yBAAwCkD,KAG3DD,GAA0Bd,KAAeU,MAG/CM,GAAsBzM,KAAW4G,IAA4B,SAAUlB,GACzEmG,GAAmBa,IAAIhH,GAAiB,OAAE,kBAIxCiH,GAAa,SAAU9lB,GACzB,IAAIyiB,EACJ,SAAO/f,GAAS1C,IAAkC,mBAAnByiB,EAAOziB,EAAGyiB,QAAsBA,GAG7DJ,GAAS,SAAU1b,EAAOof,GAC5B,IAAIpf,EAAMqf,SAAV,CACArf,EAAMqf,UAAW,EACjB,IAAIC,EAAQtf,EAAMuf,UAClBzC,IAAU,WAKR,IAJA,IAAI9hB,EAAQgF,EAAMhF,MACdwkB,EAhDQ,GAgDHxf,EAAMA,MACXuC,EAAQ,EAEL+c,EAAMxd,OAASS,GAAO,CAC3B,IAKIa,EAAQ0Y,EAAM2D,EALdC,EAAWJ,EAAM/c,KACjBod,EAAUH,EAAKE,EAASF,GAAKE,EAASE,KACtClD,EAAUgD,EAAShD,QACnBM,EAAS0C,EAAS1C,OAClB9V,EAASwY,EAASxY,OAEtB,IACMyY,GACGH,IAzDC,IA0DAxf,EAAM6f,WAAyBC,GAAkB9f,GACrDA,EAAM6f,UA5DJ;CA8DY,IAAZF,EAAkBvc,EAASpI,GAEzBkM,GAAQA,EAAOuV,QACnBrZ,EAASuc,EAAQ3kB,GACbkM,IACFA,EAAOsV,OACPiD,GAAS,IAGTrc,IAAWsc,EAAS7D,QACtBmB,EAAOphB,GAAU,yBACRkgB,EAAOqD,GAAW/b,IAC3B0Y,EAAKrhB,KAAK2I,EAAQsZ,EAASM,GACtBN,EAAQtZ,IACV4Z,EAAOhiB,GACd,MAAOjB,GACHmN,IAAWuY,GAAQvY,EAAOsV,OAC9BQ,EAAOjjB,IAGXiG,EAAMuf,UAAY,GAClBvf,EAAMqf,UAAW,EACbD,IAAapf,EAAM6f,WAAWE,GAAY/f,QAI9C0e,GAAgB,SAAU7V,EAAMgT,EAASmE,GAC3C,IAAIvF,EAAOkF,EACPnB,KACF/D,EAAQ7d,GAAS6hB,YAAY,UACvB5C,QAAUA,EAChBpB,EAAMuF,OAASA,EACfvF,EAAMwF,UAAUpX,GAAM,GAAO,GAC7BtP,GAAOmlB,cAAcjE,IAChBA,EAAQ,CAAEoB,QAASA,EAASmE,OAAQA,IACtCrB,KAA2BgB,EAAUpmB,GAAO,KAAOsP,IAAQ8W,EAAQlF,GAC/D5R,IAASgW,IAAqBhB,GAAiB,8BAA+BmC,IAGrFD,GAAc,SAAU/f,GAC1B+b,GAAKthB,KAAKlB,IAAQ,WAChB,IAGI6J,EAHAyY,EAAU7b,EAAMK,OAChBrF,EAAQgF,EAAMhF;CAGlB,GAFmBklB,GAAYlgB,KAG7BoD,EAAS4a,IAAQ,WACXpE,GACFnU,GAAQ0a,KAAK,qBAAsBnlB,EAAO6gB,GACrC6C,GAAcG,GAAqBhD,EAAS7gB,MAGrDgF,EAAM6f,UAAYjG,IAAWsG,GAAYlgB,GAjH/B,EADF,EAmHJoD,EAAOrJ,OAAO,MAAMqJ,EAAOpI,UAKjCklB,GAAc,SAAUlgB,GAC1B,OAzHY,IAyHLA,EAAM6f,YAA0B7f,EAAMuc,QAG3CuD,GAAoB,SAAU9f,GAChC+b,GAAKthB,KAAKlB,IAAQ,WAChB,IAAIsiB,EAAU7b,EAAMK,OAChBuZ,GACFnU,GAAQ0a,KAAK,mBAAoBtE,GAC5B6C,GArIa,mBAqIoB7C,EAAS7b,EAAMhF,WAIvD8O,GAAO,SAAU3N,EAAI6D,EAAOogB,GAC9B,OAAO,SAAUplB,GACfmB,EAAG6D,EAAOhF,EAAOolB,KAIjBC,GAAiB,SAAUrgB,EAAOhF,EAAOolB,GACvCpgB,EAAMyT,OACVzT,EAAMyT,MAAO,EACT2M,IAAQpgB,EAAQogB,GACpBpgB,EAAMhF,MAAQA,EACdgF,EAAMA,MAjJO,EAkJb0b,GAAO1b,GAAO,KAGZsgB,GAAkB,SAAUtgB,EAAOhF,EAAOolB,GAC5C,IAAIpgB,EAAMyT,KAAV,CACAzT,EAAMyT,MAAO,EACT2M,IAAQpgB,EAAQogB,GACpB;AACE,GAAIpgB,EAAMK,SAAWrF,EAAO,MAAMY,GAAU,oCAC5C,IAAIkgB,EAAOqD,GAAWnkB,GAClB8gB,EACFgB,IAAU,WACR,IAAIyD,EAAU,CAAE9M,MAAM,GACtB,IACEqI,EAAKrhB,KAAKO,EACR8O,GAAKwW,GAAiBC,EAASvgB,GAC/B8J,GAAKuW,GAAgBE,EAASvgB,IAEhC,MAAOjG,GACPsmB,GAAeE,EAASxmB,EAAOiG,QAInCA,EAAMhF,MAAQA,EACdgF,EAAMA,MA3KI,EA4KV0b,GAAO1b,GAAO,IAEhB,MAAOjG,GACPsmB,GAAe,CAAE5M,MAAM,GAAS1Z,EAAOiG,MAK3C,GAAIwS,KAaF8L,IAXAD,GAAqB,SAAiBmC,GACpC9I,GAAW/d,KAAM0kB,GAAoBH,IACrC1c,GAAUgf,GACVrD,GAAS1iB,KAAKd,MACd,IAAIqG,EAAQY,GAAiBjH,MAC7B,IACE6mB,EAAS1W,GAAKwW,GAAiBtgB,GAAQ8J,GAAKuW,GAAgBrgB,IAC5D,MAAOjG,GACPsmB,GAAergB,EAAOjG,MAGuBuH,WAEjD6b,GAAW,SAAiBqD,GAC1BlT,GAAiB3T,KAAM,CACrBgH,KAAMud,GACNzK,MAAM,EACN4L,UAAU,EACV9C,QAAQ,EACRgD,UAAW,GACXM,WAAW,EACX7f,MA5MQ,EA6MRhF,WAAOW,MAGF2F,UAAYgW,GAAYgH,GAA6B;AAG5DxC,KAAM,SAAc2E,EAAaC,GAC/B,IAAI1gB,EAAQme,GAAwBxkB,MAChC+lB,EAAWnC,GAAqBhE,GAAmB5f,KAAM0kB,KAO7D,OANAqB,EAASF,GAA2B,mBAAfiB,GAA4BA,EACjDf,EAASE,KAA4B,mBAAdc,GAA4BA,EACnDhB,EAASxY,OAAS0S,GAAUnU,GAAQyB,YAASvL,EAC7CqE,EAAMuc,QAAS,EACfvc,EAAMuf,UAAUxgB,KAAK2gB,GA1Nb,GA2NJ1f,EAAMA,OAAkB0b,GAAO1b,GAAO,GACnC0f,EAAS7D,SAIlB8E,MAAS,SAAUD,GACjB,OAAO/mB,KAAKmiB,UAAKngB,EAAW+kB,MAGhCtD,GAAuB,WACrB,IAAIvB,EAAU,IAAIsB,GACdnd,EAAQY,GAAiBib,GAC7BliB,KAAKkiB,QAAUA,EACfliB,KAAK+iB,QAAU5S,GAAKwW,GAAiBtgB,GACrCrG,KAAKqjB,OAASlT,GAAKuW,GAAgBrgB,IAErC+d,GAA2BlgB,EAAI0f,GAAuB,SAAU3T,GAC9D,OAAOA,IAAMyU,IAAsBzU,IAAMyT,GACrC,IAAID,GAAqBxT,GACzB2U,GAA4B3U,IAGM,mBAAjB6T,IAA+BW,KAA2BlkB,OAAOoH,WAAW,CACjGgc,GAAac,GAAuBtC;AAE/BgD,KAEHja,GAASuZ,GAAwB,QAAQ,SAAcqC,EAAaC,GAClE,IAAIrX,EAAO1P,KACX,OAAO,IAAI0kB,IAAmB,SAAU3B,EAASM,GAC/CM,GAAW7iB,KAAK4O,EAAMqT,EAASM,MAC9BlB,KAAK2E,EAAaC,KAEpB,CAAEzf,QAAQ,IAGb4D,GAASuZ,GAAwB,QAASE,GAAmC,MAAG,CAAErd,QAAQ,KAI5F,WACSmd,GAAuBvU,YAC9B,MAAO9P,IAGL8X,IACFA,GAAeuM,GAAwBE,OAK3C,CAAE/kB,QAAQ,EAAMgV,MAAM,EAAMlJ,OAAQmN,IAAU,CAC9C6E,QAASgH,QAGIA,GAAoBH,IAAS,MACjCA,IAEXb,GAAiB3b,GAAWwc,OAG1B,CAAEla,OAAQka,GAAS9Y,MAAM,EAAMC,OAAQmN,IAAU,CAGjDwK,OAAQ,SAAgB4D,GACtB,IAAIC,EAAatD,GAAqB5jB,MAEtC,OADAknB,EAAW7D,OAAOviB,UAAKkB,EAAWilB,GAC3BC,EAAWhF,cAIpB,CAAE7X,OAAQka,GAAS9Y,MAAM,EAAMC,OAAmBmN,IAAU,CAG5DkK,QAAS,SAAiBiB,GACxB,OAAOD,GAAyE/jB,KAAMgkB,SAIxF,CAAE3Z,OAAQka,GAAS9Y,MAAM,EAAMC,OAAQ4Z;EAAuB,CAG9DC,IAAK,SAAahH,GAChB,IAAItO,EAAIjQ,KACJknB,EAAatD,GAAqB3T,GAClC8S,EAAUmE,EAAWnE,QACrBM,EAAS6D,EAAW7D,OACpB5Z,EAAS4a,IAAQ,WACnB,IAAI8C,EAAkBtf,GAAUoI,EAAE8S,SAC9BtJ,EAAS,GACT+G,EAAU,EACV4G,EAAY,EAChB9I,GAAQC,GAAU,SAAU2D,GAC1B,IAAItZ,EAAQ4X,IACR6G,GAAgB,EACpB5N,EAAOrU,UAAKpD,GACZolB,IACAD,EAAgBrmB,KAAKmP,EAAGiS,GAASC,MAAK,SAAU9gB,GAC1CgmB,IACJA,GAAgB,EAChB5N,EAAO7Q,GAASvH,IACd+lB,GAAarE,EAAQtJ,MACtB4J,QAEH+D,GAAarE,EAAQtJ,MAGzB,OADIhQ,EAAOrJ,OAAOijB,EAAO5Z,EAAOpI,OACzB6lB,EAAWhF,SAIpBoF,KAAM,SAAc/I,GAClB,IAAItO,EAAIjQ,KACJknB,EAAatD,GAAqB3T,GAClCoT,EAAS6D,EAAW7D,OACpB5Z,EAAS4a,IAAQ,WACnB,IAAI8C,EAAkBtf,GAAUoI,EAAE8S,SAClCzE,GAAQC,GAAU,SAAU2D,GAC1BiF,EAAgBrmB,KAAKmP,EAAGiS,GAASC,KAAK+E,EAAWnE,QAASM,SAI9D,OADI5Z,EAAOrJ,OAAOijB,EAAO5Z,EAAOpI,OACzB6lB,EAAWhF,WIpYtB,IAAI/d,GAAW7D,GAIfinB,GAAiB,WACf,IAAI7X,EAAOvL,GAASnE,MAChByJ,EAAS;CAOb,OANIiG,EAAK9P,SAAQ6J,GAAU,KACvBiG,EAAK8X,aAAY/d,GAAU,KAC3BiG,EAAK+X,YAAWhe,GAAU,KAC1BiG,EAAKgY,SAAQje,GAAU,KACvBiG,EAAKiY,UAASle,GAAU,KACxBiG,EAAKkY,SAAQne,GAAU,KACpBA,GCbLyB,GAAW5K,WACX6D,GAAWvC,GACX1B,GAAQmD,EACRwkB,GAAQnkB,GAERokB,GAAY,WACZC,GAAkBC,OAAOrgB,UACzBsgB,GAAiBF,GAAyB,SAE1CG,GAAchoB,IAAM,WAAc,MAA2D,QAApD+nB,GAAennB,KAAK,CAAE2G,OAAQ,IAAKogB,MAAO,SAEnFM,GAAiBF,GAAe/Y,MAAQ4Y,IAIxCI,IAAeC,KACjBjd,GAAS8c,OAAOrgB,UAAWmgB,IAAW,WACpC,IAAIM,EAAIjkB,GAASnE,MACbqoB,EAAIjkB,OAAOgkB,EAAE3gB,QACb6gB,EAAKF,EAAEP,MAEX,MAAO,IAAMQ,EAAI,IADTjkB,YAAcpC,IAAPsmB,GAAoBF,aAAaJ,UAAY,UAAWD,IAAmBF,GAAM/mB,KAAKsnB,GAAKE,KAEzG,CAAEhhB,QAAQ;CCtBf,IAAIpH,GAAQI,EAEZioB,GAAiB,SAAUpL,EAAava,GACtC,IAAIqF,EAAS,GAAGkV,GAChB,QAASlV,GAAU/H,IAAM,WAEvB+H,EAAOnH,KAAK,KAAM8B,GAAY,WAAc,MAAM,GAAM,OCNxDyQ,GAAW/S,GAAwCyQ,QCDnDnR,GAASU,EACTuc,GAAejb,GACfmP,GDAsBnP,GAEc,WAOpC,GAAGmP,QAH2B,SAAiBJ,GACjD,OAAO0C,GAASrT,KAAM2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,ICNtEwC,GAA8Bd,GAElC,IAAK,IAAIsZ,MAAmBH,GAAc,CACxC,IAAII,GAAard,GAAOod,IACpBE,GAAsBD,IAAcA,GAAWtV,UAEnD,GAAIuV,IAAuBA,GAAoBnM,UAAYA,GAAS,IAClEvM,GAA4B0Y,GAAqB,UAAWnM,IAC5D,MAAO3Q,GACP8c,GAAoBnM,QAAUA,ICXlC,IAAI1O,GAAc/B,EACdiE,GAAuB3C,GACvBT,GAA2BkC,EAE/BmlB,GAAiB,SAAU/jB,EAAQzB,EAAK3B,GACtC,IAAIonB,EAAcpmB,GAAYW,GAC1BylB,KAAehkB,EAAQF,GAAqBL,EAAEO,EAAQgkB,EAAatnB,GAAyB,EAAGE,IAC9FoD,EAAOgkB,GAAepnB,GCRzBnB,GAAQI,EAER6L,GAAa9I,GAEbyM,GAHkBlO,GAGQ,WAE9B8mB,GAAiB,SAAUvL;AAIzB,OAAOhR,IAAc,KAAOjM,IAAM,WAChC,IAAIyoB,EAAQ,GAKZ,OAJkBA,EAAMzY,YAAc,IAC1BJ,IAAW,WACrB,MAAO,CAAE8Y,IAAK,IAE2B,IAApCD,EAAMxL,GAAa0L,SAASD,QCfnCrX,GAAIjR,GACJ8B,GAAWR,EACX6K,GAAUpJ,GACVsF,GAAkBjF,GAClB+E,GAAW9E,GACXxB,GAAkByB,EAClB4kB,GAAiB1kB,GACjBmL,GAAkB9I,GAGlB2iB,GAF+BtX,GAEoB,SAEnD1B,GAAUb,GAAgB,WAC1B8Z,GAAc,GAAGrnB,MACjBgH,GAAM/I,KAAK+I,OAKb,CAAE2B,OAAQ,QAAS+N,OAAO,EAAM1M,QAASod,IAAuB,CAChEpnB,MAAO,SAAesnB,EAAOC,GAC3B,IAKInL,EAAarU,EAAQyf,EALrBllB,EAAI7B,GAAgBnC,MACpBmI,EAASM,GAASzE,EAAEmE,QACpBghB,EAAIxgB,GAAgBqgB,EAAO7gB,GAC3BihB,EAAMzgB,QAAwB3G,IAARinB,EAAoB9gB,EAAS8gB,EAAK9gB,GAG5D,GAAIsE,GAAQzI,KAGgB,mBAF1B8Z,EAAc9Z,EAAEkM,cAEyB4N,IAAgBpR,QAASD,GAAQqR,EAAYnW,WAE3EvF,GAAS0b,IAEE,QADpBA,EAAcA,EAAYhO,OACAgO,OAAc9b,GAHxC8b,OAAc9b;AAKZ8b,IAAgBpR,YAAyB1K,IAAhB8b,GAC3B,OAAOiL,GAAYjoB,KAAKkD,EAAGmlB,EAAGC,GAIlC,IADA3f,EAAS,SAAqBzH,IAAhB8b,EAA4BpR,MAAQoR,GAAapV,GAAI0gB,EAAMD,EAAG,IACvED,EAAI,EAAGC,EAAIC,EAAKD,IAAKD,IAASC,KAAKnlB,GAAGwkB,GAAe/e,EAAQyf,EAAGllB,EAAEmlB,IAEvE,OADA1f,EAAOtB,OAAS+gB,EACTzf,sBCrCP4f,EAAW,SAAUC,OAKnBtnB,EAFAunB,EAAKhpB,OAAOoH,UACZ5E,EAASwmB,EAAG1mB,eAEZgR,EAA4B,mBAAXvH,OAAwBA,OAAS,GAClDkd,EAAiB3V,EAAQrH,UAAY,aACrCid,EAAsB5V,EAAQ6V,eAAiB,kBAC/CC,EAAoB9V,EAAQ+V,aAAe,yBAEtCC,EAAOC,EAAK9mB,EAAK3B,UACxBd,OAAOC,eAAespB,EAAK9mB,EAAK,CAC9B3B,MAAOA,EACPH,YAAY,EACZI,cAAc,EACdC,UAAU,IAELuoB,EAAI9mB,OAIX6mB,EAAO,GAAI,IACX,MAAOE;AACPF,EAAS,SAASC,EAAK9mB,EAAK3B,UACnByoB,EAAI9mB,GAAO3B,YAIbuT,EAAKoV,EAASC,EAASlqB,EAAMmqB,OAEhCC,EAAiBF,GAAWA,EAAQtiB,qBAAqByiB,EAAYH,EAAUG,EAC/EC,EAAY9pB,OAAOiO,OAAO2b,EAAexiB,WACzC2iB,EAAU,IAAIC,EAAQL,GAAe,WAIzCG,EAAUG,iBAsMcR,EAASjqB,EAAMuqB,OACnCjkB,EAAQokB,SAEL,SAAgBxiB,EAAQ0E,MACzBtG,IAAUqkB,QACN,IAAIC,MAAM,mCAGdtkB,IAAUukB,EAAmB,IAChB,UAAX3iB,QACI0E,SAKDke,QAGTP,EAAQriB,OAASA,EACjBqiB,EAAQ3d,IAAMA,IAED,KACPme,EAAWR,EAAQQ,YACnBA,EAAU,KACRC,EAAiBC,EAAoBF,EAAUR,MAC/CS,EAAgB,IACdA,IAAmBE,EAAkB,gBAClCF,MAIY,SAAnBT,EAAQriB,OAGVqiB,EAAQY,KAAOZ,EAAQa,MAAQb,EAAQ3d,SAElC,GAAuB,UAAnB2d,EAAQriB,OAAoB,IACjC5B,IAAUokB,QACZpkB,EAAQukB,EACFN,EAAQ3d;CAGhB2d,EAAQc,kBAAkBd,EAAQ3d,SAEN,WAAnB2d,EAAQriB,QACjBqiB,EAAQe,OAAO,SAAUf,EAAQ3d,KAGnCtG,EAAQqkB,MAEJY,EAASC,EAASvB,EAASjqB,EAAMuqB,MACjB,WAAhBgB,EAAOtkB,KAAmB,IAG5BX,EAAQikB,EAAQxQ,KACZ8Q,EACAY,EAEAF,EAAO3e,MAAQse,iBAIZ,CACL5pB,MAAOiqB,EAAO3e,IACdmN,KAAMwQ,EAAQxQ,MAGS,UAAhBwR,EAAOtkB,OAChBX,EAAQukB,EAGRN,EAAQriB,OAAS,QACjBqiB,EAAQ3d,IAAM2e,EAAO3e,OA9QP8e,CAAiBzB,EAASjqB,EAAMuqB,GAE7CD,WAcAkB,EAAS/oB,EAAIsnB,EAAKnd,aAEhB,CAAE3F,KAAM,SAAU2F,IAAKnK,EAAG1B,KAAKgpB,EAAKnd,IAC3C,MAAOod,SACA,CAAE/iB,KAAM,QAAS2F,IAAKod,IAhBjCT,EAAQ1U,KAAOA,MAoBX6V,EAAyB,iBACzBe,EAAyB,iBACzBd,EAAoB,YACpBE,EAAoB,YAIpBK,EAAmB,YAMdb,cACAsB,cACAC,SAIL5U,EAAoB,GACxBA,EAAkByS,GAAkB;OAC3BxpB,UAGL4rB,EAAWrrB,OAAO8W,eAClBwU,EAA0BD,GAAYA,EAASA,EAASnS,EAAO,MAC/DoS,GACAA,IAA4BtC,GAC5BxmB,EAAOjC,KAAK+qB,EAAyBrC,KAGvCzS,EAAoB8U,OAGlBC,EAAKH,EAA2BhkB,UAClCyiB,EAAUziB,UAAYpH,OAAOiO,OAAOuI,YAW7BgV,EAAsBpkB,IAC5B,OAAQ,QAAS,UAAUoJ,SAAQ,SAAS9I,GAC3C4hB,EAAOliB,EAAWM,GAAQ,SAAS0E,UAC1B3M,KAAKwqB,QAAQviB,EAAQ0E,kBAkCzBqf,EAAc3B,EAAW4B,YACvBC,EAAOjkB,EAAQ0E,EAAKoW,EAASM,OAChCiI,EAASC,EAASlB,EAAUpiB,GAASoiB,EAAW1d,MAChC,UAAhB2e,EAAOtkB,KAEJ,KACDyC,EAAS6hB,EAAO3e,IAChBtL,EAAQoI,EAAOpI,aACfA,GACiB,WAAjB8qB,EAAO9qB,IACP0B,EAAOjC,KAAKO,EAAO,WACd4qB,EAAYlJ,QAAQ1hB,EAAM+qB,SAASjK,MAAK,SAAS9gB,GACtD6qB,EAAO,OAAQ7qB,EAAO0hB,EAASM,MAC9B,SAAS0G,GACVmC,EAAO,QAASnC,EAAKhH,EAASM;IAI3B4I,EAAYlJ,QAAQ1hB,GAAO8gB,MAAK,SAASkK,GAI9C5iB,EAAOpI,MAAQgrB,EACftJ,EAAQtZ,MACP,SAASrJ,UAGH8rB,EAAO,QAAS9rB,EAAO2iB,EAASM,MAvBzCA,EAAOiI,EAAO3e,SA4Bd2f,OAgCC9B,iBA9BYviB,EAAQ0E,YACd4f,WACA,IAAIN,GAAY,SAASlJ,EAASM,GACvC6I,EAAOjkB,EAAQ0E,EAAKoW,EAASM,aAI1BiJ,EAaLA,EAAkBA,EAAgBnK,KAChCoK,EAGAA,GACEA,cAkHDvB,EAAoBF,EAAUR,OACjCriB,EAAS6iB,EAASte,SAAS8d,EAAQriB,WACnCA,IAAWjG,EAAW,IAGxBsoB,EAAQQ,SAAW,KAEI,UAAnBR,EAAQriB,OAAoB,IAE1B6iB,EAASte,SAAT,SAGF8d,EAAQriB,OAAS,SACjBqiB,EAAQ3d,IAAM3K,EACdgpB,EAAoBF,EAAUR,GAEP,UAAnBA,EAAQriB,eAGHgjB,EAIXX,EAAQriB,OAAS,QACjBqiB,EAAQ3d,IAAM,IAAI1K,UAChB,yDAGGgpB;IAGLK,EAASC,EAAStjB,EAAQ6iB,EAASte,SAAU8d,EAAQ3d,QAErC,UAAhB2e,EAAOtkB,YACTsjB,EAAQriB,OAAS,QACjBqiB,EAAQ3d,IAAM2e,EAAO3e,IACrB2d,EAAQQ,SAAW,KACZG,MAGLuB,EAAOlB,EAAO3e,WAEZ6f,EAOFA,EAAK1S,MAGPwQ,EAAQQ,EAAS2B,YAAcD,EAAKnrB,MAGpCipB,EAAQvS,KAAO+S,EAAS4B,QAQD,WAAnBpC,EAAQriB,SACVqiB,EAAQriB,OAAS,OACjBqiB,EAAQ3d,IAAM3K,GAUlBsoB,EAAQQ,SAAW,KACZG,GANEuB,GA3BPlC,EAAQriB,OAAS,QACjBqiB,EAAQ3d,IAAM,IAAI1K,UAAU,oCAC5BqoB,EAAQQ,SAAW,KACZG,YAoDF0B,EAAaC,OAChBC,EAAQ,CAAEC,OAAQF,EAAK,IAEvB,KAAKA,IACPC,EAAME,SAAWH,EAAK,IAGpB,KAAKA,IACPC,EAAMG,WAAaJ,EAAK,GACxBC,EAAMI,SAAWL,EAAK,SAGnBM,WAAW9nB,KAAKynB,YAGdM,EAAcN,OACjBvB,EAASuB,EAAMO,YAAc;CACjC9B,EAAOtkB,KAAO,gBACPskB,EAAO3e,IACdkgB,EAAMO,WAAa9B,WAGZf,EAAQL,QAIVgD,WAAa,CAAC,CAAEJ,OAAQ,SAC7B5C,EAAYnZ,QAAQ4b,EAAc3sB,WAC7BqtB,OAAM,YA8BJ5T,EAAO8E,MACVA,EAAU,KACR+O,EAAiB/O,EAASiL,MAC1B8D,SACKA,EAAexsB,KAAKyd,MAGA,mBAAlBA,EAASxG,YACXwG,MAGJhW,MAAMgW,EAASpW,QAAS,KACvBqB,GAAK,EAAGuO,EAAO,SAASA,WACjBvO,EAAI+U,EAASpW,WAChBpF,EAAOjC,KAAKyd,EAAU/U,UACxBuO,EAAK1W,MAAQkd,EAAS/U,GACtBuO,EAAK+B,MAAO,EACL/B,SAIXA,EAAK1W,MAAQW,EACb+V,EAAK+B,MAAO,EAEL/B,UAGFA,EAAKA,KAAOA,SAKhB,CAAEA,KAAM8S,YAIRA,UACA,CAAExpB,MAAOW,EAAW8X,MAAM,UA7ZnC4R,EAAkB/jB,UAAYmkB,EAAG5b,YAAcyb,EAC/CA,EAA2Bzb,YAAcwb;AACzCA,EAAkB6B,YAAc1D,EAC9B8B,EACAhC,EACA,qBAaFL,EAAQkE,oBAAsB,SAASC,OACjCC,EAAyB,mBAAXD,GAAyBA,EAAOvd,oBAC3Cwd,IACHA,IAAShC,GAG2B,uBAAnCgC,EAAKH,aAAeG,EAAKxe,QAIhCoa,EAAQqE,KAAO,SAASF,UAClBltB,OAAO2X,eACT3X,OAAO2X,eAAeuV,EAAQ9B,IAE9B8B,EAAOpV,UAAYsT,EACnB9B,EAAO4D,EAAQ9D,EAAmB,sBAEpC8D,EAAO9lB,UAAYpH,OAAOiO,OAAOsd,GAC1B2B,GAOTnE,EAAQsE,MAAQ,SAASjhB,SAChB,CAAEyf,QAASzf,IAsEpBof,EAAsBC,EAAcrkB,WACpCqkB,EAAcrkB,UAAU8hB,GAAuB,kBACtCzpB,MAETspB,EAAQ0C,cAAgBA,EAKxB1C,EAAQuE,MAAQ,SAAS7D,EAASC,EAASlqB,EAAMmqB,EAAa+B,QACxC,IAAhBA,IAAwBA,EAAcvO;KAEtCoQ,EAAO,IAAI9B,EACbpX,EAAKoV,EAASC,EAASlqB,EAAMmqB,GAC7B+B,UAGK3C,EAAQkE,oBAAoBvD,GAC/B6D,EACAA,EAAK/V,OAAOoK,MAAK,SAAS1Y,UACjBA,EAAOqQ,KAAOrQ,EAAOpI,MAAQysB,EAAK/V,WAuKjDgU,EAAsBD,GAEtBjC,EAAOiC,EAAInC,EAAmB,aAO9BmC,EAAGtC,GAAkB,kBACZxpB,MAGT8rB,EAAGtqB,SAAW,iBACL,sBAkCT8nB,EAAQxjB,KAAO,SAASrB,OAClBqB,EAAO,OACN,IAAI9C,KAAOyB,EACdqB,EAAKV,KAAKpC,UAEZ8C,EAAKioB,UAIE,SAAShW,SACPjS,EAAKqC,QAAQ,KACdnF,EAAM8C,EAAKkoB,SACXhrB,KAAOyB,SACTsT,EAAK1W,MAAQ2B,EACb+U,EAAK+B,MAAO,EACL/B,SAOXA,EAAK+B,MAAO,EACL/B,IAsCXuR,EAAQ7P,OAASA,EAMjB8Q,EAAQ5iB,UAAY,CAClBuI,YAAaqa,EAEb8C,MAAO,SAASY,WACTC,KAAO,OACPnW,KAAO;KAGPmT,KAAOlrB,KAAKmrB,MAAQnpB,OACpB8X,MAAO,OACPgR,SAAW,UAEX7iB,OAAS,YACT0E,IAAM3K,OAENkrB,WAAWnc,QAAQoc,IAEnBc,MACE,IAAI/e,KAAQlP,KAEQ,MAAnBkP,EAAKsL,OAAO,IACZzX,EAAOjC,KAAKd,KAAMkP,KACjB3G,OAAO2G,EAAKxN,MAAM,WAChBwN,GAAQlN,IAMrB8c,KAAM,gBACChF,MAAO,MAGRqU,EADYnuB,KAAKktB,WAAW,GACLE,cACH,UAApBe,EAAWnnB,WACPmnB,EAAWxhB,WAGZ3M,KAAKouB,MAGdhD,kBAAmB,SAASiD,MACtBruB,KAAK8Z,WACDuU,MAGJ/D,EAAUtqB,cACLsuB,EAAOC,EAAKC,UACnBlD,EAAOtkB,KAAO,QACdskB,EAAO3e,IAAM0hB,EACb/D,EAAQvS,KAAOwW,EAEXC,IAGFlE,EAAQriB,OAAS,OACjBqiB,EAAQ3d,IAAM3K,KAGNwsB;IAGP,IAAIhlB,EAAIxJ,KAAKktB,WAAW/kB,OAAS,EAAGqB,GAAK,IAAKA,EAAG,KAChDqjB,EAAQ7sB,KAAKktB,WAAW1jB,GACxB8hB,EAASuB,EAAMO,cAEE,SAAjBP,EAAMC,cAIDwB,EAAO,UAGZzB,EAAMC,QAAU9sB,KAAKkuB,KAAM,KACzBO,EAAW1rB,EAAOjC,KAAK+rB,EAAO,YAC9B6B,EAAa3rB,EAAOjC,KAAK+rB,EAAO,iBAEhC4B,GAAYC,EAAY,IACtB1uB,KAAKkuB,KAAOrB,EAAME,gBACbuB,EAAOzB,EAAME,UAAU,GACzB,GAAI/sB,KAAKkuB,KAAOrB,EAAMG,kBACpBsB,EAAOzB,EAAMG,iBAGjB,GAAIyB,MACLzuB,KAAKkuB,KAAOrB,EAAME,gBACbuB,EAAOzB,EAAME,UAAU,OAG3B,CAAA,IAAI2B,QAMH,IAAI/D,MAAM,6CALZ3qB,KAAKkuB,KAAOrB,EAAMG,kBACbsB,EAAOzB,EAAMG;AAU9B3B,OAAQ,SAASrkB,EAAM2F,OAChB,IAAInD,EAAIxJ,KAAKktB,WAAW/kB,OAAS,EAAGqB,GAAK,IAAKA,EAAG,KAChDqjB,EAAQ7sB,KAAKktB,WAAW1jB,MACxBqjB,EAAMC,QAAU9sB,KAAKkuB,MACrBnrB,EAAOjC,KAAK+rB,EAAO,eACnB7sB,KAAKkuB,KAAOrB,EAAMG,WAAY,KAC5B2B,EAAe9B,SAKnB8B,IACU,UAAT3nB,GACS,aAATA,IACD2nB,EAAa7B,QAAUngB,GACvBA,GAAOgiB,EAAa3B,aAGtB2B,EAAe,UAGbrD,EAASqD,EAAeA,EAAavB,WAAa,UACtD9B,EAAOtkB,KAAOA,EACdskB,EAAO3e,IAAMA,EAETgiB,QACG1mB,OAAS,YACT8P,KAAO4W,EAAa3B,WAClB/B,GAGFjrB,KAAK4uB,SAAStD,IAGvBsD,SAAU,SAAStD,EAAQ2B,MACL,UAAhB3B,EAAOtkB,WACHskB,EAAO3e;OAGK,UAAhB2e,EAAOtkB,MACS,aAAhBskB,EAAOtkB,UACJ+Q,KAAOuT,EAAO3e,IACM,WAAhB2e,EAAOtkB,WACXonB,KAAOpuB,KAAK2M,IAAM2e,EAAO3e,SACzB1E,OAAS,cACT8P,KAAO,OACa,WAAhBuT,EAAOtkB,MAAqBimB,SAChClV,KAAOkV,GAGPhC,GAGT4D,OAAQ,SAAS7B,OACV,IAAIxjB,EAAIxJ,KAAKktB,WAAW/kB,OAAS,EAAGqB,GAAK,IAAKA,EAAG,KAChDqjB,EAAQ7sB,KAAKktB,WAAW1jB,MACxBqjB,EAAMG,aAAeA,cAClB4B,SAAS/B,EAAMO,WAAYP,EAAMI,UACtCE,EAAcN,GACP5B,UAKJ,SAAS6B,OACX,IAAItjB,EAAIxJ,KAAKktB,WAAW/kB,OAAS,EAAGqB,GAAK,IAAKA,EAAG,KAChDqjB,EAAQ7sB,KAAKktB,WAAW1jB,MACxBqjB,EAAMC,SAAWA,EAAQ,KACvBxB,EAASuB,EAAMO,cACC,UAAhB9B,EAAOtkB,KAAkB;IACvB8nB,EAASxD,EAAO3e,IACpBwgB,EAAcN,UAETiC,SAML,IAAInE,MAAM,0BAGlBoE,cAAe,SAASxQ,EAAUkO,EAAYC,eACvC5B,SAAW,CACdte,SAAUiN,EAAO8E,GACjBkO,WAAYA,EACZC,QAASA,GAGS,SAAhB1sB,KAAKiI,cAGF0E,IAAM3K,GAGNipB,IAQJ3B,EA7sBM,CAotBgB0F,EAAO1F,aAIpC2F,mBAAqB5F,EACrB,MAAO6F,GAUPjvB,SAAS,IAAK,yBAAdA,CAAwCopB,mBC1uB1C,IACI1mB,GAAWf,EACXutB,GAAa9rB,GAFT/C,GASN,CAAE+J,OAAQ,SAAUoB,MAAM,EAAMC,OANtBhI,GAEoB,WAAcyrB,GAAW,OAIQ,CAC/DrpB,KAAM,SAAcpG,GAClB,OAAOyvB,GAAWxsB,GAASjD,OCV/B,IAAI6R,GAAIjR,GAEJ6B,GAAkBkB,EAGlB+rB,GAAa,GAAG1nB,KAEhB2nB,GANgBztB,GAMerB,OAC/B+uB,GALsB5rB,GAKc,OAAQ,QAI9C,CAAE2G,OAAQ;AAAS+N,OAAO,EAAM1M,OAAQ2jB,KAAgBC,IAAiB,CACzE5nB,KAAM,SAAc6nB,GAClB,OAAOH,GAAWtuB,KAAKqB,GAAgBnC,WAAqBgC,IAAdutB,EAA0B,IAAMA,MCdlF,IACIC,GAAO5tB,GAAwCoP,IAD3C1Q,GASN,CAAE+J,OAAQ,QAAS+N,OAAO,EAAM1M,QAPCrI,GAEoB,QAKW,CAChE2N,IAAK,SAAaL,GAChB,OAAO6e,GAAKxvB,KAAM2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,gBCVpE9B,GAAQI,EAIZ,SAASmvB,GAAGC,EAAGxrB,GACb,OAAO8jB,OAAO0H,EAAGxrB,oBAGKhE,IAAM,WAE5B,IAAIyvB,EAAKF,GAAG,IAAK,KAEjB,OADAE,EAAGC,UAAY,EACW,MAAnBD,EAAGxvB,KAAK,2BAGMD,IAAM,WAE3B,IAAIyvB,EAAKF,GAAG,KAAM,MAElB,OADAE,EAAGC,UAAY,EACU,MAAlBD,EAAGxvB,KAAK;CClBjB,IAUM0vB,GACAC,GAXFvI,GAAcjnB,GACdyvB,GAAgBnuB,GAChBiE,GAASxC,WAET2sB,GAAahI,OAAOrgB,UAAUxH,KAC9B8vB,GAAgBpqB,GAAO,wBAAyBzB,OAAOuD,UAAUoD,SAEjEmlB,GAAcF,GAEdG,IACEN,GAAM,IACNC,GAAM,MACVE,GAAWlvB,KAAK+uB,GAAK,KACrBG,GAAWlvB,KAAKgvB,GAAK,KACI,IAAlBD,GAAID,WAAqC,IAAlBE,GAAIF,WAGhCQ,GAAgBL,GAAcK,eAAiBL,GAAcM,aAG7DC,QAAuCtuB,IAAvB,OAAO7B,KAAK,IAAI,IAExBgwB,IAA4BG,IAAiBF,MAGvDF,GAAc,SAAcK,GAC1B,IACIX,EAAWY,EAAQzmB,EAAOP,EAD1BmmB,EAAK3vB,KAEL4nB,EAASwI,IAAiBT,EAAG/H,OAC7BC,EAAQN,GAAYzmB,KAAK6uB,GACzBloB,EAASkoB,EAAGloB,OACZgpB,EAAa,EACbC,EAAUH,EA+Cd,OA7CI3I,KAE0B,KAD5BC,EAAQA,EAAM9c,QAAQ,IAAK,KACjB1B,QAAQ,OAChBwe,GAAS,KAGX6I,EAAUtsB,OAAOmsB,GAAK7uB,MAAMiuB,EAAGC;AAE3BD,EAAGC,UAAY,KAAOD,EAAGlI,WAAakI,EAAGlI,WAAuC,OAA1B8I,EAAIZ,EAAGC,UAAY,MAC3EnoB,EAAS,OAASA,EAAS,IAC3BipB,EAAU,IAAMA,EAChBD,KAIFD,EAAS,IAAIxI,OAAO,OAASvgB,EAAS,IAAKogB,IAGzCyI,KACFE,EAAS,IAAIxI,OAAO,IAAMvgB,EAAS,WAAYogB,IAE7CsI,KAA0BP,EAAYD,EAAGC,WAE7C7lB,EAAQimB,GAAWlvB,KAAK8mB,EAAS4I,EAASb,EAAIe,GAE1C9I,EACE7d,GACFA,EAAMzH,MAAQyH,EAAMzH,MAAMZ,MAAM+uB,GAChC1mB,EAAM,GAAKA,EAAM,GAAGrI,MAAM+uB,GAC1B1mB,EAAMnB,MAAQ+mB,EAAGC,UACjBD,EAAGC,WAAa7lB,EAAM,GAAG5B,QACpBwnB,EAAGC,UAAY,EACbO,IAA4BpmB,IACrC4lB,EAAGC,UAAYD,EAAG/vB,OAASmK,EAAMnB,MAAQmB,EAAM,GAAG5B,OAASynB,GAEzDU,IAAiBvmB,GAASA,EAAM5B,OAAS,GAG3C8nB,GAAcnvB,KAAKiJ,EAAM,GAAIymB,GAAQ,WACnC,IAAKhnB,EAAI,EAAGA,EAAItB,UAAUC,OAAS,EAAGqB,SACfxH,IAAjBkG,UAAUsB,KAAkBO,EAAMP,QAAKxH,MAK1C+H,QAIX4mB,GAAiBT;CCrFT5vB,GAKN,CAAE+J,OAAQ,SAAU+N,OAAO,EAAM1M,OAAQ,IAAIvL,OAJpCyB,IAIqD,CAC9DzB,KALSyB,KCCX,IAAIsJ,GAAW5K,WACXqwB,GAAa/uB,GACb1B,GAAQmD,EACR4L,GAAkBvL,GAClBc,GAA8Bb,GAE9BmM,GAAUb,GAAgB,WAC1B8Y,GAAkBC,OAAOrgB,UAEzBipB,IAAiC1wB,IAAM,WAIzC,IAAIyvB,EAAK,IAMT,OALAA,EAAGxvB,KAAO,WACR,IAAIsJ,EAAS,GAEb,OADAA,EAAOonB,OAAS,CAAEttB,EAAG,KACdkG,GAEyB,MAA3B,GAAGsB,QAAQ4kB,EAAI,WAKpBmB,GAEgC,OAA3B,IAAI/lB,QAAQ,IAAK,MAGtBgmB,GAAU9hB,GAAgB,WAE1B+hB,KACE,IAAID,KAC6B,KAA5B,IAAIA,IAAS,IAAK,MAOzBE,IAAqC/wB,IAAM,WAE7C,IAAIyvB,EAAK,OACLuB,EAAevB,EAAGxvB,KACtBwvB,EAAGxvB,KAAO,WAAc,OAAO+wB,EAAarhB,MAAM7P,KAAMkI,YACxD,IAAIuB,EAAS,KAAK5H,MAAM8tB;CACxB,OAAyB,IAAlBlmB,EAAOtB,QAA8B,MAAdsB,EAAO,IAA4B,MAAdA,EAAO,MAG5D0nB,GAAiB,SAAUnY,EAAK7Q,EAAQhI,EAAMwL,GAC5C,IAAI8H,EAASxE,GAAgB+J,GAEzBoY,GAAuBlxB,IAAM,WAE/B,IAAI8D,EAAI,GAER,OADAA,EAAEyP,GAAU,WAAc,OAAO,GACZ,GAAd,GAAGuF,GAAKhV,MAGbqtB,EAAoBD,IAAwBlxB,IAAM,WAEpD,IAAIoxB,GAAa,EACb3B,EAAK,IAkBT,MAhBY,UAAR3W,KAIF2W,EAAK,IAGFzf,YAAc,GACjByf,EAAGzf,YAAYJ,IAAW,WAAc,OAAO6f,GAC/CA,EAAG9H,MAAQ,GACX8H,EAAGlc,GAAU,IAAIA,IAGnBkc,EAAGxvB,KAAO,WAAiC,OAAnBmxB,GAAa,EAAa,MAElD3B,EAAGlc,GAAQ,KACH6d,KAGV,IACGF,IACAC,GACQ,YAARrY,KACC4X,KACAE,IACCE,KAEM,UAARhY,IAAoBiY,GACrB,CACA,IAAIM,EAAqB,IAAI9d,GACzBsF,EAAU5Y,EAAKsT,EAAQ,GAAGuF,IAAM,SAAUwY,EAAcnb,EAAQka,EAAKkB,EAAMC,GAC7E,IAAIC,EAAQtb,EAAOlW;CACnB,OAAIwxB,IAAUhB,IAAcgB,IAAU5J,GAAgB5nB,KAChDixB,IAAwBM,EAInB,CAAE5X,MAAM,EAAMzY,MAAOkwB,EAAmBzwB,KAAKuV,EAAQka,EAAKkB,IAE5D,CAAE3X,MAAM,EAAMzY,MAAOmwB,EAAa1wB,KAAKyvB,EAAKla,EAAQob,IAEtD,CAAE3X,MAAM,KACd,CACDgX,iBAAkBA,GAClBE,6CAA8CA,KAE5CY,EAAe7Y,EAAQ,GACvB8Y,EAAc9Y,EAAQ,GAE1B7N,GAAS9G,OAAOuD,UAAWqR,EAAK4Y,GAChC1mB,GAAS6c,GAAiBtU,EAAkB,GAAVtL,EAG9B,SAAU2C,EAAQ6B,GAAO,OAAOklB,EAAY/wB,KAAKgK,EAAQ9K,KAAM2M,IAG/D,SAAU7B,GAAU,OAAO+mB,EAAY/wB,KAAKgK,EAAQ9K,QAItD2L,GAAMnH,GAA4BujB,GAAgBtU,GAAS,QAAQ,IC/HrErR,GAAW9B,EACXqB,GAAUC,EAGVkwB,GAFkBzuB,GAEM,SAI5B0uB,GAAiB,SAAUryB,GACzB,IAAIsyB,EACJ,OAAO5vB,GAAS1C,UAAmCsC,KAA1BgwB,EAAWtyB,EAAGoyB,OAA0BE,EAA0B,UAAfrwB,GAAQjC,KCTlF8a,GAASla,GAAyCka,OAItDyX,GAAiB,SAAU7X,EAAGxR,EAAO+e,GACnC,OAAO/e,GAAS+e,EAAUnN,GAAOJ,EAAGxR,GAAOT,OAAS;ECNlDxG,GAAUrB,EACVqwB,GAAa/uB,GAIjBswB,GAAiB,SAAU9J,EAAGhO,GAC5B,IAAIja,EAAOioB,EAAEjoB,KACb,GAAoB,mBAATA,EAAqB,CAC9B,IAAIsJ,EAAStJ,EAAKW,KAAKsnB,EAAGhO,GAC1B,GAAsB,iBAAX3Q,EACT,MAAMxH,UAAU,sEAElB,OAAOwH,EAGT,GAAmB,WAAf9H,GAAQymB,GACV,MAAMnmB,UAAU,+CAGlB,OAAO0uB,GAAW7vB,KAAKsnB,EAAGhO,IClBxB+X,GAAgC7xB,GAChC0xB,GAAWpwB,GACXuC,GAAWd,GACXtB,GAAyB2B,EACzBkc,GAAqBjc,GACrBsuB,GAAqBruB,GACrB6E,GAAW3E,GACXsuB,GAAiBjsB,GACjBwqB,GAAanf,GAGb4e,GAFgB3e,GAEc2e,cAC9BiC,GAAY,GAAGjtB,KACfoD,GAAM7I,KAAK6I,IACX8pB,GAAa,cAGa,QAAS,GAAG,SAAUC,EAAOC,EAAaC,GACtE,IAAIC;CAqDJ,OAzCEA,EAV2B,KAA3B,OAAO7wB,MAAM,QAAQ,IAEc,GAAnC,OAAOA,MAAM,QAAS,GAAGsG,QACO,GAAhC,KAAKtG,MAAM,WAAWsG,QACU,GAAhC,IAAItG,MAAM,YAAYsG,QAEtB,IAAItG,MAAM,QAAQsG,OAAS,GAC3B,GAAGtG,MAAM,MAAMsG,OAGC,SAAUonB,EAAWoD,GACnC,IAAI7nB,EAAS1G,OAAOrC,GAAuB/B,OACvC4yB,OAAgB5wB,IAAV2wB,EAAsBL,GAAaK,IAAU,EACvD,GAAY,IAARC,EAAW,MAAO,GACtB,QAAkB5wB,IAAdutB,EAAyB,MAAO,CAACzkB,GAErC,IAAKknB,GAASzC,GACZ,OAAOiD,EAAY1xB,KAAKgK,EAAQykB,EAAWqD;CAW7C,IATA,IAQI7oB,EAAO6lB,EAAWiD,EARlBC,EAAS,GACTjL,GAAS0H,EAAU/H,WAAa,IAAM,KAC7B+H,EAAU9H,UAAY,IAAM,KAC5B8H,EAAU5H,QAAU,IAAM,KAC1B4H,EAAU3H,OAAS,IAAM,IAClCmL,EAAgB,EAEhBC,EAAgB,IAAIhL,OAAOuH,EAAU9nB,OAAQogB,EAAQ,MAElD9d,EAAQ4mB,GAAW7vB,KAAKkyB,EAAeloB,QAC5C8kB,EAAYoD,EAAcpD,WACVmD,IACdD,EAAO1tB,KAAK0F,EAAOpJ,MAAMqxB,EAAehpB,EAAMnB,QAC1CmB,EAAM5B,OAAS,GAAK4B,EAAMnB,MAAQkC,EAAO3C,QAAQkqB,GAAUxiB,MAAMijB,EAAQ/oB,EAAMrI,MAAM,IACzFmxB,EAAa9oB,EAAM,GAAG5B,OACtB4qB,EAAgBnD,EACZkD,EAAO3qB,QAAUyqB,KAEnBI,EAAcpD,YAAc7lB,EAAMnB,OAAOoqB,EAAcpD,YAK7D,OAHImD,IAAkBjoB,EAAO3C,QACvB0qB,GAAeG,EAAc9tB,KAAK,KAAK4tB,EAAO1tB,KAAK,IAClD0tB,EAAO1tB,KAAK0F,EAAOpJ,MAAMqxB,IACzBD,EAAO3qB,OAASyqB,EAAME,EAAOpxB,MAAM,EAAGkxB,GAAOE,GAG7C,IAAIjxB,WAAMG,EAAW,GAAGmG,OACjB,SAAUonB,EAAWoD;AACnC,YAAqB3wB,IAAdutB,GAAqC,IAAVoD,EAAc,GAAKH,EAAY1xB,KAAKd,KAAMuvB,EAAWoD,IAEpEH,EAEhB,CAGL,SAAejD,EAAWoD,GACxB,IAAI3uB,EAAIjC,GAAuB/B,MAC3BizB,EAAwBjxB,MAAbutB,OAAyBvtB,EAAYutB,EAAUgD,GAC9D,YAAoBvwB,IAAbixB,EACHA,EAASnyB,KAAKyuB,EAAWvrB,EAAG2uB,GAC5BD,EAAc5xB,KAAKsD,OAAOJ,GAAIurB,EAAWoD,IAO/C,SAAUtc,EAAQsc,GAChB,IAAIO,EAAMT,EAAgBC,EAAerc,EAAQrW,KAAM2yB,EAAOD,IAAkBF,GAChF,GAAIU,EAAIpZ,KAAM,OAAOoZ,EAAI7xB,MAEzB,IAAI8xB,EAAKhvB,GAASkS,GACd+D,EAAIhW,OAAOpE,MACXiQ,EAAI2P,GAAmBuT,EAAInL,QAE3BoL,EAAkBD,EAAGxL,QACrBE,GAASsL,EAAG3L,WAAa,IAAM,KACtB2L,EAAG1L,UAAY,IAAM,KACrB0L,EAAGxL,QAAU,IAAM,KACnByI,GAAgB,IAAM,KAI/B6C,EAAW,IAAIhjB,EAAEmgB,GAAgB,OAAS+C,EAAG1rB,OAAS,IAAM0rB,EAAItL,GAChE+K,OAAgB5wB,IAAV2wB,EAAsBL,GAAaK,IAAU,EACvD,GAAY,IAARC,EAAW,MAAO,GACtB,GAAiB,IAAbxY,EAAEjS,OAAc,OAAuC,OAAhCiqB,GAAea,EAAU7Y,GAAc,CAACA,GAAK;CAIxE,IAHA,IAAIiO,EAAI,EACJgL,EAAI,EACJC,EAAI,GACDD,EAAIjZ,EAAEjS,QAAQ,CACnB8qB,EAASrD,UAAYQ,GAAgB,EAAIiD,EACzC,IACIE,EADAC,EAAIpB,GAAea,EAAU7C,GAAgBhW,EAAE1Y,MAAM2xB,GAAKjZ,GAE9D,GACQ,OAANoZ,IACCD,EAAI/qB,GAAIC,GAASwqB,EAASrD,WAAaQ,GAAgBiD,EAAI,IAAKjZ,EAAEjS,WAAakgB,EAEhFgL,EAAIpB,GAAmB7X,EAAGiZ,EAAGD,OACxB,CAEL,GADAE,EAAEluB,KAAKgV,EAAE1Y,MAAM2mB,EAAGgL,IACdC,EAAEnrB,SAAWyqB,EAAK,OAAOU,EAC7B,IAAK,IAAI9pB,EAAI,EAAGA,GAAKgqB,EAAErrB,OAAS,EAAGqB,IAEjC,GADA8pB,EAAEluB,KAAKouB,EAAEhqB,IACL8pB,EAAEnrB,SAAWyqB,EAAK,OAAOU,EAE/BD,EAAIhL,EAAIkL,GAIZ,OADAD,EAAEluB,KAAKgV,EAAE1Y,MAAM2mB,IACRiL,MAGVlD,ICrIH,IAAIruB,GAAyBzB,EAEzBmzB,GAAO,KAIXC,GAAiB,SAAU5oB,EAAQ+J,EAAK8e,EAAWtyB,GACjD,IAAI+Y,EAAIhW,OAAOrC,GAAuB+I,IAClC8oB,EAAK,IAAM/e,EAEf,MADkB,KAAd8e,IAAkBC,GAAM,IAAMD,EAAY,KAAOvvB,OAAO/C,GAAO0J,QAAQ0oB,GAAM,UAAY,KACtFG,EAAK,IAAMxZ,EAAI,KAAOvF,EAAM,KCVjC3U,GAAQI,EAIZuzB,GAAiB,SAAU1W;AACzB,OAAOjd,IAAM,WACX,IAAIgF,EAAO,GAAGiY,GAAa,KAC3B,OAAOjY,IAASA,EAAK8F,eAAiB9F,EAAKrD,MAAM,KAAKsG,OAAS,MCL/D2rB,GAAalyB,GADTtB,GAMN,CAAE+J,OAAQ,SAAU+N,OAAO,EAAM1M,OAJNrI,GAIqC,SAAW,CAC3E0wB,KAAM,SAAcC,GAClB,OAAOF,GAAW9zB,KAAM,IAAK,OAAQg0B,MCTzC,IAAIrxB,GAAWrC,EAEX+H,GAAQ1I,KAAK0I,MACb0C,GAAU,GAAGA,QACbkpB,GAAuB,8BACvBC,GAAgC,sBCJhC/B,GAAgC7xB,GAChC6D,GAAWvC,GACX6G,GAAWpF,GACXiF,GAAY5E,GACZ3B,GAAyB4B,EACzBsuB,GAAqBruB,GACrBuwB,GDEa,SAAUC,EAAS7D,EAAKlW,EAAUga,EAAUC,EAAehqB,GAC1E,IAAIiqB,EAAUla,EAAW+Z,EAAQjsB,OAC7BqsB,EAAIH,EAASlsB,OACbssB,EAAUP,GAKd,YAJsBlyB,IAAlBsyB,IACFA,EAAgB3xB,GAAS2xB,GACzBG,EAAUR,IAELlpB,GAAQjK,KAAKwJ,EAAamqB,GAAS,SAAU1qB,EAAO2qB,GACzD,IAAIC,EACJ,OAAQD,EAAGla,OAAO,IAChB,IAAK,IAAK,MAAO,IACjB,IAAK;AAAK,OAAO4Z,EACjB,IAAK,IAAK,OAAO7D,EAAI7uB,MAAM,EAAG2Y,GAC9B,IAAK,IAAK,OAAOkW,EAAI7uB,MAAM6yB,GAC3B,IAAK,IACHI,EAAUL,EAAcI,EAAGhzB,MAAM,GAAI,IACrC,MACF,QACE,IAAIwnB,GAAKwL,EACT,GAAU,IAANxL,EAAS,OAAOnf,EACpB,GAAImf,EAAIsL,EAAG,CACT,IAAItwB,EAAImE,GAAM6gB,EAAI,IAClB,OAAU,IAANhlB,EAAgB6F,EAChB7F,GAAKswB,OAA8BxyB,IAApBqyB,EAASnwB,EAAI,GAAmBwwB,EAAGla,OAAO,GAAK6Z,EAASnwB,EAAI,GAAKwwB,EAAGla,OAAO,GACvFzQ,EAET4qB,EAAUN,EAASnL,EAAI,GAE3B,YAAmBlnB,IAAZ2yB,EAAwB,GAAKA,MC9BpCC,GAAazuB,GAEbuC,GAAM/I,KAAK+I,IACXF,GAAM7I,KAAK6I,IAOf2pB,GAA8B,UAAW,GAAG,SAAUpB,EAASd,EAAewC,EAAiBpM,GAC7F,IAAI2K,EAA+C3K,EAAO2K,6CACtDF,EAAmBzK,EAAOyK,iBAC1B+D,EAAoB7D,EAA+C,IAAM,KAE7E,MAAO,CAGL,SAAiB8D,EAAaC,GAC5B,IAAI/wB,EAAIjC,GAAuB/B,MAC3B2V,EAA0B3T,MAAf8yB,OAA2B9yB,EAAY8yB,EAAY/D;CAClE,YAAoB/uB,IAAb2T,EACHA,EAAS7U,KAAKg0B,EAAa9wB,EAAG+wB,GAC9B9E,EAAcnvB,KAAKsD,OAAOJ,GAAI8wB,EAAaC,IAIjD,SAAU1e,EAAQ0e,GAChB,IACI/D,GAAgDF,GACzB,iBAAjBiE,IAA0E,IAA7CA,EAAa1rB,QAAQwrB,GAC1D,CACA,IAAI3B,EAAMT,EAAgBxC,EAAe5Z,EAAQrW,KAAM+0B,GACvD,GAAI7B,EAAIpZ,KAAM,OAAOoZ,EAAI7xB,MAG3B,IAAI8xB,EAAKhvB,GAASkS,GACd+D,EAAIhW,OAAOpE,MAEXg1B,EAA4C,mBAAjBD,EAC1BC,IAAmBD,EAAe3wB,OAAO2wB,IAE9C,IAAIn1B,EAASuzB,EAAGvzB,OAChB,GAAIA,EAAQ,CACV,IAAIq1B,EAAc9B,EAAGxL,QACrBwL,EAAGvD,UAAY,EAGjB,IADA,IAAIsF,EAAU,KACD,CACX,IAAIzrB,EAASmrB,GAAWzB,EAAI/Y,GAC5B,GAAe,OAAX3Q,EAAiB,MAGrB,GADAyrB,EAAQ9vB,KAAKqE,IACR7J,EAAQ,MAGI,KADFwE,OAAOqF,EAAO,MACR0pB,EAAGvD,UAAYqC,GAAmB7X,EAAG3R,GAAS0qB,EAAGvD,WAAYqF,IAKpF,IAFA,IAtDwBv1B,EAsDpBy1B,EAAoB,GACpBC,EAAqB,EAChB5rB,EAAI,EAAGA,EAAI0rB,EAAQ/sB,OAAQqB,IAAK,CACvCC,EAASyrB,EAAQ1rB;CAUjB,IARA,IAAI4qB,EAAUhwB,OAAOqF,EAAO,IACxB4Q,EAAW3R,GAAIF,GAAIF,GAAUmB,EAAOb,OAAQwR,EAAEjS,QAAS,GACvDksB,EAAW,GAMNgB,EAAI,EAAGA,EAAI5rB,EAAOtB,OAAQktB,IAAKhB,EAASjvB,UAlEzCpD,KADctC,EAmE8C+J,EAAO4rB,IAlEvD31B,EAAK0E,OAAO1E,IAmEhC,IAAI40B,EAAgB7qB,EAAOonB,OAC3B,GAAImE,EAAmB,CACrB,IAAIM,EAAe,CAAClB,GAASxqB,OAAOyqB,EAAUha,EAAUD,QAClCpY,IAAlBsyB,GAA6BgB,EAAalwB,KAAKkvB,GACnD,IAAIhqB,EAAclG,OAAO2wB,EAAallB,WAAM7N,EAAWszB,SAEvDhrB,EAAc6pB,GAAgBC,EAASha,EAAGC,EAAUga,EAAUC,EAAeS,GAE3E1a,GAAY+a,IACdD,GAAqB/a,EAAE1Y,MAAM0zB,EAAoB/a,GAAY/P,EAC7D8qB,EAAqB/a,EAAW+Z,EAAQjsB,QAG5C,OAAOgtB,EAAoB/a,EAAE1Y,MAAM0zB,YC7FzCG,GAAiB,gDCDbxzB,GAAyBzB,EAGzBk1B,GAAa,kDACbC,GAAQzN,OAAO,IAAMwN,GAAaA,GAAa,KAC/CE,GAAQ1N,OAAOwN,GAAaA,GAAa,MAGzC1sB,GAAe,SAAU/B,GAC3B,OAAO,SAAUiC;AACf,IAAI8B,EAAS1G,OAAOrC,GAAuBiH,IAG3C,OAFW,EAAPjC,IAAU+D,EAASA,EAAOC,QAAQ0qB,GAAO,KAClC,EAAP1uB,IAAU+D,EAASA,EAAOC,QAAQ2qB,GAAO,KACtC5qB,IAIX6qB,GAAiB,CAGf3M,MAAOlgB,GAAa,GAGpBmgB,IAAKngB,GAAa,GAGlB8sB,KAAM9sB,GAAa,IC1BjB5I,GAAQI,EACRi1B,GAAc3zB,GCCdi0B,GAAQj0B,GAAoCg0B,KADxCt1B,GAMN,CAAE+J,OAAQ,SAAU+N,OAAO,EAAM1M,ODAlB,SAAUyR,GACzB,OAAOjd,IAAM,WACX,QAASq1B,GAAYpY,MANf,OAAA,MAMqCA,MAAyBoY,GAAYpY,GAAajO,OAASiO,KCF/D2Y,CAAuB,SAAW,CAC3EF,KAAM,WACJ,OAAOC,GAAM71B,SCRjB,IAAIuR,GAAIjR,GACJJ,GAAQ0B,EACR6K,GAAUpJ,GACVjB,GAAWsB,EACXf,GAAWgB,EACX8E,GAAW7E,GACX4kB,GAAiB1kB,GACjBiM,GAAqB5J,GACrBuiB,GAA+BlX,GAE/BrF,GAAauF,GAEbqkB,GAHkBtkB,GAGqB,sBACvCukB,GAAmB,iBACnBC,GAAiC,iCAKjCC,GAA+B/pB,IAAc,KAAOjM,IAAM,WAC5D,IAAIyoB,EAAQ;CAEZ,OADAA,EAAMoN,KAAwB,EACvBpN,EAAM/e,SAAS,KAAO+e,KAG3BwN,GAAkBzN,GAA6B,UAE/C0N,GAAqB,SAAUpyB,GACjC,IAAK5B,GAAS4B,GAAI,OAAO,EACzB,IAAIqyB,EAAaryB,EAAE+xB,IACnB,YAAsB/zB,IAAfq0B,IAA6BA,EAAa5pB,GAAQzI,OAQzD,CAAEqG,OAAQ,QAAS+N,OAAO,EAAM1M,QALpBwqB,KAAiCC,IAKK,CAElDvsB,OAAQ,SAAgB+C,GACtB,IAGInD,EAAG2f,EAAGhhB,EAAQmuB,EAAKC,EAHnBvyB,EAAIrB,GAAS3C,MACbszB,EAAIvjB,GAAmB/L,EAAG,GAC1BklB,EAAI,EAER,IAAK1f,GAAK,EAAGrB,EAASD,UAAUC,OAAQqB,EAAIrB,EAAQqB,IAElD,GAAI4sB,GADJG,GAAW,IAAP/sB,EAAWxF,EAAIkE,UAAUsB,IACF,CAEzB,GAAI0f,GADJoN,EAAM7tB,GAAS8tB,EAAEpuB,SACH6tB,GAAkB,MAAM/zB,UAAUg0B,IAChD,IAAK9M,EAAI,EAAGA,EAAImN,EAAKnN,IAAKD,IAASC,KAAKoN,GAAG/N,GAAe8K,EAAGpK,EAAGqN,EAAEpN,QAC7D,CACL,GAAID,GAAK8M,GAAkB,MAAM/zB,UAAUg0B,IAC3CzN,GAAe8K,EAAGpK,IAAKqN,GAI3B,OADAjD,EAAEnrB,OAAS+gB,EACJoK,KCzDX,IACIkD,GAAY50B,GAAuCwH,SACnD8N,GAAmB7T,GAFf/C,GAMN,CAAE+J,OAAQ;AAAS+N,OAAO,GAAQ,CAClChP,SAAU,SAAkBH,GAC1B,OAAOutB,GAAUx2B,KAAMiJ,EAAIf,UAAUC,OAAS,EAAID,UAAU,QAAKlG,SAKpD,YCdjB,IAAIgwB,GAAW1xB,GAEfm2B,GAAiB,SAAU/2B,GACzB,GAAIsyB,GAAStyB,GACX,MAAMuC,UAAU,iDAChB,OAAOvC,GCHPoyB,GAFkBxxB,GAEM,SAE5Bo2B,GAAiB,SAAUvZ,GACzB,IAAI9G,EAAS,IACb,IACE,MAAM8G,GAAa9G,GACnB,MAAOsgB,GACP,IAEE,OADAtgB,EAAOyb,KAAS,EACT,MAAM3U,GAAa9G,GAC1B,MAAOugB,KACT,OAAO,GCXPC,GAAaj1B,GACbG,GAAyBsB,EAFrB/C,GAON,CAAE+J,OAAQ,SAAU+N,OAAO,EAAM1M,QAJRhI,GAIsC,aAAe,CAC9E0F,SAAU,SAAkB0tB,GAC1B,SAAU1yB,OAAOrC,GAAuB/B,OACrCqJ,QAAQwtB,GAAWC,GAAe5uB,UAAUC,OAAS,EAAID,UAAU,QAAKlG;uBCT/E+0B,IAFYz2B,GAEY,WAEtB,OAAOC,OAAOy2B,aAAaz2B,OAAO02B,kBAAkB,QCJlDjxB,GAAa1F,GACb8B,GAAWR,EACXkB,GAAMO,GACN7C,GAAiBkD,GAA+CQ,EAEhEgzB,GAAWtzB,GAEXuzB,GAHMxzB,GAGS,QACf8B,GAAK,EAGLuxB,GAAez2B,OAAOy2B,cAAgB,WACxC,OAAO,GAGLI,GAAc,SAAU13B,GAC1Bc,GAAed,EAAIy3B,GAAU,CAAE91B,MAAO,CACpCg2B,SAAU,OAAQ5xB,GAClB6xB,SAAU,OAoCVC,GAAOC,WAAiB,CAC1BC,UAAU,EACVC,QAlCY,SAAUh4B,EAAI8O,GAE1B,IAAKpM,GAAS1C,GAAK,MAAoB,iBAANA,EAAiBA,GAAmB,iBAANA,EAAiB,IAAM,KAAOA,EAC7F,IAAKoD,GAAIpD,EAAIy3B,IAAW,CAEtB,IAAKH,GAAat3B,GAAK,MAAO,IAE9B,IAAK8O,EAAQ,MAAO,IAEpB4oB,GAAY13B,GAEZ,OAAOA,EAAGy3B,IAAUE,UAwBtBM,YArBgB,SAAUj4B,EAAI8O,GAC9B,IAAK1L,GAAIpD,EAAIy3B,IAAW;AAEtB,IAAKH,GAAat3B,GAAK,OAAO,EAE9B,IAAK8O,EAAQ,OAAO,EAEpB4oB,GAAY13B,GAEZ,OAAOA,EAAGy3B,IAAUG,UAatBM,SATa,SAAUl4B,GAEvB,OADIw3B,IAAYK,GAAKE,UAAYT,GAAat3B,KAAQoD,GAAIpD,EAAIy3B,KAAWC,GAAY13B,GAC9EA,IAUTsG,GAAWmxB,KAAY,EC7DvB,IAAI/0B,GAAW9B,EACX4X,GAAiBtW,GAGrBi2B,GAAiB,SAAU7uB,EAAO8uB,EAAOC,GACvC,IAAIC,EAAWC,EAUf,OAPE/f,IAE0C,mBAAlC8f,EAAYF,EAAM5nB,cAC1B8nB,IAAcD,GACd31B,GAAS61B,EAAqBD,EAAUrwB,YACxCswB,IAAuBF,EAAQpwB,WAC/BuQ,GAAelP,EAAOivB,GACjBjvB,GCdLuI,GAAIjR,GACJV,GAASgC,EACT2I,GAAWlH,GACX6H,GAAWxH,WACXw0B,GAAyBv0B,WACzB2a,GAAU1a,GACVma,GAAaja,GACb1B,GAAW+D,EACXjG,GAAQsR,EACRiO,GAA8BhO,GAC9BlC,GAAiBmC,GACjBmmB,GAAoBlmB,GAExBwmB,GAAiB,SAAUta,EAAkB+I,EAASwR;AACpD,IAAIhoB,GAA8C,IAArCyN,EAAiBxU,QAAQ,OAClCgvB,GAAgD,IAAtCxa,EAAiBxU,QAAQ,QACnCivB,EAAQloB,EAAS,MAAQ,MACzBmoB,EAAoB34B,GAAOie,GAC3B2a,EAAkBD,GAAqBA,EAAkB5wB,UACzDmW,EAAcya,EACdE,EAAW,GAEXC,EAAY,SAAU1f,GACxB,IAAIwY,EAAegH,EAAgBxf,GACnC9N,GAASstB,EAAiBxf,EACjB,OAAPA,EAAe,SAAa3X,GAE1B,OADAmwB,EAAa1wB,KAAKd,KAAgB,IAAVqB,EAAc,EAAIA,GACnCrB,MACE,UAAPgZ,EAAkB,SAAUhW,GAC9B,QAAOq1B,IAAYj2B,GAASY,KAAewuB,EAAa1wB,KAAKd,KAAc,IAARgD,EAAY,EAAIA,IAC1E,OAAPgW,EAAe,SAAahW,GAC9B,OAAOq1B,IAAYj2B,GAASY,QAAOhB,EAAYwvB,EAAa1wB,KAAKd,KAAc,IAARgD,EAAY,EAAIA,IAC9E,OAAPgW,EAAe,SAAahW,GAC9B,QAAOq1B,IAAYj2B,GAASY,KAAewuB,EAAa1wB,KAAKd,KAAc,IAARgD,EAAY,EAAIA,IACjF,SAAaA,EAAK3B,GAEpB,OADAmwB,EAAa1wB,KAAKd,KAAc,IAARgD,EAAY,EAAIA,EAAK3B,GACtCrB;CAYb,GAPcuK,GACZsT,EAC4B,mBAArB0a,KAAqCF,GAAWG,EAAgBznB,UAAY7Q,IAAM,YACvF,IAAIq4B,GAAoB/e,UAAUzB,YAMpC+F,EAAcsa,EAAOO,eAAe/R,EAAS/I,EAAkBzN,EAAQkoB,GACvEJ,GAAuBT,UAAW,OAC7B,GAAIltB,GAASsT,GAAkB,GAAO,CAC3C,IAAI+a,EAAW,IAAI9a,EAEf+a,EAAiBD,EAASN,GAAOD,EAAU,IAAM,EAAG,IAAMO,EAE1DE,EAAuB54B,IAAM,WAAc04B,EAAS91B,IAAI,MAGxDi2B,EAAmBtZ,IAA4B,SAAUlB,GAAY,IAAIga,EAAkBha,MAE3Fya,GAAcX,GAAWn4B,IAAM,WAIjC,IAFA,IAAI+4B,EAAY,IAAIV,EAChB3vB,EAAQ,EACLA,KAASqwB,EAAUX,GAAO1vB,EAAOA,GACxC,OAAQqwB,EAAUn2B,KAAK,MAGpBi2B,KACHjb,EAAc8I,GAAQ,SAAUkR,EAAOvZ,GACrCR,GAAW+Z,EAAOha,EAAaD,GAC/B,IAAInO,EAAOmoB,GAAkB,IAAIU,EAAqBT,EAAOha,GAE7D,OADgB9b,MAAZuc,GAAuBD,GAAQC,EAAU7O,EAAK4oB,GAAQ,CAAE5oB,KAAMA,EAAMiP,WAAYvO,IAC7EV,MAEG/H,UAAY6wB,EACxBA,EAAgBtoB,YAAc4N,IAG5Bgb,GAAwBE,KAC1BN,EAAU,UACVA,EAAU;AACVtoB,GAAUsoB,EAAU,SAGlBM,GAAcH,IAAgBH,EAAUJ,GAGxCD,GAAWG,EAAgBpY,cAAcoY,EAAgBpY,MAU/D,OAPAqY,EAAS5a,GAAoBC,EAC7BvM,GAAE,CAAE3R,QAAQ,EAAM8L,OAAQoS,GAAeya,GAAqBE,GAE9DlpB,GAAeuO,EAAaD,GAEvBwa,GAASD,EAAOc,UAAUpb,EAAaD,EAAkBzN,GAEvD0N,GCpGLtd,GAAiBF,GAA+C4D,EAChEsK,GAAS5M,GACT+b,GAActa,GACd8M,GAAOzM,GACPqa,GAAapa,GACb2a,GAAU1a,GACV6U,GAAiB3U,GACjB8Z,GAAazX,GACb3C,GAAcgO,EACdkmB,GAAUjmB,WAA0CimB,QAGpD/jB,GAFsBjC,GAEiBlM,IACvC2zB,GAHsBznB,GAGuB5K,UAEjDsyB,GAAiB,CACfT,eAAgB,SAAU/R,EAAS/I,EAAkBzN,EAAQkoB,GAC3D,IAAIroB,EAAI2W,GAAQ,SAAUlX,EAAM6O,GAC9BR,GAAWrO,EAAMO,EAAG4N,GACpBlK,GAAiBjE,EAAM,CACrB1I,KAAM6W,EACNjV,MAAO4F,GAAO,MACd0L,WAAOlY,EACP8f,UAAM9f,EACNsY,KAAM,IAEH9W,KAAakM,EAAK4K,KAAO,GACdtY,MAAZuc,GAAuBD,GAAQC,EAAU7O,EAAK4oB,GAAQ,CAAE5oB,KAAMA,EAAMiP,WAAYvO,OAGlFnJ,EAAmBkyB,GAAuBtb,GAE1CgM,EAAS,SAAUna,EAAM1M,EAAK3B,GAChC,IAEIg4B,EAAUzwB,EAFVvC,EAAQY,EAAiByI,GACzBmd,EAAQyM,EAAS5pB,EAAM1M;CAqBzB,OAlBE6pB,EACFA,EAAMxrB,MAAQA,GAGdgF,EAAMyb,KAAO+K,EAAQ,CACnBjkB,MAAOA,EAAQ8uB,GAAQ10B,GAAK,GAC5BA,IAAKA,EACL3B,MAAOA,EACPg4B,SAAUA,EAAWhzB,EAAMyb,KAC3B/J,UAAM/V,EACNu3B,SAAS,GAENlzB,EAAM6T,QAAO7T,EAAM6T,MAAQ2S,GAC5BwM,IAAUA,EAASthB,KAAO8U,GAC1BrpB,GAAa6C,EAAMiU,OAClB5K,EAAK4K,OAEI,MAAV1R,IAAevC,EAAMuC,MAAMA,GAASikB,IACjCnd,GAGP4pB,EAAW,SAAU5pB,EAAM1M,GAC7B,IAGI6pB,EAHAxmB,EAAQY,EAAiByI,GAEzB9G,EAAQ8uB,GAAQ10B,GAEpB,GAAc,MAAV4F,EAAe,OAAOvC,EAAMuC,MAAMA,GAEtC,IAAKikB,EAAQxmB,EAAM6T,MAAO2S,EAAOA,EAAQA,EAAM9U,KAC7C,GAAI8U,EAAM7pB,KAAOA,EAAK,OAAO6pB,GAwFjC,OApFAlP,GAAY1N,EAAEtI,UAAW,CAIvByY,MAAO,WAKL,IAJA,IACI/Z,EAAQY,EADDjH,MAEP0K,EAAOrE,EAAMuC,MACbikB,EAAQxmB,EAAM6T,MACX2S,GACLA,EAAM0M,SAAU,EACZ1M,EAAMwM,WAAUxM,EAAMwM,SAAWxM,EAAMwM,SAASthB,UAAO/V,UACpD0I,EAAKmiB,EAAMjkB,OAClBikB,EAAQA,EAAM9U,KAEhB1R,EAAM6T,MAAQ7T,EAAMyb,UAAO9f;AACvBwB,GAAa6C,EAAMiU,KAAO,EAXnBta,KAYDsa,KAAO,GAKnBkf,OAAU,SAAUx2B,GAClB,IAAI0M,EAAO1P,KACPqG,EAAQY,EAAiByI,GACzBmd,EAAQyM,EAAS5pB,EAAM1M,GAC3B,GAAI6pB,EAAO,CACT,IAAI9U,EAAO8U,EAAM9U,KACbmW,EAAOrB,EAAMwM,gBACVhzB,EAAMuC,MAAMikB,EAAMjkB,OACzBikB,EAAM0M,SAAU,EACZrL,IAAMA,EAAKnW,KAAOA,GAClBA,IAAMA,EAAKshB,SAAWnL,GACtB7nB,EAAM6T,OAAS2S,IAAOxmB,EAAM6T,MAAQnC,GACpC1R,EAAMyb,MAAQ+K,IAAOxmB,EAAMyb,KAAOoM,GAClC1qB,GAAa6C,EAAMiU,OAClB5K,EAAK4K,OACV,QAASuS,GAKb9b,QAAS,SAAiBJ,GAIxB,IAHA,IAEIkc,EAFAxmB,EAAQY,EAAiBjH,MACzB6Q,EAAgBV,GAAKQ,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAAW,GAE/E6qB,EAAQA,EAAQA,EAAM9U,KAAO1R,EAAM6T,OAGxC,IAFArJ,EAAcgc,EAAMxrB,MAAOwrB,EAAM7pB,IAAKhD,MAE/B6sB,GAASA,EAAM0M,SAAS1M,EAAQA,EAAMwM,UAMjDv2B,IAAK,SAAaE,GAChB,QAASs2B,EAASt5B,KAAMgD,MAI5B2a,GAAY1N,EAAEtI,UAAWyI,EAAS,CAGhC3P,IAAK,SAAauC,GAChB,IAAI6pB,EAAQyM,EAASt5B,KAAMgD;CAC3B,OAAO6pB,GAASA,EAAMxrB,OAIxBmE,IAAK,SAAaxC,EAAK3B,GACrB,OAAOwoB,EAAO7pB,KAAc,IAARgD,EAAY,EAAIA,EAAK3B,KAEzC,CAGFo4B,IAAK,SAAap4B,GAChB,OAAOwoB,EAAO7pB,KAAMqB,EAAkB,IAAVA,EAAc,EAAIA,EAAOA,MAGrDmC,IAAahD,GAAeyP,EAAEtI,UAAW,OAAQ,CACnDlH,IAAK,WACH,OAAOwG,EAAiBjH,MAAMsa,QAG3BrK,GAETipB,UAAW,SAAUjpB,EAAG4N,EAAkBzN,GACxC,IAAIspB,EAAgB7b,EAAmB,YACnC8b,EAA6BR,GAAuBtb,GACpD+b,EAA2BT,GAAuBO,GAUtDjhB,GAAexI,EAAG4N,GAAkB,SAAUjE,EAAUC,GACtDlG,GAAiB3T,KAAM,CACrBgH,KAAM0yB,EACNrvB,OAAQuP,EACRvT,MAAOszB,EAA2B/f,GAClCC,KAAMA,EACNiI,UAAM9f,OAEP,WAKD,IAJA,IAAIqE,EAAQuzB,EAAyB55B,MACjC6Z,EAAOxT,EAAMwT,KACbgT,EAAQxmB,EAAMyb,KAEX+K,GAASA,EAAM0M,SAAS1M,EAAQA,EAAMwM,SAE7C,OAAKhzB,EAAMgE,SAAYhE,EAAMyb,KAAO+K,EAAQA,EAAQA,EAAM9U,KAAO1R,EAAMA,MAAM6T,OAMjE,QAARL,EAAuB,CAAExY,MAAOwrB,EAAM7pB,IAAK8W,MAAM,GACzC,UAARD,EAAyB;AAAExY,MAAOwrB,EAAMxrB,MAAOyY,MAAM,GAClD,CAAEzY,MAAO,CAACwrB,EAAM7pB,IAAK6pB,EAAMxrB,OAAQyY,MAAM,IAN9CzT,EAAMgE,YAASrI,EACR,CAAEX,WAAOW,EAAW8X,MAAM,MAMlC1J,EAAS,UAAY,UAAWA,GAAQ,GAK3CwN,GAAWC,KCtMEvd,GAKW,OAAO,SAAUu5B,GAC3C,OAAO,WAAiB,OAAOA,EAAK75B,KAAMkI,UAAUC,OAASD,UAAU,QAAKlG,MALvDJ,ICDvB,IAAI2P,GAAIjR,GACJw5B,GAAQl4B,GAAwCwP,KAChD8F,GAAmB7T,GAEnB02B,GAAO,OACPC,IAAc,EAGdD,KAAQ,IAAIrtB,MAAM,GAAO,MAAE,WAAcstB,IAAc,QAIzD,CAAE3vB,OAAQ,QAAS+N,OAAO,EAAM1M,OAAQsuB,IAAe,CACvD5oB,KAAM,SAAcT,GAClB,OAAOmpB,GAAM95B,KAAM2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,SAKxD+3B,ICpBjB,IAAIv2B,GAAclD,EACd25B,GAA6Br4B,GAC7Bs4B,GAAc72B,GACd+sB,GAAgB1sB,GAA8C0sB;CAK9D5sB,KAA8B,KAAd,KAAKqkB,OAAgBuI,KACvC6J,GAA2B/1B,EAAE8jB,OAAOrgB,UAAW,QAAS,CACtDrG,cAAc,EACdb,IAAKy5B,KCVT,IACIC,GAAUv4B,GAAwCqP,OAD9C3Q,GASN,CAAE+J,OAAQ,QAAS+N,OAAO,EAAM1M,QAPCrI,GAEoB,WAKW,CAChE4N,OAAQ,SAAgBN,GACtB,OAAOwpB,GAAQn6B,KAAM2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCX3E,IAeMf,GAfFsQ,GAAIjR,GACJM,GAA2BgB,EAA2DsC,EACtFuE,GAAWpF,GACXwzB,GAAanzB,GACb3B,GAAyB4B,EACzBy2B,GAAuBx2B,GAIvBy2B,GAAc,GAAGC,WACjB9xB,GAAM7I,KAAK6I,IAEX+xB,GAA0BH,GAAqB,iBASjD,CAAE/vB,OAAQ,SAAU+N,OAAO,EAAM1M,UAPC6uB,KAC9Bt5B,GAAaL,GAAyBwD,OAAOuD,UAAW,eACrD1G,IAAeA,GAAWM,aAK8Bg5B,IAA2B,CAC1FD,WAAY,SAAoBxD,GAC9B,IAAIpnB,EAAOtL,OAAOrC,GAAuB/B,OACzC62B,GAAWC;CACX,IAAIluB,EAAQH,GAASD,GAAIN,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAAW0N,EAAKvH,SAC3EqyB,EAASp2B,OAAO0yB,GACpB,OAAOuD,GACHA,GAAYv5B,KAAK4O,EAAM8qB,EAAQ5xB,GAC/B8G,EAAKhO,MAAMkH,EAAOA,EAAQ4xB,EAAOryB,UAAYqyB,KC7BrD,IAAIjpB,GAAIjR,GACJm6B,GAAa74B,GAAwCyP,UACrD6F,GAAmB7T,GAEnBq3B,GAAa,YACbV,IAAc,EAGdU,KAAc,IAAIhuB,MAAM,GAAa,WAAE,WAAcstB,IAAc,QAIrE,CAAE3vB,OAAQ,QAAS+N,OAAO,EAAM1M,OAAQsuB,IAAe,CACvD3oB,UAAW,SAAmBV,GAC5B,OAAO8pB,GAAWz6B,KAAM2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,SAK7D04B;CCnBjB,IAAInpB,GAAIjR,GACJqI,GAAkB/G,GAClB0G,GAAYjF,GACZoF,GAAW/E,GACXf,GAAWgB,EACXoM,GAAqBnM,GACrB4kB,GAAiB1kB,GAGjBglB,GAF+B3iB,GAEoB,UAEnDuC,GAAM/I,KAAK+I,IACXF,GAAM7I,KAAK6I,IACXwtB,GAAmB,iBACnB2E,GAAkC,qCAKpC,CAAEtwB,OAAQ,QAAS+N,OAAO,EAAM1M,QAASod,IAAuB,CAChE8R,OAAQ,SAAgB5R,EAAO6R,GAC7B,IAIIC,EAAaC,EAAmBzH,EAAGnK,EAAG9J,EAAM2b,EAJ5Ch3B,EAAIrB,GAAS3C,MACbs2B,EAAM7tB,GAASzE,EAAEmE,QACjB8yB,EAActyB,GAAgBqgB,EAAOsN,GACrC4E,EAAkBhzB,UAAUC,OAWhC,GATwB,IAApB+yB,EACFJ,EAAcC,EAAoB,EACL,IAApBG,GACTJ,EAAc,EACdC,EAAoBzE,EAAM2E,IAE1BH,EAAcI,EAAkB,EAChCH,EAAoBvyB,GAAIE,GAAIJ,GAAUuyB,GAAc,GAAIvE,EAAM2E,IAE5D3E,EAAMwE,EAAcC,EAAoB/E,GAC1C,MAAM/zB,UAAU04B,IAGlB,IADArH,EAAIvjB,GAAmB/L,EAAG+2B,GACrB5R,EAAI,EAAGA,EAAI4R,EAAmB5R,KACjC9J,EAAO4b,EAAc9R,KACTnlB,GAAGwkB,GAAe8K,EAAGnK,EAAGnlB,EAAEqb,IAGxC,GADAiU,EAAEnrB,OAAS4yB,EACPD,EAAcC,EAAmB,CACnC,IAAK5R,EAAI8R,EAAa9R,EAAImN,EAAMyE,EAAmB5R,IAEjD6R,EAAK7R,EAAI2R,GADTzb,EAAO8J,EAAI4R,KAEC/2B,EAAGA,EAAEg3B,GAAMh3B,EAAEqb,UACbrb,EAAEg3B;CAEhB,IAAK7R,EAAImN,EAAKnN,EAAImN,EAAMyE,EAAoBD,EAAa3R,WAAYnlB,EAAEmlB,EAAI,QACtE,GAAI2R,EAAcC,EACvB,IAAK5R,EAAImN,EAAMyE,EAAmB5R,EAAI8R,EAAa9R,IAEjD6R,EAAK7R,EAAI2R,EAAc,GADvBzb,EAAO8J,EAAI4R,EAAoB,KAEnB/2B,EAAGA,EAAEg3B,GAAMh3B,EAAEqb,UACbrb,EAAEg3B,GAGlB,IAAK7R,EAAI,EAAGA,EAAI2R,EAAa3R,IAC3BnlB,EAAEmlB,EAAI8R,GAAe/yB,UAAUihB,EAAI,GAGrC,OADAnlB,EAAEmE,OAASmuB,EAAMyE,EAAoBD,EAC9BxH,SCpCPjkB;EC5BJ8rB,GAAwC,oBAAhBC,aAAmD,oBAAbC,SDA1DC,GAAsBh7B,GACtBkD,GAAc5B,EACdhC,GAASyD,EACTjB,GAAWsB,EACXZ,GAAMa,GACNhC,GAAUiC,GACVY,GAA8BV,GAC9BoH,GAAW/E,WACX3F,GAAiBgR,GAA+CtN,EAChEmT,GAAiB5F,GACjByG,GAAiBxG,GACjBzC,GAAkB0C,GAClB/L,GAAMgM,GAEN2pB,GAAY37B,GAAO27B,UACnBC,GAAqBD,IAAaA,GAAU5zB,UAC5C8zB,GAAoB77B,GAAO67B,kBAC3BC,GAA6BD,IAAqBA,GAAkB9zB,UACpEg0B,GAAaJ,IAAalkB,GAAekkB,IACzCK,GAAsBJ,IAAsBnkB,GAAemkB,IAC3D5nB,GAAkBrT,OAAOoH,UACzBk0B,GAAgBjoB,GAAgBioB,cAEhCvsB,GAAgBL,GAAgB,eAChC6sB,GAAkBl2B,GAAI,mBAEtBm2B,GAA4BT,MAAyBpjB,IAA4C,UAA1BvW,GAAQ/B,GAAOo8B,OACtFC,IAA0B,EAG1BC,GAA6B,CAC/BX,UAAW,EACXY,WAAY,EACZV,kBAAmB,EACnBW,WAAY,EACZC,YAAa,EACbC,WAAY,EACZC,YAAa;AACbC,aAAc,EACdC,aAAc,GAGZC,GAA8B,CAChCC,cAAe,EACfC,eAAgB,GAWdC,GAAe,SAAUn9B,GAC3B,IAAK0C,GAAS1C,GAAK,OAAO,EAC1B,IAAIo9B,EAAQn7B,GAAQjC,GACpB,OAAOoD,GAAIo5B,GAA4BY,IAClCh6B,GAAI45B,GAA6BI,IA0DxC,IAAKztB,MAAQ6sB,GACNt8B,GAAOyP,MAAO0sB,IAA4B,GAIjD,KAAKA,IAAkD,mBAAdJ,IAA4BA,KAAe17B,SAAS0H,aAE3Fg0B,GAAa,WACX,MAAM15B,UAAU,yBAEd85B,IAA2B,IAAK1sB,MAAQ6sB,GACtCt8B,GAAOyP,KAAO6I,GAAetY,GAAOyP,IAAOssB,IAInD,KAAKI,KAA8BH,IAAuBA,KAAwBhoB,MAChFgoB,GAAsBD,GAAWh0B,UAC7Bo0B,IAA2B,IAAK1sB,MAAQ6sB,GACtCt8B,GAAOyP,KAAO6I,GAAetY,GAAOyP,IAAM1H,UAAWi0B,IAS7D,GAJIG,IAA6B1kB,GAAeqkB,MAAgCE,IAC9E1jB,GAAewjB,GAA4BE,IAGzCp4B,KAAgBV,GAAI84B,GAAqBtsB,IAK3C,IAAKD,MAJL4sB,IAA0B,EAC1Bz7B,GAAeo7B,GAAqBtsB,GAAe,CAAE7O,IAAK;AACxD,OAAO2B,GAASpC,MAAQA,KAAK87B,SAAmB95B,KAErCk6B,GAAgCt8B,GAAOyP,KAClD7K,GAA4B5E,GAAOyP,IAAOysB,GAAiBzsB,QAI/D0tB,GAAiB,CACfhB,0BAA2BA,GAC3BD,gBAAiBG,IAA2BH,GAC5CkB,YA/FgB,SAAUt9B,GAC1B,GAAIm9B,GAAan9B,GAAK,OAAOA,EAC7B,MAAMuC,UAAU,gCA8FhBg7B,uBA3F2B,SAAUhtB,GACrC,GAAIiI,IACF,GAAI2jB,GAAc/6B,KAAK66B,GAAY1rB,GAAI,OAAOA,OACzC,IAAK,IAAIitB,KAAShB,GAA4B,GAAIp5B,GAAIo5B,GAA4B7sB,IAAO,CAC9F,IAAI8tB,EAAwBv9B,GAAOs9B,GACnC,GAAIC,IAA0BltB,IAAMktB,GAAyBtB,GAAc/6B,KAAKq8B,EAAuBltB,IACrG,OAAOA,EAET,MAAMhO,UAAU,4CAoFlBm7B,uBAjF2B,SAAUpkB,EAAKqkB,EAAU3xB,GACpD,GAAKlI,GAAL,CACA,GAAIkI,EAAQ,IAAK,IAAIwxB,KAAShB,GAA4B;AACxD,IAAIiB,EAAwBv9B,GAAOs9B,GACnC,GAAIC,GAAyBr6B,GAAIq6B,EAAsBx1B,UAAWqR,GAAM,WAC/DmkB,EAAsBx1B,UAAUqR,GACvC,MAAO5Y,KAENw7B,GAAoB5iB,KAAQtN,GAC/BR,GAAS0wB,GAAqB5iB,EAAKtN,EAAS2xB,EACxCtB,IAA6BP,GAAmBxiB,IAAQqkB,KAwE9DC,6BApEiC,SAAUtkB,EAAKqkB,EAAU3xB,GAC1D,IAAIwxB,EAAOC,EACX,GAAK35B,GAAL,CACA,GAAI0U,GAAgB,CAClB,GAAIxM,EAAQ,IAAKwxB,KAAShB,GAExB,IADAiB,EAAwBv9B,GAAOs9B,KACFp6B,GAAIq6B,EAAuBnkB,GAAM,WACrDmkB,EAAsBnkB,GAC7B,MAAO5Y,IAEX,GAAKu7B,GAAW3iB,KAAQtN,EAKjB,OAHL,IACE,OAAOR,GAASywB,GAAY3iB,EAAKtN,EAAS2xB,EAAWtB,IAA6BJ,GAAW3iB,IAAQqkB,GACrG,MAAOj9B,KAGb,IAAK88B,KAAShB,KACZiB,EAAwBv9B,GAAOs9B,KACAC,EAAsBnkB,KAAQtN,GAC3DR,GAASiyB,EAAuBnkB,EAAKqkB,KAiDzCE,OAlHW,SAAgB79B,GAC3B,IAAK0C,GAAS1C,GAAK,OAAO,EAC1B,IAAIo9B,EAAQn7B,GAAQjC,GACpB,MAAiB,aAAVo9B,GACFh6B,GAAIo5B,GAA4BY,IAChCh6B,GAAI45B,GAA6BI,IA8GtCD,aAAcA,GACdlB,WAAYA;AACZC,oBAAqBA,IEpKnBh8B,GAASU,EACTJ,GAAQ0B,EACR6d,GAA8Bpc,GAC9B04B,GAA4Br4B,GAA+Cq4B,0BAE3EX,GAAcx7B,GAAOw7B,YACrBG,GAAY37B,GAAO27B,UAEvBiC,IAAkBzB,KAA8B77B,IAAM,WACpDq7B,GAAU,QACLr7B,IAAM,WACX,IAAIq7B,IAAW,QACV9b,IAA4B,SAAUlB,GAC3C,IAAIgd,GACJ,IAAIA,GAAU,MACd,IAAIA,GAAU,KACd,IAAIA,GAAUhd,MACb,IAASre,IAAM,WAEhB,OAAkE,IAA3D,IAAIq7B,GAAU,IAAIH,GAAY,GAAI,OAAGp5B,GAAWmG,UCpBrDG,GAAYhI,GACZmI,GAAW7G,GAIf67B,GAAiB,SAAU/9B,GACzB,QAAWsC,IAAPtC,EAAkB,OAAO,EAC7B,IAAIg+B,EAASp1B,GAAU5I,GACnByI,EAASM,GAASi1B,GACtB,GAAIA,IAAWv1B,EAAQ,MAAMw1B,WAAW,yBACxC,OAAOx1B;ECTLy1B,GAAMj+B,KAAKi+B,IACXC,GAAMl+B,KAAKk+B,IACXx1B,GAAQ1I,KAAK0I,MACby1B,GAAMn+B,KAAKm+B,IACXC,GAAMp+B,KAAKo+B,ICJXp7B,GAAWrC,EACXqI,GAAkB/G,GAClB6G,GAAWpF,GAIf26B,GAAiB,SAAc38B,GAO7B,IANA,IAAI2C,EAAIrB,GAAS3C,MACbmI,EAASM,GAASzE,EAAEmE,QACpB+yB,EAAkBhzB,UAAUC,OAC5BS,EAAQD,GAAgBuyB,EAAkB,EAAIhzB,UAAU,QAAKlG,EAAWmG,GACxE8gB,EAAMiS,EAAkB,EAAIhzB,UAAU,QAAKlG,EAC3Ci8B,OAAiBj8B,IAARinB,EAAoB9gB,EAASQ,GAAgBsgB,EAAK9gB,GACxD81B,EAASr1B,GAAO5E,EAAE4E,KAAWvH,EACpC,OAAO2C,GCdLpE,GAASU,EACTkD,GAAc5B,EACd05B,GAAsBj4B,GACtBmB,GAA8Bd,GAC9Bia,GAAcha,GACdzD,GAAQ0D,EACRma,GAAaja,GACbwE,GAAYnC,GACZsC,GAAW+I,GACXisB,GAAUhsB,GACVysB,GFuEa,CACfC,KA5ES,SAAUT,EAAQU,EAAgBC,GAC3C,IAOIC,EAAUC,EAAU3uB,EAPpB4uB,EAAS,IAAI9xB,MAAM2xB,GACnBI,EAAyB,EAARJ,EAAYD,EAAiB,EAC9CM,GAAQ,GAAKD,GAAkB,EAC/BE,EAAQD,GAAQ,EAChBE,EAAwB,KAAnBR,EAAwBP,GAAI,GAAI,IAAMA,GAAI,GAAI,IAAM,EACzDgB,EAAOnB,EAAS,GAAgB,IAAXA,GAAgB,EAAIA,EAAS,EAAI,EAAI,EAC1D90B,EAAQ,EAkCZ,KAhCA80B,EAASE,GAAIF,KAECA,GAAUA,IAAWoB,EAAAA,GAEjCP,EAAWb,GAAUA,EAAS,EAAI;AAClCY,EAAWI,IAEXJ,EAAWj2B,GAAMy1B,GAAIJ,GAAUK,IAC3BL,GAAU9tB,EAAIiuB,GAAI,GAAIS,IAAa,IACrCA,IACA1uB,GAAK,IAGL8tB,GADEY,EAAWK,GAAS,EACZC,EAAKhvB,EAELgvB,EAAKf,GAAI,EAAG,EAAIc,IAEf/uB,GAAK,IAChB0uB,IACA1uB,GAAK,GAEH0uB,EAAWK,GAASD,GACtBH,EAAW,EACXD,EAAWI,GACFJ,EAAWK,GAAS,GAC7BJ,GAAYb,EAAS9tB,EAAI,GAAKiuB,GAAI,EAAGO,GACrCE,GAAsBK,IAEtBJ,EAAWb,EAASG,GAAI,EAAGc,EAAQ,GAAKd,GAAI,EAAGO,GAC/CE,EAAW,IAGRF,GAAkB,EAAGI,EAAO51B,KAAsB,IAAX21B,EAAgBA,GAAY,IAAKH,GAAkB,GAGjG,IAFAE,EAAWA,GAAYF,EAAiBG,EACxCE,GAAkBL,EACXK,EAAiB,EAAGD,EAAO51B,KAAsB,IAAX01B,EAAgBA,GAAY,IAAKG,GAAkB,GAEhG,OADAD,IAAS51B,IAAiB,IAAPi2B,EACZL,GA+BPO,OA5BW,SAAUP,EAAQJ,GAC7B,IAQIG,EARAF,EAAQG,EAAOr2B,OACfs2B,EAAyB,EAARJ,EAAYD,EAAiB,EAC9CM,GAAQ,GAAKD,GAAkB,EAC/BE,EAAQD,GAAQ,EAChBM,EAAQP,EAAiB,EACzB71B,EAAQy1B,EAAQ,EAChBQ,EAAOL,EAAO51B,KACd01B,EAAkB,IAAPO,EAGf,IADAA,IAAS,EACFG,EAAQ,EAAGV,EAAsB,IAAXA,EAAiBE,EAAO51B,GAAQA,IAASo2B,GAAS,GAI/E,IAHAT,EAAWD,GAAY,IAAMU,GAAS,EACtCV,KAAcU,EACdA,GAASZ,EACFY,EAAQ,EAAGT,EAAsB,IAAXA,EAAiBC,EAAO51B,GAAQA,IAASo2B,GAAS,GAC/E,GAAiB,IAAbV,EACFA,EAAW,EAAIK,MACV;AAAA,GAAIL,IAAaI,EACtB,OAAOH,EAAWU,IAAMJ,GAAQC,EAAAA,EAAWA,EAAAA,EAE3CP,GAAsBV,GAAI,EAAGO,GAC7BE,GAAsBK,EACtB,OAAQE,GAAQ,EAAI,GAAKN,EAAWV,GAAI,EAAGS,EAAWF,KEnEtD/mB,GAAiB1F,GACjBuG,GAAiBtG,GACjB/H,GAAsBgI,GAAsD3N,EAC5E1D,GAAiBsR,GAA+C5N,EAChE85B,GAAYjsB,GACZxC,GAAiB0C,GAGjBhL,GAFsBiL,GAEiBzR,IACvCkT,GAHsBzB,GAGiB1M,IACvC05B,GAAe,cACfC,GAAY,WAGZC,GAAc,cACdC,GAAoBz/B,GAAmB,YACvC0/B,GAAeD,GACfE,GAAY3/B,GAAgB,SAC5B4/B,GAAqBD,IAAaA,GAAmB,UACrD3rB,GAAkBrT,OAAOoH,UACzBg2B,GAAa/9B,GAAO+9B,WAEpB8B,GAAcvB,GAAQC,KACtBuB,GAAgBxB,GAAQa,OAExBY,GAAW,SAAUjC,GACvB,MAAO,CAAU,IAATA,IAGNkC,GAAY,SAAUlC,GACxB,MAAO,CAAU,IAATA,EAAeA,GAAU,EAAI,MAGnCmC,GAAY,SAAUnC,GACxB,MAAO,CAAU,IAATA,EAAeA,GAAU,EAAI,IAAMA,GAAU,GAAK,IAAMA,GAAU,GAAK,MAG7EoC,GAAc,SAAUtB,GAC1B,OAAOA,EAAO,IAAM,GAAKA,EAAO,IAAM,GAAKA,EAAO,IAAM,EAAIA,EAAO;EAGjEuB,GAAc,SAAUrC,GAC1B,OAAO+B,GAAY/B,EAAQ,GAAI,IAG7BsC,GAAc,SAAUtC,GAC1B,OAAO+B,GAAY/B,EAAQ,GAAI,IAG7BuC,GAAY,SAAUniB,EAAa9a,GACrCxC,GAAesd,EAAqB,UAAG9a,EAAK,CAAEvC,IAAK,WAAc,OAAOwG,GAAiBjH,MAAMgD,OAG7FvC,GAAM,SAAUy/B,EAAMC,EAAOv3B,EAAOw3B,GACtC,IAAIC,EAAW5C,GAAQ70B,GACnB/D,EAAQoC,GAAiBi5B,GAC7B,GAAIG,EAAWF,EAAQt7B,EAAMy7B,WAAY,MAAM3C,GAAWyB,IAC1D,IAAIf,EAAQp3B,GAAiBpC,EAAM25B,QAAQH,MACvCrV,EAAQqX,EAAWx7B,EAAM07B,WACzBpC,EAAOE,EAAM38B,MAAMsnB,EAAOA,EAAQmX,GACtC,OAAOC,EAAiBjC,EAAOA,EAAKpQ,WAGlCvoB,GAAM,SAAU06B,EAAMC,EAAOv3B,EAAO43B,EAAYn/B,EAAO++B,GACzD,IAAIC,EAAW5C,GAAQ70B,GACnB/D,EAAQoC,GAAiBi5B,GAC7B,GAAIG,EAAWF,EAAQt7B,EAAMy7B,WAAY,MAAM3C,GAAWyB,IAI1D,IAHA,IAAIf,EAAQp3B,GAAiBpC,EAAM25B,QAAQH,MACvCrV,EAAQqX,EAAWx7B,EAAM07B,WACzBpC,EAAOqC,GAAYn/B,GACdmI,EAAI,EAAGA,EAAI22B,EAAO32B,IAAK60B,EAAMrV,EAAQxf,GAAK20B,EAAKiC,EAAiB52B,EAAI22B,EAAQ32B,EAAI,IAG3F,GAAK8xB,GA0FE,CAEL,IAAKp7B,IAAM,WACTm/B,GAAkB;MACbn/B,IAAM,WACX,IAAIm/B,IAAmB,OACnBn/B,IAAM,WAIV,OAHA,IAAIm/B,GACJ,IAAIA,GAAkB,KACtB,IAAIA,GAAkBJ,KACfI,GAAkBnwB,MAAQgwB,MAC/B,CAOF,IADA,IAC+Dl8B,GAD3Dy9B,IAJJnB,GAAe,SAAqBn3B,GAElC,OADA4V,GAAW/d,KAAMs/B,IACV,IAAID,GAAkB5B,GAAQt1B,MAEU,UAAIk3B,GAA2B,UACvEv5B,GAAO+D,GAAoBw1B,IAAoBhK,GAAI,EAAQvvB,GAAKqC,OAASktB,KACzEryB,GAAM8C,GAAKuvB,SAASiK,IACzB96B,GAA4B86B,GAAct8B,GAAKq8B,GAAkBr8B,KAGrEy9B,GAAqBvwB,YAAcovB,GAIjCpnB,IAAkBb,GAAemoB,MAAwB5rB,IAC3DsE,GAAesnB,GAAoB5rB,IAIrC,IAAI8sB,GAAW,IAAInB,GAAU,IAAID,GAAa,IAC1CqB,GAAWnB,GAAmBoB,QAClCF,GAASE,QAAQ,EAAG,YACpBF,GAASE,QAAQ,EAAG,aAChBF,GAASG,QAAQ,IAAOH,GAASG,QAAQ,IAAIljB,GAAY6hB,GAAoB,CAC/EoB,QAAS,SAAiBL,EAAYl/B,GACpCs/B,GAAS7/B,KAAKd,KAAMugC,EAAYl/B,GAAS,IAAM;AAEjDy/B,SAAU,SAAkBP,EAAYl/B,GACtCs/B,GAAS7/B,KAAKd,KAAMugC,EAAYl/B,GAAS,IAAM,MAEhD,CAAEiG,QAAQ,SApIbg4B,GAAe,SAAqBn3B,GAClC4V,GAAW/d,KAAMs/B,GAAcJ,IAC/B,IAAIoB,EAAa7C,GAAQt1B,GACzBwL,GAAiB3T,KAAM,CACrBq+B,MAAOL,GAAUl9B,KAAK,IAAI4L,MAAM4zB,GAAa,GAC7CA,WAAYA,IAET98B,KAAaxD,KAAKsgC,WAAaA,IAGtCf,GAAY,SAAkBf,EAAQ+B,EAAYD,GAChDviB,GAAW/d,KAAMu/B,GAAWJ,IAC5BphB,GAAWygB,EAAQc,GAAcH,IACjC,IAAI4B,EAAe95B,GAAiBu3B,GAAQ8B,WACxCU,EAAS14B,GAAUi4B,GACvB,GAAIS,EAAS,GAAKA,EAASD,EAAc,MAAMpD,GAAW,gBAE1D,GAAIqD,GADJV,OAA4Bt+B,IAAfs+B,EAA2BS,EAAeC,EAASv4B,GAAS63B,IAC/CS,EAAc,MAAMpD,GA9E/B,gBA+EfhqB,GAAiB3T,KAAM,CACrBw+B,OAAQA,EACR8B,WAAYA,EACZC,WAAYS,IAETx9B,KACHxD,KAAKw+B,OAASA,EACdx+B,KAAKsgC,WAAaA,EAClBtgC,KAAKugC,WAAaS,IAIlBx9B,KACFy8B,GAAUX,GAAc;AACxBW,GAAUV,GAAW,UACrBU,GAAUV,GAAW,cACrBU,GAAUV,GAAW,eAGvB5hB,GAAY4hB,GAAmB,UAAG,CAChCsB,QAAS,SAAiBN,GACxB,OAAO9/B,GAAIT,KAAM,EAAGugC,GAAY,IAAM,IAAM,IAE9CU,SAAU,SAAkBV,GAC1B,OAAO9/B,GAAIT,KAAM,EAAGugC,GAAY,IAElCW,SAAU,SAAkBX,GAC1B,IAAIlC,EAAQ59B,GAAIT,KAAM,EAAGugC,EAAYr4B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,GAC3E,OAAQq8B,EAAM,IAAM,EAAIA,EAAM,KAAO,IAAM,IAE7C8C,UAAW,SAAmBZ,GAC5B,IAAIlC,EAAQ59B,GAAIT,KAAM,EAAGugC,EAAYr4B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,GAC3E,OAAOq8B,EAAM,IAAM,EAAIA,EAAM,IAE/B+C,SAAU,SAAkBb,GAC1B,OAAOT,GAAYr/B,GAAIT,KAAM,EAAGugC,EAAYr4B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,KAEpFq/B,UAAW,SAAmBd;AAC5B,OAAOT,GAAYr/B,GAAIT,KAAM,EAAGugC,EAAYr4B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MAAgB,GAEpGs/B,WAAY,SAAoBf,GAC9B,OAAOb,GAAcj/B,GAAIT,KAAM,EAAGugC,EAAYr4B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,GAAY,KAElGu/B,WAAY,SAAoBhB,GAC9B,OAAOb,GAAcj/B,GAAIT,KAAM,EAAGugC,EAAYr4B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,GAAY,KAElG4+B,QAAS,SAAiBL,EAAYl/B,GACpCmE,GAAIxF,KAAM,EAAGugC,EAAYZ,GAAUt+B,IAErCy/B,SAAU,SAAkBP,EAAYl/B,GACtCmE,GAAIxF,KAAM,EAAGugC,EAAYZ,GAAUt+B,IAErCmgC,SAAU,SAAkBjB,EAAYl/B,GACtCmE,GAAIxF,KAAM,EAAGugC,EAAYX,GAAWv+B,EAAO6G,UAAUC,OAAS,EAAID,UAAU,QAAKlG,IAEnFy/B,UAAW,SAAmBlB,EAAYl/B,GACxCmE,GAAIxF,KAAM,EAAGugC,EAAYX,GAAWv+B,EAAO6G,UAAUC,OAAS,EAAID,UAAU,QAAKlG;AAEnF0/B,SAAU,SAAkBnB,EAAYl/B,GACtCmE,GAAIxF,KAAM,EAAGugC,EAAYV,GAAWx+B,EAAO6G,UAAUC,OAAS,EAAID,UAAU,QAAKlG,IAEnF2/B,UAAW,SAAmBpB,EAAYl/B,GACxCmE,GAAIxF,KAAM,EAAGugC,EAAYV,GAAWx+B,EAAO6G,UAAUC,OAAS,EAAID,UAAU,QAAKlG,IAEnF4/B,WAAY,SAAoBrB,EAAYl/B,GAC1CmE,GAAIxF,KAAM,EAAGugC,EAAYR,GAAa1+B,EAAO6G,UAAUC,OAAS,EAAID,UAAU,QAAKlG,IAErF6/B,WAAY,SAAoBtB,EAAYl/B,GAC1CmE,GAAIxF,KAAM,EAAGugC,EAAYP,GAAa3+B,EAAO6G,UAAUC,OAAS,EAAID,UAAU,QAAKlG,SAiD1Es9B,GAAcJ,OACdK,GAAWJ,QAE1B2C,GAAiB,CACf1G,YAAakE,GACbjE,SAAUkE,IClORj3B,GAAYhI,GCAZyhC,GDEa,SAAUriC,GACzB,IAAI+J,EAASnB,GAAU5I,GACvB,GAAI+J,EAAS,EAAG,MAAMk0B,WAAW,qCACjC,OAAOl0B;ECHTu4B,GAAiB,SAAUtiC,EAAIuiC,GAC7B,IAAIjB,EAASe,GAAkBriC,GAC/B,GAAIshC,EAASiB,EAAO,MAAMtE,WAAW,gBACrC,OAAOqD,GCLLr+B,GAAWrC,EACXmI,GAAW7G,GACXqc,GAAoB5a,GACpB2a,GAAwBta,GACxByM,GAAOxM,GACPs5B,GAAyBr5B,GAA+Cq5B,uBCJxE1rB,GAAIjR,GACJV,GAASgC,EACT4B,GAAcH,EACd6+B,GAA8Cx+B,GAC9Cy+B,GAAsBx+B,GACtBy+B,GAAoBx+B,GACpBma,GAAaja,GACb3C,GAA2BgF,EAC3B3B,GAA8BgN,GAC9B/I,GAAWgJ,GACXgsB,GAAU/rB,GACVswB,GAAWrwB,GACXtP,GAAcuP,EACd9O,GAAM+O,GACNlQ,GAAUmQ,GACV1P,GAAW2P,EACXvD,GAASyD,GACTiG,GAAiBhG,GACjBrI,GAAsBsI,GAAsDjO,EAC5Em+B,GDba,SAAc56B,GAC7B,IAKI+B,EAAGrB,EAAQsB,EAAQiV,EAAMlS,EAAUuL,EALnC/T,EAAIrB,GAAS8E,GACbyzB,EAAkBhzB,UAAUC,OAC5Bm6B,EAAQpH,EAAkB,EAAIhzB,UAAU,QAAKlG,EAC7CugC,OAAoBvgC,IAAVsgC,EACVhV,EAAiBrP,GAAkBja,GAEvC,GAAsBhC,MAAlBsrB,IAAgCtP,GAAsBsP,GAIxD,IAFAvV,GADAvL,EAAW8gB,EAAexsB,KAAKkD,IACf+T,KAChB/T,EAAI,KACK0a,EAAO3G,EAAKjX,KAAK0L,IAAWsN,MACnC9V,EAAEoB,KAAKsZ,EAAKrd,OAQhB,IALIkhC,GAAWrH,EAAkB,IAC/BoH,EAAQnyB,GAAKmyB,EAAOp6B,UAAU,GAAI,IAEpCC,EAASM,GAASzE,EAAEmE;AACpBsB,EAAS,IAAKwzB,GAAuBj9B,MAA5B,CAAmCmI,GACvCqB,EAAI,EAAGrB,EAASqB,EAAGA,IACtBC,EAAOD,GAAK+4B,EAAUD,EAAMt+B,EAAEwF,GAAIA,GAAKxF,EAAEwF,GAE3C,OAAOC,GCTLsH,GAAUuB,GAAwCvB,QAClD6M,GAAarL,GACbhO,GAAuBiO,GACvBrI,GAAiCsI,EAEjColB,GAAoBllB,GAEpB1L,GAHsByL,GAGiBjS,IACvCkT,GAJsBjB,GAIiBlN,IACvCwO,GAAuBzP,GAAqBL,EAC5C6P,GAAiC5J,GAA+BjG,EAChEs+B,GAAQ7iC,KAAK6iC,MACb7E,GAAa/9B,GAAO+9B,WACpBvC,GAAcgH,GAAkBhH,YAChCC,GAAW+G,GAAkB/G,SAC7BU,GAA4BoG,GAAoBpG,0BAChDD,GAAkBqG,GAAoBrG,gBACtCH,GAAawG,GAAoBxG,WACjCC,GAAsBuG,GAAoBvG,oBAC1CqB,GAAyBkF,GAAoBlF,uBAC7CJ,GAAesF,GAAoBtF,aACnC4F,GAAoB,oBACpBC,GAAe,eAEfC,GAAW,SAAU1yB,EAAG2yB,GAI1B,IAHA,IAAIh6B,EAAQ,EACRT,EAASy6B,EAAKz6B,OACdsB,EAAS,IAAKwzB,GAAuBhtB,GAA5B,CAAgC9H,GACtCA,EAASS,GAAOa,EAAOb,GAASg6B,EAAKh6B,KAC5C,OAAOa,GAGLw2B,GAAY,SAAUvgC,EAAIsD,GAC5BgR,GAAqBtU,EAAIsD,EAAK;AAAEvC,IAAK,WACnC,OAAOwG,GAAiBjH,MAAMgD,OAI9B6/B,GAAgB,SAAUnjC,GAC5B,IAAIo9B,EACJ,OAAOp9B,aAAc07B,IAAwC,gBAAxB0B,EAAQn7B,GAAQjC,KAAkC,qBAATo9B,GAG5EgG,GAAoB,SAAUz4B,EAAQrH,GACxC,OAAO65B,GAAaxyB,IACD,iBAAPrH,GACPA,KAAOqH,GACPjG,QAAQpB,IAAQoB,OAAOpB,IAG1B+/B,GAAkC,SAAkC14B,EAAQrH,GAC9E,OAAO8/B,GAAkBz4B,EAAQrH,EAAMX,GAAYW,GAAK,IACpD7B,GAAyB,EAAGkJ,EAAOrH,IACnC+Q,GAA+B1J,EAAQrH,IAGzCggC,GAAwB,SAAwB34B,EAAQrH,EAAK/B,GAC/D,QAAI6hC,GAAkBz4B,EAAQrH,EAAMX,GAAYW,GAAK,KAChDZ,GAASnB,IACT6B,GAAI7B,EAAY,WACf6B,GAAI7B,EAAY,QAChB6B,GAAI7B,EAAY,QAEhBA,EAAWK,cACVwB,GAAI7B,EAAY,cAAeA,EAAWM,UAC1CuB,GAAI7B,EAAY,gBAAiBA,EAAWC,WAI1C8S,GAAqB3J,EAAQrH,EAAK/B,IAFzCoJ,EAAOrH,GAAO/B,EAAWI,MAClBgJ,IAIP7G,IACGu4B,KACH5xB,GAA+BjG,EAAI6+B;AACnCx+B,GAAqBL,EAAI8+B,GACzB/C,GAAUrE,GAAqB,UAC/BqE,GAAUrE,GAAqB,cAC/BqE,GAAUrE,GAAqB,cAC/BqE,GAAUrE,GAAqB,WAGjCrqB,GAAE,CAAElH,OAAQ,SAAUoB,MAAM,EAAMC,QAASqwB,IAA6B,CACtEn7B,yBAA0BmiC,GAC1BviC,eAAgBwiC,KAGlBC,WAAiB,SAAUl8B,EAAM6f,EAASsc,GACxC,IAAIjB,EAAQl7B,EAAKgD,MAAM,QAAQ,GAAK,EAChC8T,EAAmB9W,GAAQm8B,EAAU,UAAY,IAAM,QACvDC,EAAS,MAAQp8B,EACjBq8B,EAAS,MAAQr8B,EACjBs8B,EAA8BzjC,GAAOie,GACrCsf,EAAwBkG,EACxBC,EAAiCnG,GAAyBA,EAAsBx1B,UAChF8wB,EAAW,GAaX8K,EAAa,SAAU7zB,EAAM9G,GAC/BoL,GAAqBtE,EAAM9G,EAAO,CAChCnI,IAAK,WACH,OAdO,SAAUiP,EAAM9G,GAC3B,IAAI8B,EAAOzD,GAAiByI,GAC5B,OAAOhF,EAAKw1B,KAAKiD,GAAQv6B,EAAQq5B,EAAQv3B,EAAK61B,YAAY,GAY/CiD,CAAOxjC,KAAM4I,IAEtBpD,IAAK,SAAUnE,GACb,OAZO,SAAUqO,EAAM9G,EAAOvH,GAClC,IAAIqJ,EAAOzD,GAAiByI;CACxBwzB,IAAS7hC,GAASA,EAAQmhC,GAAMnhC,IAAU,EAAI,EAAIA,EAAQ,IAAO,IAAe,IAARA,GAC5EqJ,EAAKw1B,KAAKkD,GAAQx6B,EAAQq5B,EAAQv3B,EAAK61B,WAAYl/B,GAAO,GAS/C+T,CAAOpV,KAAM4I,EAAOvH,IAE7BH,YAAY,KAIX66B,GAwCMmG,KACT/E,EAAwBvW,GAAQ,SAAUkR,EAAOptB,EAAM+4B,EAAkBC,GAEvE,OADA3lB,GAAW+Z,EAAOqF,EAAuBtf,GAClCga,GACAz1B,GAASsI,GACVm4B,GAAcn4B,QAA0B1I,IAAZ0hC,EAC5B,IAAIL,EAA4B34B,EAAMs3B,GAASyB,EAAkBxB,GAAQyB,QACpD1hC,IAArByhC,EACE,IAAIJ,EAA4B34B,EAAMs3B,GAASyB,EAAkBxB,IACjE,IAAIoB,EAA4B34B,GAClCmyB,GAAanyB,GAAci4B,GAASxF,EAAuBzyB,GACxD23B,GAAevhC,KAAKq8B,EAAuBzyB,GAPtB,IAAI24B,EAA4B5F,GAAQ/yB,IAQjEotB,EAAOqF,MAGVjlB,IAAgBA,GAAeilB,EAAuBxB,IAC1D5qB,GAAQlH,GAAoBw5B,IAA8B,SAAUrgC,GAC5DA,KAAOm6B,GACX34B,GAA4B24B,EAAuBn6B,EAAKqgC,EAA4BrgC,OAGxFm6B,EAAsBx1B,UAAY27B,IA5DlCnG,EAAwBvW,GAAQ,SAAUlX,EAAMhF,EAAMs2B,EAAQ0C,GAC5D3lB,GAAWrO,EAAMytB,EAAuBtf,GACxC,IAEI2gB,EAAQ8B,EAAYn4B,EAFpBS,EAAQ,EACR23B,EAAa,EAEjB,GAAKn+B,GAASsI,GAIP,CAAA,IAAIm4B,GAAcn4B,GAalB,OAAImyB,GAAanyB,GACfi4B,GAASxF,EAAuBzyB,GAEhC23B,GAAevhC,KAAKq8B,EAAuBzyB,GAflD8zB,EAAS9zB,EACT61B,EAAayB,GAAShB,EAAQiB,GAC9B,IAAI0B,EAAOj5B,EAAK41B;CAChB,QAAgBt+B,IAAZ0hC,EAAuB,CACzB,GAAIC,EAAO1B,EAAO,MAAMtE,GAAW+E,IAEnC,IADApC,EAAaqD,EAAOpD,GACH,EAAG,MAAM5C,GAAW+E,SAGrC,IADApC,EAAa73B,GAASi7B,GAAWzB,GAChB1B,EAAaoD,EAAM,MAAMhG,GAAW+E,IAEvDv6B,EAASm4B,EAAa2B,OAftB95B,EAASs1B,GAAQ/yB,GAEjB8zB,EAAS,IAAIpD,GADbkF,EAAan4B,EAAS85B,GA2BxB,IAPAtuB,GAAiBjE,EAAM,CACrB8uB,OAAQA,EACR+B,WAAYA,EACZD,WAAYA,EACZn4B,OAAQA,EACR+3B,KAAM,IAAI7E,GAASmD,KAEd51B,EAAQT,GAAQo7B,EAAW7zB,EAAM9G,QAGtCsP,IAAgBA,GAAeilB,EAAuBxB,IAC1D2H,EAAiCnG,EAAsBx1B,UAAY6G,GAAOotB,KAyBxE0H,EAA+BpzB,cAAgBitB,GACjD34B,GAA4B8+B,EAAgC,cAAenG,GAGzErB,IACFt3B,GAA4B8+B,EAAgCxH,GAAiBje,GAG/E4a,EAAS5a,GAAoBsf,EAE7B5rB,GAAE,CACA3R,QAAQ,EAAM8L,OAAQyxB,GAAyBkG,EAA6B13B,MAAOowB,IAClFtD,GAEGgK,MAAqBtF,GACzB34B,GAA4B24B,EAAuBsF,GAAmBR,GAGlEQ,MAAqBa,GACzB9+B,GAA4B8+B,EAAgCb,GAAmBR,GAGjFrkB,GAAWC,KAERolB,WAAiB,gBCrOU3iC,YAIN,SAAS,SAAUu5B,GAC7C,OAAO,SAAoBnvB,EAAM61B,EAAYp4B;AAC3C,OAAO0xB,EAAK75B,KAAM0K,EAAM61B,EAAYp4B,OCLxC,IAAIxF,GAAWrC,EACXqI,GAAkB/G,GAClB6G,GAAWpF,GAEXmF,GAAM7I,KAAK6I,ICHXo7B,GDQa,GAAGC,YAAc,SAAoBx5B,EAAkB2e,GACtE,IAAIhlB,EAAIrB,GAAS3C,MACbs2B,EAAM7tB,GAASzE,EAAEmE,QACjB6yB,EAAKryB,GAAgB0B,EAAQisB,GAC7BjX,EAAO1W,GAAgBqgB,EAAOsN,GAC9BrN,EAAM/gB,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAC5Cm+B,EAAQ33B,SAAaxG,IAARinB,EAAoBqN,EAAM3tB,GAAgBsgB,EAAKqN,IAAQjX,EAAMiX,EAAM0E,GAChF8I,EAAM,EAMV,IALIzkB,EAAO2b,GAAMA,EAAK3b,EAAO8gB,IAC3B2D,GAAO,EACPzkB,GAAQ8gB,EAAQ,EAChBnF,GAAMmF,EAAQ,GAETA,KAAU,GACX9gB,KAAQrb,EAAGA,EAAEg3B,GAAMh3B,EAAEqb,UACbrb,EAAEg3B,GACdA,GAAM8I,EACNzkB,GAAQykB,EACR,OAAO9/B,GCxBPg5B,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,cAAc,SAAoB/yB,EAAQ2e,GAC/D,OAAO4a,GAAY9iC,KAAKk8B,GAAYh9B,MAAOqK,EAAQ2e,EAAO9gB,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCTlG,IACI+hC,GAASniC,GAAwCuP,MAEjD6rB,GAHsB18B,GAGY08B;AAHZ18B,GAIuB88B,wBAI1B,SAAS,SAAezsB,GAC7C,OAAOozB,GAAO/G,GAAYh9B,MAAO2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCTrF,IACIgiC,GAAQpiC,GAERo7B,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAK1B,QAAQ,SAAc/7B,GAC3C,OAAO2iC,GAAMn0B,MAAMmtB,GAAYh9B,MAAOkI,cCXxC,IAAI+0B,GAAyB38B,GAA+C28B,uBACxErd,GAAqBhe,GCCrBu4B,GAAUv4B,GAAwCqP,OAClDgzB,GDAa,SAAUrL,EAAUgK,GAKnC,IAJA,IAAI3yB,EAAI2P,GAAmBgZ,EAAUA,EAAS1oB,aAC1CtH,EAAQ,EACRT,EAASy6B,EAAKz6B,OACdsB,EAAS,IAAKwzB,GAAuBhtB,GAA5B,CAAgC9H,GACtCA,EAASS,GAAOa,EAAOb,GAASg6B,EAAKh6B,KAC5C,OAAOa,GCJLuzB,GAJsB18B,GAIY08B,eAJZ18B,GAKuB88B,wBAI1B,UAAU,SAAgBzsB;AAC/C,IAAIiyB,EAAOzI,GAAQ6C,GAAYh9B,MAAO2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,GACxF,OAAOiiC,GAAmBjkC,KAAM4iC,MCXlC,IACI9I,GAAQl4B,GAAwCwP,KAEhD4rB,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,QAAQ,SAAc8G,GAC3C,OAAOpK,GAAMkD,GAAYh9B,MAAOkkC,EAAWh8B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCTnF,IACIy4B,GAAa74B,GAAwCyP,UAErD2rB,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,aAAa,SAAmB8G,GACrD,OAAOzJ,GAAWuC,GAAYh9B,MAAOkkC,EAAWh8B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCTxF,IACIqR,GAAWzR,GAAwCmP,QAEnDisB,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,WAAW,SAAiBzsB;AACjD0C,GAAS2pB,GAAYh9B,MAAO2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCThF,IACIw0B,GAAY50B,GAAuCwH,SAEnD4zB,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,YAAY,SAAkB+G,GACnD,OAAO3N,GAAUwG,GAAYh9B,MAAOmkC,EAAej8B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCT3F,IACIoiC,GAAWxiC,GAAuCyH,QAElD2zB,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,WAAW,SAAiB+G,GACjD,OAAOC,GAASpH,GAAYh9B,MAAOmkC,EAAej8B,UAAUC,OAAS,EAAID,UAAU,QAAKlG;CCT1F,IAAIpC,GAASU,EACT6hC,GAAsBvgC,GACtByiC,GAAiBhhC,GAGjBmU,GAFkB9T,GAES,YAC3By4B,GAAav8B,GAAOu8B,WACpBmI,GAAcD,GAAe5qB,OAC7B8qB,GAAYF,GAAev+B,KAC3B0+B,GAAeH,GAAe7qB,QAC9BwjB,GAAcmF,GAAoBnF,YAClCI,GAAyB+E,GAAoB/E,uBAC7CqH,GAA2BtI,IAAcA,GAAWx0B,UAAU6P,IAE9DktB,KAAsBD,KACa,UAAjCA,GAAyBv1B,MAAqDlN,MAAjCyiC,GAAyBv1B,MAExEy1B,GAAmB,WACrB,OAAOL,GAAYxjC,KAAKk8B,GAAYh9B,WAKf,WAAW,WAChC,OAAOwkC,GAAa1jC,KAAKk8B,GAAYh9B,aAIhB,QAAQ,WAC7B,OAAOukC,GAAUzjC,KAAKk8B,GAAYh9B,aAIb,SAAU2kC,IAAmBD,OAG7BltB,GAAUmtB,IAAmBD,ICpCpD,IAEI1H,GAFsB18B,GAEY08B,YAElC4H,GAAQ,GAAGl9B,QAJWpH,GAGuB88B,wBAM1B,QAAQ,SAAc7N;AAC3C,OAAOqV,GAAM/0B,MAAMmtB,GAAYh9B,MAAOkI,cCTxC,IAAI/F,GAAkB7B,EAClBgI,GAAY1G,GACZ6G,GAAWpF,GACXklB,GAAsB7kB,GAEtB8E,GAAM7I,KAAK6I,IACXq8B,GAAe,GAAGC,YAClBC,KAAkBF,IAAgB,EAAI,CAAC,GAAGC,YAAY,GAAI,GAAK,EAC/DxV,GAAgB/G,GAAoB,eCRpCsc,GDSSE,KAAkBzV,GAIL,SAAqB6U,GAE7C,GAAIY,GAAe,OAAOF,GAAah1B,MAAM7P,KAAMkI,YAAc,EACjE,IAAIlE,EAAI7B,GAAgBnC,MACpBmI,EAASM,GAASzE,EAAEmE,QACpBS,EAAQT,EAAS,EAGrB,IAFID,UAAUC,OAAS,IAAGS,EAAQJ,GAAII,EAAON,GAAUJ,UAAU,MAC7DU,EAAQ,IAAGA,EAAQT,EAASS,GAC1BA,GAAS,EAAGA,IAAS,GAAIA,KAAS5E,GAAKA,EAAE4E,KAAWu7B,EAAe,OAAOv7B,GAAS,EACzF,OAAQ,GACNi8B,GCrBA7H,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAK1B,eAAe,SAAqB+G,GACzD,OAAOU,GAAah1B,MAAMmtB,GAAYh9B,MAAOkI;CCV/C,IACIsnB,GAAO5tB,GAAwCoP,IAC/C4O,GAAqBvc,GAErB25B,GAJsB18B,GAIY08B,YAClCC,GALsB38B,GAKuB28B,0BALvB38B,GAMuB88B,wBAI1B,OAAO,SAAakF,GACzC,OAAO9S,GAAKwN,GAAYh9B,MAAOsiC,EAAOp6B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,GAAW,SAAUgC,EAAGmE,GAClG,OAAO,IAAK80B,GAAuBrd,GAAmB5b,EAAGA,EAAEkM,cAApD,CAAmE/H,SCb9E,IAAIN,GAAYvH,GACZqC,GAAWf,EACXM,GAAgBmB,EAChBoF,GAAW/E,GAGXoF,GAAe,SAAUk8B,GAC3B,OAAO,SAAUt1B,EAAMiB,EAAYuqB,EAAiB+J,GAClDp9B,GAAU8I,GACV,IAAI3M,EAAIrB,GAAS+M,GACb3P,EAAOmC,GAAc8B,GACrBmE,EAASM,GAASzE,EAAEmE,QACpBS,EAAQo8B,EAAW78B,EAAS,EAAI,EAChCqB,EAAIw7B,GAAY,EAAI,EACxB,GAAI9J,EAAkB,EAAG,OAAa,CACpC,GAAItyB,KAAS7I,EAAM,CACjBklC,EAAOllC,EAAK6I,GACZA,GAASY,EACT,MAGF,GADAZ,GAASY,EACLw7B,EAAWp8B,EAAQ,EAAIT,GAAUS,EACnC,MAAM3G,UAAU;AAGpB,KAAM+iC,EAAWp8B,GAAS,EAAIT,EAASS,EAAOA,GAASY,EAAOZ,KAAS7I,IACrEklC,EAAOt0B,EAAWs0B,EAAMllC,EAAK6I,GAAQA,EAAO5E,IAE9C,OAAOihC,IAIXC,GAAiB,CAGfC,KAAMr8B,IAAa,GAGnBs8B,MAAOt8B,IAAa,ICpClBu8B,GAAUzjC,GAAqCujC,KAE/CnI,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,UAAU,SAAgBzsB,GAC/C,OAAO00B,GAAQrI,GAAYh9B,MAAO2Q,EAAYzI,UAAUC,OAAQD,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCTxG,IACIsjC,GAAe1jC,GAAqCwjC,MAEpDpI,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,eAAe,SAAqBzsB,GACzD,OAAO20B,GAAatI,GAAYh9B,MAAO2Q,EAAYzI,UAAUC,OAAQD,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCT7G,IAEIg7B,GAFsB18B,GAEY08B,YAClCI,GAHsB98B,GAGuB88B,uBAC7C/0B,GAAQ1I,KAAK0I;IAIM,WAAW,WAMhC,IALA,IAIIhH,EAJAqO,EAAO1P,KACPmI,EAAS60B,GAAYttB,GAAMvH,OAC3Bo9B,EAASl9B,GAAMF,EAAS,GACxBS,EAAQ,EAELA,EAAQ28B,GACblkC,EAAQqO,EAAK9G,GACb8G,EAAK9G,KAAW8G,IAAOvH,GACvBuH,EAAKvH,GAAU9G,EACf,OAAOqO,KClBX,IACIjH,GAAW7G,GACXogC,GAAW3+B,GACXV,GAAWe,EAGXs5B,GANsB18B,GAMY08B,eANZ18B,GAOuB88B,wBAS1B,OAAO,SAAaoI,GACzCxI,GAAYh9B,MACZ,IAAIghC,EAASgB,GAAS95B,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAAW,GACnEmG,EAASnI,KAAKmI,OACdgG,EAAMxL,GAAS6iC,GACflP,EAAM7tB,GAAS0F,EAAIhG,QACnBS,EAAQ,EACZ,GAAI0tB,EAAM0K,EAAS74B,EAAQ,MAAMw1B,WAAW,gBAC5C,KAAO/0B,EAAQ0tB,GAAKt2B,KAAKghC,EAASp4B,GAASuF,EAAIvF,OApBrCjF,GAKO,WAEjB,IAAI43B,UAAU,GAAG/1B,IAAI,QCXvB,IACIoa,GAAqBhe,GAGrBo7B,GAJsB18B,GAIY08B,YAClCC,GALsB38B,GAKuB28B,uBAE7CwI,GAAS,GAAG/jC;AAPUpB,GAMuB88B,wBAU1B,SAAS,SAAepU,EAAOC,GAMpD,IALA,IAAI2Z,EAAO6C,GAAO3kC,KAAKk8B,GAAYh9B,MAAOgpB,EAAOC,GAC7ChZ,EAAI2P,GAAmB5f,KAAMA,KAAKkQ,aAClCtH,EAAQ,EACRT,EAASy6B,EAAKz6B,OACdsB,EAAS,IAAKwzB,GAAuBhtB,GAA5B,CAAgC9H,GACtCA,EAASS,GAAOa,EAAOb,GAASg6B,EAAKh6B,KAC5C,OAAOa,IArBGpG,GAOO,WAEjB,IAAIk4B,UAAU,GAAG75B,YCXnB,IACIgkC,GAAQ9jC,GAAwCsP,KAEhD8rB,GAHsB18B,GAGY08B,eAHZ18B,GAIuB88B,wBAI1B,QAAQ,SAAczsB,GAC3C,OAAO+0B,GAAM1I,GAAYh9B,MAAO2Q,EAAYzI,UAAUC,OAAS,EAAID,UAAU,QAAKlG,MCTpF,IAEIg7B,GAFsB18B,GAEY08B,YAElC2I,GAAQ,GAAGC,QAJWtlC,GAGuB88B,wBAK1B,QAAQ,SAAcyI,GAC3C,OAAOF,GAAM7kC,KAAKk8B,GAAYh9B,MAAO6lC;CCTvC,IACIp9B,GAAW7G,GACX+G,GAAkBtF,GAClBuc,GAAqBlc,GAErBs5B,GALsB18B,GAKY08B,eALZ18B,GAMuB88B,wBAI1B,YAAY,SAAkB0I,EAAO7c,GAC1D,IAAIjlB,EAAIg5B,GAAYh9B,MAChBmI,EAASnE,EAAEmE,OACX49B,EAAap9B,GAAgBm9B,EAAO39B,GACxC,OAAO,IAAKyX,GAAmB5b,EAAGA,EAAEkM,aAA7B,CACLlM,EAAEw6B,OACFx6B,EAAEu8B,WAAawF,EAAa/hC,EAAEy+B,kBAC9Bh6B,SAAkBzG,IAARinB,EAAoB9gB,EAASQ,GAAgBsgB,EAAK9gB,IAAW49B,OCjB3E,IACI5D,GAAsBvgC,GACtB1B,GAAQmD,EAERk4B,GAJSj7B,EAIUi7B,UACnByB,GAAcmF,GAAoBnF,YAClCI,GAAyB+E,GAAoB/E,uBAC7C4I,GAAkB,GAAGC,eACrBR,GAAS,GAAG/jC,MAGZwkC,KAAyB3K,IAAar7B,IAAM,WAC9C8lC,GAAgBllC,KAAK,IAAIy6B,GAAU,UAWd,kBAAkB,WACvC,OAAOyK,GAAgBn2B,MAAMq2B,GAAuBT,GAAO3kC,KAAKk8B,GAAYh9B,OAASg9B,GAAYh9B,MAAOkI;GAT7FhI,IAAM,WACjB,MAAO,CAAC,EAAG,GAAG+lC,kBAAoB,IAAI1K,GAAU,CAAC,EAAG,IAAI0K,sBACnD/lC,IAAM,WACXq7B,GAAU5zB,UAAUs+B,eAAenlC,KAAK,CAAC,EAAG,QClB9C,IAAIs8B,GAAyB98B,GAA+C88B,uBACxEl9B,GAAQ0B,EAGRu6B,GAFS94B,EAEW84B,WACpBgK,GAAsBhK,IAAcA,GAAWx0B,WAAa,GAC5Dy+B,GAAgB,GAAG5kC,SACnB6kC,GAAY,GAAG3+B,KAEfxH,IAAM,WAAckmC,GAActlC,KAAK,SACzCslC,GAAgB,WACd,OAAOC,GAAUvlC,KAAKd,QAI1B,IAAIsmC,GAAsBH,GAAoB3kC,UAAY4kC,GAI1DhJ,GAAuB,WAAYgJ,GAAeE,OCpBhBhmC,YAIN,UAAU,SAAUu5B,GAC9C,OAAO,SAAqBnvB,EAAM61B,EAAYp4B,GAC5C,OAAO0xB,EAAK75B,KAAM0K,EAAM61B,EAAYp4B,UCNN7H,YAIN,UAAU,SAAUu5B;AAC9C,OAAO,SAAqBnvB,EAAM61B,EAAYp4B,GAC5C,OAAO0xB,EAAK75B,KAAM0K,EAAM61B,EAAYp4B,UCNN7H,YAIN,SAAS,SAAUu5B,GAC7C,OAAO,SAAoBnvB,EAAM61B,EAAYp4B,GAC3C,OAAO0xB,EAAK75B,KAAM0K,EAAM61B,EAAYp4B,OCoCxC,SAASo+B,GAAKC,WAAWlQ,EAAMkQ,EAAIr+B,SAAiBmuB,GAAO,GAAKkQ,EAAIlQ,GAAO;AAI3E,IAiBMmQ,GAAgB,IAGhBC,GAAgBD,IAGhBE,GAAgB,GAShBC,GAAgB,GA2BhBC,GACJ,IAAI1K,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEpE2K,GACJ,IAAI3K,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAE7E4K,GACJ,IAAI5K,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEhD6K,GACJ,IAAI7K,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAgBxD8K,GAAgB,IAAIv6B,MAAM,KAChC65B,GAAKU,IAOL,IAAMC,GAAgB,IAAIx6B,MAAMi6B,IAChCJ,GAAKW,IAKL,IAAMC,GAAgB,IAAIz6B,MAjBJ,KAkBtB65B,GAAKY,IAML,IAAMC,GAAgB,IAAI16B,MAAM26B,KAChCd,GAAKa,IAGL,IAAME,GAAgB,IAAI56B,MAhGJ,IAiGtB65B,GAAKe,IAGL,IAkBIC,GACAC,GACAC,GApBEC,GAAgB,IAAIh7B,MAAMi6B;CAKhC,SAASgB,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,QAE7DJ,YAAeA,OACfC,WAAeA,OACfC,WAAeA,OACfC,MAAeA,OACfC,WAAeA,OAGfC,UAAeL,GAAeA,EAAYz/B,OASjD,SAAS+/B,GAASC,EAAUC,QACrBD,SAAWA,OACXE,SAAW,OACXD,UAAYA,EAzBnB7B,GAAKmB,IA8BL,IAAMY,GAAS,SAACC,UAEPA,EAAO,IAAMpB,GAAWoB,GAAQpB,GAAW,KAAOoB,IAAS,KAQ9DC,GAAY,SAAC9Y,EAAG+Y,GAGpB/Y,EAAEgZ,YAAYhZ,EAAEiZ,WAAmB,IAALF,EAC9B/Y,EAAEgZ,YAAYhZ,EAAEiZ,WAAcF,IAAM,EAAK,KAQrCG,GAAY,SAAClZ,EAAGruB,EAAO8G,GAEvBunB,EAAEmZ,SAtIc,GAsIS1gC,GAC3BunB,EAAEoZ,QAAWznC,GAASquB,EAAEmZ,SAAY,MACpCL,GAAU9Y,EAAGA,EAAEoZ,QACfpZ,EAAEoZ,OAASznC,GAzIO,GAyIcquB,EAAEmZ;AAClCnZ,EAAEmZ,UAAY1gC,EA1II,KA4IlBunB,EAAEoZ,QAAWznC,GAASquB,EAAEmZ,SAAY,MACpCnZ,EAAEmZ,UAAY1gC,IAKZ4gC,GAAY,SAACrZ,EAAG9f,EAAGo5B,GAEvBJ,GAAUlZ,EAAGsZ,EAAS,EAAJp5B,GAAiBo5B,EAAS,EAAJp5B,EAAQ,KAS5Cq5B,GAAa,SAACC,EAAM5S,OAEpBpD,EAAM,KAERA,GAAc,EAAPgW,EACPA,KAAU,EACVhW,IAAQ,UACCoD,EAAM,UACVpD,IAAQ,GAiIXiW,GAAY,SAACH,EAAMX,EAAUe,OAO7BC,EACAngB,EAHEogB,EAAY,IAAI58B,MAAMk6B,IACxBsC,EAAO,MAONG,EAAO,EAAGA,GAAQzC,GAAUyC,IAC/BC,EAAUD,GAAQH,EAAQA,EAAOE,EAASC,EAAO,IAAO,MASrDngB,EAAI,EAAIA,GAAKmf,EAAUnf,IAAK,KAC3BoN,EAAM0S,EAAS,EAAJ9f,EAAQ,GACX,IAARoN,IAEJ0S,EAAS,EAAJ9f,GAAkB+f,GAAWK,EAAUhT,KAAQA,MAoHlDiT,GAAa,SAAC7Z,OAEdxG,MAGCA,EAAI,EAAGA,EAAIwd,GAAUxd,IAAOwG,EAAE8Z,UAAc,EAAJtgB,GAAkB,MAC1DA,EAAI,EAAGA,EAAIyd,GAAUzd,IAAOwG,EAAE+Z,UAAc,EAAJvgB,GAAkB,MAC1DA,EAAI,EAAGA,EArcQ,GAqcMA,IAAOwG,EAAEga,QAAY,EAAJxgB,GAAkB,EAE7DwG,EAAE8Z,UAAUG,KAA0B;AACtCja,EAAEka,QAAUla,EAAEma,WAAa,EAC3Bna,EAAEoa,SAAWpa,EAAEqa,QAAU,GAOrBC,GAAY,SAACta,GAEbA,EAAEmZ,SAAW,EACfL,GAAU9Y,EAAGA,EAAEoZ,QACNpZ,EAAEmZ,SAAW,IAEtBnZ,EAAEgZ,YAAYhZ,EAAEiZ,WAAajZ,EAAEoZ,QAEjCpZ,EAAEoZ,OAAS,EACXpZ,EAAEmZ,SAAW,GA8BToB,GAAU,SAACjB,EAAM9f,EAAGsL,EAAG0V,OAErBC,EAAU,EAAJjhB,EACNkhB,EAAU,EAAJ5V,SACJwU,EAAKmB,GAAgBnB,EAAKoB,IAC1BpB,EAAKmB,KAAkBnB,EAAKoB,IAAiBF,EAAMhhB,IAAMghB,EAAM1V,IASnE6V,GAAa,SAAC3a,EAAGsZ,EAAM7f,WAKrBmhB,EAAI5a,EAAE6a,KAAKphB,GACbkM,EAAIlM,GAAK,EACNkM,GAAK3F,EAAE8a,WAERnV,EAAI3F,EAAE8a,UACRP,GAAQjB,EAAMtZ,EAAE6a,KAAKlV,EAAI,GAAI3F,EAAE6a,KAAKlV,GAAI3F,EAAEwa,QAC1C7U,KAGE4U,GAAQjB,EAAMsB,EAAG5a,EAAE6a,KAAKlV,GAAI3F,EAAEwa,SAGlCxa,EAAE6a,KAAKphB,GAAKuG,EAAE6a,KAAKlV,GACnBlM,EAAIkM,EAGJA,IAAM,EAER3F,EAAE6a,KAAKphB,GAAKmhB,GAURG,GAAiB,SAAC/a,EAAGgb,EAAOC,OAK5BpC,EACAqC,EAEA1B,EACA2B,EAFAC,EAAK,KAIU,IAAfpb,EAAEoa;AAEFvB,EAAQ7Y,EAAEgZ,YAAYhZ,EAAEqb,MAAa,EAALD,IAAW,EAAMpb,EAAEgZ,YAAYhZ,EAAEqb,MAAa,EAALD,EAAS,GAClFF,EAAKlb,EAAEgZ,YAAYhZ,EAAEsb,MAAQF,GAC7BA,IAEa,IAATvC,EACFQ,GAAUrZ,EAAGkb,EAAIF,IAIjBxB,EAAO9B,GAAawD,GACpB7B,GAAUrZ,EAAGwZ,EAAOzC,GAAW,EAAGiE,GAEpB,KADdG,EAAQhE,GAAYqC,MAElB0B,GAAMtD,GAAY4B,GAClBN,GAAUlZ,EAAGkb,EAAIC,IAEnBtC,IACAW,EAAOZ,GAAOC,GAGdQ,GAAUrZ,EAAGwZ,EAAMyB,GAEL,KADdE,EAAQ/D,GAAYoC,MAElBX,GAAQb,GAAUwB,GAClBN,GAAUlZ,EAAG6Y,EAAMsC,WAQhBC,EAAKpb,EAAEoa,UAGlBf,GAAUrZ,EAlkBQ,IAkkBMgb,IAYpBO,GAAa,SAACvb,EAAGpZ,OAQjB4S,EAAGsL,EAEHvS,EANE+mB,EAAW1yB,EAAK6xB,SAChB+C,EAAW50B,EAAK8xB,UAAUR,YAC1BK,EAAY3xB,EAAK8xB,UAAUH,UAC3BF,EAAWzxB,EAAK8xB,UAAUL,MAE5BM,GAAY,MAOhB3Y,EAAE8a,SAAW,EACb9a,EAAEyb,SAhnBkB,IAknBfjiB,EAAI,EAAGA,EAAI6e,EAAO7e,IACQ,IAAzB8f,EAAS,EAAJ9f,IACPwG,EAAE6a,OAAO7a,EAAE8a,UAAYnC,EAAWnf,EAClCwG,EAAEwa,MAAMhhB,GAAK,GAGb8f,EAAS,EAAJ9f,EAAQ,GAAa;MASvBwG,EAAE8a,SAAW,GAElBxB,EAAY,GADZ/mB,EAAOyN,EAAE6a,OAAO7a,EAAE8a,UAAanC,EAAW,IAAMA,EAAW,IACjC,EAC1B3Y,EAAEwa,MAAMjoB,GAAQ,EAChByN,EAAEka,UAEE3B,IACFvY,EAAEma,YAAcqB,EAAa,EAAPjpB,EAAW,QAIrC3L,EAAK+xB,SAAWA,EAKXnf,EAAKwG,EAAE8a,UAAY,EAActhB,GAAK,EAAGA,IAAOmhB,GAAW3a,EAAGsZ,EAAM9f,GAKzEjH,EAAO8lB,KAIL7e,EAAIwG,EAAE6a,KAAK,GACX7a,EAAE6a,KAAK,GAAiB7a,EAAE6a,KAAK7a,EAAE8a,YACjCH,GAAW3a,EAAGsZ,EAAM,GAGpBxU,EAAI9E,EAAE6a,KAAK,GAEX7a,EAAE6a,OAAO7a,EAAEyb,UAAYjiB,EACvBwG,EAAE6a,OAAO7a,EAAEyb,UAAY3W,EAGvBwU,EAAY,EAAP/mB,GAAqB+mB,EAAS,EAAJ9f,GAAkB8f,EAAS,EAAJxU,GACtD9E,EAAEwa,MAAMjoB,IAASyN,EAAEwa,MAAMhhB,IAAMwG,EAAEwa,MAAM1V,GAAK9E,EAAEwa,MAAMhhB,GAAKwG,EAAEwa,MAAM1V,IAAM,EACvEwU,EAAS,EAAJ9f,EAAQ,GAAa8f,EAAS,EAAJxU,EAAQ,GAAavS,EAGpDyN,EAAE6a,KAAK,GAAiBtoB,IACxBooB,GAAW3a,EAAGsZ,EAAM,SAEbtZ,EAAE8a,UAAY,GAEvB9a,EAAE6a,OAAO7a,EAAEyb,UAAYzb,EAAE6a,KAAK,GApeb,SAAC7a,EAAGpZ;IAWjB80B,EACAliB,EAAGsL,EACH6U,EACAgC,EACAnnC,EAXE8kC,EAAkB1yB,EAAK6xB,SACvBE,EAAkB/xB,EAAK+xB,SACvB6C,EAAkB50B,EAAK8xB,UAAUR,YACjCK,EAAkB3xB,EAAK8xB,UAAUH,UACjC4C,EAAkBv0B,EAAK8xB,UAAUP,WACjCyD,EAAkBh1B,EAAK8xB,UAAUN,WACjCE,EAAkB1xB,EAAK8xB,UAAUJ,WAMnCuD,EAAW,MAEVlC,EAAO,EAAGA,GAAQzC,GAAUyC,IAC/B3Z,EAAE0Z,SAASC,GAAQ,MAMrBL,EAA0B,EAArBtZ,EAAE6a,KAAK7a,EAAEyb,UAAgB,GAAa,EAEtCC,EAAI1b,EAAEyb,SAAW,EAAGC,EAtOL,IAsOoBA,KAEtC/B,EAAOL,EAA+B,EAA1BA,EAAS,GADrB9f,EAAIwG,EAAE6a,KAAKa,IACc,GAAiB,GAAa,GAC5CpD,IACTqB,EAAOrB,EACPuD,KAEFvC,EAAS,EAAJ9f,EAAQ,GAAamgB,EAGtBngB,EAAImf,IAER3Y,EAAE0Z,SAASC,KACXgC,EAAQ,EACJniB,GAAKoiB,IACPD,EAAQR,EAAM3hB,EAAIoiB,IAEpBpnC,EAAI8kC,EAAS,EAAJ9f,GACTwG,EAAEka,SAAW1lC,GAAKmlC,EAAOgC,GACrBpD,IACFvY,EAAEma,YAAc3lC,GAAKgnC,EAAU,EAAJhiB,EAAQ,GAAamiB,QAGnC,IAAbE,KAMD,KACDlC,EAAOrB,EAAa,EACQ,IAArBtY,EAAE0Z,SAASC,IAAeA,IACjC3Z,EAAE0Z,SAASC;AACX3Z,EAAE0Z,SAASC,EAAO,IAAM,EACxB3Z,EAAE0Z,SAASpB,KAIXuD,GAAY,QACLA,EAAW,OAOflC,EAAOrB,EAAqB,IAATqB,EAAYA,QAClCngB,EAAIwG,EAAE0Z,SAASC,GACF,IAANngB,IACLsL,EAAI9E,EAAE6a,OAAOa,IACL/C,IACJW,EAAS,EAAJxU,EAAQ,KAAe6U,IAE9B3Z,EAAEka,UAAYP,EAAOL,EAAS,EAAJxU,EAAQ,IAAcwU,EAAS,EAAJxU,GACrDwU,EAAS,EAAJxU,EAAQ,GAAa6U,GAE5BngB,MAsZJsiB,CAAW9b,EAAGpZ,GAGd6yB,GAAUH,EAAMX,EAAU3Y,EAAE0Z,WAQxBqC,GAAY,SAAC/b,EAAGsZ,EAAMX,OAKtBnf,EAEAwiB,EADAC,GAAW,EAGXC,EAAU5C,EAAK,GAEf7I,EAAQ,EACR0L,EAAY,EACZC,EAAY,MAEA,IAAZF,IACFC,EAAY,IACZC,EAAY,GAEd9C,EAAsB,GAAhBX,EAAW,GAAS,GAAa,MAElCnf,EAAI,EAAGA,GAAKmf,EAAUnf,IACzBwiB,EAASE,EACTA,EAAU5C,EAAe,GAAT9f,EAAI,GAAS,KAEvBiX,EAAQ0L,GAAaH,IAAWE,IAG3BzL,EAAQ2L,EACjBpc,EAAEga,QAAiB,EAATgC,IAAwBvL,EAEd,IAAXuL,GAELA,IAAWC,GAAWjc,EAAEga,QAAiB,EAATgC,KACpChc,EAAEga,QAAQqC,OAED5L,GAAS,GAClBzQ,EAAEga,QAAQsC,MAGVtc,EAAEga,QAAQuC,MAGZ9L,EAAQ,EACRwL,EAAUD,EAEM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY;AACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,KAUZI,GAAY,SAACxc,EAAGsZ,EAAMX,OAKtBnf,EAEAwiB,EADAC,GAAW,EAGXC,EAAU5C,EAAK,GAEf7I,EAAQ,EACR0L,EAAY,EACZC,EAAY,MAGA,IAAZF,IACFC,EAAY,IACZC,EAAY,GAGT5iB,EAAI,EAAGA,GAAKmf,EAAUnf,OACzBwiB,EAASE,EACTA,EAAU5C,EAAe,GAAT9f,EAAI,GAAS,OAEvBiX,EAAQ0L,GAAaH,IAAWE,IAG/B,GAAIzL,EAAQ2L,KACZ/C,GAAUrZ,EAAGgc,EAAQhc,EAAEga,eAA+B,KAAVvJ,QAE7B,IAAXuL,GACLA,IAAWC,IACb5C,GAAUrZ,EAAGgc,EAAQhc,EAAEga,SACvBvJ,KAGF4I,GAAUrZ,EAlxBI,GAkxBQA,EAAEga,SACxBd,GAAUlZ,EAAGyQ,EAAQ,EAAG,IAEfA,GAAS,IAClB4I,GAAUrZ,EAnxBI,GAmxBUA,EAAEga,SAC1Bd,GAAUlZ,EAAGyQ,EAAQ,EAAG,KAGxB4I,GAAUrZ,EApxBI,GAoxBYA,EAAEga,SAC5Bd,GAAUlZ,EAAGyQ,EAAQ,GAAI,IAG3BA,EAAQ,EACRwL,EAAUD,EACM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,KAwHdK,IAAmB,EA4BjBC,GAAmB,SAAC1c,EAAG8W,EAAK6F,EAAYvqB,GAM5C8mB,GAAUlZ,EAAG,GAAuB5N,EAAO,EAAI,GAAI,GA3flC,SAAC4N,EAAG8W,EAAKlQ,EAAKgW,GAM/BtC,GAAUta,GAEN4c,IACF9D,GAAU9Y,EAAG4G,GACbkS,GAAU9Y,GAAI4G;AAKhB5G,EAAEgZ,YAAYljC,IAAIkqB,EAAE5vB,OAAOysC,SAAS/F,EAAKA,EAAMlQ,GAAM5G,EAAEiZ,SACvDjZ,EAAEiZ,SAAWrS,EA4ebkW,CAAW9c,EAAG8W,EAAK6F,GAAY,IA0K7BI,GAAQ,CACXC,SAzMgB,SAAChd,GAGXyc,MA5mBgB,eAEjBjjB,EACAmgB,EACAlhC,EACA+gC,EACAX,EACEa,EAAW,IAAI18B,MAAMk6B,QAgB3Bz+B,EAAS,EACJ+gC,EAAO,EAAGA,EAAOyD,GAAkBzD,QACtC5B,GAAY4B,GAAQ/gC,EACf+gB,EAAI,EAAGA,EAAK,GAAK2d,GAAYqC,GAAQhgB,IACxCke,GAAaj/B,KAAY+gC,MAQ7B9B,GAAaj/B,EAAS,GAAK+gC,EAG3BX,EAAO,EACFW,EAAO,EAAGA,EAAO,GAAIA,QACxBxB,GAAUwB,GAAQX,EACbrf,EAAI,EAAGA,EAAK,GAAK4d,GAAYoC,GAAQhgB,IACxCie,GAAWoB,KAAUW,MAIzBX,IAAS,EACFW,EAAOvC,GAASuC,QACrBxB,GAAUwB,GAAQX,GAAQ,EACrBrf,EAAI,EAAGA,EAAK,GAAM4d,GAAYoC,GAAQ,EAAKhgB,IAC9Cie,GAAW,IAAMoB,KAAUW,MAM1BG,EAAO,EAAGA,GAAQzC,GAAUyC,IAC/BD,EAASC,GAAQ,MAGnBngB,EAAI,EACGA,GAAK,KACV+d,GAAiB,EAAJ/d,EAAQ,GAAa,EAClCA,IACAkgB,EAAS,UAEJlgB,GAAK,KACV+d,GAAiB,EAAJ/d,EAAQ,GAAa,EAClCA,IACAkgB,EAAS,UAEJlgB,GAAK,KACV+d,GAAiB,EAAJ/d,EAAQ,GAAa,EAClCA,IACAkgB,EAAS;MAEJlgB,GAAK,KACV+d,GAAiB,EAAJ/d,EAAQ,GAAa,EAClCA,IACAkgB,EAAS,SAMXD,GAAUlC,GAAcP,IAAa0C,GAGhClgB,EAAI,EAAGA,EAAIyd,GAASzd,IACvBge,GAAiB,EAAJhe,EAAQ,GAAa,EAClCge,GAAiB,EAAJhe,GAAkB+f,GAAW/f,EAAG,GAI/Cqe,GAAgB,IAAII,GAAeV,GAAcJ,GAAaJ,IAAcC,GAASE,IACrFY,GAAgB,IAAIG,GAAeT,GAAcJ,GAAa,EAAYH,GAASC,IACnFa,GAAiB,IAAIE,GAAe,IAAIj7B,MAAM,GAAIq6B,GAAc,EArb5C,GAiBF,GAi7BhB6F,GACAT,IAAmB,GAGrBzc,EAAEmd,OAAU,IAAI3E,GAASxY,EAAE8Z,UAAWjC,IACtC7X,EAAEod,OAAU,IAAI5E,GAASxY,EAAE+Z,UAAWjC,IACtC9X,EAAEqd,QAAU,IAAI7E,GAASxY,EAAEga,QAASjC,IAEpC/X,EAAEoZ,OAAS,EACXpZ,EAAEmZ,SAAW,EAGbU,GAAW7Z,IA0LZ0c,iBAPwBA,GAQxBY,gBA1JuB,SAACtd,EAAG8W,EAAK6F,EAAYvqB,OAMvCmrB,EAAUC,EACVC,EAAc,EAGdzd,EAAE0d,MAAQ,GA5hCc,IA+hCtB1d,EAAE2d,KAAKC,YACT5d,EAAE2d,KAAKC,UArGY,SAAC5d,OAMpBxG,EADAqkB,EAAa,eAIZrkB,EAAI,EAAGA,GAAK,GAAIA;AAAKqkB,KAAgB,KACtB,EAAbA,GAAoD,IAAhC7d,EAAE8Z,UAAc,EAAJtgB,UAx8BX,KA88BQ,IAAhCwG,EAAE8Z,UAAU,KAA0D,IAAjC9Z,EAAE8Z,UAAU,KAChB,IAAjC9Z,EAAE8Z,UAAU,WA98BY,MAi9BvBtgB,EAAI,GAAIA,EAAIud,GAAUvd,OACW,IAAhCwG,EAAE8Z,UAAc,EAAJtgB,UAl9BU,SADA,EAmiCLskB,CAAiB9d,IAItCub,GAAWvb,EAAGA,EAAEmd,QAIhB5B,GAAWvb,EAAGA,EAAEod,QAUhBK,EApMkB,SAACzd,OAEjByd,MAGJ1B,GAAU/b,EAAGA,EAAE8Z,UAAW9Z,EAAEmd,OAAOxE,UACnCoD,GAAU/b,EAAGA,EAAE+Z,UAAW/Z,EAAEod,OAAOzE,UAGnC4C,GAAWvb,EAAGA,EAAEqd,SASXI,EAAcM,GAAcN,GAAe,GACW,IAArDzd,EAAEga,QAAgC,EAAxB1C,GAASmG,GAAmB,GADOA,YAMnDzd,EAAEka,SAAW,GAAKuD,EAAc,GAAK,EAAI,EAAI,EAItCA,EAwKSO,CAAche,GAG5Bud,EAAYvd,EAAEka,QAAU,EAAI,IAAO,GACnCsD,EAAexd,EAAEma,WAAa,EAAI,IAAO,IAMtBoD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcb,EAAa;AAGnCA,EAAa,GAAKY,IAAuB,IAATzG,EASnC4F,GAAiB1c,EAAG8W,EAAK6F,EAAYvqB,GAnlCX,IAqlCjB4N,EAAEie,UAAwBT,IAAgBD,GAEnDrE,GAAUlZ,EAAG,GAAuB5N,EAAO,EAAI,GAAI,GACnD2oB,GAAe/a,EAAGuX,GAAcC,MAGhC0B,GAAUlZ,EAAG,GAAoB5N,EAAO,EAAI,GAAI,GAjM7B,SAAC4N,EAAGke,EAAQC,EAAQC,OAIrCC,MAMJnF,GAAUlZ,EAAGke,EAAS,IAAK,GAC3BhF,GAAUlZ,EAAGme,EAAS,EAAK,GAC3BjF,GAAUlZ,EAAGoe,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7BnF,GAAUlZ,EAAGA,EAAEga,QAAyB,EAAjB1C,GAAS+G,GAAY,GAAY,GAI1D7B,GAAUxc,EAAGA,EAAE8Z,UAAWoE,EAAS,GAGnC1B,GAAUxc,EAAGA,EAAE+Z,UAAWoE,EAAS,GA4KjCG,CAAete,EAAGA,EAAEmd,OAAOxE,SAAW,EAAG3Y,EAAEod,OAAOzE,SAAW,EAAG8E,EAAc,GAC9E1C,GAAe/a,EAAGA,EAAE8Z,UAAW9Z,EAAE+Z,YAMnCF,GAAW7Z,GAEP5N,GACFkoB,GAAUta,IA8Ebue,UApEiB,SAACve,EAAG6Y,EAAMqC,UAO1Blb,EAAEgZ,YAAYhZ,EAAEqb,MAAqB,EAAbrb,EAAEoa,UAAqBvB,IAAS,EAAK,IAC7D7Y,EAAEgZ,YAAYhZ,EAAEqb,MAAqB,EAAbrb,EAAEoa,SAAe,GAAY,IAAPvB;AAE9C7Y,EAAEgZ,YAAYhZ,EAAEsb,MAAQtb,EAAEoa,UAAiB,IAALc,EACtClb,EAAEoa,WAEW,IAATvB,EAEF7Y,EAAE8Z,UAAe,EAALoB,MAEZlb,EAAEqa,UAEFxB,IAKA7Y,EAAE8Z,UAA8C,GAAnCpC,GAAawD,GAAMnE,GAAW,MAC3C/W,EAAE+Z,UAAyB,EAAfnB,GAAOC,OA0Bb7Y,EAAEoa,WAAapa,EAAEwe,YAAc,GAkBxCC,UAvKiB,SAACze,GACjBkZ,GAAUlZ,EAAG0e,EAAmB,GAChCrF,GAAUrZ,EAl9BQ,IAk9BMuX,IAjzBT,SAACvX,GAEG,KAAfA,EAAEmZ,UACJL,GAAU9Y,EAAGA,EAAEoZ,QACfpZ,EAAEoZ,OAAS,EACXpZ,EAAEmZ,SAAW,GAEJnZ,EAAEmZ,UAAY,IACvBnZ,EAAEgZ,YAAYhZ,EAAEiZ,WAAwB,IAAXjZ,EAAEoZ,OAC/BpZ,EAAEoZ,SAAW,EACbpZ,EAAEmZ,UAAY,GAwyBhBwF,CAAS3e,KAuNP4e,GAzBY,SAACC,EAAO/H,EAAKlQ,EAAKrc,WAC5Bu0B,EAAc,MAARD,EAAiB,EACvBE,EAAOF,IAAU,GAAM,MAAS,EAChCrlB,EAAI,EAEO,IAARoN,GAAW,CAKhBA,GADApN,EAAIoN,EAAM,IAAO,IAAOA,KAKtBmY,EAAMA,GADND,EAAMA,EAAKhI,EAAIvsB,KAAS,GACR;SACPiP,GAEXslB,GAAM,MACNC,GAAM,aAGAD,EAAMC,GAAM,GAAM,GA6CtBC,GAAW,IAAInS,YAfH,mBACZ3sB,EAAG++B,EAAQ,GAENzlB,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BtZ,EAAIsZ,MACC,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IACrBvZ,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnD++B,EAAMzlB,GAAKtZ,SAGN++B,EAIwBC,IAiB7BC,GAdU,SAACC,EAAKtI,EAAKlQ,EAAKrc,OACtB80B,EAAIL,GACJzlB,EAAMhP,EAAMqc,EAElBwY,IAAQ,MAEH,IAAItlC,EAAIyQ,EAAKzQ,EAAIyf,EAAKzf,IACzBslC,EAAOA,IAAQ,EAAKC,EAAmB,KAAhBD,EAAMtI,EAAIh9B,YAGnB,EAARslC,GAyBNE,GAAW,GACL,oBACA,eACA,QACA,kBACA,oBACA,kBACA,2BACA,oBACA,wBAsBNC,GAAY,CAGdC,WAAoB,EACpBC,gBAAoB;AACpBC,aAAoB,EACpBC,aAAoB,EACpBC,SAAoB,EACpBC,QAAoB,EACpBC,QAAoB,EAKpBC,KAAoB,EACpBC,aAAoB,EACpBC,YAAoB,EACpBC,SAAoB,EACpBC,gBAAoB,EACpBC,cAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EAIpBC,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BC,uBAA0B,EAG1BC,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1BC,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1BC,WAA0B;EAuBVC,GAAyIrE,GAAnJC,SAAwCqE,GAA2GtE,GAA7HL,iBAAuD4E,GAAsEvE,GAAvFO,gBAA+CiE,GAAwCxE,GAAnDwB,UAAmCiD,GAAgBzE,GAA3B0B,UAS9He,GAMED,GANFC,WAAYC,GAMVF,GANUE,gBAAiBE,GAM3BJ,GAN2BI,aAAcC,GAMzCL,GANyCK,SAAUC,GAMnDN,GANmDM,QACrDE,GAKER,GALFQ,KAAMC,GAKJT,GALIS,aAAcG,GAKlBZ,GALkBY,eAAgBC,GAKlCb,GALkCa,aAAcE,GAKhDf,GALgDe,YAClDI,GAIEnB,GAJFmB,sBACAC,GAGEpB,GAHFoB,WAAYC,GAGVrB,GAHUqB,eAAgBC,GAG1BtB,GAH0BsB,MAAgBY,GAG1ClC,GAHiCuB,QAAoBC,GAGrDxB,GAHqDwB,mBAC5CW,GAETnC,GAFF2B,UACAC,GACE5B,GADF4B,WA6BIQ,GAAc,IACdC,GAAiBD,IAQjBE,GAAa,IACbC,GAAa,IACbC,GAAe,IASf1nB,GAAM,SAACsjB,EAAMqE,UACjBrE,EAAKsE,IAAM3C,GAAS0C,GACbA;EAGH3D,GAAO,SAAC7pC,UACHA,GAAM,IAAOA,EAAK,EAAI,EAAI,IAG/B0tC,GAAS,SAACpL,WACVlQ,EAAMkQ,EAAIr+B,SAAiBmuB,GAAO,GAAKkQ,EAAIlQ,GAAO,GASpDub,GAJY,SAACniB,EAAGxB,EAAMxjB,UAAWwjB,GAAQwB,EAAEoiB,WAAcpnC,GAAQglB,EAAEqiB,WAYjEC,GAAgB,SAAC3E,OACf3d,EAAI2d,EAAKhnC,MAGXiwB,EAAM5G,EAAEiZ,QACRrS,EAAM+W,EAAK4E,YACb3b,EAAM+W,EAAK4E,WAED,IAAR3b,IAEJ+W,EAAKva,OAAOttB,IAAIkqB,EAAEgZ,YAAY6D,SAAS7c,EAAEwiB,YAAaxiB,EAAEwiB,YAAc5b,GAAM+W,EAAK8E,UACjF9E,EAAK8E,UAAY7b,EACjB5G,EAAEwiB,aAAe5b,EACjB+W,EAAK+E,WAAa9b,EAClB+W,EAAK4E,WAAa3b,EAClB5G,EAAEiZ,SAAWrS,EACK,IAAd5G,EAAEiZ,UACJjZ,EAAEwiB,YAAc,KAKdG,GAAmB,SAAC3iB,EAAG5N;AAC3BkvB,GAAkBthB,EAAIA,EAAE4iB,aAAe,EAAI5iB,EAAE4iB,aAAe,EAAI5iB,EAAE6iB,SAAW7iB,EAAE4iB,YAAaxwB,GAC5F4N,EAAE4iB,YAAc5iB,EAAE6iB,SAClBP,GAActiB,EAAE2d,OAIZmF,GAAW,SAAC9iB,EAAG/f,GACnB+f,EAAEgZ,YAAYhZ,EAAEiZ,WAAah5B,GASzB8iC,GAAc,SAAC/iB,EAAG/f,GAItB+f,EAAEgZ,YAAYhZ,EAAEiZ,WAAch5B,IAAM,EAAK,IACzC+f,EAAEgZ,YAAYhZ,EAAEiZ,WAAiB,IAAJh5B,GA8CzB+iC,GAAgB,SAAChjB,EAAGijB,OAIpB5oC,EACAusB,EAHAsc,EAAeljB,EAAEmjB,iBACjBC,EAAOpjB,EAAE6iB,SAGTQ,EAAWrjB,EAAEsjB,YACbC,EAAavjB,EAAEujB,WACbtgB,EAASjD,EAAE6iB,SAAY7iB,EAAEwjB,OAAS5B,GACpC5hB,EAAE6iB,UAAY7iB,EAAEwjB,OAAS5B,IAAiB,EAExC6B,EAAOzjB,EAAE5vB,OAETszC,EAAQ1jB,EAAE2jB,OACVnlB,EAAQwB,EAAExB,KAMVolB,EAAS5jB,EAAE6iB,SAAWlB,GACxBkC,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,GAQzBrjB,EAAEsjB,aAAetjB,EAAE+jB,aACrBb,IAAiB;AAKfK,EAAavjB,EAAEgkB,YAAaT,EAAavjB,EAAEgkB,iBAiBzCP,GAXJppC,EAAQ4oC,GAWSI,KAAkBS,GAC/BL,EAAKppC,EAAQgpC,EAAW,KAAOQ,GAC/BJ,EAAKppC,KAA0BopC,EAAKL,IACpCK,IAAOppC,KAAwBopC,EAAKL,EAAO,IAU/CA,GAAQ,EACR/oC,cAQSopC,IAAOL,KAAUK,IAAOppC,IAAUopC,IAAOL,KAAUK,IAAOppC,IAC1DopC,IAAOL,KAAUK,IAAOppC,IAAUopC,IAAOL,KAAUK,IAAOppC,IAC1DopC,IAAOL,KAAUK,IAAOppC,IAAUopC,IAAOL,KAAUK,IAAOppC,IAC1DopC,IAAOL,KAAUK,IAAOppC,IAAUopC,IAAOL,KAAUK,IAAOppC,IAC1D+oC,EAAOQ,MAIhBhd,EAAM+a,IAAeiC,EAASR,GAC9BA,EAAOQ,EAASjC,GAEZ/a,EAAMyc,EAAU,IAClBrjB,EAAEikB,YAAchB,EAChBI,EAAWzc,EACPA,GAAO2c,QAGXM,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,YAEnBJ,EAAYzkB,EAAKykB,EAAYS,IAAUzgB,GAA4B,KAAjBigB,UAExDG,GAAYrjB,EAAEgkB,UACTX,EAEFrjB,EAAEgkB,WAcLE,GAAc,SAAClkB,OAGfrH,EAAGa,EAAGsL,EAAGqf,EAAMtjB,EAxJH8c,EAAM7G,EAAKxd,EAAO1O,EAE9Bgc,EAqJEwd,EAAUpkB,EAAEwjB,SAKf,IACDW,EAAOnkB,EAAEqkB,YAAcrkB,EAAEgkB,UAAYhkB,EAAE6iB;AAoBnC7iB,EAAE6iB,UAAYuB,GAAWA,EAAUxC,IAAgB,CAErD5hB,EAAE5vB,OAAO0F,IAAIkqB,EAAE5vB,OAAOysC,SAASuH,EAASA,EAAUA,GAAU,GAC5DpkB,EAAEikB,aAAeG,EACjBpkB,EAAE6iB,UAAYuB,EAEdpkB,EAAE4iB,aAAewB,EAUjBzrB,EADAa,EAAIwG,EAAEskB,aAIJxf,EAAI9E,EAAE7N,OAAOwG,GACbqH,EAAE7N,KAAKwG,GAAMmM,GAAKsf,EAAUtf,EAAIsf,EAAU,UACjC5qB,GAGXb,EADAa,EAAI4qB,KAIFtf,EAAI9E,EAAExB,OAAO7F,GACbqH,EAAExB,KAAK7F,GAAMmM,GAAKsf,EAAUtf,EAAIsf,EAAU,UAIjC5qB,GAEX2qB,GAAQC,KAEc,IAApBpkB,EAAE2d,KAAK4G,kBArNG5G,EAqOD3d,EAAE2d,KArOK7G,EAqOC9W,EAAE5vB,OArOEkpB,EAqOM0G,EAAE6iB,SAAW7iB,EAAEgkB,UArOdp5B,EAqOyBu5B,EAnOvDvd,OAAAA,GAAAA,EAAM+W,EAAK4G,UAEL35B,IAAQgc,EAAMhc,GAiOtB4O,EAhOU,IAARoN,EAAoB,GAExB+W,EAAK4G,UAAY3d,EAGjBkQ,EAAIhhC,IAAI6nC,EAAK/qC,MAAMiqC,SAASc,EAAK6G,QAAS7G,EAAK6G,QAAU5d,GAAMtN;AACvC,IAApBqkB,EAAKhnC,MAAMuO,KACby4B,EAAKkB,MAAQD,GAAUjB,EAAKkB,MAAO/H,EAAKlQ,EAAKtN,GAGlB,IAApBqkB,EAAKhnC,MAAMuO,OAClBy4B,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO/H,EAAKlQ,EAAKtN,IAG7CqkB,EAAK6G,SAAW5d,EAChB+W,EAAK8G,UAAY7d,EAEVA,GAgNL5G,EAAEgkB,WAAaxqB,EAGXwG,EAAEgkB,UAAYhkB,EAAE0kB,QAhVJ,MAiVd7jB,EAAMb,EAAE6iB,SAAW7iB,EAAE0kB,OACrB1kB,EAAE2kB,MAAQ3kB,EAAE5vB,OAAOywB,GAGnBb,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAOywB,EAAM,IAInCb,EAAE0kB,SAEP1kB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAOywB,EA3VxB,EA2V4C,IAExDb,EAAExB,KAAKqC,EAAMb,EAAE2jB,QAAU3jB,EAAE7N,KAAK6N,EAAE2kB,OAClC3kB,EAAE7N,KAAK6N,EAAE2kB,OAAS9jB,EAClBA,IACAb,EAAE0kB,WACE1kB,EAAEgkB,UAAYhkB,EAAE0kB,OAjWR,aA0WT1kB,EAAEgkB,UAAYpC,IAAqC,IAApB5hB,EAAE2d,KAAK4G,WAoJ3CK,GAAe,SAAC5kB,EAAG9N,WAEnB2yB,EACAC,IAEK,IAMH9kB,EAAEgkB,UAAYpC,GAAe,IAC/BsC,GAAYlkB;AACRA,EAAEgkB,UAAYpC,IAAiB1vB,IAAUstB,UA7fzB,KAggBA,IAAhBxf,EAAEgkB,mBAQRa,EAAY,EACR7kB,EAAEgkB,WAvhBU,IAyhBdhkB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAO4vB,EAAE6iB,SAzhBxB,EAyhBiD,IAC/DgC,EAAY7kB,EAAExB,KAAKwB,EAAE6iB,SAAW7iB,EAAE2jB,QAAU3jB,EAAE7N,KAAK6N,EAAE2kB,OACrD3kB,EAAE7N,KAAK6N,EAAE2kB,OAAS3kB,EAAE6iB,UAOJ,IAAdgC,GAA4B7kB,EAAE6iB,SAAWgC,GAAe7kB,EAAEwjB,OAAS5B,KAKrE5hB,EAAE+kB,aAAe/B,GAAchjB,EAAG6kB,IAGhC7kB,EAAE+kB,cA1iBU,KA+iBdD,EAASvD,GAAYvhB,EAAGA,EAAE6iB,SAAW7iB,EAAEikB,YAAajkB,EAAE+kB,aA/iBxC,GAijBd/kB,EAAEgkB,WAAahkB,EAAE+kB,aAKb/kB,EAAE+kB,cAAgB/kB,EAAEglB,gBAAuChlB,EAAEgkB,WAtjBnD,EAsjB6E,CACzFhkB,EAAE+kB,kBAEA/kB,EAAE6iB,WAEF7iB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAO4vB,EAAE6iB,SA3jB5B,EA2jBqD;AAC/DgC,EAAY7kB,EAAExB,KAAKwB,EAAE6iB,SAAW7iB,EAAE2jB,QAAU3jB,EAAE7N,KAAK6N,EAAE2kB,OACrD3kB,EAAE7N,KAAK6N,EAAE2kB,OAAS3kB,EAAE6iB,eAKQ,KAAnB7iB,EAAE+kB,cACb/kB,EAAE6iB,gBAGF7iB,EAAE6iB,UAAY7iB,EAAE+kB,aAChB/kB,EAAE+kB,aAAe,EACjB/kB,EAAE2kB,MAAQ3kB,EAAE5vB,OAAO4vB,EAAE6iB,UAErB7iB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAO4vB,EAAE6iB,SAAW,SAanDiC,EAASvD,GAAYvhB,EAAG,EAAGA,EAAE5vB,OAAO4vB,EAAE6iB,WAEtC7iB,EAAEgkB,YACFhkB,EAAE6iB,cAEAiC,IAEFnC,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,kBAjlBS,SAulBxBviB,EAAE0kB,OAAW1kB,EAAE6iB,SAAYoC,EAAoBjlB,EAAE6iB,SAAWoC,EACxD/yB,IAAU0tB,IAEZ+C,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,UAzlBW,EACA,GA8lBpBviB,EAAEoa,WAEJuI,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,WApmBW,EACA,GAgnBpB2C,GAAe,SAACllB,EAAG9N;QAEnB2yB,EACAC,EAEAK,IAGK,IAMHnlB,EAAEgkB,UAAYpC,GAAe,IAC/BsC,GAAYlkB,GACRA,EAAEgkB,UAAYpC,IAAiB1vB,IAAUstB,UAjoBzB,KAooBA,IAAhBxf,EAAEgkB,mBAMRa,EAAY,EACR7kB,EAAEgkB,WAzpBU,IA2pBdhkB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAO4vB,EAAE6iB,SA3pBxB,EA2pBiD,IAC/DgC,EAAY7kB,EAAExB,KAAKwB,EAAE6iB,SAAW7iB,EAAE2jB,QAAU3jB,EAAE7N,KAAK6N,EAAE2kB,OACrD3kB,EAAE7N,KAAK6N,EAAE2kB,OAAS3kB,EAAE6iB,UAMtB7iB,EAAEsjB,YAActjB,EAAE+kB,aAClB/kB,EAAEolB,WAAaplB,EAAEikB,YACjBjkB,EAAE+kB,aAAeE,EAEC,IAAdJ,GAA0B7kB,EAAEsjB,YAActjB,EAAEglB,gBAC5ChlB,EAAE6iB,SAAWgC,GAAc7kB,EAAEwjB,OAAS5B,KAKxC5hB,EAAE+kB,aAAe/B,GAAchjB,EAAG6kB;AAG9B7kB,EAAE+kB,cAAgB,IAClB/kB,EAAEie,WAAa0C,IAjrBL,IAirBoB3gB,EAAE+kB,cAAgC/kB,EAAE6iB,SAAW7iB,EAAEikB,YAAc,QAK/FjkB,EAAE+kB,aAAeE,IAMjBjlB,EAAEsjB,aA5rBU,GA4rBoBtjB,EAAE+kB,cAAgB/kB,EAAEsjB,YAAa,CACnE6B,EAAanlB,EAAE6iB,SAAW7iB,EAAEgkB,UA7rBd,EAosBdc,EAASvD,GAAYvhB,EAAGA,EAAE6iB,SAAW,EAAI7iB,EAAEolB,WAAYplB,EAAEsjB,YApsB3C,GA0sBdtjB,EAAEgkB,WAAahkB,EAAEsjB,YAAc,EAC/BtjB,EAAEsjB,aAAe,OAETtjB,EAAE6iB,UAAYsC,IAElBnlB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAO4vB,EAAE6iB,SA/sB5B,EA+sBqD,IAC/DgC,EAAY7kB,EAAExB,KAAKwB,EAAE6iB,SAAW7iB,EAAE2jB,QAAU3jB,EAAE7N,KAAK6N,EAAE2kB,OACrD3kB,EAAE7N,KAAK6N,EAAE2kB,OAAS3kB,EAAE6iB,gBAGK,KAAlB7iB,EAAEsjB,gBACbtjB,EAAEqlB,gBAAkB,EACpBrlB,EAAE+kB,aAAeE;AACjBjlB,EAAE6iB,WAEEiC,IAEFnC,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,kBA9sBO,OAotBf,GAAIviB,EAAEqlB,qBAOXP,EAASvD,GAAYvhB,EAAG,EAAGA,EAAE5vB,OAAO4vB,EAAE6iB,SAAW,MAI/CF,GAAiB3iB,GAAG,GAGtBA,EAAE6iB,WACF7iB,EAAEgkB,YACuB,IAArBhkB,EAAE2d,KAAK4E,iBApuBS,OA2uBpBviB,EAAEqlB,gBAAkB,EACpBrlB,EAAE6iB,WACF7iB,EAAEgkB,mBAIFhkB,EAAEqlB,kBAGJP,EAASvD,GAAYvhB,EAAG,EAAGA,EAAE5vB,OAAO4vB,EAAE6iB,SAAW,IAEjD7iB,EAAEqlB,gBAAkB,GAEtBrlB,EAAE0kB,OAAS1kB,EAAE6iB,SAAWoC,EAAkBjlB,EAAE6iB,SAAWoC,EACnD/yB,IAAU0tB,IAEZ+C,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,UA1vBW,EACA,GA+vBpBviB,EAAEoa,WAEJuI,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,WArwBW,EACA,GA66B1B,SAAS+C,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,QAExDJ,YAAcA;KACdC,SAAWA,OACXC,YAAcA,OACdC,UAAYA,OACZC,KAAOA,EAGd,IAAMC,GAAsB,CAE1B,IAAIN,GAAO,EAAG,EAAG,EAAG,GA5iBC,SAACtlB,EAAG9N,OAKrB2zB,EAAiB,UAEjBA,EAAiB7lB,EAAE8lB,iBAAmB,IACxCD,EAAiB7lB,EAAE8lB,iBAAmB,KAI/B,IAEH9lB,EAAEgkB,WAAa,EAAG,IASpBE,GAAYlkB,GACQ,IAAhBA,EAAEgkB,WAAmB9xB,IAAUstB,UAraf,KAyaA,IAAhBxf,EAAEgkB,gBAQRhkB,EAAE6iB,UAAY7iB,EAAEgkB,UAChBhkB,EAAEgkB,UAAY,MAGR+B,EAAY/lB,EAAE4iB,YAAciD,MAEf,IAAf7lB,EAAE6iB,UAAkB7iB,EAAE6iB,UAAYkD,KAEpC/lB,EAAEgkB,UAAYhkB,EAAE6iB,SAAWkD,EAC3B/lB,EAAE6iB,SAAWkD,EAEbpD,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,kBA7bS,KAuclBviB,EAAE6iB,SAAW7iB,EAAE4iB,aAAgB5iB,EAAEwjB,OAAS5B,KAE5Ce,GAAiB3iB,GAAG;AACK,IAArBA,EAAE2d,KAAK4E,kBA1cS,SAidxBviB,EAAE0kB,OAAS,EAEPxyB,IAAU0tB,IAEZ+C,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,UApdW,EACA,IA0dpBviB,EAAE6iB,SAAW7iB,EAAE4iB,cAEjBD,GAAiB3iB,GAAG,GAChBA,EAAE2d,KAAK4E,WAheW,MA07BxB,IAAI+C,GAAO,EAAG,EAAG,EAAG,EAAGV,IACvB,IAAIU,GAAO,EAAG,EAAG,GAAI,EAAGV,IACxB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIV,IAEzB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIJ,IACzB,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,IAC1B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,IAC/B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,KA+BjC,SAASc,UACFrI,KAAO,UACPsI,OAAS,OACTjN,YAAc,UACd8M,iBAAmB,OACnBtD,YAAc,OACdvJ,QAAU,OACV/zB,KAAO;KACPghC,OAAS,UACTC,QAAU,OACV5tC,OAAS4oC,QACTiF,YAAc,OAEd5C,OAAS,OACT6C,OAAS,OACT1C,OAAS,OAETvzC,OAAS,UAQTi0C,YAAc,OAKd7lB,KAAO,UAMPrM,KAAO,UAEPwyB,MAAQ,OACRL,UAAY,OACZgC,UAAY,OACZjE,UAAY,OAEZD,WAAa,OAObQ,YAAc,OAKdmC,aAAe,OACfK,WAAa,OACbC,gBAAkB,OAClBxC,SAAW,OACXoB,YAAc,OACdD,UAAY,OAEZV,YAAc,OAKdH,iBAAmB,OAMnB6B,eAAiB,OAYjBtH,MAAQ,OACRO,SAAW,OAEX8F,WAAa;KAGbR,WAAa,OAYbzJ,UAAa,IAAInN,YAAY4Z,WAC7BxM,UAAa,IAAIpN,YAAY,UAC7BqN,QAAa,IAAIrN,YAAY,IAClCuV,GAAO5xC,KAAKwpC,WACZoI,GAAO5xC,KAAKypC,WACZmI,GAAO5xC,KAAK0pC,cAEPmD,OAAW,UACXC,OAAW,UACXC,QAAW,UAGX3D,SAAW,IAAI/M,YAAY6Z,SAI3B3L,KAAO,IAAIlO,YAAY,KAC5BuV,GAAO5xC,KAAKuqC,WAEPC,SAAW,OACXW,SAAW,OAKXjB,MAAQ,IAAI7N,YAAY,KAC7BuV,GAAO5xC,KAAKkqC,YAIPc,MAAQ,OAERkD,YAAc,OAoBdpE,SAAW,OAEXiB,MAAQ,OAMRnB,QAAU,OACVC,WAAa,OACbE,QAAU;KACVqK,OAAS,OAGTtL,OAAS,OAITD,SAAW,EAgBlB,IAAMsN,GAAmB,SAAC9I,OAEnBA,IAASA,EAAKhnC,aACV0jB,GAAIsjB,EAAMwC,IAGnBxC,EAAK8G,SAAW9G,EAAK+E,UAAY,EACjC/E,EAAKC,UAAY8D,OAEX1hB,EAAI2d,EAAKhnC,aACfqpB,EAAEiZ,QAAU,EACZjZ,EAAEwiB,YAAc,EAEZxiB,EAAE9a,KAAO,IACX8a,EAAE9a,MAAQ8a,EAAE9a,MAGd8a,EAAEimB,OAAUjmB,EAAE9a,KAxrCG,GAwrCiB48B,GAClCnE,EAAKkB,MAAoB,IAAX7e,EAAE9a,KACd,EAEA,EACF8a,EAAEomB,WAAa5G,GACf4B,GAAWphB,GACJ+f,IAIH2G,GAAe,SAAC/I,OAEdgJ,EAAMF,GAAiB9I,UACzBgJ,IAAQ5G,IApPE,SAAC/f,GAEfA,EAAEqkB,YAAc,EAAIrkB,EAAEwjB,OAGtBtB,GAAOliB,EAAE7N,MAIT6N,EAAEglB,eAAiBY,GAAoB5lB,EAAE0d,OAAO8H,SAChDxlB,EAAE+jB,WAAa6B,GAAoB5lB,EAAE0d,OAAO6H,YAC5CvlB,EAAEujB,WAAaqC,GAAoB5lB,EAAE0d,OAAO+H;AAC5CzlB,EAAEmjB,iBAAmByC,GAAoB5lB,EAAE0d,OAAOgI,UAElD1lB,EAAE6iB,SAAW,EACb7iB,EAAE4iB,YAAc,EAChB5iB,EAAEgkB,UAAY,EACdhkB,EAAE0kB,OAAS,EACX1kB,EAAE+kB,aAAe/kB,EAAEsjB,YAAc2B,EACjCjlB,EAAEqlB,gBAAkB,EACpBrlB,EAAE2kB,MAAQ,EAiORiC,CAAQjJ,EAAKhnC,OAERgwC,GAaHE,GAAe,SAAClJ,EAAMD,EAAOnlC,EAAQuuC,EAAYC,EAAU9I,OAE1DN,SACIwC,OAELj7B,EAAO,KAEPw4B,IAAUgD,KACZhD,EAAQ,GAGNoJ,EAAa,GACf5hC,EAAO,EACP4hC,GAAcA,GAGPA,EAAa,KACpB5hC,EAAO,EACP4hC,GAAc,IAIZC,EAAW,GAAKA,EAxwCA,GAwwC4BxuC,IAAW4oC,IACzD2F,EAAa,GAAKA,EAAa,IAAMpJ,EAAQ,GAAKA,EAAQ,GAC1DO,EAAW,GAAKA,EAAWwD,UACpBpnB,GAAIsjB,EAAMwC,IAIA,IAAf2G,IACFA,EAAa,OAIT9mB,EAAI,IAAIgmB,UAEdrI,EAAKhnC,MAAQqpB,EACbA,EAAE2d,KAAOA,EAET3d,EAAE9a,KAAOA,EACT8a,EAAEkmB,OAAS,KACXlmB,EAAEqmB,OAASS,EACX9mB,EAAEwjB,OAAS,GAAKxjB,EAAEqmB,OAClBrmB,EAAE2jB,OAAS3jB,EAAEwjB,OAAS,EAEtBxjB,EAAEsmB,UAAYS,EAAW;AACzB/mB,EAAEskB,UAAY,GAAKtkB,EAAEsmB,UACrBtmB,EAAEqiB,UAAYriB,EAAEskB,UAAY,EAC5BtkB,EAAEoiB,eAAiBpiB,EAAEsmB,UA5wCH,EA4wC6B,GA5wC7B,GA8wClBtmB,EAAE5vB,OAAS,IAAIq8B,WAAsB,EAAXzM,EAAEwjB,QAC5BxjB,EAAE7N,KAAO,IAAIwa,YAAY3M,EAAEskB,WAC3BtkB,EAAExB,KAAO,IAAImO,YAAY3M,EAAEwjB,QAK3BxjB,EAAEwe,YAAc,GAAMuI,EAAW,EAEjC/mB,EAAE8lB,iBAAmC,EAAhB9lB,EAAEwe,YAIvBxe,EAAEgZ,YAAc,IAAIvM,WAAWzM,EAAE8lB,kBAIjC9lB,EAAEqb,MAAQ,EAAIrb,EAAEwe,YAGhBxe,EAAEsb,MAAQ,EAAUtb,EAAEwe,YAEtBxe,EAAE0d,MAAQA,EACV1d,EAAEie,SAAWA,EACbje,EAAEznB,OAASA,EAEJmuC,GAAa/I,IAodlBqJ,GAAY,CACfC,YAldmB,SAACtJ,EAAMD,UAElBmJ,GAAalJ,EAAMD,EAAOyD,GAj0CjB,GAEI,EA+zCmDJ,KAidxE8F,aApBoBA,GAqBpBH,aApBoBA,GAqBpBD,iBApBwBA;AAqBxBS,iBA9iBwB,SAACvJ,EAAMxrB,UAEzBwrB,GAASA,EAAKhnC,MACK,IAApBgnC,EAAKhnC,MAAMuO,KAAqBi7B,IACpCxC,EAAKhnC,MAAMuvC,OAAS/zB,EACb4tB,IAH4BI,IA6iBpCgH,QAjde,SAACxJ,EAAMzrB,OAEjBk1B,EAAKr0C,MAEJ4qC,IAASA,EAAKhnC,OACjBub,EAAQ2tB,IAAW3tB,EAAQ,SACpByrB,EAAOtjB,GAAIsjB,EAAMwC,IAAkBA,OAGtCngB,EAAI2d,EAAKhnC,UAEVgnC,EAAKva,SACJua,EAAK/qC,OAA2B,IAAlB+qC,EAAK4G,UACpBvkB,EAAEimB,SAAWlE,IAAgB7vB,IAAU0tB,UACnCvlB,GAAIsjB,EAA0B,IAAnBA,EAAK4E,UAAmBjC,GAAcH,IAG1DngB,EAAE2d,KAAOA,MACH0J,EAAYrnB,EAAEomB,cACpBpmB,EAAEomB,WAAal0B,EA9zCE,KAi0Cb8N,EAAEimB,UAEW,IAAXjmB,EAAE9a,KACJy4B,EAAKkB,MAAQ,EACbiE,GAAS9iB,EAAG,IACZ8iB,GAAS9iB,EAAG,KACZ8iB,GAAS9iB,EAAG;AACPA,EAAEkmB,QAaLpD,GAAS9iB,GAAIA,EAAEkmB,OAAOoB,KAAO,EAAI,IACpBtnB,EAAEkmB,OAAOqB,KAAO,EAAI,IACnBvnB,EAAEkmB,OAAO/K,MAAY,EAAJ,IACjBnb,EAAEkmB,OAAO1mC,KAAW,EAAJ,IAChBwgB,EAAEkmB,OAAOsB,QAAc,GAAJ,IAEjC1E,GAAS9iB,EAAmB,IAAhBA,EAAEkmB,OAAOuB,MACrB3E,GAAS9iB,EAAIA,EAAEkmB,OAAOuB,MAAQ,EAAK,KACnC3E,GAAS9iB,EAAIA,EAAEkmB,OAAOuB,MAAQ,GAAM,KACpC3E,GAAS9iB,EAAIA,EAAEkmB,OAAOuB,MAAQ,GAAM,KACpC3E,GAAS9iB,EAAe,IAAZA,EAAE0d,MAAc,EACf1d,EAAEie,UAAY2C,IAAkB5gB,EAAE0d,MAAQ,EAC1C,EAAI,GACjBoF,GAAS9iB,EAAiB,IAAdA,EAAEkmB,OAAOwB,IACjB1nB,EAAEkmB,OAAO/K,OAASnb,EAAEkmB,OAAO/K,MAAM1iC,SACnCqqC,GAAS9iB,EAA2B,IAAxBA,EAAEkmB,OAAO/K,MAAM1iC,QAC3BqqC,GAAS9iB,EAAIA,EAAEkmB,OAAO/K,MAAM1iC,QAAU,EAAK,MAEzCunB,EAAEkmB,OAAOqB,OACX5J,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAS,IAE7DjZ,EAAEmmB,QAAU;AACZnmB,EAAEimB,OA12CU,KAw0CZnD,GAAS9iB,EAAG,GACZ8iB,GAAS9iB,EAAG,GACZ8iB,GAAS9iB,EAAG,GACZ8iB,GAAS9iB,EAAG,GACZ8iB,GAAS9iB,EAAG,GACZ8iB,GAAS9iB,EAAe,IAAZA,EAAE0d,MAAc,EACf1d,EAAEie,UAAY2C,IAAkB5gB,EAAE0d,MAAQ,EAC1C,EAAI,GACjBoF,GAAS9iB,EAp0CD,GAq0CRA,EAAEimB,OAASnE,aA8BTlF,EAAUuE,IAAenhB,EAAEqmB,OAAS,GAAM,IAAO,EAYrDzJ,IATI5c,EAAEie,UAAY2C,IAAkB5gB,EAAE0d,MAAQ,EAC9B,EACL1d,EAAE0d,MAAQ,EACL,EACO,IAAZ1d,EAAE0d,MACG,EAEA,IAEU,EACP,IAAf1d,EAAE6iB,WAAkBjG,GA/3CV,IAg4CdA,GAAU,GAAMA,EAAS,GAEzB5c,EAAEimB,OAASnE,GACXiB,GAAY/iB,EAAG4c,GAGI,IAAf5c,EAAE6iB,WACJE,GAAY/iB,EAAG2d,EAAKkB,QAAU,IAC9BkE,GAAY/iB,EAAgB,MAAb2d,EAAKkB,QAEtBlB,EAAKkB,MAAQ,KAv4CC,KA44Cd7e,EAAEimB,UACAjmB,EAAEkmB,OAAO/K,MAAqB;IAChCiM,EAAMpnB,EAAEiZ,QAEDjZ,EAAEmmB,SAAmC,MAAxBnmB,EAAEkmB,OAAO/K,MAAM1iC,UAC7BunB,EAAEiZ,UAAYjZ,EAAE8lB,mBACd9lB,EAAEkmB,OAAOqB,MAAQvnB,EAAEiZ,QAAUmO,IAC/BzJ,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAUmO,EAAKA,IAEnE9E,GAAc3E,GACdyJ,EAAMpnB,EAAEiZ,QACJjZ,EAAEiZ,UAAYjZ,EAAE8lB,oBAItBhD,GAAS9iB,EAA+B,IAA5BA,EAAEkmB,OAAO/K,MAAMnb,EAAEmmB,UAC7BnmB,EAAEmmB,UAEAnmB,EAAEkmB,OAAOqB,MAAQvnB,EAAEiZ,QAAUmO,IAC/BzJ,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAUmO,EAAKA,IAE/DpnB,EAAEmmB,UAAYnmB,EAAEkmB,OAAO/K,MAAM1iC,SAC/BunB,EAAEmmB,QAAU,EACZnmB,EAAEimB,OAl6CS,SAs6CbjmB,EAAEimB,OAt6CW,MAAA,KAy6CbjmB,EAAEimB,UACAjmB,EAAEkmB,OAAO1mC,KAAoB,CAC/B4nC,EAAMpnB,EAAEiZ,UAGL;GACGjZ,EAAEiZ,UAAYjZ,EAAE8lB,mBACd9lB,EAAEkmB,OAAOqB,MAAQvnB,EAAEiZ,QAAUmO,IAC/BzJ,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAUmO,EAAKA,IAEnE9E,GAAc3E,GACdyJ,EAAMpnB,EAAEiZ,QACJjZ,EAAEiZ,UAAYjZ,EAAE8lB,kBAAkB,CACpC/yC,EAAM,QAMRA,EADEitB,EAAEmmB,QAAUnmB,EAAEkmB,OAAO1mC,KAAK/G,OACkB,IAAxCunB,EAAEkmB,OAAO1mC,KAAKqL,WAAWmV,EAAEmmB,WAE3B,EAERrD,GAAS9iB,EAAGjtB,SACG,IAARA,GAELitB,EAAEkmB,OAAOqB,MAAQvnB,EAAEiZ,QAAUmO,IAC/BzJ,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAUmO,EAAKA,IAEvD,IAARr0C,IACFitB,EAAEmmB,QAAU,EACZnmB,EAAEimB,OAv8CY,SA28ChBjmB,EAAEimB,OA38Cc,MAAA,KA88ChBjmB,EAAEimB,UACAjmB,EAAEkmB,OAAOsB,QAAuB,CAClCJ,EAAMpnB,EAAEiZ,UAGL;GACGjZ,EAAEiZ,UAAYjZ,EAAE8lB,mBACd9lB,EAAEkmB,OAAOqB,MAAQvnB,EAAEiZ,QAAUmO,IAC/BzJ,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAUmO,EAAKA,IAEnE9E,GAAc3E,GACdyJ,EAAMpnB,EAAEiZ,QACJjZ,EAAEiZ,UAAYjZ,EAAE8lB,kBAAkB,CACpC/yC,EAAM,QAMRA,EADEitB,EAAEmmB,QAAUnmB,EAAEkmB,OAAOsB,QAAQ/uC,OACkB,IAA3CunB,EAAEkmB,OAAOsB,QAAQ38B,WAAWmV,EAAEmmB,WAE9B,EAERrD,GAAS9iB,EAAGjtB,SACG,IAARA,GAELitB,EAAEkmB,OAAOqB,MAAQvnB,EAAEiZ,QAAUmO,IAC/BzJ,EAAKkB,MAAQM,GAAQxB,EAAKkB,MAAO7e,EAAEgZ,YAAahZ,EAAEiZ,QAAUmO,EAAKA,IAEvD,IAARr0C,IACFitB,EAAEimB,OAASpE,SAIb7hB,EAAEimB,OAASpE,MAGX7hB,EAAEimB,SAAWpE,KACX7hB,EAAEkmB,OAAOqB,MACPvnB,EAAEiZ,QAAU,EAAIjZ,EAAE8lB,kBACpBxD,GAAc3E;AAEZ3d,EAAEiZ,QAAU,GAAKjZ,EAAE8lB,mBACrBhD,GAAS9iB,EAAgB,IAAb2d,EAAKkB,OACjBiE,GAAS9iB,EAAI2d,EAAKkB,OAAS,EAAK,KAChClB,EAAKkB,MAAQ,EACb7e,EAAEimB,OAASnE,KAIb9hB,EAAEimB,OAASnE,IAMG,IAAd9hB,EAAEiZ,YACJqJ,GAAc3E,GACS,IAAnBA,EAAK4E,iBAOPviB,EAAEomB,YAAc,EACTrG,QAOJ,GAAsB,IAAlBpC,EAAK4G,UAAkBlG,GAAKnsB,IAAUmsB,GAAKgJ,IACpDn1B,IAAU0tB,UACHvlB,GAAIsjB,EAAM2C,OAIftgB,EAAEimB,SAAWlE,IAAkC,IAAlBpE,EAAK4G,gBAC7BlqB,GAAIsjB,EAAM2C,OAKG,IAAlB3C,EAAK4G,UAAkC,IAAhBvkB,EAAEgkB,WAC1B9xB,IAAUstB,IAAcxf,EAAEimB,SAAWlE,GAAe,KACjD4F,EAAU3nB,EAAEie,WAAa2C,GA5qBZ,SAAC5gB,EAAG9N,WAEnB4yB,IAEK,IAEa,IAAhB9kB,EAAEgkB,YACJE,GAAYlkB,GACQ,IAAhBA,EAAEgkB,WAAiB,IACjB9xB,IAAUstB,UA73BI,WAq4BtBxf,EAAE+kB,aAAe;AAGjBD,EAASvD,GAAYvhB,EAAG,EAAGA,EAAE5vB,OAAO4vB,EAAE6iB,WACtC7iB,EAAEgkB,YACFhkB,EAAE6iB,WACEiC,IAEFnC,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,kBA94BS,SAo5BxBviB,EAAE0kB,OAAS,EACPxyB,IAAU0tB,IAEZ+C,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,UAt5BW,EACA,GA25BpBviB,EAAEoa,WAEJuI,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,WAj6BW,EACA,EA+hDyBqF,CAAa5nB,EAAG9N,GAC5D8N,EAAEie,WAAa4C,GA7wBF,SAAC7gB,EAAG9N,WAElB4yB,EACAtmB,EACA4kB,EAAMQ,EAEJH,EAAOzjB,EAAE5vB,SAEN,IAKH4vB,EAAEgkB,WAAarC,GAAa,IAC9BuC,GAAYlkB,GACRA,EAAEgkB,WAAarC,IAAezvB,IAAUstB,UAnyBxB,KAsyBA,IAAhBxf,EAAEgkB,mBAIRhkB,EAAE+kB,aAAe,EACb/kB,EAAEgkB,WAzzBU,GAyzBkBhkB,EAAE6iB,SAAW,IAE7CrkB,EAAOilB,EADPL,EAAOpjB,EAAE6iB,SAAW,MAEPY,IAAOL,IAAS5kB,IAASilB,IAAOL,IAAS5kB,IAASilB,IAAOL,GAAO,CAC3EQ,EAAS5jB,EAAE6iB,SAAWlB;WAGbnjB,IAASilB,IAAOL,IAAS5kB,IAASilB,IAAOL,IACzC5kB,IAASilB,IAAOL,IAAS5kB,IAASilB,IAAOL,IACzC5kB,IAASilB,IAAOL,IAAS5kB,IAASilB,IAAOL,IACzC5kB,IAASilB,IAAOL,IAAS5kB,IAASilB,IAAOL,IACzCA,EAAOQ,GAChB5jB,EAAE+kB,aAAepD,IAAeiC,EAASR,GACrCpjB,EAAE+kB,aAAe/kB,EAAEgkB,YACrBhkB,EAAE+kB,aAAe/kB,EAAEgkB,cAOrBhkB,EAAE+kB,cA90BU,GAk1BdD,EAASvD,GAAYvhB,EAAG,EAAGA,EAAE+kB,aAl1Bf,GAo1Bd/kB,EAAEgkB,WAAahkB,EAAE+kB,aACjB/kB,EAAE6iB,UAAY7iB,EAAE+kB,aAChB/kB,EAAE+kB,aAAe,IAKjBD,EAASvD,GAAYvhB,EAAG,EAAGA,EAAE5vB,OAAO4vB,EAAE6iB,WAEtC7iB,EAAEgkB,YACFhkB,EAAE6iB,YAEAiC,IAEFnC,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,kBAr1BS,SA21BxBviB,EAAE0kB,OAAS,EACPxyB,IAAU0tB,IAEZ+C,GAAiB3iB,GAAG;AACK,IAArBA,EAAE2d,KAAK4E,UA71BW,EACA,GAk2BpBviB,EAAEoa,WAEJuI,GAAiB3iB,GAAG,GACK,IAArBA,EAAE2d,KAAK4E,WAx2BW,EACA,EAgiDIsF,CAAY7nB,EAAG9N,GACrC0zB,GAAoB5lB,EAAE0d,OAAOiI,KAAK3lB,EAAG9N,MAhiDnB,IAkiDlBy1B,GAjiDkB,IAiiDcA,IAClC3nB,EAAEimB,OAASlE,IAriDS,IAuiDlB4F,GAriDkB,IAqiDSA,SACN,IAAnBhK,EAAK4E,YACPviB,EAAEomB,YAAc,GAGXrG,MA3iDa,IAojDlB4H,IACEz1B,IAAUutB,GACZ+B,GAAYxhB,GAEL9N,IAAU2tB,KAEjBwB,GAAmBrhB,EAAG,EAAG,GAAG,GAIxB9N,IAAUytB,KAEZuC,GAAOliB,EAAE7N,MAEW,IAAhB6N,EAAEgkB,YACJhkB,EAAE6iB,SAAW,EACb7iB,EAAE4iB,YAAc,EAChB5iB,EAAE0kB,OAAS,KAIjBpC,GAAc3E,GACS,IAAnBA,EAAK4E,kBACPviB,EAAEomB,YAAc,EACTrG,UAOT7tB,IAAU0tB,GAAmBG,GAC7B/f,EAAE9a,MAAQ,EAAY86B,IAGX,IAAXhgB,EAAE9a,MACJ49B,GAAS9iB,EAAgB,IAAb2d,EAAKkB,OACjBiE,GAAS9iB,EAAI2d,EAAKkB,OAAS,EAAK,KAChCiE,GAAS9iB,EAAI2d,EAAKkB,OAAS,GAAM,KACjCiE,GAAS9iB,EAAI2d,EAAKkB,OAAS,GAAM;AACjCiE,GAAS9iB,EAAmB,IAAhB2d,EAAK8G,UACjB3B,GAAS9iB,EAAI2d,EAAK8G,UAAY,EAAK,KACnC3B,GAAS9iB,EAAI2d,EAAK8G,UAAY,GAAM,KACpC3B,GAAS9iB,EAAI2d,EAAK8G,UAAY,GAAM,OAIpC1B,GAAY/iB,EAAG2d,EAAKkB,QAAU,IAC9BkE,GAAY/iB,EAAgB,MAAb2d,EAAKkB,QAGtByD,GAAc3E,GAIV3d,EAAE9a,KAAO,IAAK8a,EAAE9a,MAAQ8a,EAAE9a,MAET,IAAd8a,EAAEiZ,QAAgB8G,GAAOC,KAuIjC8H,WAnIkB,SAACnK,OAEbA,IAAsBA,EAAKhnC,aACvBwpC,OAGH8F,EAAStI,EAAKhnC,MAAMsvC,cAhoDT,KAioDbA,GAhoDc,KAioDhBA,GAhoDe,KAioDfA,GAhoDkB,KAioDlBA,GACAA,IAAWpE,IACXoE,IAAWnE,IACXmE,IAAWlE,GAEJ1nB,GAAIsjB,EAAMwC,KAGnBxC,EAAKhnC,MAAQ,KAENsvC,IAAWnE,GAAaznB,GAAIsjB,EAAMyC,IAAgBL,KAgH1DgI,qBAxG4B,SAACpK,EAAMqK,OAE9BC,EAAaD,EAAWvvC,WAEvBklC,IAAsBA,EAAKhnC,aACvBwpC,OAGHngB,EAAI2d,EAAKhnC,MACTuO,EAAO8a,EAAE9a;IAEF,IAATA,GAAwB,IAATA,GAjqDF,KAiqDgB8a,EAAEimB,QAA0BjmB,EAAEgkB,iBACtD7D,MAII,IAATj7B,IAEFy4B,EAAKkB,MAAQD,GAAUjB,EAAKkB,MAAOmJ,EAAYC,EAAY,IAG7DjoB,EAAE9a,KAAO,EAGL+iC,GAAcjoB,EAAEwjB,OAAQ,CACb,IAATt+B,IAEFg9B,GAAOliB,EAAE7N,MACT6N,EAAE6iB,SAAW,EACb7iB,EAAE4iB,YAAc,EAChB5iB,EAAE0kB,OAAS,OAITwD,EAAU,IAAIzb,WAAWzM,EAAEwjB,QAC/B0E,EAAQpyC,IAAIkyC,EAAWnL,SAASoL,EAAajoB,EAAEwjB,OAAQyE,GAAa,GACpED,EAAaE,EACbD,EAAajoB,EAAEwjB,WAGX2E,EAAQxK,EAAK4G,SACbl8B,EAAOs1B,EAAK6G,QACZ5xC,EAAQ+qC,EAAK/qC,UACnB+qC,EAAK4G,SAAW0D,EAChBtK,EAAK6G,QAAU,EACf7G,EAAK/qC,MAAQo1C,EACb9D,GAAYlkB,GACLA,EAAEgkB,WA3sDS,GA2sDiB,KAC7BnjB,EAAMb,EAAE6iB,SACRrpB,EAAIwG,EAAEgkB,eAGRhkB,EAAE2kB,MAAQxC,GAAKniB,EAAGA,EAAE2kB,MAAO3kB,EAAE5vB,OAAOywB,EAhtDtB,EAgtD0C,IAExDb,EAAExB,KAAKqC,EAAMb,EAAE2jB,QAAU3jB,EAAE7N,KAAK6N,EAAE2kB,OAElC3kB,EAAE7N,KAAK6N,EAAE2kB,OAAS9jB,EAClBA,YACSrH;CACXwG,EAAE6iB,SAAWhiB,EACbb,EAAEgkB,UAAYiB,EACdf,GAAYlkB,UAEdA,EAAE6iB,UAAY7iB,EAAEgkB,UAChBhkB,EAAE4iB,YAAc5iB,EAAE6iB,SAClB7iB,EAAE0kB,OAAS1kB,EAAEgkB,UACbhkB,EAAEgkB,UAAY,EACdhkB,EAAE+kB,aAAe/kB,EAAEsjB,YAAc2B,EACjCjlB,EAAEqlB,gBAAkB,EACpB1H,EAAK6G,QAAUn8B,EACfs1B,EAAK/qC,MAAQA,EACb+qC,EAAK4G,SAAW4D,EAChBnoB,EAAE9a,KAAOA,EACF66B,IAgCRqI,YApBiB,sCAuBZC,GAAO,SAACjuB,EAAK9mB,UACVzC,OAAOoH,UAAU9E,eAAe/B,KAAKgpB,EAAK9mB,IA6C/Co1B,GA1CS,SAAUtO,WACfkuB,EAAUtrC,MAAM/E,UAAUjG,MAAMZ,KAAKoH,UAAW,GAC/C8vC,EAAQ7vC,QAAQ,KACfV,EAASuwC,EAAQC,WAClBxwC;GAEiB,WAAlB0kB,EAAO1kB,SACH,IAAIxF,UAAUwF,EAAS,0BAG1B,IAAM4gB,KAAK5gB,EACVswC,GAAKtwC,EAAQ4gB,KACfyB,EAAIzB,GAAK5gB,EAAO4gB,YAKfyB,GAyBLsO,GApBgB,SAAC8f,WAEf5hB,EAAM,EAED9sB,EAAI,EAAG2uC,EAAID,EAAO/vC,OAAQqB,EAAI2uC,EAAG3uC,IACxC8sB,GAAO4hB,EAAO1uC,GAAGrB,eAIbsB,EAAS,IAAI0yB,WAAW7F,GAErB9sB,EAAI,EAAGyQ,EAAM,EAAGk+B,EAAID,EAAO/vC,OAAQqB,EAAI2uC,EAAG3uC,IAAK,KAClD4uC,EAAQF,EAAO1uC,GACnBC,EAAOjE,IAAI4yC,EAAOn+B,GAClBA,GAAOm+B,EAAMjwC,cAGRsB,GAgBL4uC,IAAmB,EAEvB,IAAMj0C,OAAOk0C,aAAazoC,MAAM,KAAM,IAAIssB,WAAW,IAAO,MAAOoc,GAAMF,IAAmB,EAO5F,IADA,IAAMG,GAAW,IAAIrc,WAAW,KACvB9I,GAAI,EAAGA,GAAI,IAAKA,KACvBmlB,GAASnlB,IAAMA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAI,EAE5FmlB,GAAS,KAAOA,GAAS,KAAO,EAIhC,IA6IIC,GA7Ia,SAACloB;IACZiW,EAAK52B,EAAG8oC,EAAIC,EAAOnvC,EAAGovC,EAAUroB,EAAIpoB,OAAQ0wC,EAAU,MAGrDF,EAAQ,EAAGA,EAAQC,EAASD,IAEV,QAAZ,OADT/oC,EAAI2gB,EAAIhW,WAAWo+B,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKnoB,EAAIhW,WAAWo+B,EAAQ,OAE1B/oC,EAAI,OAAYA,EAAI,OAAW,KAAO8oC,EAAK,OAC3CC,KAGJE,GAAWjpC,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,MAI9D42B,EAAM,IAAIrK,WAAW0c,GAGhBrvC,EAAI,EAAGmvC,EAAQ,EAAGnvC,EAAIqvC,EAASF,IAEb,QAAZ,OADT/oC,EAAI2gB,EAAIhW,WAAWo+B,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKnoB,EAAIhW,WAAWo+B,EAAQ,OAE1B/oC,EAAI,OAAYA,EAAI,OAAW,KAAO8oC,EAAK,OAC3CC,KAGA/oC,EAAI,IAEN42B,EAAIh9B,KAAOoG,EACFA,EAAI,MAEb42B,EAAIh9B,KAAO,IAAQoG,IAAM,EACzB42B,EAAIh9B,KAAO,IAAY,GAAJoG,GACVA,EAAI,OAEb42B,EAAIh9B,KAAO,IAAQoG,IAAM,GACzB42B,EAAIh9B,KAAO,IAAQoG,IAAM,EAAI,GAC7B42B,EAAIh9B,KAAO,IAAY,GAAJoG,IAGnB42B,EAAIh9B,KAAO,IAAQoG,IAAM;AACzB42B,EAAIh9B,KAAO,IAAQoG,IAAM,GAAK,GAC9B42B,EAAIh9B,KAAO,IAAQoG,IAAM,EAAI,GAC7B42B,EAAIh9B,KAAO,IAAY,GAAJoG,UAIhB42B,GA2FLiS,GApEa,SAACjS,EAAK99B,OACjBc,EAAGsvC,EACDxiB,EAAM5tB,GAAO89B,EAAIr+B,OAKjB4wC,EAAW,IAAIrsC,MAAY,EAAN4pB,OAEtBwiB,EAAM,EAAGtvC,EAAI,EAAGA,EAAI8sB,GAAM,KACzB1mB,EAAI42B,EAAIh9B,QAERoG,EAAI,IAAQmpC,EAASD,KAASlpC,WAE9BopC,EAAQR,GAAS5oC,MAEjBopC,EAAQ,EAAKD,EAASD,KAAS,MAAQtvC,GAAKwvC,EAAQ,WAGxDppC,GAAe,IAAVopC,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAKxvC,EAAI8sB,GACtB1mB,EAAKA,GAAK,EAAiB,GAAX42B,EAAIh9B,KACpBwvC,IAIEA,EAAQ,EAAKD,EAASD,KAAS,MAE/BlpC,EAAI,MACNmpC,EAASD,KAASlpC,GAElBA,GAAK,MACLmpC,EAASD,KAAS,MAAWlpC,GAAK,GAAM,KACxCmpC,EAASD,KAAS,MAAc,KAAJlpC,YArDZ,SAAC42B,EAAKlQ,MAItBA,EAAM,OACJkQ,EAAI+F,UAAY8L,UACXj0C,OAAOk0C,aAAazoC,MAAM,KAAM22B,EAAIr+B,SAAWmuB,EAAMkQ,EAAMA,EAAI+F,SAAS,EAAGjW;SAIlF7sB,EAAS,GACJD,EAAI,EAAGA,EAAI8sB,EAAK9sB,IACvBC,GAAUrF,OAAOk0C,aAAa9R,EAAIh9B,WAE7BC,EA2CAwvC,CAAcF,EAAUD,IA8B7BL,GApBa,SAACjS,EAAK99B,IAErBA,EAAMA,GAAO89B,EAAIr+B,QACPq+B,EAAIr+B,SAAUO,EAAM89B,EAAIr+B,gBAG9B8R,EAAMvR,EAAM,EACTuR,GAAO,GAA2B,MAAV,IAAXusB,EAAIvsB,KAAyBA,WAI7CA,EAAM,GAIE,IAARA,EAJkBvR,EAMduR,EAAMu+B,GAAShS,EAAIvsB,IAAQvR,EAAOuR,EAAMvR,GAqDlD,IAAIwwC,GAzBJ,gBAEO52C,MAAQ,UACR4xC,QAAU,OAEVD,SAAW,OAEXE,SAAW,OAEXrhB,OAAS,UACTqf,SAAW,OAEXF,UAAY,OAEZG,UAAY,OAEZT,IAAM,QAENtrC,MAAQ,UAERinC,UAAY,OAEZiB,MAAQ;EAKT/sC,GAAWjB,OAAOoH,UAAUnG,SAMpB23C,GAKVlK,GALFC,WAA0BE,GAKxBH,GALwBG,aAA4BgK,GAKpDnK,GALsCI,aAAwCgK,GAK9EpK,GALoEK,SAChEgK,GAIJrK,GAJFQ,KAA4B8J,GAI1BtK,GAJYS,aACS8J,GAGrBvK,GAHFmB,sBACoBqJ,GAElBxK,GAFFwB,mBACYiJ,GACVzK,GADF4B,WA2FF,SAAS8I,GAAQtyC,QACVA,QAAU+wB,GAAc,CAC3BgV,MAAOoM,GACPvxC,OAAQyxC,GACRE,UAAW,MACXpD,WAAY,GACZC,SAAU,EACV9I,SAAU8L,IACTpyC,GAAW,QAEVwyC,EAAM75C,KAAKqH,QAEXwyC,EAAIC,KAAQD,EAAIrD,WAAa,EAC/BqD,EAAIrD,YAAcqD,EAAIrD,WAGfqD,EAAIE,MAASF,EAAIrD,WAAa,GAAOqD,EAAIrD,WAAa,KAC7DqD,EAAIrD,YAAc,SAGfzsB,IAAS,OACT4nB,IAAS,QACTqI,OAAS,OACT9B,OAAS;KAET7K,KAAO,IAAI6L,QACX7L,KAAK4E,UAAY,MAElB0D,EAASe,GAAUH,aACrBv2C,KAAKqtC,KACLwM,EAAIzM,MACJyM,EAAI5xC,OACJ4xC,EAAIrD,WACJqD,EAAIpD,SACJoD,EAAIlM,aAGFgI,IAAW2D,SACP,IAAI3uB,MAAMqkB,GAAS2G,OAGvBkE,EAAIvN,QACNoK,GAAUE,iBAAiB52C,KAAKqtC,KAAMwM,EAAIvN,QAGxCuN,EAAInC,WAAY,KACduC,KAIFA,EAF4B,iBAAnBJ,EAAInC,WAENe,GAAmBoB,EAAInC,YACa,yBAAlCl2C,GAASV,KAAK+4C,EAAInC,YACpB,IAAIvb,WAAW0d,EAAInC,YAEnBmC,EAAInC,YAGb/B,EAASe,GAAUe,qBAAqBz3C,KAAKqtC,KAAM4M,MAEpCX,SACP,IAAI3uB,MAAMqkB,GAAS2G,SAGtBuE,WAAY,GAgKrB,SAASC,GAAU73C,EAAO+E,OAClB+yC,EAAW,IAAIT,GAAQtyC;IAE7B+yC,EAASh1C,KAAK9C,GAAO,GAGjB83C,EAASrwB,UAAaqwB,EAASzI,KAAO3C,GAASoL,EAASrwB,YAErDqwB,EAAS3wC,OA9IlBkwC,GAAQhyC,UAAUvC,KAAO,SAAUsF,EAAM2vC,OAGnC1E,EAAQ2E,EAFNjN,EAAOrtC,KAAKqtC,KACZuM,EAAY55C,KAAKqH,QAAQuyC,aAG3B55C,KAAKg6C,aAAgB,MAEQM,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBhB,GAAaF,GAGlC,iBAATzuC,EAET2iC,EAAK/qC,MAAQm2C,GAAmB/tC,GACC,yBAAxBlJ,GAASV,KAAK4J,GACvB2iC,EAAK/qC,MAAQ,IAAI65B,WAAWzxB,GAE5B2iC,EAAK/qC,MAAQoI,EAGf2iC,EAAK6G,QAAU,EACf7G,EAAK4G,SAAW5G,EAAK/qC,MAAM6F,YAGF,IAAnBklC,EAAK4E,YACP5E,EAAKva,OAAS,IAAIqJ,WAAWyd,GAC7BvM,EAAK8E,SAAW,EAChB9E,EAAK4E,UAAY2H,IAIdU,IAAgBlL,IAAgBkL,IAAgBlB,KAAmB/L,EAAK4E,WAAa,OACnFsI,OAAOlN,EAAKva,OAAOyZ,SAAS,EAAGc,EAAK8E;AACzC9E,EAAK4E,UAAY,WAInB0D,EAASe,GAAUG,QAAQxJ,EAAMiN,MAGlBf,UACTlM,EAAK8E,SAAW,QACboI,OAAOlN,EAAKva,OAAOyZ,SAAS,EAAGc,EAAK8E,WAE3CwD,EAASe,GAAUc,WAAWx3C,KAAKqtC,WAC9BmN,MAAM7E,QACNqE,OAAQ,EACNrE,IAAW2D,MAIG,IAAnBjM,EAAK4E,cAMLqI,EAAc,GAAKjN,EAAK8E,SAAW,OAChCoI,OAAOlN,EAAKva,OAAOyZ,SAAS,EAAGc,EAAK8E,WACzC9E,EAAK4E,UAAY,UAIG,IAAlB5E,EAAK4G,SAAgB,gBAXlBsG,OAAOlN,EAAKva,eAcd,GAWT6mB,GAAQhyC,UAAU4yC,OAAS,SAAUnC,QAC9BF,OAAO9yC,KAAKgzC,IAanBuB,GAAQhyC,UAAU6yC,MAAQ,SAAU7E,GAE9BA,IAAW2D,UACR7vC,OAAS2uB,GAAqBp4B,KAAKk4C,cAErCA,OAAS,QACTnuB,IAAM4rB;KACNhE,IAAM3xC,KAAKqtC,KAAKsE,KA8EvB,IAMI8I,GAAc,CACjBd,QAPeA,GAQf9C,QAPiBsD,GAQjBO,WA/BD,SAAoBp4C,EAAO+E,UACzBA,EAAUA,GAAW,IACbyyC,KAAM,EACPK,GAAU73C,EAAO+E,IA6BzB0yC,KAjBD,SAAcz3C,EAAO+E,UACnBA,EAAUA,GAAW,IACb0yC,MAAO,EACRI,GAAU73C,EAAO+E,IAezB4nC,UAPiBA,IAoEd0L,GAAU,SAAsBtN,EAAMrkB,OACpC4xB,EACA94B,EACA+4B,EACA/D,EACA7tB,EAEA6xB,EAEAC,EACAC,EACAC,EAEAC,EACAC,EACA9R,EACA+R,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAnlB,EACAiS,EACAlpB,EACAq8B,EAGAp5C,EAAOwwB,EAGLzsB,EAAQgnC,EAAKhnC,MAEnBu0C,EAAMvN,EAAK6G,QACX5xC,EAAQ+qC,EAAK/qC,MACbwf,EAAO84B,GAAOvN,EAAK4G,SAAW,GAC9B4G,EAAOxN,EAAK8E,SACZrf,EAASua,EAAKva,OACdgkB,EAAM+D,GAAQ7xB,EAAQqkB,EAAK4E,WAC3BhpB,EAAM4xB,GAAQxN,EAAK4E,UAAY,KAE/B6I,EAAOz0C,EAAMy0C,KAEbC,EAAQ10C,EAAM00C,MACdC,EAAQ30C,EAAM20C,MACdC,EAAQ50C,EAAM40C,MACdC,EAAW70C,EAAMvG,OACjBq7C,EAAO90C,EAAM80C,KACb9R,EAAOhjC,EAAMgjC,KACb+R,EAAQ/0C,EAAMs1C,QACdN,EAAQh1C,EAAMu1C,SACdN,GAAS,GAAKj1C,EAAMw1C,SAAW,EAC/BN,GAAS,GAAKl1C,EAAMy1C,UAAY,EAMhCC,EACA,EAAG;AACG1S,EAAO,KACT8R,GAAQ74C,EAAMs4C,MAAUvR,EACxBA,GAAQ,EACR8R,GAAQ74C,EAAMs4C,MAAUvR,EACxBA,GAAQ,GAGVmS,EAAOJ,EAAMD,EAAOG,GAEpBU,EACA,OAAS,IAEPb,KADAM,EAAKD,IAAS,GAEdnS,GAAQoS,EAEG,KADXA,EAAMD,IAAS,GAAM,KAKnB1oB,EAAO+nB,KAAiB,MAAPW,MAEd,CAAA,KAAS,GAALC,GAwKJ,CAAA,GAAkB,IAAR,GAALA,GAAgB,CACxBD,EAAOJ,GAAc,MAAPI,IAA8BL,GAAS,GAAKM,GAAM,aACvDO,EAEN,GAAS,GAALP,EAAS,CAEhBp1C,EAAMf,KArSD,SAsSCy2C,EAGN1O,EAAKsE,IAAM,8BACXtrC,EAAMf,KA3SF,SA4SEy2C,EAnLNzlB,EAAa,MAAPklB,GACNC,GAAM,MAEApS,EAAOoS,IACTN,GAAQ74C,EAAMs4C,MAAUvR,EACxBA,GAAQ,GAEV/S,GAAO6kB,GAAS,GAAKM,GAAM,EAC3BN,KAAUM,EACVpS,GAAQoS,GAGNpS,EAAO,KACT8R,GAAQ74C,EAAMs4C,MAAUvR,EACxBA,GAAQ,EACR8R,GAAQ74C,EAAMs4C,MAAUvR,EACxBA,GAAQ,GAEVmS,EAAOH,EAAMF,EAAOI,GAEpBU,EACA,OAAS,IAEPd,KADAM,EAAKD,IAAS,GAEdnS,GAAQoS,IAGC,IAFTA,EAAMD,IAAS,GAAM,MAiIhB,CAAA,GAAkB,IAAR,GAALC,GAAgB,CACxBD,EAAOH,GAAc,MAAPG,IAA8BL,GAAS,GAAKM,GAAM;UACvDQ,EAGT5O,EAAKsE,IAAM,wBACXtrC,EAAMf,KAzRN,SA0RMy2C,KArINxT,EAAc,MAAPiT,EAEHnS,GADJoS,GAAM,MAEJN,GAAQ74C,EAAMs4C,MAAUvR,GACxBA,GAAQ,GACGoS,IACTN,GAAQ74C,EAAMs4C,MAAUvR,EACxBA,GAAQ,KAGZd,GAAQ4S,GAAS,GAAKM,GAAM,GAEjBX,EAAM,CACfzN,EAAKsE,IAAM,gCACXtrC,EAAMf,KAnKR,SAoKQy2C,KAGRZ,KAAUM,EACVpS,GAAQoS,EAGJlT,GADJkT,EAAKZ,EAAO/D,GACG,KACb2E,EAAKlT,EAAOkT,GACHT,GACH30C,EAAM61C,KAAM,CACd7O,EAAKsE,IAAM,gCACXtrC,EAAMf,KAhLZ,SAiLYy2C,KAyBV18B,EAAO,EACPq8B,EAAcR,EACA,IAAVD,MACF57B,GAAQ07B,EAAQU,EACZA,EAAKnlB,EAAK,CACZA,GAAOmlB,KAEL3oB,EAAO+nB,KAAUK,EAAS77B,aACjBo8B,GACXp8B,EAAOw7B,EAAOtS,EACdmT,EAAc5oB,QAGb,GAAImoB,EAAQQ,MACfp8B,GAAQ07B,EAAQE,EAAQQ,GACxBA,GAAMR,GACG3kB,EAAK,CACZA,GAAOmlB,KAEL3oB,EAAO+nB,KAAUK,EAAS77B,aACjBo8B,MACXp8B,EAAO,EACH47B,EAAQ3kB,EAAK,CAEfA,GADAmlB,EAAKR,KAGHnoB,EAAO+nB,KAAUK,EAAS77B,aACjBo8B;CACXp8B,EAAOw7B,EAAOtS,EACdmT,EAAc5oB,YAKlBzT,GAAQ47B,EAAQQ,EACZA,EAAKnlB,EAAK,CACZA,GAAOmlB,KAEL3oB,EAAO+nB,KAAUK,EAAS77B,aACjBo8B,GACXp8B,EAAOw7B,EAAOtS,EACdmT,EAAc5oB,OAGXwD,EAAM,GACXxD,EAAO+nB,KAAUa,EAAYr8B,KAC7ByT,EAAO+nB,KAAUa,EAAYr8B,KAC7ByT,EAAO+nB,KAAUa,EAAYr8B,KAC7BiX,GAAO,EAELA,IACFxD,EAAO+nB,KAAUa,EAAYr8B,KACzBiX,EAAM,IACRxD,EAAO+nB,KAAUa,EAAYr8B,WAI9B,CACHA,EAAOw7B,EAAOtS,KAEZzV,EAAO+nB,KAAU/nB,EAAOzT,KACxByT,EAAO+nB,KAAU/nB,EAAOzT,KACxByT,EAAO+nB,KAAU/nB,EAAOzT,KACxBiX,GAAO,QACAA,EAAM,GACXA,IACFxD,EAAO+nB,KAAU/nB,EAAOzT,KACpBiX,EAAM,IACRxD,EAAO+nB,KAAU/nB,EAAOzT,2BAmC/Bu7B,EAAM94B,GAAQ+4B,EAAO5xB,GAI9B2xB,GADAtkB,EAAM+S,GAAQ,EAGd8R,IAAS,IADT9R,GAAQ/S,GAAO,IACO,EAGtB+W,EAAK6G,QAAU0G,EACfvN,EAAK8E,SAAW0I,EAChBxN,EAAK4G,SAAY2G,EAAM94B,EAAYA,EAAO84B,EAAZ,EAAmB,GAAKA,EAAM94B,GAC5DurB,EAAK4E,UAAa4I,EAAO5xB,EAAaA,EAAM4xB,EAAb,IAAqB,KAAOA,EAAO5xB,GAClE5iB,EAAM80C,KAAOA,EACb90C,EAAMgjC,KAAOA;EAuBT8S,GAAU,GASVC,GAAQ,IAAI/f,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,IAGzDggB,GAAO,IAAIlgB,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAGpDmgB,GAAQ,IAAIjgB,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,IAG1BkgB,GAAO,IAAIpgB,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,KAsSlBqgB,GAnSkB,SAACx1C,EAAMy1C,EAAMC,EAAYC,EAAOhO,EAAOiO,EAAaC,EAAMC;IAc1EC,EACAC,EACAC,EACAC,EACAnlC,EAIAkR,EAMAk0B,EAAWC,EAASC,EA1BlBhU,EAAOyT,EAAKzT,KAGd/S,EAAM,EACN/gB,EAAM,EACN/M,EAAM,EAAGE,EAAM,EACf40C,EAAO,EACPC,EAAO,EACPC,EAAO,EACPrY,EAAO,EACPsY,EAAO,EACPC,EAAO,EAMPpS,EAAO,KACPqS,EAAa,EAGXxd,EAAQ,IAAI9D,YAAY8f,IACxByB,EAAO,IAAIvhB,YAAY8f,IACzBtR,EAAQ,KACRgT,EAAc,MAoCbvnB,EAAM,EAAGA,GAAO6lB,GAAS7lB,IAC5B6J,EAAM7J,GAAO,MAEV/gB,EAAM,EAAGA,EAAMonC,EAAOpnC,IACzB4qB,EAAMsc,EAAKC,EAAannC,UAI1B+nC,EAAOjU,EACF3gC,EAAMyzC,GAASzzC,GAAO,GACN,IAAfy3B,EAAMz3B,GADkBA,QAG1B40C,EAAO50C,IACT40C,EAAO50C,GAEG,IAARA,SAIFimC,EAAMiO,KAAkB,SAMxBjO,EAAMiO,KAAkB,SAExBE,EAAKzT,KAAO,EACL,MAEJ7gC,EAAM,EAAGA,EAAME,GACC,IAAfy3B,EAAM33B,GADaA,SAGrB80C,EAAO90C,IACT80C,EAAO90C,GAIT28B,EAAO,EACF7O,EAAM,EAAGA,GAAO6lB,GAAS7lB,OAC5B6O,IAAS,GACTA,GAAQhF,EAAM7J,IACH,SACD,KAGR6O,EAAO,IAtIC,IAsIKn+B,GAA0B,IAAR0B,UACzB,MAIVk1C,EAAK,GAAK,EACLtnB,EAAM,EAAGA,EAAM6lB,GAAS7lB,IAC3BsnB,EAAKtnB,EAAM,GAAKsnB,EAAKtnB,GAAO6J,EAAM7J;KAI/B/gB,EAAM,EAAGA,EAAMonC,EAAOpnC,IACM,IAA3BknC,EAAKC,EAAannC,KACpBsnC,EAAKe,EAAKnB,EAAKC,EAAannC,OAAWA,MAnJ/B,IAyLRvO,GACFskC,EAAOT,EAAQgS,EACf5zB,EAAM,IA1LG,IA4LAjiB,GACTskC,EAAO8Q,GACPuB,GAAc,IACd9S,EAAQwR,GACRwB,GAAe,IACf50B,EAAM,MAGNqiB,EAAOgR,GACPzR,EAAQ0R,GACRtzB,GAAO,GAITy0B,EAAO,EACPnoC,EAAM,EACN+gB,EAAM9tB,EACNuP,EAAO6kC,EACPW,EAAOD,EACPE,EAAO,EACPP,GAAO,EAEPC,GADAO,EAAO,GAAKH,GACE,EAlNH,IAqNNt2C,GAAiBy2C,EA1NJ,KAMN,IAqNTz2C,GAAkBy2C,EA1NF,WA2NV,SAIA,CAEPN,EAAY7mB,EAAMknB,EACdX,EAAKtnC,GAAO0T,GACdm0B,EAAU,EACVC,EAAWR,EAAKtnC,IAETsnC,EAAKtnC,GAAO0T,GACnBm0B,EAAUvS,EAAMgT,EAAchB,EAAKtnC,IACnC8nC,EAAW/R,EAAKqS,EAAad,EAAKtnC,MAGlC6nC,EAAU,GACVC,EAAW,GAIbN,EAAO,GAAMzmB,EAAMknB,EAEnBh1C,EADAw0C,EAAO,GAAKO,KAIV5O,EAAM52B,GAAQ2lC,GAAQF,IADtBR,GAAQD,IAC+BI,GAAa,GAAOC,GAAW,GAAMC,EAAU,QACtE,IAATL,OAGTD,EAAO,GAAMzmB,EAAM,EACZonB,EAAOX,GACZA,IAAS,KAEE,IAATA,GACFW,GAAQX,EAAO,EACfW,GAAQX,GAERW,EAAO,EAITnoC,IACqB,KAAf4qB,EAAM7J,GAAY,IAClBA,IAAQ5tB,QACZ4tB,EAAMmmB,EAAKC,EAAaG,EAAKtnC,OAI3B+gB,EAAMgnB,IAASI,EAAOR,KAAUD,EAAK,KAE1B,IAATO,IACFA,EAAOF,GAITvlC,GAAQvP;AAIR28B,EAAO,IADPoY,EAAOjnB,EAAMknB,GAEND,EAAOC,EAAO90C,MACnBy8B,GAAQhF,EAAMod,EAAOC,KACT,IACZD,IACApY,IAAS,KAIXsY,GAAQ,GAAKF,EA5RN,IA6RFv2C,GAAiBy2C,EAlSR,KAMN,IA6RLz2C,GAAkBy2C,EAlSN,WAmSN,EAQT9O,EAJAsO,EAAMS,EAAOR,GAICI,GAAQ,GAAOC,GAAQ,GAAOxlC,EAAO6kC,EAAc,UAOxD,IAATc,IAIF/O,EAAM52B,EAAO2lC,GAAUpnB,EAAMknB,GAAS,GAAO,IAAM,GAAK,GAK1DV,EAAKzT,KAAOiU,EACL,GAsCGQ,GAGR7O,GAHFK,SAA+ByO,GAG7B9O,GAHoBM,QAAoBC,GAGxCP,GAHwCO,QACpCwO,GAEJ/O,GAFFQ,KAA4BwO,GAE1BhP,GAFYS,aAA8BC,GAE1CV,GAF0CU,YAA6BuO,GAEvEjP,GAFuDY,eAAgDsO,GAEvGlP,GAFyFa,aAA8BC,GAEvHd,GAFuHc,YAA0BqO,GAEjJnP,GAFoIe,YAC1HqO,GACVpP,GADF4B,WAmBWyN,GAAS,GAkBbC,GAAQ,GAiBXC,GAAU,SAACnrB,UAEJA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,KAIzB,SAASorB,UACFn5C,KAAO,OACPwc,MAAO;KACPlN,KAAO,OACP8pC,UAAW,OACX72B,MAAQ,OACRizB,KAAO,OACPr7C,MAAQ,OACRk/C,MAAQ,OAER98B,KAAO,UAGP+8B,MAAQ,OACR7D,MAAQ,OACRC,MAAQ,OACRC,MAAQ,OACRn7C,OAAS,UAGTq7C,KAAO,OACP9R,KAAO,OAGPlhC,OAAS,OACT64B,OAAS,OAGT6J,MAAQ,OAGR8Q,QAAU,UACVC,SAAW,UACXC,QAAU,OACVC,SAAW,OAGX+C,MAAQ,OACRC,KAAO,OACPC,MAAQ,OACRC,KAAO,OACPjnC,KAAO,UAEP0kC,KAAO,IAAIpgB,YAAY,UACvBwgB,KAAO,IAAIxgB,YAAY,UAOvB4iB,OAAS,UACTC,QAAU,UACVhD,KAAO,OACPiD,KAAO,OACPC,IAAM;AAIb,IA8GIC,GAAQC,GA9GNC,GAAmB,SAAClS,OAEnBA,IAASA,EAAKhnC,aAAgB63C,OAC7B73C,EAAQgnC,EAAKhnC,aACnBgnC,EAAK8G,SAAW9G,EAAK+E,UAAY/rC,EAAMs4C,MAAQ,EAC/CtR,EAAKsE,IAAM,GACPtrC,EAAMuO,OACRy4B,EAAKkB,MAAqB,EAAbloC,EAAMuO,MAErBvO,EAAMf,KA3HQ,EA4Hde,EAAMyb,KAAO,EACbzb,EAAMq4C,SAAW,EACjBr4C,EAAMy0C,KAAO,MACbz0C,EAAMwb,KAAO,KACbxb,EAAM80C,KAAO,EACb90C,EAAMgjC,KAAO,EAEbhjC,EAAMs1C,QAAUt1C,EAAM44C,OAAS,IAAI3iB,WA9Ff,KA+FpBj2B,EAAMu1C,SAAWv1C,EAAM64C,QAAU,IAAI5iB,WA9FhB,KAgGrBj2B,EAAM61C,KAAO,EACb71C,EAAM84C,MAAQ,EAEPnB,IAIHwB,GAAe,SAACnS,OAEfA,IAASA,EAAKhnC,aAAgB63C,OAC7B73C,EAAQgnC,EAAKhnC,aACnBA,EAAM00C,MAAQ,EACd10C,EAAM20C,MAAQ,EACd30C,EAAM40C,MAAQ,EACPsE,GAAiBlS,IAKpBoS,GAAgB,SAACpS,EAAMmJ,OACvB5hC,MAGCy4B,IAASA,EAAKhnC,aAAgB63C,OAC7B73C,EAAQgnC,EAAKhnC,aAGfmwC,EAAa,GACf5hC,EAAO;AACP4hC,GAAcA,IAGd5hC,EAA2B,GAAnB4hC,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzC0H,IAEY,OAAjB73C,EAAMvG,QAAmBuG,EAAMu4C,QAAUpI,IAC3CnwC,EAAMvG,OAAS,MAIjBuG,EAAMuO,KAAOA,EACbvO,EAAMu4C,MAAQpI,EACPgJ,GAAanS,KAIhBqS,GAAe,SAACrS,EAAMmJ,OAErBnJ,SAAe6Q,OAGd73C,EAAQ,IAAIo4C,GAIlBpR,EAAKhnC,MAAQA,EACbA,EAAMvG,OAAS,SACTu2C,EAAMoJ,GAAcpS,EAAMmJ,UAC5BH,IAAQ2H,KACV3Q,EAAKhnC,MAAQ,MAERgwC,GAoBLsJ,IAAS,EAKPC,GAAc,SAACv5C,MAGfs5C,GAAQ,CACVN,GAAS,IAAI/iB,WAAW,KACxBgjB,GAAU,IAAIhjB,WAAW,YAGrB/mB,EAAM,EACHA,EAAM,KAAOlP,EAAMo2C,KAAKlnC,KAAS,OACjCA,EAAM,KAAOlP,EAAMo2C,KAAKlnC,KAAS,OACjCA,EAAM,KAAOlP,EAAMo2C,KAAKlnC,KAAS,OACjCA,EAAM,KAAOlP,EAAMo2C,KAAKlnC,KAAS,MAExCinC,GAlQW,EAkQOn2C,EAAMo2C,KAAM,EAAG,IAAK4C,GAAU,EAAGh5C,EAAMw2C,KAAM,CAAExT,KAAM,IAGvE9zB,EAAM,EACCA,EAAM,IAAMlP,EAAMo2C,KAAKlnC,KAAS;CAEvCinC,GAvQY,EAuQMn2C,EAAMo2C,KAAM,EAAG,GAAM6C,GAAS,EAAGj5C,EAAMw2C,KAAM,CAAExT,KAAM,IAGvEsW,IAAS,EAGXt5C,EAAMs1C,QAAU0D,GAChBh5C,EAAMw1C,QAAU,EAChBx1C,EAAMu1C,SAAW0D,GACjBj5C,EAAMy1C,SAAW,GAkBb+D,GAAe,SAACxS,EAAMl/B,EAAK8a,EAAK62B,OAEhCvX,EACEliC,EAAQgnC,EAAKhnC,aAGE,OAAjBA,EAAMvG,SACRuG,EAAM00C,MAAQ,GAAK10C,EAAMu4C,MACzBv4C,EAAM40C,MAAQ,EACd50C,EAAM20C,MAAQ,EAEd30C,EAAMvG,OAAS,IAAIq8B,WAAW91B,EAAM00C,QAIlC+E,GAAQz5C,EAAM00C,OAChB10C,EAAMvG,OAAO0F,IAAI2I,EAAIo+B,SAAStjB,EAAM5iB,EAAM00C,MAAO9xB,GAAM,GACvD5iB,EAAM40C,MAAQ,EACd50C,EAAM20C,MAAQ30C,EAAM00C,SAGpBxS,EAAOliC,EAAM00C,MAAQ10C,EAAM40C,OAChB6E,IACTvX,EAAOuX,GAGTz5C,EAAMvG,OAAO0F,IAAI2I,EAAIo+B,SAAStjB,EAAM62B,EAAM72B,EAAM62B,EAAOvX,GAAOliC,EAAM40C,QACpE6E,GAAQvX,IAGNliC,EAAMvG,OAAO0F,IAAI2I,EAAIo+B,SAAStjB,EAAM62B,EAAM72B,GAAM,GAChD5iB,EAAM40C,MAAQ6E,EACdz5C,EAAM20C,MAAQ30C,EAAM00C,QAGpB10C,EAAM40C,OAAS1S,EACXliC,EAAM40C,QAAU50C,EAAM00C,QAAS10C,EAAM40C,MAAQ;AAC7C50C,EAAM20C,MAAQ30C,EAAM00C,QAAS10C,EAAM20C,OAASzS,KAG7C,GAmqCLwX,GAAY,CACfP,aAtBoBA,GAuBpBC,cAtBqBA,GAuBrBF,iBAtBwBA,GAuBxBS,YAnxCmB,SAAC3S,UAEZqS,GAAarS,EAvKF,KAy7CnBqS,aAtBoBA,GAuBpBO,QArqCe,SAAC5S,EAAMzrB,OAEjBvb,EACA/D,EAAOwwB,EACP/a,EACAmoC,EACAlB,EAAM7Z,EACNgW,EACA9R,EACAuR,EAAKC,EACLiF,EACAzgC,EACAq8B,EAEAyB,EAAWC,EAASC,EAEpB8C,EAAWC,EAASC,EACpB/pB,EACA+f,EAEAyG,EAEA5zB,EATAsyB,EAAO,EAML8E,EAAO,IAAInkB,WAAW,GAKtBokB,MACApkB,WAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,SAG5EkR,IAASA,EAAKhnC,QAAUgnC,EAAKva,SAC5Bua,EAAK/qC,OAA2B,IAAlB+qC,EAAK4G,gBAChBiK,IAGT73C,EAAQgnC,EAAKhnC,OACHf,OAASg5C,KAAUj4C,EAAMf,KApVf,IAwVpB46C,EAAM7S,EAAK8E,SACXrf,EAASua,EAAKva,OACdqS,EAAOkI,EAAK4E,UACZl6B,EAAOs1B,EAAK6G,QACZ5xC,EAAQ+qC,EAAK/qC,MACb08C,EAAO3R,EAAK4G,SACZkH,EAAO90C,EAAM80C;AACb9R,EAAOhjC,EAAMgjC,KAGbuR,EAAMoE,EACNnE,EAAO1V,EACPkR,EAAM2H,GAENwC,gBAEUn6C,EAAMf,WApXF,KAsXW,IAAfe,EAAMuO,KAAY,CACpBvO,EAAMf,KA3WM,cA+WP+jC,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGQ,EAAbhjC,EAAMuO,MAAsB,QAATumC,EAAiB,CACvC90C,EAAM5G,MAAQ,EAEd6gD,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzB90C,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6gD,EAAM,EAAG,GAI5CnF,EAAO,EACP9R,EAAO,EAEPhjC,EAAMf,KA7YC,WAgZTe,EAAMwhB,MAAQ,EACVxhB,EAAMwb,OACRxb,EAAMwb,KAAK/H,MAAO,KAED,EAAbzT,EAAMuO,UACA,IAAPumC,QAAiCA,GAAQ,IAAM,GAAI,CACtD9N,EAAKsE,IAAM,yBACXtrC,EAAMf,KAAOi5C,aAGH,GAAPpD,KAA4BkD,GAAc,CAC7ChR,EAAKsE,IAAM,6BACXtrC,EAAMf,KAAOi5C,YAKflV,GAAQ,EAER/S,KAAc,IAHd6kB,KAAU;AAIU,IAAhB90C,EAAMu4C,MACRv4C,EAAMu4C,MAAQtoB,OAEX,GAAIA,EAAMjwB,EAAMu4C,MAAO,CAC1BvR,EAAKsE,IAAM,sBACXtrC,EAAMf,KAAOi5C,SAMfl4C,EAAMy0C,KAAO,GAAKz0C,EAAMu4C,MAIxBvR,EAAKkB,MAAQloC,EAAM5G,MAAQ,EAC3B4G,EAAMf,KAAc,IAAP61C,EA5aH,GA4a2BmD,GAErCnD,EAAO,EACP9R,EAAO,aAvbE,OA4bFA,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGVhjC,EAAMwhB,MAAQszB,GACK,IAAd90C,EAAMwhB,SAAkBw2B,GAAc,CACzChR,EAAKsE,IAAM,6BACXtrC,EAAMf,KAAOi5C,YAGG,MAAdl4C,EAAMwhB,MAAgB,CACxBwlB,EAAKsE,IAAM,2BACXtrC,EAAMf,KAAOi5C,SAGXl4C,EAAMwb,OACRxb,EAAMwb,KAAKm1B,KAASmE,GAAQ,EAAK,GAEjB,IAAd90C,EAAMwhB,QAERy4B,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzB90C,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6gD,EAAM,EAAG,IAI9CnF,EAAO,EACP9R,EAAO,EAEPhjC,EAAMf,KA3dE,OAAA,OA+dD+jC,EAAO,IAAI;GACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGNhjC,EAAMwb,OACRxb,EAAMwb,KAAKs1B,KAAOgE,GAEF,IAAd90C,EAAMwhB,QAERy4B,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzBmF,EAAK,GAAMnF,IAAS,GAAM,IAC1BmF,EAAK,GAAMnF,IAAS,GAAM,IAC1B90C,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6gD,EAAM,EAAG,IAI9CnF,EAAO,EACP9R,EAAO,EAEPhjC,EAAMf,KArfA,OAAA,OAyfC+jC,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGNhjC,EAAMwb,OACRxb,EAAMwb,KAAK4+B,OAAiB,IAAPtF,EACrB90C,EAAMwb,KAAKu1B,GAAM+D,GAAQ,GAET,IAAd90C,EAAMwhB,QAERy4B,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzB90C,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6gD,EAAM,EAAG,IAI9CnF,EAAO,EACP9R,EAAO,EAEPhjC,EAAMf,KA9gBG,OAAA,KAihBS,KAAde,EAAMwhB,MAAgB,MAEjBwhB,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGVhjC,EAAM8B,OAASgzC,EACX90C,EAAMwb,OACRxb,EAAMwb,KAAK6+B,UAAYvF;AAEP,IAAd90C,EAAMwhB,QAERy4B,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzB90C,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6gD,EAAM,EAAG,IAI9CnF,EAAO,EACP9R,EAAO,OAGAhjC,EAAMwb,OACbxb,EAAMwb,KAAKgpB,MAAQ,MAErBxkC,EAAMf,KA5iBG,OAAA,KA+iBS,KAAde,EAAMwhB,SACRi4B,EAAOz5C,EAAM8B,QACF62C,IAAQc,EAAOd,GACtBc,IACEz5C,EAAMwb,OACRyU,EAAMjwB,EAAMwb,KAAK6+B,UAAYr6C,EAAM8B,OAC9B9B,EAAMwb,KAAKgpB,QAEdxkC,EAAMwb,KAAKgpB,MAAQ,IAAI1O,WAAW91B,EAAMwb,KAAK6+B,YAE/Cr6C,EAAMwb,KAAKgpB,MAAMrlC,IACflD,EAAMiqC,SACJx0B,EAGAA,EAAO+nC,GAGTxpB,IAMc,IAAdjwB,EAAMwhB,QACRxhB,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6C,EAAOw9C,EAAM/nC,IAElDinC,GAAQc,EACR/nC,GAAQ+nC,EACRz5C,EAAM8B,QAAU23C,GAEdz5C,EAAM8B,cAAgBq4C,EAE5Bn6C,EAAM8B,OAAS,EACf9B,EAAMf,KAhlBE,OAAA,KAmlBU,KAAde,EAAMwhB,MAAgB,IACX,IAATm3B,QAAoBwB,EACxBV,EAAO,KAGLxpB,EAAMh0B,EAAMyV,EAAO+nC;AAEfz5C,EAAMwb,MAAQyU,GACbjwB,EAAM8B,OAAS,QAClB9B,EAAMwb,KAAK3S,MAAQ9K,OAAOk0C,aAAahiB,UAElCA,GAAOwpB,EAAOd,MAEL,IAAd34C,EAAMwhB,QACRxhB,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6C,EAAOw9C,EAAM/nC,IAElDinC,GAAQc,EACR/nC,GAAQ+nC,EACJxpB,QAAakqB,OAEVn6C,EAAMwb,OACbxb,EAAMwb,KAAK3S,KAAO,MAEpB7I,EAAM8B,OAAS,EACf9B,EAAMf,KA1mBK,OAAA,KA6mBO,KAAde,EAAMwhB,MAAgB,IACX,IAATm3B,QAAoBwB,EACxBV,EAAO,KAELxpB,EAAMh0B,EAAMyV,EAAO+nC,KAEfz5C,EAAMwb,MAAQyU,GACbjwB,EAAM8B,OAAS,QAClB9B,EAAMwb,KAAKq1B,SAAW9yC,OAAOk0C,aAAahiB,UAErCA,GAAOwpB,EAAOd,MACL,IAAd34C,EAAMwhB,QACRxhB,EAAM5G,MAAQovC,GAAQxoC,EAAM5G,MAAO6C,EAAOw9C,EAAM/nC,IAElDinC,GAAQc,EACR/nC,GAAQ+nC,EACJxpB,QAAakqB,OAEVn6C,EAAMwb,OACbxb,EAAMwb,KAAKq1B,QAAU,MAEvB7wC,EAAMf,KAjoBE,OAAA,KAooBU,IAAde,EAAMwhB,MAAgB,MAEjBwhB,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB;AACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGN8R,KAAwB,MAAd90C,EAAM5G,OAAiB,CACnC4tC,EAAKsE,IAAM,sBACXtrC,EAAMf,KAAOi5C,SAIfpD,EAAO,EACP9R,EAAO,EAGLhjC,EAAMwb,OACRxb,EAAMwb,KAAKo1B,KAAS5wC,EAAMwhB,OAAS,EAAK,EACxCxhB,EAAMwb,KAAK/H,MAAO,GAEpBuzB,EAAKkB,MAAQloC,EAAM5G,MAAQ,EAC3B4G,EAAMf,KAAOg5C,cA3pBH,QA+pBHjV,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGVgE,EAAKkB,MAAQloC,EAAM5G,MAAQ++C,GAAQrD,GAEnCA,EAAO,EACP9R,EAAO,EAEPhjC,EAAMf,KA1qBE,QAAA,MA6qBe,IAAnBe,EAAMq4C,gBAERrR,EAAK8E,SAAW+N,EAChB7S,EAAK4E,UAAY9M,EACjBkI,EAAK6G,QAAUn8B,EACfs1B,EAAK4G,SAAW+K,EAChB34C,EAAM80C,KAAOA,EACb90C,EAAMgjC,KAAOA,EAENsG,GAETtC,EAAKkB,MAAQloC,EAAM5G,MAAQ,EAC3B4G,EAAMf,KAAOg5C,QAEVA,MACC18B,IAAUm8B,IAAan8B,IAAU4tB,SAAiBgR,OA1rBxC,MA6rBVn6C,EAAMyb,KAAM,CAEdq5B,KAAiB,EAAP9R,EACVA,GAAe,EAAPA,EAERhjC,EAAMf,KAprBC;KAwrBF+jC,EAAO,GAAG,IACF,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,SAGVhjC,EAAMyb,KAAe,EAAPq5B,EAGd9R,GAAQ,EAGQ,GAJhB8R,KAAU,SAKH,EAGH90C,EAAMf,KAttBI,cAwtBP,KACHs6C,GAAYv5C,GAGZA,EAAMf,KAttBM,GAutBRsc,IAAU4tB,GAAS,CAErB2L,KAAU,EACV9R,GAAQ,QAEFmX,aAGL,EAGHn6C,EAAMf,KAruBG,cAuuBN,EACH+nC,EAAKsE,IAAM,qBACXtrC,EAAMf,KAAOi5C,GAGjBpD,KAAU,EACV9R,GAAQ,aAhvBM,OAqvBd8R,KAAiB,EAAP9R,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,MAGE,MAAP8R,KAAqBA,IAAS,GAAM,OAAS,CAChD9N,EAAKsE,IAAM,+BACXtrC,EAAMf,KAAOi5C,YAGfl4C,EAAM8B,OAAgB,MAAPgzC,EAIfA,EAAO,EACP9R,EAAO,EAEPhjC,EAAMf,KA3wBO,GA4wBTsc,IAAU4tB,SAAiBgR,OA5wBlB,GA+wBbn6C,EAAMf,KA9wBM,QAAA;GAixBZw6C,EAAOz5C,EAAM8B,OACH,IACJ23C,EAAOd,IAAQc,EAAOd,GACtBc,EAAO3a,IAAQ2a,EAAO3a,GACb,IAAT2a,QAAoBU,EAExB1tB,EAAOttB,IAAIlD,EAAMiqC,SAASx0B,EAAMA,EAAO+nC,GAAOI,GAE9ClB,GAAQc,EACR/nC,GAAQ+nC,EACR3a,GAAQ2a,EACRI,GAAOJ,EACPz5C,EAAM8B,QAAU23C,QAIlBz5C,EAAMf,KAAOg5C,cAhyBA,QAoyBNjV,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGVhjC,EAAMy4C,UAAe,GAAP3D,GAEdA,KAAU,EACV9R,GAAQ,EAERhjC,EAAM04C,SAAgB,GAAP5D,GAEfA,KAAU,EACV9R,GAAQ,EAERhjC,EAAMw4C,SAAgB,GAAP1D,GAEfA,KAAU,EACV9R,GAAQ,EAGJhjC,EAAMy4C,KAAO,KAAOz4C,EAAM04C,MAAQ,GAAI,CACxC1R,EAAKsE,IAAM,sCACXtrC,EAAMf,KAAOi5C,SAKfl4C,EAAM24C,KAAO,EACb34C,EAAMf,KAl0BS,QAAA,QAq0BRe,EAAM24C,KAAO34C,EAAMw4C,OAAO,MAExBxV,EAAO,GAAG,IACF,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGVhjC,EAAMo2C,KAAK8D,EAAMl6C,EAAM24C,SAAmB,EAAP7D,EAEnCA,KAAU;AACV9R,GAAQ,OAGHhjC,EAAM24C,KAAO,IAClB34C,EAAMo2C,KAAK8D,EAAMl6C,EAAM24C,SAAW,KAMpC34C,EAAMs1C,QAAUt1C,EAAM44C,OACtB54C,EAAMw1C,QAAU,EAEhBiB,EAAO,CAAEzT,KAAMhjC,EAAMw1C,SACrBxF,EAAMmG,GAl4BE,EAk4BgBn2C,EAAMo2C,KAAM,EAAG,GAAIp2C,EAAMs1C,QAAS,EAAGt1C,EAAMw2C,KAAMC,GACzEz2C,EAAMw1C,QAAUiB,EAAKzT,KAEjBgN,EAAK,CACPhJ,EAAKsE,IAAM,2BACXtrC,EAAMf,KAAOi5C,SAIfl4C,EAAM24C,KAAO,EACb34C,EAAMf,KAx2BU,QAAA,QA22BTe,EAAM24C,KAAO34C,EAAMy4C,KAAOz4C,EAAM04C,OAAO,MAI1C3B,GAFA5B,EAAOn1C,EAAMs1C,QAAQR,GAAS,GAAK90C,EAAMw1C,SAAW,MAEhC,GAAM,IAC1BwB,EAAkB,MAAP7B,KAFX2B,EAAY3B,IAAS,KAIFnS,IANZ,IAQM,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGNgU,EAAW,GAEblC,KAAUgC,EACV9T,GAAQ8T,EAER92C,EAAMo2C,KAAKp2C,EAAM24C,QAAU3B,MAExB,IACc,KAAbA,EAAiB,KAEnBn0B,EAAIi0B,EAAY,EACT9T,EAAOngB,GAAG,IACF,IAAT81B,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAIV8R,KAAUgC;AACV9T,GAAQ8T,EAEW,IAAf92C,EAAM24C,KAAY,CACpB3R,EAAKsE,IAAM,4BACXtrC,EAAMf,KAAOi5C,SAGfjoB,EAAMjwB,EAAMo2C,KAAKp2C,EAAM24C,KAAO,GAC9Bc,EAAO,GAAY,EAAP3E,GAEZA,KAAU,EACV9R,GAAQ,OAGL,GAAiB,KAAbgU,EAAiB,KAExBn0B,EAAIi0B,EAAY,EACT9T,EAAOngB,GAAG,IACF,IAAT81B,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAKVA,GAAQ8T,EAER7mB,EAAM,EACNwpB,EAAO,GAAY,GAJnB3E,KAAUgC,IAMVhC,KAAU,EACV9R,GAAQ,MAGL,KAEHngB,EAAIi0B,EAAY,EACT9T,EAAOngB,GAAG,IACF,IAAT81B,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAKVA,GAAQ8T,EAER7mB,EAAM,EACNwpB,EAAO,IAAa,KAJpB3E,KAAUgC,IAMVhC,KAAU,EACV9R,GAAQ,KAGNhjC,EAAM24C,KAAOc,EAAOz5C,EAAMy4C,KAAOz4C,EAAM04C,MAAO,CAChD1R,EAAKsE,IAAM,4BACXtrC,EAAMf,KAAOi5C,cAGRuB,KACLz5C,EAAMo2C,KAAKp2C,EAAM24C,QAAU1oB,MAM7BjwB,EAAMf,OAASi5C,YAGK,IAApBl4C,EAAMo2C,KAAK,KAAY;AACzBpP,EAAKsE,IAAM,uCACXtrC,EAAMf,KAAOi5C,YAOfl4C,EAAMw1C,QAAU,EAEhBiB,EAAO,CAAEzT,KAAMhjC,EAAMw1C,SACrBxF,EAAMmG,GApgCC,EAogCgBn2C,EAAMo2C,KAAM,EAAGp2C,EAAMy4C,KAAMz4C,EAAMs1C,QAAS,EAAGt1C,EAAMw2C,KAAMC,GAGhFz2C,EAAMw1C,QAAUiB,EAAKzT,KAGjBgN,EAAK,CACPhJ,EAAKsE,IAAM,8BACXtrC,EAAMf,KAAOi5C,YAIfl4C,EAAMy1C,SAAW,EAGjBz1C,EAAMu1C,SAAWv1C,EAAM64C,QACvBpC,EAAO,CAAEzT,KAAMhjC,EAAMy1C,UACrBzF,EAAMmG,GAphCE,EAohCgBn2C,EAAMo2C,KAAMp2C,EAAMy4C,KAAMz4C,EAAM04C,MAAO14C,EAAMu1C,SAAU,EAAGv1C,EAAMw2C,KAAMC,GAG5Fz2C,EAAMy1C,SAAWgB,EAAKzT,KAGlBgN,EAAK,CACPhJ,EAAKsE,IAAM,wBACXtrC,EAAMf,KAAOi5C,YAIfl4C,EAAMf,KA7/BU,GA8/BZsc,IAAU4tB,SAAiBgR,OA9/Bf,GAigChBn6C,EAAMf,KAhgCS,QAAA,MAmgCX05C,GAAQ,GAAK7Z,GAAQ,IAAK,CAE5BkI,EAAK8E,SAAW+N,EAChB7S,EAAK4E,UAAY9M,EACjBkI,EAAK6G,QAAUn8B;AACfs1B,EAAK4G,SAAW+K,EAChB34C,EAAM80C,KAAOA,EACb90C,EAAMgjC,KAAOA,EAEbsR,GAAQtN,EAAMwN,GAEdqF,EAAM7S,EAAK8E,SACXrf,EAASua,EAAKva,OACdqS,EAAOkI,EAAK4E,UACZl6B,EAAOs1B,EAAK6G,QACZ5xC,EAAQ+qC,EAAK/qC,MACb08C,EAAO3R,EAAK4G,SACZkH,EAAO90C,EAAM80C,KACb9R,EAAOhjC,EAAMgjC,KAGThjC,EAAMf,OAASg5C,KACjBj4C,EAAM84C,MAAQ,aAIlB94C,EAAM84C,KAAO,EAIX/B,GAFA5B,EAAOn1C,EAAMs1C,QAAQR,GAAS,GAAK90C,EAAMw1C,SAAW,MAEhC,GAAM,IAC1BwB,EAAkB,MAAP7B,KAFX2B,EAAY3B,IAAS,KAIJnS,IANV,IAQM,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGN+T,GAAgC,IAAV,IAAVA,GAAuB,KACrC+C,EAAYhD,EACZiD,EAAUhD,EACViD,EAAWhD,EAKTD,GAHA5B,EAAOn1C,EAAMs1C,QAAQ0E,IACXlF,GAAS,GAAMgF,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1B9C,EAAkB,MAAP7B,IAEN2E,GAJLhD,EAAY3B,IAAS,KAIUnS,IAPxB,IASM,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAIV8R,KAAUgF,EACV9W,GAAQ8W,EAER95C,EAAM84C,MAAQgB,KAGhBhF,KAAUgC,EACV9T,GAAQ8T,EAER92C,EAAM84C,MAAQhC,EACd92C,EAAM8B,OAASk1C;AACC,IAAZD,EAAe,CAIjB/2C,EAAMf,KA1kCO,YA6kCD,GAAV83C,EAAc,CAEhB/2C,EAAM84C,MAAQ,EACd94C,EAAMf,KAAOg5C,YAGD,GAAVlB,EAAc,CAChB/P,EAAKsE,IAAM,8BACXtrC,EAAMf,KAAOi5C,SAGfl4C,EAAMwkC,MAAkB,GAAVuS,EACd/2C,EAAMf,KA7lCY,QAAA,MAgmCde,EAAMwkC,MAAO,KAEf3hB,EAAI7iB,EAAMwkC,MACHxB,EAAOngB,GAAG,IACF,IAAT81B,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGVhjC,EAAM8B,QAAUgzC,GAAS,GAAK90C,EAAMwkC,OAAS,EAE7CsQ,KAAU90C,EAAMwkC,MAChBxB,GAAQhjC,EAAMwkC,MAEdxkC,EAAM84C,MAAQ94C,EAAMwkC,MAGtBxkC,EAAM+4C,IAAM/4C,EAAM8B,OAClB9B,EAAMf,KAlnCU,QAAA,QAwnCd83C,GAFA5B,EAAOn1C,EAAMu1C,SAAST,GAAS,GAAK90C,EAAMy1C,UAAY,MAElC,GAAM,IAC1BuB,EAAkB,MAAP7B,KAFX2B,EAAY3B,IAAS,KAIFnS,IANZ,IAQM,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGe,IAAV,IAAV+T,GAAuB,KAC1B+C,EAAYhD,EACZiD,EAAUhD;AACViD,EAAWhD,EAKTD,GAHA5B,EAAOn1C,EAAMu1C,SAASyE,IACZlF,GAAS,GAAMgF,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1B9C,EAAkB,MAAP7B,IAEN2E,GAJLhD,EAAY3B,IAAS,KAIUnS,IAPxB,IASM,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAIV8R,KAAUgF,EACV9W,GAAQ8W,EAER95C,EAAM84C,MAAQgB,KAGhBhF,KAAUgC,EACV9T,GAAQ8T,EAER92C,EAAM84C,MAAQhC,EACA,GAAVC,EAAc,CAChB/P,EAAKsE,IAAM,wBACXtrC,EAAMf,KAAOi5C,SAGfl4C,EAAM26B,OAASqc,EACfh3C,EAAMwkC,MAAoB,GAAXuS,EACf/2C,EAAMf,KAvqCa,QAAA,MA0qCfe,EAAMwkC,MAAO,KAEf3hB,EAAI7iB,EAAMwkC,MACHxB,EAAOngB,GAAG,IACF,IAAT81B,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,EAGVhjC,EAAM26B,QAAUma,GAAS,GAAK90C,EAAMwkC,OAAS,EAE7CsQ,KAAU90C,EAAMwkC,MAChBxB,GAAQhjC,EAAMwkC,MAEdxkC,EAAM84C,MAAQ94C,EAAMwkC,SAGlBxkC,EAAM26B,OAAS36B,EAAMy0C,KAAM,CAC7BzN,EAAKsE,IAAM,gCACXtrC,EAAMf,KAAOi5C,SAKfl4C,EAAMf,KAlsCW,QAAA;GAqsCJ,IAAT6/B,QAAoBqb,KACxBV,EAAOjF,EAAO1V,EACV9+B,EAAM26B,OAAS8e,EAAM,KACvBA,EAAOz5C,EAAM26B,OAAS8e,GACXz5C,EAAM20C,OACX30C,EAAM61C,KAAM,CACd7O,EAAKsE,IAAM,gCACXtrC,EAAMf,KAAOi5C,SAmBbuB,EAAOz5C,EAAM40C,OACf6E,GAAQz5C,EAAM40C,MACd57B,EAAOhZ,EAAM00C,MAAQ+E,GAGrBzgC,EAAOhZ,EAAM40C,MAAQ6E,EAEnBA,EAAOz5C,EAAM8B,SAAU23C,EAAOz5C,EAAM8B,QACxCuzC,EAAcr1C,EAAMvG,YAGpB47C,EAAc5oB,EACdzT,EAAO6gC,EAAM75C,EAAM26B,OACnB8e,EAAOz5C,EAAM8B,OAEX23C,EAAO3a,IAAQ2a,EAAO3a,GAC1BA,GAAQ2a,EACRz5C,EAAM8B,QAAU23C,KAEdhtB,EAAOotB,KAASxE,EAAYr8B,aACnBygC,GACU,IAAjBz5C,EAAM8B,SAAgB9B,EAAMf,KAxvCjB,eAKA,MAsvCF,IAAT6/B,QAAoBqb,EACxB1tB,EAAOotB,KAAS75C,EAAM8B,OACtBg9B,IACA9+B,EAAMf,KA9vCS,cAMN,MA2vCLe,EAAMuO,KAAM,MAEPy0B,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IAEA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGVwR,GAAQ1V,EACRkI,EAAK+E,WAAayI,EAClBx0C,EAAMs4C,OAAS9D;AACXA,IACFxN,EAAKkB,MAAQloC,EAAM5G,MAEd4G,EAAMwhB,MAAQgnB,GAAQxoC,EAAM5G,MAAOqzB,EAAQ+nB,EAAMqF,EAAMrF,GAAQvM,GAAUjoC,EAAM5G,MAAOqzB,EAAQ+nB,EAAMqF,EAAMrF,IAGjHA,EAAO1V,GAEF9+B,EAAMwhB,MAAQszB,EAAOqD,GAAQrD,MAAW90C,EAAM5G,MAAO,CACxD4tC,EAAKsE,IAAM,uBACXtrC,EAAMf,KAAOi5C,SAIfpD,EAAO,EACP9R,EAAO,EAIThjC,EAAMf,KA1xCI,QAAA,MA6xCNe,EAAMuO,MAAQvO,EAAMwhB,MAAO,MAEtBwhB,EAAO,IAAI,IACH,IAAT2V,QAAoBwB,EACxBxB,IACA7D,GAAQ74C,EAAMyV,MAAWsxB,EACzBA,GAAQ,KAGN8R,KAAwB,WAAd90C,EAAMs4C,OAAqB,CACvCtR,EAAKsE,IAAM,yBACXtrC,EAAMf,KAAOi5C,SAIfpD,EAAO,EACP9R,EAAO,EAIThjC,EAAMf,KAhzCE,QAAA,GAmzCR+wC,EAAM4H,SACAuC,OACHjC,GACHlI,EAAM8H,SACAqC,OArzCC,UAuzCAzQ,QAtzCC,kBA0zCDmO,UAcb7Q,EAAK8E,SAAW+N,EAChB7S,EAAK4E,UAAY9M,EACjBkI,EAAK6G,QAAUn8B,EACfs1B,EAAK4G,SAAW+K,EAChB34C,EAAM80C,KAAOA;AACb90C,EAAMgjC,KAAOA,GAGThjC,EAAM00C,OAAUF,IAASxN,EAAK4E,WAAa5rC,EAAMf,KAAOi5C,KACvCl4C,EAAMf,KAt1CZ,IAs1C4Bsc,IAAUk8B,MAC/C+B,GAAaxS,EAAMA,EAAKva,OAAQua,EAAK8E,SAAU0I,EAAOxN,EAAK4E,WAEjE2I,GAAOvN,EAAK4G,SACZ4G,GAAQxN,EAAK4E,UACb5E,EAAK8G,UAAYyG,EACjBvN,EAAK+E,WAAayI,EAClBx0C,EAAMs4C,OAAS9D,EACXx0C,EAAMuO,MAAQimC,IAChBxN,EAAKkB,MAAQloC,EAAM5G,MAChB4G,EAAMwhB,MAAQgnB,GAAQxoC,EAAM5G,MAAOqzB,EAAQ+nB,EAAMxN,EAAK8E,SAAW0I,GAAQvM,GAAUjoC,EAAM5G,MAAOqzB,EAAQ+nB,EAAMxN,EAAK8E,SAAW0I,IAEnIxN,EAAKC,UAAYjnC,EAAMgjC,MAAQhjC,EAAMyb,KAAO,GAAK,IAC9Bzb,EAAMf,OAASg5C,GAAS,IAAM,IA12C3B,KA22CHj4C,EAAMf,MAh3CN,KAg3CuBe,EAAMf,KAAiB,IAAM,IACzD,IAARs1C,GAAsB,IAATC,GAAej5B,IAAUk8B,KAAezH,IAAQ2H,KACjE3H,EAAM+H,IAED/H,GAkGRsK,WA9FkB,SAACtT,OAEbA,IAASA,EAAKhnC,aACV63C,OAGL73C,EAAQgnC,EAAKhnC,aACbA,EAAMvG,SACRuG,EAAMvG,OAAS;AAEjButC,EAAKhnC,MAAQ,KACN23C,IAoFR4C,iBAhFwB,SAACvT,EAAMxrB,OAGzBwrB,IAASA,EAAKhnC,aAAgB63C,OAC7B73C,EAAQgnC,EAAKhnC,aACM,IAAP,EAAbA,EAAMuO,MAA0BspC,IAGrC73C,EAAMwb,KAAOA,EACbA,EAAK/H,MAAO,EACLkkC,KAuER6C,qBAnE4B,SAACxT,EAAMqK,OAG9BrxC,EAFEsxC,EAAaD,EAAWvvC,cAOzBklC,GAAyBA,EAAKhnC,MAGhB,KAFnBA,EAAQgnC,EAAKhnC,OAEHuO,MAp6CI,KAo6CUvO,EAAMf,KACrB44C,GAr6CK,KAy6CV73C,EAAMf,MAGCgpC,GAFA,EAEkBoJ,EAAYC,EAAY,KACpCtxC,EAAM5G,MACZ0+C,GAKL0B,GAAaxS,EAAMqK,EAAYC,EAAYA,IAE/CtxC,EAAMf,KAj6CK,GAk6CJyqC,KAET1pC,EAAMq4C,SAAW,EAEVV,IAzB4DE,IA4DpE4C,YAtBiB,sCAgFlB,IAAIC,GApCJ,gBAEO/J,KAAa,OAEbG,KAAa,OAEbsJ,OAAa,OAEbrJ,GAAa,OAEbvM,MAAa,UAEb6V,UAAa,OAWbxxC,KAAa;KAIbgoC,QAAa,QAIbD,KAAa,OAEbn9B,MAAa,GAKdknC,GAAazgD,OAAOoH,UAAUnG,SAMtBy/C,GAEVhS,GAFFC,WAAoCgS,GAElCjS,GAFwBK,SACpB6R,GACJlS,GADFQ,KAA4B2R,GAC1BnS,GADYS,aAA2C2R,GACvDpS,GAD0CU,YAA4C2R,GACtFrS,GADsEY,eAAgD0R,GACtHtS,GADwGa,aAA2C0R,GACnJvS,GADsIc,YAmF1I,SAAS0R,GAAQp6C,QACVA,QAAU+wB,GAAc,CAC3BwhB,UAAW,MACXpD,WAAY,GACZxb,GAAI,IACH3zB,GAAW,QAERwyC,EAAM75C,KAAKqH,QAIbwyC,EAAIC,KAAQD,EAAIrD,YAAc,GAAOqD,EAAIrD,WAAa,KACxDqD,EAAIrD,YAAcqD,EAAIrD,WACC,IAAnBqD,EAAIrD,aAAoBqD,EAAIrD,YAAc,OAI3CqD,EAAIrD,YAAc,GAAOqD,EAAIrD,WAAa,KACzCnvC,GAAWA,EAAQmvC,aACvBqD,EAAIrD,YAAc;AAKfqD,EAAIrD,WAAa,IAAQqD,EAAIrD,WAAa,IAGf,IAAR,GAAjBqD,EAAIrD,cACPqD,EAAIrD,YAAc,SAIjBzsB,IAAS,OACT4nB,IAAS,QACTqI,OAAS,OACT9B,OAAS,QAET7K,KAAS,IAAI6L,QACb7L,KAAK4E,UAAY,MAElB0D,EAAUoK,GAAUL,aACtB1/C,KAAKqtC,KACLwM,EAAIrD,eAGFb,IAAWwL,SACP,IAAIx2B,MAAMqkB,GAAS2G,YAGtBrJ,OAAS,IAAIyU,GAElBhB,GAAUa,iBAAiB5gD,KAAKqtC,KAAMrtC,KAAKssC,QAGvCuN,EAAInC,aAEwB,iBAAnBmC,EAAInC,WACbmC,EAAInC,WAAae,GAAmBoB,EAAInC,YACK,yBAApCsJ,GAAWlgD,KAAK+4C,EAAInC,cAC7BmC,EAAInC,WAAa,IAAIvb,WAAW0d,EAAInC;AAElCmC,EAAIC,MACNnE,EAASoK,GAAUc,qBAAqB7gD,KAAKqtC,KAAMwM,EAAInC,eACxCyJ,UACP,IAAIx2B,MAAMqkB,GAAS2G,IAqNjC,SAAS+L,GAAUp/C,EAAO+E,OAClBs6C,EAAW,IAAIF,GAAQp6C,MAE7Bs6C,EAASv8C,KAAK9C,GAGVq/C,EAAS53B,IAAK,MAAM43B,EAAShQ,KAAO3C,GAAS2S,EAAS53B,YAEnD43B,EAASl4C,OA9LlBg4C,GAAQ95C,UAAUvC,KAAO,SAAUsF,EAAM2vC,OAInC1E,EAAQ2E,EAAasH,EAHnBvU,EAAOrtC,KAAKqtC,KACZuM,EAAY55C,KAAKqH,QAAQuyC,UACzBlC,EAAa13C,KAAKqH,QAAQqwC,cAG5B13C,KAAKg6C,MAAO,OAAO,MAEUM,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsB6G,GAAaD,GAGxB,yBAA1BD,GAAWlgD,KAAK4J,GAClB2iC,EAAK/qC,MAAQ,IAAI65B,WAAWzxB,GAE5B2iC,EAAK/qC,MAAQoI,EAGf2iC,EAAK6G,QAAU,EACf7G,EAAK4G,SAAW5G,EAAK/qC,MAAM6F,SAElB,KACgB,IAAnBklC,EAAK4E,YACP5E,EAAKva,OAAS,IAAIqJ,WAAWyd;AAC7BvM,EAAK8E,SAAW,EAChB9E,EAAK4E,UAAY2H,IAGnBjE,EAASoK,GAAUE,QAAQ5S,EAAMiN,MAElB+G,IAAiB3J,KAC9B/B,EAASoK,GAAUc,qBAAqBxT,EAAMqK,MAE/ByJ,GACbxL,EAASoK,GAAUE,QAAQ5S,EAAMiN,GACxB3E,IAAW4L,KAEpB5L,EAAS0L,KAKNhU,EAAK4G,SAAW,GAChB0B,IAAWyL,IACX/T,EAAKhnC,MAAMuO,KAAO,GACK,IAAvBlK,EAAK2iC,EAAK6G,UAEf6L,GAAUP,aAAanS,GACvBsI,EAASoK,GAAUE,QAAQ5S,EAAMiN,UAG3B3E,QACD2L,QACAC,QACAF,QACAG,eACEhH,MAAM7E,QACNqE,OAAQ,GACN,KAKX4H,EAAiBvU,EAAK4E,UAElB5E,EAAK8E,WACgB,IAAnB9E,EAAK4E,WAAmB0D,IAAWyL,OAEb,WAApBphD,KAAKqH,QAAQ2zB,GAAiB,KAE5B6mB,EAAgBpJ,GAAmBpL,EAAKva,OAAQua,EAAK8E,UAErD2P,EAAOzU,EAAK8E,SAAW0P,EACvBE,EAAUtJ,GAAmBpL,EAAKva,OAAQ+uB,GAG9CxU,EAAK8E,SAAW2P,EAChBzU,EAAK4E,UAAY2H,EAAYkI;AACzBA,GAAMzU,EAAKva,OAAOttB,IAAI6nC,EAAKva,OAAOyZ,SAASsV,EAAeA,EAAgBC,GAAO,QAEhFvH,OAAOwH,aAGPxH,OAAOlN,EAAKva,OAAO3qB,SAAWklC,EAAK8E,SAAW9E,EAAKva,OAASua,EAAKva,OAAOyZ,SAAS,EAAGc,EAAK8E,cAMhGwD,IAAWwL,IAA6B,IAAnBS,MAGrBjM,IAAWyL,UACbzL,EAASoK,GAAUY,WAAW3gD,KAAKqtC,WAC9BmN,MAAM7E,QACNqE,OAAQ,GACN,KAGa,IAAlB3M,EAAK4G,SAAgB,cAGpB,GAYTwN,GAAQ95C,UAAU4yC,OAAS,SAAUnC,QAC9BF,OAAO9yC,KAAKgzC,IAanBqJ,GAAQ95C,UAAU6yC,MAAQ,SAAU7E,GAE9BA,IAAWwL,KACW,WAApBnhD,KAAKqH,QAAQ2zB,QACVvxB,OAASzJ,KAAKk4C,OAAOxwC,KAAK,SAE1B+B,OAAS2uB,GAAqBp4B,KAAKk4C,cAGvCA,OAAS,QACTnuB,IAAM4rB;KACNhE,IAAM3xC,KAAKqtC,KAAKsE,KAgFvB,IAMIqQ,GAAc,CACjBP,QAPeA,GAQfxB,QAPiByB,GAQjBO,WA1BD,SAAoB3/C,EAAO+E,UACzBA,EAAUA,GAAW,IACbyyC,KAAM,EACP4H,GAAUp/C,EAAO+E,IAwBzB66C,OAPYR,GAQZzS,UAPiBA,IA0BdkT,GAAO,CACVxI,QAjB0Fc,GAAnFd,QAkBP9C,QAlB0F4D,GAA/D5D,QAmB3B6D,WAnB0FD,GAA3CC,WAoB/CX,KApB0FU,GAAjBV,KAqBzE0H,QAnB8FO,GAAvFP,QAoBPxB,QApB8F+B,GAAnE/B,QAqB3BgC,WArB8FD,GAA/CC,WAsB/CC,OAtB8FF,GAArBE,OAuBzEjT,UAXiBA,IC3hNd3mC,GAAYhI,GACZyB,GAAyBH,EAI7BwgD,GAAiB,SAAgBjiB,GAC/B,IAAI5P,EAAMnsB,OAAOrC,GAAuB/B,OACpCyJ,EAAS,GACTyf,EAAI5gB,GAAU63B,GAClB,GAAIjX,EAAI,GAAKA,GAAK4V,EAAAA,EAAU,MAAMnB,WAAW,+BAC7C,KAAMzU,EAAI,GAAIA,KAAO,KAAOqH,GAAOA,GAAc,EAAJrH,IAAOzf,GAAU8mB,GAC9D,OAAO9mB;ECXLhB,GAAWnI,GACX+hD,GAASzgD,GACTG,GAAyBsB,EAEzB+E,GAAOzI,KAAKyI,KAGZU,GAAe,SAAUw5C,GAC3B,OAAO,SAAUt5C,EAAOu5C,EAAWC,GACjC,IAIIC,EAASC,EAJTtoC,EAAIhW,OAAOrC,GAAuBiH,IAClC25C,EAAevoC,EAAEjS,OACjBy6C,OAAyB5gD,IAAfwgD,EAA2B,IAAMp+C,OAAOo+C,GAClDK,EAAep6C,GAAS85C,GAE5B,OAAIM,GAAgBF,GAA2B,IAAXC,EAAsBxoC,GAC1DqoC,EAAUI,EAAeF,GACzBD,EAAeL,GAAOvhD,KAAK8hD,EAASx6C,GAAKq6C,EAAUG,EAAQz6C,UAC1CA,OAASs6C,IAASC,EAAeA,EAAahhD,MAAM,EAAG+gD,IACjEH,EAASloC,EAAIsoC,EAAeA,EAAetoC,KAItD0oC,GAAiB,CAGf95B,MAAOlgB,IAAa,GAGpBmgB,IAAKngB,IAAa,ICzBpBi6C,GAAiB,mEAAmE79C,KAHpE5E,ICCZ0iD,GAAYphD,GAAmConB,MAD3C1oB,GAMN,CAAE+J,OAAQ,SAAU+N,OAAO,EAAM1M,OAJlBrI,IAIwC,CACvD4/C,SAAU,SAAkBV,GAC1B,OAAOS,GAAUhjD,KAAMuiD,EAAWr6C,UAAUC,OAAS,EAAID,UAAU,QAAKlG;CCR5E,IAGI4b,GAAala,GAEbw7B,GAAe,cACf9D,GAJoB/3B,GAIwB,YANxC/C,GAWN,CAAEV,QAAQ,EAAM8L,OAVL9J,EAM8B,cAIKw5B,IAAe,CAC7DA,YAAaA,KAGfxd,GAAWshB,ICfX,IACIpL,GAAalyB,GADTtB,GAMN,CAAE+J,OAAQ,SAAU+N,OAAO,EAAM1M,OAJNrI,GAIqC,QAAU,CAC1E6/C,IAAK,WACH,OAAOpvB,GAAW9zB,KAAM,MAAO,GAAI,OCTXM,GAIN,eCHtB,IAAI6D,GAAW7D,GACX+B,GAAcT,ECFd4C,GAA8BlE,GAC9B6iD,GDKa,SAAUC,GACzB,GAAa,WAATA,GAA8B,WAATA,GAA8B,YAATA,EAC5C,MAAMnhD,UAAU,kBAChB,OAAOI,GAAY8B,GAASnE,MAAgB,WAATojD,ICLnC1vC,GAFkBrQ,GAEa,eAC/BggD,GAAgBC,KAAK37C,UAInB+L,MAAgB2vC,IACpB7+C,GAA4B6+C,GAAe3vC,GAAcyvC,ICV3D,IAEII,GAFSjjD,EAEekjD,SCFpBljD,GAKN,CAAE+J,OAAQ,SAAUoB,MAAM,GAAQ;AAAE+3C,SDErBC,OAAOD,UAAY,SAAkB9jD,GACpD,MAAoB,iBAANA,GAAkB6jD,GAAe7jD,MEPjD,IAAI8D,GAAclD,EACdV,GAASgC,EACT2I,GAAWlH,GACX6H,GAAWxH,WACXZ,GAAMa,GACNhC,GAAUiC,EACVi0B,GAAoB/zB,GACpBzB,GAAc8D,EACdjG,GAAQsR,EACRhD,GAASiD,GACT5H,GAAsB6H,GAAsDxN,EAC5EtD,GAA2B+Q,EAA2DzN,EACtF1D,GAAiBoR,GAA+C1N,EAChE0xB,GAAO/jB,GAAoC+jB,KAE3C8tB,GAAS,SACTC,GAAe/jD,GAAa,OAC5BgkD,GAAkBD,GAAah8C,UAG/Bk8C,GAAiBliD,GAAQ6M,GAAOo1C,MAAqBF,GAIrDI,GAAW,SAAUlhD,GACvB,IACIsX,EAAO6pC,EAAOC,EAAOC,EAASC,EAAQ/7C,EAAQS,EAAOsgC,EADrDxpC,EAAK2C,GAAYO,GAAU,GAE/B,GAAiB,iBAANlD,GAAkBA,EAAGyI,OAAS,EAGvC,GAAc,MADd+R,GADAxa,EAAKk2B,GAAKl2B,IACC6a,WAAW,KACQ,KAAVL,GAElB,GAAc,MADd6pC,EAAQrkD,EAAG6a,WAAW,KACQ,MAAVwpC,EAAe,OAAO9kB,SACrC,GAAc,KAAV/kB,EAAc,CACvB,OAAQxa,EAAG6a,WAAW,IACpB,KAAK,GAAI,KAAK,GAAIypC,EAAQ,EAAGC,EAAU,GAAI,MAC3C,KAAK,GAAI,KAAK,IAAKD,EAAQ;AAAGC,EAAU,GAAI,MAC5C,QAAS,OAAQvkD,EAInB,IADAyI,GADA+7C,EAASxkD,EAAGgC,MAAM,IACFyG,OACXS,EAAQ,EAAGA,EAAQT,EAAQS,IAI9B,IAHAsgC,EAAOgb,EAAO3pC,WAAW3R,IAGd,IAAMsgC,EAAO+a,EAAS,OAAOhlB,IACxC,OAAOklB,SAASD,EAAQF,GAE5B,OAAQtkD,GAKZ,GAAI6K,GAASm5C,IAASC,GAAa,UAAYA,GAAa,QAAUA,GAAa,SAAU,CAS3F,IARA,IAgBqB3gD,GAhBjBohD,GAAgB,SAAgB/iD,GAClC,IAAI3B,EAAKwI,UAAUC,OAAS,EAAI,EAAI9G,EAChCy2B,EAAQ93B,KACZ,OAAO83B,aAAiBssB,KAElBP,GAAiB3jD,IAAM,WAAc0jD,GAAgBlhD,QAAQ5B,KAAKg3B,MAAan2B,GAAQm2B,IAAU4rB,IACjG7rB,GAAkB,IAAI8rB,GAAaG,GAASpkD,IAAMo4B,EAAOssB,IAAiBN,GAASpkD;EAElFoG,GAAOtC,GAAcqG,GAAoB85C,IAAgB,8LAQhE9hD,MAAM,KAAMwzB,GAAI,EAAQvvB,GAAKqC,OAASktB,GAAGA,KACrCvyB,GAAI6gD,GAAc3gD,GAAM8C,GAAKuvB,OAAQvyB,GAAIshD,GAAephD,KAC1DxC,GAAe4jD,GAAephD,GAAKpC,GAAyB+iD,GAAc3gD,KAG9EohD,GAAcz8C,UAAYi8C,GAC1BA,GAAgB1zC,YAAck0C,GAC9Bl5C,GAAStL,GAAQ8jD,GAAQU,IC9E3B,IAEIltC,GAAmB7T,GAFf/C,GAMN,CAAE+J,OAAQ,QAAS+N,OAAO,GAAQ,CAClC4kC,KANSp7C,KAUXsV,GAAiB,QCVA5W,GAKW,OAAO,SAAUu5B,GAC3C,OAAO,WAAiB,OAAOA,EAAK75B,KAAMkI,UAAUC,OAASD,UAAU,QAAKlG,MALvDJ;CCFvB,IAAIuC,GAAW7D,GACX4d,GAAgBtc,GCAhBuO,GAAO7P,GACPqC,GAAWf,EACXyiD,GDCa,SAAU73C,EAAUhK,EAAInB,EAAOmX,GAC9C,IACE,OAAOA,EAAUhW,EAAG2B,GAAS9C,GAAO,GAAIA,EAAM,IAAMmB,EAAGnB,GACvD,MAAOjB,GAEP,MADA8d,GAAc1R,GACRpM,ICLN4d,GAAwBta,GACxB+E,GAAW9E,GACX6kB,GAAiB5kB,GACjBqa,GAAoBna,GAIxBwgD,GAAiB,SAAc9e,GAC7B,IAOIr9B,EAAQsB,EAAQiV,EAAMlS,EAAUuL,EAAM1W,EAPtC2C,EAAIrB,GAAS6iC,GACbv1B,EAAmB,mBAARjQ,KAAqBA,KAAO0M,MACvCwuB,EAAkBhzB,UAAUC,OAC5Bm6B,EAAQpH,EAAkB,EAAIhzB,UAAU,QAAKlG,EAC7CugC,OAAoBvgC,IAAVsgC,EACVhV,EAAiBrP,GAAkBja,GACnC4E,EAAQ,EAIZ,GAFI25B,IAASD,EAAQnyB,GAAKmyB,EAAOpH,EAAkB,EAAIhzB,UAAU,QAAKlG,EAAW,IAE3DA,MAAlBsrB,GAAiCrd,GAAKvD,OAASsR,GAAsBsP,GAWvE,IADA7jB,EAAS,IAAIwG,EADb9H,EAASM,GAASzE,EAAEmE,SAEdA,EAASS,EAAOA,IACpBvH,EAAQkhC,EAAUD,EAAMt+B,EAAE4E,GAAQA,GAAS5E,EAAE4E,GAC7C4f,GAAe/e,EAAQb,EAAOvH,QAThC,IAFA0W,GADAvL,EAAW8gB,EAAexsB,KAAKkD,IACf+T;AAChBtO,EAAS,IAAIwG,IACLyO,EAAO3G,EAAKjX,KAAK0L,IAAWsN,KAAMlR,IACxCvH,EAAQkhC,EAAU8hB,GAA6B73C,EAAU81B,EAAO,CAAC5jB,EAAKrd,MAAOuH,IAAQ,GAAQ8V,EAAKrd,MAClGmnB,GAAe/e,EAAQb,EAAOvH,GAWlC,OADAoI,EAAOtB,OAASS,EACTa,GCtCL4V,GAAOzd,GADHtB,GAWN,CAAE+J,OAAQ,QAASoB,MAAM,EAAMC,QATCrI,IAEqB,SAAUkb,GAE/D7R,MAAM2S,KAAKd,OAKmD,CAC9Dc,KAAMA,KCZR,IACIuW,GAAOh0B,GAAoCg0B,KAG3C2uB,GAJSjkD,EAIYkkD,WCHrBA,GDIS,EAAID,GAAYhvB,qDAAyBuJ,EAAAA,EAI5B,SAAoBh0B,GAC5C,IAAI25C,EAAgB7uB,GAAKxxB,OAAO0G,IAC5BrB,EAAS86C,GAAYE,GACzB,OAAkB,IAAXh7C,GAA2C,KAA3Bg7C,EAAcjqC,OAAO,IAAa,EAAI/Q,GAC3D86C,GCbIjkD,GAMN,CAAE+J,OAAQ,SAAUoB,MAAM,EAAMC,OAAQ+3C,OAAOe,YAAcA,IAAc,CAC3EA,WAAYA,KCPd,IAAI7iD,GAAUrB,ECCViR,GAAIjR,GACJgI,GAAY1G,GACZ8iD,GDCa,SAAUrjD;AACzB,GAAoB,iBAATA,GAAuC,UAAlBM,GAAQN,GACtC,MAAMY,UAAU,wBAElB,OAAQZ,GCJNghD,GAAS3+C,GACTxD,GAAQyD,EAERghD,GAAgB,GAAIC,QACpBv8C,GAAQ1I,KAAK0I,MAEbw1B,GAAM,SAAU7Z,EAAGkF,EAAG27B,GACxB,OAAa,IAAN37B,EAAU27B,EAAM37B,EAAI,GAAM,EAAI2U,GAAI7Z,EAAGkF,EAAI,EAAG27B,EAAM7gC,GAAK6Z,GAAI7Z,EAAIA,EAAGkF,EAAI,EAAG27B,IAgB9EC,GAAW,SAAUp6C,EAAMwe,EAAGtZ,GAGhC,IAFA,IAAIhH,GAAS,EACT8vC,EAAK9oC,IACAhH,EAAQ,GACf8vC,GAAMxvB,EAAIxe,EAAK9B,GACf8B,EAAK9B,GAAS8vC,EAAK,IACnBA,EAAKrwC,GAAMqwC,EAAK,MAIhBqM,GAAS,SAAUr6C,EAAMwe,GAG3B,IAFA,IAAItgB,EAAQ,EACRgH,EAAI,IACChH,GAAS,GAChBgH,GAAKlF,EAAK9B,GACV8B,EAAK9B,GAASP,GAAMuH,EAAIsZ,GACxBtZ,EAAKA,EAAIsZ,EAAK,KAId87B,GAAe,SAAUt6C,GAG3B,IAFA,IAAI9B,EAAQ,EACR8mB,EAAI,KACC9mB,GAAS,GAChB,GAAU,KAAN8mB,GAAsB,IAAV9mB,GAA+B,IAAhB8B,EAAK9B,GAAc,CAChD,IAAImmC,EAAI3qC,OAAOsG,EAAK9B,IACpB8mB,EAAU,KAANA,EAAWqf,EAAIrf,EAAI2yB,GAAOvhD,KAAK,IAAK,EAAIiuC,EAAE5mC,QAAU4mC,EAE1D,OAAOrf,MAeT;AAAErlB,OAAQ,SAAU+N,OAAO,EAAM1M,OAZtBi5C,KACY,UAAvB,KAAQC,QAAQ,IACG,MAAnB,GAAIA,QAAQ,IACS,SAArB,MAAMA,QAAQ,IACuB,yBAArC,mBAAsBA,QAAQ,MAC1B1kD,IAAM,WAEVykD,GAAc7jD,KAAK,QAKgC,CACnD8jD,QAAS,SAAiBK,GACxB,IAKI1xB,EAAGC,EAAG6B,EAAGlM,EALTuU,EAASgnB,GAAgB1kD,MACzBklD,EAAc58C,GAAU28C,GACxBv6C,EAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GACvBm0B,EAAO,GACPp1B,EAAS,IAGb,GAAIy7C,EAAc,GAAKA,EAAc,GAAI,MAAMvnB,WAAW,6BAE1D,GAAID,GAAUA,EAAQ,MAAO,MAC7B,GAAIA,IAAW,MAAQA,GAAU,KAAM,OAAOt5B,OAAOs5B,GAKrD,GAJIA,EAAS,IACXmB,EAAO,IACPnB,GAAUA,GAERA,EAAS,MAKX,GAHAlK,GADAD,EA1EI,SAAUvP,GAGlB,IAFA,IAAIkF,EAAI,EACJi8B,EAAKnhC,EACFmhC,GAAM,MACXj8B,GAAK,GACLi8B,GAAM;CAER,KAAOA,GAAM,GACXj8B,GAAK,EACLi8B,GAAM,EACN,OAAOj8B,EAgED4U,CAAIJ,EAASG,GAAI,EAAG,GAAI,IAAM,IAC1B,EAAIH,EAASG,GAAI,GAAItK,EAAG,GAAKmK,EAASG,GAAI,EAAGtK,EAAG,GACxDC,GAAK,kBACLD,EAAI,GAAKA,GACD,EAAG,CAGT,IAFAuxB,GAASp6C,EAAM,EAAG8oB,GAClB6B,EAAI6vB,EACG7vB,GAAK,GACVyvB,GAASp6C,EAAM,IAAK,GACpB2qB,GAAK,EAIP,IAFAyvB,GAASp6C,EAAMmzB,GAAI,GAAIxI,EAAG,GAAI,GAC9BA,EAAI9B,EAAI,EACD8B,GAAK,IACV0vB,GAAOr6C,EAAM,GAAK,IAClB2qB,GAAK,GAEP0vB,GAAOr6C,EAAM,GAAK2qB,GAClByvB,GAASp6C,EAAM,EAAG,GAClBq6C,GAAOr6C,EAAM,GACbjB,EAASu7C,GAAat6C,QAEtBo6C,GAASp6C,EAAM,EAAG8oB,GAClBsxB,GAASp6C,EAAM,IAAM6oB,EAAG,GACxB9pB,EAASu7C,GAAat6C,GAAQ23C,GAAOvhD,KAAK,IAAKokD,GAUjD,OALAz7C,EAFEy7C,EAAc,EAEPrmB,IADT1V,EAAI1f,EAAOtB,SACW+8C,EAClB,KAAO7C,GAAOvhD,KAAK,IAAKokD,EAAc/7B,GAAK1f,EAC3CA,EAAO/H,MAAM,EAAGynB,EAAI+7B,GAAe,IAAMz7C,EAAO/H,MAAMynB,EAAI+7B,IAErDrmB,EAAOp1B,KCxHtB,IAAI8H,GAAIjR,GACJM,GAA2BgB,EAA2DsC,EACtFuE,GAAWpF,GACXwzB,GAAanzB,GACb3B,GAAyB4B,EACzBy2B,GAAuBx2B,GAIvBwhD,GAAY,GAAGC,SACf78C,GAAM7I,KAAK6I,IAEX+xB,GAA0BH,GAAqB,eASjD,CAAE/vB,OAAQ;AAAU+N,OAAO,EAAM1M,UAPC6uB,MAA6B,WAC/D,IAAIt5B,EAAaL,GAAyBwD,OAAOuD,UAAW,YAC5D,OAAO1G,IAAeA,EAAWM,SAF8B,MAOAg5B,IAA2B,CAC1F8qB,SAAU,SAAkBvuB,GAC1B,IAAIpnB,EAAOtL,OAAOrC,GAAuB/B,OACzC62B,GAAWC,GACX,IAAIwuB,EAAcp9C,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EACpDs0B,EAAM7tB,GAASiH,EAAKvH,QACpB8gB,OAAsBjnB,IAAhBsjD,EAA4BhvB,EAAM9tB,GAAIC,GAAS68C,GAAchvB,GACnEkE,EAASp2B,OAAO0yB,GACpB,OAAOsuB,GACHA,GAAUtkD,KAAK4O,EAAM8qB,EAAQvR,GAC7BvZ,EAAKhO,MAAMunB,EAAMuR,EAAOryB,OAAQ8gB,KAASuR,KChCjD,IACI5E,GAAOh0B,GAAoCg0B,KAC3CL,GAAclyB,GAEdkiD,GAJSjlD,EAIU6jD,SACnBqB,GAAM,cCJNrB,GDK2C,IAAlCoB,GAAUhwB,GAAc,OAAmD,KAApCgwB,GAAUhwB,GAAc,QAIlD,SAAkBzqB,EAAQk5C,GAClD,IAAI5pC,EAAIwb,GAAKxxB,OAAO0G,IACpB,OAAOy6C,GAAUnrC,EAAI4pC,IAAU,IAAOwB,GAAItgD,KAAKkV,GAAK,GAAK,MACvDmrC,GCbIjlD,GAMN,CAAE+J,OAAQ;AAAUoB,MAAM,EAAMC,OAAQ+3C,OAAOU,UAAYA,IAAY,CACvEA,SAAUA,MCHZsB,EAJkCnlD,YAIN,SAAS,SAAUu5B,GAC7C,OAAO,SAAoBnvB,EAAM61B,EAAYp4B,GAC3C,OAAO0xB,EAAK75B,KAAM0K,EAAM61B,EAAYp4B,OCLhC7H,GAIN,CAAE+J,OAAQ,MAAO+N,OAAO,EAAMlX,YAAY,GAAQ,CAClDwkD,OAAQ,WACN,OAAOC,IAAIh+C,UAAUnG,SAASV,KAAKd,SCPvC,IAAIuR,GAAIjR,GACJ42B,GAAWt1B,GACX1B,GAAQmD,EACRjB,GAAWsB,EACXk0B,GAAWj0B,WAA0Ci0B,SAGrDguB,GAAUrlD,OAAOslD,UAKnB,CAAEx7C,OAAQ,SAAUoB,MAAM,EAAMC,OAJRxL,IAAM,WAAc0lD,GAAQ,MAISj6C,MAAOurB,IAAY,CAChF2uB,OAAQ,SAAgBnmD,GACtB,OAAOkmD,IAAWxjD,GAAS1C,GAAMkmD,GAAQhuB,GAASl4B,IAAOA,SCdzDunB;CASJ,SAAS6+B,GAAKC,QACPA,KAAOA,EAmBd,cA3BiB,SAAczvB,UACxBrP,KACHA,GAAI,IAAI6+B,GAAK,OAER7+B,GAAE++B,SAAS1vB,oBAMEwvB,GAEtBA,GAAKn+C,UAAUq+C,SAAW,SAAkB1vB,UACnCt2B,KAAKimD,MAAM3vB,IAIpBwvB,GAAKn+C,UAAUs+C,MAAQ,SAAe/8B,MAChClpB,KAAK+lD,KAAKG,SACZ,OAAOlmD,KAAK+lD,KAAKG,SAASh9B,WAExBgK,EAAM,IAAIiJ,WAAWjT,GAChB1f,EAAI,EAAGA,EAAI0pB,EAAI/qB,OAAQqB,IAC9B0pB,EAAI1pB,GAAKxJ,KAAK+lD,KAAKI,iBACdjzB,GAGW,gCAATnzB,mBAAAA,OACLA,KAAKqmD,QAAUrmD,KAAKqmD,OAAOC,gBAE7BP,GAAKn+C,UAAUs+C,MAAQ,SAAe/8B,OAChCo9B,EAAM,IAAInqB,WAAWjT;QACzBnpB,KAAKqmD,OAAOC,gBAAgBC,GACrBA,GAEAvmD,KAAKwmD,UAAYxmD,KAAKwmD,SAASF,gBAExCP,GAAKn+C,UAAUs+C,MAAQ,SAAe/8B,OAChCo9B,EAAM,IAAInqB,WAAWjT,UACzBnpB,KAAKwmD,SAASF,gBAAgBC,GACvBA,GAIkB,gCAAXxmD,qBAAAA,WAEhBgmD,GAAKn+C,UAAUs+C,MAAQ,iBACf,IAAIt7B,MAAM,sCAMdy7B,GAAS9lD,MACqB,mBAAvB8lD,GAAOI,YAChB,MAAM,IAAI77B,MAAM,iBAElBm7B,GAAKn+C,UAAUs+C,MAAQ,SAAe/8B,UAC7Bk9B,GAAOI,YAAYt9B,IAE5B,MAAOqK;8BC9DXkzB,GAAiBC,GAEjB,SAASA,GAAOjkD,EAAKkvC,OACdlvC,EACH,MAAM,IAAIkoB,MAAMgnB,GAAO,uBAGpBgV,MAAQ,SAAqBxO,EAAGlxB,EAAG0qB,MACpCwG,GAAKlxB,EACP,MAAM,IAAI0D,MAAMgnB,GAAQ,qBAAuBwG,EAAI,OAASlxB,wBCTnC,mBAAlB1mB,OAAOiO,OAEhBo4C,WAAiB,SAAkBl5B,EAAMm5B,GACnCA,IACFn5B,EAAKo5B,OAASD,EACdn5B,EAAK/lB,UAAYpH,OAAOiO,OAAOq4C,EAAUl/C,UAAW,CAClDuI,YAAa,CACX7O,MAAOqsB,EACPxsB,YAAY,EACZK,UAAU,EACVD,cAAc,OAOtBslD,WAAiB,SAAkBl5B,EAAMm5B,MACnCA,EAAW,CACbn5B,EAAKo5B,OAASD,MACVE,EAAW,aACfA,EAASp/C,UAAYk/C,EAAUl/C,UAC/B+lB,EAAK/lB,UAAY,IAAIo/C;AACrBr5B,EAAK/lB,UAAUuI,YAAcwd,ICrBnC,IAAIg5B,GAASpmD,GACT0mD,GAAWplD,WAIf,SAASqlD,GAAgBtV,EAAKnoC,UACS,QAAZ,MAApBmoC,EAAIp3B,WAAW/Q,QAGhBA,EAAI,GAAKA,EAAI,GAAKmoC,EAAIxpC,SAGkB,QAAZ,MAAxBwpC,EAAIp3B,WAAW/Q,EAAI,KA0D7B,SAAS09C,GAAMze,UACFA,IAAM,GACLA,IAAM,EAAK,MACXA,GAAK,EAAK,UACN,IAAJA,IAAa,MACV,EAgBjB,SAAS0e,GAAMC,UACO,IAAhBA,EAAKj/C,OACA,IAAMi/C,EAENA,EAIX,SAASC,GAAMD,UACO,IAAhBA,EAAKj/C,OACA,IAAMi/C,EACU,IAAhBA,EAAKj/C,OACL,KAAOi/C,EACS,IAAhBA,EAAKj/C,OACL,MAAQi/C,EACQ,IAAhBA,EAAKj/C,OACL,OAASi/C,EACO,IAAhBA,EAAKj/C,OACL,QAAUi/C,EACM,IAAhBA,EAAKj/C,OACL,SAAWi/C,EACK,IAAhBA,EAAKj/C,OACL,UAAYi/C,EAEZA,cAhHQJ,cAYnB,SAAiBrV,EAAK2V;GAChB56C,MAAMD,QAAQklC,GAChB,OAAOA,EAAIjwC,YACRiwC,EACH,MAAO,OACLze,EAAM,MACS,iBAARye,KACJ2V,GAyBE,GAAY,QAARA,OACT3V,EAAMA,EAAI5mC,QAAQ,eAAgB,KAC1B5C,OAAS,GAAM,IACrBwpC,EAAM,IAAMA,GACTnoC,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,GAAK,EAC/B0pB,EAAI9tB,KAAK++C,SAASxS,EAAInoC,GAAKmoC,EAAInoC,EAAI,GAAI,kBAzBrC6e,EAAI,EACC7e,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAAK,KAC/BoG,EAAI+hC,EAAIp3B,WAAW/Q,GACnBoG,EAAI,IACNsjB,EAAI7K,KAAOzY,EACFA,EAAI,MACbsjB,EAAI7K,KAAQzY,GAAK,EAAK,IACtBsjB,EAAI7K,KAAY,GAAJzY,EAAU,KACbq3C,GAAgBtV,EAAKnoC,IAC9BoG,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtB+hC,EAAIp3B,aAAa/Q,IACvD0pB,EAAI7K,KAAQzY,GAAK,GAAM,IACvBsjB,EAAI7K,KAASzY,GAAK,GAAM,GAAM,IAC9BsjB,EAAI7K,KAASzY,GAAK,EAAK,GAAM,IAC7BsjB,EAAI7K,KAAY,GAAJzY,EAAU,MAEtBsjB,EAAI7K,KAAQzY,GAAK,GAAM,IACvBsjB,EAAI7K,KAASzY,GAAK,EAAK,GAAM;AAC7BsjB,EAAI7K,KAAY,GAAJzY,EAAU,cAWvBpG,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAC1B0pB,EAAI1pB,GAAc,EAATmoC,EAAInoC,UAEV0pB,YAIT,SAAeye,WACTze,EAAM,GACD1pB,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAC9B0pB,GAAOi0B,GAAMxV,EAAInoC,GAAGhI,SAAS,YACxB0xB,YAWOg0B,cAEhB,SAAiBvV,EAAK4V,WAChBr0B,EAAM,GACD1pB,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAAK,KAC/Bi/B,EAAIkJ,EAAInoC,GACG,WAAX+9C,IACF9e,EAAIye,GAAMze,IACZvV,GAAOm0B,GAAM5e,EAAEjnC,SAAS,YAEnB0xB,YAUOi0B,YAoBAE,aAEhB,SAAgB1V,EAAK3oB,EAAOC,EAAKs+B,OAC3BjxB,EAAMrN,EAAMD,EAChB09B,GAAOpwB,EAAM,GAAM,WACfpD,EAAM,IAAIxmB,MAAM4pB,EAAM,GACjB9sB,EAAI,EAAG2f,EAAIH,EAAOxf,EAAI0pB,EAAI/qB,OAAQqB,IAAK2f,GAAK,EAAG,KAClDsf;CAEFA,EADa,QAAX8e,EACG5V,EAAIxoB,IAAM,GAAOwoB,EAAIxoB,EAAI,IAAM,GAAOwoB,EAAIxoB,EAAI,IAAM,EAAKwoB,EAAIxoB,EAAI,GAEjEwoB,EAAIxoB,EAAI,IAAM,GAAOwoB,EAAIxoB,EAAI,IAAM,GAAOwoB,EAAIxoB,EAAI,IAAM,EAAKwoB,EAAIxoB,GACxE+J,EAAI1pB,GAAKi/B,IAAM,SAEVvV,cAIT,SAAiBye,EAAK4V,WAChBr0B,EAAM,IAAIxmB,MAAmB,EAAbilC,EAAIxpC,QACfqB,EAAI,EAAG2f,EAAI,EAAG3f,EAAImoC,EAAIxpC,OAAQqB,IAAK2f,GAAK,EAAG,KAC9CqL,EAAImd,EAAInoC,GACG,QAAX+9C,GACFr0B,EAAI/J,GAAKqL,IAAM,GACftB,EAAI/J,EAAI,GAAMqL,IAAM,GAAM,IAC1BtB,EAAI/J,EAAI,GAAMqL,IAAM,EAAK,IACzBtB,EAAI/J,EAAI,GAAS,IAAJqL,IAEbtB,EAAI/J,EAAI,GAAKqL,IAAM,GACnBtB,EAAI/J,EAAI,GAAMqL,IAAM,GAAM,IAC1BtB,EAAI/J,EAAI,GAAMqL,IAAM,EAAK,IACzBtB,EAAI/J,GAAS,IAAJqL,UAGNtB,aAIT,SAAgBuV,EAAG94B,UACT84B,IAAM94B,EAAM84B,GAAM,GAAK94B,aAIjC,SAAgB84B,EAAG94B,UACT84B,GAAK94B,EAAM84B,IAAO,GAAK94B,YAIjC,SAAepM,EAAGoM,UACRpM,EAAIoM,IAAO;WAIrB,SAAiBpM,EAAGoM,EAAGC,UACbrM,EAAIoM,EAAIC,IAAO,cAIzB,SAAiBrM,EAAGoM,EAAGC,EAAG43C,UAChBjkD,EAAIoM,EAAIC,EAAI43C,IAAO,cAI7B,SAAiBjkD,EAAGoM,EAAGC,EAAG43C,EAAGj0B,UACnBhwB,EAAIoM,EAAIC,EAAI43C,EAAIj0B,IAAO,YAIjC,SAAeiT,EAAKvsB,EAAKwtC,EAAIC,OACvBC,EAAKnhB,EAAIvsB,GAGT2tC,EAAMF,EAFDlhB,EAAIvsB,EAAM,KAEI,EACnB4tC,GAAMD,EAAKF,EAAK,EAAI,GAAKD,EAAKE,EAClCnhB,EAAIvsB,GAAO4tC,IAAO,EAClBrhB,EAAIvsB,EAAM,GAAK2tC,eAIjB,SAAkBH,EAAIC,EAAIC,EAAIG,UAClBJ,EAAKI,IAAQ,EACRJ,EAAK,EAAI,GAAKD,EAAKE,IACpB,eAIhB,SAAkBF,EAAIC,EAAIC,EAAIG,UACnBJ,EAAKI,IACA,iBAIhB,SAAoBL,EAAIC,EAAIC,EAAIG,EAAIpzB,EAAIqzB,EAAIC,EAAIC,OAC1CC,EAAQ,EACRN,EAAKF,SAETQ,IADAN,EAAMA,EAAKE,IAAQ,GACLJ,EAAK,EAAI,EAEvBQ,IADAN,EAAMA,EAAKG,IAAQ,GACLA,EAAK,EAAI,EAIdN,EAAKE,EAAKjzB,EAAKszB,GAFxBE,IADAN,EAAMA,EAAKK,IAAQ,GACLA,EAAK,EAAI,KAGT;cAIhB,SAAoBR,EAAIC,EAAIC,EAAIG,EAAIpzB,EAAIqzB,EAAIC,EAAIC,UACrCP,EAAKI,EAAKC,EAAKE,IACV,iBAIhB,SAAoBR,EAAIC,EAAIC,EAAIG,EAAIpzB,EAAIqzB,EAAIC,EAAIC,EAAIE,EAAIl/C,OAClDi/C,EAAQ,EACRN,EAAKF,SAETQ,IADAN,EAAMA,EAAKE,IAAQ,GACLJ,EAAK,EAAI,EAEvBQ,IADAN,EAAMA,EAAKG,IAAQ,GACLA,EAAK,EAAI,EAEvBG,IADAN,EAAMA,EAAKK,IAAQ,GACLA,EAAK,EAAI,EAIdR,EAAKE,EAAKjzB,EAAKszB,EAAKG,GAF7BD,IADAN,EAAMA,EAAK3+C,IAAQ,GACLA,EAAK,EAAI,KAGT,iBAIhB,SAAoBw+C,EAAIC,EAAIC,EAAIG,EAAIpzB,EAAIqzB,EAAIC,EAAIC,EAAIE,EAAIl/C,UAC7Cy+C,EAAKI,EAAKC,EAAKE,EAAKh/C,IAEf,gBAIhB,SAAmBw+C,EAAIC,EAAIU,UAChBV,GAAO,GAAKU,EAASX,IAAOW,KACxB,gBAIf,SAAmBX,EAAIC,EAAIU,UAChBX,GAAO,GAAKW,EAASV,IAAOU,KACxB,eAIf,SAAkBX,EAAIC,EAAIU,UACjBX,IAAOW,eAIhB,SAAkBX,EAAIC,EAAIU,UACfX,GAAO,GAAKW,EAASV,IAAOU,KACxB;WCjRXC,GAAQ/nD,GACRomD,GAAS9kD,GAEb,SAAS0mD,UACF3f,QAAU,UACV4f,aAAe,OACfC,UAAYxoD,KAAKkQ,YAAYs4C,eAC7BC,QAAUzoD,KAAKkQ,YAAYu4C,aAC3BC,aAAe1oD,KAAKkQ,YAAYw4C,kBAChCC,UAAY3oD,KAAKkQ,YAAYy4C,UAAY,OACzCpB,OAAS,WAETqB,QAAU5oD,KAAKwoD,UAAY,OAC3BK,SAAW7oD,KAAKwoD,UAAY,gBAEfF,MAEV3gD,UAAUmhD,OAAS,SAAgBnX,EAAK2V,MAEhD3V,EAAM0W,GAAMU,QAAQpX,EAAK2V,GACpBtnD,KAAK2oC,QAGR3oC,KAAK2oC,QAAU3oC,KAAK2oC,QAAQ/+B,OAAO+nC,GAFnC3xC,KAAK2oC,QAAUgJ,OAGZ4W,cAAgB5W,EAAIxpC;AAGrBnI,KAAK2oC,QAAQxgC,QAAUnI,KAAK4oD,QAAS,KAInC3hC,GAHJ0qB,EAAM3xC,KAAK2oC,SAGCxgC,OAASnI,KAAK4oD,aACrBjgB,QAAUgJ,EAAIjwC,MAAMiwC,EAAIxpC,OAAS8e,EAAG0qB,EAAIxpC,QACjB,IAAxBnI,KAAK2oC,QAAQxgC,SACfnI,KAAK2oC,QAAU,MAEjBgJ,EAAM0W,GAAMW,OAAOrX,EAAK,EAAGA,EAAIxpC,OAAS8e,EAAGjnB,KAAKunD,YAC3C,IAAI/9C,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,GAAKxJ,KAAK6oD,cACnCI,QAAQtX,EAAKnoC,EAAGA,EAAIxJ,KAAK6oD,iBAG3B7oD,SAGC2H,UAAUuhD,OAAS,SAAgB5B,eACtCwB,OAAO9oD,KAAKmpD,QACjBzC,GAAwB,OAAjB1mD,KAAK2oC,SAEL3oC,KAAKopD,QAAQ9B,OAGZ3/C,UAAUwhD,KAAO;IACrB7yB,EAAMt2B,KAAKuoD,aACXlqB,EAAQr+B,KAAK4oD,QACbz/B,EAAIkV,GAAU/H,EAAMt2B,KAAK2oD,WAAatqB,EACtCnL,EAAM,IAAIxmB,MAAMyc,EAAInpB,KAAK2oD,WAC7Bz1B,EAAI,GAAK,QACJ,IAAI1pB,EAAI,EAAGA,EAAI2f,EAAG3f,IACrB0pB,EAAI1pB,GAAK,KAGX8sB,IAAQ,EACY,QAAhBt2B,KAAKunD,OAAkB,KACpB,IAAIxY,EAAI,EAAGA,EAAI/uC,KAAK2oD,UAAW5Z,IAClC7b,EAAI1pB,KAAO,EAEb0pB,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAQ8sB,IAAQ,GAAM,IAC1BpD,EAAI1pB,KAAQ8sB,IAAQ,GAAM,IAC1BpD,EAAI1pB,KAAQ8sB,IAAQ,EAAK,IACzBpD,EAAI1pB,KAAa,IAAN8sB,WAEXpD,EAAI1pB,KAAa,IAAN8sB,EACXpD,EAAI1pB,KAAQ8sB,IAAQ,EAAK,IACzBpD,EAAI1pB,KAAQ8sB,IAAQ,GAAM,IAC1BpD,EAAI1pB,KAAQ8sB,IAAQ,GAAM,IAC1BpD,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAO,EACX0pB,EAAI1pB,KAAO,EAENulC,EAAI,EAAGA,EAAI/uC,KAAK2oD,UAAW5Z,IAC9B7b,EAAI1pB,KAAO,SAGR0pB,mBCvFLm2B,GADQ/oD,GACO+oD;CAYnB,SAASC,GAAKtlC,EAAGulC,EAAG/1B,UACVxP,EAAIulC,GAAQvlC,EAAKwP,EAI3B,SAASg2B,GAAMxlC,EAAGulC,EAAG/1B,UACXxP,EAAIulC,EAAMvlC,EAAIwP,EAAM+1B,EAAI/1B,EAIlC,SAASi2B,GAAIzlC,EAAGulC,EAAG/1B,UACVxP,EAAIulC,EAAI/1B,UArBjB,SAAc9D,EAAG1L,EAAGulC,EAAG/1B,UACX,IAAN9D,EACK45B,GAAKtlC,EAAGulC,EAAG/1B,GACV,IAAN9D,GAAiB,IAANA,EACN+5B,GAAIzlC,EAAGulC,EAAG/1B,GACT,IAAN9D,EACK85B,GAAMxlC,EAAGulC,EAAG/1B,mBAOR81B,YAKCE,UAKFC,aAEd,SAAgBzlC,UACPqlC,GAAOrlC,EAAG,GAAKqlC,GAAOrlC,EAAG,IAAMqlC,GAAOrlC,EAAG,eAIlD,SAAgBA,UACPqlC,GAAOrlC,EAAG,GAAKqlC,GAAOrlC,EAAG,IAAMqlC,GAAOrlC,EAAG,eAIlD,SAAgBA,UACPqlC,GAAOrlC,EAAG,GAAKqlC,GAAOrlC,EAAG,IAAOA,IAAM,aAI/C,SAAgBA,UACPqlC,GAAOrlC,EAAG,IAAMqlC,GAAOrlC,EAAG,IAAOA,IAAM;CC5ChD,IAAIqkC,GAAQ/nD,GACR83B,GAASx2B,GACT8nD,GAAYrmD,GAEZsmD,GAAStB,GAAMsB,OACfC,GAAQvB,GAAMuB,MACdC,GAAUxB,GAAMwB,QAChBC,GAAOJ,GAAUI,KACjBxB,GAAYlwB,GAAOkwB,UAEnByB,GAAS,CACX,WAAY,WACZ,WAAY,YAGd,SAASC,UACDhqD,gBAAgBgqD,IACpB,OAAO,IAAIA,GAEb1B,GAAUxnD,KAAKd,WACVorC,EAAI,CACP,WAAY,WAAY,WACxB,UAAY,iBACT6e,EAAI,IAAIv9C,MAAM,OAGfs6C,SAASgD,GAAM1B,QACrB4B,GAAiBF,GAEjBA,GAAKxB,UAAY,IACjBwB,GAAKvB,QAAU,IACfuB,GAAKtB,aAAe,GACpBsB,GAAKrB,UAAY,GAEjBqB,GAAKriD,UAAUshD,QAAU,SAAiBtX,EAAK3oB,WACzCihC,EAAIjqD,KAAKiqD,EAEJzgD,EAAI,EAAGA,EAAI,GAAIA,IACtBygD,EAAEzgD,GAAKmoC,EAAI3oB,EAAQxf;MAEfA,EAAIygD,EAAE9hD,OAAQqB,IAClBygD,EAAEzgD,GAAKmgD,GAAOM,EAAEzgD,EAAI,GAAKygD,EAAEzgD,EAAI,GAAKygD,EAAEzgD,EAAI,IAAMygD,EAAEzgD,EAAI,IAAK,OAEzDjG,EAAIvD,KAAKorC,EAAE,GACXz7B,EAAI3P,KAAKorC,EAAE,GACXx7B,EAAI5P,KAAKorC,EAAE,GACXoc,EAAIxnD,KAAKorC,EAAE,GACX7X,EAAIvzB,KAAKorC,EAAE,OAEV5hC,EAAI,EAAGA,EAAIygD,EAAE9hD,OAAQqB,IAAK,KACzBkmB,KAAOlmB,EAAI,IACXulC,EAAI8a,GAAQF,GAAOpmD,EAAG,GAAIumD,GAAKp6B,EAAG/f,EAAGC,EAAG43C,GAAIj0B,EAAG02B,EAAEzgD,GAAIugD,GAAOr6B,IAChE6D,EAAIi0B,EACJA,EAAI53C,EACJA,EAAI+5C,GAAOh6C,EAAG,IACdA,EAAIpM,EACJA,EAAIwrC,OAGD3D,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAI7nC,QACxB6nC,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIz7B,QACxBy7B,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIx7B,QACxBw7B,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIoc,QACxBpc,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAI7X,IAG/By2B,GAAKriD,UAAUyhD,QAAU,SAAgB9B,SAC3B,QAARA,EACKe,GAAM8B,QAAQnqD,KAAKorC,EAAG,OAEtBid,GAAM+B,QAAQpqD,KAAKorC,EAAG;CCtEjC,IAAIid,GAAQ/nD,GACR83B,GAASx2B,GACT8nD,GAAYrmD,GACZqjD,GAAShjD,GAETkmD,GAAQvB,GAAMuB,MACdS,GAAUhC,GAAMgC,QAChBR,GAAUxB,GAAMwB,QAChBP,GAAOI,GAAUJ,KACjBE,GAAQE,GAAUF,MAClBc,GAASZ,GAAUY,OACnBC,GAASb,GAAUa,OACnBC,GAASd,GAAUc,OACnBC,GAASf,GAAUe,OAEnBnC,GAAYlwB,GAAOkwB,UAEnBoC,GAAW,CACb,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY;CAGtC,SAASC,UACD3qD,gBAAgB2qD,IACpB,OAAO,IAAIA,GAEbrC,GAAUxnD,KAAKd,WACVorC,EAAI,CACP,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,iBAEjCjiB,EAAIuhC,QACJT,EAAI,IAAIv9C,MAAM,OAEfs6C,SAAS2D,GAAQrC,QACvBsC,GAAiBD,MAEVnC,UAAY,OACZC,QAAU,OACVC,aAAe,OACfC,UAAY,MAEZhhD,UAAUshD,QAAU,SAAiBtX,EAAK3oB,WAC3CihC,EAAIjqD,KAAKiqD,EAEJzgD,EAAI,EAAGA,EAAI,GAAIA,IACtBygD,EAAEzgD,GAAKmoC,EAAI3oB,EAAQxf,QACdA,EAAIygD,EAAE9hD,OAAQqB,IACnBygD,EAAEzgD,GAAK6gD,GAAQI,GAAOR,EAAEzgD,EAAI,IAAKygD,EAAEzgD,EAAI,GAAIghD,GAAOP,EAAEzgD,EAAI,KAAMygD,EAAEzgD,EAAI;KAElEjG,EAAIvD,KAAKorC,EAAE,GACXz7B,EAAI3P,KAAKorC,EAAE,GACXx7B,EAAI5P,KAAKorC,EAAE,GACXoc,EAAIxnD,KAAKorC,EAAE,GACX7X,EAAIvzB,KAAKorC,EAAE,GACXlnC,EAAIlE,KAAKorC,EAAE,GACXyf,EAAI7qD,KAAKorC,EAAE,GACXA,EAAIprC,KAAKorC,EAAE,OAEfsb,GAAO1mD,KAAKmpB,EAAEhhB,SAAW8hD,EAAE9hD,QACtBqB,EAAI,EAAGA,EAAIygD,EAAE9hD,OAAQqB,IAAK,KACzBshD,EAAKjB,GAAQze,EAAGmf,GAAOh3B,GAAI+1B,GAAK/1B,EAAGrvB,EAAG2mD,GAAI7qD,KAAKmpB,EAAE3f,GAAIygD,EAAEzgD,IACvDuhD,EAAKnB,GAAMU,GAAO/mD,GAAIimD,GAAMjmD,EAAGoM,EAAGC,IACtCw7B,EAAIyf,EACJA,EAAI3mD,EACJA,EAAIqvB,EACJA,EAAIq2B,GAAMpC,EAAGsD,GACbtD,EAAI53C,EACJA,EAAID,EACJA,EAAIpM,EACJA,EAAIqmD,GAAMkB,EAAIC,QAGX3f,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAI7nC,QACxB6nC,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIz7B,QACxBy7B,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIx7B,QACxBw7B,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIoc,QACxBpc,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAI7X,QACxB6X,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIlnC,QACxBknC,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIyf,QACxBzf,EAAE,GAAKwe,GAAM5pD,KAAKorC,EAAE,GAAIA;GAGxBzjC,UAAUyhD,QAAU,SAAgB9B,SAC7B,QAARA,EACKe,GAAM8B,QAAQnqD,KAAKorC,EAAG,OAEtBid,GAAM+B,QAAQpqD,KAAKorC,EAAG,QCrGjC,IAAIid,GAAQ/nD,GACRqqD,GAAS/oD,GAEb,SAASopD,UACDhrD,gBAAgBgrD,IACpB,OAAO,IAAIA,GAEbL,GAAO7pD,KAAKd,WACPorC,EAAI,CACP,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,eAElC4b,SAASgE,GAAQL,QACvBM,GAAiBD,GAEjBA,GAAOxC,UAAY,IACnBwC,GAAOvC,QAAU,IACjBuC,GAAOtC,aAAe,IACtBsC,GAAOrC,UAAY,GAEnBqC,GAAOrjD,UAAUyhD,QAAU,SAAgB9B,SAE7B,QAARA,EACKe,GAAM8B,QAAQnqD,KAAKorC,EAAE1pC,MAAM,EAAG,GAAI,OAElC2mD,GAAM+B,QAAQpqD,KAAKorC,EAAE1pC,MAAM,EAAG,GAAI;CCzB7C,IAAI2mD,GAAQ/nD,GACR83B,GAASx2B,GACT8kD,GAASrjD,GAET6nD,GAAY7C,GAAM6C,UAClBC,GAAY9C,GAAM8C,UAClBC,GAAW/C,GAAM+C,SACjBC,GAAWhD,GAAMgD,SACjBC,GAAQjD,GAAMiD,MACdC,GAAWlD,GAAMkD,SACjBC,GAAWnD,GAAMmD,SACjBC,GAAapD,GAAMoD,WACnBC,GAAarD,GAAMqD,WACnBC,GAAatD,GAAMsD,WACnBC,GAAavD,GAAMuD,WAEnBtD,GAAYlwB,GAAOkwB,UAEnBuD,GAAW,CACb,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY;CAGtC,SAASC,UACD9rD,gBAAgB8rD,IACpB,OAAO,IAAIA,GAEbxD,GAAUxnD,KAAKd,WACVorC,EAAI,CACP,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,UACZ,UAAY,WACZ,WAAY,gBACTjiB,EAAI0iC,QACJ5B,EAAI,IAAIv9C,MAAM,QAEfs6C,SAAS8E,GAAQxD,QACvByD,GAAiBD,GAsIjB,SAASE,GAAQC,EAAIC,EAAIC,EAAIC,EAAIC,OAC3BplC,EAAKglC,EAAKE,GAASF,EAAMI,SACzBplC,EAAI,IACNA,GAAK,YACAA,EAGT,SAASqlC,GAAQL,EAAIC,EAAIC,EAAIC,EAAIC,EAAIE,OAC/BtlC,EAAKilC,EAAKE,GAASF,EAAMK,SACzBtlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAASulC,GAASP,EAAIC,EAAIC,EAAIC,EAAIC,OAC5BplC,EAAKglC,EAAKE,EAAOF,EAAKI,EAAOF,EAAKE;QAClCplC,EAAI,IACNA,GAAK,YACAA,EAGT,SAASwlC,GAASR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIE,OAChCtlC,EAAKilC,EAAKE,EAAOF,EAAKK,EAAOH,EAAKG,SAClCtlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAASylC,GAAUT,EAAIC,OAKjBjlC,EAJQikC,GAAUe,EAAIC,EAAI,IAClBhB,GAAUgB,EAAID,EAAI,GAClBf,GAAUgB,EAAID,EAAI,UAG1BhlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAAS0lC,GAAUV,EAAIC,OAKjBjlC,EAJQkkC,GAAUc,EAAIC,EAAI,IAClBf,GAAUe,EAAID,EAAI,GAClBd,GAAUe,EAAID,EAAI,UAG1BhlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAAS2lC,GAAUX,EAAIC,OAKjBjlC,EAJQikC,GAAUe,EAAIC,EAAI,IAClBhB,GAAUe,EAAIC,EAAI,IAClBhB,GAAUgB,EAAID,EAAI,UAG1BhlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAAS4lC,GAAUZ,EAAIC,OAKjBjlC,EAJQkkC,GAAUc,EAAIC,EAAI,IAClBf,GAAUc,EAAIC,EAAI,IAClBf,GAAUe,EAAID,EAAI,UAG1BhlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAAS6lC,GAAUb,EAAIC,OAKjBjlC,EAJQikC,GAAUe,EAAIC,EAAI,GAClBhB,GAAUe,EAAIC,EAAI,GAClBd,GAASa,EAAIC,EAAI;QAGzBjlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAAS8lC,GAAUd,EAAIC,OAKjBjlC,EAJQkkC,GAAUc,EAAIC,EAAI,GAClBf,GAAUc,EAAIC,EAAI,GAClBb,GAASY,EAAIC,EAAI,UAGzBjlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAAS+lC,GAAUf,EAAIC,OAKjBjlC,EAJQikC,GAAUe,EAAIC,EAAI,IAClBhB,GAAUgB,EAAID,EAAI,IAClBb,GAASa,EAAIC,EAAI,UAGzBjlC,EAAI,IACNA,GAAK,YACAA,EAGT,SAASgmC,GAAUhB,EAAIC,OAKjBjlC,EAJQkkC,GAAUc,EAAIC,EAAI,IAClBf,GAAUe,EAAID,EAAI,IAClBZ,GAASY,EAAIC,EAAI,UAGzBjlC,EAAI,IACNA,GAAK,YACAA,KArPFuhC,UAAY,QACZC,QAAU,OACVC,aAAe,OACfC,UAAY,OAEZhhD,UAAUulD,cAAgB,SAAuBvb,EAAK3oB,WACvDihC,EAAIjqD,KAAKiqD,EAGJzgD,EAAI,EAAGA,EAAI,GAAIA,IACtBygD,EAAEzgD,GAAKmoC,EAAI3oB,EAAQxf,QACdA,EAAIygD,EAAE9hD,OAAQqB,GAAK,EAAG;IACvB2jD,EAAQH,GAAU/C,EAAEzgD,EAAI,GAAIygD,EAAEzgD,EAAI,IAClC4jD,EAAQH,GAAUhD,EAAEzgD,EAAI,GAAIygD,EAAEzgD,EAAI,IAClC6jD,EAAQpD,EAAEzgD,EAAI,IACd8jD,EAAQrD,EAAEzgD,EAAI,IACd+jD,EAAQT,GAAU7C,EAAEzgD,EAAI,IAAKygD,EAAEzgD,EAAI,KACnCgkD,EAAQT,GAAU9C,EAAEzgD,EAAI,IAAKygD,EAAEzgD,EAAI,KACnCikD,EAAQxD,EAAEzgD,EAAI,IACdkkD,EAAQzD,EAAEzgD,EAAI,IAElBygD,EAAEzgD,GAAKiiD,GACL0B,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,GACTzD,EAAEzgD,EAAI,GAAKkiD,GACTyB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,QAIN/lD,UAAUshD,QAAU,SAAiBtX,EAAK3oB,QAC1CkkC,cAAcvb,EAAK3oB,OAEpBihC,EAAIjqD,KAAKiqD,EAETxC,EAAKznD,KAAKorC,EAAE,GACZsc,EAAK1nD,KAAKorC,EAAE,GACZuc,EAAK3nD,KAAKorC,EAAE,GACZ0c,EAAK9nD,KAAKorC,EAAE,GACZ1W,EAAK10B,KAAKorC,EAAE,GACZ2c,EAAK/nD,KAAKorC,EAAE,GACZ4c,EAAKhoD,KAAKorC,EAAE,GACZ6c,EAAKjoD,KAAKorC,EAAE,GACZ+c,EAAKnoD,KAAKorC,EAAE,GACZniC,EAAKjJ,KAAKorC,EAAE,GACZuiB,EAAK3tD,KAAKorC,EAAE,IACZwiB,EAAK5tD,KAAKorC,EAAE,IACZyiB,EAAK7tD,KAAKorC,EAAE,IACZ0iB,EAAK9tD,KAAKorC,EAAE,IACZ2iB,EAAK/tD,KAAKorC,EAAE,IACZ4iB,EAAKhuD,KAAKorC,EAAE,IAEhBsb,GAAO1mD,KAAKmpB,EAAEhhB,SAAW8hD,EAAE9hD;KACtB,IAAIqB,EAAI,EAAGA,EAAIygD,EAAE9hD,OAAQqB,GAAK,EAAG,KAChC2jD,EAAQY,EACRX,EAAQY,EACRX,EAAQT,GAAUzE,EAAIl/C,GACtBqkD,EAAQT,GAAU1E,EAAIl/C,GACtBskD,EAAQvB,GAAQ7D,EAAIl/C,EAAI0kD,EAAIC,EAAIC,GAChCL,EAAQlB,GAAQnE,EAAIl/C,EAAI0kD,EAAIC,EAAIC,EAAIC,GACpCL,EAAQztD,KAAKmpB,EAAE3f,GACfkkD,EAAQ1tD,KAAKmpB,EAAE3f,EAAI,GACnBykD,EAAQhE,EAAEzgD,GACV0kD,EAAQjE,EAAEzgD,EAAI,GAEd2kD,EAAQxC,GACVwB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPO,EAAOC,GACLE,EAAQxC,GACVuB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPO,EAAOC,GAETf,EAAQT,GAAUjF,EAAIC,GACtB0F,EAAQT,GAAUlF,EAAIC,GACtB2F,EAAQb,GAAS/E,EAAIC,EAAIC,EAAIG,EAAIpzB,GACjC44B,EAAQb,GAAShF,EAAIC,EAAIC,EAAIG,EAAIpzB,EAAIqzB,OAEjCsG,EAAQ9C,GAAS4B,EAAOC,EAAOC,EAAOC,GACtCgB,EAAQ9C,GAAS2B,EAAOC,EAAOC,EAAOC,GAE1CS,EAAKF,EACLG,EAAKF,EAELD,EAAKF,EACLG,EAAKF,EAELD,EAAKxF,EACLyF,EAAK3kD,EAELk/C,EAAKoD,GAASvD,EAAIC,EAAIkG,EAAOC,GAC7BnlD,EAAKuiD,GAASvD,EAAIA,EAAIkG,EAAOC,GAE7BpG,EAAKtzB,EACLuzB,EAAKF,EAELrzB,EAAKizB,EACLI,EAAKD,EAELH,EAAKF,EACLK,EAAKJ,EAELD,EAAK8D,GAAS4C,EAAOC,EAAOC,EAAOC,GACnC5G,EAAK8D,GAAS2C,EAAOC,EAAOC,EAAOC,GAGrChD,GAAMtrD,KAAKorC,EAAG,EAAGqc,EAAIC,GACrB4D,GAAMtrD,KAAKorC,EAAG,EAAGuc,EAAIG,GACrBwD,GAAMtrD,KAAKorC,EAAG,EAAG1W,EAAIqzB,GACrBuD,GAAMtrD,KAAKorC,EAAG,EAAG4c,EAAIC,GACrBqD,GAAMtrD,KAAKorC,EAAG,EAAG+c,EAAIl/C,GACrBqiD,GAAMtrD,KAAKorC,EAAG,GAAIuiB,EAAIC;AACtBtC,GAAMtrD,KAAKorC,EAAG,GAAIyiB,EAAIC,GACtBxC,GAAMtrD,KAAKorC,EAAG,GAAI2iB,EAAIC,OAGjBrmD,UAAUyhD,QAAU,SAAgB9B,SAC7B,QAARA,EACKe,GAAM8B,QAAQnqD,KAAKorC,EAAG,OAEtBid,GAAM+B,QAAQpqD,KAAKorC,EAAG,QClNjC,IAAIid,GAAQ/nD,GAERwrD,GAASlqD,GAEb,SAAS2sD,UACDvuD,gBAAgBuuD,IACpB,OAAO,IAAIA,GAEbzC,GAAOhrD,KAAKd,WACPorC,EAAI,CACP,WAAY,WACZ,WAAY,UACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,eAEV4b,SAASuH,GAAQzC,QACvB0C,GAAiBD,GAEjBA,GAAO/F,UAAY,KACnB+F,GAAO9F,QAAU,IACjB8F,GAAO7F,aAAe;AACtB6F,GAAO5F,UAAY,IAEnB4F,GAAO5mD,UAAUyhD,QAAU,SAAgB9B,SAC7B,QAARA,EACKe,GAAM8B,QAAQnqD,KAAKorC,EAAE1pC,MAAM,EAAG,IAAK,OAEnC2mD,GAAM+B,QAAQpqD,KAAKorC,EAAE1pC,MAAM,EAAG,IAAK,gBC/B/BpB,aACEsB,aACAyB,aACAK,aACAC,aCJb0kD,GAAQ/nD,GACR83B,GAASx2B,GAET+nD,GAAStB,GAAMsB,OACfC,GAAQvB,GAAMuB,MACd6E,GAAUpG,GAAMoG,QAChBpE,GAAUhC,GAAMgC,QAChB/B,GAAYlwB,GAAOkwB,UAEvB,SAASoG,UACD1uD,gBAAgB0uD,IACpB,OAAO,IAAIA,GAEbpG,GAAUxnD,KAAKd,WAEVorC,EAAI,CAAE,WAAY,WAAY,WAAY,UAAY,iBACtDmc,OAAS,SA0DhB,SAASrjD,GAAEmxB,EAAGrR,EAAGulC,EAAG/1B;OACd6B,GAAK,GACArR,EAAIulC,EAAI/1B,EACR6B,GAAK,GACJrR,EAAIulC,GAAQvlC,EAAKwP,EAClB6B,GAAK,IACJrR,GAAMulC,GAAM/1B,EACb6B,GAAK,GACJrR,EAAIwP,EAAM+1B,GAAM/1B,EAEjBxP,GAAKulC,GAAM/1B,GAGtB,SAASm7B,GAAEt5B,UACLA,GAAK,GACA,EACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,WAGX,SAASu5B,GAAGv5B,UACNA,GAAK,GACA,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,KA5FL2xB,SAAS0H,GAAWpG,iBACNoG,GAEpBA,GAAUlG,UAAY,IACtBkG,GAAUjG,QAAU,IACpBiG,GAAUhG,aAAe,IACzBgG,GAAU/F,UAAY,GAEtB+F,GAAU/mD,UAAUshD,QAAU,SAAgBtX,EAAK3oB,WAC7CsK,EAAItzB,KAAKorC,EAAE,GACXyjB,EAAI7uD,KAAKorC,EAAE,GACXn7B,EAAIjQ,KAAKorC,EAAE,GACX0jB,EAAI9uD,KAAKorC,EAAE,GACX7U,EAAIv2B,KAAKorC,EAAE,GACX2jB,EAAKz7B,EACL07B,EAAKH,EACLI,EAAKh/C,EACLi/C,EAAKJ,EACLK,EAAK54B,EACAlB,EAAI,EAAGA,EAAI,GAAIA,IAAK;IACvB+5B,EAAIxF,GACND,GACEU,GAAQ/2B,EAAGpvB,GAAEmxB,EAAGw5B,EAAG5+C,EAAG6+C,GAAInd,EAAI1qB,GAAEoO,GAAKrM,GAAQ2lC,GAAEt5B,IAC/C3F,GAAE2F,IACJkB,GACFjD,EAAIiD,EACJA,EAAIu4B,EACJA,EAAInF,GAAO15C,EAAG,IACdA,EAAI4+C,EACJA,EAAIO,EACJA,EAAIxF,GACFD,GACEU,GAAQ0E,EAAI7qD,GAAE,GAAKmxB,EAAG25B,EAAIC,EAAIC,GAAKvd,EAAI0d,GAAGh6B,GAAKrM,GAAQ4lC,GAAGv5B,IAC1Di6B,GAAGj6B,IACL85B,GACFJ,EAAKI,EACLA,EAAKD,EACLA,EAAKvF,GAAOsF,EAAI,IAChBA,EAAKD,EACLA,EAAKI,EAEPA,EAAIX,GAAQzuD,KAAKorC,EAAE,GAAIn7B,EAAGi/C,QACrB9jB,EAAE,GAAKqjB,GAAQzuD,KAAKorC,EAAE,GAAI0jB,EAAGK,QAC7B/jB,EAAE,GAAKqjB,GAAQzuD,KAAKorC,EAAE,GAAI7U,EAAGw4B,QAC7B3jB,EAAE,GAAKqjB,GAAQzuD,KAAKorC,EAAE,GAAI9X,EAAG07B,QAC7B5jB,EAAE,GAAKqjB,GAAQzuD,KAAKorC,EAAE,GAAIyjB,EAAGI,QAC7B7jB,EAAE,GAAKgkB,GAGdV,GAAU/mD,UAAUyhD,QAAU,SAAgB9B,SAChC,QAARA,EACKe,GAAM8B,QAAQnqD,KAAKorC,EAAG,UAEtBid,GAAM+B,QAAQpqD,KAAKorC,EAAG;CA0CjC,IAAInkB,GAAI,CACN,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhDooC,GAAK,CACP,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhD3/B,GAAI,CACN,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnD4/B,GAAK,CACP,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,IC9IlDjH,GAAQ/nD,GACRomD,GAAS9kD;CAEb,SAAS2tD,GAAKC,EAAMxsD,EAAKskD,QACjBtnD,gBAAgBuvD,IACpB,OAAO,IAAIA,GAAKC,EAAMxsD,EAAKskD,QACxBmI,KAAOD,OACPhH,UAAYgH,EAAKhH,UAAY,OAC7BC,QAAU+G,EAAK/G,QAAU,OACzBiH,MAAQ,UACRC,MAAQ,UAERC,MAAMvH,GAAMU,QAAQ/lD,EAAKskD,QAEhCuI,GAAiBN,GAEjBA,GAAK5nD,UAAUioD,MAAQ,SAAc5sD,GAE/BA,EAAImF,OAASnI,KAAKwoD,YACpBxlD,GAAM,IAAIhD,KAAKyvD,MAAO3G,OAAO9lD,GAAKkmD,UACpCxC,GAAO1jD,EAAImF,QAAUnI,KAAKwoD,eAGrB,IAAIh/C,EAAIxG,EAAImF,OAAQqB,EAAIxJ,KAAKwoD,UAAWh/C,IAC3CxG,EAAIoC,KAAK,OAENoE,EAAI,EAAGA,EAAIxG,EAAImF,OAAQqB,IAC1BxG,EAAIwG,IAAM,YACPkmD,OAAQ,IAAI1vD,KAAKyvD,MAAO3G,OAAO9lD,GAG/BwG,EAAI,EAAGA,EAAIxG,EAAImF,OAAQqB,IAC1BxG,EAAIwG,IAAM;MACPmmD,OAAQ,IAAI3vD,KAAKyvD,MAAO3G,OAAO9lD,IAGtCusD,GAAK5nD,UAAUmhD,OAAS,SAAgBnX,EAAK2V,eACtCoI,MAAM5G,OAAOnX,EAAK2V,GAChBtnD,MAGTuvD,GAAK5nD,UAAUuhD,OAAS,SAAgB5B,eACjCqI,MAAM7G,OAAO9oD,KAAK0vD,MAAMxG,UACtBlpD,KAAK2vD,MAAMzG,OAAO5B,oBC7CvBkI,EAAOlmC,EAEXkmC,EAAKnH,MAAQ/nD,GACbkvD,EAAKp3B,OAASx2B,GACd4tD,EAAKM,IAAMzsD,GACXmsD,EAAKO,OAASrsD,GACd8rD,EAAKK,KAAOlsD,GAGZ6rD,EAAKQ,KAAOR,EAAKM,IAAIE,KACrBR,EAAKS,OAAST,EAAKM,IAAIG,OACvBT,EAAKU,OAASV,EAAKM,IAAII,OACvBV,EAAKW,OAASX,EAAKM,IAAIK,OACvBX,EAAKY,OAASZ,EAAKM,IAAIM,OACvBZ,EAAKa,UAAYb,EAAKO,OAAOM,eCd7B,IAAI9+C,GAAIjR,GAEJ+H,GAAQ1I,KAAK0I,MACby1B,GAAMn+B,KAAKm+B,IACXwyB,GAAQ3wD,KAAK2wD,SAIf,CAAEjmD,OAAQ,OAAQoB,MAAM;EAAQ,CAChC8kD,MAAO,SAAevsC,GACpB,OAAQA,KAAO,GAAK,GAAK3b,GAAMy1B,GAAI9Z,EAAI,IAAOssC,IAAS,MCV3D,IAAI/+C,GAAIjR,GACJJ,GAAQ0B,EAGR4uD,GAAQ7wD,KAAK8wD,QASf,CAAEpmD,OAAQ,OAAQoB,MAAM,EAAMC,OAPnBxL,IAAM,WACjB,OAAgC,GAAzBswD,GAAM,WAAY,IAA4B,GAAhBA,GAAMroD,WAMK,CAChDsoD,KAAM,SAAczsC,EAAGulC,GACrB,IAAImH,EAAS,MACTC,GAAM3sC,EACN4sC,GAAMrH,EACN2C,EAAKwE,EAASC,EACdvE,EAAKsE,EAASE,EAClB,OAAO,EAAI1E,EAAKE,IAAOsE,EAASC,IAAO,IAAMvE,EAAKF,GAAMwE,EAASE,IAAO,KAAO,KAAO,oCCpB/E5hC,EAAQ1F,YAIRo9B,EAAQjkD,EAAKkvC,OACflvC,EAAK,MAAM,IAAIkoB,MAAMgnB,GAAO,6BAK1BqV,EAAUt5B,EAAMm5B,GACvBn5B,EAAKo5B,OAASD,MACVE,EAAW,aACfA,EAASp/C,UAAYk/C,EAAUl/C,UAC/B+lB,EAAK/lB,UAAY,IAAIo/C,EACrBr5B,EAAK/lB,UAAUuI,YAAcwd;SAKtBmjC,EAAInzB,EAAQ4N,EAAMic,MACrBsJ,EAAGC,KAAKpzB,UACHA,OAGJqzB,SAAW,OACXC,MAAQ,UACR7oD,OAAS,OAGT8oD,IAAM,KAEI,OAAXvzB,IACW,OAAT4N,GAA0B,OAATA,IACnBic,EAASjc,EACTA,EAAO,SAGJskB,MAAMlyB,GAAU,EAAG4N,GAAQ,GAAIic,GAAU,WAY9C2J,EATkB,WAAlB/kC,EAAO6C,GACTA,EAAO1F,QAAUunC,EAEjBvnC,EAAQunC,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGM,SAAW,OAKVD,EADoB,oBAAXpxD,aAAmD,IAAlBA,OAAOoxD,OACxCpxD,OAAOoxD,OAEP5wD,GAAkB4wD,OAE7B,MAAO39B,aAgIA69B,EAAetmD,EAAQlC,OAC1BgH,EAAI9E,EAAOyP,WAAW3R,UAEtBgH,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,YAIbyhD,EAAcvmD,EAAQwmD,EAAY1oD,OACrCqe,EAAImqC,EAActmD,EAAQlC,UAC1BA,EAAQ,GAAK0oD,IACfrqC,GAAKmqC,EAActmD,EAAQlC,EAAQ,IAAM,GAEpCqe;SA8CAsqC,EAAWhhC,EAAKvH,EAAOC,EAAKuoC,WAC/BvqC,EAAI,EACJqP,EAAM32B,KAAK6I,IAAI+nB,EAAIpoB,OAAQ8gB,GACtBzf,EAAIwf,EAAOxf,EAAI8sB,EAAK9sB,IAAK,KAC5BoG,EAAI2gB,EAAIhW,WAAW/Q,GAAK,GAE5Byd,GAAKuqC,EAIHvqC,GADErX,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,SAGFqX,EAnNT4pC,EAAGC,KAAO,SAAe1I,UACnBA,aAAeyI,GAIJ,OAARzI,GAA+B,WAAfj8B,EAAOi8B,IAC5BA,EAAIl4C,YAAYihD,WAAaN,EAAGM,UAAYzkD,MAAMD,QAAQ27C,EAAI4I,QAGlEH,EAAGnoD,IAAM,SAAcy8B,EAAMC,UACvBD,EAAKssB,IAAIrsB,GAAS,EAAUD,EACzBC,GAGTyrB,EAAGroD,IAAM,SAAc28B,EAAMC,UACvBD,EAAKssB,IAAIrsB,GAAS,EAAUD,EACzBC,GAGTyrB,EAAGlpD,UAAUioD,MAAQ,SAAelyB,EAAQ4N,EAAMic,MAC1B,iBAAX7pB,SACF19B,KAAK0xD,YAAYh0B,EAAQ4N,EAAMic,MAGlB,WAAlBp7B,EAAOuR,UACF19B,KAAK2xD,WAAWj0B,EAAQ4N,EAAMic;CAG1B,QAATjc,IACFA,EAAO,IAETob,EAAOpb,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,QAG/CtiB,EAAQ,EACM,OAFlB0U,EAASA,EAAOl8B,WAAWuJ,QAAQ,OAAQ,KAEhC,KACTie,SACK+nC,SAAW,GAGd/nC,EAAQ0U,EAAOv1B,SACJ,KAATmjC,OACGsmB,UAAUl0B,EAAQ1U,EAAOu+B,SAEzBsK,WAAWn0B,EAAQ4N,EAAMtiB,GACf,OAAXu+B,QACGoK,WAAW3xD,KAAK+oD,UAAWzd,EAAMic,MAM9CsJ,EAAGlpD,UAAU+pD,YAAc,SAAsBh0B,EAAQ4N,EAAMic,GACzD7pB,EAAS,SACNqzB,SAAW,EAChBrzB,GAAUA,GAERA,EAAS,eACNszB,MAAQ,CAAW,SAATtzB,QACVv1B,OAAS,GACLu1B,EAAS,uBACbszB,MAAQ,CACF,SAATtzB,EACCA,EAAS,SAAa,eAEpBv1B,OAAS,IAEdu+C,EAAOhpB,EAAS;KACXszB,MAAQ,CACF,SAATtzB,EACCA,EAAS,SAAa,SACvB,QAEGv1B,OAAS,GAGD,OAAXo/C,QAGCoK,WAAW3xD,KAAK+oD,UAAWzd,EAAMic,IAGxCsJ,EAAGlpD,UAAUgqD,WAAa,SAAqBj0B,EAAQ4N,EAAMic,MAE3Db,EAAgC,iBAAlBhpB,EAAOv1B,QACjBu1B,EAAOv1B,QAAU,cACd6oD,MAAQ,CAAE,QACV7oD,OAAS,EACPnI,UAGJmI,OAASxI,KAAKyI,KAAKs1B,EAAOv1B,OAAS,QACnC6oD,MAAQ,IAAItkD,MAAM1M,KAAKmI,YACvB,IAAIqB,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,SAC1BwnD,MAAMxnD,GAAK,MAGd6rB,EAAGoT,EACHqpB,EAAM,KACK,OAAXvK,MACG/9C,EAAIk0B,EAAOv1B,OAAS,EAAGktB,EAAI,EAAG7rB,GAAK,EAAGA,GAAK,EAC9Ci/B,EAAI/K,EAAOl0B,GAAMk0B,EAAOl0B,EAAI,IAAM,EAAMk0B,EAAOl0B,EAAI,IAAM,QACpDwnD,MAAM37B,IAAOoT,GAAKqpB,EAAO,cACzBd,MAAM37B,EAAI,GAAMoT,IAAO,GAAKqpB,EAAQ;CACzCA,GAAO,KACI,KACTA,GAAO,GACPz8B,UAGC,GAAe,OAAXkyB,MACJ/9C,EAAI,EAAG6rB,EAAI,EAAG7rB,EAAIk0B,EAAOv1B,OAAQqB,GAAK,EACzCi/B,EAAI/K,EAAOl0B,GAAMk0B,EAAOl0B,EAAI,IAAM,EAAMk0B,EAAOl0B,EAAI,IAAM,QACpDwnD,MAAM37B,IAAOoT,GAAKqpB,EAAO,cACzBd,MAAM37B,EAAI,GAAMoT,IAAO,GAAKqpB,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPz8B,YAICr1B,KAAK+xD,SAyBdlB,EAAGlpD,UAAUiqD,UAAY,SAAoBl0B,EAAQ1U,EAAOu+B,QAErDp/C,OAASxI,KAAKyI,MAAMs1B,EAAOv1B,OAAS6gB,GAAS,QAC7CgoC,MAAQ,IAAItkD,MAAM1M,KAAKmI,YACvB,IAAIqB,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,SAC1BwnD,MAAMxnD,GAAK,MAOdi/B,EAHAqpB,EAAM,EACNz8B,EAAI,KAGO,OAAXkyB,MACG/9C,EAAIk0B,EAAOv1B,OAAS,EAAGqB,GAAKwf,EAAOxf,GAAK,EAC3Ci/B,EAAI4oB,EAAa3zB,EAAQ1U,EAAOxf,IAAMsoD,OACjCd,MAAM37B,IAAU,SAAJoT,EACbqpB,GAAO,IACTA,GAAO,GACPz8B,GAAK;KACA27B,MAAM37B,IAAMoT,IAAM,IAEvBqpB,GAAO,WAKNtoD,GADak0B,EAAOv1B,OAAS6gB,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOxf,EAAIk0B,EAAOv1B,OAAQqB,GAAK,EAC1Ei/B,EAAI4oB,EAAa3zB,EAAQ1U,EAAOxf,IAAMsoD,OACjCd,MAAM37B,IAAU,SAAJoT,EACbqpB,GAAO,IACTA,GAAO,GACPz8B,GAAK,OACA27B,MAAM37B,IAAMoT,IAAM,IAEvBqpB,GAAO,OAKRC,SA2BPlB,EAAGlpD,UAAUkqD,WAAa,SAAqBn0B,EAAQ4N,EAAMtiB,QAEtDgoC,MAAQ,CAAE,QACV7oD,OAAS,MAGT,IAAI6pD,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW3mB,EAClE0mB,IAEFA,IACAC,EAAWA,EAAU3mB,EAAQ,UAEzBqT,EAAQjhB,EAAOv1B,OAAS6gB,EACxBkpC,EAAMvT,EAAQqT,EACd/oC,EAAMtpB,KAAK6I,IAAIm2C,EAAOA,EAAQuT,GAAOlpC,EAErCo+B,EAAO,EACF59C,EAAIwf,EAAOxf,EAAIyf,EAAKzf,GAAKwoD,EAChC5K,EAAOmK,EAAU7zB,EAAQl0B,EAAGA,EAAIwoD,EAAS1mB,QAEpC6mB,MAAMF,GACPjyD,KAAKgxD,MAAM,GAAK5J,EAAO,cACpB4J,MAAM,IAAM5J,OAEZgL,OAAOhL,MAIJ,IAAR8K,EAAW,KACTr0B,EAAM,MACVupB,EAAOmK,EAAU7zB,EAAQl0B,EAAGk0B,EAAOv1B,OAAQmjC;AAEtC9hC,EAAI,EAAGA,EAAI0oD,EAAK1oD,IACnBq0B,GAAOyN,OAGJ6mB,MAAMt0B,GACP79B,KAAKgxD,MAAM,GAAK5J,EAAO,cACpB4J,MAAM,IAAM5J,OAEZgL,OAAOhL,QAIX2K,SAGPlB,EAAGlpD,UAAUm4C,KAAO,SAAeuS,GACjCA,EAAKrB,MAAQ,IAAItkD,MAAM1M,KAAKmI,YACvB,IAAIqB,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,IAC/B6oD,EAAKrB,MAAMxnD,GAAKxJ,KAAKgxD,MAAMxnD,GAE7B6oD,EAAKlqD,OAASnI,KAAKmI,OACnBkqD,EAAKtB,SAAW/wD,KAAK+wD,SACrBsB,EAAKpB,IAAMjxD,KAAKixD,KAGlBJ,EAAGlpD,UAAU2qD,MAAQ,eACfrrC,EAAI,IAAI4pC,EAAG,kBACV/Q,KAAK74B,GACHA,GAGT4pC,EAAGlpD,UAAU4qD,QAAU,SAAkBj4C,QAChCta,KAAKmI,OAASmS,QACd02C,MAAMhxD,KAAKmI,UAAY,SAEvBnI,MAIT6wD,EAAGlpD,UAAUoqD,MAAQ;KACZ/xD,KAAKmI,OAAS,GAAqC,IAAhCnI,KAAKgxD,MAAMhxD,KAAKmI,OAAS,SAC5CA,gBAEAnI,KAAKwyD,aAGd3B,EAAGlpD,UAAU6qD,UAAY,kBAEH,IAAhBxyD,KAAKmI,QAAkC,IAAlBnI,KAAKgxD,MAAM,UAC7BD,SAAW,GAEX/wD,MAGT6wD,EAAGlpD,UAAU8qD,QAAU,kBACbzyD,KAAKixD,IAAM,UAAY,SAAWjxD,KAAKwB,SAAS,IAAM;KAiC5DkxD,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU;UAsjBrDC,EAAY9yD,EAAMqoD,EAAKtP,GAC9BA,EAAIiY,SAAW3I,EAAI2I,SAAWhxD,EAAKgxD,aAC/Bz6B,EAAOv2B,EAAKoI,OAASigD,EAAIjgD,OAAU,EACvC2wC,EAAI3wC,OAASmuB,EACbA,EAAOA,EAAM,EAAK,MAGd/yB,EAAoB,EAAhBxD,EAAKixD,MAAM,GACfrhD,EAAmB,EAAfy4C,EAAI4I,MAAM,GACd/pC,EAAI1jB,EAAIoM,EAERi4C,EAAS,SAAJ3gC,EACLihC,EAASjhC,EAAI,SAAa,EAC9B6xB,EAAIkY,MAAM,GAAKpJ,MAEV,IAAIz+B,EAAI,EAAGA,EAAImN,EAAKnN,IAAK,SAGxB2pC,EAAS5K,IAAU,GACnB6K,EAAgB,SAAR7K,EACR8K,EAAOrzD,KAAK6I,IAAI2gB,EAAGi/B,EAAIjgD,OAAS,GAC3BktB,EAAI11B,KAAK+I,IAAI,EAAGygB,EAAIppB,EAAKoI,OAAS,GAAIktB,GAAK29B,EAAM39B,IAAK,KACzD7rB,EAAK2f,EAAIkM,EAAK,EAIlBy9B,IADA7rC,GAFA1jB,EAAoB,EAAhBxD,EAAKixD,MAAMxnD,KACfmG,EAAmB,EAAfy4C,EAAI4I,MAAM37B,IACF09B,GACG,SAAa,EAC5BA,EAAY,SAAJ9rC,EAEV6xB,EAAIkY,MAAM7nC,GAAa,EAAR4pC,EACf7K,EAAiB,EAAT4K,SAEI,IAAV5K,EACFpP,EAAIkY,MAAM7nC,GAAa,EAAR++B,EAEfpP,EAAI3wC,SAGC2wC,EAAIiZ,QAzlBblB,EAAGlpD,UAAUnG,SAAW,SAAmB8pC,EAAM2nB,OAI3Cna,KAFJma,EAAoB,EAAVA,GAAe;AAGZ,MAJb3nB,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCwN,EAAM,WACFgZ,EAAM,EACN5J,EAAQ,EACH1+C,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,IAAK,KAChCi/B,EAAIzoC,KAAKgxD,MAAMxnD,GACf49C,GAA+B,UAArB3e,GAAKqpB,EAAO5J,IAAmB1mD,SAAS,IAGpDs3C,EADY,IADdoP,EAASzf,IAAO,GAAKqpB,EAAQ,WACVtoD,IAAMxJ,KAAKmI,OAAS,EAC/BuqD,EAAM,EAAItL,EAAKj/C,QAAUi/C,EAAOtO,EAEhCsO,EAAOtO,GAEfgZ,GAAO,IACI,KACTA,GAAO,GACPtoD,SAGU,IAAV0+C,IACFpP,EAAMoP,EAAM1mD,SAAS,IAAMs3C,GAEtBA,EAAI3wC,OAAS8qD,GAAY,GAC9Bna,EAAM,IAAMA,SAEQ,IAAlB94C,KAAK+wD,WACPjY,EAAM,IAAMA,GAEPA,KAGLxN,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,KAE9C4nB,EAAYP,EAAWrnB,GAEvB6nB,EAAYP,EAAWtnB,GAC3BwN,EAAM,OACFlpC,EAAI5P,KAAKsyD,YACb1iD,EAAEmhD,SAAW,GACLnhD,EAAEwjD,UAAU,KACdnsC,EAAIrX,EAAEyjD,KAAKF,GAAW3xD,SAAS8pC,GAMjCwN,GALFlpC,EAAIA,EAAE0jD,MAAMH,IAELC,SAGCnsC,EAAI6xB,EAFJ4Z,EAAMQ,EAAYjsC,EAAE9e,QAAU8e,EAAI6xB;IAKxC94C,KAAKozD,WACPta,EAAM,IAAMA,GAEPA,EAAI3wC,OAAS8qD,GAAY,GAC9Bna,EAAM,IAAMA,SAEQ,IAAlB94C,KAAK+wD,WACPjY,EAAM,IAAMA,GAEPA,EAGT4N,GAAO,EAAO,oCAGhBmK,EAAGlpD,UAAUm8C,SAAW,eAClBzN,EAAMr2C,KAAKgxD,MAAM,UACD,IAAhBhxD,KAAKmI,OACPkuC,GAAuB,SAAhBr2C,KAAKgxD,MAAM,GACO,IAAhBhxD,KAAKmI,QAAkC,IAAlBnI,KAAKgxD,MAAM,GAEzC3a,GAAO,iBAAoC,SAAhBr2C,KAAKgxD,MAAM,GAC7BhxD,KAAKmI,OAAS,GACvBu+C,GAAO,EAAO,8CAEU,IAAlB1mD,KAAK+wD,UAAmB1a,EAAMA,GAGxCwa,EAAGlpD,UAAU+9C,OAAS,kBACb1lD,KAAKwB,SAAS,KAGvBqvD,EAAGlpD,UAAU4rD,SAAW,SAAmBhM,EAAQp/C;OACjDu+C,OAAyB,IAAXwK,GACPlxD,KAAKwzD,YAAYtC,EAAQ3J,EAAQp/C,IAG1C0oD,EAAGlpD,UAAUohD,QAAU,SAAkBxB,EAAQp/C,UACxCnI,KAAKwzD,YAAY9mD,MAAO66C,EAAQp/C,IAGzC0oD,EAAGlpD,UAAU6rD,YAAc,SAAsBC,EAAWlM,EAAQp/C,OAC9Dm4B,EAAatgC,KAAKsgC,aAClBozB,EAAYvrD,GAAUxI,KAAK+I,IAAI,EAAG43B,GACtComB,EAAOpmB,GAAcozB,EAAW,yCAChChN,EAAOgN,EAAY,EAAG,oCAEjB3B,YAIDpiD,EAAGnG,EAHHmqD,EAA0B,OAAXpM,EACfr0B,EAAM,IAAIugC,EAAUC,GAGpBrgC,EAAIrzB,KAAKsyD,WACRqB,EAYE,KACAnqD,EAAI,GAAI6pB,EAAE+/B,SAAU5pD,IACvBmG,EAAI0jB,EAAEugC,MAAM,KACZvgC,EAAEwgC,OAAO,GAET3gC,EAAI1pB,GAAKmG,OAGJnG,EAAIkqD,EAAWlqD,IACpB0pB,EAAI1pB,GAAK,MArBM,KAEZA,EAAI,EAAGA,EAAIkqD,EAAYpzB,EAAY92B,IACtC0pB,EAAI1pB,GAAK,MAGNA,EAAI,GAAI6pB,EAAE+/B,SAAU5pD,IACvBmG,EAAI0jB,EAAEugC,MAAM;AACZvgC,EAAEwgC,OAAO,GAET3gC,EAAIwgC,EAAYlqD,EAAI,GAAKmG,SAetBujB,GAGLvzB,KAAK4wD,MACPM,EAAGlpD,UAAUmsD,WAAa,SAAqBrrB,UACtC,GAAK9oC,KAAK4wD,MAAM9nB,IAGzBooB,EAAGlpD,UAAUmsD,WAAa,SAAqBrrB,OACzCsG,EAAItG,EACJxhB,EAAI,SACJ8nB,GAAK,OACP9nB,GAAK,GACL8nB,KAAO,IAELA,GAAK,KACP9nB,GAAK,EACL8nB,KAAO,GAELA,GAAK,IACP9nB,GAAK,EACL8nB,KAAO,GAELA,GAAK,IACP9nB,GAAK,EACL8nB,KAAO,GAEF9nB,EAAI8nB,GAIf8hB,EAAGlpD,UAAUosD,UAAY,SAAoBtrB,MAEjC,IAANA,EAAS,OAAO,OAEhBsG,EAAItG,EACJxhB,EAAI,SACa,IAAZ,KAAJ8nB,KACH9nB,GAAK,GACL8nB,KAAO,IAEU,IAAV,IAAJA,KACH9nB,GAAK,EACL8nB,KAAO,GAES,IAAT,GAAJA,KACH9nB,GAAK,EACL8nB,KAAO,GAES,IAAT,EAAJA,KACH9nB,GAAK,EACL8nB,KAAO,GAES,IAAT,EAAJA,IACH9nB,IAEKA,GAIT4pC,EAAGlpD,UAAUqsD,UAAY;IACnBvrB,EAAIzoC,KAAKgxD,MAAMhxD,KAAKmI,OAAS,GAC7B0/C,EAAK7nD,KAAK8zD,WAAWrrB,UACE,IAAnBzoC,KAAKmI,OAAS,GAAU0/C,GAiBlCgJ,EAAGlpD,UAAUssD,SAAW,cAClBj0D,KAAKozD,SAAU,OAAO,UAEtBnsC,EAAI,EACCzd,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,IAAK,KAChCmG,EAAI3P,KAAK+zD,UAAU/zD,KAAKgxD,MAAMxnD,OAClCyd,GAAKtX,EACK,KAANA,EAAU,aAETsX,GAGT4pC,EAAGlpD,UAAU24B,WAAa,kBACjB3gC,KAAKyI,KAAKpI,KAAKg0D,YAAc,IAGtCnD,EAAGlpD,UAAUusD,OAAS,SAAiBC,UACf,IAAlBn0D,KAAK+wD,SACA/wD,KAAK49B,MAAMw2B,MAAMD,GAAOE,MAAM,GAEhCr0D,KAAKsyD,SAGdzB,EAAGlpD,UAAU2sD,SAAW,SAAmBH;OACrCn0D,KAAKu0D,MAAMJ,EAAQ,GACdn0D,KAAKw0D,KAAKL,GAAOE,MAAM,GAAGI,OAE5Bz0D,KAAKsyD,SAGdzB,EAAGlpD,UAAU+sD,MAAQ,kBACM,IAAlB10D,KAAK+wD,UAIdF,EAAGlpD,UAAUgtD,IAAM,kBACV30D,KAAKsyD,QAAQmC,QAGtB5D,EAAGlpD,UAAU8sD,KAAO,kBACbz0D,KAAKozD,gBACHrC,UAAY,GAGZ/wD,MAIT6wD,EAAGlpD,UAAUitD,KAAO,SAAexM,QAC1BpoD,KAAKmI,OAASigD,EAAIjgD,aAClB6oD,MAAMhxD,KAAKmI,UAAY,MAGzB,IAAIqB,EAAI,EAAGA,EAAI4+C,EAAIjgD,OAAQqB,SACzBwnD,MAAMxnD,GAAKxJ,KAAKgxD,MAAMxnD,GAAK4+C,EAAI4I,MAAMxnD,UAGrCxJ,KAAK+xD,SAGdlB,EAAGlpD,UAAUktD,IAAM,SAAczM,UAC/B1B,EAA0C,IAAlC1mD,KAAK+wD,SAAW3I,EAAI2I;AACrB/wD,KAAK40D,KAAKxM,IAInByI,EAAGlpD,UAAUmtD,GAAK,SAAa1M,UACzBpoD,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQuC,IAAIzM,GAC/CA,EAAIkK,QAAQuC,IAAI70D,OAGzB6wD,EAAGlpD,UAAUotD,IAAM,SAAc3M,UAC3BpoD,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQsC,KAAKxM,GAChDA,EAAIkK,QAAQsC,KAAK50D,OAI1B6wD,EAAGlpD,UAAUqtD,MAAQ,SAAgB5M,OAE/Bz4C,EAEFA,EADE3P,KAAKmI,OAASigD,EAAIjgD,OAChBigD,EAEApoD,SAGD,IAAIwJ,EAAI,EAAGA,EAAImG,EAAExH,OAAQqB,SACvBwnD,MAAMxnD,GAAKxJ,KAAKgxD,MAAMxnD,GAAK4+C,EAAI4I,MAAMxnD,eAGvCrB,OAASwH,EAAExH,OAETnI,KAAK+xD,SAGdlB,EAAGlpD,UAAUstD,KAAO,SAAe7M,UACjC1B,EAA0C,IAAlC1mD,KAAK+wD,SAAW3I,EAAI2I,WACrB/wD,KAAKg1D,MAAM5M,IAIpByI,EAAGlpD,UAAUutD,IAAM,SAAc9M;OAC3BpoD,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQ2C,KAAK7M,GAChDA,EAAIkK,QAAQ2C,KAAKj1D,OAG1B6wD,EAAGlpD,UAAUwtD,KAAO,SAAe/M,UAC7BpoD,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQ0C,MAAM5M,GACjDA,EAAIkK,QAAQ0C,MAAMh1D,OAI3B6wD,EAAGlpD,UAAUytD,MAAQ,SAAgBhN,OAE/B7kD,EACAoM,EACA3P,KAAKmI,OAASigD,EAAIjgD,QACpB5E,EAAIvD,KACJ2P,EAAIy4C,IAEJ7kD,EAAI6kD,EACJz4C,EAAI3P,UAGD,IAAIwJ,EAAI,EAAGA,EAAImG,EAAExH,OAAQqB,SACvBwnD,MAAMxnD,GAAKjG,EAAEytD,MAAMxnD,GAAKmG,EAAEqhD,MAAMxnD,MAGnCxJ,OAASuD,OACJiG,EAAIjG,EAAE4E,OAAQqB,SACdwnD,MAAMxnD,GAAKjG,EAAEytD,MAAMxnD,eAIvBrB,OAAS5E,EAAE4E,OAETnI,KAAK+xD,SAGdlB,EAAGlpD,UAAU0tD,KAAO,SAAejN,UACjC1B,EAA0C,IAAlC1mD,KAAK+wD,SAAW3I,EAAI2I;AACrB/wD,KAAKo1D,MAAMhN,IAIpByI,EAAGlpD,UAAU2tD,IAAM,SAAclN,UAC3BpoD,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQ+C,KAAKjN,GAChDA,EAAIkK,QAAQ+C,KAAKr1D,OAG1B6wD,EAAGlpD,UAAU4tD,KAAO,SAAenN,UAC7BpoD,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQ8C,MAAMhN,GACjDA,EAAIkK,QAAQ8C,MAAMp1D,OAI3B6wD,EAAGlpD,UAAUysD,MAAQ,SAAgBD,GACnCzN,EAAwB,iBAAVyN,GAAsBA,GAAS,OAEzCqB,EAAsC,EAAxB71D,KAAKyI,KAAK+rD,EAAQ,IAChCsB,EAAWtB,EAAQ,QAGlB5B,QAAQiD,GAETC,EAAW,GACbD,QAIG,IAAIhsD,EAAI,EAAGA,EAAIgsD,EAAahsD,SAC1BwnD,MAAMxnD,GAAsB,UAAhBxJ,KAAKgxD,MAAMxnD,UAI1BisD,EAAW,SACRzE,MAAMxnD,IAAMxJ,KAAKgxD,MAAMxnD,GAAM,UAAc,GAAKisD,GAIhDz1D,KAAK+xD,SAGdlB,EAAGlpD,UAAU6sD,KAAO,SAAeL;OAC1Bn0D,KAAKsyD,QAAQ8B,MAAMD,IAI5BtD,EAAGlpD,UAAU+tD,KAAO,SAAeC,EAAKlzD,GACtCikD,EAAsB,iBAARiP,GAAoBA,GAAO,OAErC7D,EAAO6D,EAAM,GAAM,EACnBC,EAAOD,EAAM,eAEZpD,QAAQT,EAAM,QAGZd,MAAMc,GADTrvD,EACgBzC,KAAKgxD,MAAMc,GAAQ,GAAK8D,EAExB51D,KAAKgxD,MAAMc,KAAS,GAAK8D,GAGtC51D,KAAK+xD,SAIdlB,EAAGlpD,UAAUkuD,KAAO,SAAezN,OAC7BnhC,EAkBA1jB,EAAGoM,KAfe,IAAlB3P,KAAK+wD,UAAmC,IAAjB3I,EAAI2I,qBACxBA,SAAW,EAChB9pC,EAAIjnB,KAAK81D,KAAK1N,QACT2I,UAAY,EACV/wD,KAAKwyD,YAGP,GAAsB,IAAlBxyD,KAAK+wD,UAAmC,IAAjB3I,EAAI2I,gBACpC3I,EAAI2I,SAAW,EACf9pC,EAAIjnB,KAAK81D,KAAK1N,GACdA,EAAI2I,SAAW,EACR9pC,EAAEurC,YAKPxyD,KAAKmI,OAASigD,EAAIjgD,QACpB5E,EAAIvD,KACJ2P,EAAIy4C,IAEJ7kD,EAAI6kD,EACJz4C,EAAI3P;SAGFkoD,EAAQ,EACH1+C,EAAI,EAAGA,EAAImG,EAAExH,OAAQqB,IAC5Byd,GAAkB,EAAb1jB,EAAEytD,MAAMxnD,KAAwB,EAAbmG,EAAEqhD,MAAMxnD,IAAU0+C,OACrC8I,MAAMxnD,GAAS,SAAJyd,EAChBihC,EAAQjhC,IAAM,QAEC,IAAVihC,GAAe1+C,EAAIjG,EAAE4E,OAAQqB,IAClCyd,GAAkB,EAAb1jB,EAAEytD,MAAMxnD,IAAU0+C,OAClB8I,MAAMxnD,GAAS,SAAJyd,EAChBihC,EAAQjhC,IAAM,WAGX9e,OAAS5E,EAAE4E,OACF,IAAV+/C,OACG8I,MAAMhxD,KAAKmI,QAAU+/C,OACrB//C,cAEA,GAAI5E,IAAMvD,UACRwJ,EAAIjG,EAAE4E,OAAQqB,SACdwnD,MAAMxnD,GAAKjG,EAAEytD,MAAMxnD,UAIrBxJ,MAIT6wD,EAAGlpD,UAAU8xB,IAAM,SAAc2uB,OAC3Bl1B,SACiB,IAAjBk1B,EAAI2I,UAAoC,IAAlB/wD,KAAK+wD,UAC7B3I,EAAI2I,SAAW,EACf79B,EAAMlzB,KAAKkjD,IAAIkF,GACfA,EAAI2I,UAAY,EACT79B,GACmB,IAAjBk1B,EAAI2I,UAAoC,IAAlB/wD,KAAK+wD,eAC/BA,SAAW;AAChB79B,EAAMk1B,EAAIlF,IAAIljD,WACT+wD,SAAW,EACT79B,GAGLlzB,KAAKmI,OAASigD,EAAIjgD,OAAenI,KAAKsyD,QAAQuD,KAAKzN,GAEhDA,EAAIkK,QAAQuD,KAAK71D,OAI1B6wD,EAAGlpD,UAAUmuD,KAAO,SAAe1N,MAEZ,IAAjBA,EAAI2I,SAAgB,CACtB3I,EAAI2I,SAAW,MACX9pC,EAAIjnB,KAAK61D,KAAKzN,UAClBA,EAAI2I,SAAW,EACR9pC,EAAEurC,YAGJ,GAAsB,IAAlBxyD,KAAK+wD,qBACTA,SAAW,OACX8E,KAAKzN,QACL2I,SAAW,EACT/wD,KAAKwyD,gBAeVjvD,EAAGoM,EAXH8hD,EAAMzxD,KAAKyxD,IAAIrJ,MAGP,IAARqJ,cACGV,SAAW,OACX5oD,OAAS,OACT6oD,MAAM,GAAK,EACThxD,KAKLyxD,EAAM,GACRluD,EAAIvD,KACJ2P,EAAIy4C,IAEJ7kD,EAAI6kD,EACJz4C,EAAI3P,cAGFkoD,EAAQ,EACH1+C,EAAI,EAAGA,EAAImG,EAAExH,OAAQqB,IAE5B0+C,GADAjhC,GAAkB,EAAb1jB,EAAEytD,MAAMxnD,KAAwB,EAAbmG,EAAEqhD,MAAMxnD,IAAU0+C,IAC7B;KACR8I,MAAMxnD,GAAS,SAAJyd,OAED,IAAVihC,GAAe1+C,EAAIjG,EAAE4E,OAAQqB,IAElC0+C,GADAjhC,GAAkB,EAAb1jB,EAAEytD,MAAMxnD,IAAU0+C,IACV,QACR8I,MAAMxnD,GAAS,SAAJyd,KAIJ,IAAVihC,GAAe1+C,EAAIjG,EAAE4E,QAAU5E,IAAMvD,UAChCwJ,EAAIjG,EAAE4E,OAAQqB,SACdwnD,MAAMxnD,GAAKjG,EAAEytD,MAAMxnD,eAIvBrB,OAASxI,KAAK+I,IAAI1I,KAAKmI,OAAQqB,GAEhCjG,IAAMvD,YACH+wD,SAAW,GAGX/wD,KAAK+xD,SAIdlB,EAAGlpD,UAAUu7C,IAAM,SAAckF,UACxBpoD,KAAKsyD,QAAQwD,KAAK1N,QA+CvB2N,EAAc,SAAsBh2D,EAAMqoD,EAAKtP;IAK7C8O,EACAoO,EACAnO,EANAtkD,EAAIxD,EAAKixD,MACTrhD,EAAIy4C,EAAI4I,MACRiF,EAAInd,EAAIkY,MACRphD,EAAI,EAIJsmD,EAAY,EAAP3yD,EAAE,GACP4yD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9yD,EAAE,GACP+yD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjzD,EAAE,GACPkzD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpzD,EAAE,GACPqzD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvzD,EAAE,GACPwzD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1zD,EAAE,GACP2zD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7zD,EAAE,GACP8zD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPh0D,EAAE,GACPi0D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPn0D,EAAE,GACPo0D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPt0D,EAAE,GACPu0D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAProD,EAAE,GACPsoD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxoD,EAAE,GACPyoD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3oD,EAAE,GACP4oD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9oD,EAAE,GACP+oD,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjpD,EAAE,GACPkpD,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPppD,EAAE,GACPqpD,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvpD,EAAE,GACPwpD,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1pD,EAAE,GACP2pD,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP7pD,EAAE,GACP8pD,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPhqD,EAAE,GACPiqD,GAAW,KAALD,GACNE,GAAMF,KAAO;CAEjB7gB,EAAIiY,SAAWhxD,EAAKgxD,SAAW3I,EAAI2I,SACnCjY,EAAI3wC,OAAS,OAMT2xD,IAAQlqD,GAJZg4C,EAAKjoD,KAAK8wD,KAAK0F,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMr2D,KAAK8wD,KAAK0F,EAAK+B,IACRv4D,KAAK8wD,KAAK2F,EAAK6B,GAAQ,KAEU,IAAO,EACrDroD,IAFAi4C,EAAKloD,KAAK8wD,KAAK2F,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENlS,EAAKjoD,KAAK8wD,KAAK6F,EAAK2B,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAK6F,EAAK4B,IACRv4D,KAAK8wD,KAAK8F,EAAK0B,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAK8F,EAAK2B,OAKhB6B,IAAQnqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAKkC,GAAQ,GACvB14D,KAAK8wD,KAAK2F,EAAKgC,GAAQ,KAEU,IAAO,EACrDxoD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAENnS,EAAKjoD,KAAK8wD,KAAKgG,EAAKwB,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAKgG,EAAKyB,IACRv4D,KAAK8wD,KAAKiG,EAAKuB,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAKiG,EAAKwB;AACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAK+B,GAAQ,GACvB14D,KAAK8wD,KAAK8F,EAAK6B,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAK8B,GAAQ,MAK9B2B,IAAQpqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAKqC,GAAQ,GACvB74D,KAAK8wD,KAAK2F,EAAKmC,GAAQ,KAEU,IAAO,EACrD3oD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENpS,EAAKjoD,KAAK8wD,KAAKmG,EAAKqB,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAKmG,EAAKsB,IACRv4D,KAAK8wD,KAAKoG,EAAKoB,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAKoG,EAAKqB,GACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAK4B,GAAQ,GACvB14D,KAAK8wD,KAAKiG,EAAK0B,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAK2B,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAKkC,GAAQ,GACvB74D,KAAK8wD,KAAK8F,EAAKgC,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAKiC,GAAQ;KAK9ByB,IAAQrqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAKwC,GAAQ,GACvBh5D,KAAK8wD,KAAK2F,EAAKsC,GAAQ,KAEU,IAAO,EACrD9oD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENrS,EAAKjoD,KAAK8wD,KAAKsG,EAAKkB,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAKsG,EAAKmB,IACRv4D,KAAK8wD,KAAKuG,EAAKiB,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAKuG,EAAKkB,GACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAKyB,GAAQ,GACvB14D,KAAK8wD,KAAKoG,EAAKuB,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAKwB,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAK+B,GAAQ,GACvB74D,KAAK8wD,KAAKiG,EAAK6B,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAK8B,GAAQ,EAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAKqC,GAAQ,GACvBh5D,KAAK8wD,KAAK8F,EAAKmC,GAAQ,EACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAKoC,GAAQ;KAK9BuB,IAAQtqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAK2C,IAAQ,GACvBn5D,KAAK8wD,KAAK2F,EAAKyC,GAAQ,KAEU,IAAO,EACrDjpD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENtS,EAAKjoD,KAAK8wD,KAAKyG,EAAKe,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAKyG,EAAKgB,IACRv4D,KAAK8wD,KAAK0G,EAAKc,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAK0G,EAAKe,GACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAKsB,GAAQ,GACvB14D,KAAK8wD,KAAKuG,EAAKoB,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAKqB,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAK4B,GAAQ,GACvB74D,KAAK8wD,KAAKoG,EAAK0B,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAK2B,GAAQ,EAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAKkC,GAAQ,GACvBh5D,KAAK8wD,KAAKiG,EAAKgC,GAAQ,EACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAKiC,GAAQ;AAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAKwC,IAAQ,GACvBn5D,KAAK8wD,KAAK8F,EAAKsC,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAKuC,IAAQ,MAK9BqB,IAAQvqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAK8C,IAAQ,GACvBt5D,KAAK8wD,KAAK2F,EAAK4C,IAAQ,KAEU,IAAO,EACrDppD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENvS,EAAKjoD,KAAK8wD,KAAK4G,EAAKY,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAK4G,EAAKa,IACRv4D,KAAK8wD,KAAK6G,EAAKW,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAK6G,EAAKY,GACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAKmB,GAAQ,GACvB14D,KAAK8wD,KAAK0G,EAAKiB,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAKkB,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAKyB,GAAQ,GACvB74D,KAAK8wD,KAAKuG,EAAKuB,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAKwB,GAAQ;AAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAK+B,GAAQ,GACvBh5D,KAAK8wD,KAAKoG,EAAK6B,GAAQ,EACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAK8B,GAAQ,EAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAKqC,IAAQ,GACvBn5D,KAAK8wD,KAAKiG,EAAKmC,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAKoC,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAK2C,IAAQ,GACvBt5D,KAAK8wD,KAAK8F,EAAKyC,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAK0C,IAAQ,MAK9BmB,IAAQxqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAKiD,IAAQ,GACvBz5D,KAAK8wD,KAAK2F,EAAK+C,IAAQ,KAEU,IAAO,EACrDvpD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENxS,EAAKjoD,KAAK8wD,KAAK+G,EAAKS,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAK+G,EAAKU,IACRv4D,KAAK8wD,KAAKgH,EAAKQ,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAKgH,EAAKS;AACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKgB,GAAQ,GACvB14D,KAAK8wD,KAAK6G,EAAKc,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKe,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAKsB,GAAQ,GACvB74D,KAAK8wD,KAAK0G,EAAKoB,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAKqB,GAAQ,EAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAK4B,GAAQ,GACvBh5D,KAAK8wD,KAAKuG,EAAK0B,GAAQ,EACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAK2B,GAAQ,EAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAKkC,IAAQ,GACvBn5D,KAAK8wD,KAAKoG,EAAKgC,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAKiC,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAKwC,IAAQ,GACvBt5D,KAAK8wD,KAAKiG,EAAKsC,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAKuC,IAAQ,EAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAK8C,IAAQ,GACvBz5D,KAAK8wD,KAAK8F,EAAK4C,IAAQ;AACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAK6C,IAAQ,MAK9BiB,IAAQzqD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAKoD,IAAQ,GACvB55D,KAAK8wD,KAAK2F,EAAKkD,IAAQ,KAEU,IAAO,EACrD1pD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENzS,EAAKjoD,KAAK8wD,KAAKkH,EAAKM,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAKkH,EAAKO,IACRv4D,KAAK8wD,KAAKmH,EAAKK,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAKmH,EAAKM,GACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKa,GAAQ,GACvB14D,KAAK8wD,KAAKgH,EAAKW,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKY,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKmB,GAAQ,GACvB74D,KAAK8wD,KAAK6G,EAAKiB,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKkB,GAAQ,EAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAKyB,GAAQ,GACvBh5D,KAAK8wD,KAAK0G,EAAKuB,GAAQ;AACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAKwB,GAAQ,EAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAK+B,IAAQ,GACvBn5D,KAAK8wD,KAAKuG,EAAK6B,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAK8B,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAKqC,IAAQ,GACvBt5D,KAAK8wD,KAAKoG,EAAKmC,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAKoC,IAAQ,EAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAK2C,IAAQ,GACvBz5D,KAAK8wD,KAAKiG,EAAKyC,IAAQ,EACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAK0C,IAAQ,EAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAKiD,IAAQ,GACvB55D,KAAK8wD,KAAK8F,EAAK+C,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAKgD,IAAQ,MAK9Be,IAAQ1qD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAKuD,IAAQ,GACvB/5D,KAAK8wD,KAAK2F,EAAKqD,IAAQ,KAEU,IAAO;CACrD7pD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAEN1S,EAAKjoD,KAAK8wD,KAAKqH,EAAKG,GAEpBjC,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKI,IACRv4D,KAAK8wD,KAAKsH,EAAKE,GAAQ,EACpCpQ,EAAKloD,KAAK8wD,KAAKsH,EAAKG,GACpBtQ,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKU,GAAQ,GACvB14D,KAAK8wD,KAAKmH,EAAKQ,GAAQ,EACpCvQ,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKS,GAAQ,EAClCzQ,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKgB,GAAQ,GACvB74D,KAAK8wD,KAAKgH,EAAKc,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKe,GAAQ,EAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKsB,GAAQ,GACvBh5D,KAAK8wD,KAAK6G,EAAKoB,GAAQ,EACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKqB,GAAQ,EAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAK4B,IAAQ,GACvBn5D,KAAK8wD,KAAK0G,EAAK0B,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAK2B,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAKiC,IAAQ;AAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAKkC,IAAQ,GACvBt5D,KAAK8wD,KAAKuG,EAAKgC,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAKiC,IAAQ,EAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAKwC,IAAQ,GACvBz5D,KAAK8wD,KAAKoG,EAAKsC,IAAQ,EACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAKuC,IAAQ,EAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAK8C,IAAQ,GACvB55D,KAAK8wD,KAAKiG,EAAK4C,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAK6C,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAKoD,IAAQ,GACvB/5D,KAAK8wD,KAAK8F,EAAKkD,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAKmD,IAAQ,MAK9Ba,IAAQ3qD,GAJZg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK0F,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK0F,EAAK0D,IAAQ,GACvBl6D,KAAK8wD,KAAK2F,EAAKwD,IAAQ,KAEU,IAAO,EACrDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK2F,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM;AAEN3S,EAAKjoD,KAAK8wD,KAAKqH,EAAKM,GAEpBpC,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKO,IACR14D,KAAK8wD,KAAKsH,EAAKK,GAAQ,EACpCvQ,EAAKloD,KAAK8wD,KAAKsH,EAAKM,GACpBzQ,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKa,GAAQ,GACvB74D,KAAK8wD,KAAKmH,EAAKW,GAAQ,EACpC1Q,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKY,GAAQ,EAClC5Q,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKmB,GAAQ,GACvBh5D,KAAK8wD,KAAKgH,EAAKiB,GAAQ,EACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKkB,GAAQ,EAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKyB,IAAQ,GACvBn5D,KAAK8wD,KAAK6G,EAAKuB,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKwB,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAK+B,IAAQ,GACvBt5D,KAAK8wD,KAAK0G,EAAK6B,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAK8B,IAAQ,EAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAKqC,IAAQ,GACvBz5D,KAAK8wD,KAAKuG,EAAKmC,IAAQ;AACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAKoC,IAAQ,EAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAK2C,IAAQ,GACvB55D,KAAK8wD,KAAKoG,EAAKyC,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAK0C,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAKiD,IAAQ,GACvB/5D,KAAK8wD,KAAKiG,EAAK+C,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAKgD,IAAQ,MAK9Bc,IAAS5qD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK6F,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK6F,EAAKuD,IAAQ,GACvBl6D,KAAK8wD,KAAK8F,EAAKqD,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK8F,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAQ,IAAO,EACjDA,IAAO,SAEP5S,EAAKjoD,KAAK8wD,KAAKqH,EAAKS,GAEpBvC,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKU,IACR74D,KAAK8wD,KAAKsH,EAAKQ,GAAQ,EACpC1Q,EAAKloD,KAAK8wD,KAAKsH,EAAKS,GACpB5Q,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKgB,GAAQ,GACvBh5D,KAAK8wD,KAAKmH,EAAKc,GAAQ;AACpC7Q,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKe,GAAQ,EAClC/Q,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKsB,IAAQ,GACvBn5D,KAAK8wD,KAAKgH,EAAKoB,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKqB,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAK4B,IAAQ,GACvBt5D,KAAK8wD,KAAK6G,EAAK0B,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAK2B,IAAQ,EAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAKkC,IAAQ,GACvBz5D,KAAK8wD,KAAK0G,EAAKgC,IAAQ,EACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAKiC,IAAQ,EAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAKwC,IAAQ,GACvB55D,KAAK8wD,KAAKuG,EAAKsC,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAKuC,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAK8C,IAAQ,GACvB/5D,KAAK8wD,KAAKoG,EAAK4C,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAK6C,IAAQ;KAK9Be,IAAS7qD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAKgG,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKgG,EAAKoD,IAAQ,GACvBl6D,KAAK8wD,KAAKiG,EAAKkD,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAKiG,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP7S,EAAKjoD,KAAK8wD,KAAKqH,EAAKY,GAEpB1C,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKa,IACRh5D,KAAK8wD,KAAKsH,EAAKW,GAAQ,EACpC7Q,EAAKloD,KAAK8wD,KAAKsH,EAAKY,GACpB/Q,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKmB,IAAQ,GACvBn5D,KAAK8wD,KAAKmH,EAAKiB,GAAQ,EACpChR,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKkB,IAAQ,EAClClR,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKyB,IAAQ,GACvBt5D,KAAK8wD,KAAKgH,EAAKuB,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKwB,IAAQ,EAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAK+B,IAAQ,GACvBz5D,KAAK8wD,KAAK6G,EAAK6B,IAAQ,EACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAK8B,IAAQ;AAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAKqC,IAAQ,GACvB55D,KAAK8wD,KAAK0G,EAAKmC,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAKoC,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAK2C,IAAQ,GACvB/5D,KAAK8wD,KAAKuG,EAAKyC,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAK0C,IAAQ,MAK9BgB,IAAS9qD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAKmG,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKmG,EAAKiD,IAAQ,GACvBl6D,KAAK8wD,KAAKoG,EAAK+C,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAKoG,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP9S,EAAKjoD,KAAK8wD,KAAKqH,EAAKe,GAEpB7C,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKgB,KACRn5D,KAAK8wD,KAAKsH,EAAKc,GAAQ,EACpChR,EAAKloD,KAAK8wD,KAAKsH,EAAKe,IACpBlR,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKsB,IAAQ,GACvBt5D,KAAK8wD,KAAKmH,EAAKoB,IAAQ,EACpCnR,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKqB,IAAQ;AAClCrR,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAK4B,IAAQ,GACvBz5D,KAAK8wD,KAAKgH,EAAK0B,IAAQ,EACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAK2B,IAAQ,EAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKkC,IAAQ,GACvB55D,KAAK8wD,KAAK6G,EAAKgC,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKiC,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAKwC,IAAQ,GACvB/5D,KAAK8wD,KAAK0G,EAAKsC,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAKuC,IAAQ,MAK9BiB,IAAS/qD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAKsG,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKsG,EAAK8C,IAAQ,GACvBl6D,KAAK8wD,KAAKuG,EAAK4C,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAKuG,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP/S,EAAKjoD,KAAK8wD,KAAKqH,EAAKkB,IAEpBhD,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKmB,KACRt5D,KAAK8wD,KAAKsH,EAAKiB,IAAQ;AACpCnR,EAAKloD,KAAK8wD,KAAKsH,EAAKkB,IACpBrR,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKyB,IAAQ,GACvBz5D,KAAK8wD,KAAKmH,EAAKuB,IAAQ,EACpCtR,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKwB,IAAQ,EAClCxR,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAK+B,IAAQ,GACvB55D,KAAK8wD,KAAKgH,EAAK6B,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAK8B,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKqC,IAAQ,GACvB/5D,KAAK8wD,KAAK6G,EAAKmC,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKoC,IAAQ,MAK9BkB,IAAShrD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAKyG,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKyG,EAAK2C,IAAQ,GACvBl6D,KAAK8wD,KAAK0G,EAAKyC,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK0G,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPhT,EAAKjoD,KAAK8wD,KAAKqH,EAAKqB;AAEpBnD,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKsB,KACRz5D,KAAK8wD,KAAKsH,EAAKoB,IAAQ,EACpCtR,EAAKloD,KAAK8wD,KAAKsH,EAAKqB,IACpBxR,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAK4B,IAAQ,GACvB55D,KAAK8wD,KAAKmH,EAAK0B,IAAQ,EACpCzR,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAK2B,IAAQ,EAClC3R,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKkC,IAAQ,GACvB/5D,KAAK8wD,KAAKgH,EAAKgC,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKiC,IAAQ,MAK9BmB,IAASjrD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK4G,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK4G,EAAKwC,IAAQ,GACvBl6D,KAAK8wD,KAAK6G,EAAKsC,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAK6G,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPjT,EAAKjoD,KAAK8wD,KAAKqH,EAAKwB,IAEpBtD,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAKyB,KACR55D,KAAK8wD,KAAKsH,EAAKuB,IAAQ,EACpCzR,EAAKloD,KAAK8wD,KAAKsH,EAAKwB,IACpB3R,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAK8B,IAAQ;AAElCzD,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAK+B,IAAQ,GACvB/5D,KAAK8wD,KAAKmH,EAAK6B,IAAQ,EACpC5R,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAK8B,IAAQ,MAK9BoB,IAASlrD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAK+G,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAK+G,EAAKqC,IAAQ,GACvBl6D,KAAK8wD,KAAKgH,EAAKmC,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAKgH,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPlT,EAAKjoD,KAAK8wD,KAAKqH,EAAK2B,IAEpBzD,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAK4B,KACR/5D,KAAK8wD,KAAKsH,EAAK0B,IAAQ,EACpC5R,EAAKloD,KAAK8wD,KAAKsH,EAAK2B,QAKhBqB,IAASnrD,GAJbg4C,EAAMA,EAAKjoD,KAAK8wD,KAAKkH,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMr2D,KAAK8wD,KAAKkH,EAAKkC,IAAQ,GACvBl6D,KAAK8wD,KAAKmH,EAAKgC,IAAQ,KAEW,IAAO,EACtDhqD,IAFAi4C,EAAMA,EAAKloD,KAAK8wD,KAAKmH,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO;KAMHC,IAASprD,GAJbg4C,EAAKjoD,KAAK8wD,KAAKqH,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMr2D,KAAK8wD,KAAKqH,EAAK+B,KACRl6D,KAAK8wD,KAAKsH,EAAK6B,IAAQ,KAEW,IAAO,SACtDhqD,IAFAi4C,EAAKloD,KAAK8wD,KAAKsH,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SACP/E,EAAE,GAAK6D,GACP7D,EAAE,GAAK8D,GACP9D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,IAAMuE,GACRvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACE,IAANprD,IACFqmD,EAAE,IAAMrmD,EACRkpC,EAAI3wC,UAEC2wC,YAiDAmiB,EAAYl7D,EAAMqoD,EAAKtP,UACnB,IAAIoiB,GACHC,KAAKp7D,EAAMqoD,EAAKtP,YAsBrBoiB,EAAMl3C,EAAGulC,QACXvlC,EAAIA,OACJulC,EAAIA,EAvEN5pD,KAAK8wD,OACRsF,EAAclD,GAiDhBhC,EAAGlpD,UAAUyzD,MAAQ,SAAgBhT,EAAKtP;IAEpCxiB,EAAMt2B,KAAKmI,OAASigD,EAAIjgD,cACR,KAAhBnI,KAAKmI,QAAgC,KAAfigD,EAAIjgD,OACtB4tD,EAAY/1D,KAAMooD,EAAKtP,GACpBxiB,EAAM,GACTu8B,EAAW7yD,KAAMooD,EAAKtP,GACnBxiB,EAAM,cArDAv2B,EAAMqoD,EAAKtP,GAC5BA,EAAIiY,SAAW3I,EAAI2I,SAAWhxD,EAAKgxD,SACnCjY,EAAI3wC,OAASpI,EAAKoI,OAASigD,EAAIjgD,eAE3B+/C,EAAQ,EACRmT,EAAU,EACLlyC,EAAI,EAAGA,EAAI2vB,EAAI3wC,OAAS,EAAGghB,IAAK,KAGnC2pC,EAASuI,EACbA,EAAU,UACNtI,EAAgB,SAAR7K,EACR8K,EAAOrzD,KAAK6I,IAAI2gB,EAAGi/B,EAAIjgD,OAAS,GAC3BktB,EAAI11B,KAAK+I,IAAI,EAAGygB,EAAIppB,EAAKoI,OAAS,GAAIktB,GAAK29B,EAAM39B,IAAK,KACzD7rB,EAAI2f,EAAIkM,EAGRpO,GAFoB,EAAhBlnB,EAAKixD,MAAMxnD,KACI,EAAf4+C,EAAI4I,MAAM37B,IAGduyB,EAAS,SAAJ3gC,EAGT8rC,EAAa,UADbnL,EAAMA,EAAKmL,EAAS,GAIpBsI,IAFAvI,GAHAA,EAAUA,GAAW7rC,EAAI,SAAa,GAAM,IAGxB2gC,IAAO,IAAO,KAEZ,GACtBkL,GAAU,SAEZha,EAAIkY,MAAM7nC,GAAK4pC,EACf7K,EAAQ4K,EACRA,EAASuI;OAEG,IAAVnT,EACFpP,EAAIkY,MAAM7nC,GAAK++B,EAEfpP,EAAI3wC,SAGC2wC,EAAIiZ,QAgBHuJ,CAASt7D,KAAMooD,EAAKtP,GAEpBmiB,EAAWj7D,KAAMooD,EAAKtP,IAchCoiB,EAAKvzD,UAAU4zD,QAAU,SAAkBC,WACrCzsB,EAAI,IAAIriC,MAAM8uD,GACdrjB,EAAI0Y,EAAGlpD,UAAUmsD,WAAW0H,GAAK,EAC5BhyD,EAAI,EAAGA,EAAIgyD,EAAGhyD,IACrBulC,EAAEvlC,GAAKxJ,KAAKy7D,OAAOjyD,EAAG2uC,EAAGqjB,UAGpBzsB,GAITmsB,EAAKvzD,UAAU8zD,OAAS,SAAiBz3C,EAAGm0B,EAAGqjB,MACnC,IAANx3C,GAAWA,IAAMw3C,EAAI,EAAG,OAAOx3C,UAE/B03C,EAAK,EACAlyD,EAAI,EAAGA,EAAI2uC,EAAG3uC,IACrBkyD,IAAW,EAAJ13C,IAAWm0B,EAAI3uC,EAAI,EAC1Bwa,IAAM,SAGD03C,GAKTR,EAAKvzD,UAAUg0D,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMR,OAC/D,IAAIhyD,EAAI,EAAGA,EAAIgyD,EAAGhyD,IACrBuyD,EAAKvyD,GAAKqyD,EAAID,EAAIpyD,IAClBwyD,EAAKxyD,GAAKsyD,EAAIF,EAAIpyD,KAItB0xD,EAAKvzD,UAAUs0D,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMR,EAAGI,QACjED,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMR;KAEnC,IAAI9rC,EAAI,EAAGA,EAAI8rC,EAAG9rC,IAAM,UACvByoB,EAAIzoB,GAAK,EAETwsC,EAAQv8D,KAAKw8D,IAAI,EAAIx8D,KAAKy8D,GAAKjkB,GAC/BkkB,EAAQ18D,KAAK28D,IAAI,EAAI38D,KAAKy8D,GAAKjkB,GAE1B9vB,EAAI,EAAGA,EAAImzC,EAAGnzC,GAAK8vB,UACtBokB,EAASL,EACTM,EAASH,EAEJhnC,EAAI,EAAGA,EAAI3F,EAAG2F,IAAK,KACtB1F,EAAKosC,EAAK1zC,EAAIgN,GACdonC,EAAKT,EAAK3zC,EAAIgN,GAEdqnC,EAAKX,EAAK1zC,EAAIgN,EAAI3F,GAClBitC,EAAKX,EAAK3zC,EAAIgN,EAAI3F,GAElByD,EAAKopC,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKvpC,EAEL4oC,EAAK1zC,EAAIgN,GAAK1F,EAAK+sC,EACnBV,EAAK3zC,EAAIgN,GAAKonC,EAAKE,EAEnBZ,EAAK1zC,EAAIgN,EAAI3F,GAAKC,EAAK+sC,EACvBV,EAAK3zC,EAAIgN,EAAI3F,GAAK+sC,EAAKE,EAGnBtnC,IAAM8iB,IACRhlB,EAAK+oC,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASppC,KAOnB+nC,EAAKvzD,UAAUi1D,YAAc,SAAsB1zC,EAAGsL,OAChDgnC,EAAqB,EAAjB77D,KAAK+I,IAAI8rB,EAAGtL,GAChB2zC,EAAU,EAAJrB,EACNhyD,EAAI,MACHgyD,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BhyD,WAGK,GAAKA,EAAI,EAAIqzD,GAGtB3B,EAAKvzD,UAAUm1D,UAAY,SAAoBjB,EAAKC,EAAKN,QACnDA,GAAK,OAEJ,IAAIhyD,EAAI,EAAGA,EAAIgyD,EAAI,EAAGhyD,IAAK,KAC1BulC,EAAI8sB,EAAIryD,GAEZqyD,EAAIryD,GAAKqyD,EAAIL,EAAIhyD,EAAI,GACrBqyD,EAAIL,EAAIhyD,EAAI,GAAKulC;AAEjBA,EAAI+sB,EAAItyD,GAERsyD,EAAItyD,IAAMsyD,EAAIN,EAAIhyD,EAAI,GACtBsyD,EAAIN,EAAIhyD,EAAI,IAAMulC,IAItBmsB,EAAKvzD,UAAUo1D,aAAe,SAAuBC,EAAIxB,WACnDtT,EAAQ,EACH1+C,EAAI,EAAGA,EAAIgyD,EAAI,EAAGhyD,IAAK,KAC1Bi/B,EAAoC,KAAhC9oC,KAAK6iC,MAAMw6B,EAAG,EAAIxzD,EAAI,GAAKgyD,GACjC77D,KAAK6iC,MAAMw6B,EAAG,EAAIxzD,GAAKgyD,GACvBtT,EAEF8U,EAAGxzD,GAAS,SAAJi/B,EAGNyf,EADEzf,EAAI,SACE,EAEAA,EAAI,SAAY,SAIrBu0B,GAGT9B,EAAKvzD,UAAUs1D,WAAa,SAAqBD,EAAI1mC,EAAKulC,EAAKL,WACzDtT,EAAQ,EACH1+C,EAAI,EAAGA,EAAI8sB,EAAK9sB,IACvB0+C,GAAyB,EAAR8U,EAAGxzD,GAEpBqyD,EAAI,EAAIryD,GAAa,KAAR0+C,EAAgBA,KAAkB,GAC/C2T,EAAI,EAAIryD,EAAI,GAAa,KAAR0+C,EAAgBA,KAAkB,OAIhD1+C,EAAI,EAAI8sB,EAAK9sB,EAAIgyD,IAAKhyD,EACzBqyD,EAAIryD,GAAK,EAGXk9C,EAAiB,IAAVwB,GACPxB,EAA6B,KAAb,KAARwB,KAGVgT,EAAKvzD,UAAUu1D,KAAO,SAAe1B,WAC/B2B,EAAK,IAAIzwD,MAAM8uD,GACVhyD,EAAI,EAAGA,EAAIgyD,EAAGhyD,IACrB2zD,EAAG3zD,GAAK,SAGH2zD,GAGTjC,EAAKvzD,UAAUwzD,KAAO,SAAen3C,EAAGulC,EAAGzQ;IACrC0iB,EAAI,EAAIx7D,KAAK48D,YAAY54C,EAAE7b,OAAQohD,EAAEphD,QAErCyzD,EAAM57D,KAAKu7D,QAAQC,GAEnB4B,EAAIp9D,KAAKk9D,KAAK1B,GAEdK,EAAM,IAAInvD,MAAM8uD,GAChB6B,EAAO,IAAI3wD,MAAM8uD,GACjB8B,EAAO,IAAI5wD,MAAM8uD,GAEjB+B,EAAO,IAAI7wD,MAAM8uD,GACjBgC,EAAQ,IAAI9wD,MAAM8uD,GAClBiC,EAAQ,IAAI/wD,MAAM8uD,GAElBkC,EAAO5kB,EAAIkY,MACf0M,EAAKv1D,OAASqzD,OAETyB,WAAWj5C,EAAEgtC,MAAOhtC,EAAE7b,OAAQ0zD,EAAKL,QACnCyB,WAAW1T,EAAEyH,MAAOzH,EAAEphD,OAAQo1D,EAAM/B,QAEpCS,UAAUJ,EAAKuB,EAAGC,EAAMC,EAAM9B,EAAGI,QACjCK,UAAUsB,EAAMH,EAAGI,EAAOC,EAAOjC,EAAGI,OAEpC,IAAIpyD,EAAI,EAAGA,EAAIgyD,EAAGhyD,IAAK,KACtB2pB,EAAKkqC,EAAK7zD,GAAKg0D,EAAMh0D,GAAK8zD,EAAK9zD,GAAKi0D,EAAMj0D,GAC9C8zD,EAAK9zD,GAAK6zD,EAAK7zD,GAAKi0D,EAAMj0D,GAAK8zD,EAAK9zD,GAAKg0D,EAAMh0D,GAC/C6zD,EAAK7zD,GAAK2pB,cAGP2pC,UAAUO,EAAMC,EAAM9B,QACtBS,UAAUoB,EAAMC,EAAMI,EAAMN,EAAG5B,EAAGI,QAClCkB,UAAUY,EAAMN,EAAG5B;KACnBuB,aAAaW,EAAMlC,GAExB1iB,EAAIiY,SAAW/sC,EAAE+sC,SAAWxH,EAAEwH,SAC9BjY,EAAI3wC,OAAS6b,EAAE7b,OAASohD,EAAEphD,OACnB2wC,EAAIiZ,SAIblB,EAAGlpD,UAAU6pD,IAAM,SAAcpJ,OAC3BtP,EAAM,IAAI+X,EAAG,aACjB/X,EAAIkY,MAAQ,IAAItkD,MAAM1M,KAAKmI,OAASigD,EAAIjgD,QACjCnI,KAAKo7D,MAAMhT,EAAKtP,IAIzB+X,EAAGlpD,UAAUg2D,KAAO,SAAevV,OAC7BtP,EAAM,IAAI+X,EAAG,aACjB/X,EAAIkY,MAAQ,IAAItkD,MAAM1M,KAAKmI,OAASigD,EAAIjgD,QACjC8yD,EAAWj7D,KAAMooD,EAAKtP,IAI/B+X,EAAGlpD,UAAU8oD,KAAO,SAAerI,UAC1BpoD,KAAKsyD,QAAQ8I,MAAMhT,EAAKpoD,OAGjC6wD,EAAGlpD,UAAUwqD,MAAQ,SAAgB/J,GACnC1B,EAAsB,iBAAR0B,GACd1B,EAAO0B,EAAM,kBAGTF,EAAQ,EACH1+C,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,IAAK;IAChCi/B,GAAqB,EAAhBzoC,KAAKgxD,MAAMxnD,IAAU4+C,EAC1BR,GAAU,SAAJnf,IAA0B,SAARyf,GAC5BA,IAAU,GACVA,GAAUzf,EAAI,SAAa,EAE3Byf,GAASN,IAAO,QACXoJ,MAAMxnD,GAAU,SAALo+C,SAGJ,IAAVM,SACG8I,MAAMxnD,GAAK0+C,OACX//C,UAGAnI,MAGT6wD,EAAGlpD,UAAUi2D,KAAO,SAAexV,UAC1BpoD,KAAKsyD,QAAQH,MAAM/J,IAI5ByI,EAAGlpD,UAAUk2D,IAAM,kBACV79D,KAAKwxD,IAAIxxD,OAIlB6wD,EAAGlpD,UAAUm2D,KAAO,kBACX99D,KAAKywD,KAAKzwD,KAAKsyD,UAIxBzB,EAAGlpD,UAAUk2B,IAAM,SAAcuqB,OAC3B3f,WAxxCe2f,WACf3f,EAAI,IAAI/7B,MAAM07C,EAAI4L,aAEb2B,EAAM,EAAGA,EAAMltB,EAAEtgC,OAAQwtD,IAAO,KACnC7D,EAAO6D,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBltB,EAAEktB,IAAQvN,EAAI4I,MAAMc,GAAQ,GAAK8D,KAAWA,SAGvCntB,EA8wCCs1B,CAAW3V;IACF,IAAb3f,EAAEtgC,OAAc,OAAO,IAAI0oD,EAAG,WAG9B39B,EAAMlzB,KACDwJ,EAAI,EAAGA,EAAIi/B,EAAEtgC,QACP,IAATsgC,EAAEj/B,GADsBA,IAAK0pB,EAAMA,EAAI2qC,YAIvCr0D,EAAIi/B,EAAEtgC,WACL,IAAIkrB,EAAIH,EAAI2qC,MAAOr0D,EAAIi/B,EAAEtgC,OAAQqB,IAAK6pB,EAAIA,EAAEwqC,MAClC,IAATp1B,EAAEj/B,KAEN0pB,EAAMA,EAAIs+B,IAAIn+B,WAIXH,GAIT29B,EAAGlpD,UAAUq2D,OAAS,SAAiB30B,GACrCqd,EAAuB,iBAATrd,GAAqBA,GAAQ,OAIvC7/B,EAHAyd,EAAIoiB,EAAO,GACX3Z,GAAK2Z,EAAOpiB,GAAK,GACjBg3C,EAAa,WAAe,GAAKh3C,GAAQ,GAAKA,KAGxC,IAANA,EAAS,KACPihC,EAAQ,MAEP1+C,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,IAAK,KAC5B00D,EAAWl+D,KAAKgxD,MAAMxnD,GAAKy0D,EAC3BruD,GAAsB,EAAhB5P,KAAKgxD,MAAMxnD,IAAU00D,GAAaj3C,OACvC+pC,MAAMxnD,GAAKoG,EAAIs4C,EACpBA,EAAQgW,IAAc,GAAKj3C,EAGzBihC,SACG8I,MAAMxnD,GAAK0+C,OACX//C,aAIC,IAANunB,EAAS;IACNlmB,EAAIxJ,KAAKmI,OAAS,EAAGqB,GAAK,EAAGA,SAC3BwnD,MAAMxnD,EAAIkmB,GAAK1vB,KAAKgxD,MAAMxnD,OAG5BA,EAAI,EAAGA,EAAIkmB,EAAGlmB,SACZwnD,MAAMxnD,GAAK,OAGbrB,QAAUunB,SAGV1vB,KAAK+xD,SAGdlB,EAAGlpD,UAAUw2D,MAAQ,SAAgB90B,UAEnCqd,EAAyB,IAAlB1mD,KAAK+wD,UACL/wD,KAAKg+D,OAAO30B,IAMrBwnB,EAAGlpD,UAAUksD,OAAS,SAAiBxqB,EAAM+Z,EAAMgb,OAE7ChzB,EADJsb,EAAuB,iBAATrd,GAAqBA,GAAQ,GAGzC+B,EADEgY,GACGA,EAAQA,EAAO,IAAO,GAEvB,MAGFn8B,EAAIoiB,EAAO,GACX3Z,EAAI/vB,KAAK6I,KAAK6gC,EAAOpiB,GAAK,GAAIjnB,KAAKmI,QACnC+0C,EAAO,SAAc,WAAcj2B,GAAMA,EACzCo3C,EAAcD,KAElBhzB,GAAK1b,EACL0b,EAAIzrC,KAAK+I,IAAI,EAAG0iC,GAGZizB,EAAa,KACV,IAAI70D,EAAI,EAAGA,EAAIkmB,EAAGlmB,IACrB60D,EAAYrN,MAAMxnD,GAAKxJ,KAAKgxD,MAAMxnD,GAEpC60D,EAAYl2D,OAASunB,KAGb,IAANA,QAEG,GAAI1vB,KAAKmI,OAASunB,WAClBvnB,QAAUunB;AACVlmB,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,SACtBwnD,MAAMxnD,GAAKxJ,KAAKgxD,MAAMxnD,EAAIkmB,aAG5BshC,MAAM,GAAK,OACX7oD,OAAS,MAGZ+/C,EAAQ,MACP1+C,EAAIxJ,KAAKmI,OAAS,EAAGqB,GAAK,IAAgB,IAAV0+C,GAAe1+C,GAAK4hC,GAAI5hC,IAAK,KAC5D49C,EAAuB,EAAhBpnD,KAAKgxD,MAAMxnD,QACjBwnD,MAAMxnD,GAAM0+C,GAAU,GAAKjhC,EAAOmgC,IAASngC,EAChDihC,EAAQd,EAAOlK,SAIbmhB,GAAyB,IAAVnW,IACjBmW,EAAYrN,MAAMqN,EAAYl2D,UAAY+/C,GAGxB,IAAhBloD,KAAKmI,cACF6oD,MAAM,GAAK,OACX7oD,OAAS,GAGTnI,KAAK+xD,SAGdlB,EAAGlpD,UAAU22D,MAAQ,SAAgBj1B,EAAM+Z,EAAMgb,UAE/C1X,EAAyB,IAAlB1mD,KAAK+wD,UACL/wD,KAAK6zD,OAAOxqB,EAAM+Z,EAAMgb,IAIjCvN,EAAGlpD,UAAU42D,KAAO,SAAel1B,UAC1BrpC,KAAKsyD,QAAQ6L,MAAM90B,IAG5BwnB,EAAGlpD,UAAU62D,MAAQ,SAAgBn1B,UAC5BrpC,KAAKsyD,QAAQ0L,OAAO30B;EAI7BwnB,EAAGlpD,UAAU82D,KAAO,SAAep1B,UAC1BrpC,KAAKsyD,QAAQgM,MAAMj1B,IAG5BwnB,EAAGlpD,UAAU+2D,MAAQ,SAAgBr1B,UAC5BrpC,KAAKsyD,QAAQuB,OAAOxqB,IAI7BwnB,EAAGlpD,UAAU4sD,MAAQ,SAAgBoB,GACnCjP,EAAsB,iBAARiP,GAAoBA,GAAO,OACrC1uC,EAAI0uC,EAAM,GACVjmC,GAAKimC,EAAM1uC,GAAK,GAChBoM,EAAI,GAAKpM,UAGTjnB,KAAKmI,QAAUunB,KAGX1vB,KAAKgxD,MAAMthC,GAEL2D,KAIhBw9B,EAAGlpD,UAAUg3D,OAAS,SAAiBt1B,GACrCqd,EAAuB,iBAATrd,GAAqBA,GAAQ,OACvCpiB,EAAIoiB,EAAO,GACX3Z,GAAK2Z,EAAOpiB,GAAK,MAErBy/B,EAAyB,IAAlB1mD,KAAK+wD,SAAgB,2CAExB/wD,KAAKmI,QAAUunB,SACV1vB,QAGC,IAANinB,GACFyI,SAEGvnB,OAASxI,KAAK6I,IAAIknB,EAAG1vB,KAAKmI,QAErB,IAAN8e,EAAS;IACPi2B,EAAO,SAAc,WAAcj2B,GAAMA,OACxC+pC,MAAMhxD,KAAKmI,OAAS,IAAM+0C,SAG1Bl9C,KAAK+xD,SAIdlB,EAAGlpD,UAAUi3D,MAAQ,SAAgBv1B,UAC5BrpC,KAAKsyD,QAAQqM,OAAOt1B,IAI7BwnB,EAAGlpD,UAAU0sD,MAAQ,SAAgBjM,UACnC1B,EAAsB,iBAAR0B,GACd1B,EAAO0B,EAAM,UACTA,EAAM,EAAUpoD,KAAK6+D,OAAOzW,GAGV,IAAlBpoD,KAAK+wD,SACa,IAAhB/wD,KAAKmI,SAAiC,EAAhBnI,KAAKgxD,MAAM,IAAU5I,QACxC4I,MAAM,GAAK5I,GAAuB,EAAhBpoD,KAAKgxD,MAAM,SAC7BD,SAAW,EACT/wD,YAGJ+wD,SAAW,OACX8N,MAAMzW,QACN2I,SAAW,EACT/wD,MAIFA,KAAKoyD,OAAOhK,IAGrByI,EAAGlpD,UAAUyqD,OAAS,SAAiBhK,QAChC4I,MAAM,IAAM5I;KAGZ,IAAI5+C,EAAI,EAAGA,EAAIxJ,KAAKmI,QAAUnI,KAAKgxD,MAAMxnD,IAAM,SAAWA,SACxDwnD,MAAMxnD,IAAM,SACbA,IAAMxJ,KAAKmI,OAAS,OACjB6oD,MAAMxnD,EAAI,GAAK,OAEfwnD,MAAMxnD,EAAI,iBAGdrB,OAASxI,KAAK+I,IAAI1I,KAAKmI,OAAQqB,EAAI,GAEjCxJ,MAIT6wD,EAAGlpD,UAAUk3D,MAAQ,SAAgBzW,MACnC1B,EAAsB,iBAAR0B,GACd1B,EAAO0B,EAAM,UACTA,EAAM,EAAG,OAAOpoD,KAAKq0D,OAAOjM,MAEV,IAAlBpoD,KAAK+wD,qBACFA,SAAW,OACXsD,MAAMjM,QACN2I,SAAW,EACT/wD,aAGJgxD,MAAM,IAAM5I,EAEG,IAAhBpoD,KAAKmI,QAAgBnI,KAAKgxD,MAAM,GAAK,OAClCA,MAAM,IAAMhxD,KAAKgxD,MAAM;KACvBD,SAAW,WAGX,IAAIvnD,EAAI,EAAGA,EAAIxJ,KAAKmI,QAAUnI,KAAKgxD,MAAMxnD,GAAK,EAAGA,SAC/CwnD,MAAMxnD,IAAM,cACZwnD,MAAMxnD,EAAI,IAAM,SAIlBxJ,KAAK+xD,SAGdlB,EAAGlpD,UAAUm3D,KAAO,SAAe1W,UAC1BpoD,KAAKsyD,QAAQ+B,MAAMjM,IAG5ByI,EAAGlpD,UAAUo3D,KAAO,SAAe3W,UAC1BpoD,KAAKsyD,QAAQuM,MAAMzW,IAG5ByI,EAAGlpD,UAAUq3D,KAAO,uBACbjO,SAAW,EAET/wD,MAGT6wD,EAAGlpD,UAAUi2B,IAAM,kBACV59B,KAAKsyD,QAAQ0M,QAGtBnO,EAAGlpD,UAAUs3D,aAAe,SAAuB7W,EAAKoJ,EAAKvZ,OAEvDzuC,EAIAi/B,EALAnS,EAAM8xB,EAAIjgD,OAAS8vC,OAGlBsa,QAAQj8B,OAGT4xB,EAAQ,MACP1+C,EAAI,EAAGA,EAAI4+C,EAAIjgD,OAAQqB,IAAK,CAC/Bi/B,GAA6B,EAAxBzoC,KAAKgxD,MAAMxnD,EAAIyuC,IAAciQ;KAC9B9iB,GAAwB,EAAfgjB,EAAI4I,MAAMxnD,IAAUgoD,EAEjCtJ,IADAzf,GAAa,SAARrD,IACS,KAAQA,EAAQ,SAAa,QACtC4rB,MAAMxnD,EAAIyuC,GAAa,SAAJxP,OAEnBj/B,EAAIxJ,KAAKmI,OAAS8vC,EAAOzuC,IAE9B0+C,GADAzf,GAA6B,EAAxBzoC,KAAKgxD,MAAMxnD,EAAIyuC,IAAciQ,IACrB,QACR8I,MAAMxnD,EAAIyuC,GAAa,SAAJxP,KAGZ,IAAVyf,EAAa,OAAOloD,KAAK+xD,YAG7BrL,GAAkB,IAAXwB,GACPA,EAAQ,EACH1+C,EAAI,EAAGA,EAAIxJ,KAAKmI,OAAQqB,IAE3B0+C,GADAzf,IAAsB,EAAhBzoC,KAAKgxD,MAAMxnD,IAAU0+C,IACd,QACR8I,MAAMxnD,GAAS,SAAJi/B,cAEbsoB,SAAW,EAET/wD,KAAK+xD,SAGdlB,EAAGlpD,UAAUu3D,SAAW,SAAmB9W,EAAK9iD,OAC1C2yC,GAAQj4C,KAAKmI,OAASigD,EAAIjgD,QAE1B5E,EAAIvD,KAAKsyD,QACT3iD,EAAIy4C,EAGJ+W,EAA8B,EAAxBxvD,EAAEqhD,MAAMrhD,EAAExH,OAAS,GAGf,IADd8vC,EAAQ,GADMj4C,KAAK8zD,WAAWqL,MAG5BxvD,EAAIA,EAAE6uD,MAAMvmB,GACZ10C,EAAEy6D,OAAO/lB;AACTknB,EAA8B,EAAxBxvD,EAAEqhD,MAAMrhD,EAAExH,OAAS,QAKvBkrB,EADAmB,EAAIjxB,EAAE4E,OAASwH,EAAExH,UAGR,QAAT7C,EAAgB,EAClB+tB,EAAI,IAAIw9B,EAAG,OACT1oD,OAASqsB,EAAI,EACfnB,EAAE29B,MAAQ,IAAItkD,MAAM2mB,EAAElrB,YACjB,IAAIqB,EAAI,EAAGA,EAAI6pB,EAAElrB,OAAQqB,IAC5B6pB,EAAE29B,MAAMxnD,GAAK,MAIb41D,EAAO77D,EAAE+uD,QAAQ2M,aAAatvD,EAAG,EAAG6kB,GAClB,IAAlB4qC,EAAKrO,WACPxtD,EAAI67D,EACA/rC,IACFA,EAAE29B,MAAMx8B,GAAK,QAIZ,IAAIa,EAAIb,EAAI,EAAGa,GAAK,EAAGA,IAAK,KAC3BgqC,EAAmC,UAAL,EAAxB97D,EAAEytD,MAAMrhD,EAAExH,OAASktB,KACE,EAA5B9xB,EAAEytD,MAAMrhD,EAAExH,OAASktB,EAAI,QAI1BgqC,EAAK1/D,KAAK6I,IAAK62D,EAAKF,EAAO,EAAG,UAE9B57D,EAAE07D,aAAatvD,EAAG0vD,EAAIhqC,GACA,IAAf9xB,EAAEwtD,UACPsO,IACA97D,EAAEwtD,SAAW,EACbxtD,EAAE07D,aAAatvD,EAAG,EAAG0lB,GAChB9xB,EAAE6vD,WACL7vD,EAAEwtD,UAAY,GAGd19B,IACFA,EAAE29B,MAAM37B,GAAKgqC,UAGbhsC,GACFA,EAAE0+B;AAEJxuD,EAAEwuD,QAGW,QAATzsD,GAA4B,IAAV2yC,GACpB10C,EAAEswD,OAAO5b,GAGJ,CACLqnB,IAAKjsC,GAAK,KACV6+B,IAAK3uD,IAQTstD,EAAGlpD,UAAU43D,OAAS,SAAiBnX,EAAK9iD,EAAMk6D,UAChD9Y,GAAQ0B,EAAIgL,UAERpzD,KAAKozD,SACA,CACLkM,IAAK,IAAIzO,EAAG,GACZqB,IAAK,IAAIrB,EAAG,IAKM,IAAlB7wD,KAAK+wD,UAAmC,IAAjB3I,EAAI2I,UAC7B79B,EAAMlzB,KAAK20D,MAAM4K,OAAOnX,EAAK9iD,GAEhB,QAATA,IACFg6D,EAAMpsC,EAAIosC,IAAI3K,OAGH,QAATrvD,IACF4sD,EAAMh/B,EAAIg/B,IAAIyC,MACV6K,GAA6B,IAAjBtN,EAAInB,UAClBmB,EAAI2D,KAAKzN,IAIN,CACLkX,IAAKA,EACLpN,IAAKA,IAIa,IAAlBlyD,KAAK+wD,UAAmC,IAAjB3I,EAAI2I,UAC7B79B,EAAMlzB,KAAKu/D,OAAOnX,EAAIuM,MAAOrvD,GAEhB,QAATA,IACFg6D,EAAMpsC,EAAIosC,IAAI3K,OAGT,CACL2K,IAAKA,EACLpN,IAAKh/B,EAAIg/B,MAI0B,IAAlClyD,KAAK+wD,SAAW3I,EAAI2I,WACvB79B,EAAMlzB,KAAK20D,MAAM4K,OAAOnX,EAAIuM,MAAOrvD;AAEtB,QAATA,IACF4sD,EAAMh/B,EAAIg/B,IAAIyC,MACV6K,GAA6B,IAAjBtN,EAAInB,UAClBmB,EAAI4D,KAAK1N,IAIN,CACLkX,IAAKpsC,EAAIosC,IACTpN,IAAKA,IAOL9J,EAAIjgD,OAASnI,KAAKmI,QAAUnI,KAAKyxD,IAAIrJ,GAAO,EACvC,CACLkX,IAAK,IAAIzO,EAAG,GACZqB,IAAKlyD,MAKU,IAAfooD,EAAIjgD,OACO,QAAT7C,EACK,CACLg6D,IAAKt/D,KAAKy/D,KAAKrX,EAAI4I,MAAM,IACzBkB,IAAK,MAII,QAAT5sD,EACK,CACLg6D,IAAK,KACLpN,IAAK,IAAIrB,EAAG7wD,KAAKqzD,KAAKjL,EAAI4I,MAAM,MAI7B,CACLsO,IAAKt/D,KAAKy/D,KAAKrX,EAAI4I,MAAM,IACzBkB,IAAK,IAAIrB,EAAG7wD,KAAKqzD,KAAKjL,EAAI4I,MAAM,MAI7BhxD,KAAKk/D,SAAS9W,EAAK9iD,OAlFtBg6D,EAAKpN,EAAKh/B,GAsFhB29B,EAAGlpD,UAAU23D,IAAM,SAAclX,UACxBpoD,KAAKu/D,OAAOnX,EAAK,OAAO,GAAOkX,KAIxCzO,EAAGlpD,UAAUuqD,IAAM,SAAc9J,UACxBpoD,KAAKu/D,OAAOnX,EAAK,OAAO,GAAO8J,KAGxCrB,EAAGlpD,UAAU+3D,KAAO,SAAetX;OAC1BpoD,KAAKu/D,OAAOnX,EAAK,OAAO,GAAM8J,KAIvCrB,EAAGlpD,UAAUg4D,SAAW,SAAmBvX,OACrCwX,EAAK5/D,KAAKu/D,OAAOnX,MAGjBwX,EAAG1N,IAAIkB,SAAU,OAAOwM,EAAGN,QAE3BpN,EAA0B,IAApB0N,EAAGN,IAAIvO,SAAiB6O,EAAG1N,IAAI4D,KAAK1N,GAAOwX,EAAG1N,IAEpD2N,EAAOzX,EAAIsW,MAAM,GACjBoB,EAAK1X,EAAIwL,MAAM,GACfnC,EAAMS,EAAIT,IAAIoO,UAGdpO,EAAM,GAAY,IAAPqO,GAAoB,IAARrO,EAAkBmO,EAAGN,IAGrB,IAApBM,EAAGN,IAAIvO,SAAiB6O,EAAGN,IAAIT,MAAM,GAAKe,EAAGN,IAAIjL,MAAM,IAGhExD,EAAGlpD,UAAU0rD,KAAO,SAAejL,GACjC1B,EAAO0B,GAAO,kBACV//B,GAAK,GAAK,IAAM+/B,EAEhBvD,EAAM,EACDr7C,EAAIxJ,KAAKmI,OAAS,EAAGqB,GAAK,EAAGA,IACpCq7C,GAAOx8B,EAAIw8B,GAAuB,EAAhB7kD,KAAKgxD,MAAMxnD,KAAW4+C,SAGnCvD,GAITgM,EAAGlpD,UAAU2rD,MAAQ,SAAgBlL,GACnC1B,EAAO0B,GAAO,kBAEVF,EAAQ,EACH1+C,EAAIxJ,KAAKmI,OAAS,EAAGqB,GAAK,EAAGA,IAAK;IACrCi/B,GAAqB,EAAhBzoC,KAAKgxD,MAAMxnD,IAAkB,SAAR0+C,OACzB8I,MAAMxnD,GAAMi/B,EAAI2f,EAAO,EAC5BF,EAAQzf,EAAI2f,SAGPpoD,KAAK+xD,SAGdlB,EAAGlpD,UAAU83D,KAAO,SAAerX,UAC1BpoD,KAAKsyD,QAAQgB,MAAMlL,IAG5ByI,EAAGlpD,UAAUo4D,KAAO,SAAe13C,GACjCq+B,EAAsB,IAAfr+B,EAAE0oC,UACTrK,GAAQr+B,EAAE+qC,cAENpvC,EAAIhkB,KACJupD,EAAIlhC,EAAEiqC,QAGRtuC,EADiB,IAAfA,EAAE+sC,SACA/sC,EAAE07C,KAAKr3C,GAEPrE,EAAEsuC,gBAIJh/B,EAAI,IAAIu9B,EAAG,GACXhC,EAAI,IAAIgC,EAAG,GAGX5gD,EAAI,IAAI4gD,EAAG,GACX/B,EAAI,IAAI+B,EAAG,GAEXhG,EAAI,EAED7mC,EAAEg8C,UAAYzW,EAAEyW,UACrBh8C,EAAE6vC,OAAO,GACTtK,EAAEsK,OAAO,KACPhJ,UAGAoV,EAAK1W,EAAE+I,QACP4N,EAAKl8C,EAAEsuC,SAEHtuC,EAAEovC,UAAU,KACb,IAAI5pD,EAAI,EAAG22D,EAAK,EAAyB,IAArBn8C,EAAEgtC,MAAM,GAAKmP,IAAa32D,EAAI,KAAMA,EAAG22D,IAAO;GACnE32D,EAAI,MACNwa,EAAE6vC,OAAOrqD,GACFA,KAAM,IACP8pB,EAAE8sC,SAAWvR,EAAEuR,WACjB9sC,EAAEuiC,KAAKoK,GACPpR,EAAEiH,KAAKoK,IAGT5sC,EAAEugC,OAAO,GACThF,EAAEgF,OAAO,OAIR,IAAIx+B,EAAI,EAAGgrC,EAAK,EAAyB,IAArB9W,EAAEyH,MAAM,GAAKqP,IAAahrC,EAAI,KAAMA,EAAGgrC,IAAO,MACnEhrC,EAAI,MACNk0B,EAAEsK,OAAOx+B,GACFA,KAAM,IACPplB,EAAEmwD,SAAWtR,EAAEsR,WACjBnwD,EAAE4lD,KAAKoK,GACPnR,EAAEgH,KAAKoK,IAGTjwD,EAAE4jD,OAAO,GACT/E,EAAE+E,OAAO,GAIT7vC,EAAEytC,IAAIlI,IAAM,GACdvlC,EAAE8xC,KAAKvM,GACPj2B,EAAEwiC,KAAK7lD,GACP4+C,EAAEiH,KAAKhH,KAEPvF,EAAEuM,KAAK9xC,GACP/T,EAAE6lD,KAAKxiC,GACPw7B,EAAEgH,KAAKjH,UAIJ,CACLtrD,EAAG0M,EACHN,EAAGm/C,EACHwR,IAAK/W,EAAEyU,OAAOnT,KAOlBgG,EAAGlpD,UAAU44D,OAAS,SAAiBl4C,GACrCq+B,EAAsB,IAAfr+B,EAAE0oC,UACTrK,GAAQr+B,EAAE+qC,cAEN7vD,EAAIvD,KACJ2P,EAAI0Y,EAAEiqC,QAGR/uD,EADiB,IAAfA,EAAEwtD,SACAxtD,EAAEm8D,KAAKr3C,GAEP9kB,EAAE+uD;SA0CJp/B,EAvCAstC,EAAK,IAAI3P,EAAG,GACZ1L,EAAK,IAAI0L,EAAG,GAEZ4P,EAAQ9wD,EAAE2iD,QAEP/uD,EAAEm9D,KAAK,GAAK,GAAK/wD,EAAE+wD,KAAK,GAAK,GAAG,KAChC,IAAIl3D,EAAI,EAAG22D,EAAK,EAAyB,IAArB58D,EAAEytD,MAAM,GAAKmP,IAAa32D,EAAI,KAAMA,EAAG22D,IAAO,MACnE32D,EAAI,MACNjG,EAAEswD,OAAOrqD,GACFA,KAAM,GACPg3D,EAAGJ,SACLI,EAAG3K,KAAK4K,GAGVD,EAAG3M,OAAO,OAIT,IAAIx+B,EAAI,EAAGgrC,EAAK,EAAyB,IAArB1wD,EAAEqhD,MAAM,GAAKqP,IAAahrC,EAAI,KAAMA,EAAGgrC,IAAO,MACnEhrC,EAAI,MACN1lB,EAAEkkD,OAAOx+B,GACFA,KAAM,GACP8vB,EAAGib,SACLjb,EAAG0Q,KAAK4K,GAGVtb,EAAG0O,OAAO,GAIVtwD,EAAEkuD,IAAI9hD,IAAM,GACdpM,EAAEuyD,KAAKnmD,GACP6wD,EAAG1K,KAAK3Q,KAERx1C,EAAEmmD,KAAKvyD,GACP4hD,EAAG2Q,KAAK0K,WAMVttC,EADgB,IAAd3vB,EAAEm9D,KAAK,GACHF,EAEArb,GAGAub,KAAK,GAAK,GAChBxtC,EAAI2iC,KAAKxtC,GAGJ6K,GAGT29B,EAAGlpD,UAAU24D,IAAM,SAAclY,MAC3BpoD,KAAKozD,SAAU,OAAOhL,EAAIxqB;IAC1BwqB,EAAIgL,SAAU,OAAOpzD,KAAK49B,UAE1Br6B,EAAIvD,KAAKsyD,QACT3iD,EAAIy4C,EAAIkK,QACZ/uD,EAAEwtD,SAAW,EACbphD,EAAEohD,SAAW,MAGR,IAAI9Y,EAAQ,EAAG10C,EAAEy8D,UAAYrwD,EAAEqwD,SAAU/nB,IAC5C10C,EAAEswD,OAAO,GACTlkD,EAAEkkD,OAAO,UAGR,MACMtwD,EAAEy8D,UACPz8D,EAAEswD,OAAO,QAEJlkD,EAAEqwD,UACPrwD,EAAEkkD,OAAO,OAGP5sC,EAAI1jB,EAAEkuD,IAAI9hD,MACVsX,EAAI,EAAG,KAEL8nB,EAAIxrC,EACRA,EAAIoM,EACJA,EAAIo/B,OACC,GAAU,IAAN9nB,GAAyB,IAAdtX,EAAE+wD,KAAK,SAI7Bn9D,EAAEuyD,KAAKnmD,UAGFA,EAAEquD,OAAO/lB,IAIlB4Y,EAAGlpD,UAAUg5D,KAAO,SAAevY,UAC1BpoD,KAAK+/D,KAAK3X,GAAK7kD,EAAEm8D,KAAKtX,IAG/ByI,EAAGlpD,UAAUq4D,OAAS,kBACW,IAAP,EAAhBhgE,KAAKgxD,MAAM,KAGrBH,EAAGlpD,UAAUy4D,MAAQ,kBACY,IAAP,EAAhBpgE,KAAKgxD,MAAM;AAIrBH,EAAGlpD,UAAUisD,MAAQ,SAAgBxL,UAC5BpoD,KAAKgxD,MAAM,GAAK5I,GAIzByI,EAAGlpD,UAAUi5D,MAAQ,SAAgBjL,GACnCjP,EAAsB,iBAARiP,OACV1uC,EAAI0uC,EAAM,GACVjmC,GAAKimC,EAAM1uC,GAAK,GAChBoM,EAAI,GAAKpM,KAGTjnB,KAAKmI,QAAUunB,cACZ6iC,QAAQ7iC,EAAI,QACZshC,MAAMthC,IAAM2D,EACVrzB,aAILkoD,EAAQ70B,EACH7pB,EAAIkmB,EAAa,IAAVw4B,GAAe1+C,EAAIxJ,KAAKmI,OAAQqB,IAAK,KAC/Ci/B,EAAoB,EAAhBzoC,KAAKgxD,MAAMxnD,GAEnB0+C,GADAzf,GAAKyf,KACS,GACdzf,GAAK,cACAuoB,MAAMxnD,GAAKi/B,SAEJ,IAAVyf,SACG8I,MAAMxnD,GAAK0+C,OACX//C,UAEAnI,MAGT6wD,EAAGlpD,UAAUyrD,OAAS,kBACG,IAAhBpzD,KAAKmI,QAAkC,IAAlBnI,KAAKgxD,MAAM,IAGzCH,EAAGlpD,UAAU+4D,KAAO,SAAetY,OAQ7Bl1B,EAPA69B,EAAW3I,EAAM;IAEC,IAAlBpoD,KAAK+wD,WAAmBA,EAAU,OAAQ,KACxB,IAAlB/wD,KAAK+wD,UAAkBA,EAAU,OAAO,UAEvCgB,QAGD/xD,KAAKmI,OAAS,EAChB+qB,EAAM,MACD,CACD69B,IACF3I,GAAOA,GAGT1B,EAAO0B,GAAO,SAAW,yBAErB3f,EAAoB,EAAhBzoC,KAAKgxD,MAAM,GACnB99B,EAAMuV,IAAM2f,EAAM,EAAI3f,EAAI2f,GAAO,EAAI,SAEjB,IAAlBpoD,KAAK+wD,SAA8B,GAAN79B,EAC1BA,GAOT29B,EAAGlpD,UAAU8pD,IAAM,SAAcrJ,MACT,IAAlBpoD,KAAK+wD,UAAmC,IAAjB3I,EAAI2I,SAAgB,OAAQ,KACjC,IAAlB/wD,KAAK+wD,UAAmC,IAAjB3I,EAAI2I,SAAgB,OAAO,MAElD79B,EAAMlzB,KAAK6gE,KAAKzY,UACE,IAAlBpoD,KAAK+wD,SAA8B,GAAN79B,EAC1BA,GAIT29B,EAAGlpD,UAAUk5D,KAAO,SAAezY,MAE7BpoD,KAAKmI,OAASigD,EAAIjgD,OAAQ,OAAO,KACjCnI,KAAKmI,OAASigD,EAAIjgD,OAAQ,OAAQ;SAElC+qB,EAAM,EACD1pB,EAAIxJ,KAAKmI,OAAS,EAAGqB,GAAK,EAAGA,IAAK,KACrCjG,EAAoB,EAAhBvD,KAAKgxD,MAAMxnD,GACfmG,EAAmB,EAAfy4C,EAAI4I,MAAMxnD,MAEdjG,IAAMoM,GACNpM,EAAIoM,EACNujB,GAAO,EACE3vB,EAAIoM,IACbujB,EAAM,iBAIHA,GAGT29B,EAAGlpD,UAAUm5D,IAAM,SAAc1Y,UACL,IAAnBpoD,KAAK0gE,KAAKtY,IAGnByI,EAAGlpD,UAAUo5D,GAAK,SAAa3Y,UACJ,IAAlBpoD,KAAKyxD,IAAIrJ,IAGlByI,EAAGlpD,UAAUq5D,KAAO,SAAe5Y,UAC1BpoD,KAAK0gE,KAAKtY,IAAQ,GAG3ByI,EAAGlpD,UAAUs5D,IAAM,SAAc7Y,UACxBpoD,KAAKyxD,IAAIrJ,IAAQ,GAG1ByI,EAAGlpD,UAAUu5D,IAAM,SAAc9Y,UACJ,IAApBpoD,KAAK0gE,KAAKtY,IAGnByI,EAAGlpD,UAAUw5D,GAAK,SAAa/Y,UACH,IAAnBpoD,KAAKyxD,IAAIrJ,IAGlByI,EAAGlpD,UAAUy5D,KAAO,SAAehZ,UAC1BpoD,KAAK0gE,KAAKtY,IAAQ;AAG3ByI,EAAGlpD,UAAU05D,IAAM,SAAcjZ,UACxBpoD,KAAKyxD,IAAIrJ,IAAQ,GAG1ByI,EAAGlpD,UAAU25D,IAAM,SAAclZ,UACL,IAAnBpoD,KAAK0gE,KAAKtY,IAGnByI,EAAGlpD,UAAU45D,GAAK,SAAanZ,UACJ,IAAlBpoD,KAAKyxD,IAAIrJ,IAOlByI,EAAGI,IAAM,SAAc7I,UACd,IAAIoZ,EAAIpZ,IAGjByI,EAAGlpD,UAAU85D,MAAQ,SAAgBC,UACnChb,GAAQ1mD,KAAKixD,IAAK,yCAClBvK,EAAyB,IAAlB1mD,KAAK+wD,SAAgB,iCACrB2Q,EAAIC,UAAU3hE,MAAM4hE,UAAUF,IAGvC7Q,EAAGlpD,UAAUk6D,QAAU,kBACrBnb,EAAO1mD,KAAKixD,IAAK,wDACVjxD,KAAKixD,IAAI6Q,YAAY9hE;AAG9B6wD,EAAGlpD,UAAUi6D,UAAY,SAAoBF,eACtCzQ,IAAMyQ,EACJ1hE,MAGT6wD,EAAGlpD,UAAUo6D,SAAW,SAAmBL,UACzChb,GAAQ1mD,KAAKixD,IAAK,yCACXjxD,KAAK4hE,UAAUF,IAGxB7Q,EAAGlpD,UAAUq6D,OAAS,SAAiB5Z,UACrC1B,EAAO1mD,KAAKixD,IAAK,sCACVjxD,KAAKixD,IAAIx3B,IAAIz5B,KAAMooD,IAG5ByI,EAAGlpD,UAAUs6D,QAAU,SAAkB7Z,UACvC1B,EAAO1mD,KAAKixD,IAAK,uCACVjxD,KAAKixD,IAAI4E,KAAK71D,KAAMooD,IAG7ByI,EAAGlpD,UAAUu6D,OAAS,SAAiB9Z,UACrC1B,EAAO1mD,KAAKixD,IAAK,sCACVjxD,KAAKixD,IAAI/N,IAAIljD,KAAMooD;AAG5ByI,EAAGlpD,UAAUw6D,QAAU,SAAkB/Z,UACvC1B,EAAO1mD,KAAKixD,IAAK,uCACVjxD,KAAKixD,IAAI6E,KAAK91D,KAAMooD,IAG7ByI,EAAGlpD,UAAUy6D,OAAS,SAAiBha,UACrC1B,EAAO1mD,KAAKixD,IAAK,sCACVjxD,KAAKixD,IAAIoR,IAAIriE,KAAMooD,IAG5ByI,EAAGlpD,UAAU26D,OAAS,SAAiBla,UACrC1B,EAAO1mD,KAAKixD,IAAK,2CACZA,IAAIsR,SAASviE,KAAMooD,GACjBpoD,KAAKixD,IAAIO,IAAIxxD,KAAMooD,IAG5ByI,EAAGlpD,UAAU66D,QAAU,SAAkBpa,UACvC1B,EAAO1mD,KAAKixD,IAAK,2CACZA,IAAIsR,SAASviE,KAAMooD,GACjBpoD,KAAKixD,IAAIR,KAAKzwD,KAAMooD;AAG7ByI,EAAGlpD,UAAU86D,OAAS,kBACpB/b,EAAO1mD,KAAKixD,IAAK,2CACZA,IAAIyR,SAAS1iE,MACXA,KAAKixD,IAAI4M,IAAI79D,OAGtB6wD,EAAGlpD,UAAUg7D,QAAU,kBACrBjc,EAAO1mD,KAAKixD,IAAK,4CACZA,IAAIyR,SAAS1iE,MACXA,KAAKixD,IAAI6M,KAAK99D,OAIvB6wD,EAAGlpD,UAAUi7D,QAAU,kBACrBlc,EAAO1mD,KAAKixD,IAAK,4CACZA,IAAIyR,SAAS1iE,MACXA,KAAKixD,IAAI4R,KAAK7iE,OAGvB6wD,EAAGlpD,UAAUm7D,QAAU,kBACrBpc,EAAO1mD,KAAKixD,IAAK;KACZA,IAAIyR,SAAS1iE,MACXA,KAAKixD,IAAI0P,KAAK3gE,OAIvB6wD,EAAGlpD,UAAUo7D,OAAS,kBACpBrc,EAAO1mD,KAAKixD,IAAK,2CACZA,IAAIyR,SAAS1iE,MACXA,KAAKixD,IAAI0D,IAAI30D,OAGtB6wD,EAAGlpD,UAAUq7D,OAAS,SAAiB5a,UACrC1B,EAAO1mD,KAAKixD,MAAQ7I,EAAI6I,IAAK,0BACxBA,IAAIyR,SAAS1iE,MACXA,KAAKixD,IAAIpzB,IAAI79B,KAAMooD,QAIxB6a,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,eAIDC,EAAQp0D,EAAMmZ,QAEhBnZ,KAAOA,OACPmZ,EAAI,IAAIwoC,EAAGxoC,EAAG,SACda,EAAIlpB,KAAKqoB,EAAE2rC,iBACX7qC,EAAI,IAAI0nC,EAAG,GAAGmN,OAAOh+D,KAAKkpB,GAAG4sC,KAAK91D,KAAKqoB,QAEvCk7C,IAAMvjE,KAAKwjE,gBAiDTC;AACPH,EAAOxiE,KACLd,KACA,OACA,oFA+DK0jE,IACPJ,EAAOxiE,KACLd,KACA,OACA,2EAIK2jE,IACPL,EAAOxiE,KACLd,KACA,OACA,kEAIK4jE,IAEPN,EAAOxiE,KACLd,KACA,QACA,gFA8CKwhE,EAAKhtC,MACK,iBAANA,EAAgB,KACrBqvC,EAAQhT,EAAGiT,OAAOtvC,QACjBA,EAAIqvC,EAAMx7C,OACVw7C,MAAQA;MAEbnd,EAAOlyB,EAAEssC,IAAI,GAAI,uCACZtsC,EAAIA,OACJqvC,MAAQ,cAkORE,EAAMvvC,GACbgtC,EAAI1gE,KAAKd,KAAMw0B,QAEVyjB,MAAQj4C,KAAKw0B,EAAEw/B,YAChBh0D,KAAKi4C,MAAQ,IAAO,SACjBA,OAAS,GAAMj4C,KAAKi4C,MAAQ,SAG9BhxB,EAAI,IAAI4pC,EAAG,GAAGmN,OAAOh+D,KAAKi4C,YAC1B6nB,GAAK9/D,KAAKgkE,KAAKhkE,KAAKinB,EAAE42C,YACtBoG,KAAOjkE,KAAKinB,EAAEs5C,OAAOvgE,KAAKw0B,QAE1B0vC,KAAOlkE,KAAKikE,KAAKzS,IAAIxxD,KAAKinB,GAAG43C,MAAM,GAAGS,IAAIt/D,KAAKw0B,QAC/C0vC,KAAOlkE,KAAKkkE,KAAKxE,KAAK1/D,KAAKinB,QAC3Bi9C,KAAOlkE,KAAKinB,EAAEi8B,IAAIljD,KAAKkkE,MA5a9BZ,EAAO37D,UAAU67D,KAAO,eAClBD,EAAM,IAAI1S,EAAG,aACjB0S,EAAIvS,MAAQ,IAAItkD,MAAM/M,KAAKyI,KAAKpI,KAAKkpB,EAAI,KAClCq6C;AAGTD,EAAO37D,UAAUw8D,QAAU,SAAkB/b,OAIvCgc,EADAn9C,EAAImhC,UAIDvmD,MAAMolB,EAAGjnB,KAAKujE,KAGnBa,GADAn9C,GADAA,EAAIjnB,KAAKqkE,MAAMp9C,IACT4uC,KAAK71D,KAAKujE,MACPvP,kBACFoQ,EAAOpkE,KAAKkpB,OAEjBuoC,EAAM2S,EAAOpkE,KAAKkpB,GAAK,EAAIjC,EAAE45C,KAAK7gE,KAAKqoB,UAC/B,IAARopC,GACFxqC,EAAE+pC,MAAM,GAAK,EACb/pC,EAAE9e,OAAS,GACFspD,EAAM,EACfxqC,EAAE6uC,KAAK91D,KAAKqoB,QAEIrmB,IAAZilB,EAAE8qC,MAEJ9qC,EAAE8qC,QAGF9qC,EAAEq9C,SAICr9C,GAGTq8C,EAAO37D,UAAU9F,MAAQ,SAAgBS,EAAOw2C,GAC9Cx2C,EAAMuxD,OAAO7zD,KAAKkpB,EAAG,EAAG4vB,IAG1BwqB,EAAO37D,UAAU08D,MAAQ,SAAgBjc,UAChCA,EAAIqI,KAAKzwD,KAAKmpB,IASvB69B,EAASyc,EAAMH,GAEfG,EAAK97D,UAAU9F,MAAQ,SAAgBS,EAAOwwB,WAExCoqB,EAAO,QAEPqnB,EAAS5kE,KAAK6I,IAAIlG,EAAM6F,OAAQ,GAC3BqB,EAAI,EAAGA,EAAI+6D,EAAQ/6D,IAC1BspB,EAAOk+B,MAAMxnD,GAAKlH,EAAM0uD,MAAMxnD;IAEhCspB,EAAO3qB,OAASo8D,EAEZjiE,EAAM6F,QAAU,SAClB7F,EAAM0uD,MAAM,GAAK,OACjB1uD,EAAM6F,OAAS,OAKb+lB,EAAO5rB,EAAM0uD,MAAM,OACvBl+B,EAAOk+B,MAAMl+B,EAAO3qB,UAAY+lB,EAAOgvB,EAElC1zC,EAAI,GAAIA,EAAIlH,EAAM6F,OAAQqB,IAAK,KAC9BuO,EAAwB,EAAjBzV,EAAM0uD,MAAMxnD,GACvBlH,EAAM0uD,MAAMxnD,EAAI,KAAQuO,EAAOmlC,IAAS,EAAMhvB,IAAS,GACvDA,EAAOnW,EAETmW,KAAU,GACV5rB,EAAM0uD,MAAMxnD,EAAI,IAAM0kB,EACT,IAATA,GAAc5rB,EAAM6F,OAAS,GAC/B7F,EAAM6F,QAAU,GAEhB7F,EAAM6F,QAAU,GAIpBs7D,EAAK97D,UAAU08D,MAAQ,SAAgBjc,GAErCA,EAAI4I,MAAM5I,EAAIjgD,QAAU,EACxBigD,EAAI4I,MAAM5I,EAAIjgD,OAAS,GAAK,EAC5BigD,EAAIjgD,QAAU,UAGVy/C,EAAK,EACAp+C,EAAI,EAAGA,EAAI4+C,EAAIjgD,OAAQqB,IAAK,KAC/Bi/B,EAAmB,EAAf2f,EAAI4I,MAAMxnD,GAClBo+C,GAAU,IAAJnf,EACN2f,EAAI4I,MAAMxnD,GAAU,SAALo+C,EACfA,EAAS,GAAJnf,GAAamf,EAAK,SAAa,UAIJ,IAA9BQ,EAAI4I,MAAM5I,EAAIjgD,OAAS,KACzBigD,EAAIjgD;AAC8B,IAA9BigD,EAAI4I,MAAM5I,EAAIjgD,OAAS,IACzBigD,EAAIjgD,UAGDigD,GASTpB,EAAS0c,EAAMJ,GAQftc,EAAS2c,EAAML,GASftc,EAAS4c,EAAQN,GAEjBM,EAAOj8D,UAAU08D,MAAQ,SAAgBjc,WAEnCF,EAAQ,EACH1+C,EAAI,EAAGA,EAAI4+C,EAAIjgD,OAAQqB,IAAK,KAC/Bq+C,EAA0B,IAAL,EAAfO,EAAI4I,MAAMxnD,IAAiB0+C,EACjCN,EAAU,SAALC,EACTA,KAAQ,GAERO,EAAI4I,MAAMxnD,GAAKo+C,EACfM,EAAQL,SAEI,IAAVK,IACFE,EAAI4I,MAAM5I,EAAIjgD,UAAY+/C,GAErBE,GAITyI,EAAGiT,OAAS,SAAgB50D,MAEtB+zD,EAAO/zD,GAAO,OAAO+zD,EAAO/zD,OAE5B20D,KACS,SAAT30D,EACF20D,EAAQ,IAAIJ,OACP,GAAa,SAATv0D,EACT20D,EAAQ,IAAIH,OACP,GAAa,SAATx0D,EACT20D,EAAQ,IAAIF,MACP,CAAA,GAAa,WAATz0D,QAGH,IAAIyb,MAAM,iBAAmBzb,GAFnC20D,EAAQ,IAAID,SAIdX,EAAO/zD,GAAQ20D,EAERA,GAkBTrC,EAAI75D,UAAU+6D,SAAW,SAAmBn/D;AAC1CmjD,EAAsB,IAAfnjD,EAAEwtD,SAAgB,iCACzBrK,EAAOnjD,EAAE0tD,IAAK,oCAGhBuQ,EAAI75D,UAAU46D,SAAW,SAAmBh/D,EAAGoM,GAC7C+2C,EAAqC,IAA7BnjD,EAAEwtD,SAAWphD,EAAEohD,UAAiB,iCACxCrK,EAAOnjD,EAAE0tD,KAAO1tD,EAAE0tD,MAAQthD,EAAEshD,IAC1B,oCAGJuQ,EAAI75D,UAAUq8D,KAAO,SAAezgE,UAC9BvD,KAAK6jE,MAAc7jE,KAAK6jE,MAAMM,QAAQ5gE,GAAGq+D,UAAU5hE,MAChDuD,EAAEm8D,KAAK1/D,KAAKw0B,GAAGotC,UAAU5hE,OAGlCwhE,EAAI75D,UAAUgtD,IAAM,SAAcpxD,UAC5BA,EAAE6vD,SACG7vD,EAAE+uD,QAGJtyD,KAAKw0B,EAAE0uB,IAAI3/C,GAAGq+D,UAAU5hE,OAGjCwhE,EAAI75D,UAAU8xB,IAAM,SAAcl2B,EAAGoM;KAC9B4yD,SAASh/D,EAAGoM,OAEbujB,EAAM3vB,EAAEk2B,IAAI9pB,UACZujB,EAAIu+B,IAAIzxD,KAAKw0B,IAAM,GACrBtB,EAAI4iC,KAAK91D,KAAKw0B,GAETtB,EAAI0uC,UAAU5hE,OAGvBwhE,EAAI75D,UAAUkuD,KAAO,SAAetyD,EAAGoM,QAChC4yD,SAASh/D,EAAGoM,OAEbujB,EAAM3vB,EAAEsyD,KAAKlmD,UACbujB,EAAIu+B,IAAIzxD,KAAKw0B,IAAM,GACrBtB,EAAI4iC,KAAK91D,KAAKw0B,GAETtB,GAGTsuC,EAAI75D,UAAUu7C,IAAM,SAAc3/C,EAAGoM,QAC9B4yD,SAASh/D,EAAGoM,OAEbujB,EAAM3vB,EAAE2/C,IAAIvzC,UACZujB,EAAIwtC,KAAK,GAAK,GAChBxtC,EAAI2iC,KAAK71D,KAAKw0B,GAETtB,EAAI0uC,UAAU5hE,OAGvBwhE,EAAI75D,UAAUmuD,KAAO,SAAevyD,EAAGoM,QAChC4yD,SAASh/D,EAAGoM,OAEbujB,EAAM3vB,EAAEuyD,KAAKnmD,UACbujB,EAAIwtC,KAAK,GAAK,GAChBxtC,EAAI2iC,KAAK71D,KAAKw0B,GAETtB,GAGTsuC,EAAI75D,UAAU06D,IAAM,SAAc9+D,EAAG6kD,eAC9Bsa,SAASn/D,GACPvD,KAAKgkE,KAAKzgE,EAAEi7D,MAAMpW;EAG3BoZ,EAAI75D,UAAU8oD,KAAO,SAAeltD,EAAGoM,eAChC4yD,SAASh/D,EAAGoM,GACV3P,KAAKgkE,KAAKzgE,EAAEktD,KAAK9gD,KAG1B6xD,EAAI75D,UAAU6pD,IAAM,SAAcjuD,EAAGoM,eAC9B4yD,SAASh/D,EAAGoM,GACV3P,KAAKgkE,KAAKzgE,EAAEiuD,IAAI7hD,KAGzB6xD,EAAI75D,UAAUm2D,KAAO,SAAev6D,UAC3BvD,KAAKywD,KAAKltD,EAAGA,EAAE+uD,UAGxBkP,EAAI75D,UAAUk2D,IAAM,SAAct6D,UACzBvD,KAAKwxD,IAAIjuD,EAAGA,IAGrBi+D,EAAI75D,UAAUk7D,KAAO,SAAet/D,MAC9BA,EAAE6vD,SAAU,OAAO7vD,EAAE+uD,YAErBkS,EAAOxkE,KAAKw0B,EAAEo/B,MAAM,MACxBlN,EAAO8d,EAAO,GAAM,GAGP,IAATA,EAAY,KACV3mC,EAAM79B,KAAKw0B,EAAEiF,IAAI,IAAIo3B,EAAG,IAAIgD,OAAO,UAChC7zD,KAAK69B,IAAIt6B,EAAGs6B,WAMjBxK,EAAIrzB,KAAKw0B,EAAEuqC,KAAK,GAChBrvC,EAAI,GACA2D,EAAE+/B,UAA2B,IAAf//B,EAAEugC,MAAM,IAC5BlkC;AACA2D,EAAEwgC,OAAO,GAEXnN,GAAQrzB,EAAE+/B,cAENqR,EAAM,IAAI5T,EAAG,GAAG4Q,MAAMzhE,MACtB0kE,EAAOD,EAAI1B,SAIX4B,EAAO3kE,KAAKw0B,EAAEuqC,KAAK,GAAGlL,OAAO,GAC7BrgC,EAAIxzB,KAAKw0B,EAAEw/B,gBACfxgC,EAAI,IAAIq9B,EAAG,EAAIr9B,EAAIA,GAAGiuC,MAAMzhE,MAEW,IAAhCA,KAAK69B,IAAIrK,EAAGmxC,GAAMlT,IAAIiT,IAC3BlxC,EAAEyuC,QAAQyC,WAGR90D,EAAI5P,KAAK69B,IAAIrK,EAAGH,GAChBpM,EAAIjnB,KAAK69B,IAAIt6B,EAAG8vB,EAAEyrC,KAAK,GAAGjL,OAAO,IACjC9kB,EAAI/uC,KAAK69B,IAAIt6B,EAAG8vB,GAChBmB,EAAI9E,EACc,IAAfqf,EAAE0iB,IAAIgT,IAAY,SACnBlB,EAAMx0B,EACDvlC,EAAI,EAAoB,IAAjB+5D,EAAI9R,IAAIgT,GAAYj7D,IAClC+5D,EAAMA,EAAId,SAEZ/b,EAAOl9C,EAAIgrB,OACP7kB,EAAI3P,KAAK69B,IAAIjuB,EAAG,IAAIihD,EAAG,GAAGmN,OAAOxpC,EAAIhrB,EAAI,IAE7Cyd,EAAIA,EAAEq7C,OAAO3yD,GACbC,EAAID,EAAE8yD,SACN1zB,EAAIA,EAAEuzB,OAAO1yD,GACb4kB,EAAIhrB,SAGCyd,GAGTu6C,EAAI75D,UAAUg5D,KAAO,SAAep9D,OAC9BqhE,EAAMrhE,EAAEg9D,OAAOvgE,KAAKw0B;QACH,IAAjBowC,EAAI7T,UACN6T,EAAI7T,SAAW,EACR/wD,KAAKgkE,KAAKY,GAAK7B,UAEf/iE,KAAKgkE,KAAKY,IAIrBpD,EAAI75D,UAAUk2B,IAAM,SAAct6B,EAAG6kD,MAC/BA,EAAIgL,SAAU,OAAO,IAAIvC,EAAG,GAAG4Q,MAAMzhE,SACrB,IAAhBooD,EAAIsY,KAAK,GAAU,OAAOn9D,EAAE+uD,YAG5BuS,EAAM,IAAIn4D,MAAM,IACpBm4D,EAAI,GAAK,IAAIhU,EAAG,GAAG4Q,MAAMzhE,MACzB6kE,EAAI,GAAKthE,MACJ,IAAIiG,EAAI,EAAGA,EAAIq7D,EAAI18D,OAAQqB,IAC9Bq7D,EAAIr7D,GAAKxJ,KAAKwxD,IAAIqT,EAAIr7D,EAAI,GAAIjG,OAG5B2vB,EAAM2xC,EAAI,GACVC,EAAU,EACVC,EAAa,EACb/7C,EAAQo/B,EAAI4L,YAAc,OAChB,IAAVhrC,IACFA,EAAQ,IAGLxf,EAAI4+C,EAAIjgD,OAAS,EAAGqB,GAAK,EAAGA,IAAK,SAChC49C,EAAOgB,EAAI4I,MAAMxnD,GACZ6rB,EAAIrM,EAAQ,EAAGqM,GAAK,EAAGA,IAAK,KAC/BsgC,EAAOvO,GAAQ/xB,EAAK,EACpBnC,IAAQ2xC,EAAI,KACd3xC,EAAMlzB,KAAK69D,IAAI3qC,IAGL,IAARyiC,GAAyB,IAAZmP,GAKjBA,IAAY,EACZA,GAAWnP;CA9BE,KA+BboP,GACwC,IAANv7D,GAAiB,IAAN6rB,KAE7CnC,EAAMlzB,KAAKwxD,IAAIt+B,EAAK2xC,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajB/7C,EAAQ,UAGHkK,GAGTsuC,EAAI75D,UAAUg6D,UAAY,SAAoBvZ,OACxCnhC,EAAImhC,EAAIsX,KAAK1/D,KAAKw0B,UAEfvN,IAAMmhC,EAAMnhC,EAAEqrC,QAAUrrC,GAGjCu6C,EAAI75D,UAAUm6D,YAAc,SAAsB1Z,OAC5Cl1B,EAAMk1B,EAAIkK,eACdp/B,EAAI+9B,IAAM,KACH/9B,GAOT29B,EAAGmU,KAAO,SAAe5c,UAChB,IAAI2b,EAAK3b,IAmBlBpB,EAAS+c,EAAMvC,GAEfuC,EAAKp8D,UAAUg6D,UAAY,SAAoBvZ,UACtCpoD,KAAKgkE,KAAK5b,EAAIoW,MAAMx+D,KAAKi4C,SAGlC8rB,EAAKp8D,UAAUm6D,YAAc,SAAsB1Z,OAC7CnhC,EAAIjnB,KAAKgkE,KAAK5b,EAAIoJ,IAAIxxD,KAAKikE,cAC/Bh9C,EAAEgqC,IAAM,KACDhqC,GAGT88C,EAAKp8D,UAAU8oD,KAAO,SAAeltD,EAAGoM;GAClCpM,EAAE6vD,UAAYzjD,EAAEyjD,gBAClB7vD,EAAEytD,MAAM,GAAK,EACbztD,EAAE4E,OAAS,EACJ5E,MAGLwrC,EAAIxrC,EAAEktD,KAAK9gD,GACXC,EAAIm/B,EAAE6vB,MAAM5+D,KAAKi4C,OAAOuZ,IAAIxxD,KAAKkkE,MAAMvF,OAAO3+D,KAAKi4C,OAAOuZ,IAAIxxD,KAAKw0B,GACnEywC,EAAIl2B,EAAE+mB,KAAKlmD,GAAGikD,OAAO7zD,KAAKi4C,OAC1B/kB,EAAM+xC,SAENA,EAAExT,IAAIzxD,KAAKw0B,IAAM,EACnBtB,EAAM+xC,EAAEnP,KAAK91D,KAAKw0B,GACTywC,EAAEvE,KAAK,GAAK,IACrBxtC,EAAM+xC,EAAEpP,KAAK71D,KAAKw0B,IAGbtB,EAAI0uC,UAAU5hE,OAGvB+jE,EAAKp8D,UAAU6pD,IAAM,SAAcjuD,EAAGoM,MAChCpM,EAAE6vD,UAAYzjD,EAAEyjD,SAAU,OAAO,IAAIvC,EAAG,GAAG+Q,UAAU5hE,UAErD+uC,EAAIxrC,EAAEiuD,IAAI7hD,GACVC,EAAIm/B,EAAE6vB,MAAM5+D,KAAKi4C,OAAOuZ,IAAIxxD,KAAKkkE,MAAMvF,OAAO3+D,KAAKi4C,OAAOuZ,IAAIxxD,KAAKw0B,GACnEywC,EAAIl2B,EAAE+mB,KAAKlmD,GAAGikD,OAAO7zD,KAAKi4C,OAC1B/kB,EAAM+xC;QACNA,EAAExT,IAAIzxD,KAAKw0B,IAAM,EACnBtB,EAAM+xC,EAAEnP,KAAK91D,KAAKw0B,GACTywC,EAAEvE,KAAK,GAAK,IACrBxtC,EAAM+xC,EAAEpP,KAAK71D,KAAKw0B,IAGbtB,EAAI0uC,UAAU5hE,OAGvB+jE,EAAKp8D,UAAUg5D,KAAO,SAAep9D,UAEzBvD,KAAKgkE,KAAKzgE,EAAEg9D,OAAOvgE,KAAKw0B,GAAGg9B,IAAIxxD,KAAK8/D,KACnC8B,UAAU5hE,YAEmBA,mECn3GxCqoD,EAAQ/+B,WAkCH69B,EAAMC,UACO,IAAhBA,EAAKj/C,OACA,IAAMi/C,EAENA,WAIF8d,EAAMvzB,WACTze,EAAM,GACD1pB,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAC9B0pB,GAAOi0B,EAAMxV,EAAInoC,GAAGhI,SAAS,YACxB0xB,EAdTm1B,EAAMU,iBA9BWpX,EAAK2V,MAChB56C,MAAMD,QAAQklC,GAChB,OAAOA,EAAIjwC,YACRiwC,EACH,MAAO,OACLze,EAAM,MACS,iBAARye,EAAkB;IACtB,IAAInoC,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAC9B0pB,EAAI1pB,GAAc,EAATmoC,EAAInoC,UACR0pB,KAEG,QAARo0B,EAAe,EACjB3V,EAAMA,EAAI5mC,QAAQ,eAAgB,KAC1B5C,OAAS,GAAM,IACrBwpC,EAAM,IAAMA,OACLnoC,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,GAAK,EACnC0pB,EAAI9tB,KAAK++C,SAASxS,EAAInoC,GAAKmoC,EAAInoC,EAAI,GAAI,cAEhCA,EAAI,EAAGA,EAAImoC,EAAIxpC,OAAQqB,IAAK,KAC/BoG,EAAI+hC,EAAIp3B,WAAW/Q,GACnBq+C,EAAKj4C,GAAK,EACVg4C,EAAS,IAAJh4C,EACLi4C,EACF30B,EAAI9tB,KAAKyiD,EAAID,GAEb10B,EAAI9tB,KAAKwiD,UAGR10B,GAUTm1B,EAAMlB,MAAQA,EAQdkB,EAAM6c,MAAQA,EAEd7c,EAAM8c,OAAS,SAAgB7e,EAAKgB,SACtB,QAARA,EACK4d,EAAM5e,GAENA,wBCtDP+B,EAAQ/+B,EACRunC,EAAKvwD,WACL8kE,EAAYxjE,GACZyjE,EAAWhiE,GAEfglD,EAAM3B,OAAS0e,EACf/c,EAAMU,QAAUsc,EAAStc,QACzBV,EAAMlB,MAAQke,EAASle,MACvBkB,EAAM6c,MAAQG,EAASH,MACvB7c,EAAM8c,OAASE,EAASF,OA6BxB9c,EAAMid,gBA1BUld,EAAK3f,EAAGY;IAClBk8B,EAAM,IAAI74D,MAAM/M,KAAK+I,IAAI0/C,EAAI4L,YAAa3qB,GAAQ,GACtDk8B,EAAIvoB,KAAK,WAELggB,EAAK,GAAMv0B,EAAI,EACftf,EAAIi/B,EAAIkK,QAEH9oD,EAAI,EAAGA,EAAI+7D,EAAIp9D,OAAQqB,IAAK,KAC/BgqB,EACA0+B,EAAM/oC,EAAEyqC,MAAMoJ,EAAK,GACnB7zC,EAAEi3C,SAEF5sC,EADE0+B,GAAO8K,GAAM,GAAK,GACfA,GAAM,GAAK9K,EAEZA,EACN/oC,EAAE01C,MAAMrrC,IAERA,EAAI,EAGN+xC,EAAI/7D,GAAKgqB,EACTrK,EAAE0qC,OAAO,UAGJ0R,GA2DTld,EAAMmd,gBAtDUC,EAAIC,OACdC,EAAM,CACR,GACA,IAGFF,EAAKA,EAAGnT,QACRoT,EAAKA,EAAGpT,gBAGJsT,EAFAC,EAAK,EACLC,EAAK,EAEFL,EAAG/E,MAAMmF,GAAM,GAAKH,EAAGhF,MAAMoF,GAAM,GAAG,KAQvCC,EAYAC,EAlBAC,EAAOR,EAAG7R,MAAM,GAAKiS,EAAM,EAC3BK,EAAOR,EAAG9R,MAAM,GAAKkS,EAAM,EACnB,IAARG,IACFA,GAAO,GACG,IAARC,IACFA,GAAO,GAGPH,EADgB,IAAP,EAANE,GACE,EAGO,KADZL,EAAMH,EAAG7R,MAAM,GAAKiS,EAAM,IACF,IAAPD,GAAqB,IAARM,EAGvBD,GAFCA,EAIVN,EAAI,GAAGvgE,KAAK2gE;AAIVC,EADgB,IAAP,EAANE,GACE,EAGO,KADZN,EAAMF,EAAG9R,MAAM,GAAKkS,EAAM,IACF,IAAPF,GAAqB,IAARK,EAGvBC,GAFCA,EAIVP,EAAI,GAAGvgE,KAAK4gE,GAGR,EAAIH,IAAOE,EAAK,IAClBF,EAAK,EAAIA,GACP,EAAIC,IAAOE,EAAK,IAClBF,EAAK,EAAIA,GACXL,EAAG5R,OAAO,GACV6R,EAAG7R,OAAO,UAGL8R,GAWTtd,EAAM8d,wBAPkBr8C,EAAK5a,EAAMk3D,OAC7BpjE,EAAM,IAAMkM,EAChB4a,EAAIniB,UAAUuH,GAAQ,uBACClN,IAAdhC,KAAKgD,GAAqBhD,KAAKgD,GACpChD,KAAKgD,GAAOojE,EAAStlE,KAAKd,QAShCqoD,EAAMge,oBAJchoC,SACM,iBAAVA,EAAqBgqB,EAAMU,QAAQ1qB,EAAO,OACtDA,GAOJgqB,EAAMie,mBAHajoC,UACV,IAAIwyB,EAAGxyB,EAAO,MAAO,sBCjH1BwyB,GAAKvwD,WACL+nD,GAAQzmD,GACR0jE,GAASjd,GAAMid,OACfE,GAASnd,GAAMmd,OACf9e,GAAS2B,GAAM3B,OAEnB,SAAS6f,GAAUv/D,EAAMw/D,QAClBx/D,KAAOA;KACPqhB,EAAI,IAAIwoC,GAAG2V,EAAKn+C,EAAG,SAGnB4oC,IAAMuV,EAAK3C,MAAQhT,GAAGI,IAAIuV,EAAK3C,OAAShT,GAAGmU,KAAKhlE,KAAKqoB,QAGrDke,KAAO,IAAIsqB,GAAG,GAAG4Q,MAAMzhE,KAAKixD,UAC5BwT,IAAM,IAAI5T,GAAG,GAAG4Q,MAAMzhE,KAAKixD,UAC3BwV,IAAM,IAAI5V,GAAG,GAAG4Q,MAAMzhE,KAAKixD,UAG3B/nC,EAAIs9C,EAAKt9C,GAAK,IAAI2nC,GAAG2V,EAAKt9C,EAAG,SAC7B2hC,EAAI2b,EAAK3b,GAAK7qD,KAAK0mE,cAAcF,EAAK3b,EAAG2b,EAAKG,WAG9CC,QAAU,IAAIl6D,MAAM,QACpBm6D,QAAU,IAAIn6D,MAAM,QACpBo6D,QAAU,IAAIp6D,MAAM,QACpBq6D,QAAU,IAAIr6D,MAAM,QAEpBs6D,WAAahnE,KAAKkpB,EAAIlpB,KAAKkpB,EAAE8qC,YAAc,MAG5CiT,EAAcjnE,KAAKkpB,GAAKlpB,KAAKqoB,EAAEi3C,IAAIt/D,KAAKkpB,IACvC+9C,GAAeA,EAAYvG,KAAK,KAAO,OACrCwG,KAAO,WAEPC,eAAgB;KAChBD,KAAOlnE,KAAKkpB,EAAEu4C,MAAMzhE,KAAKixD,UAGlC3lB,GAAiBi7B,GAqNjB,SAASa,GAAUC,EAAOrgE,QACnBqgE,MAAQA,OACRrgE,KAAOA,OACPsgE,YAAc,KAtNrBf,GAAU5+D,UAAUiT,MAAQ,iBACpB,IAAI+P,MAAM,oBAGlB47C,GAAU5+D,UAAU4/D,SAAW,iBACvB,IAAI58C,MAAM,oBAGlB47C,GAAU5+D,UAAU6/D,aAAe,SAAsBn/C,EAAGc,GAC1Du9B,GAAOr+B,EAAEi/C,iBACLG,EAAUp/C,EAAEq/C,cAEZnC,EAAMD,GAAOn8C,EAAG,EAAGnpB,KAAKgnE,YACxBW,GAAK,GAAMF,EAAQ/oD,KAAO,IAAO+oD,EAAQ/oD,KAAO,GAAM,EAAI,EAAI,GAClEipD,GAAK,MAIDtyC,EACAuyC,EAFAC,EAAO,OAGNxyC,EAAI,EAAGA,EAAIkwC,EAAIp9D,OAAQktB,GAAKoyC,EAAQ/oD,KAAM,CAC7CkpD,EAAO,MACF,IAAIzvB,EAAI9iB,EAAIoyC,EAAQ/oD,KAAO,EAAGy5B,GAAK9iB,EAAG8iB,IACzCyvB,GAAQA,GAAQ,GAAKrC,EAAIptB,GAC3B0vB,EAAKziE,KAAKwiE;QAGRrkE,EAAIvD,KAAK8nE,OAAO,KAAM,KAAM,MAC5Bn4D,EAAI3P,KAAK8nE,OAAO,KAAM,KAAM,MACvBt+D,EAAIm+D,EAAGn+D,EAAI,EAAGA,IAAK,KACrB6rB,EAAI,EAAGA,EAAIwyC,EAAK1/D,OAAQktB,KAC3BuyC,EAAOC,EAAKxyC,MACC7rB,EACXmG,EAAIA,EAAEo4D,SAASN,EAAQO,OAAO3yC,IACvBuyC,KAAUp+D,IACjBmG,EAAIA,EAAEo4D,SAASN,EAAQO,OAAO3yC,GAAGs/B,QAErCpxD,EAAIA,EAAEk2B,IAAI9pB,UAELpM,EAAE0kE,OAGX1B,GAAU5+D,UAAUugE,SAAW,SAAkB7/C,EAAGc,OAC9Csf,EAAI,EAGJ0/B,EAAY9/C,EAAE+/C,cAAc3/B,GAChCA,EAAI0/B,EAAUtD,YACVA,EAAMsD,EAAUH,OAGhBzC,EAAMD,GAAOn8C,EAAGsf,EAAGzoC,KAAKgnE,YAGxBniB,EAAM7kD,KAAK8nE,OAAO,KAAM,KAAM,MACzBt+D,EAAI+7D,EAAIp9D,OAAS,EAAGqB,GAAK,EAAGA,IAAK,KAEnC,IAAI2uC,EAAI,EAAG3uC,GAAK,GAAgB,IAAX+7D,EAAI/7D,GAAUA,IACtC2uC,OACE3uC,GAAK,GACP2uC,IACF0M,EAAMA,EAAIwjB,KAAKlwB,GAEX3uC,EAAI,EACN,UACEgqB,EAAI+xC,EAAI/7D,GACZk9C,GAAa,IAANlzB;AAIHqxB,EAHW,WAAXx8B,EAAErhB,KAEAwsB,EAAI,EACAqxB,EAAIkjB,SAASlD,EAAKrxC,EAAI,GAAM,IAE5BqxB,EAAIkjB,SAASlD,GAAMrxC,EAAI,GAAM,GAAGmhC,OAGpCnhC,EAAI,EACAqxB,EAAIprB,IAAIorC,EAAKrxC,EAAI,GAAM,IAEvBqxB,EAAIprB,IAAIorC,GAAMrxC,EAAI,GAAM,GAAGmhC,aAGrB,WAAXtsC,EAAErhB,KAAoB69C,EAAIojB,MAAQpjB,GAG3C0hB,GAAU5+D,UAAU2gE,YAAc,SAAqBC,EACrDP,EACAQ,EACAlyC,EACAmyC,OAOIj/D,EACA6rB,EACAhN,EARAqgD,EAAW1oE,KAAK4mE,QAChB/B,EAAM7kE,KAAK6mE,QACXtB,EAAMvlE,KAAK8mE,QAGXp+D,EAAM,MAILc,EAAI,EAAGA,EAAI8sB,EAAK9sB,IAAK,KAEpB2+D,GADJ9/C,EAAI2/C,EAAOx+D,IACO4+D,cAAcG,GAChCG,EAASl/D,GAAK2+D,EAAUtD,IACxBA,EAAIr7D,GAAK2+D,EAAUH,WAIhBx+D,EAAI8sB,EAAM,EAAG9sB,GAAK,EAAGA,GAAK,EAAG,KAC5BjG,EAAIiG,EAAI,EACRmG,EAAInG,KACY,IAAhBk/D,EAASnlE,IAA4B,IAAhBmlE,EAAS/4D,QAQ9Bg5D,EAAO,CACTX,EAAOzkE,aAGPykE,EAAOr4D,IAI4B,IAAjCq4D,EAAOzkE,GAAGgmD,EAAEkI,IAAIuW,EAAOr4D,GAAG45C,IAC5Bof,EAAK,GAAKX,EAAOzkE,GAAGk2B,IAAIuuC,EAAOr4D;AAC/Bg5D,EAAK,GAAKX,EAAOzkE,GAAGqlE,MAAMb,SAASC,EAAOr4D,GAAGglD,QACM,IAA1CqT,EAAOzkE,GAAGgmD,EAAEkI,IAAIuW,EAAOr4D,GAAG45C,EAAEwZ,WACrC4F,EAAK,GAAKX,EAAOzkE,GAAGqlE,MAAMb,SAASC,EAAOr4D,IAC1Cg5D,EAAK,GAAKX,EAAOzkE,GAAGk2B,IAAIuuC,EAAOr4D,GAAGglD,SAElCgU,EAAK,GAAKX,EAAOzkE,GAAGqlE,MAAMb,SAASC,EAAOr4D,IAC1Cg5D,EAAK,GAAKX,EAAOzkE,GAAGqlE,MAAMb,SAASC,EAAOr4D,GAAGglD,YAG3C/rD,EAAQ,EACT,GACA,GACA,GACA,aAQC+8D,EAAMH,GAAOgD,EAAOjlE,GAAIilE,EAAO74D,QACnCjH,EAAM/I,KAAK+I,IAAIi9D,EAAI,GAAGx9D,OAAQO,GAC9B68D,EAAIhiE,GAAK,IAAImJ,MAAMhE,GACnB68D,EAAI51D,GAAK,IAAIjD,MAAMhE,GACd2sB,EAAI,EAAGA,EAAI3sB,EAAK2sB,IAAK,KACpBwzC,EAAiB,EAAZlD,EAAI,GAAGtwC,GACZyzC,EAAiB,EAAZnD,EAAI,GAAGtwC,GAEhBkwC,EAAIhiE,GAAG8xB,GAAKzsB,EAAiB,GAAVigE,EAAK,IAAUC,EAAK,IACvCvD,EAAI51D,GAAG0lB,GAAK,EACZwvC,EAAIthE,GAAKolE,QAhDTpD,EAAIhiE,GAAK+hE,GAAOkD,EAAOjlE,GAAImlE,EAASnlE,GAAIvD,KAAKgnE,YAC7CzB,EAAI51D,GAAK21D,GAAOkD,EAAO74D,GAAI+4D,EAAS/4D,GAAI3P,KAAKgnE,YAC7Ct+D,EAAM/I,KAAK+I,IAAI68D,EAAIhiE,GAAG4E,OAAQO;AAC9BA,EAAM/I,KAAK+I,IAAI68D,EAAI51D,GAAGxH,OAAQO,OAiD9Bm8C,EAAM7kD,KAAK8nE,OAAO,KAAM,KAAM,MAC9BvE,EAAMvjE,KAAK+mE,YACVv9D,EAAId,EAAKc,GAAK,EAAGA,IAAK,SACrB2f,EAAI,EAED3f,GAAK,GAAG,KACT+8B,GAAO,MACNlR,EAAI,EAAGA,EAAIiB,EAAKjB,IACnBkuC,EAAIluC,GAAiB,EAAZkwC,EAAIlwC,GAAG7rB,GACD,IAAX+5D,EAAIluC,KACNkR,GAAO,OAENA,EACH,MACFpd,IACA3f,OAEEA,GAAK,GACP2f,IACF07B,EAAMA,EAAIwjB,KAAKl/C,GACX3f,EAAI,EACN,UAEG6rB,EAAI,EAAGA,EAAIiB,EAAKjB,IAAK,KACpB7B,EAAI+vC,EAAIluC,GAEF,IAAN7B,IAEKA,EAAI,EACXnL,EAAIw8C,EAAIxvC,GAAI7B,EAAI,GAAM,GACfA,EAAI,IACXnL,EAAIw8C,EAAIxvC,IAAK7B,EAAI,GAAM,GAAGmhC,OAG1B9P,EADa,WAAXx8B,EAAErhB,KACE69C,EAAIkjB,SAAS1/C,GAEbw8B,EAAIprB,IAAIpR,SAIf7e,EAAI,EAAGA,EAAI8sB,EAAK9sB,IACnBq7D,EAAIr7D,GAAK,YAEPi/D,EACK5jB,EAEAA,EAAIojB,OAQf1B,GAAUa,UAAYA,GAEtBA,GAAUz/D,UAAU45D,GAAK,iBACjB,IAAI52C,MAAM;AAGlBy8C,GAAUz/D,UAAU4/D,SAAW,kBACtBvnE,KAAKqnE,MAAME,SAASvnE,OAG7BumE,GAAU5+D,UAAUohE,YAAc,SAAqB1qC,EAAOipB,GAC5DjpB,EAAQgqB,GAAMU,QAAQ1qB,EAAOipB,OAEzBhxB,EAAMt2B,KAAKqoB,EAAEiY,iBAGC,IAAbjC,EAAM,IAA4B,IAAbA,EAAM,IAA4B,IAAbA,EAAM,KACjDA,EAAMl2B,OAAS,GAAM,EAAImuB,SACV,IAAb+H,EAAM,GACRqoB,GAAOroB,EAAMA,EAAMl2B,OAAS,GAAK,GAAM,GACnB,IAAbk2B,EAAM,IACbqoB,GAAOroB,EAAMA,EAAMl2B,OAAS,GAAK,GAAM,GAE9BnI,KAAK4a,MAAMyjB,EAAM38B,MAAM,EAAG,EAAI40B,GACvC+H,EAAM38B,MAAM,EAAI40B,EAAK,EAAI,EAAIA,IAG1B,IAAkB,IAAb+H,EAAM,IAA4B,IAAbA,EAAM,KAC3BA,EAAMl2B,OAAS,IAAMmuB,SACxBt2B,KAAKgpE,WAAW3qC,EAAM38B,MAAM,EAAG,EAAI40B,GAAmB,IAAb+H,EAAM,UAElD,IAAI1T,MAAM,yBAGlBy8C,GAAUz/D,UAAUshE,iBAAmB,SAA0B3hB;OACxDtnD,KAAKmlE,OAAO7d,GAAK,IAG1B8f,GAAUz/D,UAAUuhE,QAAU,SAAiBC,OACzC7yC,EAAMt2B,KAAKqnE,MAAMh/C,EAAEiY,aACnBtc,EAAIhkB,KAAKopE,OAAOrgB,QAAQ,KAAMzyB,UAE9B6yC,EACK,CAAEnpE,KAAKqpE,OAAOrJ,SAAW,EAAO,GAAOp2D,OAAOoa,GAEhD,CAAE,GAAOpa,OAAOoa,EAAGhkB,KAAKqpE,OAAOtgB,QAAQ,KAAMzyB,KAGtD8wC,GAAUz/D,UAAUw9D,OAAS,SAAgB7d,EAAK6hB,UACzC9gB,GAAM8c,OAAOnlE,KAAKkpE,QAAQC,GAAU7hB,IAG7C8f,GAAUz/D,UAAU2hE,WAAa,SAAoBC,MAC/CvpE,KAAKsnE,YACP,OAAOtnE,SAELsnE,EAAc,CAChBG,QAAS,KACTlC,IAAK,KACLiE,KAAM,aAERlC,EAAY/B,IAAMvlE,KAAKooE,cAAc,GACrCd,EAAYG,QAAUznE,KAAK0nE,YAAY,EAAG6B,GAC1CjC,EAAYkC,KAAOxpE,KAAKypE,gBACnBnC,YAAcA;AAEZtnE,MAGTonE,GAAUz/D,UAAU+hE,YAAc,SAAqBvgD,OAChDnpB,KAAKsnE,YACR,OAAO,MAELG,EAAUznE,KAAKsnE,YAAYG,gBAC1BA,GAGEA,EAAQO,OAAO7/D,QAAUxI,KAAKyI,MAAM+gB,EAAE6qC,YAAc,GAAKyT,EAAQ/oD,OAG1E0oD,GAAUz/D,UAAU+/D,YAAc,SAAqBhpD,EAAM6qD,MACvDvpE,KAAKsnE,aAAetnE,KAAKsnE,YAAYG,QACvC,OAAOznE,KAAKsnE,YAAYG,gBAEtBA,EAAU,CAAEznE,MACZ6kD,EAAM7kD,KACDwJ,EAAI,EAAGA,EAAI+/D,EAAO//D,GAAKkV,EAAM,KAC/B,IAAI2W,EAAI,EAAGA,EAAI3W,EAAM2W,IACxBwvB,EAAMA,EAAI8kB,MACZlC,EAAQriE,KAAKy/C,SAER,CACLnmC,KAAMA,EACNspD,OAAQP,IAIZL,GAAUz/D,UAAUygE,cAAgB,SAAuBvD,MACrD7kE,KAAKsnE,aAAetnE,KAAKsnE,YAAY/B,IACvC,OAAOvlE,KAAKsnE,YAAY/B;SAEtBryC,EAAM,CAAElzB,MACR0I,GAAO,GAAKm8D,GAAO,EACnB8E,EAAc,IAARjhE,EAAY,KAAO1I,KAAK2pE,MACzBngE,EAAI,EAAGA,EAAId,EAAKc,IACvB0pB,EAAI1pB,GAAK0pB,EAAI1pB,EAAI,GAAGiwB,IAAIkwC,SACnB,CACL9E,IAAKA,EACLmD,OAAQ90C,IAIZk0C,GAAUz/D,UAAU8hE,SAAW,kBACtB,MAGTrC,GAAUz/D,UAAU0gE,KAAO,SAAcl/C,WACnClC,EAAIjnB,KACCwJ,EAAI,EAAGA,EAAI2f,EAAG3f,IACrByd,EAAIA,EAAE0iD,aACD1iD,GCzXT,IAAIohC,GAAQ/nD,GACRuwD,GAAKjvD,WACLolD,GAAW3jD,WACXumE,GAAOlmE,GAEPgjD,GAAS2B,GAAM3B,OAEnB,SAASmjB,GAAWrD,GAClBoD,GAAK9oE,KAAKd,KAAM,QAASwmE,QAEpBjjE,EAAI,IAAIstD,GAAG2V,EAAKjjE,EAAG,IAAIk+D,MAAMzhE,KAAKixD,UAClCthD,EAAI,IAAIkhD,GAAG2V,EAAK72D,EAAG,IAAI8xD,MAAMzhE,KAAKixD,UAClC6Y,KAAO9pE,KAAKymE,IAAI3D,eAEhBiH,MAAqC,IAA7B/pE,KAAKuD,EAAEs+D,UAAUnB,KAAK;KAC9BsJ,OAAmD,IAA1ChqE,KAAKuD,EAAEs+D,UAAU3e,IAAIljD,KAAKqoB,GAAGq4C,MAAM,QAG5CuJ,KAAOjqE,KAAKkqE,iBAAiB1D,QAC7B2D,YAAc,IAAIz9D,MAAM,QACxB09D,YAAc,IAAI19D,MAAM,MAEtBm9D,GAAYD,QACrBS,GAAiBR,GAiOjB,SAASS,GAAMjD,EAAOrjD,EAAGulC,EAAGghB,GAC1BX,GAAKxC,UAAUtmE,KAAKd,KAAMqnE,EAAO,UACvB,OAANrjD,GAAoB,OAANulC,QACXvlC,EAAI,UACJulC,EAAI,UACJihB,KAAM,SAENxmD,EAAI,IAAI6sC,GAAG7sC,EAAG,SACdulC,EAAI,IAAIsH,GAAGtH,EAAG,IAEfghB,SACGvmD,EAAE+9C,SAAS/hE,KAAKqnE,MAAMpW,UACtB1H,EAAEwY,SAAS/hE,KAAKqnE,MAAMpW,MAExBjxD,KAAKgkB,EAAEitC,MACVjxD,KAAKgkB,EAAIhkB,KAAKgkB,EAAEy9C,MAAMzhE,KAAKqnE,MAAMpW,MAC9BjxD,KAAKupD,EAAE0H,MACVjxD,KAAKupD,EAAIvpD,KAAKupD,EAAEkY,MAAMzhE,KAAKqnE,MAAMpW;KAC9BuZ,KAAM,GA6Nf,SAASC,GAAOpD,EAAOrjD,EAAGulC,EAAG/1B,GAC3Bo2C,GAAKxC,UAAUtmE,KAAKd,KAAMqnE,EAAO,YACvB,OAANrjD,GAAoB,OAANulC,GAAoB,OAAN/1B,QACzBxP,EAAIhkB,KAAKqnE,MAAM5C,SACflb,EAAIvpD,KAAKqnE,MAAM5C,SACfjxC,EAAI,IAAIq9B,GAAG,UAEX7sC,EAAI,IAAI6sC,GAAG7sC,EAAG,SACdulC,EAAI,IAAIsH,GAAGtH,EAAG,SACd/1B,EAAI,IAAIq9B,GAAGr9B,EAAG,KAEhBxzB,KAAKgkB,EAAEitC,MACVjxD,KAAKgkB,EAAIhkB,KAAKgkB,EAAEy9C,MAAMzhE,KAAKqnE,MAAMpW,MAC9BjxD,KAAKupD,EAAE0H,MACVjxD,KAAKupD,EAAIvpD,KAAKupD,EAAEkY,MAAMzhE,KAAKqnE,MAAMpW,MAC9BjxD,KAAKwzB,EAAEy9B,MACVjxD,KAAKwzB,EAAIxzB,KAAKwzB,EAAEiuC,MAAMzhE,KAAKqnE,MAAMpW,WAE9ByZ,KAAO1qE,KAAKwzB,IAAMxzB,KAAKqnE,MAAM5C,IAhepCoF,GAAWliE,UAAUuiE,iBAAmB,SAA0B1D;GAE3DxmE,KAAK+pE,OAAU/pE,KAAK6qD,GAAM7qD,KAAKkpB,GAAwB,IAAnBlpB,KAAKqoB,EAAEgrC,KAAK,QAIjDmW,EACAmB,KACAnE,EAAKgD,KACPA,EAAO,IAAI3Y,GAAG2V,EAAKgD,KAAM,IAAI/H,MAAMzhE,KAAKixD,SACnC,KACD2Z,EAAQ5qE,KAAK6qE,cAAc7qE,KAAKqoB,GAGpCmhD,GADAA,EAAOoB,EAAM,GAAGnZ,IAAImZ,EAAM,IAAM,EAAIA,EAAM,GAAKA,EAAM,IACzCnJ,MAAMzhE,KAAKixD,QAErBuV,EAAKmE,OACPA,EAAS,IAAI9Z,GAAG2V,EAAKmE,OAAQ,QACxB,KAEDG,EAAU9qE,KAAK6qE,cAAc7qE,KAAKkpB,GACsB,IAAxDlpB,KAAK6qD,EAAE2G,IAAIsZ,EAAQ,IAAI9mD,EAAEytC,IAAIzxD,KAAK6qD,EAAE7mC,EAAEs+C,OAAOkH,IAC/CmB,EAASG,EAAQ,IAEjBH,EAASG,EAAQ,GACjBpkB,GAA2D,IAApD1mD,KAAK6qD,EAAE2G,IAAImZ,GAAQ3mD,EAAEytC,IAAIzxD,KAAK6qD,EAAE7mC,EAAEs+C,OAAOkH,YAiB7C,CACLA,KAAMA,EACNmB,OAAQA,EACRI,MAdEvE,EAAKuE,MACCvE,EAAKuE,MAAM/5D,KAAI,SAASg6D,SACvB,CACLznE,EAAG,IAAIstD,GAAGma,EAAIznE,EAAG,IACjBoM,EAAG,IAAIkhD,GAAGma,EAAIr7D,EAAG;IAIb3P,KAAKirE,cAAcN,MAU/Bd,GAAWliE,UAAUkjE,cAAgB,SAAuBziB,OAItD6I,EAAM7I,IAAQpoD,KAAKqoB,EAAIroB,KAAKixD,IAAMJ,GAAGmU,KAAK5c,GAC1C0hB,EAAO,IAAIjZ,GAAG,GAAG4Q,MAAMxQ,GAAK6R,UAC5BoI,EAAQpB,EAAK/G,SAEbrzC,EAAI,IAAImhC,GAAG,GAAG4Q,MAAMxQ,GAAK8R,SAASH,UAAUN,OAAOwH,SAIhD,CAFEoB,EAAMlJ,OAAOtyC,GAAGmyC,UAChBqJ,EAAMhJ,OAAOxyC,GAAGmyC,YAI3BgI,GAAWliE,UAAUsjE,cAAgB,SAAuBN,WActDzU,EACA8B,EAEA3B,EACA8B,EAEA3B,EACA8B,EAEA6S,EAEAlkD,EACAjD,EAxBAonD,EAAWprE,KAAKkpB,EAAEw1C,MAAM/+D,KAAK0I,MAAMrI,KAAKkpB,EAAE8qC,YAAc,IAIxDiR,EAAI0F,EACJrgC,EAAItqC,KAAKkpB,EAAEopC,QACXkO,EAAK,IAAI3P,GAAG,GACZwa,EAAK,IAAIxa,GAAG,GACZ1L,EAAK,IAAI0L,GAAG,GACZya,EAAK,IAAIza,GAAG,GAaZrnD,EAAI,EAGa,IAAdy7D,EAAEvE,KAAK,IAAU,KAClBrtC,EAAIiX,EAAEg1B,IAAI2F,GACdh+C,EAAIqjB,EAAE4Y,IAAI7vB,EAAEm+B,IAAIyT;AAChBjhD,EAAImhC,EAAGjC,IAAI7vB,EAAEm+B,IAAIgP,QACbjX,EAAI+hB,EAAGpoB,IAAI7vB,EAAEm+B,IAAI6Z,QAEhBhV,GAAMpvC,EAAEwqC,IAAI2Z,GAAY,EAC3BlV,EAAKiV,EAAMxW,MACXqD,EAAKwI,EACLnK,EAAKpvC,EAAE0tC,MACPwD,EAAKn0C,OACA,GAAIqyC,GAAc,KAAN7sD,QAGnB2hE,EAAQlkD,EAERqjB,EAAI26B,EACJA,EAAIh+C,EACJk+B,EAAKqb,EACLA,EAAKx8C,EACLsnD,EAAKD,EACLA,EAAK9hB,EAEPiN,EAAKvvC,EAAE0tC,MACP2D,EAAKt0C,MAEDunD,EAAOlV,EAAGwH,MAAMpkC,IAAI0+B,EAAG0F,cAChBrH,EAAGqH,MAAMpkC,IAAI6+B,EAAGuF,OAClBpM,IAAI8Z,IAAS,IACpB/U,EAAKN,EACLoC,EAAKN,GAIH3B,EAAGtF,WACLsF,EAAKA,EAAG1B,MACRwD,EAAKA,EAAGxD,OAEN6B,EAAGzF,WACLyF,EAAKA,EAAG7B,MACR2D,EAAKA,EAAG3D,OAGH,CACL,CAAEpxD,EAAG8yD,EAAI1mD,EAAGwoD,GACZ,CAAE50D,EAAGizD,EAAI7mD,EAAG2oD,KAIhBuR,GAAWliE,UAAU6jE,WAAa,SAAoBriD;IAChD4hD,EAAQ/qE,KAAKiqE,KAAKc,MAClBU,EAAKV,EAAM,GACXW,EAAKX,EAAM,GAEXY,EAAKD,EAAG/7D,EAAE6hD,IAAIroC,GAAGw2C,SAAS3/D,KAAKkpB,GAC/BwvB,EAAK+yB,EAAG97D,EAAEglD,MAAMnD,IAAIroC,GAAGw2C,SAAS3/D,KAAKkpB,GAErC0K,EAAK+3C,EAAGna,IAAIia,EAAGloE,GACfqoE,EAAKlzB,EAAG8Y,IAAIka,EAAGnoE,GACfsoE,EAAKF,EAAGna,IAAIia,EAAG97D,GACfm8D,EAAKpzB,EAAG8Y,IAAIka,EAAG/7D,SAKZ,CAAE81D,GAFAt8C,EAAE+5B,IAAItvB,GAAIsvB,IAAI0oB,GAENlG,GADRmG,EAAGpyC,IAAIqyC,GAAInX,QAItBkV,GAAWliE,UAAUqhE,WAAa,SAAoBhlD,EAAG64C,IACvD74C,EAAI,IAAI6sC,GAAG7sC,EAAG,KACPitC,MACLjtC,EAAIA,EAAEy9C,MAAMzhE,KAAKixD,UAEfqa,EAAKtnD,EAAEy+C,SAASH,OAAOt+C,GAAGi+C,QAAQj+C,EAAEs+C,OAAOtiE,KAAKuD,IAAI0+D,QAAQjiE,KAAK2P,GACjE45C,EAAI+hB,EAAG1I,aACkC,IAAzCrZ,EAAEkZ,SAASP,OAAOoJ,GAAI7Z,IAAIzxD,KAAKumC,MACjC,MAAM,IAAI5b,MAAM,qBAIdy1C,EAAQ7W,EAAEsY,UAAUzB;QACpBvD,IAAQuD,IAAUvD,GAAOuD,KAC3B7W,EAAIA,EAAEwZ,UAED/iE,KAAK4a,MAAMoJ,EAAGulC,IAGvBsgB,GAAWliE,UAAU4/D,SAAW,SAAkB3sD,MAC5CA,EAAM4vD,IACR,OAAO,MAELxmD,EAAIpJ,EAAMoJ,EACVulC,EAAI3uC,EAAM2uC,EAEVwiB,EAAK/rE,KAAKuD,EAAE++D,OAAOt+C,GACnBgoD,EAAMhoD,EAAEy+C,SAASH,OAAOt+C,GAAGi+C,QAAQ8J,GAAI9J,QAAQjiE,KAAK2P,UACb,IAApC45C,EAAEkZ,SAASN,QAAQ6J,GAAKtL,KAAK,IAGtCmJ,GAAWliE,UAAUskE,gBACjB,SAAyBjE,EAAQQ,EAAQC,WACnCyD,EAAUlsE,KAAKmqE,YACfgC,EAAUnsE,KAAKoqE,YACV5gE,EAAI,EAAGA,EAAIw+D,EAAO7/D,OAAQqB,IAAK,KAClC3H,EAAQ7B,KAAKwrE,WAAWhD,EAAOh/D,IAC/B6e,EAAI2/C,EAAOx+D,GACXggE,EAAOnhD,EAAEohD,WAET5nE,EAAM4jE,GAAG1U,WACXlvD,EAAM4jE,GAAGhR,OACTpsC,EAAIA,EAAEssC,KAAI,IAER9yD,EAAM6jE,GAAG3U,WACXlvD,EAAM6jE,GAAGjR,OACT+U,EAAOA,EAAK7U,KAAI,IAGlBuX,EAAY,EAAJ1iE,GAAS6e,EACjB6jD,EAAY,EAAJ1iE,EAAQ,GAAKggE;AACrB2C,EAAY,EAAJ3iE,GAAS3H,EAAM4jE,GACvB0G,EAAY,EAAJ3iE,EAAQ,GAAK3H,EAAM6jE,WAEzBxyC,EAAMlzB,KAAKsoE,YAAY,EAAG4D,EAASC,EAAa,EAAJ3iE,EAAOi/D,GAG9CpzC,EAAI,EAAGA,EAAQ,EAAJ7rB,EAAO6rB,IACzB62C,EAAQ72C,GAAK,KACb82C,EAAQ92C,GAAK,YAERnC,MAwBJo3C,GAAOV,GAAKxC,WAErByC,GAAWliE,UAAUiT,MAAQ,SAAeoJ,EAAGulC,EAAGghB,UACzC,IAAID,GAAMtqE,KAAMgkB,EAAGulC,EAAGghB,IAG/BV,GAAWliE,UAAU++D,cAAgB,SAAuB58C,EAAKmnC,UACxDqZ,GAAM8B,SAASpsE,KAAM8pB,EAAKmnC,OAG7BtpD,UAAU8hE,SAAW,cACpBzpE,KAAKqnE,MAAM4C,UAGZoC,EAAMrsE,KAAKsnE,eACX+E,GAAOA,EAAI7C,KACb,OAAO6C,EAAI7C,SAETA,EAAOxpE,KAAKqnE,MAAMzsD,MAAM5a,KAAKgkB,EAAEs+C,OAAOtiE,KAAKqnE,MAAM4C,KAAKT,MAAOxpE,KAAKupD,MAClE8iB,EAAK,KACHhF,EAAQrnE,KAAKqnE,MACbiF,EAAU,SAASjkD;OACdg/C,EAAMzsD,MAAMyN,EAAErE,EAAEs+C,OAAO+E,EAAM4C,KAAKT,MAAOnhD,EAAEkhC,IAEpD8iB,EAAI7C,KAAOA,EACXA,EAAKlC,YAAc,CACjBkC,KAAM,KACNjE,IAAK8G,EAAI9G,KAAO,CACdV,IAAKwH,EAAI9G,IAAIV,IACbmD,OAAQqE,EAAI9G,IAAIyC,OAAOh3D,IAAIs7D,IAE7B7E,QAAS4E,EAAI5E,SAAW,CACtB/oD,KAAM2tD,EAAI5E,QAAQ/oD,KAClBspD,OAAQqE,EAAI5E,QAAQO,OAAOh3D,IAAIs7D,YAI9B9C,OAGH7hE,UAAU+9C,OAAS,kBAClB1lD,KAAKsnE,YAGH,CAAEtnE,KAAKgkB,EAAGhkB,KAAKupD,EAAGvpD,KAAKsnE,aAAe,CAC3CG,QAASznE,KAAKsnE,YAAYG,SAAW,CACnC/oD,KAAM1e,KAAKsnE,YAAYG,QAAQ/oD,KAC/BspD,OAAQhoE,KAAKsnE,YAAYG,QAAQO,OAAOtmE,MAAM,IAEhD6jE,IAAKvlE,KAAKsnE,YAAY/B,KAAO,CAC3BV,IAAK7kE,KAAKsnE,YAAY/B,IAAIV;AAC1BmD,OAAQhoE,KAAKsnE,YAAY/B,IAAIyC,OAAOtmE,MAAM,MATrC,CAAE1B,KAAKgkB,EAAGhkB,KAAKupD,OAcpB6iB,SAAW,SAAkB/E,EAAOv9C,EAAKmnC,GAC1B,iBAARnnC,IACTA,EAAM1M,KAAKmvD,MAAMziD,QACfoJ,EAAMm0C,EAAMzsD,MAAMkP,EAAI,GAAIA,EAAI,GAAImnC,OACjCnnC,EAAI,GACP,OAAOoJ,WAEAs5C,EAAU1iD,UACVu9C,EAAMzsD,MAAMkP,EAAI,GAAIA,EAAI,GAAImnC,OAGjCob,EAAMviD,EAAI,UACdoJ,EAAIo0C,YAAc,CAChBkC,KAAM,KACN/B,QAAS4E,EAAI5E,SAAW,CACtB/oD,KAAM2tD,EAAI5E,QAAQ/oD,KAClBspD,OAAQ,CAAE90C,GAAMtpB,OAAOyiE,EAAI5E,QAAQO,OAAOh3D,IAAIw7D,KAEhDjH,IAAK8G,EAAI9G,KAAO,CACdV,IAAKwH,EAAI9G,IAAIV,IACbmD,OAAQ,CAAE90C,GAAMtpB,OAAOyiE,EAAI9G,IAAIyC,OAAOh3D,IAAIw7D,MAGvCt5C,MAGHvrB,UAAU8qD,QAAU;OACpBzyD,KAAKysE,aACA,sBACF,gBAAkBzsE,KAAKgkB,EAAE69C,UAAUrgE,SAAS,GAAI,GACnD,OAASxB,KAAKupD,EAAEsY,UAAUrgE,SAAS,GAAI,GAAK,QAG5CmG,UAAU8kE,WAAa,kBACpBzsE,KAAKwqE,QAGR7iE,UAAU8xB,IAAM,SAAapR,MAE7BroB,KAAKwqE,IACP,OAAOniD,KAGLA,EAAEmiD,IACJ,OAAOxqE,QAGLA,KAAKuhE,GAAGl5C,GACV,OAAOroB,KAAK2pE,SAGV3pE,KAAK20D,MAAM4M,GAAGl5C,GAChB,OAAOroB,KAAKqnE,MAAMzsD,MAAM,KAAM,SAGR,IAApB5a,KAAKgkB,EAAEytC,IAAIppC,EAAErE,GACf,OAAOhkB,KAAKqnE,MAAMzsD,MAAM,KAAM,UAE5BhL,EAAI5P,KAAKupD,EAAE2Y,OAAO75C,EAAEkhC,GACN,IAAd35C,EAAE8wD,KAAK,KACT9wD,EAAIA,EAAE0yD,OAAOtiE,KAAKgkB,EAAEk+C,OAAO75C,EAAErE,GAAG8+C;KAC9B4J,EAAK98D,EAAE6yD,SAASN,QAAQniE,KAAKgkB,GAAGm+C,QAAQ95C,EAAErE,GAC1C2oD,EAAK/8D,EAAE0yD,OAAOtiE,KAAKgkB,EAAEk+C,OAAOwK,IAAKvK,QAAQniE,KAAKupD,UAC3CvpD,KAAKqnE,MAAMzsD,MAAM8xD,EAAIC,OAGxBhlE,UAAUgiE,IAAM,cAChB3pE,KAAKwqE,IACP,OAAOxqE,SAGL4sE,EAAM5sE,KAAKupD,EAAEyY,OAAOhiE,KAAKupD,MACT,IAAhBqjB,EAAIlM,KAAK,GACX,OAAO1gE,KAAKqnE,MAAMzsD,MAAM,KAAM,UAE5BrX,EAAIvD,KAAKqnE,MAAM9jE,EAEf4hD,EAAKnlD,KAAKgkB,EAAEy+C,SACZoK,EAAQD,EAAI9J,UACZlzD,EAAIu1C,EAAG6c,OAAO7c,GAAI8c,QAAQ9c,GAAI8c,QAAQ1+D,GAAG++D,OAAOuK,GAEhDH,EAAK98D,EAAE6yD,SAASN,QAAQniE,KAAKgkB,EAAEg+C,OAAOhiE,KAAKgkB,IAC3C2oD,EAAK/8D,EAAE0yD,OAAOtiE,KAAKgkB,EAAEk+C,OAAOwK,IAAKvK,QAAQniE,KAAKupD,UAC3CvpD,KAAKqnE,MAAMzsD,MAAM8xD,EAAIC,OAGxBhlE,UAAUyhE,KAAO;OACdppE,KAAKgkB,EAAE69C,cAGVl6D,UAAU0hE,KAAO,kBACdrpE,KAAKupD,EAAEsY,cAGVl6D,UAAU6pD,IAAM,SAAaroC,UACjCA,EAAI,IAAI0nC,GAAG1nC,EAAG,IACVnpB,KAAKysE,aACAzsE,KACAA,KAAK0pE,YAAYvgD,GACjBnpB,KAAKqnE,MAAMG,aAAaxnE,KAAMmpB,GAC9BnpB,KAAKqnE,MAAM4C,KACXjqE,KAAKqnE,MAAM4E,gBAAgB,CAAEjsE,MAAQ,CAAEmpB,IAEvCnpB,KAAKqnE,MAAMa,SAASloE,KAAMmpB,OAG/BxhB,UAAUmlE,OAAS,SAAgBrH,EAAImG,EAAIlG,OAC3CsC,EAAS,CAAEhoE,KAAM4rE,GACjBpD,EAAS,CAAE/C,EAAIC,UACf1lE,KAAKqnE,MAAM4C,KACNjqE,KAAKqnE,MAAM4E,gBAAgBjE,EAAQQ,GAEnCxoE,KAAKqnE,MAAMiB,YAAY,EAAGN,EAAQQ,EAAQ,OAG/C7gE,UAAUolE,QAAU,SAAiBtH,EAAImG,EAAIlG,OAC7CsC,EAAS,CAAEhoE,KAAM4rE,GACjBpD,EAAS,CAAE/C,EAAIC;QACf1lE,KAAKqnE,MAAM4C,KACNjqE,KAAKqnE,MAAM4E,gBAAgBjE,EAAQQ,GAAQ,GAE3CxoE,KAAKqnE,MAAMiB,YAAY,EAAGN,EAAQQ,EAAQ,GAAG,OAGlD7gE,UAAU45D,GAAK,SAAYl5C,UACxBroB,OAASqoB,GACTroB,KAAKwqE,MAAQniD,EAAEmiD,MACVxqE,KAAKwqE,KAA2B,IAApBxqE,KAAKgkB,EAAEytC,IAAIppC,EAAErE,IAAgC,IAApBhkB,KAAKupD,EAAEkI,IAAIppC,EAAEkhC,QAG1D5hD,UAAUgtD,IAAM,SAAaqY,MAC7BhtE,KAAKwqE,IACP,OAAOxqE,SAELkzB,EAAMlzB,KAAKqnE,MAAMzsD,MAAM5a,KAAKgkB,EAAGhkB,KAAKupD,EAAEwZ,aACtCiK,GAAehtE,KAAKsnE,YAAa,KAC/B+E,EAAMrsE,KAAKsnE,YACX2F,EAAS,SAAS5kD,UACbA,EAAEssC,OAEXzhC,EAAIo0C,YAAc,CAChB/B,IAAK8G,EAAI9G,KAAO,CACdV,IAAKwH,EAAI9G,IAAIV,IACbmD,OAAQqE,EAAI9G,IAAIyC,OAAOh3D,IAAIi8D,IAE7BxF,QAAS4E,EAAI5E,SAAW,CACtB/oD,KAAM2tD,EAAI5E,QAAQ/oD;AAClBspD,OAAQqE,EAAI5E,QAAQO,OAAOh3D,IAAIi8D,YAI9B/5C,MAGHvrB,UAAUihE,IAAM,kBAChB5oE,KAAKwqE,IACAxqE,KAAKqnE,MAAMS,OAAO,KAAM,KAAM,MAE7B9nE,KAAKqnE,MAAMS,OAAO9nE,KAAKgkB,EAAGhkB,KAAKupD,EAAGvpD,KAAKqnE,MAAM5C,SAwBhDgG,GAAQb,GAAKxC,WAEtByC,GAAWliE,UAAUmgE,OAAS,SAAgB9jD,EAAGulC,EAAG/1B,UAC3C,IAAIi3C,GAAOzqE,KAAMgkB,EAAGulC,EAAG/1B,IAGhCi3C,GAAO9iE,UAAUsgE,IAAM,cACjBjoE,KAAKysE,aACP,OAAOzsE,KAAKqnE,MAAMzsD,MAAM,KAAM,UAE5BsyD,EAAOltE,KAAKwzB,EAAEsvC,UACdqK,EAAQD,EAAKzK,SACbsJ,EAAK/rE,KAAKgkB,EAAEs+C,OAAO6K,GACnBC,EAAKptE,KAAKupD,EAAE+Y,OAAO6K,GAAO7K,OAAO4K,UAE9BltE,KAAKqnE,MAAMzsD,MAAMmxD,EAAIqB,IAG9B3C,GAAO9iE,UAAUgtD,IAAM;OACd30D,KAAKqnE,MAAMS,OAAO9nE,KAAKgkB,EAAGhkB,KAAKupD,EAAEwZ,SAAU/iE,KAAKwzB,IAGzDi3C,GAAO9iE,UAAU8xB,IAAM,SAAapR,MAE9BroB,KAAKysE,aACP,OAAOpkD,KAGLA,EAAEokD,aACJ,OAAOzsE,SAGLqtE,EAAMhlD,EAAEmL,EAAEivC,SACV6K,EAAKttE,KAAKwzB,EAAEivC,SACZsD,EAAK/lE,KAAKgkB,EAAEs+C,OAAO+K,GACnBrH,EAAK39C,EAAErE,EAAEs+C,OAAOgL,GAChB9+B,EAAKxuC,KAAKupD,EAAE+Y,OAAO+K,EAAI/K,OAAOj6C,EAAEmL,IAChCib,EAAKpmB,EAAEkhC,EAAE+Y,OAAOgL,EAAGhL,OAAOtiE,KAAKwzB,IAE/B4X,EAAI26B,EAAG7D,OAAO8D,GACd/+C,EAAIunB,EAAG0zB,OAAOzzB,MACA,IAAdrD,EAAEs1B,KAAK,UACS,IAAdz5C,EAAEy5C,KAAK,GACF1gE,KAAKqnE,MAAMS,OAAO,KAAM,KAAM,MAE9B9nE,KAAK2pE;KAGZ4D,EAAKniC,EAAEq3B,SACP+K,EAAKD,EAAGjL,OAAOl3B,GACfd,EAAIy7B,EAAGzD,OAAOiL,GAEdb,EAAKzlD,EAAEw7C,SAASR,QAAQuL,GAAIrL,QAAQ73B,GAAG63B,QAAQ73B,GAC/CqiC,EAAK1lD,EAAEq7C,OAAOh4B,EAAE63B,QAAQuK,IAAKvK,QAAQ3zB,EAAG8zB,OAAOkL,IAC/CC,EAAKztE,KAAKwzB,EAAE8uC,OAAOj6C,EAAEmL,GAAG8uC,OAAOl3B,UAE5BprC,KAAKqnE,MAAMS,OAAO4E,EAAIC,EAAIc,IAGnChD,GAAO9iE,UAAUogE,SAAW,SAAkB1/C,MAExCroB,KAAKysE,aACP,OAAOpkD,EAAEugD,SAGPvgD,EAAEokD,aACJ,OAAOzsE,SAGLstE,EAAKttE,KAAKwzB,EAAEivC,SACZsD,EAAK/lE,KAAKgkB,EACVgiD,EAAK39C,EAAErE,EAAEs+C,OAAOgL,GAChB9+B,EAAKxuC,KAAKupD,EACV9a,EAAKpmB,EAAEkhC,EAAE+Y,OAAOgL,GAAIhL,OAAOtiE,KAAKwzB,GAEhC4X,EAAI26B,EAAG7D,OAAO8D,GACd/+C,EAAIunB,EAAG0zB,OAAOzzB,MACA,IAAdrD,EAAEs1B,KAAK,UACS,IAAdz5C,EAAEy5C,KAAK,GACF1gE,KAAKqnE,MAAMS,OAAO,KAAM,KAAM,MAE9B9nE,KAAK2pE;KAGZ4D,EAAKniC,EAAEq3B,SACP+K,EAAKD,EAAGjL,OAAOl3B,GACfd,EAAIy7B,EAAGzD,OAAOiL,GAEdb,EAAKzlD,EAAEw7C,SAASR,QAAQuL,GAAIrL,QAAQ73B,GAAG63B,QAAQ73B,GAC/CqiC,EAAK1lD,EAAEq7C,OAAOh4B,EAAE63B,QAAQuK,IAAKvK,QAAQ3zB,EAAG8zB,OAAOkL,IAC/CC,EAAKztE,KAAKwzB,EAAE8uC,OAAOl3B,UAEhBprC,KAAKqnE,MAAMS,OAAO4E,EAAIC,EAAIc,IAGnChD,GAAO9iE,UAAU0gE,KAAO,SAAcxqC,MACxB,IAARA,EACF,OAAO79B,QACLA,KAAKysE,aACP,OAAOzsE,SACJ69B,EACH,OAAO79B,KAAK2pE,UAEVngE,KACAxJ,KAAKqnE,MAAM0C,OAAS/pE,KAAKqnE,MAAM2C,OAAQ,KACrC/iD,EAAIjnB,SACHwJ,EAAI,EAAGA,EAAIq0B,EAAKr0B,IACnByd,EAAIA,EAAE0iD,aACD1iD,MAKL1jB,EAAIvD,KAAKqnE,MAAM9jE,EACfumE,EAAO9pE,KAAKqnE,MAAMyC,KAElB4D,EAAK1tE,KAAKgkB,EACV2pD,EAAK3tE,KAAKupD,EACVqkB,EAAK5tE,KAAKwzB,EACVq6C,EAAMD,EAAGnL,SAASA,SAGlBqL,EAAMH,EAAG3L,OAAO2L;KACfnkE,EAAI,EAAGA,EAAIq0B,EAAKr0B,IAAK,KACpBukE,EAAML,EAAGjL,SACTuL,EAAOF,EAAIrL,SACXwL,EAAOD,EAAKvL,SACZ7yD,EAAIm+D,EAAI/L,OAAO+L,GAAK9L,QAAQ8L,GAAK9L,QAAQ1+D,EAAE++D,OAAOuL,IAElDK,EAAKR,EAAGpL,OAAO0L,GACftB,EAAK98D,EAAE6yD,SAASN,QAAQ+L,EAAGlM,OAAOkM,IAClCC,EAAKD,EAAG/L,QAAQuK,GAChB0B,EAAMx+D,EAAE0yD,OAAO6L,GACnBC,EAAMA,EAAInM,QAAQmM,GAAKjM,QAAQ8L,OAC3BR,EAAKK,EAAIxL,OAAOsL,GAChBpkE,EAAI,EAAIq0B,IACVgwC,EAAMA,EAAIvL,OAAO2L,IAEnBP,EAAKhB,EACLkB,EAAKH,EACLK,EAAMM,SAGDpuE,KAAKqnE,MAAMS,OAAO4F,EAAII,EAAIxL,OAAOwH,GAAO8D,IAGjDnD,GAAO9iE,UAAUgiE,IAAM,kBACjB3pE,KAAKysE,aACAzsE,KAELA,KAAKqnE,MAAM0C,MACN/pE,KAAKquE,WACLruE,KAAKqnE,MAAM2C,OACXhqE,KAAKsuE,YAELtuE,KAAKuuE,QAGhB9D,GAAO9iE,UAAU0mE,SAAW,eACtB3B,EACAC,EACAc;IAEAztE,KAAK0qE,KAAM,KAMT8D,EAAKxuE,KAAKgkB,EAAEy+C,SAEZgM,EAAKzuE,KAAKupD,EAAEkZ,SAEZiM,EAAOD,EAAGhM,SAEV/yC,EAAI1vB,KAAKgkB,EAAEg+C,OAAOyM,GAAIhM,SAASN,QAAQqM,GAAIrM,QAAQuM,GACvDh/C,EAAIA,EAAEuyC,QAAQvyC,OAEV8E,EAAIg6C,EAAGxM,OAAOwM,GAAIvM,QAAQuM,GAE1Bz/B,EAAIva,EAAEiuC,SAASN,QAAQzyC,GAAGyyC,QAAQzyC,GAGlCi/C,EAAQD,EAAKzM,QAAQyM,GAEzBC,GADAA,EAAQA,EAAM1M,QAAQ0M,IACR1M,QAAQ0M,GAGtBjC,EAAK39B,EAEL49B,EAAKn4C,EAAE8tC,OAAO5yC,EAAEyyC,QAAQpzB,IAAIozB,QAAQwM,GAEpClB,EAAKztE,KAAKupD,EAAEyY,OAAOhiE,KAAKupD,OACnB,KAMDhmD,EAAIvD,KAAKgkB,EAAEy+C,SAEX9yD,EAAI3P,KAAKupD,EAAEkZ,SAEX7yD,EAAID,EAAE8yD,SAENjb,EAAIxnD,KAAKgkB,EAAEg+C,OAAOryD,GAAG8yD,SAASN,QAAQ5+D,GAAG4+D,QAAQvyD,GACrD43C,EAAIA,EAAEya,QAAQza,OAEVj0B,EAAIhwB,EAAEy+D,OAAOz+D,GAAG0+D,QAAQ1+D,GAExBW,EAAIqvB,EAAEkvC,SAGNmM,EAAKh/D,EAAEqyD,QAAQryD;CAEnBg/D,GADAA,EAAKA,EAAG3M,QAAQ2M,IACR3M,QAAQ2M,GAGhBlC,EAAKxoE,EAAEi+D,QAAQ3a,GAAG2a,QAAQ3a,GAE1BmlB,EAAKp5C,EAAE+uC,OAAO9a,EAAE2a,QAAQuK,IAAKvK,QAAQyM,GAGrCnB,GADAA,EAAKztE,KAAKupD,EAAE+Y,OAAOtiE,KAAKwzB,IAChByuC,QAAQwL,UAGXztE,KAAKqnE,MAAMS,OAAO4E,EAAIC,EAAIc,IAGnChD,GAAO9iE,UAAU2mE,UAAY,eACvB5B,EACAC,EACAc,KAEAztE,KAAK0qE,KAAM,KAMT8D,EAAKxuE,KAAKgkB,EAAEy+C,SAEZgM,EAAKzuE,KAAKupD,EAAEkZ,SAEZiM,EAAOD,EAAGhM,SAEV/yC,EAAI1vB,KAAKgkB,EAAEg+C,OAAOyM,GAAIhM,SAASN,QAAQqM,GAAIrM,QAAQuM,GACvDh/C,EAAIA,EAAEuyC,QAAQvyC,OAEV8E,EAAIg6C,EAAGxM,OAAOwM,GAAIvM,QAAQuM,GAAIvM,QAAQjiE,KAAKqnE,MAAM9jE,GAEjDwrC,EAAIva,EAAEiuC,SAASN,QAAQzyC,GAAGyyC,QAAQzyC,GAEtCg9C,EAAK39B,MAED4/B,EAAQD,EAAKzM,QAAQyM,GAEzBC,GADAA,EAAQA,EAAM1M,QAAQ0M,IACR1M,QAAQ0M;AACtBhC,EAAKn4C,EAAE8tC,OAAO5yC,EAAEyyC,QAAQpzB,IAAIozB,QAAQwM,GAEpClB,EAAKztE,KAAKupD,EAAEyY,OAAOhiE,KAAKupD,OACnB,KAKDkX,EAAQzgE,KAAKwzB,EAAEivC,SAEfoM,EAAQ7uE,KAAKupD,EAAEkZ,SAEf+G,EAAOxpE,KAAKgkB,EAAEs+C,OAAOuM,GAErBC,EAAQ9uE,KAAKgkB,EAAEk+C,OAAOzB,GAAO6B,OAAOtiE,KAAKgkB,EAAEg+C,OAAOvB,IACtDqO,EAAQA,EAAM9M,OAAO8M,GAAO7M,QAAQ6M,OAEhCC,EAAQvF,EAAKvH,QAAQuH,GAErBwF,GADJD,EAAQA,EAAM9M,QAAQ8M,IACJ/M,OAAO+M,GACzBrC,EAAKoC,EAAMrM,SAASN,QAAQ6M,GAE5BvB,EAAKztE,KAAKupD,EAAEyY,OAAOhiE,KAAKwzB,GAAGivC,SAASN,QAAQ0M,GAAO1M,QAAQ1B,OAEvDwO,EAAUJ,EAAMpM,SAGpBwM,GADAA,GADAA,EAAUA,EAAQhN,QAAQgN,IACRhN,QAAQgN,IACRhN,QAAQgN,GAC1BtC,EAAKmC,EAAMxM,OAAOyM,EAAM5M,QAAQuK,IAAKvK,QAAQ8M,UAGxCjvE,KAAKqnE,MAAMS,OAAO4E,EAAIC,EAAIc,IAGnChD,GAAO9iE,UAAU4mE,KAAO;IAClBhrE,EAAIvD,KAAKqnE,MAAM9jE,EAGfmqE,EAAK1tE,KAAKgkB,EACV2pD,EAAK3tE,KAAKupD,EACVqkB,EAAK5tE,KAAKwzB,EACVq6C,EAAMD,EAAGnL,SAASA,SAElBsL,EAAML,EAAGjL,SACTyM,EAAMvB,EAAGlL,SAET7yD,EAAIm+D,EAAI/L,OAAO+L,GAAK9L,QAAQ8L,GAAK9L,QAAQ1+D,EAAE++D,OAAOuL,IAElDsB,EAAOzB,EAAG1L,OAAO0L,GAEjBQ,GADJiB,EAAOA,EAAKlN,QAAQkN,IACN7M,OAAO4M,GACjBxC,EAAK98D,EAAE6yD,SAASN,QAAQ+L,EAAGlM,OAAOkM,IAClCC,EAAKD,EAAG/L,QAAQuK,GAEhB0C,EAAOF,EAAIzM,SAGf2M,GADAA,GADAA,EAAOA,EAAKnN,QAAQmN,IACRnN,QAAQmN,IACRnN,QAAQmN,OAChBzC,EAAK/8D,EAAE0yD,OAAO6L,GAAIhM,QAAQiN,GAC1B3B,EAAKE,EAAG3L,OAAO2L,GAAIrL,OAAOsL,UAEvB5tE,KAAKqnE,MAAMS,OAAO4E,EAAIC,EAAIc,IAGnChD,GAAO9iE,UAAU0nE,KAAO,eACjBrvE,KAAKqnE,MAAM0C,MACd,OAAO/pE,KAAK2pE,MAAMlwC,IAAIz5B;KAMpBwuE,EAAKxuE,KAAKgkB,EAAEy+C,SAEZgM,EAAKzuE,KAAKupD,EAAEkZ,SAEZ6M,EAAKtvE,KAAKwzB,EAAEivC,SAEZiM,EAAOD,EAAGhM,SAEVjuC,EAAIg6C,EAAGxM,OAAOwM,GAAIvM,QAAQuM,GAE1Be,EAAK/6C,EAAEiuC,SAEPlvC,EAAIvzB,KAAKgkB,EAAEg+C,OAAOyM,GAAIhM,SAASN,QAAQqM,GAAIrM,QAAQuM,GAKnDc,GAFJj8C,GADAA,GADAA,EAAIA,EAAE0uC,QAAQ1uC,IACRyuC,OAAOzuC,GAAG0uC,QAAQ1uC,IAClB4uC,QAAQoN,IAEH9M,SAEP1zB,EAAI2/B,EAAKzM,QAAQyM,GAGrB3/B,GADAA,GADAA,EAAIA,EAAEkzB,QAAQlzB,IACRkzB,QAAQlzB,IACRkzB,QAAQlzB,OAEVk2B,EAAIzwC,EAAEytC,QAAQ1uC,GAAGkvC,SAASN,QAAQoN,GAAIpN,QAAQqN,GAAIrN,QAAQpzB,GAE1D0gC,EAAOhB,EAAGnM,OAAO2C,GAErBwK,GADAA,EAAOA,EAAKxN,QAAQwN,IACRxN,QAAQwN,OAChB/C,EAAK1sE,KAAKgkB,EAAEs+C,OAAOkN,GAAIrN,QAAQsN,GAEnC/C,GADAA,EAAKA,EAAGzK,QAAQyK,IACRzK,QAAQyK;KAEZC,EAAK3sE,KAAKupD,EAAE+Y,OAAO2C,EAAE3C,OAAOvzB,EAAEozB,QAAQ8C,IAAI9C,QAAQ5uC,EAAE+uC,OAAOkN,KAG/D7C,GADAA,GADAA,EAAKA,EAAG1K,QAAQ0K,IACR1K,QAAQ0K,IACR1K,QAAQ0K,OAEZc,EAAKztE,KAAKwzB,EAAEwuC,OAAOzuC,GAAGkvC,SAASN,QAAQmN,GAAInN,QAAQqN,UAEhDxvE,KAAKqnE,MAAMS,OAAO4E,EAAIC,EAAIc,IAGnChD,GAAO9iE,UAAU6pD,IAAM,SAAaroC,EAAGumD,UACrCvmD,EAAI,IAAI0nC,GAAG1nC,EAAGumD,GAEP1vE,KAAKqnE,MAAMa,SAASloE,KAAMmpB,IAGnCshD,GAAO9iE,UAAU45D,GAAK,SAAYl5C,MACjB,WAAXA,EAAErhB,KACJ,OAAOhH,KAAKuhE,GAAGl5C,EAAEugD,UAEf5oE,OAASqoB,EACX,OAAO,MAGLilD,EAAKttE,KAAKwzB,EAAEivC,SACZ4K,EAAMhlD,EAAEmL,EAAEivC,YAC6C,IAAvDziE,KAAKgkB,EAAEs+C,OAAO+K,GAAKlL,QAAQ95C,EAAErE,EAAEs+C,OAAOgL,IAAK5M,KAAK,GAClD,OAAO;KAGLiP,EAAKrC,EAAGhL,OAAOtiE,KAAKwzB,GACpBo8C,EAAMvC,EAAI/K,OAAOj6C,EAAEmL,UACuC,IAAvDxzB,KAAKupD,EAAE+Y,OAAOsN,GAAKzN,QAAQ95C,EAAEkhC,EAAE+Y,OAAOqN,IAAKjP,KAAK,IAGzD+J,GAAO9iE,UAAUkoE,OAAS,SAAgB7rD,OACpC8rD,EAAK9vE,KAAKwzB,EAAEivC,SACZtvC,EAAKnP,EAAEy9C,MAAMzhE,KAAKqnE,MAAMpW,KAAKqR,OAAOwN,MACjB,IAAnB9vE,KAAKgkB,EAAEytC,IAAIt+B,GACb,OAAO,UAEL48C,EAAK/rD,EAAEsuC,QACPvjB,EAAI/uC,KAAKqnE,MAAMH,KAAK5E,OAAOwN,KACtB,IACPC,EAAGla,KAAK71D,KAAKqnE,MAAMn+C,GACf6mD,EAAGte,IAAIzxD,KAAKqnE,MAAMh/C,IAAM,EAC1B,OAAO,KAET8K,EAAG8uC,QAAQlzB,GACY,IAAnB/uC,KAAKgkB,EAAEytC,IAAIt+B,GACb,OAAO,IAIbs3C,GAAO9iE,UAAU8qD,QAAU;OACrBzyD,KAAKysE,aACA,uBACF,iBAAmBzsE,KAAKgkB,EAAExiB,SAAS,GAAI,GAC1C,OAASxB,KAAKupD,EAAE/nD,SAAS,GAAI,GAC7B,OAASxB,KAAKwzB,EAAEhyB,SAAS,GAAI,GAAK,KAGxCipE,GAAO9iE,UAAU8kE,WAAa,kBAEF,IAAnBzsE,KAAKwzB,EAAEktC,KAAK,ICt6BrB,IAAI7P,GAAKvwD,WACL0mD,GAAWplD,WACXgoE,GAAOvmE,GAEPglD,GAAQ3kD,GAEZ,SAASssE,GAAUxJ,GACjBoD,GAAK9oE,KAAKd,KAAM,OAAQwmE,QAEnBjjE,EAAI,IAAIstD,GAAG2V,EAAKjjE,EAAG,IAAIk+D,MAAMzhE,KAAKixD,UAClCthD,EAAI,IAAIkhD,GAAG2V,EAAK72D,EAAG,IAAI8xD,MAAMzhE,KAAKixD,UAClCgf,GAAK,IAAIpf,GAAG,GAAG4Q,MAAMzhE,KAAKixD,KAAK6R,eAC/B2D,IAAM,IAAI5V,GAAG,GAAG4Q,MAAMzhE,KAAKixD,UAC3Bif,IAAMlwE,KAAKiwE,GAAG3N,OAAOtiE,KAAKuD,EAAEy+D,OAAOhiE,KAAKymE;GAEtCuJ,GAAWpG,QACpB5E,GAAiBgL,GAWjB,SAAS1F,GAAMjD,EAAOrjD,EAAGwP,GACvBo2C,GAAKxC,UAAUtmE,KAAKd,KAAMqnE,EAAO,cACvB,OAANrjD,GAAoB,OAANwP,QACXxP,EAAIhkB,KAAKqnE,MAAM5C,SACfjxC,EAAIxzB,KAAKqnE,MAAM9gC,YAEfviB,EAAI,IAAI6sC,GAAG7sC,EAAG,SACdwP,EAAI,IAAIq9B,GAAGr9B,EAAG,IACdxzB,KAAKgkB,EAAEitC,MACVjxD,KAAKgkB,EAAIhkB,KAAKgkB,EAAEy9C,MAAMzhE,KAAKqnE,MAAMpW,MAC9BjxD,KAAKwzB,EAAEy9B,MACVjxD,KAAKwzB,EAAIxzB,KAAKwzB,EAAEiuC,MAAMzhE,KAAKqnE,MAAMpW,OApBvC+e,GAAUroE,UAAU4/D,SAAW,SAAkB3sD,OAC3CoJ,EAAIpJ,EAAMjQ,YAAYqZ,EACtBmhC,EAAKnhC,EAAEy+C,SACPuJ,EAAM7mB,EAAGmd,OAAOt+C,GAAGg+C,OAAO7c,EAAGmd,OAAOtiE,KAAKuD,IAAIy+D,OAAOh+C,UAGzB,IAFvBgoD,EAAIpJ,UAEHH,SAAShR,IAAIua,OAiBf1B,GAAOV,GAAKxC;AAErB4I,GAAUroE,UAAUohE,YAAc,SAAqB1qC,EAAOipB,UACrDtnD,KAAK4a,MAAMytC,GAAMU,QAAQ1qB,EAAOipB,GAAM,IAG/C0oB,GAAUroE,UAAUiT,MAAQ,SAAeoJ,EAAGwP,UACrC,IAAI82C,GAAMtqE,KAAMgkB,EAAGwP,IAG5Bw8C,GAAUroE,UAAU++D,cAAgB,SAAuB58C,UAClDwgD,GAAM8B,SAASpsE,KAAM8pB,OAGxBniB,UAAU2hE,WAAa,gBAIvB3hE,UAAUuhE,QAAU,kBACjBlpE,KAAKopE,OAAOrgB,QAAQ,KAAM/oD,KAAKqnE,MAAMh/C,EAAEiY,kBAG1C8rC,SAAW,SAAkB/E,EAAOv9C,UACjC,IAAIwgD,GAAMjD,EAAOv9C,EAAI,GAAIA,EAAI,IAAMu9C,EAAM5C,SAG5C98D,UAAU8qD,QAAU;OACpBzyD,KAAKysE,aACA,sBACF,gBAAkBzsE,KAAKgkB,EAAE69C,UAAUrgE,SAAS,GAAI,GACnD,OAASxB,KAAKwzB,EAAEquC,UAAUrgE,SAAS,GAAI,GAAK,QAG5CmG,UAAU8kE,WAAa,kBAED,IAAnBzsE,KAAKwzB,EAAEktC,KAAK,OAGf/4D,UAAUgiE,IAAM,eAOhBwG,EAFInwE,KAAKgkB,EAAEg+C,OAAOhiE,KAAKwzB,GAEhBivC,SAIP2N,EAFIpwE,KAAKgkB,EAAEk+C,OAAOliE,KAAKwzB,GAEhBivC,SAEP7yD,EAAIugE,EAAGjO,OAAOkO,GAEd1D,EAAKyD,EAAG7N,OAAO8N,GAEf3C,EAAK79D,EAAE0yD,OAAO8N,EAAGpO,OAAOhiE,KAAKqnE,MAAM6I,IAAI5N,OAAO1yD,YAC3C5P,KAAKqnE,MAAMzsD,MAAM8xD,EAAIe,OAGxB9lE,UAAU8xB,IAAM,iBACd,IAAI9O,MAAM;GAGZhjB,UAAU0oE,QAAU,SAAiBhoD,EAAG+2C,OAKxC77D,EAAIvD,KAAKgkB,EAAEg+C,OAAOhiE,KAAKwzB,GAEvB7jB,EAAI3P,KAAKgkB,EAAEk+C,OAAOliE,KAAKwzB,GAEvB5jB,EAAIyY,EAAErE,EAAEg+C,OAAO35C,EAAEmL,GAIjB88C,EAFIjoD,EAAErE,EAAEk+C,OAAO75C,EAAEmL,GAEV8uC,OAAO/+D,GAEdgtE,EAAK3gE,EAAE0yD,OAAO3yD,GAEd+8D,EAAKtN,EAAK5rC,EAAE8uC,OAAOgO,EAAGtO,OAAOuO,GAAI9N,UAEjCgL,EAAKrO,EAAKp7C,EAAEs+C,OAAOgO,EAAGnO,QAAQoO,GAAI9N,iBAC/BziE,KAAKqnE,MAAMzsD,MAAM8xD,EAAIe,OAGxB9lE,UAAU6pD,IAAM,SAAaroC,WAC7B4lB,EAAI5lB,EAAEmpC,QACN/uD,EAAIvD,KACJ2P,EAAI3P,KAAKqnE,MAAMzsD,MAAM,KAAM,MAGtByuB,EAAO,GAAkB,IAAd0F,EAAE2xB,KAAK,GAAU3xB,EAAE8kB,OAAO,GAC5CxqB,EAAKjkC,KAAK2pC,EAAE6kB,MAAM,QAEf,IAAIpqD,EAAI6/B,EAAKlhC,OAAS,EAAGqB,GAAK,EAAGA,IACpB,IAAZ6/B,EAAK7/B,IAEPjG,EAAIA,EAAE8sE,QAAQ1gE,EARV3P,MAUJ2P,EAAIA,EAAEg6D,QAGNh6D,EAAIpM,EAAE8sE,QAAQ1gE,EAbV3P,MAeJuD,EAAIA,EAAEomE,cAGHh6D;GAGHhI,UAAUmlE,OAAS,iBACjB,IAAIniD,MAAM,yCAGZhjB,UAAU6oE,QAAU,iBAClB,IAAI7lD,MAAM,yCAGZhjB,UAAU45D,GAAK,SAAYkP,UACU,IAAlCzwE,KAAKopE,OAAO3X,IAAIgf,EAAMrH,YAGzBzhE,UAAUgD,UAAY,uBACrBqZ,EAAIhkB,KAAKgkB,EAAEs+C,OAAOtiE,KAAKwzB,EAAEsvC,gBACzBtvC,EAAIxzB,KAAKqnE,MAAM5C,IACbzkE,SAGH2H,UAAUyhE,KAAO,uBAEhBz+D,YAEE3K,KAAKgkB,EAAE69C,WC9KhB,IAAIxZ,GAAQ/nD,GACRuwD,GAAKjvD,WACLolD,GAAW3jD,WACXumE,GAAOlmE,GAEPgjD,GAAS2B,GAAM3B,OAEnB,SAASgqB,GAAalK;KAEfmK,QAA2B,IAAP,EAATnK,EAAKjjE,QAChBqtE,MAAQ5wE,KAAK2wE,UAA6B,IAAR,EAATnK,EAAKjjE,QAC9B66D,SAAWp+D,KAAK4wE,MAErBhH,GAAK9oE,KAAKd,KAAM,UAAWwmE,QAEtBjjE,EAAI,IAAIstD,GAAG2V,EAAKjjE,EAAG,IAAIm8D,KAAK1/D,KAAKixD,IAAIz8B,QACrCjxB,EAAIvD,KAAKuD,EAAEk+D,MAAMzhE,KAAKixD,UACtBrhD,EAAI,IAAIihD,GAAG2V,EAAK52D,EAAG,IAAI6xD,MAAMzhE,KAAKixD,UAClCvY,GAAK14C,KAAK4P,EAAE6yD,cACZjb,EAAI,IAAIqJ,GAAG2V,EAAKhf,EAAG,IAAIia,MAAMzhE,KAAKixD,UAClC4f,GAAK7wE,KAAKwnD,EAAEwa,OAAOhiE,KAAKwnD,GAE7Bd,IAAQ1mD,KAAK2wE,SAAwC,IAA7B3wE,KAAK4P,EAAEiyD,UAAUnB,KAAK,SACzCoQ,KAAwB,IAAP,EAATtK,EAAK52D,GAEpBo3C,GAAS0pB,GAAc9G,QACvBmH,GAAiBL,GAqFjB,SAASpG,GAAMjD,EAAOrjD,EAAGulC,EAAG/1B,EAAGub,GAC7B66B,GAAKxC,UAAUtmE,KAAKd,KAAMqnE,EAAO;AACvB,OAANrjD,GAAoB,OAANulC,GAAoB,OAAN/1B,QACzBxP,EAAIhkB,KAAKqnE,MAAM9gC,UACfgjB,EAAIvpD,KAAKqnE,MAAM5C,SACfjxC,EAAIxzB,KAAKqnE,MAAM5C,SACf11B,EAAI/uC,KAAKqnE,MAAM9gC,UACfmkC,MAAO,SAEP1mD,EAAI,IAAI6sC,GAAG7sC,EAAG,SACdulC,EAAI,IAAIsH,GAAGtH,EAAG,SACd/1B,EAAIA,EAAI,IAAIq9B,GAAGr9B,EAAG,IAAMxzB,KAAKqnE,MAAM5C,SACnC11B,EAAIA,GAAK,IAAI8hB,GAAG9hB,EAAG,IACnB/uC,KAAKgkB,EAAEitC,MACVjxD,KAAKgkB,EAAIhkB,KAAKgkB,EAAEy9C,MAAMzhE,KAAKqnE,MAAMpW,MAC9BjxD,KAAKupD,EAAE0H,MACVjxD,KAAKupD,EAAIvpD,KAAKupD,EAAEkY,MAAMzhE,KAAKqnE,MAAMpW,MAC9BjxD,KAAKwzB,EAAEy9B,MACVjxD,KAAKwzB,EAAIxzB,KAAKwzB,EAAEiuC,MAAMzhE,KAAKqnE,MAAMpW,MAC/BjxD,KAAK+uC,IAAM/uC,KAAK+uC,EAAEkiB,MACpBjxD,KAAK+uC,EAAI/uC,KAAK+uC,EAAE0yB,MAAMzhE,KAAKqnE,MAAMpW,WAC9ByZ,KAAO1qE,KAAKwzB,IAAMxzB,KAAKqnE,MAAM5C;AAG9BzkE,KAAKqnE,MAAMjJ,WAAap+D,KAAK+uC,SAC1BA,EAAI/uC,KAAKgkB,EAAEs+C,OAAOtiE,KAAKupD,GACvBvpD,KAAK0qE,OACR1qE,KAAK+uC,EAAI/uC,KAAK+uC,EAAEuzB,OAAOtiE,KAAKwzB,EAAEsvC,cA9GtC4N,GAAa/oE,UAAUqpE,MAAQ,SAAe5oB,UACxCpoD,KAAK4wE,MACAxoB,EAAI2a,SAEJ/iE,KAAKuD,EAAE++D,OAAOla,IAGzBsoB,GAAa/oE,UAAUspE,MAAQ,SAAe7oB,UACxCpoD,KAAK8wE,KACA1oB,EAEApoD,KAAK4P,EAAE0yD,OAAOla,IAIzBsoB,GAAa/oE,UAAUmgE,OAAS,SAAgB9jD,EAAGulC,EAAG/1B,EAAGub,UAChD/uC,KAAK4a,MAAMoJ,EAAGulC,EAAG/1B,EAAGub,IAG7B2hC,GAAa/oE,UAAUqhE,WAAa,SAAoBhlD,EAAG64C,IACzD74C,EAAI,IAAI6sC,GAAG7sC,EAAG,KACPitC,MACLjtC,EAAIA,EAAEy9C,MAAMzhE,KAAKixD;KAEf9L,EAAKnhC,EAAEy+C,SACPuJ,EAAMhsE,KAAK04C,GAAGwpB,OAAOliE,KAAKuD,EAAE++D,OAAOnd,IACnC+rB,EAAMlxE,KAAKykE,IAAIvC,OAAOliE,KAAK04C,GAAG4pB,OAAOtiE,KAAKwnD,GAAG8a,OAAOnd,IAEpDmmB,EAAKU,EAAI1J,OAAO4O,EAAIpO,WACpBvZ,EAAI+hB,EAAG1I,aACkC,IAAzCrZ,EAAEkZ,SAASP,OAAOoJ,GAAI7Z,IAAIzxD,KAAKumC,MACjC,MAAM,IAAI5b,MAAM,qBAEdy1C,EAAQ7W,EAAEsY,UAAUzB,eACpBvD,IAAQuD,IAAUvD,GAAOuD,KAC3B7W,EAAIA,EAAEwZ,UAED/iE,KAAK4a,MAAMoJ,EAAGulC,IAGvBmnB,GAAa/oE,UAAUwpE,WAAa,SAAoB5nB,EAAGsT,IACzDtT,EAAI,IAAIsH,GAAGtH,EAAG,KACP0H,MACL1H,EAAIA,EAAEkY,MAAMzhE,KAAKixD,UAGfqa,EAAK/hB,EAAEkZ,SACPyO,EAAM5F,EAAGpJ,OAAOliE,KAAK04C,IACrBszB,EAAMV,EAAGhJ,OAAOtiE,KAAKwnD,GAAG8a,OAAOtiE,KAAK04C,IAAIwpB,OAAOliE,KAAKuD,GACpD4hD,EAAK+rB,EAAI5O,OAAO0J,EAAIlJ;IAEE,IAAtB3d,EAAGsM,IAAIzxD,KAAKumC,MAAa,IACvBs2B,EACF,MAAM,IAAIlyC,MAAM,iBAEhB,OAAO3qB,KAAK4a,MAAM5a,KAAKumC,KAAMgjB,OAG7BvlC,EAAImhC,EAAGyd,aACkC,IAAzC5+C,EAAEy+C,SAASP,OAAO/c,GAAIsM,IAAIzxD,KAAKumC,MACjC,MAAM,IAAI5b,MAAM,wBAEd3G,EAAE69C,UAAUzB,UAAYvD,IAC1B74C,EAAIA,EAAE++C,UAED/iE,KAAK4a,MAAMoJ,EAAGulC,IAGvBmnB,GAAa/oE,UAAU4/D,SAAW,SAAkB3sD,MAC9CA,EAAM6xD,aACR,OAAO,EAGT7xD,EAAMjQ,gBAEFw6C,EAAKvqC,EAAMoJ,EAAEy+C,SACb6I,EAAK1wD,EAAM2uC,EAAEkZ,SACbyO,EAAM/rB,EAAGmd,OAAOtiE,KAAKuD,GAAGy+D,OAAOsJ,GAC/BU,EAAMhsE,KAAK04C,GAAG4pB,OAAOtiE,KAAKykE,IAAIzC,OAAOhiE,KAAKwnD,EAAE8a,OAAOnd,GAAImd,OAAOgJ,YAE1C,IAAjB4F,EAAIzf,IAAIua,IAkCjBhlB,GAASsjB,GAAOV,GAAKxC;AAErBsJ,GAAa/oE,UAAU++D,cAAgB,SAAuB58C,UACrDwgD,GAAM8B,SAASpsE,KAAM8pB,IAG9B4mD,GAAa/oE,UAAUiT,MAAQ,SAAeoJ,EAAGulC,EAAG/1B,EAAGub,UAC9C,IAAIu7B,GAAMtqE,KAAMgkB,EAAGulC,EAAG/1B,EAAGub,IAGlCu7B,GAAM8B,SAAW,SAAkB/E,EAAOv9C,UACjC,IAAIwgD,GAAMjD,EAAOv9C,EAAI,GAAIA,EAAI,GAAIA,EAAI,KAG9CwgD,GAAM3iE,UAAU8qD,QAAU,kBACpBzyD,KAAKysE,aACA,sBACF,gBAAkBzsE,KAAKgkB,EAAE69C,UAAUrgE,SAAS,GAAI,GACnD,OAASxB,KAAKupD,EAAEsY,UAAUrgE,SAAS,GAAI,GACvC,OAASxB,KAAKwzB,EAAEquC,UAAUrgE,SAAS,GAAI,GAAK,KAGlD8oE,GAAM3iE,UAAU8kE,WAAa;OAED,IAAnBzsE,KAAKgkB,EAAE08C,KAAK,KACO,IAAvB1gE,KAAKupD,EAAEkI,IAAIzxD,KAAKwzB,IAChBxzB,KAAK0qE,MAAqC,IAA7B1qE,KAAKupD,EAAEkI,IAAIzxD,KAAKqnE,MAAMz3D,KAGxC06D,GAAM3iE,UAAUypE,QAAU,eAMpB7tE,EAAIvD,KAAKgkB,EAAEy+C,SAEX9yD,EAAI3P,KAAKupD,EAAEkZ,SAEX7yD,EAAI5P,KAAKwzB,EAAEivC,SACf7yD,EAAIA,EAAEqyD,QAAQryD,OAEV43C,EAAIxnD,KAAKqnE,MAAM2J,MAAMztE,GAErBgwB,EAAIvzB,KAAKgkB,EAAEg+C,OAAOhiE,KAAKupD,GAAGkZ,SAASN,QAAQ5+D,GAAG4+D,QAAQxyD,GAEtDk7C,EAAIrD,EAAEwa,OAAOryD,GAEbzL,EAAI2mD,EAAEqX,OAAOtyD,GAEbw7B,EAAIoc,EAAE0a,OAAOvyD,GAEb+8D,EAAKn5C,EAAE+uC,OAAOp+D,GAEdyoE,EAAK9hB,EAAEyX,OAAOl3B,GAEdimC,EAAK99C,EAAE+uC,OAAOl3B,GAEdqiC,EAAKvpE,EAAEo+D,OAAOzX,UACX7qD,KAAKqnE,MAAMzsD,MAAM8xD,EAAIC,EAAIc,EAAI4D,IAGtC/G,GAAM3iE,UAAU2pE,SAAW;IAcrB5E,EACAC,EACAc,EACAl6C,EACA6X,EACA/V,EAXA1lB,EAAI3P,KAAKgkB,EAAEg+C,OAAOhiE,KAAKupD,GAAGkZ,SAE1B7yD,EAAI5P,KAAKgkB,EAAEy+C,SAEXjb,EAAIxnD,KAAKupD,EAAEkZ,YAQXziE,KAAKqnE,MAAMsJ,QAAS,KAIlBzsE,GAFJqvB,EAAIvzB,KAAKqnE,MAAM2J,MAAMphE,IAEXoyD,OAAOxa,GACbxnD,KAAK0qE,MAEPgC,EAAK/8D,EAAEuyD,OAAOtyD,GAAGsyD,OAAO1a,GAAG8a,OAAOp+D,EAAEg+D,OAAOliE,KAAKqnE,MAAMZ,MAEtDkG,EAAKzoE,EAAEo+D,OAAO/uC,EAAE2uC,OAAO1a,IAEvBimB,EAAKvpE,EAAEu+D,SAASP,OAAOh+D,GAAGg+D,OAAOh+D,KAGjCknC,EAAIprC,KAAKwzB,EAAEivC,SAEXptC,EAAInxB,EAAEg+D,OAAO92B,GAAG+2B,QAAQ/2B,GAExBshC,EAAK/8D,EAAEuyD,OAAOtyD,GAAGuyD,QAAQ3a,GAAG8a,OAAOjtC,GAEnCs3C,EAAKzoE,EAAEo+D,OAAO/uC,EAAE2uC,OAAO1a,IAEvBimB,EAAKvpE,EAAEo+D,OAAOjtC,SAIhB9B,EAAI3jB,EAAEoyD,OAAOxa,GAEbpc,EAAIprC,KAAKqnE,MAAM4J,MAAMjxE,KAAKwzB,GAAGivC,SAE7BptC,EAAI9B,EAAE2uC,OAAO92B,GAAG82B,OAAO92B;AAEvBshC,EAAK1sE,KAAKqnE,MAAM4J,MAAMthE,EAAEwyD,QAAQ5uC,IAAI+uC,OAAOjtC,GAE3Cs3C,EAAK3sE,KAAKqnE,MAAM4J,MAAM19C,GAAG+uC,OAAO1yD,EAAEuyD,QAAQ3a,IAE1CimB,EAAKl6C,EAAE+uC,OAAOjtC,UAETr1B,KAAKqnE,MAAMzsD,MAAM8xD,EAAIC,EAAIc,IAGlCnD,GAAM3iE,UAAUgiE,IAAM,kBAChB3pE,KAAKysE,aACAzsE,KAGLA,KAAKqnE,MAAMjJ,SACNp+D,KAAKoxE,UAELpxE,KAAKsxE,YAGhBhH,GAAM3iE,UAAU4pE,QAAU,SAAiBlpD;IAMrC9kB,EAAIvD,KAAKupD,EAAE2Y,OAAOliE,KAAKgkB,GAAGs+C,OAAOj6C,EAAEkhC,EAAE2Y,OAAO75C,EAAErE,IAE9CrU,EAAI3P,KAAKupD,EAAEyY,OAAOhiE,KAAKgkB,GAAGs+C,OAAOj6C,EAAEkhC,EAAEyY,OAAO35C,EAAErE,IAE9CpU,EAAI5P,KAAK+uC,EAAEuzB,OAAOtiE,KAAKqnE,MAAMwJ,IAAIvO,OAAOj6C,EAAE0mB,GAE1CyY,EAAIxnD,KAAKwzB,EAAE8uC,OAAOj6C,EAAEmL,EAAEwuC,OAAO35C,EAAEmL,IAE/BD,EAAI5jB,EAAEuyD,OAAO3+D,GAEbW,EAAIsjD,EAAE0a,OAAOtyD,GAEbi7C,EAAIrD,EAAEwa,OAAOpyD,GAEbw7B,EAAIz7B,EAAEqyD,OAAOz+D,GAEbmpE,EAAKn5C,EAAE+uC,OAAOp+D,GAEdyoE,EAAK9hB,EAAEyX,OAAOl3B,GAEdimC,EAAK99C,EAAE+uC,OAAOl3B,GAEdqiC,EAAKvpE,EAAEo+D,OAAOzX,UACX7qD,KAAKqnE,MAAMzsD,MAAM8xD,EAAIC,EAAIc,EAAI4D,IAGtC/G,GAAM3iE,UAAU6pE,SAAW,SAAkBnpD;IAuBvCskD,EACAc,EAjBAlqE,EAAIvD,KAAKwzB,EAAE8uC,OAAOj6C,EAAEmL,GAEpB7jB,EAAIpM,EAAEk/D,SAEN7yD,EAAI5P,KAAKgkB,EAAEs+C,OAAOj6C,EAAErE,GAEpBwjC,EAAIxnD,KAAKupD,EAAE+Y,OAAOj6C,EAAEkhC,GAEpBh2B,EAAIvzB,KAAKqnE,MAAM7f,EAAE8a,OAAO1yD,GAAG0yD,OAAO9a,GAElCtjD,EAAIyL,EAAEuyD,OAAO3uC,GAEbs3B,EAAIl7C,EAAEqyD,OAAOzuC,GAEbgwC,EAAMvjE,KAAKgkB,EAAEg+C,OAAOhiE,KAAKupD,GAAG+Y,OAAOj6C,EAAErE,EAAEg+C,OAAO35C,EAAEkhC,IAAI4Y,QAAQvyD,GAAGuyD,QAAQ3a,GACvEklB,EAAKnpE,EAAE++D,OAAOp+D,GAAGo+D,OAAOiB,UAGxBvjE,KAAKqnE,MAAMsJ,SAEbhE,EAAKppE,EAAE++D,OAAOzX,GAAGyX,OAAO9a,EAAE0a,OAAOliE,KAAKqnE,MAAM2J,MAAMphE,KAElD69D,EAAKvpE,EAAEo+D,OAAOzX,KAGd8hB,EAAKppE,EAAE++D,OAAOzX,GAAGyX,OAAO9a,EAAE0a,OAAOtyD,IAEjC69D,EAAKztE,KAAKqnE,MAAM4J,MAAM/sE,GAAGo+D,OAAOzX,IAE3B7qD,KAAKqnE,MAAMzsD,MAAM8xD,EAAIC,EAAIc,IAGlCnD,GAAM3iE,UAAU8xB,IAAM,SAAapR;OAC7BroB,KAAKysE,aACApkD,EACLA,EAAEokD,aACGzsE,KAELA,KAAKqnE,MAAMjJ,SACNp+D,KAAKuxE,QAAQlpD,GAEbroB,KAAKwxE,SAASnpD,IAGzBiiD,GAAM3iE,UAAU6pD,IAAM,SAAaroC,UAC7BnpB,KAAK0pE,YAAYvgD,GACZnpB,KAAKqnE,MAAMG,aAAaxnE,KAAMmpB,GAE9BnpB,KAAKqnE,MAAMa,SAASloE,KAAMmpB,IAGrCmhD,GAAM3iE,UAAUmlE,OAAS,SAAgBrH,EAAIp9C,EAAGq9C,UACvC1lE,KAAKqnE,MAAMiB,YAAY,EAAG,CAAEtoE,KAAMqoB,GAAK,CAAEo9C,EAAIC,GAAM,GAAG,IAG/D4E,GAAM3iE,UAAUolE,QAAU,SAAiBtH,EAAIp9C,EAAGq9C,UACzC1lE,KAAKqnE,MAAMiB,YAAY,EAAG,CAAEtoE,KAAMqoB,GAAK,CAAEo9C,EAAIC,GAAM,GAAG,IAG/D4E,GAAM3iE,UAAUgD,UAAY,cACtB3K,KAAK0qE,KACP,OAAO1qE,SAGLyxE,EAAKzxE,KAAKwzB,EAAEsvC;aACX9+C,EAAIhkB,KAAKgkB,EAAEs+C,OAAOmP,QAClBloB,EAAIvpD,KAAKupD,EAAE+Y,OAAOmP,GACnBzxE,KAAK+uC,IACP/uC,KAAK+uC,EAAI/uC,KAAK+uC,EAAEuzB,OAAOmP,SACpBj+C,EAAIxzB,KAAKqnE,MAAM5C,SACfiG,MAAO,EACL1qE,MAGTsqE,GAAM3iE,UAAUgtD,IAAM,kBACb30D,KAAKqnE,MAAMzsD,MAAM5a,KAAKgkB,EAAE++C,SAC7B/iE,KAAKupD,EACLvpD,KAAKwzB,EACLxzB,KAAK+uC,GAAK/uC,KAAK+uC,EAAEg0B,WAGrBuH,GAAM3iE,UAAUyhE,KAAO,uBAChBz+D,YACE3K,KAAKgkB,EAAE69C,WAGhByI,GAAM3iE,UAAU0hE,KAAO,uBAChB1+D,YACE3K,KAAKupD,EAAEsY,WAGhByI,GAAM3iE,UAAU45D,GAAK,SAAYkP,UACxBzwE,OAASywE,GACyB,IAAlCzwE,KAAKopE,OAAO3X,IAAIgf,EAAMrH,SACY,IAAlCppE,KAAKqpE,OAAO5X,IAAIgf,EAAMpH;AAG/BiB,GAAM3iE,UAAUkoE,OAAS,SAAgB7rD,OACnCmP,EAAKnP,EAAEy9C,MAAMzhE,KAAKqnE,MAAMpW,KAAKqR,OAAOtiE,KAAKwzB,MACtB,IAAnBxzB,KAAKgkB,EAAEytC,IAAIt+B,GACb,OAAO,UAEL48C,EAAK/rD,EAAEsuC,QACPvjB,EAAI/uC,KAAKqnE,MAAMH,KAAK5E,OAAOtiE,KAAKwzB,KAC3B,IACPu8C,EAAGla,KAAK71D,KAAKqnE,MAAMn+C,GACf6mD,EAAGte,IAAIzxD,KAAKqnE,MAAMh/C,IAAM,EAC1B,OAAO,KAET8K,EAAG8uC,QAAQlzB,GACY,IAAnB/uC,KAAKgkB,EAAEytC,IAAIt+B,GACb,OAAO,IAKbm3C,GAAM3iE,UAAUsgE,IAAMqC,GAAM3iE,UAAUgD,UACtC2/D,GAAM3iE,UAAUogE,SAAWuC,GAAM3iE,UAAU8xB,oBChbvC4tC,EAAQ/9C,EAEZ+9C,EAAM/7B,KAAOhrC,GACb+mE,EAAMgD,MAAQzoE,GACdylE,EAAMrC,KAAO3hE,GACbgkE,EAAM0J,QAAUrtE,kBCPhBguE,GAAiB,CACfjK,QAAS,CACP/oD,KAAM;AACNspD,OAAQ,CACN,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,kEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA;EAINzC,IAAK,CACHV,IAAK;AACLmD,OAAQ,CACN,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,iEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA;oBC/lBJqE,EAtKAsF,EAASroD,EAETkmC,EAAOlvD,GACP+mE,EAAQzlE,GAGR8kD,EAFQrjD,GAEOqjD,gBAEVkrB,EAAYvqE,GACE,UAAjBA,EAAQL,KACVhH,KAAKqnE,MAAQ,IAAIA,EAAMgD,MAAMhjE,GACL,YAAjBA,EAAQL,KACfhH,KAAKqnE,MAAQ,IAAIA,EAAM0J,QAAQ1pE,GAE/BrH,KAAKqnE,MAAQ,IAAIA,EAAMrC,KAAK39D,QACzBwjD,EAAI7qD,KAAKqnE,MAAMxc,OACf3hC,EAAIlpB,KAAKqnE,MAAMn+C,OACfsmC,KAAOnoD,EAAQmoD,KAEpB9I,EAAO1mD,KAAK6qD,EAAE0c,WAAY,iBAC1B7gB,EAAO1mD,KAAK6qD,EAAE2G,IAAIxxD,KAAKkpB,GAAGujD,aAAc,oCAIjCoF,EAAY3iE,EAAM7H,GACzB9G,OAAOC,eAAemxE,EAAQziE,EAAM,CAClC5N,cAAc,EACdJ,YAAY,EACZT,IAAK,eACC4mE,EAAQ,IAAIuK,EAAYvqE,UAC5B9G,OAAOC,eAAemxE,EAAQziE,EAAM,CAClC5N,cAAc,EACdJ,YAAY;AACZG,MAAOgmE,IAEFA,KAbbsK,EAAOC,YAAcA,EAkBrBC,EAAY,OAAQ,CAClB7qE,KAAM,QACN68D,MAAO,OACPx7C,EAAG,wDACH9kB,EAAG,wDACHoM,EAAG,wDACHuZ,EAAG,wDACHsmC,KAAMA,EAAKS,OACX0W,MAAM,EACN9b,EAAG,CACD,wDACA,2DAIJgnB,EAAY,OAAQ,CAClB7qE,KAAM,QACN68D,MAAO;AACPx7C,EAAG,iEACH9kB,EAAG,iEACHoM,EAAG,iEACHuZ,EAAG,iEACHsmC,KAAMA,EAAKS,OACX0W,MAAM,EACN9b,EAAG,CACD,iEACA,oEAIJgnB,EAAY,OAAQ,CAClB7qE,KAAM,QACN68D,MAAO;AACPx7C,EAAG,0EACH9kB,EAAG,0EACHoM,EAAG,0EACHuZ,EAAG,0EACHsmC,KAAMA,EAAKS,OACX0W,MAAM,EACN9b,EAAG,CACD,0EACA,6EAIJgnB,EAAY,OAAQ;AAClB7qE,KAAM,QACN68D,MAAO,KACPx7C,EAAG,8GAEH9kB,EAAG,8GAEHoM,EAAG,8GAEHuZ,EAAG,8GAEHsmC,KAAMA,EAAKW,OACXwW,MAAM;AACN9b,EAAG,CACD,8GAEA,iHAKJgnB,EAAY,OAAQ,CAClB7qE,KAAM,QACN68D,MAAO,KACPx7C,EAAG;AAGH9kB,EAAG,2JAGHoM,EAAG,2JAGHuZ,EAAG,2JAGHsmC,KAAMA,EAAKY,OACXuW,MAAM;AACN9b,EAAG,CACD,2JAGA,8JAMJgnB,EAAY,aAAc,CACxB7qE,KAAM,OACN68D,MAAO,SACPx7C,EAAG,sEACH9kB,EAAG,QACHoM,EAAG;AACHuZ,EAAG,sEACHsmC,KAAMA,EAAKS,OACX0W,MAAM,EACN9b,EAAG,CACD,OAIJgnB,EAAY,UAAW,CACrB7qE,KAAM,UACN68D,MAAO,SACPx7C,EAAG,sEACH9kB,EAAG,KACHqM,EAAG,IAEH43C,EAAG,sEACHt+B,EAAG,sEACHsmC,KAAMA,EAAKS,OACX0W,MAAM;AACN9b,EAAG,CACD,6IASFwhB,EAAM3oE,GACN,MAAO6vB,GACP84C,OAAMrqE,EAGR6vE,EAAY,YAAa,CACvB7qE,KAAM,QACN68D,MAAO,OACPx7C,EAAG,0EACH9kB,EAAG,IACHoM,EAAG,IACHuZ,EAAG,0EACHkiB,EAAG,IACHokB,KAAMA,EAAKS,OAGXuZ,KAAM;AACNmB,OAAQ,mEACRI,MAAO,CACL,CACExnE,EAAG,mCACHoM,EAAG,qCAEL,CACEpM,EAAG,oCACHoM,EAAG,qCAIPg3D,MAAM,EACN9b,EAAG,CACD,mEACA,mEACAwhB,UCzMJ,IAAI7c,GAAOlvD,GACP+nD,GAAQzmD,GACR8kD,GAASrjD,GAEb,SAASyuE,GAASzqE,QACVrH,gBAAgB8xE,IACpB,OAAO,IAAIA,GAASzqE,QACjBmoD,KAAOnoD,EAAQmoD;KACfuiB,aAAe1qE,EAAQ0qE,gBAEvBxN,OAASvkE,KAAKwvD,KAAK/G,aACnBupB,WAAa3qE,EAAQ2qE,YAAchyE,KAAKwvD,KAAK9G,kBAE7CupB,QAAU,UACVC,eAAiB,UACjBvjB,EAAI,UACJ3tD,EAAI,SAELmxE,EAAU9pB,GAAMU,QAAQ1hD,EAAQ8qE,QAAS9qE,EAAQ+qE,YAAc,OAC/DC,EAAQhqB,GAAMU,QAAQ1hD,EAAQgrE,MAAOhrE,EAAQirE,UAAY,OACzDC,EAAOlqB,GAAMU,QAAQ1hD,EAAQkrE,KAAMlrE,EAAQmrE,SAAW,OAC1D9rB,GAAOyrB,EAAQhqE,QAAWnI,KAAKgyE,WAAa,EACrC,mCAAqChyE,KAAKgyE,WAAa,cACzDpiB,MAAMuiB,EAASE,EAAOE,OAE7BE,GAAiBX,MAERnqE,UAAUioD,MAAQ,SAAcuiB,EAASE,EAAOE,OACnDG,EAAOP,EAAQvoE,OAAOyoE,GAAOzoE,OAAO2oE;MAEnC5jB,EAAI,IAAIjiD,MAAM1M,KAAKukE,OAAS,QAC5BvjE,EAAI,IAAI0L,MAAM1M,KAAKukE,OAAS,OAC5B,IAAI/6D,EAAI,EAAGA,EAAIxJ,KAAKgB,EAAEmH,OAAQqB,SAC5BmlD,EAAEnlD,GAAK,OACPxI,EAAEwI,GAAK,OAGTy/C,QAAQypB,QACRT,QAAU,OACVC,eAAiB,oBAGfvqE,UAAUgrE,MAAQ,kBAClB,IAAInjB,GAAKK,KAAK7vD,KAAKwvD,KAAMxvD,KAAK2uD,OAG9BhnD,UAAUshD,QAAU,SAAgBypB,OACvCE,EAAO5yE,KAAK2yE,QACA7pB,OAAO9oD,KAAKgB,GACZ8nD,OAAO,CAAE,IACrB4pB,IACFE,EAAOA,EAAK9pB,OAAO4pB,SAChB/jB,EAAIikB,EAAK1pB,cACTloD,EAAIhB,KAAK2yE,QAAQ7pB,OAAO9oD,KAAKgB,GAAGkoD,SAChCwpB,SAGA/jB,EAAI3uD,KAAK2yE,QACA7pB,OAAO9oD,KAAKgB,GACZ8nD,OAAO,CAAE,IACTA,OAAO4pB,GACPxpB;KACTloD,EAAIhB,KAAK2yE,QAAQ7pB,OAAO9oD,KAAKgB,GAAGkoD,cAG9BvhD,UAAUkrE,OAAS,SAAgBV,EAASC,EAAY34C,EAAKq5C,GAE1C,iBAAfV,IACTU,EAASr5C,EACTA,EAAM24C,EACNA,EAAa,MAGfD,EAAU9pB,GAAMU,QAAQopB,EAASC,GACjC34C,EAAM4uB,GAAMU,QAAQtvB,EAAKq5C,GAEzBpsB,GAAOyrB,EAAQhqE,QAAWnI,KAAKgyE,WAAa,EACrC,mCAAqChyE,KAAKgyE,WAAa,cAEzD/oB,QAAQkpB,EAAQvoE,OAAO6vB,GAAO,UAC9Bw4C,QAAU,MAGRtqE,UAAUq+C,SAAW,SAAkB1vB,EAAKgxB,EAAK7tB,EAAKq5C,MACzD9yE,KAAKiyE,QAAUjyE,KAAKkyE,eACtB,MAAM,IAAIvnD,MAAM,sBAGC,iBAAR28B,IACTwrB,EAASr5C,EACTA,EAAM6tB,EACNA,EAAM,MAIJ7tB,IACFA,EAAM4uB,GAAMU,QAAQtvB,EAAKq5C,GAAU,YAC9B7pB,QAAQxvB;SAGX5rB,EAAO,GACJA,EAAK1F,OAASmuB,QACdt1B,EAAIhB,KAAK2yE,QAAQ7pB,OAAO9oD,KAAKgB,GAAGkoD,SACrCr7C,EAAOA,EAAKjE,OAAO5J,KAAKgB,OAGtBkyB,EAAMrlB,EAAKnM,MAAM,EAAG40B,eACnB2yB,QAAQxvB,QACRw4C,UACE5pB,GAAM8c,OAAOjyC,EAAKo0B,IC7G3B,IAAIuJ,GAAKvwD,WAELomD,GADQ9kD,GACO8kD,OAEnB,SAASqsB,GAAQC,EAAI3rE,QACd2rE,GAAKA,OACLC,KAAO,UACPC,IAAM,KAGP7rE,EAAQ4rE,MACVjzE,KAAKmzE,eAAe9rE,EAAQ4rE,KAAM5rE,EAAQ+rE,SACxC/rE,EAAQ6rE,KACVlzE,KAAKqzE,cAAchsE,EAAQ6rE,IAAK7rE,EAAQisE,YAE5CtwE,GAAiB+vE,MAETQ,WAAa,SAAoBP,EAAIE,EAAK5rB,UAC5C4rB,aAAeH,GACVG,EAEF,IAAIH,GAAQC,EAAI,CACrBE,IAAKA,EACLI,OAAQhsB,QAIJksB,YAAc,SAAqBR,EAAIC,EAAM3rB,UAC/C2rB,aAAgBF,GACXE,EAEF,IAAIF,GAAQC,EAAI;AACrBC,KAAMA,EACNG,QAAS9rB,QAIL3/C,UAAU4/D,SAAW,eACvB2L,EAAMlzE,KAAKyzE,mBAEXP,EAAIzG,aACC,CAAEhjE,QAAQ,EAAO4c,OAAQ,sBAC7B6sD,EAAI3L,WAEJ2L,EAAI1hB,IAAIxxD,KAAKgzE,GAAG3L,MAAMn+C,GAAGujD,aAGvB,CAAEhjE,QAAQ,EAAM4c,OAAQ,MAFtB,CAAE5c,QAAQ,EAAO4c,OAAQ,uBAFzB,CAAE5c,QAAQ,EAAO4c,OAAQ,iCAO5B1e,UAAU8rE,UAAY,SAAmBtK,EAAS7hB,SAEjC,iBAAZ6hB,IACT7hB,EAAM6hB,EACNA,EAAU,MAGPnpE,KAAKkzE,MACRlzE,KAAKkzE,IAAMlzE,KAAKgzE,GAAGnoB,EAAE2G,IAAIxxD,KAAKizE,OAE3B3rB,EAGEtnD,KAAKkzE,IAAI/N,OAAO7d,EAAK6hB,GAFnBnpE,KAAKkzE,QAKRvrE,UAAU+rE,WAAa,SAAoBpsB;MACrC,QAARA,EACKtnD,KAAKizE,KAAKzxE,SAAS,GAAI,GAEvBxB,KAAKizE,SAGRtrE,UAAUwrE,eAAiB,SAAwBnwE,EAAKskD,QACzD2rB,KAAO,IAAIpiB,GAAG7tD,EAAKskD,GAAO,SAI1B2rB,KAAOjzE,KAAKizE,KAAKvT,KAAK1/D,KAAKgzE,GAAG3L,MAAMn+C,OAGnCvhB,UAAU0rE,cAAgB,SAAuBrwE,EAAKskD,MACxDtkD,EAAIghB,GAAKhhB,EAAIumD,QAIY,SAAvBvpD,KAAKgzE,GAAG3L,MAAMrgE,KAChB0/C,GAAO1jD,EAAIghB,EAAG,qBACkB,UAAvBhkB,KAAKgzE,GAAG3L,MAAMrgE,MACS,YAAvBhH,KAAKgzE,GAAG3L,MAAMrgE,MACvB0/C,GAAO1jD,EAAIghB,GAAKhhB,EAAIumD,EAAG,0CAEpB2pB,IAAMlzE,KAAKgzE,GAAG3L,MAAMzsD,MAAM5X,EAAIghB,EAAGhhB,EAAIumD,SAGvC2pB,IAAMlzE,KAAKgzE,GAAG3L,MAAM0B,YAAY/lE,EAAKskD;GAIpC3/C,UAAUgsE,OAAS,SAAgBT,UACrCA,EAAI3L,YACN7gB,GAAOwsB,EAAI3L,WAAY,8BAElB2L,EAAI1hB,IAAIxxD,KAAKizE,MAAM7J,WAIpBzhE,UAAUk3B,KAAO,SAAc8S,EAAK2V,EAAKjgD,UACxCrH,KAAKgzE,GAAGn0C,KAAK8S,EAAK3xC,KAAMsnD,EAAKjgD,OAG9BM,UAAUisE,OAAS,SAAgBjiC,EAAKkiC,UACvC7zE,KAAKgzE,GAAGY,OAAOjiC,EAAKkiC,EAAW7zE,UAGhC2H,UAAU8qD,QAAU,iBACnB,eAAiBzyD,KAAKizE,MAAQjzE,KAAKizE,KAAKzxE,SAAS,GAAI,IACrD,UAAYxB,KAAKkzE,KAAOlzE,KAAKkzE,IAAIzgB,WAAa,MCrHvD,IAAI5B,GAAKvwD,WAEL+nD,GAAQzmD,GACR8kD,GAAS2B,GAAM3B,OAEnB,SAASotB,GAAUzsE,EAASigD,MACtBjgD,aAAmBysE,GACrB,OAAOzsE;CAELrH,KAAK+zE,WAAW1sE,EAASigD,KAG7BZ,GAAOr/C,EAAQ4f,GAAK5f,EAAQqoB,EAAG,iCAC1BzI,EAAI,IAAI4pC,GAAGxpD,EAAQ4f,EAAG,SACtByI,EAAI,IAAImhC,GAAGxpD,EAAQqoB,EAAG,SACG1tB,IAA1BqF,EAAQ2sE,cACVh0E,KAAKg0E,cAAgB,KAErBh0E,KAAKg0E,cAAgB3sE,EAAQ2sE,mBAEjCH,GAAiBC,GAEjB,SAASG,UACFC,MAAQ,EAGf,SAASC,GAAU3tC,EAAKne,OAClB+rD,EAAU5tC,EAAIne,EAAE6rD,cACJ,IAAVE,UACGA,MAELC,EAAqB,GAAVD,KAGE,IAAbC,GAAkBA,EAAW,SACxB,UAGL5xE,EAAM,EACD+G,EAAI,EAAGsoD,EAAMzpC,EAAE6rD,MAAO1qE,EAAI6qE,EAAU7qE,IAAKsoD,IAChDrvD,IAAQ,EACRA,GAAO+jC,EAAIsrB,GACXrvD,KAAS,UAIPA,GAAO,OAIX4lB,EAAE6rD,MAAQpiB,EACHrvD,GAGT,SAAS6xE,GAAU9tC,WACbh9B,EAAI,EACJ8sB,EAAMkQ,EAAIr+B,OAAS,GACfq+B,EAAIh9B,MAAqB,IAAbg9B,EAAIh9B,EAAI,KAAcA,EAAI8sB,GAC5C9sB;QAEQ,IAANA,EACKg9B,EAEFA,EAAI9kC,MAAM8H,GA4DnB,SAAS+qE,GAAgBjuB,EAAKhwB,MACxBA,EAAM,IACRgwB,EAAIlhD,KAAKkxB,YAGPk+C,EAAS,GAAK70E,KAAKm+B,IAAIxH,GAAO32B,KAAKo+B,MAAQ,OAC/CuoB,EAAIlhD,KAAc,IAATovE,KACAA,GACPluB,EAAIlhD,KAAMkxB,KAASk+C,GAAU,GAAM,KAErCluB,EAAIlhD,KAAKkxB,OAnED3uB,UAAUosE,WAAa,SAAoBrpE,EAAM48C,GACzD58C,EAAO29C,GAAMU,QAAQr+C,EAAM48C,OACvBj/B,EAAI,IAAI4rD,MACY,KAApBvpE,EAAK2d,EAAE6rD,gBACF,MAEL59C,EAAM69C,GAAUzpE,EAAM2d,OACd,IAARiO,SACK,KAEJA,EAAMjO,EAAE6rD,QAAWxpE,EAAKvC,cACpB,KAEe,IAApBuC,EAAK2d,EAAE6rD,gBACF,MAEL9P,EAAO+P,GAAUzpE,EAAM2d,OACd,IAAT+7C,SACK,MAELn9C,EAAIvc,EAAKhJ,MAAM2mB,EAAE6rD,MAAO9P,EAAO/7C,EAAE6rD,UACrC7rD,EAAE6rD,OAAS9P,EACa,IAApB15D,EAAK2d,EAAE6rD,gBACF,MAELO,EAAON,GAAUzpE,EAAM2d,OACd,IAATosD,SACK;IAEL/pE,EAAKvC,SAAWssE,EAAOpsD,EAAE6rD,aACpB,MAELxkD,EAAIhlB,EAAKhJ,MAAM2mB,EAAE6rD,MAAOO,EAAOpsD,EAAE6rD,UACxB,IAATjtD,EAAE,GAAU,MACH,IAAPA,EAAE,WAIG,EAHPA,EAAIA,EAAEvlB,MAAM,MAMH,IAATguB,EAAE,GAAU,MACH,IAAPA,EAAE,WAIG,EAHPA,EAAIA,EAAEhuB,MAAM,eAOXulB,EAAI,IAAI4pC,GAAG5pC,QACXyI,EAAI,IAAImhC,GAAGnhC,QACXskD,cAAgB,MAEd,MAgBCrsE,UAAU+sE,MAAQ,SAAeptB,OACrCrgC,EAAIjnB,KAAKinB,EAAE8hC,UACXr5B,EAAI1vB,KAAK0vB,EAAEq5B,cAGJ,IAAP9hC,EAAE,KACJA,EAAI,CAAE,GAAIrd,OAAOqd,IAER,IAAPyI,EAAE,KACJA,EAAI,CAAE,GAAI9lB,OAAO8lB,IAEnBzI,EAAIqtD,GAAUrtD,GACdyI,EAAI4kD,GAAU5kD,KAENA,EAAE,IAAe,IAAPA,EAAE,KAClBA,EAAIA,EAAEhuB,MAAM,OAEV4kD,EAAM,CAAE,GACZiuB,GAAgBjuB,EAAKr/B,EAAE9e,SACvBm+C,EAAMA,EAAI18C,OAAOqd,IACb7hB,KAAK,GACTmvE,GAAgBjuB,EAAK52B,EAAEvnB;KACnBwsE,EAAWruB,EAAI18C,OAAO8lB,GACtBwD,EAAM,CAAE,WACZqhD,GAAgBrhD,EAAKyhD,EAASxsE,QAC9B+qB,EAAMA,EAAItpB,OAAO+qE,GACVtsB,GAAM8c,OAAOjyC,EAAKo0B,IClK3B,IAAIuJ,GAAKvwD,WACLwxE,GAAWlwE,GACXymD,GAAQhlD,GACRsuE,GAASjuE,GACTqiD,GAAOpiD,WACP+iD,GAAS2B,GAAM3B,OAEfqsB,GAAUnvE,GACVkwE,GAAYhwE,GAEhB,SAAS8wE,GAAGvtE,QACJrH,gBAAgB40E,IACpB,OAAO,IAAIA,GAAGvtE,GAGO,iBAAZA,IACTq/C,GAAOnmD,OAAOoH,UAAU9E,eAAe/B,KAAK6wE,GAAQtqE,GAClD,iBAAmBA,GAErBA,EAAUsqE,GAAOtqE,IAIfA,aAAmBsqE,GAAOC,cAC5BvqE,EAAU,CAAEggE,MAAOhgE,SAEhBggE,MAAQhgE,EAAQggE,MAAMA,WACtBn+C,EAAIlpB,KAAKqnE,MAAMn+C,OACf2rD,GAAK70E,KAAKkpB,EAAEw1C,MAAM,QAClB7T,EAAI7qD,KAAKqnE,MAAMxc,OAGfA,EAAIxjD,EAAQggE,MAAMxc,OAClBA,EAAEye,WAAWjiE,EAAQggE,MAAMn+C,EAAE8qC,YAAc;KAG3CxE,KAAOnoD,EAAQmoD,MAAQnoD,EAAQggE,MAAM7X,SAE5CwjB,GAAiB4B,GAEjBA,GAAGjtE,UAAUmtE,QAAU,SAAiBztE,UAC/B,IAAI0rE,GAAQ/yE,KAAMqH,IAG3ButE,GAAGjtE,UAAUotE,eAAiB,SAAwB9B,EAAM3rB,UACnDyrB,GAAQS,YAAYxzE,KAAMizE,EAAM3rB,IAGzCstB,GAAGjtE,UAAUqtE,cAAgB,SAAuB9B,EAAK5rB,UAChDyrB,GAAQQ,WAAWvzE,KAAMkzE,EAAK5rB,IAGvCstB,GAAGjtE,UAAUstE,WAAa,SAAoB5tE,GACvCA,IACHA,EAAU,YAGR6tE,EAAO,IAAIpD,GAAS,CACtBtiB,KAAMxvD,KAAKwvD,KACX+iB,KAAMlrE,EAAQkrE,KACdC,QAASnrE,EAAQmrE,SAAW,OAC5BL,QAAS9qE,EAAQ8qE,SAAWpsB,GAAK/lD,KAAKwvD,KAAK9G,cAC3C0pB,WAAY/qE,EAAQ8qE,SAAW9qE,EAAQ+qE,YAAc,OACrDC,MAAOryE,KAAKkpB,EAAE6/B;GAGZ1qB,EAAQr+B,KAAKkpB,EAAEoX,aACf60C,EAAMn1E,KAAKkpB,EAAEg6B,IAAI,IAAI2N,GAAG,MACnB,KACHoiB,EAAO,IAAIpiB,GAAGqkB,EAAKlvB,SAAS3nB,SAC5B40C,EAAKxhB,IAAI0jB,GAAO,UAGpBlC,EAAK5e,MAAM,GACJr0D,KAAK+0E,eAAe9B,KAI/B2B,GAAGjtE,UAAUytE,aAAe,SAAsBzjC,EAAK0jC,OACjD5U,EAA2B,EAAnB9uB,EAAIrR,aAAmBtgC,KAAKkpB,EAAE8qC,mBACtCyM,EAAQ,IACV9uB,EAAMA,EAAI+sB,MAAM+B,KACb4U,GAAa1jC,EAAI8f,IAAIzxD,KAAKkpB,IAAM,EAC5ByoB,EAAIuR,IAAIljD,KAAKkpB,GAEbyoB,GAGXijC,GAAGjtE,UAAUk3B,KAAO,SAAc8S,EAAK3uC,EAAKskD,EAAKjgD,GAC5B,WAAf8kB,EAAOm7B,KACTjgD,EAAUigD,EACVA,EAAM,MAEHjgD,IACHA,EAAU,IAEZrE,EAAMhD,KAAK+0E,eAAe/xE,EAAKskD,GAC/B3V,EAAM3xC,KAAKo1E,aAAa,IAAIvkB,GAAGlf,EAAK;SAGhCtT,EAAQr+B,KAAKkpB,EAAEoX,aACfg1C,EAAOtyE,EAAI0wE,aAAa3qB,QAAQ,KAAM1qB,GAGtCg0C,EAAQ1gC,EAAIoX,QAAQ,KAAM1qB,GAG1B62C,EAAO,IAAIpD,GAAS,CACtBtiB,KAAMxvD,KAAKwvD,KACX2iB,QAASmD,EACTjD,MAAOA,EACPE,KAAMlrE,EAAQkrE,KACdC,QAASnrE,EAAQmrE,SAAW,SAI1B+C,EAAMv1E,KAAKkpB,EAAEg6B,IAAI,IAAI2N,GAAG,IAEnB/iC,EAAO,GAAKA,IAAQ,KACvB3E,EAAI9hB,EAAQ8hB,EACd9hB,EAAQ8hB,EAAE2E,GACV,IAAI+iC,GAAGqkB,EAAKlvB,SAAShmD,KAAKkpB,EAAEoX,qBAC9BnX,EAAInpB,KAAKo1E,aAAajsD,GAAG,IACnBu3C,KAAK,IAAM,GAAKv3C,EAAEsoC,IAAI8jB,IAAQ,QAGhCC,EAAKx1E,KAAK6qD,EAAE2G,IAAIroC,OAChBqsD,EAAG/I,kBAGHgJ,EAAMD,EAAGpM,OACTniD,EAAIwuD,EAAI/V,KAAK1/D,KAAKkpB,MACJ,IAAdjC,EAAEy5C,KAAK,QAGPhxC,EAAIvG,EAAEw3C,KAAK3gE,KAAKkpB,GAAGsoC,IAAIvqC,EAAEuqC,IAAIxuD,EAAI0wE,cAAc7d,KAAKlkB,OAEtC,KADlBjiB,EAAIA,EAAEgwC,KAAK1/D,KAAKkpB,IACVw3C,KAAK;IAGPsT,GAAiBwB,EAAGnM,OAAOjJ,QAAU,EAAI,IACT,IAAfqV,EAAIhkB,IAAIxqC,GAAW,EAAI,UAGxC5f,EAAQquE,WAAahmD,EAAE+hC,IAAIzxD,KAAK60E,IAAM,IACxCnlD,EAAI1vB,KAAKkpB,EAAEg6B,IAAIxzB,GACfskD,GAAiB,GAGZ,IAAIF,GAAU,CAAE7sD,EAAGA,EAAGyI,EAAGA,EAAGskD,cAAeA,UAItDY,GAAGjtE,UAAUisE,OAAS,SAAgBjiC,EAAKkiC,EAAW7wE,EAAKskD,GACzD3V,EAAM3xC,KAAKo1E,aAAa,IAAIvkB,GAAGlf,EAAK,KACpC3uC,EAAMhD,KAAKg1E,cAAchyE,EAAKskD,OAI1BrgC,GAHJ4sD,EAAY,IAAIC,GAAUD,EAAW,QAGnB5sD,EACdyI,EAAImkD,EAAUnkD,KACdzI,EAAEy5C,KAAK,GAAK,GAAKz5C,EAAEwqC,IAAIzxD,KAAKkpB,IAAM,EACpC,OAAO,KACLwG,EAAEgxC,KAAK,GAAK,GAAKhxC,EAAE+hC,IAAIzxD,KAAKkpB,IAAM,EACpC,OAAO,MAMLb,EAHAstD,EAAOjmD,EAAEixC,KAAK3gE,KAAKkpB,GACnB68C,EAAK4P,EAAKnkB,IAAI7f,GAAK+tB,KAAK1/D,KAAKkpB,GAC7B88C,EAAK2P,EAAKnkB,IAAIvqC,GAAGy4C,KAAK1/D,KAAKkpB;QAG1BlpB,KAAKqnE,MAAMF,gBAWhB9+C,EAAIroB,KAAK6qD,EAAEkiB,QAAQhH,EAAI/iE,EAAIywE,YAAazN,IAClCyG,cAMCpkD,EAAEwnD,OAAO5oD,KAjBdoB,EAAIroB,KAAK6qD,EAAEiiB,OAAO/G,EAAI/iE,EAAIywE,YAAazN,IACjCyG,cAGkC,IAAjCpkD,EAAE+gD,OAAO1J,KAAK1/D,KAAKkpB,GAAGuoC,IAAIxqC,IAgBrC2tD,GAAGjtE,UAAUiuE,cAAgB,SAASjkC,EAAKkiC,EAAWx+C,EAAGiyB,GACvDZ,IAAQ,EAAIrxB,KAAOA,EAAG,4CACtBw+C,EAAY,IAAIC,GAAUD,EAAWvsB,OAEjCp+B,EAAIlpB,KAAKkpB,EACTqK,EAAI,IAAIs9B,GAAGlf,GACX1qB,EAAI4sD,EAAU5sD,EACdyI,EAAImkD,EAAUnkD,EAGdmmD,EAAa,EAAJxgD,EACTygD,EAAczgD,GAAK,KACnBpO,EAAEwqC,IAAIzxD,KAAKqnE,MAAMh/C,EAAEq3C,KAAK1/D,KAAKqnE,MAAMn+C,KAAO,GAAK4sD,EACjD,MAAM,IAAInrD,MAAM;CAIhB1D,EADE6uD,EACE91E,KAAKqnE,MAAM2B,WAAW/hD,EAAEwS,IAAIz5B,KAAKqnE,MAAMn+C,GAAI2sD,GAE3C71E,KAAKqnE,MAAM2B,WAAW/hD,EAAG4uD,OAE3BE,EAAOlC,EAAU5sD,EAAE05C,KAAKz3C,GACxBslB,EAAKtlB,EAAEg6B,IAAI3vB,GAAGi+B,IAAIukB,GAAMrW,KAAKx2C,GAC7BulB,EAAK/e,EAAE8hC,IAAIukB,GAAMrW,KAAKx2C,UAInBlpB,KAAK6qD,EAAEiiB,OAAOt+B,EAAIvnB,EAAGwnB,IAG9BmmC,GAAGjtE,UAAUquE,oBAAsB,SAASziD,EAAGsgD,EAAWoC,EAAG3uB,MAE3B,QADhCusB,EAAY,IAAIC,GAAUD,EAAWvsB,IACvB0sB,cACZ,OAAOH,EAAUG,kBAEd,IAAIxqE,EAAI,EAAGA,EAAI,EAAGA,IAAK,KACtB0sE,MAEFA,EAASl2E,KAAK41E,cAAcriD,EAAGsgD,EAAWrqE,GAC1C,MAAO+pB,eAIL2iD,EAAO3U,GAAG0U,GACZ,OAAOzsE,QAEL,IAAImhB,MAAM,yCC/OlB,IAAI09B,GAAQ/nD,GACRomD,GAAS2B,GAAM3B,OACf2f,GAAahe,GAAMge,WACnBF,GAAiB9d,GAAM8d;CAW3B,SAAS4M,GAAQoD,EAAOC,QACjBD,MAAQA,OACRE,QAAUhQ,GAAW+P,EAAOE,QAC7BH,EAAMI,QAAQH,EAAOlD,KACvBlzE,KAAKw2E,KAAOJ,EAAOlD,IAEnBlzE,KAAKy2E,UAAYpQ,GAAW+P,EAAOlD,QAG/BK,WAAa,SAAoB4C,EAAOjD,UAC1CA,aAAeH,GACVG,EACF,IAAIH,GAAQoD,EAAO,CAAEjD,IAAKA,QAG3BwD,WAAa,SAAoBP,EAAOG,UAC1CA,aAAkBvD,GACbuD,EACF,IAAIvD,GAAQoD,EAAO,CAAEG,OAAQA,QAG9B3uE,UAAU2uE,OAAS,kBAClBt2E,KAAKq2E,YAGCtD,GAAS,YAAY,kBAC3B/yE,KAAKm2E,MAAMQ,YAAY32E,KAAKkzE,aAGtBH,GAAS,OAAO;OACzB/yE,KAAKy2E,UACAz2E,KAAKm2E,MAAMpN,YAAY/oE,KAAKy2E,WAC9Bz2E,KAAKm2E,MAAMtrB,EAAE2G,IAAIxxD,KAAKizE,cAGhBF,GAAS,aAAa,eAC/BoD,EAAQn2E,KAAKm2E,MACb3mB,EAAOxvD,KAAKwvD,OACZonB,EAAST,EAAMU,eAAiB,EAEhCtzE,EAAIisD,EAAK9tD,MAAM,EAAGy0E,EAAMU,uBAC5BtzE,EAAE,IAAM,IACRA,EAAEqzE,IAAW,IACbrzE,EAAEqzE,IAAW,GAENrzE,QAGMwvE,GAAS,QAAQ,kBACvB/yE,KAAKm2E,MAAMW,UAAU92E,KAAK+2E,mBAGpBhE,GAAS,QAAQ,kBACvB/yE,KAAKm2E,MAAM3mB,OAAO1G,OAAO9oD,KAAKs2E,UAAUptB,eAGlC6pB,GAAS,iBAAiB,kBAChC/yE,KAAKwvD,OAAO9tD,MAAM1B,KAAKm2E,MAAMU;GAG9BlvE,UAAUk3B,KAAO,SAAcm4C,UACrCtwB,GAAO1mD,KAAKq2E,QAAS,2BACdr2E,KAAKm2E,MAAMt3C,KAAKm4C,EAASh3E,UAG1B2H,UAAUisE,OAAS,SAAgBoD,EAASC,UAC3Cj3E,KAAKm2E,MAAMvC,OAAOoD,EAASC,EAAKj3E,UAGjC2H,UAAUuvE,UAAY,SAAmB5vB,UAC/CZ,GAAO1mD,KAAKq2E,QAAS,0BACdhuB,GAAM8c,OAAOnlE,KAAKs2E,SAAUhvB,OAG7B3/C,UAAU8rE,UAAY,SAAmBnsB,UACxCe,GAAM8c,OAAOnlE,KAAKm3E,WAAY7vB,QAGvCtkD,GAAiB+vE,GC5FbliB,GAAKvwD,WACL+nD,GAAQzmD,GACR8kD,GAAS2B,GAAM3B,OACfyf,GAAiB9d,GAAM8d,eACvBE,GAAahe,GAAMge,WAUvB,SAASyN,GAAUqC,EAAOc,QACnBd,MAAQA,EAEM,WAAfhqD,EAAO8qD,KACTA,EAAM5Q,GAAW4Q;AAEfvqE,MAAMD,QAAQwqE,KAChBA,EAAM,CACJ7uD,EAAG6uD,EAAIv1E,MAAM,EAAGy0E,EAAMU,gBACtBz8D,EAAG68D,EAAIv1E,MAAMy0E,EAAMU,kBAIvBnwB,GAAOuwB,EAAI7uD,GAAK6uD,EAAI78D,EAAG,4BAEnB+7D,EAAMI,QAAQU,EAAI7uD,KACpBpoB,KAAKo3E,GAAKH,EAAI7uD,GACZ6uD,EAAI78D,aAAay2C,KACnB7wD,KAAKq3E,GAAKJ,EAAI78D,QAEXk9D,UAAY5qE,MAAMD,QAAQwqE,EAAI7uD,GAAK6uD,EAAI7uD,EAAI6uD,EAAIM,cAC/CC,UAAY9qE,MAAMD,QAAQwqE,EAAI78D,GAAK68D,EAAI78D,EAAI68D,EAAIQ,SAGtDtR,GAAe2N,GAAW,KAAK,kBACtB9zE,KAAKm2E,MAAMW,UAAU92E,KAAKy3E,eAGnCtR,GAAe2N,GAAW,KAAK,kBACtB9zE,KAAKm2E,MAAMpN,YAAY/oE,KAAKu3E,eAGrCpR,GAAe2N,GAAW,YAAY,kBAC7B9zE,KAAKm2E,MAAMQ,YAAY32E,KAAKooB;AAGrC+9C,GAAe2N,GAAW,YAAY,kBAC7B9zE,KAAKm2E,MAAMuB,UAAU13E,KAAKoa,WAGzBzS,UAAUgwE,QAAU,kBACrB33E,KAAKu3E,WAAW3tE,OAAO5J,KAAKy3E,gBAG3B9vE,UAAUu9D,MAAQ,kBACnB7c,GAAM8c,OAAOnlE,KAAK23E,UAAW,OAAOC,mBAG7C/D,GAAiBC,GC9DbtkB,GAAOlvD,GACPqxE,GAAS/vE,GACTymD,GAAQhlD,GACRqjD,GAAS2B,GAAM3B,OACf2f,GAAahe,GAAMge,WACnB0M,GAAUrvE,GACVowE,GAAYnwE,GAEhB,SAASk0E,GAAMxQ,MACb3gB,GAAiB,YAAV2gB,EAAqB,qCAEtBrnE,gBAAgB63E,IACpB,OAAO,IAAIA,GAAMxQ,GAEnBA,EAAQsK,GAAOtK,GAAOA,WACjBA,MAAQA,OACRxc,EAAIwc,EAAMxc,OACVA,EAAEye,WAAWjC,EAAMn+C,EAAE8qC,YAAc;KAEnC8jB,WAAazQ,EAAMzsD,QAAQ1K,iBAC3B2mE,eAAiBl3E,KAAKyI,KAAKi/D,EAAMn+C,EAAE8qC,YAAc,QACjDxE,KAAOA,GAAKY,WAGnB+lB,GAAiB0B,GAOjBA,GAAMlwE,UAAUk3B,KAAO,SAAcm4C,EAASV,GAC5CU,EAAU3Q,GAAW2Q,OACjBh0E,EAAMhD,KAAK+3E,cAAczB,GACzBrvD,EAAIjnB,KAAKg4E,QAAQh1E,EAAIi1E,gBAAiBjB,GACtC5uD,EAAIpoB,KAAK6qD,EAAE2G,IAAIvqC,GACfswD,EAAWv3E,KAAK22E,YAAYvuD,GAC5B8vD,EAAKl4E,KAAKg4E,QAAQT,EAAUv0E,EAAIm0E,WAAYH,GAC7CxlB,IAAIxuD,EAAIiwE,QACP74D,EAAI6M,EAAEwS,IAAIy+C,GAAIxY,KAAK1/D,KAAKqnE,MAAMn+C,UAC3BlpB,KAAKm4E,cAAc,CAAE/vD,EAAGA,EAAGhO,EAAGA,EAAGm9D,SAAUA,KASpDM,GAAMlwE,UAAUisE,OAAS,SAAgBoD,EAASC,EAAK/D,GACrD8D,EAAU3Q,GAAW2Q,GACrBC,EAAMj3E,KAAKm4E,cAAclB;KACrBj0E,EAAMhD,KAAKg1E,cAAc9B,GACzB9nC,EAAIprC,KAAKg4E,QAAQf,EAAIM,WAAYv0E,EAAIm0E,WAAYH,GACjDoB,EAAKp4E,KAAK6qD,EAAE2G,IAAIylB,EAAI78D,YACV68D,EAAI7uD,IAAIqR,IAAIz2B,EAAIkwE,MAAM1hB,IAAIpmB,IACzBm2B,GAAG6W,IAGpBP,GAAMlwE,UAAUqwE,QAAU,mBACpBxoB,EAAOxvD,KAAKwvD,OACPhmD,EAAI,EAAGA,EAAItB,UAAUC,OAAQqB,IACpCgmD,EAAK1G,OAAO5gD,UAAUsB,WACjB6+C,GAAMie,UAAU9W,EAAKtG,UAAUwW,KAAK1/D,KAAKqnE,MAAMn+C,IAGxD2uD,GAAMlwE,UAAUqtE,cAAgB,SAAuB9B,UAC9CH,GAAQQ,WAAWvzE,KAAMkzE,IAGlC2E,GAAMlwE,UAAUowE,cAAgB,SAAuBzB,UAC9CvD,GAAQ2D,WAAW12E,KAAMs2E,IAGlCuB,GAAMlwE,UAAUwwE,cAAgB,SAAuBlB;OACjDA,aAAenD,GACVmD,EACF,IAAInD,GAAU9zE,KAAMi3E,IAW7BY,GAAMlwE,UAAUgvE,YAAc,SAAqB/7D,OAC7C0sC,EAAM1sC,EAAMyuD,OAAOtgB,QAAQ,KAAM/oD,KAAK62E,uBAC1CvvB,EAAItnD,KAAK62E,eAAiB,IAAMj8D,EAAMwuD,OAAOhJ,QAAU,IAAO,EACvD9Y,GAGTuwB,GAAMlwE,UAAUohE,YAAc,SAAqB1qC,OAG7Cu4C,GAFJv4C,EAAQgqB,GAAMge,WAAWhoC,IAENl2B,OAAS,EACxBkwE,EAASh6C,EAAM38B,MAAM,EAAGk1E,GAAQhtE,QAAuB,IAAhBy0B,EAAMu4C,IAC7C0B,EAAoC,IAAV,IAAhBj6C,EAAMu4C,IAEhBrtB,EAAIlB,GAAMie,UAAU+R,UACjBr4E,KAAKqnE,MAAM8J,WAAW5nB,EAAG+uB,IAGlCT,GAAMlwE,UAAU+vE,UAAY,SAAmBtvB,UACtCA,EAAIW,QAAQ,KAAM/oD,KAAK62E,iBAGhCgB,GAAMlwE,UAAUmvE,UAAY,SAAmBz4C,UACtCgqB,GAAMie,UAAUjoC;AAGzBw5C,GAAMlwE,UAAU4uE,QAAU,SAAiB9zE,UAClCA,aAAezC,KAAK83E,4BClHzBS,EAAWjvD,EAEfivD,EAASlzE,QAAU/E,GACnBi4E,EAASlwB,MAAQzmD,GACjB22E,EAASxyB,KAAO1iD,WAChBk1E,EAASlR,MAAQ3jE,GACjB60E,EAAS5G,OAAShuE,GAGlB40E,EAASvF,GAAKpvE,GACd20E,EAASpC,MAAQryE,QCXjB,IAAIN,GAAclD,EACdJ,GAAQ0B,EACRgL,GAAavJ,GACb4G,GAA8BvG,GAC9BD,GAA6BE,EAC7BhB,GAAWiB,EACX1B,GAAgB4B,EAGhB00E,GAAUj4E,OAAOk4E,OAEjBj4E,GAAiBD,OAAOC,eAI5Bk4E,IAAkBF,IAAWt4E,IAAM,WAEjC,GAAIsD,IAQiB,IARFg1E,GAAQ,CAAE7oE,EAAG,GAAK6oE,GAAQh4E,GAAe,GAAI,IAAK,CACnEU,YAAY,EACZT,IAAK,WACHD,GAAeR,KAAM,IAAK,CACxBqB,MAAO,EACPH,YAAY,OAGd,CAAEyO,EAAG,KAAMA,EAAS,OAAO,EAE/B,IAAI2jB,EAAI,GACJu7B,EAAI,GAEJxiD,EAASC,SACTqsE,EAAW,uBAGf,OAFArlD,EAAEjnB,GAAU;AACZssE,EAAS92E,MAAM,IAAIkP,SAAQ,SAAU6nE,GAAO/pB,EAAE+pB,GAAOA,KACpB,GAA1BJ,GAAQ,GAAIllD,GAAGjnB,IAAgBO,GAAW4rE,GAAQ,GAAI3pB,IAAInnD,KAAK,KAAOixE,KAC1E,SAAgBtuE,EAAQ5C,GAM3B,IALA,IAAI2nD,EAAIzsD,GAAS0H,GACb6wB,EAAkBhzB,UAAUC,OAC5BS,EAAQ,EACRkB,EAAwBG,GAA4B/F,EACpDvD,EAAuB8C,GAA2BS,EAC/Cg3B,EAAkBtyB,GAMvB,IALA,IAII5F,EAJAoX,EAAIlY,GAAcgG,UAAUU,MAC5B9C,EAAOgE,EAAwB8C,GAAWwN,GAAGxQ,OAAOE,EAAsBsQ,IAAMxN,GAAWwN,GAC3FjS,EAASrC,EAAKqC,OACdktB,EAAI,EAEDltB,EAASktB,GACdryB,EAAM8C,EAAKuvB,KACN7xB,KAAe7C,EAAqBG,KAAKsZ,EAAGpX,KAAMosD,EAAEpsD,GAAOoX,EAAEpX,IAEpE,OAAOosD,GACPopB,GCpDAC,GAAS72E,GADLtB,GAMN,CAAE+J,OAAQ,SAAUoB,MAAM,EAAMC,OAAQnL,OAAOk4E,SAAWA,IAAU,CACpEA,OAAQA,KCPV,IAAIlnE,GAAIjR,GACJJ,GAAQ0B,EACRO,GAAkBkB,EAClB0Q,GAAiCrQ,EAA2DQ,EAC5FV,GAAcG,EAEdk1E,GAAsB34E,IAAM,WAAc6T,GAA+B,MCgDtE,SAAS+kE,GAAWC,EAAY1uE,EAAQrH,EAAKsT;IAC2EkxC,EAAvH53C,EAAI1H,UAAUC,OAAQ8e,EAAIrX,EAAI,EAAIvF,EAAkB,OAATiM,EAAgBA,EAAO/V,OAAOK,yBAAyByJ,EAAQrH,GAAOsT,KAC9F,gCAAZ0iE,sBAAAA,WAAoD,mBAArBA,QAAQC,SAAyBhyD,EAAI+xD,QAAQC,SAASF,EAAY1uE,EAAQrH,EAAKsT,QACpH,IAAK,IAAI9M,EAAIuvE,EAAW5wE,OAAS,EAAGqB,GAAK,EAAGA,KAASg+C,EAAIuxB,EAAWvvE,MAAIyd,GAAKrX,EAAI,EAAI43C,EAAEvgC,GAAKrX,EAAI,EAAI43C,EAAEn9C,EAAQrH,EAAKikB,GAAKugC,EAAEn9C,EAAQrH,KAASikB,UACzIrX,EAAI,GAAKqX,GAAK1mB,OAAOC,eAAe6J,EAAQrH,EAAKikB,GAAIA,WCvDhDiyD,GAAY31E,EAAsBoM,OACxC2mB,EAAM/yB,EAAE4E,UACVmuB,IAAQ3mB,EAAExH,cACH,MAEN,IAAIqB,EAAI,EAAGA,EAAI8sB,EAAK9sB,OACjBjG,EAAEiG,KAAOmG,EAAEnG,UACJ,SAGR,KFFT,CAAEa,OAAQ,SAAUoB,MAAM,EAAMC,QAJpBlI,IAAeq1E;AAIqBltE,MAAOnI,IAAe,CACtE5C,yBAA0B,SAAkClB,EAAIsD,GAC9D,OAAO+Q,GAA+B5R,GAAgBzC,GAAKsD,MEgB/D,IAAMm2E,GAAiE,GACvE,SAASC,KACLD,GAAU7xB,IAAM,IAAI56C,MAAc,KAClCysE,GAAUE,IAAM,OACX,IAAI7vE,EAAI,EAAGA,GAAK,MAAQA,EAAG,KACtBmG,EAAInG,EAAEhI,SAAS,IAAIyhD,SAAS,EAAG,KACrCk2B,GAAU7xB,IAAI99C,GAAKmG,EACnBwpE,GAAUE,IAAI1pE,GAAKnG,YAIX8vE,GAAW3wD,GAClBwwD,GAAU7xB,KACX8xB,aAEE9iD,EAAM3N,EAAMxgB,OACZoxE,EAAK,IAAI7sE,MAAc4pB,GACpB9sB,EAAI,EAAGA,EAAI8sB,IAAO9sB,EACvB+vE,EAAG/vE,GAAK2vE,GAAU7xB,IAAK3+B,EAAMnf,WAE1B+vE,EAAG7xE,KAAK,aAGH8xE,GAAWh0B,MAClB2zB,GAAUE,KACXD,KAEe,iBAAR5zB,QACD,IAAI76B,MAAM,4CAEhB66B,EAAIr9C,OAAS,QACP,IAAIwiB,MAAM;SAGd2L,GADNkvB,EAAMA,EAAIx6C,eACM7C,OAAS,EACnBsB,EAAS,IAAI0yB,WAAW7F,GACrB9sB,EAAI,EAAGA,EAAI8sB,EAAK9sB,IAAK,KACpBmG,EAAIwpE,GAAUE,IAAK7zB,EAAQ,EAAJh8C,GAASg8C,EAAQ,EAAJh8C,EAAQ,YACxCxH,IAAN2N,QACM,IAAIgb,MAAM,uBAEpBlhB,EAAOD,GAAKmG,SAETlG,WAIKgwE,GAAatxE,UAClB49C,GAAK59C,GAIhB,IAAIuxE,IAAU,WAGEC,GACZl1E,EACAm1E,MAEIn1E,aAAkBm1E,SACX,KAEG,MAAVn1E,GAAoC,WAAlB0nB,EAAO1nB,UAClB,MAILo1E,EAAYD,EAAS,aAAmBA,EAAS,YAClDC,SACM,UAEPC,EAAgBr1E,EAAOyL,YACvB6pE,GAAkB,EACfD,IAAkBC,GAAiB,KAChCC,EAAoBF,EAAa,aAAmBA,EAAa,YAClEE,QAGLD,EAAkBF,GAAaG,EAC/BF,EAAgBv5E,OAAO8W,eAAeyiE;OAEtCC,IAAoBL,KAEpBv1D,QAAQ81D,0CAC0BJ,sGAElCH,IAAU,GAEPK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mYArG0Bx2E,EAA4BoM,OACvD2mB,EAAM/yB,EAAE4E,UACVmuB,IAAQ3mB,EAAExH,cACH,MAEN,IAAIqB,EAAI,EAAGA,EAAI8sB,EAAK9sB,QAChBjG,EAAEiG,GAAG0wE,OAAOvqE,EAAEnG,WACR,SAGR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mMCnBX,iDAFM2wE,GAAc,iEACdC,GAAS,IAAIj+C,WAAW,KACrB3yB,GAAI,EAAGA,GAAI,GAAIA,KACpB4wE,GAAOD,GAAY5/D,WAAW/Q,KAAMA,YAMxB0/D,GAAOx+D;QAOfnH,EACAoM,EACAC,EACA43C,EACApP,EAXiCiiC,6DAC/B/5C,EAAa51B,EAAK41B,WAClBg6C,EAAgBh6C,EAAa,EAC7Bi6C,EAAaj6C,EAAag6C,EAC1BE,EAAUL,IAAeE,EAAU,KAAO,MAC1CI,EAAkB,GASfC,EAAI,EAAGA,EAAIH,EAAYG,GAAK,EAKjCn3E,GAAa,UAHb60C,EAAS1tC,EAAKgwE,IAAM,GAAOhwE,EAAKgwE,EAAI,IAAM,EAAKhwE,EAAKgwE,EAAI,MAG9B,GAC1B/qE,GAAa,OAARyoC,IAAmB,GACxBxoC,GAAa,KAARwoC,IAAiB,EACtBoP,EAAY,GAARpP,EAGJqiC,EAAMr1E,KAAKo1E,EAAQj3E,GAAKi3E,EAAQ7qE,GAAK6qE,EAAQ5qE,GAAK4qE,EAAQhzB,WAIxC,IAAlB8yB,GAGA/2E,GAAa,KAFb60C,EAAQ1tC,EAAK6vE,MAEQ,EAGrB5qE,GAAa,EAARyoC,IAAc,EAEnBqiC,EAAMr1E,KAAKo1E,EAAQj3E,GAAKi3E,EAAQ7qE,KACP,IAAlB2qE,IAGP/2E,GAAa,OAFb60C,EAAS1tC,EAAK6vE,IAAe,EAAK7vE,EAAK6vE,EAAa,MAE7B,GACvB5qE,GAAa,KAARyoC,IAAiB,EAGtBxoC,GAAa,GAARwoC,IAAe,EAEpBqiC,EAAMr1E,KAAKo1E,EAAQj3E,GAAKi3E,EAAQ7qE,GAAK6qE,EAAQ5qE,KAG1C6qE,EAAM/yE,KAAK,aAGNizE,GAAOr4E;QAIfiB,EACAoM,EACAC,EACA43C,EANElnB,EAA4B,IAAfh+B,EAAM6F,OACnBuC,EAAO,IAAIyxB,WAAWmE,GAMxBjY,EAAI,EAECuyD,EAAI,EAAGA,EAAIt4E,EAAM6F,OAAQyyE,GAAK,EACnCr3E,EAAI62E,GAAO93E,EAAMiY,WAAWqgE,IAC5BjrE,EAAIyqE,GAAO93E,EAAMiY,WAAWqgE,EAAI,IAChChrE,EAAIwqE,GAAO93E,EAAMiY,WAAWqgE,EAAI,IAChCpzB,EAAI4yB,GAAO93E,EAAMiY,WAAWqgE,EAAI,IAEhClwE,EAAK2d,KAAQ9kB,GAAK,EAAMoM,GAAK,EAC7BjF,EAAK2d,MAAa,GAAJ1Y,IAAW,EAAMC,GAAK,EACpClF,EAAK2d,MAAa,EAAJzY,IAAU,EAAU,GAAJ43C,SAG3B98C,EA7EX0vE,GAAO,IAAMA,GAAO,IAAM,GAC1BA,GAAO,IAAMA,GAAO,IAAM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;gXCZ1B,IAAI7oE,GAAIjR,GACJJ,GAAQ0B,EACRiI,GAAsBxG,GAA+Da,KAOvF,CAAEmG,OAAQ,SAAUoB,MAAM,EAAMC,OAJRxL,IAAM,WAAc,OAAQK,OAAOsJ,oBAAoB,OAIhB;AAC/DA,oBAAqBA,KCVvB,IAAI3J,GAAQI,EAIRkX,GAHkB5V,GAGS,YAE/Bi5E,IAAkB36E,IAAM,WACtB,IAAI8zB,EAAM,IAAI2xB,IAAI,gBAAiB,YAC/Bm1B,EAAe9mD,EAAI8mD,aACnBrxE,EAAS,GAMb,OALAuqB,EAAI+mD,SAAW,QACfD,EAAa/pE,SAAQ,SAAU1P,EAAO2B,GACpC83E,EAAqB,OAAE,KACvBrxE,GAAUzG,EAAM3B;CAGZy5E,EAAal1C,MACD,2BAAb5R,EAAIgnD,MACsB,MAA1BF,EAAar6E,IAAI,MACuB,QAAxC2D,OAAO,IAAI62E,gBAAgB,WAC1BH,EAAatjE,KAEsB,MAApC,IAAImuC,IAAI,eAAeu1B,UACsC,MAA7D,IAAID,gBAAgB,IAAIA,gBAAgB,QAAQx6E,IAAI,MAEpB,eAAhC,IAAIklD,IAAI,eAAezkC,MAEQ,YAA/B,IAAIykC,IAAI,cAAc6J,MAEX,SAAX/lD,GAEwC,MAAxC,IAAIk8C,IAAI,gBAAY3jD,GAAWkf;IC7BlCi6D,GAAS,WASTC,GAAgB,eAChBC,GAAkB,yBAClBC,GAAiB,kDAEjBjzE,GAAQ1I,KAAK0I,MACbkzE,GAAqBn3E,OAAOk0C,aAoC5BkjC,GAAe,SAAUC,GAG3B,OAAOA,EAAQ,GAAK,IAAMA,EAAQ,KAOhCC,GAAQ,SAAUjb,EAAOkb,EAAWC,GACtC,IAAIzyD,EAAI,EAGR,IAFAs3C,EAAQmb,EAAYvzE,GAAMo4D,EAzDjB,KAyDiCA,GAAS,EACnDA,GAASp4D,GAAMo4D,EAAQkb,GAChBlb,EAAQob,IAA2B1yD,GA/DjC,GAgEPs3C,EAAQp4D,GAAMo4D,EArDEn1B,IAuDlB,OAAOjjC,GAAM8gB,EAAI,GAAsBs3C,GAASA,EA/DvC,MAuEP0E,GAAS,SAAU7iE,GACrB,IAYIkH,EAAGsyE,EAZHhpD,EAAS,GAMTipD,GAHJz5E,EAxDe,SAAUwI,GAIzB,IAHA,IAAIgoB,EAAS,GACTtS,EAAU,EACVrY,EAAS2C,EAAO3C,OACbqY,EAAUrY,GAAQ,CACvB,IAAI9G,EAAQyJ,EAAOyP,WAAWiG,KAC9B,GAAInf,GAAS,OAAUA,GAAS,OAAUmf,EAAUrY,EAAQ,CAE1D,IAAI0iC,EAAQ//B,EAAOyP,WAAWiG;CACN,QAAX,MAARqqB,GACH/X,EAAO1tB,OAAe,KAAR/D,IAAkB,KAAe,KAARwpC,GAAiB,QAIxD/X,EAAO1tB,KAAK/D,GACZmf,UAGFsS,EAAO1tB,KAAK/D,GAGhB,OAAOyxB,EAmCCkpD,CAAW15E,IAGK6F,OAGpB+gB,EA9ES,IA+ETu3C,EAAQ,EACRwb,EAjFY,GAqFhB,IAAKzyE,EAAI,EAAGA,EAAIlH,EAAM6F,OAAQqB,KAC5BsyE,EAAex5E,EAAMkH,IACF,KACjBspB,EAAO1tB,KAAKm2E,GAAmBO,IAInC,IAAII,EAAcppD,EAAO3qB,OACrBg0E,EAAiBD,EAQrB,IALIA,GACFppD,EAAO1tB,KA/FK,KAmGP+2E,EAAiBJ,GAAa,CAEnC,IAAIvnD,EAAI2mD,GACR,IAAK3xE,EAAI,EAAGA,EAAIlH,EAAM6F,OAAQqB,KAC5BsyE,EAAex5E,EAAMkH,KACD0f,GAAK4yD,EAAetnD,IACtCA,EAAIsnD,GAKR,IAAIM,EAAwBD,EAAiB,EAC7C,GAAI3nD,EAAItL,EAAI7gB,IAAO8yE,GAAS1a,GAAS2b,GACnC,MAAMz+C,WAAW29C,IAMnB,IAHA7a,IAAUjsC,EAAItL,GAAKkzD,EACnBlzD,EAAIsL,EAEChrB,EAAI,EAAGA,EAAIlH,EAAM6F,OAAQqB,IAAK,CAEjC,IADAsyE,EAAex5E,EAAMkH,IACF0f,KAAOu3C,EAAQ0a,GAChC,MAAMx9C,WAAW29C,IAEnB,GAAIQ,GAAgB5yD,EAAG,CAGrB,IADA,IAAImK,EAAIotC,EACCt3C,EArIN,IAqIoCA,GArIpC,GAqI+C,CAChD,IAAI4lB,EAAI5lB,GAAK8yD,EArIZ,EAqI2B9yD,GAAK8yD,EApIhC,GAAA,GAoIqD9yD,EAAI8yD,EAC1D,GAAI5oD,EAAI0b,EAAG,MACX,IAAIstC,EAAUhpD,EAAI0b,EACdutC,EAzIH,GAyIuBvtC;CACxBjc,EAAO1tB,KAAKm2E,GAAmBC,GAAazsC,EAAIstC,EAAUC,KAC1DjpD,EAAIhrB,GAAMg0E,EAAUC,GAGtBxpD,EAAO1tB,KAAKm2E,GAAmBC,GAAanoD,KAC5C4oD,EAAOP,GAAMjb,EAAO2b,EAAuBD,GAAkBD,GAC7Dzb,EAAQ,IACN0b,KAIJ1b,IACAv3C,EAEJ,OAAO4J,EAAOprB,KAAK,KC3JjBvD,GAAW7D,GACX2d,GAAoBrc,GCEpB2P,GAAIjR,GACJyH,GAAanG,GACb26E,GAAiBl5E,GACjB6H,GAAWxH,WACXia,GAAcha,GACd4L,GAAiB3L,GACjBiU,GAA4B/T,GAC5BqP,GAAsBhN,GACtB4X,GAAavM,GACbzO,GAAS0O,GACTtB,GAAOuB,GACP/P,GAAUgQ,GACVxN,GAAWyN,GACXxP,GAAWyP,EACXrD,GAASsD,GACT3Q,GAA2B4Q,EAC3ByqE,GDhBa,SAAU98E,GACzB,IAAI4tB,EAAiBrP,GAAkBve,GACvC,GAA6B,mBAAlB4tB,EACT,MAAMrrB,UAAUmC,OAAO1E,GAAM,oBAC7B,OAAOyE,GAASmpB,EAAexsB,KAAKpB;ECapCue,GAAoB/L,GACpBjD,GAAkBkD,GAElBsqE,GAAS10E,GAAW,SACpB20E,GAAU30E,GAAW,WACrByP,GAAWvI,GAAgB,YAC3B0tE,GAAoB,kBACpBC,GAA6BD,0BAC7BhpE,GAAmBR,GAAoB3N,IACvCq3E,GAAyB1pE,GAAoBrM,UAAU61E,IACvD/iD,GAA2BzmB,GAAoBrM,UAAU81E,IAEzDE,GAAO,MACPC,GAAYrwE,MAAM,GAElBswE,GAAkB,SAAU3+C,GAC9B,OAAO0+C,GAAU1+C,EAAQ,KAAO0+C,GAAU1+C,EAAQ,GAAKrW,OAAO,qBAAuBqW,EAAQ,KAAM,QAGjG4+C,GAAgB,SAAUC,GAC5B,IACE,OAAOC,mBAAmBD,GAC1B,MAAO98E,GACP,OAAO88E,IAIPE,GAAc,SAAU19E,GAC1B,IAAI+J,EAAS/J,EAAGqL,QAAQ+xE,GAAM,KAC1Bz+C,EAAQ,EACZ,IACE,OAAO8+C,mBAAmB1zE,GAC1B,MAAOrJ,GACP,KAAOi+B,GACL50B,EAASA,EAAOsB,QAAQiyE,GAAgB3+C,KAAU4+C,IAEpD,OAAOxzE,IAIP2H,GAAO,eAEPrG,GAAU,CACZsyE,IAAK;AACLC,IAAK,MACLC,IAAK,MACLC,IAAK,MACLC,IAAK,MACLC,MAAO,KAGL/nE,GAAW,SAAU5L,GACvB,OAAOgB,GAAQhB,IAGb4zE,GAAY,SAAUj+E,GACxB,OAAOk+E,mBAAmBl+E,GAAIqL,QAAQqG,GAAMuE,KAG1CkoE,GAAoB,SAAUp0E,EAAQq0E,GACxC,GAAIA,EAIF,IAHA,IAEInqD,EAAW9G,EAFXkxD,EAAaD,EAAMj8E,MAAM,KACzB+G,EAAQ,EAELA,EAAQm1E,EAAW51E,SACxBwrB,EAAYoqD,EAAWn1E,MACTT,SACZ0kB,EAAQ8G,EAAU9xB,MAAM,KACxB4H,EAAOrE,KAAK,CACVpC,IAAKo6E,GAAYvwD,EAAMorB,SACvB52C,MAAO+7E,GAAYvwD,EAAMnlB,KAAK,UAOpCs2E,GAAqB,SAAUF,GACjC99E,KAAKwZ,QAAQrR,OAAS,EACtB01E,GAAkB79E,KAAKwZ,QAASskE,IAG9BG,GAA0B,SAAUC,EAAQC,GAC9C,GAAID,EAASC,EAAU,MAAMl8E,UAAU,yBAGrCm8E,GAA0BvmE,IAA0B,SAAkBu+D,EAAQv8D,GAChFlG,GAAiB3T,KAAM,CACrBgH,KAAM41E,GACNpwE,SAAUgwE,GAAYK,GAAuBzG,GAAQ58D,SACrDK,KAAMA;GAEP,YAAY,WACb,IAAIxT,EAAQuzB,GAAyB55B,MACjC6Z,EAAOxT,EAAMwT,KACb6E,EAAOrY,EAAMmG,SAASuL,OACtB8U,EAAQnO,EAAKrd,MAGf,OAFGqd,EAAK5E,OACR4E,EAAKrd,MAAiB,SAATwY,EAAkBgT,EAAM7pB,IAAe,WAAT6W,EAAoBgT,EAAMxrB,MAAQ,CAACwrB,EAAM7pB,IAAK6pB,EAAMxrB,QACxFqd,KAKP2/D,GAA6B,WAC/BtgE,GAAW/d,KAAMq+E,GAA4B1B,IAC7C,IAGIrvD,EAAgB9gB,EAAUuL,EAAM2G,EAAM4/D,EAAeC,EAAWrkE,EAAOC,EAAQnX,EAH/E62B,EAAO3xB,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAC7C0N,EAAO1P,KACPwZ,EAAU,GAUd,GAPA7F,GAAiBjE,EAAM,CACrB1I,KAAM21E,GACNnjE,QAASA,EACTglE,UAAW,aACXR,mBAAoBA,UAGTh8E,IAAT63B,EACF,GAAIz3B,GAASy3B,GAEX,GAA8B,mBAD9BvM,EAAiBrP,GAAkB4b,IAIjC,IADA9hB,GADAvL,EAAW8gB,EAAexsB,KAAK+4B,IACf9hB,OACP2G,EAAO3G,EAAKjX,KAAK0L,IAAWsN,MAAM;AAGzC,IACGI,GAFHqkE,GADAD,EAAgB9B,GAAYr4E,GAASua,EAAKrd,SAChB0W,MAELjX,KAAKw9E,IAAgBxkE,OACvCK,EAASokE,EAAUz9E,KAAKw9E,IAAgBxkE,OACxCykE,EAAUz9E,KAAKw9E,GAAexkE,KAC/B,MAAM7X,UAAU,mCAClBuX,EAAQpU,KAAK,CAAEpC,IAAKkX,EAAM7Y,MAAQ,GAAIA,MAAO8Y,EAAO9Y,MAAQ,UAEzD,IAAK2B,KAAO62B,EAAU92B,GAAO82B,EAAM72B,IAAMwW,EAAQpU,KAAK,CAAEpC,IAAKA,EAAK3B,MAAOw4B,EAAK72B,GAAO,UAE5F66E,GAAkBrkE,EAAyB,iBAATqgB,EAAuC,MAAnBA,EAAKrf,OAAO,GAAaqf,EAAKn4B,MAAM,GAAKm4B,EAAOA,EAAO,KAK/G4kD,GAA2BJ,GAA2B12E,UAE1DgW,GAAY8gE,GAA0B,CAGpCC,OAAQ,SAAgBxvE,EAAM7N,GAC5B48E,GAAwB/1E,UAAUC,OAAQ,GAC1C,IAAI9B,EAAQw2E,GAAuB78E,MACnCqG,EAAMmT,QAAQpU,KAAK,CAAEpC,IAAKkM,EAAO,GAAI7N,MAAOA,EAAQ,KACpDgF,EAAMm4E,aAIRhlD,OAAU,SAAUtqB,GAClB+uE,GAAwB/1E,UAAUC,OAAQ;CAK1C,IAJA,IAAI9B,EAAQw2E,GAAuB78E,MAC/BwZ,EAAUnT,EAAMmT,QAChBxW,EAAMkM,EAAO,GACbtG,EAAQ,EACLA,EAAQ4Q,EAAQrR,QACjBqR,EAAQ5Q,GAAO5F,MAAQA,EAAKwW,EAAQohB,OAAOhyB,EAAO,GACjDA,IAEPvC,EAAMm4E,aAIR/9E,IAAK,SAAayO,GAChB+uE,GAAwB/1E,UAAUC,OAAQ,GAI1C,IAHA,IAAIqR,EAAUqjE,GAAuB78E,MAAMwZ,QACvCxW,EAAMkM,EAAO,GACbtG,EAAQ,EACLA,EAAQ4Q,EAAQrR,OAAQS,IAC7B,GAAI4Q,EAAQ5Q,GAAO5F,MAAQA,EAAK,OAAOwW,EAAQ5Q,GAAOvH,MAExD,OAAO,MAITs9E,OAAQ,SAAgBzvE,GACtB+uE,GAAwB/1E,UAAUC,OAAQ,GAK1C,IAJA,IAAIqR,EAAUqjE,GAAuB78E,MAAMwZ,QACvCxW,EAAMkM,EAAO,GACbzF,EAAS,GACTb,EAAQ,EACLA,EAAQ4Q,EAAQrR,OAAQS,IACzB4Q,EAAQ5Q,GAAO5F,MAAQA,GAAKyG,EAAOrE,KAAKoU,EAAQ5Q,GAAOvH,OAE7D,OAAOoI,GAIT3G,IAAK,SAAaoM,GAChB+uE,GAAwB/1E,UAAUC,OAAQ,GAI1C,IAHA,IAAIqR,EAAUqjE,GAAuB78E,MAAMwZ,QACvCxW,EAAMkM,EAAO,GACbtG,EAAQ,EACLA,EAAQ4Q,EAAQrR,QACrB,GAAIqR,EAAQ5Q,KAAS5F,MAAQA,EAAK,OAAO;CAE3C,OAAO,GAITwC,IAAK,SAAa0J,EAAM7N,GACtB48E,GAAwB/1E,UAAUC,OAAQ,GAQ1C,IAPA,IAMI0kB,EANAxmB,EAAQw2E,GAAuB78E,MAC/BwZ,EAAUnT,EAAMmT,QAChBolE,GAAQ,EACR57E,EAAMkM,EAAO,GACbzM,EAAMpB,EAAQ,GACduH,EAAQ,EAELA,EAAQ4Q,EAAQrR,OAAQS,KAC7BikB,EAAQrT,EAAQ5Q,IACN5F,MAAQA,IACZ47E,EAAOplE,EAAQohB,OAAOhyB,IAAS,IAEjCg2E,GAAQ,EACR/xD,EAAMxrB,MAAQoB,IAIfm8E,GAAOplE,EAAQpU,KAAK,CAAEpC,IAAKA,EAAK3B,MAAOoB,IAC5C4D,EAAMm4E,aAIR54C,KAAM,WACJ,IAII/Y,EAAOgyD,EAAcC,EAJrBz4E,EAAQw2E,GAAuB78E,MAC/BwZ,EAAUnT,EAAMmT,QAEhB9X,EAAQ8X,EAAQ9X,QAGpB,IADA8X,EAAQrR,OAAS,EACZ22E,EAAa,EAAGA,EAAap9E,EAAMyG,OAAQ22E,IAAc,CAE5D,IADAjyD,EAAQnrB,EAAMo9E,GACTD,EAAe,EAAGA,EAAeC,EAAYD,IAChD,GAAIrlE,EAAQqlE,GAAc77E,IAAM6pB,EAAM7pB,IAAK,CACzCwW,EAAQohB,OAAOikD,EAAc,EAAGhyD,GAChC,MAGAgyD,IAAiBC,GAAYtlE,EAAQpU,KAAKynB,GAEhDxmB,EAAMm4E,aAGRztE,QAAS,SAAiBguE;AAKxB,IAJA,IAGIlyD,EAHArT,EAAUqjE,GAAuB78E,MAAMwZ,QACvC3I,EAAgBV,GAAK4uE,EAAU72E,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAAW,GAChF4G,EAAQ,EAELA,EAAQ4Q,EAAQrR,QAErB0I,GADAgc,EAAQrT,EAAQ5Q,MACIvH,MAAOwrB,EAAM7pB,IAAKhD,OAI1C8F,KAAM,WACJ,OAAO,IAAIs4E,GAAwBp+E,KAAM,SAG3CyZ,OAAQ,WACN,OAAO,IAAI2kE,GAAwBp+E,KAAM,WAG3CwZ,QAAS,WACP,OAAO,IAAI4kE,GAAwBp+E,KAAM,aAE1C,CAAEkB,YAAY,OAGRu9E,GAA0BjnE,GAAUinE,GAAyBjlE,YAI7DilE,GAA0B,YAAY,WAK7C,IAJA,IAGI5xD,EAHArT,EAAUqjE,GAAuB78E,MAAMwZ,QACvC/P,EAAS,GACTb,EAAQ,EAELA,EAAQ4Q,EAAQrR,QACrB0kB,EAAQrT,EAAQ5Q,KAChBa,EAAOrE,KAAKu4E,GAAU9wD,EAAM7pB,KAAO,IAAM26E,GAAU9wD,EAAMxrB,QACzD,OAAOoI,EAAO/B,KAAK,OACpB,CAAExG,YAAY,OAEFm9E,GAA4B1B,OAEzC,CAAE/8E,QAAQ;AAAM8L,QAAS6wE,IAAkB,CAC3CtB,gBAAiBoD,KAKd9B,IAAmC,mBAAVE,IAA0C,mBAAXC,IAC3DnrE,GAAE,CAAE3R,QAAQ,EAAMsB,YAAY,EAAMwK,QAAQ,GAAQ,CAClDszE,MAAO,SAAe18E,GACpB,IACIu3B,EAAMolD,EAAMC,EADZppE,EAAO,CAACxT,GAkBV,OAhBE4F,UAAUC,OAAS,IAEjB/F,GADJy3B,EAAO3xB,UAAU,MAEf+2E,EAAOplD,EAAKolD,KACRt9E,GAAQs9E,KAAUtC,MACpBuC,EAAUrlD,EAAKqlD,QAAU,IAAIxC,GAAQ7iD,EAAKqlD,SAAW,IAAIxC,IAC5C55E,IAAI,iBACfo8E,EAAQ15E,IAAI,eAAgB,mDAE9Bq0B,EAAOrrB,GAAOqrB,EAAM,CAClBolD,KAAM99E,GAAyB,EAAGiD,OAAO66E,IACzCC,QAAS/9E,GAAyB,EAAG+9E,OAI3CppE,EAAK1Q,KAAKy0B,IACH4iD,GAAO5sE,MAAM7P,KAAM8V,UCpS9BqpE,GDySJC,GAAiB,CACfnE,gBAAiBoD,GACjBgB,SAAUxC;ECtVRtrE,GAAIjR,GACJkD,GAAc5B,EACd26E,GAAiBl5E,GACjBzD,GAAS8D,EACToJ,GAAmBnJ,GACnBuH,GAAWtH,WACXma,GAAaja,GACbhB,GAAMqD,GACNsyE,GAASjnE,GACT8yC,GAAY7yC,GACZiJ,GAAShJ,GAAyCgJ,OAClD4kE,GHgJa,SAAUh9E,GACzB,IAEIkH,EAAG+1E,EAFHC,EAAU,GACVC,EAASn9E,EAAM0I,cAAcD,QAAQswE,GAAiB,KAAUx5E,MAAM,KAE1E,IAAK2H,EAAI,EAAGA,EAAIi2E,EAAOt3E,OAAQqB,IAC7B+1E,EAAQE,EAAOj2E,GACfg2E,EAAQp6E,KAAKg2E,GAAcl2E,KAAKq6E,GAAS,OAASpa,GAAOoa,GAASA,GAEpE,OAAOC,EAAQ93E,KAAK;EGvJlB6H,GAAiBqC,GACjB8tE,GAAwB7tE,GACxBsB,GAAsBrB,GAEtB6tE,GAAY//E,GAAO+lD,IACnBs1B,GAAkByE,GAAsBzE,gBACxC2E,GAA+BF,GAAsBL,SACrD1rE,GAAmBR,GAAoB3N,IACvCq6E,GAAsB1sE,GAAoBrM,UAAU,OACpDuB,GAAQ1I,KAAK0I,MACbw1B,GAAMl+B,KAAKk+B,IAGXiiD,GAAiB,iBACjBC,GAAe,eACfC,GAAe,eAEfC,GAAQ,WAERC,GAAe,gBACfC,GAAQ,KACRC,GAAY,WACZC,GAAM,WACNC,GAAM,QACNC,GAAM,gBAENC,GAA4B,wBAC5BC,GAA8C,uBAC9CC,GAA2C,yCAC3CC,GAAmB,YAInBC,GAAY,SAAU5sD,EAAK1xB,GAC7B,IAAImH,EAAQo3E,EAAYj4E,EACxB,GAAuB,KAAnBtG,EAAMkY,OAAO,GAAW,CAC1B,GAAsC,KAAlClY,EAAMkY,OAAOlY,EAAM6F,OAAS,GAAW,OAAO43E;CAElD,KADAt2E,EAASq3E,GAAUx+E,EAAMZ,MAAM,GAAI,KACtB,OAAOq+E,GACpB/rD,EAAI9S,KAAOzX,OAEN,GAAKs3E,GAAU/sD,GAQf,CAEL,GADA1xB,EAAQg9E,GAAQh9E,GACZk+E,GAA0Bt7E,KAAK5C,GAAQ,OAAOy9E,GAElD,GAAe,QADft2E,EAASu3E,GAAU1+E,IACE,OAAOy9E,GAC5B/rD,EAAI9S,KAAOzX,MAbe,CAC1B,GAAIg3E,GAA4Cv7E,KAAK5C,GAAQ,OAAOy9E,GAGpE,IAFAt2E,EAAS,GACTo3E,EAAav8B,GAAUhiD,GAClBsG,EAAQ,EAAGA,EAAQi4E,EAAW14E,OAAQS,IACzCa,GAAUw3E,GAAcJ,EAAWj4E,GAAQs4E,IAE7CltD,EAAI9S,KAAOzX,IAUXu3E,GAAY,SAAU1+E,GACxB,IACI6+E,EAAaC,EAASx4E,EAAOy4E,EAAMr9B,EAAOtmB,EAAQ4jD,EADlD7G,EAAQn4E,EAAMT,MAAM,KAMxB,GAJI44E,EAAMtyE,QAAqC,IAA3BsyE,EAAMA,EAAMtyE,OAAS,IACvCsyE,EAAMzsD,OAERmzD,EAAc1G,EAAMtyE,QACF,EAAG,OAAO7F,EAE5B,IADA8+E,EAAU,GACLx4E,EAAQ,EAAGA,EAAQu4E,EAAav4E,IAAS,CAE5C,GAAY,KADZy4E,EAAO5G,EAAM7xE,IACG,OAAOtG,EAMvB,GALA0hD,EAAQ,GACJq9B,EAAKl5E,OAAS,GAAuB,KAAlBk5E,EAAK7mE,OAAO,KACjCwpC,EAAQo8B,GAAUl7E,KAAKm8E,GAAQ,GAAK,EACpCA,EAAOA,EAAK3/E,MAAe,GAATsiD,EAAa,EAAI,IAExB,KAATq9B,EACF3jD,EAAS,MACJ;AACL,KAAe,IAATsmB,EAAcs8B,GAAe,GAATt8B,EAAaq8B,GAAME,IAAKr7E,KAAKm8E,GAAO,OAAO/+E,EACrEo7B,EAASymB,SAASk9B,EAAMr9B,GAE1Bo9B,EAAQh8E,KAAKs4B,GAEf,IAAK90B,EAAQ,EAAGA,EAAQu4E,EAAav4E,IAEnC,GADA80B,EAAS0jD,EAAQx4E,GACbA,GAASu4E,EAAc,GACzB,GAAIzjD,GAAUG,GAAI,IAAK,EAAIsjD,GAAc,OAAO,UAC3C,GAAIzjD,EAAS,IAAK,OAAO,KAGlC,IADA4jD,EAAOF,EAAQpzD,MACVplB,EAAQ,EAAGA,EAAQw4E,EAAQj5E,OAAQS,IACtC04E,GAAQF,EAAQx4E,GAASi1B,GAAI,IAAK,EAAIj1B,GAExC,OAAO04E,GAILR,GAAY,SAAUx+E,GACxB,IAIIjB,EAAO8G,EAAQo5E,EAAaC,EAAW9jD,EAAQ+jD,EAAOC,EAJtDC,EAAU,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAChCC,EAAa,EACbC,EAAW,KACXC,EAAU,EAGVC,EAAO,WACT,OAAOz/E,EAAMkY,OAAOsnE,IAGtB,GAAc,KAAVC,IAAe,CACjB,GAAuB,KAAnBz/E,EAAMkY,OAAO,GAAW,OAC5BsnE,GAAW,EAEXD,IADAD,EAGF,KAAOG,KAAQ,CACb,GAAkB,GAAdH,EAAiB,OACrB,GAAc,KAAVG,IAAJ,CAQA,IADA1gF,EAAQ8G,EAAS,EACVA,EAAS,GAAKo4E,GAAIr7E,KAAK68E,MAC5B1gF,EAAgB,GAARA,EAAa8iD,SAAS49B,IAAQ,IACtCD,IACA35E,IAEF,GAAc,KAAV45E,IAAe;AACjB,GAAc,GAAV55E,EAAa,OAEjB,GADA25E,GAAW35E,EACPy5E,EAAa,EAAG,OAEpB,IADAL,EAAc,EACPQ,KAAQ,CAEb,GADAP,EAAY,KACRD,EAAc,EAAG,CACnB,KAAc,KAAVQ,KAAiBR,EAAc,GAC9B,OADiCO,IAGxC,IAAK3B,GAAMj7E,KAAK68E,KAAS,OACzB,KAAO5B,GAAMj7E,KAAK68E,MAAS,CAEzB,GADArkD,EAASymB,SAAS49B,IAAQ,IACR,OAAdP,EAAoBA,EAAY9jD,MAC/B,CAAA,GAAiB,GAAb8jD,EAAgB,OACpBA,EAAwB,GAAZA,EAAiB9jD,EAClC,GAAI8jD,EAAY,IAAK,OACrBM,IAEFH,EAAQC,GAAoC,IAAtBD,EAAQC,GAAoBJ,EAE/B,KADnBD,GACuC,GAAfA,GAAkBK,IAE5C,GAAmB,GAAfL,EAAkB,OACtB,MACK,GAAc,KAAVQ,KAET,GADAD,KACKC,IAAQ,YACR,GAAIA,IAAQ,OACnBJ,EAAQC,KAAgBvgF,MA3CxB,CACE,GAAiB,OAAbwgF,EAAmB,OACvBC,IAEAD,IADAD,GA0CJ,GAAiB,OAAbC,EAGF,IAFAJ,EAAQG,EAAaC,EACrBD,EAAa,EACQ,GAAdA,GAAmBH,EAAQ,GAChCC,EAAOC,EAAQC,GACfD,EAAQC,KAAgBD,EAAQE,EAAWJ,EAAQ,GACnDE,EAAQE,IAAaJ,GAASC,OAE3B,GAAkB,GAAdE,EAAiB,OAC5B,OAAOD,GA6BLK,GAAgB,SAAU9gE,GAC5B,IAAIzX,EAAQb,EAAOi5E,EAAUI;CAE7B,GAAmB,iBAAR/gE,EAAkB,CAE3B,IADAzX,EAAS,GACJb,EAAQ,EAAGA,EAAQ,EAAGA,IACzBa,EAAOy4E,QAAQhhE,EAAO,KACtBA,EAAO7Y,GAAM6Y,EAAO,KACpB,OAAOzX,EAAO/B,KAAK,KAEhB,GAAmB,iBAARwZ,EAAkB,CAGlC,IAFAzX,EAAS,GACTo4E,EAtC0B,SAAUM,GAMtC,IALA,IAAIC,EAAW,KACX7/B,EAAY,EACZ8/B,EAAY,KACZC,EAAa,EACb15E,EAAQ,EACLA,EAAQ,EAAGA,IACI,IAAhBu5E,EAAKv5E,IACH05E,EAAa//B,IACf6/B,EAAWC,EACX9/B,EAAY+/B,GAEdD,EAAY,KACZC,EAAa,IAEK,OAAdD,IAAoBA,EAAYz5E,KAClC05E,GAON,OAJIA,EAAa//B,IACf6/B,EAAWC,EACX9/B,EAAY+/B,GAEPF,EAeMG,CAAwBrhE,GAC9BtY,EAAQ,EAAGA,EAAQ,EAAGA,IACrBq5E,GAA2B,IAAhB/gE,EAAKtY,KAChBq5E,IAASA,GAAU,GACnBJ,IAAaj5E,GACfa,GAAUb,EAAQ,IAAM,KACxBq5E,GAAU,IAEVx4E,GAAUyX,EAAKtY,GAAOpH,SAAS,IAC3BoH,EAAQ,IAAGa,GAAU,OAG7B,MAAO,IAAMA,EAAS,IACtB,OAAOyX,GAGPggE,GAA4B,GAC5BsB,GAA2B/J,GAAO,GAAIyI,GAA2B,CACnEuB,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,IAEnCC,GAAuBrK,GAAO,GAAI+J,GAA0B,CAC9DO,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,IAE3BC,GAA2B1K,GAAO,GAAIqK,GAAsB;AAC9DM,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,EAAGC,KAAM,EAAGC,IAAK,EAAGC,IAAK,EAAGC,IAAK,IAG5E5C,GAAgB,SAAUc,EAAMv8E,GAClC,IAAI0jC,EAAOxuB,GAAOqnE,EAAM,GACxB,OAAO74C,EAAO,IAAQA,EAAO,MAASpmC,GAAI0C,EAAKu8E,GAAQA,EAAOnE,mBAAmBmE,IAG/E+B,GAAiB,CACnBC,IAAK,GACLC,KAAM,KACNC,KAAM,GACNC,MAAO,IACPlnB,GAAI,GACJmnB,IAAK,KAGHpD,GAAY,SAAU/sD,GACxB,OAAOlxB,GAAIghF,GAAgB9vD,EAAIowD,SAG7BC,GAAsB,SAAUrwD,GAClC,MAAuB,IAAhBA,EAAIknD,UAAkC,IAAhBlnD,EAAIswD,UAG/BC,GAAiC,SAAUvwD,GAC7C,OAAQA,EAAI9S,MAAQ8S,EAAIwwD,kBAAkC,QAAdxwD,EAAIowD,QAG9CK,GAAuB,SAAU35E,EAAQ45E,GAC3C,IAAIvqE,EACJ,OAAwB,GAAjBrP,EAAO3C,QAAe83E,GAAM/6E,KAAK4F,EAAO0P,OAAO,MACjB,MAA9BL,EAASrP,EAAO0P,OAAO,MAAgBkqE,GAAwB,KAAVvqE,IAG1DwqE,GAA+B,SAAU75E,GAC3C,IAAIi5C;CACJ,OAAOj5C,EAAO3C,OAAS,GAAKs8E,GAAqB35E,EAAOpJ,MAAM,EAAG,MAC9C,GAAjBoJ,EAAO3C,QACyB,OAA9B47C,EAAQj5C,EAAO0P,OAAO,KAAyB,OAAVupC,GAA4B,MAAVA,GAA2B,MAAVA,IAI1E6gC,GAAkB,SAAU5wD,GAC9B,IAAIpsB,EAAOosB,EAAIpsB,KACXi9E,EAAWj9E,EAAKO,QAChB08E,GAA2B,QAAd7wD,EAAIowD,QAAgC,GAAZS,GAAkBJ,GAAqB78E,EAAK,IAAI,IACvFA,EAAKomB,OAIL82D,GAAc,SAAUC,GAC1B,MAAmB,MAAZA,GAA6C,QAA1BA,EAAQ/5E,eAShCg6E,GAAe,GACfC,GAAS,GACTC,GAAY,GACZC,GAAgC,GAChCC,GAAoB,GACpBC,GAAW,GACXC,GAAiB,GACjBC,GAA4B,GAC5BC,GAAmC,GACnCC,GAAY,GACZC,GAAO,GACPC,GAAW,GACXC,GAAO,GACPC,GAAO,GACPC,GAAa,GACbC,GAAY,GACZC,GAAa,GACbC,GAAO,GACPC,GAA4B,GAC5BC,GAAQ,GACRC,GAAW,GAGXC,GAAW,SAAUryD,EAAK1xB,EAAOgkF,EAAeh7C,GAClD,IAMIu1C,EAAYkB,EAAMwE,EAAkBC,EApCdzB,EA8BtB1+E,EAAQigF,GAAiBtB,GACzBlD,EAAU,EACVtjD,EAAS,GACTioD,GAAS,EACTC,GAAc,EACdC,GAAoB,EAoBxB,IAjBKL,IACHtyD,EAAIowD,OAAS,GACbpwD,EAAIknD,SAAW,GACflnD,EAAIswD,SAAW;AACftwD,EAAI9S,KAAO,KACX8S,EAAIxU,KAAO,KACXwU,EAAIpsB,KAAO,GACXosB,EAAI8pD,MAAQ,KACZ9pD,EAAI4yD,SAAW,KACf5yD,EAAIwwD,kBAAmB,EACvBliF,EAAQA,EAAMyI,QAAQ21E,GAA0C,KAGlEp+E,EAAQA,EAAMyI,QAAQ41E,GAAkB,IAExCE,EAAav8B,GAAUhiD,GAEhBw/E,GAAWjB,EAAW14E,QAAQ,CAEnC,OADA45E,EAAOlB,EAAWiB,GACVz7E,GACN,KAAK2+E,GACH,IAAIjD,IAAQ9B,GAAM/6E,KAAK68E,GAGhB,CAAA,GAAKuE,EAGL,OAAOxG,GAFZz5E,EAAQ6+E,GACR,SAJA1mD,GAAUujD,EAAK/2E,cACf3E,EAAQ4+E,GAKV,MAEF,KAAKA,GACH,GAAIlD,IAAS7B,GAAah7E,KAAK68E,IAAiB,KAARA,GAAuB,KAARA,GAAuB,KAARA,GACpEvjD,GAAUujD,EAAK/2E,kBACV,CAAA,GAAY,KAAR+2E,EA0BJ,CAAA,GAAKuE,EAKL,OAAOxG,GAJZthD,EAAS,GACTn4B,EAAQ6+E,GACRpD,EAAU,EACV,SA7BA,GAAIwE,IACDvF,GAAU/sD,IAAQlxB,GAAIghF,GAAgBtlD,IAC5B,QAAVA,IAAqB6lD,GAAoBrwD,IAAqB,OAAbA,EAAIxU,OACvC,QAAdwU,EAAIowD,SAAqBpwD,EAAI9S,MAC7B,OAEH,GADA8S,EAAIowD,OAAS5lD;AACT8nD,EAEF,YADIvF,GAAU/sD,IAAQ8vD,GAAe9vD,EAAIowD,SAAWpwD,EAAIxU,OAAMwU,EAAIxU,KAAO,OAG3Egf,EAAS,GACS,QAAdxK,EAAIowD,OACN/9E,EAAQw/E,GACC9E,GAAU/sD,IAAQsX,GAAQA,EAAK84C,QAAUpwD,EAAIowD,OACtD/9E,EAAQ8+E,GACCpE,GAAU/sD,GACnB3tB,EAAQk/E,GAC4B,KAA3B1E,EAAWiB,EAAU,IAC9Bz7E,EAAQ++E,GACRtD,MAEA9tD,EAAIwwD,kBAAmB,EACvBxwD,EAAIpsB,KAAKxC,KAAK,IACdiB,EAAQ6/E,IAQZ,MAEF,KAAKhB,GACH,IAAK55C,GAASA,EAAKk5C,kBAA4B,KAARzC,EAAc,OAAOjC,GAC5D,GAAIx0C,EAAKk5C,kBAA4B,KAARzC,EAAa,CACxC/tD,EAAIowD,OAAS94C,EAAK84C,OAClBpwD,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQxyC,EAAKwyC,MACjB9pD,EAAI4yD,SAAW,GACf5yD,EAAIwwD,kBAAmB,EACvBn+E,EAAQ+/E,GACR,MAEF//E,EAAuB,QAAfilC,EAAK84C,OAAmByB,GAAOR,GACvC,SAEF,KAAKF,GACH,GAAY,KAARpD,GAA0C,KAA3BlB,EAAWiB,EAAU,GAGjC,CACLz7E,EAAQg/E,GACR,SAJAh/E,EAAQm/E,GACR1D,IAIA,MAEJ,KAAKsD;AACH,GAAY,KAARrD,EAAa,CACf17E,EAAQo/E,GACR,MAEAp/E,EAAQ4/E,GACR,SAGJ,KAAKZ,GAEH,GADArxD,EAAIowD,OAAS94C,EAAK84C,OACdrC,GAAQ5C,GACVnrD,EAAIknD,SAAW5vC,EAAK4vC,SACpBlnD,EAAIswD,SAAWh5C,EAAKg5C,SACpBtwD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIxU,KAAO8rB,EAAK9rB,KAChBwU,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQxyC,EAAKwyC,WACZ,GAAY,KAARiE,GAAwB,MAARA,GAAgBhB,GAAU/sD,GACnD3tB,EAAQi/E,QACH,GAAY,KAARvD,EACT/tD,EAAIknD,SAAW5vC,EAAK4vC,SACpBlnD,EAAIswD,SAAWh5C,EAAKg5C,SACpBtwD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIxU,KAAO8rB,EAAK9rB,KAChBwU,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQ,GACZz3E,EAAQ8/E,OACH,CAAA,GAAY,KAARpE,EASJ,CACL/tD,EAAIknD,SAAW5vC,EAAK4vC,SACpBlnD,EAAIswD,SAAWh5C,EAAKg5C,SACpBtwD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIxU,KAAO8rB,EAAK9rB,KAChBwU,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAIpsB,KAAKomB,MACT3nB,EAAQ4/E,GACR;AAhBAjyD,EAAIknD,SAAW5vC,EAAK4vC,SACpBlnD,EAAIswD,SAAWh5C,EAAKg5C,SACpBtwD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIxU,KAAO8rB,EAAK9rB,KAChBwU,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQxyC,EAAKwyC,MACjB9pD,EAAI4yD,SAAW,GACfvgF,EAAQ+/E,GAUR,MAEJ,KAAKd,GACH,IAAIvE,GAAU/sD,IAAiB,KAAR+tD,GAAuB,MAARA,EAE/B,CAAA,GAAY,KAARA,EAEJ,CACL/tD,EAAIknD,SAAW5vC,EAAK4vC,SACpBlnD,EAAIswD,SAAWh5C,EAAKg5C,SACpBtwD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIxU,KAAO8rB,EAAK9rB,KAChBnZ,EAAQ4/E,GACR,SAPA5/E,EAAQo/E,QAFRp/E,EAAQm/E,GAUR,MAEJ,KAAKD,GAEH,GADAl/E,EAAQm/E,GACI,KAARzD,GAA6C,KAA9BvjD,EAAOhkB,OAAOsnE,EAAU,GAAW,SACtDA,IACA,MAEF,KAAK0D,GACH,GAAY,KAARzD,GAAuB,MAARA,EAAc,CAC/B17E,EAAQo/E,GACR,SACA,MAEJ,KAAKA,GACH,GAAY,KAAR1D,EAAa,CACX0E,IAAQjoD,EAAS,MAAQA,GAC7BioD,GAAS,EACTF,EAAmBjiC,GAAU9lB,GAC7B,IAAK,IAAIh1B,EAAI,EAAGA,EAAI+8E,EAAiBp+E,OAAQqB,IAAK,CAChD,IAAIq9E,EAAYN,EAAiB/8E,GACjC,GAAiB,KAAbq9E,GAAqBF,EAAzB;AAIA,IAAIG,EAAoB7F,GAAc4F,EAAW1D,IAC7CwD,EAAmB3yD,EAAIswD,UAAYwC,EAClC9yD,EAAIknD,UAAY4L,OALnBH,GAAoB,EAOxBnoD,EAAS,QACJ,GACLujD,GAAQ5C,IAAe,KAAR4C,GAAuB,KAARA,GAAuB,KAARA,GACpC,MAARA,GAAgBhB,GAAU/sD,GAC3B,CACA,GAAIyyD,GAAoB,IAAVjoD,EAAc,MApfd,oBAqfdsjD,GAAWx9B,GAAU9lB,GAAQr2B,OAAS,EACtCq2B,EAAS,GACTn4B,EAAQq/E,QACHlnD,GAAUujD,EACjB,MAEF,KAAK2D,GACL,KAAKC,GACH,GAAIW,GAA+B,QAAdtyD,EAAIowD,OAAkB,CACzC/9E,EAAQ0/E,GACR,SACK,GAAY,KAARhE,GAAgB2E,EAOpB,CAAA,GACL3E,GAAQ5C,IAAe,KAAR4C,GAAuB,KAARA,GAAuB,KAARA,GACpC,MAARA,GAAgBhB,GAAU/sD,GAC3B,CACA,GAAI+sD,GAAU/sD,IAAkB,IAAVwK,EAAc,OAAOuhD,GAC3C,GAAIuG,GAA2B,IAAV9nD,IAAiB6lD,GAAoBrwD,IAAqB,OAAbA,EAAIxU,MAAgB,OAEtF,GADAgnE,EAAU5F,GAAU5sD,EAAKwK,GACZ,OAAOgoD,EAGpB,GAFAhoD,EAAS,GACTn4B,EAAQ2/E,GACJM,EAAe,OACnB,SAEY,KAARvE,EAAa2E,GAAc,EACd,KAAR3E,IAAa2E,GAAc,GACpCloD,GAAUujD,MAtB4B,CACtC,GAAc,IAAVvjD,EAAc,OAAOuhD;CAEzB,GADAyG,EAAU5F,GAAU5sD,EAAKwK,GACZ,OAAOgoD,EAGpB,GAFAhoD,EAAS,GACTn4B,EAAQu/E,GACJU,GAAiBX,GAAU,OAiB/B,MAEJ,KAAKC,GACH,IAAIzF,GAAMj7E,KAAK68E,GAER,CAAA,GACLA,GAAQ5C,IAAe,KAAR4C,GAAuB,KAARA,GAAuB,KAARA,GACpC,MAARA,GAAgBhB,GAAU/sD,IAC3BsyD,EACA,CACA,GAAc,IAAV9nD,EAAc,CAChB,IAAIhf,EAAO2kC,SAAS3lB,EAAQ,IAC5B,GAAIhf,EAAO,MAAQ,OAAOwgE,GAC1BhsD,EAAIxU,KAAQuhE,GAAU/sD,IAAQxU,IAASskE,GAAe9vD,EAAIowD,QAAW,KAAO5kE,EAC5Egf,EAAS,GAEX,GAAI8nD,EAAe,OACnBjgF,EAAQ2/E,GACR,SACK,OAAOhG,GAfZxhD,GAAUujD,EAgBZ,MAEF,KAAK8D,GAEH,GADA7xD,EAAIowD,OAAS,OACD,KAARrC,GAAuB,MAARA,EAAc17E,EAAQy/E,OACpC,CAAA,IAAIx6C,GAAuB,QAAfA,EAAK84C,OAyBf,CACL/9E,EAAQ4/E,GACR,SA1BA,GAAIlE,GAAQ5C,GACVnrD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQxyC,EAAKwyC,WACZ,GAAY,KAARiE,EACT/tD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQ,GACZz3E,EAAQ8/E,OACH;AAAA,GAAY,KAARpE,EAMJ,CACA4C,GAA6B9D,EAAWn/E,MAAMogF,GAASp6E,KAAK,OAC/DssB,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBkjF,GAAgB5wD,IAElB3tB,EAAQ4/E,GACR,SAZAjyD,EAAI9S,KAAOoqB,EAAKpqB,KAChB8S,EAAIpsB,KAAO0jC,EAAK1jC,KAAKlG,QACrBsyB,EAAI8pD,MAAQxyC,EAAKwyC,MACjB9pD,EAAI4yD,SAAW,GACfvgF,EAAQ+/E,IAaV,MAEJ,KAAKN,GACH,GAAY,KAAR/D,GAAuB,MAARA,EAAc,CAC/B17E,EAAQ0/E,GACR,MAEEz6C,GAAuB,QAAfA,EAAK84C,SAAqBO,GAA6B9D,EAAWn/E,MAAMogF,GAASp6E,KAAK,OAC5F+8E,GAAqBn5C,EAAK1jC,KAAK,IAAI,GAAOosB,EAAIpsB,KAAKxC,KAAKkmC,EAAK1jC,KAAK,IACjEosB,EAAI9S,KAAOoqB,EAAKpqB,MAEvB7a,EAAQ4/E,GACR,SAEF,KAAKF,GACH,GAAIhE,GAAQ5C,IAAe,KAAR4C,GAAuB,MAARA,GAAwB,KAARA,GAAuB,KAARA,EAAa,CAC5E,IAAKuE,GAAiB7B,GAAqBjmD,GACzCn4B,EAAQ4/E,QACH,GAAc,IAAVznD,EAAc,CAEvB,GADAxK,EAAI9S,KAAO,GACPolE,EAAe,OACnBjgF,EAAQ2/E,OACH,CAEL,GADAQ,EAAU5F,GAAU5sD,EAAKwK,GACZ,OAAOgoD;CAEpB,GADgB,aAAZxyD,EAAI9S,OAAqB8S,EAAI9S,KAAO,IACpColE,EAAe,OACnB9nD,EAAS,GACTn4B,EAAQ2/E,GACR,SACGxnD,GAAUujD,EACjB,MAEF,KAAKiE,GACH,GAAIjF,GAAU/sD,IAEZ,GADA3tB,EAAQ4/E,GACI,KAARlE,GAAuB,MAARA,EAAc,cAC5B,GAAKuE,GAAyB,KAARvE,EAGtB,GAAKuE,GAAyB,KAARvE,GAGtB,GAAIA,GAAQ5C,KACjB94E,EAAQ4/E,GACI,KAARlE,GAAa,cAJjB/tD,EAAI4yD,SAAW,GACfvgF,EAAQ+/E,QAJRpyD,EAAI8pD,MAAQ,GACZz3E,EAAQ8/E,GAOR,MAEJ,KAAKF,GACH,GACElE,GAAQ5C,IAAe,KAAR4C,GACN,MAARA,GAAgBhB,GAAU/sD,KACzBsyD,IAA0B,KAARvE,GAAuB,KAARA,GACnC,CAkBA,GA3XW,QADnBgD,GAD0BA,EA4WFvmD,GA3WNxzB,gBACqB,SAAZ+5E,GAAkC,SAAZA,GAAkC,WAAZA,GA2W7DH,GAAgB5wD;AACJ,KAAR+tD,GAAyB,MAARA,GAAgBhB,GAAU/sD,IAC7CA,EAAIpsB,KAAKxC,KAAK,KAEP0/E,GAAYtmD,GACT,KAARujD,GAAyB,MAARA,GAAgBhB,GAAU/sD,IAC7CA,EAAIpsB,KAAKxC,KAAK,KAGE,QAAd4uB,EAAIowD,SAAqBpwD,EAAIpsB,KAAKO,QAAUs8E,GAAqBjmD,KAC/DxK,EAAI9S,OAAM8S,EAAI9S,KAAO,IACzBsd,EAASA,EAAOhkB,OAAO,GAAK,KAE9BwZ,EAAIpsB,KAAKxC,KAAKo5B,IAEhBA,EAAS,GACS,QAAdxK,EAAIowD,SAAqBrC,GAAQ5C,IAAe,KAAR4C,GAAuB,KAARA,GACzD,KAAO/tD,EAAIpsB,KAAKO,OAAS,GAAqB,KAAhB6rB,EAAIpsB,KAAK,IACrCosB,EAAIpsB,KAAKqwC,QAGD,KAAR8pC,GACF/tD,EAAI8pD,MAAQ,GACZz3E,EAAQ8/E,IACS,KAARpE,IACT/tD,EAAI4yD,SAAW,GACfvgF,EAAQ+/E,SAGV5nD,GAAUyiD,GAAcc,EAAMe,IAC9B,MAEJ,KAAKoD,GACS,KAARnE,GACF/tD,EAAI8pD,MAAQ,GACZz3E,EAAQ8/E,IACS,KAARpE,GACT/tD,EAAI4yD,SAAW,GACfvgF,EAAQ+/E,IACCrE,GAAQ5C,KACjBnrD,EAAIpsB,KAAK,IAAMq5E,GAAcc,EAAMb,KACnC,MAEJ,KAAKiF;AACEG,GAAyB,KAARvE,EAGXA,GAAQ5C,KACL,KAAR4C,GAAehB,GAAU/sD,GAAMA,EAAI8pD,OAAS,MAC1B9pD,EAAI8pD,OAAT,KAARiE,EAA0B,MACjBd,GAAcc,EAAMb,MALtCltD,EAAI4yD,SAAW,GACfvgF,EAAQ+/E,IAKR,MAEJ,KAAKA,GACCrE,GAAQ5C,KAAKnrD,EAAI4yD,UAAY3F,GAAcc,EAAMS,KAIzDV,MAMAiF,GAAiB,SAAa/yD,GAChC,IAIIgzD,EAAWR,EAJX92E,EAAOqO,GAAW/d,KAAM+mF,GAAgB,OACxCz7C,EAAOpjC,UAAUC,OAAS,EAAID,UAAU,QAAKlG,EAC7CilF,EAAY7iF,OAAO4vB,GACnB3tB,EAAQsN,GAAiBjE,EAAM,CAAE1I,KAAM,QAE3C,QAAahF,IAATspC,EACF,GAAIA,aAAgBy7C,GAAgBC,EAAYnH,GAAoBv0C,QAGlE,GADAk7C,EAAUH,GAASW,EAAY,GAAI5iF,OAAOknC,IAC7B,MAAMrpC,UAAUukF,GAIjC,GADAA,EAAUH,GAAShgF,EAAO4gF,EAAW,KAAMD,GAC9B,MAAM/kF,UAAUukF,GAC7B,IAAI1L,EAAez0E,EAAMy0E,aAAe,IAAIG,GACxCiM,EAAoBtH,GAA6B9E,GACrDoM,EAAkBlJ,mBAAmB33E,EAAMy3E,OAC3CoJ,EAAkB1I,UAAY;AAC5Bn4E,EAAMy3E,MAAQ15E,OAAO02E,IAAiB,MAEnCt3E,KACHkM,EAAKsrE,KAAOmM,GAAarmF,KAAK4O,GAC9BA,EAAK03E,OAASC,GAAUvmF,KAAK4O,GAC7BA,EAAKuR,SAAWqmE,GAAYxmF,KAAK4O,GACjCA,EAAKwrE,SAAWqM,GAAYzmF,KAAK4O,GACjCA,EAAK40E,SAAWkD,GAAY1mF,KAAK4O,GACjCA,EAAKwR,KAAOumE,GAAQ3mF,KAAK4O,GACzBA,EAAKg4E,SAAWC,GAAY7mF,KAAK4O,GACjCA,EAAK8P,KAAOooE,GAAQ9mF,KAAK4O,GACzBA,EAAKqrE,SAAW8M,GAAY/mF,KAAK4O,GACjCA,EAAK8qB,OAASstD,GAAUhnF,KAAK4O,GAC7BA,EAAKorE,aAAeiN,GAAgBjnF,KAAK4O,GACzCA,EAAK8/C,KAAOw4B,GAAQlnF,KAAK4O,KAIzBu4E,GAAelB,GAAep/E,UAE9Bw/E,GAAe,WACjB,IAAInzD,EAAM6rD,GAAoB7/E,MAC1BokF,EAASpwD,EAAIowD,OACblJ,EAAWlnD,EAAIknD,SACfoJ,EAAWtwD,EAAIswD,SACfpjE,EAAO8S,EAAI9S,KACX1B,EAAOwU,EAAIxU,KACX5X,EAAOosB,EAAIpsB,KACXk2E,EAAQ9pD,EAAI8pD,MACZ8I,EAAW5yD,EAAI4yD,SACf9zD,EAASsxD,EAAS,IAYtB,OAXa,OAATljE,GACF4R,GAAU,KACNuxD,GAAoBrwD,KACtBlB,GAAUooD,GAAYoJ,EAAW,IAAMA,EAAW,IAAM,KAE1DxxD,GAAUkvD,GAAc9gE;AACX,OAAT1B,IAAesT,GAAU,IAAMtT,IAChB,QAAV4kE,IAAkBtxD,GAAU,MACvCA,GAAUkB,EAAIwwD,iBAAmB58E,EAAK,GAAKA,EAAKO,OAAS,IAAMP,EAAKF,KAAK,KAAO,GAClE,OAAVo2E,IAAgBhrD,GAAU,IAAMgrD,GACnB,OAAb8I,IAAmB9zD,GAAU,IAAM8zD,GAChC9zD,GAGLu0D,GAAY,WACd,IAAIrzD,EAAM6rD,GAAoB7/E,MAC1BokF,EAASpwD,EAAIowD,OACb5kE,EAAOwU,EAAIxU,KACf,GAAc,QAAV4kE,EAAkB,IACpB,OAAO,IAAI2C,GAAe3C,EAAOx8E,KAAK,IAAIw/E,OAC1C,MAAOhnF,GACP,MAAO,OAET,MAAc,QAAVgkF,GAAqBrD,GAAU/sD,GAC5BowD,EAAS,MAAQpC,GAAchuD,EAAI9S,OAAkB,OAAT1B,EAAgB,IAAMA,EAAO,IADhC,QAI9C8nE,GAAc,WAChB,OAAOzH,GAAoB7/E,MAAMokF,OAAS,KAGxCmD,GAAc,WAChB,OAAO1H,GAAoB7/E,MAAMk7E,UAG/BsM,GAAc,WAChB,OAAO3H,GAAoB7/E,MAAMskF,UAG/BmD,GAAU;AACZ,IAAIzzD,EAAM6rD,GAAoB7/E,MAC1BkhB,EAAO8S,EAAI9S,KACX1B,EAAOwU,EAAIxU,KACf,OAAgB,OAAT0B,EAAgB,GACV,OAAT1B,EAAgBwiE,GAAc9gE,GAC9B8gE,GAAc9gE,GAAQ,IAAM1B,GAG9BmoE,GAAc,WAChB,IAAIzmE,EAAO2+D,GAAoB7/E,MAAMkhB,KACrC,OAAgB,OAATA,EAAgB,GAAK8gE,GAAc9gE,IAGxC0mE,GAAU,WACZ,IAAIpoE,EAAOqgE,GAAoB7/E,MAAMwf,KACrC,OAAgB,OAATA,EAAgB,GAAKpb,OAAOob,IAGjCqoE,GAAc,WAChB,IAAI7zD,EAAM6rD,GAAoB7/E,MAC1B4H,EAAOosB,EAAIpsB,KACf,OAAOosB,EAAIwwD,iBAAmB58E,EAAK,GAAKA,EAAKO,OAAS,IAAMP,EAAKF,KAAK,KAAO,IAG3EogF,GAAY,WACd,IAAIhK,EAAQ+B,GAAoB7/E,MAAM89E,MACtC,OAAOA,EAAQ,IAAMA,EAAQ,IAG3BiK,GAAkB,WACpB,OAAOlI,GAAoB7/E,MAAM86E,cAG/BkN,GAAU,WACZ,IAAIpB,EAAW/G,GAAoB7/E,MAAM4mF,SACzC,OAAOA,EAAW,IAAMA,EAAW,IAGjCsB,GAAqB,SAAU1kD,EAAQpuB,GACzC,MAAO,CAAE3U,IAAK+iC,EAAQh+B,IAAK4P;AAAQ9T,cAAc,EAAMJ,YAAY,IAyHrE,GAtHIsC,IACFsJ,GAAiBm7E,GAAc,CAG7BjN,KAAMkN,GAAmBf,IAAc,SAAUnM,GAC/C,IAAIhnD,EAAM6rD,GAAoB7/E,MAC1BinF,EAAY7iF,OAAO42E,GACnBwL,EAAUH,GAASryD,EAAKizD,GAC5B,GAAIT,EAAS,MAAMvkF,UAAUukF,GAC7B5G,GAA6B5rD,EAAI8mD,cAAckD,mBAAmBhqD,EAAI8pD,UAIxEsJ,OAAQc,GAAmBb,IAG3BpmE,SAAUinE,GAAmBZ,IAAa,SAAUrmE,GAClD,IAAI+S,EAAM6rD,GAAoB7/E,MAC9BqmF,GAASryD,EAAK5vB,OAAO6c,GAAY,IAAK+jE,OAIxC9J,SAAUgN,GAAmBX,IAAa,SAAUrM,GAClD,IAAIlnD,EAAM6rD,GAAoB7/E,MAC1B6gF,EAAav8B,GAAUlgD,OAAO82E,IAClC,IAAIqJ,GAA+BvwD,GAAnC,CACAA,EAAIknD,SAAW,GACf,IAAK,IAAI1xE,EAAI,EAAGA,EAAIq3E,EAAW14E,OAAQqB,IACrCwqB,EAAIknD,UAAY+F,GAAcJ,EAAWr3E,GAAI25E,QAKjDmB,SAAU4D,GAAmBV,IAAa,SAAUlD,GAClD,IAAItwD,EAAM6rD,GAAoB7/E,MAC1B6gF,EAAav8B,GAAUlgD,OAAOkgF,IAClC,IAAIC,GAA+BvwD,GAAnC,CACAA,EAAIswD,SAAW;CACf,IAAK,IAAI96E,EAAI,EAAGA,EAAIq3E,EAAW14E,OAAQqB,IACrCwqB,EAAIswD,UAAYrD,GAAcJ,EAAWr3E,GAAI25E,QAKjDjiE,KAAMgnE,GAAmBT,IAAS,SAAUvmE,GAC1C,IAAI8S,EAAM6rD,GAAoB7/E,MAC1Bg0B,EAAIwwD,kBACR6B,GAASryD,EAAK5vB,OAAO8c,GAAOwkE,OAI9BgC,SAAUQ,GAAmBP,IAAa,SAAUD,GAClD,IAAI1zD,EAAM6rD,GAAoB7/E,MAC1Bg0B,EAAIwwD,kBACR6B,GAASryD,EAAK5vB,OAAOsjF,GAAW/B,OAIlCnmE,KAAM0oE,GAAmBN,IAAS,SAAUpoE,GAC1C,IAAIwU,EAAM6rD,GAAoB7/E,MAC1BukF,GAA+BvwD,KAEvB,KADZxU,EAAOpb,OAAOob,IACEwU,EAAIxU,KAAO,KACtB6mE,GAASryD,EAAKxU,EAAMomE,QAI3B7K,SAAUmN,GAAmBL,IAAa,SAAU9M,GAClD,IAAI/mD,EAAM6rD,GAAoB7/E,MAC1Bg0B,EAAIwwD,mBACRxwD,EAAIpsB,KAAO,GACXy+E,GAASryD,EAAK+mD,EAAW,GAAIiL,QAI/BxrD,OAAQ0tD,GAAmBJ,IAAW,SAAUttD,GAC9C,IAAIxG,EAAM6rD,GAAoB7/E;CAEhB,KADdw6B,EAASp2B,OAAOo2B,IAEdxG,EAAI8pD,MAAQ,MAER,KAAOtjD,EAAOhgB,OAAO,KAAIggB,EAASA,EAAO94B,MAAM,IACnDsyB,EAAI8pD,MAAQ,GACZuI,GAASryD,EAAKwG,EAAQ2rD,KAExBvG,GAA6B5rD,EAAI8mD,cAAckD,mBAAmBhqD,EAAI8pD,UAIxEhD,aAAcoN,GAAmBH,IAGjCv4B,KAAM04B,GAAmBF,IAAS,SAAUx4B,GAC1C,IAAIx7B,EAAM6rD,GAAoB7/E,MAElB,KADZwvD,EAAOprD,OAAOorD,KAKV,KAAOA,EAAKh1C,OAAO,KAAIg1C,EAAOA,EAAK9tD,MAAM,IAC7CsyB,EAAI4yD,SAAW,GACfP,GAASryD,EAAKw7B,EAAM42B,KALlBpyD,EAAI4yD,SAAW,UAYvB17E,GAAS+8E,GAAc,UAAU,WAC/B,OAAOd,GAAarmF,KAAKd,QACxB,CAAEkB,YAAY,IAIjBgK,GAAS+8E,GAAc,YAAY,WACjC,OAAOd,GAAarmF,KAAKd,QACxB,CAAEkB,YAAY,IAEby+E,GAAW,CACb,IAAIwI,GAAwBxI,GAAUyI,gBAClCC,GAAwB1I,GAAU2I;CAIlCH,IAAuBj9E,GAAS67E,GAAgB,mBAAmB,SAAyBwB,GAC9F,OAAOJ,GAAsBt4E,MAAM8vE,GAAWz3E,cAK5CmgF,IAAuBn9E,GAAS67E,GAAgB,mBAAmB,SAAyB/yD,GAC9F,OAAOq0D,GAAsBx4E,MAAM8vE,GAAWz3E,cAIlDqH,GAAew3E,GAAgB,OAE/Bx1E,GAAE,CAAE3R,QAAQ,EAAM8L,QAAS6wE,GAAgB5wE,MAAOnI,IAAe,CAC/DmiD,IAAKohC,kDC5+BInnF,GA4oBPovB,mBAzoBqB3nB,OACjBqW,EAAUrW,GAAWA,EAAQqW,SAAW9d,EAAO8d,QAC/C8qE,EAAiBnhF,GAAWA,EAAQmhF,gBAAkB5oF,EAAO4oF,sBAEzD,eACF3oF,EAAaU,OAAOiO,OAAO5O,EAAQ,CACrCo/E,MAAO,CACL39E,WAAOW,EACPT,UAAU,YAQL,SAAU+nB;IAEb1pB,OACqB,IAAfC,GAA8BA,GACrB,oBAATE,MAAwBA,WACb,IAAXH,GAA0BA,EAEhC6oF,EAAU,CACZ3N,aAAc,oBAAqBl7E,EACnC2e,SAAU,WAAY3e,GAAU,aAAc0M,OAC9Ci8E,KACE,eAAgB3oF,GAChB,SAAUA,GACT,0BAEO8oF,MACG,EACP,MAAOn1D,UACA,GALV,GAQHo1D,SAAU,aAAc/oF,EACxBkiC,YAAa,gBAAiBliC,YAGvBgpF,EAAW9+D,UACXA,GAAOuR,SAAS1zB,UAAUk0B,cAAc/R;GAG7C2+D,EAAQ3mD,gBACN+mD,EAAc,CAChB,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,yBAGEC,EACF1tD,YAAYmC,QACZ,SAASzT,UACAA,GAAO++D,EAAYx/E,QAAQ9I,OAAOoH,UAAUnG,SAASV,KAAKgpB,KAAS,YAIvEi/D,EAAc75E,MACD,iBAATA,IACTA,EAAO9K,OAAO8K,IAEZ,6BAA6BhK,KAAKgK,IAAkB,KAATA,QACvC,IAAIjN,UAAU;QAEfiN,EAAKlE,uBAGLg+E,EAAe3nF,SACD,iBAAVA,IACTA,EAAQ+C,OAAO/C,IAEVA,WAIA4nF,EAAYC,OACf18E,EAAW,CACbuL,KAAM,eACA1W,EAAQ6nF,EAAMjxC,cACX,CAACn+B,UAAgB9X,IAAVX,EAAqBA,MAAOA,YAI1ConF,EAAQlqE,WACV/R,EAASF,OAAOE,UAAY,kBACnBA,IAIJA,WAGAkwE,EAAQwC,QACVluE,IAAM,GAEPkuE,aAAmBxC,EACrBwC,EAAQnuE,SAAQ,SAAS1P,EAAO6N,QACzBwvE,OAAOxvE,EAAM7N,KACjBrB,MACM0M,MAAMD,QAAQyyE,GACvBA,EAAQnuE,SAAQ,SAASu7B,QAClBoyC,OAAOpyC,EAAO,GAAIA,EAAO,MAC7BtsC,MACMk/E,GACT3+E,OAAOsJ,oBAAoBq1E,GAASnuE,SAAQ,SAAS7B,QAC9CwvE,OAAOxvE,EAAMgwE,EAAQhwE,MACzBlP,eAgEEmpF,EAASlK;GACZA,EAAKmK,gBACA1rE,EAAQ2F,OAAO,IAAIphB,UAAU,iBAEtCg9E,EAAKmK,UAAW,WAGTC,EAAgBC,UAChB,IAAI5rE,GAAQ,SAASqF,EAASM,GACnCimE,EAAOC,OAAS,WACdxmE,EAAQumE,EAAO7/E,SAEjB6/E,EAAOE,QAAU,WACfnmE,EAAOimE,EAAOlpF,oBAKXqpF,EAAsBlB,OACzBe,EAAS,IAAII,WACbxnE,EAAUmnE,EAAgBC,UAC9BA,EAAOK,kBAAkBpB,GAClBrmE,WAGA0nE,EAAerB,OAClBe,EAAS,IAAII,WACbxnE,EAAUmnE,EAAgBC,UAC9BA,EAAOO,WAAWtB,GACXrmE,WAGA4nE,EAAsBtjD,WACzBtG,EAAO,IAAI/D,WAAWqK,GACtBujD,EAAQ,IAAIr9E,MAAMwzB,EAAK/3B,QAElBqB,EAAI,EAAGA,EAAI02B,EAAK/3B,OAAQqB,IAC/BugF,EAAMvgF,GAAKpF,OAAOk0C,aAAapY,EAAK12B,WAE/BugF,EAAMriF,KAAK,aAGXsiF,EAAYxjD;GACfA,EAAI9kC,aACC8kC,EAAI9kC,MAAM,OAEbw+B,EAAO,IAAI/D,WAAWqK,EAAIlG,mBAC9BJ,EAAK16B,IAAI,IAAI22B,WAAWqK,IACjBtG,EAAK1B,gBAIPyrD,gBACFb,UAAW,OAEXc,UAAY,SAASjL,QAWnBmK,SAAWppF,KAAKopF,cAChBe,UAAYlL;AACZA,EAEsB,iBAATA,OACXmL,UAAYnL,EACRwJ,EAAQF,MAAQG,KAAK/gF,UAAUk0B,cAAcojD,QACjDoL,UAAYpL,EACRwJ,EAAQE,UAAY2B,SAAS3iF,UAAUk0B,cAAcojD,QACzDsL,cAAgBtL,EACZwJ,EAAQ3N,cAAgBG,gBAAgBtzE,UAAUk0B,cAAcojD,QACpEmL,UAAYnL,EAAKz9E,WACbinF,EAAQ3mD,aAAe2mD,EAAQF,MAAQK,EAAW3J,SACtDuL,iBAAmBR,EAAY/K,EAAKzgD;KAEpC2rD,UAAY,IAAIzB,KAAK,CAAC1oF,KAAKwqF,oBACvB/B,EAAQ3mD,cAAgB1G,YAAYzzB,UAAUk0B,cAAcojD,IAAS6J,EAAkB7J,SAC3FuL,iBAAmBR,EAAY/K,QAE/BmL,UAAYnL,EAAO1+E,OAAOoH,UAAUnG,SAASV,KAAKm+E,QAhBlDmL,UAAY;AAmBdpqF,KAAKk/E,QAAQz+E,IAAI,kBACA,iBAATw+E,OACJC,QAAQ15E,IAAI,eAAgB,4BACxBxF,KAAKqqF,WAAarqF,KAAKqqF,UAAUrjF,UACrCk4E,QAAQ15E,IAAI,eAAgBxF,KAAKqqF,UAAUrjF,MACvCyhF,EAAQ3N,cAAgBG,gBAAgBtzE,UAAUk0B,cAAcojD,SACpEC,QAAQ15E,IAAI,eAAgB,qDAKnCijF,EAAQF,YACLA,KAAO,eACNkC,EAAWtB,EAASnpF,SACpByqF,SACKA,KAGLzqF,KAAKqqF,iBACA3sE,EAAQqF,QAAQ/iB,KAAKqqF;CACvB,GAAIrqF,KAAKwqF,wBACP9sE,EAAQqF,QAAQ,IAAI2lE,KAAK,CAAC1oF,KAAKwqF,oBACjC,GAAIxqF,KAAKuqF,oBACR,IAAI5/D,MAAM,+CAETjN,EAAQqF,QAAQ,IAAI2lE,KAAK,CAAC1oF,KAAKoqF,mBAIrCtoD,YAAc;OACb9hC,KAAKwqF,iBACUrB,EAASnpF,QAItBo7B,YAAYmC,OAAOv9B,KAAKwqF,kBACnB9sE,EAAQqF,QACb/iB,KAAKwqF,iBAAiBhsD,OAAO98B,MAC3B1B,KAAKwqF,iBAAiBjqD,WACtBvgC,KAAKwqF,iBAAiBjqD,WAAavgC,KAAKwqF,iBAAiBlqD,aAItD5iB,EAAQqF,QAAQ/iB,KAAKwqF,mBAGvBxqF,KAAKuoF,OAAOpmE,KAAKsnE,UAKzBzyC,KAAO,eACNyzC,EAAWtB,EAASnpF,SACpByqF,SACKA,KAGLzqF,KAAKqqF,iBACAT,EAAe5pF,KAAKqqF,WACtB,GAAIrqF,KAAKwqF,wBACP9sE,EAAQqF,QAAQ+mE,EAAsB9pF,KAAKwqF;CAC7C,GAAIxqF,KAAKuqF,oBACR,IAAI5/D,MAAM,+CAETjN,EAAQqF,QAAQ/iB,KAAKoqF,YAI5B3B,EAAQE,gBACLA,SAAW,kBACP3oF,KAAKg3C,OAAO70B,KAAKw4D,UAIvB+P,KAAO,kBACH1qF,KAAKg3C,OAAO70B,KAAK/E,KAAKmvD,QAGxBvsE,KAlOT08E,EAAQ/0E,UAAU+2E,OAAS,SAASxvE,EAAM7N,GACxC6N,EAAO65E,EAAc75E,GACrB7N,EAAQ2nF,EAAe3nF,OACnBspF,EAAW3qF,KAAKgR,IAAI9B,QACnB8B,IAAI9B,GAAQy7E,EAAWA,EAAW,KAAOtpF,EAAQA,GAGxDq7E,EAAQ/0E,UAAR,OAA8B,SAASuH,UAC9BlP,KAAKgR,IAAI+3E,EAAc75E,KAGhCwtE,EAAQ/0E,UAAUlH,IAAM,SAASyO,UAC/BA,EAAO65E,EAAc75E,GACdlP,KAAK8C,IAAIoM,GAAQlP,KAAKgR,IAAI9B,GAAQ,MAG3CwtE,EAAQ/0E,UAAU7E,IAAM,SAASoM;OACxBlP,KAAKgR,IAAInO,eAAekmF,EAAc75E,KAG/CwtE,EAAQ/0E,UAAUnC,IAAM,SAAS0J,EAAM7N,QAChC2P,IAAI+3E,EAAc75E,IAAS85E,EAAe3nF,IAGjDq7E,EAAQ/0E,UAAUoJ,QAAU,SAASguE,EAAU6L,OACxC,IAAI17E,KAAQlP,KAAKgR,IAChBhR,KAAKgR,IAAInO,eAAeqM,IAC1B6vE,EAASj+E,KAAK8pF,EAAS5qF,KAAKgR,IAAI9B,GAAOA,EAAMlP,OAKnD08E,EAAQ/0E,UAAU7B,KAAO,eACnBojF,EAAQ,eACPn4E,SAAQ,SAAS1P,EAAO6N,GAC3Bg6E,EAAM9jF,KAAK8J,MAEN+5E,EAAYC,IAGrBxM,EAAQ/0E,UAAU8R,OAAS,eACrByvE,EAAQ,eACPn4E,SAAQ,SAAS1P,GACpB6nF,EAAM9jF,KAAK/D,MAEN4nF,EAAYC,IAGrBxM,EAAQ/0E,UAAU6R,QAAU,eACtB0vE,EAAQ,eACPn4E,SAAQ,SAAS1P,EAAO6N,GAC3Bg6E,EAAM9jF,KAAK,CAAC8J,EAAM7N,OAEb4nF,EAAYC;AAGjBT,EAAQlqE,WACVm+D,EAAQ/0E,UAAU2E,OAAOE,UAAYkwE,EAAQ/0E,UAAU6R,aA6KrDT,EAAU,CAAC,SAAU,MAAO,OAAQ,UAAW,OAAQ,gBAElD8xE,EAAgB5iF,OACnB6iF,EAAU7iF,EAAO2vE,qBACd7+D,EAAQ1P,QAAQyhF,IAAY,EAAIA,EAAU7iF,WAG1C8iF,EAAQzoF,EAAO+E,QAChBrH,gBAAgB+qF,SACd,IAAI9oF,UAAU,kGAIlBg9E,GADJ53E,EAAUA,GAAW,IACF43E,QAEf38E,aAAiByoF,EAAS,IACxBzoF,EAAM8mF,eACF,IAAInnF,UAAU,qBAEjB+xB,IAAM1xB,EAAM0xB,SACZg3D,YAAc1oF,EAAM0oF;AACpB3jF,EAAQ63E,eACNA,QAAU,IAAIxC,EAAQp6E,EAAM48E,eAE9Bj3E,OAAS3F,EAAM2F,YACf3C,KAAOhD,EAAMgD,UACb2lF,OAAS3oF,EAAM2oF,OACfhM,GAA2B,MAAnB38E,EAAM6nF,YACjBlL,EAAO38E,EAAM6nF,UACb7nF,EAAM8mF,UAAW,aAGdp1D,IAAM5vB,OAAO9B,WAGf0oF,YAAc3jF,EAAQ2jF,aAAehrF,KAAKgrF,aAAe,eAC1D3jF,EAAQ63E,SAAYl/E,KAAKk/E,eACtBA,QAAU,IAAIxC,EAAQr1E,EAAQ63E,eAEhCj3E,OAAS4iF,EAAgBxjF,EAAQY,QAAUjI,KAAKiI,QAAU,YAC1D3C,KAAO+B,EAAQ/B,MAAQtF,KAAKsF,MAAQ,UACpC2lF,OAAS5jF,EAAQ4jF,QAAUjrF,KAAKirF,YAChCC,SAAW;CAEK,QAAhBlrF,KAAKiI,QAAoC,SAAhBjI,KAAKiI,SAAsBg3E,QACjD,IAAIh9E,UAAU,qDAEjBioF,UAAUjL,KAEK,QAAhBj/E,KAAKiI,QAAoC,SAAhBjI,KAAKiI,QACV,aAAlBZ,EAAQ8jF,OAA0C,aAAlB9jF,EAAQ8jF,OAAsB,KAE5DC,EAAgB,mBAChBA,EAAclmF,KAAKlF,KAAKg0B,UAErBA,IAAMh0B,KAAKg0B,IAAIjpB,QAAQqgF,EAAe,QAAS,IAAI9nC,MAAO+nC,eAC1D,KAEDC,EAAgB,UACft3D,MAAQs3D,EAAcpmF,KAAKlF,KAAKg0B,KAAO,IAAM,KAAO,MAAO,IAAIsvB,MAAO+nC,qBAU1E1Q,EAAOsE,OACVsM,EAAO,IAAIjB,gBACfrL,EACGrpD,OACA/zB,MAAM,KACNkP,SAAQ,SAASstB,MACZA,EAAO;IACLx8B,EAAQw8B,EAAMx8B,MAAM,KACpBqN,EAAOrN,EAAMo2C,QAAQltC,QAAQ,MAAO,KACpC1J,EAAQQ,EAAM6F,KAAK,KAAKqD,QAAQ,MAAO,KAC3CwgF,EAAK7M,OAAOvB,mBAAmBjuE,GAAOiuE,mBAAmB97E,QAGxDkqF,WAGAC,EAAaC,OAChBvM,EAAU,IAAIxC,SAGQ+O,EAAW1gF,QAAQ,eAAgB,KAK1DlJ,MAAM,MACNmP,KAAI,SAASs7B,UACoB,IAAzBA,EAAOjjC,QAAQ,MAAcijC,EAAOo/C,OAAO,EAAGp/C,EAAOnkC,QAAUmkC,KAEvEv7B,SAAQ,SAAS46E,OACZlR,EAAQkR,EAAK9pF,MAAM,KACnBmB,EAAMy3E,EAAMxiC,QAAQriB,UACpB5yB,EAAK,KACH3B,EAAQo5E,EAAM/yE,KAAK,KAAKkuB,OAC5BspD,EAAQR,OAAO17E,EAAK3B,OAGnB69E,WAKA0M,EAASC,EAAUxkF;KACpBrH,gBAAgB4rF,SACd,IAAI3pF,UAAU,8FAEjBoF,IACHA,EAAU,SAGPL,KAAO,eACP2uC,YAA4B3zC,IAAnBqF,EAAQsuC,OAAuB,IAAMtuC,EAAQsuC,YACtD9vB,GAAK7lB,KAAK21C,QAAU,KAAO31C,KAAK21C,OAAS,SACzCm2C,WAAa,eAAgBzkF,EAAUA,EAAQykF,WAAa,QAC5D5M,QAAU,IAAIxC,EAAQr1E,EAAQ63E,cAC9BlrD,IAAM3sB,EAAQ2sB,KAAO,QACrBk2D,UAAU2B,GA5DjBd,EAAQpjF,UAAU2qD,MAAQ,kBACjB,IAAIy4B,EAAQ/qF,KAAM,CAACi/E,KAAMj/E,KAAKmqF,aA2CvCF,EAAKnpF,KAAKiqF,EAAQpjF,WAmBlBsiF,EAAKnpF,KAAK8qF,EAASjkF;AAEnBikF,EAASjkF,UAAU2qD,MAAQ,kBAClB,IAAIs5B,EAAS5rF,KAAKmqF,UAAW,CAClCx0C,OAAQ31C,KAAK21C,OACbm2C,WAAY9rF,KAAK8rF,WACjB5M,QAAS,IAAIxC,EAAQ18E,KAAKk/E,SAC1BlrD,IAAKh0B,KAAKg0B,OAId43D,EAASxrF,MAAQ,eACX2rF,EAAW,IAAIH,EAAS,KAAM,CAACj2C,OAAQ,EAAGm2C,WAAY,YAC1DC,EAAS/kF,KAAO,QACT+kF,OAGLC,EAAmB,CAAC,IAAK,IAAK,IAAK,IAAK,KAE5CJ,EAASK,SAAW,SAASj4D,EAAK2hB,OACU,IAAtCq2C,EAAiB3iF,QAAQssC,SACrB,IAAIhY,WAAW,8BAGhB,IAAIiuD,EAAS,KAAM,CAACj2C,OAAQA,EAAQupC,QAAS,CAACh/D,SAAU8T,MAGjE1K,EAAQ4iE,aAAetsF,EAAOssF,qBAExB5iE,EAAQ4iE,aACZ,MAAOniE,GACPT,EAAQ4iE,aAAe,SAASlV,EAAS9nE;KAClC8nE,QAAUA,OACV9nE,KAAOA,MACR9O,EAAQuqB,MAAMqsD,QACbmV,MAAQ/rF,EAAM+rF,OAErB7iE,EAAQ4iE,aAAavkF,UAAYpH,OAAOiO,OAAOmc,MAAMhjB,WACrD2hB,EAAQ4iE,aAAavkF,UAAUuI,YAAcoZ,EAAQ4iE,sBAG9ClN,EAAM18E,EAAOu3B,UACb,IAAInc,GAAQ,SAASqF,EAASM,OAC/B+oE,EAAU,IAAIrB,EAAQzoF,EAAOu3B,MAE7BuyD,EAAQnB,QAAUmB,EAAQnB,OAAOoB,eAC5BhpE,EAAO,IAAIiG,EAAQ4iE,aAAa,UAAW,mBAGhDI,EAAM,IAAI9D,WAEL+D,IACPD,EAAIE,iBAkCGC,EAAOz4D,aAEG,KAARA,GAAcp0B,EAAOsgB,SAAS86D,KAAOp7E,EAAOsgB,SAAS86D,KAAOhnD,EACnE,MAAOT,UACAS,GAnCXs4D,EAAI/C,OAAS,eACPliF,EAAU,CACZsuC,OAAQ22C,EAAI32C;AACZm2C,WAAYQ,EAAIR,WAChB5M,QAASsM,EAAac,EAAII,yBAA2B,KAEvDrlF,EAAQ2sB,IAAM,gBAAiBs4D,EAAMA,EAAIK,YAActlF,EAAQ63E,QAAQz+E,IAAI,qBACvEw+E,EAAO,aAAcqN,EAAMA,EAAIP,SAAWO,EAAIM,aAClDjrE,YAAW,WACToB,EAAQ,IAAI6oE,EAAS3M,EAAM53E,MAC1B,IAGLilF,EAAI9C,QAAU,WACZ7nE,YAAW,WACT0B,EAAO,IAAIphB,UAAU,6BACpB,IAGLqqF,EAAIO,UAAY,WACdlrE,YAAW,WACT0B,EAAO,IAAIphB,UAAU,6BACpB,IAGLqqF,EAAIQ,QAAU,WACZnrE,YAAW;AACT0B,EAAO,IAAIiG,EAAQ4iE,aAAa,UAAW,iBAC1C,IAWLI,EAAIj+E,KAAK+9E,EAAQnkF,OAAQwkF,EAAOL,EAAQp4D,MAAM,GAElB,YAAxBo4D,EAAQpB,YACVsB,EAAIS,iBAAkB,EACW,SAAxBX,EAAQpB,cACjBsB,EAAIS,iBAAkB,GAGpB,iBAAkBT,IAChB7D,EAAQF,KACV+D,EAAIU,aAAe,OAEnBvE,EAAQ3mD,aACRsqD,EAAQlN,QAAQz+E,IAAI,kBACyD,IAA7E2rF,EAAQlN,QAAQz+E,IAAI,gBAAgB4I,QAAQ,8BAE5CijF,EAAIU,aAAe,iBAInBnzD,GAAgC,WAAxB1N,EAAO0N,EAAKqlD,UAA0BrlD,EAAKqlD,mBAAmBxC,EAKxE0P,EAAQlN,QAAQnuE,SAAQ,SAAS1P,EAAO6N,GACtCo9E,EAAIW,iBAAiB/9E,EAAM7N;IAL7Bd,OAAOsJ,oBAAoBgwB,EAAKqlD,SAASnuE,SAAQ,SAAS7B,GACxDo9E,EAAIW,iBAAiB/9E,EAAM85E,EAAenvD,EAAKqlD,QAAQhwE,QAQvDk9E,EAAQnB,SACVmB,EAAQnB,OAAOzpE,iBAAiB,QAAS+qE,GAEzCD,EAAIY,mBAAqB,WAEA,IAAnBZ,EAAIa,YACNf,EAAQnB,OAAOmC,oBAAoB,QAASb,KAKlDD,EAAIe,UAAkC,IAAtBjB,EAAQjC,UAA4B,KAAOiC,EAAQjC,cAIvEnL,EAAMsO,UAAW,EAEZ1tF,EAAOo/E,QACVp/E,EAAOo/E,MAAQA,EACfp/E,EAAO88E,QAAUA,EACjB98E,EAAOmrF,QAAUA,EACjBnrF,EAAOgsF,SAAWA,GAGpBtiE,EAAQozD,QAAUA,EAClBpzD,EAAQyhE,QAAUA,EAClBzhE,EAAQsiE,SAAWA,EACnBtiE,EAAQ01D,MAAQA,EAEhBz+E,OAAOC,eAAe8oB,EAAS,aAAc,CAAEjoB,OAAO,IAxmBSksF,CAAQjkE,GA6mBlE,CACL01D,MAAOn/E,EAAWm/E,MAClBtC,QAAS78E,EAAW68E;AACpBqO,QAASlrF,EAAWkrF,QACpBa,SAAU/rF,EAAW+rF,SACrBM,aAAcrsF,EAAWqsF,cA3nBrB,KAyoBY,oBAAfrsF,WAA6BA,WAA6B,oBAATE,KAAuBA,KAAuCH,wCC/iBxH,SAAS4tF,GAASjqF,UACPA,aAAa44B,WAExB,SAASsxD,GAAWljD,EAAMmjD,OAChBpzE,EAAOiwB,EAAOA,EAAKjK,WAAaotD,GAAY,SACvC,KAAPpzE,GAAgBA,GAAQ,EACxB,MAAM,IAAIqQ,MAAM,sEACpB4f,EAAOA,GAAQ,IAAIpO,WAAW,IAAIf,YAAY9gB,IAGlD,SAASqzE,GAAYpjD,EAAMqjD,EAAMljF,EAAMmjF,EAAMC,OACnCC,EAAOxjD,EAAKpiC,OAASylF,EACrBI,EAAOD,EAAOD,EAAOC,EAAOD;QAClCvjD,EAAK/kC,IAAIkF,EAAK6hC,SAASshD,EAAMA,EAAOG,GAAOJ,GACpCI,EAEX,SAASC,gCAAathF,2BAAAA,0BACZuhF,EAAcvhF,EAAIwhF,QAAO,SAACC,EAAK7wC,UAAS6wC,EAAM7wC,EAAKp1C,SAAQ,GAC3DkuC,EAAM,IAAIla,WAAW+xD,GACvBG,EAAS,EACJ7kF,EAAI,EAAGA,EAAImD,EAAIxE,OAAQqB,IAC5B6sC,EAAI7wC,IAAImH,EAAInD,GAAI6kF,GAChBA,GAAU1hF,EAAInD,GAAGrB,cAEdkuC,MAYLi4C,mFACax4E,2BAAAA,sDACFA,gBAFkB6U,QAK7B4jE;qCACaz4E,2BAAAA,sDACFA,gBAFW6U,QAWxB6jE,GAAU,eAURC,EAAOC,EALPC,GAAa,WAsCRC,EAAKrrF,EAAGoM,OACXC,EAAI6+E,GAAOC,EAAMnrF,GAAKmrF,EAAM/+E,IAAM,YAC5B,IAANpM,GAAiB,IAANoM,IAASC,EAAI,GACrBA,MAwBLi/E,EAKAC,EAKAC,EAKAC,EAtBAC,GAAgB,WA2BXC,aAIEC,EAAG5rF,OACNqM,EAAG8f,EAAG1L,MACV0L,EAAI1L,WA1CMzgB,OACRiG,EAAIilF,EAAM,IAAMC,EAAMnrF,WAChB,IAANA,IAASiG,EAAI,GACVA,EAuCG4lF,CAAK7rF,GACRqM,EAAI,EAAGA,EAAI,EAAGA,IAEjBoU,GADA0L,EAA6B,KAAvBA,GAAK,EAAMA,IAAM,UAGzB1L,GAAK,GAVF2qE,cA3ELF,EAAQ,GACNC,EAAQ,OAEC9+E,EAAG43C,EAAVjkD,EAAI,MACHqM,EAAI,EAAGA,EAAI,IAAKA,IACnB6+E,EAAM7+E,GAAKrM,EAGXikD,EAAQ,IAAJjkD,EAAUA,IAAM,EAAGA,GAAK;AAClB,MAANikD,IAAYjkD,GAAK,IACrBA,GAAKkrF,EAAM7+E,GAGX8+E,EAAMD,EAAM7+E,IAAMA,EAEpB6+E,EAAM,KAAOA,EAAM,GACnBC,EAAM,GAAK,EAEXC,GAAa,EAyDIU,GAejBR,EAAW,GACTC,EAAW,GACXC,EAAU,CAAC,GAAI,GAAI,GAAI,IACvBC,EAAU,CAAC,GAAI,GAAI,GAAI,QAEpB,IAAIxlF,EAAI,EAAGA,EAAI,IAAKA,IAAK,KACxBkmB,EAAIy/D,EAAG3lF,GAGXqlF,EAASrlF,GAAKkmB,EACdo/D,EAASp/D,GAAKlmB,EAGdulF,EAAQ,GAAGvlF,GAAMolF,EAAK,EAAGl/D,IAAM,GAAOA,GAAK,GAAOA,GAAK,EAAKk/D,EAAK,EAAGl/D,GACpEs/D,EAAQ,GAAGt/D,GAAMk/D,EAAK,GAAIplF,IAAM,GAAOolF,EAAK,EAAGplF,IAAM,GAAOolF,EAAK,GAAIplF,IAAM,EAAKolF,EAAK,GAAIplF,OAEpF,IAAIulC,EAAI,EAAGA,EAAI,EAAGA,IACrBggD,EAAQhgD,GAAGvlC,GAAMulF,EAAQhgD,EAAI,GAAGvlC,KAAO,EAAMulF,EAAQhgD,EAAI,GAAGvlC,IAAM,GAClEwlF,EAAQjgD,GAAGrf,GAAMs/D,EAAQjgD,EAAI,GAAGrf,KAAO,EAAMs/D,EAAQjgD,EAAI,GAAGrf,IAAM,GAItEu/D,GAAgB,MA0BdroE,EAAU,SAAU0oE,EAAS9wD,GAE1BywD,GAAeC,QAGhB3kD,EAAO,IAAIhO,YAAYiC,GAC3B+L,EAAK/kC,IAAIqpF,EAAU,KACnBtkD,EAAK/kC,IAAIspF,EAAU,SACd,IAAItlF,EAAI,EAAGA,EAAI,EAAGA,IACrB+gC,EAAK/kC,IAAIupF,EAAQvlF,GAAK,KAAS,KAAQA,GAAM,GAC7C+gC,EAAK/kC,IAAIwpF,EAAQxlF,GAAK,KAAS,KAAQA,GAAM;KAyD3C+lF,EAAM,SAAUC,EAAQF,EAAS9wD,iBAG/BixD,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAC/BC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAC7BC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAC7BC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAC7BC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAC7BxoE,EAAI,MAEFyoE,EAAO,IAAIrB,EAAOjzD,YAAYiC,GAChCsyD,EAAO,IAAItB,EAAOrzD,WAAWqC,YAatBuyD,EAAM5nE,EAAGuG,EAAGqf,EAAG9nB,EAAG+pE,EAAIxwB,EAAIrb,EAAI8rC,GACrC9nE,EAAIA,EAAI,EACRuG,EAAIA,EAAI,EACRqf,EAAIA,EAAI,EACR9nB,EAAIA,EAAI,EACR+pE,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,MAEN/iB,EAAK,EAAGC,EAAK,EAAG+iB,EAAK,EACvBC,EAAK,EAAG9lB,EAAK,EAAGC,EAAK,EAAG8lB,EAAK,EAC7B5nF,EAAI,EAEN0kE,EAAKn/B,EAAI,MAAOo/B,EAAKp/B,EAAI,MAAOmiD,EAAKniD,EAAI,MAGzCiiD,EAAKA,EAAKH,GAAM1nE,EAAI,IAAM,GACxBq3C,EAAKA,EAAKqwB,GAAM1nE,EAAI,IAAM,GAC1Bg8B,EAAKA,EAAK0rC,GAAM1nE,EAAI,IAAM,GAC1B8nE,EAAKA,EAAKJ,GAAM1nE,EAAI,KAAO,OAGxB3f,EAAI,IAAKA,EAAI,IAAOyd,GAAK,EAAIzd,EAAKA,EAAI,GAAM,EAAG;AAClD2nF,EAAKN,GAAM9hD,EAAIiiD,GAAM,GAAK,OAAS,GAAKH,GAAM3iB,EAAK1N,GAAM,GAAK,OAAS,GAAKqwB,GAAM1iB,EAAKhpB,GAAM,EAAI,OAAS,GAAK0rC,GAAMK,EAAKD,GAAM,EAAI,OAAS,GAAKJ,GAAM1nE,EAAI3f,EAAI,IAAM,GACpK6hE,EAAKwlB,GAAM9hD,EAAIyxB,GAAM,GAAK,OAAS,GAAKqwB,GAAM3iB,EAAK/oB,GAAM,GAAK,OAAS,GAAK0rC,GAAM1iB,EAAK8iB,GAAM,EAAI,OAAS,GAAKJ,GAAMK,EAAKF,GAAM,EAAI,OAAS,GAAKH,GAAM1nE,EAAI3f,EAAI,IAAM,GACtK8hE,EAAKulB,GAAM9hD,EAAIoW,GAAM,GAAK,OAAS,GAAK0rC,GAAM3iB,EAAK+iB,GAAM,GAAK,OAAS,GAAKJ,GAAM1iB,EAAK6iB,GAAM,EAAI,OAAS,GAAKH,GAAMK,EAAK1wB,GAAM,EAAI,OAAS,GAAKqwB,GAAM1nE,EAAI3f,EAAI,IAAM,GACtK4nF,EAAKP,GAAM9hD,EAAIkiD,GAAM,GAAK,OAAS,GAAKJ,GAAM3iB,EAAK8iB,GAAM,GAAK,OAAS,GAAKH,GAAM1iB,EAAK3N,GAAM,EAAI,OAAS,GAAKqwB,GAAMK,EAAK/rC,GAAM,EAAI,OAAS,GAAK0rC,GAAM1nE,EAAI3f,EAAI,KAAO,GACzKwnF,EAAKG,EAAI3wB,EAAK6K,EAAIlmB,EAAKmmB,EAAI2lB,EAAKG;AAIlC3B,EAAKoB,GAAMnhE,EAAIshE,GAAM,GAAK,OAAS,IAAM,GAAKH,GAAMnhE,EAAI8wC,GAAM,GAAK,OAAS,IAAM,GAAKqwB,GAAMnhE,EAAIy1B,GAAM,EAAI,OAAS,IAAM,EAAI0rC,GAAMnhE,EAAIuhE,GAAM,EAAI,OAAS,GAAKJ,GAAM1nE,EAAI3f,EAAI,IAAM,GAClLkmF,EAAKmB,GAAMnhE,EAAI8wC,GAAM,GAAK,OAAS,IAAM,GAAKqwB,GAAMnhE,EAAIy1B,GAAM,GAAK,OAAS,IAAM,GAAK0rC,GAAMnhE,EAAIuhE,GAAM,EAAI,OAAS,IAAM,EAAIJ,GAAMnhE,EAAIshE,GAAM,EAAI,OAAS,GAAKH,GAAM1nE,EAAI3f,EAAI,IAAM,GACpLmmF,EAAKkB,GAAMnhE,EAAIy1B,GAAM,GAAK,OAAS,IAAM,GAAK0rC,GAAMnhE,EAAIuhE,GAAM,GAAK,OAAS,IAAM,GAAKJ,GAAMnhE,EAAIshE,GAAM,EAAI,OAAS,IAAM,EAAIH,GAAMnhE,EAAI8wC,GAAM,EAAI,OAAS,GAAKqwB,GAAM1nE,EAAI3f,EAAI,IAAM,GACpLomF,EAAKiB,GAAMnhE,EAAIuhE,GAAM,GAAK,OAAS,IAAM,GAAKJ,GAAMnhE,EAAIshE,GAAM,GAAK,OAAS,IAAM,GAAKH,GAAMnhE,EAAI8wC,GAAM,EAAI,OAAS,IAAM,EAAIqwB,GAAMnhE,EAAIy1B,GAAM,EAAI,OAAS,GAAK0rC,GAAM1nE,EAAI3f,EAAI,KAAO,YAUhL6nF,EAASL,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK;CAEVF,EACE,OAAQ,OAAQ,OAChB3oE,EACA4oE,EACAxwB,EACArb,EACA8rC,YAWKK,EAASN,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,MAENliD,EAAI,EAERgiD,EACE,OAAQ,OAAQ,OAChB3oE,EACA4oE,EACAC,EACA9rC,EACAqb,GAGFzxB,EAAI2gD,EAAIA,EAAKE,EAAIA,EAAK7gD,WAWfwiD,EAASP,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,EAEVF,EACE,OAAQ,OAAQ,OAChB3oE,EACAynE,EAAKmB,EACLlB,EAAKtvB,EACLuvB,EAAK5qC,EACL6qC,EAAKiB,GAGPpB,EAAKJ,EACHK,EAAKJ,EACLK,EAAKJ,EACLK,EAAKJ,WAUA4B,EAASR,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,MAENliD,EAAI,EAERgiD,EACE,OAAQ,OAAQ,OAChB3oE,EACA4oE,EACAC,EACA9rC,EACAqb,GAGFzxB,EAAI2gD,EAAIA,EAAKE,EAAIA,EAAK7gD,EAEtB0gD,EAAKA,EAAKI,EACRH,EAAKA,EAAKI,EACVH,EAAKA,EAAKI,EACVH,EAAKA,EAAKI,EAEZH,EAAKmB,EACHlB,EAAKtvB,EACLuvB,EAAK5qC,EACL6qC,EAAKiB,WAUAQ,EAAST,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,EAEVF,EACE,OAAQ,OAAQ,OAChB3oE,EACAynE,EACAC,EACAC,EACAC,GAGFH,EAAKJ,EAAKA,EAAKuB,EACblB,EAAKJ,EAAKA,EAAKlvB,EACfuvB,EAAKJ,EAAKA,EAAKxqC,EACf6qC,EAAKJ,EAAKA,EAAKqB;SAWVS,EAASV,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,EAEVF,EACE,OAAQ,OAAQ,OAChB3oE,EACAynE,EACAC,EACAC,EACAC,GAGFP,EAAKA,EAAKuB,EACRtB,EAAKA,EAAKlvB,EACVmvB,EAAKA,EAAKxqC,EACVyqC,EAAKA,EAAKqB,EAEZpB,EAAKmB,EACHlB,EAAKtvB,EACLuvB,EAAK5qC,EACL6qC,EAAKiB,WAUAU,EAAKX,EAAIxwB,EAAIrb,EAAI8rC,GACxBD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,EAEVF,EACE,OAAQ,OAAQ,OAChB3oE,EACAynE,EACAC,EACAC,EACAC,GAGFH,EAAKJ,EACHK,EAAKJ,EACLK,EAAKJ,EACLK,EAAKJ,EAEPH,EAAKA,EAAKuB,EACRtB,EAAKA,EAAKlvB,EACVmvB,EAAKA,EAAKxqC,EACVyqC,EAAKA,EAAKqB,WAULW,EAAKZ,EAAIxwB,EAAIrb,EAAI8rC,GACxBD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK,EAEVF,EACE,OAAQ,OAAQ,OAChB3oE,EACA6nE,EACAC,EACAC,EACAC,GAGFA,GAAOI,EAAKJ,EAAMI,EAAMJ,EAAK,EAC3BD,GAAOI,EAAKJ,EAAMI,EAAMJ,IAAOC,EAAK,IAAM,GAC1CF,GAAOI,EAAKJ,EAAMI,EAAMJ,IAAOC,EAAK,IAAM,GAC1CF,GAAOI,EAAKJ,EAAMI,EAAMJ,IAAOC,EAAK,IAAM,GAE5CT,EAAKA,EAAKuB,EACRtB,EAAKA,EAAKlvB,EACVmvB,EAAKA,EAAKxqC,EACVyqC,EAAKA,EAAKqB,WAULY,EAASb,EAAIxwB,EAAIrb,EAAI8rC,GAC5BD,EAAKA,EAAK,EACVxwB,EAAKA,EAAK,EACVrb,EAAKA,EAAK,EACV8rC,EAAKA,EAAK;KAENE,EAAK,EAAG9lB,EAAK,EAAGC,EAAK,EAAG8lB,EAAK,EAC/BU,EAAK,EAAGC,EAAK,EAAGzkB,EAAK,EAAGqC,EAAK,EAC7BnmE,EAAI,EAAGoG,EAAI,EAEbohF,EAAKA,EAAKnB,EACRrvB,EAAKA,EAAKsvB,EACV3qC,EAAKA,EAAK4qC,EACVkB,EAAKA,EAAKjB,EAEZmB,EAAKV,EAAK,EACRplB,EAAKqlB,EAAK,EACVplB,EAAKqlB,EAAK,EACVS,EAAKR,EAAK,QAEJpnF,EAAI,GAAK,IAAKA,EAAKA,EAAI,EAAK,EAAG,IACjC2nF,IAAO,GAAI,CACbW,EAAKA,EAAKd,EACRe,EAAKA,EAAKvxB,EACV8M,EAAKA,EAAKnoB,EACVwqB,EAAKA,EAAKshB,EAGdE,EAAMA,GAAM,EAAM9lB,IAAO,GACvBA,EAAMA,GAAM,EAAMC,IAAO,GACzBA,EAAMA,GAAM,EAAM8lB,IAAO,GACzBA,EAAMA,GAAM,EAEdxhF,EAAIqhF,EAAK,EAETA,EAAMA,IAAO,EAAM9rC,GAAM,GACvBA,EAAMA,IAAO,EAAMqb,GAAM,GACzBA,EAAMA,IAAO,EAAMwwB,GAAM,GACzBA,EAAMA,IAAO,KAEXphF,EAAGohF,EAAKA,EAAK,WAGnBnB,EAAKiC,EACHhC,EAAKiC,EACLhC,EAAKziB,EACL0iB,EAAKrgB,WASAqiB,EAAW/qE,GAClBA,EAAIA,EAAI,EACRmB,EAAInB,WAYGgrE,EAAUC,EAAI1jD,EAAIC,EAAI0jD,GAC7BD,EAAKA,EAAK,EACV1jD,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACV0jD,EAAKA,EAAK,EAEV1C,EAAKyC,EACHxC,EAAKlhD,EACLmhD,EAAKlhD,EACLmhD,EAAKuC,WAYAC,EAAOC,EAAIC,EAAIC,EAAIC,GAC1BH,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACVC,EAAKA,EAAK,EAEV3C,EAAKwC,EACHvC,EAAKwC,EACLvC,EAAKwC,EACLvC,EAAKwC,WAYAC,EAAUC,EAAIC,EAAIC,EAAIC,GAC7BH,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACVC,EAAKA,EAAK,EAEV5C,EAAKyC,EACHxC,EAAKyC,EACLxC,EAAKyC,EACLxC,EAAKyC;SAYAC,EAASC,EAAIC,EAAIC,EAAIC,GAC5BH,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACVC,EAAKA,EAAK,EACVC,EAAKA,EAAK,EAEV7C,EAAK0C,EACHzC,EAAK0C,EACLzC,EAAK0C,EACLzC,EAAK0C,WAYAC,EAAYC,EAAIznB,EAAIjzB,EAAI26C,GAC/BD,EAAKA,EAAK,EACVznB,EAAKA,EAAK,EACVjzB,EAAKA,EAAK,EACV26C,EAAKA,EAAK,EAEVjD,GAAOI,EAAKJ,EAAMI,EAAK6C,EACrBlD,GAAOI,EAAKJ,EAAMI,EAAK73C,EACvBw3C,GAAOI,EAAKJ,EAAMI,EAAK3kB,EACvBskB,GAAOI,EAAKJ,EAAMI,EAAK+C,WAUlBE,EAAUr5E,GACjBA,EAAMA,EAAM,KAERA,EAAM,GAAI,OAAQ,EAEtB62E,EAAK72E,EAAM,GAAKw1E,IAAO,GACrBqB,EAAK72E,EAAM,GAAKw1E,IAAO,GAAK,IAC5BqB,EAAK72E,EAAM,GAAKw1E,IAAO,EAAI,IAC3BqB,EAAK72E,EAAM,GAAKw1E,EAAK,IACrBqB,EAAK72E,EAAM,GAAKy1E,IAAO,GACvBoB,EAAK72E,EAAM,GAAKy1E,IAAO,GAAK,IAC5BoB,EAAK72E,EAAM,GAAKy1E,IAAO,EAAI,IAC3BoB,EAAK72E,EAAM,GAAKy1E,EAAK,IACrBoB,EAAK72E,EAAM,GAAK01E,IAAO,GACvBmB,EAAK72E,EAAM,GAAK01E,IAAO,GAAK,IAC5BmB,EAAK72E,EAAM,IAAM01E,IAAO,EAAI,IAC5BmB,EAAK72E,EAAM,IAAM01E,EAAK,IACtBmB,EAAK72E,EAAM,IAAM21E,IAAO,GACxBkB,EAAK72E,EAAM,IAAM21E,IAAO,GAAK,IAC7BkB,EAAK72E,EAAM,IAAM21E,IAAO,EAAI,IAC5BkB,EAAK72E,EAAM,IAAM21E,EAAK,WAEjB,YAUA2D,EAAOt5E,GACdA,EAAMA,EAAM,KAERA,EAAM,GAAI,OAAQ,EAEtB62E,EAAK72E,EAAM,GAAK41E,IAAO;AACrBiB,EAAK72E,EAAM,GAAK41E,IAAO,GAAK,IAC5BiB,EAAK72E,EAAM,GAAK41E,IAAO,EAAI,IAC3BiB,EAAK72E,EAAM,GAAK41E,EAAK,IACrBiB,EAAK72E,EAAM,GAAK61E,IAAO,GACvBgB,EAAK72E,EAAM,GAAK61E,IAAO,GAAK,IAC5BgB,EAAK72E,EAAM,GAAK61E,IAAO,EAAI,IAC3BgB,EAAK72E,EAAM,GAAK61E,EAAK,IACrBgB,EAAK72E,EAAM,GAAK81E,IAAO,GACvBe,EAAK72E,EAAM,GAAK81E,IAAO,GAAK,IAC5Be,EAAK72E,EAAM,IAAM81E,IAAO,EAAI,IAC5Be,EAAK72E,EAAM,IAAM81E,EAAK,IACtBe,EAAK72E,EAAM,IAAM+1E,IAAO,GACxBc,EAAK72E,EAAM,IAAM+1E,IAAO,GAAK,IAC7Bc,EAAK72E,EAAM,IAAM+1E,IAAO,EAAI,IAC5Bc,EAAK72E,EAAM,IAAM+1E,EAAK,WAEjB,YAQAwD,IACPnC,EAAS,EAAG,EAAG,EAAG,GAClBZ,EAAKhB,EACHiB,EAAKhB,EACLiB,EAAKhB,EACLiB,EAAKhB,WAYA6D,EAAOnuF,EAAM2U,EAAKqc,GACzBhxB,EAAOA,EAAO,EACd2U,EAAMA,EAAM,EACZqc,EAAMA,EAAM,MAER+f,EAAM,KAENp8B,EAAM,GAAI,OAAQ,SAEdqc,EAAM,IAAM,GAAI;AACtBo9D,EAAcpuF,EAAO,GACnBwrF,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,EAAI62E,EAAK72E,EAAM,GAC5E62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,EAAI62E,EAAK72E,EAAM,GAC5E62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,KAAO,EAAI62E,EAAK72E,EAAM,IAC7E62E,EAAK72E,EAAM,KAAO,GAAK62E,EAAK72E,EAAM,KAAO,GAAK62E,EAAK72E,EAAM,KAAO,EAAI62E,EAAK72E,EAAM,KAGjF62E,EAAK72E,EAAM,GAAKw1E,IAAO,GACrBqB,EAAK72E,EAAM,GAAKw1E,IAAO,GAAK,IAC5BqB,EAAK72E,EAAM,GAAKw1E,IAAO,EAAI,IAC3BqB,EAAK72E,EAAM,GAAKw1E,EAAK,IACrBqB,EAAK72E,EAAM,GAAKy1E,IAAO,GACvBoB,EAAK72E,EAAM,GAAKy1E,IAAO,GAAK,IAC5BoB,EAAK72E,EAAM,GAAKy1E,IAAO,EAAI,IAC3BoB,EAAK72E,EAAM,GAAKy1E,EAAK,IACrBoB,EAAK72E,EAAM,GAAK01E,IAAO,GACvBmB,EAAK72E,EAAM,GAAK01E,IAAO,GAAK,IAC5BmB,EAAK72E,EAAM,IAAM01E,IAAO,EAAI,IAC5BmB,EAAK72E,EAAM,IAAM01E,EAAK,IACtBmB,EAAK72E,EAAM,IAAM21E,IAAO,GACxBkB,EAAK72E,EAAM,IAAM21E,IAAO,GAAK,IAC7BkB,EAAK72E,EAAM,IAAM21E,IAAO,EAAI,IAC5BkB,EAAK72E,EAAM,IAAM21E,EAAK,IAExBv5C,EAAOA,EAAM,GAAM,EACjBp8B,EAAOA,EAAM,GAAM,EACnBqc,EAAOA,EAAM,GAAM,SAGhB+f,EAAM,WAYNs9C,EAAIruF,EAAM2U,EAAKqc,GACtBhxB,EAAOA,EAAO,EACd2U,EAAMA,EAAM,EACZqc,EAAMA,EAAM;KAER+f,EAAM,KAENp8B,EAAM,GAAI,OAAQ,SAEdqc,EAAM,IAAM,GAAI,CACtBs9D,EAAWtuF,EAAO,GAChBwrF,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,EAAI62E,EAAK72E,EAAM,GAC5E62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,EAAI62E,EAAK72E,EAAM,GAC5E62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,IAAM,GAAK62E,EAAK72E,EAAM,KAAO,EAAI62E,EAAK72E,EAAM,IAC7E62E,EAAK72E,EAAM,KAAO,GAAK62E,EAAK72E,EAAM,KAAO,GAAK62E,EAAK72E,EAAM,KAAO,EAAI62E,EAAK72E,EAAM,KAGjFo8B,EAAOA,EAAM,GAAM,EACjBp8B,EAAOA,EAAM,GAAM,EACnBqc,EAAOA,EAAM,GAAM,SAGhB+f,EAAM,MAMXq9C,EAAgB,CAACrC,EAAUC,EAAUC,EAAUC,EAAUC,EAAUC,EAAUC,EAAMC,OAKnFgC,EAAa,CAACrC,EAAUM,SAKrB,CACLG,WAAYA,EACZC,UAAWA,EACXG,OAAQA,EACRK,UAAWA,EACXK,SAAUA,EACVK,YAAaA,EACbG,UAAWA,EACXC,OAAQA,EACRC,SAAUA,EACVC,OAAQA,EACRE,IAAKA,GAxpBC,CAFG,CAACx3D,WAAYA,WAAYI,YAAaA,aA4pBzC+yD,EAAS9wD;QAEnB+wD,EAAIsE,iBApsBaC,EAAIC,EAAItuB,EAAIC,EAAIsuB,EAAIC,EAAIC,EAAIC,EAAIC,OAC3CC,EAAQ9pD,EAAKgC,SAAS,EAAO,IAC/B+nD,EAAQ/pD,EAAKgC,SAAS,IAAO,KAG/B8nD,EAAM7uF,IAAI,CAACuuF,EAAItuB,EAAIC,EAAIsuB,EAAIC,EAAIC,EAAIC,EAAIC,QAClC,IAAI5qF,EAAIsqF,EAAIS,EAAO,EAAG/qF,EAAI,EAAIsqF,EAAK,GAAItqF,IAAK,KAC3C2f,EAAIkrE,EAAM7qF,EAAI,IACbA,EAAIsqF,GAAO,GAAc,IAAPA,GAAYtqF,EAAIsqF,GAAO,KAC5C3qE,EAAI0lE,EAAS1lE,IAAM,KAAO,GAAK0lE,EAAS1lE,IAAM,GAAK,MAAQ,GAAK0lE,EAAS1lE,IAAM,EAAI,MAAQ,EAAI0lE,EAAa,IAAJ1lE,IAEtG3f,EAAIsqF,GAAO,IACb3qE,EAAKA,GAAK,EAAMA,IAAM,GAAOorE,GAAQ,GACrCA,EAAQA,GAAQ,GAAc,IAAPA,EAAe,GAAO,IAE/CF,EAAM7qF,GAAK6qF,EAAM7qF,EAAIsqF,GAAM3qE,MAIxB,IAAIkM,EAAI,EAAGA,EAAI7rB,EAAG6rB,GAAK,MACrB,IAAIm/D,EAAK,EAAGA,EAAK,EAAGA,IAAM,CACzBrrE,EAAIkrE,EAAM7qF,GAAK,EAAI6rB,IAAM,EAAIm/D,GAAM,GAErCF,EAAMj/D,EAAIm/D,GADRn/D,EAAI,GAAKA,GAAK7rB,EAAI,EACJ2f,EAEA6lE,EAAQ,GAAGH,EAAS1lE,IAAM,KACtC6lE,EAAQ,GAAGH,EAAS1lE,IAAM,GAAK,MAC/B6lE,EAAQ,GAAGH,EAAS1lE,IAAM,EAAI,MAC9B6lE,EAAQ,GAAGH,EAAa,IAAJ1lE,IAM9BomE,EAAIyC,WAAW8B,EAAK,IAoqBfvE,UAQT3oE,EAAQ6tE,IAAM;AACZC,IAAK,EACLC,IAAK,EACLC,IAAK,EACLC,IAAK,EACLC,IAAK,GAQLluE,EAAQ05D,IAAM,CACZoU,IAAK,EACLC,IAAK,EACLC,IAAK,EACLC,IAAK,EACLC,IAAK,GAQPluE,EAAQmuE,IAAM,CACZJ,IAAK,EACLK,IAAK,GAQTpuE,EAAQquE,UAAY,MAEbruE,EAz6BK,GAimCRsuE,4CAOUlyF,EAAKmyF,OAAIliC,0FACXjwD,EAAKmyF,EAAIliC,EAAS,wCAE5B,SAAQvoD,UAGGujF,GAFIjuF,KAAKo1F,oBAAoB1qF,GACzB1K,KAAKq1F,6CAGpB,SAAQ3qF,UAGGujF,GAFIjuF,KAAKs1F,oBAAoB5qF,GACzB1K,KAAKu1F;MAhBpB,SAAe7qF,EAAM1H,OAAKiwD,6DAAgBkiC,gDAC/B,IAAID,EAAQlyF,EAAKmyF,EAAIliC,GAASuiC,QAAQ9qF,0BAEjD,SAAeA,EAAM1H,OAAKiwD,6DAAgBkiC,gDAC/B,IAAID,EAAQlyF,EAAKmyF,EAAIliC,GAASwiC,QAAQ/qF,gCAzLrC1H,EAAKmyF,OAAIliC,6DAAgB3tD,wDAC5B2U,IAAM;KACNqc,IAAM,OACNhxB,KAAOA,OAEPilC,KAAOkjD,KAAalhD,SAASiiD,GAAQyG,gBACrC1F,IAAM,IAAIf,GAAQ,KAAMxuF,KAAKuqC,KAAK/L,aAElCvkB,IAAM,OACNqc,IAAM,MAELo/D,EAAS1yF,EAAImF,UACJ,KAAXutF,GAA4B,KAAXA,GAA4B,KAAXA,EAClC,MAAM,IAAIpH,GAAqB,wBAC7BqH,EAAU,IAAIt6D,SAASr4B,EAAIw7B,OAAQx7B,EAAIu9B,WAAYv9B,EAAIs9B,oBACxDivD,IAAIsE,QAAQ6B,GAAU,EAAGC,EAAQt0D,UAAU,GAAIs0D,EAAQt0D,UAAU,GAAIs0D,EAAQt0D,UAAU,GAAIs0D,EAAQt0D,UAAU,IAAKq0D,EAAS,GAAKC,EAAQt0D,UAAU,IAAM,EAAGq0D,EAAS,GAAKC,EAAQt0D,UAAU,IAAM,EAAGq0D,EAAS,GAAKC,EAAQt0D,UAAU,IAAM,EAAGq0D,EAAS,GAAKC,EAAQt0D,UAAU,IAAM,QAE7Qr/B,IAAPmzF,EAAkB,IACA,KAAdA,EAAGhtF,OACH,MAAM,IAAImmF,GAAqB;KAC/BsH,EAAS,IAAIv6D,SAAS85D,EAAG32D,OAAQ22D,EAAG50D,WAAY40D,EAAG70D,iBAClDivD,IAAI6C,OAAOwD,EAAOv0D,UAAU,GAAIu0D,EAAOv0D,UAAU,GAAIu0D,EAAOv0D,UAAU,GAAIu0D,EAAOv0D,UAAU,eAG3FkuD,IAAI6C,OAAO,EAAG,EAAG,EAAG,QAExBn/B,QAAUA,+CAEnB,SAAoBvoD,OACX8iF,GAAS9iF,GACV,MAAM,IAAIzI,UAAU,uCACpBstF,EAAMvvF,KAAKuvF,IACXhlD,EAAOvqC,KAAKuqC,KACZsrD,EAAQrH,GAAQiG,IAAIz0F,KAAKsF,MACzBsoF,EAAOY,GAAQyG,UACfh7E,EAAMja,KAAKia,IACXqc,EAAMt2B,KAAKs2B,IACXu3D,EAAO,EACPC,EAAOpjF,EAAKvC,QAAU,EACtB2tF,EAAO,EAEP9H,EAAO,EACPvkF,EAAS,IAAI0yB,WAFL7F,EAAMw3D,GAAS,IAGpBA,EAAO,GAEVx3D,GADA03D,EAAOL,GAAYpjD,EAAMtwB,EAAMqc,EAAK5rB,EAAMmjF,EAAMC,GAEhDD,GAAQG,EACRF,GAAQE;CACRA,EAAOuB,EAAIkE,OAAOoC,EAAOjI,EAAO3zE,EAAKqc,KAEjC7sB,EAAOjE,IAAI+kC,EAAKgC,SAAStyB,EAAKA,EAAM+zE,GAAO8H,GAC/CA,GAAQ9H,EACJA,EAAO13D,GACPrc,GAAO+zE,EACP13D,GAAO03D,IAGP/zE,EAAM,EACNqc,EAAM,eAGTrc,IAAMA,OACNqc,IAAMA,EACJ7sB,oCAEX,eACQ8lF,EAAMvvF,KAAKuvF,IACXhlD,EAAOvqC,KAAKuqC,KACZsrD,EAAQrH,GAAQiG,IAAIz0F,KAAKsF,MACzBsoF,EAAOY,GAAQyG,UACfh7E,EAAMja,KAAKia,IACXqc,EAAMt2B,KAAKs2B,IACXy/D,EAAO,GAAMz/D,EAAM,GACnB8tC,EAAO9tC,KACPt2B,KAAK6C,eAAe,eAChB7C,KAAKizD,QAAS,KACT,IAAI5qC,EAAI,EAAGA,EAAI0tE,IAAQ1tE,EACxBkiB,EAAKtwB,EAAMqc,EAAMjO,GAAK0tE,EAG1B3xB,EADA9tC,GAAOy/D,OAGN,GAAIz/D,EAAM,SACL,IAAIg4D,GAAqB,yDAInCh4D,GAAOy/D,MAELtsF,EAAS,IAAI0yB,WAAWioC,UAC1B9tC,GACAi5D,EAAIkE,OAAOoC,EAAOjI,EAAO3zE,EAAKqc;AAC9B8tC,GACA36D,EAAOjE,IAAI+kC,EAAKgC,SAAStyB,EAAKA,EAAMmqD,SACnCnqD,IAAM,OACNqc,IAAM,EACJ7sB,qCAEX,SAAoBiB,OACX8iF,GAAS9iF,GACV,MAAM,IAAIzI,UAAU,mCACpBstF,EAAMvvF,KAAKuvF,IACXhlD,EAAOvqC,KAAKuqC,KACZsrD,EAAQrH,GAAQlO,IAAItgF,KAAKsF,MACzBsoF,EAAOY,GAAQyG,UACfh7E,EAAMja,KAAKia,IACXqc,EAAMt2B,KAAKs2B,IACXu3D,EAAO,EACPC,EAAOpjF,EAAKvC,QAAU,EACtB2tF,EAAO,EACP1xB,EAAQ9tC,EAAMw3D,GAAS,GACvBiI,EAAO,EACP/H,EAAO,EACPhuF,KAAKizD,UAELmR,GADA2xB,EAAOz/D,EAAMw3D,EAAO1pB,GAAQ,YAG1B36D,EAAS,IAAI0yB,WAAWioC,GACvB0pB,EAAO,GAEVx3D,GADA03D,EAAOL,GAAYpjD,EAAMtwB,EAAMqc,EAAK5rB,EAAMmjF,EAAMC,GAEhDD,GAAQG,EACRF,GAAQE,GACRA,EAAOuB,EAAIkE,OAAOoC,EAAOjI,EAAO3zE,EAAKqc,GAAQw3D,EAAc,EAAPiI,MAEhDtsF,EAAOjE,IAAI+kC,EAAKgC,SAAStyB,EAAKA,EAAM+zE,GAAO8H,GAC/CA,GAAQ9H,EACJA,EAAO13D,GACPrc,GAAO+zE,EACP13D,GAAO03D,IAGP/zE,EAAM,EACNqc,EAAM,eAGTrc,IAAMA,OACNqc,IAAMA,EACJ7sB;kCAEX,eACQ8lF,EAAMvvF,KAAKuvF,IACXhlD,EAAOvqC,KAAKuqC,KACZsrD,EAAQrH,GAAQlO,IAAItgF,KAAKsF,MACzBsoF,EAAOY,GAAQyG,UACfh7E,EAAMja,KAAKia,IACXqc,EAAMt2B,KAAKs2B,IACX8tC,EAAO9tC,KACPA,EAAM,EAAG,IACLA,EAAM,GAAI,IACNt2B,KAAK6C,eAAe,iBACd,IAAIyrF,GAAqB,oDAG/Bh4D,GAAO,GAAMA,EAAM,MAG3Bi5D,EAAIkE,OAAOoC,EAAOjI,EAAO3zE,EAAKqc,GAC1Bt2B,KAAK6C,eAAe,YAAc7C,KAAKizD,QAAS,KAC5C+iC,EAAMzrD,EAAKtwB,EAAMmqD,EAAO,MACxB4xB,EAAM,GAAKA,EAAM,IAAMA,EAAM5xB,EAC7B,MAAM,IAAImqB,GAAc,uBACxB0H,EAAS,EACJzsF,EAAIwsF,EAAKxsF,EAAI,EAAGA,IACrBysF,GAAUD,EAAMzrD,EAAKtwB,EAAMmqD,EAAO56D,MAClCysF,EACA,MAAM,IAAI1H,GAAc,eAC5BnqB,GAAQ4xB,OAGVvsF,EAAS,IAAI0yB,WAAWioC;QAC1BA,EAAO,GACP36D,EAAOjE,IAAI+kC,EAAKgC,SAAStyB,EAAKA,EAAMmqD,SAEnCnqD,IAAM,OACNqc,IAAM,EACJ7sB,YAmvBXysF,GAAa,SAAW1G,EAAQF,EAAS9wD,iBAGrC23D,EAAK,MAELC,EAAS,IAAI5G,EAAOjzD,YAAYiC,OAEhCiyB,EAAO++B,EAAO7vF,KAAK8wD,cAWd4lC,EAAShuE,GACdA,EAAIA,EAAE,EACN8tE,EAAK9tE,EAAKA,EAAI,IAAO,UACdA,EAAE,WAGJiuE,EAASn+C,GACdA,EAAIA,EAAE,MACF9vB,EAAI,EAAGA,EAAI8tE,EACfA,EAAK9tE,GAAM8vB,EAAI,IAAO,IAAI,SACnB9vB,EAAE,WAGJkuE,EAAQp+C,GACbA,EAAIA,EAAE,EACNg+C,EAAKA,GAAOh+C,EAAI,IAAO,IAAI,WAStBq+C,EAAKr+C,EAAG7kB,EAAGu7B,GAChB1W,EAAIA,EAAE,EACN7kB,EAAIA,EAAE,EACNu7B,EAAIA,EAAE,MAEFrlD,EAAI,MAEF8pB,EAAE,IAAMu7B,EAAE,GAAK,OACRrlD,EAAE,IAAM2uC,EAAE,GAAI3uC,EAAKA,EAAE,EAAG,EAAI,CACjC4sF,EAAQvnC,EAAErlD,GAAI,GAAK4sF,EAAQ9iE,EAAE9pB,GAAI,QAGpC,KACKA,EAAK2uC,EAAE,EAAG,GAAI3uC,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,CACzC4sF,EAAQvnC,EAAErlD,GAAI,GAAK4sF,EAAQ9iE,EAAE9pB,GAAI,cAKpCgqB,EAAI2kB,EAAG3kB,EAAGF,GACf6kB,EAAIA,EAAE,EACN3kB,EAAIA,EAAE,EACNF,EAAIA,EAAE;KAEF9pB,EAAI,QAECA,EAAE,IAAM2uC,EAAE,GAAI3uC,EAAKA,EAAE,EAAG,EAAI,CACjC4sF,EAAQ9iE,EAAE9pB,GAAI,GAAKgqB,YAiBlBmhC,EAAMrhC,EAAGmjE,EAAIruE,EAAGsuE,GACrBpjE,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACRruE,EAAMA,EAAE,EACRsuE,EAAKA,EAAG,MAEJnzF,EAAI,EAAGqM,EAAI,EAAGm/B,EAAI,EAAG9nB,EAAI,EAAGzd,EAAI,MAE9BktF,EAAG,IAAM,EACXA,EAAKD,MAEHC,EAAG,IAAMD,EAAG,GACdA,EAAKC,EAET9mF,EAAI,QACKpG,EAAE,IAAMitF,EAAG,GAAIjtF,EAAKA,EAAE,EAAG,EAAI,CAClCjG,GAAK6yF,EAAQ9iE,EAAE9pB,GAAI,GACnBulC,GAAKxrC,EAAI,QAAUqM,EAAE,EACrBqX,GAAK1jB,IAAM,KAAOwrC,IAAM,IAAI,EAC5BqnD,EAAQhuE,EAAE5e,GAAI,GAAMyd,GAAK,GAAO8nB,EAAI,OACpCn/B,EAAIqX,IAAM,SAGLzd,EAAE,IAAMktF,EAAG,GAAIltF,EAAKA,EAAE,EAAG,EAAI,CAClC4sF,EAAQhuE,EAAE5e,GAAI,GAAMoG,EAAE,EAAG,SAGtBA,EAAE,WAGJ6hD,EAAMn+B,EAAGmjE,EAAI5nC,EAAG8nC,GACrBrjE,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACR5nC,EAAMA,EAAE,EACR8nC,EAAKA,EAAG,MAEJpzF,EAAI,EAAGoM,EAAI,EAAGnG,EAAI,MAEhBitF,EAAG,IAAME,EAAG,GAAK,KACbntF,EAAKitF,EAAG,EAAG,GAAIjtF,EAAE,KAAOmtF,EAAG,GAAIntF,EAAKA,EAAE,EAAG,EAAI,IAC1C4sF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EAAI,OAAO,OAGpC,KACKA,EAAKmtF,EAAG,EAAG,GAAIntF,EAAE,KAAOitF,EAAG,GAAIjtF,EAAKA,EAAE,EAAG,EAAI;GAC1C4sF,EAAQvnC,EAAErlD,GAAI,GAAG,EAAI,OAAQ,SAIjCA,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,CAC9BjG,EAAI6yF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EAAGmG,EAAIymF,EAAQvnC,EAAErlD,GAAI,GAAG,KACvCjG,IAAI,EAAMoM,IAAI,EAAK,OAAQ,KAC3BpM,IAAI,EAAMoM,IAAI,EAAK,OAAO,SAG7B,WAQFinF,EAAMtjE,EAAGmjE,GACdnjE,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,MAEJjtF,EAAI,MAEFA,EAAKitF,EAAG,EAAG,GAAIjtF,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,IACrC4sF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EAAI,OAAQA,EAAE,EAAG,SAGpC,WAeFiwB,EAAMnG,EAAGmjE,EAAI5nC,EAAG8nC,EAAIvuE,EAAGsuE,GAC5BpjE,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACR5nC,EAAMA,EAAE,EACR8nC,EAAKA,EAAG,EACRvuE,EAAMA,EAAE,EACRsuE,EAAKA,EAAG,MAEJnzF,EAAI,EAAGoM,EAAI,EAAGC,EAAI,EAAGm/B,EAAI,EAAG9nB,EAAI,EAAGzd,EAAI,MAErCitF,EAAG,IAAME,EAAG,GAAK,CACnB5nD,EAAIzb,EAAGA,EAAIu7B,EAAGA,EAAI9f,EAClBA,EAAI0nD,EAAIA,EAAKE,EAAIA,EAAK5nD,MAGpB2nD,EAAG,IAAM,EACXA,EAAKD,EAAG,EAAE,MAERC,EAAG,IAAMC,EAAG,GACdF,EAAKE,EAAKD,QAELltF,EAAE,IAAMmtF,EAAG,GAAIntF,EAAKA,EAAE,EAAG,EAAI,CAClCjG,EAAI6yF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EACrBmG,EAAIymF,EAAQvnC,EAAErlD,GAAI,GAAG,EACrBulC,IAAOxrC,EAAI,SAAWoM,EAAI,QAAQ,GAAMC,EAAE;CAC1CqX,IAAO1jB,IAAM,KAAOoM,IAAM,IAAI,IAAOo/B,IAAM,IAAI,EAC/CqnD,EAAQhuE,EAAE5e,GAAI,GAAMulC,EAAI,OAAW9nB,GAAK,GACxCrX,EAAIqX,IAAM,SAGLzd,EAAE,IAAMitF,EAAG,GAAIjtF,EAAKA,EAAE,EAAG,EAAI,CAClCjG,EAAI6yF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EACrBulC,GAAKxrC,EAAI,QAAUqM,EAAE,EACrBqX,GAAK1jB,IAAM,KAAOwrC,IAAM,IAAI,EAC5BqnD,EAAQhuE,EAAE5e,GAAI,GAAMulC,EAAI,OAAW9nB,GAAK,GACxCrX,EAAIqX,IAAM,SAGLzd,EAAE,IAAMktF,EAAG,GAAIltF,EAAKA,EAAE,EAAG,EAAI,CAClC4sF,EAAQhuE,EAAE5e,GAAI,GAAKoG,EAAE,EACrBA,EAAI,SAGDA,EAAE,WAeJszC,EAAM5vB,EAAGmjE,EAAI5nC,EAAG8nC,EAAIvuE,EAAGsuE,GAC5BpjE,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACR5nC,EAAMA,EAAE,EACR8nC,EAAKA,EAAG,EACRvuE,EAAMA,EAAE,EACRsuE,EAAKA,EAAG,MAEJnzF,EAAI,EAAGoM,EAAI,EAAGC,EAAI,EAAGm/B,EAAI,EAAG9nB,EAAI,EAAGzd,EAAI,MAErCktF,EAAG,IAAM,EACXA,GAAMD,EAAG,IAAME,EAAG,GAAKF,EAAG,EAAE,EAAIE,EAAG,EAAE,MAEnCD,EAAG,IAAMD,EAAG,GACdA,EAAKC,MAEHA,EAAG,IAAMC,EAAG,GACdA,EAAKD,MAEHD,EAAG,IAAME,EAAG,GAAK,OACVntF,EAAE,IAAMitF,EAAG,GAAIjtF,EAAKA,EAAE,EAAG,EAAI,CAClCjG,EAAI6yF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EACrBmG,EAAIymF,EAAQvnC,EAAErlD,GAAI,GAAG;CACrBulC,IAAOxrC,EAAI,SAAWoM,EAAI,QAAQ,GAAMC,EAAE,EAC1CqX,IAAO1jB,IAAM,KAAOoM,IAAM,IAAI,IAAOo/B,GAAK,IAAI,EAC9CqnD,EAAQhuE,EAAE5e,GAAI,GAAMulC,EAAI,OAAW9nB,GAAK,GACxCrX,EAAIqX,GAAK,SAGJzd,EAAE,IAAMmtF,EAAG,GAAIntF,EAAKA,EAAE,EAAG,EAAI,CAClCmG,EAAIymF,EAAQvnC,EAAErlD,GAAI,GAAG,EACrBulC,EAAIn/B,GAAKD,EAAI,QAAQ,EACrBsX,GAAK8nB,GAAK,KAAOp/B,IAAM,IAAI,EAC3BymF,EAAQhuE,EAAE5e,GAAI,GAAMulC,EAAI,OAAW9nB,GAAK,GACxCrX,EAAIqX,GAAK,QAGZ,OACQzd,EAAE,IAAMmtF,EAAG,GAAIntF,EAAKA,EAAE,EAAG,EAAI,CAClCjG,EAAI6yF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EACrBmG,EAAIymF,EAAQvnC,EAAErlD,GAAI,GAAG,EACrBulC,IAAOxrC,EAAI,SAAWoM,EAAI,QAAQ,GAAMC,EAAE,EAC1CqX,IAAO1jB,IAAM,KAAOoM,IAAM,IAAI,IAAOo/B,GAAK,IAAI,EAC9CqnD,EAAQhuE,EAAE5e,GAAI,GAAMulC,EAAI,OAAW9nB,GAAK,GACxCrX,EAAIqX,GAAK,SAGJzd,EAAE,IAAMitF,EAAG,GAAIjtF,EAAKA,EAAE,EAAG,EAAI,CAClCjG,EAAI6yF,EAAQ9iE,EAAE9pB,GAAI,GAAG,EACrBulC,GAAKxrC,EAAI,QAAUqM,EAAE,EACrBqX,GAAK1jB,IAAM,KAAOwrC,GAAK,IAAI,EAC3BqnD,EAAQhuE,EAAE5e,GAAI,GAAMulC,EAAI,OAAW9nB,GAAK,GACxCrX,EAAIqX,GAAK;MAIRzd,EAAE,IAAMktF,EAAG,GAAIltF,EAAKA,EAAE,EAAG,EAAI,CAClC4sF,EAAQhuE,EAAE5e,GAAI,GAAKoG,EAAE,SAGlBA,EAAE,WAiBJ4hD,EAAMl+B,EAAGmjE,EAAI5nC,EAAG8nC,EAAIvuE,EAAGsuE,GAC5BpjE,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACR5nC,EAAMA,EAAE,EACR8nC,EAAKA,EAAG,EACRvuE,EAAMA,EAAE,EACRsuE,EAAKA,EAAG,MAEJvgC,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGpB,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAC7IQ,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGpB,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAC7Is9B,EAAK,EAAGC,EAAK,EAAGh3B,EAAK,EAAGi3B,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,GAAM,EAAGC,GAAM,EACnI1yB,GAAI,EAAG36B,GAAI,EAAG7B,GAAI,EAAGjU,GAAI,EACzBhrB,GAAI,EAAGouF,GAAK,EAAGviE,GAAI,EAAGwiE,GAAK,EAAGC,GAAK,MAEjCrB,EAAG,IAAME,EAAG,GAAK,CACnB1xB,GAAI3xC,EAAGgX,GAAImsD,EACXnjE,EAAIu7B,EAAG4nC,EAAKE,EACZ9nC,EAAIoW,GAAG0xB,EAAKrsD,GAGhB9V,GAAKiiE,EAAGE,EAAI,MACJD,EAAG,IAAMliE,GAAE,IAAUkiE,EAAG,IAAM,EAClCA,EAAKliE,OAEHkiE,EAAG,IAAMD,EAAG,GACdA,EAAKC,MAEHA,EAAG,IAAMC,EAAG,GACdA,EAAKD;OAEAltF,GAAE,IAAMitF,EAAG,GAAIjtF,GAAKA,GAAE,GAAI,EAAI,CACnCouF,GAAMtkE,EAAE9pB,GAAG,EAEX4sD,EAAMggC,GAAQwB,GAAG,IAAI,GAAG,EACxBrhC,EAAM6/B,GAAQwB,GAAG,IAAI,GAAG,EACxBlhC,EAAM0/B,GAAQwB,GAAG,IAAI,GAAG,EACxB/gC,EAAMu/B,GAAQwB,GAAG,KAAK,GAAG,EACzB5gC,EAAMo/B,GAAQwB,GAAG,KAAK,GAAG,EACzBzgC,EAAMi/B,GAAQwB,GAAG,KAAK,GAAG,EACzBtgC,EAAM8+B,GAAQwB,GAAG,KAAK,GAAG,EACzBngC,EAAM2+B,GAAQwB,GAAG,KAAK,GAAG,EACzBzhC,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZrB,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GAEd2/B,EAAKC,EAAKC,EAAMC,EAAMC,EAAMC,EAAMC,GAAMC,GAAM,MAExCtiE,GAAI,GAAIA,GAAE,IAAMshE,EAAG,GAAIthE,GAAKA,GAAE,GAAI,EAAI,CACxCwiE,GAAMhpC,EAAEx5B,GAAG,EACXyiE,GAAM1vE,GAAG5e,GAAE6rB,GAAE,GAAI,EAEjB6iC,EAAMk+B,GAAQyB,GAAG,IAAI,GAAG,EACxBx/B,EAAM+9B,GAAQyB,GAAG,IAAI,GAAG,EACxBr/B,EAAM49B,GAAQyB,GAAG,IAAI,GAAG,EACxBl/B,EAAMy9B,GAAQyB,GAAG,KAAK,GAAG;AACzB/+B,EAAMs9B,GAAQyB,GAAG,KAAK,GAAG,EACzB5+B,EAAMm9B,GAAQyB,GAAG,KAAK,GAAG,EACzBz+B,EAAMg9B,GAAQyB,GAAG,KAAK,GAAG,EACzBt+B,EAAM68B,GAAQyB,GAAG,KAAK,GAAG,EACzB5/B,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZE,EAAMC,EAAM,OACZrB,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GACdG,EAAMA,IAAQ,GAEds9B,EAAKT,GAAQ0B,GAAG,IAAI,GAAG,EACvBhB,EAAKV,GAAQ0B,GAAG,IAAI,GAAG,EACvBh4B,EAAKs2B,GAAQ0B,GAAG,IAAI,GAAG,EACvBf,EAAKX,GAAQ0B,GAAG,KAAK,GAAG,EACxBd,EAAKZ,GAAQ0B,GAAG,KAAK,GAAG,EACxBb,EAAKb,GAAQ0B,GAAG,KAAK,GAAG,EACxBZ,EAAKd,GAAQ0B,GAAG,KAAK,GAAG,EACxBX,EAAKf,GAAQ0B,GAAG,KAAK,GAAG,EAExB7yB,KAAMxU,EAAK0F,EAAK8B,GAAK,IAAMm/B,EAAK,QAAQ,IAAMP,EAAK,QAAQ,EAC3DvsD,KAAMmmB,EAAK2F,EAAK6B,GAAK,IAAMm/B,IAAO,IAAI,IAAMP,IAAO,IAAI,EACvDpuD,KAAMgoB,EAAK0F,EAAK+B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI;CACvDzwC,KAAMi8B,EAAK2F,EAAK8B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDouD,EAAMpuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAKiC,GAAK,IAAM5jC,GAAI,QAAQ,IAAMsiE,EAAK,QAAQ,EAC1DxsD,KAAMmmB,EAAK2F,EAAKgC,GAAK,IAAM5jC,KAAM,IAAI,IAAMsiE,IAAO,IAAI,EACtDruD,KAAMgoB,EAAK0F,EAAKkC,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKiC,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAKoC,GAAK,IAAM/jC,GAAI,QAAQ,IAAMsrC,EAAK,QAAQ,EAC1Dx1B,KAAMmmB,EAAK2F,EAAKmC,GAAK,IAAM/jC,KAAM,IAAI,IAAMsrC,IAAO,IAAI,EACtDr3B,KAAMgoB,EAAK0F,EAAKqC,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKoC,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAKuC,GAAK,IAAMlkC,GAAI,QAAQ,IAAMuiE,EAAK,QAAQ;CAC1DzsD,KAAMmmB,EAAK2F,EAAKsC,GAAK,IAAMlkC,KAAM,IAAI,IAAMuiE,IAAO,IAAI,EACtDtuD,KAAMgoB,EAAK0F,EAAKwC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKuC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAK0C,GAAK,IAAMrkC,GAAI,QAAQ,IAAMwiE,EAAK,QAAQ,EAC1D1sD,KAAMmmB,EAAK2F,EAAKyC,GAAK,IAAMrkC,KAAM,IAAI,IAAMwiE,IAAO,IAAI,EACtDvuD,KAAMgoB,EAAK0F,EAAK2C,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK0C,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAK6C,GAAK,IAAMxkC,GAAI,QAAQ,IAAMyiE,EAAK,QAAQ,EAC1D3sD,KAAMmmB,EAAK2F,EAAK4C,GAAK,IAAMxkC,KAAM,IAAI,IAAMyiE,IAAO,IAAI,EACtDxuD,KAAMgoB,EAAK0F,EAAK8C,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK6C,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI;CACrDwuD,EAAMxuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAKgD,GAAK,IAAM3kC,GAAI,QAAQ,IAAM0iE,EAAK,QAAQ,EAC1D5sD,KAAMmmB,EAAK2F,EAAK+C,GAAK,IAAM3kC,KAAM,IAAI,IAAM0iE,IAAO,IAAI,EACtDzuD,KAAMgoB,EAAK0F,EAAKiD,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKgD,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK0F,EAAKmD,GAAK,IAAM9kC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ,EAC1D7sD,KAAMmmB,EAAK2F,EAAKkD,GAAK,IAAM9kC,KAAM,IAAI,IAAM2iE,IAAO,IAAI,EACtD1uD,KAAMgoB,EAAK0F,EAAKoD,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKmD,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBmyB,EAAK5iE,GAELywC,KAAMxU,EAAK6F,EAAK2B,GAAK,IAAMo/B,EAAK,QAAQ,IAAMP,EAAK,QAAQ,EAC3DxsD,KAAMmmB,EAAK8F,EAAK0B,GAAK,IAAMo/B,IAAO,IAAI,IAAMP,IAAO,IAAI;CACvDruD,KAAMgoB,EAAK6F,EAAK4B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK2B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK6F,EAAK8B,GAAK,IAAM5jC,GAAI,QAAQ,IAAMsrC,EAAK,QAAQ,EAC1Dx1B,KAAMmmB,EAAK8F,EAAK6B,GAAK,IAAM5jC,KAAM,IAAI,IAAMsrC,IAAO,IAAI,EACtDr3B,KAAMgoB,EAAK6F,EAAK+B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK8B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK6F,EAAKiC,GAAK,IAAM/jC,GAAI,QAAQ,IAAMuiE,EAAK,QAAQ,EAC1DzsD,KAAMmmB,EAAK8F,EAAKgC,GAAK,IAAM/jC,KAAM,IAAI,IAAMuiE,IAAO,IAAI,EACtDtuD,KAAMgoB,EAAK6F,EAAKkC,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKiC,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,GAAI;CAEtBA,KAAMxU,EAAK6F,EAAKoC,GAAK,IAAMlkC,GAAI,QAAQ,IAAMwiE,EAAK,QAAQ,EAC1D1sD,KAAMmmB,EAAK8F,EAAKmC,GAAK,IAAMlkC,KAAM,IAAI,IAAMwiE,IAAO,IAAI,EACtDvuD,KAAMgoB,EAAK6F,EAAKqC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKoC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK6F,EAAKuC,GAAK,IAAMrkC,GAAI,QAAQ,IAAMyiE,EAAK,QAAQ,EAC1D3sD,KAAMmmB,EAAK8F,EAAKsC,GAAK,IAAMrkC,KAAM,IAAI,IAAMyiE,IAAO,IAAI,EACtDxuD,KAAMgoB,EAAK6F,EAAKwC,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKuC,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK6F,EAAK0C,GAAK,IAAMxkC,GAAI,QAAQ,IAAM0iE,EAAK,QAAQ,EAC1D5sD,KAAMmmB,EAAK8F,EAAKyC,GAAK,IAAMxkC,KAAM,IAAI,IAAM0iE,IAAO,IAAI,EACtDzuD,KAAMgoB,EAAK6F,EAAK2C,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI;CACvDzwC,KAAMi8B,EAAK8F,EAAK0C,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK6F,EAAK6C,GAAK,IAAM3kC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ,EAC1D7sD,KAAMmmB,EAAK8F,EAAK4C,GAAK,IAAM3kC,KAAM,IAAI,IAAM2iE,IAAO,IAAI,EACtD1uD,KAAMgoB,EAAK6F,EAAK8C,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK6C,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK6F,EAAKgD,GAAK,IAAM9kC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ,EAC1D9sD,KAAMmmB,EAAK8F,EAAK+C,GAAK,IAAM9kC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAK6F,EAAKiD,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKgD,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI,OAEtBoyB,EAAK7iE,GAELywC,KAAMxU,EAAKgG,EAAKwB,GAAK,IAAMq/B,EAAM,QAAQ,IAAMx3B,EAAK,QAAQ;CAC5Dx1B,KAAMmmB,EAAKiG,EAAKuB,GAAK,IAAMq/B,IAAQ,IAAI,IAAMx3B,IAAO,IAAI,EACxDr3B,KAAMgoB,EAAKgG,EAAKyB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKwB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAK2B,GAAK,IAAM5jC,GAAI,QAAQ,IAAMuiE,EAAK,QAAQ,EAC1DzsD,KAAMmmB,EAAKiG,EAAK0B,GAAK,IAAM5jC,KAAM,IAAI,IAAMuiE,IAAO,IAAI,EACtDtuD,KAAMgoB,EAAKgG,EAAK4B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK2B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAK8B,GAAK,IAAM/jC,GAAI,QAAQ,IAAMwiE,EAAK,QAAQ,EAC1D1sD,KAAMmmB,EAAKiG,EAAK6B,GAAK,IAAM/jC,KAAM,IAAI,IAAMwiE,IAAO,IAAI,EACtDvuD,KAAMgoB,EAAKgG,EAAK+B,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK8B,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI;CACrDuuD,EAAMvuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAKiC,GAAK,IAAMlkC,GAAI,QAAQ,IAAMyiE,EAAK,QAAQ,EAC1D3sD,KAAMmmB,EAAKiG,EAAKgC,GAAK,IAAMlkC,KAAM,IAAI,IAAMyiE,IAAO,IAAI,EACtDxuD,KAAMgoB,EAAKgG,EAAKkC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKiC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAKoC,GAAK,IAAMrkC,GAAI,QAAQ,IAAM0iE,EAAK,QAAQ,EAC1D5sD,KAAMmmB,EAAKiG,EAAKmC,GAAK,IAAMrkC,KAAM,IAAI,IAAM0iE,IAAO,IAAI,EACtDzuD,KAAMgoB,EAAKgG,EAAKqC,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKoC,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAKuC,GAAK,IAAMxkC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ,EAC1D7sD,KAAMmmB,EAAKiG,EAAKsC,GAAK,IAAMxkC,KAAM,IAAI,IAAM2iE,IAAO,IAAI;CACtD1uD,KAAMgoB,EAAKgG,EAAKwC,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKuC,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAK0C,GAAK,IAAM3kC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ,EAC1D9sD,KAAMmmB,EAAKiG,EAAKyC,GAAK,IAAM3kC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAKgG,EAAK2C,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK0C,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKgG,EAAK6C,GAAK,IAAM9kC,GAAI,QAAQ,IAAM6iE,EAAK,QAAQ,EAC1D/sD,KAAMmmB,EAAKiG,EAAK4C,GAAK,IAAM9kC,KAAM,IAAI,IAAM6iE,IAAO,IAAI,EACtD5uD,KAAMgoB,EAAKgG,EAAK8C,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK6C,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,GAAI,OAEtBqyB,EAAM9iE;CAENywC,KAAMxU,EAAKmG,EAAKqB,GAAK,IAAMs/B,EAAM,QAAQ,IAAMR,EAAK,QAAQ,EAC5DzsD,KAAMmmB,EAAKoG,EAAKoB,GAAK,IAAMs/B,IAAQ,IAAI,IAAMR,IAAO,IAAI,EACxDtuD,KAAMgoB,EAAKmG,EAAKsB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKqB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAKwB,GAAK,IAAM5jC,GAAI,QAAQ,IAAMwiE,EAAK,QAAQ,EAC1D1sD,KAAMmmB,EAAKoG,EAAKuB,GAAK,IAAM5jC,KAAM,IAAI,IAAMwiE,IAAO,IAAI,EACtDvuD,KAAMgoB,EAAKmG,EAAKyB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKwB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAK2B,GAAK,IAAM/jC,GAAI,QAAQ,IAAMyiE,EAAK,QAAQ,EAC1D3sD,KAAMmmB,EAAKoG,EAAK0B,GAAK,IAAM/jC,KAAM,IAAI,IAAMyiE,IAAO,IAAI,EACtDxuD,KAAMgoB,EAAKmG,EAAK4B,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI;CACvDzwC,KAAMi8B,EAAKoG,EAAK2B,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAK8B,GAAK,IAAMlkC,GAAI,QAAQ,IAAM0iE,EAAK,QAAQ,EAC1D5sD,KAAMmmB,EAAKoG,EAAK6B,GAAK,IAAMlkC,KAAM,IAAI,IAAM0iE,IAAO,IAAI,EACtDzuD,KAAMgoB,EAAKmG,EAAK+B,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAK8B,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAKiC,GAAK,IAAMrkC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ,EAC1D7sD,KAAMmmB,EAAKoG,EAAKgC,GAAK,IAAMrkC,KAAM,IAAI,IAAM2iE,IAAO,IAAI,EACtD1uD,KAAMgoB,EAAKmG,EAAKkC,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKiC,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAKoC,GAAK,IAAMxkC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ;CAC1D9sD,KAAMmmB,EAAKoG,EAAKmC,GAAK,IAAMxkC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAKmG,EAAKqC,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKoC,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAKuC,GAAK,IAAM3kC,GAAI,QAAQ,IAAM6iE,EAAK,QAAQ,EAC1D/sD,KAAMmmB,EAAKoG,EAAKsC,GAAK,IAAM3kC,KAAM,IAAI,IAAM6iE,IAAO,IAAI,EACtD5uD,KAAMgoB,EAAKmG,EAAKwC,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKuC,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKmG,EAAK0C,GAAK,IAAM9kC,GAAI,QAAQ,IAAM8iE,EAAM,QAAQ,EAC3DhtD,KAAMmmB,EAAKoG,EAAKyC,GAAK,IAAM9kC,KAAM,IAAI,IAAM8iE,IAAQ,IAAI,EACvD7uD,KAAMgoB,EAAKmG,EAAK2C,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAK0C,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI;CACrD6uD,EAAO7uD,IAAK,GAAOw8B,GAAI,OAEvBsyB,EAAM/iE,GAENywC,KAAMxU,EAAKsG,EAAKkB,GAAK,IAAMu/B,EAAM,QAAQ,IAAMR,EAAK,QAAQ,EAC5D1sD,KAAMmmB,EAAKuG,EAAKiB,GAAK,IAAMu/B,IAAQ,IAAI,IAAMR,IAAO,IAAI,EACxDvuD,KAAMgoB,EAAKsG,EAAKmB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKkB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKsG,EAAKqB,GAAK,IAAM5jC,GAAI,QAAQ,IAAMyiE,EAAK,QAAQ,EAC1D3sD,KAAMmmB,EAAKuG,EAAKoB,GAAK,IAAM5jC,KAAM,IAAI,IAAMyiE,IAAO,IAAI,EACtDxuD,KAAMgoB,EAAKsG,EAAKsB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKqB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKsG,EAAKwB,GAAK,IAAM/jC,GAAI,QAAQ,IAAM0iE,EAAK,QAAQ,EAC1D5sD,KAAMmmB,EAAKuG,EAAKuB,GAAK,IAAM/jC,KAAM,IAAI,IAAM0iE,IAAO,IAAI;CACtDzuD,KAAMgoB,EAAKsG,EAAKyB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKwB,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKsG,EAAK2B,GAAK,IAAMlkC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ,EAC1D7sD,KAAMmmB,EAAKuG,EAAK0B,GAAK,IAAMlkC,KAAM,IAAI,IAAM2iE,IAAO,IAAI,EACtD1uD,KAAMgoB,EAAKsG,EAAK4B,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAK2B,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKsG,EAAK8B,GAAK,IAAMrkC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ,EAC1D9sD,KAAMmmB,EAAKuG,EAAK6B,GAAK,IAAMrkC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAKsG,EAAK+B,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAK8B,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI;CAEtBA,KAAMxU,EAAKsG,EAAKiC,GAAK,IAAMxkC,GAAI,QAAQ,IAAM6iE,EAAK,QAAQ,EAC1D/sD,KAAMmmB,EAAKuG,EAAKgC,GAAK,IAAMxkC,KAAM,IAAI,IAAM6iE,IAAO,IAAI,EACtD5uD,KAAMgoB,EAAKsG,EAAKkC,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKiC,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKsG,EAAKoC,GAAK,IAAM3kC,GAAI,QAAQ,IAAM8iE,EAAM,QAAQ,EAC3DhtD,KAAMmmB,EAAKuG,EAAKmC,GAAK,IAAM3kC,KAAM,IAAI,IAAM8iE,IAAQ,IAAI,EACvD7uD,KAAMgoB,EAAKsG,EAAKqC,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKoC,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAKsG,EAAKuC,GAAK,IAAM9kC,GAAI,QAAQ,IAAM+iE,EAAM,QAAQ,EAC3DjtD,KAAMmmB,EAAKuG,EAAKsC,GAAK,IAAM9kC,KAAM,IAAI,IAAM+iE,IAAQ,IAAI,EACvD9uD,KAAMgoB,EAAKsG,EAAKwC,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI;CACvDzwC,KAAMi8B,EAAKuG,EAAKuC,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,GAAI,OAEvBuyB,EAAMhjE,GAENywC,KAAMxU,EAAKyG,EAAKe,GAAK,IAAMw/B,EAAM,QAAQ,IAAMR,EAAK,QAAQ,EAC5D3sD,KAAMmmB,EAAK0G,EAAKc,GAAK,IAAMw/B,IAAQ,IAAI,IAAMR,IAAO,IAAI,EACxDxuD,KAAMgoB,EAAKyG,EAAKgB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKe,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKyG,EAAKkB,GAAK,IAAM5jC,GAAI,QAAQ,IAAM0iE,EAAK,QAAQ,EAC1D5sD,KAAMmmB,EAAK0G,EAAKiB,GAAK,IAAM5jC,KAAM,IAAI,IAAM0iE,IAAO,IAAI,EACtDzuD,KAAMgoB,EAAKyG,EAAKmB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKkB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKyG,EAAKqB,GAAK,IAAM/jC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ;CAC1D7sD,KAAMmmB,EAAK0G,EAAKoB,GAAK,IAAM/jC,KAAM,IAAI,IAAM2iE,IAAO,IAAI,EACtD1uD,KAAMgoB,EAAKyG,EAAKsB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKqB,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKyG,EAAKwB,GAAK,IAAMlkC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ,EAC1D9sD,KAAMmmB,EAAK0G,EAAKuB,GAAK,IAAMlkC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAKyG,EAAKyB,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKwB,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKyG,EAAK2B,GAAK,IAAMrkC,GAAI,QAAQ,IAAM6iE,EAAK,QAAQ,EAC1D/sD,KAAMmmB,EAAK0G,EAAK0B,GAAK,IAAMrkC,KAAM,IAAI,IAAM6iE,IAAO,IAAI,EACtD5uD,KAAMgoB,EAAKyG,EAAK4B,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAK2B,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI;CACrD4uD,EAAM5uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAKyG,EAAK8B,GAAK,IAAMxkC,GAAI,QAAQ,IAAM8iE,EAAM,QAAQ,EAC3DhtD,KAAMmmB,EAAK0G,EAAK6B,GAAK,IAAMxkC,KAAM,IAAI,IAAM8iE,IAAQ,IAAI,EACvD7uD,KAAMgoB,EAAKyG,EAAK+B,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAK8B,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAKyG,EAAKiC,GAAK,IAAM3kC,GAAI,QAAQ,IAAM+iE,EAAM,QAAQ,EAC3DjtD,KAAMmmB,EAAK0G,EAAKgC,GAAK,IAAM3kC,KAAM,IAAI,IAAM+iE,IAAQ,IAAI,EACvD9uD,KAAMgoB,EAAKyG,EAAKkC,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKiC,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAKyG,EAAKoC,GAAK,IAAM9kC,GAAI,QAAQ,IAAMgjE,EAAM,QAAQ,EAC3DltD,KAAMmmB,EAAK0G,EAAKmC,GAAK,IAAM9kC,KAAM,IAAI,IAAMgjE,IAAQ,IAAI;CACvD/uD,KAAMgoB,EAAKyG,EAAKqC,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKoC,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD+uD,EAAO/uD,IAAK,GAAOw8B,GAAI,OAEvBwyB,EAAMjjE,GAENywC,KAAMxU,EAAK4G,EAAKY,GAAK,IAAMy/B,GAAM,QAAQ,IAAMR,EAAK,QAAQ,EAC5D5sD,KAAMmmB,EAAK6G,EAAKW,GAAK,IAAMy/B,KAAQ,IAAI,IAAMR,IAAO,IAAI,EACxDzuD,KAAMgoB,EAAK4G,EAAKa,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKY,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK4G,EAAKe,GAAK,IAAM5jC,GAAI,QAAQ,IAAM2iE,EAAK,QAAQ,EAC1D7sD,KAAMmmB,EAAK6G,EAAKc,GAAK,IAAM5jC,KAAM,IAAI,IAAM2iE,IAAO,IAAI,EACtD1uD,KAAMgoB,EAAK4G,EAAKgB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKe,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI;CAEtBA,KAAMxU,EAAK4G,EAAKkB,GAAK,IAAM/jC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ,EAC1D9sD,KAAMmmB,EAAK6G,EAAKiB,GAAK,IAAM/jC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAK4G,EAAKmB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKkB,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK4G,EAAKqB,GAAK,IAAMlkC,GAAI,QAAQ,IAAM6iE,EAAK,QAAQ,EAC1D/sD,KAAMmmB,EAAK6G,EAAKoB,GAAK,IAAMlkC,KAAM,IAAI,IAAM6iE,IAAO,IAAI,EACtD5uD,KAAMgoB,EAAK4G,EAAKsB,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKqB,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK4G,EAAKwB,GAAK,IAAMrkC,GAAI,QAAQ,IAAM8iE,EAAM,QAAQ,EAC3DhtD,KAAMmmB,EAAK6G,EAAKuB,GAAK,IAAMrkC,KAAM,IAAI,IAAM8iE,IAAQ,IAAI,EACvD7uD,KAAMgoB,EAAK4G,EAAKyB,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI;CACvDzwC,KAAMi8B,EAAK6G,EAAKwB,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAK4G,EAAK2B,GAAK,IAAMxkC,GAAI,QAAQ,IAAM+iE,EAAM,QAAQ,EAC3DjtD,KAAMmmB,EAAK6G,EAAK0B,GAAK,IAAMxkC,KAAM,IAAI,IAAM+iE,IAAQ,IAAI,EACvD9uD,KAAMgoB,EAAK4G,EAAK4B,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAK2B,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAK4G,EAAK8B,GAAK,IAAM3kC,GAAI,QAAQ,IAAMgjE,EAAM,QAAQ,EAC3DltD,KAAMmmB,EAAK6G,EAAK6B,GAAK,IAAM3kC,KAAM,IAAI,IAAMgjE,IAAQ,IAAI,EACvD/uD,KAAMgoB,EAAK4G,EAAK+B,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAK8B,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD+uD,EAAO/uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAK4G,EAAKiC,GAAK,IAAM9kC,GAAI,QAAQ,IAAMijE,EAAM,QAAQ;CAC3DntD,KAAMmmB,EAAK6G,EAAKgC,GAAK,IAAM9kC,KAAM,IAAI,IAAMijE,IAAQ,IAAI,EACvDhvD,KAAMgoB,EAAK4G,EAAKkC,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKiC,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDgvD,EAAOhvD,IAAK,GAAOw8B,GAAI,OAEvByyB,GAAMljE,GAENywC,KAAMxU,EAAK+G,EAAKS,GAAK,IAAM0/B,GAAM,QAAQ,IAAMR,EAAK,QAAQ,EAC5D7sD,KAAMmmB,EAAKgH,EAAKQ,GAAK,IAAM0/B,KAAQ,IAAI,IAAMR,IAAO,IAAI,EACxD1uD,KAAMgoB,EAAK+G,EAAKU,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKS,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK+G,EAAKY,GAAK,IAAM5jC,GAAI,QAAQ,IAAM4iE,EAAK,QAAQ,EAC1D9sD,KAAMmmB,EAAKgH,EAAKW,GAAK,IAAM5jC,KAAM,IAAI,IAAM4iE,IAAO,IAAI,EACtD3uD,KAAMgoB,EAAK+G,EAAKa,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKY,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI;CACrD2uD,EAAM3uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK+G,EAAKe,GAAK,IAAM/jC,GAAI,QAAQ,IAAM6iE,EAAK,QAAQ,EAC1D/sD,KAAMmmB,EAAKgH,EAAKc,GAAK,IAAM/jC,KAAM,IAAI,IAAM6iE,IAAO,IAAI,EACtD5uD,KAAMgoB,EAAK+G,EAAKgB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKe,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,GAAI,OAEtBA,KAAMxU,EAAK+G,EAAKkB,GAAK,IAAMlkC,GAAI,QAAQ,IAAM8iE,EAAM,QAAQ,EAC3DhtD,KAAMmmB,EAAKgH,EAAKiB,GAAK,IAAMlkC,KAAM,IAAI,IAAM8iE,IAAQ,IAAI,EACvD7uD,KAAMgoB,EAAK+G,EAAKmB,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKkB,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAK+G,EAAKqB,GAAK,IAAMrkC,GAAI,QAAQ,IAAM+iE,EAAM,QAAQ,EAC3DjtD,KAAMmmB,EAAKgH,EAAKoB,GAAK,IAAMrkC,KAAM,IAAI,IAAM+iE,IAAQ,IAAI;CACvD9uD,KAAMgoB,EAAK+G,EAAKsB,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKqB,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAK+G,EAAKwB,GAAK,IAAMxkC,GAAI,QAAQ,IAAMgjE,EAAM,QAAQ,EAC3DltD,KAAMmmB,EAAKgH,EAAKuB,GAAK,IAAMxkC,KAAM,IAAI,IAAMgjE,IAAQ,IAAI,EACvD/uD,KAAMgoB,EAAK+G,EAAKyB,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKwB,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD+uD,EAAO/uD,IAAK,GAAOw8B,GAAI,OAEvBA,KAAMxU,EAAK+G,EAAK2B,GAAK,IAAM3kC,GAAI,QAAQ,IAAMijE,EAAM,QAAQ,EAC3DntD,KAAMmmB,EAAKgH,EAAK0B,GAAK,IAAM3kC,KAAM,IAAI,IAAMijE,IAAQ,IAAI,EACvDhvD,KAAMgoB,EAAK+G,EAAK4B,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAK2B,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDgvD,EAAOhvD,IAAK,GAAOw8B,GAAI;CAEvBA,KAAMxU,EAAK+G,EAAK8B,GAAK,IAAM9kC,GAAI,QAAQ,IAAMkjE,GAAM,QAAQ,EAC3DptD,KAAMmmB,EAAKgH,EAAK6B,GAAK,IAAM9kC,KAAM,IAAI,IAAMkjE,KAAQ,IAAI,EACvDjvD,KAAMgoB,EAAK+G,EAAK+B,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,KAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAK8B,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDivD,GAAOjvD,IAAK,GAAOw8B,GAAI,OAEvB0yB,GAAMnjE,GAEN4hE,GAAQ0B,GAAG,IAAI,GAAKjB,EACpBT,GAAQ0B,GAAG,IAAI,GAAKhB,EACpBV,GAAQ0B,GAAG,IAAI,GAAKh4B,EACpBs2B,GAAQ0B,GAAG,KAAK,GAAKf,EACrBX,GAAQ0B,GAAG,KAAK,GAAKd,EACrBZ,GAAQ0B,GAAG,KAAK,GAAKb,EACrBb,GAAQ0B,GAAG,KAAK,GAAKZ,EACrBd,GAAQ0B,GAAG,KAAK,GAAKX,EAGzBW,GAAM1vE,GAAG5e,GAAE6rB,GAAE,GAAI,EACjB+gE,GAAQ0B,GAAG,IAAI,GAAKV,EACpBhB,GAAQ0B,GAAG,IAAI,GAAKT,EACpBjB,GAAQ0B,GAAG,IAAI,GAAKR,EACpBlB,GAAQ0B,GAAG,KAAK,GAAKP,EACrBnB,GAAQ0B,GAAG,KAAK,GAAKN,EACrBpB,GAAQ0B,GAAG,KAAK,GAAKL,EACrBrB,GAAQ0B,GAAG,KAAK,GAAKJ,GACrBtB,GAAQ0B,GAAG,KAAK,GAAKH,aAuDpB95B,EAAMvqC,EAAGmjE,EAAIruE,GAClBkL,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACRruE,EAAMA,EAAE;KAEJ+tC,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGpB,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAC7IQ,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGpB,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAAGG,EAAM,EAC7Is9B,EAAK,EAAGC,EAAK,EAAGh3B,EAAK,EAAGi3B,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACnI1yB,EAAI,EAAG36B,GAAI,EAAG7B,GAAI,EAAG74B,GAAI,EAAGw7B,GAAI,EAAG5W,GAAI,EAAGvN,GAAI,EAC9CugC,GAAI,EAAGqpB,GAAK,EAAGxoD,GAAI,EAAG7e,GAAI,EAAG6rB,GAAI,EAAGlM,GAAI,EAAGyuE,GAAK,EAAGG,GAAK,EAAGD,GAAK,QAG3DtuF,GAAE,IAAMitF,EAAG,GAAIjtF,GAAKA,GAAE,EAAG,EAAI,CAClCsuF,GAAK1vE,GAAG5e,IAAG,GAAG,EACd4sD,EAAMggC,EAAQ9iE,EAAE9pB,IAAI,GAAG,EAAG2sD,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC5D6O,EAAIxU,EAAK0F,EAAIA,GAAK,EAClB7rB,IAAKmmB,EAAK0F,EAAIC,GAAK,IAAM6O,IAAM,IAAI,EACnCx8B,IAAKgoB,EAAK2F,EAAIA,GAAK,IAAM9rB,KAAM,IAAI,EACnC8rD,EAAQ0B,IAAK,GAAMxtD,IAAK,GAAO26B,EAAI,QACnCmxB,GAAQ0B,GAAG,IAAI,GAAKrvD,OAIlBpgB,GAAI,GAAIA,GAAE,IAAMouE,EAAG,GAAIpuE,GAAKA,GAAE,EAAG,EAAI;AACvCuvE,GAAKtkE,EAAEjL,GAAE,EAAGyvE,GAAK1vE,GAAGC,IAAG,GAAG,EAE1B+tC,EAAMggC,EAAQwB,IAAK,GAAG,EAAGzhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE3D8B,EAAMk+B,GAAQwB,GAAG,IAAI,GAAG,EAAG3/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE7D+M,EAAIxU,EAAK0F,EAAI8B,GAAK,EAClB3tB,IAAKmmB,EAAK0F,EAAI+B,GAAK,IAAM+M,IAAM,IAAI,EACnCx8B,IAAKgoB,EAAK2F,EAAI6B,GAAK,IAAM3tB,GAAI,QAAQ,EACrC9V,KAAMi8B,EAAK2F,EAAI8B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EAEpDxhB,GAAImvE,GAAQ0B,GAAG,IAAI,GAAG,EACtB7yB,GAAKh+C,GAAI,UAAYg+C,EAAI,SAAW,GAAG,EACvCx8B,KAAMxhB,KAAM,MAAQwhB,GAAI,SAAW,GAAG,IAAMw8B,IAAM,IAAI,EACtDmxB,GAAQ0B,GAAG,IAAI,GAAMrvD,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,IAAI,GAAG,EACtB7yB,IAAMh+C,GAAI,UAAYuN,GAAI,SAAW,GAAG,GAAK5kB,GAAE,EAC/C64B,KAAMxhB,KAAM,KAAQuN,KAAM,IAAO,GAAG,IAAMywC,IAAM,IAAI,EACpDmxB,GAAQ0B,GAAG,IAAI,GAAMrvD,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,MAEL74B,GAAI,CACLqX,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG;CACvB7yB,GAAKh+C,GAAI,QAAUrX,GAAE,EACrB64B,IAAKxhB,KAAM,KAAOg+C,IAAM,IAAI,EAC5BmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,YAKxC58C,GAAI,GAAIA,GAAE,IAAMouE,EAAG,GAAIpuE,GAAKA,GAAE,GAAI,EAAI,CACxCuvE,GAAKtkE,EAAEjL,GAAE,EAAGyvE,GAAK1vE,GAAGC,IAAG,GAAG,EAE1B+tC,EAAMggC,EAAQwB,IAAK,GAAG,EAAGzhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC3DG,EAAM6/B,GAAQwB,GAAG,IAAI,GAAG,EAAGthC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE7D2B,EAAMk+B,GAAQwB,GAAG,IAAI,GAAG,EAAG3/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAM+9B,GAAQwB,GAAG,KAAK,GAAG,EAAGx/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE9D4M,EAAIxU,EAAK0F,EAAK8B,GAAK,EACnB3tB,GAAImmB,EAAK2F,EAAK6B,GAAK,EACnBxvB,KAAMgoB,EAAK0F,EAAK+B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK8B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDouD,EAAMpuD,IAAK,GAAOw8B,EAAI,OAEtBA,GAAKxU,EAAK0F,EAAKiC,GAAK,IAAM5jC,GAAI,QAAQ,EACtC8V,IAAKmmB,EAAK2F,EAAKgC,GAAK,IAAM5jC,KAAM,IAAI,EACpCiU,KAAMgoB,EAAK0F,EAAKkC,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAK2F,EAAKiC,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,EAAI,OAEtBnF,EAAKtrC,GAELywC,GAAKxU,EAAK6F,EAAK2B,GAAK,IAAM6+B,EAAK,QAAQ,EACvCxsD,IAAKmmB,EAAK8F,EAAK0B,GAAK,IAAM6+B,IAAO,IAAI,EACrCruD,KAAMgoB,EAAK6F,EAAK4B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK2B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAK8B,GAAK,IAAM0H,EAAK,QAAQ,IAAMtrC,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAK6B,GAAK,IAAM0H,IAAO,IAAI,IAAMtrC,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAK+B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK8B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI,OAEtB8xB,EAAKviE,GAELvN,GAAImvE,GAAQ0B,GAAG,IAAI,GAAG,EACtB7yB,GAAKh+C,GAAI,UAAY4vE,EAAK,SAAW,GAAG,EACxCpuD,KAAMxhB,KAAM,KAAQ4vE,IAAO,IAAO,GAAG,IAAM5xB,IAAM,IAAI;CACrDmxB,GAAQ0B,GAAG,IAAI,GAAMrvD,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAY6vE,EAAK,SAAW,GAAG,GAAMlnF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQ6vE,IAAO,IAAO,GAAG,IAAM7xB,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAY64C,EAAK,SAAW,GAAG,GAAKlwD,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ64C,IAAO,IAAO,GAAG,IAAMmF,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAY8vE,EAAK,SAAW,GAAG,GAAKnnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ8vE,IAAO,IAAO,GAAG,IAAM9xB,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,OAEJtf,GAAI,KAAMvZ,IAAOuZ,GAAE,GAAK,GAAMA,GAAKA,GAAE,EAAG,EAAI;AAC9ClC,GAAImvE,GAAQ0B,GAAG3uE,KAAI,GAAG,EACtB87C,GAAKh+C,GAAI,QAAUrX,GAAE,EACrB64B,IAAKxhB,KAAM,KAAOg+C,IAAM,IAAI,EAC5BmxB,GAAQ0B,GAAG3uE,KAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,QAKZpgB,GAAI,GAAIA,GAAE,IAAMouE,EAAG,GAAIpuE,GAAKA,GAAE,GAAI,EAAI,CACxCuvE,GAAKtkE,EAAEjL,GAAE,EAAGyvE,GAAK1vE,GAAGC,IAAG,GAAG,EAE1B+tC,EAAMggC,EAAQwB,IAAK,GAAG,EAAGzhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC3DG,EAAM6/B,GAAQwB,GAAG,IAAI,GAAG,EAAGthC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAM0/B,GAAQwB,GAAG,IAAI,GAAG,EAAGnhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAMu/B,GAAQwB,GAAG,KAAK,GAAG,EAAGhhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE9DqB,EAAMk+B,GAAQwB,GAAG,KAAK,GAAG,EAAG3/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAM+9B,GAAQwB,GAAG,KAAK,GAAG,EAAGx/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAM49B,GAAQwB,GAAG,KAAK,GAAG,EAAGr/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAMy9B,GAAQwB,GAAG,KAAK,GAAG,EAAGl/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE9DsM,EAAIxU,EAAK0F,EAAK8B,GAAK,EACnB3tB,GAAImmB,EAAK2F,EAAK6B,GAAK;CACnBxvB,KAAMgoB,EAAK0F,EAAK+B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK8B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDouD,EAAMpuD,IAAK,GAAOw8B,EAAI,OAEtBA,GAAKxU,EAAK0F,EAAKiC,GAAK,IAAM5jC,GAAI,QAAQ,EACtC8V,IAAKmmB,EAAK2F,EAAKgC,GAAK,IAAM5jC,KAAM,IAAI,EACpCiU,KAAMgoB,EAAK0F,EAAKkC,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKiC,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,EAAI,OAEtBA,GAAKxU,EAAK0F,EAAKoC,GAAK,IAAM/jC,GAAI,QAAQ,EACtC8V,IAAKmmB,EAAK2F,EAAKmC,GAAK,IAAM/jC,KAAM,IAAI,EACpCiU,KAAMgoB,EAAK0F,EAAKqC,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKoC,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI,OAEtBA,GAAKxU,EAAK0F,EAAKuC,GAAK,IAAMlkC,GAAI,QAAQ,EACtC8V,IAAKmmB,EAAK2F,EAAKsC,GAAK,IAAMlkC,KAAM,IAAI,EACpCiU,KAAMgoB,EAAK0F,EAAKwC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAK2F,EAAKuC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtB+xB,EAAKxiE,GAELywC,GAAKxU,EAAK6F,EAAK2B,GAAK,IAAM6+B,EAAK,QAAQ,EACvCxsD,IAAKmmB,EAAK8F,EAAK0B,GAAK,IAAM6+B,IAAO,IAAI,EACrCruD,KAAMgoB,EAAK6F,EAAK4B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK2B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAK8B,GAAK,IAAM0H,EAAK,QAAQ,IAAMtrC,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAK6B,GAAK,IAAM0H,IAAO,IAAI,IAAMtrC,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAK+B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK8B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAKiC,GAAK,IAAMw+B,EAAK,QAAQ,IAAMviE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAKgC,GAAK,IAAMw+B,IAAO,IAAI,IAAMviE,KAAM,IAAI;CACtDiU,KAAMgoB,EAAK6F,EAAKkC,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKiC,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAKoC,GAAK,IAAMs+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAKmC,GAAK,IAAMs+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAKqC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKoC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBgyB,EAAKziE,GAELywC,GAAKxU,EAAKgG,EAAKwB,GAAK,IAAM6H,EAAK,QAAQ,EACvCx1B,IAAKmmB,EAAKiG,EAAKuB,GAAK,IAAM6H,IAAO,IAAI,EACrCr3B,KAAMgoB,EAAKgG,EAAKyB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKwB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAK2B,GAAK,IAAM2+B,EAAK,QAAQ,IAAMviE,GAAI,QAAQ;CAC1D8V,KAAMmmB,EAAKiG,EAAK0B,GAAK,IAAM2+B,IAAO,IAAI,IAAMviE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAK4B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK2B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAK8B,GAAK,IAAMy+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAK6B,GAAK,IAAMy+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAK+B,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK8B,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAKiC,GAAK,IAAMu+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAKgC,GAAK,IAAMu+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAKkC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKiC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI;CAEtBiyB,EAAK1iE,GAELywC,GAAKxU,EAAKmG,EAAKqB,GAAK,IAAM8+B,EAAK,QAAQ,EACvCzsD,IAAKmmB,EAAKoG,EAAKoB,GAAK,IAAM8+B,IAAO,IAAI,EACrCtuD,KAAMgoB,EAAKmG,EAAKsB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKqB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAKwB,GAAK,IAAM4+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAKuB,GAAK,IAAM4+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAKyB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKwB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAK2B,GAAK,IAAM0+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAK0B,GAAK,IAAM0+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAK4B,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAK2B,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI;CACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAK8B,GAAK,IAAMw+B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAK6B,GAAK,IAAMw+B,IAAO,IAAI,IAAM1iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAK+B,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAK8B,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBkyB,EAAK3iE,GAELvN,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG,EACvB7yB,GAAKh+C,GAAI,UAAY4vE,EAAK,SAAW,GAAG,EACxCpuD,KAAMxhB,KAAM,KAAQ4vE,IAAO,IAAO,GAAG,IAAM5xB,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAY6vE,EAAK,SAAW,GAAG,GAAMlnF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQ6vE,IAAO,IAAO,GAAG,IAAM7xB,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG;CACvB7yB,IAAMh+C,GAAI,UAAY64C,EAAK,SAAW,GAAG,GAAKlwD,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ64C,IAAO,IAAO,GAAG,IAAMmF,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,GAAQ0B,GAAG,KAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAY8vE,EAAK,SAAW,GAAG,GAAKnnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ8vE,IAAO,IAAO,GAAG,IAAM9xB,IAAM,IAAI,EACrDmxB,GAAQ0B,GAAG,KAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,EAAQ0B,GAAG,IAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAY+vE,EAAK,SAAW,GAAG,GAAKpnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ+vE,IAAO,IAAO,GAAG,IAAM/xB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG,IAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,EAAQ0B,GAAG,IAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAYgwE,EAAK,SAAW,GAAG,GAAKrnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQgwE,IAAO,IAAO,GAAG,IAAMhyB,IAAM,IAAI;CACrDmxB,EAAQ0B,GAAG,IAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,EAAQ0B,GAAG,IAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAYiwE,EAAK,SAAW,GAAG,GAAKtnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQiwE,IAAO,IAAO,GAAG,IAAMjyB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG,IAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,GAEVxhB,GAAImvE,EAAQ0B,GAAG,IAAK,GAAG,EACvB7yB,IAAMh+C,GAAI,UAAYkwE,EAAK,SAAW,GAAG,GAAKvnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQkwE,IAAO,IAAO,GAAG,IAAMlyB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG,IAAK,GAAMrvD,IAAK,GAAOw8B,EAAI,OACtCr1D,GAAI64B,KAAM,OAEJtf,GAAI,KAAMvZ,IAAOuZ,GAAE,GAAK,GAAMA,GAAKA,GAAE,EAAG,EAAI,CAC9ClC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,GAAKh+C,GAAI,QAAUrX,GAAE,EACrB64B,IAAKxhB,KAAM,KAAOg+C,IAAM,IAAI,EAC5BmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,QAKZ+e,GAAI,IAAKA,GAAE,IAAMivC,EAAG,GAAIjvC,GAAIA,IAAK,EAAI,CACvCqpB,GAAKrpB,IAAK;KAEJn/B,GAAI,GAAIA,GAAE,IAAMouE,EAAG,GAAIpuE,GAAKA,GAAEwoD,GAAI,EAAI,CACxCinB,GAAK1vE,GAAGC,IAAG,GAAG,EAEd+iB,GAAI,MACE5hC,GAAI,GAAIA,GAAE,IAAMg+C,GAAE,GAAIh+C,GAAKA,GAAE,GAAI,EAAI,CACvCouF,IAAMtkE,EAAEjL,GAAE,GAAG7e,GAAE,EAEf4sD,EAAMggC,EAAQwB,IAAK,GAAG,EAAGzhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC3DG,EAAM6/B,GAAQwB,GAAG,IAAI,GAAG,EAAGthC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAM0/B,GAAQwB,GAAG,IAAI,GAAG,EAAGnhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAMu/B,GAAQwB,GAAG,KAAK,GAAG,EAAGhhC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAMo/B,GAAQwB,GAAG,KAAK,GAAG,EAAG7gC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAMi/B,GAAQwB,GAAG,KAAK,GAAG,EAAG1gC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAM8+B,GAAQwB,GAAG,KAAK,GAAG,EAAGvgC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAM2+B,GAAQwB,GAAG,KAAK,GAAG,EAAGpgC,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE9D2/B,EAAKC,EAAKC,EAAMC,EAAMC,EAAMC,EAAMC,EAAMC,EAAM/nF,GAAI,MAE5CylB,GAAI,GAAIA,GAAE,IAAMmyB,GAAE,GAAInyB,GAAKA,GAAE,GAAI,EAAI,CACvC0iE,KAAOzkE,EAAEjL,GAAE,GAAGm/B,GAAE,GAAGnyB,GAAE,EAErB6iC,EAAMk+B,EAAQ2B,IAAK,GAAG;AAAG9/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC3DG,EAAM+9B,GAAQ2B,GAAG,IAAI,GAAG,EAAG3/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAM49B,GAAQ2B,GAAG,IAAI,GAAG,EAAGx/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC7DG,EAAMy9B,GAAQ2B,GAAG,KAAK,GAAG,EAAGr/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAMs9B,GAAQ2B,GAAG,KAAK,GAAG,EAAGl/B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAMm9B,GAAQ2B,GAAG,KAAK,GAAG,EAAG/+B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAMg9B,GAAQ2B,GAAG,KAAK,GAAG,EAAG5+B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAC9DG,EAAM68B,GAAQ2B,GAAG,KAAK,GAAG,EAAGz+B,EAAMC,EAAM,OAAQA,EAAMA,IAAQ,GAE9Ds9B,EAAKC,EAAKh3B,EAAKi3B,EAAKC,EAAKC,EAAKC,EAAKC,EAAK,EAExClyB,IAAMxU,EAAK0F,EAAK8B,GAAK,IAAM4+B,EAAK,QAAQ,IAAMO,EAAK,QAAQ,EAC3D9sD,KAAMmmB,EAAK2F,EAAK6B,GAAK,IAAM4+B,IAAO,IAAI,IAAMO,IAAO,IAAI,EACvD3uD,KAAMgoB,EAAK0F,EAAK+B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK8B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDouD,EAAMpuD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAK0F,EAAKiC,GAAK,IAAM0+B,EAAK,QAAQ,IAAMtiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAKgC,GAAK,IAAM0+B,IAAO,IAAI,IAAMtiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK0F,EAAKkC,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKiC,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK0F,EAAKoC,GAAK,IAAMuH,EAAK,QAAQ,IAAMtrC,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAKmC,GAAK,IAAMuH,IAAO,IAAI,IAAMtrC,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK0F,EAAKqC,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKoC,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK0F,EAAKuC,GAAK,IAAMq+B,EAAK,QAAQ,IAAMviE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAKsC,GAAK,IAAMq+B,IAAO,IAAI,IAAMviE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK0F,EAAKwC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAK2F,EAAKuC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK0F,EAAK0C,GAAK,IAAMm+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAKyC,GAAK,IAAMm+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK0F,EAAK2C,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK0C,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK0F,EAAK6C,GAAK,IAAMi+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAK4C,GAAK,IAAMi+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK0F,EAAK8C,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAK6C,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK0F,EAAKgD,GAAK,IAAM+9B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAK+C,GAAK,IAAM+9B,IAAO,IAAI,IAAM1iE,KAAM,IAAI;CACtDiU,KAAMgoB,EAAK0F,EAAKiD,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKgD,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK0F,EAAKmD,GAAK,IAAM69B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK2F,EAAKkD,GAAK,IAAM69B,IAAO,IAAI,IAAM3iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK0F,EAAKoD,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK2F,EAAKmD,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBmyB,EAAK5iE,GAELywC,IAAMxU,EAAK6F,EAAK2B,GAAK,IAAM6+B,EAAK,QAAQ,IAAMO,EAAK,QAAQ,EAC3D/sD,KAAMmmB,EAAK8F,EAAK0B,GAAK,IAAM6+B,IAAO,IAAI,IAAMO,IAAO,IAAI,EACvD5uD,KAAMgoB,EAAK6F,EAAK4B,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK2B,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDquD,EAAMruD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAK6F,EAAK8B,GAAK,IAAM0H,EAAK,QAAQ,IAAMtrC,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAK6B,GAAK,IAAM0H,IAAO,IAAI,IAAMtrC,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAK+B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK8B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAKiC,GAAK,IAAMw+B,EAAK,QAAQ,IAAMviE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAKgC,GAAK,IAAMw+B,IAAO,IAAI,IAAMviE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAKkC,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKiC,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAKoC,GAAK,IAAMs+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAKmC,GAAK,IAAMs+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAKqC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAK8F,EAAKoC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAKuC,GAAK,IAAMo+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAKsC,GAAK,IAAMo+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAKwC,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKuC,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAK0C,GAAK,IAAMk+B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAKyC,GAAK,IAAMk+B,IAAO,IAAI,IAAM1iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAK2C,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK0C,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAK6C,GAAK,IAAMg+B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAK4C,GAAK,IAAMg+B,IAAO,IAAI,IAAM3iE,KAAM,IAAI;CACtDiU,KAAMgoB,EAAK6F,EAAK8C,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAK6C,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK6F,EAAKgD,GAAK,IAAM89B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK8F,EAAK+C,GAAK,IAAM89B,IAAO,IAAI,IAAM5iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK6F,EAAKiD,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK8F,EAAKgD,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBoyB,EAAK7iE,GAELywC,IAAMxU,EAAKgG,EAAKwB,GAAK,IAAM6H,EAAK,QAAQ,IAAMw3B,EAAM,QAAQ,EAC5DhtD,KAAMmmB,EAAKiG,EAAKuB,GAAK,IAAM6H,IAAO,IAAI,IAAMw3B,IAAQ,IAAI,EACxD7uD,KAAMgoB,EAAKgG,EAAKyB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKwB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDq3B,EAAMr3B,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAKgG,EAAK2B,GAAK,IAAM2+B,EAAK,QAAQ,IAAMviE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAK0B,GAAK,IAAM2+B,IAAO,IAAI,IAAMviE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAK4B,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK2B,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAK8B,GAAK,IAAMy+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAK6B,GAAK,IAAMy+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAK+B,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK8B,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAKiC,GAAK,IAAMu+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAKgC,GAAK,IAAMu+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAKkC,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAKiG,EAAKiC,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAKoC,GAAK,IAAMq+B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAKmC,GAAK,IAAMq+B,IAAO,IAAI,IAAM1iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAKqC,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKoC,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAKuC,GAAK,IAAMm+B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAKsC,GAAK,IAAMm+B,IAAO,IAAI,IAAM3iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAKwC,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAKuC,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAK0C,GAAK,IAAMi+B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAKyC,GAAK,IAAMi+B,IAAO,IAAI,IAAM5iE,KAAM,IAAI;CACtDiU,KAAMgoB,EAAKgG,EAAK2C,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK0C,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKgG,EAAK6C,GAAK,IAAM+9B,EAAK,QAAQ,IAAM7iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKiG,EAAK4C,GAAK,IAAM+9B,IAAO,IAAI,IAAM7iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKgG,EAAK8C,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKiG,EAAK6C,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,EAAI,OAEtBqyB,EAAM9iE,GAENywC,IAAMxU,EAAKmG,EAAKqB,GAAK,IAAM8+B,EAAK,QAAQ,IAAMQ,EAAM,QAAQ,EAC5DjtD,KAAMmmB,EAAKoG,EAAKoB,GAAK,IAAM8+B,IAAO,IAAI,IAAMQ,IAAQ,IAAI,EACxD9uD,KAAMgoB,EAAKmG,EAAKsB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKqB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDsuD,EAAMtuD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAKmG,EAAKwB,GAAK,IAAM4+B,EAAK,QAAQ,IAAMxiE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAKuB,GAAK,IAAM4+B,IAAO,IAAI,IAAMxiE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAKyB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKwB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAK2B,GAAK,IAAM0+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAK0B,GAAK,IAAM0+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAK4B,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAK2B,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAK8B,GAAK,IAAMw+B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAK6B,GAAK,IAAMw+B,IAAO,IAAI,IAAM1iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAK+B,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAKoG,EAAK8B,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAKiC,GAAK,IAAMs+B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAKgC,GAAK,IAAMs+B,IAAO,IAAI,IAAM3iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAKkC,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKiC,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAKoC,GAAK,IAAMo+B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAKmC,GAAK,IAAMo+B,IAAO,IAAI,IAAM5iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKmG,EAAKqC,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKoC,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAKuC,GAAK,IAAMk+B,EAAK,QAAQ,IAAM7iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKoG,EAAKsC,GAAK,IAAMk+B,IAAO,IAAI,IAAM7iE,KAAM,IAAI;CACtDiU,KAAMgoB,EAAKmG,EAAKwC,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAKuC,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKmG,EAAK0C,GAAK,IAAMg+B,EAAM,QAAQ,IAAM9iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKoG,EAAKyC,GAAK,IAAMg+B,IAAQ,IAAI,IAAM9iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAKmG,EAAK2C,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKoG,EAAK0C,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,EAAI,OAEvBsyB,EAAM/iE,GAENywC,IAAMxU,EAAKsG,EAAKkB,GAAK,IAAM++B,EAAK,QAAQ,IAAMQ,EAAM,QAAQ,EAC5DltD,KAAMmmB,EAAKuG,EAAKiB,GAAK,IAAM++B,IAAO,IAAI,IAAMQ,IAAQ,IAAI,EACxD/uD,KAAMgoB,EAAKsG,EAAKmB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKkB,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDuuD,EAAMvuD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAKsG,EAAKqB,GAAK,IAAM6+B,EAAK,QAAQ,IAAMziE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKuG,EAAKoB,GAAK,IAAM6+B,IAAO,IAAI,IAAMziE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKsG,EAAKsB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKqB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKsG,EAAKwB,GAAK,IAAM2+B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKuG,EAAKuB,GAAK,IAAM2+B,IAAO,IAAI,IAAM1iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKsG,EAAKyB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKwB,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKsG,EAAK2B,GAAK,IAAMy+B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKuG,EAAK0B,GAAK,IAAMy+B,IAAO,IAAI,IAAM3iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKsG,EAAK4B,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAKuG,EAAK2B,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKsG,EAAK8B,GAAK,IAAMu+B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKuG,EAAK6B,GAAK,IAAMu+B,IAAO,IAAI,IAAM5iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKsG,EAAK+B,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAK8B,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKsG,EAAKiC,GAAK,IAAMq+B,EAAK,QAAQ,IAAM7iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKuG,EAAKgC,GAAK,IAAMq+B,IAAO,IAAI,IAAM7iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKsG,EAAKkC,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKiC,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKsG,EAAKoC,GAAK,IAAMm+B,EAAM,QAAQ,IAAM9iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKuG,EAAKmC,GAAK,IAAMm+B,IAAQ,IAAI,IAAM9iE,KAAM,IAAI;CACvDiU,KAAMgoB,EAAKsG,EAAKqC,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKoC,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAKsG,EAAKuC,GAAK,IAAMi+B,EAAM,QAAQ,IAAM/iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKuG,EAAKsC,GAAK,IAAMi+B,IAAQ,IAAI,IAAM/iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAKsG,EAAKwC,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKuG,EAAKuC,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,EAAI,OAEvBuyB,EAAMhjE,GAENywC,IAAMxU,EAAKyG,EAAKe,GAAK,IAAMg/B,EAAK,QAAQ,IAAMQ,EAAM,QAAQ,EAC5DntD,KAAMmmB,EAAK0G,EAAKc,GAAK,IAAMg/B,IAAO,IAAI,IAAMQ,IAAQ,IAAI,EACxDhvD,KAAMgoB,EAAKyG,EAAKgB,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKe,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDwuD,EAAMxuD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAKyG,EAAKkB,GAAK,IAAM8+B,EAAK,QAAQ,IAAM1iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK0G,EAAKiB,GAAK,IAAM8+B,IAAO,IAAI,IAAM1iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKyG,EAAKmB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKkB,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKyG,EAAKqB,GAAK,IAAM4+B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK0G,EAAKoB,GAAK,IAAM4+B,IAAO,IAAI,IAAM3iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKyG,EAAKsB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKqB,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKyG,EAAKwB,GAAK,IAAM0+B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK0G,EAAKuB,GAAK,IAAM0+B,IAAO,IAAI,IAAM5iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKyG,EAAKyB,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAK0G,EAAKwB,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKyG,EAAK2B,GAAK,IAAMw+B,EAAK,QAAQ,IAAM7iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK0G,EAAK0B,GAAK,IAAMw+B,IAAO,IAAI,IAAM7iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAKyG,EAAK4B,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAK2B,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAKyG,EAAK8B,GAAK,IAAMs+B,EAAM,QAAQ,IAAM9iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK0G,EAAK6B,GAAK,IAAMs+B,IAAQ,IAAI,IAAM9iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAKyG,EAAK+B,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAK8B,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAKyG,EAAKiC,GAAK,IAAMo+B,EAAM,QAAQ,IAAM/iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK0G,EAAKgC,GAAK,IAAMo+B,IAAQ,IAAI,IAAM/iE,KAAM,IAAI;CACvDiU,KAAMgoB,EAAKyG,EAAKkC,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKiC,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAKyG,EAAKoC,GAAK,IAAMk+B,EAAM,QAAQ,IAAMhjE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK0G,EAAKmC,GAAK,IAAMk+B,IAAQ,IAAI,IAAMhjE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAKyG,EAAKqC,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK0G,EAAKoC,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD+uD,EAAO/uD,IAAK,GAAOw8B,EAAI,OAEvBwyB,EAAMjjE,GAENywC,IAAMxU,EAAK4G,EAAKY,GAAK,IAAMi/B,EAAK,QAAQ,IAAMQ,EAAM,QAAQ,EAC5DptD,KAAMmmB,EAAK6G,EAAKW,GAAK,IAAMi/B,IAAO,IAAI,IAAMQ,IAAQ,IAAI,EACxDjvD,KAAMgoB,EAAK4G,EAAKa,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKY,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDyuD,EAAMzuD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAK4G,EAAKe,GAAK,IAAM++B,EAAK,QAAQ,IAAM3iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK6G,EAAKc,GAAK,IAAM++B,IAAO,IAAI,IAAM3iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK4G,EAAKgB,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKe,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK4G,EAAKkB,GAAK,IAAM6+B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK6G,EAAKiB,GAAK,IAAM6+B,IAAO,IAAI,IAAM5iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK4G,EAAKmB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKkB,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK4G,EAAKqB,GAAK,IAAM2+B,EAAK,QAAQ,IAAM7iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAK6G,EAAKoB,GAAK,IAAM2+B,IAAO,IAAI,IAAM7iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK4G,EAAKsB,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAK6G,EAAKqB,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK4G,EAAKwB,GAAK,IAAMy+B,EAAM,QAAQ,IAAM9iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK6G,EAAKuB,GAAK,IAAMy+B,IAAQ,IAAI,IAAM9iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK4G,EAAKyB,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKwB,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK4G,EAAK2B,GAAK,IAAMu+B,EAAM,QAAQ,IAAM/iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK6G,EAAK0B,GAAK,IAAMu+B,IAAQ,IAAI,IAAM/iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK4G,EAAK4B,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAK2B,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK4G,EAAK8B,GAAK,IAAMq+B,EAAM,QAAQ,IAAMhjE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK6G,EAAK6B,GAAK,IAAMq+B,IAAQ,IAAI,IAAMhjE,KAAM,IAAI;CACvDiU,KAAMgoB,EAAK4G,EAAK+B,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAK8B,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD+uD,EAAO/uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK4G,EAAKiC,GAAK,IAAMm+B,EAAM,QAAQ,IAAMjjE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAK6G,EAAKgC,GAAK,IAAMm+B,IAAQ,IAAI,IAAMjjE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK4G,EAAKkC,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAK6G,EAAKiC,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDgvD,EAAOhvD,IAAK,GAAOw8B,EAAI,OAEvByyB,EAAMljE,GAENywC,IAAMxU,EAAK+G,EAAKS,GAAK,IAAMk/B,EAAK,QAAQ,IAAMQ,EAAM,QAAQ,EAC5DrtD,KAAMmmB,EAAKgH,EAAKQ,GAAK,IAAMk/B,IAAO,IAAI,IAAMQ,IAAQ,IAAI,EACxDlvD,KAAMgoB,EAAK+G,EAAKU,GAAK,IAAM5tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKS,GAAK,IAAM5tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD0uD,EAAM1uD,IAAK,GAAOw8B,EAAI;CAEtBA,IAAMxU,EAAK+G,EAAKY,GAAK,IAAMg/B,EAAK,QAAQ,IAAM5iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKgH,EAAKW,GAAK,IAAMg/B,IAAO,IAAI,IAAM5iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK+G,EAAKa,GAAK,IAAM/tB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKY,GAAK,IAAM/tB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD2uD,EAAM3uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK+G,EAAKe,GAAK,IAAM8+B,EAAK,QAAQ,IAAM7iE,GAAI,QAAQ,EAC1D8V,KAAMmmB,EAAKgH,EAAKc,GAAK,IAAM8+B,IAAO,IAAI,IAAM7iE,KAAM,IAAI,EACtDiU,KAAMgoB,EAAK+G,EAAKgB,GAAK,IAAMluB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKe,GAAK,IAAMluB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD4uD,EAAM5uD,IAAK,GAAOw8B,EAAI,OAEtBA,IAAMxU,EAAK+G,EAAKkB,GAAK,IAAM4+B,EAAM,QAAQ,IAAM9iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKgH,EAAKiB,GAAK,IAAM4+B,IAAQ,IAAI,IAAM9iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK+G,EAAKmB,GAAK,IAAMruB,GAAI,QAAQ,IAAM26B,IAAM,IAAI;CACvDzwC,KAAMi8B,EAAKgH,EAAKkB,GAAK,IAAMruB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD6uD,EAAO7uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK+G,EAAKqB,GAAK,IAAM0+B,EAAM,QAAQ,IAAM/iE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKgH,EAAKoB,GAAK,IAAM0+B,IAAQ,IAAI,IAAM/iE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK+G,EAAKsB,GAAK,IAAMxuB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKqB,GAAK,IAAMxuB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD8uD,EAAO9uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK+G,EAAKwB,GAAK,IAAMw+B,EAAM,QAAQ,IAAMhjE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKgH,EAAKuB,GAAK,IAAMw+B,IAAQ,IAAI,IAAMhjE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK+G,EAAKyB,GAAK,IAAM3uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAKwB,GAAK,IAAM3uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrD+uD,EAAO/uD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK+G,EAAK2B,GAAK,IAAMs+B,EAAM,QAAQ,IAAMjjE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKgH,EAAK0B,GAAK,IAAMs+B,IAAQ,IAAI,IAAMjjE,KAAM,IAAI;CACvDiU,KAAMgoB,EAAK+G,EAAK4B,GAAK,IAAM9uB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAK2B,GAAK,IAAM9uB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDgvD,EAAOhvD,IAAK,GAAOw8B,EAAI,OAEvBA,IAAMxU,EAAK+G,EAAK8B,GAAK,IAAMo+B,EAAM,QAAQ,IAAMljE,GAAI,QAAQ,EAC3D8V,KAAMmmB,EAAKgH,EAAK6B,GAAK,IAAMo+B,IAAQ,IAAI,IAAMljE,KAAM,IAAI,EACvDiU,KAAMgoB,EAAK+G,EAAK+B,GAAK,IAAMjvB,GAAI,QAAQ,IAAM26B,IAAM,IAAI,EACvDzwC,KAAMi8B,EAAKgH,EAAK8B,GAAK,IAAMjvB,KAAM,IAAI,IAAM7B,KAAM,IAAI,EACrDivD,EAAOjvD,IAAK,GAAOw8B,EAAI,OAEvB0yB,EAAMnjE,GAENrL,GAAIq+B,IAAGh+C,GAAE6rB,GAAE,GAAG,EACdpO,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAY4vE,EAAK,SAAW,GAAG,GAAKjnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ4vE,IAAO,IAAO,GAAG,IAAM5xB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG;CACtB87C,IAAMh+C,GAAI,UAAY6vE,EAAK,SAAW,GAAG,GAAKlnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ6vE,IAAO,IAAO,GAAG,IAAM7xB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAY64C,EAAK,SAAW,GAAG,GAAKlwD,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ64C,IAAO,IAAO,GAAG,IAAMmF,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAY8vE,EAAK,SAAW,GAAG,GAAKnnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQ8vE,IAAO,IAAO,GAAG,IAAM9xB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAY+vE,EAAK,SAAW,GAAG,GAAKpnF,GAAE;CAChD64B,KAAMxhB,KAAM,KAAQ+vE,IAAO,IAAO,GAAG,IAAM/xB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYgwE,EAAK,SAAW,GAAG,GAAKrnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQgwE,IAAO,IAAO,GAAG,IAAMhyB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYiwE,EAAK,SAAW,GAAG,GAAKtnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQiwE,IAAO,IAAO,GAAG,IAAMjyB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYkwE,EAAK,SAAW,GAAG,GAAKvnF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQkwE,IAAO,IAAO,GAAG,IAAMlyB,IAAM,IAAI;CACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAGdtf,GAAIq+B,IAAGh+C,GAAE6rB,GAAE,GAAG,EACdpO,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,KAAOh+C,GAAI,UAAYmwE,EAAK,SAAW,GAAG,GAAKxnF,GAAE,GAAKw7B,GAAE,EACxD3C,KAAMxhB,KAAM,KAAQmwE,IAAO,IAAO,GAAG,IAAMnyB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYowE,EAAK,SAAW,GAAG,GAAKznF,GAAE,EAChD64B,KAAMxhB,KAAM,KAAQowE,IAAO,IAAO,GAAG,IAAMpyB,IAAM,IAAI,EACrDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYqwE,EAAM,SAAW,GAAG,GAAK1nF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQqwE,IAAQ,IAAO,GAAG,IAAMryB,IAAM,IAAI,EACtDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE;CACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYswE,EAAM,SAAW,GAAG,GAAK3nF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQswE,IAAQ,IAAO,GAAG,IAAMtyB,IAAM,IAAI,EACtDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYuwE,EAAM,SAAW,GAAG,GAAK5nF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQuwE,IAAQ,IAAO,GAAG,IAAMvyB,IAAM,IAAI,EACtDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYwwE,EAAM,SAAW,GAAG,GAAK7nF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQwwE,IAAQ,IAAO,GAAG,IAAMxyB,IAAM,IAAI,EACtDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAYywE,EAAM,SAAW,GAAG,GAAK9nF,GAAE;CACjD64B,KAAMxhB,KAAM,KAAQywE,IAAQ,IAAO,GAAG,IAAMzyB,IAAM,IAAI,EACtDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrCr1D,GAAI64B,KAAM,GAEVtf,GAAIA,GAAE,EAAE,EACRlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,IAAMh+C,GAAI,UAAY0wE,EAAM,SAAW,GAAG,GAAK/nF,GAAE,EACjD64B,KAAMxhB,KAAM,KAAQ0wE,IAAQ,IAAO,GAAG,IAAM1yB,IAAM,IAAI,EACtDmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrC75B,GAAI3C,KAAM,OAGRtf,GAAIA,GAAE,EAAE,IAAKiiB,IAAOjiB,GAAE,GAAM0nD,IAAI,EAAM1nD,GAAKA,GAAE,EAAG,EAAI,CACtDlC,GAAImvE,EAAQ0B,GAAG3uE,IAAI,GAAG,EACtB87C,GAAKh+C,GAAI,QAAUmkB,GAAE,EACrB3C,IAAKxhB,KAAM,KAAOg+C,IAAM,IAAI,EAC5BmxB,EAAQ0B,GAAG3uE,IAAI,GAAMsf,IAAK,GAAOw8B,EAAI,OACrC75B,GAAI3C,KAAM,eAoBjB62B,EAAM9D,EAAGw8B,EAAIlpC,EAAGmpC,EAAIhiB,GACzBza,EAAMA,EAAE,EACRw8B,EAAKA,EAAG,EACRlpC,EAAMA,EAAE,EACRmpC,EAAKA,EAAG,EACRhiB,EAAMA,EAAE;KAEJ/sD,EAAI,EAAGs+B,EAAI,EAAGj0B,EAAI,EAClBwyC,EAAK,EAAGmyB,EAAK,EACbC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EACrBC,EAAK,EAAGC,EAAK,EAAGlpC,EAAK,EAAGmpC,EAAK,EAC7BtqB,EAAK,EAAGC,EAAK,EAAG35C,EAAI,EAAG5kB,EAAI,EAC3BpG,EAAI,EAAG6rB,EAAI,EAAGlM,EAAI,MAGhB3f,EAAKwuF,EAAG,GAAM,GAAIxuF,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,CAC7C0f,EAAIktE,EAAQ56B,EAAEhyD,GAAI,GAAG,KAChB0f,EAAI,CACL8uE,EAAKxuF,aAMPA,EAAKyuF,EAAG,GAAM,GAAIzuF,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,CAC7Cg+C,EAAI4uC,EAAQtnC,EAAEtlD,GAAI,GAAG,KAChBg+C,EAAI,CACLywC,EAAKzuF,gBAQJg+C,EAAI,aAAe,EAAI,CAC5BA,EAAIA,GAAK,EACTj0B,EAAIA,EAAI,EAAE,EAId2kE,EAAK9B,EAAQ56B,EAAEw8B,GAAK,GAAG,KAClBzkE,EAAI,CACLwyC,EAAKmyB,KAAM,GAAG3kE,EAAE,OACV/pB,EAAKwuF,EAAG,EAAG,GAAIxuF,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,CAC1C0f,EAAIktE,EAAQ56B,EAAEhyD,GAAI,GAAG,EACrB4sF,EAAQ56B,EAAEhyD,EAAE,GAAI,GAAM0uF,GAAM3kE,GAAOA,EAAIrK,KAAO,GAAGqK,EAAE,GAAK,GACxD2kE,EAAKhvE,EAETktE,EAAO56B,GAAG,GAAK08B,GAAM3kE,KAIpBA,EAAI,CACL4kE,EAAK/B,EAAQtnC,EAAEmpC,GAAK,GAAG,MACjBzuF,EAAKyuF,EAAG,EAAG,GAAIzuF,EAAE,IAAM,EAAGA,EAAKA,EAAE,EAAG,EAAI,CAC1Cg+C,EAAI4uC,EAAQtnC,EAAEtlD,GAAI,GAAG,EACrB4sF,EAAQtnC,EAAEtlD,EAAE,GAAI,GAAM2uF,GAAM5kE,EAAOi0B,KAAO,GAAGj0B,EAAE,GAC/C4kE,EAAK3wC,EAET4uC,EAAOtnC,GAAG,GAAKqpC,GAAM5kE;AAIzB4kE,EAAK/B,EAAQtnC,EAAEmpC,GAAK,GAAG,EACvBG,EAAKD,IAAO,GAAIE,EAAKF,EAAK,WAGpB3uF,EAAIwuF,GAAKxuF,EAAE,KAAOyuF,EAAG,GAAIzuF,EAAKA,EAAE,EAAG,EAAI,CACzC6rB,EAAK7rB,EAAEyuF,EAAI,EAGXC,EAAK9B,EAAQ56B,EAAEhyD,GAAI,GAAG,EACtB8uF,GAAQvyB,IAAK,IAAMqyB,IAAK,GAAK,EAAG/oC,GAAQ0W,IAAK,IAAMqyB,IAAK,GAAK,EAAGlqB,EAAKzd,EAAK6nC,EAAID,GAAI,SACvEC,EAAG,IAAM,QAAepqB,IAAK,GAAQ7e,GAAM,GAAK6oC,IAAO,MAAO,EAAO,CAC5EI,EAAMA,EAAG,EAAG,EAAGjpC,EAAMA,EAAG+oC,EAAI,EAAGlqB,EAAMA,EAAGmqB,EAAI,MACtChpC,EAAG,IAAM,QAAU,MAK7B76B,EAAI,EAAG5kB,EAAI,MACLuZ,EAAI,GAAIA,EAAE,KAAO8uE,EAAG,GAAI9uE,EAAKA,EAAE,EAAG,EAAI,CACxCq+B,EAAI4uC,EAAQtnC,EAAE3lC,GAAI,GAAG,EACrB+kD,GAAMzd,EAAK6nC,EAAI9wC,EAAI,QAAQ,IAAMhzB,IAAM,IAAI,EAC3C25C,GAAM1d,EAAK6nC,EAAI9wC,IAAM,IAAI,IAAM0mB,IAAO,IAAI,EAC1C1mB,EAAKhzB,EAAI,OAAW05C,GAAM,GAC1B15C,EAAI25C,EACJjlD,EAAIktE,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAG,EACvB+kD,IAAOhlD,EAAI,SAAWs+B,EAAI,QAAQ,GAAK53C,EAAE,EACzCu+D,IAAOjlD,IAAM,KAAOs+B,IAAM,IAAI,IAAM0mB,GAAM,IAAI,EAC9CkoB,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAMglD,GAAM,GAAOD,EAAK,OACxCt+D,EAAIu+D,GAAM;AAEdD,IAAOnI,EAAK,SAAWvxC,EAAI,QAAQ,GAAK5kB,EAAE,EAC1Cu+D,IAAOpI,IAAO,KAAOvxC,IAAM,IAAI,IAAM05C,GAAM,IAAI,EAC/CnI,EAAMoI,GAAM,GAAOD,EAAK,OACxBt+D,EAAIu+D,GAAM,MAGLv+D,EAAI,CACL0oF,EAAMA,EAAG,EAAG,EACZ1oF,EAAI,MACEuZ,EAAI,GAAIA,EAAE,KAAO8uE,EAAG,GAAI9uE,EAAKA,EAAE,EAAG,EAAI,CACxCq+B,EAAI4uC,EAAQtnC,EAAE3lC,GAAI,GAAG,EACrBD,EAAIktE,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAG,EACvB+kD,GAAMhlD,EAAI,QAAUtZ,EAAE,EACtBu+D,GAAMjlD,IAAM,IAAMs+B,GAAK0mB,IAAO,IAAI,EAClCkoB,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAMglD,GAAM,GAAOD,EAAK,OACxCt+D,EAAIu+D,IAAO,GAEfpI,EAAMA,EAAGn2D,EAAG,EAIhBsoF,EAAK9B,EAAQ56B,EAAEhyD,GAAI,GAAG,EACtB0f,EAAK68C,GAAM,GAAOmyB,IAAO,GACzBK,GAAQrvE,IAAI,IAAMkvE,IAAK,GAAK,EAAGI,GAAQtvE,IAAI,IAAMkvE,IAAK,GAAK,EAAGlqB,EAAKzd,EAAK8nC,EAAIF,GAAI,SACrEE,EAAG,IAAM,QAAerqB,IAAK,GAAQsqB,GAAM,GAAKN,EAAK,UAAW,EAAO,CAC9EK,EAAMA,EAAG,EAAG,EAAGC,EAAMA,EAAGJ,EAAI,EAAGlqB,EAAMA,EAAGmqB,EAAI,MACtCG,EAAG,IAAM,QAAU,MAK7BhkE,EAAI,EAAG5kB,EAAI,MACLuZ,EAAI,GAAIA,EAAE,KAAO8uE,EAAG,GAAI9uE,EAAKA,EAAE,EAAG,EAAI,CACxCq+B,EAAI4uC,EAAQtnC,EAAE3lC,GAAI,GAAG;CACrB+kD,GAAMzd,EAAK8nC,EAAI/wC,EAAI,QAAQ,IAAMhzB,EAAI,QAAQ,EAC7C25C,IAAO1d,EAAK8nC,EAAI/wC,IAAM,IAAI,IAAM0mB,IAAO,IAAI,IAAM15C,IAAM,IAAI,EAC3DgzB,EAAK0mB,EAAK,OAAWC,GAAM,GAC3B35C,EAAI25C,IAAO,GACXjlD,EAAIktE,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAG,EACvB+kD,IAAOhlD,EAAI,SAAWs+B,EAAI,QAAQ,GAAK53C,EAAE,EACzCu+D,IAAOjlD,IAAM,KAAOs+B,IAAM,IAAI,IAAM0mB,GAAM,IAAI,EAC9Ct+D,EAAIu+D,GAAM,GACVioB,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAMglD,GAAM,GAAOD,EAAK,OAE5CA,IAAOnI,EAAK,SAAWvxC,EAAI,QAAQ,GAAK5kB,EAAE,EAC1Cu+D,IAAOpI,IAAO,KAAOvxC,IAAM,IAAI,IAAM05C,GAAM,IAAI,EAC/Ct+D,EAAIu+D,GAAM,MAGLv+D,EAAI,CACL2oF,EAAMA,EAAG,EAAG,EACZ3oF,EAAI,MACEuZ,EAAI,GAAIA,EAAE,KAAO8uE,EAAG,GAAI9uE,EAAKA,EAAE,EAAG,EAAI,CACxCq+B,EAAI4uC,EAAQtnC,EAAE3lC,GAAI,GAAG,EACrBD,EAAIktE,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAG,EACvB+kD,IAAOhlD,EAAI,SAAWs+B,EAAI,QAAQ,GAAK53C,EAAE,EACzCu+D,IAAOjlD,IAAM,KAAOs+B,IAAM,IAAI,IAAM0mB,IAAO,IAAI,EAC/Ct+D,EAAIu+D,IAAO,GACXioB,EAAQ56B,EAAEnmC,EAAElM,GAAI,GAAM+kD,EAAK,OAAWC,GAAM,IAKpDioB,EAAQngB,EAAE5gD,GAAI,GAAMijE,GAAM,GAAMC;CAEhCxyB,EAAKqwB,EAAQ56B,EAAEhyD,GAAI,GAAG,KAGrB+pB,EAAI,CAIL2kE,EAAK9B,EAAO56B,GAAG,GAAG,MACZhyD,EAAI,GAAIA,EAAE,KAAOyuF,EAAG,GAAIzuF,EAAKA,EAAE,EAAG,EAAI,CACxC0f,EAAIktE,EAAQ56B,EAAEhyD,GAAI,GAAG,EACrB4sF,EAAQ56B,EAAEhyD,EAAE,GAAI,GAAO0f,IAAM,GAAGqK,EAAE,GAAQ2kE,IAAO3kE,EACjD2kE,EAAKhvE,EAETktE,EAAQ56B,EAAEy8B,GAAK,GAAKC,IAAO3kE,YAgB1BklE,EAAQnlE,EAAGmjE,EAAIj7B,EAAGw8B,EAAIzuC,EAAGnhC,GAC9BkL,EAAMA,EAAE,EACRmjE,EAAKA,EAAG,EACRj7B,EAAMA,EAAE,EACRw8B,EAAKA,EAAG,EACRzuC,EAAMA,EAAE,EACRnhC,EAAMA,EAAE,MAEJgnC,EAAI,EACJx/C,EAAI,EAAG8oF,EAAK,EAAGC,EAAK,EAAGN,EAAK,EAAGD,EAAK,EAAGt+B,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAG68B,EAAK,EAAGC,EAAK,EAC5EttF,EAAI,EAAG6rB,EAAI,EAAGlM,EAAI,EAEtBimC,EAAIknC,EAAO0B,GAAI,GAAG,EAClBxkE,EAAEwkE,GAAI,EAAG,EAAG5oC,GAEZonC,EAAIC,EAAInjE,EAAG87B,OAGL5lD,EAAI,GAAIA,EAAE,IAAMwuF,EAAG,GAAIxuF,EAAKA,EAAE,EAAG,EAAI,CACvCkvF,EAAKtC,EAAQhnC,EAAE5lD,GAAI,GAAG,EAAGmvF,EAAKD,EAAK,OAAQA,EAAKA,IAAO,GACvDN,EAAK7uC,IAAM,GAAI8uC,EAAK9uC,EAAI,OACxBuQ,EAAKrJ,EAAKkoC,EAAGN,GAAI,EAAGt+B,IAAQtJ,EAAKkoC,EAAGP,GAAI,IAAM3nC,EAAKioC,EAAGL,GAAI,GAAK,IAAOv+B,IAAO,IAAM,EACnF6+B,EAAK7+B,EAAK,OAAQ4+B,EAAK3+B,EAAK,OAC5B+8B,EAAK,MACCzhE,EAAI,GAAIA,EAAE,IAAM2iE,EAAG,GAAI3iE,EAAKA,EAAE,EAAG,EAAI,CACvClM,EAAK3f,EAAE6rB,EAAG,EACV+iE,EAAKhC,EAAQ56B,EAAEnmC,GAAI,GAAG;AAAGgjE,EAAKD,EAAK,OAAQA,EAAKA,IAAO,GACvDvB,EAAKT,EAAQhnC,EAAEjmC,GAAI,GAAG,EACtB2wC,IAAOrJ,EAAKkoC,EAAIN,GAAI,IAAMvB,EAAK,QAAQ,IAAMD,EAAK,QAAQ,EAC1D98B,IAAOtJ,EAAKkoC,EAAIP,GAAI,IAAMtB,IAAO,IAAI,IAAMD,IAAO,IAAI,EACtD78B,IAAOvJ,EAAKioC,EAAIL,GAAI,IAAMt+B,EAAK,QAAQ,IAAMD,IAAO,IAAI,EACxDg9B,IAAOrmC,EAAKioC,EAAIN,GAAI,IAAMp+B,IAAO,IAAI,IAAMD,IAAO,IAAI,EACtD88B,EAAM78B,GAAM,GAAOF,EAAK,OACxBs8B,EAAQhnC,EAAEjmC,GAAI,GAAK0tE,EAEvB1tE,EAAK3f,EAAE6rB,EAAG,EACVwhE,EAAKT,EAAQhnC,EAAEjmC,GAAI,GAAG,EACtB2wC,IAAO+8B,EAAK,SAAWC,EAAK,QAAQ,GAAKlnF,EAAE,EAC3CmqD,IAAO88B,IAAO,KAAOC,IAAO,IAAI,IAAMh9B,IAAO,IAAI,EACjDs8B,EAAQhnC,EAAEjmC,GAAI,GAAM4wC,GAAM,GAAOD,EAAK,OACtClqD,EAAImqD,IAAO,GAGfy8B,EAAIwB,EAAK5oC,EAAE4oC,EAAI,EAAG5vE,GAElBmuE,EAAMyB,GAAI,MAELpoF,GAAO6hD,EAAK+J,EAAGw8B,EAAI5vE,EAAG4vE,GAAK,IAAM,EAAM,CACxC90C,EAAK96B,EAAG4vE,EAAIx8B,EAAGw8B,EAAI5vE,EAAG4vE,GAAK,SAI5B,CACH3B,OAAQA,EACRC,OAAQA,EACRC,MAAQA,EACR/iE,EAAGA,EACHojE,IAAKA,EACLjiC,IAAKA,EACLlD,IAAKA,EACLh4B,IAAKA,EACLypB,IAAKA,EACLsO,IAAKA,EACLqM,IAAKA,EACLyB,IAAKA,EACLm5B,MAAOA;CAmCf,SAASG,GAAiBr1F,EAAGoM,OACrBkpF,EAAKt1F,EAAEs7B,KACPi6D,EAAKnpF,EAAEkvB,KACPg6D,EAAK,IACLt1F,EAAIA,EAAE0pE,UACN6rB,EAAK,IACLnpF,EAAIA,EAAEs9D,cACJ8rB,EAAUx1F,EAAEy1F,QAAQrpF,MACtBopF,EAAU,EAAG,KACThqD,EAAIxrC,EACPA,EAAIoM,EAAKA,EAAIo/B,MACVo/B,EAAK0qB,EACTA,EAAKC,EACLA,EAAK3qB,MAEiH36C,EAAGvM,EAAGoM,EAA5H4lE,EAAKC,GAAUC,IAAKC,EAAKF,GAAUG,KAAMvuD,EAAKn7B,EAAEqkD,UAAWslC,EAAKJ,GAAUG,KAAME,EAAKL,GAAUC,IAAKK,EAAKj2F,EAAEywD,cAC/GxgC,EAAIjwB,EAAEwhD,OAAOp1C,IACLsX,EAAIuM,EAAEimE,aAAeP,GAAUG,MACnChmE,EAAIG,EAAEkmE,SACLlmE,EAAIylE,EAAGU,SAAStmE,EAAEyxB,SAASs0C,GAAIQ,MAAM9uD,IAAK8uD,MAAM9uD,GAAOmuD,EAAKG,EAAMA,EAAK5lE,EACvEA,EAAI8lE,EAAGK,SAAStmE,EAAEyxB,SAASy0C,GAAIK,MAAMJ,IAAKI,MAAMJ,GAAOF,EAAKC,EAAMA,EAAK/lE,EACvEjwB,EAAIoM,EAAKA,EAAIsX,EACduM,EAAIjwB,EAAEwhD,OAAOp1C,MAEbkpF,EAAK,IACLO,EAAKA,EAAGnsB,UACR6rB,EAAK,IACLS,EAAKA,EAAGtsB,UACR8rB,EAAU,EAAG,KACThqD,EAAIqqD,EACPA,EAAKG,EAAMA,EAAKxqD,QAEd,CACHuxB,IAAK3wD,EACLqU,EAAGo1E,EACH7vC,EAAGgwC;AAIX,SAASlzC,GAAgB7f,MACE,oBAAZ16B,WAMPhM,OAAOsmD,QAAUtmD,OAAOsmD,OAAOC,gBAC/BvmD,OAAOsmD,OAAOC,gBAAgB7f,WAG9BzmC,KAAKqmD,QAAUrmD,KAAKqmD,OAAOC,gBAC3BtmD,KAAKqmD,OAAOC,gBAAgB7f,YAI5B1mC,OAAOymD,WAAYzmD,OAAOymD,SAASF,sBAKjC,IAAI17B,MAAM,gDAHZ7qB,OAAOymD,SAASF,gBAAgB7f,YAf1BnI,EADaw7D,QAAQ,UACFrzC,YAAYhgB,EAAIr+B,QACzCq+B,EAAIhhC,IAAI64B,IAqBhB,IAEIy7D,GAFEC,GAAiB,CAAEx9D,YAAaA,YAAa58B,KAAMA,MACnDq6F,GAAe,IAAIz9D,YAAY;MAKJv6B,IAA7B+3F,GAAep6F,KAAK8wD,MACpBspC,GAAep6F,KAAK8wD,KAJxB,SAAoBltD,EAAGoM,UACXpM,EAAIoM,EAAK,GAIjBmqF,GAAc5D,GAAW6D,GAAgB,KAAMC,GAAax7D,eACrDu7D,GAAep6F,KAAK8wD,MAG3BqpC,GAAc5D,GAAW6D,GAAgB,KAAMC,GAAax7D,QAGhE,IAAMy7D,GAAwB,IAAI19D,YAAY,GACxC28D,yBACU9wC,iBACJ8xC,EAAQD,GACRE,EAAS,EACTt7D,EAAO,UACC78B,IAARomD,OACC,KACI,IAAI5+C,EAAI,GAAI4+C,EAAI5+C,GAAIA,UAEzB2wF,EAA4B,GAAlB/xC,EAAIjgD,OAASqB,IAEnB,OAAO0vF,EAAUG,KACrBa,EAAQ,IAAI39D,YAAa49D,EAAS,IAAO,OACpC,IAAI9kE,EAAI+yB,EAAIjgD,OAAS,EAAGktB,GAAK7rB,EAAG6rB,GAAK,EACtC6kE,EAAO9xC,EAAIjgD,OAAS,EAAIktB,GAAM,GAAM+yB,EAAI/yB,IAAM,GAAO+yB,EAAI/yB,EAAI,IAAM,GAAO+yB,EAAI/yB,EAAI,IAAM,EAAK+yB,EAAI/yB,EAAI;CAErG7rB,EAAI6rB,GAAM,EACV6kE,EAAMA,EAAM/xF,OAAS,GAAKigD,EAAI5+C,GAEzBA,EAAI6rB,GAAM,EACf6kE,EAAMA,EAAM/xF,OAAS,GAAMigD,EAAI5+C,IAAM,EAAK4+C,EAAI5+C,EAAI,GAE7CA,EAAI6rB,GAAM,IACf6kE,EAAMA,EAAM/xF,OAAS,GAAMigD,EAAI5+C,IAAM,GAAO4+C,EAAI5+C,EAAI,IAAM,EAAK4+C,EAAI5+C,EAAI,IAE3Eq1B,EAAO,OAENq7D,MAAQA,OACRlmC,UAAYmmC,OACZt7D,KAAOA,oCAuChB,SAASmlB,GACLA,EAAQA,GAAS,OACXk2C,EAAQl6F,KAAKk6F,MACbC,EAASn6F,KAAKg0D,UAChBzjC,EAAM,MACI,KAAVyzB,QAYM,IAAIsqC,GAAqB,iBAV1B,IAAI9kF,GAAM2wF,EAAS,IAAO,GAAK,EAAG3wF,GAAK,EAAGA,IAAK,KAC5C4hC,EAAI8uD,EAAM1wF,GAAGhI,SAAS,IAC1B+uB,GAAO,WAAWm7D,OAAOtgD,EAAEjjC,QAC3BooB,GAAO6a,SAEX7a,EAAMA,EAAIxlB,QAAQ,MAAO,KAChB5C,SACLooB,EAAM,KAKVvwB,KAAK6+B,KAAO,IACZtO,EAAM,IAAMA,GACTA,yBAEX;IACU4pE,EAASn6F,KAAKg0D,UACdkmC,EAAQl6F,KAAKk6F,SACJ,IAAXC,EACA,OAAO,IAAIh+D,WAAW,WACpBi+D,EAAWD,EAAS,GAAM,EAC1B97D,EAAQ,IAAIlC,WAAWi+D,GACpB5wF,EAAI,EAAGA,EAAI4wF,EAAS5wF,IAAK,KAC1B6rB,EAAI+kE,EAAU5wF,EAAI,EACtB60B,EAAM70B,GAAK0wF,EAAM7kE,GAAK,MAAY,EAAJA,IAAU,UAErCgJ,yBAKX,eACU67D,EAAQl6F,KAAKk6F,MACb7wD,EAAOrpC,KAAKg0D,UACZn1B,EAAO7+B,KAAK6+B,SACbA,EACD,OAAO,KACPwK,GAAQ,GACR,OAAOxK,GAAQq7D,EAAM,KAAO,MAC5B7wD,GAAQ,GACR,OAAOxK,GAAQ,YAAeq7D,EAAM,KAAO,IAAMA,EAAM,KAAO,QAE9D1wF,EAAG2uC,EAAG5kB,EAAI,MACT/pB,EAAI0wF,EAAM/xF,OAAS,EAAGqB,GAAK,EAAGA,OACR,KAAlB2uC,EAAI+hD,EAAM1wF,UAEoB,IAA1B2uC,GAAK5kB,EAAK,aACfA;OAGE,IAAN/pB,EACOq1B,GAAQq7D,EAAM,KAAO,GACxBr7D,GACH,UAAcq7D,EAAM1wF,IAAM+pB,GAAMA,EAAI2mE,EAAM1wF,EAAI,KAAQ,GAAK+pB,EAAK,MAAQ,KAClE2mE,EAAM1wF,EAAI,IAAM+pB,GAAMA,GAAK/pB,EAAI,EAAI0wF,EAAM1wF,EAAI,KAAQ,GAAK+pB,EAAK,MAAQ,KAC9E5zB,KAAKk+B,IAAI,EAAG,GAAKr0B,EAAI+pB,EAAI,yBAEjC,SAAM5jB,OACIuqF,EAAQl6F,KAAKk6F,SAGfvqF,GAFW3P,KAAKg0D,UAGhB,OAAOh0D,SACLq6F,EAAU,IAAInB,EAChBhwE,EAAKvZ,EAAI,IAAO,EAChBwZ,EAAIxZ,EAAI,UACZ0qF,EAAQH,MAAQ,IAAI39D,YAAY29D,EAAM3tD,SAAS,EAAGrjB,IAClDmxE,EAAQrmC,UAAYrkD,EACpB0qF,EAAQx7D,KAAO7+B,KAAK6+B,KAChB1V,IACAkxE,EAAQH,MAAMhxE,EAAI,KAAO,IAAO,GAAKC,GAClCkxE,uBAEX,SAAMn2F,EAAGyL,OACCuqF,EAAQl6F,KAAKk6F,MACbC,EAASn6F,KAAKg0D,aAChB9vD,EAAI,EACJ,MAAM,IAAIy5B,WAAW,WACrBz5B,GAAKi2F,EACL,OAAOjB,EAAUG;OACXr3F,IAAN2N,GAAmBA,EAAIwqF,EAASj2F,KAChCyL,EAAIwqF,EAASj2F,OACXo2F,EAAS,IAAIpB,EACfhwE,EAAIhlB,GAAK,EACTswB,EAAKtwB,EAAIyL,EAAI,IAAO,EACpBwoC,EAAKxoC,EAAI,IAAO,EAChBo/B,EAAI7qC,EAAI,GACRilB,EAAIxZ,EAAI,GACN4qF,EAAS,IAAIh+D,YAAY4b,MAC3BpJ,EAAG,KACE,IAAIvlC,EAAI,EAAGA,EAAIgrB,EAAItL,EAAI,EAAG1f,IAC3B+wF,EAAO/wF,GAAM0wF,EAAMhxE,EAAI1f,KAAOulC,EAAMmrD,EAAMhxE,EAAI1f,EAAI,IAAO,GAAKulC,EAElEwrD,EAAO/wF,GAAK0wF,EAAMhxE,EAAI1f,KAAOulC,OAG7BwrD,EAAO/0F,IAAI00F,EAAM3tD,SAASrjB,EAAGsL,WAE7BrL,IACAoxE,EAAOpiD,EAAI,KAAO,IAAO,GAAKhvB,GAElCmxE,EAAOJ,MAAQK,EACfD,EAAOtmC,UAAYrkD,EACnB2qF,EAAOz7D,KAAO7+B,KAAK6+B,KACZy7D,wBAEX,eACUvpC,EAAW,IAAImoC,SACrBnoC,EAASmpC,MAAQl6F,KAAKk6F,MACtBnpC,EAASiD,UAAYh0D,KAAKg0D,UAC1BjD,EAASlyB,MAAQ,EAAI7+B,KAAK6+B,KACnBkyB,yBAEX,SAAQrhD,OACA8qF,EAASx6F,KAAKk6F,MAAOO,EAAWD,EAAOryF,OAAQuyF,EAAShrF,EAAKwqF,MAAOS,EAAWD,EAAOvyF;QACtFnI,KAAK6+B,KAAOnvB,EAAKmvB,MACT,EACR7+B,KAAK6+B,KAAOnvB,EAAKmvB,KACV,GACXm7D,GAAax0F,IAAIg1F,EAAQ,GACzBR,GAAax0F,IAAIk1F,EAAQD,GACrBX,GAAYroC,IAAI,EAAGgpC,GAAY,EAAGA,GAAY,EAAGE,GAAY,GACtD36F,KAAK6+B,yBAEpB,SAAInvB,OACK1P,KAAK6+B,KACN,OAAOnvB,MACNA,EAAKmvB,KACN,OAAO7+B,SACiL46F,EAASC,EAAUC,EAAOC,EAAlNC,EAAUh7F,KAAKg0D,UAAWwmC,EAASx6F,KAAKk6F,MAAOO,EAAWD,EAAOryF,OAAQ8yF,EAAQj7F,KAAK6+B,KAAMq8D,EAAUxrF,EAAKskD,UAAW0mC,EAAShrF,EAAKwqF,MAAOS,EAAWD,EAAOvyF,OAAQgzF,EAAQzrF,EAAKmvB,KAAqCp1B,EAAS,IAAIyvF,EAExO2B,GADAD,GAAWI,EAAUE,EAAUF,EAAUE,IAAYD,EAAQE,EAAQ,EAAI,EAAI,IACvD,IAAO,EAC7BrB,GAAYzD,aACR+E,EAAKtB,GAAYxD,OAAOmE,GAAY,GAAIY,EAAKvB,GAAYxD,OAAOqE,GAAY,GAAIW,EAAKxB,GAAYxD,OAAOuE,GAAY,UACxHf,GAAYtmE,EAAE8nE,EAAKF,GAAMP,GAAY,GAAI,EAAGO,GAC5CpB,GAAax0F,IAAIg1F,EAAQY,GAAM,GAC/BpB,GAAax0F,IAAIk1F,EAAQW,GAAM,GAC3BJ,EAAQE,EAAQ,GAChBrB,GAAYrgE,IAAI2hE,EAAIX,GAAY,EAAGY,EAAIV,GAAY,EAAGW,EAAIT,GAAY;AACtEC,EAAQG,GAIRH,EAFKG,EAAQE,GACbJ,EAAMjB,GAAY52C,IAAIk4C,EAAIX,GAAY,EAAGY,EAAIV,GAAY,EAAGW,EAAIT,GAAY,IAC9DM,EAAQF,GAGtBF,EAAMjB,GAAY52C,IAAIm4C,EAAIV,GAAY,EAAGS,EAAIX,GAAY,EAAGa,EAAIT,GAAY,IAC9DI,EAAQE,EAEtBJ,GACAjB,GAAYnlC,IAAI2mC,EAAIT,GAAY,EAAGS,EAAIT,GAAY,GACZ,IAAvCf,GAAYlD,IAAI0E,EAAIT,GAAY,GACzB3B,EAAUG,MACrB5vF,EAAOywF,MAAQ,IAAI39D,YAAYy9D,GAAaztD,SAAS+uD,GAAM,GAAIA,GAAM,GAAKT,IAC1EpxF,EAAOuqD,UAAY4mC,EACnBnxF,EAAOo1B,KAAOi8D,EACPrxF,2BAEX,SAASiG,UACE1P,KAAKy5B,IAAI/pB,EAAKu9D,gCAEzB,eACSjtE,KAAK6+B,KACN,OAAOq6D,EAAUG,SACwDuB,EAASC,EAAlFG,EAAUh7F,KAAKg0D,UAAWwmC,EAASx6F,KAAKk6F,MAAOO,EAAWD,EAAOryF,OAA2BsB,EAAS,IAAIyvF,EAE7G2B,GADAD,EAAUI,GAAW,GACC,IAAO,EAC7BlB,GAAYzD,aACR+E,EAAKtB,GAAYxD,OAAOmE,GAAY,GAAIa,EAAKxB,GAAYxD,OAAOuE,GAAY,UAChFf,GAAYtmE,EAAE8nE,EAAKF,GAAMP,GAAY,GAAI,EAAGO;AAC5CpB,GAAax0F,IAAIg1F,EAAQY,GAAM,GAC/BtB,GAAYj8B,IAAIu9B,EAAIX,GAAY,EAAGa,GACnC7xF,EAAOywF,MAAQ,IAAI39D,YAAYy9D,GAAaztD,SAAS+uD,GAAM,GAAIA,GAAM,GAAKT,IAC1EpxF,EAAOuqD,UAAY4mC,EACnBnxF,EAAOo1B,KAAO,EACPp1B,wBAEX,SAAOiG,OACmJ6rF,EAAUV,EAA5JG,EAAUh7F,KAAKg0D,UAAWwmC,EAASx6F,KAAKk6F,MAAOO,EAAWD,EAAOryF,OAAQ+yF,EAAUxrF,EAAKskD,UAAW0mC,EAAShrF,EAAKwqF,MAAOS,EAAWD,EAAOvyF,OAA4BuxF,EAAWR,EAAUG,KAAMI,EAAYP,EAAUG,KAC3NS,GAAYzD,aACR+E,EAAKtB,GAAYxD,OAAOmE,GAAY,GAAIY,EAAKvB,GAAYxD,OAAOqE,GAAY,GAAIa,EAAK1B,GAAYxD,OAAOmE,GAAY,UACxHX,GAAYtmE,EAAEgoE,EAAKJ,GAAMX,GAAY,GAAI,EAAGW,GAC5CpB,GAAax0F,IAAIg1F,EAAQY,GAAM,GAC/BpB,GAAax0F,IAAIk1F,EAAQW,GAAM,GAC/BvB,GAAYx6B,IAAI87B,EAAIX,GAAY,EAAGY,EAAIV,GAAY,EAAGa,IACtDD,EAAWzB,GAAYlD,IAAI4E,EAAIf,GAAY,IAAM,MAE7Cf,EAAW,IAAIR,GACNgB,MAAQ,IAAI39D,YAAYy9D,GAAaztD,SAASivD,GAAM,GAAIA,GAAM,GAAKD;AAC5E7B,EAAS1lC,UAAYgnC,EAAUO,GAAY,EAAIP,EAAUO,GAAY,EACrE7B,EAAS76D,KAAO7+B,KAAK6+B,KAAOnvB,EAAKmvB,OAErCg8D,EAAWf,GAAYlD,IAAIwE,EAAIT,GAAY,IAAM,MAE7ClB,EAAY,IAAIP,GACNgB,MAAQ,IAAI39D,YAAYy9D,GAAaztD,SAAS6uD,GAAM,GAAIA,GAAM,GAAKP,IAC7EpB,EAAUzlC,UAAYknC,EAAUL,GAAY,EAAIK,EAAUL,GAAY,EACtEpB,EAAU56D,KAAO7+B,KAAK6+B,MAEnB,CACH66D,SAAUA,EACVD,UAAWA,2BAGnB,SAAS/pF,OACA1P,KAAK6+B,OAASnvB,EAAKmvB,KACpB,OAAOq6D,EAAUG,SACiIuB,EAASC,EAA3JG,EAAUh7F,KAAKg0D,UAAWwmC,EAASx6F,KAAKk6F,MAAOO,EAAWD,EAAOryF,OAAQ+yF,EAAUxrF,EAAKskD,UAAW0mC,EAAShrF,EAAKwqF,MAAOS,EAAWD,EAAOvyF,OAA2BsB,EAAS,IAAIyvF,EAEtL2B,GADAD,EAAUI,EAAUE,GACE,IAAO,EAC7BpB,GAAYzD,aACR+E,EAAKtB,GAAYxD,OAAOmE,GAAY,GAAIY,EAAKvB,GAAYxD,OAAOqE,GAAY,GAAIW,EAAKxB,GAAYxD,OAAOuE,GAAY,UACxHf,GAAYtmE,EAAE8nE,EAAKF,GAAMP,GAAY,GAAI,EAAGO,GAC5CpB,GAAax0F,IAAIg1F,EAAQY,GAAM;AAC/BpB,GAAax0F,IAAIk1F,EAAQW,GAAM,GAC/BvB,GAAYtoC,IAAI4pC,EAAIX,GAAY,EAAGY,EAAIV,GAAY,EAAGW,EAAIT,GAAY,GACtEpxF,EAAOywF,MAAQ,IAAI39D,YAAYy9D,GAAaztD,SAAS+uD,GAAM,GAAIA,GAAM,GAAKT,IAC1EpxF,EAAOo1B,KAAO7+B,KAAK6+B,KAAOnvB,EAAKmvB,KAC/Bp1B,EAAOuqD,UAAY4mC,EACZnxF,4CAEX,SAA2BgyF,OACnB1sD,EAAImqD,EAAUwC,WAAW17F,MAAO0vB,EAAI,MACxCqf,EAAEmrD,MAAM,IAAM,EACa,IAApBnrD,EAAEmrD,MAAMxqE,GAAK,IAChBA,GAAK,QACsC,IAAtCqf,EAAEmrD,MAAMxqE,GAAK,KAAW,GAAJA,GAAW,IACpCA,IACJqf,EAAIA,EAAErtC,MAAMguB,WACR8E,EAAI,IAAImnE,GAAQ37F,MAAOgzF,EAAKhzF,KAAK25F,SAAST,EAAUC,KAAM51F,EAAI21F,EAAUwC,WAAW17F,MAAOm4C,EAAIn4C,KAAKk6F,MAAM/xF,OAAS,EAChG,IAAf5E,EAAE22F,MAAM/hD,IACXA,WACKsjD,GAAU,GAAG,KAClBp1C,GAAgB9iD,EAAE22F;AACd32F,EAAE22F,MAAM,GAAK,IACb32F,EAAE22F,MAAM,IAAM,GACX32F,EAAEy1F,QAAQhG,IAAO,GACpBzvF,EAAE22F,MAAM/hD,MAAQ,MAChBn0B,EAAIwQ,EAAE+0C,MAAMhmE,EAAGwrC,MACc,IAA7B/qB,EAAEg1E,QAAQE,EAAUC,MAEF,IAAlBn1E,EAAEg1E,QAAQhG,YAEVpjF,EAAI8f,IACC9f,EAAI,GAAG,IAEqB,KADjCoU,EAAIA,EAAE43E,SAAS72C,OAAOvwB,GAAGilE,WACnBT,QAAQE,EAAUC,KACpB,OAAO,KACW,IAAlBn1E,EAAEg1E,QAAQhG,GACV,SAEE,IAANpjF,EACA,OAAO,UAER,iCAEX,eAAgBisF,yDAAW,GACnB3B,EAAQl6F,KAAKk6F,MACb1wF,EAAI,KAGe,IAAP,EAAX0wF,EAAM,IACP,OAAO,KACP2B,GAAY,EACZ,OAAO,MAGP1J,EAAK,EAAG2J,EAAK,EAAGC,EAAM,MACrBvyF,EAAI,EAAGA,EAAI0wF,EAAM/xF,OAAQqB,IAAK,SAC3BwyF,EAAK9B,EAAM1wF,GACRwyF,GACH7J,GAAW,EAAL6J,EACNA,KAAQ;SAERC,EAAK/B,EAAM1wF,GACRyyF,GACHH,GAAW,EAALG,EAENH,GAAW,GADXG,KAAQ,GAERA,KAAQ,UAERC,EAAMhC,EAAM1wF,GACT0yF,GACHH,GAAa,GAANG,EAEPH,GAAa,IADbG,KAAS,GAETA,KAAS,WAGX/J,EAAK,GAAQ2J,EAAK,GAAQC,EAAM,MAElCF,GAAY,GAIT77F,KAAKm8F,2BAA2BN,IAAa,gCApVxD,SAAkBtrE,UAEP,IAAI2oE,EAhlInB,SAAyB3oE,WAAK6rE,0DACtB9lE,EAAM/F,EAAIpoB,OAAQk2B,EAAQ,IAAIlC,WAAWigE,EAAO,EAAI9lE,EAAMA,GACrD9sB,EAAI,EAAG6rB,EAAI,EAAG7rB,EAAI8sB,EAAK9sB,IAAK,KAC7BoG,EAAI2gB,EAAIhW,WAAW/Q,MACnB4yF,GAAQ,OAAUxsF,GAAKA,GAAK,MAAQ,MAC9BpG,GAAK8sB,EACP,MAAM,IAAI3L,MAAM,wDAA0DnhB;CAC9EoG,GAAU,MAAJA,IAAe,GAAM,MAA+B,MAApB2gB,EAAIhW,WAAW/Q,QAEpD,IAAK4yF,GAAQxsF,IAAM,QACd,IAAI+a,MAAM,qCAEfyxE,GAAQxsF,GAAK,IACdyuB,EAAMhJ,KAAOzlB,EAERA,GAAK,MACVyuB,EAAMhJ,KAAO,IAAQzlB,GAAK,EAC1ByuB,EAAMhJ,KAAO,IAAY,GAAJzlB,GAEhBA,GAAK,OACVyuB,EAAMhJ,KAAO,IAAQzlB,GAAK,GAC1ByuB,EAAMhJ,KAAO,IAASzlB,GAAK,EAAK,GAChCyuB,EAAMhJ,KAAO,IAAY,GAAJzlB,IAGrByuB,EAAMhJ,KAAO,IAAQzlB,GAAK,GAC1ByuB,EAAMhJ,KAAO,IAASzlB,GAAK,GAAM,GACjCyuB,EAAMhJ,KAAO,IAASzlB,GAAK,EAAK,GAChCyuB,EAAMhJ,KAAO,IAAY,GAAJzlB,UAGtByuB,EAAMkO,SAAS,EAAGlX,GAgjIPgnE,CAAgB9rE,8BAGlC,SAAkB63B,OAGVvpB,EAFAq7D,EAAQD,GACRE,EAAS,EAETmC,EAAS38F,KAAKi+B,IAAIwqB,UAClBk0C,EAAS,aACTpC,EAAQ,IAAI39D,YAAY,IAClB,GAAc,EAAT+/D,EACXpC,EAAM,GAAMoC,EAAS,WAAe;AACpCnC,EAAS,IAEJmC,EAAS,IACdpC,EAAQ,IAAI39D,YAAY,IAClB,GAAK+/D,EACXnC,EAAS,KAGTD,EAAQD,GACRE,EAAS,GAEbt7D,EAAOupB,EAAM,GAAK,EAAI,EACf8wC,EAAUwC,WAAW,CAAExB,MAAAA,EAAOlmC,UAAWmmC,EAAQt7D,KAAAA,mCAE5D,SAAuBL,UACZ,IAAI06D,EAAU,IAAI/8D,WAAWqC,8BAExC,SAAkB1U,OACRyyE,EAAK,IAAIrD,SACfqD,EAAGrC,MAAQ,IAAI39D,YAAYzS,EAAIowE,OAC/BqC,EAAGvoC,UAAYlqC,EAAIkqC,UACnBuoC,EAAG19D,KAAO/U,EAAI+U,KACP09D,WAoTfrD,GAAUsD,OAAS5D,GACnBM,GAAUG,KAAOH,GAAUuD,WAAW,GACtCvD,GAAUC,IAAMD,GAAUuD,WAAW,OCt6IjCp2C,GDu6IEs1C,4CACUj+D,SASJg/D,gCAPCxC,MAAQx8D,EAAOw8D;EACflmC,UAAYt2B,EAAOs2B,YACnBn1B,KAAOnB,EAAOmB,KACf89D,EAAKj6F,UAAY,EACjB,MAAM,IAAIi7B,cACVg/D,EAAK3oC,WAAa,GAClB,iBAEgB,EAAhB2oC,EAAKzC,MAAM,oBACLC,EAAyC,GAA9BwC,EAAK3oC,UAAY,IAAO,IACnCkmC,EAAQ,IAAI39D,YAAa49D,EAAS,IAAO,GAC/CD,EAAMA,EAAM/xF,OAAS,GAAK,GAC1Bu0F,EAAY,IAAIxD,IACNr6D,KAAO,EACjB69D,EAAU1oC,UAAYmmC,EACtBuC,EAAUxC,MAAQA,MACZ/wE,EA3flB,SAAuB5lB,EAAGoM,OACwDsX,EAAGoM,EAAG0b,EAAGgqD,EAAnFF,EAAKt1F,EAAI,GAAK,EAAI,EAAGu1F,EAAKnpF,EAAI,GAAK,EAAI,EAAGspF,EAAK,EAAGG,EAAK,EAAGE,EAAK,EAAGC,EAAK,OAG3ER,GAFAx1F,GAAKs1F,IACLlpF,GAAKmpF,MAGD/pD,EAAIxrC,EACHA,EAAIoM,EAAKA,EAAIo/B,EACdA,EAAI8pD,EACJA,EAAKC,EACLA,EAAK/pD,GAEiB9nB,EAAI1jB,GAA7B8vB,EAAI1zB,KAAK0I,MAAM9E,EAAIoM,IAAkBA,EAC/BsX,GACF8nB,EAAIkqD,EAAK5lE,EAAI+lE,EAAMH,EAAKG,EAAMA,EAAKrqD,EACnCA,EAAIuqD,EAAKjmE,EAAIkmE,EAAMD,EAAKC,EAAMA,EAAKxqD,EACnCxrC,EAAIoM,EAAKA,EAAIsX,EACYA,EAAI1jB,GAA7B8vB,EAAI1zB,KAAK0I,MAAM9E,EAAIoM,IAAkBA,SAE1CypF,GAAMP,EACNU,GAAMT,EACFC,IACAhqD,EAAIqqD,EACHA,EAAKG,EAAMA,EAAKxqD,GAEd;AACHuxB,IAAK3wD,EACLqU,EAAGo1E,EACH7vC,EAAGgwC,GA+dWqD,CAAc,WAAaD,EAAKzC,MAAM,IAAI3wC,WAC/CszC,YAAc1zE,EAAI,GAAKA,EAAI,WAAcA,IAY7CuzE,UAAYA,IACZI,mBAAqBJ,EAAU33C,aAAa00C,YAC5CsD,yBAA2BL,EAAUd,SAAS72C,aAAa00C,4CAKpE,SAAOl2F,UACCA,EAAEywD,WAAa,IAAMh0D,KAAKg0D,WAAa,GAChCklC,GAAUuD,WAAWl5F,EAAEb,UAAY1C,KAAK0C,WAC/Ca,EAAEy1F,QAAQh5F,MAAQ,EACXuD,EACJA,EAAEwhD,OAAO/kD,MAAMy5F,iCAK1B,SAAQl2F,OAEE0jB,EAAI2xE,GAAiB54F,KAD3BuD,EAAIvD,KAAKmuF,OAAO5qF,OAEQ,IAApB0jB,EAAEq5C,IAAI59D,UACN,MAAM,IAAIioB,MAAM;QAChB1D,EAAEsiC,EAAE1qB,KAAO,EACJ5X,EAAEsiC,EAAE9vB,IAAIz5B,MAAM45F,MAAM55F,KAAKg0D,WAC7B/sC,EAAEsiC,uBAKb,SAAMsB,EAAGt3B,WAED3jB,EAAI,EACCpG,EAAI,EAAGA,EAAI+pB,EAAE2mE,MAAM/xF,OAAQqB,YAC5BulC,EAAIxb,EAAE2mE,MAAM1wF,GACTulC,GACK,EAAJA,GACAn/B,IACJm/B,KAAO,MAIX5lB,EAAI,EACJoK,EAAEygC,WAAa,OACf7qC,EAAI,GACJoK,EAAEygC,WAAa,OACf7qC,EAAI,GACJoK,EAAEygC,WAAa,MACf7qC,EAAI,GACJoK,EAAEygC,WAAa,MACf7qC,EAAI,GACJoK,EAAEygC,WAAa,KACf7qC,EAAI,GACJoK,EAAEygC,WAAa,KACf7qC,EAAI,GACJvZ,GAAK,GAAMuZ,EAAI,IACfA,EAAI,GAER0hC,EAAI8wC,EAAQqB,mBAAmBh9F,KAAKmuF,OAAOtjC,GAAG/F,SAAS9kD,KAAK+8F,0BAA2B/8F,UAEjFi9F,EAAKtB,EAAQqB,mBAAmBnyC,EAAE+wC,SAAU57F,MAAOk9F,EAAK,IAAIxwF,MAAM,GAAMyc,EAAI,GAClF+zE,EAAG,GAAKryC;AACRqyC,EAAG,GAAKvB,EAAQqB,mBAAmBnyC,EAAE/F,SAASm4C,GAAKj9F,UAC9C,IAAIwJ,EAAI,EAAGA,EAAI,GAAM2f,EAAI,EAAI3f,IAC9B0zF,EAAG1zF,GAAKmyF,EAAQqB,mBAAmBE,EAAG1zF,EAAI,GAAGs7C,SAASm4C,GAAKj9F,cAGzDilE,EAAIjlE,KAAK88F,mBACX71E,EAAIg+C,EACCz7D,EAAI+pB,EAAE2mE,MAAM/xF,OAAS,EAAGqB,GAAK,EAAGA,YACjCulC,EAAIxb,EAAE2mE,MAAM1wF,GACP6rB,EAAI,GAAIA,EAAI,MACT,WAAJ0Z,EAAgB,SACZ7lB,EAAI6lB,IAAO,GAAK5lB,EAAIgvB,EAAIhvB,EACT,IAAP,EAAJD,IACJA,KAAO,EACPivB,YAEA3jB,EAAI0oE,EAAGh0E,IAAM,GACVA,GACHA,KAAO,EACHjC,IAAMg+C,IACNh+C,EAAI00E,EAAQqB,mBAAmB/1E,EAAE20E,SAAU57F,OAEnDinB,EAAIA,IAAMg+C,EAAI02B,EAAQqB,mBAAmB/1E,EAAE69B,SAAStwB,GAAIx0B,MAAQw0B,EAC/Dua,IAAMoJ,EAAK9iB,GAAK8iB,OAGblxB,IAAMg+C,IACNh+C,EAAI00E,EAAQqB,mBAAmB/1E,EAAE20E,SAAU57F,OAC9C+uC,IAAM,EAAI1Z;QAKhBsmE,EAAQqB,mBAAmB/1E,EAAGjnB,0CAEzC,SAA0BuD,EAAG2lB,OACnBsxE,EAASj3F,EAAE22F,MACXO,EAAWD,EAAOryF,OAClBg1F,EAASj0E,EAAEgxE,MACXkD,EAAWD,EAAOh1F,OAClBohD,EAAIrgC,EAAE2zE,YACZ/C,GAAYzD,aACN+E,EAAKtB,GAAYxD,OAAOmE,GAAY,GAAI4C,EAAKvD,GAAYxD,OAAO8G,GAAY,GAAI9B,EAAKxB,GAAYxD,OAAO8G,GAAY,GAC1HtD,GAAYtmE,EAAE8nE,EAAKF,GAAMgC,GAAY,GAAI,EAAGhC,GAC5CpB,GAAax0F,IAAIg1F,EAAQY,GAAM,GAC/BpB,GAAax0F,IAAI23F,EAAQE,GAAM,GAC/BvD,GAAYrB,MAAM2C,EAAIX,GAAY,EAAG4C,EAAID,GAAY,EAAG7zC,EAAG+xC,OACrD7xF,EAAS,IAAIyvF,UACnBzvF,EAAOywF,MAAQ,IAAI39D,YAAYy9D,GAAaztD,SAAS+uD,GAAM,GAAIA,GAAM,GAAK8B,IAC1E3zF,EAAOuqD,UAAY9qC,EAAE8qC,UACrBvqD,EAAOo1B,KAAO,EACPp1B,SAhJOyvF,ICt6IlBoE,GAAQ,IAAInhE,WAAW,IACZ,SAASohE;IAEjBl3C,MAGHA,GAAoC,oBAAXD,QAA0BA,OAAOC,iBAAmBD,OAAOC,gBAAgBl2C,KAAKi2C,SAA+B,oBAAbG,UAAgE,mBAA7BA,SAASF,iBAAkCE,SAASF,gBAAgBl2C,KAAKo2C,iBAG/N,IAAI57B,MAAM,mHAIb07B,GAAgBi3C,WCjBV,sHCEf,SAAS/1B,GAASi2B;MACO,iBAATA,GAAqBC,GAAMv4F,KAAKs4F,GCKhD,IAFA,IAAIE,GAAY,GAEPl0F,GAAI,EAAGA,GAAI,MAAOA,GACzBk0F,GAAUt4F,MAAMoE,GAAI,KAAOhI,SAAS,IAAIkqF,OAAO,ICNjD,SAASiS,GAAGt2F,EAASm/B,EAAKxF,OAEpB48D,GADJv2F,EAAUA,GAAW,IACF1B,SAAW0B,EAAQk2F,KAAOA,SAE7CK,EAAK,GAAe,GAAVA,EAAK,GAAY,GAC3BA,EAAK,GAAe,GAAVA,EAAK,GAAY,IAEvBp3D,EAAK,CACPxF,EAASA,GAAU,MAEd,IAAIx3B,EAAI,EAAGA,EAAI,KAAMA,EACxBg9B,EAAIxF,EAASx3B,GAAKo0F,EAAKp0F,UAGlBg9B,SDLX,SAAmB8f;IACbtlB,EAAS94B,UAAUC,OAAS,QAAsBnG,IAAjBkG,UAAU,GAAmBA,UAAU,GAAK,EAG7Es1F,GAAQE,GAAUp3C,EAAItlB,EAAS,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM08D,GAAUp3C,EAAItlB,EAAS,IAAM,IAAM08D,GAAUp3C,EAAItlB,EAAS,KAAO08D,GAAUp3C,EAAItlB,EAAS,KAAO08D,GAAUp3C,EAAItlB,EAAS,KAAO08D,GAAUp3C,EAAItlB,EAAS,KAAO08D,GAAUp3C,EAAItlB,EAAS,KAAO08D,GAAUp3C,EAAItlB,EAAS,MAAMh2B,kBAMpfu8D,GAASi2B,SACNv7F,UAAU,sCAGXu7F,ECNA9nF,CAAUkoF,GClBnB,IAAI5gC,GAAK;CAEgB,oBAAd6gC,UACT7gC,GAAK6gC,UAC4B,oBAAjBC,aAChB9gC,GAAK8gC,kBACsB,IAAXl+F,EAChBo9D,GAAKp9D,EAAOi+F,WAAaj+F,EAAOk+F,aACL,oBAAXh+F,OAChBk9D,GAAKl9D,OAAO+9F,WAAa/9F,OAAOg+F,aACP,oBAAT/9F,OAChBi9D,GAAKj9D,KAAK89F,WAAa99F,KAAK+9F,qBAG9BC,GAAiB/gC,GCDJghC,4CAEG33E,yEACuBA,EAAS,IAAMA,EAAS,IAAM,MAF1D6iB,KAAO,yBADeve,QAWpBszE;YAEG53E,6EAC2BA,EAAS,IAAMA,EAAS,IAAM,MAF9D6iB,KAAO,2BADiBve,QAWtBuzE,4CAGG73E,EAAgB6iB,EAAkCi1D,yCACpD93E,IACD6iB,KAAOA,IACPi1D,QAAUA,gBANWxzE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}