{"remainingRequest":"/data/node_modules/babel-loader/lib/index.js!/data/node_modules/jsbn/index.js","dependencies":[{"path":"/data/node_modules/jsbn/index.js","mtime":1553611386612},{"path":"/data/.babelrc","mtime":1553611371556},{"path":"/data/node_modules/cache-loader/dist/cjs.js","mtime":1553611387012},{"path":"/data/node_modules/babel-loader/lib/index.js","mtime":1553611386992}],"contextDependencies":[],"result":["\"use strict\";\n\n(function () {\n\n // Copyright (c) 2005 Tom Wu\n // All Rights Reserved.\n // See \"LICENSE\" for details.\n\n // Basic JavaScript BN library - subset useful for RSA encryption.\n\n // Bits per digit\n var dbits;\n\n // JavaScript engine analysis\n var canary = 0xdeadbeefcafe;\n var j_lm = (canary & 0xffffff) == 0xefcafe;\n\n // (public) Constructor\n function BigInteger(a, b, c) {\n if (a != null) if (\"number\" == typeof a) this.fromNumber(a, b, c);else if (b == null && \"string\" != typeof a) this.fromString(a, 256);else this.fromString(a, b);\n }\n\n // return new, unset BigInteger\n function nbi() {\n return new BigInteger(null);\n }\n\n // am: Compute w_j += (x*this_i), propagate carries,\n // c is initial carry, returns final carry.\n // c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n // We need to select the fastest one that works in this environment.\n\n // am1: use a single mult and divide to get the high bits,\n // max digit bits should be 26 because\n // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\n function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }\n // am2 avoids a big mult-and-extract completely.\n // Max digit bits should be <= 30 because we do bitwise ops\n // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\n function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }\n // Alternately, set max digit bits to 28 since some\n // browsers slow down when dealing with 32-bit numbers.\n function am3(i, x, w, j, c, n) {\n var xl = x & 0x3fff,\n xh = x >> 14;\n while (--n >= 0) {\n var l = this[i] & 0x3fff;\n var h = this[i++] >> 14;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;\n c = (l >> 28) + (m >> 14) + xh * h;\n w[j++] = l & 0xfffffff;\n }\n return c;\n }\n var inBrowser = typeof navigator !== \"undefined\";\n if (inBrowser && j_lm && navigator.appName == \"Microsoft Internet Explorer\") {\n BigInteger.prototype.am = am2;\n dbits = 30;\n } else if (inBrowser && j_lm && navigator.appName != \"Netscape\") {\n BigInteger.prototype.am = am1;\n dbits = 26;\n } else {\n // Mozilla/Netscape seems to prefer am3\n BigInteger.prototype.am = am3;\n dbits = 28;\n }\n\n BigInteger.prototype.DB = dbits;\n BigInteger.prototype.DM = (1 << dbits) - 1;\n BigInteger.prototype.DV = 1 << dbits;\n\n var BI_FP = 52;\n BigInteger.prototype.FV = Math.pow(2, BI_FP);\n BigInteger.prototype.F1 = BI_FP - dbits;\n BigInteger.prototype.F2 = 2 * dbits - BI_FP;\n\n // Digit conversions\n var BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\n var BI_RC = new Array();\n var rr, vv;\n rr = \"0\".charCodeAt(0);\n for (vv = 0; vv <= 9; ++vv) {\n BI_RC[rr++] = vv;\n }rr = \"a\".charCodeAt(0);\n for (vv = 10; vv < 36; ++vv) {\n BI_RC[rr++] = vv;\n }rr = \"A\".charCodeAt(0);\n for (vv = 10; vv < 36; ++vv) {\n BI_RC[rr++] = vv;\n }function int2char(n) {\n return BI_RM.charAt(n);\n }\n function intAt(s, i) {\n var c = BI_RC[s.charCodeAt(i)];\n return c == null ? -1 : c;\n }\n\n // (protected) copy this to r\n function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) {\n r[i] = this[i];\n }r.t = this.t;\n r.s = this.s;\n }\n\n // (protected) set from integer value x, -DV <= x < DV\n function bnpFromInt(x) {\n this.t = 1;\n this.s = x < 0 ? -1 : 0;\n if (x > 0) this[0] = x;else if (x < -1) this[0] = x + this.DV;else this.t = 0;\n }\n\n // return bigint initialized to value\n function nbv(i) {\n var r = nbi();r.fromInt(i);return r;\n }\n\n // (protected) set from string and radix\n function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\n this.fromRadix(s, b);return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\n this[this.t++] = x >> this.DB - sh;\n } else this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }\n\n // (protected) clamp off excess high words\n function bnpClamp() {\n var c = this.s & this.DM;\n while (this.t > 0 && this[this.t - 1] == c) {\n --this.t;\n }\n }\n\n // (public) return string representation in given radix\n function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\n var km = (1 << k) - 1,\n d,\n m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - i * this.DB % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & (1 << p) - 1) << k - p;\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = this[i] >> (p -= k) & km;\n if (p <= 0) {\n p += this.DB;--i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }\n\n // (public) -this\n function bnNegate() {\n var r = nbi();BigInteger.ZERO.subTo(this, r);return r;\n }\n\n // (public) |this|\n function bnAbs() {\n return this.s < 0 ? this.negate() : this;\n }\n\n // (public) return + if this > a, - if this < a, 0 if equal\n function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return this.s < 0 ? -r : r;\n while (--i >= 0) {\n if ((r = this[i] - a[i]) != 0) return r;\n }return 0;\n }\n\n // returns bit length of the integer x\n function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;r += 1;\n }\n return r;\n }\n\n // (public) return the number of bits in \"this\"\n function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\n }\n\n // (protected) r = this << n*DB\n function bnpDLShiftTo(n, r) {\n var i;\n for (i = this.t - 1; i >= 0; --i) {\n r[i + n] = this[i];\n }for (i = n - 1; i >= 0; --i) {\n r[i] = 0;\n }r.t = this.t + n;\n r.s = this.s;\n }\n\n // (protected) r = this >> n*DB\n function bnpDRShiftTo(n, r) {\n for (var i = n; i < this.t; ++i) {\n r[i - n] = this[i];\n }r.t = Math.max(this.t - n, 0);\n r.s = this.s;\n }\n\n // (protected) r = this << n\n function bnpLShiftTo(n, r) {\n var bs = n % this.DB;\n var cbs = this.DB - bs;\n var bm = (1 << cbs) - 1;\n var ds = Math.floor(n / this.DB),\n c = this.s << bs & this.DM,\n i;\n for (i = this.t - 1; i >= 0; --i) {\n r[i + ds + 1] = this[i] >> cbs | c;\n c = (this[i] & bm) << bs;\n }\n for (i = ds - 1; i >= 0; --i) {\n r[i] = 0;\n }r[ds] = c;\n r.t = this.t + ds + 1;\n r.s = this.s;\n r.clamp();\n }\n\n // (protected) r = this >> n\n function bnpRShiftTo(n, r) {\n r.s = this.s;\n var ds = Math.floor(n / this.DB);\n if (ds >= this.t) {\n r.t = 0;return;\n }\n var bs = n % this.DB;\n var cbs = this.DB - bs;\n var bm = (1 << bs) - 1;\n r[0] = this[ds] >> bs;\n for (var i = ds + 1; i < this.t; ++i) {\n r[i - ds - 1] |= (this[i] & bm) << cbs;\n r[i - ds] = this[i] >> bs;\n }\n if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;\n r.t = this.t - ds;\n r.clamp();\n }\n\n // (protected) r = this - a\n function bnpSubTo(a, r) {\n var i = 0,\n c = 0,\n m = Math.min(a.t, this.t);\n while (i < m) {\n c += this[i] - a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n if (a.t < this.t) {\n c -= a.s;\n while (i < this.t) {\n c += this[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c += this.s;\n } else {\n c += this.s;\n while (i < a.t) {\n c -= a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c -= a.s;\n }\n r.s = c < 0 ? -1 : 0;\n if (c < -1) r[i++] = this.DV + c;else if (c > 0) r[i++] = c;\n r.t = i;\n r.clamp();\n }\n\n // (protected) r = this * a, r != this,a (HAC 14.12)\n // \"this\" should be the larger one if appropriate.\n function bnpMultiplyTo(a, r) {\n var x = this.abs(),\n y = a.abs();\n var i = x.t;\n r.t = i + y.t;\n while (--i >= 0) {\n r[i] = 0;\n }for (i = 0; i < y.t; ++i) {\n r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);\n }r.s = 0;\n r.clamp();\n if (this.s != a.s) BigInteger.ZERO.subTo(r, r);\n }\n\n // (protected) r = this^2, r != this (HAC 14.16)\n function bnpSquareTo(r) {\n var x = this.abs();\n var i = r.t = 2 * x.t;\n while (--i >= 0) {\n r[i] = 0;\n }for (i = 0; i < x.t - 1; ++i) {\n var c = x.am(i, x[i], r, 2 * i, 0, 1);\n if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {\n r[i + x.t] -= x.DV;\n r[i + x.t + 1] = 1;\n }\n }\n if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);\n r.s = 0;\n r.clamp();\n }\n\n // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n // r != q, this != m. q or r may be null.\n function bnpDivRemTo(m, q, r) {\n var pm = m.abs();\n if (pm.t <= 0) return;\n var pt = this.abs();\n if (pt.t < pm.t) {\n if (q != null) q.fromInt(0);\n if (r != null) this.copyTo(r);\n return;\n }\n if (r == null) r = nbi();\n var y = nbi(),\n ts = this.s,\n ms = m.s;\n var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus\n if (nsh > 0) {\n pm.lShiftTo(nsh, y);pt.lShiftTo(nsh, r);\n } else {\n pm.copyTo(y);pt.copyTo(r);\n }\n var ys = y.t;\n var y0 = y[ys - 1];\n if (y0 == 0) return;\n var yt = y0 * (1 << this.F1) + (ys > 1 ? y[ys - 2] >> this.F2 : 0);\n var d1 = this.FV / yt,\n d2 = (1 << this.F1) / yt,\n e = 1 << this.F2;\n var i = r.t,\n j = i - ys,\n t = q == null ? nbi() : q;\n y.dlShiftTo(j, t);\n if (r.compareTo(t) >= 0) {\n r[r.t++] = 1;\n r.subTo(t, r);\n }\n BigInteger.ONE.dlShiftTo(ys, t);\n t.subTo(y, y); // \"negative\" y so we can replace sub with am later\n while (y.t < ys) {\n y[y.t++] = 0;\n }while (--j >= 0) {\n // Estimate quotient digit\n var qd = r[--i] == y0 ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);\n if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) {\n // Try it out\n y.dlShiftTo(j, t);\n r.subTo(t, r);\n while (r[i] < --qd) {\n r.subTo(t, r);\n }\n }\n }\n if (q != null) {\n r.drShiftTo(ys, q);\n if (ts != ms) BigInteger.ZERO.subTo(q, q);\n }\n r.t = ys;\n r.clamp();\n if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder\n if (ts < 0) BigInteger.ZERO.subTo(r, r);\n }\n\n // (public) this mod a\n function bnMod(a) {\n var r = nbi();\n this.abs().divRemTo(a, null, r);\n if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);\n return r;\n }\n\n // Modular reduction using \"classic\" algorithm\n function Classic(m) {\n this.m = m;\n }\n function cConvert(x) {\n if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);else return x;\n }\n function cRevert(x) {\n return x;\n }\n function cReduce(x) {\n x.divRemTo(this.m, null, x);\n }\n function cMulTo(x, y, r) {\n x.multiplyTo(y, r);this.reduce(r);\n }\n function cSqrTo(x, r) {\n x.squareTo(r);this.reduce(r);\n }\n\n Classic.prototype.convert = cConvert;\n Classic.prototype.revert = cRevert;\n Classic.prototype.reduce = cReduce;\n Classic.prototype.mulTo = cMulTo;\n Classic.prototype.sqrTo = cSqrTo;\n\n // (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n // justification:\n // xy == 1 (mod m)\n // xy = 1+km\n // xy(2-xy) = (1+km)(1-km)\n // x[y(2-xy)] = 1-k^2m^2\n // x[y(2-xy)] == 1 (mod m^2)\n // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n // JS multiply \"overflows\" differently from C/C++, so care is needed here.\n function bnpInvDigit() {\n if (this.t < 1) return 0;\n var x = this[0];\n if ((x & 1) == 0) return 0;\n var y = x & 3; // y == 1/x mod 2^2\n y = y * (2 - (x & 0xf) * y) & 0xf; // y == 1/x mod 2^4\n y = y * (2 - (x & 0xff) * y) & 0xff; // y == 1/x mod 2^8\n y = y * (2 - ((x & 0xffff) * y & 0xffff)) & 0xffff; // y == 1/x mod 2^16\n // last step - calculate inverse mod DV directly;\n // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n y = y * (2 - x * y % this.DV) % this.DV; // y == 1/x mod 2^dbits\n // we really want the negative inverse, and -DV < y < DV\n return y > 0 ? this.DV - y : -y;\n }\n\n // Montgomery reduction\n function Montgomery(m) {\n this.m = m;\n this.mp = m.invDigit();\n this.mpl = this.mp & 0x7fff;\n this.mph = this.mp >> 15;\n this.um = (1 << m.DB - 15) - 1;\n this.mt2 = 2 * m.t;\n }\n\n // xR mod m\n function montConvert(x) {\n var r = nbi();\n x.abs().dlShiftTo(this.m.t, r);\n r.divRemTo(this.m, null, r);\n if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);\n return r;\n }\n\n // x/R mod m\n function montRevert(x) {\n var r = nbi();\n x.copyTo(r);\n this.reduce(r);\n return r;\n }\n\n // x = x/R mod m (HAC 14.32)\n function montReduce(x) {\n while (x.t <= this.mt2) {\n // pad x so am has enough room later\n x[x.t++] = 0;\n }for (var i = 0; i < this.m.t; ++i) {\n // faster way of calculating u0 = x[i]*mp mod DV\n var j = x[i] & 0x7fff;\n var u0 = j * this.mpl + ((j * this.mph + (x[i] >> 15) * this.mpl & this.um) << 15) & x.DM;\n // use am to combine the multiply-shift-add into one call\n j = i + this.m.t;\n x[j] += this.m.am(0, u0, x, i, 0, this.m.t);\n // propagate carry\n while (x[j] >= x.DV) {\n x[j] -= x.DV;x[++j]++;\n }\n }\n x.clamp();\n x.drShiftTo(this.m.t, x);\n if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);\n }\n\n // r = \"x^2/R mod m\"; x != r\n function montSqrTo(x, r) {\n x.squareTo(r);this.reduce(r);\n }\n\n // r = \"xy/R mod m\"; x,y != r\n function montMulTo(x, y, r) {\n x.multiplyTo(y, r);this.reduce(r);\n }\n\n Montgomery.prototype.convert = montConvert;\n Montgomery.prototype.revert = montRevert;\n Montgomery.prototype.reduce = montReduce;\n Montgomery.prototype.mulTo = montMulTo;\n Montgomery.prototype.sqrTo = montSqrTo;\n\n // (protected) true iff this is even\n function bnpIsEven() {\n return (this.t > 0 ? this[0] & 1 : this.s) == 0;\n }\n\n // (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\n function bnpExp(e, z) {\n if (e > 0xffffffff || e < 1) return BigInteger.ONE;\n var r = nbi(),\n r2 = nbi(),\n g = z.convert(this),\n i = nbits(e) - 1;\n g.copyTo(r);\n while (--i >= 0) {\n z.sqrTo(r, r2);\n if ((e & 1 << i) > 0) z.mulTo(r2, g, r);else {\n var t = r;r = r2;r2 = t;\n }\n }\n return z.revert(r);\n }\n\n // (public) this^e % m, 0 <= e < 2^32\n function bnModPowInt(e, m) {\n var z;\n if (e < 256 || m.isEven()) z = new Classic(m);else z = new Montgomery(m);\n return this.exp(e, z);\n }\n\n // protected\n BigInteger.prototype.copyTo = bnpCopyTo;\n BigInteger.prototype.fromInt = bnpFromInt;\n BigInteger.prototype.fromString = bnpFromString;\n BigInteger.prototype.clamp = bnpClamp;\n BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\n BigInteger.prototype.drShiftTo = bnpDRShiftTo;\n BigInteger.prototype.lShiftTo = bnpLShiftTo;\n BigInteger.prototype.rShiftTo = bnpRShiftTo;\n BigInteger.prototype.subTo = bnpSubTo;\n BigInteger.prototype.multiplyTo = bnpMultiplyTo;\n BigInteger.prototype.squareTo = bnpSquareTo;\n BigInteger.prototype.divRemTo = bnpDivRemTo;\n BigInteger.prototype.invDigit = bnpInvDigit;\n BigInteger.prototype.isEven = bnpIsEven;\n BigInteger.prototype.exp = bnpExp;\n\n // public\n BigInteger.prototype.toString = bnToString;\n BigInteger.prototype.negate = bnNegate;\n BigInteger.prototype.abs = bnAbs;\n BigInteger.prototype.compareTo = bnCompareTo;\n BigInteger.prototype.bitLength = bnBitLength;\n BigInteger.prototype.mod = bnMod;\n BigInteger.prototype.modPowInt = bnModPowInt;\n\n // \"constants\"\n BigInteger.ZERO = nbv(0);\n BigInteger.ONE = nbv(1);\n\n // Copyright (c) 2005-2009 Tom Wu\n // All Rights Reserved.\n // See \"LICENSE\" for details.\n\n // Extended JavaScript BN functions, required for RSA private ops.\n\n // Version 1.1: new BigInteger(\"0\", 10) returns \"proper\" zero\n // Version 1.2: square() API, isProbablePrime fix\n\n // (public)\n function bnClone() {\n var r = nbi();this.copyTo(r);return r;\n }\n\n // (public) return value as integer\n function bnIntValue() {\n if (this.s < 0) {\n if (this.t == 1) return this[0] - this.DV;else if (this.t == 0) return -1;\n } else if (this.t == 1) return this[0];else if (this.t == 0) return 0;\n // assumes 16 < DB < 32\n return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];\n }\n\n // (public) return value as byte\n function bnByteValue() {\n return this.t == 0 ? this.s : this[0] << 24 >> 24;\n }\n\n // (public) return value as short (assumes DB>=16)\n function bnShortValue() {\n return this.t == 0 ? this.s : this[0] << 16 >> 16;\n }\n\n // (protected) return x s.t. r^x < DV\n function bnpChunkSize(r) {\n return Math.floor(Math.LN2 * this.DB / Math.log(r));\n }\n\n // (public) 0 if this == 0, 1 if this > 0\n function bnSigNum() {\n if (this.s < 0) return -1;else if (this.t <= 0 || this.t == 1 && this[0] <= 0) return 0;else return 1;\n }\n\n // (protected) convert to radix string\n function bnpToRadix(b) {\n if (b == null) b = 10;\n if (this.signum() == 0 || b < 2 || b > 36) return \"0\";\n var cs = this.chunkSize(b);\n var a = Math.pow(b, cs);\n var d = nbv(a),\n y = nbi(),\n z = nbi(),\n r = \"\";\n this.divRemTo(d, y, z);\n while (y.signum() > 0) {\n r = (a + z.intValue()).toString(b).substr(1) + r;\n y.divRemTo(d, y, z);\n }\n return z.intValue().toString(b) + r;\n }\n\n // (protected) convert from radix string\n function bnpFromRadix(s, b) {\n this.fromInt(0);\n if (b == null) b = 10;\n var cs = this.chunkSize(b);\n var d = Math.pow(b, cs),\n mi = false,\n j = 0,\n w = 0;\n for (var i = 0; i < s.length; ++i) {\n var x = intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\" && this.signum() == 0) mi = true;\n continue;\n }\n w = b * w + x;\n if (++j >= cs) {\n this.dMultiply(d);\n this.dAddOffset(w, 0);\n j = 0;\n w = 0;\n }\n }\n if (j > 0) {\n this.dMultiply(Math.pow(b, j));\n this.dAddOffset(w, 0);\n }\n if (mi) BigInteger.ZERO.subTo(this, this);\n }\n\n // (protected) alternate constructor\n function bnpFromNumber(a, b, c) {\n if (\"number\" == typeof b) {\n // new BigInteger(int,int,RNG)\n if (a < 2) this.fromInt(1);else {\n this.fromNumber(a, c);\n if (!this.testBit(a - 1)) // force MSB set\n this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);\n if (this.isEven()) this.dAddOffset(1, 0); // force odd\n while (!this.isProbablePrime(b)) {\n this.dAddOffset(2, 0);\n if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);\n }\n }\n } else {\n // new BigInteger(int,RNG)\n var x = new Array(),\n t = a & 7;\n x.length = (a >> 3) + 1;\n b.nextBytes(x);\n if (t > 0) x[0] &= (1 << t) - 1;else x[0] = 0;\n this.fromString(x, 256);\n }\n }\n\n // (public) convert to bigendian byte array\n function bnToByteArray() {\n var i = this.t,\n r = new Array();\n r[0] = this.s;\n var p = this.DB - i * this.DB % 8,\n d,\n k = 0;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p) r[k++] = d | this.s << this.DB - p;\n while (i >= 0) {\n if (p < 8) {\n d = (this[i] & (1 << p) - 1) << 8 - p;\n d |= this[--i] >> (p += this.DB - 8);\n } else {\n d = this[i] >> (p -= 8) & 0xff;\n if (p <= 0) {\n p += this.DB;--i;\n }\n }\n if ((d & 0x80) != 0) d |= -256;\n if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k;\n if (k > 0 || d != this.s) r[k++] = d;\n }\n }\n return r;\n }\n\n function bnEquals(a) {\n return this.compareTo(a) == 0;\n }\n function bnMin(a) {\n return this.compareTo(a) < 0 ? this : a;\n }\n function bnMax(a) {\n return this.compareTo(a) > 0 ? this : a;\n }\n\n // (protected) r = this op a (bitwise)\n function bnpBitwiseTo(a, op, r) {\n var i,\n f,\n m = Math.min(a.t, this.t);\n for (i = 0; i < m; ++i) {\n r[i] = op(this[i], a[i]);\n }if (a.t < this.t) {\n f = a.s & this.DM;\n for (i = m; i < this.t; ++i) {\n r[i] = op(this[i], f);\n }r.t = this.t;\n } else {\n f = this.s & this.DM;\n for (i = m; i < a.t; ++i) {\n r[i] = op(f, a[i]);\n }r.t = a.t;\n }\n r.s = op(this.s, a.s);\n r.clamp();\n }\n\n // (public) this & a\n function op_and(x, y) {\n return x & y;\n }\n function bnAnd(a) {\n var r = nbi();this.bitwiseTo(a, op_and, r);return r;\n }\n\n // (public) this | a\n function op_or(x, y) {\n return x | y;\n }\n function bnOr(a) {\n var r = nbi();this.bitwiseTo(a, op_or, r);return r;\n }\n\n // (public) this ^ a\n function op_xor(x, y) {\n return x ^ y;\n }\n function bnXor(a) {\n var r = nbi();this.bitwiseTo(a, op_xor, r);return r;\n }\n\n // (public) this & ~a\n function op_andnot(x, y) {\n return x & ~y;\n }\n function bnAndNot(a) {\n var r = nbi();this.bitwiseTo(a, op_andnot, r);return r;\n }\n\n // (public) ~this\n function bnNot() {\n var r = nbi();\n for (var i = 0; i < this.t; ++i) {\n r[i] = this.DM & ~this[i];\n }r.t = this.t;\n r.s = ~this.s;\n return r;\n }\n\n // (public) this << n\n function bnShiftLeft(n) {\n var r = nbi();\n if (n < 0) this.rShiftTo(-n, r);else this.lShiftTo(n, r);\n return r;\n }\n\n // (public) this >> n\n function bnShiftRight(n) {\n var r = nbi();\n if (n < 0) this.lShiftTo(-n, r);else this.rShiftTo(n, r);\n return r;\n }\n\n // return index of lowest 1-bit in x, x < 2^31\n function lbit(x) {\n if (x == 0) return -1;\n var r = 0;\n if ((x & 0xffff) == 0) {\n x >>= 16;r += 16;\n }\n if ((x & 0xff) == 0) {\n x >>= 8;r += 8;\n }\n if ((x & 0xf) == 0) {\n x >>= 4;r += 4;\n }\n if ((x & 3) == 0) {\n x >>= 2;r += 2;\n }\n if ((x & 1) == 0) ++r;\n return r;\n }\n\n // (public) returns index of lowest 1-bit (or -1 if none)\n function bnGetLowestSetBit() {\n for (var i = 0; i < this.t; ++i) {\n if (this[i] != 0) return i * this.DB + lbit(this[i]);\n }if (this.s < 0) return this.t * this.DB;\n return -1;\n }\n\n // return number of 1 bits in x\n function cbit(x) {\n var r = 0;\n while (x != 0) {\n x &= x - 1;++r;\n }\n return r;\n }\n\n // (public) return number of set bits\n function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) {\n r += cbit(this[i] ^ x);\n }return r;\n }\n\n // (public) true iff nth bit is set\n function bnTestBit(n) {\n var j = Math.floor(n / this.DB);\n if (j >= this.t) return this.s != 0;\n return (this[j] & 1 << n % this.DB) != 0;\n }\n\n // (protected) this op (1<>= this.DB;\n }\n if (a.t < this.t) {\n c += a.s;\n while (i < this.t) {\n c += this[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c += this.s;\n } else {\n c += this.s;\n while (i < a.t) {\n c += a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c += a.s;\n }\n r.s = c < 0 ? -1 : 0;\n if (c > 0) r[i++] = c;else if (c < -1) r[i++] = this.DV + c;\n r.t = i;\n r.clamp();\n }\n\n // (public) this + a\n function bnAdd(a) {\n var r = nbi();this.addTo(a, r);return r;\n }\n\n // (public) this - a\n function bnSubtract(a) {\n var r = nbi();this.subTo(a, r);return r;\n }\n\n // (public) this * a\n function bnMultiply(a) {\n var r = nbi();this.multiplyTo(a, r);return r;\n }\n\n // (public) this^2\n function bnSquare() {\n var r = nbi();this.squareTo(r);return r;\n }\n\n // (public) this / a\n function bnDivide(a) {\n var r = nbi();this.divRemTo(a, r, null);return r;\n }\n\n // (public) this % a\n function bnRemainder(a) {\n var r = nbi();this.divRemTo(a, null, r);return r;\n }\n\n // (public) [this/a,this%a]\n function bnDivideAndRemainder(a) {\n var q = nbi(),\n r = nbi();\n this.divRemTo(a, q, r);\n return new Array(q, r);\n }\n\n // (protected) this *= n, this >= 0, 1 < n < DV\n function bnpDMultiply(n) {\n this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);\n ++this.t;\n this.clamp();\n }\n\n // (protected) this += n << w words, this >= 0\n function bnpDAddOffset(n, w) {\n if (n == 0) return;\n while (this.t <= w) {\n this[this.t++] = 0;\n }this[w] += n;\n while (this[w] >= this.DV) {\n this[w] -= this.DV;\n if (++w >= this.t) this[this.t++] = 0;\n ++this[w];\n }\n }\n\n // A \"null\" reducer\n function NullExp() {}\n function nNop(x) {\n return x;\n }\n function nMulTo(x, y, r) {\n x.multiplyTo(y, r);\n }\n function nSqrTo(x, r) {\n x.squareTo(r);\n }\n\n NullExp.prototype.convert = nNop;\n NullExp.prototype.revert = nNop;\n NullExp.prototype.mulTo = nMulTo;\n NullExp.prototype.sqrTo = nSqrTo;\n\n // (public) this^e\n function bnPow(e) {\n return this.exp(e, new NullExp());\n }\n\n // (protected) r = lower n words of \"this * a\", a.t <= n\n // \"this\" should be the larger one if appropriate.\n function bnpMultiplyLowerTo(a, n, r) {\n var i = Math.min(this.t + a.t, n);\n r.s = 0; // assumes a,this >= 0\n r.t = i;\n while (i > 0) {\n r[--i] = 0;\n }var j;\n for (j = r.t - this.t; i < j; ++i) {\n r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);\n }for (j = Math.min(a.t, n); i < j; ++i) {\n this.am(0, a[i], r, i, 0, n - i);\n }r.clamp();\n }\n\n // (protected) r = \"this * a\" without lower n words, n > 0\n // \"this\" should be the larger one if appropriate.\n function bnpMultiplyUpperTo(a, n, r) {\n --n;\n var i = r.t = this.t + a.t - n;\n r.s = 0; // assumes a,this >= 0\n while (--i >= 0) {\n r[i] = 0;\n }for (i = Math.max(n - this.t, 0); i < a.t; ++i) {\n r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);\n }r.clamp();\n r.drShiftTo(1, r);\n }\n\n // Barrett modular reduction\n function Barrett(m) {\n // setup Barrett\n this.r2 = nbi();\n this.q3 = nbi();\n BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);\n this.mu = this.r2.divide(m);\n this.m = m;\n }\n\n function barrettConvert(x) {\n if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);else if (x.compareTo(this.m) < 0) return x;else {\n var r = nbi();x.copyTo(r);this.reduce(r);return r;\n }\n }\n\n function barrettRevert(x) {\n return x;\n }\n\n // x = x mod m (HAC 14.42)\n function barrettReduce(x) {\n x.drShiftTo(this.m.t - 1, this.r2);\n if (x.t > this.m.t + 1) {\n x.t = this.m.t + 1;x.clamp();\n }\n this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);\n this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);\n while (x.compareTo(this.r2) < 0) {\n x.dAddOffset(1, this.m.t + 1);\n }x.subTo(this.r2, x);\n while (x.compareTo(this.m) >= 0) {\n x.subTo(this.m, x);\n }\n }\n\n // r = x^2 mod m; x != r\n function barrettSqrTo(x, r) {\n x.squareTo(r);this.reduce(r);\n }\n\n // r = x*y mod m; x,y != r\n function barrettMulTo(x, y, r) {\n x.multiplyTo(y, r);this.reduce(r);\n }\n\n Barrett.prototype.convert = barrettConvert;\n Barrett.prototype.revert = barrettRevert;\n Barrett.prototype.reduce = barrettReduce;\n Barrett.prototype.mulTo = barrettMulTo;\n Barrett.prototype.sqrTo = barrettSqrTo;\n\n // (public) this^e % m (HAC 14.85)\n function bnModPow(e, m) {\n var i = e.bitLength(),\n k,\n r = nbv(1),\n z;\n if (i <= 0) return r;else if (i < 18) k = 1;else if (i < 48) k = 3;else if (i < 144) k = 4;else if (i < 768) k = 5;else k = 6;\n if (i < 8) z = new Classic(m);else if (m.isEven()) z = new Barrett(m);else z = new Montgomery(m);\n\n // precomputation\n var g = new Array(),\n n = 3,\n k1 = k - 1,\n km = (1 << k) - 1;\n g[1] = z.convert(this);\n if (k > 1) {\n var g2 = nbi();\n z.sqrTo(g[1], g2);\n while (n <= km) {\n g[n] = nbi();\n z.mulTo(g2, g[n - 2], g[n]);\n n += 2;\n }\n }\n\n var j = e.t - 1,\n w,\n is1 = true,\n r2 = nbi(),\n t;\n i = nbits(e[j]) - 1;\n while (j >= 0) {\n if (i >= k1) w = e[j] >> i - k1 & km;else {\n w = (e[j] & (1 << i + 1) - 1) << k1 - i;\n if (j > 0) w |= e[j - 1] >> this.DB + i - k1;\n }\n\n n = k;\n while ((w & 1) == 0) {\n w >>= 1;--n;\n }\n if ((i -= n) < 0) {\n i += this.DB;--j;\n }\n if (is1) {\n // ret == 1, don't bother squaring or multiplying it\n g[w].copyTo(r);\n is1 = false;\n } else {\n while (n > 1) {\n z.sqrTo(r, r2);z.sqrTo(r2, r);n -= 2;\n }\n if (n > 0) z.sqrTo(r, r2);else {\n t = r;r = r2;r2 = t;\n }\n z.mulTo(r2, g[w], r);\n }\n\n while (j >= 0 && (e[j] & 1 << i) == 0) {\n z.sqrTo(r, r2);t = r;r = r2;r2 = t;\n if (--i < 0) {\n i = this.DB - 1;--j;\n }\n }\n }\n return z.revert(r);\n }\n\n // (public) gcd(this,a) (HAC 14.54)\n function bnGCD(a) {\n var x = this.s < 0 ? this.negate() : this.clone();\n var y = a.s < 0 ? a.negate() : a.clone();\n if (x.compareTo(y) < 0) {\n var t = x;x = y;y = t;\n }\n var i = x.getLowestSetBit(),\n g = y.getLowestSetBit();\n if (g < 0) return x;\n if (i < g) g = i;\n if (g > 0) {\n x.rShiftTo(g, x);\n y.rShiftTo(g, y);\n }\n while (x.signum() > 0) {\n if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);\n if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);\n if (x.compareTo(y) >= 0) {\n x.subTo(y, x);\n x.rShiftTo(1, x);\n } else {\n y.subTo(x, y);\n y.rShiftTo(1, y);\n }\n }\n if (g > 0) y.lShiftTo(g, y);\n return y;\n }\n\n // (protected) this % n, n < 2^26\n function bnpModInt(n) {\n if (n <= 0) return 0;\n var d = this.DV % n,\n r = this.s < 0 ? n - 1 : 0;\n if (this.t > 0) if (d == 0) r = this[0] % n;else for (var i = this.t - 1; i >= 0; --i) {\n r = (d * r + this[i]) % n;\n }return r;\n }\n\n // (public) 1/this % m (HAC 14.61)\n function bnModInverse(m) {\n var ac = m.isEven();\n if (this.isEven() && ac || m.signum() == 0) return BigInteger.ZERO;\n var u = m.clone(),\n v = this.clone();\n var a = nbv(1),\n b = nbv(0),\n c = nbv(0),\n d = nbv(1);\n while (u.signum() != 0) {\n while (u.isEven()) {\n u.rShiftTo(1, u);\n if (ac) {\n if (!a.isEven() || !b.isEven()) {\n a.addTo(this, a);b.subTo(m, b);\n }\n a.rShiftTo(1, a);\n } else if (!b.isEven()) b.subTo(m, b);\n b.rShiftTo(1, b);\n }\n while (v.isEven()) {\n v.rShiftTo(1, v);\n if (ac) {\n if (!c.isEven() || !d.isEven()) {\n c.addTo(this, c);d.subTo(m, d);\n }\n c.rShiftTo(1, c);\n } else if (!d.isEven()) d.subTo(m, d);\n d.rShiftTo(1, d);\n }\n if (u.compareTo(v) >= 0) {\n u.subTo(v, u);\n if (ac) a.subTo(c, a);\n b.subTo(d, b);\n } else {\n v.subTo(u, v);\n if (ac) c.subTo(a, c);\n d.subTo(b, d);\n }\n }\n if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\n if (d.compareTo(m) >= 0) return d.subtract(m);\n if (d.signum() < 0) d.addTo(m, d);else return d;\n if (d.signum() < 0) return d.add(m);else return d;\n }\n\n var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];\n var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];\n\n // (public) test primality with certainty >= 1-.5^t\n function bnIsProbablePrime(t) {\n var i,\n x = this.abs();\n if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {\n for (i = 0; i < lowprimes.length; ++i) {\n if (x[0] == lowprimes[i]) return true;\n }return false;\n }\n if (x.isEven()) return false;\n i = 1;\n while (i < lowprimes.length) {\n var m = lowprimes[i],\n j = i + 1;\n while (j < lowprimes.length && m < lplim) {\n m *= lowprimes[j++];\n }m = x.modInt(m);\n while (i < j) {\n if (m % lowprimes[i++] == 0) return false;\n }\n }\n return x.millerRabin(t);\n }\n\n // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\n function bnpMillerRabin(t) {\n var n1 = this.subtract(BigInteger.ONE);\n var k = n1.getLowestSetBit();\n if (k <= 0) return false;\n var r = n1.shiftRight(k);\n t = t + 1 >> 1;\n if (t > lowprimes.length) t = lowprimes.length;\n var a = nbi();\n for (var i = 0; i < t; ++i) {\n //Pick bases at random, instead of starting at 2\n a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);\n var y = a.modPow(r, this);\n if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n var j = 1;\n while (j++ < k && y.compareTo(n1) != 0) {\n y = y.modPowInt(2, this);\n if (y.compareTo(BigInteger.ONE) == 0) return false;\n }\n if (y.compareTo(n1) != 0) return false;\n }\n }\n return true;\n }\n\n // protected\n BigInteger.prototype.chunkSize = bnpChunkSize;\n BigInteger.prototype.toRadix = bnpToRadix;\n BigInteger.prototype.fromRadix = bnpFromRadix;\n BigInteger.prototype.fromNumber = bnpFromNumber;\n BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\n BigInteger.prototype.changeBit = bnpChangeBit;\n BigInteger.prototype.addTo = bnpAddTo;\n BigInteger.prototype.dMultiply = bnpDMultiply;\n BigInteger.prototype.dAddOffset = bnpDAddOffset;\n BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\n BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\n BigInteger.prototype.modInt = bnpModInt;\n BigInteger.prototype.millerRabin = bnpMillerRabin;\n\n // public\n BigInteger.prototype.clone = bnClone;\n BigInteger.prototype.intValue = bnIntValue;\n BigInteger.prototype.byteValue = bnByteValue;\n BigInteger.prototype.shortValue = bnShortValue;\n BigInteger.prototype.signum = bnSigNum;\n BigInteger.prototype.toByteArray = bnToByteArray;\n BigInteger.prototype.equals = bnEquals;\n BigInteger.prototype.min = bnMin;\n BigInteger.prototype.max = bnMax;\n BigInteger.prototype.and = bnAnd;\n BigInteger.prototype.or = bnOr;\n BigInteger.prototype.xor = bnXor;\n BigInteger.prototype.andNot = bnAndNot;\n BigInteger.prototype.not = bnNot;\n BigInteger.prototype.shiftLeft = bnShiftLeft;\n BigInteger.prototype.shiftRight = bnShiftRight;\n BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\n BigInteger.prototype.bitCount = bnBitCount;\n BigInteger.prototype.testBit = bnTestBit;\n BigInteger.prototype.setBit = bnSetBit;\n BigInteger.prototype.clearBit = bnClearBit;\n BigInteger.prototype.flipBit = bnFlipBit;\n BigInteger.prototype.add = bnAdd;\n BigInteger.prototype.subtract = bnSubtract;\n BigInteger.prototype.multiply = bnMultiply;\n BigInteger.prototype.divide = bnDivide;\n BigInteger.prototype.remainder = bnRemainder;\n BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\n BigInteger.prototype.modPow = bnModPow;\n BigInteger.prototype.modInverse = bnModInverse;\n BigInteger.prototype.pow = bnPow;\n BigInteger.prototype.gcd = bnGCD;\n BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n\n // JSBN-specific extension\n BigInteger.prototype.square = bnSquare;\n\n // Expose the Barrett function\n BigInteger.prototype.Barrett = Barrett;\n\n // BigInteger interfaces not implemented in jsbn:\n\n // BigInteger(int signum, byte[] magnitude)\n // double doubleValue()\n // float floatValue()\n // int hashCode()\n // long longValue()\n // static BigInteger valueOf(long val)\n\n // Random number generator - requires a PRNG backend, e.g. prng4.js\n\n // For best results, put code like\n // \n // in your main HTML document.\n\n var rng_state;\n var rng_pool;\n var rng_pptr;\n\n // Mix in a 32-bit integer into the pool\n function rng_seed_int(x) {\n rng_pool[rng_pptr++] ^= x & 255;\n rng_pool[rng_pptr++] ^= x >> 8 & 255;\n rng_pool[rng_pptr++] ^= x >> 16 & 255;\n rng_pool[rng_pptr++] ^= x >> 24 & 255;\n if (rng_pptr >= rng_psize) rng_pptr -= rng_psize;\n }\n\n // Mix in the current time (w/milliseconds) into the pool\n function rng_seed_time() {\n rng_seed_int(new Date().getTime());\n }\n\n // Initialize the pool with junk if needed.\n if (rng_pool == null) {\n rng_pool = new Array();\n rng_pptr = 0;\n var t;\n if (typeof window !== \"undefined\" && window.crypto) {\n if (window.crypto.getRandomValues) {\n // Use webcrypto if available\n var ua = new Uint8Array(32);\n window.crypto.getRandomValues(ua);\n for (t = 0; t < 32; ++t) {\n rng_pool[rng_pptr++] = ua[t];\n }\n } else if (navigator.appName == \"Netscape\" && navigator.appVersion < \"5\") {\n // Extract entropy (256 bits) from NS4 RNG if available\n var z = window.crypto.random(32);\n for (t = 0; t < z.length; ++t) {\n rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;\n }\n }\n }\n while (rng_pptr < rng_psize) {\n // extract some randomness from Math.random()\n t = Math.floor(65536 * Math.random());\n rng_pool[rng_pptr++] = t >>> 8;\n rng_pool[rng_pptr++] = t & 255;\n }\n rng_pptr = 0;\n rng_seed_time();\n //rng_seed_int(window.screenX);\n //rng_seed_int(window.screenY);\n }\n\n function rng_get_byte() {\n if (rng_state == null) {\n rng_seed_time();\n rng_state = prng_newstate();\n rng_state.init(rng_pool);\n for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr) {\n rng_pool[rng_pptr] = 0;\n }rng_pptr = 0;\n //rng_pool = null;\n }\n // TODO: allow reseeding after first request\n return rng_state.next();\n }\n\n function rng_get_bytes(ba) {\n var i;\n for (i = 0; i < ba.length; ++i) {\n ba[i] = rng_get_byte();\n }\n }\n\n function SecureRandom() {}\n\n SecureRandom.prototype.nextBytes = rng_get_bytes;\n\n // prng4.js - uses Arcfour as a PRNG\n\n function Arcfour() {\n this.i = 0;\n this.j = 0;\n this.S = new Array();\n }\n\n // Initialize arcfour context from key, an array of ints, each from [0..255]\n function ARC4init(key) {\n var i, j, t;\n for (i = 0; i < 256; ++i) {\n this.S[i] = i;\n }j = 0;\n for (i = 0; i < 256; ++i) {\n j = j + this.S[i] + key[i % key.length] & 255;\n t = this.S[i];\n this.S[i] = this.S[j];\n this.S[j] = t;\n }\n this.i = 0;\n this.j = 0;\n }\n\n function ARC4next() {\n var t;\n this.i = this.i + 1 & 255;\n this.j = this.j + this.S[this.i] & 255;\n t = this.S[this.i];\n this.S[this.i] = this.S[this.j];\n this.S[this.j] = t;\n return this.S[t + this.S[this.i] & 255];\n }\n\n Arcfour.prototype.init = ARC4init;\n Arcfour.prototype.next = ARC4next;\n\n // Plug in your RNG constructor here\n function prng_newstate() {\n return new Arcfour();\n }\n\n // Pool size must be a multiple of 4 and greater than 32.\n // An array of bytes the size of the pool will be passed to init()\n var rng_psize = 256;\n\n BigInteger.SecureRandom = SecureRandom;\n BigInteger.BigInteger = BigInteger;\n if (typeof exports !== 'undefined') {\n exports = module.exports = BigInteger;\n } else {\n this.BigInteger = BigInteger;\n this.SecureRandom = SecureRandom;\n }\n}).call(undefined);",{"version":3,"sources":["node_modules/jsbn/index.js"],"names":["dbits","canary","j_lm","BigInteger","a","b","c","fromNumber","fromString","nbi","am1","i","x","w","j","n","v","Math","floor","am2","xl","xh","l","h","m","am3","inBrowser","navigator","appName","prototype","am","DB","DM","DV","BI_FP","FV","pow","F1","F2","BI_RM","BI_RC","Array","rr","vv","charCodeAt","int2char","charAt","intAt","s","bnpCopyTo","r","t","bnpFromInt","nbv","fromInt","bnpFromString","k","fromRadix","length","mi","sh","clamp","ZERO","subTo","bnpClamp","bnToString","negate","toString","toRadix","km","d","p","bnNegate","bnAbs","bnCompareTo","nbits","bnBitLength","bnpDLShiftTo","bnpDRShiftTo","max","bnpLShiftTo","bs","cbs","bm","ds","bnpRShiftTo","bnpSubTo","min","bnpMultiplyTo","abs","y","bnpSquareTo","bnpDivRemTo","q","pm","pt","copyTo","ts","ms","nsh","lShiftTo","ys","y0","yt","d1","d2","e","dlShiftTo","compareTo","ONE","qd","drShiftTo","rShiftTo","bnMod","divRemTo","Classic","cConvert","mod","cRevert","cReduce","cMulTo","multiplyTo","reduce","cSqrTo","squareTo","convert","revert","mulTo","sqrTo","bnpInvDigit","Montgomery","mp","invDigit","mpl","mph","um","mt2","montConvert","montRevert","montReduce","u0","montSqrTo","montMulTo","bnpIsEven","bnpExp","z","r2","g","bnModPowInt","isEven","exp","bitLength","modPowInt","bnClone","bnIntValue","bnByteValue","bnShortValue","bnpChunkSize","LN2","log","bnSigNum","bnpToRadix","signum","cs","chunkSize","intValue","substr","bnpFromRadix","dMultiply","dAddOffset","bnpFromNumber","testBit","bitwiseTo","shiftLeft","op_or","isProbablePrime","nextBytes","bnToByteArray","bnEquals","bnMin","bnMax","bnpBitwiseTo","op","f","op_and","bnAnd","bnOr","op_xor","bnXor","op_andnot","bnAndNot","bnNot","bnShiftLeft","bnShiftRight","lbit","bnGetLowestSetBit","cbit","bnBitCount","bnTestBit","bnpChangeBit","bnSetBit","changeBit","bnClearBit","bnFlipBit","bnpAddTo","bnAdd","addTo","bnSubtract","bnMultiply","bnSquare","bnDivide","bnRemainder","bnDivideAndRemainder","bnpDMultiply","bnpDAddOffset","NullExp","nNop","nMulTo","nSqrTo","bnPow","bnpMultiplyLowerTo","bnpMultiplyUpperTo","Barrett","q3","mu","divide","barrettConvert","barrettRevert","barrettReduce","multiplyUpperTo","multiplyLowerTo","barrettSqrTo","barrettMulTo","bnModPow","k1","g2","is1","bnGCD","clone","getLowestSetBit","bnpModInt","bnModInverse","ac","u","subtract","add","lowprimes","lplim","bnIsProbablePrime","modInt","millerRabin","bnpMillerRabin","n1","shiftRight","random","modPow","byteValue","shortValue","toByteArray","equals","and","or","xor","andNot","not","bitCount","setBit","clearBit","flipBit","multiply","remainder","divideAndRemainder","modInverse","gcd","square","rng_state","rng_pool","rng_pptr","rng_seed_int","rng_psize","rng_seed_time","Date","getTime","window","crypto","getRandomValues","ua","Uint8Array","appVersion","rng_get_byte","prng_newstate","init","next","rng_get_bytes","ba","SecureRandom","Arcfour","S","ARC4init","key","ARC4next","exports","module","call"],"mappings":";;AAAA,CAAC,YAAU;;AAEP;AACA;AACA;;AAEA;;AAEA;AACA,MAAIA,KAAJ;;AAEA;AACA,MAAIC,SAAS,cAAb;AACA,MAAIC,OAAQ,CAACD,SAAO,QAAR,KAAmB,QAA/B;;AAEA;AACA,WAASE,UAAT,CAAoBC,CAApB,EAAsBC,CAAtB,EAAwBC,CAAxB,EAA2B;AACzB,QAAGF,KAAK,IAAR,EACE,IAAG,YAAY,OAAOA,CAAtB,EAAyB,KAAKG,UAAL,CAAgBH,CAAhB,EAAkBC,CAAlB,EAAoBC,CAApB,EAAzB,KACK,IAAGD,KAAK,IAAL,IAAa,YAAY,OAAOD,CAAnC,EAAsC,KAAKI,UAAL,CAAgBJ,CAAhB,EAAkB,GAAlB,EAAtC,KACA,KAAKI,UAAL,CAAgBJ,CAAhB,EAAkBC,CAAlB;AACR;;AAED;AACA,WAASI,GAAT,GAAe;AAAE,WAAO,IAAIN,UAAJ,CAAe,IAAf,CAAP;AAA8B;;AAE/C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAASO,GAAT,CAAaC,CAAb,EAAeC,CAAf,EAAiBC,CAAjB,EAAmBC,CAAnB,EAAqBR,CAArB,EAAuBS,CAAvB,EAA0B;AACxB,WAAM,EAAEA,CAAF,IAAO,CAAb,EAAgB;AACd,UAAIC,IAAIJ,IAAE,KAAKD,GAAL,CAAF,GAAYE,EAAEC,CAAF,CAAZ,GAAiBR,CAAzB;AACAA,UAAIW,KAAKC,KAAL,CAAWF,IAAE,SAAb,CAAJ;AACAH,QAAEC,GAAF,IAASE,IAAE,SAAX;AACD;AACD,WAAOV,CAAP;AACD;AACD;AACA;AACA;AACA,WAASa,GAAT,CAAaR,CAAb,EAAeC,CAAf,EAAiBC,CAAjB,EAAmBC,CAAnB,EAAqBR,CAArB,EAAuBS,CAAvB,EAA0B;AACxB,QAAIK,KAAKR,IAAE,MAAX;AAAA,QAAmBS,KAAKT,KAAG,EAA3B;AACA,WAAM,EAAEG,CAAF,IAAO,CAAb,EAAgB;AACd,UAAIO,IAAI,KAAKX,CAAL,IAAQ,MAAhB;AACA,UAAIY,IAAI,KAAKZ,GAAL,KAAW,EAAnB;AACA,UAAIa,IAAIH,KAAGC,CAAH,GAAKC,IAAEH,EAAf;AACAE,UAAIF,KAAGE,CAAH,IAAM,CAACE,IAAE,MAAH,KAAY,EAAlB,IAAsBX,EAAEC,CAAF,CAAtB,IAA4BR,IAAE,UAA9B,CAAJ;AACAA,UAAI,CAACgB,MAAI,EAAL,KAAUE,MAAI,EAAd,IAAkBH,KAAGE,CAArB,IAAwBjB,MAAI,EAA5B,CAAJ;AACAO,QAAEC,GAAF,IAASQ,IAAE,UAAX;AACD;AACD,WAAOhB,CAAP;AACD;AACD;AACA;AACA,WAASmB,GAAT,CAAad,CAAb,EAAeC,CAAf,EAAiBC,CAAjB,EAAmBC,CAAnB,EAAqBR,CAArB,EAAuBS,CAAvB,EAA0B;AACxB,QAAIK,KAAKR,IAAE,MAAX;AAAA,QAAmBS,KAAKT,KAAG,EAA3B;AACA,WAAM,EAAEG,CAAF,IAAO,CAAb,EAAgB;AACd,UAAIO,IAAI,KAAKX,CAAL,IAAQ,MAAhB;AACA,UAAIY,IAAI,KAAKZ,GAAL,KAAW,EAAnB;AACA,UAAIa,IAAIH,KAAGC,CAAH,GAAKC,IAAEH,EAAf;AACAE,UAAIF,KAAGE,CAAH,IAAM,CAACE,IAAE,MAAH,KAAY,EAAlB,IAAsBX,EAAEC,CAAF,CAAtB,GAA2BR,CAA/B;AACAA,UAAI,CAACgB,KAAG,EAAJ,KAASE,KAAG,EAAZ,IAAgBH,KAAGE,CAAvB;AACAV,QAAEC,GAAF,IAASQ,IAAE,SAAX;AACD;AACD,WAAOhB,CAAP;AACD;AACD,MAAIoB,YAAY,OAAOC,SAAP,KAAqB,WAArC;AACA,MAAGD,aAAaxB,IAAb,IAAsByB,UAAUC,OAAV,IAAqB,6BAA9C,EAA8E;AAC5EzB,eAAW0B,SAAX,CAAqBC,EAArB,GAA0BX,GAA1B;AACAnB,YAAQ,EAAR;AACD,GAHD,MAIK,IAAG0B,aAAaxB,IAAb,IAAsByB,UAAUC,OAAV,IAAqB,UAA9C,EAA2D;AAC9DzB,eAAW0B,SAAX,CAAqBC,EAArB,GAA0BpB,GAA1B;AACAV,YAAQ,EAAR;AACD,GAHI,MAIA;AAAE;AACLG,eAAW0B,SAAX,CAAqBC,EAArB,GAA0BL,GAA1B;AACAzB,YAAQ,EAAR;AACD;;AAEDG,aAAW0B,SAAX,CAAqBE,EAArB,GAA0B/B,KAA1B;AACAG,aAAW0B,SAAX,CAAqBG,EAArB,GAA2B,CAAC,KAAGhC,KAAJ,IAAW,CAAtC;AACAG,aAAW0B,SAAX,CAAqBI,EAArB,GAA2B,KAAGjC,KAA9B;;AAEA,MAAIkC,QAAQ,EAAZ;AACA/B,aAAW0B,SAAX,CAAqBM,EAArB,GAA0BlB,KAAKmB,GAAL,CAAS,CAAT,EAAWF,KAAX,CAA1B;AACA/B,aAAW0B,SAAX,CAAqBQ,EAArB,GAA0BH,QAAMlC,KAAhC;AACAG,aAAW0B,SAAX,CAAqBS,EAArB,GAA0B,IAAEtC,KAAF,GAAQkC,KAAlC;;AAEA;AACA,MAAIK,QAAQ,sCAAZ;AACA,MAAIC,QAAQ,IAAIC,KAAJ,EAAZ;AACA,MAAIC,EAAJ,EAAOC,EAAP;AACAD,OAAK,IAAIE,UAAJ,CAAe,CAAf,CAAL;AACA,OAAID,KAAK,CAAT,EAAYA,MAAM,CAAlB,EAAqB,EAAEA,EAAvB;AAA2BH,UAAME,IAAN,IAAcC,EAAd;AAA3B,GACAD,KAAK,IAAIE,UAAJ,CAAe,CAAf,CAAL;AACA,OAAID,KAAK,EAAT,EAAaA,KAAK,EAAlB,EAAsB,EAAEA,EAAxB;AAA4BH,UAAME,IAAN,IAAcC,EAAd;AAA5B,GACAD,KAAK,IAAIE,UAAJ,CAAe,CAAf,CAAL;AACA,OAAID,KAAK,EAAT,EAAaA,KAAK,EAAlB,EAAsB,EAAEA,EAAxB;AAA4BH,UAAME,IAAN,IAAcC,EAAd;AAA5B,GAEA,SAASE,QAAT,CAAkB9B,CAAlB,EAAqB;AAAE,WAAOwB,MAAMO,MAAN,CAAa/B,CAAb,CAAP;AAAyB;AAChD,WAASgC,KAAT,CAAeC,CAAf,EAAiBrC,CAAjB,EAAoB;AAClB,QAAIL,IAAIkC,MAAMQ,EAAEJ,UAAF,CAAajC,CAAb,CAAN,CAAR;AACA,WAAQL,KAAG,IAAJ,GAAU,CAAC,CAAX,GAAaA,CAApB;AACD;;AAED;AACA,WAAS2C,SAAT,CAAmBC,CAAnB,EAAsB;AACpB,SAAI,IAAIvC,IAAI,KAAKwC,CAAL,GAAO,CAAnB,EAAsBxC,KAAK,CAA3B,EAA8B,EAAEA,CAAhC;AAAmCuC,QAAEvC,CAAF,IAAO,KAAKA,CAAL,CAAP;AAAnC,KACAuC,EAAEC,CAAF,GAAM,KAAKA,CAAX;AACAD,MAAEF,CAAF,GAAM,KAAKA,CAAX;AACD;;AAED;AACA,WAASI,UAAT,CAAoBxC,CAApB,EAAuB;AACrB,SAAKuC,CAAL,GAAS,CAAT;AACA,SAAKH,CAAL,GAAUpC,IAAE,CAAH,GAAM,CAAC,CAAP,GAAS,CAAlB;AACA,QAAGA,IAAI,CAAP,EAAU,KAAK,CAAL,IAAUA,CAAV,CAAV,KACK,IAAGA,IAAI,CAAC,CAAR,EAAW,KAAK,CAAL,IAAUA,IAAE,KAAKqB,EAAjB,CAAX,KACA,KAAKkB,CAAL,GAAS,CAAT;AACN;;AAED;AACA,WAASE,GAAT,CAAa1C,CAAb,EAAgB;AAAE,QAAIuC,IAAIzC,KAAR,CAAeyC,EAAEI,OAAF,CAAU3C,CAAV,EAAc,OAAOuC,CAAP;AAAW;;AAE1D;AACA,WAASK,aAAT,CAAuBP,CAAvB,EAAyB3C,CAAzB,EAA4B;AAC1B,QAAImD,CAAJ;AACA,QAAGnD,KAAK,EAAR,EAAYmD,IAAI,CAAJ,CAAZ,KACK,IAAGnD,KAAK,CAAR,EAAWmD,IAAI,CAAJ,CAAX,KACA,IAAGnD,KAAK,GAAR,EAAamD,IAAI,CAAJ,CAAb,CAAoB;AAApB,SACA,IAAGnD,KAAK,CAAR,EAAWmD,IAAI,CAAJ,CAAX,KACA,IAAGnD,KAAK,EAAR,EAAYmD,IAAI,CAAJ,CAAZ,KACA,IAAGnD,KAAK,CAAR,EAAWmD,IAAI,CAAJ,CAAX,KACA;AAAE,aAAKC,SAAL,CAAeT,CAAf,EAAiB3C,CAAjB,EAAqB;AAAS;AACrC,SAAK8C,CAAL,GAAS,CAAT;AACA,SAAKH,CAAL,GAAS,CAAT;AACA,QAAIrC,IAAIqC,EAAEU,MAAV;AAAA,QAAkBC,KAAK,KAAvB;AAAA,QAA8BC,KAAK,CAAnC;AACA,WAAM,EAAEjD,CAAF,IAAO,CAAb,EAAgB;AACd,UAAIC,IAAK4C,KAAG,CAAJ,GAAOR,EAAErC,CAAF,IAAK,IAAZ,GAAiBoC,MAAMC,CAAN,EAAQrC,CAAR,CAAzB;AACA,UAAGC,IAAI,CAAP,EAAU;AACR,YAAGoC,EAAEF,MAAF,CAASnC,CAAT,KAAe,GAAlB,EAAuBgD,KAAK,IAAL;AACvB;AACD;AACDA,WAAK,KAAL;AACA,UAAGC,MAAM,CAAT,EACE,KAAK,KAAKT,CAAL,EAAL,IAAiBvC,CAAjB,CADF,KAEK,IAAGgD,KAAGJ,CAAH,GAAO,KAAKzB,EAAf,EAAmB;AACtB,aAAK,KAAKoB,CAAL,GAAO,CAAZ,KAAkB,CAACvC,IAAG,CAAC,KAAI,KAAKmB,EAAL,GAAQ6B,EAAb,IAAkB,CAAtB,KAA2BA,EAA7C;AACA,aAAK,KAAKT,CAAL,EAAL,IAAkBvC,KAAI,KAAKmB,EAAL,GAAQ6B,EAA9B;AACD,OAHI,MAKH,KAAK,KAAKT,CAAL,GAAO,CAAZ,KAAkBvC,KAAGgD,EAArB;AACFA,YAAMJ,CAAN;AACA,UAAGI,MAAM,KAAK7B,EAAd,EAAkB6B,MAAM,KAAK7B,EAAX;AACnB;AACD,QAAGyB,KAAK,CAAL,IAAU,CAACR,EAAE,CAAF,IAAK,IAAN,KAAe,CAA5B,EAA+B;AAC7B,WAAKA,CAAL,GAAS,CAAC,CAAV;AACA,UAAGY,KAAK,CAAR,EAAW,KAAK,KAAKT,CAAL,GAAO,CAAZ,KAAmB,CAAC,KAAI,KAAKpB,EAAL,GAAQ6B,EAAb,IAAkB,CAAnB,IAAuBA,EAAzC;AACZ;AACD,SAAKC,KAAL;AACA,QAAGF,EAAH,EAAOxD,WAAW2D,IAAX,CAAgBC,KAAhB,CAAsB,IAAtB,EAA2B,IAA3B;AACR;;AAED;AACA,WAASC,QAAT,GAAoB;AAClB,QAAI1D,IAAI,KAAK0C,CAAL,GAAO,KAAKhB,EAApB;AACA,WAAM,KAAKmB,CAAL,GAAS,CAAT,IAAc,KAAK,KAAKA,CAAL,GAAO,CAAZ,KAAkB7C,CAAtC;AAAyC,QAAE,KAAK6C,CAAP;AAAzC;AACD;;AAED;AACA,WAASc,UAAT,CAAoB5D,CAApB,EAAuB;AACrB,QAAG,KAAK2C,CAAL,GAAS,CAAZ,EAAe,OAAO,MAAI,KAAKkB,MAAL,GAAcC,QAAd,CAAuB9D,CAAvB,CAAX;AACf,QAAImD,CAAJ;AACA,QAAGnD,KAAK,EAAR,EAAYmD,IAAI,CAAJ,CAAZ,KACK,IAAGnD,KAAK,CAAR,EAAWmD,IAAI,CAAJ,CAAX,KACA,IAAGnD,KAAK,CAAR,EAAWmD,IAAI,CAAJ,CAAX,KACA,IAAGnD,KAAK,EAAR,EAAYmD,IAAI,CAAJ,CAAZ,KACA,IAAGnD,KAAK,CAAR,EAAWmD,IAAI,CAAJ,CAAX,KACA,OAAO,KAAKY,OAAL,CAAa/D,CAAb,CAAP;AACL,QAAIgE,KAAK,CAAC,KAAGb,CAAJ,IAAO,CAAhB;AAAA,QAAmBc,CAAnB;AAAA,QAAsB9C,IAAI,KAA1B;AAAA,QAAiC0B,IAAI,EAArC;AAAA,QAAyCvC,IAAI,KAAKwC,CAAlD;AACA,QAAIoB,IAAI,KAAKxC,EAAL,GAASpB,IAAE,KAAKoB,EAAR,GAAYyB,CAA5B;AACA,QAAG7C,MAAM,CAAT,EAAY;AACV,UAAG4D,IAAI,KAAKxC,EAAT,IAAe,CAACuC,IAAI,KAAK3D,CAAL,KAAS4D,CAAd,IAAmB,CAArC,EAAwC;AAAE/C,YAAI,IAAJ,CAAU0B,IAAIL,SAASyB,CAAT,CAAJ;AAAkB;AACtE,aAAM3D,KAAK,CAAX,EAAc;AACZ,YAAG4D,IAAIf,CAAP,EAAU;AACRc,cAAI,CAAC,KAAK3D,CAAL,IAAS,CAAC,KAAG4D,CAAJ,IAAO,CAAjB,KAAuBf,IAAEe,CAA7B;AACAD,eAAK,KAAK,EAAE3D,CAAP,MAAY4D,KAAG,KAAKxC,EAAL,GAAQyB,CAAvB,CAAL;AACD,SAHD,MAIK;AACHc,cAAK,KAAK3D,CAAL,MAAU4D,KAAGf,CAAb,CAAD,GAAkBa,EAAtB;AACA,cAAGE,KAAK,CAAR,EAAW;AAAEA,iBAAK,KAAKxC,EAAV,CAAc,EAAEpB,CAAF;AAAM;AAClC;AACD,YAAG2D,IAAI,CAAP,EAAU9C,IAAI,IAAJ;AACV,YAAGA,CAAH,EAAM0B,KAAKL,SAASyB,CAAT,CAAL;AACP;AACF;AACD,WAAO9C,IAAE0B,CAAF,GAAI,GAAX;AACD;;AAED;AACA,WAASsB,QAAT,GAAoB;AAAE,QAAItB,IAAIzC,KAAR,CAAeN,WAAW2D,IAAX,CAAgBC,KAAhB,CAAsB,IAAtB,EAA2Bb,CAA3B,EAA+B,OAAOA,CAAP;AAAW;;AAE/E;AACA,WAASuB,KAAT,GAAiB;AAAE,WAAQ,KAAKzB,CAAL,GAAO,CAAR,GAAW,KAAKkB,MAAL,EAAX,GAAyB,IAAhC;AAAuC;;AAE1D;AACA,WAASQ,WAAT,CAAqBtE,CAArB,EAAwB;AACtB,QAAI8C,IAAI,KAAKF,CAAL,GAAO5C,EAAE4C,CAAjB;AACA,QAAGE,KAAK,CAAR,EAAW,OAAOA,CAAP;AACX,QAAIvC,IAAI,KAAKwC,CAAb;AACAD,QAAIvC,IAAEP,EAAE+C,CAAR;AACA,QAAGD,KAAK,CAAR,EAAW,OAAQ,KAAKF,CAAL,GAAO,CAAR,GAAW,CAACE,CAAZ,GAAcA,CAArB;AACX,WAAM,EAAEvC,CAAF,IAAO,CAAb;AAAgB,UAAG,CAACuC,IAAE,KAAKvC,CAAL,IAAQP,EAAEO,CAAF,CAAX,KAAoB,CAAvB,EAA0B,OAAOuC,CAAP;AAA1C,KACA,OAAO,CAAP;AACD;;AAED;AACA,WAASyB,KAAT,CAAe/D,CAAf,EAAkB;AAChB,QAAIsC,IAAI,CAAR;AAAA,QAAWC,CAAX;AACA,QAAG,CAACA,IAAEvC,MAAI,EAAP,KAAc,CAAjB,EAAoB;AAAEA,UAAIuC,CAAJ,CAAOD,KAAK,EAAL;AAAU;AACvC,QAAG,CAACC,IAAEvC,KAAG,CAAN,KAAY,CAAf,EAAkB;AAAEA,UAAIuC,CAAJ,CAAOD,KAAK,CAAL;AAAS;AACpC,QAAG,CAACC,IAAEvC,KAAG,CAAN,KAAY,CAAf,EAAkB;AAAEA,UAAIuC,CAAJ,CAAOD,KAAK,CAAL;AAAS;AACpC,QAAG,CAACC,IAAEvC,KAAG,CAAN,KAAY,CAAf,EAAkB;AAAEA,UAAIuC,CAAJ,CAAOD,KAAK,CAAL;AAAS;AACpC,QAAG,CAACC,IAAEvC,KAAG,CAAN,KAAY,CAAf,EAAkB;AAAEA,UAAIuC,CAAJ,CAAOD,KAAK,CAAL;AAAS;AACpC,WAAOA,CAAP;AACD;;AAED;AACA,WAAS0B,WAAT,GAAuB;AACrB,QAAG,KAAKzB,CAAL,IAAU,CAAb,EAAgB,OAAO,CAAP;AAChB,WAAO,KAAKpB,EAAL,IAAS,KAAKoB,CAAL,GAAO,CAAhB,IAAmBwB,MAAM,KAAK,KAAKxB,CAAL,GAAO,CAAZ,IAAgB,KAAKH,CAAL,GAAO,KAAKhB,EAAlC,CAA1B;AACD;;AAED;AACA,WAAS6C,YAAT,CAAsB9D,CAAtB,EAAwBmC,CAAxB,EAA2B;AACzB,QAAIvC,CAAJ;AACA,SAAIA,IAAI,KAAKwC,CAAL,GAAO,CAAf,EAAkBxC,KAAK,CAAvB,EAA0B,EAAEA,CAA5B;AAA+BuC,QAAEvC,IAAEI,CAAJ,IAAS,KAAKJ,CAAL,CAAT;AAA/B,KACA,KAAIA,IAAII,IAAE,CAAV,EAAaJ,KAAK,CAAlB,EAAqB,EAAEA,CAAvB;AAA0BuC,QAAEvC,CAAF,IAAO,CAAP;AAA1B,KACAuC,EAAEC,CAAF,GAAM,KAAKA,CAAL,GAAOpC,CAAb;AACAmC,MAAEF,CAAF,GAAM,KAAKA,CAAX;AACD;;AAED;AACA,WAAS8B,YAAT,CAAsB/D,CAAtB,EAAwBmC,CAAxB,EAA2B;AACzB,SAAI,IAAIvC,IAAII,CAAZ,EAAeJ,IAAI,KAAKwC,CAAxB,EAA2B,EAAExC,CAA7B;AAAgCuC,QAAEvC,IAAEI,CAAJ,IAAS,KAAKJ,CAAL,CAAT;AAAhC,KACAuC,EAAEC,CAAF,GAAMlC,KAAK8D,GAAL,CAAS,KAAK5B,CAAL,GAAOpC,CAAhB,EAAkB,CAAlB,CAAN;AACAmC,MAAEF,CAAF,GAAM,KAAKA,CAAX;AACD;;AAED;AACA,WAASgC,WAAT,CAAqBjE,CAArB,EAAuBmC,CAAvB,EAA0B;AACxB,QAAI+B,KAAKlE,IAAE,KAAKgB,EAAhB;AACA,QAAImD,MAAM,KAAKnD,EAAL,GAAQkD,EAAlB;AACA,QAAIE,KAAK,CAAC,KAAGD,GAAJ,IAAS,CAAlB;AACA,QAAIE,KAAKnE,KAAKC,KAAL,CAAWH,IAAE,KAAKgB,EAAlB,CAAT;AAAA,QAAgCzB,IAAK,KAAK0C,CAAL,IAAQiC,EAAT,GAAa,KAAKjD,EAAtD;AAAA,QAA0DrB,CAA1D;AACA,SAAIA,IAAI,KAAKwC,CAAL,GAAO,CAAf,EAAkBxC,KAAK,CAAvB,EAA0B,EAAEA,CAA5B,EAA+B;AAC7BuC,QAAEvC,IAAEyE,EAAF,GAAK,CAAP,IAAa,KAAKzE,CAAL,KAASuE,GAAV,GAAe5E,CAA3B;AACAA,UAAI,CAAC,KAAKK,CAAL,IAAQwE,EAAT,KAAcF,EAAlB;AACD;AACD,SAAItE,IAAIyE,KAAG,CAAX,EAAczE,KAAK,CAAnB,EAAsB,EAAEA,CAAxB;AAA2BuC,QAAEvC,CAAF,IAAO,CAAP;AAA3B,KACAuC,EAAEkC,EAAF,IAAQ9E,CAAR;AACA4C,MAAEC,CAAF,GAAM,KAAKA,CAAL,GAAOiC,EAAP,GAAU,CAAhB;AACAlC,MAAEF,CAAF,GAAM,KAAKA,CAAX;AACAE,MAAEW,KAAF;AACD;;AAED;AACA,WAASwB,WAAT,CAAqBtE,CAArB,EAAuBmC,CAAvB,EAA0B;AACxBA,MAAEF,CAAF,GAAM,KAAKA,CAAX;AACA,QAAIoC,KAAKnE,KAAKC,KAAL,CAAWH,IAAE,KAAKgB,EAAlB,CAAT;AACA,QAAGqD,MAAM,KAAKjC,CAAd,EAAiB;AAAED,QAAEC,CAAF,GAAM,CAAN,CAAS;AAAS;AACrC,QAAI8B,KAAKlE,IAAE,KAAKgB,EAAhB;AACA,QAAImD,MAAM,KAAKnD,EAAL,GAAQkD,EAAlB;AACA,QAAIE,KAAK,CAAC,KAAGF,EAAJ,IAAQ,CAAjB;AACA/B,MAAE,CAAF,IAAO,KAAKkC,EAAL,KAAUH,EAAjB;AACA,SAAI,IAAItE,IAAIyE,KAAG,CAAf,EAAkBzE,IAAI,KAAKwC,CAA3B,EAA8B,EAAExC,CAAhC,EAAmC;AACjCuC,QAAEvC,IAAEyE,EAAF,GAAK,CAAP,KAAa,CAAC,KAAKzE,CAAL,IAAQwE,EAAT,KAAcD,GAA3B;AACAhC,QAAEvC,IAAEyE,EAAJ,IAAU,KAAKzE,CAAL,KAASsE,EAAnB;AACD;AACD,QAAGA,KAAK,CAAR,EAAW/B,EAAE,KAAKC,CAAL,GAAOiC,EAAP,GAAU,CAAZ,KAAkB,CAAC,KAAKpC,CAAL,GAAOmC,EAAR,KAAaD,GAA/B;AACXhC,MAAEC,CAAF,GAAM,KAAKA,CAAL,GAAOiC,EAAb;AACAlC,MAAEW,KAAF;AACD;;AAED;AACA,WAASyB,QAAT,CAAkBlF,CAAlB,EAAoB8C,CAApB,EAAuB;AACrB,QAAIvC,IAAI,CAAR;AAAA,QAAWL,IAAI,CAAf;AAAA,QAAkBkB,IAAIP,KAAKsE,GAAL,CAASnF,EAAE+C,CAAX,EAAa,KAAKA,CAAlB,CAAtB;AACA,WAAMxC,IAAIa,CAAV,EAAa;AACXlB,WAAK,KAAKK,CAAL,IAAQP,EAAEO,CAAF,CAAb;AACAuC,QAAEvC,GAAF,IAASL,IAAE,KAAK0B,EAAhB;AACA1B,YAAM,KAAKyB,EAAX;AACD;AACD,QAAG3B,EAAE+C,CAAF,GAAM,KAAKA,CAAd,EAAiB;AACf7C,WAAKF,EAAE4C,CAAP;AACA,aAAMrC,IAAI,KAAKwC,CAAf,EAAkB;AAChB7C,aAAK,KAAKK,CAAL,CAAL;AACAuC,UAAEvC,GAAF,IAASL,IAAE,KAAK0B,EAAhB;AACA1B,cAAM,KAAKyB,EAAX;AACD;AACDzB,WAAK,KAAK0C,CAAV;AACD,KARD,MASK;AACH1C,WAAK,KAAK0C,CAAV;AACA,aAAMrC,IAAIP,EAAE+C,CAAZ,EAAe;AACb7C,aAAKF,EAAEO,CAAF,CAAL;AACAuC,UAAEvC,GAAF,IAASL,IAAE,KAAK0B,EAAhB;AACA1B,cAAM,KAAKyB,EAAX;AACD;AACDzB,WAAKF,EAAE4C,CAAP;AACD;AACDE,MAAEF,CAAF,GAAO1C,IAAE,CAAH,GAAM,CAAC,CAAP,GAAS,CAAf;AACA,QAAGA,IAAI,CAAC,CAAR,EAAW4C,EAAEvC,GAAF,IAAS,KAAKsB,EAAL,GAAQ3B,CAAjB,CAAX,KACK,IAAGA,IAAI,CAAP,EAAU4C,EAAEvC,GAAF,IAASL,CAAT;AACf4C,MAAEC,CAAF,GAAMxC,CAAN;AACAuC,MAAEW,KAAF;AACD;;AAED;AACA;AACA,WAAS2B,aAAT,CAAuBpF,CAAvB,EAAyB8C,CAAzB,EAA4B;AAC1B,QAAItC,IAAI,KAAK6E,GAAL,EAAR;AAAA,QAAoBC,IAAItF,EAAEqF,GAAF,EAAxB;AACA,QAAI9E,IAAIC,EAAEuC,CAAV;AACAD,MAAEC,CAAF,GAAMxC,IAAE+E,EAAEvC,CAAV;AACA,WAAM,EAAExC,CAAF,IAAO,CAAb;AAAgBuC,QAAEvC,CAAF,IAAO,CAAP;AAAhB,KACA,KAAIA,IAAI,CAAR,EAAWA,IAAI+E,EAAEvC,CAAjB,EAAoB,EAAExC,CAAtB;AAAyBuC,QAAEvC,IAAEC,EAAEuC,CAAN,IAAWvC,EAAEkB,EAAF,CAAK,CAAL,EAAO4D,EAAE/E,CAAF,CAAP,EAAYuC,CAAZ,EAAcvC,CAAd,EAAgB,CAAhB,EAAkBC,EAAEuC,CAApB,CAAX;AAAzB,KACAD,EAAEF,CAAF,GAAM,CAAN;AACAE,MAAEW,KAAF;AACA,QAAG,KAAKb,CAAL,IAAU5C,EAAE4C,CAAf,EAAkB7C,WAAW2D,IAAX,CAAgBC,KAAhB,CAAsBb,CAAtB,EAAwBA,CAAxB;AACnB;;AAED;AACA,WAASyC,WAAT,CAAqBzC,CAArB,EAAwB;AACtB,QAAItC,IAAI,KAAK6E,GAAL,EAAR;AACA,QAAI9E,IAAIuC,EAAEC,CAAF,GAAM,IAAEvC,EAAEuC,CAAlB;AACA,WAAM,EAAExC,CAAF,IAAO,CAAb;AAAgBuC,QAAEvC,CAAF,IAAO,CAAP;AAAhB,KACA,KAAIA,IAAI,CAAR,EAAWA,IAAIC,EAAEuC,CAAF,GAAI,CAAnB,EAAsB,EAAExC,CAAxB,EAA2B;AACzB,UAAIL,IAAIM,EAAEkB,EAAF,CAAKnB,CAAL,EAAOC,EAAED,CAAF,CAAP,EAAYuC,CAAZ,EAAc,IAAEvC,CAAhB,EAAkB,CAAlB,EAAoB,CAApB,CAAR;AACA,UAAG,CAACuC,EAAEvC,IAAEC,EAAEuC,CAAN,KAAUvC,EAAEkB,EAAF,CAAKnB,IAAE,CAAP,EAAS,IAAEC,EAAED,CAAF,CAAX,EAAgBuC,CAAhB,EAAkB,IAAEvC,CAAF,GAAI,CAAtB,EAAwBL,CAAxB,EAA0BM,EAAEuC,CAAF,GAAIxC,CAAJ,GAAM,CAAhC,CAAX,KAAkDC,EAAEqB,EAAvD,EAA2D;AACzDiB,UAAEvC,IAAEC,EAAEuC,CAAN,KAAYvC,EAAEqB,EAAd;AACAiB,UAAEvC,IAAEC,EAAEuC,CAAJ,GAAM,CAAR,IAAa,CAAb;AACD;AACF;AACD,QAAGD,EAAEC,CAAF,GAAM,CAAT,EAAYD,EAAEA,EAAEC,CAAF,GAAI,CAAN,KAAYvC,EAAEkB,EAAF,CAAKnB,CAAL,EAAOC,EAAED,CAAF,CAAP,EAAYuC,CAAZ,EAAc,IAAEvC,CAAhB,EAAkB,CAAlB,EAAoB,CAApB,CAAZ;AACZuC,MAAEF,CAAF,GAAM,CAAN;AACAE,MAAEW,KAAF;AACD;;AAED;AACA;AACA,WAAS+B,WAAT,CAAqBpE,CAArB,EAAuBqE,CAAvB,EAAyB3C,CAAzB,EAA4B;AAC1B,QAAI4C,KAAKtE,EAAEiE,GAAF,EAAT;AACA,QAAGK,GAAG3C,CAAH,IAAQ,CAAX,EAAc;AACd,QAAI4C,KAAK,KAAKN,GAAL,EAAT;AACA,QAAGM,GAAG5C,CAAH,GAAO2C,GAAG3C,CAAb,EAAgB;AACd,UAAG0C,KAAK,IAAR,EAAcA,EAAEvC,OAAF,CAAU,CAAV;AACd,UAAGJ,KAAK,IAAR,EAAc,KAAK8C,MAAL,CAAY9C,CAAZ;AACd;AACD;AACD,QAAGA,KAAK,IAAR,EAAcA,IAAIzC,KAAJ;AACd,QAAIiF,IAAIjF,KAAR;AAAA,QAAewF,KAAK,KAAKjD,CAAzB;AAAA,QAA4BkD,KAAK1E,EAAEwB,CAAnC;AACA,QAAImD,MAAM,KAAKpE,EAAL,GAAQ4C,MAAMmB,GAAGA,GAAG3C,CAAH,GAAK,CAAR,CAAN,CAAlB,CAX0B,CAWa;AACvC,QAAGgD,MAAM,CAAT,EAAY;AAAEL,SAAGM,QAAH,CAAYD,GAAZ,EAAgBT,CAAhB,EAAoBK,GAAGK,QAAH,CAAYD,GAAZ,EAAgBjD,CAAhB;AAAqB,KAAvD,MACK;AAAE4C,SAAGE,MAAH,CAAUN,CAAV,EAAcK,GAAGC,MAAH,CAAU9C,CAAV;AAAe;AACpC,QAAImD,KAAKX,EAAEvC,CAAX;AACA,QAAImD,KAAKZ,EAAEW,KAAG,CAAL,CAAT;AACA,QAAGC,MAAM,CAAT,EAAY;AACZ,QAAIC,KAAKD,MAAI,KAAG,KAAKjE,EAAZ,KAAkBgE,KAAG,CAAJ,GAAOX,EAAEW,KAAG,CAAL,KAAS,KAAK/D,EAArB,GAAwB,CAAzC,CAAT;AACA,QAAIkE,KAAK,KAAKrE,EAAL,GAAQoE,EAAjB;AAAA,QAAqBE,KAAK,CAAC,KAAG,KAAKpE,EAAT,IAAakE,EAAvC;AAAA,QAA2CG,IAAI,KAAG,KAAKpE,EAAvD;AACA,QAAI3B,IAAIuC,EAAEC,CAAV;AAAA,QAAarC,IAAIH,IAAE0F,EAAnB;AAAA,QAAuBlD,IAAK0C,KAAG,IAAJ,GAAUpF,KAAV,GAAgBoF,CAA3C;AACAH,MAAEiB,SAAF,CAAY7F,CAAZ,EAAcqC,CAAd;AACA,QAAGD,EAAE0D,SAAF,CAAYzD,CAAZ,KAAkB,CAArB,EAAwB;AACtBD,QAAEA,EAAEC,CAAF,EAAF,IAAW,CAAX;AACAD,QAAEa,KAAF,CAAQZ,CAAR,EAAUD,CAAV;AACD;AACD/C,eAAW0G,GAAX,CAAeF,SAAf,CAAyBN,EAAzB,EAA4BlD,CAA5B;AACAA,MAAEY,KAAF,CAAQ2B,CAAR,EAAUA,CAAV,EA1B0B,CA0BX;AACf,WAAMA,EAAEvC,CAAF,GAAMkD,EAAZ;AAAgBX,QAAEA,EAAEvC,CAAF,EAAF,IAAW,CAAX;AAAhB,KACA,OAAM,EAAErC,CAAF,IAAO,CAAb,EAAgB;AACd;AACA,UAAIgG,KAAM5D,EAAE,EAAEvC,CAAJ,KAAQ2F,EAAT,GAAa,KAAKtE,EAAlB,GAAqBf,KAAKC,KAAL,CAAWgC,EAAEvC,CAAF,IAAK6F,EAAL,GAAQ,CAACtD,EAAEvC,IAAE,CAAJ,IAAO+F,CAAR,IAAWD,EAA9B,CAA9B;AACA,UAAG,CAACvD,EAAEvC,CAAF,KAAM+E,EAAE5D,EAAF,CAAK,CAAL,EAAOgF,EAAP,EAAU5D,CAAV,EAAYpC,CAAZ,EAAc,CAAd,EAAgBuF,EAAhB,CAAP,IAA8BS,EAAjC,EAAqC;AAAI;AACvCpB,UAAEiB,SAAF,CAAY7F,CAAZ,EAAcqC,CAAd;AACAD,UAAEa,KAAF,CAAQZ,CAAR,EAAUD,CAAV;AACA,eAAMA,EAAEvC,CAAF,IAAO,EAAEmG,EAAf;AAAmB5D,YAAEa,KAAF,CAAQZ,CAAR,EAAUD,CAAV;AAAnB;AACD;AACF;AACD,QAAG2C,KAAK,IAAR,EAAc;AACZ3C,QAAE6D,SAAF,CAAYV,EAAZ,EAAeR,CAAf;AACA,UAAGI,MAAMC,EAAT,EAAa/F,WAAW2D,IAAX,CAAgBC,KAAhB,CAAsB8B,CAAtB,EAAwBA,CAAxB;AACd;AACD3C,MAAEC,CAAF,GAAMkD,EAAN;AACAnD,MAAEW,KAAF;AACA,QAAGsC,MAAM,CAAT,EAAYjD,EAAE8D,QAAF,CAAWb,GAAX,EAAejD,CAAf,EA3Cc,CA2CK;AAC/B,QAAG+C,KAAK,CAAR,EAAW9F,WAAW2D,IAAX,CAAgBC,KAAhB,CAAsBb,CAAtB,EAAwBA,CAAxB;AACZ;;AAED;AACA,WAAS+D,KAAT,CAAe7G,CAAf,EAAkB;AAChB,QAAI8C,IAAIzC,KAAR;AACA,SAAKgF,GAAL,GAAWyB,QAAX,CAAoB9G,CAApB,EAAsB,IAAtB,EAA2B8C,CAA3B;AACA,QAAG,KAAKF,CAAL,GAAS,CAAT,IAAcE,EAAE0D,SAAF,CAAYzG,WAAW2D,IAAvB,IAA+B,CAAhD,EAAmD1D,EAAE2D,KAAF,CAAQb,CAAR,EAAUA,CAAV;AACnD,WAAOA,CAAP;AACD;;AAED;AACA,WAASiE,OAAT,CAAiB3F,CAAjB,EAAoB;AAAE,SAAKA,CAAL,GAASA,CAAT;AAAa;AACnC,WAAS4F,QAAT,CAAkBxG,CAAlB,EAAqB;AACnB,QAAGA,EAAEoC,CAAF,GAAM,CAAN,IAAWpC,EAAEgG,SAAF,CAAY,KAAKpF,CAAjB,KAAuB,CAArC,EAAwC,OAAOZ,EAAEyG,GAAF,CAAM,KAAK7F,CAAX,CAAP,CAAxC,KACK,OAAOZ,CAAP;AACN;AACD,WAAS0G,OAAT,CAAiB1G,CAAjB,EAAoB;AAAE,WAAOA,CAAP;AAAW;AACjC,WAAS2G,OAAT,CAAiB3G,CAAjB,EAAoB;AAAEA,MAAEsG,QAAF,CAAW,KAAK1F,CAAhB,EAAkB,IAAlB,EAAuBZ,CAAvB;AAA4B;AAClD,WAAS4G,MAAT,CAAgB5G,CAAhB,EAAkB8E,CAAlB,EAAoBxC,CAApB,EAAuB;AAAEtC,MAAE6G,UAAF,CAAa/B,CAAb,EAAexC,CAAf,EAAmB,KAAKwE,MAAL,CAAYxE,CAAZ;AAAiB;AAC7D,WAASyE,MAAT,CAAgB/G,CAAhB,EAAkBsC,CAAlB,EAAqB;AAAEtC,MAAEgH,QAAF,CAAW1E,CAAX,EAAe,KAAKwE,MAAL,CAAYxE,CAAZ;AAAiB;;AAEvDiE,UAAQtF,SAAR,CAAkBgG,OAAlB,GAA4BT,QAA5B;AACAD,UAAQtF,SAAR,CAAkBiG,MAAlB,GAA2BR,OAA3B;AACAH,UAAQtF,SAAR,CAAkB6F,MAAlB,GAA2BH,OAA3B;AACAJ,UAAQtF,SAAR,CAAkBkG,KAAlB,GAA0BP,MAA1B;AACAL,UAAQtF,SAAR,CAAkBmG,KAAlB,GAA0BL,MAA1B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAASM,WAAT,GAAuB;AACrB,QAAG,KAAK9E,CAAL,GAAS,CAAZ,EAAe,OAAO,CAAP;AACf,QAAIvC,IAAI,KAAK,CAAL,CAAR;AACA,QAAG,CAACA,IAAE,CAAH,KAAS,CAAZ,EAAe,OAAO,CAAP;AACf,QAAI8E,IAAI9E,IAAE,CAAV,CAJqB,CAIF;AACnB8E,QAAKA,KAAG,IAAE,CAAC9E,IAAE,GAAH,IAAQ8E,CAAb,CAAD,GAAkB,GAAtB,CALqB,CAKM;AAC3BA,QAAKA,KAAG,IAAE,CAAC9E,IAAE,IAAH,IAAS8E,CAAd,CAAD,GAAmB,IAAvB,CANqB,CAMU;AAC/BA,QAAKA,KAAG,KAAI,CAAC9E,IAAE,MAAH,IAAW8E,CAAZ,GAAe,MAAlB,CAAH,CAAD,GAAgC,MAApC,CAPqB,CAO0B;AAC/C;AACA;AACAA,QAAKA,KAAG,IAAE9E,IAAE8E,CAAF,GAAI,KAAKzD,EAAd,CAAD,GAAoB,KAAKA,EAA7B,CAVqB,CAUkB;AACvC;AACA,WAAQyD,IAAE,CAAH,GAAM,KAAKzD,EAAL,GAAQyD,CAAd,GAAgB,CAACA,CAAxB;AACD;;AAED;AACA,WAASwC,UAAT,CAAoB1G,CAApB,EAAuB;AACrB,SAAKA,CAAL,GAASA,CAAT;AACA,SAAK2G,EAAL,GAAU3G,EAAE4G,QAAF,EAAV;AACA,SAAKC,GAAL,GAAW,KAAKF,EAAL,GAAQ,MAAnB;AACA,SAAKG,GAAL,GAAW,KAAKH,EAAL,IAAS,EAApB;AACA,SAAKI,EAAL,GAAU,CAAC,KAAI/G,EAAEO,EAAF,GAAK,EAAV,IAAe,CAAzB;AACA,SAAKyG,GAAL,GAAW,IAAEhH,EAAE2B,CAAf;AACD;;AAED;AACA,WAASsF,WAAT,CAAqB7H,CAArB,EAAwB;AACtB,QAAIsC,IAAIzC,KAAR;AACAG,MAAE6E,GAAF,GAAQkB,SAAR,CAAkB,KAAKnF,CAAL,CAAO2B,CAAzB,EAA2BD,CAA3B;AACAA,MAAEgE,QAAF,CAAW,KAAK1F,CAAhB,EAAkB,IAAlB,EAAuB0B,CAAvB;AACA,QAAGtC,EAAEoC,CAAF,GAAM,CAAN,IAAWE,EAAE0D,SAAF,CAAYzG,WAAW2D,IAAvB,IAA+B,CAA7C,EAAgD,KAAKtC,CAAL,CAAOuC,KAAP,CAAab,CAAb,EAAeA,CAAf;AAChD,WAAOA,CAAP;AACD;;AAED;AACA,WAASwF,UAAT,CAAoB9H,CAApB,EAAuB;AACrB,QAAIsC,IAAIzC,KAAR;AACAG,MAAEoF,MAAF,CAAS9C,CAAT;AACA,SAAKwE,MAAL,CAAYxE,CAAZ;AACA,WAAOA,CAAP;AACD;;AAED;AACA,WAASyF,UAAT,CAAoB/H,CAApB,EAAuB;AACrB,WAAMA,EAAEuC,CAAF,IAAO,KAAKqF,GAAlB;AAAuB;AACrB5H,QAAEA,EAAEuC,CAAF,EAAF,IAAW,CAAX;AADF,KAEA,KAAI,IAAIxC,IAAI,CAAZ,EAAeA,IAAI,KAAKa,CAAL,CAAO2B,CAA1B,EAA6B,EAAExC,CAA/B,EAAkC;AAChC;AACA,UAAIG,IAAIF,EAAED,CAAF,IAAK,MAAb;AACA,UAAIiI,KAAM9H,IAAE,KAAKuH,GAAP,IAAY,CAAEvH,IAAE,KAAKwH,GAAP,GAAW,CAAC1H,EAAED,CAAF,KAAM,EAAP,IAAW,KAAK0H,GAA5B,GAAiC,KAAKE,EAAvC,KAA4C,EAAxD,CAAD,GAA8D3H,EAAEoB,EAAzE;AACA;AACAlB,UAAIH,IAAE,KAAKa,CAAL,CAAO2B,CAAb;AACAvC,QAAEE,CAAF,KAAQ,KAAKU,CAAL,CAAOM,EAAP,CAAU,CAAV,EAAY8G,EAAZ,EAAehI,CAAf,EAAiBD,CAAjB,EAAmB,CAAnB,EAAqB,KAAKa,CAAL,CAAO2B,CAA5B,CAAR;AACA;AACA,aAAMvC,EAAEE,CAAF,KAAQF,EAAEqB,EAAhB,EAAoB;AAAErB,UAAEE,CAAF,KAAQF,EAAEqB,EAAV,CAAcrB,EAAE,EAAEE,CAAJ;AAAW;AAChD;AACDF,MAAEiD,KAAF;AACAjD,MAAEmG,SAAF,CAAY,KAAKvF,CAAL,CAAO2B,CAAnB,EAAqBvC,CAArB;AACA,QAAGA,EAAEgG,SAAF,CAAY,KAAKpF,CAAjB,KAAuB,CAA1B,EAA6BZ,EAAEmD,KAAF,CAAQ,KAAKvC,CAAb,EAAeZ,CAAf;AAC9B;;AAED;AACA,WAASiI,SAAT,CAAmBjI,CAAnB,EAAqBsC,CAArB,EAAwB;AAAEtC,MAAEgH,QAAF,CAAW1E,CAAX,EAAe,KAAKwE,MAAL,CAAYxE,CAAZ;AAAiB;;AAE1D;AACA,WAAS4F,SAAT,CAAmBlI,CAAnB,EAAqB8E,CAArB,EAAuBxC,CAAvB,EAA0B;AAAEtC,MAAE6G,UAAF,CAAa/B,CAAb,EAAexC,CAAf,EAAmB,KAAKwE,MAAL,CAAYxE,CAAZ;AAAiB;;AAEhEgF,aAAWrG,SAAX,CAAqBgG,OAArB,GAA+BY,WAA/B;AACAP,aAAWrG,SAAX,CAAqBiG,MAArB,GAA8BY,UAA9B;AACAR,aAAWrG,SAAX,CAAqB6F,MAArB,GAA8BiB,UAA9B;AACAT,aAAWrG,SAAX,CAAqBkG,KAArB,GAA6Be,SAA7B;AACAZ,aAAWrG,SAAX,CAAqBmG,KAArB,GAA6Ba,SAA7B;;AAEA;AACA,WAASE,SAAT,GAAqB;AAAE,WAAO,CAAE,KAAK5F,CAAL,GAAO,CAAR,GAAY,KAAK,CAAL,IAAQ,CAApB,GAAuB,KAAKH,CAA7B,KAAmC,CAA1C;AAA8C;;AAErE;AACA,WAASgG,MAAT,CAAgBtC,CAAhB,EAAkBuC,CAAlB,EAAqB;AACnB,QAAGvC,IAAI,UAAJ,IAAkBA,IAAI,CAAzB,EAA4B,OAAOvG,WAAW0G,GAAlB;AAC5B,QAAI3D,IAAIzC,KAAR;AAAA,QAAeyI,KAAKzI,KAApB;AAAA,QAA2B0I,IAAIF,EAAEpB,OAAF,CAAU,IAAV,CAA/B;AAAA,QAAgDlH,IAAIgE,MAAM+B,CAAN,IAAS,CAA7D;AACAyC,MAAEnD,MAAF,CAAS9C,CAAT;AACA,WAAM,EAAEvC,CAAF,IAAO,CAAb,EAAgB;AACdsI,QAAEjB,KAAF,CAAQ9E,CAAR,EAAUgG,EAAV;AACA,UAAG,CAACxC,IAAG,KAAG/F,CAAP,IAAa,CAAhB,EAAmBsI,EAAElB,KAAF,CAAQmB,EAAR,EAAWC,CAAX,EAAajG,CAAb,EAAnB,KACK;AAAE,YAAIC,IAAID,CAAR,CAAWA,IAAIgG,EAAJ,CAAQA,KAAK/F,CAAL;AAAS;AACpC;AACD,WAAO8F,EAAEnB,MAAF,CAAS5E,CAAT,CAAP;AACD;;AAED;AACA,WAASkG,WAAT,CAAqB1C,CAArB,EAAuBlF,CAAvB,EAA0B;AACxB,QAAIyH,CAAJ;AACA,QAAGvC,IAAI,GAAJ,IAAWlF,EAAE6H,MAAF,EAAd,EAA0BJ,IAAI,IAAI9B,OAAJ,CAAY3F,CAAZ,CAAJ,CAA1B,KAAmDyH,IAAI,IAAIf,UAAJ,CAAe1G,CAAf,CAAJ;AACnD,WAAO,KAAK8H,GAAL,CAAS5C,CAAT,EAAWuC,CAAX,CAAP;AACD;;AAED;AACA9I,aAAW0B,SAAX,CAAqBmE,MAArB,GAA8B/C,SAA9B;AACA9C,aAAW0B,SAAX,CAAqByB,OAArB,GAA+BF,UAA/B;AACAjD,aAAW0B,SAAX,CAAqBrB,UAArB,GAAkC+C,aAAlC;AACApD,aAAW0B,SAAX,CAAqBgC,KAArB,GAA6BG,QAA7B;AACA7D,aAAW0B,SAAX,CAAqB8E,SAArB,GAAiC9B,YAAjC;AACA1E,aAAW0B,SAAX,CAAqBkF,SAArB,GAAiCjC,YAAjC;AACA3E,aAAW0B,SAAX,CAAqBuE,QAArB,GAAgCpB,WAAhC;AACA7E,aAAW0B,SAAX,CAAqBmF,QAArB,GAAgC3B,WAAhC;AACAlF,aAAW0B,SAAX,CAAqBkC,KAArB,GAA6BuB,QAA7B;AACAnF,aAAW0B,SAAX,CAAqB4F,UAArB,GAAkCjC,aAAlC;AACArF,aAAW0B,SAAX,CAAqB+F,QAArB,GAAgCjC,WAAhC;AACAxF,aAAW0B,SAAX,CAAqBqF,QAArB,GAAgCtB,WAAhC;AACAzF,aAAW0B,SAAX,CAAqBuG,QAArB,GAAgCH,WAAhC;AACA9H,aAAW0B,SAAX,CAAqBwH,MAArB,GAA8BN,SAA9B;AACA5I,aAAW0B,SAAX,CAAqByH,GAArB,GAA2BN,MAA3B;;AAEA;AACA7I,aAAW0B,SAAX,CAAqBsC,QAArB,GAAgCF,UAAhC;AACA9D,aAAW0B,SAAX,CAAqBqC,MAArB,GAA8BM,QAA9B;AACArE,aAAW0B,SAAX,CAAqB4D,GAArB,GAA2BhB,KAA3B;AACAtE,aAAW0B,SAAX,CAAqB+E,SAArB,GAAiClC,WAAjC;AACAvE,aAAW0B,SAAX,CAAqB0H,SAArB,GAAiC3E,WAAjC;AACAzE,aAAW0B,SAAX,CAAqBwF,GAArB,GAA2BJ,KAA3B;AACA9G,aAAW0B,SAAX,CAAqB2H,SAArB,GAAiCJ,WAAjC;;AAEA;AACAjJ,aAAW2D,IAAX,GAAkBT,IAAI,CAAJ,CAAlB;AACAlD,aAAW0G,GAAX,GAAiBxD,IAAI,CAAJ,CAAjB;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA,WAASoG,OAAT,GAAmB;AAAE,QAAIvG,IAAIzC,KAAR,CAAe,KAAKuF,MAAL,CAAY9C,CAAZ,EAAgB,OAAOA,CAAP;AAAW;;AAE/D;AACA,WAASwG,UAAT,GAAsB;AACpB,QAAG,KAAK1G,CAAL,GAAS,CAAZ,EAAe;AACb,UAAG,KAAKG,CAAL,IAAU,CAAb,EAAgB,OAAO,KAAK,CAAL,IAAQ,KAAKlB,EAApB,CAAhB,KACK,IAAG,KAAKkB,CAAL,IAAU,CAAb,EAAgB,OAAO,CAAC,CAAR;AACtB,KAHD,MAIK,IAAG,KAAKA,CAAL,IAAU,CAAb,EAAgB,OAAO,KAAK,CAAL,CAAP,CAAhB,KACA,IAAG,KAAKA,CAAL,IAAU,CAAb,EAAgB,OAAO,CAAP;AACrB;AACA,WAAQ,CAAC,KAAK,CAAL,IAAS,CAAC,KAAI,KAAG,KAAKpB,EAAb,IAAkB,CAA5B,KAAiC,KAAKA,EAAvC,GAA2C,KAAK,CAAL,CAAlD;AACD;;AAED;AACA,WAAS4H,WAAT,GAAuB;AAAE,WAAQ,KAAKxG,CAAL,IAAQ,CAAT,GAAY,KAAKH,CAAjB,GAAoB,KAAK,CAAL,KAAS,EAAV,IAAe,EAAzC;AAA8C;;AAEvE;AACA,WAAS4G,YAAT,GAAwB;AAAE,WAAQ,KAAKzG,CAAL,IAAQ,CAAT,GAAY,KAAKH,CAAjB,GAAoB,KAAK,CAAL,KAAS,EAAV,IAAe,EAAzC;AAA8C;;AAExE;AACA,WAAS6G,YAAT,CAAsB3G,CAAtB,EAAyB;AAAE,WAAOjC,KAAKC,KAAL,CAAWD,KAAK6I,GAAL,GAAS,KAAK/H,EAAd,GAAiBd,KAAK8I,GAAL,CAAS7G,CAAT,CAA5B,CAAP;AAAkD;;AAE7E;AACA,WAAS8G,QAAT,GAAoB;AAClB,QAAG,KAAKhH,CAAL,GAAS,CAAZ,EAAe,OAAO,CAAC,CAAR,CAAf,KACK,IAAG,KAAKG,CAAL,IAAU,CAAV,IAAgB,KAAKA,CAAL,IAAU,CAAV,IAAe,KAAK,CAAL,KAAW,CAA7C,EAAiD,OAAO,CAAP,CAAjD,KACA,OAAO,CAAP;AACN;;AAED;AACA,WAAS8G,UAAT,CAAoB5J,CAApB,EAAuB;AACrB,QAAGA,KAAK,IAAR,EAAcA,IAAI,EAAJ;AACd,QAAG,KAAK6J,MAAL,MAAiB,CAAjB,IAAsB7J,IAAI,CAA1B,IAA+BA,IAAI,EAAtC,EAA0C,OAAO,GAAP;AAC1C,QAAI8J,KAAK,KAAKC,SAAL,CAAe/J,CAAf,CAAT;AACA,QAAID,IAAIa,KAAKmB,GAAL,CAAS/B,CAAT,EAAW8J,EAAX,CAAR;AACA,QAAI7F,IAAIjB,IAAIjD,CAAJ,CAAR;AAAA,QAAgBsF,IAAIjF,KAApB;AAAA,QAA2BwI,IAAIxI,KAA/B;AAAA,QAAsCyC,IAAI,EAA1C;AACA,SAAKgE,QAAL,CAAc5C,CAAd,EAAgBoB,CAAhB,EAAkBuD,CAAlB;AACA,WAAMvD,EAAEwE,MAAF,KAAa,CAAnB,EAAsB;AACpBhH,UAAI,CAAC9C,IAAE6I,EAAEoB,QAAF,EAAH,EAAiBlG,QAAjB,CAA0B9D,CAA1B,EAA6BiK,MAA7B,CAAoC,CAApC,IAAyCpH,CAA7C;AACAwC,QAAEwB,QAAF,CAAW5C,CAAX,EAAaoB,CAAb,EAAeuD,CAAf;AACD;AACD,WAAOA,EAAEoB,QAAF,GAAalG,QAAb,CAAsB9D,CAAtB,IAA2B6C,CAAlC;AACD;;AAED;AACA,WAASqH,YAAT,CAAsBvH,CAAtB,EAAwB3C,CAAxB,EAA2B;AACzB,SAAKiD,OAAL,CAAa,CAAb;AACA,QAAGjD,KAAK,IAAR,EAAcA,IAAI,EAAJ;AACd,QAAI8J,KAAK,KAAKC,SAAL,CAAe/J,CAAf,CAAT;AACA,QAAIiE,IAAIrD,KAAKmB,GAAL,CAAS/B,CAAT,EAAW8J,EAAX,CAAR;AAAA,QAAwBxG,KAAK,KAA7B;AAAA,QAAoC7C,IAAI,CAAxC;AAAA,QAA2CD,IAAI,CAA/C;AACA,SAAI,IAAIF,IAAI,CAAZ,EAAeA,IAAIqC,EAAEU,MAArB,EAA6B,EAAE/C,CAA/B,EAAkC;AAChC,UAAIC,IAAImC,MAAMC,CAAN,EAAQrC,CAAR,CAAR;AACA,UAAGC,IAAI,CAAP,EAAU;AACR,YAAGoC,EAAEF,MAAF,CAASnC,CAAT,KAAe,GAAf,IAAsB,KAAKuJ,MAAL,MAAiB,CAA1C,EAA6CvG,KAAK,IAAL;AAC7C;AACD;AACD9C,UAAIR,IAAEQ,CAAF,GAAID,CAAR;AACA,UAAG,EAAEE,CAAF,IAAOqJ,EAAV,EAAc;AACZ,aAAKK,SAAL,CAAelG,CAAf;AACA,aAAKmG,UAAL,CAAgB5J,CAAhB,EAAkB,CAAlB;AACAC,YAAI,CAAJ;AACAD,YAAI,CAAJ;AACD;AACF;AACD,QAAGC,IAAI,CAAP,EAAU;AACR,WAAK0J,SAAL,CAAevJ,KAAKmB,GAAL,CAAS/B,CAAT,EAAWS,CAAX,CAAf;AACA,WAAK2J,UAAL,CAAgB5J,CAAhB,EAAkB,CAAlB;AACD;AACD,QAAG8C,EAAH,EAAOxD,WAAW2D,IAAX,CAAgBC,KAAhB,CAAsB,IAAtB,EAA2B,IAA3B;AACR;;AAED;AACA,WAAS2G,aAAT,CAAuBtK,CAAvB,EAAyBC,CAAzB,EAA2BC,CAA3B,EAA8B;AAC5B,QAAG,YAAY,OAAOD,CAAtB,EAAyB;AACvB;AACA,UAAGD,IAAI,CAAP,EAAU,KAAKkD,OAAL,CAAa,CAAb,EAAV,KACK;AACH,aAAK/C,UAAL,CAAgBH,CAAhB,EAAkBE,CAAlB;AACA,YAAG,CAAC,KAAKqK,OAAL,CAAavK,IAAE,CAAf,CAAJ,EAAuB;AACrB,eAAKwK,SAAL,CAAezK,WAAW0G,GAAX,CAAegE,SAAf,CAAyBzK,IAAE,CAA3B,CAAf,EAA6C0K,KAA7C,EAAmD,IAAnD;AACF,YAAG,KAAKzB,MAAL,EAAH,EAAkB,KAAKoB,UAAL,CAAgB,CAAhB,EAAkB,CAAlB,EAJf,CAIqC;AACxC,eAAM,CAAC,KAAKM,eAAL,CAAqB1K,CAArB,CAAP,EAAgC;AAC9B,eAAKoK,UAAL,CAAgB,CAAhB,EAAkB,CAAlB;AACA,cAAG,KAAKlB,SAAL,KAAmBnJ,CAAtB,EAAyB,KAAK2D,KAAL,CAAW5D,WAAW0G,GAAX,CAAegE,SAAf,CAAyBzK,IAAE,CAA3B,CAAX,EAAyC,IAAzC;AAC1B;AACF;AACF,KAbD,MAcK;AACH;AACA,UAAIQ,IAAI,IAAI6B,KAAJ,EAAR;AAAA,UAAqBU,IAAI/C,IAAE,CAA3B;AACAQ,QAAE8C,MAAF,GAAW,CAACtD,KAAG,CAAJ,IAAO,CAAlB;AACAC,QAAE2K,SAAF,CAAYpK,CAAZ;AACA,UAAGuC,IAAI,CAAP,EAAUvC,EAAE,CAAF,KAAS,CAAC,KAAGuC,CAAJ,IAAO,CAAhB,CAAV,KAAmCvC,EAAE,CAAF,IAAO,CAAP;AACnC,WAAKJ,UAAL,CAAgBI,CAAhB,EAAkB,GAAlB;AACD;AACF;;AAED;AACA,WAASqK,aAAT,GAAyB;AACvB,QAAItK,IAAI,KAAKwC,CAAb;AAAA,QAAgBD,IAAI,IAAIT,KAAJ,EAApB;AACAS,MAAE,CAAF,IAAO,KAAKF,CAAZ;AACA,QAAIuB,IAAI,KAAKxC,EAAL,GAASpB,IAAE,KAAKoB,EAAR,GAAY,CAA5B;AAAA,QAA+BuC,CAA/B;AAAA,QAAkCd,IAAI,CAAtC;AACA,QAAG7C,MAAM,CAAT,EAAY;AACV,UAAG4D,IAAI,KAAKxC,EAAT,IAAe,CAACuC,IAAI,KAAK3D,CAAL,KAAS4D,CAAd,KAAoB,CAAC,KAAKvB,CAAL,GAAO,KAAKhB,EAAb,KAAkBuC,CAAxD,EACErB,EAAEM,GAAF,IAASc,IAAG,KAAKtB,CAAL,IAAS,KAAKjB,EAAL,GAAQwC,CAA7B;AACF,aAAM5D,KAAK,CAAX,EAAc;AACZ,YAAG4D,IAAI,CAAP,EAAU;AACRD,cAAI,CAAC,KAAK3D,CAAL,IAAS,CAAC,KAAG4D,CAAJ,IAAO,CAAjB,KAAuB,IAAEA,CAA7B;AACAD,eAAK,KAAK,EAAE3D,CAAP,MAAY4D,KAAG,KAAKxC,EAAL,GAAQ,CAAvB,CAAL;AACD,SAHD,MAIK;AACHuC,cAAK,KAAK3D,CAAL,MAAU4D,KAAG,CAAb,CAAD,GAAkB,IAAtB;AACA,cAAGA,KAAK,CAAR,EAAW;AAAEA,iBAAK,KAAKxC,EAAV,CAAc,EAAEpB,CAAF;AAAM;AAClC;AACD,YAAG,CAAC2D,IAAE,IAAH,KAAY,CAAf,EAAkBA,KAAK,CAAC,GAAN;AAClB,YAAGd,KAAK,CAAL,IAAU,CAAC,KAAKR,CAAL,GAAO,IAAR,MAAkBsB,IAAE,IAApB,CAAb,EAAwC,EAAEd,CAAF;AACxC,YAAGA,IAAI,CAAJ,IAASc,KAAK,KAAKtB,CAAtB,EAAyBE,EAAEM,GAAF,IAASc,CAAT;AAC1B;AACF;AACD,WAAOpB,CAAP;AACD;;AAED,WAASgI,QAAT,CAAkB9K,CAAlB,EAAqB;AAAE,WAAO,KAAKwG,SAAL,CAAexG,CAAf,KAAmB,CAA1B;AAA+B;AACtD,WAAS+K,KAAT,CAAe/K,CAAf,EAAkB;AAAE,WAAO,KAAKwG,SAAL,CAAexG,CAAf,IAAkB,CAAnB,GAAsB,IAAtB,GAA2BA,CAAjC;AAAqC;AACzD,WAASgL,KAAT,CAAehL,CAAf,EAAkB;AAAE,WAAO,KAAKwG,SAAL,CAAexG,CAAf,IAAkB,CAAnB,GAAsB,IAAtB,GAA2BA,CAAjC;AAAqC;;AAEzD;AACA,WAASiL,YAAT,CAAsBjL,CAAtB,EAAwBkL,EAAxB,EAA2BpI,CAA3B,EAA8B;AAC5B,QAAIvC,CAAJ;AAAA,QAAO4K,CAAP;AAAA,QAAU/J,IAAIP,KAAKsE,GAAL,CAASnF,EAAE+C,CAAX,EAAa,KAAKA,CAAlB,CAAd;AACA,SAAIxC,IAAI,CAAR,EAAWA,IAAIa,CAAf,EAAkB,EAAEb,CAApB;AAAuBuC,QAAEvC,CAAF,IAAO2K,GAAG,KAAK3K,CAAL,CAAH,EAAWP,EAAEO,CAAF,CAAX,CAAP;AAAvB,KACA,IAAGP,EAAE+C,CAAF,GAAM,KAAKA,CAAd,EAAiB;AACfoI,UAAInL,EAAE4C,CAAF,GAAI,KAAKhB,EAAb;AACA,WAAIrB,IAAIa,CAAR,EAAWb,IAAI,KAAKwC,CAApB,EAAuB,EAAExC,CAAzB;AAA4BuC,UAAEvC,CAAF,IAAO2K,GAAG,KAAK3K,CAAL,CAAH,EAAW4K,CAAX,CAAP;AAA5B,OACArI,EAAEC,CAAF,GAAM,KAAKA,CAAX;AACD,KAJD,MAKK;AACHoI,UAAI,KAAKvI,CAAL,GAAO,KAAKhB,EAAhB;AACA,WAAIrB,IAAIa,CAAR,EAAWb,IAAIP,EAAE+C,CAAjB,EAAoB,EAAExC,CAAtB;AAAyBuC,UAAEvC,CAAF,IAAO2K,GAAGC,CAAH,EAAKnL,EAAEO,CAAF,CAAL,CAAP;AAAzB,OACAuC,EAAEC,CAAF,GAAM/C,EAAE+C,CAAR;AACD;AACDD,MAAEF,CAAF,GAAMsI,GAAG,KAAKtI,CAAR,EAAU5C,EAAE4C,CAAZ,CAAN;AACAE,MAAEW,KAAF;AACD;;AAED;AACA,WAAS2H,MAAT,CAAgB5K,CAAhB,EAAkB8E,CAAlB,EAAqB;AAAE,WAAO9E,IAAE8E,CAAT;AAAa;AACpC,WAAS+F,KAAT,CAAerL,CAAf,EAAkB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKmK,SAAL,CAAexK,CAAf,EAAiBoL,MAAjB,EAAwBtI,CAAxB,EAA4B,OAAOA,CAAP;AAAW;;AAE1E;AACA,WAAS4H,KAAT,CAAelK,CAAf,EAAiB8E,CAAjB,EAAoB;AAAE,WAAO9E,IAAE8E,CAAT;AAAa;AACnC,WAASgG,IAAT,CAActL,CAAd,EAAiB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKmK,SAAL,CAAexK,CAAf,EAAiB0K,KAAjB,EAAuB5H,CAAvB,EAA2B,OAAOA,CAAP;AAAW;;AAExE;AACA,WAASyI,MAAT,CAAgB/K,CAAhB,EAAkB8E,CAAlB,EAAqB;AAAE,WAAO9E,IAAE8E,CAAT;AAAa;AACpC,WAASkG,KAAT,CAAexL,CAAf,EAAkB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKmK,SAAL,CAAexK,CAAf,EAAiBuL,MAAjB,EAAwBzI,CAAxB,EAA4B,OAAOA,CAAP;AAAW;;AAE1E;AACA,WAAS2I,SAAT,CAAmBjL,CAAnB,EAAqB8E,CAArB,EAAwB;AAAE,WAAO9E,IAAE,CAAC8E,CAAV;AAAc;AACxC,WAASoG,QAAT,CAAkB1L,CAAlB,EAAqB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKmK,SAAL,CAAexK,CAAf,EAAiByL,SAAjB,EAA2B3I,CAA3B,EAA+B,OAAOA,CAAP;AAAW;;AAEhF;AACA,WAAS6I,KAAT,GAAiB;AACf,QAAI7I,IAAIzC,KAAR;AACA,SAAI,IAAIE,IAAI,CAAZ,EAAeA,IAAI,KAAKwC,CAAxB,EAA2B,EAAExC,CAA7B;AAAgCuC,QAAEvC,CAAF,IAAO,KAAKqB,EAAL,GAAQ,CAAC,KAAKrB,CAAL,CAAhB;AAAhC,KACAuC,EAAEC,CAAF,GAAM,KAAKA,CAAX;AACAD,MAAEF,CAAF,GAAM,CAAC,KAAKA,CAAZ;AACA,WAAOE,CAAP;AACD;;AAED;AACA,WAAS8I,WAAT,CAAqBjL,CAArB,EAAwB;AACtB,QAAImC,IAAIzC,KAAR;AACA,QAAGM,IAAI,CAAP,EAAU,KAAKiG,QAAL,CAAc,CAACjG,CAAf,EAAiBmC,CAAjB,EAAV,KAAoC,KAAKkD,QAAL,CAAcrF,CAAd,EAAgBmC,CAAhB;AACpC,WAAOA,CAAP;AACD;;AAED;AACA,WAAS+I,YAAT,CAAsBlL,CAAtB,EAAyB;AACvB,QAAImC,IAAIzC,KAAR;AACA,QAAGM,IAAI,CAAP,EAAU,KAAKqF,QAAL,CAAc,CAACrF,CAAf,EAAiBmC,CAAjB,EAAV,KAAoC,KAAK8D,QAAL,CAAcjG,CAAd,EAAgBmC,CAAhB;AACpC,WAAOA,CAAP;AACD;;AAED;AACA,WAASgJ,IAAT,CAActL,CAAd,EAAiB;AACf,QAAGA,KAAK,CAAR,EAAW,OAAO,CAAC,CAAR;AACX,QAAIsC,IAAI,CAAR;AACA,QAAG,CAACtC,IAAE,MAAH,KAAc,CAAjB,EAAoB;AAAEA,YAAM,EAAN,CAAUsC,KAAK,EAAL;AAAU;AAC1C,QAAG,CAACtC,IAAE,IAAH,KAAY,CAAf,EAAkB;AAAEA,YAAM,CAAN,CAASsC,KAAK,CAAL;AAAS;AACtC,QAAG,CAACtC,IAAE,GAAH,KAAW,CAAd,EAAiB;AAAEA,YAAM,CAAN,CAASsC,KAAK,CAAL;AAAS;AACrC,QAAG,CAACtC,IAAE,CAAH,KAAS,CAAZ,EAAe;AAAEA,YAAM,CAAN,CAASsC,KAAK,CAAL;AAAS;AACnC,QAAG,CAACtC,IAAE,CAAH,KAAS,CAAZ,EAAe,EAAEsC,CAAF;AACf,WAAOA,CAAP;AACD;;AAED;AACA,WAASiJ,iBAAT,GAA6B;AAC3B,SAAI,IAAIxL,IAAI,CAAZ,EAAeA,IAAI,KAAKwC,CAAxB,EAA2B,EAAExC,CAA7B;AACE,UAAG,KAAKA,CAAL,KAAW,CAAd,EAAiB,OAAOA,IAAE,KAAKoB,EAAP,GAAUmK,KAAK,KAAKvL,CAAL,CAAL,CAAjB;AADnB,KAEA,IAAG,KAAKqC,CAAL,GAAS,CAAZ,EAAe,OAAO,KAAKG,CAAL,GAAO,KAAKpB,EAAnB;AACf,WAAO,CAAC,CAAR;AACD;;AAED;AACA,WAASqK,IAAT,CAAcxL,CAAd,EAAiB;AACf,QAAIsC,IAAI,CAAR;AACA,WAAMtC,KAAK,CAAX,EAAc;AAAEA,WAAKA,IAAE,CAAP,CAAU,EAAEsC,CAAF;AAAM;AAChC,WAAOA,CAAP;AACD;;AAED;AACA,WAASmJ,UAAT,GAAsB;AACpB,QAAInJ,IAAI,CAAR;AAAA,QAAWtC,IAAI,KAAKoC,CAAL,GAAO,KAAKhB,EAA3B;AACA,SAAI,IAAIrB,IAAI,CAAZ,EAAeA,IAAI,KAAKwC,CAAxB,EAA2B,EAAExC,CAA7B;AAAgCuC,WAAKkJ,KAAK,KAAKzL,CAAL,IAAQC,CAAb,CAAL;AAAhC,KACA,OAAOsC,CAAP;AACD;;AAED;AACA,WAASoJ,SAAT,CAAmBvL,CAAnB,EAAsB;AACpB,QAAID,IAAIG,KAAKC,KAAL,CAAWH,IAAE,KAAKgB,EAAlB,CAAR;AACA,QAAGjB,KAAK,KAAKqC,CAAb,EAAgB,OAAO,KAAKH,CAAL,IAAQ,CAAf;AAChB,WAAO,CAAC,KAAKlC,CAAL,IAAS,KAAIC,IAAE,KAAKgB,EAArB,KAA4B,CAAnC;AACD;;AAED;AACA,WAASwK,YAAT,CAAsBxL,CAAtB,EAAwBuK,EAAxB,EAA4B;AAC1B,QAAIpI,IAAI/C,WAAW0G,GAAX,CAAegE,SAAf,CAAyB9J,CAAzB,CAAR;AACA,SAAK6J,SAAL,CAAe1H,CAAf,EAAiBoI,EAAjB,EAAoBpI,CAApB;AACA,WAAOA,CAAP;AACD;;AAED;AACA,WAASsJ,QAAT,CAAkBzL,CAAlB,EAAqB;AAAE,WAAO,KAAK0L,SAAL,CAAe1L,CAAf,EAAiB+J,KAAjB,CAAP;AAAiC;;AAExD;AACA,WAAS4B,UAAT,CAAoB3L,CAApB,EAAuB;AAAE,WAAO,KAAK0L,SAAL,CAAe1L,CAAf,EAAiB8K,SAAjB,CAAP;AAAqC;;AAE9D;AACA,WAASc,SAAT,CAAmB5L,CAAnB,EAAsB;AAAE,WAAO,KAAK0L,SAAL,CAAe1L,CAAf,EAAiB4K,MAAjB,CAAP;AAAkC;;AAE1D;AACA,WAASiB,QAAT,CAAkBxM,CAAlB,EAAoB8C,CAApB,EAAuB;AACrB,QAAIvC,IAAI,CAAR;AAAA,QAAWL,IAAI,CAAf;AAAA,QAAkBkB,IAAIP,KAAKsE,GAAL,CAASnF,EAAE+C,CAAX,EAAa,KAAKA,CAAlB,CAAtB;AACA,WAAMxC,IAAIa,CAAV,EAAa;AACXlB,WAAK,KAAKK,CAAL,IAAQP,EAAEO,CAAF,CAAb;AACAuC,QAAEvC,GAAF,IAASL,IAAE,KAAK0B,EAAhB;AACA1B,YAAM,KAAKyB,EAAX;AACD;AACD,QAAG3B,EAAE+C,CAAF,GAAM,KAAKA,CAAd,EAAiB;AACf7C,WAAKF,EAAE4C,CAAP;AACA,aAAMrC,IAAI,KAAKwC,CAAf,EAAkB;AAChB7C,aAAK,KAAKK,CAAL,CAAL;AACAuC,UAAEvC,GAAF,IAASL,IAAE,KAAK0B,EAAhB;AACA1B,cAAM,KAAKyB,EAAX;AACD;AACDzB,WAAK,KAAK0C,CAAV;AACD,KARD,MASK;AACH1C,WAAK,KAAK0C,CAAV;AACA,aAAMrC,IAAIP,EAAE+C,CAAZ,EAAe;AACb7C,aAAKF,EAAEO,CAAF,CAAL;AACAuC,UAAEvC,GAAF,IAASL,IAAE,KAAK0B,EAAhB;AACA1B,cAAM,KAAKyB,EAAX;AACD;AACDzB,WAAKF,EAAE4C,CAAP;AACD;AACDE,MAAEF,CAAF,GAAO1C,IAAE,CAAH,GAAM,CAAC,CAAP,GAAS,CAAf;AACA,QAAGA,IAAI,CAAP,EAAU4C,EAAEvC,GAAF,IAASL,CAAT,CAAV,KACK,IAAGA,IAAI,CAAC,CAAR,EAAW4C,EAAEvC,GAAF,IAAS,KAAKsB,EAAL,GAAQ3B,CAAjB;AAChB4C,MAAEC,CAAF,GAAMxC,CAAN;AACAuC,MAAEW,KAAF;AACD;;AAED;AACA,WAASgJ,KAAT,CAAezM,CAAf,EAAkB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKqM,KAAL,CAAW1M,CAAX,EAAa8C,CAAb,EAAiB,OAAOA,CAAP;AAAW;;AAE/D;AACA,WAAS6J,UAAT,CAAoB3M,CAApB,EAAuB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKsD,KAAL,CAAW3D,CAAX,EAAa8C,CAAb,EAAiB,OAAOA,CAAP;AAAW;;AAEpE;AACA,WAAS8J,UAAT,CAAoB5M,CAApB,EAAuB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKgH,UAAL,CAAgBrH,CAAhB,EAAkB8C,CAAlB,EAAsB,OAAOA,CAAP;AAAW;;AAEzE;AACA,WAAS+J,QAAT,GAAoB;AAAE,QAAI/J,IAAIzC,KAAR,CAAe,KAAKmH,QAAL,CAAc1E,CAAd,EAAkB,OAAOA,CAAP;AAAW;;AAElE;AACA,WAASgK,QAAT,CAAkB9M,CAAlB,EAAqB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKyG,QAAL,CAAc9G,CAAd,EAAgB8C,CAAhB,EAAkB,IAAlB,EAAyB,OAAOA,CAAP;AAAW;;AAE1E;AACA,WAASiK,WAAT,CAAqB/M,CAArB,EAAwB;AAAE,QAAI8C,IAAIzC,KAAR,CAAe,KAAKyG,QAAL,CAAc9G,CAAd,EAAgB,IAAhB,EAAqB8C,CAArB,EAAyB,OAAOA,CAAP;AAAW;;AAE7E;AACA,WAASkK,oBAAT,CAA8BhN,CAA9B,EAAiC;AAC/B,QAAIyF,IAAIpF,KAAR;AAAA,QAAeyC,IAAIzC,KAAnB;AACA,SAAKyG,QAAL,CAAc9G,CAAd,EAAgByF,CAAhB,EAAkB3C,CAAlB;AACA,WAAO,IAAIT,KAAJ,CAAUoD,CAAV,EAAY3C,CAAZ,CAAP;AACD;;AAED;AACA,WAASmK,YAAT,CAAsBtM,CAAtB,EAAyB;AACvB,SAAK,KAAKoC,CAAV,IAAe,KAAKrB,EAAL,CAAQ,CAAR,EAAUf,IAAE,CAAZ,EAAc,IAAd,EAAmB,CAAnB,EAAqB,CAArB,EAAuB,KAAKoC,CAA5B,CAAf;AACA,MAAE,KAAKA,CAAP;AACA,SAAKU,KAAL;AACD;;AAED;AACA,WAASyJ,aAAT,CAAuBvM,CAAvB,EAAyBF,CAAzB,EAA4B;AAC1B,QAAGE,KAAK,CAAR,EAAW;AACX,WAAM,KAAKoC,CAAL,IAAUtC,CAAhB;AAAmB,WAAK,KAAKsC,CAAL,EAAL,IAAiB,CAAjB;AAAnB,KACA,KAAKtC,CAAL,KAAWE,CAAX;AACA,WAAM,KAAKF,CAAL,KAAW,KAAKoB,EAAtB,EAA0B;AACxB,WAAKpB,CAAL,KAAW,KAAKoB,EAAhB;AACA,UAAG,EAAEpB,CAAF,IAAO,KAAKsC,CAAf,EAAkB,KAAK,KAAKA,CAAL,EAAL,IAAiB,CAAjB;AAClB,QAAE,KAAKtC,CAAL,CAAF;AACD;AACF;;AAED;AACA,WAAS0M,OAAT,GAAmB,CAAE;AACrB,WAASC,IAAT,CAAc5M,CAAd,EAAiB;AAAE,WAAOA,CAAP;AAAW;AAC9B,WAAS6M,MAAT,CAAgB7M,CAAhB,EAAkB8E,CAAlB,EAAoBxC,CAApB,EAAuB;AAAEtC,MAAE6G,UAAF,CAAa/B,CAAb,EAAexC,CAAf;AAAoB;AAC7C,WAASwK,MAAT,CAAgB9M,CAAhB,EAAkBsC,CAAlB,EAAqB;AAAEtC,MAAEgH,QAAF,CAAW1E,CAAX;AAAgB;;AAEvCqK,UAAQ1L,SAAR,CAAkBgG,OAAlB,GAA4B2F,IAA5B;AACAD,UAAQ1L,SAAR,CAAkBiG,MAAlB,GAA2B0F,IAA3B;AACAD,UAAQ1L,SAAR,CAAkBkG,KAAlB,GAA0B0F,MAA1B;AACAF,UAAQ1L,SAAR,CAAkBmG,KAAlB,GAA0B0F,MAA1B;;AAEA;AACA,WAASC,KAAT,CAAejH,CAAf,EAAkB;AAAE,WAAO,KAAK4C,GAAL,CAAS5C,CAAT,EAAW,IAAI6G,OAAJ,EAAX,CAAP;AAAmC;;AAEvD;AACA;AACA,WAASK,kBAAT,CAA4BxN,CAA5B,EAA8BW,CAA9B,EAAgCmC,CAAhC,EAAmC;AACjC,QAAIvC,IAAIM,KAAKsE,GAAL,CAAS,KAAKpC,CAAL,GAAO/C,EAAE+C,CAAlB,EAAoBpC,CAApB,CAAR;AACAmC,MAAEF,CAAF,GAAM,CAAN,CAFiC,CAExB;AACTE,MAAEC,CAAF,GAAMxC,CAAN;AACA,WAAMA,IAAI,CAAV;AAAauC,QAAE,EAAEvC,CAAJ,IAAS,CAAT;AAAb,KACA,IAAIG,CAAJ;AACA,SAAIA,IAAIoC,EAAEC,CAAF,GAAI,KAAKA,CAAjB,EAAoBxC,IAAIG,CAAxB,EAA2B,EAAEH,CAA7B;AAAgCuC,QAAEvC,IAAE,KAAKwC,CAAT,IAAc,KAAKrB,EAAL,CAAQ,CAAR,EAAU1B,EAAEO,CAAF,CAAV,EAAeuC,CAAf,EAAiBvC,CAAjB,EAAmB,CAAnB,EAAqB,KAAKwC,CAA1B,CAAd;AAAhC,KACA,KAAIrC,IAAIG,KAAKsE,GAAL,CAASnF,EAAE+C,CAAX,EAAapC,CAAb,CAAR,EAAyBJ,IAAIG,CAA7B,EAAgC,EAAEH,CAAlC;AAAqC,WAAKmB,EAAL,CAAQ,CAAR,EAAU1B,EAAEO,CAAF,CAAV,EAAeuC,CAAf,EAAiBvC,CAAjB,EAAmB,CAAnB,EAAqBI,IAAEJ,CAAvB;AAArC,KACAuC,EAAEW,KAAF;AACD;;AAED;AACA;AACA,WAASgK,kBAAT,CAA4BzN,CAA5B,EAA8BW,CAA9B,EAAgCmC,CAAhC,EAAmC;AACjC,MAAEnC,CAAF;AACA,QAAIJ,IAAIuC,EAAEC,CAAF,GAAM,KAAKA,CAAL,GAAO/C,EAAE+C,CAAT,GAAWpC,CAAzB;AACAmC,MAAEF,CAAF,GAAM,CAAN,CAHiC,CAGxB;AACT,WAAM,EAAErC,CAAF,IAAO,CAAb;AAAgBuC,QAAEvC,CAAF,IAAO,CAAP;AAAhB,KACA,KAAIA,IAAIM,KAAK8D,GAAL,CAAShE,IAAE,KAAKoC,CAAhB,EAAkB,CAAlB,CAAR,EAA8BxC,IAAIP,EAAE+C,CAApC,EAAuC,EAAExC,CAAzC;AACEuC,QAAE,KAAKC,CAAL,GAAOxC,CAAP,GAASI,CAAX,IAAgB,KAAKe,EAAL,CAAQf,IAAEJ,CAAV,EAAYP,EAAEO,CAAF,CAAZ,EAAiBuC,CAAjB,EAAmB,CAAnB,EAAqB,CAArB,EAAuB,KAAKC,CAAL,GAAOxC,CAAP,GAASI,CAAhC,CAAhB;AADF,KAEAmC,EAAEW,KAAF;AACAX,MAAE6D,SAAF,CAAY,CAAZ,EAAc7D,CAAd;AACD;;AAED;AACA,WAAS4K,OAAT,CAAiBtM,CAAjB,EAAoB;AAClB;AACA,SAAK0H,EAAL,GAAUzI,KAAV;AACA,SAAKsN,EAAL,GAAUtN,KAAV;AACAN,eAAW0G,GAAX,CAAeF,SAAf,CAAyB,IAAEnF,EAAE2B,CAA7B,EAA+B,KAAK+F,EAApC;AACA,SAAK8E,EAAL,GAAU,KAAK9E,EAAL,CAAQ+E,MAAR,CAAezM,CAAf,CAAV;AACA,SAAKA,CAAL,GAASA,CAAT;AACD;;AAED,WAAS0M,cAAT,CAAwBtN,CAAxB,EAA2B;AACzB,QAAGA,EAAEoC,CAAF,GAAM,CAAN,IAAWpC,EAAEuC,CAAF,GAAM,IAAE,KAAK3B,CAAL,CAAO2B,CAA7B,EAAgC,OAAOvC,EAAEyG,GAAF,CAAM,KAAK7F,CAAX,CAAP,CAAhC,KACK,IAAGZ,EAAEgG,SAAF,CAAY,KAAKpF,CAAjB,IAAsB,CAAzB,EAA4B,OAAOZ,CAAP,CAA5B,KACA;AAAE,UAAIsC,IAAIzC,KAAR,CAAeG,EAAEoF,MAAF,CAAS9C,CAAT,EAAa,KAAKwE,MAAL,CAAYxE,CAAZ,EAAgB,OAAOA,CAAP;AAAW;AAC/D;;AAED,WAASiL,aAAT,CAAuBvN,CAAvB,EAA0B;AAAE,WAAOA,CAAP;AAAW;;AAEvC;AACA,WAASwN,aAAT,CAAuBxN,CAAvB,EAA0B;AACxBA,MAAEmG,SAAF,CAAY,KAAKvF,CAAL,CAAO2B,CAAP,GAAS,CAArB,EAAuB,KAAK+F,EAA5B;AACA,QAAGtI,EAAEuC,CAAF,GAAM,KAAK3B,CAAL,CAAO2B,CAAP,GAAS,CAAlB,EAAqB;AAAEvC,QAAEuC,CAAF,GAAM,KAAK3B,CAAL,CAAO2B,CAAP,GAAS,CAAf,CAAkBvC,EAAEiD,KAAF;AAAY;AACrD,SAAKmK,EAAL,CAAQK,eAAR,CAAwB,KAAKnF,EAA7B,EAAgC,KAAK1H,CAAL,CAAO2B,CAAP,GAAS,CAAzC,EAA2C,KAAK4K,EAAhD;AACA,SAAKvM,CAAL,CAAO8M,eAAP,CAAuB,KAAKP,EAA5B,EAA+B,KAAKvM,CAAL,CAAO2B,CAAP,GAAS,CAAxC,EAA0C,KAAK+F,EAA/C;AACA,WAAMtI,EAAEgG,SAAF,CAAY,KAAKsC,EAAjB,IAAuB,CAA7B;AAAgCtI,QAAE6J,UAAF,CAAa,CAAb,EAAe,KAAKjJ,CAAL,CAAO2B,CAAP,GAAS,CAAxB;AAAhC,KACAvC,EAAEmD,KAAF,CAAQ,KAAKmF,EAAb,EAAgBtI,CAAhB;AACA,WAAMA,EAAEgG,SAAF,CAAY,KAAKpF,CAAjB,KAAuB,CAA7B;AAAgCZ,QAAEmD,KAAF,CAAQ,KAAKvC,CAAb,EAAeZ,CAAf;AAAhC;AACD;;AAED;AACA,WAAS2N,YAAT,CAAsB3N,CAAtB,EAAwBsC,CAAxB,EAA2B;AAAEtC,MAAEgH,QAAF,CAAW1E,CAAX,EAAe,KAAKwE,MAAL,CAAYxE,CAAZ;AAAiB;;AAE7D;AACA,WAASsL,YAAT,CAAsB5N,CAAtB,EAAwB8E,CAAxB,EAA0BxC,CAA1B,EAA6B;AAAEtC,MAAE6G,UAAF,CAAa/B,CAAb,EAAexC,CAAf,EAAmB,KAAKwE,MAAL,CAAYxE,CAAZ;AAAiB;;AAEnE4K,UAAQjM,SAAR,CAAkBgG,OAAlB,GAA4BqG,cAA5B;AACAJ,UAAQjM,SAAR,CAAkBiG,MAAlB,GAA2BqG,aAA3B;AACAL,UAAQjM,SAAR,CAAkB6F,MAAlB,GAA2B0G,aAA3B;AACAN,UAAQjM,SAAR,CAAkBkG,KAAlB,GAA0ByG,YAA1B;AACAV,UAAQjM,SAAR,CAAkBmG,KAAlB,GAA0BuG,YAA1B;;AAEA;AACA,WAASE,QAAT,CAAkB/H,CAAlB,EAAoBlF,CAApB,EAAuB;AACrB,QAAIb,IAAI+F,EAAE6C,SAAF,EAAR;AAAA,QAAuB/F,CAAvB;AAAA,QAA0BN,IAAIG,IAAI,CAAJ,CAA9B;AAAA,QAAsC4F,CAAtC;AACA,QAAGtI,KAAK,CAAR,EAAW,OAAOuC,CAAP,CAAX,KACK,IAAGvC,IAAI,EAAP,EAAW6C,IAAI,CAAJ,CAAX,KACA,IAAG7C,IAAI,EAAP,EAAW6C,IAAI,CAAJ,CAAX,KACA,IAAG7C,IAAI,GAAP,EAAY6C,IAAI,CAAJ,CAAZ,KACA,IAAG7C,IAAI,GAAP,EAAY6C,IAAI,CAAJ,CAAZ,KACAA,IAAI,CAAJ;AACL,QAAG7C,IAAI,CAAP,EACEsI,IAAI,IAAI9B,OAAJ,CAAY3F,CAAZ,CAAJ,CADF,KAEK,IAAGA,EAAE6H,MAAF,EAAH,EACHJ,IAAI,IAAI6E,OAAJ,CAAYtM,CAAZ,CAAJ,CADG,KAGHyH,IAAI,IAAIf,UAAJ,CAAe1G,CAAf,CAAJ;;AAEF;AACA,QAAI2H,IAAI,IAAI1G,KAAJ,EAAR;AAAA,QAAqB1B,IAAI,CAAzB;AAAA,QAA4B2N,KAAKlL,IAAE,CAAnC;AAAA,QAAsCa,KAAK,CAAC,KAAGb,CAAJ,IAAO,CAAlD;AACA2F,MAAE,CAAF,IAAOF,EAAEpB,OAAF,CAAU,IAAV,CAAP;AACA,QAAGrE,IAAI,CAAP,EAAU;AACR,UAAImL,KAAKlO,KAAT;AACAwI,QAAEjB,KAAF,CAAQmB,EAAE,CAAF,CAAR,EAAawF,EAAb;AACA,aAAM5N,KAAKsD,EAAX,EAAe;AACb8E,UAAEpI,CAAF,IAAON,KAAP;AACAwI,UAAElB,KAAF,CAAQ4G,EAAR,EAAWxF,EAAEpI,IAAE,CAAJ,CAAX,EAAkBoI,EAAEpI,CAAF,CAAlB;AACAA,aAAK,CAAL;AACD;AACF;;AAED,QAAID,IAAI4F,EAAEvD,CAAF,GAAI,CAAZ;AAAA,QAAetC,CAAf;AAAA,QAAkB+N,MAAM,IAAxB;AAAA,QAA8B1F,KAAKzI,KAAnC;AAAA,QAA0C0C,CAA1C;AACAxC,QAAIgE,MAAM+B,EAAE5F,CAAF,CAAN,IAAY,CAAhB;AACA,WAAMA,KAAK,CAAX,EAAc;AACZ,UAAGH,KAAK+N,EAAR,EAAY7N,IAAK6F,EAAE5F,CAAF,KAAOH,IAAE+N,EAAV,GAAerK,EAAnB,CAAZ,KACK;AACHxD,YAAI,CAAC6F,EAAE5F,CAAF,IAAM,CAAC,KAAIH,IAAE,CAAP,IAAW,CAAlB,KAAwB+N,KAAG/N,CAA/B;AACA,YAAGG,IAAI,CAAP,EAAUD,KAAK6F,EAAE5F,IAAE,CAAJ,KAAS,KAAKiB,EAAL,GAAQpB,CAAR,GAAU+N,EAAxB;AACX;;AAED3N,UAAIyC,CAAJ;AACA,aAAM,CAAC3C,IAAE,CAAH,KAAS,CAAf,EAAkB;AAAEA,cAAM,CAAN,CAAS,EAAEE,CAAF;AAAM;AACnC,UAAG,CAACJ,KAAKI,CAAN,IAAW,CAAd,EAAiB;AAAEJ,aAAK,KAAKoB,EAAV,CAAc,EAAEjB,CAAF;AAAM;AACvC,UAAG8N,GAAH,EAAQ;AAAE;AACRzF,UAAEtI,CAAF,EAAKmF,MAAL,CAAY9C,CAAZ;AACA0L,cAAM,KAAN;AACD,OAHD,MAIK;AACH,eAAM7N,IAAI,CAAV,EAAa;AAAEkI,YAAEjB,KAAF,CAAQ9E,CAAR,EAAUgG,EAAV,EAAeD,EAAEjB,KAAF,CAAQkB,EAAR,EAAWhG,CAAX,EAAenC,KAAK,CAAL;AAAS;AACtD,YAAGA,IAAI,CAAP,EAAUkI,EAAEjB,KAAF,CAAQ9E,CAAR,EAAUgG,EAAV,EAAV,KAA8B;AAAE/F,cAAID,CAAJ,CAAOA,IAAIgG,EAAJ,CAAQA,KAAK/F,CAAL;AAAS;AACxD8F,UAAElB,KAAF,CAAQmB,EAAR,EAAWC,EAAEtI,CAAF,CAAX,EAAgBqC,CAAhB;AACD;;AAED,aAAMpC,KAAK,CAAL,IAAU,CAAC4F,EAAE5F,CAAF,IAAM,KAAGH,CAAV,KAAiB,CAAjC,EAAoC;AAClCsI,UAAEjB,KAAF,CAAQ9E,CAAR,EAAUgG,EAAV,EAAe/F,IAAID,CAAJ,CAAOA,IAAIgG,EAAJ,CAAQA,KAAK/F,CAAL;AAC9B,YAAG,EAAExC,CAAF,GAAM,CAAT,EAAY;AAAEA,cAAI,KAAKoB,EAAL,GAAQ,CAAZ,CAAe,EAAEjB,CAAF;AAAM;AACpC;AACF;AACD,WAAOmI,EAAEnB,MAAF,CAAS5E,CAAT,CAAP;AACD;;AAED;AACA,WAAS2L,KAAT,CAAezO,CAAf,EAAkB;AAChB,QAAIQ,IAAK,KAAKoC,CAAL,GAAO,CAAR,GAAW,KAAKkB,MAAL,EAAX,GAAyB,KAAK4K,KAAL,EAAjC;AACA,QAAIpJ,IAAKtF,EAAE4C,CAAF,GAAI,CAAL,GAAQ5C,EAAE8D,MAAF,EAAR,GAAmB9D,EAAE0O,KAAF,EAA3B;AACA,QAAGlO,EAAEgG,SAAF,CAAYlB,CAAZ,IAAiB,CAApB,EAAuB;AAAE,UAAIvC,IAAIvC,CAAR,CAAWA,IAAI8E,CAAJ,CAAOA,IAAIvC,CAAJ;AAAQ;AACnD,QAAIxC,IAAIC,EAAEmO,eAAF,EAAR;AAAA,QAA6B5F,IAAIzD,EAAEqJ,eAAF,EAAjC;AACA,QAAG5F,IAAI,CAAP,EAAU,OAAOvI,CAAP;AACV,QAAGD,IAAIwI,CAAP,EAAUA,IAAIxI,CAAJ;AACV,QAAGwI,IAAI,CAAP,EAAU;AACRvI,QAAEoG,QAAF,CAAWmC,CAAX,EAAavI,CAAb;AACA8E,QAAEsB,QAAF,CAAWmC,CAAX,EAAazD,CAAb;AACD;AACD,WAAM9E,EAAEsJ,MAAF,KAAa,CAAnB,EAAsB;AACpB,UAAG,CAACvJ,IAAIC,EAAEmO,eAAF,EAAL,IAA4B,CAA/B,EAAkCnO,EAAEoG,QAAF,CAAWrG,CAAX,EAAaC,CAAb;AAClC,UAAG,CAACD,IAAI+E,EAAEqJ,eAAF,EAAL,IAA4B,CAA/B,EAAkCrJ,EAAEsB,QAAF,CAAWrG,CAAX,EAAa+E,CAAb;AAClC,UAAG9E,EAAEgG,SAAF,CAAYlB,CAAZ,KAAkB,CAArB,EAAwB;AACtB9E,UAAEmD,KAAF,CAAQ2B,CAAR,EAAU9E,CAAV;AACAA,UAAEoG,QAAF,CAAW,CAAX,EAAapG,CAAb;AACD,OAHD,MAIK;AACH8E,UAAE3B,KAAF,CAAQnD,CAAR,EAAU8E,CAAV;AACAA,UAAEsB,QAAF,CAAW,CAAX,EAAatB,CAAb;AACD;AACF;AACD,QAAGyD,IAAI,CAAP,EAAUzD,EAAEU,QAAF,CAAW+C,CAAX,EAAazD,CAAb;AACV,WAAOA,CAAP;AACD;;AAED;AACA,WAASsJ,SAAT,CAAmBjO,CAAnB,EAAsB;AACpB,QAAGA,KAAK,CAAR,EAAW,OAAO,CAAP;AACX,QAAIuD,IAAI,KAAKrC,EAAL,GAAQlB,CAAhB;AAAA,QAAmBmC,IAAK,KAAKF,CAAL,GAAO,CAAR,GAAWjC,IAAE,CAAb,GAAe,CAAtC;AACA,QAAG,KAAKoC,CAAL,GAAS,CAAZ,EACE,IAAGmB,KAAK,CAAR,EAAWpB,IAAI,KAAK,CAAL,IAAQnC,CAAZ,CAAX,KACK,KAAI,IAAIJ,IAAI,KAAKwC,CAAL,GAAO,CAAnB,EAAsBxC,KAAK,CAA3B,EAA8B,EAAEA,CAAhC;AAAmCuC,UAAI,CAACoB,IAAEpB,CAAF,GAAI,KAAKvC,CAAL,CAAL,IAAcI,CAAlB;AAAnC,KACP,OAAOmC,CAAP;AACD;;AAED;AACA,WAAS+L,YAAT,CAAsBzN,CAAtB,EAAyB;AACvB,QAAI0N,KAAK1N,EAAE6H,MAAF,EAAT;AACA,QAAI,KAAKA,MAAL,MAAiB6F,EAAlB,IAAyB1N,EAAE0I,MAAF,MAAc,CAA1C,EAA6C,OAAO/J,WAAW2D,IAAlB;AAC7C,QAAIqL,IAAI3N,EAAEsN,KAAF,EAAR;AAAA,QAAmB9N,IAAI,KAAK8N,KAAL,EAAvB;AACA,QAAI1O,IAAIiD,IAAI,CAAJ,CAAR;AAAA,QAAgBhD,IAAIgD,IAAI,CAAJ,CAApB;AAAA,QAA4B/C,IAAI+C,IAAI,CAAJ,CAAhC;AAAA,QAAwCiB,IAAIjB,IAAI,CAAJ,CAA5C;AACA,WAAM8L,EAAEjF,MAAF,MAAc,CAApB,EAAuB;AACrB,aAAMiF,EAAE9F,MAAF,EAAN,EAAkB;AAChB8F,UAAEnI,QAAF,CAAW,CAAX,EAAamI,CAAb;AACA,YAAGD,EAAH,EAAO;AACL,cAAG,CAAC9O,EAAEiJ,MAAF,EAAD,IAAe,CAAChJ,EAAEgJ,MAAF,EAAnB,EAA+B;AAAEjJ,cAAE0M,KAAF,CAAQ,IAAR,EAAa1M,CAAb,EAAiBC,EAAE0D,KAAF,CAAQvC,CAAR,EAAUnB,CAAV;AAAe;AACjED,YAAE4G,QAAF,CAAW,CAAX,EAAa5G,CAAb;AACD,SAHD,MAIK,IAAG,CAACC,EAAEgJ,MAAF,EAAJ,EAAgBhJ,EAAE0D,KAAF,CAAQvC,CAAR,EAAUnB,CAAV;AACrBA,UAAE2G,QAAF,CAAW,CAAX,EAAa3G,CAAb;AACD;AACD,aAAMW,EAAEqI,MAAF,EAAN,EAAkB;AAChBrI,UAAEgG,QAAF,CAAW,CAAX,EAAahG,CAAb;AACA,YAAGkO,EAAH,EAAO;AACL,cAAG,CAAC5O,EAAE+I,MAAF,EAAD,IAAe,CAAC/E,EAAE+E,MAAF,EAAnB,EAA+B;AAAE/I,cAAEwM,KAAF,CAAQ,IAAR,EAAaxM,CAAb,EAAiBgE,EAAEP,KAAF,CAAQvC,CAAR,EAAU8C,CAAV;AAAe;AACjEhE,YAAE0G,QAAF,CAAW,CAAX,EAAa1G,CAAb;AACD,SAHD,MAIK,IAAG,CAACgE,EAAE+E,MAAF,EAAJ,EAAgB/E,EAAEP,KAAF,CAAQvC,CAAR,EAAU8C,CAAV;AACrBA,UAAE0C,QAAF,CAAW,CAAX,EAAa1C,CAAb;AACD;AACD,UAAG6K,EAAEvI,SAAF,CAAY5F,CAAZ,KAAkB,CAArB,EAAwB;AACtBmO,UAAEpL,KAAF,CAAQ/C,CAAR,EAAUmO,CAAV;AACA,YAAGD,EAAH,EAAO9O,EAAE2D,KAAF,CAAQzD,CAAR,EAAUF,CAAV;AACPC,UAAE0D,KAAF,CAAQO,CAAR,EAAUjE,CAAV;AACD,OAJD,MAKK;AACHW,UAAE+C,KAAF,CAAQoL,CAAR,EAAUnO,CAAV;AACA,YAAGkO,EAAH,EAAO5O,EAAEyD,KAAF,CAAQ3D,CAAR,EAAUE,CAAV;AACPgE,UAAEP,KAAF,CAAQ1D,CAAR,EAAUiE,CAAV;AACD;AACF;AACD,QAAGtD,EAAE4F,SAAF,CAAYzG,WAAW0G,GAAvB,KAA+B,CAAlC,EAAqC,OAAO1G,WAAW2D,IAAlB;AACrC,QAAGQ,EAAEsC,SAAF,CAAYpF,CAAZ,KAAkB,CAArB,EAAwB,OAAO8C,EAAE8K,QAAF,CAAW5N,CAAX,CAAP;AACxB,QAAG8C,EAAE4F,MAAF,KAAa,CAAhB,EAAmB5F,EAAEwI,KAAF,CAAQtL,CAAR,EAAU8C,CAAV,EAAnB,KAAsC,OAAOA,CAAP;AACtC,QAAGA,EAAE4F,MAAF,KAAa,CAAhB,EAAmB,OAAO5F,EAAE+K,GAAF,CAAM7N,CAAN,CAAP,CAAnB,KAAyC,OAAO8C,CAAP;AAC1C;;AAED,MAAIgL,YAAY,CAAC,CAAD,EAAG,CAAH,EAAK,CAAL,EAAO,CAAP,EAAS,EAAT,EAAY,EAAZ,EAAe,EAAf,EAAkB,EAAlB,EAAqB,EAArB,EAAwB,EAAxB,EAA2B,EAA3B,EAA8B,EAA9B,EAAiC,EAAjC,EAAoC,EAApC,EAAuC,EAAvC,EAA0C,EAA1C,EAA6C,EAA7C,EAAgD,EAAhD,EAAmD,EAAnD,EAAsD,EAAtD,EAAyD,EAAzD,EAA4D,EAA5D,EAA+D,EAA/D,EAAkE,EAAlE,EAAqE,EAArE,EAAwE,GAAxE,EAA4E,GAA5E,EAAgF,GAAhF,EAAoF,GAApF,EAAwF,GAAxF,EAA4F,GAA5F,EAAgG,GAAhG,EAAoG,GAApG,EAAwG,GAAxG,EAA4G,GAA5G,EAAgH,GAAhH,EAAoH,GAApH,EAAwH,GAAxH,EAA4H,GAA5H,EAAgI,GAAhI,EAAoI,GAApI,EAAwI,GAAxI,EAA4I,GAA5I,EAAgJ,GAAhJ,EAAoJ,GAApJ,EAAwJ,GAAxJ,EAA4J,GAA5J,EAAgK,GAAhK,EAAoK,GAApK,EAAwK,GAAxK,EAA4K,GAA5K,EAAgL,GAAhL,EAAoL,GAApL,EAAwL,GAAxL,EAA4L,GAA5L,EAAgM,GAAhM,EAAoM,GAApM,EAAwM,GAAxM,EAA4M,GAA5M,EAAgN,GAAhN,EAAoN,GAApN,EAAwN,GAAxN,EAA4N,GAA5N,EAAgO,GAAhO,EAAoO,GAApO,EAAwO,GAAxO,EAA4O,GAA5O,EAAgP,GAAhP,EAAoP,GAApP,EAAwP,GAAxP,EAA4P,GAA5P,EAAgQ,GAAhQ,EAAoQ,GAApQ,EAAwQ,GAAxQ,EAA4Q,GAA5Q,EAAgR,GAAhR,EAAoR,GAApR,EAAwR,GAAxR,EAA4R,GAA5R,EAAgS,GAAhS,EAAoS,GAApS,EAAwS,GAAxS,EAA4S,GAA5S,EAAgT,GAAhT,EAAoT,GAApT,EAAwT,GAAxT,EAA4T,GAA5T,EAAgU,GAAhU,EAAoU,GAApU,EAAwU,GAAxU,EAA4U,GAA5U,EAAgV,GAAhV,EAAoV,GAApV,EAAwV,GAAxV,EAA4V,GAA5V,EAAgW,GAAhW,EAAoW,GAApW,EAAwW,GAAxW,EAA4W,GAA5W,EAAgX,GAAhX,EAAoX,GAApX,EAAwX,GAAxX,EAA4X,GAA5X,EAAgY,GAAhY,EAAoY,GAApY,EAAwY,GAAxY,EAA4Y,GAA5Y,EAAgZ,GAAhZ,EAAoZ,GAApZ,EAAwZ,GAAxZ,EAA4Z,GAA5Z,EAAga,GAAha,EAAoa,GAApa,EAAwa,GAAxa,EAA4a,GAA5a,EAAgb,GAAhb,EAAob,GAApb,EAAwb,GAAxb,EAA4b,GAA5b,EAAgc,GAAhc,EAAoc,GAApc,EAAwc,GAAxc,EAA4c,GAA5c,EAAgd,GAAhd,EAAod,GAApd,EAAwd,GAAxd,EAA4d,GAA5d,EAAge,GAAhe,EAAoe,GAApe,EAAwe,GAAxe,EAA4e,GAA5e,EAAgf,GAAhf,EAAof,GAApf,EAAwf,GAAxf,EAA4f,GAA5f,EAAggB,GAAhgB,EAAogB,GAApgB,EAAwgB,GAAxgB,EAA4gB,GAA5gB,EAAghB,GAAhhB,EAAohB,GAAphB,EAAwhB,GAAxhB,EAA4hB,GAA5hB,EAAgiB,GAAhiB,EAAoiB,GAApiB,EAAwiB,GAAxiB,EAA4iB,GAA5iB,EAAgjB,GAAhjB,EAAojB,GAApjB,EAAwjB,GAAxjB,EAA4jB,GAA5jB,EAAgkB,GAAhkB,EAAokB,GAApkB,EAAwkB,GAAxkB,EAA4kB,GAA5kB,EAAglB,GAAhlB,EAAolB,GAAplB,EAAwlB,GAAxlB,EAA4lB,GAA5lB,EAAgmB,GAAhmB,EAAomB,GAApmB,EAAwmB,GAAxmB,EAA4mB,GAA5mB,EAAgnB,GAAhnB,EAAonB,GAApnB,EAAwnB,GAAxnB,EAA4nB,GAA5nB,EAAgoB,GAAhoB,CAAhB;AACA,MAAIC,QAAQ,CAAC,KAAG,EAAJ,IAAQD,UAAUA,UAAU5L,MAAV,GAAiB,CAA3B,CAApB;;AAEA;AACA,WAAS8L,iBAAT,CAA2BrM,CAA3B,EAA8B;AAC5B,QAAIxC,CAAJ;AAAA,QAAOC,IAAI,KAAK6E,GAAL,EAAX;AACA,QAAG7E,EAAEuC,CAAF,IAAO,CAAP,IAAYvC,EAAE,CAAF,KAAQ0O,UAAUA,UAAU5L,MAAV,GAAiB,CAA3B,CAAvB,EAAsD;AACpD,WAAI/C,IAAI,CAAR,EAAWA,IAAI2O,UAAU5L,MAAzB,EAAiC,EAAE/C,CAAnC;AACE,YAAGC,EAAE,CAAF,KAAQ0O,UAAU3O,CAAV,CAAX,EAAyB,OAAO,IAAP;AAD3B,OAEA,OAAO,KAAP;AACD;AACD,QAAGC,EAAEyI,MAAF,EAAH,EAAe,OAAO,KAAP;AACf1I,QAAI,CAAJ;AACA,WAAMA,IAAI2O,UAAU5L,MAApB,EAA4B;AAC1B,UAAIlC,IAAI8N,UAAU3O,CAAV,CAAR;AAAA,UAAsBG,IAAIH,IAAE,CAA5B;AACA,aAAMG,IAAIwO,UAAU5L,MAAd,IAAwBlC,IAAI+N,KAAlC;AAAyC/N,aAAK8N,UAAUxO,GAAV,CAAL;AAAzC,OACAU,IAAIZ,EAAE6O,MAAF,CAASjO,CAAT,CAAJ;AACA,aAAMb,IAAIG,CAAV;AAAa,YAAGU,IAAE8N,UAAU3O,GAAV,CAAF,IAAoB,CAAvB,EAA0B,OAAO,KAAP;AAAvC;AACD;AACD,WAAOC,EAAE8O,WAAF,CAAcvM,CAAd,CAAP;AACD;;AAED;AACA,WAASwM,cAAT,CAAwBxM,CAAxB,EAA2B;AACzB,QAAIyM,KAAK,KAAKR,QAAL,CAAcjP,WAAW0G,GAAzB,CAAT;AACA,QAAIrD,IAAIoM,GAAGb,eAAH,EAAR;AACA,QAAGvL,KAAK,CAAR,EAAW,OAAO,KAAP;AACX,QAAIN,IAAI0M,GAAGC,UAAH,CAAcrM,CAAd,CAAR;AACAL,QAAKA,IAAE,CAAH,IAAO,CAAX;AACA,QAAGA,IAAImM,UAAU5L,MAAjB,EAAyBP,IAAImM,UAAU5L,MAAd;AACzB,QAAItD,IAAIK,KAAR;AACA,SAAI,IAAIE,IAAI,CAAZ,EAAeA,IAAIwC,CAAnB,EAAsB,EAAExC,CAAxB,EAA2B;AACzB;AACAP,QAAEkD,OAAF,CAAUgM,UAAUrO,KAAKC,KAAL,CAAWD,KAAK6O,MAAL,KAAcR,UAAU5L,MAAnC,CAAV,CAAV;AACA,UAAIgC,IAAItF,EAAE2P,MAAF,CAAS7M,CAAT,EAAW,IAAX,CAAR;AACA,UAAGwC,EAAEkB,SAAF,CAAYzG,WAAW0G,GAAvB,KAA+B,CAA/B,IAAoCnB,EAAEkB,SAAF,CAAYgJ,EAAZ,KAAmB,CAA1D,EAA6D;AAC3D,YAAI9O,IAAI,CAAR;AACA,eAAMA,MAAM0C,CAAN,IAAWkC,EAAEkB,SAAF,CAAYgJ,EAAZ,KAAmB,CAApC,EAAuC;AACrClK,cAAIA,EAAE8D,SAAF,CAAY,CAAZ,EAAc,IAAd,CAAJ;AACA,cAAG9D,EAAEkB,SAAF,CAAYzG,WAAW0G,GAAvB,KAA+B,CAAlC,EAAqC,OAAO,KAAP;AACtC;AACD,YAAGnB,EAAEkB,SAAF,CAAYgJ,EAAZ,KAAmB,CAAtB,EAAyB,OAAO,KAAP;AAC1B;AACF;AACD,WAAO,IAAP;AACD;;AAED;AACAzP,aAAW0B,SAAX,CAAqBuI,SAArB,GAAiCP,YAAjC;AACA1J,aAAW0B,SAAX,CAAqBuC,OAArB,GAA+B6F,UAA/B;AACA9J,aAAW0B,SAAX,CAAqB4B,SAArB,GAAiC8G,YAAjC;AACApK,aAAW0B,SAAX,CAAqBtB,UAArB,GAAkCmK,aAAlC;AACAvK,aAAW0B,SAAX,CAAqB+I,SAArB,GAAiCS,YAAjC;AACAlL,aAAW0B,SAAX,CAAqB4K,SAArB,GAAiCF,YAAjC;AACApM,aAAW0B,SAAX,CAAqBiL,KAArB,GAA6BF,QAA7B;AACAzM,aAAW0B,SAAX,CAAqB2I,SAArB,GAAiC6C,YAAjC;AACAlN,aAAW0B,SAAX,CAAqB4I,UAArB,GAAkC6C,aAAlC;AACAnN,aAAW0B,SAAX,CAAqByM,eAArB,GAAuCV,kBAAvC;AACAzN,aAAW0B,SAAX,CAAqBwM,eAArB,GAAuCR,kBAAvC;AACA1N,aAAW0B,SAAX,CAAqB4N,MAArB,GAA8BT,SAA9B;AACA7O,aAAW0B,SAAX,CAAqB6N,WAArB,GAAmCC,cAAnC;;AAEA;AACAxP,aAAW0B,SAAX,CAAqBiN,KAArB,GAA6BrF,OAA7B;AACAtJ,aAAW0B,SAAX,CAAqBwI,QAArB,GAAgCX,UAAhC;AACAvJ,aAAW0B,SAAX,CAAqBmO,SAArB,GAAiCrG,WAAjC;AACAxJ,aAAW0B,SAAX,CAAqBoO,UAArB,GAAkCrG,YAAlC;AACAzJ,aAAW0B,SAAX,CAAqBqI,MAArB,GAA8BF,QAA9B;AACA7J,aAAW0B,SAAX,CAAqBqO,WAArB,GAAmCjF,aAAnC;AACA9K,aAAW0B,SAAX,CAAqBsO,MAArB,GAA8BjF,QAA9B;AACA/K,aAAW0B,SAAX,CAAqB0D,GAArB,GAA2B4F,KAA3B;AACAhL,aAAW0B,SAAX,CAAqBkD,GAArB,GAA2BqG,KAA3B;AACAjL,aAAW0B,SAAX,CAAqBuO,GAArB,GAA2B3E,KAA3B;AACAtL,aAAW0B,SAAX,CAAqBwO,EAArB,GAA0B3E,IAA1B;AACAvL,aAAW0B,SAAX,CAAqByO,GAArB,GAA2B1E,KAA3B;AACAzL,aAAW0B,SAAX,CAAqB0O,MAArB,GAA8BzE,QAA9B;AACA3L,aAAW0B,SAAX,CAAqB2O,GAArB,GAA2BzE,KAA3B;AACA5L,aAAW0B,SAAX,CAAqBgJ,SAArB,GAAiCmB,WAAjC;AACA7L,aAAW0B,SAAX,CAAqBgO,UAArB,GAAkC5D,YAAlC;AACA9L,aAAW0B,SAAX,CAAqBkN,eAArB,GAAuC5C,iBAAvC;AACAhM,aAAW0B,SAAX,CAAqB4O,QAArB,GAAgCpE,UAAhC;AACAlM,aAAW0B,SAAX,CAAqB8I,OAArB,GAA+B2B,SAA/B;AACAnM,aAAW0B,SAAX,CAAqB6O,MAArB,GAA8BlE,QAA9B;AACArM,aAAW0B,SAAX,CAAqB8O,QAArB,GAAgCjE,UAAhC;AACAvM,aAAW0B,SAAX,CAAqB+O,OAArB,GAA+BjE,SAA/B;AACAxM,aAAW0B,SAAX,CAAqBwN,GAArB,GAA2BxC,KAA3B;AACA1M,aAAW0B,SAAX,CAAqBuN,QAArB,GAAgCrC,UAAhC;AACA5M,aAAW0B,SAAX,CAAqBgP,QAArB,GAAgC7D,UAAhC;AACA7M,aAAW0B,SAAX,CAAqBoM,MAArB,GAA8Bf,QAA9B;AACA/M,aAAW0B,SAAX,CAAqBiP,SAArB,GAAiC3D,WAAjC;AACAhN,aAAW0B,SAAX,CAAqBkP,kBAArB,GAA0C3D,oBAA1C;AACAjN,aAAW0B,SAAX,CAAqBkO,MAArB,GAA8BtB,QAA9B;AACAtO,aAAW0B,SAAX,CAAqBmP,UAArB,GAAkC/B,YAAlC;AACA9O,aAAW0B,SAAX,CAAqBO,GAArB,GAA2BuL,KAA3B;AACAxN,aAAW0B,SAAX,CAAqBoP,GAArB,GAA2BpC,KAA3B;AACA1O,aAAW0B,SAAX,CAAqBkJ,eAArB,GAAuCyE,iBAAvC;;AAEA;AACArP,aAAW0B,SAAX,CAAqBqP,MAArB,GAA8BjE,QAA9B;;AAEA;AACA9M,aAAW0B,SAAX,CAAqBiM,OAArB,GAA+BA,OAA/B;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEH;;AAEA;AACA;AACA;;AAEA,MAAIqD,SAAJ;AACA,MAAIC,QAAJ;AACA,MAAIC,QAAJ;;AAEA;AACA,WAASC,YAAT,CAAsB1Q,CAAtB,EAAyB;AACvBwQ,aAASC,UAAT,KAAwBzQ,IAAI,GAA5B;AACAwQ,aAASC,UAAT,KAAyBzQ,KAAK,CAAN,GAAW,GAAnC;AACAwQ,aAASC,UAAT,KAAyBzQ,KAAK,EAAN,GAAY,GAApC;AACAwQ,aAASC,UAAT,KAAyBzQ,KAAK,EAAN,GAAY,GAApC;AACA,QAAGyQ,YAAYE,SAAf,EAA0BF,YAAYE,SAAZ;AAC3B;;AAED;AACA,WAASC,aAAT,GAAyB;AACvBF,iBAAa,IAAIG,IAAJ,GAAWC,OAAX,EAAb;AACD;;AAED;AACA,MAAGN,YAAY,IAAf,EAAqB;AACnBA,eAAW,IAAI3O,KAAJ,EAAX;AACA4O,eAAW,CAAX;AACA,QAAIlO,CAAJ;AACA,QAAG,OAAOwO,MAAP,KAAkB,WAAlB,IAAiCA,OAAOC,MAA3C,EAAmD;AACpD,UAAID,OAAOC,MAAP,CAAcC,eAAlB,EAAmC;AACjC;AACA,YAAIC,KAAK,IAAIC,UAAJ,CAAe,EAAf,CAAT;AACAJ,eAAOC,MAAP,CAAcC,eAAd,CAA8BC,EAA9B;AACA,aAAI3O,IAAI,CAAR,EAAWA,IAAI,EAAf,EAAmB,EAAEA,CAArB;AACDiO,mBAASC,UAAT,IAAuBS,GAAG3O,CAAH,CAAvB;AADC;AAED,OAND,MAOK,IAAGxB,UAAUC,OAAV,IAAqB,UAArB,IAAmCD,UAAUqQ,UAAV,GAAuB,GAA7D,EAAkE;AACrE;AACA,YAAI/I,IAAI0I,OAAOC,MAAP,CAAc9B,MAAd,CAAqB,EAArB,CAAR;AACA,aAAI3M,IAAI,CAAR,EAAWA,IAAI8F,EAAEvF,MAAjB,EAAyB,EAAEP,CAA3B;AACDiO,mBAASC,UAAT,IAAuBpI,EAAErG,UAAF,CAAaO,CAAb,IAAkB,GAAzC;AADC;AAED;AACC;AACD,WAAMkO,WAAWE,SAAjB,EAA4B;AAAG;AAChCpO,UAAIlC,KAAKC,KAAL,CAAW,QAAQD,KAAK6O,MAAL,EAAnB,CAAJ;AACAsB,eAASC,UAAT,IAAuBlO,MAAM,CAA7B;AACAiO,eAASC,UAAT,IAAuBlO,IAAI,GAA3B;AACE;AACDkO,eAAW,CAAX;AACAG;AACA;AACA;AACD;;AAED,WAASS,YAAT,GAAwB;AACtB,QAAGd,aAAa,IAAhB,EAAsB;AACvBK;AACAL,kBAAYe,eAAZ;AACAf,gBAAUgB,IAAV,CAAef,QAAf;AACA,WAAIC,WAAW,CAAf,EAAkBA,WAAWD,SAAS1N,MAAtC,EAA8C,EAAE2N,QAAhD;AACED,iBAASC,QAAT,IAAqB,CAArB;AADF,OAEAA,WAAW,CAAX;AACA;AACE;AACD;AACA,WAAOF,UAAUiB,IAAV,EAAP;AACD;;AAED,WAASC,aAAT,CAAuBC,EAAvB,EAA2B;AACzB,QAAI3R,CAAJ;AACA,SAAIA,IAAI,CAAR,EAAWA,IAAI2R,GAAG5O,MAAlB,EAA0B,EAAE/C,CAA5B;AAA+B2R,SAAG3R,CAAH,IAAQsR,cAAR;AAA/B;AACD;;AAED,WAASM,YAAT,GAAwB,CAAE;;AAE1BA,eAAa1Q,SAAb,CAAuBmJ,SAAvB,GAAmCqH,aAAnC;;AAEA;;AAEA,WAASG,OAAT,GAAmB;AACjB,SAAK7R,CAAL,GAAS,CAAT;AACA,SAAKG,CAAL,GAAS,CAAT;AACA,SAAK2R,CAAL,GAAS,IAAIhQ,KAAJ,EAAT;AACD;;AAED;AACA,WAASiQ,QAAT,CAAkBC,GAAlB,EAAuB;AACrB,QAAIhS,CAAJ,EAAOG,CAAP,EAAUqC,CAAV;AACA,SAAIxC,IAAI,CAAR,EAAWA,IAAI,GAAf,EAAoB,EAAEA,CAAtB;AACD,WAAK8R,CAAL,CAAO9R,CAAP,IAAYA,CAAZ;AADC,KAEAG,IAAI,CAAJ;AACA,SAAIH,IAAI,CAAR,EAAWA,IAAI,GAAf,EAAoB,EAAEA,CAAtB,EAAyB;AAC1BG,UAAKA,IAAI,KAAK2R,CAAL,CAAO9R,CAAP,CAAJ,GAAgBgS,IAAIhS,IAAIgS,IAAIjP,MAAZ,CAAjB,GAAwC,GAA5C;AACAP,UAAI,KAAKsP,CAAL,CAAO9R,CAAP,CAAJ;AACA,WAAK8R,CAAL,CAAO9R,CAAP,IAAY,KAAK8R,CAAL,CAAO3R,CAAP,CAAZ;AACA,WAAK2R,CAAL,CAAO3R,CAAP,IAAYqC,CAAZ;AACE;AACD,SAAKxC,CAAL,GAAS,CAAT;AACA,SAAKG,CAAL,GAAS,CAAT;AACD;;AAED,WAAS8R,QAAT,GAAoB;AAClB,QAAIzP,CAAJ;AACA,SAAKxC,CAAL,GAAU,KAAKA,CAAL,GAAS,CAAV,GAAe,GAAxB;AACA,SAAKG,CAAL,GAAU,KAAKA,CAAL,GAAS,KAAK2R,CAAL,CAAO,KAAK9R,CAAZ,CAAV,GAA4B,GAArC;AACAwC,QAAI,KAAKsP,CAAL,CAAO,KAAK9R,CAAZ,CAAJ;AACA,SAAK8R,CAAL,CAAO,KAAK9R,CAAZ,IAAiB,KAAK8R,CAAL,CAAO,KAAK3R,CAAZ,CAAjB;AACA,SAAK2R,CAAL,CAAO,KAAK3R,CAAZ,IAAiBqC,CAAjB;AACA,WAAO,KAAKsP,CAAL,CAAQtP,IAAI,KAAKsP,CAAL,CAAO,KAAK9R,CAAZ,CAAL,GAAuB,GAA9B,CAAP;AACD;;AAED6R,UAAQ3Q,SAAR,CAAkBsQ,IAAlB,GAAyBO,QAAzB;AACAF,UAAQ3Q,SAAR,CAAkBuQ,IAAlB,GAAyBQ,QAAzB;;AAEA;AACA,WAASV,aAAT,GAAyB;AACvB,WAAO,IAAIM,OAAJ,EAAP;AACD;;AAED;AACA;AACA,MAAIjB,YAAY,GAAhB;;AAECpR,aAAWoS,YAAX,GAA0BA,YAA1B;AACApS,aAAWA,UAAX,GAAwBA,UAAxB;AACA,MAAI,OAAO0S,OAAP,KAAmB,WAAvB,EAAoC;AAClCA,cAAUC,OAAOD,OAAP,GAAiB1S,UAA3B;AACD,GAFD,MAEO;AACL,SAAKA,UAAL,GAAkBA,UAAlB;AACA,SAAKoS,YAAL,GAAoBA,YAApB;AACD;AAEF,CA50CD,EA40CGQ,IA50CH","file":"index.js","sourceRoot":"/data","sourcesContent":["(function(){\n\n // Copyright (c) 2005 Tom Wu\n // All Rights Reserved.\n // See \"LICENSE\" for details.\n\n // Basic JavaScript BN library - subset useful for RSA encryption.\n\n // Bits per digit\n var dbits;\n\n // JavaScript engine analysis\n var canary = 0xdeadbeefcafe;\n var j_lm = ((canary&0xffffff)==0xefcafe);\n\n // (public) Constructor\n function BigInteger(a,b,c) {\n if(a != null)\n if(\"number\" == typeof a) this.fromNumber(a,b,c);\n else if(b == null && \"string\" != typeof a) this.fromString(a,256);\n else this.fromString(a,b);\n }\n\n // return new, unset BigInteger\n function nbi() { return new BigInteger(null); }\n\n // am: Compute w_j += (x*this_i), propagate carries,\n // c is initial carry, returns final carry.\n // c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n // We need to select the fastest one that works in this environment.\n\n // am1: use a single mult and divide to get the high bits,\n // max digit bits should be 26 because\n // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\n function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }\n // am2 avoids a big mult-and-extract completely.\n // Max digit bits should be <= 30 because we do bitwise ops\n // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\n function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }\n // Alternately, set max digit bits to 28 since some\n // browsers slow down when dealing with 32-bit numbers.\n function am3(i,x,w,j,c,n) {\n var xl = x&0x3fff, xh = x>>14;\n while(--n >= 0) {\n var l = this[i]&0x3fff;\n var h = this[i++]>>14;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x3fff)<<14)+w[j]+c;\n c = (l>>28)+(m>>14)+xh*h;\n w[j++] = l&0xfffffff;\n }\n return c;\n }\n var inBrowser = typeof navigator !== \"undefined\";\n if(inBrowser && j_lm && (navigator.appName == \"Microsoft Internet Explorer\")) {\n BigInteger.prototype.am = am2;\n dbits = 30;\n }\n else if(inBrowser && j_lm && (navigator.appName != \"Netscape\")) {\n BigInteger.prototype.am = am1;\n dbits = 26;\n }\n else { // Mozilla/Netscape seems to prefer am3\n BigInteger.prototype.am = am3;\n dbits = 28;\n }\n\n BigInteger.prototype.DB = dbits;\n BigInteger.prototype.DM = ((1<= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }\n\n // (protected) set from integer value x, -DV <= x < DV\n function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }\n\n // return bigint initialized to value\n function nbv(i) { var r = nbi(); r.fromInt(i); return r; }\n\n // (protected) set from string and radix\n function bnpFromString(s,b) {\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 256) k = 8; // byte array\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else { this.fromRadix(s,b); return; }\n this.t = 0;\n this.s = 0;\n var i = s.length, mi = false, sh = 0;\n while(--i >= 0) {\n var x = (k==8)?s[i]&0xff:intAt(s,i);\n if(x < 0) {\n if(s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if(sh == 0)\n this[this.t++] = x;\n else if(sh+k > this.DB) {\n this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<>(this.DB-sh));\n }\n else\n this[this.t-1] |= x<= this.DB) sh -= this.DB;\n }\n if(k == 8 && (s[0]&0x80) != 0) {\n this.s = -1;\n if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)< 0 && this[this.t-1] == c) --this.t;\n }\n\n // (public) return string representation in given radix\n function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1< 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }\n\n // (public) -this\n function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }\n\n // (public) |this|\n function bnAbs() { return (this.s<0)?this.negate():this; }\n\n // (public) return + if this > a, - if this < a, 0 if equal\n function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }\n\n // returns bit length of the integer x\n function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }\n\n // (public) return the number of bits in \"this\"\n function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }\n\n // (protected) r = this << n*DB\n function bnpDLShiftTo(n,r) {\n var i;\n for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];\n for(i = n-1; i >= 0; --i) r[i] = 0;\n r.t = this.t+n;\n r.s = this.s;\n }\n\n // (protected) r = this >> n*DB\n function bnpDRShiftTo(n,r) {\n for(var i = n; i < this.t; ++i) r[i-n] = this[i];\n r.t = Math.max(this.t-n,0);\n r.s = this.s;\n }\n\n // (protected) r = this << n\n function bnpLShiftTo(n,r) {\n var bs = n%this.DB;\n var cbs = this.DB-bs;\n var bm = (1<= 0; --i) {\n r[i+ds+1] = (this[i]>>cbs)|c;\n c = (this[i]&bm)<= 0; --i) r[i] = 0;\n r[ds] = c;\n r.t = this.t+ds+1;\n r.s = this.s;\n r.clamp();\n }\n\n // (protected) r = this >> n\n function bnpRShiftTo(n,r) {\n r.s = this.s;\n var ds = Math.floor(n/this.DB);\n if(ds >= this.t) { r.t = 0; return; }\n var bs = n%this.DB;\n var cbs = this.DB-bs;\n var bm = (1<>bs;\n for(var i = ds+1; i < this.t; ++i) {\n r[i-ds-1] |= (this[i]&bm)<>bs;\n }\n if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<>= this.DB;\n }\n if(a.t < this.t) {\n c -= a.s;\n while(i < this.t) {\n c += this[i];\n r[i++] = c&this.DM;\n c >>= this.DB;\n }\n c += this.s;\n }\n else {\n c += this.s;\n while(i < a.t) {\n c -= a[i];\n r[i++] = c&this.DM;\n c >>= this.DB;\n }\n c -= a.s;\n }\n r.s = (c<0)?-1:0;\n if(c < -1) r[i++] = this.DV+c;\n else if(c > 0) r[i++] = c;\n r.t = i;\n r.clamp();\n }\n\n // (protected) r = this * a, r != this,a (HAC 14.12)\n // \"this\" should be the larger one if appropriate.\n function bnpMultiplyTo(a,r) {\n var x = this.abs(), y = a.abs();\n var i = x.t;\n r.t = i+y.t;\n while(--i >= 0) r[i] = 0;\n for(i = 0; i < y.t; ++i) r[i+x.t] = x.am(0,y[i],r,i,0,x.t);\n r.s = 0;\n r.clamp();\n if(this.s != a.s) BigInteger.ZERO.subTo(r,r);\n }\n\n // (protected) r = this^2, r != this (HAC 14.16)\n function bnpSquareTo(r) {\n var x = this.abs();\n var i = r.t = 2*x.t;\n while(--i >= 0) r[i] = 0;\n for(i = 0; i < x.t-1; ++i) {\n var c = x.am(i,x[i],r,2*i,0,1);\n if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {\n r[i+x.t] -= x.DV;\n r[i+x.t+1] = 1;\n }\n }\n if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1);\n r.s = 0;\n r.clamp();\n }\n\n // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n // r != q, this != m. q or r may be null.\n function bnpDivRemTo(m,q,r) {\n var pm = m.abs();\n if(pm.t <= 0) return;\n var pt = this.abs();\n if(pt.t < pm.t) {\n if(q != null) q.fromInt(0);\n if(r != null) this.copyTo(r);\n return;\n }\n if(r == null) r = nbi();\n var y = nbi(), ts = this.s, ms = m.s;\n var nsh = this.DB-nbits(pm[pm.t-1]); // normalize modulus\n if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); }\n else { pm.copyTo(y); pt.copyTo(r); }\n var ys = y.t;\n var y0 = y[ys-1];\n if(y0 == 0) return;\n var yt = y0*(1<1)?y[ys-2]>>this.F2:0);\n var d1 = this.FV/yt, d2 = (1<= 0) {\n r[r.t++] = 1;\n r.subTo(t,r);\n }\n BigInteger.ONE.dlShiftTo(ys,t);\n t.subTo(y,y); // \"negative\" y so we can replace sub with am later\n while(y.t < ys) y[y.t++] = 0;\n while(--j >= 0) {\n // Estimate quotient digit\n var qd = (r[--i]==y0)?this.DM:Math.floor(r[i]*d1+(r[i-1]+e)*d2);\n if((r[i]+=y.am(0,qd,r,j,0,ys)) < qd) { // Try it out\n y.dlShiftTo(j,t);\n r.subTo(t,r);\n while(r[i] < --qd) r.subTo(t,r);\n }\n }\n if(q != null) {\n r.drShiftTo(ys,q);\n if(ts != ms) BigInteger.ZERO.subTo(q,q);\n }\n r.t = ys;\n r.clamp();\n if(nsh > 0) r.rShiftTo(nsh,r); // Denormalize remainder\n if(ts < 0) BigInteger.ZERO.subTo(r,r);\n }\n\n // (public) this mod a\n function bnMod(a) {\n var r = nbi();\n this.abs().divRemTo(a,null,r);\n if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);\n return r;\n }\n\n // Modular reduction using \"classic\" algorithm\n function Classic(m) { this.m = m; }\n function cConvert(x) {\n if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);\n else return x;\n }\n function cRevert(x) { return x; }\n function cReduce(x) { x.divRemTo(this.m,null,x); }\n function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n Classic.prototype.convert = cConvert;\n Classic.prototype.revert = cRevert;\n Classic.prototype.reduce = cReduce;\n Classic.prototype.mulTo = cMulTo;\n Classic.prototype.sqrTo = cSqrTo;\n\n // (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n // justification:\n // xy == 1 (mod m)\n // xy = 1+km\n // xy(2-xy) = (1+km)(1-km)\n // x[y(2-xy)] = 1-k^2m^2\n // x[y(2-xy)] == 1 (mod m^2)\n // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n // JS multiply \"overflows\" differently from C/C++, so care is needed here.\n function bnpInvDigit() {\n if(this.t < 1) return 0;\n var x = this[0];\n if((x&1) == 0) return 0;\n var y = x&3; // y == 1/x mod 2^2\n y = (y*(2-(x&0xf)*y))&0xf; // y == 1/x mod 2^4\n y = (y*(2-(x&0xff)*y))&0xff; // y == 1/x mod 2^8\n y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff; // y == 1/x mod 2^16\n // last step - calculate inverse mod DV directly;\n // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n y = (y*(2-x*y%this.DV))%this.DV; // y == 1/x mod 2^dbits\n // we really want the negative inverse, and -DV < y < DV\n return (y>0)?this.DV-y:-y;\n }\n\n // Montgomery reduction\n function Montgomery(m) {\n this.m = m;\n this.mp = m.invDigit();\n this.mpl = this.mp&0x7fff;\n this.mph = this.mp>>15;\n this.um = (1<<(m.DB-15))-1;\n this.mt2 = 2*m.t;\n }\n\n // xR mod m\n function montConvert(x) {\n var r = nbi();\n x.abs().dlShiftTo(this.m.t,r);\n r.divRemTo(this.m,null,r);\n if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);\n return r;\n }\n\n // x/R mod m\n function montRevert(x) {\n var r = nbi();\n x.copyTo(r);\n this.reduce(r);\n return r;\n }\n\n // x = x/R mod m (HAC 14.32)\n function montReduce(x) {\n while(x.t <= this.mt2) // pad x so am has enough room later\n x[x.t++] = 0;\n for(var i = 0; i < this.m.t; ++i) {\n // faster way of calculating u0 = x[i]*mp mod DV\n var j = x[i]&0x7fff;\n var u0 = (j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM;\n // use am to combine the multiply-shift-add into one call\n j = i+this.m.t;\n x[j] += this.m.am(0,u0,x,i,0,this.m.t);\n // propagate carry\n while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }\n }\n x.clamp();\n x.drShiftTo(this.m.t,x);\n if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n }\n\n // r = \"x^2/R mod m\"; x != r\n function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n // r = \"xy/R mod m\"; x,y != r\n function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\n Montgomery.prototype.convert = montConvert;\n Montgomery.prototype.revert = montRevert;\n Montgomery.prototype.reduce = montReduce;\n Montgomery.prototype.mulTo = montMulTo;\n Montgomery.prototype.sqrTo = montSqrTo;\n\n // (protected) true iff this is even\n function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }\n\n // (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\n function bnpExp(e,z) {\n if(e > 0xffffffff || e < 1) return BigInteger.ONE;\n var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;\n g.copyTo(r);\n while(--i >= 0) {\n z.sqrTo(r,r2);\n if((e&(1< 0) z.mulTo(r2,g,r);\n else { var t = r; r = r2; r2 = t; }\n }\n return z.revert(r);\n }\n\n // (public) this^e % m, 0 <= e < 2^32\n function bnModPowInt(e,m) {\n var z;\n if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);\n return this.exp(e,z);\n }\n\n // protected\n BigInteger.prototype.copyTo = bnpCopyTo;\n BigInteger.prototype.fromInt = bnpFromInt;\n BigInteger.prototype.fromString = bnpFromString;\n BigInteger.prototype.clamp = bnpClamp;\n BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\n BigInteger.prototype.drShiftTo = bnpDRShiftTo;\n BigInteger.prototype.lShiftTo = bnpLShiftTo;\n BigInteger.prototype.rShiftTo = bnpRShiftTo;\n BigInteger.prototype.subTo = bnpSubTo;\n BigInteger.prototype.multiplyTo = bnpMultiplyTo;\n BigInteger.prototype.squareTo = bnpSquareTo;\n BigInteger.prototype.divRemTo = bnpDivRemTo;\n BigInteger.prototype.invDigit = bnpInvDigit;\n BigInteger.prototype.isEven = bnpIsEven;\n BigInteger.prototype.exp = bnpExp;\n\n // public\n BigInteger.prototype.toString = bnToString;\n BigInteger.prototype.negate = bnNegate;\n BigInteger.prototype.abs = bnAbs;\n BigInteger.prototype.compareTo = bnCompareTo;\n BigInteger.prototype.bitLength = bnBitLength;\n BigInteger.prototype.mod = bnMod;\n BigInteger.prototype.modPowInt = bnModPowInt;\n\n // \"constants\"\n BigInteger.ZERO = nbv(0);\n BigInteger.ONE = nbv(1);\n\n // Copyright (c) 2005-2009 Tom Wu\n // All Rights Reserved.\n // See \"LICENSE\" for details.\n\n // Extended JavaScript BN functions, required for RSA private ops.\n\n // Version 1.1: new BigInteger(\"0\", 10) returns \"proper\" zero\n // Version 1.2: square() API, isProbablePrime fix\n\n // (public)\n function bnClone() { var r = nbi(); this.copyTo(r); return r; }\n\n // (public) return value as integer\n function bnIntValue() {\n if(this.s < 0) {\n if(this.t == 1) return this[0]-this.DV;\n else if(this.t == 0) return -1;\n }\n else if(this.t == 1) return this[0];\n else if(this.t == 0) return 0;\n // assumes 16 < DB < 32\n return ((this[1]&((1<<(32-this.DB))-1))<>24; }\n\n // (public) return value as short (assumes DB>=16)\n function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; }\n\n // (protected) return x s.t. r^x < DV\n function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }\n\n // (public) 0 if this == 0, 1 if this > 0\n function bnSigNum() {\n if(this.s < 0) return -1;\n else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;\n else return 1;\n }\n\n // (protected) convert to radix string\n function bnpToRadix(b) {\n if(b == null) b = 10;\n if(this.signum() == 0 || b < 2 || b > 36) return \"0\";\n var cs = this.chunkSize(b);\n var a = Math.pow(b,cs);\n var d = nbv(a), y = nbi(), z = nbi(), r = \"\";\n this.divRemTo(d,y,z);\n while(y.signum() > 0) {\n r = (a+z.intValue()).toString(b).substr(1) + r;\n y.divRemTo(d,y,z);\n }\n return z.intValue().toString(b) + r;\n }\n\n // (protected) convert from radix string\n function bnpFromRadix(s,b) {\n this.fromInt(0);\n if(b == null) b = 10;\n var cs = this.chunkSize(b);\n var d = Math.pow(b,cs), mi = false, j = 0, w = 0;\n for(var i = 0; i < s.length; ++i) {\n var x = intAt(s,i);\n if(x < 0) {\n if(s.charAt(i) == \"-\" && this.signum() == 0) mi = true;\n continue;\n }\n w = b*w+x;\n if(++j >= cs) {\n this.dMultiply(d);\n this.dAddOffset(w,0);\n j = 0;\n w = 0;\n }\n }\n if(j > 0) {\n this.dMultiply(Math.pow(b,j));\n this.dAddOffset(w,0);\n }\n if(mi) BigInteger.ZERO.subTo(this,this);\n }\n\n // (protected) alternate constructor\n function bnpFromNumber(a,b,c) {\n if(\"number\" == typeof b) {\n // new BigInteger(int,int,RNG)\n if(a < 2) this.fromInt(1);\n else {\n this.fromNumber(a,c);\n if(!this.testBit(a-1))\t// force MSB set\n this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);\n if(this.isEven()) this.dAddOffset(1,0); // force odd\n while(!this.isProbablePrime(b)) {\n this.dAddOffset(2,0);\n if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);\n }\n }\n }\n else {\n // new BigInteger(int,RNG)\n var x = new Array(), t = a&7;\n x.length = (a>>3)+1;\n b.nextBytes(x);\n if(t > 0) x[0] &= ((1< 0) {\n if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)\n r[k++] = d|(this.s<<(this.DB-p));\n while(i >= 0) {\n if(p < 8) {\n d = (this[i]&((1<>(p+=this.DB-8);\n }\n else {\n d = (this[i]>>(p-=8))&0xff;\n if(p <= 0) { p += this.DB; --i; }\n }\n if((d&0x80) != 0) d |= -256;\n if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;\n if(k > 0 || d != this.s) r[k++] = d;\n }\n }\n return r;\n }\n\n function bnEquals(a) { return(this.compareTo(a)==0); }\n function bnMin(a) { return(this.compareTo(a)<0)?this:a; }\n function bnMax(a) { return(this.compareTo(a)>0)?this:a; }\n\n // (protected) r = this op a (bitwise)\n function bnpBitwiseTo(a,op,r) {\n var i, f, m = Math.min(a.t,this.t);\n for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);\n if(a.t < this.t) {\n f = a.s&this.DM;\n for(i = m; i < this.t; ++i) r[i] = op(this[i],f);\n r.t = this.t;\n }\n else {\n f = this.s&this.DM;\n for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);\n r.t = a.t;\n }\n r.s = op(this.s,a.s);\n r.clamp();\n }\n\n // (public) this & a\n function op_and(x,y) { return x&y; }\n function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }\n\n // (public) this | a\n function op_or(x,y) { return x|y; }\n function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }\n\n // (public) this ^ a\n function op_xor(x,y) { return x^y; }\n function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }\n\n // (public) this & ~a\n function op_andnot(x,y) { return x&~y; }\n function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }\n\n // (public) ~this\n function bnNot() {\n var r = nbi();\n for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i];\n r.t = this.t;\n r.s = ~this.s;\n return r;\n }\n\n // (public) this << n\n function bnShiftLeft(n) {\n var r = nbi();\n if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);\n return r;\n }\n\n // (public) this >> n\n function bnShiftRight(n) {\n var r = nbi();\n if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);\n return r;\n }\n\n // return index of lowest 1-bit in x, x < 2^31\n function lbit(x) {\n if(x == 0) return -1;\n var r = 0;\n if((x&0xffff) == 0) { x >>= 16; r += 16; }\n if((x&0xff) == 0) { x >>= 8; r += 8; }\n if((x&0xf) == 0) { x >>= 4; r += 4; }\n if((x&3) == 0) { x >>= 2; r += 2; }\n if((x&1) == 0) ++r;\n return r;\n }\n\n // (public) returns index of lowest 1-bit (or -1 if none)\n function bnGetLowestSetBit() {\n for(var i = 0; i < this.t; ++i)\n if(this[i] != 0) return i*this.DB+lbit(this[i]);\n if(this.s < 0) return this.t*this.DB;\n return -1;\n }\n\n // return number of 1 bits in x\n function cbit(x) {\n var r = 0;\n while(x != 0) { x &= x-1; ++r; }\n return r;\n }\n\n // (public) return number of set bits\n function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }\n\n // (public) true iff nth bit is set\n function bnTestBit(n) {\n var j = Math.floor(n/this.DB);\n if(j >= this.t) return(this.s!=0);\n return((this[j]&(1<<(n%this.DB)))!=0);\n }\n\n // (protected) this op (1<>= this.DB;\n }\n if(a.t < this.t) {\n c += a.s;\n while(i < this.t) {\n c += this[i];\n r[i++] = c&this.DM;\n c >>= this.DB;\n }\n c += this.s;\n }\n else {\n c += this.s;\n while(i < a.t) {\n c += a[i];\n r[i++] = c&this.DM;\n c >>= this.DB;\n }\n c += a.s;\n }\n r.s = (c<0)?-1:0;\n if(c > 0) r[i++] = c;\n else if(c < -1) r[i++] = this.DV+c;\n r.t = i;\n r.clamp();\n }\n\n // (public) this + a\n function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }\n\n // (public) this - a\n function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }\n\n // (public) this * a\n function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }\n\n // (public) this^2\n function bnSquare() { var r = nbi(); this.squareTo(r); return r; }\n\n // (public) this / a\n function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }\n\n // (public) this % a\n function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }\n\n // (public) [this/a,this%a]\n function bnDivideAndRemainder(a) {\n var q = nbi(), r = nbi();\n this.divRemTo(a,q,r);\n return new Array(q,r);\n }\n\n // (protected) this *= n, this >= 0, 1 < n < DV\n function bnpDMultiply(n) {\n this[this.t] = this.am(0,n-1,this,0,0,this.t);\n ++this.t;\n this.clamp();\n }\n\n // (protected) this += n << w words, this >= 0\n function bnpDAddOffset(n,w) {\n if(n == 0) return;\n while(this.t <= w) this[this.t++] = 0;\n this[w] += n;\n while(this[w] >= this.DV) {\n this[w] -= this.DV;\n if(++w >= this.t) this[this.t++] = 0;\n ++this[w];\n }\n }\n\n // A \"null\" reducer\n function NullExp() {}\n function nNop(x) { return x; }\n function nMulTo(x,y,r) { x.multiplyTo(y,r); }\n function nSqrTo(x,r) { x.squareTo(r); }\n\n NullExp.prototype.convert = nNop;\n NullExp.prototype.revert = nNop;\n NullExp.prototype.mulTo = nMulTo;\n NullExp.prototype.sqrTo = nSqrTo;\n\n // (public) this^e\n function bnPow(e) { return this.exp(e,new NullExp()); }\n\n // (protected) r = lower n words of \"this * a\", a.t <= n\n // \"this\" should be the larger one if appropriate.\n function bnpMultiplyLowerTo(a,n,r) {\n var i = Math.min(this.t+a.t,n);\n r.s = 0; // assumes a,this >= 0\n r.t = i;\n while(i > 0) r[--i] = 0;\n var j;\n for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t);\n for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i);\n r.clamp();\n }\n\n // (protected) r = \"this * a\" without lower n words, n > 0\n // \"this\" should be the larger one if appropriate.\n function bnpMultiplyUpperTo(a,n,r) {\n --n;\n var i = r.t = this.t+a.t-n;\n r.s = 0; // assumes a,this >= 0\n while(--i >= 0) r[i] = 0;\n for(i = Math.max(n-this.t,0); i < a.t; ++i)\n r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n);\n r.clamp();\n r.drShiftTo(1,r);\n }\n\n // Barrett modular reduction\n function Barrett(m) {\n // setup Barrett\n this.r2 = nbi();\n this.q3 = nbi();\n BigInteger.ONE.dlShiftTo(2*m.t,this.r2);\n this.mu = this.r2.divide(m);\n this.m = m;\n }\n\n function barrettConvert(x) {\n if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);\n else if(x.compareTo(this.m) < 0) return x;\n else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }\n }\n\n function barrettRevert(x) { return x; }\n\n // x = x mod m (HAC 14.42)\n function barrettReduce(x) {\n x.drShiftTo(this.m.t-1,this.r2);\n if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }\n this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);\n this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);\n while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);\n x.subTo(this.r2,x);\n while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n }\n\n // r = x^2 mod m; x != r\n function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n // r = x*y mod m; x,y != r\n function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\n Barrett.prototype.convert = barrettConvert;\n Barrett.prototype.revert = barrettRevert;\n Barrett.prototype.reduce = barrettReduce;\n Barrett.prototype.mulTo = barrettMulTo;\n Barrett.prototype.sqrTo = barrettSqrTo;\n\n // (public) this^e % m (HAC 14.85)\n function bnModPow(e,m) {\n var i = e.bitLength(), k, r = nbv(1), z;\n if(i <= 0) return r;\n else if(i < 18) k = 1;\n else if(i < 48) k = 3;\n else if(i < 144) k = 4;\n else if(i < 768) k = 5;\n else k = 6;\n if(i < 8)\n z = new Classic(m);\n else if(m.isEven())\n z = new Barrett(m);\n else\n z = new Montgomery(m);\n\n // precomputation\n var g = new Array(), n = 3, k1 = k-1, km = (1< 1) {\n var g2 = nbi();\n z.sqrTo(g[1],g2);\n while(n <= km) {\n g[n] = nbi();\n z.mulTo(g2,g[n-2],g[n]);\n n += 2;\n }\n }\n\n var j = e.t-1, w, is1 = true, r2 = nbi(), t;\n i = nbits(e[j])-1;\n while(j >= 0) {\n if(i >= k1) w = (e[j]>>(i-k1))&km;\n else {\n w = (e[j]&((1<<(i+1))-1))<<(k1-i);\n if(j > 0) w |= e[j-1]>>(this.DB+i-k1);\n }\n\n n = k;\n while((w&1) == 0) { w >>= 1; --n; }\n if((i -= n) < 0) { i += this.DB; --j; }\n if(is1) {\t// ret == 1, don't bother squaring or multiplying it\n g[w].copyTo(r);\n is1 = false;\n }\n else {\n while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }\n if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }\n z.mulTo(r2,g[w],r);\n }\n\n while(j >= 0 && (e[j]&(1< 0) {\n x.rShiftTo(g,x);\n y.rShiftTo(g,y);\n }\n while(x.signum() > 0) {\n if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);\n if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);\n if(x.compareTo(y) >= 0) {\n x.subTo(y,x);\n x.rShiftTo(1,x);\n }\n else {\n y.subTo(x,y);\n y.rShiftTo(1,y);\n }\n }\n if(g > 0) y.lShiftTo(g,y);\n return y;\n }\n\n // (protected) this % n, n < 2^26\n function bnpModInt(n) {\n if(n <= 0) return 0;\n var d = this.DV%n, r = (this.s<0)?n-1:0;\n if(this.t > 0)\n if(d == 0) r = this[0]%n;\n else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n;\n return r;\n }\n\n // (public) 1/this % m (HAC 14.61)\n function bnModInverse(m) {\n var ac = m.isEven();\n if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;\n var u = m.clone(), v = this.clone();\n var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);\n while(u.signum() != 0) {\n while(u.isEven()) {\n u.rShiftTo(1,u);\n if(ac) {\n if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }\n a.rShiftTo(1,a);\n }\n else if(!b.isEven()) b.subTo(m,b);\n b.rShiftTo(1,b);\n }\n while(v.isEven()) {\n v.rShiftTo(1,v);\n if(ac) {\n if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }\n c.rShiftTo(1,c);\n }\n else if(!d.isEven()) d.subTo(m,d);\n d.rShiftTo(1,d);\n }\n if(u.compareTo(v) >= 0) {\n u.subTo(v,u);\n if(ac) a.subTo(c,a);\n b.subTo(d,b);\n }\n else {\n v.subTo(u,v);\n if(ac) c.subTo(a,c);\n d.subTo(b,d);\n }\n }\n if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\n if(d.compareTo(m) >= 0) return d.subtract(m);\n if(d.signum() < 0) d.addTo(m,d); else return d;\n if(d.signum() < 0) return d.add(m); else return d;\n }\n\n var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];\n var lplim = (1<<26)/lowprimes[lowprimes.length-1];\n\n // (public) test primality with certainty >= 1-.5^t\n function bnIsProbablePrime(t) {\n var i, x = this.abs();\n if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) {\n for(i = 0; i < lowprimes.length; ++i)\n if(x[0] == lowprimes[i]) return true;\n return false;\n }\n if(x.isEven()) return false;\n i = 1;\n while(i < lowprimes.length) {\n var m = lowprimes[i], j = i+1;\n while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];\n m = x.modInt(m);\n while(i < j) if(m%lowprimes[i++] == 0) return false;\n }\n return x.millerRabin(t);\n }\n\n // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\n function bnpMillerRabin(t) {\n var n1 = this.subtract(BigInteger.ONE);\n var k = n1.getLowestSetBit();\n if(k <= 0) return false;\n var r = n1.shiftRight(k);\n t = (t+1)>>1;\n if(t > lowprimes.length) t = lowprimes.length;\n var a = nbi();\n for(var i = 0; i < t; ++i) {\n //Pick bases at random, instead of starting at 2\n a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);\n var y = a.modPow(r,this);\n if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n var j = 1;\n while(j++ < k && y.compareTo(n1) != 0) {\n y = y.modPowInt(2,this);\n if(y.compareTo(BigInteger.ONE) == 0) return false;\n }\n if(y.compareTo(n1) != 0) return false;\n }\n }\n return true;\n }\n\n // protected\n BigInteger.prototype.chunkSize = bnpChunkSize;\n BigInteger.prototype.toRadix = bnpToRadix;\n BigInteger.prototype.fromRadix = bnpFromRadix;\n BigInteger.prototype.fromNumber = bnpFromNumber;\n BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\n BigInteger.prototype.changeBit = bnpChangeBit;\n BigInteger.prototype.addTo = bnpAddTo;\n BigInteger.prototype.dMultiply = bnpDMultiply;\n BigInteger.prototype.dAddOffset = bnpDAddOffset;\n BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\n BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\n BigInteger.prototype.modInt = bnpModInt;\n BigInteger.prototype.millerRabin = bnpMillerRabin;\n\n // public\n BigInteger.prototype.clone = bnClone;\n BigInteger.prototype.intValue = bnIntValue;\n BigInteger.prototype.byteValue = bnByteValue;\n BigInteger.prototype.shortValue = bnShortValue;\n BigInteger.prototype.signum = bnSigNum;\n BigInteger.prototype.toByteArray = bnToByteArray;\n BigInteger.prototype.equals = bnEquals;\n BigInteger.prototype.min = bnMin;\n BigInteger.prototype.max = bnMax;\n BigInteger.prototype.and = bnAnd;\n BigInteger.prototype.or = bnOr;\n BigInteger.prototype.xor = bnXor;\n BigInteger.prototype.andNot = bnAndNot;\n BigInteger.prototype.not = bnNot;\n BigInteger.prototype.shiftLeft = bnShiftLeft;\n BigInteger.prototype.shiftRight = bnShiftRight;\n BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\n BigInteger.prototype.bitCount = bnBitCount;\n BigInteger.prototype.testBit = bnTestBit;\n BigInteger.prototype.setBit = bnSetBit;\n BigInteger.prototype.clearBit = bnClearBit;\n BigInteger.prototype.flipBit = bnFlipBit;\n BigInteger.prototype.add = bnAdd;\n BigInteger.prototype.subtract = bnSubtract;\n BigInteger.prototype.multiply = bnMultiply;\n BigInteger.prototype.divide = bnDivide;\n BigInteger.prototype.remainder = bnRemainder;\n BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\n BigInteger.prototype.modPow = bnModPow;\n BigInteger.prototype.modInverse = bnModInverse;\n BigInteger.prototype.pow = bnPow;\n BigInteger.prototype.gcd = bnGCD;\n BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n\n // JSBN-specific extension\n BigInteger.prototype.square = bnSquare;\n\n // Expose the Barrett function\n BigInteger.prototype.Barrett = Barrett\n\n // BigInteger interfaces not implemented in jsbn:\n\n // BigInteger(int signum, byte[] magnitude)\n // double doubleValue()\n // float floatValue()\n // int hashCode()\n // long longValue()\n // static BigInteger valueOf(long val)\n\n\t// Random number generator - requires a PRNG backend, e.g. prng4.js\n\n\t// For best results, put code like\n\t// \n\t// in your main HTML document.\n\n\tvar rng_state;\n\tvar rng_pool;\n\tvar rng_pptr;\n\n\t// Mix in a 32-bit integer into the pool\n\tfunction rng_seed_int(x) {\n\t rng_pool[rng_pptr++] ^= x & 255;\n\t rng_pool[rng_pptr++] ^= (x >> 8) & 255;\n\t rng_pool[rng_pptr++] ^= (x >> 16) & 255;\n\t rng_pool[rng_pptr++] ^= (x >> 24) & 255;\n\t if(rng_pptr >= rng_psize) rng_pptr -= rng_psize;\n\t}\n\n\t// Mix in the current time (w/milliseconds) into the pool\n\tfunction rng_seed_time() {\n\t rng_seed_int(new Date().getTime());\n\t}\n\n\t// Initialize the pool with junk if needed.\n\tif(rng_pool == null) {\n\t rng_pool = new Array();\n\t rng_pptr = 0;\n\t var t;\n\t if(typeof window !== \"undefined\" && window.crypto) {\n\t\tif (window.crypto.getRandomValues) {\n\t\t // Use webcrypto if available\n\t\t var ua = new Uint8Array(32);\n\t\t window.crypto.getRandomValues(ua);\n\t\t for(t = 0; t < 32; ++t)\n\t\t\trng_pool[rng_pptr++] = ua[t];\n\t\t}\n\t\telse if(navigator.appName == \"Netscape\" && navigator.appVersion < \"5\") {\n\t\t // Extract entropy (256 bits) from NS4 RNG if available\n\t\t var z = window.crypto.random(32);\n\t\t for(t = 0; t < z.length; ++t)\n\t\t\trng_pool[rng_pptr++] = z.charCodeAt(t) & 255;\n\t\t}\n\t }\n\t while(rng_pptr < rng_psize) { // extract some randomness from Math.random()\n\t\tt = Math.floor(65536 * Math.random());\n\t\trng_pool[rng_pptr++] = t >>> 8;\n\t\trng_pool[rng_pptr++] = t & 255;\n\t }\n\t rng_pptr = 0;\n\t rng_seed_time();\n\t //rng_seed_int(window.screenX);\n\t //rng_seed_int(window.screenY);\n\t}\n\n\tfunction rng_get_byte() {\n\t if(rng_state == null) {\n\t\trng_seed_time();\n\t\trng_state = prng_newstate();\n\t\trng_state.init(rng_pool);\n\t\tfor(rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)\n\t\t rng_pool[rng_pptr] = 0;\n\t\trng_pptr = 0;\n\t\t//rng_pool = null;\n\t }\n\t // TODO: allow reseeding after first request\n\t return rng_state.next();\n\t}\n\n\tfunction rng_get_bytes(ba) {\n\t var i;\n\t for(i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();\n\t}\n\n\tfunction SecureRandom() {}\n\n\tSecureRandom.prototype.nextBytes = rng_get_bytes;\n\n\t// prng4.js - uses Arcfour as a PRNG\n\n\tfunction Arcfour() {\n\t this.i = 0;\n\t this.j = 0;\n\t this.S = new Array();\n\t}\n\n\t// Initialize arcfour context from key, an array of ints, each from [0..255]\n\tfunction ARC4init(key) {\n\t var i, j, t;\n\t for(i = 0; i < 256; ++i)\n\t\tthis.S[i] = i;\n\t j = 0;\n\t for(i = 0; i < 256; ++i) {\n\t\tj = (j + this.S[i] + key[i % key.length]) & 255;\n\t\tt = this.S[i];\n\t\tthis.S[i] = this.S[j];\n\t\tthis.S[j] = t;\n\t }\n\t this.i = 0;\n\t this.j = 0;\n\t}\n\n\tfunction ARC4next() {\n\t var t;\n\t this.i = (this.i + 1) & 255;\n\t this.j = (this.j + this.S[this.i]) & 255;\n\t t = this.S[this.i];\n\t this.S[this.i] = this.S[this.j];\n\t this.S[this.j] = t;\n\t return this.S[(t + this.S[this.i]) & 255];\n\t}\n\n\tArcfour.prototype.init = ARC4init;\n\tArcfour.prototype.next = ARC4next;\n\n\t// Plug in your RNG constructor here\n\tfunction prng_newstate() {\n\t return new Arcfour();\n\t}\n\n\t// Pool size must be a multiple of 4 and greater than 32.\n\t// An array of bytes the size of the pool will be passed to init()\n\tvar rng_psize = 256;\n\n BigInteger.SecureRandom = SecureRandom;\n BigInteger.BigInteger = BigInteger;\n if (typeof exports !== 'undefined') {\n exports = module.exports = BigInteger;\n } else {\n this.BigInteger = BigInteger;\n this.SecureRandom = SecureRandom;\n }\n\n}).call(this);\n"]}]}