module-develop-kit 1.4.2 → 1.5.0

package/dist/vendor/jsbn/index.js

@@ -0,0 +1,714 @@
+import { __module as C } from "../../commonjs-virtual-dir/index6.js";
+var $i = C.exports, Y;
+function Qi() {
+  return Y ? C.exports : (Y = 1, function(x, Hi) {
+    (function() {
+      var D, tt = 244837814094590, j = (tt & 16777215) == 15715070;
+      function s(t, i, e) {
+        t != null && (typeof t == "number" ? this.fromNumber(t, i, e) : i == null && typeof t != "string" ? this.fromString(t, 256) : this.fromString(t, i));
+      }
+      function u() {
+        return new s(null);
+      }
+      function it(t, i, e, r, o, n) {
+        for (; --n >= 0; ) {
+          var h = i * this[t++] + e[r] + o;
+          o = Math.floor(h / 67108864), e[r++] = h & 67108863;
+        }
+        return o;
+      }
+      function et(t, i, e, r, o, n) {
+        for (var h = i & 32767, f = i >> 15; --n >= 0; ) {
+          var p = this[t] & 32767, l = this[t++] >> 15, y = f * p + l * h;
+          p = h * p + ((y & 32767) << 15) + e[r] + (o & 1073741823), o = (p >>> 30) + (y >>> 15) + f * l + (o >>> 30), e[r++] = p & 1073741823;
+        }
+        return o;
+      }
+      function rt(t, i, e, r, o, n) {
+        for (var h = i & 16383, f = i >> 14; --n >= 0; ) {
+          var p = this[t] & 16383, l = this[t++] >> 14, y = f * p + l * h;
+          p = h * p + ((y & 16383) << 14) + e[r] + o, o = (p >> 28) + (y >> 14) + f * l, e[r++] = p & 268435455;
+        }
+        return o;
+      }
+      var z = typeof navigator < "u";
+      z && j && navigator.appName == "Microsoft Internet Explorer" ? (s.prototype.am = et, D = 30) : z && j && navigator.appName != "Netscape" ? (s.prototype.am = it, D = 26) : (s.prototype.am = rt, D = 28), s.prototype.DB = D, s.prototype.DM = (1 << D) - 1, s.prototype.DV = 1 << D;
+      var L = 52;
+      s.prototype.FV = Math.pow(2, L), s.prototype.F1 = L - D, s.prototype.F2 = 2 * D - L;
+      var ot = "0123456789abcdefghijklmnopqrstuvwxyz", N = new Array(), A, T;
+      for (A = 48, T = 0; T <= 9; ++T) N[A++] = T;
+      for (A = 97, T = 10; T < 36; ++T) N[A++] = T;
+      for (A = 65, T = 10; T < 36; ++T) N[A++] = T;
+      function U(t) {
+        return ot.charAt(t);
+      }
+      function G(t, i) {
+        var e = N[t.charCodeAt(i)];
+        return e ?? -1;
+      }
+      function st(t) {
+        for (var i = this.t - 1; i >= 0; --i) t[i] = this[i];
+        t.t = this.t, t.s = this.s;
+      }
+      function nt(t) {
+        this.t = 1, this.s = t < 0 ? -1 : 0, t > 0 ? this[0] = t : t < -1 ? this[0] = t + this.DV : this.t = 0;
+      }
+      function S(t) {
+        var i = u();
+        return i.fromInt(t), i;
+      }
+      function ht(t, i) {
+        var e;
+        if (i == 16) e = 4;
+        else if (i == 8) e = 3;
+        else if (i == 256) e = 8;
+        else if (i == 2) e = 1;
+        else if (i == 32) e = 5;
+        else if (i == 4) e = 2;
+        else {
+          this.fromRadix(t, i);
+          return;
+        }
+        this.t = 0, this.s = 0;
+        for (var r = t.length, o = !1, n = 0; --r >= 0; ) {
+          var h = e == 8 ? t[r] & 255 : G(t, r);
+          if (h < 0) {
+            t.charAt(r) == "-" && (o = !0);
+            continue;
+          }
+          o = !1, n == 0 ? this[this.t++] = h : n + e > this.DB ? (this[this.t - 1] |= (h & (1 << this.DB - n) - 1) << n, this[this.t++] = h >> this.DB - n) : this[this.t - 1] |= h << n, n += e, n >= this.DB && (n -= this.DB);
+        }
+        e == 8 && (t[0] & 128) != 0 && (this.s = -1, n > 0 && (this[this.t - 1] |= (1 << this.DB - n) - 1 << n)), this.clamp(), o && s.ZERO.subTo(this, this);
+      }
+      function ft() {
+        for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; ) --this.t;
+      }
+      function ut(t) {
+        if (this.s < 0) return "-" + this.negate().toString(t);
+        var i;
+        if (t == 16) i = 4;
+        else if (t == 8) i = 3;
+        else if (t == 2) i = 1;
+        else if (t == 32) i = 5;
+        else if (t == 4) i = 2;
+        else return this.toRadix(t);
+        var e = (1 << i) - 1, r, o = !1, n = "", h = this.t, f = this.DB - h * this.DB % i;
+        if (h-- > 0)
+          for (f < this.DB && (r = this[h] >> f) > 0 && (o = !0, n = U(r)); h >= 0; )
+            f < i ? (r = (this[h] & (1 << f) - 1) << i - f, r |= this[--h] >> (f += this.DB - i)) : (r = this[h] >> (f -= i) & e, f <= 0 && (f += this.DB, --h)), r > 0 && (o = !0), o && (n += U(r));
+        return o ? n : "0";
+      }
+      function pt() {
+        var t = u();
+        return s.ZERO.subTo(this, t), t;
+      }
+      function at() {
+        return this.s < 0 ? this.negate() : this;
+      }
+      function lt(t) {
+        var i = this.s - t.s;
+        if (i != 0) return i;
+        var e = this.t;
+        if (i = e - t.t, i != 0) return this.s < 0 ? -i : i;
+        for (; --e >= 0; ) if ((i = this[e] - t[e]) != 0) return i;
+        return 0;
+      }
+      function V(t) {
+        var i = 1, e;
+        return (e = t >>> 16) != 0 && (t = e, i += 16), (e = t >> 8) != 0 && (t = e, i += 8), (e = t >> 4) != 0 && (t = e, i += 4), (e = t >> 2) != 0 && (t = e, i += 2), (e = t >> 1) != 0 && (t = e, i += 1), i;
+      }
+      function ct() {
+        return this.t <= 0 ? 0 : this.DB * (this.t - 1) + V(this[this.t - 1] ^ this.s & this.DM);
+      }
+      function vt(t, i) {
+        var e;
+        for (e = this.t - 1; e >= 0; --e) i[e + t] = this[e];
+        for (e = t - 1; e >= 0; --e) i[e] = 0;
+        i.t = this.t + t, i.s = this.s;
+      }
+      function mt(t, i) {
+        for (var e = t; e < this.t; ++e) i[e - t] = this[e];
+        i.t = Math.max(this.t - t, 0), i.s = this.s;
+      }
+      function Tt(t, i) {
+        var e = t % this.DB, r = this.DB - e, o = (1 << r) - 1, n = Math.floor(t / this.DB), h = this.s << e & this.DM, f;
+        for (f = this.t - 1; f >= 0; --f)
+          i[f + n + 1] = this[f] >> r | h, h = (this[f] & o) << e;
+        for (f = n - 1; f >= 0; --f) i[f] = 0;
+        i[n] = h, i.t = this.t + n + 1, i.s = this.s, i.clamp();
+      }
+      function yt(t, i) {
+        i.s = this.s;
+        var e = Math.floor(t / this.DB);
+        if (e >= this.t) {
+          i.t = 0;
+          return;
+        }
+        var r = t % this.DB, o = this.DB - r, n = (1 << r) - 1;
+        i[0] = this[e] >> r;
+        for (var h = e + 1; h < this.t; ++h)
+          i[h - e - 1] |= (this[h] & n) << o, i[h - e] = this[h] >> r;
+        r > 0 && (i[this.t - e - 1] |= (this.s & n) << o), i.t = this.t - e, i.clamp();
+      }
+      function dt(t, i) {
+        for (var e = 0, r = 0, o = Math.min(t.t, this.t); e < o; )
+          r += this[e] - t[e], i[e++] = r & this.DM, r >>= this.DB;
+        if (t.t < this.t) {
+          for (r -= t.s; e < this.t; )
+            r += this[e], i[e++] = r & this.DM, r >>= this.DB;
+          r += this.s;
+        } else {
+          for (r += this.s; e < t.t; )
+            r -= t[e], i[e++] = r & this.DM, r >>= this.DB;
+          r -= t.s;
+        }
+        i.s = r < 0 ? -1 : 0, r < -1 ? i[e++] = this.DV + r : r > 0 && (i[e++] = r), i.t = e, i.clamp();
+      }
+      function bt(t, i) {
+        var e = this.abs(), r = t.abs(), o = e.t;
+        for (i.t = o + r.t; --o >= 0; ) i[o] = 0;
+        for (o = 0; o < r.t; ++o) i[o + e.t] = e.am(0, r[o], i, o, 0, e.t);
+        i.s = 0, i.clamp(), this.s != t.s && s.ZERO.subTo(i, i);
+      }
+      function wt(t) {
+        for (var i = this.abs(), e = t.t = 2 * i.t; --e >= 0; ) t[e] = 0;
+        for (e = 0; e < i.t - 1; ++e) {
+          var r = i.am(e, i[e], t, 2 * e, 0, 1);
+          (t[e + i.t] += i.am(e + 1, 2 * i[e], t, 2 * e + 1, r, i.t - e - 1)) >= i.DV && (t[e + i.t] -= i.DV, t[e + i.t + 1] = 1);
+        }
+        t.t > 0 && (t[t.t - 1] += i.am(e, i[e], t, 2 * e, 0, 1)), t.s = 0, t.clamp();
+      }
+      function gt(t, i, e) {
+        var r = t.abs();
+        if (!(r.t <= 0)) {
+          var o = this.abs();
+          if (o.t < r.t) {
+            i?.fromInt(0), e != null && this.copyTo(e);
+            return;
+          }
+          e == null && (e = u());
+          var n = u(), h = this.s, f = t.s, p = this.DB - V(r[r.t - 1]);
+          p > 0 ? (r.lShiftTo(p, n), o.lShiftTo(p, e)) : (r.copyTo(n), o.copyTo(e));
+          var l = n.t, y = n[l - 1];
+          if (y != 0) {
+            var m = y * (1 << this.F1) + (l > 1 ? n[l - 2] >> this.F2 : 0), g = this.FV / m, _ = (1 << this.F1) / m, b = 1 << this.F2, w = e.t, q = w - l, B = i ?? u();
+            for (n.dlShiftTo(q, B), e.compareTo(B) >= 0 && (e[e.t++] = 1, e.subTo(B, e)), s.ONE.dlShiftTo(l, B), B.subTo(n, n); n.t < l; ) n[n.t++] = 0;
+            for (; --q >= 0; ) {
+              var Z = e[--w] == y ? this.DM : Math.floor(e[w] * g + (e[w - 1] + b) * _);
+              if ((e[w] += n.am(0, Z, e, q, 0, l)) < Z)
+                for (n.dlShiftTo(q, B), e.subTo(B, e); e[w] < --Z; ) e.subTo(B, e);
+            }
+            i != null && (e.drShiftTo(l, i), h != f && s.ZERO.subTo(i, i)), e.t = l, e.clamp(), p > 0 && e.rShiftTo(p, e), h < 0 && s.ZERO.subTo(e, e);
+          }
+        }
+      }
+      function Dt(t) {
+        var i = u();
+        return this.abs().divRemTo(t, null, i), this.s < 0 && i.compareTo(s.ZERO) > 0 && t.subTo(i, i), i;
+      }
+      function M(t) {
+        this.m = t;
+      }
+      function St(t) {
+        return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t;
+      }
+      function Bt(t) {
+        return t;
+      }
+      function Mt(t) {
+        t.divRemTo(this.m, null, t);
+      }
+      function Rt(t, i, e) {
+        t.multiplyTo(i, e), this.reduce(e);
+      }
+      function Et(t, i) {
+        t.squareTo(i), this.reduce(i);
+      }
+      M.prototype.convert = St, M.prototype.revert = Bt, M.prototype.reduce = Mt, M.prototype.mulTo = Rt, M.prototype.sqrTo = Et;
+      function At() {
+        if (this.t < 1) return 0;
+        var t = this[0];
+        if ((t & 1) == 0) return 0;
+        var i = t & 3;
+        return i = i * (2 - (t & 15) * i) & 15, i = i * (2 - (t & 255) * i) & 255, i = i * (2 - ((t & 65535) * i & 65535)) & 65535, i = i * (2 - t * i % this.DV) % this.DV, i > 0 ? this.DV - i : -i;
+      }
+      function R(t) {
+        this.m = t, this.mp = t.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << t.DB - 15) - 1, this.mt2 = 2 * t.t;
+      }
+      function Ot(t) {
+        var i = u();
+        return t.abs().dlShiftTo(this.m.t, i), i.divRemTo(this.m, null, i), t.s < 0 && i.compareTo(s.ZERO) > 0 && this.m.subTo(i, i), i;
+      }
+      function Nt(t) {
+        var i = u();
+        return t.copyTo(i), this.reduce(i), i;
+      }
+      function Vt(t) {
+        for (; t.t <= this.mt2; )
+          t[t.t++] = 0;
+        for (var i = 0; i < this.m.t; ++i) {
+          var e = t[i] & 32767, r = e * this.mpl + ((e * this.mph + (t[i] >> 15) * this.mpl & this.um) << 15) & t.DM;
+          for (e = i + this.m.t, t[e] += this.m.am(0, r, t, i, 0, this.m.t); t[e] >= t.DV; )
+            t[e] -= t.DV, t[++e]++;
+        }
+        t.clamp(), t.drShiftTo(this.m.t, t), t.compareTo(this.m) >= 0 && t.subTo(this.m, t);
+      }
+      function It(t, i) {
+        t.squareTo(i), this.reduce(i);
+      }
+      function _t(t, i, e) {
+        t.multiplyTo(i, e), this.reduce(e);
+      }
+      R.prototype.convert = Ot, R.prototype.revert = Nt, R.prototype.reduce = Vt, R.prototype.mulTo = _t, R.prototype.sqrTo = It;
+      function qt() {
+        return (this.t > 0 ? this[0] & 1 : this.s) == 0;
+      }
+      function Ct(t, i) {
+        if (t > 4294967295 || t < 1) return s.ONE;
+        var e = u(), r = u(), o = i.convert(this), n = V(t) - 1;
+        for (o.copyTo(e); --n >= 0; )
+          if (i.sqrTo(e, r), (t & 1 << n) > 0) i.mulTo(r, o, e);
+          else {
+            var h = e;
+            e = r, r = h;
+          }
+        return i.revert(e);
+      }
+      function Lt(t, i) {
+        var e;
+        return t < 256 || i.isEven() ? e = new M(i) : e = new R(i), this.exp(t, e);
+      }
+      s.prototype.copyTo = st, s.prototype.fromInt = nt, s.prototype.fromString = ht, s.prototype.clamp = ft, s.prototype.dlShiftTo = vt, s.prototype.drShiftTo = mt, s.prototype.lShiftTo = Tt, s.prototype.rShiftTo = yt, s.prototype.subTo = dt, s.prototype.multiplyTo = bt, s.prototype.squareTo = wt, s.prototype.divRemTo = gt, s.prototype.invDigit = At, s.prototype.isEven = qt, s.prototype.exp = Ct, s.prototype.toString = ut, s.prototype.negate = pt, s.prototype.abs = at, s.prototype.compareTo = lt, s.prototype.bitLength = ct, s.prototype.mod = Dt, s.prototype.modPowInt = Lt, s.ZERO = S(0), s.ONE = S(1);
+      function Ft() {
+        var t = u();
+        return this.copyTo(t), t;
+      }
+      function Pt() {
+        if (this.s < 0) {
+          if (this.t == 1) return this[0] - this.DV;
+          if (this.t == 0) return -1;
+        } else {
+          if (this.t == 1) return this[0];
+          if (this.t == 0) return 0;
+        }
+        return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
+      }
+      function kt() {
+        return this.t == 0 ? this.s : this[0] << 24 >> 24;
+      }
+      function Zt() {
+        return this.t == 0 ? this.s : this[0] << 16 >> 16;
+      }
+      function jt(t) {
+        return Math.floor(Math.LN2 * this.DB / Math.log(t));
+      }
+      function zt() {
+        return this.s < 0 ? -1 : this.t <= 0 || this.t == 1 && this[0] <= 0 ? 0 : 1;
+      }
+      function Ut(t) {
+        if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
+        var i = this.chunkSize(t), e = Math.pow(t, i), r = S(e), o = u(), n = u(), h = "";
+        for (this.divRemTo(r, o, n); o.signum() > 0; )
+          h = (e + n.intValue()).toString(t).substr(1) + h, o.divRemTo(r, o, n);
+        return n.intValue().toString(t) + h;
+      }
+      function Gt(t, i) {
+        this.fromInt(0), i == null && (i = 10);
+        for (var e = this.chunkSize(i), r = Math.pow(i, e), o = !1, n = 0, h = 0, f = 0; f < t.length; ++f) {
+          var p = G(t, f);
+          if (p < 0) {
+            t.charAt(f) == "-" && this.signum() == 0 && (o = !0);
+            continue;
+          }
+          h = i * h + p, ++n >= e && (this.dMultiply(r), this.dAddOffset(h, 0), n = 0, h = 0);
+        }
+        n > 0 && (this.dMultiply(Math.pow(i, n)), this.dAddOffset(h, 0)), o && s.ZERO.subTo(this, this);
+      }
+      function Jt(t, i, e) {
+        if (typeof i == "number")
+          if (t < 2) this.fromInt(1);
+          else
+            for (this.fromNumber(t, e), this.testBit(t - 1) || this.bitwiseTo(s.ONE.shiftLeft(t - 1), F, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(i); )
+              this.dAddOffset(2, 0), this.bitLength() > t && this.subTo(s.ONE.shiftLeft(t - 1), this);
+        else {
+          var r = new Array(), o = t & 7;
+          r.length = (t >> 3) + 1, i.nextBytes(r), o > 0 ? r[0] &= (1 << o) - 1 : r[0] = 0, this.fromString(r, 256);
+        }
+      }
+      function Xt() {
+        var t = this.t, i = new Array();
+        i[0] = this.s;
+        var e = this.DB - t * this.DB % 8, r, o = 0;
+        if (t-- > 0)
+          for (e < this.DB && (r = this[t] >> e) != (this.s & this.DM) >> e && (i[o++] = r | this.s << this.DB - e); t >= 0; )
+            e < 8 ? (r = (this[t] & (1 << e) - 1) << 8 - e, r |= this[--t] >> (e += this.DB - 8)) : (r = this[t] >> (e -= 8) & 255, e <= 0 && (e += this.DB, --t)), (r & 128) != 0 && (r |= -256), o == 0 && (this.s & 128) != (r & 128) && ++o, (o > 0 || r != this.s) && (i[o++] = r);
+        return i;
+      }
+      function $t(t) {
+        return this.compareTo(t) == 0;
+      }
+      function Ht(t) {
+        return this.compareTo(t) < 0 ? this : t;
+      }
+      function Kt(t) {
+        return this.compareTo(t) > 0 ? this : t;
+      }
+      function Qt(t, i, e) {
+        var r, o, n = Math.min(t.t, this.t);
+        for (r = 0; r < n; ++r) e[r] = i(this[r], t[r]);
+        if (t.t < this.t) {
+          for (o = t.s & this.DM, r = n; r < this.t; ++r) e[r] = i(this[r], o);
+          e.t = this.t;
+        } else {
+          for (o = this.s & this.DM, r = n; r < t.t; ++r) e[r] = i(o, t[r]);
+          e.t = t.t;
+        }
+        e.s = i(this.s, t.s), e.clamp();
+      }
+      function Wt(t, i) {
+        return t & i;
+      }
+      function Yt(t) {
+        var i = u();
+        return this.bitwiseTo(t, Wt, i), i;
+      }
+      function F(t, i) {
+        return t | i;
+      }
+      function xt(t) {
+        var i = u();
+        return this.bitwiseTo(t, F, i), i;
+      }
+      function J(t, i) {
+        return t ^ i;
+      }
+      function ti(t) {
+        var i = u();
+        return this.bitwiseTo(t, J, i), i;
+      }
+      function X(t, i) {
+        return t & ~i;
+      }
+      function ii(t) {
+        var i = u();
+        return this.bitwiseTo(t, X, i), i;
+      }
+      function ei() {
+        for (var t = u(), i = 0; i < this.t; ++i) t[i] = this.DM & ~this[i];
+        return t.t = this.t, t.s = ~this.s, t;
+      }
+      function ri(t) {
+        var i = u();
+        return t < 0 ? this.rShiftTo(-t, i) : this.lShiftTo(t, i), i;
+      }
+      function oi(t) {
+        var i = u();
+        return t < 0 ? this.lShiftTo(-t, i) : this.rShiftTo(t, i), i;
+      }
+      function si(t) {
+        if (t == 0) return -1;
+        var i = 0;
+        return (t & 65535) == 0 && (t >>= 16, i += 16), (t & 255) == 0 && (t >>= 8, i += 8), (t & 15) == 0 && (t >>= 4, i += 4), (t & 3) == 0 && (t >>= 2, i += 2), (t & 1) == 0 && ++i, i;
+      }
+      function ni() {
+        for (var t = 0; t < this.t; ++t)
+          if (this[t] != 0) return t * this.DB + si(this[t]);
+        return this.s < 0 ? this.t * this.DB : -1;
+      }
+      function hi(t) {
+        for (var i = 0; t != 0; )
+          t &= t - 1, ++i;
+        return i;
+      }
+      function fi() {
+        for (var t = 0, i = this.s & this.DM, e = 0; e < this.t; ++e) t += hi(this[e] ^ i);
+        return t;
+      }
+      function ui(t) {
+        var i = Math.floor(t / this.DB);
+        return i >= this.t ? this.s != 0 : (this[i] & 1 << t % this.DB) != 0;
+      }
+      function pi(t, i) {
+        var e = s.ONE.shiftLeft(t);
+        return this.bitwiseTo(e, i, e), e;
+      }
+      function ai(t) {
+        return this.changeBit(t, F);
+      }
+      function li(t) {
+        return this.changeBit(t, X);
+      }
+      function ci(t) {
+        return this.changeBit(t, J);
+      }
+      function vi(t, i) {
+        for (var e = 0, r = 0, o = Math.min(t.t, this.t); e < o; )
+          r += this[e] + t[e], i[e++] = r & this.DM, r >>= this.DB;
+        if (t.t < this.t) {
+          for (r += t.s; e < this.t; )
+            r += this[e], i[e++] = r & this.DM, r >>= this.DB;
+          r += this.s;
+        } else {
+          for (r += this.s; e < t.t; )
+            r += t[e], i[e++] = r & this.DM, r >>= this.DB;
+          r += t.s;
+        }
+        i.s = r < 0 ? -1 : 0, r > 0 ? i[e++] = r : r < -1 && (i[e++] = this.DV + r), i.t = e, i.clamp();
+      }
+      function mi(t) {
+        var i = u();
+        return this.addTo(t, i), i;
+      }
+      function Ti(t) {
+        var i = u();
+        return this.subTo(t, i), i;
+      }
+      function yi(t) {
+        var i = u();
+        return this.multiplyTo(t, i), i;
+      }
+      function di() {
+        var t = u();
+        return this.squareTo(t), t;
+      }
+      function bi(t) {
+        var i = u();
+        return this.divRemTo(t, i, null), i;
+      }
+      function wi(t) {
+        var i = u();
+        return this.divRemTo(t, null, i), i;
+      }
+      function gi(t) {
+        var i = u(), e = u();
+        return this.divRemTo(t, i, e), new Array(i, e);
+      }
+      function Di(t) {
+        this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
+      }
+      function Si(t, i) {
+        if (t != 0) {
+          for (; this.t <= i; ) this[this.t++] = 0;
+          for (this[i] += t; this[i] >= this.DV; )
+            this[i] -= this.DV, ++i >= this.t && (this[this.t++] = 0), ++this[i];
+        }
+      }
+      function O() {
+      }
+      function $(t) {
+        return t;
+      }
+      function Bi(t, i, e) {
+        t.multiplyTo(i, e);
+      }
+      function Mi(t, i) {
+        t.squareTo(i);
+      }
+      O.prototype.convert = $, O.prototype.revert = $, O.prototype.mulTo = Bi, O.prototype.sqrTo = Mi;
+      function Ri(t) {
+        return this.exp(t, new O());
+      }
+      function Ei(t, i, e) {
+        var r = Math.min(this.t + t.t, i);
+        for (e.s = 0, e.t = r; r > 0; ) e[--r] = 0;
+        var o;
+        for (o = e.t - this.t; r < o; ++r) e[r + this.t] = this.am(0, t[r], e, r, 0, this.t);
+        for (o = Math.min(t.t, i); r < o; ++r) this.am(0, t[r], e, r, 0, i - r);
+        e.clamp();
+      }
+      function Ai(t, i, e) {
+        --i;
+        var r = e.t = this.t + t.t - i;
+        for (e.s = 0; --r >= 0; ) e[r] = 0;
+        for (r = Math.max(i - this.t, 0); r < t.t; ++r)
+          e[this.t + r - i] = this.am(i - r, t[r], e, 0, 0, this.t + r - i);
+        e.clamp(), e.drShiftTo(1, e);
+      }
+      function E(t) {
+        this.r2 = u(), this.q3 = u(), s.ONE.dlShiftTo(2 * t.t, this.r2), this.mu = this.r2.divide(t), this.m = t;
+      }
+      function Oi(t) {
+        if (t.s < 0 || t.t > 2 * this.m.t) return t.mod(this.m);
+        if (t.compareTo(this.m) < 0) return t;
+        var i = u();
+        return t.copyTo(i), this.reduce(i), i;
+      }
+      function Ni(t) {
+        return t;
+      }
+      function Vi(t) {
+        for (t.drShiftTo(this.m.t - 1, this.r2), t.t > this.m.t + 1 && (t.t = this.m.t + 1, t.clamp()), this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3), this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); t.compareTo(this.r2) < 0; ) t.dAddOffset(1, this.m.t + 1);
+        for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; ) t.subTo(this.m, t);
+      }
+      function Ii(t, i) {
+        t.squareTo(i), this.reduce(i);
+      }
+      function _i(t, i, e) {
+        t.multiplyTo(i, e), this.reduce(e);
+      }
+      E.prototype.convert = Oi, E.prototype.revert = Ni, E.prototype.reduce = Vi, E.prototype.mulTo = _i, E.prototype.sqrTo = Ii;
+      function qi(t, i) {
+        var e = t.bitLength(), r, o = S(1), n;
+        if (e <= 0) return o;
+        e < 18 ? r = 1 : e < 48 ? r = 3 : e < 144 ? r = 4 : e < 768 ? r = 5 : r = 6, e < 8 ? n = new M(i) : i.isEven() ? n = new E(i) : n = new R(i);
+        var h = new Array(), f = 3, p = r - 1, l = (1 << r) - 1;
+        if (h[1] = n.convert(this), r > 1) {
+          var y = u();
+          for (n.sqrTo(h[1], y); f <= l; )
+            h[f] = u(), n.mulTo(y, h[f - 2], h[f]), f += 2;
+        }
+        var m = t.t - 1, g, _ = !0, b = u(), w;
+        for (e = V(t[m]) - 1; m >= 0; ) {
+          for (e >= p ? g = t[m] >> e - p & l : (g = (t[m] & (1 << e + 1) - 1) << p - e, m > 0 && (g |= t[m - 1] >> this.DB + e - p)), f = r; (g & 1) == 0; )
+            g >>= 1, --f;
+          if ((e -= f) < 0 && (e += this.DB, --m), _)
+            h[g].copyTo(o), _ = !1;
+          else {
+            for (; f > 1; )
+              n.sqrTo(o, b), n.sqrTo(b, o), f -= 2;
+            f > 0 ? n.sqrTo(o, b) : (w = o, o = b, b = w), n.mulTo(b, h[g], o);
+          }
+          for (; m >= 0 && (t[m] & 1 << e) == 0; )
+            n.sqrTo(o, b), w = o, o = b, b = w, --e < 0 && (e = this.DB - 1, --m);
+        }
+        return n.revert(o);
+      }
+      function Ci(t) {
+        var i = this.s < 0 ? this.negate() : this.clone(), e = t.s < 0 ? t.negate() : t.clone();
+        if (i.compareTo(e) < 0) {
+          var r = i;
+          i = e, e = r;
+        }
+        var o = i.getLowestSetBit(), n = e.getLowestSetBit();
+        if (n < 0) return i;
+        for (o < n && (n = o), n > 0 && (i.rShiftTo(n, i), e.rShiftTo(n, e)); i.signum() > 0; )
+          (o = i.getLowestSetBit()) > 0 && i.rShiftTo(o, i), (o = e.getLowestSetBit()) > 0 && e.rShiftTo(o, e), i.compareTo(e) >= 0 ? (i.subTo(e, i), i.rShiftTo(1, i)) : (e.subTo(i, e), e.rShiftTo(1, e));
+        return n > 0 && e.lShiftTo(n, e), e;
+      }
+      function Li(t) {
+        if (t <= 0) return 0;
+        var i = this.DV % t, e = this.s < 0 ? t - 1 : 0;
+        if (this.t > 0)
+          if (i == 0) e = this[0] % t;
+          else for (var r = this.t - 1; r >= 0; --r) e = (i * e + this[r]) % t;
+        return e;
+      }
+      function Fi(t) {
+        var i = t.isEven();
+        if (this.isEven() && i || t.signum() == 0) return s.ZERO;
+        for (var e = t.clone(), r = this.clone(), o = S(1), n = S(0), h = S(0), f = S(1); e.signum() != 0; ) {
+          for (; e.isEven(); )
+            e.rShiftTo(1, e), i ? ((!o.isEven() || !n.isEven()) && (o.addTo(this, o), n.subTo(t, n)), o.rShiftTo(1, o)) : n.isEven() || n.subTo(t, n), n.rShiftTo(1, n);
+          for (; r.isEven(); )
+            r.rShiftTo(1, r), i ? ((!h.isEven() || !f.isEven()) && (h.addTo(this, h), f.subTo(t, f)), h.rShiftTo(1, h)) : f.isEven() || f.subTo(t, f), f.rShiftTo(1, f);
+          e.compareTo(r) >= 0 ? (e.subTo(r, e), i && o.subTo(h, o), n.subTo(f, n)) : (r.subTo(e, r), i && h.subTo(o, h), f.subTo(n, f));
+        }
+        if (r.compareTo(s.ONE) != 0) return s.ZERO;
+        if (f.compareTo(t) >= 0) return f.subtract(t);
+        if (f.signum() < 0) f.addTo(t, f);
+        else return f;
+        return f.signum() < 0 ? f.add(t) : f;
+      }
+      var c = [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], Pi = (1 << 26) / c[c.length - 1];
+      function ki(t) {
+        var i, e = this.abs();
+        if (e.t == 1 && e[0] <= c[c.length - 1]) {
+          for (i = 0; i < c.length; ++i)
+            if (e[0] == c[i]) return !0;
+          return !1;
+        }
+        if (e.isEven()) return !1;
+        for (i = 1; i < c.length; ) {
+          for (var r = c[i], o = i + 1; o < c.length && r < Pi; ) r *= c[o++];
+          for (r = e.modInt(r); i < o; ) if (r % c[i++] == 0) return !1;
+        }
+        return e.millerRabin(t);
+      }
+      function Zi(t) {
+        var i = this.subtract(s.ONE), e = i.getLowestSetBit();
+        if (e <= 0) return !1;
+        var r = i.shiftRight(e);
+        t = t + 1 >> 1, t > c.length && (t = c.length);
+        for (var o = u(), n = 0; n < t; ++n) {
+          o.fromInt(c[Math.floor(Math.random() * c.length)]);
+          var h = o.modPow(r, this);
+          if (h.compareTo(s.ONE) != 0 && h.compareTo(i) != 0) {
+            for (var f = 1; f++ < e && h.compareTo(i) != 0; )
+              if (h = h.modPowInt(2, this), h.compareTo(s.ONE) == 0) return !1;
+            if (h.compareTo(i) != 0) return !1;
+          }
+        }
+        return !0;
+      }
+      s.prototype.chunkSize = jt, s.prototype.toRadix = Ut, s.prototype.fromRadix = Gt, s.prototype.fromNumber = Jt, s.prototype.bitwiseTo = Qt, s.prototype.changeBit = pi, s.prototype.addTo = vi, s.prototype.dMultiply = Di, s.prototype.dAddOffset = Si, s.prototype.multiplyLowerTo = Ei, s.prototype.multiplyUpperTo = Ai, s.prototype.modInt = Li, s.prototype.millerRabin = Zi, s.prototype.clone = Ft, s.prototype.intValue = Pt, s.prototype.byteValue = kt, s.prototype.shortValue = Zt, s.prototype.signum = zt, s.prototype.toByteArray = Xt, s.prototype.equals = $t, s.prototype.min = Ht, s.prototype.max = Kt, s.prototype.and = Yt, s.prototype.or = xt, s.prototype.xor = ti, s.prototype.andNot = ii, s.prototype.not = ei, s.prototype.shiftLeft = ri, s.prototype.shiftRight = oi, s.prototype.getLowestSetBit = ni, s.prototype.bitCount = fi, s.prototype.testBit = ui, s.prototype.setBit = ai, s.prototype.clearBit = li, s.prototype.flipBit = ci, s.prototype.add = mi, s.prototype.subtract = Ti, s.prototype.multiply = yi, s.prototype.divide = bi, s.prototype.remainder = wi, s.prototype.divideAndRemainder = gi, s.prototype.modPow = qi, s.prototype.modInverse = Fi, s.prototype.pow = Ri, s.prototype.gcd = Ci, s.prototype.isProbablePrime = ki, s.prototype.square = di, s.prototype.Barrett = E;
+      var I, v, a;
+      function ji(t) {
+        v[a++] ^= t & 255, v[a++] ^= t >> 8 & 255, v[a++] ^= t >> 16 & 255, v[a++] ^= t >> 24 & 255, a >= k && (a -= k);
+      }
+      function H() {
+        ji((/* @__PURE__ */ new Date()).getTime());
+      }
+      if (v == null) {
+        v = new Array(), a = 0;
+        var d;
+        if (typeof window < "u" && window.crypto) {
+          if (window.crypto.getRandomValues) {
+            var K = new Uint8Array(32);
+            for (window.crypto.getRandomValues(K), d = 0; d < 32; ++d)
+              v[a++] = K[d];
+          } else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
+            var Q = window.crypto.random(32);
+            for (d = 0; d < Q.length; ++d)
+              v[a++] = Q.charCodeAt(d) & 255;
+          }
+        }
+        for (; a < k; )
+          d = Math.floor(65536 * Math.random()), v[a++] = d >>> 8, v[a++] = d & 255;
+        a = 0, H();
+      }
+      function zi() {
+        if (I == null) {
+          for (H(), I = Xi(), I.init(v), a = 0; a < v.length; ++a)
+            v[a] = 0;
+          a = 0;
+        }
+        return I.next();
+      }
+      function Ui(t) {
+        var i;
+        for (i = 0; i < t.length; ++i) t[i] = zi();
+      }
+      function W() {
+      }
+      W.prototype.nextBytes = Ui;
+      function P() {
+        this.i = 0, this.j = 0, this.S = new Array();
+      }
+      function Gi(t) {
+        var i, e, r;
+        for (i = 0; i < 256; ++i)
+          this.S[i] = i;
+        for (e = 0, i = 0; i < 256; ++i)
+          e = e + this.S[i] + t[i % t.length] & 255, r = this.S[i], this.S[i] = this.S[e], this.S[e] = r;
+        this.i = 0, this.j = 0;
+      }
+      function Ji() {
+        var t;
+        return this.i = this.i + 1 & 255, this.j = this.j + this.S[this.i] & 255, t = this.S[this.i], this.S[this.i] = this.S[this.j], this.S[this.j] = t, this.S[t + this.S[this.i] & 255];
+      }
+      P.prototype.init = Gi, P.prototype.next = Ji;
+      function Xi() {
+        return new P();
+      }
+      var k = 256;
+      x.exports = {
+        default: s,
+        BigInteger: s,
+        SecureRandom: W
+      };
+    }).call($i);
+  }(C), C.exports);
+}
+export {
+  Qi as __require
+};