useblocks 1.1.72 → 1.1.84

package/static/core/241f0387.js

@@ -1,3189 +0,0 @@
-__useblocks__.define("static/core/241f0387.js", [
-	"require",
-	"exports",
-	"module",
-	"static/core/df237243.js",
-	"static/core/bfab4558.js",
-	"static/core/ce9be2ec2.js",
-	"static/core/dd94baa62.js",
-	"static/core/d082c64e2.js",
-	"react"
-], function(Xe, he, Tn) {
-	const Ze = Xe("./df237243.js"), Ie = Xe("./bfab4558.js"), ct = Xe("./ce9be2ec2.js"), Ht = Xe("./dd94baa62.js"), wt = Xe("./d082c64e2.js");
-	let At = Xe("react");
-	var jt = Ze.__commonJSMin(((b, S) => {
-		S.exports = "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED";
-	})), Wt = Ze.__commonJSMin(((b, S) => {
-		var j = jt();
-		function Q() {}
-		function G() {}
-		G.resetWarningCache = Q, S.exports = function() {
-			function z(J, q, Ee, ae, Be, Fe) {
-				if (Fe !== j) {
-					var te = new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");
-					throw te.name = "Invariant Violation", te;
-				}
-			}
-			z.isRequired = z;
-			function V() {
-				return z;
-			}
-			var Y = {
-				array: z,
-				bigint: z,
-				bool: z,
-				func: z,
-				number: z,
-				object: z,
-				string: z,
-				symbol: z,
-				any: z,
-				arrayOf: V,
-				element: z,
-				elementType: z,
-				instanceOf: V,
-				node: z,
-				objectOf: V,
-				oneOf: V,
-				oneOfType: V,
-				shape: V,
-				exact: V,
-				checkPropTypes: G,
-				resetWarningCache: Q
-			};
-			return Y.PropTypes = Y, Y;
-		};
-	})), Nt = Ze.__commonJSMin(((b, S) => {
-		S.exports = Wt()();
-	}));
-	function _t({ limitsInPlugin: b, hostedAiActive: S }) {
-		return b && !S;
-	}
-	function zt({ limitsInPlugin: b, hostedAiActive: S, counter: j, limit: Q }) {
-		return _t({
-			limitsInPlugin: b,
-			hostedAiActive: S
-		}) ? Q > 0 && j >= Q : !1;
-	}
-	function lt(b, S) {
-		if (b) {
-			if (S === "preview") {
-				const j = b;
-				return j.preview ?? j.test_sends;
-			}
-			return b[S];
-		}
-	}
-	function ut(b, S) {
-		if (b?.flags) {
-			if (S === "preview") {
-				const j = b.flags;
-				return j.preview ?? j.test_sends;
-			}
-			return b.flags[S];
-		}
-	}
-	var Qt = [
-		10,
-		30,
-		300
-	], Ut = [
-		10,
-		50,
-		150
-	];
-	function dt(b, S) {
-		for (const j of S) if (j > b) return j;
-		return "infinity";
-	}
-	function Gt(b) {
-		return b <= 10 ? "email_10_30" : b <= 30 ? "email_30_300" : "email_300_inf";
-	}
-	function Et(b) {
-		return b <= 10 ? "ai_10_50" : b <= 50 ? "ai_30_150" : "ai_150_inf";
-	}
-	function ht(b, S) {
-		return S?.limit_exceeded ? !0 : b.is_unlimited || b.total_limit <= 0 ? !1 : b.remaining <= 0 || b.used >= b.total_limit;
-	}
-	var qt = [
-		"optimization",
-		"image_generate",
-		"preview",
-		"link_check",
-		"image_check",
-		"spam_check"
-	];
-	function $t(b) {
-		return qt.includes(b);
-	}
-	var Xt = {
-		optimization: "optimization_exceeded",
-		image_generate: "image_generate_exceeded",
-		preview: "preview_exceeded",
-		link_check: "link_check_exceeded",
-		image_check: "image_check_exceeded",
-		spam_check: "spam_check_exceeded"
-	};
-	function Ke(b, S, j) {
-		if ($t(b)) return null;
-		const Q = lt(S, b), G = ut(j, b);
-		if (!Q || !ht(Q, G)) return null;
-		const z = Q.total_limit;
-		return {
-			kind: b,
-			presetId: Xt[b],
-			previousLimit: z,
-			nextLimit: "infinity"
-		};
-	}
-	function Kt(b, S) {
-		if (!b) return null;
-		const j = lt(b, "ai"), Q = ut(S, "ai");
-		if (j && ht(j, Q)) {
-			const ae = j.total_limit;
-			return {
-				kind: "ai",
-				presetId: Et(ae),
-				previousLimit: ae,
-				nextLimit: dt(ae, Ut)
-			};
-		}
-		const G = lt(b, "email_generate"), z = ut(S, "email_generate");
-		if (G && ht(G, z)) {
-			const ae = G.total_limit;
-			return {
-				kind: "email_generate",
-				presetId: Gt(ae),
-				previousLimit: ae,
-				nextLimit: dt(ae, Qt)
-			};
-		}
-		const V = Ke("image_generate", b, S);
-		if (V) return V;
-		const Y = Ke("optimization", b, S);
-		if (Y) return Y;
-		const J = Ke("preview", b, S);
-		if (J) return J;
-		const q = Ke("link_check", b, S);
-		if (q) return q;
-		return Ke("image_check", b, S) || Ke("spam_check", b, S);
-	}
-	function Vt(b) {
-		return {
-			presetId: Et(b),
-			previousLimit: b,
-			nextLimit: dt(b, Ut)
-		};
-	}
-	function Yt(b) {
-		const S = String(b ?? "").split(";")[0].trim();
-		if (!S) return "";
-		const j = S.toLowerCase(), Q = j.indexOf("/");
-		if (Q === -1) return j;
-		const G = j.slice(Q + 1);
-		return G === "svg+xml" ? "svg" : G;
-	}
-	async function Zt(b) {
-		if (typeof createImageBitmap == "function") try {
-			const S = await createImageBitmap(b);
-			try {
-				return {
-					width: S.width,
-					height: S.height
-				};
-			} finally {
-				S.close?.();
-			}
-		} catch {}
-		return new Promise((S, j) => {
-			const Q = URL.createObjectURL(b), G = new Image();
-			G.onload = () => {
-				URL.revokeObjectURL(Q);
-				const z = G.naturalWidth || G.width, V = G.naturalHeight || G.height;
-				z > 0 && V > 0 ? S({
-					width: z,
-					height: V
-				}) : j(new Error("Could not read image dimensions"));
-			}, G.onerror = () => {
-				URL.revokeObjectURL(Q), j(new Error("Could not decode image"));
-			}, G.src = Q;
-		});
-	}
-	function gt(b) {
-		return b.trim();
-	}
-	var Jt = 64 * 1024 * 1024, en = 2e3;
-	function rt(b) {
-		b.abandonTimer !== void 0 && (clearTimeout(b.abandonTimer), b.abandonTimer = void 0);
-	}
-	function Ft(b, S) {
-		return S ? new Promise((j, Q) => {
-			if (S.aborted) {
-				Q(new DOMException("Aborted", "AbortError"));
-				return;
-			}
-			const G = () => {
-				Q(new DOMException("Aborted", "AbortError"));
-			};
-			S.addEventListener("abort", G, { once: !0 }), b.then((z) => {
-				S.removeEventListener("abort", G), j(z);
-			}, (z) => {
-				S.removeEventListener("abort", G), Q(z);
-			});
-		}) : b;
-	}
-	function tn(b = {}) {
-		const S = b.maxCacheBytes ?? Jt, j = b.abandonDelayMs ?? en, Q = new Map(), G = new Map();
-		let z = 0;
-		function V(te) {
-			const Z = Q.get(te);
-			Z && (z -= Z.size, Q.delete(te));
-		}
-		function Y(te, Z) {
-			if (V(te), !(Z.size > S)) {
-				Q.set(te, Z), z += Z.size;
-				for (const ge of Q.keys()) {
-					if (z <= S) break;
-					V(ge);
-				}
-			}
-		}
-		function J(te) {
-			const Z = G.get(te);
-			Z && (rt(Z), G.delete(te));
-		}
-		function q(te, Z) {
-			Z.waiters -= 1, !(Z.waiters > 0 || Z.abandonTimer !== void 0 || G.get(te) !== Z) && (Z.abandonTimer = setTimeout(() => {
-				Z.abandonTimer = void 0, !(G.get(te) !== Z || Z.waiters > 0) && (G.delete(te), Z.controller.abort());
-			}, j));
-		}
-		function Ee(te, Z, ge) {
-			return Z.waiters += 1, rt(Z), ge.then(() => q(te, Z), () => q(te, Z)), ge;
-		}
-		async function ae(te, Z, ge) {
-			const me = gt(te);
-			if (!me) throw new Error("Empty image URL");
-			const Pe = Q.get(me);
-			if (Pe) {
-				if (Z?.aborted) throw new DOMException("Aborted", "AbortError");
-				return Q.delete(me), Q.set(me, Pe), Pe;
-			}
-			const le = G.get(me);
-			if (le) return Ee(me, le, Ft(le.promise, Z));
-			const xe = new AbortController(), Ce = {
-				promise: ge(me, xe.signal).then((Te) => (J(me), Y(me, Te), Te)).catch((Te) => {
-					throw J(me), Te;
-				}),
-				controller: xe,
-				waiters: 0,
-				abandonTimer: void 0
-			};
-			return G.set(me, Ce), Ee(me, Ce, Ft(Ce.promise, Z));
-		}
-		function Be(te) {
-			const Z = gt(te);
-			if (!Z) return;
-			const ge = G.get(Z);
-			ge && (rt(ge), ge.controller.abort(), G.delete(Z)), V(Z);
-		}
-		function Fe() {
-			for (const [, te] of G) rt(te), te.controller.abort();
-			G.clear(), Q.clear(), z = 0;
-		}
-		return {
-			resolve: ae,
-			abandonKey: Be,
-			invalidateAll: Fe
-		};
-	}
-	var nn = Ze.__commonJSMin(((b, S) => {
-		(function(j, Q) {
-			typeof b == "object" && typeof S < "u" ? S.exports = Q() : typeof define == "function" && define.amd ? define(Q) : (j = typeof globalThis < "u" ? globalThis : j || self).imageCompression = Q();
-		})(b, (function() {
-			"use strict";
-			function j(R, P) {
-				return P.forEach((function(H) {
-					H && typeof H != "string" && !Array.isArray(H) && Object.keys(H).forEach((function(d) {
-						if (d !== "default" && !(d in R)) {
-							var e = Object.getOwnPropertyDescriptor(H, d);
-							Object.defineProperty(R, d, e.get ? e : {
-								enumerable: !0,
-								get: function() {
-									return H[d];
-								}
-							});
-						}
-					}));
-				})), Object.freeze(R);
-			}
-			function Q(R, P) {
-				return new Promise((function(H, d) {
-					let e;
-					return G(R).then((function(t) {
-						try {
-							return e = t, H(new Blob([
-								P.slice(0, 2),
-								e,
-								P.slice(2)
-							], { type: "image/jpeg" }));
-						} catch (u) {
-							return d(u);
-						}
-					}), d);
-				}));
-			}
-			const G = (R) => new Promise(((P, H) => {
-				const d = new FileReader();
-				d.addEventListener("load", (({ target: { result: e } }) => {
-					const t = new DataView(e);
-					let u = 0;
-					if (t.getUint16(u) !== 65496) return H("not a valid JPEG");
-					for (u += 2;;) {
-						const a = t.getUint16(u);
-						if (a === 65498) break;
-						const m = t.getUint16(u + 2);
-						if (a === 65505 && t.getUint32(u + 4) === 1165519206) {
-							const _ = u + 10;
-							let r;
-							switch (t.getUint16(_)) {
-								case 18761:
-									r = !0;
-									break;
-								case 19789:
-									r = !1;
-									break;
-								default: return H("TIFF header contains invalid endian");
-							}
-							if (t.getUint16(_ + 2, r) !== 42) return H("TIFF header contains invalid version");
-							const i = t.getUint32(_ + 4, r), n = _ + i + 2 + 12 * t.getUint16(_ + i, r);
-							for (let s = _ + i + 2; s < n; s += 12) if (t.getUint16(s, r) == 274) {
-								if (t.getUint16(s + 2, r) !== 3) return H("Orientation data type is invalid");
-								if (t.getUint32(s + 4, r) !== 1) return H("Orientation data count is invalid");
-								t.setUint16(s + 8, 1, r);
-								break;
-							}
-							return P(e.slice(u, u + 2 + m));
-						}
-						u += 2 + m;
-					}
-					return P(new Blob());
-				})), d.readAsArrayBuffer(R);
-			}));
-			var z = {};
-			(function(R) {
-				var P, H, d = {};
-				R.exports = d, d.parse = function(e, t) {
-					for (var u = d.bin.readUshort, a = d.bin.readUint, m = 0, _ = {}, r = new Uint8Array(e), i = r.length - 4; a(r, i) != 101010256;) i--;
-					m = i, m += 4;
-					var n = u(r, m += 4);
-					u(r, m += 2);
-					var s = a(r, m += 2), h = a(r, m += 4);
-					m += 4, m = h;
-					for (var E = 0; E < n; E++) {
-						a(r, m), m += 4, m += 4, m += 4, a(r, m += 4), s = a(r, m += 4);
-						var x = a(r, m += 4), y = u(r, m += 4), D = u(r, m + 2), O = u(r, m + 4);
-						m += 6;
-						var M = a(r, m += 8);
-						m += 4, m += y + D + O, d._readLocal(r, M, _, s, x, t);
-					}
-					return _;
-				}, d._readLocal = function(e, t, u, a, m, _) {
-					var r = d.bin.readUshort, i = d.bin.readUint;
-					i(e, t), r(e, t += 4), r(e, t += 2);
-					var n = r(e, t += 2);
-					i(e, t += 2), i(e, t += 4), t += 4;
-					var s = r(e, t += 8), h = r(e, t += 2);
-					t += 2;
-					var E = d.bin.readUTF8(e, t, s);
-					if (t += s, t += h, _) u[E] = {
-						size: m,
-						csize: a
-					};
-					else {
-						var x = new Uint8Array(e.buffer, t);
-						if (n == 0) u[E] = new Uint8Array(x.buffer.slice(t, t + a));
-						else {
-							if (n != 8) throw "unknown compression method: " + n;
-							var y = new Uint8Array(m);
-							d.inflateRaw(x, y), u[E] = y;
-						}
-					}
-				}, d.inflateRaw = function(e, t) {
-					return d.F.inflate(e, t);
-				}, d.inflate = function(e, t) {
-					return e[0], e[1], d.inflateRaw(new Uint8Array(e.buffer, e.byteOffset + 2, e.length - 6), t);
-				}, d.deflate = function(e, t) {
-					t ??= { level: 6 };
-					var u = 0, a = new Uint8Array(50 + Math.floor(1.1 * e.length));
-					a[u] = 120, a[u + 1] = 156, u += 2, u = d.F.deflateRaw(e, a, u, t.level);
-					var m = d.adler(e, 0, e.length);
-					return a[u + 0] = m >>> 24 & 255, a[u + 1] = m >>> 16 & 255, a[u + 2] = m >>> 8 & 255, a[u + 3] = m >>> 0 & 255, new Uint8Array(a.buffer, 0, u + 4);
-				}, d.deflateRaw = function(e, t) {
-					t ??= { level: 6 };
-					var u = new Uint8Array(50 + Math.floor(1.1 * e.length)), a = d.F.deflateRaw(e, u, a, t.level);
-					return new Uint8Array(u.buffer, 0, a);
-				}, d.encode = function(e, t) {
-					t ??= !1;
-					var u = 0, a = d.bin.writeUint, m = d.bin.writeUshort, _ = {};
-					for (var r in e) {
-						var i = !d._noNeed(r) && !t, n = e[r], s = d.crc.crc(n, 0, n.length);
-						_[r] = {
-							cpr: i,
-							usize: n.length,
-							crc: s,
-							file: i ? d.deflateRaw(n) : n
-						};
-					}
-					for (var r in _) u += _[r].file.length + 30 + 46 + 2 * d.bin.sizeUTF8(r);
-					u += 22;
-					var h = new Uint8Array(u), E = 0, x = [];
-					for (var r in _) {
-						var y = _[r];
-						x.push(E), E = d._writeHeader(h, E, r, y, 0);
-					}
-					var D = 0, O = E;
-					for (var r in _) y = _[r], x.push(E), E = d._writeHeader(h, E, r, y, 1, x[D++]);
-					var M = E - O;
-					return a(h, E, 101010256), E += 4, m(h, E += 4, D), m(h, E += 2, D), a(h, E += 2, M), a(h, E += 4, O), E += 4, E += 2, h.buffer;
-				}, d._noNeed = function(e) {
-					var t = e.split(".").pop().toLowerCase();
-					return "png,jpg,jpeg,zip".indexOf(t) != -1;
-				}, d._writeHeader = function(e, t, u, a, m, _) {
-					var r = d.bin.writeUint, i = d.bin.writeUshort, n = a.file;
-					return r(e, t, m == 0 ? 67324752 : 33639248), t += 4, m == 1 && (t += 2), i(e, t, 20), i(e, t += 2, 0), i(e, t += 2, a.cpr ? 8 : 0), r(e, t += 2, 0), r(e, t += 4, a.crc), r(e, t += 4, n.length), r(e, t += 4, a.usize), i(e, t += 4, d.bin.sizeUTF8(u)), i(e, t += 2, 0), t += 2, m == 1 && (t += 2, t += 2, r(e, t += 6, _), t += 4), t += d.bin.writeUTF8(e, t, u), m == 0 && (e.set(n, t), t += n.length), t;
-				}, d.crc = {
-					table: (function() {
-						for (var e = new Uint32Array(256), t = 0; t < 256; t++) {
-							for (var u = t, a = 0; a < 8; a++) 1 & u ? u = 3988292384 ^ u >>> 1 : u >>>= 1;
-							e[t] = u;
-						}
-						return e;
-					})(),
-					update: function(e, t, u, a) {
-						for (var m = 0; m < a; m++) e = d.crc.table[255 & (e ^ t[u + m])] ^ e >>> 8;
-						return e;
-					},
-					crc: function(e, t, u) {
-						return 4294967295 ^ d.crc.update(4294967295, e, t, u);
-					}
-				}, d.adler = function(e, t, u) {
-					for (var a = 1, m = 0, _ = t, r = t + u; _ < r;) {
-						for (var i = Math.min(_ + 5552, r); _ < i;) m += a += e[_++];
-						a %= 65521, m %= 65521;
-					}
-					return m << 16 | a;
-				}, d.bin = {
-					readUshort: function(e, t) {
-						return e[t] | e[t + 1] << 8;
-					},
-					writeUshort: function(e, t, u) {
-						e[t] = 255 & u, e[t + 1] = u >> 8 & 255;
-					},
-					readUint: function(e, t) {
-						return 16777216 * e[t + 3] + (e[t + 2] << 16 | e[t + 1] << 8 | e[t]);
-					},
-					writeUint: function(e, t, u) {
-						e[t] = 255 & u, e[t + 1] = u >> 8 & 255, e[t + 2] = u >> 16 & 255, e[t + 3] = u >> 24 & 255;
-					},
-					readASCII: function(e, t, u) {
-						for (var a = "", m = 0; m < u; m++) a += String.fromCharCode(e[t + m]);
-						return a;
-					},
-					writeASCII: function(e, t, u) {
-						for (var a = 0; a < u.length; a++) e[t + a] = u.charCodeAt(a);
-					},
-					pad: function(e) {
-						return e.length < 2 ? "0" + e : e;
-					},
-					readUTF8: function(e, t, u) {
-						for (var a, m = "", _ = 0; _ < u; _++) m += "%" + d.bin.pad(e[t + _].toString(16));
-						try {
-							a = decodeURIComponent(m);
-						} catch {
-							return d.bin.readASCII(e, t, u);
-						}
-						return a;
-					},
-					writeUTF8: function(e, t, u) {
-						for (var a = u.length, m = 0, _ = 0; _ < a; _++) {
-							var r = u.charCodeAt(_);
-							if ((4294967168 & r) == 0) e[t + m] = r, m++;
-							else if ((4294965248 & r) == 0) e[t + m] = 192 | r >> 6, e[t + m + 1] = 128 | r >> 0 & 63, m += 2;
-							else if ((4294901760 & r) == 0) e[t + m] = 224 | r >> 12, e[t + m + 1] = 128 | r >> 6 & 63, e[t + m + 2] = 128 | r >> 0 & 63, m += 3;
-							else {
-								if ((4292870144 & r) != 0) throw "e";
-								e[t + m] = 240 | r >> 18, e[t + m + 1] = 128 | r >> 12 & 63, e[t + m + 2] = 128 | r >> 6 & 63, e[t + m + 3] = 128 | r >> 0 & 63, m += 4;
-							}
-						}
-						return m;
-					},
-					sizeUTF8: function(e) {
-						for (var t = e.length, u = 0, a = 0; a < t; a++) {
-							var m = e.charCodeAt(a);
-							if ((4294967168 & m) == 0) u++;
-							else if ((4294965248 & m) == 0) u += 2;
-							else if ((4294901760 & m) == 0) u += 3;
-							else {
-								if ((4292870144 & m) != 0) throw "e";
-								u += 4;
-							}
-						}
-						return u;
-					}
-				}, d.F = {}, d.F.deflateRaw = function(e, t, u, a) {
-					var m = [
-						[
-							0,
-							0,
-							0,
-							0,
-							0
-						],
-						[
-							4,
-							4,
-							8,
-							4,
-							0
-						],
-						[
-							4,
-							5,
-							16,
-							8,
-							0
-						],
-						[
-							4,
-							6,
-							16,
-							16,
-							0
-						],
-						[
-							4,
-							10,
-							16,
-							32,
-							0
-						],
-						[
-							8,
-							16,
-							32,
-							32,
-							0
-						],
-						[
-							8,
-							16,
-							128,
-							128,
-							0
-						],
-						[
-							8,
-							32,
-							128,
-							256,
-							0
-						],
-						[
-							32,
-							128,
-							258,
-							1024,
-							1
-						],
-						[
-							32,
-							258,
-							258,
-							4096,
-							1
-						]
-					][a], _ = d.F.U, r = d.F._goodIndex;
-					d.F._hash;
-					var i = d.F._putsE, n = 0, s = u << 3, h = 0, E = e.length;
-					if (a == 0) {
-						for (; n < E;) i(t, s, n + (A = Math.min(65535, E - n)) == E ? 1 : 0), s = d.F._copyExact(e, n, A, t, s + 8), n += A;
-						return s >>> 3;
-					}
-					var x = _.lits, y = _.strt, D = _.prev, O = 0, M = 0, B = 0, g = 0, T = 0, c = 0;
-					for (E > 2 && (y[c = d.F._hash(e, 0)] = 0), n = 0; n < E; n++) {
-						if (T = c, n + 1 < E - 2) {
-							c = d.F._hash(e, n + 1);
-							var f = n + 1 & 32767;
-							D[f] = y[c], y[c] = f;
-						}
-						if (h <= n) {
-							(O > 14e3 || M > 26697) && E - n > 100 && (h < n && (x[O] = n - h, O += 2, h = n), s = d.F._writeBlock(n == E - 1 || h == E ? 1 : 0, x, O, g, e, B, n - B, t, s), O = M = g = 0, B = n);
-							var v = 0;
-							n < E - 2 && (v = d.F._bestMatch(e, n, D, T, Math.min(m[2], E - n), m[3]));
-							var A = v >>> 16, w = 65535 & v;
-							if (v != 0) {
-								w = 65535 & v;
-								var U = r(A = v >>> 16, _.of0);
-								_.lhst[257 + U]++;
-								var p = r(w, _.df0);
-								_.dhst[p]++, g += _.exb[U] + _.dxb[p], x[O] = A << 23 | n - h, x[O + 1] = w << 16 | U << 8 | p, O += 2, h = n + A;
-							} else _.lhst[e[n]]++;
-							M++;
-						}
-					}
-					for (B == n && e.length != 0 || (h < n && (x[O] = n - h, O += 2, h = n), s = d.F._writeBlock(1, x, O, g, e, B, n - B, t, s), O = 0, M = 0, O = M = g = 0, B = n); (7 & s) != 0;) s++;
-					return s >>> 3;
-				}, d.F._bestMatch = function(e, t, u, a, m, _) {
-					var r = 32767 & t, i = u[r], n = r - i + 32768 & 32767;
-					if (i == r || a != d.F._hash(e, t - n)) return 0;
-					for (var s = 0, h = 0, E = Math.min(32767, t); n <= E && --_ != 0 && i != r;) {
-						if (s == 0 || e[t + s] == e[t + s - n]) {
-							var x = d.F._howLong(e, t, n);
-							if (x > s) {
-								if (h = n, (s = x) >= m) break;
-								n + 2 < x && (x = n + 2);
-								for (var y = 0, D = 0; D < x - 2; D++) {
-									var O = t - n + D + 32768 & 32767, M = O - u[O] + 32768 & 32767;
-									M > y && (y = M, i = O);
-								}
-							}
-						}
-						n += (r = i) - (i = u[r]) + 32768 & 32767;
-					}
-					return s << 16 | h;
-				}, d.F._howLong = function(e, t, u) {
-					if (e[t] != e[t - u] || e[t + 1] != e[t + 1 - u] || e[t + 2] != e[t + 2 - u]) return 0;
-					var a = t, m = Math.min(e.length, t + 258);
-					for (t += 3; t < m && e[t] == e[t - u];) t++;
-					return t - a;
-				}, d.F._hash = function(e, t) {
-					return (e[t] << 8 | e[t + 1]) + (e[t + 2] << 4) & 65535;
-				}, d.saved = 0, d.F._writeBlock = function(e, t, u, a, m, _, r, i, n) {
-					var s, h, E, x, y, D, O, M, B, g = d.F.U, T = d.F._putsF, c = d.F._putsE;
-					g.lhst[256]++, h = (s = d.F.getTrees())[0], E = s[1], x = s[2], y = s[3], D = s[4], O = s[5], M = s[6], B = s[7];
-					var f = 32 + ((n + 3 & 7) == 0 ? 0 : 8 - (n + 3 & 7)) + (r << 3), v = a + d.F.contSize(g.fltree, g.lhst) + d.F.contSize(g.fdtree, g.dhst), A = a + d.F.contSize(g.ltree, g.lhst) + d.F.contSize(g.dtree, g.dhst);
-					A += 14 + 3 * O + d.F.contSize(g.itree, g.ihst) + (2 * g.ihst[16] + 3 * g.ihst[17] + 7 * g.ihst[18]);
-					for (var w = 0; w < 286; w++) g.lhst[w] = 0;
-					for (w = 0; w < 30; w++) g.dhst[w] = 0;
-					for (w = 0; w < 19; w++) g.ihst[w] = 0;
-					var U = f < v && f < A ? 0 : v < A ? 1 : 2;
-					if (T(i, n, e), T(i, n + 1, U), n += 3, U == 0) {
-						for (; (7 & n) != 0;) n++;
-						n = d.F._copyExact(m, _, r, i, n);
-					} else {
-						var p, I;
-						if (U == 1 && (p = g.fltree, I = g.fdtree), U == 2) {
-							d.F.makeCodes(g.ltree, h), d.F.revCodes(g.ltree, h), d.F.makeCodes(g.dtree, E), d.F.revCodes(g.dtree, E), d.F.makeCodes(g.itree, x), d.F.revCodes(g.itree, x), p = g.ltree, I = g.dtree, c(i, n, y - 257), c(i, n += 5, D - 1), c(i, n += 5, O - 4), n += 4;
-							for (var l = 0; l < O; l++) c(i, n + 3 * l, g.itree[1 + (g.ordr[l] << 1)]);
-							n += 3 * O, n = d.F._codeTiny(M, g.itree, i, n), n = d.F._codeTiny(B, g.itree, i, n);
-						}
-						for (var o = _, L = 0; L < u; L += 2) {
-							for (var F = t[L], k = F >>> 23, X = o + (8388607 & F); o < X;) n = d.F._writeLit(m[o++], p, i, n);
-							if (k != 0) {
-								var N = t[L + 1], $ = N >> 16, W = N >> 8 & 255, C = 255 & N;
-								c(i, n = d.F._writeLit(257 + W, p, i, n), k - g.of0[W]), n += g.exb[W], T(i, n = d.F._writeLit(C, I, i, n), $ - g.df0[C]), n += g.dxb[C], o += k;
-							}
-						}
-						n = d.F._writeLit(256, p, i, n);
-					}
-					return n;
-				}, d.F._copyExact = function(e, t, u, a, m) {
-					var _ = m >>> 3;
-					return a[_] = u, a[_ + 1] = u >>> 8, a[_ + 2] = 255 - a[_], a[_ + 3] = 255 - a[_ + 1], _ += 4, a.set(new Uint8Array(e.buffer, t, u), _), m + (u + 4 << 3);
-				}, d.F.getTrees = function() {
-					for (var e = d.F.U, t = d.F._hufTree(e.lhst, e.ltree, 15), u = d.F._hufTree(e.dhst, e.dtree, 15), a = [], m = d.F._lenCodes(e.ltree, a), _ = [], r = d.F._lenCodes(e.dtree, _), i = 0; i < a.length; i += 2) e.ihst[a[i]]++;
-					for (i = 0; i < _.length; i += 2) e.ihst[_[i]]++;
-					for (var n = d.F._hufTree(e.ihst, e.itree, 7), s = 19; s > 4 && e.itree[1 + (e.ordr[s - 1] << 1)] == 0;) s--;
-					return [
-						t,
-						u,
-						n,
-						m,
-						r,
-						s,
-						a,
-						_
-					];
-				}, d.F.getSecond = function(e) {
-					for (var t = [], u = 0; u < e.length; u += 2) t.push(e[u + 1]);
-					return t;
-				}, d.F.nonZero = function(e) {
-					for (var t = "", u = 0; u < e.length; u += 2) e[u + 1] != 0 && (t += (u >> 1) + ",");
-					return t;
-				}, d.F.contSize = function(e, t) {
-					for (var u = 0, a = 0; a < t.length; a++) u += t[a] * e[1 + (a << 1)];
-					return u;
-				}, d.F._codeTiny = function(e, t, u, a) {
-					for (var m = 0; m < e.length; m += 2) {
-						var _ = e[m], r = e[m + 1];
-						a = d.F._writeLit(_, t, u, a);
-						var i = _ == 16 ? 2 : _ == 17 ? 3 : 7;
-						_ > 15 && (d.F._putsE(u, a, r, i), a += i);
-					}
-					return a;
-				}, d.F._lenCodes = function(e, t) {
-					for (var u = e.length; u != 2 && e[u - 1] == 0;) u -= 2;
-					for (var a = 0; a < u; a += 2) {
-						var m = e[a + 1], _ = a + 3 < u ? e[a + 3] : -1, r = a + 5 < u ? e[a + 5] : -1, i = a == 0 ? -1 : e[a - 1];
-						if (m == 0 && _ == m && r == m) {
-							for (var n = a + 5; n + 2 < u && e[n + 2] == m;) n += 2;
-							(s = Math.min(n + 1 - a >>> 1, 138)) < 11 ? t.push(17, s - 3) : t.push(18, s - 11), a += 2 * s - 2;
-						} else if (m == i && _ == m && r == m) {
-							for (n = a + 5; n + 2 < u && e[n + 2] == m;) n += 2;
-							var s = Math.min(n + 1 - a >>> 1, 6);
-							t.push(16, s - 3), a += 2 * s - 2;
-						} else t.push(m, 0);
-					}
-					return u >>> 1;
-				}, d.F._hufTree = function(e, t, u) {
-					var a = [], m = e.length, _ = t.length, r = 0;
-					for (r = 0; r < _; r += 2) t[r] = 0, t[r + 1] = 0;
-					for (r = 0; r < m; r++) e[r] != 0 && a.push({
-						lit: r,
-						f: e[r]
-					});
-					var i = a.length, n = a.slice(0);
-					if (i == 0) return 0;
-					if (i == 1) {
-						var s = a[0].lit;
-						return n = s == 0 ? 1 : 0, t[1 + (s << 1)] = 1, t[1 + (n << 1)] = 1, 1;
-					}
-					a.sort((function(M, B) {
-						return M.f - B.f;
-					}));
-					var h = a[0], E = a[1], x = 0, y = 1, D = 2;
-					for (a[0] = {
-						lit: -1,
-						f: h.f + E.f,
-						l: h,
-						r: E,
-						d: 0
-					}; y != i - 1;) h = x != y && (D == i || a[x].f < a[D].f) ? a[x++] : a[D++], E = x != y && (D == i || a[x].f < a[D].f) ? a[x++] : a[D++], a[y++] = {
-						lit: -1,
-						f: h.f + E.f,
-						l: h,
-						r: E
-					};
-					var O = d.F.setDepth(a[y - 1], 0);
-					for (O > u && (d.F.restrictDepth(n, u, O), O = u), r = 0; r < i; r++) t[1 + (n[r].lit << 1)] = n[r].d;
-					return O;
-				}, d.F.setDepth = function(e, t) {
-					return e.lit != -1 ? (e.d = t, t) : Math.max(d.F.setDepth(e.l, t + 1), d.F.setDepth(e.r, t + 1));
-				}, d.F.restrictDepth = function(e, t, u) {
-					var a = 0, m = 1 << u - t, _ = 0;
-					for (e.sort((function(i, n) {
-						return n.d == i.d ? i.f - n.f : n.d - i.d;
-					})), a = 0; a < e.length && e[a].d > t; a++) {
-						var r = e[a].d;
-						e[a].d = t, _ += m - (1 << u - r);
-					}
-					for (_ >>>= u - t; _ > 0;) (r = e[a].d) < t ? (e[a].d++, _ -= 1 << t - r - 1) : a++;
-					for (; a >= 0; a--) e[a].d == t && _ < 0 && (e[a].d--, _++);
-				}, d.F._goodIndex = function(e, t) {
-					var u = 0;
-					return t[16 | u] <= e && (u |= 16), t[8 | u] <= e && (u |= 8), t[4 | u] <= e && (u |= 4), t[2 | u] <= e && (u |= 2), t[1 | u] <= e && (u |= 1), u;
-				}, d.F._writeLit = function(e, t, u, a) {
-					return d.F._putsF(u, a, t[e << 1]), a + t[1 + (e << 1)];
-				}, d.F.inflate = function(e, t) {
-					var u = Uint8Array;
-					if (e[0] == 3 && e[1] == 0) return t || new u(0);
-					var a = d.F, m = a._bitsF, _ = a._bitsE, r = a._decodeTiny, i = a.makeCodes, n = a.codes2map, s = a._get17, h = a.U, E = t == null;
-					E && (t = new u(e.length >>> 2 << 3));
-					for (var x, y, D = 0, O = 0, M = 0, B = 0, g = 0, T = 0, c = 0, f = 0, v = 0; D == 0;) if (D = m(e, v, 1), O = m(e, v + 1, 2), v += 3, O != 0) {
-						if (E && (t = d.F._check(t, f + (1 << 17))), O == 1 && (x = h.flmap, y = h.fdmap, T = 511, c = 31), O == 2) {
-							M = _(e, v, 5) + 257, B = _(e, v + 5, 5) + 1, g = _(e, v + 10, 4) + 4, v += 14;
-							for (var A = 0; A < 38; A += 2) h.itree[A] = 0, h.itree[A + 1] = 0;
-							var w = 1;
-							for (A = 0; A < g; A++) {
-								var U = _(e, v + 3 * A, 3);
-								h.itree[1 + (h.ordr[A] << 1)] = U, U > w && (w = U);
-							}
-							v += 3 * g, i(h.itree, w), n(h.itree, w, h.imap), x = h.lmap, y = h.dmap, v = r(h.imap, (1 << w) - 1, M + B, e, v, h.ttree);
-							var p = a._copyOut(h.ttree, 0, M, h.ltree);
-							T = (1 << p) - 1;
-							var I = a._copyOut(h.ttree, M, B, h.dtree);
-							c = (1 << I) - 1, i(h.ltree, p), n(h.ltree, p, x), i(h.dtree, I), n(h.dtree, I, y);
-						}
-						for (;;) {
-							var l = x[s(e, v) & T];
-							v += 15 & l;
-							var o = l >>> 4;
-							if (!(o >>> 8)) t[f++] = o;
-							else {
-								if (o == 256) break;
-								var L = f + o - 254;
-								if (o > 264) {
-									var F = h.ldef[o - 257];
-									L = f + (F >>> 3) + _(e, v, 7 & F), v += 7 & F;
-								}
-								var k = y[s(e, v) & c];
-								v += 15 & k;
-								var X = k >>> 4, N = h.ddef[X], $ = (N >>> 4) + m(e, v, 15 & N);
-								for (v += 15 & N, E && (t = d.F._check(t, f + (1 << 17))); f < L;) t[f] = t[f++ - $], t[f] = t[f++ - $], t[f] = t[f++ - $], t[f] = t[f++ - $];
-								f = L;
-							}
-						}
-					} else {
-						7 & v && (v += 8 - (7 & v));
-						var W = 4 + (v >>> 3), C = e[W - 4] | e[W - 3] << 8;
-						E && (t = d.F._check(t, f + C)), t.set(new u(e.buffer, e.byteOffset + W, C), f), v = W + C << 3, f += C;
-					}
-					return t.length == f ? t : t.slice(0, f);
-				}, d.F._check = function(e, t) {
-					var u = e.length;
-					if (t <= u) return e;
-					var a = new Uint8Array(Math.max(u << 1, t));
-					return a.set(e, 0), a;
-				}, d.F._decodeTiny = function(e, t, u, a, m, _) {
-					for (var r = d.F._bitsE, i = d.F._get17, n = 0; n < u;) {
-						var s = e[i(a, m) & t];
-						m += 15 & s;
-						var h = s >>> 4;
-						if (h <= 15) _[n] = h, n++;
-						else {
-							var E = 0, x = 0;
-							h == 16 ? (x = 3 + r(a, m, 2), m += 2, E = _[n - 1]) : h == 17 ? (x = 3 + r(a, m, 3), m += 3) : h == 18 && (x = 11 + r(a, m, 7), m += 7);
-							for (var y = n + x; n < y;) _[n] = E, n++;
-						}
-					}
-					return m;
-				}, d.F._copyOut = function(e, t, u, a) {
-					for (var m = 0, _ = 0, r = a.length >>> 1; _ < u;) {
-						var i = e[_ + t];
-						a[_ << 1] = 0, a[1 + (_ << 1)] = i, i > m && (m = i), _++;
-					}
-					for (; _ < r;) a[_ << 1] = 0, a[1 + (_ << 1)] = 0, _++;
-					return m;
-				}, d.F.makeCodes = function(e, t) {
-					for (var u, a, m, _, r = d.F.U, i = e.length, n = r.bl_count, s = 0; s <= t; s++) n[s] = 0;
-					for (s = 1; s < i; s += 2) n[e[s]]++;
-					var h = r.next_code;
-					for (u = 0, n[0] = 0, a = 1; a <= t; a++) u = u + n[a - 1] << 1, h[a] = u;
-					for (m = 0; m < i; m += 2) (_ = e[m + 1]) != 0 && (e[m] = h[_], h[_]++);
-				}, d.F.codes2map = function(e, t, u) {
-					for (var a = e.length, m = d.F.U.rev15, _ = 0; _ < a; _ += 2) if (e[_ + 1] != 0) for (var r = _ >> 1, i = e[_ + 1], n = r << 4 | i, s = t - i, h = e[_] << s, E = h + (1 << s); h != E;) u[m[h] >>> 15 - t] = n, h++;
-				}, d.F.revCodes = function(e, t) {
-					for (var u = d.F.U.rev15, a = 15 - t, m = 0; m < e.length; m += 2) e[m] = u[e[m] << t - e[m + 1]] >>> a;
-				}, d.F._putsE = function(e, t, u) {
-					u <<= 7 & t;
-					var a = t >>> 3;
-					e[a] |= u, e[a + 1] |= u >>> 8;
-				}, d.F._putsF = function(e, t, u) {
-					u <<= 7 & t;
-					var a = t >>> 3;
-					e[a] |= u, e[a + 1] |= u >>> 8, e[a + 2] |= u >>> 16;
-				}, d.F._bitsE = function(e, t, u) {
-					return (e[t >>> 3] | e[1 + (t >>> 3)] << 8) >>> (7 & t) & (1 << u) - 1;
-				}, d.F._bitsF = function(e, t, u) {
-					return (e[t >>> 3] | e[1 + (t >>> 3)] << 8 | e[2 + (t >>> 3)] << 16) >>> (7 & t) & (1 << u) - 1;
-				}, d.F._get17 = function(e, t) {
-					return (e[t >>> 3] | e[1 + (t >>> 3)] << 8 | e[2 + (t >>> 3)] << 16) >>> (7 & t);
-				}, d.F._get25 = function(e, t) {
-					return (e[t >>> 3] | e[1 + (t >>> 3)] << 8 | e[2 + (t >>> 3)] << 16 | e[3 + (t >>> 3)] << 24) >>> (7 & t);
-				}, d.F.U = (P = Uint16Array, H = Uint32Array, {
-					next_code: new P(16),
-					bl_count: new P(16),
-					ordr: [
-						16,
-						17,
-						18,
-						0,
-						8,
-						7,
-						9,
-						6,
-						10,
-						5,
-						11,
-						4,
-						12,
-						3,
-						13,
-						2,
-						14,
-						1,
-						15
-					],
-					of0: [
-						3,
-						4,
-						5,
-						6,
-						7,
-						8,
-						9,
-						10,
-						11,
-						13,
-						15,
-						17,
-						19,
-						23,
-						27,
-						31,
-						35,
-						43,
-						51,
-						59,
-						67,
-						83,
-						99,
-						115,
-						131,
-						163,
-						195,
-						227,
-						258,
-						999,
-						999,
-						999
-					],
-					exb: [
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						1,
-						1,
-						1,
-						1,
-						2,
-						2,
-						2,
-						2,
-						3,
-						3,
-						3,
-						3,
-						4,
-						4,
-						4,
-						4,
-						5,
-						5,
-						5,
-						5,
-						0,
-						0,
-						0,
-						0
-					],
-					ldef: new P(32),
-					df0: [
-						1,
-						2,
-						3,
-						4,
-						5,
-						7,
-						9,
-						13,
-						17,
-						25,
-						33,
-						49,
-						65,
-						97,
-						129,
-						193,
-						257,
-						385,
-						513,
-						769,
-						1025,
-						1537,
-						2049,
-						3073,
-						4097,
-						6145,
-						8193,
-						12289,
-						16385,
-						24577,
-						65535,
-						65535
-					],
-					dxb: [
-						0,
-						0,
-						0,
-						0,
-						1,
-						1,
-						2,
-						2,
-						3,
-						3,
-						4,
-						4,
-						5,
-						5,
-						6,
-						6,
-						7,
-						7,
-						8,
-						8,
-						9,
-						9,
-						10,
-						10,
-						11,
-						11,
-						12,
-						12,
-						13,
-						13,
-						0,
-						0
-					],
-					ddef: new H(32),
-					flmap: new P(512),
-					fltree: [],
-					fdmap: new P(32),
-					fdtree: [],
-					lmap: new P(32768),
-					ltree: [],
-					ttree: [],
-					dmap: new P(32768),
-					dtree: [],
-					imap: new P(512),
-					itree: [],
-					rev15: new P(32768),
-					lhst: new H(286),
-					dhst: new H(30),
-					ihst: new H(19),
-					lits: new H(15e3),
-					strt: new P(65536),
-					prev: new P(32768)
-				}), (function() {
-					for (var e = d.F.U, t = 0; t < 32768; t++) {
-						var u = t;
-						u = (4278255360 & (u = (4042322160 & (u = (3435973836 & (u = (2863311530 & u) >>> 1 | (1431655765 & u) << 1)) >>> 2 | (858993459 & u) << 2)) >>> 4 | (252645135 & u) << 4)) >>> 8 | (16711935 & u) << 8, e.rev15[t] = (u >>> 16 | u << 16) >>> 17;
-					}
-					function a(m, _, r) {
-						for (; _-- != 0;) m.push(0, r);
-					}
-					for (t = 0; t < 32; t++) e.ldef[t] = e.of0[t] << 3 | e.exb[t], e.ddef[t] = e.df0[t] << 4 | e.dxb[t];
-					a(e.fltree, 144, 8), a(e.fltree, 112, 9), a(e.fltree, 24, 7), a(e.fltree, 8, 8), d.F.makeCodes(e.fltree, 9), d.F.codes2map(e.fltree, 9, e.flmap), d.F.revCodes(e.fltree, 9), a(e.fdtree, 32, 5), d.F.makeCodes(e.fdtree, 5), d.F.codes2map(e.fdtree, 5, e.fdmap), d.F.revCodes(e.fdtree, 5), a(e.itree, 19, 0), a(e.ltree, 286, 0), a(e.dtree, 30, 0), a(e.ttree, 320, 0);
-				})();
-			})({
-				get exports() {
-					return z;
-				},
-				set exports(R) {
-					z = R;
-				}
-			});
-			var V = j({
-				__proto__: null,
-				default: z
-			}, [z]);
-			const Y = (function() {
-				var R = {
-					nextZero(r, i) {
-						for (; r[i] != 0;) i++;
-						return i;
-					},
-					readUshort: (r, i) => r[i] << 8 | r[i + 1],
-					writeUshort(r, i, n) {
-						r[i] = n >> 8 & 255, r[i + 1] = 255 & n;
-					},
-					readUint: (r, i) => 16777216 * r[i] + (r[i + 1] << 16 | r[i + 2] << 8 | r[i + 3]),
-					writeUint(r, i, n) {
-						r[i] = n >> 24 & 255, r[i + 1] = n >> 16 & 255, r[i + 2] = n >> 8 & 255, r[i + 3] = 255 & n;
-					},
-					readASCII(r, i, n) {
-						let s = "";
-						for (let h = 0; h < n; h++) s += String.fromCharCode(r[i + h]);
-						return s;
-					},
-					writeASCII(r, i, n) {
-						for (let s = 0; s < n.length; s++) r[i + s] = n.charCodeAt(s);
-					},
-					readBytes(r, i, n) {
-						const s = [];
-						for (let h = 0; h < n; h++) s.push(r[i + h]);
-						return s;
-					},
-					pad: (r) => r.length < 2 ? `0${r}` : r,
-					readUTF8(r, i, n) {
-						let s, h = "";
-						for (let E = 0; E < n; E++) h += `%${R.pad(r[i + E].toString(16))}`;
-						try {
-							s = decodeURIComponent(h);
-						} catch {
-							return R.readASCII(r, i, n);
-						}
-						return s;
-					}
-				};
-				function P(r, i, n, s) {
-					const h = i * n, E = t(s), x = Math.ceil(i * E / 8), y = new Uint8Array(4 * h), D = new Uint32Array(y.buffer), { ctype: O } = s, { depth: M } = s, B = R.readUshort;
-					if (O == 6) {
-						const F = h << 2;
-						if (M == 8) for (var g = 0; g < F; g += 4) y[g] = r[g], y[g + 1] = r[g + 1], y[g + 2] = r[g + 2], y[g + 3] = r[g + 3];
-						if (M == 16) for (g = 0; g < F; g++) y[g] = r[g << 1];
-					} else if (O == 2) {
-						const F = s.tabs.tRNS;
-						if (F == null) {
-							if (M == 8) for (g = 0; g < h; g++) {
-								var T = 3 * g;
-								D[g] = 255 << 24 | r[T + 2] << 16 | r[T + 1] << 8 | r[T];
-							}
-							if (M == 16) for (g = 0; g < h; g++) T = 6 * g, D[g] = 255 << 24 | r[T + 4] << 16 | r[T + 2] << 8 | r[T];
-						} else {
-							var c = F[0];
-							const k = F[1], X = F[2];
-							if (M == 8) for (g = 0; g < h; g++) {
-								var f = g << 2;
-								T = 3 * g, D[g] = 255 << 24 | r[T + 2] << 16 | r[T + 1] << 8 | r[T], r[T] == c && r[T + 1] == k && r[T + 2] == X && (y[f + 3] = 0);
-							}
-							if (M == 16) for (g = 0; g < h; g++) f = g << 2, T = 6 * g, D[g] = 255 << 24 | r[T + 4] << 16 | r[T + 2] << 8 | r[T], B(r, T) == c && B(r, T + 2) == k && B(r, T + 4) == X && (y[f + 3] = 0);
-						}
-					} else if (O == 3) {
-						const F = s.tabs.PLTE, k = s.tabs.tRNS, X = k ? k.length : 0;
-						if (M == 1) for (var v = 0; v < n; v++) {
-							var A = v * x, w = v * i;
-							for (g = 0; g < i; g++) {
-								f = w + g << 2;
-								var U = 3 * (p = r[A + (g >> 3)] >> 7 - ((7 & g) << 0) & 1);
-								y[f] = F[U], y[f + 1] = F[U + 1], y[f + 2] = F[U + 2], y[f + 3] = p < X ? k[p] : 255;
-							}
-						}
-						if (M == 2) for (v = 0; v < n; v++) for (A = v * x, w = v * i, g = 0; g < i; g++) f = w + g << 2, U = 3 * (p = r[A + (g >> 2)] >> 6 - ((3 & g) << 1) & 3), y[f] = F[U], y[f + 1] = F[U + 1], y[f + 2] = F[U + 2], y[f + 3] = p < X ? k[p] : 255;
-						if (M == 4) for (v = 0; v < n; v++) for (A = v * x, w = v * i, g = 0; g < i; g++) f = w + g << 2, U = 3 * (p = r[A + (g >> 1)] >> 4 - ((1 & g) << 2) & 15), y[f] = F[U], y[f + 1] = F[U + 1], y[f + 2] = F[U + 2], y[f + 3] = p < X ? k[p] : 255;
-						if (M == 8) for (g = 0; g < h; g++) {
-							var p;
-							f = g << 2, U = 3 * (p = r[g]), y[f] = F[U], y[f + 1] = F[U + 1], y[f + 2] = F[U + 2], y[f + 3] = p < X ? k[p] : 255;
-						}
-					} else if (O == 4) {
-						if (M == 8) for (g = 0; g < h; g++) {
-							f = g << 2;
-							var I = r[l = g << 1];
-							y[f] = I, y[f + 1] = I, y[f + 2] = I, y[f + 3] = r[l + 1];
-						}
-						if (M == 16) for (g = 0; g < h; g++) {
-							var l;
-							f = g << 2, I = r[l = g << 2], y[f] = I, y[f + 1] = I, y[f + 2] = I, y[f + 3] = r[l + 2];
-						}
-					} else if (O == 0) for (c = s.tabs.tRNS ? s.tabs.tRNS : -1, v = 0; v < n; v++) {
-						const F = v * x, k = v * i;
-						if (M == 1) for (var o = 0; o < i; o++) {
-							var L = (I = 255 * (r[F + (o >>> 3)] >>> 7 - (7 & o) & 1)) == 255 * c ? 0 : 255;
-							D[k + o] = L << 24 | I << 16 | I << 8 | I;
-						}
-						else if (M == 2) for (o = 0; o < i; o++) L = (I = 85 * (r[F + (o >>> 2)] >>> 6 - ((3 & o) << 1) & 3)) == 85 * c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
-						else if (M == 4) for (o = 0; o < i; o++) L = (I = 17 * (r[F + (o >>> 1)] >>> 4 - ((1 & o) << 2) & 15)) == 17 * c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
-						else if (M == 8) for (o = 0; o < i; o++) L = (I = r[F + o]) == c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
-						else if (M == 16) for (o = 0; o < i; o++) I = r[F + (o << 1)], L = B(r, F + (o << 1)) == c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
-					}
-					return y;
-				}
-				function H(r, i, n, s) {
-					const h = t(r), E = Math.ceil(n * h / 8), x = new Uint8Array((E + 1 + r.interlace) * s);
-					return i = r.tabs.CgBI ? e(i, x) : d(i, x), r.interlace == 0 ? i = u(i, r, 0, n, s) : r.interlace == 1 && (i = (function(D, O) {
-						const M = O.width, B = O.height, g = t(O), T = g >> 3, c = Math.ceil(M * g / 8), f = new Uint8Array(B * c);
-						let v = 0;
-						const A = [
-							0,
-							0,
-							4,
-							0,
-							2,
-							0,
-							1
-						], w = [
-							0,
-							4,
-							0,
-							2,
-							0,
-							1,
-							0
-						], U = [
-							8,
-							8,
-							8,
-							4,
-							4,
-							2,
-							2
-						], p = [
-							8,
-							8,
-							4,
-							4,
-							2,
-							2,
-							1
-						];
-						let I = 0;
-						for (; I < 7;) {
-							const o = U[I], L = p[I];
-							let F = 0, k = 0, X = A[I];
-							for (; X < B;) X += o, k++;
-							let N = w[I];
-							for (; N < M;) N += L, F++;
-							const $ = Math.ceil(F * g / 8);
-							u(D, O, v, F, k);
-							let W = 0, C = A[I];
-							for (; C < B;) {
-								let K = w[I], se = v + W * $ << 3;
-								for (; K < M;) {
-									var l;
-									if (g == 1 && (l = (l = D[se >> 3]) >> 7 - (7 & se) & 1, f[C * c + (K >> 3)] |= l << 7 - ((7 & K) << 0)), g == 2 && (l = (l = D[se >> 3]) >> 6 - (7 & se) & 3, f[C * c + (K >> 2)] |= l << 6 - ((3 & K) << 1)), g == 4 && (l = (l = D[se >> 3]) >> 4 - (7 & se) & 15, f[C * c + (K >> 1)] |= l << 4 - ((1 & K) << 2)), g >= 8) {
-										const ne = C * c + K * T;
-										for (let ee = 0; ee < T; ee++) f[ne + ee] = D[(se >> 3) + ee];
-									}
-									se += g, K += L;
-								}
-								W++, C += o;
-							}
-							F * k != 0 && (v += k * (1 + $)), I += 1;
-						}
-						return f;
-					})(i, r)), i;
-				}
-				function d(r, i) {
-					return e(new Uint8Array(r.buffer, 2, r.length - 6), i);
-				}
-				var e = (function() {
-					const r = { H: {} };
-					return r.H.N = function(i, n) {
-						const s = Uint8Array;
-						let h, E, x = 0, y = 0, D = 0, O = 0, M = 0, B = 0, g = 0, T = 0, c = 0;
-						if (i[0] == 3 && i[1] == 0) return n || new s(0);
-						const f = r.H, v = f.b, A = f.e, w = f.R, U = f.n, p = f.A, I = f.Z, l = f.m, o = n == null;
-						for (o && (n = new s(i.length >>> 2 << 5)); x == 0;) if (x = v(i, c, 1), y = v(i, c + 1, 2), c += 3, y != 0) {
-							if (o && (n = r.H.W(n, T + (1 << 17))), y == 1 && (h = l.J, E = l.h, B = 511, g = 31), y == 2) {
-								D = A(i, c, 5) + 257, O = A(i, c + 5, 5) + 1, M = A(i, c + 10, 4) + 4, c += 14;
-								let F = 1;
-								for (var L = 0; L < 38; L += 2) l.Q[L] = 0, l.Q[L + 1] = 0;
-								for (L = 0; L < M; L++) {
-									const N = A(i, c + 3 * L, 3);
-									l.Q[1 + (l.X[L] << 1)] = N, N > F && (F = N);
-								}
-								c += 3 * M, U(l.Q, F), p(l.Q, F, l.u), h = l.w, E = l.d, c = w(l.u, (1 << F) - 1, D + O, i, c, l.v);
-								const k = f.V(l.v, 0, D, l.C);
-								B = (1 << k) - 1;
-								const X = f.V(l.v, D, O, l.D);
-								g = (1 << X) - 1, U(l.C, k), p(l.C, k, h), U(l.D, X), p(l.D, X, E);
-							}
-							for (;;) {
-								const F = h[I(i, c) & B];
-								c += 15 & F;
-								const k = F >>> 4;
-								if (!(k >>> 8)) n[T++] = k;
-								else {
-									if (k == 256) break;
-									{
-										let X = T + k - 254;
-										if (k > 264) {
-											const K = l.q[k - 257];
-											X = T + (K >>> 3) + A(i, c, 7 & K), c += 7 & K;
-										}
-										const N = E[I(i, c) & g];
-										c += 15 & N;
-										const $ = N >>> 4, W = l.c[$], C = (W >>> 4) + v(i, c, 15 & W);
-										for (c += 15 & W; T < X;) n[T] = n[T++ - C], n[T] = n[T++ - C], n[T] = n[T++ - C], n[T] = n[T++ - C];
-										T = X;
-									}
-								}
-							}
-						} else {
-							7 & c && (c += 8 - (7 & c));
-							const F = 4 + (c >>> 3), k = i[F - 4] | i[F - 3] << 8;
-							o && (n = r.H.W(n, T + k)), n.set(new s(i.buffer, i.byteOffset + F, k), T), c = F + k << 3, T += k;
-						}
-						return n.length == T ? n : n.slice(0, T);
-					}, r.H.W = function(i, n) {
-						const s = i.length;
-						if (n <= s) return i;
-						const h = new Uint8Array(s << 1);
-						return h.set(i, 0), h;
-					}, r.H.R = function(i, n, s, h, E, x) {
-						const y = r.H.e, D = r.H.Z;
-						let O = 0;
-						for (; O < s;) {
-							const M = i[D(h, E) & n];
-							E += 15 & M;
-							const B = M >>> 4;
-							if (B <= 15) x[O] = B, O++;
-							else {
-								let g = 0, T = 0;
-								B == 16 ? (T = 3 + y(h, E, 2), E += 2, g = x[O - 1]) : B == 17 ? (T = 3 + y(h, E, 3), E += 3) : B == 18 && (T = 11 + y(h, E, 7), E += 7);
-								const c = O + T;
-								for (; O < c;) x[O] = g, O++;
-							}
-						}
-						return E;
-					}, r.H.V = function(i, n, s, h) {
-						let E = 0, x = 0;
-						const y = h.length >>> 1;
-						for (; x < s;) {
-							const D = i[x + n];
-							h[x << 1] = 0, h[1 + (x << 1)] = D, D > E && (E = D), x++;
-						}
-						for (; x < y;) h[x << 1] = 0, h[1 + (x << 1)] = 0, x++;
-						return E;
-					}, r.H.n = function(i, n) {
-						const s = r.H.m, h = i.length;
-						let E, x, y, D;
-						const O = s.j;
-						for (var M = 0; M <= n; M++) O[M] = 0;
-						for (M = 1; M < h; M += 2) O[i[M]]++;
-						const B = s.K;
-						for (E = 0, O[0] = 0, x = 1; x <= n; x++) E = E + O[x - 1] << 1, B[x] = E;
-						for (y = 0; y < h; y += 2) D = i[y + 1], D != 0 && (i[y] = B[D], B[D]++);
-					}, r.H.A = function(i, n, s) {
-						const h = i.length, E = r.H.m.r;
-						for (let x = 0; x < h; x += 2) if (i[x + 1] != 0) {
-							const y = x >> 1, D = i[x + 1], O = y << 4 | D, M = n - D;
-							let B = i[x] << M;
-							const g = B + (1 << M);
-							for (; B != g;) s[E[B] >>> 15 - n] = O, B++;
-						}
-					}, r.H.l = function(i, n) {
-						const s = r.H.m.r, h = 15 - n;
-						for (let E = 0; E < i.length; E += 2) i[E] = s[i[E] << n - i[E + 1]] >>> h;
-					}, r.H.M = function(i, n, s) {
-						s <<= 7 & n;
-						const h = n >>> 3;
-						i[h] |= s, i[h + 1] |= s >>> 8;
-					}, r.H.I = function(i, n, s) {
-						s <<= 7 & n;
-						const h = n >>> 3;
-						i[h] |= s, i[h + 1] |= s >>> 8, i[h + 2] |= s >>> 16;
-					}, r.H.e = function(i, n, s) {
-						return (i[n >>> 3] | i[1 + (n >>> 3)] << 8) >>> (7 & n) & (1 << s) - 1;
-					}, r.H.b = function(i, n, s) {
-						return (i[n >>> 3] | i[1 + (n >>> 3)] << 8 | i[2 + (n >>> 3)] << 16) >>> (7 & n) & (1 << s) - 1;
-					}, r.H.Z = function(i, n) {
-						return (i[n >>> 3] | i[1 + (n >>> 3)] << 8 | i[2 + (n >>> 3)] << 16) >>> (7 & n);
-					}, r.H.i = function(i, n) {
-						return (i[n >>> 3] | i[1 + (n >>> 3)] << 8 | i[2 + (n >>> 3)] << 16 | i[3 + (n >>> 3)] << 24) >>> (7 & n);
-					}, r.H.m = (function() {
-						const i = Uint16Array, n = Uint32Array;
-						return {
-							K: new i(16),
-							j: new i(16),
-							X: [
-								16,
-								17,
-								18,
-								0,
-								8,
-								7,
-								9,
-								6,
-								10,
-								5,
-								11,
-								4,
-								12,
-								3,
-								13,
-								2,
-								14,
-								1,
-								15
-							],
-							S: [
-								3,
-								4,
-								5,
-								6,
-								7,
-								8,
-								9,
-								10,
-								11,
-								13,
-								15,
-								17,
-								19,
-								23,
-								27,
-								31,
-								35,
-								43,
-								51,
-								59,
-								67,
-								83,
-								99,
-								115,
-								131,
-								163,
-								195,
-								227,
-								258,
-								999,
-								999,
-								999
-							],
-							T: [
-								0,
-								0,
-								0,
-								0,
-								0,
-								0,
-								0,
-								0,
-								1,
-								1,
-								1,
-								1,
-								2,
-								2,
-								2,
-								2,
-								3,
-								3,
-								3,
-								3,
-								4,
-								4,
-								4,
-								4,
-								5,
-								5,
-								5,
-								5,
-								0,
-								0,
-								0,
-								0
-							],
-							q: new i(32),
-							p: [
-								1,
-								2,
-								3,
-								4,
-								5,
-								7,
-								9,
-								13,
-								17,
-								25,
-								33,
-								49,
-								65,
-								97,
-								129,
-								193,
-								257,
-								385,
-								513,
-								769,
-								1025,
-								1537,
-								2049,
-								3073,
-								4097,
-								6145,
-								8193,
-								12289,
-								16385,
-								24577,
-								65535,
-								65535
-							],
-							z: [
-								0,
-								0,
-								0,
-								0,
-								1,
-								1,
-								2,
-								2,
-								3,
-								3,
-								4,
-								4,
-								5,
-								5,
-								6,
-								6,
-								7,
-								7,
-								8,
-								8,
-								9,
-								9,
-								10,
-								10,
-								11,
-								11,
-								12,
-								12,
-								13,
-								13,
-								0,
-								0
-							],
-							c: new n(32),
-							J: new i(512),
-							_: [],
-							h: new i(32),
-							$: [],
-							w: new i(32768),
-							C: [],
-							v: [],
-							d: new i(32768),
-							D: [],
-							u: new i(512),
-							Q: [],
-							r: new i(32768),
-							s: new n(286),
-							Y: new n(30),
-							a: new n(19),
-							t: new n(15e3),
-							k: new i(65536),
-							g: new i(32768)
-						};
-					})(), (function() {
-						const i = r.H.m;
-						for (var n = 0; n < 32768; n++) {
-							let h = n;
-							h = (2863311530 & h) >>> 1 | (1431655765 & h) << 1, h = (3435973836 & h) >>> 2 | (858993459 & h) << 2, h = (4042322160 & h) >>> 4 | (252645135 & h) << 4, h = (4278255360 & h) >>> 8 | (16711935 & h) << 8, i.r[n] = (h >>> 16 | h << 16) >>> 17;
-						}
-						function s(h, E, x) {
-							for (; E-- != 0;) h.push(0, x);
-						}
-						for (n = 0; n < 32; n++) i.q[n] = i.S[n] << 3 | i.T[n], i.c[n] = i.p[n] << 4 | i.z[n];
-						s(i._, 144, 8), s(i._, 112, 9), s(i._, 24, 7), s(i._, 8, 8), r.H.n(i._, 9), r.H.A(i._, 9, i.J), r.H.l(i._, 9), s(i.$, 32, 5), r.H.n(i.$, 5), r.H.A(i.$, 5, i.h), r.H.l(i.$, 5), s(i.Q, 19, 0), s(i.C, 286, 0), s(i.D, 30, 0), s(i.v, 320, 0);
-					})(), r.H.N;
-				})();
-				function t(r) {
-					return [
-						1,
-						null,
-						3,
-						1,
-						2,
-						null,
-						4
-					][r.ctype] * r.depth;
-				}
-				function u(r, i, n, s, h) {
-					let E = t(i);
-					const x = Math.ceil(s * E / 8);
-					let y, D;
-					E = Math.ceil(E / 8);
-					let O = r[n], M = 0;
-					if (O > 1 && (r[n] = [
-						0,
-						0,
-						1
-					][O - 2]), O == 3) for (M = E; M < x; M++) r[M + 1] = r[M + 1] + (r[M + 1 - E] >>> 1) & 255;
-					for (let B = 0; B < h; B++) if (y = n + B * x, D = y + B + 1, O = r[D - 1], M = 0, O == 0) for (; M < x; M++) r[y + M] = r[D + M];
-					else if (O == 1) {
-						for (; M < E; M++) r[y + M] = r[D + M];
-						for (; M < x; M++) r[y + M] = r[D + M] + r[y + M - E];
-					} else if (O == 2) for (; M < x; M++) r[y + M] = r[D + M] + r[y + M - x];
-					else if (O == 3) {
-						for (; M < E; M++) r[y + M] = r[D + M] + (r[y + M - x] >>> 1);
-						for (; M < x; M++) r[y + M] = r[D + M] + (r[y + M - x] + r[y + M - E] >>> 1);
-					} else {
-						for (; M < E; M++) r[y + M] = r[D + M] + a(0, r[y + M - x], 0);
-						for (; M < x; M++) r[y + M] = r[D + M] + a(r[y + M - E], r[y + M - x], r[y + M - E - x]);
-					}
-					return r;
-				}
-				function a(r, i, n) {
-					const s = r + i - n, h = s - r, E = s - i, x = s - n;
-					return h * h <= E * E && h * h <= x * x ? r : E * E <= x * x ? i : n;
-				}
-				function m(r, i, n) {
-					n.width = R.readUint(r, i), i += 4, n.height = R.readUint(r, i), i += 4, n.depth = r[i], i++, n.ctype = r[i], i++, n.compress = r[i], i++, n.filter = r[i], i++, n.interlace = r[i], i++;
-				}
-				function _(r, i, n, s, h, E, x, y, D) {
-					const O = Math.min(i, h), M = Math.min(n, E);
-					let B = 0, g = 0;
-					for (let I = 0; I < M; I++) for (let l = 0; l < O; l++) if (x >= 0 && y >= 0 ? (B = I * i + l << 2, g = (y + I) * h + x + l << 2) : (B = (-y + I) * i - x + l << 2, g = I * h + l << 2), D == 0) s[g] = r[B], s[g + 1] = r[B + 1], s[g + 2] = r[B + 2], s[g + 3] = r[B + 3];
-					else if (D == 1) {
-						var T = r[B + 3] * .00392156862745098, c = r[B] * T, f = r[B + 1] * T, v = r[B + 2] * T, A = s[g + 3] * (1 / 255), w = s[g] * A, U = s[g + 1] * A, p = s[g + 2] * A;
-						const o = 1 - T, L = T + A * o, F = L == 0 ? 0 : 1 / L;
-						s[g + 3] = 255 * L, s[g + 0] = (c + w * o) * F, s[g + 1] = (f + U * o) * F, s[g + 2] = (v + p * o) * F;
-					} else if (D == 2) T = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], A = s[g + 3], w = s[g], U = s[g + 1], p = s[g + 2], T == A && c == w && f == U && v == p ? (s[g] = 0, s[g + 1] = 0, s[g + 2] = 0, s[g + 3] = 0) : (s[g] = c, s[g + 1] = f, s[g + 2] = v, s[g + 3] = T);
-					else if (D == 3) {
-						if (T = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], A = s[g + 3], w = s[g], U = s[g + 1], p = s[g + 2], T == A && c == w && f == U && v == p) continue;
-						if (T < 220 && A > 20) return !1;
-					}
-					return !0;
-				}
-				return {
-					decode: function(i) {
-						const n = new Uint8Array(i);
-						let s = 8;
-						const h = R, E = h.readUshort, x = h.readUint, y = {
-							tabs: {},
-							frames: []
-						}, D = new Uint8Array(n.length);
-						let O, M = 0, B = 0;
-						const g = [
-							137,
-							80,
-							78,
-							71,
-							13,
-							10,
-							26,
-							10
-						];
-						for (var T = 0; T < 8; T++) if (n[T] != g[T]) throw "The input is not a PNG file!";
-						for (; s < n.length;) {
-							const I = h.readUint(n, s);
-							s += 4;
-							const l = h.readASCII(n, s, 4);
-							if (s += 4, l == "IHDR") m(n, s, y);
-							else if (l == "iCCP") {
-								for (var c = s; n[c] != 0;) c++;
-								h.readASCII(n, s, c - s), n[c + 1];
-								const o = n.slice(c + 2, s + I);
-								let L = null;
-								try {
-									L = d(o);
-								} catch {
-									L = e(o);
-								}
-								y.tabs[l] = L;
-							} else if (l == "CgBI") y.tabs[l] = n.slice(s, s + 4);
-							else if (l == "IDAT") {
-								for (T = 0; T < I; T++) D[M + T] = n[s + T];
-								M += I;
-							} else if (l == "acTL") y.tabs[l] = {
-								num_frames: x(n, s),
-								num_plays: x(n, s + 4)
-							}, O = new Uint8Array(n.length);
-							else if (l == "fcTL") {
-								B != 0 && ((p = y.frames[y.frames.length - 1]).data = H(y, O.slice(0, B), p.rect.width, p.rect.height), B = 0);
-								const o = {
-									x: x(n, s + 12),
-									y: x(n, s + 16),
-									width: x(n, s + 4),
-									height: x(n, s + 8)
-								};
-								let L = E(n, s + 22);
-								L = E(n, s + 20) / (L == 0 ? 100 : L);
-								const F = {
-									rect: o,
-									delay: Math.round(1e3 * L),
-									dispose: n[s + 24],
-									blend: n[s + 25]
-								};
-								y.frames.push(F);
-							} else if (l == "fdAT") {
-								for (T = 0; T < I - 4; T++) O[B + T] = n[s + T + 4];
-								B += I - 4;
-							} else if (l == "pHYs") y.tabs[l] = [
-								h.readUint(n, s),
-								h.readUint(n, s + 4),
-								n[s + 8]
-							];
-							else if (l == "cHRM") for (y.tabs[l] = [], T = 0; T < 8; T++) y.tabs[l].push(h.readUint(n, s + 4 * T));
-							else if (l == "tEXt" || l == "zTXt") {
-								y.tabs[l] ?? (y.tabs[l] = {});
-								var f = h.nextZero(n, s), v = h.readASCII(n, s, f - s), A = s + I - f - 1;
-								if (l == "tEXt") U = h.readASCII(n, f + 1, A);
-								else {
-									var w = d(n.slice(f + 2, f + 2 + A));
-									U = h.readUTF8(w, 0, w.length);
-								}
-								y.tabs[l][v] = U;
-							} else if (l == "iTXt") {
-								y.tabs[l] ?? (y.tabs[l] = {}), f = 0, c = s, f = h.nextZero(n, c), v = h.readASCII(n, c, f - c);
-								const o = n[c = f + 1];
-								var U;
-								n[c + 1], c += 2, f = h.nextZero(n, c), h.readASCII(n, c, f - c), c = f + 1, f = h.nextZero(n, c), h.readUTF8(n, c, f - c), A = I - ((c = f + 1) - s), o == 0 ? U = h.readUTF8(n, c, A) : (w = d(n.slice(c, c + A)), U = h.readUTF8(w, 0, w.length)), y.tabs[l][v] = U;
-							} else if (l == "PLTE") y.tabs[l] = h.readBytes(n, s, I);
-							else if (l == "hIST") {
-								const o = y.tabs.PLTE.length / 3;
-								for (y.tabs[l] = [], T = 0; T < o; T++) y.tabs[l].push(E(n, s + 2 * T));
-							} else if (l == "tRNS") y.ctype == 3 ? y.tabs[l] = h.readBytes(n, s, I) : y.ctype == 0 ? y.tabs[l] = E(n, s) : y.ctype == 2 && (y.tabs[l] = [
-								E(n, s),
-								E(n, s + 2),
-								E(n, s + 4)
-							]);
-							else if (l == "gAMA") y.tabs[l] = h.readUint(n, s) / 1e5;
-							else if (l == "sRGB") y.tabs[l] = n[s];
-							else if (l == "bKGD") y.ctype == 0 || y.ctype == 4 ? y.tabs[l] = [E(n, s)] : y.ctype == 2 || y.ctype == 6 ? y.tabs[l] = [
-								E(n, s),
-								E(n, s + 2),
-								E(n, s + 4)
-							] : y.ctype == 3 && (y.tabs[l] = n[s]);
-							else if (l == "IEND") break;
-							s += I, h.readUint(n, s), s += 4;
-						}
-						var p;
-						return B != 0 && ((p = y.frames[y.frames.length - 1]).data = H(y, O.slice(0, B), p.rect.width, p.rect.height)), y.data = H(y, D, y.width, y.height), delete y.compress, delete y.interlace, delete y.filter, y;
-					},
-					toRGBA8: function(i) {
-						const n = i.width, s = i.height;
-						if (i.tabs.acTL == null) return [P(i.data, n, s, i).buffer];
-						const h = [];
-						i.frames[0].data ?? (i.frames[0].data = i.data);
-						const E = n * s * 4, x = new Uint8Array(E), y = new Uint8Array(E), D = new Uint8Array(E);
-						for (let M = 0; M < i.frames.length; M++) {
-							const B = i.frames[M], g = B.rect.x, T = B.rect.y, c = B.rect.width, f = B.rect.height, v = P(B.data, c, f, i);
-							if (M != 0) for (var O = 0; O < E; O++) D[O] = x[O];
-							if (B.blend == 0 ? _(v, c, f, x, n, s, g, T, 0) : B.blend == 1 && _(v, c, f, x, n, s, g, T, 1), h.push(x.buffer.slice(0)), B.dispose != 0) {
-								if (B.dispose == 1) _(y, c, f, x, n, s, g, T, 0);
-								else if (B.dispose == 2) for (O = 0; O < E; O++) x[O] = D[O];
-							}
-						}
-						return h;
-					},
-					_paeth: a,
-					_copyTile: _,
-					_bin: R
-				};
-			})();
-			(function() {
-				const { _copyTile: R } = Y, { _bin: P } = Y, H = Y._paeth;
-				var d = {
-					table: (function() {
-						const c = new Uint32Array(256);
-						for (let f = 0; f < 256; f++) {
-							let v = f;
-							for (let A = 0; A < 8; A++) 1 & v ? v = 3988292384 ^ v >>> 1 : v >>>= 1;
-							c[f] = v;
-						}
-						return c;
-					})(),
-					update(c, f, v, A) {
-						for (let w = 0; w < A; w++) c = d.table[255 & (c ^ f[v + w])] ^ c >>> 8;
-						return c;
-					},
-					crc: (c, f, v) => 4294967295 ^ d.update(4294967295, c, f, v)
-				};
-				function e(c, f, v, A) {
-					f[v] += c[0] * A >> 4, f[v + 1] += c[1] * A >> 4, f[v + 2] += c[2] * A >> 4, f[v + 3] += c[3] * A >> 4;
-				}
-				function t(c) {
-					return Math.max(0, Math.min(255, c));
-				}
-				function u(c, f) {
-					const v = c[0] - f[0], A = c[1] - f[1], w = c[2] - f[2], U = c[3] - f[3];
-					return v * v + A * A + w * w + U * U;
-				}
-				function a(c, f, v, A, w, U, p) {
-					p ??= 1;
-					const I = A.length, l = [];
-					for (var o = 0; o < I; o++) {
-						const C = A[o];
-						l.push([
-							C >>> 0 & 255,
-							C >>> 8 & 255,
-							C >>> 16 & 255,
-							C >>> 24 & 255
-						]);
-					}
-					for (o = 0; o < I; o++) {
-						let C = 4294967295;
-						for (var L = 0, F = 0; F < I; F++) {
-							var k = u(l[o], l[F]);
-							F != o && k < C && (C = k, L = F);
-						}
-					}
-					const X = new Uint32Array(w.buffer), N = new Int16Array(f * v * 4), $ = [
-						0,
-						8,
-						2,
-						10,
-						12,
-						4,
-						14,
-						6,
-						3,
-						11,
-						1,
-						9,
-						15,
-						7,
-						13,
-						5
-					];
-					for (o = 0; o < $.length; o++) $[o] = 255 * (($[o] + .5) / 16 - .5);
-					for (let C = 0; C < v; C++) for (let K = 0; K < f; K++) {
-						var W;
-						o = 4 * (C * f + K), p != 2 ? W = [
-							t(c[o] + N[o]),
-							t(c[o + 1] + N[o + 1]),
-							t(c[o + 2] + N[o + 2]),
-							t(c[o + 3] + N[o + 3])
-						] : (k = $[4 * (3 & C) + (3 & K)], W = [
-							t(c[o] + k),
-							t(c[o + 1] + k),
-							t(c[o + 2] + k),
-							t(c[o + 3] + k)
-						]), L = 0;
-						let se = 16777215;
-						for (F = 0; F < I; F++) {
-							const ie = u(W, l[F]);
-							ie < se && (se = ie, L = F);
-						}
-						const ne = l[L], ee = [
-							W[0] - ne[0],
-							W[1] - ne[1],
-							W[2] - ne[2],
-							W[3] - ne[3]
-						];
-						p == 1 && (K != f - 1 && e(ee, N, o + 4, 7), C != v - 1 && (K != 0 && e(ee, N, o + 4 * f - 4, 3), e(ee, N, o + 4 * f, 5), K != f - 1 && e(ee, N, o + 4 * f + 4, 1))), U[o >> 2] = L, X[o >> 2] = A[L];
-					}
-				}
-				function m(c, f, v, A, w) {
-					w ??= {};
-					const { crc: U } = d, p = P.writeUint, I = P.writeUshort, l = P.writeASCII;
-					let o = 8;
-					const L = c.frames.length > 1;
-					let F, k = !1, X = 33 + (L ? 20 : 0);
-					if (w.sRGB != null && (X += 13), w.pHYs != null && (X += 21), w.iCCP != null && (F = pako.deflate(w.iCCP), X += 21 + F.length + 4), c.ctype == 3) {
-						for (var N = c.plte.length, $ = 0; $ < N; $++) c.plte[$] >>> 24 != 255 && (k = !0);
-						X += 8 + 3 * N + 4 + (k ? 8 + 1 * N + 4 : 0);
-					}
-					for (var W = 0; W < c.frames.length; W++) L && (X += 38), X += (ne = c.frames[W]).cimg.length + 12, W != 0 && (X += 4);
-					X += 12;
-					const C = new Uint8Array(X), K = [
-						137,
-						80,
-						78,
-						71,
-						13,
-						10,
-						26,
-						10
-					];
-					for ($ = 0; $ < 8; $++) C[$] = K[$];
-					if (p(C, o, 13), o += 4, l(C, o, "IHDR"), o += 4, p(C, o, f), o += 4, p(C, o, v), o += 4, C[o] = c.depth, o++, C[o] = c.ctype, o++, C[o] = 0, o++, C[o] = 0, o++, C[o] = 0, o++, p(C, o, U(C, o - 17, 17)), o += 4, w.sRGB != null && (p(C, o, 1), o += 4, l(C, o, "sRGB"), o += 4, C[o] = w.sRGB, o++, p(C, o, U(C, o - 5, 5)), o += 4), w.iCCP != null) {
-						const ee = 13 + F.length;
-						p(C, o, ee), o += 4, l(C, o, "iCCP"), o += 4, l(C, o, "ICC profile"), o += 11, o += 2, C.set(F, o), o += F.length, p(C, o, U(C, o - (ee + 4), ee + 4)), o += 4;
-					}
-					if (w.pHYs != null && (p(C, o, 9), o += 4, l(C, o, "pHYs"), o += 4, p(C, o, w.pHYs[0]), o += 4, p(C, o, w.pHYs[1]), o += 4, C[o] = w.pHYs[2], o++, p(C, o, U(C, o - 13, 13)), o += 4), L && (p(C, o, 8), o += 4, l(C, o, "acTL"), o += 4, p(C, o, c.frames.length), o += 4, p(C, o, w.loop != null ? w.loop : 0), o += 4, p(C, o, U(C, o - 12, 12)), o += 4), c.ctype == 3) {
-						for (p(C, o, 3 * (N = c.plte.length)), o += 4, l(C, o, "PLTE"), o += 4, $ = 0; $ < N; $++) {
-							const ee = 3 * $, ie = c.plte[$], ue = 255 & ie, de = ie >>> 8 & 255, ze = ie >>> 16 & 255;
-							C[o + ee + 0] = ue, C[o + ee + 1] = de, C[o + ee + 2] = ze;
-						}
-						if (o += 3 * N, p(C, o, U(C, o - 3 * N - 4, 3 * N + 4)), o += 4, k) {
-							for (p(C, o, N), o += 4, l(C, o, "tRNS"), o += 4, $ = 0; $ < N; $++) C[o + $] = c.plte[$] >>> 24 & 255;
-							o += N, p(C, o, U(C, o - N - 4, N + 4)), o += 4;
-						}
-					}
-					let se = 0;
-					for (W = 0; W < c.frames.length; W++) {
-						var ne = c.frames[W];
-						L && (p(C, o, 26), o += 4, l(C, o, "fcTL"), o += 4, p(C, o, se++), o += 4, p(C, o, ne.rect.width), o += 4, p(C, o, ne.rect.height), o += 4, p(C, o, ne.rect.x), o += 4, p(C, o, ne.rect.y), o += 4, I(C, o, A[W]), o += 2, I(C, o, 1e3), o += 2, C[o] = ne.dispose, o++, C[o] = ne.blend, o++, p(C, o, U(C, o - 30, 30)), o += 4);
-						const ee = ne.cimg;
-						p(C, o, (N = ee.length) + (W == 0 ? 0 : 4)), o += 4;
-						const ie = o;
-						l(C, o, W == 0 ? "IDAT" : "fdAT"), o += 4, W != 0 && (p(C, o, se++), o += 4), C.set(ee, o), o += N, p(C, o, U(C, ie, o - ie)), o += 4;
-					}
-					return p(C, o, 0), o += 4, l(C, o, "IEND"), o += 4, p(C, o, U(C, o - 4, 4)), o += 4, C.buffer;
-				}
-				function _(c, f, v) {
-					for (let A = 0; A < c.frames.length; A++) {
-						const w = c.frames[A];
-						w.rect.width;
-						const U = w.rect.height, p = new Uint8Array(U * w.bpl + U);
-						w.cimg = s(w.img, U, w.bpp, w.bpl, p, f, v);
-					}
-				}
-				function r(c, f, v, A, w) {
-					const U = w[0], p = w[1], I = w[2], l = w[3], o = w[4], L = w[5];
-					let F = 6, k = 8, X = 255;
-					for (var N = 0; N < c.length; N++) {
-						const Ae = new Uint8Array(c[N]);
-						for (var $ = Ae.length, W = 0; W < $; W += 4) X &= Ae[W + 3];
-					}
-					const C = X != 255, K = (function(re, fe, pe, ve, _e, be) {
-						const ye = [];
-						for (var oe = 0; oe < re.length; oe++) {
-							const Ue = new Uint8Array(re[oe]), Re = new Uint32Array(Ue.buffer);
-							var Me;
-							let De = 0, He = 0, ke = fe, Ge = pe, bt = ve ? 1 : 0;
-							if (oe != 0) {
-								const Sn = be || ve || oe == 1 || ye[oe - 2].dispose != 0 ? 1 : 2;
-								let yt = 0, Bt = 1e9;
-								for (let tt = 0; tt < Sn; tt++) {
-									var et = new Uint8Array(re[oe - 1 - tt]);
-									const Cn = new Uint32Array(re[oe - 1 - tt]);
-									let We = fe, Ne = pe, Ye = -1, nt = -1;
-									for (let qe = 0; qe < pe; qe++) for (let $e = 0; $e < fe; $e++) Re[je = qe * fe + $e] != Cn[je] && ($e < We && (We = $e), $e > Ye && (Ye = $e), qe < Ne && (Ne = qe), qe > nt && (nt = qe));
-									Ye == -1 && (We = Ne = Ye = nt = 0), _e && ((1 & We) == 1 && We--, (1 & Ne) == 1 && Ne--);
-									const Dt = (Ye - We + 1) * (nt - Ne + 1);
-									Dt < Bt && (Bt = Dt, yt = tt, De = We, He = Ne, ke = Ye - We + 1, Ge = nt - Ne + 1);
-								}
-								et = new Uint8Array(re[oe - 1 - yt]), yt == 1 && (ye[oe - 1].dispose = 2), Me = new Uint8Array(ke * Ge * 4), R(et, fe, pe, Me, ke, Ge, -De, -He, 0), bt = R(Ue, fe, pe, Me, ke, Ge, -De, -He, 3) ? 1 : 0, bt == 1 ? n(Ue, fe, pe, Me, {
-									x: De,
-									y: He,
-									width: ke,
-									height: Ge
-								}) : R(Ue, fe, pe, Me, ke, Ge, -De, -He, 0);
-							} else Me = Ue.slice(0);
-							ye.push({
-								rect: {
-									x: De,
-									y: He,
-									width: ke,
-									height: Ge
-								},
-								img: Me,
-								blend: bt,
-								dispose: 0
-							});
-						}
-						if (ve) for (oe = 0; oe < ye.length; oe++) {
-							if ((Qe = ye[oe]).blend == 1) continue;
-							const Ue = Qe.rect, Re = ye[oe - 1].rect, De = Math.min(Ue.x, Re.x), He = Math.min(Ue.y, Re.y), ke = {
-								x: De,
-								y: He,
-								width: Math.max(Ue.x + Ue.width, Re.x + Re.width) - De,
-								height: Math.max(Ue.y + Ue.height, Re.y + Re.height) - He
-							};
-							ye[oe - 1].dispose = 1, oe - 1 != 0 && i(re, fe, pe, ye, oe - 1, ke, _e), i(re, fe, pe, ye, oe, ke, _e);
-						}
-						let Se = 0;
-						if (re.length != 1) for (var je = 0; je < ye.length; je++) {
-							var Qe;
-							Se += (Qe = ye[je]).rect.width * Qe.rect.height;
-						}
-						return ye;
-					})(c, f, v, U, p, I), se = {}, ne = [], ee = [];
-					if (A != 0) {
-						const Ae = [];
-						for (W = 0; W < K.length; W++) Ae.push(K[W].img.buffer);
-						const re = E((function(ve) {
-							let _e = 0;
-							for (var be = 0; be < ve.length; be++) _e += ve[be].byteLength;
-							const ye = new Uint8Array(_e);
-							let oe = 0;
-							for (be = 0; be < ve.length; be++) {
-								const Me = new Uint8Array(ve[be]), et = Me.length;
-								for (let Se = 0; Se < et; Se += 4) {
-									let je = Me[Se], Qe = Me[Se + 1], Ue = Me[Se + 2];
-									const Re = Me[Se + 3];
-									Re == 0 && (je = Qe = Ue = 0), ye[oe + Se] = je, ye[oe + Se + 1] = Qe, ye[oe + Se + 2] = Ue, ye[oe + Se + 3] = Re;
-								}
-								oe += et;
-							}
-							return ye.buffer;
-						})(Ae), A);
-						for (W = 0; W < re.plte.length; W++) ne.push(re.plte[W].est.rgba);
-						let fe = 0;
-						for (W = 0; W < K.length; W++) {
-							const pe = (ue = K[W]).img.length;
-							var ie = new Uint8Array(re.inds.buffer, fe >> 2, pe >> 2);
-							ee.push(ie);
-							const ve = new Uint8Array(re.abuf, fe, pe);
-							L && a(ue.img, ue.rect.width, ue.rect.height, ne, ve, ie), ue.img.set(ve), fe += pe;
-						}
-					} else for (N = 0; N < K.length; N++) {
-						var ue = K[N];
-						const Ae = new Uint32Array(ue.img.buffer);
-						var de = ue.rect.width;
-						for ($ = Ae.length, ie = new Uint8Array($), ee.push(ie), W = 0; W < $; W++) {
-							const re = Ae[W];
-							if (W != 0 && re == Ae[W - 1]) ie[W] = ie[W - 1];
-							else if (W > de && re == Ae[W - de]) ie[W] = ie[W - de];
-							else {
-								let fe = se[re];
-								if (fe == null && (se[re] = fe = ne.length, ne.push(re), ne.length >= 300)) break;
-								ie[W] = fe;
-							}
-						}
-					}
-					const ze = ne.length;
-					for (ze <= 256 && o == 0 && (k = ze <= 2 ? 1 : ze <= 4 ? 2 : ze <= 16 ? 4 : 8, k = Math.max(k, l)), N = 0; N < K.length; N++) {
-						(ue = K[N]).rect.x, ue.rect.y, de = ue.rect.width;
-						const Ae = ue.rect.height;
-						let re = ue.img;
-						new Uint32Array(re.buffer);
-						let fe = 4 * de, pe = 4;
-						if (ze <= 256 && o == 0) {
-							fe = Math.ceil(k * de / 8);
-							var Le = new Uint8Array(fe * Ae);
-							const ve = ee[N];
-							for (let _e = 0; _e < Ae; _e++) {
-								W = _e * fe;
-								const be = _e * de;
-								if (k == 8) for (var ce = 0; ce < de; ce++) Le[W + ce] = ve[be + ce];
-								else if (k == 4) for (ce = 0; ce < de; ce++) Le[W + (ce >> 1)] |= ve[be + ce] << 4 - 4 * (1 & ce);
-								else if (k == 2) for (ce = 0; ce < de; ce++) Le[W + (ce >> 2)] |= ve[be + ce] << 6 - 2 * (3 & ce);
-								else if (k == 1) for (ce = 0; ce < de; ce++) Le[W + (ce >> 3)] |= ve[be + ce] << 7 - 1 * (7 & ce);
-							}
-							re = Le, F = 3, pe = 1;
-						} else if (C == 0 && K.length == 1) {
-							Le = new Uint8Array(de * Ae * 3);
-							const ve = de * Ae;
-							for (W = 0; W < ve; W++) {
-								const _e = 3 * W, be = 4 * W;
-								Le[_e] = re[be], Le[_e + 1] = re[be + 1], Le[_e + 2] = re[be + 2];
-							}
-							re = Le, F = 2, pe = 3, fe = 3 * de;
-						}
-						ue.img = re, ue.bpl = fe, ue.bpp = pe;
-					}
-					return {
-						ctype: F,
-						depth: k,
-						plte: ne,
-						frames: K
-					};
-				}
-				function i(c, f, v, A, w, U, p) {
-					const I = Uint8Array, l = Uint32Array, o = new I(c[w - 1]), L = new l(c[w - 1]), F = w + 1 < c.length ? new I(c[w + 1]) : null, k = new I(c[w]), X = new l(k.buffer);
-					let N = f, $ = v, W = -1, C = -1;
-					for (let se = 0; se < U.height; se++) for (let ne = 0; ne < U.width; ne++) {
-						const ee = U.x + ne, ie = U.y + se, ue = ie * f + ee, de = X[ue];
-						de == 0 || A[w - 1].dispose == 0 && L[ue] == de && (F == null || F[4 * ue + 3] != 0) || (ee < N && (N = ee), ee > W && (W = ee), ie < $ && ($ = ie), ie > C && (C = ie));
-					}
-					W == -1 && (N = $ = W = C = 0), p && ((1 & N) == 1 && N--, (1 & $) == 1 && $--), U = {
-						x: N,
-						y: $,
-						width: W - N + 1,
-						height: C - $ + 1
-					};
-					const K = A[w];
-					K.rect = U, K.blend = 1, K.img = new Uint8Array(U.width * U.height * 4), A[w - 1].dispose == 0 ? (R(o, f, v, K.img, U.width, U.height, -U.x, -U.y, 0), n(k, f, v, K.img, U)) : R(k, f, v, K.img, U.width, U.height, -U.x, -U.y, 0);
-				}
-				function n(c, f, v, A, w) {
-					R(c, f, v, A, w.width, w.height, -w.x, -w.y, 2);
-				}
-				function s(c, f, v, A, w, U, p) {
-					const I = [];
-					let l, o = [
-						0,
-						1,
-						2,
-						3,
-						4
-					];
-					U != -1 ? o = [U] : (f * A > 5e5 || v == 1) && (o = [0]), p && (l = { level: 0 });
-					const L = V;
-					for (var F = 0; F < o.length; F++) {
-						for (let N = 0; N < f; N++) h(w, c, N, A, v, o[F]);
-						I.push(L.deflate(w, l));
-					}
-					let k, X = 1e9;
-					for (F = 0; F < I.length; F++) I[F].length < X && (k = F, X = I[F].length);
-					return I[k];
-				}
-				function h(c, f, v, A, w, U) {
-					const p = v * A;
-					let I = p + v;
-					if (c[I] = U, I++, U == 0) if (A < 500) for (var l = 0; l < A; l++) c[I + l] = f[p + l];
-					else c.set(new Uint8Array(f.buffer, p, A), I);
-					else if (U == 1) {
-						for (l = 0; l < w; l++) c[I + l] = f[p + l];
-						for (l = w; l < A; l++) c[I + l] = f[p + l] - f[p + l - w] + 256 & 255;
-					} else if (v == 0) {
-						for (l = 0; l < w; l++) c[I + l] = f[p + l];
-						if (U == 2) for (l = w; l < A; l++) c[I + l] = f[p + l];
-						if (U == 3) for (l = w; l < A; l++) c[I + l] = f[p + l] - (f[p + l - w] >> 1) + 256 & 255;
-						if (U == 4) for (l = w; l < A; l++) c[I + l] = f[p + l] - H(f[p + l - w], 0, 0) + 256 & 255;
-					} else {
-						if (U == 2) for (l = 0; l < A; l++) c[I + l] = f[p + l] + 256 - f[p + l - A] & 255;
-						if (U == 3) {
-							for (l = 0; l < w; l++) c[I + l] = f[p + l] + 256 - (f[p + l - A] >> 1) & 255;
-							for (l = w; l < A; l++) c[I + l] = f[p + l] + 256 - (f[p + l - A] + f[p + l - w] >> 1) & 255;
-						}
-						if (U == 4) {
-							for (l = 0; l < w; l++) c[I + l] = f[p + l] + 256 - H(0, f[p + l - A], 0) & 255;
-							for (l = w; l < A; l++) c[I + l] = f[p + l] + 256 - H(f[p + l - w], f[p + l - A], f[p + l - w - A]) & 255;
-						}
-					}
-				}
-				function E(c, f) {
-					const v = new Uint8Array(c), A = v.slice(0), w = new Uint32Array(A.buffer), U = x(A, f), p = U[0], I = U[1], l = v.length, o = new Uint8Array(l >> 2);
-					let L;
-					if (v.length < 2e7) for (var F = 0; F < l; F += 4) L = y(p, k = v[F] * (1 / 255), X = v[F + 1] * (1 / 255), N = v[F + 2] * (1 / 255), $ = v[F + 3] * (1 / 255)), o[F >> 2] = L.ind, w[F >> 2] = L.est.rgba;
-					else for (F = 0; F < l; F += 4) {
-						var k = v[F] * .00392156862745098, X = v[F + 1] * (1 / 255), N = v[F + 2] * (1 / 255), $ = v[F + 3] * (1 / 255);
-						for (L = p; L.left;) L = D(L.est, k, X, N, $) <= 0 ? L.left : L.right;
-						o[F >> 2] = L.ind, w[F >> 2] = L.est.rgba;
-					}
-					return {
-						abuf: A.buffer,
-						inds: o,
-						plte: I
-					};
-				}
-				function x(c, f, v) {
-					v ??= 1e-4;
-					const A = new Uint32Array(c.buffer), w = {
-						i0: 0,
-						i1: c.length,
-						bst: null,
-						est: null,
-						tdst: 0,
-						left: null,
-						right: null
-					};
-					w.bst = B(c, w.i0, w.i1), w.est = g(w.bst);
-					const U = [w];
-					for (; U.length < f;) {
-						let I = 0, l = 0;
-						for (var p = 0; p < U.length; p++) U[p].est.L > I && (I = U[p].est.L, l = p);
-						if (I < v) break;
-						const o = U[l], L = O(c, A, o.i0, o.i1, o.est.e, o.est.eMq255);
-						if (o.i0 >= L || o.i1 <= L) {
-							o.est.L = 0;
-							continue;
-						}
-						const F = {
-							i0: o.i0,
-							i1: L,
-							bst: null,
-							est: null,
-							tdst: 0,
-							left: null,
-							right: null
-						};
-						F.bst = B(c, F.i0, F.i1), F.est = g(F.bst);
-						const k = {
-							i0: L,
-							i1: o.i1,
-							bst: null,
-							est: null,
-							tdst: 0,
-							left: null,
-							right: null
-						};
-						for (k.bst = {
-							R: [],
-							m: [],
-							N: o.bst.N - F.bst.N
-						}, p = 0; p < 16; p++) k.bst.R[p] = o.bst.R[p] - F.bst.R[p];
-						for (p = 0; p < 4; p++) k.bst.m[p] = o.bst.m[p] - F.bst.m[p];
-						k.est = g(k.bst), o.left = F, o.right = k, U[l] = F, U.push(k);
-					}
-					for (U.sort(((I, l) => l.bst.N - I.bst.N)), p = 0; p < U.length; p++) U[p].ind = p;
-					return [w, U];
-				}
-				function y(c, f, v, A, w) {
-					if (c.left == null) return c.tdst = (function(F, k, X, N, $) {
-						const W = k - F[0], C = X - F[1], K = N - F[2], se = $ - F[3];
-						return W * W + C * C + K * K + se * se;
-					})(c.est.q, f, v, A, w), c;
-					const U = D(c.est, f, v, A, w);
-					let p = c.left, I = c.right;
-					U > 0 && (p = c.right, I = c.left);
-					const l = y(p, f, v, A, w);
-					if (l.tdst <= U * U) return l;
-					const o = y(I, f, v, A, w);
-					return o.tdst < l.tdst ? o : l;
-				}
-				function D(c, f, v, A, w) {
-					const { e: U } = c;
-					return U[0] * f + U[1] * v + U[2] * A + U[3] * w - c.eMq;
-				}
-				function O(c, f, v, A, w, U) {
-					for (A -= 4; v < A;) {
-						for (; M(c, v, w) <= U;) v += 4;
-						for (; M(c, A, w) > U;) A -= 4;
-						if (v >= A) break;
-						const p = f[v >> 2];
-						f[v >> 2] = f[A >> 2], f[A >> 2] = p, v += 4, A -= 4;
-					}
-					for (; M(c, v, w) > U;) v -= 4;
-					return v + 4;
-				}
-				function M(c, f, v) {
-					return c[f] * v[0] + c[f + 1] * v[1] + c[f + 2] * v[2] + c[f + 3] * v[3];
-				}
-				function B(c, f, v) {
-					const A = [
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0,
-						0
-					], w = [
-						0,
-						0,
-						0,
-						0
-					], U = v - f >> 2;
-					for (let p = f; p < v; p += 4) {
-						const I = c[p] * .00392156862745098, l = c[p + 1] * (1 / 255), o = c[p + 2] * (1 / 255), L = c[p + 3] * (1 / 255);
-						w[0] += I, w[1] += l, w[2] += o, w[3] += L, A[0] += I * I, A[1] += I * l, A[2] += I * o, A[3] += I * L, A[5] += l * l, A[6] += l * o, A[7] += l * L, A[10] += o * o, A[11] += o * L, A[15] += L * L;
-					}
-					return A[4] = A[1], A[8] = A[2], A[9] = A[6], A[12] = A[3], A[13] = A[7], A[14] = A[11], {
-						R: A,
-						m: w,
-						N: U
-					};
-				}
-				function g(c) {
-					const { R: f } = c, { m: v } = c, { N: A } = c, w = v[0], U = v[1], p = v[2], I = v[3], l = A == 0 ? 0 : 1 / A, o = [
-						f[0] - w * w * l,
-						f[1] - w * U * l,
-						f[2] - w * p * l,
-						f[3] - w * I * l,
-						f[4] - U * w * l,
-						f[5] - U * U * l,
-						f[6] - U * p * l,
-						f[7] - U * I * l,
-						f[8] - p * w * l,
-						f[9] - p * U * l,
-						f[10] - p * p * l,
-						f[11] - p * I * l,
-						f[12] - I * w * l,
-						f[13] - I * U * l,
-						f[14] - I * p * l,
-						f[15] - I * I * l
-					], L = o, F = T;
-					let k = [
-						Math.random(),
-						Math.random(),
-						Math.random(),
-						Math.random()
-					], X = 0, N = 0;
-					if (A != 0) for (let W = 0; W < 16 && (k = F.multVec(L, k), N = Math.sqrt(F.dot(k, k)), k = F.sml(1 / N, k), !(W != 0 && Math.abs(N - X) < 1e-9)); W++) X = N;
-					const $ = [
-						w * l,
-						U * l,
-						p * l,
-						I * l
-					];
-					return {
-						Cov: o,
-						q: $,
-						e: k,
-						L: X,
-						eMq255: F.dot(F.sml(255, $), k),
-						eMq: F.dot(k, $),
-						rgba: (Math.round(255 * $[3]) << 24 | Math.round(255 * $[2]) << 16 | Math.round(255 * $[1]) << 8 | Math.round(255 * $[0]) << 0) >>> 0
-					};
-				}
-				var T = {
-					multVec: (c, f) => [
-						c[0] * f[0] + c[1] * f[1] + c[2] * f[2] + c[3] * f[3],
-						c[4] * f[0] + c[5] * f[1] + c[6] * f[2] + c[7] * f[3],
-						c[8] * f[0] + c[9] * f[1] + c[10] * f[2] + c[11] * f[3],
-						c[12] * f[0] + c[13] * f[1] + c[14] * f[2] + c[15] * f[3]
-					],
-					dot: (c, f) => c[0] * f[0] + c[1] * f[1] + c[2] * f[2] + c[3] * f[3],
-					sml: (c, f) => [
-						c * f[0],
-						c * f[1],
-						c * f[2],
-						c * f[3]
-					]
-				};
-				Y.encode = function(f, v, A, w, U, p, I) {
-					w ??= 0, I ??= !1;
-					const l = r(f, v, A, w, [
-						!1,
-						!1,
-						!1,
-						0,
-						I,
-						!1
-					]);
-					return _(l, -1), m(l, v, A, U, p);
-				}, Y.encodeLL = function(f, v, A, w, U, p, I, l) {
-					const o = {
-						ctype: 0 + (w == 1 ? 0 : 2) + (U == 0 ? 0 : 4),
-						depth: p,
-						frames: []
-					}, L = (w + U) * p, F = L * v;
-					for (let k = 0; k < f.length; k++) o.frames.push({
-						rect: {
-							x: 0,
-							y: 0,
-							width: v,
-							height: A
-						},
-						img: new Uint8Array(f[k]),
-						blend: 0,
-						dispose: 1,
-						bpp: Math.ceil(L / 8),
-						bpl: Math.ceil(F / 8)
-					});
-					return _(o, 0, !0), m(o, v, A, I, l);
-				}, Y.encode.compress = r, Y.encode.dither = a, Y.quantize = E, Y.quantize.getKDtree = x, Y.quantize.getNearest = y;
-			})();
-			const J = {
-				toArrayBuffer(R, P) {
-					const H = R.width, d = R.height, e = H << 2, t = R.getContext("2d").getImageData(0, 0, H, d), u = new Uint32Array(t.data.buffer), a = (32 * H + 31) / 32 << 2, m = a * d, _ = 122 + m, r = new ArrayBuffer(_), i = new DataView(r), n = 1 << 20;
-					let s, h, E, x, y = n, D = 0, O = 0, M = 0;
-					function B(c) {
-						i.setUint16(O, c, !0), O += 2;
-					}
-					function g(c) {
-						i.setUint32(O, c, !0), O += 4;
-					}
-					function T(c) {
-						O += c;
-					}
-					B(19778), g(_), T(4), g(122), g(108), g(H), g(-d >>> 0), B(1), B(32), g(3), g(m), g(2835), g(2835), T(8), g(16711680), g(65280), g(255), g(4278190080), g(1466527264), (function c() {
-						for (; D < d && y > 0;) {
-							for (x = 122 + D * a, s = 0; s < e;) y--, h = u[M++], E = h >>> 24, i.setUint32(x + s, h << 8 | E), s += 4;
-							D++;
-						}
-						M < u.length ? (y = n, setTimeout(c, J._dly)) : P(r);
-					})();
-				},
-				toBlob(R, P) {
-					this.toArrayBuffer(R, ((H) => {
-						P(new Blob([H], { type: "image/bmp" }));
-					}));
-				},
-				_dly: 9
-			};
-			var q = {
-				CHROME: "CHROME",
-				FIREFOX: "FIREFOX",
-				DESKTOP_SAFARI: "DESKTOP_SAFARI",
-				IE: "IE",
-				IOS: "IOS",
-				ETC: "ETC"
-			}, Ee = {
-				[q.CHROME]: 16384,
-				[q.FIREFOX]: 11180,
-				[q.DESKTOP_SAFARI]: 16384,
-				[q.IE]: 8192,
-				[q.IOS]: 4096,
-				[q.ETC]: 8192
-			};
-			const ae = typeof window < "u", Be = typeof WorkerGlobalScope < "u" && self instanceof WorkerGlobalScope, Fe = ae && window.cordova && window.cordova.require && window.cordova.require("cordova/modulemapper"), te = (ae || Be) && (Fe && Fe.getOriginalSymbol(window, "File") || typeof File < "u" && File), Z = (ae || Be) && (Fe && Fe.getOriginalSymbol(window, "FileReader") || typeof FileReader < "u" && FileReader);
-			function ge(R, P, H = Date.now()) {
-				return new Promise(((d) => {
-					const e = R.split(","), t = e[0].match(/:(.*?);/)[1], u = globalThis.atob(e[1]);
-					let a = u.length;
-					const m = new Uint8Array(a);
-					for (; a--;) m[a] = u.charCodeAt(a);
-					const _ = new Blob([m], { type: t });
-					_.name = P, _.lastModified = H, d(_);
-				}));
-			}
-			function me(R) {
-				return new Promise(((P, H) => {
-					const d = new Z();
-					d.onload = () => P(d.result), d.onerror = (e) => H(e), d.readAsDataURL(R);
-				}));
-			}
-			function Pe(R) {
-				return new Promise(((P, H) => {
-					const d = new Image();
-					d.onload = () => P(d), d.onerror = (e) => H(e), d.src = R;
-				}));
-			}
-			function le() {
-				if (le.cachedResult !== void 0) return le.cachedResult;
-				let R = q.ETC;
-				const { userAgent: P } = navigator;
-				return /Chrom(e|ium)/i.test(P) ? R = q.CHROME : /iP(ad|od|hone)/i.test(P) && /WebKit/i.test(P) ? R = q.IOS : /Safari/i.test(P) ? R = q.DESKTOP_SAFARI : /Firefox/i.test(P) ? R = q.FIREFOX : (/MSIE/i.test(P) || document.documentMode) && (R = q.IE), le.cachedResult = R, le.cachedResult;
-			}
-			function xe(R, P) {
-				const H = Ee[le()];
-				let d = R, e = P, t = d * e;
-				const u = d > e ? e / d : d / e;
-				for (; t > H * H;) {
-					const a = (H + d) / 2, m = (H + e) / 2;
-					a < m ? (e = m, d = m * u) : (e = a * u, d = a), t = d * e;
-				}
-				return {
-					width: d,
-					height: e
-				};
-			}
-			function Ce(R, P) {
-				let H, d;
-				try {
-					if (H = new OffscreenCanvas(R, P), d = H.getContext("2d"), d === null) throw new Error("getContext of OffscreenCanvas returns null");
-				} catch {
-					H = document.createElement("canvas"), d = H.getContext("2d");
-				}
-				return H.width = R, H.height = P, [H, d];
-			}
-			function Te(R, P) {
-				const { width: H, height: d } = xe(R.width, R.height), [e, t] = Ce(H, d);
-				return P && /jpe?g/.test(P) && (t.fillStyle = "white", t.fillRect(0, 0, e.width, e.height)), t.drawImage(R, 0, 0, e.width, e.height), e;
-			}
-			function Je() {
-				return Je.cachedResult !== void 0 || (Je.cachedResult = [
-					"iPad Simulator",
-					"iPhone Simulator",
-					"iPod Simulator",
-					"iPad",
-					"iPhone",
-					"iPod"
-				].includes(navigator.platform) || navigator.userAgent.includes("Mac") && typeof document < "u" && "ontouchend" in document), Je.cachedResult;
-			}
-			function st(R, P = {}) {
-				return new Promise((function(H, d) {
-					let e, t;
-					var u = function() {
-						try {
-							return t = Te(e, P.fileType || R.type), H([e, t]);
-						} catch (m) {
-							return d(m);
-						}
-					}, a = function(m) {
-						try {
-							var _ = function(r) {
-								try {
-									throw r;
-								} catch (i) {
-									return d(i);
-								}
-							};
-							try {
-								let r;
-								return me(R).then((function(i) {
-									try {
-										return r = i, Pe(r).then((function(n) {
-											try {
-												return e = n, (function() {
-													try {
-														return u();
-													} catch (s) {
-														return d(s);
-													}
-												})();
-											} catch (s) {
-												return _(s);
-											}
-										}), _);
-									} catch (n) {
-										return _(n);
-									}
-								}), _);
-							} catch (r) {
-								_(r);
-							}
-						} catch (r) {
-							return d(r);
-						}
-					};
-					try {
-						if (Je() || [q.DESKTOP_SAFARI, q.MOBILE_SAFARI].includes(le())) throw new Error("Skip createImageBitmap on IOS and Safari");
-						return createImageBitmap(R).then((function(m) {
-							try {
-								return e = m, u();
-							} catch {
-								return a();
-							}
-						}), a);
-					} catch {
-						a();
-					}
-				}));
-			}
-			function ft(R, P, H, d, e = 1) {
-				return new Promise((function(t, u) {
-					let a;
-					if (P === "image/png") {
-						let _, r, i;
-						return _ = R.getContext("2d"), {data: r} = _.getImageData(0, 0, R.width, R.height), i = Y.encode([r.buffer], R.width, R.height, 4096 * e), a = new Blob([i], { type: P }), a.name = H, a.lastModified = d, m.call(this);
-					}
-					{
-						let _ = function() {
-							return m.call(this);
-						};
-						if (P === "image/bmp") return new Promise(((r) => J.toBlob(R, r))).then(function(r) {
-							try {
-								return a = r, a.name = H, a.lastModified = d, _.call(this);
-							} catch (i) {
-								return u(i);
-							}
-						}.bind(this), u);
-						{
-							let r = function() {
-								return _.call(this);
-							};
-							if (typeof OffscreenCanvas == "function" && R instanceof OffscreenCanvas) return R.convertToBlob({
-								type: P,
-								quality: e
-							}).then(function(i) {
-								try {
-									return a = i, a.name = H, a.lastModified = d, r.call(this);
-								} catch (n) {
-									return u(n);
-								}
-							}.bind(this), u);
-							{
-								let i;
-								return i = R.toDataURL(P, e), ge(i, H, d).then(function(n) {
-									try {
-										return a = n, r.call(this);
-									} catch (s) {
-										return u(s);
-									}
-								}.bind(this), u);
-							}
-						}
-					}
-					function m() {
-						return t(a);
-					}
-				}));
-			}
-			function Oe(R) {
-				R.width = 0, R.height = 0;
-			}
-			function Ve() {
-				return new Promise((function(R, P) {
-					let H, d, e, t;
-					return Ve.cachedResult !== void 0 ? R(Ve.cachedResult) : ge("data:image/jpeg;base64,/9j/4QAiRXhpZgAATU0AKgAAAAgAAQESAAMAAAABAAYAAAAAAAD/2wCEAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAf/AABEIAAEAAgMBEQACEQEDEQH/xABKAAEAAAAAAAAAAAAAAAAAAAALEAEAAAAAAAAAAAAAAAAAAAAAAQEAAAAAAAAAAAAAAAAAAAAAEQEAAAAAAAAAAAAAAAAAAAAA/9oADAMBAAIRAxEAPwA/8H//2Q==", "test.jpg", Date.now()).then((function(u) {
-						try {
-							return H = u, st(H).then((function(a) {
-								try {
-									return d = a[1], ft(d, H.type, H.name, H.lastModified).then((function(m) {
-										try {
-											return e = m, Oe(d), st(e).then((function(_) {
-												try {
-													return t = _[0], Ve.cachedResult = t.width === 1 && t.height === 2, R(Ve.cachedResult);
-												} catch (r) {
-													return P(r);
-												}
-											}), P);
-										} catch (_) {
-											return P(_);
-										}
-									}), P);
-								} catch (m) {
-									return P(m);
-								}
-							}), P);
-						} catch (a) {
-							return P(a);
-						}
-					}), P);
-				}));
-			}
-			function Pt(R) {
-				return new Promise(((P, H) => {
-					const d = new Z();
-					d.onload = (e) => {
-						const t = new DataView(e.target.result);
-						if (t.getUint16(0, !1) != 65496) return P(-2);
-						const u = t.byteLength;
-						let a = 2;
-						for (; a < u;) {
-							if (t.getUint16(a + 2, !1) <= 8) return P(-1);
-							const m = t.getUint16(a, !1);
-							if (a += 2, m == 65505) {
-								if (t.getUint32(a += 2, !1) != 1165519206) return P(-1);
-								const _ = t.getUint16(a += 6, !1) == 18761;
-								a += t.getUint32(a + 4, _);
-								const r = t.getUint16(a, _);
-								a += 2;
-								for (let i = 0; i < r; i++) if (t.getUint16(a + 12 * i, _) == 274) return P(t.getUint16(a + 12 * i + 8, _));
-							} else {
-								if ((65280 & m) != 65280) break;
-								a += t.getUint16(a, !1);
-							}
-						}
-						return P(-1);
-					}, d.onerror = (e) => H(e), d.readAsArrayBuffer(R);
-				}));
-			}
-			function Ot(R, P) {
-				const { width: H } = R, { height: d } = R, { maxWidthOrHeight: e } = P;
-				let t, u = R;
-				return isFinite(e) && (H > e || d > e) && ([u, t] = Ce(H, d), H > d ? (u.width = e, u.height = d / H * e) : (u.width = H / d * e, u.height = e), t.drawImage(R, 0, 0, u.width, u.height), Oe(R)), u;
-			}
-			function Lt(R, P) {
-				const { width: H } = R, { height: d } = R, [e, t] = Ce(H, d);
-				switch (P > 4 && P < 9 ? (e.width = d, e.height = H) : (e.width = H, e.height = d), P) {
-					case 2:
-						t.transform(-1, 0, 0, 1, H, 0);
-						break;
-					case 3:
-						t.transform(-1, 0, 0, -1, H, d);
-						break;
-					case 4:
-						t.transform(1, 0, 0, -1, 0, d);
-						break;
-					case 5:
-						t.transform(0, 1, 1, 0, 0, 0);
-						break;
-					case 6:
-						t.transform(0, 1, -1, 0, d, 0);
-						break;
-					case 7:
-						t.transform(0, -1, -1, 0, d, H);
-						break;
-					case 8: t.transform(0, -1, 1, 0, 0, H);
-				}
-				return t.drawImage(R, 0, 0, H, d), Oe(R), e;
-			}
-			function kt(R, P, H = 0) {
-				return new Promise((function(d, e) {
-					let t, u, a, m, _, r, i, n, s, h, E, x, y, D, O, M, B, g, T, c;
-					function f(A = 5) {
-						if (P.signal && P.signal.aborted) throw P.signal.reason;
-						t += A, P.onProgress(Math.min(t, 100));
-					}
-					function v(A) {
-						if (P.signal && P.signal.aborted) throw P.signal.reason;
-						t = Math.min(Math.max(A, t), 100), P.onProgress(t);
-					}
-					return t = H, u = P.maxIteration || 10, a = 1024 * P.maxSizeMB * 1024, f(), st(R, P).then(function(A) {
-						try {
-							return [, m] = A, f(), _ = Ot(m, P), f(), new Promise((function(w, U) {
-								var p;
-								if (!(p = P.exifOrientation)) return Pt(R).then(function(l) {
-									try {
-										return p = l, I.call(this);
-									} catch (o) {
-										return U(o);
-									}
-								}.bind(this), U);
-								function I() {
-									return w(p);
-								}
-								return I.call(this);
-							})).then(function(w) {
-								try {
-									return r = w, f(), Ve().then(function(U) {
-										try {
-											return i = U ? _ : Lt(_, r), f(), n = P.initialQuality || 1, s = P.fileType || R.type, ft(i, s, R.name, R.lastModified, n).then(function(p) {
-												try {
-													{
-														let l = function() {
-															if (u-- && (O > a || O > y)) {
-																let L, F;
-																return L = c ? .95 * T.width : T.width, F = c ? .95 * T.height : T.height, [B, g] = Ce(L, F), g.drawImage(T, 0, 0, L, F), n *= s === "image/png" ? .85 : .95, ft(B, s, R.name, R.lastModified, n).then((function(k) {
-																	try {
-																		return M = k, Oe(T), T = B, O = M.size, v(Math.min(99, Math.floor((D - O) / (D - a) * 100))), l;
-																	} catch (X) {
-																		return e(X);
-																	}
-																}), e);
-															}
-															return [1];
-														}, o = function() {
-															return Oe(T), Oe(B), Oe(_), Oe(i), Oe(m), v(100), d(M);
-														};
-														if (h = p, f(), E = h.size > a, x = h.size > R.size, !E && !x) return v(100), d(h);
-														var I;
-														return y = R.size, D = h.size, O = D, T = i, c = !P.alwaysKeepResolution && E, (I = function(L) {
-															for (; L;) {
-																if (L.then) return void L.then(I, e);
-																try {
-																	if (L.pop) {
-																		if (L.length) return L.pop() ? o.call(this) : L;
-																		L = l;
-																	} else L = L.call(this);
-																} catch (F) {
-																	return e(F);
-																}
-															}
-														}.bind(this))(l);
-													}
-												} catch (l) {
-													return e(l);
-												}
-											}.bind(this), e);
-										} catch (p) {
-											return e(p);
-										}
-									}.bind(this), e);
-								} catch (U) {
-									return e(U);
-								}
-							}.bind(this), e);
-						} catch (w) {
-							return e(w);
-						}
-					}.bind(this), e);
-				}));
-			}
-			const Mn = `
-let scriptImported = false
-self.addEventListener('message', async (e) => {
-  const { file, id, imageCompressionLibUrl, options } = e.data
-  options.onProgress = (progress) => self.postMessage({ progress, id })
-  try {
-    if (!scriptImported) {
-      // console.log('[worker] importScripts', imageCompressionLibUrl)
-      self.importScripts(imageCompressionLibUrl)
-      scriptImported = true
-    }
-    // console.log('[worker] self', self)
-    const compressedFile = await imageCompression(file, options)
-    self.postMessage({ file: compressedFile, id })
-  } catch (e) {
-    // console.error('[worker] error', e)
-    self.postMessage({ error: e.message + '\\n' + e.stack, id })
-  }
-})
-`;
-			let vt;
-			function xn(R, P) {
-				return new Promise(((H, d) => {
-					vt || (vt = (function(u) {
-						const a = [];
-						return typeof u == "function" ? a.push(`(${u})()`) : a.push(u), URL.createObjectURL(new Blob(a));
-					})(Mn));
-					const e = new Worker(vt);
-					e.addEventListener("message", (function(u) {
-						if (P.signal && P.signal.aborted) e.terminate();
-						else if (u.data.progress === void 0) {
-							if (u.data.error) return d(new Error(u.data.error)), void e.terminate();
-							H(u.data.file), e.terminate();
-						} else P.onProgress(u.data.progress);
-					})), e.addEventListener("error", d), P.signal && P.signal.addEventListener("abort", (() => {
-						d(P.signal.reason), e.terminate();
-					})), e.postMessage({
-						file: R,
-						imageCompressionLibUrl: P.libURL,
-						options: {
-							...P,
-							onProgress: void 0,
-							signal: void 0
-						}
-					});
-				}));
-			}
-			function we(R, P) {
-				return new Promise((function(H, d) {
-					let e, t, u, a, m, _;
-					if (e = { ...P }, u = 0, {onProgress: a} = e, e.maxSizeMB = e.maxSizeMB || Number.POSITIVE_INFINITY, m = typeof e.useWebWorker != "boolean" || e.useWebWorker, delete e.useWebWorker, e.onProgress = (s) => {
-						u = s, typeof a == "function" && a(u);
-					}, !(R instanceof Blob || R instanceof te)) return d(new Error("The file given is not an instance of Blob or File"));
-					if (!/^image/.test(R.type)) return d(new Error("The file given is not an image"));
-					if (_ = typeof WorkerGlobalScope < "u" && self instanceof WorkerGlobalScope, !m || typeof Worker != "function" || _) return kt(R, e).then(function(s) {
-						try {
-							return t = s, n.call(this);
-						} catch (h) {
-							return d(h);
-						}
-					}.bind(this), d);
-					var r = function() {
-						try {
-							return n.call(this);
-						} catch (s) {
-							return d(s);
-						}
-					}.bind(this), i = function(s) {
-						try {
-							return kt(R, e).then((function(h) {
-								try {
-									return t = h, r();
-								} catch (E) {
-									return d(E);
-								}
-							}), d);
-						} catch (h) {
-							return d(h);
-						}
-					};
-					try {
-						return e.libURL = e.libURL || "https://cdn.jsdelivr.net/npm/browser-image-compression@2.0.2/dist/browser-image-compression.js", xn(R, e).then((function(s) {
-							try {
-								return t = s, r();
-							} catch {
-								return i();
-							}
-						}), i);
-					} catch {
-						i();
-					}
-					function n() {
-						try {
-							t.name = R.name, t.lastModified = R.lastModified;
-						} catch {}
-						try {
-							e.preserveExif && R.type === "image/jpeg" && (!e.fileType || e.fileType && e.fileType === R.type) && (t = Q(R, t));
-						} catch {}
-						return H(t);
-					}
-				}));
-			}
-			return we.getDataUrlFromFile = me, we.getFilefromDataUrl = ge, we.loadImage = Pe, we.drawImageInCanvas = Te, we.drawFileInCanvas = st, we.canvasToFile = ft, we.getExifOrientation = Pt, we.handleMaxWidthOrHeight = Ot, we.followExifOrientation = Lt, we.cleanupCanvasMemory = Oe, we.isAutoOrientationInBrowser = Ve, we.approximateBelowMaximumCanvasSizeOfBrowser = xe, we.copyExifWithoutOrientation = Q, we.getBrowserName = le, we.version = "2.0.2", we;
-		}));
-	})), rn = Ze.__toESM(nn()), mt = (b) => {
-		if (!b) return "image/png";
-		const S = b.toLowerCase();
-		return S.includes("jpeg") || S.includes("jpg") || S.includes("pjpeg") ? "image/jpeg" : S.includes("png") ? "image/png" : S.includes("gif") ? "image/gif" : S.includes("webp") ? "image/webp" : S.includes("svg") ? "image/svg+xml" : "image/png";
-	}, It = (b) => {
-		const S = mt(b).split("/")[1];
-		return S === "svg+xml" ? "svg" : S || "png";
-	};
-	function it(b) {
-		switch (b.trim().split(".").pop()?.toLowerCase()) {
-			case "svg": return "image/svg+xml";
-			case "png": return "image/png";
-			case "jpg":
-			case "jpeg": return "image/jpeg";
-			case "gif": return "image/gif";
-			case "webp": return "image/webp";
-			default: return;
-		}
-	}
-	function Mt(b) {
-		if (b.type?.startsWith?.("image/")) return !0;
-		const S = (b.name ?? "").trim();
-		if (it(S)) return !0;
-		const j = (b.type ?? "").toLowerCase();
-		return j.includes("svg") ? !0 : j === "text/xml" || j === "application/xml" || j === "text/plain" ? S.toLowerCase().endsWith(".svg") : !1;
-	}
-	var ot = {
-		MAX_SIZE_MB: .48,
-		MAX_WIDTH_OR_HEIGHT: 2e3,
-		QUALITY: .8
-	}, on = ["gif", "svg"];
-	function an(b) {
-		return !on.includes(b);
-	}
-	function xt(b, S) {
-		if (b?.compressMaxSize === 0 || b?.compressMaxWidthOrHeight === 0) return !1;
-		const j = S?.trim() ?? "";
-		return j.startsWith("image/") && j !== "image/gif";
-	}
-	function St(b) {
-		return {
-			maxSizeMB: b?.compressMaxSize ?? ot.MAX_SIZE_MB,
-			maxWidthOrHeight: b?.compressMaxWidthOrHeight ?? ot.MAX_WIDTH_OR_HEIGHT
-		};
-	}
-	function Ct(b) {
-		if (!b) return null;
-		const S = b.trim();
-		if (S.endsWith("%")) return null;
-		const j = parseFloat(S.replace(/px$/i, ""));
-		return Number.isFinite(j) && j > 0 ? j : null;
-	}
-	function sn(b) {
-		const S = b.match(/<\s*svg\b[\s\S]*?>/i)?.[0] ?? "", j = S.match(/\bwidth\s*=\s*["']([^"']*)["']/i)?.[1], Q = S.match(/\bheight\s*=\s*["']([^"']*)["']/i)?.[1], G = Ct(j), z = Ct(Q);
-		if (G != null && z != null) return {
-			width: G,
-			height: z
-		};
-		const V = b.match(/viewBox\s*=\s*["']([^"']+)["']/i)?.[1];
-		if (V) {
-			const Y = V.trim().split(/[\s,]+/);
-			if (Y.length === 4) {
-				const J = parseFloat(Y[2]), q = parseFloat(Y[3]);
-				if (Number.isFinite(J) && Number.isFinite(q) && J > 0 && q > 0) return {
-					width: J,
-					height: q
-				};
-			}
-		}
-		return G != null ? {
-			width: G,
-			height: G
-		} : z != null ? {
-			width: z,
-			height: z
-		} : {
-			width: 300,
-			height: 300
-		};
-	}
-	function fn(b, S = 2, j = 4096) {
-		const { width: Q, height: G } = sn(b);
-		let z = Math.max(1, Math.round(Q * S)), V = Math.max(1, Math.round(G * S));
-		const Y = Math.max(64, j), J = Math.max(z, V);
-		if (J > Y) {
-			const q = Y / J;
-			z = Math.max(1, Math.round(z * q)), V = Math.max(1, Math.round(V * q));
-		}
-		return {
-			width: z,
-			height: V
-		};
-	}
-	function cn(b) {
-		return new Promise((S, j) => {
-			b.toBlob((Q) => {
-				Q ? S(Q) : j(new Error("canvas.toBlob returned null"));
-			}, "image/png");
-		});
-	}
-	async function ln(b, S, j) {
-		const Q = new Blob([b], { type: "image/svg+xml;charset=utf-8" }), G = URL.createObjectURL(Q);
-		try {
-			const z = new Image();
-			await new Promise((Ee, ae) => {
-				z.onload = () => Ee(), z.onerror = () => ae(new Error("Failed to load SVG image")), z.src = G;
-			});
-			const V = document.createElement("canvas"), Y = Math.max(1, Math.round(S)), J = Math.max(1, Math.round(j));
-			V.width = Y, V.height = J;
-			const q = V.getContext("2d");
-			if (!q) throw new Error("Canvas 2D context is not available");
-			return q.clearRect(0, 0, Y, J), q.drawImage(z, 0, 0, Y, J), cn(V);
-		} finally {
-			URL.revokeObjectURL(G);
-		}
-	}
-	var un = 24e3;
-	async function dn(b, S = un) {
-		const j = Math.min(S, Math.max(0, b.size));
-		return b.slice(0, j).text();
-	}
-	function hn(b) {
-		const S = b.trimStart().replace(/^\uFEFF/, "");
-		return S.startsWith("<") ? /<\s*svg[\s>/]/i.test(S) : !1;
-	}
-	async function gn(b, S = {}) {
-		const j = S.pixelScale ?? 2, Q = S.maxLongEdge ?? 4096, G = await b.text(), { width: z, height: V } = fn(G, j, Q), Y = await ln(G, z, V), J = S.outputFileName ?? b.name, q = /\.svg$/i.test(J) ? J.replace(/\.svg$/i, ".png") : `${J}.png`;
-		return new File([Y], q, {
-			type: "image/png",
-			lastModified: b.lastModified
-		});
-	}
-	function at(b, S, j, Q) {
-		return new File([b], S, {
-			type: j,
-			lastModified: Q
-		});
-	}
-	function pt(b, S) {
-		return !S || S === b.name ? b : at(b, S, b.type, b.lastModified);
-	}
-	function mn(b, S, j, Q) {
-		const G = Q ?? S.name;
-		return b instanceof File ? b.type !== j || b.lastModified !== S.lastModified || b.name !== G ? at(b, G, j, S.lastModified) : b : at(b, G, j, S.lastModified);
-	}
-	function pn(b, S) {
-		const j = S.startsWith(".") ? S.slice(1) : S, Q = b.lastIndexOf(".");
-		return Q > 0 ? `${b.substring(0, Q)}.${j}` : `${b}.${j}`;
-	}
-	function vn(b) {
-		return b === "image/webp" ? "image/jpeg" : b;
-	}
-	async function Tt(b, S = {}) {
-		const { maxSizeMB: j = ot.MAX_SIZE_MB, maxWidthOrHeight: Q = ot.MAX_WIDTH_OR_HEIGHT, mimeType: G, fileName: z, libURL: V, enableCompression: Y = !0, convertSvgToPng: J = !1 } = S;
-		if (!b || !(b instanceof File)) return b;
-		let q = b, Ee = !1;
-		if (J) {
-			const le = (q.type || "").toLowerCase(), xe = /\.svg$/i.test(q.name.trim()), Ce = le.includes("svg");
-			let Te = !1;
-			if (!Ce && !xe) try {
-				Te = hn(await dn(q));
-			} catch {
-				Te = !1;
-			}
-			if (Ce || xe || Te) try {
-				q = await gn(q, {
-					maxLongEdge: Q,
-					outputFileName: z ?? q.name
-				}), Ee = !0;
-			} catch {
-				q = b;
-			}
-		}
-		const ae = mt((q.type && q.type.trim() !== "" ? q.type : it(q.name)) || (Ee ? "image/png" : G) || "image/jpeg"), Be = Ee ? q.name : z ?? q.name;
-		if (!ae.startsWith("image/")) return pt(q, Be);
-		const Fe = vn(ae), te = It(ae), Z = It(Fe), ge = Fe !== ae ? pn(Be, Z) : Be, me = Y && an(te);
-		if (!me && Fe === ae) return pt(q, ge);
-		const Pe = q.type === ae ? q : at(q, q.name, ae, q.lastModified);
-		try {
-			const le = {
-				libURL: V,
-				useWebWorker: !0,
-				fileType: Fe
-			};
-			me ? (le.maxSizeMB = j, le.maxWidthOrHeight = Q) : (le.maxSizeMB = Math.max(Pe.size / (1024 * 1024) + 1, 1), le.initialQuality = 1, le.alwaysKeepResolution = !0);
-			const xe = await (0, rn.default)(Pe, le);
-			return mn(xe, Pe, mt(xe.type || Fe), ge);
-		} catch {
-			try {
-				return pt(q, ge);
-			} catch {
-				return q;
-			}
-		}
-	}
-	var bn = "js/browser-image-compression.js";
-	function Rt() {
-		return Ht.getBundledHostAssetUrl(bn);
-	}
-	async function yn(b, S, j = Rt()) {
-		if (!Mt(b)) return b;
-		const { maxSizeMB: Q, maxWidthOrHeight: G } = St(S), z = b.type?.trim() || it(b.name) || b.type || "";
-		return Tt(b, {
-			maxSizeMB: Q,
-			maxWidthOrHeight: G,
-			mimeType: z || void 0,
-			fileName: b.name,
-			libURL: j,
-			enableCompression: xt(S, z),
-			convertSvgToPng: !0
-		});
-	}
-	async function wn(b, S) {
-		if (!b || typeof b.findFileByUrl != "function") return null;
-		const j = await b.findFileByUrl(S);
-		if (!j) return null;
-		const Q = typeof b.getFileById == "function" && j.id && await b.getFileById(j.id) || j, G = Q.url || S, z = Q.thumbnailUrl || Q.thumbnail || G || (typeof b.getThumbnailUrl == "function" ? await b.getThumbnailUrl(Q) : "") || "";
-		return z ? {
-			file: Q,
-			previewUrl: z
-		} : null;
-	}
-	function An(b) {
-		if (!(b instanceof Blob) || b.size === 0) throw new ct.G("Failed to download file from the URL.", "UploadUrlDownloadFailed");
-		const S = b.type?.split(";")[0]?.trim() || "image/png";
-		if (!S.startsWith("image/")) throw new ct.G("Content type at the URL is not allowed.", "UploadUrlContentTypeNotAllowed");
-		return {
-			blob: b,
-			mimeType: S
-		};
-	}
-	async function _n(b, S) {
-		const j = await fetch(b, S);
-		if (!j.ok) throw new Error(`Server returned ${j.status}`);
-		return j.blob();
-	}
-	async function Un(b, S, j) {
-		const Q = j ? { signal: j } : void 0, { blob: G } = await ct.Oi(b, {
-			handleFileProxy: async (z) => wt.pickFileProxyBlobFromFireResults(await S.fireFileProxy(z)) ?? null,
-			handleProxyUrl: async (z) => wt.pickProxyUrlOverrideFromFireResults(await S.fireProxyUrl(z), z),
-			fetchWithProxy: (z, V, Y) => Ie.fetchWithResourceProxy(z, {
-				config: S.appConfig,
-				standalone: S.isStandalone,
-				intent: Y?.intent || "downloadBlob",
-				validateBlob: async (J) => !J.type || J.type.startsWith("image/"),
-				init: V
-			})
-		}, (z) => _n(z, Q), An, { fetchInit: Q });
-		return G;
-	}
-	function En() {
-		const b = Ie.useAppConfig(), S = Ie.useIsStandalone(), j = Ie.useSelector(Ie.selectProject), { projectId: Q } = Ie.useParams(), G = j?.id !== void 0 ? String(j.id) : Q || "", z = Ie.useEventEmitter(Ie.events.FILE_PROXY_EVENT_ID), V = Ie.useEventEmitter(Ie.events.PROXY_URL_EVENT_ID);
-		return (0, At.useCallback)(async (Y, J) => Un(Y, {
-			appConfig: b,
-			isStandalone: S,
-			fireFileProxy: (q) => z.fire({
-				url: q,
-				project: G
-			}),
-			fireProxyUrl: (q) => V.fire({
-				url: q,
-				project: G
-			})
-		}, J), [
-			b,
-			G,
-			S,
-			z,
-			V
-		]);
-	}
-	function Fn(b) {
-		return Ie.getContainer(b).getOrCreateInstance(Ie.IMAGE_BLOB_RESOLVER_ID, () => tn());
-	}
-	function In() {
-		const b = Ie.useStore();
-		return (0, At.useMemo)(() => Fn(b), [b]);
-	}
-	Object.defineProperty(he, "canonicalImageUrlKey", {
-		enumerable: !0,
-		get: function() {
-			return gt;
-		}
-	}), Object.defineProperty(he, "getAiTariffUpgradeStep", {
-		enumerable: !0,
-		get: function() {
-			return Vt;
-		}
-	}), Object.defineProperty(he, "getBrowserImageCompressionLibUrl", {
-		enumerable: !0,
-		get: function() {
-			return Rt;
-		}
-	}), Object.defineProperty(he, "getImageDimensionsFromBlob", {
-		enumerable: !0,
-		get: function() {
-			return Zt;
-		}
-	}), Object.defineProperty(he, "inferImageMimeFromFileName", {
-		enumerable: !0,
-		get: function() {
-			return it;
-		}
-	}), Object.defineProperty(he, "isAiLimitReached", {
-		enumerable: !0,
-		get: function() {
-			return zt;
-		}
-	}), Object.defineProperty(he, "isAllowedImageUploadFile", {
-		enumerable: !0,
-		get: function() {
-			return Mt;
-		}
-	}), Object.defineProperty(he, "normalizeImageFormatForDisplay", {
-		enumerable: !0,
-		get: function() {
-			return Yt;
-		}
-	}), Object.defineProperty(he, "prepareImageForEditorUpload", {
-		enumerable: !0,
-		get: function() {
-			return yn;
-		}
-	}), Object.defineProperty(he, "prepareImageForUpload", {
-		enumerable: !0,
-		get: function() {
-			return Tt;
-		}
-	}), Object.defineProperty(he, "require_prop_types", {
-		enumerable: !0,
-		get: function() {
-			return Nt;
-		}
-	}), Object.defineProperty(he, "resolveAutoLimitUpgrade", {
-		enumerable: !0,
-		get: function() {
-			return Kt;
-		}
-	}), Object.defineProperty(he, "resolveDataProviderPreview", {
-		enumerable: !0,
-		get: function() {
-			return wn;
-		}
-	}), Object.defineProperty(he, "resolveImageCompressionLimits", {
-		enumerable: !0,
-		get: function() {
-			return St;
-		}
-	}), Object.defineProperty(he, "shouldCountAiUsage", {
-		enumerable: !0,
-		get: function() {
-			return _t;
-		}
-	}), Object.defineProperty(he, "shouldEnableImageCompression", {
-		enumerable: !0,
-		get: function() {
-			return xt;
-		}
-	}), Object.defineProperty(he, "useImageBlobFetch", {
-		enumerable: !0,
-		get: function() {
-			return En;
-		}
-	}), Object.defineProperty(he, "useImageBlobResolver", {
-		enumerable: !0,
-		get: function() {
-			return In;
-		}
-	});
-});