jobsys-explore 4.6.21 → 4.7.0

package/dist/cipher-f2ed5ee6.js.map

@@ -1 +1 @@
-{"version":3,"file":"cipher-f2ed5ee6.js","sources":["../hooks/network.js","../hooks/utils.js","../hooks/form.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/utils.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/modular.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/curve.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/weierstrass.js","../../../node_modules/.pnpm/sm-crypto-v2@1.7.0/node_modules/sm-crypto-v2/dist/index.mjs","../hooks/cipher.js"],"sourcesContent":["import axios from \"axios\"\nimport { allowMultipleToast, closeToast, showLoadingToast } from \"vant\"\nimport { isObject, isString } from \"lodash-es\"\n\n/**\n * 请求返回状态码\n * @type {{STATE_CODE_NOT_FOUND: string, STATE_CODE_SUCCESS: string, STATE_CODE_FAIL: string, STATE_CODE_INFO_NOT_COMPLETE: string, STATE_CODE_NOT_ALLOWED: string}}\n */\nexport const STATUS = {\n\tSTATE_CODE_SUCCESS: \"SUCCESS\", // 成功\n\tSTATE_CODE_FAIL: \"FAIL\", // 失败\n\tSTATE_CODE_NOT_FOUND: \"NOT_FOUND\", // 找不到资源\n\tSTATE_CODE_INFO_NOT_COMPLETE: \"INCOMPLETE\", // 信息不完整\n\tSTATE_CODE_NOT_ALLOWED: \"NOT_ALLOWED\", //没有权限\n}\n\n/**\n * STATUS 适配器，内部使用\n * @param status\n * @private\n */\nexport function _configStatus(status) {\n\tObject.keys(status).forEach((key) => {\n\t\tSTATUS[key] = status[key]\n\t})\n}\n\n/**\n * 通用 AJAX 请求\n * @param {Object} [fetcher] - 用于存储请求状态的对象\n * @returns {{post(*=, *=, *=): Promise<unknown>, get(*=, *=): Promise<unknown>}}\n */\nexport function useFetch(fetcher) {\n\t// 记录当前 Fetcher 是否处于 Loading 状态\n\tlet globalLoading = null\n\n\tif (!fetcher) {\n\t\tfetcher = {}\n\t}\n\tfetcher.loading = true\n\n\treturn {\n\t\t/**\n\t\t * get请求\n\t\t * @param url\n\t\t * @param {Object} [config] - axios config\n\t\t * @returns {Promise<unknown>}\n\t\t */\n\t\tget(url, config) {\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\taxios\n\t\t\t\t\t.get(url, config)\n\t\t\t\t\t.then((res) => {\n\t\t\t\t\t\tresolve(res)\n\t\t\t\t\t})\n\t\t\t\t\t.catch((err) => {\n\t\t\t\t\t\treject(err)\n\t\t\t\t\t})\n\t\t\t\t\t.finally(() => {\n\t\t\t\t\t\tif (globalLoading) {\n\t\t\t\t\t\t\tallowMultipleToast(false)\n\t\t\t\t\t\t\tglobalLoading.close()\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfetcher.loading = false\n\t\t\t\t\t})\n\t\t\t})\n\t\t},\n\t\t/**\n\t\t * post请求\n\t\t * @param {string} url\n\t\t * @param {Object} data\n\t\t * @param {Object} [config] - axios config\n\t\t * @returns {Promise<unknown>}\n\t\t */\n\t\tpost(url, data, config) {\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\taxios\n\t\t\t\t\t.post(url, data, config)\n\t\t\t\t\t.then((res) => {\n\t\t\t\t\t\tresolve(res)\n\t\t\t\t\t})\n\t\t\t\t\t.catch((err) => {\n\t\t\t\t\t\treject(err)\n\t\t\t\t\t})\n\t\t\t\t\t.finally(() => {\n\t\t\t\t\t\tif (globalLoading) {\n\t\t\t\t\t\t\tallowMultipleToast(false)\n\t\t\t\t\t\t\tglobalLoading.close()\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfetcher.loading = false\n\t\t\t\t\t})\n\t\t\t})\n\t\t},\n\n\t\t/**\n\t\t * 参数为\n\t\t * @param {String|Object} [message] Toast 的 Message 或者是 Toast 的配置\n\t\t * @return {*}\n\t\t */\n\t\tloading(message) {\n\t\t\tcloseToast(true)\n\t\t\tallowMultipleToast()\n\t\t\tif (isString(message)) {\n\t\t\t\tglobalLoading = showLoadingToast({\n\t\t\t\t\tmessage: message || \"加载中...\",\n\t\t\t\t\tduration: 0,\n\t\t\t\t\tforbidClick: true,\n\t\t\t\t})\n\t\t\t} else if (isObject(message)) {\n\t\t\t\tglobalLoading = showLoadingToast({ duration: 0, ...message })\n\t\t\t} else {\n\t\t\t\tglobalLoading = showLoadingToast({\n\t\t\t\t\tmessage: \"加载中...\",\n\t\t\t\t\tduration: 0,\n\t\t\t\t\tforbidClick: true,\n\t\t\t\t})\n\t\t\t}\n\n\t\t\treturn this\n\t\t},\n\t}\n}\n","import { find, flatMapDeep, isNull, isUndefined, reduce } from \"lodash-es\"\r\n\r\n/**\r\n * 从 options 中根据 value 获取 text\r\n * @param value\r\n * @param options\r\n * * @param {Object} [adapter={value: \"value\",label: \"label\",children: \"children\"}] - 选项适配器\r\n * @param adapter\r\n * @return {*|string|string}\r\n */\r\nexport function useTextFromOptionsValue(value, options, adapter) {\r\n\tif (!options) {\r\n\t\treturn \"\"\r\n\t}\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t}\r\n\tconst option = options.find((option) => option[adapter.value] === value)\r\n\treturn option ? option[adapter.label] : \"\"\r\n}\r\n\r\n/**\r\n * 从嵌套的 options 中根据 value 获取 text, 如 [1, 3] => [\"东\", \"南\"]\r\n *\r\n * @param {Array} options - 嵌套的选项\r\n * @param {Array} values - 需要查找的值\r\n * @param {Object} [adapter={value: \"value\",label: \"label\",children: \"children\"}] - 选项适配器\r\n * @return Array\r\n */\r\nexport function useFindTextsInValues(options, values, adapter) {\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t\tchildren: \"children\",\r\n\t}\r\n\r\n\tconst labels = []\r\n\r\n\tfunction recursiveSearch(node) {\r\n\t\tif (values.includes(node[adapter.value])) {\r\n\t\t\tlabels.push(node[adapter.label])\r\n\t\t}\r\n\r\n\t\tif (node[adapter.children]?.length) {\r\n\t\t\tnode[adapter.children].forEach((child) => {\r\n\t\t\t\trecursiveSearch(child)\r\n\t\t\t})\r\n\t\t}\r\n\t}\r\n\r\n\toptions.forEach((item) => {\r\n\t\trecursiveSearch(item)\r\n\t})\r\n\r\n\treturn labels\r\n}\r\n\r\n/**\r\n * 从嵌套的 options 中根据 value 获取 label, 如地区路径:  [440000, 440100, 440113] => ['广东省', '广州市', '番禺区']\r\n * @param {Array} options\r\n * @param {Array} path\r\n * @param {Object} [adapter]\r\n * @return Array\r\n */\r\nexport function useFindLabelsFromPath(options, path, adapter) {\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t\tchildren: \"children\",\r\n\t}\r\n\r\n\tlet labels = []\r\n\treduce(\r\n\t\tpath,\r\n\t\t(acc, value) => {\r\n\t\t\tconst item = find(acc, { [adapter.value]: value })\r\n\t\t\tif (item) {\r\n\t\t\t\tlabels.push(item[adapter.label])\r\n\t\t\t\treturn item[adapter.children]\r\n\t\t\t}\r\n\t\t},\r\n\t\toptions,\r\n\t)\r\n\treturn labels\r\n}\r\n\r\n/**\r\n * 从 options 为 [{text: \"\", value: \"\", children: []] 样式的多层数组中，根据所给的 value 递归找出该 option\r\n * @param {Array} options\r\n * @param {Number|String} value\r\n * @param {Object} [adapter]\r\n * @return {Object|null}\r\n */\r\nexport function useFindOptionByValue(options, value, adapter) {\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t\tchildren: \"children\",\r\n\t}\r\n\r\n\t// 遍历 options 数组\r\n\tfor (let option of options) {\r\n\t\t// 如果当前 option 的 value 匹配目标值，则返回当前 option\r\n\t\tif (option[adapter.value] === value) {\r\n\t\t\treturn option\r\n\t\t}\r\n\t\t// 如果当前 option 有子选项\r\n\t\tif (option[adapter.children] && option[adapter.children].length) {\r\n\t\t\t// 递归搜索子选项数组\r\n\t\t\tconst foundOption = useFindOptionByValue(option[adapter.children], value, adapter)\r\n\t\t\t// 如果找到了匹配的子选项，则返回\r\n\t\t\tif (foundOption) {\r\n\t\t\t\treturn foundOption\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t// 如果未找到匹配的选项，则返回 null\r\n\treturn null\r\n}\r\n\r\n/**\r\n * [移动端适配]\r\n * 从嵌套的 options 中根据 value 获取 text\r\n * @param {Array} options\r\n * @param {Array} path\r\n * @param {Object} [adapter]\r\n * @return Array\r\n */\r\nexport function useFindTextsFromPath(options, path, adapter) {\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t\tchildren: \"children\",\r\n\t}\r\n\treturn useFindLabelsFromPath(options, path, adapter)\r\n}\r\n\r\n/**\r\n * let obj = {\r\n *     \"name\": \"西学楼1号\",\r\n *     \"parent\": {\r\n *         \"name\": \"学生宿舍\",\r\n *         \"parent\": {\r\n *             \"name\": \"宿舍区域\",\r\n *         }\r\n *     }\r\n * }\r\n * useFindPropertyRecursive(obj, 'name', 'parent') // [\"西学楼1号\", \"学生宿舍\", \"宿舍区域\"]\r\n *\r\n * 从嵌套的对象中递归获取某个属性\r\n * @param {Object} item 获取对象\r\n * @param {String} propertyKey 想获取的属性名称\r\n * @param {String} nestedKey 嵌套的属性\r\n * @return Array\r\n */\r\nexport function useFindPropertyRecursive(item, propertyKey, nestedKey) {\r\n\treturn flatMapDeep(item, (value, key) => {\r\n\t\tif (key === propertyKey) {\r\n\t\t\treturn value\r\n\t\t}\r\n\t\tif (key === nestedKey) {\r\n\t\t\treturn useFindPropertyRecursive(value, propertyKey, nestedKey)\r\n\t\t}\r\n\t\treturn []\r\n\t})\r\n}\r\n\r\n/**\r\n * 从嵌套的 options 中根据 value 获取 text 路径, 如地区路径: 440113 => [\"广东省\", \"广州市\", \" 番禺区\"]\r\n * @param options\r\n * @param value\r\n * @param adapter\r\n * @return {*}\r\n */\r\nexport function useFindParentLabels(options, value, adapter) {\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t\tchildren: \"children\",\r\n\t}\r\n\r\n\tconst labels = []\r\n\r\n\tfunction findParentLabels(options, value, labels) {\r\n\t\tfor (const option of options) {\r\n\t\t\tif (option[adapter.value] === value) {\r\n\t\t\t\tlabels.unshift(option[adapter.label])\r\n\t\t\t\tbreak\r\n\t\t\t} else if (option[adapter.children]) {\r\n\t\t\t\tconst childResult = findParentLabels(option[adapter.children], value, labels)\r\n\t\t\t\tif (childResult.length > 0) {\r\n\t\t\t\t\tlabels.unshift(option[adapter.label])\r\n\t\t\t\t\tbreak\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn labels\r\n\t}\r\n\r\n\treturn findParentLabels(options, value, labels)\r\n}\r\n\r\n/**\r\n * 从嵌套的 options 中根据 value 获取整个 values 路径, 如地区路径: 440113 => [440000, 440100, 440113]\r\n * @param options\r\n * @param value\r\n * @param adapter\r\n * @return Array\r\n */\r\nexport function useFindParentValues(options, value, adapter) {\r\n\tadapter = adapter || {\r\n\t\tvalue: \"value\",\r\n\t\tlabel: \"text\",\r\n\t\tchildren: \"children\",\r\n\t}\r\n\r\n\tconst values = []\r\n\r\n\tfunction findParentValues(options, value, values) {\r\n\t\tfor (const option of options) {\r\n\t\t\tif (option[adapter.value] === value) {\r\n\t\t\t\tvalues.unshift(option[adapter.value])\r\n\t\t\t\tbreak\r\n\t\t\t} else if (option[adapter.children]) {\r\n\t\t\t\tconst childResult = findParentValues(option[adapter.children], value, values)\r\n\t\t\t\tif (childResult.length > 0) {\r\n\t\t\t\t\tvalues.unshift(option[adapter.value])\r\n\t\t\t\t\tbreak\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn values\r\n\t}\r\n\r\n\treturn findParentValues(options, value, values)\r\n}\r\n\r\nconst localCacheSession = {}\r\nconst localSession = {\r\n\tsetItem(key, value) {\r\n\t\tlocalCacheSession[key] = value\r\n\t},\r\n\tgetItem(key) {\r\n\t\treturn localCacheSession[key]\r\n\t},\r\n\tremoveItem(key) {\r\n\t\tdelete localCacheSession[key]\r\n\t},\r\n}\r\n\r\nwindow._printCache = () => {\r\n\tconsole.log(JSON.parse(JSON.stringify(localCacheSession, null, 2)))\r\n}\r\n\r\n/**\r\n * 用于储存缓存的值\r\n * @param {*} key 缓存的 key\r\n * @param {*} [sessionType] 缓存的类型，默认为内存缓存\r\n * @returns get(默认值) 获取缓存的值，set(键, 值) 设置缓存的值\r\n */\r\nexport function useCache(key, sessionType) {\r\n\tconst cacheSession = sessionType || localSession\r\n\tconst shouldTransform = !!sessionType // 如果是 localStorage 之类的，则需要转换一下\r\n\treturn {\r\n\t\tget(defaultValue) {\r\n\t\t\tconst value = cacheSession.getItem(key)\r\n\t\t\tif (isNull(value) || isUndefined(value)) {\r\n\t\t\t\treturn defaultValue\r\n\t\t\t}\r\n\t\t\treturn shouldTransform ? JSON.parse(value) : value\r\n\t\t},\r\n\t\tset(value) {\r\n\t\t\tcacheSession.setItem(key, shouldTransform ? JSON.stringify(value) : value)\r\n\t\t},\r\n\t\tremove() {\r\n\t\t\tcacheSession.removeItem(key)\r\n\t\t},\r\n\t}\r\n}\r\n","import { cloneDeep, isArray, isBoolean, isDate, isFunction, isObject, isString, isUndefined } from \"lodash-es\"\r\nimport { STATUS } from \"./network\"\r\nimport { showFailToast, showSuccessToast } from \"vant\"\r\nimport dayjs from \"dayjs\"\r\n\r\n/**\r\n * 创建一个隐藏的表单\r\n *\r\n * @param {Object} options\r\n * @param {string} options.url\r\n * @param {Object} options.data\r\n * @param {string} [options.method]\r\n * @param {string} options.csrfToken\r\n * @returns {HTMLFormElement}\r\n */\r\nexport function useHiddenForm(options) {\r\n\tconst { url, data, csrfToken } = options\r\n\tlet { method } = options\r\n\r\n\tmethod = method || \"post\"\r\n\r\n\tconst form = document.createElement(\"form\")\r\n\tform.action = url\r\n\tform.method = method\r\n\tform.target = \"_blank\"\r\n\tform.style.display = \"none\"\r\n\r\n\tObject.keys(data).forEach((key) => {\r\n\t\tconst input = document.createElement(\"input\")\r\n\t\tinput.type = \"hidden\"\r\n\t\tinput.name = key\r\n\t\tinput.value = data[key]\r\n\t\tform.appendChild(input)\r\n\t})\r\n\r\n\tif (!csrfToken) {\r\n\t\tconst input = document.createElement(\"input\")\r\n\t\tinput.type = \"hidden\"\r\n\t\tinput.name = \"_token\"\r\n\t\tinput.value = document.querySelector('meta[name=\"csrf-token\"]').getAttribute(\"content\")\r\n\t\tform.appendChild(input)\r\n\t}\r\n\r\n\tdocument.body.appendChild(form)\r\n\r\n\treturn form\r\n}\r\n\r\n/**\r\n * 处理请求结果\r\n *\r\n * @param {object} res 请求结果\r\n * @param {string|number} res.status 请求结果状态\r\n * @param {*} res.result 请求结果信息\r\n * @param {Object.<string, string|function>} ops 状态的处理对象\r\n */\r\nexport function useProcessStatus(res, ops) {\r\n\tconst { status } = res\r\n\tconst msg = res.result\r\n\tconst predefined = {}\r\n\tpredefined.default = \"请求失败, 请检查数据并重试\"\r\n\tpredefined[STATUS.STATE_CODE_FAIL] = \"系统错误，请稍候再试\"\r\n\tpredefined[STATUS.STATE_CODE_NOT_FOUND] = \"请求的内容不存在\"\r\n\tpredefined[STATUS.STATE_CODE_INFO_NOT_COMPLETE] = \"信息不完整\"\r\n\tpredefined[STATUS.STATE_CODE_NOT_ALLOWED] = \"没有权限\"\r\n\r\n\t// 有几个常用的自定义名称\r\n\tconst special = {\r\n\t\t[STATUS.STATE_CODE_SUCCESS]: \"success\",\r\n\t}\r\n\r\n\tconst op = ops[status] || ops[special[status]] || predefined[status] || predefined.default\r\n\r\n\tif (isString(op)) {\r\n\t\tif (status === STATUS.STATE_CODE_SUCCESS) {\r\n\t\t\tshowSuccessToast(op)\r\n\t\t} else {\r\n\t\t\tshowFailToast(msg || op)\r\n\t\t}\r\n\t} else if (isFunction(op)) {\r\n\t\top()\r\n\t}\r\n}\r\n\r\n/**\r\n * 处理正确请求结果\r\n *\r\n * @param {object} res 请求结果\r\n * @param {string} res.status 请求结果状态\r\n * @param {*} res.result 请求结果信息\r\n * @param {string|function} success 状态的处理对象\r\n */\r\nexport function useProcessStatusSuccess(res, success) {\r\n\tuseProcessStatus(res, { success })\r\n}\r\n\r\n/**\r\n * 处理表单提交失败\r\n * @param {*} e\r\n */\r\nexport function useFormFail(e) {\r\n\tif (e && e.errorFields) {\r\n\t\te.errorFields.forEach((item) => {\r\n\t\t\tshowFailToast(item.errors.join(\" \"))\r\n\t\t})\r\n\t} else if (!(e && e.response)) {\r\n\t\tshowFailToast(\"请检查填写项\")\r\n\t} else {\r\n\t\tshowFailToast(\"网络异常\")\r\n\t}\r\n}\r\n\r\n/**\r\n * 处理表单数据\r\n * @param {Object} form\r\n * @param {Object} [format] 需要处理的类型\r\n * @param {boolean|string|Function} [format.date] `true`: 转成时间戳，`string`: 为 Format 格式, 如 `\"YYYY-MM-DD\"`, `function`: 自定义处理函数, 参数为 dayjs 对象\r\n * @param {boolean} [format.boolean] 布尔值处理, 如果开启则 `true` 转成 1, `false` 转成 0\r\n * @param {string|Function} [format.attachment] `string`: 附件字段名, `function`: 自定义处理函数, 参数为附件对象\r\n * @return {Object}\r\n */\r\nexport function useFormFormat(form, format) {\r\n\t//必须先 Copy form, 否则会改变 vm model 里的引用值而导致出错\r\n\tconst newForm = cloneDeep(form)\r\n\tformat = format || {}\r\n\tconst formatter = (obj) => {\r\n\t\tfor (let key in obj) {\r\n\t\t\t//日期处理\r\n\r\n\t\t\tlet date\r\n\t\t\tif (dayjs.isDayjs(obj[key])) {\r\n\t\t\t\tdate = obj[key]\r\n\t\t\t} else if (isDate(obj[key])) {\r\n\t\t\t\tdate = dayjs(obj[key])\r\n\t\t\t}\r\n\r\n\t\t\tif (date && format.date) {\r\n\t\t\t\tif (isString(format.date)) {\r\n\t\t\t\t\tobj[key] = date.format(format.date)\r\n\t\t\t\t} else if (isFunction(format.date)) {\r\n\t\t\t\t\tobj[key] = format.date(date)\r\n\t\t\t\t} else {\r\n\t\t\t\t\tobj[key] = date.unix()\r\n\t\t\t\t}\r\n\t\t\t\tcontinue\r\n\t\t\t}\r\n\r\n\t\t\t//布尔值处理\r\n\t\t\tif (isBoolean(obj[key]) && format.boolean) {\r\n\t\t\t\tif (format.boolean === true) {\r\n\t\t\t\t\tobj[key] = obj[key] ? 1 : 0\r\n\t\t\t\t} else if (Array.isArray(format.boolean)) {\r\n\t\t\t\t\tobj[key] = obj[key] ? format.boolean?.[0] || 1 : format.boolean?.[1] || 0\r\n\t\t\t\t}\r\n\t\t\t\tcontinue\r\n\t\t\t}\r\n\r\n\t\t\t//附件处理\r\n\t\t\tif (format.attachment) {\r\n\t\t\t\tconst checker = format.attachment\r\n\t\t\t\tif (isObject(obj[key]) && obj[key]._type === \"file\" && isString(checker) && !isUndefined(obj[key][checker])) {\r\n\t\t\t\t\tobj[key] = obj[key][checker]\r\n\t\t\t\t\tcontinue\r\n\t\t\t\t} else if (isObject(obj[key]) && isFunction(checker) && obj[key]._type === \"file\") {\r\n\t\t\t\t\tobj[key] = checker(obj[key])\r\n\t\t\t\t\tcontinue\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t//数组处理\r\n\t\t\tif (isArray(obj[key])) {\r\n\t\t\t\tobj[key] = formatter(obj[key])\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn obj\r\n\t}\r\n\r\n\treturn formatter(newForm)\r\n}\r\n\r\nexport default {\r\n\tuseHiddenForm,\r\n\tuseProcessStatus,\r\n\tuseProcessStatusSuccess,\r\n\tuseFormFail,\r\n\tuseFormFormat,\r\n}\r\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst u8a = (a) => a instanceof Uint8Array;\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (u8a(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(`${title} must be hex string or Uint8Array`);\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\nexport function equalBytes(b1, b2) {\n    // We don't care about timing attacks here\n    if (b1.length !== b2.length)\n        return false;\n    for (let i = 0; i < b1.length; i++)\n        if (b1[i] !== b2[i])\n            return false;\n    return true;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport const bitSet = (n, pos, value) => {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n};\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n    if (number === _0n || modulo <= _0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\n// Tonelli-Shanks algorithm\n// Paper 1: https://eprint.iacr.org/2012/685.pdf (page 12)\n// Paper 2: Square Roots from 1; 24, 51, 10 to Dan Shanks\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nexport function FpSqrt(P) {\n    // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n    // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, _2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\nexport function FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n// 0 is non-invertible: non-batched version will throw on 0\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a galois field over prime. Non-primes are not supported for now.\n * Do not init in loop: slow. Very fragile: always run a benchmark on change.\n * Major performance gains:\n * a) non-normalized operations like mulN instead of mul\n * b) `Object.freeze`\n * c) Same object shape: never add or remove keys\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Fp ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * FIPS 186 B.4.1-compliant \"constant-time\" private key generation utility.\n * Can take (n+8) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 40 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. curveFn.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.js';\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: class DERErr extends Error {\n        constructor(m = '') {\n            super(m);\n        }\n    },\n    _parseInt(data) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            throw new E('Invalid signature integer tag');\n        const len = data[1];\n        const res = data.subarray(2, len + 2);\n        if (!len || res.length !== len)\n            throw new E('Invalid signature integer: wrong length');\n        // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n        // since we always use positive integers here. It must always be empty:\n        // - add zero byte if exists\n        // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n        if (res[0] & 0b10000000)\n            throw new E('Invalid signature integer: negative');\n        if (res[0] === 0x00 && !(res[1] & 0b10000000))\n            throw new E('Invalid signature integer: unnecessary leading zero');\n        return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        if (!(data instanceof Uint8Array))\n            throw new Error('ui8a expected');\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            throw new E('Invalid signature: incorrect length');\n        const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n        if (rBytesLeft.length)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\n            const hex = num.toString(16);\n            return hex.length & 1 ? `0${hex}` : hex;\n        };\n        const s = slice(h(sig.s));\n        const r = slice(h(sig.r));\n        const shl = s.length / 2;\n        const rhl = r.length / 2;\n        const sl = h(shl);\n        const rl = h(rhl);\n        return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((c, point, isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (key instanceof Uint8Array)\n                key = ut.bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            num = mod.mod(num, n); // disabled by default, enabled for BLS\n        assertGE(num); // num in range [1..N-1]\n        return num;\n    }\n    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n     * Default Point works in 2d / affine coordinates: (x, y)\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         * Takes a bunch of Projective Points but executes only one\n         * inversion on all of them. Inversion is very slow operation,\n         * so this improves performance massively.\n         * Optimization: converts a list of projective points to a list of identical points with Z=1.\n         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            // Zero is valid point too!\n            if (this.is0()) {\n                if (CURVE.allowInfinityPoint)\n                    return;\n                throw new Error('bad point: ZERO');\n            }\n            // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n            const { x, y } = this.toAffine();\n            // Check if x, y are valid field elements\n            if (!Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('bad point: x or y not FE');\n            const left = Fp.sqr(y); // y²\n            const right = weierstrassEquation(x); // x³ + ax + b\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\n                const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n                return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n            });\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(n) {\n            const I = Point.ZERO;\n            if (n === _0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === _1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // Fake point is used to const-time mult\n            const { endo } = CURVE;\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(n);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\n        // Converts Projective point to affine (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        // (x, y, z) ∋ (x=x/z, y=y/z)\n        toAffine(iz) {\n            const { px: x, py: y, pz: z } = this;\n            const is0 = this.is0();\n            // If invZ was 0, we return zero point. However we still want to execute\n            // all operations, so we replace invZ with a random number, 1.\n            if (iz == null)\n                iz = is0 ? Fp.ONE : Fp.inv(z);\n            const ax = Fp.mul(x, iz);\n            const ay = Fp.mul(y, iz);\n            const zz = Fp.mul(z, iz);\n            if (is0)\n                return { x: Fp.ZERO, y: Fp.ZERO };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function isValidFieldElement(num) {\n        return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return mod.mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return mod.invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = ut.concatBytes;\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = ut.bytesToNumberBE(tail);\n                if (!isValidFieldElement(x))\n                    throw new Error('Point is not on curve');\n                const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n                let y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n                const isYOdd = (y & _1n) === _1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return ut.hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return ut.hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size (nBitLength+64)\n         * as per FIPS 186 B.4.1 with modulo bias being neglible.\n         */\n        randomPrivateKey: () => {\n            const rand = CURVE.randomBytes(Fp.BYTES + 8);\n            const num = mod.hashToPrivateScalar(rand, CURVE_ORDER);\n            return ut.numberToBytesBE(num, CURVE.nByteLength);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const arr = item instanceof Uint8Array;\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = CURVE.bits2int ||\n        function (bytes) {\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('bigint expected');\n        if (!(_0n <= num && num < ORDER_MASK))\n            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n        // works with order, can have different size than numToField!\n        return ut.numberToBytesBE(num, CURVE.nByteLength);\n    }\n    // Steps A, D of RFC6979 3.2\n    // Creates RFC6979 seed; converts msg/privKey to numbers.\n    // Used only in sign, not in verify.\n    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n    // Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(ensureBytes('extraEntropy', e, Fp.BYTES)); // check for being of size BYTES\n        }\n        const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n            // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n            // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n            const s = modN(ik * modN(m + r * d)); // Not using blinding here\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   U1 = hs^-1 mod n\n     *   U2 = rs^-1 mod n\n     *   R = U1⋅G - U2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || sg instanceof Uint8Array) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\n            }\n            else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n                const { r, s } = sg;\n                _sig = new Signature(r, s);\n            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (error.message === 'PARSE')\n                throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n            return false;\n        }\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * From draft-irtf-cfrg-hash-to-curve-16\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    mod.validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, opts.Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map","var __defProp = Object.defineProperty;\nvar __export = (target, all) => {\n  for (var name in all)\n    __defProp(target, name, { get: all[name], enumerable: true });\n};\n\n// src/sm2/index.ts\nvar sm2_exports = {};\n__export(sm2_exports, {\n  EmptyArray: () => EmptyArray,\n  arrayToHex: () => arrayToHex,\n  arrayToUtf8: () => arrayToUtf8,\n  calculateSharedKey: () => calculateSharedKey,\n  comparePublicKeyHex: () => comparePublicKeyHex,\n  compressPublicKeyHex: () => compressPublicKeyHex,\n  doDecrypt: () => doDecrypt,\n  doEncrypt: () => doEncrypt,\n  doSignature: () => doSignature,\n  doVerifySignature: () => doVerifySignature,\n  generateKeyPairHex: () => generateKeyPairHex,\n  getHash: () => getHash,\n  getPoint: () => getPoint,\n  getPublicKeyFromPrivateKey: () => getPublicKeyFromPrivateKey,\n  getZ: () => getZ,\n  hexToArray: () => hexToArray,\n  initRNGPool: () => initRNGPool,\n  leftPad: () => leftPad,\n  precomputePublicKey: () => precomputePublicKey,\n  utf8ToHex: () => utf8ToHex,\n  verifyPublicKey: () => verifyPublicKey\n});\n\n// src/sm2/asn1.ts\nimport * as utils from \"@noble/curves/abstract/utils\";\n\n// src/sm2/bn.ts\nvar ZERO = BigInt(0);\nvar ONE = BigInt(1);\nvar TWO = BigInt(2);\nvar THREE = BigInt(3);\n\n// src/sm2/asn1.ts\nfunction bigintToValue(bigint) {\n  let h = bigint.toString(16);\n  if (h[0] !== \"-\") {\n    if (h.length % 2 === 1)\n      h = \"0\" + h;\n    else if (!h.match(/^[0-7]/))\n      h = \"00\" + h;\n  } else {\n    h = h.substring(1);\n    let len = h.length;\n    if (len % 2 === 1)\n      len += 1;\n    else if (!h.match(/^[0-7]/))\n      len += 2;\n    let maskString = \"\";\n    for (let i = 0; i < len; i++)\n      maskString += \"f\";\n    let mask = utils.hexToNumber(maskString);\n    let output = (mask ^ bigint) + ONE;\n    h = output.toString(16).replace(/^-/, \"\");\n  }\n  return h;\n}\nvar ASN1Object = class {\n  constructor(tlv = null, t = \"00\", l = \"00\", v = \"\") {\n    this.tlv = tlv;\n    this.t = t;\n    this.l = l;\n    this.v = v;\n  }\n  getEncodedHex() {\n    if (!this.tlv) {\n      this.v = this.getValue();\n      this.l = this.getLength();\n      this.tlv = this.t + this.l + this.v;\n    }\n    return this.tlv;\n  }\n  getLength() {\n    const n = this.v.length / 2;\n    let nHex = n.toString(16);\n    if (nHex.length % 2 === 1)\n      nHex = \"0\" + nHex;\n    if (n < 128) {\n      return nHex;\n    } else {\n      const head = 128 + nHex.length / 2;\n      return head.toString(16) + nHex;\n    }\n  }\n  getValue() {\n    return \"\";\n  }\n};\nvar DERInteger = class extends ASN1Object {\n  constructor(bigint) {\n    super();\n    this.t = \"02\";\n    if (bigint)\n      this.v = bigintToValue(bigint);\n  }\n  getValue() {\n    return this.v;\n  }\n};\nvar DERSequence = class extends ASN1Object {\n  constructor(asn1Array) {\n    super();\n    this.asn1Array = asn1Array;\n  }\n  t = \"30\";\n  getValue() {\n    this.v = this.asn1Array.map((asn1Object) => asn1Object.getEncodedHex()).join(\"\");\n    return this.v;\n  }\n};\nfunction getLenOfL(str, start) {\n  if (+str[start + 2] < 8)\n    return 1;\n  return +str.substring(start + 2, start + 4) & 127 + 1;\n}\nfunction getL(str, start) {\n  const len = getLenOfL(str, start);\n  const l = str.substring(start + 2, start + 2 + len * 2);\n  if (!l)\n    return -1;\n  const bigint = +l[0] < 8 ? utils.hexToNumber(l) : utils.hexToNumber(l.substring(2));\n  return +bigint.toString();\n}\nfunction getStartOfV(str, start) {\n  const len = getLenOfL(str, start);\n  return start + (len + 1) * 2;\n}\nfunction encodeDer(r, s) {\n  const derR = new DERInteger(r);\n  const derS = new DERInteger(s);\n  const derSeq = new DERSequence([derR, derS]);\n  return derSeq.getEncodedHex();\n}\nfunction decodeDer(input) {\n  const start = getStartOfV(input, 0);\n  const vIndexR = getStartOfV(input, start);\n  const lR = getL(input, start);\n  const vR = input.substr(vIndexR, lR * 2);\n  const nextStart = vIndexR + vR.length;\n  const vIndexS = getStartOfV(input, nextStart);\n  const lS = getL(input, nextStart);\n  const vS = input.substring(vIndexS, vIndexS + lS * 2);\n  const r = utils.hexToNumber(vR);\n  const s = utils.hexToNumber(vS);\n  return { r, s };\n}\n\n// src/sm2/utils.ts\nimport * as utils2 from \"@noble/curves/abstract/utils\";\n\n// src/sm2/ec.ts\nimport { weierstrass } from \"@noble/curves/abstract/weierstrass\";\nimport { Field } from \"@noble/curves/abstract/modular\";\n\n// src/sm2/rng.ts\nvar DEFAULT_PRNG_POOL_SIZE = 16384;\nvar prngPool = new Uint8Array(0);\nvar _syncCrypto;\nasync function initRNGPool() {\n  if (\"crypto\" in globalThis) {\n    _syncCrypto = globalThis.crypto;\n    return;\n  }\n  if (prngPool.length > DEFAULT_PRNG_POOL_SIZE / 2)\n    return;\n  if (\"wx\" in globalThis && \"getRandomValues\" in globalThis.wx) {\n    prngPool = await new Promise((r) => {\n      wx.getRandomValues({\n        length: DEFAULT_PRNG_POOL_SIZE,\n        success(res) {\n          r(new Uint8Array(res.randomValues));\n        }\n      });\n    });\n  } else {\n    try {\n      if (globalThis.crypto) {\n        _syncCrypto = globalThis.crypto;\n      } else {\n        const crypto = await import(\n          /* webpackIgnore: true */\n          \"crypto\"\n        );\n        _syncCrypto = crypto.webcrypto;\n      }\n      const array = new Uint8Array(DEFAULT_PRNG_POOL_SIZE);\n      _syncCrypto.getRandomValues(array);\n      prngPool = array;\n    } catch (error) {\n      throw new Error(\"no available csprng, abort.\");\n    }\n  }\n}\ninitRNGPool();\nfunction consumePool(length) {\n  if (prngPool.length > length) {\n    const prng = prngPool.slice(0, length);\n    prngPool = prngPool.slice(length);\n    initRNGPool();\n    return prng;\n  } else {\n    throw new Error(\"random number pool is not ready or insufficient, prevent getting too long random values or too often.\");\n  }\n}\nfunction randomBytes(length = 0) {\n  const array = new Uint8Array(length);\n  if (_syncCrypto) {\n    return _syncCrypto.getRandomValues(array);\n  } else {\n    const result = consumePool(length);\n    return result;\n  }\n}\n\n// src/sm3/utils.ts\nvar u8a = (a) => a instanceof Uint8Array;\nvar createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\nvar isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;\nif (!isLE)\n  throw new Error(\"Non little-endian hardware is not supported\");\nvar hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, \"0\"));\nfunction bytesToHex(bytes) {\n  if (!u8a(bytes))\n    throw new Error(\"Uint8Array expected\");\n  let hex = \"\";\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\nfunction utf8ToBytes(str) {\n  if (typeof str !== \"string\")\n    throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str));\n}\nfunction toBytes(data) {\n  if (typeof data === \"string\")\n    data = utf8ToBytes(data);\n  if (!u8a(data))\n    throw new Error(`expected Uint8Array, got ${typeof data}`);\n  return data;\n}\nvar Hash = class {\n  clone() {\n    return this._cloneInto();\n  }\n};\nfunction wrapConstructor(hashCons) {\n  const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n  const tmp2 = hashCons();\n  hashC.outputLen = tmp2.outputLen;\n  hashC.blockLen = tmp2.blockLen;\n  hashC.create = () => hashCons();\n  return hashC;\n}\n\n// src/sm2/sm3.ts\nvar BoolA = (A, B, C) => A & B | A & C | B & C;\nvar BoolB = (A, B, C) => A ^ B ^ C;\nvar BoolC = (A, B, C) => A & B | ~A & C;\nfunction setBigUint64(view, byteOffset, value, isLE2) {\n  if (typeof view.setBigUint64 === \"function\")\n    return view.setBigUint64(byteOffset, value, isLE2);\n  const _32n = BigInt(32);\n  const _u32_max = BigInt(4294967295);\n  const wh = Number(value >> _32n & _u32_max);\n  const wl = Number(value & _u32_max);\n  const h = isLE2 ? 4 : 0;\n  const l = isLE2 ? 0 : 4;\n  view.setUint32(byteOffset + h, wh, isLE2);\n  view.setUint32(byteOffset + l, wl, isLE2);\n}\nfunction rotl(x2, n) {\n  const s = n & 31;\n  return x2 << s | x2 >>> 32 - s;\n}\nfunction P0(X) {\n  return X ^ rotl(X, 9) ^ rotl(X, 17);\n}\nfunction P1(X) {\n  return X ^ rotl(X, 15) ^ rotl(X, 23);\n}\nvar SHA2 = class extends Hash {\n  constructor(blockLen, outputLen, padOffset, isLE2) {\n    super();\n    this.blockLen = blockLen;\n    this.outputLen = outputLen;\n    this.padOffset = padOffset;\n    this.isLE = isLE2;\n    this.buffer = new Uint8Array(blockLen);\n    this.view = createView(this.buffer);\n  }\n  buffer;\n  view;\n  finished = false;\n  length = 0;\n  pos = 0;\n  destroyed = false;\n  update(data) {\n    const { view, buffer, blockLen } = this;\n    data = toBytes(data);\n    const len = data.length;\n    for (let pos = 0; pos < len; ) {\n      const take = Math.min(blockLen - this.pos, len - pos);\n      if (take === blockLen) {\n        const dataView = createView(data);\n        for (; blockLen <= len - pos; pos += blockLen)\n          this.process(dataView, pos);\n        continue;\n      }\n      buffer.set(data.subarray(pos, pos + take), this.pos);\n      this.pos += take;\n      pos += take;\n      if (this.pos === blockLen) {\n        this.process(view, 0);\n        this.pos = 0;\n      }\n    }\n    this.length += data.length;\n    this.roundClean();\n    return this;\n  }\n  digestInto(out) {\n    this.finished = true;\n    const { buffer, view, blockLen, isLE: isLE2 } = this;\n    let { pos } = this;\n    buffer[pos++] = 128;\n    this.buffer.subarray(pos).fill(0);\n    if (this.padOffset > blockLen - pos) {\n      this.process(view, 0);\n      pos = 0;\n    }\n    for (let i = pos; i < blockLen; i++)\n      buffer[i] = 0;\n    setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE2);\n    this.process(view, 0);\n    const oview = createView(out);\n    const len = this.outputLen;\n    if (len % 4)\n      throw new Error(\"_sha2: outputLen should be aligned to 32bit\");\n    const outLen = len / 4;\n    const state = this.get();\n    if (outLen > state.length)\n      throw new Error(\"_sha2: outputLen bigger than state\");\n    for (let i = 0; i < outLen; i++)\n      oview.setUint32(4 * i, state[i], isLE2);\n  }\n  digest() {\n    const { buffer, outputLen } = this;\n    this.digestInto(buffer);\n    const res = buffer.slice(0, outputLen);\n    this.destroy();\n    return res;\n  }\n  _cloneInto(to) {\n    to ||= new this.constructor();\n    to.set(...this.get());\n    const { blockLen, buffer, length, finished, destroyed, pos } = this;\n    to.length = length;\n    to.pos = pos;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    if (length % blockLen)\n      to.buffer.set(buffer);\n    return to;\n  }\n};\nvar IV = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);\nvar SM3_W = new Uint32Array(68);\nvar SM3_M = new Uint32Array(64);\nvar T1 = 2043430169;\nvar T2 = 2055708042;\nvar SM3 = class extends SHA2 {\n  A = IV[0] | 0;\n  B = IV[1] | 0;\n  C = IV[2] | 0;\n  D = IV[3] | 0;\n  E = IV[4] | 0;\n  F = IV[5] | 0;\n  G = IV[6] | 0;\n  H = IV[7] | 0;\n  constructor() {\n    super(64, 32, 8, false);\n  }\n  get() {\n    const { A, B, C, D, E, F, G, H } = this;\n    return [A, B, C, D, E, F, G, H];\n  }\n  set(A, B, C, D, E, F, G, H) {\n    this.A = A | 0;\n    this.B = B | 0;\n    this.C = C | 0;\n    this.D = D | 0;\n    this.E = E | 0;\n    this.F = F | 0;\n    this.G = G | 0;\n    this.H = H | 0;\n  }\n  process(view, offset) {\n    for (let i = 0; i < 16; i++, offset += 4)\n      SM3_W[i] = view.getUint32(offset, false);\n    for (let i = 16; i < 68; i++) {\n      SM3_W[i] = P1(SM3_W[i - 16] ^ SM3_W[i - 9] ^ rotl(SM3_W[i - 3], 15)) ^ rotl(SM3_W[i - 13], 7) ^ SM3_W[i - 6];\n    }\n    for (let i = 0; i < 64; i++) {\n      SM3_M[i] = SM3_W[i] ^ SM3_W[i + 4];\n    }\n    let { A, B, C, D, E, F, G, H } = this;\n    for (let j = 0; j < 64; j++) {\n      let small = j >= 0 && j <= 15;\n      let T = small ? T1 : T2;\n      let SS1 = rotl(rotl(A, 12) + E + rotl(T, j), 7);\n      let SS2 = SS1 ^ rotl(A, 12);\n      let TT1 = (small ? BoolB(A, B, C) : BoolA(A, B, C)) + D + SS2 + SM3_M[j] | 0;\n      let TT2 = (small ? BoolB(E, F, G) : BoolC(E, F, G)) + H + SS1 + SM3_W[j] | 0;\n      D = C;\n      C = rotl(B, 9);\n      B = A;\n      A = TT1;\n      H = G;\n      G = rotl(F, 19);\n      F = E;\n      E = P0(TT2);\n    }\n    A = A ^ this.A | 0;\n    B = B ^ this.B | 0;\n    C = C ^ this.C | 0;\n    D = D ^ this.D | 0;\n    E = E ^ this.E | 0;\n    F = F ^ this.F | 0;\n    G = G ^ this.G | 0;\n    H = H ^ this.H | 0;\n    this.set(A, B, C, D, E, F, G, H);\n  }\n  roundClean() {\n    SM3_W.fill(0);\n  }\n  destroy() {\n    this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    this.buffer.fill(0);\n  }\n};\nvar sm3 = wrapConstructor(() => new SM3());\n\n// src/sm2/hmac.ts\nvar HMAC = class extends Hash {\n  oHash;\n  iHash;\n  blockLen;\n  outputLen;\n  finished = false;\n  destroyed = false;\n  constructor(hash, _key) {\n    super();\n    const key = toBytes(_key);\n    this.iHash = hash.create();\n    if (typeof this.iHash.update !== \"function\")\n      throw new Error(\"Expected instance of class which extends utils.Hash\");\n    this.blockLen = this.iHash.blockLen;\n    this.outputLen = this.iHash.outputLen;\n    const blockLen = this.blockLen;\n    const pad = new Uint8Array(blockLen);\n    pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n    for (let i = 0; i < pad.length; i++)\n      pad[i] ^= 54;\n    this.iHash.update(pad);\n    this.oHash = hash.create();\n    for (let i = 0; i < pad.length; i++)\n      pad[i] ^= 54 ^ 92;\n    this.oHash.update(pad);\n    pad.fill(0);\n  }\n  update(buf) {\n    this.iHash.update(buf);\n    return this;\n  }\n  digestInto(out) {\n    this.finished = true;\n    this.iHash.digestInto(out);\n    this.oHash.update(out);\n    this.oHash.digestInto(out);\n    this.destroy();\n  }\n  digest() {\n    const out = new Uint8Array(this.oHash.outputLen);\n    this.digestInto(out);\n    return out;\n  }\n  _cloneInto(to) {\n    to ||= Object.create(Object.getPrototypeOf(this), {});\n    const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n    to = to;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    to.blockLen = blockLen;\n    to.outputLen = outputLen;\n    to.oHash = oHash._cloneInto(to.oHash);\n    to.iHash = iHash._cloneInto(to.iHash);\n    return to;\n  }\n  destroy() {\n    this.destroyed = true;\n    this.oHash.destroy();\n    this.iHash.destroy();\n  }\n};\nvar hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n\n// src/sm2/ec.ts\nimport { concatBytes } from \"@noble/curves/abstract/utils\";\nvar sm2Fp = Field(BigInt(\"115792089210356248756420345214020892766250353991924191454421193933289684991999\"));\nvar sm2Curve = weierstrass({\n  a: BigInt(\"115792089210356248756420345214020892766250353991924191454421193933289684991996\"),\n  b: BigInt(\"18505919022281880113072981827955639221458448578012075254857346196103069175443\"),\n  Fp: sm2Fp,\n  h: ONE,\n  n: BigInt(\"115792089210356248756420345214020892766061623724957744567843809356293439045923\"),\n  Gx: BigInt(\"22963146547237050559479531362550074578802567295341616970375194840604139615431\"),\n  Gy: BigInt(\"85132369209828568825618990617112496413088388631904505083283536607588877201568\"),\n  hash: sm3,\n  hmac: (key, ...msgs) => hmac(sm3, key, concatBytes(...msgs)),\n  randomBytes\n});\nvar field = Field(BigInt(sm2Curve.CURVE.n));\n\n// src/sm2/utils.ts\nimport { mod } from \"@noble/curves/abstract/modular\";\nfunction generateKeyPairHex(str) {\n  const privateKey = str ? utils2.numberToBytesBE(mod(BigInt(str), ONE) + ONE, 32) : sm2Curve.utils.randomPrivateKey();\n  const publicKey = sm2Curve.getPublicKey(privateKey, false);\n  const privPad = leftPad(utils2.bytesToHex(privateKey), 64);\n  const pubPad = leftPad(utils2.bytesToHex(publicKey), 64);\n  return { privateKey: privPad, publicKey: pubPad };\n}\nfunction compressPublicKeyHex(s) {\n  if (s.length !== 130)\n    throw new Error(\"Invalid public key to compress\");\n  const len = (s.length - 2) / 2;\n  const xHex = s.substring(2, 2 + len);\n  const y = utils2.hexToNumber(s.substring(len + 2, len + len + 2));\n  let prefix = \"03\";\n  if (mod(y, TWO) === ZERO)\n    prefix = \"02\";\n  return prefix + xHex;\n}\nfunction utf8ToHex(input) {\n  input = decodeURIComponent(encodeURIComponent(input));\n  const length = input.length;\n  const words = new Uint32Array((length >>> 2) + 1);\n  for (let i = 0; i < length; i++) {\n    words[i >>> 2] |= (input.charCodeAt(i) & 255) << 24 - i % 4 * 8;\n  }\n  const hexChars = [];\n  for (let i = 0; i < length; i++) {\n    const bite = words[i >>> 2] >>> 24 - i % 4 * 8 & 255;\n    hexChars.push((bite >>> 4).toString(16));\n    hexChars.push((bite & 15).toString(16));\n  }\n  return hexChars.join(\"\");\n}\nfunction leftPad(input, num) {\n  if (input.length >= num)\n    return input;\n  return new Array(num - input.length + 1).join(\"0\") + input;\n}\nfunction arrayToHex(arr) {\n  return arr.map((item) => {\n    const hex = item.toString(16);\n    return hex.length === 1 ? \"0\" + hex : hex;\n  }).join(\"\");\n}\nfunction arrayToUtf8(arr) {\n  const str = [];\n  for (let i = 0, len = arr.length; i < len; i++) {\n    if (arr[i] >= 240 && arr[i] <= 247) {\n      str.push(String.fromCodePoint(((arr[i] & 7) << 18) + ((arr[i + 1] & 63) << 12) + ((arr[i + 2] & 63) << 6) + (arr[i + 3] & 63)));\n      i += 3;\n    } else if (arr[i] >= 224 && arr[i] <= 239) {\n      str.push(String.fromCodePoint(((arr[i] & 15) << 12) + ((arr[i + 1] & 63) << 6) + (arr[i + 2] & 63)));\n      i += 2;\n    } else if (arr[i] >= 192 && arr[i] <= 223) {\n      str.push(String.fromCodePoint(((arr[i] & 31) << 6) + (arr[i + 1] & 63)));\n      i++;\n    } else {\n      str.push(String.fromCodePoint(arr[i]));\n    }\n  }\n  return str.join(\"\");\n}\nfunction hexToArray(hexStr) {\n  let hexStrLength = hexStr.length;\n  if (hexStrLength % 2 !== 0) {\n    hexStr = leftPad(hexStr, hexStrLength + 1);\n  }\n  hexStrLength = hexStr.length;\n  const wordLength = hexStrLength / 2;\n  const words = new Uint8Array(wordLength);\n  for (let i = 0; i < wordLength; i++) {\n    words[i] = parseInt(hexStr.substring(i * 2, i * 2 + 2), 16);\n  }\n  return words;\n}\nfunction verifyPublicKey(publicKey) {\n  const point = sm2Curve.ProjectivePoint.fromHex(publicKey);\n  if (!point)\n    return false;\n  try {\n    point.assertValidity();\n    return true;\n  } catch (error) {\n    return false;\n  }\n}\nfunction comparePublicKeyHex(publicKey1, publicKey2) {\n  const point1 = sm2Curve.ProjectivePoint.fromHex(publicKey1);\n  if (!point1)\n    return false;\n  const point2 = sm2Curve.ProjectivePoint.fromHex(publicKey2);\n  if (!point2)\n    return false;\n  return point1.equals(point2);\n}\n\n// src/sm2/index.ts\nimport * as utils4 from \"@noble/curves/abstract/utils\";\n\n// src/sm2/kx.ts\nimport * as utils3 from \"@noble/curves/abstract/utils\";\nvar wPow2 = utils3.hexToNumber(\"80000000000000000000000000000000\");\nvar wPow2Sub1 = utils3.hexToNumber(\"7fffffffffffffffffffffffffffffff\");\nfunction hkdf(z, keylen) {\n  let msg = new Uint8Array(keylen);\n  let ct = 1;\n  let offset = 0;\n  let t = EmptyArray;\n  const ctShift = new Uint8Array(4);\n  const nextT = () => {\n    ctShift[0] = ct >> 24 & 255;\n    ctShift[1] = ct >> 16 & 255;\n    ctShift[2] = ct >> 8 & 255;\n    ctShift[3] = ct & 255;\n    t = sm3(utils3.concatBytes(z, ctShift));\n    ct++;\n    offset = 0;\n  };\n  nextT();\n  for (let i = 0, len = msg.length; i < len; i++) {\n    if (offset === t.length)\n      nextT();\n    msg[i] = t[offset++] & 255;\n  }\n  return msg;\n}\nfunction calculateSharedKey(keypairA, ephemeralKeypairA, publicKeyB, ephemeralPublicKeyB, sharedKeyLength, isRecipient = false, idA = \"1234567812345678\", idB = \"1234567812345678\") {\n  const RA = sm2Curve.ProjectivePoint.fromHex(ephemeralKeypairA.publicKey);\n  const RB = sm2Curve.ProjectivePoint.fromHex(ephemeralPublicKeyB);\n  const PB = sm2Curve.ProjectivePoint.fromHex(publicKeyB);\n  let ZA = getZ(keypairA.publicKey, idA);\n  let ZB = getZ(publicKeyB, idB);\n  if (isRecipient) {\n    [ZA, ZB] = [ZB, ZA];\n  }\n  const rA = utils3.hexToNumber(ephemeralKeypairA.privateKey);\n  const dA = utils3.hexToNumber(keypairA.privateKey);\n  const x1 = RA.x;\n  const x1_ = wPow2 + (x1 & wPow2Sub1);\n  const tA = field.add(dA, field.mulN(x1_, rA));\n  const x2 = RB.x;\n  const x2_ = field.add(wPow2, x2 & wPow2Sub1);\n  const U = RB.multiply(x2_).add(PB).multiply(tA);\n  const xU = hexToArray(leftPad(utils3.numberToHexUnpadded(U.x), 64));\n  const yU = hexToArray(leftPad(utils3.numberToHexUnpadded(U.y), 64));\n  const KA = hkdf(utils3.concatBytes(xU, yU, ZA, ZB), sharedKeyLength);\n  return KA;\n}\n\n// src/sm2/index.ts\nvar C1C2C3 = 0;\nvar EmptyArray = new Uint8Array();\nfunction doEncrypt(msg, publicKey, cipherMode = 1) {\n  const msgArr = typeof msg === \"string\" ? hexToArray(utf8ToHex(msg)) : Uint8Array.from(msg);\n  const publicKeyPoint = typeof publicKey === \"string\" ? sm2Curve.ProjectivePoint.fromHex(publicKey) : publicKey;\n  const keypair = generateKeyPairHex();\n  const k = utils4.hexToNumber(keypair.privateKey);\n  let c1 = keypair.publicKey;\n  if (c1.length > 128)\n    c1 = c1.substring(c1.length - 128);\n  const p = publicKeyPoint.multiply(k);\n  const x2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.x), 64));\n  const y2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.y), 64));\n  const c3 = bytesToHex(sm3(utils4.concatBytes(x2, msgArr, y2)));\n  xorCipherStream(x2, y2, msgArr);\n  const c2 = bytesToHex(msgArr);\n  return cipherMode === C1C2C3 ? c1 + c2 + c3 : c1 + c3 + c2;\n}\nfunction xorCipherStream(x2, y2, msg) {\n  let ct = 1;\n  let offset = 0;\n  let t = EmptyArray;\n  const ctShift = new Uint8Array(4);\n  const nextT = () => {\n    ctShift[0] = ct >> 24 & 255;\n    ctShift[1] = ct >> 16 & 255;\n    ctShift[2] = ct >> 8 & 255;\n    ctShift[3] = ct & 255;\n    t = sm3(utils4.concatBytes(x2, y2, ctShift));\n    ct++;\n    offset = 0;\n  };\n  nextT();\n  for (let i = 0, len = msg.length; i < len; i++) {\n    if (offset === t.length)\n      nextT();\n    msg[i] ^= t[offset++] & 255;\n  }\n}\nfunction doDecrypt(encryptData, privateKey, cipherMode = 1, {\n  output = \"string\"\n} = {}) {\n  const privateKeyInteger = utils4.hexToNumber(privateKey);\n  let c3 = encryptData.substring(128, 128 + 64);\n  let c2 = encryptData.substring(128 + 64);\n  if (cipherMode === C1C2C3) {\n    c3 = encryptData.substring(encryptData.length - 64);\n    c2 = encryptData.substring(128, encryptData.length - 64);\n  }\n  const msg = hexToArray(c2);\n  const c1 = sm2Curve.ProjectivePoint.fromHex(\"04\" + encryptData.substring(0, 128));\n  const p = c1.multiply(privateKeyInteger);\n  const x2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.x), 64));\n  const y2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.y), 64));\n  xorCipherStream(x2, y2, msg);\n  const checkC3 = arrayToHex(Array.from(sm3(utils4.concatBytes(x2, msg, y2))));\n  if (checkC3 === c3.toLowerCase()) {\n    return output === \"array\" ? msg : arrayToUtf8(msg);\n  } else {\n    return output === \"array\" ? [] : \"\";\n  }\n}\nfunction doSignature(msg, privateKey, options = {}) {\n  let {\n    pointPool,\n    der,\n    hash,\n    publicKey,\n    userId\n  } = options;\n  let hashHex = typeof msg === \"string\" ? utf8ToHex(msg) : arrayToHex(Array.from(msg));\n  if (hash) {\n    publicKey = publicKey || getPublicKeyFromPrivateKey(privateKey);\n    hashHex = getHash(hashHex, publicKey, userId);\n  }\n  const dA = utils4.hexToNumber(privateKey);\n  const e = utils4.hexToNumber(hashHex);\n  let k = null;\n  let r = null;\n  let s = null;\n  do {\n    do {\n      let point;\n      if (pointPool && pointPool.length) {\n        point = pointPool.pop();\n      } else {\n        point = getPoint();\n      }\n      k = point.k;\n      r = field.add(e, point.x1);\n    } while (r === ZERO || r + k === sm2Curve.CURVE.n);\n    s = field.mul(field.inv(field.addN(dA, ONE)), field.subN(k, field.mulN(r, dA)));\n  } while (s === ZERO);\n  if (der)\n    return encodeDer(r, s);\n  return leftPad(utils4.numberToHexUnpadded(r), 64) + leftPad(utils4.numberToHexUnpadded(s), 64);\n}\nfunction doVerifySignature(msg, signHex, publicKey, options = {}) {\n  let hashHex;\n  const {\n    hash,\n    der,\n    userId\n  } = options;\n  const publicKeyHex = typeof publicKey === \"string\" ? publicKey : publicKey.toHex(false);\n  if (hash) {\n    hashHex = getHash(typeof msg === \"string\" ? utf8ToHex(msg) : msg, publicKeyHex, userId);\n  } else {\n    hashHex = typeof msg === \"string\" ? utf8ToHex(msg) : arrayToHex(Array.from(msg));\n  }\n  let r;\n  let s;\n  if (der) {\n    const decodeDerObj = decodeDer(signHex);\n    r = decodeDerObj.r;\n    s = decodeDerObj.s;\n  } else {\n    r = utils4.hexToNumber(signHex.substring(0, 64));\n    s = utils4.hexToNumber(signHex.substring(64));\n  }\n  const PA = typeof publicKey === \"string\" ? sm2Curve.ProjectivePoint.fromHex(publicKey) : publicKey;\n  const e = utils4.hexToNumber(hashHex);\n  const t = field.add(r, s);\n  if (t === ZERO)\n    return false;\n  const x1y1 = sm2Curve.ProjectivePoint.BASE.multiply(s).add(PA.multiply(t));\n  const R = field.add(e, x1y1.x);\n  return r === R;\n}\nfunction getZ(publicKey, userId = \"1234567812345678\") {\n  userId = utf8ToHex(userId);\n  const a = leftPad(utils4.numberToHexUnpadded(sm2Curve.CURVE.a), 64);\n  const b = leftPad(utils4.numberToHexUnpadded(sm2Curve.CURVE.b), 64);\n  const gx = leftPad(utils4.numberToHexUnpadded(sm2Curve.ProjectivePoint.BASE.x), 64);\n  const gy = leftPad(utils4.numberToHexUnpadded(sm2Curve.ProjectivePoint.BASE.y), 64);\n  let px;\n  let py;\n  if (publicKey.length === 128) {\n    px = publicKey.substring(0, 64);\n    py = publicKey.substring(64, 128);\n  } else {\n    const point = sm2Curve.ProjectivePoint.fromHex(publicKey);\n    px = leftPad(utils4.numberToHexUnpadded(point.x), 64);\n    py = leftPad(utils4.numberToHexUnpadded(point.y), 64);\n  }\n  const data = hexToArray(userId + a + b + gx + gy + px + py);\n  const entl = userId.length * 4;\n  const z = sm3(utils4.concatBytes(new Uint8Array([entl >> 8 & 255, entl & 255]), data));\n  return z;\n}\nfunction getHash(hashHex, publicKey, userId = \"1234567812345678\") {\n  const z = getZ(publicKey, userId);\n  return bytesToHex(sm3(utils4.concatBytes(z, typeof hashHex === \"string\" ? hexToArray(hashHex) : hashHex)));\n}\nfunction precomputePublicKey(publicKey, windowSize) {\n  const point = sm2Curve.ProjectivePoint.fromHex(publicKey);\n  return sm2Curve.utils.precompute(windowSize, point);\n}\nfunction getPublicKeyFromPrivateKey(privateKey) {\n  const pubKey = sm2Curve.getPublicKey(privateKey, false);\n  const pubPad = leftPad(utils4.bytesToHex(pubKey), 64);\n  return pubPad;\n}\nfunction getPoint() {\n  const keypair = generateKeyPairHex();\n  const PA = sm2Curve.ProjectivePoint.fromHex(keypair.publicKey);\n  const k = utils4.hexToNumber(keypair.privateKey);\n  return {\n    ...keypair,\n    k,\n    x1: PA.x\n  };\n}\n\n// src/sm3/index.ts\nfunction utf8ToArray(str) {\n  const arr = [];\n  for (let i = 0, len = str.length; i < len; i++) {\n    const point = str.codePointAt(i);\n    if (point <= 127) {\n      arr.push(point);\n    } else if (point <= 2047) {\n      arr.push(192 | point >>> 6);\n      arr.push(128 | point & 63);\n    } else if (point <= 55295 || point >= 57344 && point <= 65535) {\n      arr.push(224 | point >>> 12);\n      arr.push(128 | point >>> 6 & 63);\n      arr.push(128 | point & 63);\n    } else if (point >= 65536 && point <= 1114111) {\n      i++;\n      arr.push(240 | point >>> 18 & 28);\n      arr.push(128 | point >>> 12 & 63);\n      arr.push(128 | point >>> 6 & 63);\n      arr.push(128 | point & 63);\n    } else {\n      arr.push(point);\n      throw new Error(\"input is not supported\");\n    }\n  }\n  return new Uint8Array(arr);\n}\nfunction sm32(input, options) {\n  input = typeof input === \"string\" ? utf8ToArray(input) : input;\n  if (options) {\n    const mode = options.mode || \"hmac\";\n    if (mode !== \"hmac\")\n      throw new Error(\"invalid mode\");\n    let key = options.key;\n    if (!key)\n      throw new Error(\"invalid key\");\n    key = typeof key === \"string\" ? hexToArray(key) : key;\n    return bytesToHex(hmac(sm3, key, input));\n  }\n  return bytesToHex(sm3(input));\n}\n\n// src/sm4/index.ts\nvar sm4_exports = {};\n__export(sm4_exports, {\n  decrypt: () => decrypt,\n  encrypt: () => encrypt,\n  sm4: () => sm4\n});\nvar DECRYPT = 0;\nvar ROUND = 32;\nvar BLOCK = 16;\nvar Sbox = Uint8Array.from([\n  214,\n  144,\n  233,\n  254,\n  204,\n  225,\n  61,\n  183,\n  22,\n  182,\n  20,\n  194,\n  40,\n  251,\n  44,\n  5,\n  43,\n  103,\n  154,\n  118,\n  42,\n  190,\n  4,\n  195,\n  170,\n  68,\n  19,\n  38,\n  73,\n  134,\n  6,\n  153,\n  156,\n  66,\n  80,\n  244,\n  145,\n  239,\n  152,\n  122,\n  51,\n  84,\n  11,\n  67,\n  237,\n  207,\n  172,\n  98,\n  228,\n  179,\n  28,\n  169,\n  201,\n  8,\n  232,\n  149,\n  128,\n  223,\n  148,\n  250,\n  117,\n  143,\n  63,\n  166,\n  71,\n  7,\n  167,\n  252,\n  243,\n  115,\n  23,\n  186,\n  131,\n  89,\n  60,\n  25,\n  230,\n  133,\n  79,\n  168,\n  104,\n  107,\n  129,\n  178,\n  113,\n  100,\n  218,\n  139,\n  248,\n  235,\n  15,\n  75,\n  112,\n  86,\n  157,\n  53,\n  30,\n  36,\n  14,\n  94,\n  99,\n  88,\n  209,\n  162,\n  37,\n  34,\n  124,\n  59,\n  1,\n  33,\n  120,\n  135,\n  212,\n  0,\n  70,\n  87,\n  159,\n  211,\n  39,\n  82,\n  76,\n  54,\n  2,\n  231,\n  160,\n  196,\n  200,\n  158,\n  234,\n  191,\n  138,\n  210,\n  64,\n  199,\n  56,\n  181,\n  163,\n  247,\n  242,\n  206,\n  249,\n  97,\n  21,\n  161,\n  224,\n  174,\n  93,\n  164,\n  155,\n  52,\n  26,\n  85,\n  173,\n  147,\n  50,\n  48,\n  245,\n  140,\n  177,\n  227,\n  29,\n  246,\n  226,\n  46,\n  130,\n  102,\n  202,\n  96,\n  192,\n  41,\n  35,\n  171,\n  13,\n  83,\n  78,\n  111,\n  213,\n  219,\n  55,\n  69,\n  222,\n  253,\n  142,\n  47,\n  3,\n  255,\n  106,\n  114,\n  109,\n  108,\n  91,\n  81,\n  141,\n  27,\n  175,\n  146,\n  187,\n  221,\n  188,\n  127,\n  17,\n  217,\n  92,\n  65,\n  31,\n  16,\n  90,\n  216,\n  10,\n  193,\n  49,\n  136,\n  165,\n  205,\n  123,\n  189,\n  45,\n  116,\n  208,\n  18,\n  184,\n  229,\n  180,\n  176,\n  137,\n  105,\n  151,\n  74,\n  12,\n  150,\n  119,\n  126,\n  101,\n  185,\n  241,\n  9,\n  197,\n  110,\n  198,\n  132,\n  24,\n  240,\n  125,\n  236,\n  58,\n  220,\n  77,\n  32,\n  121,\n  238,\n  95,\n  62,\n  215,\n  203,\n  57,\n  72\n]);\nvar CK = new Uint32Array([\n  462357,\n  472066609,\n  943670861,\n  1415275113,\n  1886879365,\n  2358483617,\n  2830087869,\n  3301692121,\n  3773296373,\n  4228057617,\n  404694573,\n  876298825,\n  1347903077,\n  1819507329,\n  2291111581,\n  2762715833,\n  3234320085,\n  3705924337,\n  4177462797,\n  337322537,\n  808926789,\n  1280531041,\n  1752135293,\n  2223739545,\n  2695343797,\n  3166948049,\n  3638552301,\n  4110090761,\n  269950501,\n  741554753,\n  1213159005,\n  1684763257\n]);\nfunction byteSub(a) {\n  return (Sbox[a >>> 24 & 255] & 255) << 24 | (Sbox[a >>> 16 & 255] & 255) << 16 | (Sbox[a >>> 8 & 255] & 255) << 8 | Sbox[a & 255] & 255;\n}\nvar x = new Uint32Array(4);\nvar tmp = new Uint32Array(4);\nfunction sms4Crypt(input, output, roundKey) {\n  let x0 = 0, x1 = 0, x2 = 0, x3 = 0, tmp0 = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;\n  tmp0 = input[0] & 255;\n  tmp1 = input[1] & 255;\n  tmp2 = input[2] & 255;\n  tmp3 = input[3] & 255;\n  x0 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  tmp0 = input[4] & 255;\n  tmp1 = input[5] & 255;\n  tmp2 = input[6] & 255;\n  tmp3 = input[7] & 255;\n  x1 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  tmp0 = input[8] & 255;\n  tmp1 = input[9] & 255;\n  tmp2 = input[10] & 255;\n  tmp3 = input[11] & 255;\n  x2 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  tmp0 = input[12] & 255;\n  tmp1 = input[13] & 255;\n  tmp2 = input[14] & 255;\n  tmp3 = input[15] & 255;\n  x3 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  for (let r = 0; r < 32; r += 4) {\n    tmp0 = x1 ^ x2 ^ x3 ^ roundKey[r];\n    tmp0 = byteSub(tmp0);\n    x0 ^= tmp0 ^ (tmp0 << 2 | tmp0 >>> 30) ^ (tmp0 << 10 | tmp0 >>> 22) ^ (tmp0 << 18 | tmp0 >>> 14) ^ (tmp0 << 24 | tmp0 >>> 8);\n    tmp1 = x2 ^ x3 ^ x0 ^ roundKey[r + 1];\n    tmp1 = byteSub(tmp1);\n    x1 ^= tmp1 ^ (tmp1 << 2 | tmp1 >>> 30) ^ (tmp1 << 10 | tmp1 >>> 22) ^ (tmp1 << 18 | tmp1 >>> 14) ^ (tmp1 << 24 | tmp1 >>> 8);\n    tmp2 = x3 ^ x0 ^ x1 ^ roundKey[r + 2];\n    tmp2 = byteSub(tmp2);\n    x2 ^= tmp2 ^ (tmp2 << 2 | tmp2 >>> 30) ^ (tmp2 << 10 | tmp2 >>> 22) ^ (tmp2 << 18 | tmp2 >>> 14) ^ (tmp2 << 24 | tmp2 >>> 8);\n    tmp3 = x0 ^ x1 ^ x2 ^ roundKey[r + 3];\n    tmp3 = byteSub(tmp3);\n    x3 ^= tmp3 ^ (tmp3 << 2 | tmp3 >>> 30) ^ (tmp3 << 10 | tmp3 >>> 22) ^ (tmp3 << 18 | tmp3 >>> 14) ^ (tmp3 << 24 | tmp3 >>> 8);\n  }\n  output[0] = x3 >>> 24 & 255;\n  output[1] = x3 >>> 16 & 255;\n  output[2] = x3 >>> 8 & 255;\n  output[3] = x3 & 255;\n  output[4] = x2 >>> 24 & 255;\n  output[5] = x2 >>> 16 & 255;\n  output[6] = x2 >>> 8 & 255;\n  output[7] = x2 & 255;\n  output[8] = x1 >>> 24 & 255;\n  output[9] = x1 >>> 16 & 255;\n  output[10] = x1 >>> 8 & 255;\n  output[11] = x1 & 255;\n  output[12] = x0 >>> 24 & 255;\n  output[13] = x0 >>> 16 & 255;\n  output[14] = x0 >>> 8 & 255;\n  output[15] = x0 & 255;\n}\nfunction sms4KeyExt(key, roundKey, cryptFlag) {\n  let x0 = 0, x1 = 0, x2 = 0, x3 = 0, mid = 0;\n  x0 = (key[0] & 255) << 24 | (key[1] & 255) << 16 | (key[2] & 255) << 8 | key[3] & 255;\n  x1 = (key[4] & 255) << 24 | (key[5] & 255) << 16 | (key[6] & 255) << 8 | key[7] & 255;\n  x2 = (key[8] & 255) << 24 | (key[9] & 255) << 16 | (key[10] & 255) << 8 | key[11] & 255;\n  x3 = (key[12] & 255) << 24 | (key[13] & 255) << 16 | (key[14] & 255) << 8 | key[15] & 255;\n  x0 ^= 2746333894;\n  x1 ^= 1453994832;\n  x2 ^= 1736282519;\n  x3 ^= 2993693404;\n  for (let r = 0; r < 32; r += 4) {\n    mid = x1 ^ x2 ^ x3 ^ CK[r + 0];\n    mid = byteSub(mid);\n    x0 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 0] = x0;\n    mid = x2 ^ x3 ^ x0 ^ CK[r + 1];\n    mid = byteSub(mid);\n    x1 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 1] = x1;\n    mid = x3 ^ x0 ^ x1 ^ CK[r + 2];\n    mid = byteSub(mid);\n    x2 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 2] = x2;\n    mid = x0 ^ x1 ^ x2 ^ CK[r + 3];\n    mid = byteSub(mid);\n    x3 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 3] = x3;\n  }\n  if (cryptFlag === DECRYPT) {\n    for (let r = 0; r < 16; r++) {\n      [roundKey[r], roundKey[31 - r]] = [roundKey[31 - r], roundKey[r]];\n    }\n  }\n}\nvar blockOutput = new Uint8Array(16);\nfunction sm4(inArray, key, cryptFlag, options = {}) {\n  let {\n    padding = \"pkcs#7\",\n    mode,\n    iv = new Uint8Array(16),\n    output\n  } = options;\n  if (mode === \"cbc\") {\n    if (typeof iv === \"string\")\n      iv = hexToArray(iv);\n    if (iv.length !== 128 / 8) {\n      throw new Error(\"iv is invalid\");\n    }\n  }\n  if (typeof key === \"string\")\n    key = hexToArray(key);\n  if (key.length !== 128 / 8) {\n    throw new Error(\"key is invalid\");\n  }\n  if (typeof inArray === \"string\") {\n    if (cryptFlag !== DECRYPT) {\n      inArray = utf8ToArray(inArray);\n    } else {\n      inArray = hexToArray(inArray);\n    }\n  } else {\n    inArray = Uint8Array.from(inArray);\n  }\n  if ((padding === \"pkcs#5\" || padding === \"pkcs#7\") && cryptFlag !== DECRYPT) {\n    const paddingCount = BLOCK - inArray.length % BLOCK;\n    const newArray = new Uint8Array(inArray.length + paddingCount);\n    newArray.set(inArray, 0);\n    for (let i = 0; i < paddingCount; i++)\n      newArray[inArray.length + i] = paddingCount;\n    inArray = newArray;\n  }\n  const roundKey = new Uint32Array(ROUND);\n  sms4KeyExt(key, roundKey, cryptFlag);\n  let outArray = new Uint8Array(inArray.length);\n  let lastVector = iv;\n  let restLen = inArray.length;\n  let point = 0;\n  while (restLen >= BLOCK) {\n    const input = inArray.subarray(point, point + 16);\n    if (mode === \"cbc\") {\n      for (let i = 0; i < BLOCK; i++) {\n        if (cryptFlag !== DECRYPT) {\n          input[i] ^= lastVector[i];\n        }\n      }\n    }\n    sms4Crypt(input, blockOutput, roundKey);\n    for (let i = 0; i < BLOCK; i++) {\n      if (mode === \"cbc\") {\n        if (cryptFlag === DECRYPT) {\n          blockOutput[i] ^= lastVector[i];\n        }\n      }\n      outArray[point + i] = blockOutput[i];\n    }\n    if (mode === \"cbc\") {\n      if (cryptFlag !== DECRYPT) {\n        lastVector = blockOutput;\n      } else {\n        lastVector = input;\n      }\n    }\n    restLen -= BLOCK;\n    point += BLOCK;\n  }\n  if ((padding === \"pkcs#5\" || padding === \"pkcs#7\") && cryptFlag === DECRYPT) {\n    const len = outArray.length;\n    const paddingCount = outArray[len - 1];\n    for (let i = 1; i <= paddingCount; i++) {\n      if (outArray[len - i] !== paddingCount)\n        throw new Error(\"padding is invalid\");\n    }\n    outArray = outArray.slice(0, len - paddingCount);\n  }\n  if (output !== \"array\") {\n    if (cryptFlag !== DECRYPT) {\n      return bytesToHex(outArray);\n    } else {\n      return arrayToUtf8(outArray);\n    }\n  } else {\n    return outArray;\n  }\n}\nfunction encrypt(inArray, key, options = {}) {\n  return sm4(inArray, key, 1, options);\n}\nfunction decrypt(inArray, key, options = {}) {\n  return sm4(inArray, key, 0, options);\n}\nexport {\n  sm2_exports as sm2,\n  sm32 as sm3,\n  sm4_exports as sm4\n};\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n","import { sm2, sm3, sm4 } from \"sm-crypto-v2\"\r\n\r\n/**\r\n * 国密 sm2 加密\r\n * @param msg\r\n * @param key\r\n * @param {Object} [cipherMode]\r\n * @return {Uint8Array}\r\n */\r\nexport function useSm2Encrypt(msg, key, cipherMode) {\r\n\treturn sm2.doEncrypt(msg, key, cipherMode)\r\n}\r\n\r\n/**\r\n * 国密 sm3 加密\r\n * @param msg\r\n * @param {Object} [options]\r\n * @return {*}\r\n */\r\nexport function useSm3(msg, options) {\r\n\treturn sm3(msg, options) // 杂凑\r\n}\r\n\r\n/**\r\n * 国密 sm4 加密\r\n * @param msg\r\n * @param key\r\n * @param {Object} [options]\r\n * @return {Uint8Array}\r\n */\r\nexport function useSm4Encrypt(msg, key, options) {\r\n\treturn sm4.encrypt(msg, key, options)\r\n}\r\n\r\n/**\r\n * 国密 sm4 解密\r\n * @param encryptData\r\n * @param key\r\n * @param {Object} [options]\r\n * @return {Uint8Array}\r\n */\r\nexport function useSm4Decrypt(encryptData, key, options) {\r\n\treturn sm4.encrypt(encryptData, key, options)\r\n}\r\n"],"names":["STATUS","_configStatus","status","key","useFetch","fetcher","globalLoading","url","config","resolve","reject","axios","res","err","allowMultipleToast","data","message","closeToast","isString","showLoadingToast","isObject","useTextFromOptionsValue","value","options","adapter","option","useFindTextsInValues","values","labels","recursiveSearch","node","_a","child","item","useFindLabelsFromPath","path","reduce","acc","find","useFindOptionByValue","foundOption","useFindTextsFromPath","useFindPropertyRecursive","propertyKey","nestedKey","flatMapDeep","useFindParentLabels","findParentLabels","useFindParentValues","findParentValues","localCacheSession","localSession","useCache","sessionType","cacheSession","shouldTransform","defaultValue","isNull","isUndefined","useHiddenForm","csrfToken","method","form","input","useProcessStatus","ops","msg","predefined","special","op","showSuccessToast","showFailToast","isFunction","useProcessStatusSuccess","success","useFormFail","e","useFormFormat","format","newForm","cloneDeep","formatter","obj","date","dayjs","isDate","isBoolean","_b","checker","isArray","_0n","_1n","_2n","u8a","a","hexes","v","i","bytesToHex","bytes","hex","numberToHexUnpadded","num","hexToNumber","hexToBytes","len","array","j","hexByte","byte","bytesToNumberBE","bytesToNumberLE","numberToBytesBE","n","numberToBytesLE","numberToVarBytesBE","ensureBytes","title","expectedLength","concatBytes","arrays","r","sum","pad","equalBytes","b1","b2","utf8ToBytes","str","bitLen","bitGet","pos","bitSet","bitMask","u8n","u8fr","arr","createHmacDrbg","hashLen","qByteLen","hmacFn","k","reset","h","b","reseed","seed","gen","out","sl","pred","validatorFns","val","object","validateObject","validators","optValidators","checkField","fieldName","type","isOptional","checkVal","_3n","_4n","_5n","_8n","mod","result","pow","power","modulo","invert","number","x","u","q","m","tonelliShanks","P","legendreC","Q","S","Z","p1div4","Fp","root","Q1div2","g","t2","ge","FpSqrt","c1","n2","nv","FIELD_FIELDS","validateField","field","initial","opts","map","FpPow","f","p","d","FpInvertBatch","nums","tmp","lastMultiplied","inverted","nLength","nBitLength","_nBitLength","nByteLength","Field","ORDER","isLE","redef","BITS","BYTES","sqrtP","lhs","rhs","lst","c","hashToPrivateScalar","hash","groupOrder","minLen","wNAF","bits","constTimeNegate","condition","neg","W","windows","windowSize","elm","points","base","window","precomputes","mask","maxNumber","shiftBy","offset","wbits","offset1","offset2","cond1","cond2","precomputesMap","transform","comp","validateBasic","curve","validatePointOpts","ut.validateObject","endo","b2n","h2b","ut","DER","E","l","sBytes","s","rBytesLeft","sig","slice","shl","rhl","rl","weierstrassPoints","CURVE","toBytes","point","isCompressed","ut.concatBytes","fromBytes","tail","weierstrassEquation","x2","x3","isWithinCurveOrder","assertGE","normPrivateKeyToScalar","lengths","wrapPrivateKey","ut.bytesToHex","ut.bytesToNumberBE","mod.mod","pointPrecomputes","assertPrjPoint","other","Point","px","py","pz","is0","toInv","privateKey","y","left","right","X1","Y1","Z1","X2","Y2","Z2","U1","U2","b3","X3","Y3","Z3","t0","t1","t3","t4","t5","wnaf","I","k1neg","k1","k2neg","k2","k1p","k2p","scalar","fake","f1p","f2p","G","mul","iz","z","ax","ay","zz","cofactor","isTorsionFree","clearCofactor","_bits","validateOpts","weierstrass","curveDef","CURVE_ORDER","compressedLen","uncompressedLen","isValidFieldElement","modN","invN","mod.invert","cat","head","y2","isYOdd","numToNByteStr","ut.numberToBytesBE","isBiggerThanHalfOrder","HALF","normalizeS","slcNum","from","to","Signature","recovery","msgHash","rec","bits2int_modN","radj","prefix","R","ir","u1","u2","ut.hexToBytes","utils","rand","mod.hashToPrivateScalar","getPublicKey","isProbPub","getSharedSecret","privateA","publicB","bits2int","delta","ORDER_MASK","ut.bitMask","int2octets","prepSig","defaultSigOpts","randomBytes","lowS","prehash","ent","h1int","seedArgs","k2sig","kBytes","ik","normS","defaultVerOpts","sign","privKey","C","ut.createHmacDrbg","verify","signature","publicKey","sg","_sig","derError","error","is","__defProp","__export","target","all","name","sm2_exports","EmptyArray","arrayToHex","arrayToUtf8","calculateSharedKey","comparePublicKeyHex","compressPublicKeyHex","doDecrypt","doEncrypt","doSignature","doVerifySignature","generateKeyPairHex","getHash","getPoint","getPublicKeyFromPrivateKey","getZ","hexToArray","initRNGPool","leftPad","precomputePublicKey","utf8ToHex","verifyPublicKey","ZERO","ONE","TWO","bigintToValue","bigint","maskString","utils.hexToNumber","ASN1Object","tlv","t","nHex","DERInteger","DERSequence","asn1Array","__publicField","asn1Object","getLenOfL","start","getL","getStartOfV","encodeDer","derR","derS","decodeDer","vIndexR","lR","vR","nextStart","vIndexS","lS","vS","DEFAULT_PRNG_POOL_SIZE","prngPool","_syncCrypto","consumePool","length","prng","createView","Hash","wrapConstructor","hashCons","hashC","tmp2","BoolA","A","B","BoolB","BoolC","setBigUint64","view","byteOffset","isLE2","_32n","_u32_max","wh","wl","rotl","P0","X","P1","SHA2","blockLen","outputLen","padOffset","buffer","take","dataView","oview","outLen","state","finished","destroyed","IV","SM3_W","SM3_M","T1","T2","SM3","D","F","H","small","T","SS1","SS2","TT1","TT2","sm3","HMAC","_key","buf","oHash","iHash","hmac","sm2Fp","sm2Curve","msgs","utils2.numberToBytesBE","privPad","utils2.bytesToHex","pubPad","xHex","utils2.hexToNumber","words","hexChars","bite","hexStr","hexStrLength","wordLength","publicKey1","publicKey2","point1","point2","wPow2","utils3.hexToNumber","wPow2Sub1","hkdf","keylen","ct","ctShift","nextT","utils3.concatBytes","keypairA","ephemeralKeypairA","publicKeyB","ephemeralPublicKeyB","sharedKeyLength","isRecipient","idA","idB","RA","RB","PB","ZA","ZB","rA","dA","x1","x1_","tA","x2_","U","xU","utils3.numberToHexUnpadded","yU","C1C2C3","cipherMode","msgArr","publicKeyPoint","keypair","utils4.hexToNumber","utils4.numberToHexUnpadded","c3","utils4.concatBytes","xorCipherStream","c2","encryptData","output","privateKeyInteger","pointPool","der","userId","hashHex","signHex","publicKeyHex","decodeDerObj","PA","x1y1","gx","gy","entl","pubKey","utils4.bytesToHex","utf8ToArray","sm32","sm4_exports","decrypt","encrypt","sm4","DECRYPT","ROUND","BLOCK","Sbox","CK","byteSub","sms4Crypt","roundKey","x0","tmp0","tmp1","tmp3","sms4KeyExt","cryptFlag","mid","blockOutput","inArray","padding","mode","iv","paddingCount","newArray","outArray","lastVector","restLen","useSm2Encrypt","sm2","useSm3","useSm4Encrypt","useSm4Decrypt"],"mappings":";;;;;;;AAQY,MAACA,KAAS;AAAA,EACrB,oBAAoB;AAAA;AAAA,EACpB,iBAAiB;AAAA;AAAA,EACjB,sBAAsB;AAAA;AAAA,EACtB,8BAA8B;AAAA;AAAA,EAC9B,wBAAwB;AAAA;AACzB;AAOO,SAASC,GAAcC,GAAQ;AACrC,SAAO,KAAKA,CAAM,EAAE,QAAQ,CAACC,MAAQ;AACpC,IAAAH,GAAOG,CAAG,IAAID,EAAOC,CAAG;AAAA,EAC1B,CAAE;AACF;AAOO,SAASC,GAASC,GAAS;AAEjC,MAAIC,IAAgB;AAEpB,SAAKD,MACJA,IAAU,CAAE,IAEbA,EAAQ,UAAU,IAEX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAON,IAAIE,GAAKC,GAAQ;AAChB,aAAO,IAAI,QAAQ,CAACC,GAASC,MAAW;AACvC,QAAAC,GACE,IAAIJ,GAAKC,CAAM,EACf,KAAK,CAACI,MAAQ;AACd,UAAAH,EAAQG,CAAG;AAAA,QACjB,CAAM,EACA,MAAM,CAACC,MAAQ;AACf,UAAAH,EAAOG,CAAG;AAAA,QAChB,CAAM,EACA,QAAQ,MAAM;AACd,UAAIP,MACHQ,GAAmB,EAAK,GACxBR,EAAc,MAAO,IAEtBD,EAAQ,UAAU;AAAA,QACxB,CAAM;AAAA,MACN,CAAI;AAAA,IACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,KAAKE,GAAKQ,GAAMP,GAAQ;AACvB,aAAO,IAAI,QAAQ,CAACC,GAASC,MAAW;AACvC,QAAAC,GACE,KAAKJ,GAAKQ,GAAMP,CAAM,EACtB,KAAK,CAACI,MAAQ;AACd,UAAAH,EAAQG,CAAG;AAAA,QACjB,CAAM,EACA,MAAM,CAACC,MAAQ;AACf,UAAAH,EAAOG,CAAG;AAAA,QAChB,CAAM,EACA,QAAQ,MAAM;AACd,UAAIP,MACHQ,GAAmB,EAAK,GACxBR,EAAc,MAAO,IAEtBD,EAAQ,UAAU;AAAA,QACxB,CAAM;AAAA,MACN,CAAI;AAAA,IACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,QAAQW,GAAS;AAChB,aAAAC,GAAW,EAAI,GACfH,GAAoB,GAChBI,GAASF,CAAO,IACnBV,IAAgBa,GAAiB;AAAA,QAChC,SAASH,KAAW;AAAA,QACpB,UAAU;AAAA,QACV,aAAa;AAAA,MAClB,CAAK,IACSI,GAASJ,CAAO,IAC1BV,IAAgBa,GAAiB,EAAE,UAAU,GAAG,GAAGH,EAAO,CAAE,IAE5DV,IAAgBa,GAAiB;AAAA,QAChC,SAAS;AAAA,QACT,UAAU;AAAA,QACV,aAAa;AAAA,MAClB,CAAK,GAGK;AAAA,IACP;AAAA,EACD;AACF;AC/GO,SAASE,GAAwBC,GAAOC,GAASC,GAAS;AAChE,MAAI,CAACD;AACJ,WAAO;AAER,EAAAC,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,EACP;AACD,QAAMC,IAASF,EAAQ,KAAK,CAACE,MAAWA,EAAOD,EAAQ,KAAK,MAAMF,CAAK;AACvE,SAAOG,IAASA,EAAOD,EAAQ,KAAK,IAAI;AACzC;AAUO,SAASE,GAAqBH,GAASI,GAAQH,GAAS;AAC9D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,QAAMI,IAAS,CAAE;AAEjB,WAASC,EAAgBC,GAAM;;AAC9B,IAAIH,EAAO,SAASG,EAAKN,EAAQ,KAAK,CAAC,KACtCI,EAAO,KAAKE,EAAKN,EAAQ,KAAK,CAAC,IAG5BO,IAAAD,EAAKN,EAAQ,QAAQ,MAArB,QAAAO,EAAwB,UAC3BD,EAAKN,EAAQ,QAAQ,EAAE,QAAQ,CAACQ,MAAU;AACzC,MAAAH,EAAgBG,CAAK;AAAA,IACzB,CAAI;AAAA,EAEF;AAED,SAAAT,EAAQ,QAAQ,CAACU,MAAS;AACzB,IAAAJ,EAAgBI,CAAI;AAAA,EACtB,CAAE,GAEML;AACR;AASO,SAASM,GAAsBX,GAASY,GAAMX,GAAS;AAC7D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,MAAII,IAAS,CAAE;AACf,SAAAQ;AAAA,IACCD;AAAA,IACA,CAACE,GAAKf,MAAU;AACf,YAAMW,IAAOK,GAAKD,GAAK,EAAE,CAACb,EAAQ,KAAK,GAAGF,GAAO;AACjD,UAAIW;AACH,eAAAL,EAAO,KAAKK,EAAKT,EAAQ,KAAK,CAAC,GACxBS,EAAKT,EAAQ,QAAQ;AAAA,IAE7B;AAAA,IACDD;AAAA,EACA,GACMK;AACR;AASO,SAASW,GAAqBhB,GAASD,GAAOE,GAAS;AAC7D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAGD,WAASC,KAAUF,GAAS;AAE3B,QAAIE,EAAOD,EAAQ,KAAK,MAAMF;AAC7B,aAAOG;AAGR,QAAIA,EAAOD,EAAQ,QAAQ,KAAKC,EAAOD,EAAQ,QAAQ,EAAE,QAAQ;AAEhE,YAAMgB,IAAcD,GAAqBd,EAAOD,EAAQ,QAAQ,GAAGF,GAAOE,CAAO;AAEjF,UAAIgB;AACH,eAAOA;AAAA,IAER;AAAA,EACD;AAED,SAAO;AACR;AAUO,SAASC,GAAqBlB,GAASY,GAAMX,GAAS;AAC5D,SAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV,GACMU,GAAsBX,GAASY,GAAMX,CAAO;AACpD;AAoBO,SAASkB,GAAyBT,GAAMU,GAAaC,GAAW;AACtE,SAAOC,GAAYZ,GAAM,CAACX,GAAOnB,MAC5BA,MAAQwC,IACJrB,IAEJnB,MAAQyC,IACJF,GAAyBpB,GAAOqB,GAAaC,CAAS,IAEvD,CAAE,CACT;AACF;AASO,SAASE,GAAoBvB,GAASD,GAAOE,GAAS;AAC5D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,QAAMI,IAAS,CAAE;AAEjB,WAASmB,EAAiBxB,GAASD,GAAOM,GAAQ;AACjD,eAAWH,KAAUF;AACpB,UAAIE,EAAOD,EAAQ,KAAK,MAAMF,GAAO;AACpC,QAAAM,EAAO,QAAQH,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA,WAAUC,EAAOD,EAAQ,QAAQ,KACbuB,EAAiBtB,EAAOD,EAAQ,QAAQ,GAAGF,GAAOM,CAAM,EAC5D,SAAS,GAAG;AAC3B,QAAAA,EAAO,QAAQH,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA;AAIH,WAAOI;AAAA,EACP;AAED,SAAOmB,EAAiBxB,GAASD,GAAOM,CAAM;AAC/C;AASO,SAASoB,GAAoBzB,GAASD,GAAOE,GAAS;AAC5D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,QAAMG,IAAS,CAAE;AAEjB,WAASsB,EAAiB1B,GAASD,GAAOK,GAAQ;AACjD,eAAWF,KAAUF;AACpB,UAAIE,EAAOD,EAAQ,KAAK,MAAMF,GAAO;AACpC,QAAAK,EAAO,QAAQF,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA,WAAUC,EAAOD,EAAQ,QAAQ,KACbyB,EAAiBxB,EAAOD,EAAQ,QAAQ,GAAGF,GAAOK,CAAM,EAC5D,SAAS,GAAG;AAC3B,QAAAA,EAAO,QAAQF,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA;AAIH,WAAOG;AAAA,EACP;AAED,SAAOsB,EAAiB1B,GAASD,GAAOK,CAAM;AAC/C;AAEA,MAAMuB,KAAoB,CAAE,GACtBC,KAAe;AAAA,EACpB,QAAQhD,GAAKmB,GAAO;AACnB,IAAA4B,GAAkB/C,CAAG,IAAImB;AAAA,EACzB;AAAA,EACD,QAAQnB,GAAK;AACZ,WAAO+C,GAAkB/C,CAAG;AAAA,EAC5B;AAAA,EACD,WAAWA,GAAK;AACf,WAAO+C,GAAkB/C,CAAG;AAAA,EAC5B;AACF;AAEA,OAAO,cAAc,MAAM;AAC1B,UAAQ,IAAI,KAAK,MAAM,KAAK,UAAU+C,IAAmB,MAAM,CAAC,CAAC,CAAC;AACnE;AAQO,SAASE,GAASjD,GAAKkD,GAAa;AAC1C,QAAMC,IAAeD,KAAeF,IAC9BI,IAAkB,CAAC,CAACF;AAC1B,SAAO;AAAA,IACN,IAAIG,GAAc;AACjB,YAAMlC,IAAQgC,EAAa,QAAQnD,CAAG;AACtC,aAAIsD,GAAOnC,CAAK,KAAKoC,GAAYpC,CAAK,IAC9BkC,IAEDD,IAAkB,KAAK,MAAMjC,CAAK,IAAIA;AAAA,IAC7C;AAAA,IACD,IAAIA,GAAO;AACV,MAAAgC,EAAa,QAAQnD,GAAKoD,IAAkB,KAAK,UAAUjC,CAAK,IAAIA,CAAK;AAAA,IACzE;AAAA,IACD,SAAS;AACR,MAAAgC,EAAa,WAAWnD,CAAG;AAAA,IAC3B;AAAA,EACD;AACF;AC1QO,SAASwD,GAAcpC,GAAS;AACtC,QAAM,EAAE,KAAAhB,GAAK,MAAAQ,GAAM,WAAA6C,EAAW,IAAGrC;AACjC,MAAI,EAAE,QAAAsC,EAAM,IAAKtC;AAEjB,EAAAsC,IAASA,KAAU;AAEnB,QAAMC,IAAO,SAAS,cAAc,MAAM;AAc1C,MAbAA,EAAK,SAASvD,GACduD,EAAK,SAASD,GACdC,EAAK,SAAS,UACdA,EAAK,MAAM,UAAU,QAErB,OAAO,KAAK/C,CAAI,EAAE,QAAQ,CAACZ,MAAQ;AAClC,UAAM4D,IAAQ,SAAS,cAAc,OAAO;AAC5C,IAAAA,EAAM,OAAO,UACbA,EAAM,OAAO5D,GACb4D,EAAM,QAAQhD,EAAKZ,CAAG,GACtB2D,EAAK,YAAYC,CAAK;AAAA,EACxB,CAAE,GAEG,CAACH,GAAW;AACf,UAAMG,IAAQ,SAAS,cAAc,OAAO;AAC5C,IAAAA,EAAM,OAAO,UACbA,EAAM,OAAO,UACbA,EAAM,QAAQ,SAAS,cAAc,yBAAyB,EAAE,aAAa,SAAS,GACtFD,EAAK,YAAYC,CAAK;AAAA,EACtB;AAED,kBAAS,KAAK,YAAYD,CAAI,GAEvBA;AACR;AAUO,SAASE,GAAiBpD,GAAKqD,GAAK;AAC1C,QAAM,EAAE,QAAA/D,EAAM,IAAKU,GACbsD,IAAMtD,EAAI,QACVuD,IAAa,CAAE;AACrB,EAAAA,EAAW,UAAU,kBACrBA,EAAWnE,GAAO,eAAe,IAAI,cACrCmE,EAAWnE,GAAO,oBAAoB,IAAI,YAC1CmE,EAAWnE,GAAO,4BAA4B,IAAI,SAClDmE,EAAWnE,GAAO,sBAAsB,IAAI;AAG5C,QAAMoE,IAAU;AAAA,IACf,CAACpE,GAAO,kBAAkB,GAAG;AAAA,EAC7B,GAEKqE,IAAKJ,EAAI/D,CAAM,KAAK+D,EAAIG,EAAQlE,CAAM,CAAC,KAAKiE,EAAWjE,CAAM,KAAKiE,EAAW;AAEnF,EAAIjD,GAASmD,CAAE,IACVnE,MAAWF,GAAO,qBACrBsE,GAAiBD,CAAE,IAEnBE,GAAcL,KAAOG,CAAE,IAEdG,GAAWH,CAAE,KACvBA,EAAI;AAEN;AAUO,SAASI,GAAwB7D,GAAK8D,GAAS;AACrD,EAAAV,GAAiBpD,GAAK,EAAE,SAAA8D,GAAS;AAClC;AAMO,SAASC,GAAYC,GAAG;AAC9B,EAAIA,KAAKA,EAAE,cACVA,EAAE,YAAY,QAAQ,CAAC3C,MAAS;AAC/B,IAAAsC,GAActC,EAAK,OAAO,KAAK,GAAG,CAAC;AAAA,EACtC,CAAG,IACW2C,KAAKA,EAAE,WAGnBL,GAAc,MAAM,IAFpBA,GAAc,QAAQ;AAIxB;AAWO,SAASM,GAAcf,GAAMgB,GAAQ;AAE3C,QAAMC,IAAUC,GAAUlB,CAAI;AAC9B,EAAAgB,IAASA,KAAU,CAAE;AACrB,QAAMG,IAAY,CAACC,MAAQ;;AAC1B,aAAS/E,KAAO+E,GAAK;AAGpB,UAAIC;AAOJ,UANIC,GAAM,QAAQF,EAAI/E,CAAG,CAAC,IACzBgF,IAAOD,EAAI/E,CAAG,IACJkF,GAAOH,EAAI/E,CAAG,CAAC,MACzBgF,IAAOC,GAAMF,EAAI/E,CAAG,CAAC,IAGlBgF,KAAQL,EAAO,MAAM;AACxB,QAAI5D,GAAS4D,EAAO,IAAI,IACvBI,EAAI/E,CAAG,IAAIgF,EAAK,OAAOL,EAAO,IAAI,IACxBN,GAAWM,EAAO,IAAI,IAChCI,EAAI/E,CAAG,IAAI2E,EAAO,KAAKK,CAAI,IAE3BD,EAAI/E,CAAG,IAAIgF,EAAK,KAAM;AAEvB;AAAA,MACA;AAGD,UAAIG,GAAUJ,EAAI/E,CAAG,CAAC,KAAK2E,EAAO,SAAS;AAC1C,QAAIA,EAAO,YAAY,KACtBI,EAAI/E,CAAG,IAAI+E,EAAI/E,CAAG,IAAI,IAAI,IAChB,MAAM,QAAQ2E,EAAO,OAAO,MACtCI,EAAI/E,CAAG,IAAI+E,EAAI/E,CAAG,MAAI4B,IAAA+C,EAAO,YAAP,gBAAA/C,EAAiB,OAAM,MAAIwD,IAAAT,EAAO,YAAP,gBAAAS,EAAiB,OAAM;AAEzE;AAAA,MACA;AAGD,UAAIT,EAAO,YAAY;AACtB,cAAMU,IAAUV,EAAO;AACvB,YAAI1D,GAAS8D,EAAI/E,CAAG,CAAC,KAAK+E,EAAI/E,CAAG,EAAE,UAAU,UAAUe,GAASsE,CAAO,KAAK,CAAC9B,GAAYwB,EAAI/E,CAAG,EAAEqF,CAAO,CAAC,GAAG;AAC5G,UAAAN,EAAI/E,CAAG,IAAI+E,EAAI/E,CAAG,EAAEqF,CAAO;AAC3B;AAAA,QACA,WAAUpE,GAAS8D,EAAI/E,CAAG,CAAC,KAAKqE,GAAWgB,CAAO,KAAKN,EAAI/E,CAAG,EAAE,UAAU,QAAQ;AAClF,UAAA+E,EAAI/E,CAAG,IAAIqF,EAAQN,EAAI/E,CAAG,CAAC;AAC3B;AAAA,QACA;AAAA,MACD;AAGD,MAAIsF,GAAQP,EAAI/E,CAAG,CAAC,MACnB+E,EAAI/E,CAAG,IAAI8E,EAAUC,EAAI/E,CAAG,CAAC;AAAA,IAE9B;AAED,WAAO+E;AAAA,EACP;AAED,SAAOD,EAAUF,CAAO;AACzB;ACnLA;AAKA,MAAMW,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdC,KAAM,CAACC,MAAMA,aAAa,YAC1BC,KAAQ,MAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACC,GAAGC,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAI5E,SAASC,GAAWC,GAAO;AAC9B,MAAI,CAACN,GAAIM,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AAEzC,MAAIC,IAAM;AACV,WAASH,IAAI,GAAGA,IAAIE,EAAM,QAAQF;AAC9B,IAAAG,KAAOL,GAAMI,EAAMF,CAAC,CAAC;AAEzB,SAAOG;AACX;AACO,SAASC,EAAoBC,GAAK;AACrC,QAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,SAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AACxC;AACO,SAASG,EAAYH,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAE5D,SAAO,OAAOA,MAAQ,KAAK,MAAM,KAAKA,CAAG,EAAE;AAC/C;AAIO,SAASI,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,QAAMK,IAAML,EAAI;AAChB,MAAIK,IAAM;AACN,UAAM,IAAI,MAAM,4DAA4DA,CAAG;AACnF,QAAMC,IAAQ,IAAI,WAAWD,IAAM,CAAC;AACpC,WAASR,IAAI,GAAGA,IAAIS,EAAM,QAAQT,KAAK;AACnC,UAAMU,IAAIV,IAAI,GACRW,IAAUR,EAAI,MAAMO,GAAGA,IAAI,CAAC,GAC5BE,IAAO,OAAO,SAASD,GAAS,EAAE;AACxC,QAAI,OAAO,MAAMC,CAAI,KAAKA,IAAO;AAC7B,YAAM,IAAI,MAAM,uBAAuB;AAC3C,IAAAH,EAAMT,CAAC,IAAIY;AAAA,EACd;AACD,SAAOH;AACX;AAEO,SAASI,GAAgBX,GAAO;AACnC,SAAOI,EAAYL,GAAWC,CAAK,CAAC;AACxC;AACO,SAASY,GAAgBZ,GAAO;AACnC,MAAI,CAACN,GAAIM,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,SAAOI,EAAYL,GAAW,WAAW,KAAKC,CAAK,EAAE,QAAS,CAAA,CAAC;AACnE;AACO,SAASa,GAAgBC,GAAGR,GAAK;AACpC,SAAOD,GAAWS,EAAE,SAAS,EAAE,EAAE,SAASR,IAAM,GAAG,GAAG,CAAC;AAC3D;AACO,SAASS,GAAgBD,GAAGR,GAAK;AACpC,SAAOO,GAAgBC,GAAGR,CAAG,EAAE,QAAO;AAC1C;AAEO,SAASU,GAAmBF,GAAG;AAClC,SAAOT,GAAWH,EAAoBY,CAAC,CAAC;AAC5C;AAUO,SAASG,EAAYC,GAAOjB,GAAKkB,GAAgB;AACpD,MAAI1G;AACJ,MAAI,OAAOwF,KAAQ;AACf,QAAI;AACA,MAAAxF,IAAM4F,GAAWJ,CAAG;AAAA,IACvB,SACMxB,GAAG;AACN,YAAM,IAAI,MAAM,GAAGyC,CAAK,mCAAmCjB,CAAG,aAAaxB,CAAC,EAAE;AAAA,IACjF;AAAA,WAEIiB,GAAIO,CAAG;AAGZ,IAAAxF,IAAM,WAAW,KAAKwF,CAAG;AAAA;AAGzB,UAAM,IAAI,MAAM,GAAGiB,CAAK,mCAAmC;AAE/D,QAAMZ,IAAM7F,EAAI;AAChB,MAAI,OAAO0G,KAAmB,YAAYb,MAAQa;AAC9C,UAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAeb,CAAG,EAAE;AAC3E,SAAO7F;AACX;AAIO,SAAS2G,KAAeC,GAAQ;AACnC,QAAMC,IAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,GAAK5B,MAAM4B,IAAM5B,EAAE,QAAQ,CAAC,CAAC;AACrE,MAAI6B,IAAM;AACV,SAAAH,EAAO,QAAQ,CAAC1B,MAAM;AAClB,QAAI,CAACD,GAAIC,CAAC;AACN,YAAM,IAAI,MAAM,qBAAqB;AACzC,IAAA2B,EAAE,IAAI3B,GAAG6B,CAAG,GACZA,KAAO7B,EAAE;AAAA,EACjB,CAAK,GACM2B;AACX;AACO,SAASG,GAAWC,GAAIC,GAAI;AAE/B,MAAID,EAAG,WAAWC,EAAG;AACjB,WAAO;AACX,WAAS7B,IAAI,GAAGA,IAAI4B,EAAG,QAAQ5B;AAC3B,QAAI4B,EAAG5B,CAAC,MAAM6B,EAAG7B,CAAC;AACd,aAAO;AACf,SAAO;AACX;AAIO,SAAS8B,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAMO,SAASC,GAAOhB,GAAG;AACtB,MAAIR;AACJ,OAAKA,IAAM,GAAGQ,IAAIvB,IAAKuB,MAAMtB,IAAKc,KAAO;AACrC;AACJ,SAAOA;AACX;AAMO,SAASyB,GAAOjB,GAAGkB,GAAK;AAC3B,SAAQlB,KAAK,OAAOkB,CAAG,IAAKxC;AAChC;AAIO,MAAMyC,KAAS,CAACnB,GAAGkB,GAAK7G,MACpB2F,KAAM3F,IAAQqE,KAAMD,OAAQ,OAAOyC,CAAG,GAMpCE,KAAU,CAACpB,OAAOrB,MAAO,OAAOqB,IAAI,CAAC,KAAKtB,IAEjD2C,KAAM,CAACvH,MAAS,IAAI,WAAWA,CAAI,GACnCwH,KAAO,CAACC,MAAQ,WAAW,KAAKA,CAAG;AAQlC,SAASC,GAAeC,GAASC,GAAUC,GAAQ;AACtD,MAAI,OAAOF,KAAY,YAAYA,IAAU;AACzC,UAAM,IAAI,MAAM,0BAA0B;AAC9C,MAAI,OAAOC,KAAa,YAAYA,IAAW;AAC3C,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI,OAAOC,KAAW;AAClB,UAAM,IAAI,MAAM,2BAA2B;AAE/C,MAAI5C,IAAIsC,GAAII,CAAO,GACfG,IAAIP,GAAII,CAAO,GACfzC,IAAI;AACR,QAAM6C,IAAQ,MAAM;AAChB,IAAA9C,EAAE,KAAK,CAAC,GACR6C,EAAE,KAAK,CAAC,GACR5C,IAAI;AAAA,EACZ,GACU8C,IAAI,IAAIC,MAAMJ,EAAOC,GAAG7C,GAAG,GAAGgD,CAAC,GAC/BC,IAAS,CAACC,IAAOZ,SAAU;AAI7B,IAFAO,IAAIE,EAAER,GAAK,CAAC,CAAI,CAAC,GAAGW,CAAI,GACxBlD,IAAI+C,EAAC,GACDG,EAAK,WAAW,MAEpBL,IAAIE,EAAER,GAAK,CAAC,CAAI,CAAC,GAAGW,CAAI,GACxBlD,IAAI+C,EAAC;AAAA,EACb,GACUI,IAAM,MAAM;AAEd,QAAIlD,OAAO;AACP,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAIQ,IAAM;AACV,UAAM2C,IAAM,CAAA;AACZ,WAAO3C,IAAMkC,KAAU;AACnB,MAAA3C,IAAI+C,EAAC;AACL,YAAMM,IAAKrD,EAAE;AACb,MAAAoD,EAAI,KAAKC,CAAE,GACX5C,KAAOT,EAAE;AAAA,IACZ;AACD,WAAOuB,EAAY,GAAG6B,CAAG;AAAA,EACjC;AAUI,SATiB,CAACF,GAAMI,MAAS;AAC7B,IAAAR,KACAG,EAAOC,CAAI;AACX,QAAItI;AACJ,WAAO,EAAEA,IAAM0I,EAAKH,EAAK,CAAA;AACrB,MAAAF;AACJ,WAAAH,KACOlI;AAAA,EACf;AAEA;AAEA,MAAM2I,KAAe;AAAA,EACjB,QAAQ,CAACC,MAAQ,OAAOA,KAAQ;AAAA,EAChC,UAAU,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAClC,SAAS,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EACjC,QAAQ,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAChC,eAAe,CAACA,MAAQ,OAAO,cAAcA,CAAG;AAAA,EAChD,OAAO,CAACA,MAAQ,MAAM,QAAQA,CAAG;AAAA,EACjC,OAAO,CAACA,GAAKC,MAAWA,EAAO,GAAG,QAAQD,CAAG;AAAA,EAC7C,MAAM,CAACA,MAAQ,OAAOA,KAAQ,cAAc,OAAO,cAAcA,EAAI,SAAS;AAClF;AAEO,SAASE,GAAeD,GAAQE,GAAYC,IAAgB,CAAA,GAAI;AACnE,QAAMC,IAAa,CAACC,GAAWC,GAAMC,MAAe;AAChD,UAAMC,IAAWV,GAAaQ,CAAI;AAClC,QAAI,OAAOE,KAAa;AACpB,YAAM,IAAI,MAAM,sBAAsBF,CAAI,sBAAsB;AACpE,UAAMP,IAAMC,EAAOK,CAAS;AAC5B,QAAI,EAAAE,KAAcR,MAAQ,WAEtB,CAACS,EAAST,GAAKC,CAAM;AACrB,YAAM,IAAI,MAAM,iBAAiB,OAAOK,CAAS,CAAC,IAAIN,CAAG,KAAK,OAAOA,CAAG,eAAeO,CAAI,EAAE;AAAA,EAEzG;AACI,aAAW,CAACD,GAAWC,CAAI,KAAK,OAAO,QAAQJ,CAAU;AACrD,IAAAE,EAAWC,GAAWC,GAAM,EAAK;AACrC,aAAW,CAACD,GAAWC,CAAI,KAAK,OAAO,QAAQH,CAAa;AACxD,IAAAC,EAAWC,GAAWC,GAAM,EAAI;AACpC,SAAON;AACX;;;;;;;;;;;;;;;;;;;;;;;AC/PA;AAIA,MAAM/D,IAAM,OAAO,CAAC,GAAGC,IAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGsE,KAAM,OAAO,CAAC,GAEjEC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AAE1C,OAAO,CAAC;AAAU,OAAO,EAAE;AAEhC,SAASC,EAAIxE,GAAGkD,GAAG;AACtB,QAAMuB,IAASzE,IAAIkD;AACnB,SAAOuB,KAAU7E,IAAM6E,IAASvB,IAAIuB;AACxC;AAQO,SAASC,GAAIlE,GAAKmE,GAAOC,GAAQ;AACpC,MAAIA,KAAUhF,KAAO+E,IAAQ/E;AACzB,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAIgF,MAAW/E;AACX,WAAOD;AACX,MAAI9E,IAAM+E;AACV,SAAO8E,IAAQ/E;AACX,IAAI+E,IAAQ9E,MACR/E,IAAOA,IAAM0F,IAAOoE,IACxBpE,IAAOA,IAAMA,IAAOoE,GACpBD,MAAU9E;AAEd,SAAO/E;AACX;AAWO,SAAS+J,GAAOC,GAAQF,GAAQ;AACnC,MAAIE,MAAWlF,KAAOgF,KAAUhF;AAC5B,UAAM,IAAI,MAAM,6CAA6CkF,CAAM,QAAQF,CAAM,EAAE;AAIvF,MAAI5E,IAAIwE,EAAIM,GAAQF,CAAM,GACtB1B,IAAI0B,GAEJG,IAAInF,GAAcoF,IAAInF;AAC1B,SAAOG,MAAMJ,KAAK;AAEd,UAAMqF,IAAI/B,IAAIlD,GACR2B,IAAIuB,IAAIlD,GACRkF,IAAIH,IAAIC,IAAIC;AAGlB,IAAA/B,IAAIlD,GAAGA,IAAI2B,GAAGoD,IAAIC,GAAUA,IAAIE;AAAA,EACnC;AAED,MADYhC,MACArD;AACR,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAO2E,EAAIO,GAAGH,CAAM;AACxB;AAIO,SAASO,GAAcC,GAAG;AAM7B,QAAMC,KAAaD,IAAIvF,KAAOC;AAC9B,MAAIwF,GAAGC,GAAGC;AAGV,OAAKF,IAAIF,IAAIvF,GAAK0F,IAAI,GAAGD,IAAIxF,OAAQF,GAAK0F,KAAKxF,IAAKyF;AAChD;AAEJ,OAAKC,IAAI1F,IAAK0F,IAAIJ,KAAKV,GAAIc,GAAGH,GAAWD,CAAC,MAAMA,IAAIvF,GAAK2F;AACrD;AAEJ,MAAID,MAAM,GAAG;AACT,UAAME,KAAUL,IAAIvF,KAAOwE;AAC3B,WAAO,SAAqBqB,GAAIvE,GAAG;AAC/B,YAAMwE,IAAOD,EAAG,IAAIvE,GAAGsE,CAAM;AAC7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAGxE,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAOwE;AAAA,IACnB;AAAA,EACK;AAED,QAAMC,KAAUN,IAAIzF,KAAOC;AAC3B,SAAO,SAAqB4F,GAAIvE,GAAG;AAE/B,QAAIuE,EAAG,IAAIvE,GAAGkE,CAAS,MAAMK,EAAG,IAAIA,EAAG,GAAG;AACtC,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAI/D,IAAI4D,GAEJM,IAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,KAAKF,CAAC,GAAGF,CAAC,GAC/BP,IAAIW,EAAG,IAAIvE,GAAGyE,CAAM,GACpB1C,IAAIwC,EAAG,IAAIvE,GAAGmE,CAAC;AACnB,WAAO,CAACI,EAAG,IAAIxC,GAAGwC,EAAG,GAAG,KAAG;AACvB,UAAIA,EAAG,IAAIxC,GAAGwC,EAAG,IAAI;AACjB,eAAOA,EAAG;AAEd,UAAIR,IAAI;AACR,eAASY,IAAKJ,EAAG,IAAIxC,CAAC,GAAGgC,IAAIvD,KACrB,CAAA+D,EAAG,IAAII,GAAIJ,EAAG,GAAG,GADOR;AAG5B,QAAAY,IAAKJ,EAAG,IAAII,CAAE;AAGlB,YAAMC,IAAKL,EAAG,IAAIG,GAAGhG,KAAO,OAAO8B,IAAIuD,IAAI,CAAC,CAAC;AAC7C,MAAAW,IAAIH,EAAG,IAAIK,CAAE,GACbhB,IAAIW,EAAG,IAAIX,GAAGgB,CAAE,GAChB7C,IAAIwC,EAAG,IAAIxC,GAAG2C,CAAC,GACflE,IAAIuD;AAAA,IACP;AACD,WAAOH;AAAA,EACf;AACA;AACO,SAASiB,GAAOZ,GAAG;AAKtB,MAAIA,IAAIf,OAAQD,IAAK;AAKjB,UAAMqB,KAAUL,IAAIvF,KAAOwE;AAC3B,WAAO,SAAmBqB,GAAIvE,GAAG;AAC7B,YAAMwE,IAAOD,EAAG,IAAIvE,GAAGsE,CAAM;AAE7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAGxE,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAOwE;AAAA,IACnB;AAAA,EACK;AAED,MAAIP,IAAIb,OAAQD,IAAK;AACjB,UAAM2B,KAAMb,IAAId,MAAOC;AACvB,WAAO,SAAmBmB,GAAIvE,GAAG;AAC7B,YAAM+E,IAAKR,EAAG,IAAIvE,GAAGrB,EAAG,GAClBI,IAAIwF,EAAG,IAAIQ,GAAID,CAAE,GACjBE,IAAKT,EAAG,IAAIvE,GAAGjB,CAAC,GAChBC,IAAIuF,EAAG,IAAIA,EAAG,IAAIS,GAAIrG,EAAG,GAAGI,CAAC,GAC7ByF,IAAOD,EAAG,IAAIS,GAAIT,EAAG,IAAIvF,GAAGuF,EAAG,GAAG,CAAC;AACzC,UAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAGxE,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAOwE;AAAA,IACnB;AAAA,EACK;AAwBD,SAAOR,GAAcC,CAAC;AAC1B;AAIA,MAAMgB,KAAe;AAAA,EACjB;AAAA,EAAU;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAClD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAC5B;AACO,SAASC,GAAcC,GAAO;AACjC,QAAMC,IAAU;AAAA,IACZ,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,EACd,GACUC,IAAOJ,GAAa,OAAO,CAACK,GAAK/C,OACnC+C,EAAI/C,CAAG,IAAI,YACJ+C,IACRF,CAAO;AACV,SAAO3C,GAAe0C,GAAOE,CAAI;AACrC;AAEO,SAASE,GAAMC,GAAGnG,GAAKmE,GAAO;AAGjC,MAAIA,IAAQ/E;AACR,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI+E,MAAU/E;AACV,WAAO+G,EAAE;AACb,MAAIhC,MAAU9E;AACV,WAAOW;AACX,MAAIoG,IAAID,EAAE,KACNE,IAAIrG;AACR,SAAOmE,IAAQ/E;AACX,IAAI+E,IAAQ9E,MACR+G,IAAID,EAAE,IAAIC,GAAGC,CAAC,IAClBA,IAAIF,EAAE,IAAIE,CAAC,GACXlC,MAAU9E;AAEd,SAAO+G;AACX;AAEO,SAASE,GAAcH,GAAGI,GAAM;AACnC,QAAMC,IAAM,IAAI,MAAMD,EAAK,MAAM,GAE3BE,IAAiBF,EAAK,OAAO,CAACxK,GAAKiE,GAAK,MACtCmG,EAAE,IAAInG,CAAG,IACFjE,KACXyK,EAAI,CAAC,IAAIzK,GACFoK,EAAE,IAAIpK,GAAKiE,CAAG,IACtBmG,EAAE,GAAG,GAEFO,IAAWP,EAAE,IAAIM,CAAc;AAErC,SAAAF,EAAK,YAAY,CAACxK,GAAKiE,GAAK,MACpBmG,EAAE,IAAInG,CAAG,IACFjE,KACXyK,EAAI,CAAC,IAAIL,EAAE,IAAIpK,GAAKyK,EAAI,CAAC,CAAC,GACnBL,EAAE,IAAIpK,GAAKiE,CAAG,IACtB0G,CAAQ,GACJF;AACX;AAaO,SAASG,GAAQhG,GAAGiG,GAAY;AAEnC,QAAMC,IAAcD,MAAe,SAAYA,IAAajG,EAAE,SAAS,CAAC,EAAE,QACpEmG,IAAc,KAAK,KAAKD,IAAc,CAAC;AAC7C,SAAO,EAAE,YAAYA,GAAa,aAAAC;AACtC;AAaO,SAASC,GAAMC,GAAOrF,GAAQsF,IAAO,IAAOC,IAAQ,IAAI;AAC3D,MAAIF,KAAS5H;AACT,UAAM,IAAI,MAAM,8BAA8B4H,CAAK,EAAE;AACzD,QAAM,EAAE,YAAYG,GAAM,aAAaC,EAAK,IAAKT,GAAQK,GAAOrF,CAAM;AACtE,MAAIyF,IAAQ;AACR,UAAM,IAAI,MAAM,iDAAiD;AACrE,QAAMC,IAAQ7B,GAAOwB,CAAK,GACpBb,IAAI,OAAO,OAAO;AAAA,IACpB,OAAAa;AAAA,IACA,MAAAG;AAAA,IACA,OAAAC;AAAA,IACA,MAAMrF,GAAQoF,CAAI;AAAA,IAClB,MAAM/H;AAAAA,IACN,KAAKC;AAAAA,IACL,QAAQ,CAACW,MAAQgE,EAAIhE,GAAKgH,CAAK;AAAA,IAC/B,SAAS,CAAChH,MAAQ;AACd,UAAI,OAAOA,KAAQ;AACf,cAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE;AAC/E,aAAOZ,KAAOY,KAAOA,IAAMgH;AAAA,IAC9B;AAAA,IACD,KAAK,CAAChH,MAAQA,MAAQZ;AAAAA,IACtB,OAAO,CAACY,OAASA,IAAMX,OAASA;AAAAA,IAChC,KAAK,CAACW,MAAQgE,EAAI,CAAChE,GAAKgH,CAAK;AAAA,IAC7B,KAAK,CAACM,GAAKC,MAAQD,MAAQC;AAAA,IAC3B,KAAK,CAACvH,MAAQgE,EAAIhE,IAAMA,GAAKgH,CAAK;AAAA,IAClC,KAAK,CAACM,GAAKC,MAAQvD,EAAIsD,IAAMC,GAAKP,CAAK;AAAA,IACvC,KAAK,CAACM,GAAKC,MAAQvD,EAAIsD,IAAMC,GAAKP,CAAK;AAAA,IACvC,KAAK,CAACM,GAAKC,MAAQvD,EAAIsD,IAAMC,GAAKP,CAAK;AAAA,IACvC,KAAK,CAAChH,GAAKmE,MAAU+B,GAAMC,GAAGnG,GAAKmE,CAAK;AAAA,IACxC,KAAK,CAACmD,GAAKC,MAAQvD,EAAIsD,IAAMjD,GAAOkD,GAAKP,CAAK,GAAGA,CAAK;AAAA;AAAA,IAEtD,MAAM,CAAChH,MAAQA,IAAMA;AAAA,IACrB,MAAM,CAACsH,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,KAAK,CAACvH,MAAQqE,GAAOrE,GAAKgH,CAAK;AAAA,IAC/B,MAAME,EAAM,SAAS,CAACvG,MAAM0G,EAAMlB,GAAGxF,CAAC;AAAA,IACtC,aAAa,CAAC6G,MAAQlB,GAAcH,GAAGqB,CAAG;AAAA;AAAA;AAAA,IAG1C,MAAM,CAAChI,GAAGkD,GAAG+E,MAAOA,IAAI/E,IAAIlD;AAAA,IAC5B,SAAS,CAACQ,MAASiH,IAAOrG,GAAgBZ,GAAKoH,CAAK,IAAI1G,GAAgBV,GAAKoH,CAAK;AAAA,IAClF,WAAW,CAACvH,MAAU;AAClB,UAAIA,EAAM,WAAWuH;AACjB,cAAM,IAAI,MAAM,0BAA0BA,CAAK,SAASvH,EAAM,MAAM,EAAE;AAC1E,aAAOoH,IAAOxG,GAAgBZ,CAAK,IAAIW,GAAgBX,CAAK;AAAA,IAC/D;AAAA,EACT,CAAK;AACD,SAAO,OAAO,OAAOsG,CAAC;AAC1B;AAwBO,SAASuB,GAAoBC,GAAMC,GAAYX,IAAO,IAAO;AAChE,EAAAU,IAAO7G,EAAY,eAAe6G,CAAI;AACtC,QAAMvF,IAAUuF,EAAK,QACfE,IAASlB,GAAQiB,CAAU,EAAE,cAAc;AACjD,MAAIC,IAAS,MAAMzF,IAAUyF,KAAUzF,IAAU;AAC7C,UAAM,IAAI,MAAM,iCAAiCyF,CAAM,6BAA6BzF,CAAO,EAAE;AACjG,QAAMpC,IAAMiH,IAAOxG,GAAgBkH,CAAI,IAAInH,GAAgBmH,CAAI;AAC/D,SAAO3D,EAAIhE,GAAK4H,IAAavI,CAAG,IAAIA;AACxC;ACvWA;AAIA,MAAMD,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC;AAYb,SAASyI,GAAKL,GAAGM,GAAM;AAC1B,QAAMC,IAAkB,CAACC,GAAWtM,MAAS;AACzC,UAAMuM,IAAMvM,EAAK;AACjB,WAAOsM,IAAYC,IAAMvM;AAAA,EACjC,GACUqK,IAAO,CAACmC,MAAM;AAChB,UAAMC,IAAU,KAAK,KAAKL,IAAOI,CAAC,IAAI,GAChCE,IAAa,MAAMF,IAAI;AAC7B,WAAO,EAAE,SAAAC,GAAS,YAAAC;EAC1B;AACI,SAAO;AAAA,IACH,iBAAAL;AAAA;AAAA,IAEA,aAAaM,GAAK3H,GAAG;AACjB,UAAIyF,IAAIqB,EAAE,MACNpB,IAAIiC;AACR,aAAO3H,IAAIvB;AACP,QAAIuB,IAAItB,OACJ+G,IAAIA,EAAE,IAAIC,CAAC,IACfA,IAAIA,EAAE,UACN1F,MAAMtB;AAEV,aAAO+G;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAWD,iBAAiBkC,GAAKH,GAAG;AACrB,YAAM,EAAE,SAAAC,GAAS,YAAAC,EAAY,IAAGrC,EAAKmC,CAAC,GAChCI,IAAS,CAAA;AACf,UAAInC,IAAIkC,GACJE,IAAOpC;AACX,eAASqC,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,QAAAD,IAAOpC,GACPmC,EAAO,KAAKC,CAAI;AAEhB,iBAAS7I,IAAI,GAAGA,IAAI0I,GAAY1I;AAC5B,UAAA6I,IAAOA,EAAK,IAAIpC,CAAC,GACjBmC,EAAO,KAAKC,CAAI;AAEpB,QAAApC,IAAIoC,EAAK;MACZ;AACD,aAAOD;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,KAAKJ,GAAGO,GAAa/H,GAAG;AAGpB,YAAM,EAAE,SAAAyH,GAAS,YAAAC,EAAY,IAAGrC,EAAKmC,CAAC;AACtC,UAAI/B,IAAIqB,EAAE,MACNtB,IAAIsB,EAAE;AACV,YAAMkB,IAAO,OAAO,KAAKR,IAAI,CAAC,GACxBS,IAAY,KAAKT,GACjBU,IAAU,OAAOV,CAAC;AACxB,eAASM,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,cAAMK,IAASL,IAASJ;AAExB,YAAIU,IAAQ,OAAOpI,IAAIgI,CAAI;AAE3B,QAAAhI,MAAMkI,GAGFE,IAAQV,MACRU,KAASH,GACTjI,KAAKtB;AAST,cAAM2J,IAAUF,GACVG,IAAUH,IAAS,KAAK,IAAIC,CAAK,IAAI,GACrCG,IAAQT,IAAS,MAAM,GACvBU,IAAQJ,IAAQ;AACtB,QAAIA,MAAU,IAEV5C,IAAIA,EAAE,IAAI6B,EAAgBkB,GAAOR,EAAYM,CAAO,CAAC,CAAC,IAGtD5C,IAAIA,EAAE,IAAI4B,EAAgBmB,GAAOT,EAAYO,CAAO,CAAC,CAAC;AAAA,MAE7D;AAMD,aAAO,EAAE,GAAA7C,GAAG,GAAAD;IACf;AAAA,IACD,WAAWvB,GAAGwE,GAAgBzI,GAAG0I,GAAW;AAExC,YAAMlB,IAAIvD,EAAE,gBAAgB;AAE5B,UAAI0E,IAAOF,EAAe,IAAIxE,CAAC;AAC/B,aAAK0E,MACDA,IAAO,KAAK,iBAAiB1E,GAAGuD,CAAC,GAC7BA,MAAM,KACNiB,EAAe,IAAIxE,GAAGyE,EAAUC,CAAI,CAAC,IAGtC,KAAK,KAAKnB,GAAGmB,GAAM3I,CAAC;AAAA,IAC9B;AAAA,EACT;AACA;AACO,SAAS4I,GAAcC,GAAO;AACjC,SAAA3D,GAAc2D,EAAM,EAAE,GACtBpG,GAAeoG,GAAO;AAAA,IAClB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,EACZ,GAAO;AAAA,IACC,YAAY;AAAA,IACZ,aAAa;AAAA,EACrB,CAAK,GAEM,OAAO,OAAO;AAAA,IACjB,GAAG7C,GAAQ6C,EAAM,GAAGA,EAAM,UAAU;AAAA,IACpC,GAAGA;AAAA,IACE,GAAGA,EAAM,GAAG;AAAA,EACzB,CAAK;AACL;AC1JA;AAMA,SAASC,GAAkBD,GAAO;AAC9B,QAAMxD,IAAOuD,GAAcC,CAAK;AAChCE,EAAAA,GAAkB1D,GAAM;AAAA,IACpB,GAAG;AAAA,IACH,GAAG;AAAA,EACX,GAAO;AAAA,IACC,0BAA0B;AAAA,IAC1B,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf,eAAe;AAAA,IACf,oBAAoB;AAAA,IACpB,WAAW;AAAA,IACX,SAAS;AAAA,EACjB,CAAK;AACD,QAAM,EAAE,MAAA2D,GAAM,IAAAzE,GAAI,GAAA1F,EAAC,IAAKwG;AACxB,MAAI2D,GAAM;AACN,QAAI,CAACzE,EAAG,IAAI1F,GAAG0F,EAAG,IAAI;AAClB,YAAM,IAAI,MAAM,mEAAmE;AAEvF,QAAI,OAAOyE,KAAS,YAChB,OAAOA,EAAK,QAAS,YACrB,OAAOA,EAAK,eAAgB;AAC5B,YAAM,IAAI,MAAM,mEAAmE;AAAA,EAE1F;AACD,SAAO,OAAO,OAAO,EAAE,GAAG3D,EAAM,CAAA;AACpC;AAEA,MAAM,EAAE,iBAAiB4D,IAAK,YAAYC,GAAG,IAAKC,IACrCC,KAAM;AAAA;AAAA,EAEf,KAAK,cAAqB,MAAM;AAAA,IAC5B,YAAYrF,IAAI,IAAI;AAChB,YAAMA,CAAC;AAAA,IACV;AAAA,EACJ;AAAA,EACD,UAAUjK,GAAM;AACZ,UAAM,EAAE,KAAKuP,EAAG,IAAGD;AACnB,QAAItP,EAAK,SAAS,KAAKA,EAAK,CAAC,MAAM;AAC/B,YAAM,IAAIuP,EAAE,+BAA+B;AAC/C,UAAM7J,IAAM1F,EAAK,CAAC,GACZH,IAAMG,EAAK,SAAS,GAAG0F,IAAM,CAAC;AACpC,QAAI,CAACA,KAAO7F,EAAI,WAAW6F;AACvB,YAAM,IAAI6J,EAAE,yCAAyC;AAKzD,QAAI1P,EAAI,CAAC,IAAI;AACT,YAAM,IAAI0P,EAAE,qCAAqC;AACrD,QAAI1P,EAAI,CAAC,MAAM,KAAQ,EAAEA,EAAI,CAAC,IAAI;AAC9B,YAAM,IAAI0P,EAAE,qDAAqD;AACrE,WAAO,EAAE,GAAGJ,GAAItP,CAAG,GAAG,GAAGG,EAAK,SAAS0F,IAAM,CAAC;EACjD;AAAA,EACD,MAAML,GAAK;AAEP,UAAM,EAAE,KAAKkK,EAAG,IAAGD,IACbtP,IAAO,OAAOqF,KAAQ,WAAW+J,GAAI/J,CAAG,IAAIA;AAClD,QAAI,EAAErF,aAAgB;AAClB,YAAM,IAAI,MAAM,eAAe;AACnC,QAAIwP,IAAIxP,EAAK;AACb,QAAIwP,IAAI,KAAKxP,EAAK,CAAC,KAAK;AACpB,YAAM,IAAIuP,EAAE,uBAAuB;AACvC,QAAIvP,EAAK,CAAC,MAAMwP,IAAI;AAChB,YAAM,IAAID,EAAE,qCAAqC;AACrD,UAAM,EAAE,GAAG,GAAG,GAAGE,EAAQ,IAAGH,GAAI,UAAUtP,EAAK,SAAS,CAAC,CAAC,GACpD,EAAE,GAAG0P,GAAG,GAAGC,EAAU,IAAKL,GAAI,UAAUG,CAAM;AACpD,QAAIE,EAAW;AACX,YAAM,IAAIJ,EAAE,6CAA6C;AAC7D,WAAO,EAAE,GAAG,GAAAG;EACf;AAAA,EACD,WAAWE,GAAK;AAEZ,UAAMC,IAAQ,CAACH,MAAO,OAAO,SAASA,EAAE,CAAC,GAAG,EAAE,IAAI,IAAS,OAAOA,IAAIA,GAChE1H,IAAI,CAACzC,MAAQ;AACf,YAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,aAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AAAA,IAChD,GACcqK,IAAIG,EAAM7H,EAAE4H,EAAI,CAAC,CAAC,GAClB,IAAIC,EAAM7H,EAAE4H,EAAI,CAAC,CAAC,GAClBE,IAAMJ,EAAE,SAAS,GACjBK,IAAM,EAAE,SAAS,GACjBzH,IAAKN,EAAE8H,CAAG,GACVE,IAAKhI,EAAE+H,CAAG;AAChB,WAAO,KAAK/H,EAAE+H,IAAMD,IAAM,CAAC,CAAC,KAAKE,CAAE,GAAG,CAAC,KAAK1H,CAAE,GAAGoH,CAAC;AAAA,EACrD;AACL,GAGM/K,KAAM,OAAO,CAAC,GAAGC,IAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AAAE,MAACuE,KAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AACjF,SAAS8G,GAAkB1E,GAAM;AACpC,QAAM2E,IAAQlB,GAAkBzD,CAAI,GAC9B,EAAE,IAAAd,EAAI,IAAGyF,GACTC,IAAUD,EAAM,YACjB,CAAClD,GAAGoD,GAAOC,MAAiB;AACzB,UAAMtL,IAAIqL,EAAM;AAChB,WAAOE,EAAe,WAAW,KAAK,CAAC,CAAI,CAAC,GAAG7F,EAAG,QAAQ1F,EAAE,CAAC,GAAG0F,EAAG,QAAQ1F,EAAE,CAAC,CAAC;AAAA,EAC3F,IACUwL,IAAYL,EAAM,cACnB,CAAC9K,MAAU;AAER,UAAMoL,IAAOpL,EAAM,SAAS,CAAC,GAEvB0E,IAAIW,EAAG,UAAU+F,EAAK,SAAS,GAAG/F,EAAG,KAAK,CAAC,GAC3C,IAAIA,EAAG,UAAU+F,EAAK,SAAS/F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,WAAO,EAAE,GAAAX,GAAG;EACxB;AAKI,WAAS2G,EAAoB3G,GAAG;AAC5B,UAAM,EAAE,GAAG,GAAA7B,EAAG,IAAGiI,GACXQ,IAAKjG,EAAG,IAAIX,CAAC,GACb6G,IAAKlG,EAAG,IAAIiG,GAAI5G,CAAC;AACvB,WAAOW,EAAG,IAAIA,EAAG,IAAIkG,GAAIlG,EAAG,IAAIX,GAAG,CAAC,CAAC,GAAG7B,CAAC;AAAA,EAC5C;AAKD,MAAI,CAACwC,EAAG,IAAIA,EAAG,IAAIyF,EAAM,EAAE,GAAGO,EAAoBP,EAAM,EAAE,CAAC;AACvD,UAAM,IAAI,MAAM,6CAA6C;AAEjE,WAASU,EAAmBrL,GAAK;AAC7B,WAAO,OAAOA,KAAQ,YAAYZ,KAAMY,KAAOA,IAAM2K,EAAM;AAAA,EAC9D;AACD,WAASW,EAAStL,GAAK;AACnB,QAAI,CAACqL,EAAmBrL,CAAG;AACvB,YAAM,IAAI,MAAM,6CAA6C;AAAA,EACpE;AAGD,WAASuL,EAAuB1R,GAAK;AACjC,UAAM,EAAE,0BAA0B2R,GAAS,aAAA1E,GAAa,gBAAA2E,GAAgB,GAAA9K,EAAG,IAAGgK;AAC9E,QAAIa,KAAW,OAAO3R,KAAQ,UAAU;AAIpC,UAHIA,aAAe,eACfA,IAAM6R,GAAc7R,CAAG,IAEvB,OAAOA,KAAQ,YAAY,CAAC2R,EAAQ,SAAS3R,EAAI,MAAM;AACvD,cAAM,IAAI,MAAM,aAAa;AACjC,MAAAA,IAAMA,EAAI,SAASiN,IAAc,GAAG,GAAG;AAAA,IAC1C;AACD,QAAI9G;AACJ,QAAI;AACA,MAAAA,IACI,OAAOnG,KAAQ,WACTA,IACA8R,GAAmB7K,EAAY,eAAejH,GAAKiN,CAAW,CAAC;AAAA,IAC5E,QACa;AACV,YAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOjN,CAAG,EAAE;AAAA,IAC/F;AACD,WAAI4R,MACAzL,IAAM4L,EAAQ5L,GAAKW,CAAC,IACxB2K,EAAStL,CAAG,GACLA;AAAA,EACV;AACD,QAAM6L,IAAmB,oBAAI;AAC7B,WAASC,EAAeC,GAAO;AAC3B,QAAI,EAAEA,aAAiBC;AACnB,YAAM,IAAI,MAAM,0BAA0B;AAAA,EACjD;AAAA,EAMD,MAAMA,EAAM;AAAA,IACR,YAAYC,GAAIC,GAAIC,GAAI;AAIpB,UAHA,KAAK,KAAKF,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACNF,KAAM,QAAQ,CAAC/G,EAAG,QAAQ+G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAAChH,EAAG,QAAQgH,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAACjH,EAAG,QAAQiH,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAAA,IACnC;AAAA;AAAA;AAAA,IAGD,OAAO,WAAW/F,GAAG;AACjB,YAAM,EAAE,GAAA7B,GAAG,MAAM6B,KAAK,CAAA;AACtB,UAAI,CAACA,KAAK,CAAClB,EAAG,QAAQX,CAAC,KAAK,CAACW,EAAG,QAAQ,CAAC;AACrC,cAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAIkB,aAAa4F;AACb,cAAM,IAAI,MAAM,8BAA8B;AAClD,YAAMI,IAAM,CAACzM,MAAMuF,EAAG,IAAIvF,GAAGuF,EAAG,IAAI;AAEpC,aAAIkH,EAAI7H,CAAC,KAAK6H,EAAI,CAAC,IACRJ,EAAM,OACV,IAAIA,EAAMzH,GAAG,GAAGW,EAAG,GAAG;AAAA,IAChC;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,WAAWqD,GAAQ;AACtB,YAAM8D,IAAQnH,EAAG,YAAYqD,EAAO,IAAI,CAACnC,MAAMA,EAAE,EAAE,CAAC;AACpD,aAAOmC,EAAO,IAAI,CAACnC,GAAGzG,MAAMyG,EAAE,SAASiG,EAAM1M,CAAC,CAAC,CAAC,EAAE,IAAIqM,EAAM,UAAU;AAAA,IACzE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,QAAQlM,GAAK;AAChB,YAAM8E,IAAIoH,EAAM,WAAWhB,EAAUlK,EAAY,YAAYhB,CAAG,CAAC,CAAC;AAClE,aAAA8E,EAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,OAAO,eAAe0H,GAAY;AAC9B,aAAON,EAAM,KAAK,SAAST,EAAuBe,CAAU,CAAC;AAAA,IAChE;AAAA;AAAA,IAED,eAAejE,GAAY;AACvB,WAAK,eAAeA,GACpBwD,EAAiB,OAAO,IAAI;AAAA,IAC/B;AAAA;AAAA,IAED,iBAAiB;AAEb,UAAI,KAAK,OAAO;AACZ,YAAIlB,EAAM;AACN;AACJ,cAAM,IAAI,MAAM,iBAAiB;AAAA,MACpC;AAED,YAAM,EAAE,GAAApG,GAAG,GAAAgI,EAAG,IAAG,KAAK,SAAQ;AAE9B,UAAI,CAACrH,EAAG,QAAQX,CAAC,KAAK,CAACW,EAAG,QAAQqH,CAAC;AAC/B,cAAM,IAAI,MAAM,0BAA0B;AAC9C,YAAMC,IAAOtH,EAAG,IAAIqH,CAAC,GACfE,IAAQvB,EAAoB3G,CAAC;AACnC,UAAI,CAACW,EAAG,IAAIsH,GAAMC,CAAK;AACnB,cAAM,IAAI,MAAM,mCAAmC;AACvD,UAAI,CAAC,KAAK,cAAe;AACrB,cAAM,IAAI,MAAM,wCAAwC;AAAA,IAC/D;AAAA,IACD,WAAW;AACP,YAAM,EAAE,GAAAF,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAIrH,EAAG;AACH,eAAO,CAACA,EAAG,MAAMqH,CAAC;AACtB,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAChD;AAAA;AAAA;AAAA;AAAA,IAID,OAAOR,GAAO;AACV,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB,GAC7BiB,IAAK9H,EAAG,IAAIA,EAAG,IAAIwH,GAAIK,CAAE,GAAG7H,EAAG,IAAI2H,GAAID,CAAE,CAAC,GAC1CK,IAAK/H,EAAG,IAAIA,EAAG,IAAIyH,GAAII,CAAE,GAAG7H,EAAG,IAAI4H,GAAIF,CAAE,CAAC;AAChD,aAAOI,KAAMC;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AACL,aAAO,IAAIjB,EAAM,KAAK,IAAI9G,EAAG,IAAI,KAAK,EAAE,GAAG,KAAK,EAAE;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS;AACL,YAAM,EAAE,GAAG,GAAAxC,EAAG,IAAGiI,GACXuC,IAAKhI,EAAG,IAAIxC,GAAGkB,EAAG,GAClB,EAAE,IAAI8I,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG;AACnC,UAAIO,IAAKjI,EAAG,MAAMkI,IAAKlI,EAAG,MAAMmI,IAAKnI,EAAG,MACpCoI,IAAKpI,EAAG,IAAIwH,GAAIA,CAAE,GAClBa,IAAKrI,EAAG,IAAIyH,GAAIA,CAAE,GAClBrH,IAAKJ,EAAG,IAAI0H,GAAIA,CAAE,GAClBY,IAAKtI,EAAG,IAAIwH,GAAIC,CAAE;AACtB,aAAAa,IAAKtI,EAAG,IAAIsI,GAAIA,CAAE,GAClBH,IAAKnI,EAAG,IAAIwH,GAAIE,CAAE,GAClBS,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GAClBF,IAAKjI,EAAG,IAAI,GAAGmI,CAAE,GACjBD,IAAKlI,EAAG,IAAIgI,GAAI5H,CAAE,GAClB8H,IAAKlI,EAAG,IAAIiI,GAAIC,CAAE,GAClBD,IAAKjI,EAAG,IAAIqI,GAAIH,CAAE,GAClBA,IAAKlI,EAAG,IAAIqI,GAAIH,CAAE,GAClBA,IAAKlI,EAAG,IAAIiI,GAAIC,CAAE,GAClBD,IAAKjI,EAAG,IAAIsI,GAAIL,CAAE,GAClBE,IAAKnI,EAAG,IAAIgI,GAAIG,CAAE,GAClB/H,IAAKJ,EAAG,IAAI,GAAGI,CAAE,GACjBkI,IAAKtI,EAAG,IAAIoI,GAAIhI,CAAE,GAClBkI,IAAKtI,EAAG,IAAI,GAAGsI,CAAE,GACjBA,IAAKtI,EAAG,IAAIsI,GAAIH,CAAE,GAClBA,IAAKnI,EAAG,IAAIoI,GAAIA,CAAE,GAClBA,IAAKpI,EAAG,IAAImI,GAAIC,CAAE,GAClBA,IAAKpI,EAAG,IAAIoI,GAAIhI,CAAE,GAClBgI,IAAKpI,EAAG,IAAIoI,GAAIE,CAAE,GAClBJ,IAAKlI,EAAG,IAAIkI,GAAIE,CAAE,GAClBhI,IAAKJ,EAAG,IAAIyH,GAAIC,CAAE,GAClBtH,IAAKJ,EAAG,IAAII,GAAIA,CAAE,GAClBgI,IAAKpI,EAAG,IAAII,GAAIkI,CAAE,GAClBL,IAAKjI,EAAG,IAAIiI,GAAIG,CAAE,GAClBD,IAAKnI,EAAG,IAAII,GAAIiI,CAAE,GAClBF,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GAClBA,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GACX,IAAIrB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAItB,GAAO;AACP,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB;AACnC,UAAIoB,IAAKjI,EAAG,MAAMkI,IAAKlI,EAAG,MAAMmI,IAAKnI,EAAG;AACxC,YAAM1F,IAAImL,EAAM,GACVuC,IAAKhI,EAAG,IAAIyF,EAAM,GAAG/G,EAAG;AAC9B,UAAI0J,IAAKpI,EAAG,IAAIwH,GAAIG,CAAE,GAClBU,IAAKrI,EAAG,IAAIyH,GAAIG,CAAE,GAClBxH,IAAKJ,EAAG,IAAI0H,GAAIG,CAAE,GAClBS,KAAKtI,EAAG,IAAIwH,GAAIC,CAAE,GAClBc,IAAKvI,EAAG,IAAI2H,GAAIC,CAAE;AACtB,MAAAU,KAAKtI,EAAG,IAAIsI,IAAIC,CAAE,GAClBA,IAAKvI,EAAG,IAAIoI,GAAIC,CAAE,GAClBC,KAAKtI,EAAG,IAAIsI,IAAIC,CAAE,GAClBA,IAAKvI,EAAG,IAAIwH,GAAIE,CAAE;AAClB,UAAIc,IAAKxI,EAAG,IAAI2H,GAAIE,CAAE;AACtB,aAAAU,IAAKvI,EAAG,IAAIuI,GAAIC,CAAE,GAClBA,IAAKxI,EAAG,IAAIoI,GAAIhI,CAAE,GAClBmI,IAAKvI,EAAG,IAAIuI,GAAIC,CAAE,GAClBA,IAAKxI,EAAG,IAAIyH,GAAIC,CAAE,GAClBO,IAAKjI,EAAG,IAAI4H,GAAIC,CAAE,GAClBW,IAAKxI,EAAG,IAAIwI,GAAIP,CAAE,GAClBA,IAAKjI,EAAG,IAAIqI,GAAIjI,CAAE,GAClBoI,IAAKxI,EAAG,IAAIwI,GAAIP,CAAE,GAClBE,IAAKnI,EAAG,IAAI1F,GAAGiO,CAAE,GACjBN,IAAKjI,EAAG,IAAIgI,GAAI5H,CAAE,GAClB+H,IAAKnI,EAAG,IAAIiI,GAAIE,CAAE,GAClBF,IAAKjI,EAAG,IAAIqI,GAAIF,CAAE,GAClBA,IAAKnI,EAAG,IAAIqI,GAAIF,CAAE,GAClBD,IAAKlI,EAAG,IAAIiI,GAAIE,CAAE,GAClBE,IAAKrI,EAAG,IAAIoI,GAAIA,CAAE,GAClBC,IAAKrI,EAAG,IAAIqI,GAAID,CAAE,GAClBhI,IAAKJ,EAAG,IAAI1F,GAAG8F,CAAE,GACjBmI,IAAKvI,EAAG,IAAIgI,GAAIO,CAAE,GAClBF,IAAKrI,EAAG,IAAIqI,GAAIjI,CAAE,GAClBA,IAAKJ,EAAG,IAAIoI,GAAIhI,CAAE,GAClBA,IAAKJ,EAAG,IAAI1F,GAAG8F,CAAE,GACjBmI,IAAKvI,EAAG,IAAIuI,GAAInI,CAAE,GAClBgI,IAAKpI,EAAG,IAAIqI,GAAIE,CAAE,GAClBL,IAAKlI,EAAG,IAAIkI,GAAIE,CAAE,GAClBA,IAAKpI,EAAG,IAAIwI,GAAID,CAAE,GAClBN,IAAKjI,EAAG,IAAIsI,IAAIL,CAAE,GAClBA,IAAKjI,EAAG,IAAIiI,GAAIG,CAAE,GAClBA,IAAKpI,EAAG,IAAIsI,IAAID,CAAE,GAClBF,IAAKnI,EAAG,IAAIwI,GAAIL,CAAE,GAClBA,IAAKnI,EAAG,IAAImI,GAAIC,CAAE,GACX,IAAItB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA,IACD,SAAStB,GAAO;AACZ,aAAO,KAAK,IAAIA,EAAM,OAAQ,CAAA;AAAA,IACjC;AAAA,IACD,MAAM;AACF,aAAO,KAAK,OAAOC,EAAM,IAAI;AAAA,IAChC;AAAA,IACD,KAAKrL,GAAG;AACJ,aAAOgN,EAAK,WAAW,MAAM9B,GAAkBlL,GAAG,CAAC2I,MAAS;AACxD,cAAM+C,IAAQnH,EAAG,YAAYoE,EAAK,IAAI,CAAClD,MAAMA,EAAE,EAAE,CAAC;AAClD,eAAOkD,EAAK,IAAI,CAAClD,GAAGzG,MAAMyG,EAAE,SAASiG,EAAM1M,CAAC,CAAC,CAAC,EAAE,IAAIqM,EAAM,UAAU;AAAA,MACpF,CAAa;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,eAAerL,GAAG;AACd,YAAMiN,IAAI5B,EAAM;AAChB,UAAIrL,MAAMvB;AACN,eAAOwO;AAEX,UADAtC,EAAS3K,CAAC,GACNA,MAAMtB;AACN,eAAO;AACX,YAAM,EAAE,MAAAsK,EAAM,IAAGgB;AACjB,UAAI,CAAChB;AACD,eAAOgE,EAAK,aAAa,MAAMhN,CAAC;AAEpC,UAAI,EAAE,OAAAkN,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKrE,EAAK,YAAYhJ,CAAC,GAC7CsN,IAAML,GACNM,IAAMN,GACNvH,IAAI;AACR,aAAOyH,IAAK1O,MAAO4O,IAAK5O;AACpB,QAAI0O,IAAKzO,MACL4O,IAAMA,EAAI,IAAI5H,CAAC,IACf2H,IAAK3O,MACL6O,IAAMA,EAAI,IAAI7H,CAAC,IACnBA,IAAIA,EAAE,UACNyH,MAAOzO,GACP2O,MAAO3O;AAEX,aAAIwO,MACAI,IAAMA,EAAI,WACVF,MACAG,IAAMA,EAAI,WACdA,IAAM,IAAIlC,EAAM9G,EAAG,IAAIgJ,EAAI,IAAIvE,EAAK,IAAI,GAAGuE,EAAI,IAAIA,EAAI,EAAE,GAClDD,EAAI,IAAIC,CAAG;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,SAASC,GAAQ;AACb,MAAA7C,EAAS6C,CAAM;AACf,UAAIxN,IAAIwN,GACJtD,GAAOuD;AACX,YAAM,EAAE,MAAAzE,EAAM,IAAGgB;AACjB,UAAIhB,GAAM;AACN,cAAM,EAAE,OAAAkE,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKrE,EAAK,YAAYhJ,CAAC;AACnD,YAAI,EAAE,GAAGsN,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKP,CAAE,GACjC,EAAE,GAAGI,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKN,CAAE;AACrC,QAAAC,IAAMN,EAAK,gBAAgBE,GAAOI,CAAG,GACrCC,IAAMP,EAAK,gBAAgBI,GAAOG,CAAG,GACrCA,IAAM,IAAIlC,EAAM9G,EAAG,IAAIgJ,EAAI,IAAIvE,EAAK,IAAI,GAAGuE,EAAI,IAAIA,EAAI,EAAE,GACzDrD,IAAQoD,EAAI,IAAIC,CAAG,GACnBE,IAAOC,EAAI,IAAIC,CAAG;AAAA,MACrB,OACI;AACD,cAAM,EAAE,GAAAlI,GAAG,GAAAD,EAAC,IAAK,KAAK,KAAKxF,CAAC;AAC5B,QAAAkK,IAAQzE,GACRgI,IAAOjI;AAAA,MACV;AAED,aAAO6F,EAAM,WAAW,CAACnB,GAAOuD,CAAI,CAAC,EAAE,CAAC;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,qBAAqBtJ,GAAGtF,GAAGkD,GAAG;AAC1B,YAAM6L,IAAIvC,EAAM,MACVwC,IAAM,CAAC5J,GAAGpF,MACVA,MAAMJ,MAAOI,MAAMH,KAAO,CAACuF,EAAE,OAAO2J,CAAC,IAAI3J,EAAE,eAAepF,CAAC,IAAIoF,EAAE,SAASpF,CAAC,GAC3E4B,IAAMoN,EAAI,MAAMhP,CAAC,EAAE,IAAIgP,EAAI1J,GAAGpC,CAAC,CAAC;AACtC,aAAOtB,EAAI,QAAQ,SAAYA;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAID,SAASqN,GAAI;AACT,YAAM,EAAE,IAAIlK,GAAG,IAAI,GAAG,IAAImK,EAAG,IAAG,MAC1BtC,IAAM,KAAK;AAGjB,MAAIqC,KAAM,SACNA,IAAKrC,IAAMlH,EAAG,MAAMA,EAAG,IAAIwJ,CAAC;AAChC,YAAMC,IAAKzJ,EAAG,IAAIX,GAAGkK,CAAE,GACjBG,IAAK1J,EAAG,IAAI,GAAGuJ,CAAE,GACjBI,IAAK3J,EAAG,IAAIwJ,GAAGD,CAAE;AACvB,UAAIrC;AACA,eAAO,EAAE,GAAGlH,EAAG,MAAM,GAAGA,EAAG;AAC/B,UAAI,CAACA,EAAG,IAAI2J,GAAI3J,EAAG,GAAG;AAClB,cAAM,IAAI,MAAM,kBAAkB;AACtC,aAAO,EAAE,GAAGyJ,GAAI,GAAGC,EAAE;AAAA,IACxB;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAGE,GAAU,eAAAC,EAAa,IAAKpE;AACvC,UAAImE,MAAazP;AACb,eAAO;AACX,UAAI0P;AACA,eAAOA,EAAc/C,GAAO,IAAI;AACpC,YAAM,IAAI,MAAM,8DAA8D;AAAA,IACjF;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAG8C,GAAU,eAAAE,EAAa,IAAKrE;AACvC,aAAImE,MAAazP,IACN,OACP2P,IACOA,EAAchD,GAAO,IAAI,IAC7B,KAAK,eAAerB,EAAM,CAAC;AAAA,IACrC;AAAA,IACD,WAAWG,IAAe,IAAM;AAC5B,kBAAK,eAAc,GACZF,EAAQoB,GAAO,MAAMlB,CAAY;AAAA,IAC3C;AAAA,IACD,MAAMA,IAAe,IAAM;AACvB,aAAOY,GAAc,KAAK,WAAWZ,CAAY,CAAC;AAAA,IACrD;AAAA,EACJ;AACD,EAAAkB,EAAM,OAAO,IAAIA,EAAMrB,EAAM,IAAIA,EAAM,IAAIzF,EAAG,GAAG,GACjD8G,EAAM,OAAO,IAAIA,EAAM9G,EAAG,MAAMA,EAAG,KAAKA,EAAG,IAAI;AAC/C,QAAM+J,IAAQtE,EAAM,YACdgD,IAAO7F,GAAKkE,GAAOrB,EAAM,OAAO,KAAK,KAAKsE,IAAQ,CAAC,IAAIA,CAAK;AAElE,SAAO;AAAA,IACH,OAAAtE;AAAA,IACA,iBAAiBqB;AAAA,IACjB,wBAAAT;AAAA,IACA,qBAAAL;AAAA,IACA,oBAAAG;AAAA,EACR;AACA;AACA,SAAS6D,GAAa1F,GAAO;AACzB,QAAMxD,IAAOuD,GAAcC,CAAK;AAChCE,SAAAA,GAAkB1D,GAAM;AAAA,IACpB,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,EACrB,GAAO;AAAA,IACC,UAAU;AAAA,IACV,eAAe;AAAA,IACf,MAAM;AAAA,EACd,CAAK,GACM,OAAO,OAAO,EAAE,MAAM,IAAM,GAAGA,EAAI,CAAE;AAChD;AACO,SAASmJ,GAAYC,GAAU;AAClC,QAAMzE,IAAQuE,GAAaE,CAAQ,GAC7B,EAAE,IAAAlK,GAAI,GAAGmK,EAAW,IAAK1E,GACzB2E,IAAgBpK,EAAG,QAAQ,GAC3BqK,IAAkB,IAAIrK,EAAG,QAAQ;AACvC,WAASsK,EAAoBxP,GAAK;AAC9B,WAAOZ,KAAMY,KAAOA,IAAMkF,EAAG;AAAA,EAChC;AACD,WAASuK,EAAKjQ,GAAG;AACb,WAAOoM,EAAQpM,GAAG6P,CAAW;AAAA,EAChC;AACD,WAASK,EAAKlQ,GAAG;AACb,WAAOmQ,GAAWnQ,GAAG6P,CAAW;AAAA,EACnC;AACD,QAAM,EAAE,iBAAiBrD,GAAO,wBAAAT,GAAwB,qBAAAL,GAAqB,oBAAAG,EAAqB,IAAGX,GAAkB;AAAA,IACnH,GAAGC;AAAA,IACH,QAAQlD,GAAGoD,GAAOC,GAAc;AAC5B,YAAMtL,IAAIqL,EAAM,YACVtG,IAAIW,EAAG,QAAQ1F,EAAE,CAAC,GAClBoQ,IAAM7E;AACZ,aAAID,IACO8E,EAAI,WAAW,KAAK,CAAC/E,EAAM,SAAU,IAAG,IAAO,CAAI,CAAC,GAAGtG,CAAC,IAGxDqL,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,GAAGrL,GAAGW,EAAG,QAAQ1F,EAAE,CAAC,CAAC;AAAA,IAE7D;AAAA,IACD,UAAUK,GAAO;AACb,YAAMM,IAAMN,EAAM,QACZgQ,IAAOhQ,EAAM,CAAC,GACdoL,IAAOpL,EAAM,SAAS,CAAC;AAE7B,UAAIM,MAAQmP,MAAkBO,MAAS,KAAQA,MAAS,IAAO;AAC3D,cAAMtL,IAAIoH,GAAmBV,CAAI;AACjC,YAAI,CAACuE,EAAoBjL,CAAC;AACtB,gBAAM,IAAI,MAAM,uBAAuB;AAC3C,cAAMuL,IAAK5E,EAAoB3G,CAAC;AAChC,YAAIgI,IAAIrH,EAAG,KAAK4K,CAAE;AAClB,cAAMC,KAAUxD,IAAIlN,OAASA;AAG7B,gBADmBwQ,IAAO,OAAO,MACfE,MACdxD,IAAIrH,EAAG,IAAIqH,CAAC,IACT,EAAE,GAAAhI,GAAG,GAAAgI;MACf,WACQpM,MAAQoP,KAAmBM,MAAS,GAAM;AAC/C,cAAMtL,IAAIW,EAAG,UAAU+F,EAAK,SAAS,GAAG/F,EAAG,KAAK,CAAC,GAC3CqH,IAAIrH,EAAG,UAAU+F,EAAK,SAAS/F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,eAAO,EAAE,GAAAX,GAAG,GAAAgI;MACf;AAEG,cAAM,IAAI,MAAM,mBAAmBpM,CAAG,0BAA0BmP,CAAa,wBAAwBC,CAAe,qBAAqB;AAAA,IAEhJ;AAAA,EACT,CAAK,GACKS,IAAgB,CAAChQ,MAAQ0L,GAAcuE,GAAmBjQ,GAAK2K,EAAM,WAAW,CAAC;AACvF,WAASuF,EAAsB5L,GAAQ;AACnC,UAAM6L,IAAOd,KAAehQ;AAC5B,WAAOiF,IAAS6L;AAAA,EACnB;AACD,WAASC,EAAWjG,GAAG;AACnB,WAAO+F,EAAsB/F,CAAC,IAAIsF,EAAK,CAACtF,CAAC,IAAIA;AAAA,EAChD;AAED,QAAMkG,IAAS,CAAC3N,GAAG4N,GAAMC,MAAO5E,GAAmBjJ,EAAE,MAAM4N,GAAMC,CAAE,CAAC;AAAA,EAIpE,MAAMC,EAAU;AAAA,IACZ,YAAYrP,GAAGgJ,GAAGsG,GAAU;AACxB,WAAK,IAAItP,GACT,KAAK,IAAIgJ,GACT,KAAK,WAAWsG,GAChB,KAAK,eAAc;AAAA,IACtB;AAAA;AAAA,IAED,OAAO,YAAY3Q,GAAK;AACpB,YAAMmK,IAAIU,EAAM;AAChB,aAAA7K,IAAMgB,EAAY,oBAAoBhB,GAAKmK,IAAI,CAAC,GACzC,IAAIuG,EAAUH,EAAOvQ,GAAK,GAAGmK,CAAC,GAAGoG,EAAOvQ,GAAKmK,GAAG,IAAIA,CAAC,CAAC;AAAA,IAChE;AAAA;AAAA;AAAA,IAGD,OAAO,QAAQnK,GAAK;AAChB,YAAM,EAAE,GAAAqB,GAAG,GAAAgJ,EAAC,IAAKJ,GAAI,MAAMjJ,EAAY,OAAOhB,CAAG,CAAC;AAClD,aAAO,IAAI0Q,EAAUrP,GAAGgJ,CAAC;AAAA,IAC5B;AAAA,IACD,iBAAiB;AAEb,UAAI,CAACkB,EAAmB,KAAK,CAAC;AAC1B,cAAM,IAAI,MAAM,2BAA2B;AAC/C,UAAI,CAACA,EAAmB,KAAK,CAAC;AAC1B,cAAM,IAAI,MAAM,2BAA2B;AAAA,IAClD;AAAA,IACD,eAAeoF,GAAU;AACrB,aAAO,IAAID,EAAU,KAAK,GAAG,KAAK,GAAGC,CAAQ;AAAA,IAChD;AAAA,IACD,iBAAiBC,GAAS;AACtB,YAAM,EAAE,GAAAvP,GAAG,GAAAgJ,GAAG,UAAUwG,EAAG,IAAK,MAC1BlO,IAAImO,EAAc9P,EAAY,WAAW4P,CAAO,CAAC;AACvD,UAAIC,KAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG;AACzC,cAAM,IAAI,MAAM,qBAAqB;AACzC,YAAME,IAAOF,MAAQ,KAAKA,MAAQ,IAAIxP,IAAIwJ,EAAM,IAAIxJ;AACpD,UAAI0P,KAAQ3L,EAAG;AACX,cAAM,IAAI,MAAM,4BAA4B;AAChD,YAAM4L,IAAUH,IAAM,IAAkB,OAAP,MAC3BI,KAAI/E,EAAM,QAAQ8E,IAASd,EAAca,CAAI,CAAC,GAC9CG,KAAKtB,EAAKmB,CAAI,GACdI,KAAKxB,EAAK,CAAChN,IAAIuO,EAAE,GACjBE,KAAKzB,EAAKtF,IAAI6G,EAAE,GAChBlM,KAAIkH,EAAM,KAAK,qBAAqB+E,IAAGE,IAAIC,EAAE;AACnD,UAAI,CAACpM;AACD,cAAM,IAAI,MAAM,mBAAmB;AACvC,aAAAA,GAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,WAAW;AACP,aAAOoL,EAAsB,KAAK,CAAC;AAAA,IACtC;AAAA,IACD,aAAa;AACT,aAAO,KAAK,SAAQ,IAAK,IAAIM,EAAU,KAAK,GAAGf,EAAK,CAAC,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;AAAA,IAClF;AAAA;AAAA,IAED,gBAAgB;AACZ,aAAO0B,GAAc,KAAK,SAAQ,CAAE;AAAA,IACvC;AAAA,IACD,WAAW;AACP,aAAOpH,GAAI,WAAW,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAC,CAAE;AAAA,IACjD;AAAA;AAAA,IAED,oBAAoB;AAChB,aAAOoH,GAAc,KAAK,aAAY,CAAE;AAAA,IAC3C;AAAA,IACD,eAAe;AACX,aAAOnB,EAAc,KAAK,CAAC,IAAIA,EAAc,KAAK,CAAC;AAAA,IACtD;AAAA,EACJ;AACD,QAAMoB,IAAQ;AAAA,IACV,kBAAkB9E,GAAY;AAC1B,UAAI;AACA,eAAAf,EAAuBe,CAAU,GAC1B;AAAA,MACV,QACa;AACV,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,IACD,wBAAwBf;AAAA;AAAA;AAAA;AAAA;AAAA,IAKxB,kBAAkB,MAAM;AACpB,YAAM8F,IAAO1G,EAAM,YAAYzF,EAAG,QAAQ,CAAC,GACrClF,IAAMsR,GAAwBD,GAAMhC,CAAW;AACrD,aAAOY,GAAmBjQ,GAAK2K,EAAM,WAAW;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,WAAWtC,IAAa,GAAGwC,IAAQmB,EAAM,MAAM;AAC3C,aAAAnB,EAAM,eAAexC,CAAU,GAC/BwC,EAAM,SAAS,OAAO,CAAC,CAAC,GACjBA;AAAA,IACV;AAAA,EACT;AAOI,WAAS0G,EAAajF,GAAYxB,IAAe,IAAM;AACnD,WAAOkB,EAAM,eAAeM,CAAU,EAAE,WAAWxB,CAAY;AAAA,EAClE;AAID,WAAS0G,EAAU7V,GAAM;AACrB,UAAMuG,IAAMvG,aAAgB,YACtB+F,IAAM,OAAO/F,KAAS,UACtBwE,KAAO+B,KAAOR,MAAQ/F,EAAK;AACjC,WAAIuG,IACO/B,MAAQmP,KAAiBnP,MAAQoP,IACxC7N,IACOvB,MAAQ,IAAImP,KAAiBnP,MAAQ,IAAIoP,IAChD5T,aAAgBqQ;AAAA,EAGvB;AAWD,WAASyF,EAAgBC,GAAUC,GAAS7G,IAAe,IAAM;AAC7D,QAAI0G,EAAUE,CAAQ;AAClB,YAAM,IAAI,MAAM,+BAA+B;AACnD,QAAI,CAACF,EAAUG,CAAO;AAClB,YAAM,IAAI,MAAM,+BAA+B;AAEnD,WADU3F,EAAM,QAAQ2F,CAAO,EACtB,SAASpG,EAAuBmG,CAAQ,CAAC,EAAE,WAAW5G,CAAY;AAAA,EAC9E;AAKD,QAAM8G,IAAWjH,EAAM,YACnB,SAAU9K,GAAO;AAGb,UAAMG,IAAM2L,GAAmB9L,CAAK,GAC9BgS,IAAQhS,EAAM,SAAS,IAAI8K,EAAM;AACvC,WAAOkH,IAAQ,IAAI7R,KAAO,OAAO6R,CAAK,IAAI7R;AAAA,EACtD,GACU4Q,IAAgBjG,EAAM,iBACxB,SAAU9K,GAAO;AACb,WAAO4P,EAAKmC,EAAS/R,CAAK,CAAC;AAAA,EACvC,GAEUiS,IAAaC,GAAWpH,EAAM,UAAU;AAI9C,WAASqH,EAAWhS,GAAK;AACrB,QAAI,OAAOA,KAAQ;AACf,YAAM,IAAI,MAAM,iBAAiB;AACrC,QAAI,EAAEZ,MAAOY,KAAOA,IAAM8R;AACtB,YAAM,IAAI,MAAM,uBAAuBnH,EAAM,UAAU,EAAE;AAE7D,WAAOsF,GAAmBjQ,GAAK2K,EAAM,WAAW;AAAA,EACnD;AAMD,WAASsH,EAAQvB,GAASpE,GAAYtG,IAAOkM,GAAgB;AACzD,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAAC3P,OAAMA,MAAKyD,CAAI;AAChD,YAAM,IAAI,MAAM,qCAAqC;AACzD,UAAM,EAAE,MAAA2B,GAAM,aAAAwK,EAAa,IAAGxH;AAC9B,QAAI,EAAE,MAAAyH,GAAM,SAAAC,GAAS,cAAcC,EAAG,IAAKtM;AAC3C,IAAIoM,KAAQ,SACRA,IAAO,KACX1B,IAAU5P,EAAY,WAAW4P,CAAO,GACpC2B,MACA3B,IAAU5P,EAAY,qBAAqB6G,EAAK+I,CAAO,CAAC;AAI5D,UAAM6B,KAAQ3B,EAAcF,CAAO,GAC7BrK,KAAIkF,EAAuBe,CAAU,GACrCkG,KAAW,CAACR,EAAW3L,EAAC,GAAG2L,EAAWO,EAAK,CAAC;AAElD,QAAID,KAAO,MAAM;AAEb,YAAMhU,KAAIgU,MAAQ,KAAOH,EAAYjN,EAAG,KAAK,IAAIoN;AACjD,MAAAE,GAAS,KAAK1R,EAAY,gBAAgBxC,IAAG4G,EAAG,KAAK,CAAC;AAAA,IACzD;AACD,UAAMtC,KAAOmI,EAAe,GAAGyH,EAAQ,GACjC9N,KAAI6N;AAEV,aAASE,GAAMC,IAAQ;AAEnB,YAAMnQ,KAAIqP,EAASc,EAAM;AACzB,UAAI,CAACrH,EAAmB9I,EAAC;AACrB;AACJ,YAAMoQ,KAAKjD,EAAKnN,EAAC,GACXkC,KAAIuH,EAAM,KAAK,SAASzJ,EAAC,EAAE,YAC3BpB,IAAIsO,EAAKhL,GAAE,CAAC;AAClB,UAAItD,MAAM/B;AACN;AAIJ,YAAM+K,KAAIsF,EAAKkD,KAAKlD,EAAK/K,KAAIvD,IAAIkF,EAAC,CAAC;AACnC,UAAI8D,OAAM/K;AACN;AACJ,UAAIqR,MAAYhM,GAAE,MAAMtD,IAAI,IAAI,KAAK,OAAOsD,GAAE,IAAIpF,CAAG,GACjDuT,KAAQzI;AACZ,aAAIiI,KAAQlC,EAAsB/F,EAAC,MAC/ByI,KAAQxC,EAAWjG,EAAC,GACpBsG,MAAY,IAET,IAAID,EAAUrP,GAAGyR,IAAOnC,EAAQ;AAAA,IAC1C;AACD,WAAO,EAAE,MAAA7N,IAAM,OAAA6P;EAClB;AACD,QAAMP,IAAiB,EAAE,MAAMvH,EAAM,MAAM,SAAS,MAC9CkI,IAAiB,EAAE,MAAMlI,EAAM,MAAM,SAAS;AAcpD,WAASmI,EAAKpC,GAASqC,GAAS/M,IAAOkM,GAAgB;AACnD,UAAM,EAAE,MAAAtP,GAAM,OAAA6P,EAAO,IAAGR,EAAQvB,GAASqC,GAAS/M,CAAI,GAChDgN,IAAIrI;AAEV,WADasI,GAAkBD,EAAE,KAAK,WAAWA,EAAE,aAAaA,EAAE,IAAI,EAC1DpQ,GAAM6P,CAAK;AAAA,EAC1B;AAED,EAAAzG,EAAM,KAAK,eAAe,CAAC;AAe3B,WAASkH,GAAOC,GAAWzC,GAAS0C,GAAWpN,IAAO6M,GAAgB;;AAClE,UAAMQ,IAAKF;AAGX,QAFAzC,IAAU5P,EAAY,WAAW4P,CAAO,GACxC0C,IAAYtS,EAAY,aAAasS,CAAS,GAC1C,YAAYpN;AACZ,YAAM,IAAI,MAAM,oCAAoC;AACxD,UAAM,EAAE,MAAAoM,GAAM,SAAAC,EAAS,IAAGrM;AAC1B,QAAIsN,GACA1O;AACJ,QAAI;AACA,UAAI,OAAOyO,KAAO,YAAYA,aAAc;AAGxC,YAAI;AACA,UAAAC,IAAO9C,EAAU,QAAQ6C,CAAE;AAAA,QAC9B,SACME,GAAU;AACb,cAAI,EAAEA,aAAoBxJ,GAAI;AAC1B,kBAAMwJ;AACV,UAAAD,IAAO9C,EAAU,YAAY6C,CAAE;AAAA,QAClC;AAAA,eAEI,OAAOA,KAAO,YAAY,OAAOA,EAAG,KAAM,YAAY,OAAOA,EAAG,KAAM,UAAU;AACrF,cAAM,EAAE,GAAAlS,GAAG,GAAAgJ,GAAG,IAAGkJ;AACjB,QAAAC,IAAO,IAAI9C,EAAUrP,GAAGgJ,EAAC;AAAA,MAC5B;AAEG,cAAM,IAAI,MAAM,OAAO;AAE3B,MAAAvF,KAAIoH,EAAM,QAAQoH,CAAS;AAAA,IAC9B,SACMI,GAAO;AACV,UAAIA,EAAM,YAAY;AAClB,cAAM,IAAI,MAAM,gEAAgE;AACpF,aAAO;AAAA,IACV;AACD,QAAIpB,KAAQkB,EAAK,SAAU;AACvB,aAAO;AACX,IAAIjB,MACA3B,IAAU/F,EAAM,KAAK+F,CAAO;AAChC,UAAM,EAAE,GAAAvP,IAAG,GAAAgJ,GAAG,IAAGmJ,GACX7Q,KAAImO,EAAcF,CAAO,GACzB+C,KAAK/D,EAAKvF,EAAC,GACX8G,KAAKxB,EAAKhN,KAAIgR,EAAE,GAChBvC,KAAKzB,EAAKtO,KAAIsS,EAAE,GAChB1C,MAAItV,KAAAuQ,EAAM,KAAK,qBAAqBpH,IAAGqM,IAAIC,EAAE,MAAzC,gBAAAzV,GAA4C;AACtD,WAAKsV,KAEKtB,EAAKsB,GAAE,CAAC,MACL5P,KAFF;AAAA,EAGd;AACD,SAAO;AAAA,IACH,OAAAwJ;AAAA,IACA,cAAA4G;AAAA,IACA,iBAAAE;AAAA,IACA,MAAAqB;AAAA,IACA,QAAAI;AAAA,IACA,iBAAiBlH;AAAA,IACjB,WAAAwE;AAAA,IACA,OAAAY;AAAA,EACR;AACA;ACn6BA,IAAIsC,KAAY,OAAO,gBACnBC,KAAW,CAACC,GAAQC,MAAQ;AAC9B,WAASC,KAAQD;AACf,IAAAH,GAAUE,GAAQE,GAAM,EAAE,KAAKD,EAAIC,CAAI,GAAG,YAAY,GAAI,CAAE;AAChE,GAGIC,KAAc,CAAA;AAClBJ,GAASI,IAAa;AAAA,EACpB,YAAY,MAAMC;AAAA,EAClB,YAAY,MAAMC;AAAA,EAClB,aAAa,MAAMC;AAAA,EACnB,oBAAoB,MAAMC;AAAA,EAC1B,qBAAqB,MAAMC;AAAA,EAC3B,sBAAsB,MAAMC;AAAA,EAC5B,WAAW,MAAMC;AAAA,EACjB,WAAW,MAAMC;AAAA,EACjB,aAAa,MAAMC;AAAA,EACnB,mBAAmB,MAAMC;AAAA,EACzB,oBAAoB,MAAMC;AAAA,EAC1B,SAAS,MAAMC;AAAA,EACf,UAAU,MAAMC;AAAA,EAChB,4BAA4B,MAAMC;AAAA,EAClC,MAAM,MAAMC;AAAA,EACZ,YAAY,MAAMC;AAAA,EAClB,aAAa,MAAMC;AAAA,EACnB,SAAS,MAAMC;AAAA,EACf,qBAAqB,MAAMC;AAAA,EAC3B,WAAW,MAAMC;AAAA,EACjB,iBAAiB,MAAMC;AACzB,CAAC;AAMD,IAAIC,KAAO,OAAO,CAAC,GACfC,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC;AACN,OAAO,CAAC;AAGpB,SAASC,GAAcC,GAAQ;AAC7B,MAAIhT,IAAIgT,EAAO,SAAS,EAAE;AAC1B,MAAIhT,EAAE,CAAC,MAAM;AACX,IAAIA,EAAE,SAAS,MAAM,IACnBA,IAAI,MAAMA,IACFA,EAAE,MAAM,QAAQ,MACxBA,IAAI,OAAOA;AAAA,OACR;AACL,IAAAA,IAAIA,EAAE,UAAU,CAAC;AACjB,QAAItC,IAAMsC,EAAE;AACZ,IAAItC,IAAM,MAAM,IACdA,KAAO,IACCsC,EAAE,MAAM,QAAQ,MACxBtC,KAAO;AACT,QAAIuV,IAAa;AACjB,aAAS/V,IAAI,GAAGA,IAAIQ,GAAKR;AACvB,MAAA+V,KAAc;AAGhB,IAAAjT,MAFWkT,EAAkBD,CAAU,IAClBD,KAAUH,IACpB,SAAS,EAAE,EAAE,QAAQ,MAAM,EAAE;AAAA,EACzC;AACD,SAAO7S;AACT;AACA,IAAImT,KAAa,MAAM;AAAA,EACrB,YAAYC,IAAM,MAAMC,IAAI,MAAM7L,IAAI,MAAMvK,IAAI,IAAI;AAClD,SAAK,MAAMmW,GACX,KAAK,IAAIC,GACT,KAAK,IAAI7L,GACT,KAAK,IAAIvK;AAAA,EACV;AAAA,EACD,gBAAgB;AACd,WAAK,KAAK,QACR,KAAK,IAAI,KAAK,YACd,KAAK,IAAI,KAAK,aACd,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,IAE7B,KAAK;AAAA,EACb;AAAA,EACD,YAAY;AACV,UAAMiB,IAAI,KAAK,EAAE,SAAS;AAC1B,QAAIoV,IAAOpV,EAAE,SAAS,EAAE;AAGxB,WAFIoV,EAAK,SAAS,MAAM,MACtBA,IAAO,MAAMA,IACXpV,IAAI,MACCoV,KAEM,MAAMA,EAAK,SAAS,GACrB,SAAS,EAAE,IAAIA;AAAA,EAE9B;AAAA,EACD,WAAW;AACT,WAAO;AAAA,EACR;AACH,GACIC,KAAa,cAAcJ,GAAW;AAAA,EACxC,YAAYH,GAAQ;AAClB,aACA,KAAK,IAAI,MACLA,MACF,KAAK,IAAID,GAAcC,CAAM;AAAA,EAChC;AAAA,EACD,WAAW;AACT,WAAO,KAAK;AAAA,EACb;AACH,GACIQ,KAAc,cAAcL,GAAW;AAAA,EACzC,YAAYM,GAAW;AACrB;AAGF,IAAAC,EAAA,WAAI;AAFF,SAAK,YAAYD;AAAA,EAClB;AAAA,EAED,WAAW;AACT,gBAAK,IAAI,KAAK,UAAU,IAAI,CAACE,MAAeA,EAAW,cAAe,CAAA,EAAE,KAAK,EAAE,GACxE,KAAK;AAAA,EACb;AACH;AACA,SAASC,GAAU3U,GAAK4U,GAAO;AAC7B,SAAI,CAAC5U,EAAI4U,IAAQ,CAAC,IAAI,IACb,IACF,CAAC5U,EAAI,UAAU4U,IAAQ,GAAGA,IAAQ,CAAC,IAAI,MAAM;AACtD;AACA,SAASC,GAAK7U,GAAK4U,GAAO;AACxB,QAAMnW,IAAMkW,GAAU3U,GAAK4U,CAAK,GAC1BrM,IAAIvI,EAAI,UAAU4U,IAAQ,GAAGA,IAAQ,IAAInW,IAAM,CAAC;AACtD,SAAK8J,IAGE,EADQ,CAACA,EAAE,CAAC,IAAI,IAAI0L,EAAkB1L,CAAC,IAAI0L,EAAkB1L,EAAE,UAAU,CAAC,CAAC,GACnE,aAFN;AAGX;AACA,SAASuM,GAAY9U,GAAK4U,GAAO;AAC/B,QAAMnW,IAAMkW,GAAU3U,GAAK4U,CAAK;AAChC,SAAOA,KAASnW,IAAM,KAAK;AAC7B;AACA,SAASsW,GAAUtV,GAAGgJ,GAAG;AACvB,QAAMuM,IAAO,IAAIV,GAAW7U,CAAC,GACvBwV,IAAO,IAAIX,GAAW7L,CAAC;AAE7B,SADe,IAAI8L,GAAY,CAACS,GAAMC,CAAI,CAAC,EAC7B;AAChB;AACA,SAASC,GAAUnZ,GAAO;AACxB,QAAM6Y,IAAQE,GAAY/Y,GAAO,CAAC,GAC5BoZ,IAAUL,GAAY/Y,GAAO6Y,CAAK,GAClCQ,IAAKP,GAAK9Y,GAAO6Y,CAAK,GACtBS,IAAKtZ,EAAM,OAAOoZ,GAASC,IAAK,CAAC,GACjCE,IAAYH,IAAUE,EAAG,QACzBE,IAAUT,GAAY/Y,GAAOuZ,CAAS,GACtCE,IAAKX,GAAK9Y,GAAOuZ,CAAS,GAC1BG,IAAK1Z,EAAM,UAAUwZ,GAASA,IAAUC,IAAK,CAAC,GAC9C/V,IAAIwU,EAAkBoB,CAAE,GACxB5M,IAAIwL,EAAkBwB,CAAE;AAC9B,SAAO,EAAE,GAAAhW,GAAG,GAAAgJ;AACd;AAUA,IAAIiN,KAAyB,OACzBC,KAAW,IAAI,WAAW,CAAC,GAC3BC;AACJ,eAAetC,KAAc;AAC3B,MAAI,YAAY,YAAY;AAC1B,IAAAsC,KAAc,WAAW;AACzB;AAAA,EACD;AACD,MAAI,EAAAD,GAAS,SAASD,KAAyB;AAE/C,QAAI,QAAQ,cAAc,qBAAqB,WAAW;AACxD,MAAAC,KAAW,MAAM,IAAI,QAAQ,CAAClW,MAAM;AAClC,WAAG,gBAAgB;AAAA,UACjB,QAAQiW;AAAA,UACR,QAAQ9c,GAAK;AACX,YAAA6G,EAAE,IAAI,WAAW7G,EAAI,YAAY,CAAC;AAAA,UACnC;AAAA,QACT,CAAO;AAAA,MACP,CAAK;AAAA;AAED,UAAI;AACF,QAAI,WAAW,SACbgd,KAAc,WAAW,SAMzBA,MAJe,MAAM;AAAA;AAAA,UAEnB;AAAA,QACV,GAC6B;AAEvB,cAAMlX,IAAQ,IAAI,WAAWgX,EAAsB;AACnD,QAAAE,GAAY,gBAAgBlX,CAAK,GACjCiX,KAAWjX;AAAA,MACZ,QAAe;AACd,cAAM,IAAI,MAAM,6BAA6B;AAAA,MAC9C;AAEL;AACA4U;AACA,SAASuC,GAAYC,GAAQ;AAC3B,MAAIH,GAAS,SAASG,GAAQ;AAC5B,UAAMC,IAAOJ,GAAS,MAAM,GAAGG,CAAM;AACrC,WAAAH,KAAWA,GAAS,MAAMG,CAAM,GAChCxC,MACOyC;AAAA,EACX;AACI,UAAM,IAAI,MAAM,uGAAuG;AAE3H;AACA,SAAStF,GAAYqF,IAAS,GAAG;AAC/B,QAAMpX,IAAQ,IAAI,WAAWoX,CAAM;AACnC,SAAIF,KACKA,GAAY,gBAAgBlX,CAAK,IAEzBmX,GAAYC,CAAM;AAGrC;AAGA,IAAIjY,KAAM,CAACC,MAAMA,aAAa,YAC1BkY,KAAa,CAACxV,MAAQ,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU,GAC7E+E,KAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AACtE,IAAI,CAACA;AACH,QAAM,IAAI,MAAM,6CAA6C;AAC/D,IAAIxH,KAAQ,MAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACC,GAAGC,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AACjF,SAASC,GAAWC,GAAO;AACzB,MAAI,CAACN,GAAIM,CAAK;AACZ,UAAM,IAAI,MAAM,qBAAqB;AACvC,MAAIC,IAAM;AACV,WAASH,IAAI,GAAGA,IAAIE,EAAM,QAAQF;AAChC,IAAAG,KAAOL,GAAMI,EAAMF,CAAC,CAAC;AAEvB,SAAOG;AACT;AACA,SAAS2B,GAAYC,GAAK;AACxB,MAAI,OAAOA,KAAQ;AACjB,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AAClE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACrD;AACA,SAASkJ,GAAQnQ,GAAM;AAGrB,MAFI,OAAOA,KAAS,aAClBA,IAAOgH,GAAYhH,CAAI,IACrB,CAAC8E,GAAI9E,CAAI;AACX,UAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE;AAC3D,SAAOA;AACT;AACA,IAAIkd,KAAO,MAAM;AAAA,EACf,QAAQ;AACN,WAAO,KAAK;EACb;AACH;AACA,SAASC,GAAgBC,GAAU;AACjC,QAAMC,IAAQ,CAACla,MAAQia,EAAU,EAAC,OAAOjN,GAAQhN,CAAG,CAAC,EAAE,UACjDma,IAAOF;AACb,SAAAC,EAAM,YAAYC,EAAK,WACvBD,EAAM,WAAWC,EAAK,UACtBD,EAAM,SAAS,MAAMD,KACdC;AACT;AAGA,IAAIE,KAAQ,CAACC,GAAGC,GAAGlF,MAAMiF,IAAIC,IAAID,IAAIjF,IAAIkF,IAAIlF,GACzCmF,KAAQ,CAACF,GAAGC,GAAGlF,MAAMiF,IAAIC,IAAIlF,GAC7BoF,KAAQ,CAACH,GAAGC,GAAGlF,MAAMiF,IAAIC,IAAI,CAACD,IAAIjF;AACtC,SAASqF,GAAaC,GAAMC,GAAYvd,GAAOwd,GAAO;AACpD,MAAI,OAAOF,EAAK,gBAAiB;AAC/B,WAAOA,EAAK,aAAaC,GAAYvd,GAAOwd,CAAK;AACnD,QAAMC,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAO3d,KAASyd,IAAOC,CAAQ,GACpCE,IAAK,OAAO5d,IAAQ0d,CAAQ,GAC5BjW,IAAI+V,IAAQ,IAAI,GAChBvO,IAAIuO,IAAQ,IAAI;AACtB,EAAAF,EAAK,UAAUC,IAAa9V,GAAGkW,GAAIH,CAAK,GACxCF,EAAK,UAAUC,IAAatO,GAAG2O,GAAIJ,CAAK;AAC1C;AACA,SAASK,EAAK1N,GAAI,GAAG;AACnB,QAAMhB,IAAI,IAAI;AACd,SAAOgB,KAAMhB,IAAIgB,MAAO,KAAKhB;AAC/B;AACA,SAAS2O,GAAGC,GAAG;AACb,SAAOA,IAAIF,EAAKE,GAAG,CAAC,IAAIF,EAAKE,GAAG,EAAE;AACpC;AACA,SAASC,GAAGD,GAAG;AACb,SAAOA,IAAIF,EAAKE,GAAG,EAAE,IAAIF,EAAKE,GAAG,EAAE;AACrC;AACA,IAAIE,KAAO,cAActB,GAAK;AAAA,EAC5B,YAAYuB,GAAUC,GAAWC,GAAWZ,GAAO;AACjD;AAQF,IAAArC,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,kBAAW;AACX,IAAAA,EAAA,gBAAS;AACT,IAAAA,EAAA,aAAM;AACN,IAAAA,EAAA,mBAAY;AAZV,SAAK,WAAW+C,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAOZ,GACZ,KAAK,SAAS,IAAI,WAAWU,CAAQ,GACrC,KAAK,OAAOxB,GAAW,KAAK,MAAM;AAAA,EACnC;AAAA,EAOD,OAAOjd,GAAM;AACX,UAAM,EAAE,MAAA6d,GAAM,QAAAe,GAAQ,UAAAH,EAAQ,IAAK;AACnC,IAAAze,IAAOmQ,GAAQnQ,CAAI;AACnB,UAAM0F,IAAM1F,EAAK;AACjB,aAASoH,IAAM,GAAGA,IAAM1B,KAAO;AAC7B,YAAMmZ,IAAO,KAAK,IAAIJ,IAAW,KAAK,KAAK/Y,IAAM0B,CAAG;AACpD,UAAIyX,MAASJ,GAAU;AACrB,cAAMK,IAAW7B,GAAWjd,CAAI;AAChC,eAAOye,KAAY/Y,IAAM0B,GAAKA,KAAOqX;AACnC,eAAK,QAAQK,GAAU1X,CAAG;AAC5B;AAAA,MACD;AACD,MAAAwX,EAAO,IAAI5e,EAAK,SAASoH,GAAKA,IAAMyX,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZzX,KAAOyX,GACH,KAAK,QAAQJ,MACf,KAAK,QAAQZ,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAEd;AACD,gBAAK,UAAU7d,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACR;AAAA,EACD,WAAWqI,GAAK;AACd,SAAK,WAAW;AAChB,UAAM,EAAE,QAAAuW,GAAQ,MAAAf,GAAM,UAAAY,GAAU,MAAMV,EAAO,IAAG;AAChD,QAAI,EAAE,KAAA3W,EAAK,IAAG;AACd,IAAAwX,EAAOxX,GAAK,IAAI,KAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,GAC5B,KAAK,YAAYqX,IAAWrX,MAC9B,KAAK,QAAQyW,GAAM,CAAC,GACpBzW,IAAM;AAER,aAASlC,IAAIkC,GAAKlC,IAAIuZ,GAAUvZ;AAC9B,MAAA0Z,EAAO1Z,CAAC,IAAI;AACd,IAAA0Y,GAAaC,GAAMY,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGV,CAAK,GAC/D,KAAK,QAAQF,GAAM,CAAC;AACpB,UAAMkB,IAAQ9B,GAAW5U,CAAG,GACtB3C,IAAM,KAAK;AACjB,QAAIA,IAAM;AACR,YAAM,IAAI,MAAM,6CAA6C;AAC/D,UAAMsZ,IAAStZ,IAAM,GACfuZ,IAAQ,KAAK;AACnB,QAAID,IAASC,EAAM;AACjB,YAAM,IAAI,MAAM,oCAAoC;AACtD,aAAS/Z,IAAI,GAAGA,IAAI8Z,GAAQ9Z;AAC1B,MAAA6Z,EAAM,UAAU,IAAI7Z,GAAG+Z,EAAM/Z,CAAC,GAAG6Y,CAAK;AAAA,EACzC;AAAA,EACD,SAAS;AACP,UAAM,EAAE,QAAAa,GAAQ,WAAAF,EAAW,IAAG;AAC9B,SAAK,WAAWE,CAAM;AACtB,UAAM/e,IAAM+e,EAAO,MAAM,GAAGF,CAAS;AACrC,gBAAK,QAAO,GACL7e;AAAA,EACR;AAAA,EACD,WAAWiW,GAAI;AACb,IAAAA,UAAO,IAAI,KAAK,gBAChBA,EAAG,IAAI,GAAG,KAAK,IAAK,CAAA;AACpB,UAAM,EAAE,UAAA2I,GAAU,QAAAG,GAAQ,QAAA7B,GAAQ,UAAAmC,GAAU,WAAAC,GAAW,KAAA/X,EAAK,IAAG;AAC/D,WAAA0O,EAAG,SAASiH,GACZjH,EAAG,MAAM1O,GACT0O,EAAG,WAAWoJ,GACdpJ,EAAG,YAAYqJ,GACXpC,IAAS0B,KACX3I,EAAG,OAAO,IAAI8I,CAAM,GACf9I;AAAA,EACR;AACH,GACIsJ,KAAK,IAAI,YAAY,CAAC,YAAY,YAAY,WAAW,YAAY,YAAY,WAAW,YAAY,UAAU,CAAC,GACnHC,IAAQ,IAAI,YAAY,EAAE,GAC1BC,KAAQ,IAAI,YAAY,EAAE,GAC1BC,KAAK,YACLC,KAAK,YACLC,KAAM,cAAcjB,GAAK;AAAA,EAS3B,cAAc;AACZ,UAAM,IAAI,IAAI,GAAG,EAAK;AATxB,IAAA9C,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AAAA,EAGX;AAAA,EACD,MAAM;AACJ,UAAM,EAAE,GAAA5B,GAAG,GAAAC,GAAG,GAAAlF,GAAG,GAAAmH,GAAG,GAAAnQ,GAAG,GAAAoQ,GAAG,GAAA7L,GAAG,GAAA8L,EAAG,IAAG;AACnC,WAAO,CAACpC,GAAGC,GAAGlF,GAAGmH,GAAGnQ,GAAGoQ,GAAG7L,GAAG8L,CAAC;AAAA,EAC/B;AAAA,EACD,IAAIpC,GAAGC,GAAGlF,GAAGmH,GAAGnQ,GAAGoQ,GAAG7L,GAAG8L,GAAG;AAC1B,SAAK,IAAIpC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIlF,IAAI,GACb,KAAK,IAAImH,IAAI,GACb,KAAK,IAAInQ,IAAI,GACb,KAAK,IAAIoQ,IAAI,GACb,KAAK,IAAI7L,IAAI,GACb,KAAK,IAAI8L,IAAI;AAAA,EACd;AAAA,EACD,QAAQ/B,GAAMxP,GAAQ;AACpB,aAASnJ,IAAI,GAAGA,IAAI,IAAIA,KAAKmJ,KAAU;AACrC,MAAAgR,EAAMna,CAAC,IAAI2Y,EAAK,UAAUxP,GAAQ,EAAK;AACzC,aAASnJ,IAAI,IAAIA,IAAI,IAAIA;AACvB,MAAAma,EAAMna,CAAC,IAAIqZ,GAAGc,EAAMna,IAAI,EAAE,IAAIma,EAAMna,IAAI,CAAC,IAAIkZ,EAAKiB,EAAMna,IAAI,CAAC,GAAG,EAAE,CAAC,IAAIkZ,EAAKiB,EAAMna,IAAI,EAAE,GAAG,CAAC,IAAIma,EAAMna,IAAI,CAAC;AAE7G,aAASA,IAAI,GAAGA,IAAI,IAAIA;AACtB,MAAAoa,GAAMpa,CAAC,IAAIma,EAAMna,CAAC,IAAIma,EAAMna,IAAI,CAAC;AAEnC,QAAI,EAAE,GAAAsY,GAAG,GAAAC,GAAG,GAAAlF,GAAG,GAAAmH,GAAG,GAAAnQ,GAAG,GAAAoQ,GAAG,GAAA7L,GAAG,GAAA8L,EAAG,IAAG;AACjC,aAASha,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,UAAIia,IAAQja,KAAK,KAAKA,KAAK,IACvBka,IAAID,IAAQN,KAAKC,IACjBO,IAAM3B,EAAKA,EAAKZ,GAAG,EAAE,IAAIjO,IAAI6O,EAAK0B,GAAGla,CAAC,GAAG,CAAC,GAC1Coa,IAAMD,IAAM3B,EAAKZ,GAAG,EAAE,GACtByC,KAAOJ,IAAQnC,GAAMF,GAAGC,GAAGlF,CAAC,IAAIgF,GAAMC,GAAGC,GAAGlF,CAAC,KAAKmH,IAAIM,IAAMV,GAAM1Z,CAAC,IAAI,GACvEsa,KAAOL,IAAQnC,GAAMnO,GAAGoQ,GAAG7L,CAAC,IAAI6J,GAAMpO,GAAGoQ,GAAG7L,CAAC,KAAK8L,IAAIG,IAAMV,EAAMzZ,CAAC,IAAI;AAC3E,MAAA8Z,IAAInH,GACJA,IAAI6F,EAAKX,GAAG,CAAC,GACbA,IAAID,GACJA,IAAIyC,GACJL,IAAI9L,GACJA,IAAIsK,EAAKuB,GAAG,EAAE,GACdA,IAAIpQ,GACJA,IAAI8O,GAAG6B,CAAG;AAAA,IACX;AACD,IAAA1C,IAAIA,IAAI,KAAK,IAAI,GACjBC,IAAIA,IAAI,KAAK,IAAI,GACjBlF,IAAIA,IAAI,KAAK,IAAI,GACjBmH,IAAIA,IAAI,KAAK,IAAI,GACjBnQ,IAAIA,IAAI,KAAK,IAAI,GACjBoQ,IAAIA,IAAI,KAAK,IAAI,GACjB7L,IAAIA,IAAI,KAAK,IAAI,GACjB8L,IAAIA,IAAI,KAAK,IAAI,GACjB,KAAK,IAAIpC,GAAGC,GAAGlF,GAAGmH,GAAGnQ,GAAGoQ,GAAG7L,GAAG8L,CAAC;AAAA,EAChC;AAAA,EACD,aAAa;AACX,IAAAP,EAAM,KAAK,CAAC;AAAA,EACb;AAAA,EACD,UAAU;AACR,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B,KAAK,OAAO,KAAK,CAAC;AAAA,EACnB;AACH,GACIc,KAAMhD,GAAgB,MAAM,IAAIsC,GAAK,CAAA,GAGrCW,KAAO,cAAclD,GAAK;AAAA,EAO5B,YAAYhQ,GAAMmT,GAAM;AACtB;AAPF,IAAA3E,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,kBAAW;AACX,IAAAA,EAAA,mBAAY;AAGV,UAAMtc,IAAM+Q,GAAQkQ,CAAI;AAExB,QADA,KAAK,QAAQnT,EAAK,UACd,OAAO,KAAK,MAAM,UAAW;AAC/B,YAAM,IAAI,MAAM,qDAAqD;AACvE,SAAK,WAAW,KAAK,MAAM,UAC3B,KAAK,YAAY,KAAK,MAAM;AAC5B,UAAMuR,IAAW,KAAK,UAChB7X,IAAM,IAAI,WAAW6X,CAAQ;AACnC,IAAA7X,EAAI,IAAIxH,EAAI,SAASqf,IAAWvR,EAAK,OAAQ,EAAC,OAAO9N,CAAG,EAAE,OAAQ,IAAGA,CAAG;AACxE,aAAS8F,IAAI,GAAGA,IAAI0B,EAAI,QAAQ1B;AAC9B,MAAA0B,EAAI1B,CAAC,KAAK;AACZ,SAAK,MAAM,OAAO0B,CAAG,GACrB,KAAK,QAAQsG,EAAK;AAClB,aAAShI,IAAI,GAAGA,IAAI0B,EAAI,QAAQ1B;AAC9B,MAAA0B,EAAI1B,CAAC,KAAK;AACZ,SAAK,MAAM,OAAO0B,CAAG,GACrBA,EAAI,KAAK,CAAC;AAAA,EACX;AAAA,EACD,OAAO0Z,GAAK;AACV,gBAAK,MAAM,OAAOA,CAAG,GACd;AAAA,EACR;AAAA,EACD,WAAWjY,GAAK;AACd,SAAK,WAAW,IAChB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,MAAM,OAAOA,CAAG,GACrB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,QAAO;AAAA,EACb;AAAA,EACD,SAAS;AACP,UAAMA,IAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,gBAAK,WAAWA,CAAG,GACZA;AAAA,EACR;AAAA,EACD,WAAWyN,GAAI;AACb,IAAAA,UAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,UAAM,EAAE,OAAAyK,GAAO,OAAAC,GAAO,UAAAtB,GAAU,WAAAC,GAAW,UAAAV,GAAU,WAAAC,EAAW,IAAG;AACnE,WAAA5I,IAAKA,GACLA,EAAG,WAAWoJ,GACdpJ,EAAG,YAAYqJ,GACfrJ,EAAG,WAAW2I,GACd3I,EAAG,YAAY4I,GACf5I,EAAG,QAAQyK,EAAM,WAAWzK,EAAG,KAAK,GACpCA,EAAG,QAAQ0K,EAAM,WAAW1K,EAAG,KAAK,GAC7BA;AAAA,EACR;AAAA,EACD,UAAU;AACR,SAAK,YAAY,IACjB,KAAK,MAAM,WACX,KAAK,MAAM;EACZ;AACH,GACI2K,KAAO,CAACvT,GAAM9N,GAAKa,MAAY,IAAImgB,GAAKlT,GAAM9N,CAAG,EAAE,OAAOa,CAAO,EAAE,OAAM;AAC7EwgB,GAAK,SAAS,CAACvT,GAAM9N,MAAQ,IAAIghB,GAAKlT,GAAM9N,CAAG;AAI/C,IAAIshB,KAAQpU,GAAM,OAAO,gFAAgF,CAAC,GACtGqU,IAAWjM,GAAY;AAAA,EACzB,GAAG,OAAO,gFAAgF;AAAA,EAC1F,GAAG,OAAO,+EAA+E;AAAA,EACzF,IAAIgM;AAAA,EACJ,GAAG7F;AAAA,EACH,GAAG,OAAO,gFAAgF;AAAA,EAC1F,IAAI,OAAO,+EAA+E;AAAA,EAC1F,IAAI,OAAO,+EAA+E;AAAA,EAC1F,MAAMsF;AAAA,EACN,MAAM,CAAC/gB,MAAQwhB,MAASH,GAAKN,IAAK/gB,GAAKoH,EAAY,GAAGoa,CAAI,CAAC;AAAA,EAC3D,aAAAlJ;AACF,CAAC,GACGrM,IAAQiB,GAAM,OAAOqU,EAAS,MAAM,CAAC,CAAC;AAI1C,SAAS1G,GAAmBhT,GAAK;AAC/B,QAAM4K,IAAa5K,IAAM4Z,GAAuBtX,EAAI,OAAOtC,CAAG,GAAG4T,EAAG,IAAIA,IAAK,EAAE,IAAI8F,EAAS,MAAM,iBAAgB,GAC5GhI,IAAYgI,EAAS,aAAa9O,GAAY,EAAK,GACnDiP,IAAUtG,EAAQuG,GAAkBlP,CAAU,GAAG,EAAE,GACnDmP,IAASxG,EAAQuG,GAAkBpI,CAAS,GAAG,EAAE;AACvD,SAAO,EAAE,YAAYmI,GAAS,WAAWE,EAAM;AACjD;AACA,SAASpH,GAAqBlK,GAAG;AAC/B,MAAIA,EAAE,WAAW;AACf,UAAM,IAAI,MAAM,gCAAgC;AAClD,QAAMhK,KAAOgK,EAAE,SAAS,KAAK,GACvBuR,IAAOvR,EAAE,UAAU,GAAG,IAAIhK,CAAG,GAC7BoM,IAAIoP,EAAmBxR,EAAE,UAAUhK,IAAM,GAAGA,IAAMA,IAAM,CAAC,CAAC;AAChE,MAAI2Q,IAAS;AACb,SAAI9M,EAAIuI,GAAGgJ,EAAG,MAAMF,OAClBvE,IAAS,OACJA,IAAS4K;AAClB;AACA,SAASvG,GAAU1X,GAAO;AACxB,EAAAA,IAAQ,mBAAmB,mBAAmBA,CAAK,CAAC;AACpD,QAAM+Z,IAAS/Z,EAAM,QACfme,IAAQ,IAAI,aAAapE,MAAW,KAAK,CAAC;AAChD,WAAS7X,IAAI,GAAGA,IAAI6X,GAAQ7X;AAC1B,IAAAic,EAAMjc,MAAM,CAAC,MAAMlC,EAAM,WAAWkC,CAAC,IAAI,QAAQ,KAAKA,IAAI,IAAI;AAEhE,QAAMkc,IAAW,CAAA;AACjB,WAASlc,IAAI,GAAGA,IAAI6X,GAAQ7X,KAAK;AAC/B,UAAMmc,IAAOF,EAAMjc,MAAM,CAAC,MAAM,KAAKA,IAAI,IAAI,IAAI;AACjD,IAAAkc,EAAS,MAAMC,MAAS,GAAG,SAAS,EAAE,CAAC,GACvCD,EAAS,MAAMC,IAAO,IAAI,SAAS,EAAE,CAAC;AAAA,EACvC;AACD,SAAOD,EAAS,KAAK,EAAE;AACzB;AACA,SAAS5G,EAAQxX,GAAOuC,GAAK;AAC3B,SAAIvC,EAAM,UAAUuC,IACXvC,IACF,IAAI,MAAMuC,IAAMvC,EAAM,SAAS,CAAC,EAAE,KAAK,GAAG,IAAIA;AACvD;AACA,SAASwW,GAAW/R,GAAK;AACvB,SAAOA,EAAI,IAAI,CAACvG,MAAS;AACvB,UAAMmE,IAAMnE,EAAK,SAAS,EAAE;AAC5B,WAAOmE,EAAI,WAAW,IAAI,MAAMA,IAAMA;AAAA,EAC1C,CAAG,EAAE,KAAK,EAAE;AACZ;AACA,SAASoU,GAAYhS,GAAK;AACxB,QAAMR,IAAM,CAAA;AACZ,WAAS/B,IAAI,GAAGQ,IAAM+B,EAAI,QAAQvC,IAAIQ,GAAKR;AACzC,IAAIuC,EAAIvC,CAAC,KAAK,OAAOuC,EAAIvC,CAAC,KAAK,OAC7B+B,EAAI,KAAK,OAAO,gBAAgBQ,EAAIvC,CAAC,IAAI,MAAM,QAAQuC,EAAIvC,IAAI,CAAC,IAAI,OAAO,QAAQuC,EAAIvC,IAAI,CAAC,IAAI,OAAO,MAAMuC,EAAIvC,IAAI,CAAC,IAAI,GAAG,CAAC,GAC9HA,KAAK,KACIuC,EAAIvC,CAAC,KAAK,OAAOuC,EAAIvC,CAAC,KAAK,OACpC+B,EAAI,KAAK,OAAO,gBAAgBQ,EAAIvC,CAAC,IAAI,OAAO,QAAQuC,EAAIvC,IAAI,CAAC,IAAI,OAAO,MAAMuC,EAAIvC,IAAI,CAAC,IAAI,GAAG,CAAC,GACnGA,KAAK,KACIuC,EAAIvC,CAAC,KAAK,OAAOuC,EAAIvC,CAAC,KAAK,OACpC+B,EAAI,KAAK,OAAO,gBAAgBQ,EAAIvC,CAAC,IAAI,OAAO,MAAMuC,EAAIvC,IAAI,CAAC,IAAI,GAAG,CAAC,GACvEA,OAEA+B,EAAI,KAAK,OAAO,cAAcQ,EAAIvC,CAAC,CAAC,CAAC;AAGzC,SAAO+B,EAAI,KAAK,EAAE;AACpB;AACA,SAASqT,EAAWgH,GAAQ;AAC1B,MAAIC,IAAeD,EAAO;AAC1B,EAAIC,IAAe,MAAM,MACvBD,IAAS9G,EAAQ8G,GAAQC,IAAe,CAAC,IAE3CA,IAAeD,EAAO;AACtB,QAAME,IAAaD,IAAe,GAC5BJ,IAAQ,IAAI,WAAWK,CAAU;AACvC,WAAStc,IAAI,GAAGA,IAAIsc,GAAYtc;AAC9B,IAAAic,EAAMjc,CAAC,IAAI,SAASoc,EAAO,UAAUpc,IAAI,GAAGA,IAAI,IAAI,CAAC,GAAG,EAAE;AAE5D,SAAOic;AACT;AACA,SAASxG,GAAgBhC,GAAW;AAClC,QAAMvI,IAAQuQ,EAAS,gBAAgB,QAAQhI,CAAS;AACxD,MAAI,CAACvI;AACH,WAAO;AACT,MAAI;AACF,WAAAA,EAAM,eAAc,GACb;AAAA,EACR,QAAe;AACd,WAAO;AAAA,EACR;AACH;AACA,SAASuJ,GAAoB8H,GAAYC,GAAY;AACnD,QAAMC,IAAShB,EAAS,gBAAgB,QAAQc,CAAU;AAC1D,MAAI,CAACE;AACH,WAAO;AACT,QAAMC,IAASjB,EAAS,gBAAgB,QAAQe,CAAU;AAC1D,SAAKE,IAEED,EAAO,OAAOC,CAAM,IADlB;AAEX;AAOA,IAAIC,KAAQC,EAAmB,kCAAkC,GAC7DC,KAAYD,EAAmB,kCAAkC;AACrE,SAASE,GAAK/N,GAAGgO,GAAQ;AACvB,MAAI9e,IAAM,IAAI,WAAW8e,CAAM,GAC3BC,IAAK,GACL7T,IAAS,GACTgN,IAAI9B;AACR,QAAM4I,IAAU,IAAI,WAAW,CAAC,GAC1BC,IAAQ,MAAM;AAClB,IAAAD,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,IAAI,KACvBC,EAAQ,CAAC,IAAID,IAAK,KAClB7G,IAAI8E,GAAIkC,EAAmBpO,GAAGkO,CAAO,CAAC,GACtCD,KACA7T,IAAS;AAAA,EACb;AACE,EAAA+T;AACA,WAASld,IAAI,GAAGQ,IAAMvC,EAAI,QAAQ+B,IAAIQ,GAAKR;AACzC,IAAImJ,MAAWgN,EAAE,UACf+G,KACFjf,EAAI+B,CAAC,IAAImW,EAAEhN,GAAQ,IAAI;AAEzB,SAAOlL;AACT;AACA,SAASuW,GAAmB4I,GAAUC,GAAmBC,GAAYC,GAAqBC,GAAiBC,IAAc,IAAOC,IAAM,oBAAoBC,IAAM,oBAAoB;AAClL,QAAMC,IAAKnC,EAAS,gBAAgB,QAAQ4B,EAAkB,SAAS,GACjEQ,IAAKpC,EAAS,gBAAgB,QAAQ8B,CAAmB,GACzDO,IAAKrC,EAAS,gBAAgB,QAAQ6B,CAAU;AACtD,MAAIS,IAAK5I,GAAKiI,EAAS,WAAWM,CAAG,GACjCM,IAAK7I,GAAKmI,GAAYK,CAAG;AAC7B,EAAIF,MACF,CAACM,GAAIC,CAAE,IAAI,CAACA,GAAID,CAAE;AAEpB,QAAME,IAAKrB,EAAmBS,EAAkB,UAAU,GACpDa,IAAKtB,EAAmBQ,EAAS,UAAU,GAC3Ce,IAAKP,EAAG,GACRQ,IAAMzB,MAASwB,IAAKtB,KACpBwB,IAAKlY,EAAM,IAAI+X,GAAI/X,EAAM,KAAKiY,GAAKH,CAAE,CAAC,GACtCzS,IAAKqS,EAAG,GACRS,IAAMnY,EAAM,IAAIwW,IAAOnR,IAAKqR,EAAS,GACrC0B,IAAIV,EAAG,SAASS,CAAG,EAAE,IAAIR,CAAE,EAAE,SAASO,CAAE,GACxCG,IAAKpJ,EAAWE,EAAQmJ,EAA2BF,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5DG,IAAKtJ,EAAWE,EAAQmJ,EAA2BF,EAAE,CAAC,GAAG,EAAE,CAAC;AAElE,SADWzB,GAAKK,EAAmBqB,GAAIE,GAAIX,GAAIC,CAAE,GAAGR,CAAe;AAErE;AAGA,IAAImB,KAAS,GACTtK,KAAa,IAAI;AACrB,SAASO,GAAU3W,GAAKwV,GAAWmL,IAAa,GAAG;AACjD,QAAMC,IAAS,OAAO5gB,KAAQ,WAAWmX,EAAWI,GAAUvX,CAAG,CAAC,IAAI,WAAW,KAAKA,CAAG,GACnF6gB,IAAiB,OAAOrL,KAAc,WAAWgI,EAAS,gBAAgB,QAAQhI,CAAS,IAAIA,GAC/FsL,IAAUhK,MACVnS,IAAIoc,EAAmBD,EAAQ,UAAU;AAC/C,MAAIjZ,IAAKiZ,EAAQ;AACjB,EAAIjZ,EAAG,SAAS,QACdA,IAAKA,EAAG,UAAUA,EAAG,SAAS,GAAG;AACnC,QAAMW,IAAIqY,EAAe,SAASlc,CAAC,GAC7B4I,IAAK4J,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5D0J,IAAKiF,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5DyY,IAAKjf,GAAWgb,GAAIkE,EAAmB3T,GAAIqT,GAAQ1O,CAAE,CAAC,CAAC;AAC7D,EAAAiP,GAAgB5T,GAAI2E,GAAI0O,CAAM;AAC9B,QAAMQ,IAAKpf,GAAW4e,CAAM;AAC5B,SAAOD,MAAeD,KAAS7Y,IAAKuZ,IAAKH,IAAKpZ,IAAKoZ,IAAKG;AAC1D;AACA,SAASD,GAAgB5T,GAAI2E,GAAIlS,GAAK;AACpC,MAAI+e,IAAK,GACL7T,IAAS,GACTgN,IAAI9B;AACR,QAAM4I,IAAU,IAAI,WAAW,CAAC,GAC1BC,IAAQ,MAAM;AAClB,IAAAD,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,IAAI,KACvBC,EAAQ,CAAC,IAAID,IAAK,KAClB7G,IAAI8E,GAAIkE,EAAmB3T,GAAI2E,GAAI8M,CAAO,CAAC,GAC3CD,KACA7T,IAAS;AAAA,EACb;AACE,EAAA+T;AACA,WAASld,IAAI,GAAGQ,IAAMvC,EAAI,QAAQ+B,IAAIQ,GAAKR;AACzC,IAAImJ,MAAWgN,EAAE,UACf+G,KACFjf,EAAI+B,CAAC,KAAKmW,EAAEhN,GAAQ,IAAI;AAE5B;AACA,SAASwL,GAAU2K,GAAa3S,GAAYiS,IAAa,GAAG;AAAA,EAC1D,QAAAW,IAAS;AACX,IAAI,IAAI;AACN,QAAMC,IAAoBR,EAAmBrS,CAAU;AACvD,MAAIuS,IAAKI,EAAY,UAAU,KAAK,MAAM,EAAE,GACxCD,IAAKC,EAAY,UAAU,MAAM,EAAE;AACvC,EAAIV,MAAeD,OACjBO,IAAKI,EAAY,UAAUA,EAAY,SAAS,EAAE,GAClDD,IAAKC,EAAY,UAAU,KAAKA,EAAY,SAAS,EAAE;AAEzD,QAAMrhB,IAAMmX,EAAWiK,CAAE,GAEnB5Y,IADKgV,EAAS,gBAAgB,QAAQ,OAAO6D,EAAY,UAAU,GAAG,GAAG,CAAC,EACnE,SAASE,CAAiB,GACjChU,IAAK4J,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5D0J,IAAKiF,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC;AAGlE,SAFA2Y,GAAgB5T,GAAI2E,GAAIlS,CAAG,GACXqW,GAAW,MAAM,KAAK2G,GAAIkE,EAAmB3T,GAAIvN,GAAKkS,CAAE,CAAC,CAAC,CAAC,MAC3D+O,EAAG,gBACVK,MAAW,UAAUthB,IAAMsW,GAAYtW,CAAG,IAE1CshB,MAAW,UAAU,CAAE,IAAG;AAErC;AACA,SAAS1K,GAAY5W,GAAK0O,GAAYrR,IAAU,CAAA,GAAI;AAClD,MAAI;AAAA,IACF,WAAAmkB;AAAA,IACA,KAAAC;AAAA,IACA,MAAA1X;AAAA,IACA,WAAAyL;AAAA,IACA,QAAAkM;AAAA,EACD,IAAGrkB,GACAskB,IAAU,OAAO3hB,KAAQ,WAAWuX,GAAUvX,CAAG,IAAIqW,GAAW,MAAM,KAAKrW,CAAG,CAAC;AACnF,EAAI+J,MACFyL,IAAYA,KAAayB,GAA2BvI,CAAU,GAC9DiT,IAAU5K,GAAQ4K,GAASnM,GAAWkM,CAAM;AAE9C,QAAMzB,IAAKc,EAAmBrS,CAAU,GAClChO,IAAIqgB,EAAmBY,CAAO;AACpC,MAAIhd,IAAI,MACJpB,IAAI,MACJgJ,IAAI;AACR,KAAG;AACD,OAAG;AACD,UAAIU;AACJ,MAAIuU,KAAaA,EAAU,SACzBvU,IAAQuU,EAAU,QAElBvU,IAAQ+J,GAAQ,GAElBrS,IAAIsI,EAAM,GACV1J,IAAI2E,EAAM,IAAIxH,GAAGuM,EAAM,EAAE;AAAA,IAC/B,SAAa1J,MAAMkU,MAAQlU,IAAIoB,MAAM6Y,EAAS,MAAM;AAChD,IAAAjR,IAAIrE,EAAM,IAAIA,EAAM,IAAIA,EAAM,KAAK+X,GAAIvI,EAAG,CAAC,GAAGxP,EAAM,KAAKvD,GAAGuD,EAAM,KAAK3E,GAAG0c,CAAE,CAAC,CAAC;AAAA,EAClF,SAAW1T,MAAMkL;AACf,SAAIgK,IACK5I,GAAUtV,GAAGgJ,CAAC,IAChB8K,EAAQ2J,EAA2Bzd,CAAC,GAAG,EAAE,IAAI8T,EAAQ2J,EAA2BzU,CAAC,GAAG,EAAE;AAC/F;AACA,SAASsK,GAAkB7W,GAAK4hB,GAASpM,GAAWnY,IAAU,CAAA,GAAI;AAChE,MAAIskB;AACJ,QAAM;AAAA,IACJ,MAAA5X;AAAA,IACA,KAAA0X;AAAA,IACA,QAAAC;AAAA,EACD,IAAGrkB,GACEwkB,IAAe,OAAOrM,KAAc,WAAWA,IAAYA,EAAU,MAAM,EAAK;AACtF,EAAIzL,IACF4X,IAAU5K,GAAQ,OAAO/W,KAAQ,WAAWuX,GAAUvX,CAAG,IAAIA,GAAK6hB,GAAcH,CAAM,IAEtFC,IAAU,OAAO3hB,KAAQ,WAAWuX,GAAUvX,CAAG,IAAIqW,GAAW,MAAM,KAAKrW,CAAG,CAAC;AAEjF,MAAIuD,GACAgJ;AACJ,MAAIkV,GAAK;AACP,UAAMK,IAAe9I,GAAU4I,CAAO;AACtC,IAAAre,IAAIue,EAAa,GACjBvV,IAAIuV,EAAa;AAAA,EACrB;AACI,IAAAve,IAAIwd,EAAmBa,EAAQ,UAAU,GAAG,EAAE,CAAC,GAC/CrV,IAAIwU,EAAmBa,EAAQ,UAAU,EAAE,CAAC;AAE9C,QAAMG,IAAK,OAAOvM,KAAc,WAAWgI,EAAS,gBAAgB,QAAQhI,CAAS,IAAIA,GACnF9U,IAAIqgB,EAAmBY,CAAO,GAC9BzJ,IAAIhQ,EAAM,IAAI3E,GAAGgJ,CAAC;AACxB,MAAI2L,MAAMT;AACR,WAAO;AACT,QAAMuK,IAAOxE,EAAS,gBAAgB,KAAK,SAASjR,CAAC,EAAE,IAAIwV,EAAG,SAAS7J,CAAC,CAAC,GACnE/E,IAAIjL,EAAM,IAAIxH,GAAGshB,EAAK,CAAC;AAC7B,SAAOze,MAAM4P;AACf;AACA,SAAS+D,GAAK1B,GAAWkM,IAAS,oBAAoB;AACpD,EAAAA,IAASnK,GAAUmK,CAAM;AACzB,QAAM9f,IAAIyV,EAAQ2J,EAA2BxD,EAAS,MAAM,CAAC,GAAG,EAAE,GAC5D1Y,IAAIuS,EAAQ2J,EAA2BxD,EAAS,MAAM,CAAC,GAAG,EAAE,GAC5DyE,IAAK5K,EAAQ2J,EAA2BxD,EAAS,gBAAgB,KAAK,CAAC,GAAG,EAAE,GAC5E0E,IAAK7K,EAAQ2J,EAA2BxD,EAAS,gBAAgB,KAAK,CAAC,GAAG,EAAE;AAClF,MAAInP,GACAC;AACJ,MAAIkH,EAAU,WAAW;AACvB,IAAAnH,IAAKmH,EAAU,UAAU,GAAG,EAAE,GAC9BlH,IAAKkH,EAAU,UAAU,IAAI,GAAG;AAAA,OAC3B;AACL,UAAMvI,IAAQuQ,EAAS,gBAAgB,QAAQhI,CAAS;AACxD,IAAAnH,IAAKgJ,EAAQ2J,EAA2B/T,EAAM,CAAC,GAAG,EAAE,GACpDqB,IAAK+I,EAAQ2J,EAA2B/T,EAAM,CAAC,GAAG,EAAE;AAAA,EACrD;AACD,QAAMpQ,IAAOsa,EAAWuK,IAAS9f,IAAIkD,IAAImd,IAAKC,IAAK7T,IAAKC,CAAE,GACpD6T,IAAOT,EAAO,SAAS;AAE7B,SADU1E,GAAIkE,EAAmB,IAAI,WAAW,CAACiB,KAAQ,IAAI,KAAKA,IAAO,GAAG,CAAC,GAAGtlB,CAAI,CAAC;AAEvF;AACA,SAASka,GAAQ4K,GAASnM,GAAWkM,IAAS,oBAAoB;AAChE,QAAM5Q,IAAIoG,GAAK1B,GAAWkM,CAAM;AAChC,SAAO1f,GAAWgb,GAAIkE,EAAmBpQ,GAAG,OAAO6Q,KAAY,WAAWxK,EAAWwK,CAAO,IAAIA,CAAO,CAAC,CAAC;AAC3G;AACA,SAASrK,GAAoB9B,GAAW/K,GAAY;AAClD,QAAMwC,IAAQuQ,EAAS,gBAAgB,QAAQhI,CAAS;AACxD,SAAOgI,EAAS,MAAM,WAAW/S,GAAYwC,CAAK;AACpD;AACA,SAASgK,GAA2BvI,GAAY;AAC9C,QAAM0T,IAAS5E,EAAS,aAAa9O,GAAY,EAAK;AAEtD,SADe2I,EAAQgL,GAAkBD,CAAM,GAAG,EAAE;AAEtD;AACA,SAASpL,KAAW;AAClB,QAAM8J,IAAUhK,MACViL,IAAKvE,EAAS,gBAAgB,QAAQsD,EAAQ,SAAS,GACvDnc,IAAIoc,EAAmBD,EAAQ,UAAU;AAC/C,SAAO;AAAA,IACL,GAAGA;AAAA,IACH,GAAAnc;AAAA,IACA,IAAIod,EAAG;AAAA,EACX;AACA;AAGA,SAASO,GAAYxe,GAAK;AACxB,QAAMQ,IAAM,CAAA;AACZ,WAASvC,IAAI,GAAGQ,IAAMuB,EAAI,QAAQ/B,IAAIQ,GAAKR,KAAK;AAC9C,UAAMkL,IAAQnJ,EAAI,YAAY/B,CAAC;AAC/B,QAAIkL,KAAS;AACX,MAAA3I,EAAI,KAAK2I,CAAK;AAAA,aACLA,KAAS;AAClB,MAAA3I,EAAI,KAAK,MAAM2I,MAAU,CAAC,GAC1B3I,EAAI,KAAK,MAAM2I,IAAQ,EAAE;AAAA,aAChBA,KAAS,SAASA,KAAS,SAASA,KAAS;AACtD,MAAA3I,EAAI,KAAK,MAAM2I,MAAU,EAAE,GAC3B3I,EAAI,KAAK,MAAM2I,MAAU,IAAI,EAAE,GAC/B3I,EAAI,KAAK,MAAM2I,IAAQ,EAAE;AAAA,aAChBA,KAAS,SAASA,KAAS;AACpC,MAAAlL,KACAuC,EAAI,KAAK,MAAM2I,MAAU,KAAK,EAAE,GAChC3I,EAAI,KAAK,MAAM2I,MAAU,KAAK,EAAE,GAChC3I,EAAI,KAAK,MAAM2I,MAAU,IAAI,EAAE,GAC/B3I,EAAI,KAAK,MAAM2I,IAAQ,EAAE;AAAA;AAEzB,YAAA3I,EAAI,KAAK2I,CAAK,GACR,IAAI,MAAM,wBAAwB;AAAA,EAE3C;AACD,SAAO,IAAI,WAAW3I,CAAG;AAC3B;AACA,SAASie,GAAK1iB,GAAOxC,GAAS;AAE5B,MADAwC,IAAQ,OAAOA,KAAU,WAAWyiB,GAAYziB,CAAK,IAAIA,GACrDxC,GAAS;AAEX,SADaA,EAAQ,QAAQ,YAChB;AACX,YAAM,IAAI,MAAM,cAAc;AAChC,QAAIpB,IAAMoB,EAAQ;AAClB,QAAI,CAACpB;AACH,YAAM,IAAI,MAAM,aAAa;AAC/B,WAAAA,IAAM,OAAOA,KAAQ,WAAWkb,EAAWlb,CAAG,IAAIA,GAC3C+F,GAAWsb,GAAKN,IAAK/gB,GAAK4D,CAAK,CAAC;AAAA,EACxC;AACD,SAAOmC,GAAWgb,GAAInd,CAAK,CAAC;AAC9B;AAGA,IAAI2iB,KAAc,CAAA;AAClBzM,GAASyM,IAAa;AAAA,EACpB,SAAS,MAAMC;AAAA,EACf,SAAS,MAAMC;AAAA,EACf,KAAK,MAAMC;AACb,CAAC;AACD,IAAIC,KAAU,GACVC,KAAQ,IACRC,KAAQ,IACRC,KAAO,WAAW,KAAK;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC,GACGC,KAAK,IAAI,YAAY;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,SAASC,GAAQrhB,GAAG;AAClB,UAAQmhB,GAAKnhB,MAAM,KAAK,GAAG,IAAI,QAAQ,MAAMmhB,GAAKnhB,MAAM,KAAK,GAAG,IAAI,QAAQ,MAAMmhB,GAAKnhB,MAAM,IAAI,GAAG,IAAI,QAAQ,IAAImhB,GAAKnhB,IAAI,GAAG,IAAI;AACtI;AAGA,SAASshB,GAAUrjB,GAAOyhB,GAAQ6B,GAAU;AAC1C,MAAIC,IAAK,GAAGlD,IAAK,GAAG3S,IAAK,GAAGC,IAAK,GAAG6V,IAAO,GAAGC,IAAO,GAAGnJ,IAAO,GAAGoJ,IAAO;AACzE,EAAAF,IAAOxjB,EAAM,CAAC,IAAI,KAClByjB,IAAOzjB,EAAM,CAAC,IAAI,KAClBsa,IAAOta,EAAM,CAAC,IAAI,KAClB0jB,IAAO1jB,EAAM,CAAC,IAAI,KAClBujB,IAAKC,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ,GAC3CF,IAAOxjB,EAAM,CAAC,IAAI,KAClByjB,IAAOzjB,EAAM,CAAC,IAAI,KAClBsa,IAAOta,EAAM,CAAC,IAAI,KAClB0jB,IAAO1jB,EAAM,CAAC,IAAI,KAClBqgB,IAAKmD,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ,GAC3CF,IAAOxjB,EAAM,CAAC,IAAI,KAClByjB,IAAOzjB,EAAM,CAAC,IAAI,KAClBsa,IAAOta,EAAM,EAAE,IAAI,KACnB0jB,IAAO1jB,EAAM,EAAE,IAAI,KACnB0N,IAAK8V,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ,GAC3CF,IAAOxjB,EAAM,EAAE,IAAI,KACnByjB,IAAOzjB,EAAM,EAAE,IAAI,KACnBsa,IAAOta,EAAM,EAAE,IAAI,KACnB0jB,IAAO1jB,EAAM,EAAE,IAAI,KACnB2N,IAAK6V,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ;AAC3C,WAAShgB,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,IAAA8f,IAAOnD,IAAK3S,IAAKC,IAAK2V,EAAS5f,CAAC,GAChC8f,IAAOJ,GAAQI,CAAI,GACnBD,KAAMC,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,IAC1HC,IAAO/V,IAAKC,IAAK4V,IAAKD,EAAS5f,IAAI,CAAC,GACpC+f,IAAOL,GAAQK,CAAI,GACnBpD,KAAMoD,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,IAC1HnJ,IAAO3M,IAAK4V,IAAKlD,IAAKiD,EAAS5f,IAAI,CAAC,GACpC4W,IAAO8I,GAAQ9I,CAAI,GACnB5M,KAAM4M,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,IAC1HoJ,IAAOH,IAAKlD,IAAK3S,IAAK4V,EAAS5f,IAAI,CAAC,GACpCggB,IAAON,GAAQM,CAAI,GACnB/V,KAAM+V,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS;AAE5H,EAAAjC,EAAO,CAAC,IAAI9T,MAAO,KAAK,KACxB8T,EAAO,CAAC,IAAI9T,MAAO,KAAK,KACxB8T,EAAO,CAAC,IAAI9T,MAAO,IAAI,KACvB8T,EAAO,CAAC,IAAI9T,IAAK,KACjB8T,EAAO,CAAC,IAAI/T,MAAO,KAAK,KACxB+T,EAAO,CAAC,IAAI/T,MAAO,KAAK,KACxB+T,EAAO,CAAC,IAAI/T,MAAO,IAAI,KACvB+T,EAAO,CAAC,IAAI/T,IAAK,KACjB+T,EAAO,CAAC,IAAIpB,MAAO,KAAK,KACxBoB,EAAO,CAAC,IAAIpB,MAAO,KAAK,KACxBoB,EAAO,EAAE,IAAIpB,MAAO,IAAI,KACxBoB,EAAO,EAAE,IAAIpB,IAAK,KAClBoB,EAAO,EAAE,IAAI8B,MAAO,KAAK,KACzB9B,EAAO,EAAE,IAAI8B,MAAO,KAAK,KACzB9B,EAAO,EAAE,IAAI8B,MAAO,IAAI,KACxB9B,EAAO,EAAE,IAAI8B,IAAK;AACpB;AACA,SAASI,GAAWvnB,GAAKknB,GAAUM,GAAW;AAC5C,MAAIL,IAAK,GAAGlD,IAAK,GAAG3S,IAAK,GAAGC,IAAK,GAAGkW,IAAM;AAC1C,EAAAN,KAAMnnB,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,IAAIA,EAAI,CAAC,IAAI,KAClFikB,KAAMjkB,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,IAAIA,EAAI,CAAC,IAAI,KAClFsR,KAAMtR,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,EAAE,IAAI,QAAQ,IAAIA,EAAI,EAAE,IAAI,KACpFuR,KAAMvR,EAAI,EAAE,IAAI,QAAQ,MAAMA,EAAI,EAAE,IAAI,QAAQ,MAAMA,EAAI,EAAE,IAAI,QAAQ,IAAIA,EAAI,EAAE,IAAI,KACtFmnB,KAAM,YACNlD,KAAM,YACN3S,KAAM,YACNC,KAAM;AACN,WAASjK,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,IAAAmgB,IAAMxD,IAAK3S,IAAKC,IAAKwV,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBN,KAAMM,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAI6f,GAClBM,IAAMnW,IAAKC,IAAK4V,IAAKJ,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBxD,KAAMwD,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAI2c,GAClBwD,IAAMlW,IAAK4V,IAAKlD,IAAK8C,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBnW,KAAMmW,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAIgK,GAClBmW,IAAMN,IAAKlD,IAAK3S,IAAKyV,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBlW,KAAMkW,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAIiK;AAEpB,MAAIiW,MAAcb;AAChB,aAASrf,IAAI,GAAGA,IAAI,IAAIA;AACtB,OAAC4f,EAAS5f,CAAC,GAAG4f,EAAS,KAAK5f,CAAC,CAAC,IAAI,CAAC4f,EAAS,KAAK5f,CAAC,GAAG4f,EAAS5f,CAAC,CAAC;AAGtE;AACA,IAAIogB,KAAc,IAAI,WAAW,EAAE;AACnC,SAAShB,GAAIiB,GAAS3nB,GAAKwnB,GAAWpmB,IAAU,CAAA,GAAI;AAClD,MAAI;AAAA,IACF,SAAAwmB,IAAU;AAAA,IACV,MAAAC;AAAA,IACA,IAAAC,IAAK,IAAI,WAAW,EAAE;AAAA,IACtB,QAAAzC;AAAA,EACD,IAAGjkB;AACJ,MAAIymB,MAAS,UACP,OAAOC,KAAO,aAChBA,IAAK5M,EAAW4M,CAAE,IAChBA,EAAG,WAAW,MAAM;AACtB,UAAM,IAAI,MAAM,eAAe;AAKnC,MAFI,OAAO9nB,KAAQ,aACjBA,IAAMkb,EAAWlb,CAAG,IAClBA,EAAI,WAAW,MAAM;AACvB,UAAM,IAAI,MAAM,gBAAgB;AAWlC,MATI,OAAO2nB,KAAY,WACjBH,MAAcb,KAChBgB,IAAUtB,GAAYsB,CAAO,IAE7BA,IAAUzM,EAAWyM,CAAO,IAG9BA,IAAU,WAAW,KAAKA,CAAO,IAE9BC,MAAY,YAAYA,MAAY,aAAaJ,MAAcb,IAAS;AAC3E,UAAMoB,IAAelB,KAAQc,EAAQ,SAASd,IACxCmB,IAAW,IAAI,WAAWL,EAAQ,SAASI,CAAY;AAC7D,IAAAC,EAAS,IAAIL,GAAS,CAAC;AACvB,aAAS7hB,IAAI,GAAGA,IAAIiiB,GAAcjiB;AAChC,MAAAkiB,EAASL,EAAQ,SAAS7hB,CAAC,IAAIiiB;AACjC,IAAAJ,IAAUK;AAAA,EACX;AACD,QAAMd,IAAW,IAAI,YAAYN,EAAK;AACtC,EAAAW,GAAWvnB,GAAKknB,GAAUM,CAAS;AACnC,MAAIS,IAAW,IAAI,WAAWN,EAAQ,MAAM,GACxCO,IAAaJ,GACbK,IAAUR,EAAQ,QAClB3W,IAAQ;AACZ,SAAOmX,KAAWtB,MAAO;AACvB,UAAMjjB,IAAQ+jB,EAAQ,SAAS3W,GAAOA,IAAQ,EAAE;AAChD,QAAI6W,MAAS;AACX,eAAS/hB,IAAI,GAAGA,IAAI+gB,IAAO/gB;AACzB,QAAI0hB,MAAcb,OAChB/iB,EAAMkC,CAAC,KAAKoiB,EAAWpiB,CAAC;AAI9B,IAAAmhB,GAAUrjB,GAAO8jB,IAAaR,CAAQ;AACtC,aAASphB,IAAI,GAAGA,IAAI+gB,IAAO/gB;AACzB,MAAI+hB,MAAS,SACPL,MAAcb,OAChBe,GAAY5hB,CAAC,KAAKoiB,EAAWpiB,CAAC,IAGlCmiB,EAASjX,IAAQlL,CAAC,IAAI4hB,GAAY5hB,CAAC;AAErC,IAAI+hB,MAAS,UACPL,MAAcb,KAChBuB,IAAaR,KAEbQ,IAAatkB,IAGjBukB,KAAWtB,IACX7V,KAAS6V;AAAA,EACV;AACD,OAAKe,MAAY,YAAYA,MAAY,aAAaJ,MAAcb,IAAS;AAC3E,UAAMrgB,IAAM2hB,EAAS,QACfF,IAAeE,EAAS3hB,IAAM,CAAC;AACrC,aAASR,IAAI,GAAGA,KAAKiiB,GAAcjiB;AACjC,UAAImiB,EAAS3hB,IAAMR,CAAC,MAAMiiB;AACxB,cAAM,IAAI,MAAM,oBAAoB;AAExC,IAAAE,IAAWA,EAAS,MAAM,GAAG3hB,IAAMyhB,CAAY;AAAA,EAChD;AACD,SAAI1C,MAAW,UACTmC,MAAcb,KACT5gB,GAAWkiB,CAAQ,IAEnB5N,GAAY4N,CAAQ,IAGtBA;AAEX;AACA,SAASxB,GAAQkB,GAAS3nB,GAAKoB,IAAU,CAAA,GAAI;AAC3C,SAAOslB,GAAIiB,GAAS3nB,GAAK,GAAGoB,CAAO;AACrC;AACA,SAASolB,GAAQmB,GAAS3nB,GAAKoB,IAAU,CAAA,GAAI;AAC3C,SAAOslB,GAAIiB,GAAS3nB,GAAK,GAAGoB,CAAO;AACrC;AAMA;AC52CO,SAASgnB,GAAcrkB,GAAK/D,GAAK0kB,GAAY;AACnD,SAAO2D,GAAI,UAAUtkB,GAAK/D,GAAK0kB,CAAU;AAC1C;AAQO,SAAS4D,GAAOvkB,GAAK3C,GAAS;AACpC,SAAO2f,GAAIhd,GAAK3C,CAAO;AACxB;AASO,SAASmnB,GAAcxkB,GAAK/D,GAAKoB,GAAS;AAChD,SAAOslB,GAAI,QAAQ3iB,GAAK/D,GAAKoB,CAAO;AACrC;AASO,SAASonB,GAAcpD,GAAaplB,GAAKoB,GAAS;AACxD,SAAOslB,GAAI,QAAQtB,GAAaplB,GAAKoB,CAAO;AAC7C;","x_google_ignoreList":[3,4,5,6,7]}
+{"version":3,"file":"cipher-f2ed5ee6.js","sources":["../hooks/network.js","../hooks/utils.js","../hooks/form.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/utils.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/modular.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/curve.js","../../../node_modules/.pnpm/@noble+curves@1.1.0/node_modules/@noble/curves/esm/abstract/weierstrass.js","../../../node_modules/.pnpm/sm-crypto-v2@1.7.0/node_modules/sm-crypto-v2/dist/index.mjs","../hooks/cipher.js"],"sourcesContent":["import axios from \"axios\"\nimport { allowMultipleToast, closeToast, showLoadingToast } from \"vant\"\nimport { isObject, isString } from \"lodash-es\"\n\n/**\n * 请求返回状态码\n * @type {{STATE_CODE_NOT_FOUND: string, STATE_CODE_SUCCESS: string, STATE_CODE_FAIL: string, STATE_CODE_INFO_NOT_COMPLETE: string, STATE_CODE_NOT_ALLOWED: string}}\n */\nexport const STATUS = {\n\tSTATE_CODE_SUCCESS: \"SUCCESS\", // 成功\n\tSTATE_CODE_FAIL: \"FAIL\", // 失败\n\tSTATE_CODE_NOT_FOUND: \"NOT_FOUND\", // 找不到资源\n\tSTATE_CODE_INFO_NOT_COMPLETE: \"INCOMPLETE\", // 信息不完整\n\tSTATE_CODE_NOT_ALLOWED: \"NOT_ALLOWED\", //没有权限\n}\n\n/**\n * STATUS 适配器，内部使用\n * @param status\n * @private\n */\nexport function _configStatus(status) {\n\tObject.keys(status).forEach((key) => {\n\t\tSTATUS[key] = status[key]\n\t})\n}\n\n/**\n * 通用 AJAX 请求\n * @param {Object} [fetcher] - 用于存储请求状态的对象\n * @returns {{post(*=, *=, *=): Promise<unknown>, get(*=, *=): Promise<unknown>}}\n */\nexport function useFetch(fetcher) {\n\t// 记录当前 Fetcher 是否处于 Loading 状态\n\tlet globalLoading = null\n\n\tif (!fetcher) {\n\t\tfetcher = {}\n\t}\n\tfetcher.loading = true\n\n\treturn {\n\t\t/**\n\t\t * get请求\n\t\t * @param url\n\t\t * @param {Object} [config] - axios config\n\t\t * @returns {Promise<unknown>}\n\t\t */\n\t\tget(url, config) {\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\taxios\n\t\t\t\t\t.get(url, config)\n\t\t\t\t\t.then((res) => {\n\t\t\t\t\t\tresolve(res)\n\t\t\t\t\t})\n\t\t\t\t\t.catch((err) => {\n\t\t\t\t\t\treject(err)\n\t\t\t\t\t})\n\t\t\t\t\t.finally(() => {\n\t\t\t\t\t\tif (globalLoading) {\n\t\t\t\t\t\t\tallowMultipleToast(false)\n\t\t\t\t\t\t\tglobalLoading.close()\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfetcher.loading = false\n\t\t\t\t\t})\n\t\t\t})\n\t\t},\n\t\t/**\n\t\t * post请求\n\t\t * @param {string} url\n\t\t * @param {Object} data\n\t\t * @param {Object} [config] - axios config\n\t\t * @returns {Promise<unknown>}\n\t\t */\n\t\tpost(url, data, config) {\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\taxios\n\t\t\t\t\t.post(url, data, config)\n\t\t\t\t\t.then((res) => {\n\t\t\t\t\t\tresolve(res)\n\t\t\t\t\t})\n\t\t\t\t\t.catch((err) => {\n\t\t\t\t\t\treject(err)\n\t\t\t\t\t})\n\t\t\t\t\t.finally(() => {\n\t\t\t\t\t\tif (globalLoading) {\n\t\t\t\t\t\t\tallowMultipleToast(false)\n\t\t\t\t\t\t\tglobalLoading.close()\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfetcher.loading = false\n\t\t\t\t\t})\n\t\t\t})\n\t\t},\n\n\t\t/**\n\t\t * 参数为\n\t\t * @param {String|Object} [message] Toast 的 Message 或者是 Toast 的配置\n\t\t * @return {*}\n\t\t */\n\t\tloading(message) {\n\t\t\tcloseToast(true)\n\t\t\tallowMultipleToast()\n\t\t\tif (isString(message)) {\n\t\t\t\tglobalLoading = showLoadingToast({\n\t\t\t\t\tmessage: message || \"加载中...\",\n\t\t\t\t\tduration: 0,\n\t\t\t\t\tforbidClick: true,\n\t\t\t\t})\n\t\t\t} else if (isObject(message)) {\n\t\t\t\tglobalLoading = showLoadingToast({ duration: 0, ...message })\n\t\t\t} else {\n\t\t\t\tglobalLoading = showLoadingToast({\n\t\t\t\t\tmessage: \"加载中...\",\n\t\t\t\t\tduration: 0,\n\t\t\t\t\tforbidClick: true,\n\t\t\t\t})\n\t\t\t}\n\n\t\t\treturn this\n\t\t},\n\t}\n}\n","import { find, flatMapDeep, isNull, isUndefined, reduce } from \"lodash-es\"\n\n/**\n * 从 options 中根据 value 获取 text\n * @param value\n * @param options\n * * @param {Object} [adapter={value: \"value\",label: \"label\",children: \"children\"}] - 选项适配器\n * @param adapter\n * @return {*|string|string}\n */\nexport function useTextFromOptionsValue(value, options, adapter) {\n\tif (!options) {\n\t\treturn \"\"\n\t}\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t}\n\tconst option = options.find((option) => option[adapter.value] === value)\n\treturn option ? option[adapter.label] : \"\"\n}\n\n/**\n * 从嵌套的 options 中根据 value 获取 text, 如 [1, 3] => [\"东\", \"南\"]\n *\n * @param {Array} options - 嵌套的选项\n * @param {Array} values - 需要查找的值\n * @param {Object} [adapter={value: \"value\",label: \"label\",children: \"children\"}] - 选项适配器\n * @return Array\n */\nexport function useFindTextsInValues(options, values, adapter) {\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t\tchildren: \"children\",\n\t}\n\n\tconst labels = []\n\n\tfunction recursiveSearch(node) {\n\t\tif (values.includes(node[adapter.value])) {\n\t\t\tlabels.push(node[adapter.label])\n\t\t}\n\n\t\tif (node[adapter.children]?.length) {\n\t\t\tnode[adapter.children].forEach((child) => {\n\t\t\t\trecursiveSearch(child)\n\t\t\t})\n\t\t}\n\t}\n\n\toptions.forEach((item) => {\n\t\trecursiveSearch(item)\n\t})\n\n\treturn labels\n}\n\n/**\n * 从嵌套的 options 中根据 value 获取 label, 如地区路径:  [440000, 440100, 440113] => ['广东省', '广州市', '番禺区']\n * @param {Array} options\n * @param {Array} path\n * @param {Object} [adapter]\n * @return Array\n */\nexport function useFindLabelsFromPath(options, path, adapter) {\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t\tchildren: \"children\",\n\t}\n\n\tlet labels = []\n\treduce(\n\t\tpath,\n\t\t(acc, value) => {\n\t\t\tconst item = find(acc, { [adapter.value]: value })\n\t\t\tif (item) {\n\t\t\t\tlabels.push(item[adapter.label])\n\t\t\t\treturn item[adapter.children]\n\t\t\t}\n\t\t},\n\t\toptions,\n\t)\n\treturn labels\n}\n\n/**\n * 从 options 为 [{text: \"\", value: \"\", children: []] 样式的多层数组中，根据所给的 value 递归找出该 option\n * @param {Array} options\n * @param {Number|String} value\n * @param {Object} [adapter]\n * @return {Object|null}\n */\nexport function useFindOptionByValue(options, value, adapter) {\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t\tchildren: \"children\",\n\t}\n\n\t// 遍历 options 数组\n\tfor (let option of options) {\n\t\t// 如果当前 option 的 value 匹配目标值，则返回当前 option\n\t\tif (option[adapter.value] === value) {\n\t\t\treturn option\n\t\t}\n\t\t// 如果当前 option 有子选项\n\t\tif (option[adapter.children] && option[adapter.children].length) {\n\t\t\t// 递归搜索子选项数组\n\t\t\tconst foundOption = useFindOptionByValue(option[adapter.children], value, adapter)\n\t\t\t// 如果找到了匹配的子选项，则返回\n\t\t\tif (foundOption) {\n\t\t\t\treturn foundOption\n\t\t\t}\n\t\t}\n\t}\n\t// 如果未找到匹配的选项，则返回 null\n\treturn null\n}\n\n/**\n * [移动端适配]\n * 从嵌套的 options 中根据 value 获取 text\n * @param {Array} options\n * @param {Array} path\n * @param {Object} [adapter]\n * @return Array\n */\nexport function useFindTextsFromPath(options, path, adapter) {\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t\tchildren: \"children\",\n\t}\n\treturn useFindLabelsFromPath(options, path, adapter)\n}\n\n/**\n * let obj = {\n *     \"name\": \"西学楼1号\",\n *     \"parent\": {\n *         \"name\": \"学生宿舍\",\n *         \"parent\": {\n *             \"name\": \"宿舍区域\",\n *         }\n *     }\n * }\n * useFindPropertyRecursive(obj, 'name', 'parent') // [\"西学楼1号\", \"学生宿舍\", \"宿舍区域\"]\n *\n * 从嵌套的对象中递归获取某个属性\n * @param {Object} item 获取对象\n * @param {String} propertyKey 想获取的属性名称\n * @param {String} nestedKey 嵌套的属性\n * @return Array\n */\nexport function useFindPropertyRecursive(item, propertyKey, nestedKey) {\n\treturn flatMapDeep(item, (value, key) => {\n\t\tif (key === propertyKey) {\n\t\t\treturn value\n\t\t}\n\t\tif (key === nestedKey) {\n\t\t\treturn useFindPropertyRecursive(value, propertyKey, nestedKey)\n\t\t}\n\t\treturn []\n\t})\n}\n\n/**\n * 从嵌套的 options 中根据 value 获取 text 路径, 如地区路径: 440113 => [\"广东省\", \"广州市\", \" 番禺区\"]\n * @param options\n * @param value\n * @param adapter\n * @return {*}\n */\nexport function useFindParentLabels(options, value, adapter) {\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t\tchildren: \"children\",\n\t}\n\n\tconst labels = []\n\n\tfunction findParentLabels(options, value, labels) {\n\t\tfor (const option of options) {\n\t\t\tif (option[adapter.value] === value) {\n\t\t\t\tlabels.unshift(option[adapter.label])\n\t\t\t\tbreak\n\t\t\t} else if (option[adapter.children]) {\n\t\t\t\tconst childResult = findParentLabels(option[adapter.children], value, labels)\n\t\t\t\tif (childResult.length > 0) {\n\t\t\t\t\tlabels.unshift(option[adapter.label])\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn labels\n\t}\n\n\treturn findParentLabels(options, value, labels)\n}\n\n/**\n * 从嵌套的 options 中根据 value 获取整个 values 路径, 如地区路径: 440113 => [440000, 440100, 440113]\n * @param options\n * @param value\n * @param adapter\n * @return Array\n */\nexport function useFindParentValues(options, value, adapter) {\n\tadapter = adapter || {\n\t\tvalue: \"value\",\n\t\tlabel: \"text\",\n\t\tchildren: \"children\",\n\t}\n\n\tconst values = []\n\n\tfunction findParentValues(options, value, values) {\n\t\tfor (const option of options) {\n\t\t\tif (option[adapter.value] === value) {\n\t\t\t\tvalues.unshift(option[adapter.value])\n\t\t\t\tbreak\n\t\t\t} else if (option[adapter.children]) {\n\t\t\t\tconst childResult = findParentValues(option[adapter.children], value, values)\n\t\t\t\tif (childResult.length > 0) {\n\t\t\t\t\tvalues.unshift(option[adapter.value])\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn values\n\t}\n\n\treturn findParentValues(options, value, values)\n}\n\nconst localCacheSession = {}\nconst localSession = {\n\tsetItem(key, value) {\n\t\tlocalCacheSession[key] = value\n\t},\n\tgetItem(key) {\n\t\treturn localCacheSession[key]\n\t},\n\tremoveItem(key) {\n\t\tdelete localCacheSession[key]\n\t},\n}\n\nwindow._printCache = () => {\n\tconsole.log(JSON.parse(JSON.stringify(localCacheSession, null, 2)))\n}\n\n/**\n * 用于储存缓存的值\n * @param {*} key 缓存的 key\n * @param {*} [sessionType] 缓存的类型，默认为内存缓存\n * @returns get(默认值) 获取缓存的值，set(键, 值) 设置缓存的值\n */\nexport function useCache(key, sessionType) {\n\tconst cacheSession = sessionType || localSession\n\tconst shouldTransform = !!sessionType // 如果是 localStorage 之类的，则需要转换一下\n\treturn {\n\t\tget(defaultValue) {\n\t\t\tconst value = cacheSession.getItem(key)\n\t\t\tif (isNull(value) || isUndefined(value)) {\n\t\t\t\treturn defaultValue\n\t\t\t}\n\t\t\treturn shouldTransform ? JSON.parse(value) : value\n\t\t},\n\t\tset(value) {\n\t\t\tcacheSession.setItem(key, shouldTransform ? JSON.stringify(value) : value)\n\t\t},\n\t\tremove() {\n\t\t\tcacheSession.removeItem(key)\n\t\t},\n\t}\n}\n","import { cloneDeep, isArray, isBoolean, isDate, isFunction, isObject, isString, isUndefined } from \"lodash-es\"\nimport { STATUS } from \"./network\"\nimport { showFailToast, showSuccessToast } from \"vant\"\nimport dayjs from \"dayjs\"\n\n/**\n * 创建一个隐藏的表单\n *\n * @param {Object} options\n * @param {string} options.url\n * @param {Object} options.data\n * @param {string} [options.method]\n * @param {string} options.csrfToken\n * @returns {HTMLFormElement}\n */\nexport function useHiddenForm(options) {\n\tconst { url, data, csrfToken } = options\n\tlet { method } = options\n\n\tmethod = method || \"post\"\n\n\tconst form = document.createElement(\"form\")\n\tform.action = url\n\tform.method = method\n\tform.target = \"_blank\"\n\tform.style.display = \"none\"\n\n\tObject.keys(data).forEach((key) => {\n\t\tconst input = document.createElement(\"input\")\n\t\tinput.type = \"hidden\"\n\t\tinput.name = key\n\t\tinput.value = data[key]\n\t\tform.appendChild(input)\n\t})\n\n\tif (!csrfToken) {\n\t\tconst input = document.createElement(\"input\")\n\t\tinput.type = \"hidden\"\n\t\tinput.name = \"_token\"\n\t\tinput.value = document.querySelector('meta[name=\"csrf-token\"]').getAttribute(\"content\")\n\t\tform.appendChild(input)\n\t}\n\n\tdocument.body.appendChild(form)\n\n\treturn form\n}\n\n/**\n * 处理请求结果\n *\n * @param {object} res 请求结果\n * @param {string|number} res.status 请求结果状态\n * @param {*} res.result 请求结果信息\n * @param {Object.<string, string|function>} ops 状态的处理对象\n */\nexport function useProcessStatus(res, ops) {\n\tconst { status } = res\n\tconst msg = res.result\n\tconst predefined = {}\n\tpredefined.default = \"请求失败, 请检查数据并重试\"\n\tpredefined[STATUS.STATE_CODE_FAIL] = \"系统错误，请稍候再试\"\n\tpredefined[STATUS.STATE_CODE_NOT_FOUND] = \"请求的内容不存在\"\n\tpredefined[STATUS.STATE_CODE_INFO_NOT_COMPLETE] = \"信息不完整\"\n\tpredefined[STATUS.STATE_CODE_NOT_ALLOWED] = \"没有权限\"\n\n\t// 有几个常用的自定义名称\n\tconst special = {\n\t\t[STATUS.STATE_CODE_SUCCESS]: \"success\",\n\t}\n\n\tconst op = ops[status] || ops[special[status]] || predefined[status] || predefined.default\n\n\tif (isString(op)) {\n\t\tif (status === STATUS.STATE_CODE_SUCCESS) {\n\t\t\tshowSuccessToast(op)\n\t\t} else {\n\t\t\tshowFailToast(msg || op)\n\t\t}\n\t} else if (isFunction(op)) {\n\t\top()\n\t}\n}\n\n/**\n * 处理正确请求结果\n *\n * @param {object} res 请求结果\n * @param {string} res.status 请求结果状态\n * @param {*} res.result 请求结果信息\n * @param {string|function} success 状态的处理对象\n */\nexport function useProcessStatusSuccess(res, success) {\n\tuseProcessStatus(res, { success })\n}\n\n/**\n * 处理表单提交失败\n * @param {*} e\n */\nexport function useFormFail(e) {\n\tif (e && e.errorFields) {\n\t\te.errorFields.forEach((item) => {\n\t\t\tshowFailToast(item.errors.join(\" \"))\n\t\t})\n\t} else if (!(e && e.response)) {\n\t\tshowFailToast(\"请检查填写项\")\n\t} else {\n\t\tshowFailToast(\"网络异常\")\n\t}\n}\n\n/**\n * 处理表单数据\n * @param {Object} form\n * @param {Object} [format] 需要处理的类型\n * @param {boolean|string|Function} [format.date] `true`: 转成时间戳，`string`: 为 Format 格式, 如 `\"YYYY-MM-DD\"`, `function`: 自定义处理函数, 参数为 dayjs 对象\n * @param {boolean} [format.boolean] 布尔值处理, 如果开启则 `true` 转成 1, `false` 转成 0\n * @param {string|Function} [format.attachment] `string`: 附件字段名, `function`: 自定义处理函数, 参数为附件对象\n * @return {Object}\n */\nexport function useFormFormat(form, format) {\n\t//必须先 Copy form, 否则会改变 vm model 里的引用值而导致出错\n\tconst newForm = cloneDeep(form)\n\tformat = format || {}\n\tconst formatter = (obj) => {\n\t\tfor (let key in obj) {\n\t\t\t//日期处理\n\n\t\t\tlet date\n\t\t\tif (dayjs.isDayjs(obj[key])) {\n\t\t\t\tdate = obj[key]\n\t\t\t} else if (isDate(obj[key])) {\n\t\t\t\tdate = dayjs(obj[key])\n\t\t\t}\n\n\t\t\tif (date && format.date) {\n\t\t\t\tif (isString(format.date)) {\n\t\t\t\t\tobj[key] = date.format(format.date)\n\t\t\t\t} else if (isFunction(format.date)) {\n\t\t\t\t\tobj[key] = format.date(date)\n\t\t\t\t} else {\n\t\t\t\t\tobj[key] = date.unix()\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t//布尔值处理\n\t\t\tif (isBoolean(obj[key]) && format.boolean) {\n\t\t\t\tif (format.boolean === true) {\n\t\t\t\t\tobj[key] = obj[key] ? 1 : 0\n\t\t\t\t} else if (Array.isArray(format.boolean)) {\n\t\t\t\t\tobj[key] = obj[key] ? format.boolean?.[0] || 1 : format.boolean?.[1] || 0\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t//附件处理\n\t\t\tif (format.attachment) {\n\t\t\t\tconst checker = format.attachment\n\t\t\t\tif (isObject(obj[key]) && obj[key]._type === \"file\" && isString(checker) && !isUndefined(obj[key][checker])) {\n\t\t\t\t\tobj[key] = obj[key][checker]\n\t\t\t\t\tcontinue\n\t\t\t\t} else if (isObject(obj[key]) && isFunction(checker) && obj[key]._type === \"file\") {\n\t\t\t\t\tobj[key] = checker(obj[key])\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//数组处理\n\t\t\tif (isArray(obj[key])) {\n\t\t\t\tobj[key] = formatter(obj[key])\n\t\t\t}\n\t\t}\n\n\t\treturn obj\n\t}\n\n\treturn formatter(newForm)\n}\n\nexport default {\n\tuseHiddenForm,\n\tuseProcessStatus,\n\tuseProcessStatusSuccess,\n\tuseFormFail,\n\tuseFormFormat,\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst u8a = (a) => a instanceof Uint8Array;\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (u8a(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(`${title} must be hex string or Uint8Array`);\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\nexport function equalBytes(b1, b2) {\n    // We don't care about timing attacks here\n    if (b1.length !== b2.length)\n        return false;\n    for (let i = 0; i < b1.length; i++)\n        if (b1[i] !== b2[i])\n            return false;\n    return true;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport const bitSet = (n, pos, value) => {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n};\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n    if (number === _0n || modulo <= _0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\n// Tonelli-Shanks algorithm\n// Paper 1: https://eprint.iacr.org/2012/685.pdf (page 12)\n// Paper 2: Square Roots from 1; 24, 51, 10 to Dan Shanks\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nexport function FpSqrt(P) {\n    // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n    // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, _2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\nexport function FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n// 0 is non-invertible: non-batched version will throw on 0\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a galois field over prime. Non-primes are not supported for now.\n * Do not init in loop: slow. Very fragile: always run a benchmark on change.\n * Major performance gains:\n * a) non-normalized operations like mulN instead of mul\n * b) `Object.freeze`\n * c) Same object shape: never add or remove keys\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Fp ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * FIPS 186 B.4.1-compliant \"constant-time\" private key generation utility.\n * Can take (n+8) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 40 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. curveFn.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.js';\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: class DERErr extends Error {\n        constructor(m = '') {\n            super(m);\n        }\n    },\n    _parseInt(data) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            throw new E('Invalid signature integer tag');\n        const len = data[1];\n        const res = data.subarray(2, len + 2);\n        if (!len || res.length !== len)\n            throw new E('Invalid signature integer: wrong length');\n        // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n        // since we always use positive integers here. It must always be empty:\n        // - add zero byte if exists\n        // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n        if (res[0] & 0b10000000)\n            throw new E('Invalid signature integer: negative');\n        if (res[0] === 0x00 && !(res[1] & 0b10000000))\n            throw new E('Invalid signature integer: unnecessary leading zero');\n        return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        if (!(data instanceof Uint8Array))\n            throw new Error('ui8a expected');\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            throw new E('Invalid signature: incorrect length');\n        const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n        if (rBytesLeft.length)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\n            const hex = num.toString(16);\n            return hex.length & 1 ? `0${hex}` : hex;\n        };\n        const s = slice(h(sig.s));\n        const r = slice(h(sig.r));\n        const shl = s.length / 2;\n        const rhl = r.length / 2;\n        const sl = h(shl);\n        const rl = h(rhl);\n        return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((c, point, isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (key instanceof Uint8Array)\n                key = ut.bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            num = mod.mod(num, n); // disabled by default, enabled for BLS\n        assertGE(num); // num in range [1..N-1]\n        return num;\n    }\n    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n     * Default Point works in 2d / affine coordinates: (x, y)\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         * Takes a bunch of Projective Points but executes only one\n         * inversion on all of them. Inversion is very slow operation,\n         * so this improves performance massively.\n         * Optimization: converts a list of projective points to a list of identical points with Z=1.\n         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            // Zero is valid point too!\n            if (this.is0()) {\n                if (CURVE.allowInfinityPoint)\n                    return;\n                throw new Error('bad point: ZERO');\n            }\n            // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n            const { x, y } = this.toAffine();\n            // Check if x, y are valid field elements\n            if (!Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('bad point: x or y not FE');\n            const left = Fp.sqr(y); // y²\n            const right = weierstrassEquation(x); // x³ + ax + b\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\n                const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n                return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n            });\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(n) {\n            const I = Point.ZERO;\n            if (n === _0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === _1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // Fake point is used to const-time mult\n            const { endo } = CURVE;\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(n);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\n        // Converts Projective point to affine (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        // (x, y, z) ∋ (x=x/z, y=y/z)\n        toAffine(iz) {\n            const { px: x, py: y, pz: z } = this;\n            const is0 = this.is0();\n            // If invZ was 0, we return zero point. However we still want to execute\n            // all operations, so we replace invZ with a random number, 1.\n            if (iz == null)\n                iz = is0 ? Fp.ONE : Fp.inv(z);\n            const ax = Fp.mul(x, iz);\n            const ay = Fp.mul(y, iz);\n            const zz = Fp.mul(z, iz);\n            if (is0)\n                return { x: Fp.ZERO, y: Fp.ZERO };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function isValidFieldElement(num) {\n        return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return mod.mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return mod.invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = ut.concatBytes;\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = ut.bytesToNumberBE(tail);\n                if (!isValidFieldElement(x))\n                    throw new Error('Point is not on curve');\n                const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n                let y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n                const isYOdd = (y & _1n) === _1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return ut.hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return ut.hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size (nBitLength+64)\n         * as per FIPS 186 B.4.1 with modulo bias being neglible.\n         */\n        randomPrivateKey: () => {\n            const rand = CURVE.randomBytes(Fp.BYTES + 8);\n            const num = mod.hashToPrivateScalar(rand, CURVE_ORDER);\n            return ut.numberToBytesBE(num, CURVE.nByteLength);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const arr = item instanceof Uint8Array;\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = CURVE.bits2int ||\n        function (bytes) {\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('bigint expected');\n        if (!(_0n <= num && num < ORDER_MASK))\n            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n        // works with order, can have different size than numToField!\n        return ut.numberToBytesBE(num, CURVE.nByteLength);\n    }\n    // Steps A, D of RFC6979 3.2\n    // Creates RFC6979 seed; converts msg/privKey to numbers.\n    // Used only in sign, not in verify.\n    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n    // Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(ensureBytes('extraEntropy', e, Fp.BYTES)); // check for being of size BYTES\n        }\n        const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n            // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n            // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n            const s = modN(ik * modN(m + r * d)); // Not using blinding here\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   U1 = hs^-1 mod n\n     *   U2 = rs^-1 mod n\n     *   R = U1⋅G - U2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || sg instanceof Uint8Array) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\n            }\n            else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n                const { r, s } = sg;\n                _sig = new Signature(r, s);\n            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (error.message === 'PARSE')\n                throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n            return false;\n        }\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * From draft-irtf-cfrg-hash-to-curve-16\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    mod.validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, opts.Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map","var __defProp = Object.defineProperty;\nvar __export = (target, all) => {\n  for (var name in all)\n    __defProp(target, name, { get: all[name], enumerable: true });\n};\n\n// src/sm2/index.ts\nvar sm2_exports = {};\n__export(sm2_exports, {\n  EmptyArray: () => EmptyArray,\n  arrayToHex: () => arrayToHex,\n  arrayToUtf8: () => arrayToUtf8,\n  calculateSharedKey: () => calculateSharedKey,\n  comparePublicKeyHex: () => comparePublicKeyHex,\n  compressPublicKeyHex: () => compressPublicKeyHex,\n  doDecrypt: () => doDecrypt,\n  doEncrypt: () => doEncrypt,\n  doSignature: () => doSignature,\n  doVerifySignature: () => doVerifySignature,\n  generateKeyPairHex: () => generateKeyPairHex,\n  getHash: () => getHash,\n  getPoint: () => getPoint,\n  getPublicKeyFromPrivateKey: () => getPublicKeyFromPrivateKey,\n  getZ: () => getZ,\n  hexToArray: () => hexToArray,\n  initRNGPool: () => initRNGPool,\n  leftPad: () => leftPad,\n  precomputePublicKey: () => precomputePublicKey,\n  utf8ToHex: () => utf8ToHex,\n  verifyPublicKey: () => verifyPublicKey\n});\n\n// src/sm2/asn1.ts\nimport * as utils from \"@noble/curves/abstract/utils\";\n\n// src/sm2/bn.ts\nvar ZERO = BigInt(0);\nvar ONE = BigInt(1);\nvar TWO = BigInt(2);\nvar THREE = BigInt(3);\n\n// src/sm2/asn1.ts\nfunction bigintToValue(bigint) {\n  let h = bigint.toString(16);\n  if (h[0] !== \"-\") {\n    if (h.length % 2 === 1)\n      h = \"0\" + h;\n    else if (!h.match(/^[0-7]/))\n      h = \"00\" + h;\n  } else {\n    h = h.substring(1);\n    let len = h.length;\n    if (len % 2 === 1)\n      len += 1;\n    else if (!h.match(/^[0-7]/))\n      len += 2;\n    let maskString = \"\";\n    for (let i = 0; i < len; i++)\n      maskString += \"f\";\n    let mask = utils.hexToNumber(maskString);\n    let output = (mask ^ bigint) + ONE;\n    h = output.toString(16).replace(/^-/, \"\");\n  }\n  return h;\n}\nvar ASN1Object = class {\n  constructor(tlv = null, t = \"00\", l = \"00\", v = \"\") {\n    this.tlv = tlv;\n    this.t = t;\n    this.l = l;\n    this.v = v;\n  }\n  getEncodedHex() {\n    if (!this.tlv) {\n      this.v = this.getValue();\n      this.l = this.getLength();\n      this.tlv = this.t + this.l + this.v;\n    }\n    return this.tlv;\n  }\n  getLength() {\n    const n = this.v.length / 2;\n    let nHex = n.toString(16);\n    if (nHex.length % 2 === 1)\n      nHex = \"0\" + nHex;\n    if (n < 128) {\n      return nHex;\n    } else {\n      const head = 128 + nHex.length / 2;\n      return head.toString(16) + nHex;\n    }\n  }\n  getValue() {\n    return \"\";\n  }\n};\nvar DERInteger = class extends ASN1Object {\n  constructor(bigint) {\n    super();\n    this.t = \"02\";\n    if (bigint)\n      this.v = bigintToValue(bigint);\n  }\n  getValue() {\n    return this.v;\n  }\n};\nvar DERSequence = class extends ASN1Object {\n  constructor(asn1Array) {\n    super();\n    this.asn1Array = asn1Array;\n  }\n  t = \"30\";\n  getValue() {\n    this.v = this.asn1Array.map((asn1Object) => asn1Object.getEncodedHex()).join(\"\");\n    return this.v;\n  }\n};\nfunction getLenOfL(str, start) {\n  if (+str[start + 2] < 8)\n    return 1;\n  return +str.substring(start + 2, start + 4) & 127 + 1;\n}\nfunction getL(str, start) {\n  const len = getLenOfL(str, start);\n  const l = str.substring(start + 2, start + 2 + len * 2);\n  if (!l)\n    return -1;\n  const bigint = +l[0] < 8 ? utils.hexToNumber(l) : utils.hexToNumber(l.substring(2));\n  return +bigint.toString();\n}\nfunction getStartOfV(str, start) {\n  const len = getLenOfL(str, start);\n  return start + (len + 1) * 2;\n}\nfunction encodeDer(r, s) {\n  const derR = new DERInteger(r);\n  const derS = new DERInteger(s);\n  const derSeq = new DERSequence([derR, derS]);\n  return derSeq.getEncodedHex();\n}\nfunction decodeDer(input) {\n  const start = getStartOfV(input, 0);\n  const vIndexR = getStartOfV(input, start);\n  const lR = getL(input, start);\n  const vR = input.substr(vIndexR, lR * 2);\n  const nextStart = vIndexR + vR.length;\n  const vIndexS = getStartOfV(input, nextStart);\n  const lS = getL(input, nextStart);\n  const vS = input.substring(vIndexS, vIndexS + lS * 2);\n  const r = utils.hexToNumber(vR);\n  const s = utils.hexToNumber(vS);\n  return { r, s };\n}\n\n// src/sm2/utils.ts\nimport * as utils2 from \"@noble/curves/abstract/utils\";\n\n// src/sm2/ec.ts\nimport { weierstrass } from \"@noble/curves/abstract/weierstrass\";\nimport { Field } from \"@noble/curves/abstract/modular\";\n\n// src/sm2/rng.ts\nvar DEFAULT_PRNG_POOL_SIZE = 16384;\nvar prngPool = new Uint8Array(0);\nvar _syncCrypto;\nasync function initRNGPool() {\n  if (\"crypto\" in globalThis) {\n    _syncCrypto = globalThis.crypto;\n    return;\n  }\n  if (prngPool.length > DEFAULT_PRNG_POOL_SIZE / 2)\n    return;\n  if (\"wx\" in globalThis && \"getRandomValues\" in globalThis.wx) {\n    prngPool = await new Promise((r) => {\n      wx.getRandomValues({\n        length: DEFAULT_PRNG_POOL_SIZE,\n        success(res) {\n          r(new Uint8Array(res.randomValues));\n        }\n      });\n    });\n  } else {\n    try {\n      if (globalThis.crypto) {\n        _syncCrypto = globalThis.crypto;\n      } else {\n        const crypto = await import(\n          /* webpackIgnore: true */\n          \"crypto\"\n        );\n        _syncCrypto = crypto.webcrypto;\n      }\n      const array = new Uint8Array(DEFAULT_PRNG_POOL_SIZE);\n      _syncCrypto.getRandomValues(array);\n      prngPool = array;\n    } catch (error) {\n      throw new Error(\"no available csprng, abort.\");\n    }\n  }\n}\ninitRNGPool();\nfunction consumePool(length) {\n  if (prngPool.length > length) {\n    const prng = prngPool.slice(0, length);\n    prngPool = prngPool.slice(length);\n    initRNGPool();\n    return prng;\n  } else {\n    throw new Error(\"random number pool is not ready or insufficient, prevent getting too long random values or too often.\");\n  }\n}\nfunction randomBytes(length = 0) {\n  const array = new Uint8Array(length);\n  if (_syncCrypto) {\n    return _syncCrypto.getRandomValues(array);\n  } else {\n    const result = consumePool(length);\n    return result;\n  }\n}\n\n// src/sm3/utils.ts\nvar u8a = (a) => a instanceof Uint8Array;\nvar createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\nvar isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;\nif (!isLE)\n  throw new Error(\"Non little-endian hardware is not supported\");\nvar hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, \"0\"));\nfunction bytesToHex(bytes) {\n  if (!u8a(bytes))\n    throw new Error(\"Uint8Array expected\");\n  let hex = \"\";\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\nfunction utf8ToBytes(str) {\n  if (typeof str !== \"string\")\n    throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str));\n}\nfunction toBytes(data) {\n  if (typeof data === \"string\")\n    data = utf8ToBytes(data);\n  if (!u8a(data))\n    throw new Error(`expected Uint8Array, got ${typeof data}`);\n  return data;\n}\nvar Hash = class {\n  clone() {\n    return this._cloneInto();\n  }\n};\nfunction wrapConstructor(hashCons) {\n  const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n  const tmp2 = hashCons();\n  hashC.outputLen = tmp2.outputLen;\n  hashC.blockLen = tmp2.blockLen;\n  hashC.create = () => hashCons();\n  return hashC;\n}\n\n// src/sm2/sm3.ts\nvar BoolA = (A, B, C) => A & B | A & C | B & C;\nvar BoolB = (A, B, C) => A ^ B ^ C;\nvar BoolC = (A, B, C) => A & B | ~A & C;\nfunction setBigUint64(view, byteOffset, value, isLE2) {\n  if (typeof view.setBigUint64 === \"function\")\n    return view.setBigUint64(byteOffset, value, isLE2);\n  const _32n = BigInt(32);\n  const _u32_max = BigInt(4294967295);\n  const wh = Number(value >> _32n & _u32_max);\n  const wl = Number(value & _u32_max);\n  const h = isLE2 ? 4 : 0;\n  const l = isLE2 ? 0 : 4;\n  view.setUint32(byteOffset + h, wh, isLE2);\n  view.setUint32(byteOffset + l, wl, isLE2);\n}\nfunction rotl(x2, n) {\n  const s = n & 31;\n  return x2 << s | x2 >>> 32 - s;\n}\nfunction P0(X) {\n  return X ^ rotl(X, 9) ^ rotl(X, 17);\n}\nfunction P1(X) {\n  return X ^ rotl(X, 15) ^ rotl(X, 23);\n}\nvar SHA2 = class extends Hash {\n  constructor(blockLen, outputLen, padOffset, isLE2) {\n    super();\n    this.blockLen = blockLen;\n    this.outputLen = outputLen;\n    this.padOffset = padOffset;\n    this.isLE = isLE2;\n    this.buffer = new Uint8Array(blockLen);\n    this.view = createView(this.buffer);\n  }\n  buffer;\n  view;\n  finished = false;\n  length = 0;\n  pos = 0;\n  destroyed = false;\n  update(data) {\n    const { view, buffer, blockLen } = this;\n    data = toBytes(data);\n    const len = data.length;\n    for (let pos = 0; pos < len; ) {\n      const take = Math.min(blockLen - this.pos, len - pos);\n      if (take === blockLen) {\n        const dataView = createView(data);\n        for (; blockLen <= len - pos; pos += blockLen)\n          this.process(dataView, pos);\n        continue;\n      }\n      buffer.set(data.subarray(pos, pos + take), this.pos);\n      this.pos += take;\n      pos += take;\n      if (this.pos === blockLen) {\n        this.process(view, 0);\n        this.pos = 0;\n      }\n    }\n    this.length += data.length;\n    this.roundClean();\n    return this;\n  }\n  digestInto(out) {\n    this.finished = true;\n    const { buffer, view, blockLen, isLE: isLE2 } = this;\n    let { pos } = this;\n    buffer[pos++] = 128;\n    this.buffer.subarray(pos).fill(0);\n    if (this.padOffset > blockLen - pos) {\n      this.process(view, 0);\n      pos = 0;\n    }\n    for (let i = pos; i < blockLen; i++)\n      buffer[i] = 0;\n    setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE2);\n    this.process(view, 0);\n    const oview = createView(out);\n    const len = this.outputLen;\n    if (len % 4)\n      throw new Error(\"_sha2: outputLen should be aligned to 32bit\");\n    const outLen = len / 4;\n    const state = this.get();\n    if (outLen > state.length)\n      throw new Error(\"_sha2: outputLen bigger than state\");\n    for (let i = 0; i < outLen; i++)\n      oview.setUint32(4 * i, state[i], isLE2);\n  }\n  digest() {\n    const { buffer, outputLen } = this;\n    this.digestInto(buffer);\n    const res = buffer.slice(0, outputLen);\n    this.destroy();\n    return res;\n  }\n  _cloneInto(to) {\n    to ||= new this.constructor();\n    to.set(...this.get());\n    const { blockLen, buffer, length, finished, destroyed, pos } = this;\n    to.length = length;\n    to.pos = pos;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    if (length % blockLen)\n      to.buffer.set(buffer);\n    return to;\n  }\n};\nvar IV = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);\nvar SM3_W = new Uint32Array(68);\nvar SM3_M = new Uint32Array(64);\nvar T1 = 2043430169;\nvar T2 = 2055708042;\nvar SM3 = class extends SHA2 {\n  A = IV[0] | 0;\n  B = IV[1] | 0;\n  C = IV[2] | 0;\n  D = IV[3] | 0;\n  E = IV[4] | 0;\n  F = IV[5] | 0;\n  G = IV[6] | 0;\n  H = IV[7] | 0;\n  constructor() {\n    super(64, 32, 8, false);\n  }\n  get() {\n    const { A, B, C, D, E, F, G, H } = this;\n    return [A, B, C, D, E, F, G, H];\n  }\n  set(A, B, C, D, E, F, G, H) {\n    this.A = A | 0;\n    this.B = B | 0;\n    this.C = C | 0;\n    this.D = D | 0;\n    this.E = E | 0;\n    this.F = F | 0;\n    this.G = G | 0;\n    this.H = H | 0;\n  }\n  process(view, offset) {\n    for (let i = 0; i < 16; i++, offset += 4)\n      SM3_W[i] = view.getUint32(offset, false);\n    for (let i = 16; i < 68; i++) {\n      SM3_W[i] = P1(SM3_W[i - 16] ^ SM3_W[i - 9] ^ rotl(SM3_W[i - 3], 15)) ^ rotl(SM3_W[i - 13], 7) ^ SM3_W[i - 6];\n    }\n    for (let i = 0; i < 64; i++) {\n      SM3_M[i] = SM3_W[i] ^ SM3_W[i + 4];\n    }\n    let { A, B, C, D, E, F, G, H } = this;\n    for (let j = 0; j < 64; j++) {\n      let small = j >= 0 && j <= 15;\n      let T = small ? T1 : T2;\n      let SS1 = rotl(rotl(A, 12) + E + rotl(T, j), 7);\n      let SS2 = SS1 ^ rotl(A, 12);\n      let TT1 = (small ? BoolB(A, B, C) : BoolA(A, B, C)) + D + SS2 + SM3_M[j] | 0;\n      let TT2 = (small ? BoolB(E, F, G) : BoolC(E, F, G)) + H + SS1 + SM3_W[j] | 0;\n      D = C;\n      C = rotl(B, 9);\n      B = A;\n      A = TT1;\n      H = G;\n      G = rotl(F, 19);\n      F = E;\n      E = P0(TT2);\n    }\n    A = A ^ this.A | 0;\n    B = B ^ this.B | 0;\n    C = C ^ this.C | 0;\n    D = D ^ this.D | 0;\n    E = E ^ this.E | 0;\n    F = F ^ this.F | 0;\n    G = G ^ this.G | 0;\n    H = H ^ this.H | 0;\n    this.set(A, B, C, D, E, F, G, H);\n  }\n  roundClean() {\n    SM3_W.fill(0);\n  }\n  destroy() {\n    this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    this.buffer.fill(0);\n  }\n};\nvar sm3 = wrapConstructor(() => new SM3());\n\n// src/sm2/hmac.ts\nvar HMAC = class extends Hash {\n  oHash;\n  iHash;\n  blockLen;\n  outputLen;\n  finished = false;\n  destroyed = false;\n  constructor(hash, _key) {\n    super();\n    const key = toBytes(_key);\n    this.iHash = hash.create();\n    if (typeof this.iHash.update !== \"function\")\n      throw new Error(\"Expected instance of class which extends utils.Hash\");\n    this.blockLen = this.iHash.blockLen;\n    this.outputLen = this.iHash.outputLen;\n    const blockLen = this.blockLen;\n    const pad = new Uint8Array(blockLen);\n    pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n    for (let i = 0; i < pad.length; i++)\n      pad[i] ^= 54;\n    this.iHash.update(pad);\n    this.oHash = hash.create();\n    for (let i = 0; i < pad.length; i++)\n      pad[i] ^= 54 ^ 92;\n    this.oHash.update(pad);\n    pad.fill(0);\n  }\n  update(buf) {\n    this.iHash.update(buf);\n    return this;\n  }\n  digestInto(out) {\n    this.finished = true;\n    this.iHash.digestInto(out);\n    this.oHash.update(out);\n    this.oHash.digestInto(out);\n    this.destroy();\n  }\n  digest() {\n    const out = new Uint8Array(this.oHash.outputLen);\n    this.digestInto(out);\n    return out;\n  }\n  _cloneInto(to) {\n    to ||= Object.create(Object.getPrototypeOf(this), {});\n    const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n    to = to;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    to.blockLen = blockLen;\n    to.outputLen = outputLen;\n    to.oHash = oHash._cloneInto(to.oHash);\n    to.iHash = iHash._cloneInto(to.iHash);\n    return to;\n  }\n  destroy() {\n    this.destroyed = true;\n    this.oHash.destroy();\n    this.iHash.destroy();\n  }\n};\nvar hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n\n// src/sm2/ec.ts\nimport { concatBytes } from \"@noble/curves/abstract/utils\";\nvar sm2Fp = Field(BigInt(\"115792089210356248756420345214020892766250353991924191454421193933289684991999\"));\nvar sm2Curve = weierstrass({\n  a: BigInt(\"115792089210356248756420345214020892766250353991924191454421193933289684991996\"),\n  b: BigInt(\"18505919022281880113072981827955639221458448578012075254857346196103069175443\"),\n  Fp: sm2Fp,\n  h: ONE,\n  n: BigInt(\"115792089210356248756420345214020892766061623724957744567843809356293439045923\"),\n  Gx: BigInt(\"22963146547237050559479531362550074578802567295341616970375194840604139615431\"),\n  Gy: BigInt(\"85132369209828568825618990617112496413088388631904505083283536607588877201568\"),\n  hash: sm3,\n  hmac: (key, ...msgs) => hmac(sm3, key, concatBytes(...msgs)),\n  randomBytes\n});\nvar field = Field(BigInt(sm2Curve.CURVE.n));\n\n// src/sm2/utils.ts\nimport { mod } from \"@noble/curves/abstract/modular\";\nfunction generateKeyPairHex(str) {\n  const privateKey = str ? utils2.numberToBytesBE(mod(BigInt(str), ONE) + ONE, 32) : sm2Curve.utils.randomPrivateKey();\n  const publicKey = sm2Curve.getPublicKey(privateKey, false);\n  const privPad = leftPad(utils2.bytesToHex(privateKey), 64);\n  const pubPad = leftPad(utils2.bytesToHex(publicKey), 64);\n  return { privateKey: privPad, publicKey: pubPad };\n}\nfunction compressPublicKeyHex(s) {\n  if (s.length !== 130)\n    throw new Error(\"Invalid public key to compress\");\n  const len = (s.length - 2) / 2;\n  const xHex = s.substring(2, 2 + len);\n  const y = utils2.hexToNumber(s.substring(len + 2, len + len + 2));\n  let prefix = \"03\";\n  if (mod(y, TWO) === ZERO)\n    prefix = \"02\";\n  return prefix + xHex;\n}\nfunction utf8ToHex(input) {\n  input = decodeURIComponent(encodeURIComponent(input));\n  const length = input.length;\n  const words = new Uint32Array((length >>> 2) + 1);\n  for (let i = 0; i < length; i++) {\n    words[i >>> 2] |= (input.charCodeAt(i) & 255) << 24 - i % 4 * 8;\n  }\n  const hexChars = [];\n  for (let i = 0; i < length; i++) {\n    const bite = words[i >>> 2] >>> 24 - i % 4 * 8 & 255;\n    hexChars.push((bite >>> 4).toString(16));\n    hexChars.push((bite & 15).toString(16));\n  }\n  return hexChars.join(\"\");\n}\nfunction leftPad(input, num) {\n  if (input.length >= num)\n    return input;\n  return new Array(num - input.length + 1).join(\"0\") + input;\n}\nfunction arrayToHex(arr) {\n  return arr.map((item) => {\n    const hex = item.toString(16);\n    return hex.length === 1 ? \"0\" + hex : hex;\n  }).join(\"\");\n}\nfunction arrayToUtf8(arr) {\n  const str = [];\n  for (let i = 0, len = arr.length; i < len; i++) {\n    if (arr[i] >= 240 && arr[i] <= 247) {\n      str.push(String.fromCodePoint(((arr[i] & 7) << 18) + ((arr[i + 1] & 63) << 12) + ((arr[i + 2] & 63) << 6) + (arr[i + 3] & 63)));\n      i += 3;\n    } else if (arr[i] >= 224 && arr[i] <= 239) {\n      str.push(String.fromCodePoint(((arr[i] & 15) << 12) + ((arr[i + 1] & 63) << 6) + (arr[i + 2] & 63)));\n      i += 2;\n    } else if (arr[i] >= 192 && arr[i] <= 223) {\n      str.push(String.fromCodePoint(((arr[i] & 31) << 6) + (arr[i + 1] & 63)));\n      i++;\n    } else {\n      str.push(String.fromCodePoint(arr[i]));\n    }\n  }\n  return str.join(\"\");\n}\nfunction hexToArray(hexStr) {\n  let hexStrLength = hexStr.length;\n  if (hexStrLength % 2 !== 0) {\n    hexStr = leftPad(hexStr, hexStrLength + 1);\n  }\n  hexStrLength = hexStr.length;\n  const wordLength = hexStrLength / 2;\n  const words = new Uint8Array(wordLength);\n  for (let i = 0; i < wordLength; i++) {\n    words[i] = parseInt(hexStr.substring(i * 2, i * 2 + 2), 16);\n  }\n  return words;\n}\nfunction verifyPublicKey(publicKey) {\n  const point = sm2Curve.ProjectivePoint.fromHex(publicKey);\n  if (!point)\n    return false;\n  try {\n    point.assertValidity();\n    return true;\n  } catch (error) {\n    return false;\n  }\n}\nfunction comparePublicKeyHex(publicKey1, publicKey2) {\n  const point1 = sm2Curve.ProjectivePoint.fromHex(publicKey1);\n  if (!point1)\n    return false;\n  const point2 = sm2Curve.ProjectivePoint.fromHex(publicKey2);\n  if (!point2)\n    return false;\n  return point1.equals(point2);\n}\n\n// src/sm2/index.ts\nimport * as utils4 from \"@noble/curves/abstract/utils\";\n\n// src/sm2/kx.ts\nimport * as utils3 from \"@noble/curves/abstract/utils\";\nvar wPow2 = utils3.hexToNumber(\"80000000000000000000000000000000\");\nvar wPow2Sub1 = utils3.hexToNumber(\"7fffffffffffffffffffffffffffffff\");\nfunction hkdf(z, keylen) {\n  let msg = new Uint8Array(keylen);\n  let ct = 1;\n  let offset = 0;\n  let t = EmptyArray;\n  const ctShift = new Uint8Array(4);\n  const nextT = () => {\n    ctShift[0] = ct >> 24 & 255;\n    ctShift[1] = ct >> 16 & 255;\n    ctShift[2] = ct >> 8 & 255;\n    ctShift[3] = ct & 255;\n    t = sm3(utils3.concatBytes(z, ctShift));\n    ct++;\n    offset = 0;\n  };\n  nextT();\n  for (let i = 0, len = msg.length; i < len; i++) {\n    if (offset === t.length)\n      nextT();\n    msg[i] = t[offset++] & 255;\n  }\n  return msg;\n}\nfunction calculateSharedKey(keypairA, ephemeralKeypairA, publicKeyB, ephemeralPublicKeyB, sharedKeyLength, isRecipient = false, idA = \"1234567812345678\", idB = \"1234567812345678\") {\n  const RA = sm2Curve.ProjectivePoint.fromHex(ephemeralKeypairA.publicKey);\n  const RB = sm2Curve.ProjectivePoint.fromHex(ephemeralPublicKeyB);\n  const PB = sm2Curve.ProjectivePoint.fromHex(publicKeyB);\n  let ZA = getZ(keypairA.publicKey, idA);\n  let ZB = getZ(publicKeyB, idB);\n  if (isRecipient) {\n    [ZA, ZB] = [ZB, ZA];\n  }\n  const rA = utils3.hexToNumber(ephemeralKeypairA.privateKey);\n  const dA = utils3.hexToNumber(keypairA.privateKey);\n  const x1 = RA.x;\n  const x1_ = wPow2 + (x1 & wPow2Sub1);\n  const tA = field.add(dA, field.mulN(x1_, rA));\n  const x2 = RB.x;\n  const x2_ = field.add(wPow2, x2 & wPow2Sub1);\n  const U = RB.multiply(x2_).add(PB).multiply(tA);\n  const xU = hexToArray(leftPad(utils3.numberToHexUnpadded(U.x), 64));\n  const yU = hexToArray(leftPad(utils3.numberToHexUnpadded(U.y), 64));\n  const KA = hkdf(utils3.concatBytes(xU, yU, ZA, ZB), sharedKeyLength);\n  return KA;\n}\n\n// src/sm2/index.ts\nvar C1C2C3 = 0;\nvar EmptyArray = new Uint8Array();\nfunction doEncrypt(msg, publicKey, cipherMode = 1) {\n  const msgArr = typeof msg === \"string\" ? hexToArray(utf8ToHex(msg)) : Uint8Array.from(msg);\n  const publicKeyPoint = typeof publicKey === \"string\" ? sm2Curve.ProjectivePoint.fromHex(publicKey) : publicKey;\n  const keypair = generateKeyPairHex();\n  const k = utils4.hexToNumber(keypair.privateKey);\n  let c1 = keypair.publicKey;\n  if (c1.length > 128)\n    c1 = c1.substring(c1.length - 128);\n  const p = publicKeyPoint.multiply(k);\n  const x2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.x), 64));\n  const y2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.y), 64));\n  const c3 = bytesToHex(sm3(utils4.concatBytes(x2, msgArr, y2)));\n  xorCipherStream(x2, y2, msgArr);\n  const c2 = bytesToHex(msgArr);\n  return cipherMode === C1C2C3 ? c1 + c2 + c3 : c1 + c3 + c2;\n}\nfunction xorCipherStream(x2, y2, msg) {\n  let ct = 1;\n  let offset = 0;\n  let t = EmptyArray;\n  const ctShift = new Uint8Array(4);\n  const nextT = () => {\n    ctShift[0] = ct >> 24 & 255;\n    ctShift[1] = ct >> 16 & 255;\n    ctShift[2] = ct >> 8 & 255;\n    ctShift[3] = ct & 255;\n    t = sm3(utils4.concatBytes(x2, y2, ctShift));\n    ct++;\n    offset = 0;\n  };\n  nextT();\n  for (let i = 0, len = msg.length; i < len; i++) {\n    if (offset === t.length)\n      nextT();\n    msg[i] ^= t[offset++] & 255;\n  }\n}\nfunction doDecrypt(encryptData, privateKey, cipherMode = 1, {\n  output = \"string\"\n} = {}) {\n  const privateKeyInteger = utils4.hexToNumber(privateKey);\n  let c3 = encryptData.substring(128, 128 + 64);\n  let c2 = encryptData.substring(128 + 64);\n  if (cipherMode === C1C2C3) {\n    c3 = encryptData.substring(encryptData.length - 64);\n    c2 = encryptData.substring(128, encryptData.length - 64);\n  }\n  const msg = hexToArray(c2);\n  const c1 = sm2Curve.ProjectivePoint.fromHex(\"04\" + encryptData.substring(0, 128));\n  const p = c1.multiply(privateKeyInteger);\n  const x2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.x), 64));\n  const y2 = hexToArray(leftPad(utils4.numberToHexUnpadded(p.y), 64));\n  xorCipherStream(x2, y2, msg);\n  const checkC3 = arrayToHex(Array.from(sm3(utils4.concatBytes(x2, msg, y2))));\n  if (checkC3 === c3.toLowerCase()) {\n    return output === \"array\" ? msg : arrayToUtf8(msg);\n  } else {\n    return output === \"array\" ? [] : \"\";\n  }\n}\nfunction doSignature(msg, privateKey, options = {}) {\n  let {\n    pointPool,\n    der,\n    hash,\n    publicKey,\n    userId\n  } = options;\n  let hashHex = typeof msg === \"string\" ? utf8ToHex(msg) : arrayToHex(Array.from(msg));\n  if (hash) {\n    publicKey = publicKey || getPublicKeyFromPrivateKey(privateKey);\n    hashHex = getHash(hashHex, publicKey, userId);\n  }\n  const dA = utils4.hexToNumber(privateKey);\n  const e = utils4.hexToNumber(hashHex);\n  let k = null;\n  let r = null;\n  let s = null;\n  do {\n    do {\n      let point;\n      if (pointPool && pointPool.length) {\n        point = pointPool.pop();\n      } else {\n        point = getPoint();\n      }\n      k = point.k;\n      r = field.add(e, point.x1);\n    } while (r === ZERO || r + k === sm2Curve.CURVE.n);\n    s = field.mul(field.inv(field.addN(dA, ONE)), field.subN(k, field.mulN(r, dA)));\n  } while (s === ZERO);\n  if (der)\n    return encodeDer(r, s);\n  return leftPad(utils4.numberToHexUnpadded(r), 64) + leftPad(utils4.numberToHexUnpadded(s), 64);\n}\nfunction doVerifySignature(msg, signHex, publicKey, options = {}) {\n  let hashHex;\n  const {\n    hash,\n    der,\n    userId\n  } = options;\n  const publicKeyHex = typeof publicKey === \"string\" ? publicKey : publicKey.toHex(false);\n  if (hash) {\n    hashHex = getHash(typeof msg === \"string\" ? utf8ToHex(msg) : msg, publicKeyHex, userId);\n  } else {\n    hashHex = typeof msg === \"string\" ? utf8ToHex(msg) : arrayToHex(Array.from(msg));\n  }\n  let r;\n  let s;\n  if (der) {\n    const decodeDerObj = decodeDer(signHex);\n    r = decodeDerObj.r;\n    s = decodeDerObj.s;\n  } else {\n    r = utils4.hexToNumber(signHex.substring(0, 64));\n    s = utils4.hexToNumber(signHex.substring(64));\n  }\n  const PA = typeof publicKey === \"string\" ? sm2Curve.ProjectivePoint.fromHex(publicKey) : publicKey;\n  const e = utils4.hexToNumber(hashHex);\n  const t = field.add(r, s);\n  if (t === ZERO)\n    return false;\n  const x1y1 = sm2Curve.ProjectivePoint.BASE.multiply(s).add(PA.multiply(t));\n  const R = field.add(e, x1y1.x);\n  return r === R;\n}\nfunction getZ(publicKey, userId = \"1234567812345678\") {\n  userId = utf8ToHex(userId);\n  const a = leftPad(utils4.numberToHexUnpadded(sm2Curve.CURVE.a), 64);\n  const b = leftPad(utils4.numberToHexUnpadded(sm2Curve.CURVE.b), 64);\n  const gx = leftPad(utils4.numberToHexUnpadded(sm2Curve.ProjectivePoint.BASE.x), 64);\n  const gy = leftPad(utils4.numberToHexUnpadded(sm2Curve.ProjectivePoint.BASE.y), 64);\n  let px;\n  let py;\n  if (publicKey.length === 128) {\n    px = publicKey.substring(0, 64);\n    py = publicKey.substring(64, 128);\n  } else {\n    const point = sm2Curve.ProjectivePoint.fromHex(publicKey);\n    px = leftPad(utils4.numberToHexUnpadded(point.x), 64);\n    py = leftPad(utils4.numberToHexUnpadded(point.y), 64);\n  }\n  const data = hexToArray(userId + a + b + gx + gy + px + py);\n  const entl = userId.length * 4;\n  const z = sm3(utils4.concatBytes(new Uint8Array([entl >> 8 & 255, entl & 255]), data));\n  return z;\n}\nfunction getHash(hashHex, publicKey, userId = \"1234567812345678\") {\n  const z = getZ(publicKey, userId);\n  return bytesToHex(sm3(utils4.concatBytes(z, typeof hashHex === \"string\" ? hexToArray(hashHex) : hashHex)));\n}\nfunction precomputePublicKey(publicKey, windowSize) {\n  const point = sm2Curve.ProjectivePoint.fromHex(publicKey);\n  return sm2Curve.utils.precompute(windowSize, point);\n}\nfunction getPublicKeyFromPrivateKey(privateKey) {\n  const pubKey = sm2Curve.getPublicKey(privateKey, false);\n  const pubPad = leftPad(utils4.bytesToHex(pubKey), 64);\n  return pubPad;\n}\nfunction getPoint() {\n  const keypair = generateKeyPairHex();\n  const PA = sm2Curve.ProjectivePoint.fromHex(keypair.publicKey);\n  const k = utils4.hexToNumber(keypair.privateKey);\n  return {\n    ...keypair,\n    k,\n    x1: PA.x\n  };\n}\n\n// src/sm3/index.ts\nfunction utf8ToArray(str) {\n  const arr = [];\n  for (let i = 0, len = str.length; i < len; i++) {\n    const point = str.codePointAt(i);\n    if (point <= 127) {\n      arr.push(point);\n    } else if (point <= 2047) {\n      arr.push(192 | point >>> 6);\n      arr.push(128 | point & 63);\n    } else if (point <= 55295 || point >= 57344 && point <= 65535) {\n      arr.push(224 | point >>> 12);\n      arr.push(128 | point >>> 6 & 63);\n      arr.push(128 | point & 63);\n    } else if (point >= 65536 && point <= 1114111) {\n      i++;\n      arr.push(240 | point >>> 18 & 28);\n      arr.push(128 | point >>> 12 & 63);\n      arr.push(128 | point >>> 6 & 63);\n      arr.push(128 | point & 63);\n    } else {\n      arr.push(point);\n      throw new Error(\"input is not supported\");\n    }\n  }\n  return new Uint8Array(arr);\n}\nfunction sm32(input, options) {\n  input = typeof input === \"string\" ? utf8ToArray(input) : input;\n  if (options) {\n    const mode = options.mode || \"hmac\";\n    if (mode !== \"hmac\")\n      throw new Error(\"invalid mode\");\n    let key = options.key;\n    if (!key)\n      throw new Error(\"invalid key\");\n    key = typeof key === \"string\" ? hexToArray(key) : key;\n    return bytesToHex(hmac(sm3, key, input));\n  }\n  return bytesToHex(sm3(input));\n}\n\n// src/sm4/index.ts\nvar sm4_exports = {};\n__export(sm4_exports, {\n  decrypt: () => decrypt,\n  encrypt: () => encrypt,\n  sm4: () => sm4\n});\nvar DECRYPT = 0;\nvar ROUND = 32;\nvar BLOCK = 16;\nvar Sbox = Uint8Array.from([\n  214,\n  144,\n  233,\n  254,\n  204,\n  225,\n  61,\n  183,\n  22,\n  182,\n  20,\n  194,\n  40,\n  251,\n  44,\n  5,\n  43,\n  103,\n  154,\n  118,\n  42,\n  190,\n  4,\n  195,\n  170,\n  68,\n  19,\n  38,\n  73,\n  134,\n  6,\n  153,\n  156,\n  66,\n  80,\n  244,\n  145,\n  239,\n  152,\n  122,\n  51,\n  84,\n  11,\n  67,\n  237,\n  207,\n  172,\n  98,\n  228,\n  179,\n  28,\n  169,\n  201,\n  8,\n  232,\n  149,\n  128,\n  223,\n  148,\n  250,\n  117,\n  143,\n  63,\n  166,\n  71,\n  7,\n  167,\n  252,\n  243,\n  115,\n  23,\n  186,\n  131,\n  89,\n  60,\n  25,\n  230,\n  133,\n  79,\n  168,\n  104,\n  107,\n  129,\n  178,\n  113,\n  100,\n  218,\n  139,\n  248,\n  235,\n  15,\n  75,\n  112,\n  86,\n  157,\n  53,\n  30,\n  36,\n  14,\n  94,\n  99,\n  88,\n  209,\n  162,\n  37,\n  34,\n  124,\n  59,\n  1,\n  33,\n  120,\n  135,\n  212,\n  0,\n  70,\n  87,\n  159,\n  211,\n  39,\n  82,\n  76,\n  54,\n  2,\n  231,\n  160,\n  196,\n  200,\n  158,\n  234,\n  191,\n  138,\n  210,\n  64,\n  199,\n  56,\n  181,\n  163,\n  247,\n  242,\n  206,\n  249,\n  97,\n  21,\n  161,\n  224,\n  174,\n  93,\n  164,\n  155,\n  52,\n  26,\n  85,\n  173,\n  147,\n  50,\n  48,\n  245,\n  140,\n  177,\n  227,\n  29,\n  246,\n  226,\n  46,\n  130,\n  102,\n  202,\n  96,\n  192,\n  41,\n  35,\n  171,\n  13,\n  83,\n  78,\n  111,\n  213,\n  219,\n  55,\n  69,\n  222,\n  253,\n  142,\n  47,\n  3,\n  255,\n  106,\n  114,\n  109,\n  108,\n  91,\n  81,\n  141,\n  27,\n  175,\n  146,\n  187,\n  221,\n  188,\n  127,\n  17,\n  217,\n  92,\n  65,\n  31,\n  16,\n  90,\n  216,\n  10,\n  193,\n  49,\n  136,\n  165,\n  205,\n  123,\n  189,\n  45,\n  116,\n  208,\n  18,\n  184,\n  229,\n  180,\n  176,\n  137,\n  105,\n  151,\n  74,\n  12,\n  150,\n  119,\n  126,\n  101,\n  185,\n  241,\n  9,\n  197,\n  110,\n  198,\n  132,\n  24,\n  240,\n  125,\n  236,\n  58,\n  220,\n  77,\n  32,\n  121,\n  238,\n  95,\n  62,\n  215,\n  203,\n  57,\n  72\n]);\nvar CK = new Uint32Array([\n  462357,\n  472066609,\n  943670861,\n  1415275113,\n  1886879365,\n  2358483617,\n  2830087869,\n  3301692121,\n  3773296373,\n  4228057617,\n  404694573,\n  876298825,\n  1347903077,\n  1819507329,\n  2291111581,\n  2762715833,\n  3234320085,\n  3705924337,\n  4177462797,\n  337322537,\n  808926789,\n  1280531041,\n  1752135293,\n  2223739545,\n  2695343797,\n  3166948049,\n  3638552301,\n  4110090761,\n  269950501,\n  741554753,\n  1213159005,\n  1684763257\n]);\nfunction byteSub(a) {\n  return (Sbox[a >>> 24 & 255] & 255) << 24 | (Sbox[a >>> 16 & 255] & 255) << 16 | (Sbox[a >>> 8 & 255] & 255) << 8 | Sbox[a & 255] & 255;\n}\nvar x = new Uint32Array(4);\nvar tmp = new Uint32Array(4);\nfunction sms4Crypt(input, output, roundKey) {\n  let x0 = 0, x1 = 0, x2 = 0, x3 = 0, tmp0 = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;\n  tmp0 = input[0] & 255;\n  tmp1 = input[1] & 255;\n  tmp2 = input[2] & 255;\n  tmp3 = input[3] & 255;\n  x0 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  tmp0 = input[4] & 255;\n  tmp1 = input[5] & 255;\n  tmp2 = input[6] & 255;\n  tmp3 = input[7] & 255;\n  x1 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  tmp0 = input[8] & 255;\n  tmp1 = input[9] & 255;\n  tmp2 = input[10] & 255;\n  tmp3 = input[11] & 255;\n  x2 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  tmp0 = input[12] & 255;\n  tmp1 = input[13] & 255;\n  tmp2 = input[14] & 255;\n  tmp3 = input[15] & 255;\n  x3 = tmp0 << 24 | tmp1 << 16 | tmp2 << 8 | tmp3;\n  for (let r = 0; r < 32; r += 4) {\n    tmp0 = x1 ^ x2 ^ x3 ^ roundKey[r];\n    tmp0 = byteSub(tmp0);\n    x0 ^= tmp0 ^ (tmp0 << 2 | tmp0 >>> 30) ^ (tmp0 << 10 | tmp0 >>> 22) ^ (tmp0 << 18 | tmp0 >>> 14) ^ (tmp0 << 24 | tmp0 >>> 8);\n    tmp1 = x2 ^ x3 ^ x0 ^ roundKey[r + 1];\n    tmp1 = byteSub(tmp1);\n    x1 ^= tmp1 ^ (tmp1 << 2 | tmp1 >>> 30) ^ (tmp1 << 10 | tmp1 >>> 22) ^ (tmp1 << 18 | tmp1 >>> 14) ^ (tmp1 << 24 | tmp1 >>> 8);\n    tmp2 = x3 ^ x0 ^ x1 ^ roundKey[r + 2];\n    tmp2 = byteSub(tmp2);\n    x2 ^= tmp2 ^ (tmp2 << 2 | tmp2 >>> 30) ^ (tmp2 << 10 | tmp2 >>> 22) ^ (tmp2 << 18 | tmp2 >>> 14) ^ (tmp2 << 24 | tmp2 >>> 8);\n    tmp3 = x0 ^ x1 ^ x2 ^ roundKey[r + 3];\n    tmp3 = byteSub(tmp3);\n    x3 ^= tmp3 ^ (tmp3 << 2 | tmp3 >>> 30) ^ (tmp3 << 10 | tmp3 >>> 22) ^ (tmp3 << 18 | tmp3 >>> 14) ^ (tmp3 << 24 | tmp3 >>> 8);\n  }\n  output[0] = x3 >>> 24 & 255;\n  output[1] = x3 >>> 16 & 255;\n  output[2] = x3 >>> 8 & 255;\n  output[3] = x3 & 255;\n  output[4] = x2 >>> 24 & 255;\n  output[5] = x2 >>> 16 & 255;\n  output[6] = x2 >>> 8 & 255;\n  output[7] = x2 & 255;\n  output[8] = x1 >>> 24 & 255;\n  output[9] = x1 >>> 16 & 255;\n  output[10] = x1 >>> 8 & 255;\n  output[11] = x1 & 255;\n  output[12] = x0 >>> 24 & 255;\n  output[13] = x0 >>> 16 & 255;\n  output[14] = x0 >>> 8 & 255;\n  output[15] = x0 & 255;\n}\nfunction sms4KeyExt(key, roundKey, cryptFlag) {\n  let x0 = 0, x1 = 0, x2 = 0, x3 = 0, mid = 0;\n  x0 = (key[0] & 255) << 24 | (key[1] & 255) << 16 | (key[2] & 255) << 8 | key[3] & 255;\n  x1 = (key[4] & 255) << 24 | (key[5] & 255) << 16 | (key[6] & 255) << 8 | key[7] & 255;\n  x2 = (key[8] & 255) << 24 | (key[9] & 255) << 16 | (key[10] & 255) << 8 | key[11] & 255;\n  x3 = (key[12] & 255) << 24 | (key[13] & 255) << 16 | (key[14] & 255) << 8 | key[15] & 255;\n  x0 ^= 2746333894;\n  x1 ^= 1453994832;\n  x2 ^= 1736282519;\n  x3 ^= 2993693404;\n  for (let r = 0; r < 32; r += 4) {\n    mid = x1 ^ x2 ^ x3 ^ CK[r + 0];\n    mid = byteSub(mid);\n    x0 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 0] = x0;\n    mid = x2 ^ x3 ^ x0 ^ CK[r + 1];\n    mid = byteSub(mid);\n    x1 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 1] = x1;\n    mid = x3 ^ x0 ^ x1 ^ CK[r + 2];\n    mid = byteSub(mid);\n    x2 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 2] = x2;\n    mid = x0 ^ x1 ^ x2 ^ CK[r + 3];\n    mid = byteSub(mid);\n    x3 ^= mid ^ (mid << 13 | mid >>> 19) ^ (mid << 23 | mid >>> 9);\n    roundKey[r + 3] = x3;\n  }\n  if (cryptFlag === DECRYPT) {\n    for (let r = 0; r < 16; r++) {\n      [roundKey[r], roundKey[31 - r]] = [roundKey[31 - r], roundKey[r]];\n    }\n  }\n}\nvar blockOutput = new Uint8Array(16);\nfunction sm4(inArray, key, cryptFlag, options = {}) {\n  let {\n    padding = \"pkcs#7\",\n    mode,\n    iv = new Uint8Array(16),\n    output\n  } = options;\n  if (mode === \"cbc\") {\n    if (typeof iv === \"string\")\n      iv = hexToArray(iv);\n    if (iv.length !== 128 / 8) {\n      throw new Error(\"iv is invalid\");\n    }\n  }\n  if (typeof key === \"string\")\n    key = hexToArray(key);\n  if (key.length !== 128 / 8) {\n    throw new Error(\"key is invalid\");\n  }\n  if (typeof inArray === \"string\") {\n    if (cryptFlag !== DECRYPT) {\n      inArray = utf8ToArray(inArray);\n    } else {\n      inArray = hexToArray(inArray);\n    }\n  } else {\n    inArray = Uint8Array.from(inArray);\n  }\n  if ((padding === \"pkcs#5\" || padding === \"pkcs#7\") && cryptFlag !== DECRYPT) {\n    const paddingCount = BLOCK - inArray.length % BLOCK;\n    const newArray = new Uint8Array(inArray.length + paddingCount);\n    newArray.set(inArray, 0);\n    for (let i = 0; i < paddingCount; i++)\n      newArray[inArray.length + i] = paddingCount;\n    inArray = newArray;\n  }\n  const roundKey = new Uint32Array(ROUND);\n  sms4KeyExt(key, roundKey, cryptFlag);\n  let outArray = new Uint8Array(inArray.length);\n  let lastVector = iv;\n  let restLen = inArray.length;\n  let point = 0;\n  while (restLen >= BLOCK) {\n    const input = inArray.subarray(point, point + 16);\n    if (mode === \"cbc\") {\n      for (let i = 0; i < BLOCK; i++) {\n        if (cryptFlag !== DECRYPT) {\n          input[i] ^= lastVector[i];\n        }\n      }\n    }\n    sms4Crypt(input, blockOutput, roundKey);\n    for (let i = 0; i < BLOCK; i++) {\n      if (mode === \"cbc\") {\n        if (cryptFlag === DECRYPT) {\n          blockOutput[i] ^= lastVector[i];\n        }\n      }\n      outArray[point + i] = blockOutput[i];\n    }\n    if (mode === \"cbc\") {\n      if (cryptFlag !== DECRYPT) {\n        lastVector = blockOutput;\n      } else {\n        lastVector = input;\n      }\n    }\n    restLen -= BLOCK;\n    point += BLOCK;\n  }\n  if ((padding === \"pkcs#5\" || padding === \"pkcs#7\") && cryptFlag === DECRYPT) {\n    const len = outArray.length;\n    const paddingCount = outArray[len - 1];\n    for (let i = 1; i <= paddingCount; i++) {\n      if (outArray[len - i] !== paddingCount)\n        throw new Error(\"padding is invalid\");\n    }\n    outArray = outArray.slice(0, len - paddingCount);\n  }\n  if (output !== \"array\") {\n    if (cryptFlag !== DECRYPT) {\n      return bytesToHex(outArray);\n    } else {\n      return arrayToUtf8(outArray);\n    }\n  } else {\n    return outArray;\n  }\n}\nfunction encrypt(inArray, key, options = {}) {\n  return sm4(inArray, key, 1, options);\n}\nfunction decrypt(inArray, key, options = {}) {\n  return sm4(inArray, key, 0, options);\n}\nexport {\n  sm2_exports as sm2,\n  sm32 as sm3,\n  sm4_exports as sm4\n};\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n","import { sm2, sm3, sm4 } from \"sm-crypto-v2\"\n\n/**\n * 国密 sm2 加密\n * @param msg\n * @param key\n * @param {Object} [cipherMode]\n * @return {Uint8Array}\n */\nexport function useSm2Encrypt(msg, key, cipherMode) {\n\treturn sm2.doEncrypt(msg, key, cipherMode)\n}\n\n/**\n * 国密 sm3 加密\n * @param msg\n * @param {Object} [options]\n * @return {*}\n */\nexport function useSm3(msg, options) {\n\treturn sm3(msg, options) // 杂凑\n}\n\n/**\n * 国密 sm4 加密\n * @param msg\n * @param key\n * @param {Object} [options]\n * @return {Uint8Array}\n */\nexport function useSm4Encrypt(msg, key, options) {\n\treturn sm4.encrypt(msg, key, options)\n}\n\n/**\n * 国密 sm4 解密\n * @param encryptData\n * @param key\n * @param {Object} [options]\n * @return {Uint8Array}\n */\nexport function useSm4Decrypt(encryptData, key, options) {\n\treturn sm4.encrypt(encryptData, key, options)\n}\n"],"names":["STATUS","_configStatus","status","key","useFetch","fetcher","globalLoading","url","config","resolve","reject","axios","res","err","allowMultipleToast","data","message","closeToast","isString","showLoadingToast","isObject","useTextFromOptionsValue","value","options","adapter","option","useFindTextsInValues","values","labels","recursiveSearch","node","_a","child","item","useFindLabelsFromPath","path","reduce","acc","find","useFindOptionByValue","foundOption","useFindTextsFromPath","useFindPropertyRecursive","propertyKey","nestedKey","flatMapDeep","useFindParentLabels","findParentLabels","useFindParentValues","findParentValues","localCacheSession","localSession","useCache","sessionType","cacheSession","shouldTransform","defaultValue","isNull","isUndefined","useHiddenForm","csrfToken","method","form","input","useProcessStatus","ops","msg","predefined","special","op","showSuccessToast","showFailToast","isFunction","useProcessStatusSuccess","success","useFormFail","e","useFormFormat","format","newForm","cloneDeep","formatter","obj","date","dayjs","isDate","isBoolean","_b","checker","isArray","_0n","_1n","_2n","u8a","a","hexes","v","i","bytesToHex","bytes","hex","numberToHexUnpadded","num","hexToNumber","hexToBytes","len","array","j","hexByte","byte","bytesToNumberBE","bytesToNumberLE","numberToBytesBE","n","numberToBytesLE","numberToVarBytesBE","ensureBytes","title","expectedLength","concatBytes","arrays","r","sum","pad","equalBytes","b1","b2","utf8ToBytes","str","bitLen","bitGet","pos","bitSet","bitMask","u8n","u8fr","arr","createHmacDrbg","hashLen","qByteLen","hmacFn","k","reset","h","b","reseed","seed","gen","out","sl","pred","validatorFns","val","object","validateObject","validators","optValidators","checkField","fieldName","type","isOptional","checkVal","_3n","_4n","_5n","_8n","mod","result","pow","power","modulo","invert","number","x","u","q","m","tonelliShanks","P","legendreC","Q","S","Z","p1div4","Fp","root","Q1div2","g","t2","ge","FpSqrt","c1","n2","nv","FIELD_FIELDS","validateField","field","initial","opts","map","FpPow","f","p","d","FpInvertBatch","nums","tmp","lastMultiplied","inverted","nLength","nBitLength","_nBitLength","nByteLength","Field","ORDER","isLE","redef","BITS","BYTES","sqrtP","lhs","rhs","lst","c","hashToPrivateScalar","hash","groupOrder","minLen","wNAF","bits","constTimeNegate","condition","neg","W","windows","windowSize","elm","points","base","window","precomputes","mask","maxNumber","shiftBy","offset","wbits","offset1","offset2","cond1","cond2","precomputesMap","transform","comp","validateBasic","curve","validatePointOpts","ut.validateObject","endo","b2n","h2b","ut","DER","E","l","sBytes","s","rBytesLeft","sig","slice","shl","rhl","rl","weierstrassPoints","CURVE","toBytes","point","isCompressed","ut.concatBytes","fromBytes","tail","weierstrassEquation","x2","x3","isWithinCurveOrder","assertGE","normPrivateKeyToScalar","lengths","wrapPrivateKey","ut.bytesToHex","ut.bytesToNumberBE","mod.mod","pointPrecomputes","assertPrjPoint","other","Point","px","py","pz","is0","toInv","privateKey","y","left","right","X1","Y1","Z1","X2","Y2","Z2","U1","U2","b3","X3","Y3","Z3","t0","t1","t3","t4","t5","wnaf","I","k1neg","k1","k2neg","k2","k1p","k2p","scalar","fake","f1p","f2p","G","mul","iz","z","ax","ay","zz","cofactor","isTorsionFree","clearCofactor","_bits","validateOpts","weierstrass","curveDef","CURVE_ORDER","compressedLen","uncompressedLen","isValidFieldElement","modN","invN","mod.invert","cat","head","y2","isYOdd","numToNByteStr","ut.numberToBytesBE","isBiggerThanHalfOrder","HALF","normalizeS","slcNum","from","to","Signature","recovery","msgHash","rec","bits2int_modN","radj","prefix","R","ir","u1","u2","ut.hexToBytes","utils","rand","mod.hashToPrivateScalar","getPublicKey","isProbPub","getSharedSecret","privateA","publicB","bits2int","delta","ORDER_MASK","ut.bitMask","int2octets","prepSig","defaultSigOpts","randomBytes","lowS","prehash","ent","h1int","seedArgs","k2sig","kBytes","ik","normS","defaultVerOpts","sign","privKey","C","ut.createHmacDrbg","verify","signature","publicKey","sg","_sig","derError","error","is","__defProp","__export","target","all","name","sm2_exports","EmptyArray","arrayToHex","arrayToUtf8","calculateSharedKey","comparePublicKeyHex","compressPublicKeyHex","doDecrypt","doEncrypt","doSignature","doVerifySignature","generateKeyPairHex","getHash","getPoint","getPublicKeyFromPrivateKey","getZ","hexToArray","initRNGPool","leftPad","precomputePublicKey","utf8ToHex","verifyPublicKey","ZERO","ONE","TWO","bigintToValue","bigint","maskString","utils.hexToNumber","ASN1Object","tlv","t","nHex","DERInteger","DERSequence","asn1Array","__publicField","asn1Object","getLenOfL","start","getL","getStartOfV","encodeDer","derR","derS","decodeDer","vIndexR","lR","vR","nextStart","vIndexS","lS","vS","DEFAULT_PRNG_POOL_SIZE","prngPool","_syncCrypto","consumePool","length","prng","createView","Hash","wrapConstructor","hashCons","hashC","tmp2","BoolA","A","B","BoolB","BoolC","setBigUint64","view","byteOffset","isLE2","_32n","_u32_max","wh","wl","rotl","P0","X","P1","SHA2","blockLen","outputLen","padOffset","buffer","take","dataView","oview","outLen","state","finished","destroyed","IV","SM3_W","SM3_M","T1","T2","SM3","D","F","H","small","T","SS1","SS2","TT1","TT2","sm3","HMAC","_key","buf","oHash","iHash","hmac","sm2Fp","sm2Curve","msgs","utils2.numberToBytesBE","privPad","utils2.bytesToHex","pubPad","xHex","utils2.hexToNumber","words","hexChars","bite","hexStr","hexStrLength","wordLength","publicKey1","publicKey2","point1","point2","wPow2","utils3.hexToNumber","wPow2Sub1","hkdf","keylen","ct","ctShift","nextT","utils3.concatBytes","keypairA","ephemeralKeypairA","publicKeyB","ephemeralPublicKeyB","sharedKeyLength","isRecipient","idA","idB","RA","RB","PB","ZA","ZB","rA","dA","x1","x1_","tA","x2_","U","xU","utils3.numberToHexUnpadded","yU","C1C2C3","cipherMode","msgArr","publicKeyPoint","keypair","utils4.hexToNumber","utils4.numberToHexUnpadded","c3","utils4.concatBytes","xorCipherStream","c2","encryptData","output","privateKeyInteger","pointPool","der","userId","hashHex","signHex","publicKeyHex","decodeDerObj","PA","x1y1","gx","gy","entl","pubKey","utils4.bytesToHex","utf8ToArray","sm32","sm4_exports","decrypt","encrypt","sm4","DECRYPT","ROUND","BLOCK","Sbox","CK","byteSub","sms4Crypt","roundKey","x0","tmp0","tmp1","tmp3","sms4KeyExt","cryptFlag","mid","blockOutput","inArray","padding","mode","iv","paddingCount","newArray","outArray","lastVector","restLen","useSm2Encrypt","sm2","useSm3","useSm4Encrypt","useSm4Decrypt"],"mappings":";;;;;;;AAQY,MAACA,KAAS;AAAA,EACrB,oBAAoB;AAAA;AAAA,EACpB,iBAAiB;AAAA;AAAA,EACjB,sBAAsB;AAAA;AAAA,EACtB,8BAA8B;AAAA;AAAA,EAC9B,wBAAwB;AAAA;AACzB;AAOO,SAASC,GAAcC,GAAQ;AACrC,SAAO,KAAKA,CAAM,EAAE,QAAQ,CAACC,MAAQ;AACpC,IAAAH,GAAOG,CAAG,IAAID,EAAOC,CAAG;AAAA,EAC1B,CAAE;AACF;AAOO,SAASC,GAASC,GAAS;AAEjC,MAAIC,IAAgB;AAEpB,SAAKD,MACJA,IAAU,CAAE,IAEbA,EAAQ,UAAU,IAEX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAON,IAAIE,GAAKC,GAAQ;AAChB,aAAO,IAAI,QAAQ,CAACC,GAASC,MAAW;AACvC,QAAAC,GACE,IAAIJ,GAAKC,CAAM,EACf,KAAK,CAACI,MAAQ;AACd,UAAAH,EAAQG,CAAG;AAAA,QACjB,CAAM,EACA,MAAM,CAACC,MAAQ;AACf,UAAAH,EAAOG,CAAG;AAAA,QAChB,CAAM,EACA,QAAQ,MAAM;AACd,UAAIP,MACHQ,GAAmB,EAAK,GACxBR,EAAc,MAAO,IAEtBD,EAAQ,UAAU;AAAA,QACxB,CAAM;AAAA,MACN,CAAI;AAAA,IACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,KAAKE,GAAKQ,GAAMP,GAAQ;AACvB,aAAO,IAAI,QAAQ,CAACC,GAASC,MAAW;AACvC,QAAAC,GACE,KAAKJ,GAAKQ,GAAMP,CAAM,EACtB,KAAK,CAACI,MAAQ;AACd,UAAAH,EAAQG,CAAG;AAAA,QACjB,CAAM,EACA,MAAM,CAACC,MAAQ;AACf,UAAAH,EAAOG,CAAG;AAAA,QAChB,CAAM,EACA,QAAQ,MAAM;AACd,UAAIP,MACHQ,GAAmB,EAAK,GACxBR,EAAc,MAAO,IAEtBD,EAAQ,UAAU;AAAA,QACxB,CAAM;AAAA,MACN,CAAI;AAAA,IACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,QAAQW,GAAS;AAChB,aAAAC,GAAW,EAAI,GACfH,GAAoB,GAChBI,GAASF,CAAO,IACnBV,IAAgBa,GAAiB;AAAA,QAChC,SAASH,KAAW;AAAA,QACpB,UAAU;AAAA,QACV,aAAa;AAAA,MAClB,CAAK,IACSI,GAASJ,CAAO,IAC1BV,IAAgBa,GAAiB,EAAE,UAAU,GAAG,GAAGH,EAAO,CAAE,IAE5DV,IAAgBa,GAAiB;AAAA,QAChC,SAAS;AAAA,QACT,UAAU;AAAA,QACV,aAAa;AAAA,MAClB,CAAK,GAGK;AAAA,IACP;AAAA,EACD;AACF;AC/GO,SAASE,GAAwBC,GAAOC,GAASC,GAAS;AAChE,MAAI,CAACD;AACJ,WAAO;AAER,EAAAC,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,EACP;AACD,QAAMC,IAASF,EAAQ,KAAK,CAACE,MAAWA,EAAOD,EAAQ,KAAK,MAAMF,CAAK;AACvE,SAAOG,IAASA,EAAOD,EAAQ,KAAK,IAAI;AACzC;AAUO,SAASE,GAAqBH,GAASI,GAAQH,GAAS;AAC9D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,QAAMI,IAAS,CAAE;AAEjB,WAASC,EAAgBC,GAAM;;AAC9B,IAAIH,EAAO,SAASG,EAAKN,EAAQ,KAAK,CAAC,KACtCI,EAAO,KAAKE,EAAKN,EAAQ,KAAK,CAAC,IAG5BO,IAAAD,EAAKN,EAAQ,QAAQ,MAArB,QAAAO,EAAwB,UAC3BD,EAAKN,EAAQ,QAAQ,EAAE,QAAQ,CAACQ,MAAU;AACzC,MAAAH,EAAgBG,CAAK;AAAA,IACzB,CAAI;AAAA,EAEF;AAED,SAAAT,EAAQ,QAAQ,CAACU,MAAS;AACzB,IAAAJ,EAAgBI,CAAI;AAAA,EACtB,CAAE,GAEML;AACR;AASO,SAASM,GAAsBX,GAASY,GAAMX,GAAS;AAC7D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,MAAII,IAAS,CAAE;AACf,SAAAQ;AAAA,IACCD;AAAA,IACA,CAACE,GAAKf,MAAU;AACf,YAAMW,IAAOK,GAAKD,GAAK,EAAE,CAACb,EAAQ,KAAK,GAAGF,GAAO;AACjD,UAAIW;AACH,eAAAL,EAAO,KAAKK,EAAKT,EAAQ,KAAK,CAAC,GACxBS,EAAKT,EAAQ,QAAQ;AAAA,IAE7B;AAAA,IACDD;AAAA,EACA,GACMK;AACR;AASO,SAASW,GAAqBhB,GAASD,GAAOE,GAAS;AAC7D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAGD,WAASC,KAAUF,GAAS;AAE3B,QAAIE,EAAOD,EAAQ,KAAK,MAAMF;AAC7B,aAAOG;AAGR,QAAIA,EAAOD,EAAQ,QAAQ,KAAKC,EAAOD,EAAQ,QAAQ,EAAE,QAAQ;AAEhE,YAAMgB,IAAcD,GAAqBd,EAAOD,EAAQ,QAAQ,GAAGF,GAAOE,CAAO;AAEjF,UAAIgB;AACH,eAAOA;AAAA,IAER;AAAA,EACD;AAED,SAAO;AACR;AAUO,SAASC,GAAqBlB,GAASY,GAAMX,GAAS;AAC5D,SAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV,GACMU,GAAsBX,GAASY,GAAMX,CAAO;AACpD;AAoBO,SAASkB,GAAyBT,GAAMU,GAAaC,GAAW;AACtE,SAAOC,GAAYZ,GAAM,CAACX,GAAOnB,MAC5BA,MAAQwC,IACJrB,IAEJnB,MAAQyC,IACJF,GAAyBpB,GAAOqB,GAAaC,CAAS,IAEvD,CAAE,CACT;AACF;AASO,SAASE,GAAoBvB,GAASD,GAAOE,GAAS;AAC5D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,QAAMI,IAAS,CAAE;AAEjB,WAASmB,EAAiBxB,GAASD,GAAOM,GAAQ;AACjD,eAAWH,KAAUF;AACpB,UAAIE,EAAOD,EAAQ,KAAK,MAAMF,GAAO;AACpC,QAAAM,EAAO,QAAQH,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA,WAAUC,EAAOD,EAAQ,QAAQ,KACbuB,EAAiBtB,EAAOD,EAAQ,QAAQ,GAAGF,GAAOM,CAAM,EAC5D,SAAS,GAAG;AAC3B,QAAAA,EAAO,QAAQH,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA;AAIH,WAAOI;AAAA,EACP;AAED,SAAOmB,EAAiBxB,GAASD,GAAOM,CAAM;AAC/C;AASO,SAASoB,GAAoBzB,GAASD,GAAOE,GAAS;AAC5D,EAAAA,IAAUA,KAAW;AAAA,IACpB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,EACV;AAED,QAAMG,IAAS,CAAE;AAEjB,WAASsB,EAAiB1B,GAASD,GAAOK,GAAQ;AACjD,eAAWF,KAAUF;AACpB,UAAIE,EAAOD,EAAQ,KAAK,MAAMF,GAAO;AACpC,QAAAK,EAAO,QAAQF,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA,WAAUC,EAAOD,EAAQ,QAAQ,KACbyB,EAAiBxB,EAAOD,EAAQ,QAAQ,GAAGF,GAAOK,CAAM,EAC5D,SAAS,GAAG;AAC3B,QAAAA,EAAO,QAAQF,EAAOD,EAAQ,KAAK,CAAC;AACpC;AAAA,MACA;AAIH,WAAOG;AAAA,EACP;AAED,SAAOsB,EAAiB1B,GAASD,GAAOK,CAAM;AAC/C;AAEA,MAAMuB,KAAoB,CAAE,GACtBC,KAAe;AAAA,EACpB,QAAQhD,GAAKmB,GAAO;AACnB,IAAA4B,GAAkB/C,CAAG,IAAImB;AAAA,EACzB;AAAA,EACD,QAAQnB,GAAK;AACZ,WAAO+C,GAAkB/C,CAAG;AAAA,EAC5B;AAAA,EACD,WAAWA,GAAK;AACf,WAAO+C,GAAkB/C,CAAG;AAAA,EAC5B;AACF;AAEA,OAAO,cAAc,MAAM;AAC1B,UAAQ,IAAI,KAAK,MAAM,KAAK,UAAU+C,IAAmB,MAAM,CAAC,CAAC,CAAC;AACnE;AAQO,SAASE,GAASjD,GAAKkD,GAAa;AAC1C,QAAMC,IAAeD,KAAeF,IAC9BI,IAAkB,CAAC,CAACF;AAC1B,SAAO;AAAA,IACN,IAAIG,GAAc;AACjB,YAAMlC,IAAQgC,EAAa,QAAQnD,CAAG;AACtC,aAAIsD,GAAOnC,CAAK,KAAKoC,GAAYpC,CAAK,IAC9BkC,IAEDD,IAAkB,KAAK,MAAMjC,CAAK,IAAIA;AAAA,IAC7C;AAAA,IACD,IAAIA,GAAO;AACV,MAAAgC,EAAa,QAAQnD,GAAKoD,IAAkB,KAAK,UAAUjC,CAAK,IAAIA,CAAK;AAAA,IACzE;AAAA,IACD,SAAS;AACR,MAAAgC,EAAa,WAAWnD,CAAG;AAAA,IAC3B;AAAA,EACD;AACF;AC1QO,SAASwD,GAAcpC,GAAS;AACtC,QAAM,EAAE,KAAAhB,GAAK,MAAAQ,GAAM,WAAA6C,EAAW,IAAGrC;AACjC,MAAI,EAAE,QAAAsC,EAAM,IAAKtC;AAEjB,EAAAsC,IAASA,KAAU;AAEnB,QAAMC,IAAO,SAAS,cAAc,MAAM;AAc1C,MAbAA,EAAK,SAASvD,GACduD,EAAK,SAASD,GACdC,EAAK,SAAS,UACdA,EAAK,MAAM,UAAU,QAErB,OAAO,KAAK/C,CAAI,EAAE,QAAQ,CAACZ,MAAQ;AAClC,UAAM4D,IAAQ,SAAS,cAAc,OAAO;AAC5C,IAAAA,EAAM,OAAO,UACbA,EAAM,OAAO5D,GACb4D,EAAM,QAAQhD,EAAKZ,CAAG,GACtB2D,EAAK,YAAYC,CAAK;AAAA,EACxB,CAAE,GAEG,CAACH,GAAW;AACf,UAAMG,IAAQ,SAAS,cAAc,OAAO;AAC5C,IAAAA,EAAM,OAAO,UACbA,EAAM,OAAO,UACbA,EAAM,QAAQ,SAAS,cAAc,yBAAyB,EAAE,aAAa,SAAS,GACtFD,EAAK,YAAYC,CAAK;AAAA,EACtB;AAED,kBAAS,KAAK,YAAYD,CAAI,GAEvBA;AACR;AAUO,SAASE,GAAiBpD,GAAKqD,GAAK;AAC1C,QAAM,EAAE,QAAA/D,EAAM,IAAKU,GACbsD,IAAMtD,EAAI,QACVuD,IAAa,CAAE;AACrB,EAAAA,EAAW,UAAU,kBACrBA,EAAWnE,GAAO,eAAe,IAAI,cACrCmE,EAAWnE,GAAO,oBAAoB,IAAI,YAC1CmE,EAAWnE,GAAO,4BAA4B,IAAI,SAClDmE,EAAWnE,GAAO,sBAAsB,IAAI;AAG5C,QAAMoE,IAAU;AAAA,IACf,CAACpE,GAAO,kBAAkB,GAAG;AAAA,EAC7B,GAEKqE,IAAKJ,EAAI/D,CAAM,KAAK+D,EAAIG,EAAQlE,CAAM,CAAC,KAAKiE,EAAWjE,CAAM,KAAKiE,EAAW;AAEnF,EAAIjD,GAASmD,CAAE,IACVnE,MAAWF,GAAO,qBACrBsE,GAAiBD,CAAE,IAEnBE,GAAcL,KAAOG,CAAE,IAEdG,GAAWH,CAAE,KACvBA,EAAI;AAEN;AAUO,SAASI,GAAwB7D,GAAK8D,GAAS;AACrD,EAAAV,GAAiBpD,GAAK,EAAE,SAAA8D,GAAS;AAClC;AAMO,SAASC,GAAYC,GAAG;AAC9B,EAAIA,KAAKA,EAAE,cACVA,EAAE,YAAY,QAAQ,CAAC3C,MAAS;AAC/B,IAAAsC,GAActC,EAAK,OAAO,KAAK,GAAG,CAAC;AAAA,EACtC,CAAG,IACW2C,KAAKA,EAAE,WAGnBL,GAAc,MAAM,IAFpBA,GAAc,QAAQ;AAIxB;AAWO,SAASM,GAAcf,GAAMgB,GAAQ;AAE3C,QAAMC,IAAUC,GAAUlB,CAAI;AAC9B,EAAAgB,IAASA,KAAU,CAAE;AACrB,QAAMG,IAAY,CAACC,MAAQ;;AAC1B,aAAS/E,KAAO+E,GAAK;AAGpB,UAAIC;AAOJ,UANIC,GAAM,QAAQF,EAAI/E,CAAG,CAAC,IACzBgF,IAAOD,EAAI/E,CAAG,IACJkF,GAAOH,EAAI/E,CAAG,CAAC,MACzBgF,IAAOC,GAAMF,EAAI/E,CAAG,CAAC,IAGlBgF,KAAQL,EAAO,MAAM;AACxB,QAAI5D,GAAS4D,EAAO,IAAI,IACvBI,EAAI/E,CAAG,IAAIgF,EAAK,OAAOL,EAAO,IAAI,IACxBN,GAAWM,EAAO,IAAI,IAChCI,EAAI/E,CAAG,IAAI2E,EAAO,KAAKK,CAAI,IAE3BD,EAAI/E,CAAG,IAAIgF,EAAK,KAAM;AAEvB;AAAA,MACA;AAGD,UAAIG,GAAUJ,EAAI/E,CAAG,CAAC,KAAK2E,EAAO,SAAS;AAC1C,QAAIA,EAAO,YAAY,KACtBI,EAAI/E,CAAG,IAAI+E,EAAI/E,CAAG,IAAI,IAAI,IAChB,MAAM,QAAQ2E,EAAO,OAAO,MACtCI,EAAI/E,CAAG,IAAI+E,EAAI/E,CAAG,MAAI4B,IAAA+C,EAAO,YAAP,gBAAA/C,EAAiB,OAAM,MAAIwD,IAAAT,EAAO,YAAP,gBAAAS,EAAiB,OAAM;AAEzE;AAAA,MACA;AAGD,UAAIT,EAAO,YAAY;AACtB,cAAMU,IAAUV,EAAO;AACvB,YAAI1D,GAAS8D,EAAI/E,CAAG,CAAC,KAAK+E,EAAI/E,CAAG,EAAE,UAAU,UAAUe,GAASsE,CAAO,KAAK,CAAC9B,GAAYwB,EAAI/E,CAAG,EAAEqF,CAAO,CAAC,GAAG;AAC5G,UAAAN,EAAI/E,CAAG,IAAI+E,EAAI/E,CAAG,EAAEqF,CAAO;AAC3B;AAAA,QACA,WAAUpE,GAAS8D,EAAI/E,CAAG,CAAC,KAAKqE,GAAWgB,CAAO,KAAKN,EAAI/E,CAAG,EAAE,UAAU,QAAQ;AAClF,UAAA+E,EAAI/E,CAAG,IAAIqF,EAAQN,EAAI/E,CAAG,CAAC;AAC3B;AAAA,QACA;AAAA,MACD;AAGD,MAAIsF,GAAQP,EAAI/E,CAAG,CAAC,MACnB+E,EAAI/E,CAAG,IAAI8E,EAAUC,EAAI/E,CAAG,CAAC;AAAA,IAE9B;AAED,WAAO+E;AAAA,EACP;AAED,SAAOD,EAAUF,CAAO;AACzB;ACnLA;AAKA,MAAMW,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdC,KAAM,CAACC,MAAMA,aAAa,YAC1BC,KAAQ,MAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACC,GAAGC,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAI5E,SAASC,GAAWC,GAAO;AAC9B,MAAI,CAACN,GAAIM,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AAEzC,MAAIC,IAAM;AACV,WAASH,IAAI,GAAGA,IAAIE,EAAM,QAAQF;AAC9B,IAAAG,KAAOL,GAAMI,EAAMF,CAAC,CAAC;AAEzB,SAAOG;AACX;AACO,SAASC,EAAoBC,GAAK;AACrC,QAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,SAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AACxC;AACO,SAASG,EAAYH,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAE5D,SAAO,OAAOA,MAAQ,KAAK,MAAM,KAAKA,CAAG,EAAE;AAC/C;AAIO,SAASI,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,QAAMK,IAAML,EAAI;AAChB,MAAIK,IAAM;AACN,UAAM,IAAI,MAAM,4DAA4DA,CAAG;AACnF,QAAMC,IAAQ,IAAI,WAAWD,IAAM,CAAC;AACpC,WAASR,IAAI,GAAGA,IAAIS,EAAM,QAAQT,KAAK;AACnC,UAAMU,IAAIV,IAAI,GACRW,IAAUR,EAAI,MAAMO,GAAGA,IAAI,CAAC,GAC5BE,IAAO,OAAO,SAASD,GAAS,EAAE;AACxC,QAAI,OAAO,MAAMC,CAAI,KAAKA,IAAO;AAC7B,YAAM,IAAI,MAAM,uBAAuB;AAC3C,IAAAH,EAAMT,CAAC,IAAIY;AAAA,EACd;AACD,SAAOH;AACX;AAEO,SAASI,GAAgBX,GAAO;AACnC,SAAOI,EAAYL,GAAWC,CAAK,CAAC;AACxC;AACO,SAASY,GAAgBZ,GAAO;AACnC,MAAI,CAACN,GAAIM,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,SAAOI,EAAYL,GAAW,WAAW,KAAKC,CAAK,EAAE,QAAS,CAAA,CAAC;AACnE;AACO,SAASa,GAAgBC,GAAGR,GAAK;AACpC,SAAOD,GAAWS,EAAE,SAAS,EAAE,EAAE,SAASR,IAAM,GAAG,GAAG,CAAC;AAC3D;AACO,SAASS,GAAgBD,GAAGR,GAAK;AACpC,SAAOO,GAAgBC,GAAGR,CAAG,EAAE,QAAO;AAC1C;AAEO,SAASU,GAAmBF,GAAG;AAClC,SAAOT,GAAWH,EAAoBY,CAAC,CAAC;AAC5C;AAUO,SAASG,EAAYC,GAAOjB,GAAKkB,GAAgB;AACpD,MAAI1G;AACJ,MAAI,OAAOwF,KAAQ;AACf,QAAI;AACA,MAAAxF,IAAM4F,GAAWJ,CAAG;AAAA,IACvB,SACMxB,GAAG;AACN,YAAM,IAAI,MAAM,GAAGyC,CAAK,mCAAmCjB,CAAG,aAAaxB,CAAC,EAAE;AAAA,IACjF;AAAA,WAEIiB,GAAIO,CAAG;AAGZ,IAAAxF,IAAM,WAAW,KAAKwF,CAAG;AAAA;AAGzB,UAAM,IAAI,MAAM,GAAGiB,CAAK,mCAAmC;AAE/D,QAAMZ,IAAM7F,EAAI;AAChB,MAAI,OAAO0G,KAAmB,YAAYb,MAAQa;AAC9C,UAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAeb,CAAG,EAAE;AAC3E,SAAO7F;AACX;AAIO,SAAS2G,KAAeC,GAAQ;AACnC,QAAMC,IAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,GAAK5B,MAAM4B,IAAM5B,EAAE,QAAQ,CAAC,CAAC;AACrE,MAAI6B,IAAM;AACV,SAAAH,EAAO,QAAQ,CAAC1B,MAAM;AAClB,QAAI,CAACD,GAAIC,CAAC;AACN,YAAM,IAAI,MAAM,qBAAqB;AACzC,IAAA2B,EAAE,IAAI3B,GAAG6B,CAAG,GACZA,KAAO7B,EAAE;AAAA,EACjB,CAAK,GACM2B;AACX;AACO,SAASG,GAAWC,GAAIC,GAAI;AAE/B,MAAID,EAAG,WAAWC,EAAG;AACjB,WAAO;AACX,WAAS7B,IAAI,GAAGA,IAAI4B,EAAG,QAAQ5B;AAC3B,QAAI4B,EAAG5B,CAAC,MAAM6B,EAAG7B,CAAC;AACd,aAAO;AACf,SAAO;AACX;AAIO,SAAS8B,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAMO,SAASC,GAAOhB,GAAG;AACtB,MAAIR;AACJ,OAAKA,IAAM,GAAGQ,IAAIvB,IAAKuB,MAAMtB,IAAKc,KAAO;AACrC;AACJ,SAAOA;AACX;AAMO,SAASyB,GAAOjB,GAAGkB,GAAK;AAC3B,SAAQlB,KAAK,OAAOkB,CAAG,IAAKxC;AAChC;AAIO,MAAMyC,KAAS,CAACnB,GAAGkB,GAAK7G,MACpB2F,KAAM3F,IAAQqE,KAAMD,OAAQ,OAAOyC,CAAG,GAMpCE,KAAU,CAACpB,OAAOrB,MAAO,OAAOqB,IAAI,CAAC,KAAKtB,IAEjD2C,KAAM,CAACvH,MAAS,IAAI,WAAWA,CAAI,GACnCwH,KAAO,CAACC,MAAQ,WAAW,KAAKA,CAAG;AAQlC,SAASC,GAAeC,GAASC,GAAUC,GAAQ;AACtD,MAAI,OAAOF,KAAY,YAAYA,IAAU;AACzC,UAAM,IAAI,MAAM,0BAA0B;AAC9C,MAAI,OAAOC,KAAa,YAAYA,IAAW;AAC3C,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI,OAAOC,KAAW;AAClB,UAAM,IAAI,MAAM,2BAA2B;AAE/C,MAAI5C,IAAIsC,GAAII,CAAO,GACfG,IAAIP,GAAII,CAAO,GACfzC,IAAI;AACR,QAAM6C,IAAQ,MAAM;AAChB,IAAA9C,EAAE,KAAK,CAAC,GACR6C,EAAE,KAAK,CAAC,GACR5C,IAAI;AAAA,EACZ,GACU8C,IAAI,IAAIC,MAAMJ,EAAOC,GAAG7C,GAAG,GAAGgD,CAAC,GAC/BC,IAAS,CAACC,IAAOZ,SAAU;AAI7B,IAFAO,IAAIE,EAAER,GAAK,CAAC,CAAI,CAAC,GAAGW,CAAI,GACxBlD,IAAI+C,EAAC,GACDG,EAAK,WAAW,MAEpBL,IAAIE,EAAER,GAAK,CAAC,CAAI,CAAC,GAAGW,CAAI,GACxBlD,IAAI+C,EAAC;AAAA,EACb,GACUI,IAAM,MAAM;AAEd,QAAIlD,OAAO;AACP,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAIQ,IAAM;AACV,UAAM2C,IAAM,CAAA;AACZ,WAAO3C,IAAMkC,KAAU;AACnB,MAAA3C,IAAI+C,EAAC;AACL,YAAMM,IAAKrD,EAAE;AACb,MAAAoD,EAAI,KAAKC,CAAE,GACX5C,KAAOT,EAAE;AAAA,IACZ;AACD,WAAOuB,EAAY,GAAG6B,CAAG;AAAA,EACjC;AAUI,SATiB,CAACF,GAAMI,MAAS;AAC7B,IAAAR,KACAG,EAAOC,CAAI;AACX,QAAItI;AACJ,WAAO,EAAEA,IAAM0I,EAAKH,EAAK,CAAA;AACrB,MAAAF;AACJ,WAAAH,KACOlI;AAAA,EACf;AAEA;AAEA,MAAM2I,KAAe;AAAA,EACjB,QAAQ,CAACC,MAAQ,OAAOA,KAAQ;AAAA,EAChC,UAAU,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAClC,SAAS,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EACjC,QAAQ,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAChC,eAAe,CAACA,MAAQ,OAAO,cAAcA,CAAG;AAAA,EAChD,OAAO,CAACA,MAAQ,MAAM,QAAQA,CAAG;AAAA,EACjC,OAAO,CAACA,GAAKC,MAAWA,EAAO,GAAG,QAAQD,CAAG;AAAA,EAC7C,MAAM,CAACA,MAAQ,OAAOA,KAAQ,cAAc,OAAO,cAAcA,EAAI,SAAS;AAClF;AAEO,SAASE,GAAeD,GAAQE,GAAYC,IAAgB,CAAA,GAAI;AACnE,QAAMC,IAAa,CAACC,GAAWC,GAAMC,MAAe;AAChD,UAAMC,IAAWV,GAAaQ,CAAI;AAClC,QAAI,OAAOE,KAAa;AACpB,YAAM,IAAI,MAAM,sBAAsBF,CAAI,sBAAsB;AACpE,UAAMP,IAAMC,EAAOK,CAAS;AAC5B,QAAI,EAAAE,KAAcR,MAAQ,WAEtB,CAACS,EAAST,GAAKC,CAAM;AACrB,YAAM,IAAI,MAAM,iBAAiB,OAAOK,CAAS,CAAC,IAAIN,CAAG,KAAK,OAAOA,CAAG,eAAeO,CAAI,EAAE;AAAA,EAEzG;AACI,aAAW,CAACD,GAAWC,CAAI,KAAK,OAAO,QAAQJ,CAAU;AACrD,IAAAE,EAAWC,GAAWC,GAAM,EAAK;AACrC,aAAW,CAACD,GAAWC,CAAI,KAAK,OAAO,QAAQH,CAAa;AACxD,IAAAC,EAAWC,GAAWC,GAAM,EAAI;AACpC,SAAON;AACX;;;;;;;;;;;;;;;;;;;;;;;AC/PA;AAIA,MAAM/D,IAAM,OAAO,CAAC,GAAGC,IAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGsE,KAAM,OAAO,CAAC,GAEjEC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AAE1C,OAAO,CAAC;AAAU,OAAO,EAAE;AAEhC,SAASC,EAAIxE,GAAGkD,GAAG;AACtB,QAAMuB,IAASzE,IAAIkD;AACnB,SAAOuB,KAAU7E,IAAM6E,IAASvB,IAAIuB;AACxC;AAQO,SAASC,GAAIlE,GAAKmE,GAAOC,GAAQ;AACpC,MAAIA,KAAUhF,KAAO+E,IAAQ/E;AACzB,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAIgF,MAAW/E;AACX,WAAOD;AACX,MAAI9E,IAAM+E;AACV,SAAO8E,IAAQ/E;AACX,IAAI+E,IAAQ9E,MACR/E,IAAOA,IAAM0F,IAAOoE,IACxBpE,IAAOA,IAAMA,IAAOoE,GACpBD,MAAU9E;AAEd,SAAO/E;AACX;AAWO,SAAS+J,GAAOC,GAAQF,GAAQ;AACnC,MAAIE,MAAWlF,KAAOgF,KAAUhF;AAC5B,UAAM,IAAI,MAAM,6CAA6CkF,CAAM,QAAQF,CAAM,EAAE;AAIvF,MAAI5E,IAAIwE,EAAIM,GAAQF,CAAM,GACtB1B,IAAI0B,GAEJG,IAAInF,GAAcoF,IAAInF;AAC1B,SAAOG,MAAMJ,KAAK;AAEd,UAAMqF,IAAI/B,IAAIlD,GACR2B,IAAIuB,IAAIlD,GACRkF,IAAIH,IAAIC,IAAIC;AAGlB,IAAA/B,IAAIlD,GAAGA,IAAI2B,GAAGoD,IAAIC,GAAUA,IAAIE;AAAA,EACnC;AAED,MADYhC,MACArD;AACR,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAO2E,EAAIO,GAAGH,CAAM;AACxB;AAIO,SAASO,GAAcC,GAAG;AAM7B,QAAMC,KAAaD,IAAIvF,KAAOC;AAC9B,MAAIwF,GAAGC,GAAGC;AAGV,OAAKF,IAAIF,IAAIvF,GAAK0F,IAAI,GAAGD,IAAIxF,OAAQF,GAAK0F,KAAKxF,IAAKyF;AAChD;AAEJ,OAAKC,IAAI1F,IAAK0F,IAAIJ,KAAKV,GAAIc,GAAGH,GAAWD,CAAC,MAAMA,IAAIvF,GAAK2F;AACrD;AAEJ,MAAID,MAAM,GAAG;AACT,UAAME,KAAUL,IAAIvF,KAAOwE;AAC3B,WAAO,SAAqBqB,GAAIvE,GAAG;AAC/B,YAAMwE,IAAOD,EAAG,IAAIvE,GAAGsE,CAAM;AAC7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAGxE,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAOwE;AAAA,IACnB;AAAA,EACK;AAED,QAAMC,KAAUN,IAAIzF,KAAOC;AAC3B,SAAO,SAAqB4F,GAAIvE,GAAG;AAE/B,QAAIuE,EAAG,IAAIvE,GAAGkE,CAAS,MAAMK,EAAG,IAAIA,EAAG,GAAG;AACtC,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAI/D,IAAI4D,GAEJM,IAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,KAAKF,CAAC,GAAGF,CAAC,GAC/BP,IAAIW,EAAG,IAAIvE,GAAGyE,CAAM,GACpB1C,IAAIwC,EAAG,IAAIvE,GAAGmE,CAAC;AACnB,WAAO,CAACI,EAAG,IAAIxC,GAAGwC,EAAG,GAAG,KAAG;AACvB,UAAIA,EAAG,IAAIxC,GAAGwC,EAAG,IAAI;AACjB,eAAOA,EAAG;AAEd,UAAIR,IAAI;AACR,eAASY,IAAKJ,EAAG,IAAIxC,CAAC,GAAGgC,IAAIvD,KACrB,CAAA+D,EAAG,IAAII,GAAIJ,EAAG,GAAG,GADOR;AAG5B,QAAAY,IAAKJ,EAAG,IAAII,CAAE;AAGlB,YAAMC,IAAKL,EAAG,IAAIG,GAAGhG,KAAO,OAAO8B,IAAIuD,IAAI,CAAC,CAAC;AAC7C,MAAAW,IAAIH,EAAG,IAAIK,CAAE,GACbhB,IAAIW,EAAG,IAAIX,GAAGgB,CAAE,GAChB7C,IAAIwC,EAAG,IAAIxC,GAAG2C,CAAC,GACflE,IAAIuD;AAAA,IACP;AACD,WAAOH;AAAA,EACf;AACA;AACO,SAASiB,GAAOZ,GAAG;AAKtB,MAAIA,IAAIf,OAAQD,IAAK;AAKjB,UAAMqB,KAAUL,IAAIvF,KAAOwE;AAC3B,WAAO,SAAmBqB,GAAIvE,GAAG;AAC7B,YAAMwE,IAAOD,EAAG,IAAIvE,GAAGsE,CAAM;AAE7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAGxE,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAOwE;AAAA,IACnB;AAAA,EACK;AAED,MAAIP,IAAIb,OAAQD,IAAK;AACjB,UAAM2B,KAAMb,IAAId,MAAOC;AACvB,WAAO,SAAmBmB,GAAIvE,GAAG;AAC7B,YAAM+E,IAAKR,EAAG,IAAIvE,GAAGrB,EAAG,GAClBI,IAAIwF,EAAG,IAAIQ,GAAID,CAAE,GACjBE,IAAKT,EAAG,IAAIvE,GAAGjB,CAAC,GAChBC,IAAIuF,EAAG,IAAIA,EAAG,IAAIS,GAAIrG,EAAG,GAAGI,CAAC,GAC7ByF,IAAOD,EAAG,IAAIS,GAAIT,EAAG,IAAIvF,GAAGuF,EAAG,GAAG,CAAC;AACzC,UAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAGxE,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAOwE;AAAA,IACnB;AAAA,EACK;AAwBD,SAAOR,GAAcC,CAAC;AAC1B;AAIA,MAAMgB,KAAe;AAAA,EACjB;AAAA,EAAU;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAClD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAC5B;AACO,SAASC,GAAcC,GAAO;AACjC,QAAMC,IAAU;AAAA,IACZ,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,EACd,GACUC,IAAOJ,GAAa,OAAO,CAACK,GAAK/C,OACnC+C,EAAI/C,CAAG,IAAI,YACJ+C,IACRF,CAAO;AACV,SAAO3C,GAAe0C,GAAOE,CAAI;AACrC;AAEO,SAASE,GAAMC,GAAGnG,GAAKmE,GAAO;AAGjC,MAAIA,IAAQ/E;AACR,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI+E,MAAU/E;AACV,WAAO+G,EAAE;AACb,MAAIhC,MAAU9E;AACV,WAAOW;AACX,MAAIoG,IAAID,EAAE,KACNE,IAAIrG;AACR,SAAOmE,IAAQ/E;AACX,IAAI+E,IAAQ9E,MACR+G,IAAID,EAAE,IAAIC,GAAGC,CAAC,IAClBA,IAAIF,EAAE,IAAIE,CAAC,GACXlC,MAAU9E;AAEd,SAAO+G;AACX;AAEO,SAASE,GAAcH,GAAGI,GAAM;AACnC,QAAMC,IAAM,IAAI,MAAMD,EAAK,MAAM,GAE3BE,IAAiBF,EAAK,OAAO,CAACxK,GAAKiE,GAAK,MACtCmG,EAAE,IAAInG,CAAG,IACFjE,KACXyK,EAAI,CAAC,IAAIzK,GACFoK,EAAE,IAAIpK,GAAKiE,CAAG,IACtBmG,EAAE,GAAG,GAEFO,IAAWP,EAAE,IAAIM,CAAc;AAErC,SAAAF,EAAK,YAAY,CAACxK,GAAKiE,GAAK,MACpBmG,EAAE,IAAInG,CAAG,IACFjE,KACXyK,EAAI,CAAC,IAAIL,EAAE,IAAIpK,GAAKyK,EAAI,CAAC,CAAC,GACnBL,EAAE,IAAIpK,GAAKiE,CAAG,IACtB0G,CAAQ,GACJF;AACX;AAaO,SAASG,GAAQhG,GAAGiG,GAAY;AAEnC,QAAMC,IAAcD,MAAe,SAAYA,IAAajG,EAAE,SAAS,CAAC,EAAE,QACpEmG,IAAc,KAAK,KAAKD,IAAc,CAAC;AAC7C,SAAO,EAAE,YAAYA,GAAa,aAAAC;AACtC;AAaO,SAASC,GAAMC,GAAOrF,GAAQsF,IAAO,IAAOC,IAAQ,IAAI;AAC3D,MAAIF,KAAS5H;AACT,UAAM,IAAI,MAAM,8BAA8B4H,CAAK,EAAE;AACzD,QAAM,EAAE,YAAYG,GAAM,aAAaC,EAAK,IAAKT,GAAQK,GAAOrF,CAAM;AACtE,MAAIyF,IAAQ;AACR,UAAM,IAAI,MAAM,iDAAiD;AACrE,QAAMC,IAAQ7B,GAAOwB,CAAK,GACpBb,IAAI,OAAO,OAAO;AAAA,IACpB,OAAAa;AAAA,IACA,MAAAG;AAAA,IACA,OAAAC;AAAA,IACA,MAAMrF,GAAQoF,CAAI;AAAA,IAClB,MAAM/H;AAAAA,IACN,KAAKC;AAAAA,IACL,QAAQ,CAACW,MAAQgE,EAAIhE,GAAKgH,CAAK;AAAA,IAC/B,SAAS,CAAChH,MAAQ;AACd,UAAI,OAAOA,KAAQ;AACf,cAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE;AAC/E,aAAOZ,KAAOY,KAAOA,IAAMgH;AAAA,IAC9B;AAAA,IACD,KAAK,CAAChH,MAAQA,MAAQZ;AAAAA,IACtB,OAAO,CAACY,OAASA,IAAMX,OAASA;AAAAA,IAChC,KAAK,CAACW,MAAQgE,EAAI,CAAChE,GAAKgH,CAAK;AAAA,IAC7B,KAAK,CAACM,GAAKC,MAAQD,MAAQC;AAAA,IAC3B,KAAK,CAACvH,MAAQgE,EAAIhE,IAAMA,GAAKgH,CAAK;AAAA,IAClC,KAAK,CAACM,GAAKC,MAAQvD,EAAIsD,IAAMC,GAAKP,CAAK;AAAA,IACvC,KAAK,CAACM,GAAKC,MAAQvD,EAAIsD,IAAMC,GAAKP,CAAK;AAAA,IACvC,KAAK,CAACM,GAAKC,MAAQvD,EAAIsD,IAAMC,GAAKP,CAAK;AAAA,IACvC,KAAK,CAAChH,GAAKmE,MAAU+B,GAAMC,GAAGnG,GAAKmE,CAAK;AAAA,IACxC,KAAK,CAACmD,GAAKC,MAAQvD,EAAIsD,IAAMjD,GAAOkD,GAAKP,CAAK,GAAGA,CAAK;AAAA;AAAA,IAEtD,MAAM,CAAChH,MAAQA,IAAMA;AAAA,IACrB,MAAM,CAACsH,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,KAAK,CAACvH,MAAQqE,GAAOrE,GAAKgH,CAAK;AAAA,IAC/B,MAAME,EAAM,SAAS,CAACvG,MAAM0G,EAAMlB,GAAGxF,CAAC;AAAA,IACtC,aAAa,CAAC6G,MAAQlB,GAAcH,GAAGqB,CAAG;AAAA;AAAA;AAAA,IAG1C,MAAM,CAAChI,GAAGkD,GAAG+E,MAAOA,IAAI/E,IAAIlD;AAAA,IAC5B,SAAS,CAACQ,MAASiH,IAAOrG,GAAgBZ,GAAKoH,CAAK,IAAI1G,GAAgBV,GAAKoH,CAAK;AAAA,IAClF,WAAW,CAACvH,MAAU;AAClB,UAAIA,EAAM,WAAWuH;AACjB,cAAM,IAAI,MAAM,0BAA0BA,CAAK,SAASvH,EAAM,MAAM,EAAE;AAC1E,aAAOoH,IAAOxG,GAAgBZ,CAAK,IAAIW,GAAgBX,CAAK;AAAA,IAC/D;AAAA,EACT,CAAK;AACD,SAAO,OAAO,OAAOsG,CAAC;AAC1B;AAwBO,SAASuB,GAAoBC,GAAMC,GAAYX,IAAO,IAAO;AAChE,EAAAU,IAAO7G,EAAY,eAAe6G,CAAI;AACtC,QAAMvF,IAAUuF,EAAK,QACfE,IAASlB,GAAQiB,CAAU,EAAE,cAAc;AACjD,MAAIC,IAAS,MAAMzF,IAAUyF,KAAUzF,IAAU;AAC7C,UAAM,IAAI,MAAM,iCAAiCyF,CAAM,6BAA6BzF,CAAO,EAAE;AACjG,QAAMpC,IAAMiH,IAAOxG,GAAgBkH,CAAI,IAAInH,GAAgBmH,CAAI;AAC/D,SAAO3D,EAAIhE,GAAK4H,IAAavI,CAAG,IAAIA;AACxC;ACvWA;AAIA,MAAMD,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC;AAYb,SAASyI,GAAKL,GAAGM,GAAM;AAC1B,QAAMC,IAAkB,CAACC,GAAWtM,MAAS;AACzC,UAAMuM,IAAMvM,EAAK;AACjB,WAAOsM,IAAYC,IAAMvM;AAAA,EACjC,GACUqK,IAAO,CAACmC,MAAM;AAChB,UAAMC,IAAU,KAAK,KAAKL,IAAOI,CAAC,IAAI,GAChCE,IAAa,MAAMF,IAAI;AAC7B,WAAO,EAAE,SAAAC,GAAS,YAAAC;EAC1B;AACI,SAAO;AAAA,IACH,iBAAAL;AAAA;AAAA,IAEA,aAAaM,GAAK3H,GAAG;AACjB,UAAIyF,IAAIqB,EAAE,MACNpB,IAAIiC;AACR,aAAO3H,IAAIvB;AACP,QAAIuB,IAAItB,OACJ+G,IAAIA,EAAE,IAAIC,CAAC,IACfA,IAAIA,EAAE,UACN1F,MAAMtB;AAEV,aAAO+G;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAWD,iBAAiBkC,GAAKH,GAAG;AACrB,YAAM,EAAE,SAAAC,GAAS,YAAAC,EAAY,IAAGrC,EAAKmC,CAAC,GAChCI,IAAS,CAAA;AACf,UAAInC,IAAIkC,GACJE,IAAOpC;AACX,eAASqC,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,QAAAD,IAAOpC,GACPmC,EAAO,KAAKC,CAAI;AAEhB,iBAAS7I,IAAI,GAAGA,IAAI0I,GAAY1I;AAC5B,UAAA6I,IAAOA,EAAK,IAAIpC,CAAC,GACjBmC,EAAO,KAAKC,CAAI;AAEpB,QAAApC,IAAIoC,EAAK;MACZ;AACD,aAAOD;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,KAAKJ,GAAGO,GAAa/H,GAAG;AAGpB,YAAM,EAAE,SAAAyH,GAAS,YAAAC,EAAY,IAAGrC,EAAKmC,CAAC;AACtC,UAAI/B,IAAIqB,EAAE,MACNtB,IAAIsB,EAAE;AACV,YAAMkB,IAAO,OAAO,KAAKR,IAAI,CAAC,GACxBS,IAAY,KAAKT,GACjBU,IAAU,OAAOV,CAAC;AACxB,eAASM,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,cAAMK,IAASL,IAASJ;AAExB,YAAIU,IAAQ,OAAOpI,IAAIgI,CAAI;AAE3B,QAAAhI,MAAMkI,GAGFE,IAAQV,MACRU,KAASH,GACTjI,KAAKtB;AAST,cAAM2J,IAAUF,GACVG,IAAUH,IAAS,KAAK,IAAIC,CAAK,IAAI,GACrCG,IAAQT,IAAS,MAAM,GACvBU,IAAQJ,IAAQ;AACtB,QAAIA,MAAU,IAEV5C,IAAIA,EAAE,IAAI6B,EAAgBkB,GAAOR,EAAYM,CAAO,CAAC,CAAC,IAGtD5C,IAAIA,EAAE,IAAI4B,EAAgBmB,GAAOT,EAAYO,CAAO,CAAC,CAAC;AAAA,MAE7D;AAMD,aAAO,EAAE,GAAA7C,GAAG,GAAAD;IACf;AAAA,IACD,WAAWvB,GAAGwE,GAAgBzI,GAAG0I,GAAW;AAExC,YAAMlB,IAAIvD,EAAE,gBAAgB;AAE5B,UAAI0E,IAAOF,EAAe,IAAIxE,CAAC;AAC/B,aAAK0E,MACDA,IAAO,KAAK,iBAAiB1E,GAAGuD,CAAC,GAC7BA,MAAM,KACNiB,EAAe,IAAIxE,GAAGyE,EAAUC,CAAI,CAAC,IAGtC,KAAK,KAAKnB,GAAGmB,GAAM3I,CAAC;AAAA,IAC9B;AAAA,EACT;AACA;AACO,SAAS4I,GAAcC,GAAO;AACjC,SAAA3D,GAAc2D,EAAM,EAAE,GACtBpG,GAAeoG,GAAO;AAAA,IAClB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,EACZ,GAAO;AAAA,IACC,YAAY;AAAA,IACZ,aAAa;AAAA,EACrB,CAAK,GAEM,OAAO,OAAO;AAAA,IACjB,GAAG7C,GAAQ6C,EAAM,GAAGA,EAAM,UAAU;AAAA,IACpC,GAAGA;AAAA,IACE,GAAGA,EAAM,GAAG;AAAA,EACzB,CAAK;AACL;AC1JA;AAMA,SAASC,GAAkBD,GAAO;AAC9B,QAAMxD,IAAOuD,GAAcC,CAAK;AAChCE,EAAAA,GAAkB1D,GAAM;AAAA,IACpB,GAAG;AAAA,IACH,GAAG;AAAA,EACX,GAAO;AAAA,IACC,0BAA0B;AAAA,IAC1B,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf,eAAe;AAAA,IACf,oBAAoB;AAAA,IACpB,WAAW;AAAA,IACX,SAAS;AAAA,EACjB,CAAK;AACD,QAAM,EAAE,MAAA2D,GAAM,IAAAzE,GAAI,GAAA1F,EAAC,IAAKwG;AACxB,MAAI2D,GAAM;AACN,QAAI,CAACzE,EAAG,IAAI1F,GAAG0F,EAAG,IAAI;AAClB,YAAM,IAAI,MAAM,mEAAmE;AAEvF,QAAI,OAAOyE,KAAS,YAChB,OAAOA,EAAK,QAAS,YACrB,OAAOA,EAAK,eAAgB;AAC5B,YAAM,IAAI,MAAM,mEAAmE;AAAA,EAE1F;AACD,SAAO,OAAO,OAAO,EAAE,GAAG3D,EAAM,CAAA;AACpC;AAEA,MAAM,EAAE,iBAAiB4D,IAAK,YAAYC,GAAG,IAAKC,IACrCC,KAAM;AAAA;AAAA,EAEf,KAAK,cAAqB,MAAM;AAAA,IAC5B,YAAYrF,IAAI,IAAI;AAChB,YAAMA,CAAC;AAAA,IACV;AAAA,EACJ;AAAA,EACD,UAAUjK,GAAM;AACZ,UAAM,EAAE,KAAKuP,EAAG,IAAGD;AACnB,QAAItP,EAAK,SAAS,KAAKA,EAAK,CAAC,MAAM;AAC/B,YAAM,IAAIuP,EAAE,+BAA+B;AAC/C,UAAM7J,IAAM1F,EAAK,CAAC,GACZH,IAAMG,EAAK,SAAS,GAAG0F,IAAM,CAAC;AACpC,QAAI,CAACA,KAAO7F,EAAI,WAAW6F;AACvB,YAAM,IAAI6J,EAAE,yCAAyC;AAKzD,QAAI1P,EAAI,CAAC,IAAI;AACT,YAAM,IAAI0P,EAAE,qCAAqC;AACrD,QAAI1P,EAAI,CAAC,MAAM,KAAQ,EAAEA,EAAI,CAAC,IAAI;AAC9B,YAAM,IAAI0P,EAAE,qDAAqD;AACrE,WAAO,EAAE,GAAGJ,GAAItP,CAAG,GAAG,GAAGG,EAAK,SAAS0F,IAAM,CAAC;EACjD;AAAA,EACD,MAAML,GAAK;AAEP,UAAM,EAAE,KAAKkK,EAAG,IAAGD,IACbtP,IAAO,OAAOqF,KAAQ,WAAW+J,GAAI/J,CAAG,IAAIA;AAClD,QAAI,EAAErF,aAAgB;AAClB,YAAM,IAAI,MAAM,eAAe;AACnC,QAAIwP,IAAIxP,EAAK;AACb,QAAIwP,IAAI,KAAKxP,EAAK,CAAC,KAAK;AACpB,YAAM,IAAIuP,EAAE,uBAAuB;AACvC,QAAIvP,EAAK,CAAC,MAAMwP,IAAI;AAChB,YAAM,IAAID,EAAE,qCAAqC;AACrD,UAAM,EAAE,GAAG,GAAG,GAAGE,EAAQ,IAAGH,GAAI,UAAUtP,EAAK,SAAS,CAAC,CAAC,GACpD,EAAE,GAAG0P,GAAG,GAAGC,EAAU,IAAKL,GAAI,UAAUG,CAAM;AACpD,QAAIE,EAAW;AACX,YAAM,IAAIJ,EAAE,6CAA6C;AAC7D,WAAO,EAAE,GAAG,GAAAG;EACf;AAAA,EACD,WAAWE,GAAK;AAEZ,UAAMC,IAAQ,CAACH,MAAO,OAAO,SAASA,EAAE,CAAC,GAAG,EAAE,IAAI,IAAS,OAAOA,IAAIA,GAChE1H,IAAI,CAACzC,MAAQ;AACf,YAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,aAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AAAA,IAChD,GACcqK,IAAIG,EAAM7H,EAAE4H,EAAI,CAAC,CAAC,GAClB,IAAIC,EAAM7H,EAAE4H,EAAI,CAAC,CAAC,GAClBE,IAAMJ,EAAE,SAAS,GACjBK,IAAM,EAAE,SAAS,GACjBzH,IAAKN,EAAE8H,CAAG,GACVE,IAAKhI,EAAE+H,CAAG;AAChB,WAAO,KAAK/H,EAAE+H,IAAMD,IAAM,CAAC,CAAC,KAAKE,CAAE,GAAG,CAAC,KAAK1H,CAAE,GAAGoH,CAAC;AAAA,EACrD;AACL,GAGM/K,KAAM,OAAO,CAAC,GAAGC,IAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AAAE,MAACuE,KAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AACjF,SAAS8G,GAAkB1E,GAAM;AACpC,QAAM2E,IAAQlB,GAAkBzD,CAAI,GAC9B,EAAE,IAAAd,EAAI,IAAGyF,GACTC,IAAUD,EAAM,YACjB,CAAClD,GAAGoD,GAAOC,MAAiB;AACzB,UAAMtL,IAAIqL,EAAM;AAChB,WAAOE,EAAe,WAAW,KAAK,CAAC,CAAI,CAAC,GAAG7F,EAAG,QAAQ1F,EAAE,CAAC,GAAG0F,EAAG,QAAQ1F,EAAE,CAAC,CAAC;AAAA,EAC3F,IACUwL,IAAYL,EAAM,cACnB,CAAC9K,MAAU;AAER,UAAMoL,IAAOpL,EAAM,SAAS,CAAC,GAEvB0E,IAAIW,EAAG,UAAU+F,EAAK,SAAS,GAAG/F,EAAG,KAAK,CAAC,GAC3C,IAAIA,EAAG,UAAU+F,EAAK,SAAS/F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,WAAO,EAAE,GAAAX,GAAG;EACxB;AAKI,WAAS2G,EAAoB3G,GAAG;AAC5B,UAAM,EAAE,GAAG,GAAA7B,EAAG,IAAGiI,GACXQ,IAAKjG,EAAG,IAAIX,CAAC,GACb6G,IAAKlG,EAAG,IAAIiG,GAAI5G,CAAC;AACvB,WAAOW,EAAG,IAAIA,EAAG,IAAIkG,GAAIlG,EAAG,IAAIX,GAAG,CAAC,CAAC,GAAG7B,CAAC;AAAA,EAC5C;AAKD,MAAI,CAACwC,EAAG,IAAIA,EAAG,IAAIyF,EAAM,EAAE,GAAGO,EAAoBP,EAAM,EAAE,CAAC;AACvD,UAAM,IAAI,MAAM,6CAA6C;AAEjE,WAASU,EAAmBrL,GAAK;AAC7B,WAAO,OAAOA,KAAQ,YAAYZ,KAAMY,KAAOA,IAAM2K,EAAM;AAAA,EAC9D;AACD,WAASW,EAAStL,GAAK;AACnB,QAAI,CAACqL,EAAmBrL,CAAG;AACvB,YAAM,IAAI,MAAM,6CAA6C;AAAA,EACpE;AAGD,WAASuL,EAAuB1R,GAAK;AACjC,UAAM,EAAE,0BAA0B2R,GAAS,aAAA1E,GAAa,gBAAA2E,GAAgB,GAAA9K,EAAG,IAAGgK;AAC9E,QAAIa,KAAW,OAAO3R,KAAQ,UAAU;AAIpC,UAHIA,aAAe,eACfA,IAAM6R,GAAc7R,CAAG,IAEvB,OAAOA,KAAQ,YAAY,CAAC2R,EAAQ,SAAS3R,EAAI,MAAM;AACvD,cAAM,IAAI,MAAM,aAAa;AACjC,MAAAA,IAAMA,EAAI,SAASiN,IAAc,GAAG,GAAG;AAAA,IAC1C;AACD,QAAI9G;AACJ,QAAI;AACA,MAAAA,IACI,OAAOnG,KAAQ,WACTA,IACA8R,GAAmB7K,EAAY,eAAejH,GAAKiN,CAAW,CAAC;AAAA,IAC5E,QACa;AACV,YAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOjN,CAAG,EAAE;AAAA,IAC/F;AACD,WAAI4R,MACAzL,IAAM4L,EAAQ5L,GAAKW,CAAC,IACxB2K,EAAStL,CAAG,GACLA;AAAA,EACV;AACD,QAAM6L,IAAmB,oBAAI;AAC7B,WAASC,EAAeC,GAAO;AAC3B,QAAI,EAAEA,aAAiBC;AACnB,YAAM,IAAI,MAAM,0BAA0B;AAAA,EACjD;AAAA,EAMD,MAAMA,EAAM;AAAA,IACR,YAAYC,GAAIC,GAAIC,GAAI;AAIpB,UAHA,KAAK,KAAKF,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACNF,KAAM,QAAQ,CAAC/G,EAAG,QAAQ+G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAAChH,EAAG,QAAQgH,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAACjH,EAAG,QAAQiH,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAAA,IACnC;AAAA;AAAA;AAAA,IAGD,OAAO,WAAW/F,GAAG;AACjB,YAAM,EAAE,GAAA7B,GAAG,MAAM6B,KAAK,CAAA;AACtB,UAAI,CAACA,KAAK,CAAClB,EAAG,QAAQX,CAAC,KAAK,CAACW,EAAG,QAAQ,CAAC;AACrC,cAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAIkB,aAAa4F;AACb,cAAM,IAAI,MAAM,8BAA8B;AAClD,YAAMI,IAAM,CAACzM,MAAMuF,EAAG,IAAIvF,GAAGuF,EAAG,IAAI;AAEpC,aAAIkH,EAAI7H,CAAC,KAAK6H,EAAI,CAAC,IACRJ,EAAM,OACV,IAAIA,EAAMzH,GAAG,GAAGW,EAAG,GAAG;AAAA,IAChC;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,WAAWqD,GAAQ;AACtB,YAAM8D,IAAQnH,EAAG,YAAYqD,EAAO,IAAI,CAACnC,MAAMA,EAAE,EAAE,CAAC;AACpD,aAAOmC,EAAO,IAAI,CAACnC,GAAGzG,MAAMyG,EAAE,SAASiG,EAAM1M,CAAC,CAAC,CAAC,EAAE,IAAIqM,EAAM,UAAU;AAAA,IACzE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,QAAQlM,GAAK;AAChB,YAAM8E,IAAIoH,EAAM,WAAWhB,EAAUlK,EAAY,YAAYhB,CAAG,CAAC,CAAC;AAClE,aAAA8E,EAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,OAAO,eAAe0H,GAAY;AAC9B,aAAON,EAAM,KAAK,SAAST,EAAuBe,CAAU,CAAC;AAAA,IAChE;AAAA;AAAA,IAED,eAAejE,GAAY;AACvB,WAAK,eAAeA,GACpBwD,EAAiB,OAAO,IAAI;AAAA,IAC/B;AAAA;AAAA,IAED,iBAAiB;AAEb,UAAI,KAAK,OAAO;AACZ,YAAIlB,EAAM;AACN;AACJ,cAAM,IAAI,MAAM,iBAAiB;AAAA,MACpC;AAED,YAAM,EAAE,GAAApG,GAAG,GAAAgI,EAAG,IAAG,KAAK,SAAQ;AAE9B,UAAI,CAACrH,EAAG,QAAQX,CAAC,KAAK,CAACW,EAAG,QAAQqH,CAAC;AAC/B,cAAM,IAAI,MAAM,0BAA0B;AAC9C,YAAMC,IAAOtH,EAAG,IAAIqH,CAAC,GACfE,IAAQvB,EAAoB3G,CAAC;AACnC,UAAI,CAACW,EAAG,IAAIsH,GAAMC,CAAK;AACnB,cAAM,IAAI,MAAM,mCAAmC;AACvD,UAAI,CAAC,KAAK,cAAe;AACrB,cAAM,IAAI,MAAM,wCAAwC;AAAA,IAC/D;AAAA,IACD,WAAW;AACP,YAAM,EAAE,GAAAF,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAIrH,EAAG;AACH,eAAO,CAACA,EAAG,MAAMqH,CAAC;AACtB,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAChD;AAAA;AAAA;AAAA;AAAA,IAID,OAAOR,GAAO;AACV,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB,GAC7BiB,IAAK9H,EAAG,IAAIA,EAAG,IAAIwH,GAAIK,CAAE,GAAG7H,EAAG,IAAI2H,GAAID,CAAE,CAAC,GAC1CK,IAAK/H,EAAG,IAAIA,EAAG,IAAIyH,GAAII,CAAE,GAAG7H,EAAG,IAAI4H,GAAIF,CAAE,CAAC;AAChD,aAAOI,KAAMC;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AACL,aAAO,IAAIjB,EAAM,KAAK,IAAI9G,EAAG,IAAI,KAAK,EAAE,GAAG,KAAK,EAAE;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS;AACL,YAAM,EAAE,GAAG,GAAAxC,EAAG,IAAGiI,GACXuC,IAAKhI,EAAG,IAAIxC,GAAGkB,EAAG,GAClB,EAAE,IAAI8I,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG;AACnC,UAAIO,IAAKjI,EAAG,MAAMkI,IAAKlI,EAAG,MAAMmI,IAAKnI,EAAG,MACpCoI,IAAKpI,EAAG,IAAIwH,GAAIA,CAAE,GAClBa,IAAKrI,EAAG,IAAIyH,GAAIA,CAAE,GAClBrH,IAAKJ,EAAG,IAAI0H,GAAIA,CAAE,GAClBY,IAAKtI,EAAG,IAAIwH,GAAIC,CAAE;AACtB,aAAAa,IAAKtI,EAAG,IAAIsI,GAAIA,CAAE,GAClBH,IAAKnI,EAAG,IAAIwH,GAAIE,CAAE,GAClBS,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GAClBF,IAAKjI,EAAG,IAAI,GAAGmI,CAAE,GACjBD,IAAKlI,EAAG,IAAIgI,GAAI5H,CAAE,GAClB8H,IAAKlI,EAAG,IAAIiI,GAAIC,CAAE,GAClBD,IAAKjI,EAAG,IAAIqI,GAAIH,CAAE,GAClBA,IAAKlI,EAAG,IAAIqI,GAAIH,CAAE,GAClBA,IAAKlI,EAAG,IAAIiI,GAAIC,CAAE,GAClBD,IAAKjI,EAAG,IAAIsI,GAAIL,CAAE,GAClBE,IAAKnI,EAAG,IAAIgI,GAAIG,CAAE,GAClB/H,IAAKJ,EAAG,IAAI,GAAGI,CAAE,GACjBkI,IAAKtI,EAAG,IAAIoI,GAAIhI,CAAE,GAClBkI,IAAKtI,EAAG,IAAI,GAAGsI,CAAE,GACjBA,IAAKtI,EAAG,IAAIsI,GAAIH,CAAE,GAClBA,IAAKnI,EAAG,IAAIoI,GAAIA,CAAE,GAClBA,IAAKpI,EAAG,IAAImI,GAAIC,CAAE,GAClBA,IAAKpI,EAAG,IAAIoI,GAAIhI,CAAE,GAClBgI,IAAKpI,EAAG,IAAIoI,GAAIE,CAAE,GAClBJ,IAAKlI,EAAG,IAAIkI,GAAIE,CAAE,GAClBhI,IAAKJ,EAAG,IAAIyH,GAAIC,CAAE,GAClBtH,IAAKJ,EAAG,IAAII,GAAIA,CAAE,GAClBgI,IAAKpI,EAAG,IAAII,GAAIkI,CAAE,GAClBL,IAAKjI,EAAG,IAAIiI,GAAIG,CAAE,GAClBD,IAAKnI,EAAG,IAAII,GAAIiI,CAAE,GAClBF,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GAClBA,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GACX,IAAIrB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAItB,GAAO;AACP,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB;AACnC,UAAIoB,IAAKjI,EAAG,MAAMkI,IAAKlI,EAAG,MAAMmI,IAAKnI,EAAG;AACxC,YAAM1F,IAAImL,EAAM,GACVuC,IAAKhI,EAAG,IAAIyF,EAAM,GAAG/G,EAAG;AAC9B,UAAI0J,IAAKpI,EAAG,IAAIwH,GAAIG,CAAE,GAClBU,IAAKrI,EAAG,IAAIyH,GAAIG,CAAE,GAClBxH,IAAKJ,EAAG,IAAI0H,GAAIG,CAAE,GAClBS,KAAKtI,EAAG,IAAIwH,GAAIC,CAAE,GAClBc,IAAKvI,EAAG,IAAI2H,GAAIC,CAAE;AACtB,MAAAU,KAAKtI,EAAG,IAAIsI,IAAIC,CAAE,GAClBA,IAAKvI,EAAG,IAAIoI,GAAIC,CAAE,GAClBC,KAAKtI,EAAG,IAAIsI,IAAIC,CAAE,GAClBA,IAAKvI,EAAG,IAAIwH,GAAIE,CAAE;AAClB,UAAIc,IAAKxI,EAAG,IAAI2H,GAAIE,CAAE;AACtB,aAAAU,IAAKvI,EAAG,IAAIuI,GAAIC,CAAE,GAClBA,IAAKxI,EAAG,IAAIoI,GAAIhI,CAAE,GAClBmI,IAAKvI,EAAG,IAAIuI,GAAIC,CAAE,GAClBA,IAAKxI,EAAG,IAAIyH,GAAIC,CAAE,GAClBO,IAAKjI,EAAG,IAAI4H,GAAIC,CAAE,GAClBW,IAAKxI,EAAG,IAAIwI,GAAIP,CAAE,GAClBA,IAAKjI,EAAG,IAAIqI,GAAIjI,CAAE,GAClBoI,IAAKxI,EAAG,IAAIwI,GAAIP,CAAE,GAClBE,IAAKnI,EAAG,IAAI1F,GAAGiO,CAAE,GACjBN,IAAKjI,EAAG,IAAIgI,GAAI5H,CAAE,GAClB+H,IAAKnI,EAAG,IAAIiI,GAAIE,CAAE,GAClBF,IAAKjI,EAAG,IAAIqI,GAAIF,CAAE,GAClBA,IAAKnI,EAAG,IAAIqI,GAAIF,CAAE,GAClBD,IAAKlI,EAAG,IAAIiI,GAAIE,CAAE,GAClBE,IAAKrI,EAAG,IAAIoI,GAAIA,CAAE,GAClBC,IAAKrI,EAAG,IAAIqI,GAAID,CAAE,GAClBhI,IAAKJ,EAAG,IAAI1F,GAAG8F,CAAE,GACjBmI,IAAKvI,EAAG,IAAIgI,GAAIO,CAAE,GAClBF,IAAKrI,EAAG,IAAIqI,GAAIjI,CAAE,GAClBA,IAAKJ,EAAG,IAAIoI,GAAIhI,CAAE,GAClBA,IAAKJ,EAAG,IAAI1F,GAAG8F,CAAE,GACjBmI,IAAKvI,EAAG,IAAIuI,GAAInI,CAAE,GAClBgI,IAAKpI,EAAG,IAAIqI,GAAIE,CAAE,GAClBL,IAAKlI,EAAG,IAAIkI,GAAIE,CAAE,GAClBA,IAAKpI,EAAG,IAAIwI,GAAID,CAAE,GAClBN,IAAKjI,EAAG,IAAIsI,IAAIL,CAAE,GAClBA,IAAKjI,EAAG,IAAIiI,GAAIG,CAAE,GAClBA,IAAKpI,EAAG,IAAIsI,IAAID,CAAE,GAClBF,IAAKnI,EAAG,IAAIwI,GAAIL,CAAE,GAClBA,IAAKnI,EAAG,IAAImI,GAAIC,CAAE,GACX,IAAItB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA,IACD,SAAStB,GAAO;AACZ,aAAO,KAAK,IAAIA,EAAM,OAAQ,CAAA;AAAA,IACjC;AAAA,IACD,MAAM;AACF,aAAO,KAAK,OAAOC,EAAM,IAAI;AAAA,IAChC;AAAA,IACD,KAAKrL,GAAG;AACJ,aAAOgN,EAAK,WAAW,MAAM9B,GAAkBlL,GAAG,CAAC2I,MAAS;AACxD,cAAM+C,IAAQnH,EAAG,YAAYoE,EAAK,IAAI,CAAClD,MAAMA,EAAE,EAAE,CAAC;AAClD,eAAOkD,EAAK,IAAI,CAAClD,GAAGzG,MAAMyG,EAAE,SAASiG,EAAM1M,CAAC,CAAC,CAAC,EAAE,IAAIqM,EAAM,UAAU;AAAA,MACpF,CAAa;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,eAAerL,GAAG;AACd,YAAMiN,IAAI5B,EAAM;AAChB,UAAIrL,MAAMvB;AACN,eAAOwO;AAEX,UADAtC,EAAS3K,CAAC,GACNA,MAAMtB;AACN,eAAO;AACX,YAAM,EAAE,MAAAsK,EAAM,IAAGgB;AACjB,UAAI,CAAChB;AACD,eAAOgE,EAAK,aAAa,MAAMhN,CAAC;AAEpC,UAAI,EAAE,OAAAkN,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKrE,EAAK,YAAYhJ,CAAC,GAC7CsN,IAAML,GACNM,IAAMN,GACNvH,IAAI;AACR,aAAOyH,IAAK1O,MAAO4O,IAAK5O;AACpB,QAAI0O,IAAKzO,MACL4O,IAAMA,EAAI,IAAI5H,CAAC,IACf2H,IAAK3O,MACL6O,IAAMA,EAAI,IAAI7H,CAAC,IACnBA,IAAIA,EAAE,UACNyH,MAAOzO,GACP2O,MAAO3O;AAEX,aAAIwO,MACAI,IAAMA,EAAI,WACVF,MACAG,IAAMA,EAAI,WACdA,IAAM,IAAIlC,EAAM9G,EAAG,IAAIgJ,EAAI,IAAIvE,EAAK,IAAI,GAAGuE,EAAI,IAAIA,EAAI,EAAE,GAClDD,EAAI,IAAIC,CAAG;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,SAASC,GAAQ;AACb,MAAA7C,EAAS6C,CAAM;AACf,UAAIxN,IAAIwN,GACJtD,GAAOuD;AACX,YAAM,EAAE,MAAAzE,EAAM,IAAGgB;AACjB,UAAIhB,GAAM;AACN,cAAM,EAAE,OAAAkE,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKrE,EAAK,YAAYhJ,CAAC;AACnD,YAAI,EAAE,GAAGsN,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKP,CAAE,GACjC,EAAE,GAAGI,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKN,CAAE;AACrC,QAAAC,IAAMN,EAAK,gBAAgBE,GAAOI,CAAG,GACrCC,IAAMP,EAAK,gBAAgBI,GAAOG,CAAG,GACrCA,IAAM,IAAIlC,EAAM9G,EAAG,IAAIgJ,EAAI,IAAIvE,EAAK,IAAI,GAAGuE,EAAI,IAAIA,EAAI,EAAE,GACzDrD,IAAQoD,EAAI,IAAIC,CAAG,GACnBE,IAAOC,EAAI,IAAIC,CAAG;AAAA,MACrB,OACI;AACD,cAAM,EAAE,GAAAlI,GAAG,GAAAD,EAAC,IAAK,KAAK,KAAKxF,CAAC;AAC5B,QAAAkK,IAAQzE,GACRgI,IAAOjI;AAAA,MACV;AAED,aAAO6F,EAAM,WAAW,CAACnB,GAAOuD,CAAI,CAAC,EAAE,CAAC;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,qBAAqBtJ,GAAGtF,GAAGkD,GAAG;AAC1B,YAAM6L,IAAIvC,EAAM,MACVwC,IAAM,CAAC5J,GAAGpF,MACVA,MAAMJ,MAAOI,MAAMH,KAAO,CAACuF,EAAE,OAAO2J,CAAC,IAAI3J,EAAE,eAAepF,CAAC,IAAIoF,EAAE,SAASpF,CAAC,GAC3E4B,IAAMoN,EAAI,MAAMhP,CAAC,EAAE,IAAIgP,EAAI1J,GAAGpC,CAAC,CAAC;AACtC,aAAOtB,EAAI,QAAQ,SAAYA;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAID,SAASqN,GAAI;AACT,YAAM,EAAE,IAAIlK,GAAG,IAAI,GAAG,IAAImK,EAAG,IAAG,MAC1BtC,IAAM,KAAK;AAGjB,MAAIqC,KAAM,SACNA,IAAKrC,IAAMlH,EAAG,MAAMA,EAAG,IAAIwJ,CAAC;AAChC,YAAMC,IAAKzJ,EAAG,IAAIX,GAAGkK,CAAE,GACjBG,IAAK1J,EAAG,IAAI,GAAGuJ,CAAE,GACjBI,IAAK3J,EAAG,IAAIwJ,GAAGD,CAAE;AACvB,UAAIrC;AACA,eAAO,EAAE,GAAGlH,EAAG,MAAM,GAAGA,EAAG;AAC/B,UAAI,CAACA,EAAG,IAAI2J,GAAI3J,EAAG,GAAG;AAClB,cAAM,IAAI,MAAM,kBAAkB;AACtC,aAAO,EAAE,GAAGyJ,GAAI,GAAGC,EAAE;AAAA,IACxB;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAGE,GAAU,eAAAC,EAAa,IAAKpE;AACvC,UAAImE,MAAazP;AACb,eAAO;AACX,UAAI0P;AACA,eAAOA,EAAc/C,GAAO,IAAI;AACpC,YAAM,IAAI,MAAM,8DAA8D;AAAA,IACjF;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAG8C,GAAU,eAAAE,EAAa,IAAKrE;AACvC,aAAImE,MAAazP,IACN,OACP2P,IACOA,EAAchD,GAAO,IAAI,IAC7B,KAAK,eAAerB,EAAM,CAAC;AAAA,IACrC;AAAA,IACD,WAAWG,IAAe,IAAM;AAC5B,kBAAK,eAAc,GACZF,EAAQoB,GAAO,MAAMlB,CAAY;AAAA,IAC3C;AAAA,IACD,MAAMA,IAAe,IAAM;AACvB,aAAOY,GAAc,KAAK,WAAWZ,CAAY,CAAC;AAAA,IACrD;AAAA,EACJ;AACD,EAAAkB,EAAM,OAAO,IAAIA,EAAMrB,EAAM,IAAIA,EAAM,IAAIzF,EAAG,GAAG,GACjD8G,EAAM,OAAO,IAAIA,EAAM9G,EAAG,MAAMA,EAAG,KAAKA,EAAG,IAAI;AAC/C,QAAM+J,IAAQtE,EAAM,YACdgD,IAAO7F,GAAKkE,GAAOrB,EAAM,OAAO,KAAK,KAAKsE,IAAQ,CAAC,IAAIA,CAAK;AAElE,SAAO;AAAA,IACH,OAAAtE;AAAA,IACA,iBAAiBqB;AAAA,IACjB,wBAAAT;AAAA,IACA,qBAAAL;AAAA,IACA,oBAAAG;AAAA,EACR;AACA;AACA,SAAS6D,GAAa1F,GAAO;AACzB,QAAMxD,IAAOuD,GAAcC,CAAK;AAChCE,SAAAA,GAAkB1D,GAAM;AAAA,IACpB,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,EACrB,GAAO;AAAA,IACC,UAAU;AAAA,IACV,eAAe;AAAA,IACf,MAAM;AAAA,EACd,CAAK,GACM,OAAO,OAAO,EAAE,MAAM,IAAM,GAAGA,EAAI,CAAE;AAChD;AACO,SAASmJ,GAAYC,GAAU;AAClC,QAAMzE,IAAQuE,GAAaE,CAAQ,GAC7B,EAAE,IAAAlK,GAAI,GAAGmK,EAAW,IAAK1E,GACzB2E,IAAgBpK,EAAG,QAAQ,GAC3BqK,IAAkB,IAAIrK,EAAG,QAAQ;AACvC,WAASsK,EAAoBxP,GAAK;AAC9B,WAAOZ,KAAMY,KAAOA,IAAMkF,EAAG;AAAA,EAChC;AACD,WAASuK,EAAKjQ,GAAG;AACb,WAAOoM,EAAQpM,GAAG6P,CAAW;AAAA,EAChC;AACD,WAASK,EAAKlQ,GAAG;AACb,WAAOmQ,GAAWnQ,GAAG6P,CAAW;AAAA,EACnC;AACD,QAAM,EAAE,iBAAiBrD,GAAO,wBAAAT,GAAwB,qBAAAL,GAAqB,oBAAAG,EAAqB,IAAGX,GAAkB;AAAA,IACnH,GAAGC;AAAA,IACH,QAAQlD,GAAGoD,GAAOC,GAAc;AAC5B,YAAMtL,IAAIqL,EAAM,YACVtG,IAAIW,EAAG,QAAQ1F,EAAE,CAAC,GAClBoQ,IAAM7E;AACZ,aAAID,IACO8E,EAAI,WAAW,KAAK,CAAC/E,EAAM,SAAU,IAAG,IAAO,CAAI,CAAC,GAAGtG,CAAC,IAGxDqL,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,GAAGrL,GAAGW,EAAG,QAAQ1F,EAAE,CAAC,CAAC;AAAA,IAE7D;AAAA,IACD,UAAUK,GAAO;AACb,YAAMM,IAAMN,EAAM,QACZgQ,IAAOhQ,EAAM,CAAC,GACdoL,IAAOpL,EAAM,SAAS,CAAC;AAE7B,UAAIM,MAAQmP,MAAkBO,MAAS,KAAQA,MAAS,IAAO;AAC3D,cAAMtL,IAAIoH,GAAmBV,CAAI;AACjC,YAAI,CAACuE,EAAoBjL,CAAC;AACtB,gBAAM,IAAI,MAAM,uBAAuB;AAC3C,cAAMuL,IAAK5E,EAAoB3G,CAAC;AAChC,YAAIgI,IAAIrH,EAAG,KAAK4K,CAAE;AAClB,cAAMC,KAAUxD,IAAIlN,OAASA;AAG7B,gBADmBwQ,IAAO,OAAO,MACfE,MACdxD,IAAIrH,EAAG,IAAIqH,CAAC,IACT,EAAE,GAAAhI,GAAG,GAAAgI;MACf,WACQpM,MAAQoP,KAAmBM,MAAS,GAAM;AAC/C,cAAMtL,IAAIW,EAAG,UAAU+F,EAAK,SAAS,GAAG/F,EAAG,KAAK,CAAC,GAC3CqH,IAAIrH,EAAG,UAAU+F,EAAK,SAAS/F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,eAAO,EAAE,GAAAX,GAAG,GAAAgI;MACf;AAEG,cAAM,IAAI,MAAM,mBAAmBpM,CAAG,0BAA0BmP,CAAa,wBAAwBC,CAAe,qBAAqB;AAAA,IAEhJ;AAAA,EACT,CAAK,GACKS,IAAgB,CAAChQ,MAAQ0L,GAAcuE,GAAmBjQ,GAAK2K,EAAM,WAAW,CAAC;AACvF,WAASuF,EAAsB5L,GAAQ;AACnC,UAAM6L,IAAOd,KAAehQ;AAC5B,WAAOiF,IAAS6L;AAAA,EACnB;AACD,WAASC,EAAWjG,GAAG;AACnB,WAAO+F,EAAsB/F,CAAC,IAAIsF,EAAK,CAACtF,CAAC,IAAIA;AAAA,EAChD;AAED,QAAMkG,IAAS,CAAC3N,GAAG4N,GAAMC,MAAO5E,GAAmBjJ,EAAE,MAAM4N,GAAMC,CAAE,CAAC;AAAA,EAIpE,MAAMC,EAAU;AAAA,IACZ,YAAYrP,GAAGgJ,GAAGsG,GAAU;AACxB,WAAK,IAAItP,GACT,KAAK,IAAIgJ,GACT,KAAK,WAAWsG,GAChB,KAAK,eAAc;AAAA,IACtB;AAAA;AAAA,IAED,OAAO,YAAY3Q,GAAK;AACpB,YAAMmK,IAAIU,EAAM;AAChB,aAAA7K,IAAMgB,EAAY,oBAAoBhB,GAAKmK,IAAI,CAAC,GACzC,IAAIuG,EAAUH,EAAOvQ,GAAK,GAAGmK,CAAC,GAAGoG,EAAOvQ,GAAKmK,GAAG,IAAIA,CAAC,CAAC;AAAA,IAChE;AAAA;AAAA;AAAA,IAGD,OAAO,QAAQnK,GAAK;AAChB,YAAM,EAAE,GAAAqB,GAAG,GAAAgJ,EAAC,IAAKJ,GAAI,MAAMjJ,EAAY,OAAOhB,CAAG,CAAC;AAClD,aAAO,IAAI0Q,EAAUrP,GAAGgJ,CAAC;AAAA,IAC5B;AAAA,IACD,iBAAiB;AAEb,UAAI,CAACkB,EAAmB,KAAK,CAAC;AAC1B,cAAM,IAAI,MAAM,2BAA2B;AAC/C,UAAI,CAACA,EAAmB,KAAK,CAAC;AAC1B,cAAM,IAAI,MAAM,2BAA2B;AAAA,IAClD;AAAA,IACD,eAAeoF,GAAU;AACrB,aAAO,IAAID,EAAU,KAAK,GAAG,KAAK,GAAGC,CAAQ;AAAA,IAChD;AAAA,IACD,iBAAiBC,GAAS;AACtB,YAAM,EAAE,GAAAvP,GAAG,GAAAgJ,GAAG,UAAUwG,EAAG,IAAK,MAC1BlO,IAAImO,EAAc9P,EAAY,WAAW4P,CAAO,CAAC;AACvD,UAAIC,KAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG;AACzC,cAAM,IAAI,MAAM,qBAAqB;AACzC,YAAME,IAAOF,MAAQ,KAAKA,MAAQ,IAAIxP,IAAIwJ,EAAM,IAAIxJ;AACpD,UAAI0P,KAAQ3L,EAAG;AACX,cAAM,IAAI,MAAM,4BAA4B;AAChD,YAAM4L,IAAUH,IAAM,IAAkB,OAAP,MAC3BI,KAAI/E,EAAM,QAAQ8E,IAASd,EAAca,CAAI,CAAC,GAC9CG,KAAKtB,EAAKmB,CAAI,GACdI,KAAKxB,EAAK,CAAChN,IAAIuO,EAAE,GACjBE,KAAKzB,EAAKtF,IAAI6G,EAAE,GAChBlM,KAAIkH,EAAM,KAAK,qBAAqB+E,IAAGE,IAAIC,EAAE;AACnD,UAAI,CAACpM;AACD,cAAM,IAAI,MAAM,mBAAmB;AACvC,aAAAA,GAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,WAAW;AACP,aAAOoL,EAAsB,KAAK,CAAC;AAAA,IACtC;AAAA,IACD,aAAa;AACT,aAAO,KAAK,SAAQ,IAAK,IAAIM,EAAU,KAAK,GAAGf,EAAK,CAAC,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;AAAA,IAClF;AAAA;AAAA,IAED,gBAAgB;AACZ,aAAO0B,GAAc,KAAK,SAAQ,CAAE;AAAA,IACvC;AAAA,IACD,WAAW;AACP,aAAOpH,GAAI,WAAW,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAC,CAAE;AAAA,IACjD;AAAA;AAAA,IAED,oBAAoB;AAChB,aAAOoH,GAAc,KAAK,aAAY,CAAE;AAAA,IAC3C;AAAA,IACD,eAAe;AACX,aAAOnB,EAAc,KAAK,CAAC,IAAIA,EAAc,KAAK,CAAC;AAAA,IACtD;AAAA,EACJ;AACD,QAAMoB,IAAQ;AAAA,IACV,kBAAkB9E,GAAY;AAC1B,UAAI;AACA,eAAAf,EAAuBe,CAAU,GAC1B;AAAA,MACV,QACa;AACV,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,IACD,wBAAwBf;AAAA;AAAA;AAAA;AAAA;AAAA,IAKxB,kBAAkB,MAAM;AACpB,YAAM8F,IAAO1G,EAAM,YAAYzF,EAAG,QAAQ,CAAC,GACrClF,IAAMsR,GAAwBD,GAAMhC,CAAW;AACrD,aAAOY,GAAmBjQ,GAAK2K,EAAM,WAAW;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,WAAWtC,IAAa,GAAGwC,IAAQmB,EAAM,MAAM;AAC3C,aAAAnB,EAAM,eAAexC,CAAU,GAC/BwC,EAAM,SAAS,OAAO,CAAC,CAAC,GACjBA;AAAA,IACV;AAAA,EACT;AAOI,WAAS0G,EAAajF,GAAYxB,IAAe,IAAM;AACnD,WAAOkB,EAAM,eAAeM,CAAU,EAAE,WAAWxB,CAAY;AAAA,EAClE;AAID,WAAS0G,EAAU7V,GAAM;AACrB,UAAMuG,IAAMvG,aAAgB,YACtB+F,IAAM,OAAO/F,KAAS,UACtBwE,KAAO+B,KAAOR,MAAQ/F,EAAK;AACjC,WAAIuG,IACO/B,MAAQmP,KAAiBnP,MAAQoP,IACxC7N,IACOvB,MAAQ,IAAImP,KAAiBnP,MAAQ,IAAIoP,IAChD5T,aAAgBqQ;AAAA,EAGvB;AAWD,WAASyF,EAAgBC,GAAUC,GAAS7G,IAAe,IAAM;AAC7D,QAAI0G,EAAUE,CAAQ;AAClB,YAAM,IAAI,MAAM,+BAA+B;AACnD,QAAI,CAACF,EAAUG,CAAO;AAClB,YAAM,IAAI,MAAM,+BAA+B;AAEnD,WADU3F,EAAM,QAAQ2F,CAAO,EACtB,SAASpG,EAAuBmG,CAAQ,CAAC,EAAE,WAAW5G,CAAY;AAAA,EAC9E;AAKD,QAAM8G,IAAWjH,EAAM,YACnB,SAAU9K,GAAO;AAGb,UAAMG,IAAM2L,GAAmB9L,CAAK,GAC9BgS,IAAQhS,EAAM,SAAS,IAAI8K,EAAM;AACvC,WAAOkH,IAAQ,IAAI7R,KAAO,OAAO6R,CAAK,IAAI7R;AAAA,EACtD,GACU4Q,IAAgBjG,EAAM,iBACxB,SAAU9K,GAAO;AACb,WAAO4P,EAAKmC,EAAS/R,CAAK,CAAC;AAAA,EACvC,GAEUiS,IAAaC,GAAWpH,EAAM,UAAU;AAI9C,WAASqH,EAAWhS,GAAK;AACrB,QAAI,OAAOA,KAAQ;AACf,YAAM,IAAI,MAAM,iBAAiB;AACrC,QAAI,EAAEZ,MAAOY,KAAOA,IAAM8R;AACtB,YAAM,IAAI,MAAM,uBAAuBnH,EAAM,UAAU,EAAE;AAE7D,WAAOsF,GAAmBjQ,GAAK2K,EAAM,WAAW;AAAA,EACnD;AAMD,WAASsH,EAAQvB,GAASpE,GAAYtG,IAAOkM,GAAgB;AACzD,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAAC3P,OAAMA,MAAKyD,CAAI;AAChD,YAAM,IAAI,MAAM,qCAAqC;AACzD,UAAM,EAAE,MAAA2B,GAAM,aAAAwK,EAAa,IAAGxH;AAC9B,QAAI,EAAE,MAAAyH,GAAM,SAAAC,GAAS,cAAcC,EAAG,IAAKtM;AAC3C,IAAIoM,KAAQ,SACRA,IAAO,KACX1B,IAAU5P,EAAY,WAAW4P,CAAO,GACpC2B,MACA3B,IAAU5P,EAAY,qBAAqB6G,EAAK+I,CAAO,CAAC;AAI5D,UAAM6B,KAAQ3B,EAAcF,CAAO,GAC7BrK,KAAIkF,EAAuBe,CAAU,GACrCkG,KAAW,CAACR,EAAW3L,EAAC,GAAG2L,EAAWO,EAAK,CAAC;AAElD,QAAID,KAAO,MAAM;AAEb,YAAMhU,KAAIgU,MAAQ,KAAOH,EAAYjN,EAAG,KAAK,IAAIoN;AACjD,MAAAE,GAAS,KAAK1R,EAAY,gBAAgBxC,IAAG4G,EAAG,KAAK,CAAC;AAAA,IACzD;AACD,UAAMtC,KAAOmI,EAAe,GAAGyH,EAAQ,GACjC9N,KAAI6N;AAEV,aAASE,GAAMC,IAAQ;AAEnB,YAAMnQ,KAAIqP,EAASc,EAAM;AACzB,UAAI,CAACrH,EAAmB9I,EAAC;AACrB;AACJ,YAAMoQ,KAAKjD,EAAKnN,EAAC,GACXkC,KAAIuH,EAAM,KAAK,SAASzJ,EAAC,EAAE,YAC3BpB,IAAIsO,EAAKhL,GAAE,CAAC;AAClB,UAAItD,MAAM/B;AACN;AAIJ,YAAM+K,KAAIsF,EAAKkD,KAAKlD,EAAK/K,KAAIvD,IAAIkF,EAAC,CAAC;AACnC,UAAI8D,OAAM/K;AACN;AACJ,UAAIqR,MAAYhM,GAAE,MAAMtD,IAAI,IAAI,KAAK,OAAOsD,GAAE,IAAIpF,CAAG,GACjDuT,KAAQzI;AACZ,aAAIiI,KAAQlC,EAAsB/F,EAAC,MAC/ByI,KAAQxC,EAAWjG,EAAC,GACpBsG,MAAY,IAET,IAAID,EAAUrP,GAAGyR,IAAOnC,EAAQ;AAAA,IAC1C;AACD,WAAO,EAAE,MAAA7N,IAAM,OAAA6P;EAClB;AACD,QAAMP,IAAiB,EAAE,MAAMvH,EAAM,MAAM,SAAS,MAC9CkI,IAAiB,EAAE,MAAMlI,EAAM,MAAM,SAAS;AAcpD,WAASmI,EAAKpC,GAASqC,GAAS/M,IAAOkM,GAAgB;AACnD,UAAM,EAAE,MAAAtP,GAAM,OAAA6P,EAAO,IAAGR,EAAQvB,GAASqC,GAAS/M,CAAI,GAChDgN,IAAIrI;AAEV,WADasI,GAAkBD,EAAE,KAAK,WAAWA,EAAE,aAAaA,EAAE,IAAI,EAC1DpQ,GAAM6P,CAAK;AAAA,EAC1B;AAED,EAAAzG,EAAM,KAAK,eAAe,CAAC;AAe3B,WAASkH,GAAOC,GAAWzC,GAAS0C,GAAWpN,IAAO6M,GAAgB;;AAClE,UAAMQ,IAAKF;AAGX,QAFAzC,IAAU5P,EAAY,WAAW4P,CAAO,GACxC0C,IAAYtS,EAAY,aAAasS,CAAS,GAC1C,YAAYpN;AACZ,YAAM,IAAI,MAAM,oCAAoC;AACxD,UAAM,EAAE,MAAAoM,GAAM,SAAAC,EAAS,IAAGrM;AAC1B,QAAIsN,GACA1O;AACJ,QAAI;AACA,UAAI,OAAOyO,KAAO,YAAYA,aAAc;AAGxC,YAAI;AACA,UAAAC,IAAO9C,EAAU,QAAQ6C,CAAE;AAAA,QAC9B,SACME,GAAU;AACb,cAAI,EAAEA,aAAoBxJ,GAAI;AAC1B,kBAAMwJ;AACV,UAAAD,IAAO9C,EAAU,YAAY6C,CAAE;AAAA,QAClC;AAAA,eAEI,OAAOA,KAAO,YAAY,OAAOA,EAAG,KAAM,YAAY,OAAOA,EAAG,KAAM,UAAU;AACrF,cAAM,EAAE,GAAAlS,GAAG,GAAAgJ,GAAG,IAAGkJ;AACjB,QAAAC,IAAO,IAAI9C,EAAUrP,GAAGgJ,EAAC;AAAA,MAC5B;AAEG,cAAM,IAAI,MAAM,OAAO;AAE3B,MAAAvF,KAAIoH,EAAM,QAAQoH,CAAS;AAAA,IAC9B,SACMI,GAAO;AACV,UAAIA,EAAM,YAAY;AAClB,cAAM,IAAI,MAAM,gEAAgE;AACpF,aAAO;AAAA,IACV;AACD,QAAIpB,KAAQkB,EAAK,SAAU;AACvB,aAAO;AACX,IAAIjB,MACA3B,IAAU/F,EAAM,KAAK+F,CAAO;AAChC,UAAM,EAAE,GAAAvP,IAAG,GAAAgJ,GAAG,IAAGmJ,GACX7Q,KAAImO,EAAcF,CAAO,GACzB+C,KAAK/D,EAAKvF,EAAC,GACX8G,KAAKxB,EAAKhN,KAAIgR,EAAE,GAChBvC,KAAKzB,EAAKtO,KAAIsS,EAAE,GAChB1C,MAAItV,KAAAuQ,EAAM,KAAK,qBAAqBpH,IAAGqM,IAAIC,EAAE,MAAzC,gBAAAzV,GAA4C;AACtD,WAAKsV,KAEKtB,EAAKsB,GAAE,CAAC,MACL5P,KAFF;AAAA,EAGd;AACD,SAAO;AAAA,IACH,OAAAwJ;AAAA,IACA,cAAA4G;AAAA,IACA,iBAAAE;AAAA,IACA,MAAAqB;AAAA,IACA,QAAAI;AAAA,IACA,iBAAiBlH;AAAA,IACjB,WAAAwE;AAAA,IACA,OAAAY;AAAA,EACR;AACA;ACn6BA,IAAIsC,KAAY,OAAO,gBACnBC,KAAW,CAACC,GAAQC,MAAQ;AAC9B,WAASC,KAAQD;AACf,IAAAH,GAAUE,GAAQE,GAAM,EAAE,KAAKD,EAAIC,CAAI,GAAG,YAAY,GAAI,CAAE;AAChE,GAGIC,KAAc,CAAA;AAClBJ,GAASI,IAAa;AAAA,EACpB,YAAY,MAAMC;AAAA,EAClB,YAAY,MAAMC;AAAA,EAClB,aAAa,MAAMC;AAAA,EACnB,oBAAoB,MAAMC;AAAA,EAC1B,qBAAqB,MAAMC;AAAA,EAC3B,sBAAsB,MAAMC;AAAA,EAC5B,WAAW,MAAMC;AAAA,EACjB,WAAW,MAAMC;AAAA,EACjB,aAAa,MAAMC;AAAA,EACnB,mBAAmB,MAAMC;AAAA,EACzB,oBAAoB,MAAMC;AAAA,EAC1B,SAAS,MAAMC;AAAA,EACf,UAAU,MAAMC;AAAA,EAChB,4BAA4B,MAAMC;AAAA,EAClC,MAAM,MAAMC;AAAA,EACZ,YAAY,MAAMC;AAAA,EAClB,aAAa,MAAMC;AAAA,EACnB,SAAS,MAAMC;AAAA,EACf,qBAAqB,MAAMC;AAAA,EAC3B,WAAW,MAAMC;AAAA,EACjB,iBAAiB,MAAMC;AACzB,CAAC;AAMD,IAAIC,KAAO,OAAO,CAAC,GACfC,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC;AACN,OAAO,CAAC;AAGpB,SAASC,GAAcC,GAAQ;AAC7B,MAAIhT,IAAIgT,EAAO,SAAS,EAAE;AAC1B,MAAIhT,EAAE,CAAC,MAAM;AACX,IAAIA,EAAE,SAAS,MAAM,IACnBA,IAAI,MAAMA,IACFA,EAAE,MAAM,QAAQ,MACxBA,IAAI,OAAOA;AAAA,OACR;AACL,IAAAA,IAAIA,EAAE,UAAU,CAAC;AACjB,QAAItC,IAAMsC,EAAE;AACZ,IAAItC,IAAM,MAAM,IACdA,KAAO,IACCsC,EAAE,MAAM,QAAQ,MACxBtC,KAAO;AACT,QAAIuV,IAAa;AACjB,aAAS/V,IAAI,GAAGA,IAAIQ,GAAKR;AACvB,MAAA+V,KAAc;AAGhB,IAAAjT,MAFWkT,EAAkBD,CAAU,IAClBD,KAAUH,IACpB,SAAS,EAAE,EAAE,QAAQ,MAAM,EAAE;AAAA,EACzC;AACD,SAAO7S;AACT;AACA,IAAImT,KAAa,MAAM;AAAA,EACrB,YAAYC,IAAM,MAAMC,IAAI,MAAM7L,IAAI,MAAMvK,IAAI,IAAI;AAClD,SAAK,MAAMmW,GACX,KAAK,IAAIC,GACT,KAAK,IAAI7L,GACT,KAAK,IAAIvK;AAAA,EACV;AAAA,EACD,gBAAgB;AACd,WAAK,KAAK,QACR,KAAK,IAAI,KAAK,YACd,KAAK,IAAI,KAAK,aACd,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,IAE7B,KAAK;AAAA,EACb;AAAA,EACD,YAAY;AACV,UAAMiB,IAAI,KAAK,EAAE,SAAS;AAC1B,QAAIoV,IAAOpV,EAAE,SAAS,EAAE;AAGxB,WAFIoV,EAAK,SAAS,MAAM,MACtBA,IAAO,MAAMA,IACXpV,IAAI,MACCoV,KAEM,MAAMA,EAAK,SAAS,GACrB,SAAS,EAAE,IAAIA;AAAA,EAE9B;AAAA,EACD,WAAW;AACT,WAAO;AAAA,EACR;AACH,GACIC,KAAa,cAAcJ,GAAW;AAAA,EACxC,YAAYH,GAAQ;AAClB,aACA,KAAK,IAAI,MACLA,MACF,KAAK,IAAID,GAAcC,CAAM;AAAA,EAChC;AAAA,EACD,WAAW;AACT,WAAO,KAAK;AAAA,EACb;AACH,GACIQ,KAAc,cAAcL,GAAW;AAAA,EACzC,YAAYM,GAAW;AACrB;AAGF,IAAAC,EAAA,WAAI;AAFF,SAAK,YAAYD;AAAA,EAClB;AAAA,EAED,WAAW;AACT,gBAAK,IAAI,KAAK,UAAU,IAAI,CAACE,MAAeA,EAAW,cAAe,CAAA,EAAE,KAAK,EAAE,GACxE,KAAK;AAAA,EACb;AACH;AACA,SAASC,GAAU3U,GAAK4U,GAAO;AAC7B,SAAI,CAAC5U,EAAI4U,IAAQ,CAAC,IAAI,IACb,IACF,CAAC5U,EAAI,UAAU4U,IAAQ,GAAGA,IAAQ,CAAC,IAAI,MAAM;AACtD;AACA,SAASC,GAAK7U,GAAK4U,GAAO;AACxB,QAAMnW,IAAMkW,GAAU3U,GAAK4U,CAAK,GAC1BrM,IAAIvI,EAAI,UAAU4U,IAAQ,GAAGA,IAAQ,IAAInW,IAAM,CAAC;AACtD,SAAK8J,IAGE,EADQ,CAACA,EAAE,CAAC,IAAI,IAAI0L,EAAkB1L,CAAC,IAAI0L,EAAkB1L,EAAE,UAAU,CAAC,CAAC,GACnE,aAFN;AAGX;AACA,SAASuM,GAAY9U,GAAK4U,GAAO;AAC/B,QAAMnW,IAAMkW,GAAU3U,GAAK4U,CAAK;AAChC,SAAOA,KAASnW,IAAM,KAAK;AAC7B;AACA,SAASsW,GAAUtV,GAAGgJ,GAAG;AACvB,QAAMuM,IAAO,IAAIV,GAAW7U,CAAC,GACvBwV,IAAO,IAAIX,GAAW7L,CAAC;AAE7B,SADe,IAAI8L,GAAY,CAACS,GAAMC,CAAI,CAAC,EAC7B;AAChB;AACA,SAASC,GAAUnZ,GAAO;AACxB,QAAM6Y,IAAQE,GAAY/Y,GAAO,CAAC,GAC5BoZ,IAAUL,GAAY/Y,GAAO6Y,CAAK,GAClCQ,IAAKP,GAAK9Y,GAAO6Y,CAAK,GACtBS,IAAKtZ,EAAM,OAAOoZ,GAASC,IAAK,CAAC,GACjCE,IAAYH,IAAUE,EAAG,QACzBE,IAAUT,GAAY/Y,GAAOuZ,CAAS,GACtCE,IAAKX,GAAK9Y,GAAOuZ,CAAS,GAC1BG,IAAK1Z,EAAM,UAAUwZ,GAASA,IAAUC,IAAK,CAAC,GAC9C/V,IAAIwU,EAAkBoB,CAAE,GACxB5M,IAAIwL,EAAkBwB,CAAE;AAC9B,SAAO,EAAE,GAAAhW,GAAG,GAAAgJ;AACd;AAUA,IAAIiN,KAAyB,OACzBC,KAAW,IAAI,WAAW,CAAC,GAC3BC;AACJ,eAAetC,KAAc;AAC3B,MAAI,YAAY,YAAY;AAC1B,IAAAsC,KAAc,WAAW;AACzB;AAAA,EACD;AACD,MAAI,EAAAD,GAAS,SAASD,KAAyB;AAE/C,QAAI,QAAQ,cAAc,qBAAqB,WAAW;AACxD,MAAAC,KAAW,MAAM,IAAI,QAAQ,CAAClW,MAAM;AAClC,WAAG,gBAAgB;AAAA,UACjB,QAAQiW;AAAA,UACR,QAAQ9c,GAAK;AACX,YAAA6G,EAAE,IAAI,WAAW7G,EAAI,YAAY,CAAC;AAAA,UACnC;AAAA,QACT,CAAO;AAAA,MACP,CAAK;AAAA;AAED,UAAI;AACF,QAAI,WAAW,SACbgd,KAAc,WAAW,SAMzBA,MAJe,MAAM;AAAA;AAAA,UAEnB;AAAA,QACV,GAC6B;AAEvB,cAAMlX,IAAQ,IAAI,WAAWgX,EAAsB;AACnD,QAAAE,GAAY,gBAAgBlX,CAAK,GACjCiX,KAAWjX;AAAA,MACZ,QAAe;AACd,cAAM,IAAI,MAAM,6BAA6B;AAAA,MAC9C;AAEL;AACA4U;AACA,SAASuC,GAAYC,GAAQ;AAC3B,MAAIH,GAAS,SAASG,GAAQ;AAC5B,UAAMC,IAAOJ,GAAS,MAAM,GAAGG,CAAM;AACrC,WAAAH,KAAWA,GAAS,MAAMG,CAAM,GAChCxC,MACOyC;AAAA,EACX;AACI,UAAM,IAAI,MAAM,uGAAuG;AAE3H;AACA,SAAStF,GAAYqF,IAAS,GAAG;AAC/B,QAAMpX,IAAQ,IAAI,WAAWoX,CAAM;AACnC,SAAIF,KACKA,GAAY,gBAAgBlX,CAAK,IAEzBmX,GAAYC,CAAM;AAGrC;AAGA,IAAIjY,KAAM,CAACC,MAAMA,aAAa,YAC1BkY,KAAa,CAACxV,MAAQ,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU,GAC7E+E,KAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AACtE,IAAI,CAACA;AACH,QAAM,IAAI,MAAM,6CAA6C;AAC/D,IAAIxH,KAAQ,MAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACC,GAAGC,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AACjF,SAASC,GAAWC,GAAO;AACzB,MAAI,CAACN,GAAIM,CAAK;AACZ,UAAM,IAAI,MAAM,qBAAqB;AACvC,MAAIC,IAAM;AACV,WAASH,IAAI,GAAGA,IAAIE,EAAM,QAAQF;AAChC,IAAAG,KAAOL,GAAMI,EAAMF,CAAC,CAAC;AAEvB,SAAOG;AACT;AACA,SAAS2B,GAAYC,GAAK;AACxB,MAAI,OAAOA,KAAQ;AACjB,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AAClE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACrD;AACA,SAASkJ,GAAQnQ,GAAM;AAGrB,MAFI,OAAOA,KAAS,aAClBA,IAAOgH,GAAYhH,CAAI,IACrB,CAAC8E,GAAI9E,CAAI;AACX,UAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE;AAC3D,SAAOA;AACT;AACA,IAAIkd,KAAO,MAAM;AAAA,EACf,QAAQ;AACN,WAAO,KAAK;EACb;AACH;AACA,SAASC,GAAgBC,GAAU;AACjC,QAAMC,IAAQ,CAACla,MAAQia,EAAU,EAAC,OAAOjN,GAAQhN,CAAG,CAAC,EAAE,UACjDma,IAAOF;AACb,SAAAC,EAAM,YAAYC,EAAK,WACvBD,EAAM,WAAWC,EAAK,UACtBD,EAAM,SAAS,MAAMD,KACdC;AACT;AAGA,IAAIE,KAAQ,CAACC,GAAGC,GAAGlF,MAAMiF,IAAIC,IAAID,IAAIjF,IAAIkF,IAAIlF,GACzCmF,KAAQ,CAACF,GAAGC,GAAGlF,MAAMiF,IAAIC,IAAIlF,GAC7BoF,KAAQ,CAACH,GAAGC,GAAGlF,MAAMiF,IAAIC,IAAI,CAACD,IAAIjF;AACtC,SAASqF,GAAaC,GAAMC,GAAYvd,GAAOwd,GAAO;AACpD,MAAI,OAAOF,EAAK,gBAAiB;AAC/B,WAAOA,EAAK,aAAaC,GAAYvd,GAAOwd,CAAK;AACnD,QAAMC,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAO3d,KAASyd,IAAOC,CAAQ,GACpCE,IAAK,OAAO5d,IAAQ0d,CAAQ,GAC5BjW,IAAI+V,IAAQ,IAAI,GAChBvO,IAAIuO,IAAQ,IAAI;AACtB,EAAAF,EAAK,UAAUC,IAAa9V,GAAGkW,GAAIH,CAAK,GACxCF,EAAK,UAAUC,IAAatO,GAAG2O,GAAIJ,CAAK;AAC1C;AACA,SAASK,EAAK1N,GAAI,GAAG;AACnB,QAAMhB,IAAI,IAAI;AACd,SAAOgB,KAAMhB,IAAIgB,MAAO,KAAKhB;AAC/B;AACA,SAAS2O,GAAGC,GAAG;AACb,SAAOA,IAAIF,EAAKE,GAAG,CAAC,IAAIF,EAAKE,GAAG,EAAE;AACpC;AACA,SAASC,GAAGD,GAAG;AACb,SAAOA,IAAIF,EAAKE,GAAG,EAAE,IAAIF,EAAKE,GAAG,EAAE;AACrC;AACA,IAAIE,KAAO,cAActB,GAAK;AAAA,EAC5B,YAAYuB,GAAUC,GAAWC,GAAWZ,GAAO;AACjD;AAQF,IAAArC,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,kBAAW;AACX,IAAAA,EAAA,gBAAS;AACT,IAAAA,EAAA,aAAM;AACN,IAAAA,EAAA,mBAAY;AAZV,SAAK,WAAW+C,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAOZ,GACZ,KAAK,SAAS,IAAI,WAAWU,CAAQ,GACrC,KAAK,OAAOxB,GAAW,KAAK,MAAM;AAAA,EACnC;AAAA,EAOD,OAAOjd,GAAM;AACX,UAAM,EAAE,MAAA6d,GAAM,QAAAe,GAAQ,UAAAH,EAAQ,IAAK;AACnC,IAAAze,IAAOmQ,GAAQnQ,CAAI;AACnB,UAAM0F,IAAM1F,EAAK;AACjB,aAASoH,IAAM,GAAGA,IAAM1B,KAAO;AAC7B,YAAMmZ,IAAO,KAAK,IAAIJ,IAAW,KAAK,KAAK/Y,IAAM0B,CAAG;AACpD,UAAIyX,MAASJ,GAAU;AACrB,cAAMK,IAAW7B,GAAWjd,CAAI;AAChC,eAAOye,KAAY/Y,IAAM0B,GAAKA,KAAOqX;AACnC,eAAK,QAAQK,GAAU1X,CAAG;AAC5B;AAAA,MACD;AACD,MAAAwX,EAAO,IAAI5e,EAAK,SAASoH,GAAKA,IAAMyX,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZzX,KAAOyX,GACH,KAAK,QAAQJ,MACf,KAAK,QAAQZ,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAEd;AACD,gBAAK,UAAU7d,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACR;AAAA,EACD,WAAWqI,GAAK;AACd,SAAK,WAAW;AAChB,UAAM,EAAE,QAAAuW,GAAQ,MAAAf,GAAM,UAAAY,GAAU,MAAMV,EAAO,IAAG;AAChD,QAAI,EAAE,KAAA3W,EAAK,IAAG;AACd,IAAAwX,EAAOxX,GAAK,IAAI,KAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,GAC5B,KAAK,YAAYqX,IAAWrX,MAC9B,KAAK,QAAQyW,GAAM,CAAC,GACpBzW,IAAM;AAER,aAASlC,IAAIkC,GAAKlC,IAAIuZ,GAAUvZ;AAC9B,MAAA0Z,EAAO1Z,CAAC,IAAI;AACd,IAAA0Y,GAAaC,GAAMY,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGV,CAAK,GAC/D,KAAK,QAAQF,GAAM,CAAC;AACpB,UAAMkB,IAAQ9B,GAAW5U,CAAG,GACtB3C,IAAM,KAAK;AACjB,QAAIA,IAAM;AACR,YAAM,IAAI,MAAM,6CAA6C;AAC/D,UAAMsZ,IAAStZ,IAAM,GACfuZ,IAAQ,KAAK;AACnB,QAAID,IAASC,EAAM;AACjB,YAAM,IAAI,MAAM,oCAAoC;AACtD,aAAS/Z,IAAI,GAAGA,IAAI8Z,GAAQ9Z;AAC1B,MAAA6Z,EAAM,UAAU,IAAI7Z,GAAG+Z,EAAM/Z,CAAC,GAAG6Y,CAAK;AAAA,EACzC;AAAA,EACD,SAAS;AACP,UAAM,EAAE,QAAAa,GAAQ,WAAAF,EAAW,IAAG;AAC9B,SAAK,WAAWE,CAAM;AACtB,UAAM/e,IAAM+e,EAAO,MAAM,GAAGF,CAAS;AACrC,gBAAK,QAAO,GACL7e;AAAA,EACR;AAAA,EACD,WAAWiW,GAAI;AACb,IAAAA,UAAO,IAAI,KAAK,gBAChBA,EAAG,IAAI,GAAG,KAAK,IAAK,CAAA;AACpB,UAAM,EAAE,UAAA2I,GAAU,QAAAG,GAAQ,QAAA7B,GAAQ,UAAAmC,GAAU,WAAAC,GAAW,KAAA/X,EAAK,IAAG;AAC/D,WAAA0O,EAAG,SAASiH,GACZjH,EAAG,MAAM1O,GACT0O,EAAG,WAAWoJ,GACdpJ,EAAG,YAAYqJ,GACXpC,IAAS0B,KACX3I,EAAG,OAAO,IAAI8I,CAAM,GACf9I;AAAA,EACR;AACH,GACIsJ,KAAK,IAAI,YAAY,CAAC,YAAY,YAAY,WAAW,YAAY,YAAY,WAAW,YAAY,UAAU,CAAC,GACnHC,IAAQ,IAAI,YAAY,EAAE,GAC1BC,KAAQ,IAAI,YAAY,EAAE,GAC1BC,KAAK,YACLC,KAAK,YACLC,KAAM,cAAcjB,GAAK;AAAA,EAS3B,cAAc;AACZ,UAAM,IAAI,IAAI,GAAG,EAAK;AATxB,IAAA9C,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AACZ,IAAA1D,EAAA,WAAI0D,GAAG,CAAC,IAAI;AAAA,EAGX;AAAA,EACD,MAAM;AACJ,UAAM,EAAE,GAAA5B,GAAG,GAAAC,GAAG,GAAAlF,GAAG,GAAAmH,GAAG,GAAAnQ,GAAG,GAAAoQ,GAAG,GAAA7L,GAAG,GAAA8L,EAAG,IAAG;AACnC,WAAO,CAACpC,GAAGC,GAAGlF,GAAGmH,GAAGnQ,GAAGoQ,GAAG7L,GAAG8L,CAAC;AAAA,EAC/B;AAAA,EACD,IAAIpC,GAAGC,GAAGlF,GAAGmH,GAAGnQ,GAAGoQ,GAAG7L,GAAG8L,GAAG;AAC1B,SAAK,IAAIpC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIlF,IAAI,GACb,KAAK,IAAImH,IAAI,GACb,KAAK,IAAInQ,IAAI,GACb,KAAK,IAAIoQ,IAAI,GACb,KAAK,IAAI7L,IAAI,GACb,KAAK,IAAI8L,IAAI;AAAA,EACd;AAAA,EACD,QAAQ/B,GAAMxP,GAAQ;AACpB,aAASnJ,IAAI,GAAGA,IAAI,IAAIA,KAAKmJ,KAAU;AACrC,MAAAgR,EAAMna,CAAC,IAAI2Y,EAAK,UAAUxP,GAAQ,EAAK;AACzC,aAASnJ,IAAI,IAAIA,IAAI,IAAIA;AACvB,MAAAma,EAAMna,CAAC,IAAIqZ,GAAGc,EAAMna,IAAI,EAAE,IAAIma,EAAMna,IAAI,CAAC,IAAIkZ,EAAKiB,EAAMna,IAAI,CAAC,GAAG,EAAE,CAAC,IAAIkZ,EAAKiB,EAAMna,IAAI,EAAE,GAAG,CAAC,IAAIma,EAAMna,IAAI,CAAC;AAE7G,aAASA,IAAI,GAAGA,IAAI,IAAIA;AACtB,MAAAoa,GAAMpa,CAAC,IAAIma,EAAMna,CAAC,IAAIma,EAAMna,IAAI,CAAC;AAEnC,QAAI,EAAE,GAAAsY,GAAG,GAAAC,GAAG,GAAAlF,GAAG,GAAAmH,GAAG,GAAAnQ,GAAG,GAAAoQ,GAAG,GAAA7L,GAAG,GAAA8L,EAAG,IAAG;AACjC,aAASha,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,UAAIia,IAAQja,KAAK,KAAKA,KAAK,IACvBka,IAAID,IAAQN,KAAKC,IACjBO,IAAM3B,EAAKA,EAAKZ,GAAG,EAAE,IAAIjO,IAAI6O,EAAK0B,GAAGla,CAAC,GAAG,CAAC,GAC1Coa,IAAMD,IAAM3B,EAAKZ,GAAG,EAAE,GACtByC,KAAOJ,IAAQnC,GAAMF,GAAGC,GAAGlF,CAAC,IAAIgF,GAAMC,GAAGC,GAAGlF,CAAC,KAAKmH,IAAIM,IAAMV,GAAM1Z,CAAC,IAAI,GACvEsa,KAAOL,IAAQnC,GAAMnO,GAAGoQ,GAAG7L,CAAC,IAAI6J,GAAMpO,GAAGoQ,GAAG7L,CAAC,KAAK8L,IAAIG,IAAMV,EAAMzZ,CAAC,IAAI;AAC3E,MAAA8Z,IAAInH,GACJA,IAAI6F,EAAKX,GAAG,CAAC,GACbA,IAAID,GACJA,IAAIyC,GACJL,IAAI9L,GACJA,IAAIsK,EAAKuB,GAAG,EAAE,GACdA,IAAIpQ,GACJA,IAAI8O,GAAG6B,CAAG;AAAA,IACX;AACD,IAAA1C,IAAIA,IAAI,KAAK,IAAI,GACjBC,IAAIA,IAAI,KAAK,IAAI,GACjBlF,IAAIA,IAAI,KAAK,IAAI,GACjBmH,IAAIA,IAAI,KAAK,IAAI,GACjBnQ,IAAIA,IAAI,KAAK,IAAI,GACjBoQ,IAAIA,IAAI,KAAK,IAAI,GACjB7L,IAAIA,IAAI,KAAK,IAAI,GACjB8L,IAAIA,IAAI,KAAK,IAAI,GACjB,KAAK,IAAIpC,GAAGC,GAAGlF,GAAGmH,GAAGnQ,GAAGoQ,GAAG7L,GAAG8L,CAAC;AAAA,EAChC;AAAA,EACD,aAAa;AACX,IAAAP,EAAM,KAAK,CAAC;AAAA,EACb;AAAA,EACD,UAAU;AACR,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B,KAAK,OAAO,KAAK,CAAC;AAAA,EACnB;AACH,GACIc,KAAMhD,GAAgB,MAAM,IAAIsC,GAAK,CAAA,GAGrCW,KAAO,cAAclD,GAAK;AAAA,EAO5B,YAAYhQ,GAAMmT,GAAM;AACtB;AAPF,IAAA3E,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,kBAAW;AACX,IAAAA,EAAA,mBAAY;AAGV,UAAMtc,IAAM+Q,GAAQkQ,CAAI;AAExB,QADA,KAAK,QAAQnT,EAAK,UACd,OAAO,KAAK,MAAM,UAAW;AAC/B,YAAM,IAAI,MAAM,qDAAqD;AACvE,SAAK,WAAW,KAAK,MAAM,UAC3B,KAAK,YAAY,KAAK,MAAM;AAC5B,UAAMuR,IAAW,KAAK,UAChB7X,IAAM,IAAI,WAAW6X,CAAQ;AACnC,IAAA7X,EAAI,IAAIxH,EAAI,SAASqf,IAAWvR,EAAK,OAAQ,EAAC,OAAO9N,CAAG,EAAE,OAAQ,IAAGA,CAAG;AACxE,aAAS8F,IAAI,GAAGA,IAAI0B,EAAI,QAAQ1B;AAC9B,MAAA0B,EAAI1B,CAAC,KAAK;AACZ,SAAK,MAAM,OAAO0B,CAAG,GACrB,KAAK,QAAQsG,EAAK;AAClB,aAAShI,IAAI,GAAGA,IAAI0B,EAAI,QAAQ1B;AAC9B,MAAA0B,EAAI1B,CAAC,KAAK;AACZ,SAAK,MAAM,OAAO0B,CAAG,GACrBA,EAAI,KAAK,CAAC;AAAA,EACX;AAAA,EACD,OAAO0Z,GAAK;AACV,gBAAK,MAAM,OAAOA,CAAG,GACd;AAAA,EACR;AAAA,EACD,WAAWjY,GAAK;AACd,SAAK,WAAW,IAChB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,MAAM,OAAOA,CAAG,GACrB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,QAAO;AAAA,EACb;AAAA,EACD,SAAS;AACP,UAAMA,IAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,gBAAK,WAAWA,CAAG,GACZA;AAAA,EACR;AAAA,EACD,WAAWyN,GAAI;AACb,IAAAA,UAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,UAAM,EAAE,OAAAyK,GAAO,OAAAC,GAAO,UAAAtB,GAAU,WAAAC,GAAW,UAAAV,GAAU,WAAAC,EAAW,IAAG;AACnE,WAAA5I,IAAKA,GACLA,EAAG,WAAWoJ,GACdpJ,EAAG,YAAYqJ,GACfrJ,EAAG,WAAW2I,GACd3I,EAAG,YAAY4I,GACf5I,EAAG,QAAQyK,EAAM,WAAWzK,EAAG,KAAK,GACpCA,EAAG,QAAQ0K,EAAM,WAAW1K,EAAG,KAAK,GAC7BA;AAAA,EACR;AAAA,EACD,UAAU;AACR,SAAK,YAAY,IACjB,KAAK,MAAM,WACX,KAAK,MAAM;EACZ;AACH,GACI2K,KAAO,CAACvT,GAAM9N,GAAKa,MAAY,IAAImgB,GAAKlT,GAAM9N,CAAG,EAAE,OAAOa,CAAO,EAAE,OAAM;AAC7EwgB,GAAK,SAAS,CAACvT,GAAM9N,MAAQ,IAAIghB,GAAKlT,GAAM9N,CAAG;AAI/C,IAAIshB,KAAQpU,GAAM,OAAO,gFAAgF,CAAC,GACtGqU,IAAWjM,GAAY;AAAA,EACzB,GAAG,OAAO,gFAAgF;AAAA,EAC1F,GAAG,OAAO,+EAA+E;AAAA,EACzF,IAAIgM;AAAA,EACJ,GAAG7F;AAAA,EACH,GAAG,OAAO,gFAAgF;AAAA,EAC1F,IAAI,OAAO,+EAA+E;AAAA,EAC1F,IAAI,OAAO,+EAA+E;AAAA,EAC1F,MAAMsF;AAAA,EACN,MAAM,CAAC/gB,MAAQwhB,MAASH,GAAKN,IAAK/gB,GAAKoH,EAAY,GAAGoa,CAAI,CAAC;AAAA,EAC3D,aAAAlJ;AACF,CAAC,GACGrM,IAAQiB,GAAM,OAAOqU,EAAS,MAAM,CAAC,CAAC;AAI1C,SAAS1G,GAAmBhT,GAAK;AAC/B,QAAM4K,IAAa5K,IAAM4Z,GAAuBtX,EAAI,OAAOtC,CAAG,GAAG4T,EAAG,IAAIA,IAAK,EAAE,IAAI8F,EAAS,MAAM,iBAAgB,GAC5GhI,IAAYgI,EAAS,aAAa9O,GAAY,EAAK,GACnDiP,IAAUtG,EAAQuG,GAAkBlP,CAAU,GAAG,EAAE,GACnDmP,IAASxG,EAAQuG,GAAkBpI,CAAS,GAAG,EAAE;AACvD,SAAO,EAAE,YAAYmI,GAAS,WAAWE,EAAM;AACjD;AACA,SAASpH,GAAqBlK,GAAG;AAC/B,MAAIA,EAAE,WAAW;AACf,UAAM,IAAI,MAAM,gCAAgC;AAClD,QAAMhK,KAAOgK,EAAE,SAAS,KAAK,GACvBuR,IAAOvR,EAAE,UAAU,GAAG,IAAIhK,CAAG,GAC7BoM,IAAIoP,EAAmBxR,EAAE,UAAUhK,IAAM,GAAGA,IAAMA,IAAM,CAAC,CAAC;AAChE,MAAI2Q,IAAS;AACb,SAAI9M,EAAIuI,GAAGgJ,EAAG,MAAMF,OAClBvE,IAAS,OACJA,IAAS4K;AAClB;AACA,SAASvG,GAAU1X,GAAO;AACxB,EAAAA,IAAQ,mBAAmB,mBAAmBA,CAAK,CAAC;AACpD,QAAM+Z,IAAS/Z,EAAM,QACfme,IAAQ,IAAI,aAAapE,MAAW,KAAK,CAAC;AAChD,WAAS7X,IAAI,GAAGA,IAAI6X,GAAQ7X;AAC1B,IAAAic,EAAMjc,MAAM,CAAC,MAAMlC,EAAM,WAAWkC,CAAC,IAAI,QAAQ,KAAKA,IAAI,IAAI;AAEhE,QAAMkc,IAAW,CAAA;AACjB,WAASlc,IAAI,GAAGA,IAAI6X,GAAQ7X,KAAK;AAC/B,UAAMmc,IAAOF,EAAMjc,MAAM,CAAC,MAAM,KAAKA,IAAI,IAAI,IAAI;AACjD,IAAAkc,EAAS,MAAMC,MAAS,GAAG,SAAS,EAAE,CAAC,GACvCD,EAAS,MAAMC,IAAO,IAAI,SAAS,EAAE,CAAC;AAAA,EACvC;AACD,SAAOD,EAAS,KAAK,EAAE;AACzB;AACA,SAAS5G,EAAQxX,GAAOuC,GAAK;AAC3B,SAAIvC,EAAM,UAAUuC,IACXvC,IACF,IAAI,MAAMuC,IAAMvC,EAAM,SAAS,CAAC,EAAE,KAAK,GAAG,IAAIA;AACvD;AACA,SAASwW,GAAW/R,GAAK;AACvB,SAAOA,EAAI,IAAI,CAACvG,MAAS;AACvB,UAAMmE,IAAMnE,EAAK,SAAS,EAAE;AAC5B,WAAOmE,EAAI,WAAW,IAAI,MAAMA,IAAMA;AAAA,EAC1C,CAAG,EAAE,KAAK,EAAE;AACZ;AACA,SAASoU,GAAYhS,GAAK;AACxB,QAAMR,IAAM,CAAA;AACZ,WAAS/B,IAAI,GAAGQ,IAAM+B,EAAI,QAAQvC,IAAIQ,GAAKR;AACzC,IAAIuC,EAAIvC,CAAC,KAAK,OAAOuC,EAAIvC,CAAC,KAAK,OAC7B+B,EAAI,KAAK,OAAO,gBAAgBQ,EAAIvC,CAAC,IAAI,MAAM,QAAQuC,EAAIvC,IAAI,CAAC,IAAI,OAAO,QAAQuC,EAAIvC,IAAI,CAAC,IAAI,OAAO,MAAMuC,EAAIvC,IAAI,CAAC,IAAI,GAAG,CAAC,GAC9HA,KAAK,KACIuC,EAAIvC,CAAC,KAAK,OAAOuC,EAAIvC,CAAC,KAAK,OACpC+B,EAAI,KAAK,OAAO,gBAAgBQ,EAAIvC,CAAC,IAAI,OAAO,QAAQuC,EAAIvC,IAAI,CAAC,IAAI,OAAO,MAAMuC,EAAIvC,IAAI,CAAC,IAAI,GAAG,CAAC,GACnGA,KAAK,KACIuC,EAAIvC,CAAC,KAAK,OAAOuC,EAAIvC,CAAC,KAAK,OACpC+B,EAAI,KAAK,OAAO,gBAAgBQ,EAAIvC,CAAC,IAAI,OAAO,MAAMuC,EAAIvC,IAAI,CAAC,IAAI,GAAG,CAAC,GACvEA,OAEA+B,EAAI,KAAK,OAAO,cAAcQ,EAAIvC,CAAC,CAAC,CAAC;AAGzC,SAAO+B,EAAI,KAAK,EAAE;AACpB;AACA,SAASqT,EAAWgH,GAAQ;AAC1B,MAAIC,IAAeD,EAAO;AAC1B,EAAIC,IAAe,MAAM,MACvBD,IAAS9G,EAAQ8G,GAAQC,IAAe,CAAC,IAE3CA,IAAeD,EAAO;AACtB,QAAME,IAAaD,IAAe,GAC5BJ,IAAQ,IAAI,WAAWK,CAAU;AACvC,WAAStc,IAAI,GAAGA,IAAIsc,GAAYtc;AAC9B,IAAAic,EAAMjc,CAAC,IAAI,SAASoc,EAAO,UAAUpc,IAAI,GAAGA,IAAI,IAAI,CAAC,GAAG,EAAE;AAE5D,SAAOic;AACT;AACA,SAASxG,GAAgBhC,GAAW;AAClC,QAAMvI,IAAQuQ,EAAS,gBAAgB,QAAQhI,CAAS;AACxD,MAAI,CAACvI;AACH,WAAO;AACT,MAAI;AACF,WAAAA,EAAM,eAAc,GACb;AAAA,EACR,QAAe;AACd,WAAO;AAAA,EACR;AACH;AACA,SAASuJ,GAAoB8H,GAAYC,GAAY;AACnD,QAAMC,IAAShB,EAAS,gBAAgB,QAAQc,CAAU;AAC1D,MAAI,CAACE;AACH,WAAO;AACT,QAAMC,IAASjB,EAAS,gBAAgB,QAAQe,CAAU;AAC1D,SAAKE,IAEED,EAAO,OAAOC,CAAM,IADlB;AAEX;AAOA,IAAIC,KAAQC,EAAmB,kCAAkC,GAC7DC,KAAYD,EAAmB,kCAAkC;AACrE,SAASE,GAAK/N,GAAGgO,GAAQ;AACvB,MAAI9e,IAAM,IAAI,WAAW8e,CAAM,GAC3BC,IAAK,GACL7T,IAAS,GACTgN,IAAI9B;AACR,QAAM4I,IAAU,IAAI,WAAW,CAAC,GAC1BC,IAAQ,MAAM;AAClB,IAAAD,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,IAAI,KACvBC,EAAQ,CAAC,IAAID,IAAK,KAClB7G,IAAI8E,GAAIkC,EAAmBpO,GAAGkO,CAAO,CAAC,GACtCD,KACA7T,IAAS;AAAA,EACb;AACE,EAAA+T;AACA,WAASld,IAAI,GAAGQ,IAAMvC,EAAI,QAAQ+B,IAAIQ,GAAKR;AACzC,IAAImJ,MAAWgN,EAAE,UACf+G,KACFjf,EAAI+B,CAAC,IAAImW,EAAEhN,GAAQ,IAAI;AAEzB,SAAOlL;AACT;AACA,SAASuW,GAAmB4I,GAAUC,GAAmBC,GAAYC,GAAqBC,GAAiBC,IAAc,IAAOC,IAAM,oBAAoBC,IAAM,oBAAoB;AAClL,QAAMC,IAAKnC,EAAS,gBAAgB,QAAQ4B,EAAkB,SAAS,GACjEQ,IAAKpC,EAAS,gBAAgB,QAAQ8B,CAAmB,GACzDO,IAAKrC,EAAS,gBAAgB,QAAQ6B,CAAU;AACtD,MAAIS,IAAK5I,GAAKiI,EAAS,WAAWM,CAAG,GACjCM,IAAK7I,GAAKmI,GAAYK,CAAG;AAC7B,EAAIF,MACF,CAACM,GAAIC,CAAE,IAAI,CAACA,GAAID,CAAE;AAEpB,QAAME,IAAKrB,EAAmBS,EAAkB,UAAU,GACpDa,IAAKtB,EAAmBQ,EAAS,UAAU,GAC3Ce,IAAKP,EAAG,GACRQ,IAAMzB,MAASwB,IAAKtB,KACpBwB,IAAKlY,EAAM,IAAI+X,GAAI/X,EAAM,KAAKiY,GAAKH,CAAE,CAAC,GACtCzS,IAAKqS,EAAG,GACRS,IAAMnY,EAAM,IAAIwW,IAAOnR,IAAKqR,EAAS,GACrC0B,IAAIV,EAAG,SAASS,CAAG,EAAE,IAAIR,CAAE,EAAE,SAASO,CAAE,GACxCG,IAAKpJ,EAAWE,EAAQmJ,EAA2BF,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5DG,IAAKtJ,EAAWE,EAAQmJ,EAA2BF,EAAE,CAAC,GAAG,EAAE,CAAC;AAElE,SADWzB,GAAKK,EAAmBqB,GAAIE,GAAIX,GAAIC,CAAE,GAAGR,CAAe;AAErE;AAGA,IAAImB,KAAS,GACTtK,KAAa,IAAI;AACrB,SAASO,GAAU3W,GAAKwV,GAAWmL,IAAa,GAAG;AACjD,QAAMC,IAAS,OAAO5gB,KAAQ,WAAWmX,EAAWI,GAAUvX,CAAG,CAAC,IAAI,WAAW,KAAKA,CAAG,GACnF6gB,IAAiB,OAAOrL,KAAc,WAAWgI,EAAS,gBAAgB,QAAQhI,CAAS,IAAIA,GAC/FsL,IAAUhK,MACVnS,IAAIoc,EAAmBD,EAAQ,UAAU;AAC/C,MAAIjZ,IAAKiZ,EAAQ;AACjB,EAAIjZ,EAAG,SAAS,QACdA,IAAKA,EAAG,UAAUA,EAAG,SAAS,GAAG;AACnC,QAAMW,IAAIqY,EAAe,SAASlc,CAAC,GAC7B4I,IAAK4J,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5D0J,IAAKiF,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5DyY,IAAKjf,GAAWgb,GAAIkE,EAAmB3T,GAAIqT,GAAQ1O,CAAE,CAAC,CAAC;AAC7D,EAAAiP,GAAgB5T,GAAI2E,GAAI0O,CAAM;AAC9B,QAAMQ,IAAKpf,GAAW4e,CAAM;AAC5B,SAAOD,MAAeD,KAAS7Y,IAAKuZ,IAAKH,IAAKpZ,IAAKoZ,IAAKG;AAC1D;AACA,SAASD,GAAgB5T,GAAI2E,GAAIlS,GAAK;AACpC,MAAI+e,IAAK,GACL7T,IAAS,GACTgN,IAAI9B;AACR,QAAM4I,IAAU,IAAI,WAAW,CAAC,GAC1BC,IAAQ,MAAM;AAClB,IAAAD,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,KAAK,KACxBC,EAAQ,CAAC,IAAID,KAAM,IAAI,KACvBC,EAAQ,CAAC,IAAID,IAAK,KAClB7G,IAAI8E,GAAIkE,EAAmB3T,GAAI2E,GAAI8M,CAAO,CAAC,GAC3CD,KACA7T,IAAS;AAAA,EACb;AACE,EAAA+T;AACA,WAASld,IAAI,GAAGQ,IAAMvC,EAAI,QAAQ+B,IAAIQ,GAAKR;AACzC,IAAImJ,MAAWgN,EAAE,UACf+G,KACFjf,EAAI+B,CAAC,KAAKmW,EAAEhN,GAAQ,IAAI;AAE5B;AACA,SAASwL,GAAU2K,GAAa3S,GAAYiS,IAAa,GAAG;AAAA,EAC1D,QAAAW,IAAS;AACX,IAAI,IAAI;AACN,QAAMC,IAAoBR,EAAmBrS,CAAU;AACvD,MAAIuS,IAAKI,EAAY,UAAU,KAAK,MAAM,EAAE,GACxCD,IAAKC,EAAY,UAAU,MAAM,EAAE;AACvC,EAAIV,MAAeD,OACjBO,IAAKI,EAAY,UAAUA,EAAY,SAAS,EAAE,GAClDD,IAAKC,EAAY,UAAU,KAAKA,EAAY,SAAS,EAAE;AAEzD,QAAMrhB,IAAMmX,EAAWiK,CAAE,GAEnB5Y,IADKgV,EAAS,gBAAgB,QAAQ,OAAO6D,EAAY,UAAU,GAAG,GAAG,CAAC,EACnE,SAASE,CAAiB,GACjChU,IAAK4J,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC,GAC5D0J,IAAKiF,EAAWE,EAAQ2J,EAA2BxY,EAAE,CAAC,GAAG,EAAE,CAAC;AAGlE,SAFA2Y,GAAgB5T,GAAI2E,GAAIlS,CAAG,GACXqW,GAAW,MAAM,KAAK2G,GAAIkE,EAAmB3T,GAAIvN,GAAKkS,CAAE,CAAC,CAAC,CAAC,MAC3D+O,EAAG,gBACVK,MAAW,UAAUthB,IAAMsW,GAAYtW,CAAG,IAE1CshB,MAAW,UAAU,CAAE,IAAG;AAErC;AACA,SAAS1K,GAAY5W,GAAK0O,GAAYrR,IAAU,CAAA,GAAI;AAClD,MAAI;AAAA,IACF,WAAAmkB;AAAA,IACA,KAAAC;AAAA,IACA,MAAA1X;AAAA,IACA,WAAAyL;AAAA,IACA,QAAAkM;AAAA,EACD,IAAGrkB,GACAskB,IAAU,OAAO3hB,KAAQ,WAAWuX,GAAUvX,CAAG,IAAIqW,GAAW,MAAM,KAAKrW,CAAG,CAAC;AACnF,EAAI+J,MACFyL,IAAYA,KAAayB,GAA2BvI,CAAU,GAC9DiT,IAAU5K,GAAQ4K,GAASnM,GAAWkM,CAAM;AAE9C,QAAMzB,IAAKc,EAAmBrS,CAAU,GAClChO,IAAIqgB,EAAmBY,CAAO;AACpC,MAAIhd,IAAI,MACJpB,IAAI,MACJgJ,IAAI;AACR,KAAG;AACD,OAAG;AACD,UAAIU;AACJ,MAAIuU,KAAaA,EAAU,SACzBvU,IAAQuU,EAAU,QAElBvU,IAAQ+J,GAAQ,GAElBrS,IAAIsI,EAAM,GACV1J,IAAI2E,EAAM,IAAIxH,GAAGuM,EAAM,EAAE;AAAA,IAC/B,SAAa1J,MAAMkU,MAAQlU,IAAIoB,MAAM6Y,EAAS,MAAM;AAChD,IAAAjR,IAAIrE,EAAM,IAAIA,EAAM,IAAIA,EAAM,KAAK+X,GAAIvI,EAAG,CAAC,GAAGxP,EAAM,KAAKvD,GAAGuD,EAAM,KAAK3E,GAAG0c,CAAE,CAAC,CAAC;AAAA,EAClF,SAAW1T,MAAMkL;AACf,SAAIgK,IACK5I,GAAUtV,GAAGgJ,CAAC,IAChB8K,EAAQ2J,EAA2Bzd,CAAC,GAAG,EAAE,IAAI8T,EAAQ2J,EAA2BzU,CAAC,GAAG,EAAE;AAC/F;AACA,SAASsK,GAAkB7W,GAAK4hB,GAASpM,GAAWnY,IAAU,CAAA,GAAI;AAChE,MAAIskB;AACJ,QAAM;AAAA,IACJ,MAAA5X;AAAA,IACA,KAAA0X;AAAA,IACA,QAAAC;AAAA,EACD,IAAGrkB,GACEwkB,IAAe,OAAOrM,KAAc,WAAWA,IAAYA,EAAU,MAAM,EAAK;AACtF,EAAIzL,IACF4X,IAAU5K,GAAQ,OAAO/W,KAAQ,WAAWuX,GAAUvX,CAAG,IAAIA,GAAK6hB,GAAcH,CAAM,IAEtFC,IAAU,OAAO3hB,KAAQ,WAAWuX,GAAUvX,CAAG,IAAIqW,GAAW,MAAM,KAAKrW,CAAG,CAAC;AAEjF,MAAIuD,GACAgJ;AACJ,MAAIkV,GAAK;AACP,UAAMK,IAAe9I,GAAU4I,CAAO;AACtC,IAAAre,IAAIue,EAAa,GACjBvV,IAAIuV,EAAa;AAAA,EACrB;AACI,IAAAve,IAAIwd,EAAmBa,EAAQ,UAAU,GAAG,EAAE,CAAC,GAC/CrV,IAAIwU,EAAmBa,EAAQ,UAAU,EAAE,CAAC;AAE9C,QAAMG,IAAK,OAAOvM,KAAc,WAAWgI,EAAS,gBAAgB,QAAQhI,CAAS,IAAIA,GACnF9U,IAAIqgB,EAAmBY,CAAO,GAC9BzJ,IAAIhQ,EAAM,IAAI3E,GAAGgJ,CAAC;AACxB,MAAI2L,MAAMT;AACR,WAAO;AACT,QAAMuK,IAAOxE,EAAS,gBAAgB,KAAK,SAASjR,CAAC,EAAE,IAAIwV,EAAG,SAAS7J,CAAC,CAAC,GACnE/E,IAAIjL,EAAM,IAAIxH,GAAGshB,EAAK,CAAC;AAC7B,SAAOze,MAAM4P;AACf;AACA,SAAS+D,GAAK1B,GAAWkM,IAAS,oBAAoB;AACpD,EAAAA,IAASnK,GAAUmK,CAAM;AACzB,QAAM9f,IAAIyV,EAAQ2J,EAA2BxD,EAAS,MAAM,CAAC,GAAG,EAAE,GAC5D1Y,IAAIuS,EAAQ2J,EAA2BxD,EAAS,MAAM,CAAC,GAAG,EAAE,GAC5DyE,IAAK5K,EAAQ2J,EAA2BxD,EAAS,gBAAgB,KAAK,CAAC,GAAG,EAAE,GAC5E0E,IAAK7K,EAAQ2J,EAA2BxD,EAAS,gBAAgB,KAAK,CAAC,GAAG,EAAE;AAClF,MAAInP,GACAC;AACJ,MAAIkH,EAAU,WAAW;AACvB,IAAAnH,IAAKmH,EAAU,UAAU,GAAG,EAAE,GAC9BlH,IAAKkH,EAAU,UAAU,IAAI,GAAG;AAAA,OAC3B;AACL,UAAMvI,IAAQuQ,EAAS,gBAAgB,QAAQhI,CAAS;AACxD,IAAAnH,IAAKgJ,EAAQ2J,EAA2B/T,EAAM,CAAC,GAAG,EAAE,GACpDqB,IAAK+I,EAAQ2J,EAA2B/T,EAAM,CAAC,GAAG,EAAE;AAAA,EACrD;AACD,QAAMpQ,IAAOsa,EAAWuK,IAAS9f,IAAIkD,IAAImd,IAAKC,IAAK7T,IAAKC,CAAE,GACpD6T,IAAOT,EAAO,SAAS;AAE7B,SADU1E,GAAIkE,EAAmB,IAAI,WAAW,CAACiB,KAAQ,IAAI,KAAKA,IAAO,GAAG,CAAC,GAAGtlB,CAAI,CAAC;AAEvF;AACA,SAASka,GAAQ4K,GAASnM,GAAWkM,IAAS,oBAAoB;AAChE,QAAM5Q,IAAIoG,GAAK1B,GAAWkM,CAAM;AAChC,SAAO1f,GAAWgb,GAAIkE,EAAmBpQ,GAAG,OAAO6Q,KAAY,WAAWxK,EAAWwK,CAAO,IAAIA,CAAO,CAAC,CAAC;AAC3G;AACA,SAASrK,GAAoB9B,GAAW/K,GAAY;AAClD,QAAMwC,IAAQuQ,EAAS,gBAAgB,QAAQhI,CAAS;AACxD,SAAOgI,EAAS,MAAM,WAAW/S,GAAYwC,CAAK;AACpD;AACA,SAASgK,GAA2BvI,GAAY;AAC9C,QAAM0T,IAAS5E,EAAS,aAAa9O,GAAY,EAAK;AAEtD,SADe2I,EAAQgL,GAAkBD,CAAM,GAAG,EAAE;AAEtD;AACA,SAASpL,KAAW;AAClB,QAAM8J,IAAUhK,MACViL,IAAKvE,EAAS,gBAAgB,QAAQsD,EAAQ,SAAS,GACvDnc,IAAIoc,EAAmBD,EAAQ,UAAU;AAC/C,SAAO;AAAA,IACL,GAAGA;AAAA,IACH,GAAAnc;AAAA,IACA,IAAIod,EAAG;AAAA,EACX;AACA;AAGA,SAASO,GAAYxe,GAAK;AACxB,QAAMQ,IAAM,CAAA;AACZ,WAASvC,IAAI,GAAGQ,IAAMuB,EAAI,QAAQ/B,IAAIQ,GAAKR,KAAK;AAC9C,UAAMkL,IAAQnJ,EAAI,YAAY/B,CAAC;AAC/B,QAAIkL,KAAS;AACX,MAAA3I,EAAI,KAAK2I,CAAK;AAAA,aACLA,KAAS;AAClB,MAAA3I,EAAI,KAAK,MAAM2I,MAAU,CAAC,GAC1B3I,EAAI,KAAK,MAAM2I,IAAQ,EAAE;AAAA,aAChBA,KAAS,SAASA,KAAS,SAASA,KAAS;AACtD,MAAA3I,EAAI,KAAK,MAAM2I,MAAU,EAAE,GAC3B3I,EAAI,KAAK,MAAM2I,MAAU,IAAI,EAAE,GAC/B3I,EAAI,KAAK,MAAM2I,IAAQ,EAAE;AAAA,aAChBA,KAAS,SAASA,KAAS;AACpC,MAAAlL,KACAuC,EAAI,KAAK,MAAM2I,MAAU,KAAK,EAAE,GAChC3I,EAAI,KAAK,MAAM2I,MAAU,KAAK,EAAE,GAChC3I,EAAI,KAAK,MAAM2I,MAAU,IAAI,EAAE,GAC/B3I,EAAI,KAAK,MAAM2I,IAAQ,EAAE;AAAA;AAEzB,YAAA3I,EAAI,KAAK2I,CAAK,GACR,IAAI,MAAM,wBAAwB;AAAA,EAE3C;AACD,SAAO,IAAI,WAAW3I,CAAG;AAC3B;AACA,SAASie,GAAK1iB,GAAOxC,GAAS;AAE5B,MADAwC,IAAQ,OAAOA,KAAU,WAAWyiB,GAAYziB,CAAK,IAAIA,GACrDxC,GAAS;AAEX,SADaA,EAAQ,QAAQ,YAChB;AACX,YAAM,IAAI,MAAM,cAAc;AAChC,QAAIpB,IAAMoB,EAAQ;AAClB,QAAI,CAACpB;AACH,YAAM,IAAI,MAAM,aAAa;AAC/B,WAAAA,IAAM,OAAOA,KAAQ,WAAWkb,EAAWlb,CAAG,IAAIA,GAC3C+F,GAAWsb,GAAKN,IAAK/gB,GAAK4D,CAAK,CAAC;AAAA,EACxC;AACD,SAAOmC,GAAWgb,GAAInd,CAAK,CAAC;AAC9B;AAGA,IAAI2iB,KAAc,CAAA;AAClBzM,GAASyM,IAAa;AAAA,EACpB,SAAS,MAAMC;AAAA,EACf,SAAS,MAAMC;AAAA,EACf,KAAK,MAAMC;AACb,CAAC;AACD,IAAIC,KAAU,GACVC,KAAQ,IACRC,KAAQ,IACRC,KAAO,WAAW,KAAK;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC,GACGC,KAAK,IAAI,YAAY;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,SAASC,GAAQrhB,GAAG;AAClB,UAAQmhB,GAAKnhB,MAAM,KAAK,GAAG,IAAI,QAAQ,MAAMmhB,GAAKnhB,MAAM,KAAK,GAAG,IAAI,QAAQ,MAAMmhB,GAAKnhB,MAAM,IAAI,GAAG,IAAI,QAAQ,IAAImhB,GAAKnhB,IAAI,GAAG,IAAI;AACtI;AAGA,SAASshB,GAAUrjB,GAAOyhB,GAAQ6B,GAAU;AAC1C,MAAIC,IAAK,GAAGlD,IAAK,GAAG3S,IAAK,GAAGC,IAAK,GAAG6V,IAAO,GAAGC,IAAO,GAAGnJ,IAAO,GAAGoJ,IAAO;AACzE,EAAAF,IAAOxjB,EAAM,CAAC,IAAI,KAClByjB,IAAOzjB,EAAM,CAAC,IAAI,KAClBsa,IAAOta,EAAM,CAAC,IAAI,KAClB0jB,IAAO1jB,EAAM,CAAC,IAAI,KAClBujB,IAAKC,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ,GAC3CF,IAAOxjB,EAAM,CAAC,IAAI,KAClByjB,IAAOzjB,EAAM,CAAC,IAAI,KAClBsa,IAAOta,EAAM,CAAC,IAAI,KAClB0jB,IAAO1jB,EAAM,CAAC,IAAI,KAClBqgB,IAAKmD,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ,GAC3CF,IAAOxjB,EAAM,CAAC,IAAI,KAClByjB,IAAOzjB,EAAM,CAAC,IAAI,KAClBsa,IAAOta,EAAM,EAAE,IAAI,KACnB0jB,IAAO1jB,EAAM,EAAE,IAAI,KACnB0N,IAAK8V,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ,GAC3CF,IAAOxjB,EAAM,EAAE,IAAI,KACnByjB,IAAOzjB,EAAM,EAAE,IAAI,KACnBsa,IAAOta,EAAM,EAAE,IAAI,KACnB0jB,IAAO1jB,EAAM,EAAE,IAAI,KACnB2N,IAAK6V,KAAQ,KAAKC,KAAQ,KAAKnJ,KAAQ,IAAIoJ;AAC3C,WAAShgB,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,IAAA8f,IAAOnD,IAAK3S,IAAKC,IAAK2V,EAAS5f,CAAC,GAChC8f,IAAOJ,GAAQI,CAAI,GACnBD,KAAMC,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,IAC1HC,IAAO/V,IAAKC,IAAK4V,IAAKD,EAAS5f,IAAI,CAAC,GACpC+f,IAAOL,GAAQK,CAAI,GACnBpD,KAAMoD,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,IAC1HnJ,IAAO3M,IAAK4V,IAAKlD,IAAKiD,EAAS5f,IAAI,CAAC,GACpC4W,IAAO8I,GAAQ9I,CAAI,GACnB5M,KAAM4M,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,IAC1HoJ,IAAOH,IAAKlD,IAAK3S,IAAK4V,EAAS5f,IAAI,CAAC,GACpCggB,IAAON,GAAQM,CAAI,GACnB/V,KAAM+V,KAAQA,KAAQ,IAAIA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS,OAAOA,KAAQ,KAAKA,MAAS;AAE5H,EAAAjC,EAAO,CAAC,IAAI9T,MAAO,KAAK,KACxB8T,EAAO,CAAC,IAAI9T,MAAO,KAAK,KACxB8T,EAAO,CAAC,IAAI9T,MAAO,IAAI,KACvB8T,EAAO,CAAC,IAAI9T,IAAK,KACjB8T,EAAO,CAAC,IAAI/T,MAAO,KAAK,KACxB+T,EAAO,CAAC,IAAI/T,MAAO,KAAK,KACxB+T,EAAO,CAAC,IAAI/T,MAAO,IAAI,KACvB+T,EAAO,CAAC,IAAI/T,IAAK,KACjB+T,EAAO,CAAC,IAAIpB,MAAO,KAAK,KACxBoB,EAAO,CAAC,IAAIpB,MAAO,KAAK,KACxBoB,EAAO,EAAE,IAAIpB,MAAO,IAAI,KACxBoB,EAAO,EAAE,IAAIpB,IAAK,KAClBoB,EAAO,EAAE,IAAI8B,MAAO,KAAK,KACzB9B,EAAO,EAAE,IAAI8B,MAAO,KAAK,KACzB9B,EAAO,EAAE,IAAI8B,MAAO,IAAI,KACxB9B,EAAO,EAAE,IAAI8B,IAAK;AACpB;AACA,SAASI,GAAWvnB,GAAKknB,GAAUM,GAAW;AAC5C,MAAIL,IAAK,GAAGlD,IAAK,GAAG3S,IAAK,GAAGC,IAAK,GAAGkW,IAAM;AAC1C,EAAAN,KAAMnnB,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,IAAIA,EAAI,CAAC,IAAI,KAClFikB,KAAMjkB,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,IAAIA,EAAI,CAAC,IAAI,KAClFsR,KAAMtR,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,CAAC,IAAI,QAAQ,MAAMA,EAAI,EAAE,IAAI,QAAQ,IAAIA,EAAI,EAAE,IAAI,KACpFuR,KAAMvR,EAAI,EAAE,IAAI,QAAQ,MAAMA,EAAI,EAAE,IAAI,QAAQ,MAAMA,EAAI,EAAE,IAAI,QAAQ,IAAIA,EAAI,EAAE,IAAI,KACtFmnB,KAAM,YACNlD,KAAM,YACN3S,KAAM,YACNC,KAAM;AACN,WAASjK,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,IAAAmgB,IAAMxD,IAAK3S,IAAKC,IAAKwV,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBN,KAAMM,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAI6f,GAClBM,IAAMnW,IAAKC,IAAK4V,IAAKJ,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBxD,KAAMwD,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAI2c,GAClBwD,IAAMlW,IAAK4V,IAAKlD,IAAK8C,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBnW,KAAMmW,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAIgK,GAClBmW,IAAMN,IAAKlD,IAAK3S,IAAKyV,GAAGzf,IAAI,CAAC,GAC7BmgB,IAAMT,GAAQS,CAAG,GACjBlW,KAAMkW,KAAOA,KAAO,KAAKA,MAAQ,OAAOA,KAAO,KAAKA,MAAQ,IAC5DP,EAAS5f,IAAI,CAAC,IAAIiK;AAEpB,MAAIiW,MAAcb;AAChB,aAASrf,IAAI,GAAGA,IAAI,IAAIA;AACtB,OAAC4f,EAAS5f,CAAC,GAAG4f,EAAS,KAAK5f,CAAC,CAAC,IAAI,CAAC4f,EAAS,KAAK5f,CAAC,GAAG4f,EAAS5f,CAAC,CAAC;AAGtE;AACA,IAAIogB,KAAc,IAAI,WAAW,EAAE;AACnC,SAAShB,GAAIiB,GAAS3nB,GAAKwnB,GAAWpmB,IAAU,CAAA,GAAI;AAClD,MAAI;AAAA,IACF,SAAAwmB,IAAU;AAAA,IACV,MAAAC;AAAA,IACA,IAAAC,IAAK,IAAI,WAAW,EAAE;AAAA,IACtB,QAAAzC;AAAA,EACD,IAAGjkB;AACJ,MAAIymB,MAAS,UACP,OAAOC,KAAO,aAChBA,IAAK5M,EAAW4M,CAAE,IAChBA,EAAG,WAAW,MAAM;AACtB,UAAM,IAAI,MAAM,eAAe;AAKnC,MAFI,OAAO9nB,KAAQ,aACjBA,IAAMkb,EAAWlb,CAAG,IAClBA,EAAI,WAAW,MAAM;AACvB,UAAM,IAAI,MAAM,gBAAgB;AAWlC,MATI,OAAO2nB,KAAY,WACjBH,MAAcb,KAChBgB,IAAUtB,GAAYsB,CAAO,IAE7BA,IAAUzM,EAAWyM,CAAO,IAG9BA,IAAU,WAAW,KAAKA,CAAO,IAE9BC,MAAY,YAAYA,MAAY,aAAaJ,MAAcb,IAAS;AAC3E,UAAMoB,IAAelB,KAAQc,EAAQ,SAASd,IACxCmB,IAAW,IAAI,WAAWL,EAAQ,SAASI,CAAY;AAC7D,IAAAC,EAAS,IAAIL,GAAS,CAAC;AACvB,aAAS7hB,IAAI,GAAGA,IAAIiiB,GAAcjiB;AAChC,MAAAkiB,EAASL,EAAQ,SAAS7hB,CAAC,IAAIiiB;AACjC,IAAAJ,IAAUK;AAAA,EACX;AACD,QAAMd,IAAW,IAAI,YAAYN,EAAK;AACtC,EAAAW,GAAWvnB,GAAKknB,GAAUM,CAAS;AACnC,MAAIS,IAAW,IAAI,WAAWN,EAAQ,MAAM,GACxCO,IAAaJ,GACbK,IAAUR,EAAQ,QAClB3W,IAAQ;AACZ,SAAOmX,KAAWtB,MAAO;AACvB,UAAMjjB,IAAQ+jB,EAAQ,SAAS3W,GAAOA,IAAQ,EAAE;AAChD,QAAI6W,MAAS;AACX,eAAS/hB,IAAI,GAAGA,IAAI+gB,IAAO/gB;AACzB,QAAI0hB,MAAcb,OAChB/iB,EAAMkC,CAAC,KAAKoiB,EAAWpiB,CAAC;AAI9B,IAAAmhB,GAAUrjB,GAAO8jB,IAAaR,CAAQ;AACtC,aAASphB,IAAI,GAAGA,IAAI+gB,IAAO/gB;AACzB,MAAI+hB,MAAS,SACPL,MAAcb,OAChBe,GAAY5hB,CAAC,KAAKoiB,EAAWpiB,CAAC,IAGlCmiB,EAASjX,IAAQlL,CAAC,IAAI4hB,GAAY5hB,CAAC;AAErC,IAAI+hB,MAAS,UACPL,MAAcb,KAChBuB,IAAaR,KAEbQ,IAAatkB,IAGjBukB,KAAWtB,IACX7V,KAAS6V;AAAA,EACV;AACD,OAAKe,MAAY,YAAYA,MAAY,aAAaJ,MAAcb,IAAS;AAC3E,UAAMrgB,IAAM2hB,EAAS,QACfF,IAAeE,EAAS3hB,IAAM,CAAC;AACrC,aAASR,IAAI,GAAGA,KAAKiiB,GAAcjiB;AACjC,UAAImiB,EAAS3hB,IAAMR,CAAC,MAAMiiB;AACxB,cAAM,IAAI,MAAM,oBAAoB;AAExC,IAAAE,IAAWA,EAAS,MAAM,GAAG3hB,IAAMyhB,CAAY;AAAA,EAChD;AACD,SAAI1C,MAAW,UACTmC,MAAcb,KACT5gB,GAAWkiB,CAAQ,IAEnB5N,GAAY4N,CAAQ,IAGtBA;AAEX;AACA,SAASxB,GAAQkB,GAAS3nB,GAAKoB,IAAU,CAAA,GAAI;AAC3C,SAAOslB,GAAIiB,GAAS3nB,GAAK,GAAGoB,CAAO;AACrC;AACA,SAASolB,GAAQmB,GAAS3nB,GAAKoB,IAAU,CAAA,GAAI;AAC3C,SAAOslB,GAAIiB,GAAS3nB,GAAK,GAAGoB,CAAO;AACrC;AAMA;AC52CO,SAASgnB,GAAcrkB,GAAK/D,GAAK0kB,GAAY;AACnD,SAAO2D,GAAI,UAAUtkB,GAAK/D,GAAK0kB,CAAU;AAC1C;AAQO,SAAS4D,GAAOvkB,GAAK3C,GAAS;AACpC,SAAO2f,GAAIhd,GAAK3C,CAAO;AACxB;AASO,SAASmnB,GAAcxkB,GAAK/D,GAAKoB,GAAS;AAChD,SAAOslB,GAAI,QAAQ3iB,GAAK/D,GAAKoB,CAAO;AACrC;AASO,SAASonB,GAAcpD,GAAaplB,GAAKoB,GAAS;AACxD,SAAOslB,GAAI,QAAQtB,GAAaplB,GAAKoB,CAAO;AAC7C;","x_google_ignoreList":[3,4,5,6,7]}