@graffiticode/l0179-view 0.1.0

package/dist/index-3_WJgYM5.js

@@ -0,0 +1,4501 @@
+/*!
+ *  decimal.js v10.6.0
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+var Ht = 9e15, bt = 1e9, ns = "0123456789abcdef", un = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", fn = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", ss = {
+  // These values must be integers within the stated ranges (inclusive).
+  // Most of these values can be changed at run-time using the `Decimal.config` method.
+  // The maximum number of significant digits of the result of a calculation or base conversion.
+  // E.g. `Decimal.config({ precision: 20 });`
+  precision: 20,
+  // 1 to MAX_DIGITS
+  // The rounding mode used when rounding to `precision`.
+  //
+  // ROUND_UP         0 Away from zero.
+  // ROUND_DOWN       1 Towards zero.
+  // ROUND_CEIL       2 Towards +Infinity.
+  // ROUND_FLOOR      3 Towards -Infinity.
+  // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+  // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+  // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+  // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+  // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+  //
+  // E.g.
+  // `Decimal.rounding = 4;`
+  // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+  rounding: 4,
+  // 0 to 8
+  // The modulo mode used when calculating the modulus: a mod n.
+  // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+  // The remainder (r) is calculated as: r = a - n * q.
+  //
+  // UP         0 The remainder is positive if the dividend is negative, else is negative.
+  // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+  // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+  // HALF_EVEN  6 The IEEE 754 remainder function.
+  // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+  //
+  // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+  // division (9) are commonly used for the modulus operation. The other rounding modes can also
+  // be used, but they may not give useful results.
+  modulo: 1,
+  // 0 to 9
+  // The exponent value at and beneath which `toString` returns exponential notation.
+  // JavaScript numbers: -7
+  toExpNeg: -7,
+  // 0 to -EXP_LIMIT
+  // The exponent value at and above which `toString` returns exponential notation.
+  // JavaScript numbers: 21
+  toExpPos: 21,
+  // 0 to EXP_LIMIT
+  // The minimum exponent value, beneath which underflow to zero occurs.
+  // JavaScript numbers: -324  (5e-324)
+  minE: -Ht,
+  // -1 to -EXP_LIMIT
+  // The maximum exponent value, above which overflow to Infinity occurs.
+  // JavaScript numbers: 308  (1.7976931348623157e+308)
+  maxE: Ht,
+  // 1 to EXP_LIMIT
+  // Whether to use cryptographically-secure random number generation, if available.
+  crypto: !1
+  // true/false
+}, Vs, Tt, X = !0, hn = "[DecimalError] ", wt = hn + "Invalid argument: ", Hs = hn + "Precision limit exceeded", Ks = hn + "crypto unavailable", Gs = "[object Decimal]", Ke = Math.floor, Me = Math.pow, Pi = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, vi = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, ki = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, qs = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, ot = 1e7, $ = 7, Di = 9007199254740991, Fi = un.length - 1, is = fn.length - 1, O = { toStringTag: Gs };
+O.absoluteValue = O.abs = function() {
+  var e = new this.constructor(this);
+  return e.s < 0 && (e.s = 1), _(e);
+};
+O.ceil = function() {
+  return _(new this.constructor(this), this.e + 1, 2);
+};
+O.clampedTo = O.clamp = function(e, t) {
+  var r, n = this, a = n.constructor;
+  if (e = new a(e), t = new a(t), !e.s || !t.s) return new a(NaN);
+  if (e.gt(t)) throw Error(wt + t);
+  return r = n.cmp(e), r < 0 ? e : n.cmp(t) > 0 ? t : new a(n);
+};
+O.comparedTo = O.cmp = function(e) {
+  var t, r, n, a, o = this, i = o.d, l = (e = new o.constructor(e)).d, p = o.s, f = e.s;
+  if (!i || !l)
+    return !p || !f ? NaN : p !== f ? p : i === l ? 0 : !i ^ p < 0 ? 1 : -1;
+  if (!i[0] || !l[0]) return i[0] ? p : l[0] ? -f : 0;
+  if (p !== f) return p;
+  if (o.e !== e.e) return o.e > e.e ^ p < 0 ? 1 : -1;
+  for (n = i.length, a = l.length, t = 0, r = n < a ? n : a; t < r; ++t)
+    if (i[t] !== l[t]) return i[t] > l[t] ^ p < 0 ? 1 : -1;
+  return n === a ? 0 : n > a ^ p < 0 ? 1 : -1;
+};
+O.cosine = O.cos = function() {
+  var e, t, r = this, n = r.constructor;
+  return r.d ? r.d[0] ? (e = n.precision, t = n.rounding, n.precision = e + Math.max(r.e, r.sd()) + $, n.rounding = 1, r = Bi(n, Zs(n, r)), n.precision = e, n.rounding = t, _(Tt == 2 || Tt == 3 ? r.neg() : r, e, t, !0)) : new n(1) : new n(NaN);
+};
+O.cubeRoot = O.cbrt = function() {
+  var e, t, r, n, a, o, i, l, p, f, g = this, m = g.constructor;
+  if (!g.isFinite() || g.isZero()) return new m(g);
+  for (X = !1, o = g.s * Me(g.s * g, 1 / 3), !o || Math.abs(o) == 1 / 0 ? (r = Fe(g.d), e = g.e, (o = (e - r.length + 1) % 3) && (r += o == 1 || o == -2 ? "0" : "00"), o = Me(r, 1 / 3), e = Ke((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), o == 1 / 0 ? r = "5e" + e : (r = o.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + e), n = new m(r), n.s = g.s) : n = new m(o.toString()), i = (e = m.precision) + 3; ; )
+    if (l = n, p = l.times(l).times(l), f = p.plus(g), n = ge(f.plus(g).times(l), f.plus(p), i + 2, 1), Fe(l.d).slice(0, i) === (r = Fe(n.d)).slice(0, i))
+      if (r = r.slice(i - 3, i + 1), r == "9999" || !a && r == "4999") {
+        if (!a && (_(l, e + 1, 0), l.times(l).times(l).eq(g))) {
+          n = l;
+          break;
+        }
+        i += 4, a = 1;
+      } else {
+        (!+r || !+r.slice(1) && r.charAt(0) == "5") && (_(n, e + 1, 1), t = !n.times(n).times(n).eq(g));
+        break;
+      }
+  return X = !0, _(n, e, m.rounding, t);
+};
+O.decimalPlaces = O.dp = function() {
+  var e, t = this.d, r = NaN;
+  if (t) {
+    if (e = t.length - 1, r = (e - Ke(this.e / $)) * $, e = t[e], e) for (; e % 10 == 0; e /= 10) r--;
+    r < 0 && (r = 0);
+  }
+  return r;
+};
+O.dividedBy = O.div = function(e) {
+  return ge(this, new this.constructor(e));
+};
+O.dividedToIntegerBy = O.divToInt = function(e) {
+  var t = this, r = t.constructor;
+  return _(ge(t, new r(e), 0, 1, 1), r.precision, r.rounding);
+};
+O.equals = O.eq = function(e) {
+  return this.cmp(e) === 0;
+};
+O.floor = function() {
+  return _(new this.constructor(this), this.e + 1, 3);
+};
+O.greaterThan = O.gt = function(e) {
+  return this.cmp(e) > 0;
+};
+O.greaterThanOrEqualTo = O.gte = function(e) {
+  var t = this.cmp(e);
+  return t == 1 || t === 0;
+};
+O.hyperbolicCosine = O.cosh = function() {
+  var e, t, r, n, a, o = this, i = o.constructor, l = new i(1);
+  if (!o.isFinite()) return new i(o.s ? 1 / 0 : NaN);
+  if (o.isZero()) return l;
+  r = i.precision, n = i.rounding, i.precision = r + Math.max(o.e, o.sd()) + 4, i.rounding = 1, a = o.d.length, a < 32 ? (e = Math.ceil(a / 3), t = (1 / mn(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), o = Kt(i, 1, o.times(t), new i(1), !0);
+  for (var p, f = e, g = new i(8); f--; )
+    p = o.times(o), o = l.minus(p.times(g.minus(p.times(g))));
+  return _(o, i.precision = r, i.rounding = n, !0);
+};
+O.hyperbolicSine = O.sinh = function() {
+  var e, t, r, n, a = this, o = a.constructor;
+  if (!a.isFinite() || a.isZero()) return new o(a);
+  if (t = o.precision, r = o.rounding, o.precision = t + Math.max(a.e, a.sd()) + 4, o.rounding = 1, n = a.d.length, n < 3)
+    a = Kt(o, 2, a, a, !0);
+  else {
+    e = 1.4 * Math.sqrt(n), e = e > 16 ? 16 : e | 0, a = a.times(1 / mn(5, e)), a = Kt(o, 2, a, a, !0);
+    for (var i, l = new o(5), p = new o(16), f = new o(20); e--; )
+      i = a.times(a), a = a.times(l.plus(i.times(p.times(i).plus(f))));
+  }
+  return o.precision = t, o.rounding = r, _(a, t, r, !0);
+};
+O.hyperbolicTangent = O.tanh = function() {
+  var e, t, r = this, n = r.constructor;
+  return r.isFinite() ? r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + 7, n.rounding = 1, ge(r.sinh(), r.cosh(), n.precision = e, n.rounding = t)) : new n(r.s);
+};
+O.inverseCosine = O.acos = function() {
+  var e = this, t = e.constructor, r = e.abs().cmp(1), n = t.precision, a = t.rounding;
+  return r !== -1 ? r === 0 ? e.isNeg() ? pt(t, n, a) : new t(0) : new t(NaN) : e.isZero() ? pt(t, n + 4, a).times(0.5) : (t.precision = n + 6, t.rounding = 1, e = new t(1).minus(e).div(e.plus(1)).sqrt().atan(), t.precision = n, t.rounding = a, e.times(2));
+};
+O.inverseHyperbolicCosine = O.acosh = function() {
+  var e, t, r = this, n = r.constructor;
+  return r.lte(1) ? new n(r.eq(1) ? 0 : NaN) : r.isFinite() ? (e = n.precision, t = n.rounding, n.precision = e + Math.max(Math.abs(r.e), r.sd()) + 4, n.rounding = 1, X = !1, r = r.times(r).minus(1).sqrt().plus(r), X = !0, n.precision = e, n.rounding = t, r.ln()) : new n(r);
+};
+O.inverseHyperbolicSine = O.asinh = function() {
+  var e, t, r = this, n = r.constructor;
+  return !r.isFinite() || r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + 2 * Math.max(Math.abs(r.e), r.sd()) + 6, n.rounding = 1, X = !1, r = r.times(r).plus(1).sqrt().plus(r), X = !0, n.precision = e, n.rounding = t, r.ln());
+};
+O.inverseHyperbolicTangent = O.atanh = function() {
+  var e, t, r, n, a = this, o = a.constructor;
+  return a.isFinite() ? a.e >= 0 ? new o(a.abs().eq(1) ? a.s / 0 : a.isZero() ? a : NaN) : (e = o.precision, t = o.rounding, n = a.sd(), Math.max(n, e) < 2 * -a.e - 1 ? _(new o(a), e, t, !0) : (o.precision = r = n - a.e, a = ge(a.plus(1), new o(1).minus(a), r + e, 1), o.precision = e + 4, o.rounding = 1, a = a.ln(), o.precision = e, o.rounding = t, a.times(0.5))) : new o(NaN);
+};
+O.inverseSine = O.asin = function() {
+  var e, t, r, n, a = this, o = a.constructor;
+  return a.isZero() ? new o(a) : (t = a.abs().cmp(1), r = o.precision, n = o.rounding, t !== -1 ? t === 0 ? (e = pt(o, r + 4, n).times(0.5), e.s = a.s, e) : new o(NaN) : (o.precision = r + 6, o.rounding = 1, a = a.div(new o(1).minus(a.times(a)).sqrt().plus(1)).atan(), o.precision = r, o.rounding = n, a.times(2)));
+};
+O.inverseTangent = O.atan = function() {
+  var e, t, r, n, a, o, i, l, p, f = this, g = f.constructor, m = g.precision, h = g.rounding;
+  if (f.isFinite()) {
+    if (f.isZero())
+      return new g(f);
+    if (f.abs().eq(1) && m + 4 <= is)
+      return i = pt(g, m + 4, h).times(0.25), i.s = f.s, i;
+  } else {
+    if (!f.s) return new g(NaN);
+    if (m + 4 <= is)
+      return i = pt(g, m + 4, h).times(0.5), i.s = f.s, i;
+  }
+  for (g.precision = l = m + 10, g.rounding = 1, r = Math.min(28, l / $ + 2 | 0), e = r; e; --e) f = f.div(f.times(f).plus(1).sqrt().plus(1));
+  for (X = !1, t = Math.ceil(l / $), n = 1, p = f.times(f), i = new g(f), a = f; e !== -1; )
+    if (a = a.times(p), o = i.minus(a.div(n += 2)), a = a.times(p), i = o.plus(a.div(n += 2)), i.d[t] !== void 0) for (e = t; i.d[e] === o.d[e] && e--; ) ;
+  return r && (i = i.times(2 << r - 1)), X = !0, _(i, g.precision = m, g.rounding = h, !0);
+};
+O.isFinite = function() {
+  return !!this.d;
+};
+O.isInteger = O.isInt = function() {
+  return !!this.d && Ke(this.e / $) > this.d.length - 2;
+};
+O.isNaN = function() {
+  return !this.s;
+};
+O.isNegative = O.isNeg = function() {
+  return this.s < 0;
+};
+O.isPositive = O.isPos = function() {
+  return this.s > 0;
+};
+O.isZero = function() {
+  return !!this.d && this.d[0] === 0;
+};
+O.lessThan = O.lt = function(e) {
+  return this.cmp(e) < 0;
+};
+O.lessThanOrEqualTo = O.lte = function(e) {
+  return this.cmp(e) < 1;
+};
+O.logarithm = O.log = function(e) {
+  var t, r, n, a, o, i, l, p, f = this, g = f.constructor, m = g.precision, h = g.rounding, x = 5;
+  if (e == null)
+    e = new g(10), t = !0;
+  else {
+    if (e = new g(e), r = e.d, e.s < 0 || !r || !r[0] || e.eq(1)) return new g(NaN);
+    t = e.eq(10);
+  }
+  if (r = f.d, f.s < 0 || !r || !r[0] || f.eq(1))
+    return new g(r && !r[0] ? -1 / 0 : f.s != 1 ? NaN : r ? 0 : 1 / 0);
+  if (t)
+    if (r.length > 1)
+      o = !0;
+    else {
+      for (a = r[0]; a % 10 === 0; ) a /= 10;
+      o = a !== 1;
+    }
+  if (X = !1, l = m + x, i = Ot(f, l), n = t ? pn(g, l + 10) : Ot(e, l), p = ge(i, n, l, 1), Tr(p.d, a = m, h))
+    do
+      if (l += 10, i = Ot(f, l), n = t ? pn(g, l + 10) : Ot(e, l), p = ge(i, n, l, 1), !o) {
+        +Fe(p.d).slice(a + 1, a + 15) + 1 == 1e14 && (p = _(p, m + 1, 0));
+        break;
+      }
+    while (Tr(p.d, a += 10, h));
+  return X = !0, _(p, m, h);
+};
+O.minus = O.sub = function(e) {
+  var t, r, n, a, o, i, l, p, f, g, m, h, x = this, N = x.constructor;
+  if (e = new N(e), !x.d || !e.d)
+    return !x.s || !e.s ? e = new N(NaN) : x.d ? e.s = -e.s : e = new N(e.d || x.s !== e.s ? x : NaN), e;
+  if (x.s != e.s)
+    return e.s = -e.s, x.plus(e);
+  if (f = x.d, h = e.d, l = N.precision, p = N.rounding, !f[0] || !h[0]) {
+    if (h[0]) e.s = -e.s;
+    else if (f[0]) e = new N(x);
+    else return new N(p === 3 ? -0 : 0);
+    return X ? _(e, l, p) : e;
+  }
+  if (r = Ke(e.e / $), g = Ke(x.e / $), f = f.slice(), o = g - r, o) {
+    for (m = o < 0, m ? (t = f, o = -o, i = h.length) : (t = h, r = g, i = f.length), n = Math.max(Math.ceil(l / $), i) + 2, o > n && (o = n, t.length = 1), t.reverse(), n = o; n--; ) t.push(0);
+    t.reverse();
+  } else {
+    for (n = f.length, i = h.length, m = n < i, m && (i = n), n = 0; n < i; n++)
+      if (f[n] != h[n]) {
+        m = f[n] < h[n];
+        break;
+      }
+    o = 0;
+  }
+  for (m && (t = f, f = h, h = t, e.s = -e.s), i = f.length, n = h.length - i; n > 0; --n) f[i++] = 0;
+  for (n = h.length; n > o; ) {
+    if (f[--n] < h[n]) {
+      for (a = n; a && f[--a] === 0; ) f[a] = ot - 1;
+      --f[a], f[n] += ot;
+    }
+    f[n] -= h[n];
+  }
+  for (; f[--i] === 0; ) f.pop();
+  for (; f[0] === 0; f.shift()) --r;
+  return f[0] ? (e.d = f, e.e = dn(f, r), X ? _(e, l, p) : e) : new N(p === 3 ? -0 : 0);
+};
+O.modulo = O.mod = function(e) {
+  var t, r = this, n = r.constructor;
+  return e = new n(e), !r.d || !e.s || e.d && !e.d[0] ? new n(NaN) : !e.d || r.d && !r.d[0] ? _(new n(r), n.precision, n.rounding) : (X = !1, n.modulo == 9 ? (t = ge(r, e.abs(), 0, 3, 1), t.s *= e.s) : t = ge(r, e, 0, n.modulo, 1), t = t.times(e), X = !0, r.minus(t));
+};
+O.naturalExponential = O.exp = function() {
+  return as(this);
+};
+O.naturalLogarithm = O.ln = function() {
+  return Ot(this);
+};
+O.negated = O.neg = function() {
+  var e = new this.constructor(this);
+  return e.s = -e.s, _(e);
+};
+O.plus = O.add = function(e) {
+  var t, r, n, a, o, i, l, p, f, g, m = this, h = m.constructor;
+  if (e = new h(e), !m.d || !e.d)
+    return !m.s || !e.s ? e = new h(NaN) : m.d || (e = new h(e.d || m.s === e.s ? m : NaN)), e;
+  if (m.s != e.s)
+    return e.s = -e.s, m.minus(e);
+  if (f = m.d, g = e.d, l = h.precision, p = h.rounding, !f[0] || !g[0])
+    return g[0] || (e = new h(m)), X ? _(e, l, p) : e;
+  if (o = Ke(m.e / $), n = Ke(e.e / $), f = f.slice(), a = o - n, a) {
+    for (a < 0 ? (r = f, a = -a, i = g.length) : (r = g, n = o, i = f.length), o = Math.ceil(l / $), i = o > i ? o + 1 : i + 1, a > i && (a = i, r.length = 1), r.reverse(); a--; ) r.push(0);
+    r.reverse();
+  }
+  for (i = f.length, a = g.length, i - a < 0 && (a = i, r = g, g = f, f = r), t = 0; a; )
+    t = (f[--a] = f[a] + g[a] + t) / ot | 0, f[a] %= ot;
+  for (t && (f.unshift(t), ++n), i = f.length; f[--i] == 0; ) f.pop();
+  return e.d = f, e.e = dn(f, n), X ? _(e, l, p) : e;
+};
+O.precision = O.sd = function(e) {
+  var t, r = this;
+  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(wt + e);
+  return r.d ? (t = Ws(r.d), e && r.e + 1 > t && (t = r.e + 1)) : t = NaN, t;
+};
+O.round = function() {
+  var e = this, t = e.constructor;
+  return _(new t(e), e.e + 1, t.rounding);
+};
+O.sine = O.sin = function() {
+  var e, t, r = this, n = r.constructor;
+  return r.isFinite() ? r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + Math.max(r.e, r.sd()) + $, n.rounding = 1, r = Ui(n, Zs(n, r)), n.precision = e, n.rounding = t, _(Tt > 2 ? r.neg() : r, e, t, !0)) : new n(NaN);
+};
+O.squareRoot = O.sqrt = function() {
+  var e, t, r, n, a, o, i = this, l = i.d, p = i.e, f = i.s, g = i.constructor;
+  if (f !== 1 || !l || !l[0])
+    return new g(!f || f < 0 && (!l || l[0]) ? NaN : l ? i : 1 / 0);
+  for (X = !1, f = Math.sqrt(+i), f == 0 || f == 1 / 0 ? (t = Fe(l), (t.length + p) % 2 == 0 && (t += "0"), f = Math.sqrt(t), p = Ke((p + 1) / 2) - (p < 0 || p % 2), f == 1 / 0 ? t = "5e" + p : (t = f.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + p), n = new g(t)) : n = new g(f.toString()), r = (p = g.precision) + 3; ; )
+    if (o = n, n = o.plus(ge(i, o, r + 2, 1)).times(0.5), Fe(o.d).slice(0, r) === (t = Fe(n.d)).slice(0, r))
+      if (t = t.slice(r - 3, r + 1), t == "9999" || !a && t == "4999") {
+        if (!a && (_(o, p + 1, 0), o.times(o).eq(i))) {
+          n = o;
+          break;
+        }
+        r += 4, a = 1;
+      } else {
+        (!+t || !+t.slice(1) && t.charAt(0) == "5") && (_(n, p + 1, 1), e = !n.times(n).eq(i));
+        break;
+      }
+  return X = !0, _(n, p, g.rounding, e);
+};
+O.tangent = O.tan = function() {
+  var e, t, r = this, n = r.constructor;
+  return r.isFinite() ? r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + 10, n.rounding = 1, r = r.sin(), r.s = 1, r = ge(r, new n(1).minus(r.times(r)).sqrt(), e + 10, 0), n.precision = e, n.rounding = t, _(Tt == 2 || Tt == 4 ? r.neg() : r, e, t, !0)) : new n(NaN);
+};
+O.times = O.mul = function(e) {
+  var t, r, n, a, o, i, l, p, f, g = this, m = g.constructor, h = g.d, x = (e = new m(e)).d;
+  if (e.s *= g.s, !h || !h[0] || !x || !x[0])
+    return new m(!e.s || h && !h[0] && !x || x && !x[0] && !h ? NaN : !h || !x ? e.s / 0 : e.s * 0);
+  for (r = Ke(g.e / $) + Ke(e.e / $), p = h.length, f = x.length, p < f && (o = h, h = x, x = o, i = p, p = f, f = i), o = [], i = p + f, n = i; n--; ) o.push(0);
+  for (n = f; --n >= 0; ) {
+    for (t = 0, a = p + n; a > n; )
+      l = o[a] + x[n] * h[a - n - 1] + t, o[a--] = l % ot | 0, t = l / ot | 0;
+    o[a] = (o[a] + t) % ot | 0;
+  }
+  for (; !o[--i]; ) o.pop();
+  return t ? ++r : o.shift(), e.d = o, e.e = dn(o, r), X ? _(e, m.precision, m.rounding) : e;
+};
+O.toBinary = function(e, t) {
+  return cs(this, 2, e, t);
+};
+O.toDecimalPlaces = O.toDP = function(e, t) {
+  var r = this, n = r.constructor;
+  return r = new n(r), e === void 0 ? r : (Ze(e, 0, bt), t === void 0 ? t = n.rounding : Ze(t, 0, 8), _(r, e + r.e + 1, t));
+};
+O.toExponential = function(e, t) {
+  var r, n = this, a = n.constructor;
+  return e === void 0 ? r = gt(n, !0) : (Ze(e, 0, bt), t === void 0 ? t = a.rounding : Ze(t, 0, 8), n = _(new a(n), e + 1, t), r = gt(n, !0, e + 1)), n.isNeg() && !n.isZero() ? "-" + r : r;
+};
+O.toFixed = function(e, t) {
+  var r, n, a = this, o = a.constructor;
+  return e === void 0 ? r = gt(a) : (Ze(e, 0, bt), t === void 0 ? t = o.rounding : Ze(t, 0, 8), n = _(new o(a), e + a.e + 1, t), r = gt(n, !1, e + n.e + 1)), a.isNeg() && !a.isZero() ? "-" + r : r;
+};
+O.toFraction = function(e) {
+  var t, r, n, a, o, i, l, p, f, g, m, h, x = this, N = x.d, w = x.constructor;
+  if (!N) return new w(x);
+  if (f = r = new w(1), n = p = new w(0), t = new w(n), o = t.e = Ws(N) - x.e - 1, i = o % $, t.d[0] = Me(10, i < 0 ? $ + i : i), e == null)
+    e = o > 0 ? t : f;
+  else {
+    if (l = new w(e), !l.isInt() || l.lt(f)) throw Error(wt + l);
+    e = l.gt(t) ? o > 0 ? t : f : l;
+  }
+  for (X = !1, l = new w(Fe(N)), g = w.precision, w.precision = o = N.length * $ * 2; m = ge(l, t, 0, 1, 1), a = r.plus(m.times(n)), a.cmp(e) != 1; )
+    r = n, n = a, a = f, f = p.plus(m.times(a)), p = a, a = t, t = l.minus(m.times(a)), l = a;
+  return a = ge(e.minus(r), n, 0, 1, 1), p = p.plus(a.times(f)), r = r.plus(a.times(n)), p.s = f.s = x.s, h = ge(f, n, o, 1).minus(x).abs().cmp(ge(p, r, o, 1).minus(x).abs()) < 1 ? [f, n] : [p, r], w.precision = g, X = !0, h;
+};
+O.toHexadecimal = O.toHex = function(e, t) {
+  return cs(this, 16, e, t);
+};
+O.toNearest = function(e, t) {
+  var r = this, n = r.constructor;
+  if (r = new n(r), e == null) {
+    if (!r.d) return r;
+    e = new n(1), t = n.rounding;
+  } else {
+    if (e = new n(e), t === void 0 ? t = n.rounding : Ze(t, 0, 8), !r.d) return e.s ? r : e;
+    if (!e.d)
+      return e.s && (e.s = r.s), e;
+  }
+  return e.d[0] ? (X = !1, r = ge(r, e, 0, t, 1).times(e), X = !0, _(r)) : (e.s = r.s, r = e), r;
+};
+O.toNumber = function() {
+  return +this;
+};
+O.toOctal = function(e, t) {
+  return cs(this, 8, e, t);
+};
+O.toPower = O.pow = function(e) {
+  var t, r, n, a, o, i, l = this, p = l.constructor, f = +(e = new p(e));
+  if (!l.d || !e.d || !l.d[0] || !e.d[0]) return new p(Me(+l, f));
+  if (l = new p(l), l.eq(1)) return l;
+  if (n = p.precision, o = p.rounding, e.eq(1)) return _(l, n, o);
+  if (t = Ke(e.e / $), t >= e.d.length - 1 && (r = f < 0 ? -f : f) <= Di)
+    return a = Xs(p, l, r, n), e.s < 0 ? new p(1).div(a) : _(a, n, o);
+  if (i = l.s, i < 0) {
+    if (t < e.d.length - 1) return new p(NaN);
+    if (e.d[t] & 1 || (i = 1), l.e == 0 && l.d[0] == 1 && l.d.length == 1)
+      return l.s = i, l;
+  }
+  return r = Me(+l, f), t = r == 0 || !isFinite(r) ? Ke(f * (Math.log("0." + Fe(l.d)) / Math.LN10 + l.e + 1)) : new p(r + "").e, t > p.maxE + 1 || t < p.minE - 1 ? new p(t > 0 ? i / 0 : 0) : (X = !1, p.rounding = l.s = 1, r = Math.min(12, (t + "").length), a = as(e.times(Ot(l, n + r)), n), a.d && (a = _(a, n + 5, 1), Tr(a.d, n, o) && (t = n + 10, a = _(as(e.times(Ot(l, t + r)), t), t + 5, 1), +Fe(a.d).slice(n + 1, n + 15) + 1 == 1e14 && (a = _(a, n + 1, 0)))), a.s = i, X = !0, p.rounding = o, _(a, n, o));
+};
+O.toPrecision = function(e, t) {
+  var r, n = this, a = n.constructor;
+  return e === void 0 ? r = gt(n, n.e <= a.toExpNeg || n.e >= a.toExpPos) : (Ze(e, 1, bt), t === void 0 ? t = a.rounding : Ze(t, 0, 8), n = _(new a(n), e, t), r = gt(n, e <= n.e || n.e <= a.toExpNeg, e)), n.isNeg() && !n.isZero() ? "-" + r : r;
+};
+O.toSignificantDigits = O.toSD = function(e, t) {
+  var r = this, n = r.constructor;
+  return e === void 0 ? (e = n.precision, t = n.rounding) : (Ze(e, 1, bt), t === void 0 ? t = n.rounding : Ze(t, 0, 8)), _(new n(r), e, t);
+};
+O.toString = function() {
+  var e = this, t = e.constructor, r = gt(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+  return e.isNeg() && !e.isZero() ? "-" + r : r;
+};
+O.truncated = O.trunc = function() {
+  return _(new this.constructor(this), this.e + 1, 1);
+};
+O.valueOf = O.toJSON = function() {
+  var e = this, t = e.constructor, r = gt(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+  return e.isNeg() ? "-" + r : r;
+};
+function Fe(e) {
+  var t, r, n, a = e.length - 1, o = "", i = e[0];
+  if (a > 0) {
+    for (o += i, t = 1; t < a; t++)
+      n = e[t] + "", r = $ - n.length, r && (o += St(r)), o += n;
+    i = e[t], n = i + "", r = $ - n.length, r && (o += St(r));
+  } else if (i === 0)
+    return "0";
+  for (; i % 10 === 0; ) i /= 10;
+  return o + i;
+}
+function Ze(e, t, r) {
+  if (e !== ~~e || e < t || e > r)
+    throw Error(wt + e);
+}
+function Tr(e, t, r, n) {
+  var a, o, i, l;
+  for (o = e[0]; o >= 10; o /= 10) --t;
+  return --t < 0 ? (t += $, a = 0) : (a = Math.ceil((t + 1) / $), t %= $), o = Me(10, $ - t), l = e[a] % o | 0, n == null ? t < 3 ? (t == 0 ? l = l / 100 | 0 : t == 1 && (l = l / 10 | 0), i = r < 4 && l == 99999 || r > 3 && l == 49999 || l == 5e4 || l == 0) : i = (r < 4 && l + 1 == o || r > 3 && l + 1 == o / 2) && (e[a + 1] / o / 100 | 0) == Me(10, t - 2) - 1 || (l == o / 2 || l == 0) && (e[a + 1] / o / 100 | 0) == 0 : t < 4 ? (t == 0 ? l = l / 1e3 | 0 : t == 1 ? l = l / 100 | 0 : t == 2 && (l = l / 10 | 0), i = (n || r < 4) && l == 9999 || !n && r > 3 && l == 4999) : i = ((n || r < 4) && l + 1 == o || !n && r > 3 && l + 1 == o / 2) && (e[a + 1] / o / 1e3 | 0) == Me(10, t - 3) - 1, i;
+}
+function cn(e, t, r) {
+  for (var n, a = [0], o, i = 0, l = e.length; i < l; ) {
+    for (o = a.length; o--; ) a[o] *= t;
+    for (a[0] += ns.indexOf(e.charAt(i++)), n = 0; n < a.length; n++)
+      a[n] > r - 1 && (a[n + 1] === void 0 && (a[n + 1] = 0), a[n + 1] += a[n] / r | 0, a[n] %= r);
+  }
+  return a.reverse();
+}
+function Bi(e, t) {
+  var r, n, a;
+  if (t.isZero()) return t;
+  n = t.d.length, n < 32 ? (r = Math.ceil(n / 3), a = (1 / mn(4, r)).toString()) : (r = 16, a = "2.3283064365386962890625e-10"), e.precision += r, t = Kt(e, 1, t.times(a), new e(1));
+  for (var o = r; o--; ) {
+    var i = t.times(t);
+    t = i.times(i).minus(i).times(8).plus(1);
+  }
+  return e.precision -= r, t;
+}
+var ge = /* @__PURE__ */ function() {
+  function e(n, a, o) {
+    var i, l = 0, p = n.length;
+    for (n = n.slice(); p--; )
+      i = n[p] * a + l, n[p] = i % o | 0, l = i / o | 0;
+    return l && n.unshift(l), n;
+  }
+  function t(n, a, o, i) {
+    var l, p;
+    if (o != i)
+      p = o > i ? 1 : -1;
+    else
+      for (l = p = 0; l < o; l++)
+        if (n[l] != a[l]) {
+          p = n[l] > a[l] ? 1 : -1;
+          break;
+        }
+    return p;
+  }
+  function r(n, a, o, i) {
+    for (var l = 0; o--; )
+      n[o] -= l, l = n[o] < a[o] ? 1 : 0, n[o] = l * i + n[o] - a[o];
+    for (; !n[0] && n.length > 1; ) n.shift();
+  }
+  return function(n, a, o, i, l, p) {
+    var f, g, m, h, x, N, w, U, Q, ee, G, Y, ie, Ce, xe, ve, de, Be, Ae, rt, ct = n.constructor, _e = n.s == a.s ? 1 : -1, T = n.d, C = a.d;
+    if (!T || !T[0] || !C || !C[0])
+      return new ct(
+        // Return NaN if either NaN, or both Infinity or 0.
+        !n.s || !a.s || (T ? C && T[0] == C[0] : !C) ? NaN : (
+          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+          T && T[0] == 0 || !C ? _e * 0 : _e / 0
+        )
+      );
+    for (p ? (x = 1, g = n.e - a.e) : (p = ot, x = $, g = Ke(n.e / x) - Ke(a.e / x)), Ae = C.length, de = T.length, Q = new ct(_e), ee = Q.d = [], m = 0; C[m] == (T[m] || 0); m++) ;
+    if (C[m] > (T[m] || 0) && g--, o == null ? (Ce = o = ct.precision, i = ct.rounding) : l ? Ce = o + (n.e - a.e) + 1 : Ce = o, Ce < 0)
+      ee.push(1), N = !0;
+    else {
+      if (Ce = Ce / x + 2 | 0, m = 0, Ae == 1) {
+        for (h = 0, C = C[0], Ce++; (m < de || h) && Ce--; m++)
+          xe = h * p + (T[m] || 0), ee[m] = xe / C | 0, h = xe % C | 0;
+        N = h || m < de;
+      } else {
+        for (h = p / (C[0] + 1) | 0, h > 1 && (C = e(C, h, p), T = e(T, h, p), Ae = C.length, de = T.length), ve = Ae, G = T.slice(0, Ae), Y = G.length; Y < Ae; ) G[Y++] = 0;
+        rt = C.slice(), rt.unshift(0), Be = C[0], C[1] >= p / 2 && ++Be;
+        do
+          h = 0, f = t(C, G, Ae, Y), f < 0 ? (ie = G[0], Ae != Y && (ie = ie * p + (G[1] || 0)), h = ie / Be | 0, h > 1 ? (h >= p && (h = p - 1), w = e(C, h, p), U = w.length, Y = G.length, f = t(w, G, U, Y), f == 1 && (h--, r(w, Ae < U ? rt : C, U, p))) : (h == 0 && (f = h = 1), w = C.slice()), U = w.length, U < Y && w.unshift(0), r(G, w, Y, p), f == -1 && (Y = G.length, f = t(C, G, Ae, Y), f < 1 && (h++, r(G, Ae < Y ? rt : C, Y, p))), Y = G.length) : f === 0 && (h++, G = [0]), ee[m++] = h, f && G[0] ? G[Y++] = T[ve] || 0 : (G = [T[ve]], Y = 1);
+        while ((ve++ < de || G[0] !== void 0) && Ce--);
+        N = G[0] !== void 0;
+      }
+      ee[0] || ee.shift();
+    }
+    if (x == 1)
+      Q.e = g, Vs = N;
+    else {
+      for (m = 1, h = ee[0]; h >= 10; h /= 10) m++;
+      Q.e = m + g * x - 1, _(Q, l ? o + Q.e + 1 : o, i, N);
+    }
+    return Q;
+  };
+}();
+function _(e, t, r, n) {
+  var a, o, i, l, p, f, g, m, h, x = e.constructor;
+  e: if (t != null) {
+    if (m = e.d, !m) return e;
+    for (a = 1, l = m[0]; l >= 10; l /= 10) a++;
+    if (o = t - a, o < 0)
+      o += $, i = t, g = m[h = 0], p = g / Me(10, a - i - 1) % 10 | 0;
+    else if (h = Math.ceil((o + 1) / $), l = m.length, h >= l)
+      if (n) {
+        for (; l++ <= h; ) m.push(0);
+        g = p = 0, a = 1, o %= $, i = o - $ + 1;
+      } else
+        break e;
+    else {
+      for (g = l = m[h], a = 1; l >= 10; l /= 10) a++;
+      o %= $, i = o - $ + a, p = i < 0 ? 0 : g / Me(10, a - i - 1) % 10 | 0;
+    }
+    if (n = n || t < 0 || m[h + 1] !== void 0 || (i < 0 ? g : g % Me(10, a - i - 1)), f = r < 4 ? (p || n) && (r == 0 || r == (e.s < 0 ? 3 : 2)) : p > 5 || p == 5 && (r == 4 || n || r == 6 && // Check whether the digit to the left of the rounding digit is odd.
+    (o > 0 ? i > 0 ? g / Me(10, a - i) : 0 : m[h - 1]) % 10 & 1 || r == (e.s < 0 ? 8 : 7)), t < 1 || !m[0])
+      return m.length = 0, f ? (t -= e.e + 1, m[0] = Me(10, ($ - t % $) % $), e.e = -t || 0) : m[0] = e.e = 0, e;
+    if (o == 0 ? (m.length = h, l = 1, h--) : (m.length = h + 1, l = Me(10, $ - o), m[h] = i > 0 ? (g / Me(10, a - i) % Me(10, i) | 0) * l : 0), f)
+      for (; ; )
+        if (h == 0) {
+          for (o = 1, i = m[0]; i >= 10; i /= 10) o++;
+          for (i = m[0] += l, l = 1; i >= 10; i /= 10) l++;
+          o != l && (e.e++, m[0] == ot && (m[0] = 1));
+          break;
+        } else {
+          if (m[h] += l, m[h] != ot) break;
+          m[h--] = 0, l = 1;
+        }
+    for (o = m.length; m[--o] === 0; ) m.pop();
+  }
+  return X && (e.e > x.maxE ? (e.d = null, e.e = NaN) : e.e < x.minE && (e.e = 0, e.d = [0])), e;
+}
+function gt(e, t, r) {
+  if (!e.isFinite()) return js(e);
+  var n, a = e.e, o = Fe(e.d), i = o.length;
+  return t ? (r && (n = r - i) > 0 ? o = o.charAt(0) + "." + o.slice(1) + St(n) : i > 1 && (o = o.charAt(0) + "." + o.slice(1)), o = o + (e.e < 0 ? "e" : "e+") + e.e) : a < 0 ? (o = "0." + St(-a - 1) + o, r && (n = r - i) > 0 && (o += St(n))) : a >= i ? (o += St(a + 1 - i), r && (n = r - a - 1) > 0 && (o = o + "." + St(n))) : ((n = a + 1) < i && (o = o.slice(0, n) + "." + o.slice(n)), r && (n = r - i) > 0 && (a + 1 === i && (o += "."), o += St(n))), o;
+}
+function dn(e, t) {
+  var r = e[0];
+  for (t *= $; r >= 10; r /= 10) t++;
+  return t;
+}
+function pn(e, t, r) {
+  if (t > Fi)
+    throw X = !0, r && (e.precision = r), Error(Hs);
+  return _(new e(un), t, 1, !0);
+}
+function pt(e, t, r) {
+  if (t > is) throw Error(Hs);
+  return _(new e(fn), t, r, !0);
+}
+function Ws(e) {
+  var t = e.length - 1, r = t * $ + 1;
+  if (t = e[t], t) {
+    for (; t % 10 == 0; t /= 10) r--;
+    for (t = e[0]; t >= 10; t /= 10) r++;
+  }
+  return r;
+}
+function St(e) {
+  for (var t = ""; e--; ) t += "0";
+  return t;
+}
+function Xs(e, t, r, n) {
+  var a, o = new e(1), i = Math.ceil(n / $ + 4);
+  for (X = !1; ; ) {
+    if (r % 2 && (o = o.times(t), Bs(o.d, i) && (a = !0)), r = Ke(r / 2), r === 0) {
+      r = o.d.length - 1, a && o.d[r] === 0 && ++o.d[r];
+      break;
+    }
+    t = t.times(t), Bs(t.d, i);
+  }
+  return X = !0, o;
+}
+function Fs(e) {
+  return e.d[e.d.length - 1] & 1;
+}
+function Qs(e, t, r) {
+  for (var n, a, o = new e(t[0]), i = 0; ++i < t.length; ) {
+    if (a = new e(t[i]), !a.s) {
+      o = a;
+      break;
+    }
+    n = o.cmp(a), (n === r || n === 0 && o.s === r) && (o = a);
+  }
+  return o;
+}
+function as(e, t) {
+  var r, n, a, o, i, l, p, f = 0, g = 0, m = 0, h = e.constructor, x = h.rounding, N = h.precision;
+  if (!e.d || !e.d[0] || e.e > 17)
+    return new h(e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
+  for (t == null ? (X = !1, p = N) : p = t, l = new h(0.03125); e.e > -2; )
+    e = e.times(l), m += 5;
+  for (n = Math.log(Me(2, m)) / Math.LN10 * 2 + 5 | 0, p += n, r = o = i = new h(1), h.precision = p; ; ) {
+    if (o = _(o.times(e), p, 1), r = r.times(++g), l = i.plus(ge(o, r, p, 1)), Fe(l.d).slice(0, p) === Fe(i.d).slice(0, p)) {
+      for (a = m; a--; ) i = _(i.times(i), p, 1);
+      if (t == null)
+        if (f < 3 && Tr(i.d, p - n, x, f))
+          h.precision = p += 10, r = o = l = new h(1), g = 0, f++;
+        else
+          return _(i, h.precision = N, x, X = !0);
+      else
+        return h.precision = N, i;
+    }
+    i = l;
+  }
+}
+function Ot(e, t) {
+  var r, n, a, o, i, l, p, f, g, m, h, x = 1, N = 10, w = e, U = w.d, Q = w.constructor, ee = Q.rounding, G = Q.precision;
+  if (w.s < 0 || !U || !U[0] || !w.e && U[0] == 1 && U.length == 1)
+    return new Q(U && !U[0] ? -1 / 0 : w.s != 1 ? NaN : U ? 0 : w);
+  if (t == null ? (X = !1, g = G) : g = t, Q.precision = g += N, r = Fe(U), n = r.charAt(0), Math.abs(o = w.e) < 15e14) {
+    for (; n < 7 && n != 1 || n == 1 && r.charAt(1) > 3; )
+      w = w.times(e), r = Fe(w.d), n = r.charAt(0), x++;
+    o = w.e, n > 1 ? (w = new Q("0." + r), o++) : w = new Q(n + "." + r.slice(1));
+  } else
+    return f = pn(Q, g + 2, G).times(o + ""), w = Ot(new Q(n + "." + r.slice(1)), g - N).plus(f), Q.precision = G, t == null ? _(w, G, ee, X = !0) : w;
+  for (m = w, p = i = w = ge(w.minus(1), w.plus(1), g, 1), h = _(w.times(w), g, 1), a = 3; ; ) {
+    if (i = _(i.times(h), g, 1), f = p.plus(ge(i, new Q(a), g, 1)), Fe(f.d).slice(0, g) === Fe(p.d).slice(0, g))
+      if (p = p.times(2), o !== 0 && (p = p.plus(pn(Q, g + 2, G).times(o + ""))), p = ge(p, new Q(x), g, 1), t == null)
+        if (Tr(p.d, g - N, ee, l))
+          Q.precision = g += N, f = i = w = ge(m.minus(1), m.plus(1), g, 1), h = _(w.times(w), g, 1), a = l = 1;
+        else
+          return _(p, Q.precision = G, ee, X = !0);
+      else
+        return Q.precision = G, p;
+    p = f, a += 2;
+  }
+}
+function js(e) {
+  return String(e.s * e.s / 0);
+}
+function ln(e, t) {
+  var r, n, a;
+  for ((r = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (n = t.search(/e/i)) > 0 ? (r < 0 && (r = n), r += +t.slice(n + 1), t = t.substring(0, n)) : r < 0 && (r = t.length), n = 0; t.charCodeAt(n) === 48; n++) ;
+  for (a = t.length; t.charCodeAt(a - 1) === 48; --a) ;
+  if (t = t.slice(n, a), t) {
+    if (a -= n, e.e = r = r - n - 1, e.d = [], n = (r + 1) % $, r < 0 && (n += $), n < a) {
+      for (n && e.d.push(+t.slice(0, n)), a -= $; n < a; ) e.d.push(+t.slice(n, n += $));
+      t = t.slice(n), n = $ - t.length;
+    } else
+      n -= a;
+    for (; n--; ) t += "0";
+    e.d.push(+t), X && (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 _i(e, t) {
+  var r, n, a, o, i, l, p, f, g;
+  if (t.indexOf("_") > -1) {
+    if (t = t.replace(/(\d)_(?=\d)/g, "$1"), qs.test(t)) return ln(e, t);
+  } else if (t === "Infinity" || t === "NaN")
+    return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
+  if (vi.test(t))
+    r = 16, t = t.toLowerCase();
+  else if (Pi.test(t))
+    r = 2;
+  else if (ki.test(t))
+    r = 8;
+  else
+    throw Error(wt + t);
+  for (o = t.search(/p/i), o > 0 ? (p = +t.slice(o + 1), t = t.substring(2, o)) : t = t.slice(2), o = t.indexOf("."), i = o >= 0, n = e.constructor, i && (t = t.replace(".", ""), l = t.length, o = l - o, a = Xs(n, new n(r), o, o * 2)), f = cn(t, r, ot), g = f.length - 1, o = g; f[o] === 0; --o) f.pop();
+  return o < 0 ? new n(e.s * 0) : (e.e = dn(f, g), e.d = f, X = !1, i && (e = ge(e, a, l * 4)), p && (e = e.times(Math.abs(p) < 54 ? Me(2, p) : ue.pow(2, p))), X = !0, e);
+}
+function Ui(e, t) {
+  var r, n = t.d.length;
+  if (n < 3)
+    return t.isZero() ? t : Kt(e, 2, t, t);
+  r = 1.4 * Math.sqrt(n), r = r > 16 ? 16 : r | 0, t = t.times(1 / mn(5, r)), t = Kt(e, 2, t, t);
+  for (var a, o = new e(5), i = new e(16), l = new e(20); r--; )
+    a = t.times(t), t = t.times(o.plus(a.times(i.times(a).minus(l))));
+  return t;
+}
+function Kt(e, t, r, n, a) {
+  var o, i, l, p, f = e.precision, g = Math.ceil(f / $);
+  for (X = !1, p = r.times(r), l = new e(n); ; ) {
+    if (i = ge(l.times(p), new e(t++ * t++), f, 1), l = a ? n.plus(i) : n.minus(i), n = ge(i.times(p), new e(t++ * t++), f, 1), i = l.plus(n), i.d[g] !== void 0) {
+      for (o = g; i.d[o] === l.d[o] && o--; ) ;
+      if (o == -1) break;
+    }
+    o = l, l = n, n = i, i = o;
+  }
+  return X = !0, i.d.length = g + 1, i;
+}
+function mn(e, t) {
+  for (var r = e; --t; ) r *= e;
+  return r;
+}
+function Zs(e, t) {
+  var r, n = t.s < 0, a = pt(e, e.precision, 1), o = a.times(0.5);
+  if (t = t.abs(), t.lte(o))
+    return Tt = n ? 4 : 1, t;
+  if (r = t.divToInt(a), r.isZero())
+    Tt = n ? 3 : 2;
+  else {
+    if (t = t.minus(r.times(a)), t.lte(o))
+      return Tt = Fs(r) ? n ? 2 : 3 : n ? 4 : 1, t;
+    Tt = Fs(r) ? n ? 1 : 4 : n ? 3 : 2;
+  }
+  return t.minus(a).abs();
+}
+function cs(e, t, r, n) {
+  var a, o, i, l, p, f, g, m, h, x = e.constructor, N = r !== void 0;
+  if (N ? (Ze(r, 1, bt), n === void 0 ? n = x.rounding : Ze(n, 0, 8)) : (r = x.precision, n = x.rounding), !e.isFinite())
+    g = js(e);
+  else {
+    for (g = gt(e), i = g.indexOf("."), N ? (a = 2, t == 16 ? r = r * 4 - 3 : t == 8 && (r = r * 3 - 2)) : a = t, i >= 0 && (g = g.replace(".", ""), h = new x(1), h.e = g.length - i, h.d = cn(gt(h), 10, a), h.e = h.d.length), m = cn(g, 10, a), o = p = m.length; m[--p] == 0; ) m.pop();
+    if (!m[0])
+      g = N ? "0p+0" : "0";
+    else {
+      if (i < 0 ? o-- : (e = new x(e), e.d = m, e.e = o, e = ge(e, h, r, n, 0, a), m = e.d, o = e.e, f = Vs), i = m[r], l = a / 2, f = f || m[r + 1] !== void 0, f = n < 4 ? (i !== void 0 || f) && (n === 0 || n === (e.s < 0 ? 3 : 2)) : i > l || i === l && (n === 4 || f || n === 6 && m[r - 1] & 1 || n === (e.s < 0 ? 8 : 7)), m.length = r, f)
+        for (; ++m[--r] > a - 1; )
+          m[r] = 0, r || (++o, m.unshift(1));
+      for (p = m.length; !m[p - 1]; --p) ;
+      for (i = 0, g = ""; i < p; i++) g += ns.charAt(m[i]);
+      if (N) {
+        if (p > 1)
+          if (t == 16 || t == 8) {
+            for (i = t == 16 ? 4 : 3, --p; p % i; p++) g += "0";
+            for (m = cn(g, a, t), p = m.length; !m[p - 1]; --p) ;
+            for (i = 1, g = "1."; i < p; i++) g += ns.charAt(m[i]);
+          } else
+            g = g.charAt(0) + "." + g.slice(1);
+        g = g + (o < 0 ? "p" : "p+") + o;
+      } else if (o < 0) {
+        for (; ++o; ) g = "0" + g;
+        g = "0." + g;
+      } else if (++o > p) for (o -= p; o--; ) g += "0";
+      else o < p && (g = g.slice(0, o) + "." + g.slice(o));
+    }
+    g = (t == 16 ? "0x" : t == 2 ? "0b" : t == 8 ? "0o" : "") + g;
+  }
+  return e.s < 0 ? "-" + g : g;
+}
+function Bs(e, t) {
+  if (e.length > t)
+    return e.length = t, !0;
+}
+function $i(e) {
+  return new this(e).abs();
+}
+function Vi(e) {
+  return new this(e).acos();
+}
+function Hi(e) {
+  return new this(e).acosh();
+}
+function Ki(e, t) {
+  return new this(e).plus(t);
+}
+function Gi(e) {
+  return new this(e).asin();
+}
+function qi(e) {
+  return new this(e).asinh();
+}
+function Wi(e) {
+  return new this(e).atan();
+}
+function Xi(e) {
+  return new this(e).atanh();
+}
+function Qi(e, t) {
+  e = new this(e), t = new this(t);
+  var r, n = this.precision, a = this.rounding, o = n + 4;
+  return !e.s || !t.s ? r = new this(NaN) : !e.d && !t.d ? (r = pt(this, o, 1).times(t.s > 0 ? 0.25 : 0.75), r.s = e.s) : !t.d || e.isZero() ? (r = t.s < 0 ? pt(this, n, a) : new this(0), r.s = e.s) : !e.d || t.isZero() ? (r = pt(this, o, 1).times(0.5), r.s = e.s) : t.s < 0 ? (this.precision = o, this.rounding = 1, r = this.atan(ge(e, t, o, 1)), t = pt(this, o, 1), this.precision = n, this.rounding = a, r = e.s < 0 ? r.minus(t) : r.plus(t)) : r = this.atan(ge(e, t, o, 1)), r;
+}
+function ji(e) {
+  return new this(e).cbrt();
+}
+function Zi(e) {
+  return _(e = new this(e), e.e + 1, 2);
+}
+function zi(e, t, r) {
+  return new this(e).clamp(t, r);
+}
+function Ji(e) {
+  if (!e || typeof e != "object") throw Error(hn + "Object expected");
+  var t, r, n, a = e.defaults === !0, o = [
+    "precision",
+    1,
+    bt,
+    "rounding",
+    0,
+    8,
+    "toExpNeg",
+    -Ht,
+    0,
+    "toExpPos",
+    0,
+    Ht,
+    "maxE",
+    0,
+    Ht,
+    "minE",
+    -Ht,
+    0,
+    "modulo",
+    0,
+    9
+  ];
+  for (t = 0; t < o.length; t += 3)
+    if (r = o[t], a && (this[r] = ss[r]), (n = e[r]) !== void 0)
+      if (Ke(n) === n && n >= o[t + 1] && n <= o[t + 2]) this[r] = n;
+      else throw Error(wt + r + ": " + n);
+  if (r = "crypto", a && (this[r] = ss[r]), (n = e[r]) !== void 0)
+    if (n === !0 || n === !1 || n === 0 || n === 1)
+      if (n)
+        if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+          this[r] = !0;
+        else
+          throw Error(Ks);
+      else
+        this[r] = !1;
+    else
+      throw Error(wt + r + ": " + n);
+  return this;
+}
+function Yi(e) {
+  return new this(e).cos();
+}
+function ea(e) {
+  return new this(e).cosh();
+}
+function zs(e) {
+  var t, r, n;
+  function a(o) {
+    var i, l, p, f = this;
+    if (!(f instanceof a)) return new a(o);
+    if (f.constructor = a, _s(o)) {
+      f.s = o.s, X ? !o.d || o.e > a.maxE ? (f.e = NaN, f.d = null) : o.e < a.minE ? (f.e = 0, f.d = [0]) : (f.e = o.e, f.d = o.d.slice()) : (f.e = o.e, f.d = o.d ? o.d.slice() : o.d);
+      return;
+    }
+    if (p = typeof o, p === "number") {
+      if (o === 0) {
+        f.s = 1 / o < 0 ? -1 : 1, f.e = 0, f.d = [0];
+        return;
+      }
+      if (o < 0 ? (o = -o, f.s = -1) : f.s = 1, o === ~~o && o < 1e7) {
+        for (i = 0, l = o; l >= 10; l /= 10) i++;
+        X ? i > a.maxE ? (f.e = NaN, f.d = null) : i < a.minE ? (f.e = 0, f.d = [0]) : (f.e = i, f.d = [o]) : (f.e = i, f.d = [o]);
+        return;
+      }
+      if (o * 0 !== 0) {
+        o || (f.s = NaN), f.e = NaN, f.d = null;
+        return;
+      }
+      return ln(f, o.toString());
+    }
+    if (p === "string")
+      return (l = o.charCodeAt(0)) === 45 ? (o = o.slice(1), f.s = -1) : (l === 43 && (o = o.slice(1)), f.s = 1), qs.test(o) ? ln(f, o) : _i(f, o);
+    if (p === "bigint")
+      return o < 0 ? (o = -o, f.s = -1) : f.s = 1, ln(f, o.toString());
+    throw Error(wt + o);
+  }
+  if (a.prototype = O, a.ROUND_UP = 0, a.ROUND_DOWN = 1, a.ROUND_CEIL = 2, a.ROUND_FLOOR = 3, a.ROUND_HALF_UP = 4, a.ROUND_HALF_DOWN = 5, a.ROUND_HALF_EVEN = 6, a.ROUND_HALF_CEIL = 7, a.ROUND_HALF_FLOOR = 8, a.EUCLID = 9, a.config = a.set = Ji, a.clone = zs, a.isDecimal = _s, a.abs = $i, a.acos = Vi, a.acosh = Hi, a.add = Ki, a.asin = Gi, a.asinh = qi, a.atan = Wi, a.atanh = Xi, a.atan2 = Qi, a.cbrt = ji, a.ceil = Zi, a.clamp = zi, a.cos = Yi, a.cosh = ea, a.div = ta, a.exp = ra, a.floor = na, a.hypot = sa, a.ln = ia, a.log = aa, a.log10 = ca, a.log2 = oa, a.max = la, a.min = ua, a.mod = fa, a.mul = pa, a.pow = ga, a.random = ha, a.round = da, a.sign = ma, a.sin = Ca, a.sinh = xa, a.sqrt = Aa, a.sub = Ta, a.sum = Ea, a.tan = Ra, a.tanh = Na, a.trunc = Sa, e === void 0 && (e = {}), e && e.defaults !== !0)
+    for (n = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"], t = 0; t < n.length; ) e.hasOwnProperty(r = n[t++]) || (e[r] = this[r]);
+  return a.config(e), a;
+}
+function ta(e, t) {
+  return new this(e).div(t);
+}
+function ra(e) {
+  return new this(e).exp();
+}
+function na(e) {
+  return _(e = new this(e), e.e + 1, 3);
+}
+function sa() {
+  var e, t, r = new this(0);
+  for (X = !1, e = 0; e < arguments.length; )
+    if (t = new this(arguments[e++]), t.d)
+      r.d && (r = r.plus(t.times(t)));
+    else {
+      if (t.s)
+        return X = !0, new this(1 / 0);
+      r = t;
+    }
+  return X = !0, r.sqrt();
+}
+function _s(e) {
+  return e instanceof ue || e && e.toStringTag === Gs || !1;
+}
+function ia(e) {
+  return new this(e).ln();
+}
+function aa(e, t) {
+  return new this(e).log(t);
+}
+function oa(e) {
+  return new this(e).log(2);
+}
+function ca(e) {
+  return new this(e).log(10);
+}
+function la() {
+  return Qs(this, arguments, -1);
+}
+function ua() {
+  return Qs(this, arguments, 1);
+}
+function fa(e, t) {
+  return new this(e).mod(t);
+}
+function pa(e, t) {
+  return new this(e).mul(t);
+}
+function ga(e, t) {
+  return new this(e).pow(t);
+}
+function ha(e) {
+  var t, r, n, a, o = 0, i = new this(1), l = [];
+  if (e === void 0 ? e = this.precision : Ze(e, 1, bt), n = Math.ceil(e / $), this.crypto)
+    if (crypto.getRandomValues)
+      for (t = crypto.getRandomValues(new Uint32Array(n)); o < n; )
+        a = t[o], a >= 429e7 ? t[o] = crypto.getRandomValues(new Uint32Array(1))[0] : l[o++] = a % 1e7;
+    else if (crypto.randomBytes) {
+      for (t = crypto.randomBytes(n *= 4); o < n; )
+        a = t[o] + (t[o + 1] << 8) + (t[o + 2] << 16) + ((t[o + 3] & 127) << 24), a >= 214e7 ? crypto.randomBytes(4).copy(t, o) : (l.push(a % 1e7), o += 4);
+      o = n / 4;
+    } else
+      throw Error(Ks);
+  else for (; o < n; ) l[o++] = Math.random() * 1e7 | 0;
+  for (n = l[--o], e %= $, n && e && (a = Me(10, $ - e), l[o] = (n / a | 0) * a); l[o] === 0; o--) l.pop();
+  if (o < 0)
+    r = 0, l = [0];
+  else {
+    for (r = -1; l[0] === 0; r -= $) l.shift();
+    for (n = 1, a = l[0]; a >= 10; a /= 10) n++;
+    n < $ && (r -= $ - n);
+  }
+  return i.e = r, i.d = l, i;
+}
+function da(e) {
+  return _(e = new this(e), e.e + 1, this.rounding);
+}
+function ma(e) {
+  return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
+}
+function Ca(e) {
+  return new this(e).sin();
+}
+function xa(e) {
+  return new this(e).sinh();
+}
+function Aa(e) {
+  return new this(e).sqrt();
+}
+function Ta(e, t) {
+  return new this(e).sub(t);
+}
+function Ea() {
+  var e = 0, t = arguments, r = new this(t[e]);
+  for (X = !1; r.s && ++e < t.length; ) r = r.plus(t[e]);
+  return X = !0, _(r, this.precision, this.rounding);
+}
+function Ra(e) {
+  return new this(e).tan();
+}
+function Na(e) {
+  return new this(e).tanh();
+}
+function Sa(e) {
+  return _(e = new this(e), e.e + 1, 1);
+}
+O[Symbol.for("nodejs.util.inspect.custom")] = O.toString;
+O[Symbol.toStringTag] = "Decimal";
+var ue = O.constructor = zs(ss);
+un = new ue(un);
+fn = new ue(fn);
+const K = (e, t, r) => {
+  if (t === void 0 && (t = "failed!"), !e) {
+    const n = new Error(t);
+    throw n.location = r || re.location, n;
+  }
+}, Oa = (e, t) => {
+  let r = re.messages[e];
+  return t && t.forEach((n, a) => {
+    r = r.replace(`%${a + 1}`, n);
+  }), `${e}: ${r}`;
+}, wa = (e, t, r) => {
+  K(e <= t, "Invalid code range");
+  const n = re.reservedCodes.every((a) => t < a.first || e > a.last);
+  K(n, "Conflicting request for error code range"), re.reservedCodes.push({ first: e, last: t, name: r });
+}, ba = (e) => {
+  re.location = e;
+}, Ia = () => {
+  re.location = null;
+}, Ma = (e, t) => {
+  e !== void 0 && (re.timeout = e ? Date.now() + e : 0, re.timeoutMessage = t || "ERROR timeout exceeded");
+}, La = () => {
+  K(!re.timeout || re.timeout > Date.now(), re.timeoutMessage);
+}, ya = (e, t) => {
+  re.count = e, re.countMessage = t || "ERROR count exceeded";
+}, Pa = () => {
+  const { count: e } = re;
+  if (typeof e != "number" || Number.isNaN(e)) {
+    K(!1, "ERROR counter not set");
+    return;
+  }
+  K(re.count--, re.countMessage);
+}, re = {
+  assert: K,
+  message: Oa,
+  messages: {},
+  reserveCodeRange: wa,
+  reservedCodes: [],
+  setLocation: ba,
+  clearLocation: Ia,
+  checkTimeout: La,
+  setTimeout: Ma,
+  setCounter: ya,
+  checkCounter: Pa
+}, Js = (() => {
+  function e() {
+    this.nodePool = ["unused"], this.nodeMap = {};
+  }
+  e.prototype.arg = function(n) {
+    if (!t(this))
+      throw new Error("Malformed node");
+    return this.args.push(n), this;
+  }, e.prototype.argN = function(n, a) {
+    if (!t(this))
+      throw new Error("Malformed node");
+    return a === void 0 ? this.args[n] : (this.args[n] = a, this);
+  }, e.prototype.args = function(n) {
+    if (!t(this))
+      throw new Error("Malformed node");
+    return n === void 0 ? this.args : (this.args = n, this);
+  }, e.prototype.isNode = t;
+  function t(r) {
+    return r === void 0 && (r = this), r.op && r.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");
+    const { op: a } = n, o = n.args.length;
+    let i = "";
+    const l = [];
+    for (let h = 0; h < o; h++)
+      i += " ", typeof n.args[h] == "string" ? i += l[h] = n.args[h] : i += l[h] = this.intern(n.args[h]);
+    n.lbrk && n.lbrk !== 123 && n.lbrk !== 371 && (i += String.fromCharCode(n.lbrk), i += String.fromCharCode(n.rbrk));
+    const g = a + o + i;
+    let m = this.nodeMap[g];
+    return m === void 0 && (this.nodePool.push({
+      op: a,
+      args: l
+    }), m = this.nodePool.length - 1, this.nodeMap[g] = m), m;
+  }, e.prototype.node = function(n) {
+    const a = JSON.parse(JSON.stringify(this.nodePool[n]));
+    for (let o = 0; o < a.args.length; o++)
+      typeof a.args[o] != "string" && (a.args[o] = this.node(a.args[o]));
+    return a;
+  }, e.prototype.dumpAll = function() {
+    let n = "";
+    return this.nodePool.forEach((a, o) => {
+      n += `
+${o}: ${e.dump(a)}`;
+    }), n;
+  }, e.dump = e.prototype.dump = function r(n) {
+    let a;
+    if (typeof n == "string")
+      a = `"${n}"`;
+    else if (typeof n == "number")
+      a = n;
+    else {
+      a = `{ op: "${n.op}", args: [ `;
+      for (let o = 0; o < n.args.length; o++)
+        o > 0 && (a += " , "), a += r(n.args[o]);
+      a += " ] }";
+    }
+    return a;
+  }, e;
+})(), va = (() => {
+  function e() {
+  }
+  const t = [];
+  let r = {};
+  e.fn = {}, e.env = r, e.pushEnv = (H) => {
+    t.push(r), e.env = r = H;
+  }, e.popEnv = () => {
+    K(t.length > 0, "1000: Empty envStack"), e.env = r = t.pop();
+  }, e.option = (H, y) => H[y];
+  function n() {
+    return !!e.env.Au;
+  }
+  const a = e.prototype = new Js();
+  re.reserveCodeRange(1e3, 1999, "model"), re.messages[1e3] = "Internal error. %1.", re.messages[1001] = 'Invalid syntax. "%1" expected, "%2" found.', re.messages[1002] = "Only one decimal separator can be specified.", re.messages[1003] = "Extra characters in input at position: %1, lexeme: %2, prefix: %3.", re.messages[1004] = 'Invalid character "%1" (%2) in input.', re.messages[1005] = "Misplaced thousands separator.", re.messages[1006] = "Invalid syntax. Expression expected, %1 found.", re.messages[1007] = 'Unexpected character: "%1" in "%2".', re.messages[1008] = 'The same character "%1" is being used as a thousands and decimal separators.', re.messages[1009] = 'Missing argument for "%1" command.', re.messages[1010] = "Expecting an operator between numbers.", re.messages[1011] = "Invalid grouping bracket. %1", re.messages[1012] = 'Misplaced subscript in "%1"', re.messages[1013] = 'Mismatched thousands separators: "%1" and "%2".', re.messages[1014] = 'Missing integration variable in "%1".';
+  const { message: o } = re;
+  e.create = a.create = function H(y, P, V) {
+    if (K(P instanceof Array || typeof P == "object" && (P.op || P instanceof e) || typeof P == "string", JSON.stringify(P)), K(P !== void 0, "1000: Internal error. Node undefined."), P instanceof e)
+      return V && (P.location = V), P;
+    let J;
+    return P instanceof Array ? (J = [], P.forEach((ne) => {
+      J.push(H(y, ne, V));
+    }), J) : this instanceof e ? (J = H(y, this), J.location = V, typeof P == "string" ? P = fi(y, P, e.env).expr() : P = JSON.parse(JSON.stringify(P)), Object.keys(e.fn).forEach((ne) => {
+      a[ne] || (a[ne] = function(...Pe) {
+        const tn = e.fn[ne];
+        if (Pe.length > 1 && Pe[1] instanceof e)
+          return tn.apply(this, Pe);
+        const mt = [this];
+        for (let Oe = 0; Oe < Pe.length; Oe++)
+          mt.push(Pe[Oe]);
+        return tn.apply(this, mt);
+      });
+    }), Object.keys(P).forEach((ne) => {
+      J[ne] = P[ne];
+    }), J) : new e().create(y, P, V);
+  }, e.fromLaTeX = a.fromLaTeX = function(y, P) {
+    return K(typeof P == "string", "1000: Model.prototype.fromLaTex"), this ? this.create(y, P) : e.create(y, P);
+  }, e.toLaTeX = a.toLaTeX = function(y) {
+    return N(y);
+  };
+  const i = {
+    ADD: "+",
+    SUB: "-",
+    MUL: "mul",
+    TIMES: "\\times",
+    // Special case for '*' and '\times' in literals.
+    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(i).forEach((H) => {
+    e[H] = i[H];
+  });
+  const l = {};
+  l[i.ADD] = "+", l[i.SUB] = "-", l[i.MUL] = "\\times", l[i.TIMES] = "\\times", l[i.DIV] = "\\div", l[i.FRAC] = "\\frac", l[i.EQL] = "=", l[i.ATAN2] = "\\atan2", l[i.POW] = "^", l[i.SUBSCRIPT] = "_", l[i.PM] = "\\pm", l[i.NOT] = "\\not", l[i.SIN] = "\\sin", l[i.COS] = "\\cos", l[i.TAN] = "\\tan", l[i.SEC] = "\\sec", l[i.COT] = "\\cot", l[i.CSC] = "\\csc", l[i.ARCSIN] = "\\arcsin", l[i.ARCCOS] = "\\arccos", l[i.ARCTAN] = "\\arctan", l[i.ARCSEC] = "\\arcsec", l[i.ARCCOT] = "\\arccot", l[i.ARCCSC] = "\\arccsc", l[i.SEC] = "\\sec", l[i.COT] = "\\cot", l[i.CSC] = "\\csc", l[i.SINH] = "\\sinh", l[i.COSH] = "\\cosh", l[i.TANH] = "\\tanh", l[i.ARCSINH] = "\\arcsinh", l[i.ARCCOSH] = "\\arccosh", l[i.ARCTANH] = "\\arctanh", l[i.ARCSECH] = "\\arcsech", l[i.ARCCSCH] = "\\arccsch", l[i.ARCCOTH] = "\\arccoth", l[i.SECH] = "\\sech", l[i.COTH] = "\\coth", l[i.CSCH] = "\\csch", l[i.LN] = "\\ln", l[i.COMMA] = ",", l[i.M] = "\\M", l[i.BINOM] = "\\binom", l[i.COLON] = "\\colon", l[i.INT] = "\\int", e.fold = function H(y, P) {
+    const V = [];
+    let J;
+    switch (y.args.forEach((ne) => {
+      V.push(H(ne, P));
+    }), y.args = V, y.op) {
+      case i.VAR:
+        (J = P[y.args[0]]) && (y = J);
+        break;
+    }
+    return y;
+  };
+  function p(H) {
+    return H >= 1 && H <= 31 && H !== 9 || H >= 127 && H <= 159;
+  }
+  function f(H) {
+    return H === Ge || H === Ye || H === Le || H === ut || H === kt || H === Dt || H === Lr || H === z;
+  }
+  function g(H) {
+    let y = "", P, V, J = 0;
+    for (; J < H.length; ) {
+      for (; J < H.length && m(P = H.charCodeAt(J++)); )
+        V !== 32 && (P = 9, V = P);
+      P === 92 && (y += String.fromCharCode(P), J < H.length && (P = H.charCodeAt(J++))), y += String.fromCharCode(P);
+    }
+    return y;
+  }
+  function m(H) {
+    return p(H);
+  }
+  function h(H) {
+    return H === 32 || H === 9 || H === 10 || H === 13;
+  }
+  function x(H) {
+    return H >= 48 && H <= 57;
+  }
+  const N = function H(y) {
+    let P = "";
+    if (typeof y == "string")
+      P = y;
+    else if (typeof y == "number")
+      P = y;
+    else if (typeof y == "object") {
+      const V = [];
+      switch (y.args.forEach((J) => {
+        V.push(H(J));
+      }), y.op) {
+        case i.NUM:
+        case i.VAR:
+          P = `${y.args[0]}`;
+          break;
+        case i.TEXT:
+          P = `\\text{${V[0]}}`;
+          break;
+        case i.SUBSCRIPT:
+          V.reverse().forEach((J, ne) => {
+            ne === V.length - 1 ? P = `${J}${P}` : P = `${l[y.op]}{${J}${P}}`;
+          });
+          break;
+        case i.SUB:
+          y.args.length === 1 ? P = `${l[y.op]}${V[0]}` : P = `${V[0]} ${l[y.op]} ${V[1]}`;
+          break;
+        case i.DIV:
+        case i.PM:
+        case i.EQL:
+          P = `${V[0]} ${l[y.op]} ${V[1]}`;
+          break;
+        case i.POW: {
+          const J = y.args[0], ne = y.args[1];
+          (J.args && J.args.length === 2 || ne.args && ne.args.length === 2) && (J.op === i.ADD || J.op === i.SUB || J.op === i.MUL || J.op === i.DIV || J.op === i.SQRT) && (V[0] = ` (${V[0]}) `), P = `{${V[0]}^{${V[1]}}}`;
+          break;
+        }
+        case i.SIN:
+        case i.COS:
+        case i.TAN:
+        case i.ARCSIN:
+        case i.ARCCOS:
+        case i.ARCTAN:
+        case i.ARCSEC:
+        case i.ARCCSC:
+        case i.ARCCOT:
+        case i.SEC:
+        case i.COT:
+        case i.CSC:
+        case i.SINH:
+        case i.COSH:
+        case i.TANH:
+        case i.ARCSINH:
+        case i.ARCCOSH:
+        case i.ARCTANH:
+        case i.ARCSECH:
+        case i.ARCCSCH:
+        case i.ARCCOTH:
+        case i.SECH:
+        case i.COTH:
+        case i.CSCH:
+        case i.LN:
+        case i.M:
+          P = `{${l[y.op]}{${V[0]}}}`;
+          break;
+        case i.FRAC:
+          P = `\\frac{${V[0]}}{${V[1]}}`;
+          break;
+        case i.BINOM:
+          P = `\\binom{${V[0]}}{${V[1]}}`;
+          break;
+        case i.SQRT:
+          switch (V.length) {
+            case 1:
+              P = `\\sqrt{${V[0]}}`;
+              break;
+            case 2:
+              P = `\\sqrt[${V[0]}]{${V[1]}}`;
+              break;
+          }
+          break;
+        case i.INTEGRAL:
+          V.length === 4 ? P = `\\int_{${V[0]}}^{${V[1]}} ${V[2]} d${V[3]}` : P = `\\int ${V[0]} d${V[1]}`;
+          break;
+        case i.VEC:
+          P = `\\vec{${V[0]}}`;
+          break;
+        case i.MUL: {
+          let J;
+          P = "", y.args.forEach((ne, Pe) => {
+            ne.args && ne.args.length >= 2 ? ((ne.op === i.ADD || ne.op === i.SUB) && (V[Pe] = `(${V[Pe]})`), Pe !== 0 && typeof ne == "number" ? P += `${l[y.op]} ` : y.isMixedNumber || y.isScientific && (P += "\\times "), P += V[Pe]) : (ne.op === i.PAREN || ne.op === i.VAR || typeof J == "number" && typeof ne != "number" || Pe !== 0 && (P += ` ${l[y.op]} `), P += V[Pe]), J = ne;
+          });
+          break;
+        }
+        case i.TIMES:
+        case i.CDOT:
+        case i.ADD:
+        case i.COMMA:
+          V.forEach((J, ne) => {
+            ne === 0 ? P = J : P = `${P}${l[y.op]} ${J}`;
+          });
+          break;
+        case i.NONE:
+          P = "";
+          break;
+        default:
+          K(!1, `1000: Unimplemented operator translating to LaTeX: ${y.op}`);
+          break;
+      }
+    } else
+      K(!1, "1000: Invalid expression type");
+    return P;
+  }, w = 32, U = 33, Q = 36, ee = 37, G = 40, Y = 42, ie = 43, Ce = 44, xe = 45, ve = 41, de = 46, Be = 47, Ae = 48, rt = 58, ct = 59, _e = 61, T = 63, C = 65, L = 91, B = 93, k = 94, j = 95, M = 97, Z = 123, q = 124, le = 125, he = 39, z = 0, fe = ie, we = k, Ue = j, Je = de, Pt = 261, Gt = 264, $e = 265, Xe = 256, vt = Be, us = _e, Er = 263, be = Z, Se = q, pe = L, Ve = G, fs = Y, ht = Ae, qt = 258, Ye = le, Le = B, Ge = ve, Rr = 262, Nr = 259, Cn = 257, et = xe, Sr = 260, nt = M, li = C, Wt = Ce, ps = ee, ui = T, gs = U, Xt = rt, Or = ct, wr = 267, br = 268, st = 269, Qt = 270, jt = 271, Ir = 272, Zt = 273, xn = 274, An = 275, Tn = 276, Mr = 277, En = 278, Rn = 279, Nn = 280, zt = 281, Sn = 282, hs = 283, It = 284, On = 285, kt = 286, Dt = 287, ds = 288, Lr = 289, wn = 290, Jt = 291, Yt = 292, er = 293, yr = 294, tr = 295, bn = 296, In = 297, Mn = 298, Pr = 299, vr = 300, rr = 301, Ln = 302, ms = 303, nr = 304, yn = 305, Pn = 306, kr = 307, Dr = 308, Fr = 309, Br = 310, _r = 311, Ur = 312, $r = 313, Vr = 314, Hr = 315, Cs = 332, vn = 333, Kr = 334, Gr = 335, qr = 336, sr = 337, ir = 338, ar = 339, kn = 340, or = 341, Dn = 342, cr = 343, Fn = 344, Bn = 345, _n = 346, Un = 347, $n = 348, Vn = 349, Hn = 350, lr = 351, Kn = 352, Gn = 353, qn = 354, Wn = 355, Wr = 356, Xr = 357, Qr = 358, jr = 359, Zr = 360, zr = 361, Jr = 362, Xn = 363, Yr = 364, en = 365, ur = 366, Qn = 367, fr = 368, ye = 369, He = 370, Ie = 371, lt = 372, Ft = 373, xs = 374, pr = 375, ut = 376, gr = 377, Bt = 378, Mt = 379, E = {};
+  E[vt] = i.FRAC, E[Xe] = i.FRAC, E[Cn] = i.SQRT, E[wn] = i.VEC, E[fe] = i.ADD, E[et] = i.SUB, E[qt] = i.PM, E[lr] = i.NOT, E[we] = i.POW, E[Ue] = i.SUBSCRIPT, E[fs] = i.MUL, E[nr] = i.CDOT, E[Ft] = i.TIMES, E[yr] = i.DIV, E[Nr] = i.SIN, E[Pt] = i.COS, E[Sr] = i.TAN, E[Jt] = i.ARCSIN, E[Yt] = i.ARCCOS, E[er] = i.ARCTAN, E[sr] = i.ARCSEC, E[ir] = i.ARCCSC, E[ar] = i.ARCCOT, E[Rr] = i.SEC, E[Gt] = i.COT, E[$e] = i.CSC, E[kr] = i.SINH, E[Dr] = i.COSH, E[Fr] = i.TANH, E[$r] = i.ARCSINH, E[Vr] = i.ARCCOSH, E[Hr] = i.ARCTANH, E[Kr] = i.ARCSECH, E[Gr] = i.ARCCSCH, E[qr] = i.ARCCOTH, E[Br] = i.SECH, E[_r] = i.COTH, E[Ur] = i.CSCH, E[Er] = i.LN, E[wr] = i.LG, E[br] = i.LOG, E[us] = i.EQL, E[Wt] = i.COMMA, E[st] = i.TEXT, E[fr] = i.OPERATORNAME, E[Qt] = i.LT, E[jt] = i.LE, E[Ir] = i.GT, E[Zt] = i.GE, E[rr] = i.NE, E[yn] = i.NGTR, E[Pn] = i.NLESS, E[vn] = i.NI, E[Un] = i.SUBSETEQ, E[$n] = i.SUPSETEQ, E[Vn] = i.SUBSET, E[Hn] = i.SUPSET, E[Ln] = i.APPROX, E[Bn] = i.PERP, E[_n] = i.PROPTO, E[Kn] = i.PARALLEL, E[Gn] = i.NPARALLEL, E[qn] = i.SIM, E[Wn] = i.CONG, E[xn] = i.EXISTS, E[An] = i.IN, E[Tn] = i.FORALL, E[Mr] = i.LIM, E[En] = i.EXP, E[Rn] = i.TO, E[Se] = i.PIPE, E[Nn] = i.SUM, E[zt] = i.INTEGRAL, E[Sn] = i.PROD, E[or] = i.CUP, E[Dn] = i.BIGCUP, E[cr] = i.CAP, E[Fn] = i.BIGCAP, E[hs] = i.M, E[Xn] = i.IMPLIES, E[ur] = i.CAPRIGHTARROW, E[It] = i.RIGHTARROW, E[Wr] = i.LEFTARROW, E[Xr] = i.LONGRIGHTARROW, E[Qr] = i.LONGLEFTARROW, E[jr] = i.OVERRIGHTARROW, E[Zr] = i.OVERLEFTARROW, E[Yr] = i.LEFTRIGHTARROW, E[en] = i.CAPLEFTRIGHTARROW, E[zr] = i.LONGLEFTRIGHTARROW, E[Jr] = i.OVERLEFTRIGHTARROW, E[gs] = i.FACT, E[On] = i.BINOM, E[kt] = i.ROW, E[Dt] = i.COL, E[Xt] = i.COLON, E[Or] = i.SEMICOLON, E[tr] = i.TYPE, E[bn] = i.OVERLINE, E[gr] = i.DOT, E[In] = i.OVERSET, E[Mn] = i.UNDERSET, E[Pr] = i.BACKSLASH, E[vr] = i.MATHBF, E[kn] = i.MATHFIELD, E[Qn] = i.DELTA;
+  function b(H, y) {
+    return {
+      op: H,
+      args: y
+    };
+  }
+  const dt = b(e.NONE, [b(e.VAR, ["None"])]), fi = function(y, P, V) {
+    const J = Object.keys(V);
+    J.push("to"), P = g(P);
+    function ne(s, c) {
+      let u = "";
+      if (e.option(y, "allowThousandsSeparator") || e.option(y, "setThousandsSeparator")) {
+        let R = e.option(y, "setThousandsSeparator");
+        R = [].concat(R !== void 0 ? R : ","), R.indexOf(s) >= 0 && (K(!c || s === c, o(1013, [c, s])), u = s);
+      }
+      return u;
+    }
+    function Pe(s) {
+      const c = e.option(y, "setDecimalSeparator"), u = e.option(y, "setThousandsSeparator");
+      if (typeof c == "string") {
+        K(c.length === 1, o(1002));
+        const R = c;
+        return u instanceof Array && u.indexOf(R) >= 0 && K(!1, o(1008, [R])), s === R;
+      }
+      return c instanceof Array ? (c.forEach((R) => {
+        u instanceof Array && u.indexOf(R) >= 0 && K(!1, o(1008, [R]));
+      }), c.indexOf(s) >= 0) : u instanceof Array && u.indexOf(".") >= 0 || u === "." ? (K(c === void 0, o(1008, ["."])), s === ",") : s === ".";
+    }
+    const tn = b(e.NUM, ["Infinity"]);
+    function mt(s, c, u, R) {
+      if (c === "\\infty")
+        return tn;
+      let A = "", S, D, te, Te = 0, ce = "integer";
+      for (c === "." && K(!1, o(1004, [c, c.charCodeAt(0)])), S = 0; S < c.length; S++)
+        ne(D = c.charAt(S)) ? ((Te && te !== S - 4 || !Te && S > 4) && K(!1, o(1005)), te = S, Te++) : (Pe(D) && (ce === "decimal" && K(!1, o(1007, [D, A + D])), D = ".", ce = "decimal", Te && te !== S - 4 && K(!1, o(1005)), te = S, Te++), A += D);
+      ce !== "decimal" && te && te !== S - 4 && K(!1, o(1005)), A = String(A);
+      const se = e.option(s, "strict") && c || A;
+      return {
+        op: e.NUM,
+        args: [se],
+        separatorCount: Te,
+        lastSeparatorIndex: te,
+        numberFormat: ce
+      };
+    }
+    function Oe(s, c) {
+      return s.length === 0 && (s = [_t]), Re(e.MUL, s, c);
+    }
+    function ft(s, c) {
+      return K(c.length === 1, "1000: Wrong number of arguments for unary node"), b(s, c);
+    }
+    function Re(s, c, u) {
+      if (K(c.length > 0, "1000: Too few argument for binary node"), c.length < 2)
+        return c[0];
+      let R = [];
+      return c.forEach((A) => {
+        u && A.op === s && A.args.length > 1 ? R = R.concat(A.args) : R.push(A);
+      }), b(s, R);
+    }
+    const _t = mt(y, "1"), As = mt(y, "-1");
+    let hr = z, Lt = z, dr, jn;
+    const Ct = Mi(P);
+    function pi(s) {
+      hr = Ct.start(s), dr = Ct.lexeme();
+    }
+    function I() {
+      return hr;
+    }
+    function ke() {
+      return K(dr !== void 0, `1000: Lexeme for token T0=${hr} is missing.`), dr;
+    }
+    function v(s) {
+      Lt === z ? (hr = Ct.start(s), dr = Ct.lexeme()) : (K(jn !== void 0, `1000: Lexeme for token=${Lt} is missing.`), hr = Lt, dr = jn, Lt = z);
+    }
+    function me(s) {
+      return Lt === z && (Lt = Ct.start(s), jn = Ct.lexeme()), Lt;
+    }
+    function ae(s, c) {
+      const u = I();
+      if (u !== s) {
+        const R = String.fromCharCode(s), A = u ? String.fromCharCode(u) : "EOS";
+        K(!1, o(1001, [`${R}[${s}]`, `${A}[${u}]`]));
+      }
+      v(c);
+    }
+    function Ts(s) {
+      if (s.op === e.FRAC && (s.args[0].op === e.NUM || s.args[1].op === e.NUM)) {
+        const c = (s.args[0].op === e.SUB || s.args[0].op === e.ADD) && s.args[0].args.length === 1 && s.args[0].args[0] || s.args[0], u = (s.args[1].op === e.SUB || s.args[1].op === e.ADD) && s.args[1].args.length === 1 && s.args[1].args[0] || s.args[1];
+        return c.op === e.NUM && c.numberFormat === "integer" && u.op === e.NUM && u.numberFormat === "integer" && +u.args[0] != 0;
+      }
+      return !1;
+    }
+    function gi(s) {
+      if (s.op === e.FRAC) {
+        const c = s.args[0], u = s.args[1];
+        return c.op === e.NUM && c.numberFormat === "integer" && u.op === e.NUM && u.numberFormat === "integer" && +c.args[0] < u.args[0];
+      }
+      return !1;
+    }
+    const hi = ["K", "C", "F"], di = ["g", "L", "m", "s"];
+    function xt() {
+      let s, c, u, R, A, S = [], D, te, Te, ce;
+      switch (u = I()) {
+        case li:
+        case nt:
+          if (S = [ke()], v(), I() === ht) {
+            const se = S[0].toUpperCase() + ke(), Qe = J.some((F) => F.indexOf(se) === 0);
+            c = b(e.VAR, S), Qe && (c = Oe([c, mt(y, ke())]), v());
+          } else
+            S[0] === "\\emptyset" ? S[0] = "\\varnothing" : S[0] === "\\mu" && I() === st && di.includes(ke()) ? (S[0] = `\\mu${ke()}`, v()) : S[0] === "\\degree" && I() === st && hi.includes(ke()) && (S[0] = `\\degree ${ke()}`, v()), c = b(e.VAR, S), n() && I() === be && me() === Ye && (ae(be), ae(Ye));
+          break;
+        case st:
+          S = [ke()], v(), c = b(e.TEXT, [b(e.VAR, S)]);
+          break;
+        case ht:
+          c = mt(y, ke()), v();
+          break;
+        case ye:
+          me() === be || me() === Ie ? c = oe(u) : me() === Se ? c = it(u) : c = ze(u);
+          break;
+        case tr:
+          c = b(e.TYPE, [b(e.VAR, [ke()])]), v();
+          break;
+        case pe:
+        case Ve:
+        case pr:
+          c = ze(u);
+          break;
+        case Le:
+          zn ? c = dt : c = ze(u);
+          break;
+        case be:
+        case Ie:
+          c = oe(u);
+          break;
+        case ds: {
+          v();
+          const se = oe();
+          if (se.op === e.VAR) {
+            if (se.args[0].indexOf("array") === 0) {
+              if (I() === be) {
+                for (; I() !== Ye; )
+                  v();
+                v();
+              }
+            } else if (se.args[0].indexOf("matrix") >= 0 && I() === pe) {
+              for (; I() !== Le; )
+                v();
+              v();
+            }
+          }
+          const Qe = mi();
+          ae(Lr), oe(), se.op === e.VAR && (se.args[0].indexOf("matrix") >= 0 || se.args[0].indexOf("array") === 0 ? c = b(e.MATRIX, [Qe]) : K(!1, "1000: Unrecognized LaTeX name"));
+          break;
+        }
+        case Se:
+          c = it();
+          break;
+        case ms:
+          v(), c = ft(e.ABS, [oe()]);
+          break;
+        case Xe:
+          v(), te = oe(), Te = oe(), te = te.args.length === 0 ? b(e.COMMA, [dt]) : te, Te = te.args.length === 0 ? b(e.COMMA, [dt]) : Te, c = b(e.FRAC, [te, Te]), c.isFraction = Ts(c);
+          break;
+        case On: {
+          v();
+          const se = oe(), Qe = oe();
+          c = Re(e.BINOM, [se, Qe]);
+          break;
+        }
+        case Cn:
+          switch (v(), I()) {
+            case pe: {
+              const se = Ci(), Qe = oe();
+              c = b(e.SQRT, [Qe, se]);
+              break;
+            }
+            case be:
+              A = oe(), c = b(e.SQRT, [A, b(e.NUM, ["2"])]);
+              break;
+            default:
+              K(!1, o(1001, ["{ or (", String.fromCharCode(I())]));
+              break;
+          }
+          break;
+        case wn:
+          v(), c = b(e.VEC, [oe()]);
+          break;
+        case fr: {
+          const se = ke();
+          v(), c = b(e.OPERATORNAME, [b(e.VAR, [se]), xt()]);
+          break;
+        }
+        case Nr:
+        case Pt:
+        case Sr:
+        case Rr:
+        case Gt:
+        case $e:
+        case kr:
+        case Dr:
+        case Fr:
+        case Br:
+        case _r:
+        case Ur:
+          for (v(); I() === we; )
+            v({ oneCharToken: !0 }), S.push(At());
+          return S.length === 1 && ws(S[0]) ? (R = `arc${E[u]}`, S.pop()) : R = E[u], (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.unshift(b(R, [c]))) : (s = I()) === be || s === Ie ? S.unshift(b(R, [oe(s)])) : (s = I()) === Ve || s === pe ? S.unshift(b(R, [ze(s)])) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.unshift(b(R, [D]))), S.length > 1 ? c = b(e.POW, S) : c = S[0], ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
+        case Jt:
+        case Yt:
+        case er:
+        case sr:
+        case ir:
+        case ar:
+        case $r:
+        case Vr:
+        case Hr:
+        case Kr:
+        case Gr:
+        case qr:
+          for (v(); (s = I()) === we; )
+            v({ oneCharToken: !0 }), S.push(At());
+          return (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.unshift(b(E[u], [c]))) : (s = I()) === be || s === Ie ? S.unshift(b(E[u], [oe(s)])) : (s = I()) === Ve || s === pe ? S.unshift(b(E[u], [ze(s)])) : (s = I()) === Se ? S.unshift(b(E[u], [it(s)])) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.unshift(b(E[u], [D]))), S.length > 1 ? c = b(e.POW, S) : c = S[0], ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
+        case Er:
+          return v(), (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.push(c)) : (s = I()) === be || s === Ie ? S.push(oe(s)) : (s = I()) === Ve || s === pe ? S.push(ze(s)) : (s = I()) === Se ? S.push(it(s)) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.push(D)), c = b(e.LOG, [b(e.VAR, ["e"])].concat(S)), ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
+        case wr:
+          return v(), (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.push(c)) : (s = I()) === be || s === Ie ? S.push(oe(s)) : (s = I()) === Ve || s === pe ? S.push(ze(s)) : (s = I()) === Se ? S.push(it(s)) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.push(D)), c = b(e.LOG, [b(e.NUM, ["10"])].concat(S)), ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
+        case br:
+          return v(), (s = I()) === Ue ? (v({ oneCharToken: !0 }), S.push(xt())) : S.push(b(e.NUM, ["10"])), (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.push(c)) : (s = I()) === be || s === Ie ? S.push(oe(s)) : (s = I()) === Ve || s === pe ? S.push(ze(s)) : (s = I()) === Se ? S.push(it(s)) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.push(D)), c = b(e.LOG, S), ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
+        case Mr:
+          return wi();
+        case zt:
+        case Bt:
+        case Mt:
+          return on();
+        case Nn:
+        case Sn:
+        case or:
+        case Dn:
+        case cr:
+        case Fn:
+          return v(), I() === Ue && (v({ oneCharToken: !0 }), S.push(xt()), I() === we && (ae(we, { oneCharToken: !0 }), S.push(xt()))), S.push(De()), b(E[u], S);
+        case xn:
+          return v(), b(e.EXISTS, [Ar()]);
+        case Tn:
+        case ur:
+        case It:
+        case Wr:
+        case Xr:
+        case Qr:
+        case jr:
+        case Zr:
+        case en:
+        case Yr:
+        case zr:
+        case Jr:
+          return v(), b(E[u], [$t()]);
+        case En:
+          return v(), b(e.EXP, [an()]);
+        case hs:
+          return v(), b(e.M, [De()]);
+        case Cs:
+          return v(), b(e.FORMAT, [oe()]);
+        case bn:
+          return v(), b(e.OVERLINE, [oe()]);
+        case gr:
+          v();
+          {
+            let se, Qe = "";
+            se = oe(), K(se.op === e.NUM), Qe += se.args[0], I() === ht && me() === gr && (se = xt(), K(se.op === e.NUM), Qe += se.args[0]), I() === gr && (v(), se = oe(), K(se.op === e.NUM), Qe += se.args[0]), D = b(e.OVERLINE, [mt(y, Qe)]);
+          }
+          return D;
+        case kn:
+          return v(), b(E[u], [oe()]);
+        case In:
+        case Mn:
+          return v(), te = oe(), Te = oe(), Te.args.push(b(E[u], [te])), Te;
+        case vr:
+          return v(), te = oe(), b(e.MATHBF, [te]);
+        case ui:
+          return v(), b(e.VAR, ["?"]);
+        case Qn: {
+          v();
+          let se;
+          return I() === nt ? (se = ke(), v()) : se = "", b(e.VAR, [`Delta_${se}`]);
+        }
+        case Je:
+          return v(), dt;
+        default:
+          K(!e.option(y, "strict"), o(1006, [u])), c = dt;
+          break;
+      }
+      return c;
+    }
+    function mi() {
+      const s = [];
+      for (s.push(Es()); I() === kt; )
+        v(), s.push(Es());
+      return b(E[kt], s);
+    }
+    function Es() {
+      const s = [];
+      for (s.push($t()); I() === Dt; )
+        v(), s.push(Ar());
+      return b(E[Dt], s);
+    }
+    let Zn = 0;
+    function it(s) {
+      s = s || Se, Zn++, ae(s);
+      let c, u;
+      s === ye ? ae(c = I()) : c = s;
+      const R = an();
+      return ae(u = s === ye && He || c), u === He && ae(u = c), Zn--, ft(e.ABS, [R]);
+    }
+    function oe(s) {
+      s = s || be, ae(s);
+      let c, u;
+      s === ye ? ae(c = I() === Ie && Ie || be) : c = s;
+      let R;
+      return I() === He || I() === Ye || I() === lt ? (ae(u = I()), u === He && ae(u = I() === Je && Je || I() === lt && lt || Ye), R = b(e.COMMA, [])) : (R = $t(), ae(u = s === ye && He || s === Ie && lt || Ye), u === He && ae(u = I() === Je && Je || I() === lt && lt || Ye), R.op === dt.op && R.args[0] === dt.args[0] && (R = b(e.COMMA, []))), R.lbrk = c, R.rbrk = u, R;
+    }
+    let mr = 0;
+    function Ci(s) {
+      s = s || pe, K(s === ye || s === pe, "1000: Internal error"), mr++, ae(s);
+      let c;
+      s === ye && ae(pe);
+      const u = $t();
+      return ae(c = s === ye && ye || Le), c === He && ae(c = Le), mr--, u;
+    }
+    let zn;
+    function ze(s) {
+      mr++, ae(s);
+      let c, u, R;
+      s === ye ? (ae(c = I()), R = !0) : c = s;
+      let A;
+      if (I() === He || I() === Ge || I() === Le ? (ae(u = R && He || I()), u === He && ae(u = c === Ve && Ge || c === pe && Le || c === pr && ut), A = b(e.COMMA, [])) : (zn = !0, A = $t(!0), ae(u = R && He || I() === Ge && Ge || I() === ut && ut || s === ye && He || I() === pe && pe || Le), u === He && ae(u = I() === Ge && Ge || I() === ut && ut || I() === pe && pe || Le)), c = c === Le ? Ve : c, u = u === pe ? Ge : u, (c === Ve || c === pe || c === Le) && (u === Ge || u === Le || u === pe)) {
+        const S = A.op === e.COMMA && A.args.length === 2 && (c === Ve && u === Ge && e.INTERVALOPEN || c === pe && u === Le && e.INTERVAL) || c === Ve && u === Ge && e.PAREN || c === pe && u === Le && e.BRACKET || c === Ve && u === Le && e.INTERVALLEFTOPEN || c === pe && u === Ge && e.INTERVALRIGHTOPEN;
+        A = b(S, [A]);
+      } else if (A.lbrk === Je && A.rbrk === Se)
+        A = b(e.EVALAT, [A]);
+      else if (c === pr && u === ut)
+        A = b(e.ANGLEBRACKET, [A]);
+      else if (A.op === e.COMMA || c === Ve || c === pe) {
+        K(c === Ve && u === Ge || c === pe && u === Le || c === u, o(1011, [`tk1=${c} tk2=${u}`]));
+        const S = c === pe && e.BRACKET || e.PAREN;
+        A = b(S, [A]);
+      }
+      return mr--, zn = !1, A.lbrk = c, A.rbrk = u, A;
+    }
+    function Rs() {
+      const s = [xt()];
+      for (; I() === we; ) {
+        v({ oneCharToken: !0 });
+        let u;
+        if ((Ai(s[0]) || n()) && ((u = I()) === fe || u === et))
+          v(), s.push(ft(E[u], [_t]));
+        else {
+          let R = At();
+          R.op === e.VAR && R.args[0] === "\\circ" && (I() === st && (ke() === "K" || ke() === "C" || ke() === "F") ? (R = Oe([
+            s.pop(),
+            ft(e.VAR, [`\\degree ${ke()}`])
+          ]), v()) : R = Oe([
+            s.pop(),
+            ft(e.VAR, ["\\degree"])
+          ])), s.push(R);
+        }
+      }
+      if (s.length > 1) {
+        let u = s.pop();
+        return s.reverse().forEach((R) => {
+          u = b(e.POW, [R, u]);
+        }), u.isPolynomial = Ut(u), u;
+      }
+      const c = s[0];
+      return c.isPolynomial = Ut(c), c;
+    }
+    function Ns() {
+      let s, c = Rs();
+      switch (s = I()) {
+        case ps:
+          v(), c = b(e.PERCENT, [c]);
+          break;
+        case gs:
+          v(), c = b(e.FACT, [c]);
+          break;
+        default:
+          if (s === Se && me() === Ue) {
+            v();
+            const u = [c];
+            v({ oneCharToken: !0 }), u.push(b(e.SUBSCRIPT, [Ar()])), c = b(e.PIPE, u);
+          } else n() && (s === fe || s === et) && me() === Ye && (v(), c = ft(E[s], [c]));
+          break;
+      }
+      return c;
+    }
+    function xi(s) {
+      return s === fe || s === et || s === Wt || s === Ye || s === Ge || s === Le || s === ut || s === He || s === z;
+    }
+    function At() {
+      let s, c, u;
+      switch (s = I()) {
+        case fe:
+        case lr:
+        case et:
+          v(), c = b(E[s], [At()]);
+          break;
+        case qt:
+          v(), c = De(!0), c = b(E[s], [c]);
+          break;
+        case Ue:
+          if (u = E[s], v({ oneCharToken: !0 }), (s = I()) === fe || s === et ? (v(), c = _t) : c = At(), c = b(u, [c]), (s = I()) === we) {
+            const R = [c];
+            u = E[s], v({ oneCharToken: !0 }), (s = I()) === fe || s === et ? (v(), c = _t) : c = At(), R.push(c), c = b(u, R);
+          }
+          break;
+        case we:
+          u = E[s], v({ oneCharToken: !0 }), (s = I()) === fe || s === et ? (v(), c = _t) : c = At(), c = b(u, [c]);
+          break;
+        default:
+          s === nt && ke() === "$" ? (v(), xi(I()) ? c = b(e.VAR, ["$"]) : (c = Oe([b(e.VAR, ["$"]), Ns()]), c.args[1].isPolynomialTerm = !0)) : c = Ns();
+          break;
+      }
+      return c;
+    }
+    function Ss() {
+      const s = [At()];
+      for (; I() === Ue; )
+        v({ oneCharToken: !0 }), s.push(Rs()), n() && I() === be && (ae(be), ae(Ye));
+      let c;
+      return s.length === 1 ? (c = s[0], K(c.op !== e.SUBSCRIPT || c.args.length !== 1, o(1012, [P]))) : c = u(s), c;
+      function u(R) {
+        let A, S;
+        return R.forEach((D) => {
+          D.op === e.SUBSCRIPT && (D = u(D.args));
+          let te, Te;
+          D.op === e.POW && !D.lbrk ? (A = D.args[1], te = S && S.op === e.SUBSCRIPT && S.args || S && [S] || [], Te = D.args[0].op === e.SUBSCRIPT && D.args[0].args || [D.args[0]]) : S && S.op === e.POW ? (A = S.args[1], te = S.args[0].op === e.SUBSCRIPT && S.args[0].args || [S.args[0]], Te = D.op === e.SUBSCRIPT && D.args || [D]) : (te = S && S.op === e.SUBSCRIPT && S.args || S && [S] || [], Te = D.op === e.SUBSCRIPT && D.args || [D]);
+          const ce = te.concat(Te);
+          S = ce.length > 1 && b(e.SUBSCRIPT, ce) || ce[0];
+        }), A && Re(e.POW, [S, A]) || S;
+      }
+    }
+    function Jn() {
+      let s, c = Ss();
+      if (Is(c))
+        return Ms(c);
+      if (Cr(c) && (I() === Xe || I() === ht && me() === vt)) {
+        let u = Jn();
+        if (Is(u))
+          return Ms(u);
+        if (Ls(c, u)) {
+          let R;
+          u.op === e.PERCENT && (u = u.args[0], R = !0);
+          let A;
+          es(c) && (A = !0, c = sn(c)), c = Re(e.ADD, [c, u]), c.isMixedNumber = !0, A && (c = sn(c)), R === !0 && (c = b(e.PERCENT, [c]));
+        } else
+          c = Re(e.MUL, [c, u]), u.isImplicit = !0;
+      }
+      for (; (s === void 0 || s === I()) && (s = I()) === vt; )
+        v(), c = b(E[s], [c, Ss()]), c.isFraction = Ts(c), c.isSlash = s === vt;
+      return c.op === e.FRAC && c.args[1].op === e.PERCENT && (c = b(e.PERCENT, [
+        b(e.FRAC, [c.args[0], c.args[1].args[0]])
+      ])), c;
+    }
+    function Ai(s) {
+      if (s.op !== e.VAR)
+        return !1;
+      const c = e.env[s.args[0]];
+      return !!(c && c.name);
+    }
+    function Os(s, c) {
+      return K(typeof c > "u" || typeof c == "string", "1000: Invalid id"), s.op === e.VAR ? c === void 0 ? !0 : s.args[0] === c : s.op === e.POW && Os(s.args[0]) && rn(s.args[1]) ? c === void 0 ? !0 : s.args[0].args[0] === c : !1;
+    }
+    function Ti(s) {
+      return s.op === e.NUM && (s.args[0] === "1" || s.args[0] === "1.");
+    }
+    function ws(s) {
+      return s.op === e.SUB && s.args.length === 1 && Ti(s.args[0]);
+    }
+    function bs(s) {
+      return s === fs || s === yr || s === vt || s === Ft || s === nr;
+    }
+    function Ei(s) {
+      return s === Nr || s === Pt || s === Sr || s === Rr || s === Gt || s === $e || s === kr || s === Dr || s === Fr || s === Br || s === _r || s === Ur || s === Jt || s === Yt || s === er || s === sr || s === ar || s === ir || s === $r || s === Vr || s === Hr || s === Kr || s === qr || s === Gr || s === Er || s === br || s === wr;
+    }
+    function Is(s) {
+      if (s.op !== e.FRAC)
+        return !1;
+      const c = s.args[0], u = c.op === e.MUL && c.args[0].op === e.VAR && c.args[0].args[0] || c.op === e.VAR && c.args[0] || c.op === e.POW && c.args[0].op === e.VAR && c.args[0].args[0], R = s.args[1], A = R.op === e.MUL && R.args[0].op === e.VAR && R.args[0].args[0];
+      return u === "d" && A === "d" && (R.args[1] && R.args[1].op === e.VAR || R.args[1] && R.args[1].op === e.POW && R.args[1].args[0] && R.args[1].args[0].op === e.VAR);
+    }
+    function Ms(s) {
+      if (s.op !== e.FRAC)
+        return null;
+      const c = s.args[0], u = s.args[1], R = c.op === e.MUL && Oe(c.args.slice(1)) || De();
+      K(u.args.length === 2);
+      const A = u.args[1], S = A.op === e.POW && A.args[0] || A, D = A.op === e.POW && A.args[1] || _t;
+      return s = b(e.DERIV, [R, S, D]), s;
+    }
+    function De(s = !1) {
+      let c, u, R = !1, A = [], S;
+      u = Jn(), A = [u];
+      let D = 0;
+      for (; (c = I()) && !ts(c) && !Ps(c) && !ks(c) && c !== Wt && c !== Or && c !== Xt && !vs(c) && c !== Ye && c !== lt && c !== Ge && c !== He && c !== ut && !((c === pe || c === Le) && mr > 0) && c !== It && c !== ur && c !== Qt && !(c === Se && Zn > 0) && c !== kt && c !== Dt && c !== Lr && !(s && (bs(c) || Ei(c) || c === Ve || c === ye || c === pe || c === pr || c === vr) || qe(y, tt(u))); ) {
+        if (R = !1, bs(c) && (v(), R = !0), u = Jn(), (c === nr || c === Ft || c === yr) && (u = Re(E[c], [A.pop(), u], !0)), R || A.length === 0 || u.lbrk || A[A.length - 1].op !== e.NUM || !(A[A.length - 1].numberFormat === "decimal" && A[A.length - 1].lastSeparatorIndex === A[A.length - 1].args[0].length - 1) || A[A.length - 1].lastSeparatorIndex === A[A.length - 1].args[0].length || A[A.length - 1].lbrk || Yn([A[A.length - 1], u]) || u.op !== e.NUM || K(!1, "Shouldn't get here"), K(R || A.length === 0 || u.lbrk || A[A.length - 1].op !== e.NUM || A[A.length - 1].lbrk || Yn([A[A.length - 1], u]) || u.op !== e.NUM, o(1010)), n() && c === Ve && Os(A[A.length - 1], "M"))
+          A.pop(), u = ft(e.M, [u]);
+        else if (!R && A.length > 0)
+          if (A.length > 0 && Ls(A[A.length - 1], u))
+            c = A.pop(), es(c) && (u = Re(e.MUL, [As, u])), u = Re(e.ADD, [c, u]), u.isMixedNumber = !0;
+          else if (A.length > 0 && A[A.length - 1].op === e.VAR && u.op === e.VAR && u.args[0].indexOf("'") === 0)
+            u = Re(e.POW, [A.pop(), u]), u.isImplicit = u.args[0].isImplicit;
+          else if (A.length > 0 && (A[A.length - 1].op === e.MUL || A[A.length - 1].op === e.DOT) && // 2x', 2*x', 2\cdot x'
+          A[A.length - 1].args[A[A.length - 1].args.length - 1].op === e.VAR && u.op === e.VAR && u.args[0].indexOf("'") === 0)
+            c = A.pop(), u = Oe(c.args.concat(Re(e.POW, [c.args.pop(), u]))), u.isImplicit = u.args[0].isImplicit;
+          else if (A.length > 0 && A[A.length - 1].op === e.VAR && u.op === e.POW && u.args[0].op === e.VAR && u.args[0].args[0].indexOf("'") === 0)
+            u = b(e.POW, [Re(e.POW, [A.pop(), u.args[0]])].concat(u.args.slice(1)));
+          else if (A.length > 0 && (S = Yn([A[A.length - 1], u])))
+            A.pop(), u = S;
+          else if (Oi(A, u)) {
+            const Te = A.pop();
+            u = Re(e.POW, [mt(y, "10"), At()]), u = Re(e.TIMES, [Te, u]), ys(u.args) && (u.isScientific = !0);
+          } else u.op === e.VAR && u.args[0] === "\\degree" && A.length === 1 && A[0].op === e.SUB && A[0].args.length === 1 ? (u = ft(e.SUB, [Oe([A[0].args[0], u])]), A.pop()) : u = Oe([A.pop(), u], !0);
+        else (c === Ft || c === nr) && ys(u.args) && (u.isScientific = !0);
+        A.push(u), K(D++ < 1e3, "1000: Stuck in loop in multiplicativeExpr()");
+      }
+      const te = A[0];
+      return te.op === e.MUL && te.args.length > 1 ? Ri(te) : te;
+    }
+    function Ri(s) {
+      K(s.op === e.MUL, "1000: Internal error");
+      let { args: c } = s, u = c[0];
+      return u.op === e.COMMA && u.args.length === 0 && (c = c.slice(1, c.length), c[0].isImplicit = !1), u = c[c.length - 1], u.op === e.COMMA && u.args.length === 0 && (c = c.slice(0, c.length - 1)), b(s.op, c);
+    }
+    function Cr(s) {
+      return (s.op === e.SUB || s.op === e.ADD) && s.args.length === 1 && (s = s.args[0]), s.op === e.NUM ? s : !1;
+    }
+    function Ls(s, c) {
+      return (s.op === e.SUB || s.op === e.ADD) && s.args.length === 1 && (s = s.args[0]), c.op === e.PERCENT && (c = c.args[0]), !!(s.op === e.NUM && gi(c));
+    }
+    function rn(s) {
+      let c;
+      return s ? ((s.op === e.SUB || s.op === e.ADD) && s.args.length === 1 && (s = s.args[0]), s.op === e.NUM && (c = new ue(s.args[0])) && rn(c) ? !0 : s instanceof ue ? s.modulo(Si).cmp(Ni) === 0 : !1) : !1;
+    }
+    const Ni = new ue("0"), Si = new ue("1");
+    function Ut(s) {
+      let c = 0;
+      if (s.op === e.POW) {
+        const u = s.args[0], R = s.args[1];
+        (u.op === e.VAR || u.isPolynomial || u.op === e.PAREN && Ut(u.args[0])) && rn(R) && (c = parseInt(R.args[0], 10));
+      } else s.op === e.VAR ? c = 1 : s.op === e.ADD || s.op === e.SUB ? s.args.forEach((u) => {
+        const R = Ut(u);
+        c = R > c && R || c;
+      }) : s.op === e.MUL && s.args.forEach((u) => {
+        const R = Ut(u);
+        c = R > c && R || c;
+      });
+      return c;
+    }
+    function nn(s) {
+      return s.op === e.MUL || s.op === e.TIMES || s.op === e.CDOT;
+    }
+    function Yn(s) {
+      if (!Cr(s[0]))
+        return null;
+      let c, u = !1;
+      s[0].op === e.SUB && s[0].args[0].op === e.NUM && (s[0] = s[0].args[0], u = !0), nn(s[0]) && s[0].args[s[0].args.length - 1].numberFormat === "decimal" && (c = s[0].args.slice(0, s[0].args.length - 1), s = s[0].args.slice(s[0].args.length - 1).concat(s[1]));
+      let R, A, S;
+      if (!s[0].lbrk && (s[0].op === e.NUM && s[0].numberFormat === "decimal" || s[0].op === e.VAR && s[0].args[0] === "?" || s[0].op === e.TYPE && s[0].args[0].op === e.VAR && s[0].args[0].args[0] === "decimal")) {
+        if (!s[1].lbrk && s[1].op === e.OVERLINE)
+          A = s[0], S = s[1].args[0];
+        else
+          return null;
+        A.isRepeating = !0, S.isRepeating = !0, R = Re(e.ADD, [A, S]), R.numberFormat = "decimal", R.isRepeating = !0, c && (R = Oe(c.concat(R)));
+      } else
+        R = null;
+      return R = R !== null && u && ft(e.SUB, [R]) || R, R;
+    }
+    function Oi(s, c) {
+      return !!(s.length > 0 && Cr(s[s.length - 1]) && c.op === e.TEXT && (c.args[0].args[0] === "E" || c.args[0].args[0] === "e") && (I() === ht || (I() === 45 || I() === 43) && me() === ht));
+    }
+    function ys(s) {
+      let c;
+      if (s.length === 2) {
+        const u = s[0], R = s[1];
+        return !!((c = Cr(u)) && +c.args[0] >= 1 && +c.args[0] < 10 && R.op === e.POW && (c = Cr(R.args[0])) && c.args[0] === "10" && rn(R.args[1]));
+      }
+      return !1;
+    }
+    function es(s) {
+      return typeof s == "number" ? s < 0 : s.args.length === 1 ? s.op === i.SUB && s.args[0].args[0] > 0 || // Is unary minus.
+      s.op === e.NUM && +s.args[0] < 0 : s.args.length === 2 ? s.op === i.MUL && es(s.args[0]) : !1;
+    }
+    function sn(s) {
+      if (typeof s == "number")
+        return -s;
+      if (s.op === e.SUB && s.args.length === 1)
+        return s.args[0];
+      if (s.op === e.MUL) {
+        const c = s.args.slice(0);
+        return Oe([sn(c.shift())].concat(c));
+      }
+      return s.op === e.POW && ws(s.args[1]) ? Re(e.POW, [sn(s.args[0]), As]) : ft(e.SUB, [s]);
+    }
+    function ts(s) {
+      return s === fe || s === et || s === qt || s === Pr || s === or || s === cr;
+    }
+    function an() {
+      let s = De(), c;
+      for (; ts(c = I()); ) {
+        v();
+        let u = De();
+        switch (c) {
+          case Pr:
+          case or:
+          case cr:
+            s.lbrk === Ie && s.rbrk === lt && (s = b(e.SET, [s])), u.lbrk === Ie && u.rbrk === lt && (u = b(e.SET, [u])), s = Re(E[c], [s, u]);
+            break;
+          case qt:
+            s = Re(e.PM, [s, u]);
+            break;
+          case et:
+            s = Re(e.SUB, [s, u]);
+            break;
+          default: {
+            const R = !e.option(y, "compareGrouping") && !(s.isMixedNumber || u.isMixedNumber);
+            s = Re(e.ADD, [s, u], R);
+            break;
+          }
+        }
+      }
+      return s.isPolynomial = Ut(s), s;
+    }
+    function xr(s) {
+      return s.op === e.SIN || s.op === e.COS || s.op === e.TAN || s.op === e.SEC || s.op === e.COT || s.op === e.CSC || s.op === e.SINH || s.op === e.COSH || s.op === e.TANH || s.op === e.SECH || s.op === e.COTH || s.op === e.CSCH || s.op === e.ARCSIN || s.op === e.ARCCOS || s.op === e.ARCTAN || s.op === e.ARCSEC || s.op === e.ARCCOT || s.op === e.ARCCSC || s.op === e.ARCSINH || s.op === e.ARCCOSH || s.op === e.ARCTANH || s.op === e.ARCSECH || s.op === e.ARCCOTH || s.op === e.ARCCSCH || s.op === e.LN || s.op === e.LOG || s.op === e.LG;
+    }
+    function tt(s) {
+      let c = [], u = s.op;
+      if (u === e.NUM || u === e.VAR)
+        return s;
+      (u === e.CDOT || u === e.TIMES) && (u = e.MUL), s.args.forEach((A) => {
+        A = tt(A), u !== e.INTEGRAL && A.op === u && A.args.length > 1 ? c = c.concat(A.args) : c.push(A);
+      });
+      const { isMixedNumber: R } = s;
+      return s = b(u, c), s.isMixedNumber = R, s;
+    }
+    function qe(s, c) {
+      if (!e.option(s, "parsingIntegralExpr"))
+        return null;
+      const u = c.args.length;
+      if (c.op === e.MUL && c.args[u - 1].op === e.FRAC || nn(c) && xr(c.args[u - 1]))
+        return qe(s, c.args[u - 1]);
+      if (c.op === e.FRAC)
+        return qe(s, c.args[0]);
+      if (xr(c))
+        return qe(s, c.args[u - 1]);
+      const R = c.args[u - 2], A = c.args[u - 1];
+      return c && c.op === e.MUL && R.op === e.VAR && R.args[0] === "d" && A.op === e.VAR && A || null;
+    }
+    function at(s) {
+      K(nn(s) || s.op === e.FRAC || xr(s));
+      let c = s.args[s.args.length - 1];
+      return s.op === e.MUL && c.op === e.FRAC ? (c = at(c), s = Oe(s.args.slice(0, s.args.length - 1).concat(c))) : nn(s) && xr(c) ? (c = at(c), s = b(s.op, s.args.slice(0, s.args.length - 1).concat(c))) : s.op === e.FRAC ? s = b(e.FRAC, [
+        at(s.args[0]),
+        s.args[1]
+      ]) : xr(s) ? s = b(s.op, [at(s.args[s.args.length - 1])]) : s = Oe(s.args.slice(0, s.args.length - 2)), s;
+    }
+    function on(s) {
+      let c, u;
+      const R = e.option(y, "parsingIntegralExpr", !0), A = [];
+      if (I() === Mt)
+        ae(Mt), c = on(Mt), u = qe(y, tt(De()));
+      else if (I() === Bt || s === Mt)
+        s !== Mt && ae(Bt), c = on(Bt), u = qe(y, tt(De()));
+      else if (s !== Bt && ae(zt), I() === Ue && (v({ oneCharToken: !0 }), A.push(xt()), I() === we && (ae(we, { oneCharToken: !0 }), A.push(xt()))), I() === zt)
+        c = on(), u = qe(y, tt(De()));
+      else {
+        c = tt(De());
+        let S;
+        for (u = qe(y, c), c = u && at(c) || c; ts(S = I()) && !u; ) {
+          v();
+          let D = tt(De());
+          switch (u = qe(y, D), D = u && at(D) || D, S) {
+            case et:
+              c = Re(e.SUB, [c, D]);
+              break;
+            default:
+              c = Re(
+                e.ADD,
+                [c, D],
+                !0
+                /* flatten */
+              );
+              break;
+          }
+        }
+      }
+      return A.push(c), A.push(u || dt), e.option(y, "parsingIntegralExpr", R), K(u, o(1014, [P.replace(/\\\\/g, "\\")])), b(e.INTEGRAL, A);
+    }
+    function wi() {
+      ae(Mr);
+      const s = [];
+      return I() === Ue && (v({ oneCharToken: !0 }), s.push(xt())), s.push(De()), b(e.LIM, s);
+    }
+    function rs() {
+      let s = an();
+      for (; I() === Xt; ) {
+        v();
+        const c = an();
+        s = Re(e.COLON, [s, c], !0);
+      }
+      return s;
+    }
+    function Ps(s) {
+      return s === Qt || s === jt || s === Ir || s === Zt || s === yn || s === Pn || s === An || s === Rn || s === Bn || s === _n || s === vn || s === lr || s === Un || s === $n || s === Vn || s === Hn || s === Kn || s === Gn || s === qn || s === Wn;
+    }
+    function bi() {
+      let s = I(), c = rs();
+      const u = [];
+      let R = !1;
+      for (; Ps(s = I()); ) {
+        if (v(), s === lr) {
+          R = !0;
+          continue;
+        }
+        const A = rs();
+        c = b(E[s], [c, A]), R && (c.op = `n${c.op}`, R = !1), u.push(c), c = e.create(y, A);
+      }
+      return u.length === 0 ? c : u.length === 1 ? u[0] : b(e.COMMA, u);
+    }
+    function vs(s) {
+      return s === us || s === rr || s === Ln;
+    }
+    function Ar() {
+      let s = bi(), c;
+      const u = [];
+      for (; vs(c = I()) || c === It; ) {
+        v();
+        const R = rs();
+        s = b(E[c], [s, R]), u.push(s), s = e.create(y, R);
+      }
+      return u.length === 0 ? s : u.length === 1 ? u[0] : b(e.COMMA, u);
+    }
+    function ks(s) {
+      return s === Xn || s === It || s === ur || s === Wr || s === Xr || s === Qr || s === jr || s === Zr || s === en || s === Yr || s === zr || s === Jr;
+    }
+    function Ds() {
+      let s = Ar(), c;
+      for (; ks(c = I()); ) {
+        v();
+        const u = Ar();
+        s = b(E[c], [s, u]);
+      }
+      return s;
+    }
+    function $t(s) {
+      const c = Ds(), u = [c];
+      let R;
+      for (; (R = I()) === Wt || s && R === Or; )
+        v(), f(I()) || u.push(Ds());
+      return u.length > 1 ? b(E[Wt], u) : c;
+    }
+    function Ii() {
+      try {
+        if (pi(), I()) {
+          let s = $t();
+          return K(!I(), o(1003, [
+            Ct.pos(),
+            Ct.lexeme(),
+            `"${P.substring(Ct.pos() - 1)}"`
+          ])), s.lbrk === Ie && (s = b(e.SET, [s])), s;
+        }
+      } catch (s) {
+        throw console.log(`SYNTAX ERROR in: ${P}
+${s.stack}`), s;
+      }
+      return dt;
+    }
+    return {
+      expr: Ii
+    };
+    function Mi(s) {
+      let c = 0, u = "";
+      const R = {
+        "\\Delta": Qn,
+        "\\cdot": nr,
+        "\\times": Ft,
+        "\\div": yr,
+        "\\dfrac": Xe,
+        "\\frac": Xe,
+        "\\sqrt": Cn,
+        "\\vec": wn,
+        "\\pm": qt,
+        "\\not": lr,
+        "\\sin": Nr,
+        "\\cos": Pt,
+        "\\tan": Sr,
+        "\\sec": Rr,
+        "\\cot": Gt,
+        "\\csc": $e,
+        "\\arcsin": Jt,
+        "\\arccos": Yt,
+        "\\arctan": er,
+        "\\arcsec": sr,
+        "\\arccsc": ir,
+        "\\arccot": ar,
+        "\\asin": Jt,
+        // \operatorname{asin}
+        "\\acos": Yt,
+        "\\atan": er,
+        "\\asec": sr,
+        "\\acsc": ir,
+        "\\acot": ar,
+        "\\sinh": kr,
+        "\\cosh": Dr,
+        "\\tanh": Fr,
+        "\\sech": Br,
+        "\\coth": _r,
+        "\\csch": Ur,
+        "\\arcsinh": $r,
+        "\\arccosh": Vr,
+        "\\arctanh": Hr,
+        "\\arcsech": Kr,
+        "\\arccsch": Gr,
+        "\\arccoth": qr,
+        "\\ln": Er,
+        "\\lg": wr,
+        "\\log": br,
+        "\\left": ye,
+        "\\right": He,
+        "\\big": null,
+        // whitespace
+        "\\Big": null,
+        "\\bigg": null,
+        "\\Bigg": null,
+        "\\ ": null,
+        "\\quad": null,
+        "\\qquad": null,
+        "\\text": st,
+        "\\textrm": st,
+        "\\textit": st,
+        "\\textbf": st,
+        "\\operatorname": fr,
+        "\\lt": Qt,
+        "\\le": jt,
+        "\\leq": jt,
+        "\\gt": Ir,
+        "\\ge": Zt,
+        "\\geq": Zt,
+        "\\ne": rr,
+        "\\neq": rr,
+        "\\ngtr": yn,
+        "\\nless": Pn,
+        "\\ni": vn,
+        "\\subseteq": Un,
+        "\\supseteq": $n,
+        "\\subset": Vn,
+        "\\supset": Hn,
+        "\\approx": Ln,
+        "\\implies": Xn,
+        "\\Rightarrow": ur,
+        "\\rightarrow": It,
+        "\\leftarrow": Wr,
+        "\\longrightarrow": Xr,
+        "\\longleftarrow": Qr,
+        "\\overrightarrow": jr,
+        "\\overleftarrow": Zr,
+        "\\Leftrightarrow": en,
+        "\\leftrightarrow": Yr,
+        "\\longleftrightarrow": zr,
+        "\\overleftrightarrow": Jr,
+        "\\perp": Bn,
+        "\\propto": _n,
+        "\\parallel": Kn,
+        "\\nparallel": Gn,
+        "\\sim": qn,
+        "\\cong": Wn,
+        "\\exists": xn,
+        "\\in": An,
+        "\\forall": Tn,
+        "\\lim": Mr,
+        "\\exp": En,
+        "\\to": Rn,
+        "\\sum": Nn,
+        "\\int": zt,
+        "\\iint": Bt,
+        "\\iiint": Mt,
+        "\\prod": Sn,
+        "\\cup": or,
+        "\\bigcup": Dn,
+        "\\cap": cr,
+        "\\bigcap": Fn,
+        "\\%": ps,
+        "\\binom": On,
+        "\\begin": ds,
+        "\\end": Lr,
+        "\\colon": Xt,
+        "\\vert": Se,
+        "\\lvert": Se,
+        "\\rvert": Se,
+        "\\mid": Se,
+        "\\type": tr,
+        "\\format": Cs,
+        "\\overline": bn,
+        "\\dot": gr,
+        "\\overset": In,
+        "\\underset": Mn,
+        "\\backslash": Pr,
+        "\\mathbf": vr,
+        "\\abs": ms,
+        "\\MathQuillMathField": kn,
+        "\\ldots": nt,
+        // ... and var are close syntactic alternatives
+        "\\vdots": nt,
+        "\\ddots": nt,
+        "\\infty": xs,
+        "\\langle": pr,
+        "\\rangle": ut
+      }, A = {
+        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 S(F) {
+        return F >= 65 && F <= 90 || F >= 97 && F <= 122;
+      }
+      function D(F) {
+        F || (F = {});
+        let W;
+        u = "";
+        let We;
+        for (; c < s.length; ) {
+          let je;
+          switch (W = s.charCodeAt(c++), W === 55349 && (s.charCodeAt(c++) === 57030 ? W = 949 : K(!1, o(1004, [String.fromCharCode(W), W]))), W) {
+            case 32:
+            case 9:
+            case 10:
+            case 13:
+            case 160:
+            case 8203:
+              continue;
+            case 38:
+              if (s.substring(c).indexOf("nbsp;") === 0) {
+                c += 5;
+                continue;
+              }
+              return Dt;
+            case 92:
+              switch (u += String.fromCharCode(W), s.charCodeAt(c)) {
+                case 92:
+                  return c++, kt;
+                case 123:
+                  return c++, Ie;
+                case 124:
+                  return c++, Se;
+                case 125:
+                  return c++, lt;
+              }
+              if (je = se(), je !== null)
+                return je;
+              u = "";
+              continue;
+            case 42:
+            case 8727:
+              return s.charCodeAt(c) === 42 ? (c++, we) : Ft;
+            case 45:
+            case 8722:
+              return s.charCodeAt(c) === 62 ? (c++, It) : et;
+            case 47:
+            case 8725:
+              return vt;
+            case 33:
+              return s.charCodeAt(c) === 61 ? (c++, rr) : W;
+            case 58:
+            case 8758:
+              return Xt;
+            case 59:
+              return Or;
+            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 u += String.fromCharCode(W), W;
+            case 36:
+              return u += String.fromCharCode(W), nt;
+            case 39:
+              return Qe(W);
+            case 60:
+              return s.charCodeAt(c) === 61 ? (c++, jt) : Qt;
+            case 62:
+              return s.charCodeAt(c) === 61 ? (c++, Zt) : Ir;
+            default:
+              return S(W) || W === he ? ce(W) : (We = A[W]) ? (u = We, je = R[u], je === void 0 && (je = nt), je) : Pe(String.fromCharCode(W)) || x(W) ? F.oneCharToken ? (u += String.fromCharCode(W), ht) : Te(W) : (K(!1, o(1004, [String.fromCharCode(W), W])), 0);
+          }
+        }
+        return 0;
+      }
+      let te;
+      function Te(F) {
+        let W;
+        for (; x(F) || Pe(String.fromCharCode(F)) || (W = ne(String.fromCharCode(F), te)); ) {
+          if (te = W || te, u += String.fromCharCode(F), F = s.charCodeAt(c++), F === 92 && s.charCodeAt(c) === 32 && (F = 32, c++), Pe(String.fromCharCode(F)) || (W = ne(String.fromCharCode(F), te)))
+            for (te = W || te, u += String.fromCharCode(F), F = s.charCodeAt(c++); F === 92 && (F = s.charCodeAt(c)) === 32 && c++ || h(F); )
+              F = s.charCodeAt(c++);
+          F === 92 && s.charCodeAt(c) === 32 && (F = 32, c++);
+        }
+        return u === "." && (s.substring(c).indexOf("overline") === 0 || s.substring(c).indexOf("dot") === 0) && (u = "0."), c--, ht;
+      }
+      function ce(F) {
+        let W = String.fromCharCode(F);
+        u += W;
+        let We = u;
+        const je = c + 1;
+        for (; (S(F) || F === he) && (F = s.charCodeAt(c++), !(!S(F) || (W = String.fromCharCode(F), !J.some((Li) => {
+          const yi = We + W;
+          return Li.indexOf(yi) === 0;
+        })))); )
+          We += W;
+        for (J.indexOf(We) >= 0 ? u = We : c = je; u.lastIndexOf("'") === u.length - 1 && F === he; )
+          u += String.fromCharCode(F), F = s.charCodeAt(c++);
+        return c--, nt;
+      }
+      function se() {
+        let F = s.charCodeAt(c++);
+        if (F === Q)
+          u = String.fromCharCode(F);
+        else if (F === ee)
+          u += String.fromCharCode(F);
+        else if ([
+          w,
+          rt,
+          ct,
+          Ce,
+          U
+        ].indexOf(F) >= 0)
+          u = "\\ ";
+        else {
+          for (; S(F); )
+            u += String.fromCharCode(F), F = s.charCodeAt(c++);
+          u = u === "\\varepsilon" && "\\epsilon" || u, c--;
+        }
+        let W = R[u];
+        if (W === void 0)
+          u === "\\emptyset" && (u = "\\varnothing"), W = nt;
+        else if (W === fr) {
+          for (F = s.charCodeAt(c++); F && F !== Z; )
+            F = s.charCodeAt(c++);
+          for (u = "", F = s.charCodeAt(c++); F && F !== le; ) {
+            const We = String.fromCharCode(F);
+            We === "&" && s.substring(c).indexOf("nbsp;") === 0 ? c += 5 : We === " " || We === "	" || (u += We), F = s.charCodeAt(c++);
+          }
+          W = R[`\\${u}`], W === void 0 && (W = fr);
+        } else if (W === st || W === tr) {
+          for (F = s.charCodeAt(c++); F && F !== Z; )
+            F = s.charCodeAt(c++);
+          u = "", F = s.charCodeAt(c++);
+          const We = e.option(y, "keepTextWhitespace");
+          for (; F && F !== le; ) {
+            const je = String.fromCharCode(F);
+            !We && je === "&" && s.substring(c).indexOf("nbsp;") === 0 ? c += 5 : !We && (je === " " || je === "	") || (u += je), F = s.charCodeAt(c++);
+          }
+          W !== tr && (!u || e.option(y, "ignoreText") ? W = null : W = st);
+        } else W === xs && (W = ht);
+        return W;
+      }
+      function Qe(F) {
+        for (K(F === 39), u = "'"; s.charCodeAt(c) === 39; )
+          c++, u += "'";
+        return nt;
+      }
+      return {
+        start: D,
+        lexeme() {
+          return u;
+        },
+        pos() {
+          return c;
+        }
+      };
+    }
+  };
+  return e;
+})(), ka = Js, d = va, Ne = (e, t, r) => {
+  if (t === void 0 && (t = "failed!"), !e) {
+    const n = new Error(t);
+    throw n.location = r || Ee.location, n;
+  }
+}, Ys = (e, t) => {
+  let r = Ee.messages[e];
+  return t && t.forEach((n, a) => {
+    r = r.replace(`%${a + 1}`, n);
+  }), `${e}: ${r}`;
+}, Da = (e, t, r) => {
+  Ne(e <= t, "Invalid code range");
+  const n = Ee.reservedCodes.every((a) => t < a.first || e > a.last);
+  Ne(n, "Conflicting request for error code range"), Ee.reservedCodes.push({ first: e, last: t, name: r });
+}, Fa = (e) => {
+  Ee.location = e;
+}, Ba = () => {
+  Ee.location = null;
+}, _a = (e, t) => {
+  e !== void 0 && (Ee.timeout = e ? Date.now() + e : 0, Ee.timeoutMessage = t || "ERROR timeout exceeded");
+}, Ua = () => {
+  Ne(!Ee.timeout || Ee.timeout > Date.now(), Ee.timeoutMessage);
+}, $a = (e, t) => {
+  Ee.count = e, Ee.countMessage = t || "ERROR count exceeded";
+}, Va = () => {
+  const { count: e } = Ee;
+  if (typeof e != "number" || Number.isNaN(e)) {
+    Ne(!1, "ERROR counter not set");
+    return;
+  }
+  Ne(Ee.count--, Ee.countMessage);
+}, Ee = {
+  assert: Ne,
+  message: Ys,
+  messages: {},
+  reserveCodeRange: Da,
+  reservedCodes: [],
+  setLocation: Fa,
+  clearLocation: Ba,
+  checkTimeout: Ua,
+  setTimeout: _a,
+  setCounter: $a,
+  checkCounter: Va
+}, Vt = { 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"] } };
+(function(e) {
+  function t(h, x) {
+    return {
+      op: h,
+      args: x
+    };
+  }
+  function r(h, x) {
+    return x.length > 1 ? { op: h, args: x } : x[0];
+  }
+  const n = (h, x) => {
+    const N = h.indexOf("{"), w = (N > 0 && h.slice(0, N) || h).trim();
+    Ne(x && x[w]);
+    const U = N > 0 && h.slice(N);
+    return w === "$fmt" ? { rawConfig: U } : U && JSON.parse(U) || {};
+  };
+  function a(h) {
+    function x(T, C, L, B) {
+      switch (Ne(C.op && C.args, `Visitor.visit() op=${C.op} args = ${C.args}`), C.op) {
+        case d.NUM:
+          C = L.numeric(C, B);
+          break;
+        case d.ADD:
+        case d.SUB:
+        case d.PM:
+        case d.BACKSLASH:
+        case d.DIV:
+        case d.FRAC:
+        case d.BINOM:
+        case d.LOG:
+        case d.COLON:
+        case d.FUNC:
+        case d.TYPE:
+        case d.SUBSCRIPT:
+          C.args.length === 1 ? C = L.unary(C, B) : C = L.binary(C, B);
+          break;
+        case d.MUL:
+        case d.TIMES:
+        case d.COEFF:
+        case d.CDOT:
+          C = L.multiplicative(C, B);
+          break;
+        case d.POW:
+          C = L.exponential(C, B);
+          break;
+        case d.VAR:
+          C = L.variable(C, B);
+          break;
+        case d.SQRT:
+        case d.SIN:
+        case d.COS:
+        case d.TAN:
+        case d.SEC:
+        case d.CSC:
+        case d.COT:
+        case d.ARCSIN:
+        case d.ARCCOS:
+        case d.ARCTAN:
+        case d.ARCSEC:
+        case d.ARCCSC:
+        case d.ARCCOT:
+        case d.SINH:
+        case d.COSH:
+        case d.TANH:
+        case d.ARCSINH:
+        case d.ARCCOSH:
+        case d.ARCTANH:
+        case d.ARCSECH:
+        case d.ARCCSCH:
+        case d.ARCCOTH:
+        case d.SECH:
+        case d.CSCH:
+        case d.COTH:
+        case d.PERCENT:
+        case d.M:
+        case d.ABS:
+        case d.FACT:
+        case d.FORALL:
+        case d.EXISTS:
+        case d.IN:
+        case d.SUM:
+        case d.LIM:
+        case d.EXP:
+        case d.TO:
+        case d.DERIV:
+        case d.INTEGRAL:
+        case d.PROD:
+        case d.CUP:
+        case d.BIGCUP:
+        case d.CAP:
+        case d.BIGCAP:
+        case d.PIPE:
+        case d.ION:
+        case d.OVERLINE:
+        case d.OVERSET:
+        case d.UNDERSET:
+        case d.MATHBF:
+        case d.TEXT:
+        case d.NONE:
+        case d.DEGREE:
+        case d.DOT:
+        case d.MATHFIELD:
+        case d.SET:
+        case d.NOT:
+        case d.OPERATORNAME:
+          C = L.unary(C, B);
+          break;
+        case d.COMMA:
+        case d.MATRIX:
+        case d.VEC:
+        case d.ROW:
+        case d.COL:
+        case d.LIST:
+        case d.ANGLEBRACKET:
+          C = L.comma(C, B);
+          break;
+        case d.EQL:
+        case d.LT:
+        case d.LE:
+        case d.GT:
+        case d.GE:
+        case d.NE:
+        case d.NGTR:
+        case d.NLESS:
+        case d.NI:
+        case d.SUBSETEQ:
+        case d.SUPSETEQ:
+        case d.SUBSET:
+        case d.SUPSET:
+        case d.NNI:
+        case d.NSUBSETEQ:
+        case d.NSUPSETEQ:
+        case d.NSUBSET:
+        case d.NSUPSET:
+        case d.APPROX:
+        case d.IMPLIES:
+        case d.PERP:
+        case d.PROPTO:
+        case d.PARALLEL:
+        case d.NPARALLEL:
+        case d.SIM:
+        case d.CONG:
+        case d.CAPRIGHTARROW:
+        case d.RIGHTARROW:
+        case d.LEFTARROW:
+        case d.LONGRIGHTARROW:
+        case d.LONGLEFTARROW:
+        case d.OVERRIGHTARROW:
+        case d.OVERLEFTARROW:
+        case d.CAPLEFTRIGHTARROW:
+        case d.LEFTRIGHTARROW:
+        case d.LONGLEFTRIGHTARROW:
+        case d.OVERLEFTRIGHTARROW:
+          C = L.equals(C, B);
+          break;
+        case d.PAREN:
+        case d.BRACKET:
+        case d.BRACE:
+        case d.INTERVAL:
+        case d.INTERVALOPEN:
+        case d.INTERVALLEFTOPEN:
+        case d.INTERVALRIGHTOPEN:
+          C = L.paren(C);
+          break;
+        default:
+          L.name !== "normalizeLiteral" && L.name !== "sort" && (C = t(d.VAR, [`INTERNAL ERROR Should not get here. Unhandled node operator ${C.op}`]));
+          break;
+      }
+      return C;
+    }
+    function N(T, C) {
+      if (!C)
+        return "";
+      const L = d.option(T, "words");
+      let B;
+      return L && (B = L[C.toLowerCase()]), B || (B = C, B.charAt(0) === "\\" && (B = B.substring(1))), B;
+    }
+    function w(T) {
+      let C = [];
+      switch (T.op) {
+        case d.VAR:
+          C.push({
+            code: T.args[0]
+          });
+          break;
+        case d.MUL:
+          {
+            let L = "", B;
+            T.args.forEach((k) => {
+              k.op === d.VAR ? L += k.args[0] : k.op === d.NUM && (B = +k.args[0]);
+            }), C.push({
+              code: L,
+              length: B
+            });
+          }
+          break;
+        case d.COMMA:
+          T.args.forEach((L) => {
+            C = C.concat(w(L));
+          });
+          break;
+      }
+      return C;
+    }
+    function U(T) {
+      const [C, L] = T.split("[");
+      return {
+        name: C,
+        arg: L && L.substring(0, L.indexOf("]")) || void 0
+      };
+    }
+    function Q(T, C) {
+      return w(T).some((B) => {
+        const k = B.code, j = B.length;
+        switch (k) {
+          case "integer":
+            if (C.numberFormat === "integer" && (j === void 0 || j === C.args[0].length))
+              return !0;
+            break;
+          case "decimal":
+            if (C.numberFormat === "decimal" && C.isRepeating)
+              return j === void 0;
+            if (C.numberFormat === "decimal" && (j === void 0 || j === 0 && C.args[0].indexOf(".") === -1 || j === C.args[0].substring(C.args[0].indexOf(".") + 1).length))
+              return !0;
+            break;
+          case "repeatingDecimal":
+            return C.numberFormat === "decimal" && C.isRepeating ? (Ne(!j, "The repeatingDecimal pattern does not take a length"), !0) : !1;
+          case "number":
+            if (C.numberFormat === "decimal" && C.isRepeating)
+              return j === void 0;
+            if (C.numberFormat === "integer" || C.numberFormat === "decimal") {
+              const M = C.args[0].indexOf(".");
+              if (j === void 0 || j === 0 && M === -1 || M >= 0 && j === C.args[0].substring(M + 1).length)
+                return !0;
+            }
+            break;
+          case "scientific":
+            if (C.isScientific) {
+              const M = C.args[0].args[0];
+              if (j === void 0 || j === 0 && M.indexOf(".") === -1 || j === M.substring(M.indexOf(".") + 1).length)
+                return !0;
+            }
+            break;
+          case "fraction":
+            if (C.isFraction || C.isMixedNumber)
+              return !0;
+            break;
+          case "simpleFraction":
+          case "nonMixedFraction":
+            if (C.isFraction)
+              return !0;
+            break;
+          case "mixedFraction":
+          case "mixedNumber":
+            if (C.isMixedNumber)
+              return !0;
+            break;
+          case "fractionOrDecimal":
+            if (C.isFraction || C.isMixedNumber || C.numberFormat === "decimal")
+              return !0;
+            break;
+          default:
+            Ne(!1, Ys(2015, [k]));
+            break;
+        }
+        return !1;
+      });
+    }
+    function ee(T, C) {
+      return w(T).some((B) => {
+        switch (B.code) {
+          case "simpleSmallRowMatrix":
+          case "smallRowMatrix":
+            return C.op === d.MATRIX && C.m === 1 && C.n < 4;
+          case "simpleSmallColumnMatrix":
+          case "smallColumnMatrix":
+            return C.op === d.MATRIX && C.m < 4 && C.n === 1;
+          case "simpleSmallMatrix":
+          case "smallMatrix":
+            return C.op === d.MATRIX && C.m < 4 && C.n < 4;
+          case "matrix":
+            return C.op === d.MATRIX;
+          case "row":
+            return C.op === d.ROW;
+          case "column":
+            return C.op === d.COL;
+          default:
+            return !1;
+        }
+      });
+    }
+    function G(T, C) {
+      const L = U(T), B = L.name, k = L.arg;
+      switch (B) {
+        case "polynomial":
+          if (k) {
+            if (k.indexOf(">") === 0) {
+              const M = parseInt(k.substring(1), 10);
+              return C.isPolynomial > M;
+            }
+            const j = parseInt(k, 10);
+            return C.isPolynomial > j;
+          }
+          return C.isPolynomial;
+        default:
+          return !1;
+      }
+    }
+    function Y(T) {
+      return T.op === d.NUM || T.op === d.VAR || typeof T == "string";
+    }
+    function ie(T) {
+      return Ne(T.op === d.MATRIX || T.op === d.ROW || T.op === d.COL), T.args.every((C) => C.op === d.MATRIX || C.op === d.ROW || C.op === d.COL ? ie(C) : Y(C));
+    }
+    function Ce(T, C, L) {
+      if (C.op === d.TYPE && C.args[0].op === d.VAR) {
+        let B = C.args[0].args[0];
+        switch (B = B.indexOf("[") > 0 && B.slice(0, B.indexOf("[")) || B, B) {
+          case "number":
+          case "integer":
+          case "decimal":
+          case "scientific":
+          case "fraction":
+          case "simpleFraction":
+          case "mixedFraction":
+          case "mixedNumber":
+          case "fractionOrDecimal":
+          case "repeatingDecimal":
+            return Q(C.args[0], L);
+          case "variable":
+            return L.op === d.VAR;
+          case "simpleSmallRowMatrix":
+          case "simpleSmallColumnMatrix":
+          case "simpleSmallMatrix":
+            return ee(C.args[0], L) && ie(L);
+          case "smallRowMatrix":
+          case "smallColumnMatrix":
+          case "smallMatrix":
+          case "matrix":
+          case "row":
+          case "column":
+            return ee(C.args[0], L);
+          case "polynomial":
+            return G(C.args[0].args[0], L);
+          default: {
+            const j = d.option(T, "types")[B];
+            if (j)
+              return Ne(j instanceof Array), j.some((M) => xe(T, [d.create(T, M)], L).length > 0);
+          }
+        }
+        return !1;
+      }
+      if (C.op === d.COLON && C.args[0].op === d.VAR && C.args[0].args[0] === "?") {
+        switch (Ne(C.args[1].op === d.VAR), C.args[1].args[0]) {
+          case "N":
+            return L.op === d.NUM;
+          case "V":
+            return L.op === d.VAR;
+        }
+        return !1;
+      }
+      return C.op === d.VAR && C.args[0] === "?" || C.op === d.MATRIX && L.op === d.MATRIX;
+    }
+    function xe(T, C, L) {
+      return C.size === 0 || L === void 0 ? !1 : C.filter((k) => {
+        if (k.op === void 0 || L.op === void 0)
+          return !1;
+        if (h.intern(k) === h.intern(L) || Ce(T, k, L))
+          return !0;
+        if (k.op === L.op) {
+          if (k.args.length === L.args.length)
+            return k.args.every((j, M) => k.op === d.VAR ? j.toLowerCase() === L.args[M].toLowerCase() : xe(T, [j], L.args[M]).length === 1);
+          if (k.args.length < L.args.length) {
+            const j = L.args.slice(1);
+            if (k.args.length === 2)
+              return xe(T, [k.args[0]], L.args[0]).length > 0 && xe(T, [k.args[1]], t(L.op, j)).length > 0;
+          }
+        }
+        return !1;
+      });
+    }
+    function ve(T, C, L) {
+      const B = T;
+      return C.forEach((k, j) => {
+        T = T.replace(new RegExp(`%${j + 1}`, "g"), k.args[0]);
+      }), C.length > 2 ? ve(B, [t(d.VAR, [T])].concat(C.slice(2))) : T;
+    }
+    function de(T, C, L, B) {
+      L = L || {}, B = B || {};
+      let k = T.template;
+      if (C.length === 0 && C.push(t(d.VAR, [""])), k && k.indexOf("%OP") >= 0 && L.op && (k = k.replace(new RegExp("%OP", "g"), L.op)), k && C) {
+        k.indexOf("%%") >= 0 && (k = k.replace(new RegExp("%%", "g"), C[0].args[0]));
+        const j = k.indexOf("{"), M = (j > 0 && k.slice(0, j) || k).trim();
+        if (B[M]) {
+          const Z = B[M].fn, q = n(k, B), le = Z({ config: q, env: L }), he = [];
+          C.forEach((z) => {
+            he.push(z.args[0]);
+          }), k = le(he);
+        }
+        if (k.indexOf("%*") >= 0) {
+          let Z = "";
+          C.forEach((q, le) => {
+            Z !== "" && (Z += " "), le === C.length - 1 && (k = k.slice(0, 2 * k.indexOf("%*") + 2)), Z += k.replace("%*", q.args[0]).replace("%M", q.m).replace("%N", q.n);
+          }), k = Z;
+        }
+        return k.indexOf("%IP") >= 0 && (k = k.replace(new RegExp("%IP", "g"), L.ip)), k.indexOf("%FP0") >= 0 && (k = k.replace(new RegExp("%FP0", "g"), L.fp)), k.indexOf("%FP") >= 0 && (k = k.replace(new RegExp("%FP", "g"), L.fp.split("").join(" "))), k.indexOf("%M") >= 0 && (Ne(L.m), k = k.replace(new RegExp("%M", "g"), L.m)), k.indexOf("%N") >= 0 && (Ne(L.n), k = k.replace(new RegExp("%N", "g"), L.n)), T.isBinary && C.length > 2 ? k = ve(k, C) : C.forEach((Z, q) => {
+          k = k.replace(new RegExp(`%${q + 1}`, "g"), Z ? Z.args[0] : "");
+        }), {
+          op: d.VAR,
+          args: [k]
+        };
+      }
+      return C[0];
+    }
+    function Be(T, C, L) {
+      let B = [];
+      return L.forEach((k) => {
+        B = B.concat(C[JSON.stringify(k)]);
+      }), B.length === 0 && B.push({ template: "" }), B[0];
+    }
+    function Ae(T, C) {
+      return Ne(typeof C.template == "string"), C.template.indexOf("%%") >= 0 ? [T] : T.args;
+    }
+    function rt(T) {
+      if (T.args.length <= 2)
+        return T;
+      const C = T.args.pop();
+      return r(T.op, [
+        rt(T),
+        C
+      ]);
+    }
+    function ct(T) {
+      if (T.args.length <= 2)
+        return T;
+      const C = T.args.shift();
+      return r(T.op, [
+        C,
+        ct(T)
+      ]);
+    }
+    function _e(T, C, L) {
+      L instanceof Array && (L.length === 1 ? L = L[0] : L = i(T, L[1], L[0]));
+      const B = L, k = Object.keys(L), j = [];
+      return k.forEach((M) => {
+        j.push(JSON.parse(M));
+      }), !C || !C.args ? (Ne(!1, "Should not get here. Illformed node."), 0) : x(T, C, {
+        name: "translate",
+        numeric(M) {
+          const Z = [{
+            op: d.VAR,
+            args: [N(T, M.args[0])]
+          }], q = T.env || {};
+          if (M.numberFormat === "decimal") {
+            const z = M.args[0].split(".");
+            q.ip = z[0], q.fp = z[1] || "0";
+          }
+          const le = xe(T, j, M);
+          if (le.length === 0)
+            return M;
+          const he = Be(T, L, le);
+          return de(he, Z, q, T.expanderBuilders);
+        },
+        binary(M) {
+          M.op === d.SUBSCRIPT ? M = ct(M) : M = rt(M);
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
+          let z = [];
+          return he.forEach((fe, we) => {
+            const Ue = d.option(T, "RHS", we > 0);
+            z = z.concat(_e(T, fe, [B, le])), d.option(T, "RHS", Ue);
+          }), q.isBinary = !0, de(q, z, { ...T.env, op: M.op }, T.expanderBuilders);
+        },
+        multiplicative(M) {
+          M = rt(M);
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
+          let z = [];
+          return he.forEach((fe, we) => {
+            const Ue = d.option(T, "RHS", we > 0);
+            z = z.concat(_e(T, fe, [B, le])), d.option(T, "RHS", Ue);
+          }), q.isBinary = !0, de(q, z, { ...T.env, op: M.op }, T.expanderBuilders);
+        },
+        unary(M) {
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
+          let z = [];
+          return he.forEach((fe) => {
+            z = z.concat(_e(T, fe, [B, le]));
+          }), de(q, z, { ...T.env, op: M.op }, T.expanderBuilders);
+        },
+        exponential(M) {
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
+          let z = [];
+          return he.forEach((fe) => {
+            z = z.concat(_e(T, fe, [B, le]));
+          }), de(q, z, T.env, T.expanderBuilders);
+        },
+        variable(M) {
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
+          let z = [];
+          return z.push(t(d.VAR, [N(T, he.shift())])), he.forEach((fe) => {
+            z = z.concat(_e(T, fe, [B, le]));
+          }), de(q, z, T.env, T.expanderBuilders);
+        },
+        comma(M) {
+          const Z = T.env || {};
+          if (M.op === d.MATRIX || M.op === d.ROW || M.op === d.COL) {
+            M.op === d.MATRIX ? (Ne(M.args[0].op === d.ROW), Ne(M.args[0].args[0].op === d.COL), M.m = Z.m = M.args[0].args.length, M.n = Z.n = M.args[0].args[0].args.length, M.args.forEach(($e, Xe) => {
+              $e.m = Xe + 1;
+            })) : M.op === d.ROW ? M.args.forEach(($e, Xe) => {
+              $e.m = Xe + 1, $e.n = void 0;
+            }) : M.args.forEach(($e, Xe) => {
+              $e.m = M.m, $e.n = Xe + 1;
+            });
+            const we = xe(T, j, M);
+            if (we.length === 0)
+              return M;
+            const Ue = Be(T, L, we, M.args.length);
+            let Je = [];
+            const Pt = o(Ue);
+            return Ae(M, Ue).forEach(($e, Xe) => {
+              Je = Je.concat(_e(T, $e, [B, Pt])), Je[Xe].m = $e.m, Je[Xe].n = $e.n;
+            }), de(Ue, Je, Z, T.expanderBuilders);
+          }
+          const q = xe(T, j, M);
+          if (q.length === 0)
+            return M;
+          const le = Be(T, L, q, M.args.length), he = o(le), z = Ae(M, le);
+          let fe = [];
+          return z.forEach((we) => {
+            fe = fe.concat(_e(T, we, [B, he]));
+          }), le.isBinary = !0, de(le, fe, Z, T.expanderBuilders);
+        },
+        equals(M) {
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
+          let z = [];
+          return he.forEach((fe) => {
+            z = z.concat(_e(T, fe, [B, le]));
+          }), q.isBinary = !0, de(q, z, T.env, T.expanderBuilders);
+        },
+        paren(M) {
+          const Z = xe(T, j, M);
+          if (Z.length === 0)
+            return M;
+          const q = Be(T, L, Z), le = o(q), he = Ae(M, q), z = [];
+          return he.forEach((fe) => {
+            z.push(_e(T, fe, [B, le]));
+          }), de(q, z, T.env, T.expanderBuilders);
+        }
+      });
+    }
+    this.translate = _e;
+  }
+  function o(h) {
+    return h.rules;
+  }
+  function i(h, x, N) {
+    const w = {};
+    if (x) {
+      if (x instanceof Array) {
+        let G = {};
+        x.some((Y) => Y.context ? (Y.context && Y.context.split(" ") || []).some((Ce) => h[Ce] ? (G = Y.value, !0) : !1) : (G = Y, !0)), x = G;
+      }
+      Object.keys(x).forEach((G) => {
+        w[G] = x[G];
+      });
+    }
+    const U = Object.keys(N);
+    let Q;
+    return U.forEach((ee) => {
+      Number.isNaN(parseInt(ee, 10)) ? Q = N : (Q = N[ee], ee = Object.keys(Q)[0]), w[ee] || (w[ee] = Q[ee]);
+    }), w;
+  }
+  function l(h) {
+    let x;
+    const N = h.indexOf("\\context");
+    if (N >= 0) {
+      h = h.slice(N + 8);
+      const w = h.indexOf("}");
+      x = h.slice(1, w), h = h.slice(w + 1);
+    }
+    return {
+      context: x,
+      template: h
+    };
+  }
+  function p(h, x) {
+    let N;
+    if (x instanceof Array)
+      Ne(x.length === 1), N = p(h, x[0]);
+    else if (typeof x == "string")
+      N = l(x);
+    else {
+      let w = "";
+      const U = Object.keys(x);
+      Ne(U.length === 1);
+      const Q = U[0], ee = x[Q];
+      let G;
+      ee instanceof Array ? (G = [], ee.forEach((Y) => {
+        Y.options ? (w += Y.options.RHS ? " RHS" : "", w += Y.options.EndRoot ? " EndRoot" : "", w += Y.options.NoParens ? " NoParens" : "", G.push({
+          context: w,
+          value: f(h, Y.value)
+        })) : G.push(f(h, Y));
+      })) : G = f(h, ee), N = {
+        template: Q,
+        rules: G
+      };
+    }
+    return N;
+  }
+  function f(h, x) {
+    const N = {};
+    return Object.keys(x).forEach((U) => {
+      const Q = JSON.stringify(d.create(h, U)), ee = p(h, x[U]);
+      N[Q] ? N[Q].push(ee) : N[Q] = [ee];
+    }), N;
+  }
+  function g(h, x, N) {
+    const w = new a(e), U = f(h, N);
+    return w.translate(h, x, U);
+  }
+  function m(h) {
+    let x = 0, N = "";
+    for (; x < h.length; x++)
+      switch (h.charAt(x)) {
+        case " ":
+        case "	":
+        case `
+`:
+          if (N.length === 0 || N.charAt(N.length - 1) === " ")
+            continue;
+          N += " ";
+          break;
+        default:
+          N += h.charAt(x);
+          break;
+      }
+    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;
+  }
+  d.fn.translate = function(h, x) {
+    const N = d.option(x, "rules");
+    let w = g(x, h, N);
+    return (!w || w.op !== d.VAR) && (w = t(d.VAR, [""])), m(w.args[0]);
+  }, d.option = function(x, N, w) {
+    Ne(x);
+    let U = x && x[N];
+    if (w !== void 0 && (d.options = x = x || {}, x[N] = w), U === void 0)
+      switch (N) {
+        case "field":
+          U = "integer";
+          break;
+        case "decimalPlaces":
+          U = 10;
+          break;
+        case "toleranceAbsolute":
+        case "tolerancePercent":
+        case "toleranceRange":
+        case "setThousandsSeparator":
+        case "setDecimalSeparator":
+        case "dontExpandPowers":
+        case "dontFactorDenominators":
+        case "dontFactorTerms":
+        case "dontConvertDecimalToFraction":
+        case "strict":
+        case "antiderivative":
+          U = void 0;
+          break;
+        case "types":
+          U = {};
+          break;
+        default:
+          U = !1;
+          break;
+      }
+    return U;
+  };
+})(new ka());
+const ei = function() {
+  Ee.reserveCodeRange(4e3, 4999, "core");
+  const e = Ee.messages, t = Ee.message, r = Ee.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";
+  const n = 10 ** -6, a = {
+    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: n },
+    "\\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 o(g, m) {
+    switch (g) {
+      case "field":
+        switch (m) {
+          case void 0:
+          case "integer":
+          case "real":
+          case "complex":
+            break;
+          default:
+            r(!1, t(4007, [g, m]));
+            break;
+        }
+        break;
+      case "decimalPlaces":
+        if (m === void 0 || +m >= 0 && +m <= 20)
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      case "toleranceAbsolute":
+        if (m === void 0 || +m >= 0 || typeof m == "string")
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      case "tolerancePercent":
+        if (m === void 0 || +m >= 0)
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      case "toleranceRange":
+        if (m === void 0 || m instanceof Array && m.length === 2)
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      case "antiderivative":
+        if (typeof m > "u" || typeof m == "string")
+          break;
+        r(!1, t(4007, [g, m]));
+        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 (typeof m > "u" || typeof m == "boolean")
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      case "setThousandsSeparator":
+        if (typeof m > "u" || typeof m == "string" && m.length === 1 || m instanceof Array)
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      case "setDecimalSeparator":
+        if (typeof m > "u" || typeof m == "string" && m.length === 1 || m instanceof Array && m.length > 0 && m[0].length === 1)
+          break;
+        r(!1, t(4007, [g, JSON.stringify(m)]));
+        break;
+      case "words":
+      case "rules":
+      case "types":
+      case "data":
+      case "env":
+      case "expanderBuilders":
+        if (typeof m > "u" || typeof m == "object")
+          break;
+        r(!1, t(4007, [g, m]));
+        break;
+      default:
+        r(!1, t(4006, [g]));
+        break;
+    }
+  }
+  function i(g) {
+    g && Object.keys(g).forEach((m) => {
+      o(m, g[m]);
+    });
+  }
+  function l(g, m, h) {
+    g || (g = {}), g.rules || (g.words = Vt.words, g.rules = Vt.rules, g.types = Vt.types);
+    const x = {
+      method: "translate",
+      options: g
+    };
+    g.allowInterval = !0, f(x, h).evaluate(m, (w, U) => {
+      h(w, U);
+    });
+  }
+  function p(g, m) {
+    return g || (g = {}), g.rules || (g.words = Vt.words, g.rules = Vt.rules, g.types = Vt.types), g.expanderBuilders = m || {}, g.allowInterval = !0, function(x, N) {
+      f({
+        method: "translate",
+        options: g
+      }, N).evaluate(x, (Q, ee) => {
+        N(Q, ee);
+      });
+    };
+  }
+  function f(g, m) {
+    let h;
+    const x = g.method, N = g.value, w = d.options = g.options, U = w.words ? Object.fromEntries(
+      Object.keys(w.words).flatMap((ie) => [
+        [ie.toLowerCase(), { type: "var" }],
+        [ie.toUpperCase(), { type: "var" }]
+      ])
+    ) : {};
+    let Q;
+    try {
+      Ee.setLocation("spec"), i(w), d.pushEnv({
+        ...a,
+        ...U,
+        ...w.env
+      }), h = N !== void 0 ? d.create(w, N, "spec") : void 0, d.popEnv();
+    } catch (ie) {
+      Q = ie, m([{
+        result: null,
+        errorCode: G(ie.message),
+        message: Y(ie.message),
+        stack: ie.stack,
+        location: ie.location,
+        model: null,
+        // Unused, for now.
+        toString() {
+          return `${this.errorCode}: (${this.location}) ${this.message}
+${this.stack}`;
+        }
+      }], "");
+    }
+    return {
+      evaluate: function(Ce, xe) {
+        try {
+          if (Q)
+            throw Q;
+          Ee.setLocation("user"), r(Ce !== void 0, t(4002)), d.pushEnv({
+            ...a,
+            ...U,
+            ...w.env
+          });
+          const ve = d.create(w, Ce, "user");
+          r(ve, t(4008, ["invalid input"])), Ee.setLocation("spec");
+          let de;
+          switch (x) {
+            case "translate":
+              de = ve.translate(w);
+              break;
+            default:
+              r(!1, t(4004, [x]));
+              break;
+          }
+          d.popEnv(), xe([], de);
+        } catch (ve) {
+          console.log(`ERROR evaluate() ${ve.stack}`);
+          const de = ve.message;
+          xe([{
+            result: null,
+            errorCode: G(de),
+            message: Y(de),
+            stack: ve.stack,
+            location: ve.location,
+            toString() {
+              return `${this.errorCode}: (${this.location}) ${this.message}
+${this.stack}`;
+            }
+          }], "");
+        }
+      },
+      model: h
+    };
+    function G(ie) {
+      ie = typeof ie == "string" && ie || "";
+      const Ce = +ie.slice(0, ie.indexOf(":"));
+      return Number.isNaN(Ce) ? 0 : Ce;
+    }
+    function Y(ie) {
+      return G(ie) ? ie.slice(ie.indexOf(":") + 2) : ie;
+    }
+  }
+  return {
+    translate: l,
+    buildTranslator: p
+  };
+}();
+typeof window < "u" && (window.Core = ei);
+const Ha = (e, t) => Array.from({ length: t.charCodeAt(0) - e.charCodeAt(0) + 1 }, (r, n) => String.fromCharCode(e.charCodeAt(0) + n)), Ka = (e, t) => {
+  const r = +e, n = +t;
+  return Array.from({ length: n - r + 1 }, (a, o) => String(r + o));
+}, yt = (e) => {
+  try {
+    return new ue(e) !== null;
+  } catch {
+    return !1;
+  }
+}, os = (e) => [e.slice(0, 1), e.slice(1)], Ga = (e) => e.toUpperCase() >= "A" && e.toUpperCase() <= "Z", qa = (e) => /^-?\d+$/.test(e), Wa = (e) => os(e).reduce((t, r, n) => n === 0 && Ga(r) || qa(r), !1), Xa = () => (e = {}, t, r) => {
+  if (r === 0)
+    return {
+      start: os(t)
+    };
+  const n = e.start, a = os(t), o = Ha(n[0], a[0]), i = Ka(n[1], a[1]);
+  return o.flatMap((p) => i.map((f) => p.toUpperCase() + f)).filter((p) => p !== void 0).join(",");
+}, Qa = (e) => e, ja = () => (e = [], t) => [
+  ...e,
+  t.toUpperCase()
+], Za = (e) => {
+  const t = {
+    currency: "",
+    thousandsSeparator: ",",
+    decimalSeparator: ".",
+    decimalPlaces: 0,
+    prefix: "",
+    suffix: "",
+    showThousands: !1,
+    accountingStyle: !1
+  };
+  e.startsWith("(") && e.endsWith(")") && (t.accountingStyle = !0, e = e.slice(1, -1));
+  const r = ["$", "€", "¥", "£", "₹", "₽", "¢"];
+  let n = e;
+  r.some((o) => n.startsWith(o) ? (t.currency = o, t.prefix = o, n = n.slice(1), !0) : !1), t.currency || r.some((o) => n.includes(`_${o}`) ? (t.currency = o, t.suffix = o, n = n.replace(`_${o}`, ""), !0) : !1), (n.includes("#,##0") || n.includes("#.##0") || n.includes("# ##0")) && (t.showThousands = !0, n.includes("#,##0.") ? (t.thousandsSeparator = ",", t.decimalSeparator = ".") : n.includes("#.##0,") ? (t.thousandsSeparator = ".", t.decimalSeparator = ",") : n.includes("# ##0,") ? (t.thousandsSeparator = " ", t.decimalSeparator = ",") : n.includes("# ##0.") || n.includes("# ##0") ? (t.thousandsSeparator = " ", t.decimalSeparator = ".") : n.includes("#.##0") && (t.thousandsSeparator = ".", t.decimalSeparator = ","));
+  const a = n.match(/[.,]0+$/);
+  return a && (t.decimalPlaces = a[0].length - 1), t;
+}, ti = (e, t) => {
+  const r = Number(e);
+  if (Number.isNaN(r))
+    return e;
+  const {
+    thousandsSeparator: n,
+    decimalSeparator: a,
+    decimalPlaces: o,
+    prefix: i,
+    suffix: l,
+    showThousands: p,
+    accountingStyle: f
+  } = t, g = r < 0;
+  let h = Math.abs(r).toFixed(o);
+  if (a !== "." && (h = h.replace(".", a)), p) {
+    const x = h.split(a), N = x[0], w = x[1] || "", U = N.replace(/\B(?=(\d{3})+(?!\d))/g, n);
+    h = w ? `${U}${a}${w}` : U;
+  }
+  return h = `${i}${h}${l}`, f && g ? `(${h})` : g ? `-${h}` : h;
+}, za = (e, t = 2) => ti(e, {
+  thousandsSeparator: ",",
+  decimalSeparator: ".",
+  decimalPlaces: t,
+  prefix: "$",
+  suffix: "",
+  showThousands: !0
+}), Ja = (e) => {
+  const t = ["m/", "d/", "y", "mmm", "mmmm", "ddd", "dddd"], r = e.toLowerCase();
+  return t.some((n) => r.includes(n));
+}, Ya = (e) => {
+  if (e instanceof Date)
+    return Number.isNaN(e.getTime()) ? null : e;
+  const t = Number(e);
+  if (!Number.isNaN(t)) {
+    if (t >= 0 && t < 2957004) {
+      const n = Math.floor(t), a = new Date(Date.UTC(1904, 0, 1));
+      return new Date(a.getTime() + n * 24 * 60 * 60 * 1e3);
+    }
+    if (t > 2957004)
+      return new Date(t);
+  }
+  const r = new Date(e);
+  return Number.isNaN(r.getTime()) ? null : r;
+}, eo = (e, t) => {
+  if (!e || !(e instanceof Date) || Number.isNaN(e.getTime()))
+    return String(e || "");
+  const r = (p, f = 2) => String(p).padStart(f, "0"), n = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"], a = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"], o = {
+    yyyy: String(e.getFullYear()),
+    yy: r(e.getFullYear() % 100),
+    mmmm: a[e.getMonth()],
+    mmm: n[e.getMonth()],
+    mm: r(e.getMonth() + 1),
+    m: String(e.getMonth() + 1),
+    dd: r(e.getDate()),
+    d: String(e.getDate())
+  };
+  let i = "", l = 0;
+  for (; l < t.length; ) {
+    let p = !1;
+    Object.keys(o).sort((g, m) => m.length - g.length).some((g) => t.substring(l, l + g.length).toLowerCase() === g ? (i += o[g], l += g.length, p = !0, !0) : !1), p || (i += t[l], l++);
+  }
+  return i;
+}, to = ({ env: e, args: t }) => {
+  const r = t[1] || e.format || "";
+  let n;
+  if (r.toLowerCase() === "currency")
+    n = za(t[0]);
+  else if (r.includes("#") || r.includes("0")) {
+    const a = Za(r);
+    n = ti(t[0], a);
+  } else if (Ja(r)) {
+    const a = Ya(t[0]);
+    n = a ? eo(a, r) : t[0];
+  } else
+    n = t[0];
+  return n;
+}, Et = ({ env: e, str: t }) => {
+  var r;
+  return Wa(t) && ((r = e[t.toUpperCase()]) == null ? void 0 : r.val) || t;
+}, ro = (e) => {
+  if (e == null || e === "")
+    return !1;
+  if (typeof e == "string") {
+    const t = e.trim();
+    if (t === "" || t === "0" || t.toUpperCase() === "FALSE")
+      return !1;
+  }
+  return typeof e == "number" || e instanceof ue ? +e != 0 : !0;
+}, Rt = {
+  round: (e) => (t = "", r, n) => {
+    const a = Et({ env: e, str: r });
+    if (yt(a)) {
+      if (n === 0)
+        return new ue(a);
+      if (n === 1)
+        return new ue(t).toDecimalPlaces(+a, ue.ROUND_HALF_UP);
+    }
+    return t;
+  },
+  sum: (e) => (t = 0, r) => {
+    const n = Et({ env: e, str: r });
+    return yt(n) ? new ue(t).plus(new ue(n)) : t;
+  },
+  minus: (e) => (t = "", r, n) => {
+    const a = Et({ env: e, str: r });
+    return yt(a) ? n === 0 ? new ue(a) : new ue(t).minus(new ue(a)) : t;
+  },
+  multiply: (e) => (t = 1, r) => {
+    const n = Et({ env: e, str: r });
+    return yt(n) ? new ue(t).times(new ue(n)) : t;
+  },
+  mul: (e) => (t = 1, r) => {
+    const n = Et({ env: e, str: r });
+    return yt(n) ? new ue(t).times(new ue(n)) : t;
+  },
+  divide: (e) => (t = "", r, n) => {
+    const a = Et({ env: e, str: r });
+    return yt(a) ? n === 0 ? new ue(a) : new ue(t).dividedBy(new ue(a)) : t;
+  },
+  normalize: ja,
+  range: Xa,
+  if: (e) => (t = null, r, n) => (r = Et({ env: e, str: r }), n === 0 ? { condition: ro(r), trueValue: null, falseValue: null } : n === 1 ? { ...t, trueValue: r } : n === 2 ? t.condition ? t.trueValue : r : t),
+  average: (e) => {
+    let t = new ue(0), r = 0;
+    return (n, a) => (a = Et({ env: e, str: a }), yt(a) && (t = t.plus(new ue(a)), r++), r > 0 ? t.dividedBy(r) : new ue(0));
+  }
+}, ri = {
+  $cell: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => {
+      var r;
+      return ((r = e[t[1].toUpperCase()]) == null ? void 0 : r.val) || "0";
+    }
+  },
+  $fmt: {
+    type: "fn",
+    fn: ({ config: e, env: t }) => (r) => {
+      var n, a, o;
+      if (e.rawConfig) {
+        const i = e.rawConfig.slice(1, -1);
+        if (i.includes("isNegative:true")) {
+          const l = ((n = t.format) == null ? void 0 : n.formatString) || t.format || "";
+          r = [`-${r[0]}`, l];
+        } else if (i.includes("isNegative:false")) {
+          const l = ((a = t.format) == null ? void 0 : a.formatString) || t.format || "";
+          r = [r[0], l];
+        } else {
+          const l = i.indexOf(",");
+          if (l >= 0) {
+            let p = i.slice(0, l);
+            const f = i.slice(l + 1);
+            p = p.replace("%1", r[0]), r = [p, f];
+          }
+        }
+      } else if (r.length === 1) {
+        const i = ((o = t.format) == null ? void 0 : o.formatString) || t.format || "";
+        r = [r[0], i];
+      }
+      return to({ env: t, args: r });
+    }
+  },
+  $range: {
+    type: "fn",
+    fn: () => (e) => e.reduce(Rt.range(), void 0)
+  },
+  $add: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => `${t.reduce(Rt.sum(e), void 0)}`
+  },
+  $minus: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => (t.length === 1 && t.unshift("0"), `${t.reduce(Rt.minus(e), void 0)}`)
+  },
+  $multiply: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => `${t.reduce(Rt.multiply(e), void 0)}`
+  },
+  $percent: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => (t.push("0.01"), `${t.reduce(Rt.multiply(e), void 0)}`)
+  },
+  $divide: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => `${t.reduce(Rt.divide(e), void 0)}`
+  },
+  $fn: {
+    type: "fn",
+    fn: ({ env: e }) => (t) => `${t[1].split(",").reduce(Rt[t[0].toLowerCase()](e), void 0)}`
+  },
+  $normalize: {
+    type: "fn",
+    fn: ({ config: e, env: t }) => (r) => `${r.reduce(Qa(Rt.normalize(t)), e == null ? void 0 : e.acc)}`
+  }
+}, ni = ei, no = {
+  words: {
+    average: "average",
+    if: "if",
+    mul: "mul",
+    round: "round",
+    sum: "sum"
+  },
+  types: {
+    args: [
+      "\\type{cellName}:\\type{cellName}",
+      "?,?"
+    ],
+    cellName: [
+      "\\type{variable}\\type{integer}"
+    ],
+    cellRange: [
+      "\\type{cellName}:\\type{cellName}"
+    ],
+    fn: [
+      "average",
+      "if",
+      "mul",
+      "round",
+      "sum"
+    ]
+  },
+  rules: {
+    "=\\type{cellName}": [
+      "$cell"
+    ],
+    "=?": [
+      {
+        "%2": {
+          "\\type{fn}(\\type{args})": "$fn",
+          "\\type{fn}(?,?)": "$fn",
+          "\\type{fn}(?)": "$fn",
+          "?+?": "$add",
+          "?-?": "$minus",
+          "?*?": "$multiply",
+          "?/?": "$divide",
+          "?%": "$percent",
+          "-?": "$minus"
+        }
+      }
+    ],
+    "-?": [
+      "-%1"
+    ],
+    "\\type{cellRange}": [
+      "$range"
+    ],
+    "\\type{args}": [
+      "%1,%2"
+    ],
+    "\\type{cellName}": [
+      "%1%2"
+    ],
+    "\\type{fn}(\\type{cellRange})": [
+      "%1(%2)"
+    ],
+    "??": [
+      "%1%2"
+    ],
+    "{{var:\\type{cellName}}}": [
+      "{{var:%2}}"
+    ],
+    "?": [
+      "%1"
+    ]
+  }
+}, So = {
+  rules: {
+    "??": [
+      "%1%2"
+    ],
+    "-\\type{number}": [
+      {
+        "%1": {
+          "\\type{number}": "$fmt{isNegative:true}"
+        }
+      }
+    ],
+    "\\type{number}": [
+      "$fmt{isNegative:false}"
+    ],
+    "?": [
+      "%1"
+    ]
+  }
+}, so = {
+  types: {
+    cellName: [
+      "\\type{variable}\\type{integer}"
+    ],
+    cellRange: [
+      "\\type{cellName}:\\type{cellName}"
+    ],
+    fn: [
+      "average",
+      "if",
+      "mul",
+      "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"
+    ]
+  }
+}, io = (e) => ['"', "'", "`"].includes(e), si = (e) => (typeof e != "string" && (e = e == null ? "" : String(e)), e && e.split("").reduce((t, r) => ({
+  inString: io(r) ? !t.inString : t.inString,
+  text: t.text + (t.inString && r || r.toUpperCase())
+}), { inString: !1, text: "" }).text || e), ii = (e) => {
+  if (!e || typeof e != "string") return !1;
+  const t = e.trim();
+  return !isNaN(Number(t)) && !isNaN(parseFloat(t));
+}, ao = (e) => {
+  if (!e || typeof e != "string") return !1;
+  const t = e.trim();
+  return [
+    /^\d{1,2}\/\d{1,2}\/\d{2,4}$/,
+    // MM/DD/YYYY or M/D/YY
+    /^\d{1,2}-\d{1,2}-\d{2,4}$/,
+    // MM-DD-YYYY or M-D-YY
+    /^\d{4}-\d{1,2}-\d{1,2}$/,
+    // YYYY-MM-DD
+    /^\d{1,2}\/\d{1,2}$/,
+    // MM/DD
+    /^\d{1,2}-\d{1,2}$/
+    // MM-DD
+  ].some((n) => n.test(t)) && !isNaN(Date.parse(t));
+}, oo = (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("\\") || ii(e) || ao(e) ? e : `\\text{${e}}`), co = (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;
+  const n = t;
+  ["$", "€", "£", "¥", "₹", "₽", "R$", "C$", "A$", "NZ$", "HK$", "S$"].forEach((w) => {
+    const U = w.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+    t = t.replace(new RegExp(U, "g"), "");
+  });
+  const o = t.includes("%");
+  t = t.replace(/%/g, "");
+  const i = /^\s*\([^)]+\)\s*$/.test(n) && /\d/.test(n);
+  i && (t = t.replace(/[()]/g, "")), t = t.replace(/\s/g, "");
+  const l = t.startsWith("-");
+  l && (t = t.substring(1));
+  const p = (t.match(/,/g) || []).length, f = (t.match(/\./g) || []).length, g = t.lastIndexOf(","), m = t.lastIndexOf(".");
+  let h;
+  if (p === 0 && f === 0 || p === 0 && f === 1 ? h = t : p === 1 && f === 0 ? t.substring(g + 1).length === 3 && t.length > 4 ? h = t.replace(/,/g, "") : h = t.replace(",", ".") : g > m ? h = t.replace(/\./g, "").replace(",", ".") : h = t.replace(/,/g, ""), !ii(h))
+    return null;
+  let N = parseFloat(h);
+  return (l || i) && (N = -Math.abs(N)), o && (N = N / 100), N;
+}, Nt = (e) => {
+  const t = new Date(1904, 0, 1), r = 24 * 60 * 60 * 1e3;
+  return Math.floor((e.getTime() - t.getTime()) / r) + 1;
+}, lo = (e) => {
+  if (!e || typeof e != "string")
+    return null;
+  const t = e.trim();
+  if (!t)
+    return null;
+  const r = /* @__PURE__ */ new Date(), n = t.toLowerCase();
+  if (n === "today")
+    return Nt(new Date(r.getFullYear(), r.getMonth(), r.getDate()));
+  if (n === "tomorrow") {
+    const x = new Date(r);
+    return x.setDate(r.getDate() + 1), Nt(new Date(x.getFullYear(), x.getMonth(), x.getDate()));
+  }
+  if (n === "yesterday") {
+    const x = new Date(r);
+    return x.setDate(r.getDate() - 1), Nt(new Date(x.getFullYear(), x.getMonth(), x.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)) {
+    const x = Date.parse(t);
+    if (!isNaN(x))
+      return Nt(new Date(x));
+  }
+  const o = /^(\d{1,2})[/\-.](\d{1,2})[/\-.](\d{4})$/, i = t.match(o);
+  if (i) {
+    const x = parseInt(i[1], 10), N = parseInt(i[2], 10), w = parseInt(i[3], 10);
+    if (x >= 1 && x <= 12 && N >= 1 && N <= 31)
+      return Nt(new Date(w, x - 1, N));
+  }
+  const l = /^(\d{1,2})[/\-.](\d{1,2})[/\-.](\d{4})$/, p = t.match(l);
+  if (p) {
+    const x = parseInt(p[1], 10), N = parseInt(p[2], 10), w = parseInt(p[3], 10);
+    if (N >= 1 && N <= 12 && x >= 1 && x <= 31 && x > 12)
+      return Nt(new Date(w, N - 1, x));
+  }
+  const f = /^(\d{1,2})[/-](\d{1,2})$/, g = t.match(f);
+  if (g) {
+    const x = parseInt(g[1], 10), N = parseInt(g[2], 10);
+    if (x >= 1 && x <= 12 && N >= 1 && N <= 31)
+      return Nt(new Date(r.getFullYear(), x - 1, N));
+  }
+  const m = /^(\d{4})-(\d{1,2})-(\d{1,2})$/, h = t.match(m);
+  if (h) {
+    const x = parseInt(h[1], 10), N = parseInt(h[2], 10), w = parseInt(h[3], 10);
+    if (N >= 1 && N <= 12 && w >= 1 && w <= 31)
+      return Nt(new Date(x, N - 1, w));
+  }
+  return null;
+};
+function ai(e) {
+  const t = e.indexOf("!");
+  return t < 0 ? [void 0, e] : [e.slice(0, t), e.slice(t + 1)];
+}
+const uo = (e, t) => `${e}!${t}`;
+function oi(e, t) {
+  return Object.keys(t || {}).reduce((r, n) => (r[uo(e, n)] = t[n], r), {});
+}
+function Oo(e, t) {
+  const r = {};
+  for (const n of Object.keys(e || {})) {
+    const [a, o] = ai(n);
+    a === t && (r[o] = e[n]);
+  }
+  return r;
+}
+function ls(e, t) {
+  const r = {};
+  for (const n of t) r[n] = {};
+  for (const n of Object.keys(e || {})) {
+    const [a, o] = ai(n), i = a ?? t[0];
+    r[i] || (r[i] = {}), r[i][o] = e[n];
+  }
+  return r;
+}
+const Us = (e) => {
+  if (typeof e == "number")
+    return [e];
+  if (e == null)
+    return [e];
+  const t = String(e);
+  let r = [t];
+  try {
+    const n = {
+      // allowThousandsSeparator: true,
+      keepTextWhitespace: !0,
+      ...so
+    };
+    if (t && t.length > 0) {
+      const a = t.indexOf("=") === 0 ? si(t) : oo(t);
+      ni.buildTranslator(n, ri)(a, (i, l) => {
+        i && i.length && console.error(i), r = t.indexOf("=") === 0 ? l.split(",") : [l];
+      });
+    }
+  } catch (n) {
+    console.log("parse error: " + n.stack);
+  }
+  return r;
+}, fo = (e, t) => {
+  const r = Us(e), n = Us(t);
+  return r.length !== n.length ? !1 : r.every((a, o) => {
+    const i = n[o];
+    return a === i;
+  });
+}, po = (e, t, r, n) => r && n && r !== n ? !1 : e !== void 0 && e === t, go = (e, t) => {
+  if (!e || !e.startsWith("=") || !t)
+    return e;
+  const r = {};
+  for (const [l, p] of Object.entries(t))
+    r[l] = { ...p, val: p.val || p.text };
+  const n = {
+    keepTextWhitespace: !0,
+    env: r,
+    ...no
+  }, a = si(e), o = ni.buildTranslator(n, ri);
+  let i = e;
+  return o(a, (l, p) => {
+    (!l || !l.length) && (i = String(p));
+  }), i;
+}, ho = ({ method: e, expected: t, points: r = 1 }, { val: n, formula: a, type: o } = { val: void 0, formula: void 0, type: void 0 }, i = void 0) => {
+  if (e === "value") {
+    let l = t;
+    typeof t == "string" && t.startsWith("=") && (l = go(t, i));
+    let p = "text", f = l;
+    if (l != null) {
+      const g = String(l), m = lo(g);
+      if (m)
+        p = "date", f = String(m);
+      else {
+        const h = co(g);
+        h !== null && (p = "number", f = String(h));
+      }
+    }
+    if (po(n, f, o, p))
+      return { points: r, isValid: !0 };
+  } else if (e === "formula" && fo(a, t))
+    return { points: r, isValid: !0 };
+  return { points: 0, isValid: !1 };
+}, mo = (e) => e.text || e.val, Co = (e) => {
+  var t, r;
+  return (e == null ? void 0 : e.text) || ((r = (t = e == null ? void 0 : e.attrs) == null ? void 0 : t.assess) == null ? void 0 : r.expected);
+}, xo = ({ cells: e, primaryColumn: t }) => {
+  const n = Object.keys(e).sort((o, i) => +o.slice(1) - +i.slice(1)).map((o) => o.slice(0, 1) === t && o || null).filter((o) => o !== null).map(
+    (o) => mo(e[o]) || null
+  ), a = /* @__PURE__ */ new Set();
+  return n.map((o) => a.has(o) ? null : (a.add(o), o)).filter((o) => o !== null);
+}, Ao = ({ cells: e, region: t }) => {
+  const { primaryColumn: r, rows: n } = t, a = xo({ cells: e, primaryColumn: r }), o = new Map(
+    n.map((l) => [Co(l[r]), l])
+  );
+  return a.map((l) => l !== null && o.get(l) || null);
+}, To = ({ cells: e, region: t }) => {
+  const r = (t == null ? void 0 : t.order) === "actual" && Ao({ cells: e, region: t }) || (t == null ? void 0 : t.rows) || [];
+  if (!t)
+    throw new Error("getCellsValidationFromRegionValidation() missing region value");
+  return r.reduce((a, o, i) => (
+    // TODO mark holes as errors.
+    (i = (o == null ? void 0 : o.id) || i + 1, o && Object.keys(o).forEach((l) => {
+      var p;
+      return ((p = o[l]) == null ? void 0 : p.assess) && (a[l + i] = o[l]);
+    }), a)
+  ), {}) || {};
+}, Eo = ({ cells: e, validation: t }) => {
+  const r = t.regions || t.ranges, n = Object.keys(r).find((a) => a);
+  return [{
+    region: r[n] || {},
+    cells: e
+  }];
+}, gn = ({ cells: e, validation: t }) => Eo({ cells: e, validation: t }).map((a) => To(a))[0], ci = (e) => {
+  const t = e != null && e.sheets ? Object.keys(e.sheets) : null;
+  return t && t.length ? t : null;
+}, Ro = (e, t, r) => {
+  if (!e) return;
+  const n = ls(e, r);
+  return Object.keys(n[t] || {}).length ? n[t] : e;
+}, wo = ({ cells: e, validation: t }) => {
+  const r = ci(t);
+  if (!r) return gn({ cells: e, validation: t });
+  const n = ls(e || {}, r);
+  return r.reduce((a, o) => Object.assign(
+    a,
+    oi(o, gn({ cells: n[o], validation: t.sheets[o] }))
+  ), {});
+}, bo = ({ cells: e, validation: t, interactionCells: r = void 0 }) => {
+  const n = ci(t);
+  if (!n) {
+    const o = gn({ cells: e, validation: t });
+    return $s(e, o, r);
+  }
+  const a = ls(e || {}, n);
+  return n.reduce((o, i) => {
+    const l = gn({ cells: a[i], validation: t.sheets[i] }), p = $s(a[i], l, Ro(r, i, n));
+    return Object.assign(o, oi(i, p));
+  }, {});
+};
+function $s(e, t, r) {
+  return Object.keys(t).reduce((n, a) => ({
+    ...n,
+    [a]: n[a] && {
+      ...n[a],
+      score: ho(t[a].assess, n[a], r)
+    } || void 0
+  }), e);
+}
+export {
+  ni as T,
+  co as a,
+  ri as b,
+  go as c,
+  ao as d,
+  no as e,
+  So as f,
+  wo as g,
+  uo as h,
+  ii as i,
+  ho as j,
+  ls as k,
+  ai as l,
+  lo as n,
+  oi as q,
+  Oo as r,
+  bo as s,
+  si as t,
+  oo as w
+};
+//# sourceMappingURL=index-3_WJgYM5.js.map