@protontech/openpgp 6.0.0-alpha.0 → 6.0.0-alpha.1.patch.0

package/dist/lightweight/bn.min.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"bn.min.mjs","sources":["../../node_modules/bn.js/lib/bn.js"],"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    Buffer = require('buffer').Buffer;\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    }\n\n    if (base === 16) {\n      this._parseHex(number, start);\n    } else {\n      this._parseBase(number, base, start);\n    }\n\n    if (number[0] === '-') {\n      this.negative = 1;\n    }\n\n    this.strip();\n\n    if (endian !== 'le') return;\n\n    this._initArray(this.toArray(), base, endian);\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 parseHex (str, start, end) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r <<= 4;\n\n      // 'a' - 'f'\n      if (c >= 49 && c <= 54) {\n        r |= c - 49 + 0xa;\n\n      // 'A' - 'F'\n      } else if (c >= 17 && c <= 22) {\n        r |= c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r |= c & 0xf;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start) {\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    var j, w;\n    // Scan 24-bit chunks and add them to the number\n    var off = 0;\n    for (i = number.length - 6, j = 0; i >= start; i -= 6) {\n      w = parseHex(number, i, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n      off += 24;\n      if (off >= 26) {\n        off -= 26;\n        j++;\n      }\n    }\n    if (i + 6 !== start) {\n      w = parseHex(number, start, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n    }\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      r.strip();\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n"],"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","require","e","parseHex","str","start","end","r","len","Math","min","i","c","charCodeAt","parseBase","mul","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","strip","toArray","ceil","j","w","off","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","dest","clone","_expand","size","_normSign","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","res","q","andln","iushrn","_countBits","clz32","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","jumboMulTo","FFTM","mulp","x","y","mulTo","hncarry","bigMulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","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","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u"],"mappings":";qOAAA,SAAWA,EAAQC,GAIjB,SAASC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAUE,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,iBAAXxB,EACTA,EAAOC,QAAUY,EAEjBZ,EAAQY,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGY,SAAW,GAGd,IACED,EAASE,QAAQ,UAAUF,MAC5B,CAAC,MAAOG,GACR,CAmID,SAASC,EAAUC,EAAKC,EAAOC,GAG7B,IAFA,IAAIC,EAAI,EACJC,EAAMC,KAAKC,IAAIN,EAAIR,OAAQU,GACtBK,EAAIN,EAAOM,EAAIH,EAAKG,IAAK,CAChC,IAAIC,EAAIR,EAAIS,WAAWF,GAAK,GAE5BJ,IAAM,EAIJA,GADEK,GAAK,IAAMA,GAAK,GACbA,EAAI,GAAK,GAGLA,GAAK,IAAMA,GAAK,GACpBA,EAAI,GAAK,GAIL,GAAJA,CAER,CACD,OAAOL,CACR,CAgCD,SAASO,EAAWV,EAAKC,EAAOC,EAAKS,GAGnC,IAFA,IAAIR,EAAI,EACJC,EAAMC,KAAKC,IAAIN,EAAIR,OAAQU,GACtBK,EAAIN,EAAOM,EAAIH,EAAKG,IAAK,CAChC,IAAIC,EAAIR,EAAIS,WAAWF,GAAK,GAE5BJ,GAAKQ,EAIHR,GADEK,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,CAER,CACD,OAAOL,CACR,CA7MDnB,EAAGI,KAAO,SAAewB,GACvB,OAAIA,aAAe5B,GAIJ,OAAR4B,GAA+B,iBAARA,GAC5BA,EAAI7B,YAAYa,WAAaZ,EAAGY,UAAYiB,MAAMC,QAAQF,EAAIrB,MACpE,EAEEP,EAAG+B,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACX,EAEEjC,EAAGsB,IAAM,SAAcU,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACX,EAEEjC,EAAGF,UAAUY,MAAQ,SAAeT,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAK8B,YAAYlC,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAK+B,WAAWnC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETb,EAAOa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIe,EAAQ,EACM,OAFlBhB,EAASA,EAAOoC,WAAWC,QAAQ,OAAQ,KAEhC,IACTrB,IAGW,KAATf,EACFG,KAAKkC,UAAUtC,EAAQgB,GAEvBZ,KAAKmC,WAAWvC,EAAQC,EAAMe,GAGd,MAAdhB,EAAO,KACTI,KAAKC,SAAW,GAGlBD,KAAKoC,QAEU,OAAXtC,GAEJE,KAAK+B,WAAW/B,KAAKqC,UAAWxC,EAAMC,EAC1C,EAEEH,EAAGF,UAAUqC,YAAc,SAAsBlC,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAW,SAATN,GACfI,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,KAAK+B,WAAW/B,KAAKqC,UAAWxC,EAAMC,EAC1C,EAEEH,EAAGF,UAAUsC,WAAa,SAAqBnC,EAAQC,EAAMC,GAG3D,GADAd,EAAgC,iBAAlBY,EAAOO,QACjBP,EAAOO,QAAU,EAGnB,OAFAH,KAAKE,MAAQ,CAAE,GACfF,KAAKG,OAAS,EACPH,KAGTA,KAAKG,OAASa,KAAKsB,KAAK1C,EAAOO,OAAS,GACxCH,KAAKE,MAAYsB,MAAMxB,KAAKG,QAC5B,IAAK,IAAIe,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAC/BlB,KAAKE,MAAMgB,GAAK,EAGlB,IAAIqB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAX3C,EACF,IAAKoB,EAAItB,EAAOO,OAAS,EAAGoC,EAAI,EAAGrB,GAAK,EAAGA,GAAK,EAC9CsB,EAAI5C,EAAOsB,GAAMtB,EAAOsB,EAAI,IAAM,EAAMtB,EAAOsB,EAAI,IAAM,GACzDlB,KAAKE,MAAMqC,IAAOC,GAAKC,EAAO,SAC9BzC,KAAKE,MAAMqC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXzC,EACT,IAAKoB,EAAI,EAAGqB,EAAI,EAAGrB,EAAItB,EAAOO,OAAQe,GAAK,EACzCsB,EAAI5C,EAAOsB,GAAMtB,EAAOsB,EAAI,IAAM,EAAMtB,EAAOsB,EAAI,IAAM,GACzDlB,KAAKE,MAAMqC,IAAOC,GAAKC,EAAO,SAC9BzC,KAAKE,MAAMqC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAOvC,KAAKoC,OAChB,EA0BEzC,EAAGF,UAAUyC,UAAY,SAAoBtC,EAAQgB,GAEnDZ,KAAKG,OAASa,KAAKsB,MAAM1C,EAAOO,OAASS,GAAS,GAClDZ,KAAKE,MAAYsB,MAAMxB,KAAKG,QAC5B,IAAK,IAAIe,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAC/BlB,KAAKE,MAAMgB,GAAK,EAGlB,IAAIqB,EAAGC,EAEHC,EAAM,EACV,IAAKvB,EAAItB,EAAOO,OAAS,EAAGoC,EAAI,EAAGrB,GAAKN,EAAOM,GAAK,EAClDsB,EAAI9B,EAASd,EAAQsB,EAAGA,EAAI,GAC5BlB,KAAKE,MAAMqC,IAAOC,GAAKC,EAAO,SAE9BzC,KAAKE,MAAMqC,EAAI,IAAMC,IAAO,GAAKC,EAAO,SACxCA,GAAO,KACI,KACTA,GAAO,GACPF,KAGArB,EAAI,IAAMN,IACZ4B,EAAI9B,EAASd,EAAQgB,EAAOM,EAAI,GAChClB,KAAKE,MAAMqC,IAAOC,GAAKC,EAAO,SAC9BzC,KAAKE,MAAMqC,EAAI,IAAMC,IAAO,GAAKC,EAAO,SAE1CzC,KAAKoC,OACT,EA0BEzC,EAAGF,UAAU0C,WAAa,SAAqBvC,EAAQC,EAAMe,GAE3DZ,KAAKE,MAAQ,CAAE,GACfF,KAAKG,OAAS,EAGd,IAAK,IAAIuC,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW9C,EAClE6C,IAEFA,IACAC,EAAWA,EAAU9C,EAAQ,EAO7B,IALA,IAAI+C,EAAQhD,EAAOO,OAASS,EACxBiC,EAAMD,EAAQF,EACd7B,EAAMG,KAAKC,IAAI2B,EAAOA,EAAQC,GAAOjC,EAErCkC,EAAO,EACF5B,EAAIN,EAAOM,EAAIL,EAAKK,GAAKwB,EAChCI,EAAOzB,EAAUzB,EAAQsB,EAAGA,EAAIwB,EAAS7C,GAEzCG,KAAK+C,MAAMJ,GACP3C,KAAKE,MAAM,GAAK4C,EAAO,SACzB9C,KAAKE,MAAM,IAAM4C,EAEjB9C,KAAKgD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOzB,EAAUzB,EAAQsB,EAAGtB,EAAOO,OAAQN,GAEtCqB,EAAI,EAAGA,EAAI2B,EAAK3B,IACnB+B,GAAOpD,EAGTG,KAAK+C,MAAME,GACPjD,KAAKE,MAAM,GAAK4C,EAAO,SACzB9C,KAAKE,MAAM,IAAM4C,EAEjB9C,KAAKgD,OAAOF,EAEf,CACL,EAEEnD,EAAGF,UAAUyD,KAAO,SAAeC,GACjCA,EAAKjD,MAAYsB,MAAMxB,KAAKG,QAC5B,IAAK,IAAIe,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAC/BiC,EAAKjD,MAAMgB,GAAKlB,KAAKE,MAAMgB,GAE7BiC,EAAKhD,OAASH,KAAKG,OACnBgD,EAAKlD,SAAWD,KAAKC,SACrBkD,EAAK/C,IAAMJ,KAAKI,GACpB,EAEET,EAAGF,UAAU2D,MAAQ,WACnB,IAAItC,EAAI,IAAInB,EAAG,MAEf,OADAK,KAAKkD,KAAKpC,GACHA,CACX,EAEEnB,EAAGF,UAAU4D,QAAU,SAAkBC,GACvC,KAAOtD,KAAKG,OAASmD,GACnBtD,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,OAAOH,IACX,EAGEL,EAAGF,UAAU2C,MAAQ,WACnB,KAAOpC,KAAKG,OAAS,GAAqC,IAAhCH,KAAKE,MAAMF,KAAKG,OAAS,IACjDH,KAAKG,SAEP,OAAOH,KAAKuD,WAChB,EAEE5D,EAAGF,UAAU8D,UAAY,WAKvB,OAHoB,IAAhBvD,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACX,EAEEL,EAAGF,UAAU+D,QAAU,WACrB,OAAQxD,KAAKI,IAAM,UAAY,SAAWJ,KAAKgC,SAAS,IAAM,GAClE,EAgCE,IAAIyB,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,UAsjB9D,SAASC,EAAYC,EAAMtC,EAAKuC,GAC9BA,EAAI7D,SAAWsB,EAAItB,SAAW4D,EAAK5D,SACnC,IAAIc,EAAO8C,EAAK1D,OAASoB,EAAIpB,OAAU,EACvC2D,EAAI3D,OAASY,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIgD,EAAoB,EAAhBF,EAAK3D,MAAM,GACf8D,EAAmB,EAAfzC,EAAIrB,MAAM,GACdY,EAAIiD,EAAIC,EAERC,EAAS,SAAJnD,EACLoD,EAASpD,EAAI,SAAa,EAC9BgD,EAAI5D,MAAM,GAAK+D,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAIpD,EAAKoD,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOtD,KAAKC,IAAIkD,EAAG5C,EAAIpB,OAAS,GAC3BoC,EAAIvB,KAAKU,IAAI,EAAGyC,EAAIN,EAAK1D,OAAS,GAAIoC,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIrB,EAAKiD,EAAI5B,EAAK,EAIlB6B,IADAtD,GAFAiD,EAAoB,EAAhBF,EAAK3D,MAAMgB,KACf8C,EAAmB,EAAfzC,EAAIrB,MAAMqC,IACF8B,GACG,SAAa,EAC5BA,EAAY,SAAJvD,CACT,CACDgD,EAAI5D,MAAMiE,GAAa,EAARE,EACfH,EAAiB,EAATE,CACT,CAOD,OANc,IAAVF,EACFJ,EAAI5D,MAAMiE,GAAa,EAARD,EAEfJ,EAAI3D,SAGC2D,EAAI1B,OACZ,CA1lBDzC,EAAGF,UAAUuC,SAAW,SAAmBnC,EAAM0E,GAI/C,IAAIT,EACJ,GAHAS,EAAoB,EAAVA,GAAe,EAGZ,MAJb1E,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCiE,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNyB,EAAQ,EACHhD,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAAK,CACpC,IAAIsB,EAAIxC,KAAKE,MAAMgB,GACf4B,GAA+B,UAArBN,GAAKC,EAAOyB,IAAmBlC,SAAS,IAGpD8B,EADY,IADdI,EAAS1B,IAAO,GAAKC,EAAQ,WACVvB,IAAMlB,KAAKG,OAAS,EAC/BsD,EAAM,EAAIX,EAAK3C,QAAU2C,EAAOgB,EAEhChB,EAAOgB,GAEfrB,GAAO,IACI,KACTA,GAAO,GACPvB,IAEH,CAID,IAHc,IAAVgD,IACFJ,EAAMI,EAAMlC,SAAS,IAAM8B,GAEtBA,EAAI3D,OAASoE,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB9D,KAAKC,WACP6D,EAAM,IAAMA,GAEPA,CACR,CAED,GAAIjE,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI2E,EAAYd,EAAW7D,GAEvB4E,EAAYd,EAAW9D,GAC3BiE,EAAM,GACN,IAAI3C,EAAInB,KAAKoD,QAEb,IADAjC,EAAElB,SAAW,GACLkB,EAAEuD,UAAU,CAClB,IAAI5D,EAAIK,EAAEwD,KAAKF,GAAWzC,SAASnC,GAMjCiE,GALF3C,EAAIA,EAAEyD,MAAMH,IAELC,SAGC5D,EAAIgD,EAFJL,EAAMe,EAAY1D,EAAEX,QAAUW,EAAIgD,CAI3C,CAID,IAHI9D,KAAK0E,WACPZ,EAAM,IAAMA,GAEPA,EAAI3D,OAASoE,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlB9D,KAAKC,WACP6D,EAAM,IAAMA,GAEPA,CACR,CAED9E,GAAO,EAAO,kCAClB,EAEEW,EAAGF,UAAUoF,SAAW,WACtB,IAAIC,EAAM9E,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKG,OACP2E,GAAuB,SAAhB9E,KAAKE,MAAM,GACO,IAAhBF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,GAEzC4E,GAAO,iBAAoC,SAAhB9E,KAAKE,MAAM,GAC7BF,KAAKG,OAAS,GACvBnB,GAAO,EAAO,8CAEU,IAAlBgB,KAAKC,UAAmB6E,EAAMA,CAC1C,EAEEnF,EAAGF,UAAUsF,OAAS,WACpB,OAAO/E,KAAKgC,SAAS,GACzB,EAEErC,EAAGF,UAAUuF,SAAW,SAAmBlF,EAAQK,GAEjD,OADAnB,OAAyB,IAAXsB,GACPN,KAAKiF,YAAY3E,EAAQR,EAAQK,EAC5C,EAEER,EAAGF,UAAU4C,QAAU,SAAkBvC,EAAQK,GAC/C,OAAOH,KAAKiF,YAAYzD,MAAO1B,EAAQK,EAC3C,EAEER,EAAGF,UAAUwF,YAAc,SAAsBC,EAAWpF,EAAQK,GAClE,IAAIgF,EAAanF,KAAKmF,aAClBC,EAAYjF,GAAUa,KAAKU,IAAI,EAAGyD,GACtCnG,EAAOmG,GAAcC,EAAW,yCAChCpG,EAAOoG,EAAY,EAAG,+BAEtBpF,KAAKoC,QACL,IAGI4B,EAAG9C,EAHHmE,EAA0B,OAAXvF,EACfwF,EAAM,IAAIJ,EAAUE,GAGpBG,EAAIvF,KAAKoD,QACb,GAAKiC,EAYE,CACL,IAAKnE,EAAI,GAAIqE,EAAEb,SAAUxD,IACvB8C,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIpE,GAAK8C,EAGX,KAAO9C,EAAIkE,EAAWlE,IACpBoE,EAAIpE,GAAK,CAEZ,KAvBkB,CAEjB,IAAKA,EAAI,EAAGA,EAAIkE,EAAYD,EAAYjE,IACtCoE,EAAIpE,GAAK,EAGX,IAAKA,EAAI,GAAIqE,EAAEb,SAAUxD,IACvB8C,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIF,EAAYlE,EAAI,GAAK8C,CAEjC,CAaI,OAAOsB,CACX,EAGI3F,EAAGF,UAAUiG,WADX1E,KAAK2E,MACmB,SAAqBnD,GAC7C,OAAO,GAAKxB,KAAK2E,MAAMnD,EAC7B,EAE8B,SAAqBA,GAC7C,IAAIoD,EAAIpD,EACJ1B,EAAI,EAiBR,OAhBI8E,GAAK,OACP9E,GAAK,GACL8E,KAAO,IAELA,GAAK,KACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAELA,GAAK,IACP9E,GAAK,EACL8E,KAAO,GAEF9E,EAAI8E,CACjB,EAGEjG,EAAGF,UAAUoG,UAAY,SAAoBrD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIoD,EAAIpD,EACJ1B,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ8E,KACH9E,GAAK,GACL8E,KAAO,IAEU,IAAV,IAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,GAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,KACH9E,GAAK,EACL8E,KAAO,GAES,IAAT,EAAJA,IACH9E,IAEKA,CACX,EAGEnB,EAAGF,UAAUqG,UAAY,WACvB,IAAItD,EAAIxC,KAAKE,MAAMF,KAAKG,OAAS,GAC7B4F,EAAK/F,KAAK0F,WAAWlD,GACzB,OAA2B,IAAnBxC,KAAKG,OAAS,GAAU4F,CACpC,EAgBEpG,EAAGF,UAAUuG,SAAW,WACtB,GAAIhG,KAAK0E,SAAU,OAAO,EAG1B,IADA,IAAI5D,EAAI,EACCI,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAAK,CACpC,IAAI8C,EAAIhE,KAAK6F,UAAU7F,KAAKE,MAAMgB,IAElC,GADAJ,GAAKkD,EACK,KAANA,EAAU,KACf,CACD,OAAOlD,CACX,EAEEnB,EAAGF,UAAU0F,WAAa,WACxB,OAAOnE,KAAKsB,KAAKtC,KAAK8F,YAAc,EACxC,EAEEnG,EAAGF,UAAUwG,OAAS,SAAiBC,GACrC,OAAsB,IAAlBlG,KAAKC,SACAD,KAAKmG,MAAMC,MAAMF,GAAOG,MAAM,GAEhCrG,KAAKoD,OAChB,EAEEzD,EAAGF,UAAU6G,SAAW,SAAmBJ,GACzC,OAAIlG,KAAKuG,MAAML,EAAQ,GACdlG,KAAKwG,KAAKN,GAAOG,MAAM,GAAGI,OAE5BzG,KAAKoD,OAChB,EAEEzD,EAAGF,UAAUiH,MAAQ,WACnB,OAAyB,IAAlB1G,KAAKC,QAChB,EAGEN,EAAGF,UAAUkH,IAAM,WACjB,OAAO3G,KAAKoD,QAAQqD,MACxB,EAEE9G,EAAGF,UAAUgH,KAAO,WAKlB,OAJKzG,KAAK0E,WACR1E,KAAKC,UAAY,GAGZD,IACX,EAGEL,EAAGF,UAAUmH,KAAO,SAAerF,GACjC,KAAOvB,KAAKG,OAASoB,EAAIpB,QACvBH,KAAKE,MAAMF,KAAKG,UAAY,EAG9B,IAAK,IAAIe,EAAI,EAAGA,EAAIK,EAAIpB,OAAQe,IAC9BlB,KAAKE,MAAMgB,GAAKlB,KAAKE,MAAMgB,GAAKK,EAAIrB,MAAMgB,GAG5C,OAAOlB,KAAKoC,OAChB,EAEEzC,EAAGF,UAAUoH,IAAM,SAActF,GAE/B,OADAvC,EAA0C,IAAlCgB,KAAKC,SAAWsB,EAAItB,WACrBD,KAAK4G,KAAKrF,EACrB,EAGE5B,EAAGF,UAAUqH,GAAK,SAAavF,GAC7B,OAAIvB,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQyD,IAAItF,GAC/CA,EAAI6B,QAAQyD,IAAI7G,KAC3B,EAEEL,EAAGF,UAAUsH,IAAM,SAAcxF,GAC/B,OAAIvB,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQwD,KAAKrF,GAChDA,EAAI6B,QAAQwD,KAAK5G,KAC5B,EAGEL,EAAGF,UAAUuH,MAAQ,SAAgBzF,GAEnC,IAAIyC,EAEFA,EADEhE,KAAKG,OAASoB,EAAIpB,OAChBoB,EAEAvB,KAGN,IAAK,IAAIkB,EAAI,EAAGA,EAAI8C,EAAE7D,OAAQe,IAC5BlB,KAAKE,MAAMgB,GAAKlB,KAAKE,MAAMgB,GAAKK,EAAIrB,MAAMgB,GAK5C,OAFAlB,KAAKG,OAAS6D,EAAE7D,OAETH,KAAKoC,OAChB,EAEEzC,EAAGF,UAAUwH,KAAO,SAAe1F,GAEjC,OADAvC,EAA0C,IAAlCgB,KAAKC,SAAWsB,EAAItB,WACrBD,KAAKgH,MAAMzF,EACtB,EAGE5B,EAAGF,UAAUyH,IAAM,SAAc3F,GAC/B,OAAIvB,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQ6D,KAAK1F,GAChDA,EAAI6B,QAAQ6D,KAAKjH,KAC5B,EAEEL,EAAGF,UAAU0H,KAAO,SAAe5F,GACjC,OAAIvB,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQ4D,MAAMzF,GACjDA,EAAI6B,QAAQ4D,MAAMhH,KAC7B,EAGEL,EAAGF,UAAU2H,MAAQ,SAAgB7F,GAEnC,IAAIwC,EACAC,EACAhE,KAAKG,OAASoB,EAAIpB,QACpB4D,EAAI/D,KACJgE,EAAIzC,IAEJwC,EAAIxC,EACJyC,EAAIhE,MAGN,IAAK,IAAIkB,EAAI,EAAGA,EAAI8C,EAAE7D,OAAQe,IAC5BlB,KAAKE,MAAMgB,GAAK6C,EAAE7D,MAAMgB,GAAK8C,EAAE9D,MAAMgB,GAGvC,GAAIlB,OAAS+D,EACX,KAAO7C,EAAI6C,EAAE5D,OAAQe,IACnBlB,KAAKE,MAAMgB,GAAK6C,EAAE7D,MAAMgB,GAM5B,OAFAlB,KAAKG,OAAS4D,EAAE5D,OAETH,KAAKoC,OAChB,EAEEzC,EAAGF,UAAU4H,KAAO,SAAe9F,GAEjC,OADAvC,EAA0C,IAAlCgB,KAAKC,SAAWsB,EAAItB,WACrBD,KAAKoH,MAAM7F,EACtB,EAGE5B,EAAGF,UAAU6H,IAAM,SAAc/F,GAC/B,OAAIvB,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQiE,KAAK9F,GAChDA,EAAI6B,QAAQiE,KAAKrH,KAC5B,EAEEL,EAAGF,UAAU8H,KAAO,SAAehG,GACjC,OAAIvB,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQgE,MAAM7F,GACjDA,EAAI6B,QAAQgE,MAAMpH,KAC7B,EAGEL,EAAGF,UAAU2G,MAAQ,SAAgBF,GACnClH,EAAwB,iBAAVkH,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBxG,KAAKsB,KAAK4D,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBlG,KAAKqD,QAAQmE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAItG,EAAI,EAAGA,EAAIsG,EAAatG,IAC/BlB,KAAKE,MAAMgB,GAAsB,UAAhBlB,KAAKE,MAAMgB,GAS9B,OALIuG,EAAW,IACbzH,KAAKE,MAAMgB,IAAMlB,KAAKE,MAAMgB,GAAM,UAAc,GAAKuG,GAIhDzH,KAAKoC,OAChB,EAEEzC,EAAGF,UAAU+G,KAAO,SAAeN,GACjC,OAAOlG,KAAKoD,QAAQgD,MAAMF,EAC9B,EAGEvG,EAAGF,UAAUiI,KAAO,SAAeC,EAAK1I,GACtCD,EAAsB,iBAAR2I,GAAoBA,GAAO,GAEzC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA3H,KAAKqD,QAAQZ,EAAM,GAGjBzC,KAAKE,MAAMuC,GADTxD,EACgBe,KAAKE,MAAMuC,GAAQ,GAAKmF,EAExB5H,KAAKE,MAAMuC,KAAS,GAAKmF,GAGtC5H,KAAKoC,OAChB,EAGEzC,EAAGF,UAAUoI,KAAO,SAAetG,GACjC,IAAIT,EAkBAiD,EAAGC,EAfP,GAAsB,IAAlBhE,KAAKC,UAAmC,IAAjBsB,EAAItB,SAI7B,OAHAD,KAAKC,SAAW,EAChBa,EAAId,KAAK8H,KAAKvG,GACdvB,KAAKC,UAAY,EACVD,KAAKuD,YAGP,GAAsB,IAAlBvD,KAAKC,UAAmC,IAAjBsB,EAAItB,SAIpC,OAHAsB,EAAItB,SAAW,EACfa,EAAId,KAAK8H,KAAKvG,GACdA,EAAItB,SAAW,EACRa,EAAEyC,YAKPvD,KAAKG,OAASoB,EAAIpB,QACpB4D,EAAI/D,KACJgE,EAAIzC,IAEJwC,EAAIxC,EACJyC,EAAIhE,MAIN,IADA,IAAIkE,EAAQ,EACHhD,EAAI,EAAGA,EAAI8C,EAAE7D,OAAQe,IAC5BJ,GAAkB,EAAbiD,EAAE7D,MAAMgB,KAAwB,EAAb8C,EAAE9D,MAAMgB,IAAUgD,EAC1ClE,KAAKE,MAAMgB,GAAS,SAAJJ,EAChBoD,EAAQpD,IAAM,GAEhB,KAAiB,IAAVoD,GAAehD,EAAI6C,EAAE5D,OAAQe,IAClCJ,GAAkB,EAAbiD,EAAE7D,MAAMgB,IAAUgD,EACvBlE,KAAKE,MAAMgB,GAAS,SAAJJ,EAChBoD,EAAQpD,IAAM,GAIhB,GADAd,KAAKG,OAAS4D,EAAE5D,OACF,IAAV+D,EACFlE,KAAKE,MAAMF,KAAKG,QAAU+D,EAC1BlE,KAAKG,cAEA,GAAI4D,IAAM/D,KACf,KAAOkB,EAAI6C,EAAE5D,OAAQe,IACnBlB,KAAKE,MAAMgB,GAAK6C,EAAE7D,MAAMgB,GAI5B,OAAOlB,IACX,EAGEL,EAAGF,UAAUsI,IAAM,SAAcxG,GAC/B,IAAI+D,EACJ,OAAqB,IAAjB/D,EAAItB,UAAoC,IAAlBD,KAAKC,UAC7BsB,EAAItB,SAAW,EACfqF,EAAMtF,KAAKgI,IAAIzG,GACfA,EAAItB,UAAY,EACTqF,GACmB,IAAjB/D,EAAItB,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChBqF,EAAM/D,EAAIyG,IAAIhI,MACdA,KAAKC,SAAW,EACTqF,GAGLtF,KAAKG,OAASoB,EAAIpB,OAAeH,KAAKoD,QAAQyE,KAAKtG,GAEhDA,EAAI6B,QAAQyE,KAAK7H,KAC5B,EAGEL,EAAGF,UAAUqI,KAAO,SAAevG,GAEjC,GAAqB,IAAjBA,EAAItB,SAAgB,CACtBsB,EAAItB,SAAW,EACf,IAAIa,EAAId,KAAK6H,KAAKtG,GAElB,OADAA,EAAItB,SAAW,EACRa,EAAEyC,WAGf,CAAW,GAAsB,IAAlBvD,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAK6H,KAAKtG,GACVvB,KAAKC,SAAW,EACTD,KAAKuD,YAId,IAWIQ,EAAGC,EAXHnC,EAAM7B,KAAK6B,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHA7B,KAAKC,SAAW,EAChBD,KAAKG,OAAS,EACdH,KAAKE,MAAM,GAAK,EACTF,KAKL6B,EAAM,GACRkC,EAAI/D,KACJgE,EAAIzC,IAEJwC,EAAIxC,EACJyC,EAAIhE,MAIN,IADA,IAAIkE,EAAQ,EACHhD,EAAI,EAAGA,EAAI8C,EAAE7D,OAAQe,IAE5BgD,GADApD,GAAkB,EAAbiD,EAAE7D,MAAMgB,KAAwB,EAAb8C,EAAE9D,MAAMgB,IAAUgD,IAC7B,GACblE,KAAKE,MAAMgB,GAAS,SAAJJ,EAElB,KAAiB,IAAVoD,GAAehD,EAAI6C,EAAE5D,OAAQe,IAElCgD,GADApD,GAAkB,EAAbiD,EAAE7D,MAAMgB,IAAUgD,IACV,GACblE,KAAKE,MAAMgB,GAAS,SAAJJ,EAIlB,GAAc,IAAVoD,GAAehD,EAAI6C,EAAE5D,QAAU4D,IAAM/D,KACvC,KAAOkB,EAAI6C,EAAE5D,OAAQe,IACnBlB,KAAKE,MAAMgB,GAAK6C,EAAE7D,MAAMgB,GAU5B,OANAlB,KAAKG,OAASa,KAAKU,IAAI1B,KAAKG,OAAQe,GAEhC6C,IAAM/D,OACRA,KAAKC,SAAW,GAGXD,KAAKoC,OAChB,EAGEzC,EAAGF,UAAUuI,IAAM,SAAczG,GAC/B,OAAOvB,KAAKoD,QAAQ0E,KAAKvG,EAC7B,EA8CE,IAAI0G,EAAc,SAAsBpE,EAAMtC,EAAKuC,GACjD,IAIIG,EACAiE,EACAnC,EANAhC,EAAIF,EAAK3D,MACT8D,EAAIzC,EAAIrB,MACRiI,EAAIrE,EAAI5D,MACRiB,EAAI,EAIJiH,EAAY,EAAPrE,EAAE,GACPsE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxE,EAAE,GACPyE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3E,EAAE,GACP4E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9E,EAAE,GACP+E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjF,EAAE,GACPkF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpF,EAAE,GACPqF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvF,EAAE,GACPwF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1F,EAAE,GACP2F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlG,EAAE,GACPmG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrG,EAAE,GACPsG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxG,EAAE,GACPyG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3G,EAAE,GACP4G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9G,EAAE,GACP+G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPjH,EAAE,GACPkH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpH,EAAE,GACPqH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvH,EAAE,GACPwH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1H,EAAE,GACP2H,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP7H,EAAE,GACP8H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB/H,EAAI7D,SAAW4D,EAAK5D,SAAWsB,EAAItB,SACnC6D,EAAI3D,OAAS,GAMb,IAAI6L,IAAQ7K,GAJZ8C,EAAKjD,KAAKiL,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMlH,KAAKiL,KAAK5D,EAAK+B,IACRpJ,KAAKiL,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDhJ,IAFA4E,EAAK/E,KAAKiL,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKjD,KAAKiL,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKzD,EAAK4B,IACRpJ,KAAKiL,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQ/K,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAKkC,GAAQ,GACvBvJ,KAAKiL,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDnJ,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKjD,KAAKiL,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKtD,EAAKyB,IACRpJ,KAAKiL,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKrD,EAAKwB,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAK+B,GAAQ,GACvBvJ,KAAKiL,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQhL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAKqC,GAAQ,GACvB1J,KAAKiL,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDtJ,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKjD,KAAKiL,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKnD,EAAKsB,IACRpJ,KAAKiL,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKlD,EAAKqB,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAK4B,GAAQ,GACvBvJ,KAAKiL,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAKkC,GAAQ,GACvB1J,KAAKiL,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQjL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAKwC,GAAQ,GACvB7J,KAAKiL,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDzJ,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKjD,KAAKiL,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKhD,EAAKmB,IACRpJ,KAAKiL,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAK/C,EAAKkB,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAKyB,GAAQ,GACvBvJ,KAAKiL,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAK+B,GAAQ,GACvB1J,KAAKiL,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAK8B,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAKqC,GAAQ,GACvB7J,KAAKiL,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQlL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAK2C,IAAQ,GACvBhK,KAAKiL,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrD5J,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKjD,KAAKiL,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAK7C,EAAKgB,IACRpJ,KAAKiL,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAK5C,EAAKe,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAKsB,GAAQ,GACvBvJ,KAAKiL,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAK4B,GAAQ,GACvB1J,KAAKiL,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAK2B,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAKkC,GAAQ,GACvB7J,KAAKiL,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAKiC,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAKwC,IAAQ,GACvBhK,KAAKiL,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQnL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAK8C,IAAQ,GACvBnK,KAAKiL,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrD/J,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKjD,KAAKiL,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAK1C,EAAKa,IACRpJ,KAAKiL,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKzC,EAAKY,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAKmB,GAAQ,GACvBvJ,KAAKiL,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAKyB,GAAQ,GACvB1J,KAAKiL,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAKwB,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAK+B,GAAQ,GACvB7J,KAAKiL,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAK8B,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAKqC,IAAQ,GACvBhK,KAAKiL,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAK2C,IAAQ,GACvBnK,KAAKiL,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQpL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAKiD,IAAQ,GACvBtK,KAAKiL,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDlK,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKjD,KAAKiL,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKvC,EAAKU,IACRpJ,KAAKiL,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKtC,EAAKS,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKgB,GAAQ,GACvBvJ,KAAKiL,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAKsB,GAAQ,GACvB1J,KAAKiL,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAKqB,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAK4B,GAAQ,GACvB7J,KAAKiL,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAK2B,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAKkC,IAAQ,GACvBhK,KAAKiL,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAKwC,IAAQ,GACvBnK,KAAKiL,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAKuC,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAK8C,IAAQ,GACvBtK,KAAKiL,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQrL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAKoD,IAAQ,GACvBzK,KAAKiL,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDrK,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKjD,KAAKiL,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKpC,EAAKO,IACRpJ,KAAKiL,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKnC,EAAKM,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKa,GAAQ,GACvBvJ,KAAKiL,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKY,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKmB,GAAQ,GACvB1J,KAAKiL,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKkB,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAKyB,GAAQ,GACvB7J,KAAKiL,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAKwB,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAK+B,IAAQ,GACvBhK,KAAKiL,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAKqC,IAAQ,GACvBnK,KAAKiL,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAKoC,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAK2C,IAAQ,GACvBtK,KAAKiL,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAKiD,IAAQ,GACvBzK,KAAKiL,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQtL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAKuD,IAAQ,GACvB5K,KAAKiL,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDxK,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAKjD,KAAKiL,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKI,IACRpJ,KAAKiL,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK/E,KAAKiL,KAAKhC,EAAKG,GACpBnG,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKU,GAAQ,GACvBvJ,KAAKiL,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKS,GAAQ,EAClCtG,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKgB,GAAQ,GACvB1J,KAAKiL,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKe,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKsB,GAAQ,GACvB7J,KAAKiL,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKqB,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAK4B,IAAQ,GACvBhK,KAAKiL,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAKkC,IAAQ,GACvBnK,KAAKiL,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAKiC,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAKwC,IAAQ,GACvBtK,KAAKiL,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAK8C,IAAQ,GACvBzK,KAAKiL,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAK6C,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAKoD,IAAQ,GACvB5K,KAAKiL,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQvL,GAJZ8C,EAAMA,EAAKjD,KAAKiL,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK5D,EAAK0D,IAAQ,GACvB/K,KAAKiL,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENzI,EAAKjD,KAAKiL,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKO,IACRvJ,KAAKiL,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK/E,KAAKiL,KAAKhC,EAAKM,GACpBtG,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKa,GAAQ,GACvB1J,KAAKiL,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKY,GAAQ,EAClCzG,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKmB,GAAQ,GACvB7J,KAAKiL,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKkB,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKyB,IAAQ,GACvBhK,KAAKiL,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAK+B,IAAQ,GACvBnK,KAAKiL,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAK8B,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAKqC,IAAQ,GACvBtK,KAAKiL,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAK2C,IAAQ,GACvBzK,KAAKiL,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAK0C,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAKiD,IAAQ,GACvB5K,KAAKiL,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASxL,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKzD,EAAKuD,IAAQ,GACvB/K,KAAKiL,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKjD,KAAKiL,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKU,IACR1J,KAAKiL,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK/E,KAAKiL,KAAKhC,EAAKS,GACpBzG,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKgB,GAAQ,GACvB7J,KAAKiL,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKe,GAAQ,EAClC5G,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKsB,IAAQ,GACvBhK,KAAKiL,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKqB,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAK4B,IAAQ,GACvBnK,KAAKiL,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAKkC,IAAQ,GACvBtK,KAAKiL,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAKwC,IAAQ,GACvBzK,KAAKiL,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAKuC,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAK8C,IAAQ,GACvB5K,KAAKiL,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASzL,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKtD,EAAKoD,IAAQ,GACvB/K,KAAKiL,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKjD,KAAKiL,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKa,IACR7J,KAAKiL,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK/E,KAAKiL,KAAKhC,EAAKY,GACpB5G,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKmB,IAAQ,GACvBhK,KAAKiL,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKkB,IAAQ,EAClC/G,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKyB,IAAQ,GACvBnK,KAAKiL,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKwB,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAK+B,IAAQ,GACvBtK,KAAKiL,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAKqC,IAAQ,GACvBzK,KAAKiL,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAKoC,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAK2C,IAAQ,GACvB5K,KAAKiL,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAS1L,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKnD,EAAKiD,IAAQ,GACvB/K,KAAKiL,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKjD,KAAKiL,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKgB,KACRhK,KAAKiL,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK/E,KAAKiL,KAAKhC,EAAKe,IACpB/G,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKsB,IAAQ,GACvBnK,KAAKiL,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKqB,IAAQ,EAClClH,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAK4B,IAAQ,GACvBtK,KAAKiL,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAK2B,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKkC,IAAQ,GACvBzK,KAAKiL,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKiC,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAKwC,IAAQ,GACvB5K,KAAKiL,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAAS3L,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKhD,EAAK8C,IAAQ,GACvB/K,KAAKiL,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKjD,KAAKiL,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKmB,KACRnK,KAAKiL,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK/E,KAAKiL,KAAKhC,EAAKkB,IACpBlH,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKyB,IAAQ,GACvBtK,KAAKiL,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKwB,IAAQ,EAClCrH,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAK+B,IAAQ,GACvBzK,KAAKiL,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAK8B,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKqC,IAAQ,GACvB5K,KAAKiL,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAS5L,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK7C,EAAK2C,IAAQ,GACvB/K,KAAKiL,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKjD,KAAKiL,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKsB,KACRtK,KAAKiL,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK/E,KAAKiL,KAAKhC,EAAKqB,IACpBrH,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAK4B,IAAQ,GACvBzK,KAAKiL,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAK2B,IAAQ,EAClCxH,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKkC,IAAQ,GACvB5K,KAAKiL,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS7L,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAK1C,EAAKwC,IAAQ,GACvB/K,KAAKiL,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAKjD,KAAKiL,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAKyB,KACRzK,KAAKiL,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK/E,KAAKiL,KAAKhC,EAAKwB,IACpBxH,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAK+B,IAAQ,GACvB5K,KAAKiL,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS9L,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKvC,EAAKqC,IAAQ,GACvB/K,KAAKiL,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPhJ,EAAKjD,KAAKiL,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAK4B,KACR5K,KAAKiL,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK/E,KAAKiL,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAS/L,GAJb8C,EAAMA,EAAKjD,KAAKiL,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMlH,KAAKiL,KAAKpC,EAAKkC,IAAQ,GACvB/K,KAAKiL,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtD3K,IAFA4E,EAAMA,EAAK/E,KAAKiL,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAShM,GAJb8C,EAAKjD,KAAKiL,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMlH,KAAKiL,KAAKjC,EAAK+B,KACR/K,KAAKiL,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBA3K,IAFA4E,EAAK/E,KAAKiL,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,IAANhM,IACFgH,EAAE,IAAMhH,EACR2C,EAAI3D,UAEC2D,CACX,EAgDE,SAASsJ,EAAYvJ,EAAMtC,EAAKuC,GAE9B,OADW,IAAIuJ,GACHC,KAAKzJ,EAAMtC,EAAKuC,EAC7B,CAqBD,SAASuJ,EAAME,EAAGC,GAChBxN,KAAKuN,EAAIA,EACTvN,KAAKwN,EAAIA,CACV,CAxEIxM,KAAKiL,OACRhE,EAAcrE,GAiDhBjE,EAAGF,UAAUgO,MAAQ,SAAgBlM,EAAKuC,GACxC,IAAIwB,EACAvE,EAAMf,KAAKG,OAASoB,EAAIpB,OAW5B,OATEmF,EADkB,KAAhBtF,KAAKG,QAAgC,KAAfoB,EAAIpB,OACtB8H,EAAYjI,KAAMuB,EAAKuC,GACpB/C,EAAM,GACT6C,EAAW5D,KAAMuB,EAAKuC,GACnB/C,EAAM,KArDnB,SAAmB8C,EAAMtC,EAAKuC,GAC5BA,EAAI7D,SAAWsB,EAAItB,SAAW4D,EAAK5D,SACnC6D,EAAI3D,OAAS0D,EAAK1D,OAASoB,EAAIpB,OAI/B,IAFA,IAAI+D,EAAQ,EACRwJ,EAAU,EACLvJ,EAAI,EAAGA,EAAIL,EAAI3D,OAAS,EAAGgE,IAAK,CAGvC,IAAIC,EAASsJ,EACbA,EAAU,EAGV,IAFA,IAAIrJ,EAAgB,SAARH,EACRI,EAAOtD,KAAKC,IAAIkD,EAAG5C,EAAIpB,OAAS,GAC3BoC,EAAIvB,KAAKU,IAAI,EAAGyC,EAAIN,EAAK1D,OAAS,GAAIoC,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIrB,EAAIiD,EAAI5B,EAGRzB,GAFoB,EAAhB+C,EAAK3D,MAAMgB,KACI,EAAfK,EAAIrB,MAAMqC,IAGd0B,EAAS,SAAJnD,EAGTuD,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBqJ,IAFAtJ,GAHAA,EAAUA,GAAWtD,EAAI,SAAa,GAAM,IAGxBmD,IAAO,IAAO,KAEZ,GACtBG,GAAU,QACX,CACDN,EAAI5D,MAAMiE,GAAKE,EACfH,EAAQE,EACRA,EAASsJ,CACV,CAOD,OANc,IAAVxJ,EACFJ,EAAI5D,MAAMiE,GAAKD,EAEfJ,EAAI3D,SAGC2D,EAAI1B,OACZ,CAeSuL,CAAS3N,KAAMuB,EAAKuC,GAEpBsJ,EAAWpN,KAAMuB,EAAKuC,GAGvBwB,CACX,EAUE+H,EAAK5N,UAAUmO,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAQpE,MAAMqM,GACdC,EAAInO,EAAGF,UAAUiG,WAAWmI,GAAK,EAC5B3M,EAAI,EAAGA,EAAI2M,EAAG3M,IACrB0E,EAAE1E,GAAKlB,KAAK+N,OAAO7M,EAAG4M,EAAGD,GAG3B,OAAOjI,CACX,EAGEyH,EAAK5N,UAAUsO,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACA9M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrB8M,IAAW,EAAJT,IAAWO,EAAI5M,EAAI,EAC1BqM,IAAM,EAGR,OAAOS,CACX,EAIEX,EAAK5N,UAAUwO,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAI3M,EAAI,EAAGA,EAAI2M,EAAG3M,IACrBmN,EAAKnN,GAAKiN,EAAID,EAAIhN,IAClBoN,EAAKpN,GAAKkN,EAAIF,EAAIhN,GAExB,EAEEmM,EAAK5N,UAAU8O,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtElO,KAAKiO,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQzN,KAAK0N,IAAI,EAAI1N,KAAK2N,GAAKb,GAC/Bc,EAAQ5N,KAAK6N,IAAI,EAAI7N,KAAK2N,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJrM,EAAI,EAAGA,EAAIiM,EAAGjM,IAAK,CAC1B,IAAI0M,EAAKZ,EAAKS,EAAIvM,GACd2M,EAAKZ,EAAKQ,EAAIvM,GAEd4M,EAAKd,EAAKS,EAAIvM,EAAIiM,GAClBY,EAAKd,EAAKQ,EAAIvM,EAAIiM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAIvM,GAAK0M,EAAKE,EACnBb,EAAKQ,EAAIvM,GAAK2M,EAAKE,EAEnBf,EAAKS,EAAIvM,EAAIiM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAIvM,EAAIiM,GAAKU,EAAKE,EAGnB7M,IAAMuL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,EAEZ,CAGT,EAEEhC,EAAK5N,UAAU6P,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjB7M,KAAKU,IAAI8N,EAAGD,GAChBE,EAAU,EAAJ5B,EACN3M,EAAI,EACR,IAAK2M,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B3M,IAGF,OAAO,GAAKA,EAAI,EAAIuO,CACxB,EAEEpC,EAAK5N,UAAUiQ,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAI3M,EAAI,EAAGA,EAAI2M,EAAI,EAAG3M,IAAK,CAC9B,IAAI0E,EAAIuI,EAAIjN,GAEZiN,EAAIjN,GAAKiN,EAAIN,EAAI3M,EAAI,GACrBiN,EAAIN,EAAI3M,EAAI,GAAK0E,EAEjBA,EAAIwI,EAAIlN,GAERkN,EAAIlN,IAAMkN,EAAIP,EAAI3M,EAAI,GACtBkN,EAAIP,EAAI3M,EAAI,IAAM0E,CACnB,CACL,EAEEyH,EAAK5N,UAAUkQ,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI3J,EAAQ,EACHhD,EAAI,EAAGA,EAAI2M,EAAI,EAAG3M,IAAK,CAC9B,IAAIsB,EAAoC,KAAhCxB,KAAK6O,MAAMD,EAAG,EAAI1O,EAAI,GAAK2M,GACjC7M,KAAK6O,MAAMD,EAAG,EAAI1O,GAAK2M,GACvB3J,EAEF0L,EAAG1O,GAAS,SAAJsB,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,CAE3B,CAED,OAAOoN,CACX,EAEEvC,EAAK5N,UAAUqQ,WAAa,SAAqBF,EAAI7O,EAAKoN,EAAKN,GAE7D,IADA,IAAI3J,EAAQ,EACHhD,EAAI,EAAGA,EAAIH,EAAKG,IACvBgD,GAAyB,EAAR0L,EAAG1O,GAEpBiN,EAAI,EAAIjN,GAAa,KAARgD,EAAgBA,KAAkB,GAC/CiK,EAAI,EAAIjN,EAAI,GAAa,KAARgD,EAAgBA,KAAkB,GAIrD,IAAKhD,EAAI,EAAIH,EAAKG,EAAI2M,IAAK3M,EACzBiN,EAAIjN,GAAK,EAGXlC,EAAiB,IAAVkF,GACPlF,EAA6B,KAAb,KAARkF,GACZ,EAEEmJ,EAAK5N,UAAUsQ,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAASxO,MAAMqM,GACV3M,EAAI,EAAGA,EAAI2M,EAAG3M,IACrB8O,EAAG9O,GAAK,EAGV,OAAO8O,CACX,EAEE3C,EAAK5N,UAAU6N,KAAO,SAAeC,EAAGC,EAAG1J,GACzC,IAAI+J,EAAI,EAAI7N,KAAKsP,YAAY/B,EAAEpN,OAAQqN,EAAErN,QAErC+N,EAAMlO,KAAK4N,QAAQC,GAEnBoC,EAAIjQ,KAAK+P,KAAKlC,GAEdM,EAAU3M,MAAMqM,GAChBqC,EAAW1O,MAAMqM,GACjBsC,EAAW3O,MAAMqM,GAEjBuC,EAAW5O,MAAMqM,GACjBwC,EAAY7O,MAAMqM,GAClByC,EAAY9O,MAAMqM,GAElB0C,EAAOzM,EAAI5D,MACfqQ,EAAKpQ,OAAS0N,EAEd7N,KAAK8P,WAAWvC,EAAErN,MAAOqN,EAAEpN,OAAQgO,EAAKN,GACxC7N,KAAK8P,WAAWtC,EAAEtN,MAAOsN,EAAErN,OAAQiQ,EAAMvC,GAEzC7N,KAAKuO,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtClO,KAAKuO,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAIhN,EAAI,EAAGA,EAAI2M,EAAG3M,IAAK,CAC1B,IAAImO,EAAKa,EAAKhP,GAAKmP,EAAMnP,GAAKiP,EAAKjP,GAAKoP,EAAMpP,GAC9CiP,EAAKjP,GAAKgP,EAAKhP,GAAKoP,EAAMpP,GAAKiP,EAAKjP,GAAKmP,EAAMnP,GAC/CgP,EAAKhP,GAAKmO,CACX,CASD,OAPArP,KAAK0P,UAAUQ,EAAMC,EAAMtC,GAC3B7N,KAAKuO,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvClO,KAAK0P,UAAUa,EAAMN,EAAGpC,GACxB7N,KAAK2P,aAAaY,EAAM1C,GAExB/J,EAAI7D,SAAWsN,EAAEtN,SAAWuN,EAAEvN,SAC9B6D,EAAI3D,OAASoN,EAAEpN,OAASqN,EAAErN,OACnB2D,EAAI1B,OACf,EAGEzC,EAAGF,UAAU6B,IAAM,SAAcC,GAC/B,IAAIuC,EAAM,IAAInE,EAAG,MAEjB,OADAmE,EAAI5D,MAAYsB,MAAMxB,KAAKG,OAASoB,EAAIpB,QACjCH,KAAKyN,MAAMlM,EAAKuC,EAC3B,EAGEnE,EAAGF,UAAU+Q,KAAO,SAAejP,GACjC,IAAIuC,EAAM,IAAInE,EAAG,MAEjB,OADAmE,EAAI5D,MAAYsB,MAAMxB,KAAKG,OAASoB,EAAIpB,QACjCiN,EAAWpN,KAAMuB,EAAKuC,EACjC,EAGEnE,EAAGF,UAAUwM,KAAO,SAAe1K,GACjC,OAAOvB,KAAKoD,QAAQqK,MAAMlM,EAAKvB,KACnC,EAEEL,EAAGF,UAAUsD,MAAQ,SAAgBxB,GACnCvC,EAAsB,iBAARuC,GACdvC,EAAOuC,EAAM,UAIb,IADA,IAAI2C,EAAQ,EACHhD,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAAK,CACpC,IAAIsB,GAAqB,EAAhBxC,KAAKE,MAAMgB,IAAUK,EAC1B0C,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChBjE,KAAKE,MAAMgB,GAAU,SAAL+C,CACjB,CAOD,OALc,IAAVC,IACFlE,KAAKE,MAAMgB,GAAKgD,EAChBlE,KAAKG,UAGAH,IACX,EAEEL,EAAGF,UAAUgR,KAAO,SAAelP,GACjC,OAAOvB,KAAKoD,QAAQL,MAAMxB,EAC9B,EAGE5B,EAAGF,UAAUiR,IAAM,WACjB,OAAO1Q,KAAKsB,IAAItB,KACpB,EAGEL,EAAGF,UAAUkR,KAAO,WAClB,OAAO3Q,KAAKiM,KAAKjM,KAAKoD,QAC1B,EAGEzD,EAAGF,UAAUwD,IAAM,SAAc1B,GAC/B,IAAIiB,EAxxCN,SAAqBjB,GAGnB,IAFA,IAAIiB,EAAQhB,MAAMD,EAAIuE,aAEb6B,EAAM,EAAGA,EAAMnF,EAAErC,OAAQwH,IAAO,CACvC,IAAIlF,EAAOkF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnF,EAAEmF,IAAQpG,EAAIrB,MAAMuC,GAAQ,GAAKmF,KAAWA,CAC7C,CAED,OAAOpF,CACR,CA6wCSoO,CAAWrP,GACnB,GAAiB,IAAbiB,EAAErC,OAAc,OAAO,IAAIR,EAAG,GAIlC,IADA,IAAI2F,EAAMtF,KACDkB,EAAI,EAAGA,EAAIsB,EAAErC,QACP,IAATqC,EAAEtB,GADsBA,IAAKoE,EAAMA,EAAIoL,OAI7C,KAAMxP,EAAIsB,EAAErC,OACV,IAAK,IAAIoF,EAAID,EAAIoL,MAAOxP,EAAIsB,EAAErC,OAAQe,IAAKqE,EAAIA,EAAEmL,MAClC,IAATlO,EAAEtB,KAENoE,EAAMA,EAAIhE,IAAIiE,IAIlB,OAAOD,CACX,EAGE3F,EAAGF,UAAUoR,OAAS,SAAiBC,GACrC9R,EAAuB,iBAAT8R,GAAqBA,GAAQ,GAC3C,IAGI5P,EAHAJ,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GACjBiQ,EAAa,WAAe,GAAKjQ,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoD,EAAQ,EAEZ,IAAKhD,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAAK,CAChC,IAAI8P,EAAWhR,KAAKE,MAAMgB,GAAK6P,EAC3B5P,GAAsB,EAAhBnB,KAAKE,MAAMgB,IAAU8P,GAAalQ,EAC5Cd,KAAKE,MAAMgB,GAAKC,EAAI+C,EACpBA,EAAQ8M,IAAc,GAAKlQ,CAC5B,CAEGoD,IACFlE,KAAKE,MAAMgB,GAAKgD,EAChBlE,KAAKG,SAER,CAED,GAAU,IAANqO,EAAS,CACX,IAAKtN,EAAIlB,KAAKG,OAAS,EAAGe,GAAK,EAAGA,IAChClB,KAAKE,MAAMgB,EAAIsN,GAAKxO,KAAKE,MAAMgB,GAGjC,IAAKA,EAAI,EAAGA,EAAIsN,EAAGtN,IACjBlB,KAAKE,MAAMgB,GAAK,EAGlBlB,KAAKG,QAAUqO,CAChB,CAED,OAAOxO,KAAKoC,OAChB,EAEEzC,EAAGF,UAAUwR,MAAQ,SAAgBH,GAGnC,OADA9R,EAAyB,IAAlBgB,KAAKC,UACLD,KAAK6Q,OAAOC,EACvB,EAKEnR,EAAGF,UAAUgG,OAAS,SAAiBqL,EAAMI,EAAMC,GAEjD,IAAIC,EADJpS,EAAuB,iBAAT8R,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIpQ,EAAIgQ,EAAO,GACXtC,EAAIxN,KAAKC,KAAK6P,EAAOhQ,GAAK,GAAId,KAAKG,QACnCkR,EAAO,SAAc,WAAcvQ,GAAMA,EACzCwQ,EAAcH,EAMlB,GAHAC,EAAIpQ,KAAKU,IAAI,EADb0P,GAAK5C,GAID8C,EAAa,CACf,IAAK,IAAIpQ,EAAI,EAAGA,EAAIsN,EAAGtN,IACrBoQ,EAAYpR,MAAMgB,GAAKlB,KAAKE,MAAMgB,GAEpCoQ,EAAYnR,OAASqO,CACtB,CAED,GAAU,IAANA,QAEG,GAAIxO,KAAKG,OAASqO,EAEvB,IADAxO,KAAKG,QAAUqO,EACVtN,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAC3BlB,KAAKE,MAAMgB,GAAKlB,KAAKE,MAAMgB,EAAIsN,QAGjCxO,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,EAGhB,IAAI+D,EAAQ,EACZ,IAAKhD,EAAIlB,KAAKG,OAAS,EAAGe,GAAK,IAAgB,IAAVgD,GAAehD,GAAKkQ,GAAIlQ,IAAK,CAChE,IAAI4B,EAAuB,EAAhB9C,KAAKE,MAAMgB,GACtBlB,KAAKE,MAAMgB,GAAMgD,GAAU,GAAKpD,EAAOgC,IAAShC,EAChDoD,EAAQpB,EAAOuO,CAChB,CAYD,OATIC,GAAyB,IAAVpN,IACjBoN,EAAYpR,MAAMoR,EAAYnR,UAAY+D,GAGxB,IAAhBlE,KAAKG,SACPH,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,GAGTH,KAAKoC,OAChB,EAEEzC,EAAGF,UAAU8R,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAnS,EAAyB,IAAlBgB,KAAKC,UACLD,KAAKyF,OAAOqL,EAAMI,EAAMC,EACnC,EAGExR,EAAGF,UAAU+R,KAAO,SAAeV,GACjC,OAAO9Q,KAAKoD,QAAQ6N,MAAMH,EAC9B,EAEEnR,EAAGF,UAAUgS,MAAQ,SAAgBX,GACnC,OAAO9Q,KAAKoD,QAAQyN,OAAOC,EAC/B,EAGEnR,EAAGF,UAAUiS,KAAO,SAAeZ,GACjC,OAAO9Q,KAAKoD,QAAQmO,MAAMT,EAC9B,EAEEnR,EAAGF,UAAUkS,MAAQ,SAAgBb,GACnC,OAAO9Q,KAAKoD,QAAQqC,OAAOqL,EAC/B,EAGEnR,EAAGF,UAAU8G,MAAQ,SAAgBoB,GACnC3I,EAAsB,iBAAR2I,GAAoBA,GAAO,GACzC,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,QAAId,KAAKG,QAAUqO,KAGXxO,KAAKE,MAAMsO,GAELjJ,GAClB,EAGE5F,EAAGF,UAAUmS,OAAS,SAAiBd,GACrC9R,EAAuB,iBAAT8R,GAAqBA,GAAQ,GAC3C,IAAIhQ,EAAIgQ,EAAO,GACXtC,GAAKsC,EAAOhQ,GAAK,GAIrB,GAFA9B,EAAyB,IAAlBgB,KAAKC,SAAgB,2CAExBD,KAAKG,QAAUqO,EACjB,OAAOxO,KAQT,GALU,IAANc,GACF0N,IAEFxO,KAAKG,OAASa,KAAKC,IAAIuN,EAAGxO,KAAKG,QAErB,IAANW,EAAS,CACX,IAAIuQ,EAAO,SAAc,WAAcvQ,GAAMA,EAC7Cd,KAAKE,MAAMF,KAAKG,OAAS,IAAMkR,CAChC,CAED,OAAOrR,KAAKoC,OAChB,EAGEzC,EAAGF,UAAUoS,MAAQ,SAAgBf,GACnC,OAAO9Q,KAAKoD,QAAQwO,OAAOd,EAC/B,EAGEnR,EAAGF,UAAU4G,MAAQ,SAAgB9E,GAGnC,OAFAvC,EAAsB,iBAARuC,GACdvC,EAAOuC,EAAM,UACTA,EAAM,EAAUvB,KAAK8R,OAAOvQ,GAGV,IAAlBvB,KAAKC,SACa,IAAhBD,KAAKG,SAAiC,EAAhBH,KAAKE,MAAM,IAAUqB,GAC7CvB,KAAKE,MAAM,GAAKqB,GAAuB,EAAhBvB,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK8R,MAAMvQ,GACXvB,KAAKC,SAAW,EACTD,MAIFA,KAAKgD,OAAOzB,EACvB,EAEE5B,EAAGF,UAAUuD,OAAS,SAAiBzB,GACrCvB,KAAKE,MAAM,IAAMqB,EAGjB,IAAK,IAAIL,EAAI,EAAGA,EAAIlB,KAAKG,QAAUH,KAAKE,MAAMgB,IAAM,SAAWA,IAC7DlB,KAAKE,MAAMgB,IAAM,SACbA,IAAMlB,KAAKG,OAAS,EACtBH,KAAKE,MAAMgB,EAAI,GAAK,EAEpBlB,KAAKE,MAAMgB,EAAI,KAKnB,OAFAlB,KAAKG,OAASa,KAAKU,IAAI1B,KAAKG,OAAQe,EAAI,GAEjClB,IACX,EAGEL,EAAGF,UAAUqS,MAAQ,SAAgBvQ,GAGnC,GAFAvC,EAAsB,iBAARuC,GACdvC,EAAOuC,EAAM,UACTA,EAAM,EAAG,OAAOvB,KAAKqG,OAAO9E,GAEhC,GAAsB,IAAlBvB,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKqG,MAAM9E,GACXvB,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAMqB,EAEG,IAAhBvB,KAAKG,QAAgBH,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAIiB,EAAI,EAAGA,EAAIlB,KAAKG,QAAUH,KAAKE,MAAMgB,GAAK,EAAGA,IACpDlB,KAAKE,MAAMgB,IAAM,SACjBlB,KAAKE,MAAMgB,EAAI,IAAM,EAIzB,OAAOlB,KAAKoC,OAChB,EAEEzC,EAAGF,UAAUsS,KAAO,SAAexQ,GACjC,OAAOvB,KAAKoD,QAAQiD,MAAM9E,EAC9B,EAEE5B,EAAGF,UAAUuS,KAAO,SAAezQ,GACjC,OAAOvB,KAAKoD,QAAQ0O,MAAMvQ,EAC9B,EAEE5B,EAAGF,UAAUwS,KAAO,WAGlB,OAFAjS,KAAKC,SAAW,EAETD,IACX,EAEEL,EAAGF,UAAU0G,IAAM,WACjB,OAAOnG,KAAKoD,QAAQ6O,MACxB,EAEEtS,EAAGF,UAAUyS,aAAe,SAAuB3Q,EAAKD,EAAK6Q,GAC3D,IACIjR,EAIAsB,EALAzB,EAAMQ,EAAIpB,OAASgS,EAGvBnS,KAAKqD,QAAQtC,GAGb,IAAImD,EAAQ,EACZ,IAAKhD,EAAI,EAAGA,EAAIK,EAAIpB,OAAQe,IAAK,CAC/BsB,GAA6B,EAAxBxC,KAAKE,MAAMgB,EAAIiR,IAAcjO,EAClC,IAAItC,GAAwB,EAAfL,EAAIrB,MAAMgB,IAAUI,EAEjC4C,IADA1B,GAAa,SAARZ,IACS,KAAQA,EAAQ,SAAa,GAC3C5B,KAAKE,MAAMgB,EAAIiR,GAAa,SAAJ3P,CACzB,CACD,KAAOtB,EAAIlB,KAAKG,OAASgS,EAAOjR,IAE9BgD,GADA1B,GAA6B,EAAxBxC,KAAKE,MAAMgB,EAAIiR,IAAcjO,IACrB,GACblE,KAAKE,MAAMgB,EAAIiR,GAAa,SAAJ3P,EAG1B,GAAc,IAAV0B,EAAa,OAAOlE,KAAKoC,QAK7B,IAFApD,GAAkB,IAAXkF,GACPA,EAAQ,EACHhD,EAAI,EAAGA,EAAIlB,KAAKG,OAAQe,IAE3BgD,GADA1B,IAAsB,EAAhBxC,KAAKE,MAAMgB,IAAUgD,IACd,GACblE,KAAKE,MAAMgB,GAAS,SAAJsB,EAIlB,OAFAxC,KAAKC,SAAW,EAETD,KAAKoC,OAChB,EAEEzC,EAAGF,UAAU2S,SAAW,SAAmB7Q,EAAK8Q,GAC9C,IAAIF,GAAQnS,KAAKG,OAASoB,EAAIpB,QAE1B4D,EAAI/D,KAAKoD,QACTY,EAAIzC,EAGJ+Q,EAA8B,EAAxBtO,EAAE9D,MAAM8D,EAAE7D,OAAS,GAGf,IADdgS,EAAQ,GADMnS,KAAK0F,WAAW4M,MAG5BtO,EAAIA,EAAEyN,MAAMU,GACZpO,EAAE8M,OAAOsB,GACTG,EAA8B,EAAxBtO,EAAE9D,MAAM8D,EAAE7D,OAAS,IAI3B,IACIoF,EADAiK,EAAIzL,EAAE5D,OAAS6D,EAAE7D,OAGrB,GAAa,QAATkS,EAAgB,EAClB9M,EAAI,IAAI5F,EAAG,OACTQ,OAASqP,EAAI,EACfjK,EAAErF,MAAYsB,MAAM+D,EAAEpF,QACtB,IAAK,IAAIe,EAAI,EAAGA,EAAIqE,EAAEpF,OAAQe,IAC5BqE,EAAErF,MAAMgB,GAAK,CAEhB,CAED,IAAIqR,EAAOxO,EAAEX,QAAQ8O,aAAalO,EAAG,EAAGwL,GAClB,IAAlB+C,EAAKtS,WACP8D,EAAIwO,EACAhN,IACFA,EAAErF,MAAMsP,GAAK,IAIjB,IAAK,IAAIjN,EAAIiN,EAAI,EAAGjN,GAAK,EAAGA,IAAK,CAC/B,IAAIiQ,EAAmC,UAAL,EAAxBzO,EAAE7D,MAAM8D,EAAE7D,OAASoC,KACE,EAA5BwB,EAAE7D,MAAM8D,EAAE7D,OAASoC,EAAI,IAO1B,IAHAiQ,EAAKxR,KAAKC,IAAKuR,EAAKF,EAAO,EAAG,UAE9BvO,EAAEmO,aAAalO,EAAGwO,EAAIjQ,GACA,IAAfwB,EAAE9D,UACPuS,IACAzO,EAAE9D,SAAW,EACb8D,EAAEmO,aAAalO,EAAG,EAAGzB,GAChBwB,EAAEW,WACLX,EAAE9D,UAAY,GAGdsF,IACFA,EAAErF,MAAMqC,GAAKiQ,EAEhB,CAWD,OAVIjN,GACFA,EAAEnD,QAEJ2B,EAAE3B,QAGW,QAATiQ,GAA4B,IAAVF,GACpBpO,EAAE0B,OAAO0M,GAGJ,CACLM,IAAKlN,GAAK,KACV1C,IAAKkB,EAEX,EAMEpE,EAAGF,UAAUiT,OAAS,SAAiBnR,EAAK8Q,EAAMM,GAGhD,OAFA3T,GAAQuC,EAAImD,UAER1E,KAAK0E,SACA,CACL+N,IAAK,IAAI9S,EAAG,GACZkD,IAAK,IAAIlD,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjBsB,EAAItB,UAC7BqF,EAAMtF,KAAK2G,MAAM+L,OAAOnR,EAAK8Q,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGH,QAAT0L,IACFxP,EAAMyC,EAAIzC,IAAI8D,MACVgM,GAA6B,IAAjB9P,EAAI5C,UAClB4C,EAAIgF,KAAKtG,IAIN,CACLkR,IAAKA,EACL5P,IAAKA,IAIa,IAAlB7C,KAAKC,UAAmC,IAAjBsB,EAAItB,UAC7BqF,EAAMtF,KAAK0S,OAAOnR,EAAIoF,MAAO0L,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGT,CACL8L,IAAKA,EACL5P,IAAKyC,EAAIzC,MAI0B,IAAlC7C,KAAKC,SAAWsB,EAAItB,WACvBqF,EAAMtF,KAAK2G,MAAM+L,OAAOnR,EAAIoF,MAAO0L,GAEtB,QAATA,IACFxP,EAAMyC,EAAIzC,IAAI8D,MACVgM,GAA6B,IAAjB9P,EAAI5C,UAClB4C,EAAIiF,KAAKvG,IAIN,CACLkR,IAAKnN,EAAImN,IACT5P,IAAKA,IAOLtB,EAAIpB,OAASH,KAAKG,QAAUH,KAAK6B,IAAIN,GAAO,EACvC,CACLkR,IAAK,IAAI9S,EAAG,GACZkD,IAAK7C,MAKU,IAAfuB,EAAIpB,OACO,QAATkS,EACK,CACLI,IAAKzS,KAAK4S,KAAKrR,EAAIrB,MAAM,IACzB2C,IAAK,MAII,QAATwP,EACK,CACLI,IAAK,KACL5P,IAAK,IAAIlD,EAAGK,KAAK2E,KAAKpD,EAAIrB,MAAM,MAI7B,CACLuS,IAAKzS,KAAK4S,KAAKrR,EAAIrB,MAAM,IACzB2C,IAAK,IAAIlD,EAAGK,KAAK2E,KAAKpD,EAAIrB,MAAM,MAI7BF,KAAKoS,SAAS7Q,EAAK8Q,GAlF1B,IAAII,EAAK5P,EAAKyC,CAmFlB,EAGE3F,EAAGF,UAAUgT,IAAM,SAAclR,GAC/B,OAAOvB,KAAK0S,OAAOnR,EAAK,OAAO,GAAOkR,GAC1C,EAGE9S,EAAGF,UAAUoD,IAAM,SAActB,GAC/B,OAAOvB,KAAK0S,OAAOnR,EAAK,OAAO,GAAOsB,GAC1C,EAEElD,EAAGF,UAAUoT,KAAO,SAAetR,GACjC,OAAOvB,KAAK0S,OAAOnR,EAAK,OAAO,GAAMsB,GACzC,EAGElD,EAAGF,UAAUqT,SAAW,SAAmBvR,GACzC,IAAIwR,EAAK/S,KAAK0S,OAAOnR,GAGrB,GAAIwR,EAAGlQ,IAAI6B,SAAU,OAAOqO,EAAGN,IAE/B,IAAI5P,EAA0B,IAApBkQ,EAAGN,IAAIxS,SAAiB8S,EAAGlQ,IAAIiF,KAAKvG,GAAOwR,EAAGlQ,IAEpDmQ,EAAOzR,EAAIoQ,MAAM,GACjBsB,EAAK1R,EAAIiE,MAAM,GACf3D,EAAMgB,EAAIhB,IAAImR,GAGlB,OAAInR,EAAM,GAAY,IAAPoR,GAAoB,IAARpR,EAAkBkR,EAAGN,IAGrB,IAApBM,EAAGN,IAAIxS,SAAiB8S,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIpM,MAAM,EAClE,EAEE1G,EAAGF,UAAUkF,KAAO,SAAepD,GACjCvC,EAAOuC,GAAO,UAId,IAHA,IAAIuN,GAAK,GAAK,IAAMvN,EAEhB2R,EAAM,EACDhS,EAAIlB,KAAKG,OAAS,EAAGe,GAAK,EAAGA,IACpCgS,GAAOpE,EAAIoE,GAAuB,EAAhBlT,KAAKE,MAAMgB,KAAWK,EAG1C,OAAO2R,CACX,EAGEvT,EAAGF,UAAUmF,MAAQ,SAAgBrD,GACnCvC,EAAOuC,GAAO,UAGd,IADA,IAAI2C,EAAQ,EACHhD,EAAIlB,KAAKG,OAAS,EAAGe,GAAK,EAAGA,IAAK,CACzC,IAAIsB,GAAqB,EAAhBxC,KAAKE,MAAMgB,IAAkB,SAARgD,EAC9BlE,KAAKE,MAAMgB,GAAMsB,EAAIjB,EAAO,EAC5B2C,EAAQ1B,EAAIjB,CACb,CAED,OAAOvB,KAAKoC,OAChB,EAEEzC,EAAGF,UAAUmT,KAAO,SAAerR,GACjC,OAAOvB,KAAKoD,QAAQwB,MAAMrD,EAC9B,EAEE5B,EAAGF,UAAU0T,KAAO,SAAerE,GACjC9P,EAAsB,IAAf8P,EAAE7O,UACTjB,GAAQ8P,EAAEpK,UAEV,IAAI6I,EAAIvN,KACJwN,EAAIsB,EAAE1L,QAGRmK,EADiB,IAAfA,EAAEtN,SACAsN,EAAEsF,KAAK/D,GAEPvB,EAAEnK,QAaR,IATA,IAAIgQ,EAAI,IAAIzT,EAAG,GACX0T,EAAI,IAAI1T,EAAG,GAGX2T,EAAI,IAAI3T,EAAG,GACX4T,EAAI,IAAI5T,EAAG,GAEX6T,EAAI,EAEDjG,EAAEkG,UAAYjG,EAAEiG,UACrBlG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP+N,EAMJ,IAHA,IAAIE,EAAKlG,EAAEpK,QACPuQ,EAAKpG,EAAEnK,SAEHmK,EAAE7I,UAAU,CAClB,IAAK,IAAIxD,EAAI,EAAG0S,EAAK,EAAyB,IAArBrG,EAAErN,MAAM,GAAK0T,IAAa1S,EAAI,KAAMA,EAAG0S,IAAO,GACvE,GAAI1S,EAAI,EAEN,IADAqM,EAAE9H,OAAOvE,GACFA,KAAM,IACPkS,EAAES,SAAWR,EAAEQ,WACjBT,EAAEvL,KAAK6L,GACPL,EAAEvL,KAAK6L,IAGTP,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIb,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArBtG,EAAEtN,MAAM,GAAK4T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAiL,EAAE/H,OAAOlD,GACFA,KAAM,IACP+Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAEzL,KAAK6L,GACPH,EAAEzL,KAAK6L,IAGTL,EAAE7N,OAAO,GACT8N,EAAE9N,OAAO,GAIT8H,EAAE1L,IAAI2L,IAAM,GACdD,EAAEzF,KAAK0F,GACP4F,EAAEtL,KAAKwL,GACPD,EAAEvL,KAAKyL,KAEP/F,EAAE1F,KAAKyF,GACP+F,EAAExL,KAAKsL,GACPG,EAAEzL,KAAKuL,GAEV,CAED,MAAO,CACLtP,EAAGuP,EACHtP,EAAGuP,EACHQ,IAAKvG,EAAEqD,OAAO2C,GAEpB,EAKE7T,EAAGF,UAAUuU,OAAS,SAAiBlF,GACrC9P,EAAsB,IAAf8P,EAAE7O,UACTjB,GAAQ8P,EAAEpK,UAEV,IAAIX,EAAI/D,KACJgE,EAAI8K,EAAE1L,QAGRW,EADiB,IAAfA,EAAE9D,SACA8D,EAAE8O,KAAK/D,GAEP/K,EAAEX,QAQR,IALA,IAuCIkC,EAvCA2O,EAAK,IAAItU,EAAG,GACZuU,EAAK,IAAIvU,EAAG,GAEZwU,EAAQnQ,EAAEZ,QAEPW,EAAEqQ,KAAK,GAAK,GAAKpQ,EAAEoQ,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIlT,EAAI,EAAG0S,EAAK,EAAyB,IAArB7P,EAAE7D,MAAM,GAAK0T,IAAa1S,EAAI,KAAMA,EAAG0S,IAAO,GACvE,GAAI1S,EAAI,EAEN,IADA6C,EAAE0B,OAAOvE,GACFA,KAAM,GACP+S,EAAGJ,SACLI,EAAGpM,KAAKsM,GAGVF,EAAGxO,OAAO,GAId,IAAK,IAAIlD,EAAI,EAAGuR,EAAK,EAAyB,IAArB9P,EAAE9D,MAAM,GAAK4T,IAAavR,EAAI,KAAMA,EAAGuR,IAAO,GACvE,GAAIvR,EAAI,EAEN,IADAyB,EAAEyB,OAAOlD,GACFA,KAAM,GACP2R,EAAGL,SACLK,EAAGrM,KAAKsM,GAGVD,EAAGzO,OAAO,GAIV1B,EAAElC,IAAImC,IAAM,GACdD,EAAE+D,KAAK9D,GACPiQ,EAAGnM,KAAKoM,KAERlQ,EAAE8D,KAAK/D,GACPmQ,EAAGpM,KAAKmM,GAEX,CAaD,OATE3O,EADgB,IAAdvB,EAAEqQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB9O,EAAIuC,KAAKiH,GAGJxJ,CACX,EAEE3F,EAAGF,UAAUsU,IAAM,SAAcxS,GAC/B,GAAIvB,KAAK0E,SAAU,OAAOnD,EAAI4E,MAC9B,GAAI5E,EAAImD,SAAU,OAAO1E,KAAKmG,MAE9B,IAAIpC,EAAI/D,KAAKoD,QACTY,EAAIzC,EAAI6B,QACZW,EAAE9D,SAAW,EACb+D,EAAE/D,SAAW,EAGb,IAAK,IAAIkS,EAAQ,EAAGpO,EAAE0P,UAAYzP,EAAEyP,SAAUtB,IAC5CpO,EAAE0B,OAAO,GACTzB,EAAEyB,OAAO,GAGX,OAAG,CACD,KAAO1B,EAAE0P,UACP1P,EAAE0B,OAAO,GAEX,KAAOzB,EAAEyP,UACPzP,EAAEyB,OAAO,GAGX,IAAI3E,EAAIiD,EAAElC,IAAImC,GACd,GAAIlD,EAAI,EAAG,CAET,IAAI8E,EAAI7B,EACRA,EAAIC,EACJA,EAAI4B,CACZ,MAAa,GAAU,IAAN9E,GAAyB,IAAdkD,EAAEoQ,KAAK,GAC3B,MAGFrQ,EAAE+D,KAAK9D,EACR,CAED,OAAOA,EAAE6M,OAAOsB,EACpB,EAGExS,EAAGF,UAAU4U,KAAO,SAAe9S,GACjC,OAAOvB,KAAKmT,KAAK5R,GAAKwC,EAAE8O,KAAKtR,EACjC,EAEE5B,EAAGF,UAAUgU,OAAS,WACpB,OAA+B,IAAP,EAAhBzT,KAAKE,MAAM,GACvB,EAEEP,EAAGF,UAAUoU,MAAQ,WACnB,OAA+B,IAAP,EAAhB7T,KAAKE,MAAM,GACvB,EAGEP,EAAGF,UAAU+F,MAAQ,SAAgBjE,GACnC,OAAOvB,KAAKE,MAAM,GAAKqB,CAC3B,EAGE5B,EAAGF,UAAU6U,MAAQ,SAAgB3M,GACnC3I,EAAsB,iBAAR2I,GACd,IAAI7G,EAAI6G,EAAM,GACV6G,GAAK7G,EAAM7G,GAAK,GAChByE,EAAI,GAAKzE,EAGb,GAAId,KAAKG,QAAUqO,EAGjB,OAFAxO,KAAKqD,QAAQmL,EAAI,GACjBxO,KAAKE,MAAMsO,IAAMjJ,EACVvF,KAKT,IADA,IAAIkE,EAAQqB,EACHrE,EAAIsN,EAAa,IAAVtK,GAAehD,EAAIlB,KAAKG,OAAQe,IAAK,CACnD,IAAIsB,EAAoB,EAAhBxC,KAAKE,MAAMgB,GAEnBgD,GADA1B,GAAK0B,KACS,GACd1B,GAAK,SACLxC,KAAKE,MAAMgB,GAAKsB,CACjB,CAKD,OAJc,IAAV0B,IACFlE,KAAKE,MAAMgB,GAAKgD,EAChBlE,KAAKG,UAEAH,IACX,EAEEL,EAAGF,UAAUiF,OAAS,WACpB,OAAuB,IAAhB1E,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,EAC3C,EAEEP,EAAGF,UAAU2U,KAAO,SAAe7S,GACjC,IAOI+D,EAPArF,EAAWsB,EAAM,EAErB,GAAsB,IAAlBvB,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAKoC,QAGDpC,KAAKG,OAAS,EAChBmF,EAAM,MACD,CACDrF,IACFsB,GAAOA,GAGTvC,EAAOuC,GAAO,SAAW,qBAEzB,IAAIiB,EAAoB,EAAhBxC,KAAKE,MAAM,GACnBoF,EAAM9C,IAAMjB,EAAM,EAAIiB,EAAIjB,GAAO,EAAI,CACtC,CACD,OAAsB,IAAlBvB,KAAKC,SAA8B,GAANqF,EAC1BA,CACX,EAME3F,EAAGF,UAAUoC,IAAM,SAAcN,GAC/B,GAAsB,IAAlBvB,KAAKC,UAAmC,IAAjBsB,EAAItB,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjBsB,EAAItB,SAAgB,OAAO,EAEtD,IAAIqF,EAAMtF,KAAKuU,KAAKhT,GACpB,OAAsB,IAAlBvB,KAAKC,SAA8B,GAANqF,EAC1BA,CACX,EAGE3F,EAAGF,UAAU8U,KAAO,SAAehT,GAEjC,GAAIvB,KAAKG,OAASoB,EAAIpB,OAAQ,OAAO,EACrC,GAAIH,KAAKG,OAASoB,EAAIpB,OAAQ,OAAQ,EAGtC,IADA,IAAImF,EAAM,EACDpE,EAAIlB,KAAKG,OAAS,EAAGe,GAAK,EAAGA,IAAK,CACzC,IAAI6C,EAAoB,EAAhB/D,KAAKE,MAAMgB,GACf8C,EAAmB,EAAfzC,EAAIrB,MAAMgB,GAElB,GAAI6C,IAAMC,EAAV,CACID,EAAIC,EACNsB,GAAO,EACEvB,EAAIC,IACbsB,EAAM,GAER,KANsB,CAOvB,CACD,OAAOA,CACX,EAEE3F,EAAGF,UAAU+U,IAAM,SAAcjT,GAC/B,OAA0B,IAAnBvB,KAAKoU,KAAK7S,EACrB,EAEE5B,EAAGF,UAAUgV,GAAK,SAAalT,GAC7B,OAAyB,IAAlBvB,KAAK6B,IAAIN,EACpB,EAEE5B,EAAGF,UAAUiV,KAAO,SAAenT,GACjC,OAAOvB,KAAKoU,KAAK7S,IAAQ,CAC7B,EAEE5B,EAAGF,UAAUkV,IAAM,SAAcpT,GAC/B,OAAOvB,KAAK6B,IAAIN,IAAQ,CAC5B,EAEE5B,EAAGF,UAAUmV,IAAM,SAAcrT,GAC/B,OAA2B,IAApBvB,KAAKoU,KAAK7S,EACrB,EAEE5B,EAAGF,UAAUoV,GAAK,SAAatT,GAC7B,OAA0B,IAAnBvB,KAAK6B,IAAIN,EACpB,EAEE5B,EAAGF,UAAUqV,KAAO,SAAevT,GACjC,OAAOvB,KAAKoU,KAAK7S,IAAQ,CAC7B,EAEE5B,EAAGF,UAAUsV,IAAM,SAAcxT,GAC/B,OAAOvB,KAAK6B,IAAIN,IAAQ,CAC5B,EAEE5B,EAAGF,UAAUuV,IAAM,SAAczT,GAC/B,OAA0B,IAAnBvB,KAAKoU,KAAK7S,EACrB,EAEE5B,EAAGF,UAAUwV,GAAK,SAAa1T,GAC7B,OAAyB,IAAlBvB,KAAK6B,IAAIN,EACpB,EAME5B,EAAGS,IAAM,SAAcmB,GACrB,OAAO,IAAI2T,EAAI3T,EACnB,EAEE5B,EAAGF,UAAU0V,MAAQ,SAAgBC,GAGnC,OAFApW,GAAQgB,KAAKI,IAAK,yCAClBpB,EAAyB,IAAlBgB,KAAKC,SAAgB,iCACrBmV,EAAIC,UAAUrV,MAAMsV,UAAUF,EACzC,EAEEzV,EAAGF,UAAU8V,QAAU,WAErB,OADAvW,EAAOgB,KAAKI,IAAK,wDACVJ,KAAKI,IAAIoV,YAAYxV,KAChC,EAEEL,EAAGF,UAAU6V,UAAY,SAAoBF,GAE3C,OADApV,KAAKI,IAAMgV,EACJpV,IACX,EAEEL,EAAGF,UAAUgW,SAAW,SAAmBL,GAEzC,OADApW,GAAQgB,KAAKI,IAAK,yCACXJ,KAAKsV,UAAUF,EAC1B,EAEEzV,EAAGF,UAAUiW,OAAS,SAAiBnU,GAErC,OADAvC,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAI2H,IAAI/H,KAAMuB,EAC9B,EAEE5B,EAAGF,UAAUkW,QAAU,SAAkBpU,GAEvC,OADAvC,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIyH,KAAK7H,KAAMuB,EAC/B,EAEE5B,EAAGF,UAAUmW,OAAS,SAAiBrU,GAErC,OADAvC,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAI4H,IAAIhI,KAAMuB,EAC9B,EAEE5B,EAAGF,UAAUoW,QAAU,SAAkBtU,GAEvC,OADAvC,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAI0H,KAAK9H,KAAMuB,EAC/B,EAEE5B,EAAGF,UAAUqW,OAAS,SAAiBvU,GAErC,OADAvC,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAI2V,IAAI/V,KAAMuB,EAC9B,EAEE5B,EAAGF,UAAUuW,OAAS,SAAiBzU,GAGrC,OAFAvC,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI6V,SAASjW,KAAMuB,GACjBvB,KAAKI,IAAIkB,IAAItB,KAAMuB,EAC9B,EAEE5B,EAAGF,UAAUyW,QAAU,SAAkB3U,GAGvC,OAFAvC,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI6V,SAASjW,KAAMuB,GACjBvB,KAAKI,IAAI6L,KAAKjM,KAAMuB,EAC/B,EAEE5B,EAAGF,UAAU0W,OAAS,WAGpB,OAFAnX,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIgW,SAASpW,MACXA,KAAKI,IAAIsQ,IAAI1Q,KACxB,EAEEL,EAAGF,UAAU4W,QAAU,WAGrB,OAFArX,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIgW,SAASpW,MACXA,KAAKI,IAAIuQ,KAAK3Q,KACzB,EAGEL,EAAGF,UAAU6W,QAAU,WAGrB,OAFAtX,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIgW,SAASpW,MACXA,KAAKI,IAAImW,KAAKvW,KACzB,EAEEL,EAAGF,UAAU+W,QAAU,WAGrB,OAFAxX,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIgW,SAASpW,MACXA,KAAKI,IAAIiU,KAAKrU,KACzB,EAGEL,EAAGF,UAAUgX,OAAS,WAGpB,OAFAzX,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIgW,SAASpW,MACXA,KAAKI,IAAIuG,IAAI3G,KACxB,EAEEL,EAAGF,UAAUiX,OAAS,SAAiBnV,GAGrC,OAFAvC,EAAOgB,KAAKI,MAAQmB,EAAInB,IAAK,qBAC7BJ,KAAKI,IAAIgW,SAASpW,MACXA,KAAKI,IAAI6C,IAAIjD,KAAMuB,EAC9B,EAGE,IAAIoV,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMnI,GAErB9O,KAAKiX,KAAOA,EACZjX,KAAK8O,EAAI,IAAInP,EAAGmP,EAAG,IACnB9O,KAAKuP,EAAIvP,KAAK8O,EAAEhJ,YAChB9F,KAAKmE,EAAI,IAAIxE,EAAG,GAAGkR,OAAO7Q,KAAKuP,GAAGzH,KAAK9H,KAAK8O,GAE5C9O,KAAKkX,IAAMlX,KAAKmX,MACjB,CA0CD,SAASC,IACPJ,EAAOK,KACLrX,KACA,OACA,0EACH,CA8DD,SAASsX,IACPN,EAAOK,KACLrX,KACA,OACA,iEACH,CAGD,SAASuX,IACPP,EAAOK,KACLrX,KACA,OACA,wDACH,CAGD,SAASwX,IAEPR,EAAOK,KACLrX,KACA,QACA,sEACH,CA6CD,SAASkV,EAAK1F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIiI,EAAQ9X,EAAG+X,OAAOlI,GACtBxP,KAAKwP,EAAIiI,EAAM3I,EACf9O,KAAKyX,MAAQA,CACnB,MACMzY,EAAOwQ,EAAEgF,IAAI,GAAI,kCACjBxU,KAAKwP,EAAIA,EACTxP,KAAKyX,MAAQ,IAEhB,CAgOD,SAASE,EAAMnI,GACb0F,EAAImC,KAAKrX,KAAMwP,GAEfxP,KAAKmS,MAAQnS,KAAKwP,EAAE1J,YAChB9F,KAAKmS,MAAQ,IAAO,IACtBnS,KAAKmS,OAAS,GAAMnS,KAAKmS,MAAQ,IAGnCnS,KAAKc,EAAI,IAAInB,EAAG,GAAGkR,OAAO7Q,KAAKmS,OAC/BnS,KAAKiT,GAAKjT,KAAK4X,KAAK5X,KAAKc,EAAE4P,OAC3B1Q,KAAK6X,KAAO7X,KAAKc,EAAEkT,OAAOhU,KAAKwP,GAE/BxP,KAAK8X,KAAO9X,KAAK6X,KAAKvW,IAAItB,KAAKc,GAAGgR,MAAM,GAAGW,IAAIzS,KAAKwP,GACpDxP,KAAK8X,KAAO9X,KAAK8X,KAAKjF,KAAK7S,KAAKc,GAChCd,KAAK8X,KAAO9X,KAAKc,EAAEkH,IAAIhI,KAAK8X,KAC7B,CAvaDd,EAAOvX,UAAU0X,KAAO,WACtB,IAAID,EAAM,IAAIvX,EAAG,MAEjB,OADAuX,EAAIhX,MAAYsB,MAAMR,KAAKsB,KAAKtC,KAAKuP,EAAI,KAClC2H,CACX,EAEEF,EAAOvX,UAAUsY,QAAU,SAAkBxW,GAG3C,IACIyW,EADAlX,EAAIS,EAGR,GACEvB,KAAKiY,MAAMnX,EAAGd,KAAKkX,KAGnBc,GADAlX,GADAA,EAAId,KAAKkY,MAAMpX,IACT+G,KAAK7H,KAAKkX,MACPpR,kBACFkS,EAAOhY,KAAKuP,GAErB,IAAI1N,EAAMmW,EAAOhY,KAAKuP,GAAK,EAAIzO,EAAEyT,KAAKvU,KAAK8O,GAU3C,OATY,IAARjN,GACFf,EAAEZ,MAAM,GAAK,EACbY,EAAEX,OAAS,GACF0B,EAAM,EACff,EAAEgH,KAAK9H,KAAK8O,GAEZhO,EAAEsB,QAGGtB,CACX,EAEEkW,EAAOvX,UAAUwY,MAAQ,SAAgBE,EAAOrU,GAC9CqU,EAAM1S,OAAOzF,KAAKuP,EAAG,EAAGzL,EAC5B,EAEEkT,EAAOvX,UAAUyY,MAAQ,SAAgB3W,GACvC,OAAOA,EAAI0K,KAAKjM,KAAKmE,EACzB,EAQE/E,EAASgY,EAAMJ,GAEfI,EAAK3X,UAAUwY,MAAQ,SAAgBE,EAAOC,GAK5C,IAHA,IAAI/G,EAAO,QAEPgH,EAASrX,KAAKC,IAAIkX,EAAMhY,OAAQ,GAC3Be,EAAI,EAAGA,EAAImX,EAAQnX,IAC1BkX,EAAOlY,MAAMgB,GAAKiX,EAAMjY,MAAMgB,GAIhC,GAFAkX,EAAOjY,OAASkY,EAEZF,EAAMhY,QAAU,EAGlB,OAFAgY,EAAMjY,MAAM,GAAK,OACjBiY,EAAMhY,OAAS,GAKjB,IAAImY,EAAOH,EAAMjY,MAAM,GAGvB,IAFAkY,EAAOlY,MAAMkY,EAAOjY,UAAYmY,EAAOjH,EAElCnQ,EAAI,GAAIA,EAAIiX,EAAMhY,OAAQe,IAAK,CAClC,IAAIqX,EAAwB,EAAjBJ,EAAMjY,MAAMgB,GACvBiX,EAAMjY,MAAMgB,EAAI,KAAQqX,EAAOlH,IAAS,EAAMiH,IAAS,GACvDA,EAAOC,CACR,CACDD,KAAU,GACVH,EAAMjY,MAAMgB,EAAI,IAAMoX,EACT,IAATA,GAAcH,EAAMhY,OAAS,GAC/BgY,EAAMhY,QAAU,GAEhBgY,EAAMhY,QAAU,CAEtB,EAEEiX,EAAK3X,UAAUyY,MAAQ,SAAgB3W,GAErCA,EAAIrB,MAAMqB,EAAIpB,QAAU,EACxBoB,EAAIrB,MAAMqB,EAAIpB,OAAS,GAAK,EAC5BoB,EAAIpB,QAAU,EAId,IADA,IAAI8D,EAAK,EACA/C,EAAI,EAAGA,EAAIK,EAAIpB,OAAQe,IAAK,CACnC,IAAIsB,EAAmB,EAAfjB,EAAIrB,MAAMgB,GAClB+C,GAAU,IAAJzB,EACNjB,EAAIrB,MAAMgB,GAAU,SAAL+C,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,EACrC,CASD,OANkC,IAA9B1C,EAAIrB,MAAMqB,EAAIpB,OAAS,KACzBoB,EAAIpB,SAC8B,IAA9BoB,EAAIrB,MAAMqB,EAAIpB,OAAS,IACzBoB,EAAIpB,UAGDoB,CACX,EAQEnC,EAASkY,EAAMN,GAQf5X,EAASmY,EAAMP,GASf5X,EAASoY,EAAQR,GAEjBQ,EAAO/X,UAAUyY,MAAQ,SAAgB3W,GAGvC,IADA,IAAI2C,EAAQ,EACHhD,EAAI,EAAGA,EAAIK,EAAIpB,OAAQe,IAAK,CACnC,IAAI6E,EAA0B,IAAL,EAAfxE,EAAIrB,MAAMgB,IAAiBgD,EACjCD,EAAU,SAAL8B,EACTA,KAAQ,GAERxE,EAAIrB,MAAMgB,GAAK+C,EACfC,EAAQ6B,CACT,CAID,OAHc,IAAV7B,IACF3C,EAAIrB,MAAMqB,EAAIpB,UAAY+D,GAErB3C,CACX,EAGE5B,EAAG+X,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAU9X,MAAM,iBAAmB8X,GAFnCQ,EAAQ,IAAID,CAGb,CAGD,OAFAb,EAAOM,GAAQQ,EAERA,CACX,EAiBEvC,EAAIzV,UAAU2W,SAAW,SAAmBrS,GAC1C/E,EAAsB,IAAf+E,EAAE9D,SAAgB,iCACzBjB,EAAO+E,EAAE3D,IAAK,kCAClB,EAEE8U,EAAIzV,UAAUwW,SAAW,SAAmBlS,EAAGC,GAC7ChF,EAAqC,IAA7B+E,EAAE9D,SAAW+D,EAAE/D,UAAiB,iCACxCjB,EAAO+E,EAAE3D,KAAO2D,EAAE3D,MAAQ4D,EAAE5D,IAC1B,kCACN,EAEE8U,EAAIzV,UAAUmY,KAAO,SAAe7T,GAClC,OAAI/D,KAAKyX,MAAczX,KAAKyX,MAAMM,QAAQhU,GAAGuR,UAAUtV,MAChD+D,EAAE8O,KAAK7S,KAAKwP,GAAG8F,UAAUtV,KACpC,EAEEkV,EAAIzV,UAAUkH,IAAM,SAAc5C,GAChC,OAAIA,EAAEW,SACGX,EAAEX,QAGJpD,KAAKwP,EAAExH,IAAIjE,GAAGuR,UAAUtV,KACnC,EAEEkV,EAAIzV,UAAUsI,IAAM,SAAchE,EAAGC,GACnChE,KAAKiW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEgE,IAAI/D,GAIhB,OAHIsB,EAAIzD,IAAI7B,KAAKwP,IAAM,GACrBlK,EAAIwC,KAAK9H,KAAKwP,GAETlK,EAAIgQ,UAAUtV,KACzB,EAEEkV,EAAIzV,UAAUoI,KAAO,SAAe9D,EAAGC,GACrChE,KAAKiW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE8D,KAAK7D,GAIjB,OAHIsB,EAAIzD,IAAI7B,KAAKwP,IAAM,GACrBlK,EAAIwC,KAAK9H,KAAKwP,GAETlK,CACX,EAEE4P,EAAIzV,UAAUuI,IAAM,SAAcjE,EAAGC,GACnChE,KAAKiW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAEiE,IAAIhE,GAIhB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK7H,KAAKwP,GAETlK,EAAIgQ,UAAUtV,KACzB,EAEEkV,EAAIzV,UAAUqI,KAAO,SAAe/D,EAAGC,GACrChE,KAAKiW,SAASlS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE+D,KAAK9D,GAIjB,OAHIsB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAK7H,KAAKwP,GAETlK,CACX,EAEE4P,EAAIzV,UAAUsW,IAAM,SAAchS,EAAGxC,GAEnC,OADAvB,KAAKoW,SAASrS,GACP/D,KAAK4X,KAAK7T,EAAE0N,MAAMlQ,GAC7B,EAEE2T,EAAIzV,UAAUwM,KAAO,SAAelI,EAAGC,GAErC,OADAhE,KAAKiW,SAASlS,EAAGC,GACVhE,KAAK4X,KAAK7T,EAAEkI,KAAKjI,GAC5B,EAEEkR,EAAIzV,UAAU6B,IAAM,SAAcyC,EAAGC,GAEnC,OADAhE,KAAKiW,SAASlS,EAAGC,GACVhE,KAAK4X,KAAK7T,EAAEzC,IAAI0C,GAC3B,EAEEkR,EAAIzV,UAAUkR,KAAO,SAAe5M,GAClC,OAAO/D,KAAKiM,KAAKlI,EAAGA,EAAEX,QAC1B,EAEE8R,EAAIzV,UAAUiR,IAAM,SAAc3M,GAChC,OAAO/D,KAAKsB,IAAIyC,EAAGA,EACvB,EAEEmR,EAAIzV,UAAU8W,KAAO,SAAexS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEX,QAEzB,IAAIoV,EAAOxY,KAAKwP,EAAEhK,MAAM,GAIxB,GAHAxG,EAAOwZ,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIvV,EAAMjD,KAAKwP,EAAEzH,IAAI,IAAIpI,EAAG,IAAI8F,OAAO,GACvC,OAAOzF,KAAKiD,IAAIc,EAAGd,EACpB,CAOD,IAFA,IAAIsC,EAAIvF,KAAKwP,EAAEwC,KAAK,GAChBxD,EAAI,GACAjJ,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXzG,GAAQuG,EAAEb,UAEV,IAAI+T,EAAM,IAAI9Y,EAAG,GAAGwV,MAAMnV,MACtB0Y,EAAOD,EAAIhC,SAIXkC,EAAO3Y,KAAKwP,EAAEwC,KAAK,GAAGvM,OAAO,GAC7BmT,EAAI5Y,KAAKwP,EAAE1J,YAGf,IAFA8S,EAAI,IAAIjZ,EAAG,EAAIiZ,EAAIA,GAAGzD,MAAMnV,MAEW,IAAhCA,KAAKiD,IAAI2V,EAAGD,GAAM9W,IAAI6W,IAC3BE,EAAEjD,QAAQ+C,GAOZ,IAJA,IAAIvX,EAAInB,KAAKiD,IAAI2V,EAAGrT,GAChBzE,EAAId,KAAKiD,IAAIc,EAAGwB,EAAEwM,KAAK,GAAGtM,OAAO,IACjCG,EAAI5F,KAAKiD,IAAIc,EAAGwB,GAChBiK,EAAIhB,EACc,IAAf5I,EAAE/D,IAAI4W,IAAY,CAEvB,IADA,IAAIvB,EAAMtR,EACD1E,EAAI,EAAoB,IAAjBgW,EAAIrV,IAAI4W,GAAYvX,IAClCgW,EAAMA,EAAIf,SAEZnX,EAAOkC,EAAIsO,GACX,IAAIxL,EAAIhE,KAAKiD,IAAI9B,EAAG,IAAIxB,EAAG,GAAGkR,OAAOrB,EAAItO,EAAI,IAE7CJ,EAAIA,EAAEkV,OAAOhS,GACb7C,EAAI6C,EAAEmS,SACNvQ,EAAIA,EAAEoQ,OAAO7U,GACbqO,EAAItO,CACL,CAED,OAAOJ,CACX,EAEEoU,EAAIzV,UAAU4U,KAAO,SAAetQ,GAClC,IAAI8U,EAAM9U,EAAEiQ,OAAOhU,KAAKwP,GACxB,OAAqB,IAAjBqJ,EAAI5Y,UACN4Y,EAAI5Y,SAAW,EACRD,KAAK4X,KAAKiB,GAAKpC,UAEfzW,KAAK4X,KAAKiB,EAEvB,EAEE3D,EAAIzV,UAAUwD,IAAM,SAAcc,EAAGxC,GACnC,GAAIA,EAAImD,SAAU,OAAO,IAAI/E,EAAG,GAAGwV,MAAMnV,MACzC,GAAoB,IAAhBuB,EAAI6S,KAAK,GAAU,OAAOrQ,EAAEX,QAEhC,IACI0V,EAAUtX,MAAM,IACpBsX,EAAI,GAAK,IAAInZ,EAAG,GAAGwV,MAAMnV,MACzB8Y,EAAI,GAAK/U,EACT,IAAK,IAAI7C,EAAI,EAAGA,EAAI4X,EAAI3Y,OAAQe,IAC9B4X,EAAI5X,GAAKlB,KAAKsB,IAAIwX,EAAI5X,EAAI,GAAI6C,GAGhC,IAAIuB,EAAMwT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbpY,EAAQW,EAAIuE,YAAc,GAK9B,IAJc,IAAVlF,IACFA,EAAQ,IAGLM,EAAIK,EAAIpB,OAAS,EAAGe,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI4B,EAAOvB,EAAIrB,MAAMgB,GACZqB,EAAI3B,EAAQ,EAAG2B,GAAK,EAAGA,IAAK,CACnC,IAAIoF,EAAO7E,GAAQP,EAAK,EACpB+C,IAAQwT,EAAI,KACdxT,EAAMtF,KAAK0Q,IAAIpL,IAGL,IAARqC,GAAyB,IAAZoR,GAKjBA,IAAY,EACZA,GAAWpR,GA9BE,KA+BbqR,GACwC,IAAN9X,GAAiB,IAANqB,KAE7C+C,EAAMtF,KAAKsB,IAAIgE,EAAKwT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYhB,CACDpY,EAAQ,EACT,CAED,OAAO0E,CACX,EAEE4P,EAAIzV,UAAU4V,UAAY,SAAoB9T,GAC5C,IAAIT,EAAIS,EAAIsR,KAAK7S,KAAKwP,GAEtB,OAAO1O,IAAMS,EAAMT,EAAEsC,QAAUtC,CACnC,EAEEoU,EAAIzV,UAAU+V,YAAc,SAAsBjU,GAChD,IAAI+D,EAAM/D,EAAI6B,QAEd,OADAkC,EAAIlF,IAAM,KACHkF,CACX,EAME3F,EAAGsZ,KAAO,SAAe1X,GACvB,OAAO,IAAIoW,EAAKpW,EACpB,EAkBEnC,EAASuY,EAAMzC,GAEfyC,EAAKlY,UAAU4V,UAAY,SAAoB9T,GAC7C,OAAOvB,KAAK4X,KAAKrW,EAAIkQ,MAAMzR,KAAKmS,OACpC,EAEEwF,EAAKlY,UAAU+V,YAAc,SAAsBjU,GACjD,IAAIT,EAAId,KAAK4X,KAAKrW,EAAID,IAAItB,KAAK6X,OAE/B,OADA/W,EAAEV,IAAM,KACDU,CACX,EAEE6W,EAAKlY,UAAUwM,KAAO,SAAelI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE7D,MAAM,GAAK,EACb6D,EAAE5D,OAAS,EACJ4D,EAGT,IAAI6B,EAAI7B,EAAEkI,KAAKjI,GACX7C,EAAIyE,EAAEiM,MAAM7R,KAAKmS,OAAO7Q,IAAItB,KAAK8X,MAAMlG,OAAO5R,KAAKmS,OAAO7Q,IAAItB,KAAKwP,GACnE0J,EAAItT,EAAEkC,KAAK3G,GAAGsE,OAAOzF,KAAKmS,OAC1B7M,EAAM4T,EAQV,OANIA,EAAErX,IAAI7B,KAAKwP,IAAM,EACnBlK,EAAM4T,EAAEpR,KAAK9H,KAAKwP,GACT0J,EAAE9E,KAAK,GAAK,IACrB9O,EAAM4T,EAAErR,KAAK7H,KAAKwP,IAGblK,EAAIgQ,UAAUtV,KACzB,EAEE2X,EAAKlY,UAAU6B,IAAM,SAAcyC,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI/E,EAAG,GAAG2V,UAAUtV,MAEzD,IAAI4F,EAAI7B,EAAEzC,IAAI0C,GACV7C,EAAIyE,EAAEiM,MAAM7R,KAAKmS,OAAO7Q,IAAItB,KAAK8X,MAAMlG,OAAO5R,KAAKmS,OAAO7Q,IAAItB,KAAKwP,GACnE0J,EAAItT,EAAEkC,KAAK3G,GAAGsE,OAAOzF,KAAKmS,OAC1B7M,EAAM4T,EAOV,OANIA,EAAErX,IAAI7B,KAAKwP,IAAM,EACnBlK,EAAM4T,EAAEpR,KAAK9H,KAAKwP,GACT0J,EAAE9E,KAAK,GAAK,IACrB9O,EAAM4T,EAAErR,KAAK7H,KAAKwP,IAGblK,EAAIgQ,UAAUtV,KACzB,EAEE2X,EAAKlY,UAAU4U,KAAO,SAAetQ,GAGnC,OADU/D,KAAK4X,KAAK7T,EAAEiQ,OAAOhU,KAAKwP,GAAGlO,IAAItB,KAAKiT,KACnCqC,UAAUtV,KACzB,CACC,CAl2GD","x_google_ignoreList":[0]}