(?:<\/\1>|)$/i; function D(e, n, r) { return m(n) ? S.grep(e, function (e, t) { return !!n.call(e, t, e) !== r; }) : n.nodeType ? S.grep(e, function (e) { return (e === n) !== r; }) : "string" != typeof n ? S.grep(e, function (e) { return -1 < i.call(n, e) !== r; }) : S.filter(n, e, r); } (S.filter = function (e, t, n) { var r = t[0]; return ( n && (e = ":not(" + e + ")"), 1 === t.length && 1 === r.nodeType ? S.find.matchesSelector(r, e) ? [r] : [] : S.find.matches( e, S.grep(t, function (e) { return 1 === e.nodeType; }) ) ); }), S.fn.extend({ find: function (e) { var t, n, r = this.length, i = this; if ("string" != typeof e) return this.pushStack( S(e).filter(function () { for (t = 0; t < r; t++) if (S.contains(i[t], this)) return !0; }) ); for (n = this.pushStack([]), t = 0; t < r; t++) S.find(e, i[t], n); return 1 < r ? S.uniqueSort(n) : n; }, filter: function (e) { return this.pushStack(D(this, e || [], !1)); }, not: function (e) { return this.pushStack(D(this, e || [], !0)); }, is: function (e) { return !!D( this, "string" == typeof e && k.test(e) ? S(e) : e || [], !1 ).length; }, }); var j, q = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/; ((S.fn.init = function (e, t, n) { var r, i; if (!e) return this; if (((n = n || j), "string" == typeof e)) { if ( !(r = "<" === e[0] && ">" === e[e.length - 1] && 3 <= e.length ? [null, e, null] : q.exec(e)) || (!r[1] && t) ) return !t || t.jquery ? (t || n).find(e) : this.constructor(t).find(e); if (r[1]) { if ( ((t = t instanceof S ? t[0] : t), S.merge( this, S.parseHTML( r[1], t && t.nodeType ? t.ownerDocument || t : E, !0 ) ), N.test(r[1]) && S.isPlainObject(t)) ) for (r in t) m(this[r]) ? this[r](t[r]) : this.attr(r, t[r]); return this; } return ( (i = E.getElementById(r[2])) && ((this[0] = i), (this.length = 1)), this ); } return e.nodeType ? ((this[0] = e), (this.length = 1), this) : m(e) ? void 0 !== n.ready ? n.ready(e) : e(S) : S.makeArray(e, this); }).prototype = S.fn), (j = S(E)); var L = /^(?:parents|prev(?:Until|All))/, H = { children: !0, contents: !0, next: !0, prev: !0 }; function O(e, t) { while ((e = e[t]) && 1 !== e.nodeType); return e; } S.fn.extend({ has: function (e) { var t = S(e, this), n = t.length; return this.filter(function () { for (var e = 0; e < n; e++) if (S.contains(this, t[e])) return !0; }); }, closest: function (e, t) { var n, r = 0, i = this.length, o = [], a = "string" != typeof e && S(e); if (!k.test(e)) for (; r < i; r++) for (n = this[r]; n && n !== t; n = n.parentNode) if ( n.nodeType < 11 && (a ? -1 < a.index(n) : 1 === n.nodeType && S.find.matchesSelector(n, e)) ) { o.push(n); break; } return this.pushStack(1 < o.length ? S.uniqueSort(o) : o); }, index: function (e) { return e ? "string" == typeof e ? i.call(S(e), this[0]) : i.call(this, e.jquery ? e[0] : e) : this[0] && this[0].parentNode ? this.first().prevAll().length : -1; }, add: function (e, t) { return this.pushStack(S.uniqueSort(S.merge(this.get(), S(e, t)))); }, addBack: function (e) { return this.add( null == e ? this.prevObject : this.prevObject.filter(e) ); }, }), S.each( { parent: function (e) { var t = e.parentNode; return t && 11 !== t.nodeType ? t : null; }, parents: function (e) { return h(e, "parentNode"); }, parentsUntil: function (e, t, n) { return h(e, "parentNode", n); }, next: function (e) { return O(e, "nextSibling"); }, prev: function (e) { return O(e, "previousSibling"); }, nextAll: function (e) { return h(e, "nextSibling"); }, prevAll: function (e) { return h(e, "previousSibling"); }, nextUntil: function (e, t, n) { return h(e, "nextSibling", n); }, prevUntil: function (e, t, n) { return h(e, "previousSibling", n); }, siblings: function (e) { return T((e.parentNode || {}).firstChild, e); }, children: function (e) { return T(e.firstChild); }, contents: function (e) { return null != e.contentDocument && r(e.contentDocument) ? e.contentDocument : (A(e, "template") && (e = e.content || e), S.merge([], e.childNodes)); }, }, function (r, i) { S.fn[r] = function (e, t) { var n = S.map(this, i, e); return ( "Until" !== r.slice(-5) && (t = e), t && "string" == typeof t && (n = S.filter(t, n)), 1 < this.length && (H[r] || S.uniqueSort(n), L.test(r) && n.reverse()), this.pushStack(n) ); }; } ); var P = /[^\x20\t\r\n\f]+/g; function R(e) { return e; } function M(e) { throw e; } function I(e, t, n, r) { var i; try { e && m((i = e.promise)) ? i.call(e).done(t).fail(n) : e && m((i = e.then)) ? i.call(e, t, n) : t.apply(void 0, [e].slice(r)); } catch (e) { n.apply(void 0, [e]); } } (S.Callbacks = function (r) { var e, n; r = "string" == typeof r ? ((e = r), (n = {}), S.each(e.match(P) || [], function (e, t) { n[t] = !0; }), n) : S.extend({}, r); var i, t, o, a, s = [], u = [], l = -1, c = function () { for (a = a || r.once, o = i = !0; u.length; l = -1) { t = u.shift(); while (++l < s.length) !1 === s[l].apply(t[0], t[1]) && r.stopOnFalse && ((l = s.length), (t = !1)); } r.memory || (t = !1), (i = !1), a && (s = t ? [] : ""); }, f = { add: function () { return ( s && (t && !i && ((l = s.length - 1), u.push(t)), (function n(e) { S.each(e, function (e, t) { m(t) ? (r.unique && f.has(t)) || s.push(t) : t && t.length && "string" !== w(t) && n(t); }); })(arguments), t && !i && c()), this ); }, remove: function () { return ( S.each(arguments, function (e, t) { var n; while (-1 < (n = S.inArray(t, s, n))) s.splice(n, 1), n <= l && l--; }), this ); }, has: function (e) { return e ? -1 < S.inArray(e, s) : 0 < s.length; }, empty: function () { return s && (s = []), this; }, disable: function () { return (a = u = []), (s = t = ""), this; }, disabled: function () { return !s; }, lock: function () { return (a = u = []), t || i || (s = t = ""), this; }, locked: function () { return !!a; }, fireWith: function (e, t) { return ( a || ((t = [e, (t = t || []).slice ? t.slice() : t]), u.push(t), i || c()), this ); }, fire: function () { return f.fireWith(this, arguments), this; }, fired: function () { return !!o; }, }; return f; }), S.extend({ Deferred: function (e) { var o = [ [ "notify", "progress", S.Callbacks("memory"), S.Callbacks("memory"), 2, ], [ "resolve", "done", S.Callbacks("once memory"), S.Callbacks("once memory"), 0, "resolved", ], [ "reject", "fail", S.Callbacks("once memory"), S.Callbacks("once memory"), 1, "rejected", ], ], i = "pending", a = { state: function () { return i; }, always: function () { return s.done(arguments).fail(arguments), this; }, catch: function (e) { return a.then(null, e); }, pipe: function () { var i = arguments; return S.Deferred(function (r) { S.each(o, function (e, t) { var n = m(i[t[4]]) && i[t[4]]; s[t[1]](function () { var e = n && n.apply(this, arguments); e && m(e.promise) ? e .promise() .progress(r.notify) .done(r.resolve) .fail(r.reject) : r[t[0] + "With"](this, n ? [e] : arguments); }); }), (i = null); }).promise(); }, then: function (t, n, r) { var u = 0; function l(i, o, a, s) { return function () { var n = this, r = arguments, e = function () { var e, t; if (!(i < u)) { if ((e = a.apply(n, r)) === o.promise()) throw new TypeError( "Thenable self-resolution" ); (t = e && ("object" == typeof e || "function" == typeof e) && e.then), m(t) ? s ? t.call(e, l(u, o, R, s), l(u, o, M, s)) : (u++, t.call( e, l(u, o, R, s), l(u, o, M, s), l(u, o, R, o.notifyWith) )) : (a !== R && ((n = void 0), (r = [e])), (s || o.resolveWith)(n, r)); } }, t = s ? e : function () { try { e(); } catch (e) { S.Deferred.exceptionHook && S.Deferred.exceptionHook(e, t.stackTrace), u <= i + 1 && (a !== M && ((n = void 0), (r = [e])), o.rejectWith(n, r)); } }; i ? t() : (S.Deferred.getStackHook && (t.stackTrace = S.Deferred.getStackHook()), C.setTimeout(t)); }; } return S.Deferred(function (e) { o[0][3].add(l(0, e, m(r) ? r : R, e.notifyWith)), o[1][3].add(l(0, e, m(t) ? t : R)), o[2][3].add(l(0, e, m(n) ? n : M)); }).promise(); }, promise: function (e) { return null != e ? S.extend(e, a) : a; }, }, s = {}; return ( S.each(o, function (e, t) { var n = t[2], r = t[5]; (a[t[1]] = n.add), r && n.add( function () { i = r; }, o[3 - e][2].disable, o[3 - e][3].disable, o[0][2].lock, o[0][3].lock ), n.add(t[3].fire), (s[t[0]] = function () { return ( s[t[0] + "With"]( this === s ? void 0 : this, arguments ), this ); }), (s[t[0] + "With"] = n.fireWith); }), a.promise(s), e && e.call(s, s), s ); }, when: function (e) { var n = arguments.length, t = n, r = Array(t), i = s.call(arguments), o = S.Deferred(), a = function (t) { return function (e) { (r[t] = this), (i[t] = 1 < arguments.length ? s.call(arguments) : e), --n || o.resolveWith(r, i); }; }; if ( n <= 1 && (I(e, o.done(a(t)).resolve, o.reject, !n), "pending" === o.state() || m(i[t] && i[t].then)) ) return o.then(); while (t--) I(i[t], a(t), o.reject); return o.promise(); }, }); var W = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; (S.Deferred.exceptionHook = function (e, t) { C.console && C.console.warn && e && W.test(e.name) && C.console.warn( "jQuery.Deferred exception: " + e.message, e.stack, t ); }), (S.readyException = function (e) { C.setTimeout(function () { throw e; }); }); var F = S.Deferred(); function B() { E.removeEventListener("DOMContentLoaded", B), C.removeEventListener("load", B), S.ready(); } (S.fn.ready = function (e) { return ( F.then(e)["catch"](function (e) { S.readyException(e); }), this ); }), S.extend({ isReady: !1, readyWait: 1, ready: function (e) { (!0 === e ? --S.readyWait : S.isReady) || ((S.isReady = !0) !== e && 0 < --S.readyWait) || F.resolveWith(E, [S]); }, }), (S.ready.then = F.then), "complete" === E.readyState || ("loading" !== E.readyState && !E.documentElement.doScroll) ? C.setTimeout(S.ready) : (E.addEventListener("DOMContentLoaded", B), C.addEventListener("load", B)); var $ = function (e, t, n, r, i, o, a) { var s = 0, u = e.length, l = null == n; if ("object" === w(n)) for (s in ((i = !0), n)) $(e, t, s, n[s], !0, o, a); else if ( void 0 !== r && ((i = !0), m(r) || (a = !0), l && (a ? (t.call(e, r), (t = null)) : ((l = t), (t = function (e, t, n) { return l.call(S(e), n); }))), t) ) for (; s < u; s++) t(e[s], n, a ? r : r.call(e[s], s, t(e[s], n))); return i ? e : l ? t.call(e) : u ? t(e[0], n) : o; }, _ = /^-ms-/, z = /-([a-z])/g; function U(e, t) { return t.toUpperCase(); } function X(e) { return e.replace(_, "ms-").replace(z, U); } var V = function (e) { return 1 === e.nodeType || 9 === e.nodeType || !+e.nodeType; }; function G() { this.expando = S.expando + G.uid++; } (G.uid = 1), (G.prototype = { cache: function (e) { var t = e[this.expando]; return ( t || ((t = {}), V(e) && (e.nodeType ? (e[this.expando] = t) : Object.defineProperty(e, this.expando, { value: t, configurable: !0, }))), t ); }, set: function (e, t, n) { var r, i = this.cache(e); if ("string" == typeof t) i[X(t)] = n; else for (r in t) i[X(r)] = t[r]; return i; }, get: function (e, t) { return void 0 === t ? this.cache(e) : e[this.expando] && e[this.expando][X(t)]; }, access: function (e, t, n) { return void 0 === t || (t && "string" == typeof t && void 0 === n) ? this.get(e, t) : (this.set(e, t, n), void 0 !== n ? n : t); }, remove: function (e, t) { var n, r = e[this.expando]; if (void 0 !== r) { if (void 0 !== t) { n = (t = Array.isArray(t) ? t.map(X) : (t = X(t)) in r ? [t] : t.match(P) || []).length; while (n--) delete r[t[n]]; } (void 0 === t || S.isEmptyObject(r)) && (e.nodeType ? (e[this.expando] = void 0) : delete e[this.expando]); } }, hasData: function (e) { var t = e[this.expando]; return void 0 !== t && !S.isEmptyObject(t); }, }); var Y = new G(), Q = new G(), J = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, K = /[A-Z]/g; function Z(e, t, n) { var r, i; if (void 0 === n && 1 === e.nodeType) if ( ((r = "data-" + t.replace(K, "-$&").toLowerCase()), "string" == typeof (n = e.getAttribute(r))) ) { try { n = "true" === (i = n) || ("false" !== i && ("null" === i ? null : i === +i + "" ? +i : J.test(i) ? JSON.parse(i) : i)); } catch (e) {} Q.set(e, t, n); } else n = void 0; return n; } S.extend({ hasData: function (e) { return Q.hasData(e) || Y.hasData(e); }, data: function (e, t, n) { return Q.access(e, t, n); }, removeData: function (e, t) { Q.remove(e, t); }, _data: function (e, t, n) { return Y.access(e, t, n); }, _removeData: function (e, t) { Y.remove(e, t); }, }), S.fn.extend({ data: function (n, e) { var t, r, i, o = this[0], a = o && o.attributes; if (void 0 === n) { if ( this.length && ((i = Q.get(o)), 1 === o.nodeType && !Y.get(o, "hasDataAttrs")) ) { t = a.length; while (t--) a[t] && 0 === (r = a[t].name).indexOf("data-") && ((r = X(r.slice(5))), Z(o, r, i[r])); Y.set(o, "hasDataAttrs", !0); } return i; } return "object" == typeof n ? this.each(function () { Q.set(this, n); }) : $( this, function (e) { var t; if (o && void 0 === e) return void 0 !== (t = Q.get(o, n)) ? t : void 0 !== (t = Z(o, n)) ? t : void 0; this.each(function () { Q.set(this, n, e); }); }, null, e, 1 < arguments.length, null, !0 ); }, removeData: function (e) { return this.each(function () { Q.remove(this, e); }); }, }), S.extend({ queue: function (e, t, n) { var r; if (e) return ( (t = (t || "fx") + "queue"), (r = Y.get(e, t)), n && (!r || Array.isArray(n) ? (r = Y.access(e, t, S.makeArray(n))) : r.push(n)), r || [] ); }, dequeue: function (e, t) { t = t || "fx"; var n = S.queue(e, t), r = n.length, i = n.shift(), o = S._queueHooks(e, t); "inprogress" === i && ((i = n.shift()), r--), i && ("fx" === t && n.unshift("inprogress"), delete o.stop, i.call( e, function () { S.dequeue(e, t); }, o )), !r && o && o.empty.fire(); }, _queueHooks: function (e, t) { var n = t + "queueHooks"; return ( Y.get(e, n) || Y.access(e, n, { empty: S.Callbacks("once memory").add(function () { Y.remove(e, [t + "queue", n]); }), }) ); }, }), S.fn.extend({ queue: function (t, n) { var e = 2; return ( "string" != typeof t && ((n = t), (t = "fx"), e--), arguments.length < e ? S.queue(this[0], t) : void 0 === n ? this : this.each(function () { var e = S.queue(this, t, n); S._queueHooks(this, t), "fx" === t && "inprogress" !== e[0] && S.dequeue(this, t); }) ); }, dequeue: function (e) { return this.each(function () { S.dequeue(this, e); }); }, clearQueue: function (e) { return this.queue(e || "fx", []); }, promise: function (e, t) { var n, r = 1, i = S.Deferred(), o = this, a = this.length, s = function () { --r || i.resolveWith(o, [o]); }; "string" != typeof e && ((t = e), (e = void 0)), (e = e || "fx"); while (a--) (n = Y.get(o[a], e + "queueHooks")) && n.empty && (r++, n.empty.add(s)); return s(), i.promise(t); }, }); var ee = /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source, te = new RegExp("^(?:([+-])=|)(" + ee + ")([a-z%]*)$", "i"), ne = ["Top", "Right", "Bottom", "Left"], re = E.documentElement, ie = function (e) { return S.contains(e.ownerDocument, e); }, oe = { composed: !0 }; re.getRootNode && (ie = function (e) { return ( S.contains(e.ownerDocument, e) || e.getRootNode(oe) === e.ownerDocument ); }); var ae = function (e, t) { return ( "none" === (e = t || e).style.display || ("" === e.style.display && ie(e) && "none" === S.css(e, "display")) ); }; function se(e, t, n, r) { var i, o, a = 20, s = r ? function () { return r.cur(); } : function () { return S.css(e, t, ""); }, u = s(), l = (n && n[3]) || (S.cssNumber[t] ? "" : "px"), c = e.nodeType && (S.cssNumber[t] || ("px" !== l && +u)) && te.exec(S.css(e, t)); if (c && c[3] !== l) { (u /= 2), (l = l || c[3]), (c = +u || 1); while (a--) S.style(e, t, c + l), (1 - o) * (1 - (o = s() / u || 0.5)) <= 0 && (a = 0), (c /= o); (c *= 2), S.style(e, t, c + l), (n = n || []); } return ( n && ((c = +c || +u || 0), (i = n[1] ? c + (n[1] + 1) * n[2] : +n[2]), r && ((r.unit = l), (r.start = c), (r.end = i))), i ); } var ue = {}; function le(e, t) { for ( var n, r, i, o, a, s, u, l = [], c = 0, f = e.length; c < f; c++ ) (r = e[c]).style && ((n = r.style.display), t ? ("none" === n && ((l[c] = Y.get(r, "display") || null), l[c] || (r.style.display = "")), "" === r.style.display && ae(r) && (l[c] = ((u = a = o = void 0), (a = (i = r).ownerDocument), (s = i.nodeName), (u = ue[s]) || ((o = a.body.appendChild(a.createElement(s))), (u = S.css(o, "display")), o.parentNode.removeChild(o), "none" === u && (u = "block"), (ue[s] = u))))) : "none" !== n && ((l[c] = "none"), Y.set(r, "display", n))); for (c = 0; c < f; c++) null != l[c] && (e[c].style.display = l[c]); return e; } S.fn.extend({ show: function () { return le(this, !0); }, hide: function () { return le(this); }, toggle: function (e) { return "boolean" == typeof e ? e ? this.show() : this.hide() : this.each(function () { ae(this) ? S(this).show() : S(this).hide(); }); }, }); var ce, fe, pe = /^(?:checkbox|radio)$/i, de = /<([a-z][^\/\0>\x20\t\r\n\f]*)/i, he = /^$|^module$|\/(?:java|ecma)script/i; (ce = E.createDocumentFragment().appendChild(E.createElement("div"))), (fe = E.createElement("input")).setAttribute("type", "radio"), fe.setAttribute("checked", "checked"), fe.setAttribute("name", "t"), ce.appendChild(fe), (y.checkClone = ce.cloneNode(!0).cloneNode(!0).lastChild.checked), (ce.innerHTML = ""), (y.noCloneChecked = !!ce.cloneNode(!0).lastChild.defaultValue), (ce.innerHTML = ""), (y.option = !!ce.lastChild); var ge = { thead: [1, "