@lightprotocol/stateless.js 0.17.2-alpha.0 → 0.17.2-alpha.2

package/dist/es/browser/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/.pnpm/bn.js@5.2.1/node_modules/bn.js/lib/bn.js","../../../../../src/constants.ts","../../../../../node_modules/.pnpm/bs58@6.0.0/node_modules/bs58/src/esm/index.js","../../../../../node_modules/.pnpm/base-x@5.0.0/node_modules/base-x/src/esm/index.js","../../../../../src/state/BN254.ts","../../../../../src/state/compressed-account.ts","../../../../../node_modules/.pnpm/@noble+hashes@1.5.0/node_modules/@noble/hashes/esm/_assert.js","../../../../../node_modules/.pnpm/@noble+hashes@1.5.0/node_modules/@noble/hashes/esm/_u64.js","../../../../../node_modules/.pnpm/@noble+hashes@1.5.0/node_modules/@noble/hashes/esm/utils.js","../../../../../node_modules/.pnpm/@noble+hashes@1.5.0/node_modules/@noble/hashes/esm/sha3.js","../../../../../src/utils/conversion.ts","../../../../../src/instruction/pack-compressed-accounts.ts","../../../../../src/utils/validation.ts","../../../../../src/utils/address.ts","../../../../../src/utils/airdrop.ts","../../../../../src/utils/parse-validity-proof.ts","../../../../../src/utils/pipe.ts","../../../../../src/utils/send-and-confirm.ts","../../../../../src/utils/sleep.ts","../../../../../src/utils/test-utils.ts","../../../../../src/utils/calculate-compute-unit-price.ts","../../../../../node_modules/.pnpm/@coral-xyz+borsh@0.30.1_@solana+web3.js@1.95.5_bufferutil@4.0.8_utf-8-validate@5.0.10_/node_modules/@coral-xyz/borsh/dist/index.js","../../../../../src/programs/layout.ts","../../../../../src/programs/system.ts","../../../../../src/actions/compress.ts","../../../../../src/actions/create-account.ts","../../../../../src/actions/decompress.ts","../../../../../src/actions/common.ts","../../../../../src/actions/transfer.ts","../../../../../src/errors.ts","../../../../../src/rpc-interface.ts","../../../../../src/rpc.ts","../../../../../src/test-helpers/merkle-tree/indexed-array.ts","../../../../../src/test-helpers/merkle-tree/merkle-tree.ts","../../../../../src/test-helpers/test-rpc/get-parsed-events.ts","../../../../../src/test-helpers/test-rpc/get-compressed-accounts.ts","../../../../../src/test-helpers/test-rpc/get-compressed-token-accounts.ts","../../../../../src/test-helpers/test-rpc/test-rpc.ts"],"sourcesContent":["(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n    // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this._strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","import BN from 'bn.js';\nimport { Buffer } from 'buffer';\nimport { ConfirmOptions, PublicKey } from '@solana/web3.js';\n\nexport const FIELD_SIZE = new BN(\n    '21888242871839275222246405745257275088548364400416034343698204186575808495617',\n);\nexport const HIGHEST_ADDRESS_PLUS_ONE = new BN(\n    '452312848583266388373324160190187140051835877600158453279131187530910662655',\n);\n\n// TODO: implement properly\nexport const noopProgram = 'noopb9bkMVfRPU8AsbpTUg8AQkHtKwMYZiFUjNRtMmV';\nexport const lightProgram = 'SySTEM1eSU2p4BGQfQpimFEWWSC1XDFeun3Nqzz3rT7';\nexport const accountCompressionProgram = // also: merkletree program\n    'compr6CUsB5m2jS4Y3831ztGSTnDpnKJTKS95d64XVq';\n\nexport const getRegisteredProgramPda = () =>\n    new PublicKey('35hkDgaAKwMCaxRz2ocSZ6NaUrtKkyNqU6c4RV3tYJRh'); // TODO: better labelling. gov authority pda\n\nexport const getAccountCompressionAuthority = () =>\n    PublicKey.findProgramAddressSync(\n        [Buffer.from('cpi_authority')],\n        new PublicKey(\n            // TODO: can add check to ensure its consistent with the idl\n            lightProgram,\n        ),\n    )[0];\n\nexport const defaultStaticAccounts = () => [\n    new PublicKey(getRegisteredProgramPda()),\n    new PublicKey(noopProgram),\n    new PublicKey(accountCompressionProgram),\n    new PublicKey(getAccountCompressionAuthority()),\n];\nexport const defaultStaticAccountsStruct = () => {\n    return {\n        registeredProgramPda: new PublicKey(getRegisteredProgramPda()),\n        noopProgram: new PublicKey(noopProgram),\n        accountCompressionProgram: new PublicKey(accountCompressionProgram),\n        accountCompressionAuthority: new PublicKey(\n            getAccountCompressionAuthority(),\n        ),\n        cpiSignatureAccount: null,\n    };\n};\n\nexport const defaultTestStateTreeAccounts = () => {\n    return {\n        nullifierQueue: new PublicKey(nullifierQueuePubkey),\n        merkleTree: new PublicKey(merkletreePubkey),\n        merkleTreeHeight: DEFAULT_MERKLE_TREE_HEIGHT,\n        addressTree: new PublicKey(addressTree),\n        addressQueue: new PublicKey(addressQueue),\n    };\n};\n\nexport const nullifierQueuePubkey =\n    'nfq1NvQDJ2GEgnS8zt9prAe8rjjpAW1zFkrvZoBR148';\n\nexport const merkletreePubkey = 'smt1NamzXdq4AMqS2fS2F1i5KTYPZRhoHgWx38d8WsT';\nexport const addressTree = 'amt1Ayt45jfbdw5YSo7iz6WZxUmnZsQTYXy82hVwyC2';\nexport const addressQueue = 'aq1S9z4reTSQAdgWHGD2zDaS39sjGrAxbR31vxJ2F4F';\n\nexport const confirmConfig: ConfirmOptions = {\n    commitment: 'confirmed',\n    preflightCommitment: 'confirmed',\n};\n\nexport const DEFAULT_MERKLE_TREE_HEIGHT = 26;\nexport const DEFAULT_MERKLE_TREE_ROOTS = 2800;\n/** Threshold (per asset) at which new in-UTXOs get merged, in order to reduce UTXO pool size */\nexport const UTXO_MERGE_THRESHOLD = 20;\nexport const UTXO_MERGE_MAXIMUM = 10;\n\n/**\n * Treshold after which the currently used transaction Merkle tree is switched\n * to the next one\n */\nexport const TRANSACTION_MERKLE_TREE_ROLLOVER_THRESHOLD = new BN(\n    Math.floor(2 ** DEFAULT_MERKLE_TREE_HEIGHT * 0.95),\n);\n\n/**\n * Fee to provide continous funding for the state Merkle tree.\n * Once the state Merkle tree is at 95% capacity the accumulated fees\n * will be used to fund the next state Merkle tree with the same parameters.\n *\n * Is charged per output compressed account.\n */\nexport const STATE_MERKLE_TREE_ROLLOVER_FEE = new BN(300);\n\n/**\n * Fee to provide continous funding for the address queue and address Merkle tree.\n * Once the address Merkle tree is at 95% capacity the accumulated fees\n * will be used to fund the next address queue and address tree with the same parameters.\n *\n * Is charged per newly created address.\n */\nexport const ADDRESS_QUEUE_ROLLOVER_FEE = new BN(392);\n\n/**\n * Is charged if the transaction nullifies at least one compressed account.\n */\nexport const STATE_MERKLE_TREE_NETWORK_FEE = new BN(5000);\n\n/**\n * Is charged if the transaction creates at least one address.\n */\nexport const ADDRESS_TREE_NETWORK_FEE = new BN(5000);\n","import basex from 'base-x';\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\nexport default basex(ALPHABET);\n","// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  const BASE_MAP = new Uint8Array(256)\n  for (let j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (let i = 0; i < ALPHABET.length; i++) {\n    const x = ALPHABET.charAt(i)\n    const xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  const BASE = ALPHABET.length\n  const LEADER = ALPHABET.charAt(0)\n  const FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  const iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    // eslint-disable-next-line no-empty\n    if (source instanceof Uint8Array) { } else if (ArrayBuffer.isView(source)) {\n      source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n    } else if (Array.isArray(source)) {\n      source = Uint8Array.from(source)\n    }\n    if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n    if (source.length === 0) { return '' }\n    // Skip & count leading zeroes.\n    let zeroes = 0\n    let length = 0\n    let pbegin = 0\n    const pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n    // Allocate enough space in big-endian base58 representation.\n    const size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    const b58 = new Uint8Array(size)\n    // Process the bytes.\n    while (pbegin !== pend) {\n      let carry = source[pbegin]\n      // Apply \"b58 = b58 * 256 + ch\".\n      let i = 0\n      for (let it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n    // Skip leading zeroes in base58 result.\n    let it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n    // Translate the result into a string.\n    let str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return new Uint8Array() }\n    let psz = 0\n    // Skip and count leading '1's.\n    let zeroes = 0\n    let length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n    // Allocate enough space in big-endian base256 representation.\n    const size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    const b256 = new Uint8Array(size)\n    // Process the characters.\n    while (source[psz]) {\n      // Decode character\n      let carry = BASE_MAP[source.charCodeAt(psz)]\n      // Invalid character\n      if (carry === 255) { return }\n      let i = 0\n      for (let it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n    // Skip leading zeroes in b256.\n    let it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    const vch = new Uint8Array(zeroes + (size - it4))\n    let j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    const buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode,\n    decodeUnsafe,\n    decode\n  }\n}\nexport default base\n","// TODO: consider implementing BN254 as wrapper class around _BN mirroring\n// PublicKey this would encapsulate our runtime checks and also enforce\n// typesafety at compile time\n\nimport { FIELD_SIZE } from '../constants';\nimport { PublicKey } from '@solana/web3.js';\nimport BN from 'bn.js';\nimport bs58 from 'bs58';\nimport { Buffer } from 'buffer';\n\n/**\n * bignumber with <254-bit max size. Anchor serialization doesn't support native\n * bigint yet, so we wrap BN. This wrapper has simple base10 encoding which is\n * needed for zk circuit compat, in addition to the base58 encoding that users\n * are used to from working with the web3.js PublicKey type.\n */\nexport type BN254 = BN;\n\nexport const bn = (\n    number: string | number | BN | Buffer | Uint8Array | number[],\n    base?: number | 'hex' | undefined,\n    endian?: BN.Endianness | undefined,\n): BN => new BN(number, base, endian);\n\n/** Create a bigint instance with <254-bit max size and base58 capabilities */\nexport const createBN254 = (\n    number: string | number | BN | Buffer | Uint8Array | number[],\n    base?: number | 'hex' | 'base58' | undefined,\n): BN254 => {\n    if (base === 'base58') {\n        if (typeof number !== 'string')\n            throw new Error('Must be a base58 string');\n        return createBN254(bs58.decode(number));\n    }\n\n    const bigintNumber = new BN(number, base);\n\n    return enforceSize(bigintNumber);\n};\n\n/**\n * Enforces a maximum size of <254 bits for bigint instances. This is necessary\n * for compatibility with zk-SNARKs, where hashes must be less than the field\n * modulus (~2^254).\n */\nfunction enforceSize(bigintNumber: BN254): BN254 {\n    if (bigintNumber.gte(FIELD_SIZE)) {\n        throw new Error('Value is too large. Max <254 bits');\n    }\n    return bigintNumber;\n}\n\n/** Convert <254-bit bigint to Base58 string.  */\nexport function encodeBN254toBase58(bigintNumber: BN): string {\n    /// enforce size\n    const bn254 = createBN254(bigintNumber);\n    const bn254Buffer = bn254.toArrayLike(Buffer, undefined, 32);\n\n    return bs58.encode(bn254Buffer);\n}\n","import BN from 'bn.js';\nimport { PublicKey } from '@solana/web3.js';\nimport { CompressedAccount, CompressedAccountData } from './types';\nimport { BN254, bn } from './BN254';\n\nexport type CompressedAccountWithMerkleContext = CompressedAccount &\n    MerkleContext & {\n        readOnly: boolean;\n    };\n\n/**\n * Context for compressed account inserted into a state Merkle tree\n * */\nexport type MerkleContext = {\n    /** State Merkle tree */\n    merkleTree: PublicKey;\n    /** The state nullfier queue belonging to merkleTree */\n    nullifierQueue: PublicKey;\n    /** Poseidon hash of the utxo preimage. Is a leaf in state merkle tree  */\n    hash: number[]; // TODO: BN254;\n    /** 'hash' position within the Merkle tree */\n    leafIndex: number;\n};\n\nexport type MerkleContextWithMerkleProof = MerkleContext & {\n    /** Recent valid 'hash' proof path, expires after n slots */\n    merkleProof: BN254[];\n    /** Index of state root the merkleproof is valid for, expires after n slots */\n    rootIndex: number;\n    /** Current root */\n    root: BN254;\n};\n\nexport const createCompressedAccount = (\n    owner: PublicKey,\n    lamports?: BN,\n    data?: CompressedAccountData,\n    address?: number[],\n): CompressedAccount => ({\n    owner,\n    lamports: lamports ?? bn(0),\n    address: address ?? null,\n    data: data ?? null,\n});\n\nexport const createCompressedAccountWithMerkleContext = (\n    merkleContext: MerkleContext,\n    owner: PublicKey,\n    lamports?: BN,\n    data?: CompressedAccountData,\n    address?: number[],\n): CompressedAccountWithMerkleContext => ({\n    ...createCompressedAccount(owner, lamports, data, address),\n    ...merkleContext,\n    readOnly: false,\n});\n\nexport const createMerkleContext = (\n    merkleTree: PublicKey,\n    nullifierQueue: PublicKey,\n    hash: number[], // TODO: BN254,\n    leafIndex: number,\n): MerkleContext => ({\n    merkleTree,\n    nullifierQueue,\n    hash,\n    leafIndex,\n});\n","function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(h.outputLen);\n    number(h.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n    let Ah = new Uint32Array(lst.length);\n    let Al = new Uint32Array(lst.length);\n    for (let i = 0; i < lst.length; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (n) => n : (n) => byteSwap(n);\n// In place byte swap for Uint32Array\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    // Legacy Node.js compatibility\n    if (crypto && typeof crypto.randomBytes === 'function') {\n        return crypto.randomBytes(bytesLength);\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport { Hash, u32, toBytes, wrapConstructor, wrapXOFConstructorWithOpts, isLE, byteSwap32, } from './utils.js';\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n// Various per round constants calculations\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = [];\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nconst _7n = /* @__PURE__ */ BigInt(7);\nconst _256n = /* @__PURE__ */ BigInt(256);\nconst _0x71n = /* @__PURE__ */ BigInt(0x71);\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n    // Pi\n    [x, y] = [y, (2 * x + 3 * y) % 5];\n    SHA3_PI.push(2 * (5 * y + x));\n    // Rotational\n    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n    // Iota\n    let t = _0n;\n    for (let j = 0; j < 7; j++) {\n        R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n        if (R & _2n)\n            t ^= _1n << ((_1n << /* @__PURE__ */ BigInt(j)) - _1n);\n    }\n    _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s, rounds = 24) {\n    const B = new Uint32Array(5 * 2);\n    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n    for (let round = 24 - rounds; round < 24; round++) {\n        // Theta θ\n        for (let x = 0; x < 10; x++)\n            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n        for (let x = 0; x < 10; x += 2) {\n            const idx1 = (x + 8) % 10;\n            const idx0 = (x + 2) % 10;\n            const B0 = B[idx0];\n            const B1 = B[idx0 + 1];\n            const Th = rotlH(B0, B1, 1) ^ B[idx1];\n            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n            for (let y = 0; y < 50; y += 10) {\n                s[x + y] ^= Th;\n                s[x + y + 1] ^= Tl;\n            }\n        }\n        // Rho (ρ) and Pi (π)\n        let curH = s[2];\n        let curL = s[3];\n        for (let t = 0; t < 24; t++) {\n            const shift = SHA3_ROTL[t];\n            const Th = rotlH(curH, curL, shift);\n            const Tl = rotlL(curH, curL, shift);\n            const PI = SHA3_PI[t];\n            curH = s[PI];\n            curL = s[PI + 1];\n            s[PI] = Th;\n            s[PI + 1] = Tl;\n        }\n        // Chi (χ)\n        for (let y = 0; y < 50; y += 10) {\n            for (let x = 0; x < 10; x++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n        }\n        // Iota (ι)\n        s[0] ^= SHA3_IOTA_H[round];\n        s[1] ^= SHA3_IOTA_L[round];\n    }\n    B.fill(0);\n}\nexport class Keccak extends Hash {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\n        // Can be passed from user as dkLen\n        number(outputLen);\n        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n        if (0 >= this.blockLen || this.blockLen >= 200)\n            throw new Error('Sha3 supports only keccak-f1600 function');\n        this.state = new Uint8Array(200);\n        this.state32 = u32(this.state);\n    }\n    keccak() {\n        if (!isLE)\n            byteSwap32(this.state32);\n        keccakP(this.state32, this.rounds);\n        if (!isLE)\n            byteSwap32(this.state32);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        exists(this);\n        const { blockLen, state } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            for (let i = 0; i < take; i++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            return;\n        this.finished = true;\n        const { state, suffix, pos, blockLen } = this;\n        // Do the padding\n        state[pos] ^= suffix;\n        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\n        exists(this, false);\n        bytes(out);\n        this.finish();\n        const bufferOut = this.state;\n        const { blockLen } = this;\n        for (let pos = 0, len = out.length; pos < len;) {\n            if (this.posOut >= blockLen)\n                this.keccak();\n            const take = Math.min(blockLen - this.posOut, len - pos);\n            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n            this.posOut += take;\n            pos += take;\n        }\n        return out;\n    }\n    xofInto(out) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        number(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        output(out, this);\n        if (this.finished)\n            throw new Error('digest() was already called');\n        this.writeInto(out);\n        this.destroy();\n        return out;\n    }\n    digest() {\n        return this.digestInto(new Uint8Array(this.outputLen));\n    }\n    destroy() {\n        this.destroyed = true;\n        this.state.fill(0);\n    }\n    _cloneInto(to) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n        to.state32.set(this.state32);\n        to.pos = this.pos;\n        to.posOut = this.posOut;\n        to.finished = this.finished;\n        to.rounds = rounds;\n        // Suffix can change in cSHAKE\n        to.suffix = suffix;\n        to.outputLen = outputLen;\n        to.enableXOF = enableXOF;\n        to.destroyed = this.destroyed;\n        return to;\n    }\n}\nconst gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\nexport const sha3_224 = /* @__PURE__ */ gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexport const sha3_256 = /* @__PURE__ */ gen(0x06, 136, 256 / 8);\nexport const sha3_384 = /* @__PURE__ */ gen(0x06, 104, 384 / 8);\nexport const sha3_512 = /* @__PURE__ */ gen(0x06, 72, 512 / 8);\nexport const keccak_224 = /* @__PURE__ */ gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexport const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nexport const keccak_384 = /* @__PURE__ */ gen(0x01, 104, 384 / 8);\nexport const keccak_512 = /* @__PURE__ */ gen(0x01, 72, 512 / 8);\nconst genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map","import { Buffer } from 'buffer';\nimport { bn, createBN254 } from '../state/BN254';\nimport { FIELD_SIZE } from '../constants';\nimport { keccak_256 } from '@noble/hashes/sha3';\nimport { Keypair } from '@solana/web3.js';\nimport BN from 'bn.js';\n\nexport function byteArrayToKeypair(byteArray: number[]): Keypair {\n    return Keypair.fromSecretKey(Uint8Array.from(byteArray));\n}\n/**\n * @internal\n * convert BN to hex with '0x' prefix\n */\nexport function toHex(bn: BN): string {\n    return '0x' + bn.toString('hex');\n}\n\nexport const toArray = <T>(value: T | T[]) =>\n    Array.isArray(value) ? value : [value];\n\nexport const bufToDecStr = (buf: Buffer): string => {\n    return createBN254(buf).toString();\n};\nfunction isSmallerThanBn254FieldSizeBe(bytes: Buffer): boolean {\n    const bigint = bn(bytes, undefined, 'be');\n    return bigint.lt(FIELD_SIZE);\n}\n\n/**\n * Hash the provided `bytes` with Keccak256 and ensure the result fits in the\n * BN254 prime field by repeatedly hashing the inputs with various \"bump seeds\"\n * and truncating the resulting hash to 31 bytes.\n *\n * @deprecated Use `hashvToBn254FieldSizeBe` instead.\n */\nexport function hashToBn254FieldSizeBe(bytes: Buffer): [Buffer, number] | null {\n    // TODO(vadorovsky, affects-onchain): Get rid of the bump mechanism, it\n    // makes no sense. Doing the same as in the `hashvToBn254FieldSizeBe` below\n    // - overwriting the most significant byte with zero - is sufficient for\n    // truncation, it's also faster, doesn't force us to return `Option` and\n    // care about handling an error which is practically never returned.\n    //\n    // The reason we can't do it now is that it would affect on-chain programs.\n    // Once we can update programs, we can get rid of the seed bump (or even of\n    // this function all together in favor of the `hashv` variant).\n    let bumpSeed = 255;\n    while (bumpSeed >= 0) {\n        const inputWithBumpSeed = Buffer.concat([\n            bytes,\n            Buffer.from([bumpSeed]),\n        ]);\n        const hash = keccak_256(inputWithBumpSeed);\n        if (hash.length !== 32) {\n            throw new Error('Invalid hash length');\n        }\n        hash[0] = 0;\n\n        if (isSmallerThanBn254FieldSizeBe(Buffer.from(hash))) {\n            return [Buffer.from(hash), bumpSeed];\n        }\n\n        bumpSeed -= 1;\n    }\n    return null;\n}\n\n/**\n * Hash the provided `bytes` with Keccak256 and ensure that the result fits in\n * the BN254 prime field by truncating the resulting hash to 31 bytes.\n *\n * @param bytes Input bytes\n *\n * @returns     Hash digest\n */\nexport function hashvToBn254FieldSizeBe(bytes: Uint8Array[]): Uint8Array {\n    const hasher = keccak_256.create();\n    for (const input of bytes) {\n        hasher.update(input);\n    }\n    const hash = hasher.digest();\n    hash[0] = 0;\n    return hash;\n}\n\n/** Mutates array in place */\nexport function pushUniqueItems<T>(items: T[], map: T[]): void {\n    items.forEach(item => {\n        if (!map.includes(item)) {\n            map.push(item);\n        }\n    });\n}\n\nexport function toCamelCase(\n    obj: Array<any> | unknown | any,\n): Array<any> | unknown | any {\n    if (Array.isArray(obj)) {\n        return obj.map(v => toCamelCase(v));\n    } else if (obj !== null && obj.constructor === Object) {\n        return Object.keys(obj).reduce((result, key) => {\n            const camelCaseKey = key.replace(/([-_][a-z])/gi, $1 => {\n                return $1.toUpperCase().replace('-', '').replace('_', '');\n            });\n            result[camelCaseKey] = toCamelCase(obj[key]);\n            return result;\n        }, {} as any);\n    }\n    return obj;\n}\n\n// FIXME: check bundling and how to resolve the type error\n//@ts-ignore\nif (import.meta.vitest) {\n    //@ts-ignore\n    const { it, expect, describe } = import.meta.vitest;\n\n    describe('toArray function', () => {\n        it('should convert a single item to an array', () => {\n            expect(toArray(1)).toEqual([1]);\n        });\n\n        it('should leave an array unchanged', () => {\n            expect(toArray([1, 2, 3])).toEqual([1, 2, 3]);\n        });\n    });\n\n    describe('isSmallerThanBn254FieldSizeBe function', () => {\n        it('should return true for a small number', () => {\n            const buf = Buffer.from(\n                '0000000000000000000000000000000000000000000000000000000000000000',\n                'hex',\n            );\n            expect(isSmallerThanBn254FieldSizeBe(buf)).toBe(true);\n        });\n\n        it('should return false for a large number', () => {\n            const buf = Buffer.from(\n                '0000000000000000000000000000000000000000000000000000000000000065',\n                'hex',\n            ).reverse();\n            expect(isSmallerThanBn254FieldSizeBe(buf)).toBe(false);\n        });\n    });\n\n    describe('hashToBn254FieldSizeBe function', () => {\n        const refBumpSeed = [252];\n        const bytes = [\n            131, 219, 249, 246, 221, 196, 33, 3, 114, 23, 121, 235, 18, 229, 71,\n            152, 39, 87, 169, 208, 143, 101, 43, 128, 245, 59, 22, 134, 182,\n            231, 116, 33,\n        ];\n        const refResult = [\n            0, 146, 15, 187, 171, 163, 183, 93, 237, 121, 37, 231, 55, 162, 208,\n            188, 244, 77, 185, 157, 93, 9, 101, 193, 220, 247, 109, 94, 48, 212,\n            98, 149,\n        ];\n\n        it('should return a valid value for initial buffer', async () => {\n            const result = await hashToBn254FieldSizeBe(Buffer.from(bytes));\n            expect(Array.from(result![0])).toEqual(refResult);\n        });\n\n        it('should return a valid value for initial buffer', async () => {\n            const buf = Buffer.from(\n                '0000000000000000000000000000000000000000000000000000000000000000',\n                'hex',\n            );\n            const result = await hashToBn254FieldSizeBe(buf);\n            expect(result).not.toBeNull();\n            if (result) {\n                expect(result[0]).toBeInstanceOf(Buffer);\n                expect(result[1]).toBe(255);\n            }\n        });\n\n        it('should return a valid value for a buffer that can be hashed to a smaller value', async () => {\n            const buf = Buffer.from(\n                'fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe',\n                'hex',\n            );\n            const result = await hashToBn254FieldSizeBe(buf);\n            expect(result).not.toBeNull();\n            if (result) {\n                expect(result[1]).toBeLessThanOrEqual(255);\n                expect(result[0]).toBeInstanceOf(Buffer);\n                // Check if the hashed value is indeed smaller than the bn254 field size\n                expect(isSmallerThanBn254FieldSizeBe(result[0])).toBe(true);\n            }\n        });\n\n        it('should correctly hash the input buffer', async () => {\n            const buf = Buffer.from('deadbeef', 'hex');\n            const result = await hashToBn254FieldSizeBe(buf);\n            expect(result).not.toBeNull();\n            if (result) {\n                // Since the actual hash value depends on the crypto implementation and input,\n                // we cannot predict the exact output. However, we can check if the output is valid.\n                expect(result[0].length).toBe(32); // SHA-256 hash length\n                expect(result[1]).toBeLessThanOrEqual(255);\n                expect(isSmallerThanBn254FieldSizeBe(result[0])).toBe(true);\n            }\n        });\n    });\n\n    describe('pushUniqueItems function', () => {\n        it('should add unique items', () => {\n            const map = [1, 2, 3];\n            const itemsToAdd = [3, 4, 5];\n            pushUniqueItems(itemsToAdd, map);\n            expect(map).toEqual([1, 2, 3, 4, 5]);\n        });\n\n        it('should ignore duplicates', () => {\n            const map = [1, 2, 3];\n            const itemsToAdd = [1, 2, 3];\n            pushUniqueItems(itemsToAdd, map);\n            expect(map).toEqual([1, 2, 3]);\n        });\n\n        it('should handle empty arrays', () => {\n            const map: number[] = [];\n            const itemsToAdd: number[] = [];\n            pushUniqueItems(itemsToAdd, map);\n            expect(map).toEqual([]);\n        });\n    });\n\n    describe('bufToDecStr', () => {\n        it(\"should convert buffer [0] to '0'\", () => {\n            expect(bufToDecStr(Buffer.from([0]))).toEqual('0');\n        });\n\n        it(\"should convert buffer [1] to '1'\", () => {\n            expect(bufToDecStr(Buffer.from([1]))).toEqual('1');\n        });\n\n        it(\"should convert buffer [1, 0] to '256'\", () => {\n            expect(bufToDecStr(Buffer.from([1, 0]))).toEqual('256');\n        });\n\n        it(\"should convert buffer [1, 1] to '257'\", () => {\n            expect(bufToDecStr(Buffer.from([1, 1]))).toEqual('257');\n        });\n\n        it(\"should convert buffer [7, 91, 205, 21] to '123456789'\", () => {\n            expect(bufToDecStr(Buffer.from([7, 91, 205, 21]))).toEqual(\n                '123456789',\n            );\n        });\n    });\n\n    describe('toCamelCase', () => {\n        it('should convert object keys to camelCase', () => {\n            const input = { test_key: 1, 'another-testKey': 2 };\n            const expected = { testKey: 1, anotherTestKey: 2 };\n            expect(toCamelCase(input)).toEqual(expected);\n        });\n\n        it('should handle arrays of objects', () => {\n            const input = [{ array_key: 3 }, { 'another_array-key': 4 }];\n            const expected = [{ arrayKey: 3 }, { anotherArrayKey: 4 }];\n            expect(toCamelCase(input)).toEqual(expected);\n        });\n\n        it('should return the input if it is neither an object nor an array', () => {\n            const input = 'testString';\n            expect(toCamelCase(input)).toBe(input);\n        });\n    });\n}\n","import { AccountMeta, PublicKey } from '@solana/web3.js';\nimport {\n    CompressedAccount,\n    OutputCompressedAccountWithPackedContext,\n    PackedCompressedAccountWithMerkleContext,\n} from '../state';\nimport { CompressedAccountWithMerkleContext } from '../state/compressed-account';\nimport { toArray } from '../utils/conversion';\nimport { defaultTestStateTreeAccounts } from '../constants';\n\n/**\n * @internal Finds the index of a PublicKey in an array, or adds it if not\n * present\n * */\nexport function getIndexOrAdd(\n    accountsArray: PublicKey[],\n    key: PublicKey,\n): number {\n    const index = accountsArray.findIndex(existingKey =>\n        existingKey.equals(key),\n    );\n    if (index === -1) {\n        accountsArray.push(key);\n        return accountsArray.length - 1;\n    }\n    return index;\n}\n\n/** @internal */\nexport function padOutputStateMerkleTrees(\n    outputStateMerkleTrees: PublicKey[] | PublicKey | undefined,\n    numberOfOutputCompressedAccounts: number,\n    inputCompressedAccountsWithMerkleContext: CompressedAccountWithMerkleContext[],\n): PublicKey[] {\n    if (numberOfOutputCompressedAccounts <= 0) {\n        return [];\n    }\n\n    /// Default: use the 0th state tree of input state for all output accounts\n    if (outputStateMerkleTrees === undefined) {\n        if (inputCompressedAccountsWithMerkleContext.length === 0) {\n            return new Array(numberOfOutputCompressedAccounts).fill(\n                defaultTestStateTreeAccounts().merkleTree,\n            );\n        }\n        return new Array(numberOfOutputCompressedAccounts).fill(\n            inputCompressedAccountsWithMerkleContext[0].merkleTree,\n        );\n        /// Align the number of output state trees with the number of output\n        /// accounts, and fill up with 0th output state tree\n    } else {\n        /// Into array\n        const treesArray = toArray(outputStateMerkleTrees);\n        if (treesArray.length >= numberOfOutputCompressedAccounts) {\n            return treesArray.slice(0, numberOfOutputCompressedAccounts);\n        } else {\n            return treesArray.concat(\n                new Array(\n                    numberOfOutputCompressedAccounts - treesArray.length,\n                ).fill(treesArray[0]),\n            );\n        }\n    }\n}\n\nexport function toAccountMetas(remainingAccounts: PublicKey[]): AccountMeta[] {\n    return remainingAccounts.map(\n        (account): AccountMeta => ({\n            pubkey: account,\n            isWritable: true,\n            isSigner: false,\n        }),\n    );\n}\n\n// TODO: include owner and lamports in packing.\n/**\n * Packs Compressed Accounts.\n *\n * Replaces PublicKey with index pointer to remaining accounts.\n *\n * @param inputCompressedAccounts           Ix input state to be consumed\n * @param inputStateRootIndices             The recent state root indices of the\n *                                          input state. The expiry is tied to\n *                                          the proof.\n * @param outputCompressedAccounts          Ix output state to be created\n * @param outputStateMerkleTrees            Optional output state trees to be\n *                                          inserted into the output state.\n *                                          Defaults to the 0th state tree of\n *                                          the input state. Gets padded to the\n *                                          length of outputCompressedAccounts.\n *\n * @param remainingAccounts                 Optional existing array of accounts\n *                                          to append to.\n **/\nexport function packCompressedAccounts(\n    inputCompressedAccounts: CompressedAccountWithMerkleContext[],\n    inputStateRootIndices: number[],\n    outputCompressedAccounts: CompressedAccount[],\n    outputStateMerkleTrees?: PublicKey[] | PublicKey,\n    remainingAccounts: PublicKey[] = [],\n): {\n    packedInputCompressedAccounts: PackedCompressedAccountWithMerkleContext[];\n    packedOutputCompressedAccounts: OutputCompressedAccountWithPackedContext[];\n    remainingAccounts: PublicKey[];\n} {\n    const _remainingAccounts = remainingAccounts.slice();\n\n    const packedInputCompressedAccounts: PackedCompressedAccountWithMerkleContext[] =\n        [];\n\n    const packedOutputCompressedAccounts: OutputCompressedAccountWithPackedContext[] =\n        [];\n\n    /// input\n    inputCompressedAccounts.forEach((account, index) => {\n        const merkleTreePubkeyIndex = getIndexOrAdd(\n            _remainingAccounts,\n            account.merkleTree,\n        );\n\n        const nullifierQueuePubkeyIndex = getIndexOrAdd(\n            _remainingAccounts,\n            account.nullifierQueue,\n        );\n\n        packedInputCompressedAccounts.push({\n            compressedAccount: {\n                owner: account.owner,\n                lamports: account.lamports,\n                address: account.address,\n                data: account.data,\n            },\n            merkleContext: {\n                merkleTreePubkeyIndex,\n                nullifierQueuePubkeyIndex,\n                leafIndex: account.leafIndex,\n                queueIndex: null,\n            },\n            rootIndex: inputStateRootIndices[index],\n            readOnly: false,\n        });\n    });\n\n    /// output\n    const paddedOutputStateMerkleTrees = padOutputStateMerkleTrees(\n        outputStateMerkleTrees,\n        outputCompressedAccounts.length,\n        inputCompressedAccounts,\n    );\n\n    outputCompressedAccounts.forEach((account, index) => {\n        const merkleTreePubkeyIndex = getIndexOrAdd(\n            _remainingAccounts,\n            paddedOutputStateMerkleTrees[index],\n        );\n        packedOutputCompressedAccounts.push({\n            compressedAccount: {\n                owner: account.owner,\n                lamports: account.lamports,\n                address: account.address,\n                data: account.data,\n            },\n            merkleTreeIndex: merkleTreePubkeyIndex,\n        });\n    });\n\n    return {\n        packedInputCompressedAccounts,\n        packedOutputCompressedAccounts,\n        remainingAccounts: _remainingAccounts,\n    };\n}\n","import BN from 'bn.js';\nimport {\n    CompressedAccount,\n    CompressedAccountWithMerkleContext,\n    bn,\n} from '../state';\n\nexport const validateSufficientBalance = (balance: BN) => {\n    if (balance.lt(bn(0))) {\n        throw new Error('Not enough balance for transfer');\n    }\n};\n\nexport const validateSameOwner = (\n    compressedAccounts:\n        | CompressedAccount[]\n        | CompressedAccountWithMerkleContext[],\n) => {\n    if (compressedAccounts.length === 0) {\n        throw new Error('No accounts provided for validation');\n    }\n    const zerothOwner = compressedAccounts[0].owner;\n    if (\n        !compressedAccounts.every(account => account.owner.equals(zerothOwner))\n    ) {\n        throw new Error('All input accounts must have the same owner');\n    }\n};\n","import { AccountMeta, PublicKey } from '@solana/web3.js';\nimport { hashToBn254FieldSizeBe, hashvToBn254FieldSizeBe } from './conversion';\nimport { defaultTestStateTreeAccounts } from '../constants';\nimport { getIndexOrAdd } from '../instruction';\n\nexport function deriveAddressSeed(\n    seeds: Uint8Array[],\n    programId: PublicKey,\n): Uint8Array {\n    const combinedSeeds: Uint8Array[] = [programId.toBytes(), ...seeds];\n    const hash = hashvToBn254FieldSizeBe(combinedSeeds);\n    return hash;\n}\n\n/**\n * Derive an address for a compressed account from a seed and an address Merkle\n * tree public key.\n *\n * @param seed                     Seed to derive the address from\n * @param addressMerkleTreePubkey  Merkle tree public key. Defaults to\n *                                 defaultTestStateTreeAccounts().addressTree\n * @returns                        Derived address\n */\nexport function deriveAddress(\n    seed: Uint8Array,\n    addressMerkleTreePubkey: PublicKey = defaultTestStateTreeAccounts()\n        .addressTree,\n): PublicKey {\n    if (seed.length != 32) {\n        throw new Error('Seed length is not 32 bytes.');\n    }\n    const bytes = addressMerkleTreePubkey.toBytes();\n    const combined = Buffer.from([...bytes, ...seed]);\n    const hash = hashToBn254FieldSizeBe(combined);\n\n    if (hash === null) {\n        throw new Error('DeriveAddressError');\n    }\n    const buf = hash[0];\n    return new PublicKey(buf);\n}\n\nexport interface NewAddressParams {\n    /**\n     * Seed for the compressed account. Must be seed used to derive\n     * newAccountAddress\n     */\n    seed: Uint8Array;\n    /**\n     * Recent state root index of the address tree. The expiry is tied to the\n     * validity proof.\n     */\n    addressMerkleTreeRootIndex: number;\n    /**\n     * Address tree pubkey. Must be base pubkey used to derive new address\n     */\n    addressMerkleTreePubkey: PublicKey;\n    /**\n     * Address space queue pubkey. Associated with the state tree.\n     */\n    addressQueuePubkey: PublicKey;\n}\n\nexport interface NewAddressParamsPacked {\n    /**\n     * Seed for the compressed account. Must be seed used to derive\n     * newAccountAddress\n     */\n    seed: number[];\n    /**\n     * Recent state root index of the address tree. The expiry is tied to the\n     * validity proof.\n     */\n    addressMerkleTreeRootIndex: number;\n    /**\n     * Index of the address merkle tree account in the remaining accounts array\n     */\n    addressMerkleTreeAccountIndex: number;\n    /**\n     * Index of the address queue account in the remaining accounts array\n     */\n    addressQueueAccountIndex: number;\n}\n\n/**\n * Packs new address params for instruction data in TypeScript clients\n *\n * @param newAddressParams      New address params\n * @param remainingAccounts     Remaining accounts\n * @returns                     Packed new address params\n */\nexport function packNewAddressParams(\n    newAddressParams: NewAddressParams[],\n    remainingAccounts: PublicKey[],\n): {\n    newAddressParamsPacked: NewAddressParamsPacked[];\n    remainingAccounts: PublicKey[];\n} {\n    const _remainingAccounts = remainingAccounts.slice();\n\n    const newAddressParamsPacked: NewAddressParamsPacked[] =\n        newAddressParams.map(x => ({\n            seed: Array.from(x.seed),\n            addressMerkleTreeRootIndex: x.addressMerkleTreeRootIndex,\n            addressMerkleTreeAccountIndex: 0, // will be assigned later\n            addressQueueAccountIndex: 0, // will be assigned later\n        }));\n\n    newAddressParams.forEach((params, i) => {\n        newAddressParamsPacked[i].addressMerkleTreeAccountIndex = getIndexOrAdd(\n            _remainingAccounts,\n            params.addressMerkleTreePubkey,\n        );\n    });\n\n    newAddressParams.forEach((params, i) => {\n        newAddressParamsPacked[i].addressQueueAccountIndex = getIndexOrAdd(\n            _remainingAccounts,\n            params.addressQueuePubkey,\n        );\n    });\n\n    return { newAddressParamsPacked, remainingAccounts: _remainingAccounts };\n}\n\n//@ts-ignore\nif (import.meta.vitest) {\n    //@ts-ignore\n    const { it, expect, describe } = import.meta.vitest;\n\n    const programId = new PublicKey(\n        '7yucc7fL3JGbyMwg4neUaenNSdySS39hbAk89Ao3t1Hz',\n    );\n\n    describe('derive address seed', () => {\n        it('should derive a valid address seed', () => {\n            const seeds: Uint8Array[] = [\n                new TextEncoder().encode('foo'),\n                new TextEncoder().encode('bar'),\n            ];\n            expect(deriveAddressSeed(seeds, programId)).toStrictEqual(\n                new Uint8Array([\n                    0, 246, 150, 3, 192, 95, 53, 123, 56, 139, 206, 179, 253,\n                    133, 115, 103, 120, 155, 251, 72, 250, 47, 117, 217, 118,\n                    59, 174, 207, 49, 101, 201, 110,\n                ]),\n            );\n        });\n\n        it('should derive a valid address seed', () => {\n            const seeds: Uint8Array[] = [\n                new TextEncoder().encode('ayy'),\n                new TextEncoder().encode('lmao'),\n            ];\n            expect(deriveAddressSeed(seeds, programId)).toStrictEqual(\n                new Uint8Array([\n                    0, 202, 44, 25, 221, 74, 144, 92, 69, 168, 38, 19, 206, 208,\n                    29, 162, 53, 27, 120, 214, 152, 116, 15, 107, 212, 168, 33,\n                    121, 187, 10, 76, 233,\n                ]),\n            );\n        });\n    });\n\n    describe('deriveAddress function', () => {\n        it('should derive a valid address from a seed and a merkle tree public key', async () => {\n            const seeds: Uint8Array[] = [\n                new TextEncoder().encode('foo'),\n                new TextEncoder().encode('bar'),\n            ];\n            const seed = deriveAddressSeed(seeds, programId);\n            const merkleTreePubkey = new PublicKey(\n                '11111111111111111111111111111111',\n            );\n            const derivedAddress = deriveAddress(seed, merkleTreePubkey);\n            expect(derivedAddress).toBeInstanceOf(PublicKey);\n            expect(derivedAddress).toStrictEqual(\n                new PublicKey('139uhyyBtEh4e1CBDJ68ooK5nCeWoncZf9HPyAfRrukA'),\n            );\n        });\n\n        it('should derive a valid address from a seed and a merkle tree public key', async () => {\n            const seeds: Uint8Array[] = [\n                new TextEncoder().encode('ayy'),\n                new TextEncoder().encode('lmao'),\n            ];\n            const seed = deriveAddressSeed(seeds, programId);\n            const merkleTreePubkey = new PublicKey(\n                '11111111111111111111111111111111',\n            );\n            const derivedAddress = deriveAddress(seed, merkleTreePubkey);\n            expect(derivedAddress).toBeInstanceOf(PublicKey);\n            expect(derivedAddress).toStrictEqual(\n                new PublicKey('12bhHm6PQjbNmEn3Yu1Gq9k7XwVn2rZpzYokmLwbFazN'),\n            );\n        });\n    });\n\n    describe('packNewAddressParams function', () => {\n        it('should pack new address params correctly', () => {\n            const newAddressParams = [\n                {\n                    seed: new Uint8Array([1, 2, 3, 4]),\n                    addressMerkleTreeRootIndex: 0,\n                    addressMerkleTreePubkey: new PublicKey(\n                        '11111111111111111111111111111111',\n                    ),\n                    addressQueuePubkey: new PublicKey(\n                        '11111111111111111111111111111112',\n                    ),\n                },\n            ];\n            const remainingAccounts = [\n                new PublicKey('11111111111111111111111111111112'),\n                new PublicKey('11111111111111111111111111111111'),\n            ];\n            const packedParams = packNewAddressParams(\n                newAddressParams,\n                remainingAccounts,\n            );\n            expect(\n                packedParams.newAddressParamsPacked[0]\n                    .addressMerkleTreeAccountIndex,\n            ).toBe(1);\n            expect(\n                packedParams.newAddressParamsPacked[0].addressQueueAccountIndex,\n            ).toBe(0);\n        });\n    });\n}\n","import {\n    Commitment,\n    Connection,\n    PublicKey,\n    TransactionConfirmationStrategy,\n} from '@solana/web3.js';\n\nexport async function airdropSol({\n    connection,\n    lamports,\n    recipientPublicKey,\n}: {\n    connection: Connection;\n    lamports: number;\n    recipientPublicKey: PublicKey;\n}) {\n    const txHash = await connection.requestAirdrop(\n        recipientPublicKey,\n        lamports,\n    );\n    await confirmTransaction(connection, txHash);\n    return txHash;\n}\n\nexport async function confirmTransaction(\n    connection: Connection,\n    signature: string,\n    confirmation: Commitment = 'confirmed',\n) {\n    const latestBlockHash = await connection.getLatestBlockhash(confirmation);\n    const strategy: TransactionConfirmationStrategy = {\n        signature: signature.toString(),\n        lastValidBlockHeight: latestBlockHash.lastValidBlockHeight,\n        blockhash: latestBlockHash.blockhash,\n    };\n    return await connection.confirmTransaction(strategy, confirmation);\n}\n","import BN from 'bn.js';\nimport { FIELD_SIZE } from '../constants';\nimport { CompressedProof } from '../state';\n\ninterface GnarkProofJson {\n    ar: string[];\n    bs: string[][];\n    krs: string[];\n}\n\ntype ProofABC = {\n    a: Uint8Array;\n    b: Uint8Array;\n    c: Uint8Array;\n};\n\nexport const placeholderValidityProof = () => ({\n    a: Array.from({ length: 32 }, (_, i) => i + 1),\n    b: Array.from({ length: 64 }, (_, i) => i + 1),\n    c: Array.from({ length: 32 }, (_, i) => i + 1),\n});\n\nexport const checkValidityProofShape = (proof: CompressedProof) => {\n    if (\n        proof.a.length !== 32 ||\n        proof.b.length !== 64 ||\n        proof.c.length !== 32\n    ) {\n        throw new Error('ValidityProof has invalid shape');\n    }\n};\n\nexport function proofFromJsonStruct(json: GnarkProofJson): ProofABC {\n    const proofAX = deserializeHexStringToBeBytes(json.ar[0]);\n    const proofAY = deserializeHexStringToBeBytes(json.ar[1]);\n    const proofA: Uint8Array = new Uint8Array([...proofAX, ...proofAY]);\n\n    const proofBX0 = deserializeHexStringToBeBytes(json.bs[0][0]);\n    const proofBX1 = deserializeHexStringToBeBytes(json.bs[0][1]);\n    const proofBY0 = deserializeHexStringToBeBytes(json.bs[1][0]);\n    const proofBY1 = deserializeHexStringToBeBytes(json.bs[1][1]);\n    const proofB: Uint8Array = new Uint8Array([\n        ...proofBX0,\n        ...proofBX1,\n        ...proofBY0,\n        ...proofBY1,\n    ]);\n\n    const proofCX = deserializeHexStringToBeBytes(json.krs[0]);\n    const proofCY = deserializeHexStringToBeBytes(json.krs[1]);\n    const proofC: Uint8Array = new Uint8Array([...proofCX, ...proofCY]);\n\n    const proofABC: ProofABC = { a: proofA, b: proofB, c: proofC };\n    return proofABC;\n}\n\n// TODO: add unit test for negation\n// TODO: test if LE BE issue. unit test\nexport function negateAndCompressProof(proof: ProofABC): CompressedProof {\n    const proofA = proof.a;\n    const proofB = proof.b;\n    const proofC = proof.c;\n\n    const aXElement = proofA.slice(0, 32);\n    const aYElement = new BN(proofA.slice(32, 64), 32, 'be');\n\n    /// Negate\n    const proofAIsPositive = yElementIsPositiveG1(aYElement) ? false : true;\n    /// First byte of proofA is the bitmask\n    aXElement[0] = addBitmaskToByte(aXElement[0], proofAIsPositive);\n\n    const bXElement = proofB.slice(0, 64);\n    const bYElement = proofB.slice(64, 128);\n\n    const proofBIsPositive = yElementIsPositiveG2(\n        new BN(bYElement.slice(0, 32), 32, 'be'),\n        new BN(bYElement.slice(32, 64), 32, 'be'),\n    );\n\n    bXElement[0] = addBitmaskToByte(bXElement[0], proofBIsPositive);\n\n    const cXElement = proofC.slice(0, 32);\n    const cYElement = proofC.slice(32, 64);\n    const proofCIsPositive = yElementIsPositiveG1(new BN(cYElement, 32, 'be'));\n    cXElement[0] = addBitmaskToByte(cXElement[0], proofCIsPositive);\n\n    const compressedProof: CompressedProof = {\n        a: Array.from(aXElement),\n        b: Array.from(bXElement),\n        c: Array.from(cXElement),\n    };\n\n    return compressedProof;\n}\n\nfunction deserializeHexStringToBeBytes(hexStr: string): Uint8Array {\n    // Using BN for simpler conversion from hex string to byte array\n    const bn = new BN(\n        hexStr.startsWith('0x') ? hexStr.substring(2) : hexStr,\n        'hex',\n    );\n    return new Uint8Array(bn.toArray('be', 32));\n}\n\nfunction yElementIsPositiveG1(yElement: BN): boolean {\n    return yElement.lte(FIELD_SIZE.sub(yElement));\n}\n\nfunction yElementIsPositiveG2(yElement1: BN, yElement2: BN): boolean {\n    const fieldMidpoint = FIELD_SIZE.div(new BN(2));\n\n    // Compare the first component of the y coordinate\n    if (yElement1.lt(fieldMidpoint)) {\n        return true;\n    } else if (yElement1.gt(fieldMidpoint)) {\n        return false;\n    }\n\n    // If the first component is equal to the midpoint, compare the second component\n    return yElement2.lt(fieldMidpoint);\n}\n// bitmask compatible with solana altbn128 compression syscall and arkworks' implementation\n// https://github.com/arkworks-rs/algebra/blob/master/ff/src/fields/models/fp/mod.rs#L580\n// https://github.com/arkworks-rs/algebra/blob/master/serialize/src/flags.rs#L18\n// fn u8_bitmask(value: u8, inf: bool, neg: bool) -> u8 {\n//     let mut mask = 0;\n//     match self {\n//         inf => mask |= 1 << 6,\n//         neg => mask |= 1 << 7,\n//         _ => (),\n//     }\n//     mask\n// }\nfunction addBitmaskToByte(byte: number, yIsPositive: boolean): number {\n    if (!yIsPositive) {\n        return (byte |= 1 << 7);\n    } else {\n        return byte;\n    }\n}\n\n//@ts-ignore\nif (import.meta.vitest) {\n    //@ts-ignore\n    const { it, expect, describe } = import.meta.vitest;\n\n    // Unit test for addBitmaskToByte function\n    describe('addBitmaskToByte', () => {\n        it('should add a bitmask to the byte if yIsPositive is false', () => {\n            const byte = 0b00000000;\n            const yIsPositive = false;\n            const result = addBitmaskToByte(byte, yIsPositive);\n            expect(result).toBe(0b10000000); // 128 in binary, which is 1 << 7\n        });\n\n        it('should not modify the byte if yIsPositive is true', () => {\n            const byte = 0b00000000;\n            const yIsPositive = true;\n            const result = addBitmaskToByte(byte, yIsPositive);\n            expect(result).toBe(0b00000000);\n        });\n    });\n\n    describe('test prover server', () => {\n        const TEST_JSON = {\n            ar: [\n                '0x22bdaa3187d8fe294925a66fa0165a11bc9e07678fa2fc72402ebfd33d521c69',\n                '0x2d18ff780b69898b4cdd8d7b6ac72d077799399f0f45e52665426456f3903584',\n            ],\n            bs: [\n                [\n                    '0x138cc0962e49f76a701d2871d2799892c9782940095eb0429e979f336d2e162d',\n                    '0x2fe1bfbb15cbfb83d7e00ace23e45f890604003783eaf34affa35e0d6f4822bc',\n                ],\n                [\n                    '0x1a89264f82cc6e8ef1c696bea0b5803c28c0ba6ab61366bcb71e73a4135cae8d',\n                    '0xf778d857b3df01a4100265c9d014ce02d47425f0114685356165fa5ee3f3a26',\n                ],\n            ],\n            krs: [\n                '0x176b6ae9001f66832951e2d43a98a972667447bb1781f534b70cb010270dcdd3',\n                '0xb748d5fac1686db28d94c02250af7eb4f28dfdabc8983305c45bcbc6e163eeb',\n            ],\n        };\n        const COMPRESSED_PROOF_A = [\n            34, 189, 170, 49, 135, 216, 254, 41, 73, 37, 166, 111, 160, 22, 90,\n            17, 188, 158, 7, 103, 143, 162, 252, 114, 64, 46, 191, 211, 61, 82,\n            28, 105,\n        ];\n        const COMPRESSED_PROOF_B = [\n            147, 140, 192, 150, 46, 73, 247, 106, 112, 29, 40, 113, 210, 121,\n            152, 146, 201, 120, 41, 64, 9, 94, 176, 66, 158, 151, 159, 51, 109,\n            46, 22, 45, 47, 225, 191, 187, 21, 203, 251, 131, 215, 224, 10, 206,\n            35, 228, 95, 137, 6, 4, 0, 55, 131, 234, 243, 74, 255, 163, 94, 13,\n            111, 72, 34, 188,\n        ];\n        const COMPRESSED_PROOF_C = [\n            23, 107, 106, 233, 0, 31, 102, 131, 41, 81, 226, 212, 58, 152, 169,\n            114, 102, 116, 71, 187, 23, 129, 245, 52, 183, 12, 176, 16, 39, 13,\n            205, 211,\n        ];\n\n        it('should execute a compressed token mint', async () => {\n            const proof = proofFromJsonStruct(TEST_JSON);\n            const compressedProof = negateAndCompressProof(proof);\n            expect(compressedProof.a).toEqual(COMPRESSED_PROOF_A);\n            expect(compressedProof.b).toEqual(COMPRESSED_PROOF_B);\n            expect(compressedProof.c).toEqual(COMPRESSED_PROOF_C);\n        });\n    });\n    describe('Validity Proof Functions', () => {\n        describe('placeholderValidityProof', () => {\n            it('should create a validity proof with correct shape', () => {\n                const validityProof = placeholderValidityProof();\n                expect(validityProof.a.length).toBe(32);\n                expect(validityProof.b.length).toBe(64);\n                expect(validityProof.c.length).toBe(32);\n            });\n        });\n\n        describe('checkValidityProofShape', () => {\n            it('should not throw an error for valid proof shape', () => {\n                const validProof = {\n                    a: Array.from(new Uint8Array(32)),\n                    b: Array.from(new Uint8Array(64)),\n                    c: Array.from(new Uint8Array(32)),\n                };\n                expect(() => checkValidityProofShape(validProof)).not.toThrow();\n            });\n\n            it('should throw an error for an invalid proof', () => {\n                const invalidProof = {\n                    a: Array.from(new Uint8Array(31)), // incorrect length\n                    b: Array.from(new Uint8Array(64)),\n                    c: Array.from(new Uint8Array(32)),\n                };\n                expect(() => checkValidityProofShape(invalidProof)).toThrow(\n                    'ValidityProof has invalid shape',\n                );\n            });\n        });\n    });\n}\n","/** pipe function */\nexport function pipe<T, R>(\n    initialFunction: (arg: T) => R,\n    ...functions: ((arg: R) => R)[]\n): (initialValue: T) => R {\n    return (initialValue: T): R =>\n        functions.reduce(\n            (currentValue, currentFunction) => currentFunction(currentValue),\n            initialFunction(initialValue),\n        );\n}\n\n//@ts-ignore\nif (import.meta.vitest) {\n    //@ts-ignore\n    const { it, expect, describe } = import.meta.vitest;\n\n    describe('pipe', () => {\n        it('should return the result of applying all fns to the initial value', () => {\n            const addOne = (x: number) => x + 1;\n            const multiplyByTwo = (x: number) => x * 2;\n            const subtractThree = (x: number) => x - 3;\n            const addOneMultiplyByTwoSubtractThree = pipe(\n                addOne,\n                multiplyByTwo,\n                subtractThree,\n            );\n            expect(addOneMultiplyByTwoSubtractThree(5)).toBe(9);\n        });\n    });\n}\n","import {\n    VersionedTransaction,\n    TransactionConfirmationStrategy,\n    SignatureResult,\n    RpcResponseAndContext,\n    Signer,\n    TransactionInstruction,\n    TransactionMessage,\n    ConfirmOptions,\n    TransactionSignature,\n    PublicKey,\n    AddressLookupTableAccount,\n} from '@solana/web3.js';\nimport { Rpc } from '../rpc';\n\n/**\n * Builds a versioned Transaction from instructions.\n *\n * @param instructions          instructions to include\n * @param payerPublicKey        fee payer public key\n * @param blockhash             blockhash to use\n * @param lookupTableAccounts   lookup table accounts to include\n *\n * @return VersionedTransaction\n */\nexport function buildTx(\n    instructions: TransactionInstruction[],\n    payerPublicKey: PublicKey,\n    blockhash: string,\n    lookupTableAccounts?: AddressLookupTableAccount[],\n): VersionedTransaction {\n    const messageV0 = new TransactionMessage({\n        payerKey: payerPublicKey,\n        recentBlockhash: blockhash,\n        instructions,\n    }).compileToV0Message(lookupTableAccounts);\n\n    return new VersionedTransaction(messageV0);\n}\n\n/**\n * Sends a versioned transaction and confirms it.\n *\n * @param rpc               connection to use\n * @param tx                versioned transaction to send\n * @param confirmOptions    confirmation options\n * @param blockHashCtx      blockhash context for confirmation\n *\n * @return TransactionSignature\n */\nexport async function sendAndConfirmTx(\n    rpc: Rpc,\n    tx: VersionedTransaction,\n    confirmOptions?: ConfirmOptions,\n    blockHashCtx?: { blockhash: string; lastValidBlockHeight: number },\n): Promise<TransactionSignature> {\n    const txId = await rpc.sendTransaction(tx, confirmOptions);\n\n    if (!blockHashCtx) blockHashCtx = await rpc.getLatestBlockhash();\n\n    const transactionConfirmationStrategy0: TransactionConfirmationStrategy = {\n        signature: txId,\n        blockhash: blockHashCtx.blockhash,\n        lastValidBlockHeight: blockHashCtx.lastValidBlockHeight,\n    };\n\n    const ctxAndRes = await rpc.confirmTransaction(\n        transactionConfirmationStrategy0,\n        confirmOptions?.commitment || rpc.commitment || 'confirmed',\n    );\n    const slot = ctxAndRes.context.slot;\n    await rpc.confirmTransactionIndexed(slot);\n    return txId;\n}\n\n/**\n * Confirms a transaction with a given txId.\n *\n * @param rpc               connection to use\n * @param txId              transaction signature to confirm\n * @param confirmOptions    confirmation options\n * @param blockHashCtx      blockhash context for confirmation\n * @return SignatureResult\n */\nexport async function confirmTx(\n    rpc: Rpc,\n    txId: string,\n    confirmOptions?: ConfirmOptions,\n    blockHashCtx?: { blockhash: string; lastValidBlockHeight: number },\n): Promise<RpcResponseAndContext<SignatureResult>> {\n    if (!blockHashCtx) blockHashCtx = await rpc.getLatestBlockhash();\n\n    const transactionConfirmationStrategy: TransactionConfirmationStrategy = {\n        signature: txId,\n        blockhash: blockHashCtx.blockhash,\n        lastValidBlockHeight: blockHashCtx.lastValidBlockHeight,\n    };\n    const res = await rpc.confirmTransaction(\n        transactionConfirmationStrategy,\n        confirmOptions?.commitment || rpc.commitment || 'confirmed',\n    );\n    const slot = res.context.slot;\n    await rpc.confirmTransactionIndexed(slot);\n    return res;\n}\n\n/**\n * Builds a versioned Transaction from instructions and signs it.\n *\n * @param instructions          instructions to include in the transaction\n * @param payer                 payer of the transaction\n * @param blockhash             recent blockhash to use in the transaction\n * @param additionalSigners     non-feepayer signers to include in the\n *                              transaction\n * @param lookupTableAccounts   lookup table accounts to include in the\n *                              transaction\n */\nexport function buildAndSignTx(\n    instructions: TransactionInstruction[],\n    payer: Signer,\n    blockhash: string,\n    additionalSigners: Signer[] = [],\n    lookupTableAccounts?: AddressLookupTableAccount[],\n): VersionedTransaction {\n    if (additionalSigners.includes(payer))\n        throw new Error('payer must not be in additionalSigners');\n    const allSigners = [payer, ...additionalSigners];\n\n    const tx = buildTx(\n        instructions,\n        payer.publicKey,\n        blockhash,\n        lookupTableAccounts,\n    );\n\n    tx.sign(allSigners);\n\n    return tx;\n}\n","// zzz\nexport function sleep(ms: number): Promise<void> {\n    return new Promise(resolve => setTimeout(resolve, ms));\n}\n","import { Connection, Keypair, Signer } from '@solana/web3.js';\nimport { confirmTx } from '../utils/send-and-confirm';\nimport { Rpc } from '../rpc';\n\nlet c = 1;\n\nexport const ALICE = getTestKeypair(255);\nexport const BOB = getTestKeypair(254);\nexport const CHARLIE = getTestKeypair(253);\nexport const DAVE = getTestKeypair(252);\n\n/**\n * Create a new account and airdrop lamports to it\n *\n * @param rpc       connection to use\n * @param lamports  amount of lamports to airdrop\n * @param counter   counter to use for generating the keypair.\n *                  If undefined or >255, generates random keypair.\n */\nexport async function newAccountWithLamports(\n    rpc: Rpc,\n    lamports = 1000000000,\n    counter: number | undefined = undefined,\n): Promise<Signer> {\n    /// get random keypair\n    if (counter === undefined || counter > 255) {\n        counter = 256;\n    }\n\n    const account = getTestKeypair(counter);\n    const sig = await rpc.requestAirdrop(account.publicKey, lamports);\n    await confirmTx(rpc, sig);\n    return account;\n}\n\nexport function getConnection(): Connection {\n    const url = 'http://127.0.0.1:8899';\n    const connection = new Connection(url, 'confirmed');\n    return connection;\n}\n\n/**\n * For use in tests.\n * Generate a unique keypair by passing in a counter <255. If no counter\n * is supplied, it uses and increments a global counter.\n * if counter > 255, generates random keypair\n */\nexport function getTestKeypair(\n    counter: number | undefined = undefined,\n): Keypair {\n    if (!counter) {\n        counter = c;\n        c++;\n    }\n    if (counter > 255) {\n        return Keypair.generate();\n    }\n    const seed = new Uint8Array(32);\n    seed[31] = counter; // le\n\n    return Keypair.fromSeed(seed);\n}\n\n//@ts-ignore\nif (import.meta.vitest) {\n    //@ts-ignore\n    const { describe, it, expect } = import.meta.vitest;\n\n    describe('getTestKeypair', () => {\n        it('should generate a keypair with a specific counter', () => {\n            const keypair = getTestKeypair(10);\n            const keypair2 = getTestKeypair(10);\n            expect(keypair).toEqual(keypair2);\n            expect(keypair).toBeInstanceOf(Keypair);\n            expect(keypair.publicKey).toBeDefined();\n            expect(keypair.secretKey).toBeDefined();\n        });\n\n        it('should generate random keypair if counter is greater than 255', () => {\n            const testFn = () => getTestKeypair(256);\n            const kp1 = testFn();\n            const kp2 = testFn();\n            expect(kp1).not.toEqual(kp2);\n        });\n\n        it('should increment the global counter if no counter is provided', () => {\n            const initialKeypair = getTestKeypair();\n            const nextKeypair = getTestKeypair();\n            const nextNextKeypair = getTestKeypair();\n            const nextNextNextKeypair = getTestKeypair(3);\n            expect(initialKeypair).not.toEqual(nextKeypair);\n            expect(nextKeypair).not.toEqual(nextNextKeypair);\n            expect(nextNextKeypair).toEqual(nextNextNextKeypair);\n        });\n    });\n}\n","/**\n * @param targetLamports - Target priority fee in lamports\n * @param computeUnits - Expected compute units used by the transaction\n * @returns microLamports per compute unit (use in\n * `ComputeBudgetProgram.setComputeUnitPrice`)\n */\nexport function calculateComputeUnitPrice(\n    targetLamports: number,\n    computeUnits: number,\n): number {\n    return Math.ceil((targetLamports * 1_000_000) / computeUnits);\n}\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = require(\"buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nvar buffer_layout_2 = require(\"buffer-layout\");\nObject.defineProperty(exports, \"u8\", { enumerable: true, get: function () { return buffer_layout_2.u8; } });\nObject.defineProperty(exports, \"i8\", { enumerable: true, get: function () { return buffer_layout_2.s8; } });\nObject.defineProperty(exports, \"u16\", { enumerable: true, get: function () { return buffer_layout_2.u16; } });\nObject.defineProperty(exports, \"i16\", { enumerable: true, get: function () { return buffer_layout_2.s16; } });\nObject.defineProperty(exports, \"u32\", { enumerable: true, get: function () { return buffer_layout_2.u32; } });\nObject.defineProperty(exports, \"i32\", { enumerable: true, get: function () { return buffer_layout_2.s32; } });\nObject.defineProperty(exports, \"f32\", { enumerable: true, get: function () { return buffer_layout_2.f32; } });\nObject.defineProperty(exports, \"f64\", { enumerable: true, get: function () { return buffer_layout_2.f64; } });\nObject.defineProperty(exports, \"struct\", { enumerable: true, get: function () { return buffer_layout_2.struct; } });\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = (0, buffer_layout_1.blob)(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n    return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n    return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = (0, buffer_layout_1.u8)();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = (0, buffer_layout_1.struct)([\n        u64(\"tag\"),\n        layout.replicate(\"data\"),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error(\"Invalid tag, expected: \" +\n                tag.toString(\"hex\") +\n                \", got: \" +\n                receivedTag.toString(\"hex\"));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = (0, buffer_layout_1.struct)([\n        (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map","import { Buffer } from 'buffer';\nimport { PublicKey, AccountMeta } from '@solana/web3.js';\nimport {\n    struct,\n    u8,\n    u64,\n    bool,\n    vec,\n    option,\n    publicKey,\n    array,\n    u16,\n    u32,\n    Layout,\n    vecU8,\n} from '@coral-xyz/borsh';\nimport { InstructionDataInvoke, PublicTransactionEvent } from '../state';\nimport { LightSystemProgram } from './system';\nexport const CompressedAccountLayout = struct(\n    [\n        publicKey('owner'),\n        u64('lamports'),\n        option(array(u8(), 32), 'address'),\n        option(\n            struct([\n                array(u8(), 8, 'discriminator'),\n                vecU8('data'),\n                array(u8(), 32, 'dataHash'),\n            ]),\n            'data',\n        ),\n    ],\n    'compressedAccount',\n);\n\nexport const MerkleContextLayout = struct(\n    [\n        u8('merkleTreePubkeyIndex'),\n        u8('nullifierQueuePubkeyIndex'),\n        u32('leafIndex'),\n        option(struct([u8('queueId'), u16('index')]), 'queueIndex'),\n    ],\n    'merkleContext',\n);\n\nexport const NewAddressParamsLayout = struct(\n    [\n        array(u8(), 32, 'seed'),\n        u8('addressQueueAccountIndex'),\n        u8('addressMerkleTreeAccountIndex'),\n        u16('addressMerkleTreeRootIndex'),\n    ],\n    'newAddressParams',\n);\n\n// Use the defined structs in the main layout with field names\nexport const InstructionDataInvokeLayout: Layout<InstructionDataInvoke> =\n    struct([\n        option(\n            struct([\n                array(u8(), 32, 'a'),\n                array(u8(), 64, 'b'),\n                array(u8(), 32, 'c'),\n            ]),\n            'proof',\n        ),\n        vec(\n            struct([\n                CompressedAccountLayout,\n                MerkleContextLayout,\n                u16('rootIndex'),\n                bool('readOnly'),\n            ]),\n            'inputCompressedAccountsWithMerkleContext',\n        ),\n        vec(\n            struct([CompressedAccountLayout, u8('merkleTreeIndex')]),\n            'outputCompressedAccounts',\n        ),\n        option(u64(), 'relayFee'),\n        vec(NewAddressParamsLayout, 'newAddressParams'),\n        option(u64(), 'compressOrDecompressLamports'),\n        bool('isCompress'),\n    ]);\n\nexport function encodeInstructionDataInvoke(\n    data: InstructionDataInvoke,\n): Buffer {\n    const buffer = Buffer.alloc(1000);\n    const len = InstructionDataInvokeLayout.encode(data, buffer);\n    const dataBuffer = Buffer.from(buffer.slice(0, len));\n\n    const lengthBuffer = Buffer.alloc(4);\n    lengthBuffer.writeUInt32LE(len, 0);\n\n    return Buffer.concat([\n        Buffer.from([26, 16, 169, 7, 21, 202, 242, 25]),\n        lengthBuffer,\n        dataBuffer,\n    ]);\n}\n\nexport function decodeInstructionDataInvoke(\n    buffer: Buffer,\n): InstructionDataInvoke {\n    return InstructionDataInvokeLayout.decode(buffer);\n}\n\nexport type invokeAccountsLayoutParams = {\n    feePayer: PublicKey;\n    authority: PublicKey;\n    registeredProgramPda: PublicKey;\n    noopProgram: PublicKey;\n    accountCompressionAuthority: PublicKey;\n    accountCompressionProgram: PublicKey;\n    solPoolPda: PublicKey | null;\n    decompressionRecipient: PublicKey | null;\n    systemProgram: PublicKey;\n};\n\nexport const invokeAccountsLayout = (\n    accounts: invokeAccountsLayoutParams,\n): AccountMeta[] => {\n    const defaultPubkey = LightSystemProgram.programId;\n    const {\n        feePayer,\n        authority,\n        registeredProgramPda,\n        noopProgram,\n        accountCompressionAuthority,\n        accountCompressionProgram,\n        solPoolPda,\n        decompressionRecipient,\n        systemProgram,\n    } = accounts;\n\n    return [\n        { pubkey: feePayer, isSigner: true, isWritable: true },\n        { pubkey: authority, isSigner: true, isWritable: false },\n        { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n        { pubkey: noopProgram, isSigner: false, isWritable: false },\n        {\n            pubkey: accountCompressionAuthority,\n            isSigner: false,\n            isWritable: false,\n        },\n        {\n            pubkey: accountCompressionProgram,\n            isSigner: false,\n            isWritable: false,\n        },\n        {\n            pubkey: solPoolPda ?? defaultPubkey,\n            isSigner: false,\n            isWritable: solPoolPda !== null,\n        },\n        {\n            pubkey: decompressionRecipient ?? defaultPubkey,\n            isSigner: false,\n            isWritable: true,\n        },\n        { pubkey: systemProgram, isSigner: false, isWritable: false },\n    ];\n};\n\nexport const PublicTransactionEventLayout: Layout<PublicTransactionEvent> =\n    struct([\n        vec(array(u8(), 32), 'inputCompressedAccountHashes'),\n        vec(array(u8(), 32), 'outputCompressedAccountHashes'),\n        vec(\n            struct([\n                struct(\n                    [\n                        publicKey('owner'),\n                        u64('lamports'),\n                        option(array(u8(), 32), 'address'),\n                        option(\n                            struct([\n                                array(u8(), 8, 'discriminator'),\n                                vecU8('data'),\n                                array(u8(), 32, 'dataHash'),\n                            ]),\n                            'data',\n                        ),\n                    ],\n                    'compressedAccount',\n                ),\n                u8('merkleTreeIndex'),\n            ]),\n            'outputCompressedAccounts',\n        ),\n        vec(u32(), 'outputLeafIndices'),\n        vec(struct([publicKey('pubkey'), u64('seq')]), 'sequenceNumbers'),\n        option(u64(), 'relayFee'),\n        bool('isCompress'),\n        option(u64(), 'compressOrDecompressLamports'),\n        vec(publicKey(), 'pubkeyArray'),\n        option(vecU8(), 'message'),\n    ]);\n\nexport function encodePublicTransactionEvent(\n    data: PublicTransactionEvent,\n): Buffer {\n    const buffer = Buffer.alloc(1000);\n    const len = PublicTransactionEventLayout.encode(data, buffer);\n    return buffer.slice(0, len);\n}\n\nexport function decodePublicTransactionEvent(\n    buffer: Buffer,\n): PublicTransactionEvent {\n    return PublicTransactionEventLayout.decode(buffer);\n}\n","import BN from 'bn.js';\nimport {\n    PublicKey,\n    TransactionInstruction,\n    SystemProgram,\n} from '@solana/web3.js';\nimport { Buffer } from 'buffer';\nimport {\n    CompressedAccount,\n    CompressedAccountWithMerkleContext,\n    CompressedProof,\n    InstructionDataInvoke,\n    bn,\n    createCompressedAccount,\n} from '../state';\nimport { packCompressedAccounts, toAccountMetas } from '../instruction';\nimport { defaultStaticAccountsStruct } from '../constants';\nimport {\n    validateSameOwner,\n    validateSufficientBalance,\n} from '../utils/validation';\nimport { packNewAddressParams, NewAddressParams } from '../utils';\nimport { encodeInstructionDataInvoke, invokeAccountsLayout } from './layout';\n\nexport const sumUpLamports = (\n    accounts: CompressedAccountWithMerkleContext[],\n): BN => {\n    return accounts.reduce(\n        (acc, account) => acc.add(bn(account.lamports)),\n        bn(0),\n    );\n};\n\n/**\n * Create compressed account system transaction params\n */\ntype CreateAccountWithSeedParams = {\n    /**\n     * The payer of the transaction.\n     */\n    payer: PublicKey;\n    /**\n     * Address params for the new compressed account\n     */\n    newAddressParams: NewAddressParams;\n    newAddress: number[];\n    /**\n     * Recent validity proof proving that there's no existing compressed account\n     * registered with newAccountAddress\n     */\n    recentValidityProof: CompressedProof;\n    /**\n     * State tree pubkey. Defaults to a public state tree if unspecified.\n     */\n    outputStateTree?: PublicKey;\n    /**\n     * Public key of the program to assign as the owner of the created account\n     */\n    programId?: PublicKey;\n    /**\n     * Optional input accounts to transfer lamports from into the new compressed\n     * account.\n     */\n    inputCompressedAccounts?: CompressedAccountWithMerkleContext[];\n    /**\n     * Optional input state root indices of 'inputCompressedAccounts'. The\n     * expiry is tied to the 'recentValidityProof'.\n     */\n    inputStateRootIndices?: number[];\n    /**\n     * Optional lamports to transfer into the new compressed account.\n     */\n    lamports?: number | BN;\n};\n\n/**\n * Defines the parameters for the transfer method\n */\ntype TransferParams = {\n    /**\n     * The payer of the transaction.\n     */\n    payer: PublicKey;\n    /**\n     * The input state to be consumed.\n     */\n    inputCompressedAccounts: CompressedAccountWithMerkleContext[];\n    /**\n     * Recipient address\n     */\n    toAddress: PublicKey;\n    /**\n     * amount of lamports to transfer.\n     */\n    lamports: number | BN;\n    /**\n     * The recent state root indices of the input state. The expiry is tied to\n     * the proof.\n     *\n     * TODO: Add support for passing recent-values after instruction creation.\n     */\n    recentInputStateRootIndices: number[];\n    /**\n     * The recent validity proof for state inclusion of the input state. It\n     * expires after n slots.\n     */\n    recentValidityProof: CompressedProof;\n    /**\n     * The state trees that the tx output should be inserted into. This can be a\n     * single PublicKey or an array of PublicKey. Defaults to the 0th state tree\n     * of input state.\n     */\n    outputStateTrees?: PublicKey[] | PublicKey;\n};\n\n/// TODO:\n/// - add option to compress to another owner\n/// - add option to merge with input state\n/**\n * Defines the parameters for the transfer method\n */\ntype CompressParams = {\n    /**\n     * The payer of the transaction.\n     */\n    payer: PublicKey;\n    /**\n     * address that the lamports are attached to. also defaults to the recipient owner\n     */\n    toAddress: PublicKey;\n    /**\n     * amount of lamports to compress.\n     */\n    lamports: number | BN;\n    /**\n     * The state tree that the tx output should be inserted into. Defaults to a\n     * public state tree if unspecified.\n     */\n    outputStateTree?: PublicKey;\n};\n\n/**\n * Defines the parameters for the transfer method\n */\ntype DecompressParams = {\n    /**\n     * The payer of the transaction.\n     */\n    payer: PublicKey;\n    /**\n     * The input state to be consumed.\n     */\n    inputCompressedAccounts: CompressedAccountWithMerkleContext[];\n    /**\n     * Recipient address of uncompressed lamports\n     */\n    toAddress: PublicKey;\n    /**\n     * amount of lamports to decompress.\n     */\n    lamports: number | BN;\n    /**\n     * The recent state root indices of the input state. The expiry is tied to\n     * the proof.\n     *\n     * TODO: Add support for passing recent-values after instruction creation.\n     */\n    recentInputStateRootIndices: number[];\n    /**\n     * The recent validity proof for state inclusion of the input state. It\n     * expires after n slots.\n     */\n    recentValidityProof: CompressedProof;\n    /**\n     * The state trees that the tx output should be inserted into. This can be a\n     * single PublicKey or an array of PublicKey. Defaults to the 0th state tree\n     * of input state.\n     */\n    outputStateTree?: PublicKey;\n};\n\nconst SOL_POOL_PDA_SEED = Buffer.from('sol_pool_pda');\n\nexport class LightSystemProgram {\n    /**\n     * @internal\n     */\n    constructor() {}\n\n    /**\n     * Public key that identifies the CompressedPda program\n     */\n    static programId: PublicKey = new PublicKey(\n        'SySTEM1eSU2p4BGQfQpimFEWWSC1XDFeun3Nqzz3rT7',\n    );\n\n    /**\n     * @internal\n     * Cwct1kQLwJm8Z3HetLu8m4SXkhD6FZ5fXbJQCxTxPnGY\n     *\n     */\n    static deriveCompressedSolPda(): PublicKey {\n        const seeds = [SOL_POOL_PDA_SEED];\n        const [address, _] = PublicKey.findProgramAddressSync(\n            seeds,\n            this.programId,\n        );\n        return address;\n    }\n\n    static createTransferOutputState(\n        inputCompressedAccounts: CompressedAccountWithMerkleContext[],\n        toAddress: PublicKey,\n        lamports: number | BN,\n    ): CompressedAccount[] {\n        lamports = bn(lamports);\n        const inputLamports = sumUpLamports(inputCompressedAccounts);\n        const changeLamports = inputLamports.sub(lamports);\n\n        validateSufficientBalance(changeLamports);\n\n        if (changeLamports.eq(bn(0))) {\n            return [createCompressedAccount(toAddress, lamports)];\n        }\n\n        validateSameOwner(inputCompressedAccounts);\n\n        const outputCompressedAccounts: CompressedAccount[] = [\n            createCompressedAccount(\n                inputCompressedAccounts[0].owner,\n\n                changeLamports,\n            ),\n            createCompressedAccount(toAddress, lamports),\n        ];\n        return outputCompressedAccounts;\n    }\n\n    static createDecompressOutputState(\n        inputCompressedAccounts: CompressedAccountWithMerkleContext[],\n        lamports: number | BN,\n    ): CompressedAccount[] {\n        lamports = bn(lamports);\n        const inputLamports = sumUpLamports(inputCompressedAccounts);\n        const changeLamports = inputLamports.sub(lamports);\n\n        validateSufficientBalance(changeLamports);\n\n        /// lamports gets decompressed\n        if (changeLamports.eq(bn(0))) {\n            return [];\n        }\n\n        validateSameOwner(inputCompressedAccounts);\n\n        const outputCompressedAccounts: CompressedAccount[] = [\n            createCompressedAccount(\n                inputCompressedAccounts[0].owner,\n                changeLamports,\n            ),\n        ];\n        return outputCompressedAccounts;\n    }\n\n    /**\n     * No data by default\n     */\n    static createNewAddressOutputState(\n        address: number[],\n        owner: PublicKey,\n        lamports?: BN | number,\n        inputCompressedAccounts?: CompressedAccountWithMerkleContext[],\n    ): CompressedAccount[] {\n        lamports = bn(lamports ?? 0);\n        const inputLamports = sumUpLamports(inputCompressedAccounts ?? []);\n        const changeLamports = inputLamports.sub(lamports);\n\n        validateSufficientBalance(changeLamports);\n\n        if (changeLamports.eq(bn(0)) || !inputCompressedAccounts) {\n            return [\n                createCompressedAccount(owner, lamports, undefined, address),\n            ];\n        }\n\n        validateSameOwner(inputCompressedAccounts);\n        const outputCompressedAccounts: CompressedAccount[] = [\n            createCompressedAccount(\n                inputCompressedAccounts[0].owner,\n                changeLamports,\n            ),\n            createCompressedAccount(owner, lamports, undefined, address),\n        ];\n        return outputCompressedAccounts;\n    }\n\n    /**\n     * Creates instruction to create compressed account with PDA.\n     * Cannot write data.\n     *\n     * TODO: support transfer of lamports to the new account.\n     */\n    static async createAccount({\n        payer,\n        newAddressParams,\n        newAddress,\n        recentValidityProof,\n        outputStateTree,\n        inputCompressedAccounts,\n        inputStateRootIndices,\n        lamports,\n    }: CreateAccountWithSeedParams): Promise<TransactionInstruction> {\n        const outputCompressedAccounts = this.createNewAddressOutputState(\n            newAddress,\n            payer,\n            lamports,\n            inputCompressedAccounts,\n        );\n        /// Pack accounts\n        const {\n            packedInputCompressedAccounts,\n            packedOutputCompressedAccounts,\n            remainingAccounts: _remainingAccounts,\n        } = packCompressedAccounts(\n            inputCompressedAccounts ?? [],\n            inputStateRootIndices ?? [],\n            outputCompressedAccounts,\n            outputStateTree,\n        );\n\n        const { newAddressParamsPacked, remainingAccounts } =\n            packNewAddressParams([newAddressParams], _remainingAccounts);\n\n        const rawData: InstructionDataInvoke = {\n            proof: recentValidityProof,\n            inputCompressedAccountsWithMerkleContext:\n                packedInputCompressedAccounts,\n            outputCompressedAccounts: packedOutputCompressedAccounts,\n            relayFee: null,\n            newAddressParams: newAddressParamsPacked,\n            compressOrDecompressLamports: null,\n            isCompress: false,\n        };\n        const data = encodeInstructionDataInvoke(rawData);\n\n        const accounts = invokeAccountsLayout({\n            ...defaultStaticAccountsStruct(),\n            feePayer: payer,\n            authority: payer,\n            solPoolPda: null,\n            decompressionRecipient: null,\n            systemProgram: SystemProgram.programId,\n        });\n        const keys = [...accounts, ...toAccountMetas(remainingAccounts)];\n\n        return new TransactionInstruction({\n            programId: this.programId,\n            keys,\n            data,\n        });\n    }\n\n    /**\n     * Creates a transaction instruction that transfers compressed lamports from\n     * one owner to another.\n     */\n    static async transfer({\n        payer,\n        inputCompressedAccounts,\n        toAddress,\n        lamports,\n        recentInputStateRootIndices,\n        recentValidityProof,\n        outputStateTrees,\n    }: TransferParams): Promise<TransactionInstruction> {\n        /// Create output state\n        const outputCompressedAccounts = this.createTransferOutputState(\n            inputCompressedAccounts,\n            toAddress,\n            lamports,\n        );\n        /// Pack accounts\n        const {\n            packedInputCompressedAccounts,\n            packedOutputCompressedAccounts,\n            remainingAccounts,\n        } = packCompressedAccounts(\n            inputCompressedAccounts,\n            recentInputStateRootIndices,\n            outputCompressedAccounts,\n            outputStateTrees,\n        );\n        /// Encode instruction data\n        const rawInputs: InstructionDataInvoke = {\n            proof: recentValidityProof,\n            inputCompressedAccountsWithMerkleContext:\n                packedInputCompressedAccounts,\n            outputCompressedAccounts: packedOutputCompressedAccounts,\n            relayFee: null,\n            newAddressParams: [],\n            compressOrDecompressLamports: null,\n            isCompress: false,\n        };\n        const data = encodeInstructionDataInvoke(rawInputs);\n\n        const accounts = invokeAccountsLayout({\n            ...defaultStaticAccountsStruct(),\n            feePayer: payer,\n            authority: payer,\n            solPoolPda: null,\n            decompressionRecipient: null,\n            systemProgram: SystemProgram.programId,\n        });\n        const keys = [...accounts, ...toAccountMetas(remainingAccounts)];\n\n        return new TransactionInstruction({\n            programId: this.programId,\n            keys,\n            data,\n        });\n    }\n\n    /**\n     * Creates a transaction instruction that transfers compressed lamports from\n     * one owner to another.\n     */\n    // TODO: add support for non-fee-payer owner\n    static async compress({\n        payer,\n        toAddress,\n        lamports,\n        outputStateTree,\n    }: CompressParams): Promise<TransactionInstruction> {\n        /// Create output state\n        lamports = bn(lamports);\n\n        const outputCompressedAccount = createCompressedAccount(\n            toAddress,\n            lamports,\n        );\n\n        /// Pack accounts\n        const {\n            packedInputCompressedAccounts,\n            packedOutputCompressedAccounts,\n            remainingAccounts,\n        } = packCompressedAccounts(\n            [],\n            [],\n            [outputCompressedAccount],\n            outputStateTree,\n        );\n\n        /// Encode instruction data\n        const rawInputs: InstructionDataInvoke = {\n            proof: null,\n            inputCompressedAccountsWithMerkleContext:\n                packedInputCompressedAccounts,\n            outputCompressedAccounts: packedOutputCompressedAccounts,\n            relayFee: null,\n            /// TODO: here and on-chain: option<newAddressInputs> or similar.\n            newAddressParams: [],\n            compressOrDecompressLamports: lamports,\n            isCompress: true,\n        };\n\n        const data = encodeInstructionDataInvoke(rawInputs);\n\n        const accounts = invokeAccountsLayout({\n            ...defaultStaticAccountsStruct(),\n            feePayer: payer,\n            authority: payer,\n            solPoolPda: this.deriveCompressedSolPda(),\n            decompressionRecipient: null,\n            systemProgram: SystemProgram.programId,\n        });\n        const keys = [...accounts, ...toAccountMetas(remainingAccounts)];\n\n        return new TransactionInstruction({\n            programId: this.programId,\n            keys,\n            data,\n        });\n    }\n\n    /**\n     * Creates a transaction instruction that transfers compressed lamports from\n     * one owner to another.\n     */\n    static async decompress({\n        payer,\n        inputCompressedAccounts,\n        toAddress,\n        lamports,\n        recentInputStateRootIndices,\n        recentValidityProof,\n        outputStateTree,\n    }: DecompressParams): Promise<TransactionInstruction> {\n        /// Create output state\n        lamports = bn(lamports);\n\n        const outputCompressedAccounts = this.createDecompressOutputState(\n            inputCompressedAccounts,\n            lamports,\n        );\n\n        /// Pack accounts\n        const {\n            packedInputCompressedAccounts,\n            packedOutputCompressedAccounts,\n            remainingAccounts,\n        } = packCompressedAccounts(\n            inputCompressedAccounts,\n            recentInputStateRootIndices,\n            outputCompressedAccounts,\n            outputStateTree,\n        );\n        /// Encode instruction data\n        const rawInputs: InstructionDataInvoke = {\n            proof: recentValidityProof,\n            inputCompressedAccountsWithMerkleContext:\n                packedInputCompressedAccounts,\n            outputCompressedAccounts: packedOutputCompressedAccounts,\n            relayFee: null,\n            newAddressParams: [],\n            compressOrDecompressLamports: lamports,\n            isCompress: false,\n        };\n        const data = encodeInstructionDataInvoke(rawInputs);\n\n        const accounts = invokeAccountsLayout({\n            ...defaultStaticAccountsStruct(),\n            feePayer: payer,\n            authority: payer,\n            solPoolPda: this.deriveCompressedSolPda(),\n            decompressionRecipient: toAddress,\n            systemProgram: SystemProgram.programId,\n        });\n        const keys = [...accounts, ...toAccountMetas(remainingAccounts)];\n\n        return new TransactionInstruction({\n            programId: this.programId,\n            keys,\n            data,\n        });\n    }\n}\n\n/**\n * Selects the minimal number of compressed SOL accounts for a transfer.\n *\n * 1. Sorts the accounts by amount in descending order\n * 2. Accumulates the amount until it is greater than or equal to the transfer\n *    amount\n */\nexport function selectMinCompressedSolAccountsForTransfer(\n    accounts: CompressedAccountWithMerkleContext[],\n    transferLamports: BN | number,\n): [selectedAccounts: CompressedAccountWithMerkleContext[], total: BN] {\n    let accumulatedLamports = bn(0);\n    transferLamports = bn(transferLamports);\n\n    const selectedAccounts: CompressedAccountWithMerkleContext[] = [];\n\n    accounts.sort((a, b) => b.lamports.cmp(a.lamports));\n\n    for (const account of accounts) {\n        if (accumulatedLamports.gte(bn(transferLamports))) break;\n        accumulatedLamports = accumulatedLamports.add(account.lamports);\n        selectedAccounts.push(account);\n    }\n\n    if (accumulatedLamports.lt(bn(transferLamports))) {\n        throw new Error(\n            `Not enough balance for transfer. Required: ${transferLamports.toString()}, available: ${accumulatedLamports.toString()}`,\n        );\n    }\n\n    return [selectedAccounts, accumulatedLamports];\n}\n","import {\n    ComputeBudgetProgram,\n    ConfirmOptions,\n    PublicKey,\n    Signer,\n    TransactionSignature,\n} from '@solana/web3.js';\n\nimport { LightSystemProgram } from '../programs';\nimport { Rpc } from '../rpc';\nimport { buildAndSignTx, sendAndConfirmTx } from '../utils';\nimport BN from 'bn.js';\nimport { defaultTestStateTreeAccounts } from '../constants';\n\n/**\n * Compress lamports to a solana address\n *\n * @param rpc             RPC to use\n * @param payer           Payer of the transaction and initialization fees\n * @param lamports        Amount of lamports to compress\n * @param toAddress       Address of the recipient compressed account\n * @param outputStateTree Optional output state tree. Defaults to a current shared state tree.\n * @param confirmOptions  Options for confirming the transaction\n *\n * @return Transaction signature\n */\n/// TODO: add multisig support\n/// TODO: add support for payer != owner\nexport async function compress(\n    rpc: Rpc,\n    payer: Signer,\n    lamports: number | BN,\n    toAddress: PublicKey,\n    outputStateTree?: PublicKey,\n    confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n    const { blockhash } = await rpc.getLatestBlockhash();\n\n    const ix = await LightSystemProgram.compress({\n        payer: payer.publicKey,\n        toAddress,\n        lamports,\n        outputStateTree,\n    });\n\n    const tx = buildAndSignTx(\n        [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n        payer,\n        blockhash,\n        [],\n    );\n\n    const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n    return txId;\n}\n","import {\n    ComputeBudgetProgram,\n    ConfirmOptions,\n    PublicKey,\n    Signer,\n    TransactionSignature,\n} from '@solana/web3.js';\nimport {\n    LightSystemProgram,\n    selectMinCompressedSolAccountsForTransfer,\n} from '../programs';\nimport { Rpc } from '../rpc';\nimport {\n    NewAddressParams,\n    buildAndSignTx,\n    deriveAddress,\n    deriveAddressSeed,\n    sendAndConfirmTx,\n} from '../utils';\nimport { defaultTestStateTreeAccounts } from '../constants';\nimport { bn } from '../state';\nimport BN from 'bn.js';\n\n/**\n * Create compressed account with address\n *\n * @param rpc               RPC to use\n * @param payer             Payer of the transaction and initialization fees\n * @param seeds             Seeds to derive the new account address\n * @param programId         Owner of the new account\n * @param addressTree       Optional address tree. Defaults to a current shared\n *                          address tree.\n * @param addressQueue      Optional address queue. Defaults to a current shared\n *                          address queue.\n * @param outputStateTree   Optional output state tree. Defaults to a current\n *                          shared state tree.\n * @param confirmOptions    Options for confirming the transaction\n *\n * @return                  Transaction signature\n */\nexport async function createAccount(\n    rpc: Rpc,\n    payer: Signer,\n    seeds: Uint8Array[],\n    programId: PublicKey,\n    addressTree?: PublicKey,\n    addressQueue?: PublicKey,\n    outputStateTree?: PublicKey,\n    confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n    const { blockhash } = await rpc.getLatestBlockhash();\n\n    addressTree = addressTree ?? defaultTestStateTreeAccounts().addressTree;\n    addressQueue = addressQueue ?? defaultTestStateTreeAccounts().addressQueue;\n\n    const seed = deriveAddressSeed(seeds, programId);\n    const address = deriveAddress(seed, addressTree);\n\n    const proof = await rpc.getValidityProofV0(undefined, [\n        {\n            address: bn(address.toBytes()),\n            tree: addressTree,\n            queue: addressQueue,\n        },\n    ]);\n\n    const params: NewAddressParams = {\n        seed: seed,\n        addressMerkleTreeRootIndex: proof.rootIndices[0],\n        addressMerkleTreePubkey: proof.merkleTrees[0],\n        addressQueuePubkey: proof.nullifierQueues[0],\n    };\n\n    const ix = await LightSystemProgram.createAccount({\n        payer: payer.publicKey,\n        newAddressParams: params,\n        newAddress: Array.from(address.toBytes()),\n        recentValidityProof: proof.compressedProof,\n        programId,\n        outputStateTree,\n    });\n\n    const tx = buildAndSignTx(\n        [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n        payer,\n        blockhash,\n        [],\n    );\n\n    const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n    return txId;\n}\n\n/**\n * Create compressed account with address and lamports\n *\n * @param rpc               RPC to use\n * @param payer             Payer of the transaction and initialization fees\n * @param seeds             Seeds to derive the new account address\n * @param lamports          Number of compressed lamports to initialize the\n *                          account with\n * @param programId         Owner of the new account\n * @param addressTree       Optional address tree. Defaults to a current shared\n *                          address tree.\n * @param addressQueue      Optional address queue. Defaults to a current shared\n *                          address queue.\n * @param outputStateTree   Optional output state tree. Defaults to a current\n *                          shared state tree.\n * @param confirmOptions    Options for confirming the transaction\n *\n * @return                  Transaction signature\n */\n// TODO: add support for payer != user owner\nexport async function createAccountWithLamports(\n    rpc: Rpc,\n    payer: Signer,\n    seeds: Uint8Array[],\n    lamports: number | BN,\n    programId: PublicKey,\n    addressTree?: PublicKey,\n    addressQueue?: PublicKey,\n    outputStateTree?: PublicKey,\n    confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n    lamports = bn(lamports);\n\n    const compressedAccounts = await rpc.getCompressedAccountsByOwner(\n        payer.publicKey,\n    );\n\n    const [inputAccounts] = selectMinCompressedSolAccountsForTransfer(\n        compressedAccounts.items,\n        lamports,\n    );\n\n    const { blockhash } = await rpc.getLatestBlockhash();\n\n    addressTree = addressTree ?? defaultTestStateTreeAccounts().addressTree;\n    addressQueue = addressQueue ?? defaultTestStateTreeAccounts().addressQueue;\n\n    const seed = deriveAddressSeed(seeds, programId);\n    const address = deriveAddress(seed, addressTree);\n\n    const proof = await rpc.getValidityProof(\n        inputAccounts.map(account => bn(account.hash)),\n        [bn(address.toBytes())],\n    );\n\n    /// TODO(crank): Adapt before supporting addresses in rpc / cranked address trees.\n    /// Currently expects address roots to be consistent with one another and\n    /// static. See test-rpc.ts for more details.\n    const params: NewAddressParams = {\n        seed: seed,\n        addressMerkleTreeRootIndex:\n            proof.rootIndices[proof.rootIndices.length - 1],\n        addressMerkleTreePubkey:\n            proof.merkleTrees[proof.merkleTrees.length - 1],\n        addressQueuePubkey:\n            proof.nullifierQueues[proof.nullifierQueues.length - 1],\n    };\n\n    const ix = await LightSystemProgram.createAccount({\n        payer: payer.publicKey,\n        newAddressParams: params,\n        newAddress: Array.from(address.toBytes()),\n        recentValidityProof: proof.compressedProof,\n        inputCompressedAccounts: inputAccounts,\n        inputStateRootIndices: proof.rootIndices,\n        programId,\n        outputStateTree,\n    });\n\n    const tx = buildAndSignTx(\n        [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n        payer,\n        blockhash,\n        [],\n    );\n\n    const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n    return txId;\n}\n","import {\n    ComputeBudgetProgram,\n    ConfirmOptions,\n    PublicKey,\n    Signer,\n    TransactionSignature,\n} from '@solana/web3.js';\nimport { LightSystemProgram, sumUpLamports } from '../programs';\nimport { Rpc } from '../rpc';\nimport { buildAndSignTx, sendAndConfirmTx } from '../utils';\nimport BN from 'bn.js';\nimport { CompressedAccountWithMerkleContext, bn } from '../state';\n\n/**\n * Decompress lamports into a solana account\n *\n * @param rpc             RPC to use\n * @param payer           Payer of the transaction and initialization fees\n * @param lamports        Amount of lamports to compress\n * @param toAddress       Address of the recipient compressed account\n * @param outputStateTree Optional output state tree. Defaults to a current shared state tree.\n * @param confirmOptions  Options for confirming the transaction\n *\n * @return Transaction signature\n */\n/// TODO: add multisig support\n/// TODO: add support for payer != owner\nexport async function decompress(\n    rpc: Rpc,\n    payer: Signer,\n    lamports: number | BN,\n    recipient: PublicKey,\n    outputStateTree?: PublicKey,\n    confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n    /// TODO: use dynamic state tree and nullifier queue\n\n    const userCompressedAccountsWithMerkleContext: CompressedAccountWithMerkleContext[] =\n        (await rpc.getCompressedAccountsByOwner(payer.publicKey)).items;\n\n    lamports = bn(lamports);\n\n    const inputLamports = sumUpLamports(\n        userCompressedAccountsWithMerkleContext,\n    );\n\n    if (lamports.gt(inputLamports)) {\n        throw new Error(\n            `Not enough compressed lamports. Expected ${lamports}, got ${inputLamports}`,\n        );\n    }\n\n    const proof = await rpc.getValidityProof(\n        userCompressedAccountsWithMerkleContext.map(x => bn(x.hash)),\n    );\n\n    const { blockhash } = await rpc.getLatestBlockhash();\n    const ix = await LightSystemProgram.decompress({\n        payer: payer.publicKey,\n        toAddress: recipient,\n        outputStateTree: outputStateTree,\n        inputCompressedAccounts: userCompressedAccountsWithMerkleContext,\n        recentValidityProof: proof.compressedProof,\n        recentInputStateRootIndices: proof.rootIndices,\n        lamports,\n    });\n\n    const tx = buildAndSignTx(\n        [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n        payer,\n        blockhash,\n        [],\n    );\n\n    const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n    return txId;\n}\n","import { Signer } from '@solana/web3.js';\n\n/** @internal remove signer from signers if part of signers */\nexport function dedupeSigner(signer: Signer, signers: Signer[]): Signer[] {\n    if (signers.includes(signer)) {\n        return signers.filter(\n            s => s.publicKey.toString() !== signer.publicKey.toString(),\n        );\n    }\n    return signers;\n}\n","import {\n    ComputeBudgetProgram,\n    ConfirmOptions,\n    PublicKey,\n    Signer,\n    TransactionSignature,\n} from '@solana/web3.js';\n\nimport BN from 'bn.js';\nimport {\n    LightSystemProgram,\n    selectMinCompressedSolAccountsForTransfer,\n} from '../programs';\nimport { Rpc } from '../rpc';\n\nimport { bn, CompressedAccountWithMerkleContext } from '../state';\nimport { buildAndSignTx, sendAndConfirmTx } from '../utils';\nimport { GetCompressedAccountsByOwnerConfig } from '../rpc-interface';\n\n/**\n * Transfer compressed lamports from one owner to another\n *\n * @param rpc            Rpc to use\n * @param payer          Payer of transaction fees\n * @param lamports       Number of lamports to transfer\n * @param owner          Owner of the compressed lamports\n * @param toAddress      Destination address of the recipient\n * @param merkleTree     State tree account that the compressed lamports should be\n *                       inserted into. Defaults to the default state tree account.\n * @param confirmOptions Options for confirming the transaction\n * @param config         Configuration for fetching compressed accounts\n *\n *\n * @return Signature of the confirmed transaction\n */\nexport async function transfer(\n    rpc: Rpc,\n    payer: Signer,\n    lamports: number | BN,\n    owner: Signer,\n    toAddress: PublicKey,\n    /// TODO: allow multiple\n    merkleTree?: PublicKey,\n    confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n    let accumulatedLamports = bn(0);\n    const compressedAccounts: CompressedAccountWithMerkleContext[] = [];\n    let cursor: string | undefined;\n    const batchSize = 1000; // Maximum allowed by the API\n    lamports = bn(lamports);\n\n    while (accumulatedLamports.lt(lamports)) {\n        const batchConfig: GetCompressedAccountsByOwnerConfig = {\n            filters: undefined,\n            dataSlice: undefined,\n            cursor,\n            limit: new BN(batchSize),\n        };\n        const batch = await rpc.getCompressedAccountsByOwner(\n            owner.publicKey,\n            batchConfig,\n        );\n\n        for (const account of batch.items) {\n            if (account.lamports.gt(new BN(0))) {\n                compressedAccounts.push(account);\n                accumulatedLamports = accumulatedLamports.add(account.lamports);\n            }\n        }\n\n        cursor = batch.cursor ?? undefined;\n        if (batch.items.length < batchSize || accumulatedLamports.gte(lamports))\n            break;\n    }\n\n    if (accumulatedLamports.lt(lamports)) {\n        throw new Error(\n            `Not enough balance for transfer. Required: ${lamports.toString()}, available: ${accumulatedLamports.toString()}`,\n        );\n    }\n\n    const [inputAccounts] = selectMinCompressedSolAccountsForTransfer(\n        compressedAccounts,\n        lamports,\n    );\n\n    const proof = await rpc.getValidityProof(\n        inputAccounts.map(account => bn(account.hash)),\n    );\n\n    const ix = await LightSystemProgram.transfer({\n        payer: payer.publicKey,\n        inputCompressedAccounts: inputAccounts,\n        toAddress,\n        lamports,\n        recentInputStateRootIndices: proof.rootIndices,\n        recentValidityProof: proof.compressedProof,\n        outputStateTrees: merkleTree,\n    });\n\n    const { blockhash } = await rpc.getLatestBlockhash();\n    const signedTx = buildAndSignTx(\n        [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n        payer,\n        blockhash,\n    );\n    const txId = await sendAndConfirmTx(rpc, signedTx, confirmOptions);\n    return txId;\n}\n","// TODO: Clean up\nexport enum UtxoErrorCode {\n    NEGATIVE_LAMPORTS = 'NEGATIVE_LAMPORTS',\n    NOT_U64 = 'NOT_U64',\n    BLINDING_EXCEEDS_FIELD_SIZE = 'BLINDING_EXCEEDS_FIELD_SIZE',\n}\n\nexport enum SelectInUtxosErrorCode {\n    FAILED_TO_FIND_UTXO_COMBINATION = 'FAILED_TO_FIND_UTXO_COMBINATION',\n    INVALID_NUMBER_OF_IN_UTXOS = 'INVALID_NUMBER_OF_IN_UTXOS',\n}\n\nexport enum CreateUtxoErrorCode {\n    OWNER_UNDEFINED = 'OWNER_UNDEFINED',\n    INVALID_OUTPUT_UTXO_LENGTH = 'INVALID_OUTPUT_UTXO_LENGTH',\n    UTXO_DATA_UNDEFINED = 'UTXO_DATA_UNDEFINED',\n}\n\nexport enum RpcErrorCode {\n    CONNECTION_UNDEFINED = 'CONNECTION_UNDEFINED',\n    RPC_PUBKEY_UNDEFINED = 'RPC_PUBKEY_UNDEFINED',\n    RPC_METHOD_NOT_IMPLEMENTED = 'RPC_METHOD_NOT_IMPLEMENTED',\n    RPC_INVALID = 'RPC_INVALID',\n}\n\nexport enum LookupTableErrorCode {\n    LOOK_UP_TABLE_UNDEFINED = 'LOOK_UP_TABLE_UNDEFINED',\n    LOOK_UP_TABLE_NOT_INITIALIZED = 'LOOK_UP_TABLE_NOT_INITIALIZED',\n}\n\nexport enum HashErrorCode {\n    NO_POSEIDON_HASHER_PROVIDED = 'NO_POSEIDON_HASHER_PROVIDED',\n}\n\nexport enum ProofErrorCode {\n    INVALID_PROOF = 'INVALID_PROOF',\n    PROOF_INPUT_UNDEFINED = 'PROOF_INPUT_UNDEFINED',\n    PROOF_GENERATION_FAILED = 'PROOF_GENERATION_FAILED',\n}\n\nexport enum MerkleTreeErrorCode {\n    MERKLE_TREE_NOT_INITIALIZED = 'MERKLE_TREE_NOT_INITIALIZED',\n    SOL_MERKLE_TREE_UNDEFINED = 'SOL_MERKLE_TREE_UNDEFINED',\n    MERKLE_TREE_UNDEFINED = 'MERKLE_TREE_UNDEFINED',\n    INPUT_UTXO_NOT_INSERTED_IN_MERKLE_TREE = 'INPUT_UTXO_NOT_INSERTED_IN_MERKLE_TREE',\n    MERKLE_TREE_INDEX_UNDEFINED = 'MERKLE_TREE_INDEX_UNDEFINED',\n    MERKLE_TREE_SET_SPACE_UNDEFINED = 'MERKLE_TREE_SET_SPACE_UNDEFINED',\n}\n\nexport enum UtilsErrorCode {\n    ACCOUNT_NAME_UNDEFINED_IN_IDL = 'ACCOUNT_NAME_UNDEFINED_IN_IDL',\n    PROPERTY_UNDEFINED = 'PROPERTY_UNDEFINED',\n    LOOK_UP_TABLE_CREATION_FAILED = 'LOOK_UP_TABLE_CREATION_FAILED',\n    UNSUPPORTED_ARCHITECTURE = 'UNSUPPORTED_ARCHITECTURE',\n    UNSUPPORTED_PLATFORM = 'UNSUPPORTED_PLATFORM',\n    ACCOUNTS_UNDEFINED = 'ACCOUNTS_UNDEFINED',\n    INVALID_NUMBER = 'INVALID_NUMBER',\n}\n\nclass MetaError extends Error {\n    code: string;\n    functionName: string;\n    codeMessage?: string;\n\n    constructor(code: string, functionName: string, codeMessage?: string) {\n        super(`${code}: ${codeMessage}`);\n        this.code = code;\n        this.functionName = functionName;\n        this.codeMessage = codeMessage;\n    }\n}\n\nexport class UtxoError extends MetaError {}\n\nexport class SelectInUtxosError extends MetaError {}\n\nexport class CreateUtxoError extends MetaError {}\n\nexport class RpcError extends MetaError {}\n\nexport class LookupTableError extends MetaError {}\n\nexport class HashError extends MetaError {}\n\nexport class ProofError extends MetaError {}\n\nexport class MerkleTreeError extends MetaError {}\n\nexport class UtilsError extends MetaError {}\n","import {\n    PublicKey,\n    MemcmpFilter,\n    DataSlice,\n    RpcResponseAndContext,\n    Commitment,\n    SignatureResult,\n} from '@solana/web3.js';\nimport {\n    type as pick,\n    number,\n    string,\n    array,\n    literal,\n    union,\n    coerce,\n    instance,\n    create,\n    unknown,\n    any,\n    nullable,\n    Struct,\n} from 'superstruct';\nimport {\n    BN254,\n    createBN254,\n    CompressedProof,\n    CompressedAccountWithMerkleContext,\n    MerkleContextWithMerkleProof,\n    bn,\n    TokenData,\n} from './state';\nimport BN from 'bn.js';\n\nexport class BaseRpc {\n    private async getCancellationPromise() {\n        throw new Error(\n            'getCancellationPromise not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n        );\n    }\n    private async getTransactionConfirmationPromise() {\n        throw new Error(\n            'getTransactionConfirmationPromise not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n        );\n    }\n    private async confirmTransactionUsingBlockHeightExceedanceStrategy() {\n        throw new Error(\n            'confirmTransactionUsingBlockHeightExceedanceStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n        );\n    }\n    private async confirmTransactionUsingDurableNonceStrategy() {\n        throw new Error(\n            'confirmTransactionUsingDurableNonceStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n        );\n    }\n    private async confirmTransactionUsingLegacyTimeoutStrategy({\n        commitment,\n        signature,\n    }: {\n        commitment?: Commitment;\n        signature: string;\n    }): Promise<RpcResponseAndContext<SignatureResult>> {\n        throw new Error(\n            'confirmTransactionUsingLegacyTimeoutStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n        );\n    }\n}\n\nexport interface LatestNonVotingSignatures {\n    context: { slot: number };\n    value: {\n        items: {\n            signature: string;\n            slot: number;\n            blockTime: number;\n            error: string | null;\n        }[];\n    };\n}\n\nexport interface GetCompressedAccountsByOwnerConfig {\n    filters?: GetCompressedAccountsFilter[];\n    dataSlice?: DataSlice;\n    cursor?: string;\n    limit?: BN;\n}\n\nexport interface CompressedMintTokenHolders {\n    balance: BN;\n    owner: PublicKey;\n}\n\nexport interface LatestNonVotingSignaturesPaginated {\n    context: { slot: number };\n    value: {\n        items: {\n            signature: string;\n            slot: number;\n            blockTime: number;\n        }[];\n        cursor: string | null;\n    };\n}\n\nexport interface SignatureWithMetadata {\n    blockTime: number;\n    signature: string;\n    slot: number;\n}\n\nexport interface HashWithTree {\n    hash: BN254;\n    tree: PublicKey;\n    queue: PublicKey;\n}\n\nexport interface AddressWithTree {\n    address: BN254;\n    tree: PublicKey;\n    queue: PublicKey;\n}\n\nexport interface CompressedTransaction {\n    compressionInfo: {\n        closedAccounts: {\n            account: CompressedAccountWithMerkleContext;\n            maybeTokenData: TokenData | null;\n        }[];\n        openedAccounts: {\n            account: CompressedAccountWithMerkleContext;\n            maybeTokenData: TokenData | null;\n        }[];\n        preTokenBalances?: {\n            owner: PublicKey;\n            mint: PublicKey;\n            amount: BN;\n        }[];\n        postTokenBalances?: {\n            owner: PublicKey;\n            mint: PublicKey;\n            amount: BN;\n        }[];\n    };\n    transaction: any;\n}\n\nexport interface HexBatchInputsForProver {\n    'input-compressed-accounts': HexInputsForProver[];\n}\n\nexport interface HexInputsForProver {\n    root: string;\n    pathIndex: number;\n    pathElements: string[];\n    leaf: string;\n}\n\n// TODO: Rename Compressed -> ValidityProof\nexport type CompressedProofWithContext = {\n    compressedProof: CompressedProof;\n    roots: BN[];\n    rootIndices: number[];\n    leafIndices: number[];\n    leaves: BN[];\n    merkleTrees: PublicKey[];\n    nullifierQueues: PublicKey[];\n};\n\nexport interface GetCompressedTokenAccountsByOwnerOrDelegateOptions {\n    mint?: PublicKey;\n    cursor?: string;\n    limit?: BN;\n}\nexport type TokenBalance = { balance: BN; mint: PublicKey };\n\n/**\n * **Cursor** is a unique identifier for a page of results by which the next page can be fetched.\n *\n * **Limit** is the maximum number of results to return per page.\n */\nexport interface PaginatedOptions {\n    cursor?: string;\n    limit?: BN;\n}\n\n/**\n * Note, DataSizeFilter is currently not available.\n */\nexport type GetCompressedAccountsFilter = MemcmpFilter; // | DataSizeFilter;\n\nexport type GetCompressedAccountConfig = {\n    encoding?: string;\n};\n\nexport type GetCompressedAccountsConfig = {\n    dataSlice: DataSlice;\n    filters?: GetCompressedAccountsFilter[];\n};\n\nexport interface ParsedTokenAccount {\n    compressedAccount: CompressedAccountWithMerkleContext;\n    parsed: TokenData;\n}\n\nexport type WithContext<T> = {\n    /** context */\n    context: {\n        slot: number;\n    };\n    /** response value */\n    value: T;\n};\n\nexport type WithCursor<T> = {\n    /** context */\n    cursor: string | null;\n    /** response value */\n    items: T;\n};\n\n/**\n * @internal\n */\nconst PublicKeyFromString = coerce(\n    instance(PublicKey),\n    string(),\n    value => new PublicKey(value),\n);\n\n/**\n * @internal\n */\nconst ArrayFromString = coerce(instance(Array<number>), string(), value =>\n    Array.from(new PublicKey(value).toBytes()),\n);\n\n/**\n * @internal\n */\nconst BN254FromString = coerce(instance(BN), string(), value => {\n    return createBN254(value, 'base58');\n});\n\nconst BNFromInt = coerce(instance(BN), number(), value => {\n    // Check if the number is safe\n    if (Number.isSafeInteger(value)) {\n        return bn(value);\n    } else {\n        // Convert to string if the number is unsafe\n        return bn(value.toString(), 10);\n    }\n});\n\n/**\n * @internal\n */\nconst Base64EncodedCompressedAccountDataResult = coerce(\n    string(),\n    string(),\n    value => (value === '' ? null : value),\n);\n/**\n * @internal\n */\nexport function createRpcResult<T, U>(result: Struct<T, U>) {\n    return union([\n        pick({\n            jsonrpc: literal('2.0'),\n            id: string(),\n            result,\n        }),\n        pick({\n            jsonrpc: literal('2.0'),\n            id: string(),\n            error: pick({\n                code: unknown(),\n                message: string(),\n                data: nullable(any()),\n            }),\n        }),\n    ]) as Struct<RpcResult<T>, null>;\n}\n\n/**\n * @internal\n */\nconst UnknownRpcResult = createRpcResult(unknown());\n\n/**\n * @internal\n */\nexport function jsonRpcResult<T, U>(schema: Struct<T, U>) {\n    return coerce(createRpcResult(schema), UnknownRpcResult, value => {\n        if ('error' in value) {\n            return value as RpcResultError;\n        } else {\n            return {\n                ...value,\n                result: create(value.result, schema),\n            } as RpcResultSuccess<T>;\n        }\n    }) as Struct<RpcResult<T>, null>;\n}\n\n// Add this type for the context wrapper\nexport type WithRpcContext<T> = {\n    context: {\n        slot: number;\n    };\n    value: T;\n};\n\n/**\n * @internal\n */\nexport function jsonRpcResultAndContext<T, U>(value: Struct<T, U>) {\n    return jsonRpcResult(\n        pick({\n            context: pick({\n                slot: number(),\n            }),\n            value,\n        }),\n    ) as Struct<RpcResult<WithRpcContext<T>>, null>;\n}\n\n/**\n * @internal\n */\nexport const CompressedAccountResult = pick({\n    address: nullable(ArrayFromString),\n    hash: BN254FromString,\n    data: nullable(\n        pick({\n            data: Base64EncodedCompressedAccountDataResult,\n            dataHash: BN254FromString,\n            discriminator: BNFromInt,\n        }),\n    ),\n    lamports: BNFromInt,\n    owner: PublicKeyFromString,\n    leafIndex: number(),\n    tree: PublicKeyFromString,\n    seq: nullable(BNFromInt),\n    slotCreated: BNFromInt,\n});\n\nexport const TokenDataResult = pick({\n    mint: PublicKeyFromString,\n    owner: PublicKeyFromString,\n    amount: BNFromInt,\n    delegate: nullable(PublicKeyFromString),\n    state: string(),\n});\n\n/**\n * @internal\n */\nexport const CompressedTokenAccountResult = pick({\n    tokenData: TokenDataResult,\n    account: CompressedAccountResult,\n});\n\n/**\n * @internal\n */\nexport const MultipleCompressedAccountsResult = pick({\n    items: array(CompressedAccountResult),\n});\n\n/**\n * @internal\n */\nexport const CompressedAccountsByOwnerResult = pick({\n    items: array(CompressedAccountResult),\n    cursor: nullable(string()),\n});\n\n/**\n * @internal\n */\nexport const CompressedTokenAccountsByOwnerOrDelegateResult = pick({\n    items: array(CompressedTokenAccountResult),\n    cursor: nullable(string()),\n});\n\n/**\n * @internal\n */\nexport const SlotResult = number();\n\n/**\n * @internal\n */\nexport const HealthResult = string();\n\n/**\n * @internal\n */\nexport const LatestNonVotingSignaturesResult = pick({\n    items: array(\n        pick({\n            signature: string(),\n            slot: number(),\n            blockTime: number(),\n            error: nullable(string()),\n        }),\n    ),\n});\n\n/**\n * @internal\n */\nexport const LatestNonVotingSignaturesResultPaginated = pick({\n    items: array(\n        pick({\n            signature: string(),\n            slot: number(),\n            blockTime: number(),\n        }),\n    ),\n    cursor: nullable(string()),\n});\n\n/**\n * @internal\n */\nexport const MerkeProofResult = pick({\n    hash: BN254FromString,\n    leafIndex: number(),\n    merkleTree: PublicKeyFromString,\n    proof: array(BN254FromString),\n    rootSeq: number(),\n    root: BN254FromString,\n});\n\n/**\n * @internal\n */\nexport const NewAddressProofResult = pick({\n    address: BN254FromString,\n    nextIndex: number(),\n    merkleTree: PublicKeyFromString,\n    proof: array(BN254FromString), // this is: merkleProofHashedIndexedElementLeaf\n    rootSeq: number(),\n    root: BN254FromString,\n    lowerRangeAddress: BN254FromString, // this is: leafLowerRangeValue.\n    higherRangeAddress: BN254FromString, // this is: leafHigherRangeValue\n    lowElementLeafIndex: number(), // this is: indexHashedIndexedElementLeaf\n});\n\n/**\n * @internal\n */\nconst CompressedProofResult = pick({\n    a: array(number()),\n    b: array(number()),\n    c: array(number()),\n});\n\n/**\n * @internal\n */\nexport const ValidityProofResult = pick({\n    compressedProof: CompressedProofResult,\n    leafIndices: array(number()),\n    leaves: array(BN254FromString),\n    rootIndices: array(number()),\n    roots: array(BN254FromString),\n    merkleTrees: array(PublicKeyFromString),\n    // TODO: enable nullifierQueues\n    // nullifierQueues: array(PublicKeyFromString),\n});\n\n/**\n * @internal\n */\nexport const MultipleMerkleProofsResult = array(MerkeProofResult);\n\n/**\n * @internal\n */\nexport const BalanceResult = pick({\n    amount: BNFromInt,\n});\n\nexport const NativeBalanceResult = BNFromInt;\n\nexport const TokenBalanceResult = pick({\n    balance: BNFromInt,\n    mint: PublicKeyFromString,\n});\n\nexport const TokenBalanceListResult = pick({\n    tokenBalances: array(TokenBalanceResult),\n    cursor: nullable(string()),\n});\n\nexport const TokenBalanceListResultV2 = pick({\n    items: array(TokenBalanceResult),\n    cursor: nullable(string()),\n});\n\nexport const CompressedMintTokenHoldersResult = pick({\n    cursor: nullable(string()),\n    items: array(\n        pick({\n            balance: BNFromInt,\n            owner: PublicKeyFromString,\n        }),\n    ),\n});\n\nexport const AccountProofResult = pick({\n    hash: array(number()),\n    root: array(number()),\n    proof: array(array(number())),\n});\n\nexport const toUnixTimestamp = (blockTime: string): number => {\n    return new Date(blockTime).getTime();\n};\n\nexport const SignatureListResult = pick({\n    items: array(\n        pick({\n            blockTime: number(),\n            signature: string(),\n            slot: number(),\n        }),\n    ),\n});\n\nexport const SignatureListWithCursorResult = pick({\n    items: array(\n        pick({\n            blockTime: number(),\n            signature: string(),\n            slot: number(),\n        }),\n    ),\n    cursor: nullable(string()),\n});\n\nexport const CompressedTransactionResult = pick({\n    compressionInfo: pick({\n        closedAccounts: array(\n            pick({\n                account: CompressedAccountResult,\n                optionalTokenData: nullable(TokenDataResult),\n            }),\n        ),\n        openedAccounts: array(\n            pick({\n                account: CompressedAccountResult,\n                optionalTokenData: nullable(TokenDataResult),\n            }),\n        ),\n    }),\n    /// TODO: add transaction struct\n    /// https://github.com/solana-labs/solana/blob/27eff8408b7223bb3c4ab70523f8a8dca3ca6645/transaction-status/src/lib.rs#L1061\n    transaction: any(),\n});\n\nexport interface CompressionApiInterface {\n    getCompressedAccount(\n        address?: BN254,\n        hash?: BN254,\n    ): Promise<CompressedAccountWithMerkleContext | null>;\n\n    getCompressedBalance(address?: BN254, hash?: BN254): Promise<BN | null>;\n\n    getCompressedBalanceByOwner(owner: PublicKey): Promise<BN>;\n\n    getCompressedAccountProof(\n        hash: BN254,\n    ): Promise<MerkleContextWithMerkleProof>;\n\n    getMultipleCompressedAccounts(\n        hashes: BN254[],\n    ): Promise<CompressedAccountWithMerkleContext[]>;\n\n    getMultipleCompressedAccountProofs(\n        hashes: BN254[],\n    ): Promise<MerkleContextWithMerkleProof[]>;\n\n    getValidityProof(\n        hashes: BN254[],\n        newAddresses: BN254[],\n    ): Promise<CompressedProofWithContext>;\n\n    getValidityProofV0(\n        hashes: HashWithTree[],\n        newAddresses: AddressWithTree[],\n    ): Promise<CompressedProofWithContext>;\n\n    getValidityProofAndRpcContext(\n        hashes: HashWithTree[],\n        newAddresses: AddressWithTree[],\n    ): Promise<WithContext<CompressedProofWithContext>>;\n\n    getCompressedAccountsByOwner(\n        owner: PublicKey,\n        config?: GetCompressedAccountsByOwnerConfig,\n    ): Promise<WithCursor<CompressedAccountWithMerkleContext[]>>;\n\n    getCompressedMintTokenHolders(\n        mint: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithContext<WithCursor<CompressedMintTokenHolders[]>>>;\n\n    getCompressedTokenAccountsByOwner(\n        publicKey: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<ParsedTokenAccount[]>>;\n\n    getCompressedTokenAccountsByDelegate(\n        delegate: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<ParsedTokenAccount[]>>;\n\n    getCompressedTokenAccountBalance(hash: BN254): Promise<{ amount: BN }>;\n\n    getCompressedTokenBalancesByOwner(\n        publicKey: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<TokenBalance[]>>;\n\n    getCompressedTokenBalancesByOwnerV2(\n        publicKey: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithContext<WithCursor<TokenBalance[]>>>;\n\n    getTransactionWithCompressionInfo(\n        signature: string,\n    ): Promise<CompressedTransaction | null>;\n\n    getCompressionSignaturesForAccount(\n        hash: BN254,\n    ): Promise<SignatureWithMetadata[]>;\n\n    getCompressionSignaturesForAddress(\n        address: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>>;\n\n    getCompressionSignaturesForOwner(\n        owner: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>>;\n\n    getCompressionSignaturesForTokenOwner(\n        owner: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>>;\n\n    getLatestNonVotingSignatures(\n        limit?: number,\n        cursor?: string,\n    ): Promise<LatestNonVotingSignatures>;\n\n    getLatestCompressionSignatures(\n        cursor?: string,\n        limit?: number,\n    ): Promise<LatestNonVotingSignaturesPaginated>;\n\n    getIndexerHealth(): Promise<string>;\n\n    getIndexerSlot(): Promise<number>;\n}\n\n// Public types for consumers\nexport type RpcResultSuccess<T> = {\n    jsonrpc: '2.0';\n    id: string;\n    result: T;\n};\n\nexport type RpcResultError = {\n    jsonrpc: '2.0';\n    id: string;\n    error: {\n        code: unknown;\n        message: string;\n        data?: any;\n    };\n};\n\nexport type RpcResult<T> = RpcResultSuccess<T> | RpcResultError;\n","import {\n    Connection,\n    ConnectionConfig,\n    Commitment,\n    PublicKey,\n    Transaction,\n    VersionedTransaction,\n    SendOptions,\n    BlockhashWithExpiryBlockHeight,\n    RpcResponseAndContext,\n    GetBalanceConfig,\n    GetSupplyConfig,\n    Supply,\n    GetTokenAccountsByOwnerConfig,\n    GetProgramAccountsResponse,\n    TokenAccountsFilter,\n    AccountInfo,\n    GetMultipleAccountsConfig,\n    StakeActivationData,\n    GetStakeActivationConfig,\n    TransactionConfirmationStrategy,\n    SignatureResult,\n    ContactInfo,\n    VoteAccountStatus,\n    GetSlotConfig,\n    GetSlotLeaderConfig,\n    SignatureStatusConfig,\n    SignatureStatus,\n    GetTransactionCountConfig,\n    InflationGovernor,\n    GetInflationRewardConfig,\n    InflationReward,\n    InflationRate,\n    EpochInfo,\n    GetEpochInfoConfig,\n    EpochSchedule,\n    LeaderSchedule,\n    FeeCalculator,\n    GetRecentPrioritizationFeesConfig,\n    RecentPrioritizationFees,\n    GetLatestBlockhashConfig,\n    Version,\n    TransactionResponse,\n    VersionedTransactionResponse,\n    ParsedTransactionWithMeta,\n    ParsedConfirmedTransaction,\n    SimulateTransactionConfig,\n    SimulatedTransactionResponse,\n    Message,\n    Signer,\n    AccountChangeCallback,\n    AccountSubscriptionConfig,\n    ProgramAccountChangeCallback,\n    ProgramAccountSubscriptionConfig,\n    LogsFilter,\n    LogsCallback,\n    SlotChangeCallback,\n    SlotUpdateCallback,\n    SignatureResultCallback,\n    SignatureSubscriptionCallback,\n    SignatureSubscriptionOptions,\n    RootChangeCallback,\n    ConfirmOptions,\n    GetMultipleAccountsConfig as OriginalGetMultipleAccountsConfig,\n    GetAccountInfoConfig,\n    GetLargestAccountsConfig,\n    TokenAccountBalancePair,\n    AccountBalancePair,\n    ParsedAccountData,\n    SimulateTransactionConfig as OriginalSimulateTransactionConfig,\n    SimulatedTransactionResponse as OriginalSimulatedTransactionResponse,\n    SignatureSubscriptionOptions as OriginalSignatureSubscriptionOptions,\n    Finality,\n    GetTransactionConfig,\n    GetVersionedTransactionConfig,\n    ConfirmedBlock,\n    BlockProduction,\n    TransactionSignature,\n    BlockSignatures,\n    ConfirmedSignatureInfo,\n    AddressLookupTableAccount,\n    GetBlockHeightConfig,\n    GetBlockProductionConfig,\n    ParsedNoneModeBlockResponse,\n    SolanaJSONRPCError,\n    TokenAmount,\n    GetStakeMinimumDelegationConfig,\n    GetNonceAndContextConfig,\n    NonceAccount,\n    GetNonceConfig,\n    GetProgramAccountsConfig,\n    GetParsedProgramAccountsConfig,\n    Blockhash,\n    PerfSample,\n    VersionedMessage,\n    IsBlockhashValidConfig,\n    GetVersionedBlockConfig,\n    VersionedAccountsModeBlockResponse,\n    VersionedBlockResponse,\n    VersionedNoneModeBlockResponse,\n    ParsedAccountsModeBlockResponse,\n    ConfirmedTransaction,\n    ConfirmedSignaturesForAddress2Options,\n    SignaturesForAddressOptions,\n} from '@solana/web3.js';\nimport { Buffer } from 'buffer';\nimport {\n    BalanceResult,\n    CompressedAccountResult,\n    CompressedAccountsByOwnerResult,\n    CompressedProofWithContext,\n    CompressedTokenAccountsByOwnerOrDelegateResult,\n    CompressedTransaction,\n    CompressedTransactionResult,\n    CompressionApiInterface,\n    GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    HealthResult,\n    HexInputsForProver,\n    MerkeProofResult,\n    MultipleCompressedAccountsResult,\n    NativeBalanceResult,\n    ParsedTokenAccount,\n    SignatureListResult,\n    SignatureListWithCursorResult,\n    SignatureWithMetadata,\n    SlotResult,\n    TokenBalanceListResult,\n    jsonRpcResult,\n    jsonRpcResultAndContext,\n    ValidityProofResult,\n    NewAddressProofResult,\n    LatestNonVotingSignaturesResult,\n    LatestNonVotingSignatures,\n    LatestNonVotingSignaturesResultPaginated,\n    LatestNonVotingSignaturesPaginated,\n    WithContext,\n    GetCompressedAccountsByOwnerConfig,\n    WithCursor,\n    AddressWithTree,\n    HashWithTree,\n    CompressedMintTokenHoldersResult,\n    CompressedMintTokenHolders,\n    TokenBalance,\n    TokenBalanceListResultV2,\n    PaginatedOptions,\n    BaseRpc,\n} from './rpc-interface';\nimport {\n    MerkleContextWithMerkleProof,\n    BN254,\n    bn,\n    CompressedAccountWithMerkleContext,\n    encodeBN254toBase58,\n    createCompressedAccountWithMerkleContext,\n    createMerkleContext,\n    TokenData,\n    CompressedProof,\n} from './state';\nimport { array, create, nullable } from 'superstruct';\nimport { defaultTestStateTreeAccounts } from './constants';\nimport BN from 'bn.js';\nimport { toCamelCase, toHex } from './utils/conversion';\n\ntype ClientSubscriptionId = number;\n\n// // Define an interface that includes the methods you need from Connection\n// interface ConnectionInterface {\n//     sendTransaction(transaction: any, options?: any): Promise<any>;\n//     getLatestBlockhash(): Promise<BlockhashWithExpiryBlockHeight>;\n//     confirmTransaction(signature: string, commitment?: string): Promise<any>;\n//     commitment: string;\n//     // Add other methods and properties as needed\n// }\n\nimport {\n    proofFromJsonStruct,\n    negateAndCompressProof,\n} from './utils/parse-validity-proof';\n\n/** @internal */\nexport function parseAccountData({\n    discriminator,\n    data,\n    dataHash,\n}: {\n    discriminator: BN;\n    data: string;\n    dataHash: BN;\n}) {\n    return {\n        discriminator: discriminator.toArray('le', 8),\n        data: Buffer.from(data, 'base64'),\n        dataHash: dataHash.toArray('le', 32),\n    };\n}\n\n/** @internal */\nasync function getCompressedTokenAccountsByOwnerOrDelegate(\n    rpc: Rpc,\n    ownerOrDelegate: PublicKey,\n    options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    filterByDelegate: boolean = false,\n): Promise<WithCursor<ParsedTokenAccount[]>> {\n    const endpoint = filterByDelegate\n        ? 'getCompressedTokenAccountsByDelegate'\n        : 'getCompressedTokenAccountsByOwner';\n    const propertyToCheck = filterByDelegate ? 'delegate' : 'owner';\n\n    const unsafeRes = await rpcRequest(rpc.compressionApiEndpoint, endpoint, {\n        [propertyToCheck]: ownerOrDelegate.toBase58(),\n        mint: options.mint?.toBase58(),\n        limit: options.limit?.toNumber(),\n        cursor: options.cursor,\n    });\n\n    const res = create(\n        unsafeRes,\n        jsonRpcResultAndContext(CompressedTokenAccountsByOwnerOrDelegateResult),\n    );\n    if ('error' in res) {\n        throw new SolanaJSONRPCError(\n            res.error,\n            `failed to get info for compressed accounts by ${propertyToCheck} ${ownerOrDelegate.toBase58()}`,\n        );\n    }\n    if (res.result.value === null) {\n        throw new Error('not implemented: NULL result');\n    }\n    const accounts: ParsedTokenAccount[] = [];\n\n    res.result.value.items.map(item => {\n        const _account = item.account;\n        const _tokenData = item.tokenData;\n\n        const compressedAccount: CompressedAccountWithMerkleContext =\n            createCompressedAccountWithMerkleContext(\n                createMerkleContext(\n                    _account.tree!,\n                    mockNullifierQueue,\n                    _account.hash.toArray('be', 32),\n                    _account.leafIndex,\n                ),\n                _account.owner,\n                bn(_account.lamports),\n                _account.data ? parseAccountData(_account.data) : undefined,\n                _account.address || undefined,\n            );\n\n        const parsed: TokenData = {\n            mint: _tokenData.mint,\n            owner: _tokenData.owner,\n            amount: _tokenData.amount,\n            delegate: _tokenData.delegate,\n            state: ['uninitialized', 'initialized', 'frozen'].indexOf(\n                _tokenData.state,\n            ),\n            tlv: null,\n        };\n\n        if (\n            parsed[propertyToCheck]?.toBase58() !== ownerOrDelegate.toBase58()\n        ) {\n            throw new Error(\n                `RPC returned token account with ${propertyToCheck} different from requested ${propertyToCheck}`,\n            );\n        }\n\n        accounts.push({\n            compressedAccount,\n            parsed,\n        });\n    });\n    /// TODO: consider custom or different sort. Most recent here.\n    return {\n        items: accounts.sort(\n            (a, b) =>\n                b.compressedAccount.leafIndex - a.compressedAccount.leafIndex,\n        ),\n        cursor: res.result.value.cursor,\n    };\n}\n\n/** @internal */\nfunction buildCompressedAccountWithMaybeTokenData(\n    accountStructWithOptionalTokenData: any,\n): {\n    account: CompressedAccountWithMerkleContext;\n    maybeTokenData: TokenData | null;\n} {\n    const compressedAccountResult = accountStructWithOptionalTokenData.account;\n    const tokenDataResult =\n        accountStructWithOptionalTokenData.optionalTokenData;\n\n    const compressedAccount: CompressedAccountWithMerkleContext =\n        createCompressedAccountWithMerkleContext(\n            createMerkleContext(\n                compressedAccountResult.merkleTree,\n                mockNullifierQueue,\n                compressedAccountResult.hash.toArray('be', 32),\n                compressedAccountResult.leafIndex,\n            ),\n            compressedAccountResult.owner,\n            bn(compressedAccountResult.lamports),\n            compressedAccountResult.data\n                ? parseAccountData(compressedAccountResult.data)\n                : undefined,\n            compressedAccountResult.address || undefined,\n        );\n\n    if (tokenDataResult === null) {\n        return { account: compressedAccount, maybeTokenData: null };\n    }\n\n    const parsed: TokenData = {\n        mint: tokenDataResult.mint,\n        owner: tokenDataResult.owner,\n        amount: tokenDataResult.amount,\n        delegate: tokenDataResult.delegate,\n        state: ['uninitialized', 'initialized', 'frozen'].indexOf(\n            tokenDataResult.state,\n        ),\n        tlv: null,\n    };\n\n    return { account: compressedAccount, maybeTokenData: parsed };\n}\n\n/**\n * Establish a Compression-compatible JSON RPC connection\n *\n * @param endpointOrWeb3JsConnection    endpoint to the solana cluster or\n *                                      Connection object\n * @param compressionApiEndpoint        Endpoint to the compression server\n * @param proverEndpoint                Endpoint to the prover server. defaults\n *                                      to endpoint\n * @param connectionConfig              Optional connection config\n */\nexport function createRpc(\n    endpointOrWeb3JsConnection: string | Connection = 'http://127.0.0.1:8899',\n    compressionApiEndpoint: string = 'http://127.0.0.1:8784',\n    proverEndpoint: string = 'http://127.0.0.1:3001',\n    config?: ConnectionConfig,\n): Rpc {\n    const endpoint =\n        typeof endpointOrWeb3JsConnection === 'string'\n            ? endpointOrWeb3JsConnection\n            : endpointOrWeb3JsConnection.rpcEndpoint;\n    return new Rpc(endpoint, compressionApiEndpoint, proverEndpoint, config);\n}\n\n/** @internal */\nexport const rpcRequest = async (\n    rpcEndpoint: string,\n    method: string,\n    params: any = [],\n    convertToCamelCase = true,\n    debug = false,\n): Promise<any> => {\n    const body = JSON.stringify({\n        jsonrpc: '2.0',\n        id: 'test-account',\n        method: method,\n        params: params,\n    });\n\n    if (debug) {\n        const generateCurlSnippet = () => {\n            const escapedBody = body.replace(/\"/g, '\\\\\"');\n            return `curl -X POST ${rpcEndpoint} \\\\\n     -H \"Content-Type: application/json\" \\\\\n     -d \"${escapedBody}\"`;\n        };\n\n        console.log('Debug: Stack trace:');\n        console.log(new Error().stack);\n        console.log('\\nDebug: curl:');\n        console.log(generateCurlSnippet());\n        console.log('\\n');\n    }\n\n    const response = await fetch(rpcEndpoint, {\n        method: 'POST',\n        headers: { 'Content-Type': 'application/json' },\n        body: body,\n    });\n\n    if (!response.ok) {\n        throw new Error(`HTTP error! status: ${response.status}`);\n    }\n\n    if (convertToCamelCase) {\n        const res = await response.json();\n        return toCamelCase(res);\n    }\n    return await response.json();\n};\n\n/** @internal */\nexport const proverRequest = async (\n    proverEndpoint: string,\n    method: 'inclusion' | 'new-address' | 'combined',\n    params: any = [],\n    log = false,\n    publicInputHash: BN | undefined = undefined,\n): Promise<CompressedProof> => {\n    let logMsg: string = '';\n\n    if (log) {\n        logMsg = `Proof generation for method:${method}`;\n        console.time(logMsg);\n    }\n\n    let body;\n    if (method === 'inclusion') {\n        body = JSON.stringify({\n            circuitType: 'inclusion',\n            stateTreeHeight: 26,\n            inputCompressedAccounts: params,\n            // publicInputHash: publicInputHash.toString('hex'),\n        });\n    } else if (method === 'new-address') {\n        body = JSON.stringify({\n            circuitType: 'non-inclusion',\n            addressTreeHeight: 26,\n            // publicInputHash: publicInputHash.toString('hex'),\n            newAddresses: params,\n        });\n    } else if (method === 'combined') {\n        body = JSON.stringify({\n            circuitType: 'combined',\n            // publicInputHash: publicInputHash.toString('hex'),\n            stateTreeHeight: 26,\n            addressTreeHeight: 26,\n            inputCompressedAccounts: params[0],\n            newAddresses: params[1],\n        });\n    }\n\n    const response = await fetch(`${proverEndpoint}/prove`, {\n        method: 'POST',\n        headers: { 'Content-Type': 'application/json' },\n        body: body,\n    });\n\n    if (!response.ok) {\n        throw new Error(`Error fetching proof: ${response.statusText}`);\n    }\n    const data: any = await response.json();\n    const parsed = proofFromJsonStruct(data);\n    const compressedProof = negateAndCompressProof(parsed);\n\n    if (log) console.timeEnd(logMsg);\n\n    return compressedProof;\n};\n\nexport type NonInclusionMerkleProofInputs = {\n    root: BN;\n    value: BN;\n    leaf_lower_range_value: BN;\n    leaf_higher_range_value: BN;\n    nextIndex: BN;\n    merkle_proof_hashed_indexed_element_leaf: BN[];\n    index_hashed_indexed_element_leaf: BN;\n};\n\nexport type MerkleContextWithNewAddressProof = {\n    root: BN;\n    rootIndex: number;\n    value: BN;\n    leafLowerRangeValue: BN;\n    leafHigherRangeValue: BN;\n    nextIndex: BN;\n    merkleProofHashedIndexedElementLeaf: BN[];\n    indexHashedIndexedElementLeaf: BN;\n    merkleTree: PublicKey;\n    nullifierQueue: PublicKey;\n};\n\nexport type NonInclusionJsonStruct = {\n    root: string;\n    value: string;\n    pathIndex: number;\n    pathElements: string[];\n    leafLowerRangeValue: string;\n    leafHigherRangeValue: string;\n    nextIndex: number;\n};\n\nexport function convertMerkleProofsWithContextToHex(\n    merkleProofsWithContext: MerkleContextWithMerkleProof[],\n): HexInputsForProver[] {\n    const inputs: HexInputsForProver[] = [];\n\n    for (let i = 0; i < merkleProofsWithContext.length; i++) {\n        const input: HexInputsForProver = {\n            root: toHex(merkleProofsWithContext[i].root),\n            pathIndex: merkleProofsWithContext[i].leafIndex,\n            pathElements: merkleProofsWithContext[i].merkleProof.map(hex =>\n                toHex(hex),\n            ),\n            leaf: toHex(bn(merkleProofsWithContext[i].hash)),\n        };\n        inputs.push(input);\n    }\n\n    return inputs;\n}\n\nexport function convertNonInclusionMerkleProofInputsToHex(\n    nonInclusionMerkleProofInputs: MerkleContextWithNewAddressProof[],\n): NonInclusionJsonStruct[] {\n    const inputs: NonInclusionJsonStruct[] = [];\n    for (let i = 0; i < nonInclusionMerkleProofInputs.length; i++) {\n        const input: NonInclusionJsonStruct = {\n            root: toHex(nonInclusionMerkleProofInputs[i].root),\n            value: toHex(nonInclusionMerkleProofInputs[i].value),\n            pathIndex:\n                nonInclusionMerkleProofInputs[\n                    i\n                ].indexHashedIndexedElementLeaf.toNumber(),\n            pathElements: nonInclusionMerkleProofInputs[\n                i\n            ].merkleProofHashedIndexedElementLeaf.map(hex => toHex(hex)),\n            nextIndex: nonInclusionMerkleProofInputs[i].nextIndex.toNumber(),\n            leafLowerRangeValue: toHex(\n                nonInclusionMerkleProofInputs[i].leafLowerRangeValue,\n            ),\n            leafHigherRangeValue: toHex(\n                nonInclusionMerkleProofInputs[i].leafHigherRangeValue,\n            ),\n        };\n        inputs.push(input);\n    }\n    return inputs;\n}\nimport { LightWasm } from './test-helpers';\nimport { ConnectionInterface } from './connection-interface';\n\nfunction calculateTwoInputsHashChain(\n    hashesFirst: BN[],\n    hashesSecond: BN[],\n    lightWasm: LightWasm,\n): BN {\n    if (hashesFirst.length !== hashesSecond.length) {\n        throw new Error('Input lengths must match.');\n    }\n    if (hashesFirst.length === 0) {\n        return new BN(0);\n    }\n\n    let hashChain = lightWasm.poseidonHashBN([\n        hashesFirst[0].toString(),\n        hashesSecond[0].toString(),\n    ]);\n\n    for (let i = 1; i < hashesFirst.length; i++) {\n        hashChain = lightWasm.poseidonHashBN([\n            hashChain.toString(),\n            hashesFirst[i].toString(),\n            hashesSecond[i].toString(),\n        ]);\n    }\n\n    return hashChain;\n}\n\nexport function getPublicInputHash(\n    accountProofs: MerkleContextWithMerkleProof[],\n    accountHashes: BN254[],\n    newAddressProofs: MerkleContextWithNewAddressProof[],\n    lightWasm: LightWasm,\n): BN {\n    const accountRoots = accountProofs.map(x => x.root);\n    const inclusionHashChain = calculateTwoInputsHashChain(\n        accountRoots,\n        accountHashes,\n        lightWasm,\n    );\n\n    const newAddressHashes = newAddressProofs.map(x => x.value);\n    const newAddressRoots = newAddressProofs.map(x => x.root);\n    const nonInclusionHashChain = calculateTwoInputsHashChain(\n        newAddressRoots,\n        newAddressHashes,\n        lightWasm,\n    );\n\n    if (!nonInclusionHashChain.isZero()) {\n        return nonInclusionHashChain;\n    } else if (!inclusionHashChain.isZero()) {\n        return inclusionHashChain;\n    } else {\n        return calculateTwoInputsHashChain(\n            [inclusionHashChain],\n            [nonInclusionHashChain],\n            lightWasm,\n        );\n    }\n}\n\n/// TODO: replace with dynamic nullifierQueue\nconst mockNullifierQueue = defaultTestStateTreeAccounts().nullifierQueue;\nconst mockAddressQueue = defaultTestStateTreeAccounts().addressQueue;\n\n/**\n *\n */\nexport class Rpc\n    extends Connection\n    implements ConnectionInterface, CompressionApiInterface\n{\n    connection: Connection;\n    compressionApiEndpoint: string;\n    proverEndpoint: string;\n\n    /**\n     * Establish a Compression-compatible JSON RPC connection\n     *\n     * @param endpoint                      Endpoint to the solana cluster\n     * @param compressionApiEndpoint        Endpoint to the compression server\n     * @param proverEndpoint                Endpoint to the prover server.\n     * @param connectionConfig              Optional connection config\n     */\n    constructor(\n        endpoint: string,\n        compressionApiEndpoint: string,\n        proverEndpoint: string,\n        config?: ConnectionConfig,\n    ) {\n        super(endpoint, config || 'confirmed');\n        // super();\n        this.connection = new Connection(endpoint, config || 'confirmed');\n        this.compressionApiEndpoint = compressionApiEndpoint;\n        this.proverEndpoint = proverEndpoint;\n    }\n\n    get commitment(): Commitment | undefined {\n        return this.connection.commitment;\n    }\n\n    get rpcEndpoint(): string {\n        return this.connection.rpcEndpoint;\n    }\n\n    // === Connection Methods Delegated ===\n\n    async getBalanceAndContext(\n        publicKey: PublicKey,\n        commitmentOrConfig?: Commitment | GetBalanceConfig,\n    ): Promise<RpcResponseAndContext<number>> {\n        return this.connection.getBalanceAndContext(\n            publicKey,\n            commitmentOrConfig,\n        );\n    }\n\n    async getBalance(\n        publicKey: PublicKey,\n        commitmentOrConfig?: Commitment | GetBalanceConfig,\n    ): Promise<number> {\n        return this.connection.getBalance(publicKey, commitmentOrConfig);\n    }\n\n    async getBlockTime(slot: number): Promise<number | null> {\n        return this.connection.getBlockTime(slot);\n    }\n\n    async getMinimumLedgerSlot(): Promise<number> {\n        return this.connection.getMinimumLedgerSlot();\n    }\n\n    async getFirstAvailableBlock(): Promise<number> {\n        return this.connection.getFirstAvailableBlock();\n    }\n\n    async getSupply(\n        config?: GetSupplyConfig | Commitment,\n    ): Promise<RpcResponseAndContext<Supply>> {\n        return this.connection.getSupply(config);\n    }\n\n    async getTokenSupply(\n        tokenMintAddress: PublicKey,\n        commitment?: Commitment,\n    ): Promise<RpcResponseAndContext<TokenAmount>> {\n        return this.connection.getTokenSupply(tokenMintAddress, commitment);\n    }\n\n    async getTokenAccountBalance(\n        tokenAddress: PublicKey,\n        commitment?: Commitment,\n    ): Promise<RpcResponseAndContext<TokenAmount>> {\n        return this.connection.getTokenAccountBalance(tokenAddress, commitment);\n    }\n\n    async getTokenAccountsByOwner(\n        ownerAddress: PublicKey,\n        filter: TokenAccountsFilter,\n        commitmentOrConfig?: Commitment | GetTokenAccountsByOwnerConfig,\n    ): Promise<RpcResponseAndContext<GetProgramAccountsResponse>> {\n        return this.connection.getTokenAccountsByOwner(\n            ownerAddress,\n            filter,\n            commitmentOrConfig,\n        );\n    }\n\n    async getParsedTokenAccountsByOwner(\n        ownerAddress: PublicKey,\n        filter: TokenAccountsFilter,\n        commitment?: Commitment,\n    ): Promise<\n        RpcResponseAndContext<\n            Array<{\n                pubkey: PublicKey;\n                account: AccountInfo<ParsedAccountData>;\n            }>\n        >\n    > {\n        return this.connection.getParsedTokenAccountsByOwner(\n            ownerAddress,\n            filter,\n            commitment,\n        );\n    }\n\n    async getLargestAccounts(\n        config?: GetLargestAccountsConfig,\n    ): Promise<RpcResponseAndContext<Array<AccountBalancePair>>> {\n        return this.connection.getLargestAccounts(config);\n    }\n\n    async getTokenLargestAccounts(\n        mintAddress: PublicKey,\n        commitment?: Commitment,\n    ): Promise<RpcResponseAndContext<Array<TokenAccountBalancePair>>> {\n        return this.connection.getTokenLargestAccounts(mintAddress, commitment);\n    }\n\n    async getAccountInfoAndContext(\n        publicKey: PublicKey,\n        commitmentOrConfig?: Commitment | GetAccountInfoConfig,\n    ): Promise<RpcResponseAndContext<AccountInfo<Buffer> | null>> {\n        return this.connection.getAccountInfoAndContext(\n            publicKey,\n            commitmentOrConfig,\n        );\n    }\n\n    async getParsedAccountInfo(\n        publicKey: PublicKey,\n        commitmentOrConfig?: Commitment | GetAccountInfoConfig,\n    ): Promise<\n        RpcResponseAndContext<AccountInfo<Buffer | ParsedAccountData> | null>\n    > {\n        return this.connection.getParsedAccountInfo(\n            publicKey,\n            commitmentOrConfig,\n        );\n    }\n\n    async getAccountInfo(\n        publicKey: PublicKey,\n        commitmentOrConfig?: Commitment | GetAccountInfoConfig,\n    ): Promise<AccountInfo<Buffer> | null> {\n        return this.connection.getAccountInfo(publicKey, commitmentOrConfig);\n    }\n\n    async getMultipleParsedAccounts(\n        publicKeys: PublicKey[],\n        rawConfig?: GetMultipleAccountsConfig,\n    ): Promise<\n        RpcResponseAndContext<\n            (AccountInfo<Buffer | ParsedAccountData> | null)[]\n        >\n    > {\n        return this.connection.getMultipleParsedAccounts(publicKeys, rawConfig);\n    }\n\n    async getMultipleAccountsInfoAndContext(\n        publicKeys: PublicKey[],\n        commitmentOrConfig?: Commitment | GetMultipleAccountsConfig,\n    ): Promise<RpcResponseAndContext<(AccountInfo<Buffer> | null)[]>> {\n        return this.connection.getMultipleAccountsInfoAndContext(\n            publicKeys,\n            commitmentOrConfig,\n        );\n    }\n\n    async getMultipleAccountsInfo(\n        publicKeys: PublicKey[],\n        commitmentOrConfig?: Commitment | GetMultipleAccountsConfig,\n    ): Promise<(AccountInfo<Buffer> | null)[]> {\n        return this.connection.getMultipleAccountsInfo(\n            publicKeys,\n            commitmentOrConfig,\n        );\n    }\n\n    async getStakeActivation(\n        publicKey: PublicKey,\n        commitmentOrConfig?: Commitment | GetStakeActivationConfig,\n        epoch?: number,\n    ): Promise<StakeActivationData> {\n        return this.connection.getStakeActivation(\n            publicKey,\n            commitmentOrConfig,\n            epoch,\n        );\n    }\n\n    async getProgramAccounts(\n        programId: PublicKey,\n        configOrCommitment?: GetProgramAccountsConfig | Commitment,\n    ): Promise<GetProgramAccountsResponse>;\n\n    async getProgramAccounts(\n        programId: PublicKey,\n        configOrCommitment: GetProgramAccountsConfig & { withContext: true },\n    ): Promise<RpcResponseAndContext<GetProgramAccountsResponse>>;\n\n    async getProgramAccounts(\n        programId: PublicKey,\n        configOrCommitment?: GetProgramAccountsConfig | Commitment,\n    ): Promise<\n        | GetProgramAccountsResponse\n        | RpcResponseAndContext<GetProgramAccountsResponse>\n    > {\n        return this.connection.getProgramAccounts(\n            programId,\n            configOrCommitment,\n        );\n    }\n\n    async getParsedProgramAccounts(\n        programId: PublicKey,\n        configOrCommitment?: GetParsedProgramAccountsConfig | Commitment,\n    ): Promise<\n        Array<{\n            pubkey: PublicKey;\n            account: AccountInfo<Buffer | ParsedAccountData>;\n        }>\n    > {\n        return this.connection.getParsedProgramAccounts(\n            programId,\n            configOrCommitment,\n        );\n    }\n\n    // === Subscription Methods ===\n\n    // onAccountChange(\n    //     publicKey: PublicKey,\n    //     callback: AccountChangeCallback,\n    //     config?: AccountSubscriptionConfig,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onAccountChange(publicKey, callback, config);\n    // }\n\n    // async removeAccountChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeAccountChangeListener(\n    //         clientSubscriptionId,\n    //     );\n    // }\n\n    // onProgramAccountChange(\n    //     programId: PublicKey,\n    //     callback: ProgramAccountChangeCallback,\n    //     config?: ProgramAccountSubscriptionConfig,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onProgramAccountChange(\n    //         programId,\n    //         callback,\n    //         config,\n    //     );\n    // }\n\n    // async removeProgramAccountChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeProgramAccountChangeListener(\n    //         clientSubscriptionId,\n    //     );\n    // }\n\n    // onLogs(\n    //     filter: LogsFilter,\n    //     callback: LogsCallback,\n    //     commitment?: Commitment,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onLogs(filter, callback, commitment);\n    // }\n\n    // async removeOnLogsListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeOnLogsListener(clientSubscriptionId);\n    // }\n\n    // onSlotChange(callback: SlotChangeCallback): ClientSubscriptionId {\n    //     return this.connection.onSlotChange(callback);\n    // }\n\n    // async removeSlotChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeSlotChangeListener(clientSubscriptionId);\n    // }\n\n    // onSlotUpdate(callback: SlotUpdateCallback): ClientSubscriptionId {\n    //     return this.connection.onSlotUpdate(callback);\n    // }\n\n    // async removeSlotUpdateListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeSlotUpdateListener(clientSubscriptionId);\n    // }\n\n    // onSignature(\n    //     signature: TransactionSignature,\n    //     callback: SignatureResultCallback,\n    //     commitment?: Commitment,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onSignature(signature, callback, commitment);\n    // }\n\n    // onSignatureWithOptions(\n    //     signature: TransactionSignature,\n    //     callback: SignatureSubscriptionCallback,\n    //     options?: SignatureSubscriptionOptions,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onSignatureWithOptions(\n    //         signature,\n    //         callback,\n    //         options,\n    //     );\n    // }\n\n    // async removeSignatureListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeSignatureListener(clientSubscriptionId);\n    // }\n\n    // onRootChange(callback: RootChangeCallback): ClientSubscriptionId {\n    //     return this.connection.onRootChange(callback);\n    // }\n\n    // async removeRootChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeRootChangeListener(clientSubscriptionId);\n    // }\n\n    // // === Transaction Methods ===\n\n    // async sendTransaction(\n    //     transaction: VersionedTransaction,\n    //     options?: SendOptions,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.sendTransaction(transaction, options);\n    // }\n\n    // async sendRawTransaction(\n    //     rawTransaction: Buffer | Uint8Array | Array<number>,\n    //     options?: SendOptions,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.sendRawTransaction(rawTransaction, options);\n    // }\n\n    // async sendEncodedTransaction(\n    //     encodedTransaction: string,\n    //     options?: SendOptions,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.sendEncodedTransaction(\n    //         encodedTransaction,\n    //         options,\n    //     );\n    // }\n\n    // async simulateTransaction(\n    //     transaction: VersionedTransaction,\n    //     config?: SimulateTransactionConfig,\n    // ): Promise<RpcResponseAndContext<SimulatedTransactionResponse>> {\n    //     return this.connection.simulateTransaction(transaction, config);\n    // }\n\n    // async requestAirdrop(\n    //     to: PublicKey,\n    //     lamports: number,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.requestAirdrop(to, lamports);\n    // }\n\n    // async getStakeMinimumDelegation(\n    //     config?: GetStakeMinimumDelegationConfig,\n    // ): Promise<RpcResponseAndContext<number>> {\n    //     return this.connection.getStakeMinimumDelegation(config);\n    // }\n\n    // async getTransactions(\n    //     signatures: TransactionSignature[],\n    //     commitmentOrConfig?: GetTransactionConfig | Finality,\n    // ): Promise<(VersionedTransactionResponse | null)[]> {\n    //     return this.connection.getTransactions(signatures, commitmentOrConfig);\n    // }\n\n    // async getTransaction(\n    //     signature: string,\n    //     rawConfig?: GetTransactionConfig,\n    // ): Promise<VersionedTransactionResponse | null> {\n    //     return this.connection.getTransaction(signature, rawConfig);\n    // }\n\n    // async getParsedTransaction(\n    //     signature: TransactionSignature,\n    //     commitmentOrConfig?: GetVersionedTransactionConfig | Finality,\n    // ): Promise<ParsedTransactionWithMeta | null> {\n    //     return this.connection.getParsedTransaction(\n    //         signature,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getParsedTransactions(\n    //     signatures: TransactionSignature[],\n    //     commitmentOrConfig?: GetVersionedTransactionConfig | Finality,\n    // ): Promise<(ParsedTransactionWithMeta | null)[]> {\n    //     return this.connection.getParsedTransactions(\n    //         signatures,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getConfirmedBlock(\n    //     slot: number,\n    //     commitment?: Finality,\n    // ): Promise<ConfirmedBlock> {\n    //     return this.connection.getConfirmedBlock(slot, commitment);\n    // }\n\n    // async getBlocks(\n    //     startSlot: number,\n    //     endSlot?: number,\n    //     commitment?: Finality,\n    // ): Promise<Array<number>> {\n    //     return this.connection.getBlocks(startSlot, endSlot, commitment);\n    // }\n\n    // async getBlockSignatures(\n    //     slot: number,\n    //     commitment?: Finality,\n    // ): Promise<BlockSignatures> {\n    //     return this.connection.getBlockSignatures(slot, commitment);\n    // }\n\n    // async getConfirmedBlockSignatures(\n    //     slot: number,\n    //     commitment?: Finality,\n    // ): Promise<BlockSignatures> {\n    //     return this.connection.getConfirmedBlockSignatures(slot, commitment);\n    // }\n\n    // confirmTransaction(\n    //     strategy: TransactionConfirmationStrategy,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<SignatureResult>>;\n\n    // /** @deprecated Instead, call `confirmTransaction` and pass in {@link TransactionConfirmationStrategy} */\n    // // eslint-disable-next-line no-dupe-class-members\n    // confirmTransaction(\n    //     strategy: TransactionSignature,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<SignatureResult>>;\n\n    // async confirmTransaction(\n    //     strategy: TransactionConfirmationStrategy | TransactionSignature,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<SignatureResult>> {\n    //     // @ts-ignore\n    //     return this.connection.confirmTransaction(strategy, commitment);\n    // }\n\n    // // private async getCancellationPromise() {\n    // //     throw new Error(\n    // //         'getCancellationPromise not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    // //     );\n    // // }\n    // // private async getTransactionConfirmationPromise() {\n    // //     throw new Error(\n    // //         'getTransactionConfirmationPromise not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    // //     );\n    // // }\n    // // private async confirmTransactionUsingBlockHeightExceedanceStrategy() {\n    // //     throw new Error(\n    // //         'confirmTransactionUsingBlockHeightExceedanceStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    // //     );\n    // // }\n    // // async confirmTransactionUsingDurableNonceStrategy() {\n    // //     throw new Error(\n    // //         'confirmTransactionUsingDurableNonceStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    // //     );\n    // // }\n    // // private async confirmTransactionUsingLegacyTimeoutStrategy({\n    // //     commitment,\n    // //     signature,\n    // // }: {\n    // //     commitment?: Commitment;\n    // //     signature: string;\n    // // }): Promise<RpcResponseAndContext<SignatureResult>> {\n    // //     throw new Error(\n    // //         'confirmTransactionUsingLegacyTimeoutStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    // //     );\n    // // }\n    // // _buildArgs(\n    // //     args: Array<any>,\n    // //     override?: Commitment,\n    // //     encoding?: 'jsonParsed' | 'base64',\n    // //     extra?: any,\n    // // ): Array<any> {\n    // //     const commitment = override || this.connection.commitment;\n    // //     if (commitment || encoding || extra) {\n    // //         let options: any = {};\n    // //         if (encoding) {\n    // //             options.encoding = encoding;\n    // //         }\n    // //         if (commitment) {\n    // //             options.commitment = commitment;\n    // //         }\n    // //         if (extra) {\n    // //             options = Object.assign(options, extra);\n    // //         }\n    // //         args.push(options);\n    // //     }\n    // //     return args;\n    // // }\n\n    // async getClusterNodes(): Promise<Array<ContactInfo>> {\n    //     return this.connection.getClusterNodes();\n    // }\n\n    // async getVoteAccounts(commitment?: Commitment): Promise<VoteAccountStatus> {\n    //     return this.connection.getVoteAccounts(commitment);\n    // }\n\n    // async getSlot(\n    //     commitmentOrConfig?: Commitment | GetSlotConfig,\n    // ): Promise<number> {\n    //     return this.connection.getSlot(commitmentOrConfig);\n    // }\n\n    // async getSlotLeader(\n    //     commitmentOrConfig?: Commitment | GetSlotLeaderConfig,\n    // ): Promise<string> {\n    //     return this.connection.getSlotLeader(commitmentOrConfig);\n    // }\n\n    // async getSlotLeaders(\n    //     startSlot: number,\n    //     limit: number,\n    // ): Promise<Array<PublicKey>> {\n    //     return this.connection.getSlotLeaders(startSlot, limit);\n    // }\n\n    // async getSignatureStatus(\n    //     signature: TransactionSignature,\n    //     config?: SignatureStatusConfig,\n    // ): Promise<RpcResponseAndContext<SignatureStatus | null>> {\n    //     return this.connection.getSignatureStatus(signature, config);\n    // }\n\n    // async getSignatureStatuses(\n    //     signatures: Array<TransactionSignature>,\n    //     config?: SignatureStatusConfig,\n    // ): Promise<RpcResponseAndContext<Array<SignatureStatus | null>>> {\n    //     return this.connection.getSignatureStatuses(signatures, config);\n    // }\n\n    // async getTotalSupply(commitment?: Commitment): Promise<number> {\n    //     return this.connection.getTotalSupply(commitment);\n    // }\n\n    // async getBlockHeight(config?: GetBlockHeightConfig): Promise<number> {\n    //     return this.connection.getBlockHeight(config);\n    // }\n\n    // async getBlockProduction(\n    //     configOrCommitment?: GetBlockProductionConfig | Commitment,\n    // ): Promise<RpcResponseAndContext<BlockProduction>> {\n    //     return this.connection.getBlockProduction(configOrCommitment);\n    // }\n\n    // async getTransactionCount(\n    //     config?: GetTransactionCountConfig,\n    // ): Promise<number> {\n    //     return this.connection.getTransactionCount(config);\n    // }\n\n    // async getInflationGovernor(): Promise<InflationGovernor> {\n    //     return this.connection.getInflationGovernor();\n    // }\n\n    // async getInflationReward(\n    //     addresses: PublicKey[],\n    //     epochs?: number,\n    //     config?: GetInflationRewardConfig,\n    // ): Promise<Array<InflationReward | null>> {\n    //     return this.connection.getInflationReward(addresses, epochs, config);\n    // }\n\n    // async getInflationRate(): Promise<InflationRate> {\n    //     return this.connection.getInflationRate();\n    // }\n\n    // async getEpochInfo(config?: GetEpochInfoConfig): Promise<EpochInfo> {\n    //     return this.connection.getEpochInfo(config);\n    // }\n\n    // async getEpochSchedule(): Promise<EpochSchedule> {\n    //     return this.connection.getEpochSchedule();\n    // }\n\n    // async getLeaderSchedule(): Promise<LeaderSchedule> {\n    //     return this.connection.getLeaderSchedule();\n    // }\n\n    // async getRecentBlockhashAndContext(commitment?: Commitment): Promise<\n    //     RpcResponseAndContext<{\n    //         blockhash: Blockhash;\n    //         feeCalculator: FeeCalculator;\n    //     }>\n    // > {\n    //     return this.connection.getRecentBlockhashAndContext(commitment);\n    // }\n\n    // async getRecentPerformanceSamples(\n    //     limit?: number,\n    // ): Promise<Array<PerfSample>> {\n    //     return this.connection.getRecentPerformanceSamples(limit);\n    // }\n\n    // async getFeeCalculatorForBlockhash(\n    //     blockhash: Blockhash,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<FeeCalculator | null>> {\n    //     return this.connection.getFeeCalculatorForBlockhash(\n    //         blockhash,\n    //         commitment,\n    //     );\n    // }\n\n    // async getFeeForMessage(\n    //     message: VersionedMessage,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<number | null>> {\n    //     return this.connection.getFeeForMessage(message, commitment);\n    // }\n\n    // async getMinimumBalanceForRentExemption(\n    //     dataLength: number,\n    //     commitment?: Commitment,\n    // ): Promise<number> {\n    //     return this.connection.getMinimumBalanceForRentExemption(\n    //         dataLength,\n    //         commitment,\n    //     );\n    // }\n\n    // async getRecentBlockhash(\n    //     commitment?: Commitment,\n    // ): Promise<{ blockhash: Blockhash; feeCalculator: FeeCalculator }> {\n    //     return this.connection.getRecentBlockhash(commitment);\n    // }\n\n    // async getGenesisHash(): Promise<string> {\n    //     return this.connection.getGenesisHash();\n    // }\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig?: GetVersionedBlockConfig,\n    // ): Promise<VersionedBlockResponse | null>;\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig: GetVersionedBlockConfig & { transactionDetails: 'accounts' },\n    // ): Promise<VersionedAccountsModeBlockResponse | null>;\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig: GetVersionedBlockConfig & { transactionDetails: 'none' },\n    // ): Promise<VersionedNoneModeBlockResponse | null>;\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig?: GetVersionedBlockConfig,\n    // ): Promise<\n    //     | VersionedBlockResponse\n    //     | VersionedAccountsModeBlockResponse\n    //     | VersionedNoneModeBlockResponse\n    //     | null\n    // > {\n    //     return this.connection.getBlock(slot, rawConfig);\n    // }\n\n    async getParsedBlock(\n        slot: number,\n        rawConfig?: GetVersionedBlockConfig,\n    ): Promise<ParsedAccountsModeBlockResponse>;\n    async getParsedBlock(\n        slot: number,\n        rawConfig: GetVersionedBlockConfig & { transactionDetails: 'accounts' },\n    ): Promise<ParsedAccountsModeBlockResponse>;\n    async getParsedBlock(\n        slot: number,\n        rawConfig: GetVersionedBlockConfig & { transactionDetails: 'none' },\n    ): Promise<ParsedNoneModeBlockResponse>;\n    async getParsedBlock(\n        slot: number,\n        rawConfig?: GetVersionedBlockConfig,\n    ): Promise<\n        ParsedAccountsModeBlockResponse | ParsedNoneModeBlockResponse | null\n    > {\n        return this.connection.getParsedBlock(slot, rawConfig);\n    }\n\n    async getConfirmedTransaction(\n        signature: TransactionSignature,\n        commitment?: Finality,\n    ): Promise<ConfirmedTransaction | null> {\n        return this.connection.getConfirmedTransaction(signature, commitment);\n    }\n\n    async getParsedConfirmedTransaction(\n        signature: TransactionSignature,\n        commitment?: Finality,\n    ): Promise<ParsedConfirmedTransaction | null> {\n        return this.connection.getParsedConfirmedTransaction(\n            signature,\n            commitment,\n        );\n    }\n\n    async getParsedConfirmedTransactions(\n        signatures: TransactionSignature[],\n        commitment?: Finality,\n    ): Promise<(ParsedConfirmedTransaction | null)[]> {\n        return this.connection.getParsedConfirmedTransactions(\n            signatures,\n            commitment,\n        );\n    }\n\n    async getConfirmedSignaturesForAddress(\n        address: PublicKey,\n        startSlot: number,\n        endSlot: number,\n    ): Promise<Array<TransactionSignature>> {\n        return this.connection.getConfirmedSignaturesForAddress(\n            address,\n            startSlot,\n            endSlot,\n        );\n    }\n\n    async getConfirmedSignaturesForAddress2(\n        address: PublicKey,\n        options?: ConfirmedSignaturesForAddress2Options,\n        commitment?: Finality,\n    ): Promise<Array<ConfirmedSignatureInfo>> {\n        return this.connection.getConfirmedSignaturesForAddress2(\n            address,\n            options,\n            commitment,\n        );\n    }\n\n    async getSignaturesForAddress(\n        address: PublicKey,\n        options?: SignaturesForAddressOptions,\n        commitment?: Finality,\n    ): Promise<Array<ConfirmedSignatureInfo>> {\n        return this.connection.getSignaturesForAddress(\n            address,\n            options,\n            commitment,\n        );\n    }\n\n    async getRecentPrioritizationFees(\n        config?: GetRecentPrioritizationFeesConfig,\n    ): Promise<RecentPrioritizationFees[]> {\n        return this.connection.getRecentPrioritizationFees(config);\n    }\n\n    async getLatestBlockhash(\n        config?: GetLatestBlockhashConfig,\n    ): Promise<BlockhashWithExpiryBlockHeight> {\n        return this.connection.getLatestBlockhash(config);\n    }\n    async getLatestBlockhashAndContext(\n        commitmentOrConfig?: Commitment | GetLatestBlockhashConfig,\n    ): Promise<RpcResponseAndContext<BlockhashWithExpiryBlockHeight>> {\n        return this.connection.getLatestBlockhashAndContext(commitmentOrConfig);\n    }\n\n    async isBlockhashValid(\n        blockhash: Blockhash,\n        config?: IsBlockhashValidConfig,\n    ): Promise<RpcResponseAndContext<boolean>> {\n        return this.connection.isBlockhashValid(blockhash, config);\n    }\n\n    async getVersion(): Promise<Version> {\n        return this.connection.getVersion();\n    }\n\n    async getAddressLookupTable(\n        accountKey: PublicKey,\n        config?: GetAccountInfoConfig,\n    ): Promise<RpcResponseAndContext<AddressLookupTableAccount | null>> {\n        return this.connection.getAddressLookupTable(accountKey, config);\n    }\n\n    async getNonceAndContext(\n        nonceAccount: PublicKey,\n        commitmentOrConfig?: Commitment | GetNonceAndContextConfig,\n    ): Promise<RpcResponseAndContext<NonceAccount | null>> {\n        return this.connection.getNonceAndContext(\n            nonceAccount,\n            commitmentOrConfig,\n        );\n    }\n\n    async getNonce(\n        nonceAccount: PublicKey,\n        commitmentOrConfig?: Commitment | GetNonceConfig,\n    ): Promise<NonceAccount | null> {\n        return this.connection.getNonce(nonceAccount, commitmentOrConfig);\n    }\n\n    /**\n     * Fetch the compressed account for the specified account address or hash\n     */\n    async getCompressedAccount(\n        address?: BN254,\n        hash?: BN254,\n    ): Promise<CompressedAccountWithMerkleContext | null> {\n        if (!hash && !address) {\n            throw new Error('Either hash or address must be provided');\n        }\n        if (hash && address) {\n            throw new Error('Only one of hash or address must be provided');\n        }\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedAccount',\n            {\n                hash: hash ? encodeBN254toBase58(hash) : undefined,\n                address: address ? encodeBN254toBase58(address) : undefined,\n            },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(nullable(CompressedAccountResult)),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get info for compressed account ${hash ? hash.toString() : address ? address.toString() : ''}`,\n            );\n        }\n        if (res.result.value === null) {\n            return null;\n        }\n        const item = res.result.value;\n        const account = createCompressedAccountWithMerkleContext(\n            createMerkleContext(\n                item.tree!,\n                mockNullifierQueue,\n                item.hash.toArray('be', 32),\n                item.leafIndex,\n            ),\n            item.owner,\n            bn(item.lamports),\n            item.data ? parseAccountData(item.data) : undefined,\n            item.address || undefined,\n        );\n        return account;\n    }\n\n    /**\n     * Fetch the compressed balance for the specified account address or hash\n     */\n    async getCompressedBalance(address?: BN254, hash?: BN254): Promise<BN> {\n        if (!hash && !address) {\n            throw new Error('Either hash or address must be provided');\n        }\n        if (hash && address) {\n            throw new Error('Only one of hash or address must be provided');\n        }\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedBalance',\n            {\n                hash: hash ? encodeBN254toBase58(hash) : undefined,\n                address: address ? encodeBN254toBase58(address) : undefined,\n            },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(NativeBalanceResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get balance for compressed account ${hash ? hash.toString() : address ? address.toString() : ''}`,\n            );\n        }\n        if (res.result.value === null) {\n            return bn(0);\n        }\n\n        return bn(res.result.value);\n    }\n\n    /// TODO: validate that this is just for sol accounts\n    /**\n     * Fetch the total compressed balance for the specified owner public key\n     */\n    async getCompressedBalanceByOwner(owner: PublicKey): Promise<BN> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedBalanceByOwner',\n            { owner: owner.toBase58() },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(NativeBalanceResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get balance for compressed account ${owner.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            return bn(0);\n        }\n        return bn(res.result.value);\n    }\n\n    /**\n     * Fetch the latest merkle proof for the specified account hash from the\n     * cluster\n     */\n    async getCompressedAccountProof(\n        hash: BN254,\n    ): Promise<MerkleContextWithMerkleProof> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedAccountProof',\n            { hash: encodeBN254toBase58(hash) },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(MerkeProofResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get proof for compressed account ${hash.toString()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get proof for compressed account ${hash.toString()}`,\n            );\n        }\n\n        const value: MerkleContextWithMerkleProof = {\n            hash: res.result.value.hash.toArray('be', 32),\n            merkleTree: res.result.value.merkleTree,\n            leafIndex: res.result.value.leafIndex,\n            merkleProof: res.result.value.proof,\n            nullifierQueue: mockNullifierQueue, // TODO(photon): support nullifierQueue in response.\n            rootIndex: res.result.value.rootSeq % 2400,\n            root: res.result.value.root,\n        };\n        return value;\n    }\n\n    /**\n     * Fetch all the account info for multiple compressed accounts specified by\n     * an array of account hashes\n     */\n    async getMultipleCompressedAccounts(\n        hashes: BN254[],\n    ): Promise<CompressedAccountWithMerkleContext[]> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getMultipleCompressedAccounts',\n            { hashes: hashes.map(hash => encodeBN254toBase58(hash)) },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(MultipleCompressedAccountsResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get info for compressed accounts ${hashes.map(hash => encodeBN254toBase58(hash)).join(', ')}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get info for compressed accounts ${hashes.map(hash => encodeBN254toBase58(hash)).join(', ')}`,\n            );\n        }\n        const accounts: CompressedAccountWithMerkleContext[] = [];\n        res.result.value.items.map(item => {\n            const account = createCompressedAccountWithMerkleContext(\n                createMerkleContext(\n                    item.tree!,\n                    mockNullifierQueue,\n                    item.hash.toArray('be', 32),\n                    item.leafIndex,\n                ),\n                item.owner,\n                bn(item.lamports),\n                item.data ? parseAccountData(item.data) : undefined,\n                item.address || undefined,\n            );\n            accounts.push(account);\n        });\n\n        return accounts.sort((a, b) => b.leafIndex - a.leafIndex);\n    }\n\n    /**\n     * Fetch the latest merkle proofs for multiple compressed accounts specified\n     * by an array account hashes\n     */\n    async getMultipleCompressedAccountProofs(\n        hashes: BN254[],\n    ): Promise<MerkleContextWithMerkleProof[]> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getMultipleCompressedAccountProofs',\n            hashes.map(hash => encodeBN254toBase58(hash)),\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(array(MerkeProofResult)),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get proofs for compressed accounts ${hashes.map(hash => encodeBN254toBase58(hash)).join(', ')}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get proofs for compressed accounts ${hashes.map(hash => encodeBN254toBase58(hash)).join(', ')}`,\n            );\n        }\n\n        const merkleProofs: MerkleContextWithMerkleProof[] = [];\n\n        for (const proof of res.result.value) {\n            const value: MerkleContextWithMerkleProof = {\n                hash: proof.hash.toArray('be', 32),\n                merkleTree: proof.merkleTree,\n                leafIndex: proof.leafIndex,\n                merkleProof: proof.proof,\n                nullifierQueue: mockAddressQueue, // TODO(photon): support nullifierQueue in response.\n                rootIndex: proof.rootSeq % 2400,\n                root: proof.root,\n            };\n            merkleProofs.push(value);\n        }\n        return merkleProofs;\n    }\n\n    /**\n     * Fetch all the compressed accounts owned by the specified public key.\n     * Owner can be a program or user account\n     */\n    async getCompressedAccountsByOwner(\n        owner: PublicKey,\n        config?: GetCompressedAccountsByOwnerConfig | undefined,\n    ): Promise<WithCursor<CompressedAccountWithMerkleContext[]>> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedAccountsByOwner',\n            {\n                owner: owner.toBase58(),\n                filters: config?.filters || [],\n                dataSlice: config?.dataSlice,\n                cursor: config?.cursor,\n                limit: config?.limit?.toNumber(),\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(CompressedAccountsByOwnerResult),\n        );\n\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get info for compressed accounts owned by ${owner.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            return {\n                items: [],\n                cursor: null,\n            };\n        }\n        const accounts: CompressedAccountWithMerkleContext[] = [];\n\n        res.result.value.items.map(item => {\n            const account = createCompressedAccountWithMerkleContext(\n                createMerkleContext(\n                    item.tree!,\n                    mockNullifierQueue,\n                    item.hash.toArray('be', 32),\n                    item.leafIndex,\n                ),\n                item.owner,\n                bn(item.lamports),\n                item.data ? parseAccountData(item.data) : undefined,\n                item.address || undefined,\n            );\n\n            accounts.push(account);\n        });\n\n        return {\n            items: accounts.sort((a, b) => b.leafIndex - a.leafIndex),\n            cursor: res.result.value.cursor,\n        };\n    }\n\n    /**\n     * Fetch all the compressed token accounts owned by the specified public\n     * key. Owner can be a program or user account\n     */\n    async getCompressedTokenAccountsByOwner(\n        owner: PublicKey,\n        options?: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<ParsedTokenAccount[]>> {\n        if (!options) options = {};\n\n        return await getCompressedTokenAccountsByOwnerOrDelegate(\n            this,\n            owner,\n            options,\n            false,\n        );\n    }\n\n    /**\n     * Fetch all the compressed accounts delegated to the specified public key.\n     */\n    async getCompressedTokenAccountsByDelegate(\n        delegate: PublicKey,\n        options?: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<ParsedTokenAccount[]>> {\n        if (!options) options = {};\n\n        return getCompressedTokenAccountsByOwnerOrDelegate(\n            this,\n            delegate,\n            options,\n            true,\n        );\n    }\n\n    /**\n     * Fetch the compressed token balance for the specified account hash\n     */\n    async getCompressedTokenAccountBalance(\n        hash: BN254,\n    ): Promise<{ amount: BN }> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedTokenAccountBalance',\n            { hash: encodeBN254toBase58(hash) },\n        );\n        const res = create(unsafeRes, jsonRpcResultAndContext(BalanceResult));\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get balance for compressed token account ${hash.toString()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get balance for compressed token account ${hash.toString()}`,\n            );\n        }\n\n        return { amount: bn(res.result.value.amount) };\n    }\n\n    /**\n     * @deprecated use {@link getCompressedTokenBalancesByOwnerV2} instead.\n     *\n     * Fetch all the compressed token balances owned by the specified public\n     * key. Can filter by mint. Returns without context.\n     */\n    async getCompressedTokenBalancesByOwner(\n        owner: PublicKey,\n        options?: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<TokenBalance[]>> {\n        if (!options) options = {};\n\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedTokenBalancesByOwner',\n            {\n                owner: owner.toBase58(),\n                mint: options.mint?.toBase58(),\n                limit: options.limit?.toNumber(),\n                cursor: options.cursor,\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(TokenBalanceListResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get compressed token balances for owner ${owner.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get compressed token balances for owner ${owner.toBase58()}`,\n            );\n        }\n\n        const maybeFiltered = options.mint\n            ? res.result.value.tokenBalances.filter(\n                  tokenBalance =>\n                      tokenBalance.mint.toBase58() === options.mint!.toBase58(),\n              )\n            : res.result.value.tokenBalances;\n\n        return {\n            items: maybeFiltered,\n            cursor: res.result.value.cursor,\n        };\n    }\n\n    /**\n     * Fetch the compressed token balances owned by the specified public\n     * key. Paginated. Can filter by mint. Returns with context.\n     */\n    async getCompressedTokenBalancesByOwnerV2(\n        owner: PublicKey,\n        options?: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithContext<WithCursor<TokenBalance[]>>> {\n        if (!options) options = {};\n\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedTokenBalancesByOwnerV2',\n            {\n                owner: owner.toBase58(),\n                mint: options.mint?.toBase58(),\n                limit: options.limit?.toNumber(),\n                cursor: options.cursor,\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(TokenBalanceListResultV2),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get compressed token balances for owner ${owner.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get compressed token balances for owner ${owner.toBase58()}`,\n            );\n        }\n\n        const maybeFiltered = options.mint\n            ? res.result.value.items.filter(\n                  tokenBalance =>\n                      tokenBalance.mint.toBase58() === options.mint!.toBase58(),\n              )\n            : res.result.value.items;\n\n        return {\n            context: res.result.context,\n            value: {\n                items: maybeFiltered,\n                cursor: res.result.value.cursor,\n            },\n        };\n    }\n\n    /**\n     * Returns confirmed compression signatures for transactions involving the specified\n     * account hash forward in time from genesis to the most recent confirmed\n     * block\n     *\n     * @param hash queried account hash\n     */\n    async getCompressionSignaturesForAccount(\n        hash: BN254,\n    ): Promise<SignatureWithMetadata[]> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressionSignaturesForAccount',\n            { hash: encodeBN254toBase58(hash) },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(SignatureListResult),\n        );\n\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get signatures for compressed account ${hash.toString()}`,\n            );\n        }\n        return res.result.value.items;\n    }\n\n    /**\n     * Fetch a confirmed or finalized transaction from the cluster. Return with\n     * CompressionInfo\n     */\n    async getTransactionWithCompressionInfo(\n        signature: string,\n    ): Promise<CompressedTransaction | null> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getTransactionWithCompressionInfo',\n            { signature },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResult(CompressedTransactionResult),\n        );\n\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(res.error, 'failed to get slot');\n        }\n\n        if (res.result.transaction === null) return null;\n\n        const closedAccounts: {\n            account: CompressedAccountWithMerkleContext;\n            maybeTokenData: TokenData | null;\n        }[] = [];\n\n        const openedAccounts: {\n            account: CompressedAccountWithMerkleContext;\n            maybeTokenData: TokenData | null;\n        }[] = [];\n\n        res.result.compressionInfo.closedAccounts.map(item => {\n            closedAccounts.push(buildCompressedAccountWithMaybeTokenData(item));\n        });\n        res.result.compressionInfo.openedAccounts.map(item => {\n            openedAccounts.push(buildCompressedAccountWithMaybeTokenData(item));\n        });\n\n        const calculateTokenBalances = (\n            accounts: Array<{\n                account: CompressedAccountWithMerkleContext;\n                maybeTokenData: TokenData | null;\n            }>,\n        ):\n            | Array<{\n                  owner: PublicKey;\n                  mint: PublicKey;\n                  amount: BN;\n              }>\n            | undefined => {\n            const balances = Object.values(\n                accounts.reduce(\n                    (acc, { maybeTokenData }) => {\n                        if (maybeTokenData) {\n                            const { owner, mint, amount } = maybeTokenData;\n                            const key = `${owner.toBase58()}_${mint.toBase58()}`;\n                            if (key in acc) {\n                                acc[key].amount = acc[key].amount.add(amount);\n                            } else {\n                                acc[key] = { owner, mint, amount };\n                            }\n                        }\n                        return acc;\n                    },\n                    {} as {\n                        [key: string]: {\n                            owner: PublicKey;\n                            mint: PublicKey;\n                            amount: BN;\n                        };\n                    },\n                ),\n            );\n            return balances.length > 0 ? balances : undefined;\n        };\n\n        const preTokenBalances = calculateTokenBalances(closedAccounts);\n        const postTokenBalances = calculateTokenBalances(openedAccounts);\n\n        return {\n            compressionInfo: {\n                closedAccounts,\n                openedAccounts,\n                preTokenBalances,\n                postTokenBalances,\n            },\n            transaction: res.result.transaction,\n        };\n    }\n\n    /**\n     * Returns confirmed signatures for transactions involving the specified\n     * address forward in time from genesis to the most recent confirmed block\n     *\n     * @param address queried compressed account address\n     */\n    async getCompressionSignaturesForAddress(\n        address: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressionSignaturesForAddress',\n            {\n                address: address.toBase58(),\n                cursor: options?.cursor,\n                limit: options?.limit?.toNumber(),\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(SignatureListWithCursorResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get signatures for address ${address.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get signatures for address ${address.toBase58()}`,\n            );\n        }\n\n        return res.result.value;\n    }\n\n    /**\n     * Returns confirmed signatures for compression transactions involving the\n     * specified account owner forward in time from genesis to the\n     * most recent confirmed block\n     *\n     * @param owner queried owner public key\n     */\n    async getCompressionSignaturesForOwner(\n        owner: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressionSignaturesForOwner',\n            {\n                owner: owner.toBase58(),\n                cursor: options?.cursor,\n                limit: options?.limit?.toNumber(),\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(SignatureListWithCursorResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get signatures for owner ${owner.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get signatures for owner ${owner.toBase58()}`,\n            );\n        }\n\n        return res.result.value;\n    }\n\n    /**\n     * Returns confirmed signatures for compression transactions involving the\n     * specified token account owner forward in time from genesis to the most\n     * recent confirmed block\n     */\n    async getCompressionSignaturesForTokenOwner(\n        owner: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressionSignaturesForTokenOwner',\n            {\n                owner: owner.toBase58(),\n                cursor: options?.cursor,\n                limit: options?.limit?.toNumber(),\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(SignatureListWithCursorResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get signatures for owner ${owner.toBase58()}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get signatures for owner ${owner.toBase58()}`,\n            );\n        }\n\n        return res.result.value;\n    }\n\n    /**\n     * Fetch the current indexer health status\n     */\n    async getIndexerHealth(): Promise<string> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getIndexerHealth',\n        );\n        const res = create(unsafeRes, jsonRpcResult(HealthResult));\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(res.error, 'failed to get health');\n        }\n        return res.result;\n    }\n\n    /**\n     * Ensure that the Compression Indexer has already indexed the transaction\n     */\n    async confirmTransactionIndexed(slot: number): Promise<boolean> {\n        const startTime = Date.now();\n        // eslint-disable-next-line no-constant-condition\n        while (true) {\n            const indexerSlot = await this.getIndexerSlot();\n\n            if (indexerSlot >= slot) {\n                return true;\n            }\n            if (Date.now() - startTime > 20000) {\n                // 20 seconds\n                throw new Error(\n                    'Timeout: Indexer slot did not reach the required slot within 20 seconds',\n                );\n            }\n            await new Promise(resolve => setTimeout(resolve, 200));\n        }\n    }\n\n    /**\n     * Fetch the current slot that the node is processing\n     */\n    async getIndexerSlot(): Promise<number> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getIndexerSlot',\n        );\n        const res = create(unsafeRes, jsonRpcResult(SlotResult));\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(res.error, 'failed to get slot');\n        }\n        return res.result;\n    }\n\n    /**\n     * Fetch all the compressed token holders for a given mint. Paginated.\n     */\n    async getCompressedMintTokenHolders(\n        mint: PublicKey,\n        options?: PaginatedOptions,\n    ): Promise<WithContext<WithCursor<CompressedMintTokenHolders[]>>> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getCompressedMintTokenHolders',\n            {\n                mint: mint.toBase58(),\n                cursor: options?.cursor,\n                limit: options?.limit?.toNumber(),\n            },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(CompressedMintTokenHoldersResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                'failed to get mint token holders',\n            );\n        }\n\n        return res.result;\n    }\n    /**\n     * Fetch the latest compression signatures on the cluster. Results are\n     * paginated.\n     */\n    async getLatestCompressionSignatures(\n        cursor?: string,\n        limit?: number,\n    ): Promise<LatestNonVotingSignaturesPaginated> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getLatestCompressionSignatures',\n            { limit, cursor },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(LatestNonVotingSignaturesResultPaginated),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                'failed to get latest non-voting signatures',\n            );\n        }\n        return res.result;\n    }\n\n    /**\n     * Fetch all non-voting signatures\n     */\n    async getLatestNonVotingSignatures(\n        limit?: number,\n        cursor?: string,\n    ): Promise<LatestNonVotingSignatures> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getLatestNonVotingSignatures',\n            { limit, cursor },\n        );\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(LatestNonVotingSignaturesResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                'failed to get latest non-voting signatures',\n            );\n        }\n        return res.result;\n    }\n\n    /**\n     * Fetch the latest address proofs for new unique addresses specified by an\n     * array of addresses.\n     *\n     * the proof states that said address have not yet been created in\n     * respective address tree.\n     * @param addresses Array of BN254 new addresses\n     * @returns Array of validity proofs for new addresses\n     */\n    async getMultipleNewAddressProofs(addresses: BN254[]) {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getMultipleNewAddressProofs',\n            addresses.map(address => encodeBN254toBase58(address)),\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(array(NewAddressProofResult)),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get proofs for new addresses ${addresses.map(address => encodeBN254toBase58(address)).join(', ')}`,\n            );\n        }\n        if (res.result.value === null) {\n            throw new Error(\n                `failed to get proofs for new addresses ${addresses.map(address => encodeBN254toBase58(address)).join(', ')}`,\n            );\n        }\n\n        /// Creates proof for each address\n        const newAddressProofs: MerkleContextWithNewAddressProof[] = [];\n\n        for (const proof of res.result.value) {\n            const _proof: MerkleContextWithNewAddressProof = {\n                root: proof.root,\n                rootIndex: proof.rootSeq % 2400,\n                value: proof.address,\n                leafLowerRangeValue: proof.lowerRangeAddress,\n                leafHigherRangeValue: proof.higherRangeAddress,\n                nextIndex: bn(proof.nextIndex),\n                merkleProofHashedIndexedElementLeaf: proof.proof,\n                indexHashedIndexedElementLeaf: bn(proof.lowElementLeafIndex),\n                merkleTree: proof.merkleTree,\n                nullifierQueue: mockAddressQueue,\n            };\n            newAddressProofs.push(_proof);\n        }\n        return newAddressProofs;\n    }\n\n    /**\n     * Advanced usage of getValidityProof: fetches ZKP directly from a custom\n     * non-rpcprover. Note: This uses the proverEndpoint specified in the\n     * constructor. For normal usage, please use {@link getValidityProof}\n     * instead.\n     *\n     * Fetch the latest validity proof for (1) compressed accounts specified by\n     * an array of account hashes. (2) new unique addresses specified by an\n     * array of addresses.\n     *\n     * Validity proofs prove the presence of compressed accounts in state trees\n     * and the non-existence of addresses in address trees, respectively. They\n     * enable verification without recomputing the merkle proof path, thus\n     * lowering verification and data costs.\n     *\n     * @param hashes        Array of BN254 hashes.\n     * @param newAddresses  Array of BN254 new addresses.\n     * @returns             validity proof with context\n     */\n    async getValidityProofDirect(\n        hashes: BN254[] = [],\n        newAddresses: BN254[] = [],\n    ): Promise<CompressedProofWithContext> {\n        let validityProof: CompressedProofWithContext;\n\n        if (hashes.length === 0 && newAddresses.length === 0) {\n            throw new Error(\n                'Empty input. Provide hashes and/or new addresses.',\n            );\n        } else if (hashes.length > 0 && newAddresses.length === 0) {\n            /// inclusion\n            const merkleProofsWithContext =\n                await this.getMultipleCompressedAccountProofs(hashes);\n            const inputs = convertMerkleProofsWithContextToHex(\n                merkleProofsWithContext,\n            );\n            // const lightWasm = await WasmFactory.getInstance();\n            // const publicInputHash = getPublicInputHash(\n            //     merkleProofsWithContext,\n            //     hashes,\n            //     [],\n            //     lightWasm,\n            // );\n            const compressedProof = await proverRequest(\n                this.proverEndpoint,\n                'inclusion',\n                inputs,\n                false,\n                // publicInputHash,\n            );\n            validityProof = {\n                compressedProof,\n                roots: merkleProofsWithContext.map(proof => proof.root),\n                rootIndices: merkleProofsWithContext.map(\n                    proof => proof.rootIndex,\n                ),\n                leafIndices: merkleProofsWithContext.map(\n                    proof => proof.leafIndex,\n                ),\n                leaves: merkleProofsWithContext.map(proof => bn(proof.hash)),\n                merkleTrees: merkleProofsWithContext.map(\n                    proof => proof.merkleTree,\n                ),\n                nullifierQueues: merkleProofsWithContext.map(\n                    proof => proof.nullifierQueue,\n                ),\n            };\n        } else if (hashes.length === 0 && newAddresses.length > 0) {\n            /// new-address\n            const newAddressProofs: MerkleContextWithNewAddressProof[] =\n                await this.getMultipleNewAddressProofs(newAddresses);\n\n            const inputs =\n                convertNonInclusionMerkleProofInputsToHex(newAddressProofs);\n            // const lightWasm = await WasmFactory.getInstance();\n            // const publicInputHash = getPublicInputHash(\n            //     [],\n            //     [],\n            //     newAddressProofs,\n            //     lightWasm,\n            // );\n            const compressedProof = await proverRequest(\n                this.proverEndpoint,\n                'new-address',\n                inputs,\n                false,\n                // publicInputHash,\n            );\n\n            validityProof = {\n                compressedProof,\n                roots: newAddressProofs.map(proof => proof.root),\n                rootIndices: newAddressProofs.map(proof => proof.rootIndex),\n                leafIndices: newAddressProofs.map(proof =>\n                    proof.nextIndex.toNumber(),\n                ),\n                leaves: newAddressProofs.map(proof => bn(proof.value)),\n                merkleTrees: newAddressProofs.map(proof => proof.merkleTree),\n                nullifierQueues: newAddressProofs.map(\n                    proof => proof.nullifierQueue,\n                ),\n            };\n        } else if (hashes.length > 0 && newAddresses.length > 0) {\n            /// combined\n            const merkleProofsWithContext =\n                await this.getMultipleCompressedAccountProofs(hashes);\n            const inputs = convertMerkleProofsWithContextToHex(\n                merkleProofsWithContext,\n            );\n            const newAddressProofs: MerkleContextWithNewAddressProof[] =\n                await this.getMultipleNewAddressProofs(newAddresses);\n\n            const newAddressInputs =\n                convertNonInclusionMerkleProofInputsToHex(newAddressProofs);\n            // const lightWasm = await WasmFactory.getInstance();\n            // const publicInputHash = getPublicInputHash(\n            //     merkleProofsWithContext,\n            //     hashes,\n            //     newAddressProofs,\n            //     lightWasm,\n            // );\n            const compressedProof = await proverRequest(\n                this.proverEndpoint,\n                'combined',\n                [inputs, newAddressInputs],\n                false,\n                // publicInputHash,\n            );\n\n            validityProof = {\n                compressedProof,\n                roots: merkleProofsWithContext\n                    .map(proof => proof.root)\n                    .concat(newAddressProofs.map(proof => proof.root)),\n                rootIndices: merkleProofsWithContext\n                    .map(proof => proof.rootIndex)\n                    .concat(newAddressProofs.map(proof => proof.rootIndex)),\n                leafIndices: merkleProofsWithContext\n                    .map(proof => proof.leafIndex)\n                    .concat(\n                        newAddressProofs.map(\n                            proof => proof.nextIndex.toNumber(), // TODO: support >32bit\n                        ),\n                    ),\n                leaves: merkleProofsWithContext\n                    .map(proof => bn(proof.hash))\n                    .concat(newAddressProofs.map(proof => bn(proof.value))),\n                merkleTrees: merkleProofsWithContext\n                    .map(proof => proof.merkleTree)\n                    .concat(newAddressProofs.map(proof => proof.merkleTree)),\n                nullifierQueues: merkleProofsWithContext\n                    .map(proof => proof.nullifierQueue)\n                    .concat(\n                        newAddressProofs.map(proof => proof.nullifierQueue),\n                    ),\n            };\n        } else throw new Error('Invalid input');\n\n        return validityProof;\n    }\n\n    /**\n     * Fetch the latest validity proof for (1) compressed accounts specified by\n     * an array of account hashes. (2) new unique addresses specified by an\n     * array of addresses.\n     *\n     * Validity proofs prove the presence of compressed accounts in state trees\n     * and the non-existence of addresses in address trees, respectively. They\n     * enable verification without recomputing the merkle proof path, thus\n     * lowering verification and data costs.\n     *\n     * @param hashes        Array of BN254 hashes.\n     * @param newAddresses  Array of BN254 new addresses.\n     * @returns             validity proof with context\n     */\n    async getValidityProof(\n        hashes: BN254[] = [],\n        newAddresses: BN254[] = [],\n    ): Promise<CompressedProofWithContext> {\n        const defaultAddressTreePublicKey =\n            defaultTestStateTreeAccounts().addressTree;\n        const defaultAddressQueuePublicKey =\n            defaultTestStateTreeAccounts().addressQueue;\n        const defaultStateTreePublicKey =\n            defaultTestStateTreeAccounts().merkleTree;\n        const defaultStateQueuePublicKey =\n            defaultTestStateTreeAccounts().nullifierQueue;\n        const formattedHashes = hashes.map(item => {\n            return {\n                hash: item,\n                tree: defaultStateTreePublicKey,\n                queue: defaultStateQueuePublicKey,\n            };\n        });\n\n        const formattedNewAddresses = newAddresses.map(item => {\n            return {\n                address: item,\n                tree: defaultAddressTreePublicKey,\n                queue: defaultAddressQueuePublicKey,\n            };\n        });\n\n        return this.getValidityProofV0(formattedHashes, formattedNewAddresses);\n    }\n\n    /**\n     * Fetch the latest validity proof for (1) compressed accounts specified by\n     * an array of account hashes. (2) new unique addresses specified by an\n     * array of addresses.\n     *\n     * Validity proofs prove the presence of compressed accounts in state trees\n     * and the non-existence of addresses in address trees, respectively. They\n     * enable verification without recomputing the merkle proof path, thus\n     * lowering verification and data costs.\n     *\n     * @param hashes        Array of { hash: BN254, tree: PublicKey, queue: PublicKey }.\n     * @param newAddresses  Array of { address: BN254, tree: PublicKey, queue: PublicKey }.\n     * @returns             validity proof with context\n     */\n    async getValidityProofV0(\n        hashes: HashWithTree[] = [],\n        newAddresses: AddressWithTree[] = [],\n    ): Promise<CompressedProofWithContext> {\n        const { value } = await this.getValidityProofAndRpcContext(\n            hashes,\n            newAddresses,\n        );\n        return value;\n    }\n\n    /**\n     * Fetch the latest validity proof for (1) compressed accounts specified by\n     * an array of account hashes. (2) new unique addresses specified by an\n     * array of addresses. Returns with context slot.\n     *\n     * Validity proofs prove the presence of compressed accounts in state trees\n     * and the non-existence of addresses in address trees, respectively. They\n     * enable verification without recomputing the merkle proof path, thus\n     * lowering verification and data costs.\n     *\n     * @param hashes        Array of BN254 hashes.\n     * @param newAddresses  Array of BN254 new addresses. Optionally specify the\n     *                      tree and queue for each address. Default to public\n     *                      state tree/queue.\n     * @returns             validity proof with context\n     */\n    async getValidityProofAndRpcContext(\n        hashes: HashWithTree[] = [],\n        newAddresses: AddressWithTree[] = [],\n    ): Promise<WithContext<CompressedProofWithContext>> {\n        const unsafeRes = await rpcRequest(\n            this.compressionApiEndpoint,\n            'getValidityProof',\n            {\n                hashes: hashes.map(({ hash }) => encodeBN254toBase58(hash)),\n                newAddressesWithTrees: newAddresses.map(\n                    ({ address, tree }) => ({\n                        address: encodeBN254toBase58(address),\n                        tree: tree.toBase58(),\n                    }),\n                ),\n            },\n        );\n\n        const res = create(\n            unsafeRes,\n            jsonRpcResultAndContext(ValidityProofResult),\n        );\n        if ('error' in res) {\n            throw new SolanaJSONRPCError(\n                res.error,\n                `failed to get ValidityProof for compressed accounts ${hashes.map(hash => hash.toString())}`,\n            );\n        }\n\n        const result = res.result.value;\n\n        if (result === null) {\n            throw new Error(\n                `failed to get ValidityProof for compressed accounts ${hashes.map(hash => hash.toString())}`,\n            );\n        }\n\n        const value: CompressedProofWithContext = {\n            compressedProof: result.compressedProof,\n            merkleTrees: result.merkleTrees,\n            leafIndices: result.leafIndices,\n            nullifierQueues: [\n                ...hashes.map(({ queue }) => queue),\n                ...newAddresses.map(({ queue }) => queue),\n            ],\n            rootIndices: result.rootIndices,\n            roots: result.roots,\n            leaves: result.leaves,\n        };\n        return { value, context: res.result.context };\n    }\n}\n","import { LightWasm } from '../test-rpc/test-rpc';\nimport BN from 'bn.js';\nimport { bn } from '../../state';\nimport { HIGHEST_ADDRESS_PLUS_ONE } from '../../constants';\n\nexport class IndexedElement {\n    public index: number;\n    public value: BN;\n    public nextIndex: number;\n\n    constructor(index: number, value: BN, nextIndex: number) {\n        this.index = index;\n        this.value = value;\n        this.nextIndex = nextIndex;\n    }\n\n    public equals(other: IndexedElement): boolean {\n        return this.value.eq(other.value);\n    }\n\n    public compareTo(other: IndexedElement): number {\n        return this.value.cmp(other.value);\n    }\n\n    public hash(lightWasm: LightWasm, nextValue: BN): Uint8Array {\n        try {\n            const hash = lightWasm.poseidonHash([\n                bn(this.value.toArray('be', 32)).toString(),\n                bn(this.nextIndex).toString(),\n                bn(nextValue.toArray('be', 32)).toString(),\n            ]);\n            return hash;\n        } catch (error) {\n            throw new Error('Hashing failed');\n        }\n    }\n}\n\nexport class IndexedElementBundle {\n    public newLowElement: IndexedElement;\n    public newElement: IndexedElement;\n    public newElementNextValue: BN;\n\n    constructor(\n        newLowElement: IndexedElement,\n        newElement: IndexedElement,\n        newElementNextValue: BN,\n    ) {\n        this.newLowElement = newLowElement;\n        this.newElement = newElement;\n        this.newElementNextValue = newElementNextValue;\n    }\n}\n\n/**\n * This indexed array implementation mirrors the rust implementation of the\n * indexed merkle tree. It stores the elements of the indexed merkle tree.\n */\nexport class IndexedArray {\n    public elements: Array<IndexedElement>;\n    public currentNodeIndex: number;\n    public highestElementIndex: number;\n\n    constructor(\n        elements: Array<IndexedElement>,\n        currentNodeIndex: number,\n        highestElementIndex: number,\n    ) {\n        this.elements = elements;\n        this.currentNodeIndex = currentNodeIndex;\n        this.highestElementIndex = highestElementIndex;\n    }\n\n    public static default(): IndexedArray {\n        return new IndexedArray([new IndexedElement(0, bn(0), 0)], 0, 0);\n    }\n\n    public get(index: number): IndexedElement | undefined {\n        return this.elements[index];\n    }\n\n    public length(): number {\n        return Number(this.currentNodeIndex);\n    }\n\n    public isEmpty(): boolean {\n        return this.currentNodeIndex === 0;\n    }\n\n    public findElement(value: BN): IndexedElement | undefined {\n        return this.elements\n            .slice(0, this.length() + 1)\n            .find(node => node.value === value);\n    }\n\n    public init(): IndexedElementBundle {\n        try {\n            const init_value = HIGHEST_ADDRESS_PLUS_ONE;\n            return this.append(init_value);\n        } catch (error) {\n            throw new Error(`Failed to initialize IndexedArray: ${error}`);\n        }\n    }\n\n    /**\n     * Finds the index of the low element for the given `value` which should not be part of the array.\n     * Low element is the greatest element which still has a lower value than the provided one.\n     * Low elements are used in non-membership proofs.\n     */\n    public findLowElementIndex(value: BN): number | undefined {\n        // Try to find element whose next element is higher than the provided value.\n        for (let i = 0; i <= this.length(); i++) {\n            const node = this.elements[i];\n            if (\n                this.elements[node.nextIndex].value.gt(value) &&\n                node.value.lt(value)\n            ) {\n                return i;\n            } else if (node.value.eq(value)) {\n                throw new Error('Element already exists in the array');\n            }\n        }\n        // If no such element was found, it means that our value is going to be the greatest in the array.\n        // This means that the currently greatest element is going to be the low element of our value.\n        return this.highestElementIndex;\n    }\n\n    /**\n     * Returns the low element for the given value and the next value for that low element.\n     * Low element is the greatest element which still has lower value than the provided one.\n     * Low elements are used in non-membership proofs.\n     */\n    public findLowElement(\n        value: BN,\n    ): [IndexedElement | undefined, BN | undefined] {\n        const lowElementIndex = this.findLowElementIndex(value);\n        if (lowElementIndex === undefined) return [undefined, undefined];\n        const lowElement = this.elements[lowElementIndex];\n        return [lowElement, this.elements[lowElement.nextIndex].value];\n    }\n\n    // /**\n    //  * Returns the index of the low element for the given `value`, which should be the part of the array.\n    //  * Low element is the greatest element which still has lower value than the provided one.\n    //  * Low elements are used in non-membership proofs.\n    //  */\n    // public findLowElementIndexForExistingElement(\n    //     value: BN,\n    // ): number | undefined {\n    //     for (let i = 0; i <= this.length(); i++) {\n    //         const node = this.elements[i];\n    //         if (this.elements[node.nextIndex].value === value) {\n    //             return i;\n    //         }\n    //     }\n    //     return undefined;\n    // }\n\n    /**\n     * Returns the hash of the given element. That hash consists of:\n     * - The value of the given element.\n     * - The `nextIndex` of the given element.\n     * - The value of the element pointed by `nextIndex`.\n     */\n    public hashElement(\n        lightWasm: LightWasm,\n        index: number,\n    ): Uint8Array | undefined {\n        const element = this.elements[index];\n        if (!element) return undefined;\n        const nextElement = this.elements[element.nextIndex];\n        if (!nextElement) return undefined;\n\n        const hash = lightWasm.poseidonHash([\n            bn(element.value.toArray('be', 32)).toString(),\n            bn(element.nextIndex).toString(),\n            bn(nextElement.value.toArray('be', 32)).toString(),\n        ]);\n\n        return hash;\n    }\n\n    /**\n     * Appends a new element with the given value to the indexed array.\n     * It finds the low element index and uses it to append the new element correctly.\n     * @param value The value of the new element to append.\n     * @returns The new element and its low element after insertion.\n     */\n    public append(value: BN): IndexedElementBundle {\n        const lowElementIndex = this.findLowElementIndex(value);\n        if (lowElementIndex === undefined) {\n            throw new Error('Low element index not found.');\n        }\n        return this.appendWithLowElementIndex(lowElementIndex, value);\n    }\n\n    /**\n     * Appends a new element with the given value to the indexed array using a specific low element index.\n     * This method ensures the new element is placed correctly relative to the low element.\n     * @param lowElementIndex The index of the low element.\n     * @param value The value of the new element to append.\n     * @returns The new element and its updated low element.\n     */\n    public appendWithLowElementIndex(\n        lowElementIndex: number,\n        value: BN,\n    ): IndexedElementBundle {\n        const lowElement = this.elements[lowElementIndex];\n\n        if (lowElement.nextIndex === 0) {\n            if (value.lte(lowElement.value)) {\n                throw new Error(\n                    'New element value must be greater than the low element value.',\n                );\n            }\n        } else {\n            const nextElement = this.elements[lowElement.nextIndex];\n\n            if (value.lte(lowElement.value)) {\n                throw new Error(\n                    'New element value must be greater than the low element value.',\n                );\n            }\n\n            if (value.gte(nextElement.value)) {\n                throw new Error(\n                    'New element value must be less than the next element value.',\n                );\n            }\n        }\n\n        const newElementBundle = this.newElementWithLowElementIndex(\n            lowElementIndex,\n            value,\n        );\n\n        // If the old low element wasn't pointing to any element, it means that:\n        //\n        // * It used to be the highest element.\n        // * Our new element, which we are appending, is going the be the\n        //   highest element.\n        //\n        // Therefore, we need to save the new element index as the highest\n        // index.\n        if (lowElement.nextIndex === 0) {\n            this.highestElementIndex = newElementBundle.newElement.index;\n        }\n\n        // Insert new node.\n        this.currentNodeIndex = newElementBundle.newElement.index;\n        this.elements[this.length()] = newElementBundle.newElement;\n\n        // Update low element.\n        this.elements[lowElementIndex] = newElementBundle.newLowElement;\n\n        return newElementBundle;\n    }\n\n    /**\n     * Finds the lowest element in the array.\n     * @returns The lowest element or undefined if the array is empty.\n     */\n    public lowest(): IndexedElement | undefined {\n        return this.elements.length > 0 ? this.elements[0] : undefined;\n    }\n\n    /**\n     * Creates a new element with the specified value and updates the low element index accordingly.\n     * @param lowElementIndex The index of the low element.\n     * @param value The value for the new element.\n     * @returns A bundle containing the new element, the updated low element, and the value of the next element.\n     */\n    public newElementWithLowElementIndex(\n        lowElementIndex: number,\n        value: BN,\n    ): IndexedElementBundle {\n        const newLowElement = this.elements[lowElementIndex];\n\n        const newElementIndex = this.currentNodeIndex + 1;\n        const newElement = new IndexedElement(\n            newElementIndex,\n            value,\n            newLowElement.nextIndex,\n        );\n        newLowElement.nextIndex = newElementIndex;\n\n        const newElementNextValue = this.elements[newElement.nextIndex].value;\n\n        return new IndexedElementBundle(\n            newLowElement,\n            newElement,\n            newElementNextValue,\n        );\n    }\n\n    /**\n     * Creates a new element with the specified value by first finding the appropriate low element index.\n     * @param value The value for the new element.\n     * @returns A bundle containing the new element, the updated low element, and the value of the next element.\n     */\n    public newElement(value: BN): IndexedElementBundle {\n        const lowElementIndex = this.findLowElementIndex(value);\n        if (lowElementIndex === undefined) {\n            throw new Error('Low element index not found.');\n        }\n        return this.newElementWithLowElementIndex(lowElementIndex, value);\n    }\n}\n","import { LightWasm } from '../test-rpc/test-rpc';\n\nexport const DEFAULT_ZERO = '0';\n\n/**\n * @callback hashFunction\n * @param left Left leaf\n * @param right Right leaf\n */\n/**\n * Merkle tree\n */\nexport class MerkleTree {\n    /**\n     * Constructor\n     * @param {number} levels Number of levels in the tree\n     * @param {Array} [elements] Initial elements\n     * @param {Object} options\n     * @param {hashFunction} [options.hashFunction] Function used to hash 2 leaves\n     * @param [options.zeroElement] Value for non-existent leaves\n     */\n    levels: number;\n    capacity: number;\n    zeroElement;\n    _zeros: string[];\n    _layers: string[][];\n    _lightWasm: LightWasm;\n\n    constructor(\n        levels: number,\n        lightWasm: LightWasm,\n        elements: string[] = [],\n        { zeroElement = DEFAULT_ZERO } = {},\n    ) {\n        this.levels = levels;\n        this.capacity = 2 ** levels;\n        this.zeroElement = zeroElement;\n        this._lightWasm = lightWasm;\n        if (elements.length > this.capacity) {\n            throw new Error('Tree is full');\n        }\n        this._zeros = [];\n        this._layers = [];\n        this._layers[0] = elements;\n        this._zeros[0] = this.zeroElement;\n\n        for (let i = 1; i <= levels; i++) {\n            this._zeros[i] = this._lightWasm.poseidonHashString([\n                this._zeros[i - 1],\n                this._zeros[i - 1],\n            ]);\n        }\n        this._rebuild();\n    }\n\n    _rebuild() {\n        for (let level = 1; level <= this.levels; level++) {\n            this._layers[level] = [];\n            for (\n                let i = 0;\n                i < Math.ceil(this._layers[level - 1].length / 2);\n                i++\n            ) {\n                this._layers[level][i] = this._lightWasm.poseidonHashString([\n                    this._layers[level - 1][i * 2],\n                    i * 2 + 1 < this._layers[level - 1].length\n                        ? this._layers[level - 1][i * 2 + 1]\n                        : this._zeros[level - 1],\n                ]);\n            }\n        }\n    }\n\n    /**\n     * Get tree root\n     * @returns {*}\n     */\n    root() {\n        return this._layers[this.levels].length > 0\n            ? this._layers[this.levels][0]\n            : this._zeros[this.levels];\n    }\n\n    /**\n     * Insert new element into the tree\n     * @param element Element to insert\n     */\n\n    insert(element: string) {\n        if (this._layers[0].length >= this.capacity) {\n            throw new Error('Tree is full');\n        }\n        this.update(this._layers[0].length, element);\n    }\n\n    /**\n     * Insert multiple elements into the tree. Tree will be fully rebuilt during this operation.\n     * @param {Array} elements Elements to insert\n     */\n    bulkInsert(elements: string[]) {\n        if (this._layers[0].length + elements.length > this.capacity) {\n            throw new Error('Tree is full');\n        }\n        this._layers[0].push(...elements);\n        this._rebuild();\n    }\n\n    // TODO: update does not work debug\n    /**\n     * Change an element in the tree\n     * @param {number} index Index of element to change\n     * @param element Updated element value\n     */\n    update(index: number, element: string) {\n        // index 0 and 1 and element is the commitment hash\n        if (\n            isNaN(Number(index)) ||\n            index < 0 ||\n            index > this._layers[0].length ||\n            index >= this.capacity\n        ) {\n            throw new Error('Insert index out of bounds: ' + index);\n        }\n        this._layers[0][index] = element;\n        for (let level = 1; level <= this.levels; level++) {\n            index >>= 1;\n            this._layers[level][index] = this._lightWasm.poseidonHashString([\n                this._layers[level - 1][index * 2],\n                index * 2 + 1 < this._layers[level - 1].length\n                    ? this._layers[level - 1][index * 2 + 1]\n                    : this._zeros[level - 1],\n            ]);\n        }\n    }\n\n    /**\n     * Get merkle path to a leaf\n     * @param {number} index Leaf index to generate path for\n     * @returns {{pathElements: number[], pathIndex: number[]}} An object containing adjacent elements and left-right index\n     */\n    path(index: number) {\n        if (\n            isNaN(Number(index)) ||\n            index < 0 ||\n            index >= this._layers[0].length\n        ) {\n            throw new Error('Index out of bounds: ' + index);\n        }\n        const pathElements: string[] = [];\n        const pathIndices: number[] = [];\n        for (let level = 0; level < this.levels; level++) {\n            pathIndices[level] = index % 2;\n            pathElements[level] =\n                (index ^ 1) < this._layers[level].length\n                    ? this._layers[level][index ^ 1]\n                    : this._zeros[level];\n            index >>= 1;\n        }\n        return {\n            pathElements,\n            pathIndices,\n        };\n    }\n\n    /**\n     * Find an element in the tree\n     * @param element An element to find\n     * @param comparator A function that checks leaf value equality\n     * @returns {number} Index if element is found, otherwise -1\n     */\n    indexOf(\n        element: string,\n        comparator: ((element: string, el: string) => boolean) | null = null,\n    ) {\n        if (comparator) {\n            return this._layers[0].findIndex((el: string) =>\n                comparator(element, el),\n            );\n        } else {\n            return this._layers[0].indexOf(element);\n        }\n    }\n\n    /**\n     * Returns a copy of non-zero tree elements\n     * @returns {Object[]}\n     */\n    elements() {\n        return this._layers[0].slice();\n    }\n\n    /**\n     * Serialize entire tree state including intermediate layers into a plain object\n     * Deserializing it back will not require to recompute any hashes\n     * Elements are not converted to a plain type, this is responsibility of the caller\n     */\n    serialize() {\n        return {\n            levels: this.levels,\n            _zeros: this._zeros,\n            _layers: this._layers,\n        };\n    }\n\n    /**\n     * Deserialize data into a MerkleTree instance\n     * Make sure to provide the same hashFunction as was used in the source tree,\n     * otherwise the tree state will be invalid\n     *\n     * @param data\n     * @param hashFunction\n     * @returns {MerkleTree}\n     */\n    static deserialize(\n        data: any,\n        hashFunction: (left: string, right: string) => string,\n    ) {\n        const instance = Object.assign(Object.create(this.prototype), data);\n        instance._hash = hashFunction;\n        instance.capacity = 2 ** instance.levels;\n        instance.zeroElement = instance._zeros[0];\n        return instance;\n    }\n}\n","import {\n    ParsedMessageAccount,\n    ParsedTransactionWithMeta,\n} from '@solana/web3.js';\nimport bs58 from 'bs58';\nimport { defaultStaticAccountsStruct } from '../../constants';\nimport { LightSystemProgram } from '../../programs';\nimport { Rpc } from '../../rpc';\nimport { PublicTransactionEvent } from '../../state';\nimport { decodePublicTransactionEvent } from '../../programs/layout';\n\ntype Deserializer<T> = (data: Buffer, tx: ParsedTransactionWithMeta) => T;\n\n/**\n * @internal\n * Returns newest first.\n *\n * */\nexport async function getParsedEvents(\n    rpc: Rpc,\n): Promise<PublicTransactionEvent[]> {\n    const { noopProgram, accountCompressionProgram } =\n        defaultStaticAccountsStruct();\n\n    /// Get raw transactions\n    const signatures = (\n        await rpc.getConfirmedSignaturesForAddress2(\n            accountCompressionProgram,\n            undefined,\n            'confirmed',\n        )\n    ).map(s => s.signature);\n    const txs = await rpc.getParsedTransactions(signatures, {\n        maxSupportedTransactionVersion: 0,\n        commitment: 'confirmed',\n    });\n\n    /// Filter by NOOP program\n    const transactionEvents = txs.filter(\n        (tx: ParsedTransactionWithMeta | null) => {\n            if (!tx) {\n                return false;\n            }\n            const accountKeys = tx.transaction.message.accountKeys;\n\n            const hasSplNoopAddress = accountKeys.some(\n                (item: ParsedMessageAccount) => {\n                    const itemStr =\n                        typeof item === 'string'\n                            ? item\n                            : item.pubkey.toBase58();\n                    return itemStr === noopProgram.toBase58();\n                },\n            );\n\n            return hasSplNoopAddress;\n        },\n    );\n\n    /// Parse events\n    const parsedEvents = parseEvents(\n        transactionEvents,\n        parsePublicTransactionEventWithIdl,\n    );\n\n    return parsedEvents;\n}\n\nexport const parseEvents = <T>(\n    indexerEventsTransactions: (ParsedTransactionWithMeta | null)[],\n    deserializeFn: Deserializer<T>,\n): NonNullable<T>[] => {\n    const { noopProgram } = defaultStaticAccountsStruct();\n\n    const transactions: NonNullable<T>[] = [];\n    indexerEventsTransactions.forEach(tx => {\n        if (\n            !tx ||\n            !tx.meta ||\n            tx.meta.err ||\n            !tx.meta.innerInstructions ||\n            tx.meta.innerInstructions.length <= 0\n        ) {\n            return;\n        }\n\n        /// We only care about the very last inner instruction as it contains the\n        /// PublicTransactionEvent\n        tx.meta.innerInstructions.forEach(ix => {\n            if (ix.instructions.length > 0) {\n                const ixInner = ix.instructions[ix.instructions.length - 1];\n                // Type guard for partially parsed web3js types.\n                if (\n                    'data' in ixInner &&\n                    ixInner.data &&\n                    ixInner.programId.toBase58() === noopProgram.toBase58()\n                ) {\n                    const data = bs58.decode(ixInner.data);\n\n                    const decodedEvent = deserializeFn(Buffer.from(data), tx);\n\n                    if (decodedEvent !== null && decodedEvent !== undefined) {\n                        transactions.push(decodedEvent as NonNullable<T>);\n                    }\n                }\n            }\n        });\n    });\n\n    return transactions;\n};\n\n// TODO: make it type safe. have to reimplement the types from the IDL.\nexport const parsePublicTransactionEventWithIdl = (\n    data: Buffer,\n): PublicTransactionEvent | null => {\n    const numericData = Buffer.from(data.map(byte => byte));\n\n    try {\n        return decodePublicTransactionEvent(numericData);\n    } catch (error) {\n        console.error('Error deserializing event:', error);\n        return null;\n    }\n};\n","import { PublicKey } from '@solana/web3.js';\n\nimport BN from 'bn.js';\nimport { getParsedEvents } from './get-parsed-events';\nimport { defaultTestStateTreeAccounts } from '../../constants';\nimport { Rpc } from '../../rpc';\nimport {\n    CompressedAccountWithMerkleContext,\n    bn,\n    MerkleContext,\n    createCompressedAccountWithMerkleContext,\n} from '../../state';\n\nexport async function getCompressedAccountsByOwnerTest(\n    rpc: Rpc,\n    owner: PublicKey,\n) {\n    const unspentAccounts = await getCompressedAccountsForTest(rpc);\n    const byOwner = unspentAccounts.filter(acc => acc.owner.equals(owner));\n    return byOwner;\n}\n\nexport async function getCompressedAccountByHashTest(\n    rpc: Rpc,\n    hash: BN,\n): Promise<CompressedAccountWithMerkleContext | undefined> {\n    const unspentAccounts = await getCompressedAccountsForTest(rpc);\n    return unspentAccounts.find(acc => bn(acc.hash).eq(hash));\n}\n\nexport async function getMultipleCompressedAccountsByHashTest(\n    rpc: Rpc,\n    hashes: BN[],\n): Promise<CompressedAccountWithMerkleContext[]> {\n    const unspentAccounts = await getCompressedAccountsForTest(rpc);\n    return unspentAccounts\n        .filter(acc => hashes.some(hash => bn(acc.hash).eq(hash)))\n        .sort((a, b) => b.leafIndex - a.leafIndex);\n}\n\n/// Returns all unspent compressed accounts\nasync function getCompressedAccountsForTest(rpc: Rpc) {\n    const events = (await getParsedEvents(rpc)).reverse();\n    const allOutputAccounts: CompressedAccountWithMerkleContext[] = [];\n    const allInputAccountHashes: BN[] = [];\n\n    for (const event of events) {\n        for (\n            let index = 0;\n            index < event.outputCompressedAccounts.length;\n            index++\n        ) {\n            const account = event.outputCompressedAccounts[index];\n            const merkleContext: MerkleContext = {\n                merkleTree: defaultTestStateTreeAccounts().merkleTree,\n                nullifierQueue: defaultTestStateTreeAccounts().nullifierQueue,\n                hash: event.outputCompressedAccountHashes[index],\n                leafIndex: event.outputLeafIndices[index],\n            };\n            const withCtx: CompressedAccountWithMerkleContext =\n                createCompressedAccountWithMerkleContext(\n                    merkleContext,\n                    account.compressedAccount.owner,\n                    account.compressedAccount.lamports,\n                    account.compressedAccount.data ?? undefined,\n                    account.compressedAccount.address ?? undefined,\n                );\n            allOutputAccounts.push(withCtx);\n        }\n        for (\n            let index = 0;\n            index < event.inputCompressedAccountHashes.length;\n            index++\n        ) {\n            const hash = event.inputCompressedAccountHashes[index];\n            allInputAccountHashes.push(bn(hash));\n        }\n    }\n\n    const unspentAccounts = allOutputAccounts.filter(\n        account =>\n            !allInputAccountHashes.some(hash => hash.eq(bn(account.hash))),\n    );\n    unspentAccounts.sort((a, b) => b.leafIndex - a.leafIndex);\n\n    return unspentAccounts;\n}\n","import { PublicKey } from '@solana/web3.js';\nimport { getParsedEvents } from './get-parsed-events';\nimport BN from 'bn.js';\nimport { defaultTestStateTreeAccounts } from '../../constants';\nimport { Rpc } from '../../rpc';\nimport { ParsedTokenAccount, WithCursor } from '../../rpc-interface';\nimport {\n    CompressedAccount,\n    PublicTransactionEvent,\n    MerkleContext,\n    createCompressedAccountWithMerkleContext,\n    bn,\n} from '../../state';\nimport {\n    struct,\n    publicKey,\n    u64,\n    option,\n    vecU8,\n    u8,\n    Layout,\n} from '@coral-xyz/borsh';\n\nconst tokenProgramId: PublicKey = new PublicKey(\n    'cTokenmWW8bLPjZEBAUgYy3zKxQZW6VKi7bqNFEVv3m',\n);\n\ntype TokenData = {\n    mint: PublicKey;\n    owner: PublicKey;\n    amount: BN;\n    delegate: PublicKey | null;\n    state: number;\n    tlv: Buffer | null;\n};\n\n// for test-rpc\nexport const TokenDataLayout: Layout<TokenData> = struct([\n    publicKey('mint'),\n    publicKey('owner'),\n    u64('amount'),\n    option(publicKey(), 'delegate'),\n    u8('state'),\n    option(vecU8(), 'tlv'),\n]);\n\nexport type EventWithParsedTokenTlvData = {\n    inputCompressedAccountHashes: number[][];\n    outputCompressedAccounts: ParsedTokenAccount[];\n};\n/**\n * Manually parse the compressed token layout for a given compressed account.\n * @param compressedAccount - The compressed account\n * @returns The parsed token data\n */\nexport function parseTokenLayoutWithIdl(\n    compressedAccount: CompressedAccount,\n    programId: PublicKey = tokenProgramId,\n): TokenData | null {\n    if (compressedAccount.data === null) return null;\n\n    const { data } = compressedAccount.data;\n\n    if (data.length === 0) return null;\n    if (compressedAccount.owner.toBase58() !== programId.toBase58()) {\n        throw new Error(\n            `Invalid owner ${compressedAccount.owner.toBase58()} for token layout`,\n        );\n    }\n    return TokenDataLayout.decode(Buffer.from(data));\n}\n\n/**\n * parse compressed accounts of an event with token layout\n * @internal\n * TODO: refactor\n */\nasync function parseEventWithTokenTlvData(\n    event: PublicTransactionEvent,\n): Promise<EventWithParsedTokenTlvData> {\n    const pubkeyArray = event.pubkeyArray;\n\n    const outputHashes = event.outputCompressedAccountHashes;\n    const outputCompressedAccountsWithParsedTokenData: ParsedTokenAccount[] =\n        event.outputCompressedAccounts.map((compressedAccount, i) => {\n            const merkleContext: MerkleContext = {\n                merkleTree:\n                    pubkeyArray[\n                        event.outputCompressedAccounts[i].merkleTreeIndex\n                    ],\n                nullifierQueue:\n                    // FIXME: fix make dynamic\n                    defaultTestStateTreeAccounts().nullifierQueue,\n                hash: outputHashes[i],\n                leafIndex: event.outputLeafIndices[i],\n            };\n\n            if (!compressedAccount.compressedAccount.data)\n                throw new Error('No data');\n\n            const parsedData = parseTokenLayoutWithIdl(\n                compressedAccount.compressedAccount,\n            );\n\n            if (!parsedData) throw new Error('Invalid token data');\n\n            const withMerkleContext = createCompressedAccountWithMerkleContext(\n                merkleContext,\n                compressedAccount.compressedAccount.owner,\n                compressedAccount.compressedAccount.lamports,\n                compressedAccount.compressedAccount.data,\n                compressedAccount.compressedAccount.address ?? undefined,\n            );\n            return {\n                compressedAccount: withMerkleContext,\n                parsed: parsedData,\n            };\n        });\n\n    return {\n        inputCompressedAccountHashes: event.inputCompressedAccountHashes,\n        outputCompressedAccounts: outputCompressedAccountsWithParsedTokenData,\n    };\n}\n\n/**\n * Retrieves all compressed token accounts for a given mint and owner.\n *\n * Note: This function is intended for testing purposes only. For production, use rpc.getCompressedTokenAccounts.\n *\n * @param events    Public transaction events\n * @param owner     PublicKey of the token owner\n * @param mint      PublicKey of the token mint\n */\nexport async function getCompressedTokenAccounts(\n    events: PublicTransactionEvent[],\n): Promise<ParsedTokenAccount[]> {\n    const eventsWithParsedTokenTlvData: EventWithParsedTokenTlvData[] =\n        await Promise.all(\n            events.map(event => parseEventWithTokenTlvData(event)),\n        );\n\n    /// strip spent compressed accounts if an output compressed account of tx n is\n    /// an input compressed account of tx n+m, it is spent\n    const allOutCompressedAccounts = eventsWithParsedTokenTlvData.flatMap(\n        event => event.outputCompressedAccounts,\n    );\n    const allInCompressedAccountHashes = eventsWithParsedTokenTlvData.flatMap(\n        event => event.inputCompressedAccountHashes,\n    );\n    const unspentCompressedAccounts = allOutCompressedAccounts.filter(\n        outputCompressedAccount =>\n            !allInCompressedAccountHashes.some(hash => {\n                return (\n                    JSON.stringify(hash) ===\n                    JSON.stringify(\n                        outputCompressedAccount.compressedAccount.hash,\n                    )\n                );\n            }),\n    );\n\n    return unspentCompressedAccounts;\n}\n\n/** @internal */\nexport async function getCompressedTokenAccountsByOwnerTest(\n    rpc: Rpc,\n    owner: PublicKey,\n    mint: PublicKey,\n): Promise<WithCursor<ParsedTokenAccount[]>> {\n    const events = await getParsedEvents(rpc);\n\n    const compressedTokenAccounts = await getCompressedTokenAccounts(events);\n\n    const accounts = compressedTokenAccounts.filter(\n        acc => acc.parsed.owner.equals(owner) && acc.parsed.mint.equals(mint),\n    );\n    return {\n        items: accounts.sort(\n            (a, b) =>\n                b.compressedAccount.leafIndex - a.compressedAccount.leafIndex,\n        ),\n        cursor: null,\n    };\n}\n\nexport async function getCompressedTokenAccountsByDelegateTest(\n    rpc: Rpc,\n    delegate: PublicKey,\n    mint: PublicKey,\n): Promise<WithCursor<ParsedTokenAccount[]>> {\n    const events = await getParsedEvents(rpc);\n\n    const compressedTokenAccounts = await getCompressedTokenAccounts(events);\n    return {\n        items: compressedTokenAccounts.filter(\n            acc =>\n                acc.parsed.delegate?.equals(delegate) &&\n                acc.parsed.mint.equals(mint),\n        ),\n        cursor: null,\n    };\n}\n\nexport async function getCompressedTokenAccountByHashTest(\n    rpc: Rpc,\n    hash: BN,\n): Promise<ParsedTokenAccount> {\n    const events = await getParsedEvents(rpc);\n\n    const compressedTokenAccounts = await getCompressedTokenAccounts(events);\n\n    const filtered = compressedTokenAccounts.filter(acc =>\n        bn(acc.compressedAccount.hash).eq(hash),\n    );\n    if (filtered.length === 0) {\n        throw new Error('No compressed account found');\n    }\n    return filtered[0];\n}\n","import {\n    Connection,\n    ConnectionConfig,\n    Commitment,\n    PublicKey,\n    Transaction,\n    VersionedTransaction,\n    SendOptions,\n    BlockhashWithExpiryBlockHeight,\n    RpcResponseAndContext,\n    GetBalanceConfig,\n    GetSupplyConfig,\n    Supply,\n    GetTokenAccountsByOwnerConfig,\n    GetProgramAccountsResponse,\n    TokenAccountsFilter,\n    AccountInfo,\n    GetMultipleAccountsConfig,\n    StakeActivationData,\n    GetStakeActivationConfig,\n    TransactionConfirmationStrategy,\n    SignatureResult,\n    ContactInfo,\n    VoteAccountStatus,\n    GetSlotConfig,\n    GetSlotLeaderConfig,\n    SignatureStatusConfig,\n    SignatureStatus,\n    GetTransactionCountConfig,\n    InflationGovernor,\n    GetInflationRewardConfig,\n    InflationReward,\n    InflationRate,\n    EpochInfo,\n    GetEpochInfoConfig,\n    EpochSchedule,\n    LeaderSchedule,\n    FeeCalculator,\n    GetRecentPrioritizationFeesConfig,\n    RecentPrioritizationFees,\n    GetLatestBlockhashConfig,\n    Version,\n    TransactionResponse,\n    VersionedTransactionResponse,\n    ParsedTransactionWithMeta,\n    ParsedConfirmedTransaction,\n    SimulateTransactionConfig,\n    SimulatedTransactionResponse,\n    Message,\n    Signer,\n    AccountChangeCallback,\n    AccountSubscriptionConfig,\n    ProgramAccountChangeCallback,\n    ProgramAccountSubscriptionConfig,\n    LogsFilter,\n    LogsCallback,\n    SlotChangeCallback,\n    SlotUpdateCallback,\n    SignatureResultCallback,\n    SignatureSubscriptionCallback,\n    SignatureSubscriptionOptions,\n    RootChangeCallback,\n    ConfirmOptions,\n    GetMultipleAccountsConfig as OriginalGetMultipleAccountsConfig,\n    GetAccountInfoConfig,\n    GetLargestAccountsConfig,\n    TokenAccountBalancePair,\n    AccountBalancePair,\n    ParsedAccountData,\n    SimulateTransactionConfig as OriginalSimulateTransactionConfig,\n    SimulatedTransactionResponse as OriginalSimulatedTransactionResponse,\n    SignatureSubscriptionOptions as OriginalSignatureSubscriptionOptions,\n    Finality,\n    GetTransactionConfig,\n    GetVersionedTransactionConfig,\n    ConfirmedBlock,\n    BlockProduction,\n    TransactionSignature,\n    BlockSignatures,\n    ConfirmedSignatureInfo,\n    AddressLookupTableAccount,\n    GetBlockHeightConfig,\n    GetBlockProductionConfig,\n    ParsedNoneModeBlockResponse,\n    SolanaJSONRPCError,\n    TokenAmount,\n    GetStakeMinimumDelegationConfig,\n    GetNonceAndContextConfig,\n    NonceAccount,\n    GetNonceConfig,\n    IsBlockhashValidConfig,\n    Blockhash,\n    GetProgramAccountsConfig,\n    GetParsedProgramAccountsConfig,\n    VersionedMessage,\n    VersionedNoneModeBlockResponse,\n    VersionedBlockResponse,\n    GetVersionedBlockConfig,\n    VersionedAccountsModeBlockResponse,\n    ParsedAccountsModeBlockResponse,\n    SignaturesForAddressOptions,\n    ConfirmedSignaturesForAddress2Options,\n    ConfirmedTransaction,\n    PerfSample,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport {\n    getCompressedAccountByHashTest,\n    getCompressedAccountsByOwnerTest,\n    getMultipleCompressedAccountsByHashTest,\n} from './get-compressed-accounts';\nimport {\n    getCompressedTokenAccountByHashTest,\n    getCompressedTokenAccountsByDelegateTest,\n    getCompressedTokenAccountsByOwnerTest,\n} from './get-compressed-token-accounts';\n\nimport { MerkleTree } from '../merkle-tree/merkle-tree';\nimport { getParsedEvents } from './get-parsed-events';\nimport { defaultTestStateTreeAccounts } from '../../constants';\nimport {\n    AddressWithTree,\n    CompressedMintTokenHolders,\n    CompressedTransaction,\n    GetCompressedAccountsByOwnerConfig,\n    PaginatedOptions,\n    HashWithTree,\n    LatestNonVotingSignatures,\n    LatestNonVotingSignaturesPaginated,\n    SignatureWithMetadata,\n    WithContext,\n    WithCursor,\n    BaseRpc,\n} from '../../rpc-interface';\nimport {\n    CompressedProofWithContext,\n    CompressionApiInterface,\n    GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ParsedTokenAccount,\n    TokenBalance,\n} from '../../rpc-interface';\nimport {\n    BN254,\n    CompressedAccountWithMerkleContext,\n    MerkleContextWithMerkleProof,\n    PublicTransactionEvent,\n    bn,\n} from '../../state';\nimport { IndexedArray } from '../merkle-tree';\nimport {\n    MerkleContextWithNewAddressProof,\n    Rpc,\n    convertMerkleProofsWithContextToHex,\n    convertNonInclusionMerkleProofInputsToHex,\n    proverRequest,\n} from '../../rpc';\nimport { ConnectionInterface } from '../../connection-interface';\n\nexport interface TestRpcConfig {\n    /**\n     * Address of the state tree to index. Default: public default test state\n     * tree.\n     */\n    merkleTreeAddress?: PublicKey;\n    /**\n     * Nullifier queue associated with merkleTreeAddress\n     */\n    nullifierQueueAddress?: PublicKey;\n    /**\n     * Depth of state tree. Defaults to the public default test state tree depth\n     */\n    depth?: number;\n    /**\n     * Log proof generation time\n     */\n    log?: boolean;\n    /**\n     * Address of the address tree to index. Default: public default test\n     * address tree.\n     */\n    addressTreeAddress?: PublicKey;\n    /**\n     * Address queue associated with addressTreeAddress\n     */\n    addressQueueAddress?: PublicKey;\n}\n\nexport type ClientSubscriptionId = number;\nexport interface LightWasm {\n    blakeHash(input: string | Uint8Array, hashLength: number): Uint8Array;\n    poseidonHash(input: string[] | BN[]): Uint8Array;\n    poseidonHashString(input: string[] | BN[]): string;\n    poseidonHashBN(input: string[] | BN[]): BN;\n}\n\n/**\n * Returns a mock RPC instance for use in unit tests.\n *\n * @param lightWasm               Wasm hasher instance.\n * @param endpoint                RPC endpoint URL. Defaults to\n *                                'http://127.0.0.1:8899'.\n * @param proverEndpoint          Prover server endpoint URL. Defaults to\n *                                'http://localhost:3001'.\n * @param merkleTreeAddress       Address of the merkle tree to index. Defaults\n *                                to the public default test state tree.\n * @param nullifierQueueAddress   Optional address of the associated nullifier\n *                                queue.\n * @param depth                   Depth of the merkle tree.\n * @param log                     Log proof generation time.\n */\nexport async function getTestRpc(\n    lightWasm: LightWasm,\n    endpoint: string = 'http://127.0.0.1:8899',\n    compressionApiEndpoint: string = 'http://127.0.0.1:8784',\n    proverEndpoint: string = 'http://127.0.0.1:3001',\n    merkleTreeAddress?: PublicKey,\n    nullifierQueueAddress?: PublicKey,\n    depth?: number,\n    log = false,\n) {\n    const defaultAccounts = defaultTestStateTreeAccounts();\n\n    return new TestRpc(\n        endpoint,\n        lightWasm,\n        compressionApiEndpoint,\n        proverEndpoint,\n        undefined,\n        {\n            merkleTreeAddress: merkleTreeAddress || defaultAccounts.merkleTree,\n            nullifierQueueAddress:\n                nullifierQueueAddress || defaultAccounts.nullifierQueue,\n            depth: depth || defaultAccounts.merkleTreeHeight,\n            log,\n        },\n    ) as unknown as Rpc;\n}\n/**\n * Simple mock rpc for unit tests that simulates the compression rpc interface.\n * Fetches, parses events and builds merkletree on-demand, i.e. it does not persist state.\n * Constraints:\n * - Can only index 1 merkletree\n * - Can only index up to 1000 transactions\n *\n * For advanced testing use photon: https://github.com/helius-labs/photon\n */\nexport class TestRpc extends Connection implements CompressionApiInterface {\n    connection: Connection;\n    compressionApiEndpoint: string;\n    proverEndpoint: string;\n    merkleTreeAddress: PublicKey;\n    nullifierQueueAddress: PublicKey;\n    addressTreeAddress: PublicKey;\n    addressQueueAddress: PublicKey;\n    lightWasm: LightWasm;\n    depth: number;\n    log = false;\n\n    /**\n     * Establish a Compression-compatible JSON RPC mock-connection\n     *\n     * @param endpoint                  endpoint to the solana cluster (use for\n     *                                  localnet only)\n     * @param hasher                    light wasm hasher instance\n     * @param compressionApiEndpoint    Endpoint to the compression server.\n     * @param proverEndpoint            Endpoint to the prover server. defaults\n     *                                  to endpoint\n     * @param connectionConfig          Optional connection config\n     * @param testRpcConfig             Config for the mock rpc\n     */\n    constructor(\n        endpoint: string,\n        hasher: LightWasm,\n        compressionApiEndpoint: string,\n        proverEndpoint: string,\n        connectionConfig?: ConnectionConfig,\n        testRpcConfig?: TestRpcConfig,\n    ) {\n        super(endpoint, connectionConfig || 'confirmed');\n\n        this.connection = new Connection(\n            endpoint,\n            connectionConfig || 'confirmed',\n        );\n        this.compressionApiEndpoint = compressionApiEndpoint;\n        this.proverEndpoint = proverEndpoint;\n\n        const {\n            merkleTreeAddress,\n            nullifierQueueAddress,\n            depth,\n            log,\n            addressTreeAddress,\n            addressQueueAddress,\n        } = testRpcConfig ?? {};\n\n        const {\n            merkleTree,\n            nullifierQueue,\n            merkleTreeHeight,\n            addressQueue,\n            addressTree,\n        } = defaultTestStateTreeAccounts();\n\n        this.lightWasm = hasher;\n        this.merkleTreeAddress = merkleTreeAddress ?? merkleTree;\n        this.nullifierQueueAddress = nullifierQueueAddress ?? nullifierQueue;\n        this.addressTreeAddress = addressTreeAddress ?? addressTree;\n        this.addressQueueAddress = addressQueueAddress ?? addressQueue;\n        this.depth = depth ?? merkleTreeHeight;\n        this.log = log ?? false;\n    }\n\n    // get commitment(): Commitment | undefined {\n    //     return this.connection.commitment;\n    // }\n\n    // get rpcEndpoint(): string {\n    //     return this.connection.rpcEndpoint;\n    // }\n\n    // // === Connection Methods Delegated ===\n\n    // async getBalanceAndContext(\n    //     publicKey: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetBalanceConfig,\n    // ): Promise<RpcResponseAndContext<number>> {\n    //     return this.connection.getBalanceAndContext(\n    //         publicKey,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getBalance(\n    //     publicKey: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetBalanceConfig,\n    // ): Promise<number> {\n    //     return this.connection.getBalance(publicKey, commitmentOrConfig);\n    // }\n\n    // async getBlockTime(slot: number): Promise<number | null> {\n    //     return this.connection.getBlockTime(slot);\n    // }\n\n    // async getMinimumLedgerSlot(): Promise<number> {\n    //     return this.connection.getMinimumLedgerSlot();\n    // }\n\n    // async getFirstAvailableBlock(): Promise<number> {\n    //     return this.connection.getFirstAvailableBlock();\n    // }\n\n    // async getSupply(\n    //     config?: GetSupplyConfig | Commitment,\n    // ): Promise<RpcResponseAndContext<Supply>> {\n    //     return this.connection.getSupply(config);\n    // }\n\n    // async getTokenSupply(\n    //     tokenMintAddress: PublicKey,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<TokenAmount>> {\n    //     return this.connection.getTokenSupply(tokenMintAddress, commitment);\n    // }\n\n    // async getTokenAccountBalance(\n    //     tokenAddress: PublicKey,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<TokenAmount>> {\n    //     return this.connection.getTokenAccountBalance(tokenAddress, commitment);\n    // }\n\n    // async getTokenAccountsByOwner(\n    //     ownerAddress: PublicKey,\n    //     filter: TokenAccountsFilter,\n    //     commitmentOrConfig?: Commitment | GetTokenAccountsByOwnerConfig,\n    // ): Promise<RpcResponseAndContext<GetProgramAccountsResponse>> {\n    //     return this.connection.getTokenAccountsByOwner(\n    //         ownerAddress,\n    //         filter,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getParsedTokenAccountsByOwner(\n    //     ownerAddress: PublicKey,\n    //     filter: TokenAccountsFilter,\n    //     commitment?: Commitment,\n    // ): Promise<\n    //     RpcResponseAndContext<\n    //         Array<{\n    //             pubkey: PublicKey;\n    //             account: AccountInfo<ParsedAccountData>;\n    //         }>\n    //     >\n    // > {\n    //     return this.connection.getParsedTokenAccountsByOwner(\n    //         ownerAddress,\n    //         filter,\n    //         commitment,\n    //     );\n    // }\n\n    // async getLargestAccounts(\n    //     config?: GetLargestAccountsConfig,\n    // ): Promise<RpcResponseAndContext<Array<AccountBalancePair>>> {\n    //     return this.connection.getLargestAccounts(config);\n    // }\n\n    // async getTokenLargestAccounts(\n    //     mintAddress: PublicKey,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<Array<TokenAccountBalancePair>>> {\n    //     return this.connection.getTokenLargestAccounts(mintAddress, commitment);\n    // }\n\n    // async getAccountInfoAndContext(\n    //     publicKey: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetAccountInfoConfig,\n    // ): Promise<RpcResponseAndContext<AccountInfo<Buffer> | null>> {\n    //     return this.connection.getAccountInfoAndContext(\n    //         publicKey,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getParsedAccountInfo(\n    //     publicKey: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetAccountInfoConfig,\n    // ): Promise<\n    //     RpcResponseAndContext<AccountInfo<Buffer | ParsedAccountData> | null>\n    // > {\n    //     return this.connection.getParsedAccountInfo(\n    //         publicKey,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getAccountInfo(\n    //     publicKey: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetAccountInfoConfig,\n    // ): Promise<AccountInfo<Buffer> | null> {\n    //     return this.connection.getAccountInfo(publicKey, commitmentOrConfig);\n    // }\n\n    // async getMultipleParsedAccounts(\n    //     publicKeys: PublicKey[],\n    //     rawConfig?: GetMultipleAccountsConfig,\n    // ): Promise<\n    //     RpcResponseAndContext<\n    //         (AccountInfo<Buffer | ParsedAccountData> | null)[]\n    //     >\n    // > {\n    //     return this.connection.getMultipleParsedAccounts(publicKeys, rawConfig);\n    // }\n\n    // async getMultipleAccountsInfoAndContext(\n    //     publicKeys: PublicKey[],\n    //     commitmentOrConfig?: Commitment | GetMultipleAccountsConfig,\n    // ): Promise<RpcResponseAndContext<(AccountInfo<Buffer> | null)[]>> {\n    //     return this.connection.getMultipleAccountsInfoAndContext(\n    //         publicKeys,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getMultipleAccountsInfo(\n    //     publicKeys: PublicKey[],\n    //     commitmentOrConfig?: Commitment | GetMultipleAccountsConfig,\n    // ): Promise<(AccountInfo<Buffer> | null)[]> {\n    //     return this.connection.getMultipleAccountsInfo(\n    //         publicKeys,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getStakeActivation(\n    //     publicKey: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetStakeActivationConfig,\n    //     epoch?: number,\n    // ): Promise<StakeActivationData> {\n    //     return this.connection.getStakeActivation(\n    //         publicKey,\n    //         commitmentOrConfig,\n    //         epoch,\n    //     );\n    // }\n\n    // async getProgramAccounts(\n    //     programId: PublicKey,\n    //     configOrCommitment?: GetProgramAccountsConfig | Commitment,\n    // ): Promise<GetProgramAccountsResponse>;\n\n    // async getProgramAccounts(\n    //     programId: PublicKey,\n    //     configOrCommitment: GetProgramAccountsConfig & { withContext: true },\n    // ): Promise<RpcResponseAndContext<GetProgramAccountsResponse>>;\n\n    // async getProgramAccounts(\n    //     programId: PublicKey,\n    //     configOrCommitment?: GetProgramAccountsConfig | Commitment,\n    // ): Promise<\n    //     | GetProgramAccountsResponse\n    //     | RpcResponseAndContext<GetProgramAccountsResponse>\n    // > {\n    //     return this.connection.getProgramAccounts(\n    //         programId,\n    //         configOrCommitment,\n    //     );\n    // }\n\n    // async getParsedProgramAccounts(\n    //     programId: PublicKey,\n    //     configOrCommitment?: GetParsedProgramAccountsConfig | Commitment,\n    // ): Promise<\n    //     Array<{\n    //         pubkey: PublicKey;\n    //         account: AccountInfo<Buffer | ParsedAccountData>;\n    //     }>\n    // > {\n    //     return this.connection.getParsedProgramAccounts(\n    //         programId,\n    //         configOrCommitment,\n    //     );\n    // }\n\n    // // === Subscription Methods ===\n\n    // onAccountChange(\n    //     publicKey: PublicKey,\n    //     callback: AccountChangeCallback,\n    //     config?: AccountSubscriptionConfig,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onAccountChange(publicKey, callback, config);\n    // }\n\n    // async removeAccountChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeAccountChangeListener(\n    //         clientSubscriptionId,\n    //     );\n    // }\n\n    // onProgramAccountChange(\n    //     programId: PublicKey,\n    //     callback: ProgramAccountChangeCallback,\n    //     config?: ProgramAccountSubscriptionConfig,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onProgramAccountChange(\n    //         programId,\n    //         callback,\n    //         config,\n    //     );\n    // }\n\n    // async removeProgramAccountChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeProgramAccountChangeListener(\n    //         clientSubscriptionId,\n    //     );\n    // }\n\n    // onLogs(\n    //     filter: LogsFilter,\n    //     callback: LogsCallback,\n    //     commitment?: Commitment,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onLogs(filter, callback, commitment);\n    // }\n\n    // async removeOnLogsListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeOnLogsListener(clientSubscriptionId);\n    // }\n\n    // onSlotChange(callback: SlotChangeCallback): ClientSubscriptionId {\n    //     return this.connection.onSlotChange(callback);\n    // }\n\n    // async removeSlotChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeSlotChangeListener(clientSubscriptionId);\n    // }\n\n    // onSlotUpdate(callback: SlotUpdateCallback): ClientSubscriptionId {\n    //     return this.connection.onSlotUpdate(callback);\n    // }\n\n    // async removeSlotUpdateListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeSlotUpdateListener(clientSubscriptionId);\n    // }\n\n    // onSignature(\n    //     signature: TransactionSignature,\n    //     callback: SignatureResultCallback,\n    //     commitment?: Commitment,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onSignature(signature, callback, commitment);\n    // }\n\n    // onSignatureWithOptions(\n    //     signature: TransactionSignature,\n    //     callback: SignatureSubscriptionCallback,\n    //     options?: SignatureSubscriptionOptions,\n    // ): ClientSubscriptionId {\n    //     return this.connection.onSignatureWithOptions(\n    //         signature,\n    //         callback,\n    //         options,\n    //     );\n    // }\n\n    // async removeSignatureListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeSignatureListener(clientSubscriptionId);\n    // }\n\n    // onRootChange(callback: RootChangeCallback): ClientSubscriptionId {\n    //     return this.connection.onRootChange(callback);\n    // }\n\n    // async removeRootChangeListener(\n    //     clientSubscriptionId: ClientSubscriptionId,\n    // ): Promise<void> {\n    //     return this.connection.removeRootChangeListener(clientSubscriptionId);\n    // }\n\n    // // === Transaction Methods ===\n\n    // async sendTransaction(\n    //     transaction: VersionedTransaction,\n    //     options?: SendOptions,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.sendTransaction(transaction, options);\n    // }\n\n    // async sendRawTransaction(\n    //     rawTransaction: Buffer | Uint8Array | Array<number>,\n    //     options?: SendOptions,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.sendRawTransaction(rawTransaction, options);\n    // }\n\n    // async sendEncodedTransaction(\n    //     encodedTransaction: string,\n    //     options?: SendOptions,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.sendEncodedTransaction(\n    //         encodedTransaction,\n    //         options,\n    //     );\n    // }\n\n    // async simulateTransaction(\n    //     transaction: VersionedTransaction,\n    //     config?: SimulateTransactionConfig,\n    // ): Promise<RpcResponseAndContext<SimulatedTransactionResponse>> {\n    //     return this.connection.simulateTransaction(transaction, config);\n    // }\n\n    // async requestAirdrop(\n    //     to: PublicKey,\n    //     lamports: number,\n    // ): Promise<TransactionSignature> {\n    //     return this.connection.requestAirdrop(to, lamports);\n    // }\n\n    // async getStakeMinimumDelegation(\n    //     config?: GetStakeMinimumDelegationConfig,\n    // ): Promise<RpcResponseAndContext<number>> {\n    //     return this.connection.getStakeMinimumDelegation(config);\n    // }\n\n    // async getTransactions(\n    //     signatures: TransactionSignature[],\n    //     commitmentOrConfig?: GetTransactionConfig | Finality,\n    // ): Promise<(VersionedTransactionResponse | null)[]> {\n    //     return this.connection.getTransactions(signatures, commitmentOrConfig);\n    // }\n\n    // async getTransaction(\n    //     signature: string,\n    //     rawConfig?: GetTransactionConfig,\n    // ): Promise<VersionedTransactionResponse | null> {\n    //     return this.connection.getTransaction(signature, rawConfig);\n    // }\n\n    // async getParsedTransaction(\n    //     signature: TransactionSignature,\n    //     commitmentOrConfig?: GetVersionedTransactionConfig | Finality,\n    // ): Promise<ParsedTransactionWithMeta | null> {\n    //     return this.connection.getParsedTransaction(\n    //         signature,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getParsedTransactions(\n    //     signatures: TransactionSignature[],\n    //     commitmentOrConfig?: GetVersionedTransactionConfig | Finality,\n    // ): Promise<(ParsedTransactionWithMeta | null)[]> {\n    //     return this.connection.getParsedTransactions(\n    //         signatures,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getConfirmedBlock(\n    //     slot: number,\n    //     commitment?: Finality,\n    // ): Promise<ConfirmedBlock> {\n    //     return this.connection.getConfirmedBlock(slot, commitment);\n    // }\n\n    // async getBlocks(\n    //     startSlot: number,\n    //     endSlot?: number,\n    //     commitment?: Finality,\n    // ): Promise<Array<number>> {\n    //     return this.connection.getBlocks(startSlot, endSlot, commitment);\n    // }\n\n    // async getBlockSignatures(\n    //     slot: number,\n    //     commitment?: Finality,\n    // ): Promise<BlockSignatures> {\n    //     return this.connection.getBlockSignatures(slot, commitment);\n    // }\n\n    // async getConfirmedBlockSignatures(\n    //     slot: number,\n    //     commitment?: Finality,\n    // ): Promise<BlockSignatures> {\n    //     return this.connection.getConfirmedBlockSignatures(slot, commitment);\n    // }\n\n    // confirmTransaction(\n    //     strategy: TransactionConfirmationStrategy,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<SignatureResult>>;\n\n    // /** @deprecated Instead, call `confirmTransaction` and pass in {@link TransactionConfirmationStrategy} */\n    // // eslint-disable-next-line no-dupe-class-members\n    // confirmTransaction(\n    //     strategy: TransactionSignature,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<SignatureResult>>;\n\n    // async confirmTransaction(\n    //     strategy: TransactionConfirmationStrategy | TransactionSignature,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<SignatureResult>> {\n    //     // @ts-ignore\n    //     return this.connection.confirmTransaction(strategy, commitment);\n    // }\n\n    // async getClusterNodes(): Promise<Array<ContactInfo>> {\n    //     return this.connection.getClusterNodes();\n    // }\n\n    // async getVoteAccounts(commitment?: Commitment): Promise<VoteAccountStatus> {\n    //     return this.connection.getVoteAccounts(commitment);\n    // }\n\n    // async getSlot(\n    //     commitmentOrConfig?: Commitment | GetSlotConfig,\n    // ): Promise<number> {\n    //     return this.connection.getSlot(commitmentOrConfig);\n    // }\n\n    // async getSlotLeader(\n    //     commitmentOrConfig?: Commitment | GetSlotLeaderConfig,\n    // ): Promise<string> {\n    //     return this.connection.getSlotLeader(commitmentOrConfig);\n    // }\n\n    // async getSlotLeaders(\n    //     startSlot: number,\n    //     limit: number,\n    // ): Promise<Array<PublicKey>> {\n    //     return this.connection.getSlotLeaders(startSlot, limit);\n    // }\n\n    // async getSignatureStatus(\n    //     signature: TransactionSignature,\n    //     config?: SignatureStatusConfig,\n    // ): Promise<RpcResponseAndContext<SignatureStatus | null>> {\n    //     return this.connection.getSignatureStatus(signature, config);\n    // }\n\n    // async getSignatureStatuses(\n    //     signatures: Array<TransactionSignature>,\n    //     config?: SignatureStatusConfig,\n    // ): Promise<RpcResponseAndContext<Array<SignatureStatus | null>>> {\n    //     return this.connection.getSignatureStatuses(signatures, config);\n    // }\n\n    // async getTotalSupply(commitment?: Commitment): Promise<number> {\n    //     return this.connection.getTotalSupply(commitment);\n    // }\n\n    // async getBlockHeight(config?: GetBlockHeightConfig): Promise<number> {\n    //     return this.connection.getBlockHeight(config);\n    // }\n\n    // async getBlockProduction(\n    //     configOrCommitment?: GetBlockProductionConfig | Commitment,\n    // ): Promise<RpcResponseAndContext<BlockProduction>> {\n    //     return this.connection.getBlockProduction(configOrCommitment);\n    // }\n\n    // async getTransactionCount(\n    //     config?: GetTransactionCountConfig,\n    // ): Promise<number> {\n    //     return this.connection.getTransactionCount(config);\n    // }\n\n    // async getInflationGovernor(): Promise<InflationGovernor> {\n    //     return this.connection.getInflationGovernor();\n    // }\n\n    // async getInflationReward(\n    //     addresses: PublicKey[],\n    //     epochs?: number,\n    //     config?: GetInflationRewardConfig,\n    // ): Promise<Array<InflationReward | null>> {\n    //     return this.connection.getInflationReward(addresses, epochs, config);\n    // }\n\n    // async getInflationRate(): Promise<InflationRate> {\n    //     return this.connection.getInflationRate();\n    // }\n\n    // async getEpochInfo(config?: GetEpochInfoConfig): Promise<EpochInfo> {\n    //     return this.connection.getEpochInfo(config);\n    // }\n\n    // async getEpochSchedule(): Promise<EpochSchedule> {\n    //     return this.connection.getEpochSchedule();\n    // }\n\n    // async getLeaderSchedule(): Promise<LeaderSchedule> {\n    //     return this.connection.getLeaderSchedule();\n    // }\n\n    // async getRecentBlockhashAndContext(commitment?: Commitment): Promise<\n    //     RpcResponseAndContext<{\n    //         blockhash: Blockhash;\n    //         feeCalculator: FeeCalculator;\n    //     }>\n    // > {\n    //     return this.connection.getRecentBlockhashAndContext(commitment);\n    // }\n\n    // async getRecentPerformanceSamples(\n    //     limit?: number,\n    // ): Promise<Array<PerfSample>> {\n    //     return this.connection.getRecentPerformanceSamples(limit);\n    // }\n\n    // async getFeeCalculatorForBlockhash(\n    //     blockhash: Blockhash,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<FeeCalculator | null>> {\n    //     return this.connection.getFeeCalculatorForBlockhash(\n    //         blockhash,\n    //         commitment,\n    //     );\n    // }\n\n    // async getFeeForMessage(\n    //     message: VersionedMessage,\n    //     commitment?: Commitment,\n    // ): Promise<RpcResponseAndContext<number | null>> {\n    //     return this.connection.getFeeForMessage(message, commitment);\n    // }\n\n    // async getMinimumBalanceForRentExemption(\n    //     dataLength: number,\n    //     commitment?: Commitment,\n    // ): Promise<number> {\n    //     return this.connection.getMinimumBalanceForRentExemption(\n    //         dataLength,\n    //         commitment,\n    //     );\n    // }\n\n    // async getRecentBlockhash(\n    //     commitment?: Commitment,\n    // ): Promise<{ blockhash: Blockhash; feeCalculator: FeeCalculator }> {\n    //     return this.connection.getRecentBlockhash(commitment);\n    // }\n\n    // async getGenesisHash(): Promise<string> {\n    //     return this.connection.getGenesisHash();\n    // }\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig?: GetVersionedBlockConfig,\n    // ): Promise<VersionedBlockResponse | null>;\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig: GetVersionedBlockConfig & { transactionDetails: 'accounts' },\n    // ): Promise<VersionedAccountsModeBlockResponse | null>;\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig: GetVersionedBlockConfig & { transactionDetails: 'none' },\n    // ): Promise<VersionedNoneModeBlockResponse | null>;\n    // async getBlock(\n    //     slot: number,\n    //     rawConfig?: GetVersionedBlockConfig,\n    // ): Promise<\n    //     | VersionedBlockResponse\n    //     | VersionedAccountsModeBlockResponse\n    //     | VersionedNoneModeBlockResponse\n    //     | null\n    // > {\n    //     return this.connection.getBlock(slot, rawConfig);\n    // }\n\n    // async getParsedBlock(\n    //     slot: number,\n    //     rawConfig?: GetVersionedBlockConfig,\n    // ): Promise<ParsedAccountsModeBlockResponse>;\n    // async getParsedBlock(\n    //     slot: number,\n    //     rawConfig: GetVersionedBlockConfig & { transactionDetails: 'accounts' },\n    // ): Promise<ParsedAccountsModeBlockResponse>;\n    // async getParsedBlock(\n    //     slot: number,\n    //     rawConfig: GetVersionedBlockConfig & { transactionDetails: 'none' },\n    // ): Promise<ParsedNoneModeBlockResponse>;\n    // async getParsedBlock(\n    //     slot: number,\n    //     rawConfig?: GetVersionedBlockConfig,\n    // ): Promise<\n    //     ParsedAccountsModeBlockResponse | ParsedNoneModeBlockResponse | null\n    // > {\n    //     return this.connection.getParsedBlock(slot, rawConfig);\n    // }\n\n    // async getConfirmedTransaction(\n    //     signature: TransactionSignature,\n    //     commitment?: Finality,\n    // ): Promise<ConfirmedTransaction | null> {\n    //     return this.connection.getConfirmedTransaction(signature, commitment);\n    // }\n\n    // async getParsedConfirmedTransaction(\n    //     signature: TransactionSignature,\n    //     commitment?: Finality,\n    // ): Promise<ParsedConfirmedTransaction | null> {\n    //     return this.connection.getParsedConfirmedTransaction(\n    //         signature,\n    //         commitment,\n    //     );\n    // }\n\n    // async getParsedConfirmedTransactions(\n    //     signatures: TransactionSignature[],\n    //     commitment?: Finality,\n    // ): Promise<(ParsedConfirmedTransaction | null)[]> {\n    //     return this.connection.getParsedConfirmedTransactions(\n    //         signatures,\n    //         commitment,\n    //     );\n    // }\n\n    // async getConfirmedSignaturesForAddress(\n    //     address: PublicKey,\n    //     startSlot: number,\n    //     endSlot: number,\n    // ): Promise<Array<TransactionSignature>> {\n    //     return this.connection.getConfirmedSignaturesForAddress(\n    //         address,\n    //         startSlot,\n    //         endSlot,\n    //     );\n    // }\n\n    // async getConfirmedSignaturesForAddress2(\n    //     address: PublicKey,\n    //     options?: ConfirmedSignaturesForAddress2Options,\n    //     commitment?: Finality,\n    // ): Promise<Array<ConfirmedSignatureInfo>> {\n    //     return this.connection.getConfirmedSignaturesForAddress2(\n    //         address,\n    //         options,\n    //         commitment,\n    //     );\n    // }\n\n    // async getSignaturesForAddress(\n    //     address: PublicKey,\n    //     options?: SignaturesForAddressOptions,\n    //     commitment?: Finality,\n    // ): Promise<Array<ConfirmedSignatureInfo>> {\n    //     return this.connection.getSignaturesForAddress(\n    //         address,\n    //         options,\n    //         commitment,\n    //     );\n    // }\n\n    // async getRecentPrioritizationFees(\n    //     config?: GetRecentPrioritizationFeesConfig,\n    // ): Promise<RecentPrioritizationFees[]> {\n    //     return this.connection.getRecentPrioritizationFees(config);\n    // }\n\n    // async getLatestBlockhash(\n    //     config?: GetLatestBlockhashConfig,\n    // ): Promise<BlockhashWithExpiryBlockHeight> {\n    //     return this.connection.getLatestBlockhash(config);\n    // }\n    // async getLatestBlockhashAndContext(\n    //     commitmentOrConfig?: Commitment | GetLatestBlockhashConfig,\n    // ): Promise<RpcResponseAndContext<BlockhashWithExpiryBlockHeight>> {\n    //     return this.connection.getLatestBlockhashAndContext(commitmentOrConfig);\n    // }\n\n    // async isBlockhashValid(\n    //     blockhash: Blockhash,\n    //     config?: IsBlockhashValidConfig,\n    // ): Promise<RpcResponseAndContext<boolean>> {\n    //     return this.connection.isBlockhashValid(blockhash, config);\n    // }\n\n    // async getVersion(): Promise<Version> {\n    //     return this.connection.getVersion();\n    // }\n\n    // async getAddressLookupTable(\n    //     accountKey: PublicKey,\n    //     config?: GetAccountInfoConfig,\n    // ): Promise<RpcResponseAndContext<AddressLookupTableAccount | null>> {\n    //     return this.connection.getAddressLookupTable(accountKey, config);\n    // }\n\n    // async getNonceAndContext(\n    //     nonceAccount: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetNonceAndContextConfig,\n    // ): Promise<RpcResponseAndContext<NonceAccount | null>> {\n    //     return this.connection.getNonceAndContext(\n    //         nonceAccount,\n    //         commitmentOrConfig,\n    //     );\n    // }\n\n    // async getNonce(\n    //     nonceAccount: PublicKey,\n    //     commitmentOrConfig?: Commitment | GetNonceConfig,\n    // ): Promise<NonceAccount | null> {\n    //     return this.connection.getNonce(nonceAccount, commitmentOrConfig);\n    // }\n\n    // _buildArgs(\n    //     args: Array<any>,\n    //     override?: Commitment,\n    //     encoding?: 'jsonParsed' | 'base64',\n    //     extra?: any,\n    // ): Array<any> {\n    //     const commitment = override || this.connection.commitment;\n    //     if (commitment || encoding || extra) {\n    //         let options: any = {};\n    //         if (encoding) {\n    //             options.encoding = encoding;\n    //         }\n    //         if (commitment) {\n    //             options.commitment = commitment;\n    //         }\n    //         if (extra) {\n    //             options = Object.assign(options, extra);\n    //         }\n    //         args.push(options);\n    //     }\n    //     return args;\n    // }\n\n    // private async getCancellationPromise() {\n    //     throw new Error(\n    //         'getCancellationPromise not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    //     );\n    // }\n    // private async getTransactionConfirmationPromise() {\n    //     throw new Error(\n    //         'getTransactionConfirmationPromise not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    //     );\n    // }\n    // private async confirmTransactionUsingBlockHeightExceedanceStrategy() {\n    //     throw new Error(\n    //         'confirmTransactionUsingBlockHeightExceedanceStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    //     );\n    // }\n    // async confirmTransactionUsingDurableNonceStrategy() {\n    //     throw new Error(\n    //         'confirmTransactionUsingDurableNonceStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    //     );\n    // }\n    // private async confirmTransactionUsingLegacyTimeoutStrategy({\n    //     commitment,\n    //     signature,\n    // }: {\n    //     commitment?: Commitment;\n    //     signature: string;\n    // }): Promise<RpcResponseAndContext<SignatureResult>> {\n    //     throw new Error(\n    //         'confirmTransactionUsingLegacyTimeoutStrategy not supported in rpc. it is a stub that is marked as private in web3.js Connection',\n    //     );\n    // }\n\n    /**\n     * Fetch the compressed account for the specified account hash\n     */\n    async getCompressedAccount(\n        address?: BN254,\n        hash?: BN254,\n    ): Promise<CompressedAccountWithMerkleContext | null> {\n        if (address) {\n            throw new Error('address is not supported in test-rpc');\n        }\n        if (!hash) {\n            throw new Error('hash is required');\n        }\n        // @ts-ignore\n        const account = await getCompressedAccountByHashTest(this, hash);\n        return account ?? null;\n    }\n\n    /**\n     * Fetch the compressed balance for the specified account hash\n     */\n    async getCompressedBalance(address?: BN254, hash?: BN254): Promise<BN> {\n        if (address) {\n            throw new Error('address is not supported in test-rpc');\n        }\n        if (!hash) {\n            throw new Error('hash is required');\n        }\n        // @ts-ignore\n        const account = await getCompressedAccountByHashTest(this, hash);\n        if (!account) {\n            throw new Error('Account not found');\n        }\n        return bn(account.lamports);\n    }\n\n    /**\n     * Fetch the total compressed balance for the specified owner public key\n     */\n    async getCompressedBalanceByOwner(owner: PublicKey): Promise<BN> {\n        const accounts = await this.getCompressedAccountsByOwner(owner);\n        return accounts.items.reduce(\n            (acc, account) => acc.add(account.lamports),\n            bn(0),\n        );\n    }\n\n    /**\n     * Fetch the latest merkle proof for the specified account hash from the\n     * cluster\n     */\n    async getCompressedAccountProof(\n        hash: BN254,\n    ): Promise<MerkleContextWithMerkleProof> {\n        const proofs = await this.getMultipleCompressedAccountProofs([hash]);\n        return proofs[0];\n    }\n\n    /**\n     * Fetch all the account info for multiple compressed accounts specified by\n     * an array of account hashes\n     */\n    async getMultipleCompressedAccounts(\n        hashes: BN254[],\n    ): Promise<CompressedAccountWithMerkleContext[]> {\n        // @ts-ignore\n        return await getMultipleCompressedAccountsByHashTest(this, hashes);\n    }\n    /**\n     * Ensure that the Compression Indexer has already indexed the transaction\n     */\n    async confirmTransactionIndexed(_slot: number): Promise<boolean> {\n        return true;\n    }\n    /**\n     * Fetch the latest merkle proofs for multiple compressed accounts specified\n     * by an array account hashes\n     */\n    async getMultipleCompressedAccountProofs(\n        hashes: BN254[],\n    ): Promise<MerkleContextWithMerkleProof[]> {\n        /// Build tree\n        const events: PublicTransactionEvent[] = await getParsedEvents(\n            // @ts-ignore\n            this,\n        ).then(events => events.reverse());\n        const allLeaves: number[][] = [];\n        const allLeafIndices: number[] = [];\n        for (const event of events) {\n            for (\n                let index = 0;\n                index < event.outputCompressedAccounts.length;\n                index++\n            ) {\n                const hash = event.outputCompressedAccountHashes[index];\n\n                allLeaves.push(hash);\n                allLeafIndices.push(event.outputLeafIndices[index]);\n            }\n        }\n        const tree = new MerkleTree(\n            this.depth,\n            this.lightWasm,\n            allLeaves.map(leaf => bn(leaf).toString()),\n        );\n\n        /// create merkle proofs and assemble return type\n        const merkleProofs: MerkleContextWithMerkleProof[] = [];\n\n        for (let i = 0; i < hashes.length; i++) {\n            const leafIndex = tree.indexOf(hashes[i].toString());\n            const pathElements = tree.path(leafIndex).pathElements;\n            const bnPathElements = pathElements.map(value => bn(value));\n            const root = bn(tree.root());\n            const merkleProof: MerkleContextWithMerkleProof = {\n                hash: hashes[i].toArray('be', 32),\n                merkleTree: this.merkleTreeAddress,\n                leafIndex: leafIndex,\n                merkleProof: bnPathElements,\n                nullifierQueue: this.nullifierQueueAddress,\n                rootIndex: allLeaves.length,\n                root: root,\n            };\n            merkleProofs.push(merkleProof);\n        }\n\n        /// Validate\n        merkleProofs.forEach((proof, index) => {\n            const leafIndex = proof.leafIndex;\n            const computedHash = tree.elements()[leafIndex];\n            const hashArr = bn(computedHash).toArray('be', 32);\n            if (!hashArr.every((val, index) => val === proof.hash[index])) {\n                throw new Error(\n                    `Mismatch at index ${index}: expected ${proof.hash.toString()}, got ${hashArr.toString()}`,\n                );\n            }\n        });\n\n        return merkleProofs;\n    }\n\n    /**\n     * Fetch all the compressed accounts owned by the specified public key.\n     * Owner can be a program or user account\n     */\n    async getCompressedAccountsByOwner(\n        owner: PublicKey,\n        _config?: GetCompressedAccountsByOwnerConfig,\n    ): Promise<WithCursor<CompressedAccountWithMerkleContext[]>> {\n        // @ts-ignore\n        const accounts = await getCompressedAccountsByOwnerTest(this, owner);\n        return {\n            items: accounts,\n            cursor: null,\n        };\n    }\n\n    /**\n     * Fetch the latest compression signatures on the cluster. Results are\n     * paginated.\n     */\n    async getLatestCompressionSignatures(\n        _cursor?: string,\n        _limit?: number,\n    ): Promise<LatestNonVotingSignaturesPaginated> {\n        throw new Error(\n            'getLatestNonVotingSignaturesWithContext not supported in test-rpc',\n        );\n    }\n    /**\n     * Fetch the latest non-voting signatures on the cluster. Results are\n     * not paginated.\n     */\n    async getLatestNonVotingSignatures(\n        _limit?: number,\n    ): Promise<LatestNonVotingSignatures> {\n        throw new Error(\n            'getLatestNonVotingSignaturesWithContext not supported in test-rpc',\n        );\n    }\n    /**\n     * Fetch all the compressed token accounts owned by the specified public\n     * key. Owner can be a program or user account\n     */\n    async getCompressedTokenAccountsByOwner(\n        owner: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<ParsedTokenAccount[]>> {\n        return await getCompressedTokenAccountsByOwnerTest(\n            // @ts-ignore\n            this,\n            owner,\n            options!.mint!,\n        );\n    }\n\n    /**\n     * Fetch all the compressed accounts delegated to the specified public key.\n     */\n    async getCompressedTokenAccountsByDelegate(\n        delegate: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<ParsedTokenAccount[]>> {\n        return await getCompressedTokenAccountsByDelegateTest(\n            // @ts-ignore\n            this,\n            delegate,\n            options.mint!,\n        );\n    }\n\n    /**\n     * Fetch the compressed token balance for the specified account hash\n     */\n    async getCompressedTokenAccountBalance(\n        hash: BN254,\n    ): Promise<{ amount: BN }> {\n        // @ts-ignore\n        const account = await getCompressedTokenAccountByHashTest(this, hash);\n        return { amount: bn(account.parsed.amount) };\n    }\n\n    /**\n     * @deprecated use {@link getCompressedTokenBalancesByOwnerV2}.\n     * Fetch all the compressed token balances owned by the specified public\n     * key. Can filter by mint.\n     */\n    async getCompressedTokenBalancesByOwner(\n        publicKey: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithCursor<{ balance: BN; mint: PublicKey }[]>> {\n        const accounts = await getCompressedTokenAccountsByOwnerTest(\n            // @ts-ignore\n            this,\n            publicKey,\n            options.mint!,\n        );\n        return {\n            items: accounts.items.map(account => ({\n                balance: bn(account.parsed.amount),\n                mint: account.parsed.mint,\n            })),\n            cursor: null,\n        };\n    }\n\n    /**\n     * Fetch all the compressed token balances owned by the specified public\n     * key. Can filter by mint. Uses context.\n     */\n    async getCompressedTokenBalancesByOwnerV2(\n        publicKey: PublicKey,\n        options: GetCompressedTokenAccountsByOwnerOrDelegateOptions,\n    ): Promise<WithContext<WithCursor<TokenBalance[]>>> {\n        const accounts = await getCompressedTokenAccountsByOwnerTest(\n            // @ts-ignore\n            this,\n            publicKey,\n            options.mint!,\n        );\n        return {\n            context: { slot: 1 },\n            value: {\n                items: accounts.items.map(account => ({\n                    balance: bn(account.parsed.amount),\n                    mint: account.parsed.mint,\n                })),\n                cursor: null,\n            },\n        };\n    }\n\n    /**\n     * Returns confirmed signatures for transactions involving the specified\n     * account hash forward in time from genesis to the most recent confirmed\n     * block\n     *\n     * @param hash queried account hash\n     */\n    async getCompressionSignaturesForAccount(\n        _hash: BN254,\n    ): Promise<SignatureWithMetadata[]> {\n        throw new Error(\n            'getCompressionSignaturesForAccount not implemented in test-rpc',\n        );\n    }\n\n    /**\n     * Fetch a confirmed or finalized transaction from the cluster. Return with\n     * CompressionInfo\n     */\n    async getTransactionWithCompressionInfo(\n        _signature: string,\n    ): Promise<CompressedTransaction | null> {\n        throw new Error('getCompressedTransaction not implemented in test-rpc');\n    }\n\n    /**\n     * Returns confirmed signatures for transactions involving the specified\n     * address forward in time from genesis to the most recent confirmed\n     * block\n     *\n     * @param address queried compressed account address\n     */\n    async getCompressionSignaturesForAddress(\n        _address: PublicKey,\n        _options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>> {\n        throw new Error('getSignaturesForAddress3 not implemented');\n    }\n\n    /**\n     * Returns confirmed signatures for compression transactions involving the\n     * specified account owner forward in time from genesis to the\n     * most recent confirmed block\n     *\n     * @param owner queried owner public key\n     */\n    async getCompressionSignaturesForOwner(\n        _owner: PublicKey,\n        _options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>> {\n        throw new Error('getSignaturesForOwner not implemented');\n    }\n\n    /**\n     * Returns confirmed signatures for compression transactions involving the\n     * specified token account owner forward in time from genesis to the most\n     * recent confirmed block\n     */\n    async getCompressionSignaturesForTokenOwner(\n        _owner: PublicKey,\n        _options?: PaginatedOptions,\n    ): Promise<WithCursor<SignatureWithMetadata[]>> {\n        throw new Error('getSignaturesForTokenOwner not implemented');\n    }\n\n    /**\n     * Fetch the current indexer health status\n     */\n    async getIndexerHealth(): Promise<string> {\n        return 'ok';\n    }\n\n    /**\n     * Fetch the current slot that the node is processing\n     */\n    async getIndexerSlot(): Promise<number> {\n        return 1;\n    }\n\n    /**\n     * Fetch the latest address proofs for new unique addresses specified by an\n     * array of addresses.\n     *\n     * the proof states that said address have not yet been created in respective address tree.\n     * @param addresses Array of BN254 new addresses\n     * @returns Array of validity proofs for new addresses\n     */\n    async getMultipleNewAddressProofs(addresses: BN254[]) {\n        /// Build tree\n        const indexedArray = IndexedArray.default();\n        const allAddresses: BN[] = [];\n        indexedArray.init();\n        const hashes: BN[] = [];\n        // TODO(crank): add support for cranked address tree in 'allAddresses'.\n        // The Merkle tree root doesnt actually advance beyond init() unless we\n        // start emptying the address queue.\n        for (let i = 0; i < allAddresses.length; i++) {\n            indexedArray.append(bn(allAddresses[i]));\n        }\n        for (let i = 0; i < indexedArray.elements.length; i++) {\n            const hash = indexedArray.hashElement(this.lightWasm, i);\n            hashes.push(bn(hash!));\n        }\n        const tree = new MerkleTree(\n            this.depth,\n            this.lightWasm,\n            hashes.map(hash => bn(hash).toString()),\n        );\n\n        /// Creates proof for each address\n        const newAddressProofs: MerkleContextWithNewAddressProof[] = [];\n\n        for (let i = 0; i < addresses.length; i++) {\n            const [lowElement] = indexedArray.findLowElement(addresses[i]);\n            if (!lowElement) throw new Error('Address not found');\n\n            const leafIndex = lowElement.index;\n\n            const pathElements: string[] = tree.path(leafIndex).pathElements;\n            const bnPathElements = pathElements.map(value => bn(value));\n\n            const higherRangeValue = indexedArray.get(\n                lowElement.nextIndex,\n            )!.value;\n            const root = bn(tree.root());\n\n            const proof: MerkleContextWithNewAddressProof = {\n                root,\n                rootIndex: 3,\n                value: addresses[i],\n                leafLowerRangeValue: lowElement.value,\n                leafHigherRangeValue: higherRangeValue,\n                nextIndex: bn(lowElement.nextIndex),\n                merkleProofHashedIndexedElementLeaf: bnPathElements,\n                indexHashedIndexedElementLeaf: bn(lowElement.index),\n                merkleTree: this.addressTreeAddress,\n                nullifierQueue: this.addressQueueAddress,\n            };\n            newAddressProofs.push(proof);\n        }\n        return newAddressProofs;\n    }\n\n    async getCompressedMintTokenHolders(\n        _mint: PublicKey,\n        _options?: PaginatedOptions,\n    ): Promise<WithContext<WithCursor<CompressedMintTokenHolders[]>>> {\n        throw new Error(\n            'getCompressedMintTokenHolders not implemented in test-rpc',\n        );\n    }\n\n    /**\n     * Advanced usage of getValidityProof: fetches ZKP directly from a custom\n     * non-rpcprover. Note: This uses the proverEndpoint specified in the\n     * constructor. For normal usage, please use {@link getValidityProof}\n     * instead.\n     *\n     * Note: Use RPC class for forested trees. TestRpc is only for custom\n     * testing purposes.\n     */\n    async getValidityProofDirect(\n        hashes: BN254[] = [],\n        newAddresses: BN254[] = [],\n    ): Promise<CompressedProofWithContext> {\n        return this.getValidityProof(hashes, newAddresses);\n    }\n    /**\n     * @deprecated This method is not available for TestRpc. Please use\n     * {@link getValidityProof} instead.\n     */\n    async getValidityProofAndRpcContext(\n        hashes: HashWithTree[] = [],\n        newAddresses: AddressWithTree[] = [],\n    ): Promise<WithContext<CompressedProofWithContext>> {\n        if (newAddresses.some(address => !(address instanceof BN))) {\n            throw new Error('AddressWithTree is not supported in test-rpc');\n        }\n        return {\n            value: await this.getValidityProofV0(hashes, newAddresses),\n            context: { slot: 1 },\n        };\n    }\n    /**\n     * Fetch the latest validity proof for (1) compressed accounts specified by\n     * an array of account hashes. (2) new unique addresses specified by an\n     * array of addresses.\n     *\n     * Validity proofs prove the presence of compressed accounts in state trees\n     * and the non-existence of addresses in address trees, respectively. They\n     * enable verification without recomputing the merkle proof path, thus\n     * lowering verification and data costs.\n     *\n     * @param hashes        Array of BN254 hashes.\n     * @param newAddresses  Array of BN254 new addresses.\n     * @returns             validity proof with context\n     */\n    async getValidityProof(\n        hashes: BN254[] = [],\n        newAddresses: BN254[] = [],\n    ): Promise<CompressedProofWithContext> {\n        if (newAddresses.some(address => !(address instanceof BN))) {\n            throw new Error('AddressWithTree is not supported in test-rpc');\n        }\n        let validityProof: CompressedProofWithContext;\n\n        if (hashes.length === 0 && newAddresses.length === 0) {\n            throw new Error(\n                'Empty input. Provide hashes and/or new addresses.',\n            );\n        } else if (hashes.length > 0 && newAddresses.length === 0) {\n            /// inclusion\n            const merkleProofsWithContext =\n                await this.getMultipleCompressedAccountProofs(hashes);\n            const inputs = convertMerkleProofsWithContextToHex(\n                merkleProofsWithContext,\n            );\n\n            // TODO: reactivate to handle proofs of height 32\n            // const publicInputHash = getPublicInputHash(\n            //     merkleProofsWithContext,\n            //     hashes,\n            //     [],\n            //     this.lightWasm,\n            // );\n\n            const compressedProof = await proverRequest(\n                this.proverEndpoint,\n                'inclusion',\n                inputs,\n                this.log,\n                // publicInputHash,\n            );\n            validityProof = {\n                compressedProof,\n                roots: merkleProofsWithContext.map(proof => proof.root),\n                rootIndices: merkleProofsWithContext.map(\n                    proof => proof.rootIndex,\n                ),\n                leafIndices: merkleProofsWithContext.map(\n                    proof => proof.leafIndex,\n                ),\n                leaves: merkleProofsWithContext.map(proof => bn(proof.hash)),\n                merkleTrees: merkleProofsWithContext.map(\n                    proof => proof.merkleTree,\n                ),\n                nullifierQueues: merkleProofsWithContext.map(\n                    proof => proof.nullifierQueue,\n                ),\n            };\n        } else if (hashes.length === 0 && newAddresses.length > 0) {\n            /// new-address\n            const newAddressProofs: MerkleContextWithNewAddressProof[] =\n                await this.getMultipleNewAddressProofs(newAddresses);\n\n            const inputs =\n                convertNonInclusionMerkleProofInputsToHex(newAddressProofs);\n            // const publicInputHash = getPublicInputHash(\n            //     [],\n            //     [],\n            //     newAddressProofs,\n            //     this.lightWasm,\n            // );\n            const compressedProof = await proverRequest(\n                this.proverEndpoint,\n                'new-address',\n                inputs,\n                this.log,\n                // publicInputHash,\n            );\n\n            validityProof = {\n                compressedProof,\n                roots: newAddressProofs.map(proof => proof.root),\n                // TODO(crank): make dynamic to enable forester support in\n                // test-rpc.ts. Currently this is a static root because the\n                // address tree doesn't advance.\n                rootIndices: newAddressProofs.map(_ => 3),\n                leafIndices: newAddressProofs.map(\n                    proof => proof.indexHashedIndexedElementLeaf.toNumber(), // TODO: support >32bit\n                ),\n                leaves: newAddressProofs.map(proof => bn(proof.value)),\n                merkleTrees: newAddressProofs.map(proof => proof.merkleTree),\n                nullifierQueues: newAddressProofs.map(\n                    proof => proof.nullifierQueue,\n                ),\n            };\n        } else if (hashes.length > 0 && newAddresses.length > 0) {\n            /// combined\n            const merkleProofsWithContext =\n                await this.getMultipleCompressedAccountProofs(hashes);\n            const inputs = convertMerkleProofsWithContextToHex(\n                merkleProofsWithContext,\n            );\n            const newAddressProofs: MerkleContextWithNewAddressProof[] =\n                await this.getMultipleNewAddressProofs(newAddresses);\n\n            const newAddressInputs =\n                convertNonInclusionMerkleProofInputsToHex(newAddressProofs);\n            // const publicInputHash = getPublicInputHash(\n            //     merkleProofsWithContext,\n            //     hashes,\n            //     newAddressProofs,\n            //     this.lightWasm,\n            // );\n            const compressedProof = await proverRequest(\n                this.proverEndpoint,\n                'combined',\n                [inputs, newAddressInputs],\n                this.log,\n                // publicInputHash,\n            );\n\n            validityProof = {\n                compressedProof,\n                roots: merkleProofsWithContext\n                    .map(proof => proof.root)\n                    .concat(newAddressProofs.map(proof => proof.root)),\n                rootIndices: merkleProofsWithContext\n                    .map(proof => proof.rootIndex)\n                    // TODO(crank): make dynamic to enable forester support in\n                    // test-rpc.ts. Currently this is a static root because the\n                    // address tree doesn't advance.\n                    .concat(newAddressProofs.map(_ => 3)),\n                leafIndices: merkleProofsWithContext\n                    .map(proof => proof.leafIndex)\n                    .concat(\n                        newAddressProofs.map(\n                            proof =>\n                                proof.indexHashedIndexedElementLeaf.toNumber(), // TODO: support >32bit\n                        ),\n                    ),\n                leaves: merkleProofsWithContext\n                    .map(proof => bn(proof.hash))\n                    .concat(newAddressProofs.map(proof => bn(proof.value))),\n                merkleTrees: merkleProofsWithContext\n                    .map(proof => proof.merkleTree)\n                    .concat(newAddressProofs.map(proof => proof.merkleTree)),\n                nullifierQueues: merkleProofsWithContext\n                    .map(proof => proof.nullifierQueue)\n                    .concat(\n                        newAddressProofs.map(proof => proof.nullifierQueue),\n                    ),\n            };\n        } else throw new Error('Invalid input');\n\n        return validityProof;\n    }\n\n    async getValidityProofV0(\n        hashes: HashWithTree[] = [],\n        newAddresses: AddressWithTree[] = [],\n    ): Promise<CompressedProofWithContext> {\n        /// TODO(swen): add support for custom trees\n        return this.getValidityProof(\n            hashes.map(hash => hash.hash),\n            newAddresses.map(address => address.address),\n        );\n    }\n}\n"],"names":["module","exports","assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","prototype","constructor","BN","number","base","endian","isBN","this","negative","words","length","red","_init","Buffer","wordSize","window","require","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","start","end","mul","b","len","Math","min","i","move","dest","src","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","ceil","j","w","off","_strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","_move","clone","_expand","size","_normSign","Symbol","for","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","a","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modrn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","res","allocUnsafe","allocate","_toArrayLikeLE","position","shift","_toArrayLikeBE","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","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","add","sub","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","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","mulTo","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","bits","s","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","m","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","p","acc","modn","egcd","x","y","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","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","name","n","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","FIELD_SIZE","HIGHEST_ADDRESS_PLUS_ONE","noopProgram","lightProgram","accountCompressionProgram","getRegisteredProgramPda","PublicKey","getAccountCompressionAuthority","findProgramAddressSync","from","defaultStaticAccounts","defaultStaticAccountsStruct","registeredProgramPda","accountCompressionAuthority","cpiSignatureAccount","defaultTestStateTreeAccounts","nullifierQueue","nullifierQueuePubkey","merkleTree","merkletreePubkey","merkleTreeHeight","DEFAULT_MERKLE_TREE_HEIGHT","addressTree","addressQueue","confirmConfig","commitment","preflightCommitment","DEFAULT_MERKLE_TREE_ROOTS","UTXO_MERGE_THRESHOLD","UTXO_MERGE_MAXIMUM","TRANSACTION_MERKLE_TREE_ROLLOVER_THRESHOLD","floor","STATE_MERKLE_TREE_ROLLOVER_FEE","ADDRESS_QUEUE_ROLLOVER_FEE","STATE_MERKLE_TREE_NETWORK_FEE","ADDRESS_TREE_NETWORK_FEE","basex","ALPHABET","BASE_MAP","Uint8Array","charAt","xc","TypeError","LEADER","FACTOR","log","iFACTOR","decodeUnsafe","source","psz","zeroes","b256","it3","it4","vch","encode","ArrayBuffer","isView","buffer","byteOffset","pbegin","pend","b58","it1","it2","repeat","decode","bn","createBN254","bs58","bigintNumber","enforceSize","encodeBN254toBase58","bn254Buffer","createCompressedAccount","owner","lamports","data","address","createCompressedAccountWithMerkleContext","merkleContext","readOnly","createMerkleContext","hash","leafIndex","Number","isSafeInteger","bytes","lengths","includes","exists","instance","checkFinished","destroyed","finished","U32_MASK64","BigInt","_32n","fromBig","le","l","lst","Ah","Uint32Array","Al","isLE","byteSwap32","arr","toBytes","TextEncoder","utf8ToBytes","abytes","Hash","_cloneInto","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","_0n","_1n","_2n","_7n","_256n","_0x71n","round","R","push","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlBH","rotlSH","rotlL","rotlBL","rotlSL","Keccak","blockLen","suffix","outputLen","enableXOF","rounds","super","pos","posOut","state","state32","keccak","idx1","idx0","B0","B1","Th","Tl","curH","curL","PI","fill","keccakP","update","take","finish","writeInto","bufferOut","set","subarray","xofInto","xof","digestInto","destroy","digest","to","keccak_256","hashCons","hashC","create","wrapConstructor","gen","byteArrayToKeypair","byteArray","Keypair","fromSecretKey","toHex","value","bufToDecStr","buf","isSmallerThanBn254FieldSizeBe","hashToBn254FieldSizeBe","bumpSeed","inputWithBumpSeed","concat","hashvToBn254FieldSizeBe","hasher","pushUniqueItems","items","map","forEach","item","toCamelCase","obj","v","Object","keys","reduce","result","key","$1","toUpperCase","vitest","it","expect","describe","toEqual","toBe","reverse","refResult","async","not","toBeNull","toBeInstanceOf","toBeLessThanOrEqual","test_key","testKey","anotherTestKey","array_key","arrayKey","anotherArrayKey","getIndexOrAdd","accountsArray","findIndex","existingKey","equals","padOutputStateMerkleTrees","outputStateMerkleTrees","numberOfOutputCompressedAccounts","inputCompressedAccountsWithMerkleContext","treesArray","slice","toAccountMetas","remainingAccounts","account","pubkey","isWritable","isSigner","packCompressedAccounts","inputCompressedAccounts","inputStateRootIndices","outputCompressedAccounts","_remainingAccounts","packedInputCompressedAccounts","packedOutputCompressedAccounts","merkleTreePubkeyIndex","nullifierQueuePubkeyIndex","compressedAccount","queueIndex","rootIndex","paddedOutputStateMerkleTrees","merkleTreeIndex","validateSufficientBalance","balance","validateSameOwner","compressedAccounts","zerothOwner","every","deriveAddressSeed","seeds","programId","deriveAddress","seed","addressMerkleTreePubkey","packNewAddressParams","newAddressParams","newAddressParamsPacked","addressMerkleTreeRootIndex","addressMerkleTreeAccountIndex","addressQueueAccountIndex","params","addressQueuePubkey","toStrictEqual","derivedAddress","packedParams","airdropSol","connection","recipientPublicKey","txHash","requestAirdrop","confirmTransaction","signature","confirmation","latestBlockHash","getLatestBlockhash","strategy","lastValidBlockHeight","blockhash","placeholderValidityProof","_","checkValidityProofShape","proof","proofFromJsonStruct","json","proofAX","deserializeHexStringToBeBytes","ar","proofAY","proofA","proofBX0","bs","proofBX1","proofBY0","proofBY1","proofB","proofCX","krs","proofCY","negateAndCompressProof","proofC","aXElement","proofAIsPositive","yElementIsPositiveG1","addBitmaskToByte","bXElement","bYElement","proofBIsPositive","yElement1","yElement2","fieldMidpoint","yElementIsPositiveG2","cXElement","cYElement","proofCIsPositive","hexStr","startsWith","substring","yElement","byte","yIsPositive","TEST_JSON","COMPRESSED_PROOF_A","COMPRESSED_PROOF_B","COMPRESSED_PROOF_C","compressedProof","validityProof","validProof","toThrow","invalidProof","pipe","initialFunction","functions","initialValue","currentValue","currentFunction","addOneMultiplyByTwoSubtractThree","buildTx","instructions","payerPublicKey","lookupTableAccounts","messageV0","TransactionMessage","payerKey","recentBlockhash","compileToV0Message","VersionedTransaction","sendAndConfirmTx","rpc","tx","confirmOptions","blockHashCtx","txId","sendTransaction","transactionConfirmationStrategy0","slot","context","confirmTransactionIndexed","confirmTx","transactionConfirmationStrategy","buildAndSignTx","payer","additionalSigners","allSigners","publicKey","sign","sleep","ms","Promise","resolve","setTimeout","ALICE","getTestKeypair","BOB","CHARLIE","DAVE","newAccountWithLamports","counter","sig","getConnection","Connection","generate","fromSeed","keypair","keypair2","toBeDefined","secretKey","testFn","kp1","kp2","initialKeypair","nextKeypair","nextNextKeypair","nextNextNextKeypair","calculateComputeUnitPrice","targetLamports","computeUnits","__importDefault","__esModule","default","defineProperty","array","rustEnum","vecU8","tagged","vec","bool","option","i256","u256","i128","u128","u64","struct","f64","f32","i32","u32","i16","u16","i8","u8","buffer_layout_1","require$$0","web3_js_1","require$$1","bn_js_1","require$$2","buffer_layout_2","enumerable","get","s8","s16","s32","BNLayout","Layout","span","signed","property","blob","offset","i64","WrappedLayout","layout","decoder","encoder","getSpan","OptionLayout","discriminator","decodeBool","encodeBool","elementLayout","seq","values","tag","wrappedLayout","replicate","receivedTag","variants","discriminant","unionLayout","union","variant","addVariant","MapEntryLayout","keyLayout","valueLayout","keyBytes","Map","entries","CompressedAccountLayout","MerkleContextLayout","NewAddressParamsLayout","InstructionDataInvokeLayout","encodeInstructionDataInvoke","alloc","dataBuffer","lengthBuffer","writeUInt32LE","decodeInstructionDataInvoke","invokeAccountsLayout","accounts","defaultPubkey","LightSystemProgram","feePayer","authority","solPoolPda","decompressionRecipient","systemProgram","PublicTransactionEventLayout","encodePublicTransactionEvent","decodePublicTransactionEvent","sumUpLamports","SOL_POOL_PDA_SEED","static","deriveCompressedSolPda","createTransferOutputState","toAddress","changeLamports","createDecompressOutputState","createNewAddressOutputState","createAccount","newAddress","recentValidityProof","outputStateTree","relayFee","compressOrDecompressLamports","isCompress","SystemProgram","TransactionInstruction","transfer","recentInputStateRootIndices","outputStateTrees","compress","outputCompressedAccount","decompress","selectMinCompressedSolAccountsForTransfer","transferLamports","accumulatedLamports","selectedAccounts","sort","ix","ComputeBudgetProgram","setComputeUnitLimit","units","getValidityProofV0","tree","queue","rootIndices","merkleTrees","nullifierQueues","createAccountWithLamports","getCompressedAccountsByOwner","inputAccounts","getValidityProof","recipient","userCompressedAccountsWithMerkleContext","inputLamports","dedupeSigner","signer","signers","filter","cursor","batchConfig","filters","dataSlice","limit","batch","signedTx","UtxoErrorCode","SelectInUtxosErrorCode","CreateUtxoErrorCode","RpcErrorCode","LookupTableErrorCode","HashErrorCode","ProofErrorCode","MerkleTreeErrorCode","UtilsErrorCode","MetaError","code","functionName","codeMessage","UtxoError","SelectInUtxosError","CreateUtxoError","RpcError","LookupTableError","HashError","ProofError","MerkleTreeError","UtilsError","BaseRpc","getCancellationPromise","getTransactionConfirmationPromise","confirmTransactionUsingBlockHeightExceedanceStrategy","confirmTransactionUsingDurableNonceStrategy","confirmTransactionUsingLegacyTimeoutStrategy","PublicKeyFromString","coerce","ArrayFromString","BN254FromString","BNFromInt","Base64EncodedCompressedAccountDataResult","createRpcResult","pick","jsonrpc","literal","id","error","unknown","message","nullable","any","UnknownRpcResult","jsonRpcResult","schema","jsonRpcResultAndContext","CompressedAccountResult","dataHash","slotCreated","TokenDataResult","mint","amount","delegate","CompressedTokenAccountResult","tokenData","MultipleCompressedAccountsResult","CompressedAccountsByOwnerResult","CompressedTokenAccountsByOwnerOrDelegateResult","SlotResult","HealthResult","LatestNonVotingSignaturesResult","blockTime","LatestNonVotingSignaturesResultPaginated","MerkeProofResult","rootSeq","root","NewAddressProofResult","nextIndex","lowerRangeAddress","higherRangeAddress","lowElementLeafIndex","CompressedProofResult","ValidityProofResult","leafIndices","leaves","roots","MultipleMerkleProofsResult","BalanceResult","NativeBalanceResult","TokenBalanceResult","TokenBalanceListResult","tokenBalances","TokenBalanceListResultV2","CompressedMintTokenHoldersResult","AccountProofResult","toUnixTimestamp","Date","getTime","SignatureListResult","SignatureListWithCursorResult","CompressedTransactionResult","compressionInfo","closedAccounts","optionalTokenData","openedAccounts","transaction","parseAccountData","getCompressedTokenAccountsByOwnerOrDelegate","ownerOrDelegate","options","filterByDelegate","endpoint","propertyToCheck","unsafeRes","rpcRequest","compressionApiEndpoint","toBase58","SolanaJSONRPCError","_account","_tokenData","mockNullifierQueue","parsed","indexOf","tlv","buildCompressedAccountWithMaybeTokenData","accountStructWithOptionalTokenData","compressedAccountResult","tokenDataResult","maybeTokenData","createRpc","endpointOrWeb3JsConnection","proverEndpoint","config","rpcEndpoint","Rpc","method","convertToCamelCase","body","JSON","stringify","response","fetch","headers","ok","status","proverRequest","circuitType","stateTreeHeight","addressTreeHeight","newAddresses","statusText","convertMerkleProofsWithContextToHex","merkleProofsWithContext","inputs","pathIndex","pathElements","merkleProof","hex","leaf","convertNonInclusionMerkleProofInputsToHex","nonInclusionMerkleProofInputs","indexHashedIndexedElementLeaf","merkleProofHashedIndexedElementLeaf","leafLowerRangeValue","leafHigherRangeValue","calculateTwoInputsHashChain","hashesFirst","hashesSecond","lightWasm","hashChain","poseidonHashBN","getPublicInputHash","accountProofs","accountHashes","newAddressProofs","inclusionHashChain","newAddressHashes","nonInclusionHashChain","mockAddressQueue","getBalanceAndContext","commitmentOrConfig","getBalance","getBlockTime","getMinimumLedgerSlot","getFirstAvailableBlock","getSupply","getTokenSupply","tokenMintAddress","getTokenAccountBalance","tokenAddress","getTokenAccountsByOwner","ownerAddress","getParsedTokenAccountsByOwner","getLargestAccounts","getTokenLargestAccounts","mintAddress","getAccountInfoAndContext","getParsedAccountInfo","getAccountInfo","getMultipleParsedAccounts","publicKeys","rawConfig","getMultipleAccountsInfoAndContext","getMultipleAccountsInfo","getStakeActivation","epoch","getProgramAccounts","configOrCommitment","getParsedProgramAccounts","getParsedBlock","getConfirmedTransaction","getParsedConfirmedTransaction","getParsedConfirmedTransactions","signatures","getConfirmedSignaturesForAddress","startSlot","endSlot","getConfirmedSignaturesForAddress2","getSignaturesForAddress","getRecentPrioritizationFees","getLatestBlockhashAndContext","isBlockhashValid","getVersion","getAddressLookupTable","accountKey","getNonceAndContext","nonceAccount","getNonce","getCompressedAccount","getCompressedBalance","getCompressedBalanceByOwner","getCompressedAccountProof","getMultipleCompressedAccounts","hashes","join","getMultipleCompressedAccountProofs","merkleProofs","getCompressedTokenAccountsByOwner","getCompressedTokenAccountsByDelegate","getCompressedTokenAccountBalance","getCompressedTokenBalancesByOwner","tokenBalance","getCompressedTokenBalancesByOwnerV2","maybeFiltered","getCompressionSignaturesForAccount","getTransactionWithCompressionInfo","calculateTokenBalances","balances","preTokenBalances","postTokenBalances","getCompressionSignaturesForAddress","getCompressionSignaturesForOwner","getCompressionSignaturesForTokenOwner","getIndexerHealth","startTime","now","getIndexerSlot","getCompressedMintTokenHolders","getLatestCompressionSignatures","getLatestNonVotingSignatures","getMultipleNewAddressProofs","addresses","_proof","getValidityProofDirect","newAddressInputs","defaultAddressTreePublicKey","defaultAddressQueuePublicKey","defaultStateTreePublicKey","defaultStateQueuePublicKey","formattedHashes","formattedNewAddresses","getValidityProofAndRpcContext","newAddressesWithTrees","IndexedElement","other","compareTo","nextValue","poseidonHash","IndexedElementBundle","newLowElement","newElement","newElementNextValue","IndexedArray","elements","currentNodeIndex","highestElementIndex","isEmpty","findElement","find","node","init","init_value","append","findLowElementIndex","findLowElement","lowElementIndex","lowElement","hashElement","element","nextElement","appendWithLowElementIndex","newElementBundle","newElementWithLowElementIndex","lowest","newElementIndex","DEFAULT_ZERO","MerkleTree","levels","capacity","zeroElement","_zeros","_layers","_lightWasm","poseidonHashString","_rebuild","level","insert","bulkInsert","isNaN","path","pathIndices","comparator","el","serialize","deserialize","hashFunction","assign","_hash","getParsedEvents","transactionEvents","getParsedTransactions","maxSupportedTransactionVersion","accountKeys","some","parseEvents","parsePublicTransactionEventWithIdl","indexerEventsTransactions","deserializeFn","transactions","meta","err","innerInstructions","ixInner","decodedEvent","numericData","getCompressedAccountByHashTest","getCompressedAccountsForTest","events","allOutputAccounts","allInputAccountHashes","event","outputCompressedAccountHashes","outputLeafIndices","withCtx","inputCompressedAccountHashes","unspentAccounts","tokenProgramId","TokenDataLayout","parseTokenLayoutWithIdl","getCompressedTokenAccounts","eventsWithParsedTokenTlvData","all","pubkeyArray","outputHashes","outputCompressedAccountsWithParsedTokenData","parsedData","parseEventWithTokenTlvData","allOutCompressedAccounts","flatMap","allInCompressedAccountHashes","getCompressedTokenAccountsByOwnerTest","getCompressedTokenAccountsByDelegateTest","getCompressedTokenAccountByHashTest","filtered","getTestRpc","merkleTreeAddress","nullifierQueueAddress","depth","defaultAccounts","TestRpc","addressTreeAddress","addressQueueAddress","connectionConfig","testRpcConfig","getMultipleCompressedAccountsByHashTest","_slot","then","allLeaves","allLeafIndices","bnPathElements","computedHash","hashArr","_config","getCompressedAccountsByOwnerTest","_cursor","_limit","_signature","_address","_options","_owner","indexedArray","allAddresses","higherRangeValue","_mint"],"mappings":"itBAAA,SAAWA,EAAQC,GAIjB,SAASC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,mBAClC,CAID,SAASE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASC,UAAYH,EAAUG,UAC/BJ,EAAKI,UAAY,IAAID,EACrBH,EAAKI,UAAUC,YAAcL,CAC9B,CAID,SAASM,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKG,OAAS,EAGdH,KAAKI,IAAM,KAEI,OAAXR,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKK,MAAMT,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAEjD,CAUD,IAAIQ,EATkB,qBACbvB,QAAUY,EAEjBZ,EAAQY,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGY,SAAW,GAGd,IAEID,EADoB,oBAAXE,aAAmD,IAAlBA,OAAOF,OACxCE,OAAOF,OAEPG,QAAQ,UAAUH,MAE9B,CAAC,MAAOI,GACR,CA+HD,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEX9B,EAAO,EAAO,wBAA0B4B,EAE3C,CAED,SAASI,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,CACR,CA6CD,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAInC,IAHA,IAAIL,EAAI,EACJM,EAAI,EACJC,EAAMC,KAAKC,IAAIP,EAAIjB,OAAQmB,GACtBM,EAAIP,EAAOO,EAAIH,EAAKG,IAAK,CAChC,IAAId,EAAIM,EAAIL,WAAWa,GAAK,GAE5BV,GAAKK,EAIHC,EADEV,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAEN9B,EAAO8B,GAAK,GAAKU,EAAID,EAAK,qBAC1BL,GAAKM,CACN,CACD,OAAON,CACR,CA2DD,SAASW,EAAMC,EAAMC,GACnBD,EAAK5B,MAAQ6B,EAAI7B,MACjB4B,EAAK3B,OAAS4B,EAAI5B,OAClB2B,EAAK7B,SAAW8B,EAAI9B,SACpB6B,EAAK1B,IAAM2B,EAAI3B,GAChB,CAqCD,GA9TAT,EAAGI,KAAO,SAAeiC,GACvB,OAAIA,aAAerC,EACV,EAGM,OAARqC,GAA+B,iBAARA,GAC5BA,EAAItC,YAAYa,WAAaZ,EAAGY,UAAY0B,MAAMC,QAAQF,EAAI9B,MACpE,EAEEP,EAAGwC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACX,EAEE1C,EAAGgC,IAAM,SAAcS,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACX,EAEE1C,EAAGF,UAAUY,MAAQ,SAAeT,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAKuC,YAAY3C,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAKwC,WAAW5C,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETb,EAAOa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIwB,EAAQ,EACM,OAFlBzB,EAASA,EAAO6C,WAAWC,QAAQ,OAAQ,KAEhC,KACTrB,IACArB,KAAKC,SAAW,GAGdoB,EAAQzB,EAAOO,SACJ,KAATN,EACFG,KAAK2C,UAAU/C,EAAQyB,EAAOvB,IAE9BE,KAAK4C,WAAWhD,EAAQC,EAAMwB,GACf,OAAXvB,GACFE,KAAKwC,WAAWxC,KAAK6C,UAAWhD,EAAMC,IAIhD,EAEEH,EAAGF,UAAU8C,YAAc,SAAsB3C,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAU,SAATN,GACdI,KAAKG,OAAS,GACLP,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKG,OAAS,IAEdnB,EAAOY,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKG,OAAS,GAGD,OAAXL,GAGJE,KAAKwC,WAAWxC,KAAK6C,UAAWhD,EAAMC,EAC1C,EAEEH,EAAGF,UAAU+C,WAAa,SAAqB5C,EAAQC,EAAMC,GAG3D,GADAd,EAAgC,iBAAlBY,EAAOO,QACjBP,EAAOO,QAAU,EAGnB,OAFAH,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EACPH,KAGTA,KAAKG,OAASuB,KAAKoB,KAAKlD,EAAOO,OAAS,GACxCH,KAAKE,MAAQ,IAAI+B,MAAMjC,KAAKG,QAC5B,IAAK,IAAIyB,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC/B5B,KAAKE,MAAM0B,GAAK,EAGlB,IAAImB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXnD,EACF,IAAK8B,EAAIhC,EAAOO,OAAS,EAAG4C,EAAI,EAAGnB,GAAK,EAAGA,GAAK,EAC9CoB,EAAIpD,EAAOgC,GAAMhC,EAAOgC,EAAI,IAAM,EAAMhC,EAAOgC,EAAI,IAAM,GACzD5B,KAAKE,MAAM6C,IAAOC,GAAKC,EAAO,SAC9BjD,KAAKE,MAAM6C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXjD,EACT,IAAK8B,EAAI,EAAGmB,EAAI,EAAGnB,EAAIhC,EAAOO,OAAQyB,GAAK,EACzCoB,EAAIpD,EAAOgC,GAAMhC,EAAOgC,EAAI,IAAM,EAAMhC,EAAOgC,EAAI,IAAM,GACzD5B,KAAKE,MAAM6C,IAAOC,GAAKC,EAAO,SAC9BjD,KAAKE,MAAM6C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAO/C,KAAKkD,QAChB,EA0BEvD,EAAGF,UAAUkD,UAAY,SAAoB/C,EAAQyB,EAAOvB,GAE1DE,KAAKG,OAASuB,KAAKoB,MAAMlD,EAAOO,OAASkB,GAAS,GAClDrB,KAAKE,MAAQ,IAAI+B,MAAMjC,KAAKG,QAC5B,IAAK,IAAIyB,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC/B5B,KAAKE,MAAM0B,GAAK,EAIlB,IAGIoB,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAXjD,EACF,IAAK8B,EAAIhC,EAAOO,OAAS,EAAGyB,GAAKP,EAAOO,GAAK,EAC3CoB,EAAIhC,EAAapB,EAAQyB,EAAOO,IAAMqB,EACtCjD,KAAKE,MAAM6C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL/C,KAAKE,MAAM6C,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKrB,GADahC,EAAOO,OAASkB,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOO,EAAIhC,EAAOO,OAAQyB,GAAK,EAC1EoB,EAAIhC,EAAapB,EAAQyB,EAAOO,IAAMqB,EACtCjD,KAAKE,MAAM6C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL/C,KAAKE,MAAM6C,IAAMC,IAAM,IAEvBC,GAAO,EAKbjD,KAAKkD,QACT,EA6BEvD,EAAGF,UAAUmD,WAAa,SAAqBhD,EAAQC,EAAMwB,GAE3DrB,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EAGd,IAAK,IAAIgD,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWvD,EAClEsD,IAEFA,IACAC,EAAWA,EAAUvD,EAAQ,EAO7B,IALA,IAAIwD,EAAQzD,EAAOO,OAASkB,EACxBiC,EAAMD,EAAQF,EACd7B,EAAMI,KAAKC,IAAI0B,EAAOA,EAAQC,GAAOjC,EAErCkC,EAAO,EACF3B,EAAIP,EAAOO,EAAIN,EAAKM,GAAKuB,EAChCI,EAAOpC,EAAUvB,EAAQgC,EAAGA,EAAIuB,EAAStD,GAEzCG,KAAKwD,MAAMJ,GACPpD,KAAKE,MAAM,GAAKqD,EAAO,SACzBvD,KAAKE,MAAM,IAAMqD,EAEjBvD,KAAKyD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOpC,EAAUvB,EAAQgC,EAAGhC,EAAOO,OAAQN,GAEtC+B,EAAI,EAAGA,EAAI0B,EAAK1B,IACnB8B,GAAO7D,EAGTG,KAAKwD,MAAME,GACP1D,KAAKE,MAAM,GAAKqD,EAAO,SACzBvD,KAAKE,MAAM,IAAMqD,EAEjBvD,KAAKyD,OAAOF,EAEf,CAEDvD,KAAKkD,QACT,EAEEvD,EAAGF,UAAUkE,KAAO,SAAe7B,GACjCA,EAAK5B,MAAQ,IAAI+B,MAAMjC,KAAKG,QAC5B,IAAK,IAAIyB,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC/BE,EAAK5B,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAE7BE,EAAK3B,OAASH,KAAKG,OACnB2B,EAAK7B,SAAWD,KAAKC,SACrB6B,EAAK1B,IAAMJ,KAAKI,GACpB,EASET,EAAGF,UAAUmE,MAAQ,SAAgB9B,GACnCD,EAAKC,EAAM9B,KACf,EAEEL,EAAGF,UAAUoE,MAAQ,WACnB,IAAI3C,EAAI,IAAIvB,EAAG,MAEf,OADAK,KAAK2D,KAAKzC,GACHA,CACX,EAEEvB,EAAGF,UAAUqE,QAAU,SAAkBC,GACvC,KAAO/D,KAAKG,OAAS4D,GACnB/D,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,OAAOH,IACX,EAGEL,EAAGF,UAAUyD,OAAS,WACpB,KAAOlD,KAAKG,OAAS,GAAqC,IAAhCH,KAAKE,MAAMF,KAAKG,OAAS,IACjDH,KAAKG,SAEP,OAAOH,KAAKgE,WAChB,EAEErE,EAAGF,UAAUuE,UAAY,WAKvB,OAHoB,IAAhBhE,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACX,EAIwB,oBAAXiE,QAAgD,mBAAfA,OAAOC,IACjD,IACEvE,EAAGF,UAAUwE,OAAOC,IAAI,+BAAiCC,CAC1D,CAAC,MAAOzD,GACPf,EAAGF,UAAU0E,QAAUA,CACxB,MAEDxE,EAAGF,UAAU0E,QAAUA,EAGzB,SAASA,IACP,OAAQnE,KAAKI,IAAM,UAAY,SAAWJ,KAAKyC,SAAS,IAAM,GAC/D,CAgCD,IAAI2B,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,UA4mB9D,SAASC,EAAYC,EAAMxC,EAAKyC,GAC9BA,EAAIxE,SAAW+B,EAAI/B,SAAWuE,EAAKvE,SACnC,IAAIwB,EAAO+C,EAAKrE,OAAS6B,EAAI7B,OAAU,EACvCsE,EAAItE,OAASsB,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIiD,EAAoB,EAAhBF,EAAKtE,MAAM,GACfsB,EAAmB,EAAfQ,EAAI9B,MAAM,GACdgB,EAAIwD,EAAIlD,EAERmD,EAAS,SAAJzD,EACL0D,EAAS1D,EAAI,SAAa,EAC9BuD,EAAIvE,MAAM,GAAKyE,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAIpD,EAAKoD,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOtD,KAAKC,IAAIkD,EAAG7C,EAAI7B,OAAS,GAC3B4C,EAAIrB,KAAKS,IAAI,EAAG0C,EAAIL,EAAKrE,OAAS,GAAI4C,GAAKiC,EAAMjC,IAAK,CAC7D,IAAInB,EAAKiD,EAAI9B,EAAK,EAIlB+B,IADA5D,GAFAwD,EAAoB,EAAhBF,EAAKtE,MAAM0B,KACfJ,EAAmB,EAAfQ,EAAI9B,MAAM6C,IACFgC,GACG,SAAa,EAC5BA,EAAY,SAAJ7D,CACT,CACDuD,EAAIvE,MAAM2E,GAAa,EAARE,EACfH,EAAiB,EAATE,CACT,CAOD,OANc,IAAVF,EACFH,EAAIvE,MAAM2E,GAAa,EAARD,EAEfH,EAAItE,SAGCsE,EAAIvB,QACZ,CAhpBDvD,EAAGF,UAAUgD,SAAW,SAAmB5C,EAAMoF,GAI/C,IAAIR,EACJ,GAHAQ,EAAoB,EAAVA,GAAe,EAGZ,MAJbpF,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjC4E,EAAM,GAGN,IAFA,IAAIxB,EAAM,EACN2B,EAAQ,EACHhD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CACpC,IAAIoB,EAAIhD,KAAKE,MAAM0B,GACf2B,GAA+B,UAArBP,GAAKC,EAAO2B,IAAmBnC,SAAS,IACtDmC,EAAS5B,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACPrB,KAGA6C,EADY,IAAVG,GAAehD,IAAM5B,KAAKG,OAAS,EAC/BiE,EAAM,EAAIb,EAAKpD,QAAUoD,EAAOkB,EAEhClB,EAAOkB,CAEhB,CAID,IAHc,IAAVG,IACFH,EAAMG,EAAMnC,SAAS,IAAMgC,GAEtBA,EAAItE,OAAS8E,GAAY,GAC9BR,EAAM,IAAMA,EAKd,OAHsB,IAAlBzE,KAAKC,WACPwE,EAAM,IAAMA,GAEPA,CACR,CAED,GAAI5E,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIqF,EAAYb,EAAWxE,GAEvBsF,EAAYb,EAAWzE,GAC3B4E,EAAM,GACN,IAAI3D,EAAId,KAAK6D,QAEb,IADA/C,EAAEb,SAAW,GACLa,EAAEsE,UAAU,CAClB,IAAIlE,EAAIJ,EAAEuE,MAAMF,GAAW1C,SAAS5C,GAMlC4E,GALF3D,EAAIA,EAAEwE,MAAMH,IAELC,SAGClE,EAAIuD,EAFJL,EAAMc,EAAYhE,EAAEf,QAAUe,EAAIuD,CAI3C,CAID,IAHIzE,KAAKoF,WACPX,EAAM,IAAMA,GAEPA,EAAItE,OAAS8E,GAAY,GAC9BR,EAAM,IAAMA,EAKd,OAHsB,IAAlBzE,KAAKC,WACPwE,EAAM,IAAMA,GAEPA,CACR,CAEDzF,EAAO,EAAO,kCAClB,EAEEW,EAAGF,UAAU8F,SAAW,WACtB,IAAIC,EAAMxF,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKG,OACPqF,GAAuB,SAAhBxF,KAAKE,MAAM,GACO,IAAhBF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,GAEzCsF,GAAO,iBAAoC,SAAhBxF,KAAKE,MAAM,GAC7BF,KAAKG,OAAS,GACvBnB,EAAO,EAAO,8CAEU,IAAlBgB,KAAKC,UAAmBuF,EAAMA,CAC1C,EAEE7F,EAAGF,UAAUgG,OAAS,WACpB,OAAOzF,KAAKyC,SAAS,GAAI,EAC7B,EAEMnC,IACFX,EAAGF,UAAUiG,SAAW,SAAmB5F,EAAQK,GACjD,OAAOH,KAAK2F,YAAYrF,EAAQR,EAAQK,EAC9C,GAGER,EAAGF,UAAUoD,QAAU,SAAkB/C,EAAQK,GAC/C,OAAOH,KAAK2F,YAAY1D,MAAOnC,EAAQK,EAC3C,EASER,EAAGF,UAAUkG,YAAc,SAAsBC,EAAW9F,EAAQK,GAClEH,KAAKkD,SAEL,IAAI2C,EAAa7F,KAAK6F,aAClBC,EAAY3F,GAAUuB,KAAKS,IAAI,EAAG0D,GACtC7G,EAAO6G,GAAcC,EAAW,yCAChC9G,EAAO8G,EAAY,EAAG,+BAEtB,IAAIC,EAfS,SAAmBH,EAAW7B,GAC3C,OAAI6B,EAAUI,YACLJ,EAAUI,YAAYjC,GAExB,IAAI6B,EAAU7B,EACzB,CAUckC,CAASL,EAAWE,GAG9B,OADA9F,KAAK,gBADoB,OAAXF,EAAkB,KAAO,OACRiG,EAAKF,GAC7BE,CACX,EAEEpG,EAAGF,UAAUyG,eAAiB,SAAyBH,GAIrD,IAHA,IAAII,EAAW,EACXvB,EAAQ,EAEHhD,EAAI,EAAGwE,EAAQ,EAAGxE,EAAI5B,KAAKG,OAAQyB,IAAK,CAC/C,IAAI2B,EAAQvD,KAAKE,MAAM0B,IAAMwE,EAASxB,EAEtCmB,EAAII,KAAqB,IAAP5C,EACd4C,EAAWJ,EAAI5F,SACjB4F,EAAII,KAAe5C,GAAQ,EAAK,KAE9B4C,EAAWJ,EAAI5F,SACjB4F,EAAII,KAAe5C,GAAQ,GAAM,KAGrB,IAAV6C,GACED,EAAWJ,EAAI5F,SACjB4F,EAAII,KAAe5C,GAAQ,GAAM,KAEnCqB,EAAQ,EACRwB,EAAQ,IAERxB,EAAQrB,IAAS,GACjB6C,GAAS,EAEZ,CAED,GAAID,EAAWJ,EAAI5F,OAGjB,IAFA4F,EAAII,KAAcvB,EAEXuB,EAAWJ,EAAI5F,QACpB4F,EAAII,KAAc,CAG1B,EAEExG,EAAGF,UAAU4G,eAAiB,SAAyBN,GAIrD,IAHA,IAAII,EAAWJ,EAAI5F,OAAS,EACxByE,EAAQ,EAEHhD,EAAI,EAAGwE,EAAQ,EAAGxE,EAAI5B,KAAKG,OAAQyB,IAAK,CAC/C,IAAI2B,EAAQvD,KAAKE,MAAM0B,IAAMwE,EAASxB,EAEtCmB,EAAII,KAAqB,IAAP5C,EACd4C,GAAY,IACdJ,EAAII,KAAe5C,GAAQ,EAAK,KAE9B4C,GAAY,IACdJ,EAAII,KAAe5C,GAAQ,GAAM,KAGrB,IAAV6C,GACED,GAAY,IACdJ,EAAII,KAAe5C,GAAQ,GAAM,KAEnCqB,EAAQ,EACRwB,EAAQ,IAERxB,EAAQrB,IAAS,GACjB6C,GAAS,EAEZ,CAED,GAAID,GAAY,EAGd,IAFAJ,EAAII,KAAcvB,EAEXuB,GAAY,GACjBJ,EAAII,KAAc,CAG1B,EAEMzE,KAAK4E,MACP3G,EAAGF,UAAU8G,WAAa,SAAqBvD,GAC7C,OAAO,GAAKtB,KAAK4E,MAAMtD,EAC7B,EAEIrD,EAAGF,UAAU8G,WAAa,SAAqBvD,GAC7C,IAAIwD,EAAIxD,EACJ9B,EAAI,EAiBR,OAhBIsF,GAAK,OACPtF,GAAK,GACLsF,KAAO,IAELA,GAAK,KACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAEFtF,EAAIsF,CACjB,EAGE7G,EAAGF,UAAUgH,UAAY,SAAoBzD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIwD,EAAIxD,EACJ9B,EAAI,EAoBR,OAnBqB,IAAZ,KAAJsF,KACHtF,GAAK,GACLsF,KAAO,IAEU,IAAV,IAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,GAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,EAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,IAAT,EAAJA,IACHtF,IAEKA,CACX,EAGEvB,EAAGF,UAAUiH,UAAY,WACvB,IAAI1D,EAAIhD,KAAKE,MAAMF,KAAKG,OAAS,GAC7BwG,EAAK3G,KAAKuG,WAAWvD,GACzB,OAA2B,IAAnBhD,KAAKG,OAAS,GAAUwG,CACpC,EAgBEhH,EAAGF,UAAUmH,SAAW,WACtB,GAAI5G,KAAKoF,SAAU,OAAO,EAG1B,IADA,IAAIlE,EAAI,EACCU,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CACpC,IAAIJ,EAAIxB,KAAKyG,UAAUzG,KAAKE,MAAM0B,IAElC,GADAV,GAAKM,EACK,KAANA,EAAU,KACf,CACD,OAAON,CACX,EAEEvB,EAAGF,UAAUoG,WAAa,WACxB,OAAOnE,KAAKoB,KAAK9C,KAAK0G,YAAc,EACxC,EAEE/G,EAAGF,UAAUoH,OAAS,SAAiBC,GACrC,OAAsB,IAAlB9G,KAAKC,SACAD,KAAK+G,MAAMC,MAAMF,GAAOG,MAAM,GAEhCjH,KAAK6D,OAChB,EAEElE,EAAGF,UAAUyH,SAAW,SAAmBJ,GACzC,OAAI9G,KAAKmH,MAAML,EAAQ,GACd9G,KAAKoH,KAAKN,GAAOG,MAAM,GAAGI,OAE5BrH,KAAK6D,OAChB,EAEElE,EAAGF,UAAU6H,MAAQ,WACnB,OAAyB,IAAlBtH,KAAKC,QAChB,EAGEN,EAAGF,UAAU8H,IAAM,WACjB,OAAOvH,KAAK6D,QAAQwD,MACxB,EAEE1H,EAAGF,UAAU4H,KAAO,WAKlB,OAJKrH,KAAKoF,WACRpF,KAAKC,UAAY,GAGZD,IACX,EAGEL,EAAGF,UAAU+H,KAAO,SAAexF,GACjC,KAAOhC,KAAKG,OAAS6B,EAAI7B,QACvBH,KAAKE,MAAMF,KAAKG,UAAY,EAG9B,IAAK,IAAIyB,EAAI,EAAGA,EAAII,EAAI7B,OAAQyB,IAC9B5B,KAAKE,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAAKI,EAAI9B,MAAM0B,GAG5C,OAAO5B,KAAKkD,QAChB,EAEEvD,EAAGF,UAAUgI,IAAM,SAAczF,GAE/B,OADAhD,EAA0C,IAAlCgB,KAAKC,SAAW+B,EAAI/B,WACrBD,KAAKwH,KAAKxF,EACrB,EAGErC,EAAGF,UAAUiI,GAAK,SAAa1F,GAC7B,OAAIhC,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQ4D,IAAIzF,GAC/CA,EAAI6B,QAAQ4D,IAAIzH,KAC3B,EAEEL,EAAGF,UAAUkI,IAAM,SAAc3F,GAC/B,OAAIhC,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQ2D,KAAKxF,GAChDA,EAAI6B,QAAQ2D,KAAKxH,KAC5B,EAGEL,EAAGF,UAAUmI,MAAQ,SAAgB5F,GAEnC,IAAIR,EAEFA,EADExB,KAAKG,OAAS6B,EAAI7B,OAChB6B,EAEAhC,KAGN,IAAK,IAAI4B,EAAI,EAAGA,EAAIJ,EAAErB,OAAQyB,IAC5B5B,KAAKE,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAAKI,EAAI9B,MAAM0B,GAK5C,OAFA5B,KAAKG,OAASqB,EAAErB,OAETH,KAAKkD,QAChB,EAEEvD,EAAGF,UAAUoI,KAAO,SAAe7F,GAEjC,OADAhD,EAA0C,IAAlCgB,KAAKC,SAAW+B,EAAI/B,WACrBD,KAAK4H,MAAM5F,EACtB,EAGErC,EAAGF,UAAUqI,IAAM,SAAc9F,GAC/B,OAAIhC,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQgE,KAAK7F,GAChDA,EAAI6B,QAAQgE,KAAK7H,KAC5B,EAEEL,EAAGF,UAAUsI,KAAO,SAAe/F,GACjC,OAAIhC,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQ+D,MAAM5F,GACjDA,EAAI6B,QAAQ+D,MAAM5H,KAC7B,EAGEL,EAAGF,UAAUuI,MAAQ,SAAgBhG,GAEnC,IAAI0C,EACAlD,EACAxB,KAAKG,OAAS6B,EAAI7B,QACpBuE,EAAI1E,KACJwB,EAAIQ,IAEJ0C,EAAI1C,EACJR,EAAIxB,MAGN,IAAK,IAAI4B,EAAI,EAAGA,EAAIJ,EAAErB,OAAQyB,IAC5B5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAAKJ,EAAEtB,MAAM0B,GAGvC,GAAI5B,OAAS0E,EACX,KAAO9C,EAAI8C,EAAEvE,OAAQyB,IACnB5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAM5B,OAFA5B,KAAKG,OAASuE,EAAEvE,OAETH,KAAKkD,QAChB,EAEEvD,EAAGF,UAAUwI,KAAO,SAAejG,GAEjC,OADAhD,EAA0C,IAAlCgB,KAAKC,SAAW+B,EAAI/B,WACrBD,KAAKgI,MAAMhG,EACtB,EAGErC,EAAGF,UAAUyI,IAAM,SAAclG,GAC/B,OAAIhC,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQoE,KAAKjG,GAChDA,EAAI6B,QAAQoE,KAAKjI,KAC5B,EAEEL,EAAGF,UAAU0I,KAAO,SAAenG,GACjC,OAAIhC,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQmE,MAAMhG,GACjDA,EAAI6B,QAAQmE,MAAMhI,KAC7B,EAGEL,EAAGF,UAAUuH,MAAQ,SAAgBF,GACnC9H,EAAwB,iBAAV8H,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxB1G,KAAKoB,KAAKgE,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB9G,KAAK8D,QAAQsE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIxG,EAAI,EAAGA,EAAIwG,EAAaxG,IAC/B5B,KAAKE,MAAM0B,GAAsB,UAAhB5B,KAAKE,MAAM0B,GAS9B,OALIyG,EAAW,IACbrI,KAAKE,MAAM0B,IAAM5B,KAAKE,MAAM0B,GAAM,UAAc,GAAKyG,GAIhDrI,KAAKkD,QAChB,EAEEvD,EAAGF,UAAU2H,KAAO,SAAeN,GACjC,OAAO9G,KAAK6D,QAAQmD,MAAMF,EAC9B,EAGEnH,EAAGF,UAAU6I,KAAO,SAAeC,EAAKtJ,GACtCD,EAAsB,iBAARuJ,GAAoBA,GAAO,GAEzC,IAAItF,EAAOsF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAvI,KAAK8D,QAAQb,EAAM,GAGjBjD,KAAKE,MAAM+C,GADThE,EACgBe,KAAKE,MAAM+C,GAAQ,GAAKuF,EAExBxI,KAAKE,MAAM+C,KAAS,GAAKuF,GAGtCxI,KAAKkD,QAChB,EAGEvD,EAAGF,UAAUgJ,KAAO,SAAezG,GACjC,IAAId,EAkBAwD,EAAGlD,EAfP,GAAsB,IAAlBxB,KAAKC,UAAmC,IAAjB+B,EAAI/B,SAI7B,OAHAD,KAAKC,SAAW,EAChBiB,EAAIlB,KAAK0I,KAAK1G,GACdhC,KAAKC,UAAY,EACVD,KAAKgE,YAGP,GAAsB,IAAlBhE,KAAKC,UAAmC,IAAjB+B,EAAI/B,SAIpC,OAHA+B,EAAI/B,SAAW,EACfiB,EAAIlB,KAAK0I,KAAK1G,GACdA,EAAI/B,SAAW,EACRiB,EAAE8C,YAKPhE,KAAKG,OAAS6B,EAAI7B,QACpBuE,EAAI1E,KACJwB,EAAIQ,IAEJ0C,EAAI1C,EACJR,EAAIxB,MAIN,IADA,IAAI4E,EAAQ,EACHhD,EAAI,EAAGA,EAAIJ,EAAErB,OAAQyB,IAC5BV,GAAkB,EAAbwD,EAAExE,MAAM0B,KAAwB,EAAbJ,EAAEtB,MAAM0B,IAAUgD,EAC1C5E,KAAKE,MAAM0B,GAAS,SAAJV,EAChB0D,EAAQ1D,IAAM,GAEhB,KAAiB,IAAV0D,GAAehD,EAAI8C,EAAEvE,OAAQyB,IAClCV,GAAkB,EAAbwD,EAAExE,MAAM0B,IAAUgD,EACvB5E,KAAKE,MAAM0B,GAAS,SAAJV,EAChB0D,EAAQ1D,IAAM,GAIhB,GADAlB,KAAKG,OAASuE,EAAEvE,OACF,IAAVyE,EACF5E,KAAKE,MAAMF,KAAKG,QAAUyE,EAC1B5E,KAAKG,cAEA,GAAIuE,IAAM1E,KACf,KAAO4B,EAAI8C,EAAEvE,OAAQyB,IACnB5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAI5B,OAAO5B,IACX,EAGEL,EAAGF,UAAUkJ,IAAM,SAAc3G,GAC/B,IAAI+D,EACJ,OAAqB,IAAjB/D,EAAI/B,UAAoC,IAAlBD,KAAKC,UAC7B+B,EAAI/B,SAAW,EACf8F,EAAM/F,KAAK4I,IAAI5G,GACfA,EAAI/B,UAAY,EACT8F,GACmB,IAAjB/D,EAAI/B,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChB8F,EAAM/D,EAAI4G,IAAI5I,MACdA,KAAKC,SAAW,EACT8F,GAGL/F,KAAKG,OAAS6B,EAAI7B,OAAeH,KAAK6D,QAAQ4E,KAAKzG,GAEhDA,EAAI6B,QAAQ4E,KAAKzI,KAC5B,EAGEL,EAAGF,UAAUiJ,KAAO,SAAe1G,GAEjC,GAAqB,IAAjBA,EAAI/B,SAAgB,CACtB+B,EAAI/B,SAAW,EACf,IAAIiB,EAAIlB,KAAKyI,KAAKzG,GAElB,OADAA,EAAI/B,SAAW,EACRiB,EAAE8C,WAGf,CAAW,GAAsB,IAAlBhE,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAKyI,KAAKzG,GACVhC,KAAKC,SAAW,EACTD,KAAKgE,YAId,IAWIU,EAAGlD,EAXHc,EAAMtC,KAAKsC,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHAtC,KAAKC,SAAW,EAChBD,KAAKG,OAAS,EACdH,KAAKE,MAAM,GAAK,EACTF,KAKLsC,EAAM,GACRoC,EAAI1E,KACJwB,EAAIQ,IAEJ0C,EAAI1C,EACJR,EAAIxB,MAIN,IADA,IAAI4E,EAAQ,EACHhD,EAAI,EAAGA,EAAIJ,EAAErB,OAAQyB,IAE5BgD,GADA1D,GAAkB,EAAbwD,EAAExE,MAAM0B,KAAwB,EAAbJ,EAAEtB,MAAM0B,IAAUgD,IAC7B,GACb5E,KAAKE,MAAM0B,GAAS,SAAJV,EAElB,KAAiB,IAAV0D,GAAehD,EAAI8C,EAAEvE,OAAQyB,IAElCgD,GADA1D,GAAkB,EAAbwD,EAAExE,MAAM0B,IAAUgD,IACV,GACb5E,KAAKE,MAAM0B,GAAS,SAAJV,EAIlB,GAAc,IAAV0D,GAAehD,EAAI8C,EAAEvE,QAAUuE,IAAM1E,KACvC,KAAO4B,EAAI8C,EAAEvE,OAAQyB,IACnB5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAU5B,OANA5B,KAAKG,OAASuB,KAAKS,IAAInC,KAAKG,OAAQyB,GAEhC8C,IAAM1E,OACRA,KAAKC,SAAW,GAGXD,KAAKkD,QAChB,EAGEvD,EAAGF,UAAUmJ,IAAM,SAAc5G,GAC/B,OAAOhC,KAAK6D,QAAQ6E,KAAK1G,EAC7B,EA8CE,IAAI6G,EAAc,SAAsBrE,EAAMxC,EAAKyC,GACjD,IAIIE,EACAmE,EACAnC,EANAjC,EAAIF,EAAKtE,MACTsB,EAAIQ,EAAI9B,MACR6I,EAAItE,EAAIvE,MACRY,EAAI,EAIJkI,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjG,EAAE,GACPkG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtJ,EAAE,GACPuJ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzJ,EAAE,GACP0J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5J,EAAE,GACP6J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/J,EAAE,GACPgK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlK,EAAE,GACPmK,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPrK,EAAE,GACPsK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxK,EAAE,GACPyK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3K,EAAE,GACP4K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP9K,EAAE,GACP+K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjL,EAAE,GACPkL,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBhI,EAAIxE,SAAWuE,EAAKvE,SAAW+B,EAAI/B,SACnCwE,EAAItE,OAAS,GAMb,IAAIyM,IAAQ9L,GAJZ6D,EAAKjD,KAAKmL,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMpH,KAAKmL,KAAK5D,EAAK+B,IACRtJ,KAAKmL,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDjK,IAFA6F,EAAKjF,KAAKmL,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKjD,KAAKmL,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKzD,EAAK4B,IACRtJ,KAAKmL,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQhM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKkC,GAAQ,GACvBzJ,KAAKmL,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDpK,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKjD,KAAKmL,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKtD,EAAKyB,IACRtJ,KAAKmL,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKrD,EAAKwB,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAK+B,GAAQ,GACvBzJ,KAAKmL,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQjM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKqC,GAAQ,GACvB5J,KAAKmL,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDvK,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKjD,KAAKmL,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKnD,EAAKsB,IACRtJ,KAAKmL,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKlD,EAAKqB,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK4B,GAAQ,GACvBzJ,KAAKmL,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK2B,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKkC,GAAQ,GACvB5J,KAAKmL,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQlM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKwC,GAAQ,GACvB/J,KAAKmL,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD1K,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKjD,KAAKmL,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKhD,EAAKmB,IACRtJ,KAAKmL,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAK/C,EAAKkB,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKyB,GAAQ,GACvBzJ,KAAKmL,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKwB,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK+B,GAAQ,GACvB5J,KAAKmL,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK8B,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKqC,GAAQ,GACvB/J,KAAKmL,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQnM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAK2C,IAAQ,GACvBlK,KAAKmL,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrD7K,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKjD,KAAKmL,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAK7C,EAAKgB,IACRtJ,KAAKmL,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAK5C,EAAKe,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKsB,GAAQ,GACvBzJ,KAAKmL,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKqB,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK4B,GAAQ,GACvB5J,KAAKmL,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK2B,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKkC,GAAQ,GACvB/J,KAAKmL,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKiC,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKwC,IAAQ,GACvBlK,KAAKmL,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQpM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAK8C,IAAQ,GACvBrK,KAAKmL,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDhL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKjD,KAAKmL,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAK1C,EAAKa,IACRtJ,KAAKmL,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKzC,EAAKY,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKmB,GAAQ,GACvBzJ,KAAKmL,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKkB,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKyB,GAAQ,GACvB5J,KAAKmL,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKwB,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK+B,GAAQ,GACvB/J,KAAKmL,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK8B,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKqC,IAAQ,GACvBlK,KAAKmL,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKoC,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAK2C,IAAQ,GACvBrK,KAAKmL,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQrM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKiD,IAAQ,GACvBxK,KAAKmL,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDnL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAKjD,KAAKmL,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKvC,EAAKU,IACRtJ,KAAKmL,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKtC,EAAKS,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKgB,GAAQ,GACvBzJ,KAAKmL,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKe,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKsB,GAAQ,GACvB5J,KAAKmL,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKqB,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK4B,GAAQ,GACvB/J,KAAKmL,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK2B,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKkC,IAAQ,GACvBlK,KAAKmL,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKiC,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKwC,IAAQ,GACvBrK,KAAKmL,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKuC,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAK8C,IAAQ,GACvBxK,KAAKmL,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQtM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKoD,IAAQ,GACvB3K,KAAKmL,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDtL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENzI,EAAKjD,KAAKmL,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKpC,EAAKO,IACRtJ,KAAKmL,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKnC,EAAKM,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKa,GAAQ,GACvBzJ,KAAKmL,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKY,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKmB,GAAQ,GACvB5J,KAAKmL,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKkB,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKyB,GAAQ,GACvB/J,KAAKmL,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKwB,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK+B,IAAQ,GACvBlK,KAAKmL,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK8B,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKqC,IAAQ,GACvBrK,KAAKmL,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKoC,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK2C,IAAQ,GACvBxK,KAAKmL,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK0C,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKiD,IAAQ,GACvB3K,KAAKmL,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQvM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAKuD,IAAQ,GACvB9K,KAAKmL,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDzL,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAEN1I,EAAKjD,KAAKmL,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKI,IACRtJ,KAAKmL,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAKjF,KAAKmL,KAAKhC,EAAKG,GACpBrG,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKU,GAAQ,GACvBzJ,KAAKmL,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKS,GAAQ,EAClCxG,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKgB,GAAQ,GACvB5J,KAAKmL,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKe,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKsB,GAAQ,GACvB/J,KAAKmL,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKqB,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAK4B,IAAQ,GACvBlK,KAAKmL,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAK2B,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKkC,IAAQ,GACvBrK,KAAKmL,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKiC,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKwC,IAAQ,GACvBxK,KAAKmL,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKuC,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAK8C,IAAQ,GACvB3K,KAAKmL,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAK6C,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKoD,IAAQ,GACvB9K,KAAKmL,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQxM,GAJZ6D,EAAMA,EAAKjD,KAAKmL,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK5D,EAAK0D,IAAQ,GACvBjL,KAAKmL,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAEN3I,EAAKjD,KAAKmL,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKO,IACRzJ,KAAKmL,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAKjF,KAAKmL,KAAKhC,EAAKM,GACpBxG,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKa,GAAQ,GACvB5J,KAAKmL,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKY,GAAQ,EAClC3G,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKmB,GAAQ,GACvB/J,KAAKmL,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKkB,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKyB,IAAQ,GACvBlK,KAAKmL,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKwB,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAK+B,IAAQ,GACvBrK,KAAKmL,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAK8B,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKqC,IAAQ,GACvBxK,KAAKmL,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKoC,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK2C,IAAQ,GACvB3K,KAAKmL,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK0C,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKiD,IAAQ,GACvB9K,KAAKmL,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASzM,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKzD,EAAKuD,IAAQ,GACvBjL,KAAKmL,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKjD,KAAKmL,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKU,IACR5J,KAAKmL,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAKjF,KAAKmL,KAAKhC,EAAKS,GACpB3G,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKgB,GAAQ,GACvB/J,KAAKmL,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKe,GAAQ,EAClC9G,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKsB,IAAQ,GACvBlK,KAAKmL,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKqB,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAK4B,IAAQ,GACvBrK,KAAKmL,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAK2B,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKkC,IAAQ,GACvBxK,KAAKmL,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKiC,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAKwC,IAAQ,GACvB3K,KAAKmL,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAKuC,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAK8C,IAAQ,GACvB9K,KAAKmL,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS1M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKtD,EAAKoD,IAAQ,GACvBjL,KAAKmL,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKjD,KAAKmL,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKa,IACR/J,KAAKmL,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAKjF,KAAKmL,KAAKhC,EAAKY,GACpB9G,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKmB,IAAQ,GACvBlK,KAAKmL,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKkB,IAAQ,EAClCjH,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKyB,IAAQ,GACvBrK,KAAKmL,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKwB,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAK+B,IAAQ,GACvBxK,KAAKmL,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAK8B,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKqC,IAAQ,GACvB3K,KAAKmL,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKoC,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK2C,IAAQ,GACvB9K,KAAKmL,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAS3M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKnD,EAAKiD,IAAQ,GACvBjL,KAAKmL,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKjD,KAAKmL,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKgB,KACRlK,KAAKmL,KAAKhC,EAAKc,GAAQ,EACpChF,EAAKjF,KAAKmL,KAAKhC,EAAKe,IACpBjH,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKsB,IAAQ,GACvBrK,KAAKmL,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKqB,IAAQ,EAClCpH,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAK4B,IAAQ,GACvBxK,KAAKmL,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAK2B,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKkC,IAAQ,GACvB3K,KAAKmL,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKiC,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAKwC,IAAQ,GACvB9K,KAAKmL,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAAS5M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKhD,EAAK8C,IAAQ,GACvBjL,KAAKmL,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAKjD,KAAKmL,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKmB,KACRrK,KAAKmL,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAKjF,KAAKmL,KAAKhC,EAAKkB,IACpBpH,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKyB,IAAQ,GACvBxK,KAAKmL,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKwB,IAAQ,EAClCvH,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAK+B,IAAQ,GACvB3K,KAAKmL,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAK8B,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKqC,IAAQ,GACvB9K,KAAKmL,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAS7M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK7C,EAAK2C,IAAQ,GACvBjL,KAAKmL,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPhJ,EAAKjD,KAAKmL,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKsB,KACRxK,KAAKmL,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAKjF,KAAKmL,KAAKhC,EAAKqB,IACpBvH,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAK4B,IAAQ,GACvB3K,KAAKmL,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAK2B,IAAQ,EAClC1H,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKkC,IAAQ,GACvB9K,KAAKmL,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS9M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAK1C,EAAKwC,IAAQ,GACvBjL,KAAKmL,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPjJ,EAAKjD,KAAKmL,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKyB,KACR3K,KAAKmL,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAKjF,KAAKmL,KAAKhC,EAAKwB,IACpB1H,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAK+B,IAAQ,GACvB9K,KAAKmL,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS/M,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKvC,EAAKqC,IAAQ,GACvBjL,KAAKmL,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPlJ,EAAKjD,KAAKmL,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAK4B,KACR9K,KAAKmL,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAKjF,KAAKmL,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAShN,GAJb6D,EAAMA,EAAKjD,KAAKmL,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMpH,KAAKmL,KAAKpC,EAAKkC,IAAQ,GACvBjL,KAAKmL,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtD5L,IAFA6F,EAAMA,EAAKjF,KAAKmL,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASjN,GAJb6D,EAAKjD,KAAKmL,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAK+B,KACRjL,KAAKmL,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBA5L,IAFA6F,EAAKjF,KAAKmL,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,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,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANjN,IACFiI,EAAE,IAAMjI,EACR2D,EAAItE,UAECsE,CACX,EAOE,SAASuJ,EAAUxJ,EAAMxC,EAAKyC,GAC5BA,EAAIxE,SAAW+B,EAAI/B,SAAWuE,EAAKvE,SACnCwE,EAAItE,OAASqE,EAAKrE,OAAS6B,EAAI7B,OAI/B,IAFA,IAAIyE,EAAQ,EACRqJ,EAAU,EACLpJ,EAAI,EAAGA,EAAIJ,EAAItE,OAAS,EAAG0E,IAAK,CAGvC,IAAIC,EAASmJ,EACbA,EAAU,EAGV,IAFA,IAAIlJ,EAAgB,SAARH,EACRI,EAAOtD,KAAKC,IAAIkD,EAAG7C,EAAI7B,OAAS,GAC3B4C,EAAIrB,KAAKS,IAAI,EAAG0C,EAAIL,EAAKrE,OAAS,GAAI4C,GAAKiC,EAAMjC,IAAK,CAC7D,IAAInB,EAAIiD,EAAI9B,EAGR7B,GAFoB,EAAhBsD,EAAKtE,MAAM0B,KACI,EAAfI,EAAI9B,MAAM6C,IAGd4B,EAAS,SAAJzD,EAGT6D,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBkJ,IAFAnJ,GAHAA,EAAUA,GAAW5D,EAAI,SAAa,GAAM,IAGxByD,IAAO,IAAO,KAEZ,GACtBG,GAAU,QACX,CACDL,EAAIvE,MAAM2E,GAAKE,EACfH,EAAQE,EACRA,EAASmJ,CACV,CAOD,OANc,IAAVrJ,EACFH,EAAIvE,MAAM2E,GAAKD,EAEfH,EAAItE,SAGCsE,EAAIvB,QACZ,CAED,SAASgL,EAAY1J,EAAMxC,EAAKyC,GAI9B,OAAOuJ,EAASxJ,EAAMxC,EAAKyC,EAC5B,CAlDI/C,KAAKmL,OACRhE,EAActE,GAmDhB5E,EAAGF,UAAU0O,MAAQ,SAAgBnM,EAAKyC,GACxC,IACIhD,EAAMzB,KAAKG,OAAS6B,EAAI7B,OAW5B,OAVoB,KAAhBH,KAAKG,QAAgC,KAAf6B,EAAI7B,OACtB0I,EAAY7I,KAAMgC,EAAKyC,GACpBhD,EAAM,GACT8C,EAAWvE,KAAMgC,EAAKyC,GACnBhD,EAAM,KACTuM,EAAShO,KAAMgC,EAAKyC,GAEpByJ,EAAWlO,KAAMgC,EAAKyC,EAIlC,EAuME9E,EAAGF,UAAU8B,IAAM,SAAcS,GAC/B,IAAIyC,EAAM,IAAI9E,EAAG,MAEjB,OADA8E,EAAIvE,MAAQ,IAAI+B,MAAMjC,KAAKG,OAAS6B,EAAI7B,QACjCH,KAAKmO,MAAMnM,EAAKyC,EAC3B,EAGE9E,EAAGF,UAAU2O,KAAO,SAAepM,GACjC,IAAIyC,EAAM,IAAI9E,EAAG,MAEjB,OADA8E,EAAIvE,MAAQ,IAAI+B,MAAMjC,KAAKG,OAAS6B,EAAI7B,QACjC+N,EAAWlO,KAAMgC,EAAKyC,EACjC,EAGE9E,EAAGF,UAAUoN,KAAO,SAAe7K,GACjC,OAAOhC,KAAK6D,QAAQsK,MAAMnM,EAAKhC,KACnC,EAEEL,EAAGF,UAAU+D,MAAQ,SAAgBxB,GACnC,IAAIqM,EAAWrM,EAAM,EACjBqM,IAAUrM,GAAOA,GAErBhD,EAAsB,iBAARgD,GACdhD,EAAOgD,EAAM,UAIb,IADA,IAAI4C,EAAQ,EACHhD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CACpC,IAAIoB,GAAqB,EAAhBhD,KAAKE,MAAM0B,IAAUI,EAC1B2C,GAAU,SAAJ3B,IAA0B,SAAR4B,GAC5BA,IAAU,GACVA,GAAU5B,EAAI,SAAa,EAE3B4B,GAASD,IAAO,GAChB3E,KAAKE,MAAM0B,GAAU,SAAL+C,CACjB,CAOD,OALc,IAAVC,IACF5E,KAAKE,MAAM0B,GAAKgD,EAChB5E,KAAKG,UAGAkO,EAAWrO,KAAKqH,OAASrH,IACpC,EAEEL,EAAGF,UAAU6O,KAAO,SAAetM,GACjC,OAAOhC,KAAK6D,QAAQL,MAAMxB,EAC9B,EAGErC,EAAGF,UAAU8O,IAAM,WACjB,OAAOvO,KAAKuB,IAAIvB,KACpB,EAGEL,EAAGF,UAAU+O,KAAO,WAClB,OAAOxO,KAAK6M,KAAK7M,KAAK6D,QAC1B,EAGElE,EAAGF,UAAUiE,IAAM,SAAc1B,GAC/B,IAAIgB,EA7xCN,SAAqBhB,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAI0E,aAEb6B,EAAM,EAAGA,EAAMvF,EAAE7C,OAAQoI,IAAO,CACvC,IAAItF,EAAOsF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBvF,EAAEuF,GAAQvG,EAAI9B,MAAM+C,KAASuF,EAAQ,CACtC,CAED,OAAOxF,CACR,CAkxCSyL,CAAWzM,GACnB,GAAiB,IAAbgB,EAAE7C,OAAc,OAAO,IAAIR,EAAG,GAIlC,IADA,IAAIoG,EAAM/F,KACD4B,EAAI,EAAGA,EAAIoB,EAAE7C,QACP,IAAT6C,EAAEpB,GADsBA,IAAKmE,EAAMA,EAAIwI,OAI7C,KAAM3M,EAAIoB,EAAE7C,OACV,IAAK,IAAIuO,EAAI3I,EAAIwI,MAAO3M,EAAIoB,EAAE7C,OAAQyB,IAAK8M,EAAIA,EAAEH,MAClC,IAATvL,EAAEpB,KAENmE,EAAMA,EAAIxE,IAAImN,IAIlB,OAAO3I,CACX,EAGEpG,EAAGF,UAAUkP,OAAS,SAAiBC,GACrC5P,EAAuB,iBAAT4P,GAAqBA,GAAQ,GAC3C,IAGIhN,EAHAV,EAAI0N,EAAO,GACXC,GAAKD,EAAO1N,GAAK,GACjB4N,EAAa,WAAe,GAAK5N,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI0D,EAAQ,EAEZ,IAAKhD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CAChC,IAAImN,EAAW/O,KAAKE,MAAM0B,GAAKkN,EAC3BhO,GAAsB,EAAhBd,KAAKE,MAAM0B,IAAUmN,GAAa7N,EAC5ClB,KAAKE,MAAM0B,GAAKd,EAAI8D,EACpBA,EAAQmK,IAAc,GAAK7N,CAC5B,CAEG0D,IACF5E,KAAKE,MAAM0B,GAAKgD,EAChB5E,KAAKG,SAER,CAED,GAAU,IAAN0O,EAAS,CACX,IAAKjN,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IAChC5B,KAAKE,MAAM0B,EAAIiN,GAAK7O,KAAKE,MAAM0B,GAGjC,IAAKA,EAAI,EAAGA,EAAIiN,EAAGjN,IACjB5B,KAAKE,MAAM0B,GAAK,EAGlB5B,KAAKG,QAAU0O,CAChB,CAED,OAAO7O,KAAKkD,QAChB,EAEEvD,EAAGF,UAAUuP,MAAQ,SAAgBJ,GAGnC,OADA5P,EAAyB,IAAlBgB,KAAKC,UACLD,KAAK2O,OAAOC,EACvB,EAKEjP,EAAGF,UAAUwP,OAAS,SAAiBL,EAAMM,EAAMC,GAEjD,IAAIC,EADJpQ,EAAuB,iBAAT4P,GAAqBA,GAAQ,GAGzCQ,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIhO,EAAI0N,EAAO,GACXC,EAAInN,KAAKC,KAAKiN,EAAO1N,GAAK,GAAIlB,KAAKG,QACnCkP,EAAO,SAAc,WAAcnO,GAAMA,EACzCoO,EAAcH,EAMlB,GAJAC,GAAKP,EACLO,EAAI1N,KAAKS,IAAI,EAAGiN,GAGZE,EAAa,CACf,IAAK,IAAI1N,EAAI,EAAGA,EAAIiN,EAAGjN,IACrB0N,EAAYpP,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAEpC0N,EAAYnP,OAAS0O,CACtB,CAED,GAAU,IAANA,QAEG,GAAI7O,KAAKG,OAAS0O,EAEvB,IADA7O,KAAKG,QAAU0O,EACVjN,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC3B5B,KAAKE,MAAM0B,GAAK5B,KAAKE,MAAM0B,EAAIiN,QAGjC7O,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,EAGhB,IAAIyE,EAAQ,EACZ,IAAKhD,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,IAAgB,IAAVgD,GAAehD,GAAKwN,GAAIxN,IAAK,CAChE,IAAI2B,EAAuB,EAAhBvD,KAAKE,MAAM0B,GACtB5B,KAAKE,MAAM0B,GAAMgD,GAAU,GAAK1D,EAAOqC,IAASrC,EAChD0D,EAAQrB,EAAO8L,CAChB,CAYD,OATIC,GAAyB,IAAV1K,IACjB0K,EAAYpP,MAAMoP,EAAYnP,UAAYyE,GAGxB,IAAhB5E,KAAKG,SACPH,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,GAGTH,KAAKkD,QAChB,EAEEvD,EAAGF,UAAU8P,MAAQ,SAAgBX,EAAMM,EAAMC,GAG/C,OADAnQ,EAAyB,IAAlBgB,KAAKC,UACLD,KAAKiP,OAAOL,EAAMM,EAAMC,EACnC,EAGExP,EAAGF,UAAU+P,KAAO,SAAeZ,GACjC,OAAO5O,KAAK6D,QAAQmL,MAAMJ,EAC9B,EAEEjP,EAAGF,UAAUgQ,MAAQ,SAAgBb,GACnC,OAAO5O,KAAK6D,QAAQ8K,OAAOC,EAC/B,EAGEjP,EAAGF,UAAUiQ,KAAO,SAAed,GACjC,OAAO5O,KAAK6D,QAAQ0L,MAAMX,EAC9B,EAEEjP,EAAGF,UAAUkQ,MAAQ,SAAgBf,GACnC,OAAO5O,KAAK6D,QAAQoL,OAAOL,EAC/B,EAGEjP,EAAGF,UAAU0H,MAAQ,SAAgBoB,GACnCvJ,EAAsB,iBAARuJ,GAAoBA,GAAO,GACzC,IAAIrH,EAAIqH,EAAM,GACVsG,GAAKtG,EAAMrH,GAAK,GAChBwN,EAAI,GAAKxN,EAGb,OAAIlB,KAAKG,QAAU0O,EAAU,KAGrB7O,KAAKE,MAAM2O,GAELH,EAClB,EAGE/O,EAAGF,UAAUmQ,OAAS,SAAiBhB,GACrC5P,EAAuB,iBAAT4P,GAAqBA,GAAQ,GAC3C,IAAI1N,EAAI0N,EAAO,GACXC,GAAKD,EAAO1N,GAAK,GAIrB,GAFAlC,EAAyB,IAAlBgB,KAAKC,SAAgB,2CAExBD,KAAKG,QAAU0O,EACjB,OAAO7O,KAQT,GALU,IAANkB,GACF2N,IAEF7O,KAAKG,OAASuB,KAAKC,IAAIkN,EAAG7O,KAAKG,QAErB,IAANe,EAAS,CACX,IAAImO,EAAO,SAAc,WAAcnO,GAAMA,EAC7ClB,KAAKE,MAAMF,KAAKG,OAAS,IAAMkP,CAChC,CAED,OAAOrP,KAAKkD,QAChB,EAGEvD,EAAGF,UAAUoQ,MAAQ,SAAgBjB,GACnC,OAAO5O,KAAK6D,QAAQ+L,OAAOhB,EAC/B,EAGEjP,EAAGF,UAAUwH,MAAQ,SAAgBjF,GAGnC,OAFAhD,EAAsB,iBAARgD,GACdhD,EAAOgD,EAAM,UACTA,EAAM,EAAUhC,KAAK8P,OAAO9N,GAGV,IAAlBhC,KAAKC,SACa,IAAhBD,KAAKG,SAAiC,EAAhBH,KAAKE,MAAM,KAAW8B,GAC9ChC,KAAKE,MAAM,GAAK8B,GAAuB,EAAhBhC,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK8P,MAAM9N,GACXhC,KAAKC,SAAW,EACTD,MAIFA,KAAKyD,OAAOzB,EACvB,EAEErC,EAAGF,UAAUgE,OAAS,SAAiBzB,GACrChC,KAAKE,MAAM,IAAM8B,EAGjB,IAAK,IAAIJ,EAAI,EAAGA,EAAI5B,KAAKG,QAAUH,KAAKE,MAAM0B,IAAM,SAAWA,IAC7D5B,KAAKE,MAAM0B,IAAM,SACbA,IAAM5B,KAAKG,OAAS,EACtBH,KAAKE,MAAM0B,EAAI,GAAK,EAEpB5B,KAAKE,MAAM0B,EAAI,KAKnB,OAFA5B,KAAKG,OAASuB,KAAKS,IAAInC,KAAKG,OAAQyB,EAAI,GAEjC5B,IACX,EAGEL,EAAGF,UAAUqQ,MAAQ,SAAgB9N,GAGnC,GAFAhD,EAAsB,iBAARgD,GACdhD,EAAOgD,EAAM,UACTA,EAAM,EAAG,OAAOhC,KAAKiH,OAAOjF,GAEhC,GAAsB,IAAlBhC,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKiH,MAAMjF,GACXhC,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAM8B,EAEG,IAAhBhC,KAAKG,QAAgBH,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAI2B,EAAI,EAAGA,EAAI5B,KAAKG,QAAUH,KAAKE,MAAM0B,GAAK,EAAGA,IACpD5B,KAAKE,MAAM0B,IAAM,SACjB5B,KAAKE,MAAM0B,EAAI,IAAM,EAIzB,OAAO5B,KAAKkD,QAChB,EAEEvD,EAAGF,UAAUsQ,KAAO,SAAe/N,GACjC,OAAOhC,KAAK6D,QAAQoD,MAAMjF,EAC9B,EAEErC,EAAGF,UAAUuQ,KAAO,SAAehO,GACjC,OAAOhC,KAAK6D,QAAQiM,MAAM9N,EAC9B,EAEErC,EAAGF,UAAUwQ,KAAO,WAGlB,OAFAjQ,KAAKC,SAAW,EAETD,IACX,EAEEL,EAAGF,UAAUsH,IAAM,WACjB,OAAO/G,KAAK6D,QAAQoM,MACxB,EAEEtQ,EAAGF,UAAUyQ,aAAe,SAAuBlO,EAAKT,EAAK6E,GAC3D,IACIxE,EAIAoB,EALAvB,EAAMO,EAAI7B,OAASiG,EAGvBpG,KAAK8D,QAAQrC,GAGb,IAAImD,EAAQ,EACZ,IAAKhD,EAAI,EAAGA,EAAII,EAAI7B,OAAQyB,IAAK,CAC/BoB,GAA6B,EAAxBhD,KAAKE,MAAM0B,EAAIwE,IAAcxB,EAClC,IAAIvC,GAAwB,EAAfL,EAAI9B,MAAM0B,IAAUL,EAEjCqD,IADA5B,GAAa,SAARX,IACS,KAAQA,EAAQ,SAAa,GAC3CrC,KAAKE,MAAM0B,EAAIwE,GAAa,SAAJpD,CACzB,CACD,KAAOpB,EAAI5B,KAAKG,OAASiG,EAAOxE,IAE9BgD,GADA5B,GAA6B,EAAxBhD,KAAKE,MAAM0B,EAAIwE,IAAcxB,IACrB,GACb5E,KAAKE,MAAM0B,EAAIwE,GAAa,SAAJpD,EAG1B,GAAc,IAAV4B,EAAa,OAAO5E,KAAKkD,SAK7B,IAFAlE,GAAkB,IAAX4F,GACPA,EAAQ,EACHhD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAE3BgD,GADA5B,IAAsB,EAAhBhD,KAAKE,MAAM0B,IAAUgD,IACd,GACb5E,KAAKE,MAAM0B,GAAS,SAAJoB,EAIlB,OAFAhD,KAAKC,SAAW,EAETD,KAAKkD,QAChB,EAEEvD,EAAGF,UAAU0Q,SAAW,SAAmBnO,EAAKoO,GAC9C,IAAIhK,GAAQpG,KAAKG,OAAS6B,EAAI7B,QAE1BuE,EAAI1E,KAAK6D,QACTrC,EAAIQ,EAGJqO,EAA8B,EAAxB7O,EAAEtB,MAAMsB,EAAErB,OAAS,GAGf,IADdiG,EAAQ,GADMpG,KAAKuG,WAAW8J,MAG5B7O,EAAIA,EAAEiO,MAAMrJ,GACZ1B,EAAEiK,OAAOvI,GACTiK,EAA8B,EAAxB7O,EAAEtB,MAAMsB,EAAErB,OAAS,IAI3B,IACIuO,EADA4B,EAAI5L,EAAEvE,OAASqB,EAAErB,OAGrB,GAAa,QAATiQ,EAAgB,EAClB1B,EAAI,IAAI/O,EAAG,OACTQ,OAASmQ,EAAI,EACf5B,EAAExO,MAAQ,IAAI+B,MAAMyM,EAAEvO,QACtB,IAAK,IAAIyB,EAAI,EAAGA,EAAI8M,EAAEvO,OAAQyB,IAC5B8M,EAAExO,MAAM0B,GAAK,CAEhB,CAED,IAAI2O,EAAO7L,EAAEb,QAAQqM,aAAa1O,EAAG,EAAG8O,GAClB,IAAlBC,EAAKtQ,WACPyE,EAAI6L,EACA7B,IACFA,EAAExO,MAAMoQ,GAAK,IAIjB,IAAK,IAAIvN,EAAIuN,EAAI,EAAGvN,GAAK,EAAGA,IAAK,CAC/B,IAAIyN,EAAmC,UAAL,EAAxB9L,EAAExE,MAAMsB,EAAErB,OAAS4C,KACE,EAA5B2B,EAAExE,MAAMsB,EAAErB,OAAS4C,EAAI,IAO1B,IAHAyN,EAAK9O,KAAKC,IAAK6O,EAAKH,EAAO,EAAG,UAE9B3L,EAAEwL,aAAa1O,EAAGgP,EAAIzN,GACA,IAAf2B,EAAEzE,UACPuQ,IACA9L,EAAEzE,SAAW,EACbyE,EAAEwL,aAAa1O,EAAG,EAAGuB,GAChB2B,EAAEU,WACLV,EAAEzE,UAAY,GAGdyO,IACFA,EAAExO,MAAM6C,GAAKyN,EAEhB,CAWD,OAVI9B,GACFA,EAAExL,SAEJwB,EAAExB,SAGW,QAATkN,GAA4B,IAAVhK,GACpB1B,EAAEuK,OAAO7I,GAGJ,CACLqK,IAAK/B,GAAK,KACVpL,IAAKoB,EAEX,EAME/E,EAAGF,UAAUiR,OAAS,SAAiB1O,EAAKoO,EAAMO,GAGhD,OAFA3R,GAAQgD,EAAIoD,UAERpF,KAAKoF,SACA,CACLqL,IAAK,IAAI9Q,EAAG,GACZ2D,IAAK,IAAI3D,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjB+B,EAAI/B,UAC7B8F,EAAM/F,KAAKuH,MAAMmJ,OAAO1O,EAAKoO,GAEhB,QAATA,IACFK,EAAM1K,EAAI0K,IAAIlJ,OAGH,QAAT6I,IACF9M,EAAMyC,EAAIzC,IAAIiE,MACVoJ,GAA6B,IAAjBrN,EAAIrD,UAClBqD,EAAImF,KAAKzG,IAIN,CACLyO,IAAKA,EACLnN,IAAKA,IAIa,IAAlBtD,KAAKC,UAAmC,IAAjB+B,EAAI/B,UAC7B8F,EAAM/F,KAAK0Q,OAAO1O,EAAIuF,MAAO6I,GAEhB,QAATA,IACFK,EAAM1K,EAAI0K,IAAIlJ,OAGT,CACLkJ,IAAKA,EACLnN,IAAKyC,EAAIzC,MAI0B,IAAlCtD,KAAKC,SAAW+B,EAAI/B,WACvB8F,EAAM/F,KAAKuH,MAAMmJ,OAAO1O,EAAIuF,MAAO6I,GAEtB,QAATA,IACF9M,EAAMyC,EAAIzC,IAAIiE,MACVoJ,GAA6B,IAAjBrN,EAAIrD,UAClBqD,EAAIoF,KAAK1G,IAIN,CACLyO,IAAK1K,EAAI0K,IACTnN,IAAKA,IAOLtB,EAAI7B,OAASH,KAAKG,QAAUH,KAAKsC,IAAIN,GAAO,EACvC,CACLyO,IAAK,IAAI9Q,EAAG,GACZ2D,IAAKtD,MAKU,IAAfgC,EAAI7B,OACO,QAATiQ,EACK,CACLK,IAAKzQ,KAAK4Q,KAAK5O,EAAI9B,MAAM,IACzBoD,IAAK,MAII,QAAT8M,EACK,CACLK,IAAK,KACLnN,IAAK,IAAI3D,EAAGK,KAAKqF,MAAMrD,EAAI9B,MAAM,MAI9B,CACLuQ,IAAKzQ,KAAK4Q,KAAK5O,EAAI9B,MAAM,IACzBoD,IAAK,IAAI3D,EAAGK,KAAKqF,MAAMrD,EAAI9B,MAAM,MAI9BF,KAAKmQ,SAASnO,EAAKoO,GAlF1B,IAAIK,EAAKnN,EAAKyC,CAmFlB,EAGEpG,EAAGF,UAAUgR,IAAM,SAAczO,GAC/B,OAAOhC,KAAK0Q,OAAO1O,EAAK,MAAO,GAAOyO,GAC1C,EAGE9Q,EAAGF,UAAU6D,IAAM,SAActB,GAC/B,OAAOhC,KAAK0Q,OAAO1O,EAAK,MAAO,GAAOsB,GAC1C,EAEE3D,EAAGF,UAAUoR,KAAO,SAAe7O,GACjC,OAAOhC,KAAK0Q,OAAO1O,EAAK,MAAO,GAAMsB,GACzC,EAGE3D,EAAGF,UAAUqR,SAAW,SAAmB9O,GACzC,IAAI+O,EAAK/Q,KAAK0Q,OAAO1O,GAGrB,GAAI+O,EAAGzN,IAAI8B,SAAU,OAAO2L,EAAGN,IAE/B,IAAInN,EAA0B,IAApByN,EAAGN,IAAIxQ,SAAiB8Q,EAAGzN,IAAIoF,KAAK1G,GAAO+O,EAAGzN,IAEpD0N,EAAOhP,EAAI2N,MAAM,GACjBsB,EAAKjP,EAAIkP,MAAM,GACf5O,EAAMgB,EAAIhB,IAAI0O,GAGlB,OAAI1O,EAAM,GAAa,IAAP2O,GAAoB,IAAR3O,EAAmByO,EAAGN,IAGvB,IAApBM,EAAGN,IAAIxQ,SAAiB8Q,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIxJ,MAAM,EAClE,EAEEtH,EAAGF,UAAU4F,MAAQ,SAAgBrD,GACnC,IAAIqM,EAAWrM,EAAM,EACjBqM,IAAUrM,GAAOA,GAErBhD,EAAOgD,GAAO,UAId,IAHA,IAAImP,GAAK,GAAK,IAAMnP,EAEhBoP,EAAM,EACDxP,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IACpCwP,GAAOD,EAAIC,GAAuB,EAAhBpR,KAAKE,MAAM0B,KAAWI,EAG1C,OAAOqM,GAAY+C,EAAMA,CAC7B,EAGEzR,EAAGF,UAAU4R,KAAO,SAAerP,GACjC,OAAOhC,KAAKqF,MAAMrD,EACtB,EAGErC,EAAGF,UAAU6F,MAAQ,SAAgBtD,GACnC,IAAIqM,EAAWrM,EAAM,EACjBqM,IAAUrM,GAAOA,GAErBhD,EAAOgD,GAAO,UAGd,IADA,IAAI4C,EAAQ,EACHhD,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CACzC,IAAIoB,GAAqB,EAAhBhD,KAAKE,MAAM0B,IAAkB,SAARgD,EAC9B5E,KAAKE,MAAM0B,GAAMoB,EAAIhB,EAAO,EAC5B4C,EAAQ5B,EAAIhB,CACb,CAGD,OADAhC,KAAKkD,SACEmL,EAAWrO,KAAKqH,OAASrH,IACpC,EAEEL,EAAGF,UAAUmR,KAAO,SAAe5O,GACjC,OAAOhC,KAAK6D,QAAQyB,MAAMtD,EAC9B,EAEErC,EAAGF,UAAU6R,KAAO,SAAeH,GACjCnS,EAAsB,IAAfmS,EAAElR,UACTjB,GAAQmS,EAAE/L,UAEV,IAAImM,EAAIvR,KACJwR,EAAIL,EAAEtN,QAGR0N,EADiB,IAAfA,EAAEtR,SACAsR,EAAEV,KAAKM,GAEPI,EAAE1N,QAaR,IATA,IAAI4N,EAAI,IAAI9R,EAAG,GACX+R,EAAI,IAAI/R,EAAG,GAGXgS,EAAI,IAAIhS,EAAG,GACXiS,EAAI,IAAIjS,EAAG,GAEXkS,EAAI,EAEDN,EAAEO,UAAYN,EAAEM,UACrBP,EAAEtC,OAAO,GACTuC,EAAEvC,OAAO,KACP4C,EAMJ,IAHA,IAAIE,EAAKP,EAAE3N,QACPmO,EAAKT,EAAE1N,SAEH0N,EAAEnM,UAAU,CAClB,IAAK,IAAIxD,EAAI,EAAGqQ,EAAK,EAAyB,IAArBV,EAAErR,MAAM,GAAK+R,IAAarQ,EAAI,KAAMA,EAAGqQ,IAAO,GACvE,GAAIrQ,EAAI,EAEN,IADA2P,EAAEtC,OAAOrN,GACFA,KAAM,IACP6P,EAAES,SAAWR,EAAEQ,WACjBT,EAAEhJ,KAAKsJ,GACPL,EAAEhJ,KAAKsJ,IAGTP,EAAExC,OAAO,GACTyC,EAAEzC,OAAO,GAIb,IAAK,IAAIlM,EAAI,EAAGoP,EAAK,EAAyB,IAArBX,EAAEtR,MAAM,GAAKiS,IAAapP,EAAI,KAAMA,EAAGoP,IAAO,GACvE,GAAIpP,EAAI,EAEN,IADAyO,EAAEvC,OAAOlM,GACFA,KAAM,IACP4O,EAAEO,SAAWN,EAAEM,WACjBP,EAAElJ,KAAKsJ,GACPH,EAAElJ,KAAKsJ,IAGTL,EAAE1C,OAAO,GACT2C,EAAE3C,OAAO,GAITsC,EAAEjP,IAAIkP,IAAM,GACdD,EAAE7I,KAAK8I,GACPC,EAAE/I,KAAKiJ,GACPD,EAAEhJ,KAAKkJ,KAEPJ,EAAE9I,KAAK6I,GACPI,EAAEjJ,KAAK+I,GACPG,EAAElJ,KAAKgJ,GAEV,CAED,MAAO,CACLhN,EAAGiN,EACHnQ,EAAGoQ,EACHQ,IAAKZ,EAAE7C,OAAOkD,GAEpB,EAKElS,EAAGF,UAAU4S,OAAS,SAAiBlB,GACrCnS,EAAsB,IAAfmS,EAAElR,UACTjB,GAAQmS,EAAE/L,UAEV,IAAIV,EAAI1E,KACJwB,EAAI2P,EAAEtN,QAGRa,EADiB,IAAfA,EAAEzE,SACAyE,EAAEmM,KAAKM,GAEPzM,EAAEb,QAQR,IALA,IAuCIkC,EAvCAuM,EAAK,IAAI3S,EAAG,GACZ4S,EAAK,IAAI5S,EAAG,GAEZ6S,EAAQhR,EAAEqC,QAEPa,EAAE+N,KAAK,GAAK,GAAKjR,EAAEiR,KAAK,GAAK,GAAG,CACrC,IAAK,IAAI7Q,EAAI,EAAGqQ,EAAK,EAAyB,IAArBvN,EAAExE,MAAM,GAAK+R,IAAarQ,EAAI,KAAMA,EAAGqQ,IAAO,GACvE,GAAIrQ,EAAI,EAEN,IADA8C,EAAEuK,OAAOrN,GACFA,KAAM,GACP0Q,EAAGJ,SACLI,EAAG7J,KAAK+J,GAGVF,EAAGrD,OAAO,GAId,IAAK,IAAIlM,EAAI,EAAGoP,EAAK,EAAyB,IAArB3Q,EAAEtB,MAAM,GAAKiS,IAAapP,EAAI,KAAMA,EAAGoP,IAAO,GACvE,GAAIpP,EAAI,EAEN,IADAvB,EAAEyN,OAAOlM,GACFA,KAAM,GACPwP,EAAGL,SACLK,EAAG9J,KAAK+J,GAGVD,EAAGtD,OAAO,GAIVvK,EAAEpC,IAAId,IAAM,GACdkD,EAAEgE,KAAKlH,GACP8Q,EAAG5J,KAAK6J,KAER/Q,EAAEkH,KAAKhE,GACP6N,EAAG7J,KAAK4J,GAEX,CAaD,OATEvM,EADgB,IAAdrB,EAAE+N,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB1M,EAAI0C,KAAK0I,GAGJpL,CACX,EAEEpG,EAAGF,UAAU2S,IAAM,SAAcpQ,GAC/B,GAAIhC,KAAKoF,SAAU,OAAOpD,EAAI+E,MAC9B,GAAI/E,EAAIoD,SAAU,OAAOpF,KAAK+G,MAE9B,IAAIrC,EAAI1E,KAAK6D,QACTrC,EAAIQ,EAAI6B,QACZa,EAAEzE,SAAW,EACbuB,EAAEvB,SAAW,EAGb,IAAK,IAAImG,EAAQ,EAAG1B,EAAEoN,UAAYtQ,EAAEsQ,SAAU1L,IAC5C1B,EAAEuK,OAAO,GACTzN,EAAEyN,OAAO,GAGX,OAAG,CACD,KAAOvK,EAAEoN,UACPpN,EAAEuK,OAAO,GAEX,KAAOzN,EAAEsQ,UACPtQ,EAAEyN,OAAO,GAGX,IAAI/N,EAAIwD,EAAEpC,IAAId,GACd,GAAIN,EAAI,EAAG,CAET,IAAIsF,EAAI9B,EACRA,EAAIlD,EACJA,EAAIgF,CACZ,MAAa,GAAU,IAANtF,GAAyB,IAAdM,EAAEiR,KAAK,GAC3B,MAGF/N,EAAEgE,KAAKlH,EACR,CAED,OAAOA,EAAEmN,OAAOvI,EACpB,EAGEzG,EAAGF,UAAUiT,KAAO,SAAe1Q,GACjC,OAAOhC,KAAKsR,KAAKtP,GAAK0C,EAAEmM,KAAK7O,EACjC,EAEErC,EAAGF,UAAUqS,OAAS,WACpB,OAA+B,IAAP,EAAhB9R,KAAKE,MAAM,GACvB,EAEEP,EAAGF,UAAUyS,MAAQ,WACnB,OAA+B,IAAP,EAAhBlS,KAAKE,MAAM,GACvB,EAGEP,EAAGF,UAAUyR,MAAQ,SAAgBlP,GACnC,OAAOhC,KAAKE,MAAM,GAAK8B,CAC3B,EAGErC,EAAGF,UAAUkT,MAAQ,SAAgBpK,GACnCvJ,EAAsB,iBAARuJ,GACd,IAAIrH,EAAIqH,EAAM,GACVsG,GAAKtG,EAAMrH,GAAK,GAChBwN,EAAI,GAAKxN,EAGb,GAAIlB,KAAKG,QAAU0O,EAGjB,OAFA7O,KAAK8D,QAAQ+K,EAAI,GACjB7O,KAAKE,MAAM2O,IAAMH,EACV1O,KAKT,IADA,IAAI4E,EAAQ8J,EACH9M,EAAIiN,EAAa,IAAVjK,GAAehD,EAAI5B,KAAKG,OAAQyB,IAAK,CACnD,IAAIoB,EAAoB,EAAhBhD,KAAKE,MAAM0B,GAEnBgD,GADA5B,GAAK4B,KACS,GACd5B,GAAK,SACLhD,KAAKE,MAAM0B,GAAKoB,CACjB,CAKD,OAJc,IAAV4B,IACF5E,KAAKE,MAAM0B,GAAKgD,EAChB5E,KAAKG,UAEAH,IACX,EAEEL,EAAGF,UAAU2F,OAAS,WACpB,OAAuB,IAAhBpF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,EAC3C,EAEEP,EAAGF,UAAUgT,KAAO,SAAezQ,GACjC,IAOI+D,EAPA9F,EAAW+B,EAAM,EAErB,GAAsB,IAAlBhC,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAKkD,SAGDlD,KAAKG,OAAS,EAChB4F,EAAM,MACD,CACD9F,IACF+B,GAAOA,GAGThD,EAAOgD,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhBhD,KAAKE,MAAM,GACnB6F,EAAM/C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,CACtC,CACD,OAAsB,IAAlBhC,KAAKC,SAA8B,GAAN8F,EAC1BA,CACX,EAMEpG,EAAGF,UAAU6C,IAAM,SAAcN,GAC/B,GAAsB,IAAlBhC,KAAKC,UAAmC,IAAjB+B,EAAI/B,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjB+B,EAAI/B,SAAgB,OAAO,EAEtD,IAAI8F,EAAM/F,KAAK4S,KAAK5Q,GACpB,OAAsB,IAAlBhC,KAAKC,SAA8B,GAAN8F,EAC1BA,CACX,EAGEpG,EAAGF,UAAUmT,KAAO,SAAe5Q,GAEjC,GAAIhC,KAAKG,OAAS6B,EAAI7B,OAAQ,OAAO,EACrC,GAAIH,KAAKG,OAAS6B,EAAI7B,OAAQ,OAAQ,EAGtC,IADA,IAAI4F,EAAM,EACDnE,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CACzC,IAAI8C,EAAoB,EAAhB1E,KAAKE,MAAM0B,GACfJ,EAAmB,EAAfQ,EAAI9B,MAAM0B,GAElB,GAAI8C,IAAMlD,EAAV,CACIkD,EAAIlD,EACNuE,GAAO,EACErB,EAAIlD,IACbuE,EAAM,GAER,KANsB,CAOvB,CACD,OAAOA,CACX,EAEEpG,EAAGF,UAAUoT,IAAM,SAAc7Q,GAC/B,OAA0B,IAAnBhC,KAAKyS,KAAKzQ,EACrB,EAEErC,EAAGF,UAAUqT,GAAK,SAAa9Q,GAC7B,OAAyB,IAAlBhC,KAAKsC,IAAIN,EACpB,EAEErC,EAAGF,UAAUsT,KAAO,SAAe/Q,GACjC,OAAOhC,KAAKyS,KAAKzQ,IAAQ,CAC7B,EAEErC,EAAGF,UAAUuT,IAAM,SAAchR,GAC/B,OAAOhC,KAAKsC,IAAIN,IAAQ,CAC5B,EAEErC,EAAGF,UAAUwT,IAAM,SAAcjR,GAC/B,OAA2B,IAApBhC,KAAKyS,KAAKzQ,EACrB,EAEErC,EAAGF,UAAUyT,GAAK,SAAalR,GAC7B,OAA0B,IAAnBhC,KAAKsC,IAAIN,EACpB,EAEErC,EAAGF,UAAU0T,KAAO,SAAenR,GACjC,OAAOhC,KAAKyS,KAAKzQ,IAAQ,CAC7B,EAEErC,EAAGF,UAAU2T,IAAM,SAAcpR,GAC/B,OAAOhC,KAAKsC,IAAIN,IAAQ,CAC5B,EAEErC,EAAGF,UAAU4T,IAAM,SAAcrR,GAC/B,OAA0B,IAAnBhC,KAAKyS,KAAKzQ,EACrB,EAEErC,EAAGF,UAAU6T,GAAK,SAAatR,GAC7B,OAAyB,IAAlBhC,KAAKsC,IAAIN,EACpB,EAMErC,EAAGS,IAAM,SAAc4B,GACrB,OAAO,IAAIuR,EAAIvR,EACnB,EAEErC,EAAGF,UAAU+T,MAAQ,SAAgBC,GAGnC,OAFAzU,GAAQgB,KAAKI,IAAK,yCAClBpB,EAAyB,IAAlBgB,KAAKC,SAAgB,iCACrBwT,EAAIC,UAAU1T,MAAM2T,UAAUF,EACzC,EAEE9T,EAAGF,UAAUmU,QAAU,WAErB,OADA5U,EAAOgB,KAAKI,IAAK,wDACVJ,KAAKI,IAAIyT,YAAY7T,KAChC,EAEEL,EAAGF,UAAUkU,UAAY,SAAoBF,GAE3C,OADAzT,KAAKI,IAAMqT,EACJzT,IACX,EAEEL,EAAGF,UAAUqU,SAAW,SAAmBL,GAEzC,OADAzU,GAAQgB,KAAKI,IAAK,yCACXJ,KAAK2T,UAAUF,EAC1B,EAEE9T,EAAGF,UAAUsU,OAAS,SAAiB/R,GAErC,OADAhD,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIuI,IAAI3I,KAAMgC,EAC9B,EAEErC,EAAGF,UAAUuU,QAAU,SAAkBhS,GAEvC,OADAhD,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIqI,KAAKzI,KAAMgC,EAC/B,EAEErC,EAAGF,UAAUwU,OAAS,SAAiBjS,GAErC,OADAhD,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIwI,IAAI5I,KAAMgC,EAC9B,EAEErC,EAAGF,UAAUyU,QAAU,SAAkBlS,GAEvC,OADAhD,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIsI,KAAK1I,KAAMgC,EAC/B,EAEErC,EAAGF,UAAU0U,OAAS,SAAiBnS,GAErC,OADAhD,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIgU,IAAIpU,KAAMgC,EAC9B,EAEErC,EAAGF,UAAU4U,OAAS,SAAiBrS,GAGrC,OAFAhD,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIkU,SAAStU,KAAMgC,GACjBhC,KAAKI,IAAImB,IAAIvB,KAAMgC,EAC9B,EAEErC,EAAGF,UAAU8U,QAAU,SAAkBvS,GAGvC,OAFAhD,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIkU,SAAStU,KAAMgC,GACjBhC,KAAKI,IAAIyM,KAAK7M,KAAMgC,EAC/B,EAEErC,EAAGF,UAAU+U,OAAS,WAGpB,OAFAxV,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIqU,SAASzU,MACXA,KAAKI,IAAImO,IAAIvO,KACxB,EAEEL,EAAGF,UAAUiV,QAAU,WAGrB,OAFA1V,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIqU,SAASzU,MACXA,KAAKI,IAAIoO,KAAKxO,KACzB,EAGEL,EAAGF,UAAUkV,QAAU,WAGrB,OAFA3V,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIqU,SAASzU,MACXA,KAAKI,IAAIwU,KAAK5U,KACzB,EAEEL,EAAGF,UAAUoV,QAAU,WAGrB,OAFA7V,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIqU,SAASzU,MACXA,KAAKI,IAAIsS,KAAK1S,KACzB,EAGEL,EAAGF,UAAUqV,OAAS,WAGpB,OAFA9V,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIqU,SAASzU,MACXA,KAAKI,IAAImH,IAAIvH,KACxB,EAEEL,EAAGF,UAAUsV,OAAS,SAAiB/S,GAGrC,OAFAhD,EAAOgB,KAAKI,MAAQ4B,EAAI5B,IAAK,qBAC7BJ,KAAKI,IAAIqU,SAASzU,MACXA,KAAKI,IAAIsD,IAAI1D,KAAMgC,EAC9B,EAGE,IAAIgT,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMnE,GAErBnR,KAAKsV,KAAOA,EACZtV,KAAKmR,EAAI,IAAIxR,EAAGwR,EAAG,IACnBnR,KAAKuV,EAAIvV,KAAKmR,EAAEzK,YAChB1G,KAAK6E,EAAI,IAAIlF,EAAG,GAAGgP,OAAO3O,KAAKuV,GAAG7M,KAAK1I,KAAKmR,GAE5CnR,KAAKwV,IAAMxV,KAAKyV,MACjB,CAgDD,SAASC,IACPL,EAAOM,KACL3V,KACA,OACA,0EACH,CA8DD,SAAS4V,IACPP,EAAOM,KACL3V,KACA,OACA,iEACH,CAGD,SAAS6V,IACPR,EAAOM,KACL3V,KACA,OACA,wDACH,CAGD,SAAS8V,IAEPT,EAAOM,KACL3V,KACA,QACA,sEACH,CA6CD,SAASuT,EAAKjD,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIyF,EAAQpW,EAAGqW,OAAO1F,GACtBtQ,KAAKsQ,EAAIyF,EAAM5E,EACfnR,KAAK+V,MAAQA,CACnB,MACM/W,EAAOsR,EAAEuC,IAAI,GAAI,kCACjB7S,KAAKsQ,EAAIA,EACTtQ,KAAK+V,MAAQ,IAEhB,CAkOD,SAASE,EAAM3F,GACbiD,EAAIoC,KAAK3V,KAAMsQ,GAEftQ,KAAKoG,MAAQpG,KAAKsQ,EAAE5J,YAChB1G,KAAKoG,MAAQ,IAAO,IACtBpG,KAAKoG,OAAS,GAAMpG,KAAKoG,MAAQ,IAGnCpG,KAAKkB,EAAI,IAAIvB,EAAG,GAAGgP,OAAO3O,KAAKoG,OAC/BpG,KAAKiR,GAAKjR,KAAKkW,KAAKlW,KAAKkB,EAAEqN,OAC3BvO,KAAKmW,KAAOnW,KAAKkB,EAAEmR,OAAOrS,KAAKsQ,GAE/BtQ,KAAKoW,KAAOpW,KAAKmW,KAAK5U,IAAIvB,KAAKkB,GAAG4O,MAAM,GAAGW,IAAIzQ,KAAKsQ,GACpDtQ,KAAKoW,KAAOpW,KAAKoW,KAAKvF,KAAK7Q,KAAKkB,GAChClB,KAAKoW,KAAOpW,KAAKkB,EAAE0H,IAAI5I,KAAKoW,KAC7B,CA/aDf,EAAO5V,UAAUgW,KAAO,WACtB,IAAID,EAAM,IAAI7V,EAAG,MAEjB,OADA6V,EAAItV,MAAQ,IAAI+B,MAAMP,KAAKoB,KAAK9C,KAAKuV,EAAI,KAClCC,CACX,EAEEH,EAAO5V,UAAU4W,QAAU,SAAkBrU,GAG3C,IACIsU,EADApV,EAAIc,EAGR,GACEhC,KAAKuW,MAAMrV,EAAGlB,KAAKwV,KAGnBc,GADApV,GADAA,EAAIlB,KAAKwW,MAAMtV,IACTuH,KAAKzI,KAAKwV,MACP9O,kBACF4P,EAAOtW,KAAKuV,GAErB,IAAIjT,EAAMgU,EAAOtW,KAAKuV,GAAK,EAAIrU,EAAE0R,KAAK5S,KAAKmR,GAgB3C,OAfY,IAAR7O,GACFpB,EAAEhB,MAAM,GAAK,EACbgB,EAAEf,OAAS,GACFmC,EAAM,EACfpB,EAAEwH,KAAK1I,KAAKmR,QAEIsF,IAAZvV,EAAEwV,MAEJxV,EAAEwV,QAGFxV,EAAEgC,SAIChC,CACX,EAEEmU,EAAO5V,UAAU8W,MAAQ,SAAgBI,EAAOlS,GAC9CkS,EAAM1H,OAAOjP,KAAKuV,EAAG,EAAG9Q,EAC5B,EAEE4Q,EAAO5V,UAAU+W,MAAQ,SAAgBxU,GACvC,OAAOA,EAAI6K,KAAK7M,KAAK6E,EACzB,EAQEzF,EAASsW,EAAML,GAEfK,EAAKjW,UAAU8W,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAAIvH,EAAO,QAEPwH,EAASnV,KAAKC,IAAIgV,EAAMxW,OAAQ,GAC3ByB,EAAI,EAAGA,EAAIiV,EAAQjV,IAC1BgV,EAAO1W,MAAM0B,GAAK+U,EAAMzW,MAAM0B,GAIhC,GAFAgV,EAAOzW,OAAS0W,EAEZF,EAAMxW,QAAU,EAGlB,OAFAwW,EAAMzW,MAAM,GAAK,OACjByW,EAAMxW,OAAS,GAKjB,IAAI2W,EAAOH,EAAMzW,MAAM,GAGvB,IAFA0W,EAAO1W,MAAM0W,EAAOzW,UAAY2W,EAAOzH,EAElCzN,EAAI,GAAIA,EAAI+U,EAAMxW,OAAQyB,IAAK,CAClC,IAAImV,EAAwB,EAAjBJ,EAAMzW,MAAM0B,GACvB+U,EAAMzW,MAAM0B,EAAI,KAAQmV,EAAO1H,IAAS,EAAMyH,IAAS,GACvDA,EAAOC,CACR,CACDD,KAAU,GACVH,EAAMzW,MAAM0B,EAAI,IAAMkV,EACT,IAATA,GAAcH,EAAMxW,OAAS,GAC/BwW,EAAMxW,QAAU,GAEhBwW,EAAMxW,QAAU,CAEtB,EAEEuV,EAAKjW,UAAU+W,MAAQ,SAAgBxU,GAErCA,EAAI9B,MAAM8B,EAAI7B,QAAU,EACxB6B,EAAI9B,MAAM8B,EAAI7B,OAAS,GAAK,EAC5B6B,EAAI7B,QAAU,EAId,IADA,IAAIwE,EAAK,EACA/C,EAAI,EAAGA,EAAII,EAAI7B,OAAQyB,IAAK,CACnC,IAAIoB,EAAmB,EAAfhB,EAAI9B,MAAM0B,GAClB+C,GAAU,IAAJ3B,EACNhB,EAAI9B,MAAM0B,GAAU,SAAL+C,EACfA,EAAS,GAAJ3B,GAAa2B,EAAK,SAAa,EACrC,CASD,OANkC,IAA9B3C,EAAI9B,MAAM8B,EAAI7B,OAAS,KACzB6B,EAAI7B,SAC8B,IAA9B6B,EAAI9B,MAAM8B,EAAI7B,OAAS,IACzB6B,EAAI7B,UAGD6B,CACX,EAQE5C,EAASwW,EAAMP,GAQfjW,EAASyW,EAAMR,GASfjW,EAAS0W,EAAQT,GAEjBS,EAAOrW,UAAU+W,MAAQ,SAAgBxU,GAGvC,IADA,IAAI4C,EAAQ,EACHhD,EAAI,EAAGA,EAAII,EAAI7B,OAAQyB,IAAK,CACnC,IAAI+E,EAA0B,IAAL,EAAf3E,EAAI9B,MAAM0B,IAAiBgD,EACjCD,EAAU,SAALgC,EACTA,KAAQ,GAER3E,EAAI9B,MAAM0B,GAAK+C,EACfC,EAAQ+B,CACT,CAID,OAHc,IAAV/B,IACF5C,EAAI9B,MAAM8B,EAAI7B,UAAYyE,GAErB5C,CACX,EAGErC,EAAGqW,OAAS,SAAgBV,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIS,EACJ,GAAa,SAATT,EACFS,EAAQ,IAAIL,OACP,GAAa,SAATJ,EACTS,EAAQ,IAAIH,OACP,GAAa,SAATN,EACTS,EAAQ,IAAIF,MACP,IAAa,WAATP,EAGT,MAAM,IAAInW,MAAM,iBAAmBmW,GAFnCS,EAAQ,IAAID,CAGb,CAGD,OAFAd,EAAOM,GAAQS,EAERA,CACX,EAiBExC,EAAI9T,UAAUgV,SAAW,SAAmB/P,GAC1C1F,EAAsB,IAAf0F,EAAEzE,SAAgB,iCACzBjB,EAAO0F,EAAEtE,IAAK,kCAClB,EAEEmT,EAAI9T,UAAU6U,SAAW,SAAmB5P,EAAGlD,GAC7CxC,EAAqC,IAA7B0F,EAAEzE,SAAWuB,EAAEvB,UAAiB,iCACxCjB,EAAO0F,EAAEtE,KAAOsE,EAAEtE,MAAQoB,EAAEpB,IAC1B,kCACN,EAEEmT,EAAI9T,UAAUyW,KAAO,SAAexR,GAClC,OAAI1E,KAAK+V,MAAc/V,KAAK+V,MAAMM,QAAQ3R,GAAGiP,UAAU3T,OAEvD6B,EAAK6C,EAAGA,EAAEmM,KAAK7Q,KAAKsQ,GAAGqD,UAAU3T,OAC1B0E,EACX,EAEE6O,EAAI9T,UAAU8H,IAAM,SAAc7C,GAChC,OAAIA,EAAEU,SACGV,EAAEb,QAGJ7D,KAAKsQ,EAAE1H,IAAIlE,GAAGiP,UAAU3T,KACnC,EAEEuT,EAAI9T,UAAUkJ,IAAM,SAAcjE,EAAGlD,GACnCxB,KAAKsU,SAAS5P,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAEiE,IAAInH,GAIhB,OAHIuE,EAAIzD,IAAItC,KAAKsQ,IAAM,GACrBvK,EAAI2C,KAAK1I,KAAKsQ,GAETvK,EAAI4N,UAAU3T,KACzB,EAEEuT,EAAI9T,UAAUgJ,KAAO,SAAe/D,EAAGlD,GACrCxB,KAAKsU,SAAS5P,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAE+D,KAAKjH,GAIjB,OAHIuE,EAAIzD,IAAItC,KAAKsQ,IAAM,GACrBvK,EAAI2C,KAAK1I,KAAKsQ,GAETvK,CACX,EAEEwN,EAAI9T,UAAUmJ,IAAM,SAAclE,EAAGlD,GACnCxB,KAAKsU,SAAS5P,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAEkE,IAAIpH,GAIhB,OAHIuE,EAAI0M,KAAK,GAAK,GAChB1M,EAAI0C,KAAKzI,KAAKsQ,GAETvK,EAAI4N,UAAU3T,KACzB,EAEEuT,EAAI9T,UAAUiJ,KAAO,SAAehE,EAAGlD,GACrCxB,KAAKsU,SAAS5P,EAAGlD,GAEjB,IAAIuE,EAAMrB,EAAEgE,KAAKlH,GAIjB,OAHIuE,EAAI0M,KAAK,GAAK,GAChB1M,EAAI0C,KAAKzI,KAAKsQ,GAETvK,CACX,EAEEwN,EAAI9T,UAAU2U,IAAM,SAAc1P,EAAG1C,GAEnC,OADAhC,KAAKyU,SAAS/P,GACP1E,KAAKkW,KAAKxR,EAAE+K,MAAMzN,GAC7B,EAEEuR,EAAI9T,UAAUoN,KAAO,SAAenI,EAAGlD,GAErC,OADAxB,KAAKsU,SAAS5P,EAAGlD,GACVxB,KAAKkW,KAAKxR,EAAEmI,KAAKrL,GAC5B,EAEE+R,EAAI9T,UAAU8B,IAAM,SAAcmD,EAAGlD,GAEnC,OADAxB,KAAKsU,SAAS5P,EAAGlD,GACVxB,KAAKkW,KAAKxR,EAAEnD,IAAIC,GAC3B,EAEE+R,EAAI9T,UAAU+O,KAAO,SAAe9J,GAClC,OAAO1E,KAAK6M,KAAKnI,EAAGA,EAAEb,QAC1B,EAEE0P,EAAI9T,UAAU8O,IAAM,SAAc7J,GAChC,OAAO1E,KAAKuB,IAAImD,EAAGA,EACvB,EAEE6O,EAAI9T,UAAUmV,KAAO,SAAelQ,GAClC,GAAIA,EAAEU,SAAU,OAAOV,EAAEb,QAEzB,IAAImT,EAAOhX,KAAKsQ,EAAEY,MAAM,GAIxB,GAHAlS,EAAOgY,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAItT,EAAM1D,KAAKsQ,EAAE3H,IAAI,IAAIhJ,EAAG,IAAIsP,OAAO,GACvC,OAAOjP,KAAK0D,IAAIgB,EAAGhB,EACpB,CAOD,IAFA,IAAIgL,EAAI1O,KAAKsQ,EAAEN,KAAK,GAChBnB,EAAI,GACAH,EAAEtJ,UAA2B,IAAfsJ,EAAEwC,MAAM,IAC5BrC,IACAH,EAAEO,OAAO,GAEXjQ,GAAQ0P,EAAEtJ,UAEV,IAAI6R,EAAM,IAAItX,EAAG,GAAG6T,MAAMxT,MACtBkX,EAAOD,EAAInC,SAIXqC,EAAOnX,KAAKsQ,EAAEN,KAAK,GAAGf,OAAO,GAC7BmI,EAAIpX,KAAKsQ,EAAE5J,YAGf,IAFA0Q,EAAI,IAAIzX,EAAG,EAAIyX,EAAIA,GAAG5D,MAAMxT,MAEW,IAAhCA,KAAK0D,IAAI0T,EAAGD,GAAM7U,IAAI4U,IAC3BE,EAAEpD,QAAQkD,GAOZ,IAJA,IAAIpW,EAAId,KAAK0D,IAAI0T,EAAG1I,GAChBxN,EAAIlB,KAAK0D,IAAIgB,EAAGgK,EAAEqB,KAAK,GAAGd,OAAO,IACjCzI,EAAIxG,KAAK0D,IAAIgB,EAAGgK,GAChB4B,EAAIzB,EACc,IAAfrI,EAAElE,IAAI2U,IAAY,CAEvB,IADA,IAAIzB,EAAMhP,EACD5E,EAAI,EAAoB,IAAjB4T,EAAIlT,IAAI2U,GAAYrV,IAClC4T,EAAMA,EAAIhB,SAEZxV,EAAO4C,EAAI0O,GACX,IAAI9O,EAAIxB,KAAK0D,IAAI5C,EAAG,IAAInB,EAAG,GAAGgP,OAAO2B,EAAI1O,EAAI,IAE7CV,EAAIA,EAAEmT,OAAO7S,GACbV,EAAIU,EAAEgT,SACNhO,EAAIA,EAAE6N,OAAOvT,GACbwP,EAAI1O,CACL,CAED,OAAOV,CACX,EAEEqS,EAAI9T,UAAUiT,KAAO,SAAehO,GAClC,IAAI2S,EAAM3S,EAAE2N,OAAOrS,KAAKsQ,GACxB,OAAqB,IAAjB+G,EAAIpX,UACNoX,EAAIpX,SAAW,EACRD,KAAKkW,KAAKmB,GAAKvC,UAEf9U,KAAKkW,KAAKmB,EAEvB,EAEE9D,EAAI9T,UAAUiE,IAAM,SAAcgB,EAAG1C,GACnC,GAAIA,EAAIoD,SAAU,OAAO,IAAIzF,EAAG,GAAG6T,MAAMxT,MACzC,GAAoB,IAAhBgC,EAAIyQ,KAAK,GAAU,OAAO/N,EAAEb,QAEhC,IACIyT,EAAM,IAAIrV,MAAM,IACpBqV,EAAI,GAAK,IAAI3X,EAAG,GAAG6T,MAAMxT,MACzBsX,EAAI,GAAK5S,EACT,IAAK,IAAI9C,EAAI,EAAGA,EAAI0V,EAAInX,OAAQyB,IAC9B0V,EAAI1V,GAAK5B,KAAKuB,IAAI+V,EAAI1V,EAAI,GAAI8C,GAGhC,IAAIqB,EAAMuR,EAAI,GACVC,EAAU,EACVC,EAAa,EACbnW,EAAQW,EAAI0E,YAAc,GAK9B,IAJc,IAAVrF,IACFA,EAAQ,IAGLO,EAAII,EAAI7B,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI2B,EAAOvB,EAAI9B,MAAM0B,GACZmB,EAAI1B,EAAQ,EAAG0B,GAAK,EAAGA,IAAK,CACnC,IAAIwF,EAAOhF,GAAQR,EAAK,EACpBgD,IAAQuR,EAAI,KACdvR,EAAM/F,KAAKuO,IAAIxI,IAGL,IAARwC,GAAyB,IAAZgP,GAKjBA,IAAY,EACZA,GAAWhP,GA9BE,KA+BbiP,GACwC,IAAN5V,GAAiB,IAANmB,KAE7CgD,EAAM/F,KAAKuB,IAAIwE,EAAKuR,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYhB,CACDnW,EAAQ,EACT,CAED,OAAO0E,CACX,EAEEwN,EAAI9T,UAAUiU,UAAY,SAAoB1R,GAC5C,IAAId,EAAIc,EAAI6O,KAAK7Q,KAAKsQ,GAEtB,OAAOpP,IAAMc,EAAMd,EAAE2C,QAAU3C,CACnC,EAEEqS,EAAI9T,UAAUoU,YAAc,SAAsB7R,GAChD,IAAI+D,EAAM/D,EAAI6B,QAEd,OADAkC,EAAI3F,IAAM,KACH2F,CACX,EAMEpG,EAAG8X,KAAO,SAAezV,GACvB,OAAO,IAAIiU,EAAKjU,EACpB,EAkBE5C,EAAS6W,EAAM1C,GAEf0C,EAAKxW,UAAUiU,UAAY,SAAoB1R,GAC7C,OAAOhC,KAAKkW,KAAKlU,EAAIyN,MAAMzP,KAAKoG,OACpC,EAEE6P,EAAKxW,UAAUoU,YAAc,SAAsB7R,GACjD,IAAId,EAAIlB,KAAKkW,KAAKlU,EAAIT,IAAIvB,KAAKmW,OAE/B,OADAjV,EAAEd,IAAM,KACDc,CACX,EAEE+U,EAAKxW,UAAUoN,KAAO,SAAenI,EAAGlD,GACtC,GAAIkD,EAAEU,UAAY5D,EAAE4D,SAGlB,OAFAV,EAAExE,MAAM,GAAK,EACbwE,EAAEvE,OAAS,EACJuE,EAGT,IAAI8B,EAAI9B,EAAEmI,KAAKrL,GACXV,EAAI0F,EAAEqJ,MAAM7P,KAAKoG,OAAO7E,IAAIvB,KAAKoW,MAAMxG,OAAO5P,KAAKoG,OAAO7E,IAAIvB,KAAKsQ,GACnEoH,EAAIlR,EAAEkC,KAAK5H,GAAGmO,OAAOjP,KAAKoG,OAC1BL,EAAM2R,EAQV,OANIA,EAAEpV,IAAItC,KAAKsQ,IAAM,EACnBvK,EAAM2R,EAAEhP,KAAK1I,KAAKsQ,GACToH,EAAEjF,KAAK,GAAK,IACrB1M,EAAM2R,EAAEjP,KAAKzI,KAAKsQ,IAGbvK,EAAI4N,UAAU3T,KACzB,EAEEiW,EAAKxW,UAAU8B,IAAM,SAAcmD,EAAGlD,GACpC,GAAIkD,EAAEU,UAAY5D,EAAE4D,SAAU,OAAO,IAAIzF,EAAG,GAAGgU,UAAU3T,MAEzD,IAAIwG,EAAI9B,EAAEnD,IAAIC,GACVV,EAAI0F,EAAEqJ,MAAM7P,KAAKoG,OAAO7E,IAAIvB,KAAKoW,MAAMxG,OAAO5P,KAAKoG,OAAO7E,IAAIvB,KAAKsQ,GACnEoH,EAAIlR,EAAEkC,KAAK5H,GAAGmO,OAAOjP,KAAKoG,OAC1BL,EAAM2R,EAOV,OANIA,EAAEpV,IAAItC,KAAKsQ,IAAM,EACnBvK,EAAM2R,EAAEhP,KAAK1I,KAAKsQ,GACToH,EAAEjF,KAAK,GAAK,IACrB1M,EAAM2R,EAAEjP,KAAKzI,KAAKsQ,IAGbvK,EAAI4N,UAAU3T,KACzB,EAEEiW,EAAKxW,UAAUiT,KAAO,SAAehO,GAGnC,OADU1E,KAAKkW,KAAKxR,EAAE2N,OAAOrS,KAAKsQ,GAAG/O,IAAIvB,KAAKiR,KACnC0C,UAAU3T,KACzB,CACC,CA19GD,GA09G4CA,gCCt9G/B2X,EAAa,IAAIhY,EAC1B,iFAESiY,EAA2B,IAAIjY,EACxC,+EAISkY,EAAc,8CACdC,EAAe,8CACfC,EACT,8CAESC,EAA0B,IACnC,IAAIC,EAAU,gDAELC,EAAiC,IAC1CD,EAAUE,uBACN,CAAC7X,EAAO8X,KAAK,kBACb,IAAIH,EAEAH,IAEN,GAEOO,EAAwB,IAAM,CACvC,IAAIJ,EAAUD,KACd,IAAIC,EAAUJ,GACd,IAAII,EAAUF,GACd,IAAIE,EAAUC,MAELI,EAA8B,KAChC,CACHC,qBAAsB,IAAIN,EAAUD,KACpCH,YAAa,IAAII,EAAUJ,GAC3BE,0BAA2B,IAAIE,EAAUF,GACzCS,4BAA6B,IAAIP,EAC7BC,KAEJO,oBAAqB,OAIhBC,EAA+B,KACjC,CACHC,eAAgB,IAAIV,EAAUW,GAC9BC,WAAY,IAAIZ,EAAUa,GAC1BC,iBAAkBC,EAClBC,YAAa,IAAIhB,EAAUgB,GAC3BC,aAAc,IAAIjB,EAAUiB,KAIvBN,EACT,8CAESE,EAAmB,8CACnBG,EAAc,8CACdC,EAAe,8CAEfC,EAAgC,CACzCC,WAAY,YACZC,oBAAqB,aAGZL,EAA6B,GAC7BM,EAA4B,KAE5BC,EAAuB,GACvBC,EAAqB,GAMrBC,EAA6C,IAAI9Z,EAC1D+B,KAAKgY,MAAM,GAAKV,EAA6B,MAUpCW,EAAiC,IAAIha,EAAG,KASxCia,EAA6B,IAAIja,EAAG,KAKpCka,EAAgC,IAAIla,EAAG,KAKvCma,EAA2B,IAAIna,EAAG,KC5G/C,IACeoa,ECGf,SAAeC,GAEb,MAAMC,EAAW,IAAIC,WAAW,KAChC,IAAK,IAAInX,EAAI,EAAGA,EAAIkX,EAAS9Z,OAAQ4C,IACnCkX,EAASlX,GAAK,IAEhB,IAAK,IAAInB,EAAI,EAAGA,EAAIoY,GAAiBpY,IAAK,CACxC,MAAM2P,EAAIyI,EAASG,OAAOvY,GACpBwY,EAAK7I,EAAExQ,WAAW,GACxB,GAAqB,MAAjBkZ,EAASG,GAAe,MAAM,IAAIC,UAAU9I,EAAI,iBACpD0I,EAASG,GAAMxY,CAChB,CACD,MACM0Y,EAASN,EAASG,OAAO,GACzBI,EAAS7Y,KAAK8Y,IAFPR,IAEmBtY,KAAK8Y,IAAI,KACnCC,EAAU/Y,KAAK8Y,IAAI,KAAO9Y,KAAK8Y,IAHxBR,IAiDb,SAASU,EAAcC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAIN,UAAU,mBACtD,GAAsB,IAAlBM,EAAOxa,OAAgB,OAAO,IAAI+Z,WACtC,IAAIU,EAAM,EAENC,EAAS,EACT1a,EAAS,EACb,KAAOwa,EAAOC,KAASN,GACrBO,IACAD,IAGF,MAAM7W,GAAU4W,EAAOxa,OAASya,GAAOL,EAAU,IAAO,EAClDO,EAAO,IAAIZ,WAAWnW,GAE5B,KAAO4W,EAAOC,IAAM,CAElB,IAAIhW,EAAQqV,EAASU,EAAO5Z,WAAW6Z,IAEvC,GAAc,MAAVhW,EAAiB,OACrB,IAAIhD,EAAI,EACR,IAAK,IAAImZ,EAAMhX,EAAO,GAAc,IAAVa,GAAehD,EAAIzB,KAAqB,IAAT4a,EAAaA,IAAOnZ,IAC3EgD,GAvEOoV,GAuEUc,EAAKC,KAAU,EAChCD,EAAKC,GAAQnW,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAIzF,MAAM,kBACnCgB,EAASyB,EACTgZ,GACD,CAED,IAAII,EAAMjX,EAAO5D,EACjB,KAAO6a,IAAQjX,GAAsB,IAAd+W,EAAKE,IAC1BA,IAEF,MAAMC,EAAM,IAAIf,WAAWW,GAAU9W,EAAOiX,IAC5C,IAAIjY,EAAI8X,EACR,KAAOG,IAAQjX,GACbkX,EAAIlY,KAAO+X,EAAKE,KAElB,OAAOC,CACR,CAMD,MAAO,CACLC,OA7FF,SAAiBP,GAOf,GALIA,aAAkBT,aAAyBiB,YAAYC,OAAOT,GAChEA,EAAS,IAAIT,WAAWS,EAAOU,OAAQV,EAAOW,WAAYX,EAAO9U,YACxD5D,MAAMC,QAAQyY,KACvBA,EAAST,WAAW9B,KAAKuC,OAErBA,aAAkBT,YAAe,MAAM,IAAIG,UAAU,uBAC3D,GAAsB,IAAlBM,EAAOxa,OAAgB,MAAO,GAElC,IAAI0a,EAAS,EACT1a,EAAS,EACTob,EAAS,EACb,MAAMC,EAAOb,EAAOxa,OACpB,KAAOob,IAAWC,GAA2B,IAAnBb,EAAOY,IAC/BA,IACAV,IAGF,MAAM9W,GAASyX,EAAOD,GAAUd,EAAU,IAAO,EAC3CgB,EAAM,IAAIvB,WAAWnW,GAE3B,KAAOwX,IAAWC,GAAM,CACtB,IAAI5W,EAAQ+V,EAAOY,GAEf3Z,EAAI,EACR,IAAK,IAAI8Z,EAAM3X,EAAO,GAAc,IAAVa,GAAehD,EAAIzB,KAAqB,IAATub,EAAaA,IAAO9Z,IAC3EgD,GAAU,IAAM6W,EAAIC,KAAU,EAC9BD,EAAIC,GAAQ9W,EAhCLoV,KAgCuB,EAC9BpV,EAASA,EAjCFoV,KAiCoB,EAE7B,GAAc,IAAVpV,EAAe,MAAM,IAAIzF,MAAM,kBACnCgB,EAASyB,EACT2Z,GACD,CAED,IAAII,EAAM5X,EAAO5D,EACjB,KAAOwb,IAAQ5X,GAAqB,IAAb0X,EAAIE,IACzBA,IAGF,IAAIva,EAAMkZ,EAAOsB,OAAOf,GACxB,KAAOc,EAAM5X,IAAQ4X,EAAOva,GAAO4Y,EAASG,OAAOsB,EAAIE,IACvD,OAAOva,CACR,EAkDCsZ,eACAmB,OARF,SAAiBjb,GACf,MAAMya,EAASX,EAAa9Z,GAC5B,GAAIya,EAAU,OAAOA,EACrB,MAAM,IAAIlc,MAAM,uBACjB,EAMH,CDpHe4a,CADA,oEEiBF+B,GAAK,CACdlc,EACAC,EACAC,IACK,IAAIH,EAAGC,EAAQC,EAAMC,GAGjBic,GAAc,CACvBnc,EACAC,KAEA,GAAa,WAATA,EAAmB,CACnB,GAAsB,iBAAXD,EACP,MAAM,IAAIT,MAAM,2BACpB,OAAO4c,GAAYC,EAAKH,OAAOjc,GAClC,CAID,OAQJ,SAAqBqc,GACjB,GAAIA,EAAajJ,IAAI2E,GACjB,MAAM,IAAIxY,MAAM,qCAEpB,OAAO8c,CACX,CAbWC,CAFc,IAAIvc,EAAGC,EAAQC,GAEJ,EAgB9B,SAAUsc,GAAoBF,GAEhC,MACMG,EADQL,GAAYE,GACAtW,YAAYrF,OAAQmW,EAAW,IAEzD,OAAOuF,EAAKd,OAAOkB,EACvB,CC1BO,MAAMC,GAA0B,CACnCC,EACAC,EACAC,EACAC,KACqB,CACrBH,QACAC,SAAUA,GAAYT,GAAG,GACzBW,QAASA,GAAW,KACpBD,KAAMA,GAAQ,OAGLE,GAA2C,CACpDC,EACAL,EACAC,EACAC,EACAC,KACsC,IACnCJ,GAAwBC,EAAOC,EAAUC,EAAMC,MAC/CE,EACHC,SAAU,IAGDC,GAAsB,CAC/BhE,EACAF,EACAmE,EACAC,KACiB,CACjBlE,aACAF,iBACAmE,OACAC,cClEJ,SAASnd,GAAO2V,GACZ,IAAKyH,OAAOC,cAAc1H,IAAMA,EAAI,EAChC,MAAM,IAAIpW,MAAM,kCAAkCoW,IAC1D,CAUA,SAAS2H,GAAM1b,KAAM2b,GACjB,MALoBzY,EAKPlD,aAJQ0Y,YACX,MAALxV,GAA0B,iBAANA,GAAyC,eAAvBA,EAAEhF,YAAY4V,MAIrD,MAAM,IAAInW,MAAM,uBANjB,IAAiBuF,EAOpB,GAAIyY,EAAQhd,OAAS,IAAMgd,EAAQC,SAAS5b,EAAErB,QAC1C,MAAM,IAAIhB,MAAM,iCAAiCge,oBAA0B3b,EAAErB,SACrF,CAOA,SAASkd,GAAOC,EAAUC,EAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAIre,MAAM,oCACpB,GAAIoe,GAAiBD,EAASG,SAC1B,MAAM,IAAIte,MAAM,wCACxB,CC9BA,MAAMue,GAA6BC,OAAO,GAAK,GAAK,GAC9CC,GAAuBD,OAAO,IAEpC,SAASE,GAAQtI,EAAGuI,EAAK,GACrB,OAAIA,EACO,CAAE1O,EAAG4N,OAAOzH,EAAImI,IAAaK,EAAGf,OAAQzH,GAAKqI,GAAQF,KACzD,CAAEtO,EAAsC,EAAnC4N,OAAQzH,GAAKqI,GAAQF,IAAiBK,EAA4B,EAAzBf,OAAOzH,EAAImI,IACpE,CACA,SAASnH,GAAMyH,EAAKF,EAAK,GACrB,IAAIG,EAAK,IAAIC,YAAYF,EAAI7d,QACzBge,EAAK,IAAID,YAAYF,EAAI7d,QAC7B,IAAK,IAAIyB,EAAI,EAAGA,EAAIoc,EAAI7d,OAAQyB,IAAK,CACjC,MAAMwN,EAAEA,EAAC2O,EAAEA,GAAMF,GAAQG,EAAIpc,GAAIkc,IAChCG,EAAGrc,GAAIuc,EAAGvc,IAAM,CAACwN,EAAG2O,EACxB,CACD,MAAO,CAACE,EAAIE,EAChB,CAeA,MCPaC,GAAmE,KAA5D,IAAIlE,WAAW,IAAIgE,YAAY,CAAC,YAAa7C,QAAQ,GASlE,SAASgD,GAAWC,GACvB,IAAK,IAAI1c,EAAI,EAAGA,EAAI0c,EAAIne,OAAQyB,IAC5B0c,EAAI1c,IATa2B,EASC+a,EAAI1c,KATc,GAAM,WAC5C2B,GAAQ,EAAK,SACbA,IAAS,EAAK,MACdA,IAAS,GAAM,IAHG,IAACA,CAWzB,CA8EO,SAASgb,GAAQ/B,GAIpB,MAHoB,iBAATA,IACPA,EAZD,SAAqBpb,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIjC,MAAM,2CAA2CiC,GAC/D,OAAO,IAAI8Y,YAAW,IAAIsE,aAActD,OAAO9Z,GACnD,CAQeqd,CAAYjC,IACvBkC,GAAOlC,GACAA,CACX,CAoBO,MAAMmC,GAET,KAAA9a,GACI,OAAO7D,KAAK4e,YACf,EC1IL,MAAMC,GAAU,GACVC,GAAY,GACZC,GAAa,GACbC,GAAsBrB,OAAO,GAC7BsB,GAAsBtB,OAAO,GAC7BuB,GAAsBvB,OAAO,GAC7BwB,GAAsBxB,OAAO,GAC7ByB,GAAwBzB,OAAO,KAC/B0B,GAAyB1B,OAAO,KACtC,IAAK,IAAI2B,EAAQ,EAAGC,EAAIN,GAAK1N,EAAI,EAAGC,EAAI,EAAG8N,EAAQ,GAAIA,IAAS,EAE3D/N,EAAGC,GAAK,CAACA,GAAI,EAAID,EAAI,EAAIC,GAAK,GAC/BqN,GAAQW,KAAK,GAAK,EAAIhO,EAAID,IAE1BuN,GAAUU,MAAQF,EAAQ,IAAMA,EAAQ,GAAM,EAAK,IAEnD,IAAI9Y,EAAIwY,GACR,IAAK,IAAIjc,EAAI,EAAGA,EAAI,EAAGA,IACnBwc,GAAMA,GAAKN,IAASM,GAAKJ,IAAOE,IAAWD,GACvCG,EAAIL,KACJ1Y,GAAKyY,KAASA,IAAuBtB,OAAO5a,IAAMkc,IAE1DF,GAAWS,KAAKhZ,EACpB,CACA,MAAOiZ,GAAaC,IAA+BnJ,GAAMwI,GAAY,GAE/DY,GAAQ,CAACvQ,EAAG2O,EAAGlP,IAAOA,EAAI,GFEjB,EAACO,EAAG2O,EAAGlP,IAAOkP,GAAMlP,EAAI,GAAQO,IAAO,GAAKP,EEFtB+Q,CAAOxQ,EAAG2O,EAAGlP,GFDnC,EAACO,EAAG2O,EAAGlP,IAAOO,GAAKP,EAAMkP,IAAO,GAAKlP,EECGgR,CAAOzQ,EAAG2O,EAAGlP,GAC9DiR,GAAQ,CAAC1Q,EAAG2O,EAAGlP,IAAOA,EAAI,GFEjB,EAACO,EAAG2O,EAAGlP,IAAOO,GAAMP,EAAI,GAAQkP,IAAO,GAAKlP,EEFtBkR,CAAO3Q,EAAG2O,EAAGlP,GFDnC,EAACO,EAAG2O,EAAGlP,IAAOkP,GAAKlP,EAAMO,IAAO,GAAKP,EECGmR,CAAO5Q,EAAG2O,EAAGlP,GA+C7D,MAAMoR,WAAetB,GAExB,WAAAjf,CAAYwgB,EAAUC,EAAQC,EAAWC,EAAY,EAAOC,EAAS,IAcjE,GAbAC,QACAvgB,KAAKkgB,SAAWA,EAChBlgB,KAAKmgB,OAASA,EACdngB,KAAKogB,UAAYA,EACjBpgB,KAAKqgB,UAAYA,EACjBrgB,KAAKsgB,OAASA,EACdtgB,KAAKwgB,IAAM,EACXxgB,KAAKygB,OAAS,EACdzgB,KAAKyd,SAAW,EAChBzd,KAAKwd,UAAY,EAEjB5d,GAAOwgB,GAEH,GAAKpgB,KAAKkgB,UAAYlgB,KAAKkgB,UAAY,IACvC,MAAM,IAAI/gB,MAAM,4CDhFT,IAACmf,ECiFZte,KAAK0gB,MAAQ,IAAIxG,WAAW,KAC5Bla,KAAK2gB,SDlFOrC,ECkFOte,KAAK0gB,MDlFJ,IAAIxC,YAAYI,EAAIjD,OAAQiD,EAAIhD,WAAY5Z,KAAKgY,MAAM4E,EAAIzY,WAAa,ICmF/F,CACD,MAAA+a,GACSxC,IACDC,GAAWre,KAAK2gB,SApErB,SAAiB9R,EAAGyR,EAAS,IAChC,MAAM5O,EAAI,IAAIwM,YAAY,IAE1B,IAAK,IAAIoB,EAAQ,GAAKgB,EAAQhB,EAAQ,GAAIA,IAAS,CAE/C,IAAK,IAAI/N,EAAI,EAAGA,EAAI,GAAIA,IACpBG,EAAEH,GAAK1C,EAAE0C,GAAK1C,EAAE0C,EAAI,IAAM1C,EAAE0C,EAAI,IAAM1C,EAAE0C,EAAI,IAAM1C,EAAE0C,EAAI,IAC5D,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC5B,MAAMsP,GAAQtP,EAAI,GAAK,GACjBuP,GAAQvP,EAAI,GAAK,GACjBwP,EAAKrP,EAAEoP,GACPE,EAAKtP,EAAEoP,EAAO,GACdG,EAAKtB,GAAMoB,EAAIC,EAAI,GAAKtP,EAAEmP,GAC1BK,EAAKpB,GAAMiB,EAAIC,EAAI,GAAKtP,EAAEmP,EAAO,GACvC,IAAK,IAAIrP,EAAI,EAAGA,EAAI,GAAIA,GAAK,GACzB3C,EAAE0C,EAAIC,IAAMyP,EACZpS,EAAE0C,EAAIC,EAAI,IAAM0P,CAEvB,CAED,IAAIC,EAAOtS,EAAE,GACTuS,EAAOvS,EAAE,GACb,IAAK,IAAIrI,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMJ,EAAQ0Y,GAAUtY,GAClBya,EAAKtB,GAAMwB,EAAMC,EAAMhb,GACvB8a,EAAKpB,GAAMqB,EAAMC,EAAMhb,GACvBib,EAAKxC,GAAQrY,GACnB2a,EAAOtS,EAAEwS,GACTD,EAAOvS,EAAEwS,EAAK,GACdxS,EAAEwS,GAAMJ,EACRpS,EAAEwS,EAAK,GAAKH,CACf,CAED,IAAK,IAAI1P,EAAI,EAAGA,EAAI,GAAIA,GAAK,GAAI,CAC7B,IAAK,IAAID,EAAI,EAAGA,EAAI,GAAIA,IACpBG,EAAEH,GAAK1C,EAAE2C,EAAID,GACjB,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,IACpB1C,EAAE2C,EAAID,KAAOG,GAAGH,EAAI,GAAK,IAAMG,GAAGH,EAAI,GAAK,GAClD,CAED1C,EAAE,IAAM4Q,GAAYH,GACpBzQ,EAAE,IAAM6Q,GAAYJ,EACvB,CACD5N,EAAE4P,KAAK,EACX,CAyBQC,CAAQvhB,KAAK2gB,QAAS3gB,KAAKsgB,QACtBlC,IACDC,GAAWre,KAAK2gB,SACpB3gB,KAAKygB,OAAS,EACdzgB,KAAKwgB,IAAM,CACd,CACD,MAAAgB,CAAOhF,GACHa,GAAOrd,MACP,MAAMkgB,SAAEA,EAAQQ,MAAEA,GAAU1gB,KAEtByB,GADN+a,EAAO+B,GAAQ/B,IACErc,OACjB,IAAK,IAAIqgB,EAAM,EAAGA,EAAM/e,GAAM,CAC1B,MAAMggB,EAAO/f,KAAKC,IAAIue,EAAWlgB,KAAKwgB,IAAK/e,EAAM+e,GACjD,IAAK,IAAI5e,EAAI,EAAGA,EAAI6f,EAAM7f,IACtB8e,EAAM1gB,KAAKwgB,QAAUhE,EAAKgE,KAC1BxgB,KAAKwgB,MAAQN,GACblgB,KAAK4gB,QACZ,CACD,OAAO5gB,IACV,CACD,MAAA0hB,GACI,GAAI1hB,KAAKyd,SACL,OACJzd,KAAKyd,SAAW,EAChB,MAAMiD,MAAEA,EAAKP,OAAEA,EAAMK,IAAEA,EAAGN,SAAEA,GAAalgB,KAEzC0gB,EAAMF,IAAQL,EACU,IAAV,IAATA,IAAwBK,IAAQN,EAAW,GAC5ClgB,KAAK4gB,SACTF,EAAMR,EAAW,IAAM,IACvBlgB,KAAK4gB,QACR,CACD,SAAAe,CAAUld,GACN4Y,GAAOrd,KAAM,GACbkd,GAAMzY,GACNzE,KAAK0hB,SACL,MAAME,EAAY5hB,KAAK0gB,OACjBR,SAAEA,GAAalgB,KACrB,IAAK,IAAIwgB,EAAM,EAAG/e,EAAMgD,EAAItE,OAAQqgB,EAAM/e,GAAM,CACxCzB,KAAKygB,QAAUP,GACflgB,KAAK4gB,SACT,MAAMa,EAAO/f,KAAKC,IAAIue,EAAWlgB,KAAKygB,OAAQhf,EAAM+e,GACpD/b,EAAIod,IAAID,EAAUE,SAAS9hB,KAAKygB,OAAQzgB,KAAKygB,OAASgB,GAAOjB,GAC7DxgB,KAAKygB,QAAUgB,EACfjB,GAAOiB,CACV,CACD,OAAOhd,CACV,CACD,OAAAsd,CAAQtd,GAEJ,IAAKzE,KAAKqgB,UACN,MAAM,IAAIlhB,MAAM,yCACpB,OAAOa,KAAK2hB,UAAUld,EACzB,CACD,GAAAud,CAAI9E,GAEA,OADAtd,GAAOsd,GACAld,KAAK+hB,QAAQ,IAAI7H,WAAWgD,GACtC,CACD,UAAA+E,CAAWxd,GAEP,GHrIR,SAAgBA,EAAK6Y,GACjBJ,GAAMzY,GACN,MAAM9C,EAAM2b,EAAS8C,UACrB,GAAI3b,EAAItE,OAASwB,EACb,MAAM,IAAIxC,MAAM,yDAAyDwC,IAEjF,CG8HQiV,CAAOnS,EAAKzE,MACRA,KAAKyd,SACL,MAAM,IAAIte,MAAM,+BAGpB,OAFAa,KAAK2hB,UAAUld,GACfzE,KAAKkiB,UACEzd,CACV,CACD,MAAA0d,GACI,OAAOniB,KAAKiiB,WAAW,IAAI/H,WAAWla,KAAKogB,WAC9C,CACD,OAAA8B,GACIliB,KAAKwd,UAAY,EACjBxd,KAAK0gB,MAAMY,KAAK,EACnB,CACD,UAAA1C,CAAWwD,GACP,MAAMlC,SAAEA,EAAQC,OAAEA,EAAMC,UAAEA,EAASE,OAAEA,EAAMD,UAAEA,GAAcrgB,KAY3D,OAXAoiB,IAAOA,EAAK,IAAInC,GAAOC,EAAUC,EAAQC,EAAWC,EAAWC,IAC/D8B,EAAGzB,QAAQkB,IAAI7hB,KAAK2gB,SACpByB,EAAG5B,IAAMxgB,KAAKwgB,IACd4B,EAAG3B,OAASzgB,KAAKygB,OACjB2B,EAAG3E,SAAWzd,KAAKyd,SACnB2E,EAAG9B,OAASA,EAEZ8B,EAAGjC,OAASA,EACZiC,EAAGhC,UAAYA,EACfgC,EAAG/B,UAAYA,EACf+B,EAAG5E,UAAYxd,KAAKwd,UACb4E,CACV,EAEL,MAcaC,GAdD,KDxCL,SAAyBC,GAC5B,MAAMC,EAASrjB,GAAQojB,IAAWd,OAAOjD,GAAQrf,IAAMijB,SACjD3M,EAAM8M,IAIZ,OAHAC,EAAMnC,UAAY5K,EAAI4K,UACtBmC,EAAMrC,SAAW1K,EAAI0K,SACrBqC,EAAMC,OAAS,IAAMF,IACdC,CACX,CCiC6CE,EAAgB,IAAM,IAAIxC,GAcnB,IAAN,EAAW,MAAfyC,GCxMpC,SAAUC,GAAmBC,GAC/B,OAAOC,EAAQC,cAAc5I,WAAW9B,KAAKwK,GACjD,CAKM,SAAUG,GAAMjH,GAClB,MAAO,KAAOA,EAAGrZ,SAAS,MAC9B,CAEa,MAAAI,GAAcmgB,GACvB/gB,MAAMC,QAAQ8gB,GAASA,EAAQ,CAACA,GAEvBC,GAAeC,GACjBnH,GAAYmH,GAAKzgB,WAE5B,SAAS0gB,GAA8BjG,GAEnC,OADepB,GAAGoB,OAAOzG,EAAW,MACtBvD,GAAGyE,EACrB,CASM,SAAUyL,GAAuBlG,GAUnC,IAAImG,EAAW,IACf,KAAOA,GAAY,GAAG,CAClB,MAAMC,EAAoBhjB,EAAOijB,OAAO,CACpCrG,EACA5c,EAAO8X,KAAK,CAACiL,MAEXvG,EAAOuF,GAAWiB,GACxB,GAAoB,KAAhBxG,EAAK3c,OACL,MAAM,IAAIhB,MAAM,uBAIpB,GAFA2d,EAAK,GAAK,EAENqG,GAA8B7iB,EAAO8X,KAAK0E,IAC1C,MAAO,CAACxc,EAAO8X,KAAK0E,GAAOuG,GAG/BA,GAAY,CACf,CACD,OAAO,IACX,CAUM,SAAUG,GAAwBtG,GACpC,MAAMuG,EAASpB,GAAWG,SAC1B,IAAK,MAAM7L,KAASuG,EAChBuG,EAAOjC,OAAO7K,GAElB,MAAMmG,EAAO2G,EAAOtB,SAEpB,OADArF,EAAK,GAAK,EACHA,CACX,CAGgB,SAAA4G,GAAmBC,EAAYC,GAC3CD,EAAME,SAAQC,IACLF,EAAIxG,SAAS0G,IACdF,EAAIpE,KAAKsE,EACZ,GAET,CAEM,SAAUC,GACZC,GAEA,OAAI/hB,MAAMC,QAAQ8hB,GACPA,EAAIJ,KAAIK,GAAKF,GAAYE,KACjB,OAARD,GAAgBA,EAAItkB,cAAgBwkB,OACpCA,OAAOC,KAAKH,GAAKI,QAAO,CAACC,EAAQC,KAIpCD,EAHqBC,EAAI5hB,QAAQ,iBAAiB6hB,GACvCA,EAAGC,cAAc9hB,QAAQ,IAAK,IAAIA,QAAQ,IAAK,OAEnCqhB,GAAYC,EAAIM,IAChCD,IACR,CAAS,GAETL,CACX,CAIA,eAAgBS,OAAQ,CAEpB,MAAMC,GAAEA,EAAEC,OAAEA,EAAMC,SAAEA,eAAyBH,OAE7CG,EAAS,oBAAoB,KACzBF,EAAG,4CAA4C,KAC3CC,EAAO9hB,GAAQ,IAAIgiB,QAAQ,CAAC,GAAG,IAGnCH,EAAG,mCAAmC,KAClCC,EAAO9hB,GAAQ,CAAC,EAAG,EAAG,KAAKgiB,QAAQ,CAAC,EAAG,EAAG,GAAG,GAC/C,IAGND,EAAS,0CAA0C,KAC/CF,EAAG,yCAAyC,KACxC,MAAMxB,EAAM5iB,EAAO8X,KACf,mEACA,OAEJuM,EAAOxB,GAA8BD,IAAM4B,KAAK,EAAK,IAGzDJ,EAAG,0CAA0C,KACzC,MAAMxB,EAAM5iB,EAAO8X,KACf,mEACA,OACF2M,UACFJ,EAAOxB,GAA8BD,IAAM4B,KAAK,EAAM,GACxD,IAGNF,EAAS,mCAAmC,KAExC,MAAM1H,EAAQ,CACV,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,IAAK,IAAK,GAAI,IAAK,GACjE,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,GAAI,GAAI,IAAK,IAC5D,IAAK,IAAK,IAER8H,EAAY,CACd,EAAG,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,IAChE,IAAK,IAAK,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,GAAI,IAChE,GAAI,KAGRN,EAAG,kDAAkDO,UACjD,MAAMZ,QAAejB,GAAuB9iB,EAAO8X,KAAK8E,IACxDyH,EAAO1iB,MAAMmW,KAAKiM,EAAQ,KAAKQ,QAAQG,EAAU,IAGrDN,EAAG,kDAAkDO,UACjD,MAAM/B,EAAM5iB,EAAO8X,KACf,mEACA,OAEEiM,QAAejB,GAAuBF,GAC5CyB,EAAON,GAAQa,IAAIC,WACfd,IACAM,EAAON,EAAO,IAAIe,eAAe9kB,GACjCqkB,EAAON,EAAO,IAAIS,KAAK,KAC1B,IAGLJ,EAAG,kFAAkFO,UACjF,MAAM/B,EAAM5iB,EAAO8X,KACf,mEACA,OAEEiM,QAAejB,GAAuBF,GAC5CyB,EAAON,GAAQa,IAAIC,WACfd,IACAM,EAAON,EAAO,IAAIgB,oBAAoB,KACtCV,EAAON,EAAO,IAAIe,eAAe9kB,GAEjCqkB,EAAOxB,GAA8BkB,EAAO,KAAKS,KAAK,GACzD,IAGLJ,EAAG,0CAA0CO,UACzC,MAAM/B,EAAM5iB,EAAO8X,KAAK,WAAY,OAC9BiM,QAAejB,GAAuBF,GAC5CyB,EAAON,GAAQa,IAAIC,WACfd,IAGAM,EAAON,EAAO,GAAGlkB,QAAQ2kB,KAAK,IAC9BH,EAAON,EAAO,IAAIgB,oBAAoB,KACtCV,EAAOxB,GAA8BkB,EAAO,KAAKS,KAAK,GACzD,GACH,IAGNF,EAAS,4BAA4B,KACjCF,EAAG,2BAA2B,KAC1B,MAAMd,EAAM,CAAC,EAAG,EAAG,GAEnBF,GADmB,CAAC,EAAG,EAAG,GACEE,GAC5Be,EAAOf,GAAKiB,QAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,GAAG,IAGxCH,EAAG,4BAA4B,KAC3B,MAAMd,EAAM,CAAC,EAAG,EAAG,GAEnBF,GADmB,CAAC,EAAG,EAAG,GACEE,GAC5Be,EAAOf,GAAKiB,QAAQ,CAAC,EAAG,EAAG,GAAG,IAGlCH,EAAG,8BAA8B,KAC7B,MAAMd,EAAgB,GAEtBF,GAD6B,GACDE,GAC5Be,EAAOf,GAAKiB,QAAQ,GAAG,GACzB,IAGND,EAAS,eAAe,KACpBF,EAAG,oCAAoC,KACnCC,EAAO1B,GAAY3iB,EAAO8X,KAAK,CAAC,MAAMyM,QAAQ,IAAI,IAGtDH,EAAG,oCAAoC,KACnCC,EAAO1B,GAAY3iB,EAAO8X,KAAK,CAAC,MAAMyM,QAAQ,IAAI,IAGtDH,EAAG,yCAAyC,KACxCC,EAAO1B,GAAY3iB,EAAO8X,KAAK,CAAC,EAAG,MAAMyM,QAAQ,MAAM,IAG3DH,EAAG,yCAAyC,KACxCC,EAAO1B,GAAY3iB,EAAO8X,KAAK,CAAC,EAAG,MAAMyM,QAAQ,MAAM,IAG3DH,EAAG,yDAAyD,KACxDC,EAAO1B,GAAY3iB,EAAO8X,KAAK,CAAC,EAAG,GAAI,IAAK,OAAOyM,QAC/C,YACH,GACH,IAGND,EAAS,eAAe,KACpBF,EAAG,2CAA2C,KAG1CC,EAAOZ,GAFO,CAAEuB,SAAU,EAAG,kBAAmB,KAErBT,QADV,CAAEU,QAAS,EAAGC,eAAgB,GACH,IAGhDd,EAAG,mCAAmC,KAGlCC,EAAOZ,GAFO,CAAC,CAAE0B,UAAW,GAAK,CAAE,oBAAqB,MAE7BZ,QADV,CAAC,CAAEa,SAAU,GAAK,CAAEC,gBAAiB,IACV,IAGhDjB,EAAG,mEAAmE,KAClE,MAAM/N,EAAQ,aACdgO,EAAOZ,GAAYpN,IAAQmO,KAAKnO,EAAM,GACxC,GAEV,CChQgB,SAAAiP,GACZC,EACAvB,GAEA,MAAMzjB,EAAQglB,EAAcC,WAAUC,GAClCA,EAAYC,OAAO1B,KAEvB,OAAe,IAAXzjB,GACAglB,EAAcrG,KAAK8E,GACZuB,EAAc1lB,OAAS,GAE3BU,CACX,UAGgBolB,GACZC,EACAC,EACAC,GAEA,GAAID,GAAoC,EACpC,MAAO,GAIX,QAA+B1P,IAA3ByP,EACA,OAAwD,IAApDE,EAAyCjmB,OAClC,IAAI8B,MAAMkkB,GAAkC7E,KAC/C5I,IAA+BG,YAGhC,IAAI5W,MAAMkkB,GAAkC7E,KAC/C8E,EAAyC,GAAGvN,YAI7C,CAEH,MAAMwN,EAAaxjB,GAAQqjB,GAC3B,OAAIG,EAAWlmB,QAAUgmB,EACdE,EAAWC,MAAM,EAAGH,GAEpBE,EAAW9C,OACd,IAAIthB,MACAkkB,EAAmCE,EAAWlmB,QAChDmhB,KAAK+E,EAAW,IAG7B,CACL,CAEM,SAAUE,GAAeC,GAC3B,OAAOA,EAAkB5C,KACpB6C,IAA0B,CACvBC,OAAQD,EACRE,WAAY,EACZC,SAAU,KAGtB,CAsBgB,SAAAC,GACZC,EACAC,EACAC,EACAd,EACAM,EAAiC,IAMjC,MAAMS,EAAqBT,EAAkBF,QAEvCY,EACF,GAEEC,EACF,GAGJL,EAAwBjD,SAAQ,CAAC4C,EAAS5lB,KACtC,MAAMumB,EAAwBxB,GAC1BqB,EACAR,EAAQ5N,YAGNwO,EAA4BzB,GAC9BqB,EACAR,EAAQ9N,gBAGZuO,EAA8B1H,KAAK,CAC/B8H,kBAAmB,CACfhL,MAAOmK,EAAQnK,MACfC,SAAUkK,EAAQlK,SAClBE,QAASgK,EAAQhK,QACjBD,KAAMiK,EAAQjK,MAElBG,cAAe,CACXyK,wBACAC,4BACAtK,UAAW0J,EAAQ1J,UACnBwK,WAAY,MAEhBC,UAAWT,EAAsBlmB,GACjC+b,SAAU,GACZ,IAIN,MAAM6K,EAA+BxB,GACjCC,EACAc,EAAyB7mB,OACzB2mB,GAmBJ,OAhBAE,EAAyBnD,SAAQ,CAAC4C,EAAS5lB,KACvC,MAAMumB,EAAwBxB,GAC1BqB,EACAQ,EAA6B5mB,IAEjCsmB,EAA+B3H,KAAK,CAChC8H,kBAAmB,CACfhL,MAAOmK,EAAQnK,MACfC,SAAUkK,EAAQlK,SAClBE,QAASgK,EAAQhK,QACjBD,KAAMiK,EAAQjK,MAElBkL,gBAAiBN,GACnB,IAGC,CACHF,gCACAC,iCACAX,kBAAmBS,EAE3B,CCrKa,MAAAU,GAA6BC,IACtC,GAAIA,EAAQ1U,GAAG4I,GAAG,IACd,MAAM,IAAI3c,MAAM,kCACnB,EAGQ0oB,GACTC,IAIA,GAAkC,IAA9BA,EAAmB3nB,OACnB,MAAM,IAAIhB,MAAM,uCAEpB,MAAM4oB,EAAcD,EAAmB,GAAGxL,MAC1C,IACKwL,EAAmBE,OAAMvB,GAAWA,EAAQnK,MAAM0J,OAAO+B,KAE1D,MAAM,IAAI5oB,MAAM,8CACnB,ECrBW,SAAA8oB,GACZC,EACAC,GAIA,OADa3E,GADuB,CAAC2E,EAAU5J,aAAc2J,GAGjE,UAWgBE,GACZC,EACAC,EAAqC5P,IAChCO,aAEL,GAAmB,IAAfoP,EAAKloB,OACL,MAAM,IAAIhB,MAAM,gCAEpB,MAAM+d,EAAQoL,EAAwB/J,UAEhCzB,EAAOsG,GADI9iB,OAAO8X,KAAK,IAAI8E,KAAUmL,KAG3C,GAAa,OAATvL,EACA,MAAM,IAAI3d,MAAM,sBAEpB,MAAM+jB,EAAMpG,EAAK,GACjB,OAAO,IAAI7E,EAAUiL,EACzB,CAmDgB,SAAAqF,GACZC,EACAhC,GAKA,MAAMS,EAAqBT,EAAkBF,QAEvCmC,EACFD,EAAiB5E,KAAIrS,IAAM,CACvB8W,KAAMpmB,MAAMmW,KAAK7G,EAAE8W,MACnBK,2BAA4BnX,EAAEmX,2BAC9BC,8BAA+B,EAC/BC,yBAA0B,MAiBlC,OAdAJ,EAAiB3E,SAAQ,CAACgF,EAAQjnB,KAC9B6mB,EAAuB7mB,GAAG+mB,8BAAgC/C,GACtDqB,EACA4B,EAAOP,wBACV,IAGLE,EAAiB3E,SAAQ,CAACgF,EAAQjnB,KAC9B6mB,EAAuB7mB,GAAGgnB,yBAA2BhD,GACjDqB,EACA4B,EAAOC,mBACV,IAGE,CAAEL,yBAAwBjC,kBAAmBS,EACxD,CAGA,eAAgBxC,OAAQ,CAEpB,MAAMC,GAAEA,EAAEC,OAAEA,EAAMC,SAAEA,eAAyBH,OAEvC0D,EAAY,IAAIlQ,EAClB,gDAGJ2M,EAAS,uBAAuB,KAC5BF,EAAG,sCAAsC,KACrC,MAAMwD,EAAsB,EACxB,IAAI1J,aAActD,OAAO,QACzB,IAAIsD,aAActD,OAAO,QAE7ByJ,EAAOsD,GAAkBC,EAAOC,IAAYY,cACxC,IAAI7O,WAAW,CACX,EAAG,IAAK,IAAK,EAAG,IAAK,GAAI,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,IACrD,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IACrD,GAAI,IAAK,IAAK,GAAI,IAAK,IAAK,MAEnC,IAGLwK,EAAG,sCAAsC,KACrC,MAAMwD,EAAsB,EACxB,IAAI1J,aAActD,OAAO,QACzB,IAAIsD,aAActD,OAAO,SAE7ByJ,EAAOsD,GAAkBC,EAAOC,IAAYY,cACxC,IAAI7O,WAAW,CACX,EAAG,IAAK,GAAI,GAAI,IAAK,GAAI,IAAK,GAAI,GAAI,IAAK,GAAI,GAAI,IAAK,IACxD,GAAI,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GACxD,IAAK,IAAK,GAAI,GAAI,MAEzB,GACH,IAGN0K,EAAS,0BAA0B,KAC/BF,EAAG,0EAA0EO,UACzE,MAQM+D,EAAiBZ,GAJVH,GAJe,EACxB,IAAIzJ,aAActD,OAAO,QACzB,IAAIsD,aAActD,OAAO,QAESiN,GACb,IAAIlQ,EACzB,qCAGJ0M,EAAOqE,GAAgB5D,eAAenN,GACtC0M,EAAOqE,GAAgBD,cACnB,IAAI9Q,EAAU,gDACjB,IAGLyM,EAAG,0EAA0EO,UACzE,MAQM+D,EAAiBZ,GAJVH,GAJe,EACxB,IAAIzJ,aAActD,OAAO,QACzB,IAAIsD,aAActD,OAAO,SAESiN,GACb,IAAIlQ,EACzB,qCAGJ0M,EAAOqE,GAAgB5D,eAAenN,GACtC0M,EAAOqE,GAAgBD,cACnB,IAAI9Q,EAAU,gDACjB,GACH,IAGN2M,EAAS,iCAAiC,KACtCF,EAAG,4CAA4C,KAC3C,MAgBMuE,EAAeV,GAhBI,CACrB,CACIF,KAAM,IAAInO,WAAW,CAAC,EAAG,EAAG,EAAG,IAC/BwO,2BAA4B,EAC5BJ,wBAAyB,IAAIrQ,EACzB,oCAEJ6Q,mBAAoB,IAAI7Q,EACpB,sCAIc,CACtB,IAAIA,EAAU,oCACd,IAAIA,EAAU,sCAMlB0M,EACIsE,EAAaR,uBAAuB,GAC/BE,+BACP7D,KAAK,GACPH,EACIsE,EAAaR,uBAAuB,GAAGG,0BACzC9D,KAAK,EAAE,GACX,GAEV,CC9NOG,eAAeiE,IAAWC,WAC7BA,EAAU5M,SACVA,EAAQ6M,mBACRA,IAMA,MAAMC,QAAeF,EAAWG,eAC5BF,EACA7M,GAGJ,aADMgN,GAAmBJ,EAAYE,GAC9BA,CACX,CAEOpE,eAAesE,GAClBJ,EACAK,EACAC,EAA2B,aAE3B,MAAMC,QAAwBP,EAAWQ,mBAAmBF,GACtDG,EAA4C,CAC9CJ,UAAWA,EAAU/mB,WACrBonB,qBAAsBH,EAAgBG,qBACtCC,UAAWJ,EAAgBI,WAE/B,aAAaX,EAAWI,mBAAmBK,EAAUH,EACzD,CCpBa,MAAAM,GAA2B,KAAO,CAC3CrlB,EAAGzC,MAAMmW,KAAK,CAAEjY,OAAQ,KAAM,CAAC6pB,EAAGpoB,IAAMA,EAAI,IAC5CJ,EAAGS,MAAMmW,KAAK,CAAEjY,OAAQ,KAAM,CAAC6pB,EAAGpoB,IAAMA,EAAI,IAC5Cd,EAAGmB,MAAMmW,KAAK,CAAEjY,OAAQ,KAAM,CAAC6pB,EAAGpoB,IAAMA,EAAI,MAGnCqoB,GAA2BC,IACpC,GACuB,KAAnBA,EAAMxlB,EAAEvE,QACW,KAAnB+pB,EAAM1oB,EAAErB,QACW,KAAnB+pB,EAAMppB,EAAEX,OAER,MAAM,IAAIhB,MAAM,kCACnB,EAGC,SAAUgrB,GAAoBC,GAChC,MAAMC,EAAUC,GAA8BF,EAAKG,GAAG,IAChDC,EAAUF,GAA8BF,EAAKG,GAAG,IAChDE,EAAqB,IAAIvQ,WAAW,IAAImQ,KAAYG,IAEpDE,EAAWJ,GAA8BF,EAAKO,GAAG,GAAG,IACpDC,EAAWN,GAA8BF,EAAKO,GAAG,GAAG,IACpDE,EAAWP,GAA8BF,EAAKO,GAAG,GAAG,IACpDG,EAAWR,GAA8BF,EAAKO,GAAG,GAAG,IACpDI,EAAqB,IAAI7Q,WAAW,IACnCwQ,KACAE,KACAC,KACAC,IAGDE,EAAUV,GAA8BF,EAAKa,IAAI,IACjDC,EAAUZ,GAA8BF,EAAKa,IAAI,IAIvD,MAD2B,CAAEvmB,EAAG+lB,EAAQjpB,EAAGupB,EAAQjqB,EAFxB,IAAIoZ,WAAW,IAAI8Q,KAAYE,IAI9D,CAIM,SAAUC,GAAuBjB,GACnC,MAAMO,EAASP,EAAMxlB,EACfqmB,EAASb,EAAM1oB,EACf4pB,EAASlB,EAAMppB,EAEfuqB,EAAYZ,EAAOnE,MAAM,EAAG,IAI5BgF,EAAmBC,GAHP,IAAI5rB,EAAG8qB,EAAOnE,MAAM,GAAI,IAAK,GAAI,OAGQ,EAAQ,EAEnE+E,EAAU,GAAKG,GAAiBH,EAAU,GAAIC,GAE9C,MAAMG,EAAYV,EAAOzE,MAAM,EAAG,IAC5BoF,EAAYX,EAAOzE,MAAM,GAAI,KAE7BqF,EAkCV,SAA8BC,EAAeC,GACzC,MAAMC,EAAgBnU,EAAWlH,IAAI,IAAI9Q,EAAG,IAG5C,OAAIisB,EAAU1Y,GAAG4Y,GACN,EACAF,EAAU9Y,GAAGgZ,GACb,EAIJD,EAAU3Y,GAAG4Y,EACxB,CA9C6BC,CACrB,IAAIpsB,EAAG+rB,EAAUpF,MAAM,EAAG,IAAK,GAAI,MACnC,IAAI3mB,EAAG+rB,EAAUpF,MAAM,GAAI,IAAK,GAAI,OAGxCmF,EAAU,GAAKD,GAAiBC,EAAU,GAAIE,GAE9C,MAAMK,EAAYZ,EAAO9E,MAAM,EAAG,IAC5B2F,EAAYb,EAAO9E,MAAM,GAAI,IAC7B4F,EAAmBX,GAAqB,IAAI5rB,EAAGssB,EAAW,GAAI,OASpE,OARAD,EAAU,GAAKR,GAAiBQ,EAAU,GAAIE,GAEL,CACrCxnB,EAAGzC,MAAMmW,KAAKiT,GACd7pB,EAAGS,MAAMmW,KAAKqT,GACd3qB,EAAGmB,MAAMmW,KAAK4T,GAItB,CAEA,SAAS1B,GAA8B6B,GAEnC,MAAMrQ,EAAK,IAAInc,EACXwsB,EAAOC,WAAW,MAAQD,EAAOE,UAAU,GAAKF,EAChD,OAEJ,OAAO,IAAIjS,WAAW4B,EAAGjZ,QAAQ,KAAM,IAC3C,CAEA,SAAS0oB,GAAqBe,GAC1B,OAAOA,EAASlZ,IAAIuE,EAAW/O,IAAI0jB,GACvC,CA2BA,SAASd,GAAiBe,EAAcC,GACpC,OAAKA,EAGMD,EAFS,IAARA,CAIhB,CAGA,eAAgB9H,OAAQ,CAEpB,MAAMC,GAAEA,EAAEC,OAAEA,EAAMC,SAAEA,eAAyBH,OAG7CG,EAAS,oBAAoB,KACzBF,EAAG,4DAA4D,KAC3D,MAEML,EAASmH,GAFF,EACO,GAEpB7G,EAAON,GAAQS,KAAK,IAAW,IAGnCJ,EAAG,qDAAqD,KACpD,MAEML,EAASmH,GAFF,EACO,GAEpB7G,EAAON,GAAQS,KAAK,EAAW,GACjC,IAGNF,EAAS,sBAAsB,KAC3B,MAAM6H,EAAY,CACdlC,GAAI,CACA,qEACA,sEAEJI,GAAI,CACA,CACI,qEACA,sEAEJ,CACI,qEACA,sEAGRM,IAAK,CACD,qEACA,sEAGFyB,EAAqB,CACvB,GAAI,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,GAChE,GAAI,IAAK,IAAK,EAAG,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,GAChE,GAAI,KAEFC,EAAqB,CACvB,IAAK,IAAK,IAAK,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,GAAI,IAAK,IAAK,IAC7D,IAAK,IAAK,IAAK,IAAK,GAAI,GAAI,EAAG,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAC/D,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAChE,GAAI,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,GAAI,GAChE,IAAK,GAAI,GAAI,KAEXC,EAAqB,CACvB,GAAI,IAAK,IAAK,IAAK,EAAG,GAAI,IAAK,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,IAAK,IAC/D,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,GAAI,GAChE,IAAK,KAGTlI,EAAG,0CAA0CO,UACzC,MACM4H,EAAkB1B,GADVhB,GAAoBsC,IAElC9H,EAAOkI,EAAgBnoB,GAAGmgB,QAAQ6H,GAClC/H,EAAOkI,EAAgBrrB,GAAGqjB,QAAQ8H,GAClChI,EAAOkI,EAAgB/rB,GAAG+jB,QAAQ+H,EAAmB,GACvD,IAENhI,EAAS,4BAA4B,KACjCA,EAAS,4BAA4B,KACjCF,EAAG,qDAAqD,KACpD,MAAMoI,EAAgB/C,KACtBpF,EAAOmI,EAAcpoB,EAAEvE,QAAQ2kB,KAAK,IACpCH,EAAOmI,EAActrB,EAAErB,QAAQ2kB,KAAK,IACpCH,EAAOmI,EAAchsB,EAAEX,QAAQ2kB,KAAK,GAAG,GACzC,IAGNF,EAAS,2BAA2B,KAChCF,EAAG,mDAAmD,KAClD,MAAMqI,EAAa,CACfroB,EAAGzC,MAAMmW,KAAK,IAAI8B,WAAW,KAC7B1Y,EAAGS,MAAMmW,KAAK,IAAI8B,WAAW,KAC7BpZ,EAAGmB,MAAMmW,KAAK,IAAI8B,WAAW,MAEjCyK,GAAO,IAAMsF,GAAwB8C,KAAa7H,IAAI8H,SAAS,IAGnEtI,EAAG,8CAA8C,KAC7C,MAAMuI,EAAe,CACjBvoB,EAAGzC,MAAMmW,KAAK,IAAI8B,WAAW,KAC7B1Y,EAAGS,MAAMmW,KAAK,IAAI8B,WAAW,KAC7BpZ,EAAGmB,MAAMmW,KAAK,IAAI8B,WAAW,MAEjCyK,GAAO,IAAMsF,GAAwBgD,KAAeD,QAChD,kCACH,GACH,GACJ,GAEV,UCjPgBE,GACZC,KACGC,GAEH,OAAQC,GACJD,EAAUhJ,QACN,CAACkJ,EAAcC,IAAoBA,EAAgBD,IACnDH,EAAgBE,GAE5B,CAGA,eAAgB5I,OAAQ,CAEpB,MAAMC,GAAEA,EAAEC,OAAEA,EAAMC,SAAEA,eAAyBH,OAE7CG,EAAS,QAAQ,KACbF,EAAG,qEAAqE,KACpE,MAGM8I,EAAmCN,IAHzB3b,GAAcA,EAAI,IACXA,GAAkB,EAAJA,IACdA,GAAcA,EAAI,IAMzCoT,EAAO6I,EAAiC,IAAI1I,KAAK,EAAE,GACrD,GAEV,CCLM,SAAU2I,GACZC,EACAC,EACA7D,EACA8D,GAEA,MAAMC,EAAY,IAAIC,EAAmB,CACrCC,SAAUJ,EACVK,gBAAiBlE,EACjB4D,iBACDO,mBAAmBL,GAEtB,OAAO,IAAIM,EAAqBL,EACpC,CAYO5I,eAAekJ,GAClBC,EACAC,EACAC,EACAC,GAEA,MAAMC,QAAaJ,EAAIK,gBAAgBJ,EAAIC,GAEtCC,IAAcA,QAAqBH,EAAIzE,sBAE5C,MAAM+E,EAAoE,CACtElF,UAAWgF,EACX1E,UAAWyE,EAAazE,UACxBD,qBAAsB0E,EAAa1E,sBAOjC8E,SAJkBP,EAAI7E,mBACxBmF,EACAJ,GAAgBlV,YAAcgV,EAAIhV,YAAc,cAE7BwV,QAAQD,KAE/B,aADMP,EAAIS,0BAA0BF,GAC7BH,CACX,CAWOvJ,eAAe6J,GAClBV,EACAI,EACAF,EACAC,GAEKA,IAAcA,QAAqBH,EAAIzE,sBAE5C,MAAMoF,EAAmE,CACrEvF,UAAWgF,EACX1E,UAAWyE,EAAazE,UACxBD,qBAAsB0E,EAAa1E,sBAEjC9jB,QAAYqoB,EAAI7E,mBAClBwF,EACAT,GAAgBlV,YAAcgV,EAAIhV,YAAc,aAE9CuV,EAAO5oB,EAAI6oB,QAAQD,KAEzB,aADMP,EAAIS,0BAA0BF,GAC7B5oB,CACX,CAagB,SAAAipB,GACZtB,EACAuB,EACAnF,EACAoF,EAA8B,GAC9BtB,GAEA,GAAIsB,EAAkB9R,SAAS6R,GAC3B,MAAM,IAAI9vB,MAAM,0CACpB,MAAMgwB,EAAa,CAACF,KAAUC,GAExBb,EAAKZ,GACPC,EACAuB,EAAMG,UACNtF,EACA8D,GAKJ,OAFAS,EAAGgB,KAAKF,GAEDd,CACX,CCzIM,SAAUiB,GAAMC,GAClB,OAAO,IAAIC,SAAQC,GAAWC,WAAWD,EAASF,IACtD,CCCA,IAAIzuB,GAAI,QAEK6uB,GAAQC,GAAe,KACvBC,GAAMD,GAAe,KACrBE,GAAUF,GAAe,KACzBG,GAAOH,GAAe,KAU5B3K,eAAe+K,GAClB5B,EACA7R,EAAW,IACX0T,SAGgBxZ,IAAZwZ,GAAyBA,EAAU,OACnCA,EAAU,KAGd,MAAMxJ,EAAUmJ,GAAeK,GACzBC,QAAY9B,EAAI9E,eAAe7C,EAAQ2I,UAAW7S,GAExD,aADMuS,GAAUV,EAAK8B,GACdzJ,CACX,UAEgB0J,KAGZ,OADmB,IAAIC,EADX,wBAC2B,YAE3C,CAQgB,SAAAR,GACZK,GAMA,GAJKA,IACDA,EAAUnvB,GACVA,MAEAmvB,EAAU,IACV,OAAOpN,EAAQwN,WAEnB,MAAMhI,EAAO,IAAInO,WAAW,IAG5B,OAFAmO,EAAK,IAAM4H,EAEJpN,EAAQyN,SAASjI,EAC5B,CAGA,eAAgB5D,OAAQ,CAEpB,MAAMG,SAAEA,EAAQF,GAAEA,EAAEC,OAAEA,eAAuBF,OAE7CG,EAAS,kBAAkB,KACvBF,EAAG,qDAAqD,KACpD,MAAM6L,EAAUX,GAAe,IACzBY,EAAWZ,GAAe,IAChCjL,EAAO4L,GAAS1L,QAAQ2L,GACxB7L,EAAO4L,GAASnL,eAAevC,GAC/B8B,EAAO4L,EAAQnB,WAAWqB,cAC1B9L,EAAO4L,EAAQG,WAAWD,aAAa,IAG3C/L,EAAG,iEAAiE,KAChE,MAAMiM,EAAS,IAAMf,GAAe,KAC9BgB,EAAMD,IACNE,EAAMF,IACZhM,EAAOiM,GAAK1L,IAAIL,QAAQgM,EAAI,IAGhCnM,EAAG,iEAAiE,KAChE,MAAMoM,EAAiBlB,KACjBmB,EAAcnB,KACdoB,EAAkBpB,KAClBqB,EAAsBrB,GAAe,GAC3CjL,EAAOmM,GAAgB5L,IAAIL,QAAQkM,GACnCpM,EAAOoM,GAAa7L,IAAIL,QAAQmM,GAChCrM,EAAOqM,GAAiBnM,QAAQoM,EAAoB,GACtD,GAEV,CCzFgB,SAAAC,GACZC,EACAC,GAEA,OAAO1vB,KAAKoB,KAAuB,IAAjBquB,EAA8BC,EACpD,wBCVA,IAAIC,EAAmBrxB,GAAQA,EAAKqxB,iBAAoB,SAAU/tB,GAC9D,OAAQA,GAAOA,EAAIguB,WAAchuB,EAAM,CAAEiuB,QAAWjuB,EACxD,EACA4gB,OAAOsN,eAAczyB,EAAU,aAAc,CAAEikB,MAAO,IACtDjkB,EAAc6kB,IAAA7kB,EAAA0yB,MAAgB1yB,EAAmB2yB,SAAA3yB,EAAAqC,IAAcrC,EAAgB4yB,MAAA5yB,EAAA6yB,OAAiB7yB,EAAc8yB,IAAA9yB,EAAA+yB,KAAe/yB,EAAiBgzB,OAAAhzB,EAAAqwB,UAAoBrwB,EAAeizB,KAAAjzB,EAAAkzB,KAAelzB,EAAemzB,KAAAnzB,EAAAozB,KAAepzB,MAAcA,EAAcqzB,IAAArzB,EAAAszB,OAAiBtzB,EAAcuzB,IAAAvzB,EAAAwzB,IAAcxzB,EAAcyzB,IAAAzzB,EAAA0zB,IAAc1zB,EAAc2zB,IAAA3zB,EAAA4zB,IAAc5zB,EAAa6zB,GAAA7zB,EAAA8zB,QAAa,EACzX,MAAMC,EAAkBC,EAClBC,EAAYC,EACZC,EAAU7B,EAAgB8B,GAChC,IAAIC,EAAkBL,EACtB7O,OAAOsN,eAAezyB,EAAS,KAAM,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBP,EAAG,IACtG3O,OAAOsN,eAAezyB,EAAS,KAAM,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBG,EAAG,IACtGrP,OAAOsN,eAAezyB,EAAS,MAAO,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBT,GAAI,IACxGzO,OAAOsN,eAAezyB,EAAS,MAAO,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBI,GAAI,IACxGtP,OAAOsN,eAAezyB,EAAS,MAAO,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBX,GAAI,IACxGvO,OAAOsN,eAAezyB,EAAS,MAAO,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBK,GAAI,IACxGvP,OAAOsN,eAAezyB,EAAS,MAAO,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBb,GAAI,IACxGrO,OAAOsN,eAAezyB,EAAS,MAAO,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBd,GAAI,IACxGpO,OAAOsN,eAAezyB,EAAS,SAAU,CAAEs0B,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBf,MAAO,IAC9G,MAAMqB,UAAiBZ,EAAgBa,OACnC,WAAAj0B,CAAYk0B,EAAMC,EAAQC,GACtBvT,MAAMqT,EAAME,GACZ9zB,KAAK+zB,MAAO,EAAIjB,EAAgBiB,MAAMH,GACtC5zB,KAAK6zB,OAASA,CACjB,CACD,MAAAhY,CAAOra,EAAGwyB,EAAS,GACf,MAAMhyB,EAAM,IAAIkxB,EAAQ3B,QAAQvxB,KAAK+zB,KAAKlY,OAAOra,EAAGwyB,GAAS,GAAI,MACjE,OAAIh0B,KAAK6zB,OACE7xB,EAAIkF,SAAqB,EAAZlH,KAAK4zB,MAAU/vB,QAEhC7B,CACV,CACD,MAAAkZ,CAAOnZ,EAAKP,EAAGwyB,EAAS,GAIpB,OAHIh0B,KAAK6zB,SACL9xB,EAAMA,EAAI8E,OAAmB,EAAZ7G,KAAK4zB,OAEnB5zB,KAAK+zB,KAAK7Y,OAAOnZ,EAAI4D,YAAYrF,OAAQ,KAAMN,KAAK4zB,MAAOpyB,EAAGwyB,EACxE,EAEL,SAAS5B,EAAI0B,GACT,OAAO,IAAIJ,EAAS,EAAG,EAAOI,EACjC,CACD/0B,EAAAqzB,IAAcA,EAIdrzB,EAAAk1B,IAHA,SAAaH,GACT,OAAO,IAAIJ,EAAS,EAAG,EAAMI,EAChC,EAKD/0B,EAAAozB,KAHA,SAAc2B,GACV,OAAO,IAAIJ,EAAS,GAAI,EAAOI,EAClC,EAKD/0B,EAAAmzB,KAHA,SAAc4B,GACV,OAAO,IAAIJ,EAAS,GAAI,EAAMI,EACjC,EAKD/0B,EAAAkzB,KAHA,SAAc6B,GACV,OAAO,IAAIJ,EAAS,GAAI,EAAOI,EAClC,EAKD/0B,EAAAizB,KAHA,SAAc8B,GACV,OAAO,IAAIJ,EAAS,GAAI,EAAMI,EACjC,EAED,MAAMI,UAAsBpB,EAAgBa,OACxC,WAAAj0B,CAAYy0B,EAAQC,EAASC,EAASP,GAClCvT,MAAM4T,EAAOP,KAAME,GACnB9zB,KAAKm0B,OAASA,EACdn0B,KAAKo0B,QAAUA,EACfp0B,KAAKq0B,QAAUA,CAClB,CACD,MAAAxY,CAAOra,EAAGwyB,GACN,OAAOh0B,KAAKo0B,QAAQp0B,KAAKm0B,OAAOtY,OAAOra,EAAGwyB,GAC7C,CACD,MAAA9Y,CAAOnZ,EAAKP,EAAGwyB,GACX,OAAOh0B,KAAKm0B,OAAOjZ,OAAOlb,KAAKq0B,QAAQtyB,GAAMP,EAAGwyB,EACnD,CACD,OAAAM,CAAQ9yB,EAAGwyB,GACP,OAAOh0B,KAAKm0B,OAAOG,QAAQ9yB,EAAGwyB,EACjC,EAKLj1B,EAAAqwB,UAHA,SAAmB0E,GACf,OAAO,IAAII,GAAc,EAAIpB,EAAgBiB,MAAM,KAAMvyB,GAAM,IAAIwxB,EAAU/a,UAAUzW,KAAK8iB,GAAQA,EAAI5e,YAAYouB,EACvH,EAED,MAAMS,UAAqBzB,EAAgBa,OACvC,WAAAj0B,CAAYy0B,EAAQL,GAChBvT,OAAO,EAAGuT,GACV9zB,KAAKm0B,OAASA,EACdn0B,KAAKw0B,eAAgB,EAAI1B,EAAgBD,KAC5C,CACD,MAAA3X,CAAOnZ,EAAKP,EAAGwyB,EAAS,GACpB,OAAIjyB,QACO/B,KAAKw0B,cAActZ,OAAO,EAAG1Z,EAAGwyB,IAE3Ch0B,KAAKw0B,cAActZ,OAAO,EAAG1Z,EAAGwyB,GACzBh0B,KAAKm0B,OAAOjZ,OAAOnZ,EAAKP,EAAGwyB,EAAS,GAAK,EACnD,CACD,MAAAnY,CAAOra,EAAGwyB,EAAS,GACf,MAAMQ,EAAgBx0B,KAAKw0B,cAAc3Y,OAAOra,EAAGwyB,GACnD,GAAsB,IAAlBQ,EACA,OAAO,KAEN,GAAsB,IAAlBA,EACL,OAAOx0B,KAAKm0B,OAAOtY,OAAOra,EAAGwyB,EAAS,GAE1C,MAAM,IAAI70B,MAAM,kBAAoBa,KAAK8zB,SAC5C,CACD,OAAAQ,CAAQ9yB,EAAGwyB,EAAS,GAChB,MAAMQ,EAAgBx0B,KAAKw0B,cAAc3Y,OAAOra,EAAGwyB,GACnD,GAAsB,IAAlBQ,EACA,OAAO,EAEN,GAAsB,IAAlBA,EACL,OAAOx0B,KAAKm0B,OAAOG,QAAQ9yB,EAAGwyB,EAAS,GAAK,EAEhD,MAAM,IAAI70B,MAAM,kBAAoBa,KAAK8zB,SAC5C,EAUL,SAASW,EAAWzR,GAChB,GAAc,IAAVA,EACA,OAAO,EAEN,GAAc,IAAVA,EACL,OAAO,EAEX,MAAM,IAAI7jB,MAAM,iBAAmB6jB,EACtC,CACD,SAAS0R,EAAW1R,GAChB,OAAOA,EAAQ,EAAI,CACtB,CA2BD,SAAS2O,EAAMmC,GACX,MAAM3zB,GAAS,EAAI2yB,EAAgBL,KAAK,UAClC0B,GAAS,EAAIrB,EAAgBT,QAAQ,CACvClyB,GACA,EAAI2yB,EAAgBiB,OAAM,EAAIjB,EAAgBkB,QAAQ7zB,GAASA,EAAOyzB,MAAO,UAEjF,OAAO,IAAIM,EAAcC,GAAQ,EAAG3X,UAAWA,IAAOA,IAAI,CAAQA,UAASsX,EAC9E,CAlDD/0B,EAAAgzB,OAHA,SAAgBoC,EAAQL,GACpB,OAAO,IAAIS,EAAaJ,EAAQL,EACnC,EAKD/0B,EAAA+yB,KAHA,SAAcgC,GACV,OAAO,IAAII,GAAc,EAAIpB,EAAgBD,MAAO4B,EAAYC,EAAYZ,EAC/E,EAsBD/0B,EAAA8yB,IARA,SAAa8C,EAAeb,GACxB,MAAM3zB,GAAS,EAAI2yB,EAAgBL,KAAK,UAClC0B,GAAS,EAAIrB,EAAgBT,QAAQ,CACvClyB,GACA,EAAI2yB,EAAgB8B,KAAKD,GAAe,EAAI7B,EAAgBkB,QAAQ7zB,GAASA,EAAOyzB,MAAO,YAE/F,OAAO,IAAIM,EAAcC,GAAQ,EAAGU,YAAaA,IAASA,IAAM,CAAQA,YAAWf,EACtF,EAkBD/0B,EAAA6yB,OAhBA,SAAgBkD,EAAKX,EAAQL,GACzB,MAAMiB,GAAgB,EAAIjC,EAAgBT,QAAQ,CAC9CD,EAAI,OACJ+B,EAAOa,UAAU,UAWrB,OAAO,IAAId,EAAca,GATzB,UAAqBD,IAAKG,EAAWzY,KAAEA,IACnC,IAAKyY,EAAY3hB,GAAGwhB,GAChB,MAAM,IAAI31B,MAAM,0BACZ21B,EAAIryB,SAAS,OACb,UACAwyB,EAAYxyB,SAAS,QAE7B,OAAO+Z,CACV,IACmDA,KAAYsY,MAAKtY,UAASsX,EACjF,EAUD/0B,EAAA4yB,MAAgBA,EAIhB5yB,EAAAqC,IAHA,SAAa0yB,GACT,OAAO,IAAII,EAAcvC,KAAUnV,GAASA,EAAK/Z,SAAS,WAAWoM,GAAMvO,OAAO8X,KAAKvJ,EAAG,UAAUilB,EACvG,EAOD/0B,EAAA2yB,SALA,SAAkBwD,EAAUpB,EAAUqB,GAClC,MAAMC,GAAc,EAAItC,EAAgBuC,OAAOF,QAAmDA,GAAe,EAAIrC,EAAgBD,MAAOiB,GAE5I,OADAoB,EAASrR,SAAQ,CAACyR,EAASz0B,IAAUu0B,EAAYG,WAAW10B,EAAOy0B,EAASA,EAAQxB,YAC7EsB,CACV,EAQDr2B,EAAA0yB,MANA,SAAekD,EAAex0B,EAAQ2zB,GAClC,MAAMK,GAAS,EAAIrB,EAAgBT,QAAQ,EACvC,EAAIS,EAAgB8B,KAAKD,EAAex0B,EAAQ,YAEpD,OAAO,IAAI+zB,EAAcC,GAAQ,EAAGU,YAAaA,IAASA,IAAM,CAAQA,YAAWf,EACtF,EAED,MAAM0B,UAAuB1C,EAAgBa,OACzC,WAAAj0B,CAAY+1B,EAAWC,EAAa5B,GAChCvT,MAAMkV,EAAU7B,KAAO8B,EAAY9B,KAAME,GACzC9zB,KAAKy1B,UAAYA,EACjBz1B,KAAK01B,YAAcA,CACtB,CACD,MAAA7Z,CAAOra,EAAGwyB,GAIN,OAHAA,EAASA,GAAU,EAGZ,CAFKh0B,KAAKy1B,UAAU5Z,OAAOra,EAAGwyB,GACvBh0B,KAAK01B,YAAY7Z,OAAOra,EAAGwyB,EAASh0B,KAAKy1B,UAAUnB,QAAQ9yB,EAAGwyB,IAE/E,CACD,MAAA9Y,CAAOnZ,EAAKP,EAAGwyB,GACXA,EAASA,GAAU,EACnB,MAAM2B,EAAW31B,KAAKy1B,UAAUva,OAAOnZ,EAAI,GAAIP,EAAGwyB,GAElD,OAAO2B,EADY31B,KAAK01B,YAAYxa,OAAOnZ,EAAI,GAAIP,EAAGwyB,EAAS2B,EAElE,CACD,OAAArB,CAAQ9yB,EAAGwyB,GACP,OAAQh0B,KAAKy1B,UAAUnB,QAAQ9yB,EAAGwyB,GAAUh0B,KAAK01B,YAAYpB,QAAQ9yB,EAAGwyB,EAC3E,EAULj1B,EAAA6kB,IARA,SAAa6R,EAAWC,EAAa5B,GACjC,MAAM3zB,GAAS,EAAI2yB,EAAgBL,KAAK,UAClC0B,GAAS,EAAIrB,EAAgBT,QAAQ,CACvClyB,GACA,EAAI2yB,EAAgB8B,KAAK,IAAIY,EAAeC,EAAWC,IAAc,EAAI5C,EAAgBkB,QAAQ7zB,GAASA,EAAOyzB,MAAO,YAE5H,OAAO,IAAIM,EAAcC,GAAQ,EAAGU,YAAa,IAAIe,IAAIf,KAAUA,IAAM,CAAQA,OAAQ5yB,MAAMmW,KAAKyc,EAAOgB,cAAe/B,EAC7H,OCzMM,MAAMgC,GAA0BzD,GAAAA,OACnC,CACIjD,GAAAA,UAAU,SACVgD,GAAAA,IAAI,YACJL,GAAAA,OAAON,GAAAA,MAAMoB,GAAAA,KAAM,IAAK,WACxBd,GAAAA,OACIM,GAAAA,OAAO,CACHZ,GAAAA,MAAMoB,GAAEA,KAAI,EAAG,iBACflB,GAAAA,MAAM,QACNF,GAAAA,MAAMoB,GAAEA,KAAI,GAAI,cAEpB,SAGR,qBAGSkD,GAAsB1D,GAAAA,OAC/B,CACIQ,GAAAA,GAAG,yBACHA,GAAAA,GAAG,6BACHJ,GAAAA,IAAI,aACJV,UAAOM,GAAAA,OAAO,CAACQ,GAAAA,GAAG,WAAYF,GAAAA,IAAI,WAAY,eAElD,iBAGSqD,GAAyB3D,GAAAA,OAClC,CACIZ,GAAAA,MAAMoB,GAAEA,KAAI,GAAI,QAChBA,GAAAA,GAAG,4BACHA,GAAAA,GAAG,iCACHF,GAAAA,IAAI,+BAER,oBAISsD,GACT5D,GAAAA,OAAO,CACHN,GAAAA,OACIM,GAAAA,OAAO,CACHZ,GAAAA,MAAMoB,GAAEA,KAAI,GAAI,KAChBpB,GAAAA,MAAMoB,GAAEA,KAAI,GAAI,KAChBpB,GAAAA,MAAMoB,GAAEA,KAAI,GAAI,OAEpB,SAEJhB,GAAAA,IACIQ,GAAAA,OAAO,CACHyD,GACAC,GACApD,GAAAA,IAAI,aACJb,GAAAA,KAAK,cAET,4CAEJD,GAAGA,IACCQ,GAAMA,OAAC,CAACyD,GAAyBjD,GAAEA,GAAC,qBACpC,4BAEJd,UAAOK,GAAAA,MAAO,YACdP,GAAGA,IAACmE,GAAwB,oBAC5BjE,UAAOK,GAAAA,MAAO,gCACdN,GAAAA,KAAK,gBAGP,SAAUoE,GACZ1Z,GAEA,MAAMnB,EAAS/a,EAAO61B,MAAM,KACtB10B,EAAMw0B,GAA4B/a,OAAOsB,EAAMnB,GAC/C+a,EAAa91B,EAAO8X,KAAKiD,EAAOiL,MAAM,EAAG7kB,IAEzC40B,EAAe/1B,EAAO61B,MAAM,GAGlC,OAFAE,EAAaC,cAAc70B,EAAK,GAEzBnB,EAAOijB,OAAO,CACjBjjB,EAAO8X,KAAK,CAAC,GAAI,GAAI,IAAK,EAAG,GAAI,IAAK,IAAK,KAC3Cie,EACAD,GAER,CAEM,SAAUG,GACZlb,GAEA,OAAO4a,GAA4Bpa,OAAOR,EAC9C,CAca,MAAAmb,GACTC,IAEA,MAAMC,EAAgBC,GAAmBxO,WACnCyO,SACFA,EAAQC,UACRA,EAASte,qBACTA,EAAoBV,YACpBA,EAAWW,4BACXA,EAA2BT,0BAC3BA,EAAyB+e,WACzBA,EAAUC,uBACVA,EAAsBC,cACtBA,GACAP,EAEJ,MAAO,CACH,CAAE/P,OAAQkQ,EAAUhQ,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQmQ,EAAWjQ,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQnO,EAAsBqO,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQ7O,EAAa+O,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQlO,EACRoO,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ3O,EACR6O,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQoQ,GAAcJ,EACtB9P,SAAU,EACVD,WAA2B,OAAfmQ,GAEhB,CACIpQ,OAAQqQ,GAA0BL,EAClC9P,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQsQ,EAAepQ,SAAU,EAAOD,WAAY,GACzD,EAGQsQ,GACT5E,GAAAA,OAAO,CACHR,GAAAA,IAAIJ,GAAAA,MAAMoB,GAAAA,KAAM,IAAK,gCACrBhB,GAAAA,IAAIJ,GAAAA,MAAMoB,GAAAA,KAAM,IAAK,iCACrBhB,GAAAA,IACIQ,GAAAA,OAAO,CACHA,UACI,CACIjD,GAAAA,UAAU,SACVgD,GAAAA,IAAI,YACJL,GAAAA,OAAON,GAAAA,MAAMoB,GAAAA,KAAM,IAAK,WACxBd,GAAAA,OACIM,GAAAA,OAAO,CACHZ,GAAAA,MAAMoB,GAAEA,KAAI,EAAG,iBACflB,GAAAA,MAAM,QACNF,GAAAA,MAAMoB,GAAEA,KAAI,GAAI,cAEpB,SAGR,qBAEJA,GAAAA,GAAG,qBAEP,4BAEJhB,OAAIY,GAAAA,MAAO,qBACXZ,OAAIQ,GAAAA,OAAO,CAACjD,GAAAA,UAAU,UAAWgD,GAAAA,IAAI,SAAU,mBAC/CL,UAAOK,GAAAA,MAAO,YACdN,GAAAA,KAAK,cACLC,UAAOK,GAAAA,MAAO,gCACdP,OAAIzC,GAAAA,YAAa,eACjB2C,UAAOJ,GAAAA,QAAS,aAGlB,SAAUuF,GACZ1a,GAEA,MAAMnB,EAAS/a,EAAO61B,MAAM,KACtB10B,EAAMw1B,GAA6B/b,OAAOsB,EAAMnB,GACtD,OAAOA,EAAOiL,MAAM,EAAG7kB,EAC3B,CAEM,SAAU01B,GACZ9b,GAEA,OAAO4b,GAA6Bpb,OAAOR,EAC/C,CC5La,MAAA+b,GACTX,GAEOA,EAASrS,QACZ,CAAChT,EAAKqV,IAAYrV,EAAIzI,IAAImT,GAAG2K,EAAQlK,YACrCT,GAAG,IAwJLub,GAAoB/2B,EAAO8X,KAAK,sBAEzBue,GAIT,WAAAj3B,GAAgB,CAKhB43B,iBAA8B,IAAIrf,EAC9B,+CAQJ,6BAAOsf,GACH,MAAMrP,EAAQ,CAACmP,KACR5a,EAASuN,GAAK/R,EAAUE,uBAC3B+P,EACAloB,KAAKmoB,WAET,OAAO1L,CACV,CAED,gCAAO+a,CACH1Q,EACA2Q,EACAlb,GAEAA,EAAWT,GAAGS,GACd,MACMmb,EADgBN,GAActQ,GACCle,IAAI2T,GAIzC,OAFAoL,GAA0B+P,GAEtBA,EAAepkB,GAAGwI,GAAG,IACd,CAACO,GAAwBob,EAAWlb,KAG/CsL,GAAkBf,GAEoC,CAClDzK,GACIyK,EAAwB,GAAGxK,MAE3Bob,GAEJrb,GAAwBob,EAAWlb,IAG1C,CAED,kCAAOob,CACH7Q,EACAvK,GAEAA,EAAWT,GAAGS,GACd,MACMmb,EADgBN,GAActQ,GACCle,IAAI2T,GAKzC,OAHAoL,GAA0B+P,GAGtBA,EAAepkB,GAAGwI,GAAG,IACd,IAGX+L,GAAkBf,GAEoC,CAClDzK,GACIyK,EAAwB,GAAGxK,MAC3Bob,IAIX,CAKD,kCAAOE,CACHnb,EACAH,EACAC,EACAuK,GAEAvK,EAAWT,GAAGS,GAAY,GAC1B,MACMmb,EADgBN,GAActQ,GAA2B,IAC1Ble,IAAI2T,GAIzC,OAFAoL,GAA0B+P,GAEtBA,EAAepkB,GAAGwI,GAAG,MAAQgL,EACtB,CACHzK,GAAwBC,EAAOC,OAAU9F,EAAWgG,KAI5DoL,GAAkBf,GACoC,CAClDzK,GACIyK,EAAwB,GAAGxK,MAC3Bob,GAEJrb,GAAwBC,EAAOC,OAAU9F,EAAWgG,IAG3D,CAQD,0BAAaob,EAAc5I,MACvBA,EAAKzG,iBACLA,EAAgBsP,WAChBA,EAAUC,oBACVA,EAAmBC,gBACnBA,EAAelR,wBACfA,EAAuBC,sBACvBA,EAAqBxK,SACrBA,IAEA,MAAMyK,EAA2BhnB,KAAK43B,4BAClCE,EACA7I,EACA1S,EACAuK,IAGEI,8BACFA,EAA6BC,+BAC7BA,EACAX,kBAAmBS,GACnBJ,GACAC,GAA2B,GAC3BC,GAAyB,GACzBC,EACAgR,IAGEvP,uBAAEA,EAAsBjC,kBAAEA,GAC5B+B,GAAqB,CAACC,GAAmBvB,GAYvCzK,EAAO0Z,GAV0B,CACnChM,MAAO6N,EACP3R,yCACIc,EACJF,yBAA0BG,EAC1B8Q,SAAU,KACVzP,iBAAkBC,EAClByP,6BAA8B,KAC9BC,WAAY,IAYVhU,EAAO,IARIqS,GAAqB,IAC/Ble,IACHse,SAAU3H,EACV4H,UAAW5H,EACX6H,WAAY,KACZC,uBAAwB,KACxBC,cAAeoB,EAAcjQ,eAEH5B,GAAeC,IAE7C,OAAO,IAAI6R,EAAuB,CAC9BlQ,UAAWnoB,KAAKmoB,UAChBhE,OACA3H,QAEP,CAMD,qBAAa8b,EAASrJ,MAClBA,EAAKnI,wBACLA,EAAuB2Q,UACvBA,EAASlb,SACTA,EAAQgc,4BACRA,EAA2BR,oBAC3BA,EAAmBS,iBACnBA,IAGA,MAAMxR,EAA2BhnB,KAAKw3B,0BAClC1Q,EACA2Q,EACAlb,IAGE2K,8BACFA,EAA6BC,+BAC7BA,EAA8BX,kBAC9BA,GACAK,GACAC,EACAyR,EACAvR,EACAwR,GAaEhc,EAAO0Z,GAV4B,CACrChM,MAAO6N,EACP3R,yCACIc,EACJF,yBAA0BG,EAC1B8Q,SAAU,KACVzP,iBAAkB,GAClB0P,6BAA8B,KAC9BC,WAAY,IAYVhU,EAAO,IARIqS,GAAqB,IAC/Ble,IACHse,SAAU3H,EACV4H,UAAW5H,EACX6H,WAAY,KACZC,uBAAwB,KACxBC,cAAeoB,EAAcjQ,eAEH5B,GAAeC,IAE7C,OAAO,IAAI6R,EAAuB,CAC9BlQ,UAAWnoB,KAAKmoB,UAChBhE,OACA3H,QAEP,CAOD,qBAAaic,EAASxJ,MAClBA,EAAKwI,UACLA,EAASlb,SACTA,EAAQyb,gBACRA,IAGAzb,EAAWT,GAAGS,GAEd,MAAMmc,EAA0Brc,GAC5Bob,EACAlb,IAIE2K,8BACFA,EAA6BC,+BAC7BA,EAA8BX,kBAC9BA,GACAK,GACA,GACA,GACA,CAAC6R,GACDV,GAgBExb,EAAO0Z,GAZ4B,CACrChM,MAAO,KACP9D,yCACIc,EACJF,yBAA0BG,EAC1B8Q,SAAU,KAEVzP,iBAAkB,GAClB0P,6BAA8B3b,EAC9B4b,WAAY,IAaVhU,EAAO,IARIqS,GAAqB,IAC/Ble,IACHse,SAAU3H,EACV4H,UAAW5H,EACX6H,WAAY92B,KAAKu3B,yBACjBR,uBAAwB,KACxBC,cAAeoB,EAAcjQ,eAEH5B,GAAeC,IAE7C,OAAO,IAAI6R,EAAuB,CAC9BlQ,UAAWnoB,KAAKmoB,UAChBhE,OACA3H,QAEP,CAMD,uBAAamc,EAAW1J,MACpBA,EAAKnI,wBACLA,EAAuB2Q,UACvBA,EAASlb,SACTA,EAAQgc,4BACRA,EAA2BR,oBAC3BA,EAAmBC,gBACnBA,IAGAzb,EAAWT,GAAGS,GAEd,MAAMyK,EAA2BhnB,KAAK23B,4BAClC7Q,EACAvK,IAIE2K,8BACFA,EAA6BC,+BAC7BA,EAA8BX,kBAC9BA,GACAK,GACAC,EACAyR,EACAvR,EACAgR,GAaExb,EAAO0Z,GAV4B,CACrChM,MAAO6N,EACP3R,yCACIc,EACJF,yBAA0BG,EAC1B8Q,SAAU,KACVzP,iBAAkB,GAClB0P,6BAA8B3b,EAC9B4b,WAAY,IAYVhU,EAAO,IARIqS,GAAqB,IAC/Ble,IACHse,SAAU3H,EACV4H,UAAW5H,EACX6H,WAAY92B,KAAKu3B,yBACjBR,uBAAwBU,EACxBT,cAAeoB,EAAcjQ,eAEH5B,GAAeC,IAE7C,OAAO,IAAI6R,EAAuB,CAC9BlQ,UAAWnoB,KAAKmoB,UAChBhE,OACA3H,QAEP,EAUW,SAAAoc,GACZnC,EACAoC,GAEA,IAAIC,EAAsBhd,GAAG,GAC7B+c,EAAmB/c,GAAG+c,GAEtB,MAAME,EAAyD,GAE/DtC,EAASuC,MAAK,CAACt0B,EAAGlD,IAAMA,EAAE+a,SAASja,IAAIoC,EAAE6X,YAEzC,IAAK,MAAMkK,KAAWgQ,EAAU,CAC5B,GAAIqC,EAAoB9lB,IAAI8I,GAAG+c,IAAoB,MACnDC,EAAsBA,EAAoBnwB,IAAI8d,EAAQlK,UACtDwc,EAAiBvZ,KAAKiH,EACzB,CAED,GAAIqS,EAAoB5lB,GAAG4I,GAAG+c,IAC1B,MAAM,IAAI15B,MACN,8CAA8C05B,EAAiBp2B,0BAA0Bq2B,EAAoBr2B,cAIrH,MAAO,CAACs2B,EAAkBD,EAC9B,CCviBO7T,eAAewT,GAClBrK,EACAa,EACA1S,EACAkb,EACAO,EACA1J,GAEA,MAAMxE,UAAEA,SAAoBsE,EAAIzE,qBAE1BsP,QAAWtC,GAAmB8B,SAAS,CACzCxJ,MAAOA,EAAMG,UACbqI,YACAlb,WACAyb,oBAGE3J,EAAKW,GACP,CAACkK,EAAqBC,oBAAoB,CAAEC,MAAO,MAAcH,GACjEhK,EACAnF,EACA,IAKJ,aAFmBqE,GAAiBC,EAAKC,EAAIC,EAGjD,CCfOrJ,eAAe4S,GAClBzJ,EACAa,EACA/G,EACAC,EACAlP,EACAC,EACA8e,EACA1J,GAEA,MAAMxE,UAAEA,SAAoBsE,EAAIzE,qBAEhC1Q,EAAcA,GAAeP,IAA+BO,YAC5DC,EAAeA,GAAgBR,IAA+BQ,aAE9D,MAAMmP,EAAOJ,GAAkBC,EAAOC,GAChC1L,EAAU2L,GAAcC,EAAMpP,GAE9BiR,QAAckE,EAAIiL,wBAAmB5iB,EAAW,CAClD,CACIgG,QAASX,GAAGW,EAAQ8B,WACpB+a,KAAMrgB,EACNsgB,MAAOrgB,KAIT2P,EAA2B,CAC7BR,KAAMA,EACNK,2BAA4BwB,EAAMsP,YAAY,GAC9ClR,wBAAyB4B,EAAMuP,YAAY,GAC3C3Q,mBAAoBoB,EAAMwP,gBAAgB,IAGxCT,QAAWtC,GAAmBkB,cAAc,CAC9C5I,MAAOA,EAAMG,UACb5G,iBAAkBK,EAClBiP,WAAY71B,MAAMmW,KAAKqE,EAAQ8B,WAC/BwZ,oBAAqB7N,EAAM2C,gBAC3B1E,YACA6P,oBAGE3J,EAAKW,GACP,CAACkK,EAAqBC,oBAAoB,CAAEC,MAAO,MAAcH,GACjEhK,EACAnF,EACA,IAKJ,aAFmBqE,GAAiBC,EAAKC,EAAIC,EAGjD,CAsBOrJ,eAAe0U,GAClBvL,EACAa,EACA/G,EACA3L,EACA4L,EACAlP,EACAC,EACA8e,EACA1J,GAEA/R,EAAWT,GAAGS,GAEd,MAAMuL,QAA2BsG,EAAIwL,6BACjC3K,EAAMG,YAGHyK,GAAiBjB,GACpB9Q,EAAmBnE,MACnBpH,IAGEuN,UAAEA,SAAoBsE,EAAIzE,qBAEhC1Q,EAAcA,GAAeP,IAA+BO,YAC5DC,EAAeA,GAAgBR,IAA+BQ,aAE9D,MAAMmP,EAAOJ,GAAkBC,EAAOC,GAChC1L,EAAU2L,GAAcC,EAAMpP,GAE9BiR,QAAckE,EAAI0L,iBACpBD,EAAcjW,KAAI6C,GAAW3K,GAAG2K,EAAQ3J,QACxC,CAAChB,GAAGW,EAAQ8B,aAMVsK,EAA2B,CAC7BR,KAAMA,EACNK,2BACIwB,EAAMsP,YAAYtP,EAAMsP,YAAYr5B,OAAS,GACjDmoB,wBACI4B,EAAMuP,YAAYvP,EAAMuP,YAAYt5B,OAAS,GACjD2oB,mBACIoB,EAAMwP,gBAAgBxP,EAAMwP,gBAAgBv5B,OAAS,IAGvD84B,QAAWtC,GAAmBkB,cAAc,CAC9C5I,MAAOA,EAAMG,UACb5G,iBAAkBK,EAClBiP,WAAY71B,MAAMmW,KAAKqE,EAAQ8B,WAC/BwZ,oBAAqB7N,EAAM2C,gBAC3B/F,wBAAyB+S,EACzB9S,sBAAuBmD,EAAMsP,YAC7BrR,YACA6P,oBAGE3J,EAAKW,GACP,CAACkK,EAAqBC,oBAAoB,CAAEC,MAAO,MAAcH,GACjEhK,EACAnF,EACA,IAKJ,aAFmBqE,GAAiBC,EAAKC,EAAIC,EAGjD,CC5JOrJ,eAAe0T,GAClBvK,EACAa,EACA1S,EACAwd,EACA/B,EACA1J,GAIA,MAAM0L,SACK5L,EAAIwL,6BAA6B3K,EAAMG,YAAYzL,MAE9DpH,EAAWT,GAAGS,GAEd,MAAM0d,EAAgB7C,GAClB4C,GAGJ,GAAIzd,EAASzJ,GAAGmnB,GACZ,MAAM,IAAI96B,MACN,4CAA4Cod,UAAiB0d,KAIrE,MAAM/P,QAAckE,EAAI0L,iBACpBE,EAAwCpW,KAAIrS,GAAKuK,GAAGvK,EAAEuL,UAGpDgN,UAAEA,SAAoBsE,EAAIzE,qBAC1BsP,QAAWtC,GAAmBgC,WAAW,CAC3C1J,MAAOA,EAAMG,UACbqI,UAAWsC,EACX/B,gBAAiBA,EACjBlR,wBAAyBkT,EACzBjC,oBAAqB7N,EAAM2C,gBAC3B0L,4BAA6BrO,EAAMsP,YACnCjd,aAGE8R,EAAKW,GACP,CAACkK,EAAqBC,oBAAoB,CAAEC,MAAO,MAAcH,GACjEhK,EACAnF,EACA,IAKJ,aAFmBqE,GAAiBC,EAAKC,EAAIC,EAGjD,CC1EgB,SAAA4L,GAAaC,EAAgBC,GACzC,OAAIA,EAAQhd,SAAS+c,GACVC,EAAQC,QACXxrB,GAAKA,EAAEugB,UAAU3sB,aAAe03B,EAAO/K,UAAU3sB,aAGlD23B,CACX,CCyBOnV,eAAeqT,GAClBlK,EACAa,EACA1S,EACAD,EACAmb,EAEA5e,EACAyV,GAEA,IAAIwK,EAAsBhd,GAAG,GAC7B,MAAMgM,EAA2D,GACjE,IAAIwS,EAIJ,IAFA/d,EAAWT,GAAGS,GAEPuc,EAAoB5lB,GAAGqJ,IAAW,CACrC,MAAMge,EAAkD,CACpDC,aAAS/jB,EACTgkB,eAAWhkB,EACX6jB,SACAI,MAAO,IAAI/6B,EARD,MAURg7B,QAAcvM,EAAIwL,6BACpBtd,EAAM8S,UACNmL,GAGJ,IAAK,MAAM9T,KAAWkU,EAAMhX,MACpB8C,EAAQlK,SAASzJ,GAAG,IAAInT,EAAG,MAC3BmoB,EAAmBtI,KAAKiH,GACxBqS,EAAsBA,EAAoBnwB,IAAI8d,EAAQlK,WAK9D,GADA+d,EAASK,EAAML,aAAU7jB,EACrBkkB,EAAMhX,MAAMxjB,OAvBF,KAuBwB24B,EAAoB9lB,IAAIuJ,GAC1D,KACP,CAED,GAAIuc,EAAoB5lB,GAAGqJ,GACvB,MAAM,IAAIpd,MACN,8CAA8Cod,EAAS9Z,0BAA0Bq2B,EAAoBr2B,cAI7G,MAAOo3B,GAAiBjB,GACpB9Q,EACAvL,GAGE2N,QAAckE,EAAI0L,iBACpBD,EAAcjW,KAAI6C,GAAW3K,GAAG2K,EAAQ3J,SAGtCmc,QAAWtC,GAAmB2B,SAAS,CACzCrJ,MAAOA,EAAMG,UACbtI,wBAAyB+S,EACzBpC,YACAlb,WACAgc,4BAA6BrO,EAAMsP,YACnCzB,oBAAqB7N,EAAM2C,gBAC3B2L,iBAAkB3f,KAGhBiR,UAAEA,SAAoBsE,EAAIzE,qBAC1BiR,EAAW5L,GACb,CAACkK,EAAqBC,oBAAoB,CAAEC,MAAO,MAAcH,GACjEhK,EACAnF,GAGJ,aADmBqE,GAAiBC,EAAKwM,EAAUtM,EAEvD,KC3GYuM,GAMAC,GAKAC,GAMAC,GAOAC,GAKAC,GAIAC,GAMAC,GASAC,IAhDZ,SAAYR,GACRA,EAAA,kBAAA,oBACAA,EAAA,QAAA,UACAA,EAAA,4BAAA,6BACH,CAJD,CAAYA,KAAAA,GAIX,CAAA,IAED,SAAYC,GACRA,EAAA,gCAAA,kCACAA,EAAA,2BAAA,4BACH,CAHD,CAAYA,KAAAA,GAGX,CAAA,IAED,SAAYC,GACRA,EAAA,gBAAA,kBACAA,EAAA,2BAAA,6BACAA,EAAA,oBAAA,qBACH,CAJD,CAAYA,KAAAA,GAIX,CAAA,IAED,SAAYC,GACRA,EAAA,qBAAA,uBACAA,EAAA,qBAAA,uBACAA,EAAA,2BAAA,6BACAA,EAAA,YAAA,aACH,CALD,CAAYA,KAAAA,GAKX,CAAA,IAED,SAAYC,GACRA,EAAA,wBAAA,0BACAA,EAAA,8BAAA,+BACH,CAHD,CAAYA,KAAAA,GAGX,CAAA,IAED,SAAYC,GACRA,EAAA,4BAAA,6BACH,CAFD,CAAYA,KAAAA,GAEX,CAAA,IAED,SAAYC,GACRA,EAAA,cAAA,gBACAA,EAAA,sBAAA,wBACAA,EAAA,wBAAA,yBACH,CAJD,CAAYA,KAAAA,GAIX,CAAA,IAED,SAAYC,GACRA,EAAA,4BAAA,8BACAA,EAAA,0BAAA,4BACAA,EAAA,sBAAA,wBACAA,EAAA,uCAAA,yCACAA,EAAA,4BAAA,8BACAA,EAAA,gCAAA,iCACH,CAPD,CAAYA,KAAAA,GAOX,CAAA,IAED,SAAYC,GACRA,EAAA,8BAAA,gCACAA,EAAA,mBAAA,qBACAA,EAAA,8BAAA,gCACAA,EAAA,yBAAA,2BACAA,EAAA,qBAAA,uBACAA,EAAA,mBAAA,qBACAA,EAAA,eAAA,gBACH,CARD,CAAYA,KAAAA,GAQX,CAAA,IAED,MAAMC,WAAkBn8B,MACpBo8B,KACAC,aACAC,YAEA,WAAA/7B,CAAY67B,EAAcC,EAAsBC,GAC5Clb,MAAM,GAAGgb,MAASE,KAClBz7B,KAAKu7B,KAAOA,EACZv7B,KAAKw7B,aAAeA,EACpBx7B,KAAKy7B,YAAcA,CACtB,EAGC,MAAOC,WAAkBJ,IAEzB,MAAOK,WAA2BL,IAElC,MAAOM,WAAwBN,IAE/B,MAAOO,WAAiBP,IAExB,MAAOQ,WAAyBR,IAEhC,MAAOS,WAAkBT,IAEzB,MAAOU,WAAmBV,IAE1B,MAAOW,WAAwBX,IAE/B,MAAOY,WAAmBZ,UCtDnBa,GACD,4BAAMC,GACV,MAAM,IAAIj9B,MACN,4GAEP,CACO,uCAAMk9B,GACV,MAAM,IAAIl9B,MACN,uHAEP,CACO,0DAAMm9B,GACV,MAAM,IAAIn9B,MACN,0IAEP,CACO,iDAAMo9B,GACV,MAAM,IAAIp9B,MACN,iIAEP,CACO,kDAAMq9B,EAA6CpjB,WACvDA,EAAUoQ,UACVA,IAKA,MAAM,IAAIrqB,MACN,kIAEP,EA8JL,MAAMs9B,GAAsBC,EACxBpf,EAASrF,GACTrX,KACAoiB,GAAS,IAAI/K,EAAU+K,KAMrB2Z,GAAkBD,EAAOpf,EAAQ,OAAiB1c,KAAUoiB,GAC9D/gB,MAAMmW,KAAK,IAAIH,EAAU+K,GAAOzE,aAM9Bqe,GAAkBF,EAAOpf,EAAS3d,GAAKiB,KAAUoiB,GAC5CjH,GAAYiH,EAAO,YAGxB6Z,GAAYH,EAAOpf,EAAS3d,GAAKC,KAAUojB,GAEzChG,OAAOC,cAAc+F,GACdlH,GAAGkH,GAGHlH,GAAGkH,EAAMvgB,WAAY,MAO9Bq6B,GAA2CJ,EAC7C97B,IACAA,KACAoiB,GAAoB,KAAVA,EAAe,KAAOA,IAK9B,SAAU+Z,GAAsB1Y,GAClC,OAAOgR,EAAM,CACT2H,EAAK,CACDC,QAASC,EAAQ,OACjBC,GAAIv8B,IACJyjB,WAEJ2Y,EAAK,CACDC,QAASC,EAAQ,OACjBC,GAAIv8B,IACJw8B,MAAOJ,EAAK,CACRzB,KAAM8B,IACNC,QAAS18B,IACT4b,KAAM+gB,EAASC,UAI/B,CAKA,MAAMC,GAAmBV,GAAgBM,KAKnC,SAAUK,GAAoBC,GAChC,OAAOjB,EAAOK,GAAgBY,GAASF,IAAkBza,GACjD,UAAWA,EACJA,EAEA,IACAA,EACHqB,OAAQ7B,EAAOQ,EAAMqB,OAAQsZ,KAI7C,CAaM,SAAUC,GAA8B5a,GAC1C,OAAO0a,GACHV,EAAK,CACDpO,QAASoO,EAAK,CACVrO,KAAM/uB,MAEVojB,UAGZ,CAKO,MAAM6a,GAA0Bb,EAAK,CACxCvgB,QAAS8gB,EAASZ,IAClB7f,KAAM8f,GACNpgB,KAAM+gB,EACFP,EAAK,CACDxgB,KAAMsgB,GACNgB,SAAUlB,GACVpI,cAAeqI,MAGvBtgB,SAAUsgB,GACVvgB,MAAOmgB,GACP1f,UAAWnd,IACX05B,KAAMmD,GACN7H,IAAK2I,EAASV,IACdkB,YAAalB,KAGJmB,GAAkBhB,EAAK,CAChCiB,KAAMxB,GACNngB,MAAOmgB,GACPyB,OAAQrB,GACRsB,SAAUZ,EAASd,IACnB/b,MAAO9f,MAMEw9B,GAA+BpB,EAAK,CAC7CqB,UAAWL,GACXvX,QAASoX,KAMAS,GAAmCtB,EAAK,CACjDrZ,MAAO8N,EAAMoM,MAMJU,GAAkCvB,EAAK,CAChDrZ,MAAO8N,EAAMoM,IACbvD,OAAQiD,EAAS38B,OAMR49B,GAAiDxB,EAAK,CAC/DrZ,MAAO8N,EAAM2M,IACb9D,OAAQiD,EAAS38B,OAMR69B,GAAa7+B,IAKb8+B,GAAe99B,IAKf+9B,GAAkC3B,EAAK,CAChDrZ,MAAO8N,EACHuL,EAAK,CACDxT,UAAW5oB,IACX+tB,KAAM/uB,IACNg/B,UAAWh/B,IACXw9B,MAAOG,EAAS38B,UAQfi+B,GAA2C7B,EAAK,CACzDrZ,MAAO8N,EACHuL,EAAK,CACDxT,UAAW5oB,IACX+tB,KAAM/uB,IACNg/B,UAAWh/B,OAGnB06B,OAAQiD,EAAS38B,OAMRk+B,GAAmB9B,EAAK,CACjClgB,KAAM8f,GACN7f,UAAWnd,IACXiZ,WAAY4jB,GACZvS,MAAOuH,EAAMmL,IACbmC,QAASn/B,IACTo/B,KAAMpC,KAMGqC,GAAwBjC,EAAK,CACtCvgB,QAASmgB,GACTsC,UAAWt/B,IACXiZ,WAAY4jB,GACZvS,MAAOuH,EAAMmL,IACbmC,QAASn/B,IACTo/B,KAAMpC,GACNuC,kBAAmBvC,GACnBwC,mBAAoBxC,GACpByC,oBAAqBz/B,MAMnB0/B,GAAwBtC,EAAK,CAC/Bt4B,EAAG+sB,EAAM7xB,KACT4B,EAAGiwB,EAAM7xB,KACTkB,EAAG2wB,EAAM7xB,OAMA2/B,GAAsBvC,EAAK,CACpCnQ,gBAAiByS,GACjBE,YAAa/N,EAAM7xB,KACnB6/B,OAAQhO,EAAMmL,IACdpD,YAAa/H,EAAM7xB,KACnB8/B,MAAOjO,EAAMmL,IACbnD,YAAahI,EAAMgL,MAQVkD,GAA6BlO,EAAMqN,IAKnCc,GAAgB5C,EAAK,CAC9BkB,OAAQrB,KAGCgD,GAAsBhD,GAEtBiD,GAAqB9C,EAAK,CACnCpV,QAASiV,GACToB,KAAMxB,KAGGsD,GAAyB/C,EAAK,CACvCgD,cAAevO,EAAMqO,IACrBxF,OAAQiD,EAAS38B,OAGRq/B,GAA2BjD,EAAK,CACzCrZ,MAAO8N,EAAMqO,IACbxF,OAAQiD,EAAS38B,OAGRs/B,GAAmClD,EAAK,CACjD1C,OAAQiD,EAAS38B,KACjB+iB,MAAO8N,EACHuL,EAAK,CACDpV,QAASiV,GACTvgB,MAAOmgB,QAKN0D,GAAqBnD,EAAK,CACnClgB,KAAM2U,EAAM7xB,KACZo/B,KAAMvN,EAAM7xB,KACZsqB,MAAOuH,EAAMA,EAAM7xB,QAGVwgC,GAAmBxB,GACrB,IAAIyB,KAAKzB,GAAW0B,UAGlBC,GAAsBvD,EAAK,CACpCrZ,MAAO8N,EACHuL,EAAK,CACD4B,UAAWh/B,IACX4pB,UAAW5oB,IACX+tB,KAAM/uB,SAKL4gC,GAAgCxD,EAAK,CAC9CrZ,MAAO8N,EACHuL,EAAK,CACD4B,UAAWh/B,IACX4pB,UAAW5oB,IACX+tB,KAAM/uB,OAGd06B,OAAQiD,EAAS38B,OAGR6/B,GAA8BzD,EAAK,CAC5C0D,gBAAiB1D,EAAK,CAClB2D,eAAgBlP,EACZuL,EAAK,CACDvW,QAASoX,GACT+C,kBAAmBrD,EAASS,OAGpC6C,eAAgBpP,EACZuL,EAAK,CACDvW,QAASoX,GACT+C,kBAAmBrD,EAASS,SAMxC8C,YAAatD,MC7XX,SAAUuD,IAAiBvM,cAC7BA,EAAahY,KACbA,EAAIshB,SACJA,IAMA,MAAO,CACHtJ,cAAeA,EAAc3xB,QAAQ,KAAM,GAC3C2Z,KAAMlc,EAAO8X,KAAKoE,EAAM,UACxBshB,SAAUA,EAASj7B,QAAQ,KAAM,IAEzC,CAGAoiB,eAAe+b,GACX5S,EACA6S,EACAC,EACAC,EAA4B,GAE5B,MAAMC,EAAWD,EACX,uCACA,oCACAE,EAAkBF,EAAmB,WAAa,QAElDG,QAAkBC,GAAWnT,EAAIoT,uBAAwBJ,EAAU,CACrEC,CAACA,GAAkBJ,EAAgBQ,WACnCxD,KAAMiD,EAAQjD,MAAMwD,WACpB/G,MAAOwG,EAAQxG,OAAOn1B,WACtB+0B,OAAQ4G,EAAQ5G,SAGdv0B,EAAMyc,EACR8e,EACA1D,GAAwBY,KAE5B,GAAI,UAAWz4B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,iDAAiDiE,KAAmBJ,EAAgBQ,cAG5F,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MAAM,gCAEpB,MAAMs3B,EAAiC,GA6CvC,OA3CA1wB,EAAIse,OAAOrB,MAAMW,MAAMC,KAAIE,IACvB,MAAM6d,EAAW7d,EAAK2C,QAChBmb,EAAa9d,EAAKua,UAElB/W,EACF5K,GACIG,GACI8kB,EAASrI,KACTuI,GACAF,EAAS7kB,KAAKja,QAAQ,KAAM,IAC5B8+B,EAAS5kB,WAEb4kB,EAASrlB,MACTR,GAAG6lB,EAASplB,UACZolB,EAASnlB,KAAOukB,GAAiBY,EAASnlB,WAAQ/F,EAClDkrB,EAASllB,cAAWhG,GAGtBqrB,EAAoB,CACtB7D,KAAM2D,EAAW3D,KACjB3hB,MAAOslB,EAAWtlB,MAClB4hB,OAAQ0D,EAAW1D,OACnBC,SAAUyD,EAAWzD,SACrBzd,MAAO,CAAC,gBAAiB,cAAe,UAAUqhB,QAC9CH,EAAWlhB,OAEfshB,IAAK,MAGT,GACIF,EAAOT,IAAkBI,aAAeR,EAAgBQ,WAExD,MAAM,IAAItiC,MACN,mCAAmCkiC,8BAA4CA,KAIvF5K,EAASjX,KAAK,CACV8H,oBACAwa,UACF,IAGC,CACHne,MAAO8S,EAASuC,MACZ,CAACt0B,EAAGlD,IACAA,EAAE8lB,kBAAkBvK,UAAYrY,EAAE4iB,kBAAkBvK,YAE5Dud,OAAQv0B,EAAIse,OAAOrB,MAAMsX,OAEjC,CAGA,SAAS2H,GACLC,GAKA,MAAMC,EAA0BD,EAAmCzb,QAC7D2b,EACFF,EAAmCtB,kBAEjCtZ,EACF5K,GACIG,GACIslB,EAAwBtpB,WACxBgpB,GACAM,EAAwBrlB,KAAKja,QAAQ,KAAM,IAC3Cs/B,EAAwBplB,WAE5BolB,EAAwB7lB,MACxBR,GAAGqmB,EAAwB5lB,UAC3B4lB,EAAwB3lB,KAClBukB,GAAiBoB,EAAwB3lB,WACzC/F,EACN0rB,EAAwB1lB,cAAWhG,GAG3C,OAAwB,OAApB2rB,EACO,CAAE3b,QAASa,EAAmB+a,eAAgB,MAclD,CAAE5b,QAASa,EAAmB+a,eAXX,CACtBpE,KAAMmE,EAAgBnE,KACtB3hB,MAAO8lB,EAAgB9lB,MACvB4hB,OAAQkE,EAAgBlE,OACxBC,SAAUiE,EAAgBjE,SAC1Bzd,MAAO,CAAC,gBAAiB,cAAe,UAAUqhB,QAC9CK,EAAgB1hB,OAEpBshB,IAAK,MAIb,CAYgB,SAAAM,GACZC,EAAkD,wBAClDf,EAAiC,wBACjCgB,EAAyB,wBACzBC,GAEA,MAAMrB,EACoC,iBAA/BmB,EACDA,EACAA,EAA2BG,YACrC,OAAO,IAAIC,GAAIvB,EAAUI,EAAwBgB,EAAgBC,EACrE,OAGalB,GAAatc,MACtByd,EACAE,EACA/Z,EAAc,GACdga,EAAqB,KAGrB,MAAMC,EAAOC,KAAKC,UAAU,CACxB/F,QAAS,MACTE,GAAI,eACJyF,OAAQA,EACR/Z,OAAQA,IAkBNoa,QAAiBC,MAAMR,EAAa,CACtCE,OAAQ,OACRO,QAAS,CAAE,eAAgB,oBAC3BL,KAAMA,IAGV,IAAKG,EAASG,GACV,MAAM,IAAIjkC,MAAM,uBAAuB8jC,EAASI,UAGpD,OAAIR,EAEO9e,SADWkf,EAAS7Y,cAGlB6Y,EAAS7Y,MAAM,EAInBkZ,GAAgBre,MACzBud,EACAI,EACA/Z,EAAc,MAId,IAOIia,EACW,cAAXF,EACAE,EAAOC,KAAKC,UAAU,CAClBO,YAAa,YACbC,gBAAiB,GACjB1c,wBAAyB+B,IAGX,gBAAX+Z,EACPE,EAAOC,KAAKC,UAAU,CAClBO,YAAa,gBACbE,kBAAmB,GAEnBC,aAAc7a,IAEA,aAAX+Z,IACPE,EAAOC,KAAKC,UAAU,CAClBO,YAAa,WAEbC,gBAAiB,GACjBC,kBAAmB,GACnB3c,wBAAyB+B,EAAO,GAChC6a,aAAc7a,EAAO,MAI7B,MAAMoa,QAAiBC,MAAM,GAAGV,UAAwB,CACpDI,OAAQ,OACRO,QAAS,CAAE,eAAgB,oBAC3BL,KAAMA,IAGV,IAAKG,EAASG,GACV,MAAM,IAAIjkC,MAAM,yBAAyB8jC,EAASU,cAQtD,OAJwBxY,GADThB,SADS8Y,EAAS7Y,QAMX,EAoCpB,SAAUwZ,GACZC,GAEA,MAAMC,EAA+B,GAErC,IAAK,IAAIliC,EAAI,EAAGA,EAAIiiC,EAAwB1jC,OAAQyB,IAAK,CACrD,MAAM+U,EAA4B,CAC9BqoB,KAAMjc,GAAM8gB,EAAwBjiC,GAAGo9B,MACvC+E,UAAWF,EAAwBjiC,GAAGmb,UACtCinB,aAAcH,EAAwBjiC,GAAGqiC,YAAYrgB,KAAIsgB,GACrDnhB,GAAMmhB,KAEVC,KAAMphB,GAAMjH,GAAG+nB,EAAwBjiC,GAAGkb,QAE9CgnB,EAAOtkB,KAAK7I,EACf,CAED,OAAOmtB,CACX,CAEM,SAAUM,GACZC,GAEA,MAAMP,EAAmC,GACzC,IAAK,IAAIliC,EAAI,EAAGA,EAAIyiC,EAA8BlkC,OAAQyB,IAAK,CAC3D,MAAM+U,EAAgC,CAClCqoB,KAAMjc,GAAMshB,EAA8BziC,GAAGo9B,MAC7Chc,MAAOD,GAAMshB,EAA8BziC,GAAGohB,OAC9C+gB,UACIM,EACIziC,GACF0iC,8BAA8B/+B,WACpCy+B,aAAcK,EACVziC,GACF2iC,oCAAoC3gB,KAAIsgB,GAAOnhB,GAAMmhB,KACvDhF,UAAWmF,EAA8BziC,GAAGs9B,UAAU35B,WACtDi/B,oBAAqBzhB,GACjBshB,EAA8BziC,GAAG4iC,qBAErCC,qBAAsB1hB,GAClBshB,EAA8BziC,GAAG6iC,uBAGzCX,EAAOtkB,KAAK7I,EACf,CACD,OAAOmtB,CACX,CAIA,SAASY,GACLC,EACAC,EACAC,GAEA,GAAIF,EAAYxkC,SAAWykC,EAAazkC,OACpC,MAAM,IAAIhB,MAAM,6BAEpB,GAA2B,IAAvBwlC,EAAYxkC,OACZ,OAAO,IAAIR,EAAG,GAGlB,IAAImlC,EAAYD,EAAUE,eAAe,CACrCJ,EAAY,GAAGliC,WACfmiC,EAAa,GAAGniC,aAGpB,IAAK,IAAIb,EAAI,EAAGA,EAAI+iC,EAAYxkC,OAAQyB,IACpCkjC,EAAYD,EAAUE,eAAe,CACjCD,EAAUriC,WACVkiC,EAAY/iC,GAAGa,WACfmiC,EAAahjC,GAAGa,aAIxB,OAAOqiC,CACX,CAEM,SAAUE,GACZC,EACAC,EACAC,EACAN,GAEA,MACMO,EAAqBV,GADNO,EAAcrhB,KAAIrS,GAAKA,EAAEytB,OAG1CkG,EACAL,GAGEQ,EAAmBF,EAAiBvhB,KAAIrS,GAAKA,EAAEyR,QAE/CsiB,EAAwBZ,GADNS,EAAiBvhB,KAAIrS,GAAKA,EAAEytB,OAGhDqG,EACAR,GAGJ,OAAKS,EAAsBlgC,SAEfggC,EAAmBhgC,SAGpBs/B,GACH,CAACU,GACD,CAACE,GACDT,GALGO,EAFAE,CAUf,CAGA,MAAMzD,GAAqBnpB,IAA+BC,eACpD4sB,GAAmB7sB,IAA+BQ,aAKlD,MAAOypB,WACDvS,EAGRjH,WACAqY,uBACAgB,eAUA,WAAA9iC,CACI0hC,EACAI,EACAgB,EACAC,GAEAliB,MAAM6gB,EAAUqB,GAAU,aAE1BziC,KAAKmpB,WAAa,IAAIiH,EAAWgR,EAAUqB,GAAU,aACrDziC,KAAKwhC,uBAAyBA,EAC9BxhC,KAAKwiC,eAAiBA,CACzB,CAED,cAAIppB,GACA,OAAOpZ,KAAKmpB,WAAW/P,UAC1B,CAED,eAAIspB,GACA,OAAO1iC,KAAKmpB,WAAWuZ,WAC1B,CAID,0BAAM8C,CACFpW,EACAqW,GAEA,OAAOzlC,KAAKmpB,WAAWqc,qBACnBpW,EACAqW,EAEP,CAED,gBAAMC,CACFtW,EACAqW,GAEA,OAAOzlC,KAAKmpB,WAAWuc,WAAWtW,EAAWqW,EAChD,CAED,kBAAME,CAAahX,GACf,OAAO3uB,KAAKmpB,WAAWwc,aAAahX,EACvC,CAED,0BAAMiX,GACF,OAAO5lC,KAAKmpB,WAAWyc,sBAC1B,CAED,4BAAMC,GACF,OAAO7lC,KAAKmpB,WAAW0c,wBAC1B,CAED,eAAMC,CACFrD,GAEA,OAAOziC,KAAKmpB,WAAW2c,UAAUrD,EACpC,CAED,oBAAMsD,CACFC,EACA5sB,GAEA,OAAOpZ,KAAKmpB,WAAW4c,eAAeC,EAAkB5sB,EAC3D,CAED,4BAAM6sB,CACFC,EACA9sB,GAEA,OAAOpZ,KAAKmpB,WAAW8c,uBAAuBC,EAAc9sB,EAC/D,CAED,6BAAM+sB,CACFC,EACA/L,EACAoL,GAEA,OAAOzlC,KAAKmpB,WAAWgd,wBACnBC,EACA/L,EACAoL,EAEP,CAED,mCAAMY,CACFD,EACA/L,EACAjhB,GASA,OAAOpZ,KAAKmpB,WAAWkd,8BACnBD,EACA/L,EACAjhB,EAEP,CAED,wBAAMktB,CACF7D,GAEA,OAAOziC,KAAKmpB,WAAWmd,mBAAmB7D,EAC7C,CAED,6BAAM8D,CACFC,EACAptB,GAEA,OAAOpZ,KAAKmpB,WAAWod,wBAAwBC,EAAaptB,EAC/D,CAED,8BAAMqtB,CACFrX,EACAqW,GAEA,OAAOzlC,KAAKmpB,WAAWsd,yBACnBrX,EACAqW,EAEP,CAED,0BAAMiB,CACFtX,EACAqW,GAIA,OAAOzlC,KAAKmpB,WAAWud,qBACnBtX,EACAqW,EAEP,CAED,oBAAMkB,CACFvX,EACAqW,GAEA,OAAOzlC,KAAKmpB,WAAWwd,eAAevX,EAAWqW,EACpD,CAED,+BAAMmB,CACFC,EACAC,GAMA,OAAO9mC,KAAKmpB,WAAWyd,0BAA0BC,EAAYC,EAChE,CAED,uCAAMC,CACFF,EACApB,GAEA,OAAOzlC,KAAKmpB,WAAW4d,kCACnBF,EACApB,EAEP,CAED,6BAAMuB,CACFH,EACApB,GAEA,OAAOzlC,KAAKmpB,WAAW6d,wBACnBH,EACApB,EAEP,CAED,wBAAMwB,CACF7X,EACAqW,EACAyB,GAEA,OAAOlnC,KAAKmpB,WAAW8d,mBACnB7X,EACAqW,EACAyB,EAEP,CAYD,wBAAMC,CACFhf,EACAif,GAKA,OAAOpnC,KAAKmpB,WAAWge,mBACnBhf,EACAif,EAEP,CAED,8BAAMC,CACFlf,EACAif,GAOA,OAAOpnC,KAAKmpB,WAAWke,yBACnBlf,EACAif,EAEP,CAqdD,oBAAME,CACF3Y,EACAmY,GAIA,OAAO9mC,KAAKmpB,WAAWme,eAAe3Y,EAAMmY,EAC/C,CAED,6BAAMS,CACF/d,EACApQ,GAEA,OAAOpZ,KAAKmpB,WAAWoe,wBAAwB/d,EAAWpQ,EAC7D,CAED,mCAAMouB,CACFhe,EACApQ,GAEA,OAAOpZ,KAAKmpB,WAAWqe,8BACnBhe,EACApQ,EAEP,CAED,oCAAMquB,CACFC,EACAtuB,GAEA,OAAOpZ,KAAKmpB,WAAWse,+BACnBC,EACAtuB,EAEP,CAED,sCAAMuuB,CACFlrB,EACAmrB,EACAC,GAEA,OAAO7nC,KAAKmpB,WAAWwe,iCACnBlrB,EACAmrB,EACAC,EAEP,CAED,uCAAMC,CACFrrB,EACAykB,EACA9nB,GAEA,OAAOpZ,KAAKmpB,WAAW2e,kCACnBrrB,EACAykB,EACA9nB,EAEP,CAED,6BAAM2uB,CACFtrB,EACAykB,EACA9nB,GAEA,OAAOpZ,KAAKmpB,WAAW4e,wBACnBtrB,EACAykB,EACA9nB,EAEP,CAED,iCAAM4uB,CACFvF,GAEA,OAAOziC,KAAKmpB,WAAW6e,4BAA4BvF,EACtD,CAED,wBAAM9Y,CACF8Y,GAEA,OAAOziC,KAAKmpB,WAAWQ,mBAAmB8Y,EAC7C,CACD,kCAAMwF,CACFxC,GAEA,OAAOzlC,KAAKmpB,WAAW8e,6BAA6BxC,EACvD,CAED,sBAAMyC,CACFpe,EACA2Y,GAEA,OAAOziC,KAAKmpB,WAAW+e,iBAAiBpe,EAAW2Y,EACtD,CAED,gBAAM0F,GACF,OAAOnoC,KAAKmpB,WAAWgf,YAC1B,CAED,2BAAMC,CACFC,EACA5F,GAEA,OAAOziC,KAAKmpB,WAAWif,sBAAsBC,EAAY5F,EAC5D,CAED,wBAAM6F,CACFC,EACA9C,GAEA,OAAOzlC,KAAKmpB,WAAWmf,mBACnBC,EACA9C,EAEP,CAED,cAAM+C,CACFD,EACA9C,GAEA,OAAOzlC,KAAKmpB,WAAWqf,SAASD,EAAc9C,EACjD,CAKD,0BAAMgD,CACFhsB,EACAK,GAEA,IAAKA,IAASL,EACV,MAAM,IAAItd,MAAM,2CAEpB,GAAI2d,GAAQL,EACR,MAAM,IAAItd,MAAM,gDAEpB,MAAMmiC,QAAkBC,GACpBvhC,KAAKwhC,uBACL,uBACA,CACI1kB,KAAMA,EAAOX,GAAoBW,QAAQrG,EACzCgG,QAASA,EAAUN,GAAoBM,QAAWhG,IAGpD1Q,EAAMyc,EACR8e,EACA1D,GAAwBL,EAASM,MAErC,GAAI,UAAW93B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,6CAA6CtgB,EAAOA,EAAKra,WAAaga,EAAUA,EAAQha,WAAa,MAG7G,GAAyB,OAArBsD,EAAIse,OAAOrB,MACX,OAAO,KAEX,MAAMc,EAAO/d,EAAIse,OAAOrB,MAaxB,OAZgBtG,GACZG,GACIiH,EAAKwV,KACLuI,GACA/d,EAAKhH,KAAKja,QAAQ,KAAM,IACxBihB,EAAK/G,WAET+G,EAAKxH,MACLR,GAAGgI,EAAKvH,UACRuH,EAAKtH,KAAOukB,GAAiBjd,EAAKtH,WAAQ/F,EAC1CqN,EAAKrH,cAAWhG,EAGvB,CAKD,0BAAMiyB,CAAqBjsB,EAAiBK,GACxC,IAAKA,IAASL,EACV,MAAM,IAAItd,MAAM,2CAEpB,GAAI2d,GAAQL,EACR,MAAM,IAAItd,MAAM,gDAEpB,MAAMmiC,QAAkBC,GACpBvhC,KAAKwhC,uBACL,uBACA,CACI1kB,KAAMA,EAAOX,GAAoBW,QAAQrG,EACzCgG,QAASA,EAAUN,GAAoBM,QAAWhG,IAGpD1Q,EAAMyc,EACR8e,EACA1D,GAAwBiC,KAE5B,GAAI,UAAW95B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,gDAAgDtgB,EAAOA,EAAKra,WAAaga,EAAUA,EAAQha,WAAa,MAGhH,OAAyB,OAArBsD,EAAIse,OAAOrB,MACJlH,GAAG,GAGPA,GAAG/V,EAAIse,OAAOrB,MACxB,CAMD,iCAAM2lB,CAA4BrsB,GAC9B,MAAMglB,QAAkBC,GACpBvhC,KAAKwhC,uBACL,8BACA,CAAEllB,MAAOA,EAAMmlB,aAEb17B,EAAMyc,EACR8e,EACA1D,GAAwBiC,KAE5B,GAAI,UAAW95B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,gDAAgD9gB,EAAMmlB,cAG9D,OAAyB,OAArB17B,EAAIse,OAAOrB,MACJlH,GAAG,GAEPA,GAAG/V,EAAIse,OAAOrB,MACxB,CAMD,+BAAM4lB,CACF9rB,GAEA,MAAMwkB,QAAkBC,GACpBvhC,KAAKwhC,uBACL,4BACA,CAAE1kB,KAAMX,GAAoBW,KAE1B/W,EAAMyc,EACR8e,EACA1D,GAAwBkB,KAE5B,GAAI,UAAW/4B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,8CAA8CtgB,EAAKra,cAG3D,GAAyB,OAArBsD,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,8CAA8C2d,EAAKra,cAa3D,MAT4C,CACxCqa,KAAM/W,EAAIse,OAAOrB,MAAMlG,KAAKja,QAAQ,KAAM,IAC1CgW,WAAY9S,EAAIse,OAAOrB,MAAMnK,WAC7BkE,UAAWhX,EAAIse,OAAOrB,MAAMjG,UAC5BknB,YAAal+B,EAAIse,OAAOrB,MAAMkH,MAC9BvR,eAAgBkpB,GAChBra,UAAWzhB,EAAIse,OAAOrB,MAAM+b,QAAU,KACtCC,KAAMj5B,EAAIse,OAAOrB,MAAMgc,KAG9B,CAMD,mCAAM6J,CACFC,GAEA,MAAMxH,QAAkBC,GACpBvhC,KAAKwhC,uBACL,gCACA,CAAEsH,OAAQA,EAAOllB,KAAI9G,GAAQX,GAAoBW,OAE/C/W,EAAMyc,EACR8e,EACA1D,GAAwBU,KAE5B,GAAI,UAAWv4B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,8CAA8C0L,EAAOllB,KAAI9G,GAAQX,GAAoBW,KAAOisB,KAAK,SAGzG,GAAyB,OAArBhjC,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,8CAA8C2pC,EAAOllB,KAAI9G,GAAQX,GAAoBW,KAAOisB,KAAK,SAGzG,MAAMtS,EAAiD,GAiBvD,OAhBA1wB,EAAIse,OAAOrB,MAAMW,MAAMC,KAAIE,IACvB,MAAM2C,EAAU/J,GACZG,GACIiH,EAAKwV,KACLuI,GACA/d,EAAKhH,KAAKja,QAAQ,KAAM,IACxBihB,EAAK/G,WAET+G,EAAKxH,MACLR,GAAGgI,EAAKvH,UACRuH,EAAKtH,KAAOukB,GAAiBjd,EAAKtH,WAAQ/F,EAC1CqN,EAAKrH,cAAWhG,GAEpBggB,EAASjX,KAAKiH,EAAQ,IAGnBgQ,EAASuC,MAAK,CAACt0B,EAAGlD,IAAMA,EAAEub,UAAYrY,EAAEqY,WAClD,CAMD,wCAAMisB,CACFF,GAEA,MAAMxH,QAAkBC,GACpBvhC,KAAKwhC,uBACL,qCACAsH,EAAOllB,KAAI9G,GAAQX,GAAoBW,MAGrC/W,EAAMyc,EACR8e,EACA1D,GAAwBnM,EAAMqN,MAElC,GAAI,UAAW/4B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,gDAAgD0L,EAAOllB,KAAI9G,GAAQX,GAAoBW,KAAOisB,KAAK,SAG3G,GAAyB,OAArBhjC,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,gDAAgD2pC,EAAOllB,KAAI9G,GAAQX,GAAoBW,KAAOisB,KAAK,SAI3G,MAAME,EAA+C,GAErD,IAAK,MAAM/e,KAASnkB,EAAIse,OAAOrB,MAAO,CAClC,MAAMA,EAAsC,CACxClG,KAAMoN,EAAMpN,KAAKja,QAAQ,KAAM,IAC/BgW,WAAYqR,EAAMrR,WAClBkE,UAAWmN,EAAMnN,UACjBknB,YAAa/Z,EAAMA,MACnBvR,eAAgB4sB,GAChB/d,UAAW0C,EAAM6U,QAAU,KAC3BC,KAAM9U,EAAM8U,MAEhBiK,EAAazpB,KAAKwD,EACrB,CACD,OAAOimB,CACV,CAMD,kCAAMrP,CACFtd,EACAmmB,GAEA,MAAMnB,QAAkBC,GACpBvhC,KAAKwhC,uBACL,+BACA,CACIllB,MAAOA,EAAMmlB,WACbjH,QAASiI,GAAQjI,SAAW,GAC5BC,UAAWgI,GAAQhI,UACnBH,OAAQmI,GAAQnI,OAChBI,MAAO+H,GAAQ/H,OAAOn1B,aAIxBQ,EAAMyc,EACR8e,EACA1D,GAAwBW,KAG5B,GAAI,UAAWx4B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,uDAAuD9gB,EAAMmlB,cAGrE,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAO,CACHW,MAAO,GACP2W,OAAQ,MAGhB,MAAM7D,EAAiD,GAmBvD,OAjBA1wB,EAAIse,OAAOrB,MAAMW,MAAMC,KAAIE,IACvB,MAAM2C,EAAU/J,GACZG,GACIiH,EAAKwV,KACLuI,GACA/d,EAAKhH,KAAKja,QAAQ,KAAM,IACxBihB,EAAK/G,WAET+G,EAAKxH,MACLR,GAAGgI,EAAKvH,UACRuH,EAAKtH,KAAOukB,GAAiBjd,EAAKtH,WAAQ/F,EAC1CqN,EAAKrH,cAAWhG,GAGpBggB,EAASjX,KAAKiH,EAAQ,IAGnB,CACH9C,MAAO8S,EAASuC,MAAK,CAACt0B,EAAGlD,IAAMA,EAAEub,UAAYrY,EAAEqY,YAC/Cud,OAAQv0B,EAAIse,OAAOrB,MAAMsX,OAEhC,CAMD,uCAAM4O,CACF5sB,EACA4kB,GAIA,OAFKA,IAASA,EAAU,CAAA,SAEXF,GACThhC,KACAsc,EACA4kB,EACA,EAEP,CAKD,0CAAMiI,CACFhL,EACA+C,GAIA,OAFKA,IAASA,EAAU,CAAA,GAEjBF,GACHhhC,KACAm+B,EACA+C,EACA,EAEP,CAKD,sCAAMkI,CACFtsB,GAEA,MAAMwkB,QAAkBC,GACpBvhC,KAAKwhC,uBACL,mCACA,CAAE1kB,KAAMX,GAAoBW,KAE1B/W,EAAMyc,EAAO8e,EAAW1D,GAAwBgC,KACtD,GAAI,UAAW75B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,sDAAsDtgB,EAAKra,cAGnE,GAAyB,OAArBsD,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,sDAAsD2d,EAAKra,cAInE,MAAO,CAAEy7B,OAAQpiB,GAAG/V,EAAIse,OAAOrB,MAAMkb,QACxC,CAQD,uCAAMmL,CACF/sB,EACA4kB,GAEKA,IAASA,EAAU,CAAA,GAExB,MAAMI,QAAkBC,GACpBvhC,KAAKwhC,uBACL,oCACA,CACIllB,MAAOA,EAAMmlB,WACbxD,KAAMiD,EAAQjD,MAAMwD,WACpB/G,MAAOwG,EAAQxG,OAAOn1B,WACtB+0B,OAAQ4G,EAAQ5G,SAIlBv0B,EAAMyc,EACR8e,EACA1D,GAAwBmC,KAE5B,GAAI,UAAWh6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,qDAAqD9gB,EAAMmlB,cAGnE,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,qDAAqDmd,EAAMmlB,cAWnE,MAAO,CACH9d,MARkBud,EAAQjD,KACxBl4B,EAAIse,OAAOrB,MAAMgd,cAAc3F,QAC3BiP,GACIA,EAAarL,KAAKwD,aAAeP,EAAQjD,KAAMwD,aAEvD17B,EAAIse,OAAOrB,MAAMgd,cAInB1F,OAAQv0B,EAAIse,OAAOrB,MAAMsX,OAEhC,CAMD,yCAAMiP,CACFjtB,EACA4kB,GAEKA,IAASA,EAAU,CAAA,GAExB,MAAMI,QAAkBC,GACpBvhC,KAAKwhC,uBACL,sCACA,CACIllB,MAAOA,EAAMmlB,WACbxD,KAAMiD,EAAQjD,MAAMwD,WACpB/G,MAAOwG,EAAQxG,OAAOn1B,WACtB+0B,OAAQ4G,EAAQ5G,SAIlBv0B,EAAMyc,EACR8e,EACA1D,GAAwBqC,KAE5B,GAAI,UAAWl6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,qDAAqD9gB,EAAMmlB,cAGnE,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,qDAAqDmd,EAAMmlB,cAInE,MAAM+H,EAAgBtI,EAAQjD,KACxBl4B,EAAIse,OAAOrB,MAAMW,MAAM0W,QACnBiP,GACIA,EAAarL,KAAKwD,aAAeP,EAAQjD,KAAMwD,aAEvD17B,EAAIse,OAAOrB,MAAMW,MAEvB,MAAO,CACHiL,QAAS7oB,EAAIse,OAAOuK,QACpB5L,MAAO,CACHW,MAAO6lB,EACPlP,OAAQv0B,EAAIse,OAAOrB,MAAMsX,QAGpC,CASD,wCAAMmP,CACF3sB,GAEA,MAAMwkB,QAAkBC,GACpBvhC,KAAKwhC,uBACL,qCACA,CAAE1kB,KAAMX,GAAoBW,KAE1B/W,EAAMyc,EACR8e,EACA1D,GAAwB2C,KAG5B,GAAI,UAAWx6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,mDAAmDtgB,EAAKra,cAGhE,OAAOsD,EAAIse,OAAOrB,MAAMW,KAC3B,CAMD,uCAAM+lB,CACFlgB,GAEA,MAAM8X,QAAkBC,GACpBvhC,KAAKwhC,uBACL,oCACA,CAAEhY,cAGAzjB,EAAMyc,EACR8e,EACA5D,GAAc+C,KAGlB,GAAI,UAAW16B,EACX,MAAM,IAAI27B,EAAmB37B,EAAIq3B,MAAO,sBAG5C,GAA+B,OAA3Br3B,EAAIse,OAAOyc,YAAsB,OAAO,KAE5C,MAAMH,EAGA,GAEAE,EAGA,GAEN96B,EAAIse,OAAOqc,gBAAgBC,eAAe/c,KAAIE,IAC1C6c,EAAenhB,KAAKyiB,GAAyCne,GAAM,IAEvE/d,EAAIse,OAAOqc,gBAAgBG,eAAejd,KAAIE,IAC1C+c,EAAerhB,KAAKyiB,GAAyCne,GAAM,IAGvE,MAAM6lB,EACFlT,IAWA,MAAMmT,EAAW1lB,OAAO2Q,OACpB4B,EAASrS,QACL,CAAChT,GAAOixB,qBACJ,GAAIA,EAAgB,CAChB,MAAM/lB,MAAEA,EAAK2hB,KAAEA,EAAIC,OAAEA,GAAWmE,EAC1B/d,EAAM,GAAGhI,EAAMmlB,cAAcxD,EAAKwD,aACpCnd,KAAOlT,EACPA,EAAIkT,GAAK4Z,OAAS9sB,EAAIkT,GAAK4Z,OAAOv1B,IAAIu1B,GAEtC9sB,EAAIkT,GAAO,CAAEhI,QAAO2hB,OAAMC,SAEjC,CACD,OAAO9sB,CAAG,GAEd,CAAA,IASR,OAAOw4B,EAASzpC,OAAS,EAAIypC,OAAWnzB,CAAS,EAG/CozB,EAAmBF,EAAuBhJ,GAC1CmJ,EAAoBH,EAAuB9I,GAEjD,MAAO,CACHH,gBAAiB,CACbC,iBACAE,iBACAgJ,mBACAC,qBAEJhJ,YAAa/6B,EAAIse,OAAOyc,YAE/B,CAQD,wCAAMiJ,CACFttB,EACAykB,GAEA,MAAMI,QAAkBC,GACpBvhC,KAAKwhC,uBACL,qCACA,CACI/kB,QAASA,EAAQglB,WACjBnH,OAAQ4G,GAAS5G,OACjBI,MAAOwG,GAASxG,OAAOn1B,aAIzBQ,EAAMyc,EACR8e,EACA1D,GAAwB4C,KAE5B,GAAI,UAAWz6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,wCAAwC3gB,EAAQglB,cAGxD,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,wCAAwCsd,EAAQglB,cAIxD,OAAO17B,EAAIse,OAAOrB,KACrB,CASD,sCAAMgnB,CACF1tB,EACA4kB,GAEA,MAAMI,QAAkBC,GACpBvhC,KAAKwhC,uBACL,mCACA,CACIllB,MAAOA,EAAMmlB,WACbnH,OAAQ4G,GAAS5G,OACjBI,MAAOwG,GAASxG,OAAOn1B,aAIzBQ,EAAMyc,EACR8e,EACA1D,GAAwB4C,KAE5B,GAAI,UAAWz6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,sCAAsC9gB,EAAMmlB,cAGpD,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,sCAAsCmd,EAAMmlB,cAIpD,OAAO17B,EAAIse,OAAOrB,KACrB,CAOD,2CAAMinB,CACF3tB,EACA4kB,GAEA,MAAMI,QAAkBC,GACpBvhC,KAAKwhC,uBACL,wCACA,CACIllB,MAAOA,EAAMmlB,WACbnH,OAAQ4G,GAAS5G,OACjBI,MAAOwG,GAASxG,OAAOn1B,aAIzBQ,EAAMyc,EACR8e,EACA1D,GAAwB4C,KAE5B,GAAI,UAAWz6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,sCAAsC9gB,EAAMmlB,cAGpD,GAAyB,OAArB17B,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,sCAAsCmd,EAAMmlB,cAIpD,OAAO17B,EAAIse,OAAOrB,KACrB,CAKD,sBAAMknB,GACF,MAAM5I,QAAkBC,GACpBvhC,KAAKwhC,uBACL,oBAEEz7B,EAAMyc,EAAO8e,EAAW5D,GAAcgB,KAC5C,GAAI,UAAW34B,EACX,MAAM,IAAI27B,EAAmB37B,EAAIq3B,MAAO,wBAE5C,OAAOr3B,EAAIse,MACd,CAKD,+BAAMwK,CAA0BF,GAC5B,MAAMwb,EAAY9J,KAAK+J,MAEvB,OAAa,CAGT,SAF0BpqC,KAAKqqC,kBAEZ1b,EACf,OAAO,EAEX,GAAI0R,KAAK+J,MAAQD,EAAY,IAEzB,MAAM,IAAIhrC,MACN,iFAGF,IAAIqwB,SAAQC,GAAWC,WAAWD,EAAS,MACpD,CACJ,CAKD,oBAAM4a,GACF,MAAM/I,QAAkBC,GACpBvhC,KAAKwhC,uBACL,kBAEEz7B,EAAMyc,EAAO8e,EAAW5D,GAAce,KAC5C,GAAI,UAAW14B,EACX,MAAM,IAAI27B,EAAmB37B,EAAIq3B,MAAO,sBAE5C,OAAOr3B,EAAIse,MACd,CAKD,mCAAMimB,CACFrM,EACAiD,GAEA,MAAMI,QAAkBC,GACpBvhC,KAAKwhC,uBACL,gCACA,CACIvD,KAAMA,EAAKwD,WACXnH,OAAQ4G,GAAS5G,OACjBI,MAAOwG,GAASxG,OAAOn1B,aAGzBQ,EAAMyc,EACR8e,EACA1D,GAAwBsC,KAE5B,GAAI,UAAWn6B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,oCAIR,OAAOr3B,EAAIse,MACd,CAKD,oCAAMkmB,CACFjQ,EACAI,GAEA,MAAM4G,QAAkBC,GACpBvhC,KAAKwhC,uBACL,iCACA,CAAE9G,QAAOJ,WAEPv0B,EAAMyc,EACR8e,EACA1D,GAAwBiB,KAE5B,GAAI,UAAW94B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,8CAGR,OAAOr3B,EAAIse,MACd,CAKD,kCAAMmmB,CACF9P,EACAJ,GAEA,MAAMgH,QAAkBC,GACpBvhC,KAAKwhC,uBACL,+BACA,CAAE9G,QAAOJ,WAEPv0B,EAAMyc,EACR8e,EACA1D,GAAwBe,KAE5B,GAAI,UAAW54B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,8CAGR,OAAOr3B,EAAIse,MACd,CAWD,iCAAMomB,CAA4BC,GAC9B,MAAMpJ,QAAkBC,GACpBvhC,KAAKwhC,uBACL,8BACAkJ,EAAU9mB,KAAInH,GAAWN,GAAoBM,MAG3C1W,EAAMyc,EACR8e,EACA1D,GAAwBnM,EAAMwN,MAElC,GAAI,UAAWl5B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,0CAA0CsN,EAAU9mB,KAAInH,GAAWN,GAAoBM,KAAUssB,KAAK,SAG9G,GAAyB,OAArBhjC,EAAIse,OAAOrB,MACX,MAAM,IAAI7jB,MACN,0CAA0CurC,EAAU9mB,KAAInH,GAAWN,GAAoBM,KAAUssB,KAAK,SAK9G,MAAM5D,EAAuD,GAE7D,IAAK,MAAMjb,KAASnkB,EAAIse,OAAOrB,MAAO,CAClC,MAAM2nB,EAA2C,CAC7C3L,KAAM9U,EAAM8U,KACZxX,UAAW0C,EAAM6U,QAAU,KAC3B/b,MAAOkH,EAAMzN,QACb+nB,oBAAqBta,EAAMiV,kBAC3BsF,qBAAsBva,EAAMkV,mBAC5BF,UAAWpjB,GAAGoO,EAAMgV,WACpBqF,oCAAqCra,EAAMA,MAC3Coa,8BAA+BxoB,GAAGoO,EAAMmV,qBACxCxmB,WAAYqR,EAAMrR,WAClBF,eAAgB4sB,IAEpBJ,EAAiB3lB,KAAKmrB,EACzB,CACD,OAAOxF,CACV,CAqBD,4BAAMyF,CACF9B,EAAkB,GAClBpF,EAAwB,IAExB,IAAI5W,EAEJ,GAAsB,IAAlBgc,EAAO3oC,QAAwC,IAAxBujC,EAAavjC,OACpC,MAAM,IAAIhB,MACN,qDAED,GAAI2pC,EAAO3oC,OAAS,GAA6B,IAAxBujC,EAAavjC,OAAc,CAEvD,MAAM0jC,QACI7jC,KAAKgpC,mCAAmCF,GAC5ChF,EAASF,GACXC,GAgBJ/W,EAAgB,CACZD,sBAR0ByW,GAC1BtjC,KAAKwiC,eACL,YACAsB,GAMApE,MAAOmE,EAAwBjgB,KAAIsG,GAASA,EAAM8U,OAClDxF,YAAaqK,EAAwBjgB,KACjCsG,GAASA,EAAM1C,YAEnBgY,YAAaqE,EAAwBjgB,KACjCsG,GAASA,EAAMnN,YAEnB0iB,OAAQoE,EAAwBjgB,KAAIsG,GAASpO,GAAGoO,EAAMpN,QACtD2c,YAAaoK,EAAwBjgB,KACjCsG,GAASA,EAAMrR,aAEnB6gB,gBAAiBmK,EAAwBjgB,KACrCsG,GAASA,EAAMvR,iBAG1B,MAAM,GAAsB,IAAlBmwB,EAAO3oC,QAAgBujC,EAAavjC,OAAS,EAAG,CAEvD,MAAMglC,QACInlC,KAAKyqC,4BAA4B/G,GAErCI,EACFM,GAA0Ce,GAgB9CrY,EAAgB,CACZD,sBAT0ByW,GAC1BtjC,KAAKwiC,eACL,cACAsB,GAOApE,MAAOyF,EAAiBvhB,KAAIsG,GAASA,EAAM8U,OAC3CxF,YAAa2L,EAAiBvhB,KAAIsG,GAASA,EAAM1C,YACjDgY,YAAa2F,EAAiBvhB,KAAIsG,GAC9BA,EAAMgV,UAAU35B,aAEpBk6B,OAAQ0F,EAAiBvhB,KAAIsG,GAASpO,GAAGoO,EAAMlH,SAC/CyW,YAAa0L,EAAiBvhB,KAAIsG,GAASA,EAAMrR,aACjD6gB,gBAAiByL,EAAiBvhB,KAC9BsG,GAASA,EAAMvR,iBAG1B,KAAM,MAAImwB,EAAO3oC,OAAS,GAAKujC,EAAavjC,OAAS,GAsD/C,MAAM,IAAIhB,MAAM,iBAtDkC,CAErD,MAAM0kC,QACI7jC,KAAKgpC,mCAAmCF,GAC5ChF,EAASF,GACXC,GAEEsB,QACInlC,KAAKyqC,4BAA4B/G,GAErCmH,EACFzG,GAA0Ce,GAgB9CrY,EAAgB,CACZD,sBAT0ByW,GAC1BtjC,KAAKwiC,eACL,WACA,CAACsB,EAAQ+G,IAOTnL,MAAOmE,EACFjgB,KAAIsG,GAASA,EAAM8U,OACnBzb,OAAO4hB,EAAiBvhB,KAAIsG,GAASA,EAAM8U,QAChDxF,YAAaqK,EACRjgB,KAAIsG,GAASA,EAAM1C,YACnBjE,OAAO4hB,EAAiBvhB,KAAIsG,GAASA,EAAM1C,aAChDgY,YAAaqE,EACRjgB,KAAIsG,GAASA,EAAMnN,YACnBwG,OACG4hB,EAAiBvhB,KACbsG,GAASA,EAAMgV,UAAU35B,cAGrCk6B,OAAQoE,EACHjgB,KAAIsG,GAASpO,GAAGoO,EAAMpN,QACtByG,OAAO4hB,EAAiBvhB,KAAIsG,GAASpO,GAAGoO,EAAMlH,UACnDyW,YAAaoK,EACRjgB,KAAIsG,GAASA,EAAMrR,aACnB0K,OAAO4hB,EAAiBvhB,KAAIsG,GAASA,EAAMrR,cAChD6gB,gBAAiBmK,EACZjgB,KAAIsG,GAASA,EAAMvR,iBACnB4K,OACG4hB,EAAiBvhB,KAAIsG,GAASA,EAAMvR,kBAGnD,CAAsC,CAEvC,OAAOmU,CACV,CAgBD,sBAAMgN,CACFgP,EAAkB,GAClBpF,EAAwB,IAExB,MAAMoH,EACFpyB,IAA+BO,YAC7B8xB,EACFryB,IAA+BQ,aAC7B8xB,EACFtyB,IAA+BG,WAC7BoyB,EACFvyB,IAA+BC,eAC7BuyB,EAAkBpC,EAAOllB,KAAIE,IACxB,CACHhH,KAAMgH,EACNwV,KAAM0R,EACNzR,MAAO0R,MAITE,EAAwBzH,EAAa9f,KAAIE,IACpC,CACHrH,QAASqH,EACTwV,KAAMwR,EACNvR,MAAOwR,MAIf,OAAO/qC,KAAKq5B,mBAAmB6R,EAAiBC,EACnD,CAgBD,wBAAM9R,CACFyP,EAAyB,GACzBpF,EAAkC,IAElC,MAAM1gB,MAAEA,SAAgBhjB,KAAKorC,8BACzBtC,EACApF,GAEJ,OAAO1gB,CACV,CAkBD,mCAAMooB,CACFtC,EAAyB,GACzBpF,EAAkC,IAElC,MAAMpC,QAAkBC,GACpBvhC,KAAKwhC,uBACL,mBACA,CACIsH,OAAQA,EAAOllB,KAAI,EAAG9G,UAAWX,GAAoBW,KACrDuuB,sBAAuB3H,EAAa9f,KAChC,EAAGnH,UAAS6c,WAAY,CACpB7c,QAASN,GAAoBM,GAC7B6c,KAAMA,EAAKmI,iBAMrB17B,EAAMyc,EACR8e,EACA1D,GAAwB2B,KAE5B,GAAI,UAAWx5B,EACX,MAAM,IAAI27B,EACN37B,EAAIq3B,MACJ,uDAAuD0L,EAAOllB,KAAI9G,GAAQA,EAAKra,gBAIvF,MAAM4hB,EAASte,EAAIse,OAAOrB,MAE1B,GAAe,OAAXqB,EACA,MAAM,IAAIllB,MACN,uDAAuD2pC,EAAOllB,KAAI9G,GAAQA,EAAKra,gBAgBvF,MAAO,CAAEugB,MAZiC,CACtC6J,gBAAiBxI,EAAOwI,gBACxB4M,YAAapV,EAAOoV,YACpB+F,YAAanb,EAAOmb,YACpB9F,gBAAiB,IACVoP,EAAOllB,KAAI,EAAG2V,WAAYA,OAC1BmK,EAAa9f,KAAI,EAAG2V,WAAYA,KAEvCC,YAAanV,EAAOmV,YACpBkG,MAAOrb,EAAOqb,MACdD,OAAQpb,EAAOob,QAEH7Q,QAAS7oB,EAAIse,OAAOuK,QACvC,QCtkFQ0c,GACFzqC,MACAmiB,MACAkc,UAEP,WAAAx/B,CAAYmB,EAAemiB,EAAWkc,GAClCl/B,KAAKa,MAAQA,EACbb,KAAKgjB,MAAQA,EACbhjB,KAAKk/B,UAAYA,CACpB,CAEM,MAAAlZ,CAAOulB,GACV,OAAOvrC,KAAKgjB,MAAM1P,GAAGi4B,EAAMvoB,MAC9B,CAEM,SAAAwoB,CAAUD,GACb,OAAOvrC,KAAKgjB,MAAM1gB,IAAIipC,EAAMvoB,MAC/B,CAEM,IAAAlG,CAAK+nB,EAAsB4G,GAC9B,IAMI,OALa5G,EAAU6G,aAAa,CAChC5vB,GAAG9b,KAAKgjB,MAAMngB,QAAQ,KAAM,KAAKJ,WACjCqZ,GAAG9b,KAAKk/B,WAAWz8B,WACnBqZ,GAAG2vB,EAAU5oC,QAAQ,KAAM,KAAKJ,YAGvC,CAAC,MAAO26B,GACL,MAAM,IAAIj+B,MAAM,iBACnB,CACJ,QAGQwsC,GACFC,cACAC,WACAC,oBAEP,WAAApsC,CACIksC,EACAC,EACAC,GAEA9rC,KAAK4rC,cAAgBA,EACrB5rC,KAAK6rC,WAAaA,EAClB7rC,KAAK8rC,oBAAsBA,CAC9B,QAOQC,GACFC,SACAC,iBACAC,oBAEP,WAAAxsC,CACIssC,EACAC,EACAC,GAEAlsC,KAAKgsC,SAAWA,EAChBhsC,KAAKisC,iBAAmBA,EACxBjsC,KAAKksC,oBAAsBA,CAC9B,CAEM,cAAO,GACV,OAAO,IAAIH,GAAa,CAAC,IAAIT,GAAe,EAAGxvB,GAAG,GAAI,IAAK,EAAG,EACjE,CAEM,GAAAwX,CAAIzyB,GACP,OAAOb,KAAKgsC,SAASnrC,EACxB,CAEM,MAAAV,GACH,OAAO6c,OAAOhd,KAAKisC,iBACtB,CAEM,OAAAE,GACH,OAAiC,IAA1BnsC,KAAKisC,gBACf,CAEM,WAAAG,CAAYppB,GACf,OAAOhjB,KAAKgsC,SACP1lB,MAAM,EAAGtmB,KAAKG,SAAW,GACzBksC,MAAKC,GAAQA,EAAKtpB,QAAUA,GACpC,CAEM,IAAAupB,GACH,IACI,MAAMC,EAAa50B,EACnB,OAAO5X,KAAKysC,OAAOD,EACtB,CAAC,MAAOpP,GACL,MAAM,IAAIj+B,MAAM,sCAAsCi+B,IACzD,CACJ,CAOM,mBAAAsP,CAAoB1pB,GAEvB,IAAK,IAAIphB,EAAI,EAAGA,GAAK5B,KAAKG,SAAUyB,IAAK,CACrC,MAAM0qC,EAAOtsC,KAAKgsC,SAASpqC,GAC3B,GACI5B,KAAKgsC,SAASM,EAAKpN,WAAWlc,MAAMlQ,GAAGkQ,IACvCspB,EAAKtpB,MAAM9P,GAAG8P,GAEd,OAAOphB,EACJ,GAAI0qC,EAAKtpB,MAAM1P,GAAG0P,GACrB,MAAM,IAAI7jB,MAAM,sCAEvB,CAGD,OAAOa,KAAKksC,mBACf,CAOM,cAAAS,CACH3pB,GAEA,MAAM4pB,EAAkB5sC,KAAK0sC,oBAAoB1pB,GACjD,QAAwBvM,IAApBm2B,EAA+B,MAAO,MAACn2B,OAAWA,GACtD,MAAMo2B,EAAa7sC,KAAKgsC,SAASY,GACjC,MAAO,CAACC,EAAY7sC,KAAKgsC,SAASa,EAAW3N,WAAWlc,MAC3D,CAyBM,WAAA8pB,CACHjI,EACAhkC,GAEA,MAAMksC,EAAU/sC,KAAKgsC,SAASnrC,GAC9B,IAAKksC,EAAS,OACd,MAAMC,EAAchtC,KAAKgsC,SAASe,EAAQ7N,WAC1C,OAAK8N,EAEQnI,EAAU6G,aAAa,CAChC5vB,GAAGixB,EAAQ/pB,MAAMngB,QAAQ,KAAM,KAAKJ,WACpCqZ,GAAGixB,EAAQ7N,WAAWz8B,WACtBqZ,GAAGkxB,EAAYhqB,MAAMngB,QAAQ,KAAM,KAAKJ,kBAL5C,CASH,CAQM,MAAAgqC,CAAOzpB,GACV,MAAM4pB,EAAkB5sC,KAAK0sC,oBAAoB1pB,GACjD,QAAwBvM,IAApBm2B,EACA,MAAM,IAAIztC,MAAM,gCAEpB,OAAOa,KAAKitC,0BAA0BL,EAAiB5pB,EAC1D,CASM,yBAAAiqB,CACHL,EACA5pB,GAEA,MAAM6pB,EAAa7sC,KAAKgsC,SAASY,GAEjC,GAA6B,IAAzBC,EAAW3N,WACX,GAAIlc,EAAM5P,IAAIy5B,EAAW7pB,OACrB,MAAM,IAAI7jB,MACN,qEAGL,CACH,MAAM6tC,EAAchtC,KAAKgsC,SAASa,EAAW3N,WAE7C,GAAIlc,EAAM5P,IAAIy5B,EAAW7pB,OACrB,MAAM,IAAI7jB,MACN,iEAIR,GAAI6jB,EAAMhQ,IAAIg6B,EAAYhqB,OACtB,MAAM,IAAI7jB,MACN,8DAGX,CAED,MAAM+tC,EAAmBltC,KAAKmtC,8BAC1BP,EACA5pB,GAsBJ,OAX6B,IAAzB6pB,EAAW3N,YACXl/B,KAAKksC,oBAAsBgB,EAAiBrB,WAAWhrC,OAI3Db,KAAKisC,iBAAmBiB,EAAiBrB,WAAWhrC,MACpDb,KAAKgsC,SAAShsC,KAAKG,UAAY+sC,EAAiBrB,WAGhD7rC,KAAKgsC,SAASY,GAAmBM,EAAiBtB,cAE3CsB,CACV,CAMM,MAAAE,GACH,OAAOptC,KAAKgsC,SAAS7rC,OAAS,EAAIH,KAAKgsC,SAAS,QAAKv1B,CACxD,CAQM,6BAAA02B,CACHP,EACA5pB,GAEA,MAAM4oB,EAAgB5rC,KAAKgsC,SAASY,GAE9BS,EAAkBrtC,KAAKisC,iBAAmB,EAC1CJ,EAAa,IAAIP,GACnB+B,EACArqB,EACA4oB,EAAc1M,WAElB0M,EAAc1M,UAAYmO,EAE1B,MAAMvB,EAAsB9rC,KAAKgsC,SAASH,EAAW3M,WAAWlc,MAEhE,OAAO,IAAI2oB,GACPC,EACAC,EACAC,EAEP,CAOM,UAAAD,CAAW7oB,GACd,MAAM4pB,EAAkB5sC,KAAK0sC,oBAAoB1pB,GACjD,QAAwBvM,IAApBm2B,EACA,MAAM,IAAIztC,MAAM,gCAEpB,OAAOa,KAAKmtC,8BAA8BP,EAAiB5pB,EAC9D,EChTE,MAAMsqB,GAAe,UAUfC,GASTC,OACAC,SACAC,YACAC,OACAC,QACAC,WAEA,WAAAnuC,CACI8tC,EACA3I,EACAmH,EAAqB,IACrB0B,YAAEA,EA9BkB,KA8Ba,IAMjC,GAJA1tC,KAAKwtC,OAASA,EACdxtC,KAAKytC,SAAW,GAAKD,EACrBxtC,KAAK0tC,YAAcA,EACnB1tC,KAAK6tC,WAAahJ,EACdmH,EAAS7rC,OAASH,KAAKytC,SACvB,MAAM,IAAItuC,MAAM,gBAEpBa,KAAK2tC,OAAS,GACd3tC,KAAK4tC,QAAU,GACf5tC,KAAK4tC,QAAQ,GAAK5B,EAClBhsC,KAAK2tC,OAAO,GAAK3tC,KAAK0tC,YAEtB,IAAK,IAAI9rC,EAAI,EAAGA,GAAK4rC,EAAQ5rC,IACzB5B,KAAK2tC,OAAO/rC,GAAK5B,KAAK6tC,WAAWC,mBAAmB,CAChD9tC,KAAK2tC,OAAO/rC,EAAI,GAChB5B,KAAK2tC,OAAO/rC,EAAI,KAGxB5B,KAAK+tC,UACR,CAED,QAAAA,GACI,IAAK,IAAIC,EAAQ,EAAGA,GAAShuC,KAAKwtC,OAAQQ,IAAS,CAC/ChuC,KAAK4tC,QAAQI,GAAS,GACtB,IACI,IAAIpsC,EAAI,EACRA,EAAIF,KAAKoB,KAAK9C,KAAK4tC,QAAQI,EAAQ,GAAG7tC,OAAS,GAC/CyB,IAEA5B,KAAK4tC,QAAQI,GAAOpsC,GAAK5B,KAAK6tC,WAAWC,mBAAmB,CACxD9tC,KAAK4tC,QAAQI,EAAQ,GAAO,EAAJpsC,GACpB,EAAJA,EAAQ,EAAI5B,KAAK4tC,QAAQI,EAAQ,GAAG7tC,OAC9BH,KAAK4tC,QAAQI,EAAQ,GAAO,EAAJpsC,EAAQ,GAChC5B,KAAK2tC,OAAOK,EAAQ,IAGrC,CACJ,CAMD,IAAAhP,GACI,OAAOh/B,KAAK4tC,QAAQ5tC,KAAKwtC,QAAQrtC,OAAS,EACpCH,KAAK4tC,QAAQ5tC,KAAKwtC,QAAQ,GAC1BxtC,KAAK2tC,OAAO3tC,KAAKwtC,OAC1B,CAOD,MAAAS,CAAOlB,GACH,GAAI/sC,KAAK4tC,QAAQ,GAAGztC,QAAUH,KAAKytC,SAC/B,MAAM,IAAItuC,MAAM,gBAEpBa,KAAKwhB,OAAOxhB,KAAK4tC,QAAQ,GAAGztC,OAAQ4sC,EACvC,CAMD,UAAAmB,CAAWlC,GACP,GAAIhsC,KAAK4tC,QAAQ,GAAGztC,OAAS6rC,EAAS7rC,OAASH,KAAKytC,SAChD,MAAM,IAAItuC,MAAM,gBAEpBa,KAAK4tC,QAAQ,GAAGpuB,QAAQwsB,GACxBhsC,KAAK+tC,UACR,CAQD,MAAAvsB,CAAO3gB,EAAeksC,GAElB,GACIoB,MAAMnxB,OAAOnc,KACbA,EAAQ,GACRA,EAAQb,KAAK4tC,QAAQ,GAAGztC,QACxBU,GAASb,KAAKytC,SAEd,MAAM,IAAItuC,MAAM,+BAAiC0B,GAErDb,KAAK4tC,QAAQ,GAAG/sC,GAASksC,EACzB,IAAK,IAAIiB,EAAQ,EAAGA,GAAShuC,KAAKwtC,OAAQQ,IACtCntC,IAAU,EACVb,KAAK4tC,QAAQI,GAAOntC,GAASb,KAAK6tC,WAAWC,mBAAmB,CAC5D9tC,KAAK4tC,QAAQI,EAAQ,GAAW,EAARntC,GAChB,EAARA,EAAY,EAAIb,KAAK4tC,QAAQI,EAAQ,GAAG7tC,OAClCH,KAAK4tC,QAAQI,EAAQ,GAAW,EAARntC,EAAY,GACpCb,KAAK2tC,OAAOK,EAAQ,IAGrC,CAOD,IAAAI,CAAKvtC,GACD,GACIstC,MAAMnxB,OAAOnc,KACbA,EAAQ,GACRA,GAASb,KAAK4tC,QAAQ,GAAGztC,OAEzB,MAAM,IAAIhB,MAAM,wBAA0B0B,GAE9C,MAAMmjC,EAAyB,GACzBqK,EAAwB,GAC9B,IAAK,IAAIL,EAAQ,EAAGA,EAAQhuC,KAAKwtC,OAAQQ,IACrCK,EAAYL,GAASntC,EAAQ,EAC7BmjC,EAAagK,IACA,EAARntC,GAAab,KAAK4tC,QAAQI,GAAO7tC,OAC5BH,KAAK4tC,QAAQI,GAAe,EAARntC,GACpBb,KAAK2tC,OAAOK,GACtBntC,IAAU,EAEd,MAAO,CACHmjC,eACAqK,cAEP,CAQD,OAAAtM,CACIgL,EACAuB,EAAgE,MAEhE,OAAIA,EACOtuC,KAAK4tC,QAAQ,GAAG9nB,WAAWyoB,GAC9BD,EAAWvB,EAASwB,KAGjBvuC,KAAK4tC,QAAQ,GAAG7L,QAAQgL,EAEtC,CAMD,QAAAf,GACI,OAAOhsC,KAAK4tC,QAAQ,GAAGtnB,OAC1B,CAOD,SAAAkoB,GACI,MAAO,CACHhB,OAAQxtC,KAAKwtC,OACbG,OAAQ3tC,KAAK2tC,OACbC,QAAS5tC,KAAK4tC,QAErB,CAWD,kBAAOa,CACHjyB,EACAkyB,GAEA,MAAMpxB,EAAW4G,OAAOyqB,OAAOzqB,OAAO1B,OAAOxiB,KAAKP,WAAY+c,GAI9D,OAHAc,EAASsxB,MAAQF,EACjBpxB,EAASmwB,SAAW,GAAKnwB,EAASkwB,OAClClwB,EAASowB,YAAcpwB,EAASqwB,OAAO,GAChCrwB,CACV,EC5ME2H,eAAe4pB,GAClBzgB,GAEA,MAAMvW,YAAEA,EAAWE,0BAAEA,GACjBO,IAGEovB,SACItZ,EAAI0Z,kCACN/vB,OACAtB,EACA,cAENmN,KAAI/U,GAAKA,EAAE2a,YAOPslB,SANY1gB,EAAI2gB,sBAAsBrH,EAAY,CACpDsH,+BAAgC,EAChC51B,WAAY,eAIcihB,QACzBhM,GACQA,EAGeA,EAAGyS,YAAYxD,QAAQ2R,YAELC,MACjCprB,IAEuB,iBAATA,EACDA,EACAA,EAAK4C,OAAO+a,cACH5pB,EAAY4pB,aAV5B,IAwBnB,OALqB0N,GACjBL,EACAM,GAIR,OAEaD,GAAc,CACvBE,EACAC,KAEA,MAAMz3B,YAAEA,GAAgBS,IAElBi3B,EAAiC,GAmCvC,OAlCAF,EAA0BxrB,SAAQwK,KAEzBA,IACAA,EAAGmhB,MACJnhB,EAAGmhB,KAAKC,MACPphB,EAAGmhB,KAAKE,mBACTrhB,EAAGmhB,KAAKE,kBAAkBvvC,QAAU,GAOxCkuB,EAAGmhB,KAAKE,kBAAkB7rB,SAAQoV,IAC9B,GAAIA,EAAGvL,aAAavtB,OAAS,EAAG,CAC5B,MAAMwvC,EAAU1W,EAAGvL,aAAauL,EAAGvL,aAAavtB,OAAS,GAEzD,GACI,SAAUwvC,GACVA,EAAQnzB,MACRmzB,EAAQxnB,UAAUsZ,aAAe5pB,EAAY4pB,WAC/C,CACE,MAAMjlB,EAAOR,EAAKH,OAAO8zB,EAAQnzB,MAE3BozB,EAAeN,EAAchvC,OAAO8X,KAAKoE,GAAO6R,GAElDuhB,SACAL,EAAa/vB,KAAKowB,EAEzB,CACJ,IACH,IAGCL,CAAY,EAIVH,GACT5yB,IAEA,MAAMqzB,EAAcvvC,OAAO8X,KAAKoE,EAAKoH,KAAI2I,GAAQA,KAEjD,IACI,OAAO4K,GAA6B0Y,EACvC,CAAC,MAAOzS,GAEL,OAAO,IACV,GCrGEnY,eAAe6qB,GAClB1hB,EACAtR,GAGA,aAD8BizB,GAA6B3hB,IACpCie,MAAKj7B,GAAO0K,GAAG1K,EAAI0L,MAAMxJ,GAAGwJ,IACvD,CAaAmI,eAAe8qB,GAA6B3hB,GACxC,MAAM4hB,SAAgBnB,GAAgBzgB,IAAMrJ,UACtCkrB,EAA0D,GAC1DC,EAA8B,GAEpC,IAAK,MAAMC,KAASH,EAAQ,CACxB,IACI,IAAInvC,EAAQ,EACZA,EAAQsvC,EAAMnpB,yBAAyB7mB,OACvCU,IACF,CACE,MAAM4lB,EAAU0pB,EAAMnpB,yBAAyBnmB,GACzC8b,EAA+B,CACjC9D,WAAYH,IAA+BG,WAC3CF,eAAgBD,IAA+BC,eAC/CmE,KAAMqzB,EAAMC,8BAA8BvvC,GAC1Ckc,UAAWozB,EAAME,kBAAkBxvC,IAEjCyvC,EACF5zB,GACIC,EACA8J,EAAQa,kBAAkBhL,MAC1BmK,EAAQa,kBAAkB/K,SAC1BkK,EAAQa,kBAAkB9K,WAAQ/F,EAClCgQ,EAAQa,kBAAkB7K,cAAWhG,GAE7Cw5B,EAAkBzwB,KAAK8wB,EAC1B,CACD,IACI,IAAIzvC,EAAQ,EACZA,EAAQsvC,EAAMI,6BAA6BpwC,OAC3CU,IACF,CACE,MAAMic,EAAOqzB,EAAMI,6BAA6B1vC,GAChDqvC,EAAsB1wB,KAAK1D,GAAGgB,GACjC,CACJ,CAED,MAAM0zB,EAAkBP,EAAkB5V,QACtC5T,IACKypB,EAAsBhB,MAAKpyB,GAAQA,EAAKxJ,GAAGwI,GAAG2K,EAAQ3J,WAI/D,OAFA0zB,EAAgBxX,MAAK,CAACt0B,EAAGlD,IAAMA,EAAEub,UAAYrY,EAAEqY,YAExCyzB,CACX,CC/DA,MAAMC,GAA4B,IAAIx4B,EAClC,+CAaSy4B,GAAqCre,GAAAA,OAAO,CACrDjD,GAAAA,UAAU,QACVA,GAAAA,UAAU,SACVgD,GAAAA,IAAI,UACJL,UAAO3C,GAAAA,YAAa,YACpByD,GAAAA,GAAG,SACHd,UAAOJ,GAAAA,QAAS,kBAYJgf,GACZrpB,EACAa,EAAuBsoB,IAEvB,GAA+B,OAA3BnpB,EAAkB9K,KAAe,OAAO,KAE5C,MAAMA,KAAEA,GAAS8K,EAAkB9K,KAEnC,GAAoB,IAAhBA,EAAKrc,OAAc,OAAO,KAC9B,GAAImnB,EAAkBhL,MAAMmlB,aAAetZ,EAAUsZ,WACjD,MAAM,IAAItiC,MACN,iBAAiBmoB,EAAkBhL,MAAMmlB,+BAGjD,OAAOiP,GAAgB70B,OAAOvb,OAAO8X,KAAKoE,GAC9C,CAgEOyI,eAAe2rB,GAClBZ,GAEA,MAAMa,QACIrhB,QAAQshB,IACVd,EAAOpsB,KAAIusB,GA9DvBlrB,eACIkrB,GAEA,MAAMY,EAAcZ,EAAMY,YAEpBC,EAAeb,EAAMC,8BACrBa,EACFd,EAAMnpB,yBAAyBpD,KAAI,CAAC0D,EAAmB1lB,KACnD,MAAM+a,EAA+B,CACjC9D,WACIk4B,EACIZ,EAAMnpB,yBAAyBplB,GAAG8lB,iBAE1C/O,eAEID,IAA+BC,eACnCmE,KAAMk0B,EAAapvC,GACnBmb,UAAWozB,EAAME,kBAAkBzuC,IAGvC,IAAK0lB,EAAkBA,kBAAkB9K,KACrC,MAAM,IAAIrd,MAAM,WAEpB,MAAM+xC,EAAaP,GACfrpB,EAAkBA,mBAGtB,IAAK4pB,EAAY,MAAM,IAAI/xC,MAAM,sBASjC,MAAO,CACHmoB,kBARsB5K,GACtBC,EACA2K,EAAkBA,kBAAkBhL,MACpCgL,EAAkBA,kBAAkB/K,SACpC+K,EAAkBA,kBAAkB9K,KACpC8K,EAAkBA,kBAAkB7K,cAAWhG,GAI/CqrB,OAAQoP,EACX,IAGT,MAAO,CACHX,6BAA8BJ,EAAMI,6BACpCvpB,yBAA0BiqB,EAElC,CAgBgCE,CAA2BhB,MAKjDiB,EAA2BP,EAA6BQ,SAC1DlB,GAASA,EAAMnpB,2BAEbsqB,EAA+BT,EAA6BQ,SAC9DlB,GAASA,EAAMI,+BAcnB,OAZkCa,EAAyB/W,QACvD3B,IACK4Y,EAA6BpC,MAAKpyB,GAE3BimB,KAAKC,UAAUlmB,KACfimB,KAAKC,UACDtK,EAAwBpR,kBAAkBxK,SAOlE,CAGOmI,eAAessB,GAClBnjB,EACA9R,EACA2hB,GAEA,MAAM+R,QAAenB,GAAgBzgB,GAOrC,MAAO,CACHzK,aANkCitB,GAA2BZ,IAExB3V,QACrCjpB,GAAOA,EAAI0wB,OAAOxlB,MAAM0J,OAAO1J,IAAUlL,EAAI0wB,OAAO7D,KAAKjY,OAAOiY,KAGhDjF,MACZ,CAACt0B,EAAGlD,IACAA,EAAE8lB,kBAAkBvK,UAAYrY,EAAE4iB,kBAAkBvK,YAE5Dud,OAAQ,KAEhB,CAEOrV,eAAeusB,GAClBpjB,EACA+P,EACAF,GAEA,MAAM+R,QAAenB,GAAgBzgB,GAGrC,MAAO,CACHzK,aAFkCitB,GAA2BZ,IAE9B3V,QAC3BjpB,GACIA,EAAI0wB,OAAO3D,UAAUnY,OAAOmY,IAC5B/sB,EAAI0wB,OAAO7D,KAAKjY,OAAOiY,KAE/B3D,OAAQ,KAEhB,CAEOrV,eAAewsB,GAClBrjB,EACAtR,GAEA,MAAMkzB,QAAenB,GAAgBzgB,GAI/BsjB,SAFgCd,GAA2BZ,IAExB3V,QAAOjpB,GAC5C0K,GAAG1K,EAAIkW,kBAAkBxK,MAAMxJ,GAAGwJ,KAEtC,GAAwB,IAApB40B,EAASvxC,OACT,MAAM,IAAIhB,MAAM,+BAEpB,OAAOuyC,EAAS,EACpB,CCVOzsB,eAAe0sB,GAClB9M,EACAzD,EAAmB,wBACnBI,EAAiC,wBACjCgB,EAAyB,wBACzBoP,EACAC,EACAC,EACAt3B,EAAM,GAEN,MAAMu3B,EAAkBr5B,IAExB,OAAO,IAAIs5B,GACP5Q,EACAyD,EACArD,EACAgB,OACA/rB,EACA,CACIm7B,kBAAmBA,GAAqBG,EAAgBl5B,WACxDg5B,sBACIA,GAAyBE,EAAgBp5B,eAC7Cm5B,MAAOA,GAASC,EAAgBh5B,iBAChCyB,OAGZ,CAUM,MAAOw3B,WAAgB5hB,EACzBjH,WACAqY,uBACAgB,eACAoP,kBACAC,sBACAI,mBACAC,oBACArN,UACAiN,MACAt3B,IAAM,EAcN,WAAA9a,CACI0hC,EACA3d,EACA+d,EACAgB,EACA2P,EACAC,GAEA7xB,MAAM6gB,EAAU+Q,GAAoB,aAEpCnyC,KAAKmpB,WAAa,IAAIiH,EAClBgR,EACA+Q,GAAoB,aAExBnyC,KAAKwhC,uBAAyBA,EAC9BxhC,KAAKwiC,eAAiBA,EAEtB,MAAMoP,kBACFA,EAAiBC,sBACjBA,EAAqBC,MACrBA,EAAKt3B,IACLA,EAAGy3B,mBACHA,EAAkBC,oBAClBA,GACAE,GAAiB,IAEfv5B,WACFA,EAAUF,eACVA,EAAcI,iBACdA,EAAgBG,aAChBA,EAAYD,YACZA,GACAP,IAEJ1Y,KAAK6kC,UAAYphB,EACjBzjB,KAAK4xC,kBAAoBA,GAAqB/4B,EAC9C7Y,KAAK6xC,sBAAwBA,GAAyBl5B,EACtD3Y,KAAKiyC,mBAAqBA,GAAsBh5B,EAChDjZ,KAAKkyC,oBAAsBA,GAAuBh5B,EAClDlZ,KAAK8xC,MAAQA,GAAS/4B,EACtB/Y,KAAKwa,IAAMA,GAAO,CACrB,CA0yBD,0BAAMiuB,CACFhsB,EACAK,GAEA,GAAIL,EACA,MAAM,IAAItd,MAAM,wCAEpB,IAAK2d,EACD,MAAM,IAAI3d,MAAM,oBAIpB,aADsB2wC,GAA+B9vC,KAAM8c,IACzC,IACrB,CAKD,0BAAM4rB,CAAqBjsB,EAAiBK,GACxC,GAAIL,EACA,MAAM,IAAItd,MAAM,wCAEpB,IAAK2d,EACD,MAAM,IAAI3d,MAAM,oBAGpB,MAAMsnB,QAAgBqpB,GAA+B9vC,KAAM8c,GAC3D,IAAK2J,EACD,MAAM,IAAItnB,MAAM,qBAEpB,OAAO2c,GAAG2K,EAAQlK,SACrB,CAKD,iCAAMosB,CAA4BrsB,GAE9B,aADuBtc,KAAK45B,6BAA6Btd,IACzCqH,MAAMS,QAClB,CAAChT,EAAKqV,IAAYrV,EAAIzI,IAAI8d,EAAQlK,WAClCT,GAAG,GAEV,CAMD,+BAAM8sB,CACF9rB,GAGA,aADqB9c,KAAKgpC,mCAAmC,CAAClsB,KAChD,EACjB,CAMD,mCAAM+rB,CACFC,GAGA,aFloCD7jB,eACHmJ,EACA0a,GAGA,aAD8BiH,GAA6B3hB,IAEtDiM,QAAOjpB,GAAO03B,EAAOoG,MAAKpyB,GAAQhB,GAAG1K,EAAI0L,MAAMxJ,GAAGwJ,OAClDkc,MAAK,CAACt0B,EAAGlD,IAAMA,EAAEub,UAAYrY,EAAEqY,WACxC,CE0nCqBs1B,CAAwCryC,KAAM8oC,EAC9D,CAID,+BAAMja,CAA0ByjB,GAC5B,OAAO,CACV,CAKD,wCAAMtJ,CACFF,GAGA,MAAMkH,QAAyCnB,GAE3C7uC,MACFuyC,MAAKvC,GAAUA,EAAOjrB,YAClBytB,EAAwB,GACxBC,EAA2B,GACjC,IAAK,MAAMtC,KAASH,EAChB,IACI,IAAInvC,EAAQ,EACZA,EAAQsvC,EAAMnpB,yBAAyB7mB,OACvCU,IACF,CACE,MAAMic,EAAOqzB,EAAMC,8BAA8BvvC,GAEjD2xC,EAAUhzB,KAAK1C,GACf21B,EAAejzB,KAAK2wB,EAAME,kBAAkBxvC,GAC/C,CAEL,MAAMy4B,EAAO,IAAIiU,GACbvtC,KAAK8xC,MACL9xC,KAAK6kC,UACL2N,EAAU5uB,KAAIugB,GAAQroB,GAAGqoB,GAAM1hC,cAI7BwmC,EAA+C,GAErD,IAAK,IAAIrnC,EAAI,EAAGA,EAAIknC,EAAO3oC,OAAQyB,IAAK,CACpC,MAAMmb,EAAYuc,EAAKyI,QAAQ+G,EAAOlnC,GAAGa,YAEnCiwC,EADepZ,EAAK8U,KAAKrxB,GAAWinB,aACNpgB,KAAIZ,GAASlH,GAAGkH,KAC9Cgc,EAAOljB,GAAGwd,EAAK0F,QACfiF,EAA4C,CAC9CnnB,KAAMgsB,EAAOlnC,GAAGiB,QAAQ,KAAM,IAC9BgW,WAAY7Y,KAAK4xC,kBACjB70B,UAAWA,EACXknB,YAAayO,EACb/5B,eAAgB3Y,KAAK6xC,sBACrBrqB,UAAWgrB,EAAUryC,OACrB6+B,KAAMA,GAEViK,EAAazpB,KAAKykB,EACrB,CAcD,OAXAgF,EAAaplB,SAAQ,CAACqG,EAAOrpB,KACzB,MAAMkc,EAAYmN,EAAMnN,UAClB41B,EAAerZ,EAAK0S,WAAWjvB,GAC/B61B,EAAU92B,GAAG62B,GAAc9vC,QAAQ,KAAM,IAC/C,IAAK+vC,EAAQ5qB,OAAM,CAAC/oB,EAAK4B,IAAU5B,IAAQirB,EAAMpN,KAAKjc,KAClD,MAAM,IAAI1B,MACN,qBAAqB0B,eAAmBqpB,EAAMpN,KAAKra,mBAAmBmwC,EAAQnwC,aAErF,IAGEwmC,CACV,CAMD,kCAAMrP,CACFtd,EACAu2B,GAGA,MAAMpc,QFvuCPxR,eACHmJ,EACA9R,GAIA,aAF8ByzB,GAA6B3hB,IAC3BiM,QAAOjpB,GAAOA,EAAIkL,MAAM0J,OAAO1J,IAEnE,CEguC+Bw2B,CAAiC9yC,KAAMsc,GAC9D,MAAO,CACHqH,MAAO8S,EACP6D,OAAQ,KAEf,CAMD,oCAAMiQ,CACFwI,EACAC,GAEA,MAAM,IAAI7zC,MACN,oEAEP,CAKD,kCAAMqrC,CACFwI,GAEA,MAAM,IAAI7zC,MACN,oEAEP,CAKD,uCAAM+pC,CACF5sB,EACA4kB,GAEA,aAAaqQ,GAETvxC,KACAsc,EACA4kB,EAASjD,KAEhB,CAKD,0CAAMkL,CACFhL,EACA+C,GAEA,aAAasQ,GAETxxC,KACAm+B,EACA+C,EAAQjD,KAEf,CAKD,sCAAMmL,CACFtsB,GAGA,MAAM2J,QAAgBgrB,GAAoCzxC,KAAM8c,GAChE,MAAO,CAAEohB,OAAQpiB,GAAG2K,EAAQqb,OAAO5D,QACtC,CAOD,uCAAMmL,CACFja,EACA8R,GAQA,MAAO,CACHvd,aAPmB4tB,GAEnBvxC,KACAovB,EACA8R,EAAQjD,OAGQta,MAAMC,KAAI6C,IAAY,CAClCmB,QAAS9L,GAAG2K,EAAQqb,OAAO5D,QAC3BD,KAAMxX,EAAQqb,OAAO7D,SAEzB3D,OAAQ,KAEf,CAMD,yCAAMiP,CACFna,EACA8R,GAQA,MAAO,CACHtS,QAAS,CAAED,KAAM,GACjB3L,MAAO,CACHW,aATe4tB,GAEnBvxC,KACAovB,EACA8R,EAAQjD,OAKYta,MAAMC,KAAI6C,IAAY,CAClCmB,QAAS9L,GAAG2K,EAAQqb,OAAO5D,QAC3BD,KAAMxX,EAAQqb,OAAO7D,SAEzB3D,OAAQ,MAGnB,CASD,wCAAMmP,CACFmF,GAEA,MAAM,IAAIzvC,MACN,iEAEP,CAMD,uCAAMuqC,CACFuJ,GAEA,MAAM,IAAI9zC,MAAM,uDACnB,CASD,wCAAM4qC,CACFmJ,EACAC,GAEA,MAAM,IAAIh0C,MAAM,2CACnB,CASD,sCAAM6qC,CACFoJ,EACAD,GAEA,MAAM,IAAIh0C,MAAM,wCACnB,CAOD,2CAAM8qC,CACFmJ,EACAD,GAEA,MAAM,IAAIh0C,MAAM,6CACnB,CAKD,sBAAM+qC,GACF,MAAO,IACV,CAKD,oBAAMG,GACF,OAAO,CACV,CAUD,iCAAMI,CAA4BC,GAE9B,MAAM2I,EAAetH,GAAaxa,UAC5B+hB,EAAqB,GAC3BD,EAAa9G,OACb,MAAMzD,EAAe,GAIrB,IAAK,IAAIlnC,EAAI,EAAGA,EAAI0xC,EAAanzC,OAAQyB,IACrCyxC,EAAa5G,OAAO3wB,GAAGw3B,EAAa1xC,KAExC,IAAK,IAAIA,EAAI,EAAGA,EAAIyxC,EAAarH,SAAS7rC,OAAQyB,IAAK,CACnD,MAAMkb,EAAOu2B,EAAavG,YAAY9sC,KAAK6kC,UAAWjjC,GACtDknC,EAAOtpB,KAAK1D,GAAGgB,GAClB,CACD,MAAMwc,EAAO,IAAIiU,GACbvtC,KAAK8xC,MACL9xC,KAAK6kC,UACLiE,EAAOllB,KAAI9G,GAAQhB,GAAGgB,GAAMra,cAI1B0iC,EAAuD,GAE7D,IAAK,IAAIvjC,EAAI,EAAGA,EAAI8oC,EAAUvqC,OAAQyB,IAAK,CACvC,MAAOirC,GAAcwG,EAAa1G,eAAejC,EAAU9oC,IAC3D,IAAKirC,EAAY,MAAM,IAAI1tC,MAAM,qBAEjC,MAAM4d,EAAY8vB,EAAWhsC,MAGvB6xC,EADyBpZ,EAAK8U,KAAKrxB,GAAWinB,aAChBpgB,KAAIZ,GAASlH,GAAGkH,KAE9CuwB,EAAmBF,EAAa/f,IAClCuZ,EAAW3N,WACZlc,MAGGkH,EAA0C,CAC5C8U,KAHSljB,GAAGwd,EAAK0F,QAIjBxX,UAAW,EACXxE,MAAO0nB,EAAU9oC,GACjB4iC,oBAAqBqI,EAAW7pB,MAChCyhB,qBAAsB8O,EACtBrU,UAAWpjB,GAAG+wB,EAAW3N,WACzBqF,oCAAqCmO,EACrCpO,8BAA+BxoB,GAAG+wB,EAAWhsC,OAC7CgY,WAAY7Y,KAAKiyC,mBACjBt5B,eAAgB3Y,KAAKkyC,qBAEzB/M,EAAiB3lB,KAAK0K,EACzB,CACD,OAAOib,CACV,CAED,mCAAMmF,CACFkJ,EACAL,GAEA,MAAM,IAAIh0C,MACN,4DAEP,CAWD,4BAAMyrC,CACF9B,EAAkB,GAClBpF,EAAwB,IAExB,OAAO1jC,KAAK85B,iBAAiBgP,EAAQpF,EACxC,CAKD,mCAAM0H,CACFtC,EAAyB,GACzBpF,EAAkC,IAElC,GAAIA,EAAawL,MAAKzyB,KAAaA,aAAmB9c,KAClD,MAAM,IAAIR,MAAM,gDAEpB,MAAO,CACH6jB,YAAahjB,KAAKq5B,mBAAmByP,EAAQpF,GAC7C9U,QAAS,CAAED,KAAM,GAExB,CAeD,sBAAMmL,CACFgP,EAAkB,GAClBpF,EAAwB,IAExB,GAAIA,EAAawL,MAAKzyB,KAAaA,aAAmB9c,KAClD,MAAM,IAAIR,MAAM,gDAEpB,IAAI2tB,EAEJ,GAAsB,IAAlBgc,EAAO3oC,QAAwC,IAAxBujC,EAAavjC,OACpC,MAAM,IAAIhB,MACN,qDAED,GAAI2pC,EAAO3oC,OAAS,GAA6B,IAAxBujC,EAAavjC,OAAc,CAEvD,MAAM0jC,QACI7jC,KAAKgpC,mCAAmCF,GAC5ChF,EAASF,GACXC,GAkBJ/W,EAAgB,CACZD,sBAR0ByW,GAC1BtjC,KAAKwiC,eACL,YACAsB,EACA9jC,KAAKwa,KAKLklB,MAAOmE,EAAwBjgB,KAAIsG,GAASA,EAAM8U,OAClDxF,YAAaqK,EAAwBjgB,KACjCsG,GAASA,EAAM1C,YAEnBgY,YAAaqE,EAAwBjgB,KACjCsG,GAASA,EAAMnN,YAEnB0iB,OAAQoE,EAAwBjgB,KAAIsG,GAASpO,GAAGoO,EAAMpN,QACtD2c,YAAaoK,EAAwBjgB,KACjCsG,GAASA,EAAMrR,aAEnB6gB,gBAAiBmK,EAAwBjgB,KACrCsG,GAASA,EAAMvR,iBAG1B,MAAM,GAAsB,IAAlBmwB,EAAO3oC,QAAgBujC,EAAavjC,OAAS,EAAG,CAEvD,MAAMglC,QACInlC,KAAKyqC,4BAA4B/G,GAErCI,EACFM,GAA0Ce,GAe9CrY,EAAgB,CACZD,sBAT0ByW,GAC1BtjC,KAAKwiC,eACL,cACAsB,EACA9jC,KAAKwa,KAMLklB,MAAOyF,EAAiBvhB,KAAIsG,GAASA,EAAM8U,OAI3CxF,YAAa2L,EAAiBvhB,KAAIoG,IAAK,IACvCwV,YAAa2F,EAAiBvhB,KAC1BsG,GAASA,EAAMoa,8BAA8B/+B,aAEjDk6B,OAAQ0F,EAAiBvhB,KAAIsG,GAASpO,GAAGoO,EAAMlH,SAC/CyW,YAAa0L,EAAiBvhB,KAAIsG,GAASA,EAAMrR,aACjD6gB,gBAAiByL,EAAiBvhB,KAC9BsG,GAASA,EAAMvR,iBAG1B,KAAM,MAAImwB,EAAO3oC,OAAS,GAAKujC,EAAavjC,OAAS,GAyD/C,MAAM,IAAIhB,MAAM,iBAzDkC,CAErD,MAAM0kC,QACI7jC,KAAKgpC,mCAAmCF,GAC5ChF,EAASF,GACXC,GAEEsB,QACInlC,KAAKyqC,4BAA4B/G,GAErCmH,EACFzG,GAA0Ce,GAe9CrY,EAAgB,CACZD,sBAT0ByW,GAC1BtjC,KAAKwiC,eACL,WACA,CAACsB,EAAQ+G,GACT7qC,KAAKwa,KAMLklB,MAAOmE,EACFjgB,KAAIsG,GAASA,EAAM8U,OACnBzb,OAAO4hB,EAAiBvhB,KAAIsG,GAASA,EAAM8U,QAChDxF,YAAaqK,EACRjgB,KAAIsG,GAASA,EAAM1C,YAInBjE,OAAO4hB,EAAiBvhB,KAAIoG,IAAK,KACtCwV,YAAaqE,EACRjgB,KAAIsG,GAASA,EAAMnN,YACnBwG,OACG4hB,EAAiBvhB,KACbsG,GACIA,EAAMoa,8BAA8B/+B,cAGpDk6B,OAAQoE,EACHjgB,KAAIsG,GAASpO,GAAGoO,EAAMpN,QACtByG,OAAO4hB,EAAiBvhB,KAAIsG,GAASpO,GAAGoO,EAAMlH,UACnDyW,YAAaoK,EACRjgB,KAAIsG,GAASA,EAAMrR,aACnB0K,OAAO4hB,EAAiBvhB,KAAIsG,GAASA,EAAMrR,cAChD6gB,gBAAiBmK,EACZjgB,KAAIsG,GAASA,EAAMvR,iBACnB4K,OACG4hB,EAAiBvhB,KAAIsG,GAASA,EAAMvR,kBAGnD,CAAsC,CAEvC,OAAOmU,CACV,CAED,wBAAMuM,CACFyP,EAAyB,GACzBpF,EAAkC,IAGlC,OAAO1jC,KAAK85B,iBACRgP,EAAOllB,KAAI9G,GAAQA,EAAKA,OACxB4mB,EAAa9f,KAAInH,GAAWA,EAAQA,UAE3C","x_google_ignoreList":[0,2,3,6,7,8,9,21]}