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