@dazhicheng/ui 1.5.26 → 1.5.27

package/dist/pad-pkcs7-DGpLXRzj.js

@@ -0,0 +1,2984 @@
+var j = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function lt(e) {
+  return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
+}
+function ht(e) {
+  if (e.__esModule) return e;
+  var n = e.default;
+  if (typeof n == "function") {
+    var r = function t() {
+      return this instanceof t ? Reflect.construct(n, arguments, this.constructor) : n.apply(this, arguments);
+    };
+    r.prototype = n.prototype;
+  } else r = {};
+  return Object.defineProperty(r, "__esModule", { value: !0 }), Object.keys(e).forEach(function(t) {
+    var s = Object.getOwnPropertyDescriptor(e, t);
+    Object.defineProperty(r, t, s.get ? s : {
+      enumerable: !0,
+      get: function() {
+        return e[t];
+      }
+    });
+  }), r;
+}
+var Qe = { exports: {} };
+(function(e, n) {
+  (function(r, t) {
+    e.exports = t();
+  })(j, function() {
+    var r = 1e3, t = 6e4, s = 36e5, i = "millisecond", a = "second", u = "minute", f = "hour", o = "day", c = "week", h = "month", l = "quarter", m = "year", $ = "date", p = "Invalid Date", N = /^(\d{4})[-/]?(\d{1,2})?[-/]?(\d{0,2})[Tt\s]*(\d{1,2})?:?(\d{1,2})?:?(\d{1,2})?[.:]?(\d+)?$/, z = /\[([^\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g, g = { name: "en", weekdays: "Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"), months: "January_February_March_April_May_June_July_August_September_October_November_December".split("_"), ordinal: function(M) {
+      var x = ["th", "st", "nd", "rd"], y = M % 100;
+      return "[" + M + (x[(y - 20) % 10] || x[y] || x[0]) + "]";
+    } }, d = function(M, x, y) {
+      var T = String(M);
+      return !T || T.length >= x ? M : "" + Array(x + 1 - T.length).join(y) + M;
+    }, _ = { s: d, z: function(M) {
+      var x = -M.utcOffset(), y = Math.abs(x), T = Math.floor(y / 60), H = y % 60;
+      return (x <= 0 ? "+" : "-") + d(T, 2, "0") + ":" + d(H, 2, "0");
+    }, m: function M(x, y) {
+      if (x.date() < y.date()) return -M(y, x);
+      var T = 12 * (y.year() - x.year()) + (y.month() - x.month()), H = x.clone().add(T, h), I = y - H < 0, R = x.clone().add(T + (I ? -1 : 1), h);
+      return +(-(T + (y - H) / (I ? H - R : R - H)) || 0);
+    }, a: function(M) {
+      return M < 0 ? Math.ceil(M) || 0 : Math.floor(M);
+    }, p: function(M) {
+      return { M: h, y: m, w: c, d: o, D: $, h: f, m: u, s: a, ms: i, Q: l }[M] || String(M || "").toLowerCase().replace(/s$/, "");
+    }, u: function(M) {
+      return M === void 0;
+    } }, B = "en", O = {};
+    O[B] = g;
+    var P = "$isDayjsObject", U = function(M) {
+      return M instanceof A || !(!M || !M[P]);
+    }, q = function M(x, y, T) {
+      var H;
+      if (!x) return B;
+      if (typeof x == "string") {
+        var I = x.toLowerCase();
+        O[I] && (H = I), y && (O[I] = y, H = I);
+        var R = x.split("-");
+        if (!H && R.length > 1) return M(R[0]);
+      } else {
+        var C = x.name;
+        O[C] = x, H = C;
+      }
+      return !T && H && (B = H), H || !T && B;
+    }, v = function(M, x) {
+      if (U(M)) return M.clone();
+      var y = typeof x == "object" ? x : {};
+      return y.date = M, y.args = arguments, new A(y);
+    }, w = _;
+    w.l = q, w.i = U, w.w = function(M, x) {
+      return v(M, { locale: x.$L, utc: x.$u, x: x.$x, $offset: x.$offset });
+    };
+    var A = function() {
+      function M(y) {
+        this.$L = q(y.locale, null, !0), this.parse(y), this.$x = this.$x || y.x || {}, this[P] = !0;
+      }
+      var x = M.prototype;
+      return x.parse = function(y) {
+        this.$d = function(T) {
+          var H = T.date, I = T.utc;
+          if (H === null) return /* @__PURE__ */ new Date(NaN);
+          if (w.u(H)) return /* @__PURE__ */ new Date();
+          if (H instanceof Date) return new Date(H);
+          if (typeof H == "string" && !/Z$/i.test(H)) {
+            var R = H.match(N);
+            if (R) {
+              var C = R[2] - 1 || 0, S = (R[7] || "0").substring(0, 3);
+              return I ? new Date(Date.UTC(R[1], C, R[3] || 1, R[4] || 0, R[5] || 0, R[6] || 0, S)) : new Date(R[1], C, R[3] || 1, R[4] || 0, R[5] || 0, R[6] || 0, S);
+            }
+          }
+          return new Date(H);
+        }(y), this.init();
+      }, x.init = function() {
+        var y = this.$d;
+        this.$y = y.getFullYear(), this.$M = y.getMonth(), this.$D = y.getDate(), this.$W = y.getDay(), this.$H = y.getHours(), this.$m = y.getMinutes(), this.$s = y.getSeconds(), this.$ms = y.getMilliseconds();
+      }, x.$utils = function() {
+        return w;
+      }, x.isValid = function() {
+        return this.$d.toString() !== p;
+      }, x.isSame = function(y, T) {
+        var H = v(y);
+        return this.startOf(T) <= H && H <= this.endOf(T);
+      }, x.isAfter = function(y, T) {
+        return v(y) < this.startOf(T);
+      }, x.isBefore = function(y, T) {
+        return this.endOf(T) < v(y);
+      }, x.$g = function(y, T, H) {
+        return w.u(y) ? this[T] : this.set(H, y);
+      }, x.unix = function() {
+        return Math.floor(this.valueOf() / 1e3);
+      }, x.valueOf = function() {
+        return this.$d.getTime();
+      }, x.startOf = function(y, T) {
+        var H = this, I = !!w.u(T) || T, R = w.p(y), C = function(ce, G) {
+          var ie = w.w(H.$u ? Date.UTC(H.$y, G, ce) : new Date(H.$y, G, ce), H);
+          return I ? ie : ie.endOf(o);
+        }, S = function(ce, G) {
+          return w.w(H.toDate()[ce].apply(H.toDate("s"), (I ? [0, 0, 0, 0] : [23, 59, 59, 999]).slice(G)), H);
+        }, E = this.$W, k = this.$M, J = this.$D, le = "set" + (this.$u ? "UTC" : "");
+        switch (R) {
+          case m:
+            return I ? C(1, 0) : C(31, 11);
+          case h:
+            return I ? C(1, k) : C(0, k + 1);
+          case c:
+            var fe = this.$locale().weekStart || 0, pe = (E < fe ? E + 7 : E) - fe;
+            return C(I ? J - pe : J + (6 - pe), k);
+          case o:
+          case $:
+            return S(le + "Hours", 0);
+          case f:
+            return S(le + "Minutes", 1);
+          case u:
+            return S(le + "Seconds", 2);
+          case a:
+            return S(le + "Milliseconds", 3);
+          default:
+            return this.clone();
+        }
+      }, x.endOf = function(y) {
+        return this.startOf(y, !1);
+      }, x.$set = function(y, T) {
+        var H, I = w.p(y), R = "set" + (this.$u ? "UTC" : ""), C = (H = {}, H[o] = R + "Date", H[$] = R + "Date", H[h] = R + "Month", H[m] = R + "FullYear", H[f] = R + "Hours", H[u] = R + "Minutes", H[a] = R + "Seconds", H[i] = R + "Milliseconds", H)[I], S = I === o ? this.$D + (T - this.$W) : T;
+        if (I === h || I === m) {
+          var E = this.clone().set($, 1);
+          E.$d[C](S), E.init(), this.$d = E.set($, Math.min(this.$D, E.daysInMonth())).$d;
+        } else C && this.$d[C](S);
+        return this.init(), this;
+      }, x.set = function(y, T) {
+        return this.clone().$set(y, T);
+      }, x.get = function(y) {
+        return this[w.p(y)]();
+      }, x.add = function(y, T) {
+        var H, I = this;
+        y = Number(y);
+        var R = w.p(T), C = function(k) {
+          var J = v(I);
+          return w.w(J.date(J.date() + Math.round(k * y)), I);
+        };
+        if (R === h) return this.set(h, this.$M + y);
+        if (R === m) return this.set(m, this.$y + y);
+        if (R === o) return C(1);
+        if (R === c) return C(7);
+        var S = (H = {}, H[u] = t, H[f] = s, H[a] = r, H)[R] || 1, E = this.$d.getTime() + y * S;
+        return w.w(E, this);
+      }, x.subtract = function(y, T) {
+        return this.add(-1 * y, T);
+      }, x.format = function(y) {
+        var T = this, H = this.$locale();
+        if (!this.isValid()) return H.invalidDate || p;
+        var I = y || "YYYY-MM-DDTHH:mm:ssZ", R = w.z(this), C = this.$H, S = this.$m, E = this.$M, k = H.weekdays, J = H.months, le = H.meridiem, fe = function(G, ie, ve, we) {
+          return G && (G[ie] || G(T, I)) || ve[ie].slice(0, we);
+        }, pe = function(G) {
+          return w.s(C % 12 || 12, G, "0");
+        }, ce = le || function(G, ie, ve) {
+          var we = G < 12 ? "AM" : "PM";
+          return ve ? we.toLowerCase() : we;
+        };
+        return I.replace(z, function(G, ie) {
+          return ie || function(ve) {
+            switch (ve) {
+              case "YY":
+                return String(T.$y).slice(-2);
+              case "YYYY":
+                return w.s(T.$y, 4, "0");
+              case "M":
+                return E + 1;
+              case "MM":
+                return w.s(E + 1, 2, "0");
+              case "MMM":
+                return fe(H.monthsShort, E, J, 3);
+              case "MMMM":
+                return fe(J, E);
+              case "D":
+                return T.$D;
+              case "DD":
+                return w.s(T.$D, 2, "0");
+              case "d":
+                return String(T.$W);
+              case "dd":
+                return fe(H.weekdaysMin, T.$W, k, 2);
+              case "ddd":
+                return fe(H.weekdaysShort, T.$W, k, 3);
+              case "dddd":
+                return k[T.$W];
+              case "H":
+                return String(C);
+              case "HH":
+                return w.s(C, 2, "0");
+              case "h":
+                return pe(1);
+              case "hh":
+                return pe(2);
+              case "a":
+                return ce(C, S, !0);
+              case "A":
+                return ce(C, S, !1);
+              case "m":
+                return String(S);
+              case "mm":
+                return w.s(S, 2, "0");
+              case "s":
+                return String(T.$s);
+              case "ss":
+                return w.s(T.$s, 2, "0");
+              case "SSS":
+                return w.s(T.$ms, 3, "0");
+              case "Z":
+                return R;
+            }
+            return null;
+          }(G) || R.replace(":", "");
+        });
+      }, x.utcOffset = function() {
+        return 15 * -Math.round(this.$d.getTimezoneOffset() / 15);
+      }, x.diff = function(y, T, H) {
+        var I, R = this, C = w.p(T), S = v(y), E = (S.utcOffset() - this.utcOffset()) * t, k = this - S, J = function() {
+          return w.m(R, S);
+        };
+        switch (C) {
+          case m:
+            I = J() / 12;
+            break;
+          case h:
+            I = J();
+            break;
+          case l:
+            I = J() / 3;
+            break;
+          case c:
+            I = (k - E) / 6048e5;
+            break;
+          case o:
+            I = (k - E) / 864e5;
+            break;
+          case f:
+            I = k / s;
+            break;
+          case u:
+            I = k / t;
+            break;
+          case a:
+            I = k / r;
+            break;
+          default:
+            I = k;
+        }
+        return H ? I : w.a(I);
+      }, x.daysInMonth = function() {
+        return this.endOf(h).$D;
+      }, x.$locale = function() {
+        return O[this.$L];
+      }, x.locale = function(y, T) {
+        if (!y) return this.$L;
+        var H = this.clone(), I = q(y, T, !0);
+        return I && (H.$L = I), H;
+      }, x.clone = function() {
+        return w.w(this.$d, this);
+      }, x.toDate = function() {
+        return new Date(this.valueOf());
+      }, x.toJSON = function() {
+        return this.isValid() ? this.toISOString() : null;
+      }, x.toISOString = function() {
+        return this.$d.toISOString();
+      }, x.toString = function() {
+        return this.$d.toUTCString();
+      }, M;
+    }(), b = A.prototype;
+    return v.prototype = b, [["$ms", i], ["$s", a], ["$m", u], ["$H", f], ["$W", o], ["$M", h], ["$y", m], ["$D", $]].forEach(function(M) {
+      b[M[1]] = function(x) {
+        return this.$g(x, M[0], M[1]);
+      };
+    }), v.extend = function(M, x) {
+      return M.$i || (M(x, A, v), M.$i = !0), v;
+    }, v.locale = q, v.isDayjs = U, v.unix = function(M) {
+      return v(1e3 * M);
+    }, v.en = O[B], v.Ls = O, v.p = {}, v;
+  });
+})(Qe);
+var dt = Qe.exports;
+const pt = /* @__PURE__ */ lt(dt), vt = Object.prototype.toString;
+function me(e, n) {
+  return vt.call(e) === `[object ${n}]`;
+}
+function gt(e) {
+  return typeof e < "u";
+}
+function mt(e) {
+  return !gt(e);
+}
+function wt(e) {
+  return e === null;
+}
+function Je(e) {
+  return mt(e) || wt(e);
+}
+function _t(e) {
+  return Je(e) ? !1 : e instanceof Promise ? !0 : me(e, "Object");
+}
+function kr(e) {
+  return Je(e) ? !0 : xt(e) || yt(e) ? e.length === 0 : e instanceof Map || e instanceof Set ? e.size === 0 : _t(e) ? Object.keys(e).length === 0 : !1;
+}
+function Mr(e) {
+  return me(e, "Date");
+}
+function br(e) {
+  return me(e, "Number") && e === e;
+}
+function yt(e) {
+  return me(e, "String");
+}
+function Or(e) {
+  return typeof e == "function";
+}
+function Ar(e) {
+  return me(e, "Boolean");
+}
+function xt(e) {
+  return e && Array.isArray(e);
+}
+function zr(e) {
+  return typeof Element > "u" ? !1 : e instanceof Element;
+}
+function Hr(e) {
+  return pt.isDayjs(e);
+}
+var $t = { exports: {} };
+(function(e, n) {
+  (function(r, t) {
+    e.exports = t();
+  })(j, function() {
+    var r = "minute", t = /[+-]\d\d(?::?\d\d)?/g, s = /([+-]|\d\d)/g;
+    return function(i, a, u) {
+      var f = a.prototype;
+      u.utc = function(p) {
+        var N = { date: p, utc: !0, args: arguments };
+        return new a(N);
+      }, f.utc = function(p) {
+        var N = u(this.toDate(), { locale: this.$L, utc: !0 });
+        return p ? N.add(this.utcOffset(), r) : N;
+      }, f.local = function() {
+        return u(this.toDate(), { locale: this.$L, utc: !1 });
+      };
+      var o = f.parse;
+      f.parse = function(p) {
+        p.utc && (this.$u = !0), this.$utils().u(p.$offset) || (this.$offset = p.$offset), o.call(this, p);
+      };
+      var c = f.init;
+      f.init = function() {
+        if (this.$u) {
+          var p = this.$d;
+          this.$y = p.getUTCFullYear(), this.$M = p.getUTCMonth(), this.$D = p.getUTCDate(), this.$W = p.getUTCDay(), this.$H = p.getUTCHours(), this.$m = p.getUTCMinutes(), this.$s = p.getUTCSeconds(), this.$ms = p.getUTCMilliseconds();
+        } else c.call(this);
+      };
+      var h = f.utcOffset;
+      f.utcOffset = function(p, N) {
+        var z = this.$utils().u;
+        if (z(p)) return this.$u ? 0 : z(this.$offset) ? h.call(this) : this.$offset;
+        if (typeof p == "string" && (p = function(B) {
+          B === void 0 && (B = "");
+          var O = B.match(t);
+          if (!O) return null;
+          var P = ("" + O[0]).match(s) || ["-", 0, 0], U = P[0], q = 60 * +P[1] + +P[2];
+          return q === 0 ? 0 : U === "+" ? q : -q;
+        }(p), p === null)) return this;
+        var g = Math.abs(p) <= 16 ? 60 * p : p;
+        if (g === 0) return this.utc(N);
+        var d = this.clone();
+        if (N) return d.$offset = g, d.$u = !1, d;
+        var _ = this.$u ? this.toDate().getTimezoneOffset() : -1 * this.utcOffset();
+        return (d = this.local().add(g + _, r)).$offset = g, d.$x.$localOffset = _, d;
+      };
+      var l = f.format;
+      f.format = function(p) {
+        var N = p || (this.$u ? "YYYY-MM-DDTHH:mm:ss[Z]" : "");
+        return l.call(this, N);
+      }, f.valueOf = function() {
+        var p = this.$utils().u(this.$offset) ? 0 : this.$offset + (this.$x.$localOffset || this.$d.getTimezoneOffset());
+        return this.$d.valueOf() - 6e4 * p;
+      }, f.isUTC = function() {
+        return !!this.$u;
+      }, f.toISOString = function() {
+        return this.toDate().toISOString();
+      }, f.toString = function() {
+        return this.toDate().toUTCString();
+      };
+      var m = f.toDate;
+      f.toDate = function(p) {
+        return p === "s" && this.$offset ? u(this.format("YYYY-MM-DD HH:mm:ss:SSS")).toDate() : m.call(this);
+      };
+      var $ = f.diff;
+      f.diff = function(p, N, z) {
+        if (p && this.$u === p.$u) return $.call(this, p, N, z);
+        var g = this.local(), d = u(p).local();
+        return $.call(g, d, N, z);
+      };
+    };
+  });
+})($t);
+var Ct = { exports: {} };
+(function(e, n) {
+  (function(r, t) {
+    e.exports = t();
+  })(j, function() {
+    var r = { year: 0, month: 1, day: 2, hour: 3, minute: 4, second: 5 }, t = {};
+    return function(s, i, a) {
+      var u, f = function(l, m, $) {
+        $ === void 0 && ($ = {});
+        var p = new Date(l), N = function(z, g) {
+          g === void 0 && (g = {});
+          var d = g.timeZoneName || "short", _ = z + "|" + d, B = t[_];
+          return B || (B = new Intl.DateTimeFormat("en-US", { hour12: !1, timeZone: z, year: "numeric", month: "2-digit", day: "2-digit", hour: "2-digit", minute: "2-digit", second: "2-digit", timeZoneName: d }), t[_] = B), B;
+        }(m, $);
+        return N.formatToParts(p);
+      }, o = function(l, m) {
+        for (var $ = f(l, m), p = [], N = 0; N < $.length; N += 1) {
+          var z = $[N], g = z.type, d = z.value, _ = r[g];
+          _ >= 0 && (p[_] = parseInt(d, 10));
+        }
+        var B = p[3], O = B === 24 ? 0 : B, P = p[0] + "-" + p[1] + "-" + p[2] + " " + O + ":" + p[4] + ":" + p[5] + ":000", U = +l;
+        return (a.utc(P).valueOf() - (U -= U % 1e3)) / 6e4;
+      }, c = i.prototype;
+      c.tz = function(l, m) {
+        l === void 0 && (l = u);
+        var $, p = this.utcOffset(), N = this.toDate(), z = N.toLocaleString("en-US", { timeZone: l }), g = Math.round((N - new Date(z)) / 1e3 / 60), d = 15 * -Math.round(N.getTimezoneOffset() / 15) - g;
+        if (!Number(d)) $ = this.utcOffset(0, m);
+        else if ($ = a(z, { locale: this.$L }).$set("millisecond", this.$ms).utcOffset(d, !0), m) {
+          var _ = $.utcOffset();
+          $ = $.add(p - _, "minute");
+        }
+        return $.$x.$timezone = l, $;
+      }, c.offsetName = function(l) {
+        var m = this.$x.$timezone || a.tz.guess(), $ = f(this.valueOf(), m, { timeZoneName: l }).find(function(p) {
+          return p.type.toLowerCase() === "timezonename";
+        });
+        return $ && $.value;
+      };
+      var h = c.startOf;
+      c.startOf = function(l, m) {
+        if (!this.$x || !this.$x.$timezone) return h.call(this, l, m);
+        var $ = a(this.format("YYYY-MM-DD HH:mm:ss:SSS"), { locale: this.$L });
+        return h.call($, l, m).tz(this.$x.$timezone, !0);
+      }, a.tz = function(l, m, $) {
+        var p = $ && m, N = $ || m || u, z = o(+a(), N);
+        if (typeof l != "string") return a(l).tz(N);
+        var g = function(O, P, U) {
+          var q = O - 60 * P * 1e3, v = o(q, U);
+          if (P === v) return [q, P];
+          var w = o(q -= 60 * (v - P) * 1e3, U);
+          return v === w ? [q, v] : [O - 60 * Math.min(v, w) * 1e3, Math.max(v, w)];
+        }(a.utc(l, p).valueOf(), z, N), d = g[0], _ = g[1], B = a(d).utcOffset(_);
+        return B.$x.$timezone = N, B;
+      }, a.tz.guess = function() {
+        return Intl.DateTimeFormat().resolvedOptions().timeZone;
+      }, a.tz.setDefault = function(l) {
+        u = l;
+      };
+    };
+  });
+})(Ct);
+/*!
+ *  decimal.js v10.6.0
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+var he = 9e15, ue = 1e9, He = "0123456789abcdef", xe = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", $e = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Te = {
+  // These values must be integers within the stated ranges (inclusive).
+  // Most of these values can be changed at run-time using the `Decimal.config` method.
+  // The maximum number of significant digits of the result of a calculation or base conversion.
+  // E.g. `Decimal.config({ precision: 20 });`
+  precision: 20,
+  // 1 to MAX_DIGITS
+  // The rounding mode used when rounding to `precision`.
+  //
+  // ROUND_UP         0 Away from zero.
+  // ROUND_DOWN       1 Towards zero.
+  // ROUND_CEIL       2 Towards +Infinity.
+  // ROUND_FLOOR      3 Towards -Infinity.
+  // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+  // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+  // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+  // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+  // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+  //
+  // E.g.
+  // `Decimal.rounding = 4;`
+  // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+  rounding: 4,
+  // 0 to 8
+  // The modulo mode used when calculating the modulus: a mod n.
+  // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+  // The remainder (r) is calculated as: r = a - n * q.
+  //
+  // UP         0 The remainder is positive if the dividend is negative, else is negative.
+  // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+  // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+  // HALF_EVEN  6 The IEEE 754 remainder function.
+  // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+  //
+  // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+  // division (9) are commonly used for the modulus operation. The other rounding modes can also
+  // be used, but they may not give useful results.
+  modulo: 1,
+  // 0 to 9
+  // The exponent value at and beneath which `toString` returns exponential notation.
+  // JavaScript numbers: -7
+  toExpNeg: -7,
+  // 0 to -EXP_LIMIT
+  // The exponent value at and above which `toString` returns exponential notation.
+  // JavaScript numbers: 21
+  toExpPos: 21,
+  // 0 to EXP_LIMIT
+  // The minimum exponent value, beneath which underflow to zero occurs.
+  // JavaScript numbers: -324  (5e-324)
+  minE: -he,
+  // -1 to -EXP_LIMIT
+  // The maximum exponent value, above which overflow to Infinity occurs.
+  // JavaScript numbers: 308  (1.7976931348623157e+308)
+  maxE: he,
+  // 1 to EXP_LIMIT
+  // Whether to use cryptographically-secure random number generation, if available.
+  crypto: !1
+  // true/false
+}, Xe, ne, W = !0, Ne = "[DecimalError] ", ae = Ne + "Invalid argument: ", et = Ne + "Precision limit exceeded", tt = Ne + "crypto unavailable", rt = "[object Decimal]", K = Math.floor, Y = Math.pow, Nt = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Dt = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, St = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, nt = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, X = 1e7, L = 7, Bt = 9007199254740991, Et = xe.length - 1, Pe = $e.length - 1, D = { toStringTag: rt };
+D.absoluteValue = D.abs = function() {
+  var e = new this.constructor(this);
+  return e.s < 0 && (e.s = 1), F(e);
+};
+D.ceil = function() {
+  return F(new this.constructor(this), this.e + 1, 2);
+};
+D.clampedTo = D.clamp = function(e, n) {
+  var r, t = this, s = t.constructor;
+  if (e = new s(e), n = new s(n), !e.s || !n.s) return new s(NaN);
+  if (e.gt(n)) throw Error(ae + n);
+  return r = t.cmp(e), r < 0 ? e : t.cmp(n) > 0 ? n : new s(t);
+};
+D.comparedTo = D.cmp = function(e) {
+  var n, r, t, s, i = this, a = i.d, u = (e = new i.constructor(e)).d, f = i.s, o = e.s;
+  if (!a || !u)
+    return !f || !o ? NaN : f !== o ? f : a === u ? 0 : !a ^ f < 0 ? 1 : -1;
+  if (!a[0] || !u[0]) return a[0] ? f : u[0] ? -o : 0;
+  if (f !== o) return f;
+  if (i.e !== e.e) return i.e > e.e ^ f < 0 ? 1 : -1;
+  for (t = a.length, s = u.length, n = 0, r = t < s ? t : s; n < r; ++n)
+    if (a[n] !== u[n]) return a[n] > u[n] ^ f < 0 ? 1 : -1;
+  return t === s ? 0 : t > s ^ f < 0 ? 1 : -1;
+};
+D.cosine = D.cos = function() {
+  var e, n, r = this, t = r.constructor;
+  return r.d ? r.d[0] ? (e = t.precision, n = t.rounding, t.precision = e + Math.max(r.e, r.sd()) + L, t.rounding = 1, r = kt(t, ut(t, r)), t.precision = e, t.rounding = n, F(ne == 2 || ne == 3 ? r.neg() : r, e, n, !0)) : new t(1) : new t(NaN);
+};
+D.cubeRoot = D.cbrt = function() {
+  var e, n, r, t, s, i, a, u, f, o, c = this, h = c.constructor;
+  if (!c.isFinite() || c.isZero()) return new h(c);
+  for (W = !1, i = c.s * Y(c.s * c, 1 / 3), !i || Math.abs(i) == 1 / 0 ? (r = V(c.d), e = c.e, (i = (e - r.length + 1) % 3) && (r += i == 1 || i == -2 ? "0" : "00"), i = Y(r, 1 / 3), e = K((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), i == 1 / 0 ? r = "5e" + e : (r = i.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + e), t = new h(r), t.s = c.s) : t = new h(i.toString()), a = (e = h.precision) + 3; ; )
+    if (u = t, f = u.times(u).times(u), o = f.plus(c), t = Z(o.plus(c).times(u), o.plus(f), a + 2, 1), V(u.d).slice(0, a) === (r = V(t.d)).slice(0, a))
+      if (r = r.slice(a - 3, a + 1), r == "9999" || !s && r == "4999") {
+        if (!s && (F(u, e + 1, 0), u.times(u).times(u).eq(c))) {
+          t = u;
+          break;
+        }
+        a += 4, s = 1;
+      } else {
+        (!+r || !+r.slice(1) && r.charAt(0) == "5") && (F(t, e + 1, 1), n = !t.times(t).times(t).eq(c));
+        break;
+      }
+  return W = !0, F(t, e, h.rounding, n);
+};
+D.decimalPlaces = D.dp = function() {
+  var e, n = this.d, r = NaN;
+  if (n) {
+    if (e = n.length - 1, r = (e - K(this.e / L)) * L, e = n[e], e) for (; e % 10 == 0; e /= 10) r--;
+    r < 0 && (r = 0);
+  }
+  return r;
+};
+D.dividedBy = D.div = function(e) {
+  return Z(this, new this.constructor(e));
+};
+D.dividedToIntegerBy = D.divToInt = function(e) {
+  var n = this, r = n.constructor;
+  return F(Z(n, new r(e), 0, 1, 1), r.precision, r.rounding);
+};
+D.equals = D.eq = function(e) {
+  return this.cmp(e) === 0;
+};
+D.floor = function() {
+  return F(new this.constructor(this), this.e + 1, 3);
+};
+D.greaterThan = D.gt = function(e) {
+  return this.cmp(e) > 0;
+};
+D.greaterThanOrEqualTo = D.gte = function(e) {
+  var n = this.cmp(e);
+  return n == 1 || n === 0;
+};
+D.hyperbolicCosine = D.cosh = function() {
+  var e, n, r, t, s, i = this, a = i.constructor, u = new a(1);
+  if (!i.isFinite()) return new a(i.s ? 1 / 0 : NaN);
+  if (i.isZero()) return u;
+  r = a.precision, t = a.rounding, a.precision = r + Math.max(i.e, i.sd()) + 4, a.rounding = 1, s = i.d.length, s < 32 ? (e = Math.ceil(s / 3), n = (1 / Se(4, e)).toString()) : (e = 16, n = "2.3283064365386962890625e-10"), i = de(a, 1, i.times(n), new a(1), !0);
+  for (var f, o = e, c = new a(8); o--; )
+    f = i.times(i), i = u.minus(f.times(c.minus(f.times(c))));
+  return F(i, a.precision = r, a.rounding = t, !0);
+};
+D.hyperbolicSine = D.sinh = function() {
+  var e, n, r, t, s = this, i = s.constructor;
+  if (!s.isFinite() || s.isZero()) return new i(s);
+  if (n = i.precision, r = i.rounding, i.precision = n + Math.max(s.e, s.sd()) + 4, i.rounding = 1, t = s.d.length, t < 3)
+    s = de(i, 2, s, s, !0);
+  else {
+    e = 1.4 * Math.sqrt(t), e = e > 16 ? 16 : e | 0, s = s.times(1 / Se(5, e)), s = de(i, 2, s, s, !0);
+    for (var a, u = new i(5), f = new i(16), o = new i(20); e--; )
+      a = s.times(s), s = s.times(u.plus(a.times(f.times(a).plus(o))));
+  }
+  return i.precision = n, i.rounding = r, F(s, n, r, !0);
+};
+D.hyperbolicTangent = D.tanh = function() {
+  var e, n, r = this, t = r.constructor;
+  return r.isFinite() ? r.isZero() ? new t(r) : (e = t.precision, n = t.rounding, t.precision = e + 7, t.rounding = 1, Z(r.sinh(), r.cosh(), t.precision = e, t.rounding = n)) : new t(r.s);
+};
+D.inverseCosine = D.acos = function() {
+  var e = this, n = e.constructor, r = e.abs().cmp(1), t = n.precision, s = n.rounding;
+  return r !== -1 ? r === 0 ? e.isNeg() ? ee(n, t, s) : new n(0) : new n(NaN) : e.isZero() ? ee(n, t + 4, s).times(0.5) : (n.precision = t + 6, n.rounding = 1, e = new n(1).minus(e).div(e.plus(1)).sqrt().atan(), n.precision = t, n.rounding = s, e.times(2));
+};
+D.inverseHyperbolicCosine = D.acosh = function() {
+  var e, n, r = this, t = r.constructor;
+  return r.lte(1) ? new t(r.eq(1) ? 0 : NaN) : r.isFinite() ? (e = t.precision, n = t.rounding, t.precision = e + Math.max(Math.abs(r.e), r.sd()) + 4, t.rounding = 1, W = !1, r = r.times(r).minus(1).sqrt().plus(r), W = !0, t.precision = e, t.rounding = n, r.ln()) : new t(r);
+};
+D.inverseHyperbolicSine = D.asinh = function() {
+  var e, n, r = this, t = r.constructor;
+  return !r.isFinite() || r.isZero() ? new t(r) : (e = t.precision, n = t.rounding, t.precision = e + 2 * Math.max(Math.abs(r.e), r.sd()) + 6, t.rounding = 1, W = !1, r = r.times(r).plus(1).sqrt().plus(r), W = !0, t.precision = e, t.rounding = n, r.ln());
+};
+D.inverseHyperbolicTangent = D.atanh = function() {
+  var e, n, r, t, s = this, i = s.constructor;
+  return s.isFinite() ? s.e >= 0 ? new i(s.abs().eq(1) ? s.s / 0 : s.isZero() ? s : NaN) : (e = i.precision, n = i.rounding, t = s.sd(), Math.max(t, e) < 2 * -s.e - 1 ? F(new i(s), e, n, !0) : (i.precision = r = t - s.e, s = Z(s.plus(1), new i(1).minus(s), r + e, 1), i.precision = e + 4, i.rounding = 1, s = s.ln(), i.precision = e, i.rounding = n, s.times(0.5))) : new i(NaN);
+};
+D.inverseSine = D.asin = function() {
+  var e, n, r, t, s = this, i = s.constructor;
+  return s.isZero() ? new i(s) : (n = s.abs().cmp(1), r = i.precision, t = i.rounding, n !== -1 ? n === 0 ? (e = ee(i, r + 4, t).times(0.5), e.s = s.s, e) : new i(NaN) : (i.precision = r + 6, i.rounding = 1, s = s.div(new i(1).minus(s.times(s)).sqrt().plus(1)).atan(), i.precision = r, i.rounding = t, s.times(2)));
+};
+D.inverseTangent = D.atan = function() {
+  var e, n, r, t, s, i, a, u, f, o = this, c = o.constructor, h = c.precision, l = c.rounding;
+  if (o.isFinite()) {
+    if (o.isZero())
+      return new c(o);
+    if (o.abs().eq(1) && h + 4 <= Pe)
+      return a = ee(c, h + 4, l).times(0.25), a.s = o.s, a;
+  } else {
+    if (!o.s) return new c(NaN);
+    if (h + 4 <= Pe)
+      return a = ee(c, h + 4, l).times(0.5), a.s = o.s, a;
+  }
+  for (c.precision = u = h + 10, c.rounding = 1, r = Math.min(28, u / L + 2 | 0), e = r; e; --e) o = o.div(o.times(o).plus(1).sqrt().plus(1));
+  for (W = !1, n = Math.ceil(u / L), t = 1, f = o.times(o), a = new c(o), s = o; e !== -1; )
+    if (s = s.times(f), i = a.minus(s.div(t += 2)), s = s.times(f), a = i.plus(s.div(t += 2)), a.d[n] !== void 0) for (e = n; a.d[e] === i.d[e] && e--; ) ;
+  return r && (a = a.times(2 << r - 1)), W = !0, F(a, c.precision = h, c.rounding = l, !0);
+};
+D.isFinite = function() {
+  return !!this.d;
+};
+D.isInteger = D.isInt = function() {
+  return !!this.d && K(this.e / L) > this.d.length - 2;
+};
+D.isNaN = function() {
+  return !this.s;
+};
+D.isNegative = D.isNeg = function() {
+  return this.s < 0;
+};
+D.isPositive = D.isPos = function() {
+  return this.s > 0;
+};
+D.isZero = function() {
+  return !!this.d && this.d[0] === 0;
+};
+D.lessThan = D.lt = function(e) {
+  return this.cmp(e) < 0;
+};
+D.lessThanOrEqualTo = D.lte = function(e) {
+  return this.cmp(e) < 1;
+};
+D.logarithm = D.log = function(e) {
+  var n, r, t, s, i, a, u, f, o = this, c = o.constructor, h = c.precision, l = c.rounding, m = 5;
+  if (e == null)
+    e = new c(10), n = !0;
+  else {
+    if (e = new c(e), r = e.d, e.s < 0 || !r || !r[0] || e.eq(1)) return new c(NaN);
+    n = e.eq(10);
+  }
+  if (r = o.d, o.s < 0 || !r || !r[0] || o.eq(1))
+    return new c(r && !r[0] ? -1 / 0 : o.s != 1 ? NaN : r ? 0 : 1 / 0);
+  if (n)
+    if (r.length > 1)
+      i = !0;
+    else {
+      for (s = r[0]; s % 10 === 0; ) s /= 10;
+      i = s !== 1;
+    }
+  if (W = !1, u = h + m, a = oe(o, u), t = n ? Ce(c, u + 10) : oe(e, u), f = Z(a, t, u, 1), ge(f.d, s = h, l))
+    do
+      if (u += 10, a = oe(o, u), t = n ? Ce(c, u + 10) : oe(e, u), f = Z(a, t, u, 1), !i) {
+        +V(f.d).slice(s + 1, s + 15) + 1 == 1e14 && (f = F(f, h + 1, 0));
+        break;
+      }
+    while (ge(f.d, s += 10, l));
+  return W = !0, F(f, h, l);
+};
+D.minus = D.sub = function(e) {
+  var n, r, t, s, i, a, u, f, o, c, h, l, m = this, $ = m.constructor;
+  if (e = new $(e), !m.d || !e.d)
+    return !m.s || !e.s ? e = new $(NaN) : m.d ? e.s = -e.s : e = new $(e.d || m.s !== e.s ? m : NaN), e;
+  if (m.s != e.s)
+    return e.s = -e.s, m.plus(e);
+  if (o = m.d, l = e.d, u = $.precision, f = $.rounding, !o[0] || !l[0]) {
+    if (l[0]) e.s = -e.s;
+    else if (o[0]) e = new $(m);
+    else return new $(f === 3 ? -0 : 0);
+    return W ? F(e, u, f) : e;
+  }
+  if (r = K(e.e / L), c = K(m.e / L), o = o.slice(), i = c - r, i) {
+    for (h = i < 0, h ? (n = o, i = -i, a = l.length) : (n = l, r = c, a = o.length), t = Math.max(Math.ceil(u / L), a) + 2, i > t && (i = t, n.length = 1), n.reverse(), t = i; t--; ) n.push(0);
+    n.reverse();
+  } else {
+    for (t = o.length, a = l.length, h = t < a, h && (a = t), t = 0; t < a; t++)
+      if (o[t] != l[t]) {
+        h = o[t] < l[t];
+        break;
+      }
+    i = 0;
+  }
+  for (h && (n = o, o = l, l = n, e.s = -e.s), a = o.length, t = l.length - a; t > 0; --t) o[a++] = 0;
+  for (t = l.length; t > i; ) {
+    if (o[--t] < l[t]) {
+      for (s = t; s && o[--s] === 0; ) o[s] = X - 1;
+      --o[s], o[t] += X;
+    }
+    o[t] -= l[t];
+  }
+  for (; o[--a] === 0; ) o.pop();
+  for (; o[0] === 0; o.shift()) --r;
+  return o[0] ? (e.d = o, e.e = De(o, r), W ? F(e, u, f) : e) : new $(f === 3 ? -0 : 0);
+};
+D.modulo = D.mod = function(e) {
+  var n, r = this, t = r.constructor;
+  return e = new t(e), !r.d || !e.s || e.d && !e.d[0] ? new t(NaN) : !e.d || r.d && !r.d[0] ? F(new t(r), t.precision, t.rounding) : (W = !1, t.modulo == 9 ? (n = Z(r, e.abs(), 0, 3, 1), n.s *= e.s) : n = Z(r, e, 0, t.modulo, 1), n = n.times(e), W = !0, r.minus(n));
+};
+D.naturalExponential = D.exp = function() {
+  return Fe(this);
+};
+D.naturalLogarithm = D.ln = function() {
+  return oe(this);
+};
+D.negated = D.neg = function() {
+  var e = new this.constructor(this);
+  return e.s = -e.s, F(e);
+};
+D.plus = D.add = function(e) {
+  var n, r, t, s, i, a, u, f, o, c, h = this, l = h.constructor;
+  if (e = new l(e), !h.d || !e.d)
+    return !h.s || !e.s ? e = new l(NaN) : h.d || (e = new l(e.d || h.s === e.s ? h : NaN)), e;
+  if (h.s != e.s)
+    return e.s = -e.s, h.minus(e);
+  if (o = h.d, c = e.d, u = l.precision, f = l.rounding, !o[0] || !c[0])
+    return c[0] || (e = new l(h)), W ? F(e, u, f) : e;
+  if (i = K(h.e / L), t = K(e.e / L), o = o.slice(), s = i - t, s) {
+    for (s < 0 ? (r = o, s = -s, a = c.length) : (r = c, t = i, a = o.length), i = Math.ceil(u / L), a = i > a ? i + 1 : a + 1, s > a && (s = a, r.length = 1), r.reverse(); s--; ) r.push(0);
+    r.reverse();
+  }
+  for (a = o.length, s = c.length, a - s < 0 && (s = a, r = c, c = o, o = r), n = 0; s; )
+    n = (o[--s] = o[s] + c[s] + n) / X | 0, o[s] %= X;
+  for (n && (o.unshift(n), ++t), a = o.length; o[--a] == 0; ) o.pop();
+  return e.d = o, e.e = De(o, t), W ? F(e, u, f) : e;
+};
+D.precision = D.sd = function(e) {
+  var n, r = this;
+  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(ae + e);
+  return r.d ? (n = it(r.d), e && r.e + 1 > n && (n = r.e + 1)) : n = NaN, n;
+};
+D.round = function() {
+  var e = this, n = e.constructor;
+  return F(new n(e), e.e + 1, n.rounding);
+};
+D.sine = D.sin = function() {
+  var e, n, r = this, t = r.constructor;
+  return r.isFinite() ? r.isZero() ? new t(r) : (e = t.precision, n = t.rounding, t.precision = e + Math.max(r.e, r.sd()) + L, t.rounding = 1, r = bt(t, ut(t, r)), t.precision = e, t.rounding = n, F(ne > 2 ? r.neg() : r, e, n, !0)) : new t(NaN);
+};
+D.squareRoot = D.sqrt = function() {
+  var e, n, r, t, s, i, a = this, u = a.d, f = a.e, o = a.s, c = a.constructor;
+  if (o !== 1 || !u || !u[0])
+    return new c(!o || o < 0 && (!u || u[0]) ? NaN : u ? a : 1 / 0);
+  for (W = !1, o = Math.sqrt(+a), o == 0 || o == 1 / 0 ? (n = V(u), (n.length + f) % 2 == 0 && (n += "0"), o = Math.sqrt(n), f = K((f + 1) / 2) - (f < 0 || f % 2), o == 1 / 0 ? n = "5e" + f : (n = o.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + f), t = new c(n)) : t = new c(o.toString()), r = (f = c.precision) + 3; ; )
+    if (i = t, t = i.plus(Z(a, i, r + 2, 1)).times(0.5), V(i.d).slice(0, r) === (n = V(t.d)).slice(0, r))
+      if (n = n.slice(r - 3, r + 1), n == "9999" || !s && n == "4999") {
+        if (!s && (F(i, f + 1, 0), i.times(i).eq(a))) {
+          t = i;
+          break;
+        }
+        r += 4, s = 1;
+      } else {
+        (!+n || !+n.slice(1) && n.charAt(0) == "5") && (F(t, f + 1, 1), e = !t.times(t).eq(a));
+        break;
+      }
+  return W = !0, F(t, f, c.rounding, e);
+};
+D.tangent = D.tan = function() {
+  var e, n, r = this, t = r.constructor;
+  return r.isFinite() ? r.isZero() ? new t(r) : (e = t.precision, n = t.rounding, t.precision = e + 10, t.rounding = 1, r = r.sin(), r.s = 1, r = Z(r, new t(1).minus(r.times(r)).sqrt(), e + 10, 0), t.precision = e, t.rounding = n, F(ne == 2 || ne == 4 ? r.neg() : r, e, n, !0)) : new t(NaN);
+};
+D.times = D.mul = function(e) {
+  var n, r, t, s, i, a, u, f, o, c = this, h = c.constructor, l = c.d, m = (e = new h(e)).d;
+  if (e.s *= c.s, !l || !l[0] || !m || !m[0])
+    return new h(!e.s || l && !l[0] && !m || m && !m[0] && !l ? NaN : !l || !m ? e.s / 0 : e.s * 0);
+  for (r = K(c.e / L) + K(e.e / L), f = l.length, o = m.length, f < o && (i = l, l = m, m = i, a = f, f = o, o = a), i = [], a = f + o, t = a; t--; ) i.push(0);
+  for (t = o; --t >= 0; ) {
+    for (n = 0, s = f + t; s > t; )
+      u = i[s] + m[t] * l[s - t - 1] + n, i[s--] = u % X | 0, n = u / X | 0;
+    i[s] = (i[s] + n) % X | 0;
+  }
+  for (; !i[--a]; ) i.pop();
+  return n ? ++r : i.shift(), e.d = i, e.e = De(i, r), W ? F(e, h.precision, h.rounding) : e;
+};
+D.toBinary = function(e, n) {
+  return qe(this, 2, e, n);
+};
+D.toDecimalPlaces = D.toDP = function(e, n) {
+  var r = this, t = r.constructor;
+  return r = new t(r), e === void 0 ? r : (Q(e, 0, ue), n === void 0 ? n = t.rounding : Q(n, 0, 8), F(r, e + r.e + 1, n));
+};
+D.toExponential = function(e, n) {
+  var r, t = this, s = t.constructor;
+  return e === void 0 ? r = te(t, !0) : (Q(e, 0, ue), n === void 0 ? n = s.rounding : Q(n, 0, 8), t = F(new s(t), e + 1, n), r = te(t, !0, e + 1)), t.isNeg() && !t.isZero() ? "-" + r : r;
+};
+D.toFixed = function(e, n) {
+  var r, t, s = this, i = s.constructor;
+  return e === void 0 ? r = te(s) : (Q(e, 0, ue), n === void 0 ? n = i.rounding : Q(n, 0, 8), t = F(new i(s), e + s.e + 1, n), r = te(t, !1, e + t.e + 1)), s.isNeg() && !s.isZero() ? "-" + r : r;
+};
+D.toFraction = function(e) {
+  var n, r, t, s, i, a, u, f, o, c, h, l, m = this, $ = m.d, p = m.constructor;
+  if (!$) return new p(m);
+  if (o = r = new p(1), t = f = new p(0), n = new p(t), i = n.e = it($) - m.e - 1, a = i % L, n.d[0] = Y(10, a < 0 ? L + a : a), e == null)
+    e = i > 0 ? n : o;
+  else {
+    if (u = new p(e), !u.isInt() || u.lt(o)) throw Error(ae + u);
+    e = u.gt(n) ? i > 0 ? n : o : u;
+  }
+  for (W = !1, u = new p(V($)), c = p.precision, p.precision = i = $.length * L * 2; h = Z(u, n, 0, 1, 1), s = r.plus(h.times(t)), s.cmp(e) != 1; )
+    r = t, t = s, s = o, o = f.plus(h.times(s)), f = s, s = n, n = u.minus(h.times(s)), u = s;
+  return s = Z(e.minus(r), t, 0, 1, 1), f = f.plus(s.times(o)), r = r.plus(s.times(t)), f.s = o.s = m.s, l = Z(o, t, i, 1).minus(m).abs().cmp(Z(f, r, i, 1).minus(m).abs()) < 1 ? [o, t] : [f, r], p.precision = c, W = !0, l;
+};
+D.toHexadecimal = D.toHex = function(e, n) {
+  return qe(this, 16, e, n);
+};
+D.toNearest = function(e, n) {
+  var r = this, t = r.constructor;
+  if (r = new t(r), e == null) {
+    if (!r.d) return r;
+    e = new t(1), n = t.rounding;
+  } else {
+    if (e = new t(e), n === void 0 ? n = t.rounding : Q(n, 0, 8), !r.d) return e.s ? r : e;
+    if (!e.d)
+      return e.s && (e.s = r.s), e;
+  }
+  return e.d[0] ? (W = !1, r = Z(r, e, 0, n, 1).times(e), W = !0, F(r)) : (e.s = r.s, r = e), r;
+};
+D.toNumber = function() {
+  return +this;
+};
+D.toOctal = function(e, n) {
+  return qe(this, 8, e, n);
+};
+D.toPower = D.pow = function(e) {
+  var n, r, t, s, i, a, u = this, f = u.constructor, o = +(e = new f(e));
+  if (!u.d || !e.d || !u.d[0] || !e.d[0]) return new f(Y(+u, o));
+  if (u = new f(u), u.eq(1)) return u;
+  if (t = f.precision, i = f.rounding, e.eq(1)) return F(u, t, i);
+  if (n = K(e.e / L), n >= e.d.length - 1 && (r = o < 0 ? -o : o) <= Bt)
+    return s = st(f, u, r, t), e.s < 0 ? new f(1).div(s) : F(s, t, i);
+  if (a = u.s, a < 0) {
+    if (n < e.d.length - 1) return new f(NaN);
+    if (e.d[n] & 1 || (a = 1), u.e == 0 && u.d[0] == 1 && u.d.length == 1)
+      return u.s = a, u;
+  }
+  return r = Y(+u, o), n = r == 0 || !isFinite(r) ? K(o * (Math.log("0." + V(u.d)) / Math.LN10 + u.e + 1)) : new f(r + "").e, n > f.maxE + 1 || n < f.minE - 1 ? new f(n > 0 ? a / 0 : 0) : (W = !1, f.rounding = u.s = 1, r = Math.min(12, (n + "").length), s = Fe(e.times(oe(u, t + r)), t), s.d && (s = F(s, t + 5, 1), ge(s.d, t, i) && (n = t + 10, s = F(Fe(e.times(oe(u, n + r)), n), n + 5, 1), +V(s.d).slice(t + 1, t + 15) + 1 == 1e14 && (s = F(s, t + 1, 0)))), s.s = a, W = !0, f.rounding = i, F(s, t, i));
+};
+D.toPrecision = function(e, n) {
+  var r, t = this, s = t.constructor;
+  return e === void 0 ? r = te(t, t.e <= s.toExpNeg || t.e >= s.toExpPos) : (Q(e, 1, ue), n === void 0 ? n = s.rounding : Q(n, 0, 8), t = F(new s(t), e, n), r = te(t, e <= t.e || t.e <= s.toExpNeg, e)), t.isNeg() && !t.isZero() ? "-" + r : r;
+};
+D.toSignificantDigits = D.toSD = function(e, n) {
+  var r = this, t = r.constructor;
+  return e === void 0 ? (e = t.precision, n = t.rounding) : (Q(e, 1, ue), n === void 0 ? n = t.rounding : Q(n, 0, 8)), F(new t(r), e, n);
+};
+D.toString = function() {
+  var e = this, n = e.constructor, r = te(e, e.e <= n.toExpNeg || e.e >= n.toExpPos);
+  return e.isNeg() && !e.isZero() ? "-" + r : r;
+};
+D.truncated = D.trunc = function() {
+  return F(new this.constructor(this), this.e + 1, 1);
+};
+D.valueOf = D.toJSON = function() {
+  var e = this, n = e.constructor, r = te(e, e.e <= n.toExpNeg || e.e >= n.toExpPos);
+  return e.isNeg() ? "-" + r : r;
+};
+function V(e) {
+  var n, r, t, s = e.length - 1, i = "", a = e[0];
+  if (s > 0) {
+    for (i += a, n = 1; n < s; n++)
+      t = e[n] + "", r = L - t.length, r && (i += se(r)), i += t;
+    a = e[n], t = a + "", r = L - t.length, r && (i += se(r));
+  } else if (a === 0)
+    return "0";
+  for (; a % 10 === 0; ) a /= 10;
+  return i + a;
+}
+function Q(e, n, r) {
+  if (e !== ~~e || e < n || e > r)
+    throw Error(ae + e);
+}
+function ge(e, n, r, t) {
+  var s, i, a, u;
+  for (i = e[0]; i >= 10; i /= 10) --n;
+  return --n < 0 ? (n += L, s = 0) : (s = Math.ceil((n + 1) / L), n %= L), i = Y(10, L - n), u = e[s] % i | 0, t == null ? n < 3 ? (n == 0 ? u = u / 100 | 0 : n == 1 && (u = u / 10 | 0), a = r < 4 && u == 99999 || r > 3 && u == 49999 || u == 5e4 || u == 0) : a = (r < 4 && u + 1 == i || r > 3 && u + 1 == i / 2) && (e[s + 1] / i / 100 | 0) == Y(10, n - 2) - 1 || (u == i / 2 || u == 0) && (e[s + 1] / i / 100 | 0) == 0 : n < 4 ? (n == 0 ? u = u / 1e3 | 0 : n == 1 ? u = u / 100 | 0 : n == 2 && (u = u / 10 | 0), a = (t || r < 4) && u == 9999 || !t && r > 3 && u == 4999) : a = ((t || r < 4) && u + 1 == i || !t && r > 3 && u + 1 == i / 2) && (e[s + 1] / i / 1e3 | 0) == Y(10, n - 3) - 1, a;
+}
+function _e(e, n, r) {
+  for (var t, s = [0], i, a = 0, u = e.length; a < u; ) {
+    for (i = s.length; i--; ) s[i] *= n;
+    for (s[0] += He.indexOf(e.charAt(a++)), t = 0; t < s.length; t++)
+      s[t] > r - 1 && (s[t + 1] === void 0 && (s[t + 1] = 0), s[t + 1] += s[t] / r | 0, s[t] %= r);
+  }
+  return s.reverse();
+}
+function kt(e, n) {
+  var r, t, s;
+  if (n.isZero()) return n;
+  t = n.d.length, t < 32 ? (r = Math.ceil(t / 3), s = (1 / Se(4, r)).toString()) : (r = 16, s = "2.3283064365386962890625e-10"), e.precision += r, n = de(e, 1, n.times(s), new e(1));
+  for (var i = r; i--; ) {
+    var a = n.times(n);
+    n = a.times(a).minus(a).times(8).plus(1);
+  }
+  return e.precision -= r, n;
+}
+var Z = /* @__PURE__ */ function() {
+  function e(t, s, i) {
+    var a, u = 0, f = t.length;
+    for (t = t.slice(); f--; )
+      a = t[f] * s + u, t[f] = a % i | 0, u = a / i | 0;
+    return u && t.unshift(u), t;
+  }
+  function n(t, s, i, a) {
+    var u, f;
+    if (i != a)
+      f = i > a ? 1 : -1;
+    else
+      for (u = f = 0; u < i; u++)
+        if (t[u] != s[u]) {
+          f = t[u] > s[u] ? 1 : -1;
+          break;
+        }
+    return f;
+  }
+  function r(t, s, i, a) {
+    for (var u = 0; i--; )
+      t[i] -= u, u = t[i] < s[i] ? 1 : 0, t[i] = u * a + t[i] - s[i];
+    for (; !t[0] && t.length > 1; ) t.shift();
+  }
+  return function(t, s, i, a, u, f) {
+    var o, c, h, l, m, $, p, N, z, g, d, _, B, O, P, U, q, v, w, A, b = t.constructor, M = t.s == s.s ? 1 : -1, x = t.d, y = s.d;
+    if (!x || !x[0] || !y || !y[0])
+      return new b(
+        // Return NaN if either NaN, or both Infinity or 0.
+        !t.s || !s.s || (x ? y && x[0] == y[0] : !y) ? NaN : (
+          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+          x && x[0] == 0 || !y ? M * 0 : M / 0
+        )
+      );
+    for (f ? (m = 1, c = t.e - s.e) : (f = X, m = L, c = K(t.e / m) - K(s.e / m)), w = y.length, q = x.length, z = new b(M), g = z.d = [], h = 0; y[h] == (x[h] || 0); h++) ;
+    if (y[h] > (x[h] || 0) && c--, i == null ? (O = i = b.precision, a = b.rounding) : u ? O = i + (t.e - s.e) + 1 : O = i, O < 0)
+      g.push(1), $ = !0;
+    else {
+      if (O = O / m + 2 | 0, h = 0, w == 1) {
+        for (l = 0, y = y[0], O++; (h < q || l) && O--; h++)
+          P = l * f + (x[h] || 0), g[h] = P / y | 0, l = P % y | 0;
+        $ = l || h < q;
+      } else {
+        for (l = f / (y[0] + 1) | 0, l > 1 && (y = e(y, l, f), x = e(x, l, f), w = y.length, q = x.length), U = w, d = x.slice(0, w), _ = d.length; _ < w; ) d[_++] = 0;
+        A = y.slice(), A.unshift(0), v = y[0], y[1] >= f / 2 && ++v;
+        do
+          l = 0, o = n(y, d, w, _), o < 0 ? (B = d[0], w != _ && (B = B * f + (d[1] || 0)), l = B / v | 0, l > 1 ? (l >= f && (l = f - 1), p = e(y, l, f), N = p.length, _ = d.length, o = n(p, d, N, _), o == 1 && (l--, r(p, w < N ? A : y, N, f))) : (l == 0 && (o = l = 1), p = y.slice()), N = p.length, N < _ && p.unshift(0), r(d, p, _, f), o == -1 && (_ = d.length, o = n(y, d, w, _), o < 1 && (l++, r(d, w < _ ? A : y, _, f))), _ = d.length) : o === 0 && (l++, d = [0]), g[h++] = l, o && d[0] ? d[_++] = x[U] || 0 : (d = [x[U]], _ = 1);
+        while ((U++ < q || d[0] !== void 0) && O--);
+        $ = d[0] !== void 0;
+      }
+      g[0] || g.shift();
+    }
+    if (m == 1)
+      z.e = c, Xe = $;
+    else {
+      for (h = 1, l = g[0]; l >= 10; l /= 10) h++;
+      z.e = h + c * m - 1, F(z, u ? i + z.e + 1 : i, a, $);
+    }
+    return z;
+  };
+}();
+function F(e, n, r, t) {
+  var s, i, a, u, f, o, c, h, l, m = e.constructor;
+  e: if (n != null) {
+    if (h = e.d, !h) return e;
+    for (s = 1, u = h[0]; u >= 10; u /= 10) s++;
+    if (i = n - s, i < 0)
+      i += L, a = n, c = h[l = 0], f = c / Y(10, s - a - 1) % 10 | 0;
+    else if (l = Math.ceil((i + 1) / L), u = h.length, l >= u)
+      if (t) {
+        for (; u++ <= l; ) h.push(0);
+        c = f = 0, s = 1, i %= L, a = i - L + 1;
+      } else
+        break e;
+    else {
+      for (c = u = h[l], s = 1; u >= 10; u /= 10) s++;
+      i %= L, a = i - L + s, f = a < 0 ? 0 : c / Y(10, s - a - 1) % 10 | 0;
+    }
+    if (t = t || n < 0 || h[l + 1] !== void 0 || (a < 0 ? c : c % Y(10, s - a - 1)), o = r < 4 ? (f || t) && (r == 0 || r == (e.s < 0 ? 3 : 2)) : f > 5 || f == 5 && (r == 4 || t || r == 6 && // Check whether the digit to the left of the rounding digit is odd.
+    (i > 0 ? a > 0 ? c / Y(10, s - a) : 0 : h[l - 1]) % 10 & 1 || r == (e.s < 0 ? 8 : 7)), n < 1 || !h[0])
+      return h.length = 0, o ? (n -= e.e + 1, h[0] = Y(10, (L - n % L) % L), e.e = -n || 0) : h[0] = e.e = 0, e;
+    if (i == 0 ? (h.length = l, u = 1, l--) : (h.length = l + 1, u = Y(10, L - i), h[l] = a > 0 ? (c / Y(10, s - a) % Y(10, a) | 0) * u : 0), o)
+      for (; ; )
+        if (l == 0) {
+          for (i = 1, a = h[0]; a >= 10; a /= 10) i++;
+          for (a = h[0] += u, u = 1; a >= 10; a /= 10) u++;
+          i != u && (e.e++, h[0] == X && (h[0] = 1));
+          break;
+        } else {
+          if (h[l] += u, h[l] != X) break;
+          h[l--] = 0, u = 1;
+        }
+    for (i = h.length; h[--i] === 0; ) h.pop();
+  }
+  return W && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
+}
+function te(e, n, r) {
+  if (!e.isFinite()) return at(e);
+  var t, s = e.e, i = V(e.d), a = i.length;
+  return n ? (r && (t = r - a) > 0 ? i = i.charAt(0) + "." + i.slice(1) + se(t) : a > 1 && (i = i.charAt(0) + "." + i.slice(1)), i = i + (e.e < 0 ? "e" : "e+") + e.e) : s < 0 ? (i = "0." + se(-s - 1) + i, r && (t = r - a) > 0 && (i += se(t))) : s >= a ? (i += se(s + 1 - a), r && (t = r - s - 1) > 0 && (i = i + "." + se(t))) : ((t = s + 1) < a && (i = i.slice(0, t) + "." + i.slice(t)), r && (t = r - a) > 0 && (s + 1 === a && (i += "."), i += se(t))), i;
+}
+function De(e, n) {
+  var r = e[0];
+  for (n *= L; r >= 10; r /= 10) n++;
+  return n;
+}
+function Ce(e, n, r) {
+  if (n > Et)
+    throw W = !0, r && (e.precision = r), Error(et);
+  return F(new e(xe), n, 1, !0);
+}
+function ee(e, n, r) {
+  if (n > Pe) throw Error(et);
+  return F(new e($e), n, r, !0);
+}
+function it(e) {
+  var n = e.length - 1, r = n * L + 1;
+  if (n = e[n], n) {
+    for (; n % 10 == 0; n /= 10) r--;
+    for (n = e[0]; n >= 10; n /= 10) r++;
+  }
+  return r;
+}
+function se(e) {
+  for (var n = ""; e--; ) n += "0";
+  return n;
+}
+function st(e, n, r, t) {
+  var s, i = new e(1), a = Math.ceil(t / L + 4);
+  for (W = !1; ; ) {
+    if (r % 2 && (i = i.times(n), Re(i.d, a) && (s = !0)), r = K(r / 2), r === 0) {
+      r = i.d.length - 1, s && i.d[r] === 0 && ++i.d[r];
+      break;
+    }
+    n = n.times(n), Re(n.d, a);
+  }
+  return W = !0, i;
+}
+function Ie(e) {
+  return e.d[e.d.length - 1] & 1;
+}
+function ot(e, n, r) {
+  for (var t, s, i = new e(n[0]), a = 0; ++a < n.length; ) {
+    if (s = new e(n[a]), !s.s) {
+      i = s;
+      break;
+    }
+    t = i.cmp(s), (t === r || t === 0 && i.s === r) && (i = s);
+  }
+  return i;
+}
+function Fe(e, n) {
+  var r, t, s, i, a, u, f, o = 0, c = 0, h = 0, l = e.constructor, m = l.rounding, $ = l.precision;
+  if (!e.d || !e.d[0] || e.e > 17)
+    return new l(e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
+  for (n == null ? (W = !1, f = $) : f = n, u = new l(0.03125); e.e > -2; )
+    e = e.times(u), h += 5;
+  for (t = Math.log(Y(2, h)) / Math.LN10 * 2 + 5 | 0, f += t, r = i = a = new l(1), l.precision = f; ; ) {
+    if (i = F(i.times(e), f, 1), r = r.times(++c), u = a.plus(Z(i, r, f, 1)), V(u.d).slice(0, f) === V(a.d).slice(0, f)) {
+      for (s = h; s--; ) a = F(a.times(a), f, 1);
+      if (n == null)
+        if (o < 3 && ge(a.d, f - t, m, o))
+          l.precision = f += 10, r = i = u = new l(1), c = 0, o++;
+        else
+          return F(a, l.precision = $, m, W = !0);
+      else
+        return l.precision = $, a;
+    }
+    a = u;
+  }
+}
+function oe(e, n) {
+  var r, t, s, i, a, u, f, o, c, h, l, m = 1, $ = 10, p = e, N = p.d, z = p.constructor, g = z.rounding, d = z.precision;
+  if (p.s < 0 || !N || !N[0] || !p.e && N[0] == 1 && N.length == 1)
+    return new z(N && !N[0] ? -1 / 0 : p.s != 1 ? NaN : N ? 0 : p);
+  if (n == null ? (W = !1, c = d) : c = n, z.precision = c += $, r = V(N), t = r.charAt(0), Math.abs(i = p.e) < 15e14) {
+    for (; t < 7 && t != 1 || t == 1 && r.charAt(1) > 3; )
+      p = p.times(e), r = V(p.d), t = r.charAt(0), m++;
+    i = p.e, t > 1 ? (p = new z("0." + r), i++) : p = new z(t + "." + r.slice(1));
+  } else
+    return o = Ce(z, c + 2, d).times(i + ""), p = oe(new z(t + "." + r.slice(1)), c - $).plus(o), z.precision = d, n == null ? F(p, d, g, W = !0) : p;
+  for (h = p, f = a = p = Z(p.minus(1), p.plus(1), c, 1), l = F(p.times(p), c, 1), s = 3; ; ) {
+    if (a = F(a.times(l), c, 1), o = f.plus(Z(a, new z(s), c, 1)), V(o.d).slice(0, c) === V(f.d).slice(0, c))
+      if (f = f.times(2), i !== 0 && (f = f.plus(Ce(z, c + 2, d).times(i + ""))), f = Z(f, new z(m), c, 1), n == null)
+        if (ge(f.d, c - $, g, u))
+          z.precision = c += $, o = a = p = Z(h.minus(1), h.plus(1), c, 1), l = F(p.times(p), c, 1), s = u = 1;
+        else
+          return F(f, z.precision = d, g, W = !0);
+      else
+        return z.precision = d, f;
+    f = o, s += 2;
+  }
+}
+function at(e) {
+  return String(e.s * e.s / 0);
+}
+function ye(e, n) {
+  var r, t, s;
+  for ((r = n.indexOf(".")) > -1 && (n = n.replace(".", "")), (t = n.search(/e/i)) > 0 ? (r < 0 && (r = t), r += +n.slice(t + 1), n = n.substring(0, t)) : r < 0 && (r = n.length), t = 0; n.charCodeAt(t) === 48; t++) ;
+  for (s = n.length; n.charCodeAt(s - 1) === 48; --s) ;
+  if (n = n.slice(t, s), n) {
+    if (s -= t, e.e = r = r - t - 1, e.d = [], t = (r + 1) % L, r < 0 && (t += L), t < s) {
+      for (t && e.d.push(+n.slice(0, t)), s -= L; t < s; ) e.d.push(+n.slice(t, t += L));
+      n = n.slice(t), t = L - n.length;
+    } else
+      t -= s;
+    for (; t--; ) n += "0";
+    e.d.push(+n), W && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
+  } else
+    e.e = 0, e.d = [0];
+  return e;
+}
+function Mt(e, n) {
+  var r, t, s, i, a, u, f, o, c;
+  if (n.indexOf("_") > -1) {
+    if (n = n.replace(/(\d)_(?=\d)/g, "$1"), nt.test(n)) return ye(e, n);
+  } else if (n === "Infinity" || n === "NaN")
+    return +n || (e.s = NaN), e.e = NaN, e.d = null, e;
+  if (Dt.test(n))
+    r = 16, n = n.toLowerCase();
+  else if (Nt.test(n))
+    r = 2;
+  else if (St.test(n))
+    r = 8;
+  else
+    throw Error(ae + n);
+  for (i = n.search(/p/i), i > 0 ? (f = +n.slice(i + 1), n = n.substring(2, i)) : n = n.slice(2), i = n.indexOf("."), a = i >= 0, t = e.constructor, a && (n = n.replace(".", ""), u = n.length, i = u - i, s = st(t, new t(r), i, i * 2)), o = _e(n, r, X), c = o.length - 1, i = c; o[i] === 0; --i) o.pop();
+  return i < 0 ? new t(e.s * 0) : (e.e = De(o, c), e.d = o, W = !1, a && (e = Z(e, s, u * 4)), f && (e = e.times(Math.abs(f) < 54 ? Y(2, f) : Be.pow(2, f))), W = !0, e);
+}
+function bt(e, n) {
+  var r, t = n.d.length;
+  if (t < 3)
+    return n.isZero() ? n : de(e, 2, n, n);
+  r = 1.4 * Math.sqrt(t), r = r > 16 ? 16 : r | 0, n = n.times(1 / Se(5, r)), n = de(e, 2, n, n);
+  for (var s, i = new e(5), a = new e(16), u = new e(20); r--; )
+    s = n.times(n), n = n.times(i.plus(s.times(a.times(s).minus(u))));
+  return n;
+}
+function de(e, n, r, t, s) {
+  var i, a, u, f, o = e.precision, c = Math.ceil(o / L);
+  for (W = !1, f = r.times(r), u = new e(t); ; ) {
+    if (a = Z(u.times(f), new e(n++ * n++), o, 1), u = s ? t.plus(a) : t.minus(a), t = Z(a.times(f), new e(n++ * n++), o, 1), a = u.plus(t), a.d[c] !== void 0) {
+      for (i = c; a.d[i] === u.d[i] && i--; ) ;
+      if (i == -1) break;
+    }
+    i = u, u = t, t = a, a = i;
+  }
+  return W = !0, a.d.length = c + 1, a;
+}
+function Se(e, n) {
+  for (var r = e; --n; ) r *= e;
+  return r;
+}
+function ut(e, n) {
+  var r, t = n.s < 0, s = ee(e, e.precision, 1), i = s.times(0.5);
+  if (n = n.abs(), n.lte(i))
+    return ne = t ? 4 : 1, n;
+  if (r = n.divToInt(s), r.isZero())
+    ne = t ? 3 : 2;
+  else {
+    if (n = n.minus(r.times(s)), n.lte(i))
+      return ne = Ie(r) ? t ? 2 : 3 : t ? 4 : 1, n;
+    ne = Ie(r) ? t ? 1 : 4 : t ? 3 : 2;
+  }
+  return n.minus(s).abs();
+}
+function qe(e, n, r, t) {
+  var s, i, a, u, f, o, c, h, l, m = e.constructor, $ = r !== void 0;
+  if ($ ? (Q(r, 1, ue), t === void 0 ? t = m.rounding : Q(t, 0, 8)) : (r = m.precision, t = m.rounding), !e.isFinite())
+    c = at(e);
+  else {
+    for (c = te(e), a = c.indexOf("."), $ ? (s = 2, n == 16 ? r = r * 4 - 3 : n == 8 && (r = r * 3 - 2)) : s = n, a >= 0 && (c = c.replace(".", ""), l = new m(1), l.e = c.length - a, l.d = _e(te(l), 10, s), l.e = l.d.length), h = _e(c, 10, s), i = f = h.length; h[--f] == 0; ) h.pop();
+    if (!h[0])
+      c = $ ? "0p+0" : "0";
+    else {
+      if (a < 0 ? i-- : (e = new m(e), e.d = h, e.e = i, e = Z(e, l, r, t, 0, s), h = e.d, i = e.e, o = Xe), a = h[r], u = s / 2, o = o || h[r + 1] !== void 0, o = t < 4 ? (a !== void 0 || o) && (t === 0 || t === (e.s < 0 ? 3 : 2)) : a > u || a === u && (t === 4 || o || t === 6 && h[r - 1] & 1 || t === (e.s < 0 ? 8 : 7)), h.length = r, o)
+        for (; ++h[--r] > s - 1; )
+          h[r] = 0, r || (++i, h.unshift(1));
+      for (f = h.length; !h[f - 1]; --f) ;
+      for (a = 0, c = ""; a < f; a++) c += He.charAt(h[a]);
+      if ($) {
+        if (f > 1)
+          if (n == 16 || n == 8) {
+            for (a = n == 16 ? 4 : 3, --f; f % a; f++) c += "0";
+            for (h = _e(c, s, n), f = h.length; !h[f - 1]; --f) ;
+            for (a = 1, c = "1."; a < f; a++) c += He.charAt(h[a]);
+          } else
+            c = c.charAt(0) + "." + c.slice(1);
+        c = c + (i < 0 ? "p" : "p+") + i;
+      } else if (i < 0) {
+        for (; ++i; ) c = "0" + c;
+        c = "0." + c;
+      } else if (++i > f) for (i -= f; i--; ) c += "0";
+      else i < f && (c = c.slice(0, i) + "." + c.slice(i));
+    }
+    c = (n == 16 ? "0x" : n == 2 ? "0b" : n == 8 ? "0o" : "") + c;
+  }
+  return e.s < 0 ? "-" + c : c;
+}
+function Re(e, n) {
+  if (e.length > n)
+    return e.length = n, !0;
+}
+function Ot(e) {
+  return new this(e).abs();
+}
+function At(e) {
+  return new this(e).acos();
+}
+function zt(e) {
+  return new this(e).acosh();
+}
+function Ht(e, n) {
+  return new this(e).plus(n);
+}
+function Tt(e) {
+  return new this(e).asin();
+}
+function Pt(e) {
+  return new this(e).asinh();
+}
+function Ft(e) {
+  return new this(e).atan();
+}
+function qt(e) {
+  return new this(e).atanh();
+}
+function Lt(e, n) {
+  e = new this(e), n = new this(n);
+  var r, t = this.precision, s = this.rounding, i = t + 4;
+  return !e.s || !n.s ? r = new this(NaN) : !e.d && !n.d ? (r = ee(this, i, 1).times(n.s > 0 ? 0.25 : 0.75), r.s = e.s) : !n.d || e.isZero() ? (r = n.s < 0 ? ee(this, t, s) : new this(0), r.s = e.s) : !e.d || n.isZero() ? (r = ee(this, i, 1).times(0.5), r.s = e.s) : n.s < 0 ? (this.precision = i, this.rounding = 1, r = this.atan(Z(e, n, i, 1)), n = ee(this, i, 1), this.precision = t, this.rounding = s, r = e.s < 0 ? r.minus(n) : r.plus(n)) : r = this.atan(Z(e, n, i, 1)), r;
+}
+function It(e) {
+  return new this(e).cbrt();
+}
+function Rt(e) {
+  return F(e = new this(e), e.e + 1, 2);
+}
+function Ut(e, n, r) {
+  return new this(e).clamp(n, r);
+}
+function Wt(e) {
+  if (!e || typeof e != "object") throw Error(Ne + "Object expected");
+  var n, r, t, s = e.defaults === !0, i = [
+    "precision",
+    1,
+    ue,
+    "rounding",
+    0,
+    8,
+    "toExpNeg",
+    -he,
+    0,
+    "toExpPos",
+    0,
+    he,
+    "maxE",
+    0,
+    he,
+    "minE",
+    -he,
+    0,
+    "modulo",
+    0,
+    9
+  ];
+  for (n = 0; n < i.length; n += 3)
+    if (r = i[n], s && (this[r] = Te[r]), (t = e[r]) !== void 0)
+      if (K(t) === t && t >= i[n + 1] && t <= i[n + 2]) this[r] = t;
+      else throw Error(ae + r + ": " + t);
+  if (r = "crypto", s && (this[r] = Te[r]), (t = e[r]) !== void 0)
+    if (t === !0 || t === !1 || t === 0 || t === 1)
+      if (t)
+        if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+          this[r] = !0;
+        else
+          throw Error(tt);
+      else
+        this[r] = !1;
+    else
+      throw Error(ae + r + ": " + t);
+  return this;
+}
+function Zt(e) {
+  return new this(e).cos();
+}
+function Yt(e) {
+  return new this(e).cosh();
+}
+function ft(e) {
+  var n, r, t;
+  function s(i) {
+    var a, u, f, o = this;
+    if (!(o instanceof s)) return new s(i);
+    if (o.constructor = s, Ue(i)) {
+      o.s = i.s, W ? !i.d || i.e > s.maxE ? (o.e = NaN, o.d = null) : i.e < s.minE ? (o.e = 0, o.d = [0]) : (o.e = i.e, o.d = i.d.slice()) : (o.e = i.e, o.d = i.d ? i.d.slice() : i.d);
+      return;
+    }
+    if (f = typeof i, f === "number") {
+      if (i === 0) {
+        o.s = 1 / i < 0 ? -1 : 1, o.e = 0, o.d = [0];
+        return;
+      }
+      if (i < 0 ? (i = -i, o.s = -1) : o.s = 1, i === ~~i && i < 1e7) {
+        for (a = 0, u = i; u >= 10; u /= 10) a++;
+        W ? a > s.maxE ? (o.e = NaN, o.d = null) : a < s.minE ? (o.e = 0, o.d = [0]) : (o.e = a, o.d = [i]) : (o.e = a, o.d = [i]);
+        return;
+      }
+      if (i * 0 !== 0) {
+        i || (o.s = NaN), o.e = NaN, o.d = null;
+        return;
+      }
+      return ye(o, i.toString());
+    }
+    if (f === "string")
+      return (u = i.charCodeAt(0)) === 45 ? (i = i.slice(1), o.s = -1) : (u === 43 && (i = i.slice(1)), o.s = 1), nt.test(i) ? ye(o, i) : Mt(o, i);
+    if (f === "bigint")
+      return i < 0 ? (i = -i, o.s = -1) : o.s = 1, ye(o, i.toString());
+    throw Error(ae + i);
+  }
+  if (s.prototype = D, s.ROUND_UP = 0, s.ROUND_DOWN = 1, s.ROUND_CEIL = 2, s.ROUND_FLOOR = 3, s.ROUND_HALF_UP = 4, s.ROUND_HALF_DOWN = 5, s.ROUND_HALF_EVEN = 6, s.ROUND_HALF_CEIL = 7, s.ROUND_HALF_FLOOR = 8, s.EUCLID = 9, s.config = s.set = Wt, s.clone = ft, s.isDecimal = Ue, s.abs = Ot, s.acos = At, s.acosh = zt, s.add = Ht, s.asin = Tt, s.asinh = Pt, s.atan = Ft, s.atanh = qt, s.atan2 = Lt, s.cbrt = It, s.ceil = Rt, s.clamp = Ut, s.cos = Zt, s.cosh = Yt, s.div = jt, s.exp = Vt, s.floor = Kt, s.hypot = Gt, s.ln = Qt, s.log = Jt, s.log10 = er, s.log2 = Xt, s.max = tr, s.min = rr, s.mod = nr, s.mul = ir, s.pow = sr, s.random = or, s.round = ar, s.sign = ur, s.sin = fr, s.sinh = cr, s.sqrt = lr, s.sub = hr, s.sum = dr, s.tan = pr, s.tanh = vr, s.trunc = gr, e === void 0 && (e = {}), e && e.defaults !== !0)
+    for (t = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"], n = 0; n < t.length; ) e.hasOwnProperty(r = t[n++]) || (e[r] = this[r]);
+  return s.config(e), s;
+}
+function jt(e, n) {
+  return new this(e).div(n);
+}
+function Vt(e) {
+  return new this(e).exp();
+}
+function Kt(e) {
+  return F(e = new this(e), e.e + 1, 3);
+}
+function Gt() {
+  var e, n, r = new this(0);
+  for (W = !1, e = 0; e < arguments.length; )
+    if (n = new this(arguments[e++]), n.d)
+      r.d && (r = r.plus(n.times(n)));
+    else {
+      if (n.s)
+        return W = !0, new this(1 / 0);
+      r = n;
+    }
+  return W = !0, r.sqrt();
+}
+function Ue(e) {
+  return e instanceof Be || e && e.toStringTag === rt || !1;
+}
+function Qt(e) {
+  return new this(e).ln();
+}
+function Jt(e, n) {
+  return new this(e).log(n);
+}
+function Xt(e) {
+  return new this(e).log(2);
+}
+function er(e) {
+  return new this(e).log(10);
+}
+function tr() {
+  return ot(this, arguments, -1);
+}
+function rr() {
+  return ot(this, arguments, 1);
+}
+function nr(e, n) {
+  return new this(e).mod(n);
+}
+function ir(e, n) {
+  return new this(e).mul(n);
+}
+function sr(e, n) {
+  return new this(e).pow(n);
+}
+function or(e) {
+  var n, r, t, s, i = 0, a = new this(1), u = [];
+  if (e === void 0 ? e = this.precision : Q(e, 1, ue), t = Math.ceil(e / L), this.crypto)
+    if (crypto.getRandomValues)
+      for (n = crypto.getRandomValues(new Uint32Array(t)); i < t; )
+        s = n[i], s >= 429e7 ? n[i] = crypto.getRandomValues(new Uint32Array(1))[0] : u[i++] = s % 1e7;
+    else if (crypto.randomBytes) {
+      for (n = crypto.randomBytes(t *= 4); i < t; )
+        s = n[i] + (n[i + 1] << 8) + (n[i + 2] << 16) + ((n[i + 3] & 127) << 24), s >= 214e7 ? crypto.randomBytes(4).copy(n, i) : (u.push(s % 1e7), i += 4);
+      i = t / 4;
+    } else
+      throw Error(tt);
+  else for (; i < t; ) u[i++] = Math.random() * 1e7 | 0;
+  for (t = u[--i], e %= L, t && e && (s = Y(10, L - e), u[i] = (t / s | 0) * s); u[i] === 0; i--) u.pop();
+  if (i < 0)
+    r = 0, u = [0];
+  else {
+    for (r = -1; u[0] === 0; r -= L) u.shift();
+    for (t = 1, s = u[0]; s >= 10; s /= 10) t++;
+    t < L && (r -= L - t);
+  }
+  return a.e = r, a.d = u, a;
+}
+function ar(e) {
+  return F(e = new this(e), e.e + 1, this.rounding);
+}
+function ur(e) {
+  return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
+}
+function fr(e) {
+  return new this(e).sin();
+}
+function cr(e) {
+  return new this(e).sinh();
+}
+function lr(e) {
+  return new this(e).sqrt();
+}
+function hr(e, n) {
+  return new this(e).sub(n);
+}
+function dr() {
+  var e = 0, n = arguments, r = new this(n[e]);
+  for (W = !1; r.s && ++e < n.length; ) r = r.plus(n[e]);
+  return W = !0, F(r, this.precision, this.rounding);
+}
+function pr(e) {
+  return new this(e).tan();
+}
+function vr(e) {
+  return new this(e).tanh();
+}
+function gr(e) {
+  return F(e = new this(e), e.e + 1, 1);
+}
+D[Symbol.for("nodejs.util.inspect.custom")] = D.toString;
+D[Symbol.toStringTag] = "Decimal";
+var Be = D.constructor = ft(Te);
+xe = new Be(xe);
+$e = new Be($e);
+var mr = { exports: {} };
+function wr(e) {
+  throw new Error('Could not dynamically require "' + e + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
+var Ee = { exports: {} };
+const _r = {}, yr = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  default: _r
+}, Symbol.toStringTag, { value: "Module" })), xr = /* @__PURE__ */ ht(yr);
+var We;
+function re() {
+  return We || (We = 1, function(e, n) {
+    (function(r, t) {
+      e.exports = t();
+    })(j, function() {
+      var r = r || function(t, s) {
+        var i;
+        if (typeof window < "u" && window.crypto && (i = window.crypto), typeof self < "u" && self.crypto && (i = self.crypto), typeof globalThis < "u" && globalThis.crypto && (i = globalThis.crypto), !i && typeof window < "u" && window.msCrypto && (i = window.msCrypto), !i && typeof j < "u" && j.crypto && (i = j.crypto), !i && typeof wr == "function")
+          try {
+            i = xr;
+          } catch {
+          }
+        var a = function() {
+          if (i) {
+            if (typeof i.getRandomValues == "function")
+              try {
+                return i.getRandomValues(new Uint32Array(1))[0];
+              } catch {
+              }
+            if (typeof i.randomBytes == "function")
+              try {
+                return i.randomBytes(4).readInt32LE();
+              } catch {
+              }
+          }
+          throw new Error("Native crypto module could not be used to get secure random number.");
+        }, u = Object.create || /* @__PURE__ */ function() {
+          function g() {
+          }
+          return function(d) {
+            var _;
+            return g.prototype = d, _ = new g(), g.prototype = null, _;
+          };
+        }(), f = {}, o = f.lib = {}, c = o.Base = /* @__PURE__ */ function() {
+          return {
+            /**
+             * Creates a new object that inherits from this object.
+             *
+             * @param {Object} overrides Properties to copy into the new object.
+             *
+             * @return {Object} The new object.
+             *
+             * @static
+             *
+             * @example
+             *
+             *     var MyType = CryptoJS.lib.Base.extend({
+             *         field: 'value',
+             *
+             *         method: function () {
+             *         }
+             *     });
+             */
+            extend: function(g) {
+              var d = u(this);
+              return g && d.mixIn(g), (!d.hasOwnProperty("init") || this.init === d.init) && (d.init = function() {
+                d.$super.init.apply(this, arguments);
+              }), d.init.prototype = d, d.$super = this, d;
+            },
+            /**
+             * Extends this object and runs the init method.
+             * Arguments to create() will be passed to init().
+             *
+             * @return {Object} The new object.
+             *
+             * @static
+             *
+             * @example
+             *
+             *     var instance = MyType.create();
+             */
+            create: function() {
+              var g = this.extend();
+              return g.init.apply(g, arguments), g;
+            },
+            /**
+             * Initializes a newly created object.
+             * Override this method to add some logic when your objects are created.
+             *
+             * @example
+             *
+             *     var MyType = CryptoJS.lib.Base.extend({
+             *         init: function () {
+             *             // ...
+             *         }
+             *     });
+             */
+            init: function() {
+            },
+            /**
+             * Copies properties into this object.
+             *
+             * @param {Object} properties The properties to mix in.
+             *
+             * @example
+             *
+             *     MyType.mixIn({
+             *         field: 'value'
+             *     });
+             */
+            mixIn: function(g) {
+              for (var d in g)
+                g.hasOwnProperty(d) && (this[d] = g[d]);
+              g.hasOwnProperty("toString") && (this.toString = g.toString);
+            },
+            /**
+             * Creates a copy of this object.
+             *
+             * @return {Object} The clone.
+             *
+             * @example
+             *
+             *     var clone = instance.clone();
+             */
+            clone: function() {
+              return this.init.prototype.extend(this);
+            }
+          };
+        }(), h = o.WordArray = c.extend({
+          /**
+           * Initializes a newly created word array.
+           *
+           * @param {Array} words (Optional) An array of 32-bit words.
+           * @param {number} sigBytes (Optional) The number of significant bytes in the words.
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.lib.WordArray.create();
+           *     var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
+           *     var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
+           */
+          init: function(g, d) {
+            g = this.words = g || [], d != s ? this.sigBytes = d : this.sigBytes = g.length * 4;
+          },
+          /**
+           * Converts this word array to a string.
+           *
+           * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex
+           *
+           * @return {string} The stringified word array.
+           *
+           * @example
+           *
+           *     var string = wordArray + '';
+           *     var string = wordArray.toString();
+           *     var string = wordArray.toString(CryptoJS.enc.Utf8);
+           */
+          toString: function(g) {
+            return (g || m).stringify(this);
+          },
+          /**
+           * Concatenates a word array to this word array.
+           *
+           * @param {WordArray} wordArray The word array to append.
+           *
+           * @return {WordArray} This word array.
+           *
+           * @example
+           *
+           *     wordArray1.concat(wordArray2);
+           */
+          concat: function(g) {
+            var d = this.words, _ = g.words, B = this.sigBytes, O = g.sigBytes;
+            if (this.clamp(), B % 4)
+              for (var P = 0; P < O; P++) {
+                var U = _[P >>> 2] >>> 24 - P % 4 * 8 & 255;
+                d[B + P >>> 2] |= U << 24 - (B + P) % 4 * 8;
+              }
+            else
+              for (var q = 0; q < O; q += 4)
+                d[B + q >>> 2] = _[q >>> 2];
+            return this.sigBytes += O, this;
+          },
+          /**
+           * Removes insignificant bits.
+           *
+           * @example
+           *
+           *     wordArray.clamp();
+           */
+          clamp: function() {
+            var g = this.words, d = this.sigBytes;
+            g[d >>> 2] &= 4294967295 << 32 - d % 4 * 8, g.length = t.ceil(d / 4);
+          },
+          /**
+           * Creates a copy of this word array.
+           *
+           * @return {WordArray} The clone.
+           *
+           * @example
+           *
+           *     var clone = wordArray.clone();
+           */
+          clone: function() {
+            var g = c.clone.call(this);
+            return g.words = this.words.slice(0), g;
+          },
+          /**
+           * Creates a word array filled with random bytes.
+           *
+           * @param {number} nBytes The number of random bytes to generate.
+           *
+           * @return {WordArray} The random word array.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.lib.WordArray.random(16);
+           */
+          random: function(g) {
+            for (var d = [], _ = 0; _ < g; _ += 4)
+              d.push(a());
+            return new h.init(d, g);
+          }
+        }), l = f.enc = {}, m = l.Hex = {
+          /**
+           * Converts a word array to a hex string.
+           *
+           * @param {WordArray} wordArray The word array.
+           *
+           * @return {string} The hex string.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var hexString = CryptoJS.enc.Hex.stringify(wordArray);
+           */
+          stringify: function(g) {
+            for (var d = g.words, _ = g.sigBytes, B = [], O = 0; O < _; O++) {
+              var P = d[O >>> 2] >>> 24 - O % 4 * 8 & 255;
+              B.push((P >>> 4).toString(16)), B.push((P & 15).toString(16));
+            }
+            return B.join("");
+          },
+          /**
+           * Converts a hex string to a word array.
+           *
+           * @param {string} hexStr The hex string.
+           *
+           * @return {WordArray} The word array.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.enc.Hex.parse(hexString);
+           */
+          parse: function(g) {
+            for (var d = g.length, _ = [], B = 0; B < d; B += 2)
+              _[B >>> 3] |= parseInt(g.substr(B, 2), 16) << 24 - B % 8 * 4;
+            return new h.init(_, d / 2);
+          }
+        }, $ = l.Latin1 = {
+          /**
+           * Converts a word array to a Latin1 string.
+           *
+           * @param {WordArray} wordArray The word array.
+           *
+           * @return {string} The Latin1 string.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
+           */
+          stringify: function(g) {
+            for (var d = g.words, _ = g.sigBytes, B = [], O = 0; O < _; O++) {
+              var P = d[O >>> 2] >>> 24 - O % 4 * 8 & 255;
+              B.push(String.fromCharCode(P));
+            }
+            return B.join("");
+          },
+          /**
+           * Converts a Latin1 string to a word array.
+           *
+           * @param {string} latin1Str The Latin1 string.
+           *
+           * @return {WordArray} The word array.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
+           */
+          parse: function(g) {
+            for (var d = g.length, _ = [], B = 0; B < d; B++)
+              _[B >>> 2] |= (g.charCodeAt(B) & 255) << 24 - B % 4 * 8;
+            return new h.init(_, d);
+          }
+        }, p = l.Utf8 = {
+          /**
+           * Converts a word array to a UTF-8 string.
+           *
+           * @param {WordArray} wordArray The word array.
+           *
+           * @return {string} The UTF-8 string.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);
+           */
+          stringify: function(g) {
+            try {
+              return decodeURIComponent(escape($.stringify(g)));
+            } catch {
+              throw new Error("Malformed UTF-8 data");
+            }
+          },
+          /**
+           * Converts a UTF-8 string to a word array.
+           *
+           * @param {string} utf8Str The UTF-8 string.
+           *
+           * @return {WordArray} The word array.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
+           */
+          parse: function(g) {
+            return $.parse(unescape(encodeURIComponent(g)));
+          }
+        }, N = o.BufferedBlockAlgorithm = c.extend({
+          /**
+           * Resets this block algorithm's data buffer to its initial state.
+           *
+           * @example
+           *
+           *     bufferedBlockAlgorithm.reset();
+           */
+          reset: function() {
+            this._data = new h.init(), this._nDataBytes = 0;
+          },
+          /**
+           * Adds new data to this block algorithm's buffer.
+           *
+           * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.
+           *
+           * @example
+           *
+           *     bufferedBlockAlgorithm._append('data');
+           *     bufferedBlockAlgorithm._append(wordArray);
+           */
+          _append: function(g) {
+            typeof g == "string" && (g = p.parse(g)), this._data.concat(g), this._nDataBytes += g.sigBytes;
+          },
+          /**
+           * Processes available data blocks.
+           *
+           * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.
+           *
+           * @param {boolean} doFlush Whether all blocks and partial blocks should be processed.
+           *
+           * @return {WordArray} The processed data.
+           *
+           * @example
+           *
+           *     var processedData = bufferedBlockAlgorithm._process();
+           *     var processedData = bufferedBlockAlgorithm._process(!!'flush');
+           */
+          _process: function(g) {
+            var d, _ = this._data, B = _.words, O = _.sigBytes, P = this.blockSize, U = P * 4, q = O / U;
+            g ? q = t.ceil(q) : q = t.max((q | 0) - this._minBufferSize, 0);
+            var v = q * P, w = t.min(v * 4, O);
+            if (v) {
+              for (var A = 0; A < v; A += P)
+                this._doProcessBlock(B, A);
+              d = B.splice(0, v), _.sigBytes -= w;
+            }
+            return new h.init(d, w);
+          },
+          /**
+           * Creates a copy of this object.
+           *
+           * @return {Object} The clone.
+           *
+           * @example
+           *
+           *     var clone = bufferedBlockAlgorithm.clone();
+           */
+          clone: function() {
+            var g = c.clone.call(this);
+            return g._data = this._data.clone(), g;
+          },
+          _minBufferSize: 0
+        });
+        o.Hasher = N.extend({
+          /**
+           * Configuration options.
+           */
+          cfg: c.extend(),
+          /**
+           * Initializes a newly created hasher.
+           *
+           * @param {Object} cfg (Optional) The configuration options to use for this hash computation.
+           *
+           * @example
+           *
+           *     var hasher = CryptoJS.algo.SHA256.create();
+           */
+          init: function(g) {
+            this.cfg = this.cfg.extend(g), this.reset();
+          },
+          /**
+           * Resets this hasher to its initial state.
+           *
+           * @example
+           *
+           *     hasher.reset();
+           */
+          reset: function() {
+            N.reset.call(this), this._doReset();
+          },
+          /**
+           * Updates this hasher with a message.
+           *
+           * @param {WordArray|string} messageUpdate The message to append.
+           *
+           * @return {Hasher} This hasher.
+           *
+           * @example
+           *
+           *     hasher.update('message');
+           *     hasher.update(wordArray);
+           */
+          update: function(g) {
+            return this._append(g), this._process(), this;
+          },
+          /**
+           * Finalizes the hash computation.
+           * Note that the finalize operation is effectively a destructive, read-once operation.
+           *
+           * @param {WordArray|string} messageUpdate (Optional) A final message update.
+           *
+           * @return {WordArray} The hash.
+           *
+           * @example
+           *
+           *     var hash = hasher.finalize();
+           *     var hash = hasher.finalize('message');
+           *     var hash = hasher.finalize(wordArray);
+           */
+          finalize: function(g) {
+            g && this._append(g);
+            var d = this._doFinalize();
+            return d;
+          },
+          blockSize: 16,
+          /**
+           * Creates a shortcut function to a hasher's object interface.
+           *
+           * @param {Hasher} hasher The hasher to create a helper for.
+           *
+           * @return {Function} The shortcut function.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
+           */
+          _createHelper: function(g) {
+            return function(d, _) {
+              return new g.init(_).finalize(d);
+            };
+          },
+          /**
+           * Creates a shortcut function to the HMAC's object interface.
+           *
+           * @param {Hasher} hasher The hasher to use in this HMAC helper.
+           *
+           * @return {Function} The shortcut function.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
+           */
+          _createHmacHelper: function(g) {
+            return function(d, _) {
+              return new z.HMAC.init(g, _).finalize(d);
+            };
+          }
+        });
+        var z = f.algo = {};
+        return f;
+      }(Math);
+      return r;
+    });
+  }(Ee)), Ee.exports;
+}
+var ke = { exports: {} }, Ze;
+function $r() {
+  return Ze || (Ze = 1, function(e, n) {
+    (function(r, t) {
+      e.exports = t(re());
+    })(j, function(r) {
+      return function() {
+        var t = r, s = t.lib, i = s.WordArray, a = t.enc;
+        a.Base64 = {
+          /**
+           * Converts a word array to a Base64 string.
+           *
+           * @param {WordArray} wordArray The word array.
+           *
+           * @return {string} The Base64 string.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);
+           */
+          stringify: function(f) {
+            var o = f.words, c = f.sigBytes, h = this._map;
+            f.clamp();
+            for (var l = [], m = 0; m < c; m += 3)
+              for (var $ = o[m >>> 2] >>> 24 - m % 4 * 8 & 255, p = o[m + 1 >>> 2] >>> 24 - (m + 1) % 4 * 8 & 255, N = o[m + 2 >>> 2] >>> 24 - (m + 2) % 4 * 8 & 255, z = $ << 16 | p << 8 | N, g = 0; g < 4 && m + g * 0.75 < c; g++)
+                l.push(h.charAt(z >>> 6 * (3 - g) & 63));
+            var d = h.charAt(64);
+            if (d)
+              for (; l.length % 4; )
+                l.push(d);
+            return l.join("");
+          },
+          /**
+           * Converts a Base64 string to a word array.
+           *
+           * @param {string} base64Str The Base64 string.
+           *
+           * @return {WordArray} The word array.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.enc.Base64.parse(base64String);
+           */
+          parse: function(f) {
+            var o = f.length, c = this._map, h = this._reverseMap;
+            if (!h) {
+              h = this._reverseMap = [];
+              for (var l = 0; l < c.length; l++)
+                h[c.charCodeAt(l)] = l;
+            }
+            var m = c.charAt(64);
+            if (m) {
+              var $ = f.indexOf(m);
+              $ !== -1 && (o = $);
+            }
+            return u(f, o, h);
+          },
+          _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
+        };
+        function u(f, o, c) {
+          for (var h = [], l = 0, m = 0; m < o; m++)
+            if (m % 4) {
+              var $ = c[f.charCodeAt(m - 1)] << m % 4 * 2, p = c[f.charCodeAt(m)] >>> 6 - m % 4 * 2, N = $ | p;
+              h[l >>> 2] |= N << 24 - l % 4 * 8, l++;
+            }
+          return i.create(h, l);
+        }
+      }(), r.enc.Base64;
+    });
+  }(ke)), ke.exports;
+}
+var Me = { exports: {} }, Ye;
+function Cr() {
+  return Ye || (Ye = 1, function(e, n) {
+    (function(r, t) {
+      e.exports = t(re());
+    })(j, function(r) {
+      return function(t) {
+        var s = r, i = s.lib, a = i.WordArray, u = i.Hasher, f = s.algo, o = [];
+        (function() {
+          for (var p = 0; p < 64; p++)
+            o[p] = t.abs(t.sin(p + 1)) * 4294967296 | 0;
+        })();
+        var c = f.MD5 = u.extend({
+          _doReset: function() {
+            this._hash = new a.init([
+              1732584193,
+              4023233417,
+              2562383102,
+              271733878
+            ]);
+          },
+          _doProcessBlock: function(p, N) {
+            for (var z = 0; z < 16; z++) {
+              var g = N + z, d = p[g];
+              p[g] = (d << 8 | d >>> 24) & 16711935 | (d << 24 | d >>> 8) & 4278255360;
+            }
+            var _ = this._hash.words, B = p[N + 0], O = p[N + 1], P = p[N + 2], U = p[N + 3], q = p[N + 4], v = p[N + 5], w = p[N + 6], A = p[N + 7], b = p[N + 8], M = p[N + 9], x = p[N + 10], y = p[N + 11], T = p[N + 12], H = p[N + 13], I = p[N + 14], R = p[N + 15], C = _[0], S = _[1], E = _[2], k = _[3];
+            C = h(C, S, E, k, B, 7, o[0]), k = h(k, C, S, E, O, 12, o[1]), E = h(E, k, C, S, P, 17, o[2]), S = h(S, E, k, C, U, 22, o[3]), C = h(C, S, E, k, q, 7, o[4]), k = h(k, C, S, E, v, 12, o[5]), E = h(E, k, C, S, w, 17, o[6]), S = h(S, E, k, C, A, 22, o[7]), C = h(C, S, E, k, b, 7, o[8]), k = h(k, C, S, E, M, 12, o[9]), E = h(E, k, C, S, x, 17, o[10]), S = h(S, E, k, C, y, 22, o[11]), C = h(C, S, E, k, T, 7, o[12]), k = h(k, C, S, E, H, 12, o[13]), E = h(E, k, C, S, I, 17, o[14]), S = h(S, E, k, C, R, 22, o[15]), C = l(C, S, E, k, O, 5, o[16]), k = l(k, C, S, E, w, 9, o[17]), E = l(E, k, C, S, y, 14, o[18]), S = l(S, E, k, C, B, 20, o[19]), C = l(C, S, E, k, v, 5, o[20]), k = l(k, C, S, E, x, 9, o[21]), E = l(E, k, C, S, R, 14, o[22]), S = l(S, E, k, C, q, 20, o[23]), C = l(C, S, E, k, M, 5, o[24]), k = l(k, C, S, E, I, 9, o[25]), E = l(E, k, C, S, U, 14, o[26]), S = l(S, E, k, C, b, 20, o[27]), C = l(C, S, E, k, H, 5, o[28]), k = l(k, C, S, E, P, 9, o[29]), E = l(E, k, C, S, A, 14, o[30]), S = l(S, E, k, C, T, 20, o[31]), C = m(C, S, E, k, v, 4, o[32]), k = m(k, C, S, E, b, 11, o[33]), E = m(E, k, C, S, y, 16, o[34]), S = m(S, E, k, C, I, 23, o[35]), C = m(C, S, E, k, O, 4, o[36]), k = m(k, C, S, E, q, 11, o[37]), E = m(E, k, C, S, A, 16, o[38]), S = m(S, E, k, C, x, 23, o[39]), C = m(C, S, E, k, H, 4, o[40]), k = m(k, C, S, E, B, 11, o[41]), E = m(E, k, C, S, U, 16, o[42]), S = m(S, E, k, C, w, 23, o[43]), C = m(C, S, E, k, M, 4, o[44]), k = m(k, C, S, E, T, 11, o[45]), E = m(E, k, C, S, R, 16, o[46]), S = m(S, E, k, C, P, 23, o[47]), C = $(C, S, E, k, B, 6, o[48]), k = $(k, C, S, E, A, 10, o[49]), E = $(E, k, C, S, I, 15, o[50]), S = $(S, E, k, C, v, 21, o[51]), C = $(C, S, E, k, T, 6, o[52]), k = $(k, C, S, E, U, 10, o[53]), E = $(E, k, C, S, x, 15, o[54]), S = $(S, E, k, C, O, 21, o[55]), C = $(C, S, E, k, b, 6, o[56]), k = $(k, C, S, E, R, 10, o[57]), E = $(E, k, C, S, w, 15, o[58]), S = $(S, E, k, C, H, 21, o[59]), C = $(C, S, E, k, q, 6, o[60]), k = $(k, C, S, E, y, 10, o[61]), E = $(E, k, C, S, P, 15, o[62]), S = $(S, E, k, C, M, 21, o[63]), _[0] = _[0] + C | 0, _[1] = _[1] + S | 0, _[2] = _[2] + E | 0, _[3] = _[3] + k | 0;
+          },
+          _doFinalize: function() {
+            var p = this._data, N = p.words, z = this._nDataBytes * 8, g = p.sigBytes * 8;
+            N[g >>> 5] |= 128 << 24 - g % 32;
+            var d = t.floor(z / 4294967296), _ = z;
+            N[(g + 64 >>> 9 << 4) + 15] = (d << 8 | d >>> 24) & 16711935 | (d << 24 | d >>> 8) & 4278255360, N[(g + 64 >>> 9 << 4) + 14] = (_ << 8 | _ >>> 24) & 16711935 | (_ << 24 | _ >>> 8) & 4278255360, p.sigBytes = (N.length + 1) * 4, this._process();
+            for (var B = this._hash, O = B.words, P = 0; P < 4; P++) {
+              var U = O[P];
+              O[P] = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360;
+            }
+            return B;
+          },
+          clone: function() {
+            var p = u.clone.call(this);
+            return p._hash = this._hash.clone(), p;
+          }
+        });
+        function h(p, N, z, g, d, _, B) {
+          var O = p + (N & z | ~N & g) + d + B;
+          return (O << _ | O >>> 32 - _) + N;
+        }
+        function l(p, N, z, g, d, _, B) {
+          var O = p + (N & g | z & ~g) + d + B;
+          return (O << _ | O >>> 32 - _) + N;
+        }
+        function m(p, N, z, g, d, _, B) {
+          var O = p + (N ^ z ^ g) + d + B;
+          return (O << _ | O >>> 32 - _) + N;
+        }
+        function $(p, N, z, g, d, _, B) {
+          var O = p + (z ^ (N | ~g)) + d + B;
+          return (O << _ | O >>> 32 - _) + N;
+        }
+        s.MD5 = u._createHelper(c), s.HmacMD5 = u._createHmacHelper(c);
+      }(Math), r.MD5;
+    });
+  }(Me)), Me.exports;
+}
+var be = { exports: {} }, Oe = { exports: {} }, je;
+function Nr() {
+  return je || (je = 1, function(e, n) {
+    (function(r, t) {
+      e.exports = t(re());
+    })(j, function(r) {
+      return function() {
+        var t = r, s = t.lib, i = s.WordArray, a = s.Hasher, u = t.algo, f = [], o = u.SHA1 = a.extend({
+          _doReset: function() {
+            this._hash = new i.init([
+              1732584193,
+              4023233417,
+              2562383102,
+              271733878,
+              3285377520
+            ]);
+          },
+          _doProcessBlock: function(c, h) {
+            for (var l = this._hash.words, m = l[0], $ = l[1], p = l[2], N = l[3], z = l[4], g = 0; g < 80; g++) {
+              if (g < 16)
+                f[g] = c[h + g] | 0;
+              else {
+                var d = f[g - 3] ^ f[g - 8] ^ f[g - 14] ^ f[g - 16];
+                f[g] = d << 1 | d >>> 31;
+              }
+              var _ = (m << 5 | m >>> 27) + z + f[g];
+              g < 20 ? _ += ($ & p | ~$ & N) + 1518500249 : g < 40 ? _ += ($ ^ p ^ N) + 1859775393 : g < 60 ? _ += ($ & p | $ & N | p & N) - 1894007588 : _ += ($ ^ p ^ N) - 899497514, z = N, N = p, p = $ << 30 | $ >>> 2, $ = m, m = _;
+            }
+            l[0] = l[0] + m | 0, l[1] = l[1] + $ | 0, l[2] = l[2] + p | 0, l[3] = l[3] + N | 0, l[4] = l[4] + z | 0;
+          },
+          _doFinalize: function() {
+            var c = this._data, h = c.words, l = this._nDataBytes * 8, m = c.sigBytes * 8;
+            return h[m >>> 5] |= 128 << 24 - m % 32, h[(m + 64 >>> 9 << 4) + 14] = Math.floor(l / 4294967296), h[(m + 64 >>> 9 << 4) + 15] = l, c.sigBytes = h.length * 4, this._process(), this._hash;
+          },
+          clone: function() {
+            var c = a.clone.call(this);
+            return c._hash = this._hash.clone(), c;
+          }
+        });
+        t.SHA1 = a._createHelper(o), t.HmacSHA1 = a._createHmacHelper(o);
+      }(), r.SHA1;
+    });
+  }(Oe)), Oe.exports;
+}
+var Ae = { exports: {} }, Ve;
+function Dr() {
+  return Ve || (Ve = 1, function(e, n) {
+    (function(r, t) {
+      e.exports = t(re());
+    })(j, function(r) {
+      (function() {
+        var t = r, s = t.lib, i = s.Base, a = t.enc, u = a.Utf8, f = t.algo;
+        f.HMAC = i.extend({
+          /**
+           * Initializes a newly created HMAC.
+           *
+           * @param {Hasher} hasher The hash algorithm to use.
+           * @param {WordArray|string} key The secret key.
+           *
+           * @example
+           *
+           *     var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);
+           */
+          init: function(o, c) {
+            o = this._hasher = new o.init(), typeof c == "string" && (c = u.parse(c));
+            var h = o.blockSize, l = h * 4;
+            c.sigBytes > l && (c = o.finalize(c)), c.clamp();
+            for (var m = this._oKey = c.clone(), $ = this._iKey = c.clone(), p = m.words, N = $.words, z = 0; z < h; z++)
+              p[z] ^= 1549556828, N[z] ^= 909522486;
+            m.sigBytes = $.sigBytes = l, this.reset();
+          },
+          /**
+           * Resets this HMAC to its initial state.
+           *
+           * @example
+           *
+           *     hmacHasher.reset();
+           */
+          reset: function() {
+            var o = this._hasher;
+            o.reset(), o.update(this._iKey);
+          },
+          /**
+           * Updates this HMAC with a message.
+           *
+           * @param {WordArray|string} messageUpdate The message to append.
+           *
+           * @return {HMAC} This HMAC instance.
+           *
+           * @example
+           *
+           *     hmacHasher.update('message');
+           *     hmacHasher.update(wordArray);
+           */
+          update: function(o) {
+            return this._hasher.update(o), this;
+          },
+          /**
+           * Finalizes the HMAC computation.
+           * Note that the finalize operation is effectively a destructive, read-once operation.
+           *
+           * @param {WordArray|string} messageUpdate (Optional) A final message update.
+           *
+           * @return {WordArray} The HMAC.
+           *
+           * @example
+           *
+           *     var hmac = hmacHasher.finalize();
+           *     var hmac = hmacHasher.finalize('message');
+           *     var hmac = hmacHasher.finalize(wordArray);
+           */
+          finalize: function(o) {
+            var c = this._hasher, h = c.finalize(o);
+            c.reset();
+            var l = c.finalize(this._oKey.clone().concat(h));
+            return l;
+          }
+        });
+      })();
+    });
+  }(Ae)), Ae.exports;
+}
+var Ke;
+function ct() {
+  return Ke || (Ke = 1, function(e, n) {
+    (function(r, t, s) {
+      e.exports = t(re(), Nr(), Dr());
+    })(j, function(r) {
+      return function() {
+        var t = r, s = t.lib, i = s.Base, a = s.WordArray, u = t.algo, f = u.MD5, o = u.EvpKDF = i.extend({
+          /**
+           * Configuration options.
+           *
+           * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)
+           * @property {Hasher} hasher The hash algorithm to use. Default: MD5
+           * @property {number} iterations The number of iterations to perform. Default: 1
+           */
+          cfg: i.extend({
+            keySize: 128 / 32,
+            hasher: f,
+            iterations: 1
+          }),
+          /**
+           * Initializes a newly created key derivation function.
+           *
+           * @param {Object} cfg (Optional) The configuration options to use for the derivation.
+           *
+           * @example
+           *
+           *     var kdf = CryptoJS.algo.EvpKDF.create();
+           *     var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 });
+           *     var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 });
+           */
+          init: function(c) {
+            this.cfg = this.cfg.extend(c);
+          },
+          /**
+           * Derives a key from a password.
+           *
+           * @param {WordArray|string} password The password.
+           * @param {WordArray|string} salt A salt.
+           *
+           * @return {WordArray} The derived key.
+           *
+           * @example
+           *
+           *     var key = kdf.compute(password, salt);
+           */
+          compute: function(c, h) {
+            for (var l, m = this.cfg, $ = m.hasher.create(), p = a.create(), N = p.words, z = m.keySize, g = m.iterations; N.length < z; ) {
+              l && $.update(l), l = $.update(c).finalize(h), $.reset();
+              for (var d = 1; d < g; d++)
+                l = $.finalize(l), $.reset();
+              p.concat(l);
+            }
+            return p.sigBytes = z * 4, p;
+          }
+        });
+        t.EvpKDF = function(c, h, l) {
+          return o.create(l).compute(c, h);
+        };
+      }(), r.EvpKDF;
+    });
+  }(be)), be.exports;
+}
+var ze = { exports: {} }, Ge;
+function Le() {
+  return Ge || (Ge = 1, function(e, n) {
+    (function(r, t, s) {
+      e.exports = t(re(), ct());
+    })(j, function(r) {
+      r.lib.Cipher || function(t) {
+        var s = r, i = s.lib, a = i.Base, u = i.WordArray, f = i.BufferedBlockAlgorithm, o = s.enc;
+        o.Utf8;
+        var c = o.Base64, h = s.algo, l = h.EvpKDF, m = i.Cipher = f.extend({
+          /**
+           * Configuration options.
+           *
+           * @property {WordArray} iv The IV to use for this operation.
+           */
+          cfg: a.extend(),
+          /**
+           * Creates this cipher in encryption mode.
+           *
+           * @param {WordArray} key The key.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @return {Cipher} A cipher instance.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });
+           */
+          createEncryptor: function(v, w) {
+            return this.create(this._ENC_XFORM_MODE, v, w);
+          },
+          /**
+           * Creates this cipher in decryption mode.
+           *
+           * @param {WordArray} key The key.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @return {Cipher} A cipher instance.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });
+           */
+          createDecryptor: function(v, w) {
+            return this.create(this._DEC_XFORM_MODE, v, w);
+          },
+          /**
+           * Initializes a newly created cipher.
+           *
+           * @param {number} xformMode Either the encryption or decryption transormation mode constant.
+           * @param {WordArray} key The key.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @example
+           *
+           *     var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });
+           */
+          init: function(v, w, A) {
+            this.cfg = this.cfg.extend(A), this._xformMode = v, this._key = w, this.reset();
+          },
+          /**
+           * Resets this cipher to its initial state.
+           *
+           * @example
+           *
+           *     cipher.reset();
+           */
+          reset: function() {
+            f.reset.call(this), this._doReset();
+          },
+          /**
+           * Adds data to be encrypted or decrypted.
+           *
+           * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.
+           *
+           * @return {WordArray} The data after processing.
+           *
+           * @example
+           *
+           *     var encrypted = cipher.process('data');
+           *     var encrypted = cipher.process(wordArray);
+           */
+          process: function(v) {
+            return this._append(v), this._process();
+          },
+          /**
+           * Finalizes the encryption or decryption process.
+           * Note that the finalize operation is effectively a destructive, read-once operation.
+           *
+           * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.
+           *
+           * @return {WordArray} The data after final processing.
+           *
+           * @example
+           *
+           *     var encrypted = cipher.finalize();
+           *     var encrypted = cipher.finalize('data');
+           *     var encrypted = cipher.finalize(wordArray);
+           */
+          finalize: function(v) {
+            v && this._append(v);
+            var w = this._doFinalize();
+            return w;
+          },
+          keySize: 128 / 32,
+          ivSize: 128 / 32,
+          _ENC_XFORM_MODE: 1,
+          _DEC_XFORM_MODE: 2,
+          /**
+           * Creates shortcut functions to a cipher's object interface.
+           *
+           * @param {Cipher} cipher The cipher to create a helper for.
+           *
+           * @return {Object} An object with encrypt and decrypt shortcut functions.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);
+           */
+          _createHelper: /* @__PURE__ */ function() {
+            function v(w) {
+              return typeof w == "string" ? q : O;
+            }
+            return function(w) {
+              return {
+                encrypt: function(A, b, M) {
+                  return v(b).encrypt(w, A, b, M);
+                },
+                decrypt: function(A, b, M) {
+                  return v(b).decrypt(w, A, b, M);
+                }
+              };
+            };
+          }()
+        });
+        i.StreamCipher = m.extend({
+          _doFinalize: function() {
+            var v = this._process(!0);
+            return v;
+          },
+          blockSize: 1
+        });
+        var $ = s.mode = {}, p = i.BlockCipherMode = a.extend({
+          /**
+           * Creates this mode for encryption.
+           *
+           * @param {Cipher} cipher A block cipher instance.
+           * @param {Array} iv The IV words.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);
+           */
+          createEncryptor: function(v, w) {
+            return this.Encryptor.create(v, w);
+          },
+          /**
+           * Creates this mode for decryption.
+           *
+           * @param {Cipher} cipher A block cipher instance.
+           * @param {Array} iv The IV words.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);
+           */
+          createDecryptor: function(v, w) {
+            return this.Decryptor.create(v, w);
+          },
+          /**
+           * Initializes a newly created mode.
+           *
+           * @param {Cipher} cipher A block cipher instance.
+           * @param {Array} iv The IV words.
+           *
+           * @example
+           *
+           *     var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);
+           */
+          init: function(v, w) {
+            this._cipher = v, this._iv = w;
+          }
+        }), N = $.CBC = function() {
+          var v = p.extend();
+          v.Encryptor = v.extend({
+            /**
+             * Processes the data block at offset.
+             *
+             * @param {Array} words The data words to operate on.
+             * @param {number} offset The offset where the block starts.
+             *
+             * @example
+             *
+             *     mode.processBlock(data.words, offset);
+             */
+            processBlock: function(A, b) {
+              var M = this._cipher, x = M.blockSize;
+              w.call(this, A, b, x), M.encryptBlock(A, b), this._prevBlock = A.slice(b, b + x);
+            }
+          }), v.Decryptor = v.extend({
+            /**
+             * Processes the data block at offset.
+             *
+             * @param {Array} words The data words to operate on.
+             * @param {number} offset The offset where the block starts.
+             *
+             * @example
+             *
+             *     mode.processBlock(data.words, offset);
+             */
+            processBlock: function(A, b) {
+              var M = this._cipher, x = M.blockSize, y = A.slice(b, b + x);
+              M.decryptBlock(A, b), w.call(this, A, b, x), this._prevBlock = y;
+            }
+          });
+          function w(A, b, M) {
+            var x, y = this._iv;
+            y ? (x = y, this._iv = t) : x = this._prevBlock;
+            for (var T = 0; T < M; T++)
+              A[b + T] ^= x[T];
+          }
+          return v;
+        }(), z = s.pad = {}, g = z.Pkcs7 = {
+          /**
+           * Pads data using the algorithm defined in PKCS #5/7.
+           *
+           * @param {WordArray} data The data to pad.
+           * @param {number} blockSize The multiple that the data should be padded to.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     CryptoJS.pad.Pkcs7.pad(wordArray, 4);
+           */
+          pad: function(v, w) {
+            for (var A = w * 4, b = A - v.sigBytes % A, M = b << 24 | b << 16 | b << 8 | b, x = [], y = 0; y < b; y += 4)
+              x.push(M);
+            var T = u.create(x, b);
+            v.concat(T);
+          },
+          /**
+           * Unpads data that had been padded using the algorithm defined in PKCS #5/7.
+           *
+           * @param {WordArray} data The data to unpad.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     CryptoJS.pad.Pkcs7.unpad(wordArray);
+           */
+          unpad: function(v) {
+            var w = v.words[v.sigBytes - 1 >>> 2] & 255;
+            v.sigBytes -= w;
+          }
+        };
+        i.BlockCipher = m.extend({
+          /**
+           * Configuration options.
+           *
+           * @property {Mode} mode The block mode to use. Default: CBC
+           * @property {Padding} padding The padding strategy to use. Default: Pkcs7
+           */
+          cfg: m.cfg.extend({
+            mode: N,
+            padding: g
+          }),
+          reset: function() {
+            var v;
+            m.reset.call(this);
+            var w = this.cfg, A = w.iv, b = w.mode;
+            this._xformMode == this._ENC_XFORM_MODE ? v = b.createEncryptor : (v = b.createDecryptor, this._minBufferSize = 1), this._mode && this._mode.__creator == v ? this._mode.init(this, A && A.words) : (this._mode = v.call(b, this, A && A.words), this._mode.__creator = v);
+          },
+          _doProcessBlock: function(v, w) {
+            this._mode.processBlock(v, w);
+          },
+          _doFinalize: function() {
+            var v, w = this.cfg.padding;
+            return this._xformMode == this._ENC_XFORM_MODE ? (w.pad(this._data, this.blockSize), v = this._process(!0)) : (v = this._process(!0), w.unpad(v)), v;
+          },
+          blockSize: 128 / 32
+        });
+        var d = i.CipherParams = a.extend({
+          /**
+           * Initializes a newly created cipher params object.
+           *
+           * @param {Object} cipherParams An object with any of the possible cipher parameters.
+           *
+           * @example
+           *
+           *     var cipherParams = CryptoJS.lib.CipherParams.create({
+           *         ciphertext: ciphertextWordArray,
+           *         key: keyWordArray,
+           *         iv: ivWordArray,
+           *         salt: saltWordArray,
+           *         algorithm: CryptoJS.algo.AES,
+           *         mode: CryptoJS.mode.CBC,
+           *         padding: CryptoJS.pad.PKCS7,
+           *         blockSize: 4,
+           *         formatter: CryptoJS.format.OpenSSL
+           *     });
+           */
+          init: function(v) {
+            this.mixIn(v);
+          },
+          /**
+           * Converts this cipher params object to a string.
+           *
+           * @param {Format} formatter (Optional) The formatting strategy to use.
+           *
+           * @return {string} The stringified cipher params.
+           *
+           * @throws Error If neither the formatter nor the default formatter is set.
+           *
+           * @example
+           *
+           *     var string = cipherParams + '';
+           *     var string = cipherParams.toString();
+           *     var string = cipherParams.toString(CryptoJS.format.OpenSSL);
+           */
+          toString: function(v) {
+            return (v || this.formatter).stringify(this);
+          }
+        }), _ = s.format = {}, B = _.OpenSSL = {
+          /**
+           * Converts a cipher params object to an OpenSSL-compatible string.
+           *
+           * @param {CipherParams} cipherParams The cipher params object.
+           *
+           * @return {string} The OpenSSL-compatible string.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);
+           */
+          stringify: function(v) {
+            var w, A = v.ciphertext, b = v.salt;
+            return b ? w = u.create([1398893684, 1701076831]).concat(b).concat(A) : w = A, w.toString(c);
+          },
+          /**
+           * Converts an OpenSSL-compatible string to a cipher params object.
+           *
+           * @param {string} openSSLStr The OpenSSL-compatible string.
+           *
+           * @return {CipherParams} The cipher params object.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);
+           */
+          parse: function(v) {
+            var w, A = c.parse(v), b = A.words;
+            return b[0] == 1398893684 && b[1] == 1701076831 && (w = u.create(b.slice(2, 4)), b.splice(0, 4), A.sigBytes -= 16), d.create({ ciphertext: A, salt: w });
+          }
+        }, O = i.SerializableCipher = a.extend({
+          /**
+           * Configuration options.
+           *
+           * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL
+           */
+          cfg: a.extend({
+            format: B
+          }),
+          /**
+           * Encrypts a message.
+           *
+           * @param {Cipher} cipher The cipher algorithm to use.
+           * @param {WordArray|string} message The message to encrypt.
+           * @param {WordArray} key The key.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @return {CipherParams} A cipher params object.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);
+           *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });
+           *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });
+           */
+          encrypt: function(v, w, A, b) {
+            b = this.cfg.extend(b);
+            var M = v.createEncryptor(A, b), x = M.finalize(w), y = M.cfg;
+            return d.create({
+              ciphertext: x,
+              key: A,
+              iv: y.iv,
+              algorithm: v,
+              mode: y.mode,
+              padding: y.padding,
+              blockSize: v.blockSize,
+              formatter: b.format
+            });
+          },
+          /**
+           * Decrypts serialized ciphertext.
+           *
+           * @param {Cipher} cipher The cipher algorithm to use.
+           * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
+           * @param {WordArray} key The key.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @return {WordArray} The plaintext.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });
+           *     var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });
+           */
+          decrypt: function(v, w, A, b) {
+            b = this.cfg.extend(b), w = this._parse(w, b.format);
+            var M = v.createDecryptor(A, b).finalize(w.ciphertext);
+            return M;
+          },
+          /**
+           * Converts serialized ciphertext to CipherParams,
+           * else assumed CipherParams already and returns ciphertext unchanged.
+           *
+           * @param {CipherParams|string} ciphertext The ciphertext.
+           * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.
+           *
+           * @return {CipherParams} The unserialized ciphertext.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);
+           */
+          _parse: function(v, w) {
+            return typeof v == "string" ? w.parse(v, this) : v;
+          }
+        }), P = s.kdf = {}, U = P.OpenSSL = {
+          /**
+           * Derives a key and IV from a password.
+           *
+           * @param {string} password The password to derive from.
+           * @param {number} keySize The size in words of the key to generate.
+           * @param {number} ivSize The size in words of the IV to generate.
+           * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.
+           *
+           * @return {CipherParams} A cipher params object with the key, IV, and salt.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);
+           *     var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');
+           */
+          execute: function(v, w, A, b, M) {
+            if (b || (b = u.random(64 / 8)), M)
+              var x = l.create({ keySize: w + A, hasher: M }).compute(v, b);
+            else
+              var x = l.create({ keySize: w + A }).compute(v, b);
+            var y = u.create(x.words.slice(w), A * 4);
+            return x.sigBytes = w * 4, d.create({ key: x, iv: y, salt: b });
+          }
+        }, q = i.PasswordBasedCipher = O.extend({
+          /**
+           * Configuration options.
+           *
+           * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL
+           */
+          cfg: O.cfg.extend({
+            kdf: U
+          }),
+          /**
+           * Encrypts a message using a password.
+           *
+           * @param {Cipher} cipher The cipher algorithm to use.
+           * @param {WordArray|string} message The message to encrypt.
+           * @param {string} password The password.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @return {CipherParams} A cipher params object.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');
+           *     var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });
+           */
+          encrypt: function(v, w, A, b) {
+            b = this.cfg.extend(b);
+            var M = b.kdf.execute(A, v.keySize, v.ivSize, b.salt, b.hasher);
+            b.iv = M.iv;
+            var x = O.encrypt.call(this, v, w, M.key, b);
+            return x.mixIn(M), x;
+          },
+          /**
+           * Decrypts serialized ciphertext using a password.
+           *
+           * @param {Cipher} cipher The cipher algorithm to use.
+           * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
+           * @param {string} password The password.
+           * @param {Object} cfg (Optional) The configuration options to use for this operation.
+           *
+           * @return {WordArray} The plaintext.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });
+           *     var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });
+           */
+          decrypt: function(v, w, A, b) {
+            b = this.cfg.extend(b), w = this._parse(w, b.format);
+            var M = b.kdf.execute(A, v.keySize, v.ivSize, w.salt, b.hasher);
+            b.iv = M.iv;
+            var x = O.decrypt.call(this, v, w, M.key, b);
+            return x;
+          }
+        });
+      }();
+    });
+  }(ze)), ze.exports;
+}
+(function(e, n) {
+  (function(r, t, s) {
+    e.exports = t(re(), $r(), Cr(), ct(), Le());
+  })(j, function(r) {
+    return function() {
+      var t = r, s = t.lib, i = s.BlockCipher, a = t.algo, u = [], f = [], o = [], c = [], h = [], l = [], m = [], $ = [], p = [], N = [];
+      (function() {
+        for (var d = [], _ = 0; _ < 256; _++)
+          _ < 128 ? d[_] = _ << 1 : d[_] = _ << 1 ^ 283;
+        for (var B = 0, O = 0, _ = 0; _ < 256; _++) {
+          var P = O ^ O << 1 ^ O << 2 ^ O << 3 ^ O << 4;
+          P = P >>> 8 ^ P & 255 ^ 99, u[B] = P, f[P] = B;
+          var U = d[B], q = d[U], v = d[q], w = d[P] * 257 ^ P * 16843008;
+          o[B] = w << 24 | w >>> 8, c[B] = w << 16 | w >>> 16, h[B] = w << 8 | w >>> 24, l[B] = w;
+          var w = v * 16843009 ^ q * 65537 ^ U * 257 ^ B * 16843008;
+          m[P] = w << 24 | w >>> 8, $[P] = w << 16 | w >>> 16, p[P] = w << 8 | w >>> 24, N[P] = w, B ? (B = U ^ d[d[d[v ^ U]]], O ^= d[d[O]]) : B = O = 1;
+        }
+      })();
+      var z = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], g = a.AES = i.extend({
+        _doReset: function() {
+          var d;
+          if (!(this._nRounds && this._keyPriorReset === this._key)) {
+            for (var _ = this._keyPriorReset = this._key, B = _.words, O = _.sigBytes / 4, P = this._nRounds = O + 6, U = (P + 1) * 4, q = this._keySchedule = [], v = 0; v < U; v++)
+              v < O ? q[v] = B[v] : (d = q[v - 1], v % O ? O > 6 && v % O == 4 && (d = u[d >>> 24] << 24 | u[d >>> 16 & 255] << 16 | u[d >>> 8 & 255] << 8 | u[d & 255]) : (d = d << 8 | d >>> 24, d = u[d >>> 24] << 24 | u[d >>> 16 & 255] << 16 | u[d >>> 8 & 255] << 8 | u[d & 255], d ^= z[v / O | 0] << 24), q[v] = q[v - O] ^ d);
+            for (var w = this._invKeySchedule = [], A = 0; A < U; A++) {
+              var v = U - A;
+              if (A % 4)
+                var d = q[v];
+              else
+                var d = q[v - 4];
+              A < 4 || v <= 4 ? w[A] = d : w[A] = m[u[d >>> 24]] ^ $[u[d >>> 16 & 255]] ^ p[u[d >>> 8 & 255]] ^ N[u[d & 255]];
+            }
+          }
+        },
+        encryptBlock: function(d, _) {
+          this._doCryptBlock(d, _, this._keySchedule, o, c, h, l, u);
+        },
+        decryptBlock: function(d, _) {
+          var B = d[_ + 1];
+          d[_ + 1] = d[_ + 3], d[_ + 3] = B, this._doCryptBlock(d, _, this._invKeySchedule, m, $, p, N, f);
+          var B = d[_ + 1];
+          d[_ + 1] = d[_ + 3], d[_ + 3] = B;
+        },
+        _doCryptBlock: function(d, _, B, O, P, U, q, v) {
+          for (var w = this._nRounds, A = d[_] ^ B[0], b = d[_ + 1] ^ B[1], M = d[_ + 2] ^ B[2], x = d[_ + 3] ^ B[3], y = 4, T = 1; T < w; T++) {
+            var H = O[A >>> 24] ^ P[b >>> 16 & 255] ^ U[M >>> 8 & 255] ^ q[x & 255] ^ B[y++], I = O[b >>> 24] ^ P[M >>> 16 & 255] ^ U[x >>> 8 & 255] ^ q[A & 255] ^ B[y++], R = O[M >>> 24] ^ P[x >>> 16 & 255] ^ U[A >>> 8 & 255] ^ q[b & 255] ^ B[y++], C = O[x >>> 24] ^ P[A >>> 16 & 255] ^ U[b >>> 8 & 255] ^ q[M & 255] ^ B[y++];
+            A = H, b = I, M = R, x = C;
+          }
+          var H = (v[A >>> 24] << 24 | v[b >>> 16 & 255] << 16 | v[M >>> 8 & 255] << 8 | v[x & 255]) ^ B[y++], I = (v[b >>> 24] << 24 | v[M >>> 16 & 255] << 16 | v[x >>> 8 & 255] << 8 | v[A & 255]) ^ B[y++], R = (v[M >>> 24] << 24 | v[x >>> 16 & 255] << 16 | v[A >>> 8 & 255] << 8 | v[b & 255]) ^ B[y++], C = (v[x >>> 24] << 24 | v[A >>> 16 & 255] << 16 | v[b >>> 8 & 255] << 8 | v[M & 255]) ^ B[y++];
+          d[_] = H, d[_ + 1] = I, d[_ + 2] = R, d[_ + 3] = C;
+        },
+        keySize: 256 / 32
+      });
+      t.AES = i._createHelper(g);
+    }(), r.AES;
+  });
+})(mr);
+var Sr = { exports: {} };
+(function(e, n) {
+  (function(r, t) {
+    e.exports = t(re());
+  })(j, function(r) {
+    return r.enc.Utf8;
+  });
+})(Sr);
+var Br = { exports: {} };
+(function(e, n) {
+  (function(r, t, s) {
+    e.exports = t(re(), Le());
+  })(j, function(r) {
+    return r.mode.ECB = function() {
+      var t = r.lib.BlockCipherMode.extend();
+      return t.Encryptor = t.extend({
+        processBlock: function(s, i) {
+          this._cipher.encryptBlock(s, i);
+        }
+      }), t.Decryptor = t.extend({
+        processBlock: function(s, i) {
+          this._cipher.decryptBlock(s, i);
+        }
+      }), t;
+    }(), r.mode.ECB;
+  });
+})(Br);
+var Er = { exports: {} };
+(function(e, n) {
+  (function(r, t, s) {
+    e.exports = t(re(), Le());
+  })(j, function(r) {
+    return r.pad.Pkcs7;
+  });
+})(Er);
+export {
+  Be as D,
+  xt as a,
+  Or as b,
+  Je as c,
+  kr as d,
+  zr as e,
+  pt as f,
+  Hr as g,
+  Mr as h,
+  _t as i,
+  yt as j,
+  Ar as k,
+  wt as l,
+  br as m,
+  j as n,
+  lt as o
+};