{"version":3,"file":"jquery-3-5GtrIU7X.js","sources":["../../../app/javascript/entrypoints/lib/jquery-3.6.0.min.js"],"sourcesContent":["/*! jQuery v3.6.0 | (c) OpenJS Foundation and other contributors | jquery.org/license */\n!(function (e, t) {\n \"use strict\";\n \"object\" == typeof module && \"object\" == typeof module.exports\n ? (module.exports = e.document\n ? t(e, !0)\n : function (e) {\n if (!e.document)\n throw new Error(\"jQuery requires a window with a document\");\n return t(e);\n })\n : t(e);\n})(\"undefined\" != typeof window ? window : this, function (C, e) {\n \"use strict\";\n var t = [],\n r = Object.getPrototypeOf,\n s = t.slice,\n g = t.flat\n ? function (e) {\n return t.flat.call(e);\n }\n : function (e) {\n return t.concat.apply([], e);\n },\n u = t.push,\n i = t.indexOf,\n n = {},\n o = n.toString,\n v = n.hasOwnProperty,\n a = v.toString,\n l = a.call(Object),\n y = {},\n m = function (e) {\n return (\n \"function\" == typeof e &&\n \"number\" != typeof e.nodeType &&\n \"function\" != typeof e.item\n );\n },\n x = function (e) {\n return null != e && e === e.window;\n },\n E = C.document,\n c = { type: !0, src: !0, nonce: !0, noModule: !0 };\n function b(e, t, n) {\n var r,\n i,\n o = (n = n || E).createElement(\"script\");\n if (((o.text = e), t))\n for (r in c)\n (i = t[r] || (t.getAttribute && t.getAttribute(r))) &&\n o.setAttribute(r, i);\n n.head.appendChild(o).parentNode.removeChild(o);\n }\n function w(e) {\n return null == e\n ? e + \"\"\n : \"object\" == typeof e || \"function\" == typeof e\n ? n[o.call(e)] || \"object\"\n : typeof e;\n }\n var f = \"3.6.0\",\n S = function (e, t) {\n return new S.fn.init(e, t);\n };\n function p(e) {\n var t = !!e && \"length\" in e && e.length,\n n = w(e);\n return (\n !m(e) &&\n !x(e) &&\n (\"array\" === n ||\n 0 === t ||\n (\"number\" == typeof t && 0 < t && t - 1 in e))\n );\n }\n (S.fn = S.prototype =\n {\n jquery: f,\n constructor: S,\n length: 0,\n toArray: function () {\n return s.call(this);\n },\n get: function (e) {\n return null == e\n ? s.call(this)\n : e < 0\n ? this[e + this.length]\n : this[e];\n },\n pushStack: function (e) {\n var t = S.merge(this.constructor(), e);\n return (t.prevObject = this), t;\n },\n each: function (e) {\n return S.each(this, e);\n },\n map: function (n) {\n return this.pushStack(\n S.map(this, function (e, t) {\n return n.call(e, t, e);\n })\n );\n },\n slice: function () {\n return this.pushStack(s.apply(this, arguments));\n },\n first: function () {\n return this.eq(0);\n },\n last: function () {\n return this.eq(-1);\n },\n even: function () {\n return this.pushStack(\n S.grep(this, function (e, t) {\n return (t + 1) % 2;\n })\n );\n },\n odd: function () {\n return this.pushStack(\n S.grep(this, function (e, t) {\n return t % 2;\n })\n );\n },\n eq: function (e) {\n var t = this.length,\n n = +e + (e < 0 ? t : 0);\n return this.pushStack(0 <= n && n < t ? [this[n]] : []);\n },\n end: function () {\n return this.prevObject || this.constructor();\n },\n push: u,\n sort: t.sort,\n splice: t.splice,\n }),\n (S.extend = S.fn.extend =\n function () {\n var e,\n t,\n n,\n r,\n i,\n o,\n a = arguments[0] || {},\n s = 1,\n u = arguments.length,\n l = !1;\n for (\n \"boolean\" == typeof a && ((l = a), (a = arguments[s] || {}), s++),\n \"object\" == typeof a || m(a) || (a = {}),\n s === u && ((a = this), s--);\n s < u;\n s++\n )\n if (null != (e = arguments[s]))\n for (t in e)\n (r = e[t]),\n \"__proto__\" !== t &&\n a !== r &&\n (l && r && (S.isPlainObject(r) || (i = Array.isArray(r)))\n ? ((n = a[t]),\n (o =\n i && !Array.isArray(n)\n ? []\n : i || S.isPlainObject(n)\n ? n\n : {}),\n (i = !1),\n (a[t] = S.extend(l, o, r)))\n : void 0 !== r && (a[t] = r));\n return a;\n }),\n S.extend({\n expando: \"jQuery\" + (f + Math.random()).replace(/\\D/g, \"\"),\n isReady: !0,\n error: function (e) {\n throw new Error(e);\n },\n noop: function () {},\n isPlainObject: function (e) {\n var t, n;\n return (\n !(!e || \"[object Object]\" !== o.call(e)) &&\n (!(t = r(e)) ||\n (\"function\" ==\n typeof (n = v.call(t, \"constructor\") && t.constructor) &&\n a.call(n) === l))\n );\n },\n isEmptyObject: function (e) {\n var t;\n for (t in e) return !1;\n return !0;\n },\n globalEval: function (e, t, n) {\n b(e, { nonce: t && t.nonce }, n);\n },\n each: function (e, t) {\n var n,\n r = 0;\n if (p(e)) {\n for (n = e.length; r < n; r++)\n if (!1 === t.call(e[r], r, e[r])) break;\n } else for (r in e) if (!1 === t.call(e[r], r, e[r])) break;\n return e;\n },\n makeArray: function (e, t) {\n var n = t || [];\n return (\n null != e &&\n (p(Object(e))\n ? S.merge(n, \"string\" == typeof e ? [e] : e)\n : u.call(n, e)),\n n\n );\n },\n inArray: function (e, t, n) {\n return null == t ? -1 : i.call(t, e, n);\n },\n merge: function (e, t) {\n for (var n = +t.length, r = 0, i = e.length; r < n; r++) e[i++] = t[r];\n return (e.length = i), e;\n },\n grep: function (e, t, n) {\n for (var r = [], i = 0, o = e.length, a = !n; i < o; i++)\n !t(e[i], i) !== a && r.push(e[i]);\n return r;\n },\n map: function (e, t, n) {\n var r,\n i,\n o = 0,\n a = [];\n if (p(e))\n for (r = e.length; o < r; o++)\n null != (i = t(e[o], o, n)) && a.push(i);\n else for (o in e) null != (i = t(e[o], o, n)) && a.push(i);\n return g(a);\n },\n guid: 1,\n support: y,\n }),\n \"function\" == typeof Symbol && (S.fn[Symbol.iterator] = t[Symbol.iterator]),\n S.each(\n \"Boolean Number String Function Array Date RegExp Object Error Symbol\".split(\n \" \"\n ),\n function (e, t) {\n n[\"[object \" + t + \"]\"] = t.toLowerCase();\n }\n );\n var d = (function (n) {\n var e,\n d,\n b,\n o,\n i,\n h,\n f,\n g,\n w,\n u,\n l,\n T,\n C,\n a,\n E,\n v,\n s,\n c,\n y,\n S = \"sizzle\" + 1 * new Date(),\n p = n.document,\n k = 0,\n r = 0,\n m = ue(),\n x = ue(),\n A = ue(),\n N = ue(),\n j = function (e, t) {\n return e === t && (l = !0), 0;\n },\n D = {}.hasOwnProperty,\n t = [],\n q = t.pop,\n L = t.push,\n H = t.push,\n O = t.slice,\n P = function (e, t) {\n for (var n = 0, r = e.length; n < r; n++) if (e[n] === t) return n;\n return -1;\n },\n R =\n \"checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped\",\n M = \"[\\\\x20\\\\t\\\\r\\\\n\\\\f]\",\n I =\n \"(?:\\\\\\\\[\\\\da-fA-F]{1,6}\" +\n M +\n \"?|\\\\\\\\[^\\\\r\\\\n\\\\f]|[\\\\w-]|[^\\0-\\\\x7f])+\",\n W =\n \"\\\\[\" +\n M +\n \"*(\" +\n I +\n \")(?:\" +\n M +\n \"*([*^$|!~]?=)\" +\n M +\n \"*(?:'((?:\\\\\\\\.|[^\\\\\\\\'])*)'|\\\"((?:\\\\\\\\.|[^\\\\\\\\\\\"])*)\\\"|(\" +\n I +\n \"))|)\" +\n M +\n \"*\\\\]\",\n F =\n \":(\" +\n I +\n \")(?:\\\\((('((?:\\\\\\\\.|[^\\\\\\\\'])*)'|\\\"((?:\\\\\\\\.|[^\\\\\\\\\\\"])*)\\\")|((?:\\\\\\\\.|[^\\\\\\\\()[\\\\]]|\" +\n W +\n \")*)|.*)\\\\)|)\",\n B = new RegExp(M + \"+\", \"g\"),\n $ = new RegExp(\"^\" + M + \"+|((?:^|[^\\\\\\\\])(?:\\\\\\\\.)*)\" + M + \"+$\", \"g\"),\n _ = new RegExp(\"^\" + M + \"*,\" + M + \"*\"),\n z = new RegExp(\"^\" + M + \"*([>+~]|\" + M + \")\" + M + \"*\"),\n U = new RegExp(M + \"|>\"),\n X = new RegExp(F),\n V = new RegExp(\"^\" + I + \"$\"),\n G = {\n ID: new RegExp(\"^#(\" + I + \")\"),\n CLASS: new RegExp(\"^\\\\.(\" + I + \")\"),\n TAG: new RegExp(\"^(\" + I + \"|[*])\"),\n ATTR: new RegExp(\"^\" + W),\n PSEUDO: new RegExp(\"^\" + F),\n CHILD: new RegExp(\n \"^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\\\(\" +\n M +\n \"*(even|odd|(([+-]|)(\\\\d*)n|)\" +\n M +\n \"*(?:([+-]|)\" +\n M +\n \"*(\\\\d+)|))\" +\n M +\n \"*\\\\)|)\",\n \"i\"\n ),\n bool: new RegExp(\"^(?:\" + R + \")$\", \"i\"),\n needsContext: new RegExp(\n \"^\" +\n M +\n \"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\\\(\" +\n M +\n \"*((?:-\\\\d)?\\\\d*)\" +\n M +\n \"*\\\\)|)(?=[^-]|$)\",\n \"i\"\n ),\n },\n Y = /HTML$/i,\n Q = /^(?:input|select|textarea|button)$/i,\n J = /^h\\d$/i,\n K = /^[^{]+\\{\\s*\\[native \\w/,\n Z = /^(?:#([\\w-]+)|(\\w+)|\\.([\\w-]+))$/,\n ee = /[+~]/,\n te = new RegExp(\"\\\\\\\\[\\\\da-fA-F]{1,6}\" + M + \"?|\\\\\\\\([^\\\\r\\\\n\\\\f])\", \"g\"),\n ne = function (e, t) {\n var n = \"0x\" + e.slice(1) - 65536;\n return (\n t ||\n (n < 0\n ? String.fromCharCode(n + 65536)\n : String.fromCharCode((n >> 10) | 55296, (1023 & n) | 56320))\n );\n },\n re = /([\\0-\\x1f\\x7f]|^-?\\d)|^-$|[^\\0-\\x1f\\x7f-\\uFFFF\\w-]/g,\n ie = function (e, t) {\n return t\n ? \"\\0\" === e\n ? \"\\ufffd\"\n : e.slice(0, -1) +\n \"\\\\\" +\n e.charCodeAt(e.length - 1).toString(16) +\n \" \"\n : \"\\\\\" + e;\n },\n oe = function () {\n T();\n },\n ae = be(\n function (e) {\n return !0 === e.disabled && \"fieldset\" === e.nodeName.toLowerCase();\n },\n { dir: \"parentNode\", next: \"legend\" }\n );\n try {\n H.apply((t = O.call(p.childNodes)), p.childNodes),\n t[p.childNodes.length].nodeType;\n } catch (e) {\n H = {\n apply: t.length\n ? function (e, t) {\n L.apply(e, O.call(t));\n }\n : function (e, t) {\n var n = e.length,\n r = 0;\n while ((e[n++] = t[r++]));\n e.length = n - 1;\n },\n };\n }\n function se(t, e, n, r) {\n var i,\n o,\n a,\n s,\n u,\n l,\n c,\n f = e && e.ownerDocument,\n p = e ? e.nodeType : 9;\n if (\n ((n = n || []),\n \"string\" != typeof t || !t || (1 !== p && 9 !== p && 11 !== p))\n )\n return n;\n if (!r && (T(e), (e = e || C), E)) {\n if (11 !== p && (u = Z.exec(t)))\n if ((i = u[1])) {\n if (9 === p) {\n if (!(a = e.getElementById(i))) return n;\n if (a.id === i) return n.push(a), n;\n } else if (f && (a = f.getElementById(i)) && y(e, a) && a.id === i)\n return n.push(a), n;\n } else {\n if (u[2]) return H.apply(n, e.getElementsByTagName(t)), n;\n if (\n (i = u[3]) &&\n d.getElementsByClassName &&\n e.getElementsByClassName\n )\n return H.apply(n, e.getElementsByClassName(i)), n;\n }\n if (\n d.qsa &&\n !N[t + \" \"] &&\n (!v || !v.test(t)) &&\n (1 !== p || \"object\" !== e.nodeName.toLowerCase())\n ) {\n if (((c = t), (f = e), 1 === p && (U.test(t) || z.test(t)))) {\n ((f = (ee.test(t) && ye(e.parentNode)) || e) === e && d.scope) ||\n ((s = e.getAttribute(\"id\"))\n ? (s = s.replace(re, ie))\n : e.setAttribute(\"id\", (s = S))),\n (o = (l = h(t)).length);\n while (o--) l[o] = (s ? \"#\" + s : \":scope\") + \" \" + xe(l[o]);\n c = l.join(\",\");\n }\n try {\n return H.apply(n, f.querySelectorAll(c)), n;\n } catch (e) {\n N(t, !0);\n } finally {\n s === S && e.removeAttribute(\"id\");\n }\n }\n }\n return g(t.replace($, \"$1\"), e, n, r);\n }\n function ue() {\n var r = [];\n return function e(t, n) {\n return (\n r.push(t + \" \") > b.cacheLength && delete e[r.shift()],\n (e[t + \" \"] = n)\n );\n };\n }\n function le(e) {\n return (e[S] = !0), e;\n }\n function ce(e) {\n var t = C.createElement(\"fieldset\");\n try {\n return !!e(t);\n } catch (e) {\n return !1;\n } finally {\n t.parentNode && t.parentNode.removeChild(t), (t = null);\n }\n }\n function fe(e, t) {\n var n = e.split(\"|\"),\n r = n.length;\n while (r--) b.attrHandle[n[r]] = t;\n }\n function pe(e, t) {\n var n = t && e,\n r =\n n &&\n 1 === e.nodeType &&\n 1 === t.nodeType &&\n e.sourceIndex - t.sourceIndex;\n if (r) return r;\n if (n) while ((n = n.nextSibling)) if (n === t) return -1;\n return e ? 1 : -1;\n }\n function de(t) {\n return function (e) {\n return \"input\" === e.nodeName.toLowerCase() && e.type === t;\n };\n }\n function he(n) {\n return function (e) {\n var t = e.nodeName.toLowerCase();\n return (\"input\" === t || \"button\" === t) && e.type === n;\n };\n }\n function ge(t) {\n return function (e) {\n return \"form\" in e\n ? e.parentNode && !1 === e.disabled\n ? \"label\" in e\n ? \"label\" in e.parentNode\n ? e.parentNode.disabled === t\n : e.disabled === t\n : e.isDisabled === t || (e.isDisabled !== !t && ae(e) === t)\n : e.disabled === t\n : \"label\" in e && e.disabled === t;\n };\n }\n function ve(a) {\n return le(function (o) {\n return (\n (o = +o),\n le(function (e, t) {\n var n,\n r = a([], e.length, o),\n i = r.length;\n while (i--) e[(n = r[i])] && (e[n] = !(t[n] = e[n]));\n })\n );\n });\n }\n function ye(e) {\n return e && \"undefined\" != typeof e.getElementsByTagName && e;\n }\n for (e in ((d = se.support = {}),\n (i = se.isXML =\n function (e) {\n var t = e && e.namespaceURI,\n n = e && (e.ownerDocument || e).documentElement;\n return !Y.test(t || (n && n.nodeName) || \"HTML\");\n }),\n (T = se.setDocument =\n function (e) {\n var t,\n n,\n r = e ? e.ownerDocument || e : p;\n return (\n r != C &&\n 9 === r.nodeType &&\n r.documentElement &&\n ((a = (C = r).documentElement),\n (E = !i(C)),\n p != C &&\n (n = C.defaultView) &&\n n.top !== n &&\n (n.addEventListener\n ? n.addEventListener(\"unload\", oe, !1)\n : n.attachEvent && n.attachEvent(\"onunload\", oe)),\n (d.scope = ce(function (e) {\n return (\n a.appendChild(e).appendChild(C.createElement(\"div\")),\n \"undefined\" != typeof e.querySelectorAll &&\n !e.querySelectorAll(\":scope fieldset div\").length\n );\n })),\n (d.attributes = ce(function (e) {\n return (e.className = \"i\"), !e.getAttribute(\"className\");\n })),\n (d.getElementsByTagName = ce(function (e) {\n return (\n e.appendChild(C.createComment(\"\")),\n !e.getElementsByTagName(\"*\").length\n );\n })),\n (d.getElementsByClassName = K.test(C.getElementsByClassName)),\n (d.getById = ce(function (e) {\n return (\n (a.appendChild(e).id = S),\n !C.getElementsByName || !C.getElementsByName(S).length\n );\n })),\n d.getById\n ? ((b.filter.ID = function (e) {\n var t = e.replace(te, ne);\n return function (e) {\n return e.getAttribute(\"id\") === t;\n };\n }),\n (b.find.ID = function (e, t) {\n if (\"undefined\" != typeof t.getElementById && E) {\n var n = t.getElementById(e);\n return n ? [n] : [];\n }\n }))\n : ((b.filter.ID = function (e) {\n var n = e.replace(te, ne);\n return function (e) {\n var t =\n \"undefined\" != typeof e.getAttributeNode &&\n e.getAttributeNode(\"id\");\n return t && t.value === n;\n };\n }),\n (b.find.ID = function (e, t) {\n if (\"undefined\" != typeof t.getElementById && E) {\n var n,\n r,\n i,\n o = t.getElementById(e);\n if (o) {\n if ((n = o.getAttributeNode(\"id\")) && n.value === e)\n return [o];\n (i = t.getElementsByName(e)), (r = 0);\n while ((o = i[r++]))\n if ((n = o.getAttributeNode(\"id\")) && n.value === e)\n return [o];\n }\n return [];\n }\n })),\n (b.find.TAG = d.getElementsByTagName\n ? function (e, t) {\n return \"undefined\" != typeof t.getElementsByTagName\n ? t.getElementsByTagName(e)\n : d.qsa\n ? t.querySelectorAll(e)\n : void 0;\n }\n : function (e, t) {\n var n,\n r = [],\n i = 0,\n o = t.getElementsByTagName(e);\n if (\"*\" === e) {\n while ((n = o[i++])) 1 === n.nodeType && r.push(n);\n return r;\n }\n return o;\n }),\n (b.find.CLASS =\n d.getElementsByClassName &&\n function (e, t) {\n if (\"undefined\" != typeof t.getElementsByClassName && E)\n return t.getElementsByClassName(e);\n }),\n (s = []),\n (v = []),\n (d.qsa = K.test(C.querySelectorAll)) &&\n (ce(function (e) {\n var t;\n (a.appendChild(e).innerHTML =\n \"\"),\n e.querySelectorAll(\"[msallowcapture^='']\").length &&\n v.push(\"[*^$]=\" + M + \"*(?:''|\\\"\\\")\"),\n e.querySelectorAll(\"[selected]\").length ||\n v.push(\"\\\\[\" + M + \"*(?:value|\" + R + \")\"),\n e.querySelectorAll(\"[id~=\" + S + \"-]\").length || v.push(\"~=\"),\n (t = C.createElement(\"input\")).setAttribute(\"name\", \"\"),\n e.appendChild(t),\n e.querySelectorAll(\"[name='']\").length ||\n v.push(\"\\\\[\" + M + \"*name\" + M + \"*=\" + M + \"*(?:''|\\\"\\\")\"),\n e.querySelectorAll(\":checked\").length || v.push(\":checked\"),\n e.querySelectorAll(\"a#\" + S + \"+*\").length ||\n v.push(\".#.+[+~]\"),\n e.querySelectorAll(\"\\\\\\f\"),\n v.push(\"[\\\\r\\\\n\\\\f]\");\n }),\n ce(function (e) {\n e.innerHTML =\n \"\";\n var t = C.createElement(\"input\");\n t.setAttribute(\"type\", \"hidden\"),\n e.appendChild(t).setAttribute(\"name\", \"D\"),\n e.querySelectorAll(\"[name=d]\").length &&\n v.push(\"name\" + M + \"*[*^$|!~]?=\"),\n 2 !== e.querySelectorAll(\":enabled\").length &&\n v.push(\":enabled\", \":disabled\"),\n (a.appendChild(e).disabled = !0),\n 2 !== e.querySelectorAll(\":disabled\").length &&\n v.push(\":enabled\", \":disabled\"),\n e.querySelectorAll(\"*,:x\"),\n v.push(\",.*:\");\n })),\n (d.matchesSelector = K.test(\n (c =\n a.matches ||\n a.webkitMatchesSelector ||\n a.mozMatchesSelector ||\n a.oMatchesSelector ||\n a.msMatchesSelector)\n )) &&\n ce(function (e) {\n (d.disconnectedMatch = c.call(e, \"*\")),\n c.call(e, \"[s!='']:x\"),\n s.push(\"!=\", F);\n }),\n (v = v.length && new RegExp(v.join(\"|\"))),\n (s = s.length && new RegExp(s.join(\"|\"))),\n (t = K.test(a.compareDocumentPosition)),\n (y =\n t || K.test(a.contains)\n ? function (e, t) {\n var n = 9 === e.nodeType ? e.documentElement : e,\n r = t && t.parentNode;\n return (\n e === r ||\n !(\n !r ||\n 1 !== r.nodeType ||\n !(n.contains\n ? n.contains(r)\n : e.compareDocumentPosition &&\n 16 & e.compareDocumentPosition(r))\n )\n );\n }\n : function (e, t) {\n if (t) while ((t = t.parentNode)) if (t === e) return !0;\n return !1;\n }),\n (j = t\n ? function (e, t) {\n if (e === t) return (l = !0), 0;\n var n =\n !e.compareDocumentPosition - !t.compareDocumentPosition;\n return (\n n ||\n (1 &\n (n =\n (e.ownerDocument || e) == (t.ownerDocument || t)\n ? e.compareDocumentPosition(t)\n : 1) ||\n (!d.sortDetached && t.compareDocumentPosition(e) === n)\n ? e == C || (e.ownerDocument == p && y(p, e))\n ? -1\n : t == C || (t.ownerDocument == p && y(p, t))\n ? 1\n : u\n ? P(u, e) - P(u, t)\n : 0\n : 4 & n\n ? -1\n : 1)\n );\n }\n : function (e, t) {\n if (e === t) return (l = !0), 0;\n var n,\n r = 0,\n i = e.parentNode,\n o = t.parentNode,\n a = [e],\n s = [t];\n if (!i || !o)\n return e == C\n ? -1\n : t == C\n ? 1\n : i\n ? -1\n : o\n ? 1\n : u\n ? P(u, e) - P(u, t)\n : 0;\n if (i === o) return pe(e, t);\n n = e;\n while ((n = n.parentNode)) a.unshift(n);\n n = t;\n while ((n = n.parentNode)) s.unshift(n);\n while (a[r] === s[r]) r++;\n return r\n ? pe(a[r], s[r])\n : a[r] == p\n ? -1\n : s[r] == p\n ? 1\n : 0;\n })),\n C\n );\n }),\n (se.matches = function (e, t) {\n return se(e, null, null, t);\n }),\n (se.matchesSelector = function (e, t) {\n if (\n (T(e),\n d.matchesSelector &&\n E &&\n !N[t + \" \"] &&\n (!s || !s.test(t)) &&\n (!v || !v.test(t)))\n )\n try {\n var n = c.call(e, t);\n if (\n n ||\n d.disconnectedMatch ||\n (e.document && 11 !== e.document.nodeType)\n )\n return n;\n } catch (e) {\n N(t, !0);\n }\n return 0 < se(t, C, null, [e]).length;\n }),\n (se.contains = function (e, t) {\n return (e.ownerDocument || e) != C && T(e), y(e, t);\n }),\n (se.attr = function (e, t) {\n (e.ownerDocument || e) != C && T(e);\n var n = b.attrHandle[t.toLowerCase()],\n r = n && D.call(b.attrHandle, t.toLowerCase()) ? n(e, t, !E) : void 0;\n return void 0 !== r\n ? r\n : d.attributes || !E\n ? e.getAttribute(t)\n : (r = e.getAttributeNode(t)) && r.specified\n ? r.value\n : null;\n }),\n (se.escape = function (e) {\n return (e + \"\").replace(re, ie);\n }),\n (se.error = function (e) {\n throw new Error(\"Syntax error, unrecognized expression: \" + e);\n }),\n (se.uniqueSort = function (e) {\n var t,\n n = [],\n r = 0,\n i = 0;\n if (\n ((l = !d.detectDuplicates),\n (u = !d.sortStable && e.slice(0)),\n e.sort(j),\n l)\n ) {\n while ((t = e[i++])) t === e[i] && (r = n.push(i));\n while (r--) e.splice(n[r], 1);\n }\n return (u = null), e;\n }),\n (o = se.getText =\n function (e) {\n var t,\n n = \"\",\n r = 0,\n i = e.nodeType;\n if (i) {\n if (1 === i || 9 === i || 11 === i) {\n if (\"string\" == typeof e.textContent) return e.textContent;\n for (e = e.firstChild; e; e = e.nextSibling) n += o(e);\n } else if (3 === i || 4 === i) return e.nodeValue;\n } else while ((t = e[r++])) n += o(t);\n return n;\n }),\n ((b = se.selectors =\n {\n cacheLength: 50,\n createPseudo: le,\n match: G,\n attrHandle: {},\n find: {},\n relative: {\n \">\": { dir: \"parentNode\", first: !0 },\n \" \": { dir: \"parentNode\" },\n \"+\": { dir: \"previousSibling\", first: !0 },\n \"~\": { dir: \"previousSibling\" },\n },\n preFilter: {\n ATTR: function (e) {\n return (\n (e[1] = e[1].replace(te, ne)),\n (e[3] = (e[3] || e[4] || e[5] || \"\").replace(te, ne)),\n \"~=\" === e[2] && (e[3] = \" \" + e[3] + \" \"),\n e.slice(0, 4)\n );\n },\n CHILD: function (e) {\n return (\n (e[1] = e[1].toLowerCase()),\n \"nth\" === e[1].slice(0, 3)\n ? (e[3] || se.error(e[0]),\n (e[4] = +(e[4]\n ? e[5] + (e[6] || 1)\n : 2 * (\"even\" === e[3] || \"odd\" === e[3]))),\n (e[5] = +(e[7] + e[8] || \"odd\" === e[3])))\n : e[3] && se.error(e[0]),\n e\n );\n },\n PSEUDO: function (e) {\n var t,\n n = !e[6] && e[2];\n return G.CHILD.test(e[0])\n ? null\n : (e[3]\n ? (e[2] = e[4] || e[5] || \"\")\n : n &&\n X.test(n) &&\n (t = h(n, !0)) &&\n (t = n.indexOf(\")\", n.length - t) - n.length) &&\n ((e[0] = e[0].slice(0, t)), (e[2] = n.slice(0, t))),\n e.slice(0, 3));\n },\n },\n filter: {\n TAG: function (e) {\n var t = e.replace(te, ne).toLowerCase();\n return \"*\" === e\n ? function () {\n return !0;\n }\n : function (e) {\n return e.nodeName && e.nodeName.toLowerCase() === t;\n };\n },\n CLASS: function (e) {\n var t = m[e + \" \"];\n return (\n t ||\n ((t = new RegExp(\"(^|\" + M + \")\" + e + \"(\" + M + \"|$)\")) &&\n m(e, function (e) {\n return t.test(\n (\"string\" == typeof e.className && e.className) ||\n (\"undefined\" != typeof e.getAttribute &&\n e.getAttribute(\"class\")) ||\n \"\"\n );\n }))\n );\n },\n ATTR: function (n, r, i) {\n return function (e) {\n var t = se.attr(e, n);\n return null == t\n ? \"!=\" === r\n : !r ||\n ((t += \"\"),\n \"=\" === r\n ? t === i\n : \"!=\" === r\n ? t !== i\n : \"^=\" === r\n ? i && 0 === t.indexOf(i)\n : \"*=\" === r\n ? i && -1 < t.indexOf(i)\n : \"$=\" === r\n ? i && t.slice(-i.length) === i\n : \"~=\" === r\n ? -1 < (\" \" + t.replace(B, \" \") + \" \").indexOf(i)\n : \"|=\" === r &&\n (t === i || t.slice(0, i.length + 1) === i + \"-\"));\n };\n },\n CHILD: function (h, e, t, g, v) {\n var y = \"nth\" !== h.slice(0, 3),\n m = \"last\" !== h.slice(-4),\n x = \"of-type\" === e;\n return 1 === g && 0 === v\n ? function (e) {\n return !!e.parentNode;\n }\n : function (e, t, n) {\n var r,\n i,\n o,\n a,\n s,\n u,\n l = y !== m ? \"nextSibling\" : \"previousSibling\",\n c = e.parentNode,\n f = x && e.nodeName.toLowerCase(),\n p = !n && !x,\n d = !1;\n if (c) {\n if (y) {\n while (l) {\n a = e;\n while ((a = a[l]))\n if (\n x\n ? a.nodeName.toLowerCase() === f\n : 1 === a.nodeType\n )\n return !1;\n u = l = \"only\" === h && !u && \"nextSibling\";\n }\n return !0;\n }\n if (((u = [m ? c.firstChild : c.lastChild]), m && p)) {\n (d =\n (s =\n (r =\n (i =\n (o = (a = c)[S] || (a[S] = {}))[a.uniqueID] ||\n (o[a.uniqueID] = {}))[h] || [])[0] === k &&\n r[1]) && r[2]),\n (a = s && c.childNodes[s]);\n while ((a = (++s && a && a[l]) || (d = s = 0) || u.pop()))\n if (1 === a.nodeType && ++d && a === e) {\n i[h] = [k, s, d];\n break;\n }\n } else if (\n (p &&\n (d = s =\n (r =\n (i =\n (o = (a = e)[S] || (a[S] = {}))[a.uniqueID] ||\n (o[a.uniqueID] = {}))[h] || [])[0] === k && r[1]),\n !1 === d)\n )\n while ((a = (++s && a && a[l]) || (d = s = 0) || u.pop()))\n if (\n (x\n ? a.nodeName.toLowerCase() === f\n : 1 === a.nodeType) &&\n ++d &&\n (p &&\n ((i =\n (o = a[S] || (a[S] = {}))[a.uniqueID] ||\n (o[a.uniqueID] = {}))[h] = [k, d]),\n a === e)\n )\n break;\n return (d -= v) === g || (d % g == 0 && 0 <= d / g);\n }\n };\n },\n PSEUDO: function (e, o) {\n var t,\n a =\n b.pseudos[e] ||\n b.setFilters[e.toLowerCase()] ||\n se.error(\"unsupported pseudo: \" + e);\n return a[S]\n ? a(o)\n : 1 < a.length\n ? ((t = [e, e, \"\", o]),\n b.setFilters.hasOwnProperty(e.toLowerCase())\n ? le(function (e, t) {\n var n,\n r = a(e, o),\n i = r.length;\n while (i--) e[(n = P(e, r[i]))] = !(t[n] = r[i]);\n })\n : function (e) {\n return a(e, 0, t);\n })\n : a;\n },\n },\n pseudos: {\n not: le(function (e) {\n var r = [],\n i = [],\n s = f(e.replace($, \"$1\"));\n return s[S]\n ? le(function (e, t, n, r) {\n var i,\n o = s(e, null, r, []),\n a = e.length;\n while (a--) (i = o[a]) && (e[a] = !(t[a] = i));\n })\n : function (e, t, n) {\n return (r[0] = e), s(r, null, n, i), (r[0] = null), !i.pop();\n };\n }),\n has: le(function (t) {\n return function (e) {\n return 0 < se(t, e).length;\n };\n }),\n contains: le(function (t) {\n return (\n (t = t.replace(te, ne)),\n function (e) {\n return -1 < (e.textContent || o(e)).indexOf(t);\n }\n );\n }),\n lang: le(function (n) {\n return (\n V.test(n || \"\") || se.error(\"unsupported lang: \" + n),\n (n = n.replace(te, ne).toLowerCase()),\n function (e) {\n var t;\n do {\n if (\n (t = E\n ? e.lang\n : e.getAttribute(\"xml:lang\") || e.getAttribute(\"lang\"))\n )\n return (\n (t = t.toLowerCase()) === n || 0 === t.indexOf(n + \"-\")\n );\n } while ((e = e.parentNode) && 1 === e.nodeType);\n return !1;\n }\n );\n }),\n target: function (e) {\n var t = n.location && n.location.hash;\n return t && t.slice(1) === e.id;\n },\n root: function (e) {\n return e === a;\n },\n focus: function (e) {\n return (\n e === C.activeElement &&\n (!C.hasFocus || C.hasFocus()) &&\n !!(e.type || e.href || ~e.tabIndex)\n );\n },\n enabled: ge(!1),\n disabled: ge(!0),\n checked: function (e) {\n var t = e.nodeName.toLowerCase();\n return (\n (\"input\" === t && !!e.checked) || (\"option\" === t && !!e.selected)\n );\n },\n selected: function (e) {\n return (\n e.parentNode && e.parentNode.selectedIndex, !0 === e.selected\n );\n },\n empty: function (e) {\n for (e = e.firstChild; e; e = e.nextSibling)\n if (e.nodeType < 6) return !1;\n return !0;\n },\n parent: function (e) {\n return !b.pseudos.empty(e);\n },\n header: function (e) {\n return J.test(e.nodeName);\n },\n input: function (e) {\n return Q.test(e.nodeName);\n },\n button: function (e) {\n var t = e.nodeName.toLowerCase();\n return (\"input\" === t && \"button\" === e.type) || \"button\" === t;\n },\n text: function (e) {\n var t;\n return (\n \"input\" === e.nodeName.toLowerCase() &&\n \"text\" === e.type &&\n (null == (t = e.getAttribute(\"type\")) ||\n \"text\" === t.toLowerCase())\n );\n },\n first: ve(function () {\n return [0];\n }),\n last: ve(function (e, t) {\n return [t - 1];\n }),\n eq: ve(function (e, t, n) {\n return [n < 0 ? n + t : n];\n }),\n even: ve(function (e, t) {\n for (var n = 0; n < t; n += 2) e.push(n);\n return e;\n }),\n odd: ve(function (e, t) {\n for (var n = 1; n < t; n += 2) e.push(n);\n return e;\n }),\n lt: ve(function (e, t, n) {\n for (var r = n < 0 ? n + t : t < n ? t : n; 0 <= --r; ) e.push(r);\n return e;\n }),\n gt: ve(function (e, t, n) {\n for (var r = n < 0 ? n + t : n; ++r < t; ) e.push(r);\n return e;\n }),\n },\n }).pseudos.nth = b.pseudos.eq),\n { radio: !0, checkbox: !0, file: !0, password: !0, image: !0 }))\n b.pseudos[e] = de(e);\n for (e in { submit: !0, reset: !0 }) b.pseudos[e] = he(e);\n function me() {}\n function xe(e) {\n for (var t = 0, n = e.length, r = \"\"; t < n; t++) r += e[t].value;\n return r;\n }\n function be(s, e, t) {\n var u = e.dir,\n l = e.next,\n c = l || u,\n f = t && \"parentNode\" === c,\n p = r++;\n return e.first\n ? function (e, t, n) {\n while ((e = e[u])) if (1 === e.nodeType || f) return s(e, t, n);\n return !1;\n }\n : function (e, t, n) {\n var r,\n i,\n o,\n a = [k, p];\n if (n) {\n while ((e = e[u]))\n if ((1 === e.nodeType || f) && s(e, t, n)) return !0;\n } else\n while ((e = e[u]))\n if (1 === e.nodeType || f)\n if (\n ((i =\n (o = e[S] || (e[S] = {}))[e.uniqueID] ||\n (o[e.uniqueID] = {})),\n l && l === e.nodeName.toLowerCase())\n )\n e = e[u] || e;\n else {\n if ((r = i[c]) && r[0] === k && r[1] === p)\n return (a[2] = r[2]);\n if (((i[c] = a)[2] = s(e, t, n))) return !0;\n }\n return !1;\n };\n }\n function we(i) {\n return 1 < i.length\n ? function (e, t, n) {\n var r = i.length;\n while (r--) if (!i[r](e, t, n)) return !1;\n return !0;\n }\n : i[0];\n }\n function Te(e, t, n, r, i) {\n for (var o, a = [], s = 0, u = e.length, l = null != t; s < u; s++)\n (o = e[s]) && ((n && !n(o, r, i)) || (a.push(o), l && t.push(s)));\n return a;\n }\n function Ce(d, h, g, v, y, e) {\n return (\n v && !v[S] && (v = Ce(v)),\n y && !y[S] && (y = Ce(y, e)),\n le(function (e, t, n, r) {\n var i,\n o,\n a,\n s = [],\n u = [],\n l = t.length,\n c =\n e ||\n (function (e, t, n) {\n for (var r = 0, i = t.length; r < i; r++) se(e, t[r], n);\n return n;\n })(h || \"*\", n.nodeType ? [n] : n, []),\n f = !d || (!e && h) ? c : Te(c, s, d, n, r),\n p = g ? (y || (e ? d : l || v) ? [] : t) : f;\n if ((g && g(f, p, n, r), v)) {\n (i = Te(p, u)), v(i, [], n, r), (o = i.length);\n while (o--) (a = i[o]) && (p[u[o]] = !(f[u[o]] = a));\n }\n if (e) {\n if (y || d) {\n if (y) {\n (i = []), (o = p.length);\n while (o--) (a = p[o]) && i.push((f[o] = a));\n y(null, (p = []), i, r);\n }\n o = p.length;\n while (o--)\n (a = p[o]) &&\n -1 < (i = y ? P(e, a) : s[o]) &&\n (e[i] = !(t[i] = a));\n }\n } else (p = Te(p === t ? p.splice(l, p.length) : p)), y ? y(null, t, p, r) : H.apply(t, p);\n })\n );\n }\n function Ee(e) {\n for (\n var i,\n t,\n n,\n r = e.length,\n o = b.relative[e[0].type],\n a = o || b.relative[\" \"],\n s = o ? 1 : 0,\n u = be(\n function (e) {\n return e === i;\n },\n a,\n !0\n ),\n l = be(\n function (e) {\n return -1 < P(i, e);\n },\n a,\n !0\n ),\n c = [\n function (e, t, n) {\n var r =\n (!o && (n || t !== w)) ||\n ((i = t).nodeType ? u(e, t, n) : l(e, t, n));\n return (i = null), r;\n },\n ];\n s < r;\n s++\n )\n if ((t = b.relative[e[s].type])) c = [be(we(c), t)];\n else {\n if ((t = b.filter[e[s].type].apply(null, e[s].matches))[S]) {\n for (n = ++s; n < r; n++) if (b.relative[e[n].type]) break;\n return Ce(\n 1 < s && we(c),\n 1 < s &&\n xe(\n e\n .slice(0, s - 1)\n .concat({ value: \" \" === e[s - 2].type ? \"*\" : \"\" })\n ).replace($, \"$1\"),\n t,\n s < n && Ee(e.slice(s, n)),\n n < r && Ee((e = e.slice(n))),\n n < r && xe(e)\n );\n }\n c.push(t);\n }\n return we(c);\n }\n return (\n (me.prototype = b.filters = b.pseudos),\n (b.setFilters = new me()),\n (h = se.tokenize =\n function (e, t) {\n var n,\n r,\n i,\n o,\n a,\n s,\n u,\n l = x[e + \" \"];\n if (l) return t ? 0 : l.slice(0);\n (a = e), (s = []), (u = b.preFilter);\n while (a) {\n for (o in ((n && !(r = _.exec(a))) ||\n (r && (a = a.slice(r[0].length) || a), s.push((i = []))),\n (n = !1),\n (r = z.exec(a)) &&\n ((n = r.shift()),\n i.push({ value: n, type: r[0].replace($, \" \") }),\n (a = a.slice(n.length))),\n b.filter))\n !(r = G[o].exec(a)) ||\n (u[o] && !(r = u[o](r))) ||\n ((n = r.shift()),\n i.push({ value: n, type: o, matches: r }),\n (a = a.slice(n.length)));\n if (!n) break;\n }\n return t ? a.length : a ? se.error(e) : x(e, s).slice(0);\n }),\n (f = se.compile =\n function (e, t) {\n var n,\n v,\n y,\n m,\n x,\n r,\n i = [],\n o = [],\n a = A[e + \" \"];\n if (!a) {\n t || (t = h(e)), (n = t.length);\n while (n--) (a = Ee(t[n]))[S] ? i.push(a) : o.push(a);\n (a = A(\n e,\n ((v = o),\n (m = 0 < (y = i).length),\n (x = 0 < v.length),\n (r = function (e, t, n, r, i) {\n var o,\n a,\n s,\n u = 0,\n l = \"0\",\n c = e && [],\n f = [],\n p = w,\n d = e || (x && b.find.TAG(\"*\", i)),\n h = (k += null == p ? 1 : Math.random() || 0.1),\n g = d.length;\n for (\n i && (w = t == C || t || i);\n l !== g && null != (o = d[l]);\n l++\n ) {\n if (x && o) {\n (a = 0), t || o.ownerDocument == C || (T(o), (n = !E));\n while ((s = v[a++]))\n if (s(o, t || C, n)) {\n r.push(o);\n break;\n }\n i && (k = h);\n }\n m && ((o = !s && o) && u--, e && c.push(o));\n }\n if (((u += l), m && l !== u)) {\n a = 0;\n while ((s = y[a++])) s(c, f, t, n);\n if (e) {\n if (0 < u) while (l--) c[l] || f[l] || (f[l] = q.call(r));\n f = Te(f);\n }\n H.apply(r, f),\n i &&\n !e &&\n 0 < f.length &&\n 1 < u + y.length &&\n se.uniqueSort(r);\n }\n return i && ((k = h), (w = p)), c;\n }),\n m ? le(r) : r)\n )).selector = e;\n }\n return a;\n }),\n (g = se.select =\n function (e, t, n, r) {\n var i,\n o,\n a,\n s,\n u,\n l = \"function\" == typeof e && e,\n c = !r && h((e = l.selector || e));\n if (((n = n || []), 1 === c.length)) {\n if (\n 2 < (o = c[0] = c[0].slice(0)).length &&\n \"ID\" === (a = o[0]).type &&\n 9 === t.nodeType &&\n E &&\n b.relative[o[1].type]\n ) {\n if (!(t = (b.find.ID(a.matches[0].replace(te, ne), t) || [])[0]))\n return n;\n l && (t = t.parentNode), (e = e.slice(o.shift().value.length));\n }\n i = G.needsContext.test(e) ? 0 : o.length;\n while (i--) {\n if (((a = o[i]), b.relative[(s = a.type)])) break;\n if (\n (u = b.find[s]) &&\n (r = u(\n a.matches[0].replace(te, ne),\n (ee.test(o[0].type) && ye(t.parentNode)) || t\n ))\n ) {\n if ((o.splice(i, 1), !(e = r.length && xe(o))))\n return H.apply(n, r), n;\n break;\n }\n }\n }\n return (\n (l || f(e, c))(\n r,\n t,\n !E,\n n,\n !t || (ee.test(e) && ye(t.parentNode)) || t\n ),\n n\n );\n }),\n (d.sortStable = S.split(\"\").sort(j).join(\"\") === S),\n (d.detectDuplicates = !!l),\n T(),\n (d.sortDetached = ce(function (e) {\n return 1 & e.compareDocumentPosition(C.createElement(\"fieldset\"));\n })),\n ce(function (e) {\n return (\n (e.innerHTML = \"\"),\n \"#\" === e.firstChild.getAttribute(\"href\")\n );\n }) ||\n fe(\"type|href|height|width\", function (e, t, n) {\n if (!n) return e.getAttribute(t, \"type\" === t.toLowerCase() ? 1 : 2);\n }),\n (d.attributes &&\n ce(function (e) {\n return (\n (e.innerHTML = \"\"),\n e.firstChild.setAttribute(\"value\", \"\"),\n \"\" === e.firstChild.getAttribute(\"value\")\n );\n })) ||\n fe(\"value\", function (e, t, n) {\n if (!n && \"input\" === e.nodeName.toLowerCase()) return e.defaultValue;\n }),\n ce(function (e) {\n return null == e.getAttribute(\"disabled\");\n }) ||\n fe(R, function (e, t, n) {\n var r;\n if (!n)\n return !0 === e[t]\n ? t.toLowerCase()\n : (r = e.getAttributeNode(t)) && r.specified\n ? r.value\n : null;\n }),\n se\n );\n })(C);\n (S.find = d),\n (S.expr = d.selectors),\n (S.expr[\":\"] = S.expr.pseudos),\n (S.uniqueSort = S.unique = d.uniqueSort),\n (S.text = d.getText),\n (S.isXMLDoc = d.isXML),\n (S.contains = d.contains),\n (S.escapeSelector = d.escape);\n var h = function (e, t, n) {\n var r = [],\n i = void 0 !== n;\n while ((e = e[t]) && 9 !== e.nodeType)\n if (1 === e.nodeType) {\n if (i && S(e).is(n)) break;\n r.push(e);\n }\n return r;\n },\n T = function (e, t) {\n for (var n = []; e; e = e.nextSibling)\n 1 === e.nodeType && e !== t && n.push(e);\n return n;\n },\n k = S.expr.match.needsContext;\n function A(e, t) {\n return e.nodeName && e.nodeName.toLowerCase() === t.toLowerCase();\n }\n var N = /^<([a-z][^\\/\\0>:\\x20\\t\\r\\n\\f]*)[\\x20\\t\\r\\n\\f]*\\/?>(?:<\\/\\1>|)$/i;\n function j(e, n, r) {\n return m(n)\n ? S.grep(e, function (e, t) {\n return !!n.call(e, t, e) !== r;\n })\n : n.nodeType\n ? S.grep(e, function (e) {\n return (e === n) !== r;\n })\n : \"string\" != typeof n\n ? S.grep(e, function (e) {\n return -1 < i.call(n, e) !== r;\n })\n : S.filter(n, e, r);\n }\n (S.filter = function (e, t, n) {\n var r = t[0];\n return (\n n && (e = \":not(\" + e + \")\"),\n 1 === t.length && 1 === r.nodeType\n ? S.find.matchesSelector(r, e)\n ? [r]\n : []\n : S.find.matches(\n e,\n S.grep(t, function (e) {\n return 1 === e.nodeType;\n })\n )\n );\n }),\n S.fn.extend({\n find: function (e) {\n var t,\n n,\n r = this.length,\n i = this;\n if (\"string\" != typeof e)\n return this.pushStack(\n S(e).filter(function () {\n for (t = 0; t < r; t++) if (S.contains(i[t], this)) return !0;\n })\n );\n for (n = this.pushStack([]), t = 0; t < r; t++) S.find(e, i[t], n);\n return 1 < r ? S.uniqueSort(n) : n;\n },\n filter: function (e) {\n return this.pushStack(j(this, e || [], !1));\n },\n not: function (e) {\n return this.pushStack(j(this, e || [], !0));\n },\n is: function (e) {\n return !!j(this, \"string\" == typeof e && k.test(e) ? S(e) : e || [], !1)\n .length;\n },\n });\n var D,\n q = /^(?:\\s*(<[\\w\\W]+>)[^>]*|#([\\w-]+))$/;\n ((S.fn.init = function (e, t, n) {\n var r, i;\n if (!e) return this;\n if (((n = n || D), \"string\" == typeof e)) {\n if (\n !(r =\n \"<\" === e[0] && \">\" === e[e.length - 1] && 3 <= e.length\n ? [null, e, null]\n : q.exec(e)) ||\n (!r[1] && t)\n )\n return !t || t.jquery ? (t || n).find(e) : this.constructor(t).find(e);\n if (r[1]) {\n if (\n ((t = t instanceof S ? t[0] : t),\n S.merge(\n this,\n S.parseHTML(r[1], t && t.nodeType ? t.ownerDocument || t : E, !0)\n ),\n N.test(r[1]) && S.isPlainObject(t))\n )\n for (r in t) m(this[r]) ? this[r](t[r]) : this.attr(r, t[r]);\n return this;\n }\n return (\n (i = E.getElementById(r[2])) && ((this[0] = i), (this.length = 1)), this\n );\n }\n return e.nodeType\n ? ((this[0] = e), (this.length = 1), this)\n : m(e)\n ? void 0 !== n.ready\n ? n.ready(e)\n : e(S)\n : S.makeArray(e, this);\n }).prototype = S.fn),\n (D = S(E));\n var L = /^(?:parents|prev(?:Until|All))/,\n H = { children: !0, contents: !0, next: !0, prev: !0 };\n function O(e, t) {\n while ((e = e[t]) && 1 !== e.nodeType);\n return e;\n }\n S.fn.extend({\n has: function (e) {\n var t = S(e, this),\n n = t.length;\n return this.filter(function () {\n for (var e = 0; e < n; e++) if (S.contains(this, t[e])) return !0;\n });\n },\n closest: function (e, t) {\n var n,\n r = 0,\n i = this.length,\n o = [],\n a = \"string\" != typeof e && S(e);\n if (!k.test(e))\n for (; r < i; r++)\n for (n = this[r]; n && n !== t; n = n.parentNode)\n if (\n n.nodeType < 11 &&\n (a\n ? -1 < a.index(n)\n : 1 === n.nodeType && S.find.matchesSelector(n, e))\n ) {\n o.push(n);\n break;\n }\n return this.pushStack(1 < o.length ? S.uniqueSort(o) : o);\n },\n index: function (e) {\n return e\n ? \"string\" == typeof e\n ? i.call(S(e), this[0])\n : i.call(this, e.jquery ? e[0] : e)\n : this[0] && this[0].parentNode\n ? this.first().prevAll().length\n : -1;\n },\n add: function (e, t) {\n return this.pushStack(S.uniqueSort(S.merge(this.get(), S(e, t))));\n },\n addBack: function (e) {\n return this.add(null == e ? this.prevObject : this.prevObject.filter(e));\n },\n }),\n S.each(\n {\n parent: function (e) {\n var t = e.parentNode;\n return t && 11 !== t.nodeType ? t : null;\n },\n parents: function (e) {\n return h(e, \"parentNode\");\n },\n parentsUntil: function (e, t, n) {\n return h(e, \"parentNode\", n);\n },\n next: function (e) {\n return O(e, \"nextSibling\");\n },\n prev: function (e) {\n return O(e, \"previousSibling\");\n },\n nextAll: function (e) {\n return h(e, \"nextSibling\");\n },\n prevAll: function (e) {\n return h(e, \"previousSibling\");\n },\n nextUntil: function (e, t, n) {\n return h(e, \"nextSibling\", n);\n },\n prevUntil: function (e, t, n) {\n return h(e, \"previousSibling\", n);\n },\n siblings: function (e) {\n return T((e.parentNode || {}).firstChild, e);\n },\n children: function (e) {\n return T(e.firstChild);\n },\n contents: function (e) {\n return null != e.contentDocument && r(e.contentDocument)\n ? e.contentDocument\n : (A(e, \"template\") && (e = e.content || e),\n S.merge([], e.childNodes));\n },\n },\n function (r, i) {\n S.fn[r] = function (e, t) {\n var n = S.map(this, i, e);\n return (\n \"Until\" !== r.slice(-5) && (t = e),\n t && \"string\" == typeof t && (n = S.filter(t, n)),\n 1 < this.length &&\n (H[r] || S.uniqueSort(n), L.test(r) && n.reverse()),\n this.pushStack(n)\n );\n };\n }\n );\n var P = /[^\\x20\\t\\r\\n\\f]+/g;\n function R(e) {\n return e;\n }\n function M(e) {\n throw e;\n }\n function I(e, t, n, r) {\n var i;\n try {\n e && m((i = e.promise))\n ? i.call(e).done(t).fail(n)\n : e && m((i = e.then))\n ? i.call(e, t, n)\n : t.apply(void 0, [e].slice(r));\n } catch (e) {\n n.apply(void 0, [e]);\n }\n }\n (S.Callbacks = function (r) {\n var e, n;\n r =\n \"string\" == typeof r\n ? ((e = r),\n (n = {}),\n S.each(e.match(P) || [], function (e, t) {\n n[t] = !0;\n }),\n n)\n : S.extend({}, r);\n var i,\n t,\n o,\n a,\n s = [],\n u = [],\n l = -1,\n c = function () {\n for (a = a || r.once, o = i = !0; u.length; l = -1) {\n t = u.shift();\n while (++l < s.length)\n !1 === s[l].apply(t[0], t[1]) &&\n r.stopOnFalse &&\n ((l = s.length), (t = !1));\n }\n r.memory || (t = !1), (i = !1), a && (s = t ? [] : \"\");\n },\n f = {\n add: function () {\n return (\n s &&\n (t && !i && ((l = s.length - 1), u.push(t)),\n (function n(e) {\n S.each(e, function (e, t) {\n m(t)\n ? (r.unique && f.has(t)) || s.push(t)\n : t && t.length && \"string\" !== w(t) && n(t);\n });\n })(arguments),\n t && !i && c()),\n this\n );\n },\n remove: function () {\n return (\n S.each(arguments, function (e, t) {\n var n;\n while (-1 < (n = S.inArray(t, s, n)))\n s.splice(n, 1), n <= l && l--;\n }),\n this\n );\n },\n has: function (e) {\n return e ? -1 < S.inArray(e, s) : 0 < s.length;\n },\n empty: function () {\n return s && (s = []), this;\n },\n disable: function () {\n return (a = u = []), (s = t = \"\"), this;\n },\n disabled: function () {\n return !s;\n },\n lock: function () {\n return (a = u = []), t || i || (s = t = \"\"), this;\n },\n locked: function () {\n return !!a;\n },\n fireWith: function (e, t) {\n return (\n a ||\n ((t = [e, (t = t || []).slice ? t.slice() : t]),\n u.push(t),\n i || c()),\n this\n );\n },\n fire: function () {\n return f.fireWith(this, arguments), this;\n },\n fired: function () {\n return !!o;\n },\n };\n return f;\n }),\n S.extend({\n Deferred: function (e) {\n var o = [\n [\n \"notify\",\n \"progress\",\n S.Callbacks(\"memory\"),\n S.Callbacks(\"memory\"),\n 2,\n ],\n [\n \"resolve\",\n \"done\",\n S.Callbacks(\"once memory\"),\n S.Callbacks(\"once memory\"),\n 0,\n \"resolved\",\n ],\n [\n \"reject\",\n \"fail\",\n S.Callbacks(\"once memory\"),\n S.Callbacks(\"once memory\"),\n 1,\n \"rejected\",\n ],\n ],\n i = \"pending\",\n a = {\n state: function () {\n return i;\n },\n always: function () {\n return s.done(arguments).fail(arguments), this;\n },\n catch: function (e) {\n return a.then(null, e);\n },\n pipe: function () {\n var i = arguments;\n return S.Deferred(function (r) {\n S.each(o, function (e, t) {\n var n = m(i[t[4]]) && i[t[4]];\n s[t[1]](function () {\n var e = n && n.apply(this, arguments);\n e && m(e.promise)\n ? e\n .promise()\n .progress(r.notify)\n .done(r.resolve)\n .fail(r.reject)\n : r[t[0] + \"With\"](this, n ? [e] : arguments);\n });\n }),\n (i = null);\n }).promise();\n },\n then: function (t, n, r) {\n var u = 0;\n function l(i, o, a, s) {\n return function () {\n var n = this,\n r = arguments,\n e = function () {\n var e, t;\n if (!(i < u)) {\n if ((e = a.apply(n, r)) === o.promise())\n throw new TypeError(\"Thenable self-resolution\");\n (t =\n e &&\n (\"object\" == typeof e || \"function\" == typeof e) &&\n e.then),\n m(t)\n ? s\n ? t.call(e, l(u, o, R, s), l(u, o, M, s))\n : (u++,\n t.call(\n e,\n l(u, o, R, s),\n l(u, o, M, s),\n l(u, o, R, o.notifyWith)\n ))\n : (a !== R && ((n = void 0), (r = [e])),\n (s || o.resolveWith)(n, r));\n }\n },\n t = s\n ? e\n : function () {\n try {\n e();\n } catch (e) {\n S.Deferred.exceptionHook &&\n S.Deferred.exceptionHook(e, t.stackTrace),\n u <= i + 1 &&\n (a !== M && ((n = void 0), (r = [e])),\n o.rejectWith(n, r));\n }\n };\n i\n ? t()\n : (S.Deferred.getStackHook &&\n (t.stackTrace = S.Deferred.getStackHook()),\n C.setTimeout(t));\n };\n }\n return S.Deferred(function (e) {\n o[0][3].add(l(0, e, m(r) ? r : R, e.notifyWith)),\n o[1][3].add(l(0, e, m(t) ? t : R)),\n o[2][3].add(l(0, e, m(n) ? n : M));\n }).promise();\n },\n promise: function (e) {\n return null != e ? S.extend(e, a) : a;\n },\n },\n s = {};\n return (\n S.each(o, function (e, t) {\n var n = t[2],\n r = t[5];\n (a[t[1]] = n.add),\n r &&\n n.add(\n function () {\n i = r;\n },\n o[3 - e][2].disable,\n o[3 - e][3].disable,\n o[0][2].lock,\n o[0][3].lock\n ),\n n.add(t[3].fire),\n (s[t[0]] = function () {\n return (\n s[t[0] + \"With\"](this === s ? void 0 : this, arguments), this\n );\n }),\n (s[t[0] + \"With\"] = n.fireWith);\n }),\n a.promise(s),\n e && e.call(s, s),\n s\n );\n },\n when: function (e) {\n var n = arguments.length,\n t = n,\n r = Array(t),\n i = s.call(arguments),\n o = S.Deferred(),\n a = function (t) {\n return function (e) {\n (r[t] = this),\n (i[t] = 1 < arguments.length ? s.call(arguments) : e),\n --n || o.resolveWith(r, i);\n };\n };\n if (\n n <= 1 &&\n (I(e, o.done(a(t)).resolve, o.reject, !n),\n \"pending\" === o.state() || m(i[t] && i[t].then))\n )\n return o.then();\n while (t--) I(i[t], a(t), o.reject);\n return o.promise();\n },\n });\n var W = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;\n (S.Deferred.exceptionHook = function (e, t) {\n C.console &&\n C.console.warn &&\n e &&\n W.test(e.name) &&\n C.console.warn(\"jQuery.Deferred exception: \" + e.message, e.stack, t);\n }),\n (S.readyException = function (e) {\n C.setTimeout(function () {\n throw e;\n });\n });\n var F = S.Deferred();\n function B() {\n E.removeEventListener(\"DOMContentLoaded\", B),\n C.removeEventListener(\"load\", B),\n S.ready();\n }\n (S.fn.ready = function (e) {\n return (\n F.then(e)[\"catch\"](function (e) {\n S.readyException(e);\n }),\n this\n );\n }),\n S.extend({\n isReady: !1,\n readyWait: 1,\n ready: function (e) {\n (!0 === e ? --S.readyWait : S.isReady) ||\n ((S.isReady = !0) !== e && 0 < --S.readyWait) ||\n F.resolveWith(E, [S]);\n },\n }),\n (S.ready.then = F.then),\n \"complete\" === E.readyState ||\n (\"loading\" !== E.readyState && !E.documentElement.doScroll)\n ? C.setTimeout(S.ready)\n : (E.addEventListener(\"DOMContentLoaded\", B),\n C.addEventListener(\"load\", B));\n var $ = function (e, t, n, r, i, o, a) {\n var s = 0,\n u = e.length,\n l = null == n;\n if (\"object\" === w(n))\n for (s in ((i = !0), n)) $(e, t, s, n[s], !0, o, a);\n else if (\n void 0 !== r &&\n ((i = !0),\n m(r) || (a = !0),\n l &&\n (a\n ? (t.call(e, r), (t = null))\n : ((l = t),\n (t = function (e, t, n) {\n return l.call(S(e), n);\n }))),\n t)\n )\n for (; s < u; s++) t(e[s], n, a ? r : r.call(e[s], s, t(e[s], n)));\n return i ? e : l ? t.call(e) : u ? t(e[0], n) : o;\n },\n _ = /^-ms-/,\n z = /-([a-z])/g;\n function U(e, t) {\n return t.toUpperCase();\n }\n function X(e) {\n return e.replace(_, \"ms-\").replace(z, U);\n }\n var V = function (e) {\n return 1 === e.nodeType || 9 === e.nodeType || !+e.nodeType;\n };\n function G() {\n this.expando = S.expando + G.uid++;\n }\n (G.uid = 1),\n (G.prototype = {\n cache: function (e) {\n var t = e[this.expando];\n return (\n t ||\n ((t = {}),\n V(e) &&\n (e.nodeType\n ? (e[this.expando] = t)\n : Object.defineProperty(e, this.expando, {\n value: t,\n configurable: !0,\n }))),\n t\n );\n },\n set: function (e, t, n) {\n var r,\n i = this.cache(e);\n if (\"string\" == typeof t) i[X(t)] = n;\n else for (r in t) i[X(r)] = t[r];\n return i;\n },\n get: function (e, t) {\n return void 0 === t\n ? this.cache(e)\n : e[this.expando] && e[this.expando][X(t)];\n },\n access: function (e, t, n) {\n return void 0 === t || (t && \"string\" == typeof t && void 0 === n)\n ? this.get(e, t)\n : (this.set(e, t, n), void 0 !== n ? n : t);\n },\n remove: function (e, t) {\n var n,\n r = e[this.expando];\n if (void 0 !== r) {\n if (void 0 !== t) {\n n = (t = Array.isArray(t)\n ? t.map(X)\n : (t = X(t)) in r\n ? [t]\n : t.match(P) || []).length;\n while (n--) delete r[t[n]];\n }\n (void 0 === t || S.isEmptyObject(r)) &&\n (e.nodeType ? (e[this.expando] = void 0) : delete e[this.expando]);\n }\n },\n hasData: function (e) {\n var t = e[this.expando];\n return void 0 !== t && !S.isEmptyObject(t);\n },\n });\n var Y = new G(),\n Q = new G(),\n J = /^(?:\\{[\\w\\W]*\\}|\\[[\\w\\W]*\\])$/,\n K = /[A-Z]/g;\n function Z(e, t, n) {\n var r, i;\n if (void 0 === n && 1 === e.nodeType)\n if (\n ((r = \"data-\" + t.replace(K, \"-$&\").toLowerCase()),\n \"string\" == typeof (n = e.getAttribute(r)))\n ) {\n try {\n n =\n \"true\" === (i = n) ||\n (\"false\" !== i &&\n (\"null\" === i\n ? null\n : i === +i + \"\"\n ? +i\n : J.test(i)\n ? JSON.parse(i)\n : i));\n } catch (e) {}\n Q.set(e, t, n);\n } else n = void 0;\n return n;\n }\n S.extend({\n hasData: function (e) {\n return Q.hasData(e) || Y.hasData(e);\n },\n data: function (e, t, n) {\n return Q.access(e, t, n);\n },\n removeData: function (e, t) {\n Q.remove(e, t);\n },\n _data: function (e, t, n) {\n return Y.access(e, t, n);\n },\n _removeData: function (e, t) {\n Y.remove(e, t);\n },\n }),\n S.fn.extend({\n data: function (n, e) {\n var t,\n r,\n i,\n o = this[0],\n a = o && o.attributes;\n if (void 0 === n) {\n if (\n this.length &&\n ((i = Q.get(o)), 1 === o.nodeType && !Y.get(o, \"hasDataAttrs\"))\n ) {\n t = a.length;\n while (t--)\n a[t] &&\n 0 === (r = a[t].name).indexOf(\"data-\") &&\n ((r = X(r.slice(5))), Z(o, r, i[r]));\n Y.set(o, \"hasDataAttrs\", !0);\n }\n return i;\n }\n return \"object\" == typeof n\n ? this.each(function () {\n Q.set(this, n);\n })\n : $(\n this,\n function (e) {\n var t;\n if (o && void 0 === e)\n return void 0 !== (t = Q.get(o, n))\n ? t\n : void 0 !== (t = Z(o, n))\n ? t\n : void 0;\n this.each(function () {\n Q.set(this, n, e);\n });\n },\n null,\n e,\n 1 < arguments.length,\n null,\n !0\n );\n },\n removeData: function (e) {\n return this.each(function () {\n Q.remove(this, e);\n });\n },\n }),\n S.extend({\n queue: function (e, t, n) {\n var r;\n if (e)\n return (\n (t = (t || \"fx\") + \"queue\"),\n (r = Y.get(e, t)),\n n &&\n (!r || Array.isArray(n)\n ? (r = Y.access(e, t, S.makeArray(n)))\n : r.push(n)),\n r || []\n );\n },\n dequeue: function (e, t) {\n t = t || \"fx\";\n var n = S.queue(e, t),\n r = n.length,\n i = n.shift(),\n o = S._queueHooks(e, t);\n \"inprogress\" === i && ((i = n.shift()), r--),\n i &&\n (\"fx\" === t && n.unshift(\"inprogress\"),\n delete o.stop,\n i.call(\n e,\n function () {\n S.dequeue(e, t);\n },\n o\n )),\n !r && o && o.empty.fire();\n },\n _queueHooks: function (e, t) {\n var n = t + \"queueHooks\";\n return (\n Y.get(e, n) ||\n Y.access(e, n, {\n empty: S.Callbacks(\"once memory\").add(function () {\n Y.remove(e, [t + \"queue\", n]);\n }),\n })\n );\n },\n }),\n S.fn.extend({\n queue: function (t, n) {\n var e = 2;\n return (\n \"string\" != typeof t && ((n = t), (t = \"fx\"), e--),\n arguments.length < e\n ? S.queue(this[0], t)\n : void 0 === n\n ? this\n : this.each(function () {\n var e = S.queue(this, t, n);\n S._queueHooks(this, t),\n \"fx\" === t && \"inprogress\" !== e[0] && S.dequeue(this, t);\n })\n );\n },\n dequeue: function (e) {\n return this.each(function () {\n S.dequeue(this, e);\n });\n },\n clearQueue: function (e) {\n return this.queue(e || \"fx\", []);\n },\n promise: function (e, t) {\n var n,\n r = 1,\n i = S.Deferred(),\n o = this,\n a = this.length,\n s = function () {\n --r || i.resolveWith(o, [o]);\n };\n \"string\" != typeof e && ((t = e), (e = void 0)), (e = e || \"fx\");\n while (a--)\n (n = Y.get(o[a], e + \"queueHooks\")) &&\n n.empty &&\n (r++, n.empty.add(s));\n return s(), i.promise(t);\n },\n });\n var ee = /[+-]?(?:\\d*\\.|)\\d+(?:[eE][+-]?\\d+|)/.source,\n te = new RegExp(\"^(?:([+-])=|)(\" + ee + \")([a-z%]*)$\", \"i\"),\n ne = [\"Top\", \"Right\", \"Bottom\", \"Left\"],\n re = E.documentElement,\n ie = function (e) {\n return S.contains(e.ownerDocument, e);\n },\n oe = { composed: !0 };\n re.getRootNode &&\n (ie = function (e) {\n return (\n S.contains(e.ownerDocument, e) || e.getRootNode(oe) === e.ownerDocument\n );\n });\n var ae = function (e, t) {\n return (\n \"none\" === (e = t || e).style.display ||\n (\"\" === e.style.display && ie(e) && \"none\" === S.css(e, \"display\"))\n );\n };\n function se(e, t, n, r) {\n var i,\n o,\n a = 20,\n s = r\n ? function () {\n return r.cur();\n }\n : function () {\n return S.css(e, t, \"\");\n },\n u = s(),\n l = (n && n[3]) || (S.cssNumber[t] ? \"\" : \"px\"),\n c =\n e.nodeType &&\n (S.cssNumber[t] || (\"px\" !== l && +u)) &&\n te.exec(S.css(e, t));\n if (c && c[3] !== l) {\n (u /= 2), (l = l || c[3]), (c = +u || 1);\n while (a--)\n S.style(e, t, c + l),\n (1 - o) * (1 - (o = s() / u || 0.5)) <= 0 && (a = 0),\n (c /= o);\n (c *= 2), S.style(e, t, c + l), (n = n || []);\n }\n return (\n n &&\n ((c = +c || +u || 0),\n (i = n[1] ? c + (n[1] + 1) * n[2] : +n[2]),\n r && ((r.unit = l), (r.start = c), (r.end = i))),\n i\n );\n }\n var ue = {};\n function le(e, t) {\n for (var n, r, i, o, a, s, u, l = [], c = 0, f = e.length; c < f; c++)\n (r = e[c]).style &&\n ((n = r.style.display),\n t\n ? (\"none\" === n &&\n ((l[c] = Y.get(r, \"display\") || null),\n l[c] || (r.style.display = \"\")),\n \"\" === r.style.display &&\n ae(r) &&\n (l[c] =\n ((u = a = o = void 0),\n (a = (i = r).ownerDocument),\n (s = i.nodeName),\n (u = ue[s]) ||\n ((o = a.body.appendChild(a.createElement(s))),\n (u = S.css(o, \"display\")),\n o.parentNode.removeChild(o),\n \"none\" === u && (u = \"block\"),\n (ue[s] = u)))))\n : \"none\" !== n && ((l[c] = \"none\"), Y.set(r, \"display\", n)));\n for (c = 0; c < f; c++) null != l[c] && (e[c].style.display = l[c]);\n return e;\n }\n S.fn.extend({\n show: function () {\n return le(this, !0);\n },\n hide: function () {\n return le(this);\n },\n toggle: function (e) {\n return \"boolean\" == typeof e\n ? e\n ? this.show()\n : this.hide()\n : this.each(function () {\n ae(this) ? S(this).show() : S(this).hide();\n });\n },\n });\n var ce,\n fe,\n pe = /^(?:checkbox|radio)$/i,\n de = /<([a-z][^\\/\\0>\\x20\\t\\r\\n\\f]*)/i,\n he = /^$|^module$|\\/(?:java|ecma)script/i;\n (ce = E.createDocumentFragment().appendChild(E.createElement(\"div\"))),\n (fe = E.createElement(\"input\")).setAttribute(\"type\", \"radio\"),\n fe.setAttribute(\"checked\", \"checked\"),\n fe.setAttribute(\"name\", \"t\"),\n ce.appendChild(fe),\n (y.checkClone = ce.cloneNode(!0).cloneNode(!0).lastChild.checked),\n (ce.innerHTML = \"\"),\n (y.noCloneChecked = !!ce.cloneNode(!0).lastChild.defaultValue),\n (ce.innerHTML = \"\"),\n (y.option = !!ce.lastChild);\n var ge = {\n thead: [1, \"