useblocks 1.1.53 → 1.1.56

package/static/core/1f5e1fc9.js

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