@graffiticode/l0179-view 0.1.1 → 0.1.3

package/dist/scoring-D1FbQ_qt.js

@@ -0,0 +1,4598 @@
+//#region ../../node_modules/decimal.js/decimal.mjs
+var e = 9e15, t = 1e9, n = "0123456789abcdef", r = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", i = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", a = {
+	precision: 20,
+	rounding: 4,
+	modulo: 1,
+	toExpNeg: -7,
+	toExpPos: 21,
+	minE: -e,
+	maxE: e,
+	crypto: !1
+}, o, s, c = !0, l = "[DecimalError] ", u = l + "Invalid argument: ", d = l + "Precision limit exceeded", f = l + "crypto unavailable", p = "[object Decimal]", m = Math.floor, h = Math.pow, g = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, _ = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, v = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, y = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, b = 1e7, x = 7, S = 9007199254740991, C = r.length - 1, w = i.length - 1, T = { toStringTag: p };
+T.absoluteValue = T.abs = function() {
+	var e = new this.constructor(this);
+	return e.s < 0 && (e.s = 1), j(e);
+}, T.ceil = function() {
+	return j(new this.constructor(this), this.e + 1, 2);
+}, T.clampedTo = T.clamp = function(e, t) {
+	var n, r = this, i = r.constructor;
+	if (e = new i(e), t = new i(t), !e.s || !t.s) return new i(NaN);
+	if (e.gt(t)) throw Error(u + t);
+	return n = r.cmp(e), n < 0 ? e : r.cmp(t) > 0 ? t : new i(r);
+}, T.comparedTo = T.cmp = function(e) {
+	var t, n, r, i, a = this, o = a.d, s = (e = new a.constructor(e)).d, c = a.s, l = e.s;
+	if (!o || !s) return !c || !l ? NaN : c === l ? o === s ? 0 : !o ^ c < 0 ? 1 : -1 : c;
+	if (!o[0] || !s[0]) return o[0] ? c : s[0] ? -l : 0;
+	if (c !== l) return c;
+	if (a.e !== e.e) return a.e > e.e ^ c < 0 ? 1 : -1;
+	for (r = o.length, i = s.length, t = 0, n = r < i ? r : i; t < n; ++t) if (o[t] !== s[t]) return o[t] > s[t] ^ c < 0 ? 1 : -1;
+	return r === i ? 0 : r > i ^ c < 0 ? 1 : -1;
+}, T.cosine = T.cos = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.d ? n.d[0] ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + x, r.rounding = 1, n = k(r, ue(r, n)), r.precision = e, r.rounding = t, j(s == 2 || s == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
+}, T.cubeRoot = T.cbrt = function() {
+	var e, t, n, r, i, a, o, s, l, u, d = this, f = d.constructor;
+	if (!d.isFinite() || d.isZero()) return new f(d);
+	for (c = !1, a = d.s * h(d.s * d, 1 / 3), !a || Math.abs(a) == 1 / 0 ? (n = E(d.d), e = d.e, (a = (e - n.length + 1) % 3) && (n += a == 1 || a == -2 ? "0" : "00"), a = h(n, 1 / 3), e = m((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), a == 1 / 0 ? n = "5e" + e : (n = a.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new f(n), r.s = d.s) : r = new f(a.toString()), o = (e = f.precision) + 3;;) if (s = r, l = s.times(s).times(s), u = l.plus(d), r = A(u.plus(d).times(s), u.plus(l), o + 2, 1), E(s.d).slice(0, o) === (n = E(r.d)).slice(0, o)) {
+		if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
+			if (!i && (j(s, e + 1, 0), s.times(s).times(s).eq(d))) {
+				r = s;
+				break;
+			}
+			o += 4, i = 1;
+		} else {
+			(!+n || !+n.slice(1) && n.charAt(0) == "5") && (j(r, e + 1, 1), t = !r.times(r).times(r).eq(d));
+			break;
+		}
+	}
+	return c = !0, j(r, e, f.rounding, t);
+}, T.decimalPlaces = T.dp = function() {
+	var e, t = this.d, n = NaN;
+	if (t) {
+		if (e = t.length - 1, n = (e - m(this.e / x)) * x, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
+		n < 0 && (n = 0);
+	}
+	return n;
+}, T.dividedBy = T.div = function(e) {
+	return A(this, new this.constructor(e));
+}, T.dividedToIntegerBy = T.divToInt = function(e) {
+	var t = this, n = t.constructor;
+	return j(A(t, new n(e), 0, 1, 1), n.precision, n.rounding);
+}, T.equals = T.eq = function(e) {
+	return this.cmp(e) === 0;
+}, T.floor = function() {
+	return j(new this.constructor(this), this.e + 1, 3);
+}, T.greaterThan = T.gt = function(e) {
+	return this.cmp(e) > 0;
+}, T.greaterThanOrEqualTo = T.gte = function(e) {
+	var t = this.cmp(e);
+	return t == 1 || t === 0;
+}, T.hyperbolicCosine = T.cosh = function() {
+	var e, t, n, r, i, a = this, o = a.constructor, s = new o(1);
+	if (!a.isFinite()) return new o(a.s ? 1 / 0 : NaN);
+	if (a.isZero()) return s;
+	n = o.precision, r = o.rounding, o.precision = n + Math.max(a.e, a.sd()) + 4, o.rounding = 1, i = a.d.length, i < 32 ? (e = Math.ceil(i / 3), t = (1 / le(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), a = z(o, 1, a.times(t), new o(1), !0);
+	for (var c, l = e, u = new o(8); l--;) c = a.times(a), a = s.minus(c.times(u.minus(c.times(u))));
+	return j(a, o.precision = n, o.rounding = r, !0);
+}, T.hyperbolicSine = T.sinh = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	if (!i.isFinite() || i.isZero()) return new a(i);
+	if (t = a.precision, n = a.rounding, a.precision = t + Math.max(i.e, i.sd()) + 4, a.rounding = 1, r = i.d.length, r < 3) i = z(a, 2, i, i, !0);
+	else {
+		e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / le(5, e)), i = z(a, 2, i, i, !0);
+		for (var o, s = new a(5), c = new a(16), l = new a(20); e--;) o = i.times(i), i = i.times(s.plus(o.times(c.times(o).plus(l))));
+	}
+	return a.precision = t, a.rounding = n, j(i, t, n, !0);
+}, T.hyperbolicTangent = T.tanh = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 7, r.rounding = 1, A(n.sinh(), n.cosh(), r.precision = e, r.rounding = t)) : new r(n.s);
+}, T.inverseCosine = T.acos = function() {
+	var e = this, t = e.constructor, n = e.abs().cmp(1), r = t.precision, i = t.rounding;
+	return n === -1 ? e.isZero() ? P(t, r + 4, i).times(.5) : (t.precision = r + 6, t.rounding = 1, e = new t(1).minus(e).div(e.plus(1)).sqrt().atan(), t.precision = r, t.rounding = i, e.times(2)) : n === 0 ? e.isNeg() ? P(t, r, i) : new t(0) : new t(NaN);
+}, T.inverseHyperbolicCosine = T.acosh = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.lte(1) ? new r(n.eq(1) ? 0 : NaN) : n.isFinite() ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(Math.abs(n.e), n.sd()) + 4, r.rounding = 1, c = !1, n = n.times(n).minus(1).sqrt().plus(n), c = !0, r.precision = e, r.rounding = t, n.ln()) : new r(n);
+}, T.inverseHyperbolicSine = T.asinh = function() {
+	var e, t, n = this, r = n.constructor;
+	return !n.isFinite() || n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 2 * Math.max(Math.abs(n.e), n.sd()) + 6, r.rounding = 1, c = !1, n = n.times(n).plus(1).sqrt().plus(n), c = !0, r.precision = e, r.rounding = t, n.ln());
+}, T.inverseHyperbolicTangent = T.atanh = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	return i.isFinite() ? i.e >= 0 ? new a(i.abs().eq(1) ? i.s / 0 : i.isZero() ? i : NaN) : (e = a.precision, t = a.rounding, r = i.sd(), Math.max(r, e) < 2 * -i.e - 1 ? j(new a(i), e, t, !0) : (a.precision = n = r - i.e, i = A(i.plus(1), new a(1).minus(i), n + e, 1), a.precision = e + 4, a.rounding = 1, i = i.ln(), a.precision = e, a.rounding = t, i.times(.5))) : new a(NaN);
+}, T.inverseSine = T.asin = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	return i.isZero() ? new a(i) : (t = i.abs().cmp(1), n = a.precision, r = a.rounding, t === -1 ? (a.precision = n + 6, a.rounding = 1, i = i.div(new a(1).minus(i.times(i)).sqrt().plus(1)).atan(), a.precision = n, a.rounding = r, i.times(2)) : t === 0 ? (e = P(a, n + 4, r).times(.5), e.s = i.s, e) : new a(NaN));
+}, T.inverseTangent = T.atan = function() {
+	var e, t, n, r, i, a, o, s, l, u = this, d = u.constructor, f = d.precision, p = d.rounding;
+	if (!u.isFinite()) {
+		if (!u.s) return new d(NaN);
+		if (f + 4 <= w) return o = P(d, f + 4, p).times(.5), o.s = u.s, o;
+	} else if (u.isZero()) return new d(u);
+	else if (u.abs().eq(1) && f + 4 <= w) return o = P(d, f + 4, p).times(.25), o.s = u.s, o;
+	for (d.precision = s = f + 10, d.rounding = 1, n = Math.min(28, s / x + 2 | 0), e = n; e; --e) u = u.div(u.times(u).plus(1).sqrt().plus(1));
+	for (c = !1, t = Math.ceil(s / x), r = 1, l = u.times(u), o = new d(u), i = u; e !== -1;) if (i = i.times(l), a = o.minus(i.div(r += 2)), i = i.times(l), o = a.plus(i.div(r += 2)), o.d[t] !== void 0) for (e = t; o.d[e] === a.d[e] && e--;);
+	return n && (o = o.times(2 << n - 1)), c = !0, j(o, d.precision = f, d.rounding = p, !0);
+}, T.isFinite = function() {
+	return !!this.d;
+}, T.isInteger = T.isInt = function() {
+	return !!this.d && m(this.e / x) > this.d.length - 2;
+}, T.isNaN = function() {
+	return !this.s;
+}, T.isNegative = T.isNeg = function() {
+	return this.s < 0;
+}, T.isPositive = T.isPos = function() {
+	return this.s > 0;
+}, T.isZero = function() {
+	return !!this.d && this.d[0] === 0;
+}, T.lessThan = T.lt = function(e) {
+	return this.cmp(e) < 0;
+}, T.lessThanOrEqualTo = T.lte = function(e) {
+	return this.cmp(e) < 1;
+}, T.logarithm = T.log = function(e) {
+	var t, n, r, i, a, o, s, l, u = this, d = u.constructor, f = d.precision, p = d.rounding, m = 5;
+	if (e == null) e = new d(10), t = !0;
+	else {
+		if (e = new d(e), n = e.d, e.s < 0 || !n || !n[0] || e.eq(1)) return new d(NaN);
+		t = e.eq(10);
+	}
+	if (n = u.d, u.s < 0 || !n || !n[0] || u.eq(1)) return new d(n && !n[0] ? -1 / 0 : u.s == 1 ? n ? 0 : 1 / 0 : NaN);
+	if (t) {
+		if (n.length > 1) a = !0;
+		else {
+			for (i = n[0]; i % 10 == 0;) i /= 10;
+			a = i !== 1;
+		}
+	}
+	if (c = !1, s = f + m, o = L(u, s), r = t ? te(d, s + 10) : L(e, s), l = A(o, r, s, 1), O(l.d, i = f, p)) do
+		if (s += 10, o = L(u, s), r = t ? te(d, s + 10) : L(e, s), l = A(o, r, s, 1), !a) {
+			+E(l.d).slice(i + 1, i + 15) + 1 == 0x5af3107a4000 && (l = j(l, f + 1, 0));
+			break;
+		}
+	while (O(l.d, i += 10, p));
+	return c = !0, j(l, f, p);
+}, T.minus = T.sub = function(e) {
+	var t, n, r, i, a, o, s, l, u, d, f, p, h = this, g = h.constructor;
+	if (e = new g(e), !h.d || !e.d) return !h.s || !e.s ? e = new g(NaN) : h.d ? e.s = -e.s : e = new g(e.d || h.s !== e.s ? h : NaN), e;
+	if (h.s != e.s) return e.s = -e.s, h.plus(e);
+	if (u = h.d, p = e.d, s = g.precision, l = g.rounding, !u[0] || !p[0]) {
+		if (p[0]) e.s = -e.s;
+		else if (u[0]) e = new g(h);
+		else return new g(l === 3 ? -0 : 0);
+		return c ? j(e, s, l) : e;
+	}
+	if (n = m(e.e / x), d = m(h.e / x), u = u.slice(), a = d - n, a) {
+		for (f = a < 0, f ? (t = u, a = -a, o = p.length) : (t = p, n = d, o = u.length), r = Math.max(Math.ceil(s / x), o) + 2, a > r && (a = r, t.length = 1), t.reverse(), r = a; r--;) t.push(0);
+		t.reverse();
+	} else {
+		for (r = u.length, o = p.length, f = r < o, f && (o = r), r = 0; r < o; r++) if (u[r] != p[r]) {
+			f = u[r] < p[r];
+			break;
+		}
+		a = 0;
+	}
+	for (f && (t = u, u = p, p = t, e.s = -e.s), o = u.length, r = p.length - o; r > 0; --r) u[o++] = 0;
+	for (r = p.length; r > a;) {
+		if (u[--r] < p[r]) {
+			for (i = r; i && u[--i] === 0;) u[i] = b - 1;
+			--u[i], u[r] += b;
+		}
+		u[r] -= p[r];
+	}
+	for (; u[--o] === 0;) u.pop();
+	for (; u[0] === 0; u.shift()) --n;
+	return u[0] ? (e.d = u, e.e = N(u, n), c ? j(e, s, l) : e) : new g(l === 3 ? -0 : 0);
+}, T.modulo = T.mod = function(e) {
+	var t, n = this, r = n.constructor;
+	return e = new r(e), !n.d || !e.s || e.d && !e.d[0] ? new r(NaN) : !e.d || n.d && !n.d[0] ? j(new r(n), r.precision, r.rounding) : (c = !1, r.modulo == 9 ? (t = A(n, e.abs(), 0, 3, 1), t.s *= e.s) : t = A(n, e, 0, r.modulo, 1), t = t.times(e), c = !0, n.minus(t));
+}, T.naturalExponential = T.exp = function() {
+	return ae(this);
+}, T.naturalLogarithm = T.ln = function() {
+	return L(this);
+}, T.negated = T.neg = function() {
+	var e = new this.constructor(this);
+	return e.s = -e.s, j(e);
+}, T.plus = T.add = function(e) {
+	var t, n, r, i, a, o, s, l, u, d, f = this, p = f.constructor;
+	if (e = new p(e), !f.d || !e.d) return !f.s || !e.s ? e = new p(NaN) : f.d || (e = new p(e.d || f.s === e.s ? f : NaN)), e;
+	if (f.s != e.s) return e.s = -e.s, f.minus(e);
+	if (u = f.d, d = e.d, s = p.precision, l = p.rounding, !u[0] || !d[0]) return d[0] || (e = new p(f)), c ? j(e, s, l) : e;
+	if (a = m(f.e / x), r = m(e.e / x), u = u.slice(), i = a - r, i) {
+		for (i < 0 ? (n = u, i = -i, o = d.length) : (n = d, r = a, o = u.length), a = Math.ceil(s / x), o = a > o ? a + 1 : o + 1, i > o && (i = o, n.length = 1), n.reverse(); i--;) n.push(0);
+		n.reverse();
+	}
+	for (o = u.length, i = d.length, o - i < 0 && (i = o, n = d, d = u, u = n), t = 0; i;) t = (u[--i] = u[i] + d[i] + t) / b | 0, u[i] %= b;
+	for (t && (u.unshift(t), ++r), o = u.length; u[--o] == 0;) u.pop();
+	return e.d = u, e.e = N(u, r), c ? j(e, s, l) : e;
+}, T.precision = T.sd = function(e) {
+	var t, n = this;
+	if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(u + e);
+	return n.d ? (t = F(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
+}, T.round = function() {
+	var e = this, t = e.constructor;
+	return j(new t(e), e.e + 1, t.rounding);
+}, T.sine = T.sin = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + x, r.rounding = 1, n = ce(r, ue(r, n)), r.precision = e, r.rounding = t, j(s > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, T.squareRoot = T.sqrt = function() {
+	var e, t, n, r, i, a, o = this, s = o.d, l = o.e, u = o.s, d = o.constructor;
+	if (u !== 1 || !s || !s[0]) return new d(!u || u < 0 && (!s || s[0]) ? NaN : s ? o : 1 / 0);
+	for (c = !1, u = Math.sqrt(+o), u == 0 || u == 1 / 0 ? (t = E(s), (t.length + l) % 2 == 0 && (t += "0"), u = Math.sqrt(t), l = m((l + 1) / 2) - (l < 0 || l % 2), u == 1 / 0 ? t = "5e" + l : (t = u.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + l), r = new d(t)) : r = new d(u.toString()), n = (l = d.precision) + 3;;) if (a = r, r = a.plus(A(o, a, n + 2, 1)).times(.5), E(a.d).slice(0, n) === (t = E(r.d)).slice(0, n)) {
+		if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
+			if (!i && (j(a, l + 1, 0), a.times(a).eq(o))) {
+				r = a;
+				break;
+			}
+			n += 4, i = 1;
+		} else {
+			(!+t || !+t.slice(1) && t.charAt(0) == "5") && (j(r, l + 1, 1), e = !r.times(r).eq(o));
+			break;
+		}
+	}
+	return c = !0, j(r, l, d.rounding, e);
+}, T.tangent = T.tan = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 10, r.rounding = 1, n = n.sin(), n.s = 1, n = A(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, j(s == 2 || s == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, T.times = T.mul = function(e) {
+	var t, n, r, i, a, o, s, l, u, d = this, f = d.constructor, p = d.d, h = (e = new f(e)).d;
+	if (e.s *= d.s, !p || !p[0] || !h || !h[0]) return new f(!e.s || p && !p[0] && !h || h && !h[0] && !p ? NaN : !p || !h ? e.s / 0 : e.s * 0);
+	for (n = m(d.e / x) + m(e.e / x), l = p.length, u = h.length, l < u && (a = p, p = h, h = a, o = l, l = u, u = o), a = [], o = l + u, r = o; r--;) a.push(0);
+	for (r = u; --r >= 0;) {
+		for (t = 0, i = l + r; i > r;) s = a[i] + h[r] * p[i - r - 1] + t, a[i--] = s % b | 0, t = s / b | 0;
+		a[i] = (a[i] + t) % b | 0;
+	}
+	for (; !a[--o];) a.pop();
+	return t ? ++n : a.shift(), e.d = a, e.e = N(a, n), c ? j(e, f.precision, f.rounding) : e;
+}, T.toBinary = function(e, t) {
+	return de(this, 2, e, t);
+}, T.toDecimalPlaces = T.toDP = function(e, n) {
+	var r = this, i = r.constructor;
+	return r = new i(r), e === void 0 ? r : (D(e, 0, t), n === void 0 ? n = i.rounding : D(n, 0, 8), j(r, e + r.e + 1, n));
+}, T.toExponential = function(e, n) {
+	var r, i = this, a = i.constructor;
+	return e === void 0 ? r = M(i, !0) : (D(e, 0, t), n === void 0 ? n = a.rounding : D(n, 0, 8), i = j(new a(i), e + 1, n), r = M(i, !0, e + 1)), i.isNeg() && !i.isZero() ? "-" + r : r;
+}, T.toFixed = function(e, n) {
+	var r, i, a = this, o = a.constructor;
+	return e === void 0 ? r = M(a) : (D(e, 0, t), n === void 0 ? n = o.rounding : D(n, 0, 8), i = j(new o(a), e + a.e + 1, n), r = M(i, !1, e + i.e + 1)), a.isNeg() && !a.isZero() ? "-" + r : r;
+}, T.toFraction = function(e) {
+	var t, n, r, i, a, o, s, l, d, f, p, m, g = this, _ = g.d, v = g.constructor;
+	if (!_) return new v(g);
+	if (d = n = new v(1), r = l = new v(0), t = new v(r), a = t.e = F(_) - g.e - 1, o = a % x, t.d[0] = h(10, o < 0 ? x + o : o), e == null) e = a > 0 ? t : d;
+	else {
+		if (s = new v(e), !s.isInt() || s.lt(d)) throw Error(u + s);
+		e = s.gt(t) ? a > 0 ? t : d : s;
+	}
+	for (c = !1, s = new v(E(_)), f = v.precision, v.precision = a = _.length * x * 2; p = A(s, t, 0, 1, 1), i = n.plus(p.times(r)), i.cmp(e) != 1;) n = r, r = i, i = d, d = l.plus(p.times(i)), l = i, i = t, t = s.minus(p.times(i)), s = i;
+	return i = A(e.minus(n), r, 0, 1, 1), l = l.plus(i.times(d)), n = n.plus(i.times(r)), l.s = d.s = g.s, m = A(d, r, a, 1).minus(g).abs().cmp(A(l, n, a, 1).minus(g).abs()) < 1 ? [d, r] : [l, n], v.precision = f, c = !0, m;
+}, T.toHexadecimal = T.toHex = function(e, t) {
+	return de(this, 16, e, t);
+}, T.toNearest = function(e, t) {
+	var n = this, r = n.constructor;
+	if (n = new r(n), e == null) {
+		if (!n.d) return n;
+		e = new r(1), t = r.rounding;
+	} else {
+		if (e = new r(e), t === void 0 ? t = r.rounding : D(t, 0, 8), !n.d) return e.s ? n : e;
+		if (!e.d) return e.s && (e.s = n.s), e;
+	}
+	return e.d[0] ? (c = !1, n = A(n, e, 0, t, 1).times(e), c = !0, j(n)) : (e.s = n.s, n = e), n;
+}, T.toNumber = function() {
+	return +this;
+}, T.toOctal = function(e, t) {
+	return de(this, 8, e, t);
+}, T.toPower = T.pow = function(e) {
+	var t, n, r, i, a, o, s = this, l = s.constructor, u = +(e = new l(e));
+	if (!s.d || !e.d || !s.d[0] || !e.d[0]) return new l(h(+s, u));
+	if (s = new l(s), s.eq(1)) return s;
+	if (r = l.precision, a = l.rounding, e.eq(1)) return j(s, r, a);
+	if (t = m(e.e / x), t >= e.d.length - 1 && (n = u < 0 ? -u : u) <= S) return i = I(l, s, n, r), e.s < 0 ? new l(1).div(i) : j(i, r, a);
+	if (o = s.s, o < 0) {
+		if (t < e.d.length - 1) return new l(NaN);
+		if (e.d[t] & 1 || (o = 1), s.e == 0 && s.d[0] == 1 && s.d.length == 1) return s.s = o, s;
+	}
+	return n = h(+s, u), t = n == 0 || !isFinite(n) ? m(u * (Math.log("0." + E(s.d)) / Math.LN10 + s.e + 1)) : new l(n + "").e, t > l.maxE + 1 || t < l.minE - 1 ? new l(t > 0 ? o / 0 : 0) : (c = !1, l.rounding = s.s = 1, n = Math.min(12, (t + "").length), i = ae(e.times(L(s, r + n)), r), i.d && (i = j(i, r + 5, 1), O(i.d, r, a) && (t = r + 10, i = j(ae(e.times(L(s, t + n)), t), t + 5, 1), +E(i.d).slice(r + 1, r + 15) + 1 == 0x5af3107a4000 && (i = j(i, r + 1, 0)))), i.s = o, c = !0, l.rounding = a, j(i, r, a));
+}, T.toPrecision = function(e, n) {
+	var r, i = this, a = i.constructor;
+	return e === void 0 ? r = M(i, i.e <= a.toExpNeg || i.e >= a.toExpPos) : (D(e, 1, t), n === void 0 ? n = a.rounding : D(n, 0, 8), i = j(new a(i), e, n), r = M(i, e <= i.e || i.e <= a.toExpNeg, e)), i.isNeg() && !i.isZero() ? "-" + r : r;
+}, T.toSignificantDigits = T.toSD = function(e, n) {
+	var r = this, i = r.constructor;
+	return e === void 0 ? (e = i.precision, n = i.rounding) : (D(e, 1, t), n === void 0 ? n = i.rounding : D(n, 0, 8)), j(new i(r), e, n);
+}, T.toString = function() {
+	var e = this, t = e.constructor, n = M(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return e.isNeg() && !e.isZero() ? "-" + n : n;
+}, T.truncated = T.trunc = function() {
+	return j(new this.constructor(this), this.e + 1, 1);
+}, T.valueOf = T.toJSON = function() {
+	var e = this, t = e.constructor, n = M(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return e.isNeg() ? "-" + n : n;
+};
+function E(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 = x - r.length, n && (a += ne(n)), a += r;
+		o = e[t], r = o + "", n = x - r.length, n && (a += ne(n));
+	} else if (o === 0) return "0";
+	for (; o % 10 == 0;) o /= 10;
+	return a + o;
+}
+function D(e, t, n) {
+	if (e !== ~~e || e < t || e > n) throw Error(u + e);
+}
+function O(e, t, n, r) {
+	for (var i, a = e[0], o, s; a >= 10; a /= 10) --t;
+	return --t < 0 ? (t += x, i = 0) : (i = Math.ceil((t + 1) / x), t %= x), a = h(10, x - t), s = e[i] % a | 0, r == null ? t < 3 ? (t == 0 ? s = s / 100 | 0 : t == 1 && (s = s / 10 | 0), o = n < 4 && s == 99999 || n > 3 && s == 49999 || s == 5e4 || s == 0) : o = (n < 4 && s + 1 == a || n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 100 | 0) == h(10, t - 2) - 1 || (s == a / 2 || s == 0) && !(e[i + 1] / a / 100 | 0) : t < 4 ? (t == 0 ? s = s / 1e3 | 0 : t == 1 ? s = s / 100 | 0 : t == 2 && (s = s / 10 | 0), o = (r || n < 4) && s == 9999 || !r && n > 3 && s == 4999) : o = ((r || n < 4) && s + 1 == a || !r && n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 1e3 | 0) == h(10, t - 3) - 1, o;
+}
+function ee(e, t, r) {
+	for (var i, a = [0], o, s = 0, c = e.length; s < c;) {
+		for (o = a.length; o--;) a[o] *= t;
+		for (a[0] += n.indexOf(e.charAt(s++)), i = 0; i < a.length; i++) a[i] > r - 1 && (a[i + 1] === void 0 && (a[i + 1] = 0), a[i + 1] += a[i] / r | 0, a[i] %= r);
+	}
+	return a.reverse();
+}
+function k(e, t) {
+	var n, r, i;
+	if (t.isZero()) return t;
+	r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / le(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = z(e, 1, t.times(i), new e(1));
+	for (var a = n; a--;) {
+		var o = t.times(t);
+		t = o.times(o).minus(o).times(8).plus(1);
+	}
+	return e.precision -= n, t;
+}
+var A = (function() {
+	function e(e, t, n) {
+		var r, i = 0, a = e.length;
+		for (e = e.slice(); a--;) r = e[a] * t + i, e[a] = r % n | 0, i = r / n | 0;
+		return i && e.unshift(i), 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, r) {
+		for (var i = 0; n--;) e[n] -= i, i = +(e[n] < t[n]), e[n] = i * r + e[n] - t[n];
+		for (; !e[0] && e.length > 1;) e.shift();
+	}
+	return function(r, i, a, s, c, l) {
+		var u, d, f, p, h, g, _, v, y, S, C, w, T, E, D, O, ee, k, A, M, N = r.constructor, te = r.s == i.s ? 1 : -1, P = r.d, F = i.d;
+		if (!P || !P[0] || !F || !F[0]) return new N(!r.s || !i.s || (P ? F && P[0] == F[0] : !F) ? NaN : P && P[0] == 0 || !F ? te * 0 : te / 0);
+		for (l ? (h = 1, d = r.e - i.e) : (l = b, h = x, d = m(r.e / h) - m(i.e / h)), A = F.length, ee = P.length, y = new N(te), S = y.d = [], f = 0; F[f] == (P[f] || 0); f++);
+		if (F[f] > (P[f] || 0) && d--, a == null ? (E = a = N.precision, s = N.rounding) : E = c ? a + (r.e - i.e) + 1 : a, E < 0) S.push(1), g = !0;
+		else {
+			if (E = E / h + 2 | 0, f = 0, A == 1) {
+				for (p = 0, F = F[0], E++; (f < ee || p) && E--; f++) D = p * l + (P[f] || 0), S[f] = D / F | 0, p = D % F | 0;
+				g = p || f < ee;
+			} else {
+				for (p = l / (F[0] + 1) | 0, p > 1 && (F = e(F, p, l), P = e(P, p, l), A = F.length, ee = P.length), O = A, C = P.slice(0, A), w = C.length; w < A;) C[w++] = 0;
+				M = F.slice(), M.unshift(0), k = F[0], F[1] >= l / 2 && ++k;
+				do
+					p = 0, u = t(F, C, A, w), u < 0 ? (T = C[0], A != w && (T = T * l + (C[1] || 0)), p = T / k | 0, p > 1 ? (p >= l && (p = l - 1), _ = e(F, p, l), v = _.length, w = C.length, u = t(_, C, v, w), u == 1 && (p--, n(_, A < v ? M : F, v, l))) : (p == 0 && (u = p = 1), _ = F.slice()), v = _.length, v < w && _.unshift(0), n(C, _, w, l), u == -1 && (w = C.length, u = t(F, C, A, w), u < 1 && (p++, n(C, A < w ? M : F, w, l))), w = C.length) : u === 0 && (p++, C = [0]), S[f++] = p, u && C[0] ? C[w++] = P[O] || 0 : (C = [P[O]], w = 1);
+				while ((O++ < ee || C[0] !== void 0) && E--);
+				g = C[0] !== void 0;
+			}
+			S[0] || S.shift();
+		}
+		if (h == 1) y.e = d, o = g;
+		else {
+			for (f = 1, p = S[0]; p >= 10; p /= 10) f++;
+			y.e = f + d * h - 1, j(y, c ? a + y.e + 1 : a, s, g);
+		}
+		return y;
+	};
+})();
+function j(e, t, n, r) {
+	var i, a, o, s, l, u, d, f, p, m = e.constructor;
+	out: if (t != null) {
+		if (f = e.d, !f) return e;
+		for (i = 1, s = f[0]; s >= 10; s /= 10) i++;
+		if (a = t - i, a < 0) a += x, o = t, d = f[p = 0], l = d / h(10, i - o - 1) % 10 | 0;
+		else if (p = Math.ceil((a + 1) / x), s = f.length, p >= s) {
+			if (r) {
+				for (; s++ <= p;) f.push(0);
+				d = l = 0, i = 1, a %= x, o = a - x + 1;
+			} else break out;
+		} else {
+			for (d = s = f[p], i = 1; s >= 10; s /= 10) i++;
+			a %= x, o = a - x + i, l = o < 0 ? 0 : d / h(10, i - o - 1) % 10 | 0;
+		}
+		if (r = r || t < 0 || f[p + 1] !== void 0 || (o < 0 ? d : d % h(10, i - o - 1)), u = n < 4 ? (l || r) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : l > 5 || l == 5 && (n == 4 || r || n == 6 && (a > 0 ? o > 0 ? d / h(10, i - o) : 0 : f[p - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), t < 1 || !f[0]) return f.length = 0, u ? (t -= e.e + 1, f[0] = h(10, (x - t % x) % x), e.e = -t || 0) : f[0] = e.e = 0, e;
+		if (a == 0 ? (f.length = p, s = 1, p--) : (f.length = p + 1, s = h(10, x - a), f[p] = o > 0 ? (d / h(10, i - o) % h(10, o) | 0) * s : 0), u) for (;;) if (p == 0) {
+			for (a = 1, o = f[0]; o >= 10; o /= 10) a++;
+			for (o = f[0] += s, s = 1; o >= 10; o /= 10) s++;
+			a != s && (e.e++, f[0] == b && (f[0] = 1));
+			break;
+		} else {
+			if (f[p] += s, f[p] != b) break;
+			f[p--] = 0, s = 1;
+		}
+		for (a = f.length; f[--a] === 0;) f.pop();
+	}
+	return c && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
+}
+function M(e, t, n) {
+	if (!e.isFinite()) return R(e);
+	var r, i = e.e, a = E(e.d), o = a.length;
+	return t ? (n && (r = n - o) > 0 ? a = a.charAt(0) + "." + a.slice(1) + ne(r) : o > 1 && (a = a.charAt(0) + "." + a.slice(1)), a = a + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (a = "0." + ne(-i - 1) + a, n && (r = n - o) > 0 && (a += ne(r))) : i >= o ? (a += ne(i + 1 - o), n && (r = n - i - 1) > 0 && (a = a + "." + ne(r))) : ((r = i + 1) < o && (a = a.slice(0, r) + "." + a.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (a += "."), a += ne(r))), a;
+}
+function N(e, t) {
+	var n = e[0];
+	for (t *= x; n >= 10; n /= 10) t++;
+	return t;
+}
+function te(e, t, n) {
+	if (t > C) throw c = !0, n && (e.precision = n), Error(d);
+	return j(new e(r), t, 1, !0);
+}
+function P(e, t, n) {
+	if (t > w) throw Error(d);
+	return j(new e(i), t, n, !0);
+}
+function F(e) {
+	var t = e.length - 1, n = t * x + 1;
+	if (t = e[t], t) {
+		for (; t % 10 == 0; t /= 10) n--;
+		for (t = e[0]; t >= 10; t /= 10) n++;
+	}
+	return n;
+}
+function ne(e) {
+	for (var t = ""; e--;) t += "0";
+	return t;
+}
+function I(e, t, n, r) {
+	var i, a = new e(1), o = Math.ceil(r / x + 4);
+	for (c = !1;;) {
+		if (n % 2 && (a = a.times(t), B(a.d, o) && (i = !0)), n = m(n / 2), n === 0) {
+			n = a.d.length - 1, i && a.d[n] === 0 && ++a.d[n];
+			break;
+		}
+		t = t.times(t), B(t.d, o);
+	}
+	return c = !0, a;
+}
+function re(e) {
+	return e.d[e.d.length - 1] & 1;
+}
+function ie(e, t, n) {
+	for (var r, i, a = new e(t[0]), o = 0; ++o < t.length;) {
+		if (i = new e(t[o]), !i.s) {
+			a = i;
+			break;
+		}
+		r = a.cmp(i), (r === n || r === 0 && a.s === n) && (a = i);
+	}
+	return a;
+}
+function ae(e, t) {
+	var n, r, i, a, o, s, l, u = 0, d = 0, f = 0, p = e.constructor, m = p.rounding, g = p.precision;
+	if (!e.d || !e.d[0] || e.e > 17) return new p(e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
+	for (t == null ? (c = !1, l = g) : l = t, s = new p(.03125); e.e > -2;) e = e.times(s), f += 5;
+	for (r = Math.log(h(2, f)) / Math.LN10 * 2 + 5 | 0, l += r, n = a = o = new p(1), p.precision = l;;) {
+		if (a = j(a.times(e), l, 1), n = n.times(++d), s = o.plus(A(a, n, l, 1)), E(s.d).slice(0, l) === E(o.d).slice(0, l)) {
+			for (i = f; i--;) o = j(o.times(o), l, 1);
+			if (t == null) {
+				if (u < 3 && O(o.d, l - r, m, u)) p.precision = l += 10, n = a = s = new p(1), d = 0, u++;
+				else return j(o, p.precision = g, m, c = !0);
+			} else return p.precision = g, o;
+		}
+		o = s;
+	}
+}
+function L(e, t) {
+	var n, r, i, a, o, s, l, u, d, f, p, m = 1, h = 10, g = e, _ = g.d, v = g.constructor, y = v.rounding, b = v.precision;
+	if (g.s < 0 || !_ || !_[0] || !g.e && _[0] == 1 && _.length == 1) return new v(_ && !_[0] ? -1 / 0 : g.s == 1 ? _ ? 0 : g : NaN);
+	if (t == null ? (c = !1, d = b) : d = t, v.precision = d += h, n = E(_), r = n.charAt(0), Math.abs(a = g.e) < 0x5543df729c000) {
+		for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3;) g = g.times(e), n = E(g.d), r = n.charAt(0), m++;
+		a = g.e, r > 1 ? (g = new v("0." + n), a++) : g = new v(r + "." + n.slice(1));
+	} else return u = te(v, d + 2, b).times(a + ""), g = L(new v(r + "." + n.slice(1)), d - h).plus(u), v.precision = b, t == null ? j(g, b, y, c = !0) : g;
+	for (f = g, l = o = g = A(g.minus(1), g.plus(1), d, 1), p = j(g.times(g), d, 1), i = 3;;) {
+		if (o = j(o.times(p), d, 1), u = l.plus(A(o, new v(i), d, 1)), E(u.d).slice(0, d) === E(l.d).slice(0, d)) {
+			if (l = l.times(2), a !== 0 && (l = l.plus(te(v, d + 2, b).times(a + ""))), l = A(l, new v(m), d, 1), t == null) {
+				if (O(l.d, d - h, y, s)) v.precision = d += h, u = o = g = A(f.minus(1), f.plus(1), d, 1), p = j(g.times(g), d, 1), i = s = 1;
+				else return j(l, v.precision = b, y, c = !0);
+			} else return v.precision = b, l;
+		}
+		l = u, i += 2;
+	}
+}
+function R(e) {
+	return String(e.s * e.s / 0);
+}
+function oe(e, t) {
+	var n, r, i;
+	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 (i = t.length; t.charCodeAt(i - 1) === 48; --i);
+	if (t = t.slice(r, i), t) {
+		if (i -= r, e.e = n = n - r - 1, e.d = [], r = (n + 1) % x, n < 0 && (r += x), r < i) {
+			for (r && e.d.push(+t.slice(0, r)), i -= x; r < i;) e.d.push(+t.slice(r, r += x));
+			t = t.slice(r), r = x - t.length;
+		} else r -= i;
+		for (; r--;) t += "0";
+		e.d.push(+t), c && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
+	} else e.e = 0, e.d = [0];
+	return e;
+}
+function se(e, t) {
+	var n, r, i, a, o, s, l, d, f;
+	if (t.indexOf("_") > -1) {
+		if (t = t.replace(/(\d)_(?=\d)/g, "$1"), y.test(t)) return oe(e, t);
+	} else if (t === "Infinity" || t === "NaN") return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
+	if (_.test(t)) n = 16, t = t.toLowerCase();
+	else if (g.test(t)) n = 2;
+	else if (v.test(t)) n = 8;
+	else throw Error(u + t);
+	for (a = t.search(/p/i), a > 0 ? (l = +t.slice(a + 1), t = t.substring(2, a)) : t = t.slice(2), a = t.indexOf("."), o = a >= 0, r = e.constructor, o && (t = t.replace(".", ""), s = t.length, a = s - a, i = I(r, new r(n), a, a * 2)), d = ee(t, n, b), f = d.length - 1, a = f; d[a] === 0; --a) d.pop();
+	return a < 0 ? new r(e.s * 0) : (e.e = N(d, f), e.d = d, c = !1, o && (e = A(e, i, s * 4)), l && (e = e.times(Math.abs(l) < 54 ? h(2, l) : G.pow(2, l))), c = !0, e);
+}
+function ce(e, t) {
+	var n, r = t.d.length;
+	if (r < 3) return t.isZero() ? t : z(e, 2, t, t);
+	n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / le(5, n)), t = z(e, 2, t, t);
+	for (var i, a = new e(5), o = new e(16), s = new e(20); n--;) i = t.times(t), t = t.times(a.plus(i.times(o.times(i).minus(s))));
+	return t;
+}
+function z(e, t, n, r, i) {
+	var a, o, s, l, u = 1, d = e.precision, f = Math.ceil(d / x);
+	for (c = !1, l = n.times(n), s = new e(r);;) {
+		if (o = A(s.times(l), new e(t++ * t++), d, 1), s = i ? r.plus(o) : r.minus(o), r = A(o.times(l), new e(t++ * t++), d, 1), o = s.plus(r), o.d[f] !== void 0) {
+			for (a = f; o.d[a] === s.d[a] && a--;);
+			if (a == -1) break;
+		}
+		a = s, s = r, r = o, o = a, u++;
+	}
+	return c = !0, o.d.length = f + 1, o;
+}
+function le(e, t) {
+	for (var n = e; --t;) n *= e;
+	return n;
+}
+function ue(e, t) {
+	var n, r = t.s < 0, i = P(e, e.precision, 1), a = i.times(.5);
+	if (t = t.abs(), t.lte(a)) return s = r ? 4 : 1, t;
+	if (n = t.divToInt(i), n.isZero()) s = r ? 3 : 2;
+	else {
+		if (t = t.minus(n.times(i)), t.lte(a)) return s = re(n) ? r ? 2 : 3 : r ? 4 : 1, t;
+		s = re(n) ? r ? 1 : 4 : r ? 3 : 2;
+	}
+	return t.minus(i).abs();
+}
+function de(e, r, i, a) {
+	var s, c, l, u, d, f, p, m, h, g = e.constructor, _ = i !== void 0;
+	if (_ ? (D(i, 1, t), a === void 0 ? a = g.rounding : D(a, 0, 8)) : (i = g.precision, a = g.rounding), !e.isFinite()) p = R(e);
+	else {
+		for (p = M(e), l = p.indexOf("."), _ ? (s = 2, r == 16 ? i = i * 4 - 3 : r == 8 && (i = i * 3 - 2)) : s = r, l >= 0 && (p = p.replace(".", ""), h = new g(1), h.e = p.length - l, h.d = ee(M(h), 10, s), h.e = h.d.length), m = ee(p, 10, s), c = d = m.length; m[--d] == 0;) m.pop();
+		if (!m[0]) p = _ ? "0p+0" : "0";
+		else {
+			if (l < 0 ? c-- : (e = new g(e), e.d = m, e.e = c, e = A(e, h, i, a, 0, s), m = e.d, c = e.e, f = o), l = m[i], u = s / 2, f ||= m[i + 1] !== void 0, f = a < 4 ? (l !== void 0 || f) && (a === 0 || a === (e.s < 0 ? 3 : 2)) : l > u || l === u && (a === 4 || f || a === 6 && m[i - 1] & 1 || a === (e.s < 0 ? 8 : 7)), m.length = i, f) for (; ++m[--i] > s - 1;) m[i] = 0, i || (++c, m.unshift(1));
+			for (d = m.length; !m[d - 1]; --d);
+			for (l = 0, p = ""; l < d; l++) p += n.charAt(m[l]);
+			if (_) {
+				if (d > 1) {
+					if (r == 16 || r == 8) {
+						for (l = r == 16 ? 4 : 3, --d; d % l; d++) p += "0";
+						for (m = ee(p, s, r), d = m.length; !m[d - 1]; --d);
+						for (l = 1, p = "1."; l < d; l++) p += n.charAt(m[l]);
+					} else p = p.charAt(0) + "." + p.slice(1);
+				}
+				p = p + (c < 0 ? "p" : "p+") + c;
+			} else if (c < 0) {
+				for (; ++c;) p = "0" + p;
+				p = "0." + p;
+			} else if (++c > d) for (c -= d; c--;) p += "0";
+			else c < d && (p = p.slice(0, c) + "." + p.slice(c));
+		}
+		p = (r == 16 ? "0x" : r == 2 ? "0b" : r == 8 ? "0o" : "") + p;
+	}
+	return e.s < 0 ? "-" + p : p;
+}
+function B(e, t) {
+	if (e.length > t) return e.length = t, !0;
+}
+function fe(e) {
+	return new this(e).abs();
+}
+function pe(e) {
+	return new this(e).acos();
+}
+function me(e) {
+	return new this(e).acosh();
+}
+function he(e, t) {
+	return new this(e).plus(t);
+}
+function ge(e) {
+	return new this(e).asin();
+}
+function _e(e) {
+	return new this(e).asinh();
+}
+function ve(e) {
+	return new this(e).atan();
+}
+function ye(e) {
+	return new this(e).atanh();
+}
+function be(e, t) {
+	e = new this(e), t = new this(t);
+	var n, r = this.precision, i = this.rounding, a = r + 4;
+	return !e.s || !t.s ? n = new this(NaN) : !e.d && !t.d ? (n = P(this, a, 1).times(t.s > 0 ? .25 : .75), n.s = e.s) : !t.d || e.isZero() ? (n = t.s < 0 ? P(this, r, i) : new this(0), n.s = e.s) : !e.d || t.isZero() ? (n = P(this, a, 1).times(.5), n.s = e.s) : t.s < 0 ? (this.precision = a, this.rounding = 1, n = this.atan(A(e, t, a, 1)), t = P(this, a, 1), this.precision = r, this.rounding = i, n = e.s < 0 ? n.minus(t) : n.plus(t)) : n = this.atan(A(e, t, a, 1)), n;
+}
+function xe(e) {
+	return new this(e).cbrt();
+}
+function V(e) {
+	return j(e = new this(e), e.e + 1, 2);
+}
+function Se(e, t, n) {
+	return new this(e).clamp(t, n);
+}
+function Ce(n) {
+	if (!n || typeof n != "object") throw Error(l + "Object expected");
+	var r, i, o, s = n.defaults === !0, c = [
+		"precision",
+		1,
+		t,
+		"rounding",
+		0,
+		8,
+		"toExpNeg",
+		-e,
+		0,
+		"toExpPos",
+		0,
+		e,
+		"maxE",
+		0,
+		e,
+		"minE",
+		-e,
+		0,
+		"modulo",
+		0,
+		9
+	];
+	for (r = 0; r < c.length; r += 3) if (i = c[r], s && (this[i] = a[i]), (o = n[i]) !== void 0) {
+		if (m(o) === o && o >= c[r + 1] && o <= c[r + 2]) this[i] = o;
+		else throw Error(u + i + ": " + o);
+	}
+	if (i = "crypto", s && (this[i] = a[i]), (o = n[i]) !== void 0) {
+		if (o === !0 || o === !1 || o === 0 || o === 1) {
+			if (o) {
+				if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes)) this[i] = !0;
+				else throw Error(f);
+			} else this[i] = !1;
+		} else throw Error(u + i + ": " + o);
+	}
+	return this;
+}
+function we(e) {
+	return new this(e).cos();
+}
+function Te(e) {
+	return new this(e).cosh();
+}
+function Ee(e) {
+	var t, n, r;
+	function i(e) {
+		var t, n, r, a = this;
+		if (!(a instanceof i)) return new i(e);
+		if (a.constructor = i, je(e)) {
+			a.s = e.s, c ? !e.d || e.e > i.maxE ? (a.e = NaN, a.d = null) : e.e < i.minE ? (a.e = 0, a.d = [0]) : (a.e = e.e, a.d = e.d.slice()) : (a.e = e.e, a.d = e.d ? e.d.slice() : e.d);
+			return;
+		}
+		if (r = typeof e, r === "number") {
+			if (e === 0) {
+				a.s = 1 / e < 0 ? -1 : 1, a.e = 0, a.d = [0];
+				return;
+			}
+			if (e < 0 ? (e = -e, a.s = -1) : a.s = 1, e === ~~e && e < 1e7) {
+				for (t = 0, n = e; n >= 10; n /= 10) t++;
+				c ? t > i.maxE ? (a.e = NaN, a.d = null) : t < i.minE ? (a.e = 0, a.d = [0]) : (a.e = t, a.d = [e]) : (a.e = t, a.d = [e]);
+				return;
+			}
+			if (e * 0 != 0) {
+				e || (a.s = NaN), a.e = NaN, a.d = null;
+				return;
+			}
+			return oe(a, e.toString());
+		}
+		if (r === "string") return (n = e.charCodeAt(0)) === 45 ? (e = e.slice(1), a.s = -1) : (n === 43 && (e = e.slice(1)), a.s = 1), y.test(e) ? oe(a, e) : se(a, e);
+		if (r === "bigint") return e < 0 ? (e = -e, a.s = -1) : a.s = 1, oe(a, e.toString());
+		throw Error(u + e);
+	}
+	if (i.prototype = T, 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.EUCLID = 9, i.config = i.set = Ce, i.clone = Ee, i.isDecimal = je, i.abs = fe, i.acos = pe, i.acosh = me, i.add = he, i.asin = ge, i.asinh = _e, i.atan = ve, i.atanh = ye, i.atan2 = be, i.cbrt = xe, i.ceil = V, i.clamp = Se, i.cos = we, i.cosh = Te, i.div = De, i.exp = Oe, i.floor = ke, i.hypot = Ae, i.ln = Me, i.log = Ne, i.log10 = Fe, i.log2 = Pe, i.max = Ie, i.min = Le, i.mod = H, i.mul = U, i.pow = W, i.random = Re, i.round = ze, i.sign = Be, i.sin = Ve, i.sinh = He, i.sqrt = Ue, i.sub = We, i.sum = Ge, i.tan = Ke, i.tanh = qe, i.trunc = Je, e === void 0 && (e = {}), e && e.defaults !== !0) for (r = [
+		"precision",
+		"rounding",
+		"toExpNeg",
+		"toExpPos",
+		"maxE",
+		"minE",
+		"modulo",
+		"crypto"
+	], t = 0; t < r.length;) e.hasOwnProperty(n = r[t++]) || (e[n] = this[n]);
+	return i.config(e), i;
+}
+function De(e, t) {
+	return new this(e).div(t);
+}
+function Oe(e) {
+	return new this(e).exp();
+}
+function ke(e) {
+	return j(e = new this(e), e.e + 1, 3);
+}
+function Ae() {
+	var e, t, n = new this(0);
+	for (c = !1, e = 0; e < arguments.length;) if (t = new this(arguments[e++]), t.d) n.d && (n = n.plus(t.times(t)));
+	else {
+		if (t.s) return c = !0, new this(1 / 0);
+		n = t;
+	}
+	return c = !0, n.sqrt();
+}
+function je(e) {
+	return e instanceof G || e && e.toStringTag === p || !1;
+}
+function Me(e) {
+	return new this(e).ln();
+}
+function Ne(e, t) {
+	return new this(e).log(t);
+}
+function Pe(e) {
+	return new this(e).log(2);
+}
+function Fe(e) {
+	return new this(e).log(10);
+}
+function Ie() {
+	return ie(this, arguments, -1);
+}
+function Le() {
+	return ie(this, arguments, 1);
+}
+function H(e, t) {
+	return new this(e).mod(t);
+}
+function U(e, t) {
+	return new this(e).mul(t);
+}
+function W(e, t) {
+	return new this(e).pow(t);
+}
+function Re(e) {
+	var n, r, i, a, o = 0, s = new this(1), c = [];
+	if (e === void 0 ? e = this.precision : D(e, 1, t), i = Math.ceil(e / x), !this.crypto) for (; o < i;) c[o++] = Math.random() * 1e7 | 0;
+	else if (crypto.getRandomValues) for (n = crypto.getRandomValues(new Uint32Array(i)); o < i;) a = n[o], a >= 429e7 ? n[o] = crypto.getRandomValues(/* @__PURE__ */ new Uint32Array(1))[0] : c[o++] = a % 1e7;
+	else if (crypto.randomBytes) {
+		for (n = crypto.randomBytes(i *= 4); o < i;) a = n[o] + (n[o + 1] << 8) + (n[o + 2] << 16) + ((n[o + 3] & 127) << 24), a >= 214e7 ? crypto.randomBytes(4).copy(n, o) : (c.push(a % 1e7), o += 4);
+		o = i / 4;
+	} else throw Error(f);
+	for (i = c[--o], e %= x, i && e && (a = h(10, x - e), c[o] = (i / a | 0) * a); c[o] === 0; o--) c.pop();
+	if (o < 0) r = 0, c = [0];
+	else {
+		for (r = -1; c[0] === 0; r -= x) c.shift();
+		for (i = 1, a = c[0]; a >= 10; a /= 10) i++;
+		i < x && (r -= x - i);
+	}
+	return s.e = r, s.d = c, s;
+}
+function ze(e) {
+	return j(e = new this(e), e.e + 1, this.rounding);
+}
+function Be(e) {
+	return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
+}
+function Ve(e) {
+	return new this(e).sin();
+}
+function He(e) {
+	return new this(e).sinh();
+}
+function Ue(e) {
+	return new this(e).sqrt();
+}
+function We(e, t) {
+	return new this(e).sub(t);
+}
+function Ge() {
+	var e = 0, t = arguments, n = new this(t[e]);
+	for (c = !1; n.s && ++e < t.length;) n = n.plus(t[e]);
+	return c = !0, j(n, this.precision, this.rounding);
+}
+function Ke(e) {
+	return new this(e).tan();
+}
+function qe(e) {
+	return new this(e).tanh();
+}
+function Je(e) {
+	return j(e = new this(e), e.e + 1, 1);
+}
+T[Symbol.for("nodejs.util.inspect.custom")] = T.toString, T[Symbol.toStringTag] = "Decimal";
+var G = T.constructor = Ee(a);
+r = new G(r), i = new G(i);
+//#endregion
+//#region ../../node_modules/@graffiticode/parselatex/src/assert.js
+var K = (e, t, n) => {
+	if (t === void 0 && (t = "failed!"), !e) {
+		let e = Error(t);
+		throw e.location = n || q.location, e;
+	}
+}, q = {
+	assert: K,
+	message: (e, t) => {
+		let n = q.messages[e];
+		return t && t.forEach((e, t) => {
+			n = n.replace(`%${t + 1}`, e);
+		}), `${e}: ${n}`;
+	},
+	messages: {},
+	reserveCodeRange: (e, t, n) => {
+		K(e <= t, "Invalid code range"), K(q.reservedCodes.every((n) => t < n.first || e > n.last), "Conflicting request for error code range"), q.reservedCodes.push({
+			first: e,
+			last: t,
+			name: n
+		});
+	},
+	reservedCodes: [],
+	setLocation: (e) => {
+		q.location = e;
+	},
+	clearLocation: () => {
+		q.location = null;
+	},
+	checkTimeout: () => {
+		K(!q.timeout || q.timeout > Date.now(), q.timeoutMessage);
+	},
+	setTimeout: (e, t) => {
+		e !== void 0 && (q.timeout = e ? Date.now() + e : 0, q.timeoutMessage = t || "ERROR timeout exceeded");
+	},
+	setCounter: (e, t) => {
+		q.count = e, q.countMessage = t || "ERROR count exceeded";
+	},
+	checkCounter: () => {
+		let { count: e } = q;
+		if (typeof e != "number" || Number.isNaN(e)) {
+			K(!1, "ERROR counter not set");
+			return;
+		}
+		K(q.count--, q.countMessage);
+	}
+}, Ye = (() => {
+	function e() {
+		this.nodePool = ["unused"], this.nodeMap = {};
+	}
+	e.prototype.arg = function(e) {
+		if (!t(this)) throw Error("Malformed node");
+		return this.args.push(e), this;
+	}, e.prototype.argN = function(e, n) {
+		if (!t(this)) throw Error("Malformed node");
+		return n === void 0 ? this.args[e] : (this.args[e] = n, this);
+	}, e.prototype.args = function(e) {
+		if (!t(this)) throw Error("Malformed node");
+		return e === void 0 ? this.args : (this.args = e, this);
+	}, e.prototype.isNode = t;
+	function t(e) {
+		return e === void 0 && (e = this), e.op && e.args;
+	}
+	return e.prototype.intern = function(n) {
+		this instanceof e && n === void 0 && t(this) && (n = this), K(typeof n == "object", "node not an object");
+		let { op: r } = n, i = n.args.length, a = "", o = [];
+		for (let e = 0; e < i; e++) a += " ", typeof n.args[e] == "string" ? a += o[e] = n.args[e] : a += o[e] = this.intern(n.args[e]);
+		n.lbrk && n.lbrk !== 123 && n.lbrk !== 371 && (a += String.fromCharCode(n.lbrk), a += String.fromCharCode(n.rbrk));
+		let s = r + i + a, c = this.nodeMap[s];
+		return c === void 0 && (this.nodePool.push({
+			op: r,
+			args: o
+		}), c = this.nodePool.length - 1, this.nodeMap[s] = c), c;
+	}, e.prototype.node = function(e) {
+		let t = JSON.parse(JSON.stringify(this.nodePool[e]));
+		for (let e = 0; e < t.args.length; e++) typeof t.args[e] != "string" && (t.args[e] = this.node(t.args[e]));
+		return t;
+	}, e.prototype.dumpAll = function() {
+		let t = "";
+		return this.nodePool.forEach((n, r) => {
+			t += `\n${r}: ${e.dump(n)}`;
+		}), t;
+	}, e.dump = e.prototype.dump = function e(t) {
+		let n;
+		if (typeof t == "string") n = `"${t}"`;
+		else if (typeof t == "number") n = t;
+		else {
+			n = `{ op: "${t.op}", args: [ `;
+			for (let r = 0; r < t.args.length; r++) r > 0 && (n += " , "), n += e(t.args[r]);
+			n += " ] }";
+		}
+		return n;
+	}, e;
+})(), Xe = (() => {
+	function e() {}
+	let t = [], n = {};
+	e.fn = {}, e.env = n, e.pushEnv = (r) => {
+		t.push(n), e.env = n = r;
+	}, e.popEnv = () => {
+		K(t.length > 0, "1000: Empty envStack"), e.env = n = t.pop();
+	}, e.option = (e, t) => e[t];
+	function r() {
+		return !!e.env.Au;
+	}
+	let i = e.prototype = new Ye();
+	q.reserveCodeRange(1e3, 1999, "model"), q.messages[1e3] = "Internal error. %1.", q.messages[1001] = "Invalid syntax. \"%1\" expected, \"%2\" found.", q.messages[1002] = "Only one decimal separator can be specified.", q.messages[1003] = "Extra characters in input at position: %1, lexeme: %2, prefix: %3.", q.messages[1004] = "Invalid character \"%1\" (%2) in input.", q.messages[1005] = "Misplaced thousands separator.", q.messages[1006] = "Invalid syntax. Expression expected, %1 found.", q.messages[1007] = "Unexpected character: \"%1\" in \"%2\".", q.messages[1008] = "The same character \"%1\" is being used as a thousands and decimal separators.", q.messages[1009] = "Missing argument for \"%1\" command.", q.messages[1010] = "Expecting an operator between numbers.", q.messages[1011] = "Invalid grouping bracket. %1", q.messages[1012] = "Misplaced subscript in \"%1\"", q.messages[1013] = "Mismatched thousands separators: \"%1\" and \"%2\".", q.messages[1014] = "Missing integration variable in \"%1\".";
+	let { message: a } = q;
+	e.create = i.create = function t(n, r, a) {
+		if (K(r instanceof Array || typeof r == "object" && (r.op || r instanceof e) || typeof r == "string", JSON.stringify(r)), K(r !== void 0, "1000: Internal error. Node undefined."), r instanceof e) return a && (r.location = a), r;
+		let o;
+		return r instanceof Array ? (o = [], r.forEach((e) => {
+			o.push(t(n, e, a));
+		}), o) : this instanceof e ? (o = t(n, this), o.location = a, r = typeof r == "string" ? E(n, r, e.env).expr() : JSON.parse(JSON.stringify(r)), Object.keys(e.fn).forEach((t) => {
+			i[t] || (i[t] = function(...n) {
+				let r = e.fn[t];
+				if (n.length > 1 && n[1] instanceof e) return r.apply(this, n);
+				let i = [this];
+				for (let e = 0; e < n.length; e++) i.push(n[e]);
+				return r.apply(this, i);
+			});
+		}), Object.keys(r).forEach((e) => {
+			o[e] = r[e];
+		}), o) : new e().create(n, r, a);
+	}, e.fromLaTeX = i.fromLaTeX = function(t, n) {
+		return K(typeof n == "string", "1000: Model.prototype.fromLaTex"), this ? this.create(t, n) : e.create(t, n);
+	}, e.toLaTeX = i.toLaTeX = function(e) {
+		return m(e);
+	};
+	let o = {
+		ADD: "+",
+		SUB: "-",
+		MUL: "mul",
+		TIMES: "\\times",
+		DIV: "\\div",
+		FRAC: "\\frac",
+		EQL: "=",
+		ATAN2: "atan2",
+		SQRT: "sqrt",
+		VEC: "vec",
+		PM: "pm",
+		NOT: "not",
+		SIN: "sin",
+		COS: "cos",
+		TAN: "tan",
+		SEC: "sec",
+		COT: "cot",
+		CSC: "csc",
+		ARCSIN: "arcsin",
+		ARCCOS: "arccos",
+		ARCTAN: "arctan",
+		ARCSEC: "arcsec",
+		ARCCOT: "arccot",
+		ARCCSC: "arccsc",
+		SINH: "sinh",
+		COSH: "cosh",
+		TANH: "tanh",
+		SECH: "sech",
+		COTH: "coth",
+		CSCH: "csch",
+		ARCSINH: "arcsinh",
+		ARCCOSH: "arccosh",
+		ARCTANH: "arctanh",
+		ARCSECH: "arcsech",
+		ARCCSCH: "arccsch",
+		ARCCOTH: "arccoth",
+		LOG: "log",
+		LN: "ln",
+		LG: "lg",
+		VAR: "var",
+		TEXT: "text",
+		NUM: "num",
+		COMMA: ",",
+		POW: "^",
+		SUBSCRIPT: "_",
+		ABS: "abs",
+		PAREN: "()",
+		BRACE: "{}",
+		BRACKET: "[]",
+		ANGLEBRACKET: "anglebracket",
+		HIGHLIGHT: "hi",
+		LT: "lt",
+		LE: "le",
+		GT: "gt",
+		GE: "ge",
+		NE: "ne",
+		NGTR: "ngtr",
+		NLESS: "nless",
+		NI: "ni",
+		SUBSETEQ: "subseteq",
+		SUPSETEQ: "supseteq",
+		SUBSET: "subset",
+		SUPSET: "supset",
+		NNI: "nni",
+		NSUBSETEQ: "nsubseteq",
+		NSUPSETEQ: "nsupseteq",
+		NSUBSET: "nsubset",
+		NSUPSET: "nsupset",
+		APPROX: "approx",
+		IMPLIES: "implies",
+		CAPRIGHTARROW: "caprightarrow",
+		RIGHTARROW: "rightarrow",
+		LEFTARROW: "leftarrrow",
+		LONGRIGHTARROW: "longrightarrow",
+		LONGLEFTARROW: "longleftarrow",
+		OVERRIGHTARROW: "overrightarrow",
+		OVERLEFTARROW: "overleftarrow",
+		CAPLEFTRIGHTARROW: "capleftrightarrow",
+		LEFTRIGHTARROW: "leftrightarrow",
+		LONGLEFTRIGHTARROW: "longleftrightarrow",
+		OVERLEFTRIGHTARROW: "overleftrightarrow",
+		PERP: "perp",
+		PROPTO: "propto",
+		PARALLEL: "parallel",
+		NPARALLEL: "nparallel",
+		SIM: "sim",
+		CONG: "cong",
+		INTERVAL: "interval",
+		INTERVALOPEN: "intervalopen",
+		INTERVALLEFTOPEN: "intervalleftopen",
+		INTERVALRIGHTOPEN: "intervalrightopen",
+		EVALAT: "eval-at",
+		LIST: "list",
+		SET: "set",
+		EXISTS: "exists",
+		IN: "in",
+		FORALL: "forall",
+		LIM: "lim",
+		EXP: "exp",
+		TO: "to",
+		SUM: "sum",
+		DERIV: "deriv",
+		PIPE: "pipe",
+		INTEGRAL: "integral",
+		PROD: "prod",
+		CUP: "cup",
+		BIGCUP: "bigcup",
+		CAP: "cap",
+		BIGCAP: "bigcap",
+		PERCENT: "%",
+		QMARK: "?",
+		M: "M",
+		FACT: "fact",
+		BINOM: "binom",
+		ROW: "row",
+		COL: "col",
+		COLON: "colon",
+		MATRIX: "matrix",
+		TYPE: "type",
+		FORMAT: "format",
+		OVERSET: "overset",
+		UNDERSET: "underset",
+		OVERLINE: "overline",
+		DEGREE: "degree",
+		BACKSLASH: "backslash",
+		MATHBF: "mathbf",
+		CDOT: "\\cdot",
+		MATHFIELD: "mathfield",
+		DELTA: "delta",
+		OPERATORNAME: "operatorname",
+		DOT: "dot",
+		NONE: "none"
+	};
+	Object.keys(o).forEach((t) => {
+		e[t] = o[t];
+	});
+	let s = {};
+	s[o.ADD] = "+", s[o.SUB] = "-", s[o.MUL] = "\\times", s[o.TIMES] = "\\times", s[o.DIV] = "\\div", s[o.FRAC] = "\\frac", s[o.EQL] = "=", s[o.ATAN2] = "\\atan2", s[o.POW] = "^", s[o.SUBSCRIPT] = "_", s[o.PM] = "\\pm", s[o.NOT] = "\\not", s[o.SIN] = "\\sin", s[o.COS] = "\\cos", s[o.TAN] = "\\tan", s[o.SEC] = "\\sec", s[o.COT] = "\\cot", s[o.CSC] = "\\csc", s[o.ARCSIN] = "\\arcsin", s[o.ARCCOS] = "\\arccos", s[o.ARCTAN] = "\\arctan", s[o.ARCSEC] = "\\arcsec", s[o.ARCCOT] = "\\arccot", s[o.ARCCSC] = "\\arccsc", s[o.SEC] = "\\sec", s[o.COT] = "\\cot", s[o.CSC] = "\\csc", s[o.SINH] = "\\sinh", s[o.COSH] = "\\cosh", s[o.TANH] = "\\tanh", s[o.ARCSINH] = "\\arcsinh", s[o.ARCCOSH] = "\\arccosh", s[o.ARCTANH] = "\\arctanh", s[o.ARCSECH] = "\\arcsech", s[o.ARCCSCH] = "\\arccsch", s[o.ARCCOTH] = "\\arccoth", s[o.SECH] = "\\sech", s[o.COTH] = "\\coth", s[o.CSCH] = "\\csch", s[o.LN] = "\\ln", s[o.COMMA] = ",", s[o.M] = "\\M", s[o.BINOM] = "\\binom", s[o.COLON] = "\\colon", s[o.INT] = "\\int", e.fold = function e(t, n) {
+		let r = [], i;
+		switch (t.args.forEach((t) => {
+			r.push(e(t, n));
+		}), t.args = r, t.op) {
+			case o.VAR: (i = n[t.args[0]]) && (t = i);
+		}
+		return t;
+	};
+	function c(e) {
+		return e >= 1 && e <= 31 && e !== 9 || e >= 127 && e <= 159;
+	}
+	function l(e) {
+		return e === v || e === g || e === _ || e === S || e === y || e === b || e === x || e === h;
+	}
+	function u(e) {
+		let t = "", n, r, i = 0;
+		for (; i < e.length;) {
+			for (; i < e.length && d(n = e.charCodeAt(i++));) r !== 32 && (n = 9, r = n);
+			n === 92 && (t += String.fromCharCode(n), i < e.length && (n = e.charCodeAt(i++))), t += String.fromCharCode(n);
+		}
+		return t;
+	}
+	function d(e) {
+		return c(e);
+	}
+	function f(e) {
+		return e === 32 || e === 9 || e === 10 || e === 13;
+	}
+	function p(e) {
+		return e >= 48 && e <= 57;
+	}
+	let m = function e(t) {
+		let n = "";
+		if (typeof t == "string") n = t;
+		else if (typeof t == "number") n = t;
+		else if (typeof t == "object") {
+			let r = [];
+			switch (t.args.forEach((t) => {
+				r.push(e(t));
+			}), t.op) {
+				case o.NUM:
+				case o.VAR:
+					n = `${t.args[0]}`;
+					break;
+				case o.TEXT:
+					n = `\\text{${r[0]}}`;
+					break;
+				case o.SUBSCRIPT:
+					r.reverse().forEach((e, i) => {
+						n = i === r.length - 1 ? `${e}${n}` : `${s[t.op]}{${e}${n}}`;
+					});
+					break;
+				case o.SUB:
+					n = t.args.length === 1 ? `${s[t.op]}${r[0]}` : `${r[0]} ${s[t.op]} ${r[1]}`;
+					break;
+				case o.DIV:
+				case o.PM:
+				case o.EQL:
+					n = `${r[0]} ${s[t.op]} ${r[1]}`;
+					break;
+				case o.POW: {
+					let e = t.args[0], i = t.args[1];
+					(e.args && e.args.length === 2 || i.args && i.args.length === 2) && (e.op === o.ADD || e.op === o.SUB || e.op === o.MUL || e.op === o.DIV || e.op === o.SQRT) && (r[0] = ` (${r[0]}) `), n = `{${r[0]}^{${r[1]}}}`;
+					break;
+				}
+				case o.SIN:
+				case o.COS:
+				case o.TAN:
+				case o.ARCSIN:
+				case o.ARCCOS:
+				case o.ARCTAN:
+				case o.ARCSEC:
+				case o.ARCCSC:
+				case o.ARCCOT:
+				case o.SEC:
+				case o.COT:
+				case o.CSC:
+				case o.SINH:
+				case o.COSH:
+				case o.TANH:
+				case o.ARCSINH:
+				case o.ARCCOSH:
+				case o.ARCTANH:
+				case o.ARCSECH:
+				case o.ARCCSCH:
+				case o.ARCCOTH:
+				case o.SECH:
+				case o.COTH:
+				case o.CSCH:
+				case o.LN:
+				case o.M:
+					n = `{${s[t.op]}{${r[0]}}}`;
+					break;
+				case o.FRAC:
+					n = `\\frac{${r[0]}}{${r[1]}}`;
+					break;
+				case o.BINOM:
+					n = `\\binom{${r[0]}}{${r[1]}}`;
+					break;
+				case o.SQRT:
+					switch (r.length) {
+						case 1:
+							n = `\\sqrt{${r[0]}}`;
+							break;
+						case 2: n = `\\sqrt[${r[0]}]{${r[1]}}`;
+					}
+					break;
+				case o.INTEGRAL:
+					n = r.length === 4 ? `\\int_{${r[0]}}^{${r[1]}} ${r[2]} d${r[3]}` : `\\int ${r[0]} d${r[1]}`;
+					break;
+				case o.VEC:
+					n = `\\vec{${r[0]}}`;
+					break;
+				case o.MUL: {
+					let e;
+					n = "", t.args.forEach((i, a) => {
+						i.args && i.args.length >= 2 ? ((i.op === o.ADD || i.op === o.SUB) && (r[a] = `(${r[a]})`), a !== 0 && typeof i == "number" ? n += `${s[t.op]} ` : t.isMixedNumber || t.isScientific && (n += "\\times "), n += r[a]) : (i.op === o.PAREN || i.op === o.VAR || typeof e == "number" && typeof i != "number" || a !== 0 && (n += ` ${s[t.op]} `), n += r[a]), e = i;
+					});
+					break;
+				}
+				case o.TIMES:
+				case o.CDOT:
+				case o.ADD:
+				case o.COMMA:
+					r.forEach((e, r) => {
+						n = r === 0 ? e : `${n}${s[t.op]} ${e}`;
+					});
+					break;
+				case o.NONE:
+					n = "";
+					break;
+				default: K(!1, `1000: Unimplemented operator translating to LaTeX: ${t.op}`);
+			}
+		} else K(!1, "1000: Invalid expression type");
+		return n;
+	}, h = 0, g = 125, _ = 93, v = 41, y = 286, b = 287, x = 289, S = 376, C = {};
+	C[47] = o.FRAC, C[256] = o.FRAC, C[257] = o.SQRT, C[290] = o.VEC, C[43] = o.ADD, C[45] = o.SUB, C[258] = o.PM, C[351] = o.NOT, C[94] = o.POW, C[95] = o.SUBSCRIPT, C[42] = o.MUL, C[304] = o.CDOT, C[373] = o.TIMES, C[294] = o.DIV, C[259] = o.SIN, C[261] = o.COS, C[260] = o.TAN, C[291] = o.ARCSIN, C[292] = o.ARCCOS, C[293] = o.ARCTAN, C[337] = o.ARCSEC, C[338] = o.ARCCSC, C[339] = o.ARCCOT, C[262] = o.SEC, C[264] = o.COT, C[265] = o.CSC, C[307] = o.SINH, C[308] = o.COSH, C[309] = o.TANH, C[313] = o.ARCSINH, C[314] = o.ARCCOSH, C[315] = o.ARCTANH, C[334] = o.ARCSECH, C[335] = o.ARCCSCH, C[336] = o.ARCCOTH, C[310] = o.SECH, C[311] = o.COTH, C[312] = o.CSCH, C[263] = o.LN, C[267] = o.LG, C[268] = o.LOG, C[61] = o.EQL, C[44] = o.COMMA, C[269] = o.TEXT, C[368] = o.OPERATORNAME, C[270] = o.LT, C[271] = o.LE, C[272] = o.GT, C[273] = o.GE, C[301] = o.NE, C[305] = o.NGTR, C[306] = o.NLESS, C[333] = o.NI, C[347] = o.SUBSETEQ, C[348] = o.SUPSETEQ, C[349] = o.SUBSET, C[350] = o.SUPSET, C[302] = o.APPROX, C[345] = o.PERP, C[346] = o.PROPTO, C[352] = o.PARALLEL, C[353] = o.NPARALLEL, C[354] = o.SIM, C[355] = o.CONG, C[274] = o.EXISTS, C[275] = o.IN, C[276] = o.FORALL, C[277] = o.LIM, C[278] = o.EXP, C[279] = o.TO, C[124] = o.PIPE, C[280] = o.SUM, C[281] = o.INTEGRAL, C[282] = o.PROD, C[341] = o.CUP, C[342] = o.BIGCUP, C[343] = o.CAP, C[344] = o.BIGCAP, C[283] = o.M, C[363] = o.IMPLIES, C[366] = o.CAPRIGHTARROW, C[284] = o.RIGHTARROW, C[356] = o.LEFTARROW, C[357] = o.LONGRIGHTARROW, C[358] = o.LONGLEFTARROW, C[359] = o.OVERRIGHTARROW, C[360] = o.OVERLEFTARROW, C[364] = o.LEFTRIGHTARROW, C[365] = o.CAPLEFTRIGHTARROW, C[361] = o.LONGLEFTRIGHTARROW, C[362] = o.OVERLEFTRIGHTARROW, C[33] = o.FACT, C[285] = o.BINOM, C[286] = o.ROW, C[287] = o.COL, C[58] = o.COLON, C[59] = o.SEMICOLON, C[295] = o.TYPE, C[296] = o.OVERLINE, C[377] = o.DOT, C[297] = o.OVERSET, C[298] = o.UNDERSET, C[299] = o.BACKSLASH, C[300] = o.MATHBF, C[340] = o.MATHFIELD, C[367] = o.DELTA;
+	function w(e, t) {
+		return {
+			op: e,
+			args: t
+		};
+	}
+	let T = w(e.NONE, [w(e.VAR, ["None"])]), E = function(t, n, i) {
+		let s = Object.keys(i);
+		s.push("to"), n = u(n);
+		function c(n, r) {
+			let i = "";
+			if (e.option(t, "allowThousandsSeparator") || e.option(t, "setThousandsSeparator")) {
+				let o = e.option(t, "setThousandsSeparator");
+				o = [].concat(o === void 0 ? "," : o), o.indexOf(n) >= 0 && (K(!r || n === r, a(1013, [r, n])), i = n);
+			}
+			return i;
+		}
+		function d(n) {
+			let r = e.option(t, "setDecimalSeparator"), i = e.option(t, "setThousandsSeparator");
+			if (typeof r == "string") {
+				K(r.length === 1, a(1002));
+				let e = r;
+				return i instanceof Array && i.indexOf(e) >= 0 && K(!1, a(1008, [e])), n === e;
+			}
+			return r instanceof Array ? (r.forEach((e) => {
+				i instanceof Array && i.indexOf(e) >= 0 && K(!1, a(1008, [e]));
+			}), r.indexOf(n) >= 0) : i instanceof Array && i.indexOf(".") >= 0 || i === "." ? (K(r === void 0, a(1008, ["."])), n === ",") : n === ".";
+		}
+		let m = w(e.NUM, ["Infinity"]);
+		function h(t, n, r, i) {
+			if (n === "\\infty") return m;
+			let o = "", s, l, u, f = 0, p = "integer";
+			for (n === "." && K(!1, a(1004, [n, n.charCodeAt(0)])), s = 0; s < n.length; s++) c(l = n.charAt(s)) ? ((f && u !== s - 4 || !f && s > 4) && K(!1, a(1005)), u = s, f++) : (d(l) && (p === "decimal" && K(!1, a(1007, [l, o + l])), l = ".", p = "decimal", f && u !== s - 4 && K(!1, a(1005)), u = s, f++), o += l);
+			if (p !== "decimal" && u && u !== s - 4 && K(!1, a(1005)), r) {
+				let n = e.option(t, "decimalPlaces");
+				(!i || o.scale() > n) && (o = o.setScale(n, G.ROUND_HALF_UP), o = String(o));
+			} else o = String(o);
+			let h = e.option(t, "strict") && n || o;
+			return {
+				op: e.NUM,
+				args: [h],
+				separatorCount: f,
+				lastSeparatorIndex: u,
+				numberFormat: p
+			};
+		}
+		function g(t, n) {
+			return t.length === 0 && (t = [y]), v(e.MUL, t, n);
+		}
+		function _(e, t) {
+			return K(t.length === 1, "1000: Wrong number of arguments for unary node"), w(e, t);
+		}
+		function v(e, t, n) {
+			if (K(t.length > 0, "1000: Too few argument for binary node"), t.length < 2) return t[0];
+			let r = [];
+			return t.forEach((t) => {
+				n && t.op === e && t.args.length > 1 ? r = r.concat(t.args) : r.push(t);
+			}), w(e, r);
+		}
+		let y = h(t, "1"), b = h(t, "-1"), x = 0, S = 0, E, D, O = q(n);
+		function ee(e) {
+			x = O.start(e), E = O.lexeme();
+		}
+		function k() {
+			return x;
+		}
+		function A() {
+			return K(E !== void 0, `1000: Lexeme for token T0=${x} is missing.`), E;
+		}
+		function j(e) {
+			S === 0 ? (x = O.start(e), E = O.lexeme()) : (K(D !== void 0, `1000: Lexeme for token=${S} is missing.`), x = S, E = D, S = 0);
+		}
+		function M(e) {
+			return S === 0 && (S = O.start(e), D = O.lexeme()), S;
+		}
+		function N(e, t) {
+			let n = k();
+			if (n !== e) {
+				let t = String.fromCharCode(e), r = n ? String.fromCharCode(n) : "EOS";
+				K(!1, a(1001, [`${t}[${e}]`, `${r}[${n}]`]));
+			}
+			j(t);
+		}
+		function te(t) {
+			if (t.op === e.FRAC && (t.args[0].op === e.NUM || t.args[1].op === e.NUM)) {
+				let n = (t.args[0].op === e.SUB || t.args[0].op === e.ADD) && t.args[0].args.length === 1 && t.args[0].args[0] || t.args[0], r = (t.args[1].op === e.SUB || t.args[1].op === e.ADD) && t.args[1].args.length === 1 && t.args[1].args[0] || t.args[1];
+				return n.op === e.NUM && n.numberFormat === "integer" && r.op === e.NUM && r.numberFormat === "integer" && +r.args[0] != 0;
+			}
+			return !1;
+		}
+		function P(t) {
+			if (t.op === e.FRAC) {
+				let n = t.args[0], r = t.args[1];
+				return n.op === e.NUM && n.numberFormat === "integer" && r.op === e.NUM && r.numberFormat === "integer" && +n.args[0] < r.args[0];
+			}
+			return !1;
+		}
+		let F = [
+			"K",
+			"C",
+			"F"
+		], ne = [
+			"g",
+			"L",
+			"m",
+			"s"
+		];
+		function I() {
+			let n, i, o, c, l, u = [], d, f, p, m;
+			switch (o = k()) {
+				case 65:
+				case 97:
+					if (u = [A()], j(), k() === 48) {
+						let n = u[0].toUpperCase() + A(), r = s.some((e) => e.indexOf(n) === 0);
+						i = w(e.VAR, u), r && (i = g([i, h(t, A())]), j());
+					} else u[0] === "\\emptyset" ? u[0] = "\\varnothing" : u[0] === "\\mu" && k() === 269 && ne.includes(A()) ? (u[0] = `\\mu${A()}`, j()) : u[0] === "\\degree" && k() === 269 && F.includes(A()) && (u[0] = `\\degree ${A()}`, j()), i = w(e.VAR, u), r() && k() === 123 && M() === 125 && (N(123), N(125));
+					break;
+				case 269:
+					u = [A()], j(), i = w(e.TEXT, [w(e.VAR, u)]);
+					break;
+				case 48:
+					i = h(t, A()), j();
+					break;
+				case 369:
+					i = M() === 123 || M() === 371 ? R(o) : M() === 124 ? L(o) : z(o);
+					break;
+				case 295:
+					i = w(e.TYPE, [w(e.VAR, [A()])]), j();
+					break;
+				case 91:
+				case 40:
+				case 375:
+					i = z(o);
+					break;
+				case 93:
+					i = ce ? T : z(o);
+					break;
+				case 123:
+				case 371:
+					i = R(o);
+					break;
+				case 288: {
+					j();
+					let t = R();
+					if (t.op === e.VAR) {
+						if (t.args[0].indexOf("array") === 0) {
+							if (k() === 123) {
+								for (; k() !== 125;) j();
+								j();
+							}
+						} else if (t.args[0].indexOf("matrix") >= 0 && k() === 91) {
+							for (; k() !== 93;) j();
+							j();
+						}
+					}
+					let n = re();
+					N(289), R(), t.op === e.VAR && (t.args[0].indexOf("matrix") >= 0 || t.args[0].indexOf("array") === 0 ? i = w(e.MATRIX, [n]) : K(!1, "1000: Unrecognized LaTeX name"));
+					break;
+				}
+				case 124:
+					i = L();
+					break;
+				case 303:
+					j(), i = _(e.ABS, [R()]);
+					break;
+				case 256:
+					j(), f = R(), p = R(), f = f.args.length === 0 ? w(e.COMMA, [T]) : f, p = f.args.length === 0 ? w(e.COMMA, [T]) : p, i = w(e.FRAC, [f, p]), i.isFraction = te(i);
+					break;
+				case 285: {
+					j();
+					let t = R(), n = R();
+					i = v(e.BINOM, [t, n]);
+					break;
+				}
+				case 257:
+					switch (j(), k()) {
+						case 91: {
+							let t = se(), n = R();
+							i = w(e.SQRT, [n, t]);
+							break;
+						}
+						case 123:
+							l = R(), i = w(e.SQRT, [l, w(e.NUM, ["2"])]);
+							break;
+						default: K(!1, a(1001, ["{ or (", String.fromCharCode(k())]));
+					}
+					break;
+				case 290:
+					j(), i = w(e.VEC, [R()]);
+					break;
+				case 368: {
+					let t = A();
+					j(), i = w(e.OPERATORNAME, [w(e.VAR, [t]), I()]);
+					break;
+				}
+				case 259:
+				case 261:
+				case 260:
+				case 262:
+				case 264:
+				case 265:
+				case 307:
+				case 308:
+				case 309:
+				case 310:
+				case 311:
+				case 312:
+					for (j(); k() === 94;) j({ oneCharToken: !0 }), u.push(B());
+					return u.length === 1 && _e(u[0]) ? (c = `arc${C[o]}`, u.pop()) : c = C[o], (n = k()) === 369 ? (i = M() === 123 || M() === 371 ? R(n) : M() === 124 ? L(n) : z(n), u.unshift(w(c, [i]))) : (n = k()) === 123 || n === 371 ? u.unshift(w(c, [R(n)])) : (n = k()) === 40 || n === 91 ? u.unshift(w(c, [z(n)])) : (d = H(V(!0)), m = U(t, d), d = m && W(d) || d, u.unshift(w(c, [d]))), i = u.length > 1 ? w(e.POW, u) : u[0], m && (i = g([
+						i,
+						w(e.VAR, ["d"]),
+						m
+					])), i;
+				case 291:
+				case 292:
+				case 293:
+				case 337:
+				case 338:
+				case 339:
+				case 313:
+				case 314:
+				case 315:
+				case 334:
+				case 335:
+				case 336:
+					for (j(); (n = k()) === 94;) j({ oneCharToken: !0 }), u.push(B());
+					return (n = k()) === 369 ? (i = M() === 123 || M() === 371 ? R(n) : M() === 124 ? L(n) : z(n), u.unshift(w(C[o], [i]))) : (n = k()) === 123 || n === 371 ? u.unshift(w(C[o], [R(n)])) : (n = k()) === 40 || n === 91 ? u.unshift(w(C[o], [z(n)])) : (n = k()) === 124 ? u.unshift(w(C[o], [L(n)])) : (d = H(V(!0)), m = U(t, d), d = m && W(d) || d, u.unshift(w(C[o], [d]))), i = u.length > 1 ? w(e.POW, u) : u[0], m && (i = g([
+						i,
+						w(e.VAR, ["d"]),
+						m
+					])), i;
+				case 263: return j(), (n = k()) === 369 ? (i = M() === 123 || M() === 371 ? R(n) : M() === 124 ? L(n) : z(n), u.push(i)) : (n = k()) === 123 || n === 371 ? u.push(R(n)) : (n = k()) === 40 || n === 91 ? u.push(z(n)) : (n = k()) === 124 ? u.push(L(n)) : (d = H(V(!0)), m = U(t, d), d = m && W(d) || d, u.push(d)), i = w(e.LOG, [w(e.VAR, ["e"])].concat(u)), m && (i = g([
+					i,
+					w(e.VAR, ["d"]),
+					m
+				])), i;
+				case 267: return j(), (n = k()) === 369 ? (i = M() === 123 || M() === 371 ? R(n) : M() === 124 ? L(n) : z(n), u.push(i)) : (n = k()) === 123 || n === 371 ? u.push(R(n)) : (n = k()) === 40 || n === 91 ? u.push(z(n)) : (n = k()) === 124 ? u.push(L(n)) : (d = H(V(!0)), m = U(t, d), d = m && W(d) || d, u.push(d)), i = w(e.LOG, [w(e.NUM, ["10"])].concat(u)), m && (i = g([
+					i,
+					w(e.VAR, ["d"]),
+					m
+				])), i;
+				case 268: return j(), (n = k()) === 95 ? (j({ oneCharToken: !0 }), u.push(I())) : u.push(w(e.NUM, ["10"])), (n = k()) === 369 ? (i = M() === 123 || M() === 371 ? R(n) : M() === 124 ? L(n) : z(n), u.push(i)) : (n = k()) === 123 || n === 371 ? u.push(R(n)) : (n = k()) === 40 || n === 91 ? u.push(z(n)) : (n = k()) === 124 ? u.push(L(n)) : (d = H(V(!0)), m = U(t, d), d = m && W(d) || d, u.push(d)), i = w(e.LOG, u), m && (i = g([
+					i,
+					w(e.VAR, ["d"]),
+					m
+				])), i;
+				case 277: return ze();
+				case 281:
+				case 378:
+				case 379: return Re();
+				case 280:
+				case 282:
+				case 341:
+				case 342:
+				case 343:
+				case 344: return j(), k() === 95 && (j({ oneCharToken: !0 }), u.push(I()), k() === 94 && (N(94, { oneCharToken: !0 }), u.push(I()))), u.push(V()), w(C[o], u);
+				case 274: return j(), w(e.EXISTS, [We()]);
+				case 276:
+				case 366:
+				case 284:
+				case 356:
+				case 357:
+				case 358:
+				case 359:
+				case 360:
+				case 365:
+				case 364:
+				case 361:
+				case 362: return j(), w(C[o], [qe()]);
+				case 278: return j(), w(e.EXP, [Ie()]);
+				case 283: return j(), w(e.M, [V()]);
+				case 332: return j(), w(e.FORMAT, [R()]);
+				case 296: return j(), w(e.OVERLINE, [R()]);
+				case 377:
+					j();
+					{
+						let n, r = "";
+						n = R(), K(n.op === e.NUM), r += n.args[0], k() === 48 && M() === 377 && (n = I(), K(n.op === e.NUM), r += n.args[0]), k() === 377 && (j(), n = R(), K(n.op === e.NUM), r += n.args[0]), d = w(e.OVERLINE, [h(t, r)]);
+					}
+					return d;
+				case 340: return j(), w(C[o], [R()]);
+				case 297:
+				case 298: return j(), f = R(), p = R(), p.args.push(w(C[o], [f])), p;
+				case 300: return j(), f = R(), w(e.MATHBF, [f]);
+				case 63: return j(), w(e.VAR, ["?"]);
+				case 367: {
+					j();
+					let t;
+					return k() === 97 ? (t = A(), j()) : t = "", w(e.VAR, [`Delta_${t}`]);
+				}
+				case 46: return j(), T;
+				default: K(!e.option(t, "strict"), a(1006, [o])), i = T;
+			}
+			return i;
+		}
+		function re() {
+			let e = [];
+			for (e.push(ie()); k() === 286;) j(), e.push(ie());
+			return w(C[286], e);
+		}
+		function ie() {
+			let e = [];
+			for (e.push(qe()); k() === 287;) j(), e.push(We());
+			return w(C[287], e);
+		}
+		let ae = 0;
+		function L(t) {
+			t ||= 124, ae++, N(t);
+			let n, r;
+			t === 369 ? N(n = k()) : n = t;
+			let i = Ie();
+			return N(r = t === 369 && 370 || n), r === 370 && N(r = n), ae--, _(e.ABS, [i]);
+		}
+		function R(t) {
+			t ||= 123, N(t);
+			let n, r;
+			t === 369 ? N(n = k() === 371 && 371 || 123) : n = t;
+			let i;
+			return k() === 370 || k() === 125 || k() === 372 ? (N(r = k()), r === 370 && N(r = k() === 46 && 46 || k() === 372 && 372 || 125), i = w(e.COMMA, [])) : (i = qe(), N(r = t === 369 && 370 || t === 371 && 372 || 125), r === 370 && N(r = k() === 46 && 46 || k() === 372 && 372 || 125), i.op === T.op && i.args[0] === T.args[0] && (i = w(e.COMMA, []))), i.lbrk = n, i.rbrk = r, i;
+		}
+		let oe = 0;
+		function se(e) {
+			e ||= 91, K(e === 369 || e === 91, "1000: Internal error"), oe++, N(e);
+			let t;
+			e === 369 && N(91);
+			let n = qe();
+			return N(t = e === 369 && 369 || 93), t === 370 && N(t = 93), oe--, n;
+		}
+		let ce;
+		function z(t) {
+			oe++, N(t);
+			let n, r, i;
+			t === 369 ? (N(n = k()), i = !0) : n = t;
+			let o;
+			return k() === 370 || k() === 41 || k() === 93 ? (N(r = i && 370 || k()), r === 370 && N(r = n === 40 && 41 || n === 91 && 93 || n === 375 && 376), o = w(e.COMMA, [])) : (ce = !0, o = qe(!0), N(r = i && 370 || k() === 41 && 41 || k() === 376 && 376 || t === 369 && 370 || k() === 91 && 91 || 93), r === 370 && N(r = k() === 41 && 41 || k() === 376 && 376 || k() === 91 && 91 || 93)), n = n === 93 ? 40 : n, r = r === 91 ? 41 : r, (n === 40 || n === 91 || n === 93) && (r === 41 || r === 93 || r === 91) ? o = w(o.op === e.COMMA && o.args.length === 2 && (n === 40 && r === 41 && e.INTERVALOPEN || n === 91 && r === 93 && e.INTERVAL) || n === 40 && r === 41 && e.PAREN || n === 91 && r === 93 && e.BRACKET || n === 40 && r === 93 && e.INTERVALLEFTOPEN || n === 91 && r === 41 && e.INTERVALRIGHTOPEN, [o]) : o.lbrk === 46 && o.rbrk === 124 ? o = w(e.EVALAT, [o]) : n === 375 && r === 376 ? o = w(e.ANGLEBRACKET, [o]) : (o.op === e.COMMA || n === 40 || n === 91) && (K(n === 40 && r === 41 || n === 91 && r === 93 || n === r, a(1011, [`tk1=${n} tk2=${r}`])), o = w(n === 91 && e.BRACKET || e.PAREN, [o])), oe--, ce = !1, o.lbrk = n, o.rbrk = r, o;
+		}
+		function le() {
+			let t = [I()];
+			for (; k() === 94;) {
+				j({ oneCharToken: !0 });
+				let n;
+				if ((me(t[0]) || r()) && ((n = k()) === 43 || n === 45)) j(), t.push(_(C[n], [y]));
+				else {
+					let n = B();
+					n.op === e.VAR && n.args[0] === "\\circ" && (k() === 269 && (A() === "K" || A() === "C" || A() === "F") ? (n = g([t.pop(), _(e.VAR, [`\\degree ${A()}`])]), j()) : n = g([t.pop(), _(e.VAR, ["\\degree"])])), t.push(n);
+				}
+			}
+			if (t.length > 1) {
+				let n = t.pop();
+				return t.reverse().forEach((t) => {
+					n = w(e.POW, [t, n]);
+				}), n.isPolynomial = Oe(n), n;
+			}
+			let n = t[0];
+			return n.isPolynomial = Oe(n), n;
+		}
+		function ue() {
+			let t, n = le();
+			switch (t = k()) {
+				case 37:
+					j(), n = w(e.PERCENT, [n]);
+					break;
+				case 33:
+					j(), n = w(e.FACT, [n]);
+					break;
+				default: if (t === 124 && M() === 95) {
+					j();
+					let t = [n];
+					j({ oneCharToken: !0 }), t.push(w(e.SUBSCRIPT, [We()])), n = w(e.PIPE, t);
+				} else r() && (t === 43 || t === 45) && M() === 125 && (j(), n = _(C[t], [n]));
+			}
+			return n;
+		}
+		function de(e) {
+			return e === 43 || e === 45 || e === 44 || e === 125 || e === 41 || e === 93 || e === 376 || e === 370 || e === 0;
+		}
+		function B() {
+			let t, n, r;
+			switch (t = k()) {
+				case 43:
+				case 351:
+				case 45:
+					j(), n = w(C[t], [B()]);
+					break;
+				case 258:
+					j(), n = V(!0), n = w(C[t], [n]);
+					break;
+				case 95:
+					if (r = C[t], j({ oneCharToken: !0 }), (t = k()) === 43 || t === 45 ? (j(), n = y) : n = B(), n = w(r, [n]), (t = k()) === 94) {
+						let e = [n];
+						r = C[t], j({ oneCharToken: !0 }), (t = k()) === 43 || t === 45 ? (j(), n = y) : n = B(), e.push(n), n = w(r, e);
+					}
+					break;
+				case 94:
+					r = C[t], j({ oneCharToken: !0 }), (t = k()) === 43 || t === 45 ? (j(), n = y) : n = B(), n = w(r, [n]);
+					break;
+				default: t === 97 && A() === "$" ? (j(), de(k()) ? n = w(e.VAR, ["$"]) : (n = g([w(e.VAR, ["$"]), ue()]), n.args[1].isPolynomialTerm = !0)) : n = ue();
+			}
+			return n;
+		}
+		function fe() {
+			let t = [B()];
+			for (; k() === 95;) j({ oneCharToken: !0 }), t.push(le()), r() && k() === 123 && (N(123), N(125));
+			let i;
+			return t.length === 1 ? (i = t[0], K(i.op !== e.SUBSCRIPT || i.args.length !== 1, a(1012, [n]))) : i = o(t), i;
+			function o(t) {
+				let n, r;
+				return t.forEach((t) => {
+					t.op === e.SUBSCRIPT && (t = o(t.args));
+					let i, a;
+					t.op === e.POW && !t.lbrk ? (n = t.args[1], i = r && r.op === e.SUBSCRIPT && r.args || r && [r] || [], a = t.args[0].op === e.SUBSCRIPT && t.args[0].args || [t.args[0]]) : r && r.op === e.POW ? (n = r.args[1], i = r.args[0].op === e.SUBSCRIPT && r.args[0].args || [r.args[0]], a = t.op === e.SUBSCRIPT && t.args || [t]) : (i = r && r.op === e.SUBSCRIPT && r.args || r && [r] || [], a = t.op === e.SUBSCRIPT && t.args || [t]);
+					let s = i.concat(a);
+					r = s.length > 1 && w(e.SUBSCRIPT, s) || s[0];
+				}), n && v(e.POW, [r, n]) || r;
+			}
+		}
+		function pe() {
+			let t, n = fe();
+			if (be(n)) return xe(n);
+			if (Ce(n) && (k() === 256 || k() === 48 && M() === 47)) {
+				let t = pe();
+				if (be(t)) return xe(t);
+				if (we(n, t)) {
+					let r;
+					t.op === e.PERCENT && (t = t.args[0], r = !0);
+					let i;
+					Ne(n) && (i = !0, n = Pe(n)), n = v(e.ADD, [n, t]), n.isMixedNumber = !0, i && (n = Pe(n)), r === !0 && (n = w(e.PERCENT, [n]));
+				} else n = v(e.MUL, [n, t]), t.isImplicit = !0;
+			}
+			for (; (t === void 0 || t === k()) && (t = k()) === 47;) j(), n = w(C[t], [n, fe()]), n.isFraction = te(n), n.isSlash = t === 47;
+			return n.op === e.FRAC && n.args[1].op === e.PERCENT && (n = w(e.PERCENT, [w(e.FRAC, [n.args[0], n.args[1].args[0]])])), n;
+		}
+		function me(t) {
+			if (t.op !== e.VAR) return !1;
+			let n = e.env[t.args[0]];
+			return !!(n && n.name);
+		}
+		function he(t, n) {
+			return K(n === void 0 || typeof n == "string", "1000: Invalid id"), t.op === e.VAR ? n === void 0 || t.args[0] === n : t.op === e.POW && he(t.args[0]) && Te(t.args[1]) ? n === void 0 || t.args[0].args[0] === n : !1;
+		}
+		function ge(t) {
+			return t.op === e.NUM && (t.args[0] === "1" || t.args[0] === "1.");
+		}
+		function _e(t) {
+			return t.op === e.SUB && t.args.length === 1 && ge(t.args[0]);
+		}
+		function ve(e) {
+			return e === 42 || e === 294 || e === 47 || e === 373 || e === 304;
+		}
+		function ye(e) {
+			return e === 259 || e === 261 || e === 260 || e === 262 || e === 264 || e === 265 || e === 307 || e === 308 || e === 309 || e === 310 || e === 311 || e === 312 || e === 291 || e === 292 || e === 293 || e === 337 || e === 339 || e === 338 || e === 313 || e === 314 || e === 315 || e === 334 || e === 336 || e === 335 || e === 263 || e === 268 || e === 267;
+		}
+		function be(t) {
+			if (t.op !== e.FRAC) return !1;
+			let n = t.args[0], r = n.op === e.MUL && n.args[0].op === e.VAR && n.args[0].args[0] || n.op === e.VAR && n.args[0] || n.op === e.POW && n.args[0].op === e.VAR && n.args[0].args[0], i = t.args[1], a = i.op === e.MUL && i.args[0].op === e.VAR && i.args[0].args[0];
+			return r === "d" && a === "d" && (i.args[1] && i.args[1].op === e.VAR || i.args[1] && i.args[1].op === e.POW && i.args[1].args[0] && i.args[1].args[0].op === e.VAR);
+		}
+		function xe(t) {
+			if (t.op !== e.FRAC) return null;
+			let n = t.args[0], r = t.args[1], i = n.op === e.MUL && g(n.args.slice(1)) || V();
+			K(r.args.length === 2);
+			let a = r.args[1], o = a.op === e.POW && a.args[0] || a, s = a.op === e.POW && a.args[1] || y;
+			return t = w(e.DERIV, [
+				i,
+				o,
+				s
+			]), t;
+		}
+		function V(n = !1) {
+			let i, o, s = !1, c = [], l;
+			o = pe(), c = [o];
+			let u = 0;
+			for (; (i = k()) && !Fe(i) && !Ve(i) && !Ge(i) && i !== 44 && i !== 59 && i !== 58 && !Ue(i) && i !== 125 && i !== 372 && i !== 41 && i !== 370 && i !== 376 && !((i === 91 || i === 93) && oe > 0) && i !== 284 && i !== 366 && i !== 270 && !(i === 124 && ae > 0) && i !== 286 && i !== 287 && i !== 289 && !(n && (ve(i) || ye(i) || i === 40 || i === 369 || i === 91 || i === 375 || i === 300) || U(t, H(o)));) {
+				if (s = !1, ve(i) && (j(), s = !0), o = pe(), (i === 304 || i === 373 || i === 294) && (o = v(C[i], [c.pop(), o], !0)), s || c.length === 0 || o.lbrk || c[c.length - 1].op !== e.NUM || c[c.length - 1].numberFormat !== "decimal" || c[c.length - 1].lastSeparatorIndex !== c[c.length - 1].args[0].length - 1 || c[c.length - 1].lastSeparatorIndex === c[c.length - 1].args[0].length || c[c.length - 1].lbrk || Ae([c[c.length - 1], o]) || o.op !== e.NUM || K(!1, "Shouldn't get here"), K(s || c.length === 0 || o.lbrk || c[c.length - 1].op !== e.NUM || c[c.length - 1].lbrk || Ae([c[c.length - 1], o]) || o.op !== e.NUM, a(1010)), r() && i === 40 && he(c[c.length - 1], "M")) c.pop(), o = _(e.M, [o]);
+				else if (!s && c.length > 0) {
+					if (c.length > 0 && we(c[c.length - 1], o)) i = c.pop(), Ne(i) && (o = v(e.MUL, [b, o])), o = v(e.ADD, [i, o]), o.isMixedNumber = !0;
+					else if (c.length > 0 && c[c.length - 1].op === e.VAR && o.op === e.VAR && o.args[0].indexOf("'") === 0) o = v(e.POW, [c.pop(), o]), o.isImplicit = o.args[0].isImplicit;
+					else if (c.length > 0 && (c[c.length - 1].op === e.MUL || c[c.length - 1].op === e.DOT) && c[c.length - 1].args[c[c.length - 1].args.length - 1].op === e.VAR && o.op === e.VAR && o.args[0].indexOf("'") === 0) i = c.pop(), o = g(i.args.concat(v(e.POW, [i.args.pop(), o]))), o.isImplicit = o.args[0].isImplicit;
+					else if (c.length > 0 && c[c.length - 1].op === e.VAR && o.op === e.POW && o.args[0].op === e.VAR && o.args[0].args[0].indexOf("'") === 0) o = w(e.POW, [v(e.POW, [c.pop(), o.args[0]])].concat(o.args.slice(1)));
+					else if (c.length > 0 && (l = Ae([c[c.length - 1], o]))) c.pop(), o = l;
+					else if (je(c, o)) {
+						let n = c.pop();
+						o = v(e.POW, [h(t, "10"), B()]), o = v(e.TIMES, [n, o]), Me(o.args) && (o.isScientific = !0);
+					} else o.op === e.VAR && o.args[0] === "\\degree" && c.length === 1 && c[0].op === e.SUB && c[0].args.length === 1 ? (o = _(e.SUB, [g([c[0].args[0], o])]), c.pop()) : o = g([c.pop(), o], !0);
+				} else (i === 373 || i === 304) && Me(o.args) && (o.isScientific = !0);
+				c.push(o), K(u++ < 1e3, "1000: Stuck in loop in multiplicativeExpr()");
+			}
+			let d = c[0];
+			return d.op === e.MUL && d.args.length > 1 ? Se(d) : d;
+		}
+		function Se(t) {
+			K(t.op === e.MUL, "1000: Internal error");
+			let { args: n } = t, r = n[0];
+			return r.op === e.COMMA && r.args.length === 0 && (n = n.slice(1, n.length), n[0].isImplicit = !1), r = n[n.length - 1], r.op === e.COMMA && r.args.length === 0 && (n = n.slice(0, n.length - 1)), w(t.op, n);
+		}
+		function Ce(t) {
+			return (t.op === e.SUB || t.op === e.ADD) && t.args.length === 1 && (t = t.args[0]), t.op === e.NUM && t;
+		}
+		function we(t, n) {
+			return (t.op === e.SUB || t.op === e.ADD) && t.args.length === 1 && (t = t.args[0]), n.op === e.PERCENT && (n = n.args[0]), !!(t.op === e.NUM && P(n));
+		}
+		function Te(t) {
+			let n;
+			return t ? ((t.op === e.SUB || t.op === e.ADD) && t.args.length === 1 && (t = t.args[0]), t.op === e.NUM && (n = new G(t.args[0])) && Te(n) ? !0 : t instanceof G && t.modulo(De).cmp(Ee) === 0) : !1;
+		}
+		let Ee = new G("0"), De = new G("1");
+		function Oe(t) {
+			let n = 0;
+			if (t.op === e.POW) {
+				let r = t.args[0], i = t.args[1];
+				(r.op === e.VAR || r.isPolynomial || r.op === e.PAREN && Oe(r.args[0])) && Te(i) && (n = parseInt(i.args[0], 10));
+			} else t.op === e.VAR ? n = 1 : (t.op === e.ADD || t.op === e.SUB || t.op === e.MUL) && t.args.forEach((e) => {
+				let t = Oe(e);
+				n = t > n && t || n;
+			});
+			return n;
+		}
+		function ke(t) {
+			return t.op === e.MUL || t.op === e.TIMES || t.op === e.CDOT;
+		}
+		function Ae(t) {
+			if (!Ce(t[0])) return null;
+			let n, r = !1;
+			t[0].op === e.SUB && t[0].args[0].op === e.NUM && (t[0] = t[0].args[0], r = !0), ke(t[0]) && t[0].args[t[0].args.length - 1].numberFormat === "decimal" && (n = t[0].args.slice(0, t[0].args.length - 1), t = t[0].args.slice(t[0].args.length - 1).concat(t[1]));
+			let i, a, o;
+			if (!t[0].lbrk && (t[0].op === e.NUM && t[0].numberFormat === "decimal" || t[0].op === e.VAR && t[0].args[0] === "?" || t[0].op === e.TYPE && t[0].args[0].op === e.VAR && t[0].args[0].args[0] === "decimal")) {
+				if (!t[1].lbrk && t[1].op === e.OVERLINE) a = t[0], o = t[1].args[0];
+				else return null;
+				a.isRepeating = !0, o.isRepeating = !0, i = v(e.ADD, [a, o]), i.numberFormat = "decimal", i.isRepeating = !0, n && (i = g(n.concat(i)));
+			} else i = null;
+			return i = i !== null && r && _(e.SUB, [i]) || i, i;
+		}
+		function je(t, n) {
+			return !!(t.length > 0 && Ce(t[t.length - 1]) && n.op === e.TEXT && (n.args[0].args[0] === "E" || n.args[0].args[0] === "e") && (k() === 48 || (k() === 45 || k() === 43) && M() === 48));
+		}
+		function Me(t) {
+			let n;
+			if (t.length === 2) {
+				let r = t[0], i = t[1];
+				return !!((n = Ce(r)) && +n.args[0] >= 1 && +n.args[0] < 10 && i.op === e.POW && (n = Ce(i.args[0])) && n.args[0] === "10" && Te(i.args[1]));
+			}
+			return !1;
+		}
+		function Ne(t) {
+			return typeof t == "number" ? t < 0 : t.args.length === 1 ? t.op === o.SUB && t.args[0].args[0] > 0 || t.op === e.NUM && +t.args[0] < 0 : t.args.length === 2 && t.op === o.MUL && Ne(t.args[0]);
+		}
+		function Pe(t) {
+			if (typeof t == "number") return -t;
+			if (t.op === e.SUB && t.args.length === 1) return t.args[0];
+			if (t.op === e.MUL) {
+				let e = t.args.slice(0);
+				return g([Pe(e.shift())].concat(e));
+			}
+			return t.op === e.POW && _e(t.args[1]) ? v(e.POW, [Pe(t.args[0]), b]) : _(e.SUB, [t]);
+		}
+		function Fe(e) {
+			return e === 43 || e === 45 || e === 258 || e === 299 || e === 341 || e === 343;
+		}
+		function Ie() {
+			let n = V(), r;
+			for (; Fe(r = k());) {
+				j();
+				let i = V();
+				switch (r) {
+					case 299:
+					case 341:
+					case 343:
+						n.lbrk === 371 && n.rbrk === 372 && (n = w(e.SET, [n])), i.lbrk === 371 && i.rbrk === 372 && (i = w(e.SET, [i])), n = v(C[r], [n, i]);
+						break;
+					case 258:
+						n = v(e.PM, [n, i]);
+						break;
+					case 45:
+						n = v(e.SUB, [n, i]);
+						break;
+					default: {
+						let r = !e.option(t, "compareGrouping") && !(n.isMixedNumber || i.isMixedNumber);
+						n = v(e.ADD, [n, i], r);
+						break;
+					}
+				}
+			}
+			return n.isPolynomial = Oe(n), n;
+		}
+		function Le(t) {
+			return t.op === e.SIN || t.op === e.COS || t.op === e.TAN || t.op === e.SEC || t.op === e.COT || t.op === e.CSC || t.op === e.SINH || t.op === e.COSH || t.op === e.TANH || t.op === e.SECH || t.op === e.COTH || t.op === e.CSCH || t.op === e.ARCSIN || t.op === e.ARCCOS || t.op === e.ARCTAN || t.op === e.ARCSEC || t.op === e.ARCCOT || t.op === e.ARCCSC || t.op === e.ARCSINH || t.op === e.ARCCOSH || t.op === e.ARCTANH || t.op === e.ARCSECH || t.op === e.ARCCOTH || t.op === e.ARCCSCH || t.op === e.LN || t.op === e.LOG || t.op === e.LG;
+		}
+		function H(t) {
+			let n = [], r = t.op;
+			if (r === e.NUM || r === e.VAR) return t;
+			(r === e.CDOT || r === e.TIMES) && (r = e.MUL), t.args.forEach((t) => {
+				t = H(t), r !== e.INTEGRAL && t.op === r && t.args.length > 1 ? n = n.concat(t.args) : n.push(t);
+			});
+			let { isMixedNumber: i } = t;
+			return t = w(r, n), t.isMixedNumber = i, t;
+		}
+		function U(t, n) {
+			if (!e.option(t, "parsingIntegralExpr")) return null;
+			let r = n.args.length;
+			if (n.op === e.MUL && n.args[r - 1].op === e.FRAC || ke(n) && Le(n.args[r - 1])) return U(t, n.args[r - 1]);
+			if (n.op === e.FRAC) return U(t, n.args[0]);
+			if (Le(n)) return U(t, n.args[r - 1]);
+			let i = n.args[r - 2], a = n.args[r - 1];
+			return n && n.op === e.MUL && i.op === e.VAR && i.args[0] === "d" && a.op === e.VAR && a || null;
+		}
+		function W(t) {
+			K(ke(t) || t.op === e.FRAC || Le(t));
+			let n = t.args[t.args.length - 1];
+			return t.op === e.MUL && n.op === e.FRAC ? (n = W(n), t = g(t.args.slice(0, t.args.length - 1).concat(n))) : ke(t) && Le(n) ? (n = W(n), t = w(t.op, t.args.slice(0, t.args.length - 1).concat(n))) : t = t.op === e.FRAC ? w(e.FRAC, [W(t.args[0]), t.args[1]]) : Le(t) ? w(t.op, [W(t.args[t.args.length - 1])]) : g(t.args.slice(0, t.args.length - 2)), t;
+		}
+		function Re(r) {
+			let i, o, s = e.option(t, "parsingIntegralExpr", !0), c = [];
+			if (k() === 379) N(379), i = Re(379), o = U(t, H(V()));
+			else if (k() === 378 || r === 379) r !== 379 && N(378), i = Re(378), o = U(t, H(V()));
+			else if (r !== 378 && N(281), k() === 95 && (j({ oneCharToken: !0 }), c.push(I()), k() === 94 && (N(94, { oneCharToken: !0 }), c.push(I()))), k() === 281) i = Re(), o = U(t, H(V()));
+			else {
+				i = H(V());
+				let n;
+				for (o = U(t, i), i = o && W(i) || i; Fe(n = k()) && !o;) {
+					j();
+					let r = H(V());
+					switch (o = U(t, r), r = o && W(r) || r, n) {
+						case 45:
+							i = v(e.SUB, [i, r]);
+							break;
+						default: i = v(e.ADD, [i, r], !0);
+					}
+				}
+			}
+			return c.push(i), c.push(o || T), e.option(t, "parsingIntegralExpr", s), K(o, a(1014, [n.replace(/\\\\/g, "\\")])), w(e.INTEGRAL, c);
+		}
+		function ze() {
+			N(277);
+			let t = [];
+			return k() === 95 && (j({ oneCharToken: !0 }), t.push(I())), t.push(V()), w(e.LIM, t);
+		}
+		function Be() {
+			let t = Ie();
+			for (; k() === 58;) {
+				j();
+				let n = Ie();
+				t = v(e.COLON, [t, n], !0);
+			}
+			return t;
+		}
+		function Ve(e) {
+			return e === 270 || e === 271 || e === 272 || e === 273 || e === 305 || e === 306 || e === 275 || e === 279 || e === 345 || e === 346 || e === 333 || e === 351 || e === 347 || e === 348 || e === 349 || e === 350 || e === 352 || e === 353 || e === 354 || e === 355;
+		}
+		function He() {
+			let n = k(), r = Be(), i = [], a = !1;
+			for (; Ve(n = k());) {
+				if (j(), n === 351) {
+					a = !0;
+					continue;
+				}
+				let o = Be();
+				r = w(C[n], [r, o]), a &&= (r.op = `n${r.op}`, !1), i.push(r), r = e.create(t, o);
+			}
+			return i.length === 0 ? r : i.length === 1 ? i[0] : w(e.COMMA, i);
+		}
+		function Ue(e) {
+			return e === 61 || e === 301 || e === 302;
+		}
+		function We() {
+			let n = He(), r, i = [];
+			for (; Ue(r = k()) || r === 284;) {
+				j();
+				let a = Be();
+				n = w(C[r], [n, a]), i.push(n), n = e.create(t, a);
+			}
+			return i.length === 0 ? n : i.length === 1 ? i[0] : w(e.COMMA, i);
+		}
+		function Ge(e) {
+			return e === 363 || e === 284 || e === 366 || e === 356 || e === 357 || e === 358 || e === 359 || e === 360 || e === 365 || e === 364 || e === 361 || e === 362;
+		}
+		function Ke() {
+			let e = We(), t;
+			for (; Ge(t = k());) {
+				j();
+				let n = We();
+				e = w(C[t], [e, n]);
+			}
+			return e;
+		}
+		function qe(e) {
+			let t = Ke(), n = [t], r;
+			for (; (r = k()) === 44 || e && r === 59;) j(), l(k()) || n.push(Ke());
+			return n.length > 1 ? w(C[44], n) : t;
+		}
+		function Je() {
+			try {
+				if (ee(), k()) {
+					let t = qe();
+					return K(!k(), a(1003, [
+						O.pos(),
+						O.lexeme(),
+						`"${n.substring(O.pos() - 1)}"`
+					])), t.lbrk === 371 && (t = w(e.SET, [t])), t;
+				}
+			} catch (e) {
+				throw console.log(`SYNTAX ERROR in: ${n}\n${e.stack}`), e;
+			}
+			return T;
+		}
+		return { expr: Je };
+		function q(n) {
+			let r = 0, i = "", o = {
+				"\\Delta": 367,
+				"\\cdot": 304,
+				"\\times": 373,
+				"\\div": 294,
+				"\\dfrac": 256,
+				"\\frac": 256,
+				"\\sqrt": 257,
+				"\\vec": 290,
+				"\\pm": 258,
+				"\\not": 351,
+				"\\sin": 259,
+				"\\cos": 261,
+				"\\tan": 260,
+				"\\sec": 262,
+				"\\cot": 264,
+				"\\csc": 265,
+				"\\arcsin": 291,
+				"\\arccos": 292,
+				"\\arctan": 293,
+				"\\arcsec": 337,
+				"\\arccsc": 338,
+				"\\arccot": 339,
+				"\\asin": 291,
+				"\\acos": 292,
+				"\\atan": 293,
+				"\\asec": 337,
+				"\\acsc": 338,
+				"\\acot": 339,
+				"\\sinh": 307,
+				"\\cosh": 308,
+				"\\tanh": 309,
+				"\\sech": 310,
+				"\\coth": 311,
+				"\\csch": 312,
+				"\\arcsinh": 313,
+				"\\arccosh": 314,
+				"\\arctanh": 315,
+				"\\arcsech": 334,
+				"\\arccsch": 335,
+				"\\arccoth": 336,
+				"\\ln": 263,
+				"\\lg": 267,
+				"\\log": 268,
+				"\\left": 369,
+				"\\right": 370,
+				"\\big": null,
+				"\\Big": null,
+				"\\bigg": null,
+				"\\Bigg": null,
+				"\\ ": null,
+				"\\quad": null,
+				"\\qquad": null,
+				"\\text": 269,
+				"\\textrm": 269,
+				"\\textit": 269,
+				"\\textbf": 269,
+				"\\operatorname": 368,
+				"\\lt": 270,
+				"\\le": 271,
+				"\\leq": 271,
+				"\\gt": 272,
+				"\\ge": 273,
+				"\\geq": 273,
+				"\\ne": 301,
+				"\\neq": 301,
+				"\\ngtr": 305,
+				"\\nless": 306,
+				"\\ni": 333,
+				"\\subseteq": 347,
+				"\\supseteq": 348,
+				"\\subset": 349,
+				"\\supset": 350,
+				"\\approx": 302,
+				"\\implies": 363,
+				"\\Rightarrow": 366,
+				"\\rightarrow": 284,
+				"\\leftarrow": 356,
+				"\\longrightarrow": 357,
+				"\\longleftarrow": 358,
+				"\\overrightarrow": 359,
+				"\\overleftarrow": 360,
+				"\\Leftrightarrow": 365,
+				"\\leftrightarrow": 364,
+				"\\longleftrightarrow": 361,
+				"\\overleftrightarrow": 362,
+				"\\perp": 345,
+				"\\propto": 346,
+				"\\parallel": 352,
+				"\\nparallel": 353,
+				"\\sim": 354,
+				"\\cong": 355,
+				"\\exists": 274,
+				"\\in": 275,
+				"\\forall": 276,
+				"\\lim": 277,
+				"\\exp": 278,
+				"\\to": 279,
+				"\\sum": 280,
+				"\\int": 281,
+				"\\iint": 378,
+				"\\iiint": 379,
+				"\\prod": 282,
+				"\\cup": 341,
+				"\\bigcup": 342,
+				"\\cap": 343,
+				"\\bigcap": 344,
+				"\\%": 37,
+				"\\binom": 285,
+				"\\begin": 288,
+				"\\end": 289,
+				"\\colon": 58,
+				"\\vert": 124,
+				"\\lvert": 124,
+				"\\rvert": 124,
+				"\\mid": 124,
+				"\\type": 295,
+				"\\format": 332,
+				"\\overline": 296,
+				"\\dot": 377,
+				"\\overset": 297,
+				"\\underset": 298,
+				"\\backslash": 299,
+				"\\mathbf": 300,
+				"\\abs": 303,
+				"\\MathQuillMathField": 340,
+				"\\ldots": 97,
+				"\\vdots": 97,
+				"\\ddots": 97,
+				"\\infty": 374,
+				"\\langle": 375,
+				"\\rangle": 376
+			}, l = {
+				162: "\\cent",
+				176: "\\degree",
+				8592: "\\leftarrow",
+				8594: "\\rightarrow",
+				8652: "\\rightleftharpoons",
+				8704: "\\forall",
+				8705: "\\complement",
+				8706: "\\partial",
+				8707: "\\exists",
+				8708: "\\nexists",
+				8709: "\\varnothing",
+				8710: "\\triangle",
+				8711: "\\nabla",
+				8712: "\\in",
+				8713: "\\notin",
+				8714: "\\in",
+				8715: "\\ni",
+				8716: "\\notni",
+				8717: "\\ni",
+				8718: "\\blacksquare",
+				8719: "\\sqcap",
+				8720: "\\amalg",
+				8721: "\\sigma",
+				8722: "-",
+				8723: "\\mp",
+				8724: "\\dotplus",
+				8725: "/",
+				8726: "\\setminus",
+				8727: "*",
+				8728: "\\circ",
+				8729: "\\bullet",
+				8730: "\\sqrt",
+				8731: null,
+				8732: null,
+				8733: "\\propto",
+				8734: "\\infty",
+				8735: "\\llcorner",
+				8736: "\\angle",
+				8737: "\\measuredangle",
+				8738: "\\sphericalangle",
+				8739: "\\divides",
+				8740: "\\notdivides",
+				8741: "\\parallel",
+				8742: "\\nparallel",
+				8743: "\\wedge",
+				8744: "\\vee",
+				8745: "\\cap",
+				8746: "\\cup",
+				8747: "\\int",
+				8748: "\\iint",
+				8749: "\\iiint",
+				8750: "\\oint",
+				8751: "\\oiint",
+				8752: "\\oiiint",
+				8753: null,
+				8754: null,
+				8755: null,
+				8756: "\\therefore",
+				8757: "\\because",
+				8758: "\\colon",
+				8759: null,
+				8760: null,
+				8761: null,
+				8762: null,
+				8763: null,
+				8764: "\\sim",
+				8765: "\\backsim",
+				8766: null,
+				8767: null,
+				8768: "\\wr",
+				8769: "\\nsim",
+				8770: "\\eqsim",
+				8771: "\\simeq",
+				8772: null,
+				8773: "\\cong",
+				8774: null,
+				8775: "\\ncong",
+				8776: "\\approx",
+				8777: null,
+				8778: "\\approxeq",
+				8779: null,
+				8780: null,
+				8781: "\\asymp",
+				8782: "\\Bumpeq",
+				8783: "\\bumpeq",
+				8784: "\\doteq",
+				8785: "\\doteqdot",
+				8786: "\\fallingdotseq",
+				8787: "\\risingdotseq",
+				8788: null,
+				8789: null,
+				8790: "\\eqcirc",
+				8791: "\\circeq",
+				8792: null,
+				8793: null,
+				8794: null,
+				8795: null,
+				8796: "\\triangleq",
+				8797: null,
+				8798: null,
+				8799: null,
+				8800: "\\ne",
+				8801: "\\equiv",
+				8802: null,
+				8803: null,
+				8804: "\\le",
+				8805: "\\ge",
+				8806: "\\leqq",
+				8807: "\\geqq",
+				8808: "\\lneqq",
+				8809: "\\gneqq",
+				8810: "\\ll",
+				8811: "\\gg",
+				8812: "\\between",
+				8813: null,
+				8814: "\\nless",
+				8815: "\\ngtr",
+				8816: "\\nleq",
+				8817: "\\ngeq",
+				8818: "\\lessim",
+				8819: "\\gtrsim",
+				8820: null,
+				8821: null,
+				8822: "\\lessgtr",
+				8823: "\\gtrless",
+				8824: null,
+				8825: null,
+				8826: "\\prec",
+				8827: "\\succ",
+				8828: "\\preccurlyeq",
+				8829: "\\succcurlyeq",
+				8830: "\\precsim",
+				8831: "\\succsim",
+				8832: "\\nprec",
+				8833: "\\nsucc",
+				8834: "\\subset",
+				8835: "\\supset",
+				8836: null,
+				8837: null,
+				8838: "\\subseteq",
+				8839: "\\supseteq",
+				8840: "\\nsubseteq",
+				8841: "\\nsupseteq",
+				8842: "\\subsetneq",
+				8843: "\\supsetneq",
+				8844: null,
+				8845: null,
+				8846: null,
+				8847: "\\sqsubset",
+				8848: "\\sqsupset",
+				8849: null,
+				8850: null,
+				8851: "\\sqcap",
+				8852: "\\sqcup",
+				8853: "\\oplus",
+				8854: "\\ominus",
+				8855: "\\otimes",
+				8856: "\\oslash",
+				8857: "\\odot",
+				8858: "\\circledcirc",
+				8859: "\\circledast",
+				8860: null,
+				8861: "\\circleddash",
+				8862: "\\boxplus",
+				8863: "\\boxminus",
+				8864: "\\boxtimes",
+				8865: "\\boxdot",
+				8866: "\\vdash",
+				8867: "\\dashv",
+				8868: "\\top",
+				8869: "\\bot",
+				8870: null,
+				8871: "\\models",
+				8872: "\\vDash",
+				8873: "\\Vdash",
+				8874: "\\Vvdash",
+				8875: "\\VDash*",
+				8876: "\\nvdash",
+				8877: "\\nvDash",
+				8878: "\\nVdash",
+				8879: "\\nVDash",
+				8880: null,
+				8881: null,
+				8882: "\\vartriangleleft",
+				8883: "\\vartriangleright",
+				8884: "\\trianglelefteq",
+				8885: "\\trianglerighteq",
+				8886: null,
+				8887: null,
+				8888: "\\multimap",
+				8889: null,
+				8890: "\\intercal",
+				8891: "\\veebar",
+				8892: "\\barwedge",
+				8893: null,
+				8894: null,
+				8895: null,
+				8896: "\\wedge",
+				8897: "\\vee",
+				8898: "\\cap",
+				8899: "\\cup",
+				8900: "\\diamond",
+				8901: "\\cdot",
+				8902: "\\star",
+				8903: null,
+				8904: "\\bowtie",
+				8905: "\\ltimes",
+				8906: "\\rtimes",
+				8907: "\\leftthreetimes",
+				8908: "\\rightthreetimes",
+				8909: "\\backsimeq",
+				8910: "\\curlyvee",
+				8911: "\\curlywedge",
+				8912: "\\Subset",
+				8913: "\\Supset",
+				8914: "\\Cap",
+				8915: "\\Cup",
+				8916: "\\pitchfork",
+				8917: "\\lessdot",
+				8918: "\\gtrdot",
+				8919: null,
+				8920: "\\lll",
+				8921: "\\ggg",
+				8922: "\\lesseqgtr",
+				8923: "\\gtreqless",
+				8924: null,
+				8925: null,
+				8926: "\\curlyeqprec",
+				8927: "\\curlyeqsucc",
+				8928: null,
+				8929: null,
+				8930: null,
+				8931: null,
+				8932: null,
+				8933: null,
+				8934: "\\lnsim",
+				8935: "\\gnsim",
+				8936: "\\precnsim",
+				8937: "\\succnsim",
+				8938: "\\ntriangleleft",
+				8939: "\\ntriangleright",
+				8940: "\\ntrianglelefteq",
+				8941: "\\ntrianglerighteq",
+				8942: "\\vdots",
+				8943: "\\cdots",
+				8944: null,
+				8945: "\\ddots",
+				8946: null,
+				8947: null,
+				8948: null,
+				8949: null,
+				8950: null,
+				8951: null,
+				8952: null,
+				8953: null,
+				8954: null,
+				8955: null,
+				8956: null,
+				8957: null,
+				8958: null,
+				8959: null,
+				10231: "\\longleftrightarrow",
+				945: "\\alpha",
+				946: "\\beta",
+				947: "\\gamma",
+				948: "\\delta",
+				949: "\\epsilon",
+				950: "\\zeta",
+				951: "\\eta",
+				952: "\\theta",
+				953: "\\iota",
+				954: "\\kappa",
+				955: "\\lambda",
+				956: "\\mu",
+				957: "\\nu",
+				958: "\\xi",
+				959: "o",
+				960: "\\pi",
+				961: "\\rho",
+				962: "\\varsigma",
+				963: "\\sigma",
+				964: "\\tau",
+				965: "\\upsilon",
+				966: "\\varphi",
+				967: "\\chi",
+				968: "\\psi",
+				969: "\\omega",
+				977: "\\vartheta",
+				981: "\\phi",
+				982: "\\varpi",
+				1009: "\\varrho",
+				1013: "\\epsilon",
+				913: "A",
+				914: "B",
+				915: "\\Gamma",
+				916: "\\Delta",
+				917: "E",
+				918: "Z",
+				919: "H",
+				920: "\\Theta",
+				921: "I",
+				922: "K",
+				923: "\\Lambda",
+				924: "M",
+				925: "N",
+				926: "\\Xi",
+				927: "O",
+				928: "\\Pi",
+				929: "P",
+				930: null,
+				931: "\\Sigma",
+				932: "T",
+				933: "\\Upsilon",
+				934: "\\Phi",
+				935: "X",
+				936: "\\Psi",
+				937: "\\Omega",
+				1013: "\\epsilon"
+			};
+			function u(e) {
+				return e >= 65 && e <= 90 || e >= 97 && e <= 122;
+			}
+			function m(e) {
+				e ||= {};
+				let t;
+				i = "";
+				let s;
+				for (; r < n.length;) {
+					let c;
+					switch (t = n.charCodeAt(r++), t === 55349 && (n.charCodeAt(r++) === 57030 ? t = 949 : K(!1, a(1004, [String.fromCharCode(t), t]))), t) {
+						case 32:
+						case 9:
+						case 10:
+						case 13:
+						case 160:
+						case 8203: continue;
+						case 38:
+							if (n.substring(r).indexOf("nbsp;") === 0) {
+								r += 5;
+								continue;
+							}
+							return 287;
+						case 92:
+							switch (i += String.fromCharCode(t), n.charCodeAt(r)) {
+								case 92: return r++, 286;
+								case 123: return r++, 371;
+								case 124: return r++, 124;
+								case 125: return r++, 372;
+							}
+							if (c = v(), c !== null) return c;
+							i = "";
+							continue;
+						case 42:
+						case 8727: return n.charCodeAt(r) === 42 ? (r++, 94) : 373;
+						case 45:
+						case 8722: return n.charCodeAt(r) === 62 ? (r++, 284) : 45;
+						case 47:
+						case 8725: return 47;
+						case 33: return n.charCodeAt(r) === 61 ? (r++, 301) : t;
+						case 58:
+						case 8758: return 58;
+						case 59: return 59;
+						case 37:
+						case 40:
+						case 41:
+						case 43:
+						case 44:
+						case 61:
+						case 63:
+						case 91:
+						case 93:
+						case 94:
+						case 95:
+						case 123:
+						case 124:
+						case 125: return i += String.fromCharCode(t), t;
+						case 36: return i += String.fromCharCode(t), 97;
+						case 39: return y(t);
+						case 60: return n.charCodeAt(r) === 61 ? (r++, 271) : 270;
+						case 62: return n.charCodeAt(r) === 61 ? (r++, 273) : 272;
+						default: return u(t) || t === 39 ? _(t) : (s = l[t]) ? (i = s, c = o[i], c === void 0 && (c = 97), c) : d(String.fromCharCode(t)) || p(t) ? e.oneCharToken ? (i += String.fromCharCode(t), 48) : g(t) : (K(!1, a(1004, [String.fromCharCode(t), t])), 0);
+					}
+				}
+				return 0;
+			}
+			let h;
+			function g(e) {
+				let t;
+				for (; p(e) || d(String.fromCharCode(e)) || (t = c(String.fromCharCode(e), h));) {
+					if (h = t || h, i += String.fromCharCode(e), e = n.charCodeAt(r++), e === 92 && n.charCodeAt(r) === 32 && (e = 32, r++), d(String.fromCharCode(e)) || (t = c(String.fromCharCode(e), h))) for (h = t || h, i += String.fromCharCode(e), e = n.charCodeAt(r++); e === 92 && (e = n.charCodeAt(r)) === 32 && r++ || f(e);) e = n.charCodeAt(r++);
+					e === 92 && n.charCodeAt(r) === 32 && (e = 32, r++);
+				}
+				return i === "." && (n.substring(r).indexOf("overline") === 0 || n.substring(r).indexOf("dot") === 0) && (i = "0."), r--, 48;
+			}
+			function _(e) {
+				let t = String.fromCharCode(e);
+				i += t;
+				let a = i, o = r + 1;
+				for (; (u(e) || e === 39) && (e = n.charCodeAt(r++), !(!u(e) || (t = String.fromCharCode(e), !s.some((e) => {
+					let n = a + t;
+					return e.indexOf(n) === 0;
+				}))));) a += t;
+				for (s.indexOf(a) >= 0 ? i = a : r = o; i.lastIndexOf("'") === i.length - 1 && e === 39;) i += String.fromCharCode(e), e = n.charCodeAt(r++);
+				return r--, 97;
+			}
+			function v() {
+				let a = n.charCodeAt(r++);
+				if (a === 36) i = String.fromCharCode(a);
+				else if (a === 37) i += String.fromCharCode(a);
+				else if ([
+					32,
+					58,
+					59,
+					44,
+					33
+				].indexOf(a) >= 0) i = "\\ ";
+				else {
+					for (; u(a);) i += String.fromCharCode(a), a = n.charCodeAt(r++);
+					i = i === "\\varepsilon" && "\\epsilon" || i, r--;
+				}
+				let s = o[i];
+				if (s === void 0) i === "\\emptyset" && (i = "\\varnothing"), s = 97;
+				else if (s === 368) {
+					for (a = n.charCodeAt(r++); a && a !== 123;) a = n.charCodeAt(r++);
+					for (i = "", a = n.charCodeAt(r++); a && a !== 125;) {
+						let e = String.fromCharCode(a);
+						e === "&" && n.substring(r).indexOf("nbsp;") === 0 ? r += 5 : e === " " || e === "	" || (i += e), a = n.charCodeAt(r++);
+					}
+					s = o[`\\${i}`], s === void 0 && (s = 368);
+				} else if (s === 269 || s === 295) {
+					for (a = n.charCodeAt(r++); a && a !== 123;) a = n.charCodeAt(r++);
+					i = "", a = n.charCodeAt(r++);
+					let o = e.option(t, "keepTextWhitespace");
+					for (; a && a !== 125;) {
+						let e = String.fromCharCode(a);
+						!o && e === "&" && n.substring(r).indexOf("nbsp;") === 0 ? r += 5 : !o && (e === " " || e === "	") || (i += e), a = n.charCodeAt(r++);
+					}
+					s !== 295 && (s = !i || e.option(t, "ignoreText") ? null : 269);
+				} else s === 374 && (s = 48);
+				return s;
+			}
+			function y(e) {
+				for (K(e === 39), i = "'"; n.charCodeAt(r) === 39;) r++, i += "'";
+				return 97;
+			}
+			return {
+				start: m,
+				lexeme() {
+					return i;
+				},
+				pos() {
+					return r;
+				}
+			};
+		}
+	};
+	return e;
+})(), Ze = Ye, J = Xe, Y = (e, t, n) => {
+	if (t === void 0 && (t = "failed!"), !e) {
+		let e = Error(t);
+		throw e.location = n || X.location, e;
+	}
+}, Qe = (e, t) => {
+	let n = X.messages[e];
+	return t && t.forEach((e, t) => {
+		n = n.replace(`%${t + 1}`, e);
+	}), `${e}: ${n}`;
+}, X = {
+	assert: Y,
+	message: Qe,
+	messages: {},
+	reserveCodeRange: (e, t, n) => {
+		Y(e <= t, "Invalid code range"), Y(X.reservedCodes.every((n) => t < n.first || e > n.last), "Conflicting request for error code range"), X.reservedCodes.push({
+			first: e,
+			last: t,
+			name: n
+		});
+	},
+	reservedCodes: [],
+	setLocation: (e) => {
+		X.location = e;
+	},
+	clearLocation: () => {
+		X.location = null;
+	},
+	checkTimeout: () => {
+		Y(!X.timeout || X.timeout > Date.now(), X.timeoutMessage);
+	},
+	setTimeout: (e, t) => {
+		e !== void 0 && (X.timeout = e ? Date.now() + e : 0, X.timeoutMessage = t || "ERROR timeout exceeded");
+	},
+	setCounter: (e, t) => {
+		X.count = e, X.countMessage = t || "ERROR count exceeded";
+	},
+	checkCounter: () => {
+		let { count: e } = X;
+		if (typeof e != "number" || Number.isNaN(e)) {
+			Y(!1, "ERROR counter not set");
+			return;
+		}
+		Y(X.count--, X.countMessage);
+	}
+}, $e = {
+	data: {},
+	words: {
+		"\\alpha": "\\alpha",
+		"\\beta": "\\beta",
+		"\\gamma": "\\gamma",
+		"\\delta": "\\delta",
+		"\\epsilon": "\\epsilon",
+		"\\zeta": "\\zeta",
+		"\\eta": "\\eta",
+		"\\theta": "\\theta",
+		"\\iota": "\\iota",
+		"\\kappa": "\\kappa",
+		"\\lambda": "\\lambda",
+		"\\mu": "\\mu",
+		"\\nu": "\\nu",
+		"\\xi": "\\xi",
+		"\\omicron": "\\omicron",
+		"\\pi": "\\pi",
+		"\\rho": "\\rho",
+		"\\sigma": "\\simga",
+		"\\tau": "\\tau",
+		"\\upsilon": "\\upsilon",
+		"\\phi": "\\phi",
+		"\\chi": "\\chi",
+		"\\psi": "\\psi",
+		"\\omega": "\\omega",
+		"\\Alpha": "\\Alpha",
+		"\\Beta": "\\Beta",
+		"\\Gamma": "\\Gamma",
+		"\\Delta": "\\Delta",
+		"\\Epsilon": "\\Epsilon",
+		"\\Zeta": "\\Zeta",
+		"\\Eta": "\\Eta",
+		"\\Theta": "\\Theta",
+		"\\Iota": "\\Iota",
+		"\\Kappa": "\\Kappa",
+		"\\Lambda": "\\Lambda",
+		"\\Mu": "\\Mu",
+		"\\Nu": "\\Nu",
+		"\\Xi": "\\Xi",
+		"\\Omicron": "\\Omicron",
+		"\\Pi": "\\Pi",
+		"\\Rho": "\\Rho",
+		"\\Sigma": "\\Simga",
+		"\\Tau": "\\Tau",
+		"\\Upsilon": "\\Upsilon",
+		"\\Phi": "\\Phi",
+		"\\Chi": "\\Chi",
+		"\\Psi": "\\Psi",
+		"\\Omega": "\\Omega",
+		"\\emptyset": "\\emptyset"
+	},
+	types: { numberPosNeg: [
+		"(\\type{numberPosNeg})",
+		"\\type{number}",
+		"-\\type{number}"
+	] },
+	rules: {
+		"\\left(?\\right]": ["\\left(%1\\right]"],
+		"\\left[?\\right)": ["\\left[%1\\right)"],
+		"\\left[?\\right]": ["\\left[%1\\right]"],
+		"\\left\\{?\\right\\}": ["\\left\\{%1\\right\\}"],
+		"?\\cup?": ["%1\\cup %2"],
+		"?\\cap?": ["%1\\cap %2"],
+		"?\\backslash?": ["%1\\backslash %2"],
+		"\\mathbb{?}": ["\\mathbb{%2}"],
+		"\\ln{?}": ["\\ln{%2}"],
+		"\\log{?}": ["\\log{%2}"],
+		"\\log_{?}{?}": ["\\log_{%1}{%2}"],
+		"\\type{matrix}": [{ "\\begin{bmatrix}%1\\end{bmatrix}": {
+			"\\type{row}": "%*\\\\",
+			"\\type{column}": "%*&"
+		} }],
+		"\\frac{d}{d?}?": ["\\frac{d}{d%2}{%1}"],
+		"\\frac{d^?}{d?^?}?": ["\\frac{d^%3}{d%2^%3}{%1}"],
+		"\\int_?^? ? d?": ["\\int_{%1}^{%2} %3 d%4"],
+		"\\int ? d?": ["\\int %1 d%2"],
+		"\\lim_? ?": [{ "\\lim_{%1}{%2}": {
+			"? \\rightarrow ?": "%1 \\rightarrow %2",
+			"? \\to ?": "%1 \\to %2",
+			"\\left(?,?\\right)": "\\left(%1, %2\\right)"
+		} }],
+		"\\sum_?^? ?": ["\\sum_{%1}^{%2}{%3}"],
+		"\\sin{?}": ["\\sin{%1}"],
+		"\\cos{?}": ["\\cos{%1}"],
+		"\\tan{?}": ["\\tan{%1}"],
+		"\\cot{?}": ["\\cot{%1}"],
+		"\\sec{?}": ["\\sec{%1}"],
+		"\\csc{?}": ["\\csc{%1}"],
+		"\\sin^{-1}?": ["\\sin^{-1}{%1}"],
+		"\\cos^{-1}{?}": ["\\cos^{-1}{%1}"],
+		"\\tan^{-1}{?}": ["\\tan^{-1}{%1}"],
+		"\\cot^{-1}{?}": ["\\cot^{-1}{%1}"],
+		"\\sec^{-1}{?}": ["\\sec^{-1}{%1}"],
+		"\\csc^{-1}{?}": ["\\csc^{-1}{%1}"],
+		"\\sinh{?}": ["\\sinh{%1}"],
+		"\\cosh{?}": ["\\cosh{%1}"],
+		"\\tanh{?}": ["\\tanh{%1}"],
+		"\\coth{?}": ["\\coth{%1}"],
+		"\\sech{?}": ["\\sech{%1}"],
+		"\\csch{?}": ["\\csch{%1}"],
+		"\\sinh^{-1}{?}": ["\\sinh^{-1}{%1}"],
+		"\\cosh^{-1}{?}": ["\\cosh^{-1}{%1}"],
+		"\\tanh^{-1}{?}": ["\\tanh^{-1}{%1}"],
+		"\\coth^{-1}{?}": ["\\coth^{-1}{%1}"],
+		"\\sech^{-1}{?}": ["\\sech^{-1}{%1}"],
+		"\\csch^{-1}{?}": ["\\csch^{-1}{%1}"],
+		"?<?": ["%1<%2"],
+		"?\\nless?": ["%1\\nless %2"],
+		"?\\le?": ["%1\\le %2"],
+		"?>?": ["%1>%2"],
+		"?\\ge?": ["%1\\ge %2"],
+		"?\\ngtr?": ["%1\\ngtr %2"],
+		"?=?": ["%1=%2"],
+		"?\\ne?": ["%1\\ne %2"],
+		"?\\approx?": ["%1\\approx %2"],
+		"\\infty": ["\\infty"],
+		"\\type{mixedNumber}": ["%1%2"],
+		"?%": ["{%1}%"],
+		"?!": ["{%1}!"],
+		"\\frac{?}{?}": ["\\frac{%1}{%2}"],
+		"\\abs{?}": ["\\abs{%1}"],
+		"?\\degree": ["{%1}\\degree"],
+		"\\type{fraction}^?": ["\\left(%1\\right)^{%2}"],
+		"{-?}^?": ["\\left(%1\\right)^{%2}"],
+		"?^?": ["{%1}^{%2}"],
+		"\\sqrt{?}": ["\\sqrt{%1}"],
+		"\\sqrt[?]{?}": ["\\sqrt[%2]{%1}"],
+		"-?": ["-%1"],
+		"?+{-?}": ["%1+\\left(%2\\right)"],
+		"?+?": ["%1+%2"],
+		"?-{-?}": ["%1-\\left(%2\\right)"],
+		"?-?": ["%1-%2"],
+		"?*{-?}": ["%1\\times\\left(%2\\right)"],
+		"?*?": ["%1\\times %2"],
+		"?\\cdot{-?}": ["%1\\cdot\\left(%2\\right)"],
+		"?\\cdot?": ["%1\\cdot %2"],
+		"?\\div?": ["%1\\div %2"],
+		"?:?": ["%1:%2"],
+		"?_?": ["%1_{%2}"],
+		"\\left(?\\right)": ["\\left(%1\\right)"],
+		"{\\type{numberPosNeg}}{\\type{numberPosNeg}}": ["(%1)(%2)"],
+		"? ?": ["%1 %2"],
+		"?,?": ["%1,%2"],
+		"?": ["%1"]
+	},
+	allowInterval: !0,
+	parsingIntegralExpr: !1,
+	RHS: !1
+};
+//#endregion
+//#region ../../node_modules/@graffiticode/translatex/src/core.js
+(function(e) {
+	function t(e, t) {
+		return {
+			op: e,
+			args: t
+		};
+	}
+	function n(e, t) {
+		return t.length > 1 ? {
+			op: e,
+			args: t
+		} : t[0];
+	}
+	let r = (e, t) => {
+		let n = e.indexOf("{"), r = (n > 0 && e.slice(0, n) || e).trim();
+		Y(t && t[r]);
+		let i = n > 0 && e.slice(n);
+		return r === "$fmt" ? { rawConfig: i } : i && JSON.parse(i) || {};
+	};
+	function i(e) {
+		function i(e, n, r, i) {
+			switch (Y(n.op && n.args, `Visitor.visit() op=${n.op} args = ${n.args}`), n.op) {
+				case J.NUM:
+					n = r.numeric(n, i);
+					break;
+				case J.ADD:
+				case J.SUB:
+				case J.PM:
+				case J.BACKSLASH:
+				case J.DIV:
+				case J.FRAC:
+				case J.BINOM:
+				case J.LOG:
+				case J.COLON:
+				case J.FUNC:
+				case J.TYPE:
+				case J.SUBSCRIPT:
+					n = n.args.length === 1 ? r.unary(n, i) : r.binary(n, i);
+					break;
+				case J.MUL:
+				case J.TIMES:
+				case J.COEFF:
+				case J.CDOT:
+					n = r.multiplicative(n, i);
+					break;
+				case J.POW:
+					n = r.exponential(n, i);
+					break;
+				case J.VAR:
+					n = r.variable(n, i);
+					break;
+				case J.SQRT:
+				case J.SIN:
+				case J.COS:
+				case J.TAN:
+				case J.SEC:
+				case J.CSC:
+				case J.COT:
+				case J.ARCSIN:
+				case J.ARCCOS:
+				case J.ARCTAN:
+				case J.ARCSEC:
+				case J.ARCCSC:
+				case J.ARCCOT:
+				case J.SINH:
+				case J.COSH:
+				case J.TANH:
+				case J.ARCSINH:
+				case J.ARCCOSH:
+				case J.ARCTANH:
+				case J.ARCSECH:
+				case J.ARCCSCH:
+				case J.ARCCOTH:
+				case J.SECH:
+				case J.CSCH:
+				case J.COTH:
+				case J.PERCENT:
+				case J.M:
+				case J.ABS:
+				case J.FACT:
+				case J.FORALL:
+				case J.EXISTS:
+				case J.IN:
+				case J.SUM:
+				case J.LIM:
+				case J.EXP:
+				case J.TO:
+				case J.DERIV:
+				case J.INTEGRAL:
+				case J.PROD:
+				case J.CUP:
+				case J.BIGCUP:
+				case J.CAP:
+				case J.BIGCAP:
+				case J.PIPE:
+				case J.ION:
+				case J.OVERLINE:
+				case J.OVERSET:
+				case J.UNDERSET:
+				case J.MATHBF:
+				case J.TEXT:
+				case J.NONE:
+				case J.DEGREE:
+				case J.DOT:
+				case J.MATHFIELD:
+				case J.SET:
+				case J.NOT:
+				case J.OPERATORNAME:
+					n = r.unary(n, i);
+					break;
+				case J.COMMA:
+				case J.MATRIX:
+				case J.VEC:
+				case J.ROW:
+				case J.COL:
+				case J.LIST:
+				case J.ANGLEBRACKET:
+					n = r.comma(n, i);
+					break;
+				case J.EQL:
+				case J.LT:
+				case J.LE:
+				case J.GT:
+				case J.GE:
+				case J.NE:
+				case J.NGTR:
+				case J.NLESS:
+				case J.NI:
+				case J.SUBSETEQ:
+				case J.SUPSETEQ:
+				case J.SUBSET:
+				case J.SUPSET:
+				case J.NNI:
+				case J.NSUBSETEQ:
+				case J.NSUPSETEQ:
+				case J.NSUBSET:
+				case J.NSUPSET:
+				case J.APPROX:
+				case J.IMPLIES:
+				case J.PERP:
+				case J.PROPTO:
+				case J.PARALLEL:
+				case J.NPARALLEL:
+				case J.SIM:
+				case J.CONG:
+				case J.CAPRIGHTARROW:
+				case J.RIGHTARROW:
+				case J.LEFTARROW:
+				case J.LONGRIGHTARROW:
+				case J.LONGLEFTARROW:
+				case J.OVERRIGHTARROW:
+				case J.OVERLEFTARROW:
+				case J.CAPLEFTRIGHTARROW:
+				case J.LEFTRIGHTARROW:
+				case J.LONGLEFTRIGHTARROW:
+				case J.OVERLEFTRIGHTARROW:
+					n = r.equals(n, i);
+					break;
+				case J.PAREN:
+				case J.BRACKET:
+				case J.BRACE:
+				case J.INTERVAL:
+				case J.INTERVALOPEN:
+				case J.INTERVALLEFTOPEN:
+				case J.INTERVALRIGHTOPEN:
+					n = r.paren(n);
+					break;
+				default: r.name !== "normalizeLiteral" && r.name !== "sort" && (n = t(J.VAR, [`INTERNAL ERROR Should not get here. Unhandled node operator ${n.op}`]));
+			}
+			return n;
+		}
+		function s(e, t) {
+			if (!t) return "";
+			let n = J.option(e, "words"), r;
+			return n && (r = n[t.toLowerCase()]), r || (r = t, r.charAt(0) === "\\" && (r = r.substring(1))), r;
+		}
+		function c(e) {
+			let t = [];
+			switch (e.op) {
+				case J.VAR:
+					t.push({ code: e.args[0] });
+					break;
+				case J.MUL:
+					{
+						let n = "", r;
+						e.args.forEach((e) => {
+							e.op === J.VAR ? n += e.args[0] : e.op === J.NUM && (r = +e.args[0]);
+						}), t.push({
+							code: n,
+							length: r
+						});
+					}
+					break;
+				case J.COMMA: e.args.forEach((e) => {
+					t = t.concat(c(e));
+				});
+			}
+			return t;
+		}
+		function l(e) {
+			let [t, n] = e.split("[");
+			return {
+				name: t,
+				arg: n && n.substring(0, n.indexOf("]")) || void 0
+			};
+		}
+		function u(e, t) {
+			return c(e).some((e) => {
+				let n = e.code, r = e.length;
+				switch (n) {
+					case "integer":
+						if (t.numberFormat === "integer" && (r === void 0 || r === t.args[0].length)) return !0;
+						break;
+					case "decimal":
+						if (t.numberFormat === "decimal" && t.isRepeating) return r === void 0;
+						if (t.numberFormat === "decimal" && (r === void 0 || r === 0 && t.args[0].indexOf(".") === -1 || r === t.args[0].substring(t.args[0].indexOf(".") + 1).length)) return !0;
+						break;
+					case "repeatingDecimal": return t.numberFormat === "decimal" && t.isRepeating ? (Y(!r, "The repeatingDecimal pattern does not take a length"), !0) : !1;
+					case "number":
+						if (t.numberFormat === "decimal" && t.isRepeating) return r === void 0;
+						if (t.numberFormat === "integer" || t.numberFormat === "decimal") {
+							let e = t.args[0].indexOf(".");
+							if (r === void 0 || r === 0 && e === -1 || e >= 0 && r === t.args[0].substring(e + 1).length) return !0;
+						}
+						break;
+					case "scientific":
+						if (t.isScientific) {
+							let e = t.args[0].args[0];
+							if (r === void 0 || r === 0 && e.indexOf(".") === -1 || r === e.substring(e.indexOf(".") + 1).length) return !0;
+						}
+						break;
+					case "fraction":
+						if (t.isFraction || t.isMixedNumber) return !0;
+						break;
+					case "simpleFraction":
+					case "nonMixedFraction":
+						if (t.isFraction) return !0;
+						break;
+					case "mixedFraction":
+					case "mixedNumber":
+						if (t.isMixedNumber) return !0;
+						break;
+					case "fractionOrDecimal":
+						if (t.isFraction || t.isMixedNumber || t.numberFormat === "decimal") return !0;
+						break;
+					default: Y(!1, Qe(2015, [n]));
+				}
+				return !1;
+			});
+		}
+		function d(e, t) {
+			return c(e).some((e) => {
+				switch (e.code) {
+					case "simpleSmallRowMatrix":
+					case "smallRowMatrix": return t.op === J.MATRIX && t.m === 1 && t.n < 4;
+					case "simpleSmallColumnMatrix":
+					case "smallColumnMatrix": return t.op === J.MATRIX && t.m < 4 && t.n === 1;
+					case "simpleSmallMatrix":
+					case "smallMatrix": return t.op === J.MATRIX && t.m < 4 && t.n < 4;
+					case "matrix": return t.op === J.MATRIX;
+					case "row": return t.op === J.ROW;
+					case "column": return t.op === J.COL;
+					default: return !1;
+				}
+			});
+		}
+		function f(e, t) {
+			let n = l(e), r = n.name, i = n.arg;
+			switch (r) {
+				case "polynomial":
+					if (i) {
+						if (i.indexOf(">") === 0) {
+							let e = parseInt(i.substring(1), 10);
+							return t.isPolynomial > e;
+						}
+						let e = parseInt(i, 10);
+						return t.isPolynomial > e;
+					}
+					return t.isPolynomial;
+				default: return !1;
+			}
+		}
+		function p(e) {
+			return e.op === J.NUM || e.op === J.VAR || typeof e == "string";
+		}
+		function m(e) {
+			return Y(e.op === J.MATRIX || e.op === J.ROW || e.op === J.COL), e.args.every((e) => e.op === J.MATRIX || e.op === J.ROW || e.op === J.COL ? m(e) : p(e));
+		}
+		function h(e, t, n) {
+			if (t.op === J.TYPE && t.args[0].op === J.VAR) {
+				let r = t.args[0].args[0];
+				switch (r = r.indexOf("[") > 0 && r.slice(0, r.indexOf("[")) || r, r) {
+					case "number":
+					case "integer":
+					case "decimal":
+					case "scientific":
+					case "fraction":
+					case "simpleFraction":
+					case "mixedFraction":
+					case "mixedNumber":
+					case "fractionOrDecimal":
+					case "repeatingDecimal": return u(t.args[0], n);
+					case "variable": return n.op === J.VAR;
+					case "simpleSmallRowMatrix":
+					case "simpleSmallColumnMatrix":
+					case "simpleSmallMatrix": return d(t.args[0], n) && m(n);
+					case "smallRowMatrix":
+					case "smallColumnMatrix":
+					case "smallMatrix":
+					case "matrix":
+					case "row":
+					case "column": return d(t.args[0], n);
+					case "polynomial": return f(t.args[0].args[0], n);
+					default: {
+						let t = J.option(e, "types")[r];
+						if (t) return Y(t instanceof Array), t.some((t) => g(e, [J.create(e, t)], n).length > 0);
+					}
+				}
+				return !1;
+			}
+			if (t.op === J.COLON && t.args[0].op === J.VAR && t.args[0].args[0] === "?") {
+				switch (Y(t.args[1].op === J.VAR), t.args[1].args[0]) {
+					case "N": return n.op === J.NUM;
+					case "V": return n.op === J.VAR;
+				}
+				return !1;
+			}
+			return t.op === J.VAR && t.args[0] === "?" || t.op === J.MATRIX && n.op === J.MATRIX;
+		}
+		function g(n, r, i) {
+			return r.size === 0 || i === void 0 ? !1 : r.filter((r) => {
+				if (r.op === void 0 || i.op === void 0) return !1;
+				if (e.intern(r) === e.intern(i) || h(n, r, i)) return !0;
+				if (r.op === i.op) {
+					if (r.args.length === i.args.length) return r.args.every((e, t) => r.op === J.VAR ? e.toLowerCase() === i.args[t].toLowerCase() : g(n, [e], i.args[t]).length === 1);
+					if (r.args.length < i.args.length) {
+						let e = i.args.slice(1);
+						if (r.args.length === 2) return g(n, [r.args[0]], i.args[0]).length > 0 && g(n, [r.args[1]], t(i.op, e)).length > 0;
+					}
+				}
+				return !1;
+			});
+		}
+		function _(e, n, r) {
+			let i = e;
+			return n.forEach((t, n) => {
+				e = e.replace(RegExp(`%${n + 1}`, "g"), t.args[0]);
+			}), n.length > 2 ? _(i, [t(J.VAR, [e])].concat(n.slice(2)), r) : e;
+		}
+		function v(e, n, i, a) {
+			i ||= {}, a ||= {};
+			let o = e.template;
+			if (n.length === 0 && n.push(t(J.VAR, [""])), o && o.indexOf("%OP") >= 0 && i.op && (o = o.replace(/* @__PURE__ */ RegExp("%OP", "g"), i.op)), o && n) {
+				o.indexOf("%%") >= 0 && (o = o.replace(/* @__PURE__ */ RegExp("%%", "g"), n[0].args[0]));
+				let t = o.indexOf("{"), s = (t > 0 && o.slice(0, t) || o).trim();
+				if (a[s]) {
+					let e = a[s].fn, t = e({
+						config: r(o, a),
+						env: i
+					}), c = [];
+					n.forEach((e) => {
+						c.push(e.args[0]);
+					}), o = t(c);
+				}
+				if (o.indexOf("%*") >= 0) {
+					let e = "";
+					n.forEach((t, r) => {
+						e !== "" && (e += " "), r === n.length - 1 && (o = o.slice(0, 2 * o.indexOf("%*") + 2)), e += o.replace("%*", t.args[0]).replace("%M", t.m).replace("%N", t.n);
+					}), o = e;
+				}
+				return o.indexOf("%IP") >= 0 && (o = o.replace(/* @__PURE__ */ RegExp("%IP", "g"), i.ip)), o.indexOf("%FP0") >= 0 && (o = o.replace(/* @__PURE__ */ RegExp("%FP0", "g"), i.fp)), o.indexOf("%FP") >= 0 && (o = o.replace(/* @__PURE__ */ RegExp("%FP", "g"), i.fp.split("").join(" "))), o.indexOf("%M") >= 0 && (Y(i.m), o = o.replace(/* @__PURE__ */ RegExp("%M", "g"), i.m)), o.indexOf("%N") >= 0 && (Y(i.n), o = o.replace(/* @__PURE__ */ RegExp("%N", "g"), i.n)), e.isBinary && n.length > 2 ? o = _(o, n, i) : n.forEach((e, t) => {
+					o = o.replace(RegExp(`%${t + 1}`, "g"), e ? e.args[0] : "");
+				}), {
+					op: J.VAR,
+					args: [o]
+				};
+			}
+			return n[0];
+		}
+		function y(e, t, n) {
+			let r = [];
+			return n.forEach((e) => {
+				r = r.concat(t[JSON.stringify(e)]);
+			}), r.length === 0 && r.push({ template: "" }), r[0];
+		}
+		function b(e, t) {
+			return Y(typeof t.template == "string"), t.template.indexOf("%%") >= 0 ? [e] : e.args;
+		}
+		function x(e) {
+			if (e.args.length <= 2) return e;
+			let t = e.args.pop();
+			return n(e.op, [x(e), t]);
+		}
+		function S(e) {
+			if (e.args.length <= 2) return e;
+			let t = e.args.shift();
+			return n(e.op, [t, S(e)]);
+		}
+		function C(e, n, r) {
+			r instanceof Array && (r = r.length === 1 ? r[0] : o(e, r[1], r[0]));
+			let c = r, l = Object.keys(r), u = [];
+			return l.forEach((e) => {
+				u.push(JSON.parse(e));
+			}), !n || !n.args ? (Y(!1, "Should not get here. Illformed node."), 0) : i(e, n, {
+				name: "translate",
+				numeric(t) {
+					let n = [{
+						op: J.VAR,
+						args: [s(e, t.args[0])]
+					}], i = e.env || {};
+					if (t.numberFormat === "decimal") {
+						let e = t.args[0].split(".");
+						i.ip = e[0], i.fp = e[1] || "0";
+					}
+					let a = g(e, u, t);
+					return a.length === 0 ? t : v(y(e, r, a, 1), n, i, e.expanderBuilders);
+				},
+				binary(t) {
+					t = t.op === J.SUBSCRIPT ? S(t) : x(t);
+					let n = g(e, u, t);
+					if (n.length === 0) return t;
+					let i = y(e, r, n, t.args.length), o = a(i), s = b(t, i), l = [];
+					return s.forEach((t, n) => {
+						let r = J.option(e, "RHS", n > 0);
+						l = l.concat(C(e, t, [c, o])), J.option(e, "RHS", r);
+					}), i.isBinary = !0, v(i, l, {
+						...e.env,
+						op: t.op
+					}, e.expanderBuilders);
+				},
+				multiplicative(t) {
+					t = x(t);
+					let n = g(e, u, t);
+					if (n.length === 0) return t;
+					let i = y(e, r, n, t.args.length), o = a(i, r), s = b(t, i), l = [];
+					return s.forEach((t, n) => {
+						let r = J.option(e, "RHS", n > 0);
+						l = l.concat(C(e, t, [c, o])), J.option(e, "RHS", r);
+					}), i.isBinary = !0, v(i, l, {
+						...e.env,
+						op: t.op
+					}, e.expanderBuilders);
+				},
+				unary(t) {
+					let n = g(e, u, t);
+					if (n.length === 0) return t;
+					let i = y(e, r, n, t.args.length), o = a(i, r), s = b(t, i), l = [];
+					return s.forEach((t) => {
+						l = l.concat(C(e, t, [c, o]));
+					}), v(i, l, {
+						...e.env,
+						op: t.op
+					}, e.expanderBuilders);
+				},
+				exponential(t) {
+					let n = g(e, u, t);
+					if (n.length === 0) return t;
+					let i = y(e, r, n, t.args.length), o = a(i, r), s = b(t, i), l = [];
+					return s.forEach((t) => {
+						l = l.concat(C(e, t, [c, o]));
+					}), v(i, l, e.env, e.expanderBuilders);
+				},
+				variable(n) {
+					let i = g(e, u, n);
+					if (i.length === 0) return n;
+					let o = y(e, r, i, n.args.length), l = a(o, r), d = b(n, o), f = [];
+					return f.push(t(J.VAR, [s(e, d.shift())])), d.forEach((t) => {
+						f = f.concat(C(e, t, [c, l]));
+					}), v(o, f, e.env, e.expanderBuilders);
+				},
+				comma(t) {
+					let n = e.env || {};
+					if (t.op === J.MATRIX || t.op === J.ROW || t.op === J.COL) {
+						t.op === J.MATRIX ? (Y(t.args[0].op === J.ROW), Y(t.args[0].args[0].op === J.COL), t.m = n.m = t.args[0].args.length, t.n = n.n = t.args[0].args[0].args.length, t.args.forEach((e, t) => {
+							e.m = t + 1;
+						})) : t.op === J.ROW ? t.args.forEach((e, t) => {
+							e.m = t + 1, e.n = void 0;
+						}) : t.args.forEach((e, n) => {
+							e.m = t.m, e.n = n + 1;
+						});
+						let i = g(e, u, t);
+						if (i.length === 0) return t;
+						let o = y(e, r, i, t.args.length), s = [], l = a(o, r);
+						return b(t, o).forEach((t, n) => {
+							s = s.concat(C(e, t, [c, l])), s[n].m = t.m, s[n].n = t.n;
+						}), v(o, s, n, e.expanderBuilders);
+					}
+					let i = g(e, u, t);
+					if (i.length === 0) return t;
+					let o = y(e, r, i, t.args.length), s = a(o, r), l = b(t, o), d = [];
+					return l.forEach((t) => {
+						d = d.concat(C(e, t, [c, s]));
+					}), o.isBinary = !0, v(o, d, n, e.expanderBuilders);
+				},
+				equals(t) {
+					let n = g(e, u, t);
+					if (n.length === 0) return t;
+					let i = y(e, r, n, t.args.length), o = a(i, r), s = b(t, i), l = [];
+					return s.forEach((t) => {
+						l = l.concat(C(e, t, [c, o]));
+					}), i.isBinary = !0, v(i, l, e.env, e.expanderBuilders);
+				},
+				paren(t) {
+					let n = g(e, u, t);
+					if (n.length === 0) return t;
+					let i = y(e, r, n, 1), o = a(i, r), s = b(t, i), l = [];
+					return s.forEach((t) => {
+						l.push(C(e, t, [c, o]));
+					}), v(i, l, e.env, e.expanderBuilders);
+				}
+			});
+		}
+		this.translate = C;
+	}
+	function a(e) {
+		return e.rules;
+	}
+	function o(e, t, n) {
+		let r = {};
+		if (t) {
+			if (t instanceof Array) {
+				let n = {};
+				t.some((t) => t.context ? (t.context && t.context.split(" ") || []).some((r) => e[r] ? (n = t.value, !0) : !1) : (n = t, !0)), t = n;
+			}
+			Object.keys(t).forEach((e) => {
+				r[e] = t[e];
+			});
+		}
+		let i = Object.keys(n), a;
+		return i.forEach((e) => {
+			Number.isNaN(parseInt(e, 10)) ? a = n : (a = n[e], e = Object.keys(a)[0]), r[e] || (r[e] = a[e]);
+		}), r;
+	}
+	function s(e) {
+		let t, n = e.indexOf("\\context");
+		if (n >= 0) {
+			e = e.slice(n + 8);
+			let r = e.indexOf("}");
+			t = e.slice(1, r), e = e.slice(r + 1);
+		}
+		return {
+			context: t,
+			template: e
+		};
+	}
+	function c(e, t) {
+		let n;
+		if (t instanceof Array) Y(t.length === 1), n = c(e, t[0]);
+		else if (typeof t == "string") n = s(t);
+		else {
+			let r = "", i = Object.keys(t);
+			Y(i.length === 1);
+			let a = i[0], o = t[a], s;
+			o instanceof Array ? (s = [], o.forEach((t) => {
+				t.options ? (r += t.options.RHS ? " RHS" : "", r += t.options.EndRoot ? " EndRoot" : "", r += t.options.NoParens ? " NoParens" : "", s.push({
+					context: r,
+					value: l(e, t.value)
+				})) : s.push(l(e, t));
+			})) : s = l(e, o), n = {
+				template: a,
+				rules: s
+			};
+		}
+		return n;
+	}
+	function l(e, t) {
+		let n = {};
+		return Object.keys(t).forEach((r) => {
+			let i = JSON.stringify(J.create(e, r)), a = c(e, t[r]);
+			n[i] ? n[i].push(a) : n[i] = [a];
+		}), n;
+	}
+	function u(t, n, r) {
+		let a = new i(e), o = l(t, r);
+		return a.translate(t, n, o);
+	}
+	function d(e) {
+		let t = 0, n = "";
+		for (; t < e.length; t++) switch (e.charAt(t)) {
+			case " ":
+			case "	":
+			case "\n":
+				if (n.length === 0 || n.charAt(n.length - 1) === " ") continue;
+				n += " ";
+				break;
+			default: n += e.charAt(t);
+		}
+		for (; n.charAt(n.length - 1) === " ";) n = n.substring(0, n.length - 1);
+		for (; n.lastIndexOf("baseline") !== -1 && n.lastIndexOf(" baseline") === n.length - 9;) n = n.substring(0, n.length - 9);
+		return n;
+	}
+	J.fn.translate = function(e, n) {
+		let r = u(n, e, J.option(n, "rules"));
+		return (!r || r.op !== J.VAR) && (r = t(J.VAR, [""])), d(r.args[0]);
+	}, J.option = function(e, t, n) {
+		Y(e);
+		let r = e && e[t];
+		if (n !== void 0 && (J.options = e ||= {}, e[t] = n), r === void 0) switch (t) {
+			case "field":
+				r = "integer";
+				break;
+			case "decimalPlaces":
+				r = 10;
+				break;
+			case "toleranceAbsolute":
+			case "tolerancePercent":
+			case "toleranceRange":
+			case "setThousandsSeparator":
+			case "setDecimalSeparator":
+			case "dontExpandPowers":
+			case "dontFactorDenominators":
+			case "dontFactorTerms":
+			case "dontConvertDecimalToFraction":
+			case "strict":
+			case "antiderivative":
+				r = void 0;
+				break;
+			case "types":
+				r = {};
+				break;
+			default: r = !1;
+		}
+		return r;
+	};
+})(new Ze());
+var et = function() {
+	X.reserveCodeRange(4e3, 4999, "core");
+	let e = X.messages, t = X.message, n = X.assert;
+	e[4001] = "No Math Core spec provided.", e[4002] = "No Math Core solution provided.", e[4003] = "No Math Core spec value provided.", e[4004] = "Invalid Math Core spec method '%1'.", e[4005] = "Operation taking too long.", e[4006] = "Invalid option name '%1'.", e[4007] = "Invalid option value '%2' for option '%1'.", e[4008] = "Internal error: %1";
+	let r = {
+		ROUND: {},
+		SUM: {},
+		MUL: {},
+		IF: {},
+		matrix: {},
+		pmatrix: {},
+		bmatrix: {},
+		Bmatrix: {},
+		vmatrix: {},
+		Vmatrix: {},
+		array: {},
+		"\\alpha": { type: "var" },
+		"\\beta": { type: "var" },
+		"\\gamma": { type: "var" },
+		"\\delta": { type: "var" },
+		"\\epsilon": { type: "var" },
+		"\\zeta": { type: "var" },
+		"\\eta": { type: "var" },
+		"\\theta": { type: "var" },
+		"\\iota": { type: "var" },
+		"\\kappa": { type: "var" },
+		"\\lambda": { type: "var" },
+		"\\mu": {
+			type: "const",
+			value: 10 ** -6
+		},
+		"\\nu": { type: "var" },
+		"\\xi": { type: "var" },
+		"\\pi": {
+			type: "const",
+			value: Math.PI
+		},
+		"\\rho": { type: "var" },
+		"\\sigma": { type: "var" },
+		"\\tau": { type: "var" },
+		"\\upsilon": { type: "var" },
+		"\\phi": { type: "var" },
+		"\\chi": { type: "var" },
+		"\\psi": { type: "var" },
+		"\\omega": { type: "var" },
+		"\\sin": { type: "var" },
+		"\\cos": { type: "var" },
+		"\\tan": { type: "var" },
+		"\\sec": { type: "var" },
+		"\\csc": { type: "var" },
+		"\\cot": { type: "var" },
+		"\\arcsin": { type: "var" },
+		"\\arccos": { type: "var" },
+		"\\arctan": { type: "var" },
+		"\\arcsec": { type: "var" },
+		"\\arccsc": { type: "var" },
+		"\\arccot": { type: "var" },
+		"\\sinh": { type: "var" },
+		"\\cosh": { type: "var" },
+		"\\tanh": { type: "var" },
+		"\\sech": { type: "var" },
+		"\\csch": { type: "var" },
+		"\\coth": { type: "var" },
+		"\\log": { type: "var" },
+		"\\ln": { type: "var" },
+		"\\lg": { type: "var" }
+	};
+	function i(e, r) {
+		switch (e) {
+			case "field":
+				switch (r) {
+					case void 0:
+					case "integer":
+					case "real":
+					case "complex": break;
+					default: n(!1, t(4007, [e, r]));
+				}
+				break;
+			case "decimalPlaces":
+				if (r === void 0 || +r >= 0 && +r <= 20) break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "toleranceAbsolute":
+				if (r === void 0 || +r >= 0 || typeof r == "string") break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "tolerancePercent":
+				if (r === void 0 || +r >= 0) break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "toleranceRange":
+				if (r === void 0 || r instanceof Array && r.length === 2) break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "antiderivative":
+				if (r === void 0 || typeof r == "string") break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "RHS":
+			case "NoParens":
+			case "EndRoot":
+			case "allowDecimal":
+			case "allowInterval":
+			case "dontExpandPowers":
+			case "dontFactorDenominators":
+			case "dontFactorTerms":
+			case "dontConvertDecimalToFraction":
+			case "dontSimplifyImaginary":
+			case "ignoreOrder":
+			case "inverseResult":
+			case "requireThousandsSeparator":
+			case "ignoreText":
+			case "ignoreTrailingZeros":
+			case "allowThousandsSeparator":
+			case "compareSides":
+			case "ignoreCoefficientOne":
+			case "strict":
+			case "integrationConstant":
+			case "absoluteValue":
+			case "parsingIntegralExpr":
+			case "keepTextWhitespace":
+				if (r === void 0 || typeof r == "boolean") break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "setThousandsSeparator":
+				if (r === void 0 || typeof r == "string" && r.length === 1 || r instanceof Array) break;
+				n(!1, t(4007, [e, r]));
+				break;
+			case "setDecimalSeparator":
+				if (r === void 0 || typeof r == "string" && r.length === 1 || r instanceof Array && r.length > 0 && r[0].length === 1) break;
+				n(!1, t(4007, [e, JSON.stringify(r)]));
+				break;
+			case "words":
+			case "rules":
+			case "types":
+			case "data":
+			case "env":
+			case "expanderBuilders":
+				if (r === void 0 || typeof r == "object") break;
+				n(!1, t(4007, [e, r]));
+				break;
+			default: n(!1, t(4006, [e]));
+		}
+	}
+	function a(e) {
+		e && Object.keys(e).forEach((t) => {
+			i(t, e[t]);
+		});
+	}
+	function o(e, t, n) {
+		e ||= {}, e.rules || (e.words = $e.words, e.rules = $e.rules, e.types = $e.types);
+		let r = {
+			method: "translate",
+			options: e
+		};
+		e.allowInterval = !0, d(r).evaluate(t, (e, t) => {
+			n(e, t);
+		});
+	}
+	let s = null;
+	function c(e) {
+		s = typeof e == "function" ? e : null;
+	}
+	function l(e) {
+		s && s(e());
+	}
+	function u(e, t) {
+		return e ||= {}, e.rules || (e.words = $e.words, e.rules = $e.rules, e.types = $e.types), e.expanderBuilders = t || {}, e.allowInterval = !0, function(t, n) {
+			d({
+				method: "translate",
+				options: e
+			}).evaluate(t, (e, t) => {
+				n(e, t);
+			});
+		};
+	}
+	function d(e) {
+		let i, o = e.method, s = e.value, c = J.options = e.options, u = c.words ? Object.fromEntries(Object.keys(c.words).flatMap((e) => [[e.toLowerCase(), { type: "var" }], [e.toUpperCase(), { type: "var" }]])) : {}, d;
+		try {
+			X.setLocation("spec"), a(c), J.pushEnv({
+				...r,
+				...u,
+				...c.env
+			}), i = s === void 0 ? void 0 : J.create(c, s, "spec"), J.popEnv();
+		} catch (e) {
+			d = e;
+		}
+		return {
+			evaluate: function(e, i) {
+				try {
+					if (d) throw d;
+					X.setLocation("user"), n(e !== void 0, t(4002)), J.pushEnv({
+						...r,
+						...u,
+						...c.env
+					});
+					let a = J.create(c, e, "user");
+					n(a, t(4008, ["invalid input"])), X.setLocation("spec");
+					let s;
+					switch (o) {
+						case "translate":
+							s = a.translate(c);
+							break;
+						default: n(!1, t(4004, [o]));
+					}
+					J.popEnv(), i([], s);
+				} catch (e) {
+					l(() => `ERROR evaluate() ${e.stack}`);
+					let t = e.message;
+					i([{
+						result: null,
+						errorCode: f(e),
+						message: m(t),
+						stack: e.stack,
+						location: e.location,
+						toString() {
+							return `${this.errorCode}: (${this.location}) ${this.message}\n${this.stack}`;
+						}
+					}], "");
+				}
+			},
+			model: i
+		};
+		function f(e) {
+			return e && typeof e.errorCode == "number" ? e.errorCode : p(e && e.message);
+		}
+		function p(e) {
+			e = typeof e == "string" && e || "";
+			let t = +e.slice(0, e.indexOf(":"));
+			return Number.isNaN(t) ? 0 : t;
+		}
+		function m(e) {
+			return p(e) ? e.slice(e.indexOf(":") + 2) : e;
+		}
+	}
+	return {
+		translate: o,
+		buildTranslator: u,
+		setLogger: c
+	};
+}();
+typeof window < "u" && (window.Core = et);
+//#endregion
+//#region ../../node_modules/@graffiticode/translatex/src/spreadsheetExpanders.js
+var tt = (e, t) => Array.from({ length: t.charCodeAt(0) - e.charCodeAt(0) + 1 }, (t, n) => String.fromCharCode(e.charCodeAt(0) + n)), nt = (e, t) => {
+	let n = +e, r = +t;
+	return Array.from({ length: r - n + 1 }, (e, t) => String(n + t));
+}, Z = (e) => {
+	try {
+		return new G(e) !== null;
+	} catch {
+		return !1;
+	}
+}, rt = (e) => [e.slice(0, 1), e.slice(1)], it = (e) => e.toUpperCase() >= "A" && e.toUpperCase() <= "Z", at = (e) => /^-?\d+$/.test(e), ot = (e) => rt(e).reduce((e, t, n) => n === 0 && it(t) || at(t), !1), st = (e = ",") => (t = {}, n, r) => {
+	if (r === 0) return { start: rt(n) };
+	let i = t.start, a = rt(n), o = tt(i[0], a[0]), s = nt(i[1], a[1]);
+	return o.flatMap((e) => s.map((t) => e.toUpperCase() + t)).filter((e) => e !== void 0).join(e);
+}, ct = (e) => e, lt = () => (e = [], t) => [...e, t.toUpperCase()], ut = (e) => {
+	let t = {
+		currency: "",
+		thousandsSeparator: ",",
+		decimalSeparator: ".",
+		decimalPlaces: 0,
+		prefix: "",
+		suffix: "",
+		showThousands: !1,
+		accountingStyle: !1,
+		isPercent: !1
+	};
+	e.startsWith("(") && e.endsWith(")") && (t.accountingStyle = !0, e = e.slice(1, -1));
+	let n = [
+		"$",
+		"€",
+		"¥",
+		"£",
+		"₹",
+		"₽",
+		"¢"
+	], r = e;
+	n.some((e) => r.startsWith(e) ? (t.currency = e, t.prefix = e, r = r.slice(1), !0) : !1), t.currency || n.some((e) => r.includes(`_${e}`) ? (t.currency = e, t.suffix = e, r = r.replace(`_${e}`, ""), !0) : !1), r.includes("%") && (t.isPercent = !0, t.suffix += "%", r = r.replace(/%/g, "")), (r.includes("#,##0") || r.includes("#.##0") || r.includes("# ##0")) && (t.showThousands = !0, r.includes("#,##0.") ? (t.thousandsSeparator = ",", t.decimalSeparator = ".") : r.includes("#.##0,") ? (t.thousandsSeparator = ".", t.decimalSeparator = ",") : r.includes("# ##0,") ? (t.thousandsSeparator = " ", t.decimalSeparator = ",") : r.includes("# ##0.") || r.includes("# ##0") ? (t.thousandsSeparator = " ", t.decimalSeparator = ".") : r.includes("#.##0") && (t.thousandsSeparator = ".", t.decimalSeparator = ","));
+	let i = r.match(/[.,]0+$/);
+	return i && (t.decimalPlaces = i[0].length - 1), t;
+}, dt = (e, t) => {
+	let n = Number(e);
+	if (Number.isNaN(n)) return e;
+	let { thousandsSeparator: r, decimalSeparator: i, decimalPlaces: a, prefix: o, suffix: s, showThousands: c, accountingStyle: l, isPercent: u } = t, d = u ? Number(new G(String(e)).times(100)) : n, f = d < 0, p = Math.abs(d).toFixed(a);
+	if (i !== "." && (p = p.replace(".", i)), c) {
+		let e = p.split(i), t = e[0], n = e[1] || "", a = t.replace(/\B(?=(\d{3})+(?!\d))/g, r);
+		p = n ? `${a}${i}${n}` : a;
+	}
+	return p = `${o}${p}${s}`, l && f ? `(${p})` : f ? `-${p}` : p;
+}, ft = (e, t = 2) => dt(e, {
+	currency: "$",
+	thousandsSeparator: ",",
+	decimalSeparator: ".",
+	decimalPlaces: t,
+	prefix: "$",
+	suffix: "",
+	showThousands: !0
+}), pt = (e) => {
+	let t = [
+		"m/",
+		"d/",
+		"y",
+		"mmm",
+		"mmmm",
+		"ddd",
+		"dddd"
+	], n = e.toLowerCase();
+	return t.some((e) => n.includes(e));
+}, mt = (e) => {
+	if (e instanceof Date) return Number.isNaN(e.getTime()) ? null : e;
+	let t = Number(e);
+	if (!Number.isNaN(t)) {
+		if (t >= 0 && t < 2957004) {
+			let e = Math.floor(t), n = new Date(Date.UTC(1904, 0, 1));
+			return new Date(n.getTime() + e * 24 * 60 * 60 * 1e3);
+		}
+		if (t > 2957004) return new Date(t);
+	}
+	let n = new Date(e);
+	return Number.isNaN(n.getTime()) ? null : n;
+}, ht = (e, t) => {
+	if (!e || !(e instanceof Date) || Number.isNaN(e.getTime())) return String(e || "");
+	let n = (e, t = 2) => String(e).padStart(t, "0"), r = {
+		yyyy: String(e.getFullYear()),
+		yy: n(e.getFullYear() % 100),
+		mmmm: [
+			"January",
+			"February",
+			"March",
+			"April",
+			"May",
+			"June",
+			"July",
+			"August",
+			"September",
+			"October",
+			"November",
+			"December"
+		][e.getMonth()],
+		mmm: [
+			"Jan",
+			"Feb",
+			"Mar",
+			"Apr",
+			"May",
+			"Jun",
+			"Jul",
+			"Aug",
+			"Sep",
+			"Oct",
+			"Nov",
+			"Dec"
+		][e.getMonth()],
+		mm: n(e.getMonth() + 1),
+		m: String(e.getMonth() + 1),
+		dd: n(e.getDate()),
+		d: String(e.getDate())
+	}, i = "", a = 0;
+	for (; a < t.length;) {
+		let e = !1;
+		Object.keys(r).sort((e, t) => t.length - e.length).some((n) => t.substring(a, a + n.length).toLowerCase() === n && (i += r[n], a += n.length, e = !0, !0)), e || (i += t[a], a++);
+	}
+	return i;
+}, gt = ({ env: e, args: t }) => {
+	let n = t[1] || e.format || "", r;
+	if (n.toLowerCase() === "currency") r = ft(t[0]);
+	else if (n.includes("#") || n.includes("0")) {
+		let e = ut(n);
+		r = dt(t[0], e);
+	} else if (pt(n)) {
+		let e = mt(t[0]);
+		r = e ? ht(e, n) : t[0];
+	} else r = t[0];
+	return r;
+}, Q = ({ env: e, str: t }) => ot(t) && e[t.toUpperCase()]?.val || t, _t = (e) => {
+	if (e == null || e === "") return !1;
+	if (typeof e == "string") {
+		let t = e.trim();
+		if (t === "" || t === "0" || t.toUpperCase() === "FALSE") return !1;
+	}
+	return typeof e == "number" || e instanceof G ? +e != 0 : !0;
+}, $ = {
+	round: (e) => (t = "", n, r) => {
+		let i = Q({
+			env: e,
+			str: n
+		});
+		if (Z(i)) {
+			if (r === 0) return new G(i);
+			if (r === 1) return new G(t).toDecimalPlaces(+i, G.ROUND_HALF_UP);
+		}
+		return t;
+	},
+	sum: (e) => (t = 0, n) => {
+		let r = Q({
+			env: e,
+			str: n
+		});
+		return Z(r) ? new G(t).plus(new G(r)) : t;
+	},
+	minus: (e) => (t = "", n, r) => {
+		let i = Q({
+			env: e,
+			str: n
+		});
+		return Z(i) ? r === 0 ? new G(i) : new G(t).minus(new G(i)) : t;
+	},
+	multiply: (e) => (t = 1, n) => {
+		let r = Q({
+			env: e,
+			str: n
+		});
+		return Z(r) ? new G(t).times(new G(r)) : t;
+	},
+	mul: (e) => (t = 1, n) => {
+		let r = Q({
+			env: e,
+			str: n
+		});
+		return Z(r) ? new G(t).times(new G(r)) : t;
+	},
+	divide: (e) => (t = "", n, r) => {
+		let i = Q({
+			env: e,
+			str: n
+		});
+		return Z(i) ? r === 0 ? new G(i) : new G(t).dividedBy(new G(i)) : t;
+	},
+	normalize: lt,
+	range: st,
+	if: (e) => (t = null, n, r) => (n = Q({
+		env: e,
+		str: n
+	}), r === 0 ? {
+		condition: _t(n),
+		trueValue: null,
+		falseValue: null
+	} : r === 1 ? {
+		...t,
+		trueValue: n
+	} : r === 2 ? t.condition ? t.trueValue : n : t),
+	average: (e) => {
+		let t = new G(0), n = 0;
+		return (r, i) => (i = Q({
+			env: e,
+			str: i
+		}), Z(i) && (t = t.plus(new G(i)), n++), n > 0 ? t.dividedBy(n) : new G(0));
+	}
+}, vt = (e, t, n) => {
+	let r = Q({
+		env: e,
+		str: t[0]
+	}), i = Q({
+		env: e,
+		str: t[1]
+	}), a;
+	if (Z(r) && Z(i)) a = new G(r).comparedTo(new G(i));
+	else {
+		let e = String(r), t = String(i);
+		a = e === t ? 0 : e < t ? -1 : 1;
+	}
+	return String(n(a));
+}, yt = (e) => ({
+	type: "fn",
+	fn: ({ env: t }) => ((n) => vt(t, n, e))
+}), bt = {
+	$cell: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => e[t[1].toUpperCase()]?.val || "0")
+	},
+	$fmt: {
+		type: "fn",
+		fn: ({ config: e, env: t }) => ((n) => {
+			if (e.rawConfig) {
+				let r = e.rawConfig.slice(1, -1);
+				if (r.includes("isNegative:true")) {
+					let e = t.format?.formatString || t.format || "";
+					n = [`-${n[0]}`, e];
+				} else if (r.includes("isNegative:false")) {
+					let e = t.format?.formatString || t.format || "";
+					n = [n[0], e];
+				} else {
+					let e = r.indexOf(",");
+					if (e >= 0) {
+						let t = r.slice(0, e), i = r.slice(e + 1);
+						t = t.replace("%1", n[0]), n = [t, i];
+					}
+				}
+			} else if (n.length === 1) {
+				let e = t.format?.formatString || t.format || "";
+				n = [n[0], e];
+			}
+			return gt({
+				env: t,
+				args: n
+			});
+		})
+	},
+	$range: {
+		type: "fn",
+		fn: ({ config: e }) => ((t) => t.reduce($.range(e && e.sep === "list" ? "" : ","), void 0))
+	},
+	$add: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => `${t.reduce($.sum(e), void 0)}`)
+	},
+	$minus: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => (t.length === 1 && t.unshift("0"), `${t.reduce($.minus(e), void 0)}`))
+	},
+	$multiply: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => `${t.reduce($.multiply(e), void 0)}`)
+	},
+	$percent: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => (t.push("0.01"), `${t.reduce($.multiply(e), void 0)}`))
+	},
+	$divide: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => `${t.reduce($.divide(e), void 0)}`)
+	},
+	$gt: yt((e) => e > 0),
+	$lt: yt((e) => e < 0),
+	$ge: yt((e) => e >= 0),
+	$le: yt((e) => e <= 0),
+	$eq: yt((e) => e === 0),
+	$ne: yt((e) => e !== 0),
+	$argsep: {
+		type: "fn",
+		fn: () => ((e) => e.join(""))
+	},
+	$call: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => {
+			let n = String(t[0]).toLowerCase(), r = String(t[1] === void 0 ? "" : t[1]).split(""), i = $[n];
+			return i ? `${r.reduce(i(e), void 0)}` : `${t[0]}${r.join("")}`;
+		})
+	},
+	$fn: {
+		type: "fn",
+		fn: ({ env: e }) => ((t) => `${t[1].split(",").reduce($[t[0].toLowerCase()](e), void 0)}`)
+	},
+	$normalize: {
+		type: "fn",
+		fn: ({ config: e, env: t }) => ((n) => `${n.reduce(ct($.normalize(t)), e?.acc)}`)
+	}
+}, xt = (e) => {
+	let t = String(e ?? "");
+	return t.includes("") ? t.split("").join(", ") : null;
+}, St = et, Ct = { rules: {
+	"??": ["%1%2"],
+	"-\\type{number}": [{ "%1": { "\\type{number}": "$fmt{isNegative:true}" } }],
+	"\\type{number}": ["$fmt{isNegative:false}"],
+	"?": ["%1"]
+} }, wt = {
+	types: {
+		cellName: ["\\type{variable}\\type{integer}"],
+		cellRange: ["\\type{cellName}:\\type{cellName}"],
+		fn: [
+			"average",
+			"if",
+			"mul",
+			"power",
+			"round",
+			"sum"
+		]
+	},
+	rules: {
+		"=\\type{cellName}": ["$cell"],
+		"=?": [{ "%2": {
+			"\\type{cellRange}": "%1:%2",
+			"\\type{fn}(\\type{cellRange})": "$normalize",
+			"?+?": "$normalize {\"acc\": [\"SUM\"]}",
+			"?-?": "$normalize {\"acc\": [\"SUB\"]}",
+			"?*?": "$normalize {\"acc\": [\"MUL\"]}",
+			"?/?": "$normalize {\"acc\": [\"DIV\"]}",
+			"?%": "$percent",
+			"-?": "$minus"
+		} }],
+		"\\type{cellRange}": ["$range"],
+		"\\type{cellName}": ["%1%2"],
+		"\\type{fn}(\\type{cellRange})": ["%1(%2)"],
+		"??": ["%1%2"],
+		"?": ["%1"]
+	}
+}, Tt = {
+	UNKNOWN_FUNCTION: 4100,
+	WRONG_ARITY: 4101,
+	BAD_ARGUMENT: 4102,
+	UNRESOLVED: 4103,
+	DIVIDE_BY_ZERO: 4104
+}, Et = {
+	[Tt.UNKNOWN_FUNCTION]: "#NAME!",
+	[Tt.WRONG_ARITY]: "#N/A",
+	[Tt.BAD_ARGUMENT]: "#VALUE!",
+	[Tt.UNRESOLVED]: "#NAME!",
+	[Tt.DIVIDE_BY_ZERO]: "#DIV/0!"
+};
+function Dt(e) {
+	return Et[e] || null;
+}
+function Ot(e, t) {
+	let n = /* @__PURE__ */ Error(`${e}: ${t}`);
+	return n.errorCode = e, n;
+}
+function kt(e, t, n) {
+	if (!Z(n)) throw Ot(Tt.BAD_ARGUMENT, `argument ${t + 1} of ${e} is not a number: ${JSON.stringify(String(n))}`);
+	return new G(n);
+}
+var At = [
+	{
+		name: "SUM",
+		minArgs: 1,
+		maxArgs: Infinity,
+		reduce: $.sum
+	},
+	{
+		name: "AVERAGE",
+		minArgs: 1,
+		maxArgs: Infinity,
+		reduce: $.average
+	},
+	{
+		name: "MUL",
+		minArgs: 1,
+		maxArgs: Infinity,
+		reduce: $.mul
+	},
+	{
+		name: "ROUND",
+		minArgs: 1,
+		maxArgs: 2,
+		reduce: $.round
+	},
+	{
+		name: "IF",
+		minArgs: 3,
+		maxArgs: 3,
+		reduce: $.if
+	}
+], jt = {
+	"+": "SUM",
+	"-": "MINUS",
+	"*": "MULTIPLY",
+	"/": "DIVIDE",
+	"%": "PERCENT"
+}, Mt = [
+	{
+		name: "MINUS",
+		minArgs: 1,
+		maxArgs: Infinity,
+		operatorOnly: !0,
+		reduce: $.minus
+	},
+	{
+		name: "MULTIPLY",
+		minArgs: 1,
+		maxArgs: Infinity,
+		operatorOnly: !0,
+		reduce: $.multiply
+	},
+	{
+		name: "DIVIDE",
+		minArgs: 1,
+		maxArgs: Infinity,
+		operatorOnly: !0,
+		reduce: $.divide
+	},
+	{
+		name: "PERCENT",
+		minArgs: 1,
+		maxArgs: Infinity,
+		operatorOnly: !0,
+		reduce: $.multiply
+	}
+], Nt = {
+	getCellValue: (e, t) => Q({
+		env: t,
+		str: e
+	}),
+	isValidDecimal: Z,
+	evaluateCondition: _t,
+	toDecimal: kt,
+	fail: (e, t) => {
+		throw Ot(e, t);
+	},
+	Decimal: G
+}, Pt = { eval: {
+	"=\\type{cellName}": ["$cell"],
+	"=?": [{ "%2": {
+		"\\type{fn}(\\type{args})": "$call",
+		"\\type{fn}(?,?)": "$call",
+		"\\type{fn}(?)": "$call",
+		"?>=?": "$ge",
+		"?<=?": "$le",
+		"?!=?": "$ne",
+		"?>?": "$gt",
+		"?<?": "$lt",
+		"?=?": "$eq",
+		"?+?": "$add",
+		"?-?": "$minus",
+		"?*?": "$multiply",
+		"?/?": "$divide",
+		"?%": "$percent",
+		"-?": "$minus"
+	} }],
+	"-?": ["-%1"],
+	"\\type{cellRange}": ["$range{\"sep\":\"list\"}"],
+	"\\type{args}": ["$argsep"],
+	"\\type{cellName}": ["%1%2"],
+	"\\type{fn}(\\type{cellRange})": ["%1(%2)"],
+	"??": ["%1%2"],
+	"?": ["%1"]
+} }, Ft = {
+	args: ["\\type{cellName}:\\type{cellName}", "?,?"],
+	cellName: ["\\type{variable}\\type{integer}"],
+	cellRange: ["\\type{cellName}:\\type{cellName}"]
+};
+function It(e) {
+	let t = /* @__PURE__ */ new Map();
+	for (let n of [
+		...At,
+		...Mt,
+		...e || []
+	]) n && n.name && t.set(String(n.name).toUpperCase(), {
+		minArgs: 1,
+		maxArgs: Infinity,
+		...n,
+		name: String(n.name).toUpperCase()
+	});
+	return t;
+}
+function Lt(e, t, n, r) {
+	if (r && (t.length < e.minArgs || t.length > e.maxArgs)) {
+		let n;
+		throw n = e.maxArgs === Infinity ? `at least ${e.minArgs}` : e.minArgs === e.maxArgs ? `${e.minArgs}` : `${e.minArgs} to ${e.maxArgs}`, Ot(Tt.WRONG_ARITY, `${e.name} expects ${n} arguments, got ${t.length}`);
+	}
+	return e.apply ? String(e.apply({
+		args: t,
+		env: n,
+		helpers: {
+			...Nt,
+			getCellValue: (e) => Q({
+				env: n,
+				str: e
+			})
+		}
+	})) : `${t.reduce(e.reduce(n), void 0)}`;
+}
+function Rt(e = {}) {
+	let { functions: t = [], operators: n = jt, patterns: r = Pt, strict: i = !1 } = e, a = It(t), o = [...a.values()].filter((e) => !e.operatorOnly).map((e) => e.name.toLowerCase()).sort(), s = Object.fromEntries(o.map((e) => [e, e])), c = {
+		...Ft,
+		fn: o
+	}, l = (e, t, n) => {
+		let r = a.get(String(e).toUpperCase());
+		if (!r) {
+			if (i) throw Ot(Tt.UNKNOWN_FUNCTION, `unknown function ${String(e).toUpperCase()}`);
+			return `${e}${t.join("")}`;
+		}
+		return Lt(r, t, n, i);
+	}, u = (e, t) => ({
+		type: "fn",
+		fn: ({ env: r }) => ((i) => {
+			let a = t ? t([...i]) : [...i];
+			return l(n[e], a, r);
+		})
+	});
+	return {
+		expanders: {
+			...bt,
+			$call: {
+				type: "fn",
+				fn: ({ env: e }) => ((t) => l(t[0], String(t[1] === void 0 ? "" : t[1]).split(""), e))
+			},
+			$add: u("+"),
+			$minus: u("-", (e) => e.length === 1 ? ["0", ...e] : e),
+			$multiply: u("*"),
+			$divide: u("/"),
+			$percent: u("%", (e) => [...e, "0.01"])
+		},
+		rules: { evalRules: {
+			words: s,
+			types: c,
+			rules: r.eval
+		} },
+		functions: [...a.values()],
+		helpers: Nt,
+		strict: i,
+		checkResult(e) {
+			let t = xt(e);
+			return t ? Ot(Tt.UNRESOLVED, `unresolved expression: ${t}`) : null;
+		}
+	};
+}
+//#endregion
+//#region src/scoring/normalize.ts
+var zt = (e) => [
+	"\"",
+	"'",
+	"`"
+].includes(e), Bt = (e) => (typeof e != "string" && (e = e == null ? "" : String(e)), e && e.split("").reduce((e, t) => ({
+	inString: zt(t) ? !e.inString : e.inString,
+	text: e.text + (e.inString && t || t.toUpperCase())
+}), {
+	inString: !1,
+	text: ""
+}).text || e), Vt = (e) => {
+	if (typeof e != "string" || e.indexOf("$") < 0) return e;
+	let t = "", n = "";
+	for (let r = 0; r < e.length; r++) {
+		let i = e[r];
+		if (n) i === n && (n = "");
+		else if (zt(i)) n = i;
+		else if (i === "$" && (/^[A-Za-z]+\$?[0-9]/.test(e.slice(r + 1)) || /[A-Za-z]/.test(e[r - 1] || "") && /[0-9]/.test(e[r + 1] || ""))) continue;
+		t += i;
+	}
+	return t;
+}, Ht = (e) => {
+	if (!e || typeof e != "string") return !1;
+	let t = e.trim();
+	return !isNaN(Number(t)) && !isNaN(parseFloat(t));
+}, Ut = (e) => {
+	if (!e || typeof e != "string") return !1;
+	let t = e.trim();
+	return [
+		/^\d{1,2}\/\d{1,2}\/\d{2,4}$/,
+		/^\d{1,2}-\d{1,2}-\d{2,4}$/,
+		/^\d{4}-\d{1,2}-\d{1,2}$/,
+		/^\d{1,2}\/\d{1,2}$/,
+		/^\d{1,2}-\d{1,2}$/
+	].some((e) => e.test(t)) && !isNaN(Date.parse(t));
+}, Wt = (e) => (typeof e != "string" && (e = e == null ? "" : String(e)), !e || e.length === 0 || e.indexOf("=") === 0 || e.trim().startsWith("\\text{") && e.trim().endsWith("}") || e.includes("\\") || Ht(e) || Ut(e) ? e : `\\text{${e}}`), Gt = (e) => {
+	if (!e || typeof e != "string") return null;
+	let t = e.trim();
+	if (!t || /%\s+\S/.test(t) || /^[\d,.$€£¥₹₽-]+\s+[a-zA-Z]{4,}/.test(t)) return null;
+	let n = t;
+	[
+		"$",
+		"€",
+		"£",
+		"¥",
+		"₹",
+		"₽",
+		"R$",
+		"C$",
+		"A$",
+		"NZ$",
+		"HK$",
+		"S$"
+	].forEach((e) => {
+		let n = e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+		t = t.replace(new RegExp(n, "g"), "");
+	});
+	let r = t.includes("%");
+	t = t.replace(/%/g, "");
+	let i = /^\s*\([^)]+\)\s*$/.test(n) && /\d/.test(n);
+	i && (t = t.replace(/[()]/g, "")), t = t.replace(/\s/g, "");
+	let a = t.startsWith("-");
+	a && (t = t.substring(1));
+	let o = (t.match(/,/g) || []).length, s = (t.match(/\./g) || []).length, c = t.lastIndexOf(","), l = t.lastIndexOf("."), u;
+	if (u = o === 0 && s === 0 || o === 0 && s === 1 ? t : o === 1 && s === 0 ? t.substring(c + 1).length === 3 && t.length > 4 ? t.replace(/,/g, "") : t.replace(",", ".") : c > l ? t.replace(/\./g, "").replace(",", ".") : t.replace(/,/g, ""), !Ht(u)) return null;
+	let d = parseFloat(u);
+	return (a || i) && (d = -Math.abs(d)), r && (d /= 100), d;
+}, Kt = (e) => {
+	let t = new Date(1904, 0, 1);
+	return Math.floor((e.getTime() - t.getTime()) / 864e5) + 1;
+}, qt = (e) => {
+	if (!e || typeof e != "string") return null;
+	let t = e.trim();
+	if (!t) return null;
+	let n = /* @__PURE__ */ new Date(), r = t.toLowerCase();
+	if (r === "today") return Kt(new Date(n.getFullYear(), n.getMonth(), n.getDate()));
+	if (r === "tomorrow") {
+		let e = new Date(n);
+		return e.setDate(n.getDate() + 1), Kt(new Date(e.getFullYear(), e.getMonth(), e.getDate()));
+	}
+	if (r === "yesterday") {
+		let e = new Date(n);
+		return e.setDate(n.getDate() - 1), Kt(new Date(e.getFullYear(), e.getMonth(), e.getDate()));
+	}
+	if (/^-?\d+(\.\d+)?$/.test(t) || /^[$€£¥₹₽]?\s*-?\d{1,3}([,.]?\d{3})*([,.]\d+)?$|^-?\d{1,3}([,.]?\d{3})*([,.]\d+)?\s*[$€£¥₹₽%]?$/.test(t)) return null;
+	if (/^[\dA-Za-z\s/\-.,:T]+$/.test(t)) {
+		let e = Date.parse(t);
+		if (!isNaN(e)) return Kt(new Date(e));
+	}
+	let i = t.match(/^(\d{1,2})[/\-.](\d{1,2})[/\-.](\d{4})$/);
+	if (i) {
+		let e = parseInt(i[1], 10), t = parseInt(i[2], 10), n = parseInt(i[3], 10);
+		if (e >= 1 && e <= 12 && t >= 1 && t <= 31) return Kt(new Date(n, e - 1, t));
+	}
+	let a = t.match(/^(\d{1,2})[/\-.](\d{1,2})[/\-.](\d{4})$/);
+	if (a) {
+		let e = parseInt(a[1], 10), t = parseInt(a[2], 10), n = parseInt(a[3], 10);
+		if (t >= 1 && t <= 12 && e >= 1 && e <= 31 && e > 12) return Kt(new Date(n, t - 1, e));
+	}
+	let o = t.match(/^(\d{1,2})[/-](\d{1,2})$/);
+	if (o) {
+		let e = parseInt(o[1], 10), t = parseInt(o[2], 10);
+		if (e >= 1 && e <= 12 && t >= 1 && t <= 31) return Kt(new Date(n.getFullYear(), e - 1, t));
+	}
+	let s = t.match(/^(\d{4})-(\d{1,2})-(\d{1,2})$/);
+	if (s) {
+		let e = parseInt(s[1], 10), t = parseInt(s[2], 10), n = parseInt(s[3], 10);
+		if (t >= 1 && t <= 12 && n >= 1 && n <= 31) return Kt(new Date(e, t - 1, n));
+	}
+	return null;
+}, Jt = Rt({ functions: [{
+	name: "POWER",
+	minArgs: 2,
+	maxArgs: 2,
+	apply: ({ args: e, helpers: t }) => {
+		let [n, r] = e.map((e) => t.getCellValue(e));
+		try {
+			let e = t.toDecimal("POWER", 0, n).pow(t.toDecimal("POWER", 1, r));
+			return e.isFinite() ? `${e}` : "#NUM!";
+		} catch {
+			return "#NUM!";
+		}
+	}
+}] }), Yt = Jt.expanders, Xt = Jt.rules.evalRules, Zt = 9e8, Qt = "EMPTY", $t = /[-+*/^%&]/, en = (e) => {
+	let t = {}, n, r = 0;
+	return typeof e != "string" || e.indexOf("\"") < 0 ? {
+		text: e,
+		env: t,
+		error: n,
+		decode: (e) => e
+	} : {
+		text: e.replace(/"((?:[^"]|"")*)"/g, (i, a, o) => {
+			let s = a.replace(/""/g, "\""), c = e.slice(0, o).trimEnd().slice(-1), l = e.slice(o + i.length).trimStart().charAt(0);
+			($t.test(c) || $t.test(l)) && (s.trim() === "" || isNaN(Number(s))) && (n ??= `Text used as a number: ${i}`);
+			let u = `Z${Zt + r++}`;
+			return t[u] = {
+				val: s === "" ? Qt : s,
+				type: "text"
+			}, u;
+		}),
+		env: t,
+		error: n,
+		decode: (e) => typeof e == "string" && e.indexOf(Qt) >= 0 ? e.split(Qt).join("") : e
+	};
+}, tn = new Set(Xt.types.fn.map((e) => e.toUpperCase())), nn = (e) => e === "\"" || e === "'" || e === "`", rn = (e, t) => {
+	let n = 0, r = !1;
+	for (let i = t; i < e.length; i++) {
+		let t = e[i];
+		if (nn(t)) {
+			r = !r;
+			continue;
+		}
+		if (!r) {
+			if (t === "(") n++;
+			else if (t === ")" && --n === 0) return i;
+		}
+	}
+	return -1;
+}, an = (e) => {
+	if (e.indexOf("<>") < 0) return e;
+	let t = "", n = "";
+	for (let r = 0; r < e.length; r++) {
+		let i = e[r];
+		if (n) i === n && (n = "");
+		else if (nn(i)) n = i;
+		else if (i === "<" && e[r + 1] === ">") {
+			t += "!=", r++;
+			continue;
+		}
+		t += i;
+	}
+	return t;
+}, on = /[A-Z0-9_.:]/, sn = /[=(,<>+\-*/^&!]/, cn = (e, t) => {
+	let n = t;
+	for (; n >= 0 && e[n] === " ";) n--;
+	for (; n >= 0 && e[n] === "%";) for (n--; n >= 0 && e[n] === " ";) n--;
+	if (e[n] === ")") {
+		let t = 0;
+		for (; n >= 0; n--) if (e[n] === ")") t++;
+		else if (e[n] === "(" && --t === 0) break;
+		for (n--; n >= 0 && on.test(e[n]);) n--;
+	} else if (nn(e[n])) {
+		let t = e[n];
+		for (n--; n >= 0 && e[n] !== t;) n--;
+		n--;
+	} else for (; n >= 0 && on.test(e[n]);) n--;
+	let r = n + 1;
+	for (;;) {
+		let t = r - 1;
+		for (; t >= 0 && e[t] === " ";) t--;
+		if (t < 1 || e[t] !== "-" && e[t] !== "+") break;
+		let n = t - 1;
+		for (; n >= 0 && e[n] === " ";) n--;
+		if (n >= 0 && !sn.test(e[n])) break;
+		r = t;
+	}
+	return r;
+}, ln = (e, t) => {
+	let n = t;
+	for (; n < e.length && (e[n] === " " || e[n] === "-" || e[n] === "+");) n++;
+	if (nn(e[n])) {
+		let t = e[n];
+		for (n++; n < e.length && e[n] !== t;) n++;
+		n++;
+	} else {
+		for (; n < e.length && on.test(e[n]);) n++;
+		let t = n;
+		for (; t < e.length && e[t] === " ";) t++;
+		if (e[t] === "(") {
+			let r = rn(e, t);
+			n = r < 0 ? e.length : r + 1;
+		}
+	}
+	let r = n;
+	for (; r < e.length && (e[r] === " " || e[r] === "%");) r++;
+	return e[r - 1] === "%" ? r : n;
+}, un = (e) => {
+	let t = "";
+	for (let n = 0; n < e.length; n++) {
+		let r = e[n];
+		if (t) r === t && (t = "");
+		else if (nn(r)) t = r;
+		else if (r === "^") return n;
+	}
+	return -1;
+}, dn = (e) => {
+	for (let t = un(e); t > 0; t = un(e)) {
+		let n = cn(e, t - 1), r = ln(e, t + 1), i = e.slice(n, t).trim(), a = e.slice(t + 1, r).trim();
+		if (!i || !a) break;
+		e = `${e.slice(0, n)}POWER(${i},${a})${e.slice(r)}`;
+	}
+	return e;
+}, fn = (e) => {
+	let t = dn(an(Bt(Vt(e))));
+	if (!t || t.indexOf("=") !== 0 || !/[*/]/.test(t)) return t;
+	let n = (e) => {
+		for (; e < t.length && t[e] === " ";) e++;
+		return t[e] || "";
+	}, r = (e) => e === "*" || e === "/", i = /* @__PURE__ */ new Map(), a = "", o = !1, s = "";
+	for (let e = 0; e < t.length; e++) {
+		let c = t[e];
+		if (nn(c)) {
+			o = !o, a += c, s = c;
+			continue;
+		}
+		if (o) {
+			a += c;
+			continue;
+		}
+		if (/[A-Z]/.test(c) && (s === "" || !/[A-Z0-9_]/.test(s))) {
+			let o = e;
+			for (; o < t.length && /[A-Z0-9_]/.test(t[o]);) o++;
+			let c = o;
+			for (; c < t.length && t[c] === " ";) c++;
+			if (t[c] === "(" && tn.has(t.slice(e, o))) {
+				let e = rn(t, c);
+				e >= 0 && (r(s) || r(n(e + 1))) && (a += "(", i.set(e, (i.get(e) || 0) + 1));
+			}
+		}
+		a += c, c === ")" && (a += ")".repeat(i.get(e) || 0)), c !== " " && (s = c);
+	}
+	return a;
+};
+//#endregion
+//#region src/scoring/sheets.ts
+function pn(e) {
+	let t = e.indexOf("!");
+	return t < 0 ? [void 0, e] : [e.slice(0, t), e.slice(t + 1)];
+}
+var mn = (e, t) => `${e}!${t}`;
+function hn(e, t) {
+	return Object.keys(t || {}).reduce((n, r) => (n[mn(e, r)] = t[r], n), {});
+}
+function gn(e, t) {
+	let n = {};
+	for (let r of Object.keys(e || {})) {
+		let [i, a] = pn(r);
+		i === t && (n[a] = e[r]);
+	}
+	return n;
+}
+function _n(e, t) {
+	let n = {};
+	for (let e of t) n[e] = {};
+	for (let r of Object.keys(e || {})) {
+		let [i, a] = pn(r), o = i ?? t[0];
+		n[o] || (n[o] = {}), n[o][a] = e[r];
+	}
+	return n;
+}
+//#endregion
+//#region src/scoring/score.ts
+var vn = () => ({
+	normalized: /* @__PURE__ */ new Map(),
+	expected: /* @__PURE__ */ new Map()
+}), yn = (e, t) => {
+	if (typeof e == "number" || e == null) return [e];
+	let n = String(e), r = t && t.get(n);
+	if (r) return r;
+	let i = [n];
+	try {
+		let e = {
+			keepTextWhitespace: !0,
+			...wt
+		};
+		if (n && n.length > 0) {
+			let t = n.indexOf("=") === 0 ? Bt(Vt(n)) : Wt(n);
+			St.buildTranslator(e, Yt)(t, (e, t) => {
+				e && e.length && console.error(e), i = n.indexOf("=") === 0 ? t.split(",") : [t];
+			});
+		}
+	} catch (e) {
+		console.log("parse error: " + e.stack);
+	}
+	return t && t.set(n, i), i;
+}, bn = (e, t, n) => {
+	let r = yn(e, n), i = yn(t, n);
+	return r.length === i.length && r.every((e, t) => e === i[t]);
+}, xn = (e, t, n, r) => n && r && n !== r ? !1 : e !== void 0 && e === t, Sn = (e, t, n) => {
+	if (!e || !e.startsWith("=") || !t) return e;
+	let r = n && n.expected.get(e);
+	if (r !== void 0) return r;
+	let i = n && n.env;
+	if (!i) {
+		i = {};
+		for (let [e, n] of Object.entries(t)) i[e] = {
+			...n,
+			val: n.val || n.text
+		};
+		n && (n.env = i);
+	}
+	let a = en(e);
+	if (a.error) return n && n.expected.set(e, "#VALUE!"), "#VALUE!";
+	let o = {
+		keepTextWhitespace: !0,
+		env: a.text === e ? i : {
+			...i,
+			...a.env
+		},
+		...Xt
+	}, s = fn(a.text), c = St.buildTranslator(o, Yt), l = e;
+	return c(s, (e, t) => {
+		(!e || !e.length) && (l = String(a.decode(t)));
+	}), n && n.expected.set(e, l), l;
+}, Cn = ({ method: e, expected: t, points: n = 1 }, { val: r, formula: i, type: a } = {
+	val: void 0,
+	formula: void 0,
+	type: void 0
+}, o = void 0, s = void 0) => {
+	if (e === "value") {
+		let e = t;
+		typeof t == "string" && t.startsWith("=") && (e = Sn(t, o, s));
+		let i = "text", c = e;
+		if (e != null) {
+			let t = String(e), n = qt(t);
+			if (n) i = "date", c = String(n);
+			else {
+				let e = Gt(t);
+				e !== null && (i = "number", c = String(e));
+			}
+		}
+		if (xn(r, c, a, i)) return {
+			points: n,
+			isValid: !0
+		};
+	} else if (e === "formula" && bn(i, t, s && s.normalized)) return {
+		points: n,
+		isValid: !0
+	};
+	return {
+		points: 0,
+		isValid: !1
+	};
+}, wn = (e) => e.text || e.val, Tn = (e) => e?.text || e?.attrs?.assess?.expected, En = ({ cells: e, primaryColumn: t }) => {
+	let n = Object.keys(e).sort((e, t) => +e.slice(1) - t.slice(1)).map((e) => e.slice(0, 1) === t && e || null).filter((e) => e !== null).map((t) => wn(e[t]) || null), r = /* @__PURE__ */ new Set();
+	return n.map((e) => r.has(e) ? null : (r.add(e), e)).filter((e) => e !== null);
+}, Dn = ({ cells: e, region: t }) => {
+	let { primaryColumn: n, rows: r } = t, i = En({
+		cells: e,
+		primaryColumn: n
+	}), a = new Map(r.map((e) => [Tn(e[n]), e]));
+	return i.map((e) => e === null ? null : a.get(e) || null);
+}, On = ({ cells: e, region: t }) => {
+	let n = t?.order === "actual" && Dn({
+		cells: e,
+		region: t
+	}) || t?.rows || [];
+	if (!t) throw Error("getCellsValidationFromRegionValidation() missing region value");
+	return n.reduce((e, t, n) => (n = t?.id || n + 1, t && Object.keys(t).forEach((r) => t[r]?.assess && (e[r + n] = t[r])), e), {}) || {};
+}, kn = ({ cells: e, validation: t }) => {
+	let n = t.regions || t.ranges;
+	return [{
+		region: n[Object.keys(n).find((e) => e)] || {},
+		cells: e
+	}];
+}, An = /* @__PURE__ */ new WeakMap(), jn = (e) => Object.values(e?.regions || e?.ranges || {}).some((e) => e?.order === "actual"), Mn = ({ cells: e, validation: t }) => {
+	let n = () => kn({
+		cells: e,
+		validation: t
+	}).map((e) => On(e))[0];
+	if (!t || typeof t != "object") return n();
+	let r = An.get(t);
+	if (r || An.set(t, r = {}), !jn(t)) return r.plain === void 0 && (r.plain = n()), r.plain;
+	if (!e || typeof e != "object") return n();
+	r.byCells || (r.byCells = /* @__PURE__ */ new WeakMap());
+	let i = r.byCells.get(e);
+	return i === void 0 && r.byCells.set(e, i = n()), i;
+}, Nn = (e) => {
+	let t = e?.sheets ? Object.keys(e.sheets) : null;
+	return t && t.length ? t : null;
+}, Pn = (e, t, n) => {
+	if (!e) return;
+	let r = _n(e, n);
+	return Object.keys(r[t] || {}).length ? r[t] : e;
+}, Fn = ({ cells: e, validation: t }) => {
+	let n = Nn(t);
+	if (!n) return Mn({
+		cells: e,
+		validation: t
+	});
+	let r = _n(e || {}, n);
+	return n.reduce((e, n) => Object.assign(e, hn(n, Mn({
+		cells: r[n],
+		validation: t.sheets[n]
+	}))), {});
+}, In = ({ cells: e, validation: t, interactionCells: n = void 0 }) => {
+	let r = vn(), i = Nn(t);
+	if (!i) return Ln(e, Mn({
+		cells: e,
+		validation: t
+	}), n, r);
+	let a = _n(e || {}, i);
+	return i.reduce((e, o) => {
+		let s = Mn({
+			cells: a[o],
+			validation: t.sheets[o]
+		}), c = {
+			normalized: r.normalized,
+			expected: /* @__PURE__ */ new Map()
+		}, l = Ln(a[o], s, Pn(n, o, i), c);
+		return Object.assign(e, hn(o, l));
+	}, {});
+};
+function Ln(e, t, n, r) {
+	let i = { ...e };
+	for (let e of Object.keys(t)) {
+		let a = i[e];
+		i[e] = a && {
+			...a,
+			score: Cn(t[e].assess, a, n, r)
+		} || void 0;
+	}
+	return i;
+}
+//#endregion
+export { St as C, Ct as S, Gt as _, hn as a, Wt as b, _n as c, Xt as d, Yt as f, qt as g, Ht as h, In as i, pn as l, Ut as m, Fn as n, mn as o, fn as p, Cn as r, gn as s, Sn as t, en as u, Vt as v, Dt as x, Bt as y };
+
+//# sourceMappingURL=scoring-D1FbQ_qt.js.map