@burdenoff/microfe-timecampus 2026.707.1 → 2026.710.2

package/dist/node_modules/decimal.js-light/decimal.js

@@ -1,378 +0,0 @@
-import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
-//#region node_modules/decimal.js-light/decimal.js
-var t = /* @__PURE__ */ e(((e, t) => {
-	(function(e) {
-		var n = 1e9, r = {
-			precision: 20,
-			rounding: 4,
-			toExpNeg: -7,
-			toExpPos: 21,
-			LN10: "2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286"
-		}, i = !0, a = "[DecimalError] ", o = a + "Invalid argument: ", s = a + "Exponent out of range: ", c = Math.floor, l = Math.pow, u = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, d, f = 1e7, p = 7, m = 9007199254740991, h = c(m / p), g = {};
-		g.absoluteValue = g.abs = function() {
-			var e = new this.constructor(this);
-			return e.s &&= 1, e;
-		}, g.comparedTo = g.cmp = function(e) {
-			var t, n, r, i, a = this;
-			if (e = new a.constructor(e), a.s !== e.s) return a.s || -e.s;
-			if (a.e !== e.e) return a.e > e.e ^ a.s < 0 ? 1 : -1;
-			for (r = a.d.length, i = e.d.length, t = 0, n = r < i ? r : i; t < n; ++t) if (a.d[t] !== e.d[t]) return a.d[t] > e.d[t] ^ a.s < 0 ? 1 : -1;
-			return r === i ? 0 : r > i ^ a.s < 0 ? 1 : -1;
-		}, g.decimalPlaces = g.dp = function() {
-			var e = this, t = e.d.length - 1, n = (t - e.e) * p;
-			if (t = e.d[t], t) for (; t % 10 == 0; t /= 10) n--;
-			return n < 0 ? 0 : n;
-		}, g.dividedBy = g.div = function(e) {
-			return b(this, new this.constructor(e));
-		}, g.dividedToIntegerBy = g.idiv = function(e) {
-			var t = this, n = t.constructor;
-			return D(b(t, new n(e), 0, 1), n.precision);
-		}, g.equals = g.eq = function(e) {
-			return !this.cmp(e);
-		}, g.exponent = function() {
-			return S(this);
-		}, g.greaterThan = g.gt = function(e) {
-			return this.cmp(e) > 0;
-		}, g.greaterThanOrEqualTo = g.gte = function(e) {
-			return this.cmp(e) >= 0;
-		}, g.isInteger = g.isint = function() {
-			return this.e > this.d.length - 2;
-		}, g.isNegative = g.isneg = function() {
-			return this.s < 0;
-		}, g.isPositive = g.ispos = function() {
-			return this.s > 0;
-		}, g.isZero = function() {
-			return this.s === 0;
-		}, g.lessThan = g.lt = function(e) {
-			return this.cmp(e) < 0;
-		}, g.lessThanOrEqualTo = g.lte = function(e) {
-			return this.cmp(e) < 1;
-		}, g.logarithm = g.log = function(e) {
-			var t, n = this, r = n.constructor, o = r.precision, s = o + 5;
-			if (e === void 0) e = new r(10);
-			else if (e = new r(e), e.s < 1 || e.eq(d)) throw Error(a + "NaN");
-			if (n.s < 1) throw Error(a + (n.s ? "NaN" : "-Infinity"));
-			return n.eq(d) ? new r(0) : (i = !1, t = b(T(n, s), T(e, s), s), i = !0, D(t, o));
-		}, g.minus = g.sub = function(e) {
-			var t = this;
-			return e = new t.constructor(e), t.s == e.s ? O(t, e) : _(t, (e.s = -e.s, e));
-		}, g.modulo = g.mod = function(e) {
-			var t, n = this, r = n.constructor, o = r.precision;
-			if (e = new r(e), !e.s) throw Error(a + "NaN");
-			return n.s ? (i = !1, t = b(n, e, 0, 1).times(e), i = !0, n.minus(t)) : D(new r(n), o);
-		}, g.naturalExponential = g.exp = function() {
-			return x(this);
-		}, g.naturalLogarithm = g.ln = function() {
-			return T(this);
-		}, g.negated = g.neg = function() {
-			var e = new this.constructor(this);
-			return e.s = -e.s || 0, e;
-		}, g.plus = g.add = function(e) {
-			var t = this;
-			return e = new t.constructor(e), t.s == e.s ? _(t, e) : O(t, (e.s = -e.s, e));
-		}, g.precision = g.sd = function(e) {
-			var t, n, r, i = this;
-			if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(o + e);
-			if (t = S(i) + 1, r = i.d.length - 1, n = r * p + 1, r = i.d[r], r) {
-				for (; r % 10 == 0; r /= 10) n--;
-				for (r = i.d[0]; r >= 10; r /= 10) n++;
-			}
-			return e && t > n ? t : n;
-		}, g.squareRoot = g.sqrt = function() {
-			var e, t, n, r, o, s, l, u = this, d = u.constructor;
-			if (u.s < 1) {
-				if (!u.s) return new d(0);
-				throw Error(a + "NaN");
-			}
-			for (e = S(u), i = !1, o = Math.sqrt(+u), o == 0 || o == Infinity ? (t = y(u.d), (t.length + e) % 2 == 0 && (t += "0"), o = Math.sqrt(t), e = c((e + 1) / 2) - (e < 0 || e % 2), o == Infinity ? t = "5e" + e : (t = o.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + e), r = new d(t)) : r = new d(o.toString()), n = d.precision, o = l = n + 3;;) if (s = r, r = s.plus(b(u, s, l + 2)).times(.5), y(s.d).slice(0, l) === (t = y(r.d)).slice(0, l)) {
-				if (t = t.slice(l - 3, l + 1), o == l && t == "4999") {
-					if (D(s, n + 1, 0), s.times(s).eq(u)) {
-						r = s;
-						break;
-					}
-				} else if (t != "9999") break;
-				l += 4;
-			}
-			return i = !0, D(r, n);
-		}, g.times = g.mul = function(e) {
-			var t, n, r, a, o, s, c, l, u, d = this, p = d.constructor, m = d.d, h = (e = new p(e)).d;
-			if (!d.s || !e.s) return new p(0);
-			for (e.s *= d.s, n = d.e + e.e, l = m.length, u = h.length, l < u && (o = m, m = h, h = o, s = l, l = u, u = s), o = [], s = l + u, r = s; r--;) o.push(0);
-			for (r = u; --r >= 0;) {
-				for (t = 0, a = l + r; a > r;) c = o[a] + h[r] * m[a - r - 1] + t, o[a--] = c % f | 0, t = c / f | 0;
-				o[a] = (o[a] + t) % f | 0;
-			}
-			for (; !o[--s];) o.pop();
-			return t ? ++n : o.shift(), e.d = o, e.e = n, i ? D(e, p.precision) : e;
-		}, g.toDecimalPlaces = g.todp = function(e, t) {
-			var r = this, i = r.constructor;
-			return r = new i(r), e === void 0 ? r : (v(e, 0, n), t === void 0 ? t = i.rounding : v(t, 0, 8), D(r, e + S(r) + 1, t));
-		}, g.toExponential = function(e, t) {
-			var r, i = this, a = i.constructor;
-			return e === void 0 ? r = k(i, !0) : (v(e, 0, n), t === void 0 ? t = a.rounding : v(t, 0, 8), i = D(new a(i), e + 1, t), r = k(i, !0, e + 1)), r;
-		}, g.toFixed = function(e, t) {
-			var r, i, a = this, o = a.constructor;
-			return e === void 0 ? k(a) : (v(e, 0, n), t === void 0 ? t = o.rounding : v(t, 0, 8), i = D(new o(a), e + S(a) + 1, t), r = k(i.abs(), !1, e + S(i) + 1), a.isneg() && !a.isZero() ? "-" + r : r);
-		}, g.toInteger = g.toint = function() {
-			var e = this, t = e.constructor;
-			return D(new t(e), S(e) + 1, t.rounding);
-		}, g.toNumber = function() {
-			return +this;
-		}, g.toPower = g.pow = function(e) {
-			var t, n, r, o, s, l, u = this, f = u.constructor, h = 12, g = +(e = new f(e));
-			if (!e.s) return new f(d);
-			if (u = new f(u), !u.s) {
-				if (e.s < 1) throw Error(a + "Infinity");
-				return u;
-			}
-			if (u.eq(d)) return u;
-			if (r = f.precision, e.eq(d)) return D(u, r);
-			if (t = e.e, n = e.d.length - 1, l = t >= n, s = u.s, !l) {
-				if (s < 0) throw Error(a + "NaN");
-			} else if ((n = g < 0 ? -g : g) <= m) {
-				for (o = new f(d), t = Math.ceil(r / p + 4), i = !1; n % 2 && (o = o.times(u), A(o.d, t)), n = c(n / 2), n !== 0;) u = u.times(u), A(u.d, t);
-				return i = !0, e.s < 0 ? new f(d).div(o) : D(o, r);
-			}
-			return s = s < 0 && e.d[Math.max(t, n)] & 1 ? -1 : 1, u.s = 1, i = !1, o = e.times(T(u, r + h)), i = !0, o = x(o), o.s = s, o;
-		}, g.toPrecision = function(e, t) {
-			var r, i, a = this, o = a.constructor;
-			return e === void 0 ? (r = S(a), i = k(a, r <= o.toExpNeg || r >= o.toExpPos)) : (v(e, 1, n), t === void 0 ? t = o.rounding : v(t, 0, 8), a = D(new o(a), e, t), r = S(a), i = k(a, e <= r || r <= o.toExpNeg, e)), i;
-		}, g.toSignificantDigits = g.tosd = function(e, t) {
-			var r = this, i = r.constructor;
-			return e === void 0 ? (e = i.precision, t = i.rounding) : (v(e, 1, n), t === void 0 ? t = i.rounding : v(t, 0, 8)), D(new i(r), e, t);
-		}, g.toString = g.valueOf = g.val = g.toJSON = function() {
-			var e = this, t = S(e), n = e.constructor;
-			return k(e, t <= n.toExpNeg || t >= n.toExpPos);
-		};
-		function _(e, t) {
-			var n, r, a, o, s, c, l, u, d = e.constructor, m = d.precision;
-			if (!e.s || !t.s) return t.s || (t = new d(e)), i ? D(t, m) : t;
-			if (l = e.d, u = t.d, s = e.e, a = t.e, l = l.slice(), o = s - a, o) {
-				for (o < 0 ? (r = l, o = -o, c = u.length) : (r = u, a = s, c = l.length), s = Math.ceil(m / p), c = s > c ? s + 1 : c + 1, o > c && (o = c, r.length = 1), r.reverse(); o--;) r.push(0);
-				r.reverse();
-			}
-			for (c = l.length, o = u.length, c - o < 0 && (o = c, r = u, u = l, l = r), n = 0; o;) n = (l[--o] = l[o] + u[o] + n) / f | 0, l[o] %= f;
-			for (n && (l.unshift(n), ++a), c = l.length; l[--c] == 0;) l.pop();
-			return t.d = l, t.e = a, i ? D(t, m) : t;
-		}
-		function v(e, t, n) {
-			if (e !== ~~e || e < t || e > n) throw Error(o + e);
-		}
-		function y(e) {
-			var t, n, r, i = e.length - 1, a = "", o = e[0];
-			if (i > 0) {
-				for (a += o, t = 1; t < i; t++) r = e[t] + "", n = p - r.length, n && (a += w(n)), a += r;
-				o = e[t], r = o + "", n = p - r.length, n && (a += w(n));
-			} else if (o === 0) return "0";
-			for (; o % 10 == 0;) o /= 10;
-			return a + o;
-		}
-		var b = (function() {
-			function e(e, t) {
-				var n, r = 0, i = e.length;
-				for (e = e.slice(); i--;) n = e[i] * t + r, e[i] = n % f | 0, r = n / f | 0;
-				return r && e.unshift(r), e;
-			}
-			function t(e, t, n, r) {
-				var i, a;
-				if (n != r) a = n > r ? 1 : -1;
-				else for (i = a = 0; i < n; i++) if (e[i] != t[i]) {
-					a = e[i] > t[i] ? 1 : -1;
-					break;
-				}
-				return a;
-			}
-			function n(e, t, n) {
-				for (var r = 0; n--;) e[n] -= r, r = +(e[n] < t[n]), e[n] = r * f + e[n] - t[n];
-				for (; !e[0] && e.length > 1;) e.shift();
-			}
-			return function(r, i, o, s) {
-				var c, l, u, d, m, h, g, _, v, y, b, x, C, w, T, E, O, k, A = r.constructor, j = r.s == i.s ? 1 : -1, M = r.d, N = i.d;
-				if (!r.s) return new A(r);
-				if (!i.s) throw Error(a + "Division by zero");
-				for (l = r.e - i.e, O = N.length, T = M.length, g = new A(j), _ = g.d = [], u = 0; N[u] == (M[u] || 0);) ++u;
-				if (N[u] > (M[u] || 0) && --l, x = o == null ? o = A.precision : s ? o + (S(r) - S(i)) + 1 : o, x < 0) return new A(0);
-				if (x = x / p + 2 | 0, u = 0, O == 1) for (d = 0, N = N[0], x++; (u < T || d) && x--; u++) C = d * f + (M[u] || 0), _[u] = C / N | 0, d = C % N | 0;
-				else {
-					for (d = f / (N[0] + 1) | 0, d > 1 && (N = e(N, d), M = e(M, d), O = N.length, T = M.length), w = O, v = M.slice(0, O), y = v.length; y < O;) v[y++] = 0;
-					k = N.slice(), k.unshift(0), E = N[0], N[1] >= f / 2 && ++E;
-					do
-						d = 0, c = t(N, v, O, y), c < 0 ? (b = v[0], O != y && (b = b * f + (v[1] || 0)), d = b / E | 0, d > 1 ? (d >= f && (d = f - 1), m = e(N, d), h = m.length, y = v.length, c = t(m, v, h, y), c == 1 && (d--, n(m, O < h ? k : N, h))) : (d == 0 && (c = d = 1), m = N.slice()), h = m.length, h < y && m.unshift(0), n(v, m, y), c == -1 && (y = v.length, c = t(N, v, O, y), c < 1 && (d++, n(v, O < y ? k : N, y))), y = v.length) : c === 0 && (d++, v = [0]), _[u++] = d, c && v[0] ? v[y++] = M[w] || 0 : (v = [M[w]], y = 1);
-					while ((w++ < T || v[0] !== void 0) && x--);
-				}
-				return _[0] || _.shift(), g.e = l, D(g, s ? o + S(g) + 1 : o);
-			};
-		})();
-		function x(e, t) {
-			var n, r, a, o, c, u, f = 0, p = 0, m = e.constructor, h = m.precision;
-			if (S(e) > 16) throw Error(s + S(e));
-			if (!e.s) return new m(d);
-			for (t == null ? (i = !1, u = h) : u = t, c = new m(.03125); e.abs().gte(.1);) e = e.times(c), p += 5;
-			for (r = Math.log(l(2, p)) / Math.LN10 * 2 + 5 | 0, u += r, n = a = o = new m(d), m.precision = u;;) {
-				if (a = D(a.times(e), u), n = n.times(++f), c = o.plus(b(a, n, u)), y(c.d).slice(0, u) === y(o.d).slice(0, u)) {
-					for (; p--;) o = D(o.times(o), u);
-					return m.precision = h, t == null ? (i = !0, D(o, h)) : o;
-				}
-				o = c;
-			}
-		}
-		function S(e) {
-			for (var t = e.e * p, n = e.d[0]; n >= 10; n /= 10) t++;
-			return t;
-		}
-		function C(e, t, n) {
-			if (t > e.LN10.sd()) throw i = !0, n && (e.precision = n), Error(a + "LN10 precision limit exceeded");
-			return D(new e(e.LN10), t);
-		}
-		function w(e) {
-			for (var t = ""; e--;) t += "0";
-			return t;
-		}
-		function T(e, t) {
-			var n, r, o, s, c, l, u, f, p, m = 1, h = 10, g = e, _ = g.d, v = g.constructor, x = v.precision;
-			if (g.s < 1) throw Error(a + (g.s ? "NaN" : "-Infinity"));
-			if (g.eq(d)) return new v(0);
-			if (t == null ? (i = !1, f = x) : f = t, g.eq(10)) return t ?? (i = !0), C(v, f);
-			if (f += h, v.precision = f, n = y(_), r = n.charAt(0), s = S(g), Math.abs(s) < 0x5543df729c000) {
-				for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3;) g = g.times(e), n = y(g.d), r = n.charAt(0), m++;
-				s = S(g), r > 1 ? (g = new v("0." + n), s++) : g = new v(r + "." + n.slice(1));
-			} else return u = C(v, f + 2, x).times(s + ""), g = T(new v(r + "." + n.slice(1)), f - h).plus(u), v.precision = x, t == null ? (i = !0, D(g, x)) : g;
-			for (l = c = g = b(g.minus(d), g.plus(d), f), p = D(g.times(g), f), o = 3;;) {
-				if (c = D(c.times(p), f), u = l.plus(b(c, new v(o), f)), y(u.d).slice(0, f) === y(l.d).slice(0, f)) return l = l.times(2), s !== 0 && (l = l.plus(C(v, f + 2, x).times(s + ""))), l = b(l, new v(m), f), v.precision = x, t == null ? (i = !0, D(l, x)) : l;
-				l = u, o += 2;
-			}
-		}
-		function E(e, t) {
-			var n, r, a;
-			for ((n = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (r = t.search(/e/i)) > 0 ? (n < 0 && (n = r), n += +t.slice(r + 1), t = t.substring(0, r)) : n < 0 && (n = t.length), r = 0; t.charCodeAt(r) === 48;) ++r;
-			for (a = t.length; t.charCodeAt(a - 1) === 48;) --a;
-			if (t = t.slice(r, a), t) {
-				if (a -= r, n = n - r - 1, e.e = c(n / p), e.d = [], r = (n + 1) % p, n < 0 && (r += p), r < a) {
-					for (r && e.d.push(+t.slice(0, r)), a -= p; r < a;) e.d.push(+t.slice(r, r += p));
-					t = t.slice(r), r = p - t.length;
-				} else r -= a;
-				for (; r--;) t += "0";
-				if (e.d.push(+t), i && (e.e > h || e.e < -h)) throw Error(s + n);
-			} else e.s = 0, e.e = 0, e.d = [0];
-			return e;
-		}
-		function D(e, t, n) {
-			var r, a, o, u, d, m, g, _, v = e.d;
-			for (u = 1, o = v[0]; o >= 10; o /= 10) u++;
-			if (r = t - u, r < 0) r += p, a = t, g = v[_ = 0];
-			else {
-				if (_ = Math.ceil((r + 1) / p), o = v.length, _ >= o) return e;
-				for (g = o = v[_], u = 1; o >= 10; o /= 10) u++;
-				r %= p, a = r - p + u;
-			}
-			if (n !== void 0 && (o = l(10, u - a - 1), d = g / o % 10 | 0, m = t < 0 || v[_ + 1] !== void 0 || g % o, m = n < 4 ? (d || m) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : d > 5 || d == 5 && (n == 4 || m || n == 6 && (r > 0 ? a > 0 ? g / l(10, u - a) : 0 : v[_ - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7))), t < 1 || !v[0]) return m ? (o = S(e), v.length = 1, t = t - o - 1, v[0] = l(10, (p - t % p) % p), e.e = c(-t / p) || 0) : (v.length = 1, v[0] = e.e = e.s = 0), e;
-			if (r == 0 ? (v.length = _, o = 1, _--) : (v.length = _ + 1, o = l(10, p - r), v[_] = a > 0 ? (g / l(10, u - a) % l(10, a) | 0) * o : 0), m) for (;;) if (_ == 0) {
-				(v[0] += o) == f && (v[0] = 1, ++e.e);
-				break;
-			} else {
-				if (v[_] += o, v[_] != f) break;
-				v[_--] = 0, o = 1;
-			}
-			for (r = v.length; v[--r] === 0;) v.pop();
-			if (i && (e.e > h || e.e < -h)) throw Error(s + S(e));
-			return e;
-		}
-		function O(e, t) {
-			var n, r, a, o, s, c, l, u, d, m, h = e.constructor, g = h.precision;
-			if (!e.s || !t.s) return t.s ? t.s = -t.s : t = new h(e), i ? D(t, g) : t;
-			if (l = e.d, m = t.d, r = t.e, u = e.e, l = l.slice(), s = u - r, s) {
-				for (d = s < 0, d ? (n = l, s = -s, c = m.length) : (n = m, r = u, c = l.length), a = Math.max(Math.ceil(g / p), c) + 2, s > a && (s = a, n.length = 1), n.reverse(), a = s; a--;) n.push(0);
-				n.reverse();
-			} else {
-				for (a = l.length, c = m.length, d = a < c, d && (c = a), a = 0; a < c; a++) if (l[a] != m[a]) {
-					d = l[a] < m[a];
-					break;
-				}
-				s = 0;
-			}
-			for (d && (n = l, l = m, m = n, t.s = -t.s), c = l.length, a = m.length - c; a > 0; --a) l[c++] = 0;
-			for (a = m.length; a > s;) {
-				if (l[--a] < m[a]) {
-					for (o = a; o && l[--o] === 0;) l[o] = f - 1;
-					--l[o], l[a] += f;
-				}
-				l[a] -= m[a];
-			}
-			for (; l[--c] === 0;) l.pop();
-			for (; l[0] === 0; l.shift()) --r;
-			return l[0] ? (t.d = l, t.e = r, i ? D(t, g) : t) : new h(0);
-		}
-		function k(e, t, n) {
-			var r, i = S(e), a = y(e.d), o = a.length;
-			return t ? (n && (r = n - o) > 0 ? a = a.charAt(0) + "." + a.slice(1) + w(r) : o > 1 && (a = a.charAt(0) + "." + a.slice(1)), a = a + (i < 0 ? "e" : "e+") + i) : i < 0 ? (a = "0." + w(-i - 1) + a, n && (r = n - o) > 0 && (a += w(r))) : i >= o ? (a += w(i + 1 - o), n && (r = n - i - 1) > 0 && (a = a + "." + w(r))) : ((r = i + 1) < o && (a = a.slice(0, r) + "." + a.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (a += "."), a += w(r))), e.s < 0 ? "-" + a : a;
-		}
-		function A(e, t) {
-			if (e.length > t) return e.length = t, !0;
-		}
-		function j(e) {
-			var t, n, r;
-			function i(e) {
-				var t = this;
-				if (!(t instanceof i)) return new i(e);
-				if (t.constructor = i, e instanceof i) {
-					t.s = e.s, t.e = e.e, t.d = (e = e.d) ? e.slice() : e;
-					return;
-				}
-				if (typeof e == "number") {
-					if (e * 0 != 0) throw Error(o + e);
-					if (e > 0) t.s = 1;
-					else if (e < 0) e = -e, t.s = -1;
-					else {
-						t.s = 0, t.e = 0, t.d = [0];
-						return;
-					}
-					if (e === ~~e && e < 1e7) {
-						t.e = 0, t.d = [e];
-						return;
-					}
-					return E(t, e.toString());
-				} else if (typeof e != "string") throw Error(o + e);
-				if (e.charCodeAt(0) === 45 ? (e = e.slice(1), t.s = -1) : t.s = 1, u.test(e)) E(t, e);
-				else throw Error(o + e);
-			}
-			if (i.prototype = g, i.ROUND_UP = 0, i.ROUND_DOWN = 1, i.ROUND_CEIL = 2, i.ROUND_FLOOR = 3, i.ROUND_HALF_UP = 4, i.ROUND_HALF_DOWN = 5, i.ROUND_HALF_EVEN = 6, i.ROUND_HALF_CEIL = 7, i.ROUND_HALF_FLOOR = 8, i.clone = j, i.config = i.set = M, e === void 0 && (e = {}), e) for (r = [
-				"precision",
-				"rounding",
-				"toExpNeg",
-				"toExpPos",
-				"LN10"
-			], t = 0; t < r.length;) e.hasOwnProperty(n = r[t++]) || (e[n] = this[n]);
-			return i.config(e), i;
-		}
-		function M(e) {
-			if (!e || typeof e != "object") throw Error(a + "Object expected");
-			var t, r, i, s = [
-				"precision",
-				1,
-				n,
-				"rounding",
-				0,
-				8,
-				"toExpNeg",
-				-Infinity,
-				0,
-				"toExpPos",
-				0,
-				Infinity
-			];
-			for (t = 0; t < s.length; t += 3) if ((i = e[r = s[t]]) !== void 0) if (c(i) === i && i >= s[t + 1] && i <= s[t + 2]) this[r] = i;
-			else throw Error(o + r + ": " + i);
-			if ((i = e[r = "LN10"]) !== void 0) if (i == Math.LN10) this[r] = new this(i);
-			else throw Error(o + r + ": " + i);
-			return this;
-		}
-		r = j(r), r.default = r.Decimal = r, d = new r(1), typeof define == "function" && define.amd ? define(function() {
-			return r;
-		}) : t !== void 0 && t.exports ? t.exports = r : (e ||= typeof self < "u" && self && self.self == self ? self : Function("return this")(), e.Decimal = r);
-	})(e);
-}));
-//#endregion
-export default t();
-export { t as require_decimal };
-
-//# sourceMappingURL=decimal.js.map

package/dist/node_modules/decimal.js-light/decimal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"decimal.js","names":[],"sources":["../../../node_modules/decimal.js-light/decimal.js"],"sourcesContent":["/*! decimal.js-light v2.5.1 https://github.com/MikeMcl/decimal.js-light/LICENCE */\r\n;(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js-light v2.5.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js-light\r\n   *  Copyright (c) 2020 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Expat Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  var MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    Decimal = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed during run-time using `Decimal.config`.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used by default by `toInteger`, `toDecimalPlaces`, `toExponential`,\r\n      // `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -MAX_E\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to MAX_E\r\n\r\n      // The natural logarithm of 10.\r\n      // 115 digits\r\n      LN10: '2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286'\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    exponentOutOfRange = decimalError + 'Exponent out of range: ',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    ONE,\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n    MAX_E = mathfloor(MAX_SAFE_INTEGER / LOG_BASE),    // 1286742750677284\r\n\r\n    // Decimal.prototype object\r\n    P = {};\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue                       abs\r\n   *  comparedTo                          cmp\r\n   *  decimalPlaces                       dp\r\n   *  dividedBy                           div\r\n   *  dividedToIntegerBy                  idiv\r\n   *  equals                              eq\r\n   *  exponent\r\n   *  greaterThan                         gt\r\n   *  greaterThanOrEqualTo                gte\r\n   *  isInteger                           isint\r\n   *  isNegative                          isneg\r\n   *  isPositive                          ispos\r\n   *  isZero\r\n   *  lessThan                            lt\r\n   *  lessThanOrEqualTo                   lte\r\n   *  logarithm                           log\r\n   *  minus                               sub\r\n   *  modulo                              mod\r\n   *  naturalExponential                  exp\r\n   *  naturalLogarithm                    ln\r\n   *  negated                             neg\r\n   *  plus                                add\r\n   *  precision                           sd\r\n   *  squareRoot                          sqrt\r\n   *  times                               mul\r\n   *  toDecimalPlaces                     todp\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toInteger                           toint\r\n   *  toNumber\r\n   *  toPower                             pow\r\n   *  toPrecision\r\n   *  toSignificantDigits                 tosd\r\n   *  toString\r\n   *  valueOf                             val\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s) x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this;\r\n\r\n    y = new x.constructor(y);\r\n\r\n    // Signs differ?\r\n    if (x.s !== y.s) return x.s || -y.s;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ x.s < 0 ? 1 : -1;\r\n\r\n    xdL = x.d.length;\r\n    ydL = y.d.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (x.d[i] !== y.d[i]) return x.d[i] > y.d[i] ^ x.s < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ x.s < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var x = this,\r\n      w = x.d.length - 1,\r\n      dp = (w - x.e) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = x.d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) dp--;\r\n\r\n    return dp < 0 ? 0 : dp;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.idiv = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(divide(x, new Ctor(y), 0, 1), Ctor.precision);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return !this.cmp(y);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the (base 10) exponent value of this Decimal (this.e is the base 10000000 exponent).\r\n   *\r\n   */\r\n  P.exponent = function () {\r\n    return getBase10Exponent(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    return this.cmp(y) >= 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isint = function () {\r\n    return this.e > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isneg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.ispos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return this.s === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   * If no base is specified, return log[10](x).\r\n   *\r\n   * log[base](x) = ln(x) / ln(base)\r\n   *\r\n   * The maximum error of the result is 1 ulp (unit in the last place).\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var r,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      wpr = pr + 5;\r\n\r\n    // Default base is 10.\r\n    if (base === void 0) {\r\n      base = new Ctor(10);\r\n    } else {\r\n      base = new Ctor(base);\r\n\r\n      // log[-b](x) = NaN\r\n      // log[0](x)  = NaN\r\n      // log[1](x)  = NaN\r\n      if (base.s < 1 || base.eq(ONE)) throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    // log[b](-x) = NaN\r\n    // log[b](0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // log[b](1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    external = false;\r\n    r = divide(ln(x, wpr), ln(base, wpr), wpr);\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? subtract(x, y) : add(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // x % 0 = NaN\r\n    if (!y.s) throw Error(decimalError + 'NaN');\r\n\r\n    // Return x if x is 0.\r\n    if (!x.s) return round(new Ctor(x), pr);\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n    q = divide(x, y, 0, 1).times(y);\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return exp(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return ln(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s || 0;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? add(x, y) : subtract(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var e, sd, w,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    e = getBase10Exponent(x) + 1;\r\n    w = x.d.length - 1;\r\n    sd = w * LOG_BASE + 1;\r\n    w = x.d[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) sd--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = x.d[0]; w >= 10; w /= 10) sd++;\r\n    }\r\n\r\n    return z && e > sd ? e : sd;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var e, n, pr, r, s, t, wpr,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative or zero?\r\n    if (x.s < 1) {\r\n      if (!x.s) return new Ctor(0);\r\n\r\n      // sqrt(-x) = NaN\r\n      throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    e = getBase10Exponent(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    pr = Ctor.precision;\r\n    s = wpr = pr + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, wpr + 2)).times(0.5);\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === (n = digitsToString(r.d)).slice(0, wpr)) {\r\n        n = n.slice(wpr - 3, wpr + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (s == wpr && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          round(t, pr + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        } else if (n != '9999') {\r\n          break;\r\n        }\r\n\r\n        wpr += 4;\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal times `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    // Return 0 if either is 0.\r\n    if (!x.s || !y.s) return new Ctor(0);\r\n\r\n    y.s *= x.s;\r\n    e = x.e + y.e;\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = e;\r\n\r\n    return external ? round(y, Ctor.precision) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.todp = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return round(x, dp + getBase10Exponent(x) + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = toString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), dp + 1, rm);\r\n      str = toString(x, true, dp + 1);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) return toString(x);\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = round(new Ctor(x), dp + getBase10Exponent(x) + 1, rm);\r\n    str = toString(y.abs(), false, dp + getBase10Exponent(y) + 1);\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isneg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.toInteger = P.toint = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(new Ctor(x), getBase10Exponent(x) + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * The maximum error is 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, sign, yIsInt,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      guard = 12,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // pow(x, 0) = 1\r\n    if (!y.s) return new Ctor(ONE);\r\n\r\n    x = new Ctor(x);\r\n\r\n    // pow(0, y > 0) = 0\r\n    // pow(0, y < 0) = Infinity\r\n    if (!x.s) {\r\n      if (y.s < 1) throw Error(decimalError + 'Infinity');\r\n      return x;\r\n    }\r\n\r\n    // pow(1, y) = 1\r\n    if (x.eq(ONE)) return x;\r\n\r\n    pr = Ctor.precision;\r\n\r\n    // pow(x, 1) = x\r\n    if (y.eq(ONE)) return round(x, pr);\r\n\r\n    e = y.e;\r\n    k = y.d.length - 1;\r\n    yIsInt = e >= k;\r\n    sign = x.s;\r\n\r\n    if (!yIsInt) {\r\n\r\n      // pow(x < 0, y non-integer) = NaN\r\n      if (sign < 0) throw Error(decimalError + 'NaN');\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    } else if ((k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = new Ctor(ONE);\r\n\r\n      // Max k of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      e = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n      external = false;\r\n\r\n      for (;;) {\r\n        if (k % 2) {\r\n          r = r.times(x);\r\n          truncate(r.d, e);\r\n        }\r\n\r\n        k = mathfloor(k / 2);\r\n        if (k === 0) break;\r\n\r\n        x = x.times(x);\r\n        truncate(x.d, e);\r\n      }\r\n\r\n      external = true;\r\n\r\n      return y.s < 0 ? new Ctor(ONE).div(r) : round(r, pr);\r\n    }\r\n\r\n    // Result is negative if x is negative and the last digit of integer y is odd.\r\n    sign = sign < 0 && y.d[Math.max(e, k)] & 1 ? -1 : 1;\r\n\r\n    x.s = 1;\r\n    external = false;\r\n    r = y.times(ln(x, pr + guard));\r\n    external = true;\r\n    r = exp(r);\r\n    r.s = sign;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var e, str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), sd, rm);\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, sd <= e || e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.tosd = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return round(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = P.valueOf = P.val = P.toJSON = function () {\r\n    var x = this,\r\n      e = getBase10Exponent(x),\r\n      Ctor = x.constructor;\r\n\r\n    return toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  add                 P.minus, P.plus\r\n   *  checkInt32          P.todp, P.toExponential, P.toFixed, P.toPrecision, P.tosd\r\n   *  digitsToString      P.log, P.sqrt, P.pow, toString, exp, ln\r\n   *  divide              P.div, P.idiv, P.log, P.mod, P.sqrt, exp, ln\r\n   *  exp                 P.exp, P.pow\r\n   *  getBase10Exponent   P.exponent, P.sd, P.toint, P.sqrt, P.todp, P.toFixed, P.toPrecision,\r\n   *                      P.toString, divide, round, toString, exp, ln\r\n   *  getLn10             P.log, ln\r\n   *  getZeroString       digitsToString, toString\r\n   *  ln                  P.log, P.ln, P.pow, exp\r\n   *  parseDecimal        Decimal\r\n   *  round               P.abs, P.idiv, P.log, P.minus, P.mod, P.neg, P.plus, P.toint, P.sqrt,\r\n   *                      P.times, P.todp, P.toExponential, P.toFixed, P.pow, P.toPrecision, P.tosd,\r\n   *                      divide, getLn10, exp, ln\r\n   *  subtract            P.minus, P.plus\r\n   *  toString            P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf\r\n   *  truncate            P.pow\r\n   *\r\n   *  Throws:             P.log, P.mod, P.sd, P.sqrt, P.pow,  checkInt32, divide, round,\r\n   *                      getLn10, exp, ln, parseDecimal, Decimal, config\r\n   */\r\n\r\n\r\n  function add(x, y) {\r\n    var carry, d, e, i, k, len, xd, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // If either is zero...\r\n    if (!x.s || !y.s) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!y.s) y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    k = x.e;\r\n    e = y.e;\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % BASE | 0;\r\n        carry = temp / BASE | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * BASE + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, dp) {\r\n      var cmp, e, i, k, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0, yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either 0?\r\n      if (!x.s) return new Ctor(x);\r\n      if (!y.s) throw Error(decimalError + 'Division by zero');\r\n\r\n      e = x.e - y.e;\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      for (i = 0; yd[i] == (xd[i] || 0); ) ++i;\r\n      if (yd[i] > (xd[i] || 0)) --e;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n      } else if (dp) {\r\n        sd = pr + (getBase10Exponent(x) - getBase10Exponent(y)) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) return new Ctor(0);\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / LOG_BASE + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * BASE + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= BASE/2\r\n        k = BASE / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k);\r\n          xd = multiplyInteger(xd, k);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= BASE / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * BASE + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= BASE) k = BASE - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n\r\n      q.e = e;\r\n\r\n      return round(q, dp ? pr + getBase10Exponent(q) + 1 : pr);\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` truncated to `sd`\r\n   * significant digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   */\r\n  function exp(x, sd) {\r\n    var denominator, guard, pow, sum, t, wpr,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    if (getBase10Exponent(x) > 16) throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n\r\n    // exp(0) = 1\r\n    if (!x.s) return new Ctor(ONE);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    while (x.abs().gte(0.1)) {\r\n      x = x.times(t);    // x = x / 2^5\r\n      k += 5;\r\n    }\r\n\r\n    // Estimate the precision increase necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(ONE);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = round(pow.times(x), wpr);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        while (k--) sum = round(sum.times(sum), wpr);\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(x) {\r\n    var e = x.e * LOG_BASE,\r\n      w = x.d[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for (; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n\r\n    if (sd > Ctor.LN10.sd()) {\r\n\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(decimalError + 'LN10 precision limit exceeded');\r\n    }\r\n\r\n    return round(new Ctor(Ctor.LN10), sd);\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` truncated to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(n) is non-terminating (n != 1)\r\n   *\r\n   */\r\n  function ln(y, sd) {\r\n    var c, c0, denominator, e, numerator, sum, t, wpr, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // ln(-x) = NaN\r\n    // ln(0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // ln(1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    if (x.eq(10)) {\r\n      if (sd == null) external = true;\r\n      return getLn10(Ctor, wpr);\r\n    }\r\n\r\n    wpr += guard;\r\n    Ctor.precision = wpr;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n    e = getBase10Exponent(x);\r\n\r\n    if (Math.abs(e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = getBase10Exponent(x);\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = ln(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n\r\n      Ctor.precision = pr;\r\n      return sd == null ? (external = true, round(x, pr)) : x;\r\n    }\r\n\r\n    // x is reduced to a value near 1.\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(ONE), x.plus(ONE), wpr);\r\n    x2 = round(x.times(x), wpr);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = round(numerator.times(x2), wpr);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr);\r\n\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48;) ++i;\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48;) --len;\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      e = e - i - 1;\r\n      x.e = mathfloor(e / LOG_BASE);\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external && (x.e > MAX_E || x.e < -MAX_E)) throw Error(exponentOutOfRange + e);\r\n    } else {\r\n\r\n      // Zero.\r\n      x.s = 0;\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits, using rounding mode `rm` if present (truncate otherwise).\r\n   */\r\n   function round(x, sd, rm) {\r\n    var i, j, k, n, rd, doRound, w, xdi,\r\n      xd = x.d;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd which contains the rounding digit, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // n: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (n = 1, k = xd[0]; k >= 10; k /= 10) n++;\r\n    i = sd - n;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) return x;\r\n      w = k = xd[xdi];\r\n\r\n      // Get the number of digits of w.\r\n      for (n = 1; k >= 10; k /= 10) n++;\r\n\r\n      // Get the index of rd within w.\r\n      i %= LOG_BASE;\r\n\r\n      // Get the index of rd within w, adjusted for leading zeros.\r\n      // The number of leading zeros of w is given by LOG_BASE - n.\r\n      j = i - LOG_BASE + n;\r\n    }\r\n\r\n    if (rm !== void 0) {\r\n      k = mathpow(10, n - j - 1);\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / k % 10 | 0;\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      doRound = sd < 0 || xd[xdi + 1] !== void 0 || w % k;\r\n\r\n      // The expression `w % mathpow(10, n - j - 1)` returns all the digits of w to the right of the\r\n      // digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression will give\r\n      // 714.\r\n\r\n      doRound = rm < 4\r\n        ? (rd || doRound) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || doRound || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, n - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n    }\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      if (doRound) {\r\n        k = getBase10Exponent(x);\r\n        xd.length = 1;\r\n\r\n        // Convert sd to decimal places.\r\n        sd = sd - k - 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = mathfloor(-sd / LOG_BASE) || 0;\r\n      } else {\r\n        xd.length = 1;\r\n\r\n        // Zero.\r\n        xd[0] = x.e = x.s = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, n - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (doRound) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n          if ((xd[0] += k) == BASE) {\r\n            xd[0] = 1;\r\n            ++x.e;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n\r\n    if (external && (x.e > MAX_E || x.e < -MAX_E)) {\r\n      throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function subtract(x, y) {\r\n    var d, e, i, j, k, len, xd, xe, xLTy, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // Return y negated if x is zero.\r\n    // Return x if y is zero and x is non-zero.\r\n    if (!x.s || !y.s) {\r\n      if (y.s) y.s = -y.s;\r\n      else y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are non-zero numbers with the same sign.\r\n\r\n    e = y.e;\r\n    xe = x.e;\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of zeros\r\n      // needing to be prepended, but this can be avoided while still ensuring correct rounding by\r\n      // limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to xd if shorter.\r\n    // Don't add zeros to yd if shorter as subtraction only needs to start at yd length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(0);\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    //return external && xd.length >= pr / LOG_BASE ? round(y, pr) : y;\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function toString(x, isExp, sd) {\r\n    var k,\r\n      e = getBase10Exponent(x),\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (e < 0 ? 'e' : 'e+') + e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  clone\r\n   *  config/set\r\n   */\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * value {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(value) {\r\n      var x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(value);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (value instanceof Decimal) {\r\n        x.s = value.s;\r\n        x.e = value.e;\r\n        x.d = (value = value.d) ? value.slice() : value;\r\n        return;\r\n      }\r\n\r\n      if (typeof value === 'number') {\r\n\r\n        // Reject Infinity/NaN.\r\n        if (value * 0 !== 0) {\r\n          throw Error(invalidArgument + value);\r\n        }\r\n\r\n        if (value > 0) {\r\n          x.s = 1;\r\n        } else if (value < 0) {\r\n          value = -value;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 0;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (value === ~~value && value < 1e7) {\r\n          x.e = 0;\r\n          x.d = [value];\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, value.toString());\r\n      } else if (typeof value !== 'string') {\r\n        throw Error(invalidArgument + value);\r\n      }\r\n\r\n      // Minus sign?\r\n      if (value.charCodeAt(0) === 45) {\r\n        value = value.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      if (isDecimal.test(value)) parseDecimal(x, value);\r\n      else throw Error(invalidArgument + value);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n\r\n    Decimal.clone = clone;\r\n    Decimal.config = Decimal.set = config;\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'LN10'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') {\r\n      throw Error(decimalError + 'Object expected');\r\n    }\r\n    var i, p, v,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -1 / 0, 0,\r\n        'toExpPos', 0, 1 / 0\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if ((v = obj[p = ps[i]]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if ((v = obj[p = 'LN10']) !== void 0) {\r\n        if (v == Math.LN10) this[p] = new this(v);\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(Decimal);\r\n\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Internal constant.\r\n  ONE = new Decimal(1);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () {\r\n      return Decimal;\r\n    });\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = Decimal;\r\n\r\n    // Browser.\r\n  } else {\r\n    if (!globalScope) {\r\n      globalScope = typeof self != 'undefined' && self && self.self == self\r\n        ? self : Function('return this')();\r\n    }\r\n\r\n    globalScope.Decimal = Decimal;\r\n  }\r\n})(this);\r\n"],"x_google_ignoreList":[0],"mappings":";;;AACC,EAAC,SAAU,GAAa;EAkBvB,IAAI,IAAa,KAIf,IAAU;GAOR,WAAW;GAkBX,UAAU;GAIV,UAAU;GAIV,UAAW;GAIX,MAAM;GACP,EAMD,IAAW,IAEX,IAAe,mBACf,IAAkB,IAAe,sBACjC,IAAqB,IAAe,2BAEpC,IAAY,KAAK,OACjB,IAAU,KAAK,KAEf,IAAY,sCAEZ,GACA,IAAO,KACP,IAAW,GACX,IAAmB,kBACnB,IAAQ,EAAU,IAAmB,EAAS,EAG9C,IAAI,EAAE;AA4xBR,EA3uBA,EAAE,gBAAgB,EAAE,MAAM,WAAY;GACpC,IAAI,IAAI,IAAI,KAAK,YAAY,KAAK;AAElC,UADA,AAAS,EAAE,MAAI,GACR;KAWT,EAAE,aAAa,EAAE,MAAM,SAAU,GAAG;GAClC,IAAI,GAAG,GAAG,GAAK,GACb,IAAI;AAKN,OAHA,IAAI,IAAI,EAAE,YAAY,EAAE,EAGpB,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,KAAK,CAAC,EAAE;AAGlC,OAAI,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI;AAMlD,QAJA,IAAM,EAAE,EAAE,QACV,IAAM,EAAE,EAAE,QAGL,IAAI,GAAG,IAAI,IAAM,IAAM,IAAM,GAAK,IAAI,GAAG,EAAE,EAC9C,KAAI,EAAE,EAAE,OAAO,EAAE,EAAE,GAAI,QAAO,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,IAAI,IAAI;AAIhE,UAAO,MAAQ,IAAM,IAAI,IAAM,IAAM,EAAE,IAAI,IAAI,IAAI;KAQrD,EAAE,gBAAgB,EAAE,KAAK,WAAY;GACnC,IAAI,IAAI,MACN,IAAI,EAAE,EAAE,SAAS,GACjB,KAAM,IAAI,EAAE,KAAK;AAInB,OADA,IAAI,EAAE,EAAE,IACJ,EAAG,QAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAEpC,UAAO,IAAK,IAAI,IAAI;KAStB,EAAE,YAAY,EAAE,MAAM,SAAU,GAAG;AACjC,UAAO,EAAO,MAAM,IAAI,KAAK,YAAY,EAAE,CAAC;KAS9C,EAAE,qBAAqB,EAAE,OAAO,SAAU,GAAG;GAC3C,IAAI,IAAI,MACN,IAAO,EAAE;AACX,UAAO,EAAM,EAAO,GAAG,IAAI,EAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAK,UAAU;KAQ5D,EAAE,SAAS,EAAE,KAAK,SAAU,GAAG;AAC7B,UAAO,CAAC,KAAK,IAAI,EAAE;KAQrB,EAAE,WAAW,WAAY;AACvB,UAAO,EAAkB,KAAK;KAShC,EAAE,cAAc,EAAE,KAAK,SAAU,GAAG;AAClC,UAAO,KAAK,IAAI,EAAE,GAAG;KASvB,EAAE,uBAAuB,EAAE,MAAM,SAAU,GAAG;AAC5C,UAAO,KAAK,IAAI,EAAE,IAAI;KAQxB,EAAE,YAAY,EAAE,QAAQ,WAAY;AAClC,UAAO,KAAK,IAAI,KAAK,EAAE,SAAS;KAQlC,EAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,UAAO,KAAK,IAAI;KAQlB,EAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,UAAO,KAAK,IAAI;KAQlB,EAAE,SAAS,WAAY;AACrB,UAAO,KAAK,MAAM;KAQpB,EAAE,WAAW,EAAE,KAAK,SAAU,GAAG;AAC/B,UAAO,KAAK,IAAI,EAAE,GAAG;KAQvB,EAAE,oBAAoB,EAAE,MAAM,SAAU,GAAG;AACzC,UAAO,KAAK,IAAI,EAAE,GAAG;KAiBvB,EAAE,YAAY,EAAE,MAAM,SAAU,GAAM;GACpC,IAAI,GACF,IAAI,MACJ,IAAO,EAAE,aACT,IAAK,EAAK,WACV,IAAM,IAAK;AAGb,OAAI,MAAS,KAAK,EAChB,KAAO,IAAI,EAAK,GAAG;YAEnB,IAAO,IAAI,EAAK,EAAK,EAKjB,EAAK,IAAI,KAAK,EAAK,GAAG,EAAI,CAAE,OAAM,MAAM,IAAe,MAAM;AAKnE,OAAI,EAAE,IAAI,EAAG,OAAM,MAAM,KAAgB,EAAE,IAAI,QAAQ,aAAa;AASpE,UANI,EAAE,GAAG,EAAI,GAAS,IAAI,EAAK,EAAE,IAEjC,IAAW,IACX,IAAI,EAAO,EAAG,GAAG,EAAI,EAAE,EAAG,GAAM,EAAI,EAAE,EAAI,EAC1C,IAAW,IAEJ,EAAM,GAAG,EAAG;KASrB,EAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;GAC7B,IAAI,IAAI;AAER,UADA,IAAI,IAAI,EAAE,YAAY,EAAE,EACjB,EAAE,KAAK,EAAE,IAAI,EAAS,GAAG,EAAE,GAAG,EAAI,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,GAAG;KAS9D,EAAE,SAAS,EAAE,MAAM,SAAU,GAAG;GAC9B,IAAI,GACF,IAAI,MACJ,IAAO,EAAE,aACT,IAAK,EAAK;AAKZ,OAHA,IAAI,IAAI,EAAK,EAAE,EAGX,CAAC,EAAE,EAAG,OAAM,MAAM,IAAe,MAAM;AAU3C,UAPK,EAAE,KAGP,IAAW,IACX,IAAI,EAAO,GAAG,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,EAC/B,IAAW,IAEJ,EAAE,MAAM,EAAE,IAPA,EAAM,IAAI,EAAK,EAAE,EAAE,EAAG;KAiBzC,EAAE,qBAAqB,EAAE,MAAM,WAAY;AACzC,UAAO,EAAI,KAAK;KASlB,EAAE,mBAAmB,EAAE,KAAK,WAAY;AACtC,UAAO,EAAG,KAAK;KASjB,EAAE,UAAU,EAAE,MAAM,WAAY;GAC9B,IAAI,IAAI,IAAI,KAAK,YAAY,KAAK;AAElC,UADA,EAAE,IAAI,CAAC,EAAE,KAAK,GACP;KAST,EAAE,OAAO,EAAE,MAAM,SAAU,GAAG;GAC5B,IAAI,IAAI;AAER,UADA,IAAI,IAAI,EAAE,YAAY,EAAE,EACjB,EAAE,KAAK,EAAE,IAAI,EAAI,GAAG,EAAE,GAAG,EAAS,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,GAAG;KAU9D,EAAE,YAAY,EAAE,KAAK,SAAU,GAAG;GAChC,IAAI,GAAG,GAAI,GACT,IAAI;AAEN,OAAI,MAAM,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,KAAK,MAAM,EAAG,OAAM,MAAM,IAAkB,EAAE;AAQrF,OANA,IAAI,EAAkB,EAAE,GAAG,GAC3B,IAAI,EAAE,EAAE,SAAS,GACjB,IAAK,IAAI,IAAW,GACpB,IAAI,EAAE,EAAE,IAGJ,GAAG;AAGL,WAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAG7B,SAAK,IAAI,EAAE,EAAE,IAAI,KAAK,IAAI,KAAK,GAAI;;AAGrC,UAAO,KAAK,IAAI,IAAK,IAAI;KAS3B,EAAE,aAAa,EAAE,OAAO,WAAY;GAClC,IAAI,GAAG,GAAG,GAAI,GAAG,GAAG,GAAG,GACrB,IAAI,MACJ,IAAO,EAAE;AAGX,OAAI,EAAE,IAAI,GAAG;AACX,QAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAE;AAG5B,UAAM,MAAM,IAAe,MAAM;;AAiCnC,QA9BA,IAAI,EAAkB,EAAE,EACxB,IAAW,IAGX,IAAI,KAAK,KAAK,CAAC,EAAE,EAIb,KAAK,KAAK,KAAK,YACjB,IAAI,EAAe,EAAE,EAAE,GAClB,EAAE,SAAS,KAAK,KAAK,MAAG,KAAK,MAClC,IAAI,KAAK,KAAK,EAAE,EAChB,IAAI,GAAW,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,IAAI,IAEvC,KAAK,WACP,IAAI,OAAO,KAEX,IAAI,EAAE,eAAe,EACrB,IAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,IAAI,GAAG,EAAE,GAAG,IAGvC,IAAI,IAAI,EAAK,EAAE,IAEf,IAAI,IAAI,EAAK,EAAE,UAAU,CAAC,EAG5B,IAAK,EAAK,WACV,IAAI,IAAM,IAAK,IAOb,KAHA,IAAI,GACJ,IAAI,EAAE,KAAK,EAAO,GAAG,GAAG,IAAM,EAAE,CAAC,CAAC,MAAM,GAAI,EAExC,EAAe,EAAE,EAAE,CAAC,MAAM,GAAG,EAAI,MAAM,IAAI,EAAe,EAAE,EAAE,EAAE,MAAM,GAAG,EAAI,EAAE;AAKjF,QAJA,IAAI,EAAE,MAAM,IAAM,GAAG,IAAM,EAAE,EAIzB,KAAK,KAAO,KAAK,QAMnB;SAFA,EAAM,GAAG,IAAK,GAAG,EAAE,EAEf,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE;AACpB,UAAI;AACJ;;eAEO,KAAK,OACd;AAGF,SAAO;;AAMX,UAFA,IAAW,IAEJ,EAAM,GAAG,EAAG;KASrB,EAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;GAC7B,IAAI,GAAO,GAAG,GAAG,GAAG,GAAG,GAAI,GAAG,GAAK,GACjC,IAAI,MACJ,IAAO,EAAE,aACT,IAAK,EAAE,GACP,KAAM,IAAI,IAAI,EAAK,EAAE,EAAE;AAGzB,OAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAE;AAoBpC,QAlBA,EAAE,KAAK,EAAE,GACT,IAAI,EAAE,IAAI,EAAE,GACZ,IAAM,EAAG,QACT,IAAM,EAAG,QAGL,IAAM,MACR,IAAI,GACJ,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAM,GACN,IAAM,IAIR,IAAI,EAAE,EACN,IAAK,IAAM,GACN,IAAI,GAAI,KAAM,GAAE,KAAK,EAAE;AAG5B,QAAK,IAAI,GAAK,EAAE,KAAK,IAAI;AAEvB,SADA,IAAQ,GACH,IAAI,IAAM,GAAG,IAAI,GAGpB,CAFA,IAAI,EAAE,KAAK,EAAG,KAAK,EAAG,IAAI,IAAI,KAAK,GACnC,EAAE,OAAO,IAAI,IAAO,GACpB,IAAQ,IAAI,IAAO;AAGrB,MAAE,MAAM,EAAE,KAAK,KAAS,IAAO;;AAIjC,UAAO,CAAC,EAAE,EAAE,IAAM,GAAE,KAAK;AAQzB,UANI,IAAO,EAAE,IACR,EAAE,OAAO,EAEd,EAAE,IAAI,GACN,EAAE,IAAI,GAEC,IAAW,EAAM,GAAG,EAAK,UAAU,GAAG;KAc/C,EAAE,kBAAkB,EAAE,OAAO,SAAU,GAAI,GAAI;GAC7C,IAAI,IAAI,MACN,IAAO,EAAE;AAUX,UARA,IAAI,IAAI,EAAK,EAAE,EACX,MAAO,KAAK,IAAU,KAE1B,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAElB,EAAM,GAAG,IAAK,EAAkB,EAAE,GAAG,GAAG,EAAG;KAYpD,EAAE,gBAAgB,SAAU,GAAI,GAAI;GAClC,IAAI,GACF,IAAI,MACJ,IAAO,EAAE;AAcX,UAZI,MAAO,KAAK,IACd,IAAM,EAAS,GAAG,GAAK,IAEvB,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAEzB,IAAI,EAAM,IAAI,EAAK,EAAE,EAAE,IAAK,GAAG,EAAG,EAClC,IAAM,EAAS,GAAG,IAAM,IAAK,EAAE,GAG1B;KAoBT,EAAE,UAAU,SAAU,GAAI,GAAI;GAC5B,IAAI,GAAK,GACP,IAAI,MACJ,IAAO,EAAE;AAcX,UAZI,MAAO,KAAK,IAAU,EAAS,EAAE,IAErC,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAEzB,IAAI,EAAM,IAAI,EAAK,EAAE,EAAE,IAAK,EAAkB,EAAE,GAAG,GAAG,EAAG,EACzD,IAAM,EAAS,EAAE,KAAK,EAAE,IAAO,IAAK,EAAkB,EAAE,GAAG,EAAE,EAItD,EAAE,OAAO,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,IAAM;KAShD,EAAE,YAAY,EAAE,QAAQ,WAAY;GAClC,IAAI,IAAI,MACN,IAAO,EAAE;AACX,UAAO,EAAM,IAAI,EAAK,EAAE,EAAE,EAAkB,EAAE,GAAG,GAAG,EAAK,SAAS;KAQpE,EAAE,WAAW,WAAY;AACvB,UAAO,CAAC;KAiBV,EAAE,UAAU,EAAE,MAAM,SAAU,GAAG;GAC/B,IAAI,GAAG,GAAG,GAAI,GAAG,GAAM,GACrB,IAAI,MACJ,IAAO,EAAE,aACT,IAAQ,IACR,IAAK,EAAE,IAAI,IAAI,EAAK,EAAE;AAGxB,OAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAI;AAM9B,OAJA,IAAI,IAAI,EAAK,EAAE,EAIX,CAAC,EAAE,GAAG;AACR,QAAI,EAAE,IAAI,EAAG,OAAM,MAAM,IAAe,WAAW;AACnD,WAAO;;AAIT,OAAI,EAAE,GAAG,EAAI,CAAE,QAAO;AAKtB,OAHA,IAAK,EAAK,WAGN,EAAE,GAAG,EAAI,CAAE,QAAO,EAAM,GAAG,EAAG;AAOlC,OALA,IAAI,EAAE,GACN,IAAI,EAAE,EAAE,SAAS,GACjB,IAAS,KAAK,GACd,IAAO,EAAE,GAEL,CAAC;QAGC,IAAO,EAAG,OAAM,MAAM,IAAe,MAAM;eAGrC,IAAI,IAAK,IAAI,CAAC,IAAK,MAAO,GAAkB;AAStD,SARA,IAAI,IAAI,EAAK,EAAI,EAIjB,IAAI,KAAK,KAAK,IAAK,IAAW,EAAE,EAEhC,IAAW,IAGL,IAAI,MACN,IAAI,EAAE,MAAM,EAAE,EACd,EAAS,EAAE,GAAG,EAAE,GAGlB,IAAI,EAAU,IAAI,EAAE,EAChB,MAAM,GAGV,CADA,IAAI,EAAE,MAAM,EAAE,EACd,EAAS,EAAE,GAAG,EAAE;AAKlB,WAFA,IAAW,IAEJ,EAAE,IAAI,IAAI,IAAI,EAAK,EAAI,CAAC,IAAI,EAAE,GAAG,EAAM,GAAG,EAAG;;AAatD,UATA,IAAO,IAAO,KAAK,EAAE,EAAE,KAAK,IAAI,GAAG,EAAE,IAAI,IAAI,KAAK,GAElD,EAAE,IAAI,GACN,IAAW,IACX,IAAI,EAAE,MAAM,EAAG,GAAG,IAAK,EAAM,CAAC,EAC9B,IAAW,IACX,IAAI,EAAI,EAAE,EACV,EAAE,IAAI,GAEC;KAeT,EAAE,cAAc,SAAU,GAAI,GAAI;GAChC,IAAI,GAAG,GACL,IAAI,MACJ,IAAO,EAAE;AAgBX,UAdI,MAAO,KAAK,KACd,IAAI,EAAkB,EAAE,EACxB,IAAM,EAAS,GAAG,KAAK,EAAK,YAAY,KAAK,EAAK,SAAS,KAE3D,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAEzB,IAAI,EAAM,IAAI,EAAK,EAAE,EAAE,GAAI,EAAG,EAC9B,IAAI,EAAkB,EAAE,EACxB,IAAM,EAAS,GAAG,KAAM,KAAK,KAAK,EAAK,UAAU,EAAG,GAG/C;KAaT,EAAE,sBAAsB,EAAE,OAAO,SAAU,GAAI,GAAI;GACjD,IAAI,IAAI,MACN,IAAO,EAAE;AAYX,UAVI,MAAO,KAAK,KACd,IAAK,EAAK,WACV,IAAK,EAAK,aAEV,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,GAGpB,EAAM,IAAI,EAAK,EAAE,EAAE,GAAI,EAAG;KAWnC,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,WAAY;GACtD,IAAI,IAAI,MACN,IAAI,EAAkB,EAAE,EACxB,IAAO,EAAE;AAEX,UAAO,EAAS,GAAG,KAAK,EAAK,YAAY,KAAK,EAAK,SAAS;;EA+B9D,SAAS,EAAI,GAAG,GAAG;GACjB,IAAI,GAAO,GAAG,GAAG,GAAG,GAAG,GAAK,GAAI,GAC9B,IAAO,EAAE,aACT,IAAK,EAAK;AAGZ,OAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAKb,QADK,EAAE,MAAG,IAAI,IAAI,EAAK,EAAE,GAClB,IAAW,EAAM,GAAG,EAAG,GAAG;AAcnC,OAXA,IAAK,EAAE,GACP,IAAK,EAAE,GAIP,IAAI,EAAE,GACN,IAAI,EAAE,GACN,IAAK,EAAG,OAAO,EACf,IAAI,IAAI,GAGJ,GAAG;AAsBL,SArBI,IAAI,KACN,IAAI,GACJ,IAAI,CAAC,GACL,IAAM,EAAG,WAET,IAAI,GACJ,IAAI,GACJ,IAAM,EAAG,SAIX,IAAI,KAAK,KAAK,IAAK,EAAS,EAC5B,IAAM,IAAI,IAAM,IAAI,IAAI,IAAM,GAE1B,IAAI,MACN,IAAI,GACJ,EAAE,SAAS,IAIb,EAAE,SAAS,EACJ,KAAM,GAAE,KAAK,EAAE;AACtB,MAAE,SAAS;;AAeb,QAZA,IAAM,EAAG,QACT,IAAI,EAAG,QAGH,IAAM,IAAI,MACZ,IAAI,GACJ,IAAI,GACJ,IAAK,GACL,IAAK,IAIF,IAAQ,GAAG,GAEd,CADA,KAAS,EAAG,EAAE,KAAK,EAAG,KAAK,EAAG,KAAK,KAAS,IAAO,GACnD,EAAG,MAAM;AAUX,QAPI,MACF,EAAG,QAAQ,EAAM,EACjB,EAAE,IAKC,IAAM,EAAG,QAAQ,EAAG,EAAE,MAAQ,GAAI,GAAG,KAAK;AAK/C,UAHA,EAAE,IAAI,GACN,EAAE,IAAI,GAEC,IAAW,EAAM,GAAG,EAAG,GAAG;;EAInC,SAAS,EAAW,GAAG,GAAK,GAAK;AAC/B,OAAI,MAAM,CAAC,CAAC,KAAK,IAAI,KAAO,IAAI,EAC9B,OAAM,MAAM,IAAkB,EAAE;;EAKpC,SAAS,EAAe,GAAG;GACzB,IAAI,GAAG,GAAG,GACR,IAAkB,EAAE,SAAS,GAC7B,IAAM,IACN,IAAI,EAAE;AAER,OAAI,IAAkB,GAAG;AAEvB,SADA,KAAO,GACF,IAAI,GAAG,IAAI,GAAiB,IAI/B,CAHA,IAAK,EAAE,KAAK,IACZ,IAAI,IAAW,EAAG,QACd,MAAG,KAAO,EAAc,EAAE,GAC9B,KAAO;AAMT,IAHA,IAAI,EAAE,IACN,IAAK,IAAI,IACT,IAAI,IAAW,EAAG,QACd,MAAG,KAAO,EAAc,EAAE;cACrB,MAAM,EACf,QAAO;AAIT,UAAO,IAAI,MAAO,GAAI,MAAK;AAE3B,UAAO,IAAM;;EAIf,IAAI,KAAU,WAAY;GAGxB,SAAS,EAAgB,GAAG,GAAG;IAC7B,IAAI,GACF,IAAQ,GACR,IAAI,EAAE;AAER,SAAK,IAAI,EAAE,OAAO,EAAE,KAGlB,CAFA,IAAO,EAAE,KAAK,IAAI,GAClB,EAAE,KAAK,IAAO,IAAO,GACrB,IAAQ,IAAO,IAAO;AAKxB,WAFI,KAAO,EAAE,QAAQ,EAAM,EAEpB;;GAGT,SAAS,EAAQ,GAAG,GAAG,GAAI,GAAI;IAC7B,IAAI,GAAG;AAEP,QAAI,KAAM,EACR,KAAI,IAAK,IAAK,IAAI;QAElB,MAAK,IAAI,IAAI,GAAG,IAAI,GAAI,IACtB,KAAI,EAAE,MAAM,EAAE,IAAI;AAChB,SAAI,EAAE,KAAK,EAAE,KAAK,IAAI;AACtB;;AAKN,WAAO;;GAGT,SAAS,EAAS,GAAG,GAAG,GAAI;AAI1B,SAHA,IAAI,IAAI,GAGD,KAGL,CAFA,EAAE,MAAO,GACT,IAAI,IAAE,KAAM,EAAE,KACd,EAAE,KAAM,IAAI,IAAO,EAAE,KAAM,EAAE;AAI/B,WAAO,CAAC,EAAE,MAAM,EAAE,SAAS,GAAI,GAAE,OAAO;;AAG1C,UAAO,SAAU,GAAG,GAAG,GAAI,GAAI;IAC7B,IAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAO,GAAG,GAAI,GAAK,GAAM,GAAM,GAAI,GAAG,GAAI,GAAI,GAAK,GAAI,GAC7E,IAAO,EAAE,aACT,IAAO,EAAE,KAAK,EAAE,IAAI,IAAI,IACxB,IAAK,EAAE,GACP,IAAK,EAAE;AAGT,QAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAE;AAC5B,QAAI,CAAC,EAAE,EAAG,OAAM,MAAM,IAAe,mBAAmB;AASxD,SAPA,IAAI,EAAE,IAAI,EAAE,GACZ,IAAK,EAAG,QACR,IAAK,EAAG,QACR,IAAI,IAAI,EAAK,EAAK,EAClB,IAAK,EAAE,IAAI,EAAE,EAGR,IAAI,GAAG,EAAG,OAAO,EAAG,MAAM,IAAM,GAAE;AAWvC,QAVI,EAAG,MAAM,EAAG,MAAM,MAAI,EAAE,GAE5B,AAKE,IALE,KAAM,OACH,IAAK,EAAK,YACN,IACJ,KAAM,EAAkB,EAAE,GAAG,EAAkB,EAAE,IAAI,IAErD,GAGH,IAAK,EAAG,QAAO,IAAI,EAAK,EAAE;AAO9B,QAJA,IAAK,IAAK,IAAW,IAAI,GACzB,IAAI,GAGA,KAAM,EAMR,MALA,IAAI,GACJ,IAAK,EAAG,IACR,MAGQ,IAAI,KAAM,MAAM,KAAM,IAG5B,CAFA,IAAI,IAAI,KAAQ,EAAG,MAAM,IACzB,EAAG,KAAK,IAAI,IAAK,GACjB,IAAI,IAAI,IAAK;SAIV;AAiBL,UAdA,IAAI,KAAQ,EAAG,KAAK,KAAK,GAErB,IAAI,MACN,IAAK,EAAgB,GAAI,EAAE,EAC3B,IAAK,EAAgB,GAAI,EAAE,EAC3B,IAAK,EAAG,QACR,IAAK,EAAG,SAGV,IAAK,GACL,IAAM,EAAG,MAAM,GAAG,EAAG,EACrB,IAAO,EAAI,QAGJ,IAAO,GAAK,GAAI,OAAU;AAMjC,KAJA,IAAK,EAAG,OAAO,EACf,EAAG,QAAQ,EAAE,EACb,IAAM,EAAG,IAEL,EAAG,MAAM,IAAO,KAAG,EAAE;AAEzB;AAmFE,MAlFA,IAAI,GAGJ,IAAM,EAAQ,GAAI,GAAK,GAAI,EAAK,EAG5B,IAAM,KAGR,IAAO,EAAI,IACP,KAAM,MAAM,IAAO,IAAO,KAAQ,EAAI,MAAM,KAGhD,IAAI,IAAO,IAAM,GAUb,IAAI,KACF,KAAK,MAAM,IAAI,IAAO,IAG1B,IAAO,EAAgB,GAAI,EAAE,EAC7B,IAAQ,EAAK,QACb,IAAO,EAAI,QAGX,IAAM,EAAQ,GAAM,GAAK,GAAO,EAAK,EAGjC,KAAO,MACT,KAGA,EAAS,GAAM,IAAK,IAAQ,IAAK,GAAI,EAAM,MAOzC,KAAK,MAAG,IAAM,IAAI,IACtB,IAAO,EAAG,OAAO,GAGnB,IAAQ,EAAK,QACT,IAAQ,KAAM,EAAK,QAAQ,EAAE,EAGjC,EAAS,GAAK,GAAM,EAAK,EAGrB,KAAO,OACT,IAAO,EAAI,QAGX,IAAM,EAAQ,GAAI,GAAK,GAAI,EAAK,EAG5B,IAAM,MACR,KAGA,EAAS,GAAK,IAAK,IAAO,IAAK,GAAI,EAAK,IAI5C,IAAO,EAAI,UACF,MAAQ,MACjB,KACA,IAAM,CAAC,EAAE,GAIX,EAAG,OAAO,GAGN,KAAO,EAAI,KACb,EAAI,OAAU,EAAG,MAAO,KAExB,IAAM,CAAC,EAAG,GAAI,EACd,IAAO;aAGD,MAAO,KAAM,EAAI,OAAO,KAAK,MAAM;;AAQ/C,WAJK,EAAG,MAAI,EAAG,OAAO,EAEtB,EAAE,IAAI,GAEC,EAAM,GAAG,IAAK,IAAK,EAAkB,EAAE,GAAG,IAAI,EAAG;;MAExD;EAyBJ,SAAS,EAAI,GAAG,GAAI;GAClB,IAAI,GAAa,GAAO,GAAK,GAAK,GAAG,GACnC,IAAI,GACJ,IAAI,GACJ,IAAO,EAAE,aACT,IAAK,EAAK;AAEZ,OAAI,EAAkB,EAAE,GAAG,GAAI,OAAM,MAAM,IAAqB,EAAkB,EAAE,CAAC;AAGrF,OAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAI;AAW9B,QATI,KAAM,QACR,IAAW,IACX,IAAM,KAEN,IAAM,GAGR,IAAI,IAAI,EAAK,OAAQ,EAEd,EAAE,KAAK,CAAC,IAAI,GAAI,EAErB,CADA,IAAI,EAAE,MAAM,EAAE,EACd,KAAK;AASP,QALA,IAAQ,KAAK,IAAI,EAAQ,GAAG,EAAE,CAAC,GAAG,KAAK,OAAO,IAAI,IAAI,GACtD,KAAO,GACP,IAAc,IAAM,IAAM,IAAI,EAAK,EAAI,EACvC,EAAK,YAAY,KAER;AAKP,QAJA,IAAM,EAAM,EAAI,MAAM,EAAE,EAAE,EAAI,EAC9B,IAAc,EAAY,MAAM,EAAE,EAAE,EACpC,IAAI,EAAI,KAAK,EAAO,GAAK,GAAa,EAAI,CAAC,EAEvC,EAAe,EAAE,EAAE,CAAC,MAAM,GAAG,EAAI,KAAK,EAAe,EAAI,EAAE,CAAC,MAAM,GAAG,EAAI,EAAE;AAC7E,YAAO,KAAK,KAAM,EAAM,EAAI,MAAM,EAAI,EAAE,EAAI;AAE5C,YADA,EAAK,YAAY,GACV,KAAM,QAAQ,IAAW,IAAM,EAAM,GAAK,EAAG,IAAI;;AAG1D,QAAM;;;EAMV,SAAS,EAAkB,GAAG;AAK5B,QAJA,IAAI,IAAI,EAAE,IAAI,GACZ,IAAI,EAAE,EAAE,IAGH,KAAK,IAAI,KAAK,GAAI;AACzB,UAAO;;EAIT,SAAS,EAAQ,GAAM,GAAI,GAAI;AAE7B,OAAI,IAAK,EAAK,KAAK,IAAI,CAMrB,OAFA,IAAW,IACP,MAAI,EAAK,YAAY,IACnB,MAAM,IAAe,gCAAgC;AAG7D,UAAO,EAAM,IAAI,EAAK,EAAK,KAAK,EAAE,EAAG;;EAIvC,SAAS,EAAc,GAAG;AAExB,QADA,IAAI,IAAK,IACF,KAAM,MAAM;AACnB,UAAO;;EAWT,SAAS,EAAG,GAAG,GAAI;GACjB,IAAI,GAAG,GAAI,GAAa,GAAG,GAAW,GAAK,GAAG,GAAK,GACjD,IAAI,GACJ,IAAQ,IACR,IAAI,GACJ,IAAK,EAAE,GACP,IAAO,EAAE,aACT,IAAK,EAAK;AAIZ,OAAI,EAAE,IAAI,EAAG,OAAM,MAAM,KAAgB,EAAE,IAAI,QAAQ,aAAa;AAGpE,OAAI,EAAE,GAAG,EAAI,CAAE,QAAO,IAAI,EAAK,EAAE;AASjC,OAPI,KAAM,QACR,IAAW,IACX,IAAM,KAEN,IAAM,GAGJ,EAAE,GAAG,GAAG,CAEV,QADI,MAAY,IAAW,KACpB,EAAQ,GAAM,EAAI;AAS3B,OANA,KAAO,GACP,EAAK,YAAY,GACjB,IAAI,EAAe,EAAG,EACtB,IAAK,EAAE,OAAO,EAAE,EAChB,IAAI,EAAkB,EAAE,EAEpB,KAAK,IAAI,EAAE,GAAG,iBAAQ;AAaxB,WAAO,IAAK,KAAK,KAAM,KAAK,KAAM,KAAK,EAAE,OAAO,EAAE,GAAG,GAInD,CAHA,IAAI,EAAE,MAAM,EAAE,EACd,IAAI,EAAe,EAAE,EAAE,EACvB,IAAK,EAAE,OAAO,EAAE,EAChB;AAKF,IAFA,IAAI,EAAkB,EAAE,EAEpB,IAAK,KACP,IAAI,IAAI,EAAK,OAAO,EAAE,EACtB,OAEA,IAAI,IAAI,EAAK,IAAK,MAAM,EAAE,MAAM,EAAE,CAAC;SAWrC,QAJA,IAAI,EAAQ,GAAM,IAAM,GAAG,EAAG,CAAC,MAAM,IAAI,GAAG,EAC5C,IAAI,EAAG,IAAI,EAAK,IAAK,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAM,EAAM,CAAC,KAAK,EAAE,EAE5D,EAAK,YAAY,GACV,KAAM,QAAQ,IAAW,IAAM,EAAM,GAAG,EAAG,IAAI;AAYxD,QAJA,IAAM,IAAY,IAAI,EAAO,EAAE,MAAM,EAAI,EAAE,EAAE,KAAK,EAAI,EAAE,EAAI,EAC5D,IAAK,EAAM,EAAE,MAAM,EAAE,EAAE,EAAI,EAC3B,IAAc,KAEL;AAIP,QAHA,IAAY,EAAM,EAAU,MAAM,EAAG,EAAE,EAAI,EAC3C,IAAI,EAAI,KAAK,EAAO,GAAW,IAAI,EAAK,EAAY,EAAE,EAAI,CAAC,EAEvD,EAAe,EAAE,EAAE,CAAC,MAAM,GAAG,EAAI,KAAK,EAAe,EAAI,EAAE,CAAC,MAAM,GAAG,EAAI,CAQ3E,QAPA,IAAM,EAAI,MAAM,EAAE,EAGd,MAAM,MAAG,IAAM,EAAI,KAAK,EAAQ,GAAM,IAAM,GAAG,EAAG,CAAC,MAAM,IAAI,GAAG,CAAC,GACrE,IAAM,EAAO,GAAK,IAAI,EAAK,EAAE,EAAE,EAAI,EAEnC,EAAK,YAAY,GACV,KAAM,QAAQ,IAAW,IAAM,EAAM,GAAK,EAAG,IAAI;AAI1D,IADA,IAAM,GACN,KAAe;;;EAQnB,SAAS,EAAa,GAAG,GAAK;GAC5B,IAAI,GAAG,GAAG;AAmBV,SAhBK,IAAI,EAAI,QAAQ,IAAI,IAAI,OAAI,IAAM,EAAI,QAAQ,KAAK,GAAG,IAGtD,IAAI,EAAI,OAAO,KAAK,IAAI,KAGvB,IAAI,MAAG,IAAI,IACf,KAAK,CAAC,EAAI,MAAM,IAAI,EAAE,EACtB,IAAM,EAAI,UAAU,GAAG,EAAE,IAChB,IAAI,MAGb,IAAI,EAAI,SAIL,IAAI,GAAG,EAAI,WAAW,EAAE,KAAK,IAAK,GAAE;AAGzC,QAAK,IAAM,EAAI,QAAQ,EAAI,WAAW,IAAM,EAAE,KAAK,IAAK,GAAE;AAG1D,OAFA,IAAM,EAAI,MAAM,GAAG,EAAI,EAEnB,GAAK;AAaP,QAZA,KAAO,GACP,IAAI,IAAI,IAAI,GACZ,EAAE,IAAI,EAAU,IAAI,EAAS,EAC7B,EAAE,IAAI,EAAE,EAMR,KAAK,IAAI,KAAK,GACV,IAAI,MAAG,KAAK,IAEZ,IAAI,GAAK;AAEX,UADI,KAAG,EAAE,EAAE,KAAK,CAAC,EAAI,MAAM,GAAG,EAAE,CAAC,EAC5B,KAAO,GAAU,IAAI,GAAM,GAAE,EAAE,KAAK,CAAC,EAAI,MAAM,GAAG,KAAK,EAAS,CAAC;AAEtE,KADA,IAAM,EAAI,MAAM,EAAE,EAClB,IAAI,IAAW,EAAI;UAEnB,MAAK;AAGP,WAAO,KAAM,MAAO;AAGpB,QAFA,EAAE,EAAE,KAAK,CAAC,EAAI,EAEV,MAAa,EAAE,IAAI,KAAS,EAAE,IAAI,CAAC,GAAQ,OAAM,MAAM,IAAqB,EAAE;SAMlF,CAFA,EAAE,IAAI,GACN,EAAE,IAAI,GACN,EAAE,IAAI,CAAC,EAAE;AAGX,UAAO;;EAOR,SAAS,EAAM,GAAG,GAAI,GAAI;GACzB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAI,GAAS,GAAG,GAC9B,IAAK,EAAE;AAWT,QAAK,IAAI,GAAG,IAAI,EAAG,IAAI,KAAK,IAAI,KAAK,GAAI;AAIzC,OAHA,IAAI,IAAK,GAGL,IAAI,EAGN,CAFA,KAAK,GACL,IAAI,GACJ,IAAI,EAAG,IAAM;QACR;AAGL,QAFA,IAAM,KAAK,MAAM,IAAI,KAAK,EAAS,EACnC,IAAI,EAAG,QACH,KAAO,EAAG,QAAO;AAIrB,SAHA,IAAI,IAAI,EAAG,IAGN,IAAI,GAAG,KAAK,IAAI,KAAK,GAAI;AAO9B,IAJA,KAAK,GAIL,IAAI,IAAI,IAAW;;AAyBrB,OAtBI,MAAO,KAAK,MACd,IAAI,EAAQ,IAAI,IAAI,IAAI,EAAE,EAG1B,IAAK,IAAI,IAAI,KAAK,GAGlB,IAAU,IAAK,KAAK,EAAG,IAAM,OAAO,KAAK,KAAK,IAAI,GAMlD,IAAU,IAAK,KACV,KAAM,OAAa,KAAM,KAAK,MAAO,EAAE,IAAI,IAAI,IAAI,MACpD,IAAK,KAAK,KAAM,MAAM,KAAM,KAAK,KAAW,KAAM,MAGhD,IAAI,IAAI,IAAI,IAAI,IAAI,EAAQ,IAAI,IAAI,EAAE,GAAG,IAAI,EAAG,IAAM,MAAM,KAAM,KAClE,MAAO,EAAE,IAAI,IAAI,IAAI,MAGzB,IAAK,KAAK,CAAC,EAAG,GAkBhB,QAjBI,KACF,IAAI,EAAkB,EAAE,EACxB,EAAG,SAAS,GAGZ,IAAK,IAAK,IAAI,GAGd,EAAG,KAAK,EAAQ,KAAK,IAAW,IAAK,KAAY,EAAS,EAC1D,EAAE,IAAI,EAAU,CAAC,IAAK,EAAS,IAAI,MAEnC,EAAG,SAAS,GAGZ,EAAG,KAAK,EAAE,IAAI,EAAE,IAAI,IAGf;AAiBT,OAbI,KAAK,KACP,EAAG,SAAS,GACZ,IAAI,GACJ,QAEA,EAAG,SAAS,IAAM,GAClB,IAAI,EAAQ,IAAI,IAAW,EAAE,EAI7B,EAAG,KAAO,IAAI,KAAK,IAAI,EAAQ,IAAI,IAAI,EAAE,GAAG,EAAQ,IAAI,EAAE,GAAG,KAAK,IAAI,IAGpE,EACF,SAGE,KAAI,KAAO,GAAG;AACZ,KAAK,EAAG,MAAM,MAAM,MAClB,EAAG,KAAK,GACR,EAAE,EAAE;AAGN;UACK;AAEL,QADA,EAAG,MAAQ,GACP,EAAG,MAAQ,EAAM;AAErB,IADA,EAAG,OAAS,GACZ,IAAI;;AAMV,QAAK,IAAI,EAAG,QAAQ,EAAG,EAAE,OAAO,GAAI,GAAG,KAAK;AAE5C,OAAI,MAAa,EAAE,IAAI,KAAS,EAAE,IAAI,CAAC,GACrC,OAAM,MAAM,IAAqB,EAAkB,EAAE,CAAC;AAGxD,UAAO;;EAIT,SAAS,EAAS,GAAG,GAAG;GACtB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAK,GAAI,GAAI,GAAM,GACpC,IAAO,EAAE,aACT,IAAK,EAAK;AAIZ,OAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAGb,QAFI,EAAE,IAAG,EAAE,IAAI,CAAC,EAAE,IACb,IAAI,IAAI,EAAK,EAAE,EACb,IAAW,EAAM,GAAG,EAAG,GAAG;AAcnC,OAXA,IAAK,EAAE,GACP,IAAK,EAAE,GAIP,IAAI,EAAE,GACN,IAAK,EAAE,GACP,IAAK,EAAG,OAAO,EACf,IAAI,IAAK,GAGL,GAAG;AAyBL,SAxBA,IAAO,IAAI,GAEP,KACF,IAAI,GACJ,IAAI,CAAC,GACL,IAAM,EAAG,WAET,IAAI,GACJ,IAAI,GACJ,IAAM,EAAG,SAMX,IAAI,KAAK,IAAI,KAAK,KAAK,IAAK,EAAS,EAAE,EAAI,GAAG,GAE1C,IAAI,MACN,IAAI,GACJ,EAAE,SAAS,IAIb,EAAE,SAAS,EACN,IAAI,GAAG,KAAM,GAAE,KAAK,EAAE;AAC3B,MAAE,SAAS;UAGN;AASL,SALA,IAAI,EAAG,QACP,IAAM,EAAG,QACT,IAAO,IAAI,GACP,MAAM,IAAM,IAEX,IAAI,GAAG,IAAI,GAAK,IACnB,KAAI,EAAG,MAAM,EAAG,IAAI;AAClB,SAAO,EAAG,KAAK,EAAG;AAClB;;AAIJ,QAAI;;AAcN,QAXI,MACF,IAAI,GACJ,IAAK,GACL,IAAK,GACL,EAAE,IAAI,CAAC,EAAE,IAGX,IAAM,EAAG,QAIJ,IAAI,EAAG,SAAS,GAAK,IAAI,GAAG,EAAE,EAAG,GAAG,OAAS;AAGlD,QAAK,IAAI,EAAG,QAAQ,IAAI,IAAI;AAC1B,QAAI,EAAG,EAAE,KAAK,EAAG,IAAI;AACnB,UAAK,IAAI,GAAG,KAAK,EAAG,EAAE,OAAO,GAAI,GAAG,KAAK,IAAO;AAEhD,KADA,EAAE,EAAG,IACL,EAAG,MAAM;;AAGX,MAAG,MAAM,EAAG;;AAId,UAAO,EAAG,EAAE,OAAS,GAAI,GAAG,KAAK;AAGjC,UAAO,EAAG,OAAO,GAAG,EAAG,OAAO,CAAE,GAAE;AASlC,UANK,EAAG,MAER,EAAE,IAAI,GACN,EAAE,IAAI,GAGC,IAAW,EAAM,GAAG,EAAG,GAAG,KANd,IAAI,EAAK,EAAE;;EAUhC,SAAS,EAAS,GAAG,GAAO,GAAI;GAC9B,IAAI,GACF,IAAI,EAAkB,EAAE,EACxB,IAAM,EAAe,EAAE,EAAE,EACzB,IAAM,EAAI;AAwBZ,UAtBI,KACE,MAAO,IAAI,IAAK,KAAO,IACzB,IAAM,EAAI,OAAO,EAAE,GAAG,MAAM,EAAI,MAAM,EAAE,GAAG,EAAc,EAAE,GAClD,IAAM,MACf,IAAM,EAAI,OAAO,EAAE,GAAG,MAAM,EAAI,MAAM,EAAE,GAG1C,IAAM,KAAO,IAAI,IAAI,MAAM,QAAQ,KAC1B,IAAI,KACb,IAAM,OAAO,EAAc,CAAC,IAAI,EAAE,GAAG,GACjC,MAAO,IAAI,IAAK,KAAO,MAAG,KAAO,EAAc,EAAE,KAC5C,KAAK,KACd,KAAO,EAAc,IAAI,IAAI,EAAI,EAC7B,MAAO,IAAI,IAAK,IAAI,KAAK,MAAG,IAAM,IAAM,MAAM,EAAc,EAAE,OAE7D,IAAI,IAAI,KAAK,MAAK,IAAM,EAAI,MAAM,GAAG,EAAE,GAAG,MAAM,EAAI,MAAM,EAAE,GAC7D,MAAO,IAAI,IAAK,KAAO,MACrB,IAAI,MAAM,MAAK,KAAO,MAC1B,KAAO,EAAc,EAAE,IAIpB,EAAE,IAAI,IAAI,MAAM,IAAM;;EAK/B,SAAS,EAAS,GAAK,GAAK;AAC1B,OAAI,EAAI,SAAS,EAEf,QADA,EAAI,SAAS,GACN;;EAmBX,SAAS,EAAM,GAAK;GAClB,IAAI,GAAG,GAAG;GASV,SAAS,EAAQ,GAAO;IACtB,IAAI,IAAI;AAGR,QAAI,EAAE,aAAa,GAAU,QAAO,IAAI,EAAQ,EAAM;AAOtD,QAHA,EAAE,cAAc,GAGZ,aAAiB,GAAS;AAG5B,KAFA,EAAE,IAAI,EAAM,GACZ,EAAE,IAAI,EAAM,GACZ,EAAE,KAAK,IAAQ,EAAM,KAAK,EAAM,OAAO,GAAG;AAC1C;;AAGF,QAAI,OAAO,KAAU,UAAU;AAG7B,SAAI,IAAQ,KAAM,EAChB,OAAM,MAAM,IAAkB,EAAM;AAGtC,SAAI,IAAQ,EACV,GAAE,IAAI;cACG,IAAQ,EAEjB,CADA,IAAQ,CAAC,GACT,EAAE,IAAI;UACD;AAGL,MAFA,EAAE,IAAI,GACN,EAAE,IAAI,GACN,EAAE,IAAI,CAAC,EAAE;AACT;;AAIF,SAAI,MAAU,CAAC,CAAC,KAAS,IAAQ,KAAK;AAEpC,MADA,EAAE,IAAI,GACN,EAAE,IAAI,CAAC,EAAM;AACb;;AAGF,YAAO,EAAa,GAAG,EAAM,UAAU,CAAC;eAC/B,OAAO,KAAU,SAC1B,OAAM,MAAM,IAAkB,EAAM;AAWtC,QAPI,EAAM,WAAW,EAAE,KAAK,MAC1B,IAAQ,EAAM,MAAM,EAAE,EACtB,EAAE,IAAI,MAEN,EAAE,IAAI,GAGJ,EAAU,KAAK,EAAM,CAAE,GAAa,GAAG,EAAM;QAC5C,OAAM,MAAM,IAAkB,EAAM;;AAmB3C,OAhBA,EAAQ,YAAY,GAEpB,EAAQ,WAAW,GACnB,EAAQ,aAAa,GACrB,EAAQ,aAAa,GACrB,EAAQ,cAAc,GACtB,EAAQ,gBAAgB,GACxB,EAAQ,kBAAkB,GAC1B,EAAQ,kBAAkB,GAC1B,EAAQ,kBAAkB,GAC1B,EAAQ,mBAAmB,GAE3B,EAAQ,QAAQ,GAChB,EAAQ,SAAS,EAAQ,MAAM,GAE3B,MAAQ,KAAK,MAAG,IAAM,EAAE,GACxB,EAEF,MADA,IAAK;IAAC;IAAa;IAAY;IAAY;IAAY;IAAO,EACzD,IAAI,GAAG,IAAI,EAAG,QAAS,CAAK,EAAI,eAAe,IAAI,EAAG,KAAK,KAAE,EAAI,KAAK,KAAK;AAKlF,UAFA,EAAQ,OAAO,EAAI,EAEZ;;EAiBT,SAAS,EAAO,GAAK;AACnB,OAAI,CAAC,KAAO,OAAO,KAAQ,SACzB,OAAM,MAAM,IAAe,kBAAkB;GAE/C,IAAI,GAAG,GAAG,GACR,IAAK;IACH;IAAa;IAAG;IAChB;IAAY;IAAG;IACf;IAAY;IAAQ;IACpB;IAAY;IAAG;IAChB;AAEH,QAAK,IAAI,GAAG,IAAI,EAAG,QAAQ,KAAK,EAC9B,MAAK,IAAI,EAAI,IAAI,EAAG,SAAS,KAAK,EAChC,KAAI,EAAU,EAAE,KAAK,KAAK,KAAK,EAAG,IAAI,MAAM,KAAK,EAAG,IAAI,GAAI,MAAK,KAAK;OACjE,OAAM,MAAM,IAAkB,IAAI,OAAO,EAAE;AAIpD,QAAK,IAAI,EAAI,IAAI,aAAa,KAAK,EAC/B,KAAI,KAAK,KAAK,KAAM,MAAK,KAAK,IAAI,KAAK,EAAE;OACpC,OAAM,MAAM,IAAkB,IAAI,OAAO,EAAE;AAGpD,UAAO;;AAiBT,EAZA,IAAU,EAAM,EAAQ,EAExB,EAAQ,UAAa,EAAQ,UAAU,GAGvC,IAAM,IAAI,EAAQ,EAAE,EAOhB,OAAO,UAAU,cAAc,OAAO,MACxC,OAAO,WAAY;AACjB,UAAO;IACP,GAGc,MAAU,UAAe,EAAO,UAChD,EAAO,UAAU,KAIjB,AACE,MAAc,OAAO,OAAQ,OAAe,QAAQ,KAAK,QAAQ,OAC7D,OAAO,SAAS,cAAc,EAAE,EAGtC,EAAY,UAAU;MAElB"}