{"version":3,"sources":["webpack:///./node_modules/core-js/internals/fails.js","webpack:///./node_modules/core-js/internals/well-known-symbol.js","webpack:///./node_modules/core-js/internals/global.js","webpack:///./node_modules/axios/lib/utils.js","webpack:///./node_modules/core-js/internals/has.js","webpack:///./node_modules/core-js/internals/an-object.js","webpack:///./node_modules/core-js/internals/is-object.js","webpack:///./node_modules/core-js/internals/descriptors.js","webpack:///./node_modules/core-js/internals/object-define-property.js","webpack:///./node_modules/core-js/internals/create-non-enumerable-property.js","webpack:///./node_modules/core-js/internals/export.js","webpack:///./node_modules/core-js/internals/redefine.js","webpack:///../lib/index.ts","webpack:///./node_modules/core-js/internals/to-length.js","webpack:///./node_modules/core-js/internals/to-object.js","webpack:///./node_modules/core-js/internals/iterators.js","webpack:///./node_modules/vue-loader/lib/runtime/componentNormalizer.js","webpack:///./node_modules/core-js/internals/classof-raw.js","webpack:///./node_modules/core-js/internals/internal-state.js","webpack:///./node_modules/core-js/internals/require-object-coercible.js","webpack:///./node_modules/core-js/internals/get-built-in.js","webpack:///./node_modules/core-js/internals/create-property-descriptor.js","webpack:///./node_modules/core-js/internals/to-indexed-object.js","webpack:///./node_modules/core-js/internals/to-integer.js","webpack:///./node_modules/core-js/internals/hidden-keys.js","webpack:///./node_modules/core-js/internals/function-bind-context.js","webpack:///./node_modules/core-js/internals/object-create.js","webpack:///./node_modules/core-js/internals/set-to-string-tag.js","webpack:///./node_modules/core-js/internals/to-primitive.js","webpack:///./node_modules/core-js/internals/is-pure.js","webpack:///./node_modules/core-js/internals/array-method-uses-to-length.js","webpack:///./node_modules/core-js/internals/indexed-object.js","webpack:///./node_modules/core-js/internals/set-global.js","webpack:///./node_modules/core-js/internals/shared-store.js","webpack:///./node_modules/core-js/internals/shared-key.js","webpack:///./node_modules/core-js/internals/uid.js","webpack:///./node_modules/core-js/internals/enum-bug-keys.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/internal/constants.js","webpack:///./node_modules/core-js/internals/define-iterator.js","webpack:///./node_modules/core-js/internals/to-string-tag-support.js","webpack:///./node_modules/core-js/internals/regexp-exec.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/process/browser.js","webpack:///./node_modules/core-js/modules/es.object.to-string.js","webpack:///./node_modules/core-js/modules/es.array.iterator.js","webpack:///./node_modules/core-js/modules/es.regexp.exec.js","webpack:///./node_modules/core-js/internals/object-get-own-property-descriptor.js","webpack:///./node_modules/core-js/internals/is-forced.js","webpack:///./node_modules/core-js/internals/an-instance.js","webpack:///./node_modules/core-js/modules/es.object.assign.js","webpack:///./node_modules/core-js/modules/es.array.concat.js","webpack:///./node_modules/core-js/internals/array-method-has-species-support.js","webpack:///./node_modules/core-js/internals/document-create-element.js","webpack:///./node_modules/core-js/internals/inspect-source.js","webpack:///./node_modules/core-js/internals/array-iteration.js","webpack:///./node_modules/core-js/internals/array-species-create.js","webpack:///./node_modules/core-js/internals/array-method-is-strict.js","webpack:///./node_modules/core-js/internals/engine-v8-version.js","webpack:///./node_modules/core-js/internals/iterate.js","webpack:///./node_modules/core-js/internals/classof.js","webpack:///./node_modules/core-js/internals/string-multibyte.js","webpack:///./node_modules/core-js/internals/object-property-is-enumerable.js","webpack:///./node_modules/core-js/internals/ie8-dom-define.js","webpack:///./node_modules/core-js/internals/shared.js","webpack:///./node_modules/core-js/internals/object-keys-internal.js","webpack:///./node_modules/core-js/internals/array-includes.js","webpack:///./node_modules/core-js/internals/object-get-own-property-symbols.js","webpack:///./node_modules/core-js/internals/object-keys.js","webpack:///./node_modules/axios/lib/helpers/bind.js","webpack:///./node_modules/axios/lib/helpers/buildURL.js","webpack:///./node_modules/axios/lib/cancel/isCancel.js","webpack:///./node_modules/axios/lib/defaults.js","webpack:///./node_modules/axios/lib/adapters/xhr.js","webpack:///./node_modules/axios/lib/core/createError.js","webpack:///./node_modules/axios/lib/core/mergeConfig.js","webpack:///./node_modules/axios/lib/cancel/Cancel.js","webpack:///./node_modules/core-js/modules/es.array.for-each.js","webpack:///./node_modules/core-js/internals/array-for-each.js","webpack:///./node_modules/core-js/internals/is-array.js","webpack:///./node_modules/core-js/internals/native-symbol.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/internal/re.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/internal/debug.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/classes/semver.js","webpack:///./node_modules/core-js/internals/iterators-core.js","webpack:///./node_modules/core-js/internals/object-get-prototype-of.js","webpack:///./node_modules/core-js/internals/object-set-prototype-of.js","webpack:///./node_modules/core-js/internals/internal-metadata.js","webpack:///./node_modules/core-js/internals/dom-iterables.js","webpack:///./node_modules/core-js/internals/regexp-flags.js","webpack:///./node_modules/css-loader/dist/runtime/api.js","webpack:///./node_modules/vue-style-loader/lib/listToStyles.js","webpack:///./node_modules/vue-style-loader/lib/addStylesClient.js","webpack:///./node_modules/core-js/modules/es.string.iterator.js","webpack:///./node_modules/core-js/modules/es.regexp.to-string.js","webpack:///./node_modules/core-js/modules/web.dom-collections.iterator.js","webpack:///./node_modules/core-js/modules/es.array.index-of.js","webpack:///./node_modules/core-js/modules/es.string.replace.js","webpack:///./node_modules/core-js/internals/a-function.js","webpack:///./node_modules/core-js/internals/get-iterator-method.js","webpack:///./node_modules/core-js/internals/object-get-own-property-names.js","webpack:///./node_modules/core-js/internals/create-property.js","webpack:///./node_modules/core-js/modules/es.array.filter.js","webpack:///./node_modules/core-js/internals/inherit-if-required.js","webpack:///./node_modules/core-js/internals/redefine-all.js","webpack:///./node_modules/core-js/internals/to-absolute-index.js","webpack:///./node_modules/core-js/internals/object-assign.js","webpack:///./node_modules/core-js/internals/engine-user-agent.js","webpack:///./node_modules/core-js/internals/object-define-properties.js","webpack:///./node_modules/core-js/internals/html.js","webpack:///./node_modules/core-js/internals/create-iterator-constructor.js","webpack:///./node_modules/core-js/internals/is-array-iterator-method.js","webpack:///./node_modules/core-js/internals/iterator-close.js","webpack:///./node_modules/core-js/internals/check-correctness-of-iteration.js","webpack:///./node_modules/core-js/internals/set-species.js","webpack:///./node_modules/core-js/internals/fix-regexp-well-known-symbol-logic.js","webpack:///./node_modules/core-js/internals/advance-string-index.js","webpack:///./node_modules/core-js/internals/regexp-exec-abstract.js","webpack:///./node_modules/core-js/internals/native-weak-map.js","webpack:///./node_modules/core-js/internals/copy-constructor-properties.js","webpack:///./node_modules/core-js/internals/own-keys.js","webpack:///./node_modules/core-js/internals/path.js","webpack:///./node_modules/axios/index.js","webpack:///./node_modules/axios/lib/axios.js","webpack:///./node_modules/axios/lib/core/Axios.js","webpack:///./node_modules/axios/lib/core/InterceptorManager.js","webpack:///./node_modules/axios/lib/core/dispatchRequest.js","webpack:///./node_modules/axios/lib/core/transformData.js","webpack:///./node_modules/axios/lib/helpers/normalizeHeaderName.js","webpack:///./node_modules/axios/lib/core/settle.js","webpack:///./node_modules/axios/lib/core/enhanceError.js","webpack:///./node_modules/axios/lib/helpers/cookies.js","webpack:///./node_modules/axios/lib/core/buildFullPath.js","webpack:///./node_modules/axios/lib/helpers/isAbsoluteURL.js","webpack:///./node_modules/axios/lib/helpers/combineURLs.js","webpack:///./node_modules/axios/lib/helpers/parseHeaders.js","webpack:///./node_modules/axios/lib/helpers/isURLSameOrigin.js","webpack:///./node_modules/axios/lib/cancel/CancelToken.js","webpack:///./node_modules/axios/lib/helpers/spread.js","webpack:///../lib/requesttoken.ts","webpack:///./node_modules/core-js/internals/use-symbol-as-uid.js","webpack:///../lib/ProxyBus.ts","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/functions/valid.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/functions/parse.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/internal/identifiers.js","webpack:///./node_modules/@nextcloud/event-bus/node_modules/semver/functions/major.js","webpack:///../lib/SimpleBus.ts","webpack:///./node_modules/core-js/internals/add-to-unscopables.js","webpack:///./node_modules/core-js/internals/correct-prototype-getter.js","webpack:///./node_modules/core-js/internals/a-possible-prototype.js","webpack:///./node_modules/core-js/modules/es.map.js","webpack:///./node_modules/core-js/internals/collection.js","webpack:///./node_modules/core-js/internals/freezing.js","webpack:///./node_modules/core-js/internals/collection-strong.js","webpack:///./node_modules/core-js/internals/object-to-string.js","webpack:///./node_modules/core-js/modules/web.dom-collections.for-each.js","webpack:///../lib/user.ts","webpack:///./node_modules/core-js/internals/regexp-sticky-helpers.js","webpack:///./node_modules/markdown-it/lib/common/utils.js","webpack:///../src/commands.js","webpack:///../src/selection.js","webpack:///../src/transaction.js","webpack:///../src/state.js","webpack:///../src/plugin.js","webpack:///./node_modules/orderedmap/index.es.js","webpack:///../src/fragment.js","webpack:///../src/diff.js","webpack:///../src/comparedeep.js","webpack:///../src/mark.js","webpack:///../src/replace.js","webpack:///../src/resolvedpos.js","webpack:///../src/node.js","webpack:///../src/content.js","webpack:///../src/schema.js","webpack:///../src/from_dom.js","webpack:///../src/to_dom.js","webpack:///../src/map.js","webpack:///../src/transform.js","webpack:///../src/step.js","webpack:///../src/replace_step.js","webpack:///../src/structure.js","webpack:///../src/mark_step.js","webpack:///../src/dropcursor.js","webpack:///../src/gapcursor.js","webpack:///../src/index.js","webpack:///./node_modules/tiptap/dist/tiptap.esm.js","webpack:///../src/inputrules.js","webpack:///../src/rules.js","webpack:///../src/rulebuilders.js","webpack:///NextcloudVue.[name]/webpack/universalModuleDefinition","webpack:///NextcloudVue.[name]/webpack/bootstrap","webpack:///NextcloudVue.[name]/node_modules/css-loader/dist/runtime/api.js","webpack:///NextcloudVue.[name]/src/directives/Tooltip/index.js","webpack:///NextcloudVue.[name]/node_modules/vue-style-loader/lib/listToStyles.js","webpack:///NextcloudVue.[name]/node_modules/vue-style-loader/lib/addStylesClient.js","webpack:///webpack:/NextcloudVue.[name]/external \"v-tooltip\"","webpack:///NextcloudVue.[name]/src/directives/Tooltip/index.scss?30d2","webpack:///NextcloudVue.[name]/src/directives/Tooltip/index.scss","webpack:///./node_modules/rope-sequence/dist/index.es.js","webpack:///../src/history.js","webpack:///./node_modules/tiptap-extensions/dist/extensions.esm.js","webpack:///../src/browser.js","webpack:///../src/dom.js","webpack:///../src/domcoords.js","webpack:///../src/viewdesc.js","webpack:///../src/capturekeys.js","webpack:///../src/domchange.js","webpack:///../src/clipboard.js","webpack:///../src/domobserver.js","webpack:///../src/input.js","webpack:///../src/decoration.js","webpack:///../src/transforms.js","webpack:///../src/helpers.js","webpack:///../src/table.js","webpack:///../src/schema-list.js","webpack:///./node_modules/tiptap-commands/dist/commands.esm.js","webpack:///../src/collab.js","webpack:///./node_modules/tiptap-utils/dist/utils.esm.js","webpack:///./node_modules/uc.micro/categories/P/regex.js","webpack:///./node_modules/markdown-it/lib/ruler.js","webpack:///./node_modules/markdown-it/lib/token.js","webpack:///./node_modules/w3c-keyname/index.es.js","webpack:///../src/keymap.js","webpack:///./node_modules/escape-html/index.js","webpack:///../src/tablemap.js","webpack:///../src/util.js","webpack:///../src/cellselection.js","webpack:///../src/copypaste.js","webpack:///../src/fixtables.js","webpack:///../src/tableview.js","webpack:///../src/columnresizing.js","webpack:///./node_modules/markdown-it/index.js","webpack:///./node_modules/markdown-it/lib/common/entities.js","webpack:///./node_modules/mdurl/index.js","webpack:///./node_modules/uc.micro/properties/Any/regex.js","webpack:///./node_modules/uc.micro/categories/Cc/regex.js","webpack:///./node_modules/uc.micro/categories/Z/regex.js","webpack:///./node_modules/markdown-it/lib/common/html_re.js","webpack:///./node_modules/markdown-it/lib/rules_inline/strikethrough.js","webpack:///./node_modules/markdown-it/lib/rules_inline/emphasis.js","webpack:///(webpack)/buildin/amd-options.js","webpack:///./node_modules/lowlight/lib/core.js","webpack:///./node_modules/lowlight/node_modules/highlight.js/lib/core.js","webpack:///./node_modules/fault/index.js","webpack:///./node_modules/format/format.js","webpack:///./node_modules/markdown-it/lib/index.js","webpack:///./node_modules/mdurl/encode.js","webpack:///./node_modules/mdurl/decode.js","webpack:///./node_modules/mdurl/format.js","webpack:///./node_modules/mdurl/parse.js","webpack:///./node_modules/uc.micro/index.js","webpack:///./node_modules/uc.micro/categories/Cf/regex.js","webpack:///./node_modules/markdown-it/lib/helpers/index.js","webpack:///./node_modules/markdown-it/lib/helpers/parse_link_label.js","webpack:///./node_modules/markdown-it/lib/helpers/parse_link_destination.js","webpack:///./node_modules/markdown-it/lib/helpers/parse_link_title.js","webpack:///./node_modules/markdown-it/lib/renderer.js","webpack:///./node_modules/markdown-it/lib/parser_core.js","webpack:///./node_modules/markdown-it/lib/rules_core/normalize.js","webpack:///./node_modules/markdown-it/lib/rules_core/block.js","webpack:///./node_modules/markdown-it/lib/rules_core/inline.js","webpack:///./node_modules/markdown-it/lib/rules_core/linkify.js","webpack:///./node_modules/markdown-it/lib/rules_core/replacements.js","webpack:///./node_modules/markdown-it/lib/rules_core/smartquotes.js","webpack:///./node_modules/markdown-it/lib/rules_core/state_core.js","webpack:///./node_modules/markdown-it/lib/parser_block.js","webpack:///./node_modules/markdown-it/lib/rules_block/table.js","webpack:///./node_modules/markdown-it/lib/rules_block/code.js","webpack:///./node_modules/markdown-it/lib/rules_block/fence.js","webpack:///./node_modules/markdown-it/lib/rules_block/blockquote.js","webpack:///./node_modules/markdown-it/lib/rules_block/hr.js","webpack:///./node_modules/markdown-it/lib/rules_block/list.js","webpack:///./node_modules/markdown-it/lib/rules_block/reference.js","webpack:///./node_modules/markdown-it/lib/rules_block/heading.js","webpack:///./node_modules/markdown-it/lib/rules_block/lheading.js","webpack:///./node_modules/markdown-it/lib/rules_block/html_block.js","webpack:///./node_modules/markdown-it/lib/common/html_blocks.js","webpack:///./node_modules/markdown-it/lib/rules_block/paragraph.js","webpack:///./node_modules/markdown-it/lib/rules_block/state_block.js","webpack:///./node_modules/markdown-it/lib/parser_inline.js","webpack:///./node_modules/markdown-it/lib/rules_inline/text.js","webpack:///./node_modules/markdown-it/lib/rules_inline/newline.js","webpack:///./node_modules/markdown-it/lib/rules_inline/escape.js","webpack:///./node_modules/markdown-it/lib/rules_inline/backticks.js","webpack:///./node_modules/markdown-it/lib/rules_inline/link.js","webpack:///./node_modules/markdown-it/lib/rules_inline/image.js","webpack:///./node_modules/markdown-it/lib/rules_inline/autolink.js","webpack:///./node_modules/markdown-it/lib/rules_inline/html_inline.js","webpack:///./node_modules/markdown-it/lib/rules_inline/entity.js","webpack:///./node_modules/markdown-it/lib/rules_inline/balance_pairs.js","webpack:///./node_modules/markdown-it/lib/rules_inline/text_collapse.js","webpack:///./node_modules/markdown-it/lib/rules_inline/state_inline.js","webpack:///./node_modules/linkify-it/index.js","webpack:///./node_modules/linkify-it/lib/re.js","webpack:///./node_modules/node-libs-browser/node_modules/punycode/punycode.js","webpack:///./node_modules/markdown-it/lib/presets/default.js","webpack:///./node_modules/markdown-it/lib/presets/zero.js","webpack:///./node_modules/markdown-it/lib/presets/commonmark.js","webpack:///./node_modules/markdown-it-task-lists/index.js","webpack:///./node_modules/proxy-polyfill/src/index.js","webpack:///./node_modules/proxy-polyfill/src/proxy.js","webpack:///../src/from_markdown.js","webpack:///../src/to_markdown.js"],"names":["module","exports","exec","error","global","require","shared","has","uid","NATIVE_SYMBOL","USE_SYMBOL_AS_UID","WellKnownSymbolsStore","Symbol","createWellKnownSymbol","withoutSetter","name","check","it","Math","globalThis","window","self","this","Function","bind","toString","Object","prototype","isArray","val","call","isUndefined","isObject","isPlainObject","getPrototypeOf","isFunction","forEach","obj","fn","i","l","length","key","hasOwnProperty","isArrayBuffer","isBuffer","constructor","isFormData","FormData","isArrayBufferView","ArrayBuffer","isView","buffer","isString","isNumber","isDate","isFile","isBlob","isStream","pipe","isURLSearchParams","URLSearchParams","isStandardBrowserEnv","navigator","product","document","merge","result","assignValue","slice","arguments","extend","a","b","thisArg","trim","str","replace","stripBOM","content","charCodeAt","TypeError","String","fails","defineProperty","get","DESCRIPTORS","IE8_DOM_DEFINE","anObject","toPrimitive","nativeDefineProperty","f","O","P","Attributes","value","definePropertyModule","createPropertyDescriptor","object","getOwnPropertyDescriptor","createNonEnumerableProperty","redefine","setGlobal","copyConstructorProperties","isForced","options","source","target","targetProperty","sourceProperty","descriptor","TARGET","GLOBAL","STATIC","stat","noTargetGet","forced","undefined","sham","inspectSource","InternalStateModule","getInternalState","enforceInternalState","enforce","TEMPLATE","split","state","unsafe","simple","enumerable","join","generateFilePath","getRootUrl","linkToRemoteBase","version","allOptions","escape","noRewrite","_build","vars","r","encodeURIComponent","url","OC","params","file","isCore","link","app","type","encodeURI","client","headers","requesttoken","cancelableClient","CancelToken","Axios","isCancel","bus","console","ProxyBus","SimpleBus","toInteger","min","argument","requireObjectCoercible","normalizeComponent","scriptExports","render","staticRenderFns","functionalTemplate","injectStyles","scopeId","moduleIdentifier","shadowMode","hook","_compiled","functional","_scopeId","context","$vnode","ssrContext","parent","__VUE_SSR_CONTEXT__","_registeredComponents","add","_ssrRegister","$root","$options","shadowRoot","_injectStyles","originalRender","h","existing","beforeCreate","concat","set","NATIVE_WEAK_MAP","objectHas","sharedKey","hiddenKeys","WeakMap","store","wmget","wmhas","wmset","metadata","facade","STATE","getterFor","TYPE","path","aFunction","variable","namespace","method","bitmap","configurable","writable","IndexedObject","ceil","floor","isNaN","that","c","apply","activeXDocument","defineProperties","enumBugKeys","html","documentCreateElement","IE_PROTO","EmptyConstructor","scriptTag","LT","NullProtoObject","domain","ActiveXObject","iframeDocument","iframe","write","close","temp","parentWindow","NullProtoObjectViaActiveX","style","display","appendChild","src","contentWindow","open","F","create","Properties","TO_STRING_TAG","wellKnownSymbol","TAG","input","PREFERRED_STRING","valueOf","cache","thrower","METHOD_NAME","ACCESSORS","argument0","argument1","classof","propertyIsEnumerable","keys","id","postfix","random","MAX_SAFE_INTEGER","Number","SEMVER_SPEC_VERSION","MAX_LENGTH","MAX_SAFE_COMPONENT_LENGTH","$","createIteratorConstructor","setPrototypeOf","setToStringTag","IS_PURE","Iterators","IteratorsCore","IteratorPrototype","BUGGY_SAFARI_ITERATORS","ITERATOR","returnThis","Iterable","NAME","IteratorConstructor","next","DEFAULT","IS_SET","FORCED","CurrentIteratorPrototype","methods","KEY","getIterationMethod","KIND","defaultIterator","IterablePrototype","INCORRECT_VALUES_NAME","nativeIterator","anyNativeIterator","entries","values","proto","test","re1","re2","regexpFlags","stickyHelpers","nativeExec","RegExp","nativeReplace","patchedExec","UPDATES_LAST_INDEX_WRONG","lastIndex","UNSUPPORTED_Y","BROKEN_CARET","NPCG_INCLUDED","reCopy","match","re","sticky","flags","charsAdded","strCopy","indexOf","multiline","index","g","e","cachedSetTimeout","cachedClearTimeout","process","defaultSetTimout","Error","defaultClearTimeout","runTimeout","fun","setTimeout","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","drainQueue","timeout","len","run","marker","runClearTimeout","Item","array","noop","nextTick","args","Array","push","title","browser","env","argv","versions","on","addListener","once","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","TO_STRING_TAG_SUPPORT","toIndexedObject","addToUnscopables","defineIterator","setInternalState","iterated","kind","done","Arguments","propertyIsEnumerableModule","nativeGetOwnPropertyDescriptor","replacement","feature","detection","data","normalize","POLYFILL","NATIVE","string","toLowerCase","Constructor","assign","toObject","toLength","createProperty","arraySpeciesCreate","arrayMethodHasSpeciesSupport","V8_VERSION","IS_CONCAT_SPREADABLE","IS_CONCAT_SPREADABLE_SUPPORT","SPECIES_SUPPORT","isConcatSpreadable","spreadable","arg","k","E","A","n","SPECIES","foo","Boolean","EXISTS","createElement","functionToString","createMethod","IS_MAP","IS_FILTER","IS_SOME","IS_EVERY","IS_FIND_INDEX","NO_HOLES","$this","callbackfn","specificCreate","boundFunction","map","filter","some","every","find","findIndex","originalArray","C","userAgent","v8","isArrayIteratorMethod","getIteratorMethod","iteratorClose","Result","stopped","iterable","unboundFunction","iterator","iterFn","step","AS_ENTRIES","IS_ITERATOR","INTERRUPTED","stop","condition","callFn","classofRaw","CORRECT_ARGUMENTS","tag","tryGet","callee","CONVERT_TO_STRING","pos","first","second","S","position","size","charAt","codeAt","nativePropertyIsEnumerable","NASHORN_BUG","1","V","mode","copyright","names","toAbsoluteIndex","IS_INCLUDES","el","fromIndex","includes","getOwnPropertySymbols","internalObjectKeys","utils","encode","paramsSerializer","serializedParams","parts","v","toISOString","JSON","stringify","hashmarkIndex","__CANCEL__","normalizeHeaderName","DEFAULT_CONTENT_TYPE","setContentTypeIfUnset","adapter","defaults","XMLHttpRequest","transformRequest","transformResponse","parse","xsrfCookieName","xsrfHeaderName","maxContentLength","maxBodyLength","validateStatus","status","common","settle","cookies","buildURL","buildFullPath","parseHeaders","isURLSameOrigin","createError","config","Promise","resolve","reject","requestData","requestHeaders","request","auth","username","password","unescape","Authorization","btoa","fullPath","baseURL","toUpperCase","onreadystatechange","readyState","responseURL","responseHeaders","getAllResponseHeaders","response","responseType","responseText","statusText","onabort","onerror","ontimeout","timeoutErrorMessage","xsrfValue","withCredentials","read","setRequestHeader","onDownloadProgress","addEventListener","onUploadProgress","upload","cancelToken","promise","then","cancel","abort","send","enhanceError","message","code","config1","config2","valueFromConfig2Keys","mergeDeepPropertiesKeys","defaultToConfig2Keys","directMergeKeys","getMergedValue","mergeDeepProperties","prop","axiosKeys","otherKeys","Cancel","$forEach","arrayMethodIsStrict","arrayMethodUsesToLength","STRICT_METHOD","USES_TO_LENGTH","debug","t","R","createToken","isGlobal","NUMERICIDENTIFIER","NUMERICIDENTIFIERLOOSE","NONNUMERICIDENTIFIER","PRERELEASEIDENTIFIER","PRERELEASEIDENTIFIERLOOSE","BUILDIDENTIFIER","MAINVERSION","PRERELEASE","BUILD","FULLPLAIN","MAINVERSIONLOOSE","PRERELEASELOOSE","LOOSEPLAIN","XRANGEIDENTIFIER","XRANGEIDENTIFIERLOOSE","GTLT","XRANGEPLAIN","XRANGEPLAINLOOSE","COERCE","LONETILDE","tildeTrimReplace","LONECARET","caretTrimReplace","comparatorTrimReplace","NODE_DEBUG","compareIdentifiers","SemVer","loose","includePrerelease","m","LOOSE","FULL","raw","major","minor","patch","prerelease","num","build","format","other","compareMain","comparePre","release","identifier","inc","PrototypeOfArrayIteratorPrototype","arrayIterator","CORRECT_PROTOTYPE_GETTER","ObjectPrototype","aPossiblePrototype","setter","CORRECT_SETTER","__proto__","FREEZING","METADATA","isExtensible","setMetadata","objectID","weakData","meta","REQUIRED","fastKey","getWeakData","onFreeze","CSSRuleList","CSSStyleDeclaration","CSSValueList","ClientRectList","DOMRectList","DOMStringList","DOMTokenList","DataTransferItemList","FileList","HTMLAllCollection","HTMLCollection","HTMLFormElement","HTMLSelectElement","MediaList","MimeTypeArray","NamedNodeMap","NodeList","PaintRequestList","Plugin","PluginArray","SVGLengthList","SVGNumberList","SVGPathSegList","SVGPointList","SVGStringList","SVGTransformList","SourceBufferList","StyleSheetList","TextTrackCueList","TextTrackList","TouchList","ignoreCase","dotAll","unicode","useSourceMap","list","item","cssMapping","sourceMapping","sourceMap","base64","sourceURLs","sources","sourceRoot","cssWithMappingToString","modules","mediaQuery","dedupe","alreadyImportedModules","_i","listToStyles","parentId","styles","newStyles","part","css","media","hasDocument","DEBUG","stylesInDom","head","getElementsByTagName","singletonElement","singletonCounter","isProduction","isOldIE","addStylesClient","_isProduction","_options","addStylesToDom","newList","mayRemove","domStyle","refs","j","addStyle","createStyleElement","styleElement","update","remove","querySelector","parentNode","removeChild","styleIndex","applyToSingletonTag","applyToTag","newObj","textStore","replaceText","styleSheet","cssText","cssNode","createTextNode","childNodes","insertBefore","setAttribute","ssrId","firstChild","point","RegExpPrototype","nativeToString","NOT_GENERIC","INCORRECT_NAME","p","rf","DOMIterables","ArrayIteratorMethods","ArrayValues","COLLECTION_NAME","Collection","CollectionPrototype","$indexOf","nativeIndexOf","NEGATIVE_ZERO","searchElement","fixRegExpWellKnownSymbolLogic","advanceStringIndex","regExpExec","max","SUBSTITUTION_SYMBOLS","SUBSTITUTION_SYMBOLS_NO_NAMED","REPLACE","maybeCallNative","reason","REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE","REPLACE_KEEPS_$0","UNSAFE_SUBSTITUTE","searchValue","replaceValue","replacer","regexp","res","rx","functionalReplace","fullUnicode","results","accumulatedResult","nextSourcePosition","matched","captures","namedCaptures","groups","replacerArgs","getSubstitution","tailPos","symbols","ch","capture","getOwnPropertyNames","propertyKey","$filter","HAS_SPECIES_SUPPORT","dummy","Wrapper","NewTarget","NewTargetPrototype","integer","objectKeys","getOwnPropertySymbolsModule","nativeAssign","B","symbol","chr","T","argumentsLength","getBuiltIn","ArrayPrototype","returnMethod","SAFE_CLOSING","called","iteratorWithReturn","from","SKIP_CLOSING","ITERATION_SUPPORT","CONSTRUCTOR_NAME","regexpExec","REPLACE_SUPPORTS_NAMED_GROUPS","SPLIT_WORKS_WITH_OVERWRITTEN_EXEC","originalExec","SYMBOL","DELEGATES_TO_SYMBOL","DELEGATES_TO_EXEC","execCalled","nativeRegExpMethod","nativeMethod","arg2","forceStringMethod","stringMethod","regexMethod","ownKeys","getOwnPropertyDescriptorModule","getOwnPropertyNamesModule","mergeConfig","createInstance","defaultConfig","instance","axios","instanceConfig","all","promises","spread","default","InterceptorManager","dispatchRequest","interceptors","chain","interceptor","unshift","fulfilled","rejected","shift","getUri","handlers","use","eject","transformData","throwIfCancellationRequested","throwIfRequested","fns","normalizedName","isAxiosError","toJSON","description","number","fileName","lineNumber","columnNumber","stack","expires","secure","cookie","Date","toGMTString","decodeURIComponent","now","isAbsoluteURL","combineURLs","requestedURL","relativeURL","ignoreDuplicateOf","parsed","line","substr","originURL","msie","urlParsingNode","resolveURL","href","protocol","host","search","hash","hostname","port","pathname","location","requestURL","executor","resolvePromise","token","callback","arr","observer","observers","tokenElement","subscribe","packageJson","handler","event","er","numeric","anum","bnum","rcompareIdentifiers","Map","UNSCOPABLES","collection","collectionStrong","init","InternalMetadataModule","iterate","anInstance","checkCorrectnessOfIteration","inheritIfRequired","wrapper","IS_WEAK","ADDER","NativeConstructor","NativePrototype","exported","fixMethod","getConstructor","HASNT_CHAINING","THROWS_ON_PRIMITIVES","ACCEPT_ITERABLES","BUGGY_ZERO","$instance","clear","setStrong","preventExtensions","redefineAll","setSpecies","internalStateGetterFor","last","define","previous","entry","getEntry","removed","prev","ITERATOR_NAME","getInternalCollectionState","getInternalIteratorState","displayName","isAdmin","uidElement","displayNameElement","RE","s","_hasOwnProperty","isValidEntityCode","fromCodePoint","surrogate1","surrogate2","fromCharCode","UNESCAPE_MD_RE","UNESCAPE_ALL_RE","DIGITAL_ENTITY_TEST_RE","entities","HTML_ESCAPE_TEST_RE","HTML_ESCAPE_REPLACE_RE","HTML_REPLACEMENTS","replaceUnsafeChar","REGEXP_ESCAPE_RE","UNICODE_PUNCT_RE","lib","mdurl","ucmicro","_class","unescapeMd","unescapeAll","escaped","entity","parseInt","replaceEntityPattern","escapeHtml","arrayReplaceAt","newElements","isSpace","isWhiteSpace","isMdAsciiPunct","isPunctChar","escapeRE","normalizeReference","let","$from","$to","const","super","Transaction","doc","time","curSelection","selection","curSelectionFor","storedMarks","updated","steps","mapping","setSelection","RangeError","selectionSet","setStoredMarks","marks","ensureMarks","sameSet","addStoredMark","mark","addToSet","$head","removeStoredMark","removeFromSet","storedMarksSet","addStep","setTime","replaceSelection","replaceSelectionWith","node","inheritMarks","empty","marksAcross","none","replaceWith","deleteSelection","insertText","text","to","schema","deleteRange","replaceRangeWith","Selection","near","setMeta","getMeta","isGeneric","_","scrollIntoView","scrolledIntoView","FieldDesc","desc","baseFields","topNodeType","createAndFill","tr","atStart","_marks","_old","$cursor","Configuration","plugins","fields","pluginsByKey","plugin","spec","EditorState","prototypeAccessors","applyTransaction","filterTransaction","ignore","rootTr","transactions","trs","newState","applyInner","seen","haveNew","appendTransaction","oldState","before","eq","newInstance","field","applyListeners","$config","reconfigure","pluginFields","fromJSON","json","markFromJSON","addApplyListener","removeApplyListener","found","splice","props","bindProps","createKey","getState","PluginKey","OrderedMap","newKey","addToStart","addToEnd","addBefore","place","without","prepend","subtract","append","orderedmap","Fragment","nodeSize","nodesBetween","nodeStart","child","end","start","descendants","textBetween","blockSeparator","leafText","separated","isText","isLeaf","isBlock","lastChild","sameMarkup","withText","cut","cutByIndex","replaceChild","current","copy","childCount","maybeChild","findDiffStart","childA","childB","inner","findDiffEnd","otherPos","posA","posB","iA","iB","same","minSize","round","retIndex","curPos","toStringInner","nodeFromJSON","fromArray","joined","nodes","attrs","offset","compareDeep","ResolvedPos","parentOffset","depth","resolveDepth","indexAfter","textOffset","after","nodeAfter","dOff","nodeBefore","posAtIndex","Mark","main","tmp","inclusive","isInSet","$end","isInline","sharedDepth","blockRange","pred","d","inlineContent","NodeRange","sameParent","rem","resolveCached","resolveCache","cached","resolveCachePos","resolveCacheSize","prototypeAccessors$1","startIndex","endIndex","ContentMatch","validEnd","wrapCache","nodeTypes","stream","TokenStream","expr","parseExpr","err","nfa","labeled","explore","states","out","term","known","nullFrom","sort","cmp","dfa","connect","compile","exprs","reduce","loop","edge","cur","edges","work","dead","hasRequiredAttrs","checkForDeadEnds","matchType","matchFragment","frag","defaultType","compatible","fillBefore","toEnd","types","finished","tp","findWrapping","computed","computeWrapping","active","via","reverse","contentMatch","edgeCount","scan","inline","tokens","pop","parseExprSeq","eat","parseExprSubscript","typeName","resolveName","parseExprAtom","parseExprRange","parseNum","tok","SyntaxError","DOMParser","rules","tags","rule","normalizeLists","dom","ParseContext","addAll","finish","parseSlice","Slice","maxOpen","matchTag","matches","namespaceURI","matchesContext","getAttrs","matchStyle","schemaRules","insert","priority","parseDOM","fromSchema","domParser","blockTags","address","article","aside","blockquote","canvas","dd","div","dl","fieldset","figcaption","figure","footer","form","h1","h2","h3","h4","h5","h6","header","hgroup","hr","li","noscript","ol","output","pre","section","table","tfoot","ul","ignoreTags","script","listTags","wsOptionsFor","preserveWhitespace","NodeContext","pendingMarks","solid","activeMarks","stashMarks","fill","wrap","openEnd","popFromStashMark","markType","applyPending","nextType","pending","allowsMarkType","markMayApply","findSameTypeInSet","parser","isOpen","topContext","topNode","topOptions","topMatch","findPositions","needsBlock","selector","msMatchesSelector","webkitMatchesSelector","mozMatchesSelector","nodeType","top","addDOM","addTextNode","getAttribute","readStyles","parseStyles","addPendingMark","addElement","removePendingMark","nodeValue","domNodeBefore","previousSibling","nodeName","insertNode","findInText","findInside","prevItem","nextSibling","normalizeList","ruleFromNode","skip","closeParent","sync","oldNeedsBlock","leafFallback","addElementByRule","ownerDocument","enter","startIn","getContent","contentDOM","contentElement","findAround","findAtPoint","findPlace","route","cx","enterInner","block","textblockFromContext","closeExtra","preserveWS","ok","topOpen","currentPos","contains","compareDocumentPosition","textNode","option","useRoot","minDepth","$context","deflt","contentMatchAt","isTextblock","defaultAttrs","upto","level","lastIndexOf","stashMark","DOMSerializer","gatherToDOM","toDOM","serializeFragment","fragment","createDocumentFragment","keep","rendered","spanning","markDOM","serializeMark","serializeNode","renderSpec","onContent","serializeNodeAndMarks","structure","xmlNS","tagName","space","createElementNS","setAttributeNS","innerContent","domSerializer","nodesFromSchema","marksFromSchema","factor16","pow","recoverIndex","MapResult","deleted","recover","StepMap","ranges","inverted","diff","recoverOffset","mapResult","assoc","_map","oldIndex","newIndex","oldSize","newSize","touches","oldStart","newStart","invert","Mapping","maps","mirror","TransformError","appendMap","mirrors","setMirror","appendMapping","startSize","mirr","getMirror","appendMappingInverted","totalSize","inverse","corr","Transform","docs","mustOverride","maybeStep","failed","docChanged","getMap","stepsByID","Step","_doc","_mapping","_other","stepType","jsonID","stepClass","StepResult","fail","fromReplace","ReplaceStep","contentBetween","openStart","ReplaceAroundStep","gapFrom","gapTo","gap","inserted","insertAt","removeBetween","dist","canCut","canReplace","liftTarget","range","isolating","innerRange","around","outer","canReplaceWith","findWrappingOutside","inside","innerMatch","findWrappingInside","withAttrs","canSplit","typesAfter","$pos","base","innerType","validContent","rest","baseType","canJoin","joinable","canAppend","joinPoint","dropPoint","pass","bias","insertPos","mapFragment","mapped","lift","gapStart","gapEnd","splitting","wrappers","setBlockType","mapFrom","hasMarkup","canChangeType","clearIncompatible","startM","endM","setNodeMarkup","nodeAt","newNode","typeAfter","AddMarkStep","oldSlice","RemoveMarkStep","fitsTrivially","addMark","added","removing","adding","newSet","removeMark","toRemove","parentType","delSteps","allowed","Fitter","fit","replaceStep","delete","unplaced","frontier","placed","dropFromFragment","count","addToFragment","contentAt","closeNodeStart","contentAfterFits","compatibleContent","allowsMarks","invalidMarks","closeFragment","oldOpen","newOpen","coveredDepths","findFittable","placeNodes","openMore","dropNode","moveInline","mustMoveInline","placedSize","sliceDepth","frontierDepth","inject","openAtEnd","closeFrontierNode","openFrontierNode","taken","openEndCount","allowedMarks","findCloseLevel","dropInner","move","replaceRange","targetDepths","preferredTarget","defining","preferredTargetIndex","leftNodes","preferredDepth","openDepth","targetDepth","expand","startSteps","insertPoint","covered","DropCursorView","editorView","width","color","class","cursorPos","element","destroy","removeEventListener","prevState","updateOverlay","setCursor","rect","nodeRect","nodeDOM","getBoundingClientRect","bottom","left","right","coords","coordsAtPos","offsetParent","className","parentRect","body","getComputedStyle","pageXOffset","pageYOffset","height","scheduleRemoval","dragover","editable","posAtCoords","clientX","clientY","dragging","dragend","drop","dragleave","relatedTarget","GapCursor","valid","getBookmark","GapBookmark","anchor","isAtom","closedBefore","closedAfter","override","allowGapCursor","findFrom","mustMove","$cur","isSelectable","visible","camelCase","word","ComponentView","component","editor","extension","view","decorations","getPos","isNode","isMark","getMarkPos","captureEvents","createDOM","vm","$refs","Component","Vue","selected","updateAttrs","propsData","$mount","$el","updateComponentProps","_props","originalSilent","silent","newAttrs","transaction","dispatch","mutation","stopEvent","draggable","dragHandle","closest","isCopy","isPaste","isCut","isDrag","startsWith","posAtDOM","resolvedPos","getMarkRange","$destroy","Emitter","_callbacks","callbacks","cb","Extension","defaultOptions","ExtensionManager","extensions","bindEditor","extensionKeymaps","nodeMarkKeymaps","keymap","excludedExtensions","allowedExtensions","extensionInputRules","inputRules","nodeMarkInputRules","allInputRules","extensionPasteRules","pasteRules","nodeMarkPasteRules","allPasteRules","commands","allCommands","focus","handle","_name","_value","commandName","commandValue","Proxy","changed","updateState","allPlugins","injectCSS","textContent","minMax","Node","Doc","Paragraph","group","Text","Editor","editorProps","autoFocus","emptyDocument","useBuiltInExtensions","disableInputRules","disablePasteRules","dropCursor","enableDropCursor","enableGapCursor","parseOptions","onInit","onTransaction","onUpdate","onFocus","onBlur","onPaste","onDrop","events","setOptions","focused","createExtensions","createNodes","createMarks","createSchema","createPlugins","keymaps","createKeymaps","createInputRules","createPasteRules","createView","createCommands","setActiveNodesAndMarks","builtInExtensions","Schema","createDocument","Backspace","undoInputRule","baseKeymap","attributes","tabindex","handleDOMEvents","blur","warn","htmlString","parseFromString","firstElementChild","EditorView","createState","handlePaste","handleDrop","dispatchTransaction","setProps","nodeViews","initNodeViews","getHTML","getJSON","emitUpdate","resolveSelection","resolvedFrom","resolvedEnd","TextSelection","innerHTML","setContent","markIsActive","activeMarkAttrs","getMarkAttrs","activeNodes","nodeIsActive","getNodeAttrs","handlePlugins","docView","EditorContent","watch","immediate","$nextTick","setParentComponent","beforeDestroy","Menu","preventHide","mousedownHandler","handleClick","blurHandler","EditorMenuBar","registerPlugin","$scopedSlots","isActive","textRange","createRange","setEnd","setStart","singleRect","rects","getClientRects","side","domFromPos","x","Menu$1","keepInBounds","focusHandler","hide","lastState","composing","box","sendUpdate","EditorMenuBubble","menu","$emit","unregisterPlugin","InputRule","cutOff","stored","handleTextInput","compositionend","isInputRules","textBefore","transform","undoable","toUndo","wrappingInputRule","joinPredicate","wrapping","textblockTypeInputRule","$start","factory","installedModules","__webpack_require__","moduleId","getter","o","toStringTag","__esModule","ns","property","VTooltip","defaultTemplate","SCOPE_VERSION","defaultHtml","locals","___CSS_LOADER_API_IMPORT___","RopeSequence","leafAppend","leafPrepend","appendInner","Append","sliceInner","getInner","forEachInner","forEachInvertedInner","elt","Leaf","flatten","leftLen","ropeSequence","Branch","items","eventCount","popEvent","preserveItems","remap","remapping","remaining","addAfter","addTransform","histOptions","newItems","oldItems","lastItem","merged","cutPoint","overflow","DEPTH_OVERFLOW","mirrorPos","mirrorOffset","addMaps","rebased","rebasedTransform","rebasedCount","rebasedItems","newUntil","iRebased","newMaps","branch","emptyItemCount","compress","newItem","HistoryState","undone","prevRanges","prevTime","rangesFor","_from","_to","mapRanges","histTransaction","history","redo","mustPreserveItems","historyKey","newHist","historyState","cachedPreserveItems","cachedPreserveItemsPlugins","historyPreserveItems","closeHistoryKey","newGroupDelay","hist","historyTr","appended","newGroup","adjacent","isAdjacentTo","Blockquote","toggleWrap","BulletList","toggleList","list_item","CodeBlock","toggleBlockType","paragraph","getDecorations","blocks","findBlockNodes","startPos","parseNodes","classes","properties","children","low","highlightAuto","decoration","Decoration","DecorationSet","CodeBlockHighlight","languages","registerLanguage","decorationSet","oldNodeName","newNodeName","oldNodes","newNodes","HardBreak","chainCommands","exitCode","command","selectable","Heading","levels","HorizontalRule","nodeInputRule","IMAGE_INPUT_REGEX","Image","alt","dataTransfer","files","images","preventDefault","coordinates","image","reader","FileReader","onload","readerEvent","readAsDataURL","ListItem","Enter","splitListItem","Tab","sinkListItem","liftListItem","SuggestionsPlugin","matcher","char","allowSpaces","startOfLine","appendText","suggestionClass","onEnter","onChange","onExit","onKeyDown","onFilter","searchItems","query","Plugin$1","PluginKey$1","moved","started","handleChange","handleExit","handleStart","decorationNode","decorationId","virtualNode","clientWidth","clientHeight","$position","escapedChar","suffix","prefix","textFrom","textTo","matchPrefix","handleKeyDown","editorState","OrderedList","order","hasAttribute","TableNodes","tableNodes","tableGroup","cellContent","cellAttributes","background","getFromDOM","backgroundColor","setDOMAttr","Bold","toggleMark","markInputRule","markPasteRule","fontWeight","Code","excludes","Italic","Link","updateMark","pasteRule","openOnClick","rel","HTMLAnchorElement","stopPropagation","Strike","Collaboration","getSendableSteps","debounce","sendable","sendableSteps","onSendable","clientID","delay","getVersion","receiveTransaction","collab","History","undo","undoDepth","redoDepth","Placeholder","emptyEditorClass","emptyNodeClass","emptyNodeText","showOnlyWhenEditable","showOnlyCurrent","isEditorEmpty","hasAnchor","isNodeEmpty","ie_edge","ie_upto10","ie_11up","mac","platform","ie","ie_version","documentMode","gecko","gecko_version","chrome","chrome_version","ios","android","webkit","documentElement","safari","vendor","webkit_version","domIndex","reusedRange","isEquivalentPosition","targetNode","targetOff","scanFor","atomElements","hasBlockDesc","contentEditable","pmViewDesc","selectionCollapsed","domSel","collapsed","isCollapsed","rangeCount","getRangeAt","keyEvent","keyCode","createEvent","initEvent","windowRect","getSide","clientRect","scrollRectIntoView","startDOM","scrollThreshold","someProp","scrollMargin","atTop","bounding","moveX","moveY","defaultView","scrollBy","startX","scrollLeft","startY","scrollTop","dX","dY","scrollStack","restoreScrollStack","dTop","preventScrollSupported","findOffsetInNode","coordsClosest","dxClosest","rowBot","rowTop","childIndex","dx","inRect","findOffsetInText","root","caretPositionFromPoint","caretRangeFromPoint","elementFromPoint","startI","targetKludge","outside","nearestDesc","posBefore","posAfter","posFromDOM","posFromCaret","posFromElement","posAtStart","border","BIDI","supportEmptyRange","rectBefore","rectAfter","flattenV","domAfterPos","flattenH","y","withFlushedState","viewState","activeElement","maybeRTL","cachedState","cachedDir","cachedResult","endOfTextblock","sel","$anchor","nearest","boxes","endOfTextblockVertical","atEnd","getSelection","modify","oldRange","oldNode","focusNode","oldOff","focusOffset","oldBidiLevel","caretBidiLevel","removeAllRanges","addRange","endOfTextblockHorizontal","ViewDesc","dirty","matchesWidget","matchesMark","matchesNode","matchesHack","beforePosition","parseRule","posBeforeChild","posAtEnd","localPosFromDOM","domBefore","domAfter","onlyNodes","getDesc","descAt","parseRange","fromOffset","toOffset","childBase","emptyChildAt","force","anchorDOM","headDOM","brKludge","anchorNode","anchorOffset","domSelExtended","collapse","DOMException","ignoreMutation","contentLost","markDirty","startInside","endInside","markParentsDirty","nothing","WidgetViewDesc","widget","classList","ignoreSelection","CompositionViewDesc","textDOM","mut","oldValue","MarkViewDesc","custom","replaceNodes","NodeViewDesc","outerDeco","innerDeco","updateChildren","descObj","applyOuterDeco","CustomNodeViewDesc","TextViewDesc","reparseInView","sameOuterDeco","composition","localCompositionNode","updater","ViewTreeUpdater","deco","onWidget","onNode","forChild","decoIndex","restNode","parentIndex","widgets","compareSide","cutAt","iterDeco","insideNode","syncToMarks","placeWidget","findNodeMatch","updateNextNode","addNode","addTextblockHacks","destroyRest","protectLocalComposition","renderDescs","parentDOM","descs","written","childDOM","rm","trackWrites","oldCSS","listStyle","iosHacks","nearbyTextNode","textPos","childStart","findTextInFragment","compositionNodes","updateInner","updateOuterDeco","needsWrap","oldDOM","patchOuterDeco","computeOuterDeco","selectNode","deselectNode","removeAttribute","docViewDesc","pmIsDeco","inParent","BRHackViewDesc","OuterDecoLevel","noDeco","outerDOM","prevComputed","curComputed","curDOM","patchAttributes","prevList","curList","removeProperty","lockedNode","lock","preMatch","preMatched","preMatchOffset","getPreMatch","destroyBetween","maxKeep","markDesc","nextDOM","moveSelectionBlock","$side","selectHorizontally","mods","nodePos","nodeLen","isIgnorable","skipIgnoredNodesLeft","moveNode","moveOffset","isBlockNode","setSelFocus","skipIgnoredNodesRight","domObserver","setCurSelection","selectionToDOM","selectVertically","beyond","stopNativeHorizontalDelete","nextNode","switchEditable","captureKeyDown","ctrlKey","metaKey","altKey","shiftKey","getMods","safariDownArrowBug","readDOMChange","typeOver","addedNodes","origin","lastSelectionTime","lastSelectionOrigin","newSel","selectionFromDOM","$before","preferredPos","preferredSide","from_","to_","lastKeyCode","startDoc","editableContent","parseBetween","compare","lastKeyCodeTime","change","endA","endB","adjust","findDiff","domChangeCount","nextSel","resolveNoCache","inlineChange","lastIOSEnter","old","$newStart","$newEnd","skipClosingAndOpening","$next","looksLikeJoin","suppressSelectionUpdates","markChange","$from1","chFrom","chTo","curMarks","prevMarks","isMarkChange","parsedSel","selectionBetween","fromEnd","mayOpen","serializeForClipboard","serializer","detachedDoc","wrapMap","parseFromClipboard","plainText","inCode","asText","metas","firstTag","readHTML","contextNode","sliceData","addContext","closeRange","closeSlice","lastWrap","inLast","addToSibling","sibling","withWrappers","closeRight","wrapped","normalizeSiblings","thead","tbody","caption","colgroup","col","td","th","_detachedDoc","implementation","createHTMLDocument","observeOptions","childList","characterData","characterDataOldValue","attributeOldValue","subtree","useCharData","SelectionState","DOMObserver","handleDOMChange","flushingSoon","MutationObserver","mutations","removedNodes","flushSoon","flush","currentSelection","onCharData","prevValue","onSelectionChange","suppressingSelectionUpdates","forceFlush","observe","connectSelection","take","takeRecords","disconnect","disconnectSelection","ignoreSelectionChange","container","commonAncestorContainer","hasSelection","registerMutation","brs","cssChecked","whiteSpace","checkCSS","attributeName","compareObjs","WidgetType","noSpec","span","oldOffset","InlineType","inclusiveStart","inclusiveEnd","is","NodeType","local","buildTree","predicate","findInner","childOff","mapInner","newLocal","onRemove","oldChildren","oldEnd","newEnd","dSize","mustRebuild","fromLocal","toLocal","childOffset","childNode","built","gather","mapAndGatherRemainingDecorations","byPos","mapChildren","addInner","baseOffset","takeSpansForNode","moveSpans","withoutNulls","removeInner","dec","localSet","DecorationGroup","removeOverlap","localsInner","members","spans","hasNulls","localStart","working","insertAhead","viewDecorations","cursorWrapper","sorted","newRefTop","refDOM","refTop","innerHeight","localRect","setActive","preventScroll","replaceParentNodeOfType","findParentNodeOfType","newTr","replaceNodeAtPos","replaceSelectedNode","isNodeSelection","cloneTr","NodeSelection","setTextSelection","nextSelection","isSelectableNode","shouldSelectNode","safeInsert","tryToReplace","hasPosition","$insertPos","isEmptyParagraph","canInsert","equalNodeType","removeNodeAtPos","tableNodeTypes","roles","PMNode","createCell","cellType","isRectSelected","TableMap","cells","selectedCells","transpose","column","convertTableNodeToArrayOfRows","tableNode","rows","rowIndex","rowCells","colIndex","cellPos","cell","convertArrayOfRowsToTableNode","arrayOfNodes","rowsPM","row","newCell","oldCell","moveRowInArrayOfRows","direction","indexesOrigin","indexesTarget","rowsExtracted","positionOffset","directionOverride","checkInvalidMovements","errorMessage","originIndex","targets","findParentNode","findParentNodeClosestToPos","findParentDomRef","domAtPos","findDomRefAtPos","hasParentNode","findPositionOfNodeBefore","maybeSelection","descend","findChildren","findChildrenByType","findTable","isCellSelection","CellSelection","isTableSelected","getCellsInColumn","columnIndex","cellsInRect","acc","getCellsInRow","select","isRowSelection","findCellClosestToPos","selRect","cellsInFirstRow","cellsInLastRow","selectColumn","selectRow","cloneRowAt","rowPos","cloneRow","rowWidth","rowSpanCells","foundCells","filterCellsInRow","rowspan","setCellAttrs","removeColumnAt","removeTable","removeRowAt","findCellRectClosestToPos","findTableClosestToPos","getSelectionRangeInColumn","maybeEndIndex","indexes","maybeCells","firstSelectedColumnCells","firstRowCells","headCell","columnCells","getSelectionRangeInRow","firstSelectedRowCells","firstColumnCells","addColumn","originRowIndex","targetRowIndex","opts","tryToFit","indexesOriginRow","indexesTargetRow","newTable","moveTableRow","indexesOriginColumn","indexesTargetColumn","moveTableColumn","clonePreviousRow","cloneRowIndex","addRow","pmTableRect","cellTransform","rowsCount","colsCount","withHeaderRow","tableCell","tableHeader","tableRow","headerCells","wrapInList","listType","doJoin","outerRange","$insert","joinBefore","splitDepth","splitPos","doWrapInList","itemType","grandParent","keepItem","endOfList","liftToOuterList","indexBefore","liftOutOfList","nestedBefore","markEnd","markStart","matchStart","matchEnd","textStart","textEnd","getMarksBetween","excluded","transformPasted","isLink","splitToDefaultListItem","toggletype","isList","bullet_list","ordered_list","todo_list","parentList","wrapIn","rangeHasMark","ref$1","Rebaseable","CollabState","unconfirmed","collabKey","unconfirmedFrom","clientIDs","collabState","ourID","ours","nUnconfirmed","over","rebaseSteps","newCollabState","mapSelectionBackward","between","_origins","markItem","nodeItem","childAfter","endPos","nodeEqualsType","findSelectedNodeOfType","Ruler","__rules__","__cache__","__find__","__compile__","chains","enabled","altName","at","opt","beforeName","ruleName","afterName","enable","ignoreInvalid","idx","enableOnly","disable","getRules","chainName","Token","nesting","markup","info","hidden","attrIndex","attrPush","attrData","attrSet","attrGet","attrJoin","8","9","10","12","13","16","17","18","20","27","32","33","34","35","36","37","38","39","40","44","45","46","59","61","91","92","106","107","108","109","110","111","144","145","160","161","162","163","164","165","173","186","187","188","189","190","191","192","219","220","221","222","229","48","49","50","51","52","53","54","55","56","57","brokenModifierNames","normalizeKeyName","ctrl","mod","modifiers","bindings","keydownHandler","baseName","keyName","isChar","direct","fromCode","withShift","matchHtmlRegExp","substring","readFromCache","addToCache","cachePos","Rect","problems","freshColWidth","colwidth","colspan","findCell","colCount","nextCell","axis","rectBetween","leftA","rightA","topA","bottomA","leftB","rightB","topB","bottomB","positionAt","rowStart","rowEnd","rowEndIndex","tableRole","hasRowSpan","rowNode","prevRow","findWidth","mapPos","colWidths","cellNode","w","colW","widthIndex","expectedPos","missing","tableMap","badWidths","colWidth","findBadColWidths","computeMap","cellAround","isInTable","selectionCell","$anchorCell","$headCell","role","cellNear","pointsAtCell","moveCellForward","inSameTable","$a","$b","setAttr","removeColSpan","addColSpan","columnIsHeader","headerCell","header_cell","tableChanged","rowSelection","isColSelection","colSelection","rowContent","cellRect","extraLeft","extraRight","forEachCell","anchorTop","headTop","anchorBot","headBot","anchorRect","headRect","anchorLeft","headLeft","anchorRight","headRight","anchorCell","CellBookmark","drawCellSelection","pastedCells","fitSlice","widths","ensureRectangular","clipCells","newWidth","newHeight","newRows","isolateHorizontal","cellTop","cellLeft","isolateVertical","updatePos","insertCells","tableStart","recomp","emptyHead","emptyRow","growTable","arrow","shiftArrow","deleteCellSelection","maybeSetSelection","atEndOfCell","$cell","baseContent","handleTripleClick","handleMouseDown","startEvent","startDOMCell","domInCell","setCellSelection","cellUnderMouse","starting","dirStr","mousePos","fixTablesKey","fixTables","tablePos","mustAdd","prob","tableNodeType","fixTable","changedDescendants","curSize","selectedRect","refColumn","addColumnBefore","addColumnAfter","removeColumn","mapStart","deleteColumn","rowIsHeader","refRow","addRowBefore","addRowAfter","removeRow","nextRow","newPos","deleteRow","isEmpty","mergeCells","indexTop","indexLeft","indexBottom","indexRight","cellsOverlapRectangle","mergedPos","mergedCell","splitCell","splitCellWithType","getCellType","cellWrapping","baseAttrs","lastCell","setCellAttr","isHeaderEnabledByType","cellPositions","toggleHeader","useDeprecatedLogic","deprecated_toggleHeader","isHeaderRowEnabled","isHeaderColumnEnabled","selectionStartsAt","cellsRect","newType","relativeCellPos","toggleHeaderRow","toggleHeaderColumn","toggleHeaderCell","goToNextCell","findNextCell","deleteTable","TableView","cellMinWidth","updateColumns","overrideCol","overrideValue","totalWidth","fixedWidth","hasWidth","cssWidth","minWidth","record","columnResizing","View","ResizeState","activeHandle","mousemove","handleWidth","lastColumnResizable","pluginState","domCellAround","edgeCell","updateHandle","handleMouseMove","mouseleave","handleMouseLeave","mousedown","domWidth","offsetWidth","currentColWidth","mapIndex","zeroes","updateColumnWidth","draggedWidth","setDragging","which","dragged","displayColumnWidth","startWidth","handleDecorations","setHandle","tableEditing","tableEditingKey","createSelectionBetween","allowTableNodeSelection","afterFrom","beforeTo","isCellBoundarySelection","fromCellBoundaryNode","toCellBoundaryNode","isTextSelectionAcrossCells","normalizeSelection","action","decode","open_tag","close_tag","HTML_TAG_RE","HTML_OPEN_CLOSE_TAG_RE","tokenize","scanned","scanDelims","delimiters","jump","can_open","can_close","postProcess","startDelim","endDelim","loneMarkers","isStrong","__webpack_amd_options__","high","fault","highlight","secondBest","settings","subset","listLanguages","relevance","language","getLanguage","syntax","registerAlias","alias","registerAliases","languageName","addText","tail","addKeyword","openNode","closeNode","addSublanguage","rootNode","classPrefix","closeAllNodes","finalize","toHTML","configure","__emitter","errorRaised","emitter","deepFreeze","freeze","objIsFunction","isFrozen","Response","escapeHTML","inherit","original","objects","nodeStream","_nodeStream","mergeStreams","highlighted","processed","nodeStack","selectStream","attr","emitsWrappingTags","HTMLRenderer","parseTree","walk","sublanguage","TokenTreeEmitter","builder","_walk","TokenTree","_collapse","C_NUMBER_RE","BACKSLASH_ESCAPE","begin","APOS_STRING_MODE","illegal","QUOTE_STRING_MODE","PHRASAL_WORDS_MODE","COMMENT","modeOptions","C_LINE_COMMENT_MODE","C_BLOCK_COMMENT_MODE","HASH_COMMENT_MODE","NUMBER_MODE","C_NUMBER_MODE","BINARY_NUMBER_MODE","CSS_NUMBER_MODE","NUMBER_RE","REGEXP_MODE","TITLE_MODE","UNDERSCORE_TITLE_MODE","METHOD_GUARD","MODES","IDENT_RE","UNDERSCORE_IDENT_RE","BINARY_NUMBER_RE","RE_STARTERS_RE","SHEBANG","beginShebang","binary","resp","ignoreMatch","END_SAME_AS_BEGIN","_beginMatch","COMMON_KEYWORDS","compileLanguage","langRe","case_insensitive","MultiRegex","matchIndexes","regexes","matchAt","countMatchGroups","terminators","matcherRe","regexps","separator","backreferenceRe","numCaptures","ret","matchData","ResumableMultiRegex","multiRegexes","regexIndex","addRule","getMatcher","resumingScanAtSamePosition","m2","considerAll","skipIfhasPrecedingOrTrailingDot","compileMode","cmode","compiled","__beforeBegin","keywords","beginKeywords","keywordPattern","$pattern","rawKeywords","caseInsensitive","compiledKeywords","splitAndCompile","keywordList","keyword","pair","scoreForKeyword","compileKeywords","lexemes","keywordPatternRe","beginRe","endSameAsBegin","endsWithParent","endRe","terminator_end","illegalRe","variants","cached_variants","variant","dependencyOnParent","starts","expandOrCloneMode","mm","buildModeRegex","providedScore","commonKeyword","detectedLanguage","unknownLanguage","autoDetect","hljs","ignoreIllegals","detectectLanguage","autodetect","domProps","VuePlugin","install","escape$1","inherit$1","nodeStream$1","mergeStreams$1","NO_MATCH","ArrayProto","aliases","SAFE_MODE","fixMarkupRe","LANGUAGE_NOT_FOUND","PLAINTEXT_LANGUAGE","disableAutodetect","noHighlightRe","languageDetectRe","tabReplace","useBR","shouldNotHighlight","continuation","fire","_highlight","codeToHighlight","keywordData","matchText","processBuffer","subLanguage","modeBuffer","continuations","processSubLanguage","buf","keywordRelevance","processKeywords","startNewMode","doIgnore","lexeme","resumeScanAtSamePosition","doBeginMatch","newMode","excludeBegin","returnBegin","doEndMatch","matchPlusRemainder","endMode","endOfMode","endsParent","returnEnd","excludeEnd","lastMatch","processLexeme","textBeforeMatch","badRule","iterations","md","processContinuations","processedCount","illegalBy","msg","sofar","languageSubset","justTextHighlightResult","autoDetection","second_best","fixMarkup","highlightBlock","blockLanguage","originalStream","resultNode","prevClassName","currentLang","resultLang","buildClassName","relavance","initHighlighting","querySelectorAll","aliasList","lang","userOptions","initHighlightingOnLoad","languageDefinition","rawDefinition","requireLanguage","addPlugin","vuePlugin","debugMode","safeMode","versionString","HLJS","formatter","EConstructor","FormattedError","eval","EvalError","reference","ReferenceError","uri","URIError","fmt","precision","argIndex","leadingZero","nextArg","slurpNumber","digits","parseFloat","toFixed","vsprintf","replacements","log","printf","helpers","Renderer","ParserCore","ParserBlock","ParserInline","LinkifyIt","punycode","zero","commonmark","BAD_PROTO_RE","GOOD_DATA_RE","validateLink","RECODE_HOSTNAME_FOR","normalizeLink","toASCII","normalizeLinkText","toUnicode","MarkdownIt","presetName","core","renderer","linkify","presets","components","ruler","rules2","ruler2","missed","State","parseInline","inlineMode","renderInline","encodeCache","exclude","keepEscaped","nextCode","defaultChars","getEncodeCache","componentChars","decodeCache","getDecodeCache","seq","b1","b2","b3","b4","slashes","Url","protocolPattern","portPattern","simplePathPattern","unwise","autoEscape","nonHostChars","hostEndingChars","hostnamePartPattern","hostnamePartStart","hostlessProtocol","slashedProtocol","slashesDenoteHost","lowerProto","hec","simplePath","atSign","hostEnd","parseHost","ipv6Hostname","hostparts","newpart","validParts","notHost","bit","qm","u","Any","Cc","Cf","Z","parseLinkLabel","parseLinkDestination","parseLinkTitle","disableNested","prevPos","labelEnd","posMax","oldPos","skipToken","lines","default_rules","code_inline","slf","renderAttrs","code_block","fence","tmpAttrs","tmpToken","langName","langPrefix","renderInlineAsText","renderToken","hardbreak","xhtmlOut","softbreak","breaks","html_block","html_inline","nextToken","needLf","_rules","Core","NEWLINES_RE","NULL_RE","isLinkClose","currentToken","ln","lastPos","htmlLinkLevel","fullUrl","urlText","links","blockTokens","pretest","RARE_RE","SCOPED_ABBR_TEST_RE","SCOPED_ABBR_RE","SCOPED_ABBR","tm","replaceFn","replace_scoped","inlineTokens","inside_autolink","replace_rare","blkIdx","typographer","QUOTE_TEST_RE","QUOTE_RE","replaceAt","process_inlines","thisLevel","lastChar","nextChar","isLastPunctChar","isNextPunctChar","isLastWhiteSpace","isNextWhiteSpace","canOpen","canClose","isSingle","openQuote","closeQuote","OUTER","single","quotes","StateCore","startLine","endLine","hasEmptyLines","maxNesting","skipEmptyLines","sCount","blkIndent","tight","outTokens","lineMax","getLine","bMarks","eMarks","escapedSplit","escapes","backTicked","lastBackTick","lineText","nextLine","columns","columnCount","aligns","tableLines","tbodyLines","tShift","getLines","mem","haveEndMarker","skipChars","skipSpaces","adjustTab","initial","lastLineEmpty","oldBMarks","oldBSCount","oldIndent","oldParentType","oldSCount","oldTShift","spaceAfterMarker","terminate","terminatorRules","wasOutdented","oldLineMax","bsCount","cnt","skipBulletListMarker","skipOrderedListMarker","contentStart","indent","indentAfterMarker","isOrdered","itemLines","listLines","listTokIdx","markerCharCode","markerValue","oldLIndent","oldTight","posAfterMarker","prevEmptyEnd","isTerminatingParagraph","markTightParagraphs","_endLine","destEndPos","destEndLineNo","label","references","skipSpacesBack","skipCharsBack","block_names","HTML_SEQUENCES","StateBlock","indent_found","ddIndent","keepLastLF","lineIndent","lineStart","_rules2","pushPending","isTerminatorChar","pmax","ESCAPED","labelStart","ref","parseReference","EMAIL_RE","AUTOLINK_RE","linkMatch","emailMatch","lc","isLetter","DIGITAL_RE","NAMED_RE","lastDelim","currDelim","curr","StateInline","pendingLevel","canSplitWord","left_flanking","right_flanking","fuzzyLink","fuzzyEmail","fuzzyIP","defaultSchemas","validate","http","src_auth","src_host_port_strict","src_path","no_http","src_domain","src_domain_root","src_port","src_host_terminator","mailto","src_email_name","src_host_strict","tlds_default","__opts__","tlds","__tlds__","untpl","tpl","src_tlds","onCompile","__tlds_replaced__","src_xn","email_fuzzy","tpl_email_fuzzy","link_fuzzy","tpl_link_fuzzy","link_no_ip_fuzzy","tpl_link_no_ip_fuzzy","host_fuzzy_test","tpl_host_fuzzy_test","schemaError","__compiled__","__schemas__","isRegExp","createValidator","slist","schema_test","src_ZPCc","schema_search","__index__","__text_cache__","resetScanCache","Match","__last_index__","__schema__","createMatch","schemas","definition","ml","me","tld_pos","testSchemaAt","keepOld","src_Any","src_Cc","src_Z","src_P","src_ZCc","src_pseudo_letter","src_ip4","src_host","tpl_host_fuzzy","tpl_host_no_ip_fuzzy","tpl_host_fuzzy_strict","tpl_host_port_fuzzy_strict","tpl_host_port_no_ip_fuzzy_strict","freeExports","freeModule","freeGlobal","maxInt","regexPunycode","regexNonASCII","regexSeparators","errors","stringFromCharCode","mapDomain","ucs2decode","extra","counter","ucs2encode","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","baseMinusTMin","basic","oldi","baseMinusT","codePoint","inputLength","handledCPCount","basicLength","q","currentValue","handledCPCountPlusOne","qMinusT","disableCheckboxes","useLabelWrapper","useLabelAfter","parentToken","targetLevel","isTodoItem","isParagraph","isListItem","startsWithTodoMarkdown","todoify","TokenConstructor","checkbox","disabledAttr","makeCheckbox","for","afterLabel","beginLabel","endLabel","labelAfter","scope","revocable","ProxyPolyfill","lastRevokeFn","validateProto","$Object","canCreateNullProtoObjects","objectCreate","getProto","throwRevoked","trap","unsafeHandler","proxy","isMethod","usingNew","propertyNames","propertyMap","real","prototypeOk","setProto","seal","horizontal_rule","heading","hard_break","em","strong","MarkdownParseState","tokenHandlers","noCloseToken","withoutTrailingNewline","noOp","maybeMerge","openMark","closeMark","parseTokens","toks","MarkdownParser","tokenizer","MarkdownSerializer","serialize","MarkdownSerializerState","renderContent","defaultMarkdownSerializer","wrapBlock","ensureNewLine","closeBlock","repeat","renderList","bullet","maxW","nStr","esc","quote","mixable","expelEnclosingWhitespace","_state","isPlainURL","_mark","backticksFor","ticks","delim","closed","inTightList","tightLists","flushClose","atBlank","delimMin","firstDelim","trailing","progress","leading","lead","trail","noEsc","markString","isTight","prevTight","getEnclosingWhitespace"],"mappings":"iFAAAA,EAAOC,QAAU,SAAUC,GACzB,IACE,QAASA,IACT,MAAOC,GACP,OAAO,K,gBCJX,IAAIC,EAASC,EAAQ,GACjBC,EAASD,EAAQ,IACjBE,EAAMF,EAAQ,GACdG,EAAMH,EAAQ,IACdI,EAAgBJ,EAAQ,IACxBK,EAAoBL,EAAQ,KAE5BM,EAAwBL,EAAO,OAC/BM,EAASR,EAAOQ,OAChBC,EAAwBH,EAAoBE,EAASA,GAAUA,EAAOE,eAAiBN,EAE3FR,EAAOC,QAAU,SAAUc,GAIvB,OAHGR,EAAII,EAAuBI,KAC1BN,GAAiBF,EAAIK,EAAQG,GAAOJ,EAAsBI,GAAQH,EAAOG,GACxEJ,EAAsBI,GAAQF,EAAsB,UAAYE,IAC9DJ,EAAsBI,K,kQCfjC,IAAIC,EAAQ,SAAUC,GACpB,OAAOA,GAAMA,EAAGC,MAAQA,MAAQD,GAIlCjB,EAAOC,QAELe,EAA2B,WAArB,oBAAOG,WAAP,cAAOA,cAA0BA,aACvCH,EAAuB,WAAjB,oBAAOI,OAAP,cAAOA,UAAsBA,SACnCJ,EAAqB,WAAf,oBAAOK,KAAP,cAAOA,QAAoBA,OACjCL,EAAuB,gBAAjB,IAAOZ,EAAP,cAAOA,KAAsBA,IAElC,WAAc,OAAOkB,KAArB,IAAmCC,SAAS,cAATA,K,oRCVtC,IAAIC,EAAOnB,EAAQ,IAMfoB,EAAWC,OAAOC,UAAUF,SAQhC,SAASG,EAAQC,GACf,MAA8B,mBAAvBJ,EAASK,KAAKD,GASvB,SAASE,EAAYF,GACnB,YAAsB,IAARA,EA4EhB,SAASG,EAASH,GAChB,OAAe,OAARA,GAA+B,WAAf,EAAOA,GAShC,SAASI,EAAcJ,GACrB,GAA2B,oBAAvBJ,EAASK,KAAKD,GAChB,OAAO,EAGT,IAAIF,EAAYD,OAAOQ,eAAeL,GACtC,OAAqB,OAAdF,GAAsBA,IAAcD,OAAOC,UAuCpD,SAASQ,EAAWN,GAClB,MAA8B,sBAAvBJ,EAASK,KAAKD,GAwEvB,SAASO,EAAQC,EAAKC,GAEpB,GAAID,QAUJ,GALmB,WAAf,EAAOA,KAETA,EAAM,CAACA,IAGLT,EAAQS,GAEV,IAAK,IAAIE,EAAI,EAAGC,EAAIH,EAAII,OAAQF,EAAIC,EAAGD,IACrCD,EAAGR,KAAK,KAAMO,EAAIE,GAAIA,EAAGF,QAI3B,IAAK,IAAIK,KAAOL,EACVX,OAAOC,UAAUgB,eAAeb,KAAKO,EAAKK,IAC5CJ,EAAGR,KAAK,KAAMO,EAAIK,GAAMA,EAAKL,GA2ErCrC,EAAOC,QAAU,CACf2B,QAASA,EACTgB,cA1RF,SAAuBf,GACrB,MAA8B,yBAAvBJ,EAASK,KAAKD,IA0RrBgB,SAtSF,SAAkBhB,GAChB,OAAe,OAARA,IAAiBE,EAAYF,IAA4B,OAApBA,EAAIiB,cAAyBf,EAAYF,EAAIiB,cAChD,mBAA7BjB,EAAIiB,YAAYD,UAA2BhB,EAAIiB,YAAYD,SAAShB,IAqShFkB,WAlRF,SAAoBlB,GAClB,MAA4B,oBAAbmB,UAA8BnB,aAAemB,UAkR5DC,kBAzQF,SAA2BpB,GAOzB,MAL4B,oBAAhBqB,aAAiCA,YAAYC,OAC9CD,YAAYC,OAAOtB,GAElBA,GAASA,EAAIuB,QAAYvB,EAAIuB,kBAAkBF,aAqQ3DG,SA1PF,SAAkBxB,GAChB,MAAsB,iBAARA,GA0PdyB,SAjPF,SAAkBzB,GAChB,MAAsB,iBAARA,GAiPdG,SAAUA,EACVC,cAAeA,EACfF,YAAaA,EACbwB,OAlNF,SAAgB1B,GACd,MAA8B,kBAAvBJ,EAASK,KAAKD,IAkNrB2B,OAzMF,SAAgB3B,GACd,MAA8B,kBAAvBJ,EAASK,KAAKD,IAyMrB4B,OAhMF,SAAgB5B,GACd,MAA8B,kBAAvBJ,EAASK,KAAKD,IAgMrBM,WAAYA,EACZuB,SA9KF,SAAkB7B,GAChB,OAAOG,EAASH,IAAQM,EAAWN,EAAI8B,OA8KvCC,kBArKF,SAA2B/B,GACzB,MAAkC,oBAApBgC,iBAAmChC,aAAegC,iBAqKhEC,qBAzIF,WACE,OAAyB,oBAAdC,WAAoD,gBAAtBA,UAAUC,SACY,iBAAtBD,UAAUC,SACY,OAAtBD,UAAUC,WAI/B,oBAAX5C,QACa,oBAAb6C,WAkIT7B,QAASA,EACT8B,MAvEF,SAASA,IACP,IAAIC,EAAS,GACb,SAASC,EAAYvC,EAAKa,GACpBT,EAAckC,EAAOzB,KAAST,EAAcJ,GAC9CsC,EAAOzB,GAAOwB,EAAMC,EAAOzB,GAAMb,GACxBI,EAAcJ,GACvBsC,EAAOzB,GAAOwB,EAAM,GAAIrC,GACfD,EAAQC,GACjBsC,EAAOzB,GAAOb,EAAIwC,QAElBF,EAAOzB,GAAOb,EAIlB,IAAK,IAAIU,EAAI,EAAGC,EAAI8B,UAAU7B,OAAQF,EAAIC,EAAGD,IAC3CH,EAAQkC,UAAU/B,GAAI6B,GAExB,OAAOD,GAuDPI,OA5CF,SAAgBC,EAAGC,EAAGC,GAQpB,OAPAtC,EAAQqC,GAAG,SAAqB5C,EAAKa,GAEjC8B,EAAE9B,GADAgC,GAA0B,mBAAR7C,EACXL,EAAKK,EAAK6C,GAEV7C,KAGN2C,GAqCPG,KAhKF,SAAcC,GACZ,OAAOA,EAAIC,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,KAgK/CC,SA7BF,SAAkBC,GAIhB,OAH8B,QAA1BA,EAAQC,WAAW,KACrBD,EAAUA,EAAQV,MAAM,IAEnBU,K,cCpUT,IAAIpC,EAAiB,GAAGA,eAExB3C,EAAOC,QAAU,SAAUgB,EAAIyB,GAC7B,OAAOC,EAAeb,KAAKb,EAAIyB,K,gBCHjC,IAAIV,EAAW3B,EAAQ,GAEvBL,EAAOC,QAAU,SAAUgB,GACzB,IAAKe,EAASf,GACZ,MAAMgE,UAAUC,OAAOjE,GAAM,qBAC7B,OAAOA,I,mPCLXjB,EAAOC,QAAU,SAAUgB,GACzB,MAAqB,WAAd,EAAOA,GAAyB,OAAPA,EAA4B,mBAAPA,I,gBCDvD,IAAIkE,EAAQ9E,EAAQ,GAGpBL,EAAOC,SAAWkF,GAAM,WACtB,OAA8E,GAAvEzD,OAAO0D,eAAe,GAAI,EAAG,CAAEC,IAAK,WAAc,OAAO,KAAQ,O,gBCJ1E,IAAIC,EAAcjF,EAAQ,GACtBkF,EAAiBlF,EAAQ,IACzBmF,EAAWnF,EAAQ,GACnBoF,EAAcpF,EAAQ,IAEtBqF,EAAuBhE,OAAO0D,eAIlCnF,EAAQ0F,EAAIL,EAAcI,EAAuB,SAAwBE,EAAGC,EAAGC,GAI7E,GAHAN,EAASI,GACTC,EAAIJ,EAAYI,GAAG,GACnBL,EAASM,GACLP,EAAgB,IAClB,OAAOG,EAAqBE,EAAGC,EAAGC,GAClC,MAAO3F,IACT,GAAI,QAAS2F,GAAc,QAASA,EAAY,MAAMb,UAAU,2BAEhE,MADI,UAAWa,IAAYF,EAAEC,GAAKC,EAAWC,OACtCH,I,gBClBT,IAAIN,EAAcjF,EAAQ,GACtB2F,EAAuB3F,EAAQ,GAC/B4F,EAA2B5F,EAAQ,IAEvCL,EAAOC,QAAUqF,EAAc,SAAUY,EAAQxD,EAAKqD,GACpD,OAAOC,EAAqBL,EAAEO,EAAQxD,EAAKuD,EAAyB,EAAGF,KACrE,SAAUG,EAAQxD,EAAKqD,GAEzB,OADAG,EAAOxD,GAAOqD,EACPG,I,qPCRT,IAAI9F,EAASC,EAAQ,GACjB8F,EAA2B9F,EAAQ,IAAmDsF,EACtFS,EAA8B/F,EAAQ,GACtCgG,EAAWhG,EAAQ,IACnBiG,EAAYjG,EAAQ,IACpBkG,EAA4BlG,EAAQ,KACpCmG,EAAWnG,EAAQ,IAgBvBL,EAAOC,QAAU,SAAUwG,EAASC,GAClC,IAGYC,EAAQjE,EAAKkE,EAAgBC,EAAgBC,EAHrDC,EAASN,EAAQE,OACjBK,EAASP,EAAQrG,OACjB6G,EAASR,EAAQS,KASrB,GANEP,EADEK,EACO5G,EACA6G,EACA7G,EAAO2G,IAAWT,EAAUS,EAAQ,KAEnC3G,EAAO2G,IAAW,IAAIpF,UAEtB,IAAKe,KAAOgE,EAAQ,CAQ9B,GAPAG,EAAiBH,EAAOhE,GAGtBkE,EAFEH,EAAQU,aACVL,EAAaX,EAAyBQ,EAAQjE,KACfoE,EAAWf,MACpBY,EAAOjE,IACtB8D,EAASQ,EAAStE,EAAMqE,GAAUE,EAAS,IAAM,KAAOvE,EAAK+D,EAAQW,cAE5CC,IAAnBT,EAA8B,CAC3C,GAAI,EAAOC,KAAP,EAAiCD,GAAgB,SACrDL,EAA0BM,EAAgBD,IAGxCH,EAAQa,MAASV,GAAkBA,EAAeU,OACpDlB,EAA4BS,EAAgB,QAAQ,GAGtDR,EAASM,EAAQjE,EAAKmE,EAAgBJ,M,gBCnD1C,IAAIrG,EAASC,EAAQ,GACjB+F,EAA8B/F,EAAQ,GACtCE,EAAMF,EAAQ,GACdiG,EAAYjG,EAAQ,IACpBkH,EAAgBlH,EAAQ,IACxBmH,EAAsBnH,EAAQ,IAE9BoH,EAAmBD,EAAoBnC,IACvCqC,EAAuBF,EAAoBG,QAC3CC,EAAW1C,OAAOA,QAAQ2C,MAAM,WAEnC7H,EAAOC,QAAU,SAAU2F,EAAGlD,EAAKqD,EAAOU,GACzC,IAGIqB,EAHAC,IAAStB,KAAYA,EAAQsB,OAC7BC,IAASvB,KAAYA,EAAQwB,WAC7Bd,IAAcV,KAAYA,EAAQU,YAElB,mBAATpB,IACS,iBAAPrD,GAAoBnC,EAAIwF,EAAO,SACxCK,EAA4BL,EAAO,OAAQrD,IAE7CoF,EAAQJ,EAAqB3B,IAClBW,SACToB,EAAMpB,OAASkB,EAASM,KAAmB,iBAAPxF,EAAkBA,EAAM,MAG5DkD,IAAMxF,GAIE2H,GAEAZ,GAAevB,EAAElD,KAC3BsF,GAAS,UAFFpC,EAAElD,GAIPsF,EAAQpC,EAAElD,GAAOqD,EAChBK,EAA4BR,EAAGlD,EAAKqD,IATnCiC,EAAQpC,EAAElD,GAAOqD,EAChBO,EAAU5D,EAAKqD,KAUrBxE,SAASI,UAAW,YAAY,WACjC,MAAsB,mBAARL,MAAsBmG,EAAiBnG,MAAMoF,QAAUa,EAAcjG,U,4OC3B/D,qBAA+B6G,EAAgB,KAA/C,I,oBAeW,mBAAqB/G,8BAAkCA,gBAAlCA,KAP7B,mBAAqBgH,mBAArB,EAOsFC,CAA9E,I,iBASH,cAE1B,OADAC,EAAU,IAACA,EAAD,EAAVA,EACOlH,8BAAkCA,gBAAlCA,KAAyDgH,IAAzDhH,qBAAP,K,cAeuB,gBACvB,IAAMmH,EAAa,cAAc,CAC7BC,QAD6B,EAE7BC,WAAW,GACZhC,GAHH,IAKMiC,EAAS,cAEX,OADAC,EAAOA,GAAPA,GACO,yBACH,cACI,IAAIC,EAAID,EAAR,GACA,OAAIJ,EAAJ,OACY,oBAAD,iBAA0B,EAAyBM,mBAAmBD,EAAtE,YAAsFC,mBAA7F,GAEQ,oBAAD,iBAA0B,EAAyBD,EAAnD,WAAP,MAUhB,MALA,MAAIE,cACAA,EAAM,IAANA,IAIAC,iCAAyCR,EAA7C,UAIOH,iBAA8BM,EAAM,EAAMM,GAAjD,IAHWZ,IAAeM,EAAM,EAAMM,GAAlC,K,YAeiB,cACrB,WAAIC,eAEOd,EAAgB,QAAac,EAApC,QAGGd,EAAgB,QAAvB,IAWG,IAAMA,EAAmB,gBAC5B,IAAMe,GAAN,IAAeH,uBACXI,EAAOf,IAqCX,MApCIa,oBAAeA,SAAfA,IAAJ,EASWA,oBAAeA,SAAfA,IAAJ,GAaCE,GAHCC,yBAAsBA,GAAvB,WAAyCA,GAA7C,SAAkEC,EAG9DF,IAFAA,cAIJ,IACIA,YAEJ,KAAIC,IAEAD,GADAC,QAGJ,IACID,GAAQE,EAARF,KAEJA,OAxBAA,EAAOJ,gBAAPI,GACA,IACIA,GAAQ,MAARA,KAEJ,MAAIA,YAAeA,SAAfA,KACAA,QAEJA,OAhBAA,GAAQ,mBAARA,EACA,cAAIF,IACAE,OACA,IACIA,GAAQG,UAAUD,EAAlBF,MAEJA,OA6BR,G,qBAUG,IAAMf,EAAa,kBAAMW,GAAN,S,sHA9J1B,I,EAAA,G,EAAA,S,2BACA,SAOA,IAAMQ,EAAwB,iBAAa,CAC1CC,QAAS,CACRC,cAAc,0BAGVC,EAA4C,gBAAsB,CACvEC,YAAaC,UAD0D,YAEvEC,SAAUD,UAAMC,YAGjB,2BAAqB,YAAK,OAAIN,gCAAJ,K,MAEXG,E,uGAaR,cACHI,kB,cAWG,cACHA,oB,OASG,cACHA,aAvDJ,aACA,SAuBA,IAAMA,QAbE,IAAQ1I,OAAP,IAAqCA,UAAtC,gBAAJ,IAAwEA,OAAP,gBAC7D2I,mFACA3I,qBAAuBA,UAAvBA,gBAIJ,IAAWA,OAAP,cACO,IAAI4I,EAAJ,SAAa5I,OAApB,eAEOA,qBAAuB,IAAI6I,EAAlC,Y,gBCrBR,IAAIC,EAAY7J,EAAQ,IAEpB8J,EAAMjJ,KAAKiJ,IAIfnK,EAAOC,QAAU,SAAUmK,GACzB,OAAOA,EAAW,EAAID,EAAID,EAAUE,GAAW,kBAAoB,I,gBCPrE,IAAIC,EAAyBhK,EAAQ,IAIrCL,EAAOC,QAAU,SAAUmK,GACzB,OAAO1I,OAAO2I,EAAuBD,M,cCLvCpK,EAAOC,QAAU,I,6BCMF,SAASqK,EACtBC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAGA,IAqBIC,EArBAtE,EAAmC,mBAAlB8D,EACjBA,EAAc9D,QACd8D,EAsDJ,GAnDIC,IACF/D,EAAQ+D,OAASA,EACjB/D,EAAQgE,gBAAkBA,EAC1BhE,EAAQuE,WAAY,GAIlBN,IACFjE,EAAQwE,YAAa,GAInBL,IACFnE,EAAQyE,SAAW,UAAYN,GAI7BC,GACFE,EAAO,SAAUI,IAEfA,EACEA,GACC7J,KAAK8J,QAAU9J,KAAK8J,OAAOC,YAC3B/J,KAAKgK,QAAUhK,KAAKgK,OAAOF,QAAU9J,KAAKgK,OAAOF,OAAOC,aAEZ,oBAAxBE,sBACrBJ,EAAUI,qBAGRZ,GACFA,EAAa7I,KAAKR,KAAM6J,GAGtBA,GAAWA,EAAQK,uBACrBL,EAAQK,sBAAsBC,IAAIZ,IAKtCpE,EAAQiF,aAAeX,GACdJ,IACTI,EAAOD,EACH,WACAH,EAAa7I,KACXR,MACCmF,EAAQwE,WAAa3J,KAAKgK,OAAShK,MAAMqK,MAAMC,SAASC,aAG3DlB,GAGFI,EACF,GAAItE,EAAQwE,WAAY,CAGtBxE,EAAQqF,cAAgBf,EAExB,IAAIgB,EAAiBtF,EAAQ+D,OAC7B/D,EAAQ+D,OAAS,SAAmCwB,EAAGb,GAErD,OADAJ,EAAKjJ,KAAKqJ,GACHY,EAAeC,EAAGb,QAEtB,CAEL,IAAIc,EAAWxF,EAAQyF,aACvBzF,EAAQyF,aAAeD,EACnB,GAAGE,OAAOF,EAAUlB,GACpB,CAACA,GAIT,MAAO,CACL9K,QAASsK,EACT9D,QAASA,GA/Fb,mC,cCAA,IAAIhF,EAAW,GAAGA,SAElBzB,EAAOC,QAAU,SAAUgB,GACzB,OAAOQ,EAASK,KAAKb,GAAIoD,MAAM,GAAI,K,gBCHrC,IAUI+H,EAAK/G,EAAK9E,EAVV8L,EAAkBhM,EAAQ,KAC1BD,EAASC,EAAQ,GACjB2B,EAAW3B,EAAQ,GACnB+F,EAA8B/F,EAAQ,GACtCiM,EAAYjM,EAAQ,GACpBC,EAASD,EAAQ,IACjBkM,EAAYlM,EAAQ,IACpBmM,EAAanM,EAAQ,IAErBoM,EAAUrM,EAAOqM,QAgBrB,GAAIJ,EAAiB,CACnB,IAAIK,EAAQpM,EAAOwH,QAAUxH,EAAOwH,MAAQ,IAAI2E,GAC5CE,EAAQD,EAAMrH,IACduH,EAAQF,EAAMnM,IACdsM,EAAQH,EAAMN,IAClBA,EAAM,SAAUnL,EAAI6L,GAGlB,OAFAA,EAASC,OAAS9L,EAClB4L,EAAM/K,KAAK4K,EAAOzL,EAAI6L,GACfA,GAETzH,EAAM,SAAUpE,GACd,OAAO0L,EAAM7K,KAAK4K,EAAOzL,IAAO,IAElCV,EAAM,SAAUU,GACd,OAAO2L,EAAM9K,KAAK4K,EAAOzL,QAEtB,CACL,IAAI+L,EAAQT,EAAU,SACtBC,EAAWQ,IAAS,EACpBZ,EAAM,SAAUnL,EAAI6L,GAGlB,OAFAA,EAASC,OAAS9L,EAClBmF,EAA4BnF,EAAI+L,EAAOF,GAChCA,GAETzH,EAAM,SAAUpE,GACd,OAAOqL,EAAUrL,EAAI+L,GAAS/L,EAAG+L,GAAS,IAE5CzM,EAAM,SAAUU,GACd,OAAOqL,EAAUrL,EAAI+L,IAIzBhN,EAAOC,QAAU,CACfmM,IAAKA,EACL/G,IAAKA,EACL9E,IAAKA,EACLoH,QAjDY,SAAU1G,GACtB,OAAOV,EAAIU,GAAMoE,EAAIpE,GAAMmL,EAAInL,EAAI,KAiDnCgM,UA9Cc,SAAUC,GACxB,OAAO,SAAUjM,GACf,IAAI6G,EACJ,IAAK9F,EAASf,KAAQ6G,EAAQzC,EAAIpE,IAAKoI,OAAS6D,EAC9C,MAAMjI,UAAU,0BAA4BiI,EAAO,aACnD,OAAOpF,M,cCnBb9H,EAAOC,QAAU,SAAUgB,GACzB,GAAUoG,MAANpG,EAAiB,MAAMgE,UAAU,wBAA0BhE,GAC/D,OAAOA,I,gBCJT,IAAIkM,EAAO9M,EAAQ,KACfD,EAASC,EAAQ,GAEjB+M,EAAY,SAAUC,GACxB,MAA0B,mBAAZA,EAAyBA,OAAWhG,GAGpDrH,EAAOC,QAAU,SAAUqN,EAAWC,GACpC,OAAOjJ,UAAU7B,OAAS,EAAI2K,EAAUD,EAAKG,KAAeF,EAAUhN,EAAOkN,IACzEH,EAAKG,IAAcH,EAAKG,GAAWC,IAAWnN,EAAOkN,IAAclN,EAAOkN,GAAWC,K,cCT3FvN,EAAOC,QAAU,SAAUuN,EAAQzH,GACjC,MAAO,CACLkC,aAAuB,EAATuF,GACdC,eAAyB,EAATD,GAChBE,WAAqB,EAATF,GACZzH,MAAOA,K,gBCJX,IAAI4H,EAAgBtN,EAAQ,IACxBgK,EAAyBhK,EAAQ,IAErCL,EAAOC,QAAU,SAAUgB,GACzB,OAAO0M,EAActD,EAAuBpJ,M,cCL9C,IAAI2M,EAAO1M,KAAK0M,KACZC,EAAQ3M,KAAK2M,MAIjB7N,EAAOC,QAAU,SAAUmK,GACzB,OAAO0D,MAAM1D,GAAYA,GAAY,GAAKA,EAAW,EAAIyD,EAAQD,GAAMxD,K,cCNzEpK,EAAOC,QAAU,I,iBCAjB,IAAImN,EAAY/M,EAAQ,KAGxBL,EAAOC,QAAU,SAAUqC,EAAIyL,EAAMtL,GAEnC,GADA2K,EAAU9K,QACG+E,IAAT0G,EAAoB,OAAOzL,EAC/B,OAAQG,GACN,KAAK,EAAG,OAAO,WACb,OAAOH,EAAGR,KAAKiM,IAEjB,KAAK,EAAG,OAAO,SAAUvJ,GACvB,OAAOlC,EAAGR,KAAKiM,EAAMvJ,IAEvB,KAAK,EAAG,OAAO,SAAUA,EAAGC,GAC1B,OAAOnC,EAAGR,KAAKiM,EAAMvJ,EAAGC,IAE1B,KAAK,EAAG,OAAO,SAAUD,EAAGC,EAAGuJ,GAC7B,OAAO1L,EAAGR,KAAKiM,EAAMvJ,EAAGC,EAAGuJ,IAG/B,OAAO,WACL,OAAO1L,EAAG2L,MAAMF,EAAMzJ,c,gBCrB1B,IAmDI4J,EAnDA1I,EAAWnF,EAAQ,GACnB8N,EAAmB9N,EAAQ,KAC3B+N,EAAc/N,EAAQ,IACtBmM,EAAanM,EAAQ,IACrBgO,EAAOhO,EAAQ,KACfiO,EAAwBjO,EAAQ,IAChCkM,EAAYlM,EAAQ,IAMpBkO,EAAWhC,EAAU,YAErBiC,EAAmB,aAEnBC,EAAY,SAAU1J,GACxB,MAAO2J,WAAmB3J,EAAnB2J,cAmCLC,EAAkB,WACpB,IAEET,EAAkBjK,SAAS2K,QAAU,IAAIC,cAAc,YACvD,MAAO1O,IA1BoB,IAIzB2O,EAFAC,EAyBJJ,EAAkBT,EApCY,SAAUA,GACxCA,EAAgBc,MAAMP,EAAU,KAChCP,EAAgBe,QAChB,IAAIC,EAAOhB,EAAgBiB,aAAazN,OAExC,OADAwM,EAAkB,KACXgB,EA+B6BE,CAA0BlB,KAzB1Da,EAAST,EAAsB,WAG5Be,MAAMC,QAAU,OACvBjB,EAAKkB,YAAYR,GAEjBA,EAAOS,IAAMtK,OALJ,gBAMT4J,EAAiBC,EAAOU,cAAcxL,UACvByL,OACfZ,EAAeE,MAAMP,EAAU,sBAC/BK,EAAeG,QACRH,EAAea,GAgBtB,IADA,IAAIlN,EAAS2L,EAAY3L,OAClBA,YAAiBkM,EAAe,UAAYP,EAAY3L,IAC/D,OAAOkM,KAGTnC,EAAW+B,IAAY,EAIvBvO,EAAOC,QAAUyB,OAAOkO,QAAU,SAAgBhK,EAAGiK,GACnD,IAAI1L,EAQJ,OAPU,OAANyB,GACF4I,EAAgB,UAAchJ,EAASI,GACvCzB,EAAS,IAAIqK,EACbA,EAAgB,UAAc,KAE9BrK,EAAOoK,GAAY3I,GACdzB,EAASwK,SACMtH,IAAfwI,EAA2B1L,EAASgK,EAAiBhK,EAAQ0L,K,gBC5EtE,IAAIzK,EAAiB/E,EAAQ,GAAuCsF,EAChEpF,EAAMF,EAAQ,GAGdyP,EAFkBzP,EAAQ,EAEV0P,CAAgB,eAEpC/P,EAAOC,QAAU,SAAUgB,EAAI+O,EAAK/I,GAC9BhG,IAAOV,EAAIU,EAAKgG,EAAShG,EAAKA,EAAGU,UAAWmO,IAC9C1K,EAAenE,EAAI6O,EAAe,CAAErC,cAAc,EAAM1H,MAAOiK,M,gBCRnE,IAAIhO,EAAW3B,EAAQ,GAMvBL,EAAOC,QAAU,SAAUgQ,EAAOC,GAChC,IAAKlO,EAASiO,GAAQ,OAAOA,EAC7B,IAAI3N,EAAIT,EACR,GAAIqO,GAAoD,mBAAxB5N,EAAK2N,EAAMxO,YAA4BO,EAASH,EAAMS,EAAGR,KAAKmO,IAAS,OAAOpO,EAC9G,GAAmC,mBAAvBS,EAAK2N,EAAME,WAA2BnO,EAASH,EAAMS,EAAGR,KAAKmO,IAAS,OAAOpO,EACzF,IAAKqO,GAAoD,mBAAxB5N,EAAK2N,EAAMxO,YAA4BO,EAASH,EAAMS,EAAGR,KAAKmO,IAAS,OAAOpO,EAC/G,MAAMoD,UAAU,6C,cCZlBjF,EAAOC,SAAU,G,gBCAjB,IAAIqF,EAAcjF,EAAQ,GACtB8E,EAAQ9E,EAAQ,GAChBE,EAAMF,EAAQ,GAEd+E,EAAiB1D,OAAO0D,eACxBgL,EAAQ,GAERC,EAAU,SAAUpP,GAAM,MAAMA,GAEpCjB,EAAOC,QAAU,SAAUqQ,EAAa7J,GACtC,GAAIlG,EAAI6P,EAAOE,GAAc,OAAOF,EAAME,GACrC7J,IAASA,EAAU,IACxB,IAAI8G,EAAS,GAAG+C,GACZC,IAAYhQ,EAAIkG,EAAS,cAAeA,EAAQ8J,UAChDC,EAAYjQ,EAAIkG,EAAS,GAAKA,EAAQ,GAAK4J,EAC3CI,EAAYlQ,EAAIkG,EAAS,GAAKA,EAAQ,QAAKY,EAE/C,OAAO+I,EAAME,KAAiB/C,IAAWpI,GAAM,WAC7C,GAAIoL,IAAcjL,EAAa,OAAO,EACtC,IAAIM,EAAI,CAAEnD,QAAS,GAEf8N,EAAWnL,EAAeQ,EAAG,EAAG,CAAEqC,YAAY,EAAM5C,IAAKgL,IACxDzK,EAAE,GAAK,EAEZ2H,EAAOzL,KAAK8D,EAAG4K,EAAWC,Q,gBCxB9B,IAAItL,EAAQ9E,EAAQ,GAChBqQ,EAAUrQ,EAAQ,IAElBwH,EAAQ,GAAGA,MAGf7H,EAAOC,QAAUkF,GAAM,WAGrB,OAAQzD,OAAO,KAAKiP,qBAAqB,MACtC,SAAU1P,GACb,MAAsB,UAAfyP,EAAQzP,GAAkB4G,EAAM/F,KAAKb,EAAI,IAAMS,OAAOT,IAC3DS,Q,gBCZJ,IAAItB,EAASC,EAAQ,GACjB+F,EAA8B/F,EAAQ,GAE1CL,EAAOC,QAAU,SAAUyC,EAAKqD,GAC9B,IACEK,EAA4BhG,EAAQsC,EAAKqD,GACzC,MAAO5F,GACPC,EAAOsC,GAAOqD,EACd,OAAOA,I,gBCRX,IAAI3F,EAASC,EAAQ,GACjBiG,EAAYjG,EAAQ,IAGpBqM,EAAQtM,EADC,uBACiBkG,EADjB,qBACmC,IAEhDtG,EAAOC,QAAUyM,G,gBCNjB,IAAIpM,EAASD,EAAQ,IACjBG,EAAMH,EAAQ,IAEduQ,EAAOtQ,EAAO,QAElBN,EAAOC,QAAU,SAAUyC,GACzB,OAAOkO,EAAKlO,KAASkO,EAAKlO,GAAOlC,EAAIkC,M,cCNvC,IAAImO,EAAK,EACLC,EAAU5P,KAAK6P,SAEnB/Q,EAAOC,QAAU,SAAUyC,GACzB,MAAO,UAAYwC,YAAemC,IAAR3E,EAAoB,GAAKA,GAAO,QAAUmO,EAAKC,GAASrP,SAAS,M,cCH7FzB,EAAOC,QAAU,CACf,cACA,iBACA,gBACA,uBACA,iBACA,WACA,Y,cCNF,IAGM+Q,EAAmBC,OAAOD,kBACH,iBAK7BhR,EAAOC,QAAU,CACfiR,oBAV0B,QAW1BC,WATiB,IAUjBH,mBACAI,0BANgC,K,6BCRlC,IAAIC,EAAIhR,EAAQ,IACZiR,EAA4BjR,EAAQ,KACpC6B,EAAiB7B,EAAQ,IACzBkR,EAAiBlR,EAAQ,IACzBmR,EAAiBnR,EAAQ,IACzB+F,EAA8B/F,EAAQ,GACtCgG,EAAWhG,EAAQ,IACnB0P,EAAkB1P,EAAQ,GAC1BoR,EAAUpR,EAAQ,IAClBqR,EAAYrR,EAAQ,IACpBsR,EAAgBtR,EAAQ,IAExBuR,EAAoBD,EAAcC,kBAClCC,EAAyBF,EAAcE,uBACvCC,EAAW/B,EAAgB,YAK3BgC,EAAa,WAAc,OAAOzQ,MAEtCtB,EAAOC,QAAU,SAAU+R,EAAUC,EAAMC,EAAqBC,EAAMC,EAASC,EAAQC,GACrFhB,EAA0BY,EAAqBD,EAAME,GAErD,IAkBII,EAA0BC,EAASC,EAlBnCC,EAAqB,SAAUC,GACjC,GAAIA,IAASP,GAAWQ,EAAiB,OAAOA,EAChD,IAAKf,GAA0Bc,KAAQE,EAAmB,OAAOA,EAAkBF,GACnF,OAAQA,GACN,IAbK,OAcL,IAbO,SAcP,IAbQ,UAaM,OAAO,WAAqB,OAAO,IAAIT,EAAoB5Q,KAAMqR,IAC/E,OAAO,WAAc,OAAO,IAAIT,EAAoB5Q,QAGpDwO,EAAgBmC,EAAO,YACvBa,GAAwB,EACxBD,EAAoBb,EAASrQ,UAC7BoR,EAAiBF,EAAkBf,IAClCe,EAAkB,eAClBT,GAAWS,EAAkBT,GAC9BQ,GAAmBf,GAA0BkB,GAAkBL,EAAmBN,GAClFY,EAA4B,SAARf,GAAkBY,EAAkBI,SAA4BF,EAiCxF,GA7BIC,IACFT,EAA2BrQ,EAAe8Q,EAAkBlR,KAAK,IAAIkQ,IACjEJ,IAAsBlQ,OAAOC,WAAa4Q,EAAyBJ,OAChEV,GAAWvP,EAAeqQ,KAA8BX,IACvDL,EACFA,EAAegB,EAA0BX,GACa,mBAAtCW,EAAyBT,IACzC1L,EAA4BmM,EAA0BT,EAAUC,IAIpEP,EAAee,EAA0BzC,GAAe,GAAM,GAC1D2B,IAASC,EAAU5B,GAAiBiC,KAzCjC,UA8CPK,GAAqBW,GA9Cd,WA8CgCA,EAAehS,OACxD+R,GAAwB,EACxBF,EAAkB,WAAoB,OAAOG,EAAejR,KAAKR,QAI7DmQ,IAAWa,GAAWO,EAAkBf,KAAcc,GAC1DxM,EAA4ByM,EAAmBf,EAAUc,GAE3DlB,EAAUO,GAAQW,EAGdR,EAMF,GALAI,EAAU,CACRU,OAAQR,EA5DD,UA6DP9B,KAAMyB,EAASO,EAAkBF,EA9D5B,QA+DLO,QAASP,EA7DD,YA+DNJ,EAAQ,IAAKG,KAAOD,GAClBX,GAA0BiB,KAA2BL,KAAOI,KAC9DxM,EAASwM,EAAmBJ,EAAKD,EAAQC,SAEtCpB,EAAE,CAAE1K,OAAQsL,EAAMkB,OAAO,EAAM/L,OAAQyK,GAA0BiB,GAAyBN,GAGnG,OAAOA,I,gBCxFT,IAGIY,EAAO,GAEXA,EALsB/S,EAAQ,EAEV0P,CAAgB,gBAGd,IAEtB/P,EAAOC,QAA2B,eAAjBiF,OAAOkO,I,6BCNxB,IAYMC,EACAC,EAbFC,EAAclT,EAAQ,IACtBmT,EAAgBnT,EAAQ,KAExBoT,EAAaC,OAAO/R,UAAUzB,KAI9ByT,EAAgBzO,OAAOvD,UAAUkD,QAEjC+O,EAAcH,EAEdI,GACER,EAAM,IACNC,EAAM,MACVG,EAAW3R,KAAKuR,EAAK,KACrBI,EAAW3R,KAAKwR,EAAK,KACI,IAAlBD,EAAIS,WAAqC,IAAlBR,EAAIQ,WAGhCC,EAAgBP,EAAcO,eAAiBP,EAAcQ,aAG7DC,OAAuC5M,IAAvB,OAAOnH,KAAK,IAAI,IAExB2T,GAA4BI,GAAiBF,KAGvDH,EAAc,SAAchP,GAC1B,IACIkP,EAAWI,EAAQC,EAAO5R,EAD1B6R,EAAK9S,KAEL+S,EAASN,GAAiBK,EAAGC,OAC7BC,EAAQf,EAAYzR,KAAKsS,GACzB1N,EAAS0N,EAAG1N,OACZ6N,EAAa,EACbC,EAAU5P,EA+Cd,OA7CIyP,KAE0B,KAD5BC,EAAQA,EAAMzP,QAAQ,IAAK,KACjB4P,QAAQ,OAChBH,GAAS,KAGXE,EAAUtP,OAAON,GAAKP,MAAM+P,EAAGN,WAE3BM,EAAGN,UAAY,KAAOM,EAAGM,WAAaN,EAAGM,WAAuC,OAA1B9P,EAAIwP,EAAGN,UAAY,MAC3EpN,EAAS,OAASA,EAAS,IAC3B8N,EAAU,IAAMA,EAChBD,KAIFL,EAAS,IAAIR,OAAO,OAAShN,EAAS,IAAK4N,IAGzCL,IACFC,EAAS,IAAIR,OAAO,IAAMhN,EAAS,WAAY4N,IAE7CT,IAA0BC,EAAYM,EAAGN,WAE7CK,EAAQV,EAAW3R,KAAKuS,EAASH,EAASE,EAAII,GAE1CH,EACEF,GACFA,EAAMlE,MAAQkE,EAAMlE,MAAM5L,MAAMkQ,GAChCJ,EAAM,GAAKA,EAAM,GAAG9P,MAAMkQ,GAC1BJ,EAAMQ,MAAQP,EAAGN,UACjBM,EAAGN,WAAaK,EAAM,GAAG1R,QACpB2R,EAAGN,UAAY,EACbD,GAA4BM,IACrCC,EAAGN,UAAYM,EAAGhU,OAAS+T,EAAMQ,MAAQR,EAAM,GAAG1R,OAASqR,GAEzDG,GAAiBE,GAASA,EAAM1R,OAAS,GAG3CkR,EAAc7R,KAAKqS,EAAM,GAAID,GAAQ,WACnC,IAAK3R,EAAI,EAAGA,EAAI+B,UAAU7B,OAAS,EAAGF,SACf8E,IAAjB/C,UAAU/B,KAAkB4R,EAAM5R,QAAK8E,MAK1C8M,IAIXnU,EAAOC,QAAU2T,G,oPCtFjB,IAAIgB,EAGJA,EAAK,WACJ,OAAOtT,KADH,GAIL,IAECsT,EAAIA,GAAK,IAAIrT,SAAS,cAAb,GACR,MAAOsT,GAEc,YAAlB,oBAAOzT,OAAP,cAAOA,WAAqBwT,EAAIxT,QAOrCpB,EAAOC,QAAU2U,G,cClBjB,IAOIE,EACAC,EARAC,EAAUhV,EAAOC,QAAU,GAU/B,SAASgV,IACL,MAAM,IAAIC,MAAM,mCAEpB,SAASC,IACL,MAAM,IAAID,MAAM,qCAsBpB,SAASE,EAAWC,GAChB,GAAIP,IAAqBQ,WAErB,OAAOA,WAAWD,EAAK,GAG3B,IAAKP,IAAqBG,IAAqBH,IAAqBQ,WAEhE,OADAR,EAAmBQ,WACZA,WAAWD,EAAK,GAE3B,IAEI,OAAOP,EAAiBO,EAAK,GAC/B,MAAMR,GACJ,IAEI,OAAOC,EAAiBhT,KAAK,KAAMuT,EAAK,GAC1C,MAAMR,GAEJ,OAAOC,EAAiBhT,KAAKR,KAAM+T,EAAK,MAvCnD,WACG,IAEQP,EADsB,mBAAfQ,WACYA,WAEAL,EAEzB,MAAOJ,GACLC,EAAmBG,EAEvB,IAEQF,EADwB,mBAAjBQ,aACcA,aAEAJ,EAE3B,MAAON,GACLE,EAAqBI,GAjB5B,GAwED,IAEIK,EAFAC,EAAQ,GACRC,GAAW,EAEXC,GAAc,EAElB,SAASC,IACAF,GAAaF,IAGlBE,GAAW,EACPF,EAAa/S,OACbgT,EAAQD,EAAarJ,OAAOsJ,GAE5BE,GAAc,EAEdF,EAAMhT,QACNoT,KAIR,SAASA,IACL,IAAIH,EAAJ,CAGA,IAAII,EAAUV,EAAWQ,GACzBF,GAAW,EAGX,IADA,IAAIK,EAAMN,EAAMhT,OACVsT,GAAK,CAGP,IAFAP,EAAeC,EACfA,EAAQ,KACCE,EAAaI,GACdP,GACAA,EAAaG,GAAYK,MAGjCL,GAAc,EACdI,EAAMN,EAAMhT,OAEhB+S,EAAe,KACfE,GAAW,EAnEf,SAAyBO,GACrB,GAAIlB,IAAuBQ,aAEvB,OAAOA,aAAaU,GAGxB,IAAKlB,IAAuBI,IAAwBJ,IAAuBQ,aAEvE,OADAR,EAAqBQ,aACdA,aAAaU,GAExB,IAEWlB,EAAmBkB,GAC5B,MAAOpB,GACL,IAEI,OAAOE,EAAmBjT,KAAK,KAAMmU,GACvC,MAAOpB,GAGL,OAAOE,EAAmBjT,KAAKR,KAAM2U,KAgD7CC,CAAgBJ,IAiBpB,SAASK,EAAKd,EAAKe,GACf9U,KAAK+T,IAAMA,EACX/T,KAAK8U,MAAQA,EAYjB,SAASC,KA5BTrB,EAAQsB,SAAW,SAAUjB,GACzB,IAAIkB,EAAO,IAAIC,MAAMlS,UAAU7B,OAAS,GACxC,GAAI6B,UAAU7B,OAAS,EACnB,IAAK,IAAIF,EAAI,EAAGA,EAAI+B,UAAU7B,OAAQF,IAClCgU,EAAKhU,EAAI,GAAK+B,UAAU/B,GAGhCkT,EAAMgB,KAAK,IAAIN,EAAKd,EAAKkB,IACJ,IAAjBd,EAAMhT,QAAiBiT,GACvBN,EAAWS,IASnBM,EAAKxU,UAAUqU,IAAM,WACjB1U,KAAK+T,IAAIpH,MAAM,KAAM3M,KAAK8U,QAE9BpB,EAAQ0B,MAAQ,UAChB1B,EAAQ2B,SAAU,EAClB3B,EAAQ4B,IAAM,GACd5B,EAAQ6B,KAAO,GACf7B,EAAQ1M,QAAU,GAClB0M,EAAQ8B,SAAW,GAInB9B,EAAQ+B,GAAKV,EACbrB,EAAQgC,YAAcX,EACtBrB,EAAQiC,KAAOZ,EACfrB,EAAQkC,IAAMb,EACdrB,EAAQmC,eAAiBd,EACzBrB,EAAQoC,mBAAqBf,EAC7BrB,EAAQqC,KAAOhB,EACfrB,EAAQsC,gBAAkBjB,EAC1BrB,EAAQuC,oBAAsBlB,EAE9BrB,EAAQwC,UAAY,SAAUzW,GAAQ,MAAO,IAE7CiU,EAAQyC,QAAU,SAAU1W,GACxB,MAAM,IAAImU,MAAM,qCAGpBF,EAAQ0C,IAAM,WAAc,MAAO,KACnC1C,EAAQ2C,MAAQ,SAAUC,GACtB,MAAM,IAAI1C,MAAM,mCAEpBF,EAAQ6C,MAAQ,WAAa,OAAO,I,iBCvLpC,IAAIC,EAAwBzX,EAAQ,IAChCgG,EAAWhG,EAAQ,IACnBoB,EAAWpB,EAAQ,KAIlByX,GACHzR,EAAS3E,OAAOC,UAAW,WAAYF,EAAU,CAAEsG,QAAQ,K,6BCN7D,IAAIgQ,EAAkB1X,EAAQ,IAC1B2X,EAAmB3X,EAAQ,KAC3BqR,EAAYrR,EAAQ,IACpBmH,EAAsBnH,EAAQ,IAC9B4X,EAAiB5X,EAAQ,IAGzB6X,EAAmB1Q,EAAoB4E,IACvC3E,EAAmBD,EAAoByF,UAFtB,kBAcrBjN,EAAOC,QAAUgY,EAAezB,MAAO,SAAS,SAAU2B,EAAUC,GAClEF,EAAiB5W,KAAM,CACrB+H,KAhBiB,iBAiBjB1C,OAAQoR,EAAgBI,GACxBxD,MAAO,EACPyD,KAAMA,OAIP,WACD,IAAItQ,EAAQL,EAAiBnG,MACzBqF,EAASmB,EAAMnB,OACfyR,EAAOtQ,EAAMsQ,KACbzD,EAAQ7M,EAAM6M,QAClB,OAAKhO,GAAUgO,GAAShO,EAAOlE,QAC7BqF,EAAMnB,YAASU,EACR,CAAEtB,WAAOsB,EAAWgR,MAAM,IAEvB,QAARD,EAAuB,CAAErS,MAAO4O,EAAO0D,MAAM,GACrC,UAARD,EAAyB,CAAErS,MAAOY,EAAOgO,GAAQ0D,MAAM,GACpD,CAAEtS,MAAO,CAAC4O,EAAOhO,EAAOgO,IAAS0D,MAAM,KAC7C,UAKH3G,EAAU4G,UAAY5G,EAAU8E,MAGhCwB,EAAiB,QACjBA,EAAiB,UACjBA,EAAiB,Y,6BCnDjB,IAAI3G,EAAIhR,EAAQ,IACZH,EAAOG,EAAQ,IAEnBgR,EAAE,CAAE1K,OAAQ,SAAUwM,OAAO,EAAM/L,OAAQ,IAAIlH,OAASA,GAAQ,CAC9DA,KAAMA,K,gBCLR,IAAIoF,EAAcjF,EAAQ,GACtBkY,EAA6BlY,EAAQ,IACrC4F,EAA2B5F,EAAQ,IACnC0X,EAAkB1X,EAAQ,IAC1BoF,EAAcpF,EAAQ,IACtBE,EAAMF,EAAQ,GACdkF,EAAiBlF,EAAQ,IAEzBmY,EAAiC9W,OAAOyE,yBAI5ClG,EAAQ0F,EAAIL,EAAckT,EAAiC,SAAkC5S,EAAGC,GAG9F,GAFAD,EAAImS,EAAgBnS,GACpBC,EAAIJ,EAAYI,GAAG,GACfN,EAAgB,IAClB,OAAOiT,EAA+B5S,EAAGC,GACzC,MAAO1F,IACT,GAAII,EAAIqF,EAAGC,GAAI,OAAOI,GAA0BsS,EAA2B5S,EAAE7D,KAAK8D,EAAGC,GAAID,EAAEC,M,gBClB7F,IAAIV,EAAQ9E,EAAQ,GAEhBoY,EAAc,kBAEdjS,EAAW,SAAUkS,EAASC,GAChC,IAAI5S,EAAQ6S,EAAKC,EAAUH,IAC3B,OAAO3S,GAAS+S,GACZ/S,GAASgT,IACW,mBAAbJ,EAA0BxT,EAAMwT,KACrCA,IAGJE,EAAYrS,EAASqS,UAAY,SAAUG,GAC7C,OAAO9T,OAAO8T,GAAQnU,QAAQ4T,EAAa,KAAKQ,eAG9CL,EAAOpS,EAASoS,KAAO,GACvBG,EAASvS,EAASuS,OAAS,IAC3BD,EAAWtS,EAASsS,SAAW,IAEnC9Y,EAAOC,QAAUuG,G,cCpBjBxG,EAAOC,QAAU,SAAUgB,EAAIiY,EAAanY,GAC1C,KAAME,aAAciY,GAClB,MAAMjU,UAAU,cAAgBlE,EAAOA,EAAO,IAAM,IAAM,cAC1D,OAAOE,I,gBCHX,IAAIoQ,EAAIhR,EAAQ,IACZ8Y,EAAS9Y,EAAQ,KAIrBgR,EAAE,CAAE1K,OAAQ,SAAUO,MAAM,EAAME,OAAQ1F,OAAOyX,SAAWA,GAAU,CACpEA,OAAQA,K,6BCLV,IAAI9H,EAAIhR,EAAQ,IACZ8E,EAAQ9E,EAAQ,GAChBuB,EAAUvB,EAAQ,IAClB2B,EAAW3B,EAAQ,GACnB+Y,EAAW/Y,EAAQ,IACnBgZ,EAAWhZ,EAAQ,IACnBiZ,EAAiBjZ,EAAQ,KACzBkZ,EAAqBlZ,EAAQ,IAC7BmZ,EAA+BnZ,EAAQ,IACvC0P,EAAkB1P,EAAQ,GAC1BoZ,EAAapZ,EAAQ,IAErBqZ,EAAuB3J,EAAgB,sBAOvC4J,EAA+BF,GAAc,KAAOtU,GAAM,WAC5D,IAAIiR,EAAQ,GAEZ,OADAA,EAAMsD,IAAwB,EACvBtD,EAAMjK,SAAS,KAAOiK,KAG3BwD,EAAkBJ,EAA6B,UAE/CK,EAAqB,SAAUjU,GACjC,IAAK5D,EAAS4D,GAAI,OAAO,EACzB,IAAIkU,EAAalU,EAAE8T,GACnB,YAAsBrS,IAAfyS,IAA6BA,EAAalY,EAAQgE,IAQ3DyL,EAAE,CAAE1K,OAAQ,QAASwM,OAAO,EAAM/L,QALpBuS,IAAiCC,GAKK,CAClDzN,OAAQ,SAAgB4N,GACtB,IAGIxX,EAAGyX,EAAGvX,EAAQsT,EAAKkE,EAHnBrU,EAAIwT,EAAS9X,MACb4Y,EAAIX,EAAmB3T,EAAG,GAC1BuU,EAAI,EAER,IAAK5X,GAAK,EAAGE,EAAS6B,UAAU7B,OAAQF,EAAIE,EAAQF,IAElD,GAAIsX,EADJI,GAAW,IAAP1X,EAAWqD,EAAItB,UAAU/B,IACF,CAEzB,GAAI4X,GADJpE,EAAMsD,EAASY,EAAExX,SAlCF,iBAmCiB,MAAMwC,UAlCT,kCAmC7B,IAAK+U,EAAI,EAAGA,EAAIjE,EAAKiE,IAAKG,IAASH,KAAKC,GAAGX,EAAeY,EAAGC,EAAGF,EAAED,QAC7D,CACL,GAAIG,GAtCW,iBAsCY,MAAMlV,UArCJ,kCAsC7BqU,EAAeY,EAAGC,IAAKF,GAI3B,OADAC,EAAEzX,OAAS0X,EACJD,M,gBCzDX,IAAI/U,EAAQ9E,EAAQ,GAChB0P,EAAkB1P,EAAQ,GAC1BoZ,EAAapZ,EAAQ,IAErB+Z,EAAUrK,EAAgB,WAE9B/P,EAAOC,QAAU,SAAUqQ,GAIzB,OAAOmJ,GAAc,KAAOtU,GAAM,WAChC,IAAIiR,EAAQ,GAKZ,OAJkBA,EAAMtT,YAAc,IAC1BsX,GAAW,WACrB,MAAO,CAAEC,IAAK,IAE2B,IAApCjE,EAAM9F,GAAagK,SAASD,S,gBChBvC,IAAIja,EAASC,EAAQ,GACjB2B,EAAW3B,EAAQ,GAEnB4D,EAAW7D,EAAO6D,SAElBsW,EAASvY,EAASiC,IAAajC,EAASiC,EAASuW,eAErDxa,EAAOC,QAAU,SAAUgB,GACzB,OAAOsZ,EAAStW,EAASuW,cAAcvZ,GAAM,K,gBCR/C,IAAIyL,EAAQrM,EAAQ,IAEhBoa,EAAmBlZ,SAASE,SAGE,mBAAvBiL,EAAMnF,gBACfmF,EAAMnF,cAAgB,SAAUtG,GAC9B,OAAOwZ,EAAiB3Y,KAAKb,KAIjCjB,EAAOC,QAAUyM,EAAMnF,e,gBCXvB,IAAI/F,EAAOnB,EAAQ,IACfsN,EAAgBtN,EAAQ,IACxB+Y,EAAW/Y,EAAQ,IACnBgZ,EAAWhZ,EAAQ,IACnBkZ,EAAqBlZ,EAAQ,IAE7BoW,EAAO,GAAGA,KAGViE,EAAe,SAAUxN,GAC3B,IAAIyN,EAAiB,GAARzN,EACT0N,EAAoB,GAAR1N,EACZ2N,EAAkB,GAAR3N,EACV4N,EAAmB,GAAR5N,EACX6N,EAAwB,GAAR7N,EAChB8N,EAAmB,GAAR9N,GAAa6N,EAC5B,OAAO,SAAUE,EAAOC,EAAYnN,EAAMoN,GASxC,IARA,IAOIpV,EAAO5B,EAPPyB,EAAIwT,EAAS6B,GACb5Z,EAAOsM,EAAc/H,GACrBwV,EAAgB5Z,EAAK0Z,EAAYnN,EAAM,GACvCtL,EAAS4W,EAAShY,EAAKoB,QACvBkS,EAAQ,EACR/E,EAASuL,GAAkB5B,EAC3B5S,EAASgU,EAAS/K,EAAOqL,EAAOxY,GAAUmY,EAAYhL,EAAOqL,EAAO,QAAK5T,EAEvE5E,EAASkS,EAAOA,IAAS,IAAIqG,GAAYrG,KAAStT,KAEtD8C,EAASiX,EADTrV,EAAQ1E,EAAKsT,GACiBA,EAAO/O,GACjCsH,GACF,GAAIyN,EAAQhU,EAAOgO,GAASxQ,OACvB,GAAIA,EAAQ,OAAQ+I,GACvB,KAAK,EAAG,OAAO,EACf,KAAK,EAAG,OAAOnH,EACf,KAAK,EAAG,OAAO4O,EACf,KAAK,EAAG8B,EAAK3U,KAAK6E,EAAQZ,QACrB,GAAI+U,EAAU,OAAO,EAGhC,OAAOC,GAAiB,EAAIF,GAAWC,EAAWA,EAAWnU,IAIjE3G,EAAOC,QAAU,CAGfmC,QAASsY,EAAa,GAGtBW,IAAKX,EAAa,GAGlBY,OAAQZ,EAAa,GAGrBa,KAAMb,EAAa,GAGnBc,MAAOd,EAAa,GAGpBe,KAAMf,EAAa,GAGnBgB,UAAWhB,EAAa,K,gBC/D1B,IAAI1Y,EAAW3B,EAAQ,GACnBuB,EAAUvB,EAAQ,IAGlB+Z,EAFkB/Z,EAAQ,EAEhB0P,CAAgB,WAI9B/P,EAAOC,QAAU,SAAU0b,EAAelZ,GACxC,IAAImZ,EASF,OAREha,EAAQ+Z,KAGM,mBAFhBC,EAAID,EAAc7Y,cAEa8Y,IAAMpF,QAAS5U,EAAQga,EAAEja,WAC/CK,EAAS4Z,IAEN,QADVA,EAAIA,EAAExB,MACUwB,OAAIvU,GAH+CuU,OAAIvU,GAKlE,SAAWA,IAANuU,EAAkBpF,MAAQoF,GAAc,IAAXnZ,EAAe,EAAIA,K,6BCjBhE,IAAI0C,EAAQ9E,EAAQ,GAEpBL,EAAOC,QAAU,SAAUqQ,EAAalG,GACtC,IAAImD,EAAS,GAAG+C,GAChB,QAAS/C,GAAUpI,GAAM,WAEvBoI,EAAOzL,KAAK,KAAMsI,GAAY,WAAc,MAAM,GAAM,Q,gBCP5D,IAMI+J,EAAO7L,EANPlI,EAASC,EAAQ,GACjBwb,EAAYxb,EAAQ,KAEpB2U,EAAU5U,EAAO4U,QACjB8B,EAAW9B,GAAWA,EAAQ8B,SAC9BgF,EAAKhF,GAAYA,EAASgF,GAG1BA,EAEFxT,GADA6L,EAAQ2H,EAAGjU,MAAM,MACD,GAAKsM,EAAM,GAClB0H,MACT1H,EAAQ0H,EAAU1H,MAAM,iBACVA,EAAM,IAAM,MACxBA,EAAQ0H,EAAU1H,MAAM,oBACb7L,EAAU6L,EAAM,IAI/BnU,EAAOC,QAAUqI,IAAYA,G,qPCnB7B,IAAI9C,EAAWnF,EAAQ,GACnB0b,EAAwB1b,EAAQ,KAChCgZ,EAAWhZ,EAAQ,IACnBmB,EAAOnB,EAAQ,IACf2b,EAAoB3b,EAAQ,KAC5B4b,EAAgB5b,EAAQ,KAExB6b,EAAS,SAAUC,EAAShY,GAC9B7C,KAAK6a,QAAUA,EACf7a,KAAK6C,OAASA,GAGhBnE,EAAOC,QAAU,SAAUmc,EAAUC,EAAiB5V,GACpD,IAKI6V,EAAUC,EAAQ5H,EAAOlS,EAAQ0B,EAAQgO,EAAMqK,EAL/CzO,EAAOtH,GAAWA,EAAQsH,KAC1B0O,KAAgBhW,IAAWA,EAAQgW,YACnCC,KAAiBjW,IAAWA,EAAQiW,aACpCC,KAAiBlW,IAAWA,EAAQkW,aACpCra,EAAKd,EAAK6a,EAAiBtO,EAAM,EAAI0O,EAAaE,GAGlDC,EAAO,SAAUC,GAEnB,OADIP,GAAUL,EAAcK,GACrB,IAAIJ,GAAO,EAAMW,IAGtBC,EAAS,SAAU/W,GACrB,OAAI0W,GACFjX,EAASO,GACF4W,EAAcra,EAAGyD,EAAM,GAAIA,EAAM,GAAI6W,GAAQta,EAAGyD,EAAM,GAAIA,EAAM,KAChE4W,EAAcra,EAAGyD,EAAO6W,GAAQta,EAAGyD,IAG9C,GAAI2W,EACFJ,EAAWF,MACN,CAEL,GAAqB,mBADrBG,EAASP,EAAkBI,IACM,MAAMnX,UAAU,0BAEjD,GAAI8W,EAAsBQ,GAAS,CACjC,IAAK5H,EAAQ,EAAGlS,EAAS4W,EAAS+C,EAAS3Z,QAASA,EAASkS,EAAOA,IAElE,IADAxQ,EAAS2Y,EAAOV,EAASzH,MACXxQ,aAAkB+X,EAAQ,OAAO/X,EAC/C,OAAO,IAAI+X,GAAO,GAEtBI,EAAWC,EAAOza,KAAKsa,GAIzB,IADAjK,EAAOmK,EAASnK,OACPqK,EAAOrK,EAAKrQ,KAAKwa,IAAWjE,MAAM,CACzC,IACElU,EAAS2Y,EAAON,EAAKzW,OACrB,MAAO5F,GAEP,MADA8b,EAAcK,GACRnc,EAER,GAAqB,UAAjB,EAAOgE,IAAsBA,GAAUA,aAAkB+X,EAAQ,OAAO/X,EAC5E,OAAO,IAAI+X,GAAO,K,gBCxDtB,IAAIpE,EAAwBzX,EAAQ,IAChC0c,EAAa1c,EAAQ,IAGrByP,EAFkBzP,EAAQ,EAEV0P,CAAgB,eAEhCiN,EAAuE,aAAnDD,EAAW,WAAc,OAAOzY,UAArB,IAUnCtE,EAAOC,QAAU6X,EAAwBiF,EAAa,SAAU9b,GAC9D,IAAI2E,EAAGqX,EAAK9Y,EACZ,YAAckD,IAAPpG,EAAmB,YAAqB,OAAPA,EAAc,OAEM,iBAAhDgc,EAXD,SAAUhc,EAAIyB,GACzB,IACE,OAAOzB,EAAGyB,GACV,MAAOvC,KAQS+c,CAAOtX,EAAIlE,OAAOT,GAAK6O,IAA8BmN,EAEnED,EAAoBD,EAAWnX,GAEH,WAA3BzB,EAAS4Y,EAAWnX,KAAsC,mBAAZA,EAAEuX,OAAuB,YAAchZ,I,gBCxB5F,IAAI+F,EAAY7J,EAAQ,IACpBgK,EAAyBhK,EAAQ,IAGjCqa,EAAe,SAAU0C,GAC3B,OAAO,SAAUnC,EAAOoC,GACtB,IAGIC,EAAOC,EAHPC,EAAItY,OAAOmF,EAAuB4Q,IAClCwC,EAAWvT,EAAUmT,GACrBK,EAAOF,EAAE/a,OAEb,OAAIgb,EAAW,GAAKA,GAAYC,EAAaN,EAAoB,QAAK/V,GACtEiW,EAAQE,EAAExY,WAAWyY,IACN,OAAUH,EAAQ,OAAUG,EAAW,IAAMC,IACtDH,EAASC,EAAExY,WAAWyY,EAAW,IAAM,OAAUF,EAAS,MAC1DH,EAAoBI,EAAEG,OAAOF,GAAYH,EACzCF,EAAoBI,EAAEnZ,MAAMoZ,EAAUA,EAAW,GAA+BF,EAAS,OAAlCD,EAAQ,OAAU,IAA0B,QAI7Gtd,EAAOC,QAAU,CAGf2d,OAAQlD,GAAa,GAGrBiD,OAAQjD,GAAa,K,6BCxBvB,IAAImD,EAA6B,GAAGlN,qBAChCxK,EAA2BzE,OAAOyE,yBAGlC2X,EAAc3X,IAA6B0X,EAA2B/b,KAAK,CAAEic,EAAG,GAAK,GAIzF9d,EAAQ0F,EAAImY,EAAc,SAA8BE,GACtD,IAAIlX,EAAaX,EAAyB7E,KAAM0c,GAChD,QAASlX,GAAcA,EAAWmB,YAChC4V,G,gBCZJ,IAAIvY,EAAcjF,EAAQ,GACtB8E,EAAQ9E,EAAQ,GAChBma,EAAgBna,EAAQ,IAG5BL,EAAOC,SAAWqF,IAAgBH,GAAM,WACtC,OAEQ,GAFDzD,OAAO0D,eAAeoV,EAAc,OAAQ,IAAK,CACtDnV,IAAK,WAAc,OAAO,KACzBb,M,gBCRL,IAAIiN,EAAUpR,EAAQ,IAClBqM,EAAQrM,EAAQ,KAEnBL,EAAOC,QAAU,SAAUyC,EAAKqD,GAC/B,OAAO2G,EAAMhK,KAASgK,EAAMhK,QAAiB2E,IAAVtB,EAAsBA,EAAQ,MAChE,WAAY,IAAI0Q,KAAK,CACtBnO,QAAS,QACT2V,KAAMxM,EAAU,OAAS,SACzByM,UAAW,0C,gBCRb,IAAI3d,EAAMF,EAAQ,GACd0X,EAAkB1X,EAAQ,IAC1BoU,EAAUpU,EAAQ,IAA+BoU,QACjDjI,EAAanM,EAAQ,IAEzBL,EAAOC,QAAU,SAAUiG,EAAQiY,GACjC,IAGIzb,EAHAkD,EAAImS,EAAgB7R,GACpB3D,EAAI,EACJ4B,EAAS,GAEb,IAAKzB,KAAOkD,GAAIrF,EAAIiM,EAAY9J,IAAQnC,EAAIqF,EAAGlD,IAAQyB,EAAOsS,KAAK/T,GAEnE,KAAOyb,EAAM1b,OAASF,GAAOhC,EAAIqF,EAAGlD,EAAMyb,EAAM5b,SAC7CkS,EAAQtQ,EAAQzB,IAAQyB,EAAOsS,KAAK/T,IAEvC,OAAOyB,I,gBCfT,IAAI4T,EAAkB1X,EAAQ,IAC1BgZ,EAAWhZ,EAAQ,IACnB+d,EAAkB/d,EAAQ,KAG1Bqa,EAAe,SAAU2D,GAC3B,OAAO,SAAUpD,EAAOqD,EAAIC,GAC1B,IAGIxY,EAHAH,EAAImS,EAAgBkD,GACpBxY,EAAS4W,EAASzT,EAAEnD,QACpBkS,EAAQyJ,EAAgBG,EAAW9b,GAIvC,GAAI4b,GAAeC,GAAMA,GAAI,KAAO7b,EAASkS,GAG3C,IAFA5O,EAAQH,EAAE+O,OAEG5O,EAAO,OAAO,OAEtB,KAAMtD,EAASkS,EAAOA,IAC3B,IAAK0J,GAAe1J,KAAS/O,IAAMA,EAAE+O,KAAW2J,EAAI,OAAOD,GAAe1J,GAAS,EACnF,OAAQ0J,IAAgB,IAI9Bre,EAAOC,QAAU,CAGfue,SAAU9D,GAAa,GAGvBjG,QAASiG,GAAa,K,cC9BxBza,EAAQ0F,EAAIjE,OAAO+c,uB,gBCAnB,IAAIC,EAAqBre,EAAQ,IAC7B+N,EAAc/N,EAAQ,IAI1BL,EAAOC,QAAUyB,OAAOkP,MAAQ,SAAchL,GAC5C,OAAO8Y,EAAmB9Y,EAAGwI,K,6BCJ/BpO,EAAOC,QAAU,SAAcqC,EAAIoC,GACjC,OAAO,WAEL,IADA,IAAI6R,EAAO,IAAIC,MAAMlS,UAAU7B,QACtBF,EAAI,EAAGA,EAAIgU,EAAK9T,OAAQF,IAC/BgU,EAAKhU,GAAK+B,UAAU/B,GAEtB,OAAOD,EAAG2L,MAAMvJ,EAAS6R,M,6BCN7B,IAAIoI,EAAQte,EAAQ,GAEpB,SAASue,EAAO/c,GACd,OAAOgH,mBAAmBhH,GACxBgD,QAAQ,QAAS,KACjBA,QAAQ,OAAQ,KAChBA,QAAQ,QAAS,KACjBA,QAAQ,OAAQ,KAChBA,QAAQ,QAAS,KACjBA,QAAQ,QAAS,KAUrB7E,EAAOC,QAAU,SAAkB6I,EAAKE,EAAQ6V,GAE9C,IAAK7V,EACH,OAAOF,EAGT,IAAIgW,EACJ,GAAID,EACFC,EAAmBD,EAAiB7V,QAC/B,GAAI2V,EAAM/a,kBAAkBoF,GACjC8V,EAAmB9V,EAAOvH,eACrB,CACL,IAAIsd,EAAQ,GAEZJ,EAAMvc,QAAQ4G,GAAQ,SAAmBnH,EAAKa,GACxCb,UAIA8c,EAAM/c,QAAQC,GAChBa,GAAY,KAEZb,EAAM,CAACA,GAGT8c,EAAMvc,QAAQP,GAAK,SAAoBmd,GACjCL,EAAMpb,OAAOyb,GACfA,EAAIA,EAAEC,cACGN,EAAM3c,SAASgd,KACxBA,EAAIE,KAAKC,UAAUH,IAErBD,EAAMtI,KAAKmI,EAAOlc,GAAO,IAAMkc,EAAOI,WAI1CF,EAAmBC,EAAM7W,KAAK,KAGhC,GAAI4W,EAAkB,CACpB,IAAIM,EAAgBtW,EAAI2L,QAAQ,MACT,IAAnB2K,IACFtW,EAAMA,EAAIzE,MAAM,EAAG+a,IAGrBtW,KAA8B,IAAtBA,EAAI2L,QAAQ,KAAc,IAAM,KAAOqK,EAGjD,OAAOhW,I,6BClET9I,EAAOC,QAAU,SAAkB8F,GACjC,SAAUA,IAASA,EAAMsZ,c,8BCH3B,YAEA,IAAIV,EAAQte,EAAQ,GAChBif,EAAsBjf,EAAQ,KAE9Bkf,EAAuB,CACzB,eAAgB,qCAGlB,SAASC,EAAsBhW,EAASzD,IACjC4Y,EAAM5c,YAAYyH,IAAYmV,EAAM5c,YAAYyH,EAAQ,mBAC3DA,EAAQ,gBAAkBzD,GAgB9B,IAXM0Z,EAWFC,EAAW,CACbD,UAX8B,oBAAnBE,qBAGmB,IAAZ3K,GAAuE,qBAA5CtT,OAAOC,UAAUF,SAASK,KAAKkT,MAD1EyK,EAAUpf,EAAQ,KAKbof,GAMPG,iBAAkB,CAAC,SAA0BhH,EAAMpP,GAGjD,OAFA8V,EAAoB9V,EAAS,UAC7B8V,EAAoB9V,EAAS,gBACzBmV,EAAM5b,WAAW6V,IACnB+F,EAAM/b,cAAcgW,IACpB+F,EAAM9b,SAAS+V,IACf+F,EAAMjb,SAASkV,IACf+F,EAAMnb,OAAOoV,IACb+F,EAAMlb,OAAOmV,GAENA,EAEL+F,EAAM1b,kBAAkB2V,GACnBA,EAAKxV,OAEVub,EAAM/a,kBAAkBgV,IAC1B4G,EAAsBhW,EAAS,mDACxBoP,EAAKnX,YAEVkd,EAAM3c,SAAS4W,IACjB4G,EAAsBhW,EAAS,kCACxB0V,KAAKC,UAAUvG,IAEjBA,IAGTiH,kBAAmB,CAAC,SAA2BjH,GAE7C,GAAoB,iBAATA,EACT,IACEA,EAAOsG,KAAKY,MAAMlH,GAClB,MAAO/D,IAEX,OAAO+D,IAOT9C,QAAS,EAETiK,eAAgB,aAChBC,eAAgB,eAEhBC,kBAAmB,EACnBC,eAAgB,EAEhBC,eAAgB,SAAwBC,GACtC,OAAOA,GAAU,KAAOA,EAAS,MAIrCV,EAASlW,QAAU,CACjB6W,OAAQ,CACN,OAAU,sCAId1B,EAAMvc,QAAQ,CAAC,SAAU,MAAO,SAAS,SAA6BmL,GACpEmS,EAASlW,QAAQ+D,GAAU,MAG7BoR,EAAMvc,QAAQ,CAAC,OAAQ,MAAO,UAAU,SAA+BmL,GACrEmS,EAASlW,QAAQ+D,GAAUoR,EAAMza,MAAMqb,MAGzCvf,EAAOC,QAAUyf,I,+CC/FjB,IAAIf,EAAQte,EAAQ,GAChBigB,EAASjgB,EAAQ,KACjBkgB,EAAUlgB,EAAQ,KAClBmgB,EAAWngB,EAAQ,IACnBogB,EAAgBpgB,EAAQ,KACxBqgB,EAAergB,EAAQ,KACvBsgB,EAAkBtgB,EAAQ,KAC1BugB,EAAcvgB,EAAQ,IAE1BL,EAAOC,QAAU,SAAoB4gB,GACnC,OAAO,IAAIC,SAAQ,SAA4BC,EAASC,GACtD,IAAIC,EAAcJ,EAAOjI,KACrBsI,EAAiBL,EAAOrX,QAExBmV,EAAM5b,WAAWke,WACZC,EAAe,gBAGxB,IAAIC,EAAU,IAAIxB,eAGlB,GAAIkB,EAAOO,KAAM,CACf,IAAIC,EAAWR,EAAOO,KAAKC,UAAY,GACnCC,EAAWT,EAAOO,KAAKE,SAAWC,SAAS1Y,mBAAmBgY,EAAOO,KAAKE,WAAa,GAC3FJ,EAAeM,cAAgB,SAAWC,KAAKJ,EAAW,IAAMC,GAGlE,IAAII,EAAWjB,EAAcI,EAAOc,QAASd,EAAO/X,KA4EpD,GA3EAqY,EAAQzR,KAAKmR,EAAOtT,OAAOqU,cAAepB,EAASkB,EAAUb,EAAO7X,OAAQ6X,EAAOhC,mBAAmB,GAGtGsC,EAAQrL,QAAU+K,EAAO/K,QAGzBqL,EAAQU,mBAAqB,WAC3B,GAAKV,GAAkC,IAAvBA,EAAQW,aAQD,IAAnBX,EAAQf,QAAkBe,EAAQY,aAAwD,IAAzCZ,EAAQY,YAAYtN,QAAQ,UAAjF,CAKA,IAAIuN,EAAkB,0BAA2Bb,EAAUT,EAAaS,EAAQc,yBAA2B,KAEvGC,EAAW,CACbtJ,KAFkBiI,EAAOsB,cAAwC,SAAxBtB,EAAOsB,aAAiDhB,EAAQe,SAA/Bf,EAAQiB,aAGlFhC,OAAQe,EAAQf,OAChBiC,WAAYlB,EAAQkB,WACpB7Y,QAASwY,EACTnB,OAAQA,EACRM,QAASA,GAGXb,EAAOS,EAASC,EAAQkB,GAGxBf,EAAU,OAIZA,EAAQmB,QAAU,WACXnB,IAILH,EAAOJ,EAAY,kBAAmBC,EAAQ,eAAgBM,IAG9DA,EAAU,OAIZA,EAAQoB,QAAU,WAGhBvB,EAAOJ,EAAY,gBAAiBC,EAAQ,KAAMM,IAGlDA,EAAU,MAIZA,EAAQqB,UAAY,WAClB,IAAIC,EAAsB,cAAgB5B,EAAO/K,QAAU,cACvD+K,EAAO4B,sBACTA,EAAsB5B,EAAO4B,qBAE/BzB,EAAOJ,EAAY6B,EAAqB5B,EAAQ,eAC9CM,IAGFA,EAAU,MAMRxC,EAAM7a,uBAAwB,CAEhC,IAAI4e,GAAa7B,EAAO8B,iBAAmBhC,EAAgBe,KAAcb,EAAOd,eAC9EQ,EAAQqC,KAAK/B,EAAOd,qBACpB1Y,EAEEqb,IACFxB,EAAeL,EAAOb,gBAAkB0C,GAuB5C,GAlBI,qBAAsBvB,GACxBxC,EAAMvc,QAAQ8e,GAAgB,SAA0Brf,EAAKa,QAChC,IAAhBue,GAAqD,iBAAtBve,EAAIuW,qBAErCiI,EAAexe,GAGtBye,EAAQ0B,iBAAiBngB,EAAKb,MAM/B8c,EAAM5c,YAAY8e,EAAO8B,mBAC5BxB,EAAQwB,kBAAoB9B,EAAO8B,iBAIjC9B,EAAOsB,aACT,IACEhB,EAAQgB,aAAetB,EAAOsB,aAC9B,MAAOtN,GAGP,GAA4B,SAAxBgM,EAAOsB,aACT,MAAMtN,EAM6B,mBAA9BgM,EAAOiC,oBAChB3B,EAAQ4B,iBAAiB,WAAYlC,EAAOiC,oBAIP,mBAA5BjC,EAAOmC,kBAAmC7B,EAAQ8B,QAC3D9B,EAAQ8B,OAAOF,iBAAiB,WAAYlC,EAAOmC,kBAGjDnC,EAAOqC,aAETrC,EAAOqC,YAAYC,QAAQC,MAAK,SAAoBC,GAC7ClC,IAILA,EAAQmC,QACRtC,EAAOqC,GAEPlC,EAAU,SAITF,IACHA,EAAc,MAIhBE,EAAQoC,KAAKtC,Q,6BC9KjB,IAAIuC,EAAenjB,EAAQ,KAY3BL,EAAOC,QAAU,SAAqBwjB,EAAS5C,EAAQ6C,EAAMvC,EAASe,GACpE,IAAI/hB,EAAQ,IAAI+U,MAAMuO,GACtB,OAAOD,EAAarjB,EAAO0gB,EAAQ6C,EAAMvC,EAASe,K,6BCdpD,IAAIvD,EAAQte,EAAQ,GAUpBL,EAAOC,QAAU,SAAqB0jB,EAASC,GAE7CA,EAAUA,GAAW,GACrB,IAAI/C,EAAS,GAETgD,EAAuB,CAAC,MAAO,SAAU,QACzCC,EAA0B,CAAC,UAAW,OAAQ,QAAS,UACvDC,EAAuB,CACzB,UAAW,mBAAoB,oBAAqB,mBACpD,UAAW,iBAAkB,kBAAmB,UAAW,eAAgB,iBAC3E,iBAAkB,mBAAoB,qBAAsB,aAC5D,mBAAoB,gBAAiB,eAAgB,YAAa,YAClE,aAAc,cAAe,aAAc,oBAEzCC,EAAkB,CAAC,kBAEvB,SAASC,EAAetd,EAAQD,GAC9B,OAAIiY,EAAM1c,cAAc0E,IAAWgY,EAAM1c,cAAcyE,GAC9CiY,EAAMza,MAAMyC,EAAQD,GAClBiY,EAAM1c,cAAcyE,GACtBiY,EAAMza,MAAM,GAAIwC,GACdiY,EAAM/c,QAAQ8E,GAChBA,EAAOrC,QAETqC,EAGT,SAASwd,EAAoBC,GACtBxF,EAAM5c,YAAY6hB,EAAQO,IAEnBxF,EAAM5c,YAAY4hB,EAAQQ,MACpCtD,EAAOsD,GAAQF,OAAe5c,EAAWsc,EAAQQ,KAFjDtD,EAAOsD,GAAQF,EAAeN,EAAQQ,GAAOP,EAAQO,IAMzDxF,EAAMvc,QAAQyhB,GAAsB,SAA0BM,GACvDxF,EAAM5c,YAAY6hB,EAAQO,MAC7BtD,EAAOsD,GAAQF,OAAe5c,EAAWuc,EAAQO,QAIrDxF,EAAMvc,QAAQ0hB,EAAyBI,GAEvCvF,EAAMvc,QAAQ2hB,GAAsB,SAA0BI,GACvDxF,EAAM5c,YAAY6hB,EAAQO,IAEnBxF,EAAM5c,YAAY4hB,EAAQQ,MACpCtD,EAAOsD,GAAQF,OAAe5c,EAAWsc,EAAQQ,KAFjDtD,EAAOsD,GAAQF,OAAe5c,EAAWuc,EAAQO,OAMrDxF,EAAMvc,QAAQ4hB,GAAiB,SAAeG,GACxCA,KAAQP,EACV/C,EAAOsD,GAAQF,EAAeN,EAAQQ,GAAOP,EAAQO,IAC5CA,KAAQR,IACjB9C,EAAOsD,GAAQF,OAAe5c,EAAWsc,EAAQQ,QAIrD,IAAIC,EAAYP,EACb1X,OAAO2X,GACP3X,OAAO4X,GACP5X,OAAO6X,GAENK,EAAY3iB,OACbkP,KAAK+S,GACLxX,OAAOzK,OAAOkP,KAAKgT,IACnBtI,QAAO,SAAyB5Y,GAC/B,OAAmC,IAA5B0hB,EAAU3P,QAAQ/R,MAK7B,OAFAic,EAAMvc,QAAQiiB,EAAWH,GAElBrD,I,6BC7ET,SAASyD,EAAOb,GACdniB,KAAKmiB,QAAUA,EAGjBa,EAAO3iB,UAAUF,SAAW,WAC1B,MAAO,UAAYH,KAAKmiB,QAAU,KAAOniB,KAAKmiB,QAAU,KAG1Da,EAAO3iB,UAAU0d,YAAa,EAE9Brf,EAAOC,QAAUqkB,G,6BCjBjB,IAAIjT,EAAIhR,EAAQ,IACZ+B,EAAU/B,EAAQ,IAItBgR,EAAE,CAAE1K,OAAQ,QAASwM,OAAO,EAAM/L,OAAQ,GAAGhF,SAAWA,GAAW,CACjEA,QAASA,K,6BCNX,IAAImiB,EAAWlkB,EAAQ,IAAgC+B,QACnDoiB,EAAsBnkB,EAAQ,IAC9BokB,EAA0BpkB,EAAQ,IAElCqkB,EAAgBF,EAAoB,WACpCG,EAAiBF,EAAwB,WAI7CzkB,EAAOC,QAAYykB,GAAkBC,EAEjC,GAAGviB,QAFgD,SAAiB8Y,GACtE,OAAOqJ,EAASjjB,KAAM4Z,EAAY5W,UAAU7B,OAAS,EAAI6B,UAAU,QAAK+C,K,gBCX1E,IAAIqJ,EAAUrQ,EAAQ,IAItBL,EAAOC,QAAUuW,MAAM5U,SAAW,SAAiBmY,GACjD,MAAuB,SAAhBrJ,EAAQqJ,K,gBCLjB,IAAI5U,EAAQ9E,EAAQ,GAEpBL,EAAOC,UAAYyB,OAAO+c,wBAA0BtZ,GAAM,WAGxD,OAAQD,OAAOtE,c,oBCLTwQ,EAA8B/Q,EAAQ,IAAtC+Q,0BACFwT,EAAQvkB,EAAQ,IAIhB+T,GAHNnU,EAAUD,EAAOC,QAAU,IAGRmU,GAAK,GAClB5E,EAAMvP,EAAQuP,IAAM,GACpBqV,EAAI5kB,EAAQ4kB,EAAI,GAClBC,EAAI,EAEFC,EAAc,SAAChkB,EAAMgF,EAAOif,GAChC,IAAMrQ,EAAQmQ,IACdF,EAAMjQ,EAAO5O,GACb8e,EAAE9jB,GAAQ4T,EACVnF,EAAImF,GAAS5O,EACbqO,EAAGO,GAAS,IAAIjB,OAAO3N,EAAOif,EAAW,SAAM3d,IASjD0d,EAAY,oBAAqB,eACjCA,EAAY,yBAA0B,UAMtCA,EAAY,uBAAwB,8BAKpCA,EAAY,cAAe,WAAIvV,EAAIqV,EAAEI,mBAAV,mBACJzV,EAAIqV,EAAEI,mBADF,mBAEJzV,EAAIqV,EAAEI,mBAFF,MAI3BF,EAAY,mBAAoB,WAAIvV,EAAIqV,EAAEK,wBAAV,mBACJ1V,EAAIqV,EAAEK,wBADF,mBAEJ1V,EAAIqV,EAAEK,wBAFF,MAOhCH,EAAY,uBAAD,aAA+BvV,EAAIqV,EAAEI,mBAArC,YACPzV,EAAIqV,EAAEM,sBADC,MAGXJ,EAAY,4BAAD,aAAoCvV,EAAIqV,EAAEK,wBAA1C,YACP1V,EAAIqV,EAAEM,sBADC,MAOXJ,EAAY,aAAD,eAAuBvV,EAAIqV,EAAEO,sBAA7B,iBACF5V,EAAIqV,EAAEO,sBADJ,SAGXL,EAAY,kBAAD,gBAA6BvV,EAAIqV,EAAEQ,2BAAnC,iBACF7V,EAAIqV,EAAEQ,2BADJ,SAMXN,EAAY,kBAAmB,iBAM/BA,EAAY,QAAD,iBAAoBvV,EAAIqV,EAAES,iBAA1B,iBACF9V,EAAIqV,EAAES,iBADJ,SAYXP,EAAY,YAAD,YAAmBvV,EAAIqV,EAAEU,cAAzB,OACR/V,EAAIqV,EAAEW,YADE,YAEThW,EAAIqV,EAAEY,OAFG,MAIXV,EAAY,OAAD,WAAavV,EAAIqV,EAAEa,WAAnB,MAKXX,EAAY,aAAD,kBAA0BvV,EAAIqV,EAAEc,mBAAhC,OACRnW,EAAIqV,EAAEe,iBADE,YAETpW,EAAIqV,EAAEY,OAFG,MAIXV,EAAY,QAAD,WAAcvV,EAAIqV,EAAEgB,YAApB,MAEXd,EAAY,OAAQ,gBAKpBA,EAAY,wBAAD,UAA6BvV,EAAIqV,EAAEK,wBAAnC,aACXH,EAAY,mBAAD,UAAwBvV,EAAIqV,EAAEI,mBAA9B,aAEXF,EAAY,cAAe,mBAAYvV,EAAIqV,EAAEiB,kBAAlB,sBACEtW,EAAIqV,EAAEiB,kBADR,sBAEEtW,EAAIqV,EAAEiB,kBAFR,kBAGFtW,EAAIqV,EAAEW,YAHJ,aAINhW,EAAIqV,EAAEY,OAJA,aAO3BV,EAAY,mBAAoB,mBAAYvV,EAAIqV,EAAEkB,uBAAlB,sBACEvW,EAAIqV,EAAEkB,uBADR,sBAEEvW,EAAIqV,EAAEkB,uBAFR,kBAGFvW,EAAIqV,EAAEe,iBAHJ,aAINpW,EAAIqV,EAAEY,OAJA,aAOhCV,EAAY,SAAD,WAAevV,EAAIqV,EAAEmB,MAArB,eAAiCxW,EAAIqV,EAAEoB,aAAvC,MACXlB,EAAY,cAAD,WAAoBvV,EAAIqV,EAAEmB,MAA1B,eAAsCxW,EAAIqV,EAAEqB,kBAA5C,MAIXnB,EAAY,SAAU,UAAG,qBAAH,OACI3T,EADJ,6BAEQA,EAFR,+BAGQA,EAHR,wBAKtB2T,EAAY,YAAavV,EAAIqV,EAAEsB,SAAS,GAIxCpB,EAAY,YAAa,WAEzBA,EAAY,YAAD,gBAAuBvV,EAAIqV,EAAEuB,WAA7B,SAA+C,GAC1DnmB,EAAQomB,iBAAmB,MAE3BtB,EAAY,QAAD,WAAcvV,EAAIqV,EAAEuB,YAApB,OAAiC5W,EAAIqV,EAAEoB,aAAvC,MACXlB,EAAY,aAAD,WAAmBvV,EAAIqV,EAAEuB,YAAzB,OAAsC5W,EAAIqV,EAAEqB,kBAA5C,MAIXnB,EAAY,YAAa,WAEzBA,EAAY,YAAD,gBAAuBvV,EAAIqV,EAAEyB,WAA7B,SAA+C,GAC1DrmB,EAAQsmB,iBAAmB,MAE3BxB,EAAY,QAAD,WAAcvV,EAAIqV,EAAEyB,YAApB,OAAiC9W,EAAIqV,EAAEoB,aAAvC,MACXlB,EAAY,aAAD,WAAmBvV,EAAIqV,EAAEyB,YAAzB,OAAsC9W,EAAIqV,EAAEqB,kBAA5C,MAGXnB,EAAY,kBAAD,WAAwBvV,EAAIqV,EAAEmB,MAA9B,gBAA2CxW,EAAIqV,EAAEgB,YAAjD,UACXd,EAAY,aAAD,WAAmBvV,EAAIqV,EAAEmB,MAAzB,gBAAsCxW,EAAIqV,EAAEa,WAA5C,UAIXX,EAAY,iBAAD,gBAA4BvV,EAAIqV,EAAEmB,MAAlC,gBACHxW,EAAIqV,EAAEgB,YADH,YACkBrW,EAAIqV,EAAEoB,aADxB,MACyC,GACpDhmB,EAAQumB,sBAAwB,SAMhCzB,EAAY,cAAe,gBAASvV,EAAIqV,EAAEoB,aAAf,4BAEJzW,EAAIqV,EAAEoB,aAFF,cAK3BlB,EAAY,mBAAoB,gBAASvV,EAAIqV,EAAEqB,kBAAf,4BAEJ1W,EAAIqV,EAAEqB,kBAFF,cAMhCnB,EAAY,OAAQ,mBAEpBA,EAAY,OAAQ,yBACpBA,EAAY,UAAW,4B,kQCrLvB,IAAMH,EACe,iBAAnB,IAAO5P,EAAP,cAAOA,KACPA,EAAQ4B,KACR5B,EAAQ4B,IAAI6P,YACZ,cAAcrT,KAAK4B,EAAQ4B,IAAI6P,YAC7B,wCAAIlQ,EAAJ,yBAAIA,EAAJ,uBAAa,EAAAxM,SAAQ5J,MAAR,SAAc,UAAd,OAA2BoW,KACxC,aAEJvW,EAAOC,QAAU2kB,I,6aCRjB,IAAMA,EAAQvkB,EAAQ,I,EACmBA,EAAQ,IAAzC8Q,E,EAAAA,WAAYH,E,EAAAA,iB,EACF3Q,EAAQ,IAAlB+T,E,EAAAA,GAAIyQ,E,EAAAA,EAEJ6B,EAAuBrmB,EAAQ,KAA/BqmB,mBACFC,E,WACJ,WAAare,EAAS7B,GAOpB,G,4FAP6B,SACxBA,GAA8B,WAAnB,EAAOA,KACrBA,EAAU,CACRmgB,QAASngB,EACTogB,mBAAmB,IAGnBve,aAAmBqe,EAAQ,CAC7B,GAAIre,EAAQse,UAAYngB,EAAQmgB,OAC5Bte,EAAQue,sBAAwBpgB,EAAQogB,kBAC1C,OAAOve,EAEPA,EAAUA,EAAQA,aAEf,GAAuB,iBAAZA,EAChB,MAAM,IAAIrD,UAAJ,2BAAkCqD,IAG1C,GAAIA,EAAQ7F,OAAS0O,EACnB,MAAM,IAAIlM,UAAJ,iCACsBkM,EADtB,gBAKRyT,EAAM,SAAUtc,EAAS7B,GACzBnF,KAAKmF,QAAUA,EACfnF,KAAKslB,QAAUngB,EAAQmgB,MAGvBtlB,KAAKulB,oBAAsBpgB,EAAQogB,kBAEnC,IAAMC,EAAIxe,EAAQ3D,OAAOwP,MAAM1N,EAAQmgB,MAAQxS,EAAGyQ,EAAEkC,OAAS3S,EAAGyQ,EAAEmC,OAElE,IAAKF,EACH,MAAM,IAAI7hB,UAAJ,2BAAkCqD,IAU1C,GAPAhH,KAAK2lB,IAAM3e,EAGXhH,KAAK4lB,OAASJ,EAAE,GAChBxlB,KAAK6lB,OAASL,EAAE,GAChBxlB,KAAK8lB,OAASN,EAAE,GAEZxlB,KAAK4lB,MAAQlW,GAAoB1P,KAAK4lB,MAAQ,EAChD,MAAM,IAAIjiB,UAAU,yBAGtB,GAAI3D,KAAK6lB,MAAQnW,GAAoB1P,KAAK6lB,MAAQ,EAChD,MAAM,IAAIliB,UAAU,yBAGtB,GAAI3D,KAAK8lB,MAAQpW,GAAoB1P,KAAK8lB,MAAQ,EAChD,MAAM,IAAIniB,UAAU,yBAIjB6hB,EAAE,GAGLxlB,KAAK+lB,WAAaP,EAAE,GAAGjf,MAAM,KAAKwT,KAAI,SAACxK,GACrC,GAAI,WAAWuC,KAAKvC,GAAK,CACvB,IAAMyW,GAAOzW,EACb,GAAIyW,GAAO,GAAKA,EAAMtW,EACpB,OAAOsW,EAGX,OAAOzW,KATTvP,KAAK+lB,WAAa,GAapB/lB,KAAKimB,MAAQT,EAAE,GAAKA,EAAE,GAAGjf,MAAM,KAAO,GACtCvG,KAAKkmB,S,wDAQL,OAJAlmB,KAAKgH,QAAL,UAAkBhH,KAAK4lB,MAAvB,YAAgC5lB,KAAK6lB,MAArC,YAA8C7lB,KAAK8lB,OAC/C9lB,KAAK+lB,WAAW5kB,SAClBnB,KAAKgH,SAAL,WAAoBhH,KAAK+lB,WAAWnf,KAAK,OAEpC5G,KAAKgH,U,iCAIZ,OAAOhH,KAAKgH,U,8BAGLmf,GAEP,GADA7C,EAAM,iBAAkBtjB,KAAKgH,QAAShH,KAAKmF,QAASghB,KAC9CA,aAAiBd,GAAS,CAC9B,GAAqB,iBAAVc,GAAsBA,IAAUnmB,KAAKgH,QAC9C,OAAO,EAETmf,EAAQ,IAAId,EAAOc,EAAOnmB,KAAKmF,SAGjC,OAAIghB,EAAMnf,UAAYhH,KAAKgH,QAClB,EAGFhH,KAAKomB,YAAYD,IAAUnmB,KAAKqmB,WAAWF,K,kCAGvCA,GAKX,OAJMA,aAAiBd,IACrBc,EAAQ,IAAId,EAAOc,EAAOnmB,KAAKmF,UAI/BigB,EAAmBplB,KAAK4lB,MAAOO,EAAMP,QACrCR,EAAmBplB,KAAK6lB,MAAOM,EAAMN,QACrCT,EAAmBplB,KAAK8lB,MAAOK,EAAML,S,iCAI7BK,GAMV,GALMA,aAAiBd,IACrBc,EAAQ,IAAId,EAAOc,EAAOnmB,KAAKmF,UAI7BnF,KAAK+lB,WAAW5kB,SAAWglB,EAAMJ,WAAW5kB,OAC9C,OAAQ,EACH,IAAKnB,KAAK+lB,WAAW5kB,QAAUglB,EAAMJ,WAAW5kB,OACrD,OAAO,EACF,IAAKnB,KAAK+lB,WAAW5kB,SAAWglB,EAAMJ,WAAW5kB,OACtD,OAAO,EAGT,IAAIF,EAAI,EACR,EAAG,CACD,IAAMiC,EAAIlD,KAAK+lB,WAAW9kB,GACpBkC,EAAIgjB,EAAMJ,WAAW9kB,GAE3B,GADAqiB,EAAM,qBAAsBriB,EAAGiC,EAAGC,QACxB4C,IAAN7C,QAAyB6C,IAAN5C,EACrB,OAAO,EACF,QAAU4C,IAAN5C,EACT,OAAO,EACF,QAAU4C,IAAN7C,EACT,OAAQ,EACH,GAAIA,IAAMC,EAGf,OAAOiiB,EAAmBliB,EAAGC,WAEtBlC,K,mCAGCklB,GACNA,aAAiBd,IACrBc,EAAQ,IAAId,EAAOc,EAAOnmB,KAAKmF,UAGjC,IAAIlE,EAAI,EACR,EAAG,CACD,IAAMiC,EAAIlD,KAAKimB,MAAMhlB,GACfkC,EAAIgjB,EAAMF,MAAMhlB,GAEtB,GADAqiB,EAAM,qBAAsBriB,EAAGiC,EAAGC,QACxB4C,IAAN7C,QAAyB6C,IAAN5C,EACrB,OAAO,EACF,QAAU4C,IAAN5C,EACT,OAAO,EACF,QAAU4C,IAAN7C,EACT,OAAQ,EACH,GAAIA,IAAMC,EAGf,OAAOiiB,EAAmBliB,EAAGC,WAEtBlC,K,0BAKRqlB,EAASC,GACZ,OAAQD,GACN,IAAK,WACHtmB,KAAK+lB,WAAW5kB,OAAS,EACzBnB,KAAK8lB,MAAQ,EACb9lB,KAAK6lB,MAAQ,EACb7lB,KAAK4lB,QACL5lB,KAAKwmB,IAAI,MAAOD,GAChB,MACF,IAAK,WACHvmB,KAAK+lB,WAAW5kB,OAAS,EACzBnB,KAAK8lB,MAAQ,EACb9lB,KAAK6lB,QACL7lB,KAAKwmB,IAAI,MAAOD,GAChB,MACF,IAAK,WAIHvmB,KAAK+lB,WAAW5kB,OAAS,EACzBnB,KAAKwmB,IAAI,QAASD,GAClBvmB,KAAKwmB,IAAI,MAAOD,GAChB,MAGF,IAAK,aAC4B,IAA3BvmB,KAAK+lB,WAAW5kB,QAClBnB,KAAKwmB,IAAI,QAASD,GAEpBvmB,KAAKwmB,IAAI,MAAOD,GAChB,MAEF,IAAK,QAMc,IAAfvmB,KAAK6lB,OACU,IAAf7lB,KAAK8lB,OACsB,IAA3B9lB,KAAK+lB,WAAW5kB,QAEhBnB,KAAK4lB,QAEP5lB,KAAK6lB,MAAQ,EACb7lB,KAAK8lB,MAAQ,EACb9lB,KAAK+lB,WAAa,GAClB,MACF,IAAK,QAKgB,IAAf/lB,KAAK8lB,OAA0C,IAA3B9lB,KAAK+lB,WAAW5kB,QACtCnB,KAAK6lB,QAEP7lB,KAAK8lB,MAAQ,EACb9lB,KAAK+lB,WAAa,GAClB,MACF,IAAK,QAK4B,IAA3B/lB,KAAK+lB,WAAW5kB,QAClBnB,KAAK8lB,QAEP9lB,KAAK+lB,WAAa,GAClB,MAGF,IAAK,MACH,GAA+B,IAA3B/lB,KAAK+lB,WAAW5kB,OAClBnB,KAAK+lB,WAAa,CAAC,OACd,CAEL,IADA,IAAI9kB,EAAIjB,KAAK+lB,WAAW5kB,SACfF,GAAK,GACsB,iBAAvBjB,KAAK+lB,WAAW9kB,KACzBjB,KAAK+lB,WAAW9kB,KAChBA,GAAK,IAGE,IAAPA,GAEFjB,KAAK+lB,WAAW5Q,KAAK,GAGrBoR,IAGEvmB,KAAK+lB,WAAW,KAAOQ,EACrB/Z,MAAMxM,KAAK+lB,WAAW,MACxB/lB,KAAK+lB,WAAa,CAACQ,EAAY,IAGjCvmB,KAAK+lB,WAAa,CAACQ,EAAY,IAGnC,MAEF,QACE,MAAM,IAAI3S,MAAJ,sCAAyC0S,IAInD,OAFAtmB,KAAKkmB,SACLlmB,KAAK2lB,IAAM3lB,KAAKgH,QACThH,U,gCAIXtB,EAAOC,QAAU0mB,G,6BChSjB,IAaI/U,EAAmBmW,EAAmCC,EAbtD9lB,EAAiB7B,EAAQ,IACzB+F,EAA8B/F,EAAQ,GACtCE,EAAMF,EAAQ,GACd0P,EAAkB1P,EAAQ,GAC1BoR,EAAUpR,EAAQ,IAElByR,EAAW/B,EAAgB,YAC3B8B,GAAyB,EAQzB,GAAGjB,OAGC,SAFNoX,EAAgB,GAAGpX,SAIjBmX,EAAoC7lB,EAAeA,EAAe8lB,OACxBtmB,OAAOC,YAAWiQ,EAAoBmW,GAHlDlW,GAAyB,GAOlCxK,MAArBuK,IAAgCA,EAAoB,IAGnDH,GAAYlR,EAAIqR,EAAmBE,IACtC1L,EAA4BwL,EAAmBE,GApBhC,WAAc,OAAOxQ,QAuBtCtB,EAAOC,QAAU,CACf2R,kBAAmBA,EACnBC,uBAAwBA,I,gBCnC1B,IAAItR,EAAMF,EAAQ,GACd+Y,EAAW/Y,EAAQ,IACnBkM,EAAYlM,EAAQ,IACpB4nB,EAA2B5nB,EAAQ,KAEnCkO,EAAWhC,EAAU,YACrB2b,EAAkBxmB,OAAOC,UAI7B3B,EAAOC,QAAUgoB,EAA2BvmB,OAAOQ,eAAiB,SAAU0D,GAE5E,OADAA,EAAIwT,EAASxT,GACTrF,EAAIqF,EAAG2I,GAAkB3I,EAAE2I,GACH,mBAAjB3I,EAAE9C,aAA6B8C,aAAaA,EAAE9C,YAChD8C,EAAE9C,YAAYnB,UACdiE,aAAalE,OAASwmB,EAAkB,O,gBCfnD,IAAI1iB,EAAWnF,EAAQ,GACnB8nB,EAAqB9nB,EAAQ,KAMjCL,EAAOC,QAAUyB,OAAO6P,iBAAmB,aAAe,GAAK,WAC7D,IAEI6W,EAFAC,GAAiB,EACjBjV,EAAO,GAEX,KACEgV,EAAS1mB,OAAOyE,yBAAyBzE,OAAOC,UAAW,aAAayK,KACjEtK,KAAKsR,EAAM,IAClBiV,EAAiBjV,aAAgBoD,MACjC,MAAOrW,IACT,OAAO,SAAwByF,EAAGuN,GAKhC,OAJA3N,EAASI,GACTuiB,EAAmBhV,GACfkV,EAAgBD,EAAOtmB,KAAK8D,EAAGuN,GAC9BvN,EAAE0iB,UAAYnV,EACZvN,GAdoD,QAgBzDyB,I,qPCvBN,IAAImF,EAAanM,EAAQ,IACrB2B,EAAW3B,EAAQ,GACnBE,EAAMF,EAAQ,GACd+E,EAAiB/E,EAAQ,GAAuCsF,EAChEnF,EAAMH,EAAQ,IACdkoB,EAAWloB,EAAQ,KAEnBmoB,EAAWhoB,EAAI,QACfqQ,EAAK,EAEL4X,EAAe/mB,OAAO+mB,cAAgB,WACxC,OAAO,GAGLC,EAAc,SAAUznB,GAC1BmE,EAAenE,EAAIunB,EAAU,CAAEziB,MAAO,CACpC4iB,SAAU,OAAQ9X,EAClB+X,SAAU,OAoCVC,EAAO7oB,EAAOC,QAAU,CAC1B6oB,UAAU,EACVC,QAlCY,SAAU9nB,EAAI2O,GAE1B,IAAK5N,EAASf,GAAK,MAAoB,UAAb,EAAOA,GAAiBA,GAAmB,iBAANA,EAAiB,IAAM,KAAOA,EAC7F,IAAKV,EAAIU,EAAIunB,GAAW,CAEtB,IAAKC,EAAaxnB,GAAK,MAAO,IAE9B,IAAK2O,EAAQ,MAAO,IAEpB8Y,EAAYznB,GAEZ,OAAOA,EAAGunB,GAAUG,UAwBtBK,YArBgB,SAAU/nB,EAAI2O,GAC9B,IAAKrP,EAAIU,EAAIunB,GAAW,CAEtB,IAAKC,EAAaxnB,GAAK,OAAO,EAE9B,IAAK2O,EAAQ,OAAO,EAEpB8Y,EAAYznB,GAEZ,OAAOA,EAAGunB,GAAUI,UAatBK,SATa,SAAUhoB,GAEvB,OADIsnB,GAAYM,EAAKC,UAAYL,EAAaxnB,KAAQV,EAAIU,EAAIunB,IAAWE,EAAYznB,GAC9EA,IAUTuL,EAAWgc,IAAY,G,cC1DvBxoB,EAAOC,QAAU,CACfipB,YAAa,EACbC,oBAAqB,EACrBC,aAAc,EACdC,eAAgB,EAChBC,YAAa,EACbC,cAAe,EACfC,aAAc,EACdC,qBAAsB,EACtBC,SAAU,EACVC,kBAAmB,EACnBC,eAAgB,EAChBC,gBAAiB,EACjBC,kBAAmB,EACnBC,UAAW,EACXC,cAAe,EACfC,aAAc,EACdC,SAAU,EACVC,iBAAkB,EAClBC,OAAQ,EACRC,YAAa,EACbC,cAAe,EACfC,cAAe,EACfC,eAAgB,EAChBC,aAAc,EACdC,cAAe,EACfC,iBAAkB,EAClBC,iBAAkB,EAClBC,eAAgB,EAChBC,iBAAkB,EAClBC,cAAe,EACfC,UAAW,I,6BChCb,IAAIxlB,EAAWnF,EAAQ,GAIvBL,EAAOC,QAAU,WACf,IAAI8N,EAAOvI,EAASlE,MAChB6C,EAAS,GAOb,OANI4J,EAAK3N,SAAQ+D,GAAU,KACvB4J,EAAKkd,aAAY9mB,GAAU,KAC3B4J,EAAK2G,YAAWvQ,GAAU,KAC1B4J,EAAKmd,SAAQ/mB,GAAU,KACvB4J,EAAKod,UAAShnB,GAAU,KACxB4J,EAAKsG,SAAQlQ,GAAU,KACpBA,I,8BCNTnE,EAAOC,QAAU,SAAUmrB,GACzB,IAAIC,EAAO,GAuDX,OArDAA,EAAK5pB,SAAW,WACd,OAAOH,KAAK+Z,KAAI,SAAUiQ,GACxB,IAAIvmB,EAsDV,SAAgCumB,EAAMF,GACpC,IAAIrmB,EAAUumB,EAAK,IAAM,GAErBC,EAAaD,EAAK,GAEtB,IAAKC,EACH,OAAOxmB,EAGT,GAAIqmB,GAAgC,mBAAT3J,KAAqB,CAC9C,IAAI+J,GAWWC,EAXeF,EAa5BG,EAASjK,KAAKF,SAAS1Y,mBAAmBqW,KAAKC,UAAUsM,MACzD7S,EAAO,+DAA+DzM,OAAOuf,GAC1E,OAAOvf,OAAOyM,EAAM,QAdrB+S,EAAaJ,EAAWK,QAAQvQ,KAAI,SAAU3U,GAChD,MAAO,iBAAiByF,OAAOof,EAAWM,YAAc,IAAI1f,OAAOzF,EAAQ,UAE7E,MAAO,CAAC3B,GAASoH,OAAOwf,GAAYxf,OAAO,CAACqf,IAAgBtjB,KAAK,MAOrE,IAAmBujB,EAEbC,EACA9S,EAPJ,MAAO,CAAC7T,GAASmD,KAAK,MAvEJ4jB,CAAuBR,EAAMF,GAE3C,OAAIE,EAAK,GACA,UAAUnf,OAAOmf,EAAK,GAAI,MAAMnf,OAAOpH,EAAS,KAGlDA,KACNmD,KAAK,KAKVmjB,EAAK9oB,EAAI,SAAUwpB,EAASC,EAAYC,GACf,iBAAZF,IAETA,EAAU,CAAC,CAAC,KAAMA,EAAS,MAG7B,IAAIG,EAAyB,GAE7B,GAAID,EACF,IAAK,IAAI1pB,EAAI,EAAGA,EAAIjB,KAAKmB,OAAQF,IAAK,CAEpC,IAAIsO,EAAKvP,KAAKiB,GAAG,GAEP,MAANsO,IACFqb,EAAuBrb,IAAM,GAKnC,IAAK,IAAIsb,EAAK,EAAGA,EAAKJ,EAAQtpB,OAAQ0pB,IAAM,CAC1C,IAAIb,EAAO,GAAGnf,OAAO4f,EAAQI,IAEzBF,GAAUC,EAAuBZ,EAAK,MAKtCU,IACGV,EAAK,GAGRA,EAAK,GAAK,GAAGnf,OAAO6f,EAAY,SAAS7f,OAAOmf,EAAK,IAFrDA,EAAK,GAAKU,GAMdX,EAAK5U,KAAK6U,MAIPD,I,6BC5DM,SAASe,EAAcC,EAAUhB,GAG9C,IAFA,IAAIiB,EAAS,GACTC,EAAY,GACPhqB,EAAI,EAAGA,EAAI8oB,EAAK5oB,OAAQF,IAAK,CACpC,IAAI+oB,EAAOD,EAAK9oB,GACZsO,EAAKya,EAAK,GAIVkB,EAAO,CACT3b,GAAIwb,EAAW,IAAM9pB,EACrBkqB,IALQnB,EAAK,GAMboB,MALUpB,EAAK,GAMfG,UALcH,EAAK,IAOhBiB,EAAU1b,GAGb0b,EAAU1b,GAAIkO,MAAMtI,KAAK+V,GAFzBF,EAAO7V,KAAK8V,EAAU1b,GAAM,CAAEA,GAAIA,EAAIkO,MAAO,CAACyN,KAKlD,OAAOF,E,+CCjBT,IAAIK,EAAkC,oBAAb1oB,SAEzB,GAAqB,oBAAV2oB,OAAyBA,QAC7BD,EACH,MAAM,IAAIzX,MACV,2JAkBJ,IAAI2X,EAAc,GAQdC,EAAOH,IAAgB1oB,SAAS6oB,MAAQ7oB,SAAS8oB,qBAAqB,QAAQ,IAC9EC,EAAmB,KACnBC,EAAmB,EACnBC,GAAe,EACf7W,EAAO,aACP5P,EAAU,KAKV0mB,EAA+B,oBAAdppB,WAA6B,eAAeqP,KAAKrP,UAAU8X,UAAU5C,eAE3E,SAASmU,EAAiBf,EAAUhB,EAAMgC,EAAeC,GACtEJ,EAAeG,EAEf5mB,EAAU6mB,GAAY,GAEtB,IAAIhB,EAASF,EAAaC,EAAUhB,GAGpC,OAFAkC,EAAejB,GAER,SAAiBkB,GAEtB,IADA,IAAIC,EAAY,GACPlrB,EAAI,EAAGA,EAAI+pB,EAAO7pB,OAAQF,IAAK,CACtC,IAAI+oB,EAAOgB,EAAO/pB,IACdmrB,EAAWb,EAAYvB,EAAKza,KACvB8c,OACTF,EAAUhX,KAAKiX,GAEbF,EAEFD,EADAjB,EAASF,EAAaC,EAAUmB,IAGhClB,EAAS,GAEX,IAAS/pB,EAAI,EAAGA,EAAIkrB,EAAUhrB,OAAQF,IAAK,CACzC,IAAImrB,EACJ,GAAsB,KADlBA,EAAWD,EAAUlrB,IACZorB,KAAY,CACvB,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAS3O,MAAMtc,OAAQmrB,IACzCF,EAAS3O,MAAM6O,YAEVf,EAAYa,EAAS7c,OAMpC,SAAS0c,EAAgBjB,GACvB,IAAK,IAAI/pB,EAAI,EAAGA,EAAI+pB,EAAO7pB,OAAQF,IAAK,CACtC,IAAI+oB,EAAOgB,EAAO/pB,GACdmrB,EAAWb,EAAYvB,EAAKza,IAChC,GAAI6c,EAAU,CACZA,EAASC,OACT,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAS3O,MAAMtc,OAAQmrB,IACzCF,EAAS3O,MAAM6O,GAAGtC,EAAKvM,MAAM6O,IAE/B,KAAOA,EAAItC,EAAKvM,MAAMtc,OAAQmrB,IAC5BF,EAAS3O,MAAMtI,KAAKoX,EAASvC,EAAKvM,MAAM6O,KAEtCF,EAAS3O,MAAMtc,OAAS6oB,EAAKvM,MAAMtc,SACrCirB,EAAS3O,MAAMtc,OAAS6oB,EAAKvM,MAAMtc,YAEhC,CACL,IAAIsc,EAAQ,GACZ,IAAS6O,EAAI,EAAGA,EAAItC,EAAKvM,MAAMtc,OAAQmrB,IACrC7O,EAAMtI,KAAKoX,EAASvC,EAAKvM,MAAM6O,KAEjCf,EAAYvB,EAAKza,IAAM,CAAEA,GAAIya,EAAKza,GAAI8c,KAAM,EAAG5O,MAAOA,KAK5D,SAAS+O,IACP,IAAIC,EAAe9pB,SAASuW,cAAc,SAG1C,OAFAuT,EAAa1kB,KAAO,WACpByjB,EAAKvd,YAAYwe,GACVA,EAGT,SAASF,EAAUxrB,GACjB,IAAI2rB,EAAQC,EACRF,EAAe9pB,SAASiqB,cAAc,2BAA8B7rB,EAAIwO,GAAK,MAEjF,GAAIkd,EAAc,CAChB,GAAIb,EAGF,OAAO7W,EAOP0X,EAAaI,WAAWC,YAAYL,GAIxC,GAAIZ,EAAS,CAEX,IAAIkB,EAAapB,IACjBc,EAAef,IAAqBA,EAAmBc,KACvDE,EAASM,EAAoB9sB,KAAK,KAAMusB,EAAcM,GAAY,GAClEJ,EAASK,EAAoB9sB,KAAK,KAAMusB,EAAcM,GAAY,QAGlEN,EAAeD,IACfE,EAASO,EAAW/sB,KAAK,KAAMusB,GAC/BE,EAAS,WACPF,EAAaI,WAAWC,YAAYL,IAMxC,OAFAC,EAAO3rB,GAEA,SAAsBmsB,GAC3B,GAAIA,EAAQ,CACV,GAAIA,EAAO/B,MAAQpqB,EAAIoqB,KACnB+B,EAAO9B,QAAUrqB,EAAIqqB,OACrB8B,EAAO/C,YAAcppB,EAAIopB,UAC3B,OAEFuC,EAAO3rB,EAAMmsB,QAEbP,KAKN,IACMQ,EADFC,GACED,EAAY,GAET,SAAU9Z,EAAO8D,GAEtB,OADAgW,EAAU9Z,GAAS8D,EACZgW,EAAUnT,OAAOhB,SAASpS,KAAK,QAI1C,SAASomB,EAAqBP,EAAcpZ,EAAOsZ,EAAQ5rB,GACzD,IAAIoqB,EAAMwB,EAAS,GAAK5rB,EAAIoqB,IAE5B,GAAIsB,EAAaY,WACfZ,EAAaY,WAAWC,QAAUF,EAAY/Z,EAAO8X,OAChD,CACL,IAAIoC,EAAU5qB,SAAS6qB,eAAerC,GAClCsC,EAAahB,EAAagB,WAC1BA,EAAWpa,IAAQoZ,EAAaK,YAAYW,EAAWpa,IACvDoa,EAAWtsB,OACbsrB,EAAaiB,aAAaH,EAASE,EAAWpa,IAE9CoZ,EAAaxe,YAAYsf,IAK/B,SAASN,EAAYR,EAAc1rB,GACjC,IAAIoqB,EAAMpqB,EAAIoqB,IACVC,EAAQrqB,EAAIqqB,MACZjB,EAAYppB,EAAIopB,UAiBpB,GAfIiB,GACFqB,EAAakB,aAAa,QAASvC,GAEjCjmB,EAAQyoB,OACVnB,EAAakB,aA7JF,kBA6JyB5sB,EAAIwO,IAGtC4a,IAGFgB,GAAO,mBAAqBhB,EAAUG,QAAQ,GAAK,MAEnDa,GAAO,uDAAyDhL,KAAKF,SAAS1Y,mBAAmBqW,KAAKC,UAAUsM,MAAgB,OAG9HsC,EAAaY,WACfZ,EAAaY,WAAWC,QAAUnC,MAC7B,CACL,KAAOsB,EAAaoB,YAClBpB,EAAaK,YAAYL,EAAaoB,YAExCpB,EAAaxe,YAAYtL,SAAS6qB,eAAerC,O,6BC1NrD,IAAI9O,EAAStd,EAAQ,IAAiCsd,OAClDnW,EAAsBnH,EAAQ,IAC9B4X,EAAiB5X,EAAQ,IAGzB6X,EAAmB1Q,EAAoB4E,IACvC3E,EAAmBD,EAAoByF,UAFrB,mBAMtBgL,EAAe/S,OAAQ,UAAU,SAAUiT,GACzCD,EAAiB5W,KAAM,CACrB+H,KARkB,kBASlB2P,OAAQ9T,OAAOiT,GACfxD,MAAO,OAIR,WACD,IAGIya,EAHAtnB,EAAQL,EAAiBnG,MACzB0X,EAASlR,EAAMkR,OACfrE,EAAQ7M,EAAM6M,MAElB,OAAIA,GAASqE,EAAOvW,OAAe,CAAEsD,WAAOsB,EAAWgR,MAAM,IAC7D+W,EAAQzR,EAAO3E,EAAQrE,GACvB7M,EAAM6M,OAASya,EAAM3sB,OACd,CAAEsD,MAAOqpB,EAAO/W,MAAM,Q,6BC1B/B,IAAIhS,EAAWhG,EAAQ,IACnBmF,EAAWnF,EAAQ,GACnB8E,EAAQ9E,EAAQ,GAChBiU,EAAQjU,EAAQ,IAGhBgvB,EAAkB3b,OAAO/R,UACzB2tB,EAAiBD,EAAe,SAEhCE,EAAcpqB,GAAM,WAAc,MAA2D,QAApDmqB,EAAextB,KAAK,CAAE4E,OAAQ,IAAK4N,MAAO,SAEnFkb,EANY,YAMKF,EAAevuB,MAIhCwuB,GAAeC,IACjBnpB,EAASqN,OAAO/R,UAXF,YAWwB,WACpC,IAAImjB,EAAItf,EAASlE,MACbmuB,EAAIvqB,OAAO4f,EAAEpe,QACbgpB,EAAK5K,EAAExQ,MAEX,MAAO,IAAMmb,EAAI,IADTvqB,YAAcmC,IAAPqoB,GAAoB5K,aAAapR,UAAY,UAAW2b,GAAmB/a,EAAMxS,KAAKgjB,GAAK4K,KAEzG,CAAE3nB,QAAQ,K,gBCvBf,IAAI3H,EAASC,EAAQ,GACjBsvB,EAAetvB,EAAQ,IACvBuvB,EAAuBvvB,EAAQ,IAC/B+F,EAA8B/F,EAAQ,GACtC0P,EAAkB1P,EAAQ,GAE1ByR,EAAW/B,EAAgB,YAC3BD,EAAgBC,EAAgB,eAChC8f,EAAcD,EAAqB1c,OAEvC,IAAK,IAAI4c,KAAmBH,EAAc,CACxC,IAAII,EAAa3vB,EAAO0vB,GACpBE,EAAsBD,GAAcA,EAAWpuB,UACnD,GAAIquB,EAAqB,CAEvB,GAAIA,EAAoBle,KAAc+d,EAAa,IACjDzpB,EAA4B4pB,EAAqBle,EAAU+d,GAC3D,MAAO1vB,GACP6vB,EAAoBle,GAAY+d,EAKlC,GAHKG,EAAoBlgB,IACvB1J,EAA4B4pB,EAAqBlgB,EAAeggB,GAE9DH,EAAaG,GAAkB,IAAK,IAAIxf,KAAesf,EAEzD,GAAII,EAAoB1f,KAAiBsf,EAAqBtf,GAAc,IAC1ElK,EAA4B4pB,EAAqB1f,EAAasf,EAAqBtf,IACnF,MAAOnQ,GACP6vB,EAAoB1f,GAAesf,EAAqBtf,O,6BC3BhE,IAAIe,EAAIhR,EAAQ,IACZ4vB,EAAW5vB,EAAQ,IAA+BoU,QAClD+P,EAAsBnkB,EAAQ,IAC9BokB,EAA0BpkB,EAAQ,IAElC6vB,EAAgB,GAAGzb,QAEnB0b,IAAkBD,GAAiB,EAAI,CAAC,GAAGzb,QAAQ,GAAI,GAAK,EAC5DiQ,EAAgBF,EAAoB,WACpCG,EAAiBF,EAAwB,UAAW,CAAElU,WAAW,EAAMwN,EAAG,IAI9E1M,EAAE,CAAE1K,OAAQ,QAASwM,OAAO,EAAM/L,OAAQ+oB,IAAkBzL,IAAkBC,GAAkB,CAC9FlQ,QAAS,SAAiB2b,GACxB,OAAOD,EAEHD,EAAcjiB,MAAM3M,KAAMgD,YAAc,EACxC2rB,EAAS3uB,KAAM8uB,EAAe9rB,UAAU7B,OAAS,EAAI6B,UAAU,QAAK+C,O,6BClB5E,IAAIgpB,EAAgChwB,EAAQ,KACxCmF,EAAWnF,EAAQ,GACnB+Y,EAAW/Y,EAAQ,IACnBgZ,EAAWhZ,EAAQ,IACnB6J,EAAY7J,EAAQ,IACpBgK,EAAyBhK,EAAQ,IACjCiwB,EAAqBjwB,EAAQ,KAC7BkwB,EAAalwB,EAAQ,KAErBmwB,EAAMtvB,KAAKsvB,IACXrmB,EAAMjJ,KAAKiJ,IACX0D,EAAQ3M,KAAK2M,MACb4iB,EAAuB,4BACvBC,EAAgC,oBAOpCL,EAA8B,UAAW,GAAG,SAAUM,EAAShd,EAAeid,EAAiBC,GAC7F,IAAIC,EAA+CD,EAAOC,6CACtDC,EAAmBF,EAAOE,iBAC1BC,EAAoBF,EAA+C,IAAM,KAE7E,MAAO,CAGL,SAAiBG,EAAaC,GAC5B,IAAItrB,EAAIyE,EAAuB/I,MAC3B6vB,EAA0B9pB,MAAf4pB,OAA2B5pB,EAAY4pB,EAAYN,GAClE,YAAoBtpB,IAAb8pB,EACHA,EAASrvB,KAAKmvB,EAAarrB,EAAGsrB,GAC9Bvd,EAAc7R,KAAKoD,OAAOU,GAAIqrB,EAAaC,IAIjD,SAAUE,EAAQF,GAChB,IACIJ,GAAgDC,GACzB,iBAAjBG,IAA0E,IAA7CA,EAAazc,QAAQuc,GAC1D,CACA,IAAIK,EAAMT,EAAgBjd,EAAeyd,EAAQ9vB,KAAM4vB,GACvD,GAAIG,EAAIhZ,KAAM,OAAOgZ,EAAItrB,MAG3B,IAAIurB,EAAK9rB,EAAS4rB,GACd5T,EAAItY,OAAO5D,MAEXiwB,EAA4C,mBAAjBL,EAC1BK,IAAmBL,EAAehsB,OAAOgsB,IAE9C,IAAI9wB,EAASkxB,EAAGlxB,OAChB,GAAIA,EAAQ,CACV,IAAIoxB,EAAcF,EAAGnG,QACrBmG,EAAGxd,UAAY,EAGjB,IADA,IAAI2d,EAAU,KACD,CACX,IAAIttB,EAASosB,EAAWe,EAAI9T,GAC5B,GAAe,OAAXrZ,EAAiB,MAGrB,GADAstB,EAAQhb,KAAKtS,IACR/D,EAAQ,MAGI,KADF8E,OAAOf,EAAO,MACRmtB,EAAGxd,UAAYwc,EAAmB9S,EAAGnE,EAASiY,EAAGxd,WAAY0d,IAKpF,IAFA,IAtDwBvwB,EAsDpBywB,EAAoB,GACpBC,EAAqB,EAChBpvB,EAAI,EAAGA,EAAIkvB,EAAQhvB,OAAQF,IAAK,CACvC4B,EAASstB,EAAQlvB,GAUjB,IARA,IAAIqvB,EAAU1sB,OAAOf,EAAO,IACxBsZ,EAAW+S,EAAIrmB,EAAID,EAAU/F,EAAOwQ,OAAQ6I,EAAE/a,QAAS,GACvDovB,EAAW,GAMNjE,EAAI,EAAGA,EAAIzpB,EAAO1B,OAAQmrB,IAAKiE,EAASpb,UAlEzCpP,KADcpG,EAmE8CkD,EAAOypB,IAlEvD3sB,EAAKiE,OAAOjE,IAmEhC,IAAI6wB,EAAgB3tB,EAAO4tB,OAC3B,GAAIR,EAAmB,CACrB,IAAIS,EAAe,CAACJ,GAASzlB,OAAO0lB,EAAUpU,EAAUD,QAClCnW,IAAlByqB,GAA6BE,EAAavb,KAAKqb,GACnD,IAAIrZ,EAAcvT,OAAOgsB,EAAajjB,WAAM5G,EAAW2qB,SAEvDvZ,EAAcwZ,EAAgBL,EAASpU,EAAGC,EAAUoU,EAAUC,EAAeZ,GAE3EzT,GAAYkU,IACdD,GAAqBlU,EAAEnZ,MAAMstB,EAAoBlU,GAAYhF,EAC7DkZ,EAAqBlU,EAAWmU,EAAQnvB,QAG5C,OAAOivB,EAAoBlU,EAAEnZ,MAAMstB,KAKvC,SAASM,EAAgBL,EAAShtB,EAAK6Y,EAAUoU,EAAUC,EAAerZ,GACxE,IAAIyZ,EAAUzU,EAAWmU,EAAQnvB,OAC7BqkB,EAAI+K,EAASpvB,OACb0vB,EAAUzB,EAKd,YAJsBrpB,IAAlByqB,IACFA,EAAgB1Y,EAAS0Y,GACzBK,EAAU1B,GAEL9c,EAAc7R,KAAK2W,EAAa0Z,GAAS,SAAUhe,EAAOie,GAC/D,IAAIC,EACJ,OAAQD,EAAGzU,OAAO,IAChB,IAAK,IAAK,MAAO,IACjB,IAAK,IAAK,OAAOiU,EACjB,IAAK,IAAK,OAAOhtB,EAAIP,MAAM,EAAGoZ,GAC9B,IAAK,IAAK,OAAO7Y,EAAIP,MAAM6tB,GAC3B,IAAK,IACHG,EAAUP,EAAcM,EAAG/tB,MAAM,GAAI,IACrC,MACF,QACE,IAAI8V,GAAKiY,EACT,GAAU,IAANjY,EAAS,OAAOhG,EACpB,GAAIgG,EAAI2M,EAAG,CACT,IAAInhB,EAAIkI,EAAMsM,EAAI,IAClB,OAAU,IAANxU,EAAgBwO,EAChBxO,GAAKmhB,OAA8Bzf,IAApBwqB,EAASlsB,EAAI,GAAmBysB,EAAGzU,OAAO,GAAKkU,EAASlsB,EAAI,GAAKysB,EAAGzU,OAAO,GACvFxJ,EAETke,EAAUR,EAAS1X,EAAI,GAE3B,YAAmB9S,IAAZgrB,EAAwB,GAAKA,U,cCnI1CryB,EAAOC,QAAU,SAAUgB,GACzB,GAAiB,mBAANA,EACT,MAAMgE,UAAUC,OAAOjE,GAAM,sBAC7B,OAAOA,I,gBCHX,IAAIyP,EAAUrQ,EAAQ,IAClBqR,EAAYrR,EAAQ,IAGpByR,EAFkBzR,EAAQ,EAEf0P,CAAgB,YAE/B/P,EAAOC,QAAU,SAAUgB,GACzB,GAAUoG,MAANpG,EAAiB,OAAOA,EAAG6Q,IAC1B7Q,EAAG,eACHyQ,EAAUhB,EAAQzP,M,gBCTzB,IAAIyd,EAAqBre,EAAQ,IAG7BmM,EAFcnM,EAAQ,IAEG8L,OAAO,SAAU,aAI9ClM,EAAQ0F,EAAIjE,OAAO4wB,qBAAuB,SAA6B1sB,GACrE,OAAO8Y,EAAmB9Y,EAAG4G,K,6BCP/B,IAAI/G,EAAcpF,EAAQ,IACtB2F,EAAuB3F,EAAQ,GAC/B4F,EAA2B5F,EAAQ,IAEvCL,EAAOC,QAAU,SAAUiG,EAAQxD,EAAKqD,GACtC,IAAIwsB,EAAc9sB,EAAY/C,GAC1B6vB,KAAersB,EAAQF,EAAqBL,EAAEO,EAAQqsB,EAAatsB,EAAyB,EAAGF,IAC9FG,EAAOqsB,GAAexsB,I,6BCP7B,IAAIsL,EAAIhR,EAAQ,IACZmyB,EAAUnyB,EAAQ,IAAgCib,OAClD9B,EAA+BnZ,EAAQ,IACvCokB,EAA0BpkB,EAAQ,IAElCoyB,EAAsBjZ,EAA6B,UAEnDmL,EAAiBF,EAAwB,UAK7CpT,EAAE,CAAE1K,OAAQ,QAASwM,OAAO,EAAM/L,QAASqrB,IAAwB9N,GAAkB,CACnFrJ,OAAQ,SAAgBJ,GACtB,OAAOsX,EAAQlxB,KAAM4Z,EAAY5W,UAAU7B,OAAS,EAAI6B,UAAU,QAAK+C,O,gBCf3E,IAAIrF,EAAW3B,EAAQ,GACnBkR,EAAiBlR,EAAQ,IAG7BL,EAAOC,QAAU,SAAUgb,EAAOyX,EAAOC,GACvC,IAAIC,EAAWC,EAUf,OAPEthB,GAE0C,mBAAlCqhB,EAAYF,EAAM5vB,cAC1B8vB,IAAcD,GACd3wB,EAAS6wB,EAAqBD,EAAUjxB,YACxCkxB,IAAuBF,EAAQhxB,WAC/B4P,EAAe0J,EAAO4X,GACjB5X,I,gBCfT,IAAI5U,EAAWhG,EAAQ,IAEvBL,EAAOC,QAAU,SAAU0G,EAAQ6I,EAAK/I,GACtC,IAAK,IAAI/D,KAAO8M,EAAKnJ,EAASM,EAAQjE,EAAK8M,EAAI9M,GAAM+D,GACrD,OAAOE,I,gBCJT,IAAIuD,EAAY7J,EAAQ,IAEpBmwB,EAAMtvB,KAAKsvB,IACXrmB,EAAMjJ,KAAKiJ,IAKfnK,EAAOC,QAAU,SAAU0U,EAAOlS,GAChC,IAAIqwB,EAAU5oB,EAAUyK,GACxB,OAAOme,EAAU,EAAItC,EAAIsC,EAAUrwB,EAAQ,GAAK0H,EAAI2oB,EAASrwB,K,6BCT/D,IAAI6C,EAAcjF,EAAQ,GACtB8E,EAAQ9E,EAAQ,GAChB0yB,EAAa1yB,EAAQ,IACrB2yB,EAA8B3yB,EAAQ,IACtCkY,EAA6BlY,EAAQ,IACrC+Y,EAAW/Y,EAAQ,IACnBsN,EAAgBtN,EAAQ,IAExB4yB,EAAevxB,OAAOyX,OACtB/T,EAAiB1D,OAAO0D,eAI5BpF,EAAOC,SAAWgzB,GAAgB9tB,GAAM,WAEtC,GAAIG,GAQiB,IARF2tB,EAAa,CAAExuB,EAAG,GAAKwuB,EAAa7tB,EAAe,GAAI,IAAK,CAC7E6C,YAAY,EACZ5C,IAAK,WACHD,EAAe9D,KAAM,IAAK,CACxByE,MAAO,EACPkC,YAAY,OAGd,CAAExD,EAAG,KAAMA,EAAS,OAAO,EAE/B,IAAIyV,EAAI,GACJgZ,EAAI,GAEJC,EAASvyB,SAIb,OAFAsZ,EAAEiZ,GAAU,EADG,uBAENtrB,MAAM,IAAIzF,SAAQ,SAAUgxB,GAAOF,EAAEE,GAAOA,KACf,GAA/BH,EAAa,GAAI/Y,GAAGiZ,IAHZ,wBAG4BJ,EAAWE,EAAa,GAAIC,IAAIhrB,KAAK,OAC7E,SAAgBvB,EAAQD,GAM3B,IALA,IAAI2sB,EAAIja,EAASzS,GACb2sB,EAAkBhvB,UAAU7B,OAC5BkS,EAAQ,EACR8J,EAAwBuU,EAA4BrtB,EACpDgL,EAAuB4H,EAA2B5S,EAC/C2tB,EAAkB3e,GAMvB,IALA,IAIIjS,EAJA8a,EAAI7P,EAAcrJ,UAAUqQ,MAC5B/D,EAAO6N,EAAwBsU,EAAWvV,GAAGrR,OAAOsS,EAAsBjB,IAAMuV,EAAWvV,GAC3F/a,EAASmO,EAAKnO,OACdmrB,EAAI,EAEDnrB,EAASmrB,GACdlrB,EAAMkO,EAAKgd,KACNtoB,IAAeqL,EAAqB7O,KAAK0b,EAAG9a,KAAM2wB,EAAE3wB,GAAO8a,EAAE9a,IAEpE,OAAO2wB,GACPJ,G,gBCnDJ,IAAIM,EAAalzB,EAAQ,IAEzBL,EAAOC,QAAUszB,EAAW,YAAa,cAAgB,I,gBCFzD,IAAIjuB,EAAcjF,EAAQ,GACtB2F,EAAuB3F,EAAQ,GAC/BmF,EAAWnF,EAAQ,GACnB0yB,EAAa1yB,EAAQ,IAIzBL,EAAOC,QAAUqF,EAAc5D,OAAOyM,iBAAmB,SAA0BvI,EAAGiK,GACpFrK,EAASI,GAKT,IAJA,IAGIlD,EAHAkO,EAAOmiB,EAAWljB,GAClBpN,EAASmO,EAAKnO,OACdkS,EAAQ,EAELlS,EAASkS,GAAO3O,EAAqBL,EAAEC,EAAGlD,EAAMkO,EAAK+D,KAAU9E,EAAWnN,IACjF,OAAOkD,I,gBCdT,IAAI2tB,EAAalzB,EAAQ,IAEzBL,EAAOC,QAAUszB,EAAW,WAAY,oB,6BCDxC,IAAI3hB,EAAoBvR,EAAQ,IAA+BuR,kBAC3DhC,EAASvP,EAAQ,IACjB4F,EAA2B5F,EAAQ,IACnCmR,EAAiBnR,EAAQ,IACzBqR,EAAYrR,EAAQ,IAEpB0R,EAAa,WAAc,OAAOzQ,MAEtCtB,EAAOC,QAAU,SAAUiS,EAAqBD,EAAME,GACpD,IAAIrC,EAAgBmC,EAAO,YAI3B,OAHAC,EAAoBvQ,UAAYiO,EAAOgC,EAAmB,CAAEO,KAAMlM,EAAyB,EAAGkM,KAC9FX,EAAeU,EAAqBpC,GAAe,GAAO,GAC1D4B,EAAU5B,GAAiBiC,EACpBG,I,gBCdT,IAAInC,EAAkB1P,EAAQ,GAC1BqR,EAAYrR,EAAQ,IAEpByR,EAAW/B,EAAgB,YAC3ByjB,EAAiBhd,MAAM7U,UAG3B3B,EAAOC,QAAU,SAAUgB,GACzB,YAAcoG,IAAPpG,IAAqByQ,EAAU8E,QAAUvV,GAAMuyB,EAAe1hB,KAAc7Q,K,gBCRrF,IAAIuE,EAAWnF,EAAQ,GAEvBL,EAAOC,QAAU,SAAUqc,GACzB,IAAImX,EAAenX,EAAQ,OAC3B,QAAqBjV,IAAjBosB,EACF,OAAOjuB,EAASiuB,EAAa3xB,KAAKwa,IAAWvW,Q,gBCLjD,IAEI+L,EAFkBzR,EAAQ,EAEf0P,CAAgB,YAC3B2jB,GAAe,EAEnB,IACE,IAAIC,EAAS,EACTC,EAAqB,CACvBzhB,KAAM,WACJ,MAAO,CAAEkG,OAAQsb,MAEnB,OAAU,WACRD,GAAe,IAGnBE,EAAmB9hB,GAAY,WAC7B,OAAOxQ,MAGTkV,MAAMqd,KAAKD,GAAoB,WAAc,MAAM,KACnD,MAAOzzB,IAETH,EAAOC,QAAU,SAAUC,EAAM4zB,GAC/B,IAAKA,IAAiBJ,EAAc,OAAO,EAC3C,IAAIK,GAAoB,EACxB,IACE,IAAI7tB,EAAS,GACbA,EAAO4L,GAAY,WACjB,MAAO,CACLK,KAAM,WACJ,MAAO,CAAEkG,KAAM0b,GAAoB,MAIzC7zB,EAAKgG,GACL,MAAO/F,IACT,OAAO4zB,I,6BCnCT,IAAIR,EAAalzB,EAAQ,IACrB2F,EAAuB3F,EAAQ,GAC/B0P,EAAkB1P,EAAQ,GAC1BiF,EAAcjF,EAAQ,GAEtB+Z,EAAUrK,EAAgB,WAE9B/P,EAAOC,QAAU,SAAU+zB,GACzB,IAAI9a,EAAcqa,EAAWS,GACzB5uB,EAAiBY,EAAqBL,EAEtCL,GAAe4T,IAAgBA,EAAYkB,IAC7ChV,EAAe8T,EAAakB,EAAS,CACnC3M,cAAc,EACdpI,IAAK,WAAc,OAAO/D,U,6BCbhCjB,EAAQ,IACR,IAAIgG,EAAWhG,EAAQ,IACnB8E,EAAQ9E,EAAQ,GAChB0P,EAAkB1P,EAAQ,GAC1B4zB,EAAa5zB,EAAQ,IACrB+F,EAA8B/F,EAAQ,GAEtC+Z,EAAUrK,EAAgB,WAE1BmkB,GAAiC/uB,GAAM,WAIzC,IAAIiP,EAAK,IAMT,OALAA,EAAGlU,KAAO,WACR,IAAIiE,EAAS,GAEb,OADAA,EAAO4tB,OAAS,CAAEvtB,EAAG,KACdL,GAEyB,MAA3B,GAAGU,QAAQuP,EAAI,WAKpB2c,EACgC,OAA3B,IAAIlsB,QAAQ,IAAK,MAGtB8rB,EAAU5gB,EAAgB,WAE1B+gB,IACE,IAAIH,IAC6B,KAA5B,IAAIA,GAAS,IAAK,MAOzBwD,GAAqChvB,GAAM,WAC7C,IAAIiP,EAAK,OACLggB,EAAehgB,EAAGlU,KACtBkU,EAAGlU,KAAO,WAAc,OAAOk0B,EAAanmB,MAAM3M,KAAMgD,YACxD,IAAIH,EAAS,KAAK0D,MAAMuM,GACxB,OAAyB,IAAlBjQ,EAAO1B,QAA8B,MAAd0B,EAAO,IAA4B,MAAdA,EAAO,MAG5DnE,EAAOC,QAAU,SAAUwS,EAAKhQ,EAAQvC,EAAMoH,GAC5C,IAAI+sB,EAAStkB,EAAgB0C,GAEzB6hB,GAAuBnvB,GAAM,WAE/B,IAAIS,EAAI,GAER,OADAA,EAAEyuB,GAAU,WAAc,OAAO,GACZ,GAAd,GAAG5hB,GAAK7M,MAGb2uB,EAAoBD,IAAwBnvB,GAAM,WAEpD,IAAIqvB,GAAa,EACbpgB,EAAK,IAkBT,MAhBY,UAAR3B,KAIF2B,EAAK,IAGFtR,YAAc,GACjBsR,EAAGtR,YAAYsX,GAAW,WAAc,OAAOhG,GAC/CA,EAAGE,MAAQ,GACXF,EAAGigB,GAAU,IAAIA,IAGnBjgB,EAAGlU,KAAO,WAAiC,OAAnBs0B,GAAa,EAAa,MAElDpgB,EAAGigB,GAAQ,KACHG,KAGV,IACGF,IACAC,GACQ,YAAR9hB,KACCyhB,IACAnD,GACCD,IAEM,UAARre,IAAoB0hB,EACrB,CACA,IAAIM,EAAqB,IAAIJ,GACzB7hB,EAAUtS,EAAKm0B,EAAQ,GAAG5hB,IAAM,SAAUiiB,EAActD,EAAQxsB,EAAK+vB,EAAMC,GAC7E,OAAIxD,EAAOlxB,OAAS+zB,EACdK,IAAwBM,EAInB,CAAEvc,MAAM,EAAMtS,MAAO0uB,EAAmB3yB,KAAKsvB,EAAQxsB,EAAK+vB,IAE5D,CAAEtc,MAAM,EAAMtS,MAAO2uB,EAAa5yB,KAAK8C,EAAKwsB,EAAQuD,IAEtD,CAAEtc,MAAM,KACd,CACD0Y,iBAAkBA,EAClBD,6CAA8CA,IAE5C+D,EAAeriB,EAAQ,GACvBsiB,EAActiB,EAAQ,GAE1BnM,EAASnB,OAAOvD,UAAW8Q,EAAKoiB,GAChCxuB,EAASqN,OAAO/R,UAAW0yB,EAAkB,GAAV5xB,EAG/B,SAAUuW,EAAQe,GAAO,OAAO+a,EAAYhzB,KAAKkX,EAAQ1X,KAAMyY,IAG/D,SAAUf,GAAU,OAAO8b,EAAYhzB,KAAKkX,EAAQ1X,QAItDgG,GAAMlB,EAA4BsN,OAAO/R,UAAU0yB,GAAS,QAAQ,K,6BC1H1E,IAAI1W,EAAStd,EAAQ,IAAiCsd,OAItD3d,EAAOC,QAAU,SAAUud,EAAG7I,EAAOwW,GACnC,OAAOxW,GAASwW,EAAUxN,EAAOH,EAAG7I,GAAOlS,OAAS,K,qPCNtD,IAAIiO,EAAUrQ,EAAQ,IAClB4zB,EAAa5zB,EAAQ,IAIzBL,EAAOC,QAAU,SAAU6kB,EAAGtH,GAC5B,IAAItd,EAAO4kB,EAAE5kB,KACb,GAAoB,mBAATA,EAAqB,CAC9B,IAAIiE,EAASjE,EAAK4B,KAAKgjB,EAAGtH,GAC1B,GAAsB,WAAlB,EAAOrZ,GACT,MAAMc,UAAU,sEAElB,OAAOd,EAGT,GAAmB,WAAfuM,EAAQoU,GACV,MAAM7f,UAAU,+CAGlB,OAAOgvB,EAAWnyB,KAAKgjB,EAAGtH,K,gBCnB5B,IAAIpd,EAASC,EAAQ,GACjBkH,EAAgBlH,EAAQ,IAExBoM,EAAUrM,EAAOqM,QAErBzM,EAAOC,QAA6B,mBAAZwM,GAA0B,cAAc2G,KAAK7L,EAAckF,K,gBCLnF,IAAIlM,EAAMF,EAAQ,GACd00B,EAAU10B,EAAQ,KAClB20B,EAAiC30B,EAAQ,IACzC2F,EAAuB3F,EAAQ,GAEnCL,EAAOC,QAAU,SAAU0G,EAAQD,GAIjC,IAHA,IAAIkK,EAAOmkB,EAAQruB,GACftB,EAAiBY,EAAqBL,EACtCQ,EAA2B6uB,EAA+BrvB,EACrDpD,EAAI,EAAGA,EAAIqO,EAAKnO,OAAQF,IAAK,CACpC,IAAIG,EAAMkO,EAAKrO,GACVhC,EAAIoG,EAAQjE,IAAM0C,EAAeuB,EAAQjE,EAAKyD,EAAyBO,EAAQhE,O,gBCXxF,IAAI6wB,EAAalzB,EAAQ,IACrB40B,EAA4B50B,EAAQ,KACpC2yB,EAA8B3yB,EAAQ,IACtCmF,EAAWnF,EAAQ,GAGvBL,EAAOC,QAAUszB,EAAW,UAAW,YAAc,SAAiBtyB,GACpE,IAAI2P,EAAOqkB,EAA0BtvB,EAAEH,EAASvE,IAC5Cwd,EAAwBuU,EAA4BrtB,EACxD,OAAO8Y,EAAwB7N,EAAKzE,OAAOsS,EAAsBxd,IAAO2P,I,gBCT1E,IAAIxQ,EAASC,EAAQ,GAErBL,EAAOC,QAAUG,G,gBCFjBJ,EAAOC,QAAUI,EAAQ,M,6BCEzB,IAAIse,EAAQte,EAAQ,GAChBmB,EAAOnB,EAAQ,IACfuJ,EAAQvJ,EAAQ,KAChB60B,EAAc70B,EAAQ,IAS1B,SAAS80B,EAAeC,GACtB,IAAIjqB,EAAU,IAAIvB,EAAMwrB,GACpBC,EAAW7zB,EAAKoI,EAAMjI,UAAUwf,QAAShW,GAQ7C,OALAwT,EAAMpa,OAAO8wB,EAAUzrB,EAAMjI,UAAWwJ,GAGxCwT,EAAMpa,OAAO8wB,EAAUlqB,GAEhBkqB,EAIT,IAAIC,EAAQH,EAtBG90B,EAAQ,KAyBvBi1B,EAAM1rB,MAAQA,EAGd0rB,EAAM1lB,OAAS,SAAgB2lB,GAC7B,OAAOJ,EAAeD,EAAYI,EAAM5V,SAAU6V,KAIpDD,EAAMhR,OAASjkB,EAAQ,IACvBi1B,EAAM3rB,YAActJ,EAAQ,KAC5Bi1B,EAAMzrB,SAAWxJ,EAAQ,IAGzBi1B,EAAME,IAAM,SAAaC,GACvB,OAAO3U,QAAQ0U,IAAIC,IAErBH,EAAMI,OAASr1B,EAAQ,KAEvBL,EAAOC,QAAUq1B,EAGjBt1B,EAAOC,QAAQ01B,QAAUL,G,6BClDzB,IAAI3W,EAAQte,EAAQ,GAChBmgB,EAAWngB,EAAQ,IACnBu1B,EAAqBv1B,EAAQ,KAC7Bw1B,EAAkBx1B,EAAQ,KAC1B60B,EAAc70B,EAAQ,IAO1B,SAASuJ,EAAM2rB,GACbj0B,KAAKoe,SAAW6V,EAChBj0B,KAAKw0B,aAAe,CAClB3U,QAAS,IAAIyU,EACb1T,SAAU,IAAI0T,GASlBhsB,EAAMjI,UAAUwf,QAAU,SAAiBN,GAGnB,iBAAXA,GACTA,EAASvc,UAAU,IAAM,IAClBwE,IAAMxE,UAAU,GAEvBuc,EAASA,GAAU,IAGrBA,EAASqU,EAAY5zB,KAAKoe,SAAUmB,IAGzBtT,OACTsT,EAAOtT,OAASsT,EAAOtT,OAAO0L,cACrB3X,KAAKoe,SAASnS,OACvBsT,EAAOtT,OAASjM,KAAKoe,SAASnS,OAAO0L,cAErC4H,EAAOtT,OAAS,MAIlB,IAAIwoB,EAAQ,CAACF,OAAiBxuB,GAC1B8b,EAAUrC,QAAQC,QAAQF,GAU9B,IARAvf,KAAKw0B,aAAa3U,QAAQ/e,SAAQ,SAAoC4zB,GACpED,EAAME,QAAQD,EAAYE,UAAWF,EAAYG,aAGnD70B,KAAKw0B,aAAa5T,SAAS9f,SAAQ,SAAkC4zB,GACnED,EAAMtf,KAAKuf,EAAYE,UAAWF,EAAYG,aAGzCJ,EAAMtzB,QACX0gB,EAAUA,EAAQC,KAAK2S,EAAMK,QAASL,EAAMK,SAG9C,OAAOjT,GAGTvZ,EAAMjI,UAAU00B,OAAS,SAAgBxV,GAEvC,OADAA,EAASqU,EAAY5zB,KAAKoe,SAAUmB,GAC7BL,EAASK,EAAO/X,IAAK+X,EAAO7X,OAAQ6X,EAAOhC,kBAAkBha,QAAQ,MAAO,KAIrF8Z,EAAMvc,QAAQ,CAAC,SAAU,MAAO,OAAQ,YAAY,SAA6BmL,GAE/E3D,EAAMjI,UAAU4L,GAAU,SAASzE,EAAK+X,GACtC,OAAOvf,KAAK6f,QAAQ+T,EAAYrU,GAAU,GAAI,CAC5CtT,OAAQA,EACRzE,IAAKA,EACL8P,MAAOiI,GAAU,IAAIjI,YAK3B+F,EAAMvc,QAAQ,CAAC,OAAQ,MAAO,UAAU,SAA+BmL,GAErE3D,EAAMjI,UAAU4L,GAAU,SAASzE,EAAK8P,EAAMiI,GAC5C,OAAOvf,KAAK6f,QAAQ+T,EAAYrU,GAAU,GAAI,CAC5CtT,OAAQA,EACRzE,IAAKA,EACL8P,KAAMA,SAKZ5Y,EAAOC,QAAU2J,G,6BC5FjB,IAAI+U,EAAQte,EAAQ,GAEpB,SAASu1B,IACPt0B,KAAKg1B,SAAW,GAWlBV,EAAmBj0B,UAAU40B,IAAM,SAAaL,EAAWC,GAKzD,OAJA70B,KAAKg1B,SAAS7f,KAAK,CACjByf,UAAWA,EACXC,SAAUA,IAEL70B,KAAKg1B,SAAS7zB,OAAS,GAQhCmzB,EAAmBj0B,UAAU60B,MAAQ,SAAe3lB,GAC9CvP,KAAKg1B,SAASzlB,KAChBvP,KAAKg1B,SAASzlB,GAAM,OAYxB+kB,EAAmBj0B,UAAUS,QAAU,SAAiBE,GACtDqc,EAAMvc,QAAQd,KAAKg1B,UAAU,SAAwBtqB,GACzC,OAANA,GACF1J,EAAG0J,OAKThM,EAAOC,QAAU21B,G,6BCjDjB,IAAIjX,EAAQte,EAAQ,GAChBo2B,EAAgBp2B,EAAQ,KACxBwJ,EAAWxJ,EAAQ,IACnBqf,EAAWrf,EAAQ,IAKvB,SAASq2B,EAA6B7V,GAChCA,EAAOqC,aACTrC,EAAOqC,YAAYyT,mBAUvB32B,EAAOC,QAAU,SAAyB4gB,GA6BxC,OA5BA6V,EAA6B7V,GAG7BA,EAAOrX,QAAUqX,EAAOrX,SAAW,GAGnCqX,EAAOjI,KAAO6d,EACZ5V,EAAOjI,KACPiI,EAAOrX,QACPqX,EAAOjB,kBAITiB,EAAOrX,QAAUmV,EAAMza,MACrB2c,EAAOrX,QAAQ6W,QAAU,GACzBQ,EAAOrX,QAAQqX,EAAOtT,SAAW,GACjCsT,EAAOrX,SAGTmV,EAAMvc,QACJ,CAAC,SAAU,MAAO,OAAQ,OAAQ,MAAO,QAAS,WAClD,SAA2BmL,UAClBsT,EAAOrX,QAAQ+D,OAIZsT,EAAOpB,SAAWC,EAASD,SAE1BoB,GAAQuC,MAAK,SAA6BlB,GAUvD,OATAwU,EAA6B7V,GAG7BqB,EAAStJ,KAAO6d,EACdvU,EAAStJ,KACTsJ,EAAS1Y,QACTqX,EAAOhB,mBAGFqC,KACN,SAA4B2O,GAc7B,OAbKhnB,EAASgnB,KACZ6F,EAA6B7V,GAGzBgQ,GAAUA,EAAO3O,WACnB2O,EAAO3O,SAAStJ,KAAO6d,EACrB5F,EAAO3O,SAAStJ,KAChBiY,EAAO3O,SAAS1Y,QAChBqX,EAAOhB,qBAKNiB,QAAQE,OAAO6P,Q,6BC1E1B,IAAIlS,EAAQte,EAAQ,GAUpBL,EAAOC,QAAU,SAAuB2Y,EAAMpP,EAASotB,GAMrD,OAJAjY,EAAMvc,QAAQw0B,GAAK,SAAmBt0B,GACpCsW,EAAOtW,EAAGsW,EAAMpP,MAGXoP,I,6BChBT,IAAI+F,EAAQte,EAAQ,GAEpBL,EAAOC,QAAU,SAA6BuJ,EAASqtB,GACrDlY,EAAMvc,QAAQoH,GAAS,SAAuBzD,EAAOhF,GAC/CA,IAAS81B,GAAkB91B,EAAK6gB,gBAAkBiV,EAAejV,gBACnEpY,EAAQqtB,GAAkB9wB,SACnByD,EAAQzI,S,6BCNrB,IAAI6f,EAAcvgB,EAAQ,IAS1BL,EAAOC,QAAU,SAAgB8gB,EAASC,EAAQkB,GAChD,IAAI/B,EAAiB+B,EAASrB,OAAOV,eAChC+B,EAAS9B,QAAWD,IAAkBA,EAAe+B,EAAS9B,QAGjEY,EAAOJ,EACL,mCAAqCsB,EAAS9B,OAC9C8B,EAASrB,OACT,KACAqB,EAASf,QACTe,IAPFnB,EAAQmB,K,6BCFZliB,EAAOC,QAAU,SAAsBE,EAAO0gB,EAAQ6C,EAAMvC,EAASe,GA4BnE,OA3BA/hB,EAAM0gB,OAASA,EACX6C,IACFvjB,EAAMujB,KAAOA,GAGfvjB,EAAMghB,QAAUA,EAChBhhB,EAAM+hB,SAAWA,EACjB/hB,EAAM22B,cAAe,EAErB32B,EAAM42B,OAAS,WACb,MAAO,CAELtT,QAASniB,KAAKmiB,QACd1iB,KAAMO,KAAKP,KAEXi2B,YAAa11B,KAAK01B,YAClBC,OAAQ31B,KAAK21B,OAEbC,SAAU51B,KAAK41B,SACfC,WAAY71B,KAAK61B,WACjBC,aAAc91B,KAAK81B,aACnBC,MAAO/1B,KAAK+1B,MAEZxW,OAAQvf,KAAKuf,OACb6C,KAAMpiB,KAAKoiB,OAGRvjB,I,6BCtCT,IAAIwe,EAAQte,EAAQ,GAEpBL,EAAOC,QACL0e,EAAM7a,uBAIK,CACLkL,MAAO,SAAejO,EAAMgF,EAAOuxB,EAASnqB,EAAMyB,EAAQ2oB,GACxD,IAAIC,EAAS,GACbA,EAAO/gB,KAAK1V,EAAO,IAAM8H,mBAAmB9C,IAExC4Y,EAAMrb,SAASg0B,IACjBE,EAAO/gB,KAAK,WAAa,IAAIghB,KAAKH,GAASI,eAGzC/Y,EAAMtb,SAAS8J,IACjBqqB,EAAO/gB,KAAK,QAAUtJ,GAGpBwR,EAAMtb,SAASuL,IACjB4oB,EAAO/gB,KAAK,UAAY7H,IAGX,IAAX2oB,GACFC,EAAO/gB,KAAK,UAGdxS,SAASuzB,OAASA,EAAOtvB,KAAK,OAGhC0a,KAAM,SAAc7hB,GAClB,IAAIoT,EAAQlQ,SAASuzB,OAAOrjB,MAAM,IAAIT,OAAO,aAAe3S,EAAO,cACnE,OAAQoT,EAAQwjB,mBAAmBxjB,EAAM,IAAM,MAGjD8Z,OAAQ,SAAgBltB,GACtBO,KAAK0N,MAAMjO,EAAM,GAAI02B,KAAKG,MAAQ,SAO/B,CACL5oB,MAAO,aACP4T,KAAM,WAAkB,OAAO,MAC/BqL,OAAQ,e,6BC/ChB,IAAI4J,EAAgBx3B,EAAQ,KACxBy3B,EAAcz3B,EAAQ,KAW1BL,EAAOC,QAAU,SAAuB0hB,EAASoW,GAC/C,OAAIpW,IAAYkW,EAAcE,GACrBD,EAAYnW,EAASoW,GAEvBA,I,6BCVT/3B,EAAOC,QAAU,SAAuB6I,GAItC,MAAO,gCAAgCsK,KAAKtK,K,6BCH9C9I,EAAOC,QAAU,SAAqB0hB,EAASqW,GAC7C,OAAOA,EACHrW,EAAQ9c,QAAQ,OAAQ,IAAM,IAAMmzB,EAAYnzB,QAAQ,OAAQ,IAChE8c,I,6BCVN,IAAIhD,EAAQte,EAAQ,GAIhB43B,EAAoB,CACtB,MAAO,gBAAiB,iBAAkB,eAAgB,OAC1D,UAAW,OAAQ,OAAQ,oBAAqB,sBAChD,gBAAiB,WAAY,eAAgB,sBAC7C,UAAW,cAAe,cAgB5Bj4B,EAAOC,QAAU,SAAsBuJ,GACrC,IACI9G,EACAb,EACAU,EAHA21B,EAAS,GAKb,OAAK1uB,GAELmV,EAAMvc,QAAQoH,EAAQ3B,MAAM,OAAO,SAAgBswB,GAKjD,GAJA51B,EAAI41B,EAAK1jB,QAAQ,KACjB/R,EAAMic,EAAMha,KAAKwzB,EAAKC,OAAO,EAAG71B,IAAI0W,cACpCpX,EAAM8c,EAAMha,KAAKwzB,EAAKC,OAAO71B,EAAI,IAE7BG,EAAK,CACP,GAAIw1B,EAAOx1B,IAAQu1B,EAAkBxjB,QAAQ/R,IAAQ,EACnD,OAGAw1B,EAAOx1B,GADG,eAARA,GACaw1B,EAAOx1B,GAAOw1B,EAAOx1B,GAAO,IAAIyJ,OAAO,CAACtK,IAEzCq2B,EAAOx1B,GAAOw1B,EAAOx1B,GAAO,KAAOb,EAAMA,MAKtDq2B,GAnBgBA,I,6BC9BzB,IAAIvZ,EAAQte,EAAQ,GAEpBL,EAAOC,QACL0e,EAAM7a,uBAIH,WACC,IAEIu0B,EAFAC,EAAO,kBAAkBllB,KAAKrP,UAAU8X,WACxC0c,EAAiBt0B,SAASuW,cAAc,KAS5C,SAASge,EAAW1vB,GAClB,IAAI2vB,EAAO3vB,EAWX,OATIwvB,IAEFC,EAAetJ,aAAa,OAAQwJ,GACpCA,EAAOF,EAAeE,MAGxBF,EAAetJ,aAAa,OAAQwJ,GAG7B,CACLA,KAAMF,EAAeE,KACrBC,SAAUH,EAAeG,SAAWH,EAAeG,SAAS7zB,QAAQ,KAAM,IAAM,GAChF8zB,KAAMJ,EAAeI,KACrBC,OAAQL,EAAeK,OAASL,EAAeK,OAAO/zB,QAAQ,MAAO,IAAM,GAC3Eg0B,KAAMN,EAAeM,KAAON,EAAeM,KAAKh0B,QAAQ,KAAM,IAAM,GACpEi0B,SAAUP,EAAeO,SACzBC,KAAMR,EAAeQ,KACrBC,SAAiD,MAAtCT,EAAeS,SAASrb,OAAO,GACxC4a,EAAeS,SACf,IAAMT,EAAeS,UAY3B,OARAX,EAAYG,EAAWp3B,OAAO63B,SAASR,MAQhC,SAAyBS,GAC9B,IAAIhB,EAAUvZ,EAAMtb,SAAS61B,GAAeV,EAAWU,GAAcA,EACrE,OAAQhB,EAAOQ,WAAaL,EAAUK,UAClCR,EAAOS,OAASN,EAAUM,MAhDjC,GAsDQ,WACL,OAAO,I,6BC9Df,IAAIrU,EAASjkB,EAAQ,IAQrB,SAASsJ,EAAYwvB,GACnB,GAAwB,mBAAbA,EACT,MAAM,IAAIl0B,UAAU,gCAGtB,IAAIm0B,EACJ93B,KAAK6hB,QAAU,IAAIrC,SAAQ,SAAyBC,GAClDqY,EAAiBrY,KAGnB,IAAIsY,EAAQ/3B,KACZ63B,GAAS,SAAgB1V,GACnB4V,EAAMxI,SAKVwI,EAAMxI,OAAS,IAAIvM,EAAOb,GAC1B2V,EAAeC,EAAMxI,YAOzBlnB,EAAYhI,UAAUg1B,iBAAmB,WACvC,GAAIr1B,KAAKuvB,OACP,MAAMvvB,KAAKuvB,QAQflnB,EAAYjD,OAAS,WACnB,IAAI2c,EAIJ,MAAO,CACLgW,MAJU,IAAI1vB,GAAY,SAAkBqE,GAC5CqV,EAASrV,KAITqV,OAAQA,IAIZrjB,EAAOC,QAAU0J,G,6BClCjB3J,EAAOC,QAAU,SAAgBq5B,GAC/B,OAAO,SAAcC,GACnB,OAAOD,EAASrrB,MAAM,KAAMsrB,M,kY7HxBhC,aAIA,U,sG8HOO,WACN,U,uBAGM,SAA8BC,GACpCC,WAhBD,YAEMC,EAAez1B,sCAArB,GACIo1B,EAAQK,EAAeA,eAAH,qBAAxB,KAMMD,EAAN,IAWA,IAAAE,WAAA,qBAA+B,SAAA9kB,GAC9BwkB,EAAQxkB,EAARwkB,MAEAI,WAAkB,SAAAD,GACjB,IACCA,EAAS3kB,EAAT2kB,OACC,MAAO3kB,GACR9K,8D,qPC3BH,IAAItJ,EAAgBJ,EAAQ,IAE5BL,EAAOC,QAAUQ,IAEXG,OAAO0G,MAEkB,UAA1B,EAAO1G,OAAO0b,W,gGCNnB,gBACA,Y,uOAOatS,E,WAIT,c,uGAA2B,S,OAAA,G,EAAA,S,EAAA,M,sFACnB,mBAAOF,EAAP,aAAyC,aAAMA,EAAnD,eAEW,aAAMA,EAAN,iBAA4B,aAAMxI,KAAtC,eACHyI,aAAa,oCAAsCD,EAAtC,sBAAoExI,KAAjFyI,cAFAA,yEAKJzI,KAAA,M,4DAIA,OAAOs4B,I,gCAGD74B,EAAc84B,GACpBv4B,KAAA,qB,kCAGQP,EAAc84B,GACtBv4B,KAAA,uB,2BAGCP,EAAc+4B,GACfx4B,KAAA,mB,8DCnCR,IAAMwe,EAAQzf,EAAQ,KAKtBL,EAAOC,QAJO,SAACqI,EAAS7B,GACtB,IAAMuY,EAAIc,EAAMxX,EAAS7B,GACzB,OAAOuY,EAAIA,EAAE1W,QAAU,O,yPCHlB6I,EAAc9Q,EAAQ,IAAtB8Q,W,EACW9Q,EAAQ,IAAlB+T,E,EAAAA,GAAIyQ,E,EAAAA,EACN8B,EAAStmB,EAAQ,IAkCvBL,EAAOC,QAhCO,SAACqI,EAAS7B,GAQtB,GAPKA,GAA8B,WAAnB,EAAOA,KACrBA,EAAU,CACRmgB,QAASngB,EACTogB,mBAAmB,IAInBve,aAAmBqe,EACrB,OAAOre,EAGT,GAAuB,iBAAZA,EACT,OAAO,KAGT,GAAIA,EAAQ7F,OAAS0O,EACnB,OAAO,KAIT,KADU1K,EAAQmgB,MAAQxS,EAAGyQ,EAAEkC,OAAS3S,EAAGyQ,EAAEmC,OACtC5T,KAAK9K,GACV,OAAO,KAGT,IACE,OAAO,IAAIqe,EAAOre,EAAS7B,GAC3B,MAAOszB,GACP,OAAO,Q,cChCX,IAAMC,EAAU,WACVtT,EAAqB,SAACliB,EAAGC,GAC7B,IAAMw1B,EAAOD,EAAQ5mB,KAAK5O,GACpB01B,EAAOF,EAAQ5mB,KAAK3O,GAO1B,OALIw1B,GAAQC,IACV11B,GAAKA,EACLC,GAAKA,GAGAD,IAAMC,EAAI,EACZw1B,IAASC,GAAS,EAClBA,IAASD,EAAQ,EAClBz1B,EAAIC,GAAK,EACT,GAKNzE,EAAOC,QAAU,CACfymB,qBACAyT,oBAJ0B,SAAC31B,EAAGC,GAAJ,OAAUiiB,EAAmBjiB,EAAGD,M,gBCjB5D,IAAMmiB,EAAStmB,EAAQ,IAEvBL,EAAOC,QADO,SAACuE,EAAGoiB,GAAJ,OAAc,IAAID,EAAOniB,EAAGoiB,GAAOM,Q,+UCIpCjd,E,8JAEU,IAAImwB,I,yJAGnB,OAAOR,I,gCAGD74B,EAAc84B,GACpBv4B,KAAA,gBAAyBA,KAAKg1B,SAASjxB,IAAItE,IAAnB,WAAxB,M,kCAGQA,EAAc84B,GACtBv4B,KAAA,gBAAyBA,KAAKg1B,SAASjxB,IAAItE,IAAnB,YAAuC,SAAAiL,GAAC,OAAIA,GAAJ,Q,2BAG/DjL,EAAc+4B,IACdx4B,KAAKg1B,SAASjxB,IAAItE,IAAnB,aAAwC,SAAAiL,GACpC,IACIA,KACF,MAAO6I,GACL9K,4D,+DC1BhB,IAAIgG,EAAkB1P,EAAQ,GAC1BuP,EAASvP,EAAQ,IACjB2F,EAAuB3F,EAAQ,GAE/Bg6B,EAActqB,EAAgB,eAC9ByjB,EAAiBhd,MAAM7U,UAIQ0F,MAA/BmsB,EAAe6G,IACjBr0B,EAAqBL,EAAE6tB,EAAgB6G,EAAa,CAClD5sB,cAAc,EACd1H,MAAO6J,EAAO,QAKlB5P,EAAOC,QAAU,SAAUyC,GACzB8wB,EAAe6G,GAAa33B,IAAO,I,gBClBrC,IAAIyC,EAAQ9E,EAAQ,GAEpBL,EAAOC,SAAWkF,GAAM,WACtB,SAASwK,KAET,OADAA,EAAEhO,UAAUmB,YAAc,KACnBpB,OAAOQ,eAAe,IAAIyN,KAASA,EAAEhO,c,gBCL9C,IAAIK,EAAW3B,EAAQ,GAEvBL,EAAOC,QAAU,SAAUgB,GACzB,IAAKe,EAASf,IAAc,OAAPA,EACnB,MAAMgE,UAAU,aAAeC,OAAOjE,GAAM,mBAC5C,OAAOA,I,6BCJX,IAAIq5B,EAAaj6B,EAAQ,KACrBk6B,EAAmBl6B,EAAQ,KAI/BL,EAAOC,QAAUq6B,EAAW,OAAO,SAAUE,GAC3C,OAAO,WAAiB,OAAOA,EAAKl5B,KAAMgD,UAAU7B,OAAS6B,UAAU,QAAK+C,MAC3EkzB,I,6BCPH,IAAIlpB,EAAIhR,EAAQ,IACZD,EAASC,EAAQ,GACjBmG,EAAWnG,EAAQ,IACnBgG,EAAWhG,EAAQ,IACnBo6B,EAAyBp6B,EAAQ,IACjCq6B,EAAUr6B,EAAQ,IAClBs6B,EAAat6B,EAAQ,IACrB2B,EAAW3B,EAAQ,GACnB8E,EAAQ9E,EAAQ,GAChBu6B,EAA8Bv6B,EAAQ,KACtCmR,EAAiBnR,EAAQ,IACzBw6B,EAAoBx6B,EAAQ,KAEhCL,EAAOC,QAAU,SAAU+zB,EAAkB8G,EAASza,GACpD,IAAI1F,GAA8C,IAArCqZ,EAAiBvf,QAAQ,OAClCsmB,GAAgD,IAAtC/G,EAAiBvf,QAAQ,QACnCumB,EAAQrgB,EAAS,MAAQ,MACzBsgB,EAAoB76B,EAAO4zB,GAC3BkH,EAAkBD,GAAqBA,EAAkBt5B,UACzDuX,EAAc+hB,EACdE,EAAW,GAEXC,EAAY,SAAU3oB,GACxB,IAAIiiB,EAAewG,EAAgBzoB,GACnCpM,EAAS60B,EAAiBzoB,EACjB,OAAPA,EAAe,SAAa1M,GAE1B,OADA2uB,EAAa5yB,KAAKR,KAAgB,IAAVyE,EAAc,EAAIA,GACnCzE,MACE,UAAPmR,EAAkB,SAAU/P,GAC9B,QAAOq4B,IAAY/4B,EAASU,KAAegyB,EAAa5yB,KAAKR,KAAc,IAARoB,EAAY,EAAIA,IAC1E,OAAP+P,EAAe,SAAa/P,GAC9B,OAAOq4B,IAAY/4B,EAASU,QAAO2E,EAAYqtB,EAAa5yB,KAAKR,KAAc,IAARoB,EAAY,EAAIA,IAC9E,OAAP+P,EAAe,SAAa/P,GAC9B,QAAOq4B,IAAY/4B,EAASU,KAAegyB,EAAa5yB,KAAKR,KAAc,IAARoB,EAAY,EAAIA,IACjF,SAAaA,EAAKqD,GAEpB,OADA2uB,EAAa5yB,KAAKR,KAAc,IAARoB,EAAY,EAAIA,EAAKqD,GACtCzE,QAMb,GAAIkF,EAASwtB,EAA8C,mBAArBiH,KAAqCF,GAAWG,EAAgB94B,UAAY+C,GAAM,YACtH,IAAI81B,GAAoBhoB,UAAUd,YAGlC+G,EAAcmH,EAAOgb,eAAeP,EAAS9G,EAAkBrZ,EAAQqgB,GACvEP,EAAuB3R,UAAW,OAC7B,GAAItiB,EAASwtB,GAAkB,GAAO,CAC3C,IAAIqB,EAAW,IAAInc,EAEfoiB,EAAiBjG,EAAS2F,GAAOD,EAAU,IAAM,EAAG,IAAM1F,EAE1DkG,EAAuBp2B,GAAM,WAAckwB,EAAS90B,IAAI,MAGxDi7B,EAAmBZ,GAA4B,SAAUxe,GAAY,IAAI6e,EAAkB7e,MAE3Fqf,GAAcV,GAAW51B,GAAM,WAIjC,IAFA,IAAIu2B,EAAY,IAAIT,EAChBtmB,EAAQ,EACLA,KAAS+mB,EAAUV,GAAOrmB,EAAOA,GACxC,OAAQ+mB,EAAUn7B,KAAK,MAGpBi7B,KACHtiB,EAAc4hB,GAAQ,SAAUpI,EAAOtW,GACrCue,EAAWjI,EAAOxZ,EAAa8a,GAC/B,IAAIjmB,EAAO8sB,EAAkB,IAAII,EAAqBvI,EAAOxZ,GAE7D,OADgB7R,MAAZ+U,GAAuBse,EAAQte,EAAUrO,EAAKitB,GAAQ,CAAEjtB,KAAMA,EAAM0O,WAAY9B,IAC7E5M,MAEGpM,UAAYu5B,EACxBA,EAAgBp4B,YAAcoW,IAG5BqiB,GAAwBE,KAC1BL,EAAU,UACVA,EAAU,OACVzgB,GAAUygB,EAAU,SAGlBK,GAAcH,IAAgBF,EAAUJ,GAGxCD,GAAWG,EAAgBS,cAAcT,EAAgBS,MAU/D,OAPAR,EAASnH,GAAoB9a,EAC7B7H,EAAE,CAAEjR,QAAQ,EAAMgH,OAAQ8R,GAAe+hB,GAAqBE,GAE9D3pB,EAAe0H,EAAa8a,GAEvB+G,GAAS1a,EAAOub,UAAU1iB,EAAa8a,EAAkBrZ,GAEvDzB,I,gBCjGT,IAAI/T,EAAQ9E,EAAQ,GAEpBL,EAAOC,SAAWkF,GAAM,WACtB,OAAOzD,OAAO+mB,aAAa/mB,OAAOm6B,kBAAkB,S,6BCFtD,IAAIz2B,EAAiB/E,EAAQ,GAAuCsF,EAChEiK,EAASvP,EAAQ,IACjBy7B,EAAcz7B,EAAQ,KACtBmB,EAAOnB,EAAQ,IACfs6B,EAAat6B,EAAQ,IACrBq6B,EAAUr6B,EAAQ,IAClB4X,EAAiB5X,EAAQ,IACzB07B,EAAa17B,EAAQ,KACrBiF,EAAcjF,EAAQ,GACtB0oB,EAAU1oB,EAAQ,IAAkC0oB,QACpDvhB,EAAsBnH,EAAQ,IAE9B6X,EAAmB1Q,EAAoB4E,IACvC4vB,EAAyBx0B,EAAoByF,UAEjDjN,EAAOC,QAAU,CACfo7B,eAAgB,SAAUP,EAAS9G,EAAkBrZ,EAAQqgB,GAC3D,IAAIpf,EAAIkf,GAAQ,SAAU/sB,EAAMqO,GAC9Bue,EAAW5sB,EAAM6N,EAAGoY,GACpB9b,EAAiBnK,EAAM,CACrB1E,KAAM2qB,EACNrf,MAAO/E,EAAO,MACd0N,WAAOjW,EACP40B,UAAM50B,EACNqW,KAAM,IAEHpY,IAAayI,EAAK2P,KAAO,GACdrW,MAAZ+U,GAAuBse,EAAQte,EAAUrO,EAAKitB,GAAQ,CAAEjtB,KAAMA,EAAM0O,WAAY9B,OAGlFlT,EAAmBu0B,EAAuBhI,GAE1CkI,EAAS,SAAUnuB,EAAMrL,EAAKqD,GAChC,IAEIo2B,EAAUxnB,EAFV7M,EAAQL,EAAiBsG,GACzBquB,EAAQC,EAAStuB,EAAMrL,GAqBzB,OAlBE05B,EACFA,EAAMr2B,MAAQA,GAGd+B,EAAMm0B,KAAOG,EAAQ,CACnBznB,MAAOA,EAAQoU,EAAQrmB,GAAK,GAC5BA,IAAKA,EACLqD,MAAOA,EACPo2B,SAAUA,EAAWr0B,EAAMm0B,KAC3B9pB,UAAM9K,EACNi1B,SAAS,GAENx0B,EAAMwV,QAAOxV,EAAMwV,MAAQ8e,GAC5BD,IAAUA,EAAShqB,KAAOiqB,GAC1B92B,EAAawC,EAAM4V,OAClB3P,EAAK2P,OAEI,MAAV/I,IAAe7M,EAAM6M,MAAMA,GAASynB,IACjCruB,GAGPsuB,EAAW,SAAUtuB,EAAMrL,GAC7B,IAGI05B,EAHAt0B,EAAQL,EAAiBsG,GAEzB4G,EAAQoU,EAAQrmB,GAEpB,GAAc,MAAViS,EAAe,OAAO7M,EAAM6M,MAAMA,GAEtC,IAAKynB,EAAQt0B,EAAMwV,MAAO8e,EAAOA,EAAQA,EAAMjqB,KAC7C,GAAIiqB,EAAM15B,KAAOA,EAAK,OAAO05B,GAiFjC,OA7EAN,EAAYlgB,EAAEja,UAAW,CAGvBg6B,MAAO,WAKL,IAJA,IACI7zB,EAAQL,EADDnG,MAEPsX,EAAO9Q,EAAM6M,MACbynB,EAAQt0B,EAAMwV,MACX8e,GACLA,EAAME,SAAU,EACZF,EAAMD,WAAUC,EAAMD,SAAWC,EAAMD,SAAShqB,UAAO9K,UACpDuR,EAAKwjB,EAAMznB,OAClBynB,EAAQA,EAAMjqB,KAEhBrK,EAAMwV,MAAQxV,EAAMm0B,UAAO50B,EACvB/B,EAAawC,EAAM4V,KAAO,EAXnBpc,KAYDoc,KAAO,GAInB,OAAU,SAAUhb,GAClB,IACIoF,EAAQL,EADDnG,MAEP86B,EAAQC,EAFD/6B,KAEgBoB,GAC3B,GAAI05B,EAAO,CACT,IAAIjqB,EAAOiqB,EAAMjqB,KACboqB,EAAOH,EAAMD,gBACVr0B,EAAM6M,MAAMynB,EAAMznB,OACzBynB,EAAME,SAAU,EACZC,IAAMA,EAAKpqB,KAAOA,GAClBA,IAAMA,EAAKgqB,SAAWI,GACtBz0B,EAAMwV,OAAS8e,IAAOt0B,EAAMwV,MAAQnL,GACpCrK,EAAMm0B,MAAQG,IAAOt0B,EAAMm0B,KAAOM,GAClCj3B,EAAawC,EAAM4V,OAZdpc,KAaCoc,OACV,QAAS0e,GAIbh6B,QAAS,SAAiB8Y,GAIxB,IAHA,IAEIkhB,EAFAt0B,EAAQL,EAAiBnG,MACzB8Z,EAAgB5Z,EAAK0Z,EAAY5W,UAAU7B,OAAS,EAAI6B,UAAU,QAAK+C,EAAW,GAE/E+0B,EAAQA,EAAQA,EAAMjqB,KAAOrK,EAAMwV,OAGxC,IAFAlC,EAAcghB,EAAMr2B,MAAOq2B,EAAM15B,IAAKpB,MAE/B86B,GAASA,EAAME,SAASF,EAAQA,EAAMD,UAKjD57B,IAAK,SAAamC,GAChB,QAAS25B,EAAS/6B,KAAMoB,MAI5Bo5B,EAAYlgB,EAAEja,UAAWgZ,EAAS,CAEhCtV,IAAK,SAAa3C,GAChB,IAAI05B,EAAQC,EAAS/6B,KAAMoB,GAC3B,OAAO05B,GAASA,EAAMr2B,OAGxBqG,IAAK,SAAa1J,EAAKqD,GACrB,OAAOm2B,EAAO56B,KAAc,IAARoB,EAAY,EAAIA,EAAKqD,KAEzC,CAEF0F,IAAK,SAAa1F,GAChB,OAAOm2B,EAAO56B,KAAMyE,EAAkB,IAAVA,EAAc,EAAIA,EAAOA,MAGrDT,GAAaF,EAAewW,EAAEja,UAAW,OAAQ,CACnD0D,IAAK,WACH,OAAOoC,EAAiBnG,MAAMoc,QAG3B9B,GAETggB,UAAW,SAAUhgB,EAAGoY,EAAkBrZ,GACxC,IAAI6hB,EAAgBxI,EAAmB,YACnCyI,EAA6BT,EAAuBhI,GACpD0I,EAA2BV,EAAuBQ,GAGtDvkB,EAAe2D,EAAGoY,GAAkB,SAAU7b,EAAUC,GACtDF,EAAiB5W,KAAM,CACrB+H,KAAMmzB,EACN71B,OAAQwR,EACRrQ,MAAO20B,EAA2BtkB,GAClCC,KAAMA,EACN6jB,UAAM50B,OAEP,WAKD,IAJA,IAAIS,EAAQ40B,EAAyBp7B,MACjC8W,EAAOtQ,EAAMsQ,KACbgkB,EAAQt0B,EAAMm0B,KAEXG,GAASA,EAAME,SAASF,EAAQA,EAAMD,SAE7C,OAAKr0B,EAAMnB,SAAYmB,EAAMm0B,KAAOG,EAAQA,EAAQA,EAAMjqB,KAAOrK,EAAMA,MAAMwV,OAMjE,QAARlF,EAAuB,CAAErS,MAAOq2B,EAAM15B,IAAK2V,MAAM,GACzC,UAARD,EAAyB,CAAErS,MAAOq2B,EAAMr2B,MAAOsS,MAAM,GAClD,CAAEtS,MAAO,CAACq2B,EAAM15B,IAAK05B,EAAMr2B,OAAQsS,MAAM,IAN9CvQ,EAAMnB,YAASU,EACR,CAAEtB,WAAOsB,EAAWgR,MAAM,MAMlCsC,EAAS,UAAY,UAAWA,GAAQ,GAG3CohB,EAAW/H,M,6BCtLf,IAAIlc,EAAwBzX,EAAQ,IAChCqQ,EAAUrQ,EAAQ,IAItBL,EAAOC,QAAU6X,EAAwB,GAAGrW,SAAW,WACrD,MAAO,WAAaiP,EAAQpP,MAAQ,M,gBCPtC,IAAIlB,EAASC,EAAQ,GACjBsvB,EAAetvB,EAAQ,IACvB+B,EAAU/B,EAAQ,IAClB+F,EAA8B/F,EAAQ,GAE1C,IAAK,IAAIyvB,KAAmBH,EAAc,CACxC,IAAII,EAAa3vB,EAAO0vB,GACpBE,EAAsBD,GAAcA,EAAWpuB,UAEnD,GAAIquB,GAAuBA,EAAoB5tB,UAAYA,EAAS,IAClEgE,EAA4B4pB,EAAqB,UAAW5tB,GAC5D,MAAOjC,GACP6vB,EAAoB5tB,QAAUA,K,+FCU3B,WACN,UAAI5B,EACH,YAGD,MAAO,CACNA,IADM,EAENm8B,YAFM,EAGNC,YA1BF,IAAMC,EAAa54B,sCAAnB,GAEMzD,EAAMq8B,EAAaA,eAAH,aAAtB,KAEMC,EAAqB74B,sCAA3B,GAEM04B,EAAcG,EAAqBA,eAAH,yBAAtC,KAEMF,EAAU,oBAAQ7zB,IAErBA,GAFH,e,6BCVA,IAAI5D,EAAQ9E,EAAQ,GAIpB,SAAS08B,EAAGC,EAAGr3B,GACb,OAAO+N,OAAOspB,EAAGr3B,GAGnB1F,EAAQ8T,cAAgB5O,GAAM,WAE5B,IAAIiP,EAAK2oB,EAAG,IAAK,KAEjB,OADA3oB,EAAGN,UAAY,EACW,MAAnBM,EAAGlU,KAAK,WAGjBD,EAAQ+T,aAAe7O,GAAM,WAE3B,IAAIiP,EAAK2oB,EAAG,KAAM,MAElB,OADA3oB,EAAGN,UAAY,EACU,MAAlBM,EAAGlU,KAAK,W,+QCZjB,IAAI+8B,EAAkBv7B,OAAOC,UAAUgB,eAEvC,SAASpC,EAAI2F,EAAQxD,GACnB,OAAOu6B,EAAgBn7B,KAAKoE,EAAQxD,GA+BtC,SAASw6B,EAAkBlvB,GAGzB,QAAIA,GAAK,OAAUA,GAAK,WAEpBA,GAAK,OAAUA,GAAK,SACH,QAAZ,MAAJA,IAA2C,QAAZ,MAAJA,OAE5BA,GAAK,GAAQA,GAAK,KACZ,KAANA,MACAA,GAAK,IAAQA,GAAK,QAClBA,GAAK,KAAQA,GAAK,QAElBA,EAAI,eAIV,SAASmvB,EAAcnvB,GAErB,GAAIA,EAAI,MAAQ,CAEd,IAAIovB,EAAa,QADjBpvB,GAAK,QAC2B,IAC5BqvB,EAAa,OAAc,KAAJrvB,GAE3B,OAAO9I,OAAOo4B,aAAaF,EAAYC,GAEzC,OAAOn4B,OAAOo4B,aAAatvB,GAI7B,IAAIuvB,EAAkB,8CAElBC,EAAkB,IAAI9pB,OAAO6pB,EAAe72B,OAAS,IADnC,6BACmDA,OAAQ,MAE7E+2B,EAAyB,qCAEzBC,EAAWr9B,EAAQ,KA4CvB,IAAIs9B,EAAsB,SACtBC,EAAyB,UACzBC,EAAoB,CACtB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,UAGP,SAASC,EAAkB1L,GACzB,OAAOyL,EAAkBzL,GAY3B,IAAI2L,EAAmB,uBAwCvB,IAAIC,EAAmB39B,EAAQ,KAsE/BJ,EAAQg+B,IAAsB,GAC9Bh+B,EAAQg+B,IAAIC,MAAkB79B,EAAQ,KACtCJ,EAAQg+B,IAAIE,QAAkB99B,EAAQ,KAEtCJ,EAAQkZ,OAlPR,SAAgB9W,GACd,IAAIupB,EAAUpV,MAAM7U,UAAU0C,MAAMvC,KAAKwC,UAAW,GAcpD,OAZAsnB,EAAQxpB,SAAQ,SAAUsE,GACxB,GAAKA,EAAL,CAEA,GAAsB,WAAlB,EAAOA,GACT,MAAM,IAAIzB,UAAUyB,EAAS,kBAG/BhF,OAAOkP,KAAKlK,GAAQtE,SAAQ,SAAUM,GACpCL,EAAIK,GAAOgE,EAAOhE,UAIfL,GAoOTpC,EAAQoD,SA7PR,SAAkBhB,GAAO,MAAuB,oBAFhD,SAAgBA,GAAO,OAAOX,OAAOC,UAAUF,SAASK,KAAKO,GAE7B+7B,CAAO/7B,IA8PvCpC,EAAQM,IAAsBA,EAC9BN,EAAQo+B,WA3JR,SAAoBz5B,GAClB,OAAIA,EAAI6P,QAAQ,MAAQ,EAAY7P,EAC7BA,EAAIC,QAAQ04B,EAAgB,OA0JrCt9B,EAAQq+B,YAvJR,SAAqB15B,GACnB,OAAIA,EAAI6P,QAAQ,MAAQ,GAAK7P,EAAI6P,QAAQ,KAAO,EAAY7P,EAErDA,EAAIC,QAAQ24B,GAAiB,SAAUrpB,EAAOoqB,EAASC,GAC5D,OAAID,GAnCR,SAA8BpqB,EAAOpT,GACnC,IAAI2iB,EAAO,EAEX,OAAInjB,EAAIm9B,EAAU38B,GACT28B,EAAS38B,GAGS,KAAvBA,EAAKiE,WAAW,IAAsBy4B,EAAuBrqB,KAAKrS,IAKhEm8B,EAJJxZ,EAAiC,MAA1B3iB,EAAK,GAAGkY,cACbwlB,SAAS19B,EAAKsD,MAAM,GAAI,IAExBo6B,SAAS19B,EAAKsD,MAAM,GAAI,KAEjB84B,EAAczZ,GAIlBvP,EAmBEuqB,CAAqBvqB,EAAOqqB,OAmJvCv+B,EAAQi9B,kBAAsBA,EAC9Bj9B,EAAQk9B,cAAsBA,EAE9Bl9B,EAAQ0+B,WAnIR,SAAoB/5B,GAClB,OAAI+4B,EAAoBvqB,KAAKxO,GACpBA,EAAIC,QAAQ+4B,EAAwBE,GAEtCl5B,GAgIT3E,EAAQ2+B,eAvOR,SAAwBpvB,EAAK6N,EAAKwhB,GAChC,MAAO,GAAG1yB,OAAOqD,EAAInL,MAAM,EAAGgZ,GAAMwhB,EAAarvB,EAAInL,MAAMgZ,EAAM,KAuOnEpd,EAAQ6+B,QApHR,SAAiBpb,GACf,OAAQA,GACN,KAAK,EACL,KAAK,GACH,OAAO,EAEX,OAAO,GA+GTzjB,EAAQ8+B,aA3GR,SAAsBrb,GACpB,GAAIA,GAAQ,MAAUA,GAAQ,KAAU,OAAO,EAC/C,OAAQA,GACN,KAAK,EACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,MACH,OAAO,EAEX,OAAO,GA4FTzjB,EAAQ++B,eAvER,SAAwB5M,GACtB,OAAQA,GACN,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACL,KAAK,IACH,OAAO,EACT,QACE,OAAO,IAoCbnyB,EAAQg/B,YApFR,SAAqB7M,GACnB,OAAO4L,EAAiB5qB,KAAKgf,IAoF/BnyB,EAAQi/B,SA9HR,SAAkBt6B,GAChB,OAAOA,EAAIC,QAAQk5B,EAAkB,SA8HvC99B,EAAQk/B,mBAhCR,SAA4Bv6B,GAI1B,OAAOA,EAAID,OAAOE,QAAQ,OAAQ,KAAK+c,gB,0SChPlC,SAAS,EAAgB,EAAO,GACrC,OAAI,EAAM,UAAU,QAChB,GAAU,EAAS,EAAM,GAAG,kBAAkB,mBAC3C,GAsDT,SAAS,EAAY,EAAM,GACzB,KAAO,EAAM,EAAgB,SAAR,EAAkB,EAAK,WAAa,EAAK,UAC5D,GAAI,EAAK,YAAa,OAAO,EAC/B,OAAO,EAyBT,SAAS,EAAc,GACnB,IAAG,EAAK,OAAO,KAAK,KAAK,UAAW,IAAKwd,IAAI,EAAI,EAAK,MAAQ,EAAG,GAAK,EAAG,IAAK,CAC9E,GAAI,EAAK,MAAM,GAAK,EAAG,OAAO,EAAK,IAAI,QAAQ,EAAK,OAAO,EAAI,IAC/D,GAAI,EAAK,KAAK,GAAG,KAAK,KAAK,UAAW,MAEtC,OAAK,KAoET,SAAS,EAAa,GAClB,IAAG,EAAK,OAAO,KAAK,KAAK,UAAW,IAAKA,IAAI,EAAI,EAAK,MAAQ,EAAG,GAAK,EAAG,IAAK,CAC9EA,IAAI,EAAS,EAAK,KAAK,GACvB,GAAI,EAAK,MAAM,GAAK,EAAI,EAAO,WAAY,OAAO,EAAK,IAAI,QAAQ,EAAK,MAAM,EAAI,IAClF,GAAI,EAAO,KAAK,KAAK,UAAW,MAElC,OAAO,KA4CF,SAAS,EAAK,EAAO,GAC1B,MAAmB,EAAM,UAApB,UAAO,QACR,EAAQ,EAAM,WAAW,GAAM,EAAS,GAAS,YAAW,GAChE,OAAc,MAAV,IACA,GAAU,EAAS,EAAM,GAAG,KAAK,EAAO,GAAQ,mBAC7C,GAcT,SAAS,EAAe,GACtB,IAAKA,IAAI,EAAI,EAAG,EAAI,EAAM,UAAW,IAAK,CACxC,IAAK,EAAQ,EAAM,KAAK,GAAnB,KACL,GAAI,EAAK,cAAgB,EAAK,mBAAoB,OAAO,EAE3D,OAAO,KAOF,SAAS,EAAS,EAAO,GAC5B,IAAF,EAAuB,EAAM,UAAxB,UAAO,YACV,IAAG,EAAM,OAAO,KAAK,KAAK,OAAS,EAAM,WAAW,GAAU,OAAO,EACrEA,IAAE,EAAQ,EAAM,MAAM,GAAI,EAAQ,EAAM,YAAY,GAAI,EAAO,EAAe,EAAM,eAAe,IACnG,IAAG,EAAM,eAAe,EAAO,EAAO,GAAO,OAAO,EACpD,GAAE,EAAU,CACRA,IAAA,EAAM,EAAM,QAAS,EAAK,EAAM,GAAG,YAAY,EAAK,EAAK,EAAK,iBAC9D,EAAD,aAAa,YAAU,KAAK,EAAG,IAAI,QAAQ,GAAM,IAChD,EAAK,EAAG,kBAEZ,OAAK,EA0CF,SAAS,EAAW,EAAO,GAC9B,IAAF,EAAmB,EAAM,UAApB,UAAO,QACV,GAAE,EAAM,qBAAqB,iBAAiB,EAAM,UAAU,KAAK,QACnE,SAAK,EAAM,eAAiB,YAAS,EAAM,IAAK,EAAM,QAClD,GAAU,EAAS,EAAM,GAAG,MAAM,EAAM,KAAK,mBAC1C,GAGP,IAAG,EAAM,OAAO,QAAS,OAAO,EAEhC,GAAE,EAAU,CACRA,IAAA,EAAQ,EAAI,cAAgB,EAAI,OAAO,QAAQ,KAC/C,EAAK,EAAM,GACX,EAAM,qBAAqB,iBAAe,EAAG,kBAC7CA,IAAA,EAAuB,GAAf,EAAM,MAAa,KAAO,EAAe,EAAM,MAAM,GAAG,eAAe,EAAM,YAAY,KACjG,EAAQ,GAAS,EAAQ,CAAC,CAAC,KAAM,IAAU,KAC3C,EAAM,YAAS,EAAG,IAAK,EAAG,QAAQ,IAAI,EAAM,KAAM,EAAG,GACpD,GAAU,IAAO,YAAS,EAAG,IAAK,EAAG,QAAQ,IAAI,EAAM,KAAM,EAAG,GAAS,CAAC,CAAC,KAAM,OACpF,EAAQ,CAAC,CAAC,KAAM,IAChB,GAAM,GAEJ,IACF,EAAG,MAAM,EAAG,QAAQ,IAAI,EAAM,KAAM,EAAG,GAClC,GAAU,EAAM,cAAgB,EAAM,OAAO,MAAQ,IACtD,EAAM,MAAM,GAAG,WAAW,EAAM,OAAO,GAAI,EAAM,YAAY,GAAI,WAAS,KAAK,EAAM,SAAU,EAAM,UACvG,EAAG,cAAc,EAAG,QAAQ,IAAI,EAAM,UAAW,IAErD,EAAS,EAAG,kBAEd,OAAO,EAkDT,SAAS,EAAc,EAAO,EAAM,GAChCA,IAAoD,EAAM,EAAxD,EAAS,EAAK,WAAY,EAAQ,EAAK,UACzC,GAAE,EAAO,KAAK,KAAK,WAAa,EAAM,KAAK,KAAK,UAAW,OAAO,EACpE,GApBF,SAAwB,EAAO,EAAM,GACjCA,IAAE,EAAS,EAAK,WAAY,EAAQ,EAAK,UAAW,EAAQ,EAAK,QACjE,SAAG,GAAW,GAAU,EAAO,KAAK,kBAAkB,EAAM,UACzD,EAAO,QAAQ,MAAQ,EAAK,OAAO,WAAW,EAAQ,EAAG,IACxD,GAAU,EAAS,EAAM,GAAG,OAAO,EAAK,IAAM,EAAO,SAAU,EAAK,KAAK,mBACtE,MAEJ,EAAK,OAAO,WAAW,EAAO,EAAQ,KAAQ,EAAM,cAAe,YAAQ,EAAM,IAAK,EAAK,QAE5F,GACF,EAAS,EAAM,GACL,kBAAkB,EAAK,IAAK,EAAO,KAAM,EAAO,eAAe,EAAO,aACtE,KAAK,EAAK,KACV,mBACL,IAMH,CAAe,EAAO,EAAM,GAAW,OAAO,EAElD,GAAI,EAAK,OAAO,WAAW,EAAK,QAAS,EAAK,QAAU,KACnD,GAAQ,EAAQ,EAAO,eAAe,EAAO,aAAa,aAAa,EAAM,QAC9E,EAAM,UAAU,EAAK,IAAM,EAAM,MAAM,SAAU,CACnD,GAAI,EAAU,CAEZ,IADAA,IAAI,EAAM,EAAK,IAAM,EAAM,SAAU,EAAO,WAAS,MAC5C,EAAI,EAAK,OAAS,EAAG,GAAK,EAAG,IACpC,EAAO,WAAS,KAAK,EAAK,GAAG,OAAO,KAAM,IAC5C,EAAO,WAAS,KAAK,EAAO,KAAK,IACjCA,IAAI,EAAK,EAAM,GAAG,KAAK,IAAI,IAAkB,EAAK,IAAM,EAAG,EAAK,EAAK,IAAK,EAAK,IAAI,QAAM,EAAM,EAAG,GAAI,EAAK,QAAQ,IAC/G,EAAS,EAAM,EAAI,EAAK,OACxB,YAAQ,EAAG,IAAK,IAAS,EAAG,KAAK,GACrC,EAAS,EAAG,kBAEd,OAAO,EAGTA,IAAI,EAAW,YAAU,SAAS,EAAM,GACpC,EAAQ,GAAY,EAAS,MAAM,WAAW,EAAS,KAAM,EAAS,GAAS,YAAW,GAC9F,OAAc,MAAV,GAAkB,GAAU,EAAK,QAC/B,GAAU,EAAS,EAAM,GAAG,KAAK,EAAO,GAAQ,mBAC7C,GAWJ,SAAS,EAAO,EAAU,GAC/B,OAAO,SAAS,EAAO,GACrB,MAAmB,EAAM,UAApB,UAAO,QACR,EAAQ,EAAM,WAAW,GAAM,EAAW,GAAS,YAAa,EAAO,EAAU,GACrF,QAAK,IACD,GAAU,EAAS,EAAM,GAAG,KAAK,EAAO,GAAU,mBAC/C,IAOJ,SAAS,EAAa,EAAU,GACnC,OAAK,SAAS,EAAO,GACrB,MAAiB,EAAM,UAAlB,SAAM,OACP,GAAa,EAWjB,OAVA,EAAM,IAAI,aAAa,EAAM,GAAE,SAAG,EAAM,GACtC,GAAI,EAAY,OAAO,EACvB,GAAK,EAAK,cAAe,EAAK,UAAU,EAAU,GAClD,GAAI,EAAK,MAAQ,EACf,GAAa,MACR,CACLA,IAAI,EAAO,EAAM,IAAI,QAAQ,GAAM,EAAQ,EAAK,QAChD,EAAa,EAAK,OAAO,eAAe,EAAO,EAAQ,EAAG,SAGzD,IACD,GAAU,EAAS,EAAM,GAAG,aAAa,EAAM,EAAI,EAAU,GAAO,mBACjE,IAyBJ,SAAS,EAAW,EAAU,GACnC,OAAO,SAAS,EAAO,GACrB,MAA+B,EAAM,UAAhC,UAAO,YAAS,WACrB,GAAK,IAAU,IAxBnB,SAAqB,EAAK,EAAQ,GAChC,I,kBACE,MAAmB,EAAO78B,GAArB,UAAO,QACR,EAAqB,GAAf,EAAM,OAAa,EAAI,KAAK,eAAe,GAKrD,GAJA,EAAI,aAAa,EAAM,IAAK,EAAI,KAAG,SAAE,GACnC,GAAI,EAAK,OAAO,EAChB,EAAM,EAAK,eAAiB,EAAK,KAAK,eAAe,MAEnD,EAAK,UAAO,IAPTA,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAG,C,2BASpC,OAAK,EAcuB,CAAY,EAAM,IAAK,EAAQ,GAAW,OAAO,EAC7E,GAAI,EACF,GAAI,EACE,EAAS,QAAQ,EAAM,aAAe,EAAQ,SAChD,EAAS,EAAM,GAAG,iBAAiB,IAEnC,EAAS,EAAM,GAAG,cAAc,EAAS,OAAO,SAC7C,CAEL,IADA68B,IAAI,GAAM,EAAO,EAAK,EAAM,GACnB,EAAI,GAAI,GAAO,EAAI,EAAO,OAAQ,IAAK,CAC9C,MAAmB,EAAO,GAArB,UAAO,QACZ,EAAM,EAAM,IAAI,aAAa,EAAM,IAAK,EAAI,IAAK,GAEnD,IAAKA,IAAI78B,EAAI,EAAGA,EAAI,EAAO,OAAQA,IAAK,CACtC,MAAmB,EAAOA,GAArB,UAAO,QACR,EAAK,EAAG,WAAW88B,EAAM,IAAKC,EAAI,IAAK,GACtC,EAAG,QAAQD,EAAM,IAAKC,EAAI,IAAK,EAAS,OAAO,IAEtD,EAAS,EAAG,kBAGhB,OAAO,GA4DJ,SAAS,I,uDACd,OAAO,SAAS,EAAO,EAAU,GAC/B,IAAKF,IAAI,EAAI,EAAG,EAAI,EAAS,OAAQ,IACnC,GAAI,EAAS,GAAG,EAAO,EAAU,GAAO,OAAO,EACjD,OAAO,GAIXA,IAAI,EAAY,EAAc,GA1hBvB,SAAsB,EAAO,EAAU,GAC5C,IAAK,EAAW,EAAM,UAAjB,QACL,IAAK,IAAY,GAAQ,EAAK,eAAe,WAAY,GACjC,EAAQ,aAAe,GAC7C,OAAO,EAETA,IAAI,EAAO,EAAc,GAGzB,IAAK,EAAM,CACTA,IAAI,EAAQ,EAAQ,aAAc,EAAS,GAAS,YAAW,GAC/D,OAAc,MAAV,IACA,GAAU,EAAS,EAAM,GAAG,KAAK,EAAO,GAAQ,mBAC7C,GAGTA,IAAI,EAAS,EAAK,WAElB,IAAK,EAAO,KAAK,KAAK,WAAa,EAAc,EAAO,EAAM,GAC5D,OAAO,EAIT,GAAmC,GAA/B,EAAQ,OAAO,QAAQ,OACtB,EAAY,EAAQ,QAAU,gBAAc,aAAa,IAAU,CACtE,GAAI,EAAU,CACZA,IAAI,EAAK,EAAM,GAAG,YAAY,EAAQ,SAAU,EAAQ,SACxD,EAAG,aAAa,EAAY,EAAQ,OAAS,YAAU,SAAS,EAAG,IAAI,QAAQ,EAAG,QAAQ,IAAI,EAAK,KAAM,KAAM,GAC7F,gBAAc,OAAO,EAAG,IAAK,EAAK,IAAM,EAAO,WAC3D,EAAG,EAAG,kBAEd,OAAO,EAIP,SAAE,EAAO,QAAU,EAAK,OAAS,EAAQ,MAAQ,KAC7C,GAAU,EAAS,EAAM,GAAG,OAAO,EAAK,IAAM,EAAO,SAAU,EAAK,KAAK,mBACtE,MAmBJ,SAA4B,EAAO,EAAU,GAClD,MAAqB,EAAM,UAAtB,UAAiC,EAAO,EAC3C,IADU,QACA,OAAO,EAEnB,GAAI,EAAM,OAAO,YAAa,CAC5B,GAAI,GAAQ,EAAK,eAAe,WAAY,GAAS,EAAM,aAAe,EAAG,OAAO,EACpF,EAAO,EAAc,GAEvBA,IAAI,EAAO,GAAQ,EAAK,WACxB,SAAK,IAAS,gBAAc,aAAa,MACrC,GACF,EAAS,EAAM,GAAG,aAAa,gBAAc,OAAO,EAAM,IAAK,EAAK,IAAM,EAAK,WAAW,mBACrF,MAudL,EAAM,EAAc,GAtcjB,SAAqBt3B,EAAO,EAAU,GACzC,IAAG,EAAW,EAAM,UAAjB,QACH,IAAG,IAAY,GAAQ,EAAK,eAAe,UAAW,GAChC,EAAQ,aAAe,EAAQ,OAAO,QAAQ,MACpE,OAAO,EAEPs3B,IAAE,EAAO,EAAa,GAGxB,IAAK,EAAM,OAAO,EAElBA,IAAI,EAAQ,EAAK,UAEjB,GAAI,EAAc,EAAO,EAAM,GAAW,OAAO,EAI/C,GAAiC,GAA/B,EAAQ,OAAO,QAAQ,OACtB,EAAY,EAAO,UAAY,gBAAc,aAAa,IAAS,CACtE,GAAI,EAAU,CACZA,IAAI,EAAK,EAAM,GAAG,YAAY,EAAQ,SAAU,EAAQ,SACxD,EAAG,aAAa,EAAY,EAAO,SAAW,YAAU,SAAS,EAAG,IAAI,QAAQ,EAAG,QAAQ,IAAI,EAAK,MAAO,GACzF,gBAAc,OAAO,EAAG,IAAK,EAAG,QAAQ,IAAI,EAAK,OACnE,EAAS,EAAG,kBAEd,OAAO,EAIP,SAAE,EAAM,QAAU,EAAK,OAAS,EAAQ,MAAQ,KAC5C,GAAU,EAAS,EAAM,GAAG,OAAO,EAAK,IAAK,EAAK,IAAM,EAAM,UAAU,mBACrE,MAaJ,SAA2B,EAAO,EAAU,GACjD,MAAqB,EAAM,UAAtB,UAAiC,EAAO,EAC7C,IADY,QACA,OAAO,EACnB,GAAI,EAAM,OAAO,YAAa,CAC5B,GAAI,GAAQ,EAAK,eAAe,UAAW,GAAS,EAAM,aAAe,EAAM,OAAO,QAAQ,KAC5F,OAAO,EACT,EAAO,EAAa,GAEtBA,IAAI,EAAO,GAAQ,EAAK,UACxB,SAAK,IAAS,gBAAc,aAAa,MACrC,GACF,EAAS,EAAM,GAAG,aAAa,gBAAc,OAAO,EAAM,IAAK,EAAK,MAAM,mBACrE,MA2ZE,EAAe,CACxB,MAAS,GA3VJ,SAAuB,EAAO,GACnC,MAAuB,EAAM,UAAxB,UAAO,YACV,SAAG,EAAM,OAAO,KAAK,KAAK,OAAS,EAAM,WAAW,MAClD,GAAU,EAAS,EAAM,GAAG,WAAW,MAAM,mBAC1C,MA+BF,SAA6B,EAAO,GACvC,IAAF,EAAmB,EAAM,UAApB,UAAO,QACV,GAAE,EAAM,OAAO,eAAiB,EAAI,OAAO,cAAe,OAAO,EACjEA,IAAE,EAAO,EAAe,EAAM,OAAO,eAAe,EAAI,eACxD,IAAG,IAAS,EAAK,YAAa,OAAO,EACrC,GAAE,EAAU,CACZA,IAAI,IAAS,EAAM,cAAgB,EAAI,QAAU,EAAI,OAAO,WAAa,EAAQ,GAAK,IAClF,EAAK,EAAM,GAAG,OAAO,EAAM,EAAK,iBACpC,EAAG,aAAa,gBAAc,OAAO,EAAG,IAAK,EAAO,IACpD,EAAS,EAAG,kBAEd,OAAO,KAMF,SAAwB,EAAO,GAClC,IAAG,EAAW,EAAM,UAAjB,QACL,IAAK,GAAW,EAAQ,OAAO,QAAQ,KAAM,OAAO,EAClD,GAAE,EAAQ,MAAQ,GAAK,EAAQ,SAAW,EAAQ,KAAK,GAAI,CAC3DA,IAAI,EAAS,EAAQ,SACrB,GAAI,YAAS,EAAM,IAAK,GAEtB,OADI,GAAU,EAAS,EAAM,GAAG,MAAM,GAAQ,mBACvC,EAGXA,IAAI,EAAQ,EAAQ,aAAc,EAAS,GAAS,YAAW,GAC/D,OAAc,MAAV,IACA,GAAU,EAAS,EAAM,GAAG,KAAK,EAAO,GAAQ,mBAC7C,KA0RoE,GAC3E,YAAa,EACb,UAAa,EACb,gBAAiB,EACjB,OAAU,EACV,aAAc,EACd,QAjOK,SAAmB,EAAO,GAE7B,OADE,GAAU,EAAS,EAAM,GAAG,aAAa,IAAI,eAAa,EAAM,QAC7D,IAuOE,EAAgB,CACzB,SAAU,EAAY,UACtB,gBAAiB,EAAa,iBAC9B,SAAU,EAAY,OACtB,qBAAsB,EAAa,cACnC,aAAc,EAAa,cAC3B,QAAS,EAAa,eAExB,IAAKA,IAAI,KAAO,EAAc,EAAc,GAAO,EAAa,GAGhEG,IAOW,GAPqB,oBAAb,UAA2B,MAAM,KAAK,UAAU,UAC1C,oBAAN,IAAqC,UAAjB,GAAG,YAMZ,EAAgB,G,0qBC1lB9CA,IAAM,EAAc,OAAO,OAAO,MAIrB,EAKX,SAAY,EAAS,EAAO,GAG5B,KAAO,OAAS,GAAU,CAAC,IAAI,EAAe,EAAQ,IAAI,GAAQ,EAAQ,IAAI,KAI5E,KAAK,QAAU,EAIf,KAAK,MAAQ,G,kKACd,IAIH,EAAM,sBAAW,OAAO,KAAK,QAAQ,KAIrC,EAAM,oBAAS,OAAO,KAAK,MAAM,KAIjC,EAAM,oBAAS,OAAO,KAAK,MAAM,KAIjC,EAAM,kBAAO,OAAO,KAAK,IAAI,KAI7B,EAAM,qBACF,OAAO,KAAK,OAAO,GAAG,OAK1B,EAAM,mBACJ,OAAS,KAAK,OAAO,GAAG,KAK1B,EAAM,qBAEF,IADAH,IAAI,EAAS,KAAK,OACT,EAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,GAAI,EAAO,GAAG,MAAM,KAAO,EAAO,GAAG,IAAI,IAAK,OAAO,EACvD,OAAO,GAYX,YAAE,mBACA,OAAS,KAAK,MAAM,KAAK,GAAG,MAAM,KAAK,KAAM,KAAK,IAAI,IAMxD,YAAE,iBAAQ,EAAI,Q,UAAU,QAAM,OAK1B,IADAA,IAAI,EAAW,EAAQ,QAAQ,UAAW,EAAa,KAC9C,EAAI,EAAG,EAAI,EAAQ,QAAS78B,IACrC,EAAe,EACb,EAAW,EAAS,UAItB,IADA68B,IAAI,EAAU,EAAG,MAAM,OAAQ,EAAS,KAAK,OACpC78B,EAAI,EAAGA,EAAI,EAAO,OAAQA,IAAK,CACxC,MAAqB,EAAOA,GAArB,UAAO,QAAkB,EAAU,EAAG,QAAQ,MAAM,GACzD,EAAG,aAAa,EAAQ,IAAI,EAAM,KAAM,EAAQ,IAAI,EAAI,KAAMA,EAAI,QAAM,MAAQ,GACvE,GAALA,GACF,EAAwB,EAAI,GAAU,EAAW,EAAS,SAAW,GAAc,EAAW,cAAgB,EAAI,KAO1H,YAAE,qBAAY,EAAI,GAEd,IADA68B,IAAI,EAAU,EAAG,MAAM,OAAQ,EAAS,KAAK,OACpC,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACxC,MAAqB,EAAO,GAArB,UAAO,QAAkB,EAAU,EAAG,QAAQ,MAAM,GACrD,EAAO,EAAQ,IAAI,EAAM,KAAM,EAAK,EAAQ,IAAI,EAAI,KACpD,EACF,EAAG,YAAY,EAAM,IAEvB,EAAK,iBAAiB,EAAM,EAAI,GAC9B,EAAwB,EAAI,EAAS,EAAK,UAAY,EAAI,MAiBlE,EAAS,kBAAS,EAAM,EAAK,GACzBA,IAAI,EAAQ,EAAK,OAAO,cAAgB,IAAI,EAAc,GACpD,EAAgB,EAAK,KAAK,GAAI,EAAK,OAAQ,EAAK,IAAK,EAAK,QAAS,EAAK,GAC9E,GAAI,EAAO,OAAO,EAElB,IAAKA,IAAI,EAAQ,EAAK,MAAQ,EAAG,GAAS,EAAG,IAAS,CACpDA,IAAI,EAAQ,EAAM,EACZ,EAAgB,EAAK,KAAK,GAAI,EAAK,KAAK,GAAQ,EAAK,OAAO,EAAQ,GAAI,EAAK,MAAM,GAAQ,EAAK,GAChG,EAAgB,EAAK,KAAK,GAAI,EAAK,KAAK,GAAQ,EAAK,MAAM,EAAQ,GAAI,EAAK,MAAM,GAAS,EAAG,EAAK,GACzG,GAAI,EAAO,OAAO,IAQtB,EAAO,cAAK,EAAM,GAChB,Y,UADuB,GAChB,KAAK,SAAS,EAAM,IAAS,KAAK,SAAS,GAAO,IAAS,IAAI,EAAa,EAAK,KAAK,KAQ/F,EAAO,iBAAQ,GACb,OAAO,EAAgB,EAAK,EAAK,EAAG,EAAG,IAAM,IAAI,EAAa,IAMhE,EAAO,eAAM,GACb,OAAS,EAAgB,EAAK,EAAK,EAAI,QAAQ,KAAM,EAAI,YAAa,IAAM,IAAI,EAAa,IAM7F,EAAO,kBAAS,EAAK,GACnB,IAAK,IAAS,EAAK,KAAM,MAAM,IAAI,WAAW,wCAChD,IAAM,EAAM,EAAY,EAAK,MAC3B,IAAK,EAAK,MAAM,IAAI,WAAU,qBAAsB,EAAK,KAAI,YAC/D,OAAS,EAAI,SAAS,EAAK,IAQ3B,EAAO,gBAAO,EAAI,GAChB,GAAI,KAAM,EAAa,MAAM,IAAI,WAAW,sCAAwC,GAGpF,OAFA,EAAY,GAAM,EAClB,EAAe,UAAU,OAAS,EAC3B,GAWX,YAAE,uBACE,OAAO,EAAc,QAAQ,KAAK,QAAS,KAAK,OAAO,e,oCAE1D,GAMD,EAAU,UAAU,SAAU,EAiB9B,IAAa,EAEX,SAAY,EAAO,GAGjB,KAAK,MAAQ,EAGb,KAAK,IAAM,GAQF,EAAa,YAGxB,WAAY,EAAS,Q,UAAQ,GAC3BI,OAAK,KAAC,EAAS,G,qHAChB,I,OAKD,EAAI,uBAAY,OAAO,KAAK,QAAQ,KAAO,KAAK,MAAM,IAAM,KAAK,MAAQ,M,YAEzE,aAAI,EAAK,GACPJ,IAAI,EAAQ,EAAI,QAAQ,EAAQ,IAAI,KAAK,OACzC,IAAK,EAAM,OAAO,cAAe,OAAO,EAAU,KAAK,GACvDA,IAAI,EAAU,EAAI,QAAQ,EAAQ,IAAI,KAAK,SAC3C,OAAO,IAAI,EAAc,EAAQ,OAAO,cAAgB,EAAU,EAAO,I,YAG3E,iBAAQ,EAAI,GAEV,Q,UAFoB,QAAM,OAC1BI,YAAM,aAAO,KAAC,EAAI,GACd,GAAW,QAAM,MAAO,CAC1BJ,IAAI,EAAQ,KAAK,MAAM,YAAY,KAAK,KACpC,GAAO,EAAG,YAAY,K,YAI9B,YAAG,GACD,OAAO,aAAiB,GAAiB,EAAM,QAAU,KAAK,QAAU,EAAM,MAAQ,KAAK,M,YAG7F,uBACE,OAAO,IAAI,EAAa,KAAK,OAAQ,KAAK,O,YAG5C,kBACE,MAAO,CAAC,KAAM,OAAQ,OAAQ,KAAK,OAAQ,KAAM,KAAK,OAGxD,EAAO,kBAAS,EAAK,GACnB,GAA0B,iBAAf,EAAK,QAA0C,iBAAb,EAAK,KAChD,MAAM,IAAI,WAAW,4CACvB,OAAO,IAAI,EAAc,EAAI,QAAQ,EAAK,QAAS,EAAI,QAAQ,EAAK,QAKtE,EAAO,gBAAO,EAAK,EAAQ,Q,UAAO,GAChCA,IAAI,EAAU,EAAI,QAAQ,GAC1B,OAAO,IAAI,KAAK,EAAS,GAAQ,EAAS,EAAU,EAAI,QAAQ,KAUlE,EAAO,iBAAQ,EAAS,EAAO,GAC7BA,IAAI,EAAO,EAAQ,IAAM,EAAM,IAE/B,GADK,IAAQ,IAAM,EAAO,GAAQ,EAAI,GAAK,IACtC,EAAM,OAAO,cAAe,CAC/BA,IAAI,EAAQ,EAAU,SAAS,EAAO,GAAM,IAAS,EAAU,SAAS,GAAQ,GAAM,GACtF,IAAI,EACC,OAAO,EAAU,KAAK,EAAO,GADvB,EAAQ,EAAM,MAW3B,OARK,EAAQ,OAAO,gBACN,GAAR,IAGF,GAAW,EAAU,SAAS,GAAU,GAAM,IAAS,EAAU,SAAS,EAAS,GAAM,IAAO,SACnF,IAAM,EAAM,KAAS,EAAO,KAHzC,EAAU,GAMP,IAAI,EAAc,EAAS,I,yCA3EZ,CAAS,GA+EnC,EAAU,OAAO,OAAQ,GAEzB,IAAM,EACJ,SAAY,EAAQ,GAClB,KAAK,OAAS,EACd,KAAK,KAAO,GAEhB,YAAE,aAAI,GACJ,OAAS,IAAI,EAAa,EAAQ,IAAI,KAAK,QAAS,EAAQ,IAAI,KAAK,QAEvE,YAAE,iBAAQ,GACR,OAAS,EAAc,QAAQ,EAAI,QAAQ,KAAK,QAAS,EAAI,QAAQ,KAAK,QAS5E,IAAa,EAAa,YAIxB,WAAY,GACVA,IAAI,EAAO,EAAK,UACZ,EAAO,EAAK,KAAK,GAAG,QAAQ,EAAK,IAAM,EAAK,UAChDI,OAAK,KAAC,EAAM,GAEZ,KAAK,KAAO,E,4FACb,E,YAED,aAAI,EAAK,GACP,MAAqB,EAAQ,UAAU,KAAK,QAAvC,YAAS,QACV,EAAO,EAAI,QAAQ,GACvB,OAAI,EAAgB,EAAU,KAAK,GAC5B,IAAI,EAAc,I,YAG3B,mBACE,OAAO,IAAI,QAAM,WAAS,KAAK,KAAK,MAAO,EAAG,I,YAGhD,YAAG,GACD,OAAO,aAAiB,GAAiB,EAAM,QAAU,KAAK,Q,YAGhE,kBACE,MAAO,CAAC,KAAM,OAAQ,OAAQ,KAAK,S,YAGrC,uBAAgB,OAAO,IAAI,EAAa,KAAK,SAE7C,EAAO,kBAAS,EAAK,GACnB,GAA0B,iBAAf,EAAK,OACd,MAAM,IAAI,WAAW,4CACvB,OAAO,IAAI,EAAc,EAAI,QAAQ,EAAK,UAK5C,EAAO,gBAAO,EAAK,GACjB,OAAO,IAAI,KAAK,EAAI,QAAQ,KAM9B,EAAO,sBAAa,GAClB,OAAQ,EAAK,SAAwC,IAA9B,EAAK,KAAK,KAAK,Y,EAjDhB,CAAS,GAqDnC,EAAc,UAAU,SAAU,EAElC,EAAU,OAAO,OAAQ,GAEzB,IAAM,EACJ,SAAY,GACV,KAAK,OAAS,GAElB,YAAE,aAAI,GACJ,MAAuB,EAAQ,UAAU,KAAK,QAAvC,YAAS,QACd,OAAO,EAAU,IAAI,EAAa,EAAK,GAAO,IAAI,EAAa,IAEnE,YAAE,iBAAQ,GACNJ,IAAI,EAAO,EAAI,QAAQ,KAAK,QAAS,EAAO,EAAK,UACjD,OAAI,GAAQ,EAAc,aAAa,GAAc,IAAI,EAAc,GAChE,EAAU,KAAK,IAQ1B,IAAa,EAAY,YAGvB,WAAY,GACVI,OAAK,KAAC,EAAI,QAAQ,GAAI,EAAI,QAAQ,EAAI,QAAQ,O,4FAC/C,E,YAED,iBAAQ,EAAI,GACV,Q,UADoB,QAAM,OACtB,GAAW,QAAM,MAAO,CAC1B,EAAG,OAAO,EAAG,EAAG,IAAI,QAAQ,MAC5BJ,IAAI,EAAM,EAAU,QAAQ,EAAG,KAC1B,EAAI,GAAG,EAAG,YAAY,EAAG,aAAa,QAE3CI,YAAM,aAAO,KAAC,EAAI,I,YAItB,kBAAW,MAAO,CAAC,KAAM,QAEzB,EAAO,kBAAS,GAAO,OAAO,IAAI,EAAa,I,YAE/C,aAAI,GAAO,OAAO,IAAI,EAAa,I,YAEnC,YAAG,GAAS,OAAO,aAAiB,G,YAEpC,uBAAgB,OAAO,G,EAzBA,CAAS,GA4BlC,EAAU,OAAO,MAAO,GAExBD,IAAM,EAAc,CAClB,eAAQ,OAAO,MACf,iBAAQ,GAAO,OAAO,IAAI,EAAa,KAQzC,SAAS,EAAgB,EAAK,EAAM,EAAK,EAAO,EAAK,GACnD,GAAI,EAAK,cAAe,OAAO,EAAc,OAAO,EAAK,GACzD,IAAKH,IAAI,EAAI,GAAS,EAAM,EAAI,EAAI,GAAI,EAAM,EAAI,EAAI,EAAK,WAAa,GAAK,EAAG,GAAK,EAAK,CACxFA,IAAI,EAAQ,EAAK,MAAM,GACvB,GAAK,EAAM,QAGJ,IAAK,GAAQ,EAAc,aAAa,GAC7C,OAAO,EAAc,OAAO,EAAK,GAAO,EAAM,EAAI,EAAM,SAAW,QAJlD,CACjBA,IAAI,EAAQ,EAAgB,EAAK,EAAO,EAAM,EAAK,EAAM,EAAI,EAAM,WAAa,EAAG,EAAK,GACxF,GAAI,EAAO,OAAO,EAIpB,GAAO,EAAM,SAAW,GAI5B,SAAS,EAAwB,EAAI,EAAU,GAC7CA,IAAI,EAAO,EAAG,MAAM,OAAS,EAC7B,KAAI,EAAO,GAAX,CACAA,IAEiC,EAF7B,EAAO,EAAG,MAAM,GACpB,GAAM,aAAgB,KAAe,aAAgB,IAC3C,EAAG,QAAQ,KAAK,GACtB,SAAO,SAAE,EAAO,EAAK,EAAU,GAAuB,MAAP,IAAa,EAAM,MACtE,EAAG,aAAa,EAAU,KAAK,EAAG,IAAI,QAAQ,GAAM,KCpdtDG,IAmBaE,EAAW,YACtB,WAAY33B,GACV03B,OAAK,KAAC13B,EAAM43B,KAIZp+B,KAAKq+B,KAAOlI,KAAKG,MACjBt2B,KAAKs+B,aAAe93B,EAAM+3B,UAE1Bv+B,KAAKw+B,gBAAkB,EAGvBx+B,KAAKy+B,YAAcj4B,EAAMi4B,YAGzBz+B,KAAK0+B,QAAU,EAEf1+B,KAAKunB,KAAOnnB,OAAOkO,OAAO,M,sPAC3B,I,OAOD,EAAIiwB,UAAA,eAKF,OAJIv+B,KAAKw+B,gBAAkBx+B,KAAK2+B,MAAMx9B,SACpCnB,KAAKs+B,aAAet+B,KAAKs+B,aAAavkB,IAAI/Z,KAAKo+B,IAAKp+B,KAAK4+B,QAAQ77B,MAAM/C,KAAKw+B,kBAC5Ex+B,KAAKw+B,gBAAkBx+B,KAAK2+B,MAAMx9B,QAE7BnB,KAAKs+B,c,YAMdO,aAAA,SAAaN,GACX,GAAIA,EAAUR,MAAMK,KAAOp+B,KAAKo+B,IAC9B,MAAM,IAAIU,WAAW,uEAKvB,OAJA9+B,KAAKs+B,aAAeC,EACpBv+B,KAAKw+B,gBAAkBx+B,KAAK2+B,MAAMx9B,OAClCnB,KAAK0+B,SAAyC,GA5D9B,EA4DA1+B,KAAK0+B,SACrB1+B,KAAKy+B,YAAc,KACZz+B,MAKT,EAAI++B,aAAA,eACF,OApEgB,EAoER/+B,KAAK0+B,SAAyB,G,YAKxCM,eAAA,SAAeC,GAGb,OAFAj/B,KAAKy+B,YAAcQ,EACnBj/B,KAAK0+B,SA3E8B,EA4E5B1+B,M,YAOTk/B,YAAA,SAAYD,GAGV,OAFK,OAAKE,QAAQn/B,KAAKy+B,aAAez+B,KAAKu+B,UAAUR,MAAMkB,QAASA,IAClEj/B,KAAKg/B,eAAeC,GACfj/B,M,YAKTo/B,cAAA,SAAcC,GACZ,OAAOr/B,KAAKk/B,YAAYG,EAAKC,SAASt/B,KAAKy+B,aAAez+B,KAAKu+B,UAAUgB,MAAMN,W,YAKjFO,iBAAA,SAAiBH,GACf,OAAOr/B,KAAKk/B,YAAYG,EAAKI,cAAcz/B,KAAKy+B,aAAez+B,KAAKu+B,UAAUgB,MAAMN,WAKtF,EAAIS,eAAA,eACF,OAxGmC,EAwG3B1/B,KAAK0+B,SAA2B,G,YAG1CiB,QAAA,SAAQzkB,EAAMkjB,GACZF,YAAMyB,QAAA,KAAO,KAACzkB,EAAMkjB,GACpBp+B,KAAK0+B,SAAyB,EAAf1+B,KAAK0+B,QACpB1+B,KAAKy+B,YAAc,M,YAKrBmB,QAAA,SAAQvB,GAEN,OADAr+B,KAAKq+B,KAAOA,EACLr+B,M,YAKT6/B,iBAAA,SAAiB98B,GAEf,OADA/C,KAAKu+B,UAAUh7B,QAAQvD,KAAM+C,GACtB/C,M,YAOT8/B,qBAAA,SAAqBC,EAAMC,GACzBlC,IAAIS,EAAYv+B,KAAKu+B,UAIrB,OAHqB,IAAjByB,IACFD,EAAOA,EAAKV,KAAKr/B,KAAKy+B,cAAgBF,EAAU0B,MAAQ1B,EAAUR,MAAMkB,QAAWV,EAAUR,MAAMmC,YAAY3B,EAAUP,MAAQ,OAAKmC,QACxI5B,EAAU6B,YAAYpgC,KAAM+/B,GACrB//B,M,YAKTqgC,gBAAA,WAEE,OADArgC,KAAKu+B,UAAUh7B,QAAQvD,MAChBA,M,YAMTsgC,WAAA,SAAWC,EAAMhO,EAAMiO,Q,UAAKjO,GAC1BuL,IAAI2C,EAASzgC,KAAKo+B,IAAIr2B,KAAK04B,OAC3B,GAAY,MAARlO,EACF,OAAKgO,EACEvgC,KAAK8/B,qBAAqBW,EAAOF,KAAKA,IAAO,GADlCvgC,KAAKqgC,kBAGvB,IAAKE,EAAM,OAAOvgC,KAAK0gC,YAAYnO,EAAMiO,GACzC1C,IAAImB,EAAQj/B,KAAKy+B,YACjB,IAAKQ,EAAO,CACVnB,IAAIC,EAAQ/9B,KAAKo+B,IAAI3e,QAAQ8S,GAC7B0M,EAAQuB,GAAMjO,EAAOwL,EAAMkB,QAAUlB,EAAMmC,YAAYlgC,KAAKo+B,IAAI3e,QAAQ+gB,IAI1E,OAFAxgC,KAAK2gC,iBAAiBpO,EAAMiO,EAAIC,EAAOF,KAAKA,EAAMtB,IAC7Cj/B,KAAKu+B,UAAU0B,OAAOjgC,KAAK6+B,aAAa+B,EAAUC,KAAK7gC,KAAKu+B,UAAUP,MACpEh+B,M,YAOX8gC,QAAA,SAAQ1/B,EAAKqD,GAEX,OADAzE,KAAKunB,KAAmB,iBAAPnmB,EAAkBA,EAAMA,EAAIA,KAAOqD,EAC7CzE,M,YAKT+gC,QAAA,SAAQ3/B,GACN,OAAOpB,KAAKunB,KAAmB,iBAAPnmB,EAAkBA,EAAMA,EAAIA,MAMtD,EAAI4/B,UAAA,eACF,IAAKlD,IAAImD,KAAKjhC,KAAKunB,KAAM,OAAO,EAChC,OAAO,G,YAMT2Z,eAAA,WAEE,OADAlhC,KAAK0+B,SAjMkD,EAkMhD1+B,MAGT,EAAImhC,iBAAA,eACF,OAtMuD,EAsM/CnhC,KAAK0+B,SAA4B,G,yCAnLrB,CAAS,KClBjC,SAASx+B,EAAKmE,EAAGtE,GACf,OAAQA,GAASsE,EAAQA,EAAEnE,KAAKH,GAAXsE,EAGvB,IAAM+8B,EACJ,SAAY3hC,EAAM4hC,EAAMthC,GACtBC,KAAKP,KAAOA,EACZO,KAAKk5B,KAAOh5B,EAAKmhC,EAAKnI,KAAMn5B,GAC5BC,KAAK2M,MAAQzM,EAAKmhC,EAAK10B,MAAO5M,IAI5BuhC,EAAa,CACjB,IAAIF,EAAU,MAAO,CACnBlI,KAAA,SAAK3Z,GAAU,OAAOA,EAAO6e,KAAO7e,EAAOkhB,OAAOc,YAAYC,iBAC9D70B,MAAA,SAAM80B,GAAM,OAAOA,EAAGrD,OAGxB,IAAIgD,EAAU,YAAa,CACzBlI,KAAA,SAAK3Z,EAAQwU,GAAY,OAAOxU,EAAOgf,WAAaqC,EAAUc,QAAQ3N,EAASqK,MAC/EzxB,MAAA,SAAM80B,GAAM,OAAOA,EAAGlD,aAGxB,IAAI6C,EAAU,cAAe,CAC3BlI,KAAA,SAAK3Z,GAAU,OAAOA,EAAOkf,aAAe,MAC5C9xB,MAAA,SAAM80B,EAAIE,EAAQC,EAAMp7B,GAAS,OAAOA,EAAM+3B,UAAUsD,QAAUJ,EAAGhD,YAAc,QAGrF,IAAI2C,EAAU,oBAAqB,CACjClI,KAAA,WAAS,OAAO,GAChBvsB,MAAA,SAAM80B,EAAIxG,GAAQ,OAAOwG,EAAGN,iBAAmBlG,EAAO,EAAIA,MAMxD6G,EACJ,SAAYrB,EAAQsB,G,WAClB/hC,KAAKygC,OAASA,EACdzgC,KAAKgiC,OAASV,EAAWz2B,SACzB7K,KAAK+hC,QAAU,GACf/hC,KAAKiiC,aAAe7hC,OAAOkO,OAAO,MAC9ByzB,GAASA,EAAQjhC,SAAO,SAACohC,GAC7B,GAAMliC,EAAKiiC,aAAaC,EAAO9gC,KAC3B,MAAM,IAAI09B,WAAW,iDAAmDoD,EAAO9gC,IAAM,KACvFpB,EAAK+hC,QAAQ5sB,KAAK+sB,GACpB,EAAOD,aAAaC,EAAO9gC,KAAO8gC,EAC5BA,EAAOC,KAAK37B,OACdxG,EAAKgiC,OAAO7sB,KAAK,IAAIisB,EAAUc,EAAO9gC,IAAK8gC,EAAOC,KAAK37B,MAAO07B,QAYzDE,EACX,SAAY7iB,GACVvf,KAAKuf,OAASA,G,wEACf,IAcH8iB,EAAM5B,OAAA,eACF,OAAOzgC,KAAKuf,OAAOkhB,QAKvB4B,EAAMN,QAAA,eACF,OAAO/hC,KAAKuf,OAAOwiB,SAKvB,YAAEp1B,MAAA,SAAM80B,GACJ,OAAOzhC,KAAKsiC,iBAAiBb,GAAIj7B,OAIrC,YAAE+7B,kBAAA,SAAkBd,EAAIe,Q,WAAU,GAC9B,IAAK1E,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKuf,OAAOwiB,QAAQ5gC,OAAQF,IAAK,GAAIA,GAAKuhC,EAAQ,CACtE,IAAMN,EAASliC,KAAKuf,OAAOwiB,QAAQ9gC,GACnC,GAAMihC,EAAOC,KAAKI,oBAAsBL,EAAOC,KAAKI,kBAAkB/hC,KAAK0hC,EAAQT,EAAIzhC,MACnF,OAAO,EAEX,OAAO,GASX,YAAEsiC,iBAAA,SAAiBG,GACf,IAAKziC,KAAKuiC,kBAAkBE,GAAS,MAAO,CAACj8B,MAAOxG,KAAM0iC,aAAc,IAMjE,IAJP5E,IAAI6E,EAAM,CAACF,GAASG,EAAW5iC,KAAK6iC,WAAWJ,GAASK,EAAO,OAI/C,CAEd,IADAhF,IAAIiF,GAAU,EACL9hC,EAAI,EAAGA,EAAIjB,KAAKuf,OAAOwiB,QAAQ5gC,OAAQF,IAAK,CACrD,IAAMihC,EAASliC,KAAKuf,OAAOwiB,QAAQ9gC,GACjC,GAAIihC,EAAOC,KAAKa,kBAAmB,CACnC,IAAMnqB,EAAIiqB,EAAOA,EAAK7hC,GAAG4X,EAAI,EAAGoqB,EAAWH,EAAOA,EAAK7hC,GAAGuF,MAAQxG,KAC5DyhC,EAAK5oB,EAAI8pB,EAAIxhC,QACf,EAASghC,KAAKa,kBAAkBxiC,KAAK0hC,EAAQrpB,EAAI8pB,EAAI5/B,MAAM8V,GAAK8pB,EAAKM,EAAUL,GACnF,GAAMnB,GAAMmB,EAASL,kBAAkBd,EAAIxgC,GAAI,CAE7C,GADEwgC,EAAGX,QAAQ,sBAAuB2B,IAC7BK,EAAM,CACX,EAAS,GACP,IAAKhF,IAAIxR,EAAI,EAAGA,EAAItsB,KAAKuf,OAAOwiB,QAAQ5gC,OAAQmrB,IAC9CwW,EAAK3tB,KAAKmX,EAAIrrB,EAAI,CAACuF,MAAOo8B,EAAU/pB,EAAG8pB,EAAIxhC,QAAU,CAACqF,MAAOxG,KAAM6Y,EAAG,IAE1E8pB,EAAIxtB,KAAKssB,GACTmB,EAAWA,EAASC,WAAWpB,GACjC,GAAY,EAERqB,IAAMA,EAAK7hC,GAAK,CAACuF,MAAOo8B,EAAU/pB,EAAG8pB,EAAIxhC,UAGjD,IAAK4hC,EAAS,MAAO,CAACv8B,MAAOo8B,EAAUF,aAAcC,KAK3D,YAAEE,WAAA,SAAWpB,GACT,IAAKA,EAAGyB,OAAOC,GAAGnjC,KAAKo+B,KAAM,MAAM,IAAIU,WAAW,qCAElD,IADAhB,IAAIsF,EAAc,IAAIhB,EAAYpiC,KAAKuf,QAASyiB,EAAShiC,KAAKuf,OAAOyiB,OAC5D/gC,EAAI,EAAGA,EAAI+gC,EAAO7gC,OAAQF,IAAK,CACtC68B,IAAIuF,EAAQrB,EAAO/gC,GACrB,EAAcoiC,EAAM5jC,MAAQ4jC,EAAM12B,MAAM80B,EAAIzhC,KAAKqjC,EAAM5jC,MAAOO,KAAMojC,GAEpE,IAAKtF,IAAI78B,EAAI,EAAGA,EAAIqiC,EAAeniC,OAAQF,IAAKqiC,EAAeriC,GAAGjB,KAAMyhC,EAAI2B,GAC5E,OAAOA,GAKXf,EAAMZ,GAAA,eAAO,OAAO,IAAItD,EAAYn+B,OAqBlC,EAAOsO,OAAA,SAAOiR,GAGZ,IAFA,IAAIgkB,EAAU,IAAIzB,EAAcviB,EAAOkhB,QAAUlhB,EAAO6e,IAAIr2B,KAAK04B,OAAQlhB,EAAOwiB,SAC5EhO,EAAW,IAAIqO,EAAYmB,GACtBtiC,EAAI,EAAGA,EAAIsiC,EAAQvB,OAAO7gC,OAAQF,IACzC8yB,EAASwP,EAAQvB,OAAO/gC,GAAGxB,MAAQ8jC,EAAQvB,OAAO/gC,GAAGi4B,KAAK3Z,EAAQwU,GACpE,OAAOA,GAkBX,YAAEyP,YAAA,SAAYjkB,GAGV,IAFAue,IAAIyF,EAAU,IAAIzB,EAAcviB,EAAOkhB,QAAUzgC,KAAKygC,OAAQlhB,EAAOwiB,SACjEC,EAASuB,EAAQvB,OAAQjO,EAAW,IAAIqO,EAAYmB,GAC/CtiC,EAAI,EAAGA,EAAI+gC,EAAO7gC,OAAQF,IAAK,CACxC,IAAMxB,EAAOuiC,EAAO/gC,GAAGxB,KACvB,EAAWA,GAAQO,KAAKqB,eAAe5B,GAAQO,KAAKP,GAAQuiC,EAAO/gC,GAAGi4B,KAAK3Z,EAAQwU,GAEnF,OAAOA,GASX,YAAE0B,OAAA,SAAOgO,GACL,IAAI5gC,EAAS,CAACu7B,IAAKp+B,KAAKo+B,IAAI3I,SAAU8I,UAAWv+B,KAAKu+B,UAAU9I,UAEhE,GADIz1B,KAAKy+B,cAAa57B,EAAO47B,YAAcz+B,KAAKy+B,YAAY1kB,KAAG,SAACyL,GAAE,OAAGA,EAAEiQ,aACnEgO,GAAuC,UAAvB,EAAOA,GAA0B,IAAK3F,IAAIjb,KAAQ4gB,EAAc,CAClF,GAAY,OAAR5gB,GAAyB,aAARA,EACnB,MAAM,IAAIic,WAAW,sDACvBhB,IAAIoE,EAASuB,EAAa5gB,GAAOrc,EAAQ07B,EAAOC,KAAK37B,MACjDA,GAASA,EAAMivB,SAAQ5yB,EAAOggB,GAAQrc,EAAMivB,OAAOj1B,KAAK0hC,EAAQliC,KAAKkiC,EAAO9gC,OAElF,OAAOyB,GAiBX,EAAS6gC,SAAA,SAASnkB,EAAQokB,EAAMF,GAC5B,IAAKE,EAAM,MAAM,IAAI7E,WAAW,0CAChC,IAAKvf,EAAOkhB,OAAQ,MAAM,IAAI3B,WAAW,0CACzChB,IAAIyF,EAAU,IAAIzB,EAAcviB,EAAOkhB,OAAQlhB,EAAOwiB,SAClDhO,EAAW,IAAIqO,EAAYmB,GAqB/B,OApBAA,EAAQvB,OAAOlhC,SAAO,SAACuiC,GACrB,GAAkB,OAAdA,EAAM5jC,KACRs0B,EAASqK,IAAM,OAAKsF,SAASnkB,EAAOkhB,OAAQkD,EAAKvF,UAC5C,GAAkB,aAAdiF,EAAM5jC,KACfs0B,EAASwK,UAAYqC,EAAU8C,SAAS3P,EAASqK,IAAKuF,EAAKpF,gBACtD,GAAkB,eAAd8E,EAAM5jC,KACXkkC,EAAKlF,cAAa1K,EAAS0K,YAAckF,EAAKlF,YAAY1kB,IAAIwF,EAAOkhB,OAAOmD,mBAC3E,CACP,GAAMH,EAAc,IAAK3F,IAAIjb,KAAQ4gB,EAAc,CAC/C3F,IAAIoE,EAASuB,EAAa5gB,GAAOrc,EAAQ07B,EAAOC,KAAK37B,MACrD,GAAI07B,EAAO9gC,KAAOiiC,EAAM5jC,MAAQ+G,GAASA,EAAMk9B,UAC3CtjC,OAAOC,UAAUgB,eAAeb,KAAKmjC,EAAM9gB,GAG7C,YADF,EAAWwgB,EAAM5jC,MAAQ+G,EAAMk9B,SAASljC,KAAK0hC,EAAQ3iB,EAAQokB,EAAK9gB,GAAOkR,IAI3EA,EAASsP,EAAM5jC,MAAQ4jC,EAAMnK,KAAK3Z,EAAQwU,OAGvCA,GAST,EAAO8P,iBAAA,SAAiBx/B,GACtBi/B,EAAenuB,KAAK9Q,IAEtB,EAAOy/B,oBAAA,SAAoBz/B,GACzB,IAAI0/B,EAAQT,EAAenwB,QAAQ9O,GAC/B0/B,GAAS,GAAGT,EAAeU,OAAOD,EAAO,I,oCAEhD,GAED9F,IAAMqF,EAAiB,GCnOvB,IAAaxa,EAGX,SAAYqZ,GAGVniC,KAAKikC,MAAQ,GACT9B,EAAK8B,OApBb,SAASC,EAAUnjC,EAAKhB,EAAMsF,GAC5B,IAAKy4B,IAAIjb,KAAQ9hB,EAAK,CACpB+8B,IAAIv9B,EAAMQ,EAAI8hB,GACVtiB,aAAeN,SAAUM,EAAMA,EAAIL,KAAKH,GAC3B,mBAAR8iB,IAA2BtiB,EAAM2jC,EAAU3jC,EAAKR,EAAM,KAC/DsF,EAAOwd,GAAQtiB,EAEjB,OAAO8E,EAaW6+B,CAAU/B,EAAK8B,MAAOjkC,KAAMA,KAAKikC,OAGjDjkC,KAAKmiC,KAAOA,EACZniC,KAAKoB,IAAM+gC,EAAK/gC,IAAM+gC,EAAK/gC,IAAIA,IAAM+iC,EAAU,WAKnD,YAAEC,SAAA,SAAS59B,GAAS,OAAOA,EAAMxG,KAAKoB,MA6BtC68B,IAAM3uB,EAAOlP,OAAOkO,OAAO,MAE3B,SAAS61B,EAAU1kC,GACjB,OAAIA,KAAQ6P,EAAa7P,EAAO,OAAQ6P,EAAK7P,IAC7C6P,EAAK7P,GAAQ,EACNA,EAAO,KAOhB,IAAa4kC,EAGX,SAAY5kC,Q,UAAO,OAASO,KAAKoB,IAAM+iC,EAAU1kC,IAKnD,YAAEsE,IAAA,SAAIyC,GAAS,OAAOA,EAAM+Y,OAAO0iB,aAAajiC,KAAKoB,MAIrD,YAAEgjC,SAAA,SAAS59B,GAAS,OAAOA,EAAMxG,KAAKoB,O,6BClItC,SAASkjC,EAAW7gC,GAClBzD,KAAKyD,QAAUA,E,miBAGjB6gC,EAAWjkC,UAAY,CACrBmB,YAAa8iC,EAEbnqB,KAAM,SAAS/Y,GACb,IAAK,IAAIH,EAAI,EAAGA,EAAIjB,KAAKyD,QAAQtC,OAAQF,GAAK,EAC5C,GAAIjB,KAAKyD,QAAQxC,KAAOG,EAAK,OAAOH,EACtC,OAAQ,GAMV8C,IAAK,SAAS3C,GACZ,IAAI2iC,EAAQ/jC,KAAKma,KAAK/Y,GACtB,OAAiB,GAAV2iC,OAAch+B,EAAY/F,KAAKyD,QAAQsgC,EAAQ,IAOxDrX,OAAQ,SAAStrB,EAAKqD,EAAO8/B,GAC3B,IAAIxkC,EAAOwkC,GAAUA,GAAUnjC,EAAMpB,KAAK2sB,OAAO4X,GAAUvkC,KACvD+jC,EAAQhkC,EAAKoa,KAAK/Y,GAAMqC,EAAU1D,EAAK0D,QAAQV,QAOnD,OANc,GAAVghC,EACFtgC,EAAQ0R,KAAKovB,GAAUnjC,EAAKqD,IAE5BhB,EAAQsgC,EAAQ,GAAKt/B,EACjB8/B,IAAQ9gC,EAAQsgC,GAASQ,IAExB,IAAID,EAAW7gC,IAKxBkpB,OAAQ,SAASvrB,GACf,IAAI2iC,EAAQ/jC,KAAKma,KAAK/Y,GACtB,IAAc,GAAV2iC,EAAa,OAAO/jC,KACxB,IAAIyD,EAAUzD,KAAKyD,QAAQV,QAE3B,OADAU,EAAQugC,OAAOD,EAAO,GACf,IAAIO,EAAW7gC,IAKxB+gC,WAAY,SAASpjC,EAAKqD,GACxB,OAAO,IAAI6/B,EAAW,CAACljC,EAAKqD,GAAOoG,OAAO7K,KAAK2sB,OAAOvrB,GAAKqC,WAK7DghC,SAAU,SAASrjC,EAAKqD,GACtB,IAAIhB,EAAUzD,KAAK2sB,OAAOvrB,GAAKqC,QAAQV,QAEvC,OADAU,EAAQ0R,KAAK/T,EAAKqD,GACX,IAAI6/B,EAAW7gC,IAMxBihC,UAAW,SAASC,EAAOvjC,EAAKqD,GAC9B,IAAImgC,EAAU5kC,KAAK2sB,OAAOvrB,GAAMqC,EAAUmhC,EAAQnhC,QAAQV,QACtDghC,EAAQa,EAAQzqB,KAAKwqB,GAEzB,OADAlhC,EAAQugC,QAAiB,GAAVD,EAActgC,EAAQtC,OAAS4iC,EAAO,EAAG3iC,EAAKqD,GACtD,IAAI6/B,EAAW7gC,IAMxB3C,QAAS,SAASuD,GAChB,IAAK,IAAIpD,EAAI,EAAGA,EAAIjB,KAAKyD,QAAQtC,OAAQF,GAAK,EAC5CoD,EAAErE,KAAKyD,QAAQxC,GAAIjB,KAAKyD,QAAQxC,EAAI,KAMxC4jC,QAAS,SAAS9qB,GAEhB,OADAA,EAAMuqB,EAAW/R,KAAKxY,IACbqC,KACF,IAAIkoB,EAAWvqB,EAAItW,QAAQoH,OAAO7K,KAAK8kC,SAAS/qB,GAAKtW,UADtCzD,MAOxB+kC,OAAQ,SAAShrB,GAEf,OADAA,EAAMuqB,EAAW/R,KAAKxY,IACbqC,KACF,IAAIkoB,EAAWtkC,KAAK8kC,SAAS/qB,GAAKtW,QAAQoH,OAAOkP,EAAItW,UADtCzD,MAOxB8kC,SAAU,SAAS/qB,GACjB,IAAIlX,EAAS7C,KACb+Z,EAAMuqB,EAAW/R,KAAKxY,GACtB,IAAK,IAAI9Y,EAAI,EAAGA,EAAI8Y,EAAItW,QAAQtC,OAAQF,GAAK,EAC3C4B,EAASA,EAAO8pB,OAAO5S,EAAItW,QAAQxC,IACrC,OAAO4B,GAKT,WACE,OAAO7C,KAAKyD,QAAQtC,QAAU,IAQlCmjC,EAAW/R,KAAO,SAAS9tB,GACzB,GAAIA,aAAiB6/B,EAAY,OAAO7/B,EACxC,IAAIhB,EAAU,GACd,GAAIgB,EAAO,IAAK,IAAIoe,KAAQpe,EAAOhB,EAAQ0R,KAAK0N,EAAMpe,EAAMoe,IAC5D,OAAO,IAAIyhB,EAAW7gC,IAGxB,IAEeuhC,EAFEV,E,yOCzHJW,EACX,SAAYxhC,EAAS2Y,GAMnB,GALApc,KAAKyD,QAAUA,EAIfzD,KAAKoc,KAAOA,GAAQ,EACR,MAARA,EAAc,IAAK0hB,IAAI78B,EAAI,EAAGA,EAAIwC,EAAQtC,OAAQF,IACpDjB,KAAKoc,MAAQ3Y,EAAQxC,GAAGikC,U,sFAC3B,I,YAMDC,aAAA,SAAa5S,EAAMiO,EAAIn8B,EAAG+gC,EAAep7B,Q,UAAH,GACpC,IAAK8zB,IAAI78B,EAAI,EAAG8a,EAAM,EAAGA,EAAMykB,EAAIv/B,IAAK,CACtC68B,IAAIuH,EAAQrlC,KAAKyD,QAAQxC,GAAIqkC,EAAMvpB,EAAMspB,EAAMH,SAC/C,GAAII,EAAM/S,IAAiD,IAAzCluB,EAAEghC,EAAOD,EAAYrpB,EAAK/R,EAAQ/I,IAAgBokC,EAAM5hC,QAAQ2Y,KAAM,CACtF0hB,IAAIyH,EAAQxpB,EAAM,EAClBspB,EAAMF,aAAavlC,KAAKsvB,IAAI,EAAGqD,EAAOgT,GACnB3lC,KAAKiJ,IAAIw8B,EAAM5hC,QAAQ2Y,KAAMokB,EAAK+E,GAClClhC,EAAG+gC,EAAYG,GAEpCxpB,EAAMupB,I,YAOVE,YAAA,SAAYnhC,GACVrE,KAAKmlC,aAAa,EAAGnlC,KAAKoc,KAAM/X,I,YAIlCohC,YAAA,SAAYlT,EAAMiO,EAAIkF,EAAgBC,GACpC7H,IAAIyC,EAAO,GAAIqF,GAAY,EAa3B,OAZA5lC,KAAKmlC,aAAa5S,EAAMiO,GAAE,SAAGT,EAAMhkB,GAC7BgkB,EAAK8F,QACPtF,GAAQR,EAAKQ,KAAKx9B,MAAMnD,KAAKsvB,IAAIqD,EAAMxW,GAAOA,EAAKykB,EAAKzkB,GACxD6pB,GAAaF,GACJ3F,EAAK+F,QAAUH,GACxBpF,GAAQoF,EACRC,GAAaF,IACHE,GAAa7F,EAAKgG,UAC5BxF,GAAQmF,EACRE,GAAY,KAEb,GACIrF,G,YAMTwE,OAAA,SAAO5e,GACL,IAAKA,EAAM/J,KAAM,OAAOpc,KACxB,IAAKA,KAAKoc,KAAM,OAAO+J,EACvB2X,IAAInD,EAAO36B,KAAKgmC,UAAWhqB,EAAQmK,EAAM0H,WAAYpqB,EAAUzD,KAAKyD,QAAQV,QAAS9B,EAAI,EAKzF,IAJI05B,EAAKkL,QAAUlL,EAAKsL,WAAWjqB,KACjCvY,EAAQA,EAAQtC,OAAS,GAAKw5B,EAAKuL,SAASvL,EAAK4F,KAAOvkB,EAAMukB,MAC9Dt/B,EAAI,GAECA,EAAIklB,EAAM1iB,QAAQtC,OAAQF,IAAKwC,EAAQ0R,KAAKgR,EAAM1iB,QAAQxC,IACjE,OAAO,IAAIgkC,EAASxhC,EAASzD,KAAKoc,KAAO+J,EAAM/J,O,YAKjD+pB,IAAA,SAAI5T,EAAMiO,GAER,GADU,MAANA,IAAYA,EAAKxgC,KAAKoc,MACd,GAARmW,GAAaiO,GAAMxgC,KAAKoc,KAAM,OAAOpc,KACzC89B,IAAIj7B,EAAS,GAAIuZ,EAAO,EACxB,GAAIokB,EAAKjO,EAAM,IAAKuL,IAAI78B,EAAI,EAAG8a,EAAM,EAAGA,EAAMykB,EAAIv/B,IAAK,CACrD68B,IAAIuH,EAAQrlC,KAAKyD,QAAQxC,GAAIqkC,EAAMvpB,EAAMspB,EAAMH,SAC3CI,EAAM/S,KACJxW,EAAMwW,GAAQ+S,EAAM9E,KAEpB6E,EADEA,EAAMQ,OACAR,EAAMc,IAAIvmC,KAAKsvB,IAAI,EAAGqD,EAAOxW,GAAMnc,KAAKiJ,IAAIw8B,EAAM9E,KAAKp/B,OAAQq/B,EAAKzkB,IAEpEspB,EAAMc,IAAIvmC,KAAKsvB,IAAI,EAAGqD,EAAOxW,EAAM,GAAInc,KAAKiJ,IAAIw8B,EAAM5hC,QAAQ2Y,KAAMokB,EAAKzkB,EAAM,KAE3FlZ,EAAOsS,KAAKkwB,GACZjpB,GAAQipB,EAAMH,UAEhBnpB,EAAMupB,EAER,OAAO,IAAIL,EAASpiC,EAAQuZ,I,YAG9BgqB,WAAA,SAAW7T,EAAMiO,GACf,OAAIjO,GAAQiO,EAAWyE,EAAShF,MACpB,GAAR1N,GAAaiO,GAAMxgC,KAAKyD,QAAQtC,OAAenB,KAC5C,IAAIilC,EAASjlC,KAAKyD,QAAQV,MAAMwvB,EAAMiO,K,YAM/C6F,aAAA,SAAahzB,EAAO0sB,GAClBjC,IAAIwI,EAAUtmC,KAAKyD,QAAQ4P,GAC3B,GAAIizB,GAAWvG,EAAM,OAAO//B,KAC5B89B,IAAIyI,EAAOvmC,KAAKyD,QAAQV,QACpBqZ,EAAOpc,KAAKoc,KAAO2jB,EAAKmF,SAAWoB,EAAQpB,SAE/C,OADAqB,EAAKlzB,GAAS0sB,EACP,IAAIkF,EAASsB,EAAMnqB,I,YAM5BooB,WAAA,SAAWzE,GACT,OAAO,IAAIkF,EAAS,CAAClF,GAAMl1B,OAAO7K,KAAKyD,SAAUzD,KAAKoc,KAAO2jB,EAAKmF,W,YAMpET,SAAA,SAAS1E,GACP,OAAO,IAAIkF,EAASjlC,KAAKyD,QAAQoH,OAAOk1B,GAAO//B,KAAKoc,KAAO2jB,EAAKmF,W,YAKlE/B,GAAA,SAAGhd,GACD,GAAInmB,KAAKyD,QAAQtC,QAAUglB,EAAM1iB,QAAQtC,OAAQ,OAAO,EACxD,IAAK28B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKyD,QAAQtC,OAAQF,IACvC,IAAKjB,KAAKyD,QAAQxC,GAAGkiC,GAAGhd,EAAM1iB,QAAQxC,IAAK,OAAO,EACpD,OAAO,GAKT,EAAI4sB,WAAA,eAAe,OAAO7tB,KAAKyD,QAAQtC,OAASnB,KAAKyD,QAAQ,GAAK,MAIlE,EAAIuiC,UAAA,eAAc,OAAOhmC,KAAKyD,QAAQtC,OAASnB,KAAKyD,QAAQzD,KAAKyD,QAAQtC,OAAS,GAAK,MAIvF,EAAIqlC,WAAA,eAAe,OAAOxmC,KAAKyD,QAAQtC,Q,YAKvCkkC,MAAA,SAAMhyB,GACJyqB,IAAIiG,EAAQ/jC,KAAKyD,QAAQ4P,GACzB,IAAK0wB,EAAO,MAAM,IAAIjF,WAAW,SAAWzrB,EAAQ,qBAAuBrT,MAC3E,OAAO+jC,G,YAKT0C,WAAA,SAAWpzB,GACT,OAAOrT,KAAKyD,QAAQ4P,I,YAMtBvS,QAAA,SAAQuD,GACN,IAAKy5B,IAAI78B,EAAI,EAAGktB,EAAI,EAAGltB,EAAIjB,KAAKyD,QAAQtC,OAAQF,IAAK,CACnD68B,IAAIuH,EAAQrlC,KAAKyD,QAAQxC,GACzBoD,EAAEghC,EAAOlX,EAAGltB,GACZktB,GAAKkX,EAAMH,W,YAOfwB,cAAA,SAAcvgB,EAAOpK,GACnB,Y,UADyB,GCpLtB,SAAS2qB,EAAcxjC,EAAGC,EAAG4Y,GAClC,IAAK+hB,IAAI78B,EAAI,GAAIA,IAAK,CACpB,GAAIA,GAAKiC,EAAEsjC,YAAcvlC,GAAKkC,EAAEqjC,WAC9B,OAAOtjC,EAAEsjC,YAAcrjC,EAAEqjC,WAAa,KAAOzqB,EAE/C+hB,IAAI6I,EAASzjC,EAAEmiC,MAAMpkC,GAAI2lC,EAASzjC,EAAEkiC,MAAMpkC,GAC1C,GAAI0lC,GAAUC,EAAd,CAEA,IAAKD,EAAOV,WAAWW,GAAS,OAAO7qB,EAEvC,GAAI4qB,EAAOd,QAAUc,EAAOpG,MAAQqG,EAAOrG,KAAM,CAC/C,IAAKzC,IAAIxR,EAAI,EAAGqa,EAAOpG,KAAKjU,IAAMsa,EAAOrG,KAAKjU,GAAIA,IAChDvQ,IACF,OAAOA,EAET,GAAI4qB,EAAOljC,QAAQ2Y,MAAQwqB,EAAOnjC,QAAQ2Y,KAAM,CAC9C0hB,IAAI+I,EAAQH,EAAcC,EAAOljC,QAASmjC,EAAOnjC,QAASsY,EAAM,GAChE,GAAa,MAAT8qB,EAAe,OAAOA,EAE5B9qB,GAAO4qB,EAAOzB,cAbUnpB,GAAO4qB,EAAOzB,UD+K/BwB,CAAc1mC,KAAMmmB,EAAOpK,I,YAQpC+qB,YAAA,SAAY3gB,EAAOpK,EAAiBgrB,GAClC,Y,UADuB/mC,KAAKoc,W,UAAiB+J,EAAM/J,MCtKhD,SAAS0qB,EAAY5jC,EAAGC,EAAG6jC,EAAMC,GACtC,IAAKnJ,IAAIoJ,EAAKhkC,EAAEsjC,WAAYW,EAAKhkC,EAAEqjC,aAAc,CAC/C,GAAU,GAANU,GAAiB,GAANC,EACb,OAAOD,GAAMC,EAAK,KAAO,CAACjkC,EAAG8jC,EAAM7jC,EAAG8jC,GAExCnJ,IAAI6I,EAASzjC,EAAEmiC,QAAQ6B,GAAKN,EAASzjC,EAAEkiC,QAAQ8B,GAAK/qB,EAAOuqB,EAAOzB,SAClE,GAAIyB,GAAUC,EAAd,CAKA,IAAKD,EAAOV,WAAWW,GAAS,MAAO,CAAC1jC,EAAG8jC,EAAM7jC,EAAG8jC,GAEpD,GAAIN,EAAOd,QAAUc,EAAOpG,MAAQqG,EAAOrG,KAAM,CAE/C,IADAzC,IAAIsJ,EAAO,EAAGC,EAAUznC,KAAKiJ,IAAI89B,EAAOpG,KAAKp/B,OAAQylC,EAAOrG,KAAKp/B,QAC1DimC,EAAOC,GAAWV,EAAOpG,KAAKoG,EAAOpG,KAAKp/B,OAASimC,EAAO,IAAMR,EAAOrG,KAAKqG,EAAOrG,KAAKp/B,OAASimC,EAAO,IAC7GA,IAAQJ,IAAQC,IAElB,MAAO,CAAC/jC,EAAG8jC,EAAM7jC,EAAG8jC,GAEtB,GAAIN,EAAOljC,QAAQ2Y,MAAQwqB,EAAOnjC,QAAQ2Y,KAAM,CAC9C0hB,IAAI+I,EAAQC,EAAYH,EAAOljC,QAASmjC,EAAOnjC,QAASujC,EAAO,EAAGC,EAAO,GACzE,GAAIJ,EAAO,OAAOA,EAEpBG,GAAQ5qB,EAAM6qB,GAAQ7qB,OAjBpB4qB,GAAQ5qB,EAAM6qB,GAAQ7qB,GDgKjB0qB,CAAY9mC,KAAMmmB,EAAOpK,EAAKgrB,I,YAOvC3sB,UAAA,SAAU2B,EAAKurB,GACb,Q,WADsB,GACX,GAAPvrB,EAAU,OAAOwrB,EAAS,EAAGxrB,GACjC,GAAIA,GAAO/b,KAAKoc,KAAM,OAAOmrB,EAASvnC,KAAKyD,QAAQtC,OAAQ4a,GAC3D,GAAIA,EAAM/b,KAAKoc,MAAQL,EAAM,EAAG,MAAM,IAAI+iB,WAAU,YAAa/iB,EAAG,yBAAyB/b,KAAI,KACjG,IAAK89B,IAAI78B,EAAI,EAAGumC,EAAS,GAAIvmC,IAAK,CAChC68B,IAAyBwH,EAAMkC,EAArBxnC,KAAKqlC,MAAMpkC,GAAuBikC,SAC5C,GAAII,GAAOvpB,EACT,OAAIupB,GAAOvpB,GAAOurB,EAAQ,EAAUC,EAAStmC,EAAI,EAAGqkC,GAC7CiC,EAAStmC,EAAGumC,GAErBA,EAASlC,I,YAMbnlC,SAAA,WAAa,MAAO,IAAMH,KAAKynC,gBAAkB,K,YAEjDA,cAAA,WAAkB,OAAOznC,KAAKyD,QAAQmD,KAAK,O,YAI3C6uB,OAAA,WACE,OAAOz1B,KAAKyD,QAAQtC,OAASnB,KAAKyD,QAAQsW,KAAG,SAAClB,GAAA,OAAKA,EAAE4c,YAAY,MAKnE,EAAOiO,SAAA,SAASjD,EAAQh8B,GACtB,IAAKA,EAAO,OAAOwgC,EAAShF,MAC5B,IAAK/qB,MAAM5U,QAAQmE,GAAQ,MAAM,IAAIq6B,WAAW,uCAChD,OAAO,IAAImG,EAASxgC,EAAMsV,IAAI0mB,EAAOiH,gBAMvC,EAAOC,UAAA,SAAU7yB,GACf,IAAKA,EAAM3T,OAAQ,OAAO8jC,EAAShF,MAEnC,IADAnC,IAAI8J,EAAQxrB,EAAO,EACVnb,EAAI,EAAGA,EAAI6T,EAAM3T,OAAQF,IAAK,CACrC68B,IAAIiC,EAAOjrB,EAAM7T,GACjBmb,GAAQ2jB,EAAKmF,SACTjkC,GAAK8+B,EAAK8F,QAAU/wB,EAAM7T,EAAI,GAAGglC,WAAWlG,IACzC6H,IAAQA,EAAS9yB,EAAM/R,MAAM,EAAG9B,IACrC2mC,EAAOA,EAAOzmC,OAAS,GAAK4+B,EAAKmG,SAAS0B,EAAOA,EAAOzmC,OAAS,GAAGo/B,KAAOR,EAAKQ,OACvEqH,GACTA,EAAOzyB,KAAK4qB,GAGhB,OAAO,IAAIkF,EAAS2C,GAAU9yB,EAAOsH,IAQvC,EAAOmW,KAAA,SAAKsV,GACV,IAAKA,EAAO,OAAO5C,EAAShF,MAC5B,GAAI4H,aAAiB5C,EAAU,OAAO4C,EACtC,GAAI3yB,MAAM5U,QAAQunC,GAAQ,OAAO7nC,KAAK2nC,UAAUE,GAChD,GAAIA,EAAMC,MAAO,OAAO,IAAI7C,EAAS,CAAC4C,GAAQA,EAAM3C,UACpD,MAAM,IAAIpG,WAAW,mBAAqB+I,EAAQ,kBAC5BA,EAAM1C,aAAe,mEAAqE,M,oCAEnH,GAEDlH,IAAM8F,EAAQ,CAAC1wB,MAAO,EAAG00B,OAAQ,GACjC,SAASR,EAASl0B,EAAO00B,GAGvB,OAFAhE,EAAM1wB,MAAQA,EACd0wB,EAAMgE,OAASA,EACRhE,EE7QF,SAASiE,EAAY9kC,EAAGC,GAC7B,GAAID,IAAMC,EAAG,OAAO,EACpB,IAAMD,GAAiB,UAAZ,EAAOA,KACZC,GAAiB,UAAZ,EAAOA,GAAgB,OAAO,EACzC26B,IAAIhpB,EAAQI,MAAM5U,QAAQ4C,GAC1B,GAAIgS,MAAM5U,QAAQ6C,IAAM2R,EAAO,OAAO,EACtC,GAAIA,EAAO,CACT,GAAI5R,EAAE/B,QAAUgC,EAAEhC,OAAQ,OAAO,EACjC,IAAK28B,IAAI78B,EAAI,EAAGA,EAAIiC,EAAE/B,OAAQF,IAAK,IAAK+mC,EAAY9kC,EAAEjC,GAAIkC,EAAElC,IAAK,OAAO,MACnE,CACL,IAAK68B,IAAI3P,KAAKjrB,EAAG,KAAMirB,KAAKhrB,KAAO6kC,EAAY9kC,EAAEirB,GAAIhrB,EAAEgrB,IAAK,OAAO,EACnE,IAAK2P,IAAI3P,KAAKhrB,EAAG,KAAMgrB,KAAKjrB,GAAI,OAAO,EAEzC,OAAO,EFuQT+hC,EAAShF,MAAQ,IAAIgF,EAAS,GAAI,G,IG5QrB,EACX,SAAY,EAAM,GAGhB,KAAK,KAAO,EAGV,KAAG,MAAQ,GCTV,SAAS,EAAa,GAC3BnH,IAAI,EAAM,MAAM,KAAK,KAAM,GAE3B,OADA,EAAI,UAAY,EAAa,UACtB,E,YDeP,kBAAS,GAEL,IADFA,IAAI,EAAM,GAAS,EACV78B,EAAI,EAAG,EAAI,EAAI,OAAQ,IAAK,CACnC68B,IAAI,EAAQ,EAAI,GAChB,GAAI,KAAK,GAAG,GAAQ,OAAO,EAC3B,GAAI,KAAK,KAAK,SAAS,EAAM,MACtB,IAAM,EAAO,EAAI,MAAM,EAAG,QAC1B,IAAI,EAAM,KAAK,SAAS,KAAK,MAClC,OAAO,GAEF,GAAU,EAAM,KAAK,KAAO,KAAK,KAAK,OACpC,IAAM,EAAO,EAAI,MAAM,EAAG,IAC/B,EAAK,KAAK,MACV,GAAS,GAEP,GAAM,EAAK,KAAK,IAKxB,OAFK,IAAM,EAAO,EAAI,SACjB,GAAQ,EAAK,KAAK,MAChB,G,YAMT,uBAAc,GACV,IAAGA,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,KAAK,GAAG,EAAI,IACd,OAAO,EAAI,MAAM,EAAG,GAAG,OAAO,EAAI,MAAM,EAAI,IAChD,OAAO,G,YAKT,iBAAQ,GACJ,IAAGA,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,KAAK,GAAG,EAAI,IAAK,OAAO,EAC5B,OAAK,G,YAMT,YAAG,GACC,OAAK,MAAQ,GACZ,KAAK,MAAQ,EAAM,MAAQ,EAAY,KAAK,MAAO,EAAM,Q,YAK9D,kBACEA,IAAI,EAAM,CAAC,KAAM,KAAK,KAAK,MAC3B,IAAKA,IAAI,KAAK,KAAK,MAAO,CACxB,EAAI,MAAQ,KAAK,MACjB,MAEF,OAAO,GAIT,EAAO,kBAAS,EAAQ,GACtB,IAAK,EAAM,MAAM,IAAI,WAAW,mCAChCA,IAAI,EAAO,EAAO,MAAM,EAAK,MAC7B,IAAK,EAAM,MAAM,IAAI,WAAU,yBAA0B,EAAK,KAAI,mBAClE,OAAO,EAAK,OAAO,EAAK,QAK1B,EAAO,iBAAQ,EAAG,GAChB,GAAI,GAAK,EAAG,OAAO,EACnB,GAAI,EAAE,QAAU,EAAE,OAAQ,OAAO,EACjC,IAAKA,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAC5B,IAAK,EAAE,GAAG,GAAG,EAAE,IAAK,OAAO,EAC7B,OAAO,GAMT,EAAO,iBAAQ,GACb,IAAK,GAAyB,GAAhB,EAAM,OAAa,OAAO,EAAK,KAC7C,GAAI,aAAiB,EAAM,MAAO,CAAC,GACnCA,IAAI,EAAO,EAAM,QAEjB,OADA,EAAK,MAAI,SAAE,EAAG,GAAC,OAAK,EAAE,KAAK,KAAO,EAAE,KAAK,QAClC,GAKX,EAAK,KAAO,GCvGZ,EAAa,UAAY,OAAO,OAAO,MAAM,WAC7C,EAAa,UAAU,YAAc,EACrC,EAAa,UAAU,KAAO,e,IAKjB,EAWX,SAAY,EAAS,EAAW,GAE9B,KAAK,QAAU,EAEf,KAAK,UAAY,EAEjB,KAAK,QAAU,G,uBAChB,IAmFI,SAAS,EAAQ,EAAO,EAAK,GAChC,GAAE,EAAM,UAAY,EAAM,MAC1B,MAAM,IAAI,EAAa,mDACvB,GAAE,EAAM,MAAQ,EAAM,WAAa,EAAI,MAAQ,EAAM,QACrD,MAAM,IAAI,EAAa,4BACzB,OAGF,SAAS,EAAa,EAAO,EAAK,EAAO,GACvCA,IAAI,EAAQ,EAAM,MAAM,GAAQ,EAAO,EAAM,KAAK,GAChD,GAAE,GAAS,EAAI,MAAM,IAAU,EAAQ,EAAM,MAAQ,EAAM,UAAW,CACtEA,IAAI,EAAQ,EAAa,EAAO,EAAK,EAAO,EAAQ,GACpD,OAAO,EAAK,KAAK,EAAK,QAAQ,aAAa,EAAO,IAC7C,GAAK,EAAM,QAAQ,KAEnB,IAAK,EAAM,WAAc,EAAM,SAAW,EAAM,OAAS,GAAS,EAAI,OAAS,EAG/E,CACL,IAAJ,EA8EA,SAAgC,EAAO,GAGrC,IAFEA,IAAE,EAAQ,EAAO,MAAQ,EAAM,UAC7B,EADiD,EAAO,KAAK,GAC/C,KAAK,EAAM,SACpB,EAAI,EAAQ,EAAG,GAAK,EAAG,IAC9B,EAAO,EAAO,KAAK,GAAG,KAAK,EAAS,KAAK,IACzC,MAAK,CAAC,MAAO,EAAK,eAAe,EAAM,UAAY,GAC7C,IAAK,EAAK,eAAe,EAAK,QAAQ,KAAO,EAAM,QAAU,IApFhD,CAAuB,EAAO,GAA5C,UAAO,QACR,OAAG,EAAM,EA8CjB,SAAS,EAAgB,EAAO,EAAQ,EAAM,EAAK,GACjDA,IAAI,EAAY,EAAM,MAAQ,GAAS,EAAS,EAAO,EAAQ,EAAQ,GACnE,EAAU,EAAI,MAAQ,GAAS,EAAS,EAAM,EAAK,EAAQ,GAE3D,EAAU,GACZ,EAAO,KAAM,EAAO,EAAO,GACzB,GAAa,GAAW,EAAO,MAAM,IAAU,EAAK,MAAM,IAC5D,EAAU,EAAW,GACrB,EAAQ,EAAM,EAAW,EAAgB,EAAO,EAAQ,EAAM,EAAK,EAAQ,IAAK,KAE5E,GACF,EAAQ,EAAM,EAAW,EAAc,EAAO,EAAQ,EAAQ,IAAK,GACrE,EAAS,EAAQ,EAAM,EAAO,GAC1B,GACF,EAAQ,EAAM,EAAS,EAAc,EAAM,EAAK,EAAQ,IAAK,IAG/D,OADA,EAAO,EAAK,KAAM,EAAO,GACpB,IAAI,EAAS,GA/DC,CAAgB,EAAO,EAAO,EAAK,EAAK,IAJvDA,IAAA,EAAS,EAAM,OAAQ,EAAU,EAAO,QACxC,OAAG,EAAM,EAAQ,EAAQ,IAAI,EAAG,EAAM,cAAc,OAAO,EAAM,SAAS,OAAO,EAAQ,IAAI,EAAI,gBAHjG,OAAG,EAAM,EAAM,EAAc,EAAO,EAAK,IATxC,CAAa,EAAO,EAAK,EAAO,GAmBzC,SAAS,EAAU,EAAM,GACrB,IAAG,EAAI,KAAK,kBAAkB,EAAK,MAC/B,MAAE,IAAI,EAAa,eAAiB,EAAI,KAAK,KAAO,SAAW,EAAK,KAAK,MAGjF,SAAS,EAAS,EAAS,EAAQ,GAC/BA,IAAE,EAAO,EAAQ,KAAK,GAEtB,OADA,EAAQ,EAAM,EAAO,KAAK,IACrB,EAGT,SAAS,EAAQ,EAAO,GACpBA,IAAE,EAAO,EAAO,OAAS,EACvB,GAAQ,GAAK,EAAM,QAAU,EAAM,WAAW,EAAO,IACvD,EAAO,GAAQ,EAAM,SAAS,EAAO,GAAM,KAAO,EAAM,MAExD,EAAO,KAAK,GAGhB,SAAS,EAAS,EAAQ,EAAM,EAAO,GACnCA,IAAE,GAAQ,GAAQ,GAAQ,KAAK,GAC7B,EAAa,EAAG,EAAW,EAAO,EAAK,MAAM,GAAS,EAAK,WAC3D,IACE,EAAS,EAAO,MAAM,GACtB,EAAO,MAAQ,EACjB,IACS,EAAO,aAChB,EAAQ,EAAO,UAAW,GAC1B,MAGF,IAAGA,IAAI,EAAI,EAAY,EAAI,EAAU,IAAK,EAAQ,EAAK,MAAM,GAAI,GAC/D,GAAQ,EAAK,OAAS,GAAS,EAAK,YAClC,EAAI,EAAK,WAAY,GAG7B,SAAS,EAAM,EAAM,GACnB,IAAK,EAAK,KAAK,aAAa,GAC1B,MAAM,IAAI,EAAa,4BAA8B,EAAK,KAAK,MACjE,OAAO,EAAK,KAAK,GAuBnB,SAAS,EAAc,EAAO,EAAK,GAC/BA,IAAE,EAAU,IACZ,EAAO,KAAM,EAAO,EAAO,GACzB,EAAM,MAAQ,IAEZ,EAAI,EADG,EAAS,EAAO,EAAK,EAAQ,GACpB,EAAc,EAAO,EAAK,EAAQ,IAAK,GAG3D,OADA,EAAO,EAAK,KAAM,EAAO,GACpB,IAAI,EAAS,GA7KpBuE,EAAI,oBACF,OAAO,KAAK,QAAQ,KAAO,KAAK,UAAYriC,KAAK,S,YAGnD,kBAAS,EAAK,GACZ89B,IAAI,EA4DR,SAAS,EAAW,EAAS,EAAM,EAAQ,GACzC,IAAF,EAAwB,EAAQ,UAAU,GAAnC,UAAO,WAAmC,EAAQ,EAAQ,WAAW,GACxE,GAAE,GAAU,GAAQ,EAAM,OAC1B,OAAI,IAAW,EAAO,WAAW,EAAO,EAAO,GAAgB,KACxD,EAAQ,IAAI,EAAG,GAAM,OAAO,GAAQ,OAAO,EAAQ,IAAI,IAEhEA,IAAI,EAAQ,EAAW,EAAM,QAAS,EAAO,EAAS,EAAG,GACvD,OAAK,GAAS,EAAQ,aAAa,EAAO,EAAM,KAAK,IAnEvC,CAAW,KAAK,QAAS,EAAM,KAAK,UAAW,EAAU,MACvE,OAAO,GAAW,IAAI,EAAM,EAAS,KAAK,UAAW,KAAK,U,YAG5D,uBAAc,EAAM,GAClB,OAAO,IAAI,EA4Cf,SAAS,EAAY,EAAS,EAAM,GAClC,IAAF,EAAwB,EAAQ,UAAU,GAAnC,UAAO,WAAmC,EAAQ,EAAQ,WAAW,GAC5E,EAA2C,EAAQ,UAAU,GAA/C,UAAiB,WAC3B,GAAE,GAAU,GAAQ,EAAM,OAAQ,CAClC,GAAI,GAAY,IAAO,EAAQ,MAAM,GAAS,OAAQ,MAAM,IAAI,WAAW,2BAC3E,OAAO,EAAQ,IAAI,EAAG,GAAM,OAAO,EAAQ,IAAI,IAE/C,GAAE,GAAS,EAAS,MAAM,IAAI,WAAW,2BACzC,OAAK,EAAQ,aAAa,EAAO,EAAM,KAAK,EAAY,EAAM,QAAS,EAAO,EAAS,EAAG,EAAK,EAAS,KApDvF,CAAY,KAAK,QAAS,EAAO,KAAK,UAAW,EAAK,KAAK,WAAY,KAAK,UAAW,KAAK,U,YAK/G,YAAG,GACD,OAAO,KAAK,QAAQ,GAAG,EAAM,UAAY,KAAK,WAAa,EAAM,WAAa,KAAK,SAAW,EAAM,S,YAGtG,oBACE,OAAO,KAAK,QAAU,IAAM,KAAK,UAAY,IAAM,KAAK,QAAU,K,YAKpE,kBACE,IAAK,KAAK,QAAQ,KAAM,OAAO,KAC/BA,IAAI,EAAO,CAAC,QAAS,KAAK,QAAQ,UAGlC,OAFI,KAAK,UAAY,IAAG,EAAK,UAAY,KAAK,WAC1C,KAAK,QAAU,IAAG,EAAK,QAAU,KAAK,SACnC,GAKT,EAAO,kBAAS,EAAQ,GACtB,IAAK,EAAM,OAAO,EAAM,MACxBA,IAAI,EAAY,EAAK,WAAa,EAAG,EAAU,EAAK,SAAW,EAC/D,GAAwB,iBAAb,GAA2C,iBAAX,EACzC,MAAM,IAAI,WAAW,oCACrB,OAAK,IAAI,EAAM,EAAS,SAAS,EAAQ,EAAK,SAAU,EAAW,IAMvE,EAAO,iBAAQ,EAAU,Q,WAAc,GAErC,IADAA,IAAI,EAAY,EAAG,EAAU,EACpB,EAAI,EAAS,WAAY,IAAM,EAAE,SAAW,IAAkB,EAAE,KAAK,KAAK,WAAY,EAAI,EAAE,WAAY,IAC/G,IAAGA,IAAIjlB,EAAI,EAAS,UAAWA,IAAMA,EAAE,SAAW,IAAkBA,EAAE,KAAK,KAAK,WAAYA,EAAIA,EAAE,UAAW,IAC/G,OAAO,IAAI,EAAM,EAAU,EAAW,I,oCAEzC,GAyBD,EAAM,MAAQ,IAAI,EAAM,EAAS,MAAO,EAAG,G,IC5G9BovB,EACX,SAAYlsB,EAAKlQ,EAAMq8B,GAErBloC,KAAK+b,IAAMA,EACX/b,KAAK6L,KAAOA,EAKZ7L,KAAKmoC,MAAQt8B,EAAK1K,OAAS,EAAI,EAE/BnB,KAAKkoC,aAAeA,G,qIACrB,I,YAEDE,aAAA,SAAa7nC,GACX,OAAW,MAAPA,EAAoBP,KAAKmoC,MACzB5nC,EAAM,EAAUP,KAAKmoC,MAAQ5nC,EAC1BA,GAOT8hC,EAAIr4B,OAAA,eAAW,OAAOhK,KAAK+/B,KAAK//B,KAAKmoC,QAIrC9F,EAAIjE,IAAA,eAAQ,OAAOp+B,KAAK+/B,KAAK,I,YAK7BA,KAAA,SAAKoI,GAAS,OAAOnoC,KAAK6L,KAAgC,EAA3B7L,KAAKooC,aAAaD,K,YAMjD90B,MAAA,SAAM80B,GAAS,OAAOnoC,KAAK6L,KAAgC,EAA3B7L,KAAKooC,aAAaD,GAAa,I,YAK/DE,WAAA,SAAWF,GAET,OADAA,EAAQnoC,KAAKooC,aAAaD,GACnBnoC,KAAKqT,MAAM80B,IAAUA,GAASnoC,KAAKmoC,OAAUnoC,KAAKsoC,WAAiB,EAAJ,I,YAMxE/C,MAAA,SAAM4C,GAEJ,OAAgB,IADhBA,EAAQnoC,KAAKooC,aAAaD,IACN,EAAInoC,KAAK6L,KAAa,EAARs8B,EAAY,GAAK,G,YAMrD7C,IAAA,SAAI6C,GAEF,OADAA,EAAQnoC,KAAKooC,aAAaD,GACnBnoC,KAAKulC,MAAM4C,GAASnoC,KAAK+/B,KAAKoI,GAAO1kC,QAAQ2Y,M,YAOtD8mB,OAAA,SAAOiF,GAEL,KADAA,EAAQnoC,KAAKooC,aAAaD,IACd,MAAM,IAAIrJ,WAAW,kDACjC,OAAOqJ,GAASnoC,KAAKmoC,MAAQ,EAAInoC,KAAK+b,IAAM/b,KAAK6L,KAAa,EAARs8B,EAAY,I,YAMpEI,MAAA,SAAMJ,GAEJ,KADAA,EAAQnoC,KAAKooC,aAAaD,IACd,MAAM,IAAIrJ,WAAW,iDACjC,OAAOqJ,GAASnoC,KAAKmoC,MAAQ,EAAInoC,KAAK+b,IAAM/b,KAAK6L,KAAa,EAARs8B,EAAY,GAAKnoC,KAAK6L,KAAa,EAARs8B,GAAWjD,UAO9F7C,EAAIiG,WAAA,eAAe,OAAOtoC,KAAK+b,IAAM/b,KAAK6L,KAAK7L,KAAK6L,KAAK1K,OAAS,IAMlEkhC,EAAImG,UAAA,eACF1K,IAAI9zB,EAAShK,KAAKgK,OAAQqJ,EAAQrT,KAAKqT,MAAMrT,KAAKmoC,OAClD,GAAI90B,GAASrJ,EAAOw8B,WAAY,OAAO,KACvC1I,IAAI2K,EAAOzoC,KAAK+b,IAAM/b,KAAK6L,KAAK7L,KAAK6L,KAAK1K,OAAS,GAAIkkC,EAAQr7B,EAAOq7B,MAAMhyB,GAC5E,OAAOo1B,EAAOz+B,EAAOq7B,MAAMhyB,GAAO8yB,IAAIsC,GAAQpD,GAOhDhD,EAAIqG,WAAA,eACF5K,IAAIzqB,EAAQrT,KAAKqT,MAAMrT,KAAKmoC,OACxBM,EAAOzoC,KAAK+b,IAAM/b,KAAK6L,KAAK7L,KAAK6L,KAAK1K,OAAS,GACnD,OAAIsnC,EAAazoC,KAAKgK,OAAOq7B,MAAMhyB,GAAO8yB,IAAI,EAAGsC,GACjC,GAATp1B,EAAa,KAAOrT,KAAKgK,OAAOq7B,MAAMhyB,EAAQ,I,YAMvDs1B,WAAA,SAAWt1B,EAAO80B,GAChBA,EAAQnoC,KAAKooC,aAAaD,GAE1B,IADArK,IAAIiC,EAAO//B,KAAK6L,KAAa,EAARs8B,GAAYpsB,EAAe,GAATosB,EAAa,EAAInoC,KAAK6L,KAAa,EAARs8B,EAAY,GAAK,EAC1ElnC,EAAI,EAAGA,EAAIoS,EAAOpS,IAAK8a,GAAOgkB,EAAKsF,MAAMpkC,GAAGikC,SACrD,OAAOnpB,G,YAQTkjB,MAAA,WACEnB,IAAI9zB,EAAShK,KAAKgK,OAAQqJ,EAAQrT,KAAKqT,QAGvC,GAA2B,GAAvBrJ,EAAOvG,QAAQ2Y,KAAW,OAAOwsB,EAAKzI,KAG1C,GAAIngC,KAAKsoC,WAAY,OAAOt+B,EAAOq7B,MAAMhyB,GAAO4rB,MAEhDnB,IAAI+K,EAAO7+B,EAAOy8B,WAAWpzB,EAAQ,GAAI8S,EAAQnc,EAAOy8B,WAAWpzB,GAGnE,IAAKw1B,EAAM,CAAE/K,IAAIgL,EAAMD,EAAMA,EAAO1iB,EAAOA,EAAQ2iB,EAKnD,IADAhL,IAAImB,EAAQ4J,EAAK5J,MACRh+B,EAAI,EAAGA,EAAIg+B,EAAM99B,OAAQF,KACK,IAAjCg+B,EAAMh+B,GAAG8G,KAAKo6B,KAAK4G,WAAyB5iB,GAAU8Y,EAAMh+B,GAAG+nC,QAAQ7iB,EAAM8Y,SAC/EA,EAAQA,EAAMh+B,KAAKw+B,cAAcR,IAErC,OAAOA,G,YAUTiB,YAAA,SAAY+I,GACVnL,IAAIyK,EAAQvoC,KAAKgK,OAAOy8B,WAAWzmC,KAAKqT,SACxC,IAAKk1B,IAAUA,EAAMW,SAAU,OAAO,KAGtC,IADApL,IAAImB,EAAQsJ,EAAMtJ,MAAOpuB,EAAOo4B,EAAKj/B,OAAOy8B,WAAWwC,EAAK51B,SACnDpS,EAAI,EAAGA,EAAIg+B,EAAM99B,OAAQF,KACK,IAAjCg+B,EAAMh+B,GAAG8G,KAAKo6B,KAAK4G,WAAyBl4B,GAASouB,EAAMh+B,GAAG+nC,QAAQn4B,EAAKouB,SAC7EA,EAAQA,EAAMh+B,KAAKw+B,cAAcR,IACrC,OAAOA,G,YAMTkK,YAAA,SAAYptB,GACV,IAAK+hB,IAAIqK,EAAQnoC,KAAKmoC,MAAOA,EAAQ,EAAGA,IACtC,GAAInoC,KAAKulC,MAAM4C,IAAUpsB,GAAO/b,KAAKslC,IAAI6C,IAAUpsB,EAAK,OAAOosB,EACjE,OAAO,G,YAWTiB,WAAA,SAAWjjB,EAAckjB,GACvB,Q,UADiBrpC,MACbmmB,EAAMpK,IAAM/b,KAAK+b,IAAK,OAAOoK,EAAMijB,WAAWppC,MAClD,IAAK89B,IAAIwL,EAAItpC,KAAKmoC,OAASnoC,KAAKgK,OAAOu/B,eAAiBvpC,KAAK+b,KAAOoK,EAAMpK,IAAM,EAAI,GAAIutB,GAAK,EAAGA,IAC9F,GAAInjB,EAAMpK,KAAO/b,KAAKslC,IAAIgE,MAAQD,GAAQA,EAAKrpC,KAAK+/B,KAAKuJ,KACvD,OAAO,IAAIE,EAAUxpC,KAAMmmB,EAAOmjB,I,YAKxCG,WAAA,SAAWtjB,GACT,OAAOnmB,KAAK+b,IAAM/b,KAAKkoC,cAAgB/hB,EAAMpK,IAAMoK,EAAM+hB,c,YAK3DhZ,IAAA,SAAI/I,GACF,OAAOA,EAAMpK,IAAM/b,KAAK+b,IAAMoK,EAAQnmB,M,YAKxC6I,IAAA,SAAIsd,GACF,OAAOA,EAAMpK,IAAM/b,KAAK+b,IAAMoK,EAAQnmB,M,YAGxCG,SAAA,WAEE,IADA29B,IAAIx6B,EAAM,GACDrC,EAAI,EAAGA,GAAKjB,KAAKmoC,MAAOlnC,IAC/BqC,IAAQA,EAAM,IAAM,IAAMtD,KAAK+/B,KAAK9+B,GAAG8G,KAAKtI,KAAO,IAAMO,KAAKqT,MAAMpS,EAAI,GAC1E,OAAOqC,EAAM,IAAMtD,KAAKkoC,cAG1B,EAAOzoB,QAAA,SAAQ2e,EAAKriB,GAClB,KAAMA,GAAO,GAAKA,GAAOqiB,EAAI36B,QAAQ2Y,MAAO,MAAM,IAAI0iB,WAAW,YAAc/iB,EAAM,iBAGrF,IAFA+hB,IAAIjyB,EAAO,GACP05B,EAAQ,EAAG2C,EAAensB,EACrBgkB,EAAO3B,IAAO,CACvB,IAAJ,EAA4B2B,EAAKt8B,QAAQ2W,UAAU8tB,GAAxC70B,EAAA,EAAAA,MAAO00B,EAAA,EAAAA,OACR2B,EAAMxB,EAAeH,EAEzB,GADAl8B,EAAKsJ,KAAK4qB,EAAM1sB,EAAOkyB,EAAQwC,IAC1B2B,EAAK,MAEV,IADA3J,EAAOA,EAAKsF,MAAMhyB,IACTwyB,OAAQ,MACjBqC,EAAewB,EAAM,EACrBnE,GAASwC,EAAS,EAEpB,OAAO,IAAIE,EAAYlsB,EAAKlQ,EAAMq8B,IAGpC,EAAOyB,cAAA,SAAcvL,EAAKriB,GACxB,IAAK+hB,IAAI78B,EAAI,EAAGA,EAAI2oC,EAAazoC,OAAQF,IAAK,CAC5C68B,IAAI+L,EAASD,EAAa3oC,GAC1B,GAAI4oC,EAAO9tB,KAAOA,GAAO8tB,EAAOzL,KAAOA,EAAK,OAAOyL,EAErD/L,IAAIj7B,EAAS+mC,EAAaE,GAAmB7B,EAAYxoB,QAAQ2e,EAAKriB,GAEtE,OADA+tB,GAAmBA,EAAkB,GAAKC,EACnClnC,G,oCAEV,GAEDi7B,IAAI8L,EAAe,GAAIE,EAAkB,EAAGC,EAAmB,GAIlDP,EAKX,SAAYzL,EAAOC,EAAKmK,GAMtBnoC,KAAK+9B,MAAQA,EAGb/9B,KAAKg+B,IAAMA,EAEXh+B,KAAKmoC,MAAQA,G,+HACd,IAGD6B,EAAIzE,MAAA,eAAU,OAAOvlC,KAAK+9B,MAAMmF,OAAOljC,KAAKmoC,MAAQ,IAEpD6B,EAAI1E,IAAA,eAAQ,OAAOtlC,KAAKg+B,IAAIuK,MAAMvoC,KAAKmoC,MAAQ,IAG/C6B,EAAIhgC,OAAA,eAAW,OAAOhK,KAAK+9B,MAAMgC,KAAK//B,KAAKmoC,QAE3C6B,EAAIC,WAAA,eAAe,OAAOjqC,KAAK+9B,MAAM1qB,MAAMrT,KAAKmoC,QAEhD6B,EAAIE,SAAA,eAAa,OAAOlqC,KAAKg+B,IAAIqK,WAAWroC,KAAKmoC,Q,uCC3RnDlK,IAAM,EAAa,OAAO,OAAO,MAcpB,EACX,SAAY,EAAM,EAAO,EAAS,GAGhC,KAAK,KAAO,EAMZ,KAAK,MAAQ,EAIb,KAAK,QAAU,GAAW,EAAS,MAKnC,KAAK,MAAQ,GAAS,EAAK,M,6UAC5B,IAWDoE,EAAI,wBAAa,OAAO,KAAK,OAAS,EAAI,EAAI,KAAK,QAAQ,MAI3DA,EAAI,0BAAe,OAAO,KAAK,QAAQ,Y,YAKvC,eAAM,GAAS,OAAO,KAAK,QAAQ,MAAM,I,YAIzC,oBAAW,GAAS,OAAO,KAAK,QAAQ,WAAW,I,YAKnD,iBAAQ,GAAK,KAAK,QAAQ,QAAQ,I,YAUlC,sBAAa,EAAM,EAAI,EAAG,Q,UAAW,GACnC,KAAK,QAAQ,aAAa,EAAM,EAAI,EAAG,EAAU,O,YAMnD,qBAAY,GACV,KAAK,aAAa,EAAG,KAAK,QAAQ,KAAM,IAM1CA,EAAI,2BAAgB,OAAO,KAAK,YAAY,EAAG,KAAK,QAAQ,KAAM,K,YAOlE,qBAAY,EAAM,EAAI,EAAgB,GACpC,OAAO,KAAK,QAAQ,YAAY,EAAM,EAAI,EAAgB,IAM5DA,EAAI,0BAAe,OAAO,KAAK,QAAQ,YAKvCA,EAAI,yBAAc,OAAO,KAAK,QAAQ,W,YAItC,YAAG,GACD,OAAO,MAAQ,GAAU,KAAK,WAAW,IAAU,KAAK,QAAQ,GAAG,EAAM,U,YAM3E,oBAAW,GACT,OAAO,KAAK,UAAU,EAAM,KAAM,EAAM,MAAO,EAAM,Q,YAMvD,mBAAU,EAAM,EAAO,GACrB,OAAO,KAAK,MAAQ,GAClB,EAAY,KAAK,MAAO,GAAS,EAAK,cAAgB,IACtD,EAAK,QAAQ,KAAK,MAAO,GAAS,EAAK,O,YAM3C,cAAK,GACH,Y,UADa,MACT,GAAW,KAAK,QAAgB,KAC7B,IAAI,KAAK,YAAY,KAAK,KAAM,KAAK,MAAO,EAAS,KAAK,Q,YAMnE,cAAK,GACH,OAAO,GAAS,KAAK,MAAQ,KAAO,IAAI,KAAK,YAAY,KAAK,KAAM,KAAK,MAAO,KAAK,QAAS,I,YAOhG,aAAI,EAAM,GACR,OAAY,GAAR,GAAa,GAAM,KAAK,QAAQ,KAAa,KAC1C,KAAK,KAAK,KAAK,QAAQ,IAAI,EAAM,K,YAM1C,eAAM,EAAM,EAAwB,GAClC,Q,UADe,KAAK,QAAQ,W,WAAuB,GAC/C,GAAQ,EAAI,OAAO,EAAM,MAE7BvE,IAAI,EAAQ,KAAK,QAAQ,GAAO,EAAM,KAAK,QAAQ,GAC/C,EAAQ,EAAiB,EAAI,EAAM,YAAY,GAC/C,EAAQ,EAAM,MAAM,GACpB,EADmC,EAAM,KAAK,GAC/B,QAAQ,IAAI,EAAM,IAAM,EAAO,EAAI,IAAM,GAC5D,OAAO,IAAI,EAAM,EAAS,EAAM,MAAQ,EAAO,EAAI,MAAQ,I,YAU7D,iBAAQ,EAAM,EAAI,GAChB,OAAO,EAAQ,KAAK,QAAQ,GAAO,KAAK,QAAQ,GAAK,I,YAKvD,gBAAO,GACL,IAAKA,IAAI,EAAO,OAAQ,CAC5B,MAA4B,EAAK,QAAQ,UAAU,GAAxC,UAAO,WAEZ,KADA,EAAO,EAAK,WAAW,IACZ,OAAO,KAClB,GAAI,GAAU,GAAO,EAAK,OAAQ,OAAO,EACzC,GAAO,EAAS,I,YAQpB,oBAAW,GACb,MAA0B,KAAK,QAAQ,UAAU,GAAxC,UAAO,WACZ,MAAO,CAAC,KAAM,KAAK,QAAQ,WAAW,GAAM,MAAE,EAAK,OAAE,I,YAOvD,qBAAY,GACV,GAAW,GAAP,EAAU,MAAO,CAAC,KAAM,KAAM,MAAO,EAAG,OAAQ,GACxD,MAA0B,KAAK,QAAQ,UAAU,GAAxC,UAAO,WACZ,GAAI,EAAS,EAAK,MAAO,CAAC,KAAM,KAAK,QAAQ,MAAM,GAAM,MAAE,EAAK,OAAE,GAClEA,IAAI,EAAO,KAAK,QAAQ,MAAM,EAAQ,GACtC,MAAO,MAAC,EAAM,MAAO,EAAQ,EAAG,OAAQ,EAAS,EAAK,W,YAMxD,iBAAQ,GAAO,OAAO,EAAY,cAAc,KAAM,I,YAEtD,wBAAe,GAAO,OAAO,EAAY,QAAQ,KAAM,I,YAKvD,sBAAa,EAAM,EAAI,GACrBA,IAAI,GAAQ,EAKZ,OAJI,EAAK,GAAM,KAAK,aAAa,EAAM,GAAE,SAAE,GAEzC,OADI,EAAK,QAAQ,EAAK,SAAQ,GAAQ,IAC9B,KAEH,GAKTuE,EAAI,uBAAY,OAAO,KAAK,KAAK,SAKjCA,EAAI,2BAAgB,OAAO,KAAK,KAAK,aAIrCA,EAAI,6BAAkB,OAAO,KAAK,KAAK,eAKvCA,EAAI,wBAAa,OAAO,KAAK,KAAK,UAIlCA,EAAI,sBAAW,OAAO,KAAK,KAAK,QAIhCA,EAAI,sBAAW,OAAO,KAAK,KAAK,QAQhCA,EAAI,sBAAW,OAAO,KAAK,KAAK,Q,YAKhC,oBACE,GAAI,KAAK,KAAK,KAAK,cAAe,OAAO,KAAK,KAAK,KAAK,cAAc,MACtEvE,IAAI,EAAO,KAAK,KAAK,KAGrB,OAFI,KAAK,QAAQ,OACf,GAAQ,IAAM,KAAK,QAAQ,gBAAkB,KACxC,EAAU,KAAK,MAAO,I,YAK/B,wBAAe,GACbA,IAAI,EAAQ,KAAK,KAAK,aAAa,cAAc,KAAK,QAAS,EAAG,GAClE,IAAK,EAAO,MAAM,IAAI,MAAM,wDAC5B,OAAO,G,YAST,oBAAW,EAAM,EAAI,EAA8B,EAAW,Q,UAA3B,EAAS,Y,UAAe,Q,UAAS,EAAY,YAC9EA,IAAI,EAAM,KAAK,eAAe,GAAM,cAAc,EAAa,EAAO,GAClE,EAAM,GAAO,EAAI,cAAc,KAAK,QAAS,GACjD,IAAK,IAAQ,EAAI,SAAU,OAAO,EAClC,IAAKA,IAAI,EAAI,EAAO,EAAI,EAAK,IAAK,IAAK,KAAK,KAAK,YAAY,EAAY,MAAM,GAAG,OAAQ,OAAO,EACjG,OAAO,G,YAMT,wBAAe,EAAM,EAAI,EAAM,GAC7B,GAAI,IAAU,KAAK,KAAK,YAAY,GAAQ,OAAO,EACnDA,IAAI,EAAQ,KAAK,eAAe,GAAM,UAAU,GAC5C,EAAM,GAAS,EAAM,cAAc,KAAK,QAAS,GACrD,QAAO,GAAM,EAAI,U,YAQnB,mBAAU,GACR,OAAI,EAAM,QAAQ,KAAa,KAAK,WAAW,KAAK,WAAY,KAAK,WAAY,EAAM,SAC3E,KAAK,KAAK,kBAAkB,EAAM,O,YAMhD,iBACE,IAAK,KAAK,KAAK,aAAa,KAAK,SAC/B,MAAM,IAAI,WAAU,4BAA6B,KAAK,KAAK,KAAI,KAAK,KAAK,QAAQ,WAAW,MAAM,EAAG,KACvG,KAAK,QAAQ,SAAO,SAAC,UAAQ,EAAK,Y,YAKpC,kBACEA,IAAI,EAAM,CAAC,KAAM,KAAK,KAAK,MAC3B,IAAKA,IAAI,KAAK,KAAK,MAAO,CACxB,EAAI,MAAQ,KAAK,MACjB,MAMF,OAJI,KAAK,QAAQ,OACf,EAAI,QAAU,KAAK,QAAQ,UACzB,KAAK,MAAM,SACb,EAAI,MAAQ,KAAK,MAAM,KAAG,SAAC,UAAK,EAAE,aAC7B,GAKT,EAAO,kBAAS,EAAQ,GACtB,IAAK,EAAM,MAAM,IAAI,WAAW,mCAChCA,IAAI,EAAQ,KACZ,GAAI,EAAK,MAAO,CACd,IAAK,MAAM,QAAQ,EAAK,OAAQ,MAAM,IAAI,WAAW,uCACrD,EAAQ,EAAK,MAAM,IAAI,EAAO,cAEhC,GAAiB,QAAb,EAAK,KAAgB,CACvB,GAAwB,iBAAb,EAAK,KAAkB,MAAM,IAAI,WAAW,6BACvD,OAAO,EAAO,KAAK,EAAK,KAAM,GAEhCA,IAAI,EAAU,EAAS,SAAS,EAAQ,EAAK,SAC7C,OAAO,EAAO,SAAS,EAAK,MAAM,OAAO,EAAK,MAAO,EAAS,I,oCAEjE,GAEM,IAAM,EAAQ,YACnB,WAAY,EAAM,EAAO,EAAS,GAGhC,GAFAI,OAAK,KAAC,EAAM,EAAO,KAAM,IAEpB,EAAS,MAAM,IAAI,WAAW,oCAEnC,KAAK,KAAO,E,oJACb,I,OAEH,YAAE,oBACE,OAAI,KAAK,KAAK,KAAK,cAAsB,KAAK,KAAK,KAAK,cAAc,MAC/D,EAAU,KAAK,MAAO,KAAK,UAAU,KAAK,QAGnD,EAAI,2BAAgB,OAAO,KAAK,MAElC,YAAE,qBAAY,EAAM,GAAM,OAAO,KAAK,KAAK,MAAM,EAAM,IAErD,EAAI,wBAAa,OAAO,KAAK,KAAK,QAEpC,YAAE,cAAK,GACH,OAAO,GAAS,KAAK,MAAQ,KAAO,IAAI,EAAS,KAAK,KAAM,KAAK,MAAO,KAAK,KAAM,IAGvF,YAAE,kBAAS,GACP,OAAI,GAAQ,KAAK,KAAa,KACvB,IAAI,EAAS,KAAK,KAAM,KAAK,MAAO,EAAM,KAAK,QAG1D,YAAE,aAAI,EAAU,GACZ,Y,UADS,Q,UAAQ,KAAK,KAAK,QACf,GAAR,GAAa,GAAM,KAAK,KAAK,OAAe,KACzC,KAAK,SAAS,KAAK,KAAK,MAAM,EAAM,KAG/C,YAAE,YAAG,GACD,OAAO,KAAK,WAAW,IAAU,KAAK,MAAQ,EAAM,MAGxD,YAAE,kBACEJ,IAAI,EAAOI,YAAM,YAAM,MAEvB,OADA,EAAK,KAAO,KAAK,KACV,G,yCAzCU,CAAS,GA6C9B,SAAS,EAAU,EAAO,GACxB,IAAKJ,IAAI,EAAI,EAAM,OAAS,EAAG,GAAK,EAAG,IACrC,EAAM,EAAM,GAAG,KAAK,KAAO,IAAM,EAAM,IACzC,OAAO,E,ICvZIqM,EACX,SAAYC,GAGVpqC,KAAKoqC,SAAWA,EAChBpqC,KAAK6Q,KAAO,GACZ7Q,KAAKqqC,UAAY,I,0FAClB,IAED,EAAO7rB,MAAA,SAAM9G,EAAQ4yB,GACnBxM,IAAIyM,EAAS,IAAIC,EAAY9yB,EAAQ4yB,GACrC,GAAmB,MAAfC,EAAO15B,KAAc,OAAOs5B,EAAalK,MAC7CnC,IAAI2M,EAAOC,EAAUH,GACjBA,EAAO15B,MAAM05B,EAAOI,IAAI,4BAC5B7M,IAAIjrB,EA4UR,SAAa+3B,GACX9M,IAAI+M,EAAUzqC,OAAOkO,OAAO,MAC5B,OAEA,SAASw8B,EAAQC,GACfjN,IAAIkN,EAAM,GACVD,EAAOjqC,SAAO,SAACi/B,GACb6K,EAAI7K,GAAMj/B,SAAO,Y,QAAS,K,OACxB,GAAKmqC,EAAL,CACAnN,IAAIoN,EAAQF,EAAI73B,QAAQ83B,GAAOngC,EAAMogC,GAAS,GAAKF,EAAIE,EAAQ,GAC/DC,EAASP,EAAKpK,GAAI1/B,SAAO,SAACi/B,GACnBj1B,GAAKkgC,EAAI71B,KAAK81B,EAAMngC,EAAM,KACL,GAAtBA,EAAIqI,QAAQ4sB,IAAaj1B,EAAIqK,KAAK4qB,aAK5C,IADAjC,IAAIt3B,EAAQqkC,EAAQE,EAAOnkC,KAAK,MAAQ,IAAIujC,EAAaY,EAAO53B,QAAQy3B,EAAIzpC,OAAS,IAAM,GAClFF,EAAI,EAAGA,EAAI+pC,EAAI7pC,OAAQF,GAAK,EAAG,CACtC68B,IAAIiN,EAASC,EAAI/pC,EAAI,GAAGmqC,KAAKC,GAC7B7kC,EAAMqK,KAAKsE,KAAK61B,EAAI/pC,GAAI4pC,EAAQE,EAAOnkC,KAAK,OAASkkC,EAAQC,IAE/D,OAAOvkC,EAnBFskC,CAAQK,EAASP,EAAK,IA9UfU,CAyPhB,SAAab,GACX3M,IAAI8M,EAAM,CAAC,IAEX,OADAW,EAWA,SAASC,EAAQf,EAAMlY,GACrB,GAAiB,UAAbkY,EAAK1iC,KACP,OAAO0iC,EAAKgB,MAAMC,QAAM,SAAEV,EAAKP,GAAI,OAAKO,EAAIngC,OAAO2gC,EAAQf,EAAMlY,MAAQ,IACpE,GAAiB,OAAbkY,EAAK1iC,KACd,IAAK+1B,IAAI78B,EAAI,GAAIA,IAAK,CACpB68B,IAAIjtB,EAAO26B,EAAQf,EAAKgB,MAAMxqC,GAAIsxB,GAClC,GAAItxB,GAAKwpC,EAAKgB,MAAMtqC,OAAS,EAAG,OAAO0P,EACvC06B,EAAQ16B,EAAM0hB,EAAOwN,SAElB,IAAiB,QAAb0K,EAAK1iC,KAAgB,CAC9B+1B,IAAI6N,EAAO5L,IAGX,OAFA6L,EAAKrZ,EAAMoZ,GACXJ,EAAQC,EAAQf,EAAKA,KAAMkB,GAAOA,GAC3B,CAACC,EAAKD,IACR,GAAiB,QAAblB,EAAK1iC,KAAgB,CAC9B+1B,IAAI6N,EAAO5L,IAGX,OAFAwL,EAAQC,EAAQf,EAAKA,KAAMlY,GAAOoZ,GAClCJ,EAAQC,EAAQf,EAAKA,KAAMkB,GAAOA,GAC3B,CAACC,EAAKD,IACR,GAAiB,OAAblB,EAAK1iC,KACd,MAAO,CAAC6jC,EAAKrZ,IAAO1nB,OAAO2gC,EAAQf,EAAKA,KAAMlY,IACzC,GAAiB,SAAbkY,EAAK1iC,KAAiB,CAE/B,IADA+1B,IAAI+N,EAAMtZ,EACDtxB,EAAI,EAAGA,EAAIwpC,EAAK5hC,IAAK5H,IAAK,CACjC68B,IAAIjtB,EAAOkvB,IACXwL,EAAQC,EAAQf,EAAKA,KAAMoB,GAAMh7B,GACjCg7B,EAAMh7B,EAER,IAAiB,GAAb45B,EAAKvb,IACPqc,EAAQC,EAAQf,EAAKA,KAAMoB,GAAMA,QAEjC,IAAK/N,IAAI78B,EAAIwpC,EAAK5hC,IAAK5H,EAAIwpC,EAAKvb,IAAKjuB,IAAK,CACxC68B,IAAIjtB,EAAOkvB,IACX6L,EAAKC,EAAKh7B,GACV06B,EAAQC,EAAQf,EAAKA,KAAMoB,GAAMh7B,GACjCg7B,EAAMh7B,EAGV,MAAO,CAAC+6B,EAAKC,IACR,GAAiB,QAAbpB,EAAK1iC,KACd,MAAO,CAAC6jC,EAAKrZ,EAAM,KAAMkY,EAAKhmC,SAnD1B+mC,CAAQf,EAAM,GAAI1K,KACnB6K,EAEP,SAAS7K,IAAS,OAAO6K,EAAIz1B,KAAK,IAAM,EACxC,SAASy2B,EAAKrZ,EAAMiO,EAAIyK,GACtBnN,IAAI8N,EAAO,MAACX,EAAI,GAAEzK,GAElB,OADAoK,EAAIrY,GAAMpd,KAAKy2B,GACRA,EAET,SAASL,EAAQO,EAAOtL,GAAMsL,EAAMhrC,SAAO,SAAC8qC,GAAA,OAAQA,EAAKpL,GAAKA,MApQ5CoK,CAAIH,IAEpB,OAmWJ,SAA0B53B,EAAO03B,GAC/B,IAAKzM,IAAI78B,EAAI,EAAG8qC,EAAO,CAACl5B,GAAQ5R,EAAI8qC,EAAK5qC,OAAQF,IAAK,CAEpD,IADA68B,IAAIt3B,EAAQulC,EAAK9qC,GAAI+qC,GAAQxlC,EAAM4jC,SAAUvC,EAAQ,GAC5Cvb,EAAI,EAAGA,EAAI9lB,EAAMqK,KAAK1P,OAAQmrB,GAAK,EAAG,CAC7CwR,IAAIiC,EAAOv5B,EAAMqK,KAAKyb,GAAIzb,EAAOrK,EAAMqK,KAAKyb,EAAI,GAChDub,EAAM1yB,KAAK4qB,EAAKtgC,OACZusC,GAAUjM,EAAK8F,QAAU9F,EAAKkM,qBAAqBD,GAAO,IACnC,GAAvBD,EAAK54B,QAAQtC,IAAak7B,EAAK52B,KAAKtE,GAEtCm7B,GAAMzB,EAAOI,IAAI,+BAAiC9C,EAAMjhC,KAAK,MAAQ,mFA7WzEslC,CAAiBr5B,EAAO03B,GACjB13B,G,YAMTs5B,UAAA,SAAUpkC,GACR,IAAK+1B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAK6Q,KAAK1P,OAAQF,GAAK,EACzC,GAAIjB,KAAK6Q,KAAK5P,IAAM8G,EAAM,OAAO/H,KAAK6Q,KAAK5P,EAAI,GACjD,OAAO,M,YAMTmrC,cAAA,SAAcC,EAAM9G,EAAWD,Q,UAAH,Q,UAAS+G,EAAK7F,YAExC,IADA1I,IAAI+N,EAAM7rC,KACDiB,EAAIskC,EAAOsG,GAAO5qC,EAAIqkC,EAAKrkC,IAClC4qC,EAAMA,EAAIM,UAAUE,EAAKhH,MAAMpkC,GAAG8G,MACpC,OAAO8jC,GAGTxJ,EAAIkH,cAAA,eACFzL,IAAI9hB,EAAQhc,KAAK6Q,KAAK,GACtB,QAAOmL,GAAQA,EAAMktB,UAMvB7G,EAAIiK,YAAA,eACF,IAAKxO,IAAI78B,EAAI,EAAGA,EAAIjB,KAAK6Q,KAAK1P,OAAQF,GAAK,EAAG,CAC5C68B,IAAI/1B,EAAO/H,KAAK6Q,KAAK5P,GACrB,IAAM8G,EAAK89B,SAAU99B,EAAKkkC,mBAAqB,OAAOlkC,I,YAI1DwkC,WAAA,SAAWpmB,GACT,IAAK2X,IAAI78B,EAAI,EAAGA,EAAIjB,KAAK6Q,KAAK1P,OAAQF,GAAK,EACzC,IAAK68B,IAAIxR,EAAI,EAAGA,EAAInG,EAAMtV,KAAK1P,OAAQmrB,GAAK,EAC1C,GAAItsB,KAAK6Q,KAAK5P,IAAMklB,EAAMtV,KAAKyb,GAAI,OAAO,EAC9C,OAAO,G,YAUTkgB,WAAA,SAAWjE,EAAOkE,EAAexC,Q,WAAP,Q,UAAoB,GAC5CnM,IAAIgF,EAAO,CAAC9iC,MAgBZ,OAfA,SAASs3B,EAAOzkB,EAAO65B,GACrB5O,IAAI6O,EAAW95B,EAAMu5B,cAAc7D,EAAO0B,GAC1C,GAAI0C,KAAcF,GAASE,EAASvC,UAClC,OAAOnF,EAAS1S,KAAKma,EAAM3yB,KAAG,SAAC6yB,GAAA,OAAMA,EAAGpL,oBAE1C,IAAK1D,IAAI78B,EAAI,EAAGA,EAAI4R,EAAMhC,KAAK1P,OAAQF,GAAK,EAAG,CAC7C68B,IAAI/1B,EAAO8K,EAAMhC,KAAK5P,GAAI4P,EAAOgC,EAAMhC,KAAK5P,EAAI,GAChD,IAAM8G,EAAK89B,SAAU99B,EAAKkkC,qBAA8C,GAAvBnJ,EAAK3vB,QAAQtC,GAAa,CACzEiyB,EAAK3tB,KAAKtE,GACVitB,IAAIiG,EAAQzM,EAAOzmB,EAAM67B,EAAM7hC,OAAO9C,IACtC,GAAIg8B,EAAO,OAAOA,IAKjBzM,CAAOt3B,KAAM,K,YAQtB6sC,aAAA,SAAaxnC,GACX,IAAKy4B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKqqC,UAAUlpC,OAAQF,GAAK,EAC9C,GAAIjB,KAAKqqC,UAAUppC,IAAMoE,EAAQ,OAAOrF,KAAKqqC,UAAUppC,EAAI,GAC7D68B,IAAIgP,EAAW9sC,KAAK+sC,gBAAgB1nC,GAEpC,OADArF,KAAKqqC,UAAUl1B,KAAK9P,EAAQynC,GACrBA,G,YAGTC,gBAAA,SAAgB1nC,GAEd,IADAy4B,IAAIgF,EAAO1iC,OAAOkO,OAAO,MAAO0+B,EAAS,CAAC,CAACn6B,MAAO7S,KAAM+H,KAAM,KAAMklC,IAAK,OAClED,EAAO7rC,QAAQ,CACpB28B,IAAIwI,EAAU0G,EAAOlY,QAASjiB,EAAQyzB,EAAQzzB,MAC9C,GAAIA,EAAMs5B,UAAU9mC,GAAS,CAE3B,IADAy4B,IAAIj7B,EAAS,GACJ9B,EAAMulC,EAASvlC,EAAIgH,KAAMhH,EAAMA,EAAIksC,IAC1CpqC,EAAOsS,KAAKpU,EAAIgH,MAClB,OAAOlF,EAAOqqC,UAEhB,IAAKpP,IAAI78B,EAAI,EAAGA,EAAI4R,EAAMhC,KAAK1P,OAAQF,GAAK,EAAG,CAC7C68B,IAAI/1B,EAAO8K,EAAMhC,KAAK5P,GACjB8G,EAAK+9B,QAAW/9B,EAAKkkC,oBAAwBlkC,EAAKtI,QAAQqjC,GAAWwD,EAAQv+B,OAAQ8K,EAAMhC,KAAK5P,EAAI,GAAGmpC,WAC1G4C,EAAO73B,KAAK,CAACtC,MAAO9K,EAAKolC,aAAY,KAAEplC,EAAMklC,IAAK3G,IAClDxD,EAAK/6B,EAAKtI,OAAQ,MAS1B4iC,EAAI+K,UAAA,eACF,OAAOptC,KAAK6Q,KAAK1P,QAAU,G,YAM7ByqC,KAAA,SAAK/yB,GACHilB,IAAI78B,EAAI4X,GAAK,EACb,GAAI5X,GAAKjB,KAAK6Q,KAAK1P,OAAQ,MAAM,IAAI29B,WAAU,cAAejmB,EAAC,iCAC/D,MAAO,CAAC9Q,KAAM/H,KAAK6Q,KAAK5P,GAAI4P,KAAM7Q,KAAK6Q,KAAK5P,EAAI,K,YAGlDd,SAAA,WACE29B,IAAIgF,EAAO,GAOX,OANA,SAASuK,EAAK7nB,GACZsd,EAAK3tB,KAAKqQ,GACV,IAAKsY,IAAI78B,EAAI,EAAGA,EAAIukB,EAAE3U,KAAK1P,OAAQF,GAAK,GACN,GAA5B6hC,EAAK3vB,QAAQqS,EAAE3U,KAAK5P,KAAWosC,EAAK7nB,EAAE3U,KAAK5P,IAEnDosC,CAAKrtC,MACE8iC,EAAK/oB,KAAG,SAAEyL,EAAGvkB,GAElB,IADA68B,IAAIkN,EAAM/pC,GAAKukB,EAAE4kB,SAAW,IAAM,KAAO,IAChCnpC,EAAI,EAAGA,EAAIukB,EAAE3U,KAAK1P,OAAQF,GAAK,EACtC+pC,IAAQ/pC,EAAI,KAAO,IAAMukB,EAAE3U,KAAK5P,GAAGxB,KAAO,KAAOqjC,EAAK3vB,QAAQqS,EAAE3U,KAAK5P,EAAI,IAC3E,OAAO+pC,KACNpkC,KAAK,O,oCAEX,GAEDujC,EAAalK,MAAQ,IAAIkK,GAAa,GAEtC,IAAMK,EACJ,SAAY9yB,EAAQ4yB,GAClBtqC,KAAK0X,OAASA,EACd1X,KAAKsqC,UAAYA,EACjBtqC,KAAKstC,OAAS,KACdttC,KAAK+b,IAAM,EACX/b,KAAKutC,OAAS71B,EAAOnR,MAAM,kBACgB,IAAvCvG,KAAKutC,OAAOvtC,KAAKutC,OAAOpsC,OAAS,IAAUnB,KAAKutC,OAAOC,MACrC,IAAlBxtC,KAAKutC,OAAO,IAAUvtC,KAAKutC,OAAO5Y,W,uBACvC,IASH,SAAS+V,EAAUH,GACjBzM,IAAI2N,EAAQ,GACZ,GAAKA,EAAMt2B,KAAKs4B,EAAalD,UACtBA,EAAOmD,IAAI,MAClB,OAAuB,GAAhBjC,EAAMtqC,OAAcsqC,EAAM,GAAK,CAAC1jC,KAAM,SAAQ,MAAE0jC,GAGzD,SAASgC,EAAalD,GACpBzM,IAAI2N,EAAQ,GACZ,GAAKA,EAAMt2B,KAAKw4B,EAAmBpD,UAC5BA,EAAO15B,MAAuB,KAAf05B,EAAO15B,MAA8B,KAAf05B,EAAO15B,MACnD,OAAuB,GAAhB46B,EAAMtqC,OAAcsqC,EAAM,GAAK,CAAC1jC,KAAM,MAAK,MAAE0jC,GAGtD,SAASkC,EAAmBpD,GAE1B,IADAzM,IAAI2M,EA4CN,SAAuBF,GACrB,GAAIA,EAAOmD,IAAI,KAAM,CACnB5P,IAAI2M,EAAOC,EAAUH,GAErB,OADKA,EAAOmD,IAAI,MAAMnD,EAAOI,IAAI,yBAC1BF,EACF,IAAK,KAAK34B,KAAKy4B,EAAO15B,MAAO,CAClCitB,IAAI2N,EAlBR,SAAqBlB,EAAQ9qC,GAC3Bq+B,IAAI4O,EAAQnC,EAAOD,UAAWviC,EAAO2kC,EAAMjtC,GAC3C,GAAIsI,EAAM,MAAO,CAACA,GAClB+1B,IAAIj7B,EAAS,GACb,IAAKi7B,IAAI8P,KAAYlB,EAAO,CAC1B5O,IAAI/1B,EAAO2kC,EAAMkB,GACb7lC,EAAK0oB,OAAOtd,QAAQ1T,IAAS,GAAGoD,EAAOsS,KAAKpN,GAE7B,GAAjBlF,EAAO1B,QAAaopC,EAAOI,IAAI,0BAA4BlrC,EAAO,WACtE,OAAOoD,EASOgrC,CAAYtD,EAAQA,EAAO15B,MAAMkJ,KAAG,SAAChS,GAG/C,OAFqB,MAAjBwiC,EAAO+C,OAAgB/C,EAAO+C,OAASvlC,EAAKmhC,SACvCqB,EAAO+C,QAAUvlC,EAAKmhC,UAAUqB,EAAOI,IAAI,mCAC7C,CAAC5iC,KAAM,OAAQtD,MAAOsD,MAG/B,OADAwiC,EAAOxuB,MACgB,GAAhB0vB,EAAMtqC,OAAcsqC,EAAM,GAAK,CAAC1jC,KAAM,SAAQ,MAAE0jC,GAEvDlB,EAAOI,IAAI,qBAAuBJ,EAAO15B,KAAO,KA1DvCi9B,CAAcvD,KAEvB,GAAIA,EAAOmD,IAAI,KACbjD,EAAO,CAAC1iC,KAAM,OAAM,KAAE0iC,QACnB,GAAIF,EAAOmD,IAAI,KAClBjD,EAAO,CAAC1iC,KAAM,OAAM,KAAE0iC,QACnB,GAAIF,EAAOmD,IAAI,KAClBjD,EAAO,CAAC1iC,KAAM,MAAK,KAAE0iC,OAClB,KAAIF,EAAOmD,IAAI,KAEf,MADHjD,EAAOsD,EAAexD,EAAQE,GAGlC,OAAOA,EAGT,SAASuD,EAASzD,GACZ,KAAKz4B,KAAKy4B,EAAO15B,OAAO05B,EAAOI,IAAI,yBAA2BJ,EAAO15B,KAAO,KAChFitB,IAAIj7B,EAAS8M,OAAO46B,EAAO15B,MAE3B,OADA05B,EAAOxuB,MACAlZ,EAGT,SAASkrC,EAAexD,EAAQE,GAC9B3M,IAAIj1B,EAAMmlC,EAASzD,GAASrb,EAAMrmB,EAMlC,OALI0hC,EAAOmD,IAAI,OACWxe,EAAL,KAAfqb,EAAO15B,KAAmBm9B,EAASzD,IAC3B,GAETA,EAAOmD,IAAI,MAAMnD,EAAOI,IAAI,yBAC1B,CAAC5iC,KAAM,QAAO,IAAEc,EAAG,IAAEqmB,EAAG,KAAEub,GAwGnC,SAASY,EAAInoC,EAAGC,GAAK,OAAOA,EAAID,EAKhC,SAASioC,EAASP,EAAK7K,GACrBjC,IAAIj7B,EAAS,GAEb,OAEA,SAASwqC,EAAKtN,GACZjC,IAAIgO,EAAQlB,EAAI7K,GAChB,GAAoB,GAAhB+L,EAAM3qC,SAAgB2qC,EAAM,GAAGb,KAAM,OAAOoC,EAAKvB,EAAM,GAAGtL,IAC9D39B,EAAOsS,KAAK4qB,GACZ,IAAKjC,IAAI78B,EAAI,EAAGA,EAAI6qC,EAAM3qC,OAAQF,IAAK,CACrC,IAAN,EAAuB6qC,EAAM7qC,GAAlBgqC,EAAA,EAAAA,KAAMzK,EAAA,EAAAA,GACNyK,IAA+B,GAAvBpoC,EAAOsQ,QAAQqtB,IAAW6M,EAAK7M,IAThD6M,CAAKtN,GACEl9B,EAAOuoC,KAAKC,GCpUrB,SAAS,EAAa,GAClBvN,IAAE,EAAW,OAAO,OAAO,MAC3B,IAAGA,IAAI,KAAY,EAAO,CAC1BA,IAAI,EAAO,EAAM,GACjB,IAAK,EAAK,WAAY,OAAO,KAC7B,EAAS,GAAY,EAAK,QAE1B,OAAK,EAGT,SAAS,EAAa,EAAO,GAC3BA,IAAI,EAAQ,OAAO,OAAO,MACxB,IAAGA,IAAI,KAAQ,EAAO,CACtBA,IAAI,EAAQ,GAAS,EAAM,GAC3B,QAAc,IAAV,EAAqB,CACvBA,IAAI,EAAO,EAAM,GACjB,IAAI,EAAK,WACJ,MAAM,IAAI,WAAW,mCAAqC,GAD1C,EAAQ,EAAK,QAGpC,EAAM,GAAQ,EAEd,OAAK,EAGT,SAAS,EAAU,GACfA,IAAE,EAAS,OAAO,OAAO,MACzB,GAAE,EAAW,IAACA,IAAI,KAAQ,EAAO,EAAO,GAAQ,IAAI,EAAU,EAAM,IACpE,OAAK,EDsIPkM,EAAIn5B,KAAA,eAAS,OAAO7Q,KAAKutC,OAAOvtC,KAAK+b,M,YAErC2xB,IAAA,SAAIO,GAAO,OAAOjuC,KAAK6Q,MAAQo9B,IAAQjuC,KAAK+b,QAAS,I,YAErD4uB,IAAA,SAAIrnC,GAAO,MAAM,IAAI4qC,YAAY5qC,EAAM,4BAA8BtD,KAAK0X,OAAS,O,oCACpF,G,ICpIY,EACX,SAAY,EAAM,EAAQ,GAGtB,KAAG,KAAO,EAIV,KAAG,OAAS,EAIZ,KAAG,KAAO,EAEV,KAAG,OAAS,EAAK,MAAQ,EAAK,MAAM,MAAM,KAAO,GACjD,KAAG,MAAQ,EAAU,EAAK,OAE1B,KAAG,aAAe,EAAa,KAAK,OAIpC,KAAG,aAAe,KAKlB,KAAG,QAAU,KAIb,KAAG,cAAgB,KAInB,KAAG,UAAY,EAAK,QAAkB,QAAR,GAIhC,KAAK,OAAiB,QAAR,G,2GACf,IAID2qB,EAAI,wBAAa,OAAQ,KAAK,SAK9BA,EAAI,2BAAgB,OAAO,KAAK,SAAW,KAAK,eAIhDA,EAAI,sBAAW,OAAO,KAAK,cAAgB,EAAa,OAKxDA,EAAI,sBAAW,OAAO,KAAK,QAAU,KAAK,KAAK,M,YAI/C,4BACE,IAAKvE,IAAI,KAAK,KAAK,MAAO,GAAI,KAAK,MAAM,GAAG,WAAY,OAAO,EAC/D,OAAO,G,YAGT,2BAAkB,GACd,OAAK,MAAQ,GAAS,KAAK,aAAa,WAAW,EAAM,e,YAG7D,sBAAa,GACX,OAAK,GAAS,KAAK,aAAqB,KAAK,aACjC,EAAa,KAAK,MAAO,I,YAUvC,gBAAO,EAAO,EAAS,GACrB,GAAI,KAAK,OAAQ,MAAM,IAAI,MAAM,8CACjC,OAAO,IAAI,EAAK,KAAM,KAAK,aAAa,GAAQ,EAAS,KAAK,GAAU,EAAK,QAAQ,K,YAOvF,uBAAc,EAAO,EAAS,GAE1B,GADA,EAAQ,EAAS,KAAK,IACnB,KAAK,aAAa,GACrB,MAAM,IAAI,WAAW,4BAA8B,KAAK,MAC1D,OAAO,IAAI,EAAK,KAAM,KAAK,aAAa,GAAQ,EAAS,EAAK,QAAQ,K,YAUxE,uBAAc,EAAO,EAAS,GAG5B,GAFA,EAAQ,KAAK,aAAa,IAC1B,EAAU,EAAS,KAAK,IACZ,KAAM,CAChBA,IAAI,EAAS,KAAK,aAAa,WAAW,GAC1C,IAAK,EAAQ,OAAO,KACpB,EAAU,EAAO,OAAO,GAE1BA,IAAI,EAAQ,KAAK,aAAa,cAAc,GAAS,WAAW,EAAS,OAAO,GAChF,OAAK,EACE,IAAI,EAAK,KAAM,EAAO,EAAQ,OAAO,GAAQ,EAAK,QAAQ,IAD9C,M,YAOrB,sBAAa,GACXA,IAAI,EAAS,KAAK,aAAa,cAAc,GAC7C,IAAK,IAAW,EAAO,SAAU,OAAO,EACxC,IAAKA,IAAI,EAAI,EAAG,EAAI,EAAQ,WAAY,IACtC,IAAK,KAAK,YAAY,EAAQ,MAAM,GAAG,OAAQ,OAAO,EACxD,OAAO,G,YAKT,wBAAe,GACb,OAAuB,MAAhB,KAAK,SAAmB,KAAK,QAAQ,QAAQ,IAAa,G,YAKnE,qBAAY,GACV,GAAoB,MAAhB,KAAK,QAAiB,OAAO,EACjC,IAAKA,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,IAAK,KAAK,eAAe,EAAM,GAAG,MAAO,OAAO,EACvF,OAAO,G,YAKT,sBAAa,GACX,GAAoB,MAAhB,KAAK,QAAiB,OAAO,EAEjC,IADAA,IAAI,EACK,EAAI,EAAG,EAAI,EAAM,OAAQ,IAC3B,KAAK,eAAe,EAAM,GAAG,MAEvB,GACT,EAAK,KAAK,EAAM,IAFX,IAAM,EAAO,EAAM,MAAM,EAAG,IAKrC,OAAQ,EAAe,EAAK,OAAS,EAAO,EAAK,MAAlC,GAGjB,EAAO,iBAAQ,EAAO,GACpBA,IAAI,EAAS,OAAO,OAAO,MAC3B,EAAM,SAAO,SAAE,EAAM,GAAI,OAAK,EAAO,GAAQ,IAAI,EAAS,EAAM,EAAQ,MAExEA,IAAI,EAAU,EAAO,KAAK,SAAW,MACrC,IAAK,EAAO,GAAU,MAAM,IAAI,WAAW,yCAA2C,EAAU,MAChG,IAAK,EAAO,KAAM,MAAM,IAAI,WAAW,oCACvC,IAAKA,IAAI,KAAK,EAAO,KAAK,MAAO,MAAM,IAAI,WAAW,iDAEtD,OAAO,G,oCAEV,GAID,IAAM,EACJ,SAAY,GACV,KAAK,WAAa,OAAO,UAAU,eAAe,KAAK,EAAS,WAChE,KAAK,QAAU,EAAQ,S,6BACxB,IAEDkM,EAAI,0BACF,OAAQ,KAAK,Y,oCAEhB,G,IAQY,EACX,SAAY,EAAM,EAAM,EAAQ,GAG9B,KAAK,KAAO,EAIZ,KAAK,OAAS,EAId,KAAK,KAAO,EAEZ,KAAK,MAAQ,EAAU,EAAK,OAE5B,KAAK,KAAO,EACZ,KAAK,SAAW,KAChBlM,IAAI,EAAW,EAAa,KAAK,OACjC,KAAK,SAAW,GAAY,IAAI,EAAK,KAAM,I,YAO7C,gBAAO,GACL,OAAK,GAAS,KAAK,SAAiB,KAAK,SAClC,IAAI,EAAK,KAAM,EAAa,KAAK,MAAO,KAGjD,EAAO,iBAAQ,EAAO,GACpBA,IAAI,EAAS,OAAO,OAAO,MAAO,EAAO,EAEzC,OADA,EAAM,SAAO,SAAE,EAAM,GAAI,OAAK,EAAO,GAAQ,IAAI,EAAS,EAAM,IAAQ,EAAQ,MACzE,G,YAMT,uBAAc,GACZ,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,EAAI,GAAG,MAAQ,KACjB,OAAO,EAAI,MAAM,EAAG,GAAG,OAAO,EAAI,MAAM,EAAI,IAChD,OAAO,G,YAKT,iBAAQ,GACN,IAAKA,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,EAAI,GAAG,MAAQ,KAAM,OAAO,EAAI,I,YAMxC,kBAAS,GACP,OAAO,KAAK,SAAS,QAAQ,IAAU,G,IAyK9B,EAGX,SAAY,GAQV,IAAKA,IAAI,KADT,KAAK,KAAO,GACK,EAAM,KAAK,KAAK,GAAQ,EAAK,GAC9C,KAAK,KAAK,MAAQ,EAAW,KAAK,EAAK,OACvC,KAAK,KAAK,MAAQ,EAAW,KAAK,EAAK,OAIvC,KAAK,MAAQ,EAAS,QAAQ,KAAK,KAAK,MAAO,MAI/C,KAAK,MAAQ,EAAS,QAAQ,KAAK,KAAK,MAAO,MAE/CA,IAAI,EAAmB,OAAO,OAAO,MACrC,IAAKA,IAAIjb,KAAQ,KAAK,MAAO,CAC3B,GAAIA,KAAQ,KAAK,MACf,MAAM,IAAI,WAAWA,EAAO,sCAC9Bib,IAAI,EAAO,KAAK,MAAMjb,GAAO,EAAc,EAAK,KAAK,SAAW,GAAI,EAAW,EAAK,KAAK,MACzF,EAAK,aAAe,EAAiB,KAClC,EAAiB,GAAe,EAAa,MAAM,EAAa,KAAK,QACxE,EAAK,cAAgB,EAAK,aAAa,cACvC,EAAK,QAAsB,KAAZ,EAAkB,KAC/B,EAAW,GAAY,KAAM,EAAS,MAAM,MAChC,IAAZ,GAAmB,EAAK,cAAqB,KAAL,GAE5C,IAAKib,IAAIjb,KAAQ,KAAK,MAAO,CAC3Bib,IAAI/1B,EAAO,KAAK,MAAM8a,GAAO,EAAO9a,EAAK,KAAK,SAC9CA,EAAK,SAAmB,MAAR,EAAe,CAACA,GAAgB,IAAR,EAAa,GAAK,GAAY,KAAM,EAAK,MAAM,MAGzF,KAAK,aAAe,KAAK,aAAa,KAAK,MAC3C,KAAK,aAAe,KAAK,aAAa,KAAK,MAK3C,KAAK,YAAc,KAAK,MAAM,KAAK,KAAK,SAAW,OAMnD,KAAK,OAAS,OAAO,OAAO,MAC5B,KAAK,OAAO,UAAY,OAAO,OAAO,OAuD1C,SAAS,GAAY,EAAQ,GAE3B,IADA+1B,IAAI,EAAQ,GACH,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrCA,IAAI,EAAO,EAAM,GAAI,EAAO,EAAO,MAAM,GAAO,EAAK,EACrD,GAAI,EACF,EAAM,KAAK,QAEX,IAAKA,IAAI,KAAQ,EAAO,MAAO,CAC7BA,IAAIuB,EAAO,EAAO,MAAM,IACZ,KAAR,GAAgBA,EAAK,KAAK,OAASA,EAAK,KAAK,MAAM,MAAM,KAAK,QAAQ,IAAS,IACjF,EAAM,KAAK,EAAKA,GAGtB,IAAK,EAAI,MAAM,IAAI,YAAY,uBAAyB,EAAM,GAAK,KAErE,OAAO,E,YA9DP,cAAK,EAAM,EAAO,EAAS,GACzB,GAAmB,iBAAR,EACT,EAAO,KAAK,SAAS,OAClB,MAAM,aAAgB,GACzB,MAAM,IAAI,WAAW,sBAAwB,GAC1C,GAAI,EAAK,QAAU,KACtB,MAAM,IAAI,WAAW,yCAA2C,EAAK,KAAO,KAE9E,OAAO,EAAK,cAAc,EAAO,EAAS,I,YAM5C,cAAKkB,EAAM,GACTzC,IAAI,EAAO,KAAK,MAAM,KACtB,OAAO,IAAI,EAAS,EAAM,EAAK,aAAcyC,EAAM,EAAK,QAAQ,K,YAKlE,cAAK,EAAM,GAET,MADmB,iBAAR,IAAkB,EAAO,KAAK,MAAM,IACxC,EAAK,OAAO,I,YAMrB,sBAAa,GACX,OAAO,EAAK,SAAS,KAAM,I,YAM7B,sBAAa,GACX,OAAO,EAAK,SAAS,KAAM,I,YAG7B,kBAAS,GACPzC,IAAI,EAAQ,KAAK,MAAM,GACvB,IAAK,EAAO,MAAM,IAAI,WAAW,sBAAwB,GACzD,OAAO,G,ICxaEqQ,GAIX,SAAY1N,EAAQ2N,G,WAGlBpuC,KAAKygC,OAASA,EAIdzgC,KAAKouC,MAAQA,EACbpuC,KAAKquC,KAAO,GACZruC,KAAKgrB,OAAS,GAEdojB,EAAMttC,SAAO,SAACwtC,GACRA,EAAK3yB,IAAK3b,EAAKquC,KAAKl5B,KAAKm5B,GACpBA,EAAKvgC,OAAO/N,EAAKgrB,OAAO7V,KAAKm5B,MAIxCtuC,KAAKuuC,gBAAkBvuC,KAAKquC,KAAKp0B,MAAI,SAAC3S,GACpC,IAAK,aAAawK,KAAKxK,EAAEqU,OAASrU,EAAEy4B,KAAM,OAAO,EACjDjC,IAAIiC,EAAOU,EAAOoH,MAAMvgC,EAAEy4B,MAC1B,OAAOA,EAAKoN,aAAahB,UAAUpM,O,aAMvCvhB,MAAA,SAAMgwB,EAAKrpC,Q,UAAU,IACnB24B,IAAIj0B,EAAU,IAAI4kC,GAAazuC,KAAMmF,GAAS,GAE9C,OADA0E,EAAQ6kC,OAAOF,EAAK,KAAMrpC,EAAQotB,KAAMptB,EAAQq7B,IACzC32B,EAAQ8kC,U,aAUjBC,WAAA,SAAWJ,EAAKrpC,Q,UAAU,IACxB24B,IAAIj0B,EAAU,IAAI4kC,GAAazuC,KAAMmF,GAAS,GAE9C,OADA0E,EAAQ6kC,OAAOF,EAAK,KAAMrpC,EAAQotB,KAAMptB,EAAQq7B,IACzCqO,EAAMC,QAAQjlC,EAAQ8kC,W,aAG/BI,SAAA,SAASP,EAAK3kC,GACZ,IAAKi0B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKquC,KAAKltC,OAAQF,IAAK,CACzC68B,IAAIwQ,EAAOtuC,KAAKquC,KAAKptC,GACrB,GAAI+tC,GAAQR,EAAKF,EAAK3yB,YACE5V,IAAnBuoC,EAAKtiC,WAA2BwiC,EAAIS,cAAgBX,EAAKtiC,cACxDsiC,EAAKzkC,SAAWA,EAAQqlC,eAAeZ,EAAKzkC,UAAW,CAC3D,GAAIykC,EAAKa,SAAU,CACjBrR,IAAIj7B,EAASyrC,EAAKa,SAASX,GAC3B,IAAe,IAAX3rC,EAAkB,SACtByrC,EAAKxG,MAAQjlC,EAEf,OAAOyrC,K,aAKbc,WAAA,SAAWvsB,EAAMpe,EAAOoF,GACtB,IAAKi0B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKgrB,OAAO7pB,OAAQF,IAAK,CAC3C68B,IAAIwQ,EAAOtuC,KAAKgrB,OAAO/pB,GACvB,KAAgC,GAA5BqtC,EAAKvgC,MAAMoF,QAAQ0P,IACnByrB,EAAKzkC,UAAYA,EAAQqlC,eAAeZ,EAAKzkC,UAI7CykC,EAAKvgC,MAAM5M,OAAS0hB,EAAK1hB,SACc,IAAtCmtC,EAAKvgC,MAAMrK,WAAWmf,EAAK1hB,SAAiBmtC,EAAKvgC,MAAMhL,MAAM8f,EAAK1hB,OAAS,IAAMsD,IANtF,CAQA,GAAI6pC,EAAKa,SAAU,CACjBrR,IAAIj7B,EAASyrC,EAAKa,SAAS1qC,GAC3B,IAAe,IAAX5B,EAAkB,SACtByrC,EAAKxG,MAAQjlC,EAEf,OAAOyrC,KAKX,GAAOe,YAAA,SAAY5O,GACjB3C,IAAIj7B,EAAS,GACb,SAASysC,EAAOhB,GAEd,IADAxQ,IAAIyR,EAA4B,MAAjBjB,EAAKiB,SAAmB,GAAKjB,EAAKiB,SAAUtuC,EAAI,EACxDA,EAAI4B,EAAO1B,OAAQF,IAAK,CAC7B68B,IAAIjtB,EAAOhO,EAAO5B,GAClB,IADsD,MAAjB4P,EAAK0+B,SAAmB,GAAK1+B,EAAK0+B,UACpDA,EAAU,MAE/B1sC,EAAOmhC,OAAO/iC,EAAG,EAAGqtC,GAGxB,IAAF,cACMxQ,IAAIsQ,EAAQ3N,EAAOxB,MAAMx/B,GAAM0iC,KAAKqN,SAChCpB,GAAOA,EAAMttC,SAAO,SAACwtC,GACvBgB,EAAOhB,EAAO/H,GAAK+H,IACnBA,EAAKjP,KAAO5/B,MAJhB,IAAKq+B,IAAIr+B,KAAQghC,EAAOxB,MAAK,KAO/B,IACQmP,EADN,IAAKtQ,IAAIr+B,KAAQghC,EAAOoH,MAClBuG,YAAQ3N,EAAOoH,MAAMpoC,GAAM0iC,KAAKqN,WACzBpB,EAAMttC,SAAO,SAACwtC,GACvBgB,EAAOhB,EAAO/H,GAAK+H,IACnBA,EAAKvO,KAAOtgC,KAGhB,OAAOoD,GAOT,GAAO4sC,WAAA,SAAWhP,GAChB,OAAOA,EAAOoJ,OAAO6F,YAClBjP,EAAOoJ,OAAO6F,UAAY,IAAIvB,GAAU1N,EAAQ0N,GAAUkB,YAAY5O,MAK7ExC,IAAM0R,GAAY,CAChBC,SAAS,EAAMC,SAAS,EAAMC,OAAO,EAAMC,YAAY,EAAMC,QAAQ,EACrEC,IAAI,EAAMC,KAAK,EAAMC,IAAI,EAAMC,UAAU,EAAMC,YAAY,EAAMC,QAAQ,EACzEC,QAAQ,EAAMC,MAAM,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EACtEC,IAAI,EAAMC,QAAQ,EAAMC,QAAQ,EAAMC,IAAI,EAAMC,IAAI,EAAMC,UAAU,EAAMC,IAAI,EAC9EC,QAAQ,EAAMljB,GAAG,EAAMmjB,KAAK,EAAMC,SAAS,EAAMC,OAAO,EAAMC,OAAO,EAAMC,IAAI,GAI3EC,GAAa,CACjBnmB,MAAM,EAAM2lB,UAAU,EAAMvsC,QAAQ,EAAMgtC,QAAQ,EAAM7jC,OAAO,EAAMqH,OAAO,GAIxEy8B,GAAW,CAACT,IAAI,EAAMM,IAAI,GAKhC,SAASI,GAAaC,GACpB,OAAQA,EAHc,EAGyB,IAA6B,SAAvBA,EAHL,EAG4D,GAG9G,IAAMC,GACJ,SAAYjqC,EAAM+/B,EAAO7I,EAAOgT,EAAcC,EAAOr/B,EAAO1N,GAC1DnF,KAAK+H,KAAOA,EACZ/H,KAAK8nC,MAAQA,EACb9nC,KAAKkyC,MAAQA,EACblyC,KAAK6S,MAAQA,IAXoD,EAW1C1N,EAA0B,KAAO4C,EAAKolC,cAC7DntC,KAAKmF,QAAUA,EACfnF,KAAKyD,QAAU,GAEfzD,KAAKi/B,MAAQA,EAEbj/B,KAAKmyC,YAAcvJ,EAAKzI,KAExBngC,KAAKiyC,aAAeA,EAEpBjyC,KAAKoyC,WAAa,I,aAGpBvF,aAAA,SAAa9M,GACX,IAAK//B,KAAK6S,MAAO,CACf,IAAK7S,KAAK+H,KAAM,MAAO,GACvB+1B,IAAIuU,EAAOryC,KAAK+H,KAAKolC,aAAaX,WAAWvH,EAAS1S,KAAKwN,IAC3D,IAAIsS,EAEG,CACLvU,IAAoCwU,EAAhC/M,EAAQvlC,KAAK+H,KAAKolC,aACtB,OAAImF,EAAO/M,EAAMsH,aAAa9M,EAAKh4B,QACjC/H,KAAK6S,MAAQ0yB,EACN+M,GAEA,KAPTtyC,KAAK6S,MAAQ7S,KAAK+H,KAAKolC,aAAaf,cAAciG,GAWtD,OAAOryC,KAAK6S,MAAMg6B,aAAa9M,EAAKh4B,O,aAGtC4mC,OAAA,SAAO4D,GACL,KA5CoB,EA4CdvyC,KAAKmF,SAA4B,CACrC24B,IAAkDtY,EAA9CmV,EAAO36B,KAAKyD,QAAQzD,KAAKyD,QAAQtC,OAAS,GAC1Cw5B,GAAQA,EAAKkL,SAAWrgB,EAAI,oBAAoB5mB,KAAK+7B,EAAK4F,SACxD5F,EAAK4F,KAAKp/B,QAAUqkB,EAAE,GAAGrkB,OAAQnB,KAAKyD,QAAQ+pC,MAC7CxtC,KAAKyD,QAAQzD,KAAKyD,QAAQtC,OAAS,GAAKw5B,EAAKuL,SAASvL,EAAK4F,KAAKx9B,MAAM,EAAG43B,EAAK4F,KAAKp/B,OAASqkB,EAAE,GAAGrkB,UAG1G28B,IAAIr6B,EAAUwhC,EAAS1S,KAAKvyB,KAAKyD,SAGjC,OAFK8uC,GAAWvyC,KAAK6S,QACnBpP,EAAUA,EAAQshC,OAAO/kC,KAAK6S,MAAM25B,WAAWvH,EAAShF,OAAO,KAC1DjgC,KAAK+H,KAAO/H,KAAK+H,KAAKuG,OAAOtO,KAAK8nC,MAAOrkC,EAASzD,KAAKi/B,OAASx7B,G,aAGzE+uC,iBAAA,SAAiBC,GACf,IAAK3U,IAAI78B,EAAIjB,KAAKoyC,WAAWjxC,OAAS,EAAGF,GAAK,EAAGA,IAC/C,GAAIjB,KAAKoyC,WAAWnxC,GAAG8G,MAAQ0qC,EAAU,OAAOzyC,KAAKoyC,WAAWpO,OAAO/iC,EAAG,GAAG,I,aAGjFyxC,aAAA,SAAaC,GACX,IAAK7U,IAAI78B,EAAI,EAAG2xC,EAAU5yC,KAAKiyC,aAAchxC,EAAI2xC,EAAQzxC,OAAQF,IAAK,CACpE68B,IAAIuB,EAAOuT,EAAQ3xC,GACnB,IAAKjB,KAAK+H,KAAO/H,KAAK+H,KAAK8qC,eAAexT,EAAKt3B,MAAQ+qC,GAAazT,EAAKt3B,KAAM4qC,MAC1EtT,EAAK2J,QAAQhpC,KAAKmyC,aAAc,CACnCrU,IAAIiG,EAAQgP,GAAkB1T,EAAMr/B,KAAKmyC,aACrCpO,GAAO/jC,KAAKoyC,WAAWj9B,KAAK4uB,GAChC/jC,KAAKmyC,YAAc9S,EAAKC,SAASt/B,KAAKmyC,aACtCnyC,KAAKiyC,aAAe5S,EAAKI,cAAcz/B,KAAKiyC,iBAMpD,IAAMxD,GAEJ,SAAYuE,EAAQ7tC,EAASiJ,GAE3BpO,KAAKgzC,OAASA,EAEdhzC,KAAKmF,QAAUA,EACfnF,KAAKizC,OAAS7kC,EACd0vB,IAA+BoV,EAA3BC,EAAUhuC,EAAQguC,QAClBC,EAAatB,GAAa3sC,EAAQ4sC,qBAAuB3jC,EArFI,EAqFmB,GAElF8kC,EADEC,EACW,IAAInB,GAAYmB,EAAQprC,KAAMorC,EAAQrL,MAAOc,EAAKzI,KAAMyI,EAAKzI,MAAM,EACnDh7B,EAAQkuC,UAAYF,EAAQprC,KAAKolC,aAAciG,GAE/D,IAAIpB,GADV5jC,EACsB,KAEA4kC,EAAOvS,OAAOc,YAFR,KAAMqH,EAAKzI,KAAMyI,EAAKzI,MAAM,EAAM,KAAMiT,GAG7EpzC,KAAK6nC,MAAQ,CAACqL,GAEdlzC,KAAKoO,KAAO,EACZpO,KAAKma,KAAOhV,EAAQmuC,cACpBtzC,KAAKuzC,YAAa,G,oDACnB,IA+WH,SAASvE,GAAQR,EAAKgF,GACpB,OAAQhF,EAAIQ,SAAWR,EAAIiF,mBAAqBjF,EAAIkF,uBAAyBlF,EAAImF,oBAAoBnzC,KAAKguC,EAAKgF,GAWjH,SAASjN,GAAKxlC,GACZ+8B,IAAIyI,EAAO,GACX,IAAKzI,IAAIjb,KAAQ9hB,EAAKwlC,EAAK1jB,GAAQ9hB,EAAI8hB,GACvC,OAAO0jB,EAMT,SAASuM,GAAaL,EAAUmB,GAC9B9V,IAAI+J,EAAQ+L,EAASnT,OAAOoH,MAC9B,cACI/J,IAAI9zB,EAAS69B,EAAMpoC,GACnB,GAAKuK,EAAO6oC,eAAeJ,GAA3B,CACA3U,IAAIgF,EAAO,GAQX,OARsB,SAAPuK,EAAOx6B,GACpBiwB,EAAK3tB,KAAKtC,GACV,IAAKirB,IAAI78B,EAAI,EAAGA,EAAI4R,EAAMu6B,UAAWnsC,IAAK,CACxC,IAAR,EAA2B4R,EAAM+4B,KAAK3qC,GAAzB8G,EAAA,EAAAA,KAAM8I,EAAA,EAAAA,KACX,GAAI9I,GAAQ6rC,EAAU,OAAO,EAC7B,GAAI9Q,EAAK3vB,QAAQtC,GAAQ,GAAKw8B,EAAKx8B,GAAO,OAAO,GAGjDw8B,CAAKrjC,EAAOmjC,cAAe,IAAO,QAAtC,IAXF,IAAKrP,IAAIr+B,KAAQooC,EAAK,C,4BAexB,SAASkL,GAAkB1T,EAAMv0B,GAC/B,IAAKgzB,IAAI78B,EAAI,EAAGA,EAAI6J,EAAI3J,OAAQF,IAC9B,GAAIo+B,EAAKt3B,MAAQ+C,EAAI7J,GAAG8G,KAAM,OAAO+C,EAAI7J,GArZ3CohC,GAAIwR,IAAA,eACF,OAAO7zC,KAAK6nC,MAAM7nC,KAAKoO,O,aAOzB0lC,OAAA,SAAOtF,GACL,GAAoB,GAAhBA,EAAIoF,SACN5zC,KAAK+zC,YAAYvF,QACZ,GAAoB,GAAhBA,EAAIoF,SAAe,CAC5B9V,IAAI/vB,EAAQygC,EAAIwF,aAAa,SACzB/U,EAAQlxB,EAAQ/N,KAAKi0C,WAsW/B,SAAqBlmC,GACnB+vB,IAAuCtY,EAAnC1S,EAAK,6BAAiCjQ,EAAS,GACnD,KAAO2iB,EAAI1S,EAAGlU,KAAKmP,IAAQlL,EAAOsS,KAAKqQ,EAAE,GAAIA,EAAE,GAAGniB,QAClD,OAAOR,EAzWiCqxC,CAAYnmC,IAAU,KAAM8lC,EAAM7zC,KAAK6zC,IAC3E,GAAa,MAAT5U,EAAe,IAAKnB,IAAI78B,EAAI,EAAGA,EAAIg+B,EAAM99B,OAAQF,IAAKjB,KAAKm0C,eAAelV,EAAMh+B,IAEpF,GADAjB,KAAKo0C,WAAW5F,GACH,MAATvP,EAAe,IAAKnB,IAAI78B,EAAI,EAAGA,EAAIg+B,EAAM99B,OAAQF,IAAKjB,KAAKq0C,kBAAkBpV,EAAMh+B,GAAI4yC,K,aAI/FE,YAAA,SAAYvF,GACV1Q,IAAIr5B,EAAQ+pC,EAAI8F,UACZT,EAAM7zC,KAAK6zC,IACf,IAAKA,EAAI9rC,KAAO8rC,EAAI9rC,KAAKwhC,cAAgBsK,EAAIpwC,QAAQtC,QAAU0yC,EAAIpwC,QAAQ,GAAGylC,WAAa,mBAAmBp3B,KAAKrN,GAAQ,CACzH,GA5HkB,EA4HZovC,EAAI1uC,QA5HkC,EAyI/B0uC,EAAI1uC,UACfV,EAAQA,EAAMlB,QAAQ,YAAa,WATnC,GAJAkB,EAAQA,EAAMlB,QAAQ,oBAAqB,KAIvC,mBAAmBuO,KAAKrN,IAAUzE,KAAKoO,MAAQpO,KAAK6nC,MAAM1mC,OAAS,EAAG,CACxE28B,IAAI4K,EAAamL,EAAIpwC,QAAQowC,EAAIpwC,QAAQtC,OAAS,GAC9CozC,EAAgB/F,EAAIgG,kBACnB9L,GACA6L,GAA2C,MAA1BA,EAAcE,UAC/B/L,EAAW7C,QAAU,mBAAmB/zB,KAAK42B,EAAWnI,SAC3D97B,EAAQA,EAAM1B,MAAM,IAKtB0B,GAAOzE,KAAK00C,WAAW10C,KAAKgzC,OAAOvS,OAAOF,KAAK97B,IACnDzE,KAAK20C,WAAWnG,QAEhBxuC,KAAK40C,WAAWpG,I,aAOpB4F,WAAA,SAAW5F,GACT1Q,IAAIr+B,EAAO+uC,EAAIiG,SAAS98B,cACpBk6B,GAASxwC,eAAe5B,IAASO,KAAKgzC,OAAOzE,gBA0SrD,SAAuBC,GACrB,IAAK1Q,IAAIuH,EAAQmJ,EAAI3gB,WAAYgnB,EAAW,KAAMxP,EAAOA,EAAQA,EAAMyP,YAAa,CAClFhX,IAAIr+B,EAAyB,GAAlB4lC,EAAMuO,SAAgBvO,EAAMoP,SAAS98B,cAAgB,KAC5DlY,GAAQoyC,GAASxwC,eAAe5B,IAASo1C,GAC3CA,EAAS5mC,YAAYo3B,GACrBA,EAAQwP,GACS,MAARp1C,EACTo1C,EAAWxP,EACF5lC,IACTo1C,EAAW,OAnToDE,CAAcvG,GAC/E1Q,IAAIwQ,EAAQtuC,KAAKmF,QAAQ6vC,cAAgBh1C,KAAKmF,QAAQ6vC,aAAaxG,IAASxuC,KAAKgzC,OAAOjE,SAASP,EAAKxuC,MACtG,GAAIsuC,EAAOA,EAAK9L,OAASmP,GAAWtwC,eAAe5B,GACjDO,KAAK40C,WAAWpG,QACX,IAAKF,GAAQA,EAAK2G,MAAQ3G,EAAK4G,YAAa,CAC7C5G,GAAQA,EAAK4G,YAAal1C,KAAKoO,KAAOxO,KAAKsvB,IAAI,EAAGlvB,KAAKoO,KAAO,GACzDkgC,GAAQA,EAAK2G,KAAKrB,WAAUpF,EAAMF,EAAK2G,MAChDnX,IAAIqX,EAAMtB,EAAM7zC,KAAK6zC,IAAKuB,EAAgBp1C,KAAKuzC,WAC/C,GAAI5D,GAAUtuC,eAAe5B,GAC3B01C,GAAO,EACFtB,EAAI9rC,OAAM/H,KAAKuzC,YAAa,QAC5B,IAAK/E,EAAI3gB,WAEd,YADA7tB,KAAKq1C,aAAa7G,GAGpBxuC,KAAK0uC,OAAOF,GACR2G,GAAMn1C,KAAKm1C,KAAKtB,GACpB7zC,KAAKuzC,WAAa6B,OAElBp1C,KAAKs1C,iBAAiB9G,EAAKF,I,aAK/B+G,aAAA,SAAa7G,GACS,MAAhBA,EAAIiG,UAAoBz0C,KAAK6zC,IAAI9rC,MAAQ/H,KAAK6zC,IAAI9rC,KAAKwhC,eACzDvpC,KAAK+zC,YAAYvF,EAAI+G,cAAc/nB,eAAe,Q,aAMtDymB,WAAA,SAAWjpB,GAET,IADA8S,IAAImB,EAAQ2J,EAAKzI,KACRl/B,EAAI,EAAGA,EAAI+pB,EAAO7pB,OAAQF,GAAK,EAAG,CACzC68B,IAAIwQ,EAAOtuC,KAAKgzC,OAAO5D,WAAWpkB,EAAO/pB,GAAI+pB,EAAO/pB,EAAI,GAAIjB,MAC5D,GAAKsuC,EAAL,CACA,GAAIA,EAAK9L,OAAQ,OAAO,KACxBvD,EAAQj/B,KAAKgzC,OAAOvS,OAAOxB,MAAMqP,EAAKjP,MAAM/wB,OAAOggC,EAAKxG,OAAOxI,SAASL,IAE1E,OAAOA,G,aAOTqW,iBAAA,SAAiB9G,EAAKF,G,IAChB6G,EAAMvB,EAAoBvU,E,OAC1BiP,EAAKvO,MACP6T,EAAW5zC,KAAKgzC,OAAOvS,OAAOoH,MAAMyG,EAAKvO,OAC3B+F,OAEF9lC,KAAK00C,WAAWd,EAAStlC,OAAOggC,EAAKxG,SAC/C9nC,KAAKq1C,aAAa7G,GAFlB2G,EAAOn1C,KAAKw1C,MAAM5B,EAAUtF,EAAKxG,MAAOwG,EAAKyD,qBAM/C1S,EADWr/B,KAAKgzC,OAAOvS,OAAOxB,MAAMqP,EAAKjP,MACzB/wB,OAAOggC,EAAKxG,OAC5B9nC,KAAKm0C,eAAe9U,IAEtBvB,IAAI2X,EAAUz1C,KAAK6zC,IAEnB,GAAID,GAAYA,EAAS9N,OACvB9lC,KAAK40C,WAAWpG,QACX,GAAIF,EAAKoH,WACd11C,KAAK40C,WAAWpG,GAChBF,EAAKoH,WAAWlH,EAAKxuC,KAAKgzC,OAAOvS,QAAQ3/B,SAAO,SAACi/B,GAAA,OAAQ//B,EAAK00C,WAAW3U,UACpE,CACLjC,IAAI6X,EAAarH,EAAKsH,eACG,iBAAdD,EAAwBA,EAAanH,EAAI5hB,cAAc+oB,GACpC,mBAAdA,IAA0BA,EAAaA,EAAWnH,IAC7DmH,IAAYA,EAAanH,GAC9BxuC,KAAK61C,WAAWrH,EAAKmH,GAAY,GACjC31C,KAAK0uC,OAAOiH,EAAYR,GAEtBA,IAAQn1C,KAAKm1C,KAAKM,GAAUz1C,KAAKoO,QACjCixB,GAAMr/B,KAAKq0C,kBAAkBhV,EAAMoW,I,aAOzC/G,OAAA,SAAO1kC,EAAQmrC,EAAMlL,EAAYC,GAE/B,IADApM,IAAIzqB,EAAQ42B,GAAc,EACjBuE,EAAMvE,EAAajgC,EAAOyjB,WAAWwc,GAAcjgC,EAAO6jB,WAC1DyX,EAAkB,MAAZ4E,EAAmB,KAAOlgC,EAAOyjB,WAAWyc,GACtDsE,GAAOlJ,EAAKkJ,EAAMA,EAAIsG,cAAezhC,EACxCrT,KAAK81C,YAAY9rC,EAAQqJ,GACzBrT,KAAK8zC,OAAOtF,GACR2G,GAAQxF,GAAUtuC,eAAemtC,EAAIiG,SAAS98B,gBAChD3X,KAAKm1C,KAAKA,GAEdn1C,KAAK81C,YAAY9rC,EAAQqJ,I,aAM3B0iC,UAAA,SAAUhW,GAER,IADAjC,IAAIkY,EAAOb,EACFhN,EAAQnoC,KAAKoO,KAAM+5B,GAAS,EAAGA,IAAS,CAC/CrK,IAAImY,EAAKj2C,KAAK6nC,MAAMM,GAChBpE,EAAQkS,EAAGpJ,aAAa9M,GAC5B,GAAIgE,KAAWiS,GAASA,EAAM70C,OAAS4iC,EAAM5iC,UAC3C60C,EAAQjS,EACRoR,EAAOc,GACFlS,EAAM5iC,QAAQ,MAErB,GAAI80C,EAAG/D,MAAO,MAEhB,IAAK8D,EAAO,OAAO,EACnBh2C,KAAKm1C,KAAKA,GACV,IAAKrX,IAAI78B,EAAI,EAAGA,EAAI+0C,EAAM70C,OAAQF,IAChCjB,KAAKk2C,WAAWF,EAAM/0C,GAAI,MAAM,GAClC,OAAO,G,aAKTyzC,WAAA,SAAW3U,GACT,GAAIA,EAAKmJ,UAAYlpC,KAAKuzC,aAAevzC,KAAK6zC,IAAI9rC,KAAM,CACtD+1B,IAAIqY,EAAQn2C,KAAKo2C,uBACbD,GAAOn2C,KAAKk2C,WAAWC,GAE7B,GAAIn2C,KAAK+1C,UAAUhW,GAAO,CACxB//B,KAAKq2C,aACLvY,IAAI+V,EAAM7zC,KAAK6zC,IACfA,EAAInB,aAAa3S,EAAKh4B,MAClB8rC,EAAIhhC,QAAOghC,EAAIhhC,MAAQghC,EAAIhhC,MAAMs5B,UAAUpM,EAAKh4B,OAEpD,IADA+1B,IAAImB,EAAQ4U,EAAI1B,YACPlxC,EAAI,EAAGA,EAAI8+B,EAAKd,MAAM99B,OAAQF,IAChC4yC,EAAI9rC,OAAQ8rC,EAAI9rC,KAAK8qC,eAAe9S,EAAKd,MAAMh+B,GAAG8G,QACrDk3B,EAAQc,EAAKd,MAAMh+B,GAAGq+B,SAASL,IAEnC,OADA4U,EAAIpwC,QAAQ0R,KAAK4qB,EAAKV,KAAKJ,KACpB,EAET,OAAO,G,aAMTuW,MAAA,SAAMztC,EAAM+/B,EAAOwO,GACjBxY,IAAIyY,EAAKv2C,KAAK+1C,UAAUhuC,EAAKuG,OAAOw5B,IAEpC,OADIyO,GAAIv2C,KAAKk2C,WAAWnuC,EAAM+/B,GAAO,EAAMwO,GACpCC,G,aAITL,WAAA,SAAWnuC,EAAM+/B,EAAOoK,EAAOoE,GAC7Bt2C,KAAKq2C,aACLvY,IAAI+V,EAAM7zC,KAAK6zC,IACfA,EAAInB,aAAa3qC,GACjB8rC,EAAIhhC,MAAQghC,EAAIhhC,OAASghC,EAAIhhC,MAAMs5B,UAAUpkC,EAAM+/B,GACnDhK,IAAI34B,EAAwB,MAAdmxC,GAAmC,EAAdzC,EAAI1uC,QAA2B2sC,GAAawE,GApTd,EAqT5DzC,EAAI1uC,SAAkD,GAAtB0uC,EAAIpwC,QAAQtC,SAAagE,GArTG,GAsTjEnF,KAAK6nC,MAAM1yB,KAAK,IAAI68B,GAAYjqC,EAAM+/B,EAAO+L,EAAI1B,YAAa0B,EAAI5B,aAAcC,EAAO,KAAM/sC,IAC7FnF,KAAKoO,Q,aAKPioC,WAAA,SAAW9D,GACTzU,IAAI78B,EAAIjB,KAAK6nC,MAAM1mC,OAAS,EAC5B,GAAIF,EAAIjB,KAAKoO,KAAM,CACjB,KAAOnN,EAAIjB,KAAKoO,KAAMnN,IAAKjB,KAAK6nC,MAAM5mC,EAAI,GAAGwC,QAAQ0R,KAAKnV,KAAK6nC,MAAM5mC,GAAG0tC,OAAO4D,IAC/EvyC,KAAK6nC,MAAM1mC,OAASnB,KAAKoO,KAAO,I,aAIpCugC,OAAA,WAGE,OAFA3uC,KAAKoO,KAAO,EACZpO,KAAKq2C,WAAWr2C,KAAKizC,QACdjzC,KAAK6nC,MAAM,GAAG8G,OAAO3uC,KAAKizC,QAAUjzC,KAAKmF,QAAQqxC,U,aAG1DrB,KAAA,SAAK3U,GACH,IAAK1C,IAAI78B,EAAIjB,KAAKoO,KAAMnN,GAAK,EAAGA,IAAK,GAAIjB,KAAK6nC,MAAM5mC,IAAMu/B,EAExD,YADAxgC,KAAKoO,KAAOnN,IAKhBohC,GAAIoU,WAAA,eACFz2C,KAAKq2C,aAEL,IADAvY,IAAI/hB,EAAM,EACD9a,EAAIjB,KAAKoO,KAAMnN,GAAK,EAAGA,IAAK,CAEnC,IADA68B,IAAIr6B,EAAUzD,KAAK6nC,MAAM5mC,GAAGwC,QACnB6oB,EAAI7oB,EAAQtC,OAAS,EAAGmrB,GAAK,EAAGA,IACvCvQ,GAAOtY,EAAQ6oB,GAAG4Y,SAChBjkC,GAAG8a,IAET,OAAOA,G,aAGT+5B,YAAA,SAAY9rC,EAAQ+9B,GAClB,GAAI/nC,KAAKma,KAAM,IAAK2jB,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKma,KAAKhZ,OAAQF,IAC/CjB,KAAKma,KAAKlZ,GAAG8+B,MAAQ/1B,GAAUhK,KAAKma,KAAKlZ,GAAG8mC,QAAUA,IACxD/nC,KAAKma,KAAKlZ,GAAG8a,IAAM/b,KAAKy2C,a,aAI9B7B,WAAA,SAAW5qC,GACT,GAAIhK,KAAKma,KAAM,IAAK2jB,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKma,KAAKhZ,OAAQF,IAC3B,MAApBjB,KAAKma,KAAKlZ,GAAG8a,KAAkC,GAAnB/R,EAAO4pC,UAAiB5pC,EAAO0sC,SAAS12C,KAAKma,KAAKlZ,GAAG8+B,QACnF//B,KAAKma,KAAKlZ,GAAG8a,IAAM/b,KAAKy2C,a,aAI9BZ,WAAA,SAAW7rC,EAAQvG,EAASy/B,GAC1B,GAAIl5B,GAAUvG,GAAWzD,KAAKma,KAAM,IAAK2jB,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKma,KAAKhZ,OAAQF,IAAK,CAC7E,GAAwB,MAApBjB,KAAKma,KAAKlZ,GAAG8a,KAAkC,GAAnB/R,EAAO4pC,UAAiB5pC,EAAO0sC,SAAS12C,KAAKma,KAAKlZ,GAAG8+B,MACzEt8B,EAAQkzC,wBAAwB32C,KAAKma,KAAKlZ,GAAG8+B,OAC5CmD,EAAS,EAAI,KACtBljC,KAAKma,KAAKlZ,GAAG8a,IAAM/b,KAAKy2C,c,aAKhC9B,WAAA,SAAWiC,GACT,GAAI52C,KAAKma,KAAM,IAAK2jB,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKma,KAAKhZ,OAAQF,IAC/CjB,KAAKma,KAAKlZ,GAAG8+B,MAAQ6W,IACvB52C,KAAKma,KAAKlZ,GAAG8a,IAAM/b,KAAKy2C,YAAcG,EAAStC,UAAUnzC,OAASnB,KAAKma,KAAKlZ,GAAG8mC,U,aAOrFmH,eAAA,SAAerlC,G,WACb,GAAIA,EAAQsJ,QAAQ,MAAQ,EAC1B,OAAOtJ,EAAQtD,MAAM,YAAY0T,KAAKja,KAAKkvC,eAAgBlvC,MAE7D89B,IAAIrgB,EAAQ5T,EAAQtD,MAAM,KACtBswC,EAAS72C,KAAKmF,QAAQ0E,QACtBitC,IAAW92C,KAAKizC,QAAY4D,GAAUA,EAAO7sC,OAAOjC,MAAQ/H,KAAK6nC,MAAM,GAAG9/B,MAC1EgvC,IAAaF,EAASA,EAAO1O,MAAQ,EAAI,IAAM2O,EAAU,EAAI,GAoBjE,OAnBY,SAARjkC,EAAS5R,EAAGknC,GACd,KAAOlnC,GAAK,EAAGA,IAAK,CAClB68B,IAAI5S,EAAOzN,EAAMxc,GACjB,GAAY,IAARiqB,EAAY,CACd,GAAIjqB,GAAKwc,EAAMtc,OAAS,GAAU,GAALF,EAAQ,SACrC,KAAOknC,GAAS4O,EAAU5O,IACxB,GAAIt1B,EAAM5R,EAAI,EAAGknC,GAAQ,OAAO,EAClC,OAAO,EAEPrK,IAAIjtB,EAAOs3B,EAAQ,GAAe,GAATA,GAAc2O,EAAW92C,EAAK6nC,MAAMM,GAAOpgC,KAC9D8uC,GAAU1O,GAAS4O,EAAWF,EAAO9W,KAAKoI,EAAQ4O,GAAUhvC,KAC5D,KACN,IAAK8I,GAASA,EAAKpR,MAAQyrB,IAAsC,GAA9Bra,EAAK4f,OAAOtd,QAAQ+X,GACrD,OAAO,EACTid,IAGJ,OAAO,EAEFt1B,CAAM4K,EAAMtc,OAAS,EAAGnB,KAAKoO,O,aAGtCgoC,qBAAA,WACEtY,IAAIkZ,EAAWh3C,KAAKmF,QAAQ0E,QAC5B,GAAImtC,EAAU,IAAKlZ,IAAIwL,EAAI0N,EAAS7O,MAAOmB,GAAK,EAAGA,IAAK,CACtDxL,IAAImZ,EAAQD,EAASjX,KAAKuJ,GAAG4N,eAAeF,EAAS3O,WAAWiB,IAAIgD,YACpE,GAAI2K,GAASA,EAAME,aAAeF,EAAMG,aAAc,OAAOH,EAE/D,IAAKnZ,IAAIr+B,KAAQO,KAAKgzC,OAAOvS,OAAOoH,MAAO,CACzC/J,IAAI/1B,EAAO/H,KAAKgzC,OAAOvS,OAAOoH,MAAMpoC,GACpC,GAAIsI,EAAKovC,aAAepvC,EAAKqvC,aAAc,OAAOrvC,I,aAItDosC,eAAA,SAAe9U,GACbvB,IAAIiG,EAAQgP,GAAkB1T,EAAMr/B,KAAK6zC,IAAI5B,cACzClO,GAAO/jC,KAAK6zC,IAAIzB,WAAWj9B,KAAK4uB,GACpC/jC,KAAK6zC,IAAI5B,aAAe5S,EAAKC,SAASt/B,KAAK6zC,IAAI5B,e,aAGjDoC,kBAAA,SAAkBhV,EAAMgY,GACtB,IAAKvZ,IAAIqK,EAAQnoC,KAAKoO,KAAM+5B,GAAS,EAAGA,IAAS,CAC/CrK,IAAIwZ,EAAQt3C,KAAK6nC,MAAMM,GAEvB,GADYmP,EAAMrF,aAAasF,YAAYlY,IAC9B,EACXiY,EAAMrF,aAAe5S,EAAKI,cAAc6X,EAAMrF,kBACzC,CACLqF,EAAMnF,YAAc9S,EAAKI,cAAc6X,EAAMnF,aAC7CrU,IAAI0Z,EAAYF,EAAM9E,iBAAiBnT,EAAKt3B,MACxCyvC,IAAWF,EAAMnF,YAAcqF,EAAUlY,SAASgY,EAAMnF,cAE9D,GAAImF,GAASD,EAAM,Q,qCAGxB,I,ICrsBYI,GASX,SAAY5P,EAAO5I,GAGjBj/B,KAAK6nC,MAAQA,GAAS,GAGtB7nC,KAAKi/B,MAAQA,GAAS,IAmJ1B,SAASyY,GAAY32C,GACnB+8B,IAAIj7B,EAAS,GACb,IAAKi7B,IAAIr+B,KAAQsB,EAAK,CACpB+8B,IAAI6Z,EAAQ52C,EAAItB,GAAM0iC,KAAKwV,MACvBA,IAAO90C,EAAOpD,GAAQk4C,GAE5B,OAAO90C,EAGT,SAASu7B,GAAIj5B,GAEX,OAAOA,EAAQxC,UAAY7C,OAAO6C,S,aAtJlCi1C,kBAAA,SAAkBC,EAAU1yC,EAAcE,G,0BAAJ,IAC/BA,IAAQA,EAAS+4B,GAAIj5B,GAAS2yC,0BAEnCha,IAAI+V,EAAMxuC,EAAQ2nC,EAAS,KA4B3B,OA3BA6K,EAAS/2C,SAAO,SAACi/B,GACf,GAAIiN,GAAUjN,EAAKd,MAAM99B,OAAQ,CAC1B6rC,IAAQA,EAAS,IAEtB,IADAlP,IAAIia,EAAO,EAAGC,EAAW,EAClBD,EAAO/K,EAAO7rC,QAAU62C,EAAWjY,EAAKd,MAAM99B,QAAQ,CAC3D28B,IAAIjtB,EAAOkvB,EAAKd,MAAM+Y,GACtB,GAAKh4C,EAAKi/B,MAAMpuB,EAAK9I,KAAKtI,MAA1B,CACA,IAAKoR,EAAKsyB,GAAG6J,EAAO+K,MAAsC,IAA5BlnC,EAAK9I,KAAKo6B,KAAK8V,SAAoB,MACjEF,GAAQ,EAAGC,SAFwBA,IAIrC,KAAOD,EAAO/K,EAAO7rC,QACnB0yC,EAAM7G,EAAOQ,MACbR,EAAOQ,MAET,KAAOwK,EAAWjY,EAAKd,MAAM99B,QAAQ,CACnC28B,IAAI3zB,EAAM41B,EAAKd,MAAM+Y,KACjBE,EAAUl4C,EAAKm4C,cAAchuC,EAAK41B,EAAKmJ,SAAU/jC,GACjD+yC,IACFlL,EAAO73B,KAAKhL,EAAK0pC,GACjBA,EAAI5lC,YAAYiqC,EAAQ1J,KACxBqF,EAAMqE,EAAQvC,YAAcuC,EAAQ1J,MAI1CqF,EAAI5lC,YAAYjO,EAAKo4C,cAAcrY,EAAM56B,OAGpCE,G,aAST+yC,cAAA,SAAcrY,EAAM56B,Q,UAAU,IAC9B,IAAF,EACQsyC,GAAcY,WAAWja,GAAIj5B,GAAUnF,KAAK6nC,MAAM9H,EAAKh4B,KAAKtI,MAAMsgC,IADjEyO,EAAA,EAAAA,IAAKmH,EAAA,EAAAA,WAEV,GAAIA,EAAY,CACd,GAAI5V,EAAK+F,OACP,MAAM,IAAIhH,WAAW,gDACnB35B,EAAQmzC,UACVnzC,EAAQmzC,UAAUvY,EAAM4V,EAAYxwC,GAEpCnF,KAAK43C,kBAAkB7X,EAAKt8B,QAAS0B,EAASwwC,GAElD,OAAOnH,G,aAGT+J,sBAAA,SAAsBxY,EAAM56B,Q,UAAU,IAEpC,IADA24B,IAAI0Q,EAAMxuC,KAAKo4C,cAAcrY,EAAM56B,GAC1BlE,EAAI8+B,EAAKd,MAAM99B,OAAS,EAAGF,GAAK,EAAGA,IAAK,CAC/C68B,IAAIwU,EAAOtyC,KAAKm4C,cAAcpY,EAAKd,MAAMh+B,GAAI8+B,EAAKmJ,SAAU/jC,GACxDmtC,KACAA,EAAKqD,YAAcrD,EAAK9D,KAAKvgC,YAAYugC,GAC3CA,EAAM8D,EAAK9D,KAGf,OAAOA,G,aAGT2J,cAAA,SAAc9Y,EAAMiO,EAAQnoC,Q,UAAU,IACpC24B,IAAI6Z,EAAQ33C,KAAKi/B,MAAMI,EAAKt3B,KAAKtI,MACjC,OAAOk4C,GAASF,GAAcY,WAAWja,GAAIj5B,GAAUwyC,EAAMtY,EAAMiO,KAOrE,GAAO+K,WAAA,SAAWja,EAAKoa,EAAWC,GAChC,Q,UADwC,MAChB,iBAAbD,EACT,MAAO,CAAChK,IAAKpQ,EAAI5Q,eAAegrB,IAClC,GAA0B,MAAtBA,EAAU5E,SACZ,MAAO,CAACpF,IAAKgK,GACf,GAAIA,EAAUhK,KAAiC,MAA1BgK,EAAUhK,IAAIoF,SACjC,OAAO4E,EACT1a,IAAI4a,EAAUF,EAAU,GAAIG,EAAQD,EAAQvlC,QAAQ,KAChDwlC,EAAQ,IACVF,EAAQC,EAAQ31C,MAAM,EAAG41C,GACzBD,EAAUA,EAAQ31C,MAAM41C,EAAQ,IAElC7a,IAAI6X,EAAa,KAAMnH,EAAMiK,EAAQra,EAAIwa,gBAAgBH,EAAOC,GAAWta,EAAIllB,cAAcw/B,GACzF5Q,EAAQ0Q,EAAU,GAAIjT,EAAQ,EAClC,GAAIuC,GAAyB,UAAhB,EAAOA,IAAuC,MAAlBA,EAAM8L,WAAqB1+B,MAAM5U,QAAQwnC,GAEhF,IAAKhK,IAAIr+B,KADT8lC,EAAQ,EACSuC,EAAO,GAAmB,MAAfA,EAAMroC,GAAe,CAC/Cq+B,IAAI6a,EAAQl5C,EAAK0T,QAAQ,KACrBwlC,EAAQ,EAAGnK,EAAIqK,eAAep5C,EAAKsD,MAAM,EAAG41C,GAAQl5C,EAAKsD,MAAM41C,EAAQ,GAAI7Q,EAAMroC,IAChF+uC,EAAI7gB,aAAaluB,EAAMqoC,EAAMroC,IAGtC,IAAKq+B,IAAI78B,EAAIskC,EAAOtkC,EAAIu3C,EAAUr3C,OAAQF,IAAK,CAC7C68B,IAAIuH,EAAQmT,EAAUv3C,GACtB,GAAc,IAAVokC,EAAa,CACf,GAAIpkC,EAAIu3C,EAAUr3C,OAAS,GAAKF,EAAIskC,EAClC,MAAM,IAAIzG,WAAW,0DACvB,MAAO,KAAC0P,EAAKmH,WAAYnH,GAE3B,IAAN,EAAqDiJ,GAAcY,WAAWja,EAAKiH,EAAOoT,GAAxE5R,EAAA,MAAmBiS,EAAA,aAE7B,GADAtK,EAAIvgC,YAAY44B,GACZiS,EAAc,CAChB,GAAInD,EAAY,MAAM,IAAI7W,WAAW,0BACrC6W,EAAamD,GAInB,MAAO,KAACtK,EAAG,WAAEmH,IAMf,GAAOlG,WAAA,SAAWhP,GAChB,OAAOA,EAAOoJ,OAAOkP,gBAClBtY,EAAOoJ,OAAOkP,cAAgB,IAAItB,GAAcz3C,KAAKg5C,gBAAgBvY,GAASzgC,KAAKi5C,gBAAgBxY,MAMxG,GAAOuY,gBAAA,SAAgBvY,GACrB3C,IAAIj7B,EAAS60C,GAAYjX,EAAOoH,OAEhC,OADKhlC,EAAO09B,OAAM19B,EAAO09B,KAAI,SAAGR,GAAA,OAAQA,EAAKQ,OACtC19B,GAKT,GAAOo2C,gBAAA,SAAgBxY,GACrB,OAAOiX,GAAYjX,EAAOxB,S,gaCrJxBia,EAAWt5C,KAAKu5C,IAAI,EAAG,IAG7B,SAASC,EAAa30C,GAAS,OAJf,MAIsBA,EAKtC,IAAa40C,EACX,SAAYt9B,EAAKu9B,EAAiBC,Q,WAAP,Q,UAAiB,MAE1Cv5C,KAAK+b,IAAMA,EAGX/b,KAAKs5C,QAAUA,EACft5C,KAAKu5C,QAAUA,GASNC,EAKX,SAAYC,EAAQC,Q,WAAW,GAC7B15C,KAAKy5C,OAASA,EACdz5C,KAAK05C,SAAWA,GAGpB,YAAEH,QAAA,SAAQ90C,GACN,IAAIk1C,EAAO,EAAGtmC,EAAQ+lC,EAAa30C,GACnC,IAAKzE,KAAK05C,SAAU,IAAK5b,IAAI78B,EAAI,EAAGA,EAAIoS,EAAOpS,IAC7C04C,GAAQ35C,KAAKy5C,OAAW,EAAJx4C,EAAQ,GAAKjB,KAAKy5C,OAAW,EAAJx4C,EAAQ,GACvD,OAAOjB,KAAKy5C,OAAe,EAARpmC,GAAasmC,EAlCpC,SAAuBl1C,GAAS,OAAQA,GALxB,MAKiCA,IAAoBy0C,EAkC1BU,CAAcn1C,IAIzD,YAAEo1C,UAAA,SAAU99B,EAAK+9B,GAAa,Y,UAAL,GAAY95C,KAAK+5C,KAAKh+B,EAAK+9B,GAAO,IAG3D,YAAE//B,IAAA,SAAIgC,EAAK+9B,GAAa,Y,UAAL,GAAY95C,KAAK+5C,KAAKh+B,EAAK+9B,GAAO,IAErD,YAAEC,KAAA,SAAKh+B,EAAK+9B,EAAOpzC,GAEf,IADA,IAAIizC,EAAO,EAAGK,EAAWh6C,KAAK05C,SAAW,EAAI,EAAGO,EAAWj6C,KAAK05C,SAAW,EAAI,EACtEz4C,EAAI,EAAGA,EAAIjB,KAAKy5C,OAAOt4C,OAAQF,GAAK,EAAG,CAC9C68B,IAAIyH,EAAQvlC,KAAKy5C,OAAOx4C,IAAMjB,KAAK05C,SAAWC,EAAO,GACrD,GAAIpU,EAAQxpB,EAAK,MACjB+hB,IAAIoc,EAAUl6C,KAAKy5C,OAAOx4C,EAAI+4C,GAAWG,EAAUn6C,KAAKy5C,OAAOx4C,EAAIg5C,GAAW3U,EAAMC,EAAQ2U,EAC5F,GAAIn+B,GAAOupB,EAAK,CAChB,IACMziC,EAAS0iC,EAAQoU,IADTO,EAAkBn+B,GAAOwpB,GAAS,EAAIxpB,GAAOupB,EAAM,EAAIwU,EAA7CA,GACc,EAAI,EAAIK,GAC5C,GAAIzzC,EAAQ,OAAO7D,EACrB,IAAM02C,EAAUx9B,IAAQ+9B,EAAQ,EAAIvU,EAAQD,GAAO,KAAmBrkC,EAAI,GAAG8a,EAAMwpB,GAvD3B2T,EAwDtD,OAAO,IAAIG,EAAUx2C,EAAQi3C,EAAQ,EAAI/9B,GAAOwpB,EAAQxpB,GAAOupB,EAAKiU,GAEtEI,GAAQQ,EAAUD,EAEpB,OAAOxzC,EAASqV,EAAM49B,EAAO,IAAIN,EAAUt9B,EAAM49B,IAGrD,YAAES,QAAA,SAAQr+B,EAAKw9B,GAGX,IAFA,IAAII,EAAO,EAAGtmC,EAAQ+lC,EAAaG,GAC/BS,EAAWh6C,KAAK05C,SAAW,EAAI,EAAGO,EAAWj6C,KAAK05C,SAAW,EAAI,EAC5Dz4C,EAAI,EAAGA,EAAIjB,KAAKy5C,OAAOt4C,OAAQF,GAAK,EAAG,CAC9C68B,IAAIyH,EAAQvlC,KAAKy5C,OAAOx4C,IAAMjB,KAAK05C,SAAWC,EAAO,GACrD,GAAIpU,EAAQxpB,EAAK,MACjB+hB,IAAIoc,EAAUl6C,KAAKy5C,OAAOx4C,EAAI+4C,GAC9B,GAAIj+B,GAD2CwpB,EAAQ2U,GACrCj5C,GAAa,EAARoS,EAAW,OAAO,EAC3C,GAAUrT,KAAKy5C,OAAOx4C,EAAIg5C,GAAYC,EAEtC,OAAO,GAMX,YAAEp5C,QAAA,SAAQuD,GAEN,IADA,IAAI21C,EAAWh6C,KAAK05C,SAAW,EAAI,EAAGO,EAAWj6C,KAAK05C,SAAW,EAAI,EAC5Dz4C,EAAI,EAAG04C,EAAO,EAAG14C,EAAIjB,KAAKy5C,OAAOt4C,OAAQF,GAAK,EAAG,CACxD68B,IAAIyH,EAAQvlC,KAAKy5C,OAAOx4C,GAAIo5C,EAAW9U,GAASvlC,KAAK05C,SAAWC,EAAO,GAAIW,EAAW/U,GAASvlC,KAAK05C,SAAW,EAAIC,GAC/GO,EAAUl6C,KAAKy5C,OAAOx4C,EAAI+4C,GAAWG,EAAUn6C,KAAKy5C,OAAOx4C,EAAIg5C,GACnE51C,EAAEg2C,EAAUA,EAAWH,EAASI,EAAUA,EAAWH,GACrDR,GAAQQ,EAAUD,IAOxB,YAAEK,OAAA,WACE,OAAO,IAAIf,EAAQx5C,KAAKy5C,QAASz5C,KAAK05C,WAG1C,YAAEv5C,SAAA,WACE,OAAQH,KAAK05C,SAAW,IAAM,IAAM97B,KAAKC,UAAU7d,KAAKy5C,SAO1D,EAAO1R,OAAA,SAAOlvB,GACZ,OAAY,GAALA,EAAS2gC,EAAQvZ,MAAQ,IAAIuZ,EAAQ3gC,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,KAI5E2gC,EAAQvZ,MAAQ,IAAIuZ,EAAQ,IAS5B,IAAagB,EAGX,SAAYC,EAAMC,EAAQnoB,EAAMiO,GAG9BxgC,KAAKy6C,KAAOA,GAAQ,GAIpBz6C,KAAKuyB,KAAOA,GAAQ,EAGpBvyB,KAAKwgC,GAAW,MAANA,EAAaxgC,KAAKy6C,KAAKt5C,OAASq/B,EAC1CxgC,KAAK06C,OAASA,GCjKX,SAASC,EAAex4B,GAC7B2b,IAAI6M,EAAM/2B,MAAMpT,KAAKR,KAAMmiB,GAE3B,OADAwoB,EAAI3jB,UAAY2zB,EAAet6C,UACxBsqC,EDmKT,YAAE5nC,MAAA,SAAMwvB,EAAUiO,GACd,Y,UADW,Q,UAAQxgC,KAAKy6C,KAAKt5C,QACtB,IAAIq5C,EAAQx6C,KAAKy6C,KAAMz6C,KAAK06C,OAAQnoB,EAAMiO,IAGrD,YAAE+F,KAAA,WACE,OAAO,IAAIiU,EAAQx6C,KAAKy6C,KAAK13C,QAAS/C,KAAK06C,QAAU16C,KAAK06C,OAAO33C,QAAS/C,KAAKuyB,KAAMvyB,KAAKwgC,KAO9F,YAAEoa,UAAA,SAAU7gC,EAAK8gC,GACb76C,KAAKwgC,GAAKxgC,KAAKy6C,KAAKtlC,KAAK4E,GACV,MAAX8gC,GAAiB76C,KAAK86C,UAAU96C,KAAKy6C,KAAKt5C,OAAS,EAAG05C,IAM9D,YAAEE,cAAA,SAAcnc,GACZ,IAAKd,IAAI78B,EAAI,EAAG+5C,EAAYh7C,KAAKy6C,KAAKt5C,OAAQF,EAAI29B,EAAQ6b,KAAKt5C,OAAQF,IAAK,CAC5E,IAAMg6C,EAAOrc,EAAQsc,UAAUj6C,GAC/B,KAAO25C,UAAUhc,EAAQ6b,KAAKx5C,GAAY,MAARg6C,GAAgBA,EAAOh6C,EAAI+5C,EAAYC,EAAO,QAQpF,YAAEC,UAAA,SAAUriC,GACR,GAAI7Y,KAAK06C,OAAQ,IAAK5c,IAAI78B,EAAI,EAAGA,EAAIjB,KAAK06C,OAAOv5C,OAAQF,IACvD,GAAIjB,KAAK06C,OAAOz5C,IAAM4X,EAAG,OAAO7Y,KAAK06C,OAAOz5C,GAAKA,EAAI,GAAK,EAAI,KAGpE,YAAE65C,UAAA,SAAUjiC,EAAG2M,GACNxlB,KAAK06C,SAAQ16C,KAAK06C,OAAS,IAChC16C,KAAK06C,OAAOvlC,KAAK0D,EAAG2M,IAKxB,YAAE21B,sBAAA,SAAsBvc,GACpB,IAAKd,IAAI78B,EAAI29B,EAAQ6b,KAAKt5C,OAAS,EAAGi6C,EAAYp7C,KAAKy6C,KAAKt5C,OAASy9B,EAAQ6b,KAAKt5C,OAAQF,GAAK,EAAGA,IAAK,CACvG,IAAMg6C,EAAOrc,EAAQsc,UAAUj6C,GAC7BjB,KAAK46C,UAAUhc,EAAQ6b,KAAKx5C,GAAGs5C,SAAkB,MAARU,GAAgBA,EAAOh6C,EAAIm6C,EAAYH,EAAO,EAAI,QAMjG,YAAEV,OAAA,WACEzc,IAAIud,EAAU,IAAIb,EAElB,OADAa,EAAQF,sBAAsBn7C,MACvBq7C,GAKX,YAAEthC,IAAA,SAAIgC,EAAK+9B,GACP,Q,UADe,GACX95C,KAAK06C,OAAQ,OAAO16C,KAAK+5C,KAAKh+B,EAAK+9B,GAAO,GAC9C,IAAKhc,IAAI78B,EAAIjB,KAAKuyB,KAAMtxB,EAAIjB,KAAKwgC,GAAIv/B,IACnC8a,EAAM/b,KAAKy6C,KAAKx5C,GAAG8Y,IAAIgC,EAAK+9B,GAC9B,OAAO/9B,GAMX,YAAE89B,UAAA,SAAU99B,EAAK+9B,GAAa,Y,UAAL,GAAY95C,KAAK+5C,KAAKh+B,EAAK+9B,GAAO,IAE3D,YAAEC,KAAA,SAAKh+B,EAAK+9B,EAAOpzC,GAGf,IAFAo3B,IAAIwb,GAAU,EAELr4C,EAAIjB,KAAKuyB,KAAMtxB,EAAIjB,KAAKwgC,GAAIv/B,IAAK,CAC1C,IAA0B4B,EAAd7C,KAAKy6C,KAAKx5C,GAAiB44C,UAAU99B,EAAK+9B,GACpD,GAAsB,MAAlBj3C,EAAO02C,QAAiB,CAC5B,IAAM+B,EAAOt7C,KAAKk7C,UAAUj6C,GAC1B,GAAY,MAARq6C,GAAgBA,EAAOr6C,GAAKq6C,EAAOt7C,KAAKwgC,GAAI,CAChD,EAAM8a,EACJv/B,EAAM/b,KAAKy6C,KAAKa,GAAM/B,QAAQ12C,EAAO02C,SACrC,UAIA12C,EAAOy2C,UAASA,GAAU,GAC9Bv9B,EAAMlZ,EAAOkZ,IAGf,OAAOrV,EAASqV,EAAM,IAAIs9B,EAAUt9B,EAAKu9B,IC1P7CqB,EAAet6C,UAAYD,OAAOkO,OAAOsF,MAAMvT,WAC/Cs6C,EAAet6C,UAAUmB,YAAcm5C,EACvCA,EAAet6C,UAAUZ,KAAO,iBAOhC,IAAa87C,EAGX,SAAYnd,GAIVp+B,KAAKo+B,IAAMA,EAGXp+B,KAAK2+B,MAAQ,GAGb3+B,KAAKw7C,KAAO,GAGZx7C,KAAK4+B,QAAU,IAAI4b,G,sDACpB,IC9BH,SAASiB,IAAiB,MAAM,IAAI7nC,MAAM,eDiC1C,EAAMsvB,OAAA,eAAW,OAAOljC,KAAKw7C,KAAKr6C,OAASnB,KAAKw7C,KAAK,GAAKx7C,KAAKo+B,KAK/D,YAAEljB,KAAA,SAAKtW,GACH,IAAI/B,EAAS7C,KAAK07C,UAAU92C,GAC5B,GAAI/B,EAAO84C,OAAQ,MAAM,IAAIhB,EAAe93C,EAAO84C,QACnD,OAAO37C,MAMX,YAAE07C,UAAA,SAAUxgC,GACR,IAAIrY,EAASqY,EAAKvO,MAAM3M,KAAKo+B,KAE7B,OADKv7B,EAAO84C,QAAQ37C,KAAK2/B,QAAQzkB,EAAMrY,EAAOu7B,KACvCv7B,GAMX,EAAM+4C,WAAA,eACF,OAAO57C,KAAK2+B,MAAMx9B,OAAS,GAG/B,YAAEw+B,QAAA,SAAQzkB,EAAMkjB,GACZp+B,KAAKw7C,KAAKrmC,KAAKnV,KAAKo+B,KACpBp+B,KAAK2+B,MAAMxpB,KAAK+F,GAChBlb,KAAK4+B,QAAQgc,UAAU1/B,EAAK2gC,UAC5B77C,KAAKo+B,IAAMA,G,oCAEd,GChEDH,IAAM6d,EAAY17C,OAAOkO,OAAO,MAWnBytC,EAAI,a,YAMfpvC,MAAA,SAAMqvC,GAAQ,OAAOP,KAMvB,YAAEI,OAAA,WAAW,OAAOrC,EAAQvZ,OAK5B,YAAEsa,OAAA,SAAOyB,GAAQ,OAAOP,KAMxB,YAAE1hC,IAAA,SAAIkiC,GAAY,OAAOR,KAMzB,YAAE74C,MAAA,SAAMs5C,GAAU,OAAO,MAOzB,YAAEzmB,OAAA,WAAW,OAAOgmB,KAKlB,EAAO/X,SAAA,SAASjD,EAAQkD,GACtB,IAAKA,IAASA,EAAKwY,SAAU,MAAM,IAAIrd,WAAW,mCAClD,IAAI/2B,EAAO+zC,EAAUnY,EAAKwY,UAC1B,IAAKp0C,EAAM,MAAM,IAAI+2B,WAAU,gBAAiB6E,EAAKwY,SAAQ,YAC7D,OAAOp0C,EAAK27B,SAASjD,EAAQkD,IAQ/B,EAAOyY,OAAA,SAAO7sC,EAAI8sC,GAChB,GAAI9sC,KAAMusC,EAAW,MAAM,IAAIhd,WAAW,iCAAmCvvB,GAG7E,OAFAusC,EAAUvsC,GAAM8sC,EAChBA,EAAUh8C,UAAU+7C,OAAS7sC,EACtB8sC,GAMX,IAAaC,EAEX,SAAYle,EAAKud,GAEf37C,KAAKo+B,IAAMA,EAEXp+B,KAAK27C,OAASA,GAKhB,EAAOpF,GAAA,SAAGnY,GAAO,OAAO,IAAIke,EAAWle,EAAK,OAI5C,EAAOme,KAAA,SAAKp6B,GAAW,OAAO,IAAIm6B,EAAW,KAAMn6B,IAMrD,EAASq6B,YAAA,SAAYpe,EAAK7L,EAAMiO,EAAIz9B,GAChC,IACE,OAAOu5C,EAAW/F,GAAGnY,EAAI76B,QAAQgvB,EAAMiO,EAAIz9B,IAC3C,MAAOwQ,GACP,GAAIA,aAAa,eAAc,OAAO+oC,EAAWC,KAAKhpC,EAAE4O,SACxD,MAAM5O,ICpGZ,IAAakpC,EAAW,YAStB,WAAYlqB,EAAMiO,EAAIz9B,EAAOy1C,GAC3Bta,OAAK,MACLl+B,KAAKuyB,KAAOA,EACZvyB,KAAKwgC,GAAKA,EACVxgC,KAAK+C,MAAQA,EACb/C,KAAKw4C,YAAcA,E,4FACpB,E,YAED7rC,MAAA,SAAMyxB,GACJ,OAAIp+B,KAAKw4C,WAAakE,EAAete,EAAKp+B,KAAKuyB,KAAMvyB,KAAKwgC,IACjD8b,EAAWC,KAAK,6CAClBD,EAAWE,YAAYpe,EAAKp+B,KAAKuyB,KAAMvyB,KAAKwgC,GAAIxgC,KAAK+C,Q,YAG9D84C,OAAA,WACE,OAAO,IAAIrC,EAAQ,CAACx5C,KAAKuyB,KAAMvyB,KAAKwgC,GAAKxgC,KAAKuyB,KAAMvyB,KAAK+C,MAAMqZ,Q,YAGjEm+B,OAAA,SAAOnc,GACL,OAAO,IAAIqe,EAAYz8C,KAAKuyB,KAAMvyB,KAAKuyB,KAAOvyB,KAAK+C,MAAMqZ,KAAMgiB,EAAIr7B,MAAM/C,KAAKuyB,KAAMvyB,KAAKwgC,M,YAG3FzmB,IAAA,SAAI6kB,GACFd,IAAIvL,EAAOqM,EAAQib,UAAU75C,KAAKuyB,KAAM,GAAIiO,EAAK5B,EAAQib,UAAU75C,KAAKwgC,IAAK,GAC7E,OAAIjO,EAAK+mB,SAAW9Y,EAAG8Y,QAAgB,KAChC,IAAImD,EAAYlqB,EAAKxW,IAAKnc,KAAKsvB,IAAIqD,EAAKxW,IAAKykB,EAAGzkB,KAAM/b,KAAK+C,Q,YAGpEH,MAAA,SAAMujB,GACJ,KAAMA,aAAiBs2B,IAAgBt2B,EAAMqyB,WAAax4C,KAAKw4C,UAAW,OAAO,KAEjF,GAAIx4C,KAAKuyB,KAAOvyB,KAAK+C,MAAMqZ,MAAQ+J,EAAMoM,MAASvyB,KAAK+C,MAAMwvC,SAAYpsB,EAAMpjB,MAAM45C,UAI9E,IAAIx2B,EAAMqa,IAAMxgC,KAAKuyB,MAASvyB,KAAK+C,MAAM45C,WAAcx2B,EAAMpjB,MAAMwvC,QAKxE,OAAO,KAJPzU,IAAI/6B,EAAQ/C,KAAK+C,MAAMqZ,KAAO+J,EAAMpjB,MAAMqZ,MAAQ,EAAI,QAAM6jB,MACtD,IAAI,QAAM9Z,EAAMpjB,MAAMU,QAAQshC,OAAO/kC,KAAK+C,MAAMU,SAAU0iB,EAAMpjB,MAAM45C,UAAW38C,KAAK+C,MAAMwvC,SAClG,OAAO,IAAIkK,EAAYt2B,EAAMoM,KAAMvyB,KAAKwgC,GAAIz9B,EAAO/C,KAAKw4C,WANxD1a,IAAI/6B,EAAQ/C,KAAK+C,MAAMqZ,KAAO+J,EAAMpjB,MAAMqZ,MAAQ,EAAI,QAAM6jB,MACtD,IAAI,QAAMjgC,KAAK+C,MAAMU,QAAQshC,OAAO5e,EAAMpjB,MAAMU,SAAUzD,KAAK+C,MAAM45C,UAAWx2B,EAAMpjB,MAAMwvC,SAClG,OAAO,IAAIkK,EAAYz8C,KAAKuyB,KAAMvyB,KAAKwgC,IAAMra,EAAMqa,GAAKra,EAAMoM,MAAOxvB,EAAO/C,KAAKw4C,Y,YAUrF/iB,OAAA,WACEqI,IAAI6F,EAAO,CAACwY,SAAU,UAAW5pB,KAAMvyB,KAAKuyB,KAAMiO,GAAIxgC,KAAKwgC,IAG3D,OAFIxgC,KAAK+C,MAAMqZ,OAAMunB,EAAK5gC,MAAQ/C,KAAK+C,MAAM0yB,UACzCz1B,KAAKw4C,YAAW7U,EAAK6U,WAAY,GAC9B7U,GAGT,EAAOD,SAAA,SAASjD,EAAQkD,GACtB,GAAwB,iBAAbA,EAAKpR,MAAsC,iBAAXoR,EAAKnD,GAC9C,MAAM,IAAI1B,WAAW,0CACvB,OAAO,IAAI2d,EAAY9Y,EAAKpR,KAAMoR,EAAKnD,GAAI,QAAMkD,SAASjD,EAAQkD,EAAK5gC,SAAU4gC,EAAK6U,Y,EA/DlE,CAASuD,GAmEjCA,EAAKK,OAAO,UAAWK,GAKvB,IAAaG,EAAiB,YAM5B,WAAYrqB,EAAMiO,EAAIqc,EAASC,EAAO/5C,EAAOusC,EAAQkJ,GACnDta,OAAK,MACLl+B,KAAKuyB,KAAOA,EACZvyB,KAAKwgC,GAAKA,EACVxgC,KAAK68C,QAAUA,EACf78C,KAAK88C,MAAQA,EACb98C,KAAK+C,MAAQA,EACb/C,KAAKsvC,OAASA,EACdtvC,KAAKw4C,YAAcA,E,4FACpB,E,YAED7rC,MAAA,SAAMyxB,GACJ,GAAIp+B,KAAKw4C,YAAckE,EAAete,EAAKp+B,KAAKuyB,KAAMvyB,KAAK68C,UACpCH,EAAete,EAAKp+B,KAAK88C,MAAO98C,KAAKwgC,KAC1D,OAAO8b,EAAWC,KAAK,iDAEzBze,IAAIif,EAAM3e,EAAIr7B,MAAM/C,KAAK68C,QAAS78C,KAAK88C,OACvC,GAAIC,EAAIJ,WAAaI,EAAIxK,QACvB,OAAO+J,EAAWC,KAAK,2BACzBze,IAAIkf,EAAWh9C,KAAK+C,MAAMk6C,SAASj9C,KAAKsvC,OAAQyN,EAAIt5C,SACpD,OAAKu5C,EACEV,EAAWE,YAAYpe,EAAKp+B,KAAKuyB,KAAMvyB,KAAKwgC,GAAIwc,GADjCV,EAAWC,KAAK,gC,YAIxCV,OAAA,WACE,OAAO,IAAIrC,EAAQ,CAACx5C,KAAKuyB,KAAMvyB,KAAK68C,QAAU78C,KAAKuyB,KAAMvyB,KAAKsvC,OAC1CtvC,KAAK88C,MAAO98C,KAAKwgC,GAAKxgC,KAAK88C,MAAO98C,KAAK+C,MAAMqZ,KAAOpc,KAAKsvC,U,YAG/EiL,OAAA,SAAOnc,GACLN,IAAIif,EAAM/8C,KAAK88C,MAAQ98C,KAAK68C,QAC5B,OAAO,IAAID,EAAkB58C,KAAKuyB,KAAMvyB,KAAKuyB,KAAOvyB,KAAK+C,MAAMqZ,KAAO2gC,EACzC/8C,KAAKuyB,KAAOvyB,KAAKsvC,OAAQtvC,KAAKuyB,KAAOvyB,KAAKsvC,OAASyN,EACnD3e,EAAIr7B,MAAM/C,KAAKuyB,KAAMvyB,KAAKwgC,IAAI0c,cAAcl9C,KAAK68C,QAAU78C,KAAKuyB,KAAMvyB,KAAK88C,MAAQ98C,KAAKuyB,MACxFvyB,KAAK68C,QAAU78C,KAAKuyB,KAAMvyB,KAAKw4C,Y,YAG9Dz+B,IAAA,SAAI6kB,GACFd,IAAIvL,EAAOqM,EAAQib,UAAU75C,KAAKuyB,KAAM,GAAIiO,EAAK5B,EAAQib,UAAU75C,KAAKwgC,IAAK,GACzEqc,EAAUje,EAAQ7kB,IAAI/Z,KAAK68C,SAAU,GAAIC,EAAQle,EAAQ7kB,IAAI/Z,KAAK88C,MAAO,GAC7E,OAAKvqB,EAAK+mB,SAAW9Y,EAAG8Y,SAAYuD,EAAUtqB,EAAKxW,KAAO+gC,EAAQtc,EAAGzkB,IAAY,KAC1E,IAAI6gC,EAAkBrqB,EAAKxW,IAAKykB,EAAGzkB,IAAK8gC,EAASC,EAAO98C,KAAK+C,MAAO/C,KAAKsvC,OAAQtvC,KAAKw4C,Y,YAG/F/iB,OAAA,WACEqI,IAAI6F,EAAO,CAACwY,SAAU,gBAAiB5pB,KAAMvyB,KAAKuyB,KAAMiO,GAAIxgC,KAAKwgC,GACrDqc,QAAS78C,KAAK68C,QAASC,MAAO98C,KAAK88C,MAAOxN,OAAQtvC,KAAKsvC,QAGnE,OAFItvC,KAAK+C,MAAMqZ,OAAMunB,EAAK5gC,MAAQ/C,KAAK+C,MAAM0yB,UACzCz1B,KAAKw4C,YAAW7U,EAAK6U,WAAY,GAC9B7U,GAGT,EAAOD,SAAA,SAASjD,EAAQkD,GACtB,GAAwB,iBAAbA,EAAKpR,MAAsC,iBAAXoR,EAAKnD,IACrB,iBAAhBmD,EAAKkZ,SAA4C,iBAAdlZ,EAAKmZ,OAA2C,iBAAfnZ,EAAK2L,OAClF,MAAM,IAAIxQ,WAAW,gDACvB,OAAO,IAAI8d,EAAkBjZ,EAAKpR,KAAMoR,EAAKnD,GAAImD,EAAKkZ,QAASlZ,EAAKmZ,MACvC,QAAMpZ,SAASjD,EAAQkD,EAAK5gC,OAAQ4gC,EAAK2L,SAAU3L,EAAK6U,Y,EA/D3D,CAASuD,GAqEvC,SAASW,EAAete,EAAK7L,EAAMiO,GAEjC,IADA1C,IAAIC,EAAQK,EAAI3e,QAAQ8S,GAAO4qB,EAAO3c,EAAKjO,EAAM4V,EAAQpK,EAAMoK,MACxDgV,EAAO,GAAKhV,EAAQ,GAAKpK,EAAMsK,WAAWF,IAAUpK,EAAMgC,KAAKoI,GAAO3B,YAC3E2B,IACAgV,IAEF,GAAIA,EAAO,EAET,IADArf,IAAIjtB,EAAOktB,EAAMgC,KAAKoI,GAAO1B,WAAW1I,EAAMsK,WAAWF,IAClDgV,EAAO,GAAG,CACf,IAAKtsC,GAAQA,EAAKi1B,OAAQ,OAAO,EACjCj1B,EAAOA,EAAKgd,WACZsvB,IAGJ,OAAO,EC5JT,SAASC,EAAOrd,EAAMwF,EAAOD,GAC3B,OAAiB,GAATC,GAAcxF,EAAKsd,WAAW9X,EAAOxF,EAAKyG,eAC/ClB,GAAOvF,EAAKyG,YAAczG,EAAKsd,WAAW,EAAG/X,IAO3C,SAASgY,EAAWC,GAGzB,IAFAzf,IACIr6B,EADS85C,EAAMvzC,OACEvG,QAAQ2iC,WAAWmX,EAAMtT,WAAYsT,EAAMrT,UACvD/B,EAAQoV,EAAMpV,SAAUA,EAAO,CACtCrK,IAAIiC,EAAOwd,EAAMxf,MAAMgC,KAAKoI,GACxB90B,EAAQkqC,EAAMxf,MAAM1qB,MAAM80B,GAAQ+B,EAAWqT,EAAMvf,IAAIqK,WAAWF,GACtE,GAAIA,EAAQoV,EAAMpV,OAASpI,EAAKsd,WAAWhqC,EAAO62B,EAAUzmC,GAC1D,OAAO0kC,EACT,GAAa,GAATA,GAAcpI,EAAKh4B,KAAKo6B,KAAKqb,YAAcJ,EAAOrd,EAAM1sB,EAAO62B,GAAW,OA+C3E,SAAS2C,EAAa0Q,EAAO3J,EAAU9L,EAAO2V,Q,UAAaF,GAChEzf,IAAI4f,EAQN,SAA6BH,EAAOx1C,GAClC,eAAakiC,EAAA,EAAAA,WAAYC,EAAA,EAAAA,SACrBwT,EAAS1zC,EAAOktC,eAAejN,GAAY4C,aAAa9kC,GAC5D,IAAK21C,EAAQ,OAAO,KACpB5f,IAAI6f,EAAQD,EAAOv8C,OAASu8C,EAAO,GAAK31C,EACxC,OAAOiC,EAAO4zC,eAAe3T,EAAYC,EAAUyT,GAASD,EAAS,KAbxDG,CAAoBN,EAAO3J,GACpC/M,EAAQ6W,GAed,SAA4BH,EAAOx1C,GACjC,eAAakiC,EAAA,EAAAA,WAAYC,EAAA,EAAAA,SACrBrD,EAAQ78B,EAAOq7B,MAAM4E,GACrB6T,EAAS/1C,EAAKolC,aAAaN,aAAahG,EAAM9+B,MAClD,IAAK+1C,EAAQ,OAAO,KAGpB,IAFAhgB,IACIigB,GADWD,EAAO38C,OAAS28C,EAAOA,EAAO38C,OAAS,GAAK4G,GACjColC,aACjBlsC,EAAIgpC,EAAY8T,GAAc98C,EAAIipC,EAAUjpC,IACnD88C,EAAaA,EAAW5R,UAAUniC,EAAOq7B,MAAMpkC,GAAG8G,MACpD,IAAKg2C,IAAeA,EAAW3T,SAAU,OAAO,KAChD,OAAO0T,EAzBeE,CAAmBP,EAAY7J,GACrD,OAAK/M,EACE6W,EAAO3jC,IAAIkkC,GAAWpzC,OAAO,CAAC9C,KAAM6rC,EAAQ,MAAE9L,IAAQj9B,OAAOg8B,EAAM9sB,IAAIkkC,IAD3D,KAIrB,SAASA,EAAUl2C,GAAQ,MAAO,MAACA,EAAM+/B,MAAO,MAiFzC,SAASoW,EAAS9f,EAAKriB,EAAKosB,EAAWgW,Q,UAAH,GACzCrgB,IAAIsgB,EAAOhgB,EAAI3e,QAAQ1D,GAAMsiC,EAAOD,EAAKjW,MAAQA,EAC7CmW,EAAaH,GAAcA,EAAWA,EAAWh9C,OAAS,IAAOi9C,EAAKp0C,OAC1E,GAAIq0C,EAAO,GAAKD,EAAKp0C,OAAOjC,KAAKo6B,KAAKqb,YACjCY,EAAKp0C,OAAOqzC,WAAWe,EAAK/qC,QAAS+qC,EAAKp0C,OAAOw8B,cACjD8X,EAAUv2C,KAAKw2C,aAAaH,EAAKp0C,OAAOvG,QAAQ2iC,WAAWgY,EAAK/qC,QAAS+qC,EAAKp0C,OAAOw8B,aACxF,OAAO,EACT,IAAK1I,IAAIwL,EAAI8U,EAAKjW,MAAQ,EAAGlnC,EAAIknC,EAAQ,EAAGmB,EAAI+U,EAAM/U,IAAKroC,IAAK,CAC9D68B,IAAIiC,EAAOqe,EAAKre,KAAKuJ,GAAIj2B,EAAQ+qC,EAAK/qC,MAAMi2B,GAC5C,GAAIvJ,EAAKh4B,KAAKo6B,KAAKqb,UAAW,OAAO,EACrC1f,IAAI0gB,EAAOze,EAAKt8B,QAAQ2iC,WAAW/yB,EAAO0sB,EAAKyG,YAC3C+B,EAAS4V,GAAcA,EAAWl9C,IAAO8+B,EAE7C,GADIwI,GAASxI,IAAMye,EAAOA,EAAKnY,aAAa,EAAGkC,EAAMxgC,KAAKuG,OAAOi6B,EAAMT,UAClE/H,EAAKsd,WAAWhqC,EAAQ,EAAG0sB,EAAKyG,cAAgB+B,EAAMxgC,KAAKw2C,aAAaC,GAC3E,OAAO,EAEX1gB,IAAIzqB,EAAQ+qC,EAAK/V,WAAWgW,GACxBI,EAAWN,GAAcA,EAAW,GACxC,OAAOC,EAAKre,KAAKse,GAAMT,eAAevqC,EAAOA,EAAOorC,EAAWA,EAAS12C,KAAOq2C,EAAKre,KAAKse,EAAO,GAAGt2C,MAsB9F,SAAS22C,EAAQtgB,EAAKriB,GAC3B+hB,IAAIsgB,EAAOhgB,EAAI3e,QAAQ1D,GAAM1I,EAAQ+qC,EAAK/qC,QAC1C,OAAOsrC,EAASP,EAAK1V,WAAY0V,EAAK5V,YACpC4V,EAAKp0C,OAAOqzC,WAAWhqC,EAAOA,EAAQ,GAG1C,SAASsrC,EAASz7C,EAAGC,GACnB,OAAOD,GAAKC,IAAMD,EAAE4iC,QAAU5iC,EAAE07C,UAAUz7C,GAOrC,SAAS07C,EAAUzgB,EAAKriB,EAAKzF,Q,WAAO,GAEzC,IADAwnB,IAAIsgB,EAAOhgB,EAAI3e,QAAQ1D,GACdutB,EAAI8U,EAAKjW,OAAQmB,IAAK,CAC7BxL,IAAIoF,OAAA,EAAQqF,OAAA,EAAOl1B,EAAQ+qC,EAAK/qC,MAAMi2B,GAYtC,GAXIA,GAAK8U,EAAKjW,OACZjF,EAASkb,EAAK1V,WACdH,EAAQ6V,EAAK5V,WACJlyB,EAAM,GACf4sB,EAASkb,EAAKre,KAAKuJ,EAAI,GACvBj2B,IACAk1B,EAAQ6V,EAAKre,KAAKuJ,GAAG7C,WAAWpzB,KAEhC6vB,EAASkb,EAAKre,KAAKuJ,GAAG7C,WAAWpzB,EAAQ,GACzCk1B,EAAQ6V,EAAKre,KAAKuJ,EAAI,IAEpBpG,IAAWA,EAAOiU,aAAewH,EAASzb,EAAQqF,IAClD6V,EAAKre,KAAKuJ,GAAG+T,WAAWhqC,EAAOA,EAAQ,GAAI,OAAO0I,EACtD,GAAS,GAALutB,EAAQ,MACZvtB,EAAMzF,EAAM,EAAI8nC,EAAKlb,OAAOoG,GAAK8U,EAAK7V,MAAMe,IAwCzC,SAASwV,EAAU1gB,EAAKriB,EAAKhZ,GAClC+6B,IAAIsgB,EAAOhgB,EAAI3e,QAAQ1D,GACvB,IAAKhZ,EAAMU,QAAQ2Y,KAAM,OAAOL,EAEhC,IADA+hB,IAAIr6B,EAAUV,EAAMU,QACXxC,EAAI,EAAGA,EAAI8B,EAAM45C,UAAW17C,IAAKwC,EAAUA,EAAQoqB,WAAWpqB,QACvE,IAAKq6B,IAAIihB,EAAO,EAAGA,IAA4B,GAAnBh8C,EAAM45C,WAAkB55C,EAAMqZ,KAAO,EAAI,GAAI2iC,IACvE,IAAKjhB,IAAIwL,EAAI8U,EAAKjW,MAAOmB,GAAK,EAAGA,IAAK,CACpCxL,IAAIkhB,EAAO1V,GAAK8U,EAAKjW,MAAQ,EAAIiW,EAAKriC,MAAQqiC,EAAK7Y,MAAM+D,EAAI,GAAK8U,EAAK9Y,IAAIgE,EAAI,IAAM,GAAK,EAAI,EAC1F2V,EAAYb,EAAK/qC,MAAMi2B,IAAM0V,EAAO,EAAI,EAAI,GAChD,GAAY,GAARD,EACEX,EAAKre,KAAKuJ,GAAG+T,WAAW4B,EAAWA,EAAWx7C,GAC9C26C,EAAKre,KAAKuJ,GAAG4N,eAAe+H,GAAWpS,aAAappC,EAAQoqB,WAAW9lB,MAC3E,OAAe,GAARi3C,EAAYZ,EAAKriC,IAAMijC,EAAO,EAAIZ,EAAKlb,OAAOoG,EAAI,GAAK8U,EAAK7V,MAAMe,EAAI,GAGnF,OAAO,KCzRT,SAAS4V,EAAYrH,EAAUxzC,EAAG2F,GAEhC,IADA8zB,IAAIqhB,EAAS,GACJl+C,EAAI,EAAGA,EAAI42C,EAASrR,WAAYvlC,IAAK,CAC5C68B,IAAIuH,EAAQwS,EAASxS,MAAMpkC,GACvBokC,EAAM5hC,QAAQ2Y,OAAMipB,EAAQA,EAAMkB,KAAK2Y,EAAY7Z,EAAM5hC,QAASY,EAAGghC,KACrEA,EAAM6D,WAAU7D,EAAQhhC,EAAEghC,EAAOr7B,EAAQ/I,IAC7Ck+C,EAAOhqC,KAAKkwB,GAEd,OAAO,WAASsC,UAAUwX,GFsI5BpD,EAAKK,OAAO,gBAAiBQ,GCjH7BrB,EAAUl7C,UAAU++C,KAAO,SAAS7B,EAAOl4C,GAOzC,IANA,cAAY24B,EAAA,EAAAA,IAAKmK,EAAA,EAAAA,MAEbkX,EAAWthB,EAAMmF,OAAOiF,EAAQ,GAAImX,EAASthB,EAAIuK,MAAMJ,EAAQ,GAC/D5C,EAAQ8Z,EAAU/Z,EAAMga,EAExBpc,EAAS,WAASjD,MAAO0c,EAAY,EAChCrT,EAAInB,EAAOoX,GAAY,EAAOjW,EAAIjkC,EAAQikC,IAC7CiW,GAAaxhB,EAAM1qB,MAAMi2B,GAAK,GAChCiW,GAAY,EACZrc,EAAS,WAAS3Q,KAAKwL,EAAMgC,KAAKuJ,GAAG/C,KAAKrD,IAC1CyZ,KAEApX,IAGJ,IADAzH,IAAIyK,EAAQ,WAAStI,MAAOsS,EAAU,EAC7BjJ,EAAInB,EAAOoX,GAAY,EAAOjW,EAAIjkC,EAAQikC,IAC7CiW,GAAavhB,EAAIuK,MAAMe,EAAI,GAAKtL,EAAIsH,IAAIgE,IAC1CiW,GAAY,EACZhX,EAAQ,WAAShW,KAAKyL,EAAI+B,KAAKuJ,GAAG/C,KAAKgC,IACvCgK,KAEAjN,IAGJ,OAAOtlC,KAAKkb,KAAK,IAAI0hC,EAAkBrX,EAAOD,EAAK+Z,EAAUC,EACtB,IAAI,QAAMpc,EAAO6B,OAAOwD,GAAQoU,EAAWpK,GAC3CrP,EAAO9mB,KAAOugC,GAAW,KA4ClEpB,EAAUl7C,UAAUiyC,KAAO,SAASiL,EAAOiC,GAEzC,IADA1hB,IAAIr6B,EAAU,WAASw8B,MACdh/B,EAAIu+C,EAASr+C,OAAS,EAAGF,GAAK,EAAGA,IACxCwC,EAAU,WAAS8uB,KAAKitB,EAASv+C,GAAG8G,KAAKuG,OAAOkxC,EAASv+C,GAAG6mC,MAAOrkC,IAErEq6B,IAAIyH,EAAQgY,EAAMhY,MAAOD,EAAMiY,EAAMjY,IACrC,OAAOtlC,KAAKkb,KAAK,IAAI0hC,EAAkBrX,EAAOD,EAAKC,EAAOD,EAAK,IAAI,QAAM7hC,EAAS,EAAG,GAAI+7C,EAASr+C,QAAQ,KAM5Go6C,EAAUl7C,UAAUo/C,aAAe,SAASltB,EAAMiO,EAAWz4B,EAAM+/B,G,WACjE,Q,UADqDvV,IAChDxqB,EAAKovC,YAAa,MAAM,IAAIrY,WAAW,oDAC5ChB,IAAI4hB,EAAU1/C,KAAK2+B,MAAMx9B,OAYzB,OAXAnB,KAAKo+B,IAAI+G,aAAa5S,EAAMiO,GAAE,SAAGT,EAAMhkB,GACrC,GAAIgkB,EAAKoX,cAAgBpX,EAAK4f,UAAU53C,EAAM+/B,IAalD,SAAuB1J,EAAKriB,EAAKhU,GAC/B+1B,IAAIsgB,EAAOhgB,EAAI3e,QAAQ1D,GAAM1I,EAAQ+qC,EAAK/qC,QAC1C,OAAO+qC,EAAKp0C,OAAO4zC,eAAevqC,EAAOA,EAAQ,EAAGtL,GAfM63C,CAAc5/C,EAAKo+B,IAAKp+B,EAAK4+B,QAAQ77B,MAAM28C,GAAS3lC,IAAIgC,GAAMhU,GAAO,CAE3H/H,EAAK6/C,kBAAkB7/C,EAAK4+B,QAAQ77B,MAAM28C,GAAS3lC,IAAIgC,EAAK,GAAIhU,GAChE+1B,IAAIc,EAAU5+B,EAAK4+B,QAAQ77B,MAAM28C,GAC7BI,EAASlhB,EAAQ7kB,IAAIgC,EAAK,GAAIgkC,EAAOnhB,EAAQ7kB,IAAIgC,EAAMgkB,EAAKmF,SAAU,GAG1E,OAFAllC,EAAKkb,KAAK,IAAI0hC,EAAkBkD,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EACjC,IAAI,QAAM,WAASxtB,KAAKxqB,EAAKuG,OAAOw5B,EAAO,KAAM/H,EAAKd,QAAS,EAAG,GAAI,GAAG,KAClG,MAGJj/B,MAWTu7C,EAAUl7C,UAAU2/C,cAAgB,SAASjkC,EAAKhU,EAAM+/B,EAAO7I,GAC7DnB,IAAIiC,EAAO//B,KAAKo+B,IAAI6hB,OAAOlkC,GAC3B,IAAKgkB,EAAM,MAAM,IAAIjB,WAAW,6BAC3B/2B,IAAMA,EAAOg4B,EAAKh4B,MACvB+1B,IAAIoiB,EAAUn4C,EAAKuG,OAAOw5B,EAAO,KAAM7I,GAASc,EAAKd,OACrD,GAAIc,EAAK+F,OACP,OAAO9lC,KAAKogC,YAAYrkB,EAAKA,EAAMgkB,EAAKmF,SAAUgb,GAEpD,IAAKn4C,EAAKw2C,aAAaxe,EAAKt8B,SAC1B,MAAM,IAAIq7B,WAAW,iCAAmC/2B,EAAKtI,MAE/D,OAAOO,KAAKkb,KAAK,IAAI0hC,EAAkB7gC,EAAKA,EAAMgkB,EAAKmF,SAAUnpB,EAAM,EAAGA,EAAMgkB,EAAKmF,SAAW,EACzD,IAAI,QAAM,WAAS3S,KAAK2tB,GAAU,EAAG,GAAI,GAAG,KAgCrF3E,EAAUl7C,UAAUkG,MAAQ,SAASwV,EAAKosB,EAAWgW,Q,UAAH,GAEhD,IADArgB,IAAIsgB,EAAOp+C,KAAKo+B,IAAI3e,QAAQ1D,GAAMmnB,EAAS,WAASjD,MAAOsI,EAAQ,WAAStI,MACnEqJ,EAAI8U,EAAKjW,MAAO50B,EAAI6qC,EAAKjW,MAAQA,EAAOlnC,EAAIknC,EAAQ,EAAGmB,EAAI/1B,EAAG+1B,IAAKroC,IAAK,CAC/EiiC,EAAS,WAAS3Q,KAAK6rB,EAAKre,KAAKuJ,GAAG/C,KAAKrD,IACzCpF,IAAIqiB,EAAYhC,GAAcA,EAAWl9C,GACzCsnC,EAAQ,WAAShW,KAAK4tB,EAAYA,EAAUp4C,KAAKuG,OAAO6xC,EAAUrY,MAAOS,GAAS6V,EAAKre,KAAKuJ,GAAG/C,KAAKgC,IAEtG,OAAOvoC,KAAKkb,KAAK,IAAIuhC,EAAY1gC,EAAKA,EAAK,IAAI,QAAMmnB,EAAO6B,OAAOwD,GAAQJ,EAAOA,IAAQ,KA6C5FoT,EAAUl7C,UAAUuG,KAAO,SAASmV,EAAKosB,Q,UAAQ,GAC/CrK,IAAI5iB,EAAO,IAAIuhC,EAAY1gC,EAAMosB,EAAOpsB,EAAMosB,EAAO,QAAMlI,OAAO,GAClE,OAAOjgC,KAAKkb,KAAKA,IC/NnB,IAAaklC,EAAW,YAEtB,WAAY7tB,EAAMiO,EAAInB,GACpBnB,OAAK,MACLl+B,KAAKuyB,KAAOA,EACZvyB,KAAKwgC,GAAKA,EACVxgC,KAAKq/B,KAAOA,E,4FACb,E,YAED1yB,MAAA,SAAMyxB,G,WACAiiB,EAAWjiB,EAAIr7B,MAAM/C,KAAKuyB,KAAMvyB,KAAKwgC,IAAKzC,EAAQK,EAAI3e,QAAQzf,KAAKuyB,MACnEvoB,EAAS+zB,EAAMgC,KAAKhC,EAAMoL,YAAYnpC,KAAKwgC,KAC3Cz9B,EAAQ,IAAI,QAAMm8C,EAAYmB,EAAS58C,SAAO,SAAGs8B,EAAM/1B,GACzD,OAAKA,EAAOjC,KAAK8qC,eAAe7yC,EAAKq/B,KAAKt3B,MACnCg4B,EAAKV,KAAKr/B,EAAKq/B,KAAKC,SAASS,EAAKd,QADec,IAEvD/1B,GAASq2C,EAAS1D,UAAW0D,EAAS9N,SACzC,OAAO+J,EAAWE,YAAYpe,EAAKp+B,KAAKuyB,KAAMvyB,KAAKwgC,GAAIz9B,I,YAGzDw3C,OAAA,WACE,OAAO,IAAI+F,EAAetgD,KAAKuyB,KAAMvyB,KAAKwgC,GAAIxgC,KAAKq/B,O,YAGrDtlB,IAAA,SAAI6kB,GACFd,IAAIvL,EAAOqM,EAAQib,UAAU75C,KAAKuyB,KAAM,GAAIiO,EAAK5B,EAAQib,UAAU75C,KAAKwgC,IAAK,GAC7E,OAAIjO,EAAK+mB,SAAW9Y,EAAG8Y,SAAW/mB,EAAKxW,KAAOykB,EAAGzkB,IAAY,KACtD,IAAIqkC,EAAY7tB,EAAKxW,IAAKykB,EAAGzkB,IAAK/b,KAAKq/B,O,YAGhDz8B,MAAA,SAAMujB,GACJ,GAAIA,aAAiBi6B,GACjBj6B,EAAMkZ,KAAK8D,GAAGnjC,KAAKq/B,OACnBr/B,KAAKuyB,MAAQpM,EAAMqa,IAAMxgC,KAAKwgC,IAAMra,EAAMoM,KAC5C,OAAO,IAAI6tB,EAAYxgD,KAAKiJ,IAAI7I,KAAKuyB,KAAMpM,EAAMoM,MAC1B3yB,KAAKsvB,IAAIlvB,KAAKwgC,GAAIra,EAAMqa,IAAKxgC,KAAKq/B,O,YAG7D5J,OAAA,WACE,MAAO,CAAC0mB,SAAU,UAAW9c,KAAMr/B,KAAKq/B,KAAK5J,SACrClD,KAAMvyB,KAAKuyB,KAAMiO,GAAIxgC,KAAKwgC,KAGpC,EAAOkD,SAAA,SAASjD,EAAQkD,GACtB,GAAwB,iBAAbA,EAAKpR,MAAsC,iBAAXoR,EAAKnD,GAC9C,MAAM,IAAI1B,WAAW,0CACvB,OAAO,IAAIshB,EAAYzc,EAAKpR,KAAMoR,EAAKnD,GAAIC,EAAOmD,aAAaD,EAAKtE,Q,EA7ChD,CAAS0c,GAiDjCA,EAAKK,OAAO,UAAWgE,GAGvB,IAAaE,EAAc,YAEzB,WAAY/tB,EAAMiO,EAAInB,GACpBnB,OAAK,MACLl+B,KAAKuyB,KAAOA,EACZvyB,KAAKwgC,GAAKA,EACVxgC,KAAKq/B,KAAOA,E,4FACb,E,YAED1yB,MAAA,SAAMyxB,G,WACAiiB,EAAWjiB,EAAIr7B,MAAM/C,KAAKuyB,KAAMvyB,KAAKwgC,IACrCz9B,EAAQ,IAAI,QAAMm8C,EAAYmB,EAAS58C,SAAO,SAAEs8B,GAClD,OAAOA,EAAKV,KAAKr/B,EAAKq/B,KAAKI,cAAcM,EAAKd,WAC5CohB,EAAS1D,UAAW0D,EAAS9N,SACjC,OAAO+J,EAAWE,YAAYpe,EAAKp+B,KAAKuyB,KAAMvyB,KAAKwgC,GAAIz9B,I,YAGzDw3C,OAAA,WACE,OAAO,IAAI6F,EAAYpgD,KAAKuyB,KAAMvyB,KAAKwgC,GAAIxgC,KAAKq/B,O,YAGlDtlB,IAAA,SAAI6kB,GACFd,IAAIvL,EAAOqM,EAAQib,UAAU75C,KAAKuyB,KAAM,GAAIiO,EAAK5B,EAAQib,UAAU75C,KAAKwgC,IAAK,GAC7E,OAAIjO,EAAK+mB,SAAW9Y,EAAG8Y,SAAW/mB,EAAKxW,KAAOykB,EAAGzkB,IAAY,KACtD,IAAIukC,EAAe/tB,EAAKxW,IAAKykB,EAAGzkB,IAAK/b,KAAKq/B,O,YAGnDz8B,MAAA,SAAMujB,GACJ,GAAIA,aAAiBm6B,GACjBn6B,EAAMkZ,KAAK8D,GAAGnjC,KAAKq/B,OACnBr/B,KAAKuyB,MAAQpM,EAAMqa,IAAMxgC,KAAKwgC,IAAMra,EAAMoM,KAC5C,OAAO,IAAI+tB,EAAe1gD,KAAKiJ,IAAI7I,KAAKuyB,KAAMpM,EAAMoM,MAC1B3yB,KAAKsvB,IAAIlvB,KAAKwgC,GAAIra,EAAMqa,IAAKxgC,KAAKq/B,O,YAGhE5J,OAAA,WACE,MAAO,CAAC0mB,SAAU,aAAc9c,KAAMr/B,KAAKq/B,KAAK5J,SACxClD,KAAMvyB,KAAKuyB,KAAMiO,GAAIxgC,KAAKwgC,KAGpC,EAAOkD,SAAA,SAASjD,EAAQkD,GACtB,GAAwB,iBAAbA,EAAKpR,MAAsC,iBAAXoR,EAAKnD,GAC9C,MAAM,IAAI1B,WAAW,6CACvB,OAAO,IAAIwhB,EAAe3c,EAAKpR,KAAMoR,EAAKnD,GAAIC,EAAOmD,aAAaD,EAAKtE,Q,EA3ChD,CAAS0c,GZnBpC,SAASwE,EAAcxiB,EAAOC,EAAKj7B,GACjC,OAAQA,EAAM45C,YAAc55C,EAAMwvC,SAAWxU,EAAMwH,SAAWvH,EAAIuH,SAChExH,EAAM/zB,OAAOqzC,WAAWtf,EAAM1qB,QAAS2qB,EAAI3qB,QAAStQ,EAAMU,SYgE9Ds4C,EAAKK,OAAO,aAAckE,Gb1G1B/E,EAAUl7C,UAAUmgD,QAAU,SAASjuB,EAAMiO,EAAInB,G,WAC3CrE,EAAU,GAAIylB,EAAQ,GAAIC,EAAW,KAAMC,EAAS,KA0BxD,OAzBA3gD,KAAKo+B,IAAI+G,aAAa5S,EAAMiO,GAAE,SAAGT,EAAMhkB,EAAK/R,GAC1C,GAAK+1B,EAAKmJ,SAAV,CACApL,IAAImB,EAAQc,EAAKd,MACjB,IAAKI,EAAK2J,QAAQ/J,IAAUj1B,EAAOjC,KAAK8qC,eAAexT,EAAKt3B,MAAO,CAIjE,IAHA+1B,IAAIyH,EAAQ3lC,KAAKsvB,IAAInT,EAAKwW,GAAO+S,EAAM1lC,KAAKiJ,IAAIkT,EAAMgkB,EAAKmF,SAAU1E,GACjEogB,EAASvhB,EAAKC,SAASL,GAElBh+B,EAAI,EAAGA,EAAIg+B,EAAM99B,OAAQF,IAC3Bg+B,EAAMh+B,GAAG+nC,QAAQ4X,KAChBF,GAAYA,EAASlgB,IAAM+E,GAASmb,EAASrhB,KAAK8D,GAAGlE,EAAMh+B,IAC7Dy/C,EAASlgB,GAAK8E,EAEdtK,EAAQ7lB,KAAKurC,EAAW,IAAIJ,EAAe/a,EAAOD,EAAKrG,EAAMh+B,MAI/D0/C,GAAUA,EAAOngB,IAAM+E,EACzBob,EAAOngB,GAAK8E,EAEZmb,EAAMtrC,KAAKwrC,EAAS,IAAIP,EAAY7a,EAAOD,EAAKjG,SAItDrE,EAAQl6B,SAAO,SAAC46B,GAAE,OAAG17B,EAAKkb,KAAKwgB,MAC/B+kB,EAAM3/C,SAAO,SAAC46B,GAAE,OAAG17B,EAAKkb,KAAKwgB,MACtB17B,MAQTu7C,EAAUl7C,UAAUwgD,WAAa,SAAStuB,EAAMiO,EAAInB,G,0BAAO,MACzDvB,IAAIxN,EAAU,GAAIpV,EAAO,EA+BzB,OA9BAlb,KAAKo+B,IAAI+G,aAAa5S,EAAMiO,GAAE,SAAGT,EAAMhkB,GACrC,GAAKgkB,EAAKmJ,SAAV,CACAhuB,IACA4iB,IAAIgjB,EAAW,KACf,GAAIzhB,aAAgB,WAAU,CAC5BvB,IAAIiG,EAAQ1E,EAAK2J,QAAQjJ,EAAKd,OAC1B8E,IAAO+c,EAAW,CAAC/c,SACd1E,EACLA,EAAK2J,QAAQjJ,EAAKd,SAAQ6hB,EAAW,CAACzhB,IAE1CyhB,EAAW/gB,EAAKd,MAElB,GAAI6hB,GAAYA,EAAS3/C,OAEvB,IADA28B,IAAIwH,EAAM1lC,KAAKiJ,IAAIkT,EAAMgkB,EAAKmF,SAAU1E,GAC/Bv/B,EAAI,EAAGA,EAAI6/C,EAAS3/C,OAAQF,IAAK,CAExC,IADA68B,IAAI/vB,EAAQ+yC,EAAS7/C,GAAI8iC,SAChBzX,EAAI,EAAGA,EAAIgE,EAAQnvB,OAAQmrB,IAAK,CACvCwR,IAAItY,EAAI8K,EAAQhE,GACZ9G,EAAEtK,MAAQA,EAAO,GAAKnN,EAAMo1B,GAAG7S,EAAQhE,GAAGve,SAAQg2B,EAAQve,GAE5Due,GACFA,EAAMvD,GAAK8E,EACXvB,EAAM7oB,KAAOA,GAEboV,EAAQnb,KAAK,OAACpH,EAAOwkB,KAAM3yB,KAAKsvB,IAAInT,EAAKwW,GAAOiO,GAAI8E,EAAG,KAAEpqB,SAKjEoV,EAAQxvB,SAAO,SAAC0kB,GAAE,OAAGxlB,EAAKkb,KAAK,IAAIolC,EAAe96B,EAAE+M,KAAM/M,EAAEgb,GAAIhb,EAAEzX,WAC3D/N,MAQTu7C,EAAUl7C,UAAUw/C,kBAAoB,SAAS9jC,EAAKglC,EAAYluC,Q,UAAQkuC,EAAW5T,cAGnF,IAFArP,IAAIiC,EAAO//B,KAAKo+B,IAAI6hB,OAAOlkC,GACvBilC,EAAW,GAAInV,EAAM9vB,EAAM,EACtB9a,EAAI,EAAGA,EAAI8+B,EAAKyG,WAAYvlC,IAAK,CACxC68B,IAAIuH,EAAQtF,EAAKsF,MAAMpkC,GAAIqkC,EAAMuG,EAAMxG,EAAMH,SACzC+b,EAAUpuC,EAAMs5B,UAAU9G,EAAMt9B,KAAMs9B,EAAMyC,OAChD,GAAKmZ,EAEE,CACLpuC,EAAQouC,EACR,IAAKnjB,IAAIxR,EAAI,EAAGA,EAAI+Y,EAAMpG,MAAM99B,OAAQmrB,IAAUy0B,EAAWlO,eAAexN,EAAMpG,MAAM3S,GAAGvkB,OACzF/H,KAAKkb,KAAK,IAAIolC,EAAezU,EAAKvG,EAAKD,EAAMpG,MAAM3S,UAJrD00B,EAAS7rC,KAAK,IAAIsnC,EAAY5Q,EAAKvG,EAAK,QAAMrF,QAMhD4L,EAAMvG,EAER,IAAKzyB,EAAMu3B,SAAU,CACnBtM,IAAIuU,EAAOx/B,EAAM25B,WAAW,WAASvM,OAAO,GAC5CjgC,KAAKuD,QAAQsoC,EAAKA,EAAK,IAAI,QAAMwG,EAAM,EAAG,IAE5C,IAAKvU,IAAI78B,EAAI+/C,EAAS7/C,OAAS,EAAGF,GAAK,EAAGA,IAAKjB,KAAKkb,KAAK8lC,EAAS//C,IAClE,OAAOjB,MChFTu7C,EAAUl7C,UAAUkD,QAAU,SAASgvB,EAAMiO,EAAWz9B,Q,UAANwvB,Q,UAAc,QAAM0N,OACpEnC,IAAI5iB,EAbC,SAAqBkjB,EAAK7L,EAAMiO,EAAWz9B,GAChD,Q,UAD0CwvB,Q,UAAc,QAAM0N,OAC1D1N,GAAQiO,IAAOz9B,EAAMqZ,KAAM,OAAO,KAEtC0hB,IAAIC,EAAQK,EAAI3e,QAAQ8S,GAAOyL,EAAMI,EAAI3e,QAAQ+gB,GAEjD,OAAI+f,EAAcxiB,EAAOC,EAAKj7B,GAAe,IAAI05C,EAAYlqB,EAAMiO,EAAIz9B,GAChE,IAAIm+C,EAAOnjB,EAAOC,EAAKj7B,GAAOo+C,MAO1BC,CAAYphD,KAAKo+B,IAAK7L,EAAMiO,EAAIz9B,GAE3C,OADImY,GAAMlb,KAAKkb,KAAKA,GACblb,MAMTu7C,EAAUl7C,UAAU+/B,YAAc,SAAS7N,EAAMiO,EAAI/8B,GACnD,OAAOzD,KAAKuD,QAAQgvB,EAAMiO,EAAI,IAAI,QAAM,WAASjO,KAAK9uB,GAAU,EAAG,KAKrE83C,EAAUl7C,UAAUghD,OAAS,SAAS9uB,EAAMiO,GAC1C,OAAOxgC,KAAKuD,QAAQgvB,EAAMiO,EAAI,QAAMP,QAKtCsb,EAAUl7C,UAAUivC,OAAS,SAASvzB,EAAKtY,GACzC,OAAOzD,KAAKogC,YAAYrkB,EAAKA,EAAKtY,IA4BpC,IAAMy9C,EACJ,SAAYnjB,EAAOC,EAAKj7B,GACtB/C,KAAKg+B,IAAMA,EACXh+B,KAAK+9B,MAAQA,EACb/9B,KAAKshD,SAAWv+C,EAEhB/C,KAAKuhD,SAAW,GAChB,IAAKzjB,IAAI78B,EAAI,EAAGA,GAAK88B,EAAMoK,MAAOlnC,IAAK,CACvC,IAAM8+B,EAAOhC,EAAMgC,KAAK9+B,GACtBjB,KAAKuhD,SAASpsC,KAAK,CACjBpN,KAAMg4B,EAAKh4B,KACX8K,MAAOktB,EAAKmX,eAAenZ,EAAMsK,WAAWpnC,MAIhDjB,KAAKwhD,OAAS,WAASvhB,MACvB,IAAKnC,IAAI78B,EAAI88B,EAAMoK,MAAOlnC,EAAI,EAAGA,IAC/BjB,KAAKwhD,OAAS,WAASjvB,KAAKwL,EAAMgC,KAAK9+B,GAAGslC,KAAKvmC,KAAKwhD,U,wBACvD,IA6MH,SAASC,EAAiB5J,EAAU1P,EAAOuZ,GACzC,OAAa,GAATvZ,EAAmB0P,EAASzR,WAAWsb,GACpC7J,EAASxR,aAAa,EAAGwR,EAAShqB,WAAW0Y,KAAKkb,EAAiB5J,EAAShqB,WAAWpqB,QAAS0kC,EAAQ,EAAGuZ,KAGpH,SAASC,EAAc9J,EAAU1P,EAAO1kC,GACtC,OAAa,GAAT0kC,EAAmB0P,EAAS9S,OAAOthC,GAChCo0C,EAASxR,aAAawR,EAASrR,WAAa,EACtBqR,EAAS7R,UAAUO,KAAKob,EAAc9J,EAAS7R,UAAUviC,QAAS0kC,EAAQ,EAAG1kC,KAG5G,SAASm+C,EAAU/J,EAAU1P,GAC3B,IAAKrK,IAAI78B,EAAI,EAAGA,EAAIknC,EAAOlnC,IAAK42C,EAAWA,EAAShqB,WAAWpqB,QAC/D,OAAOo0C,EAGT,SAASgK,EAAe9hB,EAAM4c,EAAWpK,GACvC,GAAIoK,GAAa,EAAG,OAAO5c,EAC3BjC,IAAIuO,EAAOtM,EAAKt8B,QAOhB,OANIk5C,EAAY,IACdtQ,EAAOA,EAAKhG,aAAa,EAAGwb,EAAexV,EAAKxe,WAAY8uB,EAAY,EAAsB,GAAnBtQ,EAAK7F,WAAkB+L,EAAU,EAAI,KAC9GoK,EAAY,IACdtQ,EAAOtM,EAAKh4B,KAAKolC,aAAaX,WAAWH,GAAMtH,OAAOsH,GAClDkG,GAAW,IAAGlG,EAAOA,EAAKtH,OAAOhF,EAAKh4B,KAAKolC,aAAaf,cAAcC,GAAMG,WAAW,WAASvM,OAAO,MAEtGF,EAAKwG,KAAK8F,GAGnB,SAASyV,EAAiB9jB,EAAKmK,EAAOpgC,EAAM8K,EAAOzE,GACjD0vB,IAAIiC,EAAO/B,EAAI+B,KAAKoI,GAAQ90B,EAAQjF,EAAO4vB,EAAIqK,WAAWF,GAASnK,EAAI3qB,MAAM80B,GAC7E,GAAI90B,GAAS0sB,EAAKyG,aAAez+B,EAAKg6C,kBAAkBhiB,EAAKh4B,MAAO,OAAO,KAC3E+1B,IAAIqjB,EAAMtuC,EAAM25B,WAAWzM,EAAKt8B,SAAS,EAAM4P,GAC/C,OAAO8tC,IAGT,SAAsBp5C,EAAM8vC,EAAUtS,GACpC,IAAKzH,IAAI78B,EAAIskC,EAAOtkC,EAAI42C,EAASrR,WAAYvlC,IAC3C,IAAK8G,EAAKi6C,YAAYnK,EAASxS,MAAMpkC,GAAGg+B,OAAQ,OAAO,EACzD,OAAO,EANQgjB,CAAal6C,EAAMg4B,EAAKt8B,QAAS4P,GAAS8tC,EAAM,KAiGjE,SAASe,EAAcrK,EAAU1P,EAAOga,EAASC,EAASp4C,GACxD,GAAIm+B,EAAQga,EAAS,CACnBrkB,IAAI9hB,EAAQ67B,EAAShqB,WACrBgqB,EAAWA,EAASxR,aAAa,EAAGrqB,EAAMuqB,KAAK2b,EAAclmC,EAAMvY,QAAS0kC,EAAQ,EAAGga,EAASC,EAASpmC,KAE3G,GAAImsB,EAAQia,EAAS,CACnBtkB,IAAIjrB,EAAQ7I,EAAOktC,eAAe,GAC9B3R,EAAQ1yB,EAAM25B,WAAWqL,GAAU9S,OAAO8S,GAC9CA,EAAWtS,EAAMR,OAAOlyB,EAAMu5B,cAAc7G,GAAOiH,WAAW,WAASvM,OAAO,IAEhF,OAAO4X,EA0CT,SAASwK,EAActkB,EAAOC,GAE5B,IADAF,IAAIj7B,EAAS,GACJymC,EADmB1pC,KAAKiJ,IAAIk1B,EAAMoK,MAAOnK,EAAImK,OAC/BmB,GAAK,EAAGA,IAAK,CAClCxL,IAAIyH,EAAQxH,EAAMwH,MAAM+D,GACxB,GAAI/D,EAAQxH,EAAMhiB,KAAOgiB,EAAMoK,MAAQmB,IACnCtL,EAAIsH,IAAIgE,GAAKtL,EAAIjiB,KAAOiiB,EAAImK,MAAQmB,IACpCvL,EAAMgC,KAAKuJ,GAAGvhC,KAAKo6B,KAAKqb,WACxBxf,EAAI+B,KAAKuJ,GAAGvhC,KAAKo6B,KAAKqb,UAAW,MACjCjY,GAASvH,EAAIuH,MAAM+D,IAAIzmC,EAAOsS,KAAKm0B,GAEzC,OAAOzmC,EA1YPw/B,EAAI8F,MAAA,eAAU,OAAOnoC,KAAKuhD,SAASpgD,OAAS,GAE9C,YAAEggD,IAAA,WAIE,KAAOnhD,KAAKshD,SAASllC,MAAM,CACzB0hB,IAAIqjB,EAAMnhD,KAAKsiD,eACXnB,EAAKnhD,KAAKuiD,WAAWpB,GACpBnhD,KAAKwiD,YAAcxiD,KAAKyiD,WAO/B,IAAIC,EAAa1iD,KAAK2iD,iBAAkBC,EAAa5iD,KAAKwhD,OAAOplC,KAAOpc,KAAKmoC,MAAQnoC,KAAK+9B,MAAMoK,MAC5FpK,EAAQ/9B,KAAK+9B,MAAOC,EAAMh+B,KAAK2N,MAAM+0C,EAAa,EAAI1iD,KAAKg+B,IAAMD,EAAMK,IAAI3e,QAAQijC,IACvF,IAAK1kB,EAAK,OAAO,KAIjB,IADAF,IAAIr6B,EAAUzD,KAAKwhD,OAAQ7E,EAAY5e,EAAMoK,MAAOoK,EAAUvU,EAAImK,MAC3DwU,GAAapK,GAAiC,GAAtB9uC,EAAQ+iC,YACrC/iC,EAAUA,EAAQoqB,WAAWpqB,QAC7Bk5C,IAAapK,IAEfzU,IAAI/6B,EAAQ,IAAI,QAAMU,EAASk5C,EAAWpK,GAC1C,OAAImQ,GAAc,EACT,IAAI9F,EAAkB7e,EAAMhiB,IAAK2mC,EAAY1iD,KAAKg+B,IAAIjiB,IAAK/b,KAAKg+B,IAAIsH,MAAOviC,EAAO6/C,GACvF7/C,EAAMqZ,MAAQ2hB,EAAMhiB,KAAO/b,KAAKg+B,IAAIjiB,IAC/B,IAAI0gC,EAAY1e,EAAMhiB,IAAKiiB,EAAIjiB,IAAKhZ,QAD7C,GAOJ,YAAEu/C,aAAA,WAGE,IAAKxkB,IAAIihB,EAAO,EAAGA,GAAQ,EAAGA,IAC5B,IAAKjhB,IAAI+kB,EAAa7iD,KAAKshD,SAAS3E,UAAWkG,GAAc,EAAGA,IAS9D,IARA/kB,IAAc9zB,OAAA,EAOVgS,GANA6mC,GACF74C,EAAS43C,EAAU5hD,KAAKshD,SAAS79C,QAASo/C,EAAa,GAAGh1B,YACxCpqB,QAEPzD,KAAKshD,SAAS79C,SAENoqB,WACZi1B,EAAgB9iD,KAAKmoC,MAAO2a,GAAiB,EAAGA,IAAiB,CAC1E,MAAsB9iD,KAAKuhD,SAASuB,GAA7B/6C,EAAA,EAAAA,KAAM8K,EAAA,EAAAA,MAAuCy/B,OAAA,EAAMyQ,OAAA,EAIxD,GAAY,GAARhE,IAAc/iC,EAAQnJ,EAAMs5B,UAAUnwB,EAAMjU,QAAUg7C,EAASlwC,EAAM25B,WAAW,WAASja,KAAKvW,IAAQ,IACtFjU,EAAKg6C,kBAAkB/3C,EAAOjC,OAChD,MAAO,YAAC86C,EAAU,cAAEC,EAAa,OAAE94C,EAAM,OAAE+4C,GAGxC,GAAY,GAARhE,GAAa/iC,IAAUs2B,EAAOz/B,EAAMg6B,aAAa7wB,EAAMjU,OAC9D,MAAO,YAAC86C,EAAU,cAAEC,EAAa,OAAE94C,EAAM,KAAEsoC,GAG7C,GAAItoC,GAAU6I,EAAMs5B,UAAUniC,EAAOjC,MAAO,QAMtD,YAAEy6C,SAAA,WACE,IAAF,EAAsCxiD,KAAKshD,SAApC79C,EAAA,EAAAA,QAASk5C,EAAA,EAAAA,UAAWpK,EAAA,EAAAA,QACrB1L,EAAQ+a,EAAUn+C,EAASk5C,GAC/B,SAAK9V,EAAML,YAAcK,EAAMhZ,WAAWiY,UAC1C9lC,KAAKshD,SAAW,IAAI,QAAM79C,EAASk5C,EAAY,EACvB,KAAOztB,IAAIqjB,EAAS1L,EAAMzqB,KAAOugC,GAAal5C,EAAQ2Y,KAAOm2B,EAAUoK,EAAY,EAAI,KACxG,IAGX,YAAE8F,SAAA,WACE,IAAF,EAAsCziD,KAAKshD,SAApC79C,EAAA,EAAAA,QAASk5C,EAAA,EAAAA,UAAWpK,EAAA,EAAAA,QACrB1L,EAAQ+a,EAAUn+C,EAASk5C,GAC/B,GAAI9V,EAAML,YAAc,GAAKmW,EAAY,EAAG,CAC1C7e,IAAIklB,EAAYv/C,EAAQ2Y,KAAOugC,GAAaA,EAAY9V,EAAMzqB,KAChE,KAAOklC,SAAW,IAAI,QAAMG,EAAiBh+C,EAASk5C,EAAY,EAAG,GAAIA,EAAY,EACzDqG,EAAYrG,EAAY,EAAIpK,QAEtDvyC,KAAKshD,SAAW,IAAI,QAAMG,EAAiBh+C,EAASk5C,EAAW,GAAIA,EAAWpK,IAQpF,YAAEgQ,WAAA,SAAW,GACT,I,QADsB,W,IAAe,c,IAAQ,O,IAAQ,O,SAC9CviD,KAAKmoC,MAAQ2a,GAAe9iD,KAAKijD,oBACxC,GAAI3Q,EAAM,IAAKxU,IAAI78B,EAAI,EAAGA,EAAIqxC,EAAKnxC,OAAQF,IAAKjB,KAAKkjD,iBAAiB5Q,EAAKrxC,IAE3E68B,IAAI/6B,EAAQ/C,KAAKshD,SAAUzJ,EAAW7tC,EAASA,EAAOvG,QAAUV,EAAMU,QAClEk5C,EAAY55C,EAAM45C,UAAYkG,EAC9BM,EAAQ,EAAGh5C,EAAM,GACvB,EAAsBnK,KAAKuhD,SAASuB,GAA7BjwC,EAAA,EAAAA,MAAO9K,EAAA,EAAAA,KACZ,GAAIg7C,EAAQ,CACZ,IAAOjlB,IAAI78B,EAAI,EAAGA,EAAI8hD,EAAOvc,WAAYvlC,IAAKkJ,EAAIgL,KAAK4tC,EAAO1d,MAAMpkC,IAClE4R,EAAQA,EAAMu5B,cAAc2W,GAQ9B,IAHA,IAAIK,EAAgBvL,EAASz7B,KAAOymC,GAAe9/C,EAAMU,QAAQ2Y,KAAOrZ,EAAMwvC,SAGvE4Q,EAAQtL,EAASrR,YAAY,CACpC,IAAM31B,EAAOgnC,EAASxS,MAAM8d,GAAQnU,EAAUn8B,EAAMs5B,UAAUt7B,EAAK9I,MACjE,IAAKinC,EAAS,SACdmU,EACY,GAAkB,GAAbxG,GAAkB9rC,EAAKpN,QAAQ2Y,QAChD,EAAU4yB,EACV,EAAM75B,KAAK0sC,EAAehxC,EAAKwuB,KAAKt3B,EAAKs7C,aAAaxyC,EAAKouB,QAAkB,GAATkkB,EAAaxG,EAAY,EACrE,GAAW9E,EAASrR,WAAa4c,GAAgB,KAG3E,IAAI3W,EAAQ0W,GAAStL,EAASrR,WACzBiG,IAAO2W,GAAgB,GAE5BpjD,KAAKwhD,OAASG,EAAc3hD,KAAKwhD,OAAQsB,EAAe,WAASvwB,KAAKpoB,IACtEnK,KAAKuhD,SAASuB,GAAejwC,MAAQA,EAIjC45B,GAAS2W,EAAe,GAAKp5C,GAAUA,EAAOjC,MAAQ/H,KAAKuhD,SAASvhD,KAAKmoC,OAAOpgC,MAAQ/H,KAAKuhD,SAASpgD,OAAS,GACjHnB,KAAKijD,oBAGP,IAAKnlB,IAAI78B,EAAI,EAAG4qC,EAAMgM,EAAU52C,EAAImiD,EAAcniD,IAAK,CACrD68B,IAAIiC,EAAO8L,EAAI7F,UACjB,KAAOub,SAASpsC,KAAK,CAACpN,KAAMg4B,EAAKh4B,KAAM8K,MAAOktB,EAAKmX,eAAenX,EAAKyG,cACrEqF,EAAM9L,EAAKt8B,QAMbzD,KAAKshD,SAAY7U,EACC,GAAdoW,EAAkB,QAAM5iB,MACxB,IAAI,QAAMwhB,EAAiB1+C,EAAMU,QAASo/C,EAAa,EAAG,GAChDA,EAAa,EAAGO,EAAe,EAAIrgD,EAAMwvC,QAAUsQ,EAAa,GAHrD,IAAI,QAAMpB,EAAiB1+C,EAAMU,QAASo/C,EAAYM,GAAQpgD,EAAM45C,UAAW55C,EAAMwvC,UAMlH,YAAEoQ,eAAA,WACE,IAAK3iD,KAAKg+B,IAAIh0B,OAAOmtC,aAAen3C,KAAKg+B,IAAIsH,OAAStlC,KAAKg+B,IAAIjiB,IAAK,OAAQ,EAC5E+hB,IAAqCwZ,EAAjCzD,EAAM7zC,KAAKuhD,SAASvhD,KAAKmoC,OAC7B,IAAK0L,EAAI9rC,KAAKovC,cAAgB2K,EAAiB9hD,KAAKg+B,IAAKh+B,KAAKg+B,IAAImK,MAAO0L,EAAI9rC,KAAM8rC,EAAIhhC,OAAO,IACzF7S,KAAKg+B,IAAImK,OAASnoC,KAAKmoC,QAAUmP,EAAQt3C,KAAKsjD,eAAetjD,KAAKg+B,OAASsZ,EAAMnP,OAASnoC,KAAKmoC,MAAQ,OAAQ,EAGpH,IADA,IAAKA,EAASnoC,KAAKg+B,IAAdmK,MAAmBI,EAAQvoC,KAAKg+B,IAAIuK,MAAMJ,GACxCA,EAAQ,GAAKI,GAASvoC,KAAKg+B,IAAIsH,MAAM6C,MAAUI,EACtD,OAAOA,GAGX,YAAE+a,eAAA,SAAetlB,GACbqP,EAAM,IAAKvP,IAAI78B,EAAIrB,KAAKiJ,IAAI7I,KAAKmoC,MAAOnK,EAAImK,OAAQlnC,GAAK,EAAGA,IAAK,CACjE,MAAsBjB,KAAKuhD,SAAStgD,GAA7B4R,EAAA,EAAAA,MAAO9K,EAAA,EAAAA,KACRw7C,EAAYtiD,EAAI+8B,EAAImK,OAASnK,EAAIsH,IAAIrkC,EAAI,IAAM+8B,EAAIjiB,KAAOiiB,EAAImK,OAASlnC,EAAI,IAC3EkgD,EAAMW,EAAiB9jB,EAAK/8B,EAAG8G,EAAM8K,EAAO0wC,GAChD,GAAKpC,EAAL,CACA,IAAKrjB,IAAIwL,EAAIroC,EAAI,EAAGqoC,GAAK,EAAGA,IAAK,CACjC,MAAsBtpC,KAAKuhD,SAASjY,GAA7B,IAAAz2B,MACDm8B,EAAU8S,EAAiB9jB,EAAKsL,EADxB,EAAAvhC,KACiC8K,GAAO,GACtD,IAAOm8B,GAAWA,EAAQxI,WAAY,SAAS6G,EAE/C,MAAO,CAAClF,MAAOlnC,EAAC,IAAEkgD,EAAKqC,KAAMD,EAAYvlB,EAAII,IAAI3e,QAAQue,EAAIuK,MAAMtnC,EAAI,IAAM+8B,MAInF,YAAErwB,MAAA,SAAMqwB,GACJ,IAAIrwB,EAAQ3N,KAAKsjD,eAAetlB,GAChC,IAAKrwB,EAAO,OAAO,KAEnB,KAAO3N,KAAKmoC,MAAQx6B,EAAMw6B,OAAOnoC,KAAKijD,oBAClCt1C,EAAMwzC,IAAI3a,aAAYxmC,KAAKwhD,OAASG,EAAc3hD,KAAKwhD,OAAQ7zC,EAAMw6B,MAAOx6B,EAAMwzC,MACtFnjB,EAAMrwB,EAAM61C,KACZ,IAAK1lB,IAAIwL,EAAI37B,EAAMw6B,MAAQ,EAAGmB,GAAKtL,EAAImK,MAAOmB,IAAK,CACjDxL,IAAIiC,EAAO/B,EAAI+B,KAAKuJ,GAAIn/B,EAAM41B,EAAKh4B,KAAKolC,aAAaX,WAAWzM,EAAKt8B,SAAS,EAAMu6B,EAAI3qB,MAAMi2B,IAC9FtpC,KAAKkjD,iBAAiBnjB,EAAKh4B,KAAMg4B,EAAK+H,MAAO39B,GAE/C,OAAO6zB,GAGX,YAAEklB,iBAAA,SAAiBn7C,EAAM+/B,EAAOrkC,GAC5B,IAAIowC,EAAM7zC,KAAKuhD,SAASvhD,KAAKmoC,OAC7B0L,EAAIhhC,MAAQghC,EAAIhhC,MAAMs5B,UAAUpkC,GAChC/H,KAAKwhD,OAASG,EAAc3hD,KAAKwhD,OAAQxhD,KAAKmoC,MAAO,WAAS5V,KAAKxqB,EAAKuG,OAAOw5B,EAAOrkC,KACtFzD,KAAKuhD,SAASpsC,KAAK,MAACpN,EAAM8K,MAAO9K,EAAKolC,gBAG1C,YAAE8V,kBAAA,WACE,IACI94C,EADOnK,KAAKuhD,SAAS/T,MACV36B,MAAM25B,WAAW,WAASvM,OAAO,GAC5C91B,EAAIq8B,aAAYxmC,KAAKwhD,OAASG,EAAc3hD,KAAKwhD,OAAQxhD,KAAKuhD,SAASpgD,OAAQgJ,K,oCAEtF,GA2DDoxC,EAAUl7C,UAAUojD,aAAe,SAASlxB,EAAMiO,EAAIz9B,GACpD,IAAKA,EAAMqZ,KAAM,OAAOpc,KAAK0gC,YAAYnO,EAAMiO,GAE/C1C,IAAIC,EAAQ/9B,KAAKo+B,IAAI3e,QAAQ8S,GAAOyL,EAAMh+B,KAAKo+B,IAAI3e,QAAQ+gB,GAC3D,GAAI+f,EAAcxiB,EAAOC,EAAKj7B,GAC5B,OAAO/C,KAAKkb,KAAK,IAAIuhC,EAAYlqB,EAAMiO,EAAIz9B,IAE7C+6B,IAAI4lB,EAAerB,EAActkB,EAAO/9B,KAAKo+B,IAAI3e,QAAQ+gB,IAEZ,GAAzCkjB,EAAaA,EAAaviD,OAAS,IAASuiD,EAAalW,MAG7D1P,IAAI6lB,IAAoB5lB,EAAMoK,MAAQ,GACtCub,EAAa/uB,QAAQgvB,GAKrB,IAAK7lB,IAAIwL,EAAIvL,EAAMoK,MAAOpsB,EAAMgiB,EAAMhiB,IAAM,EAAGutB,EAAI,EAAGA,IAAKvtB,IAAO,CAChE+hB,IAAIqE,EAAOpE,EAAMgC,KAAKuJ,GAAGvhC,KAAKo6B,KAC9B,GAAIA,EAAKyhB,UAAYzhB,EAAKqb,UAAW,MACjCkG,EAAavwC,QAAQm2B,IAAM,EAAGqa,EAAkBra,EAC3CvL,EAAMmF,OAAOoG,IAAMvtB,GAAK2nC,EAAa1f,OAAO,EAAG,GAAIsF,GAO9D,IAHAxL,IAAI+lB,EAAuBH,EAAavwC,QAAQwwC,GAE5CG,EAAY,GAAIC,EAAiBhhD,EAAM45C,UAClCl5C,EAAUV,EAAMU,QAASxC,EAAI,GAAIA,IAAK,CAC7C68B,IAAIiC,EAAOt8B,EAAQoqB,WAEnB,GADAi2B,EAAU3uC,KAAK4qB,GACX9+B,GAAK8B,EAAM45C,UAAW,MAC1Bl5C,EAAUs8B,EAAKt8B,QAIbsgD,EAAiB,GAAKD,EAAUC,EAAiB,GAAGh8C,KAAKo6B,KAAKyhB,UAC9D7lB,EAAMgC,KAAK8jB,GAAsB97C,MAAQ+7C,EAAUC,EAAiB,GAAGh8C,KACzEg8C,GAAkB,EACXA,GAAkB,GAAKD,EAAUC,EAAiB,GAAG5M,aAAe2M,EAAUC,EAAiB,GAAGh8C,KAAKo6B,KAAKyhB,UAC5G7lB,EAAMgC,KAAK8jB,GAAsB97C,MAAQ+7C,EAAUC,EAAiB,GAAGh8C,OAC9Eg8C,GAAkB,GAEpB,IAAKjmB,IAAIxR,EAAIvpB,EAAM45C,UAAWrwB,GAAK,EAAGA,IAAK,CACzCwR,IAAIkmB,GAAa13B,EAAIy3B,EAAiB,IAAMhhD,EAAM45C,UAAY,GAC1DrN,EAASwU,EAAUE,GACvB,GAAK1U,EACL,IAAKxR,IAAI78B,EAAI,EAAGA,EAAIyiD,EAAaviD,OAAQF,IAAK,CAG5C68B,IAAImmB,EAAcP,GAAcziD,EAAI4iD,GAAwBH,EAAaviD,QAAS+iD,GAAS,EACvFD,EAAc,IAAKC,GAAS,EAAOD,GAAeA,GACtDnmB,IAAI9zB,EAAS+zB,EAAMgC,KAAKkkB,EAAc,GAAI5wC,EAAQ0qB,EAAM1qB,MAAM4wC,EAAc,GAC5E,GAAIj6C,EAAO4zC,eAAevqC,EAAOA,EAAOi8B,EAAOvnC,KAAMunC,EAAOrQ,OAC1D,OAAOj/B,KAAKuD,QAAQw6B,EAAMmF,OAAO+gB,GAAcC,EAASlmB,EAAIuK,MAAM0b,GAAezjB,EAC7D,IAAI,QAAM0hB,EAAcn/C,EAAMU,QAAS,EAAGV,EAAM45C,UAAWqH,GACjDA,EAAWjhD,EAAMwvC,WAKrD,IADAzU,IAAIqmB,EAAankD,KAAK2+B,MAAMx9B,OACnBF,EAAIyiD,EAAaviD,OAAS,EAAGF,GAAK,IACzCjB,KAAKuD,QAAQgvB,EAAMiO,EAAIz9B,KACnB/C,KAAK2+B,MAAMx9B,OAASgjD,IAFoBljD,IAAK,CAGjD68B,IAAIqK,EAAQub,EAAaziD,GACrBA,EAAI,IACRsxB,EAAOwL,EAAMmF,OAAOiF,GAAQ3H,EAAKxC,EAAIuK,MAAMJ,IAE7C,OAAOnoC,MAwBTu7C,EAAUl7C,UAAUsgC,iBAAmB,SAASpO,EAAMiO,EAAIT,GACxD,IAAKA,EAAKmJ,UAAY3W,GAAQiO,GAAMxgC,KAAKo+B,IAAI3e,QAAQ8S,GAAMvoB,OAAOvG,QAAQ2Y,KAAM,CAC9E0hB,IAAIhQ,EW1MD,SAAqBsQ,EAAKriB,EAAK63B,GACpC9V,IAAIsgB,EAAOhgB,EAAI3e,QAAQ1D,GACvB,GAAIqiC,EAAKp0C,OAAO4zC,eAAeQ,EAAK/qC,QAAS+qC,EAAK/qC,QAASugC,GAAW,OAAO73B,EAE7E,GAAyB,GAArBqiC,EAAKlW,aACP,IAAKpK,IAAIwL,EAAI8U,EAAKjW,MAAQ,EAAGmB,GAAK,EAAGA,IAAK,CACxCxL,IAAIzqB,EAAQ+qC,EAAK/qC,MAAMi2B,GACvB,GAAI8U,EAAKre,KAAKuJ,GAAGsU,eAAevqC,EAAOA,EAAOugC,GAAW,OAAOwK,EAAKlb,OAAOoG,EAAI,GAChF,GAAIj2B,EAAQ,EAAG,OAAO,KAE1B,GAAI+qC,EAAKlW,cAAgBkW,EAAKp0C,OAAOvG,QAAQ2Y,KAC3C,IAAK0hB,IAAIwL,EAAI8U,EAAKjW,MAAQ,EAAGmB,GAAK,EAAGA,IAAK,CACxCxL,IAAIzqB,EAAQ+qC,EAAK/V,WAAWiB,GAC5B,GAAI8U,EAAKre,KAAKuJ,GAAGsU,eAAevqC,EAAOA,EAAOugC,GAAW,OAAOwK,EAAK7V,MAAMe,EAAI,GAC/E,GAAIj2B,EAAQ+qC,EAAKre,KAAKuJ,GAAG9C,WAAY,OAAO,MX4LlC4d,CAAYpkD,KAAKo+B,IAAK7L,EAAMwN,EAAKh4B,MAChC,MAAT+lB,IAAeyE,EAAOiO,EAAK1S,GAEjC,OAAO9tB,KAAKyjD,aAAalxB,EAAMiO,EAAI,IAAI,QAAM,WAASjO,KAAKwN,GAAO,EAAG,KAMvEwb,EAAUl7C,UAAUqgC,YAAc,SAASnO,EAAMiO,GAG/C,IAFA1C,IAAIC,EAAQ/9B,KAAKo+B,IAAI3e,QAAQ8S,GAAOyL,EAAMh+B,KAAKo+B,IAAI3e,QAAQ+gB,GACvD6jB,EAAUhC,EAActkB,EAAOC,GAC1B/8B,EAAI,EAAGA,EAAIojD,EAAQljD,OAAQF,IAAK,CACvC68B,IAAIqK,EAAQkc,EAAQpjD,GAAI05B,EAAO15B,GAAKojD,EAAQljD,OAAS,EACrD,GAAKw5B,GAAiB,GAATwN,GAAepK,EAAMgC,KAAKoI,GAAOpgC,KAAKolC,aAAa/C,SAC9D,OAAOpqC,KAAKqhD,OAAOtjB,EAAMwH,MAAM4C,GAAQnK,EAAIsH,IAAI6C,IACjD,GAAIA,EAAQ,IAAMxN,GAAQoD,EAAMgC,KAAKoI,EAAQ,GAAGkV,WAAWtf,EAAM1qB,MAAM80B,EAAQ,GAAInK,EAAIqK,WAAWF,EAAQ,KACxG,OAAOnoC,KAAKqhD,OAAOtjB,EAAMmF,OAAOiF,GAAQnK,EAAIuK,MAAMJ,IAEtD,IAAKrK,IAAIwL,EAAI,EAAGA,GAAKvL,EAAMoK,OAASmB,GAAKtL,EAAImK,MAAOmB,IAClD,GAAI/W,EAAOwL,EAAMwH,MAAM+D,IAAMvL,EAAMoK,MAAQmB,GAAK9I,EAAKzC,EAAMuH,IAAIgE,IAAMtL,EAAIsH,IAAIgE,GAAK9I,GAAMxC,EAAImK,MAAQmB,EAClG,OAAOtpC,KAAKqhD,OAAOtjB,EAAMmF,OAAOoG,GAAI9I,GAExC,OAAOxgC,KAAKqhD,OAAO9uB,EAAMiO,K,4aa/b3B,IAAM8jB,EACJ,SAAYC,EAAYp/C,G,WACtBnF,KAAKukD,WAAaA,EAClBvkD,KAAKwkD,MAAQr/C,EAAQq/C,OAAS,EAC9BxkD,KAAKykD,MAAQt/C,EAAQs/C,OAAS,QAC9BzkD,KAAK0kD,MAAQv/C,EAAQu/C,MACrB1kD,KAAK2kD,UAAY,KACjB3kD,KAAK4kD,QAAU,KACf5kD,KAAKwU,QAAU,KAEfxU,KAAKg1B,SAAW,CAAC,WAAY,UAAW,OAAQ,aAAajb,KAAG,SAACta,GAC/Dq+B,IAAIvF,EAAU,SAAAhlB,GAAE,OAAGvT,EAAKP,GAAM8T,IAE9B,OADF,EAAai7B,IAAI/sB,iBAAiBhiB,EAAM84B,GAC/B,MAAC94B,EAAI,QAAE84B,OAIpB,YAAEssB,QAAA,W,WACE7kD,KAAKg1B,SAASl0B,SAAO,SAAE,G,QAAO,K,mBAAad,EAAKukD,WAAW/V,IAAIsW,oBAAoBrlD,EAAM84B,OAG7F,YAAE7L,OAAA,SAAO63B,EAAYQ,GACK,MAAlB/kD,KAAK2kD,WAAqBI,EAAU3mB,KAAOmmB,EAAW/9C,MAAM43B,KAAKp+B,KAAKglD,iBAG9E,YAAEC,UAAA,SAAUlpC,GACJA,GAAO/b,KAAK2kD,YAChB3kD,KAAK2kD,UAAY5oC,EACN,MAAPA,GACJ,KAAO6oC,QAAQ/3B,WAAWC,YAAY9sB,KAAK4kD,SACzC5kD,KAAK4kD,QAAU,MAEjB,KAAOI,kBAIX,YAAEA,cAAA,WACElnB,IAA8DonB,EAA1D9G,EAAOp+C,KAAKukD,WAAW/9C,MAAM43B,IAAI3e,QAAQzf,KAAK2kD,WAClD,IAAKvG,EAAKp0C,OAAOu/B,cAAe,CAC9BzL,IAAIoF,EAASkb,EAAK1V,WAAYH,EAAQ6V,EAAK5V,UAC3C,GAAItF,GAAUqF,EAAO,CACrB,IAAM4c,EAAWnlD,KAAKukD,WAAWa,QAAQplD,KAAK2kD,WAAazhB,EAAQ,EAASgC,SAAW,IAAImgB,wBACrFxR,EAAM3Q,EAASiiB,EAASG,OAASH,EAAStR,IAC1C3Q,GAAUqF,IACZsL,GAAOA,EAAM7zC,KAAKukD,WAAWa,QAAQplD,KAAK2kD,WAAWU,wBAAwBxR,KAAO,GACtFqR,EAAO,CAACK,KAAMJ,EAASI,KAAMC,MAAOL,EAASK,MAAO3R,IAAKA,EAAM7zC,KAAKwkD,MAAQ,EAAGc,OAAQzR,EAAM7zC,KAAKwkD,MAAQ,IAG9G,IAAKU,EAAM,CACTpnB,IAAI2nB,EAASzlD,KAAKukD,WAAWmB,YAAY1lD,KAAK2kD,WAC9CO,EAAO,CAACK,KAAME,EAAOF,KAAOvlD,KAAKwkD,MAAQ,EAAGgB,MAAOC,EAAOF,KAAOvlD,KAAKwkD,MAAQ,EAAG3Q,IAAK4R,EAAO5R,IAAKyR,OAAQG,EAAOH,QAGnH,IAAIt7C,EAAShK,KAAKukD,WAAW/V,IAAImX,aAC5B3lD,KAAK4kD,UACR5kD,KAAK4kD,QAAU56C,EAAOiE,YAAYtL,SAASuW,cAAc,QACrDlZ,KAAK0kD,QAAO1kD,KAAK4kD,QAAQgB,UAAY5lD,KAAK0kD,OAC9C1kD,KAAK4kD,QAAQ72C,MAAMuf,QAAU,4EAA8EttB,KAAKykD,OAElH,IAAIoB,GAAc77C,GAAUA,GAAUrH,SAASmjD,MAA6C,UAArCC,iBAAiB/7C,GAAQmS,SAC1E,CAACopC,MAAOS,YAAanS,KAAMoS,aAAej8C,EAAOq7C,wBACvDrlD,KAAK4kD,QAAQ72C,MAAMw3C,KAAQL,EAAKK,KAAOM,EAAWN,KAAQ,KAC1DvlD,KAAK4kD,QAAQ72C,MAAM8lC,IAAOqR,EAAKrR,IAAMgS,EAAWhS,IAAO,KACvD7zC,KAAK4kD,QAAQ72C,MAAMy2C,MAASU,EAAKM,MAAQN,EAAKK,KAAQ,KACtDvlD,KAAK4kD,QAAQ72C,MAAMm4C,OAAUhB,EAAKI,OAASJ,EAAKrR,IAAO,MAG3D,YAAEsS,gBAAA,SAAgB3xC,G,WACdP,aAAajU,KAAKwU,SAClBxU,KAAKwU,QAAUR,YAAW,WAAG,OAAGhU,EAAKilD,UAAU,QAAOzwC,IAG1D,YAAE4xC,SAAA,SAAS5tB,GACP,GAAKx4B,KAAKukD,WAAW8B,SAArB,CACA,IAAItqC,EAAM/b,KAAKukD,WAAW+B,YAAY,CAACf,KAAM/sB,EAAM+tB,QAAS1S,IAAKrb,EAAMguB,UACvE,GAAIzqC,EAAK,CACP+hB,IAAIz4B,EAAS0W,EAAIA,IACb/b,KAAKukD,WAAWkC,UAAYzmD,KAAKukD,WAAWkC,SAAS1jD,OAEzC,OADhB,EAAW,YAAU/C,KAAKukD,WAAW/9C,MAAM43B,IAAK/4B,EAAQrF,KAAKukD,WAAWkC,SAAS1jD,UAC3DsC,EAAS0W,EAAIA,KAEnC/b,KAAKilD,UAAU5/C,GACfrF,KAAKmmD,gBAAgB,QAI3B,YAAEO,QAAA,WACE1mD,KAAKmmD,gBAAgB,KAGzB,YAAEQ,KAAA,WACE3mD,KAAKmmD,gBAAgB,KAGzB,YAAES,UAAA,SAAUpuB,GACJA,EAAMnzB,QAAUrF,KAAKukD,WAAW/V,KAAQxuC,KAAKukD,WAAW/V,IAAIkI,SAASle,EAAMquB,gBAC7E7mD,KAAKilD,UAAU,O,aCnHR,EAAS,YAEpB,WAAY7G,GACVlgB,OAAK,KAACkgB,EAAMA,G,4FACb,E,YAEDrkC,IAAA,SAAIqkB,EAAKQ,GACPd,IAAIsgB,EAAOhgB,EAAI3e,QAAQmf,EAAQ7kB,IAAI/Z,KAAKwrB,OACxC,OAAOs7B,EAAUC,MAAM3I,GAAQ,IAAI0I,EAAU1I,GAAQxd,EAAUC,KAAKud,I,YAGtE36C,QAAA,WAAY,OAAO,QAAMw8B,O,YAEzBkD,GAAA,SAAGhd,GACD,OAAOA,aAAiB2gC,GAAa3gC,EAAMqF,MAAQxrB,KAAKwrB,M,YAG1DiK,OAAA,WACE,MAAO,CAAC1tB,KAAM,YAAagU,IAAK/b,KAAKwrB,OAGvC,EAAOkY,SAAA,SAAStF,EAAKuF,GACnB,GAAuB,iBAAZA,EAAK5nB,IAAiB,MAAM,IAAI+iB,WAAW,wCACtD,OAAO,IAAIgoB,EAAU1oB,EAAI3e,QAAQkkB,EAAK5nB,O,YAGxCirC,YAAA,WAAgB,OAAO,IAAIC,EAAYjnD,KAAKknD,SAE5C,EAAOH,MAAA,SAAM3I,GACXtgB,IAAI9zB,EAASo0C,EAAKp0C,OAClB,GAAIA,EAAOmtC,cAgEf,SAAsBiH,GACpB,IAAKtgB,IAAIwL,EAAI8U,EAAKjW,MAAOmB,GAAK,EAAGA,IAAK,CACpCxL,IAAIzqB,EAAQ+qC,EAAK/qC,MAAMi2B,GAEvB,GAAa,GAATj2B,EAEJ,IAAKyqB,IAAIoF,EAASkb,EAAKre,KAAKuJ,GAAGjE,MAAMhyB,EAAQ,IAAK6vB,EAASA,EAAO8C,UAAW,CAC3E,GAA0B,GAArB9C,EAAOsD,aAAoBtD,EAAOqG,eAAkBrG,EAAOikB,QAAUjkB,EAAOn7B,KAAKo6B,KAAKqb,UAAW,OAAO,EAC7G,GAAIta,EAAOqG,cAAe,OAAO,GAIrC,OAAO,EA5EsB6d,CAAahJ,KA+E5C,SAAqBA,GACnB,IAAKtgB,IAAIwL,EAAI8U,EAAKjW,MAAOmB,GAAK,EAAGA,IAAK,CACpCxL,IAAIzqB,EAAQ+qC,EAAK/V,WAAWiB,GAAIt/B,EAASo0C,EAAKre,KAAKuJ,GACnD,GAAIj2B,GAASrJ,EAAOw8B,WACpB,IAAK1I,IAAIyK,EAAQv+B,EAAOq7B,MAAMhyB,IAASk1B,EAAQA,EAAM1a,WAAY,CAC/D,GAAyB,GAApB0a,EAAM/B,aAAoB+B,EAAMgB,eAAkBhB,EAAM4e,QAAU5e,EAAMxgC,KAAKo6B,KAAKqb,UAAW,OAAO,EACzG,GAAIjV,EAAMgB,cAAe,OAAO,GAGpC,OAAO,EAxF6C8d,CAAYjJ,GAAO,OAAO,EAC5EtgB,IAAIwpB,EAAWt9C,EAAOjC,KAAKo6B,KAAKolB,eAChC,GAAgB,MAAZD,EAAkB,OAAOA,EAC7BxpB,IAAImZ,EAAQjtC,EAAOktC,eAAekH,EAAK/qC,SAASi5B,YAChD,OAAO2K,GAASA,EAAME,aAGxB,EAAOqQ,SAAA,SAASpJ,EAAM9nC,EAAKmxC,GACzBnwB,EAAQ,OAAS,CACf,IAAKmwB,GAAYX,EAAUC,MAAM3I,GAAO,OAAOA,EAG/C,IAFAtgB,IAAI/hB,EAAMqiC,EAAKriC,IAAKlL,EAAO,KAElBy4B,EAAI8U,EAAKjW,OAAQmB,IAAK,CAC7BxL,IAAI9zB,EAASo0C,EAAKre,KAAKuJ,GACvB,GAAIhzB,EAAM,EAAI8nC,EAAK/V,WAAWiB,GAAKt/B,EAAOw8B,WAAa4X,EAAK/qC,MAAMi2B,GAAK,EAAG,CACxEz4B,EAAO7G,EAAOq7B,MAAM/uB,EAAM,EAAI8nC,EAAK/V,WAAWiB,GAAK8U,EAAK/qC,MAAMi2B,GAAK,GACnE,MACK,GAAS,GAALA,EACT,OAAO,KAETvtB,GAAOzF,EACPwnB,IAAI4pB,EAAOtJ,EAAKhgB,IAAI3e,QAAQ1D,GAC5B,GAAI+qC,EAAUC,MAAMW,GAAO,OAAOA,EAIpC,OAAS,CACP5pB,IAAIggB,EAASxnC,EAAM,EAAIzF,EAAKgd,WAAahd,EAAKm1B,UAC9C,IAAK8X,EAAQ,CACX,GAAIjtC,EAAKs2C,SAAWt2C,EAAKg1B,SAAW,gBAAc8hB,aAAa92C,GAAO,CACpEutC,EAAOA,EAAKhgB,IAAI3e,QAAQ1D,EAAMlL,EAAKq0B,SAAW5uB,GAC9CmxC,GAAW,EACX,SAASnwB,EAEX,MAEFzmB,EAAOitC,EACP/hC,GAAOzF,EACPwnB,IAAI4pB,EAAOtJ,EAAKhgB,IAAI3e,QAAQ1D,GAC5B,GAAI+qC,EAAUC,MAAMW,GAAO,OAAOA,EAGpC,OAAO,O,EAxES,CAAS,aA6E/B,EAAUrnD,UAAUunD,SAAU,EAE9B,YAAUxL,OAAO,YAAa,GAE9B,IAAM6K,EACJ,SAAYlrC,GACV/b,KAAK+b,IAAMA,GAEf,YAAEhC,IAAA,SAAI6kB,GACF,OAAO,IAAIqoB,EAAYroB,EAAQ7kB,IAAI/Z,KAAK+b,OAE5C,YAAE0D,QAAA,SAAQ2e,GACN,IAAIggB,EAAOhgB,EAAI3e,QAAQzf,KAAK+b,KAC5B,OAAO,EAAUgrC,MAAM3I,GAAQ,IAAI,EAAUA,GAAQ,YAAUvd,KAAKud,ICjF5D,IAiBN,EAAgB,YAAe,CACjC,UAAW,EAAM,SAAU,GAC3B,WAAY,EAAM,QAAS,GAC3B,QAAS,EAAM,QAAS,GACxB,UAAW,EAAM,OAAQ,KAG7B,SAAS,EAAM,EAAM,GACjBtgB,IAAE,EAAiB,QAAR,EAAkB,EAAM,EAAI,OAAS,KAAS,EAAM,EAAI,QAAU,OAC7E,OAAK,SAAS,EAAO,EAAU,GAC/BA,IAAI,EAAM,EAAM,UACZ,EAAS,EAAM,EAAI,EAAI,IAAM,EAAI,MAAO,EAAW,EAAI,MAC3D,GAAI,aAAe,gBAAe,CAChC,IAAK,EAAK,eAAe,IAA2B,GAAhB,EAAO,MAAY,OAAO,EAC9D,GAAW,EACX,EAAS,EAAM,IAAI,QAAQ,EAAM,EAAI,EAAO,QAAU,EAAO,UAE/DA,IAAI,EAAS,EAAU,SAAS,EAAQ,EAAK,GAC7C,QAAK,IACD,GAAU,EAAS,EAAM,GAAG,aAAa,IAAI,EAAU,MACpD,IAIX,SAAS,EAAY,EAAM,EAAK,GAC5B,IAAG,EAAK,SAAU,OAAO,EAC3BA,IAAI,EAAO,EAAK,MAAM,IAAI,QAAQ,GAChC,IAAG,EAAU,MAAM,GAAO,OAAO,EACjC,IAAG,EAAU,EAAK,YAAY,CAAC,KAAM,EAAM,QAAS,IAAK,EAAM,UAA5D,OACL,QAAI,GAAU,GAAK,gBAAc,aAAa,EAAK,MAAM,IAAI,OAAO,OAClE,EAAG,SAAS,EAAK,MAAM,GAAG,aAAa,IAAI,EAAU,MAChD,GAGT,SAAS,EAAc,GACrB,KAAM,EAAM,qBAAqB,GAAY,OAAO,KACpDA,IAAI,EAAO,SAAS,cAAc,OAElC,OADA,EAAK,UAAY,wBACV,IAAc,OAAO,EAAM,IAAK,CAAC,IAAW,OAAO,EAAM,UAAU,KAAM,EAAM,CAAC,IAAK,gB;;;;;ECjD9F,SAAS+pB,EAAWvkD,GAClB,OAAOA,EAAIC,QAAQ,uBAAuB,SAACukD,EAAMz0C,GAAP,OAA2B,IAAVA,EAAcy0C,EAAKnwC,cAAgBmwC,EAAKxnC,iBAAe/c,QAAQ,OAAQ,I,IAG9HwkD,E,WACJ,WAAYC,EAAZ,GAQG,IAPDC,EAOC,EAPDA,OACAC,EAMC,EANDA,UACAl+C,EAKC,EALDA,OACA+1B,EAIC,EAJDA,KACAooB,EAGC,EAHDA,KACAC,EAEC,EAFDA,YACAC,EACC,EADDA,OACC,UACDroD,KAAKgoD,UAAYA,EACjBhoD,KAAKioD,OAASA,EACdjoD,KAAKkoD,UAAYA,EACjBloD,KAAKgK,OAASA,EACdhK,KAAK+/B,KAAOA,EACZ//B,KAAKmoD,KAAOA,EACZnoD,KAAKooD,YAAcA,EACnBpoD,KAAKsoD,SAAWtoD,KAAK+/B,KAAKd,MAC1Bj/B,KAAKuoD,QAAUvoD,KAAKsoD,OACpBtoD,KAAKqoD,OAASroD,KAAKuoD,OAASvoD,KAAKwoD,WAAaH,EAC9CroD,KAAKyoD,eAAgB,EACrBzoD,KAAKwuC,IAAMxuC,KAAK0oD,YAChB1oD,KAAK21C,WAAa31C,KAAK2oD,GAAGC,MAAMnlD,Q,8CAGtB,WACJolD,EAAYC,UAAI7lD,OAAOjD,KAAKgoD,WAC5B/jB,EAAQ,CACZgkB,OAAQjoD,KAAKioD,OACbloB,KAAM//B,KAAK+/B,KACXooB,KAAMnoD,KAAKmoD,KACXE,OAAQ,kBAAM,EAAKA,UACnBD,YAAapoD,KAAKooD,YAClBW,UAAU,EACV5jD,QAASnF,KAAKkoD,UAAU/iD,QACxB6jD,YAAa,SAAAlhB,GAAK,OAAI,EAAKkhB,YAAYlhB,KAezC,MAZ2C,mBAAhC9nC,KAAKkoD,UAAUrpB,eACxB7+B,KAAK6+B,aAAe7+B,KAAKkoD,UAAUrpB,cAGA,mBAA1B7+B,KAAKkoD,UAAUx7B,SACxB1sB,KAAK0sB,OAAS1sB,KAAKkoD,UAAUx7B,QAG/B1sB,KAAK2oD,GAAK,IAAIE,EAAU,CACtB7+C,OAAQhK,KAAKgK,OACbi/C,UAAWhlB,IACVilB,SACIlpD,KAAK2oD,GAAGQ,M,6BAGVppB,EAAMqoB,GACX,OAAIroB,EAAKh4B,OAAS/H,KAAK+/B,KAAKh4B,OAIxBg4B,IAAS//B,KAAK+/B,MAAQ//B,KAAKooD,cAAgBA,IAI/CpoD,KAAK+/B,KAAOA,EACZ//B,KAAKooD,YAAcA,EACnBpoD,KAAKopD,qBAAqB,CACxBrpB,OACAqoB,kBAPO,K,2CAYUnkB,GAAO,WAC1B,GAAKjkC,KAAK2oD,GAAGU,OAAb,CAOA,IAAMC,EAAiBR,UAAIvpC,OAAOgqC,OAClCT,UAAIvpC,OAAOgqC,QAAS,EACpBnpD,OAAOuR,QAAQsyB,GAAOnjC,SAAQ,YAAkB,aAAhBM,EAAgB,KAAXqD,EAAW,KAC9C,EAAKkkD,GAAGU,OAAOjoD,GAAOqD,KAIxBqkD,UAAIvpC,OAAOgqC,OAASD,K,kCAGVxhB,GACV,GAAK9nC,KAAKmoD,KAAK9B,SAAf,CADiB,IAMf7/C,EACExG,KAAKmoD,KADP3hD,MAGAuB,EACE/H,KAAK+/B,KADPh4B,KAEIgU,EAAM/b,KAAKqoD,SACXmB,EAAW,EAAH,KAAQxpD,KAAK+/B,KAAK+H,OAC3BA,GAEC2hB,EAAczpD,KAAKuoD,OAAS/hD,EAAMi7B,GAAGof,WAAW9kC,EAAIwW,KAAMxW,EAAIykB,GAAIz4B,GAAMy4C,QAAQzkC,EAAIwW,KAAMxW,EAAIykB,GAAIz4B,EAAKuG,OAAOk7C,IAAahjD,EAAMi7B,GAAGue,cAAcjkC,EAAK,KAAMytC,GACnKxpD,KAAKmoD,KAAKuB,SAASD,M,qCAKNE,GAEb,MAAsB,cAAlBA,EAAS5hD,QAIR/H,KAAK21C,aAIF31C,KAAK21C,WAAWe,SAASiT,EAAStkD,W,gCAIlCmzB,GAAO,WACf,GAAwC,mBAA7Bx4B,KAAKkoD,UAAU0B,UACxB,OAAO5pD,KAAKkoD,UAAU0B,UAAUpxB,GAGlC,IAAMqxB,IAAc7pD,KAAKkoD,UAAUznB,OAAOopB,UAE1C,GAAIA,GAA4B,cAAfrxB,EAAMzwB,KAAsB,CAC3C,IAAM+hD,EAAatxB,EAAMnzB,OAAO0kD,SAAWvxB,EAAMnzB,OAAO0kD,QAAQ,sBACtCD,IAAe9pD,KAAKwuC,MAAQsb,GAAc9pD,KAAKwuC,IAAIkI,SAASoT,MAGpF9pD,KAAKyoD,eAAgB,EACrB9lD,SAAS8e,iBAAiB,WAAW,WACnC,EAAKgnC,eAAgB,IACpB,CACD9yC,MAAM,KAKZ,IAAMq0C,EAAwB,SAAfxxB,EAAMzwB,KACfkiD,EAAyB,UAAfzxB,EAAMzwB,KAChBmiD,EAAuB,QAAf1xB,EAAMzwB,KACdoiD,EAAS3xB,EAAMzwB,KAAKqiD,WAAW,SAA0B,SAAf5xB,EAAMzwB,KAEtD,QAAI8hD,GAAaM,GAAUH,GAAUC,GAAWC,IAIzClqD,KAAKyoD,gB,mCAIZzoD,KAAKopD,qBAAqB,CACxBL,UAAU,M,qCAKZ/oD,KAAKopD,qBAAqB,CACxBL,UAAU,M,mCAKZ,IAAMhtC,EAAM/b,KAAKmoD,KAAKkC,SAASrqD,KAAKwuC,KAC9B8b,EAActqD,KAAKmoD,KAAK3hD,MAAM43B,IAAI3e,QAAQ1D,GAEhD,OADcwuC,YAAaD,EAAatqD,KAAK+/B,KAAKh4B,Q,gCAKlD/H,KAAK2oD,GAAG6B,e,KAKNC,E,uEAEDjyB,EAAOx3B,GASR,OARAhB,KAAK0qD,WAAa1qD,KAAK0qD,YAAc,GAEhC1qD,KAAK0qD,WAAWlyB,KACnBx4B,KAAK0qD,WAAWlyB,GAAS,IAG3Bx4B,KAAK0qD,WAAWlyB,GAAOrjB,KAAKnU,GAErBhB,O,2BAGJw4B,GAAgB,kCAANvjB,EAAM,iCAANA,EAAM,kBACnBjV,KAAK0qD,WAAa1qD,KAAK0qD,YAAc,GACrC,IAAMC,EAAY3qD,KAAK0qD,WAAWlyB,GAMlC,OAJImyB,GACFA,EAAU7pD,SAAQ,SAAAk3B,GAAQ,OAAIA,EAASrrB,MAAM,EAAMsI,MAG9CjV,O,0BAMLw4B,EAAOx3B,GACT,GAAKgC,UAAU7B,OAER,CAEL,IAAMwpD,EAAY3qD,KAAK0qD,WAAa1qD,KAAK0qD,WAAWlyB,GAAS,KAEzDmyB,IACE3pD,EACFhB,KAAK0qD,WAAWlyB,GAASmyB,EAAU3wC,QAAO,SAAA4wC,GAAE,OAAIA,IAAO5pD,YAEhDhB,KAAK0qD,WAAWlyB,SAT3Bx4B,KAAK0qD,WAAa,GAcpB,OAAO1qD,S,KAKL6qD,E,WACJ,aAA0B,IAAd1lD,EAAc,uDAAJ,GAAI,UACxBnF,KAAKmF,QAAL,OAAoBnF,KAAK8qD,gBACpB3lD,G,yCAKL,OAAO,O,mCAGiB,IAAf8iD,EAAe,uDAAN,KAClBjoD,KAAKioD,OAASA,I,mCAoBd,MAAO,K,mCAIP,MAAO,K,6BAIP,MAAO,K,2BAxBP,OAAO,O,2BAIP,MAAO,c,qCAIP,MAAO,K,8BAIP,MAAO,O,KAiBL8C,E,WACJ,aAAqC,IAAzBC,EAAyB,uDAAZ,GAAI/C,EAAQ,iDACnC+C,EAAWlqD,SAAQ,SAAAonD,GACjBA,EAAU+C,WAAWhD,GACrBC,EAAUhvB,UAEZl5B,KAAKgrD,WAAaA,E,6CAoDjB,IADDvqB,EACC,EADDA,OAEMyqB,EAAmBlrD,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,aAAahrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAU54C,QAAMyK,KAAI,SAAAmuC,GAAS,OAAIA,EAAU54C,KAAK,CACvKmxB,cAEI0qB,EAAkBnrD,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,OAAQ,QAAQhrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAU54C,QAAMyK,KAAI,SAAAmuC,GAAS,OAAIA,EAAU54C,KAAK,CACzKvH,KAAM04B,EAAO,GAAG51B,OAAOq9C,EAAUngD,KAAM,MAAMmgD,EAAUzoD,MACvDghC,cAEF,MAAO,YAAIyqB,GAAJ,EAAyBC,IAAiBpxC,KAAI,SAAAzK,GAAI,OAAI87C,YAAO97C,Q,oCAMnE,IAFDmxB,EAEC,EAFDA,OACA4qB,EACC,EADDA,mBAEA,KAAMA,aAA8Bn2C,QAAUm2C,EAAoB,MAAO,GACzE,IAAMC,EAAoBD,aAA8Bn2C,MAAQlV,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,OAAKmD,EAAmBnuC,SAASgrC,EAAUzoD,SAASO,KAAKgrD,WACnJO,EAAsBD,EAAkBtxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,aAAahrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAUsD,cAAYzxC,KAAI,SAAAmuC,GAAS,OAAIA,EAAUsD,WAAW,CACxL/qB,cAEIgrB,EAAqBH,EAAkBtxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,OAAQ,QAAQhrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAUsD,cAAYzxC,KAAI,SAAAmuC,GAAS,OAAIA,EAAUsD,WAAW,CAC1LzjD,KAAM04B,EAAO,GAAG51B,OAAOq9C,EAAUngD,KAAM,MAAMmgD,EAAUzoD,MACvDghC,cAEF,MAAO,YAAI8qB,GAAJ,EAA4BE,IAAoB/f,QAAO,SAACggB,EAAeF,GAAhB,kBAAmCE,GAAnC,EAAqDF,MAAa,M,oCAM/H,IAFD/qB,EAEC,EAFDA,OACA4qB,EACC,EADDA,mBAEA,KAAMA,aAA8Bn2C,QAAUm2C,EAAoB,MAAO,GACzE,IAAMC,EAAoBD,aAA8Bn2C,MAAQlV,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,OAAKmD,EAAmBnuC,SAASgrC,EAAUzoD,SAASO,KAAKgrD,WACnJW,EAAsBL,EAAkBtxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,aAAahrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAU0D,cAAY7xC,KAAI,SAAAmuC,GAAS,OAAIA,EAAU0D,WAAW,CACxLnrB,cAEIorB,EAAqBP,EAAkBtxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,OAAQ,QAAQhrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAU0D,cAAY7xC,KAAI,SAAAmuC,GAAS,OAAIA,EAAU0D,WAAW,CAC1L7jD,KAAM04B,EAAO,GAAG51B,OAAOq9C,EAAUngD,KAAM,MAAMmgD,EAAUzoD,MACvDghC,cAEF,MAAO,YAAIkrB,GAAJ,EAA4BE,IAAoBngB,QAAO,SAACogB,EAAeF,GAAhB,kBAAmCE,GAAnC,EAAqDF,MAAa,M,kCAM/H,IAFDnrB,EAEC,EAFDA,OACA0nB,EACC,EADDA,KAEA,OAAOnoD,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,OAAIA,EAAU6D,YAAUrgB,QAAO,SAACsgB,EAAa9D,GAAc,IAE9FzoD,EAEEyoD,EAFFzoD,KACAsI,EACEmgD,EADFngD,KAEIgkD,EAAW,GACXtnD,EAAQyjD,EAAU6D,SAAV,GACZtrB,UACI,CAAC,OAAQ,QAAQvjB,SAASnV,GAAQ,CACpCA,KAAM04B,EAAO,GAAG51B,OAAO9C,EAAM,MAAMtI,IACjC,KAGAkN,EAAQ,SAACi+C,EAAI9iB,GACjB,QAAKqgB,EAAK9B,WAIV8B,EAAK8D,QACErB,EAAG9iB,EAAH8iB,CAAUzC,EAAK3hD,MAAO2hD,EAAKuB,SAAUvB,KAGxC+D,EAAS,SAACC,EAAOC,GACjBl3C,MAAM5U,QAAQ8rD,GAChBL,EAASI,GAAS,SAAArkB,GAAK,OAAIskB,EAAOtrD,SAAQ,SAAAk3B,GAAQ,OAAIrrB,EAAMqrB,EAAU8P,OAC3C,mBAAXskB,IAChBL,EAASI,GAAS,SAAArkB,GAAK,OAAIn7B,EAAMy/C,EAAQtkB,MAY7C,MARqB,WAAjB,EAAOrjC,GACTrE,OAAOuR,QAAQlN,GAAO3D,SAAQ,YAAiC,aAA/BurD,EAA+B,KAAlBC,EAAkB,KAC7DJ,EAAOG,EAAaC,MAGtBJ,EAAOzsD,EAAMgF,GAGf,OAAYunD,GACPD,KAEJ,M,4BAxIH,OAAO/rD,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,MAAuB,SAAnBA,EAAUngD,QAAiB2jC,QAAO,SAAC7D,EAAD,OAC3EpoC,EAD2E,EAC3EA,KACAghC,EAF2E,EAE3EA,OAF2E,cAGjEoH,GAHiE,QAI1EpoC,EAAOghC,MACN,M,8BAGQ,IAEV0nB,EACEnoD,KADFmoD,KAEF,OAAOnoD,KAAKgrD,WAAWtf,QAAO,SAAC7D,EAAOqgB,GAAR,cAA4BrgB,GAA5B,QAC3BqgB,EAAUzoD,KAAO,IAAI8sD,MAAMrE,EAAU/iD,QAAS,CAC7C2F,IAD6C,SACzC/J,EAAK8hB,EAAMpe,GACb,IAAM+nD,EAAUzrD,EAAI8hB,KAAUpe,EAS9B,OARArE,OAAOyX,OAAO9W,EAAd,KACG8hB,EAAOpe,IAGN+nD,GACFrE,EAAKsE,YAAYtE,EAAK3hD,QAGjB,SAIT,M,4BAIJ,OAAOxG,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,MAAuB,SAAnBA,EAAUngD,QAAiB2jC,QAAO,SAACzM,EAAD,OAC3Ex/B,EAD2E,EAC3EA,KACAghC,EAF2E,EAE3EA,OAF2E,cAGjExB,GAHiE,QAI1Ex/B,EAAOghC,MACN,M,8BAIJ,OAAOzgC,KAAKgrD,WAAWhxC,QAAO,SAAAkuC,GAAS,OAAIA,EAAUnmB,WAAS2J,QAAO,SAACghB,EAAD,OACnE3qB,EADmE,EACnEA,QADmE,kBAE3D2qB,GAF2D,EAE5C3qB,MAAU,Q,KAkGvC,SAAS4qB,EAAWxhC,GAEhB,IAAMpd,EAAQpL,SAASuW,cAAc,SACrCnL,EAAMhG,KAAO,WACbgG,EAAM6+C,YAAczhC,EAHe,IAKjCK,EACE7oB,SADF6oB,KAGAqC,EACErC,EADFqC,WAGEA,EACFrC,EAAKkC,aAAa3f,EAAO8f,GAEzBrC,EAAKvd,YAAYF,G,IAKjB66B,E,8BACJ,aAA0B,IAAdzjC,EAAc,uDAAJ,GAAI,6BAClBA,G,4CAgBN,OAAO,e,2BAZP,MAAO,S,2BAIP,OAAO,O,6BAIP,OAAO,S,GAdQ0lD,GAuBnB,SAASgC,IAAoC,IAA7BpoD,EAA6B,uDAArB,EAAGoE,EAAkB,uDAAZ,EAAGqmB,EAAS,uDAAH,EACxC,OAAOtvB,KAAKiJ,IAAIjJ,KAAKsvB,IAAIiO,SAAS14B,EAAO,IAAKoE,GAAMqmB,G,IAGhD49B,E,8BACJ,aAA0B,IAAd3nD,EAAc,uDAAJ,GAAI,6BAClBA,G,4CAgBN,OAAO,e,2BAZP,MAAO,S,2BAIP,OAAO,O,6BAIP,OAAO,S,GAdQ0lD,GAuBbkC,E,2HAEF,MAAO,Q,6BAIP,MAAO,CACLtpD,QAAS,c,GAPGqpD,GAaZE,E,kIAmBD,IADDjlD,EACC,EADDA,KAEA,OAAO,kBAAM03C,YAAa13C,M,2BAlB1B,MAAO,c,6BAIP,MAAO,CACLtE,QAAS,UACTwpD,MAAO,QACPpD,WAAW,EACXra,SAAU,CAAC,CACT7zB,IAAK,MAEPg8B,MAAO,iBAAM,CAAC,IAAK,S,GAbDmV,GAyBlBI,E,2HAEF,MAAO,S,6BAIP,MAAO,CACLD,MAAO,c,GAPMH,GAaf3hC,EAAM,+6BAEJgiC,E,8BACJ,aAA0B,MAAdhoD,EAAc,uDAAJ,GAAI,kBACxB,gBACK2lD,eAAiB,CACpBsC,YAAa,GACb/G,UAAU,EACVgH,UAAW,KACXrC,WAAY,GACZvnD,QAAS,GACT0vC,QAAS,MACTma,cAAe,CACbvlD,KAAM,MACNtE,QAAS,CAAC,CACRsE,KAAM,eAGVwlD,sBAAsB,EACtBC,mBAAmB,EACnBC,mBAAmB,EACnBC,WAAY,GACZC,kBAAkB,EAClBC,iBAAiB,EACjBC,aAAc,GACdlB,WAAW,EACXmB,OAAQ,aACRC,cAAe,aACfC,SAAU,aACVC,QAAS,aACTC,OAAQ,aACRC,QAAS,aACTC,OAAQ,cAEV,EAAKC,OAAS,CAAC,OAAQ,cAAe,SAAU,QAAS,OAAQ,QAAS,QAC1E,EAAKn1B,KAAK/zB,GAhCc,E,yCAmCP,WAAdA,EAAc,uDAAJ,GACbnF,KAAKsuD,WAAL,OAAqBtuD,KAAK8qD,gBACrB3lD,IAELnF,KAAKuuD,SAAU,EACfvuD,KAAKu+B,UAAY,CACfhM,KAAM,EACNiO,GAAI,GAENxgC,KAAK4kD,QAAUjiD,SAASuW,cAAc,OACtClZ,KAAKgrD,WAAahrD,KAAKwuD,mBACvBxuD,KAAK6nC,MAAQ7nC,KAAKyuD,cAClBzuD,KAAKi/B,MAAQj/B,KAAK0uD,cAClB1uD,KAAKygC,OAASzgC,KAAK2uD,eACnB3uD,KAAK+hC,QAAU/hC,KAAK4uD,gBACpB5uD,KAAK6uD,QAAU7uD,KAAK8uD,gBACpB9uD,KAAKwrD,WAAaxrD,KAAK+uD,mBACvB/uD,KAAK4rD,WAAa5rD,KAAKgvD,mBACvBhvD,KAAKmoD,KAAOnoD,KAAKivD,aACjBjvD,KAAK+rD,SAAW/rD,KAAKkvD,iBACrBlvD,KAAKmvD,yBAEDnvD,KAAKmF,QAAQwnD,WACfA,EAAUxhC,GAGmB,OAA3BnrB,KAAKmF,QAAQkoD,WACfrtD,KAAKisD,MAAMjsD,KAAKmF,QAAQkoD,WAG1BrtD,KAAKquD,OAAOvtD,SAAQ,SAAArB,GAClB,EAAKgW,GAAGhW,EAAM,EAAK0F,QAAQ0iD,EAAU,MAAMh9C,OAAOpL,MAAY,iBAEhEO,KAAK+V,KAAK,OAAQ,CAChBoyC,KAAMnoD,KAAKmoD,KACX3hD,MAAOxG,KAAKwG,QAGdxG,KAAKgrD,WAAW7C,KAAOnoD,KAAKmoD,O,iCAGnBhjD,GACTnF,KAAKmF,QAAL,OAAoBnF,KAAKmF,SACpBA,GAGDnF,KAAKmoD,MAAQnoD,KAAKwG,OACpBxG,KAAKmoD,KAAKsE,YAAYzsD,KAAKwG,S,yCAiB7B,OAAO,IAAIukD,EAAJ,YAAyB/qD,KAAKovD,mBAA9B,EAAoDpvD,KAAKmF,QAAQ6lD,aAAahrD,Q,sCAIrF,OAAOA,KAAKgrD,WAAWjpB,U,sCAIvB,OAAO/hC,KAAKgrD,WAAW6D,QAAQ,CAC7BpuB,OAAQzgC,KAAKygC,W,yCAKf,OAAOzgC,KAAKgrD,WAAWQ,WAAW,CAChC/qB,OAAQzgC,KAAKygC,OACb4qB,mBAAoBrrD,KAAKmF,QAAQqoD,sB,yCAKnC,OAAOxtD,KAAKgrD,WAAWY,WAAW,CAChCnrB,OAAQzgC,KAAKygC,OACb4qB,mBAAoBrrD,KAAKmF,QAAQsoD,sB,uCAKnC,OAAOztD,KAAKgrD,WAAWe,SAAS,CAC9BtrB,OAAQzgC,KAAKygC,OACb0nB,KAAMnoD,KAAKmoD,S,oCAKb,OAAOnoD,KAAKgrD,WAAWnjB,Q,oCAIvB,OAAO7nC,KAAKgrD,WAAW/rB,Q,qCAIvB,OAAO,IAAIowB,SAAO,CAChBlc,QAASnzC,KAAKmF,QAAQguC,QACtBtL,MAAO7nC,KAAK6nC,MACZ5I,MAAOj/B,KAAKi/B,U,oCAIF,IHlsBW95B,EGksBX,OACZ,OAAOi9B,cAAY9zB,OAAO,CACxBmyB,OAAQzgC,KAAKygC,OACbrC,IAAKp+B,KAAKsvD,eAAetvD,KAAKmF,QAAQ1B,SACtCs+B,QAAS,GAAF,SAAM/hC,KAAK+hC,SAAX,CAAoBypB,YAAW,CACpCpd,MAAOpuC,KAAKwrD,cADP,EAEAxrD,KAAK4rD,YAFL,EAEoB5rD,KAAK6uD,SAFzB,CAEkCzD,YAAO,CAC9CmE,UAAWC,MACTpE,YAAOqE,MAJJ,EAIqBzvD,KAAKmF,QAAQwoD,iBAAmB,EH1sBvCxoD,EG0sBmDnF,KAAKmF,QAAQuoD,gB,UH1sBtD,IAC5B,IAAI,SAAO,CAChBvF,KAAA,SAAK5D,GAAc,OAAO,IAAID,EAAeC,EAAYp/C,QGwsB6C,IAJ7F,EAIsGnF,KAAKmF,QAAQyoD,gBAAkB,CD7sBzI,IAAI,SAAO,CAChB,MAAO,CACL,YAAa,EAEb,gCAAuB,EAAO,EAAS,GACrC,GAAI,EAAQ,KAAO,EAAM,KAAO,EAAU,MAAM,GAAQ,OAAO,IAAI,EAAU,I,YAG/E,E,cACA,MCosB4J,IAJrJ,CAI0J,IAAI9kC,SAAO,CAC1K1nB,IAAK,IAAIijC,YAAU,YACnBJ,MAAO,CACLoiB,SAAU,kBAAM,EAAKlhD,QAAQkhD,aAE7B,IAAIv9B,SAAO,CACbmb,MAAO,CACLyrB,WAAY,CACVC,SAAU,GAEZC,gBAAiB,CACf3D,MAAO,SAAC9D,EAAM3vB,GACZ,EAAK+1B,SAAU,EACf,EAAKx4C,KAAK,QAAS,CACjByiB,QACAhyB,MAAO2hD,EAAK3hD,MACZ2hD,SAEF,IAAMsB,EAAc,EAAKjjD,MAAMi7B,GAAGX,QAAQ,WAAW,GACrD,EAAKqnB,KAAKuB,SAASD,IAErBoG,KAAM,SAAC1H,EAAM3vB,GACX,EAAK+1B,SAAU,EACf,EAAKx4C,KAAK,OAAQ,CAChByiB,QACAhyB,MAAO2hD,EAAK3hD,MACZ2hD,SAEF,IAAMsB,EAAc,EAAKjjD,MAAMi7B,GAAGX,QAAQ,WAAW,GACrD,EAAKqnB,KAAKuB,SAASD,QAIvB,IAAI3gC,SAAO,CACbmb,MAAOjkC,KAAKmF,QAAQioD,oB,qCAKX3pD,GAAmD,IAA1CoqD,EAA0C,uDAA3B7tD,KAAKmF,QAAQ0oD,aAClD,GAAgB,OAAZpqD,EACF,OAAOzD,KAAKygC,OAAOiH,aAAa1nC,KAAKmF,QAAQmoD,eAG/C,GAAuB,WAAnB,EAAO7pD,GACT,IACE,OAAOzD,KAAKygC,OAAOiH,aAAajkC,GAChC,MAAO5E,GAEP,OADA4J,QAAQqnD,KAAK,kCAAmC,gBAAiBrsD,EAAS,SAAU5E,GAC7EmB,KAAKygC,OAAOiH,aAAa1nC,KAAKmF,QAAQmoD,eAIjD,GAAuB,iBAAZ7pD,EAAsB,CAC/B,IAAMssD,EAAa,QAAQllD,OAAOpH,EAAS,UACrCuvC,EAAS,IAAIlzC,OAAOquC,UACpByW,EAAU5R,EAAOgd,gBAAgBD,EAAY,aAAajK,KAAKmK,kBACrE,OAAO9hB,YAAUsB,WAAWzvC,KAAKygC,QAAQjiB,MAAMomC,EAASiJ,GAG1D,OAAO,I,mCAGI,WACX,OAAO,IAAIqC,IAAWlwD,KAAK4kD,QAAS,CAClCp+C,MAAOxG,KAAKmwD,cACZC,YAAa,WAAa,2BAATn7C,EAAS,yBAATA,EAAS,gBACxB,EAAKc,KAAL,QAAI,CAAM,SAAN,OAAkBd,KAExBo7C,WAAY,WAAa,2BAATp7C,EAAS,yBAATA,EAAS,gBACvB,EAAKc,KAAL,QAAI,CAAM,QAAN,OAAiBd,KAEvBq7C,oBAAqBtwD,KAAKswD,oBAAoBpwD,KAAKF,U,2CAIlB,IAAlBgoD,EAAkB,uDAAN,KACxBA,GAILhoD,KAAKmoD,KAAKoI,SAAS,CACjBC,UAAWxwD,KAAKywD,cAAc,CAC5BzmD,OAAQg+C,EACRgD,WAAY,GAAF,SAAMhrD,KAAKovD,mBAAX,EAAiCpvD,KAAKmF,QAAQ6lD,mB,uCAQ3D,WAFDhhD,EAEC,EAFDA,OAGA,OADC,EADDghD,WAEkBhxC,QAAO,SAAAkuC,GAAS,MAAI,CAAC,OAAQ,QAAQhrC,SAASgrC,EAAUngD,SAAOiS,QAAO,SAAAkuC,GAAS,OAAIA,EAAUC,QAAMzc,QAAO,SAAC8kB,EAAWtI,GActI,cAAYsI,GAAZ,QACGtI,EAAUzoD,MAdI,SAACsgC,EAAMooB,EAAME,EAAQD,GACpC,IAAMJ,EAAYE,EAAUC,KAC5B,OAAO,IAAIJ,EAAcC,EAAW,CAClCC,OAAQ,EACRC,YACAl+C,SACA+1B,OACAooB,OACAE,SACAD,sBAOH,M,0CAGeqB,GAClB,IAAM7mB,EAAW5iC,KAAKwG,MAAMmG,MAAM88C,GAClCzpD,KAAKmoD,KAAKsE,YAAY7pB,GACtB5iC,KAAKu+B,UAAY,CACfhM,KAAMvyB,KAAKwG,MAAM+3B,UAAUhM,KAC3BiO,GAAIxgC,KAAKwG,MAAM+3B,UAAUiC,IAE3BxgC,KAAKmvD,yBACLnvD,KAAK+V,KAAK,cAAe,CACvB26C,QAAS1wD,KAAK0wD,QAAQxwD,KAAKF,MAC3B2wD,QAAS3wD,KAAK2wD,QAAQzwD,KAAKF,MAC3BwG,MAAOxG,KAAKwG,MACZijD,gBAGGA,EAAY7N,aAAc6N,EAAY1oB,QAAQ,kBAInD/gC,KAAK4wD,WAAWnH,K,iCAGPA,GACTzpD,KAAK+V,KAAK,SAAU,CAClB26C,QAAS1wD,KAAK0wD,QAAQxwD,KAAKF,MAC3B2wD,QAAS3wD,KAAK2wD,QAAQzwD,KAAKF,MAC3BwG,MAAOxG,KAAKwG,MACZijD,kB,yCAI8B,IAAjBttC,EAAiB,uDAAN,KAC1B,GAAInc,KAAKu+B,WAA0B,OAAbpiB,EACpB,OAAOnc,KAAKu+B,UAGd,GAAiB,UAAbpiB,IAAqC,IAAbA,EAC1B,MAAO,CACLoW,KAAM,EACNiO,GAAI,GAIR,GAAiB,QAAbrkB,EAAoB,KAEpBiiB,EACEp+B,KAAKwG,MADP43B,IAEF,MAAO,CACL7L,KAAM6L,EAAI36B,QAAQ2Y,KAClBokB,GAAIpC,EAAI36B,QAAQ2Y,MAIpB,MAAO,CACLmW,KAAMpW,EACNqkB,GAAIrkB,K,8BAIe,WAAjBA,EAAiB,uDAAN,KACf,KAAInc,KAAKmoD,KAAKoG,SAAwB,OAAbpyC,IAAkC,IAAbA,GAA9C,CADqB,MAQjBnc,KAAK6wD,iBAAiB10C,GAFxBoW,EANmB,EAMnBA,KACAiO,EAPmB,EAOnBA,GAEFxgC,KAAK6+B,aAAatM,EAAMiO,GACxBxsB,YAAW,kBAAM,EAAKm0C,KAAK8D,UAAS,O,qCAGP,IAAlB15B,EAAkB,uDAAX,EAAGiO,EAAQ,uDAAH,EAAG,EAIzBxgC,KAAKwG,MAFP43B,EAF2B,EAE3BA,IACAqD,EAH2B,EAG3BA,GAEIqvB,EAAejE,EAAOt6B,EAAM,EAAG6L,EAAI36B,QAAQ2Y,MAC3C20C,EAAclE,EAAOrsB,EAAI,EAAGpC,EAAI36B,QAAQ2Y,MACxCmiB,EAAYyyB,gBAAc1iD,OAAO8vB,EAAK0yB,EAAcC,GACpDtH,EAAchoB,EAAG5C,aAAaN,GACpCv+B,KAAKmoD,KAAKuB,SAASD,K,6BAInBzpD,KAAKmoD,KAAK3Z,IAAIqhB,S,sCAId,OAAOjyC,KAAKY,MAAMZ,KAAKC,UAAU,CAC/BgqB,MAAO7nC,KAAKgrD,WAAWnjB,MACvB5I,MAAOj/B,KAAKgrD,WAAW/rB,W,gCAKzB,IAAMiR,EAAMvtC,SAASuW,cAAc,OAC7B2+B,EAAWJ,gBAAchI,WAAWzvC,KAAKygC,QAAQmX,kBAAkB53C,KAAKwG,MAAM43B,IAAI36B,SAExF,OADAysC,EAAIjiC,YAAY4pC,GACT3H,EAAI+gB,Y,gCAIX,OAAOjxD,KAAKwG,MAAM43B,IAAI3I,W,mCAGmC,IAAhDhyB,EAAgD,uDAAtC,GAAImtD,EAAkC,wDAAd/C,EAAc,yCAIrD7tD,KAAKwG,MAFP43B,EAFuD,EAEvDA,IACAqD,EAHuD,EAGvDA,GAEI9+B,EAAW3C,KAAKsvD,eAAe7rD,EAASoqD,GACxCtvB,EAAYyyB,gBAAc1iD,OAAO8vB,EAAK,EAAGA,EAAI36B,QAAQ2Y,MACrDqtC,EAAchoB,EAAG5C,aAAaN,GAAWuB,qBAAqBn9B,GAAU,GAAOm+B,QAAQ,iBAAkB8vB,GAC/G5wD,KAAKmoD,KAAKuB,SAASD,K,qCAGY,IAApBmH,EAAoB,wDAC/B5wD,KAAKkxD,WAAWlxD,KAAKmF,QAAQmoD,cAAesD,K,+CAGrB,WACvB5wD,KAAKmyC,YAAc/xC,OAAOuR,QAAQ3R,KAAKygC,OAAOxB,OAAOyM,QAAO,SAACzM,EAAD,gBAASx/B,EAAT,KAAe4/B,EAAf,mBAA+BJ,GAA/B,QACzDx/B,GAAO,eAACqoC,EAAD,uDAAS,GAAT,OAAgBqpB,YAAa,EAAK3qD,MAAO64B,EAAMyI,SACrD,IACJ9nC,KAAKoxD,gBAAkBhxD,OAAOuR,QAAQ3R,KAAKygC,OAAOxB,OAAOyM,QAAO,SAACzM,EAAD,gBAASx/B,EAAT,KAAe4/B,EAAf,mBAA+BJ,GAA/B,QAC7Dx/B,EAAO4xD,YAAa,EAAK7qD,MAAO64B,OAC/B,IACJr/B,KAAKsxD,YAAclxD,OAAOuR,QAAQ3R,KAAKygC,OAAOoH,OAAO6D,QAAO,SAAC7D,EAAD,gBAASpoC,EAAT,KAAesgC,EAAf,mBAA+B8H,GAA/B,QACzDpoC,GAAO,eAACqoC,EAAD,uDAAS,GAAT,OAAgBypB,YAAa,EAAK/qD,MAAOu5B,EAAM+H,SACrD,M,qCAGoB,IAAb//B,EAAa,uDAAN,KAClB,OAAO/H,KAAKoxD,gBAAgBrpD,K,qCAGJ,IAAbA,EAAa,uDAAN,KAClB,YAAYypD,YAAaxxD,KAAKwG,MAAOxG,KAAKygC,OAAOoH,MAAM9/B,O,uCAYZ,IAA9Bm6B,EAA8B,uDAArB,KAAMuvB,EAAe,uCACrC1vB,EAAmC,mBAAlB0vB,EAA+BA,EAAcvvB,EAAQliC,KAAKwG,MAAMu7B,SAAvE,CAAmFG,GAAnF,SAA8FliC,KAAKwG,MAAMu7B,UACnHa,EAAW5iC,KAAKwG,MAAMg9B,YAAY,CACtCzB,YAEF/hC,KAAKmoD,KAAKsE,YAAY7pB,K,yCAGM,IAAbnjC,EAAa,uDAAN,KACtB,GAAKA,GAASO,KAAKmoD,KAAKuJ,QAAxB,CAIA,IAAM9uB,EAAW5iC,KAAKwG,MAAMg9B,YAAY,CACtCzB,QAAS/hC,KAAKwG,MAAMu7B,QAAQ/nB,QAAO,SAAAkoB,GAAM,OAAKA,EAAO9gC,IAAIgpD,WAAW,GAAGv/C,OAAOpL,EAAM,WAEtFO,KAAKmoD,KAAKsE,YAAY7pB,M,gCAIjB5iC,KAAKmoD,MAIVnoD,KAAKmoD,KAAKtD,Y,wCArWV,OAAK7kD,KAAKmF,QAAQooD,qBAIX,CAAC,IAAIR,EAAO,IAAIG,EAAQ,IAAIF,GAH1B,K,4BAOT,OAAOhtD,KAAKmoD,KAAOnoD,KAAKmoD,KAAK3hD,MAAQ,O,+BA8TrC,OAAOpG,OAAOuR,QAAP,OAAoB3R,KAAKmyC,aAC3BnyC,KAAKsxD,cACP5lB,QAAO,SAACgB,EAAD,gBAASjtC,EAAT,KAAegF,EAAf,mBAAgCioC,GAAhC,QACPjtC,GAAO,eAACqoC,EAAD,uDAAS,GAAT,OAAgBrjC,EAAMqjC,SAC5B,Q,GAlaa2iB,GAkcjBkH,EAAgB,CAClB1tB,MAAO,CACLgkB,OAAQ,CACN5zB,QAAS,KACTtsB,KAAM3H,SAGVwxD,MAAO,CACL3J,OAAQ,CACN4J,WAAW,EAEXt5B,QAHM,SAGE0vB,GAAQ,WACVA,GAAUA,EAAOrD,SACnB5kD,KAAK8xD,WAAU,WACb,EAAK3I,IAAIl7C,YAAYg6C,EAAOrD,QAAQ/2B,YACpCo6B,EAAO8J,mBAAmB,SAQpC7oD,OAvBkB,SAuBXgQ,GACL,OAAOA,EAAc,QAGvB84C,cA3BkB,WA4BhBhyD,KAAKioD,OAAOrD,QAAU5kD,KAAKmpD,MAKzB8I,E,WACJ,cAEG,WADD9sD,EACC,EADDA,QACC,UACDnF,KAAKmF,QAAUA,EACfnF,KAAKkyD,aAAc,EAEnBlyD,KAAKmyD,iBAAmBnyD,KAAKoyD,YAAYlyD,KAAKF,MAC9CA,KAAKmF,QAAQy/C,QAAQnjC,iBAAiB,YAAazhB,KAAKmyD,iBAAkB,CACxEphC,SAAS,IAGX/wB,KAAKqyD,YAAc,WACb,EAAKH,YACP,EAAKA,aAAc,EAIrB,EAAK/sD,QAAQ8iD,OAAOlyC,KAAK,uBAAuB,IAGlD/V,KAAKmF,QAAQ8iD,OAAOxyC,GAAG,OAAQzV,KAAKqyD,a,gDAIpCryD,KAAKkyD,aAAc,I,gCAInBlyD,KAAKmF,QAAQy/C,QAAQE,oBAAoB,YAAa9kD,KAAKmyD,kBAC3DnyD,KAAKmF,QAAQ8iD,OAAOryC,IAAI,OAAQ5V,KAAKqyD,iB,KAmBzC,IAAIC,EAAgB,CAClBruB,MAAO,CACLgkB,OAAQ,CACN5zB,QAAS,KACTtsB,KAAM3H,SAIVkX,KARkB,WAShB,MAAO,CACLi3C,SAAS,IAIbqD,MAAO,CACL3J,OAAQ,CACN4J,WAAW,EAEXt5B,QAHM,SAGE0vB,GAAQ,WACVA,GACFjoD,KAAK8xD,WAAU,WAlCzB,IAAkB3sD,EAmCN8iD,EAAOsK,gBAnCDptD,EAmCwB,CAC5B8iD,SACArD,QAAS,EAAKuE,KApCnB,IAAIrgC,SAAO,CAChB1nB,IAAK,IAAIijC,YAAU,YAEnB8jB,KAHgB,SAGX5D,GACH,OAAO,IAAI0N,EAAK,CACd1N,aACAp/C,iBAgCI,EAAKopD,QAAUtG,EAAOsG,QACtBtG,EAAOxyC,GAAG,SAAS,WACjB,EAAK84C,SAAU,KAEjBtG,EAAOxyC,GAAG,uBAAuB,SAAA84C,GAC/B,EAAKA,QAAUA,WAS3BrlD,OAvCkB,WAwChB,OAAKlJ,KAAKioD,OAIHjoD,KAAKwyD,aAAan+B,QAAQ,CAC/Bk6B,QAASvuD,KAAKuuD,QACdtC,MAAOjsD,KAAKioD,OAAOgE,MACnBF,SAAU/rD,KAAKioD,OAAO8D,SACtB0G,SAAUzyD,KAAKioD,OAAOwK,SACtBpB,aAAcrxD,KAAKioD,OAAOoJ,aAAanxD,KAAKF,KAAKioD,QACjDuJ,aAAcxxD,KAAKioD,OAAOuJ,aAAatxD,KAAKF,KAAKioD,UAT1C,OAeb,SAASyK,EAAU3yB,EAAMxN,EAAMiO,GAC7B,IAAM+c,EAAQ56C,SAASgwD,cAGvB,OAFApV,EAAMqV,OAAO7yB,EAAY,MAANS,EAAaT,EAAKuU,UAAUnzC,OAASq/B,GACxD+c,EAAMsV,SAAS9yB,EAAMxN,GAAQ,GACtBgrB,EAGT,SAASuV,GAAWluD,EAAQo6C,GAC1B,IAAM+T,EAAQnuD,EAAOouD,iBACrB,OAAQD,EAAM5xD,OAA0C4xD,EAAM/T,EAAO,EAAI,EAAI+T,EAAM5xD,OAAS,GAArEyD,EAAOygD,wBAGhC,SAASK,GAAYyC,EAAMpsC,GAAkB,IAKvCk3C,EACA/N,EAN0B5f,EAAa,0DAIvC6iB,EAAKuJ,QAAQwB,WAAWn3C,GAF1BgkB,EAFyC,EAEzCA,KACAgI,EAHyC,EAGzCA,OAKF,GAAsB,IAAlBhI,EAAK6T,SACHtO,GAAOyC,EAAShI,EAAKuU,UAAUnzC,QACjC+jD,EAAO4N,GAAWJ,EAAU3yB,EAAMgI,EAAS,EAAGA,IAAU,GACxDkrB,EAAO,SACElrB,EAAShI,EAAKuU,UAAUnzC,SACjC+jD,EAAO4N,GAAWJ,EAAU3yB,EAAMgI,EAAQA,EAAS,IAAK,GACxDkrB,EAAO,aAEJ,GAAIlzB,EAAKlS,WAAY,CAC1B,GAAIka,EAAShI,EAAKtS,WAAWtsB,OAAQ,CACnC,IAAMkkC,EAAQtF,EAAKtS,WAAWsa,GAC9Bmd,EAAO4N,GAA8B,IAAnBztB,EAAMuO,SAAiB8e,EAAUrtB,GAASA,GAAQ,GACpE4tB,EAAO,OAGT,KAAM/N,GAAQA,EAAKrR,MAAQqR,EAAKI,SAAWvd,EAAQ,CACjD,IAAM1C,EAAQtF,EAAKtS,WAAWsa,EAAS,GACvCmd,EAAO4N,GAA8B,IAAnBztB,EAAMuO,SAAiB8e,EAAUrtB,GAASA,EAAO,GACnE4tB,EAAO,cAGT/N,EAAOnlB,EAAKslB,wBACZ4N,EAAO,OAGT,IAAME,EAAIjO,EAAK+N,GACf,MAAO,CACLpf,IAAKqR,EAAKrR,IACVyR,OAAQJ,EAAKI,OACbC,KAAM4N,EACN3N,MAAO2N,G,IAILC,G,WACJ,cAGG,WAFDjuD,EAEC,EAFDA,QACAo/C,EACC,EADDA,WACC,UACDvkD,KAAKmF,QAAL,OAAoB,CAChBy/C,QAAS,KACTyO,cAAc,EACdrF,SAAU,kBAAM,KAEf7oD,GAELnF,KAAKukD,WAAaA,EAClBvkD,KAAKyyD,UAAW,EAChBzyD,KAAKulD,KAAO,EACZvlD,KAAKslD,OAAS,EACdtlD,KAAK6zC,IAAM,EACX7zC,KAAKkyD,aAAc,EAEnBlyD,KAAKmyD,iBAAmBnyD,KAAKoyD,YAAYlyD,KAAKF,MAC9CA,KAAKmF,QAAQy/C,QAAQnjC,iBAAiB,YAAazhB,KAAKmyD,iBAAkB,CACxEphC,SAAS,IAGX/wB,KAAKszD,aAAe,YAEd,IADJnL,EACI,EADJA,KAEA,EAAKz7B,OAAOy7B,IAGdnoD,KAAKmF,QAAQ8iD,OAAOxyC,GAAG,QAASzV,KAAKszD,cAErCtzD,KAAKqyD,YAAc,YAEb,IADJ75B,EACI,EADJA,MAEI,EAAK05B,YACP,EAAKA,aAAc,EAIrB,EAAKqB,KAAK/6B,IAGZx4B,KAAKmF,QAAQ8iD,OAAOxyC,GAAG,OAAQzV,KAAKqyD,a,gDAIpCryD,KAAKkyD,aAAc,I,6BAGd/J,EAAMqL,GAAW,IAEpBhtD,EACE2hD,EADF3hD,MAGF,KAAI2hD,EAAKsL,WAKLD,GAAaA,EAAUp1B,IAAI+E,GAAG38B,EAAM43B,MAAQo1B,EAAUj1B,UAAU4E,GAAG38B,EAAM+3B,YAK7E,GAAI/3B,EAAM+3B,UAAU0B,MAClBjgC,KAAKuzD,WADP,CAfsB,MAwBlB/sD,EAAM+3B,UAFRhM,EAtBoB,EAsBpBA,KACAiO,EAvBoB,EAuBpBA,GAKI+E,EAAQmgB,GAAYyC,EAAM51B,GAC1B+S,EAAMogB,GAAYyC,EAAM3nB,GAAI,GAE5Bx2B,EAAShK,KAAKmF,QAAQy/C,QAAQe,aAEpC,GAAK37C,EAAL,CAKA,IAAM0pD,EAAM1pD,EAAOq7C,wBACbroC,EAAKhd,KAAKmF,QAAQy/C,QAAQS,wBAG1BE,GAAQhgB,EAAMggB,KAAOjgB,EAAIigB,MAAQ,EAAImO,EAAInO,KAE/CvlD,KAAKulD,KAAO3lD,KAAK0nC,MAAMtnC,KAAKmF,QAAQkuD,aAAezzD,KAAKiJ,IAAI6qD,EAAIlP,MAAQxnC,EAAGwnC,MAAQ,EAAG5kD,KAAKsvB,IAAIq2B,EAAMvoC,EAAGwnC,MAAQ,IAAMe,GACtHvlD,KAAKslD,OAAS1lD,KAAK0nC,MAAMosB,EAAIpO,OAAS/f,EAAMsO,KAC5C7zC,KAAK6zC,IAAMj0C,KAAK0nC,MAAMhC,EAAIggB,OAASoO,EAAI7f,KACvC7zC,KAAKyyD,UAAW,EAChBzyD,KAAK2zD,kBAdH3zD,KAAKuzD,U,mCAkBPvzD,KAAKmF,QAAQ6oD,SAAS,CACpByE,SAAUzyD,KAAKyyD,SACflN,KAAMvlD,KAAKulD,KACXD,OAAQtlD,KAAKslD,OACbzR,IAAK7zC,KAAK6zC,Q,2BAITrb,GACCA,GAASA,EAAMquB,eAAiB7mD,KAAKmF,QAAQy/C,QAAQ/3B,YAAc7sB,KAAKmF,QAAQy/C,QAAQ/3B,WAAW6pB,SAASle,EAAMquB,iBAItH7mD,KAAKyyD,UAAW,EAChBzyD,KAAK2zD,gB,gCAIL3zD,KAAKmF,QAAQy/C,QAAQE,oBAAoB,YAAa9kD,KAAKmyD,kBAC3DnyD,KAAKmF,QAAQ8iD,OAAOryC,IAAI,QAAS5V,KAAKszD,cACtCtzD,KAAKmF,QAAQ8iD,OAAOryC,IAAI,OAAQ5V,KAAKqyD,iB,KAmBzC,IAAIuB,GAAmB,CACrB3vB,MAAO,CACLgkB,OAAQ,CACN5zB,QAAS,KACTtsB,KAAM3H,QAERizD,aAAc,CACZh/B,SAAS,EACTtsB,KAAMiR,UAIV1B,KAZqB,WAanB,MAAO,CACLu8C,KAAM,CACJpB,UAAU,EACVlN,KAAM,EACND,OAAQ,KAKdsM,MAAO,CACL3J,OAAQ,CACN4J,WAAW,EAEXt5B,QAHM,SAGE0vB,GAAQ,WACVA,GACFjoD,KAAK8xD,WAAU,WA1CzB,IAAqB3sD,EA2CT8iD,EAAOsK,gBA3CEptD,EA2CwB,CAC/B8iD,SACArD,QAAS,EAAKuE,IACdkK,aAAc,EAAKA,aACnBrF,SAAU,SAAA6F,GAEJA,EAAKpB,WAAmC,IAAvB,EAAKoB,KAAKpB,SAC7B,EAAKqB,MAAM,OAAQD,GACTA,EAAKpB,WAAmC,IAAvB,EAAKoB,KAAKpB,UACrC,EAAKqB,MAAM,OAAQD,GAGrB,EAAKA,KAAOA,IAtDnB,IAAI/qC,SAAO,CAChB1nB,IAAK,IAAIijC,YAAU,eAEnB8jB,KAHgB,SAGX5D,GACH,OAAO,IAAI6O,GAAO,CAChB7O,aACAp/C,uBA0DN+D,OAnDqB,WAoDnB,OAAKlJ,KAAKioD,OAIHjoD,KAAKwyD,aAAan+B,QAAQ,CAC/Bk6B,QAASvuD,KAAKioD,OAAOE,KAAKoG,QAC1BtC,MAAOjsD,KAAKioD,OAAOgE,MACnBF,SAAU/rD,KAAKioD,OAAO8D,SACtB0G,SAAUzyD,KAAKioD,OAAOwK,SACtBpB,aAAcrxD,KAAKioD,OAAOoJ,aAAanxD,KAAKF,KAAKioD,QACjDuJ,aAAcxxD,KAAKioD,OAAOuJ,aAAatxD,KAAKF,KAAKioD,QACjD4L,KAAM7zD,KAAK6zD,OAVJ,MAcX7B,cAnEqB,WAoEnBhyD,KAAKioD,OAAO8L,iBAAiB,kB,6NC34CpBC,EAgBX,SAAYnhD,EAAO0lB,GAMrB,IAAuB7gB,EALnB1X,KAAK6S,MAAQA,EACb7S,KAAKu4B,QAA4B,iBAAXA,GAIH7gB,EAJuC6gB,EAKrD,SAAS/xB,EAAOqM,EAAO0yB,EAAOD,GACnCxH,IAAIwR,EAAS53B,EACb,GAAI7E,EAAM,GAAI,CACZirB,IAAIiK,EAASl1B,EAAM,GAAG0kC,YAAY1kC,EAAM,IACxCy8B,GAAUz8B,EAAM,GAAG9P,MAAMglC,EAASl1B,EAAM,GAAG1R,QAE3C28B,IAAIm2B,GADJ1uB,GAASwC,GACYzC,EACjB2uB,EAAS,IACX3kB,EAASz8B,EAAM,GAAG9P,MAAMglC,EAASksB,EAAQlsB,GAAUuH,EACnD/J,EAAQD,GAGZ,OAAO9+B,EAAMi7B,GAAGnB,WAAWgP,EAAQ/J,EAAOD,KAjB2B/M,GA2BlE,SAASizB,EAAU,G,cACpBtpB,EAAS,IAAI,SAAO,CACtB17B,MAAO,CACL0yB,KAAA,WAAS,OAAO,MAChBvsB,MAAA,SAAM80B,EAAIxG,GACR6C,IAAIo2B,EAASzyB,EAAGV,QAAQ/gC,MACxB,OAAIk0D,IACGzyB,EAAG1C,cAAgB0C,EAAGma,WAAa,KAAO3gB,KAIrDgJ,MAAO,CACLkwB,gBAAA,SAAgBhM,EAAM51B,EAAMiO,EAAID,GAC9B,OAAO7rB,EAAIyzC,EAAM51B,EAAMiO,EAAID,EAAM6N,EAAOlM,IAE1C0tB,gBAAiB,CACfwE,eAAgB,SAACjM,GACfn0C,YAAW,WACT,IAAK6tB,EAAWsmB,EAAK3hD,MAAM+3B,UAAtBsD,QACDA,GAASntB,EAAIyzC,EAAMtmB,EAAQ9lB,IAAK8lB,EAAQ9lB,IAAK,GAAIqyB,EAAOlM,SAMpEmyB,cAAc,IAEhB,OAAOnyB,EAGT,SAASxtB,EAAIyzC,EAAM51B,EAAMiO,EAAID,EAAM6N,EAAOlM,GACxC,GAAIimB,EAAKsL,UAAW,OAAO,EAC3B31B,IAAIt3B,EAAQ2hD,EAAK3hD,MAAOu3B,EAAQv3B,EAAM43B,IAAI3e,QAAQ8S,GAClD,GAAIwL,EAAM/zB,OAAOjC,KAAKo6B,KAAK/f,KAAM,OAAO,EAGxC,IAFA0b,IAAIw2B,EAAav2B,EAAM/zB,OAAOy7B,YAAY7lC,KAAKsvB,IAAI,EAAG6O,EAAMmK,aAxC5C,KAwCuEnK,EAAMmK,aACnD,KAAM,KAAY3H,EACnDt/B,EAAI,EAAGA,EAAImtC,EAAMjtC,OAAQF,IAAK,CACrC68B,IAAIjrB,EAAQu7B,EAAMntC,GAAG4R,MAAMjU,KAAK01D,GAC5B7yB,EAAK5uB,GAASu7B,EAAMntC,GAAGs3B,QAAQ/xB,EAAOqM,EAAO0f,GAAQ1f,EAAM,GAAG1R,OAASo/B,EAAKp/B,QAASq/B,GACzF,GAAKiB,EAEL,OADA0mB,EAAKuB,SAASjoB,EAAGX,QAAQoB,EAAQ,CAACqyB,UAAW9yB,EAAE,KAAElP,EAAI,GAAEiO,EAAE,KAAED,MACpD,EAET,OAAO,EAMF,SAASivB,EAAchpD,EAAOkjD,GAEnC,IADA5rB,IAAIiE,EAAUv7B,EAAMu7B,QACX9gC,EAAI,EAAGA,EAAI8gC,EAAQ5gC,OAAQF,IAAK,CACvC68B,IAAIoE,EAASH,EAAQ9gC,GAAIuzD,OAAA,EACzB,GAAItyB,EAAOC,KAAKkyB,eAAiBG,EAAWtyB,EAAOkC,SAAS59B,IAAS,CACnE,GAAIkjD,EAAU,CAEZ,IADA5rB,IAAI2D,EAAKj7B,EAAMi7B,GAAIgzB,EAASD,EAASD,UAC5BjoC,EAAImoC,EAAO91B,MAAMx9B,OAAS,EAAGmrB,GAAK,EAAGA,IAC5CmV,EAAGvmB,KAAKu5C,EAAO91B,MAAMrS,GAAGiuB,OAAOka,EAAOjZ,KAAKlvB,KAC7C,GAAIkoC,EAASj0B,KAAM,CACjBzC,IAAImB,EAAQwC,EAAGrD,IAAI3e,QAAQ+0C,EAASjiC,MAAM0M,QAC1CwC,EAAGrB,YAAYo0B,EAASjiC,KAAMiiC,EAASh0B,GAAIh6B,EAAMi6B,OAAOF,KAAKi0B,EAASj0B,KAAMtB,SAE5EwC,EAAG4f,OAAOmT,EAASjiC,KAAMiiC,EAASh0B,IAEpCkpB,EAASjoB,GAEX,OAAO,GAGX,OAAO,ECrHa,IAAIuyB,EAAU,MAAO,KAEnB,IAAIA,EAAU,UAAW,KAElB,IAAIA,EAAU,uCAAwC,KAErD,IAAIA,EAAU,KAAM,KAErB,IAAIA,EAAU,uCAAwC,KAErD,IAAIA,EAAU,KAAM,KCM7C,SAASU,EAAkB5kC,EAAQ8jB,EAAUzE,EAAUwlB,GAC5D,OAAO,IAAIX,EAAUlkC,GAAM,SAAGtpB,EAAOqM,EAAO0yB,EAAOD,GACjDxH,IAAIgK,EAAQqH,aAAoBlvC,SAAWkvC,EAASt8B,GAASs8B,EACzD1N,EAAKj7B,EAAMi7B,GAAG4f,OAAO9b,EAAOD,GACIiY,EAAvB9b,EAAGrD,IAAI3e,QAAQ8lB,GAAuB6D,aAAcwrB,EAAWrX,GAAS,YAAaA,EAAO3J,EAAU9L,GACnH,IAAK8sB,EAAU,OAAO,KACtBnzB,EAAG6Q,KAAKiL,EAAOqX,GACf92B,IAAIoF,EAASzB,EAAGrD,IAAI3e,QAAQ8lB,EAAQ,GAAGmD,WAIvC,OAHIxF,GAAUA,EAAOn7B,MAAQ6rC,GAAY,YAAQnS,EAAGrD,IAAKmH,EAAQ,MAC3DovB,GAAiBA,EAAc9hD,EAAOqwB,KAC1CzB,EAAG76B,KAAK2+B,EAAQ,GACX9D,KAWJ,SAASozB,EAAuB/kC,EAAQ8jB,EAAUzE,GACvD,OAAO,IAAI6kB,EAAUlkC,GAAM,SAAGtpB,EAAOqM,EAAO0yB,EAAOD,GACjDxH,IAAIg3B,EAAStuD,EAAM43B,IAAI3e,QAAQ8lB,GAC3BuC,EAAQqH,aAAoBlvC,SAAWkvC,EAASt8B,GAASs8B,EAC7D,OAAK2lB,EAAO/0B,MAAM,GAAG6d,eAAekX,EAAOzhD,OAAO,GAAIyhD,EAAOzsB,YAAY,GAAIuL,GACtEptC,EAAMi7B,GACV4f,OAAO9b,EAAOD,GACdma,aAAala,EAAOA,EAAOqO,EAAU9L,GAHuD,U,uCC7ClDitB,E,qOAS9Cj1D,OAT8Ci1D,EAStC,WACX,O,YCTE,IAAIC,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUv2D,QAGnC,IAAID,EAASs2D,EAAiBE,GAAY,CACzCj0D,EAAGi0D,EACHh0D,KACAvC,QAAS,IAUV,OANA8rB,EAAQyqC,GAAU10D,KAAK9B,EAAOC,QAASD,EAAQA,EAAOC,QAASs2D,GAG/Dv2D,EAAOwC,KAGAxC,EAAOC,QA0Df,OArDAs2D,EAAoBzvC,EAAIiF,EAGxBwqC,EAAoBvoD,EAAIsoD,EAGxBC,EAAoB3rB,EAAI,SAAS3qC,EAASc,EAAM01D,GAC3CF,EAAoBG,EAAEz2D,EAASc,IAClCW,OAAO0D,eAAenF,EAASc,EAAM,CAAEkH,cAAkB5C,IAAKoxD,KAKhEF,EAAoB3tD,EAAI,SAAS3I,GACX,oBAAXW,QAA0BA,OAAO+1D,aAC1Cj1D,OAAO0D,eAAenF,EAASW,OAAO+1D,YAAa,CAAE5wD,MAAO,WAE7DrE,OAAO0D,eAAenF,EAAS,aAAc,CAAE8F,YAQhDwwD,EAAoB1xC,EAAI,SAAS9e,EAAOkY,GAEvC,GADU,EAAPA,IAAUlY,EAAQwwD,EAAoBxwD,IAC/B,EAAPkY,EAAU,OAAOlY,EACpB,GAAW,EAAPkY,GAA8B,YAAVlY,IAAsBA,GAASA,EAAM6wD,WAAY,OAAO7wD,EAChF,IAAI8wD,EAAKn1D,OAAOkO,OAAO,MAGvB,GAFA2mD,EAAoB3tD,EAAEiuD,GACtBn1D,OAAO0D,eAAeyxD,EAAI,UAAW,CAAE5uD,cAAkBlC,MAAOA,IACtD,EAAPkY,GAA4B,iBAATlY,EAAmB,IAAI,IAAIrD,KAAOqD,EAAOwwD,EAAoB3rB,EAAEisB,EAAIn0D,EAAK,SAASA,GAAO,OAAOqD,EAAMrD,IAAQlB,KAAK,KAAMkB,IAC9I,OAAOm0D,GAIRN,EAAoBp8C,EAAI,SAASna,GAChC,IAAIy2D,EAASz2D,GAAUA,EAAO42D,WAC7B,WAAwB,OAAO52D,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAu2D,EAAoB3rB,EAAE6rB,EAAQ,IAAKA,GAC5BA,GAIRF,EAAoBG,EAAI,SAASxwD,EAAQ4wD,GAAY,OAAOp1D,OAAOC,UAAUgB,eAAeb,KAAKoE,EAAQ4wD,IAGzGP,EAAoB9mC,EAAI,SAIjB8mC,EAAoBA,EAAoBv5B,EAAI,I,iCC1ErDh9B,EAAOC,QAAU,SAAUmrB,GACzB,IAAIC,EAAO,GAuDX,OArDAA,EAAK5pB,SAAW,WACd,OAAOH,KAAK+Z,KAAI,SAAUiQ,GACxB,IAAIvmB,EAsDV,SAAgCumB,EAAMF,GACpC,IAoBiBK,EAEbC,EACA9S,EAvBA7T,EAAUumB,EAAK,IAAM,GAErBC,EAAaD,EAAK,GAEtB,IAAKC,EACH,OAAOxmB,EAGT,GAAIqmB,GAAgC,mBAAT3J,KAAqB,CAC9C,IAAI+J,GAWWC,EAXeF,EAa5BG,EAASjK,KAAKF,SAAS1Y,mBAAmBqW,KAAKC,UAAUsM,MACzD7S,EAAO,+DAA+DzM,OAAOuf,GAC1E,OAAOvf,OAAOyM,EAAM,QAdrB+S,EAAaJ,EAAWK,QAAQvQ,KAAI,SAAU3U,GAChD,MAAO,iBAAiByF,OAAOof,EAAWM,YAAc,IAAI1f,OAAOzF,EAAQ,UAE7E,MAAO,CAAC3B,GAASoH,OAAOwf,GAAYxf,OAAO,CAACqf,IAAgBtjB,KAAK,MAGnE,MAAO,CAACnD,GAASmD,KAAK,MAjBxB,CAtD2CojB,EAAMF,GAE3C,OAAIE,EAAK,GACA,UAAUnf,OAAOmf,EAAK,GAAI,MAAMnf,OAAOpH,EAAS,KAGlDA,KACNmD,KAAK,KAKVmjB,EAAK9oB,EAAI,SAAUwpB,EAASC,EAAYC,GACf,iBAAZF,IAETA,EAAU,CAAC,CAAC,KAAMA,EAAS,MAG7B,IAAIG,EAAyB,GAE7B,GAAID,EACF,IAAK,IAAI1pB,EAAI,EAAGA,EAAIjB,KAAKmB,OAAQF,IAAK,CAEpC,IAAIsO,EAAKvP,KAAKiB,GAAG,GAEP,MAANsO,IACFqb,EAAuBrb,OAK7B,IAAK,IAAIsb,EAAK,EAAGA,EAAKJ,EAAQtpB,OAAQ0pB,IAAM,CAC1C,IAAIb,EAAO,GAAGnf,OAAO4f,EAAQI,IAEzBF,GAAUC,EAAuBZ,EAAK,MAKtCU,IACGV,EAAK,GAGRA,EAAK,GAAK,GAAGnf,OAAO6f,EAAY,SAAS7f,OAAOmf,EAAK,IAFrDA,EAAK,GAAKU,GAMdX,EAAK5U,KAAK6U,MAIPD,I,gCChETkrC;;;;;;;;;;;;;;;;;;;;;;;AA4BAQ,WAAStwD,QAAQuwD,gBAAjBD,yDAAqFE,UAArFF,6EACAA,WAAStwD,QAAQywD,eAEFH,YAAf,U,+BC3Be,SAAS3qC,EAAcC,EAAUhB,GAG9C,IAFA,IAAIiB,EAAS,GACTC,EAAY,GACPhqB,EAAI,EAAGA,EAAI8oB,EAAK5oB,OAAQF,IAAK,CACpC,IAAI+oB,EAAOD,EAAK9oB,GACZsO,EAAKya,EAAK,GAIVkB,EAAO,CACT3b,GAAIwb,EAAW,IAAM9pB,EACrBkqB,IALQnB,EAAK,GAMboB,MALUpB,EAAK,GAMfG,UALcH,EAAK,IAOhBiB,EAAU1b,GAGb0b,EAAU1b,GAAIkO,MAAMtI,KAAK+V,GAFzBF,EAAO7V,KAAK8V,EAAU1b,GAAM,CAAEA,GAAIA,EAAIkO,MAAO,CAACyN,KAKlD,OAAOF,E,+CCjBT,IAAIK,EAAkC,oBAAb1oB,SAEzB,GAAqB,oBAAV2oB,OAAyBA,QAC7BD,EACH,MAAM,IAAIzX,MACV,2JAkBJ,IAAI2X,EAAc,GAQdC,EAAOH,IAAgB1oB,SAAS6oB,MAAQ7oB,SAAS8oB,qBAAqB,QAAQ,IAC9EC,EAAmB,KACnBC,EAAmB,EACnBC,KACA7W,EAAO,aACP5P,EAAU,KAKV0mB,EAA+B,oBAAdppB,WAA6B,eAAeqP,KAAKrP,UAAU8X,UAAU5C,eAE3E,SAASmU,EAAiBf,EAAUhB,EAAMgC,EAAeC,GACtEJ,EAAeG,EAEf5mB,EAAU6mB,GAAY,GAEtB,IAAIhB,EAASF,EAAaC,EAAUhB,GAGpC,OAFAkC,EAAejB,GAER,SAAiBkB,GAEtB,IADA,IAAIC,EAAY,GACPlrB,EAAI,EAAGA,EAAI+pB,EAAO7pB,OAAQF,IAAK,CACtC,IAAI+oB,EAAOgB,EAAO/pB,IACdmrB,EAAWb,EAAYvB,EAAKza,KACvB8c,OACTF,EAAUhX,KAAKiX,GAQjB,IANIF,EAEFD,EADAjB,EAASF,EAAaC,EAAUmB,IAGhClB,EAAS,GAEF/pB,EAAI,EAAGA,EAAIkrB,EAAUhrB,OAAQF,IAAK,CACzC,IAAImrB,EACJ,GAAsB,KADlBA,EAAWD,EAAUlrB,IACZorB,KAAY,CACvB,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAS3O,MAAMtc,OAAQmrB,IACzCF,EAAS3O,MAAM6O,YAEVf,EAAYa,EAAS7c,OAMpC,SAAS0c,EAAgBjB,GACvB,IAAK,IAAI/pB,EAAI,EAAGA,EAAI+pB,EAAO7pB,OAAQF,IAAK,CACtC,IAAI+oB,EAAOgB,EAAO/pB,GACdmrB,EAAWb,EAAYvB,EAAKza,IAChC,GAAI6c,EAAU,CACZA,EAASC,OACT,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAS3O,MAAMtc,OAAQmrB,IACzCF,EAAS3O,MAAM6O,GAAGtC,EAAKvM,MAAM6O,IAE/B,KAAOA,EAAItC,EAAKvM,MAAMtc,OAAQmrB,IAC5BF,EAAS3O,MAAMtI,KAAKoX,EAASvC,EAAKvM,MAAM6O,KAEtCF,EAAS3O,MAAMtc,OAAS6oB,EAAKvM,MAAMtc,SACrCirB,EAAS3O,MAAMtc,OAAS6oB,EAAKvM,MAAMtc,YAEhC,CACL,IAAIsc,EAAQ,GACZ,IAAS6O,EAAI,EAAGA,EAAItC,EAAKvM,MAAMtc,OAAQmrB,IACrC7O,EAAMtI,KAAKoX,EAASvC,EAAKvM,MAAM6O,KAEjCf,EAAYvB,EAAKza,IAAM,CAAEA,GAAIya,EAAKza,GAAI8c,KAAM,EAAG5O,MAAOA,KAK5D,SAAS+O,IACP,IAAIC,EAAe9pB,SAASuW,cAAc,SAG1C,OAFAuT,EAAa1kB,KAAO,WACpByjB,EAAKvd,YAAYwe,GACVA,EAGT,SAASF,EAAUxrB,GACjB,IAAI2rB,EAAQC,EACRF,EAAe9pB,SAASiqB,cAAc,2BAA8B7rB,EAAIwO,GAAK,MAEjF,GAAIkd,EAAc,CAChB,GAAIb,EAGF,OAAO7W,EAOP0X,EAAaI,WAAWC,YAAYL,GAIxC,GAAIZ,EAAS,CAEX,IAAIkB,EAAapB,IACjBc,EAAef,IAAqBA,EAAmBc,KACvDE,EAASM,EAAoB9sB,KAAK,KAAMusB,EAAcM,MACtDJ,EAASK,EAAoB9sB,KAAK,KAAMusB,EAAcM,WAGtDN,EAAeD,IACfE,EAASO,EAAW/sB,KAAK,KAAMusB,GAC/BE,EAAS,WACPF,EAAaI,WAAWC,YAAYL,IAMxC,OAFAC,EAAO3rB,GAEA,SAAsBmsB,GAC3B,GAAIA,EAAQ,CACV,GAAIA,EAAO/B,MAAQpqB,EAAIoqB,KACnB+B,EAAO9B,QAAUrqB,EAAIqqB,OACrB8B,EAAO/C,YAAcppB,EAAIopB,UAC3B,OAEFuC,EAAO3rB,EAAMmsB,QAEbP,KAKN,IACMQ,EADFC,GACED,EAAY,GAET,SAAU9Z,EAAO8D,GAEtB,OADAgW,EAAU9Z,GAAS8D,EACZgW,EAAUnT,OAAOhB,SAASpS,KAAK,QAI1C,SAASomB,EAAqBP,EAAcpZ,EAAOsZ,EAAQ5rB,GACzD,IAAIoqB,EAAMwB,EAAS,GAAK5rB,EAAIoqB,IAE5B,GAAIsB,EAAaY,WACfZ,EAAaY,WAAWC,QAAUF,EAAY/Z,EAAO8X,OAChD,CACL,IAAIoC,EAAU5qB,SAAS6qB,eAAerC,GAClCsC,EAAahB,EAAagB,WAC1BA,EAAWpa,IAAQoZ,EAAaK,YAAYW,EAAWpa,IACvDoa,EAAWtsB,OACbsrB,EAAaiB,aAAaH,EAASE,EAAWpa,IAE9CoZ,EAAaxe,YAAYsf,IAK/B,SAASN,EAAYR,EAAc1rB,GACjC,IAAIoqB,EAAMpqB,EAAIoqB,IACVC,EAAQrqB,EAAIqqB,MACZjB,EAAYppB,EAAIopB,UAiBpB,GAfIiB,GACFqB,EAAakB,aAAa,QAASvC,GAEjCjmB,EAAQyoB,OACVnB,EAAakB,aA7JF,kBA6JyB5sB,EAAIwO,IAGtC4a,IAGFgB,GAAO,mBAAqBhB,EAAUG,QAAQ,GAAK,MAEnDa,GAAO,uDAAyDhL,KAAKF,SAAS1Y,mBAAmBqW,KAAKC,UAAUsM,MAAgB,OAG9HsC,EAAaY,WACfZ,EAAaY,WAAWC,QAAUnC,MAC7B,CACL,KAAOsB,EAAaoB,YAClBpB,EAAaK,YAAYL,EAAaoB,YAExCpB,EAAaxe,YAAYtL,SAAS6qB,eAAerC,O,gBC3NrDzsB,EAAOC,QAAUI,EAAQ,M,mBCGzB,IAAI0E,EAAUwxD,EAAQ,IACA,iBAAZxxD,IAAsBA,EAAU,CAAC,CAAC/E,EAAOuC,EAAIwC,EAAS,MAC7DA,EAAQoyD,SAAQn3D,EAAOC,QAAU8E,EAAQoyD,WAElCZ,EAAQ,GAAkE5gC,SACnE,WAAY5wB,KAAe,K,oBCN5C9E,EADkCs2D,EAAQ,EAARA,EACxBa,IAEF3gD,KAAK,CAACzW,EAAOuC,EAAI,igEAAkgE,KAE3hEvC,EAAOC,QAAUA,MRLM,YAAZA,IAA0C,YAAXD,GACxCA,EAAOC,QAAUo2D,KAEjBn6B,EAA6B,QAA7BA,iE,yxBSCEm7B,EAAe,aAEnBA,EAAa11D,UAAU0kC,OAAS,SAAiB5e,GAC/C,OAAKA,EAAMhlB,QACXglB,EAAQ4vC,EAAaxjC,KAAKpM,IAEjBnmB,KAAKmB,QAAUglB,GACrBA,EAAMhlB,OAZU,KAYiBnB,KAAKg2D,WAAW7vC,IACjDnmB,KAAKmB,OAbW,KAagBglB,EAAM8vC,YAAYj2D,OACnDA,KAAKk2D,YAAY/vC,IANSnmB,MAW9B+1D,EAAa11D,UAAUwkC,QAAU,SAAkB1e,GACjD,OAAKA,EAAMhlB,OACJ40D,EAAaxjC,KAAKpM,GAAO4e,OAAO/kC,MADXA,MAI9B+1D,EAAa11D,UAAU61D,YAAc,SAAsB/vC,GACzD,OAAO,IAAIgwC,EAAOn2D,KAAMmmB,IAK1B4vC,EAAa11D,UAAU0C,MAAQ,SAAgBwvB,EAAMiO,GAInD,YAHgB,IAATjO,IAAkBA,EAAO,QAClB,IAAPiO,IAAgBA,EAAKxgC,KAAKmB,QAE7BoxB,GAAQiO,EAAau1B,EAAa91B,MAC/BjgC,KAAKo2D,WAAWx2D,KAAKsvB,IAAI,EAAGqD,GAAO3yB,KAAKiJ,IAAI7I,KAAKmB,OAAQq/B,KAKlEu1B,EAAa11D,UAAU0D,IAAM,SAAc9C,GACzC,KAAIA,EAAI,GAAKA,GAAKjB,KAAKmB,QACvB,OAAOnB,KAAKq2D,SAASp1D,IAQvB80D,EAAa11D,UAAUS,QAAU,SAAkBuD,EAAGkuB,EAAMiO,QAC1C,IAATjO,IAAkBA,EAAO,QAClB,IAAPiO,IAAgBA,EAAKxgC,KAAKmB,QAE7BoxB,GAAQiO,EACRxgC,KAAKs2D,aAAajyD,EAAGkuB,EAAMiO,EAAI,GAE/BxgC,KAAKu2D,qBAAqBlyD,EAAGkuB,EAAMiO,EAAI,IAM7Cu1B,EAAa11D,UAAU0Z,IAAM,SAAc1V,EAAGkuB,EAAMiO,QAClC,IAATjO,IAAkBA,EAAO,QAClB,IAAPiO,IAAgBA,EAAKxgC,KAAKmB,QAEjC,IAAI0B,EAAS,GAEb,OADA7C,KAAKc,SAAQ,SAAU01D,EAAKv1D,GAAK,OAAO4B,EAAOsS,KAAK9Q,EAAEmyD,EAAKv1D,MAAQsxB,EAAMiO,GAClE39B,GAMTkzD,EAAaxjC,KAAO,SAAe3gB,GACjC,OAAIA,aAAkBmkD,EAAuBnkD,EACtCA,GAAUA,EAAOzQ,OAAS,IAAIs1D,EAAK7kD,GAAUmkD,EAAa91B,OAGnE,IAAIw2B,EAAqB,SAAUV,GACjC,SAASU,EAAK7kD,GACZmkD,EAAav1D,KAAKR,MAClBA,KAAK4R,OAASA,EAGXmkD,IAAeU,EAAKzvC,UAAY+uC,GACrCU,EAAKp2D,UAAYD,OAAOkO,OAAQynD,GAAgBA,EAAa11D,WAC7Do2D,EAAKp2D,UAAUmB,YAAci1D,EAE7B,IAAIp0B,EAAqB,CAAElhC,OAAQ,CAAEgL,cAAc,GAAOg8B,MAAO,CAAEh8B,cAAc,IAyCjF,OAvCAsqD,EAAKp2D,UAAUq2D,QAAU,WACvB,OAAO12D,KAAK4R,QAGd6kD,EAAKp2D,UAAU+1D,WAAa,SAAqB7jC,EAAMiO,GACrD,OAAY,GAARjO,GAAaiO,GAAMxgC,KAAKmB,OAAiBnB,KACtC,IAAIy2D,EAAKz2D,KAAK4R,OAAO7O,MAAMwvB,EAAMiO,KAG1Ci2B,EAAKp2D,UAAUg2D,SAAW,SAAmBp1D,GAC3C,OAAOjB,KAAK4R,OAAO3Q,IAGrBw1D,EAAKp2D,UAAUi2D,aAAe,SAAuBjyD,EAAGkuB,EAAMiO,EAAI+E,GAChE,IAAK,IAAItkC,EAAIsxB,EAAMtxB,EAAIu/B,EAAIv/B,IACvB,IAAqC,IAAjCoD,EAAErE,KAAK4R,OAAO3Q,GAAIskC,EAAQtkC,GAAgB,OAAO,GAG3Dw1D,EAAKp2D,UAAUk2D,qBAAuB,SAA+BlyD,EAAGkuB,EAAMiO,EAAI+E,GAChF,IAAK,IAAItkC,EAAIsxB,EAAO,EAAGtxB,GAAKu/B,EAAIv/B,IAC5B,IAAqC,IAAjCoD,EAAErE,KAAK4R,OAAO3Q,GAAIskC,EAAQtkC,GAAgB,OAAO,GAG3Dw1D,EAAKp2D,UAAU21D,WAAa,SAAqB7vC,GAC/C,GAAInmB,KAAKmB,OAASglB,EAAMhlB,QApHP,IAqHb,OAAO,IAAIs1D,EAAKz2D,KAAK4R,OAAO/G,OAAOsb,EAAMuwC,aAG/CD,EAAKp2D,UAAU41D,YAAc,SAAsB9vC,GACjD,GAAInmB,KAAKmB,OAASglB,EAAMhlB,QAzHP,IA0Hb,OAAO,IAAIs1D,EAAKtwC,EAAMuwC,UAAU7rD,OAAO7K,KAAK4R,UAGlDywB,EAAmBlhC,OAAO4C,IAAM,WAAc,OAAO/D,KAAK4R,OAAOzQ,QAEjEkhC,EAAmB8F,MAAMpkC,IAAM,WAAc,OAAO,GAEpD3D,OAAOyM,iBAAkB4pD,EAAKp2D,UAAWgiC,GAElCo0B,EAnDgB,CAoDvBV,GAIFA,EAAa91B,MAAQ,IAAIw2B,EAAK,IAE9B,IAAIN,EAAuB,SAAUJ,GACnC,SAASI,EAAO5Q,EAAMC,GACpBuQ,EAAav1D,KAAKR,MAClBA,KAAKulD,KAAOA,EACZvlD,KAAKwlD,MAAQA,EACbxlD,KAAKmB,OAASokD,EAAKpkD,OAASqkD,EAAMrkD,OAClCnB,KAAKmoC,MAAQvoC,KAAKsvB,IAAIq2B,EAAKpd,MAAOqd,EAAMrd,OAAS,EA2DnD,OAxDK4tB,IAAeI,EAAOnvC,UAAY+uC,GACvCI,EAAO91D,UAAYD,OAAOkO,OAAQynD,GAAgBA,EAAa11D,WAC/D81D,EAAO91D,UAAUmB,YAAc20D,EAE/BA,EAAO91D,UAAUq2D,QAAU,WACzB,OAAO12D,KAAKulD,KAAKmR,UAAU7rD,OAAO7K,KAAKwlD,MAAMkR,YAG/CP,EAAO91D,UAAUg2D,SAAW,SAAmBp1D,GAC7C,OAAOA,EAAIjB,KAAKulD,KAAKpkD,OAASnB,KAAKulD,KAAKxhD,IAAI9C,GAAKjB,KAAKwlD,MAAMzhD,IAAI9C,EAAIjB,KAAKulD,KAAKpkD,SAGhFg1D,EAAO91D,UAAUi2D,aAAe,SAAuBjyD,EAAGkuB,EAAMiO,EAAI+E,GAClE,IAAIoxB,EAAU32D,KAAKulD,KAAKpkD,OACxB,QAAIoxB,EAAOokC,IAC2D,IAAlE32D,KAAKulD,KAAK+Q,aAAajyD,EAAGkuB,EAAM3yB,KAAKiJ,IAAI23B,EAAIm2B,GAAUpxB,QAEvD/E,EAAKm2B,IAC6G,IAAlH32D,KAAKwlD,MAAM8Q,aAAajyD,EAAGzE,KAAKsvB,IAAIqD,EAAOokC,EAAS,GAAI/2D,KAAKiJ,IAAI7I,KAAKmB,OAAQq/B,GAAMm2B,EAASpxB,EAAQoxB,UADzG,IAKFR,EAAO91D,UAAUk2D,qBAAuB,SAA+BlyD,EAAGkuB,EAAMiO,EAAI+E,GAClF,IAAIoxB,EAAU32D,KAAKulD,KAAKpkD,OACxB,QAAIoxB,EAAOokC,IACkG,IAAzG32D,KAAKwlD,MAAM+Q,qBAAqBlyD,EAAGkuB,EAAOokC,EAAS/2D,KAAKsvB,IAAIsR,EAAIm2B,GAAWA,EAASpxB,EAAQoxB,QAE5Fn2B,EAAKm2B,IACqE,IAA1E32D,KAAKulD,KAAKgR,qBAAqBlyD,EAAGzE,KAAKiJ,IAAI0pB,EAAMokC,GAAUn2B,EAAI+E,UADnE,IAKF4wB,EAAO91D,UAAU+1D,WAAa,SAAqB7jC,EAAMiO,GACvD,GAAY,GAARjO,GAAaiO,GAAMxgC,KAAKmB,OAAU,OAAOnB,KAC7C,IAAI22D,EAAU32D,KAAKulD,KAAKpkD,OACxB,OAAIq/B,GAAMm2B,EAAkB32D,KAAKulD,KAAKxiD,MAAMwvB,EAAMiO,GAC9CjO,GAAQokC,EAAkB32D,KAAKwlD,MAAMziD,MAAMwvB,EAAOokC,EAASn2B,EAAKm2B,GAC7D32D,KAAKulD,KAAKxiD,MAAMwvB,EAAMokC,GAAS5xB,OAAO/kC,KAAKwlD,MAAMziD,MAAM,EAAGy9B,EAAKm2B,KAGxER,EAAO91D,UAAU21D,WAAa,SAAqB7vC,GACjD,IAAI0gB,EAAQ7mC,KAAKwlD,MAAMwQ,WAAW7vC,GAClC,GAAI0gB,EAAS,OAAO,IAAIsvB,EAAOn2D,KAAKulD,KAAM1e,IAG5CsvB,EAAO91D,UAAU41D,YAAc,SAAsB9vC,GACnD,IAAI0gB,EAAQ7mC,KAAKulD,KAAK0Q,YAAY9vC,GAClC,GAAI0gB,EAAS,OAAO,IAAIsvB,EAAOtvB,EAAO7mC,KAAKwlD,QAG7C2Q,EAAO91D,UAAU61D,YAAc,SAAsB/vC,GACnD,OAAInmB,KAAKulD,KAAKpd,OAASvoC,KAAKsvB,IAAIlvB,KAAKwlD,MAAMrd,MAAOhiB,EAAMgiB,OAAS,EACtD,IAAIguB,EAAOn2D,KAAKulD,KAAM,IAAI4Q,EAAOn2D,KAAKwlD,MAAOr/B,IACjD,IAAIgwC,EAAOn2D,KAAMmmB,IAGnBgwC,EAjEkB,CAkEzBJ,GAIaa,EAFIb,ECvLbc,EACJ,SAAYC,EAAOC,GACjB/2D,KAAK82D,MAAQA,EACb92D,KAAK+2D,WAAaA,GAMtB,YAAEC,SAAA,SAASxwD,EAAOywD,G,WACd,GAAuB,GAAnBj3D,KAAK+2D,WAAiB,OAAO,KAGjC,IADA,IAMIG,EAAOxX,EANPpa,EAAMtlC,KAAK82D,MAAM31D,QACbmkC,IAAO,CAEf,GADatlC,KAAK82D,MAAM/yD,IAAIuhC,EAAM,GACvB/G,UAAW,GAAI+G,EAAK,OAI3B2xB,IACFC,EAAQl3D,KAAKm3D,UAAU7xB,EAAKtlC,KAAK82D,MAAM31D,QACvCu+C,EAAUwX,EAAMzc,KAAKt5C,QAEvB28B,IACIS,EAAW64B,EADX7C,EAAY/tD,EAAMi7B,GAElB41B,EAAW,GAAI3yB,EAAY,GAkC/B,OAhCA1kC,KAAK82D,MAAMh2D,SAAO,SAAEkpB,EAAM/oB,GACxB,IAAK+oB,EAAK9O,KAOR,OANKg8C,IACL,EAAUl3D,EAAKm3D,UAAU7xB,EAAKrkC,EAAI,GAChCy+C,EAAUwX,EAAMzc,KAAKt5C,QAEvBu+C,SACAhb,EAAUvvB,KAAK6U,GAInB,GAAMktC,EAAO,CACX,EAAY/hD,KAAK,IAAIN,EAAKmV,EAAKjQ,MAC7B+jB,IAAgD/jB,EAA5CmB,EAAO8O,EAAK9O,KAAKnB,IAAIm9C,EAAMn0D,MAAM28C,IAEjCxkC,GAAQq5C,EAAU7Y,UAAUxgC,GAAMkjB,MACpCrkB,EAAMw6C,EAAU31B,QAAQ6b,KAAK8Z,EAAU31B,QAAQ6b,KAAKt5C,OAAS,GAC/D,EAAWgU,KAAK,IAAIN,EAAKkF,EAAK,KAAM,KAAMs9C,EAASl2D,OAASujC,EAAUvjC,UAEtEu+C,IACI3lC,GAAKm9C,EAAMtc,UAAU7gC,EAAK2lC,QAE9B6U,EAAU7Y,UAAU1xB,EAAK9O,MAG3B,OAAI8O,EAAKuU,WACT,EAAc24B,EAAQltC,EAAKuU,UAAUxkB,IAAIm9C,EAAMn0D,MAAM28C,IAAY11B,EAAKuU,UACpE64B,EAAY,IAAIP,EAAO72D,EAAK82D,MAAM/zD,MAAM,EAAGuiC,GAAKP,OAAOL,EAAUwI,UAAUriC,OAAOwsD,IAAYr3D,EAAK+2D,WAAa,IACzG,QAHT,IAKC/2D,KAAK82D,MAAM31D,OAAQ,GAEf,WAACi2D,EAAS,UAAE7C,EAAS,UAAEh2B,IAKlC,YAAE+4B,aAAA,SAAa/C,EAAWh2B,EAAWg5B,EAAaN,GAI9C,IAHA,IAAIO,EAAW,GAAIT,EAAa/2D,KAAK+2D,WACjCU,EAAWz3D,KAAK82D,MAAOY,GAAYT,GAAiBQ,EAASt2D,OAASs2D,EAAS1zD,IAAI0zD,EAASt2D,OAAS,GAAK,KAErGF,EAAI,EAAGA,EAAIszD,EAAU51B,MAAMx9B,OAAQF,IAAK,CAC/C68B,IACiE65B,EAD7Dz8C,EAAOq5C,EAAU51B,MAAM19B,GAAGs5C,OAAOga,EAAU/Y,KAAKv6C,IAChD+oB,EAAO,IAAInV,EAAK0/C,EAAU31B,QAAQ6b,KAAKx5C,GAAIia,EAAMqjB,IACjDo5B,EAASD,GAAYA,EAAS90D,MAAMonB,MACxC,EAAS2tC,EACH12D,EAAGu2D,EAAShqB,MACXiqB,EAAWA,EAAS10D,MAAM,EAAG00D,EAASt2D,OAAS,IAEtDq2D,EAASriD,KAAK6U,GACVuU,IACFw4B,IACF,EAAc,MAETE,IAAeS,EAAW1tC,GAEjC,IA2GkB8sC,EAAOj+C,EACvB++C,EA5GEC,EAAWd,EAAaQ,EAAYpvB,MAKxC,OAJI0vB,EAAWC,IA0GUj/C,EAzGWg/C,GAyGlBf,EAzGQW,GA2GtB32D,SAAO,SAAEkpB,EAAM/oB,GACnB,GAAI+oB,EAAKuU,WAAqB,GAAP1lB,IAErB,OADA++C,EAAW32D,GACJ,KA9GPw2D,EAiHGX,EAAM/zD,MAAM60D,GAhHjB,GAAgBC,GAET,IAAIhB,EAAOY,EAAS1yB,OAAOyyB,GAAWT,IAGjD,YAAEI,UAAA,SAAU5kC,EAAMiO,GACd1C,IAAI2c,EAAO,IAAI,IAMf,OALAz6C,KAAK82D,MAAMh2D,SAAO,SAAEkpB,EAAM/oB,GACxB68B,IAAIi6B,EAAiC,MAArB/tC,EAAKguC,cAAwB/2D,EAAI+oB,EAAKguC,cAAgBzlC,EAChEkoB,EAAKA,KAAKt5C,OAAS6oB,EAAKguC,aAAe,KAC/C,EAAOpd,UAAU5wB,EAAKjQ,IAAKg+C,KACxBxlC,EAAMiO,GACFia,GAGX,YAAEwd,QAAA,SAAQnjD,GACN,OAAuB,GAAnB9U,KAAK+2D,WAAwB/2D,KAC1B,IAAI62D,EAAO72D,KAAK82D,MAAM/xB,OAAOjwB,EAAMiF,KAAG,SAACA,GAAI,OAAG,IAAIlF,EAAKkF,OAAQ/Z,KAAK+2D,aAQ/E,YAAEmB,QAAA,SAAQC,EAAkBC,GACxB,IAAKp4D,KAAK+2D,WAAY,OAAO/2D,KAE7B,IAAIq4D,EAAe,GAAI9yB,EAAQ3lC,KAAKsvB,IAAI,EAAGlvB,KAAK82D,MAAM31D,OAASi3D,GAE3Dx5B,EAAUu5B,EAAiBv5B,QAC3B05B,EAAWH,EAAiBx5B,MAAMx9B,OAClC41D,EAAa/2D,KAAK+2D,WACtB/2D,KAAK82D,MAAMh2D,SAAO,SAACkpB,GAAcA,EAAKuU,WAAWw4B,MAAgBxxB,GAEjEzH,IAAIy6B,EAAWH,EACfp4D,KAAK82D,MAAMh2D,SAAO,SAACkpB,GACnB,IAAMjO,EAAM6iB,EAAQsc,YAAYqd,GAC9B,GAAW,MAAPx8C,EAAJ,CACF,EAAanc,KAAKiJ,IAAIyvD,EAAUv8C,GAChC,IAAMhC,EAAM6kB,EAAQ6b,KAAK1+B,GACvB,GAAIiO,EAAK9O,KAAM,CACb4iB,IAAI5iB,EAAOi9C,EAAiBx5B,MAAM5iB,GAAKw+B,OAAO4d,EAAiB3c,KAAKz/B,IAChEwiB,EAAYvU,EAAKuU,WAAavU,EAAKuU,UAAUxkB,IAAI6kB,EAAQ77B,MAAMw1D,EAAW,EAAGx8C,IAC7EwiB,GAAWw4B,IACfsB,EAAaljD,KAAK,IAAIN,EAAKkF,EAAKmB,EAAMqjB,SAExC,EAAeppB,KAAK,IAAIN,EAAKkF,OAE5BwrB,GAGH,IADAzH,IAAI06B,EAAU,GACLv3D,EAAIm3D,EAAcn3D,EAAIq3D,EAAUr3D,IACvCu3D,EAAQrjD,KAAK,IAAIN,EAAK+pB,EAAQ6b,KAAKx5C,KACrC,IAAI61D,EAAQ92D,KAAK82D,MAAM/zD,MAAM,EAAGwiC,GAAOR,OAAOyzB,GAASzzB,OAAOszB,GAC1DI,EAAS,IAAI5B,EAAOC,EAAOC,GAI/B,OAFI0B,EAAOC,iBAjJS,MAkJlBD,EAASA,EAAOE,SAAS34D,KAAK82D,MAAM31D,OAASk3D,EAAal3D,SACrDs3D,GAGX,YAAEC,eAAA,WACE56B,IAAI4jB,EAAQ,EAEZ,OADA1hD,KAAK82D,MAAMh2D,SAAO,SAACkpB,GAAeA,EAAK9O,MAAMwmC,OACtCA,GASX,YAAEiX,SAAA,SAASthB,Q,UAAOr3C,KAAK82D,MAAM31D,QACzB28B,IAAIo5B,EAAQl3D,KAAKm3D,UAAU,EAAG9f,GAAOqI,EAAUwX,EAAMzc,KAAKt5C,OACtD21D,EAAQ,GAAIzI,EAAS,EAsBzB,OArBAruD,KAAK82D,MAAMh2D,SAAO,SAAEkpB,EAAM/oB,GACxB,GAAIA,GAAKo2C,EACPyf,EAAM3hD,KAAK6U,GACPA,EAAKuU,WAAW8vB,SACf,GAAIrkC,EAAK9O,KAAM,CACtB,IAAMA,EAAO8O,EAAK9O,KAAKnB,IAAIm9C,EAAMn0D,MAAM28C,IAAW3lC,EAAMmB,GAAQA,EAAK2gC,SAGrE,GAFE6D,IACI3lC,GAAKm9C,EAAMtc,UAAU7gC,EAAK2lC,GAC1BxkC,EAAM,CACV,IAAMqjB,EAAYvU,EAAKuU,WAAavU,EAAKuU,UAAUxkB,IAAIm9C,EAAMn0D,MAAM28C,IAC7DnhB,GAAW8vB,IACjB,IAAyDsJ,EAAnDiB,EAAU,IAAI/jD,EAAKkF,EAAIwgC,SAAUr/B,EAAMqjB,GAAoB5D,EAAOm8B,EAAM31D,OAAS,GACjFw2D,EAASb,EAAM31D,QAAU21D,EAAMn8B,GAAM/3B,MAAMg2D,IAC7C9B,EAAMn8B,GAAQg9B,EAEdb,EAAM3hD,KAAKyjD,SAEN5uC,EAAKjQ,KACd2lC,MAED1/C,KAAK82D,MAAM31D,OAAQ,GACf,IAAI01D,EAAO,EAAatkC,KAAKukC,EAAM5pB,WAAYmhB,IAI1DwI,EAAO52B,MAAQ,IAAI42B,EAAO,EAAa52B,MAAO,GAa9C,IAAMprB,EACJ,SAAYkF,EAAKmB,EAAMqjB,EAAWy5B,GAEhCh4D,KAAK+Z,IAAMA,EAEX/Z,KAAKkb,KAAOA,EAIZlb,KAAKu+B,UAAYA,EAGjBv+B,KAAKg4D,aAAeA,GAGxB,YAAEp1D,MAAA,SAAMujB,GACJ,GAAInmB,KAAKkb,MAAQiL,EAAMjL,OAASiL,EAAMoY,UAAW,CAC/CT,IAAI5iB,EAAOiL,EAAMjL,KAAKtY,MAAM5C,KAAKkb,MACnC,GAAMA,EAAM,OAAO,IAAIrG,EAAKqG,EAAK2gC,SAAStB,SAAUr/B,EAAMlb,KAAKu+B,aAQnE,IAAas6B,EACX,SAAY9hD,EAAM+hD,EAAQC,EAAYC,GACpCh5D,KAAK+W,KAAOA,EACZ/W,KAAK84D,OAASA,EACd94D,KAAK+4D,WAAaA,EAClB/4D,KAAKg5D,SAAWA,GAIdlB,EAAiB,GAsDvB,SAASmB,EAAUl/C,GACjB+jB,IAAIj7B,EAAS,GAEb,OADAkX,EAAIjZ,SAAO,SAAEo4D,EAAOC,EAAK5mC,EAAMiO,GAAI,OAAG39B,EAAOsS,KAAKod,EAAMiO,MACjD39B,EAGT,SAASu2D,EAAU3f,EAAQ7a,GACzB,IAAK6a,EAAQ,OAAO,KAEpB,IADA3b,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAIw4C,EAAOt4C,OAAQF,GAAK,EAAG,CACzC68B,IAAIvL,EAAOqM,EAAQ7kB,IAAI0/B,EAAOx4C,GAAI,GAAIu/B,EAAK5B,EAAQ7kB,IAAI0/B,EAAOx4C,EAAI,IAAK,GACnEsxB,GAAQiO,GAAI39B,EAAOsS,KAAKod,EAAMiO,GAEpC,OAAO39B,EAMT,SAASw2D,EAAgBC,EAAS9yD,EAAOkjD,EAAU6P,GACjDz7B,IAAIm5B,EAAgBuC,EAAkBhzD,GAAQ+wD,EAAckC,EAAW11D,IAAIyC,GAAO27B,KAAK5iB,OACnFiuB,GAAO+rB,EAAOD,EAAQR,OAASQ,EAAQviD,MAAMigD,SAASxwD,EAAOywD,GACjE,GAAKzpB,EAAL,CAEA1P,IAAIS,EAAYiP,EAAIjP,UAAU9e,QAAQ+tB,EAAI+mB,UAAUn2B,KAChDqiB,GAAS8Y,EAAOD,EAAQviD,KAAOuiD,EAAQR,QAAQxB,aAAa9pB,EAAI+mB,UAAW/tD,EAAM+3B,UAAUyoB,cAC/BuQ,EAAaN,GAEzEyC,EAAU,IAAIb,EAAaU,EAAO9Y,EAAQjT,EAAI4pB,UAAWmC,EAAO/rB,EAAI4pB,UAAY3W,EAAO,KAAM,GACjGiJ,EAASlc,EAAI+mB,UAAU11B,aAAaN,GAAWuC,QAAQ24B,EAAY,MAACF,EAAMI,aAAcD,IAAUx4B,mBAGpGpD,IAAI87B,GAAsB,EAAOC,EAA6B,KAK9D,SAASL,EAAkBhzD,GACzBs3B,IAAIiE,EAAUv7B,EAAMu7B,QACpB,GAAI83B,GAA8B93B,EAAS,CACzC63B,GAAsB,EACtBC,EAA6B93B,EAC7B,IAAKjE,IAAI78B,EAAI,EAAGA,EAAI8gC,EAAQ5gC,OAAQF,IAAK,GAAI8gC,EAAQ9gC,GAAGkhC,KAAK23B,qBAAsB,CACjFF,GAAsB,EACtB,OAGJ,OAAOA,EAWT37B,IAAMw7B,EAAa,IAAI,YAAU,WAC3BM,EAAkB,IAAI,YAAU,gBAsB/B,SAAS,EAAQx6C,GAGtB,OAFAA,EAAS,CAAC4oB,MAAO5oB,GAAUA,EAAO4oB,OAAS,IACjC6xB,cAAez6C,GAAUA,EAAOy6C,eAAiB,KACpD,IAAI,SAAO,CAChB54D,IAAKq4D,EAELjzD,MAAO,CACL0yB,KAAA,WACE,OAAO,IAAI2/B,EAAahC,EAAO52B,MAAO42B,EAAO52B,MAAO,KAAM,IAE5DtzB,MAAA,SAAM80B,EAAIw4B,EAAMzzD,GACd,OA9IR,SAA0B8yD,EAAS9yD,EAAOi7B,EAAIt8B,GAC5C24B,IAAwCo6B,EAApCgC,EAAYz4B,EAAGV,QAAQ04B,GAC3B,GAAIS,EAAW,OAAOA,EAAUP,aAE5Bl4B,EAAGV,QAAQg5B,KAAkBT,EAAU,IAAIT,EAAaS,EAAQviD,KAAMuiD,EAAQR,OAAQ,KAAM,IAEhGh7B,IAAIq8B,EAAW14B,EAAGV,QAAQ,uBAE1B,GAAuB,GAAnBU,EAAG9C,MAAMx9B,OACX,OAAOm4D,EACF,GAAIa,GAAYA,EAASp5B,QAAQ04B,GACtC,OAAIU,EAASp5B,QAAQ04B,GAAYF,KACxB,IAAIV,EAAaS,EAAQviD,KAAKugD,aAAa71B,EAAI,KAAMt8B,EAASq0D,EAAkBhzD,IAC/D8yD,EAAQR,OAAQG,EAAUx3B,EAAG7C,QAAQ6b,KAAKhZ,EAAG9C,MAAMx9B,OAAS,IAAKm4D,EAAQN,UAE1F,IAAIH,EAAaS,EAAQviD,KAAMuiD,EAAQR,OAAOxB,aAAa71B,EAAI,KAAMt8B,EAASq0D,EAAkBhzD,IAC/E,KAAM8yD,EAAQN,UACnC,IAAmC,IAA/Bv3B,EAAGV,QAAQ,iBAA+Bo5B,IAAiD,IAArCA,EAASp5B,QAAQ,gBAQ3E,OAAIm3B,EAAUz2B,EAAGV,QAAQ,YAGvB,IAAI83B,EAAaS,EAAQviD,KAAKmhD,QAAQz2B,EAAIy2B,GACzBoB,EAAQR,OAAOZ,QAAQz2B,EAAIy2B,GAC3BkB,EAAUE,EAAQP,WAAYt3B,EAAG7C,SAAU06B,EAAQN,UAEpE,IAAIH,EAAaS,EAAQviD,KAAKkhD,QAAQx2B,EAAG7C,QAAQ6b,MAChC6e,EAAQR,OAAOb,QAAQx2B,EAAG7C,QAAQ6b,MAClC2e,EAAUE,EAAQP,WAAYt3B,EAAG7C,SAAU06B,EAAQN,UAf3El7B,IAAIs8B,EAA+B,GAApBd,EAAQN,WAAkBmB,IAAab,EAAQN,UAAYv3B,EAAGpD,MAAQ,GAAKl5B,EAAQ60D,gBAmBtG,SAAsBzF,EAAWwE,GAC/B,IAAKA,EAAY,OAAO,EACxB,IAAKxE,EAAU3Y,WAAY,OAAO,EAClC9d,IAAIu8B,GAAW,EAMf,OALA9F,EAAU31B,QAAQ6b,KAAK,GAAG35C,SAAO,SAAEykC,EAAOD,GACxC,IAAKxH,IAAI78B,EAAI,EAAGA,EAAI83D,EAAW53D,OAAQF,GAAK,EACtCskC,GAASwzB,EAAW93D,EAAI,IAAMqkC,GAAOyzB,EAAW93D,KAClDo5D,GAAW,MAEVA,EA3BkDC,CAAa74B,EAAI63B,EAAQP,aAC5EA,EAAaoB,EAAWf,EAAUE,EAAQP,WAAYt3B,EAAG7C,SAAWq6B,EAAUx3B,EAAG7C,QAAQ6b,KAAKhZ,EAAG9C,MAAMx9B,OAAS,IACpH,OAAO,IAAI03D,EAAaS,EAAQviD,KAAKugD,aAAa71B,EAAI24B,EAAW5zD,EAAM+3B,UAAUyoB,cAAgB,KAC/C7hD,EAASq0D,EAAkBhzD,IACrDqwD,EAAO52B,MAAO84B,EAAYt3B,EAAGpD,MAsH1CiE,CAAiB23B,EAAMzzD,EAAOi7B,EAAIliB,K,OAI7CA,IAMG,SAAS,EAAK/Y,EAAOkjD,GAC1B5rB,IAAIm8B,EAAOR,EAAWr1B,SAAS59B,GAC/B,SAAKyzD,GAAgC,GAAxBA,EAAKljD,KAAKggD,cACnBrN,GAAU2P,EAAgBY,EAAMzzD,EAAOkjD,GAAU,IAC9C,GAKF,SAAS,EAAKljD,EAAOkjD,GAC1B5rB,IAAIm8B,EAAOR,EAAWr1B,SAAS59B,GAC/B,SAAKyzD,GAAkC,GAA1BA,EAAKnB,OAAO/B,cACrBrN,GAAU2P,EAAgBY,EAAMzzD,EAAOkjD,GAAU,IAC9C,GAKF,SAAS,EAAUljD,GACxBs3B,IAAIm8B,EAAOR,EAAWr1B,SAAS59B,GAC/B,OAAOyzD,EAAOA,EAAKljD,KAAKggD,WAAa,EAKhC,SAAS,EAAUvwD,GACxBs3B,IAAIm8B,EAAOR,EAAWr1B,SAAS59B,GAC/B,OAAOyzD,EAAOA,EAAKnB,OAAO/B,WAAa,E;;;;;MCtanCwD,E,kIAoBD,IADDxyD,EACC,EADDA,KAEA,OAAO,kBAAMyyD,YAAWzyD,M,8BAKvB,IADDA,EACC,EADDA,KAEA,MAAO,CACL,SAAUyyD,YAAWzyD,M,oCAMtB,IADDA,EACC,EADDA,KAEA,MAAO,CAAC2sD,YAAkB,WAAY3sD,M,2BAjCtC,MAAO,e,6BAIP,MAAO,CACLtE,QAAS,SACTwpD,MAAO,QACPrJ,UAAU,EACViG,WAAW,EACXra,SAAU,CAAC,CACT7zB,IAAK,eAEPg8B,MAAO,iBAAM,CAAC,aAAc,S,GAdTmV,KAwCnB2N,G,kIAmBD,IAFD1yD,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,OAAO,kBAAMi6B,YAAW3yD,EAAM04B,EAAOoH,MAAM8yB,c,8BAM1C,IAFD5yD,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,MAAO,CACL,eAAgBi6B,YAAW3yD,EAAM04B,EAAOoH,MAAM8yB,c,oCAM/C,IADD5yD,EACC,EADDA,KAEA,MAAO,CAAC2sD,YAAkB,iBAAkB3sD,M,2BAjC5C,MAAO,gB,6BAIP,MAAO,CACLtE,QAAS,aACTwpD,MAAO,QACPzd,SAAU,CAAC,CACT7zB,IAAK,OAEPg8B,MAAO,iBAAM,CAAC,KAAM,S,GAZDmV,KAwCnB8N,G,kIAwBD,IAFD7yD,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,OAAO,kBAAMo6B,YAAgB9yD,EAAM04B,EAAOoH,MAAMizB,c,8BAK/C,IADD/yD,EACC,EADDA,KAEA,MAAO,CACL,gBAAiB03C,YAAa13C,M,oCAM/B,IADDA,EACC,EADDA,KAEA,MAAO,CAAC8sD,YAAuB,QAAS9sD,M,2BArCxC,MAAO,e,6BAIP,MAAO,CACLtE,QAAS,QACTw7B,MAAO,GACPguB,MAAO,QACP7qC,MAAM,EACNwhC,UAAU,EACViG,WAAW,EACXra,SAAU,CAAC,CACT7zB,IAAK,MACLo2B,mBAAoB,SAEtB4F,MAAO,iBAAM,CAAC,MAAO,CAAC,OAAQ,U,GAjBZmV,KA4CxB,SAASiO,GAAT,GAGG,IAFD38B,EAEC,EAFDA,IACA3+B,EACC,EADDA,KAEM2oD,EAAc,GACd4S,EAASC,yBAAe78B,GAAKpkB,QAAO,SAAAgQ,GAAI,OAAIA,EAAK+V,KAAKh4B,KAAKtI,OAASA,KAqC1E,OAlBAu7D,EAAOl6D,SAAQ,SAAAq1C,GACb,IAAI+kB,EAAW/kB,EAAMp6B,IAAM,GAlBb,SAAV26C,EAAU3sC,GAAI,OAAIA,EAAK2hB,QAAO,SAACxoC,EAAGC,GAAJ,OAAUD,EAAE2H,OAAOqK,MAAM5U,QAAQ6C,GAAKuzD,EAAQvzD,GAAKA,KAAI,KAoBzFuzD,CAlBF,SAASyE,EAAWtzB,GAAuB,IAAhB+d,EAAgB,uDAAJ,GACrC,OAAO/d,EAAM9tB,KAAI,SAAAgmB,GACf,IAAMq7B,EAAU,GAAH,SAAOxV,GAAP,EAAsB7lB,EAAKs7B,WAAat7B,EAAKs7B,WAAWzV,UAAY,KAEjF,OAAI7lB,EAAKu7B,SACAH,EAAWp7B,EAAKu7B,SAAUF,GAG5B,CACL76B,KAAMR,EAAKt7B,MACX22D,cAQID,CADMI,IAAIC,cAAcrlB,EAAMpW,KAAK6sB,aAAanoD,QAC7BsV,KAAI,SAAAgmB,GAC7B,IAAMxN,EAAO2oC,EACP16B,EAAKjO,EAAOwN,EAAKQ,KAAKp/B,OAE5B,OADA+5D,EAAW16B,EACX,OAAYT,GAAZ,IACExN,OACAiO,UAED1/B,SAAQ,SAAAi/B,GACT,IAAM07B,EAAaC,IAAWpuB,OAAOvN,EAAKxN,KAAMwN,EAAKS,GAAI,CACvDkkB,MAAO3kB,EAAKq7B,QAAQx0D,KAAK,OAE3BwhD,EAAYjzC,KAAKsmD,SAGdE,IAAcrtD,OAAO8vB,EAAKgqB,G,IA0C7BwT,G,8BACJ,aAA0B,MAAdz2D,EAAc,uDAAJ,GAAI,UACxB,cAAMA,GAEN,IACE/E,OAAOuR,QAAQ,EAAKxM,QAAQ02D,WAAW/6D,SAAQ,YAAqB,aAAnBrB,EAAmB,KAAbm/B,EAAa,KAClE28B,IAAIO,iBAAiBr8D,EAAMm/B,MAE7B,MAAO+L,GACP,MAAM,IAAI/2B,MAAM,2FARM,S,8CAyCvB,IAFD7L,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,OAAO,kBAAMo6B,YAAgB9yD,EAAM04B,EAAOoH,MAAMizB,c,8BAK/C,IADD/yD,EACC,EADDA,KAEA,MAAO,CACL,gBAAiB03C,YAAa13C,M,oCAM/B,IADDA,EACC,EADDA,KAEA,MAAO,CAAC8sD,YAAuB,QAAS9sD,M,2BA3CxC,MAAO,e,qCAIP,MAAO,CACL8zD,UAAW,M,6BAKb,MAAO,CACLp4D,QAAS,QACTw7B,MAAO,GACPguB,MAAO,QACP7qC,MAAM,EACNwhC,UAAU,EACViG,WAAW,EACXra,SAAU,CAAC,CACT7zB,IAAK,MACLo2B,mBAAoB,SAEtB4F,MAAO,iBAAM,CAAC,MAAO,CAAC,OAAQ,Q,8BA0BhC,MAAO,EApGX,EAoG4B,CACtBl4C,KAAMO,KAAKP,MApGfA,EACC,EADDA,KAEO,IAAIqpB,IAAO,CAChBrpB,KAAM,IAAI4kC,IAAU,aACpB79B,MAAO,CACL0yB,KAAM,SAAC+H,EAAD,UAEA85B,GAAe,CACnB38B,IAHI,EACJA,IAGA3+B,UAEFkN,MAAO,SAAC88C,EAAasS,EAAe94B,EAAUL,GAG5C,IAAMo5B,EAAc/4B,EAAS1E,UAAUgB,MAAMv1B,OAAOjC,KAAKtI,KACnDw8D,EAAcr5B,EAASrE,UAAUgB,MAAMv1B,OAAOjC,KAAKtI,KACnDy8D,EAAWjB,yBAAeh4B,EAAS7E,KAAKpkB,QAAO,SAAAgQ,GAAI,OAAIA,EAAK+V,KAAKh4B,KAAKtI,OAASA,KAC/E08D,EAAWlB,yBAAer4B,EAASxE,KAAKpkB,QAAO,SAAAgQ,GAAI,OAAIA,EAAK+V,KAAKh4B,KAAKtI,OAASA,KAErF,OAAIgqD,EAAY7N,aAAe,CAACogB,EAAaC,GAAa/+C,SAASzd,IAAS08D,EAASh7D,SAAW+6D,EAAS/6D,QAChG45D,GAAe,CACpB38B,IAAKqrB,EAAYrrB,IACjB3+B,SAIGs8D,EAAchiD,IAAI0vC,EAAY7qB,QAAS6qB,EAAYrrB,OAG9D6F,MAAO,CACLmkB,YADK,SACO5hD,GACV,OAAOxG,KAAKokC,SAAS59B,SAhC7B,MACE/G,M,GAsC+BqtD,KAoE3BsP,G,kIAmBD,IADDr0D,EACC,EADDA,KAEA,OAAO,kBAAMs0D,YAAcC,KAAU,SAAC91D,EAAOkjD,GAE3C,OADAA,EAASljD,EAAMi7B,GAAG3B,qBAAqB/3B,EAAKuG,UAAU4yB,mBAC/C,Q,8BAMR,IADDn5B,EACC,EADDA,KAEMw0D,EAAUF,YAAcC,KAAU,SAAC91D,EAAOkjD,GAE9C,OADAA,EAASljD,EAAMi7B,GAAG3B,qBAAqB/3B,EAAKuG,UAAU4yB,mBAC/C,KAET,MAAO,CACL,YAAaq7B,EACb,cAAeA,K,2BAjCjB,MAAO,e,6BAIP,MAAO,CACLjvB,QAAQ,EACR2f,MAAO,SACPuP,YAAY,EACZhtB,SAAU,CAAC,CACT7zB,IAAK,OAEPg8B,MAAO,iBAAM,CAAC,Y,GAbImV,KAyClB2P,G,kIAmCD,IAFD10D,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,OAAO,SAAAqH,GAAK,OAAI+yB,YAAgB9yD,EAAM04B,EAAOoH,MAAMizB,UAAWhzB,M,8BAK7D,IADD//B,EACC,EADDA,KAEA,OAAO/H,KAAKmF,QAAQu3D,OAAOhxB,QAAO,SAACorB,EAAOxf,GAAR,cAAwBwf,GAAxB,KAE7B,cAAcjsD,OAAOysC,GAASmI,YAAa13C,EAAM,CAChDuvC,cAGF,M,oCAKH,IADDvvC,EACC,EADDA,KAEA,OAAO/H,KAAKmF,QAAQu3D,OAAO3iD,KAAI,SAAAu9B,GAAK,OAAIud,YAAuB,IAAIziD,OAAO,SAASvH,OAAOysC,EAAO,WAAYvvC,GAAM,iBAAO,CACxHuvC,iB,2BArDF,MAAO,Y,qCAIP,MAAO,CACLolB,OAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,M,6BAK1B,MAAO,CACL50B,MAAO,CACLwP,MAAO,CACLjjB,QAAS,IAGb5wB,QAAS,UACTwpD,MAAO,QACPrJ,UAAU,EACViG,WAAW,EACXra,SAAUxvC,KAAKmF,QAAQu3D,OAAO3iD,KAAI,SAAAu9B,GAAK,MAAK,CAC1C37B,IAAK,IAAI9Q,OAAOysC,GAChBxP,MAAO,CACLwP,aAGJK,MAAO,SAAA5X,GAAI,MAAI,CAAC,IAAIl1B,OAAOk1B,EAAK+H,MAAMwP,OAAQ,S,GA5B9BwV,KA6DhB6P,G,kIAiBD,IADD50D,EACC,EADDA,KAEA,OAAO,kBAAM,SAACvB,EAAOkjD,GAAR,OAAqBA,EAASljD,EAAMi7B,GAAG3B,qBAAqB/3B,EAAKuG,e,oCAK7E,IADDvG,EACC,EADDA,KAEA,MAAO,CAAC60D,YAAc,2BAA4B70D,M,2BAtBlD,MAAO,oB,6BAIP,MAAO,CACLklD,MAAO,QACPzd,SAAU,CAAC,CACT7zB,IAAK,OAEPg8B,MAAO,iBAAM,CAAC,Y,GAXSmV,KAsCvB+P,GAAoB,gDACpBC,G,kIAiCD,IADD/0D,EACC,EADDA,KAEA,OAAO,SAAA+/B,GAAK,OAAI,SAACthC,EAAOkjD,GAAa,IAEjCnrB,EACE/3B,EADF+3B,UAEIpiB,EAAWoiB,EAAUsD,QAAUtD,EAAUsD,QAAQ9lB,IAAMwiB,EAAUP,IAAIjiB,IACrEgkB,EAAOh4B,EAAKuG,OAAOw5B,GAEzB4hB,EADoBljD,EAAMi7B,GAAG6N,OAAOnzB,EAAU4jB,Q,oCAO/C,IADDh4B,EACC,EADDA,KAEA,MAAO,CAAC60D,YAAcC,GAAmB90D,GAAM,SAAA8K,GAAS,QAC1BA,EAD0B,GAC7CkqD,EAD6C,KAEtD,MAAO,CACL7uD,IAHoD,KAIpD6uD,MACA3nD,MALoD,Y,2BA9CxD,MAAO,U,6BAIP,MAAO,CACLk4B,QAAQ,EACRxF,MAAO,CACL55B,IAAK,GACL6uD,IAAK,CACH1oC,QAAS,MAEXjf,MAAO,CACLif,QAAS,OAGb44B,MAAO,SACPpD,WAAW,EACXra,SAAU,CAAC,CACT7zB,IAAK,WACLwzB,SAAU,SAAAX,GAAG,MAAK,CAChBtgC,IAAKsgC,EAAIwF,aAAa,OACtB5+B,MAAOo5B,EAAIwF,aAAa,SACxB+oB,IAAKvuB,EAAIwF,aAAa,WAG1B2D,MAAO,SAAA5X,GAAI,MAAI,CAAC,MAAOA,EAAK+H,W,8BAgC9B,MAAO,CAAC,IAAIhf,IAAO,CACjBmb,MAAO,CACL2rB,gBAAiB,CACfjJ,KADe,SACVwB,EAAM3vB,GAGT,GAFiBA,EAAMwkC,cAAgBxkC,EAAMwkC,aAAaC,OAASzkC,EAAMwkC,aAAaC,MAAM97D,OAE5F,CAIA,IAAM+7D,EAAShoD,MAAMqd,KAAKiG,EAAMwkC,aAAaC,OAAOjjD,QAAO,SAAArS,GAAI,MAAI,SAASmK,KAAKnK,EAAKI,SAEtF,GAAsB,IAAlBm1D,EAAO/7D,OAAX,CAIAq3B,EAAM2kC,iBAbU,IAed18B,EACE0nB,EAAK3hD,MADPi6B,OAEI28B,EAAcjV,EAAK7B,YAAY,CACnCf,KAAM/sB,EAAM+tB,QACZ1S,IAAKrb,EAAMguB,UAEb0W,EAAOp8D,SAAQ,SAAAu8D,GACb,IAAMC,EAAS,IAAIC,WAEnBD,EAAOE,OAAS,SAAAC,GACd,IAAM19B,EAAOU,EAAOoH,MAAMw1B,MAAM/uD,OAAO,CACrCJ,IAAKuvD,EAAYp4D,OAAOxC,SAEpB4mD,EAActB,EAAK3hD,MAAMi7B,GAAG6N,OAAO8tB,EAAYrhD,IAAKgkB,GAC1DooB,EAAKuB,SAASD,IAGhB6T,EAAOI,cAAcL,kB,GA9FfvQ,KAyGd6Q,G,8HAmBD,IADD51D,EACC,EADDA,KAEA,MAAO,CACL61D,MAAOC,YAAc91D,GACrB+1D,IAAKC,YAAah2D,GAClB,YAAai2D,YAAaj2D,M,2BArB5B,MAAO,c,6BAIP,MAAO,CACLtE,QAAS,mBACTmgD,UAAU,EACViG,WAAW,EACXra,SAAU,CAAC,CACT7zB,IAAK,OAEPg8B,MAAO,iBAAM,CAAC,KAAM,S,GAbHmV,KAwFvB,SAASmR,GAAT,GAqBG,QApBDC,eAoBC,MApBS,CACRC,KAAM,IACNC,aAAa,EACbC,aAAa,GAiBd,MAfDC,kBAeC,MAfY,KAeZ,MAdDC,uBAcC,MAdiB,aAcjB,MAbDhC,eAaC,MAbS,kBAAM,GAaf,MAZDzF,aAYC,MAZO,GAYP,MAXD0H,eAWC,MAXS,kBAAM,GAWf,MAVDC,gBAUC,MAVU,kBAAM,GAUhB,MATDC,cASC,MATQ,kBAAM,GASd,MARDC,iBAQC,MARW,kBAAM,GAQjB,MAPDC,gBAOC,MAPU,SAACC,EAAaC,GACvB,OAAKA,EAIED,EAAY7kD,QAAO,SAAAgQ,GAAI,OAAIpM,KAAKC,UAAUmM,GAAMrS,cAAcuF,SAAS4hD,EAAMnnD,kBAH3EknD,GAKV,EACD,OAAO,IAAIE,SAAS,CAClB39D,IAAK,IAAI49D,YAAY,eAErB7W,KAHkB,WAGX,I,EAEG,EAFH,OACL,MAAO,CACLz7B,Q,EAAM,yBAAE,WAAOy7B,EAAMpD,GAAb,iHACA9pB,EAAO,EAAK75B,IAAIgjC,SAAS2gB,GACzBl0C,EAAO,EAAKzP,IAAIgjC,SAAS+jB,EAAK3hD,OAE9By4D,EAAQhkC,EAAK+R,QAAUn8B,EAAKm8B,QAAU/R,EAAKsiB,MAAMhrB,OAAS1hB,EAAK0sC,MAAMhrB,KACrE2sC,GAAWjkC,EAAK+R,QAAUn8B,EAAKm8B,OAC/BnyB,EAAUogB,EAAK+R,SAAWn8B,EAAKm8B,OAC/Bwf,GAAW0S,IAAYrkD,GAAWogB,EAAK6jC,QAAUjuD,EAAKiuD,MAEtDK,EAAe3S,IAAYyS,EAC3BG,EAAavkD,GAAWokD,GAFxBI,EAAcH,GAAWD,IAIVE,GAAiBC,EAZhC,sDAgBA54D,EAAQ44D,EAAankC,EAAOpqB,EAC5ByuD,EAAiB38D,SAASiqB,cAAc,wBAAyB/hB,OAAOrE,EAAM+4D,aAAc,OAG5FC,EAAcF,EAAiB,CACnCja,sBADmC,WAEjC,OAAOia,EAAeja,yBAGxBoa,YAAaH,EAAeG,YAC5BC,aAAcJ,EAAeI,cAC3B,KA3BE,KA6BJvX,EA7BI,KA8BG3hD,EAAM+2C,MA9BT,KA+BG/2C,EAAMs4D,MA/BT,KAgCEt4D,EAAM+5B,KAhCR,KAiCJ++B,EAjCI,KAkCJE,GACOL,IAAgBE,EAnCnB,yBAmCuCT,GAAS1pD,MAAM5U,QAAQw2D,GAnC9D,sBAmCuEA,EAnCvE,yCAmCqFA,IAnCrF,mDAmC8FtwD,EAAMs4D,MAnCpG,gFAmC6G,GAnC7G,yBAoCK,YAGH,IAFJvhB,EAEI,EAFJA,MACAzV,EACI,EADJA,MAEAy0B,EAAQ,CACNhf,QACAzV,QACArH,OAAQ0nB,EAAK3hD,MAAMi6B,QAHrB87B,CAIGpU,EAAK3hD,MAAO2hD,EAAKuB,SAAUvB,GAE1BmW,GACFh+B,YAAWg+B,EAAXh+B,CAAuB6nB,EAAK3hD,MAAO2hD,EAAKuB,SAAUvB,IAnBlDlkB,EA5BA,CA6BJkkB,KA7BI,KA8BJ5K,MA9BI,KA+BJuhB,MA/BI,KAgCJv+B,KAhCI,KAiCJ++B,eAjCI,KAkCJE,YAlCI,KAmCJ1I,MAnCI,MAoCJyF,QApCI,OAoDF6C,GACFV,EAAOz6B,GAGLk7B,GACFV,EAASx6B,GAGPo7B,GACFb,EAAQv6B,GA7DJ,2CAAF,E,8KAAA,iDAmEVz9B,MAAO,CAEL0yB,KAFK,WAGH,MAAO,CACL8T,QAAQ,EACRuQ,MAAO,GACPuhB,MAAO,KACPv+B,KAAM,OAKV5zB,MAZK,SAYC80B,EAAIxG,GAAM,IArKtB,EAIG,EAHDkjC,EAGC,EAFDC,EAEC,EADDC,EAoKQ9/B,EACEkD,EADFlD,UAEI1tB,EAAO,EAAH,GAAQoqB,GAGlB,GAAIsD,EAAUhM,OAASgM,EAAUiC,GAAI,EAE/BjC,EAAUhM,KAAO0I,EAAKsiB,MAAMhrB,MAAQgM,EAAUhM,KAAO0I,EAAKsiB,MAAM/c,MAClE3vB,EAAKm8B,QAAS,GAIhB,IAAM2yB,EAAYphC,EAAUR,MACtBlrB,GAhLb,GAJH,EAoLyCqrD,GAnLvCC,YAGC,MAHM,IAGN,MAFDC,mBAEC,aADDC,mBACC,SACM,SAAAsB,GAEL,GAAIA,EAAUx3B,OAAS,EACrB,OAAO,EAeT,IAXA,IASIhsB,EATEyjD,EAAc,KAAK/0D,OAAOszD,GAC1B0B,EAAS,IAAIztD,OAAO,MAAMvH,OAAO+0D,EAAa,MAC9CE,EAASzB,EAAc,IAAM,GAC7BvuC,EAASsuC,EAAc,IAAIhsD,OAAO,GAAGvH,OAAOi1D,GAAQj1D,OAAO+0D,EAAa,aAAa/0D,OAAO+0D,EAAa,OAAQ,MAAQ,IAAIxtD,OAAO,GAAGvH,OAAOi1D,EAAQ,UAAUj1D,OAAO+0D,EAAa,SAAS/0D,OAAO+0D,EAAa,MAAO,MAExNG,EAAWJ,EAAUz8B,SACrB88B,EAASL,EAAUr6B,MACnB/E,EAAOo/B,EAAUvhC,IAAIqH,YAAYs6B,EAAUC,EAAQ,KAAM,MAC3DntD,EAAQid,EAAOlxB,KAAK2hC,GAGP,OAAV1tB,GAAgB,CAGrB,IAAMotD,EAAcptD,EAAMlE,MAAM5L,MAAMnD,KAAKsvB,IAAI,EAAGrc,EAAMQ,MAAQ,GAAIR,EAAMQ,OAE1E,GAAI,YAAYvB,KAAKmuD,GAAc,CAEjC,IAAM1tC,EAAO1f,EAAMQ,MAAQssD,EAAUp6B,QACjC/E,EAAKjO,EAAO1f,EAAM,GAAG1R,OAGrBi9D,GAAeyB,EAAO/tD,KAAKyuB,EAAKx9B,MAAMy9B,EAAK,EAAGA,EAAK,MACrD3tB,EAAM,IAAM,IACZ2tB,GAAM,GAIJjO,EAAOotC,EAAU5jD,KAAOykB,GAAMm/B,EAAU5jD,MAC1CI,EAAW,CACTohC,MAAO,CACLhrB,OACAiO,MAEFs+B,MAAOjsD,EAAM,GAAG9P,MAAMo7D,EAAKh9D,QAC3Bo/B,KAAM1tB,EAAM,KAKlBA,EAAQid,EAAOlxB,KAAK2hC,GAGtB,OAAOpkB,IA6HuCwjD,GAClCJ,GAAgB3/D,KAAK6P,SAAW,GAAGtP,SAAS,IAAI22B,OAAO,EAAG,GAE5DjkB,GACFhC,EAAKm8B,QAAS,EACdn8B,EAAK0uD,aAAetkC,EAAKskC,aAAetkC,EAAKskC,aAAeA,EAC5D1uD,EAAK0sC,MAAQ1qC,EAAM0qC,MACnB1sC,EAAKiuD,MAAQjsD,EAAMisD,MACnBjuD,EAAK0vB,KAAO1tB,EAAM0tB,MAElB1vB,EAAKm8B,QAAS,OAGhBn8B,EAAKm8B,QAAS,EAWhB,OAPKn8B,EAAKm8B,SACRn8B,EAAK0uD,aAAe,KACpB1uD,EAAK0sC,MAAQ,GACb1sC,EAAKiuD,MAAQ,KACbjuD,EAAK0vB,KAAO,MAGP1vB,IAIXozB,MAAO,CAELi8B,cAFK,SAES/X,EAAM3vB,GAAO,MAIrBx4B,KAAKokC,SAAS+jB,EAAK3hD,OAFrBwmC,EAFuB,EAEvBA,OACAuQ,EAHuB,EAGvBA,MAEF,QAAKvQ,GACE2xB,EAAU,CACfxW,OACA3vB,QACA+kB,WAKJ6K,YAhBK,SAgBO+X,GAAa,MAKnBngE,KAAKokC,SAAS+7B,GAHhBnzB,EAFqB,EAErBA,OACAuQ,EAHqB,EAGrBA,MACAgiB,EAJqB,EAIrBA,aAEF,OAAKvyB,EACE2uB,IAAcrtD,OAAO6xD,EAAY/hC,IAAK,CAACs9B,IAAWpuB,OAAOiQ,EAAMhrB,KAAMgrB,EAAM/c,GAAI,CACpFiU,SAAU,OACViQ,MAAO6Z,EACP,qBAAsBgB,MAJJ,SAYNzS,I,IAoFhBsT,G,kIA6BD,IAFDr4D,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,OAAO,kBAAMi6B,YAAW3yD,EAAM04B,EAAOoH,MAAM8yB,c,8BAM1C,IAFD5yD,EAEC,EAFDA,KACA04B,EACC,EADDA,OAEA,MAAO,CACL,eAAgBi6B,YAAW3yD,EAAM04B,EAAOoH,MAAM8yB,c,oCAM/C,IADD5yD,EACC,EADDA,KAEA,MAAO,CAAC2sD,YAAkB,cAAe3sD,GAAM,SAAA8K,GAAK,MAAK,CACvDwtD,OAAQxtD,EAAM,OACZ,SAACA,EAAOktB,GAAR,OAAiBA,EAAKyG,WAAazG,EAAK+H,MAAMu4B,SAAWxtD,EAAM,S,2BA7CnE,MAAO,iB,6BAIP,MAAO,CACLi1B,MAAO,CACLu4B,MAAO,CACLhsC,QAAS,IAGb5wB,QAAS,aACTwpD,MAAO,QACPzd,SAAU,CAAC,CACT7zB,IAAK,KACLwzB,SAAU,SAAAX,GAAG,MAAK,CAChB6xB,MAAO7xB,EAAI8xB,aAAa,UAAY9xB,EAAIwF,aAAa,SAAW,MAGpE2D,MAAO,SAAA5X,GAAI,OAAyB,IAArBA,EAAK+H,MAAMu4B,MAAc,CAAC,KAAM,GAAK,CAAC,KAAM,CACzD96B,MAAOxF,EAAK+H,MAAMu4B,OACjB,S,GAtBiBvT,KAoDtByT,GAAaC,qBAAW,CAC1BC,WAAY,QACZC,YAAa,SACbC,eAAgB,CACdC,WAAY,CACVvsC,QAAS,KAETwsC,WAHU,SAGCryB,GACT,OAAOA,EAAIzgC,MAAM+yD,iBAAmB,MAGtCC,WAPU,SAOCt8D,EAAOqjC,GAChB,GAAIrjC,EAAO,CACT,IAAMsJ,EAAQ,CACZA,MAAO,GAAGlD,OAAOi9B,EAAM/5B,OAAS,GAAI,sBAAsBlD,OAAOpG,EAAO,MAE1ErE,OAAOyX,OAAOiwB,EAAO/5B,SAsNzBizD,IA9MclU,IAoEMA,IAWFA,IAWDA,IAWAA,IAuEAA,I,8HAwDlB,IADD/kD,EACC,EADDA,KAEA,MAAO,CACL,QAASk5D,YAAWl5D,M,kCAMrB,IADDA,EACC,EADDA,KAEA,OAAO,kBAAMk5D,YAAWl5D,M,oCAKvB,IADDA,EACC,EADDA,KAEA,MAAO,CAACm5D,YAAc,kCAAmCn5D,M,oCAKxD,IADDA,EACC,EADDA,KAEA,MAAO,CAACo5D,YAAc,kCAAmCp5D,M,2BAzCzD,MAAO,S,6BAIP,MAAO,CACLynC,SAAU,CAAC,CACT7zB,IAAK,UACJ,CACDA,IAAK,IACLwzB,SAAU,SAAApP,GAAI,MAA8B,WAA1BA,EAAKhyB,MAAMqzD,YAA2B,OACvD,CACDrzD,MAAO,cACPohC,SAAU,SAAA1qC,GAAK,MAAI,4BAA4BqN,KAAKrN,IAAU,QAEhEkzC,MAAO,iBAAM,CAAC,SAAU,S,GAhBX/O,MAgDby4B,G,8HAiBD,IADDt5D,EACC,EADDA,KAEA,MAAO,CACL,QAASk5D,YAAWl5D,M,kCAMrB,IADDA,EACC,EADDA,KAEA,OAAO,kBAAMk5D,YAAWl5D,M,oCAKvB,IADDA,EACC,EADDA,KAEA,MAAO,CAACm5D,YAAc,qBAAsBn5D,M,oCAK3C,IADDA,EACC,EADDA,KAEA,MAAO,CAACo5D,YAAc,qBAAsBp5D,M,2BApC5C,MAAO,S,6BAIP,MAAO,CACLu5D,SAAU,IACV9xB,SAAU,CAAC,CACT7zB,IAAK,SAEPg8B,MAAO,iBAAM,CAAC,OAAQ,S,GAXT/O,KA2Cb24B,G,8HAoBD,IADDx5D,EACC,EADDA,KAEA,MAAO,CACL,QAASk5D,YAAWl5D,M,kCAMrB,IADDA,EACC,EADDA,KAEA,OAAO,kBAAMk5D,YAAWl5D,M,oCAKvB,IADDA,EACC,EADDA,KAEA,MAAO,CAACm5D,YAAc,yBAA0Bn5D,GAAOm5D,YAAc,2BAA4Bn5D,M,oCAKhG,IADDA,EACC,EADDA,KAEA,MAAO,CAACo5D,YAAc,aAAcp5D,GAAOo5D,YAAc,eAAgBp5D,M,2BAvCzE,MAAO,W,6BAIP,MAAO,CACLynC,SAAU,CAAC,CACT7zB,IAAK,KACJ,CACDA,IAAK,MACJ,CACD5N,MAAO,sBAET4pC,MAAO,iBAAM,CAAC,KAAM,S,GAdL/O,KA8Cf44B,G,kIAuCD,IADDz5D,EACC,EADDA,KAEA,OAAO,SAAA+/B,GACL,OAAIA,EAAM3Q,KACDsqC,YAAW15D,EAAM+/B,GAGnB+Y,YAAW94C,M,oCAMnB,IADDA,EACC,EADDA,KAEA,MAAO,CAAC25D,YAAU,iGAAkG35D,GAAM,SAAAP,GAAG,MAAK,CAChI2vB,KAAM3vB,S,2BAnDR,MAAO,S,qCAIP,MAAO,CACLm6D,aAAa,EACbt8D,OAAQ,Q,6BAIC,WACX,MAAO,CACLyiC,MAAO,CACL3Q,KAAM,CACJ9C,QAAS,MAEXhvB,OAAQ,CACNgvB,QAAS,OAGb0U,WAAW,EACXyG,SAAU,CAAC,CACT7zB,IAAK,UACLwzB,SAAU,SAAAX,GAAG,MAAK,CAChBrX,KAAMqX,EAAIwF,aAAa,QACvB3uC,OAAQmpC,EAAIwF,aAAa,cAG7B2D,MAAO,SAAA5X,GAAI,MAAI,CAAC,IAAD,OAAWA,EAAK+H,OAAhB,IACb85B,IAAK,+BACLv8D,OAAQ,EAAKF,QAAQE,SACpB,O,8BAyBL,OAAKrF,KAAKmF,QAAQw8D,YAIX,CAAC,IAAI74C,IAAO,CACjBmb,MAAO,CACLmuB,YAAa,SAACjK,EAAMpsC,EAAKyc,GAAU,IAE/BiI,EACE0nB,EAAK3hD,MADPi6B,OAEIqH,EAAQupB,YAAalJ,EAAK3hD,MAAOi6B,EAAOxB,MAAMp3B,MAEhDigC,EAAM3Q,MAAQqB,EAAMnzB,kBAAkBw8D,oBACxCrpC,EAAMspC,kBACNhiE,OAAOsO,KAAK05B,EAAM3Q,KAAM2Q,EAAMziC,cAb7B,O,GA3DMujC,KAiFbm5B,G,8HAuBD,IADDh6D,EACC,EADDA,KAEA,MAAO,CACL,QAASk5D,YAAWl5D,M,kCAMrB,IADDA,EACC,EADDA,KAEA,OAAO,kBAAMk5D,YAAWl5D,M,oCAKvB,IADDA,EACC,EADDA,KAEA,MAAO,CAACm5D,YAAc,aAAcn5D,M,oCAKnC,IADDA,EACC,EADDA,KAEA,MAAO,CAACo5D,YAAc,aAAcp5D,M,2BA1CpC,MAAO,W,6BAIP,MAAO,CACLynC,SAAU,CAAC,CACT7zB,IAAK,KACJ,CACDA,IAAK,OACJ,CACDA,IAAK,UACJ,CACD5N,MAAO,kBACPohC,SAAU,SAAA1qC,GAAK,MAAc,iBAAVA,KAErBkzC,MAAO,iBAAM,CAAC,IAAK,S,GAjBJ/O,KAkFfo5B,IAjCkBp5B,I,6HAsCf,WACL5oC,KAAKiiE,iBAAmBjiE,KAAKkiE,UAAS,SAAA17D,GACpC,IAAM27D,EAAWC,YAAc57D,GAE3B27D,GACF,EAAKh9D,QAAQk9D,WAAW,CACtBpa,OAAQ,EAAKA,OACbka,SAAU,CACRn7D,QAASm7D,EAASn7D,QAClB23B,MAAOwjC,EAASxjC,MAAM5kB,KAAI,SAAAmB,GAAI,OAAIA,EAAKua,YACvC6sC,SAAUH,EAASG,cAIxBtiE,KAAKmF,QAAQ+8D,UAChBliE,KAAKioD,OAAOxyC,GAAG,eAAe,YAExB,IADJjP,EACI,EADJA,MAEA,EAAKy7D,iBAAiBz7D,Q,+BAoCjBxF,EAAIuhE,GACX,IAAI/tD,EACJ,OAAO,WAAmB,2BAANS,EAAM,yBAANA,EAAM,gBACpBT,GACFP,aAAaO,GAGfA,EAAUR,YAAW,WACnBhT,EAAE,WAAF,EAAMiU,GACNT,EAAU,OACT+tD,M,2BAnEL,MAAO,kB,qCAyBY,WACnB,MAAO,CACLv7D,QAAS,EACTs7D,SAAU1iE,KAAK2M,MAAsB,WAAhB3M,KAAK6P,UAC1ByyD,SAAU,IACVG,WAAY,aACZ31C,OAAQ,YAGF,IAFJiS,EAEI,EAFJA,MACA33B,EACI,EADJA,QACI,EAKA,EAAKihD,OAHPzhD,EAFE,EAEFA,MACA2hD,EAHE,EAGFA,KACA1nB,EAJE,EAIFA,OAGE+hC,YAAWh8D,GAASQ,GAIxBmhD,EAAKuB,SAAS+Y,YAAmBj8D,EAAOm4B,EAAM5kB,KAAI,SAAAiQ,GAAI,OAAI+xB,IAAKrY,SAASjD,EAAQzW,EAAK9O,SAAQyjB,EAAM5kB,KAAI,SAAAiQ,GAAI,OAAIA,EAAKs4C,kB,8BAMxH,MAAO,CAACI,YAAO,CACb17D,QAAShH,KAAKmF,QAAQ6B,QACtBs7D,SAAUtiE,KAAKmF,QAAQm9D,gB,GAvDDzX,MAkItB8X,IAvDc9X,I,6HA4EhB,MARe,CACb,QAAS+X,EACT,QAASrJ,EACT,cAAeA,EAEf,QAASqJ,EACT,cAAerJ,K,iCAajB,MAAO,CACLqJ,KAAM,kBAAMA,GACZrJ,KAAM,kBAAMA,GACZsJ,UAAW,kBAAMA,GACjBC,UAAW,kBAAMA,M,2BAlCnB,MAAO,Y,qCAIP,MAAO,CACL36B,MAAO,GACP6xB,cAAe,M,8BAiBjB,MAAO,CAACV,EAAQ,CACdnxB,MAAOnoC,KAAKmF,QAAQgjC,MACpB6xB,cAAeh6D,KAAKmF,QAAQ60D,qB,GA3BZnP,MA0ChBkY,G,2HAEF,MAAO,gB,qCAIP,MAAO,CACLC,iBAAkB,kBAClBC,eAAgB,WAChBC,cAAe,oBACfC,sBAAsB,EACtBC,iBAAiB,K,8BAIP,WACZ,MAAO,CAAC,IAAIt6C,IAAO,CACjBmb,MAAO,CACLmkB,YAAa,YAIP,IAHJhqB,EAGI,EAHJA,IACA2D,EAEI,EAFJA,QACAxD,EACI,EADJA,UAIMyO,EAFiBjL,EAAQ5nB,MAAK,SAAA+nB,GAAM,OAAIA,EAAO9gC,IAAIgpD,WAAW,gBACpCnmB,MAAMoiB,aACV,EAAKlhD,QAAQg+D,qBAEvCjc,EACE3oB,EADF2oB,OAEIkB,EAAc,GACdib,EAA2C,IAA3BjlC,EAAIwuB,YAAYzrD,OAEtC,QAAK6rC,IAIL5O,EAAIoH,aAAY,SAACzF,EAAMhkB,GACrB,IAAMunD,EAAYpc,GAAUnrC,GAAOmrC,GAAUnrC,EAAMgkB,EAAKmF,SAClDq+B,EAAoC,IAAtBxjC,EAAKt8B,QAAQ2Y,KAEjC,IAAKknD,IAAc,EAAKn+D,QAAQi+D,kBAAoBG,EAAa,CAC/D,IAAMnI,EAAU,CAAC,EAAKj2D,QAAQ89D,gBAE1BI,GACFjI,EAAQjmD,KAAK,EAAKhQ,QAAQ69D,kBAG5B,IAAMvH,EAAaC,IAAW37B,KAAKhkB,EAAKA,EAAMgkB,EAAKmF,SAAU,CAC3Dwf,MAAO0W,EAAQx0D,KAAK,KACpB,kBAAyD,mBAA/B,EAAKzB,QAAQ+9D,cAA+B,EAAK/9D,QAAQ+9D,cAAcnjC,GAAQ,EAAK56B,QAAQ+9D,gBAExH9a,EAAYjzC,KAAKsmD,GAGnB,OAAO,KAEFE,IAAcrtD,OAAO8vB,EAAKgqB,a,GAxDjByC,KAgELA,IAgNMA,K,qKCn4DrBhoD,EAAS,GAGf,GAAwB,oBAAbJ,WAA+C,oBAAZE,SAAyB,CACrEs7B,IAAMulC,EAAU,cAAc5kE,KAAK6D,UAAU8X,WACvCkpD,EAAY,UAAU3xD,KAAKrP,UAAU8X,WACrCmpD,EAAU,wCAAwC9kE,KAAK6D,UAAU8X,WAEvE1X,EAAO8gE,IAAM,MAAM7xD,KAAKrP,UAAUmhE,UAClC9lC,IAAI+lC,EAAKhhE,EAAOghE,MAAQJ,GAAaC,GAAWF,GAChD3gE,EAAOihE,WAAaL,EAAY9gE,SAASohE,cAAgB,EAAIL,GAAWA,EAAQ,GAAKF,GAAWA,EAAQ,GAAK,KAC7G3gE,EAAOmhE,OAASH,GAAM,gBAAgB/xD,KAAKrP,UAAU8X,WACrD1X,EAAOohE,cAAgBphE,EAAOmhE,SAAW,iBAAiBplE,KAAK6D,UAAU8X,YAAc,CAAC,EAAG,IAAI,GAC/FujB,IAAIomC,GAAUL,GAAM,gBAAgBjlE,KAAK6D,UAAU8X,WACnD1X,EAAOqhE,SAAWA,EAClBrhE,EAAOshE,eAAiBD,IAAWA,EAAO,GAC1CrhE,EAAOuhE,KAAOP,GAAM,cAAc/xD,KAAKrP,UAAU8X,YAAc,cAAczI,KAAKrP,UAAU8X,WAC5F1X,EAAOwhE,QAAU,aAAavyD,KAAKrP,UAAU8X,WAC7C1X,EAAOyhE,OAAS,wBAAyB3hE,SAAS4hE,gBAAgBx2D,MAClElL,EAAO2hE,OAAS,iBAAiB1yD,KAAKrP,UAAUgiE,QAChD5hE,EAAO6hE,eAAiB7hE,EAAOyhE,UAAY,uBAAuB1lE,KAAK6D,UAAU8X,YAAc,CAAC,EAAG,IAAI,GClBlG0jB,IAAM0mC,EAAW,SAAS5kC,GAC/B,IAAK,IAAI1sB,EAAQ,GAAIA,IAEnB,KADA0sB,EAAOA,EAAKyU,iBACD,OAAOnhC,GAITwZ,EAAa,SAASkT,GACjCjC,IAAI9zB,EAAS+1B,EAAKlT,WAClB,OAAO7iB,GAA6B,IAAnBA,EAAO4pC,SAAiB5pC,EAAOqtB,KAAOrtB,GAGrD46D,EAAc,KAKLlS,EAAY,SAAS3yB,EAAMxN,EAAMiO,GAC5C1C,IAAIyf,EAAQqnB,IAAgBA,EAAcjiE,SAASgwD,eAGnD,OAFApV,EAAMqV,OAAO7yB,EAAY,MAANS,EAAaT,EAAKuU,UAAUnzC,OAASq/B,GACxD+c,EAAMsV,SAAS9yB,EAAMxN,GAAQ,GACtBgrB,GAMIsnB,EAAuB,SAAS9kC,EAAMnqB,EAAKkvD,EAAYC,GAClE,OAAOD,IAAeE,EAAQjlC,EAAMnqB,EAAKkvD,EAAYC,GAAY,IAC3CC,EAAQjlC,EAAMnqB,EAAKkvD,EAAYC,EAAW,KAG5DE,EAAe,gCAErB,SAASD,EAAQjlC,EAAMnqB,EAAKkvD,EAAYC,EAAWzuD,GACjD,OAAS,CACP,GAAIypB,GAAQ+kC,GAAclvD,GAAOmvD,EAAW,OAAO,EACnD,GAAInvD,IAAQU,EAAM,EAAI,EAAI4uB,EAASnF,IAAQ,CACzCjC,IAAI9zB,EAAS+1B,EAAKlT,WAClB,GAAuB,GAAnB7iB,EAAO4pC,UAAiBsxB,EAAanlC,IAASklC,EAAanzD,KAAKiuB,EAAK0U,WAAqC,SAAxB1U,EAAKolC,gBACzF,OAAO,EACTvvD,EAAM+uD,EAAS5kC,IAASzpB,EAAM,EAAI,EAAI,GACtCypB,EAAO/1B,MACF,IAAqB,GAAjB+1B,EAAK6T,SAKd,OAAO,EAHP,GAA4B,UAD5B7T,EAAOA,EAAKtS,WAAW7X,GAAOU,EAAM,GAAK,EAAI,KACpC6uD,gBAA4B,OAAO,EAC5CvvD,EAAMU,EAAM,EAAI4uB,EAASnF,GAAQ,IAOhC,SAASmF,EAASnF,GACvB,OAAwB,GAAjBA,EAAK6T,SAAgB7T,EAAKuU,UAAUnzC,OAAS4+B,EAAKtS,WAAWtsB,OActE,SAAS+jE,EAAa12B,GAEpB,IADA1Q,IAAIuD,EACKwK,EAAM2C,EAAK3C,KAA+BxK,EAAOwK,EAAIu5B,YAArCv5B,EAAMA,EAAIhf,YACnC,OAAOwU,GAAQA,EAAKtB,MAAQsB,EAAKtB,KAAKgG,UAAY1E,EAAKmN,KAAOA,GAAOnN,EAAKsU,YAAcnH,GAKnFvQ,IAAMonC,EAAqB,SAASC,GACzCxnC,IAAIynC,EAAYD,EAAOE,YAGvB,OAFID,GAAalwD,EAAQ6uD,QAAUoB,EAAOG,aAAeH,EAAOI,WAAW,GAAGH,YAC5EA,GAAY,GACPA,GAGF,SAASI,EAASC,EAASxkE,GAChC08B,IAAItF,EAAQ71B,SAASkjE,YAAY,SAIjC,OAHArtC,EAAMstC,UAAU,WAAW,GAAM,GACjCttC,EAAMotC,QAAUA,EAChBptC,EAAMp3B,IAAMo3B,EAAMpW,KAAOhhB,EAClBo3B,ECvFT,SAASutC,EAAW3nC,GAClB,MAAO,CAACmnB,KAAM,EAAGC,MAAOpnB,EAAImmC,gBAAgB9E,YACpC5rB,IAAK,EAAGyR,OAAQlnB,EAAImmC,gBAAgB7E,cAG9C,SAASsG,EAAQvhE,EAAOwuD,GACtB,MAAuB,iBAATxuD,EAAoBA,EAAQA,EAAMwuD,GAGlD,SAASgT,EAAWlmC,GAClBjC,IAAIonB,EAAOnlB,EAAKslB,wBAEhB,MAAO,CAACE,KAAML,EAAKK,KAAMC,MAAON,EAAKK,KAAOxlB,EAAK0/B,YACzC5rB,IAAKqR,EAAKrR,IAAKyR,OAAQJ,EAAKrR,IAAM9T,EAAK2/B,cAG1C,SAASwG,EAAmB/d,EAAMjD,EAAMihB,GAG7C,IAFAroC,IAAIsoC,EAAkBje,EAAKke,SAAS,oBAAsB,EAAGC,EAAene,EAAKke,SAAS,iBAAmB,EACzGjoC,EAAM+pB,EAAK3Z,IAAI+G,cACVvrC,EAASm8D,GAAYhe,EAAK3Z,IAC5BxkC,EADkCA,EAAS6iB,EAAW7iB,GAE3D,GAAuB,GAAnBA,EAAO4pC,SAAX,CACA9V,IAAIyoC,EAAQv8D,GAAUo0B,EAAI0nB,MAA2B,GAAnB97C,EAAO4pC,SACrC4yB,EAAWD,EAAQR,EAAW3nC,GAAO6nC,EAAWj8D,GAChDy8D,EAAQ,EAAGC,EAAQ,EASvB,GARIxhB,EAAKrR,IAAM2yB,EAAS3yB,IAAMmyB,EAAQI,EAAiB,OACrDM,IAAUF,EAAS3yB,IAAMqR,EAAKrR,IAAMmyB,EAAQM,EAAc,QACnDphB,EAAKI,OAASkhB,EAASlhB,OAAS0gB,EAAQI,EAAiB,YAChEM,EAAQxhB,EAAKI,OAASkhB,EAASlhB,OAAS0gB,EAAQM,EAAc,WAC5DphB,EAAKK,KAAOihB,EAASjhB,KAAOygB,EAAQI,EAAiB,QACvDK,IAAUD,EAASjhB,KAAOL,EAAKK,KAAOygB,EAAQM,EAAc,SACrDphB,EAAKM,MAAQghB,EAAShhB,MAAQwgB,EAAQI,EAAiB,WAC9DK,EAAQvhB,EAAKM,MAAQghB,EAAShhB,MAAQwgB,EAAQM,EAAc,UAC1DG,GAASC,EACX,GAAIH,EACFnoC,EAAIuoC,YAAYC,SAASH,EAAOC,OAC3B,CACL5oC,IAAI+oC,EAAS78D,EAAO88D,WAAYC,EAAS/8D,EAAOg9D,UAC5CN,IAAO18D,EAAOg9D,WAAaN,GAC3BD,IAAOz8D,EAAO88D,YAAcL,GAChC3oC,IAAImpC,EAAKj9D,EAAO88D,WAAaD,EAAQK,EAAKl9D,EAAOg9D,UAAYD,EAC7D7hB,EAAO,CAACK,KAAML,EAAKK,KAAO0hB,EAAIpzB,IAAKqR,EAAKrR,IAAMqzB,EAAI1hB,MAAON,EAAKM,MAAQyhB,EAAI3hB,OAAQJ,EAAKI,OAAS4hB,GAGpG,GAAIX,EAAO,OAyBf,SAASY,EAAY34B,GAEnB,IADA1Q,IAAI/H,EAAQ,GAAIqI,EAAMoQ,EAAI+G,cACnB/G,IACLzY,EAAM5gB,KAAK,KAACq5B,EAAKqF,IAAKrF,EAAIw4B,UAAWzhB,KAAM/W,EAAIs4B,aAC3Ct4B,GAAOpQ,GAFDoQ,EAAM3hB,EAAW2hB,IAI7B,OAAOzY,EAUT,SAASqxC,EAAmBrxC,EAAOsxC,GACjC,IAAKvpC,IAAI78B,EAAI,EAAGA,EAAI80B,EAAM50B,OAAQF,IAAK,CACrC,IAAJ,EAA2B80B,EAAM90B,GAAxButC,EAAA,EAAAA,IAAKqF,EAAA,EAAAA,IAAK0R,EAAA,EAAAA,KACX/W,EAAIw4B,WAAanzB,EAAMwzB,IAAM74B,EAAIw4B,UAAYnzB,EAAMwzB,GACnD74B,EAAIs4B,YAAcvhB,IAAM/W,EAAIs4B,WAAavhB,IAIjDznB,IAAIwpC,EAAyB,KAoB7B,SAASC,EAAiBxnC,EAAM0lB,GAG9B,IAFA3nB,IAAIisB,EAA0Byd,EAAjBC,EAAY,IAAoB1/B,EAAS,EAClD2/B,EAASjiB,EAAO5R,IAAK8zB,EAASliB,EAAO5R,IAChCxO,EAAQtF,EAAKlS,WAAY+5C,EAAa,EAAGviC,EAAOA,EAAQA,EAAMyP,YAAa8yB,IAAc,CAChG9pC,IAAIi1B,OAAA,EACJ,GAAsB,GAAlB1tB,EAAMuO,SAAemf,EAAQ1tB,EAAM2tB,qBAClC,IAAsB,GAAlB3tB,EAAMuO,SACV,SADyBmf,EAAQL,EAAUrtB,GAAO2tB,iBAGvD,IAAKl1B,IAAI78B,EAAI,EAAGA,EAAI8xD,EAAM5xD,OAAQF,IAAK,CACrC68B,IAAIonB,EAAO6N,EAAM9xD,GACjB,GAAIikD,EAAKrR,KAAO6zB,GAAUxiB,EAAKI,QAAUqiB,EAAQ,CAC/CD,EAAS9nE,KAAKsvB,IAAIg2B,EAAKI,OAAQoiB,GAC/BC,EAAS/nE,KAAKiJ,IAAIq8C,EAAKrR,IAAK8zB,GAC5B7pC,IAAI+pC,EAAK3iB,EAAKK,KAAOE,EAAOF,KAAOL,EAAKK,KAAOE,EAAOF,KAChDL,EAAKM,MAAQC,EAAOF,KAAOE,EAAOF,KAAOL,EAAKM,MAAQ,EAC5D,GAAIqiB,EAAKJ,EAAW,CAClB1d,EAAU1kB,EACVoiC,EAAYI,EACZL,EAAgBK,GAA0B,GAApB9d,EAAQnW,SAAgB,CAAC2R,KAAML,EAAKM,MAAQC,EAAOF,KAAOL,EAAKM,MAAQN,EAAKK,KAAM1R,IAAK4R,EAAO5R,KAAO4R,EACrG,GAAlBpgB,EAAMuO,UAAiBi0B,IACzB9/B,EAAS6/B,GAAcniB,EAAOF,OAASL,EAAKK,KAAOL,EAAKM,OAAS,EAAI,EAAI,IAC3E,WAGCuE,IAAYtE,EAAOF,MAAQL,EAAKM,OAASC,EAAO5R,KAAOqR,EAAKrR,KAChD4R,EAAOF,MAAQL,EAAKK,MAAQE,EAAO5R,KAAOqR,EAAKI,UAC9Dvd,EAAS6/B,EAAa,IAG5B,OAAI7d,GAA+B,GAApBA,EAAQnW,SAKzB,SAA0B7T,EAAM0lB,GAG9B,IAFA3nB,IAAIrpB,EAAMsrB,EAAKuU,UAAUnzC,OACrBo8C,EAAQ56C,SAASgwD,cACZ1xD,EAAI,EAAGA,EAAIwT,EAAKxT,IAAK,CAC5Bs8C,EAAMqV,OAAO7yB,EAAM9+B,EAAI,GACvBs8C,EAAMsV,SAAS9yB,EAAM9+B,GACrB68B,IAAIonB,EAAO4N,EAAWvV,EAAO,GAC7B,GAAI2H,EAAKrR,KAAOqR,EAAKI,QACjBwiB,EAAOriB,EAAQP,GACjB,MAAO,MAACnlB,EAAMgI,OAAQ9mC,GAAKwkD,EAAOF,OAASL,EAAKK,KAAOL,EAAKM,OAAS,EAAI,EAAI,IAEjF,MAAO,MAACzlB,EAAMgI,OAAQ,GAhBuBggC,CAAiBhe,EAASyd,IAClEzd,GAAY0d,GAAiC,GAApB1d,EAAQnW,SAAuB,MAAC7T,EAAI,OAAEgI,GAC7Dw/B,EAAiBxd,EAASyd,GAiBnC,SAASM,EAAOriB,EAAQP,GACtB,OAAOO,EAAOF,MAAQL,EAAKK,KAAO,GAAKE,EAAOF,MAAQL,EAAKM,MAAQ,GACjEC,EAAO5R,KAAOqR,EAAKrR,IAAM,GAAK4R,EAAO5R,KAAOqR,EAAKI,OAAS,EA6DvD,SAASgB,EAAY6B,EAAM1C,G,QACV1lB,EAAMgI,EAAxBigC,EAAO7f,EAAK6f,KAChB,GAAIA,EAAKC,uBACP,IACEnqC,IAAI/hB,EAAMisD,EAAKC,uBAAuBxiB,EAAOF,KAAME,EAAO5R,KACtD93B,IAAmBgkB,GAAd,EAA8BhkB,GAAhB,WAAMgsB,EAAA,EAAAA,QAC7B,MAAO9G,IAEX,IAAKlB,GAAQioC,EAAKE,oBAAqB,CACrCpqC,IAAIyf,EAAQyqB,EAAKE,oBAAoBziB,EAAOF,KAAME,EAAO5R,KACrD0J,IAAyBxd,GAAlB,EAA+Cwd,GAA7B,eAAmBxV,EAAA,eAGlDjK,IAA8D/hB,EAA1Dy6C,EAAMwR,EAAKG,iBAAiB1iB,EAAOF,KAAME,EAAO5R,IAAM,GAC1D,IAAK2iB,IAAQrO,EAAK3Z,IAAIkI,SAAyB,GAAhB8f,EAAI5iB,SAAgB4iB,EAAI3pC,WAAa2pC,GAAM,CACxE14B,IAAI41B,EAAMvL,EAAK3Z,IAAI6W,wBACnB,IAAKyiB,EAAOriB,EAAQiO,GAAM,OAAO,KAEjC,KADA8C,EApCJ,SAAS2R,EAAiBvjB,EAASa,EAAQiO,GACzC51B,IAAIrpB,EAAMmwC,EAAQn3B,WAAWtsB,OAC7B,GAAIsT,GAAOi/C,EAAI7f,IAAM6f,EAAIpO,OACvB,IAAKxnB,IAAIsqC,EAASxoE,KAAKsvB,IAAI,EAAGtvB,KAAKiJ,IAAI4L,EAAM,EAAG7U,KAAK2M,MAAMkI,GAAOgxC,EAAO5R,IAAM6f,EAAI7f,MAAQ6f,EAAIpO,OAASoO,EAAI7f,MAAQ,IAAK5yC,EAAImnE,IAAU,CACrItqC,IAAIuH,EAAQuf,EAAQn3B,WAAWxsB,GAC/B,GAAsB,GAAlBokC,EAAMuO,SAER,IADA9V,IAAIi1B,EAAQ1tB,EAAM2tB,iBACT1mC,EAAI,EAAGA,EAAIymC,EAAM5xD,OAAQmrB,IAAK,CACrCwR,IAAIonB,EAAO6N,EAAMzmC,GACjB,GAAIw7C,EAAOriB,EAAQP,GAAO,OAAOijB,EAAiB9iC,EAAOogB,EAAQP,GAGrE,IAAKjkD,GAAKA,EAAI,GAAKwT,IAAQ2zD,EAAQ,MAGvC,OAAOxjB,EAqBCujB,CAAiBhgB,EAAK3Z,IAAKiX,EAAQiO,IAC/B,OAAO,KAKnB,GAFIr+C,EAAQmvD,QAAUhO,EAAI3M,YAAW9pB,EAAOgI,EAAS,MACrDyuB,EAhFF,SAAsBhoB,EAAKiX,GACzB3nB,IAAI9zB,EAASwkC,EAAI3hB,WACjB,OAAI7iB,GAAU,QAAQ8H,KAAK9H,EAAOyqC,WAAagR,EAAOF,KAAO/W,EAAI6W,wBAAwBE,KAChFv7C,EACFwkC,EA4ED65B,CAAa7R,EAAK/Q,GACpB1lB,EAAM,CACR,GAAI1qB,EAAQ2uD,OAA0B,GAAjBjkC,EAAK6T,WAGxB7L,EAASnoC,KAAKiJ,IAAIk/B,EAAQhI,EAAKtS,WAAWtsB,SAG7B4+B,EAAKtS,WAAWtsB,OAAQ,CACnC28B,IAAoC41B,EAAhC7iD,EAAOkvB,EAAKtS,WAAWsa,GACN,OAAjBl3B,EAAK4jC,WAAsBif,EAAM7iD,EAAKw0C,yBAAyBG,OAASC,EAAOF,MAC/EmO,EAAIpO,OAASG,EAAO5R,KACtB9L,IAKFhI,GAAQooB,EAAK3Z,KAAOzG,GAAUhI,EAAKtS,WAAWtsB,OAAS,GAAgC,GAA3B4+B,EAAKiG,UAAU4N,UAC3E6R,EAAO5R,IAAM9T,EAAKiG,UAAUqf,wBAAwBC,OACtDvpC,EAAMosC,EAAK3hD,MAAM43B,IAAI36B,QAAQ2Y,KAIZ,GAAV2rB,GAAgC,GAAjBhI,EAAK6T,UAAyD,MAAxC7T,EAAKtS,WAAWsa,EAAS,GAAG0M,WACxE14B,EAxFN,SAAsBosC,EAAMpoB,EAAMgI,EAAQ0d,GAQxC,IADA3nB,IAAIwqC,GAAW,EACNz8B,EAAM9L,EACT8L,GAAOsc,EAAK3Z,KADK,CAErB1Q,IAAIuD,EAAO8mB,EAAKuJ,QAAQ6W,YAAY18B,GAAK,GACzC,IAAKxK,EAAM,OAAO,KAClB,GAAIA,EAAKtB,KAAKgG,SAAW1E,EAAKr3B,OAAQ,CACpC8zB,IAAIonB,EAAO7jB,EAAKmN,IAAI6W,wBACpB,GAAIH,EAAKK,KAAOE,EAAOF,MAAQL,EAAKrR,IAAM4R,EAAO5R,IAAKy0B,EAAUjnC,EAAKmnC,cAChE,MAAItjB,EAAKM,MAAQC,EAAOF,MAAQL,EAAKI,OAASG,EAAO5R,KACrD,MAD0Dy0B,EAAUjnC,EAAKonC,UAGhF58B,EAAMxK,EAAKmN,IAAI3hB,WAEjB,OAAOy7C,GAAW,EAAIA,EAAUngB,EAAKuJ,QAAQgX,WAAW3oC,EAAMgI,GAoEpD4gC,CAAaxgB,EAAMpoB,EAAMgI,EAAQ0d,IAEhC,MAAP1pC,IAAaA,EAnGnB,SAAwBosC,EAAMqO,EAAK/Q,GACjC,IAAF,EAAuB8hB,EAAiB/Q,EAAK/Q,GAAtC1lB,EAAA,EAAAA,KAAMgI,EAAA,EAAAA,OAAyCiX,GAAQ,EAC5D,GAAqB,GAAjBjf,EAAK6T,WAAkB7T,EAAKlS,WAAY,CAC1CiQ,IAAIonB,EAAOnlB,EAAKslB,wBAChBrG,EAAOkG,EAAKK,MAAQL,EAAKM,OAASC,EAAOF,MAAQL,EAAKK,KAAOL,EAAKM,OAAS,EAAI,GAAK,EAEtF,OAAO2C,EAAKuJ,QAAQgX,WAAW3oC,EAAMgI,EAAQiX,GA6FtB4pB,CAAezgB,EAAMqO,EAAK/Q,IAEjD3nB,IAAIuD,EAAO8mB,EAAKuJ,QAAQ6W,YAAY/R,GAAK,GACzC,MAAO,KAACz6C,EAAK+hC,OAAQzc,EAAOA,EAAKwnC,WAAaxnC,EAAKynC,QAAU,GAG/D,SAAShW,EAAWluD,EAAQo6C,GAC1BlhB,IAAIi1B,EAAQnuD,EAAOouD,iBACnB,OAAQD,EAAM5xD,OAA0C4xD,EAAM/T,EAAO,EAAI,EAAI+T,EAAM5xD,OAAS,GAArEyD,EAAOygD,wBAGhCpnB,IAAM8qC,EAAO,4CAKN,SAASrjB,EAAYyC,EAAMpsC,EAAKk3C,GACrC,IAAF,EAAuB9K,EAAKuJ,QAAQwB,WAAWn3C,GAAxCgkB,EAAA,EAAAA,KAAMgI,EAAA,EAAAA,OACPqW,EAAO+J,EAAK3hD,MAAM43B,IAAI3e,QAAQ1D,GAAMuxB,EAAS8Q,EAAKp0C,OAAOu/B,cAIzDy/B,EAAoB3zD,EAAQivD,QAAUjvD,EAAQ2uD,MAClD,GAAqB,GAAjBjkC,EAAK6T,UAAiBo1B,GAAqBD,EAAKj3D,KAAKiuB,EAAKuU,WAAY,CACxExW,IAAIonB,EAAO4N,EAAWJ,EAAU3yB,EAAMgI,EAAQA,GAASkrB,GAIvD,GAAI59C,EAAQ2uD,OAASj8B,GAAU,KAAKj2B,KAAKiuB,EAAKuU,UAAUvM,EAAS,KAAOA,EAAShI,EAAKuU,UAAUnzC,OAAQ,CACtG28B,IAAImrC,EAAanW,EAAWJ,EAAU3yB,EAAMgI,EAAS,EAAGA,EAAS,IAAK,GACtE,GAAIkhC,EAAWp1B,KAAOqR,EAAKrR,IAAK,CAC9B/V,IAAIorC,EAAYpW,EAAWJ,EAAU3yB,EAAMgI,EAAQA,EAAS,IAAK,GACjE,GAAImhC,EAAUr1B,KAAOqR,EAAKrR,IACxB,OAAOs1B,EAASD,EAAWA,EAAU3jB,KAAO0jB,EAAW1jB,OAG7D,OAAOL,EAIT,GAAI5X,EAAQ,CAEV,IADAxP,IAAI9zB,EAASo0C,EAAKjW,MAAQggB,EAAKuJ,QAAQ0X,YAAYhrB,EAAKlb,UAAYilB,EAAK3Z,IAClEykB,EAAO,IAAMlrB,GAAUhI,GAAQ/1B,GACpC+9B,EAAS48B,EAAS5kC,GAClBA,EAAOA,EAAKlT,WAEd,KAAOomC,GAAQ,GAAKlrB,GAAU7C,EAASnF,IAASA,GAAQ/1B,GACtD+9B,EAAS48B,EAAS5kC,GAAQ,EAC1BA,EAAOA,EAAKlT,WAIhB,GAAqB,GAAjBkT,EAAK6T,SACP,OAAIqf,EAAO,EAAUkW,EAASrW,EAAWJ,EAAU3yB,EAAMgI,EAAS,EAAGA,GAAS,IAAI,GAC3EohC,EAASrW,EAAWJ,EAAU3yB,EAAMgI,EAAQA,EAAS,IAAK,IAAI,GAIvE,IAAKuF,EAAQ,CACX,GAAIvF,IAAWkrB,EAAO,GAAKlrB,GAAU7C,EAASnF,IAAQ,CACpDjC,IAAIoF,EAASnD,EAAKtS,WAAWsa,EAAS,GACtC,GAAuB,GAAnB7E,EAAO0Q,SAAe,OAAOy1B,EAASnmC,EAAOmiB,yBAAyB,GAE5E,GAAItd,EAAS7C,EAASnF,GAAO,CAC3BjC,IAAIyK,EAAQxI,EAAKtS,WAAWsa,GAC5B,GAAsB,GAAlBQ,EAAMqL,SAAe,OAAOy1B,EAAS9gC,EAAM8c,yBAAyB,GAE1E,OAAOgkB,EAAStpC,EAAKslB,wBAAyB4N,GAAQ,GAIxD,GAAIlrB,IAAWkrB,EAAO,GAAKlrB,GAAU7C,EAASnF,IAAQ,CACpDjC,IAAIoF,EAASnD,EAAKtS,WAAWsa,EAAS,GAClC1iC,EAA4B,GAAnB69B,EAAO0Q,SAAgB8e,EAAUxvB,EAAQgC,EAAShC,IAAW8lC,EAAoB,EAAI,IAEzE,GAAnB9lC,EAAO0Q,UAAoC,MAAnB1Q,EAAOuR,SAAmBvR,EAAS,KACjE,GAAI79B,EAAQ,OAAO8jE,EAASrW,EAAWztD,EAAQ,IAAI,GAErD,GAAI0iC,EAAS7C,EAASnF,GAAO,CAC3BjC,IAAIyK,EAAQxI,EAAKtS,WAAWsa,GACxB1iC,EAA2B,GAAlBkjC,EAAMqL,SAAgB8e,EAAUnqB,EAAO,EAAIygC,EAAoB,EAAI,GACxD,GAAlBzgC,EAAMqL,SAAgBrL,EAAQ,KACpC,GAAIljC,EAAQ,OAAO8jE,EAASrW,EAAWztD,GAAS,IAAI,GAGtD,OAAO8jE,EAASrW,EAA4B,GAAjB/yB,EAAK6T,SAAgB8e,EAAU3yB,GAAQA,GAAOkzB,GAAOA,GAAQ,GAG1F,SAASkW,EAASjkB,EAAMK,GACtB,GAAkB,GAAdL,EAAKV,MAAY,OAAOU,EAC5BpnB,IAAIq1B,EAAI5N,EAAOL,EAAKK,KAAOL,EAAKM,MAChC,MAAO,CAAC3R,IAAKqR,EAAKrR,IAAKyR,OAAQJ,EAAKI,OAAQC,KAAM4N,EAAG3N,MAAO2N,GAG9D,SAASkW,EAASnkB,EAAMrR,GACtB,GAAmB,GAAfqR,EAAKgB,OAAa,OAAOhB,EAC7BpnB,IAAIwrC,EAAIz1B,EAAMqR,EAAKrR,IAAMqR,EAAKI,OAC9B,MAAO,CAACzR,IAAKy1B,EAAGhkB,OAAQgkB,EAAG/jB,KAAML,EAAKK,KAAMC,MAAON,EAAKM,OAG1D,SAAS+jB,EAAiBphB,EAAM3hD,EAAOnC,GACrCy5B,IAAI0rC,EAAYrhB,EAAK3hD,MAAOwmC,EAASmb,EAAK6f,KAAKyB,cAC3CD,GAAahjE,GAAO2hD,EAAKsE,YAAYjmD,GACrCwmC,GAAUmb,EAAK3Z,KAAK2Z,EAAK8D,QAC7B,IACE,OAAO5nD,IADT,QAGMmlE,GAAahjE,GAAO2hD,EAAKsE,YAAY+c,GACrCx8B,GAAUmb,EAAK3Z,KAAOxB,GAAQA,EAAOif,SAkC7ChuB,IAAMyrC,EAAW,kBAgCjB5rC,IAAI6rC,EAAc,KAAMC,EAAY,KAAMC,GAAe,EAClD,SAASC,EAAe3hB,EAAM3hD,EAAO8P,GAC1C,OAAIqzD,GAAenjE,GAASojE,GAAatzD,EAAYuzD,GACrDF,EAAcnjE,EAAOojE,EAAYtzD,EAC1BuzD,EAAsB,MAAPvzD,GAAsB,QAAPA,EA/DvC,SAAgC6xC,EAAM3hD,EAAO8P,GAC3CwnB,IAAIisC,EAAMvjE,EAAM+3B,UACZ6f,EAAc,MAAP9nC,EAAcyzD,EAAIC,QAAQnhE,IAAIkhE,EAAIxqC,OAASwqC,EAAIC,QAAQ96C,IAAI66C,EAAIxqC,OAC1E,OAAOgqC,EAAiBphB,EAAM3hD,GAAK,WAEjC,IADA,IAAWgoC,EAAO2Z,EAAKuJ,QAAQwB,WAAW9U,EAAKriC,KAApC,OACF,CACP+hB,IAAImsC,EAAU9hB,EAAKuJ,QAAQ6W,YAAY/5B,GAAK,GAC5C,IAAKy7B,EAAS,MACd,GAAIA,EAAQlqC,KAAKgG,QAAS,CAAEyI,EAAMy7B,EAAQz7B,IAAK,MAC/CA,EAAMy7B,EAAQz7B,IAAI3hB,WAGpB,IADAiR,IAAI2nB,EAASC,EAAYyC,EAAM/J,EAAKriC,IAAK,GAChCspB,EAAQmJ,EAAI3gB,WAAYwX,EAAOA,EAAQA,EAAMyP,YAAa,CACjEhX,IAAIosC,OAAA,EACJ,GAAsB,GAAlB7kC,EAAMuO,SAAes2B,EAAQ7kC,EAAM2tB,qBAClC,IAAsB,GAAlB3tB,EAAMuO,SACV,SADyBs2B,EAAQxX,EAAUrtB,EAAO,EAAGA,EAAMiP,UAAUnzC,QAAQ6xD,iBAElF,IAAKl1B,IAAI78B,EAAI,EAAGA,EAAIipE,EAAM/oE,OAAQF,IAAK,CACrC68B,IAAI41B,EAAMwW,EAAMjpE,GAChB,GAAIyyD,EAAIpO,OAASoO,EAAI7f,MAAe,MAAPv9B,EAAco9C,EAAIpO,OAASG,EAAO5R,IAAM,EAAI6f,EAAI7f,IAAM4R,EAAOH,OAAS,GACjG,OAAO,GAGb,OAAO,KAyCL6kB,CAAuBhiB,EAAM3hD,EAAO8P,GAnC1C,SAAkC6xC,EAAM3hD,EAAO8P,GAC7C,IAAKipB,EAAS/4B,EAAM+3B,UAAfgB,MACL,IAAKA,EAAMv1B,OAAOmtC,YAAa,OAAO,EACtCrZ,IAAIiK,EAASxI,EAAM2I,aAAcxG,GAAWqG,EAAQqiC,EAAQriC,GAAUxI,EAAMv1B,OAAOvG,QAAQ2Y,KACvF2tD,EAAMM,eAGV,OAAKX,EAAS53D,KAAKytB,EAAMv1B,OAAO4iD,cAAiBmd,EAAIO,OAG9Cf,EAAiBphB,EAAM3hD,GAAK,WAMjCs3B,IAAIysC,EAAWR,EAAIrE,WAAW,GAAI8E,EAAUT,EAAIU,UAAWC,EAASX,EAAIY,YACpEC,EAAeb,EAAIc,eACvBd,EAAIO,OAAO,OAAQh0D,EAAK,aACxBwnB,IACIj7B,IADY08B,EAAM4I,MAAQggB,EAAKuJ,QAAQ0X,YAAY7pC,EAAM2D,UAAYilB,EAAK3Z,KACtDkI,SAAmC,GAA1BqzB,EAAIU,UAAU72B,SAAgBm2B,EAAIU,UAAYV,EAAIU,UAAU59C,aACxF29C,GAAWT,EAAIU,WAAaC,GAAUX,EAAIY,YAK/C,OAHAZ,EAAIe,kBACJf,EAAIgB,SAASR,GACO,MAAhBK,IAAsBb,EAAIc,eAAiBD,GACxC/nE,KAlBO,QAAPyT,GAAwB,YAAPA,EAAoBorB,EAAU0oC,EA4BpDY,CAAyB7iB,EAAM3hD,EAAO8P,IC/W5C2nB,IAIMgtC,EAEJ,SAAYjhE,EAAQsxD,EAAU9sB,EAAKmH,GACjC31C,KAAKgK,OAASA,EACdhK,KAAKs7D,SAAWA,EAChBt7D,KAAKwuC,IAAMA,EAGXA,EAAI42B,WAAaplE,KAGjBA,KAAK21C,WAAaA,EAClB31C,KAAKkrE,MAhBS,G,8NAiBf,I,YAIDC,cAAA,WAAkB,OAAO,G,YACzBC,YAAA,WAAgB,OAAO,G,YACvBC,YAAA,WAAgB,OAAO,G,YACvBC,YAAA,WAAgB,OAAO,GAEvB,EAAIC,eAAA,eAAmB,OAAO,G,YAM9BC,UAAA,WAAc,OAAO,M,YAKrB5hB,UAAA,WAAc,OAAO,GAGrB,EAAIxtC,KAAA,eAEF,IADA0hB,IAAI1hB,EAAO,EACFnb,EAAI,EAAGA,EAAIjB,KAAKs7D,SAASn6D,OAAQF,IAAKmb,GAAQpc,KAAKs7D,SAASr6D,GAAGmb,KACxE,OAAOA,GAKT,EAAI0sD,OAAA,eAAW,OAAO,G,YAEtBjkB,QAAA,WACE7kD,KAAKgK,OAAS,KACVhK,KAAKwuC,IAAI42B,YAAcplE,OAAMA,KAAKwuC,IAAI42B,WAAa,MACvD,IAAKtnC,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKs7D,SAASn6D,OAAQF,IACxCjB,KAAKs7D,SAASr6D,GAAG4jD,W,YAGrB4mB,eAAA,SAAepmC,GACb,IAAKvH,IAAI78B,EAAI,EAAG8a,EAAM/b,KAAK6oE,WAAY5nE,EAAIjB,KAAKs7D,SAASn6D,OAAQF,IAAK,CACpE68B,IAAI+N,EAAM7rC,KAAKs7D,SAASr6D,GACxB,GAAI4qC,GAAOxG,EAAO,OAAOtpB,EACzBA,GAAO8vB,EAAIzvB,OAIf,EAAIosD,UAAA,eACF,OAAOxoE,KAAKgK,OAAOyhE,eAAezrE,OAGpC,EAAI6oE,WAAA,eACF,OAAO7oE,KAAKgK,OAAShK,KAAKgK,OAAOyhE,eAAezrE,MAAQA,KAAK8oE,OAAS,GAGxE,EAAIL,SAAA,eACF,OAAOzoE,KAAKwoE,UAAYxoE,KAAKoc,MAG/B,EAAIsvD,SAAA,eACF,OAAO1rE,KAAK6oE,WAAa7oE,KAAKoc,KAAO,EAAIpc,KAAK8oE,Q,YAIhD6C,gBAAA,SAAgBn9B,EAAKzG,EAAQiX,GAG3B,GAAIh/C,KAAK21C,YAAc31C,KAAK21C,WAAWe,SAAyB,GAAhBlI,EAAIoF,SAAgBpF,EAAMA,EAAI3hB,YAAa,CACzF,GAAImyB,EAAO,EAAG,CACZlhB,IAAI8tC,EAAWvqC,EACf,GAAImN,GAAOxuC,KAAK21C,WACdi2B,EAAYp9B,EAAI/gB,WAAWsa,EAAS,OAC/B,CACL,KAAOyG,EAAI3hB,YAAc7sB,KAAK21C,YAAYnH,EAAMA,EAAI3hB,WACpD++C,EAAYp9B,EAAIgG,gBAElB,KAAOo3B,MAAgBvqC,EAAOuqC,EAAUxG,aAAe/jC,EAAKr3B,QAAUhK,OAAO4rE,EAAYA,EAAUp3B,gBACnG,OAAOo3B,EAAY5rE,KAAKyrE,eAAepqC,GAAQA,EAAKjlB,KAAOpc,KAAK6oE,WAEhE/qC,IAAI+tC,EAAUxqC,EACd,GAAImN,GAAOxuC,KAAK21C,WACdk2B,EAAWr9B,EAAI/gB,WAAWsa,OACrB,CACL,KAAOyG,EAAI3hB,YAAc7sB,KAAK21C,YAAYnH,EAAMA,EAAI3hB,WACpDg/C,EAAWr9B,EAAIsG,YAEjB,KAAO+2B,MAAexqC,EAAOwqC,EAASzG,aAAe/jC,EAAKr3B,QAAUhK,OAAO6rE,EAAWA,EAAS/2B,YAC/F,OAAO+2B,EAAW7rE,KAAKyrE,eAAepqC,GAAQrhC,KAAK0rE,SAMvD5tC,IAAIssC,EACJ,GAAIpqE,KAAK21C,YAAc31C,KAAK21C,YAAc31C,KAAKwuC,KAAOxuC,KAAKwuC,IAAIkI,SAAS12C,KAAK21C,YAC3Ey0B,EAAuD,EAA/C57B,EAAImI,wBAAwB32C,KAAK21C,iBACpC,GAAI31C,KAAKwuC,IAAI3gB,WAAY,CAC9B,GAAc,GAAVka,EAAa,IAAKjK,IAAIxG,EAASkX,GAAMlX,EAASA,EAAOzK,WAAY,CACnE,GAAIyK,GAAUt3B,KAAKwuC,IAAK,CAAE47B,GAAQ,EAAO,MACzC,GAAI9yC,EAAOzK,WAAWgB,YAAcyJ,EAAQ,MAE9C,GAAa,MAAT8yC,GAAiBriC,GAAUyG,EAAI/gB,WAAWtsB,OAAQ,IAAK28B,IAAIxG,EAASkX,GAAMlX,EAASA,EAAOzK,WAAY,CACxG,GAAIyK,GAAUt3B,KAAKwuC,IAAK,CAAE47B,GAAQ,EAAM,MACxC,GAAI9yC,EAAOzK,WAAWmZ,WAAa1O,EAAQ,OAG/C,OAAiB,MAAT8yC,EAAgBprB,EAAO,EAAIorB,GAASpqE,KAAK0rE,SAAW1rE,KAAK6oE,Y,YAKnEN,YAAA,SAAY/5B,EAAKs9B,GACf,IAAKhuC,IAAI9hB,GAAQ,EAAM6vB,EAAM2C,EAAK3C,EAAKA,EAAMA,EAAIhf,WAAY,CAC3DiR,IAAIuD,EAAOrhC,KAAK+rE,QAAQlgC,GACxB,GAAIxK,KAAUyqC,GAAazqC,EAAKtB,MAAO,CAErC,IAAI/jB,IAASqlB,EAAK+jB,UACa,GAAzB/jB,EAAK+jB,QAAQxR,SAAgBvS,EAAK+jB,QAAQ1O,SAAyB,GAAhBlI,EAAIoF,SAAgBpF,EAAMA,EAAI3hB,YAAcwU,EAAK+jB,SAAW5W,GAGnH,OAAOnN,EAFPrlB,GAAQ,K,YAOhB+vD,QAAA,SAAQv9B,GAEN,IADA1Q,IAAIuD,EAAOmN,EAAI42B,WACNv5B,EAAMxK,EAAMwK,EAAKA,EAAMA,EAAI7hC,OAAQ,GAAI6hC,GAAO7rC,KAAM,OAAOqhC,G,YAGtEqnC,WAAA,SAAWl6B,EAAKzG,EAAQiX,GACtB,IAAKlhB,IAAIuP,EAAOmB,EAAKnB,EAAMA,EAAOA,EAAKxgB,WAAY,CACjDiR,IAAIuD,EAAOrhC,KAAK+rE,QAAQ1+B,GACxB,GAAIhM,EAAM,OAAOA,EAAKsqC,gBAAgBn9B,EAAKzG,EAAQiX,GAErD,OAAQ,G,YAMVgtB,OAAA,SAAOjwD,GACL,IAAK+hB,IAAI78B,EAAI,EAAG8mC,EAAS,EAAG9mC,EAAIjB,KAAKs7D,SAASn6D,OAAQF,IAAK,CACzD68B,IAAIuH,EAAQrlC,KAAKs7D,SAASr6D,GAAIqkC,EAAMyC,EAAS1C,EAAMjpB,KACnD,GAAI2rB,GAAUhsB,GAAOupB,GAAOyC,EAAQ,CAClC,MAAQ1C,EAAMyjC,QAAUzjC,EAAMi2B,SAASn6D,QAAQkkC,EAAQA,EAAMi2B,SAAS,GACtE,OAAOj2B,EAET,GAAItpB,EAAMupB,EAAK,OAAOD,EAAM2mC,OAAOjwD,EAAMgsB,EAAS1C,EAAMyjC,QACxD/gC,EAASzC,I,YAKb4tB,WAAA,SAAWn3C,GACT,IAAK/b,KAAK21C,WAAY,MAAO,CAAC5V,KAAM//B,KAAKwuC,IAAKzG,OAAQ,GACtD,IAAKjK,IAAIiK,EAAS,EAAG9mC,EAAI,GAAIA,IAAK,CAChC,GAAI8mC,GAAUhsB,EAAK,CACjB,KAAO9a,EAAIjB,KAAKs7D,SAASn6D,SAAWnB,KAAKs7D,SAASr6D,GAAGsqE,gBAAkBvrE,KAAKs7D,SAASr6D,GAAGutC,IAAI3hB,YAAc7sB,KAAK21C,aAAa10C,IAC5H,MAAO,CAAC8+B,KAAM//B,KAAK21C,WACX5N,OAAQ9mC,GAAKjB,KAAKs7D,SAASn6D,OAASnB,KAAK21C,WAAWloB,WAAWtsB,OAASwjE,EAAS3kE,KAAKs7D,SAASr6D,GAAGutC,MAE5G,GAAIvtC,GAAKjB,KAAKs7D,SAASn6D,OAAQ,MAAM,IAAIyS,MAAM,oBAAsBmI,GACrE+hB,IAAIuH,EAAQrlC,KAAKs7D,SAASr6D,GAAIqkC,EAAMyC,EAAS1C,EAAMjpB,KACnD,GAAIL,EAAMupB,EAAK,OAAOD,EAAM6tB,WAAWn3C,EAAMgsB,EAAS1C,EAAMyjC,QAC5D/gC,EAASzC,I,YAMb2mC,WAAA,SAAW15C,EAAMiO,EAAI6d,GACnB,Q,UAD0B,GACE,GAAxBr+C,KAAKs7D,SAASn6D,OAChB,MAAO,CAAC4+B,KAAM//B,KAAK21C,WAAU,KAAEpjB,EAAI,GAAEiO,EAAI0rC,WAAY,EAAGC,SAAUnsE,KAAK21C,WAAWloB,WAAWtsB,QAG/F,IADA28B,IAAIouC,GAAc,EAAGC,GAAY,EACxBpkC,EAASsW,EAAMp9C,EAAI,GAAIA,IAAK,CACnC68B,IAAIuH,EAAQrlC,KAAKs7D,SAASr6D,GAAIqkC,EAAMyC,EAAS1C,EAAMjpB,KACnD,IAAmB,GAAf8vD,GAAoB35C,GAAQ+S,EAAK,CACnCxH,IAAIsuC,EAAYrkC,EAAS1C,EAAMyjC,OAE/B,GAAIv2C,GAAQ65C,GAAa5rC,GAAM8E,EAAMD,EAAMyjC,QAAUzjC,EAAMtF,MACvDsF,EAAMsQ,YAAc31C,KAAK21C,WAAWe,SAASrR,EAAMsQ,YACrD,OAAOtQ,EAAM4mC,WAAW15C,EAAMiO,EAAI4rC,GAEpC75C,EAAOwV,EACP,IAAKjK,IAAIxR,EAAIrrB,EAAGqrB,EAAI,EAAGA,IAAK,CAC1BwR,IAAI7C,EAAOj7B,KAAKs7D,SAAShvC,EAAI,GAC7B,GAAI2O,EAAK7e,MAAQ6e,EAAKuT,IAAI3hB,YAAc7sB,KAAK21C,aAAe1a,EAAKoxC,aAAa,GAAI,CAChFH,EAAavH,EAAS1pC,EAAKuT,KAAO,EAClC,MAEFjc,GAAQ0I,EAAK7e,MAEI,GAAf8vD,IAAkBA,EAAa,GAErC,GAAIA,GAAc,IAAM5mC,EAAM9E,GAAMv/B,GAAKjB,KAAKs7D,SAASn6D,OAAS,GAAI,CAClEq/B,EAAK8E,EACL,IAAKxH,IAAIxR,EAAIrrB,EAAI,EAAGqrB,EAAItsB,KAAKs7D,SAASn6D,OAAQmrB,IAAK,CACjDwR,IAAIjtB,EAAO7Q,KAAKs7D,SAAShvC,GACzB,GAAIzb,EAAKuL,MAAQvL,EAAK29B,IAAI3hB,YAAc7sB,KAAK21C,aAAe9kC,EAAKw7D,cAAc,GAAI,CACjFF,EAAWxH,EAAS9zD,EAAK29B,KACzB,MAEFhO,GAAM3vB,EAAKuL,MAEI,GAAb+vD,IAAgBA,EAAWnsE,KAAK21C,WAAWloB,WAAWtsB,QAC1D,MAEF4mC,EAASzC,EAEX,MAAO,CAACvF,KAAM//B,KAAK21C,WAAU,KAAEpjB,EAAI,GAAEiO,EAAE,WAAE0rC,EAAU,SAAEC,I,YAGvDE,aAAA,SAAapZ,GACX,GAAIjzD,KAAK8oE,SAAW9oE,KAAK21C,aAAe31C,KAAKs7D,SAASn6D,OAAQ,OAAO,EACrE28B,IAAIuH,EAAQrlC,KAAKs7D,SAASrI,EAAO,EAAI,EAAIjzD,KAAKs7D,SAASn6D,OAAS,GAChE,OAAqB,GAAdkkC,EAAMjpB,MAAaipB,EAAMgnC,aAAapZ,I,YAI/CmW,YAAA,SAAYrtD,GACZ,IAAF,EAAyB/b,KAAKkzD,WAAWn3C,GAAhCgkB,EAAA,EAAAA,KAAMgI,EAAA,EAAAA,OACX,GAAqB,GAAjBhI,EAAK6T,UAAiB7L,GAAUhI,EAAKtS,WAAWtsB,OAClD,MAAM,IAAI29B,WAAW,qBAAuB/iB,GAC9C,OAAOgkB,EAAKtS,WAAWsa,I,YASzBlJ,aAAA,SAAaqoB,EAAQ17B,EAAMw8C,EAAMsE,GAG/B,IADAxuC,IAAIvL,EAAO3yB,KAAKiJ,IAAIq+C,EAAQ17B,GAAOgV,EAAK5gC,KAAKsvB,IAAIg4B,EAAQ17B,GAChDvqB,EAAI,EAAG8mC,EAAS,EAAG9mC,EAAIjB,KAAKs7D,SAASn6D,OAAQF,IAAK,CACzD68B,IAAIuH,EAAQrlC,KAAKs7D,SAASr6D,GAAIqkC,EAAMyC,EAAS1C,EAAMjpB,KACnD,GAAImW,EAAOwV,GAAUvH,EAAK8E,EACxB,OAAOD,EAAMxG,aAAaqoB,EAASnf,EAAS1C,EAAMyjC,OAAQt9C,EAAOuc,EAAS1C,EAAMyjC,OAAQd,EAAMsE,GAChGvkC,EAASzC,EAGXxH,IAAIyuC,EAAYvsE,KAAKkzD,WAAWhM,GAASslB,EAAUxsE,KAAKkzD,WAAW1nC,GAC/D85C,EAAS0C,EAAKqC,eAEdoC,GAAW,EAKf,IAAKp3D,EAAQ2uD,OAAS3uD,EAAQmvD,SAAWtd,GAAU17B,EAAM,CACvDsS,IAAI7C,EAAOsxC,EAAUxsC,KAAKtS,WAAW8+C,EAAUxkC,OAAS,GACxD0kC,EAAWxxC,IAA0B,MAAjBA,EAAKwZ,UAA4C,SAAxBxZ,EAAKkqC,iBAGpD,GAAMmH,GAASG,GAAYp3D,EAAQmvD,SAC/BK,EAAqB0H,EAAUxsC,KAAMwsC,EAAUxkC,OAAQu9B,EAAOoH,WAAYpH,EAAOqH,gBACjF9H,EAAqB2H,EAAQzsC,KAAMysC,EAAQzkC,OAAQu9B,EAAOmF,UAAWnF,EAAOqF,aAFhF,CAQA7sC,IAAI8uC,GAAiB,EACrB,IAAKtH,EAAOriE,QAAUikD,GAAU17B,KAAUihD,EAAU,CAClDnH,EAAOuH,SAASN,EAAUxsC,KAAMwsC,EAAUxkC,QAC1C,IACMmf,GAAU17B,GAAM85C,EAAOriE,OAAOupE,EAAQzsC,KAAMysC,EAAQzkC,QACxD6kC,GAAiB,EACjB,MAAOjiC,GAKP,KAAMA,aAAemiC,cAAe,MAAMniC,GAI9C,IAAKiiC,EAAgB,CACnB,GAAI1lB,EAAS17B,EAAM,CAAEsS,IAAIgL,EAAMyjC,EAAWA,EAAYC,EAASA,EAAU1jC,EACzEhL,IAAIyf,EAAQ56C,SAASgwD,cACrBpV,EAAMqV,OAAO4Z,EAAQzsC,KAAMysC,EAAQzkC,QACnCwV,EAAMsV,SAAS0Z,EAAUxsC,KAAMwsC,EAAUxkC,QACzCu9B,EAAOwF,kBACPxF,EAAOyF,SAASxtB,M,YAKpBwvB,eAAA,SAAepjB,GACb,OAAQ3pD,KAAK21C,YAA+B,aAAjBgU,EAAS5hD,MAGtC,EAAIilE,YAAA,eACF,OAAOhtE,KAAK21C,YAAc31C,KAAK21C,YAAc31C,KAAKwuC,MAAQxuC,KAAKwuC,IAAIkI,SAAS12C,KAAK21C,a,YAKnFs3B,UAAA,SAAU16C,EAAMiO,GACd,IAAK1C,IAAIiK,EAAS,EAAG9mC,EAAI,EAAGA,EAAIjB,KAAKs7D,SAASn6D,OAAQF,IAAK,CACzD68B,IAAIuH,EAAQrlC,KAAKs7D,SAASr6D,GAAIqkC,EAAMyC,EAAS1C,EAAMjpB,KACnD,GAAI2rB,GAAUzC,EAAM/S,GAAQ+S,GAAO9E,GAAMuH,EAASxV,EAAO+S,GAAO9E,EAAKuH,EAAQ,CAC3EjK,IAAIovC,EAAcnlC,EAAS1C,EAAMyjC,OAAQqE,EAAY7nC,EAAMD,EAAMyjC,OACjE,GAAIv2C,GAAQ26C,GAAe1sC,GAAM2sC,EAK/B,OAJAntE,KAAKkrE,MAAQ34C,GAAQwV,GAAUvH,GAAM8E,EArUO,EAAnB,OAsUrB/S,GAAQ26C,GAAe1sC,GAAM2sC,IAC5B9nC,EAAM2nC,aAAe3nC,EAAMmJ,IAAI3hB,YAAc7sB,KAAK21C,WAClDtQ,EAAM4nC,UAAU16C,EAAO26C,EAAa1sC,EAAK0sC,GADsB7nC,EAAM6lC,MAvUd,GA2U5D7lC,EAAM6lC,MA3UsD,EA8UhEnjC,EAASzC,EAEXtlC,KAAKkrE,MAhV6C,G,YAmVpDkC,iBAAA,WAEE,IADAtvC,IAAIwZ,EAAQ,EACHvX,EAAO//B,KAAKgK,OAAQ+1B,EAAMA,EAAOA,EAAK/1B,OAAQstC,IAAS,CAC9DxZ,IAAIotC,EAAiB,GAAT5zB,EAtVoC,EAAnB,EAuVzBvX,EAAKmrC,MAAQA,IAAOnrC,EAAKmrC,MAAQA,K,oCAG1C,GAIDjtC,IAAMovC,EAAU,GAIVC,EAAc,YAElB,WAAYtjE,EAAQujE,EAAQplB,EAAMpsC,GAChC+hB,IAAI/9B,EAAMyuC,EAAM++B,EAAOxlE,KAAK4vC,MAK5B,GAJkB,mBAAPnJ,IAAmBA,EAAMA,EAAI2Z,GAAI,WAC1C,OAAKpoD,EACDA,EAAKiK,OAAejK,EAAKiK,OAAOyhE,eAAe1rE,QAAnD,EADkBgc,OAGfwxD,EAAOxlE,KAAKo6B,KAAKxc,IAAK,CACzB,GAAoB,GAAhB6oB,EAAIoF,SAAe,CACrB9V,IAAIwU,EAAO3vC,SAASuW,cAAc,QAClCo5B,EAAKrkC,YAAYugC,GACjBA,EAAM8D,EAER9D,EAAI22B,iBAAkB,EACtB32B,EAAIg/B,UAAUrjE,IAAI,sBAEpB+zB,OAAK,KAACl0B,EAAQqjE,EAAS7+B,EAAK,MAC5BxuC,KAAKutE,OAASA,EACdxtE,EAAOC,K,4HACR,I,OAED,EAAIurE,eAAA,eACF,OAAOvrE,KAAKutE,OAAOxlE,KAAKkrD,KAAO,GAGjC,EAAF,UAAEkY,cAAA,SAAcoC,GACZ,OA7Xc,GA6XPvtE,KAAKkrE,OAAsBqC,EAAOxlE,KAAKo7B,GAAGnjC,KAAKutE,OAAOxlE,OAG/D,EAAF,UAAEyjE,UAAA,WAAc,MAAO,CAAChpC,QAAQ,IAE9B,EAAF,UAAEonB,UAAA,SAAUpxB,GACRsF,IAAIxiB,EAAOtb,KAAKutE,OAAOprC,KAAKynB,UAC5B,QAAOtuC,GAAOA,EAAKkd,IAGrB,EAAF,UAAEu0C,eAAA,SAAepjB,GACb,MAAwB,aAAjBA,EAAS5hD,MAAuB/H,KAAKutE,OAAOprC,KAAKsrC,iB,yCAtCxC,CAASxC,GA0CvByC,EAAmB,YACvB,WAAY1jE,EAAQwkC,EAAKm/B,EAASptC,GAChCrC,OAAK,KAACl0B,EAAQqjE,EAAS7+B,EAAK,MAC5BxuC,KAAK2tE,QAAUA,EACf3tE,KAAKugC,KAAOA,E,kHACb,I,OAED,EAAInkB,KAAA,eAAS,OAAOpc,KAAKugC,KAAKp/B,QAE9B,EAAF,UAAEwqE,gBAAA,SAAgBn9B,EAAKzG,GACnB,OAAIyG,GAAOxuC,KAAK2tE,QAAgB3tE,KAAK6oE,YAAc9gC,EAAS/nC,KAAKoc,KAAO,GACjEpc,KAAK6oE,WAAa9gC,GAG3B,EAAF,UAAEmrB,WAAA,SAAWn3C,GACT,MAAO,CAACgkB,KAAM//B,KAAK2tE,QAAS5lC,OAAQhsB,IAGtC,EAAF,UAAEgxD,eAAA,SAAea,GACb,MAAoB,kBAAbA,EAAI7lE,MAA4B6lE,EAAIvoE,OAAOivC,WAAas5B,EAAIC,U,yCAnB9C,CAAS5C,GA4B5B6C,EAAY,YAEhB,WAAY9jE,EAAQq1B,EAAMmP,EAAKmH,GAC7BzX,OAAK,KAACl0B,EAAQ,GAAIwkC,EAAKmH,GACvB31C,KAAKq/B,KAAOA,E,4FACb,EAED,EAAO/wB,OAAA,SAAOtE,EAAQq1B,EAAMiO,EAAQ6a,GAClCrqB,IAAIiwC,EAAS5lB,EAAKqI,UAAUnxB,EAAKt3B,KAAKtI,MAClC0iC,EAAO4rC,GAAUA,EAAO1uC,EAAM8oB,EAAM7a,GAGxC,OAFKnL,GAASA,EAAKqM,MACjBrM,EAAO,gBAAckW,WAAW11C,SAAU08B,EAAKt3B,KAAKo6B,KAAKwV,MAAMtY,EAAMiO,KAChE,IAAIwgC,EAAa9jE,EAAQq1B,EAAM8C,EAAKqM,IAAKrM,EAAKwT,YAAcxT,EAAKqM,MAG1E,EAAF,UAAEg9B,UAAA,WAAc,MAAO,CAACnsC,KAAMr/B,KAAKq/B,KAAKt3B,KAAKtI,KAAMqoC,MAAO9nC,KAAKq/B,KAAKyI,MAAO8N,eAAgB51C,KAAK21C,aAE9F,EAAF,UAAEy1B,YAAA,SAAY/rC,GAAQ,OAzbgD,GAybzCr/B,KAAKkrE,OAAuBlrE,KAAKq/B,KAAK8D,GAAG9D,IAEpE,EAAF,UAAE4tC,UAAA,SAAU16C,EAAMiO,GAGd,GAFAtC,YAAM+uC,UAAA,KAAS,KAAC16C,EAAMiO,GA5bR,GA8bVxgC,KAAKkrE,MAAoB,CAE3B,IADAptC,IAAI9zB,EAAShK,KAAKgK,QACVA,EAAO+1B,MAAM/1B,EAASA,EAAOA,OACjCA,EAAOkhE,MAAQlrE,KAAKkrE,QAAOlhE,EAAOkhE,MAAQlrE,KAAKkrE,OACnDlrE,KAAKkrE,MAlcO,IAschB,EAAF,UAAEnoE,MAAA,SAAMwvB,EAAMiO,EAAI2nB,GACdrqB,IAAIyI,EAAOunC,EAAax/D,OAAOtO,KAAKgK,OAAQhK,KAAKq/B,MAAM,EAAM8oB,GACzDtgB,EAAQ7nC,KAAKs7D,SAAUl/C,EAAOpc,KAAKoc,KACnCokB,EAAKpkB,IAAMyrB,EAAQmmC,GAAanmC,EAAOrH,EAAIpkB,EAAM+rC,IACjD51B,EAAO,IAAGsV,EAAQmmC,GAAanmC,EAAO,EAAGtV,EAAM41B,IACnD,IAAKrqB,IAAI78B,EAAI,EAAGA,EAAI4mC,EAAM1mC,OAAQF,IAAK4mC,EAAM5mC,GAAG+I,OAASu8B,EAEzD,OADAA,EAAK+0B,SAAWzzB,EACTtB,G,EArCO,CAAS0kC,GA4CrBgD,EAAY,YAEhB,WAAYjkE,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAKmH,EAAYyP,EAAS+C,EAAMpsC,GAC9EmiB,OAAK,KAACl0B,EAAQ+1B,EAAK+F,OAASunC,EAAU,GAAI7+B,EAAKmH,GAC/C31C,KAAKolD,QAAUA,EACfplD,KAAK+/B,KAAOA,EACZ//B,KAAKkuE,UAAYA,EACjBluE,KAAKmuE,UAAYA,EACbx4B,GAAY31C,KAAKouE,eAAejmB,EAAMpsC,G,2IAC3C,I,OAWD,EAAOzN,OAAA,SAAOtE,EAAQ+1B,EAAMmuC,EAAWC,EAAWhmB,EAAMpsC,G,MACTsyD,EAAzCN,EAAS5lB,EAAKqI,UAAUzwB,EAAKh4B,KAAKtI,MAClC0iC,EAAO4rC,GAAUA,EAAOhuC,EAAMooB,GAAI,WAGpC,OAAKkmB,EACDA,EAAQrkE,OAAeqkE,EAAQrkE,OAAOyhE,eAAe4C,QAAzD,EADqBtyD,IAEpBmyD,GAEC1/B,EAAMrM,GAAQA,EAAKqM,IAAKmH,EAAaxT,GAAQA,EAAKwT,WACtD,GAAI5V,EAAK8F,OACP,GAAK2I,GACA,GAAoB,GAAhBA,EAAIoF,SAAe,MAAM,IAAI9U,WAAW,iDADvC0P,EAAM7rC,SAAS6qB,eAAeuS,EAAKQ,WAEnCiO,IACPA,GAAF,EAAqB,gBAAc6J,WAAW11C,SAAUo9B,EAAKh4B,KAAKo6B,KAAKwV,MAAM5X,KAA3EyO,IAAKmH,EAAA,EAAAA,YAELA,GAAe5V,EAAK8F,QAA0B,MAAhB2I,EAAIiG,WAChCjG,EAAI8xB,aAAa,qBAAoB9xB,EAAI22B,iBAAkB,GAC5DplC,EAAKh4B,KAAKo6B,KAAK0nB,YAAWrb,EAAIqb,WAAY,IAGhD/rB,IAAIsnB,EAAU5W,EAGd,OAFAA,EAAM8/B,GAAe9/B,EAAK0/B,EAAWnuC,GAEjCoC,EACKksC,EAAU,IAAIE,GAAmBvkE,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAKmH,EAAYyP,EACrDjjB,EAAMgmB,EAAMpsC,EAAM,GACnDgkB,EAAK8F,OACL,IAAI2oC,EAAaxkE,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAK4W,EAAS+C,GAEnE,IAAI8lB,EAAajkE,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAKmH,EAAYyP,EAAS+C,EAAMpsC,EAAM,IAGtG,EAAF,UAAEyvD,UAAA,W,WAEE,GAAIxrE,KAAK+/B,KAAKh4B,KAAKo6B,KAAKssC,cAAe,OAAO,KAK9C3wC,IAAIwQ,EAAO,CAACvO,KAAM//B,KAAK+/B,KAAKh4B,KAAKtI,KAAMqoC,MAAO9nC,KAAK+/B,KAAK+H,OAIxD,OAHI9nC,KAAK+/B,KAAKh4B,KAAKo6B,KAAK/f,OAAMksB,EAAKyD,mBAAqB,QACpD/xC,KAAK21C,aAAe31C,KAAKgtE,YAAa1+B,EAAKsH,eAAiB51C,KAAK21C,WAChErH,EAAKoH,WAAU,kBAAS11C,EAAK21C,WAAa,WAAS1V,MAAQjgC,EAAK+/B,KAAKt8B,SACnE6qC,GAGT,EAAF,UAAE+8B,YAAA,SAAYtrC,EAAMmuC,EAAWC,GAC3B,OAxhBc,GAwhBPnuE,KAAKkrE,OAAsBnrC,EAAKoD,GAAGnjC,KAAK+/B,OAC7C2uC,GAAcR,EAAWluE,KAAKkuE,YAAcC,EAAUhrC,GAAGnjC,KAAKmuE,YAGlE,EAAI/xD,KAAA,eAAS,OAAOpc,KAAK+/B,KAAKmF,UAE9B,EAAI4jC,OAAA,eAAW,OAAO9oE,KAAK+/B,KAAK+F,OAAS,EAAI,GAM7C,EAAF,UAAEsoC,eAAA,SAAejmB,EAAMpsC,G,WACfuxB,EAASttC,KAAK+/B,KAAKwJ,cAAe3zB,EAAMmG,EACxC4yD,EAAcrhC,GAAU6a,EAAKsL,WAAazzD,KAAK4uE,qBAAqBzmB,EAAMpsC,GAC1E8yD,EAAU,IAAIC,GAAgB9uE,KAAM2uE,GAAeA,EAAY5uC,OAyiBvE,SAAkB/1B,EAAQ+kE,EAAMC,EAAUC,GACxCnxC,IAAI+3B,EAASkZ,EAAKlZ,OAAO7rD,GAAS+9B,EAAS,EAE3C,GAAqB,GAAjB8tB,EAAO10D,OAAa,CACtB,IAAK28B,IAAI78B,EAAI,EAAGA,EAAI+I,EAAOw8B,WAAYvlC,IAAK,CAC1C68B,IAAIuH,EAAQr7B,EAAOq7B,MAAMpkC,GACzBguE,EAAO5pC,EAAOwwB,EAAQkZ,EAAKG,SAASnnC,EAAQ1C,GAAQpkC,GACpD8mC,GAAU1C,EAAMH,SAElB,OAIF,IADApH,IAAIqxC,EAAY,EAAGniC,EAAS,GAAIoiC,EAAW,KAClCC,EAAc,IAAK,CAC1B,GAAIF,EAAYtZ,EAAO10D,QAAU00D,EAAOsZ,GAAW3uC,IAAMuH,EAAQ,CAE/D,IADAjK,IAAIyvC,EAAS1X,EAAOsZ,KAAcG,OAAA,EAC3BH,EAAYtZ,EAAO10D,QAAU00D,EAAOsZ,GAAW3uC,IAAMuH,IACzDunC,IAAYA,EAAU,CAAC/B,KAAUp4D,KAAK0gD,EAAOsZ,MAChD,GAAIG,EAAS,CACXA,EAAQlkC,KAAKmkC,IACb,IAAKzxC,IAAI78B,EAAI,EAAGA,EAAIquE,EAAQnuE,OAAQF,IAAK+tE,EAASM,EAAQruE,GAAIouE,IAAeD,QAE7EJ,EAASzB,EAAQ8B,IAAeD,GAIpCtxC,IAAIuH,SAAOhyB,OAAA,EACX,GAAI+7D,EACF/7D,GAAS,EACTgyB,EAAQ+pC,EACRA,EAAW,SACN,MAAIC,EAAcrlE,EAAOw8B,YAI9B,MAHAnzB,EAAQg8D,EACRhqC,EAAQr7B,EAAOq7B,MAAMgqC,KAKvB,IAAKvxC,IAAI78B,EAAI,EAAGA,EAAI+rC,EAAO7rC,OAAQF,IAAS+rC,EAAO/rC,GAAGu/B,IAAMuH,GAAQiF,EAAOhJ,OAAO/iC,IAAK,GACvF,KAAOkuE,EAAYtZ,EAAO10D,QAAU00D,EAAOsZ,GAAW58C,MAAQwV,GAAU8tB,EAAOsZ,GAAW3uC,GAAKuH,GAC7FiF,EAAO73B,KAAK0gD,EAAOsZ,MAErBrxC,IAAIwH,EAAMyC,EAAS1C,EAAMH,SACzB,GAAIG,EAAMQ,OAAQ,CAChB/H,IAAI0xC,EAAQlqC,EACR6pC,EAAYtZ,EAAO10D,QAAU00D,EAAOsZ,GAAW58C,KAAOi9C,IAAOA,EAAQ3Z,EAAOsZ,GAAW58C,MAC3F,IAAKuL,IAAI78B,EAAI,EAAGA,EAAI+rC,EAAO7rC,OAAQF,IAAS+rC,EAAO/rC,GAAGu/B,GAAKgvC,IAAOA,EAAQxiC,EAAO/rC,GAAGu/B,IAChFgvC,EAAQlqC,IACV8pC,EAAW/pC,EAAMc,IAAIqpC,EAAQznC,GAC7B1C,EAAQA,EAAMc,IAAI,EAAGqpC,EAAQznC,GAC7BzC,EAAMkqC,EACNn8D,GAAS,GAIbyqB,IAAIowC,EAAalhC,EAAO7rC,OAClBkkC,EAAM6D,WAAa7D,EAAMS,OAASkH,EAAOhzB,QAAM,SAACsvB,GAAA,OAAMA,EAAEgE,UACxDN,EAAOjqC,QAFoBsqE,EAGjC4B,EAAO5pC,EAAO6oC,EAAWa,EAAKG,SAASnnC,EAAQ1C,GAAQhyB,GACvD00B,EAASzC,GAnmBTmqC,CAASzvE,KAAK+/B,KAAM//B,KAAKmuE,WAAS,SAAGZ,EAAQtsE,EAAGyuE,GAC1CnC,EAAOprC,KAAKlD,MACd4vC,EAAQc,YAAYpC,EAAOprC,KAAKlD,MAAOqO,EAAQ6a,GACxColB,EAAOxlE,KAAKkrD,MAAQ,IAAMyc,GACjCb,EAAQc,YAAY1uE,GAAKjB,EAAK+/B,KAAKyG,WAAa,OAAKrG,KAAOngC,EAAK+/B,KAAKsF,MAAMpkC,GAAGg+B,MAAOqO,EAAQ6a,GAGhG0mB,EAAQe,YAAYrC,EAAQplB,EAAMvyC,MACnC,SAAGyvB,EAAO6oC,EAAWC,EAAWltE,GAE/B4tE,EAAQc,YAAYtqC,EAAMpG,MAAOqO,EAAQ6a,GAGzC0mB,EAAQgB,cAAcxqC,EAAO6oC,EAAWC,EAAWltE,IAEjD4tE,EAAQiB,eAAezqC,EAAO6oC,EAAWC,EAAWhmB,EAAMlnD,IAE1D4tE,EAAQkB,QAAQ1qC,EAAO6oC,EAAWC,EAAWhmB,EAAMvyC,GACrDA,GAAOyvB,EAAMH,YAGf2pC,EAAQc,YAAYtC,EAAS//B,EAAQ6a,GACjCnoD,KAAK+/B,KAAKoX,aAAa03B,EAAQmB,oBACnCnB,EAAQoB,eAGJpB,EAAQriB,SAlkBsC,GAkkB3BxsD,KAAKkrE,SAEtByD,GAAa3uE,KAAKkwE,wBAAwB/nB,EAAMwmB,GAiN1D,SAASwB,EAAYC,EAAWC,EAAOloB,GAErC,IADArqB,IAAI0Q,EAAM4hC,EAAUviD,WAAYyiD,GAAU,EACjCrvE,EAAI,EAAGA,EAAIovE,EAAMlvE,OAAQF,IAAK,CACrC68B,IAAIuD,EAAOgvC,EAAMpvE,GAAIsvE,EAAWlvC,EAAKmN,IACrC,GAAI+hC,EAAS1jD,YAAcujD,EAAW,CACpC,KAAOG,GAAY/hC,GAAOA,EAAMgiC,GAAGhiC,GAAM8hC,GAAU,EACnD9hC,EAAMA,EAAIsG,iBAEVw7B,GAAU,EACVF,EAAU1iD,aAAa6iD,EAAU/hC,GAEnC,GAAInN,aAAgBysC,EAAc,CAChChwC,IAAI/hB,EAAMyyB,EAAMA,EAAIgG,gBAAkB47B,EAAUpqC,UAChDmqC,EAAY9uC,EAAKsU,WAAYtU,EAAKi6B,SAAUnT,GAC5C3Z,EAAMzyB,EAAMA,EAAI+4B,YAAcs7B,EAAUviD,YAG5C,KAAO2gB,GAAOA,EAAMgiC,GAAGhiC,GAAM8hC,GAAU,EACnCA,GAAWnoB,EAAKsoB,aAAeL,IAAWjoB,EAAKsoB,YAAc,MAlO7DN,CAAYnwE,KAAK21C,WAAY31C,KAAKs7D,SAAUnT,GACxC9yC,EAAQ+uD,KA2kBlB,SAAkB51B,GAChB,GAAoB,MAAhBA,EAAIiG,UAAoC,MAAhBjG,EAAIiG,SAAkB,CAChD3W,IAAI4yC,EAASliC,EAAIzgC,MAAMuf,QACvBkhB,EAAIzgC,MAAMuf,QAAUojD,EAAS,kCAC7B5wE,OAAOimD,iBAAiBvX,GAAKmiC,UAC7BniC,EAAIzgC,MAAMuf,QAAUojD,GAhlBDE,CAAS5wE,KAAKwuC,OAInC,EAAF,UAAEogC,qBAAA,SAAqBzmB,EAAMpsC,GAIzB,IAAJ,EAAqBosC,EAAK3hD,MAAM+3B,UAAvBhM,EAAA,EAAAA,KAAMiO,EAAA,EAAAA,GACX,OAAM2nB,EAAK3hD,MAAM+3B,qBAAqB,kBAAkBhM,EAAOxW,GAAOykB,EAAKzkB,EAAM/b,KAAK+/B,KAAKt8B,QAAQ2Y,MAAnG,CACA0hB,IAAIisC,EAAM5hB,EAAK6f,KAAKqC,eAChBzzB,EAykBR,SAAwB7W,EAAMgI,GAC5B,OAAS,CACP,GAAqB,GAAjBhI,EAAK6T,SAAe,OAAO7T,EAC/B,GAAqB,GAAjBA,EAAK6T,UAAiB7L,EAAS,EAAG,CACpC,GAAIhI,EAAKtS,WAAWtsB,OAAS4mC,GAA8C,GAApChI,EAAKtS,WAAWsa,GAAQ6L,SAC7D,OAAO7T,EAAKtS,WAAWsa,GACzBhI,EAAOA,EAAKtS,WAAWsa,EAAS,GAChCA,EAAS7C,EAASnF,OACb,MAAqB,GAAjBA,EAAK6T,UAAiB7L,EAAShI,EAAKtS,WAAWtsB,QAIxD,OAAO,KAHP4+B,EAAOA,EAAKtS,WAAWsa,GACvBA,EAAS,IAnlBI8oC,CAAe9G,EAAIU,UAAWV,EAAIY,aACjD,GAAK/zB,GAAa52C,KAAKwuC,IAAIkI,SAASE,EAAS/pB,YAA7C,CAKAiR,IAAIyC,EAAOqW,EAAStC,UAChBw8B,EAolBR,SAA4BzkC,EAAM9L,EAAMhO,EAAMiO,GAC5C,IAAK1C,IAAI78B,EAAI,EAAG8a,EAAM,EAAG9a,EAAIorC,EAAK7F,YAAczqB,GAAOykB,GAAK,CAC1D1C,IAAIuH,EAAQgH,EAAKhH,MAAMpkC,KAAM8vE,EAAah1D,EAE1C,GADAA,GAAOspB,EAAMH,SACRG,EAAMQ,OAAX,CAEA,IADA/H,IAAIx6B,EAAM+hC,EAAM9E,KACTt/B,EAAIorC,EAAK7F,YAAY,CAC1B1I,IAAIjtB,EAAOw7B,EAAKhH,MAAMpkC,KAEtB,GADA8a,GAAOlL,EAAKq0B,UACPr0B,EAAKg1B,OAAQ,MAClBviC,GAAOuN,EAAK0vB,KAEd,GAAIxkB,GAAOwW,EAAM,CACfuL,IAAIiG,EAAQzgC,EAAIi0C,YAAYhX,EAAMC,EAAKuwC,GACvC,GAAIhtC,GAAS,GAAKA,EAAQxD,EAAKp/B,OAAS4vE,GAAcx+C,EACpD,OAAOw+C,EAAahtC,IAG1B,OAAQ,EAtmBQitC,CAAmBhxE,KAAK+/B,KAAKt8B,QAAS88B,EAAMhO,EAAOxW,EAAKykB,EAAKzkB,GAE3E,OAAO+0D,EAAU,EAAI,KAAO,CAAC/wC,KAAM6W,EAAU76B,IAAK+0D,EAAO,KAAEvwC,MAG7D,EAAF,UAAE2vC,wBAAA,SAAwB/nB,EAAI,G,QAAS,K,IAAK,I,SAExC,IAAInoD,KAAK+rE,QAAQhsC,GAAjB,CAIA,IADAjC,IAAIqV,EAAUpT,EAERoT,EAAQtmB,YAAc7sB,KAAK21C,WADzBxC,EAAUA,EAAQtmB,WAAY,CAEpC,KAAOsmB,EAAQqB,iBAAiBrB,EAAQtmB,WAAWC,YAAYqmB,EAAQqB,iBACvE,KAAOrB,EAAQ2B,aAAa3B,EAAQtmB,WAAWC,YAAYqmB,EAAQ2B,aAC/D3B,EAAQiyB,aAAYjyB,EAAQiyB,WAAa,MAE/CtnC,IAAIuD,EAAO,IAAIqsC,EAAoB1tE,KAAMmzC,EAASpT,EAAMQ,GACxD4nB,EAAK8oB,iBAAiB97D,KAAKksB,GAG3BrhC,KAAKs7D,SAAW0S,GAAahuE,KAAKs7D,SAAUv/C,EAAKA,EAAMwkB,EAAKp/B,OAAQgnD,EAAM9mB,KAM5E,EAAF,UAAE3U,OAAA,SAAOqT,EAAMmuC,EAAWC,EAAWhmB,GACjC,QApnBkE,GAonB9DnoD,KAAKkrE,QACJnrC,EAAKkG,WAAWjmC,KAAK+/B,SAC1B//B,KAAKkxE,YAAYnxC,EAAMmuC,EAAWC,EAAWhmB,IACtC,IAGT,EAAF,UAAE+oB,YAAA,SAAYnxC,EAAMmuC,EAAWC,EAAWhmB,GACtCnoD,KAAKmxE,gBAAgBjD,GACrBluE,KAAK+/B,KAAOA,EACZ//B,KAAKmuE,UAAYA,EACbnuE,KAAK21C,YAAY31C,KAAKouE,eAAejmB,EAAMnoD,KAAK6oE,YACpD7oE,KAAKkrE,MA/nBS,GAkoBhB,EAAF,UAAEiG,gBAAA,SAAgBjD,GACd,IAAIQ,GAAcR,EAAWluE,KAAKkuE,WAAlC,CACApwC,IAAIszC,EAAqC,GAAzBpxE,KAAKolD,QAAQxR,SACzBy9B,EAASrxE,KAAKwuC,IAClBxuC,KAAKwuC,IAAM8iC,GAAetxE,KAAKwuC,IAAKxuC,KAAKolD,QACfmsB,GAAiBvxE,KAAKkuE,UAAWluE,KAAK+/B,KAAMqxC,GAC5CG,GAAiBrD,EAAWluE,KAAK+/B,KAAMqxC,IAC7DpxE,KAAKwuC,KAAO6iC,IACdA,EAAOjM,WAAa,KACpBplE,KAAKwuC,IAAI42B,WAAaplE,MAExBA,KAAKkuE,UAAYA,IAInB,EAAF,UAAEsD,WAAA,WACExxE,KAAKolD,QAAQooB,UAAUrjE,IAAI,6BACvBnK,KAAK21C,YAAe31C,KAAK+/B,KAAKh4B,KAAKo6B,KAAK0nB,YAAW7pD,KAAKwuC,IAAIqb,WAAY,IAI9E,EAAF,UAAE4nB,aAAA,WACEzxE,KAAKolD,QAAQooB,UAAU7gD,OAAO,6BAC1B3sB,KAAK21C,YAAe31C,KAAK+/B,KAAKh4B,KAAKo6B,KAAK0nB,WAAW7pD,KAAKwuC,IAAIkjC,gBAAgB,c,yCArMlE,CAASzG,GA2MpB,SAAS0G,EAAYvzC,EAAK8vC,EAAWC,EAAW3/B,EAAK2Z,GAE1D,OADAmmB,GAAe9/B,EAAK0/B,EAAW9vC,GACxB,IAAI6vC,EAAa,KAAM7vC,EAAK8vC,EAAWC,EAAW3/B,EAAKA,EAAKA,EAAK2Z,EAAM,GAGhF,IAAMqmB,EAAY,YAChB,WAAYxkE,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAK4W,EAAS+C,GAC5DjqB,OAAK,KAACl0B,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAK,KAAM4W,EAAS+C,G,4FAC/D,EAED,EAAF,UAAEqjB,UAAA,WAEE,IADA1tC,IAAImX,EAAOj1C,KAAKolD,QAAQv4B,WACjBooB,GAAQA,GAAQj1C,KAAKwuC,MAAQyG,EAAK28B,UAAU38B,EAAOA,EAAKpoB,WAC/D,MAAO,CAACooB,KAAMA,IAAQ,IAGxB,EAAF,UAAEvoB,OAAA,SAAOqT,EAAMmuC,EAAWjtC,EAAGknB,GACzB,QAhrBkE,GAgrB9DnoD,KAAKkrE,OAhrBK,GAgrBmBlrE,KAAKkrE,QAAuBlrE,KAAK6xE,aAC7D9xC,EAAKkG,WAAWjmC,KAAK+/B,SAC1B//B,KAAKmxE,gBAAgBjD,GAlrBP,GAmrBTluE,KAAKkrE,OAAsBnrC,EAAKQ,MAAQvgC,KAAK+/B,KAAKQ,MAASR,EAAKQ,MAAQvgC,KAAKolD,QAAQ9Q,YACxFt0C,KAAKolD,QAAQ9Q,UAAYvU,EAAKQ,KAC1B4nB,EAAKsoB,aAAezwE,KAAKolD,UAAS+C,EAAKsoB,YAAc,OAE3DzwE,KAAK+/B,KAAOA,EACZ//B,KAAKkrE,MAxrBS,GAyrBP,IAGT,EAAF,UAAE2G,SAAA,WAEE,IADA/zC,IAAIsyC,EAAYpwE,KAAKgK,OAAO2rC,WACnB98B,EAAI7Y,KAAKolD,QAASvsC,EAAGA,EAAIA,EAAEgU,WAAY,GAAIhU,GAAKu3D,EAAW,OAAO,EAC3E,OAAO,GAGT,EAAF,UAAEld,WAAA,SAAWn3C,GACT,MAAO,CAACgkB,KAAM//B,KAAKolD,QAASrd,OAAQhsB,IAGtC,EAAF,UAAE4vD,gBAAA,SAAgBn9B,EAAKzG,EAAQiX,GAC3B,OAAIxQ,GAAOxuC,KAAKolD,QAAgBplD,KAAK6oE,WAAajpE,KAAKiJ,IAAIk/B,EAAQ/nC,KAAK+/B,KAAKQ,KAAKp/B,QAC3E+8B,YAAMytC,gBAAA,KAAe,KAACn9B,EAAKzG,EAAQiX,IAG5C,EAAF,UAAE+tB,eAAA,SAAepjB,GACb,MAAwB,iBAAjBA,EAAS5hD,MAA4C,aAAjB4hD,EAAS5hD,MAGtD,EAAF,UAAEhF,MAAA,SAAMwvB,EAAMiO,EAAI2nB,GACdrqB,IAAIiC,EAAO//B,KAAK+/B,KAAKoG,IAAI5T,EAAMiO,GAAKgO,EAAM7rC,SAAS6qB,eAAeuS,EAAKQ,MACvE,OAAO,IAAIiuC,EAAaxuE,KAAKgK,OAAQ+1B,EAAM//B,KAAKkuE,UAAWluE,KAAKmuE,UAAW3/B,EAAKA,EAAK2Z,I,EA7CvE,CAAS8lB,GAmDrB6D,EAAc,Y,+IAClBtG,UAAA,WAAc,MAAO,CAAChpC,QAAQ,IAC9B,EAAF,UAAE8oC,YAAA,WAAgB,OAztBA,GAytBOtrE,KAAKkrE,O,EAFV,CAASD,GAQvBsD,GAAkB,YAEtB,WAAYvkE,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAKmH,EAAYyP,EAASjjB,EAAMgmB,EAAMpsC,GACpFmiB,OAAK,KAACl0B,EAAQ+1B,EAAMmuC,EAAWC,EAAW3/B,EAAKmH,EAAYyP,EAAS+C,EAAMpsC,GAC1E/b,KAAKmiC,KAAOA,E,4FACb,EAKD,EAAF,UAAEzV,OAAA,SAAOqT,EAAMmuC,EAAWC,EAAWhmB,GACjC,GA1uBkE,GA0uB9DnoD,KAAKkrE,MAAqB,OAAO,EACrC,GAAIlrE,KAAKmiC,KAAKzV,OAAQ,CACpBoR,IAAIj7B,EAAS7C,KAAKmiC,KAAKzV,OAAOqT,EAAMmuC,GAEpC,OADIrrE,GAAQ7C,KAAKkxE,YAAYnxC,EAAMmuC,EAAWC,EAAWhmB,GAClDtlD,EACF,SAAK7C,KAAK21C,aAAe5V,EAAK+F,SAG5B5H,YAAMxR,OAAA,KAAM,KAACqT,EAAMmuC,EAAWC,EAAWhmB,IAIpD,EAAF,UAAEqpB,WAAA,WACExxE,KAAKmiC,KAAKqvC,WAAaxxE,KAAKmiC,KAAKqvC,aAAetzC,YAAMszC,WAAA,KAAU,OAGlE,EAAF,UAAEC,aAAA,WACEzxE,KAAKmiC,KAAKsvC,aAAezxE,KAAKmiC,KAAKsvC,eAAiBvzC,YAAMuzC,aAAA,KAAY,OAGxE,EAAF,UAAE5yC,aAAA,SAAaqoB,EAAQ17B,EAAMw8C,EAAMsE,GAC/BtsE,KAAKmiC,KAAKtD,aAAe7+B,KAAKmiC,KAAKtD,aAAaqoB,EAAQ17B,EAAMw8C,GAC1D9pC,YAAMW,aAAA,KAAY,KAACqoB,EAAQ17B,EAAMw8C,EAAMsE,IAG7C,EAAF,UAAEznB,QAAA,WACM7kD,KAAKmiC,KAAK0iB,SAAS7kD,KAAKmiC,KAAK0iB,UACjC3mB,YAAM2mB,QAAA,KAAO,OAGf,EAAF,UAAE+E,UAAA,SAAUpxB,GACR,QAAOx4B,KAAKmiC,KAAKynB,WAAY5pD,KAAKmiC,KAAKynB,UAAUpxB,IAGnD,EAAF,UAAEu0C,eAAA,SAAepjB,GACb,OAAO3pD,KAAKmiC,KAAK4qC,eAAiB/sE,KAAKmiC,KAAK4qC,eAAepjB,GAAYzrB,YAAM6uC,eAAA,KAAc,KAACpjB,I,EA9CxE,CAASskB,GA2EjC,SAAS8D,GAAet9B,GAClBA,IAAUz0C,KAAKy0C,SAAWA,GAEhCs9B,GAAe1xE,UAAYD,OAAOkO,OAAO,MAEzC2vB,IAAM+zC,GAAS,CAAC,IAAID,IAEpB,SAASR,GAAiBrD,EAAWnuC,EAAMqxC,GACzC,GAAwB,GAApBlD,EAAU/sE,OAAa,OAAO6wE,GAIlC,IAFAl0C,IAAI+V,EAAMu9B,EAAYY,GAAO,GAAK,IAAID,GAAgBlvE,EAAS,CAACgxC,GAEvD5yC,EAAI,EAAGA,EAAIitE,EAAU/sE,OAAQF,IAAK,CACzC68B,IAAIgK,EAAQomC,EAAUjtE,GAAG8G,KAAK+/B,MAAO+D,EAAMgI,EAC3C,GAAK/L,EAIL,IAAKhK,IAAIr+B,KAHLqoC,EAAM2M,UACR5xC,EAAOsS,KAAK02B,EAAM,IAAIkmC,GAAejqC,EAAM2M,WAE5B3M,EAAO,CACtBhK,IAAIv9B,EAAMunC,EAAMroC,GACL,MAAPc,IACA6wE,GAA8B,GAAjBvuE,EAAO1B,QACtB0B,EAAOsS,KAAK02B,EAAMgI,EAAM,IAAIk+B,GAAehyC,EAAKmJ,SAAW,OAAS,QAC1D,SAARzpC,EAAiBosC,EAAI6Y,OAAS7Y,EAAI6Y,MAAQ7Y,EAAI6Y,MAAQ,IAAM,IAAMnkD,EACrD,SAARd,EAAiBosC,EAAI99B,OAAS89B,EAAI99B,MAAQ89B,EAAI99B,MAAQ,IAAM,IAAMxN,EAC1D,YAARd,IAAoBosC,EAAIpsC,GAAQc,KAI7C,OAAOsC,EAGT,SAASyuE,GAAeW,EAAU7sB,EAAS8sB,EAAcC,GAEvD,GAAID,GAAgBF,IAAUG,GAAeH,GAAQ,OAAO5sB,EAG5D,IADAtnB,IAAIs0C,EAAShtB,EACJnkD,EAAI,EAAGA,EAAIkxE,EAAYhxE,OAAQF,IAAK,CAC3C68B,IAAIixC,EAAOoD,EAAYlxE,GAAIg6B,EAAOi3C,EAAajxE,GAC/C,GAAIA,EAAG,CACL68B,IAAI9zB,OAAA,EACAixB,GAAQA,EAAKwZ,UAAYs6B,EAAKt6B,UAAY29B,GAAUH,IACnDjoE,EAASooE,EAAOvlD,aAAe7iB,EAAO0uC,QAAQ/gC,eAAiBo3D,EAAKt6B,YAGvEzqC,EAASrH,SAASuW,cAAc61D,EAAKt6B,WAC9Bm9B,UAAW,EAClB5nE,EAAOiE,YAAYmkE,GACnBn3C,EAAO+2C,GAAO,IALdI,EAASpoE,EASbqoE,GAAgBD,EAAQn3C,GAAQ+2C,GAAO,GAAIjD,GAE7C,OAAOqD,EAGT,SAASC,GAAgB7jC,EAAKvT,EAAM4Q,GAClC,IAAK/N,IAAIr+B,KAAQw7B,EACH,SAARx7B,GAA2B,SAARA,GAA2B,YAARA,GAAwBA,KAAQosC,GACxE2C,EAAIkjC,gBAAgBjyE,GACxB,IAAKq+B,IAAIr+B,KAAQosC,EACH,SAARpsC,GAA2B,SAARA,GAA2B,YAARA,GAAsBosC,EAAIpsC,IAASw7B,EAAKx7B,IAChF+uC,EAAI7gB,aAAaluB,EAAMosC,EAAIpsC,IAC/B,GAAIw7B,EAAKypB,OAAS7Y,EAAI6Y,MAAO,CAG3B,IAFA5mB,IAAIw0C,EAAWr3C,EAAKypB,MAAQzpB,EAAKypB,MAAMn+C,MAAM,KAAO8mE,EAChDkF,EAAU1mC,EAAI6Y,MAAQ7Y,EAAI6Y,MAAMn+C,MAAM,KAAO8mE,EACxCpsE,EAAI,EAAGA,EAAIqxE,EAASnxE,OAAQF,KAA0C,GAAjCsxE,EAAQp/D,QAAQm/D,EAASrxE,KACrEutC,EAAIg/B,UAAU7gD,OAAO2lD,EAASrxE,IAChC,IAAK68B,IAAI78B,EAAI,EAAGA,EAAIsxE,EAAQpxE,OAAQF,KAA0C,GAAjCqxE,EAASn/D,QAAQo/D,EAAQtxE,KACpEutC,EAAIg/B,UAAUrjE,IAAIooE,EAAQtxE,IAE9B,GAAIg6B,EAAKltB,OAAS89B,EAAI99B,MAAO,CAC3B,GAAIktB,EAAKltB,MAEP,IADA+vB,IAA4FtY,EAAxF3C,EAAO,gFACJ2C,EAAI3C,EAAKjkB,KAAKq8B,EAAKltB,QACxBygC,EAAIzgC,MAAMykE,eAAehtD,EAAE,IAE3BqmB,EAAI99B,QACNygC,EAAIzgC,MAAMuf,SAAWue,EAAI99B,QAI/B,SAASugE,GAAe9/B,EAAKugC,EAAMhvC,GACjC,OAAOuxC,GAAe9iC,EAAKA,EAAKwjC,GAAQT,GAAiBxC,EAAMhvC,EAAsB,GAAhByO,EAAIoF,WAI3E,SAAS86B,GAAcxrE,EAAGC,GACxB,GAAID,EAAE/B,QAAUgC,EAAEhC,OAAQ,OAAO,EACjC,IAAK28B,IAAI78B,EAAI,EAAGA,EAAIiC,EAAE/B,OAAQF,IAAK,IAAKiC,EAAEjC,GAAG8G,KAAKo7B,GAAGhgC,EAAElC,GAAG8G,MAAO,OAAO,EACxE,OAAO,EAIT,SAASyoE,GAAGhiC,GACV1Q,IAAIjtB,EAAO29B,EAAIsG,YAEf,OADAtG,EAAI3hB,WAAWC,YAAY0hB,GACpB39B,EAKT,IAAMi+D,GAEJ,SAAYj7B,EAAK4+B,GACfzyE,KAAK6zC,IAAMA,EACX7zC,KAAK0yE,KAAOD,EAGZzyE,KAAKqT,MAAQ,EAGbrT,KAAK+1B,MAAQ,GAEb/1B,KAAKwsD,SAAU,EAEf1uB,IAAIwT,EA8JR,SAAkBjF,EAAMgkC,GAEtB,IADAvyC,IAAIj7B,EAAS,GAAIyiC,EAAM+G,EAAK7F,WACnBvlC,EAAIovE,EAAMlvE,OAAS,EAAGmkC,EAAM,GAAKrkC,GAAK,EAAGA,IAAK,CACrD68B,IAAIuD,EAAOgvC,EAAMpvE,GAAI8+B,EAAOsB,EAAKtB,KACjC,GAAKA,EAAL,CACA,GAAIA,GAAQsM,EAAKhH,MAAMC,EAAM,GAAI,MACjCziC,EAAOsS,KAAKksB,KACViE,GAEJ,MAAO,CAACuC,MAAOhlC,EAAOqqC,UAAWnF,OAAQzC,GAvK7BqtC,CAAS9+B,EAAI9T,KAAKt8B,QAASowC,EAAIynB,UACzCt7D,KAAK4yE,WAAathC,EAAIzJ,MACtB7nC,KAAK6yE,eAAiBvhC,EAAIvJ,QAwK9B,SAASwnC,GAAYrsE,EAAGC,GAAK,OAAOD,EAAE6E,KAAKkrD,KAAO9vD,EAAE4E,KAAKkrD,KA6HzD,SAAS+a,GAAanmC,EAAOtV,EAAMiO,EAAI2nB,EAAMhxC,GAE3C,IADA2mB,IAAIj7B,EAAS,GACJ5B,EAAI,EAAG2U,EAAM,EAAG3U,EAAI4mC,EAAM1mC,OAAQF,IAAK,CAC9C68B,IAAIuH,EAAQwC,EAAM5mC,GAAIskC,EAAQ3vB,EAAK0vB,EAAM1vB,GAAOyvB,EAAMjpB,KAClDmpB,GAAS/E,GAAM8E,GAAO/S,EACxB1vB,EAAOsS,KAAKkwB,IAERE,EAAQhT,GAAM1vB,EAAOsS,KAAKkwB,EAAMtiC,MAAM,EAAGwvB,EAAOgT,EAAO4iB,IACvDhxC,IACFtU,EAAOsS,KAAKgC,GACZA,EAAc,MAEZmuB,EAAM9E,GAAI39B,EAAOsS,KAAKkwB,EAAMtiC,MAAMy9B,EAAK+E,EAAOF,EAAMjpB,KAAM+rC,KAGlE,OAAOtlD,E5CzyCF,SAAS,GAAiB,EAAM,GACrCi7B,IAAI,EAAS,EAAK,KAAK,eAAgB,EAAM,EAAK,MAAM,IACxD,IAAK,EAAO,UAAW,OAAO,KAC9BA,IAAI,EAAc,EAAK,QAAQ,YAAY,EAAO,WAAY,EAAW,GAAmC,GAApB,EAAY,KAChG,EAAO,EAAK,QAAQ,WAAW,EAAO,UAAW,EAAO,aAC5D,GAAI,EAAO,EAAG,OAAO,KACrBA,IAA+B,EAAS,EAApC,EAAQ,EAAI,QAAQ,GACxB,GAAI,EAAmB,GAAS,CAE9B,IADA,EAAU,EACH,IAAgB,EAAY,MAAM,EAAc,EAAY,OACnE,GAAI,GAAe,EAAY,KAAK,QAAU,gBAAc,aAAa,EAAY,OAAS,EAAY,UACjG,EAAY,KAAK,W0C2CvB,SAAkBiC,EAAMgI,EAAQ/9B,GACrC,IAAK8zB,IAAI4D,EAAoB,GAAVqG,EAAaqiC,EAAQriC,GAAU7C,EAASnF,GAAO2B,GAAW0oC,GAAQ,CACnF,GAAIrqC,GAAQ/1B,EAAQ,OAAO,EAC3B8zB,IAAIzqB,EAAQsxD,EAAS5kC,GAErB,KADAA,EAAOA,EAAKlT,YACD,OAAO,EAClB6U,EAAUA,GAAoB,GAATruB,EACrB+2D,EAAQA,GAAS/2D,GAAS6xB,EAASnF,I1ClDG,CAAS,EAAO,UAAW,EAAO,YAAa,EAAY,MAAO,CACtGjC,IAAI,EAAM,EAAY,UACtB,EAAY,IAAI,gBAAc,GAAQ,EAAM,EAAQ,EAAI,QAAQ,SAE7D,CACLA,IAAI,EAAS,EAAK,QAAQ,WAAW,EAAO,WAAY,EAAO,cAC/D,GAAI,EAAS,EAAG,OAAO,KACvB,EAAU,EAAI,QAAQ,GAGnB,IAEC,EAAQ,GAAiB,EAAM,EAAS,EADvB,WAAV,GAAwB,EAAK,MAAM,UAAU,KAAO,EAAM,MAAQ,EAAY,GAAK,IAG9F,OAAK,EAGF,SAAS,GAAe,EAAM,GACnCA,IAAI,EAAM,EAAK,MAAM,UAGrB,GAFA,GAAkB,EAAM,GAEpB,EAAK,SAAY,EAAK,WACpB,GAAa,IAAS,SAAS,eAAiB,SAAS,cAAc,SAAS,EAAK,KAD3F,CAKA,GAFA,EAAK,YAAY,sBAEb,EAAK,eAoEX,SAA6B,GAC3BA,IAAI,EAAS,EAAK,KAAK,eAAgB,EAAQ,SAAS,cACpD,EAAO,EAAK,cAAc,IAAK,EAAuB,OAAjB,EAAK,SAC1C,EAAK,EAAM,OAAO,EAAK,WAAY,EAAS,GAAQ,GACnD,EAAM,OAAO,EAAM,GACtB,EAAI,UAAS,GACb,EAAK,kBACP,EAAO,SAAS,IAMX,IAAQ,EAAK,MAAM,UAAU,SAAWzoB,EAAQ,IAAMA,EAAQ,YAAc,KAC/E,EAAK,UAAW,EAChB,EAAK,UAAW,GAlFhB,CAAoB,OACf,CACA,IAAqB,EAAmB,EAAxC,WAAQ,UACT,IAAmC,aAAe,kBAC/C,EAAI,MAAM,OAAO,gBACpB,EAAoB,GAAwB,EAAM,EAAI,OACnD,EAAI,OAAU,EAAI,MAAM,OAAO,gBAClC,EAAkB,GAAwB,EAAM,EAAI,MAExD,EAAK,QAAQ,aAAa,EAAQ,EAAM,EAAK,KAAM,GAC/C,KACE,GAAmB,GAAc,GACjC,GAAiB,GAAc,IAEjC,EAAI,QACN,EAAK,IAAI,UAAU,OAAO,8BAE1B,EAAK,IAAI,UAAU,IAAI,6BACnB,sBAAuB,UAoCjC,SAAsC,GACpCyoB,IAAI,EAAM,EAAK,IAAI,cACnB,EAAI,oBAAoB,kBAAmB,EAAK,oBAChDA,IAAI,EAAS,EAAK,KAAK,eACnB,EAAO,EAAO,WAAY,EAAS,EAAO,aAC9C,EAAI,iBAAiB,kBAAmB,EAAK,mBAAkB,WACzD,EAAO,YAAc,GAAQ,EAAO,cAAgB,IACtD,EAAI,oBAAoB,kBAAmB,EAAK,oBAChD,EAAK,IAAI,UAAU,OAAO,gCA5CW,CAA6B,IAItE,EAAK,YAAY,kBACjB,EAAK,YAAY,oB,a4C27BjBg1C,YAAA,SAAYz/D,GACV,OAAOA,GAASrT,KAAK6yE,eAAiB7yE,KAAK4yE,WAAWv/D,EAAQrT,KAAK6yE,gBAAkB,M,aAKvFE,eAAA,SAAextC,EAAOD,GACpB,GAAIC,GAASD,EAAb,CACA,IAAKxH,IAAI78B,EAAIskC,EAAOtkC,EAAIqkC,EAAKrkC,IAAKjB,KAAK6zC,IAAIynB,SAASr6D,GAAG4jD,UACvD7kD,KAAK6zC,IAAIynB,SAASt3B,OAAOuB,EAAOD,EAAMC,GACtCvlC,KAAKwsD,SAAU,I,aAIjByjB,YAAA,WACEjwE,KAAK+yE,eAAe/yE,KAAKqT,MAAOrT,KAAK6zC,IAAIynB,SAASn6D,S,aAMpDwuE,YAAA,SAAY1wC,EAAOqO,EAAQ6a,GAGzB,IAFArqB,IAAIia,EAAO,EAAG5P,EAAQnoC,KAAK+1B,MAAM50B,QAAU,EACvC6xE,EAAUpzE,KAAKiJ,IAAIs/B,EAAOlJ,EAAM99B,QAC7B42C,EAAOi7B,IACNj7B,GAAQ5P,EAAQ,EAAInoC,KAAK6zC,IAAM7zC,KAAK+1B,MAAOgiB,EAAO,GAAM,IAAIqzB,YAAYnsC,EAAM8Y,MAA6C,IAAnC9Y,EAAM8Y,GAAMhwC,KAAKo6B,KAAK8V,UACpHF,IAEF,KAAOA,EAAO5P,GACZnoC,KAAKiwE,cACLjwE,KAAK6zC,IAAIq3B,MAl8BG,EAm8BZlrE,KAAKqT,MAAQrT,KAAK+1B,MAAMyX,MACxBxtC,KAAK6zC,IAAM7zC,KAAK+1B,MAAMyX,MACtBrF,IAEF,KAAOA,EAAQlJ,EAAM99B,QAAQ,CAC3BnB,KAAK+1B,MAAM5gB,KAAKnV,KAAK6zC,IAAK7zC,KAAKqT,MAAQ,GAEvC,IADAyqB,IAAIiG,GAAS,EACJ9iC,EAAIjB,KAAKqT,MAAOpS,EAAIrB,KAAKiJ,IAAI7I,KAAKqT,MAAQ,EAAGrT,KAAK6zC,IAAIynB,SAASn6D,QAASF,IAC/E,GAAIjB,KAAK6zC,IAAIynB,SAASr6D,GAAGmqE,YAAYnsC,EAAMkJ,IAAS,CAAEpE,EAAQ9iC,EAAG,MAEnE,GAAI8iC,GAAS,EACPA,EAAQ/jC,KAAKqT,QACfrT,KAAKwsD,SAAU,EACfxsD,KAAK+yE,eAAe/yE,KAAKqT,MAAO0wB,IAElC/jC,KAAK6zC,IAAM7zC,KAAK6zC,IAAIynB,SAASt7D,KAAKqT,WAC7B,CACLyqB,IAAIm1C,EAAWnF,EAAax/D,OAAOtO,KAAK6zC,IAAK5U,EAAMkJ,GAAQmF,EAAQ6a,GACnEnoD,KAAK6zC,IAAIynB,SAASt3B,OAAOhkC,KAAKqT,MAAO,EAAG4/D,GACxCjzE,KAAK6zC,IAAMo/B,EACXjzE,KAAKwsD,SAAU,EAEjBxsD,KAAKqT,MAAQ,EACb80B,M,aAOJ0nC,cAAA,SAAc9vC,EAAMmuC,EAAWC,EAAW96D,GACxCyqB,IAAIiG,GAAS,EAAG4uC,EAAWt/D,EAAQ,OAAItN,EAAY/F,KAAK8yE,YAAYz/D,GAAQioD,EAAWt7D,KAAK6zC,IAAIynB,SAChG,GAAIqX,GAAYA,EAAStH,YAAYtrC,EAAMmuC,EAAWC,GACpDpqC,EAAQu3B,EAASnoD,QAAQw/D,QAEzB,IAAK70C,IAAI78B,EAAIjB,KAAKqT,MAAOE,EAAI3T,KAAKiJ,IAAIyyD,EAASn6D,OAAQF,EAAI,GAAIA,EAAIsS,EAAGtS,IAAK,CACzE68B,IAAIuH,EAAQi2B,EAASr6D,GACrB,GAAIokC,EAAMgmC,YAAYtrC,EAAMmuC,EAAWC,IAAcnuE,KAAK4yE,WAAWz/D,QAAQkyB,GAAS,EAAG,CACvFtB,EAAQ9iC,EACR,OAIN,QAAI8iC,EAAQ,KACZ/jC,KAAK+yE,eAAe/yE,KAAKqT,MAAO0wB,GAChC/jC,KAAKqT,SACE,I,aAMTy8D,eAAA,SAAe/vC,EAAMmuC,EAAWC,EAAWhmB,EAAM90C,GAC/C,IAAKyqB,IAAI78B,EAAIjB,KAAKqT,MAAOpS,EAAIjB,KAAK6zC,IAAIynB,SAASn6D,OAAQF,IAAK,CAC1D68B,IAAIjtB,EAAO7Q,KAAK6zC,IAAIynB,SAASr6D,GAC7B,GAAI4P,aAAgBo9D,EAAc,CAChCnwC,IAAI60C,EAAW3yE,KAAK4yE,WAAWz/D,QAAQtC,GACvC,GAAI8hE,GAAY,GAAKA,EAAW3yE,KAAK6yE,gBAAkBx/D,EAAO,OAAO,EACrEyqB,IAAIo1C,EAAUriE,EAAK29B,IAQnB,KAHaxuC,KAAK0yE,OAASQ,GAAWlzE,KAAK0yE,MAA4B,GAApBQ,EAAQt/B,UAAiBs/B,EAAQx8B,SAAS12C,KAAK0yE,KAAK7lD,gBACjGkT,EAAK8F,QAAUh1B,EAAKkvB,MAAQlvB,EAAKkvB,KAAK8F,QAAUh1B,EAAKu0C,QAAQ9Q,WAAavU,EAAKQ,MAngCvB,GAogCxD1vB,EAAKq6D,OAAuBwD,GAAcR,EAAWr9D,EAAKq9D,cACjDr9D,EAAK6b,OAAOqT,EAAMmuC,EAAWC,EAAWhmB,GAIrD,OAHAnoD,KAAK+yE,eAAe/yE,KAAKqT,MAAOpS,GAC5B4P,EAAK29B,KAAO0kC,IAASlzE,KAAKwsD,SAAU,GACxCxsD,KAAKqT,SACE,EAET,OAGJ,OAAO,G,aAKT08D,QAAA,SAAQhwC,EAAMmuC,EAAWC,EAAWhmB,EAAMpsC,GACxC/b,KAAK6zC,IAAIynB,SAASt3B,OAAOhkC,KAAKqT,QAAS,EAAG46D,EAAa3/D,OAAOtO,KAAK6zC,IAAK9T,EAAMmuC,EAAWC,EAAWhmB,EAAMpsC,IAC1G/b,KAAKwsD,SAAU,G,aAGjBojB,YAAA,SAAYrC,EAAQplB,EAAMpsC,GACxB+hB,IAAIjtB,EAAO7Q,KAAKqT,MAAQrT,KAAK6zC,IAAIynB,SAASn6D,OAASnB,KAAK6zC,IAAIynB,SAASt7D,KAAKqT,OAAS,KACnF,IAAIxC,IAAQA,EAAKs6D,cAAcoC,IAAYA,GAAU18D,EAAK08D,QAAW18D,EAAK08D,OAAOxlE,KAAK4vC,MAAM9qB,WAErF,CACLiR,IAAIuD,EAAO,IAAIisC,EAAettE,KAAK6zC,IAAK05B,EAAQplB,EAAMpsC,GACtD/b,KAAK6zC,IAAIynB,SAASt3B,OAAOhkC,KAAKqT,QAAS,EAAGguB,GAC1CrhC,KAAKwsD,SAAU,OAJfxsD,KAAKqT,S,aAUT28D,kBAAA,WAEE,IADAlyC,IAAIkI,EAAYhmC,KAAK6zC,IAAIynB,SAASt7D,KAAKqT,MAAQ,GACxC2yB,aAAqB8nC,GAAc9nC,EAAYA,EAAUs1B,SAASt1B,EAAUs1B,SAASn6D,OAAS,GAErG,IAAK6kC,KACCA,aAAqBwoC,IACvB,MAAM18D,KAAKk0B,EAAUjG,KAAKQ,MAC5B,GAAIvgC,KAAKqT,MAAQrT,KAAK6zC,IAAIynB,SAASn6D,QAAUnB,KAAK6zC,IAAIynB,SAASt7D,KAAKqT,OAAOi4D,cACzEtrE,KAAKqT,YACA,CACLyqB,IAAI0Q,EAAM7rC,SAASuW,cAAc,MACjClZ,KAAK6zC,IAAIynB,SAASt3B,OAAOhkC,KAAKqT,QAAS,EAAG,IAAIy+D,EAAe9xE,KAAK6zC,IAAKw5B,EAAS7+B,EAAK,OACrFxuC,KAAKwsD,SAAU,I5CjkCvBvuB,IAAM,GAAgC5oB,EAAQ,QAAUA,EAAQ,QAAUA,EAAQ,eAAiB,GAEnG,SAAS,GAAwB,EAAM,GACvC,MAAuB,EAAK,QAAQ,WAAW,GAAxC,SAAM,WACP,EAAQ,EAAS,EAAK,WAAW,OAAS,EAAK,WAAW,GAAU,KACpE,EAAS,EAAS,EAAK,WAAW,EAAS,GAAK,KAClD,GAAEA,EAAQ,QAAU,GAAkC,SAAzB,EAAM,gBAA4B,OAAO,GAAY,GACpF,KAAM,GAAkC,SAAzB,EAAM,iBAAiC,GAAoC,SAA1B,EAAO,iBAA6B,CAClG,GAAI,EAAO,OAAO,GAAY,GACzB,GAAI,EAAQ,OAAO,GAAY,IAIxC,SAAS,GAAY,GAGnB,OAFA,EAAQ,gBAAkB,OACtBA,EAAQ,QAAU,EAAQ,YAAa,EAAQ,WAAY,EAAO,EAAQ,cAAe,GACtF,EAGT,SAAS,GAAc,GACrB,EAAQ,gBAAkB,QACtB,EAAQ,eAAgB,EAAQ,WAAY,EAAM,EAAQ,aAAe,MAmCxE,SAAS,GAAkB,EAAM,GACtC,GAAI,aAAe,gBAAe,CAChCyoB,IAAI,EAAO,EAAK,QAAQ,OAAO,EAAI,MAC/B,GAAQ,EAAK,uBACf,GAAmB,GACf,GAAM,EAAK,aACf,EAAK,qBAAuB,QAG9B,GAAmB,GAKvB,SAAS,GAAmB,GACtB,EAAK,uBACH,EAAK,qBAAqB,QAC5B,EAAK,qBAAqB,eAC5B,EAAK,qBAAuB,MAIzB,SAAS,GAAiB,EAAM,EAAS,EAAO,GACrD,OAAO,EAAK,SAAS,0BAAwB,SAAE,UAAK,EAAE,EAAM,EAAS,OAChE,gBAAc,QAAQ,EAAS,EAAO,GAQtC,SAAS,GAAa,GAC3BA,IAAI,EAAM,EAAK,KAAK,eAClB,IAAG,EAAI,WAAY,OAAO,EAC5B,IAIE,OAAO,EAAK,IAAI,SAAoC,GAA3B,EAAI,WAAW,SAAgB,EAAI,WAAW,WAAa,EAAI,cACrF,EAAK,UAAY,EAAK,IAAI,SAAmC,GAA1B,EAAI,UAAU,SAAgB,EAAI,UAAU,WAAa,EAAI,YACnG,MAAM,GACN,OAAO,G6CtKX,SAASq1C,GAAmB3sE,EAAO8P,GACjC,IAAF,EAAyB9P,EAAM+3B,UAAxByrC,EAAA,EAAAA,QAASzqC,EAAA,EAAAA,MACV6zC,EAAQ98D,EAAM,EAAI0zD,EAAQ96C,IAAIqQ,GAASyqC,EAAQnhE,IAAI02B,GACnDu1B,EAAUse,EAAMppE,OAAOu/B,cAAwB6pC,EAAMjrC,MAAQ3hC,EAAM43B,IAAI3e,QAAQnJ,EAAM,EAAI88D,EAAM7qC,QAAU6qC,EAAMlwC,UAAY,KAApFkwC,EAC3C,OAAOte,GAAU,YAAUtN,SAASsN,EAAQx+C,GAG9C,SAAS3J,GAAMw7C,EAAM4hB,GAEnB,OADA5hB,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAG5C,aAAakrC,GAAK7oC,mBACvC,EAGT,SAASmyC,GAAmBlrB,EAAM7xC,EAAKg9D,GACrCx1C,IAAIisC,EAAM5hB,EAAK3hD,MAAM+3B,UACrB,KAAIwrC,aAAe,iBAuBZ,IAAIA,aAAe,iBAAiBA,EAAIhqC,KAAKmJ,SAClD,OAAOv8B,GAAMw7C,EAAM,IAAI,gBAAc7xC,EAAM,EAAIyzD,EAAI/rC,IAAM+rC,EAAIhsC,QAE7DD,IAAIjtB,EAAOsiE,GAAmBhrB,EAAK3hD,MAAO8P,GAC1C,QAAIzF,GAAalE,GAAMw7C,EAAMt3C,GA1B7B,IAAKk5D,EAAI9pC,OAASqzC,EAAKngE,QAAQ,MAAQ,EACrC,OAAO,EACF,GAAIg1C,EAAK2hB,eAAexzD,EAAM,EAAI,QAAU,QAAS,CAC1DwnB,IAAIjtB,EAAOsiE,GAAmBhrB,EAAK3hD,MAAO8P,GAC1C,SAAIzF,GAASA,aAAgB,kBAAuBlE,GAAMw7C,EAAMt3C,GAE3D,KAAMwE,EAAQsuD,KAAO2P,EAAKngE,QAAQ,MAAQ,GAAI,CACnD2qB,IAAsGuD,EAAlG9B,EAAQwqC,EAAIxqC,MAAOQ,EAAOR,EAAM+I,WAAa,KAAOhyB,EAAM,EAAIipB,EAAMmJ,WAAanJ,EAAMiJ,UAC3F,IAAKzI,GAAQA,EAAK8F,OAAQ,OAAO,EACjC/H,IAAIy1C,EAAUj9D,EAAM,EAAIipB,EAAMxjB,IAAMgkB,EAAKmF,SAAW3F,EAAMxjB,IAC1D,SAAMgkB,EAAKonB,SAAW9lB,EAAO8mB,EAAKuJ,QAAQsa,OAAOuH,MAAclyC,EAAKsU,cAChE,gBAAcgS,aAAa5nB,GACtBpzB,GAAMw7C,EAAM,IAAI,gBAAc7xC,EAAM,EAAI6xC,EAAK3hD,MAAM43B,IAAI3e,QAAQ8f,EAAMxjB,IAAMgkB,EAAKmF,UAAY3F,MAC1FlqB,EAAQivD,QAIV33D,GAAMw7C,EAAM,IAAI,gBAAcA,EAAK3hD,MAAM43B,IAAI3e,QAAQnJ,EAAM,EAAIi9D,EAAUA,EAAUxzC,EAAKmF,cAcvG,SAASsuC,GAAQzzC,GACf,OAAwB,GAAjBA,EAAK6T,SAAgB7T,EAAKuU,UAAUnzC,OAAS4+B,EAAKtS,WAAWtsB,OAGtE,SAASsyE,GAAYjlC,GACnB1Q,IAAIuD,EAAOmN,EAAI42B,WACf,OAAO/jC,GAAqB,GAAbA,EAAKjlB,OAAcoyB,EAAIsG,aAA+B,MAAhBtG,EAAIiG,UAK3D,SAASi/B,GAAqBvrB,GAC5BrqB,IAAIisC,EAAM5hB,EAAK6f,KAAKqC,eAChBtqC,EAAOgqC,EAAIU,UAAW1iC,EAASgiC,EAAIY,YACvC,GAAK5qC,EAAL,CACAjC,IAAI61C,EAAUC,EAAYtH,GAAQ,EAKlC,IADIj3D,EAAQ2uD,OAA0B,GAAjBjkC,EAAK6T,UAAiB7L,EAASyrC,GAAQzzC,IAAS0zC,GAAY1zC,EAAKtS,WAAWsa,MAAUukC,GAAQ,KAEjH,GAAIvkC,EAAS,EAAG,CACd,GAAqB,GAAjBhI,EAAK6T,SACP,MAEA9V,IAAIoF,EAASnD,EAAKtS,WAAWsa,EAAS,GACtC,GAAI0rC,GAAYvwC,GACdywC,EAAW5zC,EACX6zC,IAAe7rC,MACV,IAAuB,GAAnB7E,EAAO0Q,SAGX,MADL7L,GADAhI,EAAOmD,GACOoR,UAAUnzC,YAGvB,IAAI0yE,GAAY9zC,GACrB,MAGA,IADAjC,IAAI7C,EAAO8E,EAAKyU,gBACTvZ,GAAQw4C,GAAYx4C,IACzB04C,EAAW5zC,EAAKlT,WAChB+mD,EAAajP,EAAS1pC,GACtBA,EAAOA,EAAKuZ,gBAEd,GAAKvZ,EAMH8M,EAASyrC,GADTzzC,EAAO9E,OALE,CAET,IADA8E,EAAOA,EAAKlT,aACAs7B,EAAK3Z,IAAK,MACtBzG,EAAS,GAOXukC,EAAOwH,GAAY3rB,EAAM4hB,EAAKhqC,EAAMgI,GAC/B4rC,GAAUG,GAAY3rB,EAAM4hB,EAAK4J,EAAUC,IAKtD,SAASG,GAAsB5rB,GAC7BrqB,IAAIisC,EAAM5hB,EAAK6f,KAAKqC,eAChBtqC,EAAOgqC,EAAIU,UAAW1iC,EAASgiC,EAAIY,YACvC,GAAK5qC,EAAL,CAGA,IAFAjC,IACI61C,EAAUC,EADVn/D,EAAM++D,GAAQzzC,KAGhB,GAAIgI,EAAStzB,EAAK,CAChB,GAAqB,GAAjBsrB,EAAK6T,SAAe,MAExB,IAAI6/B,GADQ1zC,EAAKtS,WAAWsa,IAKvB,MAHH4rC,EAAW5zC,EACX6zC,IAAe7rC,MAGZ,IAAI8rC,GAAY9zC,GACrB,MAGA,IADAjC,IAAIjtB,EAAOkvB,EAAK+U,YACTjkC,GAAQ4iE,GAAY5iE,IACzB8iE,EAAW9iE,EAAKgc,WAChB+mD,EAAajP,EAAS9zD,GAAQ,EAC9BA,EAAOA,EAAKikC,YAEd,GAAKjkC,EAMHk3B,EAAS,EACTtzB,EAAM++D,GAFNzzC,EAAOlvB,OALE,CAET,IADAkvB,EAAOA,EAAKlT,aACAs7B,EAAK3Z,IAAK,MACtBzG,EAAStzB,EAAM,GAQjBk/D,GAAUG,GAAY3rB,EAAM4hB,EAAK4J,EAAUC,IAGjD,SAASC,GAAYrlC,GACnB1Q,IAAIuD,EAAOmN,EAAI42B,WACf,OAAO/jC,GAAQA,EAAKtB,MAAQsB,EAAKtB,KAAKgG,QAGxC,SAAS+tC,GAAY3rB,EAAM4hB,EAAKhqC,EAAMgI,GACpC,GAAIs9B,EAAmB0E,GAAM,CAC3BjsC,IAAIyf,EAAQ56C,SAASgwD,cACrBpV,EAAMqV,OAAO7yB,EAAMgI,GACnBwV,EAAMsV,SAAS9yB,EAAMgI,GACrBgiC,EAAIe,kBACJf,EAAIgB,SAASxtB,QACJwsB,EAAI9mE,QACb8mE,EAAI9mE,OAAO88B,EAAMgI,GAEnBogB,EAAK6rB,YAAYC,kBACZ,IAAAztE,EAAA,EAAAA,MAELwN,YAAW,WACLm0C,EAAK3hD,OAASA,GAAO0tE,GAAe/rB,KACvC,IAOL,SAASgsB,GAAiBhsB,EAAM7xC,EAAKg9D,GACnCx1C,IAAIisC,EAAM5hB,EAAK3hD,MAAM+3B,UACrB,GAAIwrC,aAAe,kBAAkBA,EAAI9pC,OAASqzC,EAAKngE,QAAQ,MAAQ,EAAG,OAAO,EACjF,GAAIkC,EAAQsuD,KAAO2P,EAAKngE,QAAQ,MAAQ,EAAG,OAAO,EAC7C,IAAA4qB,EAAA,EAAAA,MAAOC,EAAA,EAAAA,IAEZ,IAAKD,EAAM/zB,OAAOu/B,eAAiB4e,EAAK2hB,eAAexzD,EAAM,EAAI,KAAO,QAAS,CAC/EwnB,IAAIjtB,EAAOsiE,GAAmBhrB,EAAK3hD,MAAO8P,GAC1C,GAAIzF,GAASA,aAAgB,gBAC3B,OAAOlE,GAAMw7C,EAAMt3C,GAEvB,IAAKktB,EAAM/zB,OAAOu/B,cAAe,CAC/BzL,IAAIs2C,EAAS,YAAU5sB,SAASlxC,EAAM,EAAIynB,EAAQC,EAAK1nB,GACvD,OAAO89D,GAASznE,GAAMw7C,EAAMisB,GAE9B,OAAO,EAGT,SAASC,GAA2BlsB,EAAM7xC,GACxC,KAAM6xC,EAAK3hD,MAAM+3B,qBAAqB,iBAAgB,OAAO,EAC7D,IAAF,EAAgC4pB,EAAK3hD,MAAM+3B,UAApCgB,EAAA,EAAAA,MAAOyqC,EAAA,EAAAA,QAAS/pC,EAAA,EAAAA,MACrB,IAAKV,EAAMkK,WAAWugC,GAAU,OAAO,EACvC,IAAK/pC,EAAO,OAAO,EACnB,GAAIkoB,EAAK2hB,eAAexzD,EAAM,EAAI,UAAY,YAAa,OAAO,EAClEwnB,IAAIw2C,GAAY/0C,EAAM+I,aAAehyB,EAAM,EAAIipB,EAAMmJ,WAAanJ,EAAMiJ,WACxE,GAAI8rC,IAAaA,EAASzuC,OAAQ,CAChC/H,IAAI2D,EAAK0mB,EAAK3hD,MAAMi7B,GAIpB,OAHInrB,EAAM,EAAGmrB,EAAG4f,OAAO9hB,EAAMxjB,IAAMu4D,EAASpvC,SAAU3F,EAAMxjB,KACvD0lB,EAAG4f,OAAO9hB,EAAMxjB,IAAKwjB,EAAMxjB,IAAMu4D,EAASpvC,UAC/CijB,EAAKuB,SAASjoB,IACP,EAET,OAAO,EAGT,SAAS8yC,GAAepsB,EAAMpoB,EAAMv5B,GAClC2hD,EAAK6rB,YAAY14D,OACjBykB,EAAKolC,gBAAkB3+D,EACvB2hD,EAAK6rB,YAAYzuC,QAmCZ,SAASivC,GAAersB,EAAM3vB,GACnCsF,IAAI1b,EAAOoW,EAAMotC,QAAS0N,EAV5B,SAAiB96C,GACfsF,IAAIj7B,EAAS,GAKb,OAJI21B,EAAMi8C,UAAS5xE,GAAU,KACzB21B,EAAMk8C,UAAS7xE,GAAU,KACzB21B,EAAMm8C,SAAQ9xE,GAAU,KACxB21B,EAAMo8C,WAAU/xE,GAAU,KACvBA,EAI0BgyE,CAAQr8C,GACzC,OAAY,GAARpW,GAAc/M,EAAQsuD,KAAe,IAARvhD,GAAsB,KAARkxD,EACtCe,GAA2BlsB,GAAO,IAAMurB,GAAqBvrB,GACnD,IAAR/lC,GAAe/M,EAAQsuD,KAAe,IAARvhD,GAAsB,KAARkxD,EAC9Ce,GAA2BlsB,EAAM,IAAM4rB,GAAsB5rB,GACnD,IAAR/lC,GAAsB,IAARA,IAEN,IAARA,EACFixD,GAAmBlrB,GAAO,EAAGmrB,IAASI,GAAqBvrB,GACjD,IAAR/lC,EACFixD,GAAmBlrB,EAAM,EAAGmrB,IAASS,GAAsB5rB,GACjD,IAAR/lC,EACF+xD,GAAiBhsB,GAAO,EAAGmrB,IAASI,GAAqBvrB,GAC/C,IAAR/lC,EAzCb,SAA4B+lC,GAC1B,GAAK9yC,EAAQmvD,UAAUrc,EAAK3hD,MAAM+3B,UAAUgB,MAAM2I,aAAe,GAAjE,CACA,IAAF,EAAiCigB,EAAK6f,KAAKqC,eAApCI,EAAA,EAAAA,UAAWE,EAAA,EAAAA,YAChB,GAAIF,GAAmC,GAAtBA,EAAU72B,UAAgC,GAAf+2B,GACxCF,EAAU58C,YAAsD,SAAxC48C,EAAU58C,WAAWs3C,gBAA4B,CAC3ErnC,IAAIuH,EAAQolC,EAAU58C,WACtB0mD,GAAepsB,EAAM9iB,GAAO,GAC5BrxB,YAAW,WAAD,OAAOugE,GAAepsB,EAAM9iB,GAAO,KAAQ,MAmC9CyvC,CAAmB3sB,IAASgsB,GAAiBhsB,EAAM,EAAGmrB,IAASS,GAAsB5rB,GACnFmrB,IAASj+D,EAAQsuD,IAAM,IAAM,OACpB,IAARvhD,GAAsB,IAARA,GAAsB,IAARA,GAAsB,IAARA,IClNxD,SAAS4yB,GAAaxG,GACpB1Q,IAAIuD,EAAOmN,EAAI42B,WACf,GAAI/jC,EACF,OAAOA,EAAKmqC,YACP,GAAoB,MAAhBh9B,EAAIiG,UAAoBjG,EAAI3hB,WAAY,CAIjD,GAAIxX,EAAQmvD,QAAU,aAAa1yD,KAAK08B,EAAI3hB,WAAW4nB,UAAW,CAChE3W,IAAImX,EAAOtyC,SAASuW,cAAc,OAElC,OADA+7B,EAAKhnC,YAAYtL,SAASuW,cAAc,OACjC,MAAC+7B,GACH,GAAIzG,EAAI3hB,WAAWmZ,WAAawI,GAAOn5B,EAAQmvD,QAAU,gBAAgB1yD,KAAK08B,EAAI3hB,WAAW4nB,UAClG,MAAO,CAACjS,QAAQ,QAEb,GAAoB,OAAhBgM,EAAIiG,UAAqBjG,EAAIwF,aAAa,oBACnD,MAAO,CAACxR,QAAQ,GAIb,SAASuyC,GAAc5sB,EAAM51B,EAAMiO,EAAIw0C,EAAUC,GACtD,GAAI1iD,EAAO,EAAX,CACEuL,IAAIo3C,EAAS/sB,EAAKgtB,kBAAoBh/C,KAAKG,MAAQ,GAAK6xB,EAAKitB,oBAAsB,KAC/EC,EAASC,GAAiBntB,EAAM+sB,GACpC,GAAIG,IAAWltB,EAAK3hD,MAAM+3B,UAAU4E,GAAGkyC,GAAS,CAC9Cv3C,IAAI2D,EAAK0mB,EAAK3hD,MAAMi7B,GAAG5C,aAAaw2C,GACtB,WAAVH,EAAqBzzC,EAAGX,QAAQ,WAAW,GAC5B,OAAVo0C,GAAiBzzC,EAAGP,iBAC7BinB,EAAKuB,SAASjoB,QAPlB,CAYA3D,IAAIy3C,EAAUptB,EAAK3hD,MAAM43B,IAAI3e,QAAQ8S,GACjCvzB,EAASu2E,EAAQpsC,YAAY3I,GACjCjO,EAAOgjD,EAAQryC,OAAOlkC,EAAS,GAC/BwhC,EAAK2nB,EAAK3hD,MAAM43B,IAAI3e,QAAQ+gB,GAAI+H,MAAMvpC,EAAS,GAE/C8+B,IAII03C,EAAcC,EAJd1L,EAAM5hB,EAAK3hD,MAAM+3B,UACjB/f,EAjFN,SAAsB2pC,EAAMutB,EAAOC,GACjC,IAAF,EAAuDxtB,EAAKuJ,QAAQua,WAAWyJ,EAAOC,GAAzE3rE,EAAA,OAAQkiE,EAAA,EAAAA,WAAYC,EAAA,EAAAA,SAAU55C,EAAA,EAAAA,KAAMiO,EAAA,EAAAA,GAE3C8kC,EAASnd,EAAK6f,KAAKqC,eAAgBlwD,EAAO,KAAM+sC,EAASoe,EAAOoH,WAQpE,GAPIxlB,GAAUiB,EAAK3Z,IAAIkI,SAA4B,GAAnBwQ,EAAOtT,SAAgBsT,EAASA,EAAOr6B,cACrE1S,EAAO,CAAC,CAAC4lB,KAAMmnB,EAAQnf,OAAQu9B,EAAOqH,eACjCtH,EAAmBC,IACtBnrD,EAAKhF,KAAK,CAAC4qB,KAAMulC,EAAOmF,UAAW1iC,OAAQu9B,EAAOqF,eAIlDt1D,EAAQ6uD,QAA+B,IAArB/b,EAAKytB,YACzB,IAAK93C,IAAIloB,EAAMu2D,EAAUv2D,EAAMs2D,EAAYt2D,IAAO,CAChDkoB,IAAIiC,EAAO/1B,EAAOyjB,WAAW7X,EAAM,GAAIyrB,EAAOtB,EAAKqlC,WACnD,GAAqB,MAAjBrlC,EAAK6T,WAAqBvS,EAAM,CAAE8qC,EAAWv2D,EAAK,MACtD,IAAKyrB,GAAQA,EAAKjlB,KAAM,MAG5B0hB,IAAI+3C,EAAW1tB,EAAK3hD,MAAM43B,IACtB4U,EAASmV,EAAKke,SAAS,cAAgB,YAAU52B,WAAW0Y,EAAK3hD,MAAMi6B,QACvE1C,EAAQ83C,EAASp2D,QAAQ8S,GAEzBw3C,EAAM,KAAM3rC,EAAM4U,EAAOx0B,MAAMxU,EAAQ,CACzCmpC,QAASpV,EAAM/zB,OACfqpC,SAAUtV,EAAM/zB,OAAOktC,eAAenZ,EAAM1qB,SAC5CmjC,SAAS,EACTjkB,KAAM25C,EACN1rC,GAAI2rC,EACJp6B,oBAAoBhU,EAAM/zB,OAAOjC,KAAKo6B,KAAK/f,MAAO,OAClD0zD,iBAAiB,EACjBxiC,cAAen5B,EACf66B,gBACAnrC,QAASk0B,IAEX,GAAI5jB,GAAuB,MAAfA,EAAK,GAAG4B,IAAa,CAC/B+hB,IAAIopB,EAAS/sC,EAAK,GAAG4B,IAAKyP,EAAOrR,EAAK,IAAMA,EAAK,GAAG4B,IACxC,MAARyP,IAAcA,EAAO07B,GACzB6iB,EAAM,CAAC7iB,OAAQA,EAAS30B,EAAM/G,KAAMA,EAAO+G,GAE7C,MAAO,KAAC6L,EAAG,IAAE2rC,EAAG,KAAEx3C,EAAI,GAAEiO,GA0CZu1C,CAAa5tB,EAAM51B,EAAMiO,GAEjCpC,EAAM+pB,EAAK3hD,MAAM43B,IAAK43C,EAAU53C,EAAIr7B,MAAMyb,EAAM+T,KAAM/T,EAAMgiB,IAGvC,IAArB2nB,EAAKytB,aAAqBz/C,KAAKG,MAAQ,IAAM6xB,EAAK8tB,iBACpDT,EAAertB,EAAK3hD,MAAM+3B,UAAUiC,GACpCi1C,EAAgB,QAEhBD,EAAertB,EAAK3hD,MAAM+3B,UAAUhM,KACpCkjD,EAAgB,SAElBttB,EAAKytB,YAAc,KAEnB93C,IAAIo4C,EAmMN,SAAkBhzE,EAAGC,EAAG4Y,EAAKy5D,EAAcC,GACzC33C,IAAIyH,EAAQriC,EAAEwjC,cAAcvjC,EAAG4Y,GAC/B,GAAa,MAATwpB,EAAe,OAAO,KAC1B,IAAF,EAA2BriC,EAAE4jC,YAAY3jC,EAAG4Y,EAAM7Y,EAAEkZ,KAAML,EAAM5Y,EAAEiZ,MAAxD+5D,EAAA,IAASC,EAAA,IACjB,GAAqB,OAAjBX,EAAwB,CAC1B33C,IAAIu4C,EAASz2E,KAAKsvB,IAAI,EAAGqW,EAAQ3lC,KAAKiJ,IAAIstE,EAAMC,IAChDZ,GAAgBW,EAAOE,EAAS9wC,EAElC,GAAI4wC,EAAO5wC,GAASriC,EAAEkZ,KAAOjZ,EAAEiZ,KAAM,CAGnCg6D,GADA7wC,GADWiwC,GAAgBjwC,GAASiwC,GAAgBW,EAAO5wC,EAAQiwC,EAAe,IAElEY,EAAOD,GACvBA,EAAO5wC,OACF,GAAI6wC,EAAO7wC,EAAO,CAGvB4wC,GADA5wC,GADWiwC,GAAgBjwC,GAASiwC,GAAgBY,EAAO7wC,EAAQiwC,EAAe,IAElEW,EAAOC,GACvBA,EAAO7wC,EAET,MAAO,OAACA,EAAK,KAAE4wC,EAAI,KAAEC,GAtNRE,CAASN,EAAQvyE,QAAS+a,EAAM4f,IAAI36B,QAAS+a,EAAM+T,KAAMijD,EAAcC,GACpF,IAAKS,EAAQ,CACX,KAAIlB,GAAYjL,aAAe,kBAAkBA,EAAI9pC,OAAS8pC,EAAIxqC,MAAMkK,WAAWsgC,EAAIC,WAClF7hB,EAAKsL,WAAej1C,EAAMurD,KAAOvrD,EAAMurD,IAAI7iB,QAAU1oC,EAAMurD,IAAIv+C,KAE7D,CACL,GAAIhN,EAAMurD,IAAK,CACbjsC,IAAIisC,EAAMlZ,GAAiB1I,EAAMA,EAAK3hD,MAAM43B,IAAK5f,EAAMurD,KACnDA,IAAQA,EAAI5mC,GAAGglB,EAAK3hD,MAAM+3B,YAAY4pB,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAG5C,aAAakrC,IAErF,OANAmM,EAAS,CAAC3wC,MAAOwkC,EAAIx3C,KAAM4jD,KAAMpM,EAAIvpC,GAAI41C,KAAMrM,EAAIvpC,IASvD2nB,EAAKouB,iBAIDpuB,EAAK3hD,MAAM+3B,UAAUhM,KAAO41B,EAAK3hD,MAAM+3B,UAAUiC,IACjD01C,EAAO3wC,OAAS2wC,EAAOE,MACvBjuB,EAAK3hD,MAAM+3B,qBAAqB,kBAC9B23C,EAAO3wC,MAAQ4iB,EAAK3hD,MAAM+3B,UAAUhM,MAAQ2jD,EAAO3wC,OAAS4iB,EAAK3hD,MAAM+3B,UAAUhM,KAAO,EAC1F2jD,EAAO3wC,MAAQ4iB,EAAK3hD,MAAM+3B,UAAUhM,KAC3B2jD,EAAOC,KAAOhuB,EAAK3hD,MAAM+3B,UAAUiC,IAAM01C,EAAOC,MAAQhuB,EAAK3hD,MAAM+3B,UAAUiC,GAAK,IAC3F01C,EAAOE,MAASjuB,EAAK3hD,MAAM+3B,UAAUiC,GAAK01C,EAAOC,KACjDD,EAAOC,KAAOhuB,EAAK3hD,MAAM+3B,UAAUiC,KAOnCnrB,EAAQwuD,IAAMxuD,EAAQyuD,YAAc,IAAMoS,EAAOE,MAAQF,EAAO3wC,MAAQ,GACxE2wC,EAAOC,MAAQD,EAAO3wC,OAAS2wC,EAAO3wC,MAAQ/mB,EAAM+T,MACmC,MAAvF/T,EAAM4f,IAAIqH,YAAYywC,EAAO3wC,MAAQ/mB,EAAM+T,KAAO,EAAG2jD,EAAO3wC,MAAQ/mB,EAAM+T,KAAO,KACnF2jD,EAAO3wC,QACP2wC,EAAOC,OACPD,EAAOE,QAGTt4C,IAGI04C,EAHAz4C,EAAQvf,EAAM4f,IAAIq4C,eAAeP,EAAO3wC,MAAQ/mB,EAAM+T,MACtDyL,EAAMxf,EAAM4f,IAAIq4C,eAAeP,EAAOE,KAAO53D,EAAM+T,MACnDmkD,EAAe34C,EAAM0L,WAAWzL,IAAQD,EAAM/zB,OAAOu/B,cAIzD,IAAMl0B,EAAQ+uD,KAAOjc,EAAKwuB,aAAexgD,KAAKG,MAAQ,OAC9CogD,GAAgBzB,EAAWh7D,MAAI,SAACpB,GAAA,MAAmB,OAAdA,EAAE47B,UAAmC,KAAd57B,EAAE47B,eAC/DiiC,GAAgB34C,EAAMhiB,IAAMyC,EAAM4f,IAAI36B,QAAQ2Y,OAC9Co6D,EAAU,YAAUhvB,SAAShpC,EAAM4f,IAAI3e,QAAQse,EAAMhiB,IAAM,GAAI,GAAG,KACnEy6D,EAAQhrD,MAAQwS,EAAIjiB,MACtBosC,EAAKke,SAAS,iBAAe,SAAEhiE,GAAA,OAAKA,EAAE8jD,EAAMwd,EAAS,GAAI,aAC3Dxd,EAAKwuB,aAAe,OAItB,GAAIxuB,EAAK3hD,MAAM+3B,UAAU2oB,OAASgvB,EAAO3wC,OAqG3C,SAAuBqxC,EAAKrxC,EAAOD,EAAKuxC,EAAWC,GACjD,IAAKD,EAAU7sE,OAAOmtC,aAElB7R,EAAMC,GAASuxC,EAAQ/6D,IAAM86D,EAAU96D,KAEvCg7D,GAAsBF,GAAW,GAAM,GAASC,EAAQ/6D,IAC1D,OAAO,EAET+hB,IAAIg3B,EAAS8hB,EAAIn3D,QAAQ8lB,GAEzB,GAAIuvB,EAAO5sB,aAAe4sB,EAAO9qD,OAAOvG,QAAQ2Y,OAAS04C,EAAO9qD,OAAOmtC,YACrE,OAAO,EACTrZ,IAAIk5C,EAAQJ,EAAIn3D,QAAQs3D,GAAsBjiB,GAAQ,GAAM,IAE5D,IAAKkiB,EAAMhtE,OAAOmtC,aAAe6/B,EAAMj7D,IAAMupB,GACzCyxC,GAAsBC,GAAO,GAAM,GAAS1xC,EAC9C,OAAO,EAGT,OAAOuxC,EAAU7sE,OAAOvG,QAAQ0iC,IAAI0wC,EAAU3uC,cAAc/E,GAAG6zC,EAAMhtE,OAAOvG,SAvHxEwzE,CAAc74C,EAAK83C,EAAO3wC,MAAO2wC,EAAOC,KAAMp4C,EAAOC,IACrDmqB,EAAKke,SAAS,iBAAe,SAAEhiE,GAAA,OAAKA,EAAE8jD,EAAMwd,EAAS,EAAG,iBACtDtwD,EAAQgvD,SAAWhvD,EAAQ6uD,QAAQ/b,EAAK6rB,YAAYkD,+BAH1D,CAeI7hE,EAAQgvD,UAAYqS,GAAgB34C,EAAMwH,SAAWvH,EAAIuH,SAA+B,GAApBvH,EAAIkK,cAAqBnK,EAAMoK,OAASnK,EAAImK,OAChH3pB,EAAMurD,KAAOvrD,EAAMurD,IAAI7iB,QAAU1oC,EAAMurD,IAAIv+C,MAAQhN,EAAMurD,IAAIv+C,MAAQ0qD,EAAOC,OAC9ED,EAAOE,MAAQ,EACfp4C,EAAMxf,EAAM4f,IAAIq4C,eAAeP,EAAOE,KAAO53D,EAAM+T,MACnDve,YAAW,WACTm0C,EAAKke,SAAS,iBAAiB,SAAUhiE,GAAK,OAAOA,EAAE8jD,EAAMwd,EAAS,GAAI,eACzE,KAGL7nC,IAEI2D,EAAIhD,EAAa04C,EAAYC,EAF7BC,EAASnB,EAAO3wC,MAAO+xC,EAAOpB,EAAOC,KAGzC,GAAIO,EACF,GAAI34C,EAAMhiB,KAAOiiB,EAAIjiB,IAGf1G,EAAQwuD,IAAMxuD,EAAQyuD,YAAc,IAA4B,GAAtB/lC,EAAMmK,eAClDigB,EAAK6rB,YAAYkD,2BACjBljE,YAAW,WAAD,OAAOkgE,GAAe/rB,KAAO,KAEzC1mB,EAAK0mB,EAAK3hD,MAAMi7B,GAAG4f,OAAOg2B,EAAQC,GAClC74C,EAAcL,EAAI3e,QAAQy2D,EAAO3wC,OAAOrF,YAAY9B,EAAI3e,QAAQy2D,EAAOC,YAClE,GACLD,EAAOC,MAAQD,EAAOE,OAASgB,EAASh5C,EAAI3e,QAAQy2D,EAAO3wC,UAC1D4xC,EAyCP,SAAsBtrC,EAAK5Q,GAGzB,IAFA6C,IAC2C/1B,EAAMs3B,EAAM3S,EADnD6qD,EAAW1rC,EAAIhe,WAAWoR,MAAOu4C,EAAYv8C,EAAKpN,WAAWoR,MAC7DwhB,EAAQ82B,EAAUv8C,EAAUw8C,EACvBv2E,EAAI,EAAGA,EAAIu2E,EAAUr2E,OAAQF,IAAKw/C,EAAQ+2B,EAAUv2E,GAAGw+B,cAAcghB,GAC9E,IAAK3iB,IAAI78B,EAAI,EAAGA,EAAIs2E,EAASp2E,OAAQF,IAAK+5B,EAAUu8C,EAASt2E,GAAGw+B,cAAczE,GAC9E,GAAoB,GAAhBylB,EAAMt/C,QAAiC,GAAlB65B,EAAQ75B,OAC/Bk+B,EAAOohB,EAAM,GACb14C,EAAO,MACP2kB,EAAS,SAAAqT,GAAA,OAAQA,EAAKV,KAAKA,EAAKC,SAASS,EAAKd,aACzC,IAAoB,GAAhBwhB,EAAMt/C,QAAiC,GAAlB65B,EAAQ75B,OAKtC,OAAO,KAJPk+B,EAAOrE,EAAQ,GACfjzB,EAAO,SACP2kB,EAAS,SAAAqT,GAAA,OAAQA,EAAKV,KAAKA,EAAKI,cAAcM,EAAKd,SAKrD,IADAnB,IAAIY,EAAU,GACLz9B,EAAI,EAAGA,EAAIg6B,EAAKuL,WAAYvlC,IAAKy9B,EAAQvpB,KAAKuX,EAAOuO,EAAKoK,MAAMpkC,KACzE,GAAI,WAASsxB,KAAKmM,GAASyE,GAAG0I,GAAM,MAAO,MAACxM,EAAI,KAAEt3B,GA3DhC0vE,CAAa15C,EAAM/zB,OAAOvG,QAAQ0iC,IAAIpI,EAAMmK,aAAclK,EAAIkK,cACjDkvC,EAAOptE,OAAOvG,QAAQ0iC,IAAIixC,EAAOlvC,aAAcguC,EAAOC,KAAOiB,EAAO7xC,WAE/F9D,EAAK0mB,EAAK3hD,MAAMi7B,GACO,OAAnB01C,EAAWpvE,KAAe05B,EAAG+e,QAAQ62B,EAAQC,EAAMH,EAAW93C,MAC7DoC,EAAGof,WAAWw2B,EAAQC,EAAMH,EAAW93C,WACvC,GAAItB,EAAM/zB,OAAOq7B,MAAMtH,EAAM1qB,SAASwyB,QAAU9H,EAAM1qB,SAAW2qB,EAAI3qB,SAAW2qB,EAAIsK,WAAa,EAAI,GAAI,CAE9GxK,IAAIyC,EAAOxC,EAAM/zB,OAAOy7B,YAAY1H,EAAMmK,aAAclK,EAAIkK,cAC5D,GAAIigB,EAAKke,SAAS,mBAAiB,SAAEhiE,GAAA,OAAKA,EAAE8jD,EAAMkvB,EAAQC,EAAM/2C,MAAQ,OACxEkB,EAAK0mB,EAAK3hD,MAAMi7B,GAAGnB,WAAWC,EAAM82C,EAAQC,GAMhD,GAFK71C,IACHA,EAAK0mB,EAAK3hD,MAAMi7B,GAAGl+B,QAAQ8zE,EAAQC,EAAM94D,EAAM4f,IAAIr7B,MAAMmzE,EAAO3wC,MAAQ/mB,EAAM+T,KAAM2jD,EAAOE,KAAO53D,EAAM+T,QACtG/T,EAAMurD,IAAK,CACbjsC,IAAIisC,EAAMlZ,GAAiB1I,EAAM1mB,EAAGrD,IAAK5f,EAAMurD,KAM3CA,KAAS10D,EAAQ6uD,QAAU7uD,EAAQgvD,SAAWlc,EAAKsL,WAAasW,EAAI9pC,QACxD8pC,EAAIv+C,MAAQ6rD,GAAUtN,EAAIv+C,MAAQiW,EAAG7C,QAAQ7kB,IAAIu9D,GAAQ,IAC5DjiE,EAAQwuD,IAAMkG,EAAI9pC,OAAS8pC,EAAIv+C,MAAQ6rD,IAClD51C,EAAG5C,aAAakrC,GAEhBtrC,GAAagD,EAAGvC,YAAYT,GAChC0pB,EAAKuB,SAASjoB,EAAGP,oBAGnB,SAAS2vB,GAAiB1I,EAAM/pB,EAAKs5C,GACnC,OAAI93E,KAAKsvB,IAAIwoD,EAAUxwB,OAAQwwB,EAAUlsD,MAAQ4S,EAAI36B,QAAQ2Y,KAAa,KACnEu7D,GAAiBxvB,EAAM/pB,EAAI3e,QAAQi4D,EAAUxwB,QAAS9oB,EAAI3e,QAAQi4D,EAAUlsD,OAkDrF,SAASurD,GAAsB34B,EAAMw5B,EAASC,GAE5C,IADA/5C,IAAIqK,EAAQiW,EAAKjW,MAAO7C,EAAMsyC,EAAUx5B,EAAK9Y,MAAQ8Y,EAAKriC,IACnDosB,EAAQ,IAAMyvC,GAAWx5B,EAAK/V,WAAWF,IAAUiW,EAAKre,KAAKoI,GAAO3B,aACzE2B,IACA7C,IACAsyC,GAAU,EAEZ,GAAIC,EAEF,IADA/5C,IAAIjtB,EAAOutC,EAAKre,KAAKoI,GAAO1B,WAAW2X,EAAK/V,WAAWF,IAChDt3B,IAASA,EAAKi1B,QACnBj1B,EAAOA,EAAKgd,WACZyX,IAGJ,OAAOA,EC1SF,SAASwyC,GAAsB3vB,EAAMplD,GAE1C,IADA+6B,IAAIj0B,EAAU,GAAKpG,EAAA,EAAAA,QAASk5C,EAAA,EAAAA,UAAWpK,EAAA,EAAAA,QAChCoK,EAAY,GAAKpK,EAAU,GAA2B,GAAtB9uC,EAAQ+iC,YAAoD,GAAjC/iC,EAAQoqB,WAAW2Y,YAAiB,CACpGmW,IACApK,IACAzU,IAAIiC,EAAOt8B,EAAQoqB,WACnBhkB,EAAQsL,KAAK4qB,EAAKh4B,KAAKtI,KAAMsgC,EAAK+H,OAAS/H,EAAKh4B,KAAKqvC,aAAerX,EAAK+H,MAAQ,MACjFrkC,EAAUs8B,EAAKt8B,QAGjBq6B,IAAIi6C,EAAa5vB,EAAKke,SAAS,wBAA0B,gBAAc52B,WAAW0Y,EAAK3hD,MAAMi6B,QACzFrC,EAAM45C,KAAe1lC,EAAOlU,EAAIllB,cAAc,OAClDo5B,EAAKrkC,YAAY8pE,EAAWngC,kBAAkBn0C,EAAS,CAACd,SAAUy7B,KAGlE,IADAN,IAAkCszC,EAA9BvjD,EAAaykB,EAAKzkB,WACfA,GAAqC,GAAvBA,EAAW+lB,WAAkBw9B,EAAY6G,GAAQpqD,EAAW4mB,SAAS98B,iBAAiB,CACzG,IAAKmmB,IAAI78B,EAAImwE,EAAUjwE,OAAS,EAAGF,GAAK,EAAGA,IAAK,CAE9C,IADA68B,IAAItE,EAAU4E,EAAIllB,cAAck4D,EAAUnwE,IACnCqxC,EAAKzkB,YAAY2L,EAAQvrB,YAAYqkC,EAAKzkB,YACjDykB,EAAKrkC,YAAYurB,GAEnB3L,EAAaykB,EAAKzkB,WASpB,OANIA,GAAqC,GAAvBA,EAAW+lB,UAC3B/lB,EAAWF,aAAa,gBAAoBgvB,EAAS,IAAIpK,EAAO,IAAI30B,KAAKC,UAAUhU,IAK9E,CAAC2kC,IAAK8D,EAAI,KAHN6V,EAAKke,SAAS,2BAAyB,SAAEhiE,GAAA,OAAKA,EAAEtB,OACvDA,EAAMU,QAAQgiC,YAAY,EAAG1iC,EAAMU,QAAQ2Y,KAAM,SAOhD,SAAS87D,GAAmB/vB,EAAM5nB,EAAMxzB,EAAMorE,EAAWnhC,GAC9DlZ,IAAI0Q,EAA8CzrC,EAAzCq1E,EAASphC,EAAShtC,OAAOjC,KAAKo6B,KAAK/f,KAC5C,IAAKrV,IAASwzB,EAAM,OAAO,KAC3BzC,IAAIu6C,EAAS93C,IAAS43C,GAAaC,IAAWrrE,GAC9C,GAAIsrE,EAAQ,CAEV,GADAlwB,EAAKke,SAAS,uBAAqB,SAAEhiE,GAAOk8B,EAAOl8B,EAAEk8B,EAAM63C,GAAUD,MACjEC,EAAQ,OAAO,IAAI,QAAM,WAAS7lD,KAAK41B,EAAK3hD,MAAMi6B,OAAOF,KAAKA,IAAQ,EAAG,GAC7EzC,IAAIlH,EAASuxB,EAAKke,SAAS,uBAAqB,SAAEhiE,GAAA,OAAKA,EAAEk8B,EAAMyW,EAAUmhC,MACrEvhD,EACF7zB,EAAQ6zB,GAER4X,EAAM7rC,SAASuW,cAAc,OAC7BqnB,EAAKl9B,OAAOkD,MAAM,iBAAiBzF,SAAO,SAACq1C,GACzC3H,EAAIvgC,YAAYtL,SAASuW,cAAc,MAAM0zC,YAAczW,WAI/DgS,EAAKke,SAAS,uBAAqB,SAAEhiE,GAAO0I,EAAO1I,EAAE0I,MACrDyhC,EAiHJ,SAAkBzhC,GAChB+wB,IAAIw6C,EAAQ,qBAAqB15E,KAAKmO,GAClCurE,IAAOvrE,EAAOA,EAAKhK,MAAMu1E,EAAM,GAAGn3E,SACtC28B,IAC+DwU,EAD3DkkB,EAAMwhB,KAAc9+D,cAAc,OAClCq/D,EAAW,oCAAoC35E,KAAKmO,GAAao7B,EAAQ,GACzEmK,EAAOimC,GAAYN,GAAQM,EAAS,GAAG5gE,kBACzC5K,EAAOulC,EAAKv4B,KAAG,SAAClB,GAAA,MAAK,IAAMA,EAAI,OAAKjS,KAAK,IAAMmG,EAAOulC,EAAKv4B,KAAG,SAAClB,GAAA,MAAK,KAAOA,EAAI,OAAKq0B,UAAUtmC,KAAK,IACnGuhC,EAAQmK,EAAKnxC,QAEfq1D,EAAIvF,UAAYlkD,EAChB,IAAK+wB,IAAI78B,EAAI,EAAGA,EAAIknC,EAAOlnC,IAAKu1D,EAAMA,EAAI3oC,WAC1C,OAAO2oC,EA5HCgiB,CAASzrE,GAGjB+wB,IAAI26C,EAAcjqC,GAAOA,EAAI5hB,cAAc,mBACvC8rD,EAAYD,GAAe,oBAAoB75E,KAAK65E,EAAYzkC,aAAa,kBACjF,IAAKjxC,EAAO,CACV+6B,IAAIkV,EAASmV,EAAKke,SAAS,oBAAsBle,EAAKke,SAAS,cAAgB,YAAU52B,WAAW0Y,EAAK3hD,MAAMi6B,QAC/G19B,EAAQiwC,EAAOpE,WAAWJ,EAAK,CAACuD,sBAAuBsmC,IAAUK,GAAY7uE,QAASmtC,IAQxF,OALEj0C,EADE21E,EAsHN,SAAoB31E,EAAO8G,GACzB,IAAK9G,EAAMqZ,KAAM,OAAOrZ,EACxB+6B,IAAmDhpB,EAA/C2rB,EAAS19B,EAAMU,QAAQoqB,WAAW9lB,KAAK04B,OAC3C,IAAM3rB,EAAQ8I,KAAKY,MAAM3U,GACzB,MAAM0J,GAAK,OAAOxQ,EAElB,IADK,IAAAU,EAAA,EAAAA,QAASk5C,EAAA,EAAAA,UAAWpK,EAAA,EAAAA,QAChBtxC,EAAI6T,EAAM3T,OAAS,EAAGF,GAAK,EAAGA,GAAK,EAAG,CAC7C68B,IAAI/1B,EAAO04B,EAAOoH,MAAM/yB,EAAM7T,IAC9B,IAAK8G,GAAQA,EAAKkkC,mBAAoB,MACtCxoC,EAAU,WAAS8uB,KAAKxqB,EAAKuG,OAAOwG,EAAM7T,EAAI,GAAIwC,IAClDk5C,IAAapK,IAEf,OAAO,IAAI,QAAM9uC,EAASk5C,EAAWpK,GAjI3BomC,CA2EZ,SAAoB51E,EAAO45C,EAAWpK,GAChCoK,EAAY55C,EAAM45C,YACpB55C,EAAQ,IAAI,QAAM61E,GAAW71E,EAAMU,SAAU,EAAGk5C,EAAW55C,EAAM45C,UAAW,EAAG55C,EAAMwvC,SAAUoK,EAAW55C,EAAMwvC,UAC9GA,EAAUxvC,EAAMwvC,UAClBxvC,EAAQ,IAAI,QAAM61E,GAAW71E,EAAMU,QAAS,EAAG8uC,EAASxvC,EAAMwvC,QAAS,EAAG,GAAIxvC,EAAM45C,UAAWpK,IACjG,OAAOxvC,EAhFc81E,CAAW91E,GAAQ21E,EAAU,IAAKA,EAAU,IAAKA,EAAU,IAEtE,QAAM5pC,QAclB,SAA2B+I,EAAUb,GACnC,GAAIa,EAASrR,WAAa,EAAG,OAAOqR,EACpC,QAAF,cACI/Z,IACIjrB,EADSmkC,EAASjX,KAAKuJ,GACR4N,eAAeF,EAAS3jC,MAAMi2B,IAC7CwvC,OAAA,EAAUj2E,EAAS,GAevB,GAdAg1C,EAAS/2C,SAAO,SAACi/B,GACf,GAAKl9B,EAAL,CACAi7B,IAA0Ci7C,EAAtCzmC,EAAOz/B,EAAMg6B,aAAa9M,EAAKh4B,MACnC,IAAKuqC,EAAM,OAAOzvC,EAAS,KAC3B,GAAIk2E,EAASl2E,EAAO1B,QAAU23E,EAAS33E,QAuB7C,SAAS63E,EAAa1mC,EAAMwmC,EAAU/4C,EAAMk5C,EAAS9wC,GACnD,GAAIA,EAAQmK,EAAKnxC,QAAUgnC,EAAQ2wC,EAAS33E,QAAUmxC,EAAKnK,IAAU2wC,EAAS3wC,GAAQ,CACpFrK,IAAI+I,EAAQmyC,EAAa1mC,EAAMwmC,EAAU/4C,EAAMk5C,EAAQjzC,UAAWmC,EAAQ,GAC1E,GAAItB,EAAO,OAAOoyC,EAAQ1yC,KAAK0yC,EAAQx1E,QAAQ4iC,aAAa4yC,EAAQzyC,WAAa,EAAGK,IAEpF,GADYoyC,EAAQ/hC,eAAe+hC,EAAQzyC,YACjC2F,UAAUhE,GAASmK,EAAKnxC,OAAS,EAAI4+B,EAAKh4B,KAAOuqC,EAAKnK,EAAQ,IACtE,OAAO8wC,EAAQ1yC,KAAK0yC,EAAQx1E,QAAQshC,OAAO,WAASxS,KAAK2mD,GAAan5C,EAAMuS,EAAMnK,EAAQ,OA7BzC6wC,CAAa1mC,EAAMwmC,EAAU/4C,EAAMl9B,EAAOA,EAAO1B,OAAS,GAAI,GAC7G0B,EAAOA,EAAO1B,OAAS,GAAK43E,MACvB,CACDl2E,EAAO1B,SAAQ0B,EAAOA,EAAO1B,OAAS,GA8BlD,SAASg4E,EAAWp5C,EAAMoI,GACxB,GAAa,GAATA,EAAY,OAAOpI,EACvBjC,IAAI+Z,EAAW9X,EAAKt8B,QAAQ4iC,aAAatG,EAAKyG,WAAa,EAAG2yC,EAAWp5C,EAAKiG,UAAWmC,EAAQ,IAC7FkK,EAAOtS,EAAKmX,eAAenX,EAAKyG,YAAYgG,WAAW,WAASvM,OAAO,GAC3E,OAAOF,EAAKwG,KAAKsR,EAAS9S,OAAOsN,IAlCoB8mC,CAAWt2E,EAAOA,EAAO1B,OAAS,GAAI23E,EAAS33E,SAC9F28B,IAAIs7C,EAAUF,GAAan5C,EAAMuS,GACjCzvC,EAAOsS,KAAKikE,GACZvmE,EAAQA,EAAMs5B,UAAUitC,EAAQrxE,KAAMqxE,EAAQtxC,OAC9CgxC,EAAWxmC,OAGXzvC,EAAQ,SAAO,WAAS0vB,KAAK1vB,KAlB1BymC,EAAI0N,EAAS7O,MAAOmB,GAAK,EAAGA,IAAG,C,2BAoBxC,OAAOuO,EApCiBwhC,CAAkBt2E,EAAMU,QAASuzC,IAAW,GAEpEmR,EAAKke,SAAS,mBAAiB,SAAEhiE,GAAOtB,EAAQsB,EAAEtB,MAC3CA,EAoCT,SAASm2E,GAAan5C,EAAMuS,EAAM/f,Q,UAAO,GACvC,IAAKuL,IAAI78B,EAAIqxC,EAAKnxC,OAAS,EAAGF,GAAKsxB,EAAMtxB,IACvC8+B,EAAOuS,EAAKrxC,GAAGqN,OAAO,KAAM,WAASikB,KAAKwN,IAC5C,OAAOA,EAsBT,SAAS64C,GAAW/gC,EAAUob,EAAM1gC,EAAMiO,EAAI2H,EAAOoK,GACnDzU,IAAIiC,EAAOkzB,EAAO,EAAIpb,EAAShqB,WAAagqB,EAAS7R,UAAWa,EAAQ9G,EAAKt8B,QAK7E,OAJI0kC,EAAQ3H,EAAK,IAAGqG,EAAQ+xC,GAAW/xC,EAAOosB,EAAM1gC,EAAMiO,EAAI2H,EAAQ,EAAGoK,IACrEpK,GAAS5V,IACXsU,EAAQosB,EAAO,EAAIlzB,EAAKmX,eAAe,GAAG1K,WAAW3F,EAAOgR,EAASrR,WAAa,GAAK+L,GAAWpK,GAAOpD,OAAO8B,GAC5GA,EAAM9B,OAAOhF,EAAKmX,eAAenX,EAAKyG,YAAYgG,WAAW,WAASvM,OAAO,KAC5E4X,EAASxR,aAAa4sB,EAAO,EAAI,EAAIpb,EAASrR,WAAa,EAAGzG,EAAKwG,KAAKM,IAcjF5I,IAAMg6C,GAAU,CACdqB,MAAO,CAAC,SACRC,MAAO,CAAC,SACR9nC,MAAO,CAAC,SACR+nC,QAAS,CAAC,SACVC,SAAU,CAAC,SACXC,IAAK,CAAC,QAAS,YACfj4C,GAAI,CAAC,QAAS,SACdk4C,GAAI,CAAC,QAAS,QAAS,MACvBC,GAAI,CAAC,QAAS,QAAS,OAGrBC,GAAe,KACnB,SAAS7B,KACP,OAAO6B,KAAiBA,GAAel3E,SAASm3E,eAAeC,mBAAmB,UCjKpF97C,IAAM+7C,GAAiB,CACrBC,WAAW,EACXC,eAAe,EACfC,uBAAuB,EACvBzqB,YAAY,EACZ0qB,mBAAmB,EACnBC,SAAS,GAGLC,GAAcjlE,EAAQwuD,IAAMxuD,EAAQyuD,YAAc,GAElDyW,GACJ,WACEv6E,KAAK0sE,WAAa1sE,KAAK2sE,aAAe3sE,KAAKyqE,UAAYzqE,KAAK2qE,YAAc,M,aAG5E7/D,IAAA,SAAIi/D,GACF/pE,KAAK0sE,WAAa3C,EAAI2C,WAAY1sE,KAAK2sE,aAAe5C,EAAI4C,aAC1D3sE,KAAKyqE,UAAYV,EAAIU,UAAWzqE,KAAK2qE,YAAcZ,EAAIY,a,aAGzDxnC,GAAA,SAAG4mC,GACD,OAAOA,EAAI2C,YAAc1sE,KAAK0sE,YAAc3C,EAAI4C,cAAgB3sE,KAAK2sE,cACnE5C,EAAIU,WAAazqE,KAAKyqE,WAAaV,EAAIY,aAAe3qE,KAAK2qE,aAI1D,IAAM6P,GACX,SAAYryB,EAAMsyB,G,WAChBz6E,KAAKmoD,KAAOA,EACZnoD,KAAKy6E,gBAAkBA,EACvBz6E,KAAKmU,MAAQ,GACbnU,KAAK06E,cAAgB,EACrB16E,KAAKk4B,SAAWp4B,OAAO66E,kBACrB,IAAI76E,OAAO66E,kBAAgB,SAACC,GAC1B,IAAK98C,IAAI78B,EAAI,EAAGA,EAAI25E,EAAUz5E,OAAQF,IAAKjB,EAAKmU,MAAMgB,KAAKylE,EAAU35E,IAKjEoU,EAAQwuD,IAAMxuD,EAAQyuD,YAAc,IAAM8W,EAAU3gE,MAChE,SAAUuL,GAAA,MAAe,aAAVA,EAAEzd,MAAuByd,EAAEq1D,aAAa15E,QAC9B,iBAAVqkB,EAAEzd,MAA2Byd,EAAEqoD,SAAS1sE,OAASqkB,EAAEngB,OAAOivC,UAAUnzC,UACzEnB,EAAK86E,YAEL96E,EAAK+6E,WAEX/6E,KAAKg7E,iBAAmB,IAAIT,GACxBD,KACFt6E,KAAKi7E,WAAU,SAAG1nE,GAChBvT,EAAKmU,MAAMgB,KAAK,CAAC9P,OAAQkO,EAAElO,OAAQ0C,KAAM,gBAAiB8lE,SAAUt6D,EAAE2nE,YACtEl7E,EAAK86E,cAGT96E,KAAKm7E,kBAAoBn7E,KAAKm7E,kBAAkBj7E,KAAKF,MACrDA,KAAKo7E,6BAA8B,G,aAGrCN,UAAA,W,WACM96E,KAAK06E,aAAe,IACtB16E,KAAK06E,aAAe56E,OAAOkU,YAAU,WAAShU,EAAK06E,cAAgB,EAAG16E,EAAK+6E,UAAW,M,aAG1FM,WAAA,WACMr7E,KAAK06E,cAAgB,IACvB56E,OAAOmU,aAAajU,KAAK06E,cACzB16E,KAAK06E,cAAgB,EACrB16E,KAAK+6E,U,aAITx1C,MAAA,WACMvlC,KAAKk4B,UACPl4B,KAAKk4B,SAASojD,QAAQt7E,KAAKmoD,KAAK3Z,IAAKwrC,IACnCM,IACFt6E,KAAKmoD,KAAK3Z,IAAI/sB,iBAAiB,2BAA4BzhB,KAAKi7E,YAClEj7E,KAAKu7E,oB,aAGPjgE,KAAA,W,WACE,GAAItb,KAAKk4B,SAAU,CACjB4F,IAAI09C,EAAOx7E,KAAKk4B,SAASujD,cACzB,GAAID,EAAKr6E,OAAQ,CACf,IAAK28B,IAAI78B,EAAI,EAAGA,EAAIu6E,EAAKr6E,OAAQF,IAAKjB,KAAKmU,MAAMgB,KAAKqmE,EAAKv6E,IAC3DnB,OAAOkU,YAAU,kBAAOhU,EAAK+6E,UAAS,IAExC/6E,KAAKk4B,SAASwjD,aAEZpB,IAAat6E,KAAKmoD,KAAK3Z,IAAIsW,oBAAoB,2BAA4B9kD,KAAKi7E,YACpFj7E,KAAK27E,uB,aAGPJ,iBAAA,WACEv7E,KAAKmoD,KAAK3Z,IAAI+G,cAAc9zB,iBAAiB,kBAAmBzhB,KAAKm7E,oB,aAGvEQ,oBAAA,WACE37E,KAAKmoD,KAAK3Z,IAAI+G,cAAcuP,oBAAoB,kBAAmB9kD,KAAKm7E,oB,aAG1EjE,yBAAA,W,WACEl3E,KAAKo7E,6BAA8B,EACnCpnE,YAAW,WAAD,OAAOhU,EAAKo7E,6BAA8B,IAAO,K,aAG7DD,kBAAA,WACE,MhD8CiC,EgD9CPn7E,KAAKmoD,MhD+CxB,UAAY,EAAK,KAAK,eAAiB,EAAK,MAC9C,GAAa,GgDhDlB,ChD8CG,IAA8B,EgD7CjC,GAAInoD,KAAKo7E,4BAA6B,OAAOlH,GAAel0E,KAAKmoD,MAIjE,GAAI9yC,EAAQwuD,IAAMxuD,EAAQyuD,YAAc,KAAO9jE,KAAKmoD,KAAK3hD,MAAM+3B,UAAU0B,MAAO,CAC9EnC,IAAIisC,EAAM/pE,KAAKmoD,KAAK6f,KAAKqC,eAEzB,GAAIN,EAAIU,WAAa5F,EAAqBkF,EAAIU,UAAWV,EAAIY,YAAaZ,EAAI2C,WAAY3C,EAAI4C,cAC5F,OAAO3sE,KAAK86E,YAEhB96E,KAAK+6E,U,aAGP9G,gBAAA,WACEj0E,KAAKg7E,iBAAiBlwE,IAAI9K,KAAKmoD,KAAK6f,KAAKqC,iB,aAG3CuR,sBAAA,SAAsB7R,GACpB,GAAsB,GAAlBA,EAAItE,WAAiB,OAAO,EAChC3nC,IAAI+9C,EAAY9R,EAAIrE,WAAW,GAAGoW,wBAC9Bz6C,EAAOrhC,KAAKmoD,KAAKuJ,QAAQ6W,YAAYsT,GACzC,OAAIx6C,GAAQA,EAAK0rC,eAAe,CAAChlE,KAAM,YAAa1C,OAA8B,GAAtBw2E,EAAUjoC,SAAgBioC,EAAUhvD,WAAagvD,KAC3G77E,KAAKi0E,mBACE,QAFT,G,aAMF8G,MAAA,WACE,GAAK/6E,KAAKmoD,KAAKuJ,WAAW1xD,KAAK06E,cAAgB,GAA/C,CACA58C,IAAI88C,EAAY56E,KAAKk4B,SAAWl4B,KAAKk4B,SAASujD,cAAgB,GAC1Dz7E,KAAKmU,MAAMhT,SACby5E,EAAY56E,KAAKmU,MAAMtJ,OAAO+vE,GAC9B56E,KAAKmU,MAAMhT,OAAS,GAGtB28B,IAAIisC,EAAM/pE,KAAKmoD,KAAK6f,KAAKqC,eACrBgL,GAAUr1E,KAAKo7E,8BAAgCp7E,KAAKg7E,iBAAiB73C,GAAG4mC,IAAQgS,GAAa/7E,KAAKmoD,QAAUnoD,KAAK47E,sBAAsB7R,GAEvIx3C,GAAQ,EAAGiO,GAAM,EAAGw0C,GAAW,EAAOv0B,EAAQ,GAClD,GAAIzgD,KAAKmoD,KAAK9B,SACZ,IAAKvoB,IAAI78B,EAAI,EAAGA,EAAI25E,EAAUz5E,OAAQF,IAAK,CACzC68B,IAAIj7B,EAAS7C,KAAKg8E,iBAAiBpB,EAAU35E,GAAIw/C,GAC7C59C,IACF0vB,EAAOA,EAAO,EAAI1vB,EAAO0vB,KAAO3yB,KAAKiJ,IAAIhG,EAAO0vB,KAAMA,GACtDiO,EAAKA,EAAK,EAAI39B,EAAO29B,GAAK5gC,KAAKsvB,IAAIrsB,EAAO29B,GAAIA,GAC1C39B,EAAOmyE,WAAUA,GAAW,IAKtC,GAAI3/D,EAAQ2uD,OAASvjB,EAAMt/C,OAAS,EAAG,CACrC28B,IAAIm+C,EAAMx7B,EAAMzmC,QAAM,SAACnB,GAAA,MAAmB,MAAdA,EAAE47B,YAC9B,GAAkB,GAAdwnC,EAAI96E,OAAa,CACd,IAAA+B,EAAA,KAAGC,EAAA,KACJD,EAAE2pB,YAAc3pB,EAAE2pB,WAAWA,YAAc1pB,EAAE0pB,WAAY1pB,EAAEwpB,SAC1DzpB,EAAEypB,WAIP4F,GAAQ,GAAK8iD,KACX9iD,GAAQ,IACVvyB,KAAKmoD,KAAKuJ,QAAQub,UAAU16C,EAAMiO,GAyD1C,SAAkB2nB,GAChB,GAAI+zB,GAAY,OAChBA,IAAa,EACgC,UAAzCn2B,iBAAiBoC,EAAK3Z,KAAK2tC,YAC7B1zE,QAAO,KAAS,4KA5DZ2zE,CAASp8E,KAAKmoD,OAEhBnoD,KAAKy6E,gBAAgBloD,EAAMiO,EAAIw0C,EAAUv0B,GACrCzgD,KAAKmoD,KAAKuJ,QAAQwZ,MAAOlrE,KAAKmoD,KAAKsE,YAAYzsD,KAAKmoD,KAAK3hD,OACnDxG,KAAKg7E,iBAAiB73C,GAAG4mC,IAAMmK,GAAel0E,KAAKmoD,S,aAIjE6zB,iBAAA,SAAiBpO,EAAKntB,GAEpB,GAAIA,EAAMttC,QAAQy6D,EAAIvoE,SAAW,EAAG,OAAO,KAC3Cy4B,IAAIuD,EAAOrhC,KAAKmoD,KAAKuJ,QAAQ6W,YAAYqF,EAAIvoE,QAC7C,GAAgB,cAAZuoE,EAAI7lE,OACHs5B,GAAQrhC,KAAKmoD,KAAKuJ,SAAgC,mBAArBkc,EAAIyO,eAEX,SAArBzO,EAAIyO,gBAA6BzO,EAAIC,WAAaD,EAAIvoE,OAAO2uC,aAAa,UAC9E,OAAO,KACT,IAAK3S,GAAQA,EAAK0rC,eAAea,GAAM,OAAO,KAE9C,GAAgB,aAAZA,EAAI7lE,KAAqB,CAC3B+1B,IAAI7C,EAAO2yC,EAAIp5B,gBAAiB3jC,EAAO+8D,EAAI94B,YAC3C,GAAIz/B,EAAQwuD,IAAMxuD,EAAQyuD,YAAc,IAAM8J,EAAIqH,WAAW9zE,OAG3D,IAAK28B,IAAI78B,EAAI,EAAGA,EAAI2sE,EAAIqH,WAAW9zE,OAAQF,IAAK,CAChD,IAAR,EAA+C2sE,EAAIqH,WAAWh0E,GAA/CuzC,EAAA,EAAAA,gBAAiBM,EAAA,EAAAA,cACjBN,GAAmBt/B,MAAM7U,UAAU8S,QAAQ3S,KAAKotE,EAAIqH,WAAYzgC,GAAmB,KAAGvZ,EAAOuZ,KAC7FM,GAAe5/B,MAAM7U,UAAU8S,QAAQ3S,KAAKotE,EAAIqH,WAAYngC,GAAe,KAAGjkC,EAAOikC,GAQ9F,IALAhX,IAAIouC,EAAajxC,GAAQA,EAAKpO,YAAc+gD,EAAIvoE,OAC1Cs/D,EAAS1pC,GAAQ,EAAI,EACvB1I,EAAO8O,EAAKsqC,gBAAgBiC,EAAIvoE,OAAQ6mE,GAAa,GACrDC,EAAWt7D,GAAQA,EAAKgc,YAAc+gD,EAAIvoE,OACxCs/D,EAAS9zD,GAAQ+8D,EAAIvoE,OAAOooB,WAAWtsB,OACpCF,EAAI,EAAGA,EAAI2sE,EAAIqH,WAAW9zE,OAAQF,IAAKw/C,EAAMtrC,KAAKy4D,EAAIqH,WAAWh0E,IAE1E,MAAO,MAACsxB,EAAI,GADH8O,EAAKsqC,gBAAgBiC,EAAIvoE,OAAQ8mE,EAAU,IAE/C,MAAgB,cAAZyB,EAAI7lE,KACN,CAACwqB,KAAM8O,EAAKwnC,WAAaxnC,EAAKynC,OAAQtoC,GAAIa,EAAKqqC,SAAWrqC,EAAKynC,QAE/D,CACLv2C,KAAM8O,EAAKwnC,WACXroC,GAAIa,EAAKqqC,SAKTsJ,SAAUpH,EAAIvoE,OAAOivC,WAAas5B,EAAIC,WAM9C/vC,IAAIo+C,IAAa,ECrNjBj+C,IAAM,GAAW,GAAI,GAAe,GAyCpC,SAAS,GAAmB,EAAM,GAChC,EAAK,oBAAsB,EAC3B,EAAK,kBAAoB,KAAK,MAWzB,SAAS,GAAgB,GAC9B,EAAK,SAAS,mBAAiB,SAAE,GAC/B,IAAKH,IAAI,KAAQ,EAAsB,EAAK,cAAc,IACxD,EAAK,IAAI,iBAAiB,EAAM,EAAK,cAAc,GAAK,SAAG,UAAS,GAAiB,EAAM,QAIjG,SAAS,GAAiB,EAAM,GAC5B,OAAK,EAAK,SAAS,mBAAiB,SAAE,GACtCA,IAAI,EAAU,EAAS,EAAM,MAC7B,QAAO,IAAU,EAAQ,EAAM,IAAU,EAAM,qBAoEnD,SAAS,GAAY,GAAS,MAAO,CAAC,KAAM,EAAM,QAAS,IAAK,EAAM,SAOtE,SAAS,GAAoB,EAAM,EAAU,EAAK,EAAQ,GACtD,IAAa,GAAX,EAAc,OAAO,EAEzB,IADEA,IAAE,EAAO,EAAK,MAAM,IAAI,QAAQ,GACpC,cACI,GAAI,EAAK,SAAS,GAAQ,SAAE,UAAK,EAAI,EAAK,MAAQ,EAAE,EAAM,EAAK,EAAK,UAAW,EAAK,OAAO,GAAI,GAAO,GACpD,EAAE,EAAM,EAAK,EAAK,KAAK,GAAI,EAAK,OAAO,GAAI,GAAO,MAClG,UAAO,IAHF78B,EAAI,EAAK,MAAQ,EAAG,EAAI,EAAG,IAAG,C,2BAKrC,OAAK,EAGT,SAAS,GAAgB,EAAM,EAAW,GACnC,EAAK,SAAS,EAAK,QACtB68B,IAAE,EAAK,EAAK,MAAM,GAAG,aAAa,GACtB,WAAV,GAAqB,EAAG,QAAQ,WAAW,GAC7C,EAAG,SAAS,GAuChB,SAAS,GAAkB,EAAM,EAAK,EAAQ,EAAO,GACnD,OAAO,GAAoB,EAAM,gBAAiB,EAAK,EAAQ,IAC7D,EAAK,SAAS,eAAa,SAAE,UAAK,EAAE,EAAM,EAAK,QAC9C,EA7BL,SAA2B,EAAM,GAC7B,IAAa,GAAX,EAAc,OAAO,EACvBA,IAA8B,EAAc,EAA1C,EAAM,EAAK,MAAM,UACjB,aAAe,kBAAe,EAAe,EAAI,MAGnD,IADAA,IAAE,EAAOqqB,EAAK,MAAM,IAAI,QAAQ,GACzB,EAAI,EAAK,MAAQ,EAAG,EAAI,EAAG,IAAK,CACvCrqB,IAAI,EAAO,EAAI,EAAK,MAAQ,EAAK,UAAY,EAAK,KAAK,GACvD,GAAI,gBAAc,aAAa,GAAO,CAGlC,EAFE,GAAgB,EAAI,MAAM,MAAQ,GAClC,GAAK,EAAI,MAAM,OAAS,EAAK,OAAO,EAAI,MAAM,MAAQ,IAAM,EAAI,MAAM,IAC7D,EAAK,OAAO,EAAI,MAAM,OAEtB,EAAK,OAAO,GACzB,OAIJ,OAAgB,MAAZ,IACF,GAAgB,EAAM,gBAAc,OAAO,EAAK,MAAM,IAAK,GAAW,YAC/D,GASO,CAAkB,EAAM,GAvC1C,SAA2B,EAAM,GAC/B,IAAe,GAAX,EAAc,OAAO,EACzBA,IAAI,EAAO,EAAK,MAAM,IAAI,QAAQ,GAAS,EAAO,EAAK,UACvD,SAAI,GAAQ,EAAK,QAAU,gBAAc,aAAa,MACpD,GAAgB,EAAM,IAAI,gBAAc,GAAO,YACxC,GAkCyC,CAAkB,EAAM,IAG5E,SAAS,GAAkB,EAAM,EAAK,EAAQ,GAC5C,OAAO,GAAoB,EAAM,sBAAuB,EAAK,EAAQ,IACnE,EAAK,SAAS,qBAAmB,SAAE,UAAK,EAAE,EAAM,EAAK,MAGzD,SAAS,GAAkB,EAAM,EAAK,EAAQ,GAC5C,OAAO,GAAoB,EAAM,sBAAuB,EAAK,EAAQ,IACnE,EAAK,SAAS,qBAAmB,SAAE,UAAK,EAAE,EAAM,EAAK,OAIzD,SAA4B,EAAM,GAChCA,IAAI,EAAM,EAAK,MAAM,IACrB,IAAe,GAAX,EACF,QAAI,EAAI,gBACN,GAAgB,EAAM,gBAAc,OAAO,EAAK,EAAG,EAAI,QAAQ,MAAO,YAC/D,GAMX,IADAA,IAAI,EAAO,EAAI,QAAQ,GACd,EAAI,EAAK,MAAQ,EAAG,EAAI,EAAG,IAAK,CACvCA,IAAI,EAAO,EAAI,EAAK,MAAQ,EAAK,UAAY,EAAK,KAAK,GACnD,EAAU,EAAK,OAAO,GAC1B,GAAI,EAAK,cACP,GAAgB,EAAM,gBAAc,OAAO,EAAK,EAAU,EAAG,EAAU,EAAI,EAAK,QAAQ,MAAO,eAC5F,KAAI,gBAAc,aAAa,GAGlC,SAFA,GAAgB,EAAM,gBAAc,OAAO,EAAK,GAAU,WAG5D,OAAO,GAvBP,CAAmB,EAAM,GA2B7B,SAAS,GAAc,GACrB,OAAO,GAAe,GAvJxB,GAAa,QAAO,SAAI,EAAM,GAE1B,GADA,EAAG,SAA4B,IAAjB,EAAM,SAAiB,EAAM,UACzC,GAAoB,EAAM,GAQ9B,GAPE,EAAG,YAAY,aACf,EAAG,YAAc,EAAM,QACvB,EAAG,gBAAkB,KAAK,OAKxBzoB,EAAQ,KAAwB,IAAjB,EAAM,SAAkB,EAAM,SAAY,EAAM,QAAW,EAAM,QASzE,EAAK,SAAS,iBAAe,SAAE,UAAK,EAAE,EAAM,OAAW,GAAe,EAAM,GACrF,EAAM,iBAEN,GAAmB,EAAM,WAZkE,CAC3FyoB,IAAI,EAAM,KAAK,MACf,EAAK,aAAe,EACpB,EAAK,4BAA8B,YAAU,WACvC,EAAK,cAAgB,IACvB,EAAK,SAAS,iBAAe,SAAE,UAAK,EAAE,EAAM,EAAS,GAAI,aACzD,EAAK,aAAe,KAErB,OAQP,GAAa,MAAK,SAAI,EAAM,GACT,IAAb,EAAE,UAAe,EAAK,UAAW,IAGvC,GAAa,SAAQ,SAAI,EAAM,GAC3B,KAAE,GAAoB,EAAM,KAAW,EAAM,UAC3C,EAAM,UAAY,EAAM,QAAUzoB,EAAQ,KAAO,EAAM,SAE3D,GAAI,EAAK,SAAS,kBAAgB,SAAE,UAAK,EAAE,EAAM,MAC/C,EAAM,qBADR,CAKEyoB,IAAE,EAAM,EAAK,MAAM,UACnB,KAAI,aAAe,iBAAmB,EAAI,MAAM,WAAW,EAAI,MAAM,CACrEA,IAAI,EAAO,OAAO,aAAa,EAAM,UAChC,EAAK,SAAS,mBAAiB,SAAE,UAAK,EAAE,EAAM,EAAI,MAAM,IAAK,EAAI,IAAI,IAAK,OAC7E,EAAK,SAAS,EAAK,MAAM,GAAG,WAAW,GAAM,kBAC/C,EAAM,oBA8GVG,IAAM,GAAqB5oB,EAAQ,IAAM,UAAY,UAErD,GAAS,UAAS,SAAI,EAAM,GAC1B,EAAK,SAAW,EAAM,SACtByoB,IAAI,EAAU,GAAc,GACxB,EAAM,KAAK,MAAO,EAAO,cACzB,EAAM,EAAK,UAAU,KAAO,KA9GlC,SAAgB,EAAO,GACrBA,IAAI,EAAK,EAAM,EAAI,EAAM,QAAS,EAAK,EAAM,EAAI,EAAM,QACvD,OAAO,EAAK,EAAK,EAAK,EAAK,IA4GY,CAAO,EAAO,EAAK,aAAe,EAAM,MAClD,eAAvB,EAAK,UAAU,KAAuB,EAAO,cACjB,eAAvB,EAAK,UAAU,OAAuB,EAAO,gBAExD,EAAK,UAAY,CAAC,KAAM,EAAK,EAAG,EAAM,QAAS,EAAG,EAAM,QAAO,KAAE,GAEjEA,IAAI,EAAM,EAAK,YAAY,GAAY,IAClC,IAEO,eAAR,EACF,EAAK,UAAY,IAAI,GAAU,EAAM,EAAK,EAAO,IACjC,eAAR,EAAwB,GAAoB,IAAmB,EAAM,EAAI,IAAK,EAAI,OAAQ,GAClG,EAAM,iBAEN,GAAmB,EAAM,aAG7B,IAAM,GACJ,SAAY,EAAM,EAAK,EAAO,G,IASxB,EAAY,E,OAChB,GATA,KAAK,KAAO,EACZ,KAAK,SAAW,EAAK,MAAM,IAC3B,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,QAAU,EACf,KAAK,WAAa,EAAM,IACxB,KAAK,aAAe,EAAM,SAGtB,EAAI,QAAU,EAChB,EAAa,EAAK,MAAM,IAAI,OAAO,EAAI,QACvC,EAAY,EAAI,WACX,CACLA,IAAI,EAAO,EAAK,MAAM,IAAI,QAAQ,EAAI,KACtC,EAAa,EAAK,OAClB,EAAY,EAAK,MAAQ,EAAK,SAAW,EAG3C,KAAK,UAAY,KAEjBG,IAAM,EAAS,EAAU,KAAO,EAAM,OAChC,EAAa,EAAS,EAAK,QAAQ,YAAY,GAAQ,GAAQ,KACrE,KAAK,OAAS,EAAa,EAAW,IAAM,MAExC,EAAW,KAAK,KAAK,YAAiD,IAApC,EAAW,KAAK,KAAK,YACvD,EAAK,MAAM,qBAAqB,iBAAiB,GAAa,EAAK,MAAM,UAAU,QACrF,KAAK,UAAY,CAAC,KAAM,EACN,IAAK,EACL,QAAS,KAAK,SAAW,KAAK,OAAO,UACrC,cAAe,KAAK,QAAU5oB,EAAQ,QAAU,KAAK,OAAO,aAAa,qBAEzF,KAAK,QAAU,KAAK,YAAc,KAAK,UAAU,SAAW,KAAK,UAAU,iBAC7E,KAAK,KAAK,YAAY,OAClB,KAAK,UAAU,UAAS,KAAK,OAAO,WAAY,GAChD,KAAK,UAAU,eACjB,YAAU,kBAAOrV,EAAK,OAAO,aAAa,kBAAmB,WAAU,IACzE,KAAK,KAAK,YAAY,SAGxB,EAAK,KAAK,iBAAiB,UAAW,KAAK,GAAK,KAAK,GAAG,KAAK,OAC7D,EAAK,KAAK,iBAAiB,YAAa,KAAK,KAAO,KAAK,KAAK,KAAK,OACnE,GAAmB,EAAM,YA8D7B,SAAS,GAAoB,EAAM,GACjC,QAAI,EAAK,cAWLqV,EAAQ,QAAU,KAAK,IAAI,EAAM,UAAY,EAAK,oBAAsB,OAC1E,EAAK,oBAAsB,KACpB,G,aAzET,gBACE,KAAK,KAAK,KAAK,oBAAoB,UAAW,KAAK,IACnD,KAAK,KAAK,KAAK,oBAAoB,YAAa,KAAK,MACjD,KAAK,WAAa,KAAK,SACzB,KAAK,KAAK,YAAY,OAClB,KAAK,UAAU,SAAS,KAAK,OAAO,gBAAgB,aACpD,KAAK,UAAU,eAAe,KAAK,OAAO,gBAAgB,mBAC9D,KAAK,KAAK,YAAY,SAExB,KAAK,KAAK,UAAY,M,aAGxB,YAAG,GAGD,GAFA,KAAK,OAEA,KAAK,KAAK,IAAI,SAAkC,GAAzB,EAAM,OAAO,SAAgB,EAAM,OAAO,WAAa,EAAM,QAAzF,CAGAyoB,IAAI,EAAM,KAAK,IACX,KAAK,KAAK,MAAM,KAAO,KAAK,WAAU,EAAM,KAAK,KAAK,YAAY,GAAY,KAE9E,KAAK,eAAiB,EACxB,GAAmB,KAAK,KAAM,WACrB,GAAkB,KAAK,KAAM,EAAI,IAAK,EAAI,OAAQ,EAAO,KAAK,YACvE,EAAM,iBACG,KAAK,SAEJzoB,EAAQ,QAAU,KAAK,YAAc,KAAK,UAAU,KAAK,QAQzDA,EAAQ,UAAY,KAAK,KAAK,MAAM,qBAAqB,mBACxD,EAAI,KAAO,KAAK,KAAK,MAAM,UAAU,MAAQ,EAAI,KAAO,KAAK,KAAK,MAAM,UAAU,KAC7F,GAAgB,KAAK,KAAM,YAAU,KAAK,KAAK,KAAK,MAAM,IAAI,QAAQ,EAAI,MAAO,WACjF,EAAM,kBAEN,GAAmB,KAAK,KAAM,a,aAIlC,cAAK,IACE,KAAK,eAAiB,KAAK,IAAI,KAAK,MAAM,EAAI,EAAM,SAAW,GACzC,KAAK,IAAI,KAAK,MAAM,EAAI,EAAM,SAAW,KAClE,KAAK,cAAe,GACtB,GAAmB,KAAK,KAAM,YAIlC,GAAS,UAAS,SAAG,GACnB,GAAc,GACd,GAAmB,EAAM,YAG3B,GAAS,YAAW,SAAG,UAAQ,GAAc,IAsB7C4oB,IAAM,GAAqB5oB,EAAQ,QAAU,KAAQ,EA6CrD,SAAS,GAAmB,EAAM,GAChC,aAAa,EAAK,kBACd,GAAS,IAAG,EAAK,iBAAmB,YAAU,kBAAO,GAAe,KAAO,IAG1E,SAAS,GAAiB,GAE/B,IADA,EAAK,WAAY,EACV,EAAK,iBAAiB,OAAS,GAAG,EAAK,iBAAiB,MAAM,mBAGhE,SAAS,GAAe,EAAM,GAGnC,GAFA,EAAK,YAAY,aACjB,GAAiB,GACb,GAAe,EAAK,QAAQ,MAAO,CACrCyoB,IAAI,EAAM,GAAiB,GAG3B,OAFI,IAAQ,EAAI,GAAG,EAAK,MAAM,WAAY,EAAK,SAAS,EAAK,MAAM,GAAG,aAAa,IAC9E,EAAK,YAAY,EAAK,QACpB,EAET,OAAO,EA9DT,GAAa,iBAAmB,GAAa,kBAAiB,SAAG,GAC/D,IAAK,EAAK,UAAW,CACnB,EAAK,YAAY,QACZ,cAAe,EAAO,EAAM,UAAU,MAC3C,GAAI,EAAM,UAAU,QACf,EAAM,cAAiB,EAAK,YAAc,EAAK,cAAgB,EAAK,WAAW,MAAM,MAAI,SAAC,UAA+B,IAA1B,EAAE,KAAK,KAAK,cAE9G,EAAK,WAAa,EAAK,MAAM,aAAe,EAAK,QACjD,GAAe,GAAM,GACrB,EAAK,WAAa,UAMlB,GAJA,GAAe,GAIXzoB,EAAQ,OAAS,EAAM,UAAU,OAAS,EAAK,eAAiB,EAAK,YAAc,EAAK,WAAW,MAAM,OAE3G,IADAyoB,IAAI,EAAM,EAAK,KAAK,eACX,EAAO,EAAI,UAAW,EAAS,EAAI,YAAa,GAAyB,GAAjB,EAAK,UAA2B,GAAV,GAAc,CACnGA,IAAI,EAAS,EAAS,EAAI,EAAK,UAAY,EAAK,WAAW,EAAS,GACpE,IAAK,EAAQ,MACb,GAAuB,GAAnB,EAAO,SAAe,CACxB,EAAI,SAAS,EAAQ,EAAO,UAAU,QACtC,MAEA,EAAO,EACP,GAAU,EAKlB,EAAK,WAAY,EAEnB,GAAmB,EAAM,KAG3B,GAAa,eAAc,SAAI,EAAM,GAC/B,EAAK,YACP,EAAK,WAAY,EACjB,EAAK,mBAAqB,EAAM,UAChC,GAAmB,EAAM,MAkD7BG,IAAM,GAAsB5oB,EAAQ,IAAMA,EAAQ,WAAa,IACxDA,EAAQ,KAAOA,EAAQ,eAAiB,IAuC/C,SAAS,GAAQ,EAAM,EAAM,EAAM,GACjCyoB,IAAI,EAAQ,GAAmB,EAAM,EAAM,EAAM,EAAK,SAAU,EAAK,MAAM,UAAU,OACrF,IAAI,EAAK,SAAS,eAAa,SAAE,UAAK,EAAE,EAAM,EAAG,GAAS,QAAM,WAAY,EAA5E,CAEAA,IAAI,EAvBN,SAAyB,GACvB,OAA0B,GAAnB,EAAM,WAAmC,GAAjB,EAAM,SAA4C,GAA5B,EAAM,QAAQ,WAAkB,EAAM,QAAQ,WAAa,KAsB/F,CAAgB,GAC7B,EAAK,EAAa,EAAK,MAAM,GAAG,qBAAqB,EAAY,EAAK,UAAY,EAAK,MAAM,GAAG,iBAAiB,GACrH,EAAK,SAAS,EAAG,iBAAiB,QAAQ,SAAS,GAAM,QAAQ,UAAW,WA3C9E,GAAS,KAAO,GAAa,IAAG,SAAI,EAAM,GACxCA,IAAI,EAAM,EAAK,MAAM,UAAW,EAAgB,OAAV,EAAE,KACxC,IAAI,EAAI,MAAR,CAGAA,IAAI,EAAO,GAAqB,KAAO,EAAE,c,EACA,GAAsB,EAAnD,EAAI,WAAY,QAAK,SAC7B,GACF,EAAE,iBACF,EAAK,YACL,EAAK,QAAQ,YAAa,EAAI,WAC9B,EAAK,QAAQ,aAAc,IAtC/B,SAAqB,EAAM,GAGzB,GAAK,EAAK,IAAI,WAAd,CACAA,IAAI,EAAO,EAAK,IAAI,WAAW,YAAY,SAAS,cAAc,QAClE,EAAK,YAAY,GACjB,EAAK,MAAM,QAAU,6CACrBA,IAAI,EAAM,eAAgB,EAAQ,SAAS,cAC3C,EAAM,mBAAmB,GAIzB,EAAK,IAAI,OACT,EAAI,kBACJ,EAAI,SAAS,GACb,YAAU,WACJ,EAAK,YAAY,EAAK,WAAW,YAAY,GACjD,EAAK,UACJ,KAsBD,CAAY,EAAM,GAEhB,GAAK,EAAK,SAAS,EAAK,MAAM,GAAG,kBAAkB,iBAAiB,QAAQ,UAAW,UA+B7F,GAAa,MAAK,SAAI,EAAM,GAC1BA,IAAI,EAAO,GAAqB,KAAO,EAAE,cACrC,EAAO,GAAQ,EAAK,QAAQ,aAAc,EAAO,GAAQ,EAAK,QAAQ,cACtE,IAAS,GAAQ,GAAQ,EAAK,MAAM,SACtC,GAAQ,EAAM,EAAM,EAAM,GAC1B,EAAE,kBA7BN,SAAsB,EAAM,GAC1B,GAAK,EAAK,IAAI,WAAd,CACAA,IAAI,EAAY,EAAK,UAAY,EAAK,MAAM,UAAU,MAAM,OAAO,KAAK,KAAK,KACzE,EAAS,EAAK,IAAI,WAAW,YAAY,SAAS,cAAc,EAAY,WAAa,QACxF,IAAW,EAAO,gBAAkB,QACzC,EAAO,MAAM,QAAU,6CACvB,EAAO,QACP,YAAU,WACR,EAAK,QACD,EAAO,YAAY,EAAO,WAAW,YAAY,GACjD,EAAW,GAAQ,EAAM,EAAO,MAAO,KAAM,GAC5C,GAAQ,EAAM,EAAO,YAAa,EAAO,UAAW,KACxD,KAmBD,CAAa,EAAM,IAIvB,IAAM,GACJ,SAAY,EAAO,GACjB,KAAK,MAAQ,EACb,KAAK,KAAO,GAIV,GAAmBzoB,EAAQ,IAAM,SAAW,UAgIlD,IAAKyoB,IAAI,MA9HT,GAAS,UAAS,SAAI,EAAM,GAC1BA,IAAI,EAAY,EAAK,UAErB,GADI,GAAW,EAAU,OACpB,EAAE,aAAP,CAEAA,IAAI,EAAM,EAAK,MAAM,UACjB,EAAM,EAAI,MAAQ,KAAO,EAAK,YAAY,GAAY,IAC1D,GAAI,GAAO,EAAI,KAAO,EAAI,MAAQ,EAAI,MAAQ,aAAe,gBAAgB,EAAI,GAAK,EAAG,EAAI,UAEtF,GAAI,GAAa,EAAU,UAChC,EAAK,SAAS,EAAK,MAAM,GAAG,aAAa,gBAAc,OAAO,EAAK,MAAM,IAAK,EAAU,UAAU,YAC7F,GAAI,EAAE,QAA+B,GAArB,EAAE,OAAO,SAAe,CAC7CA,IAAI,EAAO,EAAK,QAAQ,YAAY,EAAE,QAAQ,GAC9C,IAAK,IAAS,EAAK,KAAK,KAAK,KAAK,WAAa,GAAQ,EAAK,QAAS,OACrE,EAAK,SAAS,EAAK,MAAM,GAAG,aAAa,gBAAc,OAAO,EAAK,MAAM,IAAK,EAAK,aAErFA,IAAI,EAAQ,EAAK,MAAM,UAAU,U,EAAyB,GAAsB,EAAM,GAAzC,QAAK,SAClD,EAAE,aAAa,YACf,EAAE,aAAa,QAAQ,GAAqB,OAAS,YAAa,EAAI,WACjE,IAAoB,EAAE,aAAa,QAAQ,aAAc,GAC9D,EAAK,SAAW,IAAI,GAAS,GAAQ,EAAE,OAGzC,GAAS,QAAO,SAAG,GACjBA,IAAI,EAAW,EAAK,SACpB,OAAO,YAAU,WACX,EAAK,UAAY,IAAW,EAAK,SAAW,QAC/C,KAGL,GAAa,SAAW,GAAa,UAAS,SAAI,EAAG,GAAC,OAAK,EAAE,kBAE7D,GAAa,KAAI,SAAI,EAAM,GACzBA,IAAI,EAAW,EAAK,SAGpB,GAFA,EAAK,SAAW,KAEX,EAAE,aAAP,CAEAA,IAAI,EAAW,EAAK,YAAY,GAAY,IAC5C,GAAK,EAAL,CACAA,IAAI,EAAS,EAAK,MAAM,IAAI,QAAQ,EAAS,KAC7C,GAAK,EAAL,CACAA,IAAI,EAAQ,GAAY,EAAS,OAC7B,GAAmB,EAAM,EAAE,aAAa,QAAQ,GAAqB,OAAS,cAC3D,GAAqB,KAAO,EAAE,aAAa,QAAQ,cAAc,EAAO,GAC3F,EAAO,IAAa,EAAE,IAC1B,GAAI,EAAK,SAAS,cAAY,SAAE,UAAK,EAAE,EAAM,EAAG,GAAS,QAAM,MAAO,MACpE,EAAE,sBAGJ,GAAK,EAAL,CAEA,EAAE,iBACFA,IAAI,EAAY,EAAQ,YAAU,EAAK,MAAM,IAAK,EAAO,IAAK,GAAS,EAAO,IAC7D,MAAb,IAAmB,EAAY,EAAO,KAE1CA,IAAI,EAAK,EAAK,MAAM,GAChB,GAAM,EAAG,kBAEbA,IAAI,EAAM,EAAG,QAAQ,IAAI,GACrB,EAA4B,GAAnB,EAAM,WAAmC,GAAjB,EAAM,SAA4C,GAA5B,EAAM,QAAQ,WACrE,EAAe,EAAG,IAKtB,GAJI,EACF,EAAG,iBAAiB,EAAK,EAAK,EAAM,QAAQ,YAE5C,EAAG,aAAa,EAAK,EAAK,IACxB,EAAG,IAAI,GAAG,GAAd,CAEAA,IAAI,EAAO,EAAG,IAAI,QAAQ,GAC1B,GAAI,GAAU,gBAAc,aAAa,EAAM,QAAQ,aACnD,EAAK,WAAa,EAAK,UAAU,WAAW,EAAM,QAAQ,YAC5D,EAAG,aAAa,IAAI,gBAAc,QAC7B,CACLA,IAAI,EAAM,EAAG,QAAQ,IAAI,GACzB,EAAG,QAAQ,KAAK,EAAG,QAAQ,KAAK,OAAS,GAAG,SAAO,SAAE,EAAO,EAAK,EAAU,GAAK,OAAK,EAAM,KAC3F,EAAG,aAAa,GAAiB,EAAM,EAAM,EAAG,IAAI,QAAQ,KAE9D,EAAK,QACL,EAAK,SAAS,EAAG,QAAQ,UAAW,eAGtC,GAAS,MAAK,SAAG,GACV,EAAK,UACR,EAAK,YAAY,OACjB,EAAK,IAAI,UAAU,IAAI,uBACvB,EAAK,YAAY,QACjB,EAAK,SAAU,EACf,YAAU,WACJ,EAAK,SAAW,EAAK,aAAe,EAAK,YAAY,iBAAiB,GAAG,EAAK,KAAK,iBACrF,GAAe,KAChB,MAIP,GAAS,KAAI,SAAG,GACV,EAAK,UACP,EAAK,YAAY,OACjB,EAAK,IAAI,UAAU,OAAO,uBAC1B,EAAK,YAAY,QACjB,EAAK,YAAY,iBAAiB,IAAI,IACtC,EAAK,SAAU,IAInB,GAAS,YAAW,SAAI,EAAM,GAM5B,GAAIzoB,EAAQ,QAAUA,EAAQ,SAA8B,yBAAnB,EAAM,UAAsC,CAC9E,uBACL,YAAU,WACR,GAAI,EAAK,gBAAkB,IAE3B,EAAK,IAAI,OACT,EAAK,SACD,EAAK,SAAS,iBAAe,SAAE,UAAK,EAAE,EAAM,EAAS,EAAG,kBAA5D,CACN,IAAW,EAAW,EAAK,MAAM,UAAtB,QAED,GAAW,EAAQ,IAAM,GAAG,EAAK,SAAS,EAAK,MAAM,GAAG,OAAO,EAAQ,IAAM,EAAG,EAAQ,KAAK,qBAChG,MAKU,GAAc,GAAS,IAAQ,GAAa,IC9qB7D,SAASinE,GAAYp5E,EAAGC,GACtB,GAAID,GAAKC,EAAG,OAAO,EACnB,IAAK26B,IAAI3P,KAAKjrB,EAAG,GAAIA,EAAEirB,KAAOhrB,EAAEgrB,GAAI,OAAO,EAC3C,IAAK2P,IAAI3P,KAAKhrB,EAAG,KAAMgrB,KAAKjrB,GAAI,OAAO,EACvC,OAAO,EAGT,IAAMq5E,GACJ,SAAY5kC,EAAOxV,GACjBniC,KAAKmiC,KAAOA,GAAQq6C,GACpBx8E,KAAKizD,KAAOjzD,KAAKmiC,KAAK8wB,MAAQ,EAC9BjzD,KAAK23C,MAAQA,G,aAGf59B,IAAA,SAAI6kB,EAAS69C,EAAM10C,EAAQ20C,GAC3B,IAAF,EAAyB99C,EAAQib,UAAU4iC,EAAKlqD,KAAOmqD,EAAW18E,KAAKizD,KAAO,GAAK,EAAI,GAA9El3C,EAAA,EAAAA,IACL,OADU,EAAAu9B,QACO,KAAO,IAAIoiB,GAAW3/C,EAAMgsB,EAAQhsB,EAAMgsB,EAAQ/nC,O,aAGrE+mD,MAAA,WAAU,OAAO,G,aAEjB5jB,GAAA,SAAGhd,GACD,OAAOnmB,MAAQmmB,GACZA,aAAiBo2D,KAChBv8E,KAAKmiC,KAAK/gC,KAAOpB,KAAKmiC,KAAK/gC,KAAO+kB,EAAMgc,KAAK/gC,KAC7CpB,KAAK23C,OAASxxB,EAAMwxB,OAAS2kC,GAAYt8E,KAAKmiC,KAAMhc,EAAMgc,QAIlE,IAAMw6C,GACJ,SAAY70C,EAAO3F,GACjBniC,KAAKmiC,KAAOA,GAAQq6C,GACpBx8E,KAAK8nC,MAAQA,G,aAGf/tB,IAAA,SAAI6kB,EAAS69C,EAAM10C,EAAQ20C,GACzB5+C,IAAIvL,EAAOqM,EAAQ7kB,IAAI0iE,EAAKlqD,KAAOmqD,EAAW18E,KAAKmiC,KAAKy6C,gBAAkB,EAAI,GAAK70C,EAC/EvH,EAAK5B,EAAQ7kB,IAAI0iE,EAAKj8C,GAAKk8C,EAAW18E,KAAKmiC,KAAK06C,aAAe,GAAK,GAAK90C,EAC7E,OAAOxV,GAAQiO,EAAK,KAAO,IAAIk7B,GAAWnpC,EAAMiO,EAAIxgC,O,aAGtD+mD,MAAA,SAAM9lB,EAAGw7C,GAAQ,OAAOA,EAAKlqD,KAAOkqD,EAAKj8C,I,aAEzC2C,GAAA,SAAGhd,GACD,OAAOnmB,MAAQmmB,GACZA,aAAiBw2D,IAAcL,GAAYt8E,KAAK8nC,MAAO3hB,EAAM2hB,QAC7Dw0C,GAAYt8E,KAAKmiC,KAAMhc,EAAMgc,OAGlC,GAAO26C,GAAA,SAAGL,GAAQ,OAAOA,EAAK10E,gBAAgB40E,IAGhD,IAAMI,GACJ,SAAYj1C,EAAO3F,GACjBniC,KAAKmiC,KAAOA,GAAQq6C,GACpBx8E,KAAK8nC,MAAQA,G,aAGf/tB,IAAA,SAAI6kB,EAAS69C,EAAM10C,EAAQ20C,GACzB5+C,IAAIvL,EAAOqM,EAAQib,UAAU4iC,EAAKlqD,KAAOmqD,EAAW,GACpD,GAAInqD,EAAK+mB,QAAS,OAAO,KACzBxb,IAAI0C,EAAK5B,EAAQib,UAAU4iC,EAAKj8C,GAAKk8C,GAAY,GACjD,OAAIl8C,EAAG8Y,SAAW9Y,EAAGzkB,KAAOwW,EAAKxW,IAAY,KACtC,IAAI2/C,GAAWnpC,EAAKxW,IAAMgsB,EAAQvH,EAAGzkB,IAAMgsB,EAAQ/nC,O,aAG5D+mD,MAAA,SAAMhnB,EAAM08C,GACZ,IAAF,EAA0B18C,EAAKt8B,QAAQ2W,UAAUqiE,EAAKlqD,MAA7Clf,EAAA,EAAAA,MAAO00B,EAAA,EAAAA,OACZ,OAAOA,GAAU00C,EAAKlqD,MAAQwV,EAAShI,EAAKsF,MAAMhyB,GAAO6xB,UAAYu3C,EAAKj8C,I,aAG5E2C,GAAA,SAAGhd,GACD,OAAOnmB,MAAQmmB,GACZA,aAAiB42D,IAAYT,GAAYt8E,KAAK8nC,MAAO3hB,EAAM2hB,QAC3Dw0C,GAAYt8E,KAAKmiC,KAAMhc,EAAMgc,O,IAOvBu5B,GACX,SAAYnpC,EAAMiO,EAAIz4B,GAGpB/H,KAAKuyB,KAAOA,EAIZvyB,KAAKwgC,GAAKA,EACVxgC,KAAK+H,KAAOA,G,iDACb,I,aAEDw+B,KAAA,SAAKhU,EAAMiO,GACT,OAAO,IAAIk7B,GAAWnpC,EAAMiO,EAAIxgC,KAAK+H,O,aAGvCo7B,GAAA,SAAGhd,EAAO4hB,GACR,Y,UADiB,GACV/nC,KAAK+H,KAAKo7B,GAAGhd,EAAMpe,OAAS/H,KAAKuyB,KAAOwV,GAAU5hB,EAAMoM,MAAQvyB,KAAKwgC,GAAKuH,GAAU5hB,EAAMqa,I,aAGnGzmB,IAAA,SAAI6kB,EAASmJ,EAAQ20C,GACnB,OAAO18E,KAAK+H,KAAKgS,IAAI6kB,EAAS5+B,KAAM+nC,EAAQ20C,IAoD9C,GAAOnP,OAAA,SAAOxxD,EAAK47B,EAAOxV,GACxB,OAAO,IAAIu5B,GAAW3/C,EAAKA,EAAK,IAAIwgE,GAAW5kC,EAAOxV,KAoBxD,GAAOmL,OAAA,SAAO/a,EAAMiO,EAAIsH,EAAO3F,GAC7B,OAAO,IAAIu5B,GAAWnpC,EAAMiO,EAAI,IAAIm8C,GAAW70C,EAAO3F,KAYxD,GAAOpC,KAAA,SAAKxN,EAAMiO,EAAIsH,EAAO3F,GAC3B,OAAO,IAAIu5B,GAAWnpC,EAAMiO,EAAI,IAAIu8C,GAASj1C,EAAO3F,KAMtDE,GAAIF,KAAA,eAAS,OAAOniC,KAAK+H,KAAKo6B,MAE9BE,GAAIiL,OAAA,eAAW,OAAOttC,KAAK+H,gBAAgB40E,I,qCAC5C,IAkBD1+C,IAAMkC,GAAO,GAAIq8C,GAAS,GAMb7gB,GACX,SAAYqhB,EAAO1hB,GACjBt7D,KAAKg9E,MAAQA,GAASA,EAAM77E,OAAS67E,EAAQ78C,GAC7CngC,KAAKs7D,SAAWA,GAAYA,EAASn6D,OAASm6D,EAAWn7B,IAM3D,GAAO7xB,OAAA,SAAO8vB,EAAKgqB,GACjB,OAAOA,EAAYjnD,OAAS87E,GAAU70B,EAAahqB,EAAK,EAAGo+C,IAAUv8C,I,aAUvE9lB,KAAA,SAAKorB,EAAOD,EAAK43C,GACfp/C,IAAIj7B,EAAS,GAEb,OADA7C,KAAKm9E,UAAmB,MAAT53C,EAAgB,EAAIA,EAAc,MAAPD,EAAc,IAAMA,EAAKziC,EAAQ,EAAGq6E,GACvEr6E,G,aAGTs6E,UAAA,SAAU53C,EAAOD,EAAKziC,EAAQklC,EAAQm1C,GACpC,IAAKp/C,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKg9E,MAAM77E,OAAQF,IAAK,CAC1C68B,IAAI2+C,EAAOz8E,KAAKg9E,MAAM/7E,GAClBw7E,EAAKlqD,MAAQ+S,GAAOm3C,EAAKj8C,IAAM+E,KAAW23C,GAAaA,EAAUT,EAAKt6C,QACxEt/B,EAAOsS,KAAKsnE,EAAKl2C,KAAKk2C,EAAKlqD,KAAOwV,EAAQ00C,EAAKj8C,GAAKuH,IAExD,IAAKjK,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKs7D,SAASn6D,OAAQF,GAAK,EAC7C,GAAIjB,KAAKs7D,SAASr6D,GAAKqkC,GAAOtlC,KAAKs7D,SAASr6D,EAAI,GAAKskC,EAAO,CAC1DzH,IAAIs/C,EAAWp9E,KAAKs7D,SAASr6D,GAAK,EAClCjB,KAAKs7D,SAASr6D,EAAI,GAAGk8E,UAAU53C,EAAQ63C,EAAU93C,EAAM83C,EAAUv6E,EAAQklC,EAASq1C,EAAUF,K,aAelGnjE,IAAA,SAAI6kB,EAASR,EAAKj5B,GAChB,OAAInF,MAAQigC,IAAgC,GAAvBrB,EAAQ6b,KAAKt5C,OAAoBnB,KAC/CA,KAAKq9E,SAASz+C,EAASR,EAAK,EAAG,EAAGj5B,GAAWq3E,K,aAGtDa,SAAA,SAASz+C,EAASmB,EAAMgI,EAAQ20C,EAAWv3E,GAEzC,IADA24B,IAAIw/C,EACKr8E,EAAI,EAAGA,EAAIjB,KAAKg9E,MAAM77E,OAAQF,IAAK,CAC1C68B,IAAIqhB,EAASn/C,KAAKg9E,MAAM/7E,GAAG8Y,IAAI6kB,EAASmJ,EAAQ20C,GAC5Cv9B,GAAUA,EAAOp3C,KAAKg/C,MAAMhnB,EAAMof,IAAUm+B,IAAaA,EAAW,KAAKnoE,KAAKgqC,GACzEh6C,EAAQo4E,UAAUp4E,EAAQo4E,SAASv9E,KAAKg9E,MAAM/7E,GAAGkhC,MAG5D,OAAIniC,KAAKs7D,SAASn6D,OAkMtB,SAAqBq8E,EAAaF,EAAU1+C,EAASmB,EAAMgI,EAAQ20C,EAAWv3E,GAiB5E,IAhBA24B,IAAIw9B,EAAWkiB,EAAYz6E,QAIvB+xB,EAAQ,SAACulB,EAAUojC,EAAQnjC,EAAUojC,GACvC,IAAK5/C,IAAI78B,EAAI,EAAGA,EAAIq6D,EAASn6D,OAAQF,GAAK,EAAG,CAC3C68B,IAAIwH,EAAMg2B,EAASr6D,EAAI,GAAI08E,OAAA,GACf,GAARr4C,GAAa+U,EAAW/U,EAAMo3C,IAC9Be,GAAUniB,EAASr6D,GAAKy7E,EAC1BphB,EAASr6D,EAAI,IAAM,EACVq5C,GAAYvS,IAAW41C,EAASD,EAASpjC,GAAamjC,EAASpjC,MACxEihB,EAASr6D,IAAM08E,EACfriB,EAASr6D,EAAI,IAAM08E,MAIhB18E,EAAI,EAAGA,EAAI29B,EAAQ6b,KAAKt5C,OAAQF,IAAK29B,EAAQ6b,KAAKx5C,GAAGH,QAAQg0B,GAKtE,IADAgJ,IAAI8/C,GAAc,EACT38E,EAAI,EAAGA,EAAIq6D,EAASn6D,OAAQF,GAAK,EAAG,IAAwB,GAApBq6D,EAASr6D,EAAI,GAAU,CACtE68B,IAAIvL,EAAOqM,EAAQ7kB,IAAIyjE,EAAYv8E,GAAKy7E,GAAYmB,EAAYtrD,EAAOwV,EACvE,GAAI81C,EAAY,GAAKA,GAAa99C,EAAKt8B,QAAQ2Y,KAAM,CACnDwhE,GAAc,EACd,SAGF9/C,IAA0DggD,EAAjDl/C,EAAQ7kB,IAAIyjE,EAAYv8E,EAAI,GAAKy7E,GAAY,GAAmB30C,EAC7E,EAAuChI,EAAKt8B,QAAQ2W,UAAUyjE,GAArDxqE,EAAA,EAAAA,MAAe0qE,EAAA,SAChBC,EAAYj+C,EAAK0G,WAAWpzB,GAChC,GAAI2qE,GAAaD,GAAeF,GAAaE,EAAcC,EAAU94C,UAAY44C,EAAS,CACxFhgD,IAAIqhB,EAASmc,EAASr6D,EAAI,GAAGo8E,SAASz+C,EAASo/C,EAAWzrD,EAAO,EAAGirD,EAAYv8E,GAAKy7E,EAAY,EAAGv3E,GAChGg6C,GAAUlf,IACZq7B,EAASr6D,GAAK48E,EACdviB,EAASr6D,EAAI,GAAK68E,EAClBxiB,EAASr6D,EAAI,GAAKk+C,IAElBmc,EAASr6D,EAAI,IAAM,EACnB28E,GAAc,QAGhBA,GAAc,EAKlB,GAAIA,EAAa,CACf9/C,IAEImgD,EAAQhB,GA0BhB,SAA0C3hB,EAAUkiB,EAAap1B,EAAaxpB,EAASmJ,EAAQ20C,EAAWv3E,GAExG,SAAS+4E,EAAOpzE,EAAK4xE,GACnB,IAAK5+C,IAAI78B,EAAI,EAAGA,EAAI6J,EAAIkyE,MAAM77E,OAAQF,IAAK,CACzC68B,IAAIqhB,EAASr0C,EAAIkyE,MAAM/7E,GAAG8Y,IAAI6kB,EAASmJ,EAAQ20C,GAC3Cv9B,EAAQiJ,EAAYjzC,KAAKgqC,GACpBh6C,EAAQo4E,UAAUp4E,EAAQo4E,SAASzyE,EAAIkyE,MAAM/7E,GAAGkhC,MAE3D,IAAKrE,IAAI78B,EAAI,EAAGA,EAAI6J,EAAIwwD,SAASn6D,OAAQF,GAAK,EAC5Ci9E,EAAOpzE,EAAIwwD,SAASr6D,EAAI,GAAI6J,EAAIwwD,SAASr6D,GAAKy7E,EAAY,GAE9D,IAAK5+C,IAAI78B,EAAI,EAAGA,EAAIq6D,EAASn6D,OAAQF,GAAK,GAA2B,GAApBq6D,EAASr6D,EAAI,IAC5Di9E,EAAO5iB,EAASr6D,EAAI,GAAIu8E,EAAYv8E,GAAKy7E,EAAY,GAEvD,OAAOt0B,EA1Ca+1B,CAAiC7iB,EAAUkiB,EAAaF,GAAY,GAAI1+C,EACvCmJ,EAAQ20C,EAAWv3E,GACnC46B,EAAM,EAAG56B,GAC5Cm4E,EAAWW,EAAMjB,MACjB,IAAKl/C,IAAI78B,EAAI,EAAGA,EAAIq6D,EAASn6D,OAAQF,GAAK,EAAOq6D,EAASr6D,EAAI,GAAK,IACjEq6D,EAASt3B,OAAO/iC,EAAG,GACnBA,GAAK,GAEP,IAAK68B,IAAI78B,EAAI,EAAGqrB,EAAI,EAAGrrB,EAAIg9E,EAAM3iB,SAASn6D,OAAQF,GAAK,EAAG,CAExD,IADA68B,IAAIvL,EAAO0rD,EAAM3iB,SAASr6D,GACnBqrB,EAAIgvC,EAASn6D,QAAUm6D,EAAShvC,GAAKiG,GAAMjG,GAAK,EACvDgvC,EAASt3B,OAAO1X,EAAG,EAAG2xD,EAAM3iB,SAASr6D,GAAIg9E,EAAM3iB,SAASr6D,EAAI,GAAIg9E,EAAM3iB,SAASr6D,EAAI,KAIvF,OAAO,IAAI06D,GAAc2hB,GAAYA,EAASlyC,KAAKgzC,IAAQ9iB,GAjQhD+iB,CAAYr+E,KAAKs7D,SAAUgiB,EAAU1+C,EAASmB,EAAMgI,EAAQ20C,EAAWv3E,GAEvEm4E,EAAW,IAAI3hB,GAAc2hB,EAASlyC,KAAKgzC,KAAUn+C,I,aAOhE91B,IAAA,SAAIi0B,EAAKgqB,GACP,OAAKA,EAAYjnD,OACbnB,MAAQigC,GAAc07B,GAAcrtD,OAAO8vB,EAAKgqB,GAC7CpoD,KAAKs+E,SAASlgD,EAAKgqB,EAAa,GAFPpoD,M,aAKlCs+E,SAAA,SAASlgD,EAAKgqB,EAAargB,G,IACrBuzB,E,OAAUsM,EAAa,EAC3BxpC,EAAIt9B,SAAO,SAAEk9E,EAAWD,GACtBjgD,IAAuCiG,EAAnCw6C,EAAaR,EAAch2C,EAC/B,GAAMhE,EAAQy6C,GAAiBp2B,EAAa41B,EAAWO,GAAvD,CAGA,IADKjjB,IAAUA,EAAWt7D,EAAKs7D,SAASv4D,SACjC6kE,EAAatM,EAASn6D,QAAUm6D,EAASsM,GAAcmW,GAAanW,GAAc,EACrFtM,EAASsM,IAAemW,EAC1BziB,EAASsM,EAAa,GAAKtM,EAASsM,EAAa,GAAG0W,SAASN,EAAWj6C,EAAOw6C,EAAa,GAE5FjjB,EAASt3B,OAAO4jC,EAAY,EAAGmW,EAAaA,EAAcC,EAAU94C,SAAU+3C,GAAUl5C,EAAOi6C,EAAWO,EAAa,EAAG/B,KAC5H5U,GAAc,MAGhB9pC,IAAIk/C,EAAQyB,GAAU7W,EAAa8W,GAAat2B,GAAeA,GAAcrgB,GAC7E,OAAO,IAAI4zB,GAAcqhB,EAAM77E,OAASnB,KAAKg9E,MAAMnyE,OAAOmyE,GAAO5xC,KAAKgzC,IAASp+E,KAAKg9E,MAC3D1hB,GAAYt7D,KAAKs7D,W,aAM5C3uC,OAAA,SAAOy7B,GACL,OAA0B,GAAtBA,EAAYjnD,QAAenB,MAAQigC,GAAcjgC,KAC9CA,KAAK2+E,YAAYv2B,EAAa,I,aAGvCu2B,YAAA,SAAYv2B,EAAargB,GAEvB,IADAjK,IAAIw9B,EAAWt7D,KAAKs7D,SAAU0hB,EAAQh9E,KAAKg9E,MAClC/7E,EAAI,EAAGA,EAAIq6D,EAASn6D,OAAQF,GAAK,EAAG,CAE3C,IADA68B,IAAIiG,OAAA,EAAOxR,EAAO+oC,EAASr6D,GAAK8mC,EAAQvH,EAAK86B,EAASr6D,EAAI,GAAK8mC,EACtDzb,EAAI,EAAGmwD,OAAA,EAAMnwD,EAAI87B,EAAYjnD,OAAQmrB,KAASmwD,EAAOr0B,EAAY97B,KACpEmwD,EAAKlqD,KAAOA,GAAQkqD,EAAKj8C,GAAKA,IAChC4nB,EAAY97B,GAAK,MACfyX,IAAUA,EAAQ,KAAK5uB,KAAKsnE,IAGlC,GAAK14C,EAAL,CACIu3B,GAAYt7D,KAAKs7D,WAAUA,EAAWt7D,KAAKs7D,SAASv4D,SACxD+6B,IAAI9C,EAAUsgC,EAASr6D,EAAI,GAAG09E,YAAY56C,EAAOxR,EAAO,GACpDyI,GAAWiF,GACbq7B,EAASr6D,EAAI,GAAK+5B,GAElBsgC,EAASt3B,OAAO/iC,EAAG,GACnBA,GAAK,IAGT,GAAI+7E,EAAM77E,OAAQ,IAAK28B,IAAI78B,EAAI,EAAGw7E,SAAMx7E,EAAImnD,EAAYjnD,OAAQF,IAAK,GAAIw7E,EAAOr0B,EAAYnnD,GAC1F,IAAK68B,IAAIxR,EAAI,EAAGA,EAAI0wD,EAAM77E,OAAQmrB,IAAS0wD,EAAM1wD,GAAG6W,GAAGs5C,EAAM10C,KACvDi1C,GAASh9E,KAAKg9E,QAAOA,EAAQh9E,KAAKg9E,MAAMj6E,SAC5Ci6E,EAAMh5C,OAAO1X,IAAK,IAGtB,OAAIgvC,GAAYt7D,KAAKs7D,UAAY0hB,GAASh9E,KAAKg9E,MAAch9E,KACtDg9E,EAAM77E,QAAUm6D,EAASn6D,OAAS,IAAIw6D,GAAcqhB,EAAO1hB,GAAYr7B,I,aAGhFivC,SAAA,SAASnnC,EAAQhI,GACf,GAAI//B,MAAQigC,GAAO,OAAOjgC,KAC1B,GAAI+/B,EAAK+F,OAAQ,OAAO61B,GAAc17B,MAGtC,IADAnC,IAAIuH,EAAO23C,EACF/7E,EAAI,EAAGA,EAAIjB,KAAKs7D,SAASn6D,OAAQF,GAAK,EAAG,GAAIjB,KAAKs7D,SAASr6D,IAAM8mC,EAAQ,CAC5E/nC,KAAKs7D,SAASr6D,IAAM8mC,IAAQ1C,EAAQrlC,KAAKs7D,SAASr6D,EAAI,IAC1D,MAGF,IADA68B,IAAIyH,EAAQwC,EAAS,EAAGzC,EAAMC,EAAQxF,EAAKt8B,QAAQ2Y,KAC1Cnb,EAAI,EAAGA,EAAIjB,KAAKg9E,MAAM77E,OAAQF,IAAK,CAC1C68B,IAAI8gD,EAAM5+E,KAAKg9E,MAAM/7E,GACrB,GAAI29E,EAAIrsD,KAAO+S,GAAOs5C,EAAIp+C,GAAK+E,GAAUq5C,EAAI72E,gBAAgB40E,GAAa,CACxE7+C,IAAIvL,EAAO3yB,KAAKsvB,IAAIqW,EAAOq5C,EAAIrsD,MAAQgT,EAAO/E,EAAK5gC,KAAKiJ,IAAIy8B,EAAKs5C,EAAIp+C,IAAM+E,EACvEhT,EAAOiO,IAAKw8C,IAAUA,EAAQ,KAAK7nE,KAAKypE,EAAIr4C,KAAKhU,EAAMiO,KAG/D,GAAIw8C,EAAO,CACTl/C,IAAI+gD,EAAW,IAAIljB,GAAcqhB,EAAM5xC,KAAKgzC,KAC5C,OAAO/4C,EAAQ,IAAIy5C,GAAgB,CAACD,EAAUx5C,IAAUw5C,EAE1D,OAAOx5C,GAASpF,I,aAGlBkD,GAAA,SAAGhd,GACD,GAAInmB,MAAQmmB,EAAO,OAAO,EAC1B,KAAMA,aAAiBw1C,KACnB37D,KAAKg9E,MAAM77E,QAAUglB,EAAM62D,MAAM77E,QACjCnB,KAAKs7D,SAASn6D,QAAUglB,EAAMm1C,SAASn6D,OAAQ,OAAO,EAC1D,IAAK28B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKg9E,MAAM77E,OAAQF,IACrC,IAAKjB,KAAKg9E,MAAM/7E,GAAGkiC,GAAGhd,EAAM62D,MAAM/7E,IAAK,OAAO,EAChD,IAAK68B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKs7D,SAASn6D,OAAQF,GAAK,EAC7C,GAAIjB,KAAKs7D,SAASr6D,IAAMklB,EAAMm1C,SAASr6D,IACnCjB,KAAKs7D,SAASr6D,EAAI,IAAMklB,EAAMm1C,SAASr6D,EAAI,KAC1CjB,KAAKs7D,SAASr6D,EAAI,GAAGkiC,GAAGhd,EAAMm1C,SAASr6D,EAAI,IAAK,OAAO,EAC9D,OAAO,G,aAGT40D,OAAA,SAAO91B,GACL,OAAOg/C,GAAc/+E,KAAKg/E,YAAYj/C,K,aAGxCi/C,YAAA,SAAYj/C,GACV,GAAI//B,MAAQigC,GAAO,OAAOE,GAC1B,GAAIJ,EAAKwJ,gBAAkBvpC,KAAKg9E,MAAM/iE,KAAK0iE,GAAWG,IAAK,OAAO98E,KAAKg9E,MAEvE,IADAl/C,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAIjB,KAAKg9E,MAAM77E,OAAQF,IAC/BjB,KAAKg9E,MAAM/7E,GAAG8G,gBAAgB40E,IAClC95E,EAAOsS,KAAKnV,KAAKg9E,MAAM/7E,IAE3B,OAAO4B,GAIXo7B,IAAMgC,GAAQ,IAAI07B,GAIlBA,GAAc17B,MAAQA,GAEtB07B,GAAcojB,cAAgBA,GAK9B,IAAMD,GACJ,SAAYG,GACVj/E,KAAKi/E,QAAUA,GAwHnB,SAASR,GAAUS,EAAOn3C,GACxB,IAAKA,IAAWm3C,EAAM/9E,OAAQ,OAAO+9E,EAErC,IADAphD,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAIi+E,EAAM/9E,OAAQF,IAAK,CACrC68B,IAAI2+C,EAAOyC,EAAMj+E,GACjB4B,EAAOsS,KAAK,IAAIumD,GAAW+gB,EAAKlqD,KAAOwV,EAAQ00C,EAAKj8C,GAAKuH,EAAQ00C,EAAK10E,OAExE,OAAOlF,EAoBT,SAAS27E,GAAiBU,EAAOn/C,EAAMgI,GACrC,GAAIhI,EAAK+F,OAAQ,OAAO,KAExB,IADAhI,IAAIwH,EAAMyC,EAAShI,EAAKmF,SAAUnB,EAAQ,KACjC9iC,EAAI,EAAGw7E,OAAA,EAAMx7E,EAAIi+E,EAAM/9E,OAAQF,KACjCw7E,EAAOyC,EAAMj+E,KAAOw7E,EAAKlqD,KAAOwV,GAAU00C,EAAKj8C,GAAK8E,KACrDvB,IAAUA,EAAQ,KAAK5uB,KAAKsnE,GAC9ByC,EAAMj+E,GAAK,MAGf,OAAO8iC,EAGT,SAAS26C,GAAa5pE,GAEpB,IADAgpB,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAI6T,EAAM3T,OAAQF,IAChB,MAAZ6T,EAAM7T,IAAY4B,EAAOsS,KAAKL,EAAM7T,IAC1C,OAAO4B,EAQT,SAASo6E,GAAUiC,EAAOn/C,EAAMgI,EAAQ5iC,GACtC24B,IAAIw9B,EAAW,GAAI6jB,GAAW,EAC9Bp/C,EAAKj/B,SAAO,SAAEk9E,EAAWoB,GACvBthD,IAAIiG,EAAQy6C,GAAiBU,EAAOlB,EAAWoB,EAAar3C,GAC5D,GAAIhE,EAAO,CACTo7C,GAAW,EACXrhD,IAAIu8C,EAAU4C,GAAUl5C,EAAOi6C,EAAWj2C,EAASq3C,EAAa,EAAGj6E,GAC/Dk1E,GAAWp6C,IACbq7B,EAASnmD,KAAKiqE,EAAYA,EAAapB,EAAU94C,SAAUm1C,OAIjE,IADAv8C,IAAI+3B,EAAS4oB,GAAUU,EAAWT,GAAaQ,GAASA,GAAQn3C,GAAQqD,KAAKgzC,IACpEn9E,EAAI,EAAGA,EAAI40D,EAAO10D,OAAQF,IAAU40D,EAAO50D,GAAG8G,KAAKg/C,MAAMhnB,EAAM81B,EAAO50D,MACzEkE,EAAQo4E,UAAUp4E,EAAQo4E,SAAS1nB,EAAO50D,GAAGkhC,MACjD0zB,EAAO7xB,OAAO/iC,IAAK,IAErB,OAAO40D,EAAO10D,QAAUm6D,EAASn6D,OAAS,IAAIw6D,GAAc9F,EAAQyF,GAAYr7B,GAOlF,SAASm+C,GAAMl7E,EAAGC,GAChB,OAAOD,EAAEqvB,KAAOpvB,EAAEovB,MAAQrvB,EAAEs9B,GAAKr9B,EAAEq9B,GAQrC,SAASu+C,GAAcG,GAErB,IADAphD,IAAIuhD,EAAUH,EACLj+E,EAAI,EAAGA,EAAIo+E,EAAQl+E,OAAS,EAAGF,IAAK,CAC3C68B,IAAI2+C,EAAO4C,EAAQp+E,GACnB,GAAIw7E,EAAKlqD,MAAQkqD,EAAKj8C,GAAI,IAAK1C,IAAIxR,EAAIrrB,EAAI,EAAGqrB,EAAI+yD,EAAQl+E,OAAQmrB,IAAK,CACrEwR,IAAIjtB,EAAOwuE,EAAQ/yD,GACnB,GAAIzb,EAAK0hB,MAAQkqD,EAAKlqD,KAAtB,CAUM1hB,EAAK0hB,KAAOkqD,EAAKj8C,KACf6+C,GAAWH,IAAOG,EAAUH,EAAMn8E,SAGtCs8E,EAAQp+E,GAAKw7E,EAAKl2C,KAAKk2C,EAAKlqD,KAAM1hB,EAAK0hB,MACvC+sD,GAAYD,EAAS/yD,EAAGmwD,EAAKl2C,KAAK11B,EAAK0hB,KAAMkqD,EAAKj8C,MAEpD,MAhBI3vB,EAAK2vB,IAAMi8C,EAAKj8C,KACd6+C,GAAWH,IAAOG,EAAUH,EAAMn8E,SAGtCs8E,EAAQ/yD,GAAKzb,EAAK01B,KAAK11B,EAAK0hB,KAAMkqD,EAAKj8C,IACvC8+C,GAAYD,EAAS/yD,EAAI,EAAGzb,EAAK01B,KAAKk2C,EAAKj8C,GAAI3vB,EAAK2vB,OAe5D,OAAO6+C,EAGT,SAASC,GAAYxqE,EAAO7T,EAAG8tE,GAC7B,KAAO9tE,EAAI6T,EAAM3T,QAAUi9E,GAAMrP,EAAMj6D,EAAM7T,IAAM,GAAGA,IACtD6T,EAAMkvB,OAAO/iC,EAAG,EAAG8tE,GAKd,SAASwQ,GAAgBp3B,GAC9BrqB,IAAIiG,EAAQ,GAOZ,OANAokB,EAAKke,SAAS,eAAa,SAAEhiE,GAC3By5B,IAAIj7B,EAASwB,EAAE8jD,EAAK3hD,OAChB3D,GAAUA,GAAUo9B,IAAO8D,EAAM5uB,KAAKtS,MAExCslD,EAAKq3B,eACPz7C,EAAM5uB,KAAKwmD,GAAcrtD,OAAO65C,EAAK3hD,MAAM43B,IAAK,CAAC+pB,EAAKq3B,cAAczQ,QAC/D+P,GAAgBvsD,KAAKwR,G,aArP5BmrC,SAAA,SAASnnC,EAAQ1C,GACf,GAAIA,EAAMS,OAAQ,OAAO61B,GAAc17B,MAEvC,IADAnC,IAAIiG,EAAQ,GACH9iC,EAAI,EAAGA,EAAIjB,KAAKi/E,QAAQ99E,OAAQF,IAAK,CAC5C68B,IAAIj7B,EAAS7C,KAAKi/E,QAAQh+E,GAAGiuE,SAASnnC,EAAQ1C,GAC1CxiC,GAAUo9B,KACVp9B,aAAkBi8E,GAAiB/6C,EAAQA,EAAMl5B,OAAOhI,EAAOo8E,SAC9Dl7C,EAAM5uB,KAAKtS,IAElB,OAAOi8E,GAAgBvsD,KAAKwR,I,aAG9BZ,GAAA,SAAGhd,GACD,KAAMA,aAAiB24D,KACnB34D,EAAM84D,QAAQ99E,QAAUnB,KAAKi/E,QAAQ99E,OAAQ,OAAO,EACxD,IAAK28B,IAAI78B,EAAI,EAAGA,EAAIjB,KAAKi/E,QAAQ99E,OAAQF,IACvC,IAAKjB,KAAKi/E,QAAQh+E,GAAGkiC,GAAGhd,EAAM84D,QAAQh+E,IAAK,OAAO,EACpD,OAAO,G,aAGT40D,OAAA,SAAO91B,GAEL,IADAjC,IAAIj7B,EAAQ48E,GAAS,EACZx+E,EAAI,EAAGA,EAAIjB,KAAKi/E,QAAQ99E,OAAQF,IAAK,CAC5C68B,IAAI+3B,EAAS71D,KAAKi/E,QAAQh+E,GAAG+9E,YAAYj/C,GACzC,GAAK81B,EAAO10D,OACZ,GAAK0B,EAEE,CACD48E,IACF58E,EAASA,EAAOE,QAChB08E,GAAS,GAEX,IAAK3hD,IAAIxR,EAAI,EAAGA,EAAIupC,EAAO10D,OAAQmrB,IAAKzpB,EAAOsS,KAAK0gD,EAAOvpC,SAN3DzpB,EAASgzD,EASb,OAAOhzD,EAASk8E,GAAcU,EAAS58E,EAASA,EAAOuoC,KAAKgzC,KAAUj+C,IAMxE,GAAO5N,KAAA,SAAK0sD,GACV,OAAQA,EAAQ99E,QACd,KAAK,EAAG,OAAO8+B,GACf,KAAK,EAAG,OAAOg/C,EAAQ,GACvB,QAAS,OAAO,IAAIH,GAAgBG,K,I1Bvc7B,GAOX,SAAY,EAAO,GACjB,KAAK,OAAS,EAGd,KAAK,MAAQ,EAAM,MAEnB,KAAK,SAAW,KAAK,SAAS,KAAK,MAEjC,KAAG,MAAQ,KACX,KAAG,SAAU,EAEb,KAAG,YAAc,KAKnB,KAAK,IAAO,GAAS,EAAM,OAAU,SAAS,cAAc,OACxD,IACE,EAAM,YAAa,EAAM,YAAY,KAAK,KACrC,EAAM,MAAO,EAAM,KAAK,KACxB,EAAM,QAAO,KAAK,SAAU,IAKrC,KAAG,SAAW,GAAY,MAC1B,KAAG,WAAa,KAClB,KAAK,cAAgB,KACnB,GAAkB,MACpB,KAAK,UAAY,GAAe,MAC9B,KAAG,QAAU,EAAY,KAAK,MAAM,IAAK,GAAe,MAAO,GAAgB,MAAO,KAAK,IAAK,MAEhG,KAAG,qBAAuB,KAK5B,KAAK,SAAW,KyB/Cb,SAAmB,GACxB,EAAK,UAAW,EAChB,EAAK,UAAY,KACjB,EAAK,YAAc,KACnB,EAAK,gBAAkB,EACvB,EAAK,UAAY,CAAC,KAAM,EAAG,EAAG,EAAG,EAAG,EAAG,KAAM,IAC7C,EAAK,oBAAsB,KAC3B,EAAK,kBAAoB,EAEzB,EAAK,aAAe,EACpB,EAAK,4BAA8B,KAEnC,EAAK,WAAY,EACjB,EAAK,iBAAmB,KACxB,EAAK,iBAAmB,GACxB,EAAK,oBAAsB,IAE3B,EAAK,YAAc,IAAI,GAAY,GAAI,SAAG,EAAM,EAAI,EAAU,GAAK,OAAK,GAAc,EAAM,EAAM,EAAI,EAAU,MAChH,EAAK,YAAY,QAEjB,EAAK,eAAiB,EAEtB,EAAK,cAAgB,OAAO,OAAO,MACnC,IAAF,cACInhD,IAAI,EAAU,GAAS,GACvB,EAAK,IAAI,iBAAiB,EAAO,EAAK,cAAc,GAAM,SAAG,IAyCjE,SAA4B,EAAM,GAChC,IAAK,EAAM,QAAS,OAAO,EAC3B,GAAI,EAAM,iBAAkB,OAAO,EACnC,IAAKA,IAAI,EAAO,EAAM,OAAQ,GAAQ,EAAK,IAAK,EAAO,EAAK,WAC1D,IAAK,GAAyB,IAAjB,EAAK,UACb,EAAK,YAAc,EAAK,WAAW,UAAU,GAChD,OAAO,EACX,OAAO,EA/CC,CAAmB,EAAM,IAAW,GAAiB,EAAM,KAC1D,EAAK,UAAc,EAAM,QAAQ,IACpC,EAAQ,EAAM,MALlB,IAAGA,IAAI,KAAS,GAAQ,KAWtBzoB,EAAQ,QAAQ,EAAK,IAAI,iBAAiB,SAAO,kBAAQ,QAE3D,GAAc,GzBad,CAAU,MAEV,KAAK,YAAc,GACnB,KAAK,qB,gDACN,IAiTH,SAAS,GAAe,GACtByoB,IAAI,EAAQ,OAAO,OAAO,MAc1B,OAbA,EAAM,MAAQ,cACd,EAAM,gBAAkB,OAAO,EAAK,UAEpC,EAAK,SAAS,cAAY,SAAE,GAE1B,GADoB,mBAAT,IAAqB,EAAQ,EAAM,EAAK,QAC/C,EAAO,IAAKA,IAAI,KAAQ,EACd,SAAR,EACF,EAAM,OAAS,IAAM,EAAM,GACnB,EAAM,IAAiB,mBAAR,GAAqC,YAAR,IACpD,EAAM,GAAQ,OAAO,EAAM,QAI1B,CAAC,GAAW,KAAK,EAAG,EAAK,MAAM,IAAI,QAAQ,KAAM,IAG1D,SAAS,GAAoB,GAC3B,GAAI,EAAK,WAAY,CACnBA,IAAI,EAAM,SAAS,cAAc,OACjC,EAAI,aAAa,mBAAoB,QACrC,EAAK,cAAgB,KAAC,EAAK,KAAM,GAAW,OAAO,EAAK,MAAM,UAAU,KAAM,EAAK,CAAC,KAAK,EAAM,MAAO,EAAK,mBAE3G,EAAK,cAAgB,KAIzB,SAAS,GAAY,GACnB,OAAQ,EAAK,SAAS,YAAU,SAAE,UAA+B,IAAtB,EAAM,EAAK,UAQxD,SAAS,GAAe,GACtBA,IAAI,EAAS,GAKb,OAJA,EAAK,SAAS,aAAW,SAAE,GACzB,IAAKA,IAAI,KAAQ,EAAU,OAAO,UAAU,eAAe,KAAK,EAAQ,KACtE,EAAO,GAAQ,EAAI,OAEhB,EAnVPuE,GAAI,qBACF,GAAI,KAAK,OAAO,OAAS,KAAK,MAAO,CACnCvE,IAAI,EAAO,KAAK,OAEhB,IAAKA,IAAI,KADT,KAAK,OAAS,GACG,EAAM,KAAK,OAAO,GAAQ,EAAK,GAChD,KAAK,OAAO,MAAQ,KAAK,MAE3B,OAAO,KAAK,Q,aAMd,gBAAO,GACD,EAAM,iBAAmB,KAAK,OAAO,iBAAiB,GAAgB,MAC1E,KAAK,OAAS,EACd,KAAK,iBAAiB,EAAM,OAAO,I,aAOrC,kBAAS,GACPA,IAAI,EAAU,GACd,IAAKA,IAAI,KAAQ,KAAK,OAAQ,EAAQ,GAAQ,KAAK,OAAO,GAE1D,IAAKA,IAAIr+B,KADT,EAAQ,MAAQ,KAAK,MACJ,EAAO,EAAQA,GAAQ,EAAMA,GAC9C,KAAK,OAAO,I,aAMd,qBAAY,GACV,KAAK,iBAAiB,EAAO,KAAK,MAAM,SAAW,EAAM,U,aAG3D,0BAAiB,EAAO,G,WAClB,EAAO,KAAK,MAAO,GAAS,EAAO,GAAY,EAQnD,GALI,EAAM,aAAe,KAAK,YAC5B,GAAiB,MACjB,GAAY,GAEd,KAAK,MAAQ,EACT,EAAc,CAChBq+B,IAAI,EAAY,GAAe,OAsSrC,SAA0B,EAAG,GAC3BA,IAAI,EAAK,EAAG,EAAK,EACjB,IAAKA,IAAI,KAAQ,EAAG,CAClB,GAAI,EAAE,IAAS,EAAE,GAAO,OAAO,EAC/B,IAEF,IAAKA,IAAI,KAAK,EAAG,IACjB,OAAO,GAAM,GA5SL,CAAiB,EAAW,KAAK,aACnC,KAAK,UAAY,EACjB,GAAS,GAEX,GAAgB,MAGlB,KAAK,SAAW,GAAY,MAC5B,GAAoB,MACpBA,IAAI,EAAY,GAAgB,MAAO,EAAY,GAAe,MAE9D,EAAS,EAAe,QACtB,EAAM,kBAAoB,EAAK,kBAAoB,eAAiB,WACtE,EAAY,IAAW,KAAK,QAAQ,YAAY,EAAM,IAAK,EAAW,IACtE,GAAc,EAAM,UAAU,GAAG,EAAK,aAAY,GAAY,GAClEA,IxBiC+B,EAC7B,EACA,EwBqO2B,EAAM,EACjC,EmBpUwB,E,MACxB4hD,EnB0DE,EAAyB,YAAV,GAAwB,GAA8C,MAAjC,KAAK,IAAI,MAAM,gBmBvFpE,SAAwBv3B,GAG7B,IAFArqB,IACI6hD,EAAQC,EADR16B,EAAOiD,EAAK3Z,IAAI6W,wBAAyB0hB,EAASnnE,KAAKsvB,IAAI,EAAGg2B,EAAKrR,KAE9Dsf,GAAKjO,EAAKK,KAAOL,EAAKM,OAAS,EAAG8jB,EAAIvC,EAAS,EACnDuC,EAAI1pE,KAAKiJ,IAAIg3E,YAAa36B,EAAKI,QAASgkB,GAAK,EAAG,CACnDxrC,IAAI0Q,EAAM2Z,EAAK6f,KAAKG,iBAAiBhV,EAAGmW,GACxC,GAAI96B,GAAO2Z,EAAK3Z,KAAQ2Z,EAAK3Z,IAAIkI,SAASlI,GAA1C,CACA1Q,IAAIgiD,EAAYtxC,EAAI6W,wBACpB,GAAIy6B,EAAUjsC,KAAOkzB,EAAS,GAAI,CAChC4Y,EAASnxC,EACToxC,EAASE,EAAUjsC,IACnB,QAGJ,MAAO,QAAC8rC,EAAM,OAAEC,EAAQ7pD,MAAOoxC,EAAYhf,EAAK3Z,MnByEmD,CAAe,MAEhH,GAAI,EAAW,CACb,KAAK,YAAY,OAMjB1Q,IAAI,EAAiB,IAAczoB,EAAQ,IAAMA,EAAQ,UAAY,KAAK,YACrE,EAAK,UAAU,QAAU,EAAM,UAAU,QA8PnB,EA9PoD,EAAK,UA8PnD,EA9P8D,EAAM,UA+PrG,EAAQ,KAAK,IAAI,EAAK,QAAQ,YAAY,EAAK,MAAO,EAAK,QAAQ,YAAY,EAAK,OACjF,EAAK,QAAQ,MAAM,IAAU,EAAK,QAAQ,MAAM,IA/PnD,GAAI,EAAW,CAKbyoB,IAAI,EAAezoB,EAAQ,OAAU,KAAK,YAAc,KAAK,KAAK,eAAe,UAAa,MAC1F,GAAW,KAAK,QAAQ,OAAO,EAAM,IAAK,EAAW,EAAW,QAClE,KAAK,QAAQ,gBAAgB,IAC7B,KAAK,QAAQ,UACb,KAAK,QAAU,EAAY,EAAM,IAAK,EAAW,EAAW,KAAK,IAAK,OAEpE,IAAiB,KAAK,cAAa,GAAiB,GAMtD,KACE,KAAK,WAAa,KAAK,YAAY,iBAAiB,GAAG,KAAK,KAAK,kBxBI1C,EwBJgF,KxBK7G,EAAY,EAAK,QAAQ,WAAW,EAAK,MAAM,UAAU,QACzD,EAAS,EAAK,KAAK,eAChB,EAAqB,EAAU,KAAM,EAAU,OAAQ,EAAO,WAAY,EAAO,gBwBNlF,GAAe,KAAM,IAErB,GAAkB,KAAM,EAAM,WAC9B,KAAK,YAAY,mBAEnB,KAAK,YAAY,QAKnB,GAFA,KAAK,kBAAkB,GAET,SAAV,EACF,KAAK,IAAI,UAAY,OAChB,GAAc,gBAAV,EAA0B,CACnCyoB,IAAI,EAAW,KAAK,KAAK,eAAe,UACpC,KAAK,SAAS,2BAAyB,SAAE,UAAK,EAAE99B,QAE3C,EAAM,qBAAqB,gBAClC,EAAmB,KAAM,KAAK,QAAQ,YAAY,EAAM,UAAU,MAAM,wBAAyB,GAEjG,EAAmB,KAAM,KAAK,YAAY,EAAM,UAAU,KAAM,GAAI,SAC7D,I,GmB7Ge,EnB8GT,GmB9GmB,O,IAAQ,O,UAC1C0/E,EAAYC,EAASA,EAAOt6B,wBAAwBxR,IAAM,EAC9DuzB,EAAmBrxC,EAAoB,GAAb2pD,EAAiB,EAAIA,EAAYE,K,anBgH3D,8BAEE,IADA9hD,IAAI,EACG,EAAO,KAAK,YAAY,OAAW,EAAK,SAAS,EAAK,W,aAG/D,2BAAkB,GAChB,GAAK,GAAa,EAAU,SAAW,KAAK,MAAM,QAOhD,IAAKA,IAAI78B,EAAI,EAAGA,EAAI,KAAK,YAAY,OAAQA,IAAK,CAChD68B,IAAI,EAAa,KAAK,YAAY78B,GAC9B,EAAW,QAAQ,EAAW,OAAO,KAAM,OATQ,CACzD,KAAK,qBACL,IAAK68B,IAAI,EAAI,EAAG,EAAI,KAAK,MAAM,QAAQ,OAAQ,IAAK,CAClDA,IAAI,EAAS,KAAK,MAAM,QAAQ,GAC5B,EAAO,KAAK,MAAM,KAAK,YAAY,KAAK,EAAO,KAAK,KAAK,U,aAiBnE,kBAAS,EAAU,GACjBA,IAAiD,EAA7C,EAAO,KAAK,QAAU,KAAK,OAAO,GACtC,GAAY,MAAR,IAAiB,EAAQ,EAAI,EAAE,GAAQ,GAAO,OAAO,EACzDA,IAAI,EAAU,KAAK,MAAM,QACzB,GAAI,EAAS,IAAKA,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACpDA,IAAIjb,EAAO,EAAQ,GAAG,MAAM,GAC5B,GAAY,MAARA,IAAiB,EAAQ,EAAI,EAAEA,GAAQA,GAAO,OAAO,I,aAM7D,oBACE,OAAO,KAAK,KAAK,eAAiB,KAAK,K,aAKzC,iBACE,KAAK,YAAY,OACb,KAAK,UmBjJN,SAA4B2rB,GACjC,GAAIA,EAAIuxC,UAAW,OAAOvxC,EAAIuxC,YAC9B,GAAIzY,EAAwB,OAAO94B,EAAIyd,MAAMqb,GAE7CxpC,IAAIo2B,EAASiT,EAAY34B,GACzBA,EAAIyd,MAAgC,MAA1Bqb,EAAiC,CACzC,oBAEE,OADAA,EAAyB,CAAC0Y,eAAe,IAClC,SAEPj6E,GACCuhE,IACHA,GAAyB,EACzBF,EAAmBlT,EAAQ,InBoIR,CAAmB,KAAK,KAC3C,GAAe,MACf,KAAK,YAAY,SAQnB7xB,GAAI,oBACFvE,IAAI,EAAS,KAAK,MAClB,GAAc,MAAV,EAAgB,IAAKA,IAAI,EAAS,KAAK,IAAI,WAAY,EAAQ,EAAS,EAAO,WACjF,GAAuB,GAAnB,EAAO,UAAqC,IAAnB,EAAO,UAAkB,EAAO,KAE3D,OADK,EAAO,eAAc,OAAO,eAAe,GAAQ,aAAY,kBAAS,SAAS,iBAC/E,KAAK,MAAQ,EAGxB,OAAO,GAAU,U,aAWnB,qBAAY,GACV,OAAO,EAAY,KAAM,I,aAU3B,qBAAY,EAAK,GACf,Y,UADsB,GACf,EAAY,KAAM,EAAK,I,aAQhC,kBAAS,GACP,OAAO,KAAK,QAAQ,WAAW,I,aAYjC,iBAAQ,GACNA,IAAI,EAAO,KAAK,QAAQ,OAAO,GAC/B,OAAO,EAAO,EAAK,QAAU,M,aAY/B,kBAAS,EAAM,EAAQ,Q,WAAQ,GAC7BA,IAAI,EAAM,KAAK,QAAQ,WAAW,EAAM,EAAQ,GAChD,GAAW,MAAP,EAAa,MAAM,IAAI,WAAW,sCACtC,OAAO,G,aAUT,wBAAe,EAAK,GAClB,OAAO,EAAe,KAAM,GAAS,KAAK,MAAO,I,aAMnD,mBACO,KAAK,WyBzRP,SAAsB,GAEzB,IAAGA,IAAI,KADP,EAAG,YAAY,OACA,EAAK,cACpB,EAAK,IAAI,oBAAoB,EAAM,EAAK,cAAc,IACtD,aAAW,EAAK,kBAChB,aAAW,EAAK,6BzBqRhB,CAAa,MACb,KAAK,qBACD,KAAK,SACP,KAAK,QAAQ,OAAO,KAAK,MAAM,IAAK,GAAI,GAAgB,MAAO,MAC/D,KAAK,IAAI,YAAc,IACd,KAAK,IAAI,YAClB,KAAK,IAAI,WAAW,YAAY,KAAK,KAEvC,KAAK,QAAQ,UACb,KAAK,QAAU,O,aAIjB,uBAAc,GACZ,OyBxQG,SAAuB,EAAM,GAC7B,GAAiB,EAAM,KAAU,GAAS,EAAM,QAChD,EAAK,UAAc,EAAM,QAAQ,IACpC,GAAS,EAAM,MAAM,EAAM,GzBqQpB,CAAc,KAAM,I,aAW7B,kBAAS,GACPA,IAAI,EAAsB,KAAK,OAAO,oBAClC,EAAqB,EAAoB,KAAK,KAAM,GACnD,KAAK,YAAY,KAAK,MAAM,MAAM,K,qCAE1C,K,6G2B9UYmiD,EAA0B,SAACrsC,EAAUnwC,G,OAAY,SAAAg+B,GACvDvsB,MAAMA,QAAX,K,EACa,CAAX0+B,I,IAEG,IAAI3yC,EAAJ,EAAWygD,EAAQ9N,EAAxB,OAAyC3yC,EAAzC,EAAoDA,IAAK,C,IACjD+I,EAASk2E,EAAqBtsC,EAArBssC,IAAkCz+C,EAAjD,W,GACA,EAAY,C,IACJ0+C,EAAQC,EAAiBp2E,EAAjBo2E,OAAd,G,GACID,IAAJ,E,OACE,G,OAIN,IA8BWE,EAAsB,SAAA58E,G,OAAW,SAAAg+B,G,GACxC6+C,EAAgB7+C,EAApB,WAAmC,C,MACVA,EADU,UACzB1D,EADyB,QAClBC,EADkB,M,GAG9Bv6B,aAAmBwhC,EAAnBxhC,UACCs6B,EAAMA,OAAOA,WAAWA,EAAxBA,QAAuCA,EAAvCA,aADF,IAEAA,EAAMA,OAAOA,eACXA,EADFA,QAEEA,EAFFA,aAGEt6B,EANJ,M,OASS88E,EACL9+C,EAAA,YACe1D,EADf,IAC0BC,EAD1B,oBAGgB,IAAIwiD,EAAJ,cAAkB/+C,EAAGA,IAAIA,QAAQ1D,EAJnD,Q,OAQJ,IAaW0iD,EAAmB,SAACtkE,G,IAAU7F,EAAX,yD,OAAuB,SAAAmrB,G,IAC/Ci/C,EAAgB9/C,qBAAmBa,EAAGA,IAAIA,QAA1Bb,MAAtB,G,OACA,EACSa,EAAGA,aAAV,GAEF,IAGIk/C,EAAmB,SAAA5gD,G,OAAQA,EAAKA,MAAQA,EAAKA,KAAKA,KAA/B,YAGnBlB,EAAe,SAACkB,EAAMhkB,EAAK0lB,G,OAFR,SAAA1B,G,OAAQ4gD,EAAiBA,IAAS5gD,EAAKA,KAAvC,OAGnB6gD,CAAJ,GACSn/C,EAAGA,aAAa,IAAI++C,EAAJ,cAAkB/+C,EAAGA,IAAIA,QAAhD,KAEKg/C,EAAiBA,EAAjBA,CAAP,IAeWI,EAAa,SAACp9E,EAAS0Y,EAAU2kE,G,OAAiB,SAAAr/C,G,IACvDs/C,EAAN,iBAA2B5kE,EACnB4hB,EAAU0D,EAFiD,gBAG7Du/C,EAAaD,EACft/C,EAAGA,IAAIA,QADQs/C,GAEfT,EAAgB7+C,EAAhB6+C,WACA7+C,EAAGA,IAAIA,QAAQ1D,EAAMA,IADrBuiD,GAFJ,EAKQt2E,EAAWg3E,EARgD,O,GAW/DV,EAAgB7+C,EAAhB6+C,YAAJ,GACE,K,EACKD,EAAoBA,EAApBA,CAAL5+C,I,OAEE,E,GAKAw/C,EAAJ,IACE,K,EACKhB,EAAwBj2E,EAAxBi2E,QAALx+C,IACkB,C,IACV1lB,EAAM4kE,EAAiBA,G,EAEzB,OAAkBK,EAFVL,OAGRK,EAHJ,I,OAIOniD,EAAaA,EAASA,EAA7B,G,GAKAqiD,EAAUA,EAAd,GAAoC,C,EAClC,OAAUF,EAAV,O,IACMjlE,EAAMglE,EACRC,EADQD,IAERJ,EAAiBl9E,G,EAEjB,sBAFA,EAGAg+B,EAAGA,UAAUA,QALjB,I,OAMO8+C,EAAQ1hD,EAAaA,EAASA,EAArC,I,IAIG,IAAI59B,EAAI+/E,EAAb,MAA+B//E,EAA/B,EAAsCA,IAAK,C,IACnC8a,EAAMilE,EAAWA,MAAvB,GACM5iC,EAAO3c,EAAGA,IAAIA,QAApB,G,GACIy/C,EAAUA,EAAd,G,SACE,YACOX,EAAQ1hD,EAAaA,EAASA,EAArC,I,OAGJ,ICvLWyhD,EAAkB,SAAA/hD,G,OACtBA,aAAqBiiD,EAA5B,eAKWW,EAAgB,SAACvtC,EAAU7T,G,OAEnC7qB,MAAMA,QAAQA,IAAa0+B,EAASA,QAAQ7T,EAAjB6T,OAA5B,GACA7T,EAAKA,OAFP,GAQWwgD,EAAU,SAAA9+C,G,OACdrhC,OAAOA,OAAOA,OAAOA,OAArBA,cAA6C+1B,KAApD,QAOWiqD,EAAmB,SAACjkE,EAAU1Y,G,OAAY,SAAAg+B,G,IAC/C1B,EAAO0B,EAAGA,IAAIA,OAApB,GACM2c,EAAO3c,EAAGA,IAAIA,QAApB,G,GACI4b,EAAWA,EAAf,GAA+B,C,IAEvB9X,G,EADD9D,EAAGA,YAAYA,EAAUtlB,EAAW4jB,EAApC0B,SAAL,IACiBA,UAAUA,MAAMA,IAAjC,E,SAEKg/C,EAAiB7gF,KAAKA,IAAIA,EAA1B6gF,OAALh/C,G,EAEKg/C,EAAiBh/C,EAAGA,UAAUA,MAA9Bg/C,SAALh/C,GACO8+C,EAAP,G,OAEF,IAKWljC,EAAa,SAACe,EAAM36C,G,IACzBs8B,EAAOqe,EAAKA,KAAKA,EAAvB,O,OAEEre,GACAA,EAAKA,KAAKA,aACRt8B,aAAmBwhC,EAAnBxhC,WAAwCwhC,gBAH5C,KAWWm8C,EAAkB,SAAAjlE,G,OAAY,SAAAslB,G,IACnC1B,EAAO0B,EAAGA,IAAIA,OAApB,G,OACO8+C,EAAQ9+C,EAAGA,OAAOA,EAAUtlB,EAAW4jB,EAA9C,aAKWshD,EAAiB,SAAA5gD,G,GACxBA,EAAOA,OAAX,e,OACSA,EAAOA,OAAd,e,IAEI6gD,EAAN,G,cACA,KAAY7gD,EAAZ,gBAAkC,SAAA14B,G,IAC1B6rC,EAAWnT,EAAOA,MAAxB,GACImT,EAASA,KAAb,Y,EACQA,EAASA,KAAf,iB,EAGJ,wBACA,GAaWstC,EAAY,SAAC9iC,EAAM36C,G,IACxB4P,EAAQ+qC,EAAd,Q,OAEI36C,aAAmBwhC,EAAvB,SACSmZ,EAAKA,OAAOA,WAAWA,EAAOA,EAArC,GACS36C,aAAmB89E,EAAvB,MACEnjC,EAAKA,OAAOA,eAAeA,EAAOA,EAAO36C,EAAhD,OAOSw9E,EAAmB,SAAAlhD,G,OACtBA,GAA4BA,cAAnBA,EAAKA,KAAKA,MAA3B,IAAmDA,EAAKA,UAe7CyhD,EAAa,SAACC,G,IAAU/gB,EAAuB,uDAAT,K,OACjD,EACS+gB,EAASA,cAAcA,KAA9B,GAGKA,EAAP,iBAKWC,EAAiB,SAAAx8B,G,OAAQ,SAAA3mB,G,QAC9BxkB,EAAM4nE,eAAapjD,EAAUA,YAAYA,MAA/C,IACMgH,EAAQhH,EAAUA,YAAYA,OAApC,GACMqjD,EAAQ7nE,EAAIA,YAAlB,GACM8nE,EAAgB9nE,EAAIA,YACxBA,EAAIA,YACFwkB,EAAUA,YAAYA,IADxBxkB,EAEEwkB,EAAUA,UAAUA,IAHxB,IAOSt9B,EAAJ,EAAWygD,EAAQkgC,EAAxB,OAAsC3gF,EAAtC,EAAiDA,I,IAC/C,IAAI4gF,EAAcA,QAAQD,EAAtBC,I,OACF,E,OAIJ,IAyBWC,EAAY,SAAAhtE,G,OAChBA,EAAM,GAAGiF,KAAI,c,OACXjF,EAAMiF,KAAI,SAAAgoE,G,OAAUA,EAAV,UA8BRC,EAAgC,SAAAC,G,QACrCloE,EAAM4nE,eAAZ,GACMO,EAAN,GACSC,EAAT,EAAuBA,EAAWpoE,EAAlC,OAA8CooE,IAAY,C,QAClDC,EAAN,GACMt/C,EAAN,GAESu/C,EAAT,EAAuBA,EAAWtoE,EAAlC,MAA6CsoE,IAAY,C,IACjDC,EAAUvoE,EAAIA,IAAIooE,EAAWpoE,EAAXooE,MAAxB,GACMI,EAAON,EAAUA,OAAvB,GACM/8B,EAAOnrC,EAAIA,SAAjB,GACI+oB,EAAKA,IAAYoiB,EAAKA,MAA1B,E,EACE,Y,EAGF,M,EAEA,S,EAGF,Q,OAGF,GA6BWs9B,EAAgC,SAACP,EAAWQ,G,QACjDC,EAAN,GACM3oE,EAAM4nE,eAAZ,GACSQ,EAAT,EAAuBA,EAAWpoE,EAAlC,OAA8CooE,IAAY,C,QAClDQ,EAAMV,EAAUA,MAAtB,GACMG,EAAN,GAESC,EAAT,EAAuBA,EAAWtoE,EAAlC,MAA6CsoE,I,GACtCI,EAAaA,GAAlB,G,KAGMH,EAAUvoE,EAAIA,IAAIooE,EAAWpoE,EAAXooE,MAAxB,GAEMI,EAAOE,EAAaA,GAA1B,GAEMG,EADUX,EAAUA,OAA1B,GACwBY,KAAKA,cAC3BziF,OAAOA,OAAOA,GAAImiF,EADJM,OAEdN,EAFcM,QAGdN,EAHF,O,EAKA,Q,EAGF,KAAYI,EAAIA,KAAKA,cAAcA,EAAvBA,QAA4CA,EAAxD,Q,OAGeV,EAAUA,KAAKA,cAC9BA,EADeA,QAGfA,EAHF,QAoCIa,EAAuB,SAAC,EAAD,O,IAMvBC,EAAYC,EAAcA,GAAKC,EAAnBD,MAAhB,EAEME,EAAgBhB,EAAKA,OAAOc,EAAZd,GAA8Bc,EAApD,QACMG,EAAiBD,EAAcA,OAASA,GAAMA,EAAIA,EAAxD,EACI79E,S,UAEA+9E,OAAJ,IAAgCL,EACrBE,EAAcA,GAAvB,EAC+BG,IAAtBA,IAAJ,IAA+BL,EAC3BE,EAAcA,EAAcA,OAA5BA,KAAT,GAGEF,MACIE,EADJF,GAEIE,EAAcA,EAAcA,OAA5BA,GAHN,E,EAMF,aAAAf,EAAwB,CAAC78E,EAAQ,GAAGwF,OAApC,IACA,GAGWw4E,EAAwB,SAAC,EAAD,O,IAO7BC,EAAeA,kDAAfA,iBAAN,8D,GAEA,KAHkBC,EAAcA,GAAdA,EAAlB,I,IAIE,IAAIC,EAAQA,MAAMA,EAAGA,EAAQA,OAAzBA,c,MACI,IAAI5vE,MAAV,Q,IAGF,IAAI4vE,EAAQA,MAAMA,GAAGA,QAAQA,G,MACrB,IAAI5vE,MAAV,G,OAIJ,GpD1WW6vE,EAAiB,SAAAvG,G,OAAa,Y,IAAGn/C,EAAH,Q,OACzC2lD,EAA2BA,EADc,KAU9BA,EAA6B,SAACtlC,EAAM8+B,G,IAC1C,IAAIj8E,EAAIm9C,EAAb,MAAyBn9C,EAAzB,EAAgCA,IAAK,C,IAC7B8+B,EAAOqe,EAAKA,KAAlB,G,GACI8+B,EAAJ,G,MACS,C,IACAj8E,EAAIA,EAAIm9C,EAAKA,OAAbn9C,GADA,E,MAEEm9C,EAAKA,MAFP,G,MAAA,E,UAkBAulC,EAAmB,SAACzG,EAAW0G,G,OAAa,SAAArlD,G,IACjDv0B,EAASy5E,EAAeA,EAAfA,CAAf,G,GACA,E,OACSI,EAAgB75E,EAAhB65E,IAAP,KAYSC,EAAgB,SAAA5G,G,OAAa,SAAA3+C,G,QAC/BklD,EAAeA,EAAfA,CAAT,KASWvD,EAAuB,SAAAtsC,G,OAAY,SAAArV,G,OACvCklD,GAAe,SAAA1jD,G,OAAQohD,EAAcA,EAAtBphD,KAAf0jD,CAAP,KAkEWM,EAA2B,SAAAxlD,G,IAC9BmK,EAAenK,EAD4B,iBAE7CylD,EAAiBpjD,qBAAmBrC,EAAnBqC,OAAvB,G,GACIojD,GAAJ,EAAkC,C,IAE1Bh6E,EAASk2E,EAAqBx3C,EAArBw3C,MAAf,G,OACA,EACSl2E,EAAP,IAEKg6E,EAAeA,MAAtB,MAWSH,EAAkB,SAAC1nE,EAAUynE,G,IAClCp1C,EAAMo1C,EAAZ,GACM7jD,EAAOyO,EAAIA,KAAKA,WAAWA,EAAjC,Q,OAEIA,EAAIA,KAAKA,WAAase,KAA1B,UACSte,EAAIA,KAAX,WAGGzO,GAAQA,EAAKA,WAAa+sB,KAA/B,UAIA,EAHSte,EAAP,MW7JSkoB,EAAU,SAAC32B,G,IAAMkkD,IAAmB,yD,IAC/C,E,MACQ,IAAIrwE,MAAV,4B,IAEI/Q,EAAN,G,SACA,aAAiB,c,KACf,KAAY,CAAEk9B,KAAF,EAAehkB,IAA3B,KACA,E,OACE,KAGJ,GASWmoE,EAAe,SAACnkD,EAAMm9C,EAAW+G,G,IAC5C,E,MACQ,IAAIrwE,MAAV,4BACK,M,MACC,IAAIA,MAAV,iC,OAEK8iD,EAAQ32B,EAAMkkD,GAASjqE,QAAO,SAAAqrB,G,OAAS63C,EAAU73C,EAAnB,UAiD1B8+C,EAAqB,SAACpkD,EAAM6T,EAAUqwC,G,OAC1CC,EAAankD,GAAM,SAAAsF,G,OAASA,EAAMA,OAAf,IAA1B,I0CtDF,IAAa++C,EAAY,SAAA7lD,G,OACvBklD,GACE,SAAA1jD,G,OAAQA,EAAKA,KAAKA,KAAKA,WAAvB,UAAoCA,EAAKA,KAAKA,KAAKA,YADrD0jD,CADuBllD,IAaZ8lD,EAAkB,SAAA9lD,G,OACtBA,aAAqB+lD,EAA5B,eAmEWC,EAAkB,SAAAhmD,G,GACzB8lD,EAAJ,GAAgC,C,IACxBtqE,EAAM4nE,eAAapjD,EAAUA,YAAYA,MAA/C,I,OACOmjD,EAAe,C,KAAA,E,MAEb3nE,EAFa,M,IAAA,E,OAIZA,EAAImsC,QAJPw7B,CAAP,G,OAQF,GASW8C,EAAmB,SAAAC,G,OAAe,SAAAlmD,G,IACvCiT,EAAQ4yC,EAAd,G,GACA,EAAW,C,IACHrqE,EAAM4nE,eAAanwC,EAAzB,M,OACgBt8B,MAAMA,QAAQA,GAAdA,EAEZA,MAAMA,KAAK,CAFf,KAGew2B,QAAO,c,GAChBr4B,GAASA,GAAKA,GAAS0G,EAAIA,MAA/B,EAA0C,C,IAClC6nE,EAAQ7nE,EAAI2qE,YAAY,C,KAAA,E,MAErBrxE,EAFqB,E,IAAA,E,OAIpB0G,EAAImsC,S,OAEPy+B,EAAI95E,OACT+2E,EAAM7nE,KAAI,SAAAw5D,G,IACFxzC,EAAOyR,EAAMA,KAAKA,OAAxB,GACMz1B,EAAMw3D,EAAU/hC,EAAtB,M,MACO,CAAEz1B,IAAF,EAAOwpB,MAAOxpB,EAAd,EAAuBgkB,KAA9B,UAZR,OA0BS6kD,EAAgB,SAAAzC,G,OAAY,SAAA5jD,G,IACjCiT,EAAQ4yC,EAAd,G,GACA,EAAW,C,IACHrqE,EAAM4nE,eAAanwC,EAAzB,M,OACgBt8B,MAAMA,QAAQA,GAAYA,EAAWA,MAAMA,KAAK,CAAhE,KACew2B,QAAO,c,GAChBr4B,GAASA,GAAKA,GAAS0G,EAAIA,OAA/B,EAA2C,C,IACnC6nE,EAAQ7nE,EAAI2qE,YAAY,C,KAAA,E,MAErB3qE,EAFqB,M,IAAA,E,OAIpB1G,EAAQ,I,OAEXsxE,EAAI95E,OACT+2E,EAAM7nE,KAAI,SAAAw5D,G,IACFxzC,EAAOyR,EAAMA,KAAKA,OAAxB,GACMz1B,EAAMw3D,EAAU/hC,EAAtB,M,MACO,CAAEz1B,IAAF,EAAOwpB,MAAOxpB,EAAd,EAAuBgkB,KAA9B,UAZR,OA4CE8kD,EAAS,SAAA98E,G,OAAQ,c,OAAmB,SAAA05B,G,IAClC+P,EAAQ4yC,EAAU3iD,EAAxB,WACMqjD,EAAN,QAAuB/8E,E,GACvB,EAAW,C,IACHgS,EAAM4nE,eAAanwC,EAAzB,M,GAGIn+B,GAASA,GAAKA,GAASyxE,EAAiB/qE,EAAjB+qE,OAA8B/qE,EAAzD,OAAqE,C,IAC/DwrC,EAAOu/B,EAAiBA,EAA5B,EACIjxC,EAAMixC,EAAiBA,EAA3B,EACIt/B,EAAQs/B,EAAiB/qE,EAAjB+qE,MAA6BzxE,EAAzC,EACIiyC,EAASw/B,EAAiBzxE,EAAjByxE,EAA6B/qE,EAA1C,O,GAEA,EAAY,C,IACJwoE,EAAOwC,EAAqBtjD,EAAGA,UAArC,O,IACA,E,OACE,E,IAGIujD,EAAUjrE,EAAIA,SAASwoE,EAAKA,IAAM/wC,EAAxC,OACA,G,EACQ5xC,KAAKA,IAAIA,EAAKolF,EAApBnxC,K,EACSj0C,KAAKA,IAAIA,EAAQolF,EAA1B1/B,U,EAEO1lD,KAAKA,IAAIA,EAAMolF,EAAtBz/B,M,EACQ3lD,KAAKA,IAAIA,EAAOolF,EAAxBx/B,Q,IAIEy/B,EAAkBlrE,EAAI2qE,YAAY,C,KAAA,E,IAAA,E,MAG/BI,EAAiBA,EAAQv/B,EAHM,E,OAI9Bu/B,EAAiBjxC,EAAjBixC,EAA2Bx/B,IAG/B4/B,EACJ5/B,EAASA,GAAQA,EAAjBA,EAEIvrC,EAAI2qE,YAAY,C,KACRI,EAAiBA,EAAOt/B,EADhB,E,IAETs/B,EAAiBx/B,EAAjBw/B,EAFS,E,MAAA,E,WAOhBt5D,EAAOgmB,EAAMA,MAAQyzC,EAA3B,GACM/9B,EAAS1V,EAAMA,MAAQ0zC,EAAeA,EAAeA,OAA3D,GACM3lD,EAAQkC,EAAGA,IAAIA,QAArB,GACMuoC,EAAUvoC,EAAGA,IAAIA,QAAvB,G,OAEO8+C,EAAQ9+C,EAAGA,aAAa,IAAI6iD,EAAJ,gBAA/B,M,OAGJ,KAYWa,EAAeN,EAArB,UAWMO,EAAYP,EAAlB,OAmeMQ,EAAa,SAAAlD,G,OAAY,SAAA1gD,G,IAC9B+P,EAAQ4yC,EAAU3iD,EAAxB,W,GACA,EAAW,C,IACH1nB,EAAM4nE,eAAanwC,EAAzB,M,GAEI2wC,GAAYA,GAAKA,GAAYpoE,EAAjC,OAA6C,C,QACrCkoE,EAAYzwC,EAAlB,KACMgvB,EAAa6gB,EAAeY,EAAUA,KAA5C,QAEIqD,EAAS9zC,EAAb,MACSvwC,EAAT,EAAgBA,EAAIkhF,EAApB,EAAkClhF,I,GACtBghF,EAAUA,MAAMA,GAA1B,S,IAGIsD,EAAWtD,EAAUA,MAA3B,GAEIL,EAAJ,GACI4D,EAAJ,E,KACA,SAAiB,SAAAjD,GAGf,IAAIA,EAAKA,MAAMA,U,GACDA,EAAKA,MAAjB,Q,EACA,KACE/hB,EAAW+hB,EAAKA,KAAKA,KAArB/hB,yBACE+hB,EADF/hB,MAEE+hB,EAHJ,YAUAiD,EAAWzrE,EAAf,MAA0B,C,QACpB0rE,EAAJ,G,WADwB,G,IAGlBC,EAAaC,EAAiB,GAAG,c,IAC7BC,EAAUrD,EAAKA,KAAKA,MAA1B,Q,OAEOqD,EAAUA,GADC3kF,EAAlB,EACA,IAHe0kF,CAAjB,G,EAKA,WAAAF,E,sHAAA,MANOxkF,EAAT,EAAuBA,GAAvB,EAA+BA,I,EAAtBA,GASLwkF,EAAJ,Q,EACE,SAAqB,SAAAlD,G,EACdsD,EAAatD,EAAM,C,QACbA,EAAKA,KAAKA,MAAMA,QAAU,GADhCsD,CAALpkD,M,OAOCo/C,EAAWrgB,EAAWA,IAAIA,OAAO+kB,EAAtB/kB,MAAXqgB,MAAP,I,OAKJ,IAWWiF,EAAiB,SAAArB,G,OAAe,SAAAhjD,G,IACrC+P,EAAQ4yC,EAAU3iD,EAAxB,W,GACA,EAAW,C,IACH1nB,EAAM4nE,eAAanwC,EAAzB,M,GACoBizC,IAAhBA,GAAJ,IAAyB1qE,EAAIA,M,OACpBgsE,EAAP,GACK,GAAItB,GAAeA,GAAKA,GAAe1qE,EAAvC,M,sBACL,EAEE,C,IAAA,E,WAEcy3B,EAFd,M,MAGSA,EAAMzR,MALjB,GASOwgD,EAAP,G,OAGJ,IAWWyF,EAAc,SAAA7D,G,OAAY,SAAA1gD,G,IAC/B+P,EAAQ4yC,EAAU3iD,EAAxB,W,GACA,EAAW,C,IACH1nB,EAAM4nE,eAAanwC,EAAzB,M,GACiB2wC,IAAbA,GAAJ,IAAsBpoE,EAAIA,O,OACjBgsE,EAAP,GACK,GAAI5D,GAAYA,GAAKA,GAAYpoE,EAAjC,O,mBACL,EAEE,C,IAAA,E,WAEcy3B,EAFd,M,MAGSA,EAAMzR,MALjB,GASOwgD,EAAP,G,OAGJ,IAWWwF,EAAc,SAAAtkD,G,QACjB1D,EAAU0D,EADa,gBAEtB0G,EAAQpK,EAAjB,MAA8BoK,EAA9B,EAAyCA,IAAS,C,GAEhD,UADWpK,EAAMA,KAAjB,GACSgC,KAAKA,KAAKA,U,OACVwgD,EAAQ9+C,EAAGA,OAAO1D,EAAMA,OAAhB0D,GAA+B1D,EAAMA,MAApD,K,OAGJ,GAmMW8nD,EAAe,SAACtD,EAAMz6C,G,OAAU,SAAArG,G,OAC3C,G,EACE,cAAiB8gD,EAAjB,SAAiCniF,OAAOA,OAAOA,GAAImiF,EAAKA,KAAvBniF,MAAjC,IACOmgF,EAAP,IAEF,IAyDWwE,EAAuB,SAAA3mC,G,OAG3BslC,EAA2BA,GAFhB,SAAA3jD,G,OAChBA,EAAKA,KAAKA,KAAKA,WAAa,QAAQjuB,KAAKiuB,EAAKA,KAAKA,KADnC,eAaPkmD,EAA2B,SAAA7nC,G,IAChCmkC,EAAOwC,EAAb,G,GACA,EAAU,C,IACFvzC,EDpiC2B,SAAA4M,G,OAG5BslC,EAA2BA,GAFhB,SAAA3jD,G,OAChBA,EAAKA,KAAKA,KAAKA,WAAa,SAASjuB,KAAKiuB,EAAKA,KAAKA,KADpC,cCmiCFmmD,CAAd,GACMnsE,EAAM4nE,eAAanwC,EAAzB,MACM8wC,EAAUC,EAAKA,IAAM/wC,EAA3B,M,OACOz3B,EAAIA,YAAYA,EAAvB,KAIE4rE,EAAmB,SAACxD,EAAUjF,G,OAAc,SAAAz7C,G,IAC5CikD,EAAJ,GACM9D,EAAQgD,EAAcA,EAAdA,CAAwBnjD,EAAtC,W,GACA,E,IACO,IAAInV,EAAIs1D,EAAMA,OAAnB,EAA+Bt1D,GAA/B,EAAuCA,IACjC4wD,EAAU0E,EAAV1E,GAAJ,I,EACE,KAAgB0E,EAAhB,I,OAKN,IASWuE,GAA4B,SAAA1B,G,OAAe,SAAAhjD,G,QAClDwI,EAAJ,EACIC,EAAJ,E,WAF4D,G,IAMpD03C,EAAQ4C,EAAiBA,EAAjBA,CAAoB/iD,EAAlC,WACA,G,EACE,SAAc,SAAA8gD,G,IACR6D,EAAgB7D,EAAKA,KAAKA,MAAMA,QAAUA,EAA9C,EACI6D,GAAJ,I,EACE,GAEEA,EAAJ,I,EACE,OATCnlF,EAAT,EAA0BA,GAA1B,EAAkCA,I,EAAzBA,G,eALmD,G,IAqBpD2gF,EAAQ4C,EAAiBA,EAAjBA,CAAoB/iD,EAAlC,WACA,G,EACE,SAAc,SAAA8gD,G,IACR6D,EAAgB7D,EAAKA,KAAKA,MAAMA,QAAUA,EAA9C,EACIA,EAAKA,KAAKA,MAAMA,QAAUA,GAAK6D,EAAnC,I,EACE,O,IANCnlF,EAAT,EAA0BA,GAA1B,EAAyCA,I,EAAhCA,G,IAaHolF,EAAN,G,IACSplF,EAAT,EAAyBA,GAAzB,EAAwCA,IAAK,C,IACrCqlF,EAAa9B,EAAiBA,EAAjBA,CAAoB/iD,EAAvC,WACI6kD,GAAcA,EAAlB,Q,EACE,KAAArlF,G,EAGSolF,EAAb,G,EACWA,EAAQA,EAAQA,OAA3B,G,QAEME,EAA2B/B,EAAiBA,EAAjBA,CAA6B/iD,EAA9D,WACM+kD,EAAgB5B,EAAcA,EAAdA,CAAiBnjD,EAAvC,WACMuoC,EAAUvoC,EAAGA,IAAIA,QACrB8kD,EAAyBA,EAAyBA,OAAlDA,GADF,KAIIE,SACKxlF,EAAT,EAAuBA,GAAvB,EAAwCA,IAAK,C,IACrCylF,EAAclC,EAAiBA,EAAjBA,CAAoB/iD,EAAxC,W,GACIilD,GAAeA,EAAnB,OAAuC,C,IAChC,IAAIp6D,EAAIk6D,EAAcA,OAA3B,EAAuCl6D,GAAvC,EAA+CA,I,GACzCk6D,EAAcA,GAAGA,MAAQE,EAAYA,GAAzC,IAAiD,C,EACpCA,EAAX,G,SAIJ,E,aAOG,CAAE1c,QAAF,EAAWzqC,MADJkC,EAAGA,IAAIA,QAAQglD,EAA7B,KACyBJ,QAAzB,KASWM,GAAyB,SAAAxE,G,OAAY,SAAA1gD,G,QAC5CwI,EAAJ,EACIC,EAAJ,E,WAFsD,GAKtC06C,EAAcA,EAAdA,CAAiBnjD,EAA/B,WACA,SAAc,SAAA8gD,G,IACR6D,EAAgB7D,EAAKA,KAAKA,MAAMA,QAAUA,EAA9C,EACI6D,GAAJ,I,EACE,GAEEA,EAAJ,I,EACE,OARGnlF,EAAT,EAAuBA,GAAvB,EAA+BA,I,EAAtBA,G,eAJ6C,GAkBtC2jF,EAAcA,EAAdA,CAAiBnjD,EAA/B,WACA,SAAc,SAAA8gD,G,IACR6D,EAAgB7D,EAAKA,KAAKA,MAAMA,QAAUA,EAA9C,EACIA,EAAKA,KAAKA,MAAMA,QAAUA,GAAK6D,EAAnC,I,EACE,O,IALGnlF,EAAT,EAAuBA,GAAvB,EAAsCA,I,EAA7BA,G,IAWHolF,EAAN,G,IACSplF,EAAT,EAAyBA,GAAzB,EAAwCA,IAAK,C,IACrCqlF,EAAa1B,EAAcA,EAAdA,CAAiBnjD,EAApC,WACI6kD,GAAcA,EAAlB,Q,EACE,KAAArlF,G,EAGSolF,EAAb,G,EACWA,EAAQA,EAAQA,OAA3B,G,QAEMO,EAAwBhC,EAAcA,EAAdA,CAA0BnjD,EAAxD,WACMolD,EAAmBrC,EAAiBA,EAAjBA,CAAoB/iD,EAA7C,WACMuoC,EAAUvoC,EAAGA,IAAIA,QACrBmlD,EAAsBA,EAAsBA,OAA5CA,GADF,KAIIH,SACKxlF,EAAT,EAAuBA,GAAvB,EAAwCA,IAAK,C,IACrCmhF,EAAWwC,EAAcA,EAAdA,CAAiBnjD,EAAlC,W,GACI2gD,GAAYA,EAAhB,OAAiC,C,IAC1B,IAAI91D,EAAIu6D,EAAiBA,OAA9B,EAA0Cv6D,GAA1C,EAAkDA,I,GAC5Cu6D,EAAiBA,GAAGA,MAAQzE,EAASA,GAAzC,IAAiD,C,EACpCA,EAAX,G,SAIJ,E,aAOG,CAAEpY,QAAF,EAAWzqC,MADJkC,EAAGA,IAAIA,QAAQglD,EAA7B,KACyBJ,QAAzB,K,2PrDpvC8C,SAACjoC,EAAMxK,G,OAC9C8vC,EAA2BtlC,GAAM,SAAAre,G,OACtCohD,EAAcA,EADwBphD,O,sBAaP,SAAA6T,G,OAAY,SAAArV,G,OACtCulD,GAAc,SAAA/jD,G,OAAQohD,EAAcA,EAAtBphD,KAAd+jD,CAAP,K,yBAUoC,SAAClwC,EAAUgwC,G,OAAa,SAAArlD,G,OACrDolD,GAAiB,SAAA5jD,G,OAAQohD,EAAcA,EAAtBphD,KAAjB,EAAA4jD,CAAP,K,yBAgBoC,SAAA/vC,G,OAAY,SAAArV,G,GAC5C+hD,EAAJ,GAAgC,C,IACtBvgD,EAAgBxB,EADM,KAChBR,EAAUQ,EADM,M,GAE1B4iD,EAAcA,EAAlB,G,MACS,CAAEphD,KAAF,EAAQhkB,IAAKgiB,EAAb,IAAwBoK,MAAOpK,EAAtC,U,8FWlFuB,SAACgC,EAAMkkD,G,OAC3BC,EAAankD,GAAM,SAAAsF,G,OAASA,EAAT,SAA1B,I,kBAS6B,SAACtF,EAAMkkD,G,OAC7BC,EAAankD,GAAM,SAAAsF,G,OAASA,EAAT,WAA1B,I,iBAS4B,SAACtF,EAAMkkD,G,OAC5BC,EAAankD,GAAM,SAAAsF,G,OAASA,EAAT,UAA1B,I,qBASgC,SAACtF,EAAMm9C,EAAW+G,G,OAC3CC,EAAankD,GAAM,SAAAsF,G,QAAW63C,EAAU73C,EAArB,SAA1B,I,4CAmBgC,SAACtF,EAAM0S,EAAUwxC,G,OAC1CC,EAAankD,GAAM,SAAAsF,G,OAASoN,EAASA,QAAQpN,EAA1B,SAA1B,I,WAWsB,SAACtF,EAAM6T,G,QACpBuwC,EAAmBA,EAAMA,GAAlC,Q,qD0CrD8B,SAAA5lD,G,GACzB8lD,EAAL,G,KAGM9+C,EAAQhH,EAAUA,YAAYA,OAApC,G,OACYojD,eAAapjD,EAAUA,YAAYA,MAA/C,IACWxkB,YACTwkB,EAAUA,YAAYA,IADjBxkB,EAELwkB,EAAUA,UAAUA,IAFtB,K,mBAY8B,SAAAkmD,G,OAAe,SAAAlmD,G,GACzC8lD,EAAJ,GAAgC,C,IACxBtqE,EAAM4nE,eAAapjD,EAAUA,YAAYA,MAA/C,I,OACOmjD,EAAe,C,KAAA,E,MAEb+C,EAFa,E,IAAA,E,OAIZ1qE,EAAImsC,QAJPw7B,CAAP,G,OAQF,I,gBAS2B,SAAAS,G,OAAY,SAAA5jD,G,GACnC8lD,EAAJ,GAAgC,C,IACxBtqE,EAAM4nE,eAAapjD,EAAUA,YAAYA,MAA/C,I,OACOmjD,EAAe,C,KAAA,E,MAEb3nE,EAFa,M,IAAA,E,OAIZooE,EAAW,GAJdT,CAAP,G,OAQF,I,6EA6F6B,SAAAnjD,G,IACvBiT,EAAQ4yC,EAAd,G,GACA,EAAW,C,IACHrqE,EAAM4nE,eAAanwC,EAAzB,M,OACcz3B,EAAI2qE,YAAY,C,KAAA,E,MAErB3qE,EAFqB,M,IAAA,E,OAIpBA,EAAImsC,SAEDnsC,KAAI,SAAAw5D,G,IACTxzC,EAAOyR,EAAMA,KAAKA,OAAxB,GACMz1B,EAAMw3D,EAAU/hC,EAAtB,M,MACO,CAAEz1B,IAAF,EAAOwpB,MAAOxpB,EAAd,EAAuBgkB,KAA9B,Q,6CA4FqB,SAAA0B,G,IACnB+P,EAAQ4yC,EAAU3iD,EAAxB,W,GACA,EAAW,C,IACD1nB,EAAQ4nE,eAAanwC,EADpB,U,GAELz3B,GAAOA,EAAX,OAAuB,C,IACfyR,EAAOgmB,EAAMA,MAAQz3B,EAA3B,GACMmtC,EAAS1V,EAAMA,MAAQz3B,EAAIA,EAAIA,OAArC,GACMwlB,EAAQkC,EAAGA,IAAIA,QAArB,GACMuoC,EAAUvoC,EAAGA,IAAIA,QAAvB,G,OAEO8+C,EAAQ9+C,EAAGA,aAAa,IAAI6iD,EAAJ,gBAA/B,M,OAGJ,G,YAYuB,SAAC/B,EAAM9hD,G,OAAW,SAAAgB,G,GACzC,EAAU,C,IACAh+B,EAAY49E,EAAeA,GAAQA,KADnC,wB,IAEHkB,EAAKA,KAAKA,QAAQA,GAAvB,G,SACE,YAAeA,EAAKA,IAApB,EAA6BA,EAAKA,IAAMA,EAAKA,KAA7C,YACOhC,EAAP,G,OAGJ,I,cAWyB,SAAAkE,G,OAAe,SAAAhjD,G,IAClC+P,EAAQ4yC,EAAU3iD,EAAxB,W,GACA,EAAW,C,IACH1nB,EAAM4nE,eAAanwC,EAAzB,M,GACIizC,GAAeA,GAAKA,GAAe1qE,EAAvC,M,OACSwmE,EACL,EAAAuG,UAAA,EAEE,C,IAAA,E,WAEct1C,EAFd,M,MAGSA,EAAMzR,MANnB,I,OAaJ,I,UAkJqB,SAACgnD,EAAgBC,EAAgBC,G,OAAS,SAAAxlD,G,IAEzDt8B,EAAU/E,OAAOA,OADA,CAAE8mF,UAAF,EAAmBnE,UAA1C,GACA,GACMvxC,EAAQ4yC,EAAU3iD,EAAxB,W,IACA,E,OACE,E,IAGe0lD,EAAqBR,GAAuBA,EAAvBA,CAR+B,WAWpDS,EAAqBT,GAAuBA,EAAvBA,CAX+B,W,GAejEQ,EAAiBA,QAAQA,IAA7B,E,OACE,GAGGhiF,EAAD,UAAqBiiF,EAAiBA,OAA1C,G,EACE,a,IAQIC,ED7NoB,SAAC,EAAD,O,IAMtBnF,EAAOF,EAA8BxwC,EAAzC,M,SAEOsxC,EAAqBA,EAAMA,EAAeA,EAAjD,GAEON,EAA8BhxC,EAA9BgxC,KAAP,GCmNiB8E,CAAaA,EAAbA,IAIfniF,EAJF,W,OAOOo7E,EAAQA,GAAIA,YACjB/uC,EADK+uC,IAEL/uC,EAAMA,IAAMA,EAAMA,KAFb+uC,SAAP,K,aAuIwB,SAAC,EAAD,K,OAIrB,SAAA9+C,G,IAEGt8B,EAAU/E,OAAOA,OADA,CAAE8mF,UAAF,EAAmBnE,UAA1C,GACA,GACMvxC,EAAQ4yC,EAAU3iD,EAAxB,W,IACA,E,OACE,E,IAGe8lD,EAAwBpB,GAA0BA,EAA1BA,CARhC,WAWQqB,EAAwBrB,GAA0BA,EAA1BA,CAXhC,W,GAeLoB,EAAoBA,QAAQA,IAAhC,E,OACE,GAGGpiF,EAAD,UAAqBqiF,EAAoBA,OAA7C,G,EACE,gB,IAQIH,EDzZuB,SAAC,EAAD,O,IAMzBnF,EAAOJ,EAAUE,EAA8BxwC,EAAnD,O,SAEOsxC,EAAqBA,EAAMA,EAAeA,EAAjD,G,EACOhB,EAAPI,GAEOM,EAA8BhxC,EAA9BgxC,KAAP,GC8YiBiF,CAAgBA,EAAhBA,IAIftiF,EAJF,W,OAOOo7E,EAAQA,GAAIA,YACjB/uC,EADK+uC,IAEL/uC,EAAMA,IAAMA,EAAMA,KAFb+uC,SAAP,K,WAqBsB,SAAC4B,EAAUuF,G,OAAqB,SAAAjmD,G,IAChD+P,EAAQ4yC,EAAU3iD,EAAxB,W,GACA,EAAW,C,IACH1nB,EAAM4nE,eAAanwC,EAAzB,MACMm2C,EAAgBxF,EAAtB,E,GAEIuF,GAAoBC,GAAxB,E,OACSpH,EAAQ8E,EAAWA,EAAXA,CAAf,I,GAGElD,GAAYA,GAAKA,GAAYpoE,EAAjC,O,OACSwmE,EACL,EAAAqH,OAAA,EAEE,C,IAAA,E,WAEcp2C,EAFd,M,MAGSA,EAAMzR,MANnB,I,OAaJ,I,0FA+JmC,SAAA0B,G,IAC3BlD,EAAckD,EADmB,U,GAErC8iD,EAAJ,G,OACSwB,EAAP,G,GAEE1B,EAAJ,GAAgC,C,IACxB7yC,EAAQ4yC,EAAd,G,GACA,EAAW,C,IACHrqE,EAAM4nE,eAAanwC,EAAzB,MACM0T,EAAOnrC,EAAIA,YACfwkB,EAAUA,YAAYA,IAAMiT,EADjBz3B,MAEXwkB,EAAUA,UAAUA,IAAMiT,EAF5B,O,GAKiB0T,GAAbA,EAAKA,MAAaA,EAAKA,OAASnrC,EAApC,M,OACE,E,QAGI8tE,EAAcznF,OAAOyX,OAAO,GAAIqtC,EAAM,C,IAAA,E,MAEnC1T,EAFmC,K,WAG9BA,EAAMjM,QAGXtkC,EAAI4mF,EAAYA,MAAzB,E,eACE,OACI5mF,IAAM4mF,EAAV,KAFoC5mF,I,EAKpC,MAAoB4mF,EAAYA,WAC5BpmD,EAAGA,IAAIA,OAAOomD,EAAYA,WADVA,GAEhBpmD,EAFJ,I,EAGA,IAAkBkgD,eAAakG,EAA/B,O,OAEKtH,EAAP,I,OAGJ,G,qBAWgC,SAAA9+C,G,IACxBlD,EAAckD,EADgB,U,GAElC8iD,EAAJ,G,OACSwB,EAAP,G,GAEE1B,EAAJ,GAAgC,C,IACxB7yC,EAAQ4yC,EAAd,G,GACA,EAAW,C,IACHrqE,EAAM4nE,eAAanwC,EAAzB,MACM0T,EAAOnrC,EAAIA,YACfwkB,EAAUA,YAAYA,IAAMiT,EADjBz3B,MAEXwkB,EAAUA,UAAUA,IAAMiT,EAF5B,O,GAKgB0T,GAAZA,EAAKA,KAAYA,EAAKA,QAAUnrC,EAApC,O,OACE,E,QAGI8tE,EAAcznF,OAAOyX,OAAO,GAAIqtC,EAAM,C,IAAA,E,MAEnC1T,EAFmC,K,WAG9BA,EAAMjM,QAGXtkC,EAAI4mF,EAAYA,OAAzB,E,YACE,OACI5mF,IAAM4mF,EAAV,IAFqC5mF,I,EAKrC,MAAoB4mF,EAAYA,WAC5BpmD,EAAGA,IAAIA,OAAOomD,EAAYA,WADVA,GAEhBpmD,EAFJ,I,EAGA,IAAkBkgD,eAAakG,EAA/B,O,OAGKtH,EAAP,I,OAGJ,G,2BAWsC,SAAAniC,G,OAAQ,SAAA3c,G,IACxCyjB,EAAO+gC,EAAb,G,OACA,EACSH,EAAe5gC,EAAf4gC,MAA0BrF,EAAiBriC,EAAjBqiC,KAAjC,IAEF,I,wBAWmC,SAAAriC,G,OAAQ,SAAA3c,G,IACrCyjB,EAAO+gC,EAAb,G,OACA,EACSD,EAAY9gC,EAAZ8gC,KAAsBvF,EAAiBriC,EAAjBqiC,KAA7B,IAEF,I,sBAYiC,SAAC,EAAD,K,OAI9B,SAAAh/C,G,IACGmgD,EAAQ4C,EAAiBA,EAAjBA,CAA8B/iD,EAA5C,W,GACA,EAAW,C,IACJ,IAAIxgC,EAAI2gF,EAAMA,OAAnB,EAA+B3gF,GAA/B,EAAuCA,I,EAChC6mF,EAAclG,EAAdkG,GAALrmD,G,GAEF,EAAyB,C,IACjB2c,EAAO3c,EAAGA,IAAIA,QAAQA,EAAGA,QAAQA,IAAImgD,EAAMA,EAAMA,OAAZA,GAA3C,M,EACA,aAAgBhhD,iBAAhB,I,OAEK2/C,EAAP,G,OAEF,I,mBAY8B,SAAC,EAAD,K,OAI3B,SAAA9+C,G,IACGmgD,EAAQgD,EAAcA,EAAdA,CAAwBnjD,EAAtC,W,GACA,EAAW,C,IACJ,IAAIxgC,EAAI2gF,EAAMA,OAAnB,EAA+B3gF,GAA/B,EAAuCA,I,EAChC6mF,EAAclG,EAAdkG,GAALrmD,G,GAEF,EAAyB,C,IACjB2c,EAAO3c,EAAGA,IAAIA,QAAQA,EAAGA,QAAQA,IAAImgD,EAAMA,EAAMA,OAAZA,GAA3C,M,EACA,aAAgBhhD,iBAAhB,K,OAGJ,I,+BA8ByB,SAAC,G,QAE1BmnD,EAIG,uDAJS,EACZC,EAGG,uDAHS,EACZC,IAEG,yDADHvnB,EACG,uDADW,K,EAOV2gB,EAND,GAEK6G,EAFL,OAGYC,EAHZ,cAIIC,EAJJ,MAKD52C,EALC,QAQGowC,EAAN,GACMyG,EAAN,GACSpnF,EAAT,EAAgBA,EAAhB,EAA+BA,I,EAC7B,KAAWugF,EAAWA,EAAtB,IAEA,G,EACE,KAAiBA,EAAWA,EAA5B,I,QAIEU,EAAN,GACSjhF,EAAT,EAAgBA,EAAhB,EAA+BA,I,EAC7B,KACEmnF,EAASA,cAAcA,KAErBH,OAAiBhnF,EAAjBgnF,EAHJ,I,OAQKz2C,EAAMA,cAAcA,KAA3B,I,0IFhnCoC,SAAAoC,G,OAAY,SAAAnS,G,IAC1Cz3B,EAASk2E,EAAqBA,EAArBA,CAA+Bz+C,EAA9C,W,OACA,EACS2/C,EAAgBp3E,EAAhBo3E,KAAP,GAEF,I,iDAqCgC,SAAA3/C,G,GAC5B6+C,EAAgB7+C,EAApB,WAAmC,C,IAC3BlP,EAAOkP,EAAGA,UAAUA,MAA1B,IACMjB,EAAKiB,EAAGA,UAAUA,IAAxB,I,OACO8+C,EAAQ9+C,EAAGA,OAAOA,EAAzB,I,OAEF,G,kFA6IiC,SAACmS,EAAU7rC,EAAM+/B,EAAO7I,G,OAAU,SAAAwC,G,IAC7Dz3B,EAASk2E,EAAqBA,EAArBA,CAA+Bz+C,EAA9C,W,OACA,EACS8+C,EACL9+C,EAAGA,cACDz3B,EADFy3B,MAGErhC,OAAOA,OAAOA,GAAI4J,EAAOA,KAAzB5J,MAHFqhC,GADF,IASF,I,yBAWoC,SAAAmS,G,OAAY,SAAAnS,G,IAC3C6+C,EAAgB7+C,EAArB,WAAoC,C,IAC5Bz3B,EAASk2E,EAAqBA,EAArBA,CAA+Bz+C,EAA9C,W,GACA,E,OACS8+C,EAAQ9+C,EAAGA,aAAa++C,uBAAqB/+C,EAArB++C,IAA6Bx2E,EAA5D,O,OAGJ,I,mBAW8B,SAAAy3B,G,IACxBtlB,EAAW4nE,EAAyBtiD,EAA1C,W,MACA,iBAAWtlB,EACFilE,EAAgBA,EAAhBA,CAAP,GAEF,I,mxBG3LK,SAASkH,EAAWC,EAAUzgD,GACnC,OAAO,SAASthC,EAAOkjD,GACrB,MAAmBljD,EAAM+3B,UAApBR,EAAA,EAAAA,MAAOC,EAAA,EAAAA,IACRuf,EAAQxf,EAAMqL,WAAWpL,GAAMwqD,GAAS,EAAOC,EAAalrC,EAChE,IAAKA,EAAO,OAAO,EAEnB,GAAIA,EAAMpV,OAAS,GAAKpK,EAAMgC,KAAKwd,EAAMpV,MAAQ,GAAGpgC,KAAKg6C,kBAAkBwmC,IAAiC,GAApBhrC,EAAMtT,WAAiB,CAE7G,GAAoC,GAAhClM,EAAM1qB,MAAMkqC,EAAMpV,MAAQ,GAAS,OAAO,EAC9CrK,IAAI4qD,EAAUliF,EAAM43B,IAAI3e,QAAQ89B,EAAMhY,MAAQ,GAC9CkjD,EAAa,IAAI,YAAUC,EAASA,EAASnrC,EAAMpV,OAC/CoV,EAAMrT,SAAWqT,EAAMvzC,OAAOw8B,aAChC+W,EAAQ,IAAI,YAAUxf,EAAOv3B,EAAM43B,IAAI3e,QAAQue,EAAIsH,IAAIiY,EAAMpV,QAASoV,EAAMpV,QAC9EqgD,GAAS,EAEX1qD,IAAIwU,EAAO,YAAam2C,EAAYF,EAAUzgD,EAAOyV,GACrD,QAAKjL,IACDoX,GAAUA,EAKlB,SAAsBjoB,EAAI8b,EAAOiC,EAAUmpC,EAAYJ,GAErD,IADAzqD,IAAIr6B,EAAU,WAASw8B,MACdh/B,EAAIu+C,EAASr+C,OAAS,EAAGF,GAAK,EAAGA,IACxCwC,EAAU,WAAS8uB,KAAKitB,EAASv+C,GAAG8G,KAAKuG,OAAOkxC,EAASv+C,GAAG6mC,MAAOrkC,IAErEg+B,EAAGvmB,KAAK,IAAI,IAAkBqiC,EAAMhY,OAASojD,EAAa,EAAI,GAAIprC,EAAMjY,IAAKiY,EAAMhY,MAAOgY,EAAMjY,IAClE,IAAI,QAAM7hC,EAAS,EAAG,GAAI+7C,EAASr+C,QAAQ,IAGzE,IADA28B,IAAIiG,EAAQ,EACH9iC,EAAI,EAAGA,EAAIu+C,EAASr+C,OAAQF,IAASu+C,EAASv+C,GAAG8G,MAAQwgF,IAAUxkD,EAAQ9iC,EAAI,GAIxF,IAHA68B,IAAI8qD,EAAappC,EAASr+C,OAAS4iC,EAE/B8kD,EAAWtrC,EAAMhY,MAAQia,EAASr+C,QAAUwnF,EAAa,EAAI,GAAI3+E,EAASuzC,EAAMvzC,OAC3E/I,EAAIs8C,EAAMtT,WAAY12B,EAAIgqC,EAAMrT,SAAUluB,GAAQ,EAAM/a,EAAIsS,EAAGtS,IAAK+a,GAAQ,GAC9EA,GAAS,YAASylB,EAAGrD,IAAKyqD,EAAUD,KACvCnnD,EAAGl7B,MAAMsiF,EAAUD,GACnBC,GAAY,EAAID,GAElBC,GAAY7+E,EAAOq7B,MAAMpkC,GAAGikC,SAE9B,OAAOzD,EAzBkBqnD,CAAatiF,EAAMi7B,GAAI8b,EAAOjL,EAAMk2C,EAAQD,GAAUrnD,mBACtE,IA8BJ,SAAS28B,EAAckrB,GAC5B,OAAO,SAASviF,EAAOkjD,GACrB,MAAyBljD,EAAM+3B,UAA1BR,EAAA,EAAAA,MAAOC,EAAA,EAAAA,IAAK+B,EAAA,EAAAA,KACjB,GAAKA,GAAQA,EAAKgG,SAAYhI,EAAMoK,MAAQ,IAAMpK,EAAM0L,WAAWzL,GAAM,OAAO,EAChFF,IAAIkrD,EAAcjrD,EAAMgC,MAAM,GAC9B,GAAIipD,EAAYjhF,MAAQghF,EAAU,OAAO,EACzC,GAAiC,GAA7BhrD,EAAM/zB,OAAOvG,QAAQ2Y,MAAa2hB,EAAMgC,MAAM,GAAGyG,YAAczI,EAAMsK,YAAY,GAAI,CAIvF,GAAmB,GAAftK,EAAMoK,OAAcpK,EAAMgC,MAAM,GAAGh4B,MAAQghF,GAC3ChrD,EAAM1qB,OAAO,IAAM0qB,EAAMgC,MAAM,GAAGyG,WAAa,EAAG,OAAO,EAC7D,GAAIkjB,EAAU,CAIZ,IAHA5rB,IAAIwU,EAAO,WAASrS,MAAOgpD,EAAWlrD,EAAM1qB,OAAO,GAAK,EAG/Ci2B,EAAIvL,EAAMoK,OAAS8gD,EAAW,EAAI,GAAI3/C,GAAKvL,EAAMoK,MAAQ,EAAGmB,IACnEgJ,EAAO,WAAS/f,KAAKwL,EAAMgC,KAAKuJ,GAAG/C,KAAK+L,IAE1CA,EAAOA,EAAKvN,OAAO,WAASxS,KAAKw2D,EAASvnD,kBAC1C1D,IAAI2D,EAAKj7B,EAAMi7B,GAAGl+B,QAAQw6B,EAAMmF,OAAO+lD,EAAW,MAAQ,GAAIlrD,EAAMwK,OAAO,GAAI,IAAI,QAAM+J,EAAM22C,EAAW,EAAI,EAAG,IACjHxnD,EAAG5C,aAAar4B,EAAM+3B,UAAU/8B,YAAYq/B,KAAKY,EAAGrD,IAAI3e,QAAQse,EAAMhiB,KAAOktE,EAAW,EAAI,MAC5Fv/B,EAASjoB,EAAGP,kBAEd,OAAO,EAETpD,IAAI6U,EAAW3U,EAAIjiB,KAAOgiB,EAAMuH,MAAQ0jD,EAAY9xC,eAAe,GAAG5K,YAAc,KAChF7K,EAAKj7B,EAAMi7B,GAAG4f,OAAOtjB,EAAMhiB,IAAKiiB,EAAIjiB,KACpC2wB,EAAQiG,GAAY,CAAC,KAAM,CAAC5qC,KAAM4qC,IACtC,QAAK,YAASlR,EAAGrD,IAAKL,EAAMhiB,IAAK,EAAG2wB,KAChCgd,GAAUA,EAASjoB,EAAGl7B,MAAMw3B,EAAMhiB,IAAK,EAAG2wB,GAAOxL,mBAC9C,IAOJ,SAAS88B,EAAa+qB,GAC3B,OAAO,SAASviF,EAAOkjD,GACrB,MAAmBljD,EAAM+3B,UAApBR,EAAA,EAAAA,MAAOC,EAAA,EAAAA,IACRuf,EAAQxf,EAAMqL,WAAWpL,GAAG,SAAE+B,GAAK,OAAGA,EAAKyG,YAAczG,EAAKlS,WAAW9lB,MAAQghF,KACrF,QAAKxrC,KACAmM,IACD3rB,EAAMgC,KAAKwd,EAAMpV,MAAQ,GAAGpgC,MAAQghF,EAO5C,SAAyBviF,EAAOkjD,EAAUq/B,EAAUxrC,GAClDzf,IAAI2D,EAAKj7B,EAAMi7B,GAAI6D,EAAMiY,EAAMjY,IAAK4jD,EAAY3rC,EAAMvf,IAAIsH,IAAIiY,EAAMpV,OAChE7C,EAAM4jD,IAGRznD,EAAGvmB,KAAK,IAAI,IAAkBoqB,EAAM,EAAG4jD,EAAW5jD,EAAK4jD,EACzB,IAAI,QAAM,WAAS32D,KAAKw2D,EAASz6E,OAAO,KAAMivC,EAAMvzC,OAAOu8B,SAAU,EAAG,GAAI,GAAG,IAC7GgX,EAAQ,IAAI,YAAU9b,EAAGrD,IAAI3e,QAAQ89B,EAAMxf,MAAMhiB,KAAM0lB,EAAGrD,IAAI3e,QAAQypE,GAAY3rC,EAAMpV,QAG1F,OADAuhB,EAASjoB,EAAG2d,KAAK7B,EAAO,YAAWA,IAAQrc,mBACpC,EAhBIioD,CAAgB3iF,EAAOkjD,EAAUq/B,EAAUxrC,GAmBxD,SAAuB/2C,EAAOkjD,EAAUnM,GAGtC,IAFAzf,IAAI2D,EAAKj7B,EAAMi7B,GAAI1X,EAAOwzB,EAAMvzC,OAEvB+R,EAAMwhC,EAAMjY,IAAKrkC,EAAIs8C,EAAMrT,SAAW,EAAG32B,EAAIgqC,EAAMtT,WAAYhpC,EAAIsS,EAAGtS,IAC7E8a,GAAOgO,EAAKsb,MAAMpkC,GAAGikC,SACrBzD,EAAG4f,OAAOtlC,EAAM,EAAGA,EAAM,GAE3B+hB,IAAIg3B,EAASrzB,EAAGrD,IAAI3e,QAAQ89B,EAAMhY,OAAQvb,EAAO8qC,EAAOtsB,UACpD9G,EAA8B,GAApB6b,EAAMtT,WAAiBmgC,EAAQ7sB,EAAMrT,UAAYngB,EAAKyc,WAChEx8B,EAAS8qD,EAAO/0B,MAAM,GAAIqpD,EAAct0B,EAAOzhD,OAAO,GAC1D,IAAKrJ,EAAOqzC,WAAW+rC,GAAe1nD,EAAU,EAAI,GAAI0nD,EAAc,EAC/Cp/D,EAAKvmB,QAAQshC,OAAOqlC,EAAQ,WAASnqC,MAAQ,WAAS1N,KAAKxI,KAChF,OAAO,EACT+T,IAAIyH,EAAQuvB,EAAO/4C,IAAKupB,EAAMC,EAAQvb,EAAKkb,SAS3C,OALAzD,EAAGvmB,KAAK,IAAI,IAAkBqqB,GAAS7D,EAAU,EAAI,GAAI4D,GAAO8kC,EAAQ,EAAI,GAAI7kC,EAAQ,EAAGD,EAAM,EACnE,IAAI,SAAO5D,EAAU,WAASzB,MAAQ,WAAS1N,KAAKxI,EAAKwc,KAAK,WAAStG,SAC5D8E,OAAOqlC,EAAQ,WAASnqC,MAAQ,WAAS1N,KAAKxI,EAAKwc,KAAK,WAAStG,SAClEyB,EAAU,EAAI,EAAG0oC,EAAQ,EAAI,GAAI1oC,EAAU,EAAI,IACvFgoB,EAASjoB,EAAGP,mBACL,EAvCImoD,CAAc7iF,EAAOkjD,EAAUnM,MA6CrC,SAASwgB,EAAagrB,GAC3B,OAAO,SAASviF,EAAOkjD,GACrB,MAAmBljD,EAAM+3B,UAApBR,EAAA,EAAAA,MAAOC,EAAA,EAAAA,IACRuf,EAAQxf,EAAMqL,WAAWpL,GAAG,SAAE+B,GAAK,OAAGA,EAAKyG,YAAczG,EAAKlS,WAAW9lB,MAAQghF,KACrF,IAAKxrC,EAAO,OAAO,EACnBzf,IAAImM,EAAasT,EAAMtT,WACvB,GAAkB,GAAdA,EAAiB,OAAO,EAC5BnM,IAAI9zB,EAASuzC,EAAMvzC,OAAQ0+B,EAAa1+B,EAAOq7B,MAAM4E,EAAa,GAClE,GAAIvB,EAAW3gC,MAAQghF,EAAU,OAAO,EAExC,GAAIr/B,EAAU,CACZ5rB,IAAIwrD,EAAe5gD,EAAW1C,WAAa0C,EAAW1C,UAAUj+B,MAAQiC,EAAOjC,KAC3E8+B,EAAQ,WAAStU,KAAK+2D,EAAeP,EAASz6E,SAAW,MACzDvL,EAAQ,IAAI,QAAM,WAASwvB,KAAKw2D,EAASz6E,OAAO,KAAM,WAASikB,KAAKvoB,EAAOjC,KAAKuG,OAAO,KAAMu4B,MAC3EyiD,EAAe,EAAI,EAAG,GACxCpmD,EAASqa,EAAMhY,MAAOgD,EAAQgV,EAAMjY,IACxCokB,EAASljD,EAAMi7B,GAAGvmB,KAAK,IAAI,IAAkBgoB,GAAUomD,EAAe,EAAI,GAAI/gD,EACjCrF,EAAQqF,EAAOxlC,EAAO,GAAG,IAC5Dm+B,kBAEZ,OAAO,G;;;;;EClNX,SAASZ,IAAuB,IAAXC,EAAW,uDAAJ,GAC1B,OAAO,SAAC/5B,EAAOkjD,GAAa,IAKxB3tC,EAFEvV,EAAM+3B,UADRR,MAIQhiB,IADRA,IAGF,OADA2tC,EAASljD,EAAMi7B,GAAGnB,WAAWC,EAAMxkB,KAC5B,GAgBX,SAASmlD,EAAepxC,EAAQ2iB,EAAUtD,GACxC,OAAO,IAAI6kB,IAAUlkC,GAAQ,SAACtpB,EAAOqM,EAAO0yB,EAAOD,GACjD,IAAMwC,EAAQqH,aAAoBlvC,SAAWkvC,EAASt8B,GAASs8B,EAE7D1N,EACEj7B,EADFi7B,GAEIjc,EAAI3S,EAAM1R,OAAS,EACrBooF,EAAUjkD,EACVkkD,EAAYjkD,EAEhB,GAAI1yB,EAAM2S,GAAI,CACZ,IAAMikE,EAAalkD,EAAQ1yB,EAAM,GAAGM,QAAQN,EAAM2S,EAAI,IAChDkkE,EAAWD,EAAa52E,EAAM2S,EAAI,GAAGrkB,OAAS,EAC9CwoF,EAAYF,EAAa52E,EAAM2S,EAAI,GAAG+xB,YAAY1kC,EAAM2S,IACxDokE,EAAUD,EAAY92E,EAAM2S,GAAGrkB,OAQrC,GAlCN,SAAyBokC,EAAOD,EAAK9+B,GACnC,IAAIy4B,EAAQ,GAQZ,OAPAz4B,EAAM43B,IAAI+G,aAAaI,EAAOD,GAAK,SAACvF,EAAMhkB,GACxCkjB,EAAQ,GAAH,SAAOA,GAAP,EAAiBc,EAAKd,MAAMllB,KAAI,SAAAslB,GAAI,MAAK,CAC5CkG,MAAOxpB,EACPupB,IAAKvpB,EAAMgkB,EAAKmF,SAChB7F,gBAGGJ,EAkBmB4qD,CAAgBtkD,EAAOD,EAAK9+B,GAAOwT,QAAO,SAAAgQ,GAI9D,OADIA,EAAKqV,KAAKt3B,KADZ+hF,SAEc3vE,MAAK,SAAApS,GAAI,OAAIA,EAAKtI,OAASgzC,EAAShzC,WACnDua,QAAO,SAAAgQ,GAAI,OAAIA,EAAKsb,IAAMmkD,KAEXtoF,OAChB,OAAO,EAGLyoF,EAAUF,GACZjoD,EAAG4f,OAAOuoC,EAASF,GAGjBC,EAAYF,GACdhoD,EAAG4f,OAAOooC,EAAYE,GAIxBJ,GADAC,EAAYC,GACU52E,EAAM2S,GAAGrkB,OAKjC,OAFAsgC,EAAG+e,QAAQgpC,EAAWD,EAAS92C,EAASnkC,OAAOw5B,IAC/CrG,EAAGjC,iBAAiBiT,GACbhR,KAIX,SAASm7B,EAAe9sC,EAAQ/nB,EAAMonC,GACpC,OAAO,IAAI6kB,IAAUlkC,GAAQ,SAACtpB,EAAOqM,EAAO0yB,EAAOD,GACjD,IAAMwC,EAAQqH,aAAoBlvC,SAAWkvC,EAASt8B,GAASs8B,EAE7D1N,EACEj7B,EADFi7B,GAOF,OAJI5uB,EAAM,IACR4uB,EAAGrB,YAAYmF,EAAQ,EAAGD,EAAKv9B,EAAKuG,OAAOw5B,IAGtCrG,KAIX,SAASigC,EAAW5xC,EAAQ/nB,EAAMonC,GAsChC,OAAO,IAAIrmB,SAAO,CAChBmb,MAAO,CACL8lD,gBAAiB,SAAAhnF,GAAK,OAAI,IAAI8rC,QAvClB,SAAVtW,EAAUsf,GACd,IAAMhQ,EAAQ,GAiCd,OAhCAgQ,EAAS/2C,SAAQ,SAAAukC,GACf,GAAIA,EAAMQ,OAAQ,KAKZhzB,EAHF0tB,EACE8E,EADF9E,KAEExkB,EAAM,EAGV,GAGE,GAFAlJ,EAAQid,EAAOlxB,KAAK2hC,GAET,CACT,IAAMgF,EAAQ1yB,EAAMQ,MACdiyB,EAAMC,EAAQ1yB,EAAM,GAAG1R,OACvB2mC,EAAQqH,aAAoBlvC,SAAWkvC,EAASt8B,EAAM,IAAMs8B,EAE9D5J,EAAQ,GACVsC,EAAM1yB,KAAKkwB,EAAMc,IAAIpqB,EAAKwpB,IAG5BsC,EAAM1yB,KAAKkwB,EAAMc,IAAIZ,EAAOD,GAAKjG,KAAKt3B,EAAKuG,OAAOw5B,GAAOxI,SAAS+F,EAAMpG,SACxEljB,EAAMupB,SAEDzyB,GAELkJ,EAAMwkB,EAAKp/B,QACb0mC,EAAM1yB,KAAKkwB,EAAMc,IAAIpqB,SAGvB8rB,EAAM1yB,KAAKkwB,EAAMkB,KAAKhO,EAAQ8M,EAAM5hC,cAGjCwhC,WAAS0C,UAAUE,GAKYtP,CAAQx1B,EAAMU,SAAUV,EAAM45C,UAAW55C,EAAMwvC,aAKzF,SAAS4uB,EAAerxC,EAAQ/nB,EAAMonC,GA0CpC,OAAO,IAAIrmB,SAAO,CAChBmb,MAAO,CACL8lD,gBAAiB,SAAAhnF,GAAK,OAAI,IAAI8rC,QA3ClB,SAAVtW,EAAWsf,EAAU7tC,GACzB,IAAM69B,EAAQ,GAqCd,OApCAgQ,EAAS/2C,SAAQ,SAAAukC,GACf,GAAIA,EAAMQ,OAAQ,CAShB,IATgB,IAMZhzB,EAJF0tB,EAEE8E,EAFF9E,KAGExkB,EAAM,EAEJiuE,IAHF3kD,EADFpG,MAIqBjlB,QAAO,SAAAm5C,GAAC,MAAoB,SAAhBA,EAAEprD,KAAKtI,QAAiB,IAEnDuqF,GAA0C,QAA/Bn3E,EAAQid,EAAOlxB,KAAK2hC,KACrC,GAAIv2B,GAAUA,EAAOjC,KAAK8qC,eAAe9qC,IAAS8K,EAAM,GAAI,CAC1D,IAAM0yB,EAAQ1yB,EAAMQ,MACdiyB,EAAMC,EAAQ1yB,EAAM,GAAG1R,OACvBwoF,EAAYpkD,EAAQ1yB,EAAM,GAAGM,QAAQN,EAAM,IAC3C+2E,EAAUD,EAAY92E,EAAM,GAAG1R,OAC/B2mC,EAAQqH,aAAoBlvC,SAAWkvC,EAASt8B,GAASs8B,EAE3D5J,EAAQ,GACVsC,EAAM1yB,KAAKkwB,EAAMc,IAAIpqB,EAAKwpB,IAI5BsC,EAAM1yB,KAAKkwB,EAAMc,IAAIwjD,EAAWC,GAASvqD,KAAKt3B,EAAKuG,OAAOw5B,GAAOxI,SAAS+F,EAAMpG,SAChFljB,EAAMupB,EAKNvpB,EAAMwkB,EAAKp/B,QACb0mC,EAAM1yB,KAAKkwB,EAAMc,IAAIpqB,SAGvB8rB,EAAM1yB,KAAKkwB,EAAMkB,KAAKhO,EAAQ8M,EAAM5hC,QAAS4hC,QAG1CJ,WAAS0C,UAAUE,GAKYtP,CAAQx1B,EAAMU,SAAUV,EAAM45C,UAAW55C,EAAMwvC,aAKzF,SAASsO,EAAY94C,GACnB,OAAO,SAACvB,EAAOkjD,GAAa,IAExBjoB,EAEEj7B,EAFFi7B,GACAlD,EACE/3B,EADF+3B,UAGAhM,EAEEgM,EAFFhM,KACAiO,EACEjC,EADFiC,GAGAzC,EAEEQ,EAFFR,MAIF,GAFIQ,EADF0B,MAGS,CACT,IAAMsd,EAAQgN,YAAaxsB,EAAOh2B,GAClCwqB,EAAOgrB,EAAMhrB,KACbiO,EAAK+c,EAAM/c,GAIb,OADAiB,EAAGof,WAAWtuB,EAAMiO,EAAIz4B,GACjB2hD,EAASjoB,IAIpB,SAASrU,IAA6C,IAAhCmwB,EAAgC,uDAAxB,KAAMx1C,EAAkB,uCAAZ+/B,EAAY,uDAAJ,GAChD,OAAO,SAACthC,EAAOkjD,GAAa,MAItBljD,EAAM+3B,UAFRR,EAFwB,EAExBA,MACAC,EAHwB,EAGxBA,IAEI3qB,EAAQ0qB,EAAM1qB,QACdkf,EAAOgrB,EAAQA,EAAMhrB,KAAOwL,EAAMhiB,IAClCykB,EAAK+c,EAAQA,EAAM/c,GAAKxC,EAAIjiB,IAElC,QAAKgiB,EAAM/zB,OAAO4zC,eAAevqC,EAAOA,EAAOtL,KAI3C2hD,GACFA,EAASljD,EAAMi7B,GAAGrB,YAAY7N,EAAMiO,EAAIz4B,EAAKuG,OAAOw5B,MAG/C,IAwDX,SAASmiD,EAAuBlB,GAC9B,OAAO,SAAUviF,EAAOkjD,GAAU,MAK5BljD,EAAM+3B,UAHRR,EAF8B,EAE9BA,MACAC,EAH8B,EAG9BA,IACA+B,EAJ8B,EAI9BA,KAEF,GAAIA,GAAQA,EAAKgG,SAAWhI,EAAMoK,MAAQ,IAAMpK,EAAM0L,WAAWzL,GAAM,OAAO,EAC9E,IAAMgrD,EAAcjrD,EAAMgC,MAAM,GAChC,GAAIipD,EAAYjhF,MAAQghF,EAAU,OAAO,EAEzC,GAAiC,GAA7BhrD,EAAM/zB,OAAOvG,QAAQ2Y,KAAW,CAIlC,GAAmB,GAAf2hB,EAAMoK,OAAcpK,EAAMgC,MAAM,GAAGh4B,MAAQghF,GAAYhrD,EAAM1qB,OAAO,IAAM0qB,EAAMgC,MAAM,GAAGyG,WAAa,EAAG,OAAO,EAEpH,GAAIkjB,EAAU,CAKZ,IAJA,IAAIpX,EAAOrN,WAAShF,MACdgpD,EAAWlrD,EAAM1qB,OAAO,GAAK,EAG1Bi2B,EAAIvL,EAAMoK,OAAS8gD,EAAW,EAAI,GAAI3/C,GAAKvL,EAAMoK,MAAQ,EAAGmB,IAAKgJ,EAAOrN,WAAS1S,KAAKwL,EAAMgC,KAAKuJ,GAAG/C,KAAK+L,IAGlHA,EAAOA,EAAKvN,OAAOE,WAAS1S,KAAKw2D,EAASvnD,kBAC1C,IAAMC,EAAKj7B,EAAMi7B,GAAGl+B,QAAQw6B,EAAMmF,OAAO+lD,EAAW,MAAQ,GAAIlrD,EAAMwK,OAAO,GAAI,IAAIsG,QAAMyD,EAAM22C,EAAW,EAAI,EAAG,IACnHxnD,EAAG5C,aAAar4B,EAAM+3B,UAAU/8B,YAAYq/B,KAAKY,EAAGrD,IAAI3e,QAAQse,EAAMhiB,KAAOktE,EAAW,EAAI,MAC5Fv/B,EAASjoB,EAAGP,kBAGd,OAAO,EAGT,IAAMyR,EAAW3U,EAAIjiB,KAAOgiB,EAAMuH,MAAQ0jD,EAAY9xC,eAAenZ,EAAMsK,YAAY,IAAIiE,YAAc,KACnG7K,EAAKj7B,EAAMi7B,GAAG4f,OAAOtjB,EAAMhiB,IAAKiiB,EAAIjiB,KAItC2wB,EAAQiG,GAAY,CAAC,CACvB5qC,KAAMghF,GACL,CACDhhF,KAAM4qC,IAOR,OALKjG,IAAOA,EAAQ,CAAC,CACnB3kC,KAAMghF,GACL,SA1EP,SAAkB3qD,EAAKriB,GAA4B,IAAvBosB,EAAuB,uDAAf,EAAGgW,EAAY,uCAC3CC,EAAOhgB,EAAI3e,QAAQ1D,GACnBsiC,EAAOD,EAAKjW,MAAQA,EACpBmW,EAAYH,GAAcA,EAAWA,EAAWh9C,OAAS,IAAMi9C,EAAKp0C,OAC1E,GAAIq0C,EAAO,GAAKD,EAAKp0C,OAAOjC,KAAKo6B,KAAKqb,YAAcY,EAAKp0C,OAAOqzC,WAAWe,EAAK/qC,QAAS+qC,EAAKp0C,OAAOw8B,cAAgB8X,EAAUv2C,KAAKw2C,aAAaH,EAAKp0C,OAAOvG,QAAQ2iC,WAAWgY,EAAK/qC,QAAS+qC,EAAKp0C,OAAOw8B,aAAc,OAAO,EAE/N,IAAK,IAAI8C,EAAI8U,EAAKjW,MAAQ,EAAGlnC,EAAIknC,EAAQ,EAAGmB,EAAI+U,EAAM/U,IAAKroC,IAAK,CAC9D,IAAM8+B,EAAOqe,EAAKre,KAAKuJ,GACjBj2B,EAAQ+qC,EAAK/qC,MAAMi2B,GACzB,GAAIvJ,EAAKh4B,KAAKo6B,KAAKqb,UAAW,OAAO,EACrC,IAAIgB,EAAOze,EAAKt8B,QAAQ2iC,WAAW/yB,EAAO0sB,EAAKyG,YACzC+B,EAAQ4V,GAAcA,EAAWl9C,IAAM8+B,EAM7C,GALIwI,GAASxI,IAAMye,EAAOA,EAAKnY,aAAa,EAAGkC,EAAMxgC,KAAKuG,OAAOi6B,EAAMT,UAKlE/H,EAAKsd,WAAWhqC,EAAQ,EAAG0sB,EAAKyG,YAAa,OAAO,EAI3D,IAAMnzB,EAAQ+qC,EAAK/V,WAAWgW,GACxBI,EAAWN,GAAcA,EAAW,GAC1C,OAAOC,EAAKre,KAAKse,GAAMT,eAAevqC,EAAOA,EAAOorC,EAAWA,EAAS12C,KAAOq2C,EAAKre,KAAKse,EAAO,GAAGt2C,MAsD5Fm2C,CAASzc,EAAGrD,IAAKL,EAAMhiB,IAAK,EAAG2wB,KAChCgd,GAAUA,EAASjoB,EAAGl7B,MAAMw3B,EAAMhiB,IAAK,EAAG2wB,GAAOxL,mBAC9C,IAKX,SAAS25B,EAAiB9yD,EAAMmiF,GAAwB,IAAZpiD,EAAY,uDAAJ,GAClD,OAAO,SAACthC,EAAOkjD,EAAUvB,GAGvB,OAFiBoJ,YAAa/qD,EAAOuB,EAAM+/B,GAGlC2X,YAAayqC,EAAbzqC,CAAyBj5C,EAAOkjD,EAAUvB,GAG5C1I,YAAa13C,EAAM+/B,EAAnB2X,CAA0Bj5C,EAAOkjD,EAAUvB,IAItD,SAASgiC,EAAOpqD,EAAMU,GACpB,OAAOV,EAAKh4B,OAAS04B,EAAOoH,MAAMuiD,aAAerqD,EAAKh4B,OAAS04B,EAAOoH,MAAMwiD,cAAgBtqD,EAAKh4B,OAAS04B,EAAOoH,MAAMyiD,UAGzH,SAAS5vB,EAAW6tB,EAAUQ,GAC5B,OAAO,SAACviF,EAAOkjD,EAAUvB,GAAS,IAE9B1nB,EAEEj6B,EAFFi6B,OACAlC,EACE/3B,EADF+3B,UAGAR,EAEEQ,EAFFR,MACAC,EACEO,EADFP,IAEIuf,EAAQxf,EAAMqL,WAAWpL,GAE/B,IAAKuf,EACH,OAAO,EAGT,IAAMgtC,EAAa9G,0BAAe,SAAA1jD,GAAI,OAAIoqD,EAAOpqD,EAAMU,KAApCgjD,CAA6CllD,GAEhE,GAAIgf,EAAMpV,OAAS,GAAKoiD,GAAchtC,EAAMpV,MAAQoiD,EAAWpiD,OAAS,EAAG,CACzE,GAAIoiD,EAAWxqD,KAAKh4B,OAASwgF,EAC3B,OAAOvqB,EAAa+qB,EAAb/qB,CAAuBx3D,EAAOkjD,EAAUvB,GAGjD,GAAIgiC,EAAOI,EAAWxqD,KAAMU,IAAW8nD,EAAShqC,aAAagsC,EAAWxqD,KAAKt8B,SAAU,KAEnFg+B,EACEj7B,EADFi7B,GAQF,OANAA,EAAGue,cAAcuqC,EAAWxuE,IAAKwsE,GAE7B7+B,GACFA,EAASjoB,IAGJ,GAIX,OAAO6mD,EAAWC,EAAXD,CAAqB9hF,EAAOkjD,EAAUvB,IAIjD,SAASqS,EAAYzyD,GAAkB,IAAZ+/B,EAAY,uDAAJ,GACjC,OAAO,SAACthC,EAAOkjD,EAAUvB,GAGvB,OAFiBoJ,YAAa/qD,EAAOuB,EAAM+/B,GAGlCsX,YAAK54C,EAAOkjD,GAGd8gC,YAAOziF,EAAM+/B,EAAb0iD,CAAoBhkF,EAAOkjD,EAAUvB,IAIhD,SAASsZ,EAAY15D,EAAM+/B,GACzB,OAAO,SAACthC,EAAOkjD,GAAa,IAExBjoB,EAGEj7B,EAHFi7B,GACAlD,EAEE/3B,EAFF+3B,UACAH,EACE53B,EADF43B,IAGAqb,EAEElb,EAFFkb,OAIF,GAFIlb,EADF0B,MAGS,OAILsqB,YAAahsB,EAAUR,MAAOh2B,GAFhCwqB,EAFO,EAEPA,KACAiO,EAHO,EAGPA,GAGEpC,EAAIqsD,aAAal4D,EAAMiO,EAAIz4B,IAC7B05B,EAAGof,WAAWtuB,EAAMiO,EAAIz4B,GAG1B05B,EAAG+e,QAAQjuB,EAAMiO,EAAIz4B,EAAKuG,OAAOw5B,SAEjC2R,EAAO34C,SAAQ,SAAA4pF,GAAS,IAEpB1sD,EAEE0sD,EAFF1sD,IACAD,EACE2sD,EADF3sD,MAGEK,EAAIqsD,aAAa1sD,EAAMhiB,IAAKiiB,EAAIjiB,IAAKhU,IACvC05B,EAAGof,WAAW9iB,EAAMhiB,IAAKiiB,EAAIjiB,IAAKhU,GAGpC05B,EAAG+e,QAAQziB,EAAMhiB,IAAKiiB,EAAIjiB,IAAKhU,EAAKuG,OAAOw5B,OAI/C,OAAO4hB,EAASjoB,M,kLCzcdkpD,EACJ,SAAYzvE,EAAMw+B,EAAUw7B,GAC1Bl1E,KAAKkb,KAAOA,EACZlb,KAAK05C,SAAWA,EAChB15C,KAAKk1E,OAASA,GA2BlB,IAAM0V,EACJ,SAAY5jF,EAAS6jF,GAMnB7qF,KAAKgH,QAAUA,EAKfhH,KAAK6qF,YAAcA,GAavB5sD,IAAM6sD,EAAY,IAAI,YAAU,UAgBzB,SAASpoB,EAAOnjD,GAIrB,Y,UAJ8B,IAC9BA,EAAS,CAACvY,QAASuY,EAAOvY,SAAW,EAC3Bs7D,SAA6B,MAAnB/iD,EAAO+iD,SAAmB1iE,KAAK2M,MAAsB,WAAhB3M,KAAK6P,UAAyB8P,EAAO+iD,UAEvF,IAAI,SAAO,CAChBlhE,IAAK0pF,EAELtkF,MAAO,CACL0yB,KAAM,WAAG,OAAG,IAAI0xD,EAAYrrE,EAAOvY,QAAS,KAC5C2F,MAAA,SAAM80B,EAAIihC,GACR5kC,IAAI8E,EAAWnB,EAAGV,QAAQ+pD,GAC1B,OAAIloD,IAEAnB,EAAGma,WACE,IAAIgvC,EAAYloB,EAAO17D,QAAS07D,EAAOmoB,YAAYhgF,OAvCpE,SAAyB0pD,GAEvB,IADAz2B,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAIszD,EAAU51B,MAAMx9B,OAAQF,IAC1C4B,EAAOsS,KAAK,IAAIw1E,EAAWp2B,EAAU51B,MAAM19B,GAChBszD,EAAU51B,MAAM19B,GAAGs5C,OAAOga,EAAU/Y,KAAKv6C,IACzCszD,IAC7B,OAAO1xD,EAiCkEkoF,CAAgBtpD,KAC5EihC,K,OAIXnjD,EAGAu6C,sBAAsB,IAkBnB,SAAS2I,EAAmBj8D,EAAOm4B,EAAOqsD,EAAW7lF,GAY1D,IANA24B,IAAImtD,EAAcH,EAAU1mD,SAAS59B,GACjCQ,EAAUikF,EAAYjkF,QAAU23B,EAAMx9B,OACtC+pF,EAAQJ,EAAU/mF,IAAIyC,GAAO27B,KAAK5iB,OAAO+iD,SAGzC6oB,EAAO,EACJA,EAAOH,EAAU7pF,QAAU6pF,EAAUG,IAASD,KAASC,EAC9DrtD,IAAI+sD,EAAcI,EAAYJ,YAAY9nF,MAAMooF,GAIhD,KAHAxsD,EAAQwsD,EAAOxsD,EAAM57B,MAAMooF,GAAQxsD,GAGxBx9B,OACT,OAAOqF,EAAMi7B,GAAGX,QAAQgqD,EAAW,IAAIF,EAAY5jF,EAAS6jF,IAE9D/sD,IAAIstD,EAAeP,EAAY1pF,OAC3BsgC,EAAKj7B,EAAMi7B,GACf,GAAI2pD,EACFP,EA5HG,SAAqBlsD,EAAO0sD,EAAM92B,GACvC,IAAKz2B,IAAI78B,EAAI09B,EAAMx9B,OAAS,EAAGF,GAAK,EAAGA,IAAKszD,EAAUr5C,KAAKyjB,EAAM19B,GAAGy4C,UACpE,IAAK5b,IAAI78B,EAAI,EAAGA,EAAIoqF,EAAKlqF,OAAQF,IAAKszD,EAAUr5C,KAAKmwE,EAAKpqF,IAE1D,IADA68B,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGy+C,EAAU/gB,EAAMx9B,OAAQF,EAAI09B,EAAMx9B,OAAQF,IAAK,CAC7D68B,IAAIqhB,EAASxgB,EAAM19B,GAAGia,KAAKnB,IAAIw6C,EAAU31B,QAAQ77B,MAAM28C,IACvDA,IACIP,IAAWoV,EAAU7Y,UAAUyD,GAAQxD,SACzC4Y,EAAU31B,QAAQkc,UAAU4E,EAAS6U,EAAU51B,MAAMx9B,OAAS,GAC9D0B,EAAOsS,KAAK,IAAIw1E,EAAWxrC,EAAQA,EAAO5E,OAAOga,EAAU/Y,KAAK+Y,EAAU/Y,KAAKr6C,OAAS,IAAKw9B,EAAM19B,GAAGi0E,UAG1G,OAAOryE,EAgHSyoF,CAAYT,EAAalsD,EAAO8C,OACzC,CACL,IAAK3D,IAAI78B,EAAI,EAAGA,EAAI09B,EAAMx9B,OAAQF,IAAKwgC,EAAGvmB,KAAKyjB,EAAM19B,IACrD4pF,EAAc,GAGhB/sD,IAAIytD,EAAiB,IAAIX,EAAY5jF,EAAS6jF,GAM9C,OALI1lF,GAAWA,EAAQqmF,sBAAwBhlF,EAAM+3B,qBAAqB,kBACxEkD,EAAG5C,aAAa,gBAAc4sD,QAAQhqD,EAAGrD,IAAI3e,QAAQgiB,EAAG7C,QAAQ7kB,IAAIvT,EAAM+3B,UAAU2oB,QAAS,IACvDzlB,EAAGrD,IAAI3e,QAAQgiB,EAAG7C,QAAQ7kB,IAAIvT,EAAM+3B,UAAU/S,MAAO,KAAM,IACjGiW,EAAG/C,UAAW,GAET+C,EAAGX,QAAQ,UAAWsqD,GAActqD,QAAQ,gBAAgB,GAAOA,QAAQgqD,EAAWS,GAaxF,SAASnpB,EAAc57D,GAC5Bs3B,IAAImtD,EAAcH,EAAU1mD,SAAS59B,GACrC,OAAsC,GAAlCykF,EAAYJ,YAAY1pF,OAAoB,KACzC,CACL6F,QAASikF,EAAYjkF,QACrB23B,MAAOssD,EAAYJ,YAAY9wE,KAAG,SAAC2hB,GAAE,OAAGA,EAAExgB,QAC1ConD,SAAUwoB,EAAU/mF,IAAIyC,GAAO27B,KAAK5iB,OAAO+iD,SAC3C,cAAgB,OAAOtiE,KAAK0rF,WAAa1rF,KAAK0rF,SAAWT,EAAYJ,YAAY9wE,KAAG,SAAC2hB,GAAE,OAAGA,EAAEw5C,aAOzF,SAAS1S,EAAWh8D,GACzB,OAAOskF,EAAU1mD,SAAS59B,GAAOQ,U;;;;;ECxKnC,SAASqqD,EAAa7qD,EAAOuB,GAAM,MAI7BvB,EAAM+3B,UAFRhM,EAF+B,EAE/BA,KACAiO,EAH+B,EAG/BA,GAEEvB,EAAQ,GACZz4B,EAAM43B,IAAI+G,aAAa5S,EAAMiO,GAAI,SAAAT,GAC/Bd,EAAQ,GAAH,SAAOA,GAAP,EAAiBc,EAAKd,WAE7B,IAAMI,EAAOJ,EAAM9kB,MAAK,SAAAwxE,GAAQ,OAAIA,EAAS5jF,KAAKtI,OAASsI,EAAKtI,QAEhE,OAAI4/B,EACKA,EAAKyI,MAGP,GAGT,SAAS0pB,EAAahrD,EAAOuB,GAAM,MAI7BvB,EAAM+3B,UAFRhM,EAF+B,EAE/BA,KACAiO,EAH+B,EAG/BA,GAEEqH,EAAQ,GACZrhC,EAAM43B,IAAI+G,aAAa5S,EAAMiO,GAAI,SAAAT,GAC/B8H,EAAQ,GAAH,SAAOA,GAAP,CAAc9H,OAErB,IAAMA,EAAO8H,EAAMqF,UAAU/yB,MAAK,SAAAyxE,GAAQ,OAAIA,EAAS7jF,KAAKtI,OAASsI,EAAKtI,QAE1E,OAAIsgC,EACKA,EAAK+H,MAGP,GAGT,SAASyiB,IAAuC,IAA1BnM,EAA0B,uDAAnB,KAAMr2C,EAAa,uDAAN,KACxC,IAAKq2C,IAASr2C,EACZ,OAAO,EAGT,IAAMw9B,EAAQ6Y,EAAKp0C,OAAO6hF,WAAWztC,EAAKlW,cAE1C,IAAK3C,EAAMxF,KACT,OAAO,EAGT,IAAMl4B,EAAO09B,EAAMxF,KAAKd,MAAM9kB,MAAK,SAAAklB,GAAI,OAAIA,EAAKt3B,OAASA,KAEzD,IAAKF,EACH,OAAO,EAQT,IALA,IAAIoiC,EAAamU,EAAK/qC,QAClB6nD,EAAW9c,EAAK7Y,QAAUA,EAAMwC,OAChCmC,EAAWD,EAAa,EACxB6hD,EAAS5wB,EAAW31B,EAAMxF,KAAKmF,SAE5B+E,EAAa,GAAKpiC,EAAKmhC,QAAQoV,EAAKp0C,OAAOq7B,MAAM4E,EAAa,GAAGhL,QACtEgL,GAAc,EACdixB,GAAY9c,EAAKp0C,OAAOq7B,MAAM4E,GAAY/E,SAG5C,KAAOgF,EAAWkU,EAAKp0C,OAAOw8B,YAAc3+B,EAAKmhC,QAAQoV,EAAKp0C,OAAOq7B,MAAM6E,GAAUjL,QACnF6sD,GAAU1tC,EAAKp0C,OAAOq7B,MAAM6E,GAAUhF,SACtCgF,GAAY,EAGd,MAAO,CACL3X,KAAM2oC,EACN16B,GAAIsrD,GAIR,SAAS36B,EAAa3qD,EAAOuB,GAAM,MAM7BvB,EAAM+3B,UAJRhM,EAF+B,EAE/BA,KACAwL,EAH+B,EAG/BA,MACAyC,EAJ+B,EAI/BA,GAIF,OARiC,EAK/BP,QAISl4B,EAAKihC,QAAQxiC,EAAMi4B,aAAeV,EAAMkB,WAG1Cz4B,EAAM43B,IAAIqsD,aAAal4D,EAAMiO,EAAIz4B,GAG5C,SAASgkF,EAAT,GAGG,IAFDr/C,EAEC,EAFDA,MACA3M,EACC,EADDA,KAEA,OAAO7qB,MAAM5U,QAAQosC,IAAUA,EAAMxvB,SAAS6iB,EAAKh4B,OAASg4B,EAAKh4B,OAAS2kC,EAG5E,SAAS6kB,EAAa/qD,EAAOuB,GAAkB,IAAZ+/B,EAAY,uDAAJ,GACnCo1C,EAAY,SAAAn9C,GAAI,OAAIA,EAAKh4B,OAASA,GAElCg4B,EAAOisD,iCAAuBjkF,EAAvBikF,CAA6BxlF,EAAM+3B,YAAcklD,yBAAevG,EAAfuG,CAA0Bj9E,EAAM+3B,WAE9F,OAAKn+B,OAAOkP,KAAKw4B,GAAO3mC,QAAW4+B,EAI5BA,EAAKA,KAAK4f,UAAU53C,EAApB,OAA+Bg4B,EAAKA,KAAK+H,OAC3CA,MAJM/H,I,cC/GbrhC,EAAOC,QAAQ,s2D,6BCuBf,SAASstF,IAUPjsF,KAAKksF,UAAY,GAOjBlsF,KAAKmsF,UAAY,KASnBF,EAAM5rF,UAAU+rF,SAAW,SAAU3sF,GACnC,IAAK,IAAIwB,EAAI,EAAGA,EAAIjB,KAAKksF,UAAU/qF,OAAQF,IACzC,GAAIjB,KAAKksF,UAAUjrF,GAAGxB,OAASA,EAC7B,OAAOwB,EAGX,OAAQ,GAMVgrF,EAAM5rF,UAAUgsF,YAAc,WAC5B,IAAItsF,EAAOC,KACPssF,EAAS,CAAE,IAGfvsF,EAAKmsF,UAAUprF,SAAQ,SAAUwtC,GAC1BA,EAAKi+C,SAEVj+C,EAAKyuB,IAAIj8D,SAAQ,SAAU0rF,GACrBF,EAAOn5E,QAAQq5E,GAAW,GAC5BF,EAAOn3E,KAAKq3E,SAKlBzsF,EAAKosF,UAAY,GAEjBG,EAAOxrF,SAAQ,SAAU2zB,GACvB10B,EAAKosF,UAAU13D,GAAS,GACxB10B,EAAKmsF,UAAUprF,SAAQ,SAAUwtC,GAC1BA,EAAKi+C,UAEN93D,GAAS6Z,EAAKyuB,IAAI5pD,QAAQshB,GAAS,GAEvC10B,EAAKosF,UAAU13D,GAAOtf,KAAKm5B,EAAKttC,YA+BtCirF,EAAM5rF,UAAUosF,GAAK,SAAUhtF,EAAMuB,EAAImE,GACvC,IAAIkO,EAAQrT,KAAKosF,SAAS3sF,GACtBitF,EAAMvnF,GAAW,GAErB,IAAe,IAAXkO,EAAgB,MAAM,IAAIO,MAAM,0BAA4BnU,GAEhEO,KAAKksF,UAAU74E,GAAOrS,GAAKA,EAC3BhB,KAAKksF,UAAU74E,GAAO0pD,IAAM2vB,EAAI3vB,KAAO,GACvC/8D,KAAKmsF,UAAY,MA4BnBF,EAAM5rF,UAAU6iC,OAAS,SAAUypD,EAAYC,EAAU5rF,EAAImE,GAC3D,IAAIkO,EAAQrT,KAAKosF,SAASO,GACtBD,EAAMvnF,GAAW,GAErB,IAAe,IAAXkO,EAAgB,MAAM,IAAIO,MAAM,0BAA4B+4E,GAEhE3sF,KAAKksF,UAAUloD,OAAO3wB,EAAO,EAAG,CAC9B5T,KAAMmtF,EACNL,SAAS,EACTvrF,GAAIA,EACJ+7D,IAAK2vB,EAAI3vB,KAAO,KAGlB/8D,KAAKmsF,UAAY,MA4BnBF,EAAM5rF,UAAUkoC,MAAQ,SAAUskD,EAAWD,EAAU5rF,EAAImE,GACzD,IAAIkO,EAAQrT,KAAKosF,SAASS,GACtBH,EAAMvnF,GAAW,GAErB,IAAe,IAAXkO,EAAgB,MAAM,IAAIO,MAAM,0BAA4Bi5E,GAEhE7sF,KAAKksF,UAAUloD,OAAO3wB,EAAQ,EAAG,EAAG,CAClC5T,KAAMmtF,EACNL,SAAS,EACTvrF,GAAIA,EACJ+7D,IAAK2vB,EAAI3vB,KAAO,KAGlB/8D,KAAKmsF,UAAY,MA0BnBF,EAAM5rF,UAAU8U,KAAO,SAAUy3E,EAAU5rF,EAAImE,GAC7C,IAAIunF,EAAMvnF,GAAW,GAErBnF,KAAKksF,UAAU/2E,KAAK,CAClB1V,KAAMmtF,EACNL,SAAS,EACTvrF,GAAIA,EACJ+7D,IAAK2vB,EAAI3vB,KAAO,KAGlB/8D,KAAKmsF,UAAY,MAgBnBF,EAAM5rF,UAAUysF,OAAS,SAAU/iE,EAAMgjE,GAClC73E,MAAM5U,QAAQypB,KAASA,EAAO,CAAEA,IAErC,IAAIlnB,EAAS,GAeb,OAZAknB,EAAKjpB,SAAQ,SAAUrB,GACrB,IAAIutF,EAAMhtF,KAAKosF,SAAS3sF,GAExB,GAAIutF,EAAM,EAAG,CACX,GAAID,EAAiB,OACrB,MAAM,IAAIn5E,MAAM,oCAAsCnU,GAExDO,KAAKksF,UAAUc,GAAKT,SAAU,EAC9B1pF,EAAOsS,KAAK1V,KACXO,MAEHA,KAAKmsF,UAAY,KACVtpF,GAcTopF,EAAM5rF,UAAU4sF,WAAa,SAAUljE,EAAMgjE,GACtC73E,MAAM5U,QAAQypB,KAASA,EAAO,CAAEA,IAErC/pB,KAAKksF,UAAUprF,SAAQ,SAAUwtC,GAAQA,EAAKi+C,SAAU,KAExDvsF,KAAK8sF,OAAO/iE,EAAMgjE,IAgBpBd,EAAM5rF,UAAU6sF,QAAU,SAAUnjE,EAAMgjE,GACnC73E,MAAM5U,QAAQypB,KAASA,EAAO,CAAEA,IAErC,IAAIlnB,EAAS,GAeb,OAZAknB,EAAKjpB,SAAQ,SAAUrB,GACrB,IAAIutF,EAAMhtF,KAAKosF,SAAS3sF,GAExB,GAAIutF,EAAM,EAAG,CACX,GAAID,EAAiB,OACrB,MAAM,IAAIn5E,MAAM,oCAAsCnU,GAExDO,KAAKksF,UAAUc,GAAKT,SAAU,EAC9B1pF,EAAOsS,KAAK1V,KACXO,MAEHA,KAAKmsF,UAAY,KACVtpF,GAaTopF,EAAM5rF,UAAU8sF,SAAW,SAAUC,GAMnC,OALuB,OAAnBptF,KAAKmsF,WACPnsF,KAAKqsF,cAIArsF,KAAKmsF,UAAUiB,IAAc,IAGtC1uF,EAAOC,QAAUstF,G,6BCjVjB,SAASoB,EAAMtlF,EAAM4T,EAAK2xE,GAMxBttF,KAAK+H,KAAWA,EAOhB/H,KAAK2b,IAAWA,EAOhB3b,KAAK8nC,MAAW,KAOhB9nC,KAAK+Z,IAAW,KAWhB/Z,KAAKstF,QAAWA,EAOhBttF,KAAKs3C,MAAW,EAOhBt3C,KAAKs7D,SAAW,KAQhBt7D,KAAKyD,QAAW,GAOhBzD,KAAKutF,OAAW,GAOhBvtF,KAAKwtF,KAAW,GAOhBxtF,KAAKunB,KAAW,KAQhBvnB,KAAKm2C,OAAW,EAQhBn2C,KAAKytF,QAAW,EASlBJ,EAAMhtF,UAAUqtF,UAAY,SAAmBjuF,GAC7C,IAAIqoC,EAAO7mC,EAAGwT,EAEd,IAAKzU,KAAK8nC,MAAS,OAAQ,EAI3B,IAAK7mC,EAAI,EAAGwT,GAFZqzB,EAAQ9nC,KAAK8nC,OAEW3mC,OAAQF,EAAIwT,EAAKxT,IACvC,GAAI6mC,EAAM7mC,GAAG,KAAOxB,EAAQ,OAAOwB,EAErC,OAAQ,GASVosF,EAAMhtF,UAAUstF,SAAW,SAAkBC,GACvC5tF,KAAK8nC,MACP9nC,KAAK8nC,MAAM3yB,KAAKy4E,GAEhB5tF,KAAK8nC,MAAQ,CAAE8lD,IAUnBP,EAAMhtF,UAAUwtF,QAAU,SAAiBpuF,EAAMgF,GAC/C,IAAIuoF,EAAMhtF,KAAK0tF,UAAUjuF,GACrBmuF,EAAW,CAAEnuF,EAAMgF,GAEnBuoF,EAAM,EACRhtF,KAAK2tF,SAASC,GAEd5tF,KAAK8nC,MAAMklD,GAAOY,GAUtBP,EAAMhtF,UAAUytF,QAAU,SAAiBruF,GACzC,IAAIutF,EAAMhtF,KAAK0tF,UAAUjuF,GAAOgF,EAAQ,KAIxC,OAHIuoF,GAAO,IACTvoF,EAAQzE,KAAK8nC,MAAMklD,GAAK,IAEnBvoF,GAUT4oF,EAAMhtF,UAAU0tF,SAAW,SAAkBtuF,EAAMgF,GACjD,IAAIuoF,EAAMhtF,KAAK0tF,UAAUjuF,GAErButF,EAAM,EACRhtF,KAAK2tF,SAAS,CAAEluF,EAAMgF,IAEtBzE,KAAK8nC,MAAMklD,GAAK,GAAKhtF,KAAK8nC,MAAMklD,GAAK,GAAK,IAAMvoF,GAKpD/F,EAAOC,QAAU0uF,G,wGCxGjB,IA5FO,IAAIhvC,EAAO,CAChB2vC,EAAG,YACHC,EAAG,MACHC,GAAI,QACJC,GAAI,UACJC,GAAI,QACJC,GAAI,QACJC,GAAI,UACJC,GAAI,MACJC,GAAI,WACJC,GAAI,SACJC,GAAI,IACJC,GAAI,SACJC,GAAI,WACJC,GAAI,MACJC,GAAI,OACJC,GAAI,YACJC,GAAI,UACJC,GAAI,aACJC,GAAI,YACJC,GAAI,cACJC,GAAI,SACJC,GAAI,SACJC,GAAI,IACJC,GAAI,IACJC,GAAI,OACJC,GAAI,OACJC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,UACLC,IAAK,aACLC,IAAK,QACLC,IAAK,QACLC,IAAK,UACLC,IAAK,UACLC,IAAK,MACLC,IAAK,MACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,KACLC,IAAK,IACLC,IAAK,IACLC,IAAK,KAGIt8D,EAAQ,CACjBu8D,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJxC,GAAI,IACJC,GAAI,IACJiB,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,IAAK,KAGHltB,EAA6B,oBAAbzhE,WAA4B,gBAAgB7D,KAAK6D,UAAU8X,WAC3EiqD,EAA6B,oBAAb/hE,WAA4B,iBAAiBqP,KAAKrP,UAAUgiE,QAC5ET,EAA4B,oBAAbvhE,WAA4B,aAAaqP,KAAKrP,UAAU8X,WACvEopD,EAA0B,oBAAblhE,WAA4B,MAAMqP,KAAKrP,UAAUmhE,UAC9DC,EAAyB,oBAAbphE,WAA4B,gDAAgD7D,KAAK6D,UAAU8X,WACvGw3E,EAAsB7tB,IAAWP,IAAQO,EAAO,GAAK,KAAOF,GAASL,EAGhE1iE,EAAI,EAAGA,EAAI,GAAIA,IAAKo9C,EAAK,GAAKp9C,GAAKo9C,EAAK,GAAKp9C,GAAK2C,OAAO3C,GAGlE,IAASA,EAAI,EAAGA,GAAK,GAAIA,IAAKo9C,EAAKp9C,EAAI,KAAO,IAAMA,EAGpD,IAASA,EAAI,GAAIA,GAAK,GAAIA,IACxBo9C,EAAKp9C,GAAK2C,OAAOo4B,aAAa/6B,EAAI,IAClC6zB,EAAM7zB,GAAK2C,OAAOo4B,aAAa/6B,GAIjC,IAAK,IAAImhB,KAAQi8B,EAAWvpB,EAAMzzB,eAAe+gB,KAAO0S,EAAM1S,GAAQi8B,EAAKj8B,I,aCnGrE,EAA0B,oBAAb3f,WAA2B,MAAMqP,KAAKrP,UAAUmhE,UAEnE,SAASouB,EAAiBvyF,GACxBq+B,IAEIi/B,EAAKk1B,EAAMn9D,EAAOvN,EAFlB9J,EAAQhe,EAAK8G,MAAM,UAAW1D,EAAS4a,EAAMA,EAAMtc,OAAS,GAClD,SAAV0B,IAAmBA,EAAS,KAEhC,IAAKi7B,IAAI78B,EAAI,EAAGA,EAAIwc,EAAMtc,OAAS,EAAGF,IAAK,CACzC68B,IAAIo0D,EAAMz0E,EAAMxc,GAChB,GAAI,kBAAkB6Q,KAAKogF,GAAM3qE,GAAO,OACnC,GAAI,YAAYzV,KAAKogF,GAAMn1B,GAAM,OACjC,GAAI,sBAAsBjrD,KAAKogF,GAAMD,GAAO,OAC5C,GAAI,cAAcngF,KAAKogF,GAAMp9D,GAAQ,MACrC,KAAI,SAAShjB,KAAKogF,GAClB,MAAM,IAAIt+E,MAAM,+BAAiCs+E,GADnB,EAAK3qE,GAAO,EAAW0qE,GAAO,GAOnE,OAJIl1B,IAAKl6D,EAAS,OAASA,GACvBovF,IAAMpvF,EAAS,QAAUA,GACzB0kB,IAAM1kB,EAAS,QAAUA,GACzBiyB,IAAOjyB,EAAS,SAAWA,GACxBA,EAST,SAASsvF,EAAU1yF,EAAM+4B,EAAO1D,GAK9B,OAJI0D,EAAMm8C,SAAQl1E,EAAO,OAASA,GAC9B+4B,EAAMi8C,UAASh1E,EAAO,QAAUA,GAChC+4B,EAAMk8C,UAASj1E,EAAO,QAAUA,IACtB,IAAVq1B,GAAmB0D,EAAMo8C,WAAUn1E,EAAO,SAAWA,GAClDA,EAiCF,SAAS2rD,EAAOgnC,GACrB,OAAO,IAAI,SAAO,CAACnuD,MAAO,CAACi8B,cAAemyB,EAAeD,MAOpD,SAASC,EAAeD,GAC7Bt0D,IAAI/jB,EArDN,SAAmBA,GACjB+jB,IAAIyI,EAAOnmC,OAAOkO,OAAO,MACzB,IAAKwvB,IAAIjb,KAAQ9I,EAAKwsB,EAAKyrD,EAAiBnvE,IAAS9I,EAAI8I,GACzD,OAAO0jB,EAkDGhvB,CAAU66E,GACpB,OAAO,SAASjqC,EAAM3vB,GACpBsF,IAAqEw0D,EAAjE7yF,EDwBD,SAAiB+4B,GAGtB,IAEI/4B,IAFYsyF,IAAwBv5D,EAAMi8C,SAAWj8C,EAAMm8C,QAAUn8C,EAAMk8C,WAC5ElQ,GAAUX,IAAOrrC,EAAMo8C,UAAYp8C,EAAMp3B,KAA2B,GAApBo3B,EAAMp3B,IAAID,SACnCq3B,EAAMp3B,MAC7Bo3B,EAAMo8C,SAAW9/C,EAAQupB,GAAM7lB,EAAMotC,UACtCptC,EAAMp3B,KAAO,eASf,MAPY,OAAR3B,IAAeA,EAAO,UACd,OAARA,IAAeA,EAAO,UAEd,QAARA,IAAgBA,EAAO,aACf,MAARA,IAAcA,EAAO,WACb,SAARA,IAAiBA,EAAO,cAChB,QAARA,IAAgBA,EAAO,aACpBA,ECxCM8yF,CAAQ/5D,GAAQg6D,EAAwB,GAAf/yF,EAAK0B,QAAuB,KAAR1B,EACpDgzF,EAAS14E,EAAIo4E,EAAU1yF,EAAM+4B,GAAQg6D,IACzC,GAAIC,GAAUA,EAAOtqC,EAAK3hD,MAAO2hD,EAAKuB,SAAUvB,GAAO,OAAO,EAC9D,GAAIqqC,IAAWh6D,EAAMo8C,UAAYp8C,EAAMm8C,QAAUn8C,EAAMk8C,SAAWj1E,EAAKiE,WAAW,GAAK,OAClF4uF,EAAWj0C,EAAK7lB,EAAMotC,WAAa0sB,GAAY7yF,EAAM,CAKxDq+B,IAAI40D,EAAW34E,EAAIo4E,EAAUG,EAAU95D,GAAO,IAC9C,GAAIk6D,GAAYA,EAASvqC,EAAK3hD,MAAO2hD,EAAKuB,SAAUvB,GAAO,OAAO,OAC7D,GAAIqqC,GAAUh6D,EAAMo8C,SAAU,CAGnC92C,IAAI60D,EAAY54E,EAAIo4E,EAAU1yF,EAAM+4B,GAAO,IAC3C,GAAIm6D,GAAaA,EAAUxqC,EAAK3hD,MAAO2hD,EAAKuB,SAAUvB,GAAO,OAAO,EAEtE,OAAO,K;;;;;;;GCpFX,IAAIyqC,EAAkB,UAOtBl0F,EAAOC,QAUP,SAAoB+Y,GAClB,IAOIxQ,EAPA5D,EAAM,GAAKoU,EACX7E,EAAQ+/E,EAAgBh0F,KAAK0E,GAEjC,IAAKuP,EACH,OAAOvP,EAIT,IAAIyJ,EAAO,GACPsG,EAAQ,EACRb,EAAY,EAEhB,IAAKa,EAAQR,EAAMQ,MAAOA,EAAQ/P,EAAInC,OAAQkS,IAAS,CACrD,OAAQ/P,EAAII,WAAW2P,IACrB,KAAK,GACHnM,EAAS,SACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,QACE,SAGAsL,IAAca,IAChBtG,GAAQzJ,EAAIuvF,UAAUrgF,EAAWa,IAGnCb,EAAYa,EAAQ,EACpBtG,GAAQ7F,EAGV,OAAOsL,IAAca,EACjBtG,EAAOzJ,EAAIuvF,UAAUrgF,EAAWa,GAChCtG,I,yzECjEF+lF,EAAeC,E,6CAGnB,GAAsB,oBAAX5nF,QAAwB,CACjC2yB,IAAIhvB,EAAQ,IAAI3D,QAChB2nF,EAAgB,SAAA1xF,GAAI,OAAG0N,EAAM/K,IAAI3C,IACjC2xF,EAAa,SAAC3xF,EAAKqD,GAEjB,OADAqK,EAAMhE,IAAI1J,EAAKqD,GACRA,OAEJ,CACLq5B,IAAIhvB,EAAQ,GAAoBkkF,EAAW,EAC3CF,EAAgB,SAAA1xF,GACd,IAAK08B,IAAI78B,EAAI,EAAGA,EAAI6N,EAAM3N,OAAQF,GAAK,EACrC,GAAI6N,EAAM7N,IAAMG,EAAK,OAAO0N,EAAM7N,EAAI,IAE1C8xF,EAAa,SAAC3xF,EAAKqD,GAGjB,OAR0B,IAMtBuuF,IAAuBA,EAAW,GACtClkF,EAAMkkF,KAAc5xF,EACb0N,EAAMkkF,KAAcvuF,GAIxB,IAAMwuF,EACX,SAAY1tC,EAAM1R,EAAK2R,EAAOF,GAC5BtlD,KAAKulD,KAAOA,EAAMvlD,KAAK6zC,IAAMA,EAAK7zC,KAAKwlD,MAAQA,EAAOxlD,KAAKslD,OAASA,GAQ3Dq8B,EACX,SAAYn9B,EAAO0B,EAAQnsC,EAAKm5E,GAE9BlzF,KAAKwkD,MAAQA,EAEbxkD,KAAKkmD,OAASA,EAGdlmD,KAAK+Z,IAAMA,EAGX/Z,KAAKkzF,SAAWA,GA4LpB,SAASC,EAAcrrD,GACrB,GAAIA,EAAMsrD,SAAU,OAAOtrD,EAAMsrD,SAASrwF,QAE1C,IADA+6B,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAI6mC,EAAMurD,QAASpyF,IAAK4B,EAAOsS,KAAK,GACpD,OAAOtS,EnDrPT,SAAS,EAAa,EAAK,GACzBi7B,IAAI,EAAY,EAAI,aAAa,iBAC7B,EAAS,GAAa,eAAe,KAAK,GAAa,EAAU,MAAM,KAAK,KAAG,SAAC,GAAE,OAAG,OAAO,MAAM,KAClG,EAAU,OAAO,EAAI,aAAa,YAAc,GAChD,EAAS,C,QACX,EACA,QAAS,OAAO,EAAI,aAAa,YAAc,GAC/C,SAAU,GAAU,EAAO,QAAU,EAAU,EAAS,MAExD,IAAGA,IAAI,KAAQ,EAAY,CAC3BA,IAAI,EAAS,EAAW,GAAM,WAC1B,EAAQ,GAAU,EAAO,GAChB,MAAT,IAAe,EAAO,GAAQ,GAElC,OAAK,EAGT,SAAS,EAAa,EAAM,GACxBA,IAAE,EAAQ,GAKV,IAAGA,IAAI,KAJiB,GAAtB,EAAK,MAAM,UAAc,EAAM,QAAU,EAAK,MAAM,SAC9B,GAAtB,EAAK,MAAM,UAAc,EAAM,QAAU,EAAK,MAAM,SACpD,EAAK,MAAM,WACb,EAAM,iBAAmB,EAAK,MAAM,SAAS,KAAK,MACnC,EAAY,CAC3BA,IAAI,EAAS,EAAW,GAAM,WAC1B,GAAQ,EAAO,EAAK,MAAM,GAAO,GAErC,OAAK,EAiCF,SAAS,EAAW,GACvBA,IAAE,EAAa,EAAQ,gBAAkB,GACvC,EAAY,CACV,QAAK,CAAC,QAAS,GACf,QAAK,CAAO,QAAG,GACnB,SAAU,CAAC,QAAS,OAEtB,IAAKA,IAAI,KAAQ,EACf,EAAU,GAAQ,CAAC,QAAS,EAAW,GAAM,SAE7C,MAAK,CACL,MAAO,CACL,QAAS,aACT,UAAW,QACX,WAAW,EACX,MAAO,EAAQ,WACf,SAAU,CAAC,CAAC,IAAK,UACjB,iBAAU,MAAO,CAAC,QAAS,CAAC,QAAS,MAEvC,UAAW,CACT,QAAS,+BACT,UAAW,MACX,SAAU,CAAC,CAAC,IAAK,OACjB,iBAAU,MAAO,CAAC,KAAM,KAE1B,WAAY,CACV,QAAS,EAAQ,YACjB,MAAO,EACP,UAAW,OACX,WAAW,EACX,SAAU,CAAC,CAAC,IAAK,KAAM,SAAQ,SAAE,GAAI,OAAG,EAAa,EAAK,MAC1D,eAAM,GAAQ,MAAO,CAAC,KAAM,EAAa,EAAM,GAAa,KAE9D,aAAc,CACZ,QAAS,EAAQ,YACjB,MAAO,EACP,UAAW,cACX,WAAW,EACX,SAAU,CAAC,CAAC,IAAK,KAAM,SAAQ,SAAE,GAAI,OAAG,EAAa,EAAK,MAC1D,eAAM,GAAQ,MAAO,CAAC,KAAM,EAAa,EAAM,GAAa,MAK3D,SAAS,EAAe,GAC7BA,IAAI,EAAS,EAAO,OAAO,eACzB,IAAG,EAEH,IAAKA,IAAI,KADT,EAAS,EAAO,OAAO,eAAiB,GACvB,EAAO,MAAO,CAC7BA,IAAI,EAAO,EAAO,MAAM,GAAO,EAAO,EAAK,KAAK,UAC5C,IAAM,EAAO,GAAQ,GAG7B,OAAO,EmDvDT,YAAEw1D,SAAA,SAASv3E,GACP,IAAK+hB,IAAI78B,EAAI,EAAGA,EAAIjB,KAAK+Z,IAAI5Y,OAAQF,IAAK,CAC1C,IAAMumC,EAASxnC,KAAK+Z,IAAI9Y,GACtB,GAAIumC,GAAUzrB,EAAd,CAGA,IAFF,IAAMwpC,EAAOtkD,EAAIjB,KAAKwkD,MAAO3Q,EAAO5yC,EAAIjB,KAAKwkD,MAAS,EAChDgB,EAAQD,EAAO,EAAGD,EAASzR,EAAM,EAC5BvnB,EAAI,EAAGk5B,EAAQxlD,KAAKwkD,OAASxkD,KAAK+Z,IAAI9Y,EAAIqrB,IAAMkb,EAAQlb,IAAKk5B,IACtE,IAAK1nB,IAAIxR,EAAI,EAAGg5B,EAAStlD,KAAKkmD,QAAUlmD,KAAK+Z,IAAI9Y,EAAKjB,KAAKwkD,MAAQl4B,IAAOkb,EAAQlb,IAAKg5B,IACzF,OAAS,IAAI2tC,EAAK1tC,EAAM1R,EAAK2R,EAAOF,IAEpC,MAAM,IAAIxmB,WAAW,uBAAyB/iB,EAAM,WAKxD,YAAEw3E,SAAA,SAASx3E,GACP,IAAK+hB,IAAI78B,EAAI,EAAGA,EAAIjB,KAAK+Z,IAAI5Y,OAAQF,IACnC,GAAIjB,KAAK+Z,IAAI9Y,IAAM8a,EAAK,OAAO9a,EAAIjB,KAAKwkD,MAC1C,MAAM,IAAI1lB,WAAW,uBAAyB/iB,EAAM,WAMxD,YAAEy3E,SAAA,SAASz3E,EAAK03E,EAAMn9E,GAClB,IAAF,EAAmCtW,KAAKszF,SAASv3E,GAA1CwpC,EAAA,EAAAA,KAAMC,EAAA,EAAAA,MAAO3R,EAAA,EAAAA,IAAKyR,EAAA,EAAAA,OACvB,MAAY,SAARmuC,GACEn9E,EAAM,EAAY,GAARivC,EAAYC,GAASxlD,KAAKwkD,OAAc,KAC/CxkD,KAAK+Z,IAAI85B,EAAM7zC,KAAKwkD,OAASluC,EAAM,EAAIivC,EAAO,EAAIC,KAErDlvC,EAAM,EAAW,GAAPu9B,EAAWyR,GAAUtlD,KAAKkmD,QAAe,KAChDlmD,KAAK+Z,IAAIwrC,EAAOvlD,KAAKwkD,OAASluC,EAAM,EAAIu9B,EAAM,EAAIyR,KAM/D,YAAEouC,YAAA,SAAYxwF,EAAGC,GACb,IAAF,EAAiEnD,KAAKszF,SAASpwF,GAAlEywF,EAAA,EAAApuC,KAAcquC,EAAA,EAAApuC,MAAaquC,EAAA,EAAAhgD,IAAcigD,EAAA,EAAAxuC,OACtD,EAAiEtlD,KAAKszF,SAASnwF,GAAlE4wF,EAAA,EAAAxuC,KAAcyuC,EAAA,EAAAxuC,MAAayuC,EAAA,EAAApgD,IAAcqgD,EAAA,EAAA5uC,OACpD,OAAO,IAAI2tC,EAAKrzF,KAAKiJ,IAAI8qF,EAAOI,GAAQn0F,KAAKiJ,IAAIgrF,EAAMI,GACvCr0F,KAAKsvB,IAAI0kE,EAAQI,GAASp0F,KAAKsvB,IAAI4kE,EAASI,KAMhE,YAAExP,YAAA,SAAYx/B,GAEV,IADA,IAAIriD,EAAS,GAAIigC,EAAO,GACf6/C,EAAMz9B,EAAKrR,IAAK8uC,EAAMz9B,EAAKI,OAAQq9B,IAC1C,IAAK7kD,IAAI47C,EAAMx0B,EAAKK,KAAMm0B,EAAMx0B,EAAKM,MAAOk0B,IAAO,CACjD57C,IAAIzqB,EAAQsvE,EAAM3iF,KAAKwkD,MAAQk1B,EAAK39D,EAAM/b,KAAK+Z,IAAI1G,GAC/CyvB,EAAK/mB,KACT+mB,EAAK/mB,IAAO,EACP29D,GAAOx0B,EAAKK,MAASm0B,GAAO15E,KAAK+Z,IAAI1G,EAAQ,IAAM0I,GACnD4mE,GAAOz9B,EAAKrR,KAAQ8uC,GAAO3iF,KAAK+Z,IAAI1G,EAAQrT,KAAKwkD,QAAUzoC,GAC9DlZ,EAAOsS,KAAK4G,IAGlB,OAAOlZ,GAMX,YAAEsxF,WAAA,SAAWxR,EAAKjJ,EAAKloC,GACnB,IAAK1T,IAAI78B,EAAI,EAAGmzF,EAAW,GAAInzF,IAAK,CAClC68B,IAAIu2D,EAASD,EAAW5iD,EAAMnM,MAAMpkC,GAAGikC,SACvC,GAAIjkC,GAAK0hF,EAAK,CAGZ,IAFF,IAAMtvE,EAAQqmE,EAAMiJ,EAAM3iF,KAAKwkD,MAAO8vC,GAAe3R,EAAM,GAAK3iF,KAAKwkD,MAE5DnxC,EAAQihF,GAAet0F,KAAK+Z,IAAI1G,GAAS+gF,GAAU/gF,IAC1D,OAAOA,GAASihF,EAAcD,EAAS,EAAIr0F,KAAK+Z,IAAI1G,GAExD,EAAaghF,IAMf,EAAOtwF,IAAA,SAAIytC,GACT,OAAOshD,EAActhD,IAAUuhD,EAAWvhD,EAK9C,SAAoBA,GAClB,GAAiC,SAA7BA,EAAMzpC,KAAKo6B,KAAKoyD,UAAsB,MAAM,IAAIz1D,WAAW,qBAAuB0S,EAAMzpC,KAAKtI,MAGjG,IAFAq+B,IAAI0mB,EAuDN,SAAmBhT,GAEjB,IADA1T,IAAI0mB,GAAS,EAAGgwC,GAAa,EACpB7R,EAAM,EAAGA,EAAMnxC,EAAMhL,WAAYm8C,IAAO,CAC/C7kD,IAAI22D,EAAUjjD,EAAMnM,MAAMs9C,GAAM6C,EAAW,EAC3C,GAAIgP,EAAY,IAAK12D,IAAIxR,EAAI,EAAGA,EAAIq2D,EAAKr2D,IAEvC,IADAwR,IAAI42D,EAAUljD,EAAMnM,MAAM/Y,GACjBrrB,EAAI,EAAGA,EAAIyzF,EAAQluD,WAAYvlC,IAAK,CAC3C68B,IAAIykD,EAAOmS,EAAQrvD,MAAMpkC,GACrBqrB,EAAIi2D,EAAKz6C,MAAM89C,QAAUjD,IAAK6C,GAAYjD,EAAKz6C,MAAMurD,SAG7D,IAAKv1D,IAAI78B,EAAI,EAAGA,EAAIwzF,EAAQjuD,WAAYvlC,IAAK,CAC3C68B,IAAIykD,EAAOkS,EAAQpvD,MAAMpkC,GACzBukF,GAAYjD,EAAKz6C,MAAMurD,QACnB9Q,EAAKz6C,MAAM89C,QAAU,IAAG4O,GAAa,IAE7B,GAAVhwC,EACFA,EAAQghC,EACDhhC,GAASghC,IAChBhhC,EAAQ5kD,KAAKsvB,IAAIs1B,EAAOghC,IAE5B,OAAOhhC,EA5EKmwC,CAAUnjD,GAAQ0U,EAAS1U,EAAMhL,WACzCzsB,EAAM,GAAI66E,EAAS,EAAG1B,EAAW,KAAM2B,EAAY,GAC9C5zF,EAAI,EAAGsS,EAAIixC,EAAQ0B,EAAQjlD,EAAIsS,EAAGtS,IAAK8Y,EAAI9Y,GAAK,EAEzD,IAAK68B,IAAI6kD,EAAM,EAAG5mE,EAAM,EAAG4mE,EAAMz8B,EAAQy8B,IAAO,CAC9C7kD,IAAI22D,EAAUjjD,EAAMnM,MAAMs9C,GAC1B5mE,IACA,IAAK+hB,IAAI78B,EAAI,GAAIA,IAAK,CACpB,KAAO2zF,EAAS76E,EAAI5Y,QAAyB,GAAf4Y,EAAI66E,IAAcA,IAChD,GAAI3zF,GAAKwzF,EAAQjuD,WAAY,MAE7B,IADA1I,IAAIg3D,EAAWL,EAAQpvD,MAAMpkC,G,EAAmC6zF,EAAShtD,MAAvCurD,EAAA,EAAAA,QAASzN,EAAA,EAAAA,QAASwN,EAAA,EAAAA,SAC3C1oF,EAAI,EAAGA,EAAIk7E,EAASl7E,IAAK,CAChC,GAAIA,EAAIi4E,GAAOz8B,EAAQ,EACpBgtC,IAAaA,EAAW,KAAK/9E,KAAK,CAACpN,KAAM,mBAAkB,IAAEgU,EAAKlD,EAAG+sE,EAAUl7E,IAChF,MAGF,IADAozB,IAAIyH,EAAQqvD,EAAUlqF,EAAI85C,EACjBuwC,EAAI,EAAGA,EAAI1B,EAAS0B,IAAK,CACV,GAAlBh7E,EAAIwrB,EAAQwvD,GACdh7E,EAAIwrB,EAAQwvD,GAAKh5E,GAEhBm3E,IAAaA,EAAW,KAAK/9E,KAAK,CAACpN,KAAM,YAAW,IAAE46E,EAAG,IAAE5mE,EAAKlD,EAAGw6E,EAAU0B,IAChFj3D,IAAIk3D,EAAO5B,GAAYA,EAAS2B,GAChC,GAAIC,EAAM,CACRl3D,IAAIm3D,GAAe1vD,EAAQwvD,GAAKvwC,EAAS,EAAGvpB,EAAO45D,EAAUI,GACjD,MAARh6D,GAAiBA,GAAQ+5D,GAAqC,GAA7BH,EAAUI,EAAa,IAC1DJ,EAAUI,GAAcD,EACxBH,EAAUI,EAAa,GAAK,GACnBh6D,GAAQ+5D,GACjBH,EAAUI,EAAa,OAK/BL,GAAUvB,EACVt3E,GAAO+4E,EAAS5vD,SAGlB,IADApH,IAAIo3D,GAAevS,EAAM,GAAKn+B,EAAO2wC,EAAU,EACxCP,EAASM,GAAkC,GAAjBn7E,EAAI66E,MAAgBO,IACjDA,IAAUjC,IAAaA,EAAW,KAAK/9E,KAAK,CAACpN,KAAM,UAAS,IAAE46E,EAAK9pE,EAAGs8E,IAC1Ep5E,IAQF,IALA+hB,IAAIs3D,EAAW,IAAIzT,EAASn9B,EAAO0B,EAAQnsC,EAAKm5E,GAAWmC,GAAY,EAK9Dp0F,EAAI,GAAIo0F,GAAap0F,EAAI4zF,EAAU1zF,OAAQF,GAAK,EACnC,MAAhB4zF,EAAU5zF,IAAc4zF,EAAU5zF,EAAI,GAAKilD,IAAQmvC,GAAY,GACjEA,GA6BN,SAA0Bt7E,EAAK86E,EAAWrjD,GACnCz3B,EAAIm5E,WAAUn5E,EAAIm5E,SAAW,IAClC,IAAKp1D,IAAI78B,EAAI,EAAG6hC,EAAO,GAAI7hC,EAAI8Y,EAAIA,IAAI5Y,OAAQF,IAAK,CAClD68B,IAAI/hB,EAAMhC,EAAIA,IAAI9Y,GAClB,IAAI6hC,EAAK/mB,GAAT,CACA+mB,EAAK/mB,IAAO,EAEZ,IADA+hB,IAAIiC,EAAOyR,EAAMyO,OAAOlkC,GAAM2iB,EAAU,KAC/BpS,EAAI,EAAGA,EAAIyT,EAAK+H,MAAMurD,QAAS/mE,IAAK,CAC3CwR,IAAI47C,GAAOz4E,EAAIqrB,GAAKvS,EAAIyqC,MAAO8wC,EAAWT,EAAgB,EAANnb,GACpC,MAAZ4b,GAAsBv1D,EAAK+H,MAAMsrD,UAAYrzD,EAAK+H,MAAMsrD,SAAS9mE,IAAMgpE,KACxE52D,IAAYA,EAAUy0D,EAAcpzD,EAAK+H,SAASxb,GAAKgpE,GAExD52D,GAAS3kB,EAAIm5E,SAASv+D,QAAQ,CAAC5sB,KAAM,oBAAmB,IAAEgU,EAAKq3E,SAAU10D,MAzChE62D,CAAiBH,EAAUP,EAAWrjD,GAErD,OAAO4jD,EA3D4CI,CAAWhkD,KCtIpD,IAACpwC,EAAM,IAAI,YAAU,kBAE1B,SAASq0F,EAAWr3C,GACzB,IAAKtgB,IAAIwL,EAAI8U,EAAKjW,MAAQ,EAAGmB,EAAI,EAAGA,IAClC,GAAwC,OAApC8U,EAAKre,KAAKuJ,GAAGvhC,KAAKo6B,KAAKoyD,UAAoB,OAAOn2C,EAAKre,KAAK,GAAGtgB,QAAQ2+B,EAAKlb,OAAOoG,EAAI,IAC7F,OAAO,KAWF,SAASosD,EAAUlvF,GAExB,IADAs3B,IAAIyB,EAAQ/4B,EAAM+3B,UAAUgB,MACnB+J,EAAI/J,EAAM4I,MAAOmB,EAAI,EAAGA,IAAK,GAAyC,OAArC/J,EAAMQ,KAAKuJ,GAAGvhC,KAAKo6B,KAAKoyD,UAAoB,OAAO,EAC7F,OAAO,EAGF,SAASoB,EAAcnvF,GAC5Bs3B,IAAIisC,EAAMvjE,EAAM+3B,UAChB,OAAIwrC,EAAI6rB,YACC7rB,EAAI6rB,YAAY75E,IAAMguD,EAAI8rB,UAAU95E,IAAMguD,EAAI6rB,YAAc7rB,EAAI8rB,UAC9D9rB,EAAIhqC,MAAwC,QAAhCgqC,EAAIhqC,KAAKh4B,KAAKo6B,KAAKoyD,UACjCxqB,EAAIC,QAENyrB,EAAW1rB,EAAIxqC,QAGxB,SAAkB6e,GAChB,IAAKtgB,IAAIyK,EAAQ6V,EAAK5V,UAAWzsB,EAAMqiC,EAAKriC,IAAKwsB,EAAOA,EAAQA,EAAM1a,WAAY9R,IAAO,CACvF+hB,IAAIg4D,EAAOvtD,EAAMxgC,KAAKo6B,KAAKoyD,UAC3B,GAAY,QAARuB,GAA0B,eAARA,EAAuB,OAAO13C,EAAKhgB,IAAI3e,QAAQ1D,GAEvE,IAAK+hB,IAAIoF,EAASkb,EAAK1V,WAAY3sB,EAAMqiC,EAAKriC,IAAKmnB,EAAQA,EAASA,EAAO8C,UAAWjqB,IAAO,CAC3F+hB,IAAIg4D,EAAO5yD,EAAOn7B,KAAKo6B,KAAKoyD,UAC5B,GAAY,QAARuB,GAA0B,eAARA,EAAuB,OAAO13C,EAAKhgB,IAAI3e,QAAQ1D,EAAMmnB,EAAOgC,WAVpD6wD,CAAShsB,EAAIxqC,OAcxC,SAASy2D,EAAa53C,GAC3B,MAA0C,OAAnCA,EAAKp0C,OAAOjC,KAAKo6B,KAAKoyD,WAAsBn2C,EAAK5V,UAGnD,SAASytD,EAAgB73C,GAC9B,OAAOA,EAAKre,KAAK,GAAGtgB,QAAQ2+B,EAAKriC,IAAMqiC,EAAK5V,UAAUtD,UAGjD,SAASgxD,EAAYC,EAAIC,GAC9B,OAAOD,EAAGhuD,OAASiuD,EAAGjuD,OAASguD,EAAGp6E,KAAOq6E,EAAG7wD,OAAO,IAAM4wD,EAAGp6E,KAAOq6E,EAAG9wD,KAAK,GAGtE,SAASguD,EAASl1C,GACvB,OAAOujC,EAAS59E,IAAIq6C,EAAKre,MAAM,IAAIuzD,SAASl1C,EAAKriC,IAAMqiC,EAAK7Y,OAAO,IAG9D,SAASguD,EAASn1C,GACvB,OAAOujC,EAAS59E,IAAIq6C,EAAKre,MAAM,IAAIwzD,SAASn1C,EAAKriC,IAAMqiC,EAAK7Y,OAAO,IAG9D,SAASiuD,EAASp1C,EAAMq1C,EAAMn9E,GACnCwnB,IAAIyH,EAAQ6Y,EAAK7Y,OAAO,GACpB05B,EAD8B0iB,EAAS59E,IAAIq6C,EAAKre,MAAM,IAC1CyzD,SAASp1C,EAAKriC,IAAMwpB,EAAOkuD,EAAMn9E,GACjD,OAAgB,MAAT2oD,EAAgB,KAAO7gB,EAAKre,KAAK,GAAGtgB,QAAQ8lB,EAAQ05B,GAGtD,SAASo3B,EAAQvuD,EAAOroC,EAAMgF,GACnCq5B,IAAIj7B,EAAS,GACb,IAAKi7B,IAAIjb,KAAQilB,EAAOjlC,EAAOggB,GAAQilB,EAAMjlB,GAE7C,OADAhgB,EAAOpD,GAAQgF,EACR5B,EAGF,SAASyzF,EAAcxuD,EAAO/rB,EAAKlD,Q,UAAE,GAC1CilB,IAAIj7B,EAASwzF,EAAQvuD,EAAO,UAAWA,EAAMurD,QAAUx6E,GAMvD,OALIhW,EAAOuwF,WACTvwF,EAAOuwF,SAAWvwF,EAAOuwF,SAASrwF,QAClCF,EAAOuwF,SAASpvD,OAAOjoB,EAAKlD,GACvBhW,EAAOuwF,SAASn5E,MAAI,SAAC86E,GAAE,OAAGA,EAAI,OAAIlyF,EAAOuwF,SAAW,OAEpDvwF,EAGF,SAAS0zF,EAAWzuD,EAAO/rB,EAAKlD,Q,UAAE,GACvCilB,IAAIj7B,EAASwzF,EAAQvuD,EAAO,UAAWA,EAAMurD,QAAUx6E,GACvD,GAAIhW,EAAOuwF,SAAU,CACnBvwF,EAAOuwF,SAAWvwF,EAAOuwF,SAASrwF,QAClC,IAAK+6B,IAAI78B,EAAI,EAAGA,EAAI4X,EAAG5X,IAAK4B,EAAOuwF,SAASpvD,OAAOjoB,EAAK,EAAG,GAE7D,OAAOlZ,EAGF,SAAS2zF,EAAez8E,EAAKy3B,EAAOkoC,GAEzC,IADA57C,IAAI24D,EAAapV,EAAe7vC,EAAMzpC,KAAK04B,QAAQi2D,YAC1C/T,EAAM,EAAGA,EAAM5oE,EAAImsC,OAAQy8B,IAClC,GAAInxC,EAAMyO,OAAOlmC,EAAIA,IAAI2/D,EAAMiJ,EAAM5oE,EAAIyqC,QAAQz8C,MAAQ0uF,EACvD,OAAO,EACX,OAAO,ECzFT,IAAanS,EAAa,YAMxB,WAAYsR,EAAaC,Q,UAAYD,GACnC93D,IAAI0T,EAAQokD,EAAY71D,MAAM,GAAIhmB,EAAM4nE,EAAS59E,IAAIytC,GAAQjM,EAAQqwD,EAAYrwD,OAAO,GACpF2f,EAAOnrC,EAAI25E,YAAYkC,EAAY75E,IAAMwpB,EAAOswD,EAAU95E,IAAMwpB,GAChEnH,EAAMw3D,EAAY71D,KAAK,GACvB6hD,EAAQ7nE,EAAI2qE,YAAYx/B,GAAMlrC,QAAM,SAACmU,GAAE,OAAGA,GAAK0nE,EAAU95E,IAAMwpB,KAGnEq8C,EAAMjtD,QAAQkhE,EAAU95E,IAAMwpB,GAC9BzH,IAAI2b,EAASmoC,EAAM7nE,KAAG,SAACgC,GACrB+hB,IAAIykD,EAAO/wC,EAAMyO,OAAOlkC,GAAMwW,EAAOxW,EAAMwpB,EAAQ,EACnD,OAAO,IAAI,iBAAenH,EAAI3e,QAAQ8S,GAAO6L,EAAI3e,QAAQ8S,EAAOgwD,EAAK9+E,QAAQ2Y,UAE/E8hB,OAAK,KAACub,EAAO,GAAG1b,MAAO0b,EAAO,GAAGzb,IAAKyb,GAItCz5C,KAAK41F,YAAcA,EAInB51F,KAAK61F,UAAYA,E,4FAClB,E,YAED97E,IAAA,SAAIqkB,EAAKQ,GACPd,IAAI83D,EAAcx3D,EAAI3e,QAAQmf,EAAQ7kB,IAAI/Z,KAAK41F,YAAY75E,MACvD85E,EAAYz3D,EAAI3e,QAAQmf,EAAQ7kB,IAAI/Z,KAAK61F,UAAU95E,MACvD,GAAIi6E,EAAaJ,IAAgBI,EAAaH,IAAcK,EAAYN,EAAaC,GAAY,CAC/F/3D,IAAI64D,EAAe32F,KAAK41F,YAAY71D,MAAM,IAAM61D,EAAY71D,MAAM,GAClE,OAAI42D,GAAgB32F,KAAK8kF,iBAChBR,EAAcsS,aAAahB,EAAaC,GACxCc,GAAgB32F,KAAK62F,iBACrBvS,EAAcwS,aAAalB,EAAaC,GAExC,IAAIvR,EAAcsR,EAAaC,GAE1C,OAAO,gBAAcpK,QAAQmK,EAAaC,I,YAM5CpyF,QAAA,WAIE,IAHAq6B,IAAI0T,EAAQxxC,KAAK41F,YAAY71D,MAAM,GAAIhmB,EAAM4nE,EAAS59E,IAAIytC,GAAQjM,EAAQvlC,KAAK41F,YAAYrwD,OAAO,GAC9F2f,EAAOnrC,EAAI25E,YAAY1zF,KAAK41F,YAAY75E,IAAMwpB,EAAOvlC,KAAK61F,UAAU95E,IAAMwpB,GAC1EzC,EAAO,GAAIo/C,EAAO,GACbS,EAAMz9B,EAAKrR,IAAK8uC,EAAMz9B,EAAKI,OAAQq9B,IAAO,CAEjD,IADA7kD,IAAIi5D,EAAa,GACR1jF,EAAQsvE,EAAM5oE,EAAIyqC,MAAQU,EAAKK,KAAMm0B,EAAMx0B,EAAKK,KAAMm0B,EAAMx0B,EAAKM,MAAOk0B,IAAOrmE,IAAS,CAC/FyqB,IAAI/hB,EAAMhC,EAAIA,IAAI1G,GAClB,IAAKyvB,EAAK/mB,GAAM,CACd+mB,EAAK/mB,IAAO,EACZ+hB,IAAIk5D,EAAWj9E,EAAIu5E,SAASv3E,GAAMwmE,EAAO/wC,EAAMyO,OAAOlkC,GAClDk7E,EAAY/xC,EAAKK,KAAOyxC,EAASzxC,KAAM2xC,EAAaF,EAASxxC,MAAQN,EAAKM,MAC9E,GAAIyxC,EAAY,GAAKC,EAAa,EAAG,CACnCp5D,IAAIgK,EAAQy6C,EAAKz6C,MACbmvD,EAAY,IAAGnvD,EAAQwuD,EAAcxuD,EAAO,EAAGmvD,IAC/CC,EAAa,IAAGpvD,EAAQwuD,EAAcxuD,EAAOA,EAAMurD,QAAU6D,EAAYA,IAC9C3U,EAA3ByU,EAASzxC,KAAOL,EAAKK,KAAag9B,EAAKx6E,KAAKy5B,cAAcsG,GAClDy6C,EAAKx6E,KAAKuG,OAAOw5B,EAAOy6C,EAAK9+E,SAE3C,GAAIuzF,EAASnjD,IAAMqR,EAAKrR,KAAOmjD,EAAS1xC,OAASJ,EAAKI,OAAQ,CAC5DxnB,IAAIgK,EAAQuuD,EAAQ9T,EAAKz6C,MAAO,UAAWloC,KAAKiJ,IAAImuF,EAAS1xC,OAAQJ,EAAKI,QAAU1lD,KAAKsvB,IAAI8nE,EAASnjD,IAAKqR,EAAKrR,MACnF0uC,EAAzByU,EAASnjD,IAAMqR,EAAKrR,IAAY0uC,EAAKx6E,KAAKy5B,cAAcsG,GAChDy6C,EAAKx6E,KAAKuG,OAAOw5B,EAAOy6C,EAAK9+E,SAE3CszF,EAAW5hF,KAAKotE,IAGpBL,EAAK/sE,KAAKq8B,EAAMnM,MAAMs9C,GAAKp8C,KAAK,WAAShU,KAAKwkE,KAGhD94D,IAAM4Z,EAAW73C,KAAK62F,kBAAoB72F,KAAK8kF,iBAAmBtzC,EAAQ0wC,EAC1E,OAAO,IAAI,QAAM,WAAS3vD,KAAKslB,GAAW,EAAG,I,YAG/Ct0C,QAAA,SAAQk+B,EAAIh+B,Q,UAAU,QAAMw8B,OAE1B,IADAnC,IAAI4hB,EAAUje,EAAG9C,MAAMx9B,OAAQs4C,EAASz5C,KAAKy5C,OACpCx4C,EAAI,EAAGA,EAAIw4C,EAAOt4C,OAAQF,IAAK,CACtC,MAAmBw4C,EAAOx4C,GAArB88B,EAAA,EAAAA,MAAOC,EAAA,EAAAA,IAAkBY,EAAU6C,EAAG7C,QAAQ77B,MAAM28C,GACzDje,EAAGl+B,QAAQq7B,EAAQ7kB,IAAIgkB,EAAMhiB,KAAM6iB,EAAQ7kB,IAAIikB,EAAIjiB,KAAM9a,EAAI,QAAMg/B,MAAQx8B,GAE7Eq6B,IAAIisC,EAAMnpC,EAAU4mB,SAAS/lB,EAAGrD,IAAI3e,QAAQgiB,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAI/Z,KAAKwgC,MAAO,GAClFupC,GAAKtoC,EAAG5C,aAAakrC,I,YAG3B3pC,YAAA,SAAYqB,EAAI1B,GACd//B,KAAKuD,QAAQk+B,EAAI,IAAI,QAAM,WAASlP,KAAKwN,GAAO,EAAG,K,YAGrDo3D,YAAA,SAAY9yF,GAGV,IAFAy5B,IAAI0T,EAAQxxC,KAAK41F,YAAY71D,MAAM,GAAIhmB,EAAM4nE,EAAS59E,IAAIytC,GAAQjM,EAAQvlC,KAAK41F,YAAYrwD,OAAO,GAC9Fq8C,EAAQ7nE,EAAI2qE,YAAY3qE,EAAI25E,YAAY1zF,KAAK41F,YAAY75E,IAAMwpB,EAAOvlC,KAAK61F,UAAU95E,IAAMwpB,IACtFtkC,EAAI,EAAGA,EAAI2gF,EAAMzgF,OAAQF,IAChCoD,EAAEmtC,EAAMyO,OAAO2hC,EAAM3gF,IAAKskC,EAAQq8C,EAAM3gF,K,YAM5C41F,eAAA,WACE/4D,IAAIs5D,EAAYp3F,KAAK41F,YAAYviF,OAAO,GAAIgkF,EAAUr3F,KAAK61F,UAAUxiF,OAAO,GAC5E,GAAIzT,KAAKiJ,IAAIuuF,EAAWC,GAAW,EAAG,OAAO,EAC7Cv5D,IAAIw5D,EAAYF,EAAYp3F,KAAK41F,YAAYptD,UAAUV,MAAM89C,QACzD2R,EAAUF,EAAUr3F,KAAK61F,UAAUrtD,UAAUV,MAAM89C,QACvD,OAAOhmF,KAAKsvB,IAAIooE,EAAWC,IAAYv3F,KAAK61F,UAAU91D,MAAM,GAAGyG,YAMjE,EAAOswD,aAAA,SAAalB,EAAaC,Q,UAAYD,GAC3C93D,IAAI/jB,EAAM4nE,EAAS59E,IAAI6xF,EAAY71D,MAAM,IAAKwF,EAAQqwD,EAAYrwD,OAAO,GACrEiyD,EAAaz9E,EAAIu5E,SAASsC,EAAY75E,IAAMwpB,GAAQkyD,EAAW19E,EAAIu5E,SAASuC,EAAU95E,IAAMwpB,GAC5FnH,EAAMw3D,EAAY71D,KAAK,GAY3B,OAXIy3D,EAAW3jD,KAAO4jD,EAAS5jD,KACzB2jD,EAAW3jD,IAAM,IACnB+hD,EAAcx3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAIy9E,EAAWjyC,QACnDkyC,EAASnyC,OAASvrC,EAAImsC,SACxB2vC,EAAYz3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAIA,EAAIyqC,OAASzqC,EAAImsC,OAAS,GAAKuxC,EAASjyC,MAAQ,OAEtFiyC,EAAS5jD,IAAM,IACjBgiD,EAAYz3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAI09E,EAASlyC,QAC/CiyC,EAAWlyC,OAASvrC,EAAImsC,SAC1B0vC,EAAcx3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAIA,EAAIyqC,OAASzqC,EAAImsC,OAAS,GAAKsxC,EAAWhyC,MAAQ,MAEzF,IAAI8+B,EAAcsR,EAAaC,I,YAMxC/Q,eAAA,WACEhnD,IAAI/jB,EAAM4nE,EAAS59E,IAAI/D,KAAK41F,YAAY71D,MAAM,IAAKwF,EAAQvlC,KAAK41F,YAAYrwD,OAAO,GAC/EmyD,EAAa39E,EAAIw5E,SAASvzF,KAAK41F,YAAY75E,IAAMwpB,GACjDoyD,EAAW59E,EAAIw5E,SAASvzF,KAAK61F,UAAU95E,IAAMwpB,GACjD,GAAI3lC,KAAKiJ,IAAI6uF,EAAYC,GAAY,EAAG,OAAO,EAC/C75D,IAAI85D,EAAcF,EAAa13F,KAAK41F,YAAYptD,UAAUV,MAAMurD,QAC5DwE,EAAYF,EAAW33F,KAAK61F,UAAUrtD,UAAUV,MAAMurD,QAC1D,OAAOzzF,KAAKsvB,IAAI0oE,EAAaC,IAAc99E,EAAIyqC,O,YAGjDrhB,GAAA,SAAGhd,GACD,OAAOA,aAAiBm+D,GAAiBn+D,EAAMyvE,YAAY75E,KAAO/b,KAAK41F,YAAY75E,KACjFoK,EAAM0vE,UAAU95E,KAAO/b,KAAK61F,UAAU95E,KAM1C,EAAO66E,aAAA,SAAahB,EAAaC,Q,UAAYD,GAC3C93D,IAAI/jB,EAAM4nE,EAAS59E,IAAI6xF,EAAY71D,MAAM,IAAKwF,EAAQqwD,EAAYrwD,OAAO,GACrEiyD,EAAaz9E,EAAIu5E,SAASsC,EAAY75E,IAAMwpB,GAAQkyD,EAAW19E,EAAIu5E,SAASuC,EAAU95E,IAAMwpB,GAC5FnH,EAAMw3D,EAAY71D,KAAK,GAY3B,OAXIy3D,EAAWjyC,MAAQkyC,EAASlyC,MAC1BiyC,EAAWjyC,KAAO,IACpBqwC,EAAcx3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAIy9E,EAAW3jD,IAAM95B,EAAIyqC,SAC7DizC,EAASjyC,MAAQzrC,EAAIyqC,QACvBqxC,EAAYz3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAIA,EAAIyqC,OAASizC,EAAS5jD,IAAM,GAAK,OAEvE4jD,EAASlyC,KAAO,IAClBswC,EAAYz3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAI09E,EAAS5jD,IAAM95B,EAAIyqC,SACzDgzC,EAAWhyC,MAAQzrC,EAAIyqC,QACzBoxC,EAAcx3D,EAAI3e,QAAQ8lB,EAAQxrB,EAAIA,IAAIA,EAAIyqC,OAASgzC,EAAW3jD,IAAM,GAAK,MAE1E,IAAIywC,EAAcsR,EAAaC,I,YAGxCpgE,OAAA,WACE,MAAO,CAAC1tB,KAAM,OAAQm/C,OAAQlnD,KAAK41F,YAAY75E,IAAKyP,KAAMxrB,KAAK61F,UAAU95E,MAG3E,EAAO2nB,SAAA,SAAStF,EAAKuF,GACnB,OAAO,IAAI2gD,EAAclmD,EAAI3e,QAAQkkB,EAAKujB,QAAS9oB,EAAI3e,QAAQkkB,EAAKnY,QAItE,EAAOld,OAAA,SAAO8vB,EAAK05D,EAAYrR,GAC7B,Y,UADwCqR,GACjC,IAAIxT,EAAclmD,EAAI3e,QAAQq4E,GAAa15D,EAAI3e,QAAQgnE,K,YAGhEz/B,YAAA,WAAgB,OAAO,IAAI+wC,EAAa/3F,KAAK41F,YAAY75E,IAAK/b,KAAK61F,UAAU95E,M,EA1LrD,CAAS,aA6LnCuoE,EAAcjkF,UAAUunD,SAAU,EAElC,YAAUxL,OAAO,OAAQkoC,GAEzB,IAAMyT,EACJ,SAAY7wC,EAAQ17B,GAClBxrB,KAAKknD,OAASA,EACdlnD,KAAKwrB,KAAOA,GAkBT,SAASwsE,EAAkBxxF,GAChC,KAAMA,EAAM+3B,qBAAqB+lD,GAAgB,OAAO,KACxDxmD,IAAI8jD,EAAQ,GAIZ,OAHAp7E,EAAM+3B,UAAU44D,aAAW,SAAEp3D,EAAMhkB,GACjC6lE,EAAMzsE,KAAK,IAAW4qB,KAAKhkB,EAAKA,EAAMgkB,EAAKmF,SAAU,CAACwf,MAAO,qBAExD,IAAcp2C,OAAO9H,EAAM43B,IAAKwjD,GCrNlC,SAASqW,EAAYl1F,GAC1B,IAAKA,EAAMqZ,KAAM,OAAO,KAExB,IADA,gBAAcugC,EAAA,EAAAA,UAAWpK,EAAA,EAAAA,QACI,GAAtB9uC,EAAQ+iC,aAAoBmW,EAAY,GAAKpK,EAAU,GAA+C,SAA1C9uC,EAAQoqB,WAAW9lB,KAAKo6B,KAAKoyD,YAC9F53C,IACApK,IACA9uC,EAAUA,EAAQoqB,WAAWpqB,QAE/Bq6B,IAAI9hB,EAAQvY,EAAQoqB,WAAYioE,EAAO95E,EAAMjU,KAAKo6B,KAAKoyD,UACnD9zD,EAASzkB,EAAMjU,KAAK04B,OAAQyhD,EAAO,GACvC,GAAY,OAAR4T,EACF,IAAKh4D,IAAI78B,EAAI,EAAGA,EAAIwC,EAAQ+iC,WAAYvlC,IAAK,CAC3C68B,IAAI8jD,EAAQn+E,EAAQ4hC,MAAMpkC,GAAGwC,QACzB8hD,EAAOtkD,EAAI,EAAIrB,KAAKsvB,IAAI,EAAGytB,EAAY,GACvC6I,EAAQvkD,EAAIwC,EAAQ+iC,WAAa,EAAI,EAAI5mC,KAAKsvB,IAAI,EAAGqjB,EAAU,IAC/DgT,GAAQC,KAAOo8B,EAAQsW,EAAS7W,EAAe5gD,GAAQkiD,IAAK,IAAI,QAAMf,EAAOr8B,EAAMC,IAAQ/hD,SAC/Fy+E,EAAK/sE,KAAKysE,OAEP,IAAY,QAARkU,GAA0B,eAARA,EAG3B,OAAO,KAFP5T,EAAK/sE,KAAKwnC,GAAapK,EAAU2lD,EAAS7W,EAAe5gD,GAAQkiD,IAAK,IAAI,QAAMl/E,EAASk5C,EAAWpK,IAAU9uC,QAAUA,GAI1H,OAMF,SAA2Bg9B,EAAQyhD,GAEjC,IADApkD,IAAIq6D,EAAS,GACJl3F,EAAI,EAAGA,EAAIihF,EAAK/gF,OAAQF,IAE/B,IADA68B,IAAI6kD,EAAMT,EAAKjhF,GACNqrB,EAAIq2D,EAAIn8C,WAAa,EAAGla,GAAK,EAAGA,IAEvC,IADA,MAAyBq2D,EAAIt9C,MAAM/Y,GAAGwb,MAAjC89C,EAAA,EAAAA,QAASyN,EAAA,EAAAA,QACL/rF,EAAIrG,EAAGqG,EAAIrG,EAAI2kF,EAASt+E,IAC/B6wF,EAAO7wF,IAAM6wF,EAAO7wF,IAAM,GAAK+rF,EAIrC,IADAv1D,IAAI0mB,EAAQ,EACHl9C,EAAI,EAAGA,EAAI6wF,EAAOh3F,OAAQmG,IAAKk9C,EAAQ5kD,KAAKsvB,IAAIs1B,EAAO2zC,EAAO7wF,IACvE,IAAKw2B,IAAIx2B,EAAI,EAAGA,EAAI6wF,EAAOh3F,OAAQmG,IAEjC,GADIA,GAAK46E,EAAK/gF,QAAQ+gF,EAAK/sE,KAAK,WAAS8qB,OACrCk4D,EAAO7wF,GAAKk9C,EAAO,CAErB,IADA1mB,IAAImC,EAAQohD,EAAe5gD,GAAQ8hD,KAAK/gD,gBAAiBogD,EAAQ,GACxD3gF,EAAIk3F,EAAO7wF,GAAIrG,EAAIujD,EAAOvjD,IAAK2gF,EAAMzsE,KAAK8qB,GACnDiiD,EAAK56E,GAAK46E,EAAK56E,GAAGy9B,OAAO,WAASxS,KAAKqvD,IAG3C,MAAO,CAAC17B,OAAQg8B,EAAK/gF,OAAM,MAAEqjD,EAAK,KAAE09B,GA1B7BkW,CAAkB33D,EAAQyhD,GA6B5B,SAASgW,EAAStkD,EAAU7wC,GACjC+6B,IAAIiC,EAAO6T,EAASpS,gBAEpB,OADS,IAAI,IAAUzB,GAAMx8B,QAAQ,EAAGw8B,EAAKt8B,QAAQ2Y,KAAMrZ,GACjDq7B,IAOL,SAASi6D,EAAU,EAAuBC,EAAUC,G,QAAzB,M,IAAQ,O,SACxC,GAAI/zC,GAAS8zC,EAAU,CAErB,IADAx6D,IAAI2iB,EAAQ,GAAI+3C,EAAU,GACjB7V,EAAM,EAAGA,EAAMT,EAAK/gF,OAAQwhF,IAAO,CAE1C,IADA7kD,IAAIuO,EAAO61C,EAAKS,GAAMf,EAAQ,GACrBlI,EAAMj5B,EAAMkiC,IAAQ,EAAG1hF,EAAI,EAAGy4E,EAAM4e,EAAUr3F,IAAK,CAC1D68B,IAAIykD,EAAOl2C,EAAKhH,MAAMpkC,EAAIorC,EAAK7F,YAC3BkzC,EAAM6I,EAAKz6C,MAAMurD,QAAUiF,IAC7B/V,EAAOA,EAAKx6E,KAAKuG,OAAOgoF,EAAc/T,EAAKz6C,MAAOy6C,EAAKz6C,MAAMurD,QAAS3Z,EAAM6I,EAAKz6C,MAAMurD,QAAUiF,GAAW/V,EAAK9+E,UACnHm+E,EAAMzsE,KAAKotE,GACX7I,GAAO6I,EAAKz6C,MAAMurD,QAClB,IAAKv1D,IAAIxR,EAAI,EAAGA,EAAIi2D,EAAKz6C,MAAM89C,QAASt5D,IACtCm0B,EAAMkiC,EAAMr2D,IAAMm0B,EAAMkiC,EAAMr2D,IAAM,GAAKi2D,EAAKz6C,MAAMurD,QAExDmF,EAAQrjF,KAAK,WAASod,KAAKqvD,IAE7BM,EAAOsW,EACPh0C,EAAQ8zC,EAGV,GAAIpyC,GAAUqyC,EAAW,CAEvB,IADAz6D,IAAI06D,EAAU,GACL7V,EAAM,EAAG1hF,EAAI,EAAG0hF,EAAM4V,EAAW5V,IAAO1hF,IAAK,CAEpD,IADA68B,IAAI8jD,EAAQ,GAAIx8E,EAAS88E,EAAKjhF,EAAIilD,GACzB55B,EAAI,EAAGA,EAAIlnB,EAAOohC,WAAYla,IAAK,CAC1CwR,IAAIykD,EAAOn9E,EAAOigC,MAAM/Y,GACpBq2D,EAAMJ,EAAKz6C,MAAM89C,QAAU2S,IAC7BhW,EAAOA,EAAKx6E,KAAKuG,OAAO+nF,EAAQ9T,EAAKz6C,MAAO,UAAWloC,KAAKsvB,IAAI,EAAGqpE,EAAYhW,EAAKz6C,MAAM89C,UAAWrD,EAAK9+E,UAC5Gm+E,EAAMzsE,KAAKotE,GAEbiW,EAAQrjF,KAAK,WAASod,KAAKqvD,IAE7BM,EAAOsW,EACPtyC,EAASqyC,EAGX,MAAO,OAAC/zC,EAAK,OAAE0B,EAAM,KAAEg8B,GAwCzB,SAASuW,EAAkBh3D,EAAI1nB,EAAKy3B,EAAOjM,EAAOggB,EAAMC,EAAO3R,EAAK6L,GAClE,GAAW,GAAP7L,GAAYA,GAAO95B,EAAImsC,OAAQ,OAAO,EAE1C,IADApoB,IAAIiG,GAAQ,EACH21C,EAAMn0B,EAAMm0B,EAAMl0B,EAAOk0B,IAAO,CACvC57C,IAAIzqB,EAAQwgC,EAAM95B,EAAIyqC,MAAQk1B,EAAK39D,EAAMhC,EAAIA,IAAI1G,GACjD,GAAI0G,EAAIA,IAAI1G,EAAQ0G,EAAIyqC,QAAUzoC,EAAK,CACrCgoB,GAAQ,EACRjG,IAAIykD,EAAO/wC,EAAMyO,OAAOlkC,GACxB,EAAqChC,EAAIu5E,SAASv3E,GAAxC28E,EAAA,MAAeC,EAAA,OACzBl3D,EAAGue,cAAcve,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIgC,EAAMwpB,GAAQ,KAAM8wD,EAAQ9T,EAAKz6C,MAAO,UAAW+L,EAAM6kD,IACxGj3D,EAAG6N,OAAO7N,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIA,EAAIo6E,WAAWtgD,EAAK8kD,EAAUnnD,IAC5D+wC,EAAKx6E,KAAKy5B,cAAc60D,EAAQ9T,EAAKz6C,MAAO,UAAY4wD,EAAUnW,EAAKz6C,MAAM89C,QAAW/xC,KAClG6lC,GAAO6I,EAAKz6C,MAAMurD,QAAU,GAGhC,OAAOtvD,EAMT,SAAS60D,EAAgBn3D,EAAI1nB,EAAKy3B,EAAOjM,EAAOsO,EAAKyR,EAAQC,EAAM7F,GACjE,GAAY,GAAR6F,GAAaA,GAAQxrC,EAAIyqC,MAAO,OAAO,EAE3C,IADA1mB,IAAIiG,GAAQ,EACH4+C,EAAM9uC,EAAK8uC,EAAMr9B,EAAQq9B,IAAO,CACvC7kD,IAAIzqB,EAAQsvE,EAAM5oE,EAAIyqC,MAAQe,EAAMxpC,EAAMhC,EAAIA,IAAI1G,GAClD,GAAI0G,EAAIA,IAAI1G,EAAQ,IAAM0I,EAAK,CAC7BgoB,GAAQ,EACRjG,IAAIykD,EAAO/wC,EAAMyO,OAAOlkC,GAAM48E,EAAW5+E,EAAIw5E,SAASx3E,GAClD88E,EAAYp3D,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIgC,EAAMwpB,GACpD9D,EAAGue,cAAc64C,EAAW,KAAMvC,EAAc/T,EAAKz6C,MAAOyd,EAAOozC,EAAUpW,EAAKz6C,MAAMurD,SAAW9tC,EAAOozC,KAC1Gl3D,EAAG6N,OAAOupD,EAAYtW,EAAKr9C,SAAUq9C,EAAKx6E,KAAKy5B,cAAc80D,EAAc/T,EAAKz6C,MAAO,EAAGyd,EAAOozC,KACjGhW,GAAOJ,EAAKz6C,MAAM89C,QAAU,GAGhC,OAAO7hD,EAKF,SAAS+0D,EAAYtyF,EAAOkjD,EAAUqvC,EAAY7zC,EAAM08B,GAC7D9jD,IAAI0T,EAAQunD,EAAavyF,EAAM43B,IAAI6hB,OAAO84C,EAAa,GAAKvyF,EAAM43B,IAAKrkB,EAAM4nE,EAAS59E,IAAIytC,GAC1F,QAAU+T,EAAA,EAAAA,KACNC,EAAQD,EAAOq8B,EAAMp9B,MAAOc,EAASzR,EAAM+tC,EAAM17B,OACjDzkB,EAAKj7B,EAAMi7B,GAAIie,EAAU,EAC7B,SAASs5C,IACPxnD,EAAQunD,EAAat3D,EAAGrD,IAAI6hB,OAAO84C,EAAa,GAAKt3D,EAAGrD,IACxDrkB,EAAM4nE,EAAS59E,IAAIytC,GACnBkO,EAAUje,EAAG7C,QAAQ6b,KAAKt5C,QAnF9B,SAAmBsgC,EAAI1nB,EAAKy3B,EAAOjM,EAAOif,EAAO0B,EAAQxG,GACvD5hB,IAAiEmC,EAAOg5D,EAAvCvsD,EAAQ20C,EAA5B5/C,EAAGrD,IAAIr2B,KAAK04B,QACzB,GAAI+jB,EAAQzqC,EAAIyqC,MACd,IAAK1mB,IAAI6kD,EAAM,EAAG0R,EAAS,EAAG1R,EAAM5oE,EAAImsC,OAAQy8B,IAAO,CACrD7kD,IAAI22D,EAAUjjD,EAAMnM,MAAMs9C,GAC1B0R,GAAUI,EAAQvvD,SAClBpH,IAAI8jD,EAAQ,GAAIz3E,OAAA,EAEdA,EADuB,MAArBsqF,EAAQzuD,WAAqByuD,EAAQzuD,UAAUj+B,MAAQ2kC,EAAM61C,KACzDtiD,IAAUA,EAAQyM,EAAM61C,KAAK/gD,iBAE7By3D,IAAcA,EAAYvsD,EAAMgqD,YAAYl1D,iBACpD,IAAK1D,IAAI78B,EAAI8Y,EAAIyqC,MAAOvjD,EAAIujD,EAAOvjD,IAAK2gF,EAAMzsE,KAAKhL,GACnDs3B,EAAG6N,OAAO7N,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIs6E,EAAS,EAAI9uD,GAAQq8C,GAGjE,GAAI17B,EAASnsC,EAAImsC,OAAQ,CAEvB,IADApoB,IAAI8jD,EAAQ,GACH3gF,EAAI,EAAGskC,GAASxrB,EAAImsC,OAAS,GAAKnsC,EAAIyqC,MAAOvjD,EAAIrB,KAAKsvB,IAAInV,EAAIyqC,MAAOA,GAAQvjD,IAAK,CACzF68B,IAAIiT,IAAS9vC,GAAK8Y,EAAIyqC,QAClBhT,EAAMyO,OAAOlmC,EAAIA,IAAIwrB,EAAQtkC,IAAI8G,MAAQ2kC,EAAMgqD,YACnD9U,EAAMzsE,KAAK47B,EACGkoD,IAAcA,EAAYvsD,EAAMgqD,YAAYl1D,iBAC5CvB,IAAUA,EAAQyM,EAAM61C,KAAK/gD,kBAI7C,IADA1D,IAAIo7D,EAAWxsD,EAAMi2C,IAAIr0E,OAAO,KAAM,WAASikB,KAAKqvD,IAASM,EAAO,GAC3DjhF,EAAI8Y,EAAImsC,OAAQjlD,EAAIilD,EAAQjlD,IAAKihF,EAAK/sE,KAAK+jF,GACpDz3D,EAAG6N,OAAO7N,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIwrB,EAAQiM,EAAMtM,SAAW,GAAIg9C,GAEvE,SAAUjiD,IAASg5D,IA4DfE,CAAU13D,EAAI1nB,EAAKy3B,EAAOunD,EAAYvzC,EAAOF,EAAQ5F,IAAUs5C,IAC/DP,EAAkBh3D,EAAI1nB,EAAKy3B,EAAOunD,EAAYxzC,EAAMC,EAAO3R,EAAK6L,IAAUs5C,IAC1EP,EAAkBh3D,EAAI1nB,EAAKy3B,EAAOunD,EAAYxzC,EAAMC,EAAOF,EAAQ5F,IAAUs5C,IAC7EJ,EAAgBn3D,EAAI1nB,EAAKy3B,EAAOunD,EAAYllD,EAAKyR,EAAQC,EAAM7F,IAAUs5C,IACzEJ,EAAgBn3D,EAAI1nB,EAAKy3B,EAAOunD,EAAYllD,EAAKyR,EAAQE,EAAO9F,IAAUs5C,IAE9E,IAAKl7D,IAAI6kD,EAAM9uC,EAAK8uC,EAAMr9B,EAAQq9B,IAAO,CACvC7kD,IAAIvL,EAAOxY,EAAIo6E,WAAWxR,EAAKp9B,EAAM/T,GAAQhR,EAAKzmB,EAAIo6E,WAAWxR,EAAKn9B,EAAOhU,GAC7E/P,EAAGl+B,QAAQk+B,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIwY,EAAOwmE,GAAat3D,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIymB,EAAKu4D,GACrF,IAAI,QAAMnX,EAAMM,KAAKS,EAAM9uC,GAAM,EAAG,IAEjDmlD,IACAv3D,EAAG5C,aAAa,IAAIylD,EAAc7iD,EAAGrD,IAAI3e,QAAQs5E,EAAah/E,EAAIo6E,WAAWtgD,EAAK0R,EAAM/T,IACtD/P,EAAGrD,IAAI3e,QAAQs5E,EAAah/E,EAAIo6E,WAAW7uC,EAAS,EAAGE,EAAQ,EAAGhU,MACpGkY,EAASjoB,GDfX,YAAE1nB,IAAA,SAAI6kB,GACF,OAAO,IAAIm5D,EAAan5D,EAAQ7kB,IAAI/Z,KAAKknD,QAAStoB,EAAQ7kB,IAAI/Z,KAAKwrB,QAEvE,YAAE/L,QAAA,SAAQ2e,GACN,IAAIw3D,EAAcx3D,EAAI3e,QAAQzf,KAAKknD,QAAS2uC,EAAYz3D,EAAI3e,QAAQzf,KAAKwrB,MACzE,MAA8C,OAA1CoqE,EAAY5rF,OAAOjC,KAAKo6B,KAAKoyD,WACW,OAA1C,EAAYvqF,OAAOjC,KAAKo6B,KAAKoyD,WAC7B,EAAclhF,QAAUuiF,EAAY5rF,OAAOw8B,YAC3C,EAAYnzB,QAAUwiF,EAAU7rF,OAAOw8B,YACrC0vD,EAAYN,EAAaC,GACpB,IAAIvR,EAAcsR,EAAaC,GAE/B,YAAUh1D,KAAKg1D,EAAW,IjBtNhC53D,IAAMiiC,EAAgB,YAAe,CAC1C,UAAak5B,EAAM,SAAU,GAC7B,WAAcA,EAAM,QAAS,GAC7B,QAAWA,EAAM,QAAS,GAC1B,UAAaA,EAAM,OAAQ,GAE3B,kBAAmBC,EAAW,SAAU,GACxC,mBAAoBA,EAAW,QAAS,GACxC,gBAAiBA,EAAW,QAAS,GACrC,kBAAmBA,EAAW,OAAQ,GAEtC,UAAaC,EACb,gBAAiBA,EACjB,OAAUA,EACV,aAAcA,IAGhB,SAASC,EAAkB/yF,EAAOkjD,EAAUnrB,GAC1C,OAAIA,EAAU4E,GAAG38B,EAAM+3B,aACnBmrB,GAAUA,EAASljD,EAAMi7B,GAAG5C,aAAaN,GAAW2C,mBACjD,GAGT,SAASk4D,EAAM3F,EAAMn9E,GACnB,gBAAQ9P,EAAOkjD,EAAUvB,GACvBrqB,IAAIisC,EAAMvjE,EAAM+3B,UAChB,GAAIwrC,aAAeua,EACjB,OAAOiV,EAAkB/yF,EAAOkjD,EAAU,YAAU7oB,KAAKkpC,EAAI8rB,UAAWv/E,IAE1E,GAAY,SAARm9E,IAAoB1pB,EAAI9pC,MAAO,OAAO,EAC1CnC,IAAIwH,EAAMk0D,EAAYrxC,EAAMsrC,EAAMn9E,GAClC,GAAW,MAAPgvB,EAAa,OAAO,EACxB,GAAY,SAARmuD,EACF,OAAO8F,EAAkB/yF,EAAOkjD,EAAU,YAAU7oB,KAAKr6B,EAAM43B,IAAI3e,QAAQsqD,EAAIv+C,KAAOlV,GAAMA,IAE5FwnB,IAAwEu3C,EAApEokB,EAAQjzF,EAAM43B,IAAI3e,QAAQ6lB,GAAM0xC,EAAQwc,EAASiG,EAAOhG,EAAMn9E,GAIlE,OAHW++D,EAAP2B,EAAgB,YAAUn2C,KAAKm2C,EAAO,GACjC1gE,EAAM,EAAY,YAAUuqB,KAAKr6B,EAAM43B,IAAI3e,QAAQg6E,EAAMv2D,QAAQ,KAAM,GAClE,YAAUrC,KAAKr6B,EAAM43B,IAAI3e,QAAQg6E,EAAMlxD,OAAO,IAAK,GAC1DgxD,EAAkB/yF,EAAOkjD,EAAU2rB,IAKhD,SAASgkB,EAAW5F,EAAMn9E,GACxB,gBAAQ9P,EAAOkjD,EAAUvB,GACvBrqB,IAAIisC,EAAMvjE,EAAM+3B,UAChB,KAAMwrC,aAAeua,GAAgB,CACnCxmD,IAAIwH,EAAMk0D,EAAYrxC,EAAMsrC,EAAMn9E,GAClC,GAAW,MAAPgvB,EAAa,OAAO,EACxBykC,EAAM,IAAIua,EAAc99E,EAAM43B,IAAI3e,QAAQ6lB,IAE5CxH,IAAIyB,EAAQi0D,EAASzpB,EAAI8rB,UAAWpC,EAAMn9E,GAC1C,QAAKipB,GACEg6D,EAAkB/yF,EAAOkjD,EAAU,IAAI46B,EAAcva,EAAI6rB,YAAar2D,KAIjF,SAAS+5D,EAAoB9yF,EAAOkjD,GAClC5rB,IAAIisC,EAAMvjE,EAAM+3B,UAChB,KAAMwrC,aAAeua,GAAgB,OAAO,EAC5C,GAAI56B,EAAU,CACZ5rB,IAAI2D,EAAKj7B,EAAMi7B,GAAIi4D,EAAcrY,EAAe76E,EAAMi6B,QAAQ8hD,KAAK/gD,gBAAgB/9B,QACnFsmE,EAAIotB,aAAW,SAAE5U,EAAMxmE,GAChBwmE,EAAK9+E,QAAQ0/B,GAAGu2D,IACnBj4D,EAAGl+B,QAAQk+B,EAAG7C,QAAQ7kB,IAAIgC,EAAM,GAAI0lB,EAAG7C,QAAQ7kB,IAAIgC,EAAMwmE,EAAKr9C,SAAW,GAC9D,IAAI,QAAMw0D,EAAa,EAAG,OAErCj4D,EAAGma,YAAY8N,EAASjoB,GAE9B,OAAO,EAGF,SAASk4D,EAAkBxxC,EAAMpsC,GACtC+hB,IAA0B27D,EAAQhE,EAAxBttC,EAAK3hD,MAAM43B,IAA4B3e,QAAQ1D,IACzD,QAAK09E,IACLtxC,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAG5C,aAAa,IAAIylD,EAAcmV,MACpD,GAGF,SAASrpC,EAAYjI,EAAMlnB,EAAGl+B,GACnC,IAAK2yF,EAAUvtC,EAAK3hD,OAAQ,OAAO,EACnCs3B,IAAI8jD,EAAQqW,EAAYl1F,GAAQgnE,EAAM5hB,EAAK3hD,MAAM+3B,UACjD,GAAIwrC,aAAeua,EAAe,CAC3B1C,IAAOA,EAAQ,CAACp9B,MAAO,EAAG0B,OAAQ,EAAGg8B,KAAM,CAAC,WAAS3vD,KAAK2lE,EAAS7W,EAAel5B,EAAK3hD,MAAMi6B,QAAQ8hD,KAAMx/E,OAChH+6B,IAAI0T,EAAQu4B,EAAI6rB,YAAY71D,MAAM,GAAIwF,EAAQwkC,EAAI6rB,YAAYrwD,OAAO,GACjE2f,EAAOy8B,EAAS59E,IAAIytC,GAAOkiD,YAAY3pB,EAAI6rB,YAAY75E,IAAMwpB,EAAOwkC,EAAI8rB,UAAU95E,IAAMwpB,GAG5F,OAFAq8C,EAAQyW,EAAUzW,EAAO18B,EAAKM,MAAQN,EAAKK,KAAML,EAAKI,OAASJ,EAAKrR,KACpEilD,EAAY3wC,EAAK3hD,MAAO2hD,EAAKuB,SAAUnkB,EAAO2f,EAAM08B,IAC7C,EACF,GAAIA,EAAO,CAChB9jD,IAAI27D,EAAQ9D,EAAcxtC,EAAK3hD,OAAQ++B,EAAQk0D,EAAMl0D,OAAO,GAE5D,OADAuzD,EAAY3wC,EAAK3hD,MAAO2hD,EAAKuB,SAAUnkB,EAAOo8C,EAAS59E,IAAI01F,EAAM15D,MAAM,IAAIuzD,SAASmG,EAAM19E,IAAMwpB,GAAQq8C,IACjG,EAEP,OAAO,EAIJ,SAASgY,EAAgBzxC,EAAM0xC,GACpC,IAAIA,EAAWplB,UAAWolB,EAAWnlB,QAArC,CAEA52C,IAAuDksC,EAAnD8vB,EAAeC,EAAU5xC,EAAM0xC,EAAWx0F,QAC9C,GAAIw0F,EAAWjlB,UAAazsB,EAAK3hD,MAAM+3B,qBAAqB+lD,EAE1D0V,EAAiB7xC,EAAK3hD,MAAM+3B,UAAUq3D,YAAaiE,GACnDA,EAAW18B,sBACN,GAAI08B,EAAWjlB,UAAYklB,GACiC,OAAvD9vB,EAAUyrB,EAAWttC,EAAK3hD,MAAM+3B,UAAUyrC,WAC3CiwB,EAAe9xC,EAAM0xC,GAAY99E,KAAOiuD,EAAQjuD,IAGzDi+E,EAAiBhwB,EAAS6vB,GAC1BA,EAAW18B,sBACN,IAAK28B,EAEV,OAwCF3xC,EAAK6f,KAAKvmD,iBAAiB,UAAWnG,GACtC6sC,EAAK6f,KAAKvmD,iBAAiB,YAAanG,GACxC6sC,EAAK6f,KAAKvmD,iBAAiB,YAAa+hC,GArCxC,SAASw2C,EAAiBhwB,EAASxxC,GACjCsF,IAAIyB,EAAQ06D,EAAe9xC,EAAM3vB,GAC7B0hE,EAAuC,MAA5B94F,EAAIgjC,SAAS+jB,EAAK3hD,OACjC,IAAK+4B,IAAU22D,EAAYlsB,EAASzqC,GAAQ,CAC1C,IAAI26D,EACC,OADS36D,EAAQyqC,EAGxBlsC,IAAIS,EAAY,IAAI+lD,EAActa,EAASzqC,GAC3C,GAAI26D,IAAa/xC,EAAK3hD,MAAM+3B,UAAU4E,GAAG5E,GAAY,CACnDT,IAAI2D,EAAK0mB,EAAK3hD,MAAMi7B,GAAG5C,aAAaN,GAChC27D,GAAUz4D,EAAGX,QAAQ1/B,EAAK4oE,EAAQjuD,KACtCosC,EAAKuB,SAASjoB,IAKlB,SAASnmB,IACP6sC,EAAK6f,KAAKljB,oBAAoB,UAAWxpC,GACzC6sC,EAAK6f,KAAKljB,oBAAoB,YAAaxpC,GAC3C6sC,EAAK6f,KAAKljB,oBAAoB,YAAatB,GACX,MAA5BpiD,EAAIgjC,SAAS+jB,EAAK3hD,QAAgB2hD,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAGX,QAAQ1/B,GAAM,IAGlF,SAASoiD,EAAKhrB,GACZsF,IAAuCksC,EAAnC9iB,EAAS9lD,EAAIgjC,SAAS+jB,EAAK3hD,OAC/B,GAAc,MAAV0gD,EAEF8iB,EAAU7hB,EAAK3hD,MAAM43B,IAAI3e,QAAQynC,QAC5B,GAAI6yC,EAAU5xC,EAAM3vB,EAAMnzB,SAAWy0F,KAE1C9vB,EAAUiwB,EAAe9xC,EAAM0xC,IACjB,OAAOv+E,IAEnB0uD,GAASgwB,EAAiBhwB,EAASxxC,IAS3C,SAASghE,EAAYrxC,EAAMsrC,EAAMn9E,GAC/B,KAAM6xC,EAAK3hD,MAAM+3B,qBAAqB,iBAAgB,OAAO,KAE7D,IADA,IAAKgB,EAAS4oB,EAAK3hD,MAAM+3B,UAApBgB,MACI+J,EAAI/J,EAAM4I,MAAQ,EAAGmB,GAAK,EAAGA,IAAK,CACzCxL,IAAI9zB,EAASu1B,EAAMQ,KAAKuJ,GACxB,IADoChzB,EAAM,EAAIipB,EAAMlsB,MAAMi2B,GAAK/J,EAAM8I,WAAWiB,MAClEhzB,EAAM,EAAI,EAAItM,EAAOw8B,YAAa,OAAO,KACvD,GAAkC,QAA9Bx8B,EAAOjC,KAAKo6B,KAAKoyD,WAAqD,eAA9BvqF,EAAOjC,KAAKo6B,KAAKoyD,UAA4B,CACvFz2D,IAAIwkD,EAAU/iD,EAAM2D,OAAOoG,GACvB6wD,EAAiB,QAAR1G,EAAkBn9E,EAAM,EAAI,OAAS,KAASA,EAAM,EAAI,QAAU,OAC/E,OAAO6xC,EAAK2hB,eAAeqwB,GAAU7X,EAAU,MAGnD,OAAO,KAGT,SAASyX,EAAU5xC,EAAM3Z,GACvB,KAAOA,GAAOA,GAAO2Z,EAAK3Z,IAAKA,EAAMA,EAAI3hB,WACvC,GAAoB,MAAhB2hB,EAAIiG,UAAoC,MAAhBjG,EAAIiG,SAAkB,OAAOjG,EAG7D,SAASyrD,EAAe9xC,EAAM3vB,GAC5BsF,IAAIs8D,EAAWjyC,EAAK7B,YAAY,CAACf,KAAM/sB,EAAM+tB,QAAS1S,IAAKrb,EAAMguB,UACjE,OAAK4zC,GACEA,EAAW3E,EAAWttC,EAAK3hD,MAAM43B,IAAI3e,QAAQ26E,EAASr+E,MADvC,KmB5LZ,IAACs+E,GAAe,IAAI,YAAU,cA+BnC,SAASC,GAAU9zF,EAAOy8B,GAC/BnF,IAAI2D,EAAI/hC,EAAQ,SAACqgC,EAAMhkB,GACW,SAA5BgkB,EAAKh4B,KAAKo6B,KAAKoyD,YAAsB9yD,EAUtC,SAAkBj7B,EAAOgrC,EAAO+oD,EAAU94D,GAC/C3D,IAAI/jB,EAAM4nE,EAAS59E,IAAIytC,GACvB,IAAKz3B,EAAIm5E,SAAU,OAAOzxD,EACrBA,IAAIA,EAAKj7B,EAAMi7B,IAKpB,IADA3D,IAkBI9hB,EAAO2e,EAlBP6/D,EAAU,GACLv5F,EAAI,EAAGA,EAAI8Y,EAAImsC,OAAQjlD,IAAKu5F,EAAQrlF,KAAK,GAClD,IAAK2oB,IAAI78B,EAAI,EAAGA,EAAI8Y,EAAIm5E,SAAS/xF,OAAQF,IAAK,CAC5C68B,IAAI28D,EAAO1gF,EAAIm5E,SAASjyF,GACxB,GAAiB,aAAbw5F,EAAK1yF,KAAqB,CAE5B,IADA+1B,IAAIykD,EAAO/wC,EAAMyO,OAAOw6C,EAAK1+E,KACpBuQ,EAAI,EAAGA,EAAIi2D,EAAKz6C,MAAM89C,QAASt5D,IAAKkuE,EAAQC,EAAK9X,IAAMr2D,IAAMmuE,EAAK5hF,EAC3E4oB,EAAGue,cAAcve,EAAG7C,QAAQ7kB,IAAIwgF,EAAW,EAAIE,EAAK1+E,KAAM,KAAMu6E,EAAc/T,EAAKz6C,MAAOy6C,EAAKz6C,MAAMurD,QAAUoH,EAAK5hF,EAAG4hF,EAAK5hF,SACvH,GAAiB,WAAb4hF,EAAK1yF,KACdyyF,EAAQC,EAAK9X,MAAQ8X,EAAK5hF,OACrB,GAAiB,oBAAb4hF,EAAK1yF,KAA4B,CAC1C+1B,IAAIykD,EAAO/wC,EAAMyO,OAAOw6C,EAAK1+E,KAC7B0lB,EAAGue,cAAcve,EAAG7C,QAAQ7kB,IAAIwgF,EAAW,EAAIE,EAAK1+E,KAAM,KAAMs6E,EAAQ9T,EAAKz6C,MAAO,UAAWy6C,EAAKz6C,MAAM89C,QAAU6U,EAAK5hF,SACpH,GAAiB,qBAAb4hF,EAAK1yF,KAA6B,CAC3C+1B,IAAIykD,EAAO/wC,EAAMyO,OAAOw6C,EAAK1+E,KAC7B0lB,EAAGue,cAAcve,EAAG7C,QAAQ7kB,IAAIwgF,EAAW,EAAIE,EAAK1+E,KAAM,KAAMs6E,EAAQ9T,EAAKz6C,MAAO,WAAY2yD,EAAKrH,YAIzG,IAAKt1D,IAAI78B,EAAI,EAAGA,EAAIu5F,EAAQr5F,OAAQF,IAASu5F,EAAQv5F,KACtC,MAAT+a,IAAeA,EAAQ/a,GAC3B05B,EAAO15B,GAMT,IAAK68B,IAAI78B,EAAI,EAAG8a,EAAMw+E,EAAW,EAAGt5F,EAAI8Y,EAAImsC,OAAQjlD,IAAK,CACvD68B,IAAI6kD,EAAMnxC,EAAMnM,MAAMpkC,GAClBqkC,EAAMvpB,EAAM4mE,EAAIz9C,SAChB/6B,EAAMqwF,EAAQv5F,GAClB,GAAIkJ,EAAM,EAAG,CACX2zB,IAAI48D,EAAgB,OAChB/X,EAAI90D,aACN6sE,EAAgB/X,EAAI90D,WAAW9lB,KAAKo6B,KAAKoyD,WAG3C,IADAz2D,IAAI+J,EAAQ,GACHvb,EAAI,EAAGA,EAAIniB,EAAKmiB,IACvBub,EAAM1yB,KAAKksE,EAAe76E,EAAMi6B,QAAQi6D,GAAel5D,iBACzD1D,IAAIm1B,EAAa,GAALhyD,GAAU+a,GAAS/a,EAAI,GAAM05B,GAAQ15B,EAAcqkC,EAAM,EAAhBvpB,EAAM,EAC3D0lB,EAAG6N,OAAO7N,EAAG7C,QAAQ7kB,IAAIk5C,GAAOprB,GAElC9rB,EAAMupB,EAER,OAAO7D,EAAGX,QAAQu5D,GAAc,CAAEC,WAAW,IA7DGK,CAASn0F,EAAOu5B,EAAMhkB,EAAK0lB,KAI3E,OAFKwB,EACIA,EAAS7E,KAAO53B,EAAM43B,KA/BjC,SAASw8D,EAAmBhkB,EAAK/qC,EAAK9D,EAAQ1jC,GAC5Cy5B,IAAIoc,EAAU08B,EAAIpwC,WAAYq0D,EAAUhvD,EAAIrF,WAC5CmX,EAAO,IAAK7f,IAAI78B,EAAI,EAAGqrB,EAAI,EAAGrrB,EAAI45F,EAAS55F,IAAK,CAE9C,IADA68B,IAAIuH,EAAQwG,EAAIxG,MAAMpkC,GACbosC,EAAO/gB,EAAG/Y,EAAI3T,KAAKiJ,IAAIqxC,EAASj5C,EAAI,GAAIosC,EAAO95B,EAAG85B,IACzD,GAAIupC,EAAIvxC,MAAMgI,IAAShI,EAAO,CAC5B/Y,EAAI+gB,EAAO,EACXtF,GAAU1C,EAAMH,SAChB,SAASyY,EAGbt5C,EAAEghC,EAAO0C,GACLzb,EAAI4tB,GAAW08B,EAAIvxC,MAAM/Y,GAAG2Z,WAAWZ,GACzCu1D,EAAmBhkB,EAAIvxC,MAAM/Y,GAAI+Y,EAAO0C,EAAS,EAAG1jC,GAEpDghC,EAAMF,aAAa,EAAGE,EAAM5hC,QAAQ2Y,KAAM/X,EAAG0jC,EAAS,GACxDA,GAAU1C,EAAMH,UAekB01D,CAAmB33D,EAAS7E,IAAK53B,EAAM43B,IAAK,EAAG1+B,GADpE8G,EAAM43B,IAAIoH,YAAY9lC,GAE9B+hC,ErEzBF,SAASq5D,GAAat0F,GAC3Bs3B,IAEIonB,EAFA6kB,EAAMvjE,EAAM+3B,UAAW6f,EAAOu3C,EAAcnvF,GAC5CgrC,EAAQ4M,EAAKre,MAAM,GAAIg5D,EAAa36C,EAAK7Y,OAAO,GAAIxrB,EAAM4nE,EAAS59E,IAAIytC,GAS3E,OANE0T,EADE6kB,aAAeua,EACVvqE,EAAI25E,YAAY3pB,EAAI6rB,YAAY75E,IAAMg9E,EAAYhvB,EAAI8rB,UAAU95E,IAAMg9E,GAEtEh/E,EAAIu5E,SAASl1C,EAAKriC,IAAMg9E,IAC5BA,WAAaA,EAClB7zC,EAAKnrC,IAAMA,EACXmrC,EAAK1T,MAAQA,EACN0T,EAIF,SAAS4hC,GAAUrlD,EAAI,EAA0Bi4C,G,QAApB,I,IAAY,W,UAC1CqhB,EAAYrhB,EAAM,GAAK,EAAI,EAC3B8c,EAAez8E,EAAKy3B,EAAOkoC,EAAMqhB,KACnCA,EAAmB,GAAPrhB,GAAYA,GAAO3/D,EAAIyqC,MAAQ,KAAO,GAEpD,IAAK1mB,IAAI6kD,EAAM,EAAGA,EAAM5oE,EAAImsC,OAAQy8B,IAAO,CACzC7kD,IAAIzqB,EAAQsvE,EAAM5oE,EAAIyqC,MAAQk1B,EAE9B,GAAIA,EAAM,GAAKA,EAAM3/D,EAAIyqC,OAASzqC,EAAIA,IAAI1G,EAAQ,IAAM0G,EAAIA,IAAI1G,GAAQ,CACtEyqB,IAAI/hB,EAAMhC,EAAIA,IAAI1G,GAAQkvE,EAAO/wC,EAAMyO,OAAOlkC,GAC9C0lB,EAAGue,cAAcve,EAAG7C,QAAQ7kB,IAAIg/E,EAAah9E,GAAM,KAClCw6E,EAAWhU,EAAKz6C,MAAO4xC,EAAM3/D,EAAIw5E,SAASx3E,KAE3D4mE,GAAOJ,EAAKz6C,MAAM89C,QAAU,MACvB,CACL9nD,IAAI/1B,EAAoB,MAAbgzF,EAAoB1Z,EAAe7vC,EAAMzpC,KAAK04B,QAAQ8hD,KAC3D/wC,EAAMyO,OAAOlmC,EAAIA,IAAI1G,EAAQ0nF,IAAYhzF,KAC3CgU,EAAMhC,EAAIo6E,WAAWxR,EAAKjJ,EAAKloC,GACnC/P,EAAG6N,OAAO7N,EAAG7C,QAAQ7kB,IAAIg/E,EAAah9E,GAAMhU,EAAKy5B,kBAGrD,OAAOC,EAKF,SAASu5D,GAAgBx0F,EAAOkjD,GACrC,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAIonB,EAAO41C,GAAat0F,GACxBkjD,EAASo9B,GAAUtgF,EAAMi7B,GAAIyjB,EAAMA,EAAKK,OAE1C,OAAO,EAKF,SAAS01C,GAAez0F,EAAOkjD,GACpC,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAIonB,EAAO41C,GAAat0F,GACxBkjD,EAASo9B,GAAUtgF,EAAMi7B,GAAIyjB,EAAMA,EAAKM,QAE1C,OAAO,EAGF,SAAS01C,GAAaz5D,EAAI,EAA0Bi4C,GAEzD,I,QAFqC,I,IAAOloC,M,eACxC2pD,EAAW15D,EAAG7C,QAAQ6b,KAAKt5C,OACtBwhF,EAAM,EAAGA,EAAM5oE,EAAImsC,QAAS,CACnCpoB,IAAIzqB,EAAQsvE,EAAM5oE,EAAIyqC,MAAQk1B,EAAK39D,EAAMhC,EAAIA,IAAI1G,GAAQkvE,EAAO/wC,EAAMyO,OAAOlkC,GAE7E,GAAK29D,EAAM,GAAK3/D,EAAIA,IAAI1G,EAAQ,IAAM0I,GAAS29D,EAAM3/D,EAAIyqC,MAAQ,GAAKzqC,EAAIA,IAAI1G,EAAQ,IAAM0I,EAC1F0lB,EAAGue,cAAcve,EAAG7C,QAAQ77B,MAAMo4F,GAAUphF,IAAIg/E,EAAah9E,GAAM,KAClDu6E,EAAc/T,EAAKz6C,MAAO4xC,EAAM3/D,EAAIw5E,SAASx3E,SACzD,CACL+hB,IAAIyH,EAAQ9D,EAAG7C,QAAQ77B,MAAMo4F,GAAUphF,IAAIg/E,EAAah9E,GACxD0lB,EAAG4f,OAAO9b,EAAOA,EAAQg9C,EAAKr9C,UAEhCy9C,GAAOJ,EAAKz6C,MAAM89C,SAMf,SAASwV,GAAa50F,EAAOkjD,GAClC,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAIonB,EAAO41C,GAAat0F,GAAQi7B,EAAKj7B,EAAMi7B,GAC3C,GAAiB,GAAbyjB,EAAKK,MAAaL,EAAKM,OAASN,EAAKnrC,IAAIyqC,MAAO,OAAO,EAC3D,IAAK1mB,IAAI78B,EAAIikD,EAAKM,MAAQ,EACxB01C,GAAaz5D,EAAIyjB,EAAMjkD,GACnBA,GAAKikD,EAAKK,KAFctkD,IAG5BikD,EAAK1T,MAAQ0T,EAAK6zC,WAAat3D,EAAGrD,IAAI6hB,OAAOiF,EAAK6zC,WAAa,GAAKt3D,EAAGrD,IACvE8mB,EAAKnrC,IAAM4nE,EAAS59E,IAAImhD,EAAK1T,OAE/BkY,EAASjoB,GAEX,OAAO,EAGF,SAAS45D,GAAYthF,EAAKy3B,EAAOmxC,GAEtC,IADA7kD,IAAI24D,EAAapV,EAAe7vC,EAAMzpC,KAAK04B,QAAQi2D,YAC1Chd,EAAM,EAAGA,EAAM3/D,EAAIyqC,MAAOk1B,IACjC,GAAIloC,EAAMyO,OAAOlmC,EAAIA,IAAI2/D,EAAMiJ,EAAM5oE,EAAIyqC,QAAQz8C,MAAQ0uF,EACvD,OAAO,EACX,OAAO,EAGF,SAAS7O,GAAOnmD,EAAI,EAA0BkhD,GAEnD,I,QAF+B,I,IAAY,W,UACvC2C,EAASyT,EACJ93F,EAAI,EAAGA,EAAI0hF,EAAK1hF,IAAKqkF,GAAU9zC,EAAMnM,MAAMpkC,GAAGikC,SACvDpH,IAAI8jD,EAAQ,GAAI0Z,EAAS3Y,EAAM,GAAK,EAAI,EACpC0Y,GAAYthF,EAAKy3B,EAAOmxC,EAAM2Y,KAChCA,EAAgB,GAAP3Y,GAAYA,GAAO5oE,EAAImsC,OAAS,KAAO,GAClD,IAAKpoB,IAAI47C,EAAM,EAAGrmE,EAAQ0G,EAAIyqC,MAAQm+B,EAAKjJ,EAAM3/D,EAAIyqC,MAAOk1B,IAAOrmE,IAEjE,GAAIsvE,EAAM,GAAKA,EAAM5oE,EAAImsC,QAAUnsC,EAAIA,IAAI1G,IAAU0G,EAAIA,IAAI1G,EAAQ0G,EAAIyqC,OAAQ,CAC/E1mB,IAAI/hB,EAAMhC,EAAIA,IAAI1G,GAAQy0B,EAAQ0J,EAAMyO,OAAOlkC,GAAK+rB,MACpDrG,EAAGue,cAAc+4C,EAAah9E,EAAK,KAAMs6E,EAAQvuD,EAAO,UAAWA,EAAM89C,QAAU,IACnFlM,GAAO5xC,EAAMurD,QAAU,MAClB,CACLv1D,IAAI/1B,EAAiB,MAAVuzF,EAAiBja,EAAe7vC,EAAMzpC,KAAK04B,QAAQ8hD,KACxD/wC,EAAMyO,OAAOlmC,EAAIA,IAAI1G,EAAQioF,EAASvhF,EAAIyqC,QAAQz8C,KACxD65E,EAAMzsE,KAAKpN,EAAKy5B,iBAIpB,OADAC,EAAG6N,OAAOg2C,EAAQjE,EAAe7vC,EAAMzpC,KAAK04B,QAAQkiD,IAAIr0E,OAAO,KAAMszE,IAC9DngD,EAKF,SAAS85D,GAAa/0F,EAAOkjD,GAClC,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAIonB,EAAO41C,GAAat0F,GACxBkjD,EAASk+B,GAAOphF,EAAMi7B,GAAIyjB,EAAMA,EAAKrR,MAEvC,OAAO,EAKF,SAAS2nD,GAAYh1F,EAAOkjD,GACjC,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAIonB,EAAO41C,GAAat0F,GACxBkjD,EAASk+B,GAAOphF,EAAMi7B,GAAIyjB,EAAMA,EAAKI,SAEvC,OAAO,EAGF,SAASm2C,GAAUh6D,EAAI,EAA0BkhD,GAEtD,I,QAFkC,I,IAAOnxC,M,eACrC8zC,EAAS,EACJrkF,EAAI,EAAGA,EAAI0hF,EAAK1hF,IAAKqkF,GAAU9zC,EAAMnM,MAAMpkC,GAAGikC,SACvDpH,IAAI49D,EAAUpW,EAAS9zC,EAAMnM,MAAMs9C,GAAKz9C,SAEpCwa,EAAUje,EAAG7C,QAAQ6b,KAAKt5C,OAC9BsgC,EAAG4f,OAAOikC,EAASyT,EAAY2C,EAAU3C,GAEzC,IAAKj7D,IAAI47C,EAAM,EAAGrmE,EAAQsvE,EAAM5oE,EAAIyqC,MAAOk1B,EAAM3/D,EAAIyqC,MAAOk1B,IAAOrmE,IAAS,CAC1EyqB,IAAI/hB,EAAMhC,EAAIA,IAAI1G,GAClB,GAAIsvE,EAAM,GAAK5mE,GAAOhC,EAAIA,IAAI1G,EAAQ0G,EAAIyqC,OAAQ,CAEhD1mB,IAAIgK,EAAQ0J,EAAMyO,OAAOlkC,GAAK+rB,MAC9BrG,EAAGue,cAAcve,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIgC,EAAMg9E,GAAa,KAAM1C,EAAQvuD,EAAO,UAAWA,EAAM89C,QAAU,IAClHlM,GAAO5xC,EAAMurD,QAAU,OAClB,GAAI1Q,EAAM5oE,EAAIyqC,OAASzoC,GAAOhC,EAAIA,IAAI1G,EAAQ0G,EAAIyqC,OAAQ,CAE/D1mB,IAAIykD,EAAO/wC,EAAMyO,OAAOlkC,GACpBwqB,EAAOg8C,EAAKx6E,KAAKuG,OAAO+nF,EAAQ9T,EAAKz6C,MAAO,UAAWy6C,EAAKz6C,MAAM89C,QAAU,GAAIrD,EAAK9+E,SACrFk4F,EAAS5hF,EAAIo6E,WAAWxR,EAAM,EAAGjJ,EAAKloC,GAC1C/P,EAAG6N,OAAO7N,EAAG7C,QAAQ77B,MAAM28C,GAAS3lC,IAAIg/E,EAAa4C,GAASp1D,GAC9DmzC,GAAO6I,EAAKz6C,MAAMurD,QAAU,IAO3B,SAASuI,GAAUp1F,EAAOkjD,GAC/B,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAIonB,EAAO41C,GAAat0F,GAAQi7B,EAAKj7B,EAAMi7B,GAC3C,GAAgB,GAAZyjB,EAAKrR,KAAYqR,EAAKI,QAAUJ,EAAKnrC,IAAImsC,OAAQ,OAAO,EAC5D,IAAKpoB,IAAI78B,EAAIikD,EAAKI,OAAS,EACzBm2C,GAAUh6D,EAAIyjB,EAAMjkD,GAChBA,GAAKikD,EAAKrR,IAFe5yC,IAG7BikD,EAAK1T,MAAQ0T,EAAK6zC,WAAat3D,EAAGrD,IAAI6hB,OAAOiF,EAAK6zC,WAAa,GAAKt3D,EAAGrD,IACvE8mB,EAAKnrC,IAAM4nE,EAAS59E,IAAImhD,EAAK1T,OAE/BkY,EAASjoB,GAEX,OAAO,EAGT,SAASo6D,GAAQtZ,GACfzkD,IAAIpxB,EAAI61E,EAAK9+E,QACb,OAAuB,GAAhBiJ,EAAE85B,YAAmB95B,EAAEmhB,WAAWspB,aAA0C,GAA3BzqC,EAAEmhB,WAAW2Y,WAsBhE,SAASs1D,GAAWt1F,EAAOkjD,GAChC5rB,IAAIisC,EAAMvjE,EAAM+3B,UAChB,KAAMwrC,aAAeua,IAAkBva,EAAI6rB,YAAY75E,KAAOguD,EAAI8rB,UAAU95E,IAAK,OAAO,EACxF+hB,IAAIonB,EAAO41C,GAAat0F,GAASuT,EAAA,EAAAA,IACjC,GAvBF,SAA+B,EAAsBmrC,GAGnD,I,QAHqC,M,IAAQ,O,QACzC62C,EAAW72C,EAAKrR,IAAM2Q,EAAQU,EAAKK,KAAMy2C,EAAYD,EACrDE,GAAe/2C,EAAKI,OAAS,GAAKd,EAAQU,EAAKK,KAAM22C,EAAaH,GAAY72C,EAAKM,MAAQN,EAAKK,KAAO,GAClGtkD,EAAIikD,EAAKrR,IAAK5yC,EAAIikD,EAAKI,OAAQrkD,IAAK,CAC3C,GAAIikD,EAAKK,KAAO,GAAKxrC,EAAIiiF,IAAcjiF,EAAIiiF,EAAY,IACnD92C,EAAKM,MAAQhB,GAASzqC,EAAImiF,IAAeniF,EAAImiF,EAAa,GAAI,OAAO,EACzEF,GAAax3C,EAAO03C,GAAc13C,EAEpC,IAAK1mB,IAAI78B,EAAIikD,EAAKK,KAAMtkD,EAAIikD,EAAKM,MAAOvkD,IAAK,CAC3C,GAAIikD,EAAKrR,IAAM,GAAK95B,EAAIgiF,IAAahiF,EAAIgiF,EAAWv3C,IAChDU,EAAKI,OAASY,GAAUnsC,EAAIkiF,IAAgBliF,EAAIkiF,EAAcz3C,GAAQ,OAAO,EACjFu3C,IAAYE,IAEd,OAAO,EAUHE,CAAsBpiF,EAAKmrC,GAAO,OAAO,EAC7C,GAAIwE,EAAU,CAEZ,IADA5rB,IAAwDs+D,EAAWC,EAA/D56D,EAAKj7B,EAAMi7B,GAAIqB,EAAO,GAAIr/B,EAAU,WAASw8B,MACxC0iD,EAAMz9B,EAAKrR,IAAK8uC,EAAMz9B,EAAKI,OAAQq9B,IAC1C,IAAK7kD,IAAI47C,EAAMx0B,EAAKK,KAAMm0B,EAAMx0B,EAAKM,MAAOk0B,IAAO,CACjD57C,IAAIwkD,EAAUvoE,EAAIA,IAAI4oE,EAAM5oE,EAAIyqC,MAAQk1B,GAAM6I,EAAOr9B,EAAK1T,MAAMyO,OAAOqiC,GACvE,IAAIx/C,EAAKw/C,GAET,GADAx/C,EAAKw/C,IAAW,EACC,MAAb8Z,EACFA,EAAY9Z,EACZ+Z,EAAa9Z,MACR,CACAsZ,GAAQtZ,KAAO9+E,EAAUA,EAAQshC,OAAOw9C,EAAK9+E,UAClDq6B,IAAIqhB,EAAS1d,EAAG7C,QAAQ7kB,IAAIuoE,EAAUp9B,EAAK6zC,YAC3Ct3D,EAAG4f,OAAOlC,EAAQA,EAASojC,EAAKr9C,WAOtC,GAHAzD,EAAGue,cAAco8C,EAAYl3C,EAAK6zC,WAAY,KAC7B1C,EAAQE,EAAW8F,EAAWv0D,MAAOu0D,EAAWv0D,MAAMurD,QAAUnuC,EAAKM,MAAQN,EAAKK,KAAQ82C,EAAWv0D,MAAMurD,SACnG,UAAWnuC,EAAKI,OAASJ,EAAKrR,MACnDpwC,EAAQ2Y,KAAM,CAChB0hB,IAAIwH,EAAM82D,EAAY,EAAIC,EAAW54F,QAAQ2Y,KACzCmpB,EAAQs2D,GAAQQ,GAAcD,EAAY,EAAI92D,EAClD7D,EAAGrB,YAAYmF,EAAQ2f,EAAK6zC,WAAYzzD,EAAM4f,EAAK6zC,WAAYt1F,GAEjEg+B,EAAG5C,aAAa,IAAIylD,EAAc7iD,EAAGrD,IAAI3e,QAAQ28E,EAAYl3C,EAAK6zC,cAClErvC,EAASjoB,GAEX,OAAO,EAKF,SAAS66D,GAAU91F,EAAOkjD,GAC/BzrB,IAAMqM,EAAY+2C,EAAe76E,EAAMi6B,QACvC,OAAO87D,IAAkB,SAAC,G,aAGxB,OAAOjyD,EAAUvK,EAAKh4B,KAAKo6B,KAAKoyD,aAH3BgI,CAIJ/1F,EAAOkjD,GAML,SAAS6yC,GAAkBC,GAChC,gBAAQh2F,EAAOkjD,GACb5rB,IACIg3D,EAAUxS,EADVvY,EAAMvjE,EAAM+3B,UAEhB,GAAMwrC,aAAeua,EAId,CACL,GAAIva,EAAI6rB,YAAY75E,KAAOguD,EAAI8rB,UAAU95E,IAAK,OAAO,EACrD+4E,EAAW/qB,EAAI6rB,YAAYptD,UAC3B85C,EAAUvY,EAAI6rB,YAAY75E,QAPS,CAEnC,KADA+4E,EkEtRC,SAAsB12C,GAC3B,IAAKtgB,IAAIwL,EAAI8U,EAAKjW,MAAOmB,EAAI,EAAGA,IAAK,CACnCrL,IAAM63D,EAAO13C,EAAKre,KAAKuJ,GAAGvhC,KAAKo6B,KAAKoyD,UACpC,GAAa,SAATuB,GAA4B,gBAATA,EAAwB,OAAO13C,EAAKre,KAAKuJ,GAElE,OAAO,KlEiRQmzD,CAAa1yB,EAAIhsC,QACb,OAAO,EACtBukD,EAAUmT,EAAW1rB,EAAIhsC,OAAOhiB,IAMlC,GAA8B,GAA1B+4E,EAAShtD,MAAMurD,SAA0C,GAA1ByB,EAAShtD,MAAM89C,QAAe,OAAO,EACxE,GAAIl8B,EAAU,CACZ5rB,IAAI4+D,EAAY5H,EAAShtD,MAAOA,EAAQ,GAAIsrD,EAAWsJ,EAAUtJ,SAC7DsJ,EAAU9W,QAAU,IAAG8W,EAAYrG,EAAQqG,EAAW,UAAW,IACjEA,EAAUrJ,QAAU,IAAGqJ,EAAYrG,EAAQqG,EAAW,UAAW,IAErE,IADA5+D,IAGI6+D,EAHAz3C,EAAO41C,GAAat0F,GAAQi7B,EAAKj7B,EAAMi7B,GAClCxgC,EAAI,EAAGA,EAAIikD,EAAKM,MAAQN,EAAKK,KAAMtkD,IAC1C6mC,EAAM3yB,KAAKi+E,EAAWiD,EAAQqG,EAAW,WAAYtJ,GAAYA,EAASnyF,GAAK,CAACmyF,EAASnyF,IAAM,MAAQy7F,GAEzG,IAAK5+D,IAAI6kD,EAAMz9B,EAAKrR,IAAK8uC,EAAMz9B,EAAKI,OAAQq9B,IAAO,CACjD7kD,IAAI/hB,EAAMmpC,EAAKnrC,IAAIo6E,WAAWxR,EAAKz9B,EAAKK,KAAML,EAAK1T,OAC/CmxC,GAAOz9B,EAAKrR,MAAK93B,GAAO+4E,EAAS5vD,UACrC,IAAKpH,IAAI47C,EAAMx0B,EAAKK,KAAMtkD,EAAI,EAAGy4E,EAAMx0B,EAAKM,MAAOk0B,IAAOz4E,IACpDy4E,GAAOx0B,EAAKK,MAAQo9B,GAAOz9B,EAAKrR,KACpCpS,EAAG6N,OAAOqtD,EAAWl7D,EAAG7C,QAAQ7kB,IAAIgC,EAAMmpC,EAAK6zC,WAAY,GAAIyD,EAAY,CAAEz8D,KAAM+0D,EAAQ,IAAEnS,EAAG,IAAEjJ,IAAMl4C,cAAcsG,EAAM7mC,KAGhIwgC,EAAGue,cAAcsiC,EAASka,EAAY,CAAEz8D,KAAM+0D,EAAUnS,IAAKz9B,EAAKrR,IAAK6lC,IAAKx0B,EAAKK,OAAQzd,EAAM,IAC3FiiC,aAAeua,GACjB7iD,EAAG5C,aAAa,IAAIylD,EAAc7iD,EAAGrD,IAAI3e,QAAQsqD,EAAI6rB,YAAY75E,KAC/B4gF,GAAYl7D,EAAGrD,IAAI3e,QAAQk9E,KAC/DjzC,EAASjoB,GAEX,OAAO,GAQJ,SAASm7D,GAAYn9F,EAAMgF,GAChC,OAAO,SAAS+B,EAAOkjD,GACrB,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9Bs3B,IAAI27D,EAAQ9D,EAAcnvF,GAC1B,GAAIizF,EAAMjxD,UAAUV,MAAMroC,KAAUgF,EAAO,OAAO,EAClD,GAAIilD,EAAU,CACZ5rB,IAAI2D,EAAKj7B,EAAMi7B,GACXj7B,EAAM+3B,qBAAqB+lD,EAC7B99E,EAAM+3B,UAAU44D,aAAW,SAAEp3D,EAAMhkB,GAC7BgkB,EAAK+H,MAAMroC,KAAUgF,GACvBg9B,EAAGue,cAAcjkC,EAAK,KAAMs6E,EAAQt2D,EAAK+H,MAAOroC,EAAMgF,OAG1Dg9B,EAAGue,cAAcy5C,EAAM19E,IAAK,KAAMs6E,EAAQoD,EAAMjxD,UAAUV,MAAOroC,EAAMgF,IACzEilD,EAASjoB,GAEX,OAAO,GAwBX,SAASo7D,GAAsB90F,EAAMm9C,EAAMxY,GASzC,IAPAzO,IAAM6+D,EAAgB53C,EAAKnrC,IAAI2qE,YAAY,CACzCn/B,KAAM,EACN1R,IAAK,EACL2R,MAAe,OAARz9C,EAAgBm9C,EAAKnrC,IAAIyqC,MAAQ,EACxCc,OAAgB,UAARv9C,EAAmBm9C,EAAKnrC,IAAImsC,OAAS,IAGtCjlD,EAAI,EAAGA,EAAI67F,EAAc37F,OAAQF,IAAK,CAC7Cg9B,IAAMskD,EAAOr9B,EAAK1T,MAAMyO,OAAO68C,EAAc77F,IAC7C,GAAIshF,GAAQA,EAAKx6E,OAAS2kC,EAAMgqD,YAC9B,OAAO,EAIX,OAAO,EAMF,SAASqG,GAAah1F,EAAM5C,GAGjC,OAFAA,EAAUA,GAAW,CAAE63F,oBAAoB,IAE/BA,mBA7Cd,SAAiCj1F,GAC/B,OAAO,SAASvB,EAAOkjD,GACrB,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CAMZ,IALA5rB,IAAI4O,EAAQ20C,EAAe76E,EAAMi6B,QAC7BykB,EAAO41C,GAAat0F,GAAQi7B,EAAKj7B,EAAMi7B,GACvCmgD,EAAQ18B,EAAKnrC,IAAI2qE,YAAoB,UAAR38E,EAAmB,IAAIkrF,EAAK/tC,EAAKK,KAAM,EAAGL,EAAKM,MAAON,EAAKnrC,IAAImsC,QACvD,OAARn+C,EAAgB,IAAIkrF,EAAK,EAAG/tC,EAAKrR,IAAKqR,EAAKnrC,IAAIyqC,MAAOU,EAAKI,QAAUJ,GAClGrd,EAAQ+5C,EAAM7nE,KAAG,SAACgC,GAAI,OAAGmpC,EAAK1T,MAAMyO,OAAOlkC,MACtC9a,EAAI,EAAGA,EAAI2gF,EAAMzgF,OAAQF,IAC5B4mC,EAAM5mC,GAAG8G,MAAQ2kC,EAAMgqD,aACzBj1D,EAAGue,cAAckF,EAAK6zC,WAAanX,EAAM3gF,GAAIyrC,EAAM61C,KAAM16C,EAAM5mC,GAAG6mC,OACtE,GAAuB,GAAnBrG,EAAG9C,MAAMx9B,OAAa,IAAK28B,IAAI78B,EAAI,EAAGA,EAAI2gF,EAAMzgF,OAAQF,IAC1DwgC,EAAGue,cAAckF,EAAK6zC,WAAanX,EAAM3gF,GAAIyrC,EAAMgqD,YAAa7uD,EAAM5mC,GAAG6mC,OAC3E4hB,EAASjoB,GAEX,OAAO,GA8BAw7D,CAAwBl1F,GAE1B,SAASvB,EAAOkjD,GACrB,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9B,GAAIkjD,EAAU,CACZ5rB,IAAI4O,EAAQ20C,EAAe76E,EAAMi6B,QAC7BykB,EAAO41C,GAAat0F,GAAQi7B,EAAKj7B,EAAMi7B,GAEvCy7D,EAAqBL,GAAsB,MAAO33C,EAAMxY,GACxDywD,EAAwBN,GAAsB,SAAU33C,EAAMxY,GAK9D0wD,GAH2B,WAATr1F,EAAoBm1F,EACX,QAATn1F,GAAoBo1F,GAEA,EAAI,EAE1CE,EAAoB,UAARt1F,EAAmB,IAAIkrF,EAAK,EAAGmK,EAAmB,EAAGl4C,EAAKnrC,IAAImsC,QACtD,OAARn+C,EAAgB,IAAIkrF,EAAKmK,EAAmB,EAAGl4C,EAAKnrC,IAAIyqC,MAAO,GAAKU,EAEhFo4C,EAAkB,UAARv1F,EAAmBo1F,EAAwBzwD,EAAM61C,KAAO71C,EAAMgqD,YACtD,OAAR3uF,EAAgBm1F,EAAqBxwD,EAAM61C,KAAO71C,EAAMgqD,YAAchqD,EAAM61C,KAE1Fr9B,EAAKnrC,IAAI2qE,YAAY2Y,GAAWv8F,SAAO,SAACy8F,GACtCt/D,IAAMqkD,EAAUib,EAAkBr4C,EAAK6zC,WACjCxW,EAAO9gD,EAAGrD,IAAI6hB,OAAOqiC,GAEvBC,GACF9gD,EAAGue,cAAcsiC,EAASgb,EAAS/a,EAAKz6C,UAI5C4hB,EAASjoB,GAEX,OAAO,GAMD,IAAC+7D,GAAkBT,GAAa,MAAO,CAAEC,oBAAoB,IAI5DS,GAAqBV,GAAa,SAAU,CAAEC,oBAAoB,IAIlEU,GAAmBX,GAAa,OAAQ,CAAEC,oBAAoB,IAyBlE,SAASW,GAAa5a,GAC3B,OAAO,SAASv8E,EAAOkjD,GACrB,IAAKgsC,EAAUlvF,GAAQ,OAAO,EAC9Bs3B,IAAIykD,EA1BR,SAAsBkX,EAAOnjF,GAC3B,GAAIA,EAAM,EAAG,CACXwnB,IAAIoF,EAASu2D,EAAM/wD,WACnB,GAAIxF,EAAQ,OAAOu2D,EAAM19E,IAAMmnB,EAAOgC,SACtC,IAAKpH,IAAI6kD,EAAM8W,EAAMpmF,OAAO,GAAK,EAAGghF,EAASoF,EAAMv2D,SAAUy/C,GAAO,EAAGA,IAAO,CAC5E7kD,IAAI22D,EAAUgF,EAAM15D,MAAM,GAAGsF,MAAMs9C,GACnC,GAAI8R,EAAQjuD,WAAY,OAAO6tD,EAAS,EAAII,EAAQzuD,UAAUd,SAC9DmvD,GAAUI,EAAQvvD,cAEf,CACL,GAAIu0D,EAAMpmF,QAAUomF,EAAMzvF,OAAOw8B,WAAa,EAAG,OAAOizD,EAAM19E,IAAM09E,EAAMjxD,UAAUtD,SAEpF,IADApH,IAAI0T,EAAQioD,EAAM15D,MAAM,GACf4iD,EAAM8W,EAAMpxD,YAAY,GAAI+rD,EAAWqF,EAAMlxD,QAASo6C,EAAMnxC,EAAMhL,WAAYm8C,IAAO,CAC5F7kD,IAAI22D,EAAUjjD,EAAMnM,MAAMs9C,GAC1B,GAAI8R,EAAQjuD,WAAY,OAAO4tD,EAAW,EAC1CA,GAAYK,EAAQvvD,WAWX04D,CAAajI,EAAcnvF,GAAQu8E,GAC9C,GAAY,MAARR,EAAJ,CACA,GAAI74B,EAAU,CACZ5rB,IAAI27D,EAAQjzF,EAAM43B,IAAI3e,QAAQ8iE,GAC9B74B,EAASljD,EAAMi7B,GAAG5C,aAAa,gBAAc4sD,QAAQgO,EAAOxD,EAAgBwD,KAASv4D,kBAEvF,OAAO,IAMJ,SAAS28D,GAAYr3F,EAAOkjD,GAEjC,IADA5rB,IAAIsgB,EAAO53C,EAAM+3B,UAAUyrC,QAClB1gC,EAAI8U,EAAKjW,MAAOmB,EAAI,EAAGA,IAAK,CAEnC,GAAgC,SADrB8U,EAAKre,KAAKuJ,GACZvhC,KAAKo6B,KAAKoyD,UAEjB,OADI7qC,GAAUA,EAASljD,EAAMi7B,GAAG4f,OAAOjD,EAAKlb,OAAOoG,GAAI8U,EAAK7V,MAAMe,IAAIpI,mBAC/D,EAGX,OAAO,E,IsE9eI48D,GACX,SAAY/9D,EAAMg+D,GAChB/9F,KAAK+/B,KAAOA,EACZ//B,KAAK+9F,aAAeA,EACpB/9F,KAAKwuC,IAAM7rC,SAASuW,cAAc,OAClClZ,KAAKwuC,IAAIoX,UAAY,eACrB5lD,KAAKwxC,MAAQxxC,KAAKwuC,IAAIvgC,YAAYtL,SAASuW,cAAc,UACzDlZ,KAAKy5E,SAAWz5E,KAAKwxC,MAAMvjC,YAAYtL,SAASuW,cAAc,aAC9D8kF,GAAcj+D,EAAM//B,KAAKy5E,SAAUz5E,KAAKwxC,MAAOusD,GAC/C/9F,KAAK21C,WAAa31C,KAAKwxC,MAAMvjC,YAAYtL,SAASuW,cAAc,WAe7D,SAAS8kF,GAAcj+D,EAAM05C,EAAUjoC,EAAOusD,EAAcE,EAAaC,GAG9E,IAFApgE,IAAIqgE,EAAa,EAAGC,GAAa,EAC7BlrB,EAAUuG,EAAS5rD,WAAY80D,EAAM5iD,EAAKlS,WACrC5sB,EAAI,EAAGy4E,EAAM,EAAGz4E,EAAI0hF,EAAIn8C,WAAYvlC,IAE3C,IADA,MAA0B0hF,EAAIt9C,MAAMpkC,GAAG6mC,MAAlCurD,EAAA,EAAAA,QAASD,EAAA,EAAAA,SACL9mE,EAAI,EAAGA,EAAI+mE,EAAS/mE,IAAKotD,IAAO,CACvC57C,IAAIugE,EAAWJ,GAAevkB,EAAMwkB,EAAgB9K,GAAYA,EAAS9mE,GACrEgyE,EAAWD,EAAWA,EAAW,KAAO,GAC5CF,GAAcE,GAAYN,EACrBM,IAAUD,GAAa,GACvBlrB,GAGCA,EAAQnlE,MAAMy2C,OAAS85C,IAAUprB,EAAQnlE,MAAMy2C,MAAQ85C,GAC3DprB,EAAUA,EAAQp+B,aAHlB2kC,EAASxrE,YAAYtL,SAASuW,cAAc,QAAQnL,MAAMy2C,MAAQ85C,EAQxE,KAAOprB,GAAS,CACdp1C,IAAIyK,EAAQ2qC,EAAQp+B,YACpBo+B,EAAQrmD,WAAWC,YAAYomD,GAC/BA,EAAU3qC,EAGR61D,GACF5sD,EAAMzjC,MAAMy2C,MAAQ25C,EAAa,KACjC3sD,EAAMzjC,MAAMwwF,SAAW,KAEvB/sD,EAAMzjC,MAAMy2C,MAAQ,GACpBhT,EAAMzjC,MAAMwwF,SAAWJ,EAAa,MA1CxC,aAAEzxE,OAAA,SAAOqT,GACL,OAAIA,EAAKh4B,MAAQ/H,KAAK+/B,KAAKh4B,OAC3B/H,KAAK+/B,KAAOA,EACZi+D,GAAcj+D,EAAM//B,KAAKy5E,SAAUz5E,KAAKwxC,MAAOxxC,KAAK+9F,eAC7C,IAGX,aAAEhxB,eAAA,SAAeyxB,GACb,MAAsB,cAAfA,EAAOz2F,OAAyBy2F,EAAOn5F,QAAUrF,KAAKwxC,OAASxxC,KAAKy5E,SAAS/iC,SAAS8nD,EAAOn5F,UCb5F,IAACjE,GAAM,IAAI,YAAU,uBAE1B,SAASq9F,GAAe,Q,UAAuF,I,mCAAvE,G,oCAAkB,I,4BAAWX,I,4BAiC1E,Y,WAjC2G,GAC9F,IAAI,SAAO,C,IACtB18F,GACAoF,MAAO,CACL0yB,KAAA,SAAK+H,EAAGz6B,GAGN,OAFAxG,KAAKmiC,KAAK8B,MAAMusB,UAAU6wB,EAAe76E,EAAMi6B,QAAQ+Q,MAAM/xC,M,SAC1DsgC,EAAMooB,GAAM,OAAG,IAAIu2C,EAAK3+D,EAAMg+D,EAAc51C,IACxC,IAAIw2C,IAAa,GAAG,IAE7BhyF,MAAA,SAAM80B,EAAIxG,GACR,OAAOA,EAAKtuB,MAAM80B,KAGtBwC,MAAO,CACLyrB,WAAA,SAAWlpD,GAET,OADkBpF,GAAIgjC,SAAS59B,GACZo4F,cAAgB,EAAI,CAACl6C,MAAO,iBAAmB,MAGpEkL,gBAAiB,CACfivC,UAAA,SAAU12C,EAAM3vB,IAqCxB,SAAyB2vB,EAAM3vB,EAAOsmE,EAAaf,EAAcgB,GAC/DjhE,IAAIkhE,EAAc59F,GAAIgjC,SAAS+jB,EAAK3hD,OAEpC,IAAKw4F,EAAYv4C,SAAU,CACzB3oB,IAAIz4B,EAyER,SAAuBA,GACrB,KAAOA,GAA6B,MAAnBA,EAAOovC,UAAuC,MAAnBpvC,EAAOovC,UACjDpvC,EAASA,EAAOmoE,UAAU92B,SAAS,eAAiB,KAAOrxC,EAAOwnB,WACpE,OAAOxnB,EA5EQ45F,CAAczmE,EAAMnzB,QAASk9E,GAAQ,EAClD,GAAIl9E,EAAQ,CACV,MAAoBA,EAAOggD,wBAAtBE,EAAA,EAAAA,KAAMC,EAAA,EAAAA,MACPhtB,EAAM+tB,QAAUhB,GAAQu5C,EAC1Bvc,EAAO2c,GAAS/2C,EAAM3vB,EAAO,QACtBgtB,EAAQhtB,EAAM+tB,SAAWu4C,IAChCvc,EAAO2c,GAAS/2C,EAAM3vB,EAAO,UAGjC,GAAI+pD,GAAQyc,EAAYJ,aAAc,CACpC,IAAKG,IAAiC,IAAVxc,EAAa,CACvCzkD,IAAI27D,EAAQtxC,EAAK3hD,MAAM43B,IAAI3e,QAAQ8iE,GAC/B/wC,EAAQioD,EAAM15D,MAAM,GAAIhmB,EAAM4nE,EAAS59E,IAAIytC,GAAQjM,EAAQk0D,EAAMl0D,OAAO,GAG5E,GAFUxrB,EAAIw5E,SAASkG,EAAM19E,IAAMwpB,GAASk0D,EAAMjxD,UAAUV,MAAMurD,QAAU,GAEjEt5E,EAAIyqC,MAAQ,EACrB,OAIJ26C,GAAah3C,EAAMo6B,KA7DQ6c,CAAgBj3C,EAAM3vB,EAAOsmE,EAAaf,EAAcgB,IACjFM,WAAA,SAAWl3C,IAiEnB,SAA0BA,GACxBrqB,IAAIkhE,EAAc59F,GAAIgjC,SAAS+jB,EAAK3hD,OAChCw4F,EAAYJ,cAAgB,IAAMI,EAAYv4C,UAAU04C,GAAah3C,GAAO,GAnEvDm3C,CAAiBn3C,IACpCo3C,UAAA,SAAUp3C,EAAM3vB,IAqExB,SAAyB2vB,EAAM3vB,EAAOulE,GACpCjgE,IAAIkhE,EAAc59F,GAAIgjC,SAAS+jB,EAAK3hD,OACpC,IAAiC,GAA7Bw4F,EAAYJ,cAAsBI,EAAYv4C,SAAU,OAAO,EAEnE3oB,IAAIykD,EAAOp6B,EAAK3hD,MAAM43B,IAAI6hB,OAAO++C,EAAYJ,cACzCp6C,EAyBN,SAAyB2D,EAAMm6B,EAAS,G,QAAU,Q,aAC5C99B,EAAQ4uC,GAAYA,EAASA,EAASjyF,OAAS,GACnD,GAAIqjD,EAAO,OAAOA,EAClB1mB,IAAI0Q,EAAM2Z,EAAKy7B,SAAStB,GAEpBkd,EADOhxD,EAAIzO,KAAKtS,WAAW+gB,EAAIzG,QACf03D,YAAahiF,EAAQ41E,EACzC,GAAID,EAAU,IAAKt1D,IAAI78B,EAAI,EAAGA,EAAIoyF,EAASpyF,IAASmyF,EAASnyF,KAC3Du+F,GAAYpM,EAASnyF,GACrBwc,KAEF,OAAO+hF,EAAW/hF,EAnCNiiF,CAAgBv3C,EAAM62C,EAAYJ,aAAcrc,EAAKz6C,OAGjE,SAAS6G,EAAOnW,GACd14B,OAAOglD,oBAAoB,UAAWnW,GACtC7uC,OAAOglD,oBAAoB,YAAatB,GACxC1lB,IAAIkhE,EAAc59F,GAAIgjC,SAAS+jB,EAAK3hD,OAChCw4F,EAAYv4C,YA0DpB,SAA2B0B,EAAMo6B,EAAM/9B,GAKrC,IAJA1mB,IAAI27D,EAAQtxC,EAAK3hD,MAAM43B,IAAI3e,QAAQ8iE,GAC/B/wC,EAAQioD,EAAM15D,MAAM,GAAIhmB,EAAM4nE,EAAS59E,IAAIytC,GAAQjM,EAAQk0D,EAAMl0D,OAAO,GACxEm0C,EAAM3/D,EAAIw5E,SAASkG,EAAM19E,IAAMwpB,GAASk0D,EAAMjxD,UAAUV,MAAMurD,QAAU,EACxE5xD,EAAK0mB,EAAK3hD,MAAMi7B,GACXkhD,EAAM,EAAGA,EAAM5oE,EAAImsC,OAAQy8B,IAAO,CACzC7kD,IAAI6hE,EAAWhd,EAAM5oE,EAAIyqC,MAAQk1B,EAEjC,IAAIiJ,GAAO5oE,EAAIA,IAAI4lF,IAAa5lF,EAAIA,IAAI4lF,EAAW5lF,EAAIyqC,OAAvD,CACA1mB,IAAI/hB,EAAMhC,EAAIA,IAAI4lF,GAAY73D,EAAS0J,EAAMyO,OAAOlkC,GAAtB+rB,MAC1Bz0B,EAAyB,GAAjBy0B,EAAMurD,QAAe,EAAI3Z,EAAM3/D,EAAIw5E,SAASx3E,GACxD,IAAI+rB,EAAMsrD,UAAYtrD,EAAMsrD,SAAS//E,IAAUmxC,EAA/C,CACA1mB,IAAIs1D,EAAWtrD,EAAMsrD,SAAWtrD,EAAMsrD,SAASrwF,QAAU68F,GAAO93D,EAAMurD,SACtED,EAAS//E,GAASmxC,EAClB/iB,EAAGue,cAAcza,EAAQxpB,EAAK,KAAMs6E,EAAQvuD,EAAO,WAAYsrD,MAE7D3xD,EAAGma,YAAYuM,EAAKuB,SAASjoB,GAzE7Bo+D,CAAkB13C,EAAM62C,EAAYJ,aAAckB,GAAad,EAAYv4C,SAAUjuB,EAAOulE,IAC5F51C,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAGX,QAAQ1/B,GAAK,CAAC2+F,YAAa,SAG3D,SAASv8C,EAAKhrB,GACZ,IAAKA,EAAMwnE,MAAO,OAAOrxD,EAAOnW,GAChCsF,IAAIkhE,EAAc59F,GAAIgjC,SAAS+jB,EAAK3hD,OAChCy5F,EAAUH,GAAad,EAAYv4C,SAAUjuB,EAAOulE,IAqE5D,SAA4B51C,EAAMo6B,EAAM/9B,EAAOu5C,GAC7CjgE,IAAI27D,EAAQtxC,EAAK3hD,MAAM43B,IAAI3e,QAAQ8iE,GAC/B/wC,EAAQioD,EAAM15D,MAAM,GAAIwF,EAAQk0D,EAAMl0D,OAAO,GAC7Cm0C,EAAMiI,EAAS59E,IAAIytC,GAAO+hD,SAASkG,EAAM19E,IAAMwpB,GAASk0D,EAAMjxD,UAAUV,MAAMurD,QAAU,EACxF7kD,EAAM2Z,EAAKy7B,SAAS6V,EAAMl0D,OAAO,IAAIxF,KACzC,KAAuB,SAAhByO,EAAIiG,UAAqBjG,EAAMA,EAAI3hB,WAC1CmxE,GAAcxsD,EAAOhD,EAAI3gB,WAAY2gB,EAAKuvD,EAAcrkB,EAAKl1B,GA1E3D07C,CAAmB/3C,EAAM62C,EAAYJ,aAAcqB,EAASlC,GAf9D51C,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAGX,QAAQ1/B,GAAK,CAAC2+F,YAAa,CAACl5B,OAAQruC,EAAM+tB,QAAS45C,WAAY37C,MAkB3F1kD,OAAO2hB,iBAAiB,UAAWktB,GACnC7uC,OAAO2hB,iBAAiB,YAAa+hC,GACrChrB,EAAM2kC,iBA/FyBy8B,CAAgBzxC,EAAM3vB,EAAOulE,KAGxD31C,YAAA,SAAY5hD,GACVs3B,IAAIkhE,EAAc59F,GAAIgjC,SAAS59B,GAC/B,GAAIw4F,EAAYJ,cAAgB,EAAG,OAwK3C,SAA2Bp4F,EAAO+7E,GAKhC,IAJAzkD,IAAIsqB,EAAc,GACdqxC,EAAQjzF,EAAM43B,IAAI3e,QAAQ8iE,GAC1B/wC,EAAQioD,EAAM15D,MAAM,GAAIhmB,EAAM4nE,EAAS59E,IAAIytC,GAAQjM,EAAQk0D,EAAMl0D,OAAO,GACxEm0C,EAAM3/D,EAAIw5E,SAASkG,EAAM19E,IAAMwpB,GAASk0D,EAAMjxD,UAAUV,MAAMurD,QACzD1Q,EAAM,EAAGA,EAAM5oE,EAAImsC,OAAQy8B,IAAO,CACzC7kD,IAAIzqB,EAAQqmE,EAAMiJ,EAAM5oE,EAAIyqC,MAAQ,EAIpC,KAAKk1B,GAAO3/D,EAAIyqC,OAASzqC,EAAIA,IAAI1G,IAAU0G,EAAIA,IAAI1G,EAAQ,IAC/C,GAAPsvE,GAAY5oE,EAAIA,IAAI1G,EAAQ,IAAM0G,EAAIA,IAAI1G,EAAQ,EAAI0G,EAAIyqC,QAAS,CACtE1mB,IAAIwkD,EAAUvoE,EAAIA,IAAI1G,GAClB0I,EAAMwpB,EAAQ+8C,EAAU9wC,EAAMyO,OAAOqiC,GAASp9C,SAAW,EACzDsJ,EAAM7rC,SAASuW,cAAc,OACjCs1B,EAAIoX,UAAY,uBAChBwC,EAAYjzC,KAAK,IAAWo4D,OAAOxxD,EAAKyyB,KAG5C,OAAO,IAAclgC,OAAO9H,EAAM43B,IAAKgqB,GA3LSg4C,CAAkB55F,EAAOw4F,EAAYJ,eAGjFpuC,UAAW,MAMjB,IAAMmuC,GACJ,SAAYC,EAAcn4C,GACxBzmD,KAAK4+F,aAAeA,EACpB5+F,KAAKymD,SAAWA,GAqGpB,SAASy4C,GAAS/2C,EAAM3vB,EAAOy6B,GAC7Bn1B,IAAIiG,EAAQokB,EAAK7B,YAAY,CAACf,KAAM/sB,EAAM+tB,QAAS1S,IAAKrb,EAAMguB,UAC9D,IAAKziB,EAAO,OAAQ,EACf,IAAAhoB,EAAA,EAAAA,IACD09E,EAAQhE,EAAWttC,EAAK3hD,MAAM43B,IAAI3e,QAAQ1D,IAC9C,IAAK09E,EAAO,OAAQ,EACpB,GAAY,SAARxmC,EAAiB,OAAOwmC,EAAM19E,IAClC+hB,IAAI/jB,EAAM4nE,EAAS59E,IAAI01F,EAAM15D,MAAM,IAAKwF,EAAQk0D,EAAMl0D,OAAO,GACzDlyB,EAAQ0G,EAAIA,IAAI5G,QAAQsmF,EAAM19E,IAAMwpB,GACxC,OAAOlyB,EAAQ0G,EAAIyqC,OAAS,GAAK,EAAIjf,EAAQxrB,EAAIA,IAAI1G,EAAQ,GAG/D,SAASysF,GAAar5C,EAAUjuB,EAAOulE,GACrCjgE,IAAIiK,EAASvP,EAAM+tB,QAAUE,EAASogB,OACtC,OAAOjnE,KAAKsvB,IAAI6uE,EAAct3C,EAAS05C,WAAap4D,GAGtD,SAASo3D,GAAah3C,EAAM1jD,GAC1B0jD,EAAKuB,SAASvB,EAAK3hD,MAAMi7B,GAAGX,QAAQ1/B,GAAK,CAACi/F,UAAW57F,KA+BvD,SAASm7F,GAAO/mF,GAEd,IADAilB,IAAIj7B,EAAS,GACJ5B,EAAI,EAAGA,EAAI4X,EAAG5X,IAAK4B,EAAOsS,KAAK,GACxC,OAAOtS,E9ChLF,SAASy9F,GAAa,Q,UAAsC,I,gCACjE,Y,WADuD,GAChD,IAAI,SAAO,CAChBl/F,IAAKm/F,EAKL/5F,MAAO,CACL0yB,KAAA,WAAS,OAAO,MAChBvsB,MAAA,SAAM80B,EAAIoK,GACR/N,IAAIhzB,EAAM22B,EAAGV,QAAQw/D,GACrB,GAAW,MAAPz1F,EAAa,OAAe,GAARA,EAAY,KAAOA,EAC3C,GAAW,MAAP+gC,IAAgBpK,EAAGma,WAAY,OAAO/P,EAC1C,MAAqBpK,EAAG7C,QAAQib,UAAUhO,GAArCyN,EAAA,EAAAA,QAASv9B,EAAA,EAAAA,IACd,OAAOu9B,EAAU,KAAOv9B,IAI5BkoB,MAAO,CACLmkB,YAAa4vC,EAEbpoC,gBAAiB,CACf2vC,UAAW3F,GAGb4G,uBAAA,SAAuBr4C,GACrB,GAA4C,MAAxCo4C,EAAgBn8D,SAAS+jB,EAAK3hD,OAAgB,OAAO2hD,EAAK3hD,MAAM+3B,W,kBAGtEo7D,E,cAEAz5B,E,YAEA9P,GAGFptB,kBAAA,SAAkB/B,EAAGgC,EAAUz8B,GAC7B,O0CoNC,SAA4BA,EAAOi7B,EAAIg/D,GAC5C3iE,IAA4DvmB,EAAWu+E,EAAnE/rB,GAAOtoC,GAAMj7B,GAAO+3B,UAAWH,GAAOqD,GAAMj7B,GAAO43B,IACvD,GAAI2rC,aAAe,kBAAkB+rB,EAAO/rB,EAAIhqC,KAAKh4B,KAAKo6B,KAAKoyD,YAC7D,GAAY,QAARuB,GAA0B,eAARA,EACpBv+E,EAAY+sE,EAAch2E,OAAO8vB,EAAK2rC,EAAIx3C,WACrC,GAAY,OAARujE,EAAe,CACxBh4D,IAAI27D,EAAQr7D,EAAI3e,QAAQsqD,EAAIx3C,KAAO,GACnChb,EAAY+sE,EAAcsS,aAAa6C,EAAOA,QACzC,IAAKgH,EAAyB,CACnC3iE,IAAI/jB,EAAM4nE,EAAS59E,IAAIgmE,EAAIhqC,MAAOwF,EAAQwkC,EAAIx3C,KAAO,EACjDoqE,EAAWp3D,EAAQxrB,EAAIA,IAAIA,EAAIyqC,MAAQzqC,EAAImsC,OAAS,GACxD3uC,EAAY+sE,EAAch2E,OAAO8vB,EAAKmH,EAAQ,EAAGo3D,SAE1C5yB,aAAe,iBA9C5B,SAAiC,G,QAAQ,M,QACvC,GAAIhsC,EAAMhiB,KAAOiiB,EAAIjiB,KAAOgiB,EAAMhiB,IAAMgiB,EAAMhiB,IAAM,EAAG,OAAO,EAE9D,IADA+hB,IAAI4iE,EAAY3iE,EAAMhiB,IAAK4kF,EAAW3iE,EAAIjiB,IAAKosB,EAAQpK,EAAMoK,MACtDA,GAAS,KACVpK,EAAMwK,MAAMJ,EAAQ,GAAKpK,EAAMuH,IAAI6C,IADtBA,IAASu4D,KAE5B,IAAK5iE,IAAIwL,EAAItL,EAAImK,MAAOmB,GAAK,KACvBtL,EAAIkF,OAAOoG,EAAI,GAAKtL,EAAIuH,MAAM+D,IADJA,IAAKq3D,KAErC,OAAOD,GAAaC,GAAY,YAAY7uF,KAAKisB,EAAMgC,KAAKoI,GAAOpgC,KAAKo6B,KAAKoyD,WAuClCqM,CAAwB72B,GACjExyD,EAAY,gBAAcjJ,OAAO8vB,EAAK2rC,EAAIx3C,MACjCw3C,aAAe,iBAtC5B,SAAoC,GAIlC,I,IAHI82B,EACAC,E,IAFsC,M,QAIjC7/F,EAAI88B,EAAMoK,MAAOlnC,EAAI,EAAGA,IAAK,CACpC68B,IAAIiC,EAAOhC,EAAMgC,KAAK9+B,GACtB,GAAiC,SAA7B8+B,EAAKh4B,KAAKo6B,KAAKoyD,WAAqD,gBAA7Bx0D,EAAKh4B,KAAKo6B,KAAKoyD,UAA6B,CACrFsM,EAAuB9gE,EACvB,OAIJ,IAAKjC,IAAI78B,EAAI+8B,EAAImK,MAAOlnC,EAAI,EAAGA,IAAK,CAClC68B,IAAIiC,EAAO/B,EAAI+B,KAAK9+B,GACpB,GAAiC,SAA7B8+B,EAAKh4B,KAAKo6B,KAAKoyD,WAAqD,gBAA7Bx0D,EAAKh4B,KAAKo6B,KAAKoyD,UAA6B,CACrFuM,EAAqB/gE,EACrB,OAIJ,OAAO8gE,IAAyBC,GAA2C,IAArB9iE,EAAIkK,aAkBf64D,CAA2Bh3B,KACpExyD,EAAY,gBAAcjJ,OAAO8vB,EAAK2rC,EAAIhsC,MAAMwH,QAASwkC,EAAIhsC,MAAMuH,QAIrE,OAFI/tB,IACDkqB,IAAOA,EAAKj7B,EAAMi7B,KAAK5C,aAAatnB,GAChCkqB,E1CxOIu/D,CAAmBx6F,EAAO8zF,GAAU9zF,EAAOy8B,GAAWw9D,M8CXnE,aAAE9zF,MAAA,SAAM80B,GACJ3D,IAAIt3B,EAAQxG,KAAMihG,EAASx/D,EAAGV,QAAQ3/B,IACtC,GAAI6/F,GAA8B,MAApBA,EAAOZ,UACnB,OAAO,IAAI1B,GAAYsC,EAAOZ,UAAW,MAC3C,GAAIY,QAAiCl7F,IAAvBk7F,EAAOlB,YACnB,OAAO,IAAIpB,GAAYn4F,EAAMo4F,aAAcqC,EAAOlB,aACpD,GAAIv5F,EAAMo4F,cAAgB,GAAKn9D,EAAGma,WAAY,CAC5C9d,IAAIouB,EAASzqB,EAAG7C,QAAQ7kB,IAAIvT,EAAMo4F,cAAe,GAC5C5I,EAAav0D,EAAGrD,IAAI3e,QAAQysC,MAAUA,EAAS,MACtD,EAAU,IAAIyyC,GAAYzyC,EAAQ1lD,EAAMigD,UAExC,OAAOjgD,I,8BC3DX9H,EAAOC,QAAUI,EAAQ,M,6BCEzBL,EAAOC,QAAUI,EAAQ,M,6BCFzBL,EAAOC,QAAQ2e,OAASve,EAAQ,KAChCL,EAAOC,QAAQuiG,OAASniG,EAAQ,KAChCL,EAAOC,QAAQunB,OAASnnB,EAAQ,KAChCL,EAAOC,QAAQ6f,MAASzf,EAAQ,M,cCNhCL,EAAOC,QAAQ,oI,cCAfD,EAAOC,QAAQ,sB,cCAfD,EAAOC,QAAQ,4D,6BCIf,IAUIwiG,EAAc,kIAEdC,EAAc,mCAMdC,EAAc,IAAIjvF,OAAO,OAAS+uF,EAAW,IAAMC,EAA1B,qHAEzBE,EAAyB,IAAIlvF,OAAO,OAAS+uF,EAAW,IAAMC,EAAY,KAE9E1iG,EAAOC,QAAQ0iG,YAAcA,EAC7B3iG,EAAOC,QAAQ2iG,uBAAyBA,G,6BCpBxC5iG,EAAOC,QAAQ4iG,SAAW,SAAuB/6F,EAAO+iD,GACtD,IAAItoD,EAAGugG,EAAgB/sF,EAAKqc,EACxByU,EAAQ/+B,EAAMuV,IACdpH,EAASnO,EAAM0H,IAAIxK,WAAW6hC,GAElC,GAAIgkB,EAAU,OAAO,EAErB,GAAe,MAAX50C,EAA0B,OAAO,EAMrC,GAHAF,GADA+sF,EAAUh7F,EAAMi7F,WAAWj7F,EAAMuV,KAAK,IACxB5a,OACd2vB,EAAKltB,OAAOo4B,aAAarnB,GAErBF,EAAM,EAAK,OAAO,EAQtB,IANIA,EAAM,IACQjO,EAAM2O,KAAK,OAAQ,GAAI,GACjC1R,QAAUqtB,EAChBrc,KAGGxT,EAAI,EAAGA,EAAIwT,EAAKxT,GAAK,EACRuF,EAAM2O,KAAK,OAAQ,GAAI,GACjC1R,QAAUqtB,EAAKA,EAErBtqB,EAAMk7F,WAAWvsF,KAAK,CACpBR,OAAQA,EACRgtF,KAAQ1gG,EACR82B,MAAQvxB,EAAM+mC,OAAOpsC,OAAS,EAC9Bm2C,MAAQ9wC,EAAM8wC,MACdhS,KAAS,EACTl3B,KAAQozF,EAAQI,SAChBj0F,MAAQ6zF,EAAQK,YAMpB,OAFAr7F,EAAMuV,KAAOylF,EAAQrgG,QAEd,GAMTzC,EAAOC,QAAQmjG,YAAc,SAAuBt7F,GAClD,IAAIvF,EAAGqrB,EACHy1E,EACAC,EACAjqE,EACAkqE,EAAc,GACdP,EAAal7F,EAAMk7F,WACnBxyE,EAAM1oB,EAAMk7F,WAAWvgG,OAE3B,IAAKF,EAAI,EAAGA,EAAIiuB,EAAKjuB,IAGO,OAF1B8gG,EAAaL,EAAWzgG,IAET0T,SAIS,IAApBotF,EAAWz8D,MAIf08D,EAAWN,EAAWK,EAAWz8D,MAEjCvN,EAAgBvxB,EAAM+mC,OAAOw0D,EAAWhqE,QAClChwB,KAAU,SAChBgwB,EAAMpc,IAAU,IAChBoc,EAAMu1D,QAAU,EAChBv1D,EAAMw1D,OAAU,KAChBx1D,EAAMt0B,QAAU,IAEhBs0B,EAAgBvxB,EAAM+mC,OAAOy0D,EAASjqE,QAChChwB,KAAU,UAChBgwB,EAAMpc,IAAU,IAChBoc,EAAMu1D,SAAW,EACjBv1D,EAAMw1D,OAAU,KAChBx1D,EAAMt0B,QAAU,GAE8B,SAA1C+C,EAAM+mC,OAAOy0D,EAASjqE,MAAQ,GAAGhwB,MACY,MAA7CvB,EAAM+mC,OAAOy0D,EAASjqE,MAAQ,GAAGt0B,SAEnCw+F,EAAY9sF,KAAK6sF,EAASjqE,MAAQ,IAUtC,KAAOkqE,EAAY9gG,QAAQ,CAIzB,IAFAmrB,GADArrB,EAAIghG,EAAYz0D,OACR,EAEDlhB,EAAI9lB,EAAM+mC,OAAOpsC,QAAmC,YAAzBqF,EAAM+mC,OAAOjhB,GAAGvkB,MAChDukB,IAKErrB,MAFJqrB,IAGEyL,EAAQvxB,EAAM+mC,OAAOjhB,GACrB9lB,EAAM+mC,OAAOjhB,GAAK9lB,EAAM+mC,OAAOtsC,GAC/BuF,EAAM+mC,OAAOtsC,GAAK82B,M,6BC1GxBr5B,EAAOC,QAAQ4iG,SAAW,SAAkB/6F,EAAO+iD,GACjD,IAAItoD,EAAGugG,EACHj8D,EAAQ/+B,EAAMuV,IACdpH,EAASnO,EAAM0H,IAAIxK,WAAW6hC,GAElC,GAAIgkB,EAAU,OAAO,EAErB,GAAe,KAAX50C,GAAsC,KAAXA,EAA2B,OAAO,EAIjE,IAFA6sF,EAAUh7F,EAAMi7F,WAAWj7F,EAAMuV,IAAgB,KAAXpH,GAEjC1T,EAAI,EAAGA,EAAIugG,EAAQrgG,OAAQF,IACduF,EAAM2O,KAAK,OAAQ,GAAI,GACjC1R,QAAUG,OAAOo4B,aAAarnB,GAEpCnO,EAAMk7F,WAAWvsF,KAAK,CAGpBR,OAAQA,EAIRxT,OAAQqgG,EAAQrgG,OAShBwgG,KAAQ1gG,EAIR82B,MAAQvxB,EAAM+mC,OAAOpsC,OAAS,EAI9Bm2C,MAAQ9wC,EAAM8wC,MAKdhS,KAAS,EAKTl3B,KAAQozF,EAAQI,SAChBj0F,MAAQ6zF,EAAQK,YAMpB,OAFAr7F,EAAMuV,KAAOylF,EAAQrgG,QAEd,GAMTzC,EAAOC,QAAQmjG,YAAc,SAAkBt7F,GAC7C,IAAIvF,EACA8gG,EACAC,EACAjqE,EACAjH,EACAoxE,EACAR,EAAal7F,EAAMk7F,WAGvB,IAAKzgG,EAFKuF,EAAMk7F,WAAWvgG,OAEZ,EAAGF,GAAK,EAAGA,IAGE,MAF1B8gG,EAAaL,EAAWzgG,IAET0T,QAAgD,KAAtBotF,EAAWptF,SAK5B,IAApBotF,EAAWz8D,MAIf08D,EAAWN,EAAWK,EAAWz8D,KAOjC48D,EAAWjhG,EAAI,GACJygG,EAAWzgG,EAAI,GAAGqkC,MAAQy8D,EAAWz8D,IAAM,GAC3Co8D,EAAWzgG,EAAI,GAAG82B,QAAUgqE,EAAWhqE,MAAQ,GAC/C2pE,EAAWK,EAAWz8D,IAAM,GAAGvN,QAAUiqE,EAASjqE,MAAQ,GAC1D2pE,EAAWzgG,EAAI,GAAG0T,SAAWotF,EAAWptF,OAEnDmc,EAAKltB,OAAOo4B,aAAa+lE,EAAWptF,SAEpCojB,EAAgBvxB,EAAM+mC,OAAOw0D,EAAWhqE,QAClChwB,KAAUm6F,EAAW,cAAgB,UAC3CnqE,EAAMpc,IAAUumF,EAAW,SAAW,KACtCnqE,EAAMu1D,QAAU,EAChBv1D,EAAMw1D,OAAU2U,EAAWpxE,EAAKA,EAAKA,EACrCiH,EAAMt0B,QAAU,IAEhBs0B,EAAgBvxB,EAAM+mC,OAAOy0D,EAASjqE,QAChChwB,KAAUm6F,EAAW,eAAiB,WAC5CnqE,EAAMpc,IAAUumF,EAAW,SAAW,KACtCnqE,EAAMu1D,SAAW,EACjBv1D,EAAMw1D,OAAU2U,EAAWpxE,EAAKA,EAAKA,EACrCiH,EAAMt0B,QAAU,GAEZy+F,IACF17F,EAAM+mC,OAAOm0D,EAAWzgG,EAAI,GAAG82B,OAAOt0B,QAAU,GAChD+C,EAAM+mC,OAAOm0D,EAAWK,EAAWz8D,IAAM,GAAGvN,OAAOt0B,QAAU,GAC7DxC,Q,eC3HN,YACAvC,EAAOC,QAAUwjG,I,2PCCjB,IAAIC,EAAOrjG,EAAQ,KACfsjG,EAAQtjG,EAAQ,KAEpBJ,EAAQ2jG,UAAYA,EACpB3jG,EAAQ68D,cA0DR,SAAuB/2D,EAAOU,GAC5B,IAKItC,EACA0/F,EACAj8D,EACA7mC,EARA+iG,EAAWr9F,GAAW,GACtBs9F,EAASD,EAASC,QAAUL,EAAKM,gBACjC5iC,EAAS0iC,EAAS1iC,OAClB3+D,EAASshG,EAAOthG,OAChBkS,GAAS,EAMTysD,UACFA,EAxDgB,SA2DlB,GAAqB,iBAAVr7D,EACT,MAAM49F,EAAM,wCAAyC59F,GAGvD89F,EAAa,CAACI,UAAW,EAAGC,SAAU,KAAMn+F,MAAO,IACnD5B,EAAS,CAAC8/F,UAAW,EAAGC,SAAU,KAAMn+F,MAAO,IAE/C,OAAS4O,EAAQlS,GACf1B,EAAOgjG,EAAOpvF,GAET+uF,EAAKS,YAAYpjG,MAItB6mC,EAAUg8D,EAAU7iG,EAAMgF,EAAOU,IACzBy9F,SAAWnjG,EAEf6mC,EAAQq8D,UAAYJ,EAAWI,YACjCJ,EAAaj8D,GAGXA,EAAQq8D,UAAY9/F,EAAO8/F,YAC7BJ,EAAa1/F,EACbA,EAASyjC,IAITi8D,EAAWK,WACb//F,EAAO0/F,WAAaA,GAGtB,OAAO1/F,GAvGTlE,EAAQm9D,iBA2GR,SAA0Br8D,EAAMqjG,GAC9BV,EAAKtmC,iBAAiBr8D,EAAMqjG,IA3G9BnkG,EAAQ+jG,cA+GR,WACE,OAAON,EAAKM,iBA/Gd/jG,EAAQokG,cAmHR,SAAuBtjG,EAAMujG,GAC3B,IACI5hG,EADA2Y,EAAMta,EAGNujG,KACFjpF,EAAM,IACFta,GAAQujG,GAGd,IAAK5hG,KAAO2Y,EACVqoF,EAAKa,gBAAgBlpF,EAAI3Y,GAAM,CAAC8hG,aAAc9hG,KA3HlDqpD,EAAQpqD,UAAU8iG,QA2JlB,SAAc1+F,GACZ,IACI6hC,EACA88D,EAFArtE,EAAQ/1B,KAAK+1B,MAIjB,GAAc,KAAVtxB,EAAc,OAElB6hC,EAAUvQ,EAAMA,EAAM50B,OAAS,IAC/BiiG,EAAO98D,EAAQg1B,SAASh1B,EAAQg1B,SAASn6D,OAAS,KAExB,SAAdiiG,EAAKr7F,KACfq7F,EAAK3+F,OAASA,EAEd6hC,EAAQg1B,SAASnmD,KAAK,CAACpN,KAAM,OAAQtD,MAAOA,KAvKhDgmD,EAAQpqD,UAAUgjG,WAoIlB,SAAoB5+F,EAAOhF,GACzBO,KAAKsjG,SAAS7jG,GACdO,KAAKmjG,QAAQ1+F,GACbzE,KAAKujG,aAtIP94C,EAAQpqD,UAAUmjG,eAyIlB,SAAwBr9E,EAAO1mB,GAC7B,IAAIs2B,EAAQ/1B,KAAK+1B,MACbuQ,EAAUvQ,EAAMA,EAAM50B,OAAS,GAC/BgvB,EAAUhK,EAAMs9E,SAASnoC,SACzBv7B,EAAOtgC,EACP,CACEsI,KAAM,UACN2wC,QAAS,OACT2iB,WAAY,CAACzV,UAAW,CAACnmD,IACzB67D,SAAUnrC,GAEZA,EAEJmW,EAAQg1B,SAAWh1B,EAAQg1B,SAASzwD,OAAOk1B,IArJ7C0qB,EAAQpqD,UAAUijG,SAyKlB,SAAc7jG,GACZ,IAAIs2B,EAAQ/1B,KAAK+1B,MACb6vB,EAAY5lD,KAAKmF,QAAQu+F,YAAcjkG,EACvC6mC,EAAUvQ,EAAMA,EAAM50B,OAAS,GAC/BkkC,EAAQ,CACVt9B,KAAM,UACN2wC,QAAS,OACT2iB,WAAY,CAACzV,UAAW,CAACA,IACzB0V,SAAU,IAGZh1B,EAAQg1B,SAASnmD,KAAKkwB,GACtBtP,EAAM5gB,KAAKkwB,IApLbolB,EAAQpqD,UAAUkjG,UAuLlB,WACEvjG,KAAK+1B,MAAMyX,OAvLbid,EAAQpqD,UAAUsjG,cAAgB5uF,EAClC01C,EAAQpqD,UAAUujG,SAAW7uF,EAC7B01C,EAAQpqD,UAAUwjG,OAwLlB,WACE,MAAO,IApLT,SAASvB,EAAU7iG,EAAMgF,EAAOU,GAC9B,IAGItC,EAHAqgC,EAASk/D,EAAK0B,UAAU,IAExBhkC,GADW36D,GAAW,IACJ26D,OAGtB,GAAoB,iBAATrgE,EACT,MAAM4iG,EAAM,uCAAwC5iG,GAGtD,IAAK2iG,EAAKS,YAAYpjG,GACpB,MAAM4iG,EAAM,2CAA4C5iG,GAG1D,GAAqB,iBAAVgF,EACT,MAAM49F,EAAM,wCAAyC59F,GAevD,GAZIq7D,UACFA,EAtBgB,SAyBlBsiC,EAAK0B,UAAU,CAACC,UAAWt5C,EAASi5C,YAAa5jC,IAEjDj9D,EAASu/F,EAAKE,UAAU7iG,EAAMgF,GAAO,GAErC29F,EAAK0B,UAAU5gE,GAAU,IAIrBrgC,EAAOmhG,YACT,MAAMnhG,EAAOmhG,YAGf,MAAO,CACLrB,UAAW9/F,EAAO8/F,UAClBC,SAAU//F,EAAO+/F,SACjBn+F,MAAO5B,EAAOohG,QAAQR,SAASnoC,UA8EnC,SAAS7Q,EAAQtlD,GACfnF,KAAKmF,QAAUA,EACfnF,KAAKyjG,SAAW,CAACnoC,SAAU,IAC3Bt7D,KAAK+1B,MAAQ,CAAC/1B,KAAKyjG,UAiErB,SAAS1uF,O,moFC5MT,SAASmvF,EAAWnjG,GAClBX,OAAO+jG,OAAOpjG,GAEd,IAAIqjG,EAA+B,mBAARrjG,EAc3B,OAZAX,OAAO4wB,oBAAoBjwB,GAAKD,SAAQ,SAAS+hB,IAC3CziB,OAAOiB,eAAeb,KAAKO,EAAK8hB,IACnB,OAAd9hB,EAAI8hB,IACkB,WAArB,EAAO9hB,EAAI8hB,KAA2C,mBAAd9hB,EAAI8hB,IAG5CuhF,IAAyB,WAATvhF,GAA8B,WAATA,GAA8B,cAATA,IAC1DziB,OAAOikG,SAAStjG,EAAI8hB,KACtBqhF,EAAWnjG,EAAI8hB,OAIZ9hB,E,IAGHujG,E,WAIJ,WAAY3nF,GAAM,eAEE5W,IAAd4W,EAAKrF,OAAoBqF,EAAKrF,KAAO,IAEzCtX,KAAKsX,KAAOqF,EAAKrF,K,gDAIjBtX,KAAKwiC,QAAS,M,KAQlB,SAAS+hE,EAAW9/F,GAClB,OAAOA,EACJlB,QAAQ,KAAM,SACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,UACdA,QAAQ,KAAM,UAWnB,SAASihG,EAAQC,GAEf,IAAI5hG,EAAS,GAEb,IAAK,IAAMzB,KAAOqjG,EAChB5hG,EAAOzB,GAAOqjG,EAASrjG,GALY,2BAATsjG,EAAS,iCAATA,EAAS,kBAYrC,OALAA,EAAQ5jG,SAAQ,SAASC,GACvB,IAAK,IAAMK,KAAOL,EAChB8B,EAAOzB,GAAOL,EAAIK,MAGtB,EAeF,SAASua,EAAIokB,GACX,OAAOA,EAAK0U,SAAS98B,cAgIvB,IAAI0F,EAAqBjd,OAAO+jG,OAAO,CACrCn9E,UAAW,KACXu9E,WAAYA,EACZC,QAASA,EACTG,WA9HF,SAAoB5kE,GAElB,IAAIl9B,EAAS,GA0Bb,OAzBA,SAAU+hG,EAAY7kE,EAAMgI,GAC1B,IAAK,IAAI1C,EAAQtF,EAAKlS,WAAYwX,EAAOA,EAAQA,EAAMyP,YAC9B,IAAnBzP,EAAMuO,SACR7L,GAAU1C,EAAMiP,UAAUnzC,OACE,IAAnBkkC,EAAMuO,WACf/wC,EAAOsS,KAAK,CACVqjB,MAAO,QACPuP,OAAQA,EACRhI,KAAMsF,IAER0C,EAAS68D,EAAYv/D,EAAO0C,GAIvBpsB,EAAI0pB,GAAOxyB,MAAM,oBACpBhQ,EAAOsS,KAAK,CACVqjB,MAAO,OACPuP,OAAQA,EACRhI,KAAMsF,KAKd,OAAO0C,EAvBT,CAwBGhI,EAAM,GACFl9B,GAmGPgiG,aA3FF,SAAsBJ,EAAUK,EAAargG,GAC3C,IAAIsgG,EAAY,EACZliG,EAAS,GACTmiG,EAAY,GAEhB,SAASC,IACP,OAAKR,EAAStjG,QAAW2jG,EAAY3jG,OAGjCsjG,EAAS,GAAG18D,SAAW+8D,EAAY,GAAG/8D,OAChC08D,EAAS,GAAG18D,OAAS+8D,EAAY,GAAG/8D,OAAU08D,EAAWK,EAkBnC,UAAzBA,EAAY,GAAGtsE,MAAoBisE,EAAWK,EArB5CL,EAAStjG,OAASsjG,EAAWK,EA2BxC,SAAS12F,EAAK2xB,GAMZl9B,GAAU,IAAM8Y,EAAIokB,GAAQ,GAAGhmB,IAAIvZ,KAAKu/B,EAAK2vB,YAJ7C,SAAyBw1C,GACvB,MAAO,IAAMA,EAAKzwD,SAAW,KAAO8vD,EAAWW,EAAKzgG,OAAS,OAGWmC,KAAK,IAAM,IAMvF,SAAS+G,EAAMoyB,GACbl9B,GAAU,KAAO8Y,EAAIokB,GAAQ,IAM/B,SAAS72B,EAAOsvB,IACG,UAAhBA,EAAMA,MAAoBpqB,EAAOT,GAAO6qB,EAAMuH,MAGjD,KAAO0kE,EAAStjG,QAAU2jG,EAAY3jG,QAAQ,CAC5C,IAAIopC,EAAS06D,IAGb,GAFApiG,GAAU0hG,EAAW9/F,EAAMouF,UAAUkS,EAAWx6D,EAAO,GAAGxC,SAC1Dg9D,EAAYx6D,EAAO,GAAGxC,OAClBwC,IAAWk6D,EAAU,CAOvBO,EAAU93D,UAAUpsC,QAAQ6M,GAC5B,GACEzE,EAAOqhC,EAAOvG,OAAO,EAAG,GAAG,IAC3BuG,EAAS06D,UACF16D,IAAWk6D,GAAYl6D,EAAOppC,QAAUopC,EAAO,GAAGxC,SAAWg9D,GACtEC,EAAU93D,UAAUpsC,QAAQsN,OAEJ,UAApBm8B,EAAO,GAAG/R,MACZwsE,EAAU7vF,KAAKo1B,EAAO,GAAGxK,MAEzBilE,EAAUx3D,MAEZtkC,EAAOqhC,EAAOvG,OAAO,EAAG,GAAG,IAG/B,OAAOnhC,EAAS0hG,EAAW9/F,EAAMqyB,OAAOiuE,OA6BpCI,EAAoB,SAACplE,GACzB,QAASA,EAAKjpB,MAIVsuF,E,WAOJ,WAAYC,EAAWlgG,GAAS,UAC9BnF,KAAK8B,OAAS,GACd9B,KAAK0jG,YAAcv+F,EAAQu+F,YAC3B2B,EAAUC,KAAKtlG,M,0CAOTugC,GACNvgC,KAAK8B,QAAUyiG,EAAWhkE,K,+BAOnBR,GACP,GAAKolE,EAAkBplE,GAAvB,CAEA,IAAI6lB,EAAY7lB,EAAKjpB,KAChBipB,EAAKwlE,cACR3/C,EAAY,GAAH,OAAM5lD,KAAK0jG,aAAX,OAAyB99C,IAEpC5lD,KAAKy8E,KAAK72B,M,gCAOF7lB,GACHolE,EAAkBplE,KAEvB//B,KAAK8B,QArDU,a,8BA4Df,OAAO9B,KAAK8B,S,2BAST8jD,GACH5lD,KAAK8B,QAAL,uBAA+B8jD,EAA/B,U,KAmHE4/C,E,gQAIJ,WAAYrgG,GAAS,wBACnB,gBACKA,QAAUA,EAFI,E,6CASVo7B,EAAMzpB,GACF,KAATypB,IAEJvgC,KAAKsjG,SAASxsF,GACd9W,KAAKmjG,QAAQ5iE,GACbvgC,KAAKujG,e,8BAMChjE,GACO,KAATA,GAEJvgC,KAAKmK,IAAIo2B,K,qCAOI0jE,EAASxkG,GAEtB,IAAMsgC,EAAOkkE,EAAQj8B,KACrBjoC,EAAKjpB,KAAOrX,EACZsgC,EAAKwlE,aAAc,EACnBvlG,KAAKmK,IAAI41B,K,+BAKT,OADiB,IAAIqlE,EAAaplG,KAAMA,KAAKmF,SAC7BV,U,iCAIhB,OAAO,M,cA1JT,aAAc,UAEZzE,KAAKyjG,SAAW,CAAEnoC,SAAU,IAC5Bt7D,KAAK+1B,MAAQ,CAAC/1B,KAAKyjG,U,sCAUjB1jE,GACF//B,KAAK6zC,IAAIynB,SAASnmD,KAAK4qB,K,+BAIhBjpB,GAEP,IAAMipB,EAAO,CAAEjpB,OAAMwkD,SAAU,IAC/Bt7D,KAAKmK,IAAI41B,GACT//B,KAAK+1B,MAAM5gB,KAAK4qB,K,kCAIhB,GAAI//B,KAAK+1B,MAAM50B,OAAS,EACtB,OAAOnB,KAAK+1B,MAAMyX,Q,sCAOpB,KAAOxtC,KAAKujG,iB,+BAIZ,OAAO3lF,KAAKC,UAAU7d,KAAKyjG,SAAU,KAAM,K,2BAOxCgC,GAEH,OAAOzlG,KAAKwB,YAAYkkG,MAAMD,EAASzlG,KAAKyjG,Y,0BAxC5C,OAAOzjG,KAAK+1B,MAAM/1B,KAAK+1B,MAAM50B,OAAS,K,2BAG3B,OAAOnB,KAAKyjG,Y,6BA8CZgC,EAAS1lE,GAAM,WAQ1B,MAPoB,iBAATA,EACT0lE,EAAQtC,QAAQpjE,GACPA,EAAKu7B,WACdmqC,EAAQnC,SAASvjE,GACjBA,EAAKu7B,SAASx6D,SAAQ,SAACukC,GAAD,OAAW,EAAKqgE,MAAMD,EAASpgE,MACrDogE,EAAQlC,UAAUxjE,IAEb0lE,I,gCAMQ1lE,GACK,iBAATA,GACNA,EAAKu7B,WAENv7B,EAAKu7B,SAASphD,OAAM,SAAA8C,GAAE,MAAkB,iBAAPA,KAGnC+iB,EAAKu7B,SAAW,CAACv7B,EAAKu7B,SAAS10D,KAAK,KAEpCm5B,EAAKu7B,SAASx6D,SAAQ,SAACukC,GACrBsgE,EAAUC,UAAUvgE,W,MA0F5B,SAASjgC,EAAO0N,GACd,OAAKA,EACa,iBAAPA,EAAwBA,EAE5BA,EAAG1N,OAHM,KAUlB,SAASyF,IAAgB,2BAANoK,EAAM,yBAANA,EAAM,gBACvB,IAAM2yB,EAAS3yB,EAAK8E,KAAI,SAACo5C,GAAD,OAAO/tD,EAAO+tD,MAAIvsD,KAAK,IAC/C,OAAOghC,EA0ET,IAGMi+D,EAAc,yEA6BdC,EAAmB,CACvBC,MAAO,eAAgBpD,UAAW,GAE9BqD,EAAmB,CACvBpgD,UAAW,SACXmgD,MAAO,IACPzgE,IAAK,IACL2gE,QAAS,MACTvvD,SAAU,CAACovD,IAEPI,EAAoB,CACxBtgD,UAAW,SACXmgD,MAAO,IACPzgE,IAAK,IACL2gE,QAAS,MACTvvD,SAAU,CAACovD,IAEPK,EAAqB,CACzBJ,MAAO,8IAUHK,EAAU,SAASL,EAAOzgE,GAAuB,IAAlB+gE,EAAkB,uDAAJ,GAC7C1pF,EAAO6nF,EACT,CACE5+C,UAAW,UACXmgD,QACAzgE,MACAoR,SAAU,IAEZ2vD,GAQF,OANA1pF,EAAK+5B,SAASvhC,KAAKgxF,GACnBxpF,EAAK+5B,SAASvhC,KAAK,CACjBywC,UAAW,SACXmgD,MAAO,6CACPpD,UAAW,IAENhmF,GAEH2pF,EAAsBF,EAAQ,KAAM,KACpCG,EAAuBH,EAAQ,OAAQ,QACvCI,EAAoBJ,EAAQ,IAAK,KACjCK,EAAc,CAClB7gD,UAAW,SACXmgD,MAjFgB,oBAkFhBpD,UAAW,GAEP+D,EAAgB,CACpB9gD,UAAW,SACXmgD,MAAOF,EACPlD,UAAW,GAEPgE,EAAqB,CACzB/gD,UAAW,SACXmgD,MAzFuB,eA0FvBpD,UAAW,GAEPiE,EAAkB,CACtBhhD,UAAW,SACXmgD,MAAOc,mHASPlE,UAAW,GAEPmE,EAAc,CAOlBf,MAAO,kBACPrvD,SAAU,CAAC,CACTkP,UAAW,SACXmgD,MAAO,KACPzgE,IAAK,aACL2gE,QAAS,KACTvvD,SAAU,CACRovD,EACA,CACEC,MAAO,KACPzgE,IAAK,KACLq9D,UAAW,EACXjsD,SAAU,CAACovD,QAKbiB,EAAa,CACjBnhD,UAAW,QACXmgD,MAvIe,eAwIfpD,UAAW,GAEPqE,EAAwB,CAC5BphD,UAAW,QACXmgD,MA3I0B,gBA4I1BpD,UAAW,GAEPsE,EAAe,CAEnBlB,MAAO,uBACPpD,UAAW,GAoBTuE,EAAqB9mG,OAAO+jG,OAAO,CACrCn9E,UAAW,KACXmgF,SAxKe,eAyKfC,oBAxK0B,gBAyK1BP,UAxKgB,oBAyKhBhB,YAAaA,EACbwB,iBAxKuB,eAyKvBC,eAxKqB,+IAyKrBC,QApKc,WAAe,IAAdtgB,EAAc,uDAAP,GAChBugB,EAAe,YAQrB,OAPIvgB,EAAKwgB,SACPxgB,EAAK8e,MAAQl7F,EACX28F,EACA,OACAvgB,EAAKwgB,OACL,SAEGjD,EAAQ,CACb5+C,UAAW,OACXmgD,MAAOyB,EACPliE,IAAK,IACLq9D,UAAW,EAEX,WAAY,SAACn9E,EAAGkiF,GACE,IAAZliF,EAAEnS,OAAaq0F,EAAKC,gBAEzB1gB,IAmJH6e,iBAAkBA,EAClBE,iBAAkBA,EAClBE,kBAAmBA,EACnBC,mBAAoBA,EACpBC,QAASA,EACTE,oBAAqBA,EACrBC,qBAAsBA,EACtBC,kBAAmBA,EACnBC,YAAaA,EACbC,cAAeA,EACfC,mBAAoBA,EACpBC,gBAAiBA,EACjBE,YAAaA,EACbC,WAAYA,EACZC,sBAAuBA,EACvBC,aAAcA,EACdW,kBAnCwB,SAASjrF,GACjC,OAAOvc,OAAOyX,OAAO8E,EACnB,CAEE,WAAY,SAAC6I,EAAGkiF,GAAWA,EAAKpwF,KAAKuwF,YAAcriF,EAAE,IAErD,SAAU,SAACA,EAAGkiF,GAAeA,EAAKpwF,KAAKuwF,cAAgBriF,EAAE,IAAIkiF,EAAKC,oBAiCpEG,EAAkB,+BAA+BvhG,MAAM,KAY3D,SAASwhG,EAAgBnF,GAOvB,SAASoF,EAAOvjG,EAAO3F,GACrB,OAAO,IAAIsT,OACThN,EAAOX,GACP,KAAOm+F,EAASqF,iBAAmB,IAAM,KAAOnpG,EAAS,IAAM,KAVlC,IA2B3BopG,EA3B2B,WA4B/B,aAAc,UACZloG,KAAKmoG,aAAe,GAEpBnoG,KAAKooG,QAAU,GACfpoG,KAAKqoG,QAAU,EACfroG,KAAKmc,SAAW,EAjCa,0CAqCvBrJ,EAAIm0E,GACVA,EAAK9qE,SAAWnc,KAAKmc,WAErBnc,KAAKmoG,aAAanoG,KAAKqoG,SAAWphB,EAClCjnF,KAAKooG,QAAQjzF,KAAK,CAAC8xE,EAAMn0E,IACzB9S,KAAKqoG,SA5TX,SAA0Bv1F,GACxB,OAAQ,IAAIV,OAAOU,EAAG3S,WAAa,KAAMvB,KAAK,IAAIuC,OAAS,EA2TvCmnG,CAAiBx1F,GAAM,IA1CV,gCA8CD,IAAxB9S,KAAKooG,QAAQjnG,SAGfnB,KAAKpB,KAAO,kBAAM,OAEpB,IAAM2pG,EAAcvoG,KAAKooG,QAAQruF,KAAI,SAAAiD,GAAE,OAAIA,EAAG,MAC9Chd,KAAKwoG,UAAYR,EA9SvB,SAAcS,GAWZ,IAXsC,IAAjBC,EAAiB,uDAAL,IAQ7BC,EAAkB,iDAClBC,EAAc,EACdC,EAAM,GACD5nG,EAAI,EAAGA,EAAIwnG,EAAQtnG,OAAQF,IAAK,CAEvC,IAAI8mC,EADJ6gE,GAAe,EAEX91F,EAAK1N,EAAOqjG,EAAQxnG,IAKxB,IAJIA,EAAI,IACN4nG,GAAOH,GAETG,GAAO,IACA/1F,EAAG3R,OAAS,GAAG,CACpB,IAAI0R,EAAQ81F,EAAgB/pG,KAAKkU,GACjC,GAAa,MAATD,EAAe,CACjBg2F,GAAO/1F,EACP,MAEF+1F,GAAO/1F,EAAG+/E,UAAU,EAAGhgF,EAAMQ,OAC7BP,EAAKA,EAAG+/E,UAAUhgF,EAAMQ,MAAQR,EAAM,GAAG1R,QACrB,OAAhB0R,EAAM,GAAG,IAAeA,EAAM,GAEhCg2F,GAAO,KAAOjlG,OAAO+L,OAAOkD,EAAM,IAAMk1B,IAExC8gE,GAAOh2F,EAAM,GACI,MAAbA,EAAM,IACR+1F,KAINC,GAAO,IAET,OAAOA,EAuQqBjiG,CAAK2hG,IAAc,GAC3CvoG,KAAKwS,UAAY,IArDY,2BAyD1BkpB,GACH17B,KAAKwoG,UAAUh2F,UAAYxS,KAAKwS,UAChC,IAAMK,EAAQ7S,KAAKwoG,UAAU5pG,KAAK88B,GAClC,IAAK7oB,EAAS,OAAO,KAGrB,IAAM5R,EAAI4R,EAAMuH,WAAU,SAAC4C,EAAI/b,GAAL,OAAWA,EAAI,QAAY8E,IAAPiX,KAExC8rF,EAAY9oG,KAAKmoG,aAAalnG,GAKpC,OAFA4R,EAAMmxB,OAAO,EAAG/iC,GAETb,OAAOyX,OAAOhF,EAAOi2F,OAtEC,KAyG3BC,EAzG2B,WA0G/B,aAAc,UAEZ/oG,KAAKouC,MAAQ,GAEbpuC,KAAKgpG,aAAe,GACpBhpG,KAAK0hD,MAAQ,EAEb1hD,KAAKwS,UAAY,EACjBxS,KAAKipG,WAAa,EAlHW,6CAsHpB51F,GACT,GAAIrT,KAAKgpG,aAAa31F,GAAQ,OAAOrT,KAAKgpG,aAAa31F,GAEvD,IAAM6qD,EAAU,IAAIgqC,EAIpB,OAHAloG,KAAKouC,MAAMrrC,MAAMsQ,GAAOvS,SAAQ,yBAAEgS,EAAF,KAAMm0E,EAAN,YAAgB/oB,EAAQgrC,QAAQp2F,EAAIm0E,MACpE/oB,EAAQ1yB,UACRxrC,KAAKgpG,aAAa31F,GAAS6qD,EACpBA,IA7HsB,mDAiI7B,OAA2B,IAApBl+D,KAAKipG,aAjIiB,oCAqI7BjpG,KAAKipG,WAAa,IArIW,8BAyIvBn2F,EAAIm0E,GACVjnF,KAAKouC,MAAMj5B,KAAK,CAACrC,EAAIm0E,IACH,UAAdA,EAAKl/E,MAAkB/H,KAAK0hD,UA3IH,2BA+I1BhmB,GACH,IAAMlW,EAAIxlB,KAAKmpG,WAAWnpG,KAAKipG,YAC/BzjF,EAAEhT,UAAYxS,KAAKwS,UACnB,IAAI3P,EAAS2iB,EAAE5mB,KAAK88B,GAiCpB,GAAI17B,KAAKopG,6BACP,GAAIvmG,GAAUA,EAAOwQ,QAAUrT,KAAKwS,eAAkB,CACpD,IAAM62F,EAAKrpG,KAAKmpG,WAAW,GAC3BE,EAAG72F,UAAYxS,KAAKwS,UAAY,EAChC3P,EAASwmG,EAAGzqG,KAAK88B,GAYrB,OARI74B,IACF7C,KAAKipG,YAAcpmG,EAAOsZ,SAAW,EACjCnc,KAAKipG,aAAejpG,KAAK0hD,OAE3B1hD,KAAKspG,eAIFzmG,MAnMsB,KAuOjC,SAAS0mG,EAAgC12F,EAAO+N,GAC9C,IAAMsiB,EAASrwB,EAAMlE,MAAMkE,EAAMQ,MAAQ,GACnCk1B,EAAQ11B,EAAMlE,MAAMkE,EAAMQ,MAAQR,EAAM,GAAG1R,QAClC,MAAX+hC,GAA4B,MAAVqF,GACpB3nB,EAAS+mF,cA+Gb,GAAI/E,EAASlsD,UAAYksD,EAASlsD,SAASx5B,SAAS,QAClD,MAAM,IAAItJ,MAAM,6FAElB,OAvEA,SAAS41F,EAAY7sF,EAAM3S,GAAQ,MAC3By/F,EAAmC9sF,EACzC,GAAIA,EAAK+sF,SAAU,OAAOD,EAC1B9sF,EAAK+sF,UAAW,EAGhB/sF,EAAKgtF,cAAgB,KAErBhtF,EAAKitF,SAAWjtF,EAAKitF,UAAYjtF,EAAKktF,cAEtC,IAAIC,EAAiB,KAWrB,GAV6B,WAAzB,EAAOntF,EAAKitF,YACdE,EAAiBntF,EAAKitF,SAASG,gBACxBptF,EAAKitF,SAASG,UAGnBptF,EAAKitF,WACPjtF,EAAKitF,SA4HX,SAAyBI,EAAaC,GAEpC,IAAIC,EAAmB,GAEI,iBAAhBF,EACTG,EAAgB,UAAWH,GAE3B5pG,OAAOkP,KAAK06F,GAAalpG,SAAQ,SAAS8kD,GACxCukD,EAAgBvkD,EAAWokD,EAAYpkD,OAG3C,OAAOskD,EAYP,SAASC,EAAgBvkD,EAAWwkD,GAC9BH,IACFG,EAAcA,EAAYzyF,eAE5ByyF,EAAY7jG,MAAM,KAAKzF,SAAQ,SAASupG,GACtC,IAAIC,EAAOD,EAAQ9jG,MAAM,KACzB2jG,EAAiBI,EAAK,IAAM,CAAC1kD,EAAW2kD,EAAgBD,EAAK,GAAIA,EAAK,SAzJtDE,CAAgB7tF,EAAKitF,SAAUhH,EAASqF,mBAItDtrF,EAAK8tF,SAAWX,EAClB,MAAM,IAAIl2F,MAAM,kGA0ClB,OArCA61F,EAAMiB,iBAAmB1C,EAAOrrF,EAAK8tF,SAAWX,GAAkB,OAAO,GAErE9/F,IACE2S,EAAKktF,gBAMPltF,EAAKopF,MAAQ,OAASppF,EAAKktF,cAActjG,MAAM,KAAKK,KAAK,KAAO,eAChE+V,EAAKgtF,cAAgBJ,GAElB5sF,EAAKopF,QAAOppF,EAAKopF,MAAQ,SAC9B0D,EAAMkB,QAAU3C,EAAOrrF,EAAKopF,OACxBppF,EAAKiuF,iBAAgBjuF,EAAK2oB,IAAM3oB,EAAKopF,OACpCppF,EAAK2oB,KAAQ3oB,EAAKkuF,iBAAgBluF,EAAK2oB,IAAM,SAC9C3oB,EAAK2oB,MAAKmkE,EAAMqB,MAAQ9C,EAAOrrF,EAAK2oB,MACxCmkE,EAAMsB,eAAiB3lG,EAAOuX,EAAK2oB,MAAQ,GACvC3oB,EAAKkuF,gBAAkB7gG,EAAO+gG,iBAChCtB,EAAMsB,iBAAmBpuF,EAAK2oB,IAAM,IAAM,IAAMt7B,EAAO+gG,iBAGvDpuF,EAAKspF,UAASwD,EAAMuB,UAAYhD,EAAOrrF,EAAKspF,eAEzBlgG,IAAnB4W,EAAKgmF,YAAyBhmF,EAAKgmF,UAAY,GAC9ChmF,EAAK+5B,WAAU/5B,EAAK+5B,SAAW,IAEpC/5B,EAAK+5B,UAAW,MAAG7rC,OAAH,UAAa8R,EAAK+5B,SAAS38B,KAAI,SAASrN,GACtD,OA8CN,SAA2BiQ,GACrBA,EAAKsuF,WAAatuF,EAAKuuF,kBACzBvuF,EAAKuuF,gBAAkBvuF,EAAKsuF,SAASlxF,KAAI,SAASoxF,GAChD,OAAO3G,EAAQ7nF,EAAM,CAAEsuF,SAAU,MAAQE,OAO7C,GAAIxuF,EAAKuuF,gBACP,OAAOvuF,EAAKuuF,gBAOd,GAlCF,SAASE,EAAmBzuF,GAC1B,QAAKA,IAEEA,EAAKkuF,gBAAkBO,EAAmBzuF,EAAK0uF,SA+BlDD,CAAmBzuF,GACrB,OAAO6nF,EAAQ7nF,EAAM,CAAE0uF,OAAQ1uF,EAAK0uF,OAAS7G,EAAQ7nF,EAAK0uF,QAAU,OAGtE,GAAIjrG,OAAOikG,SAAS1nF,GAClB,OAAO6nF,EAAQ7nF,GAIjB,OAAOA,EAzEI2uF,CAAwB,SAAN5+F,EAAeiQ,EAAOjQ,QAEjDiQ,EAAK+5B,SAAS51C,SAAQ,SAAS4L,GAAK88F,EAA+B98F,EAAI+8F,MAEnE9sF,EAAK0uF,QACP7B,EAAY7sF,EAAK0uF,OAAQrhG,GAG3By/F,EAAMvrC,QAvIR,SAAwBvhD,GACtB,IAAM4uF,EAAK,IAAIxC,EAWf,OATApsF,EAAK+5B,SAAS51C,SAAQ,SAAAmqC,GAAI,OAAIsgE,EAAGrC,QAAQj+D,EAAK86D,MAAO,CAAEz3D,KAAMrD,EAAMljC,KAAM,aAErE4U,EAAKouF,gBACPQ,EAAGrC,QAAQvsF,EAAKouF,eAAgB,CAAEhjG,KAAM,QAEtC4U,EAAKspF,SACPsF,EAAGrC,QAAQvsF,EAAKspF,QAAS,CAAEl+F,KAAM,YAG5BwjG,EA2HSC,CAAe/B,GACxBA,EAOFD,CAA+B5G,GAgHxC,SAAS2H,EAAgBF,EAASoB,GAGhC,OAAIA,EACK97F,OAAO87F,GAUlB,SAAuBpB,GACrB,OAAOvC,EAAgB5qF,SAASmtF,EAAQ1yF,eARjC+zF,CAAcrB,GAAW,EAAI,EAmBtC,IAAMxhD,EAAY,CAChB5kB,MAAO,CAAC,WAAY,OAAQ,cAC5B3sB,KAAM,WACJ,MAAO,CACLq0F,iBAAkB,GAClBC,iBAAiB,IAGrB9+D,SAAU,CACR8Y,UADQ,WAEN,OAAI5lD,KAAK4rG,gBAAwB,GAE1B,QAAU5rG,KAAK2rG,kBAExB7G,YANQ,WAQN,OAAK9kG,KAAK6rG,YAAeC,KAAKjJ,YAAY7iG,KAAK4iG,WAO3C5iG,KAAK6rG,YACPhpG,EAASipG,KAAKtwC,cAAcx7D,KAAKoiB,MACjCpiB,KAAK2rG,iBAAmB9oG,EAAO+/F,WAE/B//F,EAASipG,KAAKxJ,UAAUtiG,KAAK4iG,SAAU5iG,KAAKoiB,KAAMpiB,KAAK+rG,gBACvD/rG,KAAKgsG,kBAAoBhsG,KAAK4iG,UAEzB//F,EAAO4B,QAbZgE,QAAQqnD,KAAR,wBAA8B9vD,KAAK4iG,SAAnC,wCACA5iG,KAAK4rG,iBAAkB,EAChBrH,EAAWvkG,KAAKoiB,OAGzB,IAAIvf,GAUNgpG,WAxBQ,WAyBN,OAAQ7rG,KAAK4iG,WArCen+F,EAqCsBzE,KAAKisG,WApCpDjzF,QAAQvU,GAAmB,KAAVA,IAD1B,IAAkCA,GAuC9BsnG,eA3BQ,WA4BN,OAAO,IAKX7iG,OAzCgB,SAyCTgQ,GACL,OAAOA,EAAc,MAAO,GAAI,CAC9BA,EAAc,OAAQ,CACpBwrC,MAAO1kD,KAAK4lD,UACZsmD,SAAU,CAAEj7C,UAAWjxD,KAAK8kG,mBAM9BqH,EAAY,CAChBC,QADgB,SACRtjD,GACNA,EAAId,UAAU,cAAea,KAS3BwjD,EAAW9H,EACX+H,EAAY9H,EAEE+H,EAA+ClvF,EAA3DsnF,WAAwC6H,EAAmBnvF,EAAjCwnF,aAC5B4H,EAAWntG,OAAO,WAy2BpBgjG,EAn2BS,SAASwJ,GAGpB,IAAIY,EAAa,GAIb7wC,EAAYz7D,OAAOkO,OAAO,MAE1Bq+F,EAAUvsG,OAAOkO,OAAO,MAExByzB,EAAU,GAIV6qE,GAAY,EACZC,EAAc,yBACdC,EAAqB,sFAEnBC,EAAqB,CAAEC,mBAAmB,EAAMvtG,KAAM,aAAci3C,SAAU,IAKhFvxC,EAAU,CACZ8nG,cAAe,qBACfC,iBAAkB,8BAClBxJ,YAAa,QACbyJ,WAAY,KACZC,OAAO,EACPvxC,UAAW,KAGXkoC,UAAWyB,GASb,SAAS6H,EAAmBnK,GAC1B,OAAO/9F,EAAQ8nG,cAAcn7F,KAAKoxF,GA2CpC,SAASZ,EAAUY,EAAc9gF,EAAM2pF,EAAgBuB,GAErD,IAAIzjG,EAAU,CACZuY,OACAwgF,SAAUM,GAIZqK,EAAK,mBAAoB1jG,GAIzB,IAAIhH,EAASgH,EAAQhH,OACnBgH,EAAQhH,OACR2qG,EAAW3jG,EAAQ+4F,SAAU/4F,EAAQuY,KAAM2pF,EAAgBuB,GAM7D,OAJAzqG,EAAOuf,KAAOvY,EAAQuY,KAEtBmrF,EAAK,kBAAmB1qG,GAEjBA,EAWT,SAAS2qG,EAAWtK,EAAc9gF,EAAM2pF,EAAgBuB,GACtD,IAAIG,EAAkBrrF,EAQtB,SAASsrF,EAAY/wF,EAAM9J,GACzB,IAAI86F,EAAY/K,EAASqF,iBAAmBp1F,EAAM,GAAG8E,cAAgB9E,EAAM,GAC3E,OAAOzS,OAAOC,UAAUgB,eAAeb,KAAKmc,EAAKitF,SAAU+D,IAAchxF,EAAKitF,SAAS+D,GA4DzF,SAASC,IACgB,MAAnB/5D,EAAIg6D,YA3BV,WACE,GAAmB,KAAfC,EAAJ,CAEA,IAAIjrG,EAAS,KAEb,GAA+B,iBAApBgxC,EAAIg6D,YAA0B,CACvC,IAAKhyC,EAAUhoB,EAAIg6D,aAEjB,YADA5J,EAAQd,QAAQ2K,GAGlBjrG,EAAS2qG,EAAW35D,EAAIg6D,YAAaC,GAAY,EAAMC,EAAcl6D,EAAIg6D,cACzEE,EAAcl6D,EAAIg6D,aAAehrG,EAAOgxC,SAExChxC,EAAS24D,EAAcsyC,EAAYj6D,EAAIg6D,YAAY1sG,OAAS0yC,EAAIg6D,YAAc,MAO5Eh6D,EAAI8uD,UAAY,IAClBA,GAAa9/F,EAAO8/F,WAEtBsB,EAAQT,eAAe3gG,EAAOohG,QAASphG,EAAO+/F,WAK5CoL,GA3DJ,WACE,GAAKn6D,EAAI+1D,SAAT,CAKA,IAAIp3F,EAAY,EAChBqhC,EAAI62D,iBAAiBl4F,UAAY,EAIjC,IAHA,IAAIK,EAAQghC,EAAI62D,iBAAiB9rG,KAAKkvG,GAClCG,EAAM,GAEHp7F,GAAO,CACZo7F,GAAOH,EAAWjb,UAAUrgF,EAAWK,EAAMQ,OAC7C,IAAMiE,EAAOo2F,EAAY75D,EAAKhhC,GAC9B,GAAIyE,EAAM,SACyBA,EADzB,GACDR,EADC,KACKo3F,EADL,KAERjK,EAAQd,QAAQ8K,GAChBA,EAAM,GAENtL,GAAauL,EACbjK,EAAQZ,WAAWxwF,EAAM,GAAIiE,QAE7Bm3F,GAAOp7F,EAAM,GAEfL,EAAYqhC,EAAI62D,iBAAiBl4F,UACjCK,EAAQghC,EAAI62D,iBAAiB9rG,KAAKkvG,GAEpCG,GAAOH,EAAWh3E,OAAOtkB,GACzByxF,EAAQd,QAAQ8K,QA1BdhK,EAAQd,QAAQ2K,GA2DhBK,GAEFL,EAAa,GAMf,SAASM,EAAazxF,GAKpB,OAJIA,EAAKipC,WACPq+C,EAAQX,SAAS3mF,EAAKipC,WAExB/R,EAAMzzC,OAAOkO,OAAOqO,EAAM,CAAE3S,OAAQ,CAAEvF,MAAOovC,KAuC/C,SAASw6D,EAASC,GAChB,OAA+B,IAA3Bz6D,EAAIqqB,QAAQ+qC,YAGd6E,GAAcQ,EAAO,GACd,IAIPC,GAA2B,EACpB,GAUX,SAASC,EAAa37F,GAOpB,IANA,IAAIy7F,EAASz7F,EAAM,GACf47F,EAAU57F,EAAMy7B,KAEdo5D,EAAO,IAAIpD,EAASmK,GAG1B,MADwB,CAACA,EAAQ9E,cAAe8E,EAAQ,aACxD,eAAkC,CAA7B,IAAM7jD,EAAE,KACX,GAAKA,IACLA,EAAG/3C,EAAO60F,GACNA,EAAKllE,QAAQ,OAAO6rE,EAASC,GAuBnC,OApBIG,GAAWA,EAAQ7D,iBACrB6D,EAAQ3D,MAjnCP,IAAI14F,OAinCkBk8F,EAjnCL/qG,QAAQ,wBAAyB,QAAS,MAonC1DkrG,EAAQx5D,KACV64D,GAAcQ,GAEVG,EAAQC,eACVZ,GAAcQ,GAEhBV,IACKa,EAAQE,aAAgBF,EAAQC,eACnCZ,EAAaQ,IAGjBF,EAAaK,GAKNA,EAAQE,YAAc,EAAIL,EAAOntG,OAQ1C,SAASytG,EAAW/7F,GAClB,IAAIy7F,EAASz7F,EAAM,GACfg8F,EAAqBpB,EAAgB32E,OAAOjkB,EAAMQ,OAElDy7F,EA9FN,SAASC,EAAUpyF,EAAM9J,EAAOg8F,GAC9B,IAAIv+E,EA/gCV,SAAoBxd,EAAIw7F,GACtB,IAAIz7F,EAAQC,GAAMA,EAAGlU,KAAK0vG,GAC1B,OAAOz7F,GAAyB,IAAhBA,EAAMQ,MA6gCJ+2C,CAAWztC,EAAKmuF,MAAO+D,GAErC,GAAIv+E,EAAS,CACX,GAAI3T,EAAK,UAAW,CAClB,IAAM+qF,EAAO,IAAIpD,EAAS3nF,GAC1BA,EAAK,UAAU9J,EAAO60F,GAClBA,EAAKllE,SAAQlS,GAAU,GAG7B,GAAIA,EAAS,CACX,KAAO3T,EAAKqyF,YAAcryF,EAAK3S,QAC7B2S,EAAOA,EAAK3S,OAEd,OAAO2S,GAKX,GAAIA,EAAKkuF,eACP,OAAOkE,EAAUpyF,EAAK3S,OAAQ6I,EAAOg8F,GA0EzBE,CAAUl7D,EAAKhhC,EAAOg8F,GACpC,IAAKC,EAAW,OAAOrC,EAEvB,IAAIv3B,EAASrhC,EACTqhC,EAAOjgC,KACT64D,GAAcQ,GAERp5B,EAAO+5B,WAAa/5B,EAAOg6B,aAC/BpB,GAAcQ,GAEhBV,IACI14B,EAAOg6B,aACTpB,EAAaQ,IAGjB,GACMz6D,EAAI+R,WACNq+C,EAAQV,YAEL1vD,EAAIoB,MAASpB,EAAIg6D,cACpBlL,GAAa9uD,EAAI8uD,WAEnB9uD,EAAMA,EAAI7pC,aACH6pC,IAAQi7D,EAAQ9kG,QAOzB,OANI8kG,EAAQzD,SACNyD,EAAQlE,iBACVkE,EAAQzD,OAAOP,MAAQgE,EAAQhE,OAEjCsD,EAAaU,EAAQzD,SAEhBn2B,EAAO+5B,UAAY,EAAIX,EAAOntG,OAcvC,IAAIguG,EAAY,GAQhB,SAASC,EAAcC,EAAiBx8F,GACtC,IAAIy7F,EAASz7F,GAASA,EAAM,GAK5B,GAFAi7F,GAAcuB,EAEA,MAAVf,EAEF,OADAV,IACO,EAOT,GAAuB,UAAnBuB,EAAUpnG,MAAmC,QAAf8K,EAAM9K,MAAkBonG,EAAU97F,QAAUR,EAAMQ,OAAoB,KAAXi7F,EAAe,CAG1G,GADAR,GAAcL,EAAgB1qG,MAAM8P,EAAMQ,MAAOR,EAAMQ,MAAQ,IAC1Du5F,EAAW,CAEd,IAAMjiE,EAAM,IAAI/2B,MAAM,uBAGtB,MAFA+2B,EAAIu4D,aAAeA,EACnBv4D,EAAI2kE,QAAUH,EAAU7gE,KAClB3D,EAER,OAAO,EAIT,GAFAwkE,EAAYt8F,EAEO,UAAfA,EAAM9K,KACR,OAAOymG,EAAa37F,GACf,GAAmB,YAAfA,EAAM9K,OAAuBgkG,EAAgB,CAGtD,IAAMphE,EAAM,IAAI/2B,MAAM,mBAAqB06F,EAAS,gBAAkBz6D,EAAI+R,WAAa,aAAe,KAEtG,MADAjb,EAAIhuB,KAAOk3B,EACLlJ,EACD,GAAmB,QAAf93B,EAAM9K,KAAgB,CAC/B,IAAIg9F,EAAY6J,EAAW/7F,GAC3B,GAAIkyF,IAAc0H,EAChB,OAAO1H,EAOX,GAAmB,YAAflyF,EAAM9K,MAAiC,KAAXumG,EAE9B,OAAO,EAOT,GAAIiB,EAAa,KAAUA,EAA2B,EAAd18F,EAAMQ,MAE5C,MADY,IAAIO,MAAM,6DAiBxB,OADAk6F,GAAcQ,EACPA,EAAOntG,OAGhB,IAAIyhG,EAAWC,EAAYK,GAC3B,IAAKN,EAEH,MADAn6F,QAAQ5J,MAAMiuG,EAAmBvpG,QAAQ,KAAM2/F,IACzC,IAAItvF,MAAM,sBAAwBsvF,EAAe,KAGzD,IAAIsM,EAAKzH,EAAgBnF,GACrB//F,EAAS,GAETgxC,EAAMy5D,GAAgBkC,EAEtBzB,EAAgB,GAChB9J,EAAU,IAAI9+F,EAAQ4+F,UAAU5+F,IA5GpC,WAEE,IADA,IAAI4kB,EAAO,GACFuc,EAAUuN,EAAKvN,IAAYs8D,EAAUt8D,EAAUA,EAAQt8B,OAC1Ds8B,EAAQsf,WACV77B,EAAK4K,QAAQ2R,EAAQsf,WAGzB77B,EAAKjpB,SAAQ,SAAAkpB,GAAI,OAAIi6E,EAAQX,SAASt5E,MAsGxCylF,GACA,IAAI3B,EAAa,GACbnL,EAAY,EACZtvF,EAAQ,EACRk8F,EAAa,EACbhB,GAA2B,EAE/B,IAGE,IAFA16D,EAAIqqB,QAAQorC,gBAEH,CACPiG,IACIhB,EAGFA,GAA2B,EAE3B16D,EAAIqqB,QAAQorC,cAEdz1D,EAAIqqB,QAAQ1rD,UAAYa,EAExB,IAAMR,EAAQghC,EAAIqqB,QAAQt/D,KAAK6uG,GAG/B,IAAK56F,EAAO,MAEZ,IACM68F,EAAiBN,EADH3B,EAAgB5a,UAAUx/E,EAAOR,EAAMQ,OACTR,GAClDQ,EAAQR,EAAMQ,MAAQq8F,EAOxB,OALAN,EAAc3B,EAAgB32E,OAAOzjB,IACrC4wF,EAAQN,gBACRM,EAAQL,WACR/gG,EAASohG,EAAQJ,SAEV,CACLlB,UAAWA,EACXl+F,MAAO5B,EACP+/F,SAAUM,EACV+C,SAAS,EACThC,QAASA,EACTpwD,IAAKA,GAEP,MAAOlJ,GACP,GAAIA,EAAIxoB,SAAWwoB,EAAIxoB,QAAQjF,SAAS,WACtC,MAAO,CACL+oF,SAAS,EACT0J,UAAW,CACTC,IAAKjlE,EAAIxoB,QACTtY,QAAS4jG,EAAgB1qG,MAAMsQ,EAAQ,IAAKA,EAAQ,KACpDsJ,KAAMguB,EAAIhuB,MAEZkzF,MAAOhtG,EACP8/F,UAAW,EACXl+F,MAAO4nG,EAASoB,GAChBxJ,QAASA,GAEN,GAAI2I,EACT,MAAO,CACL3G,SAAS,EACTtD,UAAW,EACXl+F,MAAO4nG,EAASoB,GAChBxJ,QAASA,EACTrB,SAAUM,EACVrvD,IAAKA,EACLmwD,YAAar5D,GAGf,MAAMA,GAsCZ,SAAS6wB,EAAcp5C,EAAM0tF,GAC3BA,EAAiBA,GAAkB3qG,EAAQ02D,WAAaz7D,OAAOkP,KAAKusD,GACpE,IAAIh5D,EA5BN,SAAiCuf,GAC/B,IAAMvf,EAAS,CACb8/F,UAAW,EACXsB,QAAS,IAAI9+F,EAAQ4+F,UAAU5+F,GAC/BV,MAAO4nG,EAASjqF,GAChB6jF,SAAS,EACTpyD,IAAKk5D,GAGP,OADAlqG,EAAOohG,QAAQd,QAAQ/gF,GAChBvf,EAmBMktG,CAAwB3tF,GACjCmgF,EAAa1/F,EAgBjB,OAfAitG,EAAe91F,OAAO6oF,GAAa7oF,OAAOg2F,GAAelvG,SAAQ,SAASrB,GACxE,IAAI6mC,EAAUknE,EAAW/tG,EAAM2iB,GAAM,GACrCkkB,EAAQs8D,SAAWnjG,EACf6mC,EAAQq8D,UAAYJ,EAAWI,YACjCJ,EAAaj8D,GAEXA,EAAQq8D,UAAY9/F,EAAO8/F,YAC7BJ,EAAa1/F,EACbA,EAASyjC,MAGTi8D,EAAWK,WAEb//F,EAAOotG,YAAc1N,GAEhB1/F,EAYT,SAASqtG,EAAUnjG,GACjB,OAAM5H,EAAQgoG,YAAchoG,EAAQioG,MAI7BrgG,EAAKxJ,QAAQspG,GAAa,SAAAh6F,GAC/B,MAAc,OAAVA,EACK1N,EAAQioG,MAAQ,OAASv6F,EACvB1N,EAAQgoG,WACVt6F,EAAMtP,QAAQ,MAAO4B,EAAQgoG,YAE/Bt6F,KATA9F,EAyCX,SAASojG,EAAevrD,GAEtB,IAAI7kB,EAAO,KACL6iE,EAxkBR,SAAuBzsD,GACrB,IAAIilB,EAAUjlB,EAAMyP,UAAY,IAEhCwV,GAAWjlB,EAAMtpB,WAAaspB,EAAMtpB,WAAW+4B,UAAY,GAG3D,IAAM/yC,EAAQ1N,EAAQ+nG,iBAAiBtuG,KAAKw8D,GAC5C,GAAIvoD,EAAO,CACT,IAAI+vF,EAAWC,EAAYhwF,EAAM,IAKjC,OAJK+vF,IACHn6F,QAAQqnD,KAAKg9C,EAAmBvpG,QAAQ,KAAMsP,EAAM,KACpDpK,QAAQqnD,KAAK,oDAAqD3Z,IAE7DysD,EAAW/vF,EAAM,GAAK,eAG/B,OAAOuoD,EACJ70D,MAAM,OACN4T,MAAK,SAAC2iB,GAAD,OAAYuwE,EAAmBvwE,IAAW+lE,EAAY/lE,MAsjB7CszE,CAAcxrD,GAE/B,IAAIyoD,EAAmBzK,GAAvB,CAEA2K,EAAK,wBACH,CAAEp3D,MAAOyO,EAASg+C,SAAUA,IAE1Bz9F,EAAQioG,OACVrtE,EAAOp9B,SAASuW,cAAc,QACzB+3C,UAAYrM,EAAQqM,UAAU1tD,QAAQ,MAAO,IAAIA,QAAQ,aAAc,MAE5Ew8B,EAAO6kB,EAET,IAAMrkB,EAAOR,EAAK6sB,YACZ/pD,EAAS+/F,EAAWN,EAAUM,EAAUriE,GAAM,GAAQi7B,EAAcj7B,GAEpE8vE,EAAiB9D,EAAaxsE,GACpC,GAAIswE,EAAelvG,OAAQ,CACzB,IAAMmvG,EAAa3tG,SAASuW,cAAc,OAC1Co3F,EAAWr/C,UAAYpuD,EAAO4B,MAC9B5B,EAAO4B,MAAQ+nG,EAAe6D,EAAgB9D,EAAa+D,GAAa/vE,GAE1E19B,EAAO4B,MAAQyrG,EAAUrtG,EAAO4B,OAEhC8oG,EAAK,uBAAwB,CAAEp3D,MAAOyO,EAAS/hD,OAAQA,IAEvD+hD,EAAQqM,UAAYpuD,EAAO4B,MAC3BmgD,EAAQgB,UAnDV,SAAwB2qD,EAAeC,EAAaC,GAClD,IAAI7N,EAAW4N,EAAc7D,EAAQ6D,GAAeC,EAChD5tG,EAAS,CAAC0tG,EAAcltG,QAU5B,OARKktG,EAAc19F,MAAM,aACvBhQ,EAAOsS,KAAK,QAGTo7F,EAAcrzF,SAAS0lF,IAC1B//F,EAAOsS,KAAKytF,GAGP//F,EAAO+D,KAAK,KAAKvD,OAuCJqtG,CAAe9rD,EAAQgB,UAAWg9C,EAAU//F,EAAO+/F,UACvEh+C,EAAQ/hD,OAAS,CACf+/F,SAAU//F,EAAO+/F,SAEjB9vF,GAAIjQ,EAAO8/F,UACXgO,UAAW9tG,EAAO8/F,WAEhB9/F,EAAOotG,cACTrrD,EAAQqrD,YAAc,CACpBrN,SAAU//F,EAAOotG,YAAYrN,SAE7B9vF,GAAIjQ,EAAOotG,YAAYtN,UACvBgO,UAAW9tG,EAAOotG,YAAYtN,aAuBpC,IAAMiO,EAAmB,SAAnBA,IACJ,IAAIA,EAAiBv+E,OAArB,CACAu+E,EAAiBv+E,QAAS,EAE1B,IAAI2oC,EAASr4D,SAASkuG,iBAAiB,YACvCnE,EAAW5rG,QAAQN,KAAKw6D,EAAQm1C,KAmElC,SAAStN,EAAYpjG,GAEnB,OADAA,GAAQA,GAAQ,IAAIkY,cACbkkD,EAAUp8D,IAASo8D,EAAU8wC,EAAQltG,IAQ9C,SAASwjG,EAAgB6N,EAAzB,GAAsD,IAAhB5N,EAAgB,EAAhBA,aACX,iBAAd4N,IACTA,EAAY,CAACA,IAEfA,EAAUhwG,SAAQ,SAAAkiG,GAAW2J,EAAQ3J,GAASE,KAOhD,SAAS8M,EAAcvwG,GACrB,IAAIsxG,EAAOlO,EAAYpjG,GACvB,OAAOsxG,IAASA,EAAK/D,kBAevB,SAASO,EAAK/0E,EAAOvjB,GACnB,IAAI21C,EAAKpyB,EACTuJ,EAAQjhC,SAAQ,SAASohC,GACnBA,EAAO0oB,IACT1oB,EAAO0oB,GAAI31C,MA2CjB,IAAK,IAAM7T,KAxBXhB,OAAOyX,OAAOi0F,EAAM,CAClBxJ,YACA9mC,gBACA00C,UAXF,SAA4Bz3F,GAI1B,OAHAhQ,QAAQqnD,KAAK,iEACbrnD,QAAQqnD,KAAK,sEAENogD,EAAUz3F,IAQjB03F,iBACArM,UAvJF,SAAmBkN,GACbA,EAAY5D,QACd3kG,QAAQqnD,KAAK,sEACbrnD,QAAQqnD,KAAK,uEAEf3qD,EAAUmnG,EAAUnnG,EAAS6rG,IAmJ7BJ,mBACAK,uBAnIF,WAEEnxG,OAAO2hB,iBAAiB,mBAAoBmvF,GAAkB,IAkI9D90C,iBAzHF,SAA0BonC,EAAcgO,GACtC,IAAIH,EAAO,KACX,IACEA,EAAOG,EAAmBpF,GAC1B,MAAOjtG,GAGP,GAFA4J,QAAQ5J,MAAM,wDAAwD0E,QAAQ,KAAM2/F,KAE/E0J,EAAa,MAAM/tG,EAAgB4J,QAAQ5J,MAAMA,GAKtDkyG,EAAOhE,EAGJgE,EAAKtxG,OAAMsxG,EAAKtxG,KAAOyjG,GAC5BrnC,EAAUqnC,GAAgB6N,EAC1BA,EAAKI,cAAgBD,EAAmBhxG,KAAK,KAAM4rG,GAE/CiF,EAAKpE,SACP1J,EAAgB8N,EAAKpE,QAAS,CAAEzJ,kBAsGlCR,cA/FF,WACE,OAAOtiG,OAAOkP,KAAKusD,IA+FnBgnC,cACAI,kBACAmO,gBArFF,SAAyB3xG,GACvB,IAAIsxG,EAAOlO,EAAYpjG,GACvB,GAAIsxG,EAAQ,OAAOA,EAGnB,MADU,IAAIn9F,MAAM,iDAAmDrQ,QAAQ,KAAM9D,KAkFrFuwG,gBACAxL,QAAS8H,EACT+E,UA/CF,SAAmBnvE,GACjBH,EAAQ5sB,KAAK+sB,IAgDbovE,UAAWnF,IAGbL,EAAKyF,UAAY,WAAa3E,GAAY,GAC1Cd,EAAK0F,SAAW,WAAa5E,GAAY,GACzCd,EAAK2F,cAl6BO,SAo6BMvK,EAEU,WAAtB,EAAOA,EAAM9lG,KAEf8iG,EAAWgD,EAAM9lG,IAOrB,OAFAhB,OAAOyX,OAAOi0F,EAAM5E,GAEb4E,EAIO4F,CAAK,IAErBhzG,EAAOC,QAAU2jG,G,6BC5pEjB,IAAIqP,EAAY5yG,EAAQ,KAEpBsjG,EAAQ/zF,EAAOsF,OAcnB,SAAStF,EAAOsjG,GAGd,OAFAC,EAAex2E,YAAcu2E,EAAav2E,aAAeu2E,EAAanyG,KAE/DoyG,EAEP,SAASA,EAAe3rF,GAKtB,OAJIA,IACFA,EAASyrF,EAAUhlG,MAAM,KAAM3J,YAG1B,IAAI4uG,EAAa1rF,IAtB5BxnB,EAAOC,QAAU0jG,EAEjBA,EAAMyP,KAAOxjG,EAAOyjG,WACpB1P,EAAM9kD,MAAQjvC,EAAOwwB,YACrBujE,EAAM2P,UAAY1jG,EAAO2jG,gBACzB5P,EAAMS,OAASx0F,EAAO4/B,aACtBm0D,EAAMt6F,KAAOuG,EAAO3K,WACpB0+F,EAAM6P,IAAM5jG,EAAO6jG,UAEnB9P,EAAM/zF,OAASA,G,iBCJb,WAGA,IAAItC,EA4BJ,SAASka,EAAOksF,GAsBd,IArBA,IAKI1lG,EAEA+L,EACAqwB,EAEAupE,EAVAC,EAAW,EACXr9F,EAAO,GAAGlS,MAAMvC,KAAKwC,WACrB/B,EAAI,EACJ4X,EAAIu5F,EAAIjxG,OACR0B,EAAS,GAETo6B,GAAU,EAGVs1E,GAAc,EAEdC,EAAU,WAAa,OAAOv9F,EAAKq9F,MACnCG,EAAc,WAEZ,IADA,IAAIC,EAAS,GACN,KAAK5gG,KAAKsgG,EAAInxG,KACnByxG,GAAUN,EAAInxG,KACdyL,EAAI0lG,EAAInxG,GAEV,OAAOyxG,EAAOvxG,OAAS,EAAIg8B,SAASu1E,GAAU,MAG7CzxG,EAAI4X,IAAK5X,EAEd,GADAyL,EAAI0lG,EAAInxG,GACJg8B,EAeF,OAdAA,GAAU,EACD,KAALvwB,GACF6lG,GAAc,EACd7lG,EAAI0lG,IAAMnxG,IAEE,KAALyL,GAA0B,KAAd0lG,EAAInxG,EAAI,IAC3BsxG,GAAc,EAEd7lG,EAAI0lG,EADJnxG,GAAK,IAILsxG,GAAc,EAEhBF,EAAYI,IACJ/lG,GACR,IAAK,IACH7J,GAAUs6B,SAASq1E,IAAW,IAAIryG,SAAS,GAC3C,MACF,IAAK,IAGD0C,GADiB,iBADnB4V,EAAM+5F,MACyB/5F,aAAe7U,OAClC6U,EAEA7U,OAAOo4B,aAAamB,SAAS1kB,EAAK,KAC9C,MACF,IAAK,IACH5V,GAAUs6B,SAASq1E,IAAW,IAC9B,MACF,IAAK,IACH1pE,EAAMllC,OAAO+uG,WAAWH,KAAWI,QAAQP,GAAa,IACxDxvG,GAAU0vG,EAAczpE,EAAMA,EAAIvlC,QAAQ,KAAM,IAChD,MACF,IAAK,IACHV,GAAU+a,KAAKC,UAAU20F,KACzB,MACF,IAAK,IACH3vG,GAAU,IAAMs6B,SAASq1E,IAAW,IAAIryG,SAAS,GACjD,MACF,IAAK,IACH0C,GAAU2vG,IACV,MACF,IAAK,IACH3vG,GAAU,KAAOs6B,SAASq1E,IAAW,IAAIryG,SAAS,IAClD,MACF,IAAK,IACH0C,GAAU,KAAOs6B,SAASq1E,IAAW,IAAIryG,SAAS,IAAImgB,cACtD,MACF,QACEzd,GAAU6J,MAGG,MAANA,EACTuwB,GAAU,EAEVp6B,GAAU6J,EAGd,OAAO7J,GA1GPmJ,EAAYtN,EAAOC,QAAUunB,GASrBA,OAASA,EACnBla,EAAU6mG,SAUV,SAAkBT,EAAKU,GACrB,OAAO5sF,EAAOvZ,MAAM,KAAM,CAACylG,GAAKvnG,OAAOioG,KATlB,oBAAZrqG,SAAkD,mBAAhBA,QAAQsqG,MACnD/mG,EAAUgnG,OAGZ,WACEvqG,QAAQsqG,IAAI7sF,EAAOvZ,MAAM,KAAM3J,cAxBjC,I,+BCNF,IAAIqa,EAAete,EAAQ,KACvBk0G,EAAel0G,EAAQ,KACvBm0G,EAAen0G,EAAQ,KACvBo0G,EAAep0G,EAAQ,KACvBq0G,EAAer0G,EAAQ,KACvBs0G,EAAet0G,EAAQ,KACvBu0G,EAAev0G,EAAQ,KACvB69B,EAAe79B,EAAQ,KACvBw0G,EAAex0G,EAAQ,KAGvBwgB,EAAS,CACX,QAAWxgB,EAAQ,KACnBy0G,KAAMz0G,EAAQ,KACd00G,WAAY10G,EAAQ,MAYlB20G,EAAe,oCACfC,EAAe,oCAEnB,SAASC,EAAapsG,GAEpB,IAAIlE,EAAMkE,EAAInE,OAAOsU,cAErB,OAAO+7F,EAAa5hG,KAAKxO,MAAQqwG,EAAa7hG,KAAKxO,GAMrD,IAAIuwG,EAAsB,CAAE,QAAS,SAAU,WAE/C,SAASC,EAActsG,GACrB,IAAIovB,EAASgG,EAAMpe,MAAMhX,GAAK,GAE9B,GAAIovB,EAAOY,YAOJZ,EAAOQ,UAAYy8E,EAAoB1gG,QAAQyjB,EAAOQ,WAAa,GACtE,IACER,EAAOY,SAAW+7E,EAASQ,QAAQn9E,EAAOY,UAC1C,MAAOiB,IAIb,OAAOmE,EAAMtf,OAAOsf,EAAM1W,OAAO0Q,IAGnC,SAASo9E,EAAkBxsG,GACzB,IAAIovB,EAASgG,EAAMpe,MAAMhX,GAAK,GAE9B,GAAIovB,EAAOY,YAOJZ,EAAOQ,UAAYy8E,EAAoB1gG,QAAQyjB,EAAOQ,WAAa,GACtE,IACER,EAAOY,SAAW+7E,EAASU,UAAUr9E,EAAOY,UAC5C,MAAOiB,IAIb,OAAOmE,EAAMskE,OAAOtkE,EAAM1W,OAAO0Q,IAyInC,SAASs9E,EAAWC,EAAYhvG,GAC9B,KAAMnF,gBAAgBk0G,GACpB,OAAO,IAAIA,EAAWC,EAAYhvG,GAG/BA,GACEkY,EAAMtb,SAASoyG,KAClBhvG,EAAUgvG,GAAc,GACxBA,EAAa,WAWjBn0G,KAAKstC,OAAS,IAAI+lE,EASlBrzG,KAAKm2C,MAAQ,IAAIi9D,EASjBpzG,KAAKo0G,KAAO,IAAIjB,EAuBhBnzG,KAAKq0G,SAAW,IAAInB,EASpBlzG,KAAKs0G,QAAU,IAAIhB,EAiBnBtzG,KAAK4zG,aAAeA,EAQpB5zG,KAAK8zG,cAAgBA,EAOrB9zG,KAAKg0G,kBAAoBA,EAWzBh0G,KAAKqd,MAAQA,EAQbrd,KAAKizG,QAAU51F,EAAMxF,OAAO,GAAIo7F,GAGhCjzG,KAAKmF,QAAU,GACfnF,KAAK8jG,UAAUqQ,GAEXhvG,GAAWnF,KAAK8K,IAAI3F,GAuB1B+uG,EAAW7zG,UAAUyK,IAAM,SAAU3F,GAEnC,OADAkY,EAAMxF,OAAO7X,KAAKmF,QAASA,GACpBnF,MAcTk0G,EAAW7zG,UAAUyjG,UAAY,SAAUyQ,GACzC,IAAiBJ,EAAbp0G,EAAOC,KAEX,GAAIqd,EAAMtb,SAASwyG,MAEjBA,EAAUh1F,EADV40F,EAAaI,IAEG,MAAM,IAAI3gG,MAAM,+BAAiCugG,EAAa,iBAGhF,IAAKI,EAAW,MAAM,IAAI3gG,MAAM,8CAchC,OAZI2gG,EAAQpvG,SAAWpF,EAAK+K,IAAIypG,EAAQpvG,SAEpCovG,EAAQC,YACVp0G,OAAOkP,KAAKilG,EAAQC,YAAY1zG,SAAQ,SAAUrB,GAC5C80G,EAAQC,WAAW/0G,GAAM2uC,OAC3BruC,EAAKN,GAAMg1G,MAAMxnB,WAAWsnB,EAAQC,WAAW/0G,GAAM2uC,OAEnDmmE,EAAQC,WAAW/0G,GAAMi1G,QAC3B30G,EAAKN,GAAMk1G,OAAO1nB,WAAWsnB,EAAQC,WAAW/0G,GAAMi1G,WAIrD10G,MAqBTk0G,EAAW7zG,UAAUysF,OAAS,SAAU/iE,EAAMgjE,GAC5C,IAAIlqF,EAAS,GAERqS,MAAM5U,QAAQypB,KAASA,EAAO,CAAEA,IAErC,CAAE,OAAQ,QAAS,UAAWjpB,SAAQ,SAAU2zB,GAC9C5xB,EAASA,EAAOgI,OAAO7K,KAAKy0B,GAAOggF,MAAM3nB,OAAO/iE,GAAM,MACrD/pB,MAEH6C,EAASA,EAAOgI,OAAO7K,KAAKstC,OAAOqnE,OAAO7nB,OAAO/iE,GAAM,IAEvD,IAAI6qF,EAAS7qF,EAAK/P,QAAO,SAAUva,GAAQ,OAAOoD,EAAOsQ,QAAQ1T,GAAQ,KAEzE,GAAIm1G,EAAOzzG,SAAW4rF,EACpB,MAAM,IAAIn5E,MAAM,iDAAmDghG,GAGrE,OAAO50G,MAWTk0G,EAAW7zG,UAAU6sF,QAAU,SAAUnjE,EAAMgjE,GAC7C,IAAIlqF,EAAS,GAERqS,MAAM5U,QAAQypB,KAASA,EAAO,CAAEA,IAErC,CAAE,OAAQ,QAAS,UAAWjpB,SAAQ,SAAU2zB,GAC9C5xB,EAASA,EAAOgI,OAAO7K,KAAKy0B,GAAOggF,MAAMvnB,QAAQnjE,GAAM,MACtD/pB,MAEH6C,EAASA,EAAOgI,OAAO7K,KAAKstC,OAAOqnE,OAAOznB,QAAQnjE,GAAM,IAExD,IAAI6qF,EAAS7qF,EAAK/P,QAAO,SAAUva,GAAQ,OAAOoD,EAAOsQ,QAAQ1T,GAAQ,KAEzE,GAAIm1G,EAAOzzG,SAAW4rF,EACpB,MAAM,IAAIn5E,MAAM,kDAAoDghG,GAEtE,OAAO50G,MAoBTk0G,EAAW7zG,UAAU40B,IAAM,SAAUiN,GACnC,IAAIjtB,EAAO,CAAEjV,MAAO6K,OAAOqK,MAAM7U,UAAU0C,MAAMvC,KAAKwC,UAAW,IAEjE,OADAk/B,EAAOv1B,MAAMu1B,EAAQjtB,GACdjV,MAmBTk0G,EAAW7zG,UAAUme,MAAQ,SAAUtQ,EAAKoH,GAC1C,GAAmB,iBAARpH,EACT,MAAM,IAAI0F,MAAM,iCAGlB,IAAIpN,EAAQ,IAAIxG,KAAKo0G,KAAKS,MAAM3mG,EAAKlO,KAAMsV,GAI3C,OAFAtV,KAAKo0G,KAAK1gG,QAAQlN,GAEXA,EAAM+mC,QAef2mE,EAAW7zG,UAAU6I,OAAS,SAAUgF,EAAKoH,GAG3C,OAFAA,EAAMA,GAAO,GAENtV,KAAKq0G,SAASnrG,OAAOlJ,KAAKwe,MAAMtQ,EAAKoH,GAAMtV,KAAKmF,QAASmQ,IAalE4+F,EAAW7zG,UAAUy0G,YAAc,SAAU5mG,EAAKoH,GAChD,IAAI9O,EAAQ,IAAIxG,KAAKo0G,KAAKS,MAAM3mG,EAAKlO,KAAMsV,GAK3C,OAHA9O,EAAMuuG,YAAa,EACnB/0G,KAAKo0G,KAAK1gG,QAAQlN,GAEXA,EAAM+mC,QAYf2mE,EAAW7zG,UAAU20G,aAAe,SAAU9mG,EAAKoH,GAGjD,OAFAA,EAAMA,GAAO,GAENtV,KAAKq0G,SAASnrG,OAAOlJ,KAAK80G,YAAY5mG,EAAKoH,GAAMtV,KAAKmF,QAASmQ,IAIxE5W,EAAOC,QAAUu1G,G,ig5BChkBjB,IAAIe,EAAc,GAsClB,SAAS33F,EAAO5F,EAAQw9F,EAASC,GAC/B,IAAIl0G,EAAGC,EAAGkhB,EAAMgzF,EAAUtmG,EACtBjM,EAAS,GAcb,IAZuB,iBAAZqyG,IAETC,EAAeD,EACfA,EAAU53F,EAAO+3F,mBAGQ,IAAhBF,IACTA,GAAc,GAGhBrmG,EA9CF,SAAwBomG,GACtB,IAAIj0G,EAAG6vB,EAAIhiB,EAAQmmG,EAAYC,GAC/B,GAAIpmG,EAAS,OAAOA,EAIpB,IAFAA,EAAQmmG,EAAYC,GAAW,GAE1Bj0G,EAAI,EAAGA,EAAI,IAAKA,IACnB6vB,EAAKltB,OAAOo4B,aAAa/6B,GAErB,cAAc6Q,KAAKgf,GAErBhiB,EAAMqG,KAAK2b,GAEXhiB,EAAMqG,KAAK,KAAO,IAAMlU,EAAEd,SAAS,IAAImgB,eAAevd,OAAO,IAIjE,IAAK9B,EAAI,EAAGA,EAAIi0G,EAAQ/zG,OAAQF,IAC9B6N,EAAMomG,EAAQxxG,WAAWzC,IAAMi0G,EAAQj0G,GAGzC,OAAO6N,EAyBCwmG,CAAeJ,GAElBj0G,EAAI,EAAGC,EAAIwW,EAAOvW,OAAQF,EAAIC,EAAGD,IAGpC,GAFAmhB,EAAO1K,EAAOhU,WAAWzC,GAErBk0G,GAAwB,KAAT/yF,GAAyBnhB,EAAI,EAAIC,GAC9C,iBAAiB4Q,KAAK4F,EAAO3U,MAAM9B,EAAI,EAAGA,EAAI,IAChD4B,GAAU6U,EAAO3U,MAAM9B,EAAGA,EAAI,GAC9BA,GAAK,OAKT,GAAImhB,EAAO,IACTvf,GAAUiM,EAAMsT,QAIlB,GAAIA,GAAQ,OAAUA,GAAQ,MAA9B,CACE,GAAIA,GAAQ,OAAUA,GAAQ,OAAUnhB,EAAI,EAAIC,IAC9Ck0G,EAAW19F,EAAOhU,WAAWzC,EAAI,KACjB,OAAUm0G,GAAY,MAAQ,CAC5CvyG,GAAU0E,mBAAmBmQ,EAAOzW,GAAKyW,EAAOzW,EAAI,IACpDA,IACA,SAGJ4B,GAAU,iBAIZA,GAAU0E,mBAAmBmQ,EAAOzW,IAGtC,OAAO4B,EAGTya,EAAO+3F,aAAiB,uBACxB/3F,EAAOi4F,eAAiB,YAGxB72G,EAAOC,QAAU2e,G,6BC3FjB,IAAIk4F,EAAc,GAwBlB,SAAStU,EAAOxpF,EAAQw9F,GACtB,IAAIpmG,EAQJ,MANuB,iBAAZomG,IACTA,EAAUhU,EAAOmU,cAGnBvmG,EA7BF,SAAwBomG,GACtB,IAAIj0G,EAAG6vB,EAAIhiB,EAAQ0mG,EAAYN,GAC/B,GAAIpmG,EAAS,OAAOA,EAIpB,IAFAA,EAAQ0mG,EAAYN,GAAW,GAE1Bj0G,EAAI,EAAGA,EAAI,IAAKA,IACnB6vB,EAAKltB,OAAOo4B,aAAa/6B,GACzB6N,EAAMqG,KAAK2b,GAGb,IAAK7vB,EAAI,EAAGA,EAAIi0G,EAAQ/zG,OAAQF,IAE9B6N,EADAgiB,EAAKokF,EAAQxxG,WAAWzC,IACZ,KAAO,IAAM6vB,EAAG3wB,SAAS,IAAImgB,eAAevd,OAAO,GAGjE,OAAO+L,EAaC2mG,CAAeP,GAEhBx9F,EAAOnU,QAAQ,qBAAqB,SAASmyG,GAClD,IAAIz0G,EAAGC,EAAGy0G,EAAIC,EAAIC,EAAIC,EAAIhkF,EACtBjvB,EAAS,GAEb,IAAK5B,EAAI,EAAGC,EAAIw0G,EAAIv0G,OAAQF,EAAIC,EAAGD,GAAK,GACtC00G,EAAKx4E,SAASu4E,EAAI3yG,MAAM9B,EAAI,EAAGA,EAAI,GAAI,KAE9B,IACP4B,GAAUiM,EAAM6mG,GAIE,MAAV,IAALA,IAAwB10G,EAAI,EAAIC,GAIf,MAAV,KAFV00G,EAAKz4E,SAASu4E,EAAI3yG,MAAM9B,EAAI,EAAGA,EAAI,GAAI,OAMnC4B,IAHFivB,EAAQ6jF,GAAM,EAAK,KAAe,GAALC,GAEnB,IACE,KAEAhyG,OAAOo4B,aAAalK,GAGhC7wB,GAAK,GAKW,MAAV,IAAL00G,IAAwB10G,EAAI,EAAIC,IAEnC00G,EAAKz4E,SAASu4E,EAAI3yG,MAAM9B,EAAI,EAAGA,EAAI,GAAI,IACvC40G,EAAK14E,SAASu4E,EAAI3yG,MAAM9B,EAAI,EAAGA,EAAI,GAAI,IAEnB,MAAV,IAAL20G,IAAuC,MAAV,IAALC,KAIzBhzG,IAHFivB,EAAQ6jF,GAAM,GAAM,MAAYC,GAAM,EAAK,KAAe,GAALC,GAE3C,MAAU/jF,GAAO,OAAUA,GAAO,MAChC,MAEAluB,OAAOo4B,aAAalK,GAGhC7wB,GAAK,GAKW,MAAV,IAAL00G,IAAwB10G,EAAI,EAAIC,IAEnC00G,EAAKz4E,SAASu4E,EAAI3yG,MAAM9B,EAAI,EAAGA,EAAI,GAAI,IACvC40G,EAAK14E,SAASu4E,EAAI3yG,MAAM9B,EAAI,EAAGA,EAAI,GAAI,IACvC60G,EAAK34E,SAASu4E,EAAI3yG,MAAM9B,EAAI,GAAIA,EAAI,IAAK,IAErB,MAAV,IAAL20G,IAAuC,MAAV,IAALC,IAAuC,MAAV,IAALC,MACnDhkF,EAAQ6jF,GAAM,GAAM,QAAcC,GAAM,GAAM,OAAaC,GAAM,EAAK,KAAe,GAALC,GAEtE,OAAWhkF,EAAM,QACzBjvB,GAAU,QAEVivB,GAAO,MACPjvB,GAAUe,OAAOo4B,aAAa,OAAUlK,GAAO,IAAK,OAAgB,KAANA,KAGhE7wB,GAAK,GAKT4B,GAAU,IAGZ,OAAOA,KAKXq+F,EAAOmU,aAAiB,cACxBnU,EAAOqU,eAAiB,GAGxB72G,EAAOC,QAAUuiG,G,6BCrHjBxiG,EAAOC,QAAU,SAAgB6I,GAC/B,IAAI3E,EAAS,GAkBb,OAhBAA,GAAU2E,EAAI4vB,UAAY,GAC1Bv0B,GAAU2E,EAAIuuG,QAAU,KAAO,GAC/BlzG,GAAU2E,EAAIsY,KAAOtY,EAAIsY,KAAO,IAAM,GAElCtY,EAAIgwB,WAA2C,IAA/BhwB,EAAIgwB,SAASrkB,QAAQ,KAEvCtQ,GAAU,IAAM2E,EAAIgwB,SAAW,IAE/B30B,GAAU2E,EAAIgwB,UAAY,GAG5B30B,GAAU2E,EAAIiwB,KAAO,IAAMjwB,EAAIiwB,KAAO,GACtC50B,GAAU2E,EAAIkwB,UAAY,GAC1B70B,GAAU2E,EAAI8vB,QAAU,GACxBz0B,GAAU2E,EAAI+vB,MAAQ,K,6BCwBxB,SAASy+E,IACPh2G,KAAKo3B,SAAW,KAChBp3B,KAAK+1G,QAAU,KACf/1G,KAAK8f,KAAO,KACZ9f,KAAKy3B,KAAO,KACZz3B,KAAKw3B,SAAW,KAChBx3B,KAAKu3B,KAAO,KACZv3B,KAAKs3B,OAAS,KACdt3B,KAAK03B,SAAW,KAOlB,IAAIu+E,EAAkB,oBAClBC,EAAc,WAGdC,EAAoB,qCAOpBC,EAAS,CAAE,IAAK,IAAK,IAAK,KAAM,IAAK,KAAMvrG,OAHlC,CAAE,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,OAMhDwrG,EAAa,CAAE,KAAOxrG,OAAOurG,GAK7BE,EAAe,CAAE,IAAK,IAAK,IAAK,IAAK,KAAMzrG,OAAOwrG,GAClDE,EAAkB,CAAE,IAAK,IAAK,KAE9BC,EAAsB,yBACtBC,EAAoB,+BAIpBC,EAAmB,CACjB,YAAc,EACd,eAAe,GAGjBC,EAAkB,CAChB,MAAQ,EACR,OAAS,EACT,KAAO,EACP,QAAU,EACV,MAAQ,EACR,SAAS,EACT,UAAU,EACV,QAAQ,EACR,WAAW,EACX,SAAS,GAYfX,EAAI31G,UAAUme,MAAQ,SAAShX,EAAKovG,GAClC,IAAI31G,EAAGC,EAAG21G,EAAYC,EAAKf,EACvBv3D,EAAOh3C,EAMX,GAFAg3C,EAAOA,EAAKn7C,QAEPuzG,GAA+C,IAA1BpvG,EAAIjB,MAAM,KAAKpF,OAAc,CAErD,IAAI41G,EAAaZ,EAAkBv3G,KAAK4/C,GACxC,GAAIu4D,EAKF,OAJA/2G,KAAK03B,SAAWq/E,EAAW,GACvBA,EAAW,KACb/2G,KAAKs3B,OAASy/E,EAAW,IAEpB/2G,KAIX,IAAI6R,EAAQokG,EAAgBr3G,KAAK4/C,GAoBjC,GAnBI3sC,IAEFglG,GADAhlG,EAAQA,EAAM,IACK8F,cACnB3X,KAAKo3B,SAAWvlB,EAChB2sC,EAAOA,EAAK1nB,OAAOjlB,EAAM1Q,UAOvBy1G,GAAqB/kG,GAAS2sC,EAAK3rC,MAAM,6BAC3CkjG,EAAgC,OAAtBv3D,EAAK1nB,OAAO,EAAG,KACRjlB,GAAS6kG,EAAiB7kG,KACzC2sC,EAAOA,EAAK1nB,OAAO,GACnB92B,KAAK+1G,SAAU,KAIdW,EAAiB7kG,KACjBkkG,GAAYlkG,IAAU8kG,EAAgB9kG,IAAU,CAkBnD,IAUIiO,EAAMk3F,EAVNC,GAAW,EACf,IAAKh2G,EAAI,EAAGA,EAAIs1G,EAAgBp1G,OAAQF,KAEzB,KADb61G,EAAMt4D,EAAKrrC,QAAQojG,EAAgBt1G,QACH,IAAbg2G,GAAkBH,EAAMG,KACzCA,EAAUH,GA0Bd,KARgB,KATdE,GAFe,IAAbC,EAEOz4D,EAAKjH,YAAY,KAIjBiH,EAAKjH,YAAY,IAAK0/D,MAM/Bn3F,EAAO0+B,EAAKz7C,MAAM,EAAGi0G,GACrBx4D,EAAOA,EAAKz7C,MAAMi0G,EAAS,GAC3Bh3G,KAAK8f,KAAOA,GAIdm3F,GAAW,EACNh2G,EAAI,EAAGA,EAAIq1G,EAAan1G,OAAQF,KAEtB,KADb61G,EAAMt4D,EAAKrrC,QAAQmjG,EAAar1G,QACA,IAAbg2G,GAAkBH,EAAMG,KACzCA,EAAUH,IAIG,IAAbG,IACFA,EAAUz4D,EAAKr9C,QAGS,MAAtBq9C,EAAKy4D,EAAU,IAAcA,IACjC,IAAI5/E,EAAOmnB,EAAKz7C,MAAM,EAAGk0G,GACzBz4D,EAAOA,EAAKz7C,MAAMk0G,GAGlBj3G,KAAKk3G,UAAU7/E,GAIfr3B,KAAKw3B,SAAWx3B,KAAKw3B,UAAY,GAIjC,IAAI2/E,EAAoC,MAArBn3G,KAAKw3B,SAAS,IACe,MAA5Cx3B,KAAKw3B,SAASx3B,KAAKw3B,SAASr2B,OAAS,GAGzC,IAAKg2G,EAAc,CACjB,IAAIC,EAAYp3G,KAAKw3B,SAASjxB,MAAM,MACpC,IAAKtF,EAAI,EAAGC,EAAIk2G,EAAUj2G,OAAQF,EAAIC,EAAGD,IAAK,CAC5C,IAAIiqB,EAAOksF,EAAUn2G,GACrB,GAAKiqB,IACAA,EAAKrY,MAAM2jG,GAAsB,CAEpC,IADA,IAAIa,EAAU,GACL/qF,EAAI,EAAG5T,EAAIwS,EAAK/pB,OAAQmrB,EAAI5T,EAAG4T,IAClCpB,EAAKxnB,WAAW4oB,GAAK,IAIvB+qF,GAAW,IAEXA,GAAWnsF,EAAKoB,GAIpB,IAAK+qF,EAAQxkG,MAAM2jG,GAAsB,CACvC,IAAIc,EAAaF,EAAUr0G,MAAM,EAAG9B,GAChCs2G,EAAUH,EAAUr0G,MAAM9B,EAAI,GAC9Bu2G,EAAMtsF,EAAKrY,MAAM4jG,GACjBe,IACFF,EAAWniG,KAAKqiG,EAAI,IACpBD,EAAQ5iF,QAAQ6iF,EAAI,KAElBD,EAAQp2G,SACVq9C,EAAO+4D,EAAQ3wG,KAAK,KAAO43C,GAE7Bx+C,KAAKw3B,SAAW8/E,EAAW1wG,KAAK,KAChC,SAMJ5G,KAAKw3B,SAASr2B,OA1LD,MA2LfnB,KAAKw3B,SAAW,IAKd2/E,IACFn3G,KAAKw3B,SAAWx3B,KAAKw3B,SAASV,OAAO,EAAG92B,KAAKw3B,SAASr2B,OAAS,IAKnE,IAAIo2B,EAAOinB,EAAKrrC,QAAQ,MACV,IAAVokB,IAEFv3B,KAAKu3B,KAAOinB,EAAK1nB,OAAOS,GACxBinB,EAAOA,EAAKz7C,MAAM,EAAGw0B,IAEvB,IAAIkgF,EAAKj5D,EAAKrrC,QAAQ,KAWtB,OAVY,IAARskG,IACFz3G,KAAKs3B,OAASknB,EAAK1nB,OAAO2gF,GAC1Bj5D,EAAOA,EAAKz7C,MAAM,EAAG00G,IAEnBj5D,IAAQx+C,KAAK03B,SAAW8mB,GACxBm4D,EAAgBE,IAChB72G,KAAKw3B,WAAax3B,KAAK03B,WACzB13B,KAAK03B,SAAW,IAGX13B,MAGTg2G,EAAI31G,UAAU62G,UAAY,SAAS7/E,GACjC,IAAII,EAAOy+E,EAAYt3G,KAAKy4B,GACxBI,IAEW,OADbA,EAAOA,EAAK,MAEVz3B,KAAKy3B,KAAOA,EAAKX,OAAO,IAE1BO,EAAOA,EAAKP,OAAO,EAAGO,EAAKl2B,OAASs2B,EAAKt2B,SAEvCk2B,IAAQr3B,KAAKw3B,SAAWH,IAG9B34B,EAAOC,QA7MP,SAAkB6I,EAAKovG,GACrB,GAAIpvG,GAAOA,aAAewuG,EAAO,OAAOxuG,EAExC,IAAIkwG,EAAI,IAAI1B,EAEZ,OADA0B,EAAEl5F,MAAMhX,EAAKovG,GACNc,I,6BC7GT/4G,EAAQg5G,IAAM54G,EAAQ,KACtBJ,EAAQi5G,GAAM74G,EAAQ,KACtBJ,EAAQk5G,GAAM94G,EAAQ,KACtBJ,EAAQ4F,EAAMxF,EAAQ,KACtBJ,EAAQm5G,EAAM/4G,EAAQ,M,cCNtBL,EAAOC,QAAQ,yN,6BCIfA,EAAQo5G,eAAuBh5G,EAAQ,KACvCJ,EAAQq5G,qBAAuBj5G,EAAQ,KACvCJ,EAAQs5G,eAAuBl5G,EAAQ,M,6BCCvCL,EAAOC,QAAU,SAAwB6H,EAAO++B,EAAO2yE,GACrD,IAAI5gE,EAAOvT,EAAOpvB,EAAQwjG,EACtBC,GAAY,EACZlpF,EAAM1oB,EAAM6xG,OACZC,EAAS9xG,EAAMuV,IAKnB,IAHAvV,EAAMuV,IAAMwpB,EAAQ,EACpB+R,EAAQ,EAED9wC,EAAMuV,IAAMmT,GAAK,CAEtB,GAAe,MADfva,EAASnO,EAAM0H,IAAIxK,WAAW8C,EAAMuV,OAGpB,MADdu7B,EACiB,CACfvT,GAAQ,EACR,MAMJ,GAFAo0E,EAAU3xG,EAAMuV,IAChBvV,EAAMgpG,GAAGliE,OAAOirE,UAAU/xG,GACX,KAAXmO,EACF,GAAIwjG,IAAY3xG,EAAMuV,IAAM,EAE1Bu7B,SACK,GAAI4gE,EAET,OADA1xG,EAAMuV,IAAMu8F,GACJ,EAYd,OAPIv0E,IACFq0E,EAAW5xG,EAAMuV,KAInBvV,EAAMuV,IAAMu8F,EAELF,I,6BCzCT,IAAI56E,EAAcz+B,EAAQ,KAAmBy+B,QACzCR,EAAcj+B,EAAQ,KAAmBi+B,YAG7Ct+B,EAAOC,QAAU,SAA8B2E,EAAKyY,EAAKmT,GACvD,IAAI9M,EAAMk1B,EAEN/R,EAAQxpB,EACRlZ,EAAS,CACP0zC,IAAI,EACJx6B,IAAK,EACLy8F,MAAO,EACPl1G,IAAK,IAGX,GAA4B,KAAxBA,EAAII,WAAWqY,GAAuB,CAExC,IADAA,IACOA,EAAMmT,GAAK,CAEhB,GAAa,MADb9M,EAAO9e,EAAII,WAAWqY,KACQyhB,EAAQpb,GAAS,OAAOvf,EACtD,GAAa,KAATuf,EAIF,OAHAvf,EAAOkZ,IAAMA,EAAM,EACnBlZ,EAAOS,IAAM05B,EAAY15B,EAAIP,MAAMwiC,EAAQ,EAAGxpB,IAC9ClZ,EAAO0zC,IAAK,EACL1zC,EAEI,KAATuf,GAAyBrG,EAAM,EAAImT,EACrCnT,GAAO,EAITA,IAIF,OAAOlZ,EAMT,IADAy0C,EAAQ,EACDv7B,EAAMmT,GAGE,MAFb9M,EAAO9e,EAAII,WAAWqY,OAKlBqG,EAAO,IAAiB,MAATA,IAEnB,GAAa,KAATA,GAAyBrG,EAAM,EAAImT,EACrCnT,GAAO,MADT,CASA,GAJa,KAATqG,GACFk1B,IAGW,KAATl1B,EAAuB,CACzB,GAAc,IAAVk1B,EAAe,MACnBA,IAGFv7B,IAGF,OAAIwpB,IAAUxpB,GACA,IAAVu7B,IAEJz0C,EAAOS,IAAM05B,EAAY15B,EAAIP,MAAMwiC,EAAOxpB,IAC1ClZ,EAAO21G,MAhEK,EAiEZ31G,EAAOkZ,IAAMA,EACblZ,EAAO0zC,IAAK,GANgB1zC,I,6BClE9B,IAAIm6B,EAAcj+B,EAAQ,KAAmBi+B,YAG7Ct+B,EAAOC,QAAU,SAAwB2E,EAAKyY,EAAKmT,GACjD,IAAI9M,EACAzN,EACA6jG,EAAQ,EACRjzE,EAAQxpB,EACRlZ,EAAS,CACP0zC,IAAI,EACJx6B,IAAK,EACLy8F,MAAO,EACPl1G,IAAK,IAGX,GAAIyY,GAAOmT,EAAO,OAAOrsB,EAIzB,GAAe,MAFf8R,EAASrR,EAAII,WAAWqY,KAEkB,KAAXpH,GAAsC,KAAXA,EAA2B,OAAO9R,EAO5F,IALAkZ,IAGe,KAAXpH,IAAmBA,EAAS,IAEzBoH,EAAMmT,GAAK,CAEhB,IADA9M,EAAO9e,EAAII,WAAWqY,MACTpH,EAKX,OAJA9R,EAAOkZ,IAAMA,EAAM,EACnBlZ,EAAO21G,MAAQA,EACf31G,EAAOS,IAAM05B,EAAY15B,EAAIP,MAAMwiC,EAAQ,EAAGxpB,IAC9ClZ,EAAO0zC,IAAK,EACL1zC,EACW,KAATuf,EACTo2F,IACkB,KAATp2F,GAAyBrG,EAAM,EAAImT,IAC5CnT,IAC4B,KAAxBzY,EAAII,WAAWqY,IACjBy8F,KAIJz8F,IAGF,OAAOlZ,I,6BCzCT,IAAIgV,EAAkB9Y,EAAQ,KAAkB8Y,OAC5CmlB,EAAkBj+B,EAAQ,KAAkBi+B,YAC5CK,EAAkBt+B,EAAQ,KAAkBs+B,WAK5Co7E,EAAgB,GAgHpB,SAASvF,IA8BPlzG,KAAKouC,MAAQv2B,EAAO,GAAI4gG,GA3I1BA,EAAcC,YAAc,SAAUnrE,EAAQy/C,EAAK7nF,EAASmQ,EAAKqjG,GAC/D,IAAI5gF,EAAQwV,EAAOy/C,GAEnB,MAAQ,QAAU2rB,EAAIC,YAAY7gF,GAAS,IACnCsF,EAAWkQ,EAAOy/C,GAAKvpF,SACvB,WAIVg1G,EAAcI,WAAa,SAAUtrE,EAAQy/C,EAAK7nF,EAASmQ,EAAKqjG,GAC9D,IAAI5gF,EAAQwV,EAAOy/C,GAEnB,MAAQ,OAAS2rB,EAAIC,YAAY7gF,GAAS,UAClCsF,EAAWkQ,EAAOy/C,GAAKvpF,SACvB,mBAIVg1G,EAAcK,MAAQ,SAAUvrE,EAAQy/C,EAAK7nF,EAASmQ,EAAKqjG,GACzD,IAGI7T,EAAa7jG,EAAG83G,EAAUC,EAH1BjhF,EAAQwV,EAAOy/C,GACfQ,EAAOz1D,EAAMy1D,KAAOxwD,EAAYjF,EAAMy1D,MAAMnqF,OAAS,GACrD41G,EAAW,GAaf,OAVIzrB,IACFyrB,EAAWzrB,EAAKjnF,MAAM,QAAQ,IASI,KALlCu+F,EADE3/F,EAAQm9F,WACIn9F,EAAQm9F,UAAUvqE,EAAMt0B,QAASw1G,IAEjC57E,EAAWtF,EAAMt0B,UAGjB0P,QAAQ,QACf2xF,EAAc,KAMnBtX,GACFvsF,EAAW82B,EAAM21D,UAAU,SAC3BqrB,EAAWhhF,EAAM+P,MAAQ/P,EAAM+P,MAAM/kC,QAAU,GAE3C9B,EAAI,EACN83G,EAAS5jG,KAAK,CAAE,QAAShQ,EAAQ+zG,WAAaD,IAE9CF,EAAS93G,GAAG,IAAM,IAAMkE,EAAQ+zG,WAAaD,EAI/CD,EAAW,CACTlxE,MAAOixE,GAGD,aAAeJ,EAAIC,YAAYI,GAAY,IAC3ClU,EACA,mBAIF,aAAe6T,EAAIC,YAAY7gF,GAAS,IACxC+sE,EACA,mBAIV2T,EAAcp7C,MAAQ,SAAU9vB,EAAQy/C,EAAK7nF,EAASmQ,EAAKqjG,GACzD,IAAI5gF,EAAQwV,EAAOy/C,GAUnB,OAHAj1D,EAAM+P,MAAM/P,EAAM21D,UAAU,QAAQ,GAClCirB,EAAIQ,mBAAmBphF,EAAMujC,SAAUn2D,EAASmQ,GAE3CqjG,EAAIS,YAAY7rE,EAAQy/C,EAAK7nF,IAItCszG,EAAcY,UAAY,SAAU9rE,EAAQy/C,EAAK7nF,GAC/C,OAAOA,EAAQm0G,SAAW,WAAa,UAEzCb,EAAcc,UAAY,SAAUhsE,EAAQy/C,EAAK7nF,GAC/C,OAAOA,EAAQq0G,OAAUr0G,EAAQm0G,SAAW,WAAa,SAAY,MAIvEb,EAAcl4E,KAAO,SAAUgN,EAAQy/C,GACrC,OAAO3vD,EAAWkQ,EAAOy/C,GAAKvpF,UAIhCg1G,EAAcgB,WAAa,SAAUlsE,EAAQy/C,GAC3C,OAAOz/C,EAAOy/C,GAAKvpF,SAErBg1G,EAAciB,YAAc,SAAUnsE,EAAQy/C,GAC5C,OAAOz/C,EAAOy/C,GAAKvpF,SAgDrByvG,EAAS7yG,UAAUu4G,YAAc,SAAqB7gF,GACpD,IAAI92B,EAAGC,EAAG2B,EAEV,IAAKk1B,EAAM+P,MAAS,MAAO,GAI3B,IAFAjlC,EAAS,GAEJ5B,EAAI,EAAGC,EAAI62B,EAAM+P,MAAM3mC,OAAQF,EAAIC,EAAGD,IACzC4B,GAAU,IAAMw6B,EAAWtF,EAAM+P,MAAM7mC,GAAG,IAAM,KAAOo8B,EAAWtF,EAAM+P,MAAM7mC,GAAG,IAAM,IAGzF,OAAO4B,GAaTqwG,EAAS7yG,UAAU+4G,YAAc,SAAqB7rE,EAAQy/C,EAAK7nF,GACjE,IAAIw0G,EACA92G,EAAS,GACT+2G,GAAS,EACT7hF,EAAQwV,EAAOy/C,GAGnB,OAAIj1D,EAAM01D,OACD,IAUL11D,EAAMoe,QAA4B,IAAnBpe,EAAMu1D,SAAkBN,GAAOz/C,EAAOy/C,EAAM,GAAGS,SAChE5qF,GAAU,MAIZA,KAA8B,IAAnBk1B,EAAMu1D,QAAiB,KAAO,KAAOv1D,EAAMpc,IAGtD9Y,GAAU7C,KAAK44G,YAAY7gF,GAGL,IAAlBA,EAAMu1D,SAAiBnoF,EAAQm0G,WACjCz2G,GAAU,MAIRk1B,EAAMoe,QACRyjE,GAAS,EAEa,IAAlB7hF,EAAMu1D,SACJN,EAAM,EAAIz/C,EAAOpsC,SAGI,YAFvBw4G,EAAYpsE,EAAOy/C,EAAM,IAEXjlF,MAAqB4xG,EAAUlsB,SAKX,IAAvBksB,EAAUrsB,SAAkBqsB,EAAUh+F,MAAQoc,EAAMpc,OAF7Di+F,GAAS,IAWjB/2G,GAAU+2G,EAAS,MAAQ,MAc7B1G,EAAS7yG,UAAU20G,aAAe,SAAUznE,EAAQpoC,EAASmQ,GAK3D,IAJA,IAAIvN,EACAlF,EAAS,GACTurC,EAAQpuC,KAAKouC,MAERntC,EAAI,EAAGwT,EAAM84B,EAAOpsC,OAAQF,EAAIwT,EAAKxT,SAGjB,IAAhBmtC,EAFXrmC,EAAOwlC,EAAOtsC,GAAG8G,MAGflF,GAAUurC,EAAMrmC,GAAMwlC,EAAQtsC,EAAGkE,EAASmQ,EAAKtV,MAE/C6C,GAAU7C,KAAKo5G,YAAY7rE,EAAQtsC,EAAGkE,GAI1C,OAAOtC,GAcTqwG,EAAS7yG,UAAU84G,mBAAqB,SAAU5rE,EAAQpoC,EAASmQ,GAGjE,IAFA,IAAIzS,EAAS,GAEJ5B,EAAI,EAAGwT,EAAM84B,EAAOpsC,OAAQF,EAAIwT,EAAKxT,IACrB,SAAnBssC,EAAOtsC,GAAG8G,KACZlF,GAAU0qC,EAAOtsC,GAAGwC,QACQ,UAAnB8pC,EAAOtsC,GAAG8G,OACnBlF,GAAU7C,KAAKm5G,mBAAmB5rE,EAAOtsC,GAAGq6D,SAAUn2D,EAASmQ,IAInE,OAAOzS,GAaTqwG,EAAS7yG,UAAU6I,OAAS,SAAUqkC,EAAQpoC,EAASmQ,GACrD,IAAIrU,EAAGwT,EAAK1M,EACRlF,EAAS,GACTurC,EAAQpuC,KAAKouC,MAEjB,IAAKntC,EAAI,EAAGwT,EAAM84B,EAAOpsC,OAAQF,EAAIwT,EAAKxT,IAG3B,YAFb8G,EAAOwlC,EAAOtsC,GAAG8G,MAGflF,GAAU7C,KAAKg1G,aAAaznE,EAAOtsC,GAAGq6D,SAAUn2D,EAASmQ,QACzB,IAAhB84B,EAAMrmC,GACtBlF,GAAUurC,EAAMb,EAAOtsC,GAAG8G,MAAMwlC,EAAQtsC,EAAGkE,EAASmQ,EAAKtV,MAEzD6C,GAAU7C,KAAKo5G,YAAY7rE,EAAQtsC,EAAGkE,EAASmQ,GAInD,OAAOzS,GAGTnE,EAAOC,QAAUu0G,G,6BCrUjB,IAAIjnB,EAASltF,EAAQ,KAGjB86G,EAAS,CACX,CAAE,YAAkB96G,EAAQ,MAC5B,CAAE,QAAkBA,EAAQ,MAC5B,CAAE,SAAkBA,EAAQ,MAC5B,CAAE,UAAkBA,EAAQ,MAC5B,CAAE,eAAkBA,EAAQ,MAC5B,CAAE,cAAkBA,EAAQ,OAO9B,SAAS+6G,IAMP95G,KAAKy0G,MAAQ,IAAIxoB,EAEjB,IAAK,IAAIhrF,EAAI,EAAGA,EAAI44G,EAAO14G,OAAQF,IACjCjB,KAAKy0G,MAAMt/F,KAAK0kG,EAAO54G,GAAG,GAAI44G,EAAO54G,GAAG,IAU5C64G,EAAKz5G,UAAUqT,QAAU,SAAUlN,GACjC,IAAIvF,EAAGC,EAAGktC,EAIV,IAAKntC,EAAI,EAAGC,GAFZktC,EAAQpuC,KAAKy0G,MAAMtnB,SAAS,KAENhsF,OAAQF,EAAIC,EAAGD,IACnCmtC,EAAMntC,GAAGuF,IAIbszG,EAAKz5G,UAAUw0G,MAAQ91G,EAAQ,KAG/BL,EAAOC,QAAUm7G,G,6BCpDjB,IAAIC,EAAe,sCACfC,EAAe,UAGnBt7G,EAAOC,QAAU,SAAgB6H,GAC/B,IAAIlD,EAMJA,GAHAA,EAAMkD,EAAM0H,IAAI3K,QAAQw2G,EAAa,OAG3Bx2G,QAAQy2G,EAAS,KAE3BxzG,EAAM0H,IAAM5K,I,6BCfd5E,EAAOC,QAAU,SAAe6H,GAC9B,IAAIuxB,EAEAvxB,EAAMuuG,aACRh9E,EAAiB,IAAIvxB,EAAM6mF,MAAM,SAAU,GAAI,IACzC5pF,QAAW+C,EAAM0H,IACvB6pB,EAAMhe,IAAW,CAAE,EAAG,GACtBge,EAAMujC,SAAW,GACjB90D,EAAM+mC,OAAOp4B,KAAK4iB,IAElBvxB,EAAMgpG,GAAGr5D,MAAM33B,MAAMhY,EAAM0H,IAAK1H,EAAMgpG,GAAIhpG,EAAM8O,IAAK9O,EAAM+mC,U,6BCX/D7uC,EAAOC,QAAU,SAAgB6H,GAC/B,IAA2BynC,EAAKhtC,EAAGC,EAA/BqsC,EAAS/mC,EAAM+mC,OAGnB,IAAKtsC,EAAI,EAAGC,EAAIqsC,EAAOpsC,OAAQF,EAAIC,EAAGD,IAEnB,YADjBgtC,EAAMV,EAAOtsC,IACL8G,MACNvB,EAAMgpG,GAAGliE,OAAO9uB,MAAMyvB,EAAIxqC,QAAS+C,EAAMgpG,GAAIhpG,EAAM8O,IAAK24B,EAAIqtB,Y,6BCFlE,IAAIh+B,EAAiBv+B,EAAQ,KAAmBu+B,eAMhD,SAAS28E,EAAY32G,GACnB,MAAO,aAAawO,KAAKxO,GAI3B5E,EAAOC,QAAU,SAAiB6H,GAChC,IAAIvF,EAAGqrB,EAAGprB,EAAGqsC,EAAQxV,EAAOmiF,EAAcryE,EAAOsyE,EAAI55E,EAAMxkB,EAAKq+F,EAC5D9iE,EAAO+iE,EAAe7yG,EAAK8yG,EAASC,EAEpCC,EAZcl3G,EAWdm3G,EAAcj0G,EAAM+mC,OAGxB,GAAK/mC,EAAMgpG,GAAGrqG,QAAQmvG,QAEtB,IAAKhoF,EAAI,EAAGprB,EAAIu5G,EAAYt5G,OAAQmrB,EAAIprB,EAAGorB,IACzC,GAA4B,WAAxBmuF,EAAYnuF,GAAGvkB,MACdvB,EAAMgpG,GAAG8E,QAAQoG,QAAQD,EAAYnuF,GAAG7oB,SAU7C,IAJA42G,EAAgB,EAIXp5G,GANLssC,EAASktE,EAAYnuF,GAAGgvC,UAMRn6D,OAAS,EAAGF,GAAK,EAAGA,IAIlC,GAA0B,gBAH1Bi5G,EAAe3sE,EAAOtsC,IAGL8G,MAiBjB,GAR0B,gBAAtBmyG,EAAanyG,OAzCHzE,EA0CG42G,EAAaz2G,QAzC3B,YAAYqO,KAAKxO,IAyCsB+2G,EAAgB,GACtDA,IAEEJ,EAAYC,EAAaz2G,UAC3B42G,OAGAA,EAAgB,IAEM,SAAtBH,EAAanyG,MAAmBvB,EAAMgpG,GAAG8E,QAAQxiG,KAAKooG,EAAaz2G,SAAU,CAU/E,IARA88B,EAAO25E,EAAaz2G,QACpB+2G,EAAQh0G,EAAMgpG,GAAG8E,QAAQzhG,MAAM0tB,GAG/BsH,EAAQ,GACRyP,EAAQ4iE,EAAa5iE,MACrB8iE,EAAU,EAELD,EAAK,EAAGA,EAAKK,EAAMr5G,OAAQg5G,IAE9B3yG,EAAMgzG,EAAML,GAAI3yG,IAChB8yG,EAAU9zG,EAAMgpG,GAAGsE,cAActsG,GAC5BhB,EAAMgpG,GAAGoE,aAAa0G,KAE3BC,EAAUC,EAAML,GAAI55E,KAWlBg6E,EALGC,EAAML,GAAI15E,OAEiB,YAArB+5E,EAAML,GAAI15E,QAAyB,YAAY3uB,KAAKyoG,GAGnD/zG,EAAMgpG,GAAGwE,kBAAkBuG,GAF3B/zG,EAAMgpG,GAAGwE,kBAAkB,UAAYuG,GAASh3G,QAAQ,WAAY,IAFpEiD,EAAMgpG,GAAGwE,kBAAkB,UAAYuG,GAASh3G,QAAQ,aAAc,KAOlFwY,EAAMy+F,EAAML,GAAI9mG,OAEN+mG,KACRriF,EAAgB,IAAIvxB,EAAM6mF,MAAM,OAAQ,GAAI,IACtC5pF,QAAU88B,EAAKx9B,MAAMq3G,EAASr+F,GACpCgc,EAAMuf,MAAUA,EAChBzP,EAAM1yB,KAAK4iB,KAGbA,EAAgB,IAAIvxB,EAAM6mF,MAAM,YAAa,IAAK,IAC5CvlD,MAAU,CAAE,CAAE,OAAQwyE,IAC5BviF,EAAMuf,MAAUA,IAChBvf,EAAMw1D,OAAU,UAChBx1D,EAAMy1D,KAAU,OAChB3lD,EAAM1yB,KAAK4iB,IAEXA,EAAgB,IAAIvxB,EAAM6mF,MAAM,OAAQ,GAAI,IACtC5pF,QAAU82G,EAChBxiF,EAAMuf,MAAUA,EAChBzP,EAAM1yB,KAAK4iB,IAEXA,EAAgB,IAAIvxB,EAAM6mF,MAAM,aAAc,KAAM,IAC9C/1C,QAAYA,EAClBvf,EAAMw1D,OAAU,UAChBx1D,EAAMy1D,KAAU,OAChB3lD,EAAM1yB,KAAK4iB,GAEXqiF,EAAUI,EAAML,GAAI3nG,WAElB4nG,EAAU75E,EAAKp/B,UACjB42B,EAAgB,IAAIvxB,EAAM6mF,MAAM,OAAQ,GAAI,IACtC5pF,QAAU88B,EAAKx9B,MAAMq3G,GAC3BriF,EAAMuf,MAAUA,EAChBzP,EAAM1yB,KAAK4iB,IAIb0iF,EAAYnuF,GAAGgvC,SAAW/tB,EAASjQ,EAAeiQ,EAAQtsC,EAAG4mC,SApF7D,IADA5mC,IACOssC,EAAOtsC,GAAGq2C,QAAU4iE,EAAa5iE,OAA4B,cAAnB/J,EAAOtsC,GAAG8G,MACzD9G,M,6BC5BV,IAAI05G,EAAU,+BAIVC,EAAsB,kBAEtBC,EAAiB,mBACjBC,EAAc,CAChBpuG,EAAG,IACHpF,EAAG,IACH6mB,EAAG,IACH4sF,GAAI,KAGN,SAASC,EAAUnoG,EAAOpT,GACxB,OAAOq7G,EAAYr7G,EAAKkY,eAG1B,SAASsjG,EAAeC,GACtB,IAAIj6G,EAAG82B,EAAOojF,EAAkB,EAEhC,IAAKl6G,EAAIi6G,EAAa/5G,OAAS,EAAGF,GAAK,EAAGA,IAGrB,UAFnB82B,EAAQmjF,EAAaj6G,IAEX8G,MAAoBozG,IAC5BpjF,EAAMt0B,QAAUs0B,EAAMt0B,QAAQF,QAAQs3G,EAAgBG,IAGrC,cAAfjjF,EAAMhwB,MAAuC,SAAfgwB,EAAMy1D,MACtC2tB,IAGiB,eAAfpjF,EAAMhwB,MAAwC,SAAfgwB,EAAMy1D,MACvC2tB,IAKN,SAASC,EAAaF,GACpB,IAAIj6G,EAAG82B,EAAOojF,EAAkB,EAEhC,IAAKl6G,EAAIi6G,EAAa/5G,OAAS,EAAGF,GAAK,EAAGA,IAGrB,UAFnB82B,EAAQmjF,EAAaj6G,IAEX8G,MAAoBozG,GACxBR,EAAQ7oG,KAAKimB,EAAMt0B,WACrBs0B,EAAMt0B,QAAUs0B,EAAMt0B,QACTF,QAAQ,OAAQ,KAGhBA,QAAQ,UAAW,KAAKA,QAAQ,WAAY,QAC5CA,QAAQ,cAAe,UAAUA,QAAQ,SAAU,KAEnDA,QAAQ,wBAAyB,SAEjCA,QAAQ,mBAAoB,SAC5BA,QAAQ,2BAA4B,UAIlC,cAAfw0B,EAAMhwB,MAAuC,SAAfgwB,EAAMy1D,MACtC2tB,IAGiB,eAAfpjF,EAAMhwB,MAAwC,SAAfgwB,EAAMy1D,MACvC2tB,IAMNz8G,EAAOC,QAAU,SAAiB6H,GAChC,IAAI60G,EAEJ,GAAK70G,EAAMgpG,GAAGrqG,QAAQm2G,YAEtB,IAAKD,EAAS70G,EAAM+mC,OAAOpsC,OAAS,EAAGk6G,GAAU,EAAGA,IAEhB,WAA9B70G,EAAM+mC,OAAO8tE,GAAQtzG,OAErB6yG,EAAoB9oG,KAAKtL,EAAM+mC,OAAO8tE,GAAQ53G,UAChDw3G,EAAez0G,EAAM+mC,OAAO8tE,GAAQ//C,UAGlCq/C,EAAQ7oG,KAAKtL,EAAM+mC,OAAO8tE,GAAQ53G,UACpC23G,EAAa50G,EAAM+mC,OAAO8tE,GAAQ//C,a,6BCjGxC,IAAI79B,EAAiB1+B,EAAQ,KAAmB0+B,aAC5CE,EAAiB5+B,EAAQ,KAAmB4+B,YAC5CD,EAAiB3+B,EAAQ,KAAmB2+B,eAE5C69E,EAAgB,OAChBC,EAAW,QAIf,SAASC,EAAUn4G,EAAK+P,EAAOyd,GAC7B,OAAOxtB,EAAIwzB,OAAO,EAAGzjB,GAASyd,EAAKxtB,EAAIwzB,OAAOzjB,EAAQ,GAGxD,SAASqoG,EAAgBnuE,EAAQ/mC,GAC/B,IAAIvF,EAAG82B,EAAOwI,EAAMhd,EAAGxH,EAAKmT,EAAKysF,EAAW3xF,EAAM4xF,EAAUC,EACxDC,EAAiBC,EAAiBC,EAAkBC,EACpDC,EAASC,EAAU7vF,EAAG8vF,EAAUrmF,EAAOsmF,EAAWC,EAItD,IAFAvmF,EAAQ,GAEH90B,EAAI,EAAGA,EAAIssC,EAAOpsC,OAAQF,IAAK,CAKlC,IAJA82B,EAAQwV,EAAOtsC,GAEf06G,EAAYpuE,EAAOtsC,GAAGq2C,MAEjBhrB,EAAIyJ,EAAM50B,OAAS,EAAGmrB,GAAK,KAC1ByJ,EAAMzJ,GAAGgrB,OAASqkE,GADWrvF,KAKnC,GAFAyJ,EAAM50B,OAASmrB,EAAI,EAEA,SAAfyL,EAAMhwB,KAAV,CAGAgU,EAAM,EACNmT,GAFAqR,EAAOxI,EAAMt0B,SAEFtC,OAGXo7G,EACA,KAAOxgG,EAAMmT,IACXssF,EAAShpG,UAAYuJ,EACrBwH,EAAIi4F,EAAS58G,KAAK2hC,KAFF,CAchB,GATA27E,EAAUC,GAAW,EACrBpgG,EAAMwH,EAAElQ,MAAQ,EAChB+oG,EAAqB,MAAT74F,EAAE,GAKdq4F,EAAW,GAEPr4F,EAAElQ,MAAQ,GAAK,EACjBuoG,EAAWr7E,EAAK78B,WAAW6f,EAAElQ,MAAQ,QAErC,IAAKiZ,EAAIrrB,EAAI,EAAGqrB,GAAK,IACI,cAAnBihB,EAAOjhB,GAAGvkB,MAA2C,cAAnBwlC,EAAOjhB,GAAGvkB,MAD1BukB,IAEtB,GAAuB,SAAnBihB,EAAOjhB,GAAGvkB,KAAd,CAEA6zG,EAAWruE,EAAOjhB,GAAG7oB,QAAQC,WAAW6pC,EAAOjhB,GAAG7oB,QAAQtC,OAAS,GACnE,MASJ,GAFA06G,EAAW,GAEP9/F,EAAMmT,EACR2sF,EAAWt7E,EAAK78B,WAAWqY,QAE3B,IAAKuQ,EAAIrrB,EAAI,EAAGqrB,EAAIihB,EAAOpsC,SACF,cAAnBosC,EAAOjhB,GAAGvkB,MAA2C,cAAnBwlC,EAAOjhB,GAAGvkB,MADfukB,IAEjC,GAAuB,SAAnBihB,EAAOjhB,GAAGvkB,KAAd,CAEA8zG,EAAWtuE,EAAOjhB,GAAG7oB,QAAQC,WAAW,GACxC,MAuCJ,GAnCAo4G,EAAkBp+E,EAAek+E,IAAaj+E,EAAY/5B,OAAOo4B,aAAa4/E,IAC9EG,EAAkBr+E,EAAem+E,IAAal+E,EAAY/5B,OAAOo4B,aAAa6/E,IAE9EG,EAAmBv+E,EAAam+E,IAChCK,EAAmBx+E,EAAao+E,IAG9BK,GAAU,EACDH,IACHC,GAAoBF,IACxBI,GAAU,IAIVF,EACFG,GAAW,EACFL,IACHG,GAAoBF,IACxBI,GAAW,IAIE,KAAbN,GAAsC,MAATt4F,EAAE,IAC7Bq4F,GAAY,IAAgBA,GAAY,KAE1CO,EAAWD,GAAU,GAIrBA,GAAWC,IAEbD,GAAU,EACVC,EAAWJ,GAGRG,GAAYC,EAAjB,CAQA,GAAIA,EAEF,IAAK7vF,EAAIyJ,EAAM50B,OAAS,EAAGmrB,GAAK,IAC9BtC,EAAO+L,EAAMzJ,KACTyJ,EAAMzJ,GAAGgrB,MAAQqkE,IAFYrvF,IAGjC,GAAItC,EAAKwyF,SAAWJ,GAAYrmF,EAAMzJ,GAAGgrB,QAAUqkE,EAAW,CAC5D3xF,EAAO+L,EAAMzJ,GAET8vF,GACFC,EAAY71G,EAAMgpG,GAAGrqG,QAAQs3G,OAAO,GACpCH,EAAa91G,EAAMgpG,GAAGrqG,QAAQs3G,OAAO,KAErCJ,EAAY71G,EAAMgpG,GAAGrqG,QAAQs3G,OAAO,GACpCH,EAAa91G,EAAMgpG,GAAGrqG,QAAQs3G,OAAO,IAMvC1kF,EAAMt0B,QAAUg4G,EAAU1jF,EAAMt0B,QAAS8f,EAAElQ,MAAOipG,GAClD/uE,EAAOvjB,EAAK+N,OAAOt0B,QAAUg4G,EAC3BluE,EAAOvjB,EAAK+N,OAAOt0B,QAASumB,EAAKjO,IAAKsgG,GAExCtgG,GAAOugG,EAAWn7G,OAAS,EACvB6oB,EAAK+N,QAAU92B,IAAK8a,GAAOsgG,EAAUl7G,OAAS,GAGlD+tB,GADAqR,EAAOxI,EAAMt0B,SACFtC,OAEX40B,EAAM50B,OAASmrB,EACf,SAASiwF,EAKXL,EACFnmF,EAAM5gB,KAAK,CACT4iB,MAAO92B,EACP8a,IAAKwH,EAAElQ,MACPmpG,OAAQJ,EACR9kE,MAAOqkE,IAEAQ,GAAYC,IACrBrkF,EAAMt0B,QAAUg4G,EAAU1jF,EAAMt0B,QAAS8f,EAAElQ,MAjKlC,WAgHL+oG,IACFrkF,EAAMt0B,QAAUg4G,EAAU1jF,EAAMt0B,QAAS8f,EAAElQ,MAjHpC,SAwKjB3U,EAAOC,QAAU,SAAqB6H,GAEpC,IAAI60G,EAEJ,GAAK70G,EAAMgpG,GAAGrqG,QAAQm2G,YAEtB,IAAKD,EAAS70G,EAAM+mC,OAAOpsC,OAAS,EAAGk6G,GAAU,EAAGA,IAEhB,WAA9B70G,EAAM+mC,OAAO8tE,GAAQtzG,MACpBwzG,EAAczpG,KAAKtL,EAAM+mC,OAAO8tE,GAAQ53G,UAI7Ci4G,EAAgBl1G,EAAM+mC,OAAO8tE,GAAQ//C,SAAU90D,K,6BC5LnD,IAAI6mF,EAAQtuF,EAAQ,KAGpB,SAAS29G,EAAUxuG,EAAKshG,EAAIl6F,GAC1BtV,KAAKkO,IAAMA,EACXlO,KAAKsV,IAAMA,EACXtV,KAAKutC,OAAS,GACdvtC,KAAK+0G,YAAa,EAClB/0G,KAAKwvG,GAAKA,EAIZkN,EAAUr8G,UAAUgtF,MAAQA,EAG5B3uF,EAAOC,QAAU+9G,G,6BCXjB,IAAIzwB,EAAkBltF,EAAQ,KAG1B86G,EAAS,CAGX,CAAE,QAAc96G,EAAQ,KAA6B,CAAE,YAAa,cACpE,CAAE,OAAcA,EAAQ,MACxB,CAAE,QAAcA,EAAQ,KAA6B,CAAE,YAAa,YAAa,aAAc,SAC/F,CAAE,aAAcA,EAAQ,KAA6B,CAAE,YAAa,YAAa,aAAc,SAC/F,CAAE,KAAcA,EAAQ,KAA6B,CAAE,YAAa,YAAa,aAAc,SAC/F,CAAE,OAAcA,EAAQ,KAA6B,CAAE,YAAa,YAAa,eACjF,CAAE,YAAcA,EAAQ,MACxB,CAAE,UAAcA,EAAQ,KAA6B,CAAE,YAAa,YAAa,eACjF,CAAE,WAAcA,EAAQ,MACxB,CAAE,aAAcA,EAAQ,KAA6B,CAAE,YAAa,YAAa,eACjF,CAAE,YAAcA,EAAQ,OAO1B,SAASq0G,IAMPpzG,KAAKy0G,MAAQ,IAAIxoB,EAEjB,IAAK,IAAIhrF,EAAI,EAAGA,EAAI44G,EAAO14G,OAAQF,IACjCjB,KAAKy0G,MAAMt/F,KAAK0kG,EAAO54G,GAAG,GAAI44G,EAAO54G,GAAG,GAAI,CAAE87D,KAAM88C,EAAO54G,GAAG,IAAM,IAAI8B,UAO5EqwG,EAAY/yG,UAAUkhG,SAAW,SAAU/6F,EAAOm2G,EAAWC,GAQ3D,IAPA,IAAQ37G,EACJmtC,EAAQpuC,KAAKy0G,MAAMtnB,SAAS,IAC5B14E,EAAM25B,EAAMjtC,OACZ01B,EAAO8lF,EACPE,GAAgB,EAChBC,EAAat2G,EAAMgpG,GAAGrqG,QAAQ23G,WAE3BjmF,EAAO+lF,IACZp2G,EAAMqwB,KAAOA,EAAOrwB,EAAMu2G,eAAelmF,KACrCA,GAAQ+lF,OAIRp2G,EAAMw2G,OAAOnmF,GAAQrwB,EAAMy2G,YANV,CAUrB,GAAIz2G,EAAM8wC,OAASwlE,EAAY,CAC7Bt2G,EAAMqwB,KAAO+lF,EACb,MAUF,IAAK37G,EAAI,EAAGA,EAAIwT,IACT25B,EAAMntC,GAAGuF,EAAOqwB,EAAM+lF,GAAS,GADjB37G,KAOrBuF,EAAM02G,OAASL,EAGXr2G,EAAMq1F,QAAQr1F,EAAMqwB,KAAO,KAC7BgmF,GAAgB,IAGlBhmF,EAAOrwB,EAAMqwB,MAEF+lF,GAAWp2G,EAAMq1F,QAAQhlE,KAClCgmF,GAAgB,EAChBhmF,IACArwB,EAAMqwB,KAAOA,KAWnBu8E,EAAY/yG,UAAUme,MAAQ,SAAUtQ,EAAKshG,EAAIl6F,EAAK6nG,GACpD,IAAI32G,EAEC0H,IAEL1H,EAAQ,IAAIxG,KAAK60G,MAAM3mG,EAAKshG,EAAIl6F,EAAK6nG,GAErCn9G,KAAKuhG,SAAS/6F,EAAOA,EAAMqwB,KAAMrwB,EAAM42G,WAIzChK,EAAY/yG,UAAUw0G,MAAQ91G,EAAQ,KAGtCL,EAAOC,QAAUy0G,G,6BCrHjB,IAAI51E,EAAUz+B,EAAQ,KAAmBy+B,QAGzC,SAAS6/E,EAAQ72G,EAAOqwB,GACtB,IAAI9a,EAAMvV,EAAM82G,OAAOzmF,GAAQrwB,EAAMy2G,UACjC/tF,EAAM1oB,EAAM+2G,OAAO1mF,GAEvB,OAAOrwB,EAAM0H,IAAI4oB,OAAO/a,EAAKmT,EAAMnT,GAGrC,SAASyhG,EAAal6G,GACpB,IAGIwtB,EAHAjuB,EAAS,GACTkZ,EAAM,EACNmT,EAAM5rB,EAAInC,OAEVs8G,EAAU,EACVrD,EAAU,EACVsD,GAAa,EACbC,EAAe,EAInB,IAFA7sF,EAAMxtB,EAAII,WAAWqY,GAEdA,EAAMmT,GACA,KAAP4B,EACE4sF,GAGFA,GAAa,EACbC,EAAe5hG,GACN0hG,EAAU,GAAM,IACzBC,GAAa,EACbC,EAAe5hG,GAED,MAAP+U,GAAuB2sF,EAAU,GAAM,GAAOC,IACvD76G,EAAOsS,KAAK7R,EAAIuvF,UAAUunB,EAASr+F,IACnCq+F,EAAUr+F,EAAM,GAGP,KAAP+U,EACF2sF,IAEAA,EAAU,IAGZ1hG,IAIYmT,GAAOwuF,IACjBA,GAAa,EACb3hG,EAAM4hG,EAAe,GAGvB7sF,EAAKxtB,EAAII,WAAWqY,GAKtB,OAFAlZ,EAAOsS,KAAK7R,EAAIuvF,UAAUunB,IAEnBv3G,EAITnE,EAAOC,QAAU,SAAe6H,EAAOm2G,EAAWC,EAASrzD,GACzD,IAAIz4B,EAAI8sF,EAAU7hG,EAAK9a,EAAG48G,EAAUC,EAASC,EAAahmF,EACtDimF,EAAQz6F,EAAG06F,EAAYC,EAG3B,GAAIvB,EAAY,EAAIC,EAAW,OAAO,EAItC,GAFAiB,EAAWlB,EAAY,EAEnBn2G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,UAAa,OAAO,EAGvD,GAAIz2G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,WAAa,EAAK,OAAO,EAO5D,IADAlhG,EAAMvV,EAAM82G,OAAOO,GAAYr3G,EAAM23G,OAAON,KACjCr3G,EAAM+2G,OAAOM,GAAa,OAAO,EAG5C,GAAW,OADX/sF,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,OACO,KAAP+U,GAA6B,KAAPA,EAAsB,OAAO,EAE7E,KAAO/U,EAAMvV,EAAM+2G,OAAOM,IAAW,CAGnC,GAAW,OAFX/sF,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,KAEO,KAAP+U,GAA6B,KAAPA,IAAuB0M,EAAQ1M,GAAO,OAAO,EAE7F/U,IAOF,IAFA+hG,GAFAF,EAAWP,EAAQ72G,EAAOm2G,EAAY,IAEnBp2G,MAAM,KACzBy3G,EAAS,GACJ/8G,EAAI,EAAGA,EAAI68G,EAAQ38G,OAAQF,IAAK,CAEnC,KADAsiB,EAAIu6F,EAAQ78G,GAAGoC,QACP,CAGN,GAAU,IAANpC,GAAWA,IAAM68G,EAAQ38G,OAAS,EACpC,SAEA,OAAO,EAIX,IAAK,WAAW2Q,KAAKyR,GAAM,OAAO,EACC,KAA/BA,EAAE7f,WAAW6f,EAAEpiB,OAAS,GAC1B68G,EAAO7oG,KAAyB,KAApBoO,EAAE7f,WAAW,GAAqB,SAAW,SAC5B,KAApB6f,EAAE7f,WAAW,GACtBs6G,EAAO7oG,KAAK,QAEZ6oG,EAAO7oG,KAAK,IAKhB,IAA+B,KAD/ByoG,EAAWP,EAAQ72G,EAAOm2G,GAAWt5G,QACxB8P,QAAQ,KAAe,OAAO,EAC3C,GAAI3M,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAM7D,IADAc,GAJAD,EAAUN,EAAaI,EAASr6G,QAAQ,WAAY,MAI9BpC,QACJ68G,EAAO78G,OAAU,OAAO,EAE1C,GAAIooD,EAAU,OAAO,EAWrB,KATAxxB,EAAYvxB,EAAM2O,KAAK,aAAc,QAAS,IACxC4E,IAAMkkG,EAAa,CAAEtB,EAAW,IAEtC5kF,EAAYvxB,EAAM2O,KAAK,aAAc,QAAS,IACxC4E,IAAM,CAAE4iG,EAAWA,EAAY,IAErC5kF,EAAYvxB,EAAM2O,KAAK,UAAW,KAAM,IAClC4E,IAAM,CAAE4iG,EAAWA,EAAY,GAEhC17G,EAAI,EAAGA,EAAI68G,EAAQ38G,OAAQF,KAC9B82B,EAAiBvxB,EAAM2O,KAAK,UAAW,KAAM,IACvC4E,IAAW,CAAE4iG,EAAWA,EAAY,GACtCqB,EAAO/8G,KACT82B,EAAM+P,MAAS,CAAE,CAAE,QAAS,cAAgBk2E,EAAO/8G,OAGrD82B,EAAiBvxB,EAAM2O,KAAK,SAAU,GAAI,IACpC1R,QAAWq6G,EAAQ78G,GAAGoC,OAC5B00B,EAAMhe,IAAW,CAAE4iG,EAAWA,EAAY,GAC1C5kF,EAAMujC,SAAW,GAEjBvjC,EAAiBvxB,EAAM2O,KAAK,WAAY,MAAO,GASjD,IANA4iB,EAAYvxB,EAAM2O,KAAK,WAAY,MAAO,GAC1C4iB,EAAYvxB,EAAM2O,KAAK,cAAe,SAAU,IAEhD4iB,EAAYvxB,EAAM2O,KAAK,aAAc,QAAS,IACxC4E,IAAMmkG,EAAa,CAAEvB,EAAY,EAAG,GAErCkB,EAAWlB,EAAY,EAAGkB,EAAWjB,KACpCp2G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,aAGJ,KAD/BW,EAAWP,EAAQ72G,EAAOq3G,GAAUx6G,QACvB8P,QAAQ,QACjB3M,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,WAAa,GALCY,IAAY,CAS7D,IAHAC,EAAUN,EAAaI,EAASr6G,QAAQ,WAAY,KAEpDw0B,EAAQvxB,EAAM2O,KAAK,UAAW,KAAM,GAC/BlU,EAAI,EAAGA,EAAI88G,EAAa98G,IAC3B82B,EAAiBvxB,EAAM2O,KAAK,UAAW,KAAM,GACzC6oG,EAAO/8G,KACT82B,EAAM+P,MAAS,CAAE,CAAE,QAAS,cAAgBk2E,EAAO/8G,OAGrD82B,EAAiBvxB,EAAM2O,KAAK,SAAU,GAAI,IACpC1R,QAAWq6G,EAAQ78G,GAAK68G,EAAQ78G,GAAGoC,OAAS,GAClD00B,EAAMujC,SAAW,GAEjBvjC,EAAiBvxB,EAAM2O,KAAK,WAAY,MAAO,GAEjD4iB,EAAQvxB,EAAM2O,KAAK,WAAY,MAAO,GAOxC,OALA4iB,EAAQvxB,EAAM2O,KAAK,cAAe,SAAU,GAC5C4iB,EAAQvxB,EAAM2O,KAAK,cAAe,SAAU,GAE5C8oG,EAAW,GAAKC,EAAW,GAAKL,EAChCr3G,EAAMqwB,KAAOgnF,GACN,I,6BC7LTn/G,EAAOC,QAAU,SAAc6H,EAAOm2G,EAAWC,GAC/C,IAAIiB,EAAUljF,EAAM5C,EAEpB,GAAIvxB,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,UAAY,EAAK,OAAO,EAI5D,IAFAtiF,EAAOkjF,EAAWlB,EAAY,EAEvBkB,EAAWjB,GAChB,GAAIp2G,EAAMq1F,QAAQgiB,GAChBA,QADF,CAKA,KAAIr3G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,WAAa,GAKhD,MAHEtiF,IADAkjF,EAaJ,OANAr3G,EAAMqwB,KAAO8D,GAEb5C,EAAgBvxB,EAAM2O,KAAK,aAAc,OAAQ,IAC3C1R,QAAU+C,EAAM43G,SAASzB,EAAWhiF,EAAM,EAAIn0B,EAAMy2G,WAAW,GACrEllF,EAAMhe,IAAU,CAAE4iG,EAAWn2G,EAAMqwB,OAE5B,I,6BC3BTn4B,EAAOC,QAAU,SAAe6H,EAAOm2G,EAAWC,EAASrzD,GACzD,IAAI50C,EAAQF,EAAK/M,EAAQm2G,EAAUQ,EAAKtmF,EAAOw1D,EAC3C+wB,GAAgB,EAChBviG,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GAGvB,GAAIn2G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAE7D,GAAIlhG,EAAM,EAAImT,EAAO,OAAO,EAI5B,GAAe,OAFfva,EAASnO,EAAM0H,IAAIxK,WAAWqY,KAEW,KAAXpH,EAC5B,OAAO,EAST,GALA0pG,EAAMtiG,GAGNtH,GAFAsH,EAAMvV,EAAM+3G,UAAUxiG,EAAKpH,IAEf0pG,GAEF,EAAK,OAAO,EAKtB,GAHA9wB,EAAS/mF,EAAM0H,IAAInL,MAAMs7G,EAAKtiG,IAC9BrU,EAASlB,EAAM0H,IAAInL,MAAMgZ,EAAKmT,IAEnB/b,QAAQvP,OAAOo4B,aAAarnB,KAAY,EAAK,OAAO,EAG/D,GAAI40C,EAAU,OAAO,EAKrB,IAFAs0D,EAAWlB,MAGTkB,GACgBjB,OAMhB7gG,EAAMsiG,EAAM73G,EAAM82G,OAAOO,GAAYr3G,EAAM23G,OAAON,KAClD3uF,EAAM1oB,EAAM+2G,OAAOM,KAEFr3G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,YAOhD,GAAIz2G,EAAM0H,IAAIxK,WAAWqY,KAASpH,KAE9BnO,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,WAAa,IAKhDlhG,EAAMvV,EAAM+3G,UAAUxiG,EAAKpH,IAGjB0pG,EAAM5pG,IAGhBsH,EAAMvV,EAAMg4G,WAAWziG,IAEbmT,GAAV,CAEAovF,GAAgB,EAEhB,MAcF,OAVA7pG,EAAMjO,EAAMw2G,OAAOL,GAEnBn2G,EAAMqwB,KAAOgnF,GAAYS,EAAgB,EAAI,IAE7CvmF,EAAgBvxB,EAAM2O,KAAK,QAAS,OAAQ,IACtCq4E,KAAU9lF,EAChBqwB,EAAMt0B,QAAU+C,EAAM43G,SAASzB,EAAY,EAAGkB,EAAUppG,GAAK,GAC7DsjB,EAAMw1D,OAAUA,EAChBx1D,EAAMhe,IAAU,CAAE4iG,EAAWn2G,EAAMqwB,OAE5B,I,6BCxFT,IAAI2G,EAAUz+B,EAAQ,KAAmBy+B,QAGzC9+B,EAAOC,QAAU,SAAoB6H,EAAOm2G,EAAWC,EAASrzD,GAC9D,IAAIk1D,EACA3tF,EACA7vB,EACAy9G,EACAx9G,EACAy9G,EACAnG,EACAqF,EACA91E,EACA62E,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACArnF,EACAsnF,EACAC,EAAa94G,EAAM42G,QACnBrhG,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GAGvB,GAAIn2G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAG7D,GAAoC,KAAhCz2G,EAAM0H,IAAIxK,WAAWqY,KAA0B,OAAO,EAI1D,GAAIwtC,EAAU,OAAO,EAqCrB,IAlCAm1D,EAAU32E,EAASvhC,EAAMw2G,OAAOL,GAAa5gG,GAAOvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,IAGzD,KAA9Bn2G,EAAM0H,IAAIxK,WAAWqY,IAGvBA,IACA2iG,IACA32E,IACA02E,GAAY,EACZS,GAAmB,GACoB,IAA9B14G,EAAM0H,IAAIxK,WAAWqY,IAC9BmjG,GAAmB,GAEd14G,EAAM+4G,QAAQ5C,GAAa50E,GAAU,GAAM,GAG9ChsB,IACA2iG,IACA32E,IACA02E,GAAY,GAKZA,GAAY,GAGdS,GAAmB,EAGrBN,EAAY,CAAEp4G,EAAM82G,OAAOX,IAC3Bn2G,EAAM82G,OAAOX,GAAa5gG,EAEnBA,EAAMmT,IACX4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,GAEtByhB,EAAQ1M,KACC,IAAPA,EACFiX,GAAU,GAAKA,EAASvhC,EAAM+4G,QAAQ5C,IAAc8B,EAAY,EAAI,IAAM,EAE1E12E,IAMJhsB,IAsCF,IAnCA8iG,EAAa,CAAEr4G,EAAM+4G,QAAQ5C,IAC7Bn2G,EAAM+4G,QAAQ5C,GAAan2G,EAAMw2G,OAAOL,GAAa,GAAKuC,EAAmB,EAAI,GAEjFP,EAAgB5iG,GAAOmT,EAEvB8vF,EAAY,CAAEx4G,EAAMw2G,OAAOL,IAC3Bn2G,EAAMw2G,OAAOL,GAAa50E,EAAS22E,EAEnCO,EAAY,CAAEz4G,EAAM23G,OAAOxB,IAC3Bn2G,EAAM23G,OAAOxB,GAAa5gG,EAAMvV,EAAM82G,OAAOX,GAE7CyC,EAAkB54G,EAAMgpG,GAAGr5D,MAAMs+D,MAAMtnB,SAAS,cAEhD4xB,EAAgBv4G,EAAMu6C,WACtBv6C,EAAMu6C,WAAa,aACnBs+D,GAAe,EAoBVxB,EAAWlB,EAAY,EAAGkB,EAAWjB,IASpCp2G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,YAAWoC,GAAe,MAE7DtjG,EAAMvV,EAAM82G,OAAOO,GAAYr3G,EAAM23G,OAAON,MAC5C3uF,EAAM1oB,EAAM+2G,OAAOM,MAZ8BA,IAmBjD,GAAoC,KAAhCr3G,EAAM0H,IAAIxK,WAAWqY,MAA2BsjG,EAApD,CAoEA,GAAIV,EAAiB,MAIrB,IADAQ,GAAY,EACPl+G,EAAI,EAAGC,EAAIk+G,EAAgBj+G,OAAQF,EAAIC,EAAGD,IAC7C,GAAIm+G,EAAgBn+G,GAAGuF,EAAOq3G,EAAUjB,GAAS,GAAO,CACtDuC,GAAY,EACZ,MAIJ,GAAIA,EAAW,CAKb34G,EAAM42G,QAAUS,EAEQ,IAApBr3G,EAAMy2G,YAIR2B,EAAUzpG,KAAK3O,EAAM82G,OAAOO,IAC5BgB,EAAW1pG,KAAK3O,EAAM+4G,QAAQ1B,IAC9BoB,EAAU9pG,KAAK3O,EAAM23G,OAAON,IAC5BmB,EAAU7pG,KAAK3O,EAAMw2G,OAAOa,IAC5Br3G,EAAMw2G,OAAOa,IAAar3G,EAAMy2G,WAGlC,MAGF2B,EAAUzpG,KAAK3O,EAAM82G,OAAOO,IAC5BgB,EAAW1pG,KAAK3O,EAAM+4G,QAAQ1B,IAC9BoB,EAAU9pG,KAAK3O,EAAM23G,OAAON,IAC5BmB,EAAU7pG,KAAK3O,EAAMw2G,OAAOa,IAI5Br3G,EAAMw2G,OAAOa,IAAa,MA3G1B,CAsCE,IAlCAa,EAAU32E,EAASvhC,EAAMw2G,OAAOa,GAAY9hG,GAAOvV,EAAM82G,OAAOO,GAAYr3G,EAAM23G,OAAON,IAGvD,KAA9Br3G,EAAM0H,IAAIxK,WAAWqY,IAGvBA,IACA2iG,IACA32E,IACA02E,GAAY,EACZS,GAAmB,GACoB,IAA9B14G,EAAM0H,IAAIxK,WAAWqY,IAC9BmjG,GAAmB,GAEd14G,EAAM+4G,QAAQ1B,GAAY91E,GAAU,GAAM,GAG7ChsB,IACA2iG,IACA32E,IACA02E,GAAY,GAKZA,GAAY,GAGdS,GAAmB,EAGrBN,EAAUzpG,KAAK3O,EAAM82G,OAAOO,IAC5Br3G,EAAM82G,OAAOO,GAAY9hG,EAElBA,EAAMmT,IACX4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,GAEtByhB,EAAQ1M,KACC,IAAPA,EACFiX,GAAU,GAAKA,EAASvhC,EAAM+4G,QAAQ1B,IAAaY,EAAY,EAAI,IAAM,EAEzE12E,IAMJhsB,IAGF4iG,EAAgB5iG,GAAOmT,EAEvB2vF,EAAW1pG,KAAK3O,EAAM+4G,QAAQ1B,IAC9Br3G,EAAM+4G,QAAQ1B,GAAYr3G,EAAMw2G,OAAOa,GAAY,GAAKqB,EAAmB,EAAI,GAE/EF,EAAU7pG,KAAK3O,EAAMw2G,OAAOa,IAC5Br3G,EAAMw2G,OAAOa,GAAY91E,EAAS22E,EAElCO,EAAU9pG,KAAK3O,EAAM23G,OAAON,IAC5Br3G,EAAM23G,OAAON,GAAY9hG,EAAMvV,EAAM82G,OAAOO,GAiEhD,IAlBAiB,EAAYt4G,EAAMy2G,UAClBz2G,EAAMy2G,UAAY,GAElBllF,EAAevxB,EAAM2O,KAAK,kBAAmB,aAAc,IACrDo4E,OAAS,IACfx1D,EAAMhe,IAASy+F,EAAQ,CAAEmE,EAAW,GAEpCn2G,EAAMgpG,GAAGr5D,MAAMorD,SAAS/6F,EAAOm2G,EAAWkB,IAE1C9lF,EAAevxB,EAAM2O,KAAK,mBAAoB,cAAe,IACvDo4E,OAAS,IAEf/mF,EAAM42G,QAAUkC,EAChB94G,EAAMu6C,WAAag+D,EACnBvG,EAAM,GAAKhyG,EAAMqwB,KAIZ51B,EAAI,EAAGA,EAAIg+G,EAAU99G,OAAQF,IAChCuF,EAAM82G,OAAOr8G,EAAI07G,GAAaiC,EAAU39G,GACxCuF,EAAM23G,OAAOl9G,EAAI07G,GAAasC,EAAUh+G,GACxCuF,EAAMw2G,OAAO/7G,EAAI07G,GAAaqC,EAAU/9G,GACxCuF,EAAM+4G,QAAQt+G,EAAI07G,GAAakC,EAAW59G,GAI5C,OAFAuF,EAAMy2G,UAAY6B,GAEX,I,6BCvRT,IAAIthF,EAAUz+B,EAAQ,KAAmBy+B,QAGzC9+B,EAAOC,QAAU,SAAY6H,EAAOm2G,EAAWC,EAASrzD,GACtD,IAAI50C,EAAQ6qG,EAAK1uF,EAAIiH,EACjBhc,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GAGvB,GAAIn2G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAK7D,GAAe,MAHftoG,EAASnO,EAAM0H,IAAIxK,WAAWqY,OAIf,KAAXpH,GACW,KAAXA,EACF,OAAO,EAMT,IADA6qG,EAAM,EACCzjG,EAAMmT,GAAK,CAEhB,IADA4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,QACfpH,IAAW6oB,EAAQ1M,GAAO,OAAO,EACxCA,IAAOnc,GAAU6qG,IAGvB,QAAIA,EAAM,KAENj2D,IAEJ/iD,EAAMqwB,KAAO8lF,EAAY,GAEzB5kF,EAAevxB,EAAM2O,KAAK,KAAM,KAAM,IAChC4E,IAAS,CAAE4iG,EAAWn2G,EAAMqwB,MAClCkB,EAAMw1D,OAASr4E,MAAMsqG,EAAM,GAAG54G,KAAKhD,OAAOo4B,aAAarnB,MANlC,K,6BC/BvB,IAAI6oB,EAAUz+B,EAAQ,KAAmBy+B,QAKzC,SAASiiF,EAAqBj5G,EAAOm2G,GACnC,IAAIhoG,EAAQoH,EAAKmT,EAAK4B,EAOtB,OALA/U,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GAIJ,MAFfhoG,EAASnO,EAAM0H,IAAIxK,WAAWqY,OAGf,KAAXpH,GACW,KAAXA,GAIAoH,EAAMmT,IACR4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,IAErByhB,EAAQ1M,KANL,EAYH/U,EAKT,SAAS2jG,EAAsBl5G,EAAOm2G,GACpC,IAAI7rF,EACAyU,EAAQ/+B,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC/C5gG,EAAMwpB,EACNrW,EAAM1oB,EAAM+2G,OAAOZ,GAGvB,GAAI5gG,EAAM,GAAKmT,EAAO,OAAQ,EAI9B,IAFA4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,MAEjB,IAAe+U,EAAK,GAAe,OAAQ,EAEpD,OAAS,CAEP,GAAI/U,GAAOmT,EAAO,OAAQ,EAI1B,MAFA4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,OAEhB,IAAe+U,GAAM,IAA/B,CAUA,GAAW,KAAPA,GAA6B,KAAPA,EACxB,MAGF,OAAQ,EAVN,GAAI/U,EAAMwpB,GAAS,GAAM,OAAQ,EAcrC,OAAIxpB,EAAMmT,IACR4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,IAErByhB,EAAQ1M,KAEH,EAGL/U,EAiBTrd,EAAOC,QAAU,SAAc6H,EAAOm2G,EAAWC,EAASrzD,GACxD,IAAIz4B,EACA6uF,EACA1+G,EACA2+G,EACAC,EACAnB,EACAoB,EACAC,EACA7+G,EACA8+G,EACAC,EACAC,EACAC,EACAjxF,EACA2uF,EACA91E,EACA+2E,EACAsB,EACArB,EACAE,EACAoB,EACAtkG,EACAukG,EACAC,EACAh7E,EACA45E,EACAC,EACArnF,EACAyoF,GAAyB,EACzBtD,GAAQ,EAGZ,GAAI12G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAgB7D,GAZI1zD,GAA+B,cAArB/iD,EAAMu6C,YAMdv6C,EAAM23G,OAAOxB,IAAcn2G,EAAMy2G,YACnCuD,GAAyB,IAKxBF,EAAiBZ,EAAsBl5G,EAAOm2G,KAAe,GAOhE,GANAmD,GAAY,EACZv6E,EAAQ/+B,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC/CwD,EAAcxwG,OAAOnJ,EAAM0H,IAAI4oB,OAAOyO,EAAO+6E,EAAiB/6E,EAAQ,IAIlEi7E,GAA0C,IAAhBL,EAAmB,OAAO,MAEnD,OAAKG,EAAiBb,EAAqBj5G,EAAOm2G,KAAe,GAItE,OAAO,EAHPmD,GAAY,EAQd,GAAIU,GACEh6G,EAAMg4G,WAAW8B,IAAmB95G,EAAM+2G,OAAOZ,GAAY,OAAO,EAO1E,GAHAuD,EAAiB15G,EAAM0H,IAAIxK,WAAW48G,EAAiB,GAGnD/2D,EAAU,OAAO,EA6BrB,IA1BA02D,EAAaz5G,EAAM+mC,OAAOpsC,OAEtB2+G,GACF/nF,EAAcvxB,EAAM2O,KAAK,oBAAqB,KAAM,GAChC,IAAhBgrG,IACFpoF,EAAM+P,MAAQ,CAAE,CAAE,QAASq4E,MAI7BpoF,EAAcvxB,EAAM2O,KAAK,mBAAoB,KAAM,GAGrD4iB,EAAMhe,IAASimG,EAAY,CAAErD,EAAW,GACxC5kF,EAAMw1D,OAAS3pF,OAAOo4B,aAAakkF,GAMnCrC,EAAWlB,EACX4D,GAAe,EACfnB,EAAkB54G,EAAMgpG,GAAGr5D,MAAMs+D,MAAMtnB,SAAS,QAEhD4xB,EAAgBv4G,EAAMu6C,WACtBv6C,EAAMu6C,WAAa,OAEZ88D,EAAWjB,GAAS,CAMzB,IALA7gG,EAAMukG,EACNpxF,EAAM1oB,EAAM+2G,OAAOM,GAEnBa,EAAU32E,EAASvhC,EAAMw2G,OAAOa,GAAYyC,GAAkB95G,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,IAE9F5gG,EAAMmT,GAAK,CAGhB,GAAW,KAFX4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,IAGxBgsB,GAAU,GAAKA,EAASvhC,EAAM+4G,QAAQ1B,IAAa,MAC9C,IAAW,KAAP/sF,EAGT,MAFAiX,IAKFhsB,IAmEF,IA5DE8jG,GAJFF,EAAe5jG,IAEKmT,EAEE,EAEA6Y,EAAS22E,GAKP,IAAKmB,EAAoB,GAIjDD,EAASlB,EAAUmB,GAGnB9nF,EAAevxB,EAAM2O,KAAK,iBAAkB,KAAM,IAC5Co4E,OAAS3pF,OAAOo4B,aAAakkF,GACnCnoF,EAAMhe,IAASgmG,EAAY,CAAEpD,EAAW,GAExCmC,EAAYt4G,EAAMy2G,UAClBoD,EAAW75G,EAAM02G,MACjB+B,EAAYz4G,EAAM23G,OAAOxB,GACzByD,EAAa55G,EAAMw2G,OAAOL,GAC1Bn2G,EAAMy2G,UAAY2C,EAClBp5G,EAAM02G,OAAQ,EACd12G,EAAM23G,OAAOxB,GAAagD,EAAen5G,EAAM82G,OAAOX,GACtDn2G,EAAMw2G,OAAOL,GAAa50E,EAEtB43E,GAAgBzwF,GAAO1oB,EAAMq1F,QAAQ8gB,EAAY,GAQnDn2G,EAAMqwB,KAAOj3B,KAAKiJ,IAAIrC,EAAMqwB,KAAO,EAAG+lF,GAEtCp2G,EAAMgpG,GAAGr5D,MAAMorD,SAAS/6F,EAAOm2G,EAAWC,GAAS,GAIhDp2G,EAAM02G,QAASqD,IAClBrD,GAAQ,GAIVqD,EAAgB/5G,EAAMqwB,KAAO8lF,EAAa,GAAKn2G,EAAMq1F,QAAQr1F,EAAMqwB,KAAO,GAE1ErwB,EAAMy2G,UAAY6B,EAClBt4G,EAAM23G,OAAOxB,GAAasC,EAC1Bz4G,EAAMw2G,OAAOL,GAAayD,EAC1B55G,EAAM02G,MAAQmD,GAEdtoF,EAAevxB,EAAM2O,KAAK,kBAAmB,MAAO,IAC9Co4E,OAAS3pF,OAAOo4B,aAAakkF,GAEnCrC,EAAWlB,EAAYn2G,EAAMqwB,KAC7BkpF,EAAU,GAAKlC,EACf8B,EAAen5G,EAAM82G,OAAOX,GAExBkB,GAAYjB,EAAW,MAK3B,GAAIp2G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,UAAa,MAIhD,IADAkC,GAAY,EACPl+G,EAAI,EAAGC,EAAIk+G,EAAgBj+G,OAAQF,EAAIC,EAAGD,IAC7C,GAAIm+G,EAAgBn+G,GAAGuF,EAAOq3G,EAAUjB,GAAS,GAAO,CACtDuC,GAAY,EACZ,MAGJ,GAAIA,EAAa,MAGjB,GAAIW,GAEF,IADAQ,EAAiBZ,EAAsBl5G,EAAOq3G,IACzB,EAAK,WAG1B,IADAyC,EAAiBb,EAAqBj5G,EAAOq3G,IACxB,EAAK,MAG5B,GAAIqC,IAAmB15G,EAAM0H,IAAIxK,WAAW48G,EAAiB,GAAM,MAqBrE,OAhBEvoF,EADE+nF,EACMt5G,EAAM2O,KAAK,qBAAsB,MAAO,GAExC3O,EAAM2O,KAAK,oBAAqB,MAAO,IAE3Co4E,OAAS3pF,OAAOo4B,aAAakkF,GAEnCF,EAAU,GAAKnC,EACfr3G,EAAMqwB,KAAOgnF,EAEbr3G,EAAMu6C,WAAag+D,EAGf7B,GArPN,SAA6B12G,EAAOwmF,GAClC,IAAI/rF,EAAGC,EACHo2C,EAAQ9wC,EAAM8wC,MAAQ,EAE1B,IAAKr2C,EAAI+rF,EAAM,EAAG9rF,EAAIsF,EAAM+mC,OAAOpsC,OAAS,EAAGF,EAAIC,EAAGD,IAChDuF,EAAM+mC,OAAOtsC,GAAGq2C,QAAUA,GAAkC,mBAAzB9wC,EAAM+mC,OAAOtsC,GAAG8G,OACrDvB,EAAM+mC,OAAOtsC,EAAI,GAAGwsF,QAAS,EAC7BjnF,EAAM+mC,OAAOtsC,GAAGwsF,QAAS,EACzBxsF,GAAK,GA8OPw/G,CAAoBj6G,EAAOy5G,IAGtB,I,6BC3UT,IAAIpiF,EAAuB9+B,EAAQ,KAAmB8+B,mBAClDL,EAAuBz+B,EAAQ,KAAmBy+B,QAGtD9+B,EAAOC,QAAU,SAAmB6H,EAAOm2G,EAAW+D,EAAUn3D,GAC9D,IAAIz4B,EACA6vF,EACAC,EACAhE,EACAzlF,EACAl2B,EACAC,EACA2/G,EACAzI,EACA2G,EACAhvF,EACAwV,EACAjiC,EACA67G,EACAC,EACAhqG,EACAojG,EAAQ,EACRz8F,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GACnBkB,EAAWlB,EAAY,EAG3B,GAAIn2G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAE7D,GAAkC,KAA9Bz2G,EAAM0H,IAAIxK,WAAWqY,GAAwB,OAAO,EAIxD,OAASA,EAAMmT,GACb,GAAkC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,IACa,KAAlCvV,EAAM0H,IAAIxK,WAAWqY,EAAM,GAAoB,CACjD,GAAIA,EAAM,IAAMmT,EAAO,OAAO,EAC9B,GAAsC,KAAlC1oB,EAAM0H,IAAIxK,WAAWqY,EAAM,GAAsB,OAAO,EAC5D,MAYJ,IARA6gG,EAAUp2G,EAAM42G,QAGhBgC,EAAkB54G,EAAMgpG,GAAGr5D,MAAMs+D,MAAMtnB,SAAS,aAEhD4xB,EAAgBv4G,EAAMu6C,WACtBv6C,EAAMu6C,WAAa,YAEZ88D,EAAWjB,IAAYp2G,EAAMq1F,QAAQgiB,GAAWA,IAGrD,KAAIr3G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,UAAY,GAG3Cz2G,EAAMw2G,OAAOa,GAAY,GAA7B,CAIA,IADAsB,GAAY,EACPl+G,EAAI,EAAGC,EAAIk+G,EAAgBj+G,OAAQF,EAAIC,EAAGD,IAC7C,GAAIm+G,EAAgBn+G,GAAGuF,EAAOq3G,EAAUjB,GAAS,GAAO,CACtDuC,GAAY,EACZ,MAGJ,GAAIA,EAAa,MAMnB,IAFAjwF,GADA5rB,EAAMkD,EAAM43G,SAASzB,EAAWkB,EAAUr3G,EAAMy2G,WAAW,GAAO55G,QACxDlC,OAEL4a,EAAM,EAAGA,EAAMmT,EAAKnT,IAAO,CAE9B,GAAW,MADX+U,EAAKxtB,EAAII,WAAWqY,IAElB,OAAO,EACF,GAAW,KAAP+U,EAAqB,CAC9BsnF,EAAWr8F,EACX,OACgB,KAAP+U,GAEO,KAAPA,KACT/U,EACUmT,GAA+B,KAAxB5rB,EAAII,WAAWqY,KAHhCy8F,IASJ,GAAIJ,EAAW,GAAsC,KAAjC90G,EAAII,WAAW00G,EAAW,GAAsB,OAAO,EAI3E,IAAKr8F,EAAMq8F,EAAW,EAAGr8F,EAAMmT,EAAKnT,IAElC,GAAW,MADX+U,EAAKxtB,EAAII,WAAWqY,IAElBy8F,SACK,IAAIh7E,EAAQ1M,GAGjB,MAOJ,KADAf,EAAMvpB,EAAMgpG,GAAGyD,QAAQ+E,qBAAqB10G,EAAKyY,EAAKmT,IAC7CqnB,GAAM,OAAO,EAGtB,GADApf,EAAO3wB,EAAMgpG,GAAGsE,cAAc/jF,EAAIzsB,MAC7BkD,EAAMgpG,GAAGoE,aAAaz8E,GAAS,OAAO,EAY3C,IANAwpF,EAJA5kG,EAAMgU,EAAIhU,IAKV6kG,EAJApI,GAASzoF,EAAIyoF,MAQbjzE,EAAQxpB,EACDA,EAAMmT,EAAKnT,IAEhB,GAAW,MADX+U,EAAKxtB,EAAII,WAAWqY,IAElBy8F,SACK,IAAIh7E,EAAQ1M,GAGjB,MAkBJ,IAZAf,EAAMvpB,EAAMgpG,GAAGyD,QAAQgF,eAAe30G,EAAKyY,EAAKmT,GAC5CnT,EAAMmT,GAAOqW,IAAUxpB,GAAOgU,EAAIwmB,IACpCnhC,EAAQ2a,EAAIzsB,IACZyY,EAAMgU,EAAIhU,IACVy8F,GAASzoF,EAAIyoF,QAEbpjG,EAAQ,GACR2G,EAAM4kG,EACNnI,EAAQoI,GAIH7kG,EAAMmT,IACX4B,EAAKxtB,EAAII,WAAWqY,GACfyhB,EAAQ1M,KACb/U,IAGF,GAAIA,EAAMmT,GAA+B,KAAxB5rB,EAAII,WAAWqY,IAC1B3G,EAMF,IAHAA,EAAQ,GACR2G,EAAM4kG,EACNnI,EAAQoI,EACD7kG,EAAMmT,IACX4B,EAAKxtB,EAAII,WAAWqY,GACfyhB,EAAQ1M,KACb/U,IAKN,QAAIA,EAAMmT,GAA+B,KAAxB5rB,EAAII,WAAWqY,SAKhC8kG,EAAQhjF,EAAmBv6B,EAAIP,MAAM,EAAGq1G,OAQpC7uD,SAEgC,IAAzB/iD,EAAM8O,IAAIwrG,aACnBt6G,EAAM8O,IAAIwrG,WAAa,SAEkB,IAAhCt6G,EAAM8O,IAAIwrG,WAAWD,KAC9Br6G,EAAM8O,IAAIwrG,WAAWD,GAAS,CAAEzrG,MAAOA,EAAO+hB,KAAMA,IAGtD3wB,EAAMu6C,WAAag+D,EAEnBv4G,EAAMqwB,KAAO8lF,EAAYnE,EAAQ,IAXZ,M,6BCpLvB,IAAIh7E,EAAUz+B,EAAQ,KAAmBy+B,QAGzC9+B,EAAOC,QAAU,SAAiB6H,EAAOm2G,EAAWC,EAASrzD,GAC3D,IAAIz4B,EAAIwmB,EAAOxO,EAAK/Q,EAChBhc,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GAGvB,GAAIn2G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAI7D,GAAW,MAFXnsF,EAAMtqB,EAAM0H,IAAIxK,WAAWqY,KAEDA,GAAOmT,EAAO,OAAO,EAK/C,IAFAooB,EAAQ,EACRxmB,EAAKtqB,EAAM0H,IAAIxK,aAAaqY,GACd,KAAP+U,GAAsB/U,EAAMmT,GAAOooB,GAAS,GACjDA,IACAxmB,EAAKtqB,EAAM0H,IAAIxK,aAAaqY,GAG9B,QAAIu7B,EAAQ,GAAMv7B,EAAMmT,IAAQsO,EAAQ1M,MAEpCy4B,IAIJr6B,EAAM1oB,EAAMu6G,eAAe7xF,EAAKnT,IAChC+sB,EAAMtiC,EAAMw6G,cAAc9xF,EAAK,GAAMnT,IAC3BA,GAAOyhB,EAAQh3B,EAAM0H,IAAIxK,WAAWolC,EAAM,MAClD5Z,EAAM4Z,GAGRtiC,EAAMqwB,KAAO8lF,EAAY,GAEzB5kF,EAAevxB,EAAM2O,KAAK,eAAgB,IAAMvR,OAAO0zC,GAAQ,IACzDi2C,OAAS,WAAWxqF,MAAM,EAAGu0C,GACnCvf,EAAMhe,IAAS,CAAE4iG,EAAWn2G,EAAMqwB,OAElCkB,EAAiBvxB,EAAM2O,KAAK,SAAU,GAAI,IACpC1R,QAAW+C,EAAM0H,IAAInL,MAAMgZ,EAAKmT,GAAK7rB,OAC3C00B,EAAMhe,IAAW,CAAE4iG,EAAWn2G,EAAMqwB,MACpCkB,EAAMujC,SAAW,IAEjBvjC,EAAevxB,EAAM2O,KAAK,gBAAiB,IAAMvR,OAAO0zC,IAAS,IAC3Di2C,OAAS,WAAWxqF,MAAM,EAAGu0C,KAtBd,K,6BCxBvB54C,EAAOC,QAAU,SAAkB6H,EAAOm2G,EAAWC,GACnD,IAAIn5G,EAAS07G,EAAWl+G,EAAGC,EAAG62B,EAAOhc,EAAKmT,EAAKooB,EAAO3iC,EACxBoqG,EAA1BlB,EAAWlB,EAAY,EACvByC,EAAkB54G,EAAMgpG,GAAGr5D,MAAMs+D,MAAMtnB,SAAS,aAGpD,GAAI3mF,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAM7D,IAJA8B,EAAgBv4G,EAAMu6C,WACtBv6C,EAAMu6C,WAAa,YAGZ88D,EAAWjB,IAAYp2G,EAAMq1F,QAAQgiB,GAAWA,IAGrD,KAAIr3G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,UAAY,GAA/C,CAKA,GAAIz2G,EAAMw2G,OAAOa,IAAar3G,EAAMy2G,YAClClhG,EAAMvV,EAAM82G,OAAOO,GAAYr3G,EAAM23G,OAAON,KAC5C3uF,EAAM1oB,EAAM+2G,OAAOM,MAKF,MAFflpG,EAASnO,EAAM0H,IAAIxK,WAAWqY,KAEW,KAAXpH,KAC5BoH,EAAMvV,EAAM+3G,UAAUxiG,EAAKpH,IAC3BoH,EAAMvV,EAAMg4G,WAAWziG,KAEZmT,GAAK,CACdooB,EAAoB,KAAX3iC,EAAyB,EAAI,EACtC,MAOR,KAAInO,EAAMw2G,OAAOa,GAAY,GAA7B,CAIA,IADAsB,GAAY,EACPl+G,EAAI,EAAGC,EAAIk+G,EAAgBj+G,OAAQF,EAAIC,EAAGD,IAC7C,GAAIm+G,EAAgBn+G,GAAGuF,EAAOq3G,EAAUjB,GAAS,GAAO,CACtDuC,GAAY,EACZ,MAGJ,GAAIA,EAAa,OAGnB,QAAK7nE,IAKL7zC,EAAU+C,EAAM43G,SAASzB,EAAWkB,EAAUr3G,EAAMy2G,WAAW,GAAO55G,OAEtEmD,EAAMqwB,KAAOgnF,EAAW,GAExB9lF,EAAiBvxB,EAAM2O,KAAK,eAAgB,IAAMvR,OAAO0zC,GAAQ,IAC3Di2C,OAAW3pF,OAAOo4B,aAAarnB,GACrCojB,EAAMhe,IAAW,CAAE4iG,EAAWn2G,EAAMqwB,OAEpCkB,EAAiBvxB,EAAM2O,KAAK,SAAU,GAAI,IACpC1R,QAAWA,EACjBs0B,EAAMhe,IAAW,CAAE4iG,EAAWn2G,EAAMqwB,KAAO,GAC3CkB,EAAMujC,SAAW,IAEjBvjC,EAAiBvxB,EAAM2O,KAAK,gBAAiB,IAAMvR,OAAO0zC,IAAS,IAC7Di2C,OAAW3pF,OAAOo4B,aAAarnB,GAErCnO,EAAMu6C,WAAag+D,GAEZ,K,6BC5ET,IAAIkC,EAAcliH,EAAQ,KACtBuiG,EAAyBviG,EAAQ,KAAqBuiG,uBAKtD4f,EAAiB,CACnB,CAAE,oCAAqC,2BAA2B,GAClE,CAAE,QAAgB,OAAS,GAC3B,CAAE,OAAgB,OAAS,GAC3B,CAAE,WAAgB,KAAS,GAC3B,CAAE,eAAgB,SAAS,GAC3B,CAAE,IAAI9uG,OAAO,QAAU6uG,EAAYr6G,KAAK,KAAO,mBAAoB,KAAM,MAAM,GAC/E,CAAE,IAAIwL,OAAOkvF,EAAuBl8F,OAAS,SAAW,MAAM,IAIhE1G,EAAOC,QAAU,SAAoB6H,EAAOm2G,EAAWC,EAASrzD,GAC9D,IAAItoD,EAAG48G,EAAU9lF,EAAO6lF,EACpB7hG,EAAMvV,EAAM82G,OAAOX,GAAan2G,EAAM23G,OAAOxB,GAC7CztF,EAAM1oB,EAAM+2G,OAAOZ,GAGvB,GAAIn2G,EAAMw2G,OAAOL,GAAan2G,EAAMy2G,WAAa,EAAK,OAAO,EAE7D,IAAKz2G,EAAMgpG,GAAGrqG,QAAQ4H,KAAQ,OAAO,EAErC,GAAkC,KAA9BvG,EAAM0H,IAAIxK,WAAWqY,GAAwB,OAAO,EAIxD,IAFA6hG,EAAWp3G,EAAM0H,IAAInL,MAAMgZ,EAAKmT,GAE3BjuB,EAAI,EAAGA,EAAIigH,EAAe//G,SACzB+/G,EAAejgH,GAAG,GAAG6Q,KAAK8rG,GADO38G,KAIvC,GAAIA,IAAMigH,EAAe//G,OAAU,OAAO,EAE1C,GAAIooD,EAEF,OAAO23D,EAAejgH,GAAG,GAO3B,GAJA48G,EAAWlB,EAAY,GAIlBuE,EAAejgH,GAAG,GAAG6Q,KAAK8rG,GAC7B,KAAOC,EAAWjB,KACZp2G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,WADVY,IAOzB,GAJA9hG,EAAMvV,EAAM82G,OAAOO,GAAYr3G,EAAM23G,OAAON,GAC5C3uF,EAAM1oB,EAAM+2G,OAAOM,GACnBD,EAAWp3G,EAAM0H,IAAInL,MAAMgZ,EAAKmT,GAE5BgyF,EAAejgH,GAAG,GAAG6Q,KAAK8rG,GAAW,CACf,IAApBA,EAASz8G,QAAgB08G,IAC7B,MAWN,OANAr3G,EAAMqwB,KAAOgnF,GAEb9lF,EAAgBvxB,EAAM2O,KAAK,aAAc,GAAI,IACvC4E,IAAU,CAAE4iG,EAAWkB,GAC7B9lF,EAAMt0B,QAAU+C,EAAM43G,SAASzB,EAAWkB,EAAUr3G,EAAMy2G,WAAW,IAE9D,I,6BClETv+G,EAAOC,QAAU,CACf,UACA,UACA,QACA,OACA,WACA,aACA,OACA,UACA,SACA,MACA,WACA,KACA,UACA,SACA,MACA,MACA,KACA,KACA,WACA,aACA,SACA,SACA,OACA,QACA,WACA,KACA,KACA,KACA,KACA,KACA,KACA,OACA,SACA,KACA,OACA,SACA,SACA,KACA,OACA,OACA,OACA,WACA,OACA,MACA,WACA,KACA,WACA,SACA,IACA,QACA,UACA,SACA,UACA,QACA,QACA,KACA,QACA,KACA,QACA,QACA,KACA,QACA,O,6BChEFD,EAAOC,QAAU,SAAmB6H,EAAOm2G,GACzC,IAAIl5G,EAAS07G,EAAWl+G,EAAGC,EAAG62B,EAAOgnF,EACjClB,EAAWlB,EAAY,EACvByC,EAAkB54G,EAAMgpG,GAAGr5D,MAAMs+D,MAAMtnB,SAAS,aAChDyvB,EAAUp2G,EAAM42G,QAMpB,IAJA2B,EAAgBv4G,EAAMu6C,WACtBv6C,EAAMu6C,WAAa,YAGZ88D,EAAWjB,IAAYp2G,EAAMq1F,QAAQgiB,GAAWA,IAGrD,KAAIr3G,EAAMw2G,OAAOa,GAAYr3G,EAAMy2G,UAAY,GAG3Cz2G,EAAMw2G,OAAOa,GAAY,GAA7B,CAIA,IADAsB,GAAY,EACPl+G,EAAI,EAAGC,EAAIk+G,EAAgBj+G,OAAQF,EAAIC,EAAGD,IAC7C,GAAIm+G,EAAgBn+G,GAAGuF,EAAOq3G,EAAUjB,GAAS,GAAO,CACtDuC,GAAY,EACZ,MAGJ,GAAIA,EAAa,MAmBnB,OAhBA17G,EAAU+C,EAAM43G,SAASzB,EAAWkB,EAAUr3G,EAAMy2G,WAAW,GAAO55G,OAEtEmD,EAAMqwB,KAAOgnF,GAEb9lF,EAAiBvxB,EAAM2O,KAAK,iBAAkB,IAAK,IAC7C4E,IAAW,CAAE4iG,EAAWn2G,EAAMqwB,OAEpCkB,EAAiBvxB,EAAM2O,KAAK,SAAU,GAAI,IACpC1R,QAAWA,EACjBs0B,EAAMhe,IAAW,CAAE4iG,EAAWn2G,EAAMqwB,MACpCkB,EAAMujC,SAAW,GAEjBvjC,EAAiBvxB,EAAM2O,KAAK,kBAAmB,KAAM,GAErD3O,EAAMu6C,WAAag+D,GAEZ,I,6BC9CT,IAAI1xB,EAAQtuF,EAAQ,KAChBy+B,EAAUz+B,EAAQ,KAAmBy+B,QAGzC,SAAS2jF,EAAWjzG,EAAKshG,EAAIl6F,EAAKi4B,GAChC,IAAIzc,EAAI4K,EAAG6J,EAAOxpB,EAAKtH,EAAKmrG,EAAQ73E,EAAQq5E,EAsD5C,IApDAphH,KAAKkO,IAAMA,EAGXlO,KAAKwvG,GAASA,EAEdxvG,KAAKsV,IAAMA,EAMXtV,KAAKutC,OAASA,EAEdvtC,KAAKs9G,OAAS,GACdt9G,KAAKu9G,OAAS,GACdv9G,KAAKm+G,OAAS,GACdn+G,KAAKg9G,OAAS,GAYdh9G,KAAKu/G,QAAU,GAGfv/G,KAAKi9G,UAAa,EAElBj9G,KAAK62B,KAAa,EAClB72B,KAAKo9G,QAAa,EAClBp9G,KAAKk9G,OAAa,EAClBl9G,KAAKqhH,UAAc,EAInBrhH,KAAK+gD,WAAa,OAElB/gD,KAAKs3C,MAAQ,EAGbt3C,KAAK6C,OAAS,GAKdu+G,GAAe,EAEV77E,EAAQxpB,EAAM6jG,EAAS73E,EAAS,EAAGtzB,GAHxCinB,EAAI17B,KAAKkO,KAGuC/M,OAAQ4a,EAAMtH,EAAKsH,IAAO,CAGxE,GAFA+U,EAAK4K,EAAEh4B,WAAWqY,IAEbqlG,EAAc,CACjB,GAAI5jF,EAAQ1M,GAAK,CACf8uF,IAEW,IAAP9uF,EACFiX,GAAU,EAAIA,EAAS,EAEvBA,IAEF,SAEAq5E,GAAe,EAIR,KAAPtwF,GAAe/U,IAAQtH,EAAM,IACpB,KAAPqc,GAAe/U,IACnB/b,KAAKs9G,OAAOnoG,KAAKowB,GACjBvlC,KAAKu9G,OAAOpoG,KAAK4G,GACjB/b,KAAKm+G,OAAOhpG,KAAKyqG,GACjB5/G,KAAKg9G,OAAO7nG,KAAK4yB,GACjB/nC,KAAKu/G,QAAQpqG,KAAK,GAElBisG,GAAe,EACfxB,EAAS,EACT73E,EAAS,EACTxC,EAAQxpB,EAAM,GAKlB/b,KAAKs9G,OAAOnoG,KAAKumB,EAAEv6B,QACnBnB,KAAKu9G,OAAOpoG,KAAKumB,EAAEv6B,QACnBnB,KAAKm+G,OAAOhpG,KAAK,GACjBnV,KAAKg9G,OAAO7nG,KAAK,GACjBnV,KAAKu/G,QAAQpqG,KAAK,GAElBnV,KAAKo9G,QAAUp9G,KAAKs9G,OAAOn8G,OAAS,EAKtCggH,EAAW9gH,UAAU8U,KAAO,SAAUpN,EAAM4T,EAAK2xE,GAC/C,IAAIv1D,EAAQ,IAAIs1D,EAAMtlF,EAAM4T,EAAK2xE,GAQjC,OAPAv1D,EAAMoe,OAAQ,EAEVm3C,EAAU,GAAKttF,KAAKs3C,QACxBvf,EAAMuf,MAAQt3C,KAAKs3C,MACfg2C,EAAU,GAAKttF,KAAKs3C,QAExBt3C,KAAKutC,OAAOp4B,KAAK4iB,GACVA,GAGTopF,EAAW9gH,UAAUw7F,QAAU,SAAiBhlE,GAC9C,OAAO72B,KAAKs9G,OAAOzmF,GAAQ72B,KAAKm+G,OAAOtnF,IAAS72B,KAAKu9G,OAAO1mF,IAG9DsqF,EAAW9gH,UAAU08G,eAAiB,SAAwBxqF,GAC5D,IAAK,IAAIrD,EAAMlvB,KAAKo9G,QAAS7qF,EAAOrD,KAC9BlvB,KAAKs9G,OAAO/qF,GAAQvyB,KAAKm+G,OAAO5rF,GAAQvyB,KAAKu9G,OAAOhrF,IADjBA,KAKzC,OAAOA,GAIT4uF,EAAW9gH,UAAUm+G,WAAa,SAAoBziG,GAGpD,IAFA,IAAI+U,EAEK5B,EAAMlvB,KAAKkO,IAAI/M,OAAQ4a,EAAMmT,IACpC4B,EAAK9wB,KAAKkO,IAAIxK,WAAWqY,GACpByhB,EAAQ1M,IAF4B/U,KAI3C,OAAOA,GAITolG,EAAW9gH,UAAU0gH,eAAiB,SAAwBhlG,EAAKlT,GACjE,GAAIkT,GAAOlT,EAAO,OAAOkT,EAEzB,KAAOA,EAAMlT,GACX,IAAK20B,EAAQx9B,KAAKkO,IAAIxK,aAAaqY,IAAS,OAAOA,EAAM,EAE3D,OAAOA,GAITolG,EAAW9gH,UAAUk+G,UAAY,SAAmBxiG,EAAKqG,GACvD,IAAK,IAAI8M,EAAMlvB,KAAKkO,IAAI/M,OAAQ4a,EAAMmT,GAChClvB,KAAKkO,IAAIxK,WAAWqY,KAASqG,EADQrG,KAG3C,OAAOA,GAITolG,EAAW9gH,UAAU2gH,cAAgB,SAAuBjlG,EAAKqG,EAAMvZ,GACrE,GAAIkT,GAAOlT,EAAO,OAAOkT,EAEzB,KAAOA,EAAMlT,GACX,GAAIuZ,IAASpiB,KAAKkO,IAAIxK,aAAaqY,GAAQ,OAAOA,EAAM,EAE1D,OAAOA,GAITolG,EAAW9gH,UAAU+9G,SAAW,SAAkBrY,EAAOzgE,EAAKs6E,EAAQ0B,GACpE,IAAIrgH,EAAGsgH,EAAYzwF,EAAI9U,EAAO2e,EAAMxmB,EAAOqtG,EACvC3qF,EAAOkvE,EAEX,GAAIA,GAASzgE,EACX,MAAO,GAKT,IAFAnxB,EAAQ,IAAIe,MAAMowB,EAAMygE,GAEnB9kG,EAAI,EAAG41B,EAAOyO,EAAKzO,IAAQ51B,IAAK,CAWnC,IAVAsgH,EAAa,EACbC,EAAYxlG,EAAQhc,KAAKs9G,OAAOzmF,GAI9B8D,EAFE9D,EAAO,EAAIyO,GAAOg8E,EAEbthH,KAAKu9G,OAAO1mF,GAAQ,EAEpB72B,KAAKu9G,OAAO1mF,GAGd7a,EAAQ2e,GAAQ4mF,EAAa3B,GAAQ,CAG1C,GAFA9uF,EAAK9wB,KAAKkO,IAAIxK,WAAWsY,GAErBwhB,EAAQ1M,GACC,IAAPA,EACFywF,GAAc,GAAKA,EAAavhH,KAAKu/G,QAAQ1oF,IAAS,EAEtD0qF,QAEG,MAAIvlG,EAAQwlG,EAAYxhH,KAAKm+G,OAAOtnF,IAIzC,MAFA0qF,IAKFvlG,IAMA7H,EAAMlT,GAHJsgH,EAAa3B,EAGJ,IAAI1qG,MAAMqsG,EAAa3B,EAAS,GAAGh5G,KAAK,KAAO5G,KAAKkO,IAAInL,MAAMiZ,EAAO2e,GAErE36B,KAAKkO,IAAInL,MAAMiZ,EAAO2e,GAIrC,OAAOxmB,EAAMvN,KAAK,KAIpBu6G,EAAW9gH,UAAUgtF,MAAQA,EAG7B3uF,EAAOC,QAAUwiH,G,6BC7NjB,IAAIl1B,EAAkBltF,EAAQ,KAM1B86G,EAAS,CACX,CAAE,OAAmB96G,EAAQ,MAC7B,CAAE,UAAmBA,EAAQ,MAC7B,CAAE,SAAmBA,EAAQ,MAC7B,CAAE,YAAmBA,EAAQ,MAC7B,CAAE,gBAAmBA,EAAQ,KAAgCwiG,UAC7D,CAAE,WAAmBxiG,EAAQ,KAA2BwiG,UACxD,CAAE,OAAmBxiG,EAAQ,MAC7B,CAAE,QAAmBA,EAAQ,MAC7B,CAAE,WAAmBA,EAAQ,MAC7B,CAAE,cAAmBA,EAAQ,MAC7B,CAAE,SAAmBA,EAAQ,OAG3B0iH,EAAU,CACZ,CAAE,gBAAmB1iH,EAAQ,MAC7B,CAAE,gBAAmBA,EAAQ,KAAgC+iG,aAC7D,CAAE,WAAmB/iG,EAAQ,KAA2B+iG,aACxD,CAAE,gBAAmB/iG,EAAQ,OAO/B,SAASs0G,IACP,IAAIpyG,EASJ,IAFAjB,KAAKy0G,MAAQ,IAAIxoB,EAEZhrF,EAAI,EAAGA,EAAI44G,EAAO14G,OAAQF,IAC7BjB,KAAKy0G,MAAMt/F,KAAK0kG,EAAO54G,GAAG,GAAI44G,EAAO54G,GAAG,IAW1C,IAFAjB,KAAK20G,OAAS,IAAI1oB,EAEbhrF,EAAI,EAAGA,EAAIwgH,EAAQtgH,OAAQF,IAC9BjB,KAAK20G,OAAOx/F,KAAKssG,EAAQxgH,GAAG,GAAIwgH,EAAQxgH,GAAG,IAQ/CoyG,EAAahzG,UAAUk4G,UAAY,SAAU/xG,GAC3C,IAAI+vC,EAAIt1C,EAAG8a,EAAMvV,EAAMuV,IACnBqyB,EAAQpuC,KAAKy0G,MAAMtnB,SAAS,IAC5B14E,EAAM25B,EAAMjtC,OACZ27G,EAAat2G,EAAMgpG,GAAGrqG,QAAQ23G,WAC9BhuG,EAAQtI,EAAMsI,MAGlB,QAA0B,IAAfA,EAAMiN,GAAjB,CAKA,GAAIvV,EAAM8wC,MAAQwlE,EAChB,IAAK77G,EAAI,EAAGA,EAAIwT,IAKdjO,EAAM8wC,QACNf,EAAKnI,EAAMntC,GAAGuF,GAAO,GACrBA,EAAM8wC,SAEFf,GATet1C,UAuBrBuF,EAAMuV,IAAMvV,EAAM6xG,OAGf9hE,GAAM/vC,EAAMuV,MACjBjN,EAAMiN,GAAOvV,EAAMuV,SAhCjBvV,EAAMuV,IAAMjN,EAAMiN,IAsCtBs3F,EAAahzG,UAAUkhG,SAAW,SAAU/6F,GAO1C,IANA,IAAI+vC,EAAIt1C,EACJmtC,EAAQpuC,KAAKy0G,MAAMtnB,SAAS,IAC5B14E,EAAM25B,EAAMjtC,OACZmkC,EAAM9+B,EAAM6xG,OACZyE,EAAat2G,EAAMgpG,GAAGrqG,QAAQ23G,WAE3Bt2G,EAAMuV,IAAMupB,GAAK,CAQtB,GAAI9+B,EAAM8wC,MAAQwlE,EAChB,IAAK77G,EAAI,EAAGA,EAAIwT,KACd8hC,EAAKnI,EAAMntC,GAAGuF,GAAO,IADFvF,KAMvB,GAAIs1C,GACF,GAAI/vC,EAAMuV,KAAOupB,EAAO,WAI1B9+B,EAAMosC,SAAWpsC,EAAM0H,IAAI1H,EAAMuV,OAG/BvV,EAAMosC,SACRpsC,EAAMk7G,eAUVrO,EAAahzG,UAAUme,MAAQ,SAAUlb,EAAKksG,EAAIl6F,EAAK6nG,GACrD,IAAIl8G,EAAGmtC,EAAO35B,EACVjO,EAAQ,IAAIxG,KAAK60G,MAAMvxG,EAAKksG,EAAIl6F,EAAK6nG,GAOzC,IALAn9G,KAAKuhG,SAAS/6F,GAGdiO,GADA25B,EAAQpuC,KAAK20G,OAAOxnB,SAAS,KACjBhsF,OAEPF,EAAI,EAAGA,EAAIwT,EAAKxT,IACnBmtC,EAAMntC,GAAGuF,IAKb6sG,EAAahzG,UAAUw0G,MAAQ91G,EAAQ,KAGvCL,EAAOC,QAAU00G,G,6BCnKjB,SAASsO,EAAiB7wF,GACxB,OAAQA,GACN,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACH,OAAO,EACT,QACE,OAAO,GAIbpyB,EAAOC,QAAU,SAAc6H,EAAO+iD,GAGpC,IAFA,IAAIxtC,EAAMvV,EAAMuV,IAETA,EAAMvV,EAAM6xG,SAAWsJ,EAAiBn7G,EAAM0H,IAAIxK,WAAWqY,KAClEA,IAGF,OAAIA,IAAQvV,EAAMuV,MAEbwtC,IAAU/iD,EAAMosC,SAAWpsC,EAAM0H,IAAInL,MAAMyD,EAAMuV,IAAKA,IAE3DvV,EAAMuV,IAAMA,GAEL,K,6BCrDT,IAAIyhB,EAAUz+B,EAAQ,KAAmBy+B,QAGzC9+B,EAAOC,QAAU,SAAiB6H,EAAO+iD,GACvC,IAAIq4D,EAAM1yF,EAAKnT,EAAMvV,EAAMuV,IAE3B,GAAkC,KAA9BvV,EAAM0H,IAAIxK,WAAWqY,GAAyB,OAAO,EA2BzD,IAzBA6lG,EAAOp7G,EAAMosC,QAAQzxC,OAAS,EAC9B+tB,EAAM1oB,EAAM6xG,OAMP9uD,IACCq4D,GAAQ,GAAwC,KAAnCp7G,EAAMosC,QAAQlvC,WAAWk+G,GACpCA,GAAQ,GAA4C,KAAvCp7G,EAAMosC,QAAQlvC,WAAWk+G,EAAO,IAC/Cp7G,EAAMosC,QAAUpsC,EAAMosC,QAAQrvC,QAAQ,MAAO,IAC7CiD,EAAM2O,KAAK,YAAa,KAAM,KAE9B3O,EAAMosC,QAAUpsC,EAAMosC,QAAQ7vC,MAAM,GAAI,GACxCyD,EAAM2O,KAAK,YAAa,KAAM,IAIhC3O,EAAM2O,KAAK,YAAa,KAAM,IAIlC4G,IAGOA,EAAMmT,GAAOsO,EAAQh3B,EAAM0H,IAAIxK,WAAWqY,KAASA,IAG1D,OADAvV,EAAMuV,IAAMA,GACL,I,6BChCT,IAJA,IAAIyhB,EAAUz+B,EAAQ,KAAmBy+B,QAErCqkF,EAAU,GAEL5gH,EAAI,EAAGA,EAAI,IAAKA,IAAO4gH,EAAQ1sG,KAAK,GAE7C,qCACG5O,MAAM,IAAIzF,SAAQ,SAAUgwB,GAAM+wF,EAAQ/wF,EAAGptB,WAAW,IAAM,KAGjEhF,EAAOC,QAAU,SAAgB6H,EAAO+iD,GACtC,IAAIz4B,EAAI/U,EAAMvV,EAAMuV,IAAKmT,EAAM1oB,EAAM6xG,OAErC,GAAkC,KAA9B7xG,EAAM0H,IAAIxK,WAAWqY,GAAwB,OAAO,EAIxD,KAFAA,EAEUmT,EAAK,CAGb,IAFA4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,IAEjB,KAAuB,IAAhB8lG,EAAQ/wF,GAGtB,OAFKy4B,IAAU/iD,EAAMosC,SAAWpsC,EAAM0H,IAAI6N,IAC1CvV,EAAMuV,KAAO,GACN,EAGT,GAAW,KAAP+U,EAAa,CAOf,IANKy4B,GACH/iD,EAAM2O,KAAK,YAAa,KAAM,GAGhC4G,IAEOA,EAAMmT,IACX4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,GACrByhB,EAAQ1M,KACb/U,IAIF,OADAvV,EAAMuV,IAAMA,GACL,GAMX,OAFKwtC,IAAU/iD,EAAMosC,SAAW,MAChCpsC,EAAMuV,OACC,I,6BC9CTrd,EAAOC,QAAU,SAAkB6H,EAAO+iD,GACxC,IAAIhkB,EAAOrW,EAAKva,EAAQ80E,EAAYC,EAAU3xD,EAC1Chc,EAAMvV,EAAMuV,IAGhB,GAAW,KAFFvV,EAAM0H,IAAIxK,WAAWqY,GAEJ,OAAO,EAMjC,IAJAwpB,EAAQxpB,EACRA,IACAmT,EAAM1oB,EAAM6xG,OAELt8F,EAAMmT,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,IAAwBA,IAMjE,IAJApH,EAASnO,EAAM0H,IAAInL,MAAMwiC,EAAOxpB,GAEhC0tE,EAAaC,EAAW3tE,GAEoC,KAApD0tE,EAAajjF,EAAM0H,IAAIiF,QAAQ,IAAKu2E,KAAmB,CAG7D,IAFAA,EAAWD,EAAa,EAEjBC,EAAWx6D,GAA0C,KAAnC1oB,EAAM0H,IAAIxK,WAAWgmF,IAA6BA,IAE3E,GAAIA,EAAWD,IAAe90E,EAAOxT,OASnC,OARKooD,KACHxxB,EAAgBvxB,EAAM2O,KAAK,cAAe,OAAQ,IAC5Co4E,OAAU54E,EAChBojB,EAAMt0B,QAAU+C,EAAM0H,IAAInL,MAAMgZ,EAAK0tE,GACXlmF,QAAQ,UAAW,KACnBF,QAE5BmD,EAAMuV,IAAM2tE,GACL,EAMX,OAFKngC,IAAU/iD,EAAMosC,SAAWj+B,GAChCnO,EAAMuV,KAAOpH,EAAOxT,QACb,I,6BCrCT,IAAI08B,EAAuB9+B,EAAQ,KAAmB8+B,mBAClDL,EAAuBz+B,EAAQ,KAAmBy+B,QAGtD9+B,EAAOC,QAAU,SAAc6H,EAAO+iD,GACpC,IAAIzhB,EACA1lB,EACAy+F,EACAzI,EACA0J,EACA/lG,EACAgU,EACAgyF,EACA3sG,EAEA+hB,EAAO,GACPmhF,EAAS9xG,EAAMuV,IACfmT,EAAM1oB,EAAM6xG,OACZ9yE,EAAQ/+B,EAAMuV,IACdimG,GAAiB,EAErB,GAAwC,KAApCx7G,EAAM0H,IAAIxK,WAAW8C,EAAMuV,KAAwB,OAAO,EAM9D,GAJA+lG,EAAat7G,EAAMuV,IAAM,GACzBq8F,EAAW5xG,EAAMgpG,GAAGyD,QAAQ8E,eAAevxG,EAAOA,EAAMuV,KAAK,IAG9C,EAAK,OAAO,EAG3B,IADAA,EAAMq8F,EAAW,GACPlpF,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,GAAsB,CAW1D,IALAimG,GAAiB,EAIjBjmG,IACOA,EAAMmT,IACX9M,EAAO5b,EAAM0H,IAAIxK,WAAWqY,GACvByhB,EAAQpb,IAAkB,KAATA,GAFNrG,KAIlB,GAAIA,GAAOmT,EAAO,OAAO,EAkBzB,IAdAqW,EAAQxpB,GACRgU,EAAMvpB,EAAMgpG,GAAGyD,QAAQ+E,qBAAqBxxG,EAAM0H,IAAK6N,EAAKvV,EAAM6xG,SAC1D9hE,KACNpf,EAAO3wB,EAAMgpG,GAAGsE,cAAc/jF,EAAIzsB,KAC9BkD,EAAMgpG,GAAGoE,aAAaz8E,GACxBpb,EAAMgU,EAAIhU,IAEVob,EAAO,IAMXoO,EAAQxpB,EACDA,EAAMmT,IACX9M,EAAO5b,EAAM0H,IAAIxK,WAAWqY,GACvByhB,EAAQpb,IAAkB,KAATA,GAFNrG,KAQlB,GADAgU,EAAMvpB,EAAMgpG,GAAGyD,QAAQgF,eAAezxG,EAAM0H,IAAK6N,EAAKvV,EAAM6xG,QACxDt8F,EAAMmT,GAAOqW,IAAUxpB,GAAOgU,EAAIwmB,GAMpC,IALAnhC,EAAQ2a,EAAIzsB,IACZyY,EAAMgU,EAAIhU,IAIHA,EAAMmT,IACX9M,EAAO5b,EAAM0H,IAAIxK,WAAWqY,GACvByhB,EAAQpb,IAAkB,KAATA,GAFNrG,UAKlB3G,EAAQ,IAGN2G,GAAOmT,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,MAErCimG,GAAiB,GAEnBjmG,IAGF,GAAIimG,EAAgB,CAIlB,QAAoC,IAAzBx7G,EAAM8O,IAAIwrG,WAA8B,OAAO,EAmB1D,GAjBI/kG,EAAMmT,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,IACpCwpB,EAAQxpB,EAAM,GACdA,EAAMvV,EAAMgpG,GAAGyD,QAAQ8E,eAAevxG,EAAOuV,KAClC,EACT8kG,EAAQr6G,EAAM0H,IAAInL,MAAMwiC,EAAOxpB,KAE/BA,EAAMq8F,EAAW,GAGnBr8F,EAAMq8F,EAAW,EAKdyI,IAASA,EAAQr6G,EAAM0H,IAAInL,MAAM++G,EAAY1J,MAElD2J,EAAMv7G,EAAM8O,IAAIwrG,WAAWjjF,EAAmBgjF,KAG5C,OADAr6G,EAAMuV,IAAMu8F,GACL,EAETnhF,EAAO4qF,EAAI5qF,KACX/hB,EAAQ2sG,EAAI3sG,MAwBd,OAjBKm0C,IACH/iD,EAAMuV,IAAM+lG,EACZt7G,EAAM6xG,OAASD,EAEA5xG,EAAM2O,KAAK,YAAa,IAAK,GACtC2yB,MAASA,EAAQ,CAAE,CAAE,OAAQ3Q,IAC/B/hB,GACF0yB,EAAM3yB,KAAK,CAAE,QAASC,IAGxB5O,EAAMgpG,GAAGliE,OAAOi0D,SAAS/6F,GAEVA,EAAM2O,KAAK,aAAc,KAAM,IAGhD3O,EAAMuV,IAAMA,EACZvV,EAAM6xG,OAASnpF,GACR,I,6BChJT,IAAI2O,EAAuB9+B,EAAQ,KAAmB8+B,mBAClDL,EAAuBz+B,EAAQ,KAAmBy+B,QAGtD9+B,EAAOC,QAAU,SAAe6H,EAAO+iD,GACrC,IAAIzhB,EACA1lB,EACA3e,EACAo9G,EACAzI,EACA0J,EACA/lG,EACAgmG,EACAhyF,EACA3a,EACA2iB,EACAwV,EACAhI,EACApO,EAAO,GACPmhF,EAAS9xG,EAAMuV,IACfmT,EAAM1oB,EAAM6xG,OAEhB,GAAwC,KAApC7xG,EAAM0H,IAAIxK,WAAW8C,EAAMuV,KAAwB,OAAO,EAC9D,GAA4C,KAAxCvV,EAAM0H,IAAIxK,WAAW8C,EAAMuV,IAAM,GAAsB,OAAO,EAMlE,GAJA+lG,EAAat7G,EAAMuV,IAAM,GACzBq8F,EAAW5xG,EAAMgpG,GAAGyD,QAAQ8E,eAAevxG,EAAOA,EAAMuV,IAAM,GAAG,IAGlD,EAAK,OAAO,EAG3B,IADAA,EAAMq8F,EAAW,GACPlpF,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,GAAsB,CAQ1D,IADAA,IACOA,EAAMmT,IACX9M,EAAO5b,EAAM0H,IAAIxK,WAAWqY,GACvByhB,EAAQpb,IAAkB,KAATA,GAFNrG,KAIlB,GAAIA,GAAOmT,EAAO,OAAO,EAkBzB,IAdAqW,EAAQxpB,GACRgU,EAAMvpB,EAAMgpG,GAAGyD,QAAQ+E,qBAAqBxxG,EAAM0H,IAAK6N,EAAKvV,EAAM6xG,SAC1D9hE,KACNpf,EAAO3wB,EAAMgpG,GAAGsE,cAAc/jF,EAAIzsB,KAC9BkD,EAAMgpG,GAAGoE,aAAaz8E,GACxBpb,EAAMgU,EAAIhU,IAEVob,EAAO,IAMXoO,EAAQxpB,EACDA,EAAMmT,IACX9M,EAAO5b,EAAM0H,IAAIxK,WAAWqY,GACvByhB,EAAQpb,IAAkB,KAATA,GAFNrG,KAQlB,GADAgU,EAAMvpB,EAAMgpG,GAAGyD,QAAQgF,eAAezxG,EAAM0H,IAAK6N,EAAKvV,EAAM6xG,QACxDt8F,EAAMmT,GAAOqW,IAAUxpB,GAAOgU,EAAIwmB,GAMpC,IALAnhC,EAAQ2a,EAAIzsB,IACZyY,EAAMgU,EAAIhU,IAIHA,EAAMmT,IACX9M,EAAO5b,EAAM0H,IAAIxK,WAAWqY,GACvByhB,EAAQpb,IAAkB,KAATA,GAFNrG,UAKlB3G,EAAQ,GAGV,GAAI2G,GAAOmT,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,GAErC,OADAvV,EAAMuV,IAAMu8F,GACL,EAETv8F,QACK,CAIL,QAAoC,IAAzBvV,EAAM8O,IAAIwrG,WAA8B,OAAO,EAmB1D,GAjBI/kG,EAAMmT,GAAqC,KAA9B1oB,EAAM0H,IAAIxK,WAAWqY,IACpCwpB,EAAQxpB,EAAM,GACdA,EAAMvV,EAAMgpG,GAAGyD,QAAQ8E,eAAevxG,EAAOuV,KAClC,EACT8kG,EAAQr6G,EAAM0H,IAAInL,MAAMwiC,EAAOxpB,KAE/BA,EAAMq8F,EAAW,GAGnBr8F,EAAMq8F,EAAW,EAKdyI,IAASA,EAAQr6G,EAAM0H,IAAInL,MAAM++G,EAAY1J,MAElD2J,EAAMv7G,EAAM8O,IAAIwrG,WAAWjjF,EAAmBgjF,KAG5C,OADAr6G,EAAMuV,IAAMu8F,GACL,EAETnhF,EAAO4qF,EAAI5qF,KACX/hB,EAAQ2sG,EAAI3sG,MA6Bd,OAtBKm0C,IACH9lD,EAAU+C,EAAM0H,IAAInL,MAAM++G,EAAY1J,GAEtC5xG,EAAMgpG,GAAGliE,OAAO9uB,MACd/a,EACA+C,EAAMgpG,GACNhpG,EAAM8O,IACNi4B,EAAS,KAGXxV,EAAiBvxB,EAAM2O,KAAK,QAAS,MAAO,IACtC2yB,MAAWA,EAAQ,CAAE,CAAE,MAAO3Q,GAAQ,CAAE,MAAO,KACrDY,EAAMujC,SAAW/tB,EACjBxV,EAAMt0B,QAAWA,EAEb2R,GACF0yB,EAAM3yB,KAAK,CAAE,QAASC,KAI1B5O,EAAMuV,IAAMA,EACZvV,EAAM6xG,OAASnpF,GACR,I,6BChJT,IAAI+yF,EAAc,2IACdC,EAAc,uDAGlBxjH,EAAOC,QAAU,SAAkB6H,EAAO+iD,GACxC,IAAI65C,EAAM+e,EAAWC,EAAY56G,EAAK8yG,EAASviF,EAC3Chc,EAAMvV,EAAMuV,IAEhB,OAAkC,KAA9BvV,EAAM0H,IAAIxK,WAAWqY,QAEzBqnF,EAAO58F,EAAM0H,IAAInL,MAAMgZ,IAEd5I,QAAQ,KAAO,KAEpB+uG,EAAYpwG,KAAKsxF,IAGnB57F,GAFA26G,EAAY/e,EAAKvwF,MAAMqvG,IAEP,GAAGn/G,MAAM,GAAI,GAC7Bu3G,EAAU9zG,EAAMgpG,GAAGsE,cAActsG,KAC5BhB,EAAMgpG,GAAGoE,aAAa0G,KAEtB/wD,KACHxxB,EAAgBvxB,EAAM2O,KAAK,YAAa,IAAK,IACvC2yB,MAAU,CAAE,CAAE,OAAQwyE,IAC5BviF,EAAMw1D,OAAU,WAChBx1D,EAAMy1D,KAAU,QAEhBz1D,EAAgBvxB,EAAM2O,KAAK,OAAQ,GAAI,IACjC1R,QAAU+C,EAAMgpG,GAAGwE,kBAAkBxsG,IAE3CuwB,EAAgBvxB,EAAM2O,KAAK,aAAc,KAAM,IACzCo4E,OAAU,WAChBx1D,EAAMy1D,KAAU,QAGlBhnF,EAAMuV,KAAOomG,EAAU,GAAGhhH,QACnB,MAGL8gH,EAASnwG,KAAKsxF,KAGhB57F,GAFA46G,EAAahf,EAAKvwF,MAAMovG,IAEP,GAAGl/G,MAAM,GAAI,GAC9Bu3G,EAAU9zG,EAAMgpG,GAAGsE,cAAc,UAAYtsG,KACxChB,EAAMgpG,GAAGoE,aAAa0G,KAEtB/wD,KACHxxB,EAAgBvxB,EAAM2O,KAAK,YAAa,IAAK,IACvC2yB,MAAU,CAAE,CAAE,OAAQwyE,IAC5BviF,EAAMw1D,OAAU,WAChBx1D,EAAMy1D,KAAU,QAEhBz1D,EAAgBvxB,EAAM2O,KAAK,OAAQ,GAAI,IACjC1R,QAAU+C,EAAMgpG,GAAGwE,kBAAkBxsG,IAE3CuwB,EAAgBvxB,EAAM2O,KAAK,aAAc,KAAM,IACzCo4E,OAAU,WAChBx1D,EAAMy1D,KAAU,QAGlBhnF,EAAMuV,KAAOqmG,EAAW,GAAGjhH,QACpB,Q,6BC9DX,IAAIkgG,EAActiG,EAAQ,KAAqBsiG,YAU/C3iG,EAAOC,QAAU,SAAqB6H,EAAO+iD,GAC3C,IAAIz4B,EAAIje,EAAOqc,EACXnT,EAAMvV,EAAMuV,IAEhB,QAAKvV,EAAMgpG,GAAGrqG,QAAQ4H,OAGtBmiB,EAAM1oB,EAAM6xG,SACsB,KAA9B7xG,EAAM0H,IAAIxK,WAAWqY,IACrBA,EAAM,GAAKmT,OAMJ,MADX4B,EAAKtqB,EAAM0H,IAAIxK,WAAWqY,EAAM,KAErB,KAAP+U,GACO,KAAPA,IAxBN,SAAkBA,GAEhB,IAAIuxF,EAAU,GAALvxF,EACT,OAAQuxF,GAAM,IAAiBA,GAAM,IAsBhCC,CAASxxF,SAIdje,EAAQrM,EAAM0H,IAAInL,MAAMgZ,GAAKlJ,MAAMwuF,MAG9B93C,IACa/iD,EAAM2O,KAAK,cAAe,GAAI,GACxC1R,QAAU+C,EAAM0H,IAAInL,MAAMgZ,EAAKA,EAAMlJ,EAAM,GAAG1R,SAEtDqF,EAAMuV,KAAOlJ,EAAM,GAAG1R,QACf,Q,6BCzCT,IAAIi7B,EAAoBr9B,EAAQ,KAC5BE,EAAoBF,EAAQ,KAAmBE,IAC/C28B,EAAoB78B,EAAQ,KAAmB68B,kBAC/CC,EAAoB98B,EAAQ,KAAmB88B,cAG/C0mF,EAAa,uCACbC,EAAa,4BAGjB9jH,EAAOC,QAAU,SAAgB6H,EAAO+iD,GACtC,IAAQnnC,EAAMvP,EAAOkJ,EAAMvV,EAAMuV,IAAKmT,EAAM1oB,EAAM6xG,OAElD,GAAkC,KAA9B7xG,EAAM0H,IAAIxK,WAAWqY,GAAwB,OAAO,EAExD,GAAIA,EAAM,EAAImT,EAGZ,GAAW,KAFN1oB,EAAM0H,IAAIxK,WAAWqY,EAAM,IAI9B,GADAlJ,EAAQrM,EAAM0H,IAAInL,MAAMgZ,GAAKlJ,MAAM0vG,GAOjC,OALKh5D,IACHnnC,EAAqC,MAA9BvP,EAAM,GAAG,GAAG8E,cAAwBwlB,SAAStqB,EAAM,GAAG9P,MAAM,GAAI,IAAMo6B,SAAStqB,EAAM,GAAI,IAChGrM,EAAMosC,SAAWhX,EAAkBxZ,GAAQyZ,EAAczZ,GAAQyZ,EAAc,QAEjFr1B,EAAMuV,KAAOlJ,EAAM,GAAG1R,QACf,OAIT,IADA0R,EAAQrM,EAAM0H,IAAInL,MAAMgZ,GAAKlJ,MAAM2vG,KAE7BvjH,EAAIm9B,EAAUvpB,EAAM,IAGtB,OAFK02C,IAAU/iD,EAAMosC,SAAWxW,EAASvpB,EAAM,KAC/CrM,EAAMuV,KAAOlJ,EAAM,GAAG1R,QACf,EAQf,OAFKooD,IAAU/iD,EAAMosC,SAAW,KAChCpsC,EAAMuV,OACC,I,6BCzCTrd,EAAOC,QAAU,SAAoB6H,GACnC,IAAIvF,EAAGqrB,EAAGm2F,EAAWC,EACjBhhB,EAAal7F,EAAMk7F,WACnBxyE,EAAM1oB,EAAMk7F,WAAWvgG,OAE3B,IAAKF,EAAI,EAAGA,EAAIiuB,EAAKjuB,IAGnB,IAFAwhH,EAAY/gB,EAAWzgG,IAER0M,MAIf,IAFA2e,EAAIrrB,EAAIwhH,EAAU9gB,KAAO,EAElBr1E,GAAK,GAAG,CAGb,IAFAo2F,EAAYhhB,EAAWp1E,IAETle,MACVs0G,EAAU/tG,SAAW8tG,EAAU9tG,QAC/B+tG,EAAUp9E,IAAM,GAChBo9E,EAAUprE,QAAUmrE,EAAUnrE,MAQhC,MALiBorE,EAAU/0G,OAAS80G,EAAUr0G,YACF,IAArBs0G,EAAUvhH,aACW,IAArBshH,EAAUthH,SAChBuhH,EAAUvhH,OAASshH,EAAUthH,QAAU,GAAM,GAE9C,CACdshH,EAAU9gB,KAAO1gG,EAAIqrB,EACrBm2F,EAAUr0G,MAAO,EACjBs0G,EAAUp9E,IAAOrkC,EACjByhH,EAAU/gB,KAAO,EACjB,MAIJr1E,GAAKo2F,EAAU/gB,KAAO,K,6BCnC5BjjG,EAAOC,QAAU,SAAuB6H,GACtC,IAAIm8G,EAAMhoF,EACN2c,EAAQ,EACR/J,EAAS/mC,EAAM+mC,OACfre,EAAM1oB,EAAM+mC,OAAOpsC,OAEvB,IAAKwhH,EAAOhoF,EAAO,EAAGgoF,EAAOzzF,EAAKyzF,IAEhCrrE,GAAS/J,EAAOo1E,GAAMr1B,QACtB//C,EAAOo1E,GAAMrrE,MAAQA,EAEK,SAAtB/J,EAAOo1E,GAAM56G,MACb46G,EAAO,EAAIzzF,GACe,SAA1Bqe,EAAOo1E,EAAO,GAAG56G,KAGnBwlC,EAAOo1E,EAAO,GAAGl/G,QAAU8pC,EAAOo1E,GAAMl/G,QAAU8pC,EAAOo1E,EAAO,GAAGl/G,SAE/Dk/G,IAAShoF,IAAQ4S,EAAO5S,GAAQ4S,EAAOo1E,IAE3ChoF,KAIAgoF,IAAShoF,IACX4S,EAAOpsC,OAASw5B,K,6BCzBpB,IAAI0yD,EAAiBtuF,EAAQ,KACzB0+B,EAAiB1+B,EAAQ,KAAmB0+B,aAC5CE,EAAiB5+B,EAAQ,KAAmB4+B,YAC5CD,EAAiB3+B,EAAQ,KAAmB2+B,eAGhD,SAASklF,EAAY10G,EAAKshG,EAAIl6F,EAAK6nG,GACjCn9G,KAAKkO,IAAMA,EACXlO,KAAKsV,IAAMA,EACXtV,KAAKwvG,GAAKA,EACVxvG,KAAKutC,OAAS4vE,EAEdn9G,KAAK+b,IAAM,EACX/b,KAAKq4G,OAASr4G,KAAKkO,IAAI/M,OACvBnB,KAAKs3C,MAAQ,EACbt3C,KAAK4yC,QAAU,GACf5yC,KAAK6iH,aAAe,EAEpB7iH,KAAK8O,MAAQ,GAGb9O,KAAK0hG,WAAa,GAMpBkhB,EAAYviH,UAAUqhH,YAAc,WAClC,IAAI3pF,EAAQ,IAAIs1D,EAAM,OAAQ,GAAI,GAKlC,OAJAt1D,EAAMt0B,QAAUzD,KAAK4yC,QACrB7a,EAAMuf,MAAQt3C,KAAK6iH,aACnB7iH,KAAKutC,OAAOp4B,KAAK4iB,GACjB/3B,KAAK4yC,QAAU,GACR7a,GAOT6qF,EAAYviH,UAAU8U,KAAO,SAAUpN,EAAM4T,EAAK2xE,GAC5CttF,KAAK4yC,SACP5yC,KAAK0hH,cAGP,IAAI3pF,EAAQ,IAAIs1D,EAAMtlF,EAAM4T,EAAK2xE,GAQjC,OANIA,EAAU,GAAKttF,KAAKs3C,QACxBvf,EAAMuf,MAAQt3C,KAAKs3C,MACfg2C,EAAU,GAAKttF,KAAKs3C,QAExBt3C,KAAK6iH,aAAe7iH,KAAKs3C,MACzBt3C,KAAKutC,OAAOp4B,KAAK4iB,GACVA,GAUT6qF,EAAYviH,UAAUohG,WAAa,SAAUl8D,EAAOu9E,GAClD,IAAiBlH,EAAUC,EAAUn6D,EAAOkgD,EAAUC,EAClDma,EAAkBF,EAClBG,EAAkBF,EAFlBhgG,EAAMwpB,EAGNw9E,GAAgB,EAChBC,GAAiB,EACjB9zF,EAAMlvB,KAAKq4G,OACX1jG,EAAS3U,KAAKkO,IAAIxK,WAAW6hC,GAKjC,IAFAq2E,EAAWr2E,EAAQ,EAAIvlC,KAAKkO,IAAIxK,WAAW6hC,EAAQ,GAAK,GAEjDxpB,EAAMmT,GAAOlvB,KAAKkO,IAAIxK,WAAWqY,KAASpH,GAAUoH,IAqC3D,OAnCA2lC,EAAQ3lC,EAAMwpB,EAGds2E,EAAW9/F,EAAMmT,EAAMlvB,KAAKkO,IAAIxK,WAAWqY,GAAO,GAElD+/F,EAAkBp+E,EAAek+E,IAAaj+E,EAAY/5B,OAAOo4B,aAAa4/E,IAC9EG,EAAkBr+E,EAAem+E,IAAal+E,EAAY/5B,OAAOo4B,aAAa6/E,IAE9EG,EAAmBv+E,EAAam+E,IAChCK,EAAmBx+E,EAAao+E,IAG9BkH,GAAgB,EACPhH,IACHC,GAAoBF,IACxBiH,GAAgB,IAIhB/G,EACFgH,GAAiB,EACRlH,IACHG,GAAoBF,IACxBiH,GAAiB,IAIhBF,GAIHlhB,EAAYmhB,EACZlhB,EAAYmhB,IAJZphB,EAAYmhB,KAAoBC,GAAkBlH,GAClDja,EAAYmhB,KAAoBD,GAAkBhH,IAM7C,CACLna,SAAWA,EACXC,UAAWA,EACX1gG,OAAWugD,IAMfkhE,EAAYviH,UAAUgtF,MAAQA,EAG9B3uF,EAAOC,QAAUikH,G,6BCzHjB,SAAS/qG,EAAO9W,GACd,IAAIupB,EAAUpV,MAAM7U,UAAU0C,MAAMvC,KAAKwC,UAAW,GAUpD,OARAsnB,EAAQxpB,SAAQ,SAAUsE,GACnBA,GAELhF,OAAOkP,KAAKlK,GAAQtE,SAAQ,SAAUM,GACpCL,EAAIK,GAAOgE,EAAOhE,SAIfL,EAGT,SAAS+7B,EAAO/7B,GAAO,OAAOX,OAAOC,UAAUF,SAASK,KAAKO,GAI7D,SAASF,EAAWE,GAAO,MAAuB,sBAAhB+7B,EAAO/7B,GAGzC,SAAS68B,EAASt6B,GAAO,OAAOA,EAAIC,QAAQ,uBAAwB,QAKpE,IAAIunD,EAAiB,CACnBm4D,WAAW,EACXC,YAAY,EACZC,SAAS,GAWX,IAAIC,EAAiB,CACnB,QAAS,CACPC,SAAU,SAAU9iF,EAAMxkB,EAAKhc,GAC7B,IAAIqjG,EAAO7iE,EAAKx9B,MAAMgZ,GAQtB,OANKhc,EAAK+S,GAAGwwG,OAEXvjH,EAAK+S,GAAGwwG,KAAQ,IAAIlxG,OAClB,UAAYrS,EAAK+S,GAAGywG,SAAWxjH,EAAK+S,GAAG0wG,qBAAuBzjH,EAAK+S,GAAG2wG,SAAU,MAGhF1jH,EAAK+S,GAAGwwG,KAAKxxG,KAAKsxF,GACbA,EAAKvwF,MAAM9S,EAAK+S,GAAGwwG,MAAM,GAAGniH,OAE9B,IAGX,SAAW,QACX,OAAW,QACX,KAAW,CACTkiH,SAAU,SAAU9iF,EAAMxkB,EAAKhc,GAC7B,IAAIqjG,EAAO7iE,EAAKx9B,MAAMgZ,GAkBtB,OAhBKhc,EAAK+S,GAAG4wG,UAEX3jH,EAAK+S,GAAG4wG,QAAW,IAAItxG,OACrB,IACArS,EAAK+S,GAAGywG,SAGR,sBAAwBxjH,EAAK+S,GAAG6wG,WAAa,SAAW5jH,EAAK+S,GAAG8wG,gBAAkB,IAClF7jH,EAAK+S,GAAG+wG,SACR9jH,EAAK+S,GAAGgxG,oBACR/jH,EAAK+S,GAAG2wG,SAER,MAIA1jH,EAAK+S,GAAG4wG,QAAQ5xG,KAAKsxF,GAEnBrnF,GAAO,GAAuB,MAAlBwkB,EAAKxkB,EAAM,IACvBA,GAAO,GAAuB,MAAlBwkB,EAAKxkB,EAAM,GADqB,EAEzCqnF,EAAKvwF,MAAM9S,EAAK+S,GAAG4wG,SAAS,GAAGviH,OAEjC,IAGX,UAAW,CACTkiH,SAAU,SAAU9iF,EAAMxkB,EAAKhc,GAC7B,IAAIqjG,EAAO7iE,EAAKx9B,MAAMgZ,GAOtB,OALKhc,EAAK+S,GAAGixG,SACXhkH,EAAK+S,GAAGixG,OAAU,IAAI3xG,OACpB,IAAMrS,EAAK+S,GAAGkxG,eAAiB,IAAMjkH,EAAK+S,GAAGmxG,gBAAiB,MAG9DlkH,EAAK+S,GAAGixG,OAAOjyG,KAAKsxF,GACfA,EAAKvwF,MAAM9S,EAAK+S,GAAGixG,QAAQ,GAAG5iH,OAEhC,KAWT+iH,EAAe,8EAA8E39G,MAAM,KA8BvG,SAASilC,EAAQzrC,GAGf,IAAI+S,EAAK/S,EAAK+S,GAAK/T,EAAQ,IAARA,CAAoBgB,EAAKokH,UAGxCC,EAAOrkH,EAAKskH,SAASthH,QAWzB,SAASuhH,EAAMC,GAAO,OAAOA,EAAIhhH,QAAQ,SAAUuP,EAAG0xG,UATtDzkH,EAAK0kH,YAEA1kH,EAAK2kH,mBACRN,EAAKjvG,KA5Ca,2VA8CpBivG,EAAKjvG,KAAKrC,EAAG6xG,QAEb7xG,EAAG0xG,SAAWJ,EAAKx9G,KAAK,KAIxBkM,EAAG8xG,YAAmBxyG,OAAOkyG,EAAMxxG,EAAG+xG,iBAAkB,KACxD/xG,EAAGgyG,WAAmB1yG,OAAOkyG,EAAMxxG,EAAGiyG,gBAAiB,KACvDjyG,EAAGkyG,iBAAmB5yG,OAAOkyG,EAAMxxG,EAAGmyG,sBAAuB,KAC7DnyG,EAAGoyG,gBAAmB9yG,OAAOkyG,EAAMxxG,EAAGqyG,qBAAsB,KAM5D,IAAIxY,EAAU,GAId,SAASyY,EAAY3lH,EAAMc,GACzB,MAAM,IAAIqT,MAAM,+BAAiCnU,EAAO,MAAQc,GAHlER,EAAKslH,aAAe,GAMpBjlH,OAAOkP,KAAKvP,EAAKulH,aAAaxkH,SAAQ,SAAUrB,GAC9C,IAAIc,EAAMR,EAAKulH,YAAY7lH,GAG3B,GAAY,OAARc,EAAJ,CAEA,IAAImpG,EAAW,CAAE2Z,SAAU,KAAMx7G,KAAM,MAIvC,GAFA9H,EAAKslH,aAAa5lH,GAAQiqG,EAzKkB,oBAAhB5sE,EA2Kfv8B,GAiBX,OA3LN,SAAkBQ,GAAO,MAAuB,oBAAhB+7B,EAAO/7B,GA2K7BwkH,CAAShlH,EAAI8iH,UAENxiH,EAAWN,EAAI8iH,UACxB3Z,EAAS2Z,SAAW9iH,EAAI8iH,SAExB+B,EAAY3lH,EAAMc,GAJlBmpG,EAAS2Z,SAnEjB,SAAyBvwG,GACvB,OAAO,SAAUytB,EAAMxkB,GACrB,IAAIqnF,EAAO7iE,EAAKx9B,MAAMgZ,GAEtB,OAAIjJ,EAAGhB,KAAKsxF,GACHA,EAAKvwF,MAAMC,GAAI,GAAG3R,OAEpB,GA4DiBqkH,CAAgBjlH,EAAI8iH,eAOtCxiH,EAAWN,EAAIgX,WACjBmyF,EAASnyF,UAAYhX,EAAIgX,UACfhX,EAAIgX,UAGd6tG,EAAY3lH,EAAMc,GAFlBmpG,EAASnyF,UAjER,SAAU1E,EAAO9S,GACtBA,EAAKwX,UAAU1E,MAxHnB,SAAkB9R,GAAO,MAAuB,oBAAhB+7B,EAAO/7B,GAgM/BgB,CAASxB,GAKb6kH,EAAY3lH,EAAMc,GAJhBosG,EAAQx3F,KAAK1V,OAWjBktG,EAAQ7rG,SAAQ,SAAUkiG,GACnBjjG,EAAKslH,aAAatlH,EAAKulH,YAAYtiB,MAMxCjjG,EAAKslH,aAAariB,GAAOqgB,SACvBtjH,EAAKslH,aAAatlH,EAAKulH,YAAYtiB,IAAQqgB,SAC7CtjH,EAAKslH,aAAariB,GAAOzrF,UACvBxX,EAAKslH,aAAatlH,EAAKulH,YAAYtiB,IAAQzrF,cAM/CxX,EAAKslH,aAAa,IAAM,CAAEhC,SAAU,KAAM9rG,UArGnC,SAAU1E,EAAO9S,GACtBA,EAAKwX,UAAU1E,KAyGjB,IAAI4yG,EAAQrlH,OAAOkP,KAAKvP,EAAKslH,cACRrrG,QAAO,SAAUva,GAEhB,OAAOA,EAAK0B,OAAS,GAAKpB,EAAKslH,aAAa5lH,MAE7Csa,IAAI6jB,GACJh3B,KAAK,KAE1B7G,EAAK+S,GAAG4yG,YAAgBtzG,OAAO,oBAA2BU,EAAG6yG,SAAW,MAAQF,EAAQ,IAAK,KAC7F1lH,EAAK+S,GAAG8yG,cAAgBxzG,OAAO,oBAA2BU,EAAG6yG,SAAW,MAAQF,EAAQ,IAAK,MAE7F1lH,EAAK+S,GAAG4nG,QAAUtoG,OAChB,IAAMrS,EAAK+S,GAAG4yG,YAAYtgH,OAAS,MAAQrF,EAAK+S,GAAGoyG,gBAAgB9/G,OAAS,MAC5E,KAxIJ,SAAwBrF,GACtBA,EAAK8lH,WAAa,EAClB9lH,EAAK+lH,eAAmB,GA6IxBC,CAAehmH,GAQjB,SAASimH,EAAMjmH,EAAM+0B,GACnB,IAAIyQ,EAAQxlC,EAAK8lH,UACbvgF,EAAQvlC,EAAKkmH,eACb1lF,EAAQxgC,EAAK+lH,eAAe/iH,MAAMwiC,EAAOD,GAO7CtlC,KAAKygC,OAAY1gC,EAAKmmH,WAAWvuG,cAMjC3X,KAAKqT,MAAYkyB,EAAQzQ,EAMzB90B,KAAKwS,UAAY8yB,EAAMxQ,EAMvB90B,KAAK2lB,IAAY4a,EAMjBvgC,KAAKugC,KAAYA,EAMjBvgC,KAAKwH,IAAY+4B,EAGnB,SAAS4lF,EAAYpmH,EAAM+0B,GACzB,IAAIjiB,EAAQ,IAAImzG,EAAMjmH,EAAM+0B,GAI5B,OAFA/0B,EAAKslH,aAAaxyG,EAAM4tB,QAAQlpB,UAAU1E,EAAO9S,GAE1C8S,EA0CT,SAASygG,EAAU8S,EAASjhH,GAC1B,KAAMnF,gBAAgBszG,GACpB,OAAO,IAAIA,EAAU8S,EAASjhH,GAvUlC,IAAsBpE,EA0UfoE,IA1UepE,EA2UDqlH,EA1UZhmH,OAAOkP,KAAKvO,GAAO,IAAI2qC,QAAO,SAAUi5C,EAAKjsE,GAClD,OAAOisE,GAAO75B,EAAezpD,eAAeqX,MAC3C,KAyUCvT,EAAUihH,EACVA,EAAU,KAIdpmH,KAAKmkH,SAAqBtsG,EAAO,GAAIizC,EAAgB3lD,GAGrDnF,KAAK6lH,WAAsB,EAC3B7lH,KAAKimH,gBAAsB,EAC3BjmH,KAAKkmH,WAAqB,GAC1BlmH,KAAK8lH,eAAqB,GAE1B9lH,KAAKslH,YAAqBztG,EAAO,GAAIurG,EAAgBgD,GACrDpmH,KAAKqlH,aAAqB,GAE1BrlH,KAAKqkH,SAAqBH,EAC1BlkH,KAAK0kH,mBAAqB,EAE1B1kH,KAAK8S,GAAK,GAEV04B,EAAQxrC,MAWVszG,EAAUjzG,UAAU8J,IAAM,SAAas2B,EAAQ4lF,GAG7C,OAFArmH,KAAKslH,YAAY7kF,GAAU4lF,EAC3B76E,EAAQxrC,MACDA,MAUTszG,EAAUjzG,UAAUyK,IAAM,SAAa3F,GAErC,OADAnF,KAAKmkH,SAAWtsG,EAAO7X,KAAKmkH,SAAUh/G,GAC/BnF,MASTszG,EAAUjzG,UAAUyR,KAAO,SAAcyuB,GAKvC,GAHAvgC,KAAK8lH,eAAiBvlF,EACtBvgC,KAAK6lH,WAAkB,GAElBtlF,EAAKp/B,OAAU,OAAO,EAE3B,IAAIqkB,EAAG8gG,EAAIC,EAAI9xG,EAAKqgB,EAAOjkB,EAAMiC,EAAI0zG,EAGrC,GAAIxmH,KAAK8S,GAAG4yG,YAAY5zG,KAAKyuB,GAG3B,KAFAztB,EAAK9S,KAAK8S,GAAG8yG,eACVpzG,UAAY,EACgB,QAAvBgT,EAAI1S,EAAGlU,KAAK2hC,KAElB,GADA9rB,EAAMzU,KAAKymH,aAAalmF,EAAM/a,EAAE,GAAI1S,EAAGN,WAC9B,CACPxS,KAAKkmH,WAAiB1gG,EAAE,GACxBxlB,KAAK6lH,UAAiBrgG,EAAEnS,MAAQmS,EAAE,GAAGrkB,OACrCnB,KAAKimH,eAAiBzgG,EAAEnS,MAAQmS,EAAE,GAAGrkB,OAASsT,EAC9C,MA8CN,OAzCIzU,KAAKmkH,SAASlB,WAAajjH,KAAKqlH,aAAa,WAE/CmB,EAAUjmF,EAAKjJ,OAAOt3B,KAAK8S,GAAGoyG,mBACf,IAETllH,KAAK6lH,UAAY,GAAKW,EAAUxmH,KAAK6lH,YAC0D,QAA5FS,EAAK/lF,EAAK1tB,MAAM7S,KAAKmkH,SAAShB,QAAUnjH,KAAK8S,GAAGgyG,WAAa9kH,KAAK8S,GAAGkyG,qBAExElwF,EAAQwxF,EAAGjzG,MAAQizG,EAAG,GAAGnlH,QAErBnB,KAAK6lH,UAAY,GAAK/wF,EAAQ90B,KAAK6lH,aACrC7lH,KAAKkmH,WAAiB,GACtBlmH,KAAK6lH,UAAiB/wF,EACtB90B,KAAKimH,eAAiBK,EAAGjzG,MAAQizG,EAAG,GAAGnlH,SAO7CnB,KAAKmkH,SAASjB,YAAcljH,KAAKqlH,aAAa,YAEvC9kF,EAAKptB,QAAQ,MACR,GAGmC,QAA1CozG,EAAKhmF,EAAK1tB,MAAM7S,KAAK8S,GAAG8xG,gBAE3B9vF,EAAQyxF,EAAGlzG,MAAQkzG,EAAG,GAAGplH,OACzB0P,EAAQ01G,EAAGlzG,MAAQkzG,EAAG,GAAGplH,QAErBnB,KAAK6lH,UAAY,GAAK/wF,EAAQ90B,KAAK6lH,WAClC/wF,IAAU90B,KAAK6lH,WAAah1G,EAAO7Q,KAAKimH,kBAC3CjmH,KAAKkmH,WAAiB,UACtBlmH,KAAK6lH,UAAiB/wF,EACtB90B,KAAKimH,eAAiBp1G,IAMvB7Q,KAAK6lH,WAAa,GAW3BvS,EAAUjzG,UAAUq6G,QAAU,SAAiBn6E,GAC7C,OAAOvgC,KAAK8S,GAAG4nG,QAAQ5oG,KAAKyuB,IAa9B+yE,EAAUjzG,UAAUomH,aAAe,SAAsBlmF,EAAME,EAAQ1kB,GAErE,OAAK/b,KAAKqlH,aAAa5kF,EAAO9oB,eAGvB3X,KAAKqlH,aAAa5kF,EAAO9oB,eAAe0rG,SAAS9iF,EAAMxkB,EAAK/b,MAF1D,GAsBXszG,EAAUjzG,UAAUwS,MAAQ,SAAe0tB,GACzC,IAAIzL,EAAQ,EAAGjyB,EAAS,GAGpB7C,KAAK6lH,WAAa,GAAK7lH,KAAK8lH,iBAAmBvlF,IACjD19B,EAAOsS,KAAKgxG,EAAYnmH,KAAM80B,IAC9BA,EAAQ90B,KAAKimH,gBAOf,IAHA,IAAI7iB,EAAOtuE,EAAQyL,EAAKx9B,MAAM+xB,GAASyL,EAGhCvgC,KAAK8R,KAAKsxF,IACfvgG,EAAOsS,KAAKgxG,EAAYnmH,KAAM80B,IAE9BsuE,EAAOA,EAAKrgG,MAAM/C,KAAKimH,gBACvBnxF,GAAS90B,KAAKimH,eAGhB,OAAIpjH,EAAO1B,OACF0B,EAGF,MAmBTywG,EAAUjzG,UAAU+jH,KAAO,SAAcr6F,EAAM28F,GAG7C,OAFA38F,EAAO7U,MAAM5U,QAAQypB,GAAQA,EAAO,CAAEA,GAEjC28F,GAOL1mH,KAAKqkH,SAAWrkH,KAAKqkH,SAASx5G,OAAOkf,GACJqhB,OACApxB,QAAO,SAAUgD,EAAIgwE,EAAK/0D,GACzB,OAAOjb,IAAOib,EAAI+0D,EAAM,MAEzB9/C,UAEjC1B,EAAQxrC,MACDA,OAdLA,KAAKqkH,SAAWt6F,EAAKhnB,QACrB/C,KAAK0kH,mBAAoB,EACzBl5E,EAAQxrC,MACDA,OAmBXszG,EAAUjzG,UAAUkX,UAAY,SAAmB1E,GAK5CA,EAAM4tB,SAAU5tB,EAAMrL,IAAM,UAAYqL,EAAMrL,KAE9B,YAAjBqL,EAAM4tB,QAAyB,YAAY3uB,KAAKe,EAAMrL,OACxDqL,EAAMrL,IAAM,UAAYqL,EAAMrL,MAUlC8rG,EAAUjzG,UAAUokH,UAAY,aAIhC/lH,EAAOC,QAAU20G,G,6BCxnBjB50G,EAAOC,QAAU,SAAUsoF,GACzB,IAAIn0E,EAAK,GAGTA,EAAG6zG,QAAU5nH,EAAQ,KAAiCqG,OACtD0N,EAAG8zG,OAAU7nH,EAAQ,KAAgCqG,OACrD0N,EAAG+zG,MAAU9nH,EAAQ,KAA+BqG,OACpD0N,EAAGg0G,MAAU/nH,EAAQ,KAA+BqG,OAGpD0N,EAAG6yG,SAAW,CAAE7yG,EAAG+zG,MAAO/zG,EAAGg0G,MAAOh0G,EAAG8zG,QAAShgH,KAAK,KAGrDkM,EAAGi0G,QAAU,CAAEj0G,EAAG+zG,MAAO/zG,EAAG8zG,QAAShgH,KAAK,KAiK1C,OAxJAkM,EAAGk0G,kBAA0B,eAAmCl0G,EAAG6yG,SAAW,IAAM7yG,EAAG6zG,QAAU,IAMjG7zG,EAAGm0G,QAED,yFAGFn0G,EAAGywG,SAAc,YAAczwG,EAAGi0G,QAAU,uBAE5Cj0G,EAAG+wG,SAED,kFAEF/wG,EAAGgxG,oBAED,cAAkChxG,EAAG6yG,SAAW,6BAA+B7yG,EAAG6yG,SAAW,KAE/F7yG,EAAG2wG,SAED,iBAGc3wG,EAAGi0G,QAHjB,0CAIoBj0G,EAAGi0G,QAJvB,wBAKoBj0G,EAAGi0G,QALvB,wBAMoBj0G,EAAGi0G,QANvB,wBAOoBj0G,EAAGi0G,QAPvB,yBAQoBj0G,EAAGi0G,QARvB,qBASiBj0G,EAAGk0G,kBATpB,sCAiBiBl0G,EAAGi0G,QAAU,WACvB9/B,GAAQA,EAAK,OACZ,6BAEA,SAEF,SAAWn0E,EAAGi0G,QAvBpB,YAwBiBj0G,EAAGi0G,QAxBpB,gBAyBiBj0G,EAAGi0G,QAzBpB,iBAgCFj0G,EAAGkxG,eAED,iEAEFlxG,EAAG6xG,OAED,wBAKF7xG,EAAG8wG,gBAGD,MACE9wG,EAAG6xG,OACH,IACA7xG,EAAGk0G,kBAHL,UAMFl0G,EAAG6wG,WAED,MACE7wG,EAAG6xG,OADL,OAGU7xG,EAAGk0G,kBAHb,QAKUl0G,EAAGk0G,kBAAoB,QAAUl0G,EAAGk0G,kBAAoB,UAAYl0G,EAAGk0G,kBALjF,KAQFl0G,EAAGo0G,SAED,eAIgBp0G,EAAG6wG,WAAa,SAAW7wG,EAAG6wG,WAJ9C,KAOF7wG,EAAGq0G,eAED,MACEr0G,EAAGm0G,QADL,aAGgBn0G,EAAG6wG,WAHnB,qBAMF7wG,EAAGs0G,qBAED,YAAct0G,EAAG6wG,WAAa,oBAEhC7wG,EAAGmxG,gBAEDnxG,EAAGo0G,SAAWp0G,EAAGgxG,oBAEnBhxG,EAAGu0G,sBAEDv0G,EAAGq0G,eAAiBr0G,EAAGgxG,oBAEzBhxG,EAAG0wG,qBAED1wG,EAAGo0G,SAAWp0G,EAAG+wG,SAAW/wG,EAAGgxG,oBAEjChxG,EAAGw0G,2BAEDx0G,EAAGq0G,eAAiBr0G,EAAG+wG,SAAW/wG,EAAGgxG,oBAEvChxG,EAAGy0G,iCAEDz0G,EAAGs0G,qBAAuBt0G,EAAG+wG,SAAW/wG,EAAGgxG,oBAO7ChxG,EAAGqyG,oBAED,sDAAwDryG,EAAG6yG,SAAW,SAExE7yG,EAAG+xG,gBAEC,kBAAsC/xG,EAAGi0G,QAAzC,KACMj0G,EAAGkxG,eAAiB,IAAMlxG,EAAGu0G,sBAAwB,IAE/Dv0G,EAAGiyG,eAGC,mCAA0CjyG,EAAG6yG,SAA7C,qBAC0B7yG,EAAGw0G,2BAA6Bx0G,EAAG2wG,SAAW,IAE5E3wG,EAAGmyG,qBAGC,mCAA0CnyG,EAAG6yG,SAA7C,qBAC0B7yG,EAAGy0G,iCAAmCz0G,EAAG2wG,SAAW,IAE3E3wG,I;mDChLP,SAASk1D,GAGV,IAAIw/C,EAAgC,UAAlB,EAAO7oH,IAAuBA,IAC9CA,EAAQi1C,UAAYj1C,EAClB8oH,EAA8B,UAAjB,EAAO/oH,IAAsBA,IAC5CA,EAAOk1C,UAAYl1C,EACjBgpH,EAA8B,gBAAjB,IAAO5oH,EAAP,cAAOA,KAAsBA,EAE7C4oH,EAAW5oH,SAAW4oH,GACtBA,EAAW5nH,SAAW4nH,GACtBA,EAAW3nH,OAAS2nH,IAEpB1/C,EAAO0/C,GAQR,IAAInU,EAiCJnyG,EA9BAumH,EAAS,WAaTC,EAAgB,QAChBC,EAAgB,eAChBC,EAAkB,4BAGlBC,EAAS,CACR,SAAY,kDACZ,YAAa,iDACb,gBAAiB,iBAKlBx7G,EAAQ3M,KAAK2M,MACby7G,EAAqBpkH,OAAOo4B,aAa5B,SAASn9B,EAAMkJ,GACd,MAAM,IAAI+2B,WAAWipF,EAAOhgH,IAW7B,SAASgS,EAAIjF,EAAO9T,GAGnB,IAFA,IAAIG,EAAS2T,EAAM3T,OACf0B,EAAS,GACN1B,KACN0B,EAAO1B,GAAUH,EAAG8T,EAAM3T,IAE3B,OAAO0B,EAaR,SAASolH,EAAUvwG,EAAQ1W,GAC1B,IAAIyc,EAAQ/F,EAAOnR,MAAM,KACrB1D,EAAS,GAWb,OAVI4a,EAAMtc,OAAS,IAGlB0B,EAAS4a,EAAM,GAAK,IACpB/F,EAAS+F,EAAM,IAMT5a,EADOkX,GAFdrC,EAASA,EAAOnU,QAAQukH,EAAiB,MACrBvhH,MAAM,KACAvF,GAAI4F,KAAK,KAiBpC,SAASshH,EAAWxwG,GAMnB,IALA,IAGIjT,EACA0jH,EAJA92E,EAAS,GACT+2E,EAAU,EACVjnH,EAASuW,EAAOvW,OAGbinH,EAAUjnH,IAChBsD,EAAQiT,EAAOhU,WAAW0kH,OACb,OAAU3jH,GAAS,OAAU2jH,EAAUjnH,EAG3B,QAAX,OADbgnH,EAAQzwG,EAAOhU,WAAW0kH,OAEzB/2E,EAAOl8B,OAAe,KAAR1Q,IAAkB,KAAe,KAAR0jH,GAAiB,QAIxD92E,EAAOl8B,KAAK1Q,GACZ2jH,KAGD/2E,EAAOl8B,KAAK1Q,GAGd,OAAO4sC,EAWR,SAASg3E,EAAWvzG,GACnB,OAAOiF,EAAIjF,GAAO,SAASrQ,GAC1B,IAAI4sC,EAAS,GAOb,OANI5sC,EAAQ,QAEX4sC,GAAU22E,GADVvjH,GAAS,SAC8B,GAAK,KAAQ,OACpDA,EAAQ,MAAiB,KAARA,GAElB4sC,GAAU22E,EAAmBvjH,MAE3BmC,KAAK,IAoCT,SAAS0hH,EAAaC,EAAOC,GAG5B,OAAOD,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARC,IAAc,GAQzD,SAASC,EAAMC,EAAOC,EAAWC,GAChC,IAAIlwG,EAAI,EAGR,IAFAgwG,EAAQE,EAAYr8G,EAAMm8G,EA1LpB,KA0LoCA,GAAS,EACnDA,GAASn8G,EAAMm8G,EAAQC,GACOD,EAAQG,IAA2BnwG,GAhM3D,GAiMLgwG,EAAQn8G,EAAMm8G,EA3KArqE,IA6Kf,OAAO9xC,EAAMmM,EAAI,GAAsBgwG,GAASA,EAhM1C,KA0MP,SAASxnB,EAAOvyF,GAEf,IAEIq8B,EAIA89E,EACAx8F,EACAjZ,EACA01G,EACAh0B,EACAr8E,EACA6vG,EACAhlG,EAEAylG,EArEiBC,EAsDjB53E,EAAS,GACT63E,EAAcv6G,EAAMxN,OAEpBF,EAAI,EACJ4X,EA7MM,IA8MNmmC,EA/MS,GAoOb,KALA8pE,EAAQn6G,EAAM4oC,YA7NH,MA8NC,IACXuxE,EAAQ,GAGJx8F,EAAI,EAAGA,EAAIw8F,IAASx8F,EAEpB3d,EAAMjL,WAAW4oB,IAAM,KAC1BztB,EAAM,aAEPwyC,EAAOl8B,KAAKxG,EAAMjL,WAAW4oB,IAM9B,IAAKjZ,EAAQy1G,EAAQ,EAAIA,EAAQ,EAAI,EAAGz1G,EAAQ61G,GAAwC,CAOvF,IAAKH,EAAO9nH,EAAG8zF,EAAI,EAAGr8E,EA3PjB,GA6PArF,GAAS61G,GACZrqH,EAAM,mBAGP0pH,GAxGmBU,EAwGEt6G,EAAMjL,WAAW2P,MAvGxB,GAAK,GACb41G,EAAY,GAEhBA,EAAY,GAAK,GACbA,EAAY,GAEhBA,EAAY,GAAK,GACbA,EAAY,GAjKd,SAmQiBV,EAAQh8G,GAAOo7G,EAAS1mH,GAAK8zF,KACjDl2F,EAAM,YAGPoC,GAAKsnH,EAAQxzB,IAGTwzB,GAFJhlG,EAAI7K,GAAKsmC,EAvQL,EAuQoBtmC,GAAKsmC,EAtQzB,MAsQ8CtmC,EAAIsmC,IAbHtmC,GA3P/C,GA+QAq8E,EAAIxoF,EAAMo7G,GADdqB,EA9QI,GA8QgBzlG,KAEnB1kB,EAAM,YAGPk2F,GAAKi0B,EAKNhqE,EAAOypE,EAAMxnH,EAAI8nH,EADjB/9E,EAAMqG,EAAOlwC,OAAS,EACc,GAAR4nH,GAIxBx8G,EAAMtL,EAAI+pC,GAAO28E,EAAS9uG,GAC7Bha,EAAM,YAGPga,GAAKtM,EAAMtL,EAAI+pC,GACf/pC,GAAK+pC,EAGLqG,EAAOrN,OAAO/iC,IAAK,EAAG4X,GAIvB,OAAOwvG,EAAWh3E,GAUnB,SAAS/zB,EAAO3O,GACf,IAAIkK,EACA6vG,EACAS,EACAC,EACApqE,EACA1yB,EACA9G,EACA6jG,EACA3wG,EACA6K,EACA+lG,EAGAJ,EAEAK,EACAP,EACAQ,EANAn4E,EAAS,GAoBb,IARA63E,GAHAv6G,EAAQu5G,EAAWv5G,IAGCxN,OAGpB0X,EAvUU,IAwUV6vG,EAAQ,EACR1pE,EA1Ua,GA6UR1yB,EAAI,EAAGA,EAAI48F,IAAe58F,GAC9Bg9F,EAAe36G,EAAM2d,IACF,KAClB+kB,EAAOl8B,KAAK6yG,EAAmBsB,IAejC,IAXAH,EAAiBC,EAAc/3E,EAAOlwC,OAMlCioH,GACH/3E,EAAOl8B,KAzVG,KA6VJg0G,EAAiBD,GAAa,CAIpC,IAAK1jG,EAAImiG,EAAQr7F,EAAI,EAAGA,EAAI48F,IAAe58F,GAC1Cg9F,EAAe36G,EAAM2d,KACDzT,GAAKywG,EAAe9jG,IACvCA,EAAI8jG,GAcN,IAPI9jG,EAAI3M,EAAItM,GAAOo7G,EAASe,IAD5Ba,EAAwBJ,EAAiB,KAExCtqH,EAAM,YAGP6pH,IAAUljG,EAAI3M,GAAK0wG,EACnB1wG,EAAI2M,EAEC8G,EAAI,EAAGA,EAAI48F,IAAe58F,EAO9B,IANAg9F,EAAe36G,EAAM2d,IAEFzT,KAAO6vG,EAAQf,GACjC9oH,EAAM,YAGHyqH,GAAgBzwG,EAAG,CAEtB,IAAKwwG,EAAIX,EAAOhwG,EAlYb,KAoYE2wG,GADJ9lG,EAAI7K,GAAKsmC,EAlYP,EAkYsBtmC,GAAKsmC,EAjY3B,MAiYgDtmC,EAAIsmC,IADTtmC,GAlY3C,GAuYF8wG,EAAUH,EAAI9lG,EACdylG,EAxYE,GAwYkBzlG,EACpB8tB,EAAOl8B,KACN6yG,EAAmBM,EAAa/kG,EAAIimG,EAAUR,EAAY,KAE3DK,EAAI98G,EAAMi9G,EAAUR,GAGrB33E,EAAOl8B,KAAK6yG,EAAmBM,EAAae,EAAG,KAC/CrqE,EAAOypE,EAAMC,EAAOa,EAAuBJ,GAAkBC,GAC7DV,EAAQ,IACNS,IAIFT,IACA7vG,EAGH,OAAOw4B,EAAOzqC,KAAK,IAuEpB,GA3BA2sG,EAAW,CAMV,QAAW,QAQX,KAAQ,CACP,OAAU2U,EACV,OAAUG,GAEX,OAAUnnB,EACV,OAAU5jF,EACV,QA/BD,SAAiB3O,GAChB,OAAOs5G,EAAUt5G,GAAO,SAAS+I,GAChC,OAAOmwG,EAAc/1G,KAAK4F,GACvB,OAAS4F,EAAO5F,GAChBA,MA4BJ,UAnDD,SAAmB/I,GAClB,OAAOs5G,EAAUt5G,GAAO,SAAS+I,GAChC,OAAOkwG,EAAc91G,KAAK4F,GACvBwpF,EAAOxpF,EAAO3U,MAAM,GAAG4U,eACvBD,OAuDiB,UAArB,EAAOkjB,SACPA,YAEM,KAANA,aACC,OAAO24E,GADF,mCAGA,GAAIiU,GAAeC,EACzB,GAAI/oH,EAAOC,SAAW6oH,EAErBC,EAAW9oH,QAAU40G,OAGrB,IAAKnyG,KAAOmyG,EACXA,EAASlyG,eAAeD,KAASomH,EAAYpmH,GAAOmyG,EAASnyG,SAK/D4mE,EAAKurC,SAAWA,EAhhBhB,CAmhBAvzG,Q,yDC/gBFtB,EAAOC,QAAU,CACfwG,QAAS,CACP4H,MAAc,EACdusG,UAAc,EACdE,QAAc,EACdN,WAAc,YACd5E,SAAc,EAGdgH,aAAc,EAOdmB,OAAQ,OAQRna,UAAW,KAEXwa,WAAc,KAGhBtI,WAAY,CAEVJ,KAAM,GACNj+D,MAAO,GACP7I,OAAQ,M,6BChCZ5uC,EAAOC,QAAU,CACfwG,QAAS,CACP4H,MAAc,EACdusG,UAAc,EACdE,QAAc,EACdN,WAAc,YACd5E,SAAc,EAGdgH,aAAc,EAOdmB,OAAQ,OAQRna,UAAW,KAEXwa,WAAc,IAGhBtI,WAAY,CAEVJ,KAAM,CACJhmE,MAAO,CACL,YACA,QACA,WAIJ+H,MAAO,CACL/H,MAAO,CACL,cAIJd,OAAQ,CACNc,MAAO,CACL,QAEFsmE,OAAQ,CACN,gBACA,qB,6BCpDRh2G,EAAOC,QAAU,CACfwG,QAAS,CACP4H,MAAc,EACdusG,UAAc,EACdE,QAAc,EACdN,WAAc,YACd5E,SAAc,EAGdgH,aAAc,EAOdmB,OAAQ,OAQRna,UAAW,KAEXwa,WAAc,IAGhBtI,WAAY,CAEVJ,KAAM,CACJhmE,MAAO,CACL,YACA,QACA,WAIJ+H,MAAO,CACL/H,MAAO,CACL,aACA,OACA,QACA,UACA,KACA,aACA,WACA,OACA,YACA,cAIJd,OAAQ,CACNc,MAAO,CACL,WACA,YACA,WACA,SACA,SACA,cACA,QACA,OACA,UACA,QAEFsmE,OAAQ,CACN,gBACA,WACA,qB,cCtER,IAAI+U,GAAoB,EACpBC,GAAkB,EAClBC,GAAgB,EAqBpB,SAAS97B,EAAQ91D,EAAOt4B,EAAMgF,GAC7B,IAAI4O,EAAQ0kB,EAAM21D,UAAUjuF,GACxBylG,EAAO,CAACzlG,EAAMgF,GAEd4O,EAAQ,EACX0kB,EAAM41D,SAASuX,GAEfntE,EAAM+P,MAAMz0B,GAAS6xF,EAIvB,SAAS0kB,EAAYr8E,EAAQl6B,GAE5B,IADA,IAAIw2G,EAAct8E,EAAOl6B,GAAOikC,MAAQ,EAC/Br2C,EAAIoS,EAAQ,EAAGpS,GAAK,EAAGA,IAC/B,GAAIssC,EAAOtsC,GAAGq2C,QAAUuyE,EACvB,OAAO5oH,EAGT,OAAQ,EAGT,SAAS6oH,EAAWv8E,EAAQl6B,GAC3B,MA0DgD,WA1DhCk6B,EAAOl6B,GA0DgBtL,MACxC,SAAqBgwB,GAAS,MAAsB,mBAAfA,EAAMhwB,KA1DnCgiH,CAAYx8E,EAAOl6B,EAAQ,KA2DnC,SAAoB0kB,GAAS,MAAsB,mBAAfA,EAAMhwB,KA1DlCiiH,CAAWz8E,EAAOl6B,EAAQ,KA4DlC,SAAgC0kB,GAE/B,OAAyC,IAAlCA,EAAMt0B,QAAQ0P,QAAQ,SAAmD,IAAlC4kB,EAAMt0B,QAAQ0P,QAAQ,SAAmD,IAAlC4kB,EAAMt0B,QAAQ0P,QAAQ,QA7DpG82G,CAAuB18E,EAAOl6B,IAGtC,SAAS62G,EAAQnyF,EAAOoyF,GAKvB,GAJApyF,EAAMujC,SAAS3mC,QAmBhB,SAAsBoD,EAAOoyF,GAC5B,IAAIC,EAAW,IAAID,EAAiB,cAAe,GAAI,GACnDE,EAAeZ,EAAoB,gBAAkB,GACnB,IAAlC1xF,EAAMt0B,QAAQ0P,QAAQ,QACzBi3G,EAAS3mH,QAAU,yCAA2C4mH,EAAe,mBACjC,IAAlCtyF,EAAMt0B,QAAQ0P,QAAQ,SAAmD,IAAlC4kB,EAAMt0B,QAAQ0P,QAAQ,UACvEi3G,EAAS3mH,QAAU,oDAAsD4mH,EAAe,oBAEzF,OAAOD,EA3BgBE,CAAavyF,EAAOoyF,IAC3CpyF,EAAMujC,SAAS,GAAG73D,QAAUs0B,EAAMujC,SAAS,GAAG73D,QAAQV,MAAM,GAC5Dg1B,EAAMt0B,QAAUs0B,EAAMt0B,QAAQV,MAAM,GAEhC2mH,EACH,GAAIC,EAAe,CAClB5xF,EAAMujC,SAAS9tB,MAGf,IAAIj+B,EAAK,aAAe3P,KAAK0M,KAAK,IAAA1M,KAAK6P,SAA4B,KACnEsoB,EAAMujC,SAAS,GAAG73D,QAAUs0B,EAAMujC,SAAS,GAAG73D,QAAQV,MAAM,GAAI,GAAK,QAAUwM,EAAK,KACpFwoB,EAAMujC,SAASnmD,KAiClB,SAAoB1R,EAAS8L,EAAI46G,GAChC,IAAIpyF,EAAQ,IAAIoyF,EAAiB,cAAe,GAAI,GAGpD,OAFApyF,EAAMt0B,QAAU,4CAA8C8L,EAAK,KAAO9L,EAAU,WACpFs0B,EAAM+P,MAAQ,CAAC,CAACyiF,IAAKh7G,IACdwoB,EArCeyyF,CAAWzyF,EAAMt0B,QAAS8L,EAAI46G,SAElDpyF,EAAMujC,SAAS3mC,QAmBlB,SAAoBw1F,GACnB,IAAIpyF,EAAQ,IAAIoyF,EAAiB,cAAe,GAAI,GAEpD,OADApyF,EAAMt0B,QAAU,UACTs0B,EAtBkB0yF,CAAWN,IAClCpyF,EAAMujC,SAASnmD,KAwBlB,SAAkBg1G,GACjB,IAAIpyF,EAAQ,IAAIoyF,EAAiB,cAAe,GAAI,GAEpD,OADApyF,EAAMt0B,QAAU,WACTs0B,EA3Be2yF,CAASP,IA9DhCzrH,EAAOC,QAAU,SAAS6wG,EAAIrqG,GACzBA,IACHskH,GAAqBtkH,EAAQonF,QAC7Bm9B,IAAoBvkH,EAAQ07G,MAC5B8I,IAAkBxkH,EAAQwlH,YAG3Bnb,EAAG4E,KAAKK,MAAMlsE,MAAM,SAAU,qBAAqB,SAAS/hC,GAE3D,IADA,IAAI+mC,EAAS/mC,EAAM+mC,OACVtsC,EAAI,EAAGA,EAAIssC,EAAOpsC,OAAQF,IAC9B6oH,EAAWv8E,EAAQtsC,KACtBipH,EAAQ38E,EAAOtsC,GAAIuF,EAAM6mF,OACzBQ,EAAQtgD,EAAOtsC,EAAE,GAAI,QAAS,kBAAqBwoH,EAAiC,GAAb,aACvE57B,EAAQtgD,EAAOq8E,EAAYr8E,EAAQtsC,EAAE,IAAK,QAAS,4B,8BCtBvD,cAkBA,IAAU2pH,UAOP,IAAuBl3G,GACtB,qBAAuB,GAAGvT,SAASK,KAAKkT,IACzC,oBAAuBjR,WAAmC,gBAAtBA,UAAUC,QAC3C5D,EACAiB,MAVK,QAGT6qH,EAAMr+D,MAAQxtD,EAAQ,IAARA,GACd6rH,EAAMr+D,MAAN,UAA2Bq+D,EAAMr+D,MAAMs+D,a,2QCPzCnsH,EAAOC,QAAU,WACf,IACImsH,EADAC,EAAe,KAOnB,SAASrqH,EAAS00D,GAChB,QAAOA,IAAkB,WAAb,EAAOA,IAA+B,mBAANA,GAG9C,SAAS41D,EAAcn5G,GACrB,GAAc,OAAVA,IAAmBnR,EAASmR,GAC9B,MAAM,IAAIlO,UAAU,mDAAqDkO,GAI7E,IAAMo5G,EAAU7qH,OAGV8qH,EAA4BlyG,QAAQiyG,EAAQ38G,WAAa,CAAE0Y,UAAW,gBAAkBikG,GACxFE,EACJF,EAAQ38G,SACP48G,EACG,SAAgBr5G,GAEd,OADAm5G,EAAcn5G,GACP,CAAEmV,UAAWnV,IAEtB,SAAgBA,GAEd,GADAm5G,EAAcn5G,GACA,OAAVA,EACF,MAAM,IAAIq8B,YAAY,0EAIxB,IAAInc,EAA8B,aAElC,OADAA,EAAE1xB,UAAYwR,EACP,IAAIkgB,IAGbhd,EAAO,WAAa,OAAO,MAE3Bq2G,EACJH,EAAQrqH,iBACP,GAAGomB,YAAc9R,MAAM7U,UACpB,SAAwBiE,GAGtB,IAAMuN,EAAQvN,EAAE0iB,UAChB,OAAOtmB,EAASmR,GAASA,EAAQ,MAEnCkD,GAsKN,OA/JA+1G,EAAgB,SAASzlH,EAAQkzB,GAE/B,QAAkBxyB,KADA/F,MAAQA,gBAAgB8qH,EAAgB9qH,KAAKwB,iBAAcuE,GAE3E,MAAM,IAAIpC,UAAU,oCAGtB,IAAKjD,EAAS2E,KAAY3E,EAAS63B,GACjC,MAAM,IAAI50B,UAAU,8DAMtB,IAAI0nH,EAAe,aACnBN,EAAe,WAEb1lH,EAAS,KACTgmH,EAAe,SAASC,GACtB,MAAM,IAAI3nH,UAAJ,0BAAiC2nH,EAAjC,yCAGVt3G,YAAW,WACT+2G,EAAe,OACd,GAIH,IAAMQ,EAAgBhzF,EAEtB,IAAK,IAAI7f,KADT6f,EAAU,CAAE,IAAO,KAAM,IAAO,KAAM,MAAS,KAAM,UAAa,MACpDgzF,EAAe,CAC3B,KAAM7yG,KAAK6f,GACT,MAAM,IAAI50B,UAAJ,gDAAuD+U,EAAvD,MAER6f,EAAQ7f,GAAK6yG,EAAc7yG,GAEA,mBAAlB6yG,IAGThzF,EAAQ5rB,MAAQ4+G,EAAc5+G,MAAMzM,KAAKqrH,IAK3C,IACIC,EADE35G,EAAQu5G,EAAS/lH,GAEnBomH,GAAW,EACXnrH,GAAU,EACQ,mBAAX+E,GACTmmH,EAAQ,WACN,IAAME,EAAY1rH,MAAQA,KAAKwB,cAAgBgqH,EACzCv2G,EAAOC,MAAM7U,UAAU0C,MAAMvC,KAAKwC,WAIxC,GAHAqoH,EAAaK,EAAW,YAAc,SAGlCA,GAAYnzF,EAAO,UACrB,OAAOA,EAAO,UAAc/3B,KAAKR,KAAMqF,EAAQ4P,GAC1C,IAAKy2G,GAAYnzF,EAAQ5rB,MAC9B,OAAO4rB,EAAO,MAAUlzB,EAAQrF,KAAMiV,GAIxC,GAAIy2G,EAAU,CAEZz2G,EAAK0f,QAAQtvB,GAEb,IAAMhB,EAA8BgB,EAAOnF,KAAKyM,MAAMtH,EAAQ4P,GAC9D,OAAO,IAAI5Q,EAEb,OAAOgB,EAAOsH,MAAM3M,KAAMiV,IAE5Bw2G,GAAW,GACFpmH,aAAkB6P,OAC3Bs2G,EAAQ,GACRlrH,GAAU,GAEVkrH,EAASN,GAAuC,OAAVr5G,EAAkBs5G,EAAat5G,GAAS,GAKhF,IAAMsjD,EAAS58B,EAAQx0B,IAAM,SAAS8e,GAEpC,OADAwoG,EAAa,OACN9yF,EAAQx0B,IAAI/D,KAAM6iB,EAAM2oG,IAC7B,SAAS3oG,GAEX,OADAwoG,EAAa,OACNrrH,KAAK6iB,IAERiE,EAASyR,EAAQztB,IAAM,SAAS+X,EAAMpe,GAC1C4mH,EAAa,OACE9yF,EAAQztB,IAAI9K,KAAM6iB,EAAMpe,EAAO+mH,IAM5C,SAAS3oG,EAAMpe,GACjB4mH,EAAa,OACbrrH,KAAK6iB,GAAQpe,GAITknH,EAAgBV,EAAQj6F,oBAAoB3rB,GAC5CumH,EAAc,GACpBD,EAAc7qH,SAAQ,SAAS+hB,GAC7B,IAAK4oG,IAAYnrH,KAAYuiB,KAAQ2oG,GAArC,CAGA,IAAMK,EAAOZ,EAAQpmH,yBAAyBQ,EAAQwd,GAChDwe,EAAO,CACX16B,WAAYqS,QAAQ6yG,EAAKllH,YACzB5C,IAAKoxD,EAAOj1D,KAAKmF,EAAQwd,GACzB/X,IAAKgc,EAAO5mB,KAAKmF,EAAQwd,IAE3BooG,EAAQnnH,eAAe0nH,EAAO3oG,EAAMwe,GACpCuqF,EAAY/oG,IAAQ,MAMtB,IAAIipG,GAAc,EAClB,GAAIL,GAAYnrH,EAAS,CAIvB,IAAMyrH,EACJd,EAAQh7G,iBACP,GAAG+W,YAAc9R,MAAM7U,UACpB,SAAwBiE,EAAGuN,GAGzB,OAFAm5G,EAAcn5G,GACdvN,EAAE0iB,UAAYnV,EACPvN,GAETyQ,GACAlD,GAASk6G,EAASP,EAAO35G,KAC7Bi6G,GAAc,GAGlB,GAAIvzF,EAAQx0B,MAAQ+nH,EAClB,IAAK,IAAIpzG,KAAKrT,EACRumH,EAAYlzG,IAGhBuyG,EAAQnnH,eAAe0nH,EAAO9yG,EAAG,CAAE3U,IAAKoxD,EAAOj1D,KAAKmF,EAAQqT,KAQhE,OAHAuyG,EAAQe,KAAK3mH,GACb4lH,EAAQe,KAAKR,GAENA,IAGKX,UAAY,SAASxlH,EAAQkzB,GAEzC,MAAO,CAAE,MADC,IAAIuyF,EAAczlH,EAAQkzB,GACf,OAAUwyF,IAG1BD,I,gI/HvOIrqF,EAAS,IAAI,SAAO,CAC/BoH,MAAO,CACLzJ,IAAK,CACH36B,QAAS,UAGXq3D,UAAW,CACTr3D,QAAS,UACTwpD,MAAO,QACPzd,SAAU,CAAC,CAAC7zB,IAAK,MACjBg8B,MAAA,WAAU,MAAO,CAAC,IAAK,KAGzB5H,WAAY,CACVtsC,QAAS,SACTwpD,MAAO,QACPzd,SAAU,CAAC,CAAC7zB,IAAK,eACjBg8B,MAAA,WAAU,MAAO,CAAC,aAAc,KAGlCs0E,gBAAiB,CACfh/D,MAAO,QACPzd,SAAU,CAAC,CAAC7zB,IAAK,OACjBg8B,MAAA,WAAU,MAAO,CAAC,MAAO,CAAC,SAG5Bu0E,QAAS,CACPpkF,MAAO,CAACwP,MAAO,CAACjjB,QAAS,IACzB5wB,QAAS,kBACTwpD,MAAO,QACPrJ,UAAU,EACVpU,SAAU,CAAC,CAAC7zB,IAAK,KAAMmsB,MAAO,CAACwP,MAAO,IAC3B,CAAC37B,IAAK,KAAMmsB,MAAO,CAACwP,MAAO,IAC3B,CAAC37B,IAAK,KAAMmsB,MAAO,CAACwP,MAAO,IAC3B,CAAC37B,IAAK,KAAMmsB,MAAO,CAACwP,MAAO,IAC3B,CAAC37B,IAAK,KAAMmsB,MAAO,CAACwP,MAAO,IAC3B,CAAC37B,IAAK,KAAMmsB,MAAO,CAACwP,MAAO,KACtCK,MAAA,SAAM5X,GAAQ,MAAO,CAAC,IAAMA,EAAK+H,MAAMwP,MAAO,KAGhDuhE,WAAY,CACVp1G,QAAS,QACTwpD,MAAO,QACP7qC,MAAM,EACNwhC,UAAU,EACV3kB,MAAO,GACP6I,MAAO,CAACpgC,OAAQ,CAAC2sB,QAAS,KAC1Bmb,SAAU,CAAC,CAAC7zB,IAAK,MAAOo2B,mBAAoB,OAAQ5C,SAAU,SAAApP,GAAK,MACjE,CAACr4B,OAAQq4B,EAAKiU,aAAa,gBAAkB,OAE/C2D,MAAA,SAAM5X,GAAQ,MAAO,CAAC,MAAOA,EAAK+H,MAAMpgC,OAAS,CAAC,cAAeq4B,EAAK+H,MAAMpgC,QAAU,GAAI,CAAC,OAAQ,MAGrG2iF,aAAc,CACZ5mF,QAAS,aACTwpD,MAAO,QACPnlB,MAAO,CAACu4B,MAAO,CAAChsC,QAAS,GAAI6oF,MAAO,CAAC7oF,SAAS,IAC9Cmb,SAAU,CAAC,CAAC7zB,IAAK,KAAMwzB,SAAA,SAASX,GAC9B,MAAO,CAAC6xB,MAAO7xB,EAAI8xB,aAAa,UAAY9xB,EAAIwF,aAAa,SAAW,EAChEkpE,MAAO1uE,EAAI8xB,aAAa,kBAElC3oB,MAAA,SAAM5X,GACJ,MAAO,CAAC,KAAM,CAACwF,MAA2B,GAApBxF,EAAK+H,MAAMu4B,MAAa,KAAOtgC,EAAK+H,MAAMu4B,MACjD,aAActgC,EAAK+H,MAAMo1E,MAAQ,OAAS,MAAO,KAIpE9yB,YAAa,CACX3mF,QAAS,aACTwpD,MAAO,QACPnlB,MAAO,CAACo1E,MAAO,CAAC7oF,SAAS,IACzBmb,SAAU,CAAC,CAAC7zB,IAAK,KAAMwzB,SAAU,SAAAX,GAAI,MAAI,CAAC0uE,MAAO1uE,EAAI8xB,aAAa,kBAClE3oB,MAAA,SAAM5X,GAAQ,MAAO,CAAC,KAAM,CAAC,aAAcA,EAAK+H,MAAMo1E,MAAQ,OAAS,MAAO,KAGhFviD,UAAW,CACTl3D,QAAS,mBACTmgD,UAAU,EACVpU,SAAU,CAAC,CAAC7zB,IAAK,OACjBg8B,MAAA,WAAU,MAAO,CAAC,KAAM,KAG1BpX,KAAM,CACJ0sB,MAAO,UAGToQ,MAAO,CACL/vB,QAAQ,EACRxF,MAAO,CACL55B,IAAK,GACL6uD,IAAK,CAAC1oC,QAAS,MACfjf,MAAO,CAACif,QAAS,OAEnB44B,MAAO,SACPpD,WAAW,EACXra,SAAU,CAAC,CAAC7zB,IAAK,WAAYwzB,SAAA,SAASX,GACpC,MAAO,CACLtgC,IAAKsgC,EAAIwF,aAAa,OACtB5+B,MAAOo5B,EAAIwF,aAAa,SACxB+oB,IAAKvuB,EAAIwF,aAAa,WAG1B2D,MAAA,SAAM5X,GAAQ,MAAO,CAAC,MAAOA,EAAK+H,SAGpCqkF,WAAY,CACV7+E,QAAQ,EACR2f,MAAO,SACPuP,YAAY,EACZhtB,SAAU,CAAC,CAAC7zB,IAAK,OACjBg8B,MAAA,WAAU,MAAO,CAAC,SAItB1Y,MAAO,CACLmtF,GAAI,CACF58E,SAAU,CAAC,CAAC7zB,IAAK,KAAM,CAACA,IAAK,MAClB,CAAC5N,MAAO,aAAcohC,SAAU,SAAA1qC,GAAM,MAAY,UAATA,GAAqB,QACzEkzC,MAAA,WAAU,MAAO,CAAC,QAGpB00E,OAAQ,CACN78E,SAAU,CAAC,CAAC7zB,IAAK,KAAM,CAACA,IAAK,UAClB,CAAC5N,MAAO,cAAeohC,SAAU,SAAA1qC,GAAM,MAAG,4BAA4BqN,KAAKrN,IAAU,QAChGkzC,MAAA,WAAU,MAAO,CAAC,YAGpB9vC,KAAM,CACJigC,MAAO,CACL3Q,KAAM,GACN/hB,MAAO,CAACif,QAAS,OAEnB0U,WAAW,EACXyG,SAAU,CAAC,CAAC7zB,IAAK,UAAWwzB,SAAA,SAASX,GACnC,MAAO,CAACrX,KAAMqX,EAAIwF,aAAa,QAAS5+B,MAAOo5B,EAAIwF,aAAa,aAElE2D,MAAA,SAAM5X,GAAQ,MAAO,CAAC,IAAKA,EAAK+H,SAGlC1lB,KAAM,CACJotB,SAAU,CAAC,CAAC7zB,IAAK,SACjBg8B,MAAA,WAAU,MAAO,CAAC,agItIxB,IAAM20E,EACJ,SAAY7rF,EAAQ8rF,GAClBvsH,KAAKygC,OAASA,EACdzgC,KAAK+1B,MAAQ,CAAC,CAAChuB,KAAM04B,EAAOc,YAAa99B,QAAS,KAClDzD,KAAKi/B,MAAQ,OAAKkB,KAClBngC,KAAKusH,cAAgBA,GAoEzB,SAASzkF,EAAM3F,EAAMpK,GACnB,OAAIoK,EAAKgN,SAAiBhN,EAAKgN,SAASpX,GAE/BoK,EAAK2F,iBAAiB7nC,SAAiBkiC,EAAK2F,MAAM/P,GAC/CoK,EAAK2F,MAKnB,SAAS0kF,EAAarqF,EAAMp6B,GAC1B,OAAOo6B,EAAKqqF,cAAwB,eAARzkH,GAAiC,cAARA,GAAgC,SAARA,EAG/E,SAAS0kH,EAAuBnpH,GAC9B,MAA8B,MAAvBA,EAAIA,EAAInC,OAAS,GAAamC,EAAIP,MAAM,EAAGO,EAAInC,OAAS,GAAKmC,EAGtE,SAASopH,KAlFT,YAAE74E,IAAA,WACE,OAAO7zC,KAAK+1B,MAAM/1B,KAAK+1B,MAAM50B,OAAS,IAG1C,YAAEgU,KAAA,SAAKqhD,GACCx2D,KAAK+1B,MAAM50B,QAAQnB,KAAK6zC,MAAMpwC,QAAQ0R,KAAKqhD,IAMnD,YAAE2sC,QAAA,SAAQ5iE,GACN,GAAKA,EAAL,CACA,IAC+Co3B,EAD3C9vB,EAAQ7nC,KAAK6zC,MAAMpwC,QAASk3B,EAAOkN,EAAMA,EAAM1mC,OAAS,GACxD4+B,EAAO//B,KAAKygC,OAAOF,KAAKA,EAAMvgC,KAAKi/B,OACnCtE,IAASg9B,EA7BjB,SAAoBz0D,EAAGC,GACrB,GAAID,EAAE2iC,QAAU1iC,EAAE0iC,QAAU,OAAK1G,QAAQj8B,EAAE+7B,MAAO97B,EAAE87B,OAClD,OAAO/7B,EAAEgjC,SAAShjC,EAAEq9B,KAAOp9B,EAAEo9B,MA2BPosF,CAAWhyF,EAAMoF,IAAQ8H,EAAMA,EAAM1mC,OAAS,GAAKw2D,EACpE9vB,EAAM1yB,KAAK4qB,KAKpB,YAAE6sF,SAAA,SAASvtF,GACPr/B,KAAKi/B,MAAQI,EAAKC,SAASt/B,KAAKi/B,QAKpC,YAAE4tF,UAAA,SAAUxtF,GACRr/B,KAAKi/B,MAAQI,EAAKI,cAAcz/B,KAAKi/B,QAGzC,YAAE6tF,YAAA,SAAYC,GACV,IAAKjvF,IAAI78B,EAAI,EAAGA,EAAI8rH,EAAK5rH,OAAQF,IAAK,CACpC68B,IAAImQ,EAAM8+E,EAAK9rH,GACXs3B,EAAUv4B,KAAKusH,cAAct+E,EAAIlmC,MACvC,IAAOwwB,EACH,MAAM,IAAI3kB,MAAM,eAAiBq6B,EAAIlmC,KAAO,sCAC9CwwB,EAAQv4B,KAAMiuC,KAMpB,YAAE8hC,QAAA,SAAQhoE,EAAM+/B,EAAOrkC,GACnBq6B,IAAIiC,EAAOh4B,EAAKy5B,cAAcsG,EAAOrkC,EAASzD,KAAKi/B,OACnD,OAAKc,GACL//B,KAAKmV,KAAK4qB,GACHA,GAFW,MAOtB,YAAEujE,SAAA,SAASv7F,EAAM+/B,GACb9nC,KAAK+1B,MAAM5gB,KAAK,CAACpN,KAAMA,EAAM+/B,MAAOA,EAAOrkC,QAAS,MAKxD,YAAE8/F,UAAA,WACMvjG,KAAKi/B,MAAM99B,SAAQnB,KAAKi/B,MAAQ,OAAKkB,MACzC,IAAIqtD,EAAOxtF,KAAK+1B,MAAMyX,MACtB,OAAOxtC,KAAK+vE,QAAQyd,EAAKzlF,KAAMylF,EAAK1lD,MAAO0lD,EAAK/pF,UA6EpD,IAAaupH,EA8CX,SAAYvsF,EAAQwsF,EAAW1/E,GAI7BvtC,KAAKutC,OAASA,EACdvtC,KAAKygC,OAASA,EACdzgC,KAAKitH,UAAYA,EACjBjtH,KAAKusH,cA3GT,SAAuB9rF,EAAQ8M,GAC7BzP,IAAI9I,EAAW50B,OAAOkO,OAAO,M,cAE3BwvB,IAAIqE,EAAOoL,EAAOxlC,GAClB,GAAIo6B,EAAKgU,MAAO,CACdrY,IAAI8V,EAAWnT,EAAOmT,SAASzR,EAAKgU,OAChCq2E,EAAarqF,EAAMp6B,GACrBitB,EAASjtB,GAAK,SAAIvB,EAAOynC,GACvBznC,EAAM88F,SAAS1vD,EAAU9L,EAAM3F,EAAM8L,IACrCznC,EAAM28F,QAAQspB,EAAuBx+E,EAAIxqC,UACzC+C,EAAM+8F,cAGRvuE,EAASjtB,EAAO,SAAQ,SAAIvB,EAAOynC,GAAK,OAAGznC,EAAM88F,SAAS1vD,EAAU9L,EAAM3F,EAAM8L,KAChFjZ,EAASjtB,EAAO,UAAS,SAAGvB,GAAM,OAAGA,EAAM+8F,mBAExC,GAAIphE,EAAKpC,KAAM,CACpBjC,IAAI8V,EAAWnT,EAAOmT,SAASzR,EAAKpC,MACpC/K,EAASjtB,GAAK,SAAIvB,EAAOynC,GAAK,OAAGznC,EAAMupE,QAAQn8B,EAAU9L,EAAM3F,EAAM8L,UAChE,GAAI9L,EAAK9C,KAAM,CACpBvB,IAAI2U,EAAWhS,EAAOxB,MAAMkD,EAAK9C,MAC7BmtF,EAAarqF,EAAMp6B,GACrBitB,EAASjtB,GAAK,SAAIvB,EAAOynC,GACvBznC,EAAMomH,SAASn6E,EAASnkC,OAAOw5B,EAAM3F,EAAM8L,KAC3CznC,EAAM28F,QAAQspB,EAAuBx+E,EAAIxqC,UACzC+C,EAAMqmH,UAAUp6E,KAGlBzd,EAASjtB,EAAO,SAAQ,SAAIvB,EAAOynC,GAAK,OAAGznC,EAAMomH,SAASn6E,EAASnkC,OAAOw5B,EAAM3F,EAAM8L,MACtFjZ,EAASjtB,EAAO,UAAS,SAAGvB,GAAM,OAAGA,EAAMqmH,UAAUp6E,SAElD,KAAItQ,EAAKK,OAQd,MAAM,IAAI1D,WAAW,6BAA+BlhB,KAAKC,UAAUskB,IAP/DqqF,EAAarqF,EAAMp6B,GACrBitB,EAASjtB,GAAQ2kH,GAEjB13F,EAASjtB,EAAO,SAAW2kH,EAC3B13F,EAASjtB,EAAO,UAAY2kH,KAlClC,IAAK5uF,IAAI/1B,KAAQwlC,EAAM,KA6CvB,OAJAvY,EAASuL,KAAI,SAAI/5B,EAAOynC,GAAK,OAAGznC,EAAM28F,QAAQl1D,EAAIxqC,UAClDuxB,EAASsY,OAAM,SAAI9mC,EAAOynC,GAAK,OAAGznC,EAAMsmH,YAAY7+E,EAAIqtB,WACxDtmC,EAASukF,UAAYvkF,EAASukF,WAAS,SAAK/yG,GAAM,OAAGA,EAAM28F,QAAQ,OAE5DnuE,EA4DgBu3F,CAAc9rF,EAAQ8M,IAO/C,YAAE/uB,MAAA,SAAM+hB,GACJzC,IAAqEM,EAAjE53B,EAAQ,IAAI8lH,EAAmBtsH,KAAKygC,OAAQzgC,KAAKusH,eACrD/lH,EAAMsmH,YAAY9sH,KAAKitH,UAAUzuG,MAAM+hB,EAAM,KAC7C,GAAKnC,EAAM53B,EAAM+8F,kBAAqB/8F,EAAMuvB,MAAM50B,QAClD,OAAOi9B,GAO0B,IAAI4uF,EAAevsF,EAAQ,IAAW,aAAc,CAAC1zB,MAAM,IAAS,CACvGgjC,WAAY,CAACoG,MAAO,cACpB2kB,UAAW,CAAC3kB,MAAO,aACnBwkB,UAAW,CAACxkB,MAAO,aACnBi0C,YAAa,CAACj0C,MAAO,eACrBk0C,aAAc,CAACl0C,MAAO,eAAgBhH,SAAU,SAAAlB,GAAI,MAAI,CAACoyB,OAAQpyB,EAAI6/C,QAAQ,UAAY,KACzFo+B,QAAS,CAAC/1E,MAAO,UAAWhH,SAAU,SAAAlB,GAAI,MAAI,CAACqJ,OAAQrJ,EAAItyB,IAAI5Y,MAAM,MACrE81G,WAAY,CAAC1iE,MAAO,aAAcq2E,cAAc,GAChD1T,MAAO,CAAC3iE,MAAO,aAAchH,SAAU,SAAAlB,GAAI,MAAI,CAACvmC,OAAQumC,EAAIu/C,MAAQ,KAAMg/B,cAAc,GACxFv7E,GAAI,CAAClR,KAAM,mBACXs9B,MAAO,CAACt9B,KAAM,QAASoP,SAAU,SAAAlB,GAAI,MAAI,CACvC//B,IAAK+/B,EAAI6/C,QAAQ,OACjB14E,MAAO64B,EAAI6/C,QAAQ,UAAY,KAC/B/wB,IAAK9uB,EAAIqtB,SAAS,IAAMrtB,EAAIqtB,SAAS,GAAG73D,SAAW,QAErD41G,UAAW,CAACt5E,KAAM,cAElBqsF,GAAI,CAAC/sF,KAAM,MACXgtF,OAAQ,CAAChtF,KAAM,UACfx3B,KAAM,CAACw3B,KAAM,OAAQ8P,SAAU,SAAAlB,GAAI,MAAI,CACrC9W,KAAM8W,EAAI6/C,QAAQ,QAClB14E,MAAO64B,EAAI6/C,QAAQ,UAAY,QAEjC4qB,YAAa,CAACr5E,KAAM,OAAQmtF,cAAc,KAvBhC,ICjOCU,EAkCX,SAAYrlF,EAAO5I,GAGjBj/B,KAAK6nC,MAAQA,EAEb7nC,KAAKi/B,MAAQA,GAMjB,YAAEkuF,UAAA,SAAU1pH,EAAS0B,GACjB24B,IAAIt3B,EAAQ,IAAI4mH,EAAwBptH,KAAK6nC,MAAO7nC,KAAKi/B,MAAO95B,GAEhE,OADAqB,EAAM6mH,cAAc5pH,GACb+C,EAAMwkC,KAML,IAACsiF,EAA4B,IAAIJ,EAAmB,CAC9Dn9E,WAAA,SAAWvpC,EAAOu5B,GAChBv5B,EAAM+mH,UAAU,KAAM,KAAMxtF,GAAI,WAAK,OAAGv5B,EAAM6mH,cAActtF,OAE9D84E,WAAA,SAAWryG,EAAOu5B,GAChBv5B,EAAMkH,MAAM,OAASqyB,EAAK+H,MAAMpgC,QAAU,IAAM,MAChDlB,EAAM+5B,KAAKR,EAAK6sB,aAAa,GAC7BpmD,EAAMgnH,gBACNhnH,EAAMkH,MAAM,OACZlH,EAAMinH,WAAW1tF,IAEnBmsF,QAAA,SAAQ1lH,EAAOu5B,GACbv5B,EAAMkH,MAAMlH,EAAMknH,OAAO,IAAK3tF,EAAK+H,MAAMwP,OAAS,KAClD9wC,EAAMwuG,aAAaj1E,GACnBv5B,EAAMinH,WAAW1tF,IAEnBksF,gBAAA,SAAgBzlH,EAAOu5B,GACrBv5B,EAAMkH,MAAMqyB,EAAK+H,MAAMylD,QAAU,OACjC/mF,EAAMinH,WAAW1tF,IAEnBqqD,YAAA,SAAY5jF,EAAOu5B,GACjBv5B,EAAMmnH,WAAW5tF,EAAM,MAAI,WAAK,OAAIA,EAAK+H,MAAM8lF,QAAU,KAAO,QAElEvjC,aAAA,SAAa7jF,EAAOu5B,GAClBjC,IAAIyH,EAAQxF,EAAK+H,MAAMu4B,OAAS,EAC5BwtD,EAAOjqH,OAAO2hC,EAAQxF,EAAKyG,WAAa,GAAGrlC,OAC3Cw3C,EAAQnyC,EAAMknH,OAAO,IAAKG,EAAO,GACrCrnH,EAAMmnH,WAAW5tF,EAAM4Y,GAAK,SAAE13C,GAC5B68B,IAAIgwF,EAAOlqH,OAAO2hC,EAAQtkC,GAC1B,OAAOuF,EAAMknH,OAAO,IAAKG,EAAOC,EAAK3sH,QAAU2sH,EAAO,SAG1DnzD,UAAA,SAAUn0D,EAAOu5B,GACfv5B,EAAM6mH,cAActtF,IAEtB+6B,UAAA,SAAUt0D,EAAOu5B,GACfv5B,EAAMwuG,aAAaj1E,GACnBv5B,EAAMinH,WAAW1tF,IAGnBs9B,MAAA,SAAM72D,EAAOu5B,GACXv5B,EAAMkH,MAAM,KAAOlH,EAAMunH,IAAIhuF,EAAK+H,MAAMi1B,KAAO,IAAM,KAAOv2D,EAAMunH,IAAIhuF,EAAK+H,MAAM55B,MACpE6xB,EAAK+H,MAAM1yB,MAAQ,IAAM5O,EAAMwnH,MAAMjuF,EAAK+H,MAAM1yB,OAAS,IAAM,MAE9E+2G,WAAA,SAAW3lH,EAAOu5B,EAAM/1B,EAAQqJ,GAC9B,IAAKyqB,IAAI78B,EAAIoS,EAAQ,EAAGpS,EAAI+I,EAAOw8B,WAAYvlC,IAC7C,GAAI+I,EAAOq7B,MAAMpkC,GAAG8G,MAAQg4B,EAAKh4B,KAE/B,YADAvB,EAAMkH,MAAM,SAIlB6yB,KAAA,SAAK/5B,EAAOu5B,GACVv5B,EAAM+5B,KAAKR,EAAKQ,QAEjB,CACD6rF,GAAI,CAACh+G,KAAM,IAAKT,MAAO,IAAKsgH,SAAS,EAAMC,0BAA0B,GACrE7B,OAAQ,CAACj+G,KAAM,KAAMT,MAAO,KAAMsgH,SAAS,EAAMC,0BAA0B,GAC3ErmH,KAAM,CACJuG,KAAA,SAAK+/G,EAAQ9uF,EAAMr1B,EAAQqJ,GACzB,OAAO+6G,EAAW/uF,EAAMr1B,EAAQqJ,EAAO,GAAK,IAAM,KAEpD1F,MAAA,SAAMnH,EAAO64B,EAAMr1B,EAAQqJ,GACzB,OAAO+6G,EAAW/uF,EAAMr1B,EAAQqJ,GAAQ,GAAK,IACzC,KAAO7M,EAAMunH,IAAI1uF,EAAKyI,MAAM3Q,OAASkI,EAAKyI,MAAM1yB,MAAQ,IAAM5O,EAAMwnH,MAAM3uF,EAAKyI,MAAM1yB,OAAS,IAAM,MAG5GgN,KAAM,CAAChU,KAAA,SAAK+/G,EAAQE,EAAOrkH,EAAQqJ,GAAS,OAAOi7G,EAAatkH,EAAOq7B,MAAMhyB,IAAS,IAC/E1F,MAAA,SAAMwgH,EAAQE,EAAOrkH,EAAQqJ,GAAS,OAAOi7G,EAAatkH,EAAOq7B,MAAMhyB,EAAQ,GAAI,IACnFnM,QAAQ,KAGjB,SAASonH,EAAavuF,EAAMkzB,GAC1Bn1B,IAAmBtY,EAAf+oG,EAAQ,MAAU95G,EAAM,EAC5B,GAAIsrB,EAAK8F,OAAQ,KAAOrgB,EAAI+oG,EAAM3vH,KAAKmhC,EAAKQ,OAAO9rB,EAAM7U,KAAKsvB,IAAIza,EAAK+Q,EAAE,GAAGrkB,QAE5E,IADA28B,IAAIj7B,EAAS4R,EAAM,GAAKw+C,EAAO,EAAI,KAAO,IACjChyD,EAAI,EAAGA,EAAIwT,EAAKxT,IAAK4B,GAAU,IAExC,OADI4R,EAAM,GAAKw+C,EAAO,IAAGpwD,GAAU,KAC5BA,EAGT,SAASurH,EAAWvmH,EAAMmC,EAAQqJ,EAAO4/C,GACvC,GAAIprD,EAAKigC,MAAM1yB,QAAU,QAAQtD,KAAKjK,EAAKigC,MAAM3Q,MAAO,OAAO,EAC/D2G,IAAIr6B,EAAUuG,EAAOq7B,MAAMhyB,GAAS4/C,EAAO,GAAK,EAAI,IACpD,IAAKxvD,EAAQoiC,QAAUpiC,EAAQ88B,MAAQ14B,EAAKigC,MAAM3Q,MAAQ1zB,EAAQw7B,MAAMx7B,EAAQw7B,MAAM99B,OAAS,IAAM0G,EAAM,OAAO,EAClH,GAAIwL,IAAU4/C,EAAO,EAAI,EAAIjpD,EAAOw8B,WAAa,GAAI,OAAO,EAC5D1I,IAAIjtB,EAAO7G,EAAOq7B,MAAMhyB,GAAS4/C,EAAO,GAAK,EAAI,IACjD,OAAQprD,EAAKmhC,QAAQn4B,EAAKouB,OAM5B,IAAamuF,EACX,SAAYvlF,EAAO5I,EAAO95B,GACxBnF,KAAK6nC,MAAQA,EACb7nC,KAAKi/B,MAAQA,EACbj/B,KAAKwuH,MAAQxuH,KAAKgrC,IAAM,GACxBhrC,KAAKyuH,QAAS,EACdzuH,KAAK0uH,aAAc,EAOnB1uH,KAAKmF,QAAUA,GAAW,QACY,IAA3BnF,KAAKmF,QAAQwpH,aACtB3uH,KAAKmF,QAAQwpH,YAAa,IAGhC,YAAEC,WAAA,SAAWxyG,GACT,GAAIpc,KAAKyuH,OAAQ,CAGf,GAFKzuH,KAAK6uH,YAAW7uH,KAAKgrC,KAAO,MACrB,MAAR5uB,IAAcA,EAAO,GACrBA,EAAO,EAAG,CACZ0hB,IAAIgxF,EAAW9uH,KAAKwuH,MAChBnrH,EAAO,OAAOzE,KAAKkwH,GACnBzrH,IAAMyrH,EAAWA,EAAS/rH,MAAM,EAAG+rH,EAAS3tH,OAASkC,EAAK,GAAGlC,SACjE,IAAK28B,IAAI78B,EAAI,EAAGA,EAAImb,EAAMnb,IACxBjB,KAAKgrC,KAAO8jF,EAAW,KAE3B9uH,KAAKyuH,QAAS,IASpB,YAAElB,UAAA,SAAUiB,EAAOO,EAAYhvF,EAAM17B,GACjCy5B,IAAI84C,EAAM52E,KAAKwuH,MACfxuH,KAAK0N,MAAMqhH,GAAcP,GACzBxuH,KAAKwuH,OAASA,EACdnqH,IACArE,KAAKwuH,MAAQ53C,EACb52E,KAAKytH,WAAW1tF,IAGpB,YAAE8uF,QAAA,WACE,MAAO,UAAU/8G,KAAK9R,KAAKgrC,MAK/B,YAAEwiF,cAAA,WACOxtH,KAAK6uH,YAAW7uH,KAAKgrC,KAAO,OAOrC,YAAEt9B,MAAA,SAAMjK,GACJzD,KAAK4uH,aACD5uH,KAAKwuH,OAASxuH,KAAK6uH,YACrB7uH,KAAKgrC,KAAOhrC,KAAKwuH,OACf/qH,IAASzD,KAAKgrC,KAAOvnC,IAK7B,YAAEgqH,WAAA,SAAW1tF,GACT//B,KAAKyuH,OAAS1uF,GAMlB,YAAEQ,KAAA,SAAKA,EAAMr5B,GAET,IADA,IAAIsxG,EAAQj4E,EAAKh6B,MAAM,MACdtF,EAAI,EAAGA,EAAIu3G,EAAMr3G,OAAQF,IAAK,CACvC,IAAMo9D,EAAcr+D,KAAK6uH,WAAa7uH,KAAKyuH,OAC3C,KAAO/gH,QACP,KAAOs9B,MAAkB,IAAX9jC,EAAmBlH,KAAK+tH,IAAIvV,EAAMv3G,GAAIo9D,GAAem6C,EAAMv3G,GACnEA,GAAKu3G,EAAMr3G,OAAS,IAAGnB,KAAKgrC,KAAO,QAM7C,YAAE9hC,OAAA,SAAO62B,EAAM/1B,EAAQqJ,GACnB,GAAqB,iBAAVrJ,EAAoB,MAAM,IAAI4J,MAAM,KAC/C5T,KAAK6nC,MAAM9H,EAAKh4B,KAAKtI,MAAMO,KAAM+/B,EAAM/1B,EAAQqJ,IAKnD,YAAEg6G,cAAA,SAAcrjH,G,WACZA,EAAOlJ,SAAO,SAAEi/B,EAAMkB,EAAGhgC,GAAG,OAAGjB,EAAKkJ,OAAO62B,EAAM/1B,EAAQ/I,OAK7D,YAAE+zG,aAAA,SAAahrG,G,WACPgjC,EAAS,GAAIgiF,EAAW,GACxBC,EAAW,SAAClvF,EAAMkB,EAAG5tB,GACzB,IAAM4rB,EAAQc,EAAOA,EAAKd,MAAQ,GAO5Bc,GAA2B,eAAnBA,EAAKh4B,KAAKtI,OACpBw/B,EAAQA,EAAMjlB,QAAM,SAACwL,GACrB,GAAMnS,EAAQ,GAAKrJ,EAAOw8B,WAAY,OAAO,EAC7C,IAAM31B,EAAO7G,EAAOq7B,MAAMhyB,EAAQ,GAClC,OAASmS,EAAEwjB,QAAQn4B,EAAKouB,UAAYpuB,EAAKg1B,QAAU,KAAK/zB,KAAKjB,EAAK0vB,WAGpEzC,IAAIoxF,EAAUF,EAId,GAHF,EAAa,GAGPjvF,GAAQA,EAAK8F,QAAU5G,EAAMhlB,MAAI,SAAColB,GACpCvB,IAAI0vD,EAAOxtF,EAAKi/B,MAAMI,EAAKt3B,KAAKtI,MAChC,OAAO+tF,GAAQA,EAAK0gC,4BAClB,CACJ,MAAgC,qBAAqBtvH,KAAKmhC,EAAKQ,MAArD4uF,GAAH,KAAG,MAAM,OAAOC,EAAA,KACvB,GAAaD,EACb,EAAaC,GACPD,GAAQC,MACZ,EAASvoF,EAAQ9G,EAAKmG,SAASW,GAAS,QAC3B5H,EAAQ+N,IAIvBlP,IAAI+I,EAAQ5H,EAAM99B,QAAU89B,EAAMA,EAAM99B,OAAS,GAAIkuH,EAAQxoF,IAAgD,IAAvC7mC,EAAKi/B,MAAM4H,EAAM9+B,KAAKtI,MAAMyH,OAC9FuN,EAAMwqB,EAAM99B,QAAUkuH,EAAQ,EAAI,GAMtC1xE,EAAO,IAAK7f,IAAI78B,EAAI,EAAGA,EAAIwT,EAAKxT,IAAK,CACnC68B,IAAIuB,EAAOJ,EAAMh+B,GACjB,IAAKjB,EAAKi/B,MAAMI,EAAKt3B,KAAKtI,MAAMwuH,QAAS,MACzC,IAAKnwF,IAAIxR,EAAI,EAAGA,EAAI0gB,EAAO7rC,OAAQmrB,IAAK,CACtCwR,IAAI3X,EAAQ6mB,EAAO1gB,GACnB,IAAKtsB,EAAKi/B,MAAM9Y,EAAMpe,KAAKtI,MAAMwuH,QAAS,MAC1C,GAAI5uF,EAAK8D,GAAGhd,GAAQ,CACdllB,EAAIqrB,EACN2S,EAAQA,EAAMl8B,MAAM,EAAGupB,GAAGzhB,OAAOw0B,GAAMx0B,OAAOo0B,EAAMl8B,MAAMupB,EAAGrrB,IAAI4J,OAAOo0B,EAAMl8B,MAAM9B,EAAI,EAAGwT,IACpF6X,EAAIrrB,IACXg+B,EAAQA,EAAMl8B,MAAM,EAAG9B,GAAG4J,OAAOo0B,EAAMl8B,MAAM9B,EAAI,EAAGqrB,IAAIzhB,OAAOw0B,GAAMx0B,OAAOo0B,EAAMl8B,MAAMupB,EAAG7X,KAC7F,SAASkpC,IAOf,IADA7f,IAAIia,EAAO,EACJA,EAAOn4C,KAAKiJ,IAAImkC,EAAO7rC,OAAQsT,IAAQwqB,EAAM8Y,GAAM5U,GAAG6J,EAAO+K,OAAUA,EAG9E,KAAOA,EAAO/K,EAAO7rC,QACnBnB,EAAKugC,KAAKvgC,EAAKsvH,WAAWtiF,EAAOQ,OAAO,EAAOxjC,EAAQqJ,IAAQ,GAMnE,GAHM67G,GAASlvH,EAAKugC,KAAK2uF,GAGnBnvF,EAAM,CACR,KAAOiN,EAAO7rC,OAASsT,GAAK,CAC5B,IAAMtK,EAAM80B,EAAM+N,EAAO7rC,QACvB6rC,EAAO73B,KAAKhL,GACZnK,EAAKugC,KAAKvgC,EAAKsvH,WAAWnlH,GAAK,EAAMH,EAAQqJ,IAAQ,GAKnDg8G,GAAStvF,EAAK8F,OAChB7lC,EAAKugC,KAAKvgC,EAAKsvH,WAAWzoF,GAAO,EAAM78B,EAAQqJ,GAAS0sB,EAAKQ,KACnDvgC,EAAKsvH,WAAWzoF,GAAO,EAAO78B,EAAQqJ,EAAQ,IAAI,GAE5DrT,EAAKkJ,OAAO62B,EAAM/1B,EAAQqJ,KAGhCrJ,EAAOlJ,QAAQmuH,GACfA,EAAS,KAAM,EAAMjlH,EAAOw8B,aAQhC,YAAEmnF,WAAA,SAAW5tF,EAAMyuF,EAAOO,G,WAClB/uH,KAAKyuH,QAAUzuH,KAAKyuH,OAAO1mH,MAAQg4B,EAAKh4B,KAC1C/H,KAAK4uH,WAAW,GACT5uH,KAAK0uH,aACZ1uH,KAAK4uH,WAAW,GAElB,IAAIW,OAAqC,IAApBxvF,EAAK+H,MAAMo1E,MAAuBn9E,EAAK+H,MAAMo1E,MAAQl9G,KAAKmF,QAAQwpH,WACnFa,EAAYxvH,KAAK0uH,YACrB1uH,KAAK0uH,YAAca,EACnBxvF,EAAKj/B,SAAO,SAAEukC,EAAOpE,EAAGhgC,GAClBA,GAAKsuH,GAASvvH,EAAK4uH,WAAW,GACpC,EAAOrB,UAAUiB,EAAOO,EAAW9tH,GAAI8+B,GAAI,WAAK,OAAG//B,EAAKkJ,OAAOm8B,EAAOtF,EAAM9+B,SAE5EjB,KAAK0uH,YAAcc,GAOvB,YAAEzB,IAAA,SAAIzqH,EAAK+6D,GAGP,OAFA/6D,EAAMA,EAAIC,QAAQ,eAAgB,QAC9B86D,IAAa/6D,EAAMA,EAAIC,QAAQ,YAAa,QAAQA,QAAQ,WAAY,UACrED,GAGX,YAAE0qH,MAAA,SAAM1qH,GACJ,IAAIgvC,GAA4B,GAArBhvC,EAAI6P,QAAQ,KAAa,MAA4B,GAArB7P,EAAI6P,QAAQ,KAAa,KAAO,KAC3E,OAAOm/B,EAAK,GAAKhvC,EAAMgvC,EAAK,IAKhC,YAAEo7E,OAAA,SAAOpqH,EAAKuV,GAEV,IADAilB,IAAIkN,EAAM,GACD/pC,EAAI,EAAGA,EAAI4X,EAAG5X,IAAK+pC,GAAO1nC,EACnC,OAAO0nC,GAKX,YAAEskF,WAAA,SAAWjwF,EAAMjxB,EAAMpE,EAAQqJ,GAC7ByqB,IAAI0vD,EAAOxtF,KAAKi/B,MAAMI,EAAKt3B,KAAKtI,MAC5BgF,EAAQ2J,EAAOo/E,EAAKp/E,KAAOo/E,EAAK7/E,MACpC,MAAuB,iBAATlJ,EAAoBA,EAAQA,EAAMzE,KAAMq/B,EAAMr1B,EAAQqJ,IAOxE,YAAEo8G,uBAAA,SAAuBlvF,GACrB,MAAO,CACL2uF,SAAU3uF,EAAK1tB,MAAM,WAAa,IAAI,GACtCm8G,UAAWzuF,EAAK1tB,MAAM,WAAa,IAAI","file":"vendors~editor.js?v=823feea1d44f1862d425","sourcesContent":["module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (error) {\n    return true;\n  }\n};\n","var global = require('../internals/global');\nvar shared = require('../internals/shared');\nvar has = require('../internals/has');\nvar uid = require('../internals/uid');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar WellKnownSymbolsStore = shared('wks');\nvar Symbol = global.Symbol;\nvar createWellKnownSymbol = USE_SYMBOL_AS_UID ? Symbol : Symbol && Symbol.withoutSetter || uid;\n\nmodule.exports = function (name) {\n  if (!has(WellKnownSymbolsStore, name)) {\n    if (NATIVE_SYMBOL && has(Symbol, name)) WellKnownSymbolsStore[name] = Symbol[name];\n    else WellKnownSymbolsStore[name] = createWellKnownSymbol('Symbol.' + name);\n  } return WellKnownSymbolsStore[name];\n};\n","var check = function (it) {\n  return it && it.Math == Math && it;\n};\n\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nmodule.exports =\n  // eslint-disable-next-line no-undef\n  check(typeof globalThis == 'object' && globalThis) ||\n  check(typeof window == 'object' && window) ||\n  check(typeof self == 'object' && self) ||\n  check(typeof global == 'object' && global) ||\n  // eslint-disable-next-line no-new-func\n  (function () { return this; })() || Function('return this')();\n","'use strict';\n\nvar bind = require('./helpers/bind');\n\n/*global toString:true*/\n\n// utils is a library of generic helper functions non-specific to axios\n\nvar toString = Object.prototype.toString;\n\n/**\n * Determine if a value is an Array\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an Array, otherwise false\n */\nfunction isArray(val) {\n  return toString.call(val) === '[object Array]';\n}\n\n/**\n * Determine if a value is undefined\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if the value is undefined, otherwise false\n */\nfunction isUndefined(val) {\n  return typeof val === 'undefined';\n}\n\n/**\n * Determine if a value is a Buffer\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Buffer, otherwise false\n */\nfunction isBuffer(val) {\n  return val !== null && !isUndefined(val) && val.constructor !== null && !isUndefined(val.constructor)\n    && typeof val.constructor.isBuffer === 'function' && val.constructor.isBuffer(val);\n}\n\n/**\n * Determine if a value is an ArrayBuffer\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an ArrayBuffer, otherwise false\n */\nfunction isArrayBuffer(val) {\n  return toString.call(val) === '[object ArrayBuffer]';\n}\n\n/**\n * Determine if a value is a FormData\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an FormData, otherwise false\n */\nfunction isFormData(val) {\n  return (typeof FormData !== 'undefined') && (val instanceof FormData);\n}\n\n/**\n * Determine if a value is a view on an ArrayBuffer\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a view on an ArrayBuffer, otherwise false\n */\nfunction isArrayBufferView(val) {\n  var result;\n  if ((typeof ArrayBuffer !== 'undefined') && (ArrayBuffer.isView)) {\n    result = ArrayBuffer.isView(val);\n  } else {\n    result = (val) && (val.buffer) && (val.buffer instanceof ArrayBuffer);\n  }\n  return result;\n}\n\n/**\n * Determine if a value is a String\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a String, otherwise false\n */\nfunction isString(val) {\n  return typeof val === 'string';\n}\n\n/**\n * Determine if a value is a Number\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Number, otherwise false\n */\nfunction isNumber(val) {\n  return typeof val === 'number';\n}\n\n/**\n * Determine if a value is an Object\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an Object, otherwise false\n */\nfunction isObject(val) {\n  return val !== null && typeof val === 'object';\n}\n\n/**\n * Determine if a value is a plain Object\n *\n * @param {Object} val The value to test\n * @return {boolean} True if value is a plain Object, otherwise false\n */\nfunction isPlainObject(val) {\n  if (toString.call(val) !== '[object Object]') {\n    return false;\n  }\n\n  var prototype = Object.getPrototypeOf(val);\n  return prototype === null || prototype === Object.prototype;\n}\n\n/**\n * Determine if a value is a Date\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Date, otherwise false\n */\nfunction isDate(val) {\n  return toString.call(val) === '[object Date]';\n}\n\n/**\n * Determine if a value is a File\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a File, otherwise false\n */\nfunction isFile(val) {\n  return toString.call(val) === '[object File]';\n}\n\n/**\n * Determine if a value is a Blob\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Blob, otherwise false\n */\nfunction isBlob(val) {\n  return toString.call(val) === '[object Blob]';\n}\n\n/**\n * Determine if a value is a Function\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Function, otherwise false\n */\nfunction isFunction(val) {\n  return toString.call(val) === '[object Function]';\n}\n\n/**\n * Determine if a value is a Stream\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Stream, otherwise false\n */\nfunction isStream(val) {\n  return isObject(val) && isFunction(val.pipe);\n}\n\n/**\n * Determine if a value is a URLSearchParams object\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a URLSearchParams object, otherwise false\n */\nfunction isURLSearchParams(val) {\n  return typeof URLSearchParams !== 'undefined' && val instanceof URLSearchParams;\n}\n\n/**\n * Trim excess whitespace off the beginning and end of a string\n *\n * @param {String} str The String to trim\n * @returns {String} The String freed of excess whitespace\n */\nfunction trim(str) {\n  return str.replace(/^\\s*/, '').replace(/\\s*$/, '');\n}\n\n/**\n * Determine if we're running in a standard browser environment\n *\n * This allows axios to run in a web worker, and react-native.\n * Both environments support XMLHttpRequest, but not fully standard globals.\n *\n * web workers:\n *  typeof window -> undefined\n *  typeof document -> undefined\n *\n * react-native:\n *  navigator.product -> 'ReactNative'\n * nativescript\n *  navigator.product -> 'NativeScript' or 'NS'\n */\nfunction isStandardBrowserEnv() {\n  if (typeof navigator !== 'undefined' && (navigator.product === 'ReactNative' ||\n                                           navigator.product === 'NativeScript' ||\n                                           navigator.product === 'NS')) {\n    return false;\n  }\n  return (\n    typeof window !== 'undefined' &&\n    typeof document !== 'undefined'\n  );\n}\n\n/**\n * Iterate over an Array or an Object invoking a function for each item.\n *\n * If `obj` is an Array callback will be called passing\n * the value, index, and complete array for each item.\n *\n * If 'obj' is an Object callback will be called passing\n * the value, key, and complete object for each property.\n *\n * @param {Object|Array} obj The object to iterate\n * @param {Function} fn The callback to invoke for each item\n */\nfunction forEach(obj, fn) {\n  // Don't bother if no value provided\n  if (obj === null || typeof obj === 'undefined') {\n    return;\n  }\n\n  // Force an array if not already something iterable\n  if (typeof obj !== 'object') {\n    /*eslint no-param-reassign:0*/\n    obj = [obj];\n  }\n\n  if (isArray(obj)) {\n    // Iterate over array values\n    for (var i = 0, l = obj.length; i < l; i++) {\n      fn.call(null, obj[i], i, obj);\n    }\n  } else {\n    // Iterate over object keys\n    for (var key in obj) {\n      if (Object.prototype.hasOwnProperty.call(obj, key)) {\n        fn.call(null, obj[key], key, obj);\n      }\n    }\n  }\n}\n\n/**\n * Accepts varargs expecting each argument to be an object, then\n * immutably merges the properties of each object and returns result.\n *\n * When multiple objects contain the same key the later object in\n * the arguments list will take precedence.\n *\n * Example:\n *\n * ```js\n * var result = merge({foo: 123}, {foo: 456});\n * console.log(result.foo); // outputs 456\n * ```\n *\n * @param {Object} obj1 Object to merge\n * @returns {Object} Result of all merge properties\n */\nfunction merge(/* obj1, obj2, obj3, ... */) {\n  var result = {};\n  function assignValue(val, key) {\n    if (isPlainObject(result[key]) && isPlainObject(val)) {\n      result[key] = merge(result[key], val);\n    } else if (isPlainObject(val)) {\n      result[key] = merge({}, val);\n    } else if (isArray(val)) {\n      result[key] = val.slice();\n    } else {\n      result[key] = val;\n    }\n  }\n\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    forEach(arguments[i], assignValue);\n  }\n  return result;\n}\n\n/**\n * Extends object a by mutably adding to it the properties of object b.\n *\n * @param {Object} a The object to be extended\n * @param {Object} b The object to copy properties from\n * @param {Object} thisArg The object to bind function to\n * @return {Object} The resulting value of object a\n */\nfunction extend(a, b, thisArg) {\n  forEach(b, function assignValue(val, key) {\n    if (thisArg && typeof val === 'function') {\n      a[key] = bind(val, thisArg);\n    } else {\n      a[key] = val;\n    }\n  });\n  return a;\n}\n\n/**\n * Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)\n *\n * @param {string} content with BOM\n * @return {string} content value without BOM\n */\nfunction stripBOM(content) {\n  if (content.charCodeAt(0) === 0xFEFF) {\n    content = content.slice(1);\n  }\n  return content;\n}\n\nmodule.exports = {\n  isArray: isArray,\n  isArrayBuffer: isArrayBuffer,\n  isBuffer: isBuffer,\n  isFormData: isFormData,\n  isArrayBufferView: isArrayBufferView,\n  isString: isString,\n  isNumber: isNumber,\n  isObject: isObject,\n  isPlainObject: isPlainObject,\n  isUndefined: isUndefined,\n  isDate: isDate,\n  isFile: isFile,\n  isBlob: isBlob,\n  isFunction: isFunction,\n  isStream: isStream,\n  isURLSearchParams: isURLSearchParams,\n  isStandardBrowserEnv: isStandardBrowserEnv,\n  forEach: forEach,\n  merge: merge,\n  extend: extend,\n  trim: trim,\n  stripBOM: stripBOM\n};\n","var hasOwnProperty = {}.hasOwnProperty;\n\nmodule.exports = function (it, key) {\n  return hasOwnProperty.call(it, key);\n};\n","var isObject = require('../internals/is-object');\n\nmodule.exports = function (it) {\n  if (!isObject(it)) {\n    throw TypeError(String(it) + ' is not an object');\n  } return it;\n};\n","module.exports = function (it) {\n  return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n","var fails = require('../internals/fails');\n\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !fails(function () {\n  return Object.defineProperty({}, 1, { get: function () { return 7; } })[1] != 7;\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\nvar anObject = require('../internals/an-object');\nvar toPrimitive = require('../internals/to-primitive');\n\nvar nativeDefineProperty = Object.defineProperty;\n\n// `Object.defineProperty` method\n// https://tc39.github.io/ecma262/#sec-object.defineproperty\nexports.f = DESCRIPTORS ? nativeDefineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPrimitive(P, true);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return nativeDefineProperty(O, P, Attributes);\n  } catch (error) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = DESCRIPTORS ? function (object, key, value) {\n  return definePropertyModule.f(object, key, createPropertyDescriptor(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","var global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar setGlobal = require('../internals/set-global');\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\nvar isForced = require('../internals/is-forced');\n\n/*\n  options.target      - name of the target object\n  options.global      - target is the global object\n  options.stat        - export as static methods of target\n  options.proto       - export as prototype methods of target\n  options.real        - real prototype method for the `pure` version\n  options.forced      - export even if the native feature is available\n  options.bind        - bind methods to the target, required for the `pure` version\n  options.wrap        - wrap constructors to preventing global pollution, required for the `pure` version\n  options.unsafe      - use the simple assignment of property instead of delete + defineProperty\n  options.sham        - add a flag to not completely full polyfills\n  options.enumerable  - export as enumerable property\n  options.noTargetGet - prevent calling a getter on target\n*/\nmodule.exports = function (options, source) {\n  var TARGET = options.target;\n  var GLOBAL = options.global;\n  var STATIC = options.stat;\n  var FORCED, target, key, targetProperty, sourceProperty, descriptor;\n  if (GLOBAL) {\n    target = global;\n  } else if (STATIC) {\n    target = global[TARGET] || setGlobal(TARGET, {});\n  } else {\n    target = (global[TARGET] || {}).prototype;\n  }\n  if (target) for (key in source) {\n    sourceProperty = source[key];\n    if (options.noTargetGet) {\n      descriptor = getOwnPropertyDescriptor(target, key);\n      targetProperty = descriptor && descriptor.value;\n    } else targetProperty = target[key];\n    FORCED = isForced(GLOBAL ? key : TARGET + (STATIC ? '.' : '#') + key, options.forced);\n    // contained in target\n    if (!FORCED && targetProperty !== undefined) {\n      if (typeof sourceProperty === typeof targetProperty) continue;\n      copyConstructorProperties(sourceProperty, targetProperty);\n    }\n    // add a flag to not completely full polyfills\n    if (options.sham || (targetProperty && targetProperty.sham)) {\n      createNonEnumerableProperty(sourceProperty, 'sham', true);\n    }\n    // extend global\n    redefine(target, key, sourceProperty, options);\n  }\n};\n","var global = require('../internals/global');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar has = require('../internals/has');\nvar setGlobal = require('../internals/set-global');\nvar inspectSource = require('../internals/inspect-source');\nvar InternalStateModule = require('../internals/internal-state');\n\nvar getInternalState = InternalStateModule.get;\nvar enforceInternalState = InternalStateModule.enforce;\nvar TEMPLATE = String(String).split('String');\n\n(module.exports = function (O, key, value, options) {\n  var unsafe = options ? !!options.unsafe : false;\n  var simple = options ? !!options.enumerable : false;\n  var noTargetGet = options ? !!options.noTargetGet : false;\n  var state;\n  if (typeof value == 'function') {\n    if (typeof key == 'string' && !has(value, 'name')) {\n      createNonEnumerableProperty(value, 'name', key);\n    }\n    state = enforceInternalState(value);\n    if (!state.source) {\n      state.source = TEMPLATE.join(typeof key == 'string' ? key : '');\n    }\n  }\n  if (O === global) {\n    if (simple) O[key] = value;\n    else setGlobal(key, value);\n    return;\n  } else if (!unsafe) {\n    delete O[key];\n  } else if (!noTargetGet && O[key]) {\n    simple = true;\n  }\n  if (simple) O[key] = value;\n  else createNonEnumerableProperty(O, key, value);\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, 'toString', function toString() {\n  return typeof this == 'function' && getInternalState(this).source || inspectSource(this);\n});\n","export {\n    getRequestToken,\n    onRequestTokenUpdate\n} from './requesttoken'\nexport { getCurrentUser } from './user'\n","var toInteger = require('../internals/to-integer');\n\nvar min = Math.min;\n\n// `ToLength` abstract operation\n// https://tc39.github.io/ecma262/#sec-tolength\nmodule.exports = function (argument) {\n  return argument > 0 ? min(toInteger(argument), 0x1FFFFFFFFFFFFF) : 0; // 2 ** 53 - 1 == 9007199254740991\n};\n","var requireObjectCoercible = require('../internals/require-object-coercible');\n\n// `ToObject` abstract operation\n// https://tc39.github.io/ecma262/#sec-toobject\nmodule.exports = function (argument) {\n  return Object(requireObjectCoercible(argument));\n};\n","module.exports = {};\n","/* globals __VUE_SSR_CONTEXT__ */\n\n// IMPORTANT: Do NOT use ES2015 features in this file (except for modules).\n// This module is a runtime utility for cleaner component module output and will\n// be included in the final webpack user bundle.\n\nexport default function normalizeComponent (\n  scriptExports,\n  render,\n  staticRenderFns,\n  functionalTemplate,\n  injectStyles,\n  scopeId,\n  moduleIdentifier, /* server only */\n  shadowMode /* vue-cli only */\n) {\n  // Vue.extend constructor export interop\n  var options = typeof scriptExports === 'function'\n    ? scriptExports.options\n    : scriptExports\n\n  // render functions\n  if (render) {\n    options.render = render\n    options.staticRenderFns = staticRenderFns\n    options._compiled = true\n  }\n\n  // functional template\n  if (functionalTemplate) {\n    options.functional = true\n  }\n\n  // scopedId\n  if (scopeId) {\n    options._scopeId = 'data-v-' + scopeId\n  }\n\n  var hook\n  if (moduleIdentifier) { // server build\n    hook = function (context) {\n      // 2.3 injection\n      context =\n        context || // cached call\n        (this.$vnode && this.$vnode.ssrContext) || // stateful\n        (this.parent && this.parent.$vnode && this.parent.$vnode.ssrContext) // functional\n      // 2.2 with runInNewContext: true\n      if (!context && typeof __VUE_SSR_CONTEXT__ !== 'undefined') {\n        context = __VUE_SSR_CONTEXT__\n      }\n      // inject component styles\n      if (injectStyles) {\n        injectStyles.call(this, context)\n      }\n      // register component module identifier for async chunk inferrence\n      if (context && context._registeredComponents) {\n        context._registeredComponents.add(moduleIdentifier)\n      }\n    }\n    // used by ssr in case component is cached and beforeCreate\n    // never gets called\n    options._ssrRegister = hook\n  } else if (injectStyles) {\n    hook = shadowMode\n      ? function () {\n        injectStyles.call(\n          this,\n          (options.functional ? this.parent : this).$root.$options.shadowRoot\n        )\n      }\n      : injectStyles\n  }\n\n  if (hook) {\n    if (options.functional) {\n      // for template-only hot-reload because in that case the render fn doesn't\n      // go through the normalizer\n      options._injectStyles = hook\n      // register for functional component in vue file\n      var originalRender = options.render\n      options.render = function renderWithStyleInjection (h, context) {\n        hook.call(context)\n        return originalRender(h, context)\n      }\n    } else {\n      // inject component registration as beforeCreate hook\n      var existing = options.beforeCreate\n      options.beforeCreate = existing\n        ? [].concat(existing, hook)\n        : [hook]\n    }\n  }\n\n  return {\n    exports: scriptExports,\n    options: options\n  }\n}\n","var toString = {}.toString;\n\nmodule.exports = function (it) {\n  return toString.call(it).slice(8, -1);\n};\n","var NATIVE_WEAK_MAP = require('../internals/native-weak-map');\nvar global = require('../internals/global');\nvar isObject = require('../internals/is-object');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar objectHas = require('../internals/has');\nvar shared = require('../internals/shared-store');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar WeakMap = global.WeakMap;\nvar set, get, has;\n\nvar enforce = function (it) {\n  return has(it) ? get(it) : set(it, {});\n};\n\nvar getterFor = function (TYPE) {\n  return function (it) {\n    var state;\n    if (!isObject(it) || (state = get(it)).type !== TYPE) {\n      throw TypeError('Incompatible receiver, ' + TYPE + ' required');\n    } return state;\n  };\n};\n\nif (NATIVE_WEAK_MAP) {\n  var store = shared.state || (shared.state = new WeakMap());\n  var wmget = store.get;\n  var wmhas = store.has;\n  var wmset = store.set;\n  set = function (it, metadata) {\n    metadata.facade = it;\n    wmset.call(store, it, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return wmget.call(store, it) || {};\n  };\n  has = function (it) {\n    return wmhas.call(store, it);\n  };\n} else {\n  var STATE = sharedKey('state');\n  hiddenKeys[STATE] = true;\n  set = function (it, metadata) {\n    metadata.facade = it;\n    createNonEnumerableProperty(it, STATE, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return objectHas(it, STATE) ? it[STATE] : {};\n  };\n  has = function (it) {\n    return objectHas(it, STATE);\n  };\n}\n\nmodule.exports = {\n  set: set,\n  get: get,\n  has: has,\n  enforce: enforce,\n  getterFor: getterFor\n};\n","// `RequireObjectCoercible` abstract operation\n// https://tc39.github.io/ecma262/#sec-requireobjectcoercible\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n  return it;\n};\n","var path = require('../internals/path');\nvar global = require('../internals/global');\n\nvar aFunction = function (variable) {\n  return typeof variable == 'function' ? variable : undefined;\n};\n\nmodule.exports = function (namespace, method) {\n  return arguments.length < 2 ? aFunction(path[namespace]) || aFunction(global[namespace])\n    : path[namespace] && path[namespace][method] || global[namespace] && global[namespace][method];\n};\n","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","// toObject with fallback for non-array-like ES3 strings\nvar IndexedObject = require('../internals/indexed-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nmodule.exports = function (it) {\n  return IndexedObject(requireObjectCoercible(it));\n};\n","var ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `ToInteger` abstract operation\n// https://tc39.github.io/ecma262/#sec-tointeger\nmodule.exports = function (argument) {\n  return isNaN(argument = +argument) ? 0 : (argument > 0 ? floor : ceil)(argument);\n};\n","module.exports = {};\n","var aFunction = require('../internals/a-function');\n\n// optional / simple context binding\nmodule.exports = function (fn, that, length) {\n  aFunction(fn);\n  if (that === undefined) return fn;\n  switch (length) {\n    case 0: return function () {\n      return fn.call(that);\n    };\n    case 1: return function (a) {\n      return fn.call(that, a);\n    };\n    case 2: return function (a, b) {\n      return fn.call(that, a, b);\n    };\n    case 3: return function (a, b, c) {\n      return fn.call(that, a, b, c);\n    };\n  }\n  return function (/* ...args */) {\n    return fn.apply(that, arguments);\n  };\n};\n","var anObject = require('../internals/an-object');\nvar defineProperties = require('../internals/object-define-properties');\nvar enumBugKeys = require('../internals/enum-bug-keys');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar html = require('../internals/html');\nvar documentCreateElement = require('../internals/document-create-element');\nvar sharedKey = require('../internals/shared-key');\n\nvar GT = '>';\nvar LT = '<';\nvar PROTOTYPE = 'prototype';\nvar SCRIPT = 'script';\nvar IE_PROTO = sharedKey('IE_PROTO');\n\nvar EmptyConstructor = function () { /* empty */ };\n\nvar scriptTag = function (content) {\n  return LT + SCRIPT + GT + content + LT + '/' + SCRIPT + GT;\n};\n\n// Create object with fake `null` prototype: use ActiveX Object with cleared prototype\nvar NullProtoObjectViaActiveX = function (activeXDocument) {\n  activeXDocument.write(scriptTag(''));\n  activeXDocument.close();\n  var temp = activeXDocument.parentWindow.Object;\n  activeXDocument = null; // avoid memory leak\n  return temp;\n};\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar NullProtoObjectViaIFrame = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = documentCreateElement('iframe');\n  var JS = 'java' + SCRIPT + ':';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  html.appendChild(iframe);\n  // https://github.com/zloirock/core-js/issues/475\n  iframe.src = String(JS);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(scriptTag('document.F=Object'));\n  iframeDocument.close();\n  return iframeDocument.F;\n};\n\n// Check for document.domain and active x support\n// No need to use active x approach when document.domain is not set\n// see https://github.com/es-shims/es5-shim/issues/150\n// variation of https://github.com/kitcambridge/es5-shim/commit/4f738ac066346\n// avoid IE GC bug\nvar activeXDocument;\nvar NullProtoObject = function () {\n  try {\n    /* global ActiveXObject */\n    activeXDocument = document.domain && new ActiveXObject('htmlfile');\n  } catch (error) { /* ignore */ }\n  NullProtoObject = activeXDocument ? NullProtoObjectViaActiveX(activeXDocument) : NullProtoObjectViaIFrame();\n  var length = enumBugKeys.length;\n  while (length--) delete NullProtoObject[PROTOTYPE][enumBugKeys[length]];\n  return NullProtoObject();\n};\n\nhiddenKeys[IE_PROTO] = true;\n\n// `Object.create` method\n// https://tc39.github.io/ecma262/#sec-object.create\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    EmptyConstructor[PROTOTYPE] = anObject(O);\n    result = new EmptyConstructor();\n    EmptyConstructor[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = NullProtoObject();\n  return Properties === undefined ? result : defineProperties(result, Properties);\n};\n","var defineProperty = require('../internals/object-define-property').f;\nvar has = require('../internals/has');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\n\nmodule.exports = function (it, TAG, STATIC) {\n  if (it && !has(it = STATIC ? it : it.prototype, TO_STRING_TAG)) {\n    defineProperty(it, TO_STRING_TAG, { configurable: true, value: TAG });\n  }\n};\n","var isObject = require('../internals/is-object');\n\n// `ToPrimitive` abstract operation\n// https://tc39.github.io/ecma262/#sec-toprimitive\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (input, PREFERRED_STRING) {\n  if (!isObject(input)) return input;\n  var fn, val;\n  if (PREFERRED_STRING && typeof (fn = input.toString) == 'function' && !isObject(val = fn.call(input))) return val;\n  if (typeof (fn = input.valueOf) == 'function' && !isObject(val = fn.call(input))) return val;\n  if (!PREFERRED_STRING && typeof (fn = input.toString) == 'function' && !isObject(val = fn.call(input))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","module.exports = false;\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar has = require('../internals/has');\n\nvar defineProperty = Object.defineProperty;\nvar cache = {};\n\nvar thrower = function (it) { throw it; };\n\nmodule.exports = function (METHOD_NAME, options) {\n  if (has(cache, METHOD_NAME)) return cache[METHOD_NAME];\n  if (!options) options = {};\n  var method = [][METHOD_NAME];\n  var ACCESSORS = has(options, 'ACCESSORS') ? options.ACCESSORS : false;\n  var argument0 = has(options, 0) ? options[0] : thrower;\n  var argument1 = has(options, 1) ? options[1] : undefined;\n\n  return cache[METHOD_NAME] = !!method && !fails(function () {\n    if (ACCESSORS && !DESCRIPTORS) return true;\n    var O = { length: -1 };\n\n    if (ACCESSORS) defineProperty(O, 1, { enumerable: true, get: thrower });\n    else O[1] = 1;\n\n    method.call(O, argument0, argument1);\n  });\n};\n","var fails = require('../internals/fails');\nvar classof = require('../internals/classof-raw');\n\nvar split = ''.split;\n\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nmodule.exports = fails(function () {\n  // throws an error in rhino, see https://github.com/mozilla/rhino/issues/346\n  // eslint-disable-next-line no-prototype-builtins\n  return !Object('z').propertyIsEnumerable(0);\n}) ? function (it) {\n  return classof(it) == 'String' ? split.call(it, '') : Object(it);\n} : Object;\n","var global = require('../internals/global');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nmodule.exports = function (key, value) {\n  try {\n    createNonEnumerableProperty(global, key, value);\n  } catch (error) {\n    global[key] = value;\n  } return value;\n};\n","var global = require('../internals/global');\nvar setGlobal = require('../internals/set-global');\n\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || setGlobal(SHARED, {});\n\nmodule.exports = store;\n","var shared = require('../internals/shared');\nvar uid = require('../internals/uid');\n\nvar keys = shared('keys');\n\nmodule.exports = function (key) {\n  return keys[key] || (keys[key] = uid(key));\n};\n","var id = 0;\nvar postfix = Math.random();\n\nmodule.exports = function (key) {\n  return 'Symbol(' + String(key === undefined ? '' : key) + ')_' + (++id + postfix).toString(36);\n};\n","// IE8- don't enum bug keys\nmodule.exports = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf'\n];\n","// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n  /* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\nmodule.exports = {\n  SEMVER_SPEC_VERSION,\n  MAX_LENGTH,\n  MAX_SAFE_INTEGER,\n  MAX_SAFE_COMPONENT_LENGTH\n}\n","'use strict';\nvar $ = require('../internals/export');\nvar createIteratorConstructor = require('../internals/create-iterator-constructor');\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_PURE = require('../internals/is-pure');\nvar Iterators = require('../internals/iterators');\nvar IteratorsCore = require('../internals/iterators-core');\n\nvar IteratorPrototype = IteratorsCore.IteratorPrototype;\nvar BUGGY_SAFARI_ITERATORS = IteratorsCore.BUGGY_SAFARI_ITERATORS;\nvar ITERATOR = wellKnownSymbol('iterator');\nvar KEYS = 'keys';\nvar VALUES = 'values';\nvar ENTRIES = 'entries';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Iterable, NAME, IteratorConstructor, next, DEFAULT, IS_SET, FORCED) {\n  createIteratorConstructor(IteratorConstructor, NAME, next);\n\n  var getIterationMethod = function (KIND) {\n    if (KIND === DEFAULT && defaultIterator) return defaultIterator;\n    if (!BUGGY_SAFARI_ITERATORS && KIND in IterablePrototype) return IterablePrototype[KIND];\n    switch (KIND) {\n      case KEYS: return function keys() { return new IteratorConstructor(this, KIND); };\n      case VALUES: return function values() { return new IteratorConstructor(this, KIND); };\n      case ENTRIES: return function entries() { return new IteratorConstructor(this, KIND); };\n    } return function () { return new IteratorConstructor(this); };\n  };\n\n  var TO_STRING_TAG = NAME + ' Iterator';\n  var INCORRECT_VALUES_NAME = false;\n  var IterablePrototype = Iterable.prototype;\n  var nativeIterator = IterablePrototype[ITERATOR]\n    || IterablePrototype['@@iterator']\n    || DEFAULT && IterablePrototype[DEFAULT];\n  var defaultIterator = !BUGGY_SAFARI_ITERATORS && nativeIterator || getIterationMethod(DEFAULT);\n  var anyNativeIterator = NAME == 'Array' ? IterablePrototype.entries || nativeIterator : nativeIterator;\n  var CurrentIteratorPrototype, methods, KEY;\n\n  // fix native\n  if (anyNativeIterator) {\n    CurrentIteratorPrototype = getPrototypeOf(anyNativeIterator.call(new Iterable()));\n    if (IteratorPrototype !== Object.prototype && CurrentIteratorPrototype.next) {\n      if (!IS_PURE && getPrototypeOf(CurrentIteratorPrototype) !== IteratorPrototype) {\n        if (setPrototypeOf) {\n          setPrototypeOf(CurrentIteratorPrototype, IteratorPrototype);\n        } else if (typeof CurrentIteratorPrototype[ITERATOR] != 'function') {\n          createNonEnumerableProperty(CurrentIteratorPrototype, ITERATOR, returnThis);\n        }\n      }\n      // Set @@toStringTag to native iterators\n      setToStringTag(CurrentIteratorPrototype, TO_STRING_TAG, true, true);\n      if (IS_PURE) Iterators[TO_STRING_TAG] = returnThis;\n    }\n  }\n\n  // fix Array#{values, @@iterator}.name in V8 / FF\n  if (DEFAULT == VALUES && nativeIterator && nativeIterator.name !== VALUES) {\n    INCORRECT_VALUES_NAME = true;\n    defaultIterator = function values() { return nativeIterator.call(this); };\n  }\n\n  // define iterator\n  if ((!IS_PURE || FORCED) && IterablePrototype[ITERATOR] !== defaultIterator) {\n    createNonEnumerableProperty(IterablePrototype, ITERATOR, defaultIterator);\n  }\n  Iterators[NAME] = defaultIterator;\n\n  // export additional methods\n  if (DEFAULT) {\n    methods = {\n      values: getIterationMethod(VALUES),\n      keys: IS_SET ? defaultIterator : getIterationMethod(KEYS),\n      entries: getIterationMethod(ENTRIES)\n    };\n    if (FORCED) for (KEY in methods) {\n      if (BUGGY_SAFARI_ITERATORS || INCORRECT_VALUES_NAME || !(KEY in IterablePrototype)) {\n        redefine(IterablePrototype, KEY, methods[KEY]);\n      }\n    } else $({ target: NAME, proto: true, forced: BUGGY_SAFARI_ITERATORS || INCORRECT_VALUES_NAME }, methods);\n  }\n\n  return methods;\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar test = {};\n\ntest[TO_STRING_TAG] = 'z';\n\nmodule.exports = String(test) === '[object z]';\n","'use strict';\nvar regexpFlags = require('./regexp-flags');\nvar stickyHelpers = require('./regexp-sticky-helpers');\n\nvar nativeExec = RegExp.prototype.exec;\n// This always refers to the native implementation, because the\n// String#replace polyfill uses ./fix-regexp-well-known-symbol-logic.js,\n// which loads this file before patching the method.\nvar nativeReplace = String.prototype.replace;\n\nvar patchedExec = nativeExec;\n\nvar UPDATES_LAST_INDEX_WRONG = (function () {\n  var re1 = /a/;\n  var re2 = /b*/g;\n  nativeExec.call(re1, 'a');\n  nativeExec.call(re2, 'a');\n  return re1.lastIndex !== 0 || re2.lastIndex !== 0;\n})();\n\nvar UNSUPPORTED_Y = stickyHelpers.UNSUPPORTED_Y || stickyHelpers.BROKEN_CARET;\n\n// nonparticipating capturing group, copied from es5-shim's String#split patch.\nvar NPCG_INCLUDED = /()??/.exec('')[1] !== undefined;\n\nvar PATCH = UPDATES_LAST_INDEX_WRONG || NPCG_INCLUDED || UNSUPPORTED_Y;\n\nif (PATCH) {\n  patchedExec = function exec(str) {\n    var re = this;\n    var lastIndex, reCopy, match, i;\n    var sticky = UNSUPPORTED_Y && re.sticky;\n    var flags = regexpFlags.call(re);\n    var source = re.source;\n    var charsAdded = 0;\n    var strCopy = str;\n\n    if (sticky) {\n      flags = flags.replace('y', '');\n      if (flags.indexOf('g') === -1) {\n        flags += 'g';\n      }\n\n      strCopy = String(str).slice(re.lastIndex);\n      // Support anchored sticky behavior.\n      if (re.lastIndex > 0 && (!re.multiline || re.multiline && str[re.lastIndex - 1] !== '\\n')) {\n        source = '(?: ' + source + ')';\n        strCopy = ' ' + strCopy;\n        charsAdded++;\n      }\n      // ^(? + rx + ) is needed, in combination with some str slicing, to\n      // simulate the 'y' flag.\n      reCopy = new RegExp('^(?:' + source + ')', flags);\n    }\n\n    if (NPCG_INCLUDED) {\n      reCopy = new RegExp('^' + source + '$(?!\\\\s)', flags);\n    }\n    if (UPDATES_LAST_INDEX_WRONG) lastIndex = re.lastIndex;\n\n    match = nativeExec.call(sticky ? reCopy : re, strCopy);\n\n    if (sticky) {\n      if (match) {\n        match.input = match.input.slice(charsAdded);\n        match[0] = match[0].slice(charsAdded);\n        match.index = re.lastIndex;\n        re.lastIndex += match[0].length;\n      } else re.lastIndex = 0;\n    } else if (UPDATES_LAST_INDEX_WRONG && match) {\n      re.lastIndex = re.global ? match.index + match[0].length : lastIndex;\n    }\n    if (NPCG_INCLUDED && match && match.length > 1) {\n      // Fix browsers whose `exec` methods don't consistently return `undefined`\n      // for NPCG, like IE8. NOTE: This doesn' work for /(.?)?/\n      nativeReplace.call(match[0], reCopy, function () {\n        for (i = 1; i < arguments.length - 2; i++) {\n          if (arguments[i] === undefined) match[i] = undefined;\n        }\n      });\n    }\n\n    return match;\n  };\n}\n\nmodule.exports = patchedExec;\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","var TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar redefine = require('../internals/redefine');\nvar toString = require('../internals/object-to-string');\n\n// `Object.prototype.toString` method\n// https://tc39.github.io/ecma262/#sec-object.prototype.tostring\nif (!TO_STRING_TAG_SUPPORT) {\n  redefine(Object.prototype, 'toString', toString, { unsafe: true });\n}\n","'use strict';\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar addToUnscopables = require('../internals/add-to-unscopables');\nvar Iterators = require('../internals/iterators');\nvar InternalStateModule = require('../internals/internal-state');\nvar defineIterator = require('../internals/define-iterator');\n\nvar ARRAY_ITERATOR = 'Array Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(ARRAY_ITERATOR);\n\n// `Array.prototype.entries` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.entries\n// `Array.prototype.keys` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.keys\n// `Array.prototype.values` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.values\n// `Array.prototype[@@iterator]` method\n// https://tc39.github.io/ecma262/#sec-array.prototype-@@iterator\n// `CreateArrayIterator` internal method\n// https://tc39.github.io/ecma262/#sec-createarrayiterator\nmodule.exports = defineIterator(Array, 'Array', function (iterated, kind) {\n  setInternalState(this, {\n    type: ARRAY_ITERATOR,\n    target: toIndexedObject(iterated), // target\n    index: 0,                          // next index\n    kind: kind                         // kind\n  });\n// `%ArrayIteratorPrototype%.next` method\n// https://tc39.github.io/ecma262/#sec-%arrayiteratorprototype%.next\n}, function () {\n  var state = getInternalState(this);\n  var target = state.target;\n  var kind = state.kind;\n  var index = state.index++;\n  if (!target || index >= target.length) {\n    state.target = undefined;\n    return { value: undefined, done: true };\n  }\n  if (kind == 'keys') return { value: index, done: false };\n  if (kind == 'values') return { value: target[index], done: false };\n  return { value: [index, target[index]], done: false };\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values%\n// https://tc39.github.io/ecma262/#sec-createunmappedargumentsobject\n// https://tc39.github.io/ecma262/#sec-createmappedargumentsobject\nIterators.Arguments = Iterators.Array;\n\n// https://tc39.github.io/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n","'use strict';\nvar $ = require('../internals/export');\nvar exec = require('../internals/regexp-exec');\n\n$({ target: 'RegExp', proto: true, forced: /./.exec !== exec }, {\n  exec: exec\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPrimitive = require('../internals/to-primitive');\nvar has = require('../internals/has');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\n\nvar nativeGetOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.github.io/ecma262/#sec-object.getownpropertydescriptor\nexports.f = DESCRIPTORS ? nativeGetOwnPropertyDescriptor : function getOwnPropertyDescriptor(O, P) {\n  O = toIndexedObject(O);\n  P = toPrimitive(P, true);\n  if (IE8_DOM_DEFINE) try {\n    return nativeGetOwnPropertyDescriptor(O, P);\n  } catch (error) { /* empty */ }\n  if (has(O, P)) return createPropertyDescriptor(!propertyIsEnumerableModule.f.call(O, P), O[P]);\n};\n","var fails = require('../internals/fails');\n\nvar replacement = /#|\\.prototype\\./;\n\nvar isForced = function (feature, detection) {\n  var value = data[normalize(feature)];\n  return value == POLYFILL ? true\n    : value == NATIVE ? false\n    : typeof detection == 'function' ? fails(detection)\n    : !!detection;\n};\n\nvar normalize = isForced.normalize = function (string) {\n  return String(string).replace(replacement, '.').toLowerCase();\n};\n\nvar data = isForced.data = {};\nvar NATIVE = isForced.NATIVE = 'N';\nvar POLYFILL = isForced.POLYFILL = 'P';\n\nmodule.exports = isForced;\n","module.exports = function (it, Constructor, name) {\n  if (!(it instanceof Constructor)) {\n    throw TypeError('Incorrect ' + (name ? name + ' ' : '') + 'invocation');\n  } return it;\n};\n","var $ = require('../internals/export');\nvar assign = require('../internals/object-assign');\n\n// `Object.assign` method\n// https://tc39.github.io/ecma262/#sec-object.assign\n$({ target: 'Object', stat: true, forced: Object.assign !== assign }, {\n  assign: assign\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar isArray = require('../internals/is-array');\nvar isObject = require('../internals/is-object');\nvar toObject = require('../internals/to-object');\nvar toLength = require('../internals/to-length');\nvar createProperty = require('../internals/create-property');\nvar arraySpeciesCreate = require('../internals/array-species-create');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar IS_CONCAT_SPREADABLE = wellKnownSymbol('isConcatSpreadable');\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;\nvar MAXIMUM_ALLOWED_INDEX_EXCEEDED = 'Maximum allowed index exceeded';\n\n// We can't use this feature detection in V8 since it causes\n// deoptimization and serious performance degradation\n// https://github.com/zloirock/core-js/issues/679\nvar IS_CONCAT_SPREADABLE_SUPPORT = V8_VERSION >= 51 || !fails(function () {\n  var array = [];\n  array[IS_CONCAT_SPREADABLE] = false;\n  return array.concat()[0] !== array;\n});\n\nvar SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('concat');\n\nvar isConcatSpreadable = function (O) {\n  if (!isObject(O)) return false;\n  var spreadable = O[IS_CONCAT_SPREADABLE];\n  return spreadable !== undefined ? !!spreadable : isArray(O);\n};\n\nvar FORCED = !IS_CONCAT_SPREADABLE_SUPPORT || !SPECIES_SUPPORT;\n\n// `Array.prototype.concat` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.concat\n// with adding support of @@isConcatSpreadable and @@species\n$({ target: 'Array', proto: true, forced: FORCED }, {\n  concat: function concat(arg) { // eslint-disable-line no-unused-vars\n    var O = toObject(this);\n    var A = arraySpeciesCreate(O, 0);\n    var n = 0;\n    var i, k, length, len, E;\n    for (i = -1, length = arguments.length; i < length; i++) {\n      E = i === -1 ? O : arguments[i];\n      if (isConcatSpreadable(E)) {\n        len = toLength(E.length);\n        if (n + len > MAX_SAFE_INTEGER) throw TypeError(MAXIMUM_ALLOWED_INDEX_EXCEEDED);\n        for (k = 0; k < len; k++, n++) if (k in E) createProperty(A, n, E[k]);\n      } else {\n        if (n >= MAX_SAFE_INTEGER) throw TypeError(MAXIMUM_ALLOWED_INDEX_EXCEEDED);\n        createProperty(A, n++, E);\n      }\n    }\n    A.length = n;\n    return A;\n  }\n});\n","var fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (METHOD_NAME) {\n  // We can't use this feature detection in V8 since it causes\n  // deoptimization and serious performance degradation\n  // https://github.com/zloirock/core-js/issues/677\n  return V8_VERSION >= 51 || !fails(function () {\n    var array = [];\n    var constructor = array.constructor = {};\n    constructor[SPECIES] = function () {\n      return { foo: 1 };\n    };\n    return array[METHOD_NAME](Boolean).foo !== 1;\n  });\n};\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar document = global.document;\n// typeof document.createElement is 'object' in old IE\nvar EXISTS = isObject(document) && isObject(document.createElement);\n\nmodule.exports = function (it) {\n  return EXISTS ? document.createElement(it) : {};\n};\n","var store = require('../internals/shared-store');\n\nvar functionToString = Function.toString;\n\n// this helper broken in `3.4.1-3.4.4`, so we can't use `shared` helper\nif (typeof store.inspectSource != 'function') {\n  store.inspectSource = function (it) {\n    return functionToString.call(it);\n  };\n}\n\nmodule.exports = store.inspectSource;\n","var bind = require('../internals/function-bind-context');\nvar IndexedObject = require('../internals/indexed-object');\nvar toObject = require('../internals/to-object');\nvar toLength = require('../internals/to-length');\nvar arraySpeciesCreate = require('../internals/array-species-create');\n\nvar push = [].push;\n\n// `Array.prototype.{ forEach, map, filter, some, every, find, findIndex }` methods implementation\nvar createMethod = function (TYPE) {\n  var IS_MAP = TYPE == 1;\n  var IS_FILTER = TYPE == 2;\n  var IS_SOME = TYPE == 3;\n  var IS_EVERY = TYPE == 4;\n  var IS_FIND_INDEX = TYPE == 6;\n  var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\n  return function ($this, callbackfn, that, specificCreate) {\n    var O = toObject($this);\n    var self = IndexedObject(O);\n    var boundFunction = bind(callbackfn, that, 3);\n    var length = toLength(self.length);\n    var index = 0;\n    var create = specificCreate || arraySpeciesCreate;\n    var target = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined;\n    var value, result;\n    for (;length > index; index++) if (NO_HOLES || index in self) {\n      value = self[index];\n      result = boundFunction(value, index, O);\n      if (TYPE) {\n        if (IS_MAP) target[index] = result; // map\n        else if (result) switch (TYPE) {\n          case 3: return true;              // some\n          case 5: return value;             // find\n          case 6: return index;             // findIndex\n          case 2: push.call(target, value); // filter\n        } else if (IS_EVERY) return false;  // every\n      }\n    }\n    return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : target;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.forEach` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.foreach\n  forEach: createMethod(0),\n  // `Array.prototype.map` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.map\n  map: createMethod(1),\n  // `Array.prototype.filter` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.filter\n  filter: createMethod(2),\n  // `Array.prototype.some` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.some\n  some: createMethod(3),\n  // `Array.prototype.every` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.every\n  every: createMethod(4),\n  // `Array.prototype.find` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.find\n  find: createMethod(5),\n  // `Array.prototype.findIndex` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.findIndex\n  findIndex: createMethod(6)\n};\n","var isObject = require('../internals/is-object');\nvar isArray = require('../internals/is-array');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar SPECIES = wellKnownSymbol('species');\n\n// `ArraySpeciesCreate` abstract operation\n// https://tc39.github.io/ecma262/#sec-arrayspeciescreate\nmodule.exports = function (originalArray, length) {\n  var C;\n  if (isArray(originalArray)) {\n    C = originalArray.constructor;\n    // cross-realm fallback\n    if (typeof C == 'function' && (C === Array || isArray(C.prototype))) C = undefined;\n    else if (isObject(C)) {\n      C = C[SPECIES];\n      if (C === null) C = undefined;\n    }\n  } return new (C === undefined ? Array : C)(length === 0 ? 0 : length);\n};\n","'use strict';\nvar fails = require('../internals/fails');\n\nmodule.exports = function (METHOD_NAME, argument) {\n  var method = [][METHOD_NAME];\n  return !!method && fails(function () {\n    // eslint-disable-next-line no-useless-call,no-throw-literal\n    method.call(null, argument || function () { throw 1; }, 1);\n  });\n};\n","var global = require('../internals/global');\nvar userAgent = require('../internals/engine-user-agent');\n\nvar process = global.process;\nvar versions = process && process.versions;\nvar v8 = versions && versions.v8;\nvar match, version;\n\nif (v8) {\n  match = v8.split('.');\n  version = match[0] + match[1];\n} else if (userAgent) {\n  match = userAgent.match(/Edge\\/(\\d+)/);\n  if (!match || match[1] >= 74) {\n    match = userAgent.match(/Chrome\\/(\\d+)/);\n    if (match) version = match[1];\n  }\n}\n\nmodule.exports = version && +version;\n","var anObject = require('../internals/an-object');\nvar isArrayIteratorMethod = require('../internals/is-array-iterator-method');\nvar toLength = require('../internals/to-length');\nvar bind = require('../internals/function-bind-context');\nvar getIteratorMethod = require('../internals/get-iterator-method');\nvar iteratorClose = require('../internals/iterator-close');\n\nvar Result = function (stopped, result) {\n  this.stopped = stopped;\n  this.result = result;\n};\n\nmodule.exports = function (iterable, unboundFunction, options) {\n  var that = options && options.that;\n  var AS_ENTRIES = !!(options && options.AS_ENTRIES);\n  var IS_ITERATOR = !!(options && options.IS_ITERATOR);\n  var INTERRUPTED = !!(options && options.INTERRUPTED);\n  var fn = bind(unboundFunction, that, 1 + AS_ENTRIES + INTERRUPTED);\n  var iterator, iterFn, index, length, result, next, step;\n\n  var stop = function (condition) {\n    if (iterator) iteratorClose(iterator);\n    return new Result(true, condition);\n  };\n\n  var callFn = function (value) {\n    if (AS_ENTRIES) {\n      anObject(value);\n      return INTERRUPTED ? fn(value[0], value[1], stop) : fn(value[0], value[1]);\n    } return INTERRUPTED ? fn(value, stop) : fn(value);\n  };\n\n  if (IS_ITERATOR) {\n    iterator = iterable;\n  } else {\n    iterFn = getIteratorMethod(iterable);\n    if (typeof iterFn != 'function') throw TypeError('Target is not iterable');\n    // optimisation for array iterators\n    if (isArrayIteratorMethod(iterFn)) {\n      for (index = 0, length = toLength(iterable.length); length > index; index++) {\n        result = callFn(iterable[index]);\n        if (result && result instanceof Result) return result;\n      } return new Result(false);\n    }\n    iterator = iterFn.call(iterable);\n  }\n\n  next = iterator.next;\n  while (!(step = next.call(iterator)).done) {\n    try {\n      result = callFn(step.value);\n    } catch (error) {\n      iteratorClose(iterator);\n      throw error;\n    }\n    if (typeof result == 'object' && result && result instanceof Result) return result;\n  } return new Result(false);\n};\n","var TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar classofRaw = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\n// ES3 wrong here\nvar CORRECT_ARGUMENTS = classofRaw(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (error) { /* empty */ }\n};\n\n// getting tag from ES6+ `Object.prototype.toString`\nmodule.exports = TO_STRING_TAG_SUPPORT ? classofRaw : function (it) {\n  var O, tag, result;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (tag = tryGet(O = Object(it), TO_STRING_TAG)) == 'string' ? tag\n    // builtinTag case\n    : CORRECT_ARGUMENTS ? classofRaw(O)\n    // ES3 arguments fallback\n    : (result = classofRaw(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : result;\n};\n","var toInteger = require('../internals/to-integer');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\n// `String.prototype.{ codePointAt, at }` methods implementation\nvar createMethod = function (CONVERT_TO_STRING) {\n  return function ($this, pos) {\n    var S = String(requireObjectCoercible($this));\n    var position = toInteger(pos);\n    var size = S.length;\n    var first, second;\n    if (position < 0 || position >= size) return CONVERT_TO_STRING ? '' : undefined;\n    first = S.charCodeAt(position);\n    return first < 0xD800 || first > 0xDBFF || position + 1 === size\n      || (second = S.charCodeAt(position + 1)) < 0xDC00 || second > 0xDFFF\n        ? CONVERT_TO_STRING ? S.charAt(position) : first\n        : CONVERT_TO_STRING ? S.slice(position, position + 2) : (first - 0xD800 << 10) + (second - 0xDC00) + 0x10000;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.codePointAt` method\n  // https://tc39.github.io/ecma262/#sec-string.prototype.codepointat\n  codeAt: createMethod(false),\n  // `String.prototype.at` method\n  // https://github.com/mathiasbynens/String.prototype.at\n  charAt: createMethod(true)\n};\n","'use strict';\nvar nativePropertyIsEnumerable = {}.propertyIsEnumerable;\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Nashorn ~ JDK8 bug\nvar NASHORN_BUG = getOwnPropertyDescriptor && !nativePropertyIsEnumerable.call({ 1: 2 }, 1);\n\n// `Object.prototype.propertyIsEnumerable` method implementation\n// https://tc39.github.io/ecma262/#sec-object.prototype.propertyisenumerable\nexports.f = NASHORN_BUG ? function propertyIsEnumerable(V) {\n  var descriptor = getOwnPropertyDescriptor(this, V);\n  return !!descriptor && descriptor.enumerable;\n} : nativePropertyIsEnumerable;\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar createElement = require('../internals/document-create-element');\n\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !DESCRIPTORS && !fails(function () {\n  return Object.defineProperty(createElement('div'), 'a', {\n    get: function () { return 7; }\n  }).a != 7;\n});\n","var IS_PURE = require('../internals/is-pure');\nvar store = require('../internals/shared-store');\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: '3.7.0',\n  mode: IS_PURE ? 'pure' : 'global',\n  copyright: '© 2020 Denis Pushkarev (zloirock.ru)'\n});\n","var has = require('../internals/has');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar indexOf = require('../internals/array-includes').indexOf;\nvar hiddenKeys = require('../internals/hidden-keys');\n\nmodule.exports = function (object, names) {\n  var O = toIndexedObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) !has(hiddenKeys, key) && has(O, key) && result.push(key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (has(O, key = names[i++])) {\n    ~indexOf(result, key) || result.push(key);\n  }\n  return result;\n};\n","var toIndexedObject = require('../internals/to-indexed-object');\nvar toLength = require('../internals/to-length');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\n\n// `Array.prototype.{ indexOf, includes }` methods implementation\nvar createMethod = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIndexedObject($this);\n    var length = toLength(O.length);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) {\n      if ((IS_INCLUDES || index in O) && O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.includes` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.includes\n  includes: createMethod(true),\n  // `Array.prototype.indexOf` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.indexof\n  indexOf: createMethod(false)\n};\n","exports.f = Object.getOwnPropertySymbols;\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\n// `Object.keys` method\n// https://tc39.github.io/ecma262/#sec-object.keys\nmodule.exports = Object.keys || function keys(O) {\n  return internalObjectKeys(O, enumBugKeys);\n};\n","'use strict';\n\nmodule.exports = function bind(fn, thisArg) {\n  return function wrap() {\n    var args = new Array(arguments.length);\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i];\n    }\n    return fn.apply(thisArg, args);\n  };\n};\n","'use strict';\n\nvar utils = require('./../utils');\n\nfunction encode(val) {\n  return encodeURIComponent(val).\n    replace(/%3A/gi, ':').\n    replace(/%24/g, '$').\n    replace(/%2C/gi, ',').\n    replace(/%20/g, '+').\n    replace(/%5B/gi, '[').\n    replace(/%5D/gi, ']');\n}\n\n/**\n * Build a URL by appending params to the end\n *\n * @param {string} url The base of the url (e.g., http://www.google.com)\n * @param {object} [params] The params to be appended\n * @returns {string} The formatted url\n */\nmodule.exports = function buildURL(url, params, paramsSerializer) {\n  /*eslint no-param-reassign:0*/\n  if (!params) {\n    return url;\n  }\n\n  var serializedParams;\n  if (paramsSerializer) {\n    serializedParams = paramsSerializer(params);\n  } else if (utils.isURLSearchParams(params)) {\n    serializedParams = params.toString();\n  } else {\n    var parts = [];\n\n    utils.forEach(params, function serialize(val, key) {\n      if (val === null || typeof val === 'undefined') {\n        return;\n      }\n\n      if (utils.isArray(val)) {\n        key = key + '[]';\n      } else {\n        val = [val];\n      }\n\n      utils.forEach(val, function parseValue(v) {\n        if (utils.isDate(v)) {\n          v = v.toISOString();\n        } else if (utils.isObject(v)) {\n          v = JSON.stringify(v);\n        }\n        parts.push(encode(key) + '=' + encode(v));\n      });\n    });\n\n    serializedParams = parts.join('&');\n  }\n\n  if (serializedParams) {\n    var hashmarkIndex = url.indexOf('#');\n    if (hashmarkIndex !== -1) {\n      url = url.slice(0, hashmarkIndex);\n    }\n\n    url += (url.indexOf('?') === -1 ? '?' : '&') + serializedParams;\n  }\n\n  return url;\n};\n","'use strict';\n\nmodule.exports = function isCancel(value) {\n  return !!(value && value.__CANCEL__);\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar normalizeHeaderName = require('./helpers/normalizeHeaderName');\n\nvar DEFAULT_CONTENT_TYPE = {\n  'Content-Type': 'application/x-www-form-urlencoded'\n};\n\nfunction setContentTypeIfUnset(headers, value) {\n  if (!utils.isUndefined(headers) && utils.isUndefined(headers['Content-Type'])) {\n    headers['Content-Type'] = value;\n  }\n}\n\nfunction getDefaultAdapter() {\n  var adapter;\n  if (typeof XMLHttpRequest !== 'undefined') {\n    // For browsers use XHR adapter\n    adapter = require('./adapters/xhr');\n  } else if (typeof process !== 'undefined' && Object.prototype.toString.call(process) === '[object process]') {\n    // For node use HTTP adapter\n    adapter = require('./adapters/http');\n  }\n  return adapter;\n}\n\nvar defaults = {\n  adapter: getDefaultAdapter(),\n\n  transformRequest: [function transformRequest(data, headers) {\n    normalizeHeaderName(headers, 'Accept');\n    normalizeHeaderName(headers, 'Content-Type');\n    if (utils.isFormData(data) ||\n      utils.isArrayBuffer(data) ||\n      utils.isBuffer(data) ||\n      utils.isStream(data) ||\n      utils.isFile(data) ||\n      utils.isBlob(data)\n    ) {\n      return data;\n    }\n    if (utils.isArrayBufferView(data)) {\n      return data.buffer;\n    }\n    if (utils.isURLSearchParams(data)) {\n      setContentTypeIfUnset(headers, 'application/x-www-form-urlencoded;charset=utf-8');\n      return data.toString();\n    }\n    if (utils.isObject(data)) {\n      setContentTypeIfUnset(headers, 'application/json;charset=utf-8');\n      return JSON.stringify(data);\n    }\n    return data;\n  }],\n\n  transformResponse: [function transformResponse(data) {\n    /*eslint no-param-reassign:0*/\n    if (typeof data === 'string') {\n      try {\n        data = JSON.parse(data);\n      } catch (e) { /* Ignore */ }\n    }\n    return data;\n  }],\n\n  /**\n   * A timeout in milliseconds to abort a request. If set to 0 (default) a\n   * timeout is not created.\n   */\n  timeout: 0,\n\n  xsrfCookieName: 'XSRF-TOKEN',\n  xsrfHeaderName: 'X-XSRF-TOKEN',\n\n  maxContentLength: -1,\n  maxBodyLength: -1,\n\n  validateStatus: function validateStatus(status) {\n    return status >= 200 && status < 300;\n  }\n};\n\ndefaults.headers = {\n  common: {\n    'Accept': 'application/json, text/plain, */*'\n  }\n};\n\nutils.forEach(['delete', 'get', 'head'], function forEachMethodNoData(method) {\n  defaults.headers[method] = {};\n});\n\nutils.forEach(['post', 'put', 'patch'], function forEachMethodWithData(method) {\n  defaults.headers[method] = utils.merge(DEFAULT_CONTENT_TYPE);\n});\n\nmodule.exports = defaults;\n","'use strict';\n\nvar utils = require('./../utils');\nvar settle = require('./../core/settle');\nvar cookies = require('./../helpers/cookies');\nvar buildURL = require('./../helpers/buildURL');\nvar buildFullPath = require('../core/buildFullPath');\nvar parseHeaders = require('./../helpers/parseHeaders');\nvar isURLSameOrigin = require('./../helpers/isURLSameOrigin');\nvar createError = require('../core/createError');\n\nmodule.exports = function xhrAdapter(config) {\n  return new Promise(function dispatchXhrRequest(resolve, reject) {\n    var requestData = config.data;\n    var requestHeaders = config.headers;\n\n    if (utils.isFormData(requestData)) {\n      delete requestHeaders['Content-Type']; // Let the browser set it\n    }\n\n    var request = new XMLHttpRequest();\n\n    // HTTP basic authentication\n    if (config.auth) {\n      var username = config.auth.username || '';\n      var password = config.auth.password ? unescape(encodeURIComponent(config.auth.password)) : '';\n      requestHeaders.Authorization = 'Basic ' + btoa(username + ':' + password);\n    }\n\n    var fullPath = buildFullPath(config.baseURL, config.url);\n    request.open(config.method.toUpperCase(), buildURL(fullPath, config.params, config.paramsSerializer), true);\n\n    // Set the request timeout in MS\n    request.timeout = config.timeout;\n\n    // Listen for ready state\n    request.onreadystatechange = function handleLoad() {\n      if (!request || request.readyState !== 4) {\n        return;\n      }\n\n      // The request errored out and we didn't get a response, this will be\n      // handled by onerror instead\n      // With one exception: request that using file: protocol, most browsers\n      // will return status as 0 even though it's a successful request\n      if (request.status === 0 && !(request.responseURL && request.responseURL.indexOf('file:') === 0)) {\n        return;\n      }\n\n      // Prepare the response\n      var responseHeaders = 'getAllResponseHeaders' in request ? parseHeaders(request.getAllResponseHeaders()) : null;\n      var responseData = !config.responseType || config.responseType === 'text' ? request.responseText : request.response;\n      var response = {\n        data: responseData,\n        status: request.status,\n        statusText: request.statusText,\n        headers: responseHeaders,\n        config: config,\n        request: request\n      };\n\n      settle(resolve, reject, response);\n\n      // Clean up request\n      request = null;\n    };\n\n    // Handle browser request cancellation (as opposed to a manual cancellation)\n    request.onabort = function handleAbort() {\n      if (!request) {\n        return;\n      }\n\n      reject(createError('Request aborted', config, 'ECONNABORTED', request));\n\n      // Clean up request\n      request = null;\n    };\n\n    // Handle low level network errors\n    request.onerror = function handleError() {\n      // Real errors are hidden from us by the browser\n      // onerror should only fire if it's a network error\n      reject(createError('Network Error', config, null, request));\n\n      // Clean up request\n      request = null;\n    };\n\n    // Handle timeout\n    request.ontimeout = function handleTimeout() {\n      var timeoutErrorMessage = 'timeout of ' + config.timeout + 'ms exceeded';\n      if (config.timeoutErrorMessage) {\n        timeoutErrorMessage = config.timeoutErrorMessage;\n      }\n      reject(createError(timeoutErrorMessage, config, 'ECONNABORTED',\n        request));\n\n      // Clean up request\n      request = null;\n    };\n\n    // Add xsrf header\n    // This is only done if running in a standard browser environment.\n    // Specifically not if we're in a web worker, or react-native.\n    if (utils.isStandardBrowserEnv()) {\n      // Add xsrf header\n      var xsrfValue = (config.withCredentials || isURLSameOrigin(fullPath)) && config.xsrfCookieName ?\n        cookies.read(config.xsrfCookieName) :\n        undefined;\n\n      if (xsrfValue) {\n        requestHeaders[config.xsrfHeaderName] = xsrfValue;\n      }\n    }\n\n    // Add headers to the request\n    if ('setRequestHeader' in request) {\n      utils.forEach(requestHeaders, function setRequestHeader(val, key) {\n        if (typeof requestData === 'undefined' && key.toLowerCase() === 'content-type') {\n          // Remove Content-Type if data is undefined\n          delete requestHeaders[key];\n        } else {\n          // Otherwise add header to the request\n          request.setRequestHeader(key, val);\n        }\n      });\n    }\n\n    // Add withCredentials to request if needed\n    if (!utils.isUndefined(config.withCredentials)) {\n      request.withCredentials = !!config.withCredentials;\n    }\n\n    // Add responseType to request if needed\n    if (config.responseType) {\n      try {\n        request.responseType = config.responseType;\n      } catch (e) {\n        // Expected DOMException thrown by browsers not compatible XMLHttpRequest Level 2.\n        // But, this can be suppressed for 'json' type as it can be parsed by default 'transformResponse' function.\n        if (config.responseType !== 'json') {\n          throw e;\n        }\n      }\n    }\n\n    // Handle progress if needed\n    if (typeof config.onDownloadProgress === 'function') {\n      request.addEventListener('progress', config.onDownloadProgress);\n    }\n\n    // Not all browsers support upload events\n    if (typeof config.onUploadProgress === 'function' && request.upload) {\n      request.upload.addEventListener('progress', config.onUploadProgress);\n    }\n\n    if (config.cancelToken) {\n      // Handle cancellation\n      config.cancelToken.promise.then(function onCanceled(cancel) {\n        if (!request) {\n          return;\n        }\n\n        request.abort();\n        reject(cancel);\n        // Clean up request\n        request = null;\n      });\n    }\n\n    if (!requestData) {\n      requestData = null;\n    }\n\n    // Send the request\n    request.send(requestData);\n  });\n};\n","'use strict';\n\nvar enhanceError = require('./enhanceError');\n\n/**\n * Create an Error with the specified message, config, error code, request and response.\n *\n * @param {string} message The error message.\n * @param {Object} config The config.\n * @param {string} [code] The error code (for example, 'ECONNABORTED').\n * @param {Object} [request] The request.\n * @param {Object} [response] The response.\n * @returns {Error} The created error.\n */\nmodule.exports = function createError(message, config, code, request, response) {\n  var error = new Error(message);\n  return enhanceError(error, config, code, request, response);\n};\n","'use strict';\n\nvar utils = require('../utils');\n\n/**\n * Config-specific merge-function which creates a new config-object\n * by merging two configuration objects together.\n *\n * @param {Object} config1\n * @param {Object} config2\n * @returns {Object} New object resulting from merging config2 to config1\n */\nmodule.exports = function mergeConfig(config1, config2) {\n  // eslint-disable-next-line no-param-reassign\n  config2 = config2 || {};\n  var config = {};\n\n  var valueFromConfig2Keys = ['url', 'method', 'data'];\n  var mergeDeepPropertiesKeys = ['headers', 'auth', 'proxy', 'params'];\n  var defaultToConfig2Keys = [\n    'baseURL', 'transformRequest', 'transformResponse', 'paramsSerializer',\n    'timeout', 'timeoutMessage', 'withCredentials', 'adapter', 'responseType', 'xsrfCookieName',\n    'xsrfHeaderName', 'onUploadProgress', 'onDownloadProgress', 'decompress',\n    'maxContentLength', 'maxBodyLength', 'maxRedirects', 'transport', 'httpAgent',\n    'httpsAgent', 'cancelToken', 'socketPath', 'responseEncoding'\n  ];\n  var directMergeKeys = ['validateStatus'];\n\n  function getMergedValue(target, source) {\n    if (utils.isPlainObject(target) && utils.isPlainObject(source)) {\n      return utils.merge(target, source);\n    } else if (utils.isPlainObject(source)) {\n      return utils.merge({}, source);\n    } else if (utils.isArray(source)) {\n      return source.slice();\n    }\n    return source;\n  }\n\n  function mergeDeepProperties(prop) {\n    if (!utils.isUndefined(config2[prop])) {\n      config[prop] = getMergedValue(config1[prop], config2[prop]);\n    } else if (!utils.isUndefined(config1[prop])) {\n      config[prop] = getMergedValue(undefined, config1[prop]);\n    }\n  }\n\n  utils.forEach(valueFromConfig2Keys, function valueFromConfig2(prop) {\n    if (!utils.isUndefined(config2[prop])) {\n      config[prop] = getMergedValue(undefined, config2[prop]);\n    }\n  });\n\n  utils.forEach(mergeDeepPropertiesKeys, mergeDeepProperties);\n\n  utils.forEach(defaultToConfig2Keys, function defaultToConfig2(prop) {\n    if (!utils.isUndefined(config2[prop])) {\n      config[prop] = getMergedValue(undefined, config2[prop]);\n    } else if (!utils.isUndefined(config1[prop])) {\n      config[prop] = getMergedValue(undefined, config1[prop]);\n    }\n  });\n\n  utils.forEach(directMergeKeys, function merge(prop) {\n    if (prop in config2) {\n      config[prop] = getMergedValue(config1[prop], config2[prop]);\n    } else if (prop in config1) {\n      config[prop] = getMergedValue(undefined, config1[prop]);\n    }\n  });\n\n  var axiosKeys = valueFromConfig2Keys\n    .concat(mergeDeepPropertiesKeys)\n    .concat(defaultToConfig2Keys)\n    .concat(directMergeKeys);\n\n  var otherKeys = Object\n    .keys(config1)\n    .concat(Object.keys(config2))\n    .filter(function filterAxiosKeys(key) {\n      return axiosKeys.indexOf(key) === -1;\n    });\n\n  utils.forEach(otherKeys, mergeDeepProperties);\n\n  return config;\n};\n","'use strict';\n\n/**\n * A `Cancel` is an object that is thrown when an operation is canceled.\n *\n * @class\n * @param {string=} message The message.\n */\nfunction Cancel(message) {\n  this.message = message;\n}\n\nCancel.prototype.toString = function toString() {\n  return 'Cancel' + (this.message ? ': ' + this.message : '');\n};\n\nCancel.prototype.__CANCEL__ = true;\n\nmodule.exports = Cancel;\n","'use strict';\nvar $ = require('../internals/export');\nvar forEach = require('../internals/array-for-each');\n\n// `Array.prototype.forEach` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.foreach\n$({ target: 'Array', proto: true, forced: [].forEach != forEach }, {\n  forEach: forEach\n});\n","'use strict';\nvar $forEach = require('../internals/array-iteration').forEach;\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\nvar arrayMethodUsesToLength = require('../internals/array-method-uses-to-length');\n\nvar STRICT_METHOD = arrayMethodIsStrict('forEach');\nvar USES_TO_LENGTH = arrayMethodUsesToLength('forEach');\n\n// `Array.prototype.forEach` method implementation\n// https://tc39.github.io/ecma262/#sec-array.prototype.foreach\nmodule.exports = (!STRICT_METHOD || !USES_TO_LENGTH) ? function forEach(callbackfn /* , thisArg */) {\n  return $forEach(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n} : [].forEach;\n","var classof = require('../internals/classof-raw');\n\n// `IsArray` abstract operation\n// https://tc39.github.io/ecma262/#sec-isarray\nmodule.exports = Array.isArray || function isArray(arg) {\n  return classof(arg) == 'Array';\n};\n","var fails = require('../internals/fails');\n\nmodule.exports = !!Object.getOwnPropertySymbols && !fails(function () {\n  // Chrome 38 Symbol has incorrect toString conversion\n  // eslint-disable-next-line no-undef\n  return !String(Symbol());\n});\n","const { MAX_SAFE_COMPONENT_LENGTH } = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst src = exports.src = []\nconst t = exports.t = {}\nlet R = 0\n\nconst createToken = (name, value, isGlobal) => {\n  const index = R++\n  debug(index, value)\n  t[name] = index\n  src[index] = value\n  re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '[0-9]+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', '\\\\d*[a-zA-Z-][a-zA-Z0-9-]*')\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', '[0-9A-Za-z-]+')\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups.  The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:${src[t.PRERELEASE]})?${\n                     src[t.BUILD]}?` +\n                   `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:${src[t.PRERELEASELOOSE]})?${\n                          src[t.BUILD]}?` +\n                        `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCE', `${'(^|[^\\\\d])' +\n              '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n              `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s+-\\\\s+` +\n                   `(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s+-\\\\s+` +\n                        `(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\.0\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\.0\\.0-0\\\\s*$')\n","const debug = (\n  typeof process === 'object' &&\n  process.env &&\n  process.env.NODE_DEBUG &&\n  /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n  : () => {}\n\nmodule.exports = debug\n","const debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { re, t } = require('../internal/re')\n\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    if (!options || typeof options !== 'object') {\n      options = {\n        loose: !!options,\n        includePrerelease: false\n      }\n    }\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n          version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      compareIdentifiers(this.patch, other.patch)\n    )\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier) {\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier)\n        this.inc('pre', identifier)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier)\n        }\n        this.inc('pre', identifier)\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre':\n        if (this.prerelease.length === 0) {\n          this.prerelease = [0]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            this.prerelease.push(0)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          if (this.prerelease[0] === identifier) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = [identifier, 0]\n            }\n          } else {\n            this.prerelease = [identifier, 0]\n          }\n        }\n        break\n\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.format()\n    this.raw = this.version\n    return this\n  }\n}\n\nmodule.exports = SemVer\n","'use strict';\nvar getPrototypeOf = require('../internals/object-get-prototype-of');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar has = require('../internals/has');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar IS_PURE = require('../internals/is-pure');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar BUGGY_SAFARI_ITERATORS = false;\n\nvar returnThis = function () { return this; };\n\n// `%IteratorPrototype%` object\n// https://tc39.github.io/ecma262/#sec-%iteratorprototype%-object\nvar IteratorPrototype, PrototypeOfArrayIteratorPrototype, arrayIterator;\n\nif ([].keys) {\n  arrayIterator = [].keys();\n  // Safari 8 has buggy iterators w/o `next`\n  if (!('next' in arrayIterator)) BUGGY_SAFARI_ITERATORS = true;\n  else {\n    PrototypeOfArrayIteratorPrototype = getPrototypeOf(getPrototypeOf(arrayIterator));\n    if (PrototypeOfArrayIteratorPrototype !== Object.prototype) IteratorPrototype = PrototypeOfArrayIteratorPrototype;\n  }\n}\n\nif (IteratorPrototype == undefined) IteratorPrototype = {};\n\n// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\nif (!IS_PURE && !has(IteratorPrototype, ITERATOR)) {\n  createNonEnumerableProperty(IteratorPrototype, ITERATOR, returnThis);\n}\n\nmodule.exports = {\n  IteratorPrototype: IteratorPrototype,\n  BUGGY_SAFARI_ITERATORS: BUGGY_SAFARI_ITERATORS\n};\n","var has = require('../internals/has');\nvar toObject = require('../internals/to-object');\nvar sharedKey = require('../internals/shared-key');\nvar CORRECT_PROTOTYPE_GETTER = require('../internals/correct-prototype-getter');\n\nvar IE_PROTO = sharedKey('IE_PROTO');\nvar ObjectPrototype = Object.prototype;\n\n// `Object.getPrototypeOf` method\n// https://tc39.github.io/ecma262/#sec-object.getprototypeof\nmodule.exports = CORRECT_PROTOTYPE_GETTER ? Object.getPrototypeOf : function (O) {\n  O = toObject(O);\n  if (has(O, IE_PROTO)) return O[IE_PROTO];\n  if (typeof O.constructor == 'function' && O instanceof O.constructor) {\n    return O.constructor.prototype;\n  } return O instanceof Object ? ObjectPrototype : null;\n};\n","var anObject = require('../internals/an-object');\nvar aPossiblePrototype = require('../internals/a-possible-prototype');\n\n// `Object.setPrototypeOf` method\n// https://tc39.github.io/ecma262/#sec-object.setprototypeof\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n/* eslint-disable no-proto */\nmodule.exports = Object.setPrototypeOf || ('__proto__' in {} ? function () {\n  var CORRECT_SETTER = false;\n  var test = {};\n  var setter;\n  try {\n    setter = Object.getOwnPropertyDescriptor(Object.prototype, '__proto__').set;\n    setter.call(test, []);\n    CORRECT_SETTER = test instanceof Array;\n  } catch (error) { /* empty */ }\n  return function setPrototypeOf(O, proto) {\n    anObject(O);\n    aPossiblePrototype(proto);\n    if (CORRECT_SETTER) setter.call(O, proto);\n    else O.__proto__ = proto;\n    return O;\n  };\n}() : undefined);\n","var hiddenKeys = require('../internals/hidden-keys');\nvar isObject = require('../internals/is-object');\nvar has = require('../internals/has');\nvar defineProperty = require('../internals/object-define-property').f;\nvar uid = require('../internals/uid');\nvar FREEZING = require('../internals/freezing');\n\nvar METADATA = uid('meta');\nvar id = 0;\n\nvar isExtensible = Object.isExtensible || function () {\n  return true;\n};\n\nvar setMetadata = function (it) {\n  defineProperty(it, METADATA, { value: {\n    objectID: 'O' + ++id, // object ID\n    weakData: {}          // weak collections IDs\n  } });\n};\n\nvar fastKey = function (it, create) {\n  // return a primitive with prefix\n  if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n  if (!has(it, METADATA)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return 'F';\n    // not necessary to add metadata\n    if (!create) return 'E';\n    // add missing metadata\n    setMetadata(it);\n  // return object ID\n  } return it[METADATA].objectID;\n};\n\nvar getWeakData = function (it, create) {\n  if (!has(it, METADATA)) {\n    // can't set metadata to uncaught frozen object\n    if (!isExtensible(it)) return true;\n    // not necessary to add metadata\n    if (!create) return false;\n    // add missing metadata\n    setMetadata(it);\n  // return the store of weak collections IDs\n  } return it[METADATA].weakData;\n};\n\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n  if (FREEZING && meta.REQUIRED && isExtensible(it) && !has(it, METADATA)) setMetadata(it);\n  return it;\n};\n\nvar meta = module.exports = {\n  REQUIRED: false,\n  fastKey: fastKey,\n  getWeakData: getWeakData,\n  onFreeze: onFreeze\n};\n\nhiddenKeys[METADATA] = true;\n","// iterable DOM collections\n// flag - `iterable` interface - 'entries', 'keys', 'values', 'forEach' methods\nmodule.exports = {\n  CSSRuleList: 0,\n  CSSStyleDeclaration: 0,\n  CSSValueList: 0,\n  ClientRectList: 0,\n  DOMRectList: 0,\n  DOMStringList: 0,\n  DOMTokenList: 1,\n  DataTransferItemList: 0,\n  FileList: 0,\n  HTMLAllCollection: 0,\n  HTMLCollection: 0,\n  HTMLFormElement: 0,\n  HTMLSelectElement: 0,\n  MediaList: 0,\n  MimeTypeArray: 0,\n  NamedNodeMap: 0,\n  NodeList: 1,\n  PaintRequestList: 0,\n  Plugin: 0,\n  PluginArray: 0,\n  SVGLengthList: 0,\n  SVGNumberList: 0,\n  SVGPathSegList: 0,\n  SVGPointList: 0,\n  SVGStringList: 0,\n  SVGTransformList: 0,\n  SourceBufferList: 0,\n  StyleSheetList: 0,\n  TextTrackCueList: 0,\n  TextTrackList: 0,\n  TouchList: 0\n};\n","'use strict';\nvar anObject = require('../internals/an-object');\n\n// `RegExp.prototype.flags` getter implementation\n// https://tc39.github.io/ecma262/#sec-get-regexp.prototype.flags\nmodule.exports = function () {\n  var that = anObject(this);\n  var result = '';\n  if (that.global) result += 'g';\n  if (that.ignoreCase) result += 'i';\n  if (that.multiline) result += 'm';\n  if (that.dotAll) result += 's';\n  if (that.unicode) result += 'u';\n  if (that.sticky) result += 'y';\n  return result;\n};\n","\"use strict\";\n\n/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n*/\n// css base code, injected by the css-loader\n// eslint-disable-next-line func-names\nmodule.exports = function (useSourceMap) {\n  var list = []; // return the list of modules as css string\n\n  list.toString = function toString() {\n    return this.map(function (item) {\n      var content = cssWithMappingToString(item, useSourceMap);\n\n      if (item[2]) {\n        return \"@media \".concat(item[2], \" {\").concat(content, \"}\");\n      }\n\n      return content;\n    }).join('');\n  }; // import a list of modules into the list\n  // eslint-disable-next-line func-names\n\n\n  list.i = function (modules, mediaQuery, dedupe) {\n    if (typeof modules === 'string') {\n      // eslint-disable-next-line no-param-reassign\n      modules = [[null, modules, '']];\n    }\n\n    var alreadyImportedModules = {};\n\n    if (dedupe) {\n      for (var i = 0; i < this.length; i++) {\n        // eslint-disable-next-line prefer-destructuring\n        var id = this[i][0];\n\n        if (id != null) {\n          alreadyImportedModules[id] = true;\n        }\n      }\n    }\n\n    for (var _i = 0; _i < modules.length; _i++) {\n      var item = [].concat(modules[_i]);\n\n      if (dedupe && alreadyImportedModules[item[0]]) {\n        // eslint-disable-next-line no-continue\n        continue;\n      }\n\n      if (mediaQuery) {\n        if (!item[2]) {\n          item[2] = mediaQuery;\n        } else {\n          item[2] = \"\".concat(mediaQuery, \" and \").concat(item[2]);\n        }\n      }\n\n      list.push(item);\n    }\n  };\n\n  return list;\n};\n\nfunction cssWithMappingToString(item, useSourceMap) {\n  var content = item[1] || ''; // eslint-disable-next-line prefer-destructuring\n\n  var cssMapping = item[3];\n\n  if (!cssMapping) {\n    return content;\n  }\n\n  if (useSourceMap && typeof btoa === 'function') {\n    var sourceMapping = toComment(cssMapping);\n    var sourceURLs = cssMapping.sources.map(function (source) {\n      return \"/*# sourceURL=\".concat(cssMapping.sourceRoot || '').concat(source, \" */\");\n    });\n    return [content].concat(sourceURLs).concat([sourceMapping]).join('\\n');\n  }\n\n  return [content].join('\\n');\n} // Adapted from convert-source-map (MIT)\n\n\nfunction toComment(sourceMap) {\n  // eslint-disable-next-line no-undef\n  var base64 = btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap))));\n  var data = \"sourceMappingURL=data:application/json;charset=utf-8;base64,\".concat(base64);\n  return \"/*# \".concat(data, \" */\");\n}","/**\n * Translates the list format produced by css-loader into something\n * easier to manipulate.\n */\nexport default function listToStyles (parentId, list) {\n  var styles = []\n  var newStyles = {}\n  for (var i = 0; i < list.length; i++) {\n    var item = list[i]\n    var id = item[0]\n    var css = item[1]\n    var media = item[2]\n    var sourceMap = item[3]\n    var part = {\n      id: parentId + ':' + i,\n      css: css,\n      media: media,\n      sourceMap: sourceMap\n    }\n    if (!newStyles[id]) {\n      styles.push(newStyles[id] = { id: id, parts: [part] })\n    } else {\n      newStyles[id].parts.push(part)\n    }\n  }\n  return styles\n}\n","/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n  Modified by Evan You @yyx990803\n*/\n\nimport listToStyles from './listToStyles'\n\nvar hasDocument = typeof document !== 'undefined'\n\nif (typeof DEBUG !== 'undefined' && DEBUG) {\n  if (!hasDocument) {\n    throw new Error(\n    'vue-style-loader cannot be used in a non-browser environment. ' +\n    \"Use { target: 'node' } in your Webpack config to indicate a server-rendering environment.\"\n  ) }\n}\n\n/*\ntype StyleObject = {\n  id: number;\n  parts: Array<StyleObjectPart>\n}\n\ntype StyleObjectPart = {\n  css: string;\n  media: string;\n  sourceMap: ?string\n}\n*/\n\nvar stylesInDom = {/*\n  [id: number]: {\n    id: number,\n    refs: number,\n    parts: Array<(obj?: StyleObjectPart) => void>\n  }\n*/}\n\nvar head = hasDocument && (document.head || document.getElementsByTagName('head')[0])\nvar singletonElement = null\nvar singletonCounter = 0\nvar isProduction = false\nvar noop = function () {}\nvar options = null\nvar ssrIdKey = 'data-vue-ssr-id'\n\n// Force single-tag solution on IE6-9, which has a hard limit on the # of <style>\n// tags it will allow on a page\nvar isOldIE = typeof navigator !== 'undefined' && /msie [6-9]\\b/.test(navigator.userAgent.toLowerCase())\n\nexport default function addStylesClient (parentId, list, _isProduction, _options) {\n  isProduction = _isProduction\n\n  options = _options || {}\n\n  var styles = listToStyles(parentId, list)\n  addStylesToDom(styles)\n\n  return function update (newList) {\n    var mayRemove = []\n    for (var i = 0; i < styles.length; i++) {\n      var item = styles[i]\n      var domStyle = stylesInDom[item.id]\n      domStyle.refs--\n      mayRemove.push(domStyle)\n    }\n    if (newList) {\n      styles = listToStyles(parentId, newList)\n      addStylesToDom(styles)\n    } else {\n      styles = []\n    }\n    for (var i = 0; i < mayRemove.length; i++) {\n      var domStyle = mayRemove[i]\n      if (domStyle.refs === 0) {\n        for (var j = 0; j < domStyle.parts.length; j++) {\n          domStyle.parts[j]()\n        }\n        delete stylesInDom[domStyle.id]\n      }\n    }\n  }\n}\n\nfunction addStylesToDom (styles /* Array<StyleObject> */) {\n  for (var i = 0; i < styles.length; i++) {\n    var item = styles[i]\n    var domStyle = stylesInDom[item.id]\n    if (domStyle) {\n      domStyle.refs++\n      for (var j = 0; j < domStyle.parts.length; j++) {\n        domStyle.parts[j](item.parts[j])\n      }\n      for (; j < item.parts.length; j++) {\n        domStyle.parts.push(addStyle(item.parts[j]))\n      }\n      if (domStyle.parts.length > item.parts.length) {\n        domStyle.parts.length = item.parts.length\n      }\n    } else {\n      var parts = []\n      for (var j = 0; j < item.parts.length; j++) {\n        parts.push(addStyle(item.parts[j]))\n      }\n      stylesInDom[item.id] = { id: item.id, refs: 1, parts: parts }\n    }\n  }\n}\n\nfunction createStyleElement () {\n  var styleElement = document.createElement('style')\n  styleElement.type = 'text/css'\n  head.appendChild(styleElement)\n  return styleElement\n}\n\nfunction addStyle (obj /* StyleObjectPart */) {\n  var update, remove\n  var styleElement = document.querySelector('style[' + ssrIdKey + '~=\"' + obj.id + '\"]')\n\n  if (styleElement) {\n    if (isProduction) {\n      // has SSR styles and in production mode.\n      // simply do nothing.\n      return noop\n    } else {\n      // has SSR styles but in dev mode.\n      // for some reason Chrome can't handle source map in server-rendered\n      // style tags - source maps in <style> only works if the style tag is\n      // created and inserted dynamically. So we remove the server rendered\n      // styles and inject new ones.\n      styleElement.parentNode.removeChild(styleElement)\n    }\n  }\n\n  if (isOldIE) {\n    // use singleton mode for IE9.\n    var styleIndex = singletonCounter++\n    styleElement = singletonElement || (singletonElement = createStyleElement())\n    update = applyToSingletonTag.bind(null, styleElement, styleIndex, false)\n    remove = applyToSingletonTag.bind(null, styleElement, styleIndex, true)\n  } else {\n    // use multi-style-tag mode in all other cases\n    styleElement = createStyleElement()\n    update = applyToTag.bind(null, styleElement)\n    remove = function () {\n      styleElement.parentNode.removeChild(styleElement)\n    }\n  }\n\n  update(obj)\n\n  return function updateStyle (newObj /* StyleObjectPart */) {\n    if (newObj) {\n      if (newObj.css === obj.css &&\n          newObj.media === obj.media &&\n          newObj.sourceMap === obj.sourceMap) {\n        return\n      }\n      update(obj = newObj)\n    } else {\n      remove()\n    }\n  }\n}\n\nvar replaceText = (function () {\n  var textStore = []\n\n  return function (index, replacement) {\n    textStore[index] = replacement\n    return textStore.filter(Boolean).join('\\n')\n  }\n})()\n\nfunction applyToSingletonTag (styleElement, index, remove, obj) {\n  var css = remove ? '' : obj.css\n\n  if (styleElement.styleSheet) {\n    styleElement.styleSheet.cssText = replaceText(index, css)\n  } else {\n    var cssNode = document.createTextNode(css)\n    var childNodes = styleElement.childNodes\n    if (childNodes[index]) styleElement.removeChild(childNodes[index])\n    if (childNodes.length) {\n      styleElement.insertBefore(cssNode, childNodes[index])\n    } else {\n      styleElement.appendChild(cssNode)\n    }\n  }\n}\n\nfunction applyToTag (styleElement, obj) {\n  var css = obj.css\n  var media = obj.media\n  var sourceMap = obj.sourceMap\n\n  if (media) {\n    styleElement.setAttribute('media', media)\n  }\n  if (options.ssrId) {\n    styleElement.setAttribute(ssrIdKey, obj.id)\n  }\n\n  if (sourceMap) {\n    // https://developer.chrome.com/devtools/docs/javascript-debugging\n    // this makes source maps inside style tags work properly in Chrome\n    css += '\\n/*# sourceURL=' + sourceMap.sources[0] + ' */'\n    // http://stackoverflow.com/a/26603875\n    css += '\\n/*# sourceMappingURL=data:application/json;base64,' + btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap)))) + ' */'\n  }\n\n  if (styleElement.styleSheet) {\n    styleElement.styleSheet.cssText = css\n  } else {\n    while (styleElement.firstChild) {\n      styleElement.removeChild(styleElement.firstChild)\n    }\n    styleElement.appendChild(document.createTextNode(css))\n  }\n}\n","'use strict';\nvar charAt = require('../internals/string-multibyte').charAt;\nvar InternalStateModule = require('../internals/internal-state');\nvar defineIterator = require('../internals/define-iterator');\n\nvar STRING_ITERATOR = 'String Iterator';\nvar setInternalState = InternalStateModule.set;\nvar getInternalState = InternalStateModule.getterFor(STRING_ITERATOR);\n\n// `String.prototype[@@iterator]` method\n// https://tc39.github.io/ecma262/#sec-string.prototype-@@iterator\ndefineIterator(String, 'String', function (iterated) {\n  setInternalState(this, {\n    type: STRING_ITERATOR,\n    string: String(iterated),\n    index: 0\n  });\n// `%StringIteratorPrototype%.next` method\n// https://tc39.github.io/ecma262/#sec-%stringiteratorprototype%.next\n}, function next() {\n  var state = getInternalState(this);\n  var string = state.string;\n  var index = state.index;\n  var point;\n  if (index >= string.length) return { value: undefined, done: true };\n  point = charAt(string, index);\n  state.index += point.length;\n  return { value: point, done: false };\n});\n","'use strict';\nvar redefine = require('../internals/redefine');\nvar anObject = require('../internals/an-object');\nvar fails = require('../internals/fails');\nvar flags = require('../internals/regexp-flags');\n\nvar TO_STRING = 'toString';\nvar RegExpPrototype = RegExp.prototype;\nvar nativeToString = RegExpPrototype[TO_STRING];\n\nvar NOT_GENERIC = fails(function () { return nativeToString.call({ source: 'a', flags: 'b' }) != '/a/b'; });\n// FF44- RegExp#toString has a wrong name\nvar INCORRECT_NAME = nativeToString.name != TO_STRING;\n\n// `RegExp.prototype.toString` method\n// https://tc39.github.io/ecma262/#sec-regexp.prototype.tostring\nif (NOT_GENERIC || INCORRECT_NAME) {\n  redefine(RegExp.prototype, TO_STRING, function toString() {\n    var R = anObject(this);\n    var p = String(R.source);\n    var rf = R.flags;\n    var f = String(rf === undefined && R instanceof RegExp && !('flags' in RegExpPrototype) ? flags.call(R) : rf);\n    return '/' + p + '/' + f;\n  }, { unsafe: true });\n}\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar ArrayIteratorMethods = require('../modules/es.array.iterator');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar ArrayValues = ArrayIteratorMethods.values;\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  var Collection = global[COLLECTION_NAME];\n  var CollectionPrototype = Collection && Collection.prototype;\n  if (CollectionPrototype) {\n    // some Chrome versions have non-configurable methods on DOMTokenList\n    if (CollectionPrototype[ITERATOR] !== ArrayValues) try {\n      createNonEnumerableProperty(CollectionPrototype, ITERATOR, ArrayValues);\n    } catch (error) {\n      CollectionPrototype[ITERATOR] = ArrayValues;\n    }\n    if (!CollectionPrototype[TO_STRING_TAG]) {\n      createNonEnumerableProperty(CollectionPrototype, TO_STRING_TAG, COLLECTION_NAME);\n    }\n    if (DOMIterables[COLLECTION_NAME]) for (var METHOD_NAME in ArrayIteratorMethods) {\n      // some Chrome versions have non-configurable methods on DOMTokenList\n      if (CollectionPrototype[METHOD_NAME] !== ArrayIteratorMethods[METHOD_NAME]) try {\n        createNonEnumerableProperty(CollectionPrototype, METHOD_NAME, ArrayIteratorMethods[METHOD_NAME]);\n      } catch (error) {\n        CollectionPrototype[METHOD_NAME] = ArrayIteratorMethods[METHOD_NAME];\n      }\n    }\n  }\n}\n","'use strict';\nvar $ = require('../internals/export');\nvar $indexOf = require('../internals/array-includes').indexOf;\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\nvar arrayMethodUsesToLength = require('../internals/array-method-uses-to-length');\n\nvar nativeIndexOf = [].indexOf;\n\nvar NEGATIVE_ZERO = !!nativeIndexOf && 1 / [1].indexOf(1, -0) < 0;\nvar STRICT_METHOD = arrayMethodIsStrict('indexOf');\nvar USES_TO_LENGTH = arrayMethodUsesToLength('indexOf', { ACCESSORS: true, 1: 0 });\n\n// `Array.prototype.indexOf` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.indexof\n$({ target: 'Array', proto: true, forced: NEGATIVE_ZERO || !STRICT_METHOD || !USES_TO_LENGTH }, {\n  indexOf: function indexOf(searchElement /* , fromIndex = 0 */) {\n    return NEGATIVE_ZERO\n      // convert -0 to +0\n      ? nativeIndexOf.apply(this, arguments) || 0\n      : $indexOf(this, searchElement, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","'use strict';\nvar fixRegExpWellKnownSymbolLogic = require('../internals/fix-regexp-well-known-symbol-logic');\nvar anObject = require('../internals/an-object');\nvar toObject = require('../internals/to-object');\nvar toLength = require('../internals/to-length');\nvar toInteger = require('../internals/to-integer');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar advanceStringIndex = require('../internals/advance-string-index');\nvar regExpExec = require('../internals/regexp-exec-abstract');\n\nvar max = Math.max;\nvar min = Math.min;\nvar floor = Math.floor;\nvar SUBSTITUTION_SYMBOLS = /\\$([$&'`]|\\d\\d?|<[^>]*>)/g;\nvar SUBSTITUTION_SYMBOLS_NO_NAMED = /\\$([$&'`]|\\d\\d?)/g;\n\nvar maybeToString = function (it) {\n  return it === undefined ? it : String(it);\n};\n\n// @@replace logic\nfixRegExpWellKnownSymbolLogic('replace', 2, function (REPLACE, nativeReplace, maybeCallNative, reason) {\n  var REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE = reason.REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE;\n  var REPLACE_KEEPS_$0 = reason.REPLACE_KEEPS_$0;\n  var UNSAFE_SUBSTITUTE = REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE ? '$' : '$0';\n\n  return [\n    // `String.prototype.replace` method\n    // https://tc39.github.io/ecma262/#sec-string.prototype.replace\n    function replace(searchValue, replaceValue) {\n      var O = requireObjectCoercible(this);\n      var replacer = searchValue == undefined ? undefined : searchValue[REPLACE];\n      return replacer !== undefined\n        ? replacer.call(searchValue, O, replaceValue)\n        : nativeReplace.call(String(O), searchValue, replaceValue);\n    },\n    // `RegExp.prototype[@@replace]` method\n    // https://tc39.github.io/ecma262/#sec-regexp.prototype-@@replace\n    function (regexp, replaceValue) {\n      if (\n        (!REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE && REPLACE_KEEPS_$0) ||\n        (typeof replaceValue === 'string' && replaceValue.indexOf(UNSAFE_SUBSTITUTE) === -1)\n      ) {\n        var res = maybeCallNative(nativeReplace, regexp, this, replaceValue);\n        if (res.done) return res.value;\n      }\n\n      var rx = anObject(regexp);\n      var S = String(this);\n\n      var functionalReplace = typeof replaceValue === 'function';\n      if (!functionalReplace) replaceValue = String(replaceValue);\n\n      var global = rx.global;\n      if (global) {\n        var fullUnicode = rx.unicode;\n        rx.lastIndex = 0;\n      }\n      var results = [];\n      while (true) {\n        var result = regExpExec(rx, S);\n        if (result === null) break;\n\n        results.push(result);\n        if (!global) break;\n\n        var matchStr = String(result[0]);\n        if (matchStr === '') rx.lastIndex = advanceStringIndex(S, toLength(rx.lastIndex), fullUnicode);\n      }\n\n      var accumulatedResult = '';\n      var nextSourcePosition = 0;\n      for (var i = 0; i < results.length; i++) {\n        result = results[i];\n\n        var matched = String(result[0]);\n        var position = max(min(toInteger(result.index), S.length), 0);\n        var captures = [];\n        // NOTE: This is equivalent to\n        //   captures = result.slice(1).map(maybeToString)\n        // but for some reason `nativeSlice.call(result, 1, result.length)` (called in\n        // the slice polyfill when slicing native arrays) \"doesn't work\" in safari 9 and\n        // causes a crash (https://pastebin.com/N21QzeQA) when trying to debug it.\n        for (var j = 1; j < result.length; j++) captures.push(maybeToString(result[j]));\n        var namedCaptures = result.groups;\n        if (functionalReplace) {\n          var replacerArgs = [matched].concat(captures, position, S);\n          if (namedCaptures !== undefined) replacerArgs.push(namedCaptures);\n          var replacement = String(replaceValue.apply(undefined, replacerArgs));\n        } else {\n          replacement = getSubstitution(matched, S, position, captures, namedCaptures, replaceValue);\n        }\n        if (position >= nextSourcePosition) {\n          accumulatedResult += S.slice(nextSourcePosition, position) + replacement;\n          nextSourcePosition = position + matched.length;\n        }\n      }\n      return accumulatedResult + S.slice(nextSourcePosition);\n    }\n  ];\n\n  // https://tc39.github.io/ecma262/#sec-getsubstitution\n  function getSubstitution(matched, str, position, captures, namedCaptures, replacement) {\n    var tailPos = position + matched.length;\n    var m = captures.length;\n    var symbols = SUBSTITUTION_SYMBOLS_NO_NAMED;\n    if (namedCaptures !== undefined) {\n      namedCaptures = toObject(namedCaptures);\n      symbols = SUBSTITUTION_SYMBOLS;\n    }\n    return nativeReplace.call(replacement, symbols, function (match, ch) {\n      var capture;\n      switch (ch.charAt(0)) {\n        case '$': return '$';\n        case '&': return matched;\n        case '`': return str.slice(0, position);\n        case \"'\": return str.slice(tailPos);\n        case '<':\n          capture = namedCaptures[ch.slice(1, -1)];\n          break;\n        default: // \\d\\d?\n          var n = +ch;\n          if (n === 0) return match;\n          if (n > m) {\n            var f = floor(n / 10);\n            if (f === 0) return match;\n            if (f <= m) return captures[f - 1] === undefined ? ch.charAt(1) : captures[f - 1] + ch.charAt(1);\n            return match;\n          }\n          capture = captures[n - 1];\n      }\n      return capture === undefined ? '' : capture;\n    });\n  }\n});\n","module.exports = function (it) {\n  if (typeof it != 'function') {\n    throw TypeError(String(it) + ' is not a function');\n  } return it;\n};\n","var classof = require('../internals/classof');\nvar Iterators = require('../internals/iterators');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\n\nmodule.exports = function (it) {\n  if (it != undefined) return it[ITERATOR]\n    || it['@@iterator']\n    || Iterators[classof(it)];\n};\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\nvar hiddenKeys = enumBugKeys.concat('length', 'prototype');\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.github.io/ecma262/#sec-object.getownpropertynames\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return internalObjectKeys(O, hiddenKeys);\n};\n","'use strict';\nvar toPrimitive = require('../internals/to-primitive');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = function (object, key, value) {\n  var propertyKey = toPrimitive(key);\n  if (propertyKey in object) definePropertyModule.f(object, propertyKey, createPropertyDescriptor(0, value));\n  else object[propertyKey] = value;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar $filter = require('../internals/array-iteration').filter;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\nvar arrayMethodUsesToLength = require('../internals/array-method-uses-to-length');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('filter');\n// Edge 14- issue\nvar USES_TO_LENGTH = arrayMethodUsesToLength('filter');\n\n// `Array.prototype.filter` method\n// https://tc39.github.io/ecma262/#sec-array.prototype.filter\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT || !USES_TO_LENGTH }, {\n  filter: function filter(callbackfn /* , thisArg */) {\n    return $filter(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","var isObject = require('../internals/is-object');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\n\n// makes subclassing work correct for wrapped built-ins\nmodule.exports = function ($this, dummy, Wrapper) {\n  var NewTarget, NewTargetPrototype;\n  if (\n    // it can work only with native `setPrototypeOf`\n    setPrototypeOf &&\n    // we haven't completely correct pre-ES6 way for getting `new.target`, so use this\n    typeof (NewTarget = dummy.constructor) == 'function' &&\n    NewTarget !== Wrapper &&\n    isObject(NewTargetPrototype = NewTarget.prototype) &&\n    NewTargetPrototype !== Wrapper.prototype\n  ) setPrototypeOf($this, NewTargetPrototype);\n  return $this;\n};\n","var redefine = require('../internals/redefine');\n\nmodule.exports = function (target, src, options) {\n  for (var key in src) redefine(target, key, src[key], options);\n  return target;\n};\n","var toInteger = require('../internals/to-integer');\n\nvar max = Math.max;\nvar min = Math.min;\n\n// Helper for a popular repeating case of the spec:\n// Let integer be ? ToInteger(index).\n// If integer < 0, let result be max((length + integer), 0); else let result be min(integer, length).\nmodule.exports = function (index, length) {\n  var integer = toInteger(index);\n  return integer < 0 ? max(integer + length, 0) : min(integer, length);\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar objectKeys = require('../internals/object-keys');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar toObject = require('../internals/to-object');\nvar IndexedObject = require('../internals/indexed-object');\n\nvar nativeAssign = Object.assign;\nvar defineProperty = Object.defineProperty;\n\n// `Object.assign` method\n// https://tc39.github.io/ecma262/#sec-object.assign\nmodule.exports = !nativeAssign || fails(function () {\n  // should have correct order of operations (Edge bug)\n  if (DESCRIPTORS && nativeAssign({ b: 1 }, nativeAssign(defineProperty({}, 'a', {\n    enumerable: true,\n    get: function () {\n      defineProperty(this, 'b', {\n        value: 3,\n        enumerable: false\n      });\n    }\n  }), { b: 2 })).b !== 1) return true;\n  // should work with symbols and should have deterministic property order (V8 bug)\n  var A = {};\n  var B = {};\n  // eslint-disable-next-line no-undef\n  var symbol = Symbol();\n  var alphabet = 'abcdefghijklmnopqrst';\n  A[symbol] = 7;\n  alphabet.split('').forEach(function (chr) { B[chr] = chr; });\n  return nativeAssign({}, A)[symbol] != 7 || objectKeys(nativeAssign({}, B)).join('') != alphabet;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars\n  var T = toObject(target);\n  var argumentsLength = arguments.length;\n  var index = 1;\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  var propertyIsEnumerable = propertyIsEnumerableModule.f;\n  while (argumentsLength > index) {\n    var S = IndexedObject(arguments[index++]);\n    var keys = getOwnPropertySymbols ? objectKeys(S).concat(getOwnPropertySymbols(S)) : objectKeys(S);\n    var length = keys.length;\n    var j = 0;\n    var key;\n    while (length > j) {\n      key = keys[j++];\n      if (!DESCRIPTORS || propertyIsEnumerable.call(S, key)) T[key] = S[key];\n    }\n  } return T;\n} : nativeAssign;\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('navigator', 'userAgent') || '';\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar anObject = require('../internals/an-object');\nvar objectKeys = require('../internals/object-keys');\n\n// `Object.defineProperties` method\n// https://tc39.github.io/ecma262/#sec-object.defineproperties\nmodule.exports = DESCRIPTORS ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var keys = objectKeys(Properties);\n  var length = keys.length;\n  var index = 0;\n  var key;\n  while (length > index) definePropertyModule.f(O, key = keys[index++], Properties[key]);\n  return O;\n};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('document', 'documentElement');\n","'use strict';\nvar IteratorPrototype = require('../internals/iterators-core').IteratorPrototype;\nvar create = require('../internals/object-create');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar Iterators = require('../internals/iterators');\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (IteratorConstructor, NAME, next) {\n  var TO_STRING_TAG = NAME + ' Iterator';\n  IteratorConstructor.prototype = create(IteratorPrototype, { next: createPropertyDescriptor(1, next) });\n  setToStringTag(IteratorConstructor, TO_STRING_TAG, false, true);\n  Iterators[TO_STRING_TAG] = returnThis;\n  return IteratorConstructor;\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar Iterators = require('../internals/iterators');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar ArrayPrototype = Array.prototype;\n\n// check on default Array iterator\nmodule.exports = function (it) {\n  return it !== undefined && (Iterators.Array === it || ArrayPrototype[ITERATOR] === it);\n};\n","var anObject = require('../internals/an-object');\n\nmodule.exports = function (iterator) {\n  var returnMethod = iterator['return'];\n  if (returnMethod !== undefined) {\n    return anObject(returnMethod.call(iterator)).value;\n  }\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar ITERATOR = wellKnownSymbol('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n  var called = 0;\n  var iteratorWithReturn = {\n    next: function () {\n      return { done: !!called++ };\n    },\n    'return': function () {\n      SAFE_CLOSING = true;\n    }\n  };\n  iteratorWithReturn[ITERATOR] = function () {\n    return this;\n  };\n  // eslint-disable-next-line no-throw-literal\n  Array.from(iteratorWithReturn, function () { throw 2; });\n} catch (error) { /* empty */ }\n\nmodule.exports = function (exec, SKIP_CLOSING) {\n  if (!SKIP_CLOSING && !SAFE_CLOSING) return false;\n  var ITERATION_SUPPORT = false;\n  try {\n    var object = {};\n    object[ITERATOR] = function () {\n      return {\n        next: function () {\n          return { done: ITERATION_SUPPORT = true };\n        }\n      };\n    };\n    exec(object);\n  } catch (error) { /* empty */ }\n  return ITERATION_SUPPORT;\n};\n","'use strict';\nvar getBuiltIn = require('../internals/get-built-in');\nvar definePropertyModule = require('../internals/object-define-property');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar DESCRIPTORS = require('../internals/descriptors');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (CONSTRUCTOR_NAME) {\n  var Constructor = getBuiltIn(CONSTRUCTOR_NAME);\n  var defineProperty = definePropertyModule.f;\n\n  if (DESCRIPTORS && Constructor && !Constructor[SPECIES]) {\n    defineProperty(Constructor, SPECIES, {\n      configurable: true,\n      get: function () { return this; }\n    });\n  }\n};\n","'use strict';\n// TODO: Remove from `core-js@4` since it's moved to entry points\nrequire('../modules/es.regexp.exec');\nvar redefine = require('../internals/redefine');\nvar fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar regexpExec = require('../internals/regexp-exec');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nvar SPECIES = wellKnownSymbol('species');\n\nvar REPLACE_SUPPORTS_NAMED_GROUPS = !fails(function () {\n  // #replace needs built-in support for named groups.\n  // #match works fine because it just return the exec results, even if it has\n  // a \"grops\" property.\n  var re = /./;\n  re.exec = function () {\n    var result = [];\n    result.groups = { a: '7' };\n    return result;\n  };\n  return ''.replace(re, '$<a>') !== '7';\n});\n\n// IE <= 11 replaces $0 with the whole match, as if it was $&\n// https://stackoverflow.com/questions/6024666/getting-ie-to-replace-a-regex-with-the-literal-string-0\nvar REPLACE_KEEPS_$0 = (function () {\n  return 'a'.replace(/./, '$0') === '$0';\n})();\n\nvar REPLACE = wellKnownSymbol('replace');\n// Safari <= 13.0.3(?) substitutes nth capture where n>m with an empty string\nvar REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE = (function () {\n  if (/./[REPLACE]) {\n    return /./[REPLACE]('a', '$0') === '';\n  }\n  return false;\n})();\n\n// Chrome 51 has a buggy \"split\" implementation when RegExp#exec !== nativeExec\n// Weex JS has frozen built-in prototypes, so use try / catch wrapper\nvar SPLIT_WORKS_WITH_OVERWRITTEN_EXEC = !fails(function () {\n  var re = /(?:)/;\n  var originalExec = re.exec;\n  re.exec = function () { return originalExec.apply(this, arguments); };\n  var result = 'ab'.split(re);\n  return result.length !== 2 || result[0] !== 'a' || result[1] !== 'b';\n});\n\nmodule.exports = function (KEY, length, exec, sham) {\n  var SYMBOL = wellKnownSymbol(KEY);\n\n  var DELEGATES_TO_SYMBOL = !fails(function () {\n    // String methods call symbol-named RegEp methods\n    var O = {};\n    O[SYMBOL] = function () { return 7; };\n    return ''[KEY](O) != 7;\n  });\n\n  var DELEGATES_TO_EXEC = DELEGATES_TO_SYMBOL && !fails(function () {\n    // Symbol-named RegExp methods call .exec\n    var execCalled = false;\n    var re = /a/;\n\n    if (KEY === 'split') {\n      // We can't use real regex here since it causes deoptimization\n      // and serious performance degradation in V8\n      // https://github.com/zloirock/core-js/issues/306\n      re = {};\n      // RegExp[@@split] doesn't call the regex's exec method, but first creates\n      // a new one. We need to return the patched regex when creating the new one.\n      re.constructor = {};\n      re.constructor[SPECIES] = function () { return re; };\n      re.flags = '';\n      re[SYMBOL] = /./[SYMBOL];\n    }\n\n    re.exec = function () { execCalled = true; return null; };\n\n    re[SYMBOL]('');\n    return !execCalled;\n  });\n\n  if (\n    !DELEGATES_TO_SYMBOL ||\n    !DELEGATES_TO_EXEC ||\n    (KEY === 'replace' && !(\n      REPLACE_SUPPORTS_NAMED_GROUPS &&\n      REPLACE_KEEPS_$0 &&\n      !REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE\n    )) ||\n    (KEY === 'split' && !SPLIT_WORKS_WITH_OVERWRITTEN_EXEC)\n  ) {\n    var nativeRegExpMethod = /./[SYMBOL];\n    var methods = exec(SYMBOL, ''[KEY], function (nativeMethod, regexp, str, arg2, forceStringMethod) {\n      if (regexp.exec === regexpExec) {\n        if (DELEGATES_TO_SYMBOL && !forceStringMethod) {\n          // The native String method already delegates to @@method (this\n          // polyfilled function), leasing to infinite recursion.\n          // We avoid it by directly calling the native @@method method.\n          return { done: true, value: nativeRegExpMethod.call(regexp, str, arg2) };\n        }\n        return { done: true, value: nativeMethod.call(str, regexp, arg2) };\n      }\n      return { done: false };\n    }, {\n      REPLACE_KEEPS_$0: REPLACE_KEEPS_$0,\n      REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE: REGEXP_REPLACE_SUBSTITUTES_UNDEFINED_CAPTURE\n    });\n    var stringMethod = methods[0];\n    var regexMethod = methods[1];\n\n    redefine(String.prototype, KEY, stringMethod);\n    redefine(RegExp.prototype, SYMBOL, length == 2\n      // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue)\n      // 21.2.5.11 RegExp.prototype[@@split](string, limit)\n      ? function (string, arg) { return regexMethod.call(string, this, arg); }\n      // 21.2.5.6 RegExp.prototype[@@match](string)\n      // 21.2.5.9 RegExp.prototype[@@search](string)\n      : function (string) { return regexMethod.call(string, this); }\n    );\n  }\n\n  if (sham) createNonEnumerableProperty(RegExp.prototype[SYMBOL], 'sham', true);\n};\n","'use strict';\nvar charAt = require('../internals/string-multibyte').charAt;\n\n// `AdvanceStringIndex` abstract operation\n// https://tc39.github.io/ecma262/#sec-advancestringindex\nmodule.exports = function (S, index, unicode) {\n  return index + (unicode ? charAt(S, index).length : 1);\n};\n","var classof = require('./classof-raw');\nvar regexpExec = require('./regexp-exec');\n\n// `RegExpExec` abstract operation\n// https://tc39.github.io/ecma262/#sec-regexpexec\nmodule.exports = function (R, S) {\n  var exec = R.exec;\n  if (typeof exec === 'function') {\n    var result = exec.call(R, S);\n    if (typeof result !== 'object') {\n      throw TypeError('RegExp exec method returned something other than an Object or null');\n    }\n    return result;\n  }\n\n  if (classof(R) !== 'RegExp') {\n    throw TypeError('RegExp#exec called on incompatible receiver');\n  }\n\n  return regexpExec.call(R, S);\n};\n\n","var global = require('../internals/global');\nvar inspectSource = require('../internals/inspect-source');\n\nvar WeakMap = global.WeakMap;\n\nmodule.exports = typeof WeakMap === 'function' && /native code/.test(inspectSource(WeakMap));\n","var has = require('../internals/has');\nvar ownKeys = require('../internals/own-keys');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\n\nmodule.exports = function (target, source) {\n  var keys = ownKeys(source);\n  var defineProperty = definePropertyModule.f;\n  var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    if (!has(target, key)) defineProperty(target, key, getOwnPropertyDescriptor(source, key));\n  }\n};\n","var getBuiltIn = require('../internals/get-built-in');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar anObject = require('../internals/an-object');\n\n// all object keys, includes non-enumerable and symbols\nmodule.exports = getBuiltIn('Reflect', 'ownKeys') || function ownKeys(it) {\n  var keys = getOwnPropertyNamesModule.f(anObject(it));\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  return getOwnPropertySymbols ? keys.concat(getOwnPropertySymbols(it)) : keys;\n};\n","var global = require('../internals/global');\n\nmodule.exports = global;\n","module.exports = require('./lib/axios');","'use strict';\n\nvar utils = require('./utils');\nvar bind = require('./helpers/bind');\nvar Axios = require('./core/Axios');\nvar mergeConfig = require('./core/mergeConfig');\nvar defaults = require('./defaults');\n\n/**\n * Create an instance of Axios\n *\n * @param {Object} defaultConfig The default config for the instance\n * @return {Axios} A new instance of Axios\n */\nfunction createInstance(defaultConfig) {\n  var context = new Axios(defaultConfig);\n  var instance = bind(Axios.prototype.request, context);\n\n  // Copy axios.prototype to instance\n  utils.extend(instance, Axios.prototype, context);\n\n  // Copy context to instance\n  utils.extend(instance, context);\n\n  return instance;\n}\n\n// Create the default instance to be exported\nvar axios = createInstance(defaults);\n\n// Expose Axios class to allow class inheritance\naxios.Axios = Axios;\n\n// Factory for creating new instances\naxios.create = function create(instanceConfig) {\n  return createInstance(mergeConfig(axios.defaults, instanceConfig));\n};\n\n// Expose Cancel & CancelToken\naxios.Cancel = require('./cancel/Cancel');\naxios.CancelToken = require('./cancel/CancelToken');\naxios.isCancel = require('./cancel/isCancel');\n\n// Expose all/spread\naxios.all = function all(promises) {\n  return Promise.all(promises);\n};\naxios.spread = require('./helpers/spread');\n\nmodule.exports = axios;\n\n// Allow use of default import syntax in TypeScript\nmodule.exports.default = axios;\n","'use strict';\n\nvar utils = require('./../utils');\nvar buildURL = require('../helpers/buildURL');\nvar InterceptorManager = require('./InterceptorManager');\nvar dispatchRequest = require('./dispatchRequest');\nvar mergeConfig = require('./mergeConfig');\n\n/**\n * Create a new instance of Axios\n *\n * @param {Object} instanceConfig The default config for the instance\n */\nfunction Axios(instanceConfig) {\n  this.defaults = instanceConfig;\n  this.interceptors = {\n    request: new InterceptorManager(),\n    response: new InterceptorManager()\n  };\n}\n\n/**\n * Dispatch a request\n *\n * @param {Object} config The config specific for this request (merged with this.defaults)\n */\nAxios.prototype.request = function request(config) {\n  /*eslint no-param-reassign:0*/\n  // Allow for axios('example/url'[, config]) a la fetch API\n  if (typeof config === 'string') {\n    config = arguments[1] || {};\n    config.url = arguments[0];\n  } else {\n    config = config || {};\n  }\n\n  config = mergeConfig(this.defaults, config);\n\n  // Set config.method\n  if (config.method) {\n    config.method = config.method.toLowerCase();\n  } else if (this.defaults.method) {\n    config.method = this.defaults.method.toLowerCase();\n  } else {\n    config.method = 'get';\n  }\n\n  // Hook up interceptors middleware\n  var chain = [dispatchRequest, undefined];\n  var promise = Promise.resolve(config);\n\n  this.interceptors.request.forEach(function unshiftRequestInterceptors(interceptor) {\n    chain.unshift(interceptor.fulfilled, interceptor.rejected);\n  });\n\n  this.interceptors.response.forEach(function pushResponseInterceptors(interceptor) {\n    chain.push(interceptor.fulfilled, interceptor.rejected);\n  });\n\n  while (chain.length) {\n    promise = promise.then(chain.shift(), chain.shift());\n  }\n\n  return promise;\n};\n\nAxios.prototype.getUri = function getUri(config) {\n  config = mergeConfig(this.defaults, config);\n  return buildURL(config.url, config.params, config.paramsSerializer).replace(/^\\?/, '');\n};\n\n// Provide aliases for supported request methods\nutils.forEach(['delete', 'get', 'head', 'options'], function forEachMethodNoData(method) {\n  /*eslint func-names:0*/\n  Axios.prototype[method] = function(url, config) {\n    return this.request(mergeConfig(config || {}, {\n      method: method,\n      url: url,\n      data: (config || {}).data\n    }));\n  };\n});\n\nutils.forEach(['post', 'put', 'patch'], function forEachMethodWithData(method) {\n  /*eslint func-names:0*/\n  Axios.prototype[method] = function(url, data, config) {\n    return this.request(mergeConfig(config || {}, {\n      method: method,\n      url: url,\n      data: data\n    }));\n  };\n});\n\nmodule.exports = Axios;\n","'use strict';\n\nvar utils = require('./../utils');\n\nfunction InterceptorManager() {\n  this.handlers = [];\n}\n\n/**\n * Add a new interceptor to the stack\n *\n * @param {Function} fulfilled The function to handle `then` for a `Promise`\n * @param {Function} rejected The function to handle `reject` for a `Promise`\n *\n * @return {Number} An ID used to remove interceptor later\n */\nInterceptorManager.prototype.use = function use(fulfilled, rejected) {\n  this.handlers.push({\n    fulfilled: fulfilled,\n    rejected: rejected\n  });\n  return this.handlers.length - 1;\n};\n\n/**\n * Remove an interceptor from the stack\n *\n * @param {Number} id The ID that was returned by `use`\n */\nInterceptorManager.prototype.eject = function eject(id) {\n  if (this.handlers[id]) {\n    this.handlers[id] = null;\n  }\n};\n\n/**\n * Iterate over all the registered interceptors\n *\n * This method is particularly useful for skipping over any\n * interceptors that may have become `null` calling `eject`.\n *\n * @param {Function} fn The function to call for each interceptor\n */\nInterceptorManager.prototype.forEach = function forEach(fn) {\n  utils.forEach(this.handlers, function forEachHandler(h) {\n    if (h !== null) {\n      fn(h);\n    }\n  });\n};\n\nmodule.exports = InterceptorManager;\n","'use strict';\n\nvar utils = require('./../utils');\nvar transformData = require('./transformData');\nvar isCancel = require('../cancel/isCancel');\nvar defaults = require('../defaults');\n\n/**\n * Throws a `Cancel` if cancellation has been requested.\n */\nfunction throwIfCancellationRequested(config) {\n  if (config.cancelToken) {\n    config.cancelToken.throwIfRequested();\n  }\n}\n\n/**\n * Dispatch a request to the server using the configured adapter.\n *\n * @param {object} config The config that is to be used for the request\n * @returns {Promise} The Promise to be fulfilled\n */\nmodule.exports = function dispatchRequest(config) {\n  throwIfCancellationRequested(config);\n\n  // Ensure headers exist\n  config.headers = config.headers || {};\n\n  // Transform request data\n  config.data = transformData(\n    config.data,\n    config.headers,\n    config.transformRequest\n  );\n\n  // Flatten headers\n  config.headers = utils.merge(\n    config.headers.common || {},\n    config.headers[config.method] || {},\n    config.headers\n  );\n\n  utils.forEach(\n    ['delete', 'get', 'head', 'post', 'put', 'patch', 'common'],\n    function cleanHeaderConfig(method) {\n      delete config.headers[method];\n    }\n  );\n\n  var adapter = config.adapter || defaults.adapter;\n\n  return adapter(config).then(function onAdapterResolution(response) {\n    throwIfCancellationRequested(config);\n\n    // Transform response data\n    response.data = transformData(\n      response.data,\n      response.headers,\n      config.transformResponse\n    );\n\n    return response;\n  }, function onAdapterRejection(reason) {\n    if (!isCancel(reason)) {\n      throwIfCancellationRequested(config);\n\n      // Transform response data\n      if (reason && reason.response) {\n        reason.response.data = transformData(\n          reason.response.data,\n          reason.response.headers,\n          config.transformResponse\n        );\n      }\n    }\n\n    return Promise.reject(reason);\n  });\n};\n","'use strict';\n\nvar utils = require('./../utils');\n\n/**\n * Transform the data for a request or a response\n *\n * @param {Object|String} data The data to be transformed\n * @param {Array} headers The headers for the request or response\n * @param {Array|Function} fns A single function or Array of functions\n * @returns {*} The resulting transformed data\n */\nmodule.exports = function transformData(data, headers, fns) {\n  /*eslint no-param-reassign:0*/\n  utils.forEach(fns, function transform(fn) {\n    data = fn(data, headers);\n  });\n\n  return data;\n};\n","'use strict';\n\nvar utils = require('../utils');\n\nmodule.exports = function normalizeHeaderName(headers, normalizedName) {\n  utils.forEach(headers, function processHeader(value, name) {\n    if (name !== normalizedName && name.toUpperCase() === normalizedName.toUpperCase()) {\n      headers[normalizedName] = value;\n      delete headers[name];\n    }\n  });\n};\n","'use strict';\n\nvar createError = require('./createError');\n\n/**\n * Resolve or reject a Promise based on response status.\n *\n * @param {Function} resolve A function that resolves the promise.\n * @param {Function} reject A function that rejects the promise.\n * @param {object} response The response.\n */\nmodule.exports = function settle(resolve, reject, response) {\n  var validateStatus = response.config.validateStatus;\n  if (!response.status || !validateStatus || validateStatus(response.status)) {\n    resolve(response);\n  } else {\n    reject(createError(\n      'Request failed with status code ' + response.status,\n      response.config,\n      null,\n      response.request,\n      response\n    ));\n  }\n};\n","'use strict';\n\n/**\n * Update an Error with the specified config, error code, and response.\n *\n * @param {Error} error The error to update.\n * @param {Object} config The config.\n * @param {string} [code] The error code (for example, 'ECONNABORTED').\n * @param {Object} [request] The request.\n * @param {Object} [response] The response.\n * @returns {Error} The error.\n */\nmodule.exports = function enhanceError(error, config, code, request, response) {\n  error.config = config;\n  if (code) {\n    error.code = code;\n  }\n\n  error.request = request;\n  error.response = response;\n  error.isAxiosError = true;\n\n  error.toJSON = function toJSON() {\n    return {\n      // Standard\n      message: this.message,\n      name: this.name,\n      // Microsoft\n      description: this.description,\n      number: this.number,\n      // Mozilla\n      fileName: this.fileName,\n      lineNumber: this.lineNumber,\n      columnNumber: this.columnNumber,\n      stack: this.stack,\n      // Axios\n      config: this.config,\n      code: this.code\n    };\n  };\n  return error;\n};\n","'use strict';\n\nvar utils = require('./../utils');\n\nmodule.exports = (\n  utils.isStandardBrowserEnv() ?\n\n  // Standard browser envs support document.cookie\n    (function standardBrowserEnv() {\n      return {\n        write: function write(name, value, expires, path, domain, secure) {\n          var cookie = [];\n          cookie.push(name + '=' + encodeURIComponent(value));\n\n          if (utils.isNumber(expires)) {\n            cookie.push('expires=' + new Date(expires).toGMTString());\n          }\n\n          if (utils.isString(path)) {\n            cookie.push('path=' + path);\n          }\n\n          if (utils.isString(domain)) {\n            cookie.push('domain=' + domain);\n          }\n\n          if (secure === true) {\n            cookie.push('secure');\n          }\n\n          document.cookie = cookie.join('; ');\n        },\n\n        read: function read(name) {\n          var match = document.cookie.match(new RegExp('(^|;\\\\s*)(' + name + ')=([^;]*)'));\n          return (match ? decodeURIComponent(match[3]) : null);\n        },\n\n        remove: function remove(name) {\n          this.write(name, '', Date.now() - 86400000);\n        }\n      };\n    })() :\n\n  // Non standard browser env (web workers, react-native) lack needed support.\n    (function nonStandardBrowserEnv() {\n      return {\n        write: function write() {},\n        read: function read() { return null; },\n        remove: function remove() {}\n      };\n    })()\n);\n","'use strict';\n\nvar isAbsoluteURL = require('../helpers/isAbsoluteURL');\nvar combineURLs = require('../helpers/combineURLs');\n\n/**\n * Creates a new URL by combining the baseURL with the requestedURL,\n * only when the requestedURL is not already an absolute URL.\n * If the requestURL is absolute, this function returns the requestedURL untouched.\n *\n * @param {string} baseURL The base URL\n * @param {string} requestedURL Absolute or relative URL to combine\n * @returns {string} The combined full path\n */\nmodule.exports = function buildFullPath(baseURL, requestedURL) {\n  if (baseURL && !isAbsoluteURL(requestedURL)) {\n    return combineURLs(baseURL, requestedURL);\n  }\n  return requestedURL;\n};\n","'use strict';\n\n/**\n * Determines whether the specified URL is absolute\n *\n * @param {string} url The URL to test\n * @returns {boolean} True if the specified URL is absolute, otherwise false\n */\nmodule.exports = function isAbsoluteURL(url) {\n  // A URL is considered absolute if it begins with \"<scheme>://\" or \"//\" (protocol-relative URL).\n  // RFC 3986 defines scheme name as a sequence of characters beginning with a letter and followed\n  // by any combination of letters, digits, plus, period, or hyphen.\n  return /^([a-z][a-z\\d\\+\\-\\.]*:)?\\/\\//i.test(url);\n};\n","'use strict';\n\n/**\n * Creates a new URL by combining the specified URLs\n *\n * @param {string} baseURL The base URL\n * @param {string} relativeURL The relative URL\n * @returns {string} The combined URL\n */\nmodule.exports = function combineURLs(baseURL, relativeURL) {\n  return relativeURL\n    ? baseURL.replace(/\\/+$/, '') + '/' + relativeURL.replace(/^\\/+/, '')\n    : baseURL;\n};\n","'use strict';\n\nvar utils = require('./../utils');\n\n// Headers whose duplicates are ignored by node\n// c.f. https://nodejs.org/api/http.html#http_message_headers\nvar ignoreDuplicateOf = [\n  'age', 'authorization', 'content-length', 'content-type', 'etag',\n  'expires', 'from', 'host', 'if-modified-since', 'if-unmodified-since',\n  'last-modified', 'location', 'max-forwards', 'proxy-authorization',\n  'referer', 'retry-after', 'user-agent'\n];\n\n/**\n * Parse headers into an object\n *\n * ```\n * Date: Wed, 27 Aug 2014 08:58:49 GMT\n * Content-Type: application/json\n * Connection: keep-alive\n * Transfer-Encoding: chunked\n * ```\n *\n * @param {String} headers Headers needing to be parsed\n * @returns {Object} Headers parsed into an object\n */\nmodule.exports = function parseHeaders(headers) {\n  var parsed = {};\n  var key;\n  var val;\n  var i;\n\n  if (!headers) { return parsed; }\n\n  utils.forEach(headers.split('\\n'), function parser(line) {\n    i = line.indexOf(':');\n    key = utils.trim(line.substr(0, i)).toLowerCase();\n    val = utils.trim(line.substr(i + 1));\n\n    if (key) {\n      if (parsed[key] && ignoreDuplicateOf.indexOf(key) >= 0) {\n        return;\n      }\n      if (key === 'set-cookie') {\n        parsed[key] = (parsed[key] ? parsed[key] : []).concat([val]);\n      } else {\n        parsed[key] = parsed[key] ? parsed[key] + ', ' + val : val;\n      }\n    }\n  });\n\n  return parsed;\n};\n","'use strict';\n\nvar utils = require('./../utils');\n\nmodule.exports = (\n  utils.isStandardBrowserEnv() ?\n\n  // Standard browser envs have full support of the APIs needed to test\n  // whether the request URL is of the same origin as current location.\n    (function standardBrowserEnv() {\n      var msie = /(msie|trident)/i.test(navigator.userAgent);\n      var urlParsingNode = document.createElement('a');\n      var originURL;\n\n      /**\n    * Parse a URL to discover it's components\n    *\n    * @param {String} url The URL to be parsed\n    * @returns {Object}\n    */\n      function resolveURL(url) {\n        var href = url;\n\n        if (msie) {\n        // IE needs attribute set twice to normalize properties\n          urlParsingNode.setAttribute('href', href);\n          href = urlParsingNode.href;\n        }\n\n        urlParsingNode.setAttribute('href', href);\n\n        // urlParsingNode provides the UrlUtils interface - http://url.spec.whatwg.org/#urlutils\n        return {\n          href: urlParsingNode.href,\n          protocol: urlParsingNode.protocol ? urlParsingNode.protocol.replace(/:$/, '') : '',\n          host: urlParsingNode.host,\n          search: urlParsingNode.search ? urlParsingNode.search.replace(/^\\?/, '') : '',\n          hash: urlParsingNode.hash ? urlParsingNode.hash.replace(/^#/, '') : '',\n          hostname: urlParsingNode.hostname,\n          port: urlParsingNode.port,\n          pathname: (urlParsingNode.pathname.charAt(0) === '/') ?\n            urlParsingNode.pathname :\n            '/' + urlParsingNode.pathname\n        };\n      }\n\n      originURL = resolveURL(window.location.href);\n\n      /**\n    * Determine if a URL shares the same origin as the current location\n    *\n    * @param {String} requestURL The URL to test\n    * @returns {boolean} True if URL shares the same origin, otherwise false\n    */\n      return function isURLSameOrigin(requestURL) {\n        var parsed = (utils.isString(requestURL)) ? resolveURL(requestURL) : requestURL;\n        return (parsed.protocol === originURL.protocol &&\n            parsed.host === originURL.host);\n      };\n    })() :\n\n  // Non standard browser envs (web workers, react-native) lack needed support.\n    (function nonStandardBrowserEnv() {\n      return function isURLSameOrigin() {\n        return true;\n      };\n    })()\n);\n","'use strict';\n\nvar Cancel = require('./Cancel');\n\n/**\n * A `CancelToken` is an object that can be used to request cancellation of an operation.\n *\n * @class\n * @param {Function} executor The executor function.\n */\nfunction CancelToken(executor) {\n  if (typeof executor !== 'function') {\n    throw new TypeError('executor must be a function.');\n  }\n\n  var resolvePromise;\n  this.promise = new Promise(function promiseExecutor(resolve) {\n    resolvePromise = resolve;\n  });\n\n  var token = this;\n  executor(function cancel(message) {\n    if (token.reason) {\n      // Cancellation has already been requested\n      return;\n    }\n\n    token.reason = new Cancel(message);\n    resolvePromise(token.reason);\n  });\n}\n\n/**\n * Throws a `Cancel` if cancellation has been requested.\n */\nCancelToken.prototype.throwIfRequested = function throwIfRequested() {\n  if (this.reason) {\n    throw this.reason;\n  }\n};\n\n/**\n * Returns an object that contains a new `CancelToken` and a function that, when called,\n * cancels the `CancelToken`.\n */\nCancelToken.source = function source() {\n  var cancel;\n  var token = new CancelToken(function executor(c) {\n    cancel = c;\n  });\n  return {\n    token: token,\n    cancel: cancel\n  };\n};\n\nmodule.exports = CancelToken;\n","'use strict';\n\n/**\n * Syntactic sugar for invoking a function and expanding an array for arguments.\n *\n * Common use case would be to use `Function.prototype.apply`.\n *\n *  ```js\n *  function f(x, y, z) {}\n *  var args = [1, 2, 3];\n *  f.apply(null, args);\n *  ```\n *\n * With `spread` this example can be re-written.\n *\n *  ```js\n *  spread(function(x, y, z) {})([1, 2, 3]);\n *  ```\n *\n * @param {Function} callback\n * @returns {Function}\n */\nmodule.exports = function spread(callback) {\n  return function wrap(arr) {\n    return callback.apply(null, arr);\n  };\n};\n","import { subscribe } from '@nextcloud/event-bus'\n\nconst tokenElement = document.getElementsByTagName('head')[0]\nlet token = tokenElement ? tokenElement.getAttribute('data-requesttoken') : null\n\ninterface CsrfTokenObserver {\n\t(token: string): void;\n}\n\nconst observers: Array<CsrfTokenObserver> = []\n\nexport function getRequestToken(): string | null {\n\treturn token\n}\n\nexport function onRequestTokenUpdate(observer: CsrfTokenObserver): void {\n\tobservers.push(observer)\n}\n\n// Listen to server event and keep token in sync\nsubscribe('csrf-token-update', e => {\n\ttoken = e.token\n\n\tobservers.forEach(observer => {\n\t\ttry {\n\t\t\tobserver(e.token)\n\t\t} catch (e) {\n\t\t\tconsole.error('error updating CSRF token observer', e)\n\t\t}\n\t})\n})\n","var NATIVE_SYMBOL = require('../internals/native-symbol');\n\nmodule.exports = NATIVE_SYMBOL\n  // eslint-disable-next-line no-undef\n  && !Symbol.sham\n  // eslint-disable-next-line no-undef\n  && typeof Symbol.iterator == 'symbol';\n","import valid from \"semver/functions/valid\";\nimport major from \"semver/functions/major\";\n\nimport packageJson from \"../package.json\";\nimport { Event } from \"./Event.js\";\nimport { EventBus } from \"./EventBus.js\";\nimport { EventHandler } from \"./EventHandler.js\";\n\nexport class ProxyBus implements EventBus {\n\n    private bus: EventBus;\n\n    constructor(bus: EventBus) {\n        if (typeof bus.getVersion !== 'function' || !valid(bus.getVersion())) {\n            console.warn('Proxying an event bus with an unknown or invalid version')\n        } else if (major(bus.getVersion()) !== major(this.getVersion())) {\n            console.warn('Proxying an event bus of version ' + bus.getVersion() + ' with ' + this.getVersion())\n        }\n\n        this.bus = bus;\n    }\n\n    getVersion(): string {\n        return packageJson.version\n    }\n\n    subscribe(name: string, handler: EventHandler): void {\n        this.bus.subscribe(name, handler);\n    }\n\n    unsubscribe(name: string, handler: EventHandler): void {\n        this.bus.unsubscribe(name, handler);\n    }\n\n    emit(name: string, event: Event): void {\n        this.bus.emit(name, event);\n    }\n\n}\n","const parse = require('./parse')\nconst valid = (version, options) => {\n  const v = parse(version, options)\n  return v ? v.version : null\n}\nmodule.exports = valid\n","const {MAX_LENGTH} = require('../internal/constants')\nconst { re, t } = require('../internal/re')\nconst SemVer = require('../classes/semver')\n\nconst parse = (version, options) => {\n  if (!options || typeof options !== 'object') {\n    options = {\n      loose: !!options,\n      includePrerelease: false\n    }\n  }\n\n  if (version instanceof SemVer) {\n    return version\n  }\n\n  if (typeof version !== 'string') {\n    return null\n  }\n\n  if (version.length > MAX_LENGTH) {\n    return null\n  }\n\n  const r = options.loose ? re[t.LOOSE] : re[t.FULL]\n  if (!r.test(version)) {\n    return null\n  }\n\n  try {\n    return new SemVer(version, options)\n  } catch (er) {\n    return null\n  }\n}\n\nmodule.exports = parse\n","const numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n  const anum = numeric.test(a)\n  const bnum = numeric.test(b)\n\n  if (anum && bnum) {\n    a = +a\n    b = +b\n  }\n\n  return a === b ? 0\n    : (anum && !bnum) ? -1\n    : (bnum && !anum) ? 1\n    : a < b ? -1\n    : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n  compareIdentifiers,\n  rcompareIdentifiers\n}\n","const SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n","import packageJson from \"../package.json\";\nimport { Event } from \"./Event.js\";\nimport { EventBus } from \"./EventBus.js\";\nimport { EventHandler } from \"./EventHandler.js\";\n\nexport class SimpleBus implements EventBus {\n\n    private handlers = new Map<string, EventHandler[]>();\n\n    getVersion(): string {\n        return packageJson.version\n    }\n\n    subscribe(name: string, handler: EventHandler): void {\n        this.handlers.set(name, (this.handlers.get(name) || []).concat(handler));\n    }\n\n    unsubscribe(name: string, handler: EventHandler): void {\n        this.handlers.set(name, (this.handlers.get(name) || []).filter(h => h != handler));\n    }\n\n    emit(name: string, event: Event): void {\n        (this.handlers.get(name) || []).forEach(h => {\n            try {\n                h(event)\n            } catch (e) {\n                console.error('could not invoke event listener', e)\n            }\n        })\n    }\n\n}\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar create = require('../internals/object-create');\nvar definePropertyModule = require('../internals/object-define-property');\n\nvar UNSCOPABLES = wellKnownSymbol('unscopables');\nvar ArrayPrototype = Array.prototype;\n\n// Array.prototype[@@unscopables]\n// https://tc39.github.io/ecma262/#sec-array.prototype-@@unscopables\nif (ArrayPrototype[UNSCOPABLES] == undefined) {\n  definePropertyModule.f(ArrayPrototype, UNSCOPABLES, {\n    configurable: true,\n    value: create(null)\n  });\n}\n\n// add a key to Array.prototype[@@unscopables]\nmodule.exports = function (key) {\n  ArrayPrototype[UNSCOPABLES][key] = true;\n};\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  function F() { /* empty */ }\n  F.prototype.constructor = null;\n  return Object.getPrototypeOf(new F()) !== F.prototype;\n});\n","var isObject = require('../internals/is-object');\n\nmodule.exports = function (it) {\n  if (!isObject(it) && it !== null) {\n    throw TypeError(\"Can't set \" + String(it) + ' as a prototype');\n  } return it;\n};\n","'use strict';\nvar collection = require('../internals/collection');\nvar collectionStrong = require('../internals/collection-strong');\n\n// `Map` constructor\n// https://tc39.github.io/ecma262/#sec-map-objects\nmodule.exports = collection('Map', function (init) {\n  return function Map() { return init(this, arguments.length ? arguments[0] : undefined); };\n}, collectionStrong);\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar InternalMetadataModule = require('../internals/internal-metadata');\nvar iterate = require('../internals/iterate');\nvar anInstance = require('../internals/an-instance');\nvar isObject = require('../internals/is-object');\nvar fails = require('../internals/fails');\nvar checkCorrectnessOfIteration = require('../internals/check-correctness-of-iteration');\nvar setToStringTag = require('../internals/set-to-string-tag');\nvar inheritIfRequired = require('../internals/inherit-if-required');\n\nmodule.exports = function (CONSTRUCTOR_NAME, wrapper, common) {\n  var IS_MAP = CONSTRUCTOR_NAME.indexOf('Map') !== -1;\n  var IS_WEAK = CONSTRUCTOR_NAME.indexOf('Weak') !== -1;\n  var ADDER = IS_MAP ? 'set' : 'add';\n  var NativeConstructor = global[CONSTRUCTOR_NAME];\n  var NativePrototype = NativeConstructor && NativeConstructor.prototype;\n  var Constructor = NativeConstructor;\n  var exported = {};\n\n  var fixMethod = function (KEY) {\n    var nativeMethod = NativePrototype[KEY];\n    redefine(NativePrototype, KEY,\n      KEY == 'add' ? function add(value) {\n        nativeMethod.call(this, value === 0 ? 0 : value);\n        return this;\n      } : KEY == 'delete' ? function (key) {\n        return IS_WEAK && !isObject(key) ? false : nativeMethod.call(this, key === 0 ? 0 : key);\n      } : KEY == 'get' ? function get(key) {\n        return IS_WEAK && !isObject(key) ? undefined : nativeMethod.call(this, key === 0 ? 0 : key);\n      } : KEY == 'has' ? function has(key) {\n        return IS_WEAK && !isObject(key) ? false : nativeMethod.call(this, key === 0 ? 0 : key);\n      } : function set(key, value) {\n        nativeMethod.call(this, key === 0 ? 0 : key, value);\n        return this;\n      }\n    );\n  };\n\n  // eslint-disable-next-line max-len\n  if (isForced(CONSTRUCTOR_NAME, typeof NativeConstructor != 'function' || !(IS_WEAK || NativePrototype.forEach && !fails(function () {\n    new NativeConstructor().entries().next();\n  })))) {\n    // create collection constructor\n    Constructor = common.getConstructor(wrapper, CONSTRUCTOR_NAME, IS_MAP, ADDER);\n    InternalMetadataModule.REQUIRED = true;\n  } else if (isForced(CONSTRUCTOR_NAME, true)) {\n    var instance = new Constructor();\n    // early implementations not supports chaining\n    var HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance;\n    // V8 ~ Chromium 40- weak-collections throws on primitives, but should return false\n    var THROWS_ON_PRIMITIVES = fails(function () { instance.has(1); });\n    // most early implementations doesn't supports iterables, most modern - not close it correctly\n    // eslint-disable-next-line no-new\n    var ACCEPT_ITERABLES = checkCorrectnessOfIteration(function (iterable) { new NativeConstructor(iterable); });\n    // for early implementations -0 and +0 not the same\n    var BUGGY_ZERO = !IS_WEAK && fails(function () {\n      // V8 ~ Chromium 42- fails only with 5+ elements\n      var $instance = new NativeConstructor();\n      var index = 5;\n      while (index--) $instance[ADDER](index, index);\n      return !$instance.has(-0);\n    });\n\n    if (!ACCEPT_ITERABLES) {\n      Constructor = wrapper(function (dummy, iterable) {\n        anInstance(dummy, Constructor, CONSTRUCTOR_NAME);\n        var that = inheritIfRequired(new NativeConstructor(), dummy, Constructor);\n        if (iterable != undefined) iterate(iterable, that[ADDER], { that: that, AS_ENTRIES: IS_MAP });\n        return that;\n      });\n      Constructor.prototype = NativePrototype;\n      NativePrototype.constructor = Constructor;\n    }\n\n    if (THROWS_ON_PRIMITIVES || BUGGY_ZERO) {\n      fixMethod('delete');\n      fixMethod('has');\n      IS_MAP && fixMethod('get');\n    }\n\n    if (BUGGY_ZERO || HASNT_CHAINING) fixMethod(ADDER);\n\n    // weak collections should not contains .clear method\n    if (IS_WEAK && NativePrototype.clear) delete NativePrototype.clear;\n  }\n\n  exported[CONSTRUCTOR_NAME] = Constructor;\n  $({ global: true, forced: Constructor != NativeConstructor }, exported);\n\n  setToStringTag(Constructor, CONSTRUCTOR_NAME);\n\n  if (!IS_WEAK) common.setStrong(Constructor, CONSTRUCTOR_NAME, IS_MAP);\n\n  return Constructor;\n};\n","var fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  return Object.isExtensible(Object.preventExtensions({}));\n});\n","'use strict';\nvar defineProperty = require('../internals/object-define-property').f;\nvar create = require('../internals/object-create');\nvar redefineAll = require('../internals/redefine-all');\nvar bind = require('../internals/function-bind-context');\nvar anInstance = require('../internals/an-instance');\nvar iterate = require('../internals/iterate');\nvar defineIterator = require('../internals/define-iterator');\nvar setSpecies = require('../internals/set-species');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fastKey = require('../internals/internal-metadata').fastKey;\nvar InternalStateModule = require('../internals/internal-state');\n\nvar setInternalState = InternalStateModule.set;\nvar internalStateGetterFor = InternalStateModule.getterFor;\n\nmodule.exports = {\n  getConstructor: function (wrapper, CONSTRUCTOR_NAME, IS_MAP, ADDER) {\n    var C = wrapper(function (that, iterable) {\n      anInstance(that, C, CONSTRUCTOR_NAME);\n      setInternalState(that, {\n        type: CONSTRUCTOR_NAME,\n        index: create(null),\n        first: undefined,\n        last: undefined,\n        size: 0\n      });\n      if (!DESCRIPTORS) that.size = 0;\n      if (iterable != undefined) iterate(iterable, that[ADDER], { that: that, AS_ENTRIES: IS_MAP });\n    });\n\n    var getInternalState = internalStateGetterFor(CONSTRUCTOR_NAME);\n\n    var define = function (that, key, value) {\n      var state = getInternalState(that);\n      var entry = getEntry(that, key);\n      var previous, index;\n      // change existing entry\n      if (entry) {\n        entry.value = value;\n      // create new entry\n      } else {\n        state.last = entry = {\n          index: index = fastKey(key, true),\n          key: key,\n          value: value,\n          previous: previous = state.last,\n          next: undefined,\n          removed: false\n        };\n        if (!state.first) state.first = entry;\n        if (previous) previous.next = entry;\n        if (DESCRIPTORS) state.size++;\n        else that.size++;\n        // add to index\n        if (index !== 'F') state.index[index] = entry;\n      } return that;\n    };\n\n    var getEntry = function (that, key) {\n      var state = getInternalState(that);\n      // fast case\n      var index = fastKey(key);\n      var entry;\n      if (index !== 'F') return state.index[index];\n      // frozen object case\n      for (entry = state.first; entry; entry = entry.next) {\n        if (entry.key == key) return entry;\n      }\n    };\n\n    redefineAll(C.prototype, {\n      // 23.1.3.1 Map.prototype.clear()\n      // 23.2.3.2 Set.prototype.clear()\n      clear: function clear() {\n        var that = this;\n        var state = getInternalState(that);\n        var data = state.index;\n        var entry = state.first;\n        while (entry) {\n          entry.removed = true;\n          if (entry.previous) entry.previous = entry.previous.next = undefined;\n          delete data[entry.index];\n          entry = entry.next;\n        }\n        state.first = state.last = undefined;\n        if (DESCRIPTORS) state.size = 0;\n        else that.size = 0;\n      },\n      // 23.1.3.3 Map.prototype.delete(key)\n      // 23.2.3.4 Set.prototype.delete(value)\n      'delete': function (key) {\n        var that = this;\n        var state = getInternalState(that);\n        var entry = getEntry(that, key);\n        if (entry) {\n          var next = entry.next;\n          var prev = entry.previous;\n          delete state.index[entry.index];\n          entry.removed = true;\n          if (prev) prev.next = next;\n          if (next) next.previous = prev;\n          if (state.first == entry) state.first = next;\n          if (state.last == entry) state.last = prev;\n          if (DESCRIPTORS) state.size--;\n          else that.size--;\n        } return !!entry;\n      },\n      // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)\n      // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)\n      forEach: function forEach(callbackfn /* , that = undefined */) {\n        var state = getInternalState(this);\n        var boundFunction = bind(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3);\n        var entry;\n        while (entry = entry ? entry.next : state.first) {\n          boundFunction(entry.value, entry.key, this);\n          // revert to the last existing entry\n          while (entry && entry.removed) entry = entry.previous;\n        }\n      },\n      // 23.1.3.7 Map.prototype.has(key)\n      // 23.2.3.7 Set.prototype.has(value)\n      has: function has(key) {\n        return !!getEntry(this, key);\n      }\n    });\n\n    redefineAll(C.prototype, IS_MAP ? {\n      // 23.1.3.6 Map.prototype.get(key)\n      get: function get(key) {\n        var entry = getEntry(this, key);\n        return entry && entry.value;\n      },\n      // 23.1.3.9 Map.prototype.set(key, value)\n      set: function set(key, value) {\n        return define(this, key === 0 ? 0 : key, value);\n      }\n    } : {\n      // 23.2.3.1 Set.prototype.add(value)\n      add: function add(value) {\n        return define(this, value = value === 0 ? 0 : value, value);\n      }\n    });\n    if (DESCRIPTORS) defineProperty(C.prototype, 'size', {\n      get: function () {\n        return getInternalState(this).size;\n      }\n    });\n    return C;\n  },\n  setStrong: function (C, CONSTRUCTOR_NAME, IS_MAP) {\n    var ITERATOR_NAME = CONSTRUCTOR_NAME + ' Iterator';\n    var getInternalCollectionState = internalStateGetterFor(CONSTRUCTOR_NAME);\n    var getInternalIteratorState = internalStateGetterFor(ITERATOR_NAME);\n    // add .keys, .values, .entries, [@@iterator]\n    // 23.1.3.4, 23.1.3.8, 23.1.3.11, 23.1.3.12, 23.2.3.5, 23.2.3.8, 23.2.3.10, 23.2.3.11\n    defineIterator(C, CONSTRUCTOR_NAME, function (iterated, kind) {\n      setInternalState(this, {\n        type: ITERATOR_NAME,\n        target: iterated,\n        state: getInternalCollectionState(iterated),\n        kind: kind,\n        last: undefined\n      });\n    }, function () {\n      var state = getInternalIteratorState(this);\n      var kind = state.kind;\n      var entry = state.last;\n      // revert to the last existing entry\n      while (entry && entry.removed) entry = entry.previous;\n      // get next entry\n      if (!state.target || !(state.last = entry = entry ? entry.next : state.state.first)) {\n        // or finish the iteration\n        state.target = undefined;\n        return { value: undefined, done: true };\n      }\n      // return step by kind\n      if (kind == 'keys') return { value: entry.key, done: false };\n      if (kind == 'values') return { value: entry.value, done: false };\n      return { value: [entry.key, entry.value], done: false };\n    }, IS_MAP ? 'entries' : 'values', !IS_MAP, true);\n\n    // add [@@species], 23.1.2.2, 23.2.2.2\n    setSpecies(CONSTRUCTOR_NAME);\n  }\n};\n","'use strict';\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar classof = require('../internals/classof');\n\n// `Object.prototype.toString` method implementation\n// https://tc39.github.io/ecma262/#sec-object.prototype.tostring\nmodule.exports = TO_STRING_TAG_SUPPORT ? {}.toString : function toString() {\n  return '[object ' + classof(this) + ']';\n};\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar forEach = require('../internals/array-for-each');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  var Collection = global[COLLECTION_NAME];\n  var CollectionPrototype = Collection && Collection.prototype;\n  // some Chrome versions have non-configurable methods on DOMTokenList\n  if (CollectionPrototype && CollectionPrototype.forEach !== forEach) try {\n    createNonEnumerableProperty(CollectionPrototype, 'forEach', forEach);\n  } catch (error) {\n    CollectionPrototype.forEach = forEach;\n  }\n}\n","/// <reference types=\"@nextcloud/typings\" />\n\ndeclare var OC: Nextcloud.v16.OC | Nextcloud.v17.OC | Nextcloud.v18.OC | Nextcloud.v19.OC;\n\nconst uidElement = document\n\t.getElementsByTagName('head')[0]\nconst uid = uidElement ? uidElement.getAttribute('data-user') : null\n\nconst displayNameElement = document\n\t.getElementsByTagName('head')[0]\nconst displayName = displayNameElement ? displayNameElement.getAttribute('data-user-displayname') : null\n\nconst isAdmin = (typeof OC === 'undefined')\n\t? false\n\t: OC.isUserAdmin()\n\nexport interface NextcloudUser {\n\tuid: String,\n\tdisplayName: String | null,\n\tisAdmin: Boolean,\n}\n\nexport function getCurrentUser(): NextcloudUser | null {\n\tif (uid === null) {\n\t\treturn null\n\t}\n\n\treturn {\n\t\tuid,\n\t\tdisplayName,\n\t\tisAdmin,\n\t} as NextcloudUser\n}\n","'use strict';\n\nvar fails = require('./fails');\n\n// babel-minify transpiles RegExp('a', 'y') -> /a/y and it causes SyntaxError,\n// so we use an intermediate function.\nfunction RE(s, f) {\n  return RegExp(s, f);\n}\n\nexports.UNSUPPORTED_Y = fails(function () {\n  // babel-minify transpiles RegExp('a', 'y') -> /a/y and it causes SyntaxError\n  var re = RE('a', 'y');\n  re.lastIndex = 2;\n  return re.exec('abcd') != null;\n});\n\nexports.BROKEN_CARET = fails(function () {\n  // https://bugzilla.mozilla.org/show_bug.cgi?id=773687\n  var re = RE('^r', 'gy');\n  re.lastIndex = 2;\n  return re.exec('str') != null;\n});\n","// Utilities\n//\n'use strict';\n\n\nfunction _class(obj) { return Object.prototype.toString.call(obj); }\n\nfunction isString(obj) { return _class(obj) === '[object String]'; }\n\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction has(object, key) {\n  return _hasOwnProperty.call(object, key);\n}\n\n// Merge objects\n//\nfunction assign(obj /*from1, from2, from3, ...*/) {\n  var sources = Array.prototype.slice.call(arguments, 1);\n\n  sources.forEach(function (source) {\n    if (!source) { return; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be object');\n    }\n\n    Object.keys(source).forEach(function (key) {\n      obj[key] = source[key];\n    });\n  });\n\n  return obj;\n}\n\n// Remove element from array and put another array at those position.\n// Useful for some operations with tokens\nfunction arrayReplaceAt(src, pos, newElements) {\n  return [].concat(src.slice(0, pos), newElements, src.slice(pos + 1));\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nfunction isValidEntityCode(c) {\n  /*eslint no-bitwise:0*/\n  // broken sequence\n  if (c >= 0xD800 && c <= 0xDFFF) { return false; }\n  // never used\n  if (c >= 0xFDD0 && c <= 0xFDEF) { return false; }\n  if ((c & 0xFFFF) === 0xFFFF || (c & 0xFFFF) === 0xFFFE) { return false; }\n  // control codes\n  if (c >= 0x00 && c <= 0x08) { return false; }\n  if (c === 0x0B) { return false; }\n  if (c >= 0x0E && c <= 0x1F) { return false; }\n  if (c >= 0x7F && c <= 0x9F) { return false; }\n  // out of range\n  if (c > 0x10FFFF) { return false; }\n  return true;\n}\n\nfunction fromCodePoint(c) {\n  /*eslint no-bitwise:0*/\n  if (c > 0xffff) {\n    c -= 0x10000;\n    var surrogate1 = 0xd800 + (c >> 10),\n        surrogate2 = 0xdc00 + (c & 0x3ff);\n\n    return String.fromCharCode(surrogate1, surrogate2);\n  }\n  return String.fromCharCode(c);\n}\n\n\nvar UNESCAPE_MD_RE  = /\\\\([!\"#$%&'()*+,\\-.\\/:;<=>?@[\\\\\\]^_`{|}~])/g;\nvar ENTITY_RE       = /&([a-z#][a-z0-9]{1,31});/gi;\nvar UNESCAPE_ALL_RE = new RegExp(UNESCAPE_MD_RE.source + '|' + ENTITY_RE.source, 'gi');\n\nvar DIGITAL_ENTITY_TEST_RE = /^#((?:x[a-f0-9]{1,8}|[0-9]{1,8}))/i;\n\nvar entities = require('./entities');\n\nfunction replaceEntityPattern(match, name) {\n  var code = 0;\n\n  if (has(entities, name)) {\n    return entities[name];\n  }\n\n  if (name.charCodeAt(0) === 0x23/* # */ && DIGITAL_ENTITY_TEST_RE.test(name)) {\n    code = name[1].toLowerCase() === 'x' ?\n      parseInt(name.slice(2), 16)\n    :\n      parseInt(name.slice(1), 10);\n    if (isValidEntityCode(code)) {\n      return fromCodePoint(code);\n    }\n  }\n\n  return match;\n}\n\n/*function replaceEntities(str) {\n  if (str.indexOf('&') < 0) { return str; }\n\n  return str.replace(ENTITY_RE, replaceEntityPattern);\n}*/\n\nfunction unescapeMd(str) {\n  if (str.indexOf('\\\\') < 0) { return str; }\n  return str.replace(UNESCAPE_MD_RE, '$1');\n}\n\nfunction unescapeAll(str) {\n  if (str.indexOf('\\\\') < 0 && str.indexOf('&') < 0) { return str; }\n\n  return str.replace(UNESCAPE_ALL_RE, function (match, escaped, entity) {\n    if (escaped) { return escaped; }\n    return replaceEntityPattern(match, entity);\n  });\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nvar HTML_ESCAPE_TEST_RE = /[&<>\"]/;\nvar HTML_ESCAPE_REPLACE_RE = /[&<>\"]/g;\nvar HTML_REPLACEMENTS = {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;'\n};\n\nfunction replaceUnsafeChar(ch) {\n  return HTML_REPLACEMENTS[ch];\n}\n\nfunction escapeHtml(str) {\n  if (HTML_ESCAPE_TEST_RE.test(str)) {\n    return str.replace(HTML_ESCAPE_REPLACE_RE, replaceUnsafeChar);\n  }\n  return str;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nvar REGEXP_ESCAPE_RE = /[.?*+^$[\\]\\\\(){}|-]/g;\n\nfunction escapeRE(str) {\n  return str.replace(REGEXP_ESCAPE_RE, '\\\\$&');\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nfunction isSpace(code) {\n  switch (code) {\n    case 0x09:\n    case 0x20:\n      return true;\n  }\n  return false;\n}\n\n// Zs (unicode class) || [\\t\\f\\v\\r\\n]\nfunction isWhiteSpace(code) {\n  if (code >= 0x2000 && code <= 0x200A) { return true; }\n  switch (code) {\n    case 0x09: // \\t\n    case 0x0A: // \\n\n    case 0x0B: // \\v\n    case 0x0C: // \\f\n    case 0x0D: // \\r\n    case 0x20:\n    case 0xA0:\n    case 0x1680:\n    case 0x202F:\n    case 0x205F:\n    case 0x3000:\n      return true;\n  }\n  return false;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\n/*eslint-disable max-len*/\nvar UNICODE_PUNCT_RE = require('uc.micro/categories/P/regex');\n\n// Currently without astral characters support.\nfunction isPunctChar(ch) {\n  return UNICODE_PUNCT_RE.test(ch);\n}\n\n\n// Markdown ASCII punctuation characters.\n//\n// !, \", #, $, %, &, ', (, ), *, +, ,, -, ., /, :, ;, <, =, >, ?, @, [, \\, ], ^, _, `, {, |, }, or ~\n// http://spec.commonmark.org/0.15/#ascii-punctuation-character\n//\n// Don't confuse with unicode punctuation !!! It lacks some chars in ascii range.\n//\nfunction isMdAsciiPunct(ch) {\n  switch (ch) {\n    case 0x21/* ! */:\n    case 0x22/* \" */:\n    case 0x23/* # */:\n    case 0x24/* $ */:\n    case 0x25/* % */:\n    case 0x26/* & */:\n    case 0x27/* ' */:\n    case 0x28/* ( */:\n    case 0x29/* ) */:\n    case 0x2A/* * */:\n    case 0x2B/* + */:\n    case 0x2C/* , */:\n    case 0x2D/* - */:\n    case 0x2E/* . */:\n    case 0x2F/* / */:\n    case 0x3A/* : */:\n    case 0x3B/* ; */:\n    case 0x3C/* < */:\n    case 0x3D/* = */:\n    case 0x3E/* > */:\n    case 0x3F/* ? */:\n    case 0x40/* @ */:\n    case 0x5B/* [ */:\n    case 0x5C/* \\ */:\n    case 0x5D/* ] */:\n    case 0x5E/* ^ */:\n    case 0x5F/* _ */:\n    case 0x60/* ` */:\n    case 0x7B/* { */:\n    case 0x7C/* | */:\n    case 0x7D/* } */:\n    case 0x7E/* ~ */:\n      return true;\n    default:\n      return false;\n  }\n}\n\n// Hepler to unify [reference labels].\n//\nfunction normalizeReference(str) {\n  // use .toUpperCase() instead of .toLowerCase()\n  // here to avoid a conflict with Object.prototype\n  // members (most notably, `__proto__`)\n  return str.trim().replace(/\\s+/g, ' ').toUpperCase();\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\n// Re-export libraries commonly used in both markdown-it and its plugins,\n// so plugins won't have to depend on them explicitly, which reduces their\n// bundled size (e.g. a browser build).\n//\nexports.lib                 = {};\nexports.lib.mdurl           = require('mdurl');\nexports.lib.ucmicro         = require('uc.micro');\n\nexports.assign              = assign;\nexports.isString            = isString;\nexports.has                 = has;\nexports.unescapeMd          = unescapeMd;\nexports.unescapeAll         = unescapeAll;\nexports.isValidEntityCode   = isValidEntityCode;\nexports.fromCodePoint       = fromCodePoint;\n// exports.replaceEntities     = replaceEntities;\nexports.escapeHtml          = escapeHtml;\nexports.arrayReplaceAt      = arrayReplaceAt;\nexports.isSpace             = isSpace;\nexports.isWhiteSpace        = isWhiteSpace;\nexports.isMdAsciiPunct      = isMdAsciiPunct;\nexports.isPunctChar         = isPunctChar;\nexports.escapeRE            = escapeRE;\nexports.normalizeReference  = normalizeReference;\n","// This file defines a number of table-related commands.\n\nimport {TextSelection} from \"prosemirror-state\"\nimport {Fragment} from \"prosemirror-model\"\n\nimport {Rect, TableMap} from \"./tablemap\"\nimport {CellSelection} from \"./cellselection\"\nimport {\n  addColSpan,\n  cellAround,\n  cellWrapping,\n  columnIsHeader,\n  isInTable,\n  moveCellForward,\n  removeColSpan,\n  selectionCell,\n  setAttr\n} from \"./util\"\nimport {tableNodeTypes} from \"./schema\"\n\n// Helper to get the selected rectangle in a table, if any. Adds table\n// map, table node, and table start offset to the object for\n// convenience.\nexport function selectedRect(state) {\n  let sel = state.selection, $pos = selectionCell(state)\n  let table = $pos.node(-1), tableStart = $pos.start(-1), map = TableMap.get(table)\n  let rect\n  if (sel instanceof CellSelection)\n    rect = map.rectBetween(sel.$anchorCell.pos - tableStart, sel.$headCell.pos - tableStart)\n  else\n    rect = map.findCell($pos.pos - tableStart)\n  rect.tableStart = tableStart\n  rect.map = map\n  rect.table = table\n  return rect\n}\n\n// Add a column at the given position in a table.\nexport function addColumn(tr, {map, tableStart, table}, col) {\n  let refColumn = col > 0 ? -1 : 0\n  if (columnIsHeader(map, table, col + refColumn))\n    refColumn = col == 0 || col == map.width ? null : 0\n\n  for (let row = 0; row < map.height; row++) {\n    let index = row * map.width + col\n    // If this position falls inside a col-spanning cell\n    if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {\n      let pos = map.map[index], cell = table.nodeAt(pos)\n      tr.setNodeMarkup(tr.mapping.map(tableStart + pos), null,\n                       addColSpan(cell.attrs, col - map.colCount(pos)))\n      // Skip ahead if rowspan > 1\n      row += cell.attrs.rowspan - 1\n    } else {\n      let type = refColumn == null ? tableNodeTypes(table.type.schema).cell\n          : table.nodeAt(map.map[index + refColumn]).type\n      let pos = map.positionAt(row, col, table)\n      tr.insert(tr.mapping.map(tableStart + pos), type.createAndFill())\n    }\n  }\n  return tr\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Command to add a column before the column with the selection.\nexport function addColumnBefore(state, dispatch) {\n  if (!isInTable(state)) return false\n  if (dispatch) {\n    let rect = selectedRect(state)\n    dispatch(addColumn(state.tr, rect, rect.left))\n  }\n  return true\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Command to add a column after the column with the selection.\nexport function addColumnAfter(state, dispatch) {\n  if (!isInTable(state)) return false\n  if (dispatch) {\n    let rect = selectedRect(state)\n    dispatch(addColumn(state.tr, rect, rect.right))\n  }\n  return true\n}\n\nexport function removeColumn(tr, {map, table, tableStart}, col) {\n  let mapStart = tr.mapping.maps.length\n  for (let row = 0; row < map.height;) {\n    let index = row * map.width + col, pos = map.map[index], cell = table.nodeAt(pos)\n    // If this is part of a col-spanning cell\n    if ((col > 0 && map.map[index - 1] == pos) || (col < map.width - 1 && map.map[index + 1] == pos)) {\n      tr.setNodeMarkup(tr.mapping.slice(mapStart).map(tableStart + pos), null,\n                       removeColSpan(cell.attrs, col - map.colCount(pos)))\n    } else {\n      let start = tr.mapping.slice(mapStart).map(tableStart + pos)\n      tr.delete(start, start + cell.nodeSize)\n    }\n    row += cell.attrs.rowspan\n  }\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Command function that removes the selected columns from a table.\nexport function deleteColumn(state, dispatch) {\n  if (!isInTable(state)) return false\n  if (dispatch) {\n    let rect = selectedRect(state), tr = state.tr\n    if (rect.left == 0 && rect.right == rect.map.width) return false\n    for (let i = rect.right - 1;; i--) {\n      removeColumn(tr, rect, i)\n      if (i == rect.left) break\n      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc\n      rect.map = TableMap.get(rect.table)\n    }\n    dispatch(tr)\n  }\n  return true\n}\n\nexport function rowIsHeader(map, table, row) {\n  let headerCell = tableNodeTypes(table.type.schema).header_cell\n  for (let col = 0; col < map.width; col++)\n    if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)\n      return false\n  return true\n}\n\nexport function addRow(tr, {map, tableStart, table}, row) {\n  let rowPos = tableStart\n  for (let i = 0; i < row; i++) rowPos += table.child(i).nodeSize\n  let cells = [], refRow = row > 0 ? -1 : 0\n  if (rowIsHeader(map, table, row + refRow))\n    refRow = row == 0 || row == map.height ? null : 0\n  for (let col = 0, index = map.width * row; col < map.width; col++, index++) {\n    // Covered by a rowspan cell\n    if (row > 0 && row < map.height && map.map[index] == map.map[index - map.width]) {\n      let pos = map.map[index], attrs = table.nodeAt(pos).attrs\n      tr.setNodeMarkup(tableStart + pos, null, setAttr(attrs, \"rowspan\", attrs.rowspan + 1))\n      col += attrs.colspan - 1\n    } else {\n      let type = refRow == null ? tableNodeTypes(table.type.schema).cell\n          : table.nodeAt(map.map[index + refRow * map.width]).type\n      cells.push(type.createAndFill())\n    }\n  }\n  tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells))\n  return tr\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Add a table row before the selection.\nexport function addRowBefore(state, dispatch) {\n  if (!isInTable(state)) return false\n  if (dispatch) {\n    let rect = selectedRect(state)\n    dispatch(addRow(state.tr, rect, rect.top))\n  }\n  return true\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Add a table row after the selection.\nexport function addRowAfter(state, dispatch) {\n  if (!isInTable(state)) return false\n  if (dispatch) {\n    let rect = selectedRect(state)\n    dispatch(addRow(state.tr, rect, rect.bottom))\n  }\n  return true\n}\n\nexport function removeRow(tr, {map, table, tableStart}, row) {\n  let rowPos = 0\n  for (let i = 0; i < row; i++) rowPos += table.child(i).nodeSize\n  let nextRow = rowPos + table.child(row).nodeSize\n\n  let mapFrom = tr.mapping.maps.length\n  tr.delete(rowPos + tableStart, nextRow + tableStart)\n\n  for (let col = 0, index = row * map.width; col < map.width; col++, index++) {\n    let pos = map.map[index]\n    if (row > 0 && pos == map.map[index - map.width]) {\n      // If this cell starts in the row above, simply reduce its rowspan\n      let attrs = table.nodeAt(pos).attrs\n      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + tableStart), null, setAttr(attrs, \"rowspan\", attrs.rowspan - 1))\n      col += attrs.colspan - 1\n    } else if (row < map.width && pos == map.map[index + map.width]) {\n      // Else, if it continues in the row below, it has to be moved down\n      let cell = table.nodeAt(pos)\n      let copy = cell.type.create(setAttr(cell.attrs, \"rowspan\", cell.attrs.rowspan - 1), cell.content)\n      let newPos = map.positionAt(row + 1, col, table)\n      tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy)\n      col += cell.attrs.colspan - 1\n    }\n  }\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Remove the selected rows from a table.\nexport function deleteRow(state, dispatch) {\n  if (!isInTable(state)) return false\n  if (dispatch) {\n    let rect = selectedRect(state), tr = state.tr\n    if (rect.top == 0 && rect.bottom == rect.map.height) return false\n    for (let i = rect.bottom - 1;; i--) {\n      removeRow(tr, rect, i)\n      if (i == rect.top) break\n      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc\n      rect.map = TableMap.get(rect.table)\n    }\n    dispatch(tr)\n  }\n  return true\n}\n\nfunction isEmpty(cell) {\n  let c = cell.content\n  return c.childCount == 1 && c.firstChild.isTextblock && c.firstChild.childCount == 0\n}\n\nfunction cellsOverlapRectangle({width, height, map}, rect) {\n  let indexTop = rect.top * width + rect.left, indexLeft = indexTop\n  let indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1)\n  for (let i = rect.top; i < rect.bottom; i++) {\n    if (rect.left > 0 && map[indexLeft] == map[indexLeft - 1] ||\n        rect.right < width && map[indexRight] == map[indexRight + 1]) return true\n    indexLeft += width; indexRight += width\n  }\n  for (let i = rect.left; i < rect.right; i++) {\n    if (rect.top > 0 && map[indexTop] == map[indexTop - width] ||\n        rect.bottom < height && map[indexBottom] == map[indexBottom + width]) return true\n    indexTop++; indexBottom++\n  }\n  return false\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Merge the selected cells into a single cell. Only available when\n// the selected cells' outline forms a rectangle.\nexport function mergeCells(state, dispatch) {\n  let sel = state.selection\n  if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos) return false\n  let rect = selectedRect(state), {map} = rect\n  if (cellsOverlapRectangle(map, rect)) return false\n  if (dispatch) {\n    let tr = state.tr, seen = {}, content = Fragment.empty, mergedPos, mergedCell\n    for (let row = rect.top; row < rect.bottom; row++) {\n      for (let col = rect.left; col < rect.right; col++) {\n        let cellPos = map.map[row * map.width + col], cell = rect.table.nodeAt(cellPos)\n        if (seen[cellPos]) continue\n        seen[cellPos] = true\n        if (mergedPos == null) {\n          mergedPos = cellPos\n          mergedCell = cell\n        } else {\n          if (!isEmpty(cell)) content = content.append(cell.content)\n          let mapped = tr.mapping.map(cellPos + rect.tableStart)\n          tr.delete(mapped, mapped + cell.nodeSize)\n        }\n      }\n    }\n    tr.setNodeMarkup(mergedPos + rect.tableStart, null,\n                     setAttr(addColSpan(mergedCell.attrs, mergedCell.attrs.colspan, (rect.right - rect.left) - mergedCell.attrs.colspan),\n                             \"rowspan\", rect.bottom - rect.top))\n    if (content.size) {\n      let end = mergedPos + 1 + mergedCell.content.size\n      let start = isEmpty(mergedCell) ? mergedPos + 1 : end\n      tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content)\n    }\n    tr.setSelection(new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart)))\n    dispatch(tr)\n  }\n  return true\n}\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Split a selected cell, whose rowpan or colspan is greater than one,\n// into smaller cells. Use the first cell type for the new cells.\nexport function splitCell(state, dispatch) {\n  const nodeTypes = tableNodeTypes(state.schema);\n  return splitCellWithType(({\n    node,\n  }) => {\n    return nodeTypes[node.type.spec.tableRole]\n  })(state, dispatch)\n}\n\n// :: (getCellType: ({ row: number, col: number, node: Node}) → NodeType) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Split a selected cell, whose rowpan or colspan is greater than one,\n// into smaller cells with the cell type (th, td) returned by getType function.\nexport function splitCellWithType(getCellType) {\n  return (state, dispatch) => {\n    let sel = state.selection\n    let cellNode, cellPos\n    if (!(sel instanceof CellSelection)) {\n      cellNode = cellWrapping(sel.$from)\n      if (!cellNode) return false\n      cellPos = cellAround(sel.$from).pos\n    } else {\n      if (sel.$anchorCell.pos != sel.$headCell.pos) return false\n      cellNode = sel.$anchorCell.nodeAfter\n      cellPos = sel.$anchorCell.pos\n    }\n    if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {return false}\n    if (dispatch) {\n      let baseAttrs = cellNode.attrs, attrs = [], colwidth = baseAttrs.colwidth\n      if (baseAttrs.rowspan > 1) baseAttrs = setAttr(baseAttrs, \"rowspan\", 1)\n      if (baseAttrs.colspan > 1) baseAttrs = setAttr(baseAttrs, \"colspan\", 1)\n      let rect = selectedRect(state), tr = state.tr\n      for (let i = 0; i < rect.right - rect.left; i++)\n        attrs.push(colwidth ? setAttr(baseAttrs, \"colwidth\", colwidth && colwidth[i] ? [colwidth[i]] : null) : baseAttrs)\n      let lastCell;\n      for (let row = rect.top; row < rect.bottom; row++) {\n        let pos = rect.map.positionAt(row, rect.left, rect.table)\n        if (row == rect.top) pos += cellNode.nodeSize\n        for (let col = rect.left, i = 0; col < rect.right; col++, i++) {\n          if (col == rect.left && row == rect.top) continue\n          tr.insert(lastCell = tr.mapping.map(pos + rect.tableStart, 1), getCellType({ node: cellNode, row, col}).createAndFill(attrs[i]))\n        }\n      }\n      tr.setNodeMarkup(cellPos, getCellType({ node: cellNode, row: rect.top, col: rect.left}), attrs[0])\n      if (sel instanceof CellSelection)\n        tr.setSelection(new CellSelection(tr.doc.resolve(sel.$anchorCell.pos),\n                                          lastCell && tr.doc.resolve(lastCell)))\n      dispatch(tr)\n    }\n    return true\n  }\n}\n\n// :: (string, any) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Returns a command that sets the given attribute to the given value,\n// and is only available when the currently selected cell doesn't\n// already have that attribute set to that value.\nexport function setCellAttr(name, value) {\n  return function(state, dispatch) {\n    if (!isInTable(state)) return false\n    let $cell = selectionCell(state)\n    if ($cell.nodeAfter.attrs[name] === value) return false\n    if (dispatch) {\n      let tr = state.tr\n      if (state.selection instanceof CellSelection)\n        state.selection.forEachCell((node, pos) => {\n          if (node.attrs[name] !== value)\n            tr.setNodeMarkup(pos, null, setAttr(node.attrs, name, value))\n        })\n      else\n        tr.setNodeMarkup($cell.pos, null, setAttr($cell.nodeAfter.attrs, name, value))\n      dispatch(tr)\n    }\n    return true\n  }\n}\n\nfunction deprecated_toggleHeader(type) {\n  return function(state, dispatch) {\n    if (!isInTable(state)) return false\n    if (dispatch) {\n      let types = tableNodeTypes(state.schema)\n      let rect = selectedRect(state), tr = state.tr\n      let cells = rect.map.cellsInRect(type == \"column\" ? new Rect(rect.left, 0, rect.right, rect.map.height) :\n                                       type == \"row\" ? new Rect(0, rect.top, rect.map.width, rect.bottom) : rect)\n      let nodes = cells.map(pos => rect.table.nodeAt(pos))\n      for (let i = 0; i < cells.length; i++) // Remove headers, if any\n        if (nodes[i].type == types.header_cell)\n          tr.setNodeMarkup(rect.tableStart + cells[i], types.cell, nodes[i].attrs)\n      if (tr.steps.length == 0) for (let i = 0; i < cells.length; i++) // No headers removed, add instead\n        tr.setNodeMarkup(rect.tableStart + cells[i], types.header_cell, nodes[i].attrs)\n      dispatch(tr)\n    }\n    return true\n  }\n}\n\nfunction isHeaderEnabledByType(type, rect, types) {\n  // Get cell positions for first row or first column\n  const cellPositions = rect.map.cellsInRect({\n    left: 0,\n    top: 0,\n    right: type == \"row\" ? rect.map.width : 1,\n    bottom: type == \"column\" ? rect.map.height : 1,\n  })\n\n  for (let i = 0; i < cellPositions.length; i++) {\n    const cell = rect.table.nodeAt(cellPositions[i])\n    if (cell && cell.type !== types.header_cell) {\n      return false\n    }\n  }\n\n  return true\n}\n\n// :: (string, ?{ useDeprecatedLogic: bool }) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles between row/column header and normal cells (Only applies to first row/column).\n// For deprecated behavior pass `useDeprecatedLogic` in options with true.\nexport function toggleHeader(type, options) {\n  options = options || { useDeprecatedLogic: false }\n\n  if (options.useDeprecatedLogic)\n    return deprecated_toggleHeader(type)\n\n  return function(state, dispatch) {\n    if (!isInTable(state)) return false\n    if (dispatch) {\n      let types = tableNodeTypes(state.schema)\n      let rect = selectedRect(state), tr = state.tr\n\n      let isHeaderRowEnabled = isHeaderEnabledByType(\"row\", rect, types)\n      let isHeaderColumnEnabled = isHeaderEnabledByType(\"column\", rect, types)\n\n      let isHeaderEnabled = type === \"column\" ? isHeaderRowEnabled :\n                            type === \"row\"    ? isHeaderColumnEnabled : false\n\n      let selectionStartsAt = isHeaderEnabled ? 1 : 0\n\n      let cellsRect = type == \"column\" ? new Rect(0, selectionStartsAt, 1, rect.map.height) :\n                      type == \"row\" ? new Rect(selectionStartsAt, 0, rect.map.width, 1) : rect\n\n      let newType = type == \"column\" ? isHeaderColumnEnabled ? types.cell : types.header_cell :\n                    type == \"row\" ? isHeaderRowEnabled ? types.cell : types.header_cell : types.cell\n\n      rect.map.cellsInRect(cellsRect).forEach(relativeCellPos => {\n        const cellPos = relativeCellPos + rect.tableStart\n        const cell = tr.doc.nodeAt(cellPos)\n\n        if (cell) {\n          tr.setNodeMarkup(cellPos, newType, cell.attrs)\n        }\n      })\n\n      dispatch(tr)\n    }\n    return true\n  }\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected row contains header cells.\nexport let toggleHeaderRow = toggleHeader(\"row\", { useDeprecatedLogic: true })\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected column contains header cells.\nexport let toggleHeaderColumn = toggleHeader(\"column\", { useDeprecatedLogic: true })\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected cells are header cells.\nexport let toggleHeaderCell = toggleHeader(\"cell\", { useDeprecatedLogic: true })\n\nfunction findNextCell($cell, dir) {\n  if (dir < 0) {\n    let before = $cell.nodeBefore\n    if (before) return $cell.pos - before.nodeSize\n    for (let row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {\n      let rowNode = $cell.node(-1).child(row)\n      if (rowNode.childCount) return rowEnd - 1 - rowNode.lastChild.nodeSize\n      rowEnd -= rowNode.nodeSize\n    }\n  } else {\n    if ($cell.index() < $cell.parent.childCount - 1) return $cell.pos + $cell.nodeAfter.nodeSize\n    let table = $cell.node(-1)\n    for (let row = $cell.indexAfter(-1), rowStart = $cell.after(); row < table.childCount; row++) {\n      let rowNode = table.child(row)\n      if (rowNode.childCount) return rowStart + 1\n      rowStart += rowNode.nodeSize\n    }\n  }\n}\n\n// :: (number) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Returns a command for selecting the next (direction=1) or previous\n// (direction=-1) cell in a table.\nexport function goToNextCell(direction) {\n  return function(state, dispatch) {\n    if (!isInTable(state)) return false\n    let cell = findNextCell(selectionCell(state), direction)\n    if (cell == null) return\n    if (dispatch) {\n      let $cell = state.doc.resolve(cell)\n      dispatch(state.tr.setSelection(TextSelection.between($cell, moveCellForward($cell))).scrollIntoView())\n    }\n    return true\n  }\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Deletes the table around the selection, if any.\nexport function deleteTable(state, dispatch) {\n  let $pos = state.selection.$anchor\n  for (let d = $pos.depth; d > 0; d--) {\n    let node = $pos.node(d)\n    if (node.type.spec.tableRole == \"table\") {\n      if (dispatch) dispatch(state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView())\n      return true\n    }\n  }\n  return false\n}\n","import { Selection } from 'prosemirror-state';\nimport { equalNodeType, isNodeSelection } from './helpers';\n\n// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}\n// Iterates over parent nodes, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.\n//\n// ```javascript\n// const predicate = node => node.type === schema.nodes.blockquote;\n// const parent = findParentNode(predicate)(selection);\n// ```\nexport const findParentNode = predicate => ({ $from }) =>\n  findParentNodeClosestToPos($from, predicate);\n\n// :: ($pos: ResolvedPos, predicate: (node: ProseMirrorNode) → boolean) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}\n// Iterates over parent nodes starting from the given `$pos`, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.\n//\n// ```javascript\n// const predicate = node => node.type === schema.nodes.blockquote;\n// const parent = findParentNodeClosestToPos(state.doc.resolve(5), predicate);\n// ```\nexport const findParentNodeClosestToPos = ($pos, predicate) => {\n  for (let i = $pos.depth; i > 0; i--) {\n    const node = $pos.node(i);\n    if (predicate(node)) {\n      return {\n        pos: i > 0 ? $pos.before(i) : 0,\n        start: $pos.start(i),\n        depth: i,\n        node\n      };\n    }\n  }\n};\n\n// :: (predicate: (node: ProseMirrorNode) → boolean, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node\n// Iterates over parent nodes, returning DOM reference of the closest node `predicate` returns truthy for.\n//\n// ```javascript\n// const domAtPos = view.domAtPos.bind(view);\n// const predicate = node => node.type === schema.nodes.table;\n// const parent = findParentDomRef(predicate, domAtPos)(selection); // <table>\n// ```\nexport const findParentDomRef = (predicate, domAtPos) => selection => {\n  const parent = findParentNode(predicate)(selection);\n  if (parent) {\n    return findDomRefAtPos(parent.pos, domAtPos);\n  }\n};\n\n// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → boolean\n// Checks if there's a parent node `predicate` returns truthy for.\n//\n// ```javascript\n// if (hasParentNode(node => node.type === schema.nodes.table)(selection)) {\n//   // ....\n// }\n// ```\nexport const hasParentNode = predicate => selection => {\n  return !!findParentNode(predicate)(selection);\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}\n// Iterates over parent nodes, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.\n//\n// ```javascript\n// const parent = findParentNodeOfType(schema.nodes.paragraph)(selection);\n// ```\nexport const findParentNodeOfType = nodeType => selection => {\n  return findParentNode(node => equalNodeType(nodeType, node))(selection);\n};\n\n// :: ($pos: ResolvedPos, nodeType: union<NodeType, [NodeType]>) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}\n// Iterates over parent nodes starting from the given `$pos`, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.\n//\n// ```javascript\n// const parent = findParentNodeOfTypeClosestToPos(state.doc.resolve(10), schema.nodes.paragraph);\n// ```\nexport const findParentNodeOfTypeClosestToPos = ($pos, nodeType) => {\n  return findParentNodeClosestToPos($pos, node =>\n    equalNodeType(nodeType, node)\n  );\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → boolean\n// Checks if there's a parent node of a given `nodeType`.\n//\n// ```javascript\n// if (hasParentNodeOfType(schema.nodes.table)(selection)) {\n//   // ....\n// }\n// ```\nexport const hasParentNodeOfType = nodeType => selection => {\n  return hasParentNode(node => equalNodeType(nodeType, node))(selection);\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node\n// Iterates over parent nodes, returning DOM reference of the closest node of a given `nodeType`.\n//\n// ```javascript\n// const domAtPos = view.domAtPos.bind(view);\n// const parent = findParentDomRefOfType(schema.nodes.codeBlock, domAtPos)(selection); // <pre>\n// ```\nexport const findParentDomRefOfType = (nodeType, domAtPos) => selection => {\n  return findParentDomRef(node => equalNodeType(nodeType, node), domAtPos)(\n    selection\n  );\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}\n// Returns a node of a given `nodeType` if it is selected. `start` points to the start position of the node, `pos` points directly before the node.\n//\n// ```javascript\n// const { extension, inlineExtension, bodiedExtension } = schema.nodes;\n// const selectedNode = findSelectedNodeOfType([\n//   extension,\n//   inlineExtension,\n//   bodiedExtension,\n// ])(selection);\n// ```\nexport const findSelectedNodeOfType = nodeType => selection => {\n  if (isNodeSelection(selection)) {\n    const { node, $from } = selection;\n    if (equalNodeType(nodeType, node)) {\n      return { node, pos: $from.pos, depth: $from.depth };\n    }\n  }\n};\n\n// :: (selection: Selection) → ?number\n// Returns position of the previous node.\n//\n// ```javascript\n// const pos = findPositionOfNodeBefore(tr.selection);\n// ```\nexport const findPositionOfNodeBefore = selection => {\n  const { nodeBefore } = selection.$from;\n  const maybeSelection = Selection.findFrom(selection.$from, -1);\n  if (maybeSelection && nodeBefore) {\n    // leaf node\n    const parent = findParentNodeOfType(nodeBefore.type)(maybeSelection);\n    if (parent) {\n      return parent.pos;\n    }\n    return maybeSelection.$from.pos;\n  }\n};\n\n// :: (position: number, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → dom.Node\n// Returns DOM reference of a node at a given `position`. If the node type is of type `TEXT_NODE` it will return the reference of the parent node.\n//\n// ```javascript\n// const domAtPos = view.domAtPos.bind(view);\n// const ref = findDomRefAtPos($from.pos, domAtPos);\n// ```\nexport const findDomRefAtPos = (position, domAtPos) => {\n  const dom = domAtPos(position);\n  const node = dom.node.childNodes[dom.offset];\n\n  if (dom.node.nodeType === Node.TEXT_NODE) {\n    return dom.node.parentNode;\n  }\n\n  if (!node || node.nodeType === Node.TEXT_NODE) {\n    return dom.node;\n  }\n\n  return node;\n};\n","import {Transform} from \"prosemirror-transform\"\nimport {Mark} from \"prosemirror-model\"\nimport {Selection} from \"./selection\"\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4\n\n// ::- An editor state transaction, which can be applied to a state to\n// create an updated state. Use\n// [`EditorState.tr`](#state.EditorState.tr) to create an instance.\n//\n// Transactions track changes to the document (they are a subclass of\n// [`Transform`](#transform.Transform)), but also other state changes,\n// like selection updates and adjustments of the set of [stored\n// marks](#state.EditorState.storedMarks). In addition, you can store\n// metadata properties in a transaction, which are extra pieces of\n// information that client code or plugins can use to describe what a\n// transacion represents, so that they can update their [own\n// state](#state.StateField) accordingly.\n//\n// The [editor view](#view.EditorView) uses a few metadata properties:\n// it will attach a property `\"pointer\"` with the value `true` to\n// selection transactions directly caused by mouse or touch input, and\n// a `\"uiEvent\"` property of that may be `\"paste\"`, `\"cut\"`, or `\"drop\"`.\nexport class Transaction extends Transform {\n  constructor(state) {\n    super(state.doc)\n    // :: number\n    // The timestamp associated with this transaction, in the same\n    // format as `Date.now()`.\n    this.time = Date.now()\n    this.curSelection = state.selection\n    // The step count for which the current selection is valid.\n    this.curSelectionFor = 0\n    // :: ?[Mark]\n    // The stored marks set by this transaction, if any.\n    this.storedMarks = state.storedMarks\n    // Bitfield to track which aspects of the state were updated by\n    // this transaction.\n    this.updated = 0\n    // Object used to store metadata properties for the transaction.\n    this.meta = Object.create(null)\n  }\n\n  // :: Selection\n  // The transaction's current selection. This defaults to the editor\n  // selection [mapped](#state.Selection.map) through the steps in the\n  // transaction, but can be overwritten with\n  // [`setSelection`](#state.Transaction.setSelection).\n  get selection() {\n    if (this.curSelectionFor < this.steps.length) {\n      this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor))\n      this.curSelectionFor = this.steps.length\n    }\n    return this.curSelection\n  }\n\n  // :: (Selection) → Transaction\n  // Update the transaction's current selection. Will determine the\n  // selection that the editor gets when the transaction is applied.\n  setSelection(selection) {\n    if (selection.$from.doc != this.doc)\n      throw new RangeError(\"Selection passed to setSelection must point at the current document\")\n    this.curSelection = selection\n    this.curSelectionFor = this.steps.length\n    this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS\n    this.storedMarks = null\n    return this\n  }\n\n  // :: bool\n  // Whether the selection was explicitly updated by this transaction.\n  get selectionSet() {\n    return (this.updated & UPDATED_SEL) > 0\n  }\n\n  // :: (?[Mark]) → Transaction\n  // Set the current stored marks.\n  setStoredMarks(marks) {\n    this.storedMarks = marks\n    this.updated |= UPDATED_MARKS\n    return this\n  }\n\n  // :: ([Mark]) → Transaction\n  // Make sure the current stored marks or, if that is null, the marks\n  // at the selection, match the given set of marks. Does nothing if\n  // this is already the case.\n  ensureMarks(marks) {\n    if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n      this.setStoredMarks(marks)\n    return this\n  }\n\n  // :: (Mark) → Transaction\n  // Add a mark to the set of stored marks.\n  addStoredMark(mark) {\n    return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()))\n  }\n\n  // :: (union<Mark, MarkType>) → Transaction\n  // Remove a mark or mark type from the set of stored marks.\n  removeStoredMark(mark) {\n    return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()))\n  }\n\n  // :: bool\n  // Whether the stored marks were explicitly set for this transaction.\n  get storedMarksSet() {\n    return (this.updated & UPDATED_MARKS) > 0\n  }\n\n  addStep(step, doc) {\n    super.addStep(step, doc)\n    this.updated = this.updated & ~UPDATED_MARKS\n    this.storedMarks = null\n  }\n\n  // :: (number) → Transaction\n  // Update the timestamp for the transaction.\n  setTime(time) {\n    this.time = time\n    return this\n  }\n\n  // :: (Slice) → Transaction\n  // Replace the current selection with the given slice.\n  replaceSelection(slice) {\n    this.selection.replace(this, slice)\n    return this\n  }\n\n  // :: (Node, ?bool) → Transaction\n  // Replace the selection with the given node. When `inheritMarks` is\n  // true and the content is inline, it inherits the marks from the\n  // place where it is inserted.\n  replaceSelectionWith(node, inheritMarks) {\n    let selection = this.selection\n    if (inheritMarks !== false)\n      node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)))\n    selection.replaceWith(this, node)\n    return this\n  }\n\n  // :: () → Transaction\n  // Delete the selection.\n  deleteSelection() {\n    this.selection.replace(this)\n    return this\n  }\n\n  // :: (string, from: ?number, to: ?number) → Transaction\n  // Replace the given range, or the selection if no range is given,\n  // with a text node containing the given string.\n  insertText(text, from, to = from) {\n    let schema = this.doc.type.schema\n    if (from == null) {\n      if (!text) return this.deleteSelection()\n      return this.replaceSelectionWith(schema.text(text), true)\n    } else {\n      if (!text) return this.deleteRange(from, to)\n      let marks = this.storedMarks\n      if (!marks) {\n        let $from = this.doc.resolve(from)\n        marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to))\n      }\n      this.replaceRangeWith(from, to, schema.text(text, marks))\n      if (!this.selection.empty) this.setSelection(Selection.near(this.selection.$to))\n      return this\n    }\n  }\n\n  // :: (union<string, Plugin, PluginKey>, any) → Transaction\n  // Store a metadata property in this transaction, keyed either by\n  // name or by plugin.\n  setMeta(key, value) {\n    this.meta[typeof key == \"string\" ? key : key.key] = value\n    return this\n  }\n\n  // :: (union<string, Plugin, PluginKey>) → any\n  // Retrieve a metadata property for a given name or plugin.\n  getMeta(key) {\n    return this.meta[typeof key == \"string\" ? key : key.key]\n  }\n\n  // :: bool\n  // Returns true if this transaction doesn't contain any metadata,\n  // and can thus safely be extended.\n  get isGeneric() {\n    for (let _ in this.meta) return false\n    return true\n  }\n\n  // :: () → Transaction\n  // Indicate that the editor should scroll the selection into view\n  // when updated to the state produced by this transaction.\n  scrollIntoView() {\n    this.updated |= UPDATED_SCROLL\n    return this\n  }\n\n  get scrolledIntoView() {\n    return (this.updated & UPDATED_SCROLL) > 0\n  }\n}\n","import {Node} from \"prosemirror-model\"\n\nimport {Selection} from \"./selection\"\nimport {Transaction} from \"./transaction\"\n\nfunction bind(f, self) {\n  return !self || !f ? f : f.bind(self)\n}\n\nclass FieldDesc {\n  constructor(name, desc, self) {\n    this.name = name\n    this.init = bind(desc.init, self)\n    this.apply = bind(desc.apply, self)\n  }\n}\n\nconst baseFields = [\n  new FieldDesc(\"doc\", {\n    init(config) { return config.doc || config.schema.topNodeType.createAndFill() },\n    apply(tr) { return tr.doc }\n  }),\n\n  new FieldDesc(\"selection\", {\n    init(config, instance) { return config.selection || Selection.atStart(instance.doc) },\n    apply(tr) { return tr.selection }\n  }),\n\n  new FieldDesc(\"storedMarks\", {\n    init(config) { return config.storedMarks || null },\n    apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }\n  }),\n\n  new FieldDesc(\"scrollToSelection\", {\n    init() { return 0 },\n    apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev }\n  })\n]\n\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n  constructor(schema, plugins) {\n    this.schema = schema\n    this.fields = baseFields.concat()\n    this.plugins = []\n    this.pluginsByKey = Object.create(null)\n    if (plugins) plugins.forEach(plugin => {\n      if (this.pluginsByKey[plugin.key])\n        throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\")\n      this.plugins.push(plugin)\n      this.pluginsByKey[plugin.key] = plugin\n      if (plugin.spec.state)\n        this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin))\n    })\n  }\n}\n\n// ::- The state of a ProseMirror editor is represented by an object\n// of this type. A state is a persistent data structure—it isn't\n// updated, but rather a new state value is computed from an old one\n// using the [`apply`](#state.EditorState.apply) method.\n//\n// A state holds a number of built-in fields, and plugins can\n// [define](#state.PluginSpec.state) additional fields.\nexport class EditorState {\n  constructor(config) {\n    this.config = config\n  }\n\n  // doc:: Node\n  // The current document.\n\n  // selection:: Selection\n  // The selection.\n\n  // storedMarks:: ?[Mark]\n  // A set of marks to apply to the next input. Will be null when\n  // no explicit marks have been set.\n\n  // :: Schema\n  // The schema of the state's document.\n  get schema() {\n    return this.config.schema\n  }\n\n  // :: [Plugin]\n  // The plugins that are active in this state.\n  get plugins() {\n    return this.config.plugins\n  }\n\n  // :: (Transaction) → EditorState\n  // Apply the given transaction to produce a new state.\n  apply(tr) {\n    return this.applyTransaction(tr).state\n  }\n\n  // : (Transaction) → bool\n  filterTransaction(tr, ignore = -1) {\n    for (let i = 0; i < this.config.plugins.length; i++) if (i != ignore) {\n      let plugin = this.config.plugins[i]\n      if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n        return false\n    }\n    return true\n  }\n\n  // :: (Transaction) → {state: EditorState, transactions: [Transaction]}\n  // Verbose variant of [`apply`](#state.EditorState.apply) that\n  // returns the precise transactions that were applied (which might\n  // be influenced by the [transaction\n  // hooks](#state.PluginSpec.filterTransaction) of\n  // plugins) along with the new state.\n  applyTransaction(rootTr) {\n    if (!this.filterTransaction(rootTr)) return {state: this, transactions: []}\n\n    let trs = [rootTr], newState = this.applyInner(rootTr), seen = null\n    // This loop repeatedly gives plugins a chance to respond to\n    // transactions as new transactions are added, making sure to only\n    // pass the transactions the plugin did not see before.\n    outer: for (;;) {\n      let haveNew = false\n      for (let i = 0; i < this.config.plugins.length; i++) {\n        let plugin = this.config.plugins[i]\n        if (plugin.spec.appendTransaction) {\n          let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this\n          let tr = n < trs.length &&\n              plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState)\n          if (tr && newState.filterTransaction(tr, i)) {\n            tr.setMeta(\"appendedTransaction\", rootTr)\n            if (!seen) {\n              seen = []\n              for (let j = 0; j < this.config.plugins.length; j++)\n                seen.push(j < i ? {state: newState, n: trs.length} : {state: this, n: 0})\n            }\n            trs.push(tr)\n            newState = newState.applyInner(tr)\n            haveNew = true\n          }\n          if (seen) seen[i] = {state: newState, n: trs.length}\n        }\n      }\n      if (!haveNew) return {state: newState, transactions: trs}\n    }\n  }\n\n  // : (Transaction) → EditorState\n  applyInner(tr) {\n    if (!tr.before.eq(this.doc)) throw new RangeError(\"Applying a mismatched transaction\")\n    let newInstance = new EditorState(this.config), fields = this.config.fields\n    for (let i = 0; i < fields.length; i++) {\n      let field = fields[i]\n      newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance)\n    }\n    for (let i = 0; i < applyListeners.length; i++) applyListeners[i](this, tr, newInstance)\n    return newInstance\n  }\n\n  // :: Transaction\n  // Start a [transaction](#state.Transaction) from this state.\n  get tr() { return new Transaction(this) }\n\n  // :: (Object) → EditorState\n  // Create a new state.\n  //\n  //   config::- Configuration options. Must contain `schema` or `doc` (or both).\n  //\n  //      schema:: ?Schema\n  //      The schema to use.\n  //\n  //      doc:: ?Node\n  //      The starting document.\n  //\n  //      selection:: ?Selection\n  //      A valid selection in the document.\n  //\n  //      storedMarks:: ?[Mark]\n  //      The initial set of [stored marks](#state.EditorState.storedMarks).\n  //\n  //      plugins:: ?[Plugin]\n  //      The plugins that should be active in this state.\n  static create(config) {\n    let $config = new Configuration(config.schema || config.doc.type.schema, config.plugins)\n    let instance = new EditorState($config)\n    for (let i = 0; i < $config.fields.length; i++)\n      instance[$config.fields[i].name] = $config.fields[i].init(config, instance)\n    return instance\n  }\n\n  // :: (Object) → EditorState\n  // Create a new state based on this one, but with an adjusted set of\n  // active plugins. State fields that exist in both sets of plugins\n  // are kept unchanged. Those that no longer exist are dropped, and\n  // those that are new are initialized using their\n  // [`init`](#state.StateField.init) method, passing in the new\n  // configuration object..\n  //\n  //   config::- configuration options\n  //\n  //     schema:: ?Schema\n  //     New schema to use.\n  //\n  //     plugins:: ?[Plugin]\n  //     New set of active plugins.\n  reconfigure(config) {\n    let $config = new Configuration(config.schema || this.schema, config.plugins)\n    let fields = $config.fields, instance = new EditorState($config)\n    for (let i = 0; i < fields.length; i++) {\n      let name = fields[i].name\n      instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance)\n    }\n    return instance\n  }\n\n  // :: (?union<Object<Plugin>, string, number>) → Object\n  // Serialize this state to JSON. If you want to serialize the state\n  // of plugins, pass an object mapping property names to use in the\n  // resulting JSON object to plugin objects. The argument may also be\n  // a string or number, in which case it is ignored, to support the\n  // way `JSON.stringify` calls `toString` methods.\n  toJSON(pluginFields) {\n    let result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()}\n    if (this.storedMarks) result.storedMarks = this.storedMarks.map(m => m.toJSON())\n    if (pluginFields && typeof pluginFields == 'object') for (let prop in pluginFields) {\n      if (prop == \"doc\" || prop == \"selection\")\n        throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\")\n      let plugin = pluginFields[prop], state = plugin.spec.state\n      if (state && state.toJSON) result[prop] = state.toJSON.call(plugin, this[plugin.key])\n    }\n    return result\n  }\n\n  // :: (Object, Object, ?Object<Plugin>) → EditorState\n  // Deserialize a JSON representation of a state. `config` should\n  // have at least a `schema` field, and should contain array of\n  // plugins to initialize the state with. `pluginFields` can be used\n  // to deserialize the state of plugins, by associating plugin\n  // instances with the property names they use in the JSON object.\n  //\n  //   config::- configuration options\n  //\n  //     schema:: Schema\n  //     The schema to use.\n  //\n  //     plugins:: ?[Plugin]\n  //     The set of active plugins.\n  static fromJSON(config, json, pluginFields) {\n    if (!json) throw new RangeError(\"Invalid input for EditorState.fromJSON\")\n    if (!config.schema) throw new RangeError(\"Required config field 'schema' missing\")\n    let $config = new Configuration(config.schema, config.plugins)\n    let instance = new EditorState($config)\n    $config.fields.forEach(field => {\n      if (field.name == \"doc\") {\n        instance.doc = Node.fromJSON(config.schema, json.doc)\n      } else if (field.name == \"selection\") {\n        instance.selection = Selection.fromJSON(instance.doc, json.selection)\n      } else if (field.name == \"storedMarks\") {\n        if (json.storedMarks) instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON)\n      } else {\n        if (pluginFields) for (let prop in pluginFields) {\n          let plugin = pluginFields[prop], state = plugin.spec.state\n          if (plugin.key == field.name && state && state.fromJSON &&\n              Object.prototype.hasOwnProperty.call(json, prop)) {\n            // This field belongs to a plugin mapped to a JSON field, read it from there.\n            instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance)\n            return\n          }\n        }\n        instance[field.name] = field.init(config, instance)\n      }\n    })\n    return instance\n  }\n\n  // Kludge to allow the view to track mappings between different\n  // instances of a state.\n  //\n  // FIXME this is no longer needed as of prosemirror-view 1.9.0,\n  // though due to backwards-compat we should probably keep it around\n  // for a while (if only as a no-op)\n  static addApplyListener(f) {\n    applyListeners.push(f)\n  }\n  static removeApplyListener(f) {\n    let found = applyListeners.indexOf(f)\n    if (found > -1) applyListeners.splice(found, 1)\n  }\n}\n\nconst applyListeners = []\n","// PluginSpec:: interface\n//\n// This is the type passed to the [`Plugin`](#state.Plugin)\n// constructor. It provides a definition for a plugin.\n//\n//   props:: ?EditorProps\n//   The [view props](#view.EditorProps) added by this plugin. Props\n//   that are functions will be bound to have the plugin instance as\n//   their `this` binding.\n//\n//   state:: ?StateField<any>\n//   Allows a plugin to define a [state field](#state.StateField), an\n//   extra slot in the state object in which it can keep its own data.\n//\n//   key:: ?PluginKey\n//   Can be used to make this a keyed plugin. You can have only one\n//   plugin with a given key in a given state, but it is possible to\n//   access the plugin's configuration and state through the key,\n//   without having access to the plugin instance object.\n//\n//   view:: ?(EditorView) → Object\n//   When the plugin needs to interact with the editor view, or\n//   set something up in the DOM, use this field. The function\n//   will be called when the plugin's state is associated with an\n//   editor view.\n//\n//     return::-\n//     Should return an object with the following optional\n//     properties:\n//\n//       update:: ?(view: EditorView, prevState: EditorState)\n//       Called whenever the view's state is updated.\n//\n//       destroy:: ?()\n//       Called when the view is destroyed or receives a state\n//       with different plugins.\n//\n//   filterTransaction:: ?(Transaction, EditorState) → bool\n//   When present, this will be called before a transaction is\n//   applied by the state, allowing the plugin to cancel it (by\n//   returning false).\n//\n//   appendTransaction:: ?(transactions: [Transaction], oldState: EditorState, newState: EditorState) → ?Transaction\n//   Allows the plugin to append another transaction to be applied\n//   after the given array of transactions. When another plugin\n//   appends a transaction after this was called, it is called again\n//   with the new state and new transactions—but only the new\n//   transactions, i.e. it won't be passed transactions that it\n//   already saw.\n\nfunction bindProps(obj, self, target) {\n  for (let prop in obj) {\n    let val = obj[prop]\n    if (val instanceof Function) val = val.bind(self)\n    else if (prop == \"handleDOMEvents\") val = bindProps(val, self, {})\n    target[prop] = val\n  }\n  return target\n}\n\n// ::- Plugins bundle functionality that can be added to an editor.\n// They are part of the [editor state](#state.EditorState) and\n// may influence that state and the view that contains it.\nexport class Plugin {\n  // :: (PluginSpec)\n  // Create a plugin.\n  constructor(spec) {\n    // :: EditorProps\n    // The [props](#view.EditorProps) exported by this plugin.\n    this.props = {}\n    if (spec.props) bindProps(spec.props, this, this.props)\n    // :: Object\n    // The plugin's [spec object](#state.PluginSpec).\n    this.spec = spec\n    this.key = spec.key ? spec.key.key : createKey(\"plugin\")\n  }\n\n  // :: (EditorState) → any\n  // Extract the plugin's state field from an editor state.\n  getState(state) { return state[this.key] }\n}\n\n// StateField:: interface<T>\n// A plugin spec may provide a state field (under its\n// [`state`](#state.PluginSpec.state) property) of this type, which\n// describes the state it wants to keep. Functions provided here are\n// always called with the plugin instance as their `this` binding.\n//\n//   init:: (config: Object, instance: EditorState) → T\n//   Initialize the value of the field. `config` will be the object\n//   passed to [`EditorState.create`](#state.EditorState^create). Note\n//   that `instance` is a half-initialized state instance, and will\n//   not have values for plugin fields initialized after this one.\n//\n//   apply:: (tr: Transaction, value: T, oldState: EditorState, newState: EditorState) → T\n//   Apply the given transaction to this state field, producing a new\n//   field value. Note that the `newState` argument is again a partially\n//   constructed state does not yet contain the state from plugins\n//   coming after this one.\n//\n//   toJSON:: ?(value: T) → *\n//   Convert this field to JSON. Optional, can be left off to disable\n//   JSON serialization for the field.\n//\n//   fromJSON:: ?(config: Object, value: *, state: EditorState) → T\n//   Deserialize the JSON representation of this field. Note that the\n//   `state` argument is again a half-initialized state.\n\nconst keys = Object.create(null)\n\nfunction createKey(name) {\n  if (name in keys) return name + \"$\" + ++keys[name]\n  keys[name] = 0\n  return name + \"$\"\n}\n\n// ::- A key is used to [tag](#state.PluginSpec.key)\n// plugins in a way that makes it possible to find them, given an\n// editor state. Assigning a key does mean only one plugin of that\n// type can be active in a state.\nexport class PluginKey {\n  // :: (?string)\n  // Create a plugin key.\n  constructor(name = \"key\") { this.key = createKey(name) }\n\n  // :: (EditorState) → ?Plugin\n  // Get the active plugin with this key, if any, from an editor\n  // state.\n  get(state) { return state.config.pluginsByKey[this.key] }\n\n  // :: (EditorState) → ?any\n  // Get the plugin's state from an editor state.\n  getState(state) { return state[this.key] }\n}\n","// ::- Persistent data structure representing an ordered mapping from\n// strings to values, with some convenient update methods.\nfunction OrderedMap(content) {\n  this.content = content;\n}\n\nOrderedMap.prototype = {\n  constructor: OrderedMap,\n\n  find: function(key) {\n    for (var i = 0; i < this.content.length; i += 2)\n      if (this.content[i] === key) return i\n    return -1\n  },\n\n  // :: (string) → ?any\n  // Retrieve the value stored under `key`, or return undefined when\n  // no such key exists.\n  get: function(key) {\n    var found = this.find(key);\n    return found == -1 ? undefined : this.content[found + 1]\n  },\n\n  // :: (string, any, ?string) → OrderedMap\n  // Create a new map by replacing the value of `key` with a new\n  // value, or adding a binding to the end of the map. If `newKey` is\n  // given, the key of the binding will be replaced with that key.\n  update: function(key, value, newKey) {\n    var self = newKey && newKey != key ? this.remove(newKey) : this;\n    var found = self.find(key), content = self.content.slice();\n    if (found == -1) {\n      content.push(newKey || key, value);\n    } else {\n      content[found + 1] = value;\n      if (newKey) content[found] = newKey;\n    }\n    return new OrderedMap(content)\n  },\n\n  // :: (string) → OrderedMap\n  // Return a map with the given key removed, if it existed.\n  remove: function(key) {\n    var found = this.find(key);\n    if (found == -1) return this\n    var content = this.content.slice();\n    content.splice(found, 2);\n    return new OrderedMap(content)\n  },\n\n  // :: (string, any) → OrderedMap\n  // Add a new key to the start of the map.\n  addToStart: function(key, value) {\n    return new OrderedMap([key, value].concat(this.remove(key).content))\n  },\n\n  // :: (string, any) → OrderedMap\n  // Add a new key to the end of the map.\n  addToEnd: function(key, value) {\n    var content = this.remove(key).content.slice();\n    content.push(key, value);\n    return new OrderedMap(content)\n  },\n\n  // :: (string, string, any) → OrderedMap\n  // Add a key after the given key. If `place` is not found, the new\n  // key is added to the end.\n  addBefore: function(place, key, value) {\n    var without = this.remove(key), content = without.content.slice();\n    var found = without.find(place);\n    content.splice(found == -1 ? content.length : found, 0, key, value);\n    return new OrderedMap(content)\n  },\n\n  // :: ((key: string, value: any))\n  // Call the given function for each key/value pair in the map, in\n  // order.\n  forEach: function(f) {\n    for (var i = 0; i < this.content.length; i += 2)\n      f(this.content[i], this.content[i + 1]);\n  },\n\n  // :: (union<Object, OrderedMap>) → OrderedMap\n  // Create a new map by prepending the keys in this map that don't\n  // appear in `map` before the keys in `map`.\n  prepend: function(map) {\n    map = OrderedMap.from(map);\n    if (!map.size) return this\n    return new OrderedMap(map.content.concat(this.subtract(map).content))\n  },\n\n  // :: (union<Object, OrderedMap>) → OrderedMap\n  // Create a new map by appending the keys in this map that don't\n  // appear in `map` after the keys in `map`.\n  append: function(map) {\n    map = OrderedMap.from(map);\n    if (!map.size) return this\n    return new OrderedMap(this.subtract(map).content.concat(map.content))\n  },\n\n  // :: (union<Object, OrderedMap>) → OrderedMap\n  // Create a map containing all the keys in this map that don't\n  // appear in `map`.\n  subtract: function(map) {\n    var result = this;\n    map = OrderedMap.from(map);\n    for (var i = 0; i < map.content.length; i += 2)\n      result = result.remove(map.content[i]);\n    return result\n  },\n\n  // :: number\n  // The amount of keys in this map.\n  get size() {\n    return this.content.length >> 1\n  }\n};\n\n// :: (?union<Object, OrderedMap>) → OrderedMap\n// Return a map with the given content. If null, create an empty\n// map. If given an ordered map, return that map itself. If given an\n// object, create a map from the object's properties.\nOrderedMap.from = function(value) {\n  if (value instanceof OrderedMap) return value\n  var content = [];\n  if (value) for (var prop in value) content.push(prop, value[prop]);\n  return new OrderedMap(content)\n};\n\nvar orderedmap = OrderedMap;\n\nexport default orderedmap;\n","import {findDiffStart, findDiffEnd} from \"./diff\"\n\n// ::- A fragment represents a node's collection of child nodes.\n//\n// Like nodes, fragments are persistent data structures, and you\n// should not mutate them or their content. Rather, you create new\n// instances whenever needed. The API tries to make this easy.\nexport class Fragment {\n  constructor(content, size) {\n    this.content = content\n    // :: number\n    // The size of the fragment, which is the total of the size of its\n    // content nodes.\n    this.size = size || 0\n    if (size == null) for (let i = 0; i < content.length; i++)\n      this.size += content[i].nodeSize\n  }\n\n  // :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)\n  // Invoke a callback for all descendant nodes between the given two\n  // positions (relative to start of this fragment). Doesn't descend\n  // into a node when the callback returns `false`.\n  nodesBetween(from, to, f, nodeStart = 0, parent) {\n    for (let i = 0, pos = 0; pos < to; i++) {\n      let child = this.content[i], end = pos + child.nodeSize\n      if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {\n        let start = pos + 1\n        child.nodesBetween(Math.max(0, from - start),\n                           Math.min(child.content.size, to - start),\n                           f, nodeStart + start)\n      }\n      pos = end\n    }\n  }\n\n  // :: ((node: Node, pos: number, parent: Node) → ?bool)\n  // Call the given callback for every descendant node. The callback\n  // may return `false` to prevent traversal of a given node's children.\n  descendants(f) {\n    this.nodesBetween(0, this.size, f)\n  }\n\n  // : (number, number, ?string, ?string) → string\n  textBetween(from, to, blockSeparator, leafText) {\n    let text = \"\", separated = true\n    this.nodesBetween(from, to, (node, pos) => {\n      if (node.isText) {\n        text += node.text.slice(Math.max(from, pos) - pos, to - pos)\n        separated = !blockSeparator\n      } else if (node.isLeaf && leafText) {\n        text += leafText\n        separated = !blockSeparator\n      } else if (!separated && node.isBlock) {\n        text += blockSeparator\n        separated = true\n      }\n    }, 0)\n    return text\n  }\n\n  // :: (Fragment) → Fragment\n  // Create a new fragment containing the combined content of this\n  // fragment and the other.\n  append(other) {\n    if (!other.size) return this\n    if (!this.size) return other\n    let last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0\n    if (last.isText && last.sameMarkup(first)) {\n      content[content.length - 1] = last.withText(last.text + first.text)\n      i = 1\n    }\n    for (; i < other.content.length; i++) content.push(other.content[i])\n    return new Fragment(content, this.size + other.size)\n  }\n\n  // :: (number, ?number) → Fragment\n  // Cut out the sub-fragment between the two given positions.\n  cut(from, to) {\n    if (to == null) to = this.size\n    if (from == 0 && to == this.size) return this\n    let result = [], size = 0\n    if (to > from) for (let i = 0, pos = 0; pos < to; i++) {\n      let child = this.content[i], end = pos + child.nodeSize\n      if (end > from) {\n        if (pos < from || end > to) {\n          if (child.isText)\n            child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos))\n          else\n            child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1))\n        }\n        result.push(child)\n        size += child.nodeSize\n      }\n      pos = end\n    }\n    return new Fragment(result, size)\n  }\n\n  cutByIndex(from, to) {\n    if (from == to) return Fragment.empty\n    if (from == 0 && to == this.content.length) return this\n    return new Fragment(this.content.slice(from, to))\n  }\n\n  // :: (number, Node) → Fragment\n  // Create a new fragment in which the node at the given index is\n  // replaced by the given node.\n  replaceChild(index, node) {\n    let current = this.content[index]\n    if (current == node) return this\n    let copy = this.content.slice()\n    let size = this.size + node.nodeSize - current.nodeSize\n    copy[index] = node\n    return new Fragment(copy, size)\n  }\n\n  // : (Node) → Fragment\n  // Create a new fragment by prepending the given node to this\n  // fragment.\n  addToStart(node) {\n    return new Fragment([node].concat(this.content), this.size + node.nodeSize)\n  }\n\n  // : (Node) → Fragment\n  // Create a new fragment by appending the given node to this\n  // fragment.\n  addToEnd(node) {\n    return new Fragment(this.content.concat(node), this.size + node.nodeSize)\n  }\n\n  // :: (Fragment) → bool\n  // Compare this fragment to another one.\n  eq(other) {\n    if (this.content.length != other.content.length) return false\n    for (let i = 0; i < this.content.length; i++)\n      if (!this.content[i].eq(other.content[i])) return false\n    return true\n  }\n\n  // :: ?Node\n  // The first child of the fragment, or `null` if it is empty.\n  get firstChild() { return this.content.length ? this.content[0] : null }\n\n  // :: ?Node\n  // The last child of the fragment, or `null` if it is empty.\n  get lastChild() { return this.content.length ? this.content[this.content.length - 1] : null }\n\n  // :: number\n  // The number of child nodes in this fragment.\n  get childCount() { return this.content.length }\n\n  // :: (number) → Node\n  // Get the child node at the given index. Raise an error when the\n  // index is out of range.\n  child(index) {\n    let found = this.content[index]\n    if (!found) throw new RangeError(\"Index \" + index + \" out of range for \" + this)\n    return found\n  }\n\n  // :: (number) → ?Node\n  // Get the child node at the given index, if it exists.\n  maybeChild(index) {\n    return this.content[index]\n  }\n\n  // :: ((node: Node, offset: number, index: number))\n  // Call `f` for every child node, passing the node, its offset\n  // into this parent node, and its index.\n  forEach(f) {\n    for (let i = 0, p = 0; i < this.content.length; i++) {\n      let child = this.content[i]\n      f(child, p, i)\n      p += child.nodeSize\n    }\n  }\n\n  // :: (Fragment) → ?number\n  // Find the first position at which this fragment and another\n  // fragment differ, or `null` if they are the same.\n  findDiffStart(other, pos = 0) {\n    return findDiffStart(this, other, pos)\n  }\n\n  // :: (Fragment) → ?{a: number, b: number}\n  // Find the first position, searching from the end, at which this\n  // fragment and the given fragment differ, or `null` if they are the\n  // same. Since this position will not be the same in both nodes, an\n  // object with two separate positions is returned.\n  findDiffEnd(other, pos = this.size, otherPos = other.size) {\n    return findDiffEnd(this, other, pos, otherPos)\n  }\n\n  // : (number, ?number) → {index: number, offset: number}\n  // Find the index and inner offset corresponding to a given relative\n  // position in this fragment. The result object will be reused\n  // (overwritten) the next time the function is called. (Not public.)\n  findIndex(pos, round = -1) {\n    if (pos == 0) return retIndex(0, pos)\n    if (pos == this.size) return retIndex(this.content.length, pos)\n    if (pos > this.size || pos < 0) throw new RangeError(`Position ${pos} outside of fragment (${this})`)\n    for (let i = 0, curPos = 0;; i++) {\n      let cur = this.child(i), end = curPos + cur.nodeSize\n      if (end >= pos) {\n        if (end == pos || round > 0) return retIndex(i + 1, end)\n        return retIndex(i, curPos)\n      }\n      curPos = end\n    }\n  }\n\n  // :: () → string\n  // Return a debugging string that describes this fragment.\n  toString() { return \"<\" + this.toStringInner() + \">\" }\n\n  toStringInner() { return this.content.join(\", \") }\n\n  // :: () → ?Object\n  // Create a JSON-serializeable representation of this fragment.\n  toJSON() {\n    return this.content.length ? this.content.map(n => n.toJSON()) : null\n  }\n\n  // :: (Schema, ?Object) → Fragment\n  // Deserialize a fragment from its JSON representation.\n  static fromJSON(schema, value) {\n    if (!value) return Fragment.empty\n    if (!Array.isArray(value)) throw new RangeError(\"Invalid input for Fragment.fromJSON\")\n    return new Fragment(value.map(schema.nodeFromJSON))\n  }\n\n  // :: ([Node]) → Fragment\n  // Build a fragment from an array of nodes. Ensures that adjacent\n  // text nodes with the same marks are joined together.\n  static fromArray(array) {\n    if (!array.length) return Fragment.empty\n    let joined, size = 0\n    for (let i = 0; i < array.length; i++) {\n      let node = array[i]\n      size += node.nodeSize\n      if (i && node.isText && array[i - 1].sameMarkup(node)) {\n        if (!joined) joined = array.slice(0, i)\n        joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text)\n      } else if (joined) {\n        joined.push(node)\n      }\n    }\n    return new Fragment(joined || array, size)\n  }\n\n  // :: (?union<Fragment, Node, [Node]>) → Fragment\n  // Create a fragment from something that can be interpreted as a set\n  // of nodes. For `null`, it returns the empty fragment. For a\n  // fragment, the fragment itself. For a node or array of nodes, a\n  // fragment containing those nodes.\n  static from(nodes) {\n    if (!nodes) return Fragment.empty\n    if (nodes instanceof Fragment) return nodes\n    if (Array.isArray(nodes)) return this.fromArray(nodes)\n    if (nodes.attrs) return new Fragment([nodes], nodes.nodeSize)\n    throw new RangeError(\"Can not convert \" + nodes + \" to a Fragment\" +\n                         (nodes.nodesBetween ? \" (looks like multiple versions of prosemirror-model were loaded)\" : \"\"))\n  }\n}\n\nconst found = {index: 0, offset: 0}\nfunction retIndex(index, offset) {\n  found.index = index\n  found.offset = offset\n  return found\n}\n\n// :: Fragment\n// An empty fragment. Intended to be reused whenever a node doesn't\n// contain anything (rather than allocating a new empty fragment for\n// each leaf node).\nFragment.empty = new Fragment([], 0)\n","export function findDiffStart(a, b, pos) {\n  for (let i = 0;; i++) {\n    if (i == a.childCount || i == b.childCount)\n      return a.childCount == b.childCount ? null : pos\n\n    let childA = a.child(i), childB = b.child(i)\n    if (childA == childB) { pos += childA.nodeSize; continue }\n\n    if (!childA.sameMarkup(childB)) return pos\n\n    if (childA.isText && childA.text != childB.text) {\n      for (let j = 0; childA.text[j] == childB.text[j]; j++)\n        pos++\n      return pos\n    }\n    if (childA.content.size || childB.content.size) {\n      let inner = findDiffStart(childA.content, childB.content, pos + 1)\n      if (inner != null) return inner\n    }\n    pos += childA.nodeSize\n  }\n}\n\nexport function findDiffEnd(a, b, posA, posB) {\n  for (let iA = a.childCount, iB = b.childCount;;) {\n    if (iA == 0 || iB == 0)\n      return iA == iB ? null : {a: posA, b: posB}\n\n    let childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize\n    if (childA == childB) {\n      posA -= size; posB -= size\n      continue\n    }\n\n    if (!childA.sameMarkup(childB)) return {a: posA, b: posB}\n\n    if (childA.isText && childA.text != childB.text) {\n      let same = 0, minSize = Math.min(childA.text.length, childB.text.length)\n      while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {\n        same++; posA--; posB--\n      }\n      return {a: posA, b: posB}\n    }\n    if (childA.content.size || childB.content.size) {\n      let inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1)\n      if (inner) return inner\n    }\n    posA -= size; posB -= size\n  }\n}\n","export function compareDeep(a, b) {\n  if (a === b) return true\n  if (!(a && typeof a == \"object\") ||\n      !(b && typeof b == \"object\")) return false\n  let array = Array.isArray(a)\n  if (Array.isArray(b) != array) return false\n  if (array) {\n    if (a.length != b.length) return false\n    for (let i = 0; i < a.length; i++) if (!compareDeep(a[i], b[i])) return false\n  } else {\n    for (let p in a) if (!(p in b) || !compareDeep(a[p], b[p])) return false\n    for (let p in b) if (!(p in a)) return false\n  }\n  return true\n}\n","import {MarkType, Slice, Fragment} from \"prosemirror-model\"\n\nimport {Transform} from \"./transform\"\nimport {AddMarkStep, RemoveMarkStep} from \"./mark_step\"\nimport {ReplaceStep} from \"./replace_step\"\n\n// :: (number, number, Mark) → this\n// Add the given mark to the inline content between `from` and `to`.\nTransform.prototype.addMark = function(from, to, mark) {\n  let removed = [], added = [], removing = null, adding = null\n  this.doc.nodesBetween(from, to, (node, pos, parent) => {\n    if (!node.isInline) return\n    let marks = node.marks\n    if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n      let start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to)\n      let newSet = mark.addToSet(marks)\n\n      for (let i = 0; i < marks.length; i++) {\n        if (!marks[i].isInSet(newSet)) {\n          if (removing && removing.to == start && removing.mark.eq(marks[i]))\n            removing.to = end\n          else\n            removed.push(removing = new RemoveMarkStep(start, end, marks[i]))\n        }\n      }\n\n      if (adding && adding.to == start)\n        adding.to = end\n      else\n        added.push(adding = new AddMarkStep(start, end, mark))\n    }\n  })\n\n  removed.forEach(s => this.step(s))\n  added.forEach(s => this.step(s))\n  return this\n}\n\n// :: (number, number, ?union<Mark, MarkType>) → this\n// Remove marks from inline nodes between `from` and `to`. When `mark`\n// is a single mark, remove precisely that mark. When it is a mark type,\n// remove all marks of that type. When it is null, remove all marks of\n// any type.\nTransform.prototype.removeMark = function(from, to, mark = null) {\n  let matched = [], step = 0\n  this.doc.nodesBetween(from, to, (node, pos) => {\n    if (!node.isInline) return\n    step++\n    let toRemove = null\n    if (mark instanceof MarkType) {\n      let found = mark.isInSet(node.marks)\n      if (found) toRemove = [found]\n    } else if (mark) {\n      if (mark.isInSet(node.marks)) toRemove = [mark]\n    } else {\n      toRemove = node.marks\n    }\n    if (toRemove && toRemove.length) {\n      let end = Math.min(pos + node.nodeSize, to)\n      for (let i = 0; i < toRemove.length; i++) {\n        let style = toRemove[i], found\n        for (let j = 0; j < matched.length; j++) {\n          let m = matched[j]\n          if (m.step == step - 1 && style.eq(matched[j].style)) found = m\n        }\n        if (found) {\n          found.to = end\n          found.step = step\n        } else {\n          matched.push({style, from: Math.max(pos, from), to: end, step})\n        }\n      }\n    }\n  })\n  matched.forEach(m => this.step(new RemoveMarkStep(m.from, m.to, m.style)))\n  return this\n}\n\n// :: (number, NodeType, ?ContentMatch) → this\n// Removes all marks and nodes from the content of the node at `pos`\n// that don't match the given new parent node type. Accepts an\n// optional starting [content match](#model.ContentMatch) as third\n// argument.\nTransform.prototype.clearIncompatible = function(pos, parentType, match = parentType.contentMatch) {\n  let node = this.doc.nodeAt(pos)\n  let delSteps = [], cur = pos + 1\n  for (let i = 0; i < node.childCount; i++) {\n    let child = node.child(i), end = cur + child.nodeSize\n    let allowed = match.matchType(child.type, child.attrs)\n    if (!allowed) {\n      delSteps.push(new ReplaceStep(cur, end, Slice.empty))\n    } else {\n      match = allowed\n      for (let j = 0; j < child.marks.length; j++) if (!parentType.allowsMarkType(child.marks[j].type))\n        this.step(new RemoveMarkStep(cur, end, child.marks[j]))\n    }\n    cur = end\n  }\n  if (!match.validEnd) {\n    let fill = match.fillBefore(Fragment.empty, true)\n    this.replace(cur, cur, new Slice(fill, 0, 0))\n  }\n  for (let i = delSteps.length - 1; i >= 0; i--) this.step(delSteps[i])\n  return this\n}\n","import {Fragment, Slice} from \"prosemirror-model\"\n\nimport {ReplaceStep, ReplaceAroundStep} from \"./replace_step\"\nimport {Transform} from \"./transform\"\nimport {insertPoint} from \"./structure\"\n\n// :: (Node, number, ?number, ?Slice) → ?Step\n// ‘Fit’ a slice into a given position in the document, producing a\n// [step](#transform.Step) that inserts it. Will return null if\n// there's no meaningful way to insert the slice here, or inserting it\n// would be a no-op (an empty slice over an empty range).\nexport function replaceStep(doc, from, to = from, slice = Slice.empty) {\n  if (from == to && !slice.size) return null\n\n  let $from = doc.resolve(from), $to = doc.resolve(to)\n  // Optimization -- avoid work if it's obvious that it's not needed.\n  if (fitsTrivially($from, $to, slice)) return new ReplaceStep(from, to, slice)\n  return new Fitter($from, $to, slice).fit()\n}\n\n// :: (number, ?number, ?Slice) → this\n// Replace the part of the document between `from` and `to` with the\n// given `slice`.\nTransform.prototype.replace = function(from, to = from, slice = Slice.empty) {\n  let step = replaceStep(this.doc, from, to, slice)\n  if (step) this.step(step)\n  return this\n}\n\n// :: (number, number, union<Fragment, Node, [Node]>) → this\n// Replace the given range with the given content, which may be a\n// fragment, node, or array of nodes.\nTransform.prototype.replaceWith = function(from, to, content) {\n  return this.replace(from, to, new Slice(Fragment.from(content), 0, 0))\n}\n\n// :: (number, number) → this\n// Delete the content between the given positions.\nTransform.prototype.delete = function(from, to) {\n  return this.replace(from, to, Slice.empty)\n}\n\n// :: (number, union<Fragment, Node, [Node]>) → this\n// Insert the given content at the given position.\nTransform.prototype.insert = function(pos, content) {\n  return this.replaceWith(pos, pos, content)\n}\n\nfunction fitsTrivially($from, $to, slice) {\n  return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&\n    $from.parent.canReplace($from.index(), $to.index(), slice.content)\n}\n\n// Algorithm for 'placing' the elements of a slice into a gap:\n//\n// We consider the content of each node that is open to the left to be\n// independently placeable. I.e. in <p(\"foo\"), p(\"bar\")>, when the\n// paragraph on the left is open, \"foo\" can be placed (somewhere on\n// the left side of the replacement gap) independently from p(\"bar\").\n//\n// This class tracks the state of the placement progress in the\n// following properties:\n//\n//  - `frontier` holds a stack of `{type, match}` objects that\n//    represent the open side of the replacement. It starts at\n//    `$from`, then moves forward as content is placed, and is finally\n//    reconciled with `$to`.\n//\n//  - `unplaced` is a slice that represents the content that hasn't\n//    been placed yet.\n//\n//  - `placed` is a fragment of placed content. Its open-start value\n//    is implicit in `$from`, and its open-end value in `frontier`.\nclass Fitter {\n  constructor($from, $to, slice) {\n    this.$to = $to\n    this.$from = $from\n    this.unplaced = slice\n\n    this.frontier = []\n    for (let i = 0; i <= $from.depth; i++) {\n      let node = $from.node(i)\n      this.frontier.push({\n        type: node.type,\n        match: node.contentMatchAt($from.indexAfter(i))\n      })\n    }\n\n    this.placed = Fragment.empty\n    for (let i = $from.depth; i > 0; i--)\n      this.placed = Fragment.from($from.node(i).copy(this.placed))\n  }\n\n  get depth() { return this.frontier.length - 1 }\n\n  fit() {\n    // As long as there's unplaced content, try to place some of it.\n    // If that fails, either increase the open score of the unplaced\n    // slice, or drop nodes from it, and then try again.\n    while (this.unplaced.size) {\n      let fit = this.findFittable()\n      if (fit) this.placeNodes(fit)\n      else this.openMore() || this.dropNode()\n    }\n    // When there's inline content directly after the frontier _and_\n    // directly after `this.$to`, we must generate a `ReplaceAround`\n    // step that pulls that content into the node after the frontier.\n    // That means the fitting must be done to the end of the textblock\n    // node after `this.$to`, not `this.$to` itself.\n    let moveInline = this.mustMoveInline(), placedSize = this.placed.size - this.depth - this.$from.depth\n    let $from = this.$from, $to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline))\n    if (!$to) return null\n\n    // If closing to `$to` succeeded, create a step\n    let content = this.placed, openStart = $from.depth, openEnd = $to.depth\n    while (openStart && openEnd && content.childCount == 1) { // Normalize by dropping open parent nodes\n      content = content.firstChild.content\n      openStart--; openEnd--\n    }\n    let slice = new Slice(content, openStart, openEnd)\n    if (moveInline > -1)\n      return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize)\n    if (slice.size || $from.pos != this.$to.pos) // Don't generate no-op steps\n      return new ReplaceStep($from.pos, $to.pos, slice)\n  }\n\n  // Find a position on the start spine of `this.unplaced` that has\n  // content that can be moved somewhere on the frontier. Returns two\n  // depths, one for the slice and one for the frontier.\n  findFittable() {\n    // Only try wrapping nodes (pass 2) after finding a place without\n    // wrapping failed.\n    for (let pass = 1; pass <= 2; pass++) {\n      for (let sliceDepth = this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {\n        let fragment, parent\n        if (sliceDepth) {\n          parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild\n          fragment = parent.content\n        } else {\n          fragment = this.unplaced.content\n        }\n        let first = fragment.firstChild\n        for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {\n          let {type, match} = this.frontier[frontierDepth], wrap, inject\n          // In pass 1, if the next node matches, or there is no next\n          // node but the parents look compatible, we've found a\n          // place.\n          if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false))\n                            : type.compatibleContent(parent.type)))\n            return {sliceDepth, frontierDepth, parent, inject}\n          // In pass 2, look for a set of wrapping nodes that make\n          // `first` fit here.\n          else if (pass == 2 && first && (wrap = match.findWrapping(first.type)))\n            return {sliceDepth, frontierDepth, parent, wrap}\n          // Don't continue looking further up if the parent node\n          // would fit here.\n          if (parent && match.matchType(parent.type)) break\n        }\n      }\n    }\n  }\n\n  openMore() {\n    let {content, openStart, openEnd} = this.unplaced\n    let inner = contentAt(content, openStart)\n    if (!inner.childCount || inner.firstChild.isLeaf) return false\n    this.unplaced = new Slice(content, openStart + 1,\n                              Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0))\n    return true\n  }\n\n  dropNode() {\n    let {content, openStart, openEnd} = this.unplaced\n    let inner = contentAt(content, openStart)\n    if (inner.childCount <= 1 && openStart > 0) {\n      let openAtEnd = content.size - openStart <= openStart + inner.size\n      this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1,\n                                openAtEnd ? openStart - 1 : openEnd)\n    } else {\n      this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd)\n    }\n  }\n\n  // : ({sliceDepth: number, frontierDepth: number, parent: ?Node, wrap: ?[NodeType], inject: ?Fragment})\n  // Move content from the unplaced slice at `sliceDepth` to the\n  // frontier node at `frontierDepth`. Close that frontier node when\n  // applicable.\n  placeNodes({sliceDepth, frontierDepth, parent, inject, wrap}) {\n    while (this.depth > frontierDepth) this.closeFrontierNode()\n    if (wrap) for (let i = 0; i < wrap.length; i++) this.openFrontierNode(wrap[i])\n\n    let slice = this.unplaced, fragment = parent ? parent.content : slice.content\n    let openStart = slice.openStart - sliceDepth\n    let taken = 0, add = []\n    let {match, type} = this.frontier[frontierDepth]\n    if (inject) {\n      for (let i = 0; i < inject.childCount; i++) add.push(inject.child(i))\n      match = match.matchFragment(inject)\n    }\n    // Computes the amount of (end) open nodes at the end of the\n    // fragment. When 0, the parent is open, but no more. When\n    // negative, nothing is open.\n    let openEndCount = (fragment.size + sliceDepth) - (slice.content.size - slice.openEnd)\n    // Scan over the fragment, fitting as many child nodes as\n    // possible.\n    while (taken < fragment.childCount) {\n      let next = fragment.child(taken), matches = match.matchType(next.type)\n      if (!matches) break\n      taken++\n      if (taken > 1 || openStart == 0 || next.content.size) { // Drop empty open nodes\n        match = matches\n        add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0,\n                                taken == fragment.childCount ? openEndCount : -1))\n      }\n    }\n    let toEnd = taken == fragment.childCount\n    if (!toEnd) openEndCount = -1\n\n    this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add))\n    this.frontier[frontierDepth].match = match\n\n    // If the parent types match, and the entire node was moved, and\n    // it's not open, close this frontier node right away.\n    if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1)\n      this.closeFrontierNode()\n\n    // Add new frontier nodes for any open nodes at the end.\n    for (let i = 0, cur = fragment; i < openEndCount; i++) {\n      let node = cur.lastChild\n      this.frontier.push({type: node.type, match: node.contentMatchAt(node.childCount)})\n      cur = node.content\n    }\n\n    // Update `this.unplaced`. Drop the entire node from which we\n    // placed it we got to its end, otherwise just drop the placed\n    // nodes.\n    this.unplaced = !toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)\n      : sliceDepth == 0 ? Slice.empty\n      : new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1),\n                  sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1)\n  }\n\n  mustMoveInline() {\n    if (!this.$to.parent.isTextblock || this.$to.end() == this.$to.pos) return -1\n    let top = this.frontier[this.depth], level\n    if (!top.type.isTextblock || !contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||\n        (this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth)) return -1\n\n    let {depth} = this.$to, after = this.$to.after(depth)\n    while (depth > 1 && after == this.$to.end(--depth)) ++after\n    return after\n  }\n\n  findCloseLevel($to) {\n    scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {\n      let {match, type} = this.frontier[i]\n      let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1))\n      let fit = contentAfterFits($to, i, type, match, dropInner)\n      if (!fit) continue\n      for (let d = i - 1; d >= 0; d--) {\n        let {match, type} = this.frontier[d]\n        let matches = contentAfterFits($to, d, type, match, true)\n        if (!matches || matches.childCount) continue scan\n      }\n      return {depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to}\n    }\n  }\n\n  close($to) {\n    let close = this.findCloseLevel($to)\n    if (!close) return null\n\n    while (this.depth > close.depth) this.closeFrontierNode()\n    if (close.fit.childCount) this.placed = addToFragment(this.placed, close.depth, close.fit)\n    $to = close.move\n    for (let d = close.depth + 1; d <= $to.depth; d++) {\n      let node = $to.node(d), add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d))\n      this.openFrontierNode(node.type, node.attrs, add)\n    }\n    return $to\n  }\n\n  openFrontierNode(type, attrs, content) {\n    let top = this.frontier[this.depth]\n    top.match = top.match.matchType(type)\n    this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)))\n    this.frontier.push({type, match: type.contentMatch})\n  }\n\n  closeFrontierNode() {\n    let open = this.frontier.pop()\n    let add = open.match.fillBefore(Fragment.empty, true)\n    if (add.childCount) this.placed = addToFragment(this.placed, this.frontier.length, add)\n  }\n}\n\nfunction dropFromFragment(fragment, depth, count) {\n  if (depth == 0) return fragment.cutByIndex(count)\n  return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)))\n}\n\nfunction addToFragment(fragment, depth, content) {\n  if (depth == 0) return fragment.append(content)\n  return fragment.replaceChild(fragment.childCount - 1,\n                               fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)))\n}\n\nfunction contentAt(fragment, depth) {\n  for (let i = 0; i < depth; i++) fragment = fragment.firstChild.content\n  return fragment\n}\n\nfunction closeNodeStart(node, openStart, openEnd) {\n  if (openStart <= 0) return node\n  let frag = node.content\n  if (openStart > 1)\n    frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0))\n  if (openStart > 0) {\n    frag = node.type.contentMatch.fillBefore(frag).append(frag)\n    if (openEnd <= 0) frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true))\n  }\n  return node.copy(frag)\n}\n\nfunction contentAfterFits($to, depth, type, match, open) {\n  let node = $to.node(depth), index = open ? $to.indexAfter(depth) : $to.index(depth)\n  if (index == node.childCount && !type.compatibleContent(node.type)) return null\n  let fit = match.fillBefore(node.content, true, index)\n  return fit && !invalidMarks(type, node.content, index) ? fit : null\n}\n\nfunction invalidMarks(type, fragment, start) {\n  for (let i = start; i < fragment.childCount; i++)\n    if (!type.allowsMarks(fragment.child(i).marks)) return true\n  return false\n}\n\n// :: (number, number, Slice) → this\n// Replace a range of the document with a given slice, using `from`,\n// `to`, and the slice's [`openStart`](#model.Slice.openStart) property\n// as hints, rather than fixed start and end points. This method may\n// grow the replaced area or close open nodes in the slice in order to\n// get a fit that is more in line with WYSIWYG expectations, by\n// dropping fully covered parent nodes of the replaced region when\n// they are marked [non-defining](#model.NodeSpec.defining), or\n// including an open parent node from the slice that _is_ marked as\n// [defining](#model.NodeSpec.defining).\n//\n// This is the method, for example, to handle paste. The similar\n// [`replace`](#transform.Transform.replace) method is a more\n// primitive tool which will _not_ move the start and end of its given\n// range, and is useful in situations where you need more precise\n// control over what happens.\nTransform.prototype.replaceRange = function(from, to, slice) {\n  if (!slice.size) return this.deleteRange(from, to)\n\n  let $from = this.doc.resolve(from), $to = this.doc.resolve(to)\n  if (fitsTrivially($from, $to, slice))\n    return this.step(new ReplaceStep(from, to, slice))\n\n  let targetDepths = coveredDepths($from, this.doc.resolve(to))\n  // Can't replace the whole document, so remove 0 if it's present\n  if (targetDepths[targetDepths.length - 1] == 0) targetDepths.pop()\n  // Negative numbers represent not expansion over the whole node at\n  // that depth, but replacing from $from.before(-D) to $to.pos.\n  let preferredTarget = -($from.depth + 1)\n  targetDepths.unshift(preferredTarget)\n  // This loop picks a preferred target depth, if one of the covering\n  // depths is not outside of a defining node, and adds negative\n  // depths for any depth that has $from at its start and does not\n  // cross a defining node.\n  for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n    let spec = $from.node(d).type.spec\n    if (spec.defining || spec.isolating) break\n    if (targetDepths.indexOf(d) > -1) preferredTarget = d\n    else if ($from.before(d) == pos) targetDepths.splice(1, 0, -d)\n  }\n  // Try to fit each possible depth of the slice into each possible\n  // target depth, starting with the preferred depths.\n  let preferredTargetIndex = targetDepths.indexOf(preferredTarget)\n\n  let leftNodes = [], preferredDepth = slice.openStart\n  for (let content = slice.content, i = 0;; i++) {\n    let node = content.firstChild\n    leftNodes.push(node)\n    if (i == slice.openStart) break\n    content = node.content\n  }\n  // Back up if the node directly above openStart, or the node above\n  // that separated only by a non-defining textblock node, is defining.\n  if (preferredDepth > 0 && leftNodes[preferredDepth - 1].type.spec.defining &&\n      $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 1].type)\n    preferredDepth -= 1\n  else if (preferredDepth >= 2 && leftNodes[preferredDepth - 1].isTextblock && leftNodes[preferredDepth - 2].type.spec.defining &&\n           $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 2].type)\n    preferredDepth -= 2\n\n  for (let j = slice.openStart; j >= 0; j--) {\n    let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1)\n    let insert = leftNodes[openDepth]\n    if (!insert) continue\n    for (let i = 0; i < targetDepths.length; i++) {\n      // Loop over possible expansion levels, starting with the\n      // preferred one\n      let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length], expand = true\n      if (targetDepth < 0) { expand = false; targetDepth = -targetDepth }\n      let parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1)\n      if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n        return this.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,\n                            new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth),\n                                      openDepth, slice.openEnd))\n    }\n  }\n\n  let startSteps = this.steps.length\n  for (let i = targetDepths.length - 1; i >= 0; i--) {\n    this.replace(from, to, slice)\n    if (this.steps.length > startSteps) break\n    let depth = targetDepths[i]\n    if (i < 0) continue\n    from = $from.before(depth); to = $to.after(depth)\n  }\n  return this\n}\n\nfunction closeFragment(fragment, depth, oldOpen, newOpen, parent) {\n  if (depth < oldOpen) {\n    let first = fragment.firstChild\n    fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)))\n  }\n  if (depth > newOpen) {\n    let match = parent.contentMatchAt(0)\n    let start = match.fillBefore(fragment).append(fragment)\n    fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true))\n  }\n  return fragment\n}\n\n// :: (number, number, Node) → this\n// Replace the given range with a node, but use `from` and `to` as\n// hints, rather than precise positions. When from and to are the same\n// and are at the start or end of a parent node in which the given\n// node doesn't fit, this method may _move_ them out towards a parent\n// that does allow the given node to be placed. When the given range\n// completely covers a parent node, this method may completely replace\n// that parent node.\nTransform.prototype.replaceRangeWith = function(from, to, node) {\n  if (!node.isInline && from == to && this.doc.resolve(from).parent.content.size) {\n    let point = insertPoint(this.doc, from, node.type)\n    if (point != null) from = to = point\n  }\n  return this.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0))\n}\n\n// :: (number, number) → this\n// Delete the given range, expanding it to cover fully covered\n// parent nodes until a valid replace is found.\nTransform.prototype.deleteRange = function(from, to) {\n  let $from = this.doc.resolve(from), $to = this.doc.resolve(to)\n  let covered = coveredDepths($from, $to)\n  for (let i = 0; i < covered.length; i++) {\n    let depth = covered[i], last = i == covered.length - 1\n    if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n      return this.delete($from.start(depth), $to.end(depth))\n    if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))\n      return this.delete($from.before(depth), $to.after(depth))\n  }\n  for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {\n    if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)\n      return this.delete($from.before(d), to)\n  }\n  return this.delete(from, to)\n}\n\n// : (ResolvedPos, ResolvedPos) → [number]\n// Returns an array of all depths for which $from - $to spans the\n// whole content of the nodes at that depth.\nfunction coveredDepths($from, $to) {\n  let result = [], minDepth = Math.min($from.depth, $to.depth)\n  for (let d = minDepth; d >= 0; d--) {\n    let start = $from.start(d)\n    if (start < $from.pos - ($from.depth - d) ||\n        $to.end(d) > $to.pos + ($to.depth - d) ||\n        $from.node(d).type.spec.isolating ||\n        $to.node(d).type.spec.isolating) break\n    if (start == $to.start(d)) result.push(d)\n  }\n  return result\n}\n","import {Mark} from \"./mark\"\n\n// ::- You can [_resolve_](#model.Node.resolve) a position to get more\n// information about it. Objects of this class represent such a\n// resolved position, providing various pieces of context information,\n// and some helper methods.\n//\n// Throughout this interface, methods that take an optional `depth`\n// parameter will interpret undefined as `this.depth` and negative\n// numbers as `this.depth + value`.\nexport class ResolvedPos {\n  constructor(pos, path, parentOffset) {\n    // :: number The position that was resolved.\n    this.pos = pos\n    this.path = path\n    // :: number\n    // The number of levels the parent node is from the root. If this\n    // position points directly into the root node, it is 0. If it\n    // points into a top-level paragraph, 1, and so on.\n    this.depth = path.length / 3 - 1\n    // :: number The offset this position has into its parent node.\n    this.parentOffset = parentOffset\n  }\n\n  resolveDepth(val) {\n    if (val == null) return this.depth\n    if (val < 0) return this.depth + val\n    return val\n  }\n\n  // :: Node\n  // The parent node that the position points into. Note that even if\n  // a position points into a text node, that node is not considered\n  // the parent—text nodes are ‘flat’ in this model, and have no content.\n  get parent() { return this.node(this.depth) }\n\n  // :: Node\n  // The root node in which the position was resolved.\n  get doc() { return this.node(0) }\n\n  // :: (?number) → Node\n  // The ancestor node at the given level. `p.node(p.depth)` is the\n  // same as `p.parent`.\n  node(depth) { return this.path[this.resolveDepth(depth) * 3] }\n\n  // :: (?number) → number\n  // The index into the ancestor at the given level. If this points at\n  // the 3rd node in the 2nd paragraph on the top level, for example,\n  // `p.index(0)` is 1 and `p.index(1)` is 2.\n  index(depth) { return this.path[this.resolveDepth(depth) * 3 + 1] }\n\n  // :: (?number) → number\n  // The index pointing after this position into the ancestor at the\n  // given level.\n  indexAfter(depth) {\n    depth = this.resolveDepth(depth)\n    return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)\n  }\n\n  // :: (?number) → number\n  // The (absolute) position at the start of the node at the given\n  // level.\n  start(depth) {\n    depth = this.resolveDepth(depth)\n    return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1\n  }\n\n  // :: (?number) → number\n  // The (absolute) position at the end of the node at the given\n  // level.\n  end(depth) {\n    depth = this.resolveDepth(depth)\n    return this.start(depth) + this.node(depth).content.size\n  }\n\n  // :: (?number) → number\n  // The (absolute) position directly before the wrapping node at the\n  // given level, or, when `depth` is `this.depth + 1`, the original\n  // position.\n  before(depth) {\n    depth = this.resolveDepth(depth)\n    if (!depth) throw new RangeError(\"There is no position before the top-level node\")\n    return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]\n  }\n\n  // :: (?number) → number\n  // The (absolute) position directly after the wrapping node at the\n  // given level, or the original position when `depth` is `this.depth + 1`.\n  after(depth) {\n    depth = this.resolveDepth(depth)\n    if (!depth) throw new RangeError(\"There is no position after the top-level node\")\n    return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize\n  }\n\n  // :: number\n  // When this position points into a text node, this returns the\n  // distance between the position and the start of the text node.\n  // Will be zero for positions that point between nodes.\n  get textOffset() { return this.pos - this.path[this.path.length - 1] }\n\n  // :: ?Node\n  // Get the node directly after the position, if any. If the position\n  // points into a text node, only the part of that node after the\n  // position is returned.\n  get nodeAfter() {\n    let parent = this.parent, index = this.index(this.depth)\n    if (index == parent.childCount) return null\n    let dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index)\n    return dOff ? parent.child(index).cut(dOff) : child\n  }\n\n  // :: ?Node\n  // Get the node directly before the position, if any. If the\n  // position points into a text node, only the part of that node\n  // before the position is returned.\n  get nodeBefore() {\n    let index = this.index(this.depth)\n    let dOff = this.pos - this.path[this.path.length - 1]\n    if (dOff) return this.parent.child(index).cut(0, dOff)\n    return index == 0 ? null : this.parent.child(index - 1)\n  }\n\n  // :: (number, ?number) → number\n  // Get the position at the given index in the parent node at the\n  // given depth (which defaults to `this.depth`).\n  posAtIndex(index, depth) {\n    depth = this.resolveDepth(depth)\n    let node = this.path[depth * 3], pos = depth == 0 ? 0 : this.path[depth * 3 - 1] + 1\n    for (let i = 0; i < index; i++) pos += node.child(i).nodeSize\n    return pos\n  }\n\n  // :: () → [Mark]\n  // Get the marks at this position, factoring in the surrounding\n  // marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the\n  // position is at the start of a non-empty node, the marks of the\n  // node after it (if any) are returned.\n  marks() {\n    let parent = this.parent, index = this.index()\n\n    // In an empty parent, return the empty array\n    if (parent.content.size == 0) return Mark.none\n\n    // When inside a text node, just return the text node's marks\n    if (this.textOffset) return parent.child(index).marks\n\n    let main = parent.maybeChild(index - 1), other = parent.maybeChild(index)\n    // If the `after` flag is true of there is no node before, make\n    // the node after this position the main reference.\n    if (!main) { let tmp = main; main = other; other = tmp }\n\n    // Use all marks in the main node, except those that have\n    // `inclusive` set to false and are not present in the other node.\n    let marks = main.marks\n    for (var i = 0; i < marks.length; i++)\n      if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))\n        marks = marks[i--].removeFromSet(marks)\n\n    return marks\n  }\n\n  // :: (ResolvedPos) → ?[Mark]\n  // Get the marks after the current position, if any, except those\n  // that are non-inclusive and not present at position `$end`. This\n  // is mostly useful for getting the set of marks to preserve after a\n  // deletion. Will return `null` if this position is at the end of\n  // its parent node or its parent node isn't a textblock (in which\n  // case no marks should be preserved).\n  marksAcross($end) {\n    let after = this.parent.maybeChild(this.index())\n    if (!after || !after.isInline) return null\n\n    let marks = after.marks, next = $end.parent.maybeChild($end.index())\n    for (var i = 0; i < marks.length; i++)\n      if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))\n        marks = marks[i--].removeFromSet(marks)\n    return marks\n  }\n\n  // :: (number) → number\n  // The depth up to which this position and the given (non-resolved)\n  // position share the same parent nodes.\n  sharedDepth(pos) {\n    for (let depth = this.depth; depth > 0; depth--)\n      if (this.start(depth) <= pos && this.end(depth) >= pos) return depth\n    return 0\n  }\n\n  // :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange\n  // Returns a range based on the place where this position and the\n  // given position diverge around block content. If both point into\n  // the same textblock, for example, a range around that textblock\n  // will be returned. If they point into different blocks, the range\n  // around those blocks in their shared ancestor is returned. You can\n  // pass in an optional predicate that will be called with a parent\n  // node to see if a range into that parent is acceptable.\n  blockRange(other = this, pred) {\n    if (other.pos < this.pos) return other.blockRange(this)\n    for (let d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)\n      if (other.pos <= this.end(d) && (!pred || pred(this.node(d))))\n        return new NodeRange(this, other, d)\n  }\n\n  // :: (ResolvedPos) → bool\n  // Query whether the given position shares the same parent node.\n  sameParent(other) {\n    return this.pos - this.parentOffset == other.pos - other.parentOffset\n  }\n\n  // :: (ResolvedPos) → ResolvedPos\n  // Return the greater of this and the given position.\n  max(other) {\n    return other.pos > this.pos ? other : this\n  }\n\n  // :: (ResolvedPos) → ResolvedPos\n  // Return the smaller of this and the given position.\n  min(other) {\n    return other.pos < this.pos ? other : this\n  }\n\n  toString() {\n    let str = \"\"\n    for (let i = 1; i <= this.depth; i++)\n      str += (str ? \"/\" : \"\") + this.node(i).type.name + \"_\" + this.index(i - 1)\n    return str + \":\" + this.parentOffset\n  }\n\n  static resolve(doc, pos) {\n    if (!(pos >= 0 && pos <= doc.content.size)) throw new RangeError(\"Position \" + pos + \" out of range\")\n    let path = []\n    let start = 0, parentOffset = pos\n    for (let node = doc;;) {\n      let {index, offset} = node.content.findIndex(parentOffset)\n      let rem = parentOffset - offset\n      path.push(node, index, start + offset)\n      if (!rem) break\n      node = node.child(index)\n      if (node.isText) break\n      parentOffset = rem - 1\n      start += offset + 1\n    }\n    return new ResolvedPos(pos, path, parentOffset)\n  }\n\n  static resolveCached(doc, pos) {\n    for (let i = 0; i < resolveCache.length; i++) {\n      let cached = resolveCache[i]\n      if (cached.pos == pos && cached.doc == doc) return cached\n    }\n    let result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos)\n    resolveCachePos = (resolveCachePos + 1) % resolveCacheSize\n    return result\n  }\n}\n\nlet resolveCache = [], resolveCachePos = 0, resolveCacheSize = 12\n\n// ::- Represents a flat range of content, i.e. one that starts and\n// ends in the same node.\nexport class NodeRange {\n  // :: (ResolvedPos, ResolvedPos, number)\n  // Construct a node range. `$from` and `$to` should point into the\n  // same node until at least the given `depth`, since a node range\n  // denotes an adjacent set of nodes in a single parent node.\n  constructor($from, $to, depth) {\n    // :: ResolvedPos A resolved position along the start of the\n    // content. May have a `depth` greater than this object's `depth`\n    // property, since these are the positions that were used to\n    // compute the range, not re-resolved positions directly at its\n    // boundaries.\n    this.$from = $from\n    // :: ResolvedPos A position along the end of the content. See\n    // caveat for [`$from`](#model.NodeRange.$from).\n    this.$to = $to\n    // :: number The depth of the node that this range points into.\n    this.depth = depth\n  }\n\n  // :: number The position at the start of the range.\n  get start() { return this.$from.before(this.depth + 1) }\n  // :: number The position at the end of the range.\n  get end() { return this.$to.after(this.depth + 1) }\n\n  // :: Node The parent node that the range points into.\n  get parent() { return this.$from.node(this.depth) }\n  // :: number The start index of the range in the parent node.\n  get startIndex() { return this.$from.index(this.depth) }\n  // :: number The end index of the range in the parent node.\n  get endIndex() { return this.$to.indexAfter(this.depth) }\n}\n","// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Flattens descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const children = flatten(node);\n// ```\nexport const flatten = (node, descend = true) => {\n  if (!node) {\n    throw new Error('Invalid \"node\" parameter');\n  }\n  const result = [];\n  node.descendants((child, pos) => {\n    result.push({ node: child, pos });\n    if (!descend) {\n      return false;\n    }\n  });\n  return result;\n};\n\n// :: (node: ProseMirrorNode, predicate: (node: ProseMirrorNode) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const textNodes = findChildren(node, child => child.isText, false);\n// ```\nexport const findChildren = (node, predicate, descend) => {\n  if (!node) {\n    throw new Error('Invalid \"node\" parameter');\n  } else if (!predicate) {\n    throw new Error('Invalid \"predicate\" parameter');\n  }\n  return flatten(node, descend).filter(child => predicate(child.node));\n};\n\n// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Returns text nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const textNodes = findTextNodes(node);\n// ```\nexport const findTextNodes = (node, descend) => {\n  return findChildren(node, child => child.isText, descend);\n};\n\n// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Returns inline nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const inlineNodes = findInlineNodes(node);\n// ```\nexport const findInlineNodes = (node, descend) => {\n  return findChildren(node, child => child.isInline, descend);\n};\n\n// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Returns block descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const blockNodes = findBlockNodes(node);\n// ```\nexport const findBlockNodes = (node, descend) => {\n  return findChildren(node, child => child.isBlock, descend);\n};\n\n// :: (node: ProseMirrorNode, predicate: (attrs: ?Object) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const mergedCells = findChildrenByAttr(table, attrs => attrs.colspan === 2);\n// ```\nexport const findChildrenByAttr = (node, predicate, descend) => {\n  return findChildren(node, child => !!predicate(child.attrs), descend);\n};\n\n// :: (node: ProseMirrorNode, nodeType: NodeType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Iterates over descendants of a given `node`, returning child nodes of a given nodeType. It doesn't descend into a node when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const cells = findChildrenByType(table, schema.nodes.tableCell);\n// ```\nexport const findChildrenByType = (node, nodeType, descend) => {\n  return findChildren(node, child => child.type === nodeType, descend);\n};\n\n// :: (node: ProseMirrorNode, markType: markType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]\n// Iterates over descendants of a given `node`, returning child nodes that have a mark of a given markType. It doesn't descend into a `node` when descend argument is `false` (defaults to `true`).\n//\n// ```javascript\n// const nodes = findChildrenByMark(state.doc, schema.marks.strong);\n// ```\nexport const findChildrenByMark = (node, markType, descend) => {\n  return findChildren(node, child => markType.isInSet(child.marks), descend);\n};\n\n// :: (node: ProseMirrorNode, nodeType: NodeType) → boolean\n// Returns `true` if a given node contains nodes of a given `nodeType`\n//\n// ```javascript\n// if (contains(panel, schema.nodes.listItem)) {\n//   // ...\n// }\n// ```\nexport const contains = (node, nodeType) => {\n  return !!findChildrenByType(node, nodeType).length;\n};\n","import {Fragment} from \"./fragment\"\n\n// ::- Instances of this class represent a match state of a node\n// type's [content expression](#model.NodeSpec.content), and can be\n// used to find out whether further content matches here, and whether\n// a given position is a valid end of the node.\nexport class ContentMatch {\n  constructor(validEnd) {\n    // :: bool\n    // True when this match state represents a valid end of the node.\n    this.validEnd = validEnd\n    this.next = []\n    this.wrapCache = []\n  }\n\n  static parse(string, nodeTypes) {\n    let stream = new TokenStream(string, nodeTypes)\n    if (stream.next == null) return ContentMatch.empty\n    let expr = parseExpr(stream)\n    if (stream.next) stream.err(\"Unexpected trailing text\")\n    let match = dfa(nfa(expr))\n    checkForDeadEnds(match, stream)\n    return match\n  }\n\n  // :: (NodeType) → ?ContentMatch\n  // Match a node type, returning a match after that node if\n  // successful.\n  matchType(type) {\n    for (let i = 0; i < this.next.length; i += 2)\n      if (this.next[i] == type) return this.next[i + 1]\n    return null\n  }\n\n  // :: (Fragment, ?number, ?number) → ?ContentMatch\n  // Try to match a fragment. Returns the resulting match when\n  // successful.\n  matchFragment(frag, start = 0, end = frag.childCount) {\n    let cur = this\n    for (let i = start; cur && i < end; i++)\n      cur = cur.matchType(frag.child(i).type)\n    return cur\n  }\n\n  get inlineContent() {\n    let first = this.next[0]\n    return first ? first.isInline : false\n  }\n\n  // :: ?NodeType\n  // Get the first matching node type at this match position that can\n  // be generated.\n  get defaultType() {\n    for (let i = 0; i < this.next.length; i += 2) {\n      let type = this.next[i]\n      if (!(type.isText || type.hasRequiredAttrs())) return type\n    }\n  }\n\n  compatible(other) {\n    for (let i = 0; i < this.next.length; i += 2)\n      for (let j = 0; j < other.next.length; j += 2)\n        if (this.next[i] == other.next[j]) return true\n    return false\n  }\n\n  // :: (Fragment, bool, ?number) → ?Fragment\n  // Try to match the given fragment, and if that fails, see if it can\n  // be made to match by inserting nodes in front of it. When\n  // successful, return a fragment of inserted nodes (which may be\n  // empty if nothing had to be inserted). When `toEnd` is true, only\n  // return a fragment if the resulting match goes to the end of the\n  // content expression.\n  fillBefore(after, toEnd = false, startIndex = 0) {\n    let seen = [this]\n    function search(match, types) {\n      let finished = match.matchFragment(after, startIndex)\n      if (finished && (!toEnd || finished.validEnd))\n        return Fragment.from(types.map(tp => tp.createAndFill()))\n\n      for (let i = 0; i < match.next.length; i += 2) {\n        let type = match.next[i], next = match.next[i + 1]\n        if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {\n          seen.push(next)\n          let found = search(next, types.concat(type))\n          if (found) return found\n        }\n      }\n    }\n\n    return search(this, [])\n  }\n\n  // :: (NodeType) → ?[NodeType]\n  // Find a set of wrapping node types that would allow a node of the\n  // given type to appear at this position. The result may be empty\n  // (when it fits directly) and will be null when no such wrapping\n  // exists.\n  findWrapping(target) {\n    for (let i = 0; i < this.wrapCache.length; i += 2)\n      if (this.wrapCache[i] == target) return this.wrapCache[i + 1]\n    let computed = this.computeWrapping(target)\n    this.wrapCache.push(target, computed)\n    return computed\n  }\n\n  computeWrapping(target) {\n    let seen = Object.create(null), active = [{match: this, type: null, via: null}]\n    while (active.length) {\n      let current = active.shift(), match = current.match\n      if (match.matchType(target)) {\n        let result = []\n        for (let obj = current; obj.type; obj = obj.via)\n          result.push(obj.type)\n        return result.reverse()\n      }\n      for (let i = 0; i < match.next.length; i += 2) {\n        let type = match.next[i]\n        if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {\n          active.push({match: type.contentMatch, type, via: current})\n          seen[type.name] = true\n        }\n      }\n    }\n  }\n\n  // :: number\n  // The number of outgoing edges this node has in the finite\n  // automaton that describes the content expression.\n  get edgeCount() {\n    return this.next.length >> 1\n  }\n\n  // :: (number) → {type: NodeType, next: ContentMatch}\n  // Get the _n_​th outgoing edge from this node in the finite\n  // automaton that describes the content expression.\n  edge(n) {\n    let i = n << 1\n    if (i >= this.next.length) throw new RangeError(`There's no ${n}th edge in this content match`)\n    return {type: this.next[i], next: this.next[i + 1]}\n  }\n\n  toString() {\n    let seen = []\n    function scan(m) {\n      seen.push(m)\n      for (let i = 1; i < m.next.length; i += 2)\n        if (seen.indexOf(m.next[i]) == -1) scan(m.next[i])\n    }\n    scan(this)\n    return seen.map((m, i) => {\n      let out = i + (m.validEnd ? \"*\" : \" \") + \" \"\n      for (let i = 0; i < m.next.length; i += 2)\n        out += (i ? \", \" : \"\") + m.next[i].name + \"->\" + seen.indexOf(m.next[i + 1])\n      return out\n    }).join(\"\\n\")\n  }\n}\n\nContentMatch.empty = new ContentMatch(true)\n\nclass TokenStream {\n  constructor(string, nodeTypes) {\n    this.string = string\n    this.nodeTypes = nodeTypes\n    this.inline = null\n    this.pos = 0\n    this.tokens = string.split(/\\s*(?=\\b|\\W|$)/)\n    if (this.tokens[this.tokens.length - 1] == \"\") this.tokens.pop()\n    if (this.tokens[0] == \"\") this.tokens.unshift()\n  }\n\n  get next() { return this.tokens[this.pos] }\n\n  eat(tok) { return this.next == tok && (this.pos++ || true) }\n\n  err(str) { throw new SyntaxError(str + \" (in content expression '\" + this.string + \"')\") }\n}\n\nfunction parseExpr(stream) {\n  let exprs = []\n  do { exprs.push(parseExprSeq(stream)) }\n  while (stream.eat(\"|\"))\n  return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs}\n}\n\nfunction parseExprSeq(stream) {\n  let exprs = []\n  do { exprs.push(parseExprSubscript(stream)) }\n  while (stream.next && stream.next != \")\" && stream.next != \"|\")\n  return exprs.length == 1 ? exprs[0] : {type: \"seq\", exprs}\n}\n\nfunction parseExprSubscript(stream) {\n  let expr = parseExprAtom(stream)\n  for (;;) {\n    if (stream.eat(\"+\"))\n      expr = {type: \"plus\", expr}\n    else if (stream.eat(\"*\"))\n      expr = {type: \"star\", expr}\n    else if (stream.eat(\"?\"))\n      expr = {type: \"opt\", expr}\n    else if (stream.eat(\"{\"))\n      expr = parseExprRange(stream, expr)\n    else break\n  }\n  return expr\n}\n\nfunction parseNum(stream) {\n  if (/\\D/.test(stream.next)) stream.err(\"Expected number, got '\" + stream.next + \"'\")\n  let result = Number(stream.next)\n  stream.pos++\n  return result\n}\n\nfunction parseExprRange(stream, expr) {\n  let min = parseNum(stream), max = min\n  if (stream.eat(\",\")) {\n    if (stream.next != \"}\") max = parseNum(stream)\n    else max = -1\n  }\n  if (!stream.eat(\"}\")) stream.err(\"Unclosed braced range\")\n  return {type: \"range\", min, max, expr}\n}\n\nfunction resolveName(stream, name) {\n  let types = stream.nodeTypes, type = types[name]\n  if (type) return [type]\n  let result = []\n  for (let typeName in types) {\n    let type = types[typeName]\n    if (type.groups.indexOf(name) > -1) result.push(type)\n  }\n  if (result.length == 0) stream.err(\"No node type or group '\" + name + \"' found\")\n  return result\n}\n\nfunction parseExprAtom(stream) {\n  if (stream.eat(\"(\")) {\n    let expr = parseExpr(stream)\n    if (!stream.eat(\")\")) stream.err(\"Missing closing paren\")\n    return expr\n  } else if (!/\\W/.test(stream.next)) {\n    let exprs = resolveName(stream, stream.next).map(type => {\n      if (stream.inline == null) stream.inline = type.isInline\n      else if (stream.inline != type.isInline) stream.err(\"Mixing inline and block content\")\n      return {type: \"name\", value: type}\n    })\n    stream.pos++\n    return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs}\n  } else {\n    stream.err(\"Unexpected token '\" + stream.next + \"'\")\n  }\n}\n\n// The code below helps compile a regular-expression-like language\n// into a deterministic finite automaton. For a good introduction to\n// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html\n\n// : (Object) → [[{term: ?any, to: number}]]\n// Construct an NFA from an expression as returned by the parser. The\n// NFA is represented as an array of states, which are themselves\n// arrays of edges, which are `{term, to}` objects. The first state is\n// the entry state and the last node is the success state.\n//\n// Note that unlike typical NFAs, the edge ordering in this one is\n// significant, in that it is used to contruct filler content when\n// necessary.\nfunction nfa(expr) {\n  let nfa = [[]]\n  connect(compile(expr, 0), node())\n  return nfa\n\n  function node() { return nfa.push([]) - 1 }\n  function edge(from, to, term) {\n    let edge = {term, to}\n    nfa[from].push(edge)\n    return edge\n  }\n  function connect(edges, to) { edges.forEach(edge => edge.to = to) }\n\n  function compile(expr, from) {\n    if (expr.type == \"choice\") {\n      return expr.exprs.reduce((out, expr) => out.concat(compile(expr, from)), [])\n    } else if (expr.type == \"seq\") {\n      for (let i = 0;; i++) {\n        let next = compile(expr.exprs[i], from)\n        if (i == expr.exprs.length - 1) return next\n        connect(next, from = node())\n      }\n    } else if (expr.type == \"star\") {\n      let loop = node()\n      edge(from, loop)\n      connect(compile(expr.expr, loop), loop)\n      return [edge(loop)]\n    } else if (expr.type == \"plus\") {\n      let loop = node()\n      connect(compile(expr.expr, from), loop)\n      connect(compile(expr.expr, loop), loop)\n      return [edge(loop)]\n    } else if (expr.type == \"opt\") {\n      return [edge(from)].concat(compile(expr.expr, from))\n    } else if (expr.type == \"range\") {\n      let cur = from\n      for (let i = 0; i < expr.min; i++) {\n        let next = node()\n        connect(compile(expr.expr, cur), next)\n        cur = next\n      }\n      if (expr.max == -1) {\n        connect(compile(expr.expr, cur), cur)\n      } else {\n        for (let i = expr.min; i < expr.max; i++) {\n          let next = node()\n          edge(cur, next)\n          connect(compile(expr.expr, cur), next)\n          cur = next\n        }\n      }\n      return [edge(cur)]\n    } else if (expr.type == \"name\") {\n      return [edge(from, null, expr.value)]\n    }\n  }\n}\n\nfunction cmp(a, b) { return b - a }\n\n// Get the set of nodes reachable by null edges from `node`. Omit\n// nodes with only a single null-out-edge, since they may lead to\n// needless duplicated nodes.\nfunction nullFrom(nfa, node) {\n  let result = []\n  scan(node)\n  return result.sort(cmp)\n\n  function scan(node) {\n    let edges = nfa[node]\n    if (edges.length == 1 && !edges[0].term) return scan(edges[0].to)\n    result.push(node)\n    for (let i = 0; i < edges.length; i++) {\n      let {term, to} = edges[i]\n      if (!term && result.indexOf(to) == -1) scan(to)\n    }\n  }\n}\n\n// : ([[{term: ?any, to: number}]]) → ContentMatch\n// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set\n// of state objects (`ContentMatch` instances) with transitions\n// between them.\nfunction dfa(nfa) {\n  let labeled = Object.create(null)\n  return explore(nullFrom(nfa, 0))\n\n  function explore(states) {\n    let out = []\n    states.forEach(node => {\n      nfa[node].forEach(({term, to}) => {\n        if (!term) return\n        let known = out.indexOf(term), set = known > -1 && out[known + 1]\n        nullFrom(nfa, to).forEach(node => {\n          if (!set) out.push(term, set = [])\n          if (set.indexOf(node) == -1) set.push(node)\n        })\n      })\n    })\n    let state = labeled[states.join(\",\")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1)\n    for (let i = 0; i < out.length; i += 2) {\n      let states = out[i + 1].sort(cmp)\n      state.next.push(out[i], labeled[states.join(\",\")] || explore(states))\n    }\n    return state\n  }\n}\n\nfunction checkForDeadEnds(match, stream) {\n  for (let i = 0, work = [match]; i < work.length; i++) {\n    let state = work[i], dead = !state.validEnd, nodes = []\n    for (let j = 0; j < state.next.length; j += 2) {\n      let node = state.next[j], next = state.next[j + 1]\n      nodes.push(node.name)\n      if (dead && !(node.isText || node.hasRequiredAttrs())) dead = false\n      if (work.indexOf(next) == -1) work.push(next)\n    }\n    if (dead) stream.err(\"Only non-generatable nodes (\" + nodes.join(\", \") + \") in a required position (see https://prosemirror.net/docs/guide/#generatable)\")\n  }\n}\n","import {Schema} from \"prosemirror-model\"\n\n// ::Schema Document schema for the data model used by CommonMark.\nexport const schema = new Schema({\n  nodes: {\n    doc: {\n      content: \"block+\"\n    },\n\n    paragraph: {\n      content: \"inline*\",\n      group: \"block\",\n      parseDOM: [{tag: \"p\"}],\n      toDOM() { return [\"p\", 0] }\n    },\n\n    blockquote: {\n      content: \"block+\",\n      group: \"block\",\n      parseDOM: [{tag: \"blockquote\"}],\n      toDOM() { return [\"blockquote\", 0] }\n    },\n\n    horizontal_rule: {\n      group: \"block\",\n      parseDOM: [{tag: \"hr\"}],\n      toDOM() { return [\"div\", [\"hr\"]] }\n    },\n\n    heading: {\n      attrs: {level: {default: 1}},\n      content: \"(text | image)*\",\n      group: \"block\",\n      defining: true,\n      parseDOM: [{tag: \"h1\", attrs: {level: 1}},\n                 {tag: \"h2\", attrs: {level: 2}},\n                 {tag: \"h3\", attrs: {level: 3}},\n                 {tag: \"h4\", attrs: {level: 4}},\n                 {tag: \"h5\", attrs: {level: 5}},\n                 {tag: \"h6\", attrs: {level: 6}}],\n      toDOM(node) { return [\"h\" + node.attrs.level, 0] }\n    },\n\n    code_block: {\n      content: \"text*\",\n      group: \"block\",\n      code: true,\n      defining: true,\n      marks: \"\",\n      attrs: {params: {default: \"\"}},\n      parseDOM: [{tag: \"pre\", preserveWhitespace: \"full\", getAttrs: node => (\n        {params: node.getAttribute(\"data-params\") || \"\"}\n      )}],\n      toDOM(node) { return [\"pre\", node.attrs.params ? {\"data-params\": node.attrs.params} : {}, [\"code\", 0]] }\n    },\n\n    ordered_list: {\n      content: \"list_item+\",\n      group: \"block\",\n      attrs: {order: {default: 1}, tight: {default: false}},\n      parseDOM: [{tag: \"ol\", getAttrs(dom) {\n        return {order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1,\n                tight: dom.hasAttribute(\"data-tight\")}\n      }}],\n      toDOM(node) {\n        return [\"ol\", {start: node.attrs.order == 1 ? null : node.attrs.order,\n                       \"data-tight\": node.attrs.tight ? \"true\" : null}, 0]\n      }\n    },\n\n    bullet_list: {\n      content: \"list_item+\",\n      group: \"block\",\n      attrs: {tight: {default: false}},\n      parseDOM: [{tag: \"ul\", getAttrs: dom => ({tight: dom.hasAttribute(\"data-tight\")})}],\n      toDOM(node) { return [\"ul\", {\"data-tight\": node.attrs.tight ? \"true\" : null}, 0] }\n    },\n\n    list_item: {\n      content: \"paragraph block*\",\n      defining: true,\n      parseDOM: [{tag: \"li\"}],\n      toDOM() { return [\"li\", 0] }\n    },\n\n    text: {\n      group: \"inline\"\n    },\n\n    image: {\n      inline: true,\n      attrs: {\n        src: {},\n        alt: {default: null},\n        title: {default: null}\n      },\n      group: \"inline\",\n      draggable: true,\n      parseDOM: [{tag: \"img[src]\", getAttrs(dom) {\n        return {\n          src: dom.getAttribute(\"src\"),\n          title: dom.getAttribute(\"title\"),\n          alt: dom.getAttribute(\"alt\")\n        }\n      }}],\n      toDOM(node) { return [\"img\", node.attrs] }\n    },\n\n    hard_break: {\n      inline: true,\n      group: \"inline\",\n      selectable: false,\n      parseDOM: [{tag: \"br\"}],\n      toDOM() { return [\"br\"] }\n    }\n  },\n\n  marks: {\n    em: {\n      parseDOM: [{tag: \"i\"}, {tag: \"em\"},\n                 {style: \"font-style\", getAttrs: value => value == \"italic\" && null}],\n      toDOM() { return [\"em\"] }\n    },\n\n    strong: {\n      parseDOM: [{tag: \"b\"}, {tag: \"strong\"},\n                 {style: \"font-weight\", getAttrs: value => /^(bold(er)?|[5-9]\\d{2,})$/.test(value) && null}],\n      toDOM() { return [\"strong\"] }\n    },\n\n    link: {\n      attrs: {\n        href: {},\n        title: {default: null}\n      },\n      inclusive: false,\n      parseDOM: [{tag: \"a[href]\", getAttrs(dom) {\n        return {href: dom.getAttribute(\"href\"), title: dom.getAttribute(\"title\")}\n      }}],\n      toDOM(node) { return [\"a\", node.attrs] }\n    },\n\n    code: {\n      parseDOM: [{tag: \"code\"}],\n      toDOM() { return [\"code\"] }\n    }\n  }\n})\n","import {Fragment} from \"./fragment\"\nimport {Slice} from \"./replace\"\nimport {Mark} from \"./mark\"\n\n// ParseOptions:: interface\n// These are the options recognized by the\n// [`parse`](#model.DOMParser.parse) and\n// [`parseSlice`](#model.DOMParser.parseSlice) methods.\n//\n//   preserveWhitespace:: ?union<bool, \"full\">\n//   By default, whitespace is collapsed as per HTML's rules. Pass\n//   `true` to preserve whitespace, but normalize newlines to\n//   spaces, and `\"full\"` to preserve whitespace entirely.\n//\n//   findPositions:: ?[{node: dom.Node, offset: number}]\n//   When given, the parser will, beside parsing the content,\n//   record the document positions of the given DOM positions. It\n//   will do so by writing to the objects, adding a `pos` property\n//   that holds the document position. DOM positions that are not\n//   in the parsed content will not be written to.\n//\n//   from:: ?number\n//   The child node index to start parsing from.\n//\n//   to:: ?number\n//   The child node index to stop parsing at.\n//\n//   topNode:: ?Node\n//   By default, the content is parsed into the schema's default\n//   [top node type](#model.Schema.topNodeType). You can pass this\n//   option to use the type and attributes from a different node\n//   as the top container.\n//\n//   topMatch:: ?ContentMatch\n//   Provide the starting content match that content parsed into the\n//   top node is matched against.\n//\n//   context:: ?ResolvedPos\n//   A set of additional nodes to count as\n//   [context](#model.ParseRule.context) when parsing, above the\n//   given [top node](#model.ParseOptions.topNode).\n\n// ParseRule:: interface\n// A value that describes how to parse a given DOM node or inline\n// style as a ProseMirror node or mark.\n//\n//   tag:: ?string\n//   A CSS selector describing the kind of DOM elements to match. A\n//   single rule should have _either_ a `tag` or a `style` property.\n//\n//   namespace:: ?string\n//   The namespace to match. This should be used with `tag`.\n//   Nodes are only matched when the namespace matches or this property\n//   is null.\n//\n//   style:: ?string\n//   A CSS property name to match. When given, this rule matches\n//   inline styles that list that property. May also have the form\n//   `\"property=value\"`, in which case the rule only matches if the\n//   property's value exactly matches the given value. (For more\n//   complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)\n//   and return false to indicate that the match failed.)\n//\n//   priority:: ?number\n//   Can be used to change the order in which the parse rules in a\n//   schema are tried. Those with higher priority come first. Rules\n//   without a priority are counted as having priority 50. This\n//   property is only meaningful in a schema—when directly\n//   constructing a parser, the order of the rule array is used.\n//\n//   context:: ?string\n//   When given, restricts this rule to only match when the current\n//   context—the parent nodes into which the content is being\n//   parsed—matches this expression. Should contain one or more node\n//   names or node group names followed by single or double slashes.\n//   For example `\"paragraph/\"` means the rule only matches when the\n//   parent node is a paragraph, `\"blockquote/paragraph/\"` restricts\n//   it to be in a paragraph that is inside a blockquote, and\n//   `\"section//\"` matches any position inside a section—a double\n//   slash matches any sequence of ancestor nodes. To allow multiple\n//   different contexts, they can be separated by a pipe (`|`)\n//   character, as in `\"blockquote/|list_item/\"`.\n//\n//   node:: ?string\n//   The name of the node type to create when this rule matches. Only\n//   valid for rules with a `tag` property, not for style rules. Each\n//   rule should have one of a `node`, `mark`, or `ignore` property\n//   (except when it appears in a [node](#model.NodeSpec.parseDOM) or\n//   [mark spec](#model.MarkSpec.parseDOM), in which case the `node`\n//   or `mark` property will be derived from its position).\n//\n//   mark:: ?string\n//   The name of the mark type to wrap the matched content in.\n//\n//   ignore:: ?bool\n//   When true, ignore content that matches this rule.\n//\n//   closeParent:: ?bool\n//   When true, finding an element that matches this rule will close\n//   the current node.\n//\n//   skip:: ?bool\n//   When true, ignore the node that matches this rule, but do parse\n//   its content.\n//\n//   attrs:: ?Object\n//   Attributes for the node or mark created by this rule. When\n//   `getAttrs` is provided, it takes precedence.\n//\n//   getAttrs:: ?(union<dom.Node, string>) → ?union<Object, false>\n//   A function used to compute the attributes for the node or mark\n//   created by this rule. Can also be used to describe further\n//   conditions the DOM element or style must match. When it returns\n//   `false`, the rule won't match. When it returns null or undefined,\n//   that is interpreted as an empty/default set of attributes.\n//\n//   Called with a DOM Element for `tag` rules, and with a string (the\n//   style's value) for `style` rules.\n//\n//   contentElement:: ?union<string, (dom.Node) → dom.Node>\n//   For `tag` rules that produce non-leaf nodes or marks, by default\n//   the content of the DOM element is parsed as content of the mark\n//   or node. If the child nodes are in a descendent node, this may be\n//   a CSS selector string that the parser must use to find the actual\n//   content element, or a function that returns the actual content\n//   element to the parser.\n//\n//   getContent:: ?(dom.Node, schema: Schema) → Fragment\n//   Can be used to override the content of a matched node. When\n//   present, instead of parsing the node's child nodes, the result of\n//   this function is used.\n//\n//   preserveWhitespace:: ?union<bool, \"full\">\n//   Controls whether whitespace should be preserved when parsing the\n//   content inside the matched element. `false` means whitespace may\n//   be collapsed, `true` means that whitespace should be preserved\n//   but newlines normalized to spaces, and `\"full\"` means that\n//   newlines should also be preserved.\n\n// ::- A DOM parser represents a strategy for parsing DOM content into\n// a ProseMirror document conforming to a given schema. Its behavior\n// is defined by an array of [rules](#model.ParseRule).\nexport class DOMParser {\n  // :: (Schema, [ParseRule])\n  // Create a parser that targets the given schema, using the given\n  // parsing rules.\n  constructor(schema, rules) {\n    // :: Schema\n    // The schema into which the parser parses.\n    this.schema = schema\n    // :: [ParseRule]\n    // The set of [parse rules](#model.ParseRule) that the parser\n    // uses, in order of precedence.\n    this.rules = rules\n    this.tags = []\n    this.styles = []\n\n    rules.forEach(rule => {\n      if (rule.tag) this.tags.push(rule)\n      else if (rule.style) this.styles.push(rule)\n    })\n\n    // Only normalize list elements when lists in the schema can't directly contain themselves\n    this.normalizeLists = !this.tags.some(r => {\n      if (!/^(ul|ol)\\b/.test(r.tag) || !r.node) return false\n      let node = schema.nodes[r.node]\n      return node.contentMatch.matchType(node)\n    })\n  }\n\n  // :: (dom.Node, ?ParseOptions) → Node\n  // Parse a document from the content of a DOM node.\n  parse(dom, options = {}) {\n    let context = new ParseContext(this, options, false)\n    context.addAll(dom, null, options.from, options.to)\n    return context.finish()\n  }\n\n  // :: (dom.Node, ?ParseOptions) → Slice\n  // Parses the content of the given DOM node, like\n  // [`parse`](#model.DOMParser.parse), and takes the same set of\n  // options. But unlike that method, which produces a whole node,\n  // this one returns a slice that is open at the sides, meaning that\n  // the schema constraints aren't applied to the start of nodes to\n  // the left of the input and the end of nodes at the end.\n  parseSlice(dom, options = {}) {\n    let context = new ParseContext(this, options, true)\n    context.addAll(dom, null, options.from, options.to)\n    return Slice.maxOpen(context.finish())\n  }\n\n  matchTag(dom, context) {\n    for (let i = 0; i < this.tags.length; i++) {\n      let rule = this.tags[i]\n      if (matches(dom, rule.tag) &&\n          (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&\n          (!rule.context || context.matchesContext(rule.context))) {\n        if (rule.getAttrs) {\n          let result = rule.getAttrs(dom)\n          if (result === false) continue\n          rule.attrs = result\n        }\n        return rule\n      }\n    }\n  }\n\n  matchStyle(prop, value, context) {\n    for (let i = 0; i < this.styles.length; i++) {\n      let rule = this.styles[i]\n      if (rule.style.indexOf(prop) != 0 ||\n          rule.context && !context.matchesContext(rule.context) ||\n          // Test that the style string either precisely matches the prop,\n          // or has an '=' sign after the prop, followed by the given\n          // value.\n          rule.style.length > prop.length &&\n          (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))\n        continue\n      if (rule.getAttrs) {\n        let result = rule.getAttrs(value)\n        if (result === false) continue\n        rule.attrs = result\n      }\n      return rule\n    }\n  }\n\n  // : (Schema) → [ParseRule]\n  static schemaRules(schema) {\n    let result = []\n    function insert(rule) {\n      let priority = rule.priority == null ? 50 : rule.priority, i = 0\n      for (; i < result.length; i++) {\n        let next = result[i], nextPriority = next.priority == null ? 50 : next.priority\n        if (nextPriority < priority) break\n      }\n      result.splice(i, 0, rule)\n    }\n\n    for (let name in schema.marks) {\n      let rules = schema.marks[name].spec.parseDOM\n      if (rules) rules.forEach(rule => {\n        insert(rule = copy(rule))\n        rule.mark = name\n      })\n    }\n    for (let name in schema.nodes) {\n      let rules = schema.nodes[name].spec.parseDOM\n      if (rules) rules.forEach(rule => {\n        insert(rule = copy(rule))\n        rule.node = name\n      })\n    }\n    return result\n  }\n\n  // :: (Schema) → DOMParser\n  // Construct a DOM parser using the parsing rules listed in a\n  // schema's [node specs](#model.NodeSpec.parseDOM), reordered by\n  // [priority](#model.ParseRule.priority).\n  static fromSchema(schema) {\n    return schema.cached.domParser ||\n      (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))\n  }\n}\n\n// : Object<bool> The block-level tags in HTML5\nconst blockTags = {\n  address: true, article: true, aside: true, blockquote: true, canvas: true,\n  dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,\n  footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,\n  h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,\n  output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true\n}\n\n// : Object<bool> The tags that we normally ignore.\nconst ignoreTags = {\n  head: true, noscript: true, object: true, script: true, style: true, title: true\n}\n\n// : Object<bool> List tags.\nconst listTags = {ol: true, ul: true}\n\n// Using a bitfield for node context options\nconst OPT_PRESERVE_WS = 1, OPT_PRESERVE_WS_FULL = 2, OPT_OPEN_LEFT = 4\n\nfunction wsOptionsFor(preserveWhitespace) {\n  return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === \"full\" ? OPT_PRESERVE_WS_FULL : 0)\n}\n\nclass NodeContext {\n  constructor(type, attrs, marks, pendingMarks, solid, match, options) {\n    this.type = type\n    this.attrs = attrs\n    this.solid = solid\n    this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch)\n    this.options = options\n    this.content = []\n    // Marks applied to this node itself\n    this.marks = marks\n    // Marks applied to its children\n    this.activeMarks = Mark.none\n    // Marks that can't apply here, but will be used in children if possible\n    this.pendingMarks = pendingMarks\n    // Nested Marks with same type\n    this.stashMarks = []\n  }\n\n  findWrapping(node) {\n    if (!this.match) {\n      if (!this.type) return []\n      let fill = this.type.contentMatch.fillBefore(Fragment.from(node))\n      if (fill) {\n        this.match = this.type.contentMatch.matchFragment(fill)\n      } else {\n        let start = this.type.contentMatch, wrap\n        if (wrap = start.findWrapping(node.type)) {\n          this.match = start\n          return wrap\n        } else {\n          return null\n        }\n      }\n    }\n    return this.match.findWrapping(node.type)\n  }\n\n  finish(openEnd) {\n    if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace\n      let last = this.content[this.content.length - 1], m\n      if (last && last.isText && (m = /[ \\t\\r\\n\\u000c]+$/.exec(last.text))) {\n        if (last.text.length == m[0].length) this.content.pop()\n        else this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length))\n      }\n    }\n    let content = Fragment.from(this.content)\n    if (!openEnd && this.match)\n      content = content.append(this.match.fillBefore(Fragment.empty, true))\n    return this.type ? this.type.create(this.attrs, content, this.marks) : content\n  }\n\n  popFromStashMark(markType) {\n    for (let i = this.stashMarks.length - 1; i >= 0; i--)\n      if (this.stashMarks[i].type == markType) return this.stashMarks.splice(i, 1)[0]\n  }\n\n  applyPending(nextType) {\n    for (let i = 0, pending = this.pendingMarks; i < pending.length; i++) {\n      let mark = pending[i]\n      if ((this.type ? this.type.allowsMarkType(mark.type) : markMayApply(mark.type, nextType)) &&\n          !mark.isInSet(this.activeMarks)) {\n        let found = findSameTypeInSet(mark, this.activeMarks)\n        if (found) this.stashMarks.push(found)\n        this.activeMarks = mark.addToSet(this.activeMarks)\n        this.pendingMarks = mark.removeFromSet(this.pendingMarks)\n      }\n    }\n  }\n}\n\nclass ParseContext {\n  // : (DOMParser, Object)\n  constructor(parser, options, open) {\n    // : DOMParser The parser we are using.\n    this.parser = parser\n    // : Object The options passed to this parse.\n    this.options = options\n    this.isOpen = open\n    let topNode = options.topNode, topContext\n    let topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0)\n    if (topNode)\n      topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, Mark.none, true,\n                                   options.topMatch || topNode.type.contentMatch, topOptions)\n    else if (open)\n      topContext = new NodeContext(null, null, Mark.none, Mark.none, true, null, topOptions)\n    else\n      topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, Mark.none, true, null, topOptions)\n    this.nodes = [topContext]\n    // : [Mark] The current set of marks\n    this.open = 0\n    this.find = options.findPositions\n    this.needsBlock = false\n  }\n\n  get top() {\n    return this.nodes[this.open]\n  }\n\n  // : (dom.Node)\n  // Add a DOM node to the content. Text is inserted as text node,\n  // otherwise, the node is passed to `addElement` or, if it has a\n  // `style` attribute, `addElementWithStyles`.\n  addDOM(dom) {\n    if (dom.nodeType == 3) {\n      this.addTextNode(dom)\n    } else if (dom.nodeType == 1) {\n      let style = dom.getAttribute(\"style\")\n      let marks = style ? this.readStyles(parseStyles(style)) : null, top = this.top\n      if (marks != null) for (let i = 0; i < marks.length; i++) this.addPendingMark(marks[i])\n      this.addElement(dom)\n      if (marks != null) for (let i = 0; i < marks.length; i++) this.removePendingMark(marks[i], top)\n    }\n  }\n\n  addTextNode(dom) {\n    let value = dom.nodeValue\n    let top = this.top\n    if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /[^ \\t\\r\\n\\u000c]/.test(value)) {\n      if (!(top.options & OPT_PRESERVE_WS)) {\n        value = value.replace(/[ \\t\\r\\n\\u000c]+/g, \" \")\n        // If this starts with whitespace, and there is no node before it, or\n        // a hard break, or a text node that ends with whitespace, strip the\n        // leading space.\n        if (/^[ \\t\\r\\n\\u000c]/.test(value) && this.open == this.nodes.length - 1) {\n          let nodeBefore = top.content[top.content.length - 1]\n          let domNodeBefore = dom.previousSibling\n          if (!nodeBefore ||\n              (domNodeBefore && domNodeBefore.nodeName == 'BR') ||\n              (nodeBefore.isText && /[ \\t\\r\\n\\u000c]$/.test(nodeBefore.text)))\n            value = value.slice(1)\n        }\n      } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {\n        value = value.replace(/\\r?\\n|\\r/g, \" \")\n      }\n      if (value) this.insertNode(this.parser.schema.text(value))\n      this.findInText(dom)\n    } else {\n      this.findInside(dom)\n    }\n  }\n\n  // : (dom.Element)\n  // Try to find a handler for the given tag and use that to parse. If\n  // none is found, the element's content nodes are added directly.\n  addElement(dom) {\n    let name = dom.nodeName.toLowerCase()\n    if (listTags.hasOwnProperty(name) && this.parser.normalizeLists) normalizeList(dom)\n    let rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) || this.parser.matchTag(dom, this)\n    if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {\n      this.findInside(dom)\n    } else if (!rule || rule.skip || rule.closeParent) {\n      if (rule && rule.closeParent) this.open = Math.max(0, this.open - 1)\n      else if (rule && rule.skip.nodeType) dom = rule.skip\n      let sync, top = this.top, oldNeedsBlock = this.needsBlock\n      if (blockTags.hasOwnProperty(name)) {\n        sync = true\n        if (!top.type) this.needsBlock = true\n      } else if (!dom.firstChild) {\n        this.leafFallback(dom)\n        return\n      }\n      this.addAll(dom)\n      if (sync) this.sync(top)\n      this.needsBlock = oldNeedsBlock\n    } else {\n      this.addElementByRule(dom, rule)\n    }\n  }\n\n  // Called for leaf DOM nodes that would otherwise be ignored\n  leafFallback(dom) {\n    if (dom.nodeName == \"BR\" && this.top.type && this.top.type.inlineContent)\n      this.addTextNode(dom.ownerDocument.createTextNode(\"\\n\"))\n  }\n\n  // Run any style parser associated with the node's styles. Either\n  // return an array of marks, or null to indicate some of the styles\n  // had a rule with `ignore` set.\n  readStyles(styles) {\n    let marks = Mark.none\n    for (let i = 0; i < styles.length; i += 2) {\n      let rule = this.parser.matchStyle(styles[i], styles[i + 1], this)\n      if (!rule) continue\n      if (rule.ignore) return null\n      marks = this.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks)\n    }\n    return marks\n  }\n\n  // : (dom.Element, ParseRule) → bool\n  // Look up a handler for the given node. If none are found, return\n  // false. Otherwise, apply it, use its return value to drive the way\n  // the node's content is wrapped, and return true.\n  addElementByRule(dom, rule) {\n    let sync, nodeType, markType, mark\n    if (rule.node) {\n      nodeType = this.parser.schema.nodes[rule.node]\n      if (!nodeType.isLeaf) {\n        sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace)\n      } else if (!this.insertNode(nodeType.create(rule.attrs))) {\n        this.leafFallback(dom)\n      }\n    } else {\n      markType = this.parser.schema.marks[rule.mark]\n      mark = markType.create(rule.attrs)\n      this.addPendingMark(mark)\n    }\n    let startIn = this.top\n\n    if (nodeType && nodeType.isLeaf) {\n      this.findInside(dom)\n    } else if (rule.getContent) {\n      this.findInside(dom)\n      rule.getContent(dom, this.parser.schema).forEach(node => this.insertNode(node))\n    } else {\n      let contentDOM = rule.contentElement\n      if (typeof contentDOM == \"string\") contentDOM = dom.querySelector(contentDOM)\n      else if (typeof contentDOM == \"function\") contentDOM = contentDOM(dom)\n      if (!contentDOM) contentDOM = dom\n      this.findAround(dom, contentDOM, true)\n      this.addAll(contentDOM, sync)\n    }\n    if (sync) { this.sync(startIn); this.open-- }\n    if (mark) this.removePendingMark(mark, startIn)\n  }\n\n  // : (dom.Node, ?NodeBuilder, ?number, ?number)\n  // Add all child nodes between `startIndex` and `endIndex` (or the\n  // whole node, if not given). If `sync` is passed, use it to\n  // synchronize after every block element.\n  addAll(parent, sync, startIndex, endIndex) {\n    let index = startIndex || 0\n    for (let dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,\n             end = endIndex == null ? null : parent.childNodes[endIndex];\n         dom != end; dom = dom.nextSibling, ++index) {\n      this.findAtPoint(parent, index)\n      this.addDOM(dom)\n      if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))\n        this.sync(sync)\n    }\n    this.findAtPoint(parent, index)\n  }\n\n  // Try to find a way to fit the given node type into the current\n  // context. May add intermediate wrappers and/or leave non-solid\n  // nodes that we're in.\n  findPlace(node) {\n    let route, sync\n    for (let depth = this.open; depth >= 0; depth--) {\n      let cx = this.nodes[depth]\n      let found = cx.findWrapping(node)\n      if (found && (!route || route.length > found.length)) {\n        route = found\n        sync = cx\n        if (!found.length) break\n      }\n      if (cx.solid) break\n    }\n    if (!route) return false\n    this.sync(sync)\n    for (let i = 0; i < route.length; i++)\n      this.enterInner(route[i], null, false)\n    return true\n  }\n\n  // : (Node) → ?Node\n  // Try to insert the given node, adjusting the context when needed.\n  insertNode(node) {\n    if (node.isInline && this.needsBlock && !this.top.type) {\n      let block = this.textblockFromContext()\n      if (block) this.enterInner(block)\n    }\n    if (this.findPlace(node)) {\n      this.closeExtra()\n      let top = this.top\n      top.applyPending(node.type)\n      if (top.match) top.match = top.match.matchType(node.type)\n      let marks = top.activeMarks\n      for (let i = 0; i < node.marks.length; i++)\n        if (!top.type || top.type.allowsMarkType(node.marks[i].type))\n          marks = node.marks[i].addToSet(marks)\n      top.content.push(node.mark(marks))\n      return true\n    }\n    return false\n  }\n\n  // : (NodeType, ?Object) → bool\n  // Try to start a node of the given type, adjusting the context when\n  // necessary.\n  enter(type, attrs, preserveWS) {\n    let ok = this.findPlace(type.create(attrs))\n    if (ok) this.enterInner(type, attrs, true, preserveWS)\n    return ok\n  }\n\n  // Open a node of the given type\n  enterInner(type, attrs, solid, preserveWS) {\n    this.closeExtra()\n    let top = this.top\n    top.applyPending(type)\n    top.match = top.match && top.match.matchType(type, attrs)\n    let options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS)\n    if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) options |= OPT_OPEN_LEFT\n    this.nodes.push(new NodeContext(type, attrs, top.activeMarks, top.pendingMarks, solid, null, options))\n    this.open++\n  }\n\n  // Make sure all nodes above this.open are finished and added to\n  // their parents\n  closeExtra(openEnd) {\n    let i = this.nodes.length - 1\n    if (i > this.open) {\n      for (; i > this.open; i--) this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd))\n      this.nodes.length = this.open + 1\n    }\n  }\n\n  finish() {\n    this.open = 0\n    this.closeExtra(this.isOpen)\n    return this.nodes[0].finish(this.isOpen || this.options.topOpen)\n  }\n\n  sync(to) {\n    for (let i = this.open; i >= 0; i--) if (this.nodes[i] == to) {\n      this.open = i\n      return\n    }\n  }\n\n  get currentPos() {\n    this.closeExtra()\n    let pos = 0\n    for (let i = this.open; i >= 0; i--) {\n      let content = this.nodes[i].content\n      for (let j = content.length - 1; j >= 0; j--)\n        pos += content[j].nodeSize\n      if (i) pos++\n    }\n    return pos\n  }\n\n  findAtPoint(parent, offset) {\n    if (this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].node == parent && this.find[i].offset == offset)\n        this.find[i].pos = this.currentPos\n    }\n  }\n\n  findInside(parent) {\n    if (this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node))\n        this.find[i].pos = this.currentPos\n    }\n  }\n\n  findAround(parent, content, before) {\n    if (parent != content && this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {\n        let pos = content.compareDocumentPosition(this.find[i].node)\n        if (pos & (before ? 2 : 4))\n          this.find[i].pos = this.currentPos\n      }\n    }\n  }\n\n  findInText(textNode) {\n    if (this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].node == textNode)\n        this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset)\n    }\n  }\n\n  // : (string) → bool\n  // Determines whether the given [context\n  // string](#ParseRule.context) matches this context.\n  matchesContext(context) {\n    if (context.indexOf(\"|\") > -1)\n      return context.split(/\\s*\\|\\s*/).some(this.matchesContext, this)\n\n    let parts = context.split(\"/\")\n    let option = this.options.context\n    let useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type)\n    let minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1)\n    let match = (i, depth) => {\n      for (; i >= 0; i--) {\n        let part = parts[i]\n        if (part == \"\") {\n          if (i == parts.length - 1 || i == 0) continue\n          for (; depth >= minDepth; depth--)\n            if (match(i - 1, depth)) return true\n          return false\n        } else {\n          let next = depth > 0 || (depth == 0 && useRoot) ? this.nodes[depth].type\n              : option && depth >= minDepth ? option.node(depth - minDepth).type\n              : null\n          if (!next || (next.name != part && next.groups.indexOf(part) == -1))\n            return false\n          depth--\n        }\n      }\n      return true\n    }\n    return match(parts.length - 1, this.open)\n  }\n\n  textblockFromContext() {\n    let $context = this.options.context\n    if ($context) for (let d = $context.depth; d >= 0; d--) {\n      let deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType\n      if (deflt && deflt.isTextblock && deflt.defaultAttrs) return deflt\n    }\n    for (let name in this.parser.schema.nodes) {\n      let type = this.parser.schema.nodes[name]\n      if (type.isTextblock && type.defaultAttrs) return type\n    }\n  }\n\n  addPendingMark(mark) {\n    let found = findSameTypeInSet(mark, this.top.pendingMarks)\n    if (found) this.top.stashMarks.push(found)\n    this.top.pendingMarks = mark.addToSet(this.top.pendingMarks)\n  }\n\n  removePendingMark(mark, upto) {\n    for (let depth = this.open; depth >= 0; depth--) {\n      let level = this.nodes[depth]\n      let found = level.pendingMarks.lastIndexOf(mark)\n      if (found > -1) {\n        level.pendingMarks = mark.removeFromSet(level.pendingMarks)\n      } else {\n        level.activeMarks = mark.removeFromSet(level.activeMarks)\n        let stashMark = level.popFromStashMark(mark.type)\n        if (stashMark) level.activeMarks = stashMark.addToSet(level.activeMarks)\n      }\n      if (level == upto) break\n    }\n  }\n}\n\n// Kludge to work around directly nested list nodes produced by some\n// tools and allowed by browsers to mean that the nested list is\n// actually part of the list item above it.\nfunction normalizeList(dom) {\n  for (let child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {\n    let name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null\n    if (name && listTags.hasOwnProperty(name) && prevItem) {\n      prevItem.appendChild(child)\n      child = prevItem\n    } else if (name == \"li\") {\n      prevItem = child\n    } else if (name) {\n      prevItem = null\n    }\n  }\n}\n\n// Apply a CSS selector.\nfunction matches(dom, selector) {\n  return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)\n}\n\n// : (string) → [string]\n// Tokenize a style attribute into property/value pairs.\nfunction parseStyles(style) {\n  let re = /\\s*([\\w-]+)\\s*:\\s*([^;]+)/g, m, result = []\n  while (m = re.exec(style)) result.push(m[1], m[2].trim())\n  return result\n}\n\nfunction copy(obj) {\n  let copy = {}\n  for (let prop in obj) copy[prop] = obj[prop]\n  return copy\n}\n\n// Used when finding a mark at the top level of a fragment parse.\n// Checks whether it would be reasonable to apply a given mark type to\n// a given node, by looking at the way the mark occurs in the schema.\nfunction markMayApply(markType, nodeType) {\n  let nodes = nodeType.schema.nodes\n  for (let name in nodes) {\n    let parent = nodes[name]\n    if (!parent.allowsMarkType(markType)) continue\n    let seen = [], scan = match => {\n      seen.push(match)\n      for (let i = 0; i < match.edgeCount; i++) {\n        let {type, next} = match.edge(i)\n        if (type == nodeType) return true\n        if (seen.indexOf(next) < 0 && scan(next)) return true\n      }\n    }\n    if (scan(parent.contentMatch)) return true\n  }\n}\n\nfunction findSameTypeInSet(mark, set) {\n  for (let i = 0; i < set.length; i++) {\n    if (mark.type == set[i].type) return set[i]\n  }\n}\n","// DOMOutputSpec:: interface\n// A description of a DOM structure. Can be either a string, which is\n// interpreted as a text node, a DOM node, which is interpreted as\n// itself, a `{dom: Node, contentDOM: ?Node}` object, or an array.\n//\n// An array describes a DOM element. The first value in the array\n// should be a string—the name of the DOM element, optionally prefixed\n// by a namespace URL and a space. If the second element is plain\n// object, it is interpreted as a set of attributes for the element.\n// Any elements after that (including the 2nd if it's not an attribute\n// object) are interpreted as children of the DOM elements, and must\n// either be valid `DOMOutputSpec` values, or the number zero.\n//\n// The number zero (pronounced “hole”) is used to indicate the place\n// where a node's child nodes should be inserted. If it occurs in an\n// output spec, it should be the only child element in its parent\n// node.\n\n// ::- A DOM serializer knows how to convert ProseMirror nodes and\n// marks of various types to DOM nodes.\nexport class DOMSerializer {\n  // :: (Object<(node: Node) → DOMOutputSpec>, Object<?(mark: Mark, inline: bool) → DOMOutputSpec>)\n  // Create a serializer. `nodes` should map node names to functions\n  // that take a node and return a description of the corresponding\n  // DOM. `marks` does the same for mark names, but also gets an\n  // argument that tells it whether the mark's content is block or\n  // inline content (for typical use, it'll always be inline). A mark\n  // serializer may be `null` to indicate that marks of that type\n  // should not be serialized.\n  constructor(nodes, marks) {\n    // :: Object<(node: Node) → DOMOutputSpec>\n    // The node serialization functions.\n    this.nodes = nodes || {}\n    // :: Object<?(mark: Mark, inline: bool) → DOMOutputSpec>\n    // The mark serialization functions.\n    this.marks = marks || {}\n  }\n\n  // :: (Fragment, ?Object) → dom.DocumentFragment\n  // Serialize the content of this fragment to a DOM fragment. When\n  // not in the browser, the `document` option, containing a DOM\n  // document, should be passed so that the serializer can create\n  // nodes.\n  serializeFragment(fragment, options = {}, target) {\n    if (!target) target = doc(options).createDocumentFragment()\n\n    let top = target, active = null\n    fragment.forEach(node => {\n      if (active || node.marks.length) {\n        if (!active) active = []\n        let keep = 0, rendered = 0\n        while (keep < active.length && rendered < node.marks.length) {\n          let next = node.marks[rendered]\n          if (!this.marks[next.type.name]) { rendered++; continue }\n          if (!next.eq(active[keep]) || next.type.spec.spanning === false) break\n          keep += 2; rendered++\n        }\n        while (keep < active.length) {\n          top = active.pop()\n          active.pop()\n        }\n        while (rendered < node.marks.length) {\n          let add = node.marks[rendered++]\n          let markDOM = this.serializeMark(add, node.isInline, options)\n          if (markDOM) {\n            active.push(add, top)\n            top.appendChild(markDOM.dom)\n            top = markDOM.contentDOM || markDOM.dom\n          }\n        }\n      }\n      top.appendChild(this.serializeNode(node, options))\n    })\n\n    return target\n  }\n\n  // :: (Node, ?Object) → dom.Node\n  // Serialize this node to a DOM node. This can be useful when you\n  // need to serialize a part of a document, as opposed to the whole\n  // document. To serialize a whole document, use\n  // [`serializeFragment`](#model.DOMSerializer.serializeFragment) on\n  // its [content](#model.Node.content).\n  serializeNode(node, options = {}) {\n    let {dom, contentDOM} =\n        DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node))\n    if (contentDOM) {\n      if (node.isLeaf)\n        throw new RangeError(\"Content hole not allowed in a leaf node spec\")\n      if (options.onContent)\n        options.onContent(node, contentDOM, options)\n      else\n        this.serializeFragment(node.content, options, contentDOM)\n    }\n    return dom\n  }\n\n  serializeNodeAndMarks(node, options = {}) {\n    let dom = this.serializeNode(node, options)\n    for (let i = node.marks.length - 1; i >= 0; i--) {\n      let wrap = this.serializeMark(node.marks[i], node.isInline, options)\n      if (wrap) {\n        ;(wrap.contentDOM || wrap.dom).appendChild(dom)\n        dom = wrap.dom\n      }\n    }\n    return dom\n  }\n\n  serializeMark(mark, inline, options = {}) {\n    let toDOM = this.marks[mark.type.name]\n    return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))\n  }\n\n  // :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}\n  // Render an [output spec](#model.DOMOutputSpec) to a DOM node. If\n  // the spec has a hole (zero) in it, `contentDOM` will point at the\n  // node with the hole.\n  static renderSpec(doc, structure, xmlNS = null) {\n    if (typeof structure == \"string\")\n      return {dom: doc.createTextNode(structure)}\n    if (structure.nodeType != null)\n      return {dom: structure}\n    if (structure.dom && structure.dom.nodeType != null)\n      return structure\n    let tagName = structure[0], space = tagName.indexOf(\" \")\n    if (space > 0) {\n      xmlNS = tagName.slice(0, space)\n      tagName = tagName.slice(space + 1)\n    }\n    let contentDOM = null, dom = xmlNS ? doc.createElementNS(xmlNS, tagName) : doc.createElement(tagName)\n    let attrs = structure[1], start = 1\n    if (attrs && typeof attrs == \"object\" && attrs.nodeType == null && !Array.isArray(attrs)) {\n      start = 2\n      for (let name in attrs) if (attrs[name] != null) {\n        let space = name.indexOf(\" \")\n        if (space > 0) dom.setAttributeNS(name.slice(0, space), name.slice(space + 1), attrs[name])\n        else dom.setAttribute(name, attrs[name])\n      }\n    }\n    for (let i = start; i < structure.length; i++) {\n      let child = structure[i]\n      if (child === 0) {\n        if (i < structure.length - 1 || i > start)\n          throw new RangeError(\"Content hole must be the only child of its parent node\")\n        return {dom, contentDOM: dom}\n      } else {\n        let {dom: inner, contentDOM: innerContent} = DOMSerializer.renderSpec(doc, child, xmlNS)\n        dom.appendChild(inner)\n        if (innerContent) {\n          if (contentDOM) throw new RangeError(\"Multiple content holes\")\n          contentDOM = innerContent\n        }\n      }\n    }\n    return {dom, contentDOM}\n  }\n\n  // :: (Schema) → DOMSerializer\n  // Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)\n  // properties in a schema's node and mark specs.\n  static fromSchema(schema) {\n    return schema.cached.domSerializer ||\n      (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))\n  }\n\n  // : (Schema) → Object<(node: Node) → DOMOutputSpec>\n  // Gather the serializers in a schema's node specs into an object.\n  // This can be useful as a base to build a custom serializer from.\n  static nodesFromSchema(schema) {\n    let result = gatherToDOM(schema.nodes)\n    if (!result.text) result.text = node => node.text\n    return result\n  }\n\n  // : (Schema) → Object<(mark: Mark) → DOMOutputSpec>\n  // Gather the serializers in a schema's mark specs into an object.\n  static marksFromSchema(schema) {\n    return gatherToDOM(schema.marks)\n  }\n}\n\nfunction gatherToDOM(obj) {\n  let result = {}\n  for (let name in obj) {\n    let toDOM = obj[name].spec.toDOM\n    if (toDOM) result[name] = toDOM\n  }\n  return result\n}\n\nfunction doc(options) {\n  // declare global: window\n  return options.document || window.document\n}\n","// Mappable:: interface\n// There are several things that positions can be mapped through.\n// Such objects conform to this interface.\n//\n//   map:: (pos: number, assoc: ?number) → number\n//   Map a position through this object. When given, `assoc` (should\n//   be -1 or 1, defaults to 1) determines with which side the\n//   position is associated, which determines in which direction to\n//   move when a chunk of content is inserted at the mapped position.\n//\n//   mapResult:: (pos: number, assoc: ?number) → MapResult\n//   Map a position, and return an object containing additional\n//   information about the mapping. The result's `deleted` field tells\n//   you whether the position was deleted (completely enclosed in a\n//   replaced range) during the mapping. When content on only one side\n//   is deleted, the position itself is only considered deleted when\n//   `assoc` points in the direction of the deleted content.\n\n// Recovery values encode a range index and an offset. They are\n// represented as numbers, because tons of them will be created when\n// mapping, for example, a large number of decorations. The number's\n// lower 16 bits provide the index, the remaining bits the offset.\n//\n// Note: We intentionally don't use bit shift operators to en- and\n// decode these, since those clip to 32 bits, which we might in rare\n// cases want to overflow. A 64-bit float can represent 48-bit\n// integers precisely.\n\nconst lower16 = 0xffff\nconst factor16 = Math.pow(2, 16)\n\nfunction makeRecover(index, offset) { return index + offset * factor16 }\nfunction recoverIndex(value) { return value & lower16 }\nfunction recoverOffset(value) { return (value - (value & lower16)) / factor16 }\n\n// ::- An object representing a mapped position with extra\n// information.\nexport class MapResult {\n  constructor(pos, deleted = false, recover = null) {\n    // :: number The mapped version of the position.\n    this.pos = pos\n    // :: bool Tells you whether the position was deleted, that is,\n    // whether the step removed its surroundings from the document.\n    this.deleted = deleted\n    this.recover = recover\n  }\n}\n\n// :: class extends Mappable\n// A map describing the deletions and insertions made by a step, which\n// can be used to find the correspondence between positions in the\n// pre-step version of a document and the same position in the\n// post-step version.\nexport class StepMap {\n  // :: ([number])\n  // Create a position map. The modifications to the document are\n  // represented as an array of numbers, in which each group of three\n  // represents a modified chunk as `[start, oldSize, newSize]`.\n  constructor(ranges, inverted = false) {\n    this.ranges = ranges\n    this.inverted = inverted\n  }\n\n  recover(value) {\n    let diff = 0, index = recoverIndex(value)\n    if (!this.inverted) for (let i = 0; i < index; i++)\n      diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1]\n    return this.ranges[index * 3] + diff + recoverOffset(value)\n  }\n\n  // : (number, ?number) → MapResult\n  mapResult(pos, assoc = 1) { return this._map(pos, assoc, false) }\n\n  // : (number, ?number) → number\n  map(pos, assoc = 1) { return this._map(pos, assoc, true) }\n\n  _map(pos, assoc, simple) {\n    let diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2\n    for (let i = 0; i < this.ranges.length; i += 3) {\n      let start = this.ranges[i] - (this.inverted ? diff : 0)\n      if (start > pos) break\n      let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize\n      if (pos <= end) {\n        let side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc\n        let result = start + diff + (side < 0 ? 0 : newSize)\n        if (simple) return result\n        let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start)\n        return new MapResult(result, assoc < 0 ? pos != start : pos != end, recover)\n      }\n      diff += newSize - oldSize\n    }\n    return simple ? pos + diff : new MapResult(pos + diff)\n  }\n\n  touches(pos, recover) {\n    let diff = 0, index = recoverIndex(recover)\n    let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2\n    for (let i = 0; i < this.ranges.length; i += 3) {\n      let start = this.ranges[i] - (this.inverted ? diff : 0)\n      if (start > pos) break\n      let oldSize = this.ranges[i + oldIndex], end = start + oldSize\n      if (pos <= end && i == index * 3) return true\n      diff += this.ranges[i + newIndex] - oldSize\n    }\n    return false\n  }\n\n  // :: ((oldStart: number, oldEnd: number, newStart: number, newEnd: number))\n  // Calls the given function on each of the changed ranges included in\n  // this map.\n  forEach(f) {\n    let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2\n    for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {\n      let start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff)\n      let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex]\n      f(oldStart, oldStart + oldSize, newStart, newStart + newSize)\n      diff += newSize - oldSize\n    }\n  }\n\n  // :: () → StepMap\n  // Create an inverted version of this map. The result can be used to\n  // map positions in the post-step document to the pre-step document.\n  invert() {\n    return new StepMap(this.ranges, !this.inverted)\n  }\n\n  toString() {\n    return (this.inverted ? \"-\" : \"\") + JSON.stringify(this.ranges)\n  }\n\n  // :: (n: number) → StepMap\n  // Create a map that moves all positions by offset `n` (which may be\n  // negative). This can be useful when applying steps meant for a\n  // sub-document to a larger document, or vice-versa.\n  static offset(n) {\n    return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n])\n  }\n}\n\nStepMap.empty = new StepMap([])\n\n// :: class extends Mappable\n// A mapping represents a pipeline of zero or more [step\n// maps](#transform.StepMap). It has special provisions for losslessly\n// handling mapping positions through a series of steps in which some\n// steps are inverted versions of earlier steps. (This comes up when\n// ‘[rebasing](/docs/guide/#transform.rebasing)’ steps for\n// collaboration or history management.)\nexport class Mapping {\n  // :: (?[StepMap])\n  // Create a new mapping with the given position maps.\n  constructor(maps, mirror, from, to) {\n    // :: [StepMap]\n    // The step maps in this mapping.\n    this.maps = maps || []\n    // :: number\n    // The starting position in the `maps` array, used when `map` or\n    // `mapResult` is called.\n    this.from = from || 0\n    // :: number\n    // The end position in the `maps` array.\n    this.to = to == null ? this.maps.length : to\n    this.mirror = mirror\n  }\n\n  // :: (?number, ?number) → Mapping\n  // Create a mapping that maps only through a part of this one.\n  slice(from = 0, to = this.maps.length) {\n    return new Mapping(this.maps, this.mirror, from, to)\n  }\n\n  copy() {\n    return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to)\n  }\n\n  // :: (StepMap, ?number)\n  // Add a step map to the end of this mapping. If `mirrors` is\n  // given, it should be the index of the step map that is the mirror\n  // image of this one.\n  appendMap(map, mirrors) {\n    this.to = this.maps.push(map)\n    if (mirrors != null) this.setMirror(this.maps.length - 1, mirrors)\n  }\n\n  // :: (Mapping)\n  // Add all the step maps in a given mapping to this one (preserving\n  // mirroring information).\n  appendMapping(mapping) {\n    for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n      let mirr = mapping.getMirror(i)\n      this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : null)\n    }\n  }\n\n  // :: (number) → ?number\n  // Finds the offset of the step map that mirrors the map at the\n  // given offset, in this mapping (as per the second argument to\n  // `appendMap`).\n  getMirror(n) {\n    if (this.mirror) for (let i = 0; i < this.mirror.length; i++)\n      if (this.mirror[i] == n) return this.mirror[i + (i % 2 ? -1 : 1)]\n  }\n\n  setMirror(n, m) {\n    if (!this.mirror) this.mirror = []\n    this.mirror.push(n, m)\n  }\n\n  // :: (Mapping)\n  // Append the inverse of the given mapping to this one.\n  appendMappingInverted(mapping) {\n    for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n      let mirr = mapping.getMirror(i)\n      this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : null)\n    }\n  }\n\n  // :: () → Mapping\n  // Create an inverted version of this mapping.\n  invert() {\n    let inverse = new Mapping\n    inverse.appendMappingInverted(this)\n    return inverse\n  }\n\n  // : (number, ?number) → number\n  // Map a position through this mapping.\n  map(pos, assoc = 1) {\n    if (this.mirror) return this._map(pos, assoc, true)\n    for (let i = this.from; i < this.to; i++)\n      pos = this.maps[i].map(pos, assoc)\n    return pos\n  }\n\n  // : (number, ?number) → MapResult\n  // Map a position through this mapping, returning a mapping\n  // result.\n  mapResult(pos, assoc = 1) { return this._map(pos, assoc, false) }\n\n  _map(pos, assoc, simple) {\n    let deleted = false\n\n    for (let i = this.from; i < this.to; i++) {\n      let map = this.maps[i], result = map.mapResult(pos, assoc)\n      if (result.recover != null) {\n        let corr = this.getMirror(i)\n        if (corr != null && corr > i && corr < this.to) {\n          i = corr\n          pos = this.maps[corr].recover(result.recover)\n          continue\n        }\n      }\n\n      if (result.deleted) deleted = true\n      pos = result.pos\n    }\n\n    return simple ? pos : new MapResult(pos, deleted)\n  }\n}\n","import {Mapping} from \"./map\"\n\nexport function TransformError(message) {\n  let err = Error.call(this, message)\n  err.__proto__ = TransformError.prototype\n  return err\n}\n\nTransformError.prototype = Object.create(Error.prototype)\nTransformError.prototype.constructor = TransformError\nTransformError.prototype.name = \"TransformError\"\n\n// ::- Abstraction to build up and track an array of\n// [steps](#transform.Step) representing a document transformation.\n//\n// Most transforming methods return the `Transform` object itself, so\n// that they can be chained.\nexport class Transform {\n  // :: (Node)\n  // Create a transform that starts with the given document.\n  constructor(doc) {\n    // :: Node\n    // The current document (the result of applying the steps in the\n    // transform).\n    this.doc = doc\n    // :: [Step]\n    // The steps in this transform.\n    this.steps = []\n    // :: [Node]\n    // The documents before each of the steps.\n    this.docs = []\n    // :: Mapping\n    // A mapping with the maps for each of the steps in this transform.\n    this.mapping = new Mapping\n  }\n\n  // :: Node The starting document.\n  get before() { return this.docs.length ? this.docs[0] : this.doc }\n\n  // :: (step: Step) → this\n  // Apply a new step in this transform, saving the result. Throws an\n  // error when the step fails.\n  step(object) {\n    let result = this.maybeStep(object)\n    if (result.failed) throw new TransformError(result.failed)\n    return this\n  }\n\n  // :: (Step) → StepResult\n  // Try to apply a step in this transformation, ignoring it if it\n  // fails. Returns the step result.\n  maybeStep(step) {\n    let result = step.apply(this.doc)\n    if (!result.failed) this.addStep(step, result.doc)\n    return result\n  }\n\n  // :: bool\n  // True when the document has been changed (when there are any\n  // steps).\n  get docChanged() {\n    return this.steps.length > 0\n  }\n\n  addStep(step, doc) {\n    this.docs.push(this.doc)\n    this.steps.push(step)\n    this.mapping.appendMap(step.getMap())\n    this.doc = doc\n  }\n}\n","import {ReplaceError} from \"prosemirror-model\"\n\nimport {StepMap} from \"./map\"\n\nfunction mustOverride() { throw new Error(\"Override me\") }\n\nconst stepsByID = Object.create(null)\n\n// ::- A step object represents an atomic change. It generally applies\n// only to the document it was created for, since the positions\n// stored in it will only make sense for that document.\n//\n// New steps are defined by creating classes that extend `Step`,\n// overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`\n// methods, and registering your class with a unique\n// JSON-serialization identifier using\n// [`Step.jsonID`](#transform.Step^jsonID).\nexport class Step {\n  // :: (doc: Node) → StepResult\n  // Applies this step to the given document, returning a result\n  // object that either indicates failure, if the step can not be\n  // applied to this document, or indicates success by containing a\n  // transformed document.\n  apply(_doc) { return mustOverride() }\n\n  // :: () → StepMap\n  // Get the step map that represents the changes made by this step,\n  // and which can be used to transform between positions in the old\n  // and the new document.\n  getMap() { return StepMap.empty }\n\n  // :: (doc: Node) → Step\n  // Create an inverted version of this step. Needs the document as it\n  // was before the step as argument.\n  invert(_doc) { return mustOverride() }\n\n  // :: (mapping: Mappable) → ?Step\n  // Map this step through a mappable thing, returning either a\n  // version of that step with its positions adjusted, or `null` if\n  // the step was entirely deleted by the mapping.\n  map(_mapping) { return mustOverride() }\n\n  // :: (other: Step) → ?Step\n  // Try to merge this step with another one, to be applied directly\n  // after it. Returns the merged step when possible, null if the\n  // steps can't be merged.\n  merge(_other) { return null }\n\n  // :: () → Object\n  // Create a JSON-serializeable representation of this step. When\n  // defining this for a custom subclass, make sure the result object\n  // includes the step type's [JSON id](#transform.Step^jsonID) under\n  // the `stepType` property.\n  toJSON() { return mustOverride() }\n\n  // :: (Schema, Object) → Step\n  // Deserialize a step from its JSON representation. Will call\n  // through to the step class' own implementation of this method.\n  static fromJSON(schema, json) {\n    if (!json || !json.stepType) throw new RangeError(\"Invalid input for Step.fromJSON\")\n    let type = stepsByID[json.stepType]\n    if (!type) throw new RangeError(`No step type ${json.stepType} defined`)\n    return type.fromJSON(schema, json)\n  }\n\n  // :: (string, constructor<Step>)\n  // To be able to serialize steps to JSON, each step needs a string\n  // ID to attach to its JSON representation. Use this method to\n  // register an ID for your step classes. Try to pick something\n  // that's unlikely to clash with steps from other modules.\n  static jsonID(id, stepClass) {\n    if (id in stepsByID) throw new RangeError(\"Duplicate use of step JSON ID \" + id)\n    stepsByID[id] = stepClass\n    stepClass.prototype.jsonID = id\n    return stepClass\n  }\n}\n\n// ::- The result of [applying](#transform.Step.apply) a step. Contains either a\n// new document or a failure value.\nexport class StepResult {\n  // : (?Node, ?string)\n  constructor(doc, failed) {\n    // :: ?Node The transformed document.\n    this.doc = doc\n    // :: ?string Text providing information about a failed step.\n    this.failed = failed\n  }\n\n  // :: (Node) → StepResult\n  // Create a successful step result.\n  static ok(doc) { return new StepResult(doc, null) }\n\n  // :: (string) → StepResult\n  // Create a failed step result.\n  static fail(message) { return new StepResult(null, message) }\n\n  // :: (Node, number, number, Slice) → StepResult\n  // Call [`Node.replace`](#model.Node.replace) with the given\n  // arguments. Create a successful result if it succeeds, and a\n  // failed one if it throws a `ReplaceError`.\n  static fromReplace(doc, from, to, slice) {\n    try {\n      return StepResult.ok(doc.replace(from, to, slice))\n    } catch (e) {\n      if (e instanceof ReplaceError) return StepResult.fail(e.message)\n      throw e\n    }\n  }\n}\n","import {Slice} from \"prosemirror-model\"\n\nimport {Step, StepResult} from \"./step\"\nimport {StepMap} from \"./map\"\n\n// ::- Replace a part of the document with a slice of new content.\nexport class ReplaceStep extends Step {\n  // :: (number, number, Slice, ?bool)\n  // The given `slice` should fit the 'gap' between `from` and\n  // `to`—the depths must line up, and the surrounding nodes must be\n  // able to be joined with the open sides of the slice. When\n  // `structure` is true, the step will fail if the content between\n  // from and to is not just a sequence of closing and then opening\n  // tokens (this is to guard against rebased replace steps\n  // overwriting something they weren't supposed to).\n  constructor(from, to, slice, structure) {\n    super()\n    this.from = from\n    this.to = to\n    this.slice = slice\n    this.structure = !!structure\n  }\n\n  apply(doc) {\n    if (this.structure && contentBetween(doc, this.from, this.to))\n      return StepResult.fail(\"Structure replace would overwrite content\")\n    return StepResult.fromReplace(doc, this.from, this.to, this.slice)\n  }\n\n  getMap() {\n    return new StepMap([this.from, this.to - this.from, this.slice.size])\n  }\n\n  invert(doc) {\n    return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    if (from.deleted && to.deleted) return null\n    return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice)\n  }\n\n  merge(other) {\n    if (!(other instanceof ReplaceStep) || other.structure != this.structure) return null\n\n    if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {\n      let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n          : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd)\n      return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure)\n    } else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {\n      let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n          : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd)\n      return new ReplaceStep(other.from, this.to, slice, this.structure)\n    } else {\n      return null\n    }\n  }\n\n  toJSON() {\n    let json = {stepType: \"replace\", from: this.from, to: this.to}\n    if (this.slice.size) json.slice = this.slice.toJSON()\n    if (this.structure) json.structure = true\n    return json\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\")\n      throw new RangeError(\"Invalid input for ReplaceStep.fromJSON\")\n    return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure)\n  }\n}\n\nStep.jsonID(\"replace\", ReplaceStep)\n\n// ::- Replace a part of the document with a slice of content, but\n// preserve a range of the replaced content by moving it into the\n// slice.\nexport class ReplaceAroundStep extends Step {\n  // :: (number, number, number, number, Slice, number, ?bool)\n  // Create a replace-around step with the given range and gap.\n  // `insert` should be the point in the slice into which the content\n  // of the gap should be moved. `structure` has the same meaning as\n  // it has in the [`ReplaceStep`](#transform.ReplaceStep) class.\n  constructor(from, to, gapFrom, gapTo, slice, insert, structure) {\n    super()\n    this.from = from\n    this.to = to\n    this.gapFrom = gapFrom\n    this.gapTo = gapTo\n    this.slice = slice\n    this.insert = insert\n    this.structure = !!structure\n  }\n\n  apply(doc) {\n    if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||\n                           contentBetween(doc, this.gapTo, this.to)))\n      return StepResult.fail(\"Structure gap-replace would overwrite content\")\n\n    let gap = doc.slice(this.gapFrom, this.gapTo)\n    if (gap.openStart || gap.openEnd)\n      return StepResult.fail(\"Gap is not a flat range\")\n    let inserted = this.slice.insertAt(this.insert, gap.content)\n    if (!inserted) return StepResult.fail(\"Content does not fit in gap\")\n    return StepResult.fromReplace(doc, this.from, this.to, inserted)\n  }\n\n  getMap() {\n    return new StepMap([this.from, this.gapFrom - this.from, this.insert,\n                        this.gapTo, this.to - this.gapTo, this.slice.size - this.insert])\n  }\n\n  invert(doc) {\n    let gap = this.gapTo - this.gapFrom\n    return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap,\n                                 this.from + this.insert, this.from + this.insert + gap,\n                                 doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),\n                                 this.gapFrom - this.from, this.structure)\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    let gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1)\n    if ((from.deleted && to.deleted) || gapFrom < from.pos || gapTo > to.pos) return null\n    return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure)\n  }\n\n  toJSON() {\n    let json = {stepType: \"replaceAround\", from: this.from, to: this.to,\n                gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert}\n    if (this.slice.size) json.slice = this.slice.toJSON()\n    if (this.structure) json.structure = true\n    return json\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\" ||\n        typeof json.gapFrom != \"number\" || typeof json.gapTo != \"number\" || typeof json.insert != \"number\")\n      throw new RangeError(\"Invalid input for ReplaceAroundStep.fromJSON\")\n    return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo,\n                                 Slice.fromJSON(schema, json.slice), json.insert, !!json.structure)\n  }\n}\n\nStep.jsonID(\"replaceAround\", ReplaceAroundStep)\n\nfunction contentBetween(doc, from, to) {\n  let $from = doc.resolve(from), dist = to - from, depth = $from.depth\n  while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {\n    depth--\n    dist--\n  }\n  if (dist > 0) {\n    let next = $from.node(depth).maybeChild($from.indexAfter(depth))\n    while (dist > 0) {\n      if (!next || next.isLeaf) return true\n      next = next.firstChild\n      dist--\n    }\n  }\n  return false\n}\n","import {Slice, Fragment} from \"prosemirror-model\"\n\nimport {Transform} from \"./transform\"\nimport {ReplaceStep, ReplaceAroundStep} from \"./replace_step\"\n\nfunction canCut(node, start, end) {\n  return (start == 0 || node.canReplace(start, node.childCount)) &&\n    (end == node.childCount || node.canReplace(0, end))\n}\n\n// :: (NodeRange) → ?number\n// Try to find a target depth to which the content in the given range\n// can be lifted. Will not go across\n// [isolating](#model.NodeSpec.isolating) parent nodes.\nexport function liftTarget(range) {\n  let parent = range.parent\n  let content = parent.content.cutByIndex(range.startIndex, range.endIndex)\n  for (let depth = range.depth;; --depth) {\n    let node = range.$from.node(depth)\n    let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth)\n    if (depth < range.depth && node.canReplace(index, endIndex, content))\n      return depth\n    if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex)) break\n  }\n}\n\n// :: (NodeRange, number) → this\n// Split the content in the given range off from its parent, if there\n// is sibling content before or after it, and move it up the tree to\n// the depth specified by `target`. You'll probably want to use\n// [`liftTarget`](#transform.liftTarget) to compute `target`, to make\n// sure the lift is valid.\nTransform.prototype.lift = function(range, target) {\n  let {$from, $to, depth} = range\n\n  let gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1)\n  let start = gapStart, end = gapEnd\n\n  let before = Fragment.empty, openStart = 0\n  for (let d = depth, splitting = false; d > target; d--)\n    if (splitting || $from.index(d) > 0) {\n      splitting = true\n      before = Fragment.from($from.node(d).copy(before))\n      openStart++\n    } else {\n      start--\n    }\n  let after = Fragment.empty, openEnd = 0\n  for (let d = depth, splitting = false; d > target; d--)\n    if (splitting || $to.after(d + 1) < $to.end(d)) {\n      splitting = true\n      after = Fragment.from($to.node(d).copy(after))\n      openEnd++\n    } else {\n      end++\n    }\n\n  return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,\n                                         new Slice(before.append(after), openStart, openEnd),\n                                         before.size - openStart, true))\n}\n\n// :: (NodeRange, NodeType, ?Object, ?NodeRange) → ?[{type: NodeType, attrs: ?Object}]\n// Try to find a valid way to wrap the content in the given range in a\n// node of the given type. May introduce extra nodes around and inside\n// the wrapper node, if necessary. Returns null if no valid wrapping\n// could be found. When `innerRange` is given, that range's content is\n// used as the content to fit into the wrapping, instead of the\n// content of `range`.\nexport function findWrapping(range, nodeType, attrs, innerRange = range) {\n  let around = findWrappingOutside(range, nodeType)\n  let inner = around && findWrappingInside(innerRange, nodeType)\n  if (!inner) return null\n  return around.map(withAttrs).concat({type: nodeType, attrs}).concat(inner.map(withAttrs))\n}\n\nfunction withAttrs(type) { return {type, attrs: null} }\n\nfunction findWrappingOutside(range, type) {\n  let {parent, startIndex, endIndex} = range\n  let around = parent.contentMatchAt(startIndex).findWrapping(type)\n  if (!around) return null\n  let outer = around.length ? around[0] : type\n  return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null\n}\n\nfunction findWrappingInside(range, type) {\n  let {parent, startIndex, endIndex} = range\n  let inner = parent.child(startIndex)\n  let inside = type.contentMatch.findWrapping(inner.type)\n  if (!inside) return null\n  let lastType = inside.length ? inside[inside.length - 1] : type\n  let innerMatch = lastType.contentMatch\n  for (let i = startIndex; innerMatch && i < endIndex; i++)\n    innerMatch = innerMatch.matchType(parent.child(i).type)\n  if (!innerMatch || !innerMatch.validEnd) return null\n  return inside\n}\n\n// :: (NodeRange, [{type: NodeType, attrs: ?Object}]) → this\n// Wrap the given [range](#model.NodeRange) in the given set of wrappers.\n// The wrappers are assumed to be valid in this position, and should\n// probably be computed with [`findWrapping`](#transform.findWrapping).\nTransform.prototype.wrap = function(range, wrappers) {\n  let content = Fragment.empty\n  for (let i = wrappers.length - 1; i >= 0; i--)\n    content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content))\n\n  let start = range.start, end = range.end\n  return this.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true))\n}\n\n// :: (number, ?number, NodeType, ?Object) → this\n// Set the type of all textblocks (partly) between `from` and `to` to\n// the given node type with the given attributes.\nTransform.prototype.setBlockType = function(from, to = from, type, attrs) {\n  if (!type.isTextblock) throw new RangeError(\"Type given to setBlockType should be a textblock\")\n  let mapFrom = this.steps.length\n  this.doc.nodesBetween(from, to, (node, pos) => {\n    if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this.doc, this.mapping.slice(mapFrom).map(pos), type)) {\n      // Ensure all markup that isn't allowed in the new node type is cleared\n      this.clearIncompatible(this.mapping.slice(mapFrom).map(pos, 1), type)\n      let mapping = this.mapping.slice(mapFrom)\n      let startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1)\n      this.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,\n                                      new Slice(Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true))\n      return false\n    }\n  })\n  return this\n}\n\nfunction canChangeType(doc, pos, type) {\n  let $pos = doc.resolve(pos), index = $pos.index()\n  return $pos.parent.canReplaceWith(index, index + 1, type)\n}\n\n// :: (number, ?NodeType, ?Object, ?[Mark]) → this\n// Change the type, attributes, and/or marks of the node at `pos`.\n// When `type` isn't given, the existing node type is preserved,\nTransform.prototype.setNodeMarkup = function(pos, type, attrs, marks) {\n  let node = this.doc.nodeAt(pos)\n  if (!node) throw new RangeError(\"No node at given position\")\n  if (!type) type = node.type\n  let newNode = type.create(attrs, null, marks || node.marks)\n  if (node.isLeaf)\n    return this.replaceWith(pos, pos + node.nodeSize, newNode)\n\n  if (!type.validContent(node.content))\n    throw new RangeError(\"Invalid content for node type \" + type.name)\n\n  return this.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1,\n                                         new Slice(Fragment.from(newNode), 0, 0), 1, true))\n}\n\n// :: (Node, number, number, ?[?{type: NodeType, attrs: ?Object}]) → bool\n// Check whether splitting at the given position is allowed.\nexport function canSplit(doc, pos, depth = 1, typesAfter) {\n  let $pos = doc.resolve(pos), base = $pos.depth - depth\n  let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent\n  if (base < 0 || $pos.parent.type.spec.isolating ||\n      !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||\n      !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))\n    return false\n  for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n    let node = $pos.node(d), index = $pos.index(d)\n    if (node.type.spec.isolating) return false\n    let rest = node.content.cutByIndex(index, node.childCount)\n    let after = (typesAfter && typesAfter[i]) || node\n    if (after != node) rest = rest.replaceChild(0, after.type.create(after.attrs))\n    if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n      return false\n  }\n  let index = $pos.indexAfter(base)\n  let baseType = typesAfter && typesAfter[0]\n  return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type)\n}\n\n// :: (number, ?number, ?[?{type: NodeType, attrs: ?Object}]) → this\n// Split the node at the given position, and optionally, if `depth` is\n// greater than one, any number of nodes above that. By default, the\n// parts split off will inherit the node type of the original node.\n// This can be changed by passing an array of types and attributes to\n// use after the split.\nTransform.prototype.split = function(pos, depth = 1, typesAfter) {\n  let $pos = this.doc.resolve(pos), before = Fragment.empty, after = Fragment.empty\n  for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n    before = Fragment.from($pos.node(d).copy(before))\n    let typeAfter = typesAfter && typesAfter[i]\n    after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after))\n  }\n  return this.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true))\n}\n\n// :: (Node, number) → bool\n// Test whether the blocks before and after a given position can be\n// joined.\nexport function canJoin(doc, pos) {\n  let $pos = doc.resolve(pos), index = $pos.index()\n  return joinable($pos.nodeBefore, $pos.nodeAfter) &&\n    $pos.parent.canReplace(index, index + 1)\n}\n\nfunction joinable(a, b) {\n  return a && b && !a.isLeaf && a.canAppend(b)\n}\n\n// :: (Node, number, ?number) → ?number\n// Find an ancestor of the given position that can be joined to the\n// block before (or after if `dir` is positive). Returns the joinable\n// point, if any.\nexport function joinPoint(doc, pos, dir = -1) {\n  let $pos = doc.resolve(pos)\n  for (let d = $pos.depth;; d--) {\n    let before, after, index = $pos.index(d)\n    if (d == $pos.depth) {\n      before = $pos.nodeBefore\n      after = $pos.nodeAfter\n    } else if (dir > 0) {\n      before = $pos.node(d + 1)\n      index++\n      after = $pos.node(d).maybeChild(index)\n    } else {\n      before = $pos.node(d).maybeChild(index - 1)\n      after = $pos.node(d + 1)\n    }\n    if (before && !before.isTextblock && joinable(before, after) &&\n        $pos.node(d).canReplace(index, index + 1)) return pos\n    if (d == 0) break\n    pos = dir < 0 ? $pos.before(d) : $pos.after(d)\n  }\n}\n\n// :: (number, ?number) → this\n// Join the blocks around the given position. If depth is 2, their\n// last and first siblings are also joined, and so on.\nTransform.prototype.join = function(pos, depth = 1) {\n  let step = new ReplaceStep(pos - depth, pos + depth, Slice.empty, true)\n  return this.step(step)\n}\n\n// :: (Node, number, NodeType) → ?number\n// Try to find a point where a node of the given type can be inserted\n// near `pos`, by searching up the node hierarchy when `pos` itself\n// isn't a valid place but is at the start or end of a node. Return\n// null if no position was found.\nexport function insertPoint(doc, pos, nodeType) {\n  let $pos = doc.resolve(pos)\n  if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) return pos\n\n  if ($pos.parentOffset == 0)\n    for (let d = $pos.depth - 1; d >= 0; d--) {\n      let index = $pos.index(d)\n      if ($pos.node(d).canReplaceWith(index, index, nodeType)) return $pos.before(d + 1)\n      if (index > 0) return null\n    }\n  if ($pos.parentOffset == $pos.parent.content.size)\n    for (let d = $pos.depth - 1; d >= 0; d--) {\n      let index = $pos.indexAfter(d)\n      if ($pos.node(d).canReplaceWith(index, index, nodeType)) return $pos.after(d + 1)\n      if (index < $pos.node(d).childCount) return null\n    }\n}\n\n// :: (Node, number, Slice) → ?number\n// Finds a position at or around the given position where the given\n// slice can be inserted. Will look at parent nodes' nearest boundary\n// and try there, even if the original position wasn't directly at the\n// start or end of that node. Returns null when no position was found.\nexport function dropPoint(doc, pos, slice) {\n  let $pos = doc.resolve(pos)\n  if (!slice.content.size) return pos\n  let content = slice.content\n  for (let i = 0; i < slice.openStart; i++) content = content.firstChild.content\n  for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n    for (let d = $pos.depth; d >= 0; d--) {\n      let bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1\n      let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0)\n      if (pass == 1\n          ? $pos.node(d).canReplace(insertPos, insertPos, content)\n          : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))\n        return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1)\n    }\n  }\n  return null\n}\n","import {Fragment, Slice} from \"prosemirror-model\"\nimport {Step, StepResult} from \"./step\"\n\nfunction mapFragment(fragment, f, parent) {\n  let mapped = []\n  for (let i = 0; i < fragment.childCount; i++) {\n    let child = fragment.child(i)\n    if (child.content.size) child = child.copy(mapFragment(child.content, f, child))\n    if (child.isInline) child = f(child, parent, i)\n    mapped.push(child)\n  }\n  return Fragment.fromArray(mapped)\n}\n\n// ::- Add a mark to all inline content between two positions.\nexport class AddMarkStep extends Step {\n  // :: (number, number, Mark)\n  constructor(from, to, mark) {\n    super()\n    this.from = from\n    this.to = to\n    this.mark = mark\n  }\n\n  apply(doc) {\n    let oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from)\n    let parent = $from.node($from.sharedDepth(this.to))\n    let slice = new Slice(mapFragment(oldSlice.content, (node, parent) => {\n      if (!parent.type.allowsMarkType(this.mark.type)) return node\n      return node.mark(this.mark.addToSet(node.marks))\n    }, parent), oldSlice.openStart, oldSlice.openEnd)\n    return StepResult.fromReplace(doc, this.from, this.to, slice)\n  }\n\n  invert() {\n    return new RemoveMarkStep(this.from, this.to, this.mark)\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    if (from.deleted && to.deleted || from.pos >= to.pos) return null\n    return new AddMarkStep(from.pos, to.pos, this.mark)\n  }\n\n  merge(other) {\n    if (other instanceof AddMarkStep &&\n        other.mark.eq(this.mark) &&\n        this.from <= other.to && this.to >= other.from)\n      return new AddMarkStep(Math.min(this.from, other.from),\n                             Math.max(this.to, other.to), this.mark)\n  }\n\n  toJSON() {\n    return {stepType: \"addMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to}\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\")\n      throw new RangeError(\"Invalid input for AddMarkStep.fromJSON\")\n    return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark))\n  }\n}\n\nStep.jsonID(\"addMark\", AddMarkStep)\n\n// ::- Remove a mark from all inline content between two positions.\nexport class RemoveMarkStep extends Step {\n  // :: (number, number, Mark)\n  constructor(from, to, mark) {\n    super()\n    this.from = from\n    this.to = to\n    this.mark = mark\n  }\n\n  apply(doc) {\n    let oldSlice = doc.slice(this.from, this.to)\n    let slice = new Slice(mapFragment(oldSlice.content, node => {\n      return node.mark(this.mark.removeFromSet(node.marks))\n    }), oldSlice.openStart, oldSlice.openEnd)\n    return StepResult.fromReplace(doc, this.from, this.to, slice)\n  }\n\n  invert() {\n    return new AddMarkStep(this.from, this.to, this.mark)\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    if (from.deleted && to.deleted || from.pos >= to.pos) return null\n    return new RemoveMarkStep(from.pos, to.pos, this.mark)\n  }\n\n  merge(other) {\n    if (other instanceof RemoveMarkStep &&\n        other.mark.eq(this.mark) &&\n        this.from <= other.to && this.to >= other.from)\n      return new RemoveMarkStep(Math.min(this.from, other.from),\n                                Math.max(this.to, other.to), this.mark)\n  }\n\n  toJSON() {\n    return {stepType: \"removeMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to}\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\")\n      throw new RangeError(\"Invalid input for RemoveMarkStep.fromJSON\")\n    return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark))\n  }\n}\n\nStep.jsonID(\"removeMark\", RemoveMarkStep)\n","import {Plugin} from \"prosemirror-state\"\nimport {dropPoint} from \"prosemirror-transform\"\n\n// :: (options: ?Object) → Plugin\n// Create a plugin that, when added to a ProseMirror instance,\n// causes a decoration to show up at the drop position when something\n// is dragged over the editor.\n//\n//   options::- These options are supported:\n//\n//     color:: ?string\n//     The color of the cursor. Defaults to `black`.\n//\n//     width:: ?number\n//     The precise width of the cursor in pixels. Defaults to 1.\n//\n//     class:: ?string\n//     A CSS class name to add to the cursor element.\nexport function dropCursor(options = {}) {\n  return new Plugin({\n    view(editorView) { return new DropCursorView(editorView, options) }\n  })\n}\n\nclass DropCursorView {\n  constructor(editorView, options) {\n    this.editorView = editorView\n    this.width = options.width || 1\n    this.color = options.color || \"black\"\n    this.class = options.class\n    this.cursorPos = null\n    this.element = null\n    this.timeout = null\n\n    this.handlers = [\"dragover\", \"dragend\", \"drop\", \"dragleave\"].map(name => {\n      let handler = e => this[name](e)\n      editorView.dom.addEventListener(name, handler)\n      return {name, handler}\n    })\n  }\n\n  destroy() {\n    this.handlers.forEach(({name, handler}) => this.editorView.dom.removeEventListener(name, handler))\n  }\n\n  update(editorView, prevState) {\n    if (this.cursorPos != null && prevState.doc != editorView.state.doc) this.updateOverlay()\n  }\n\n  setCursor(pos) {\n    if (pos == this.cursorPos) return\n    this.cursorPos = pos\n    if (pos == null) {\n      this.element.parentNode.removeChild(this.element)\n      this.element = null\n    } else {\n      this.updateOverlay()\n    }\n  }\n\n  updateOverlay() {\n    let $pos = this.editorView.state.doc.resolve(this.cursorPos), rect\n    if (!$pos.parent.inlineContent) {\n      let before = $pos.nodeBefore, after = $pos.nodeAfter\n      if (before || after) {\n        let nodeRect = this.editorView.nodeDOM(this.cursorPos - (before ?  before.nodeSize : 0)).getBoundingClientRect()\n        let top = before ? nodeRect.bottom : nodeRect.top\n        if (before && after)\n          top = (top + this.editorView.nodeDOM(this.cursorPos).getBoundingClientRect().top) / 2\n        rect = {left: nodeRect.left, right: nodeRect.right, top: top - this.width / 2, bottom: top + this.width / 2}\n      }\n    }\n    if (!rect) {\n      let coords = this.editorView.coordsAtPos(this.cursorPos)\n      rect = {left: coords.left - this.width / 2, right: coords.left + this.width / 2, top: coords.top, bottom: coords.bottom}\n    }\n\n    let parent = this.editorView.dom.offsetParent\n    if (!this.element) {\n      this.element = parent.appendChild(document.createElement(\"div\"))\n      if (this.class) this.element.className = this.class\n      this.element.style.cssText = \"position: absolute; z-index: 50; pointer-events: none; background-color: \" + this.color\n    }\n    let parentRect = !parent || parent == document.body && getComputedStyle(parent).position == \"static\"\n        ? {left: -pageXOffset, top: -pageYOffset} : parent.getBoundingClientRect()\n    this.element.style.left = (rect.left - parentRect.left) + \"px\"\n    this.element.style.top = (rect.top - parentRect.top) + \"px\"\n    this.element.style.width = (rect.right - rect.left) + \"px\"\n    this.element.style.height = (rect.bottom - rect.top) + \"px\"\n  }\n\n  scheduleRemoval(timeout) {\n    clearTimeout(this.timeout)\n    this.timeout = setTimeout(() => this.setCursor(null), timeout)\n  }\n\n  dragover(event) {\n    if (!this.editorView.editable) return\n    let pos = this.editorView.posAtCoords({left: event.clientX, top: event.clientY})\n    if (pos) {\n      let target = pos.pos\n      if (this.editorView.dragging && this.editorView.dragging.slice) {\n        target = dropPoint(this.editorView.state.doc, target, this.editorView.dragging.slice)\n        if (target == null) target = pos.pos\n      }\n      this.setCursor(target)\n      this.scheduleRemoval(5000)\n    }\n  }\n\n  dragend() {\n    this.scheduleRemoval(20)\n  }\n\n  drop() {\n    this.scheduleRemoval(20)\n  }\n\n  dragleave(event) {\n    if (event.target == this.editorView.dom || !this.editorView.dom.contains(event.relatedTarget))\n      this.setCursor(null)\n  }\n}\n","import {Selection, NodeSelection} from \"prosemirror-state\"\nimport {Slice} from \"prosemirror-model\"\n\n// ::- Gap cursor selections are represented using this class. Its\n// `$anchor` and `$head` properties both point at the cursor position.\nexport class GapCursor extends Selection {\n  // : (ResolvedPos)\n  constructor($pos) {\n    super($pos, $pos)\n  }\n\n  map(doc, mapping) {\n    let $pos = doc.resolve(mapping.map(this.head))\n    return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos)\n  }\n\n  content() { return Slice.empty }\n\n  eq(other) {\n    return other instanceof GapCursor && other.head == this.head\n  }\n\n  toJSON() {\n    return {type: \"gapcursor\", pos: this.head}\n  }\n\n  static fromJSON(doc, json) {\n    if (typeof json.pos != \"number\") throw new RangeError(\"Invalid input for GapCursor.fromJSON\")\n    return new GapCursor(doc.resolve(json.pos))\n  }\n\n  getBookmark() { return new GapBookmark(this.anchor) }\n\n  static valid($pos) {\n    let parent = $pos.parent\n    if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos)) return false\n    let override = parent.type.spec.allowGapCursor\n    if (override != null) return override\n    let deflt = parent.contentMatchAt($pos.index()).defaultType\n    return deflt && deflt.isTextblock\n  }\n\n  static findFrom($pos, dir, mustMove) {\n    search: for (;;) {\n      if (!mustMove && GapCursor.valid($pos)) return $pos\n      let pos = $pos.pos, next = null\n      // Scan up from this position\n      for (let d = $pos.depth;; d--) {\n        let parent = $pos.node(d)\n        if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {\n          next = parent.child(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1)\n          break\n        } else if (d == 0) {\n          return null\n        }\n        pos += dir\n        let $cur = $pos.doc.resolve(pos)\n        if (GapCursor.valid($cur)) return $cur\n      }\n\n      // And then down into the next node\n      for (;;) {\n        let inside = dir > 0 ? next.firstChild : next.lastChild\n        if (!inside) {\n          if (next.isAtom && !next.isText && !NodeSelection.isSelectable(next)) {\n            $pos = $pos.doc.resolve(pos + next.nodeSize * dir)\n            mustMove = false\n            continue search\n          }\n          break\n        }\n        next = inside\n        pos += dir\n        let $cur = $pos.doc.resolve(pos)\n        if (GapCursor.valid($cur)) return $cur\n      }\n\n      return null\n    }\n  }\n}\n\nGapCursor.prototype.visible = false\n\nSelection.jsonID(\"gapcursor\", GapCursor)\n\nclass GapBookmark {\n  constructor(pos) {\n    this.pos = pos\n  }\n  map(mapping) {\n    return new GapBookmark(mapping.map(this.pos))\n  }\n  resolve(doc) {\n    let $pos = doc.resolve(this.pos)\n    return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos)\n  }\n}\n\nfunction closedBefore($pos) {\n  for (let d = $pos.depth; d >= 0; d--) {\n    let index = $pos.index(d)\n    // At the start of this parent, look at next one\n    if (index == 0) continue\n    // See if the node before (or its first ancestor) is closed\n    for (let before = $pos.node(d).child(index - 1);; before = before.lastChild) {\n      if ((before.childCount == 0 && !before.inlineContent) || before.isAtom || before.type.spec.isolating) return true\n      if (before.inlineContent) return false\n    }\n  }\n  // Hit start of document\n  return true\n}\n\nfunction closedAfter($pos) {\n  for (let d = $pos.depth; d >= 0; d--) {\n    let index = $pos.indexAfter(d), parent = $pos.node(d)\n    if (index == parent.childCount) continue\n    for (let after = parent.child(index);; after = after.firstChild) {\n      if ((after.childCount == 0 && !after.inlineContent) || after.isAtom || after.type.spec.isolating) return true\n      if (after.inlineContent) return false\n    }\n  }\n  return true\n}\n","// This file defines a plugin that handles the drawing of cell\n// selections and the basic user interactions for creating and working\n// with such selections. It also makes sure that, after each\n// transaction, the shapes of tables are normalized to be rectangular\n// and not contain overlapping cells.\n\nimport {Plugin} from \"prosemirror-state\"\n\nimport {handleTripleClick, handleKeyDown, handlePaste, handleMouseDown} from \"./input\"\nimport {key as tableEditingKey} from \"./util\"\nimport {drawCellSelection, normalizeSelection} from \"./cellselection\"\nimport {fixTables, fixTablesKey} from \"./fixtables\"\n\n// :: () → Plugin\n//\n// Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)\n// that, when added to an editor, enables cell-selection, handles\n// cell-based copy/paste, and makes sure tables stay well-formed (each\n// row has the same width, and cells don't overlap).\n//\n// You should probably put this plugin near the end of your array of\n// plugins, since it handles mouse and arrow key events in tables\n// rather broadly, and other plugins, like the gap cursor or the\n// column-width dragging plugin, might want to get a turn first to\n// perform more specific behavior.\nexport function tableEditing({ allowTableNodeSelection = false } = {}) {\n  return new Plugin({\n    key: tableEditingKey,\n\n    // This piece of state is used to remember when a mouse-drag\n    // cell-selection is happening, so that it can continue even as\n    // transactions (which might move its anchor cell) come in.\n    state: {\n      init() { return null },\n      apply(tr, cur) {\n        let set = tr.getMeta(tableEditingKey)\n        if (set != null) return set == -1 ? null : set\n        if (cur == null || !tr.docChanged) return cur\n        let {deleted, pos} = tr.mapping.mapResult(cur)\n        return deleted ? null : pos\n      }\n    },\n\n    props: {\n      decorations: drawCellSelection,\n\n      handleDOMEvents: {\n        mousedown: handleMouseDown\n      },\n\n      createSelectionBetween(view) {\n        if (tableEditingKey.getState(view.state) != null) return view.state.selection\n      },\n\n      handleTripleClick,\n\n      handleKeyDown,\n\n      handlePaste\n    },\n\n    appendTransaction(_, oldState, state) {\n      return normalizeSelection(state, fixTables(state, oldState), allowTableNodeSelection)\n    }\n  })\n}\n\nexport {fixTables, handlePaste, fixTablesKey}\nexport {cellAround, isInTable, selectionCell, moveCellForward, inSameTable, findCell, colCount, nextCell, setAttr, pointsAtCell, removeColSpan, addColSpan, columnIsHeader} from \"./util\";\nexport {tableNodes, tableNodeTypes} from \"./schema\"\nexport {CellSelection} from \"./cellselection\"\nexport {TableMap} from \"./tablemap\"\nexport {tableEditingKey};\nexport * from \"./commands\"\nexport {columnResizing, key as columnResizingPluginKey} from \"./columnresizing\"\nexport {updateColumns as updateColumnsOnResize, TableView} from \"./tableview\"\nexport {pastedCells as __pastedCells, insertCells as __insertCells, clipCells as __clipCells} from \"./copypaste\"\n","\n    /*!\n    * tiptap v1.29.6\n    * (c) 2020 überdosis GbR (limited liability)\n    * @license MIT\n    */\n  \nimport { EditorState, Plugin, PluginKey, TextSelection } from 'prosemirror-state';\nexport { NodeSelection, Plugin, PluginKey, TextSelection } from 'prosemirror-state';\nimport { EditorView } from 'prosemirror-view';\nimport { Schema, DOMParser, DOMSerializer } from 'prosemirror-model';\nimport { dropCursor } from 'prosemirror-dropcursor';\nimport { gapCursor } from 'prosemirror-gapcursor';\nimport { keymap } from 'prosemirror-keymap';\nimport { baseKeymap } from 'prosemirror-commands';\nimport { inputRules, undoInputRule } from 'prosemirror-inputrules';\nimport { getMarkRange, markIsActive, getMarkAttrs, nodeIsActive, getNodeAttrs } from 'tiptap-utils';\nimport Vue from 'vue';\nimport { setBlockType } from 'tiptap-commands';\n\nfunction camelCase (str) {\n  return str.replace(/(?:^\\w|[A-Z]|\\b\\w)/g, (word, index) => index === 0 ? word.toLowerCase() : word.toUpperCase()).replace(/\\s+/g, '');\n}\n\nclass ComponentView {\n  constructor(component, {\n    editor,\n    extension,\n    parent,\n    node,\n    view,\n    decorations,\n    getPos\n  }) {\n    this.component = component;\n    this.editor = editor;\n    this.extension = extension;\n    this.parent = parent;\n    this.node = node;\n    this.view = view;\n    this.decorations = decorations;\n    this.isNode = !!this.node.marks;\n    this.isMark = !this.isNode;\n    this.getPos = this.isMark ? this.getMarkPos : getPos;\n    this.captureEvents = true;\n    this.dom = this.createDOM();\n    this.contentDOM = this.vm.$refs.content;\n  }\n\n  createDOM() {\n    const Component = Vue.extend(this.component);\n    const props = {\n      editor: this.editor,\n      node: this.node,\n      view: this.view,\n      getPos: () => this.getPos(),\n      decorations: this.decorations,\n      selected: false,\n      options: this.extension.options,\n      updateAttrs: attrs => this.updateAttrs(attrs)\n    };\n\n    if (typeof this.extension.setSelection === 'function') {\n      this.setSelection = this.extension.setSelection;\n    }\n\n    if (typeof this.extension.update === 'function') {\n      this.update = this.extension.update;\n    }\n\n    this.vm = new Component({\n      parent: this.parent,\n      propsData: props\n    }).$mount();\n    return this.vm.$el;\n  }\n\n  update(node, decorations) {\n    if (node.type !== this.node.type) {\n      return false;\n    }\n\n    if (node === this.node && this.decorations === decorations) {\n      return true;\n    }\n\n    this.node = node;\n    this.decorations = decorations;\n    this.updateComponentProps({\n      node,\n      decorations\n    });\n    return true;\n  }\n\n  updateComponentProps(props) {\n    if (!this.vm._props) {\n      return;\n    } // Update props in component\n    // TODO: Avoid mutating a prop directly.\n    // Maybe there is a better way to do this?\n\n\n    const originalSilent = Vue.config.silent;\n    Vue.config.silent = true;\n    Object.entries(props).forEach(([key, value]) => {\n      this.vm._props[key] = value;\n    }); // this.vm._props.node = node\n    // this.vm._props.decorations = decorations\n\n    Vue.config.silent = originalSilent;\n  }\n\n  updateAttrs(attrs) {\n    if (!this.view.editable) {\n      return;\n    }\n\n    const {\n      state\n    } = this.view;\n    const {\n      type\n    } = this.node;\n    const pos = this.getPos();\n    const newAttrs = { ...this.node.attrs,\n      ...attrs\n    };\n    const transaction = this.isMark ? state.tr.removeMark(pos.from, pos.to, type).addMark(pos.from, pos.to, type.create(newAttrs)) : state.tr.setNodeMarkup(pos, null, newAttrs);\n    this.view.dispatch(transaction);\n  } // prevent a full re-render of the vue component on update\n  // we'll handle prop updates in `update()`\n\n\n  ignoreMutation(mutation) {\n    // allow leaf nodes to be selected\n    if (mutation.type === 'selection') {\n      return false;\n    }\n\n    if (!this.contentDOM) {\n      return true;\n    }\n\n    return !this.contentDOM.contains(mutation.target);\n  } // disable (almost) all prosemirror event listener for node views\n\n\n  stopEvent(event) {\n    if (typeof this.extension.stopEvent === 'function') {\n      return this.extension.stopEvent(event);\n    }\n\n    const draggable = !!this.extension.schema.draggable; // support a custom drag handle\n\n    if (draggable && event.type === 'mousedown') {\n      const dragHandle = event.target.closest && event.target.closest('[data-drag-handle]');\n      const isValidDragHandle = dragHandle && (this.dom === dragHandle || this.dom.contains(dragHandle));\n\n      if (isValidDragHandle) {\n        this.captureEvents = false;\n        document.addEventListener('dragend', () => {\n          this.captureEvents = true;\n        }, {\n          once: true\n        });\n      }\n    }\n\n    const isCopy = event.type === 'copy';\n    const isPaste = event.type === 'paste';\n    const isCut = event.type === 'cut';\n    const isDrag = event.type.startsWith('drag') || event.type === 'drop';\n\n    if (draggable && isDrag || isCopy || isPaste || isCut) {\n      return false;\n    }\n\n    return this.captureEvents;\n  }\n\n  selectNode() {\n    this.updateComponentProps({\n      selected: true\n    });\n  }\n\n  deselectNode() {\n    this.updateComponentProps({\n      selected: false\n    });\n  }\n\n  getMarkPos() {\n    const pos = this.view.posAtDOM(this.dom);\n    const resolvedPos = this.view.state.doc.resolve(pos);\n    const range = getMarkRange(resolvedPos, this.node.type);\n    return range;\n  }\n\n  destroy() {\n    this.vm.$destroy();\n  }\n\n}\n\nclass Emitter {\n  // Add an event listener for given event\n  on(event, fn) {\n    this._callbacks = this._callbacks || {}; // Create namespace for this event\n\n    if (!this._callbacks[event]) {\n      this._callbacks[event] = [];\n    }\n\n    this._callbacks[event].push(fn);\n\n    return this;\n  }\n\n  emit(event, ...args) {\n    this._callbacks = this._callbacks || {};\n    const callbacks = this._callbacks[event];\n\n    if (callbacks) {\n      callbacks.forEach(callback => callback.apply(this, args));\n    }\n\n    return this;\n  } // Remove event listener for given event.\n  // If fn is not provided, all event listeners for that event will be removed.\n  // If neither is provided, all event listeners will be removed.\n\n\n  off(event, fn) {\n    if (!arguments.length) {\n      this._callbacks = {};\n    } else {\n      // event listeners for the given event\n      const callbacks = this._callbacks ? this._callbacks[event] : null;\n\n      if (callbacks) {\n        if (fn) {\n          this._callbacks[event] = callbacks.filter(cb => cb !== fn); // remove specific handler\n        } else {\n          delete this._callbacks[event]; // remove all handlers\n        }\n      }\n    }\n\n    return this;\n  }\n\n}\n\nclass Extension {\n  constructor(options = {}) {\n    this.options = { ...this.defaultOptions,\n      ...options\n    };\n  }\n\n  init() {\n    return null;\n  }\n\n  bindEditor(editor = null) {\n    this.editor = editor;\n  }\n\n  get name() {\n    return null;\n  }\n\n  get type() {\n    return 'extension';\n  }\n\n  get defaultOptions() {\n    return {};\n  }\n\n  get plugins() {\n    return [];\n  }\n\n  inputRules() {\n    return [];\n  }\n\n  pasteRules() {\n    return [];\n  }\n\n  keys() {\n    return {};\n  }\n\n}\n\nclass ExtensionManager {\n  constructor(extensions = [], editor) {\n    extensions.forEach(extension => {\n      extension.bindEditor(editor);\n      extension.init();\n    });\n    this.extensions = extensions;\n  }\n\n  get nodes() {\n    return this.extensions.filter(extension => extension.type === 'node').reduce((nodes, {\n      name,\n      schema\n    }) => ({ ...nodes,\n      [name]: schema\n    }), {});\n  }\n\n  get options() {\n    const {\n      view\n    } = this;\n    return this.extensions.reduce((nodes, extension) => ({ ...nodes,\n      [extension.name]: new Proxy(extension.options, {\n        set(obj, prop, value) {\n          const changed = obj[prop] !== value;\n          Object.assign(obj, {\n            [prop]: value\n          });\n\n          if (changed) {\n            view.updateState(view.state);\n          }\n\n          return true;\n        }\n\n      })\n    }), {});\n  }\n\n  get marks() {\n    return this.extensions.filter(extension => extension.type === 'mark').reduce((marks, {\n      name,\n      schema\n    }) => ({ ...marks,\n      [name]: schema\n    }), {});\n  }\n\n  get plugins() {\n    return this.extensions.filter(extension => extension.plugins).reduce((allPlugins, {\n      plugins\n    }) => [...allPlugins, ...plugins], []);\n  }\n\n  keymaps({\n    schema\n  }) {\n    const extensionKeymaps = this.extensions.filter(extension => ['extension'].includes(extension.type)).filter(extension => extension.keys).map(extension => extension.keys({\n      schema\n    }));\n    const nodeMarkKeymaps = this.extensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.keys).map(extension => extension.keys({\n      type: schema[\"\".concat(extension.type, \"s\")][extension.name],\n      schema\n    }));\n    return [...extensionKeymaps, ...nodeMarkKeymaps].map(keys => keymap(keys));\n  }\n\n  inputRules({\n    schema,\n    excludedExtensions\n  }) {\n    if (!(excludedExtensions instanceof Array) && excludedExtensions) return [];\n    const allowedExtensions = excludedExtensions instanceof Array ? this.extensions.filter(extension => !excludedExtensions.includes(extension.name)) : this.extensions;\n    const extensionInputRules = allowedExtensions.filter(extension => ['extension'].includes(extension.type)).filter(extension => extension.inputRules).map(extension => extension.inputRules({\n      schema\n    }));\n    const nodeMarkInputRules = allowedExtensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.inputRules).map(extension => extension.inputRules({\n      type: schema[\"\".concat(extension.type, \"s\")][extension.name],\n      schema\n    }));\n    return [...extensionInputRules, ...nodeMarkInputRules].reduce((allInputRules, inputRules) => [...allInputRules, ...inputRules], []);\n  }\n\n  pasteRules({\n    schema,\n    excludedExtensions\n  }) {\n    if (!(excludedExtensions instanceof Array) && excludedExtensions) return [];\n    const allowedExtensions = excludedExtensions instanceof Array ? this.extensions.filter(extension => !excludedExtensions.includes(extension.name)) : this.extensions;\n    const extensionPasteRules = allowedExtensions.filter(extension => ['extension'].includes(extension.type)).filter(extension => extension.pasteRules).map(extension => extension.pasteRules({\n      schema\n    }));\n    const nodeMarkPasteRules = allowedExtensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.pasteRules).map(extension => extension.pasteRules({\n      type: schema[\"\".concat(extension.type, \"s\")][extension.name],\n      schema\n    }));\n    return [...extensionPasteRules, ...nodeMarkPasteRules].reduce((allPasteRules, pasteRules) => [...allPasteRules, ...pasteRules], []);\n  }\n\n  commands({\n    schema,\n    view\n  }) {\n    return this.extensions.filter(extension => extension.commands).reduce((allCommands, extension) => {\n      const {\n        name,\n        type\n      } = extension;\n      const commands = {};\n      const value = extension.commands({\n        schema,\n        ...(['node', 'mark'].includes(type) ? {\n          type: schema[\"\".concat(type, \"s\")][name]\n        } : {})\n      });\n\n      const apply = (cb, attrs) => {\n        if (!view.editable) {\n          return false;\n        }\n\n        view.focus();\n        return cb(attrs)(view.state, view.dispatch, view);\n      };\n\n      const handle = (_name, _value) => {\n        if (Array.isArray(_value)) {\n          commands[_name] = attrs => _value.forEach(callback => apply(callback, attrs));\n        } else if (typeof _value === 'function') {\n          commands[_name] = attrs => apply(_value, attrs);\n        }\n      };\n\n      if (typeof value === 'object') {\n        Object.entries(value).forEach(([commandName, commandValue]) => {\n          handle(commandName, commandValue);\n        });\n      } else {\n        handle(name, value);\n      }\n\n      return { ...allCommands,\n        ...commands\n      };\n    }, {});\n  }\n\n}\n\nfunction injectCSS (css) {\n  if (process.env.NODE_ENV !== 'test') {\n    const style = document.createElement('style');\n    style.type = 'text/css';\n    style.textContent = css;\n    const {\n      head\n    } = document;\n    const {\n      firstChild\n    } = head;\n\n    if (firstChild) {\n      head.insertBefore(style, firstChild);\n    } else {\n      head.appendChild(style);\n    }\n  }\n}\n\nclass Mark extends Extension {\n  constructor(options = {}) {\n    super(options);\n  }\n\n  get type() {\n    return 'mark';\n  }\n\n  get view() {\n    return null;\n  }\n\n  get schema() {\n    return null;\n  }\n\n  command() {\n    return () => {};\n  }\n\n}\n\nfunction minMax(value = 0, min = 0, max = 0) {\n  return Math.min(Math.max(parseInt(value, 10), min), max);\n}\n\nclass Node extends Extension {\n  constructor(options = {}) {\n    super(options);\n  }\n\n  get type() {\n    return 'node';\n  }\n\n  get view() {\n    return null;\n  }\n\n  get schema() {\n    return null;\n  }\n\n  command() {\n    return () => {};\n  }\n\n}\n\nclass Doc extends Node {\n  get name() {\n    return 'doc';\n  }\n\n  get schema() {\n    return {\n      content: 'block+'\n    };\n  }\n\n}\n\nclass Paragraph extends Node {\n  get name() {\n    return 'paragraph';\n  }\n\n  get schema() {\n    return {\n      content: 'inline*',\n      group: 'block',\n      draggable: false,\n      parseDOM: [{\n        tag: 'p'\n      }],\n      toDOM: () => ['p', 0]\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => setBlockType(type);\n  }\n\n}\n\nclass Text extends Node {\n  get name() {\n    return 'text';\n  }\n\n  get schema() {\n    return {\n      group: 'inline'\n    };\n  }\n\n}\n\nvar css = \".ProseMirror {\\n  position: relative;\\n}\\n\\n.ProseMirror {\\n  word-wrap: break-word;\\n  white-space: pre-wrap;\\n  -webkit-font-variant-ligatures: none;\\n  font-variant-ligatures: none;\\n}\\n\\n.ProseMirror pre {\\n  white-space: pre-wrap;\\n}\\n\\n.ProseMirror-gapcursor {\\n  display: none;\\n  pointer-events: none;\\n  position: absolute;\\n}\\n\\n.ProseMirror-gapcursor:after {\\n  content: \\\"\\\";\\n  display: block;\\n  position: absolute;\\n  top: -2px;\\n  width: 20px;\\n  border-top: 1px solid black;\\n  animation: ProseMirror-cursor-blink 1.1s steps(2, start) infinite;\\n}\\n\\n@keyframes ProseMirror-cursor-blink {\\n  to {\\n    visibility: hidden;\\n  }\\n}\\n\\n.ProseMirror-hideselection *::selection {\\n  background: transparent;\\n}\\n\\n.ProseMirror-hideselection *::-moz-selection {\\n  background: transparent;\\n}\\n\\n.ProseMirror-hideselection * {\\n  caret-color: transparent;\\n}\\n\\n.ProseMirror-focused .ProseMirror-gapcursor {\\n  display: block;\\n}\\n\";\n\nclass Editor extends Emitter {\n  constructor(options = {}) {\n    super();\n    this.defaultOptions = {\n      editorProps: {},\n      editable: true,\n      autoFocus: null,\n      extensions: [],\n      content: '',\n      topNode: 'doc',\n      emptyDocument: {\n        type: 'doc',\n        content: [{\n          type: 'paragraph'\n        }]\n      },\n      useBuiltInExtensions: true,\n      disableInputRules: false,\n      disablePasteRules: false,\n      dropCursor: {},\n      enableDropCursor: true,\n      enableGapCursor: true,\n      parseOptions: {},\n      injectCSS: true,\n      onInit: () => {},\n      onTransaction: () => {},\n      onUpdate: () => {},\n      onFocus: () => {},\n      onBlur: () => {},\n      onPaste: () => {},\n      onDrop: () => {}\n    };\n    this.events = ['init', 'transaction', 'update', 'focus', 'blur', 'paste', 'drop'];\n    this.init(options);\n  }\n\n  init(options = {}) {\n    this.setOptions({ ...this.defaultOptions,\n      ...options\n    });\n    this.focused = false;\n    this.selection = {\n      from: 0,\n      to: 0\n    };\n    this.element = document.createElement('div');\n    this.extensions = this.createExtensions();\n    this.nodes = this.createNodes();\n    this.marks = this.createMarks();\n    this.schema = this.createSchema();\n    this.plugins = this.createPlugins();\n    this.keymaps = this.createKeymaps();\n    this.inputRules = this.createInputRules();\n    this.pasteRules = this.createPasteRules();\n    this.view = this.createView();\n    this.commands = this.createCommands();\n    this.setActiveNodesAndMarks();\n\n    if (this.options.injectCSS) {\n      injectCSS(css);\n    }\n\n    if (this.options.autoFocus !== null) {\n      this.focus(this.options.autoFocus);\n    }\n\n    this.events.forEach(name => {\n      this.on(name, this.options[camelCase(\"on \".concat(name))] || (() => {}));\n    });\n    this.emit('init', {\n      view: this.view,\n      state: this.state\n    }); // give extension manager access to our view\n\n    this.extensions.view = this.view;\n  }\n\n  setOptions(options) {\n    this.options = { ...this.options,\n      ...options\n    };\n\n    if (this.view && this.state) {\n      this.view.updateState(this.state);\n    }\n  }\n\n  get builtInExtensions() {\n    if (!this.options.useBuiltInExtensions) {\n      return [];\n    }\n\n    return [new Doc(), new Text(), new Paragraph()];\n  }\n\n  get state() {\n    return this.view ? this.view.state : null;\n  }\n\n  createExtensions() {\n    return new ExtensionManager([...this.builtInExtensions, ...this.options.extensions], this);\n  }\n\n  createPlugins() {\n    return this.extensions.plugins;\n  }\n\n  createKeymaps() {\n    return this.extensions.keymaps({\n      schema: this.schema\n    });\n  }\n\n  createInputRules() {\n    return this.extensions.inputRules({\n      schema: this.schema,\n      excludedExtensions: this.options.disableInputRules\n    });\n  }\n\n  createPasteRules() {\n    return this.extensions.pasteRules({\n      schema: this.schema,\n      excludedExtensions: this.options.disablePasteRules\n    });\n  }\n\n  createCommands() {\n    return this.extensions.commands({\n      schema: this.schema,\n      view: this.view\n    });\n  }\n\n  createNodes() {\n    return this.extensions.nodes;\n  }\n\n  createMarks() {\n    return this.extensions.marks;\n  }\n\n  createSchema() {\n    return new Schema({\n      topNode: this.options.topNode,\n      nodes: this.nodes,\n      marks: this.marks\n    });\n  }\n\n  createState() {\n    return EditorState.create({\n      schema: this.schema,\n      doc: this.createDocument(this.options.content),\n      plugins: [...this.plugins, inputRules({\n        rules: this.inputRules\n      }), ...this.pasteRules, ...this.keymaps, keymap({\n        Backspace: undoInputRule\n      }), keymap(baseKeymap), ...(this.options.enableDropCursor ? [dropCursor(this.options.dropCursor)] : []), ...(this.options.enableGapCursor ? [gapCursor()] : []), new Plugin({\n        key: new PluginKey('editable'),\n        props: {\n          editable: () => this.options.editable\n        }\n      }), new Plugin({\n        props: {\n          attributes: {\n            tabindex: 0\n          },\n          handleDOMEvents: {\n            focus: (view, event) => {\n              this.focused = true;\n              this.emit('focus', {\n                event,\n                state: view.state,\n                view\n              });\n              const transaction = this.state.tr.setMeta('focused', true);\n              this.view.dispatch(transaction);\n            },\n            blur: (view, event) => {\n              this.focused = false;\n              this.emit('blur', {\n                event,\n                state: view.state,\n                view\n              });\n              const transaction = this.state.tr.setMeta('focused', false);\n              this.view.dispatch(transaction);\n            }\n          }\n        }\n      }), new Plugin({\n        props: this.options.editorProps\n      })]\n    });\n  }\n\n  createDocument(content, parseOptions = this.options.parseOptions) {\n    if (content === null) {\n      return this.schema.nodeFromJSON(this.options.emptyDocument);\n    }\n\n    if (typeof content === 'object') {\n      try {\n        return this.schema.nodeFromJSON(content);\n      } catch (error) {\n        console.warn('[tiptap warn]: Invalid content.', 'Passed value:', content, 'Error:', error);\n        return this.schema.nodeFromJSON(this.options.emptyDocument);\n      }\n    }\n\n    if (typeof content === 'string') {\n      const htmlString = \"<div>\".concat(content, \"</div>\");\n      const parser = new window.DOMParser();\n      const element = parser.parseFromString(htmlString, 'text/html').body.firstElementChild;\n      return DOMParser.fromSchema(this.schema).parse(element, parseOptions);\n    }\n\n    return false;\n  }\n\n  createView() {\n    return new EditorView(this.element, {\n      state: this.createState(),\n      handlePaste: (...args) => {\n        this.emit('paste', ...args);\n      },\n      handleDrop: (...args) => {\n        this.emit('drop', ...args);\n      },\n      dispatchTransaction: this.dispatchTransaction.bind(this)\n    });\n  }\n\n  setParentComponent(component = null) {\n    if (!component) {\n      return;\n    }\n\n    this.view.setProps({\n      nodeViews: this.initNodeViews({\n        parent: component,\n        extensions: [...this.builtInExtensions, ...this.options.extensions]\n      })\n    });\n  }\n\n  initNodeViews({\n    parent,\n    extensions\n  }) {\n    return extensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.view).reduce((nodeViews, extension) => {\n      const nodeView = (node, view, getPos, decorations) => {\n        const component = extension.view;\n        return new ComponentView(component, {\n          editor: this,\n          extension,\n          parent,\n          node,\n          view,\n          getPos,\n          decorations\n        });\n      };\n\n      return { ...nodeViews,\n        [extension.name]: nodeView\n      };\n    }, {});\n  }\n\n  dispatchTransaction(transaction) {\n    const newState = this.state.apply(transaction);\n    this.view.updateState(newState);\n    this.selection = {\n      from: this.state.selection.from,\n      to: this.state.selection.to\n    };\n    this.setActiveNodesAndMarks();\n    this.emit('transaction', {\n      getHTML: this.getHTML.bind(this),\n      getJSON: this.getJSON.bind(this),\n      state: this.state,\n      transaction\n    });\n\n    if (!transaction.docChanged || transaction.getMeta('preventUpdate')) {\n      return;\n    }\n\n    this.emitUpdate(transaction);\n  }\n\n  emitUpdate(transaction) {\n    this.emit('update', {\n      getHTML: this.getHTML.bind(this),\n      getJSON: this.getJSON.bind(this),\n      state: this.state,\n      transaction\n    });\n  }\n\n  resolveSelection(position = null) {\n    if (this.selection && position === null) {\n      return this.selection;\n    }\n\n    if (position === 'start' || position === true) {\n      return {\n        from: 0,\n        to: 0\n      };\n    }\n\n    if (position === 'end') {\n      const {\n        doc\n      } = this.state;\n      return {\n        from: doc.content.size,\n        to: doc.content.size\n      };\n    }\n\n    return {\n      from: position,\n      to: position\n    };\n  }\n\n  focus(position = null) {\n    if (this.view.focused && position === null || position === false) {\n      return;\n    }\n\n    const {\n      from,\n      to\n    } = this.resolveSelection(position);\n    this.setSelection(from, to);\n    setTimeout(() => this.view.focus(), 10);\n  }\n\n  setSelection(from = 0, to = 0) {\n    const {\n      doc,\n      tr\n    } = this.state;\n    const resolvedFrom = minMax(from, 0, doc.content.size);\n    const resolvedEnd = minMax(to, 0, doc.content.size);\n    const selection = TextSelection.create(doc, resolvedFrom, resolvedEnd);\n    const transaction = tr.setSelection(selection);\n    this.view.dispatch(transaction);\n  }\n\n  blur() {\n    this.view.dom.blur();\n  }\n\n  getSchemaJSON() {\n    return JSON.parse(JSON.stringify({\n      nodes: this.extensions.nodes,\n      marks: this.extensions.marks\n    }));\n  }\n\n  getHTML() {\n    const div = document.createElement('div');\n    const fragment = DOMSerializer.fromSchema(this.schema).serializeFragment(this.state.doc.content);\n    div.appendChild(fragment);\n    return div.innerHTML;\n  }\n\n  getJSON() {\n    return this.state.doc.toJSON();\n  }\n\n  setContent(content = {}, emitUpdate = false, parseOptions) {\n    const {\n      doc,\n      tr\n    } = this.state;\n    const document = this.createDocument(content, parseOptions);\n    const selection = TextSelection.create(doc, 0, doc.content.size);\n    const transaction = tr.setSelection(selection).replaceSelectionWith(document, false).setMeta('preventUpdate', !emitUpdate);\n    this.view.dispatch(transaction);\n  }\n\n  clearContent(emitUpdate = false) {\n    this.setContent(this.options.emptyDocument, emitUpdate);\n  }\n\n  setActiveNodesAndMarks() {\n    this.activeMarks = Object.entries(this.schema.marks).reduce((marks, [name, mark]) => ({ ...marks,\n      [name]: (attrs = {}) => markIsActive(this.state, mark, attrs)\n    }), {});\n    this.activeMarkAttrs = Object.entries(this.schema.marks).reduce((marks, [name, mark]) => ({ ...marks,\n      [name]: getMarkAttrs(this.state, mark)\n    }), {});\n    this.activeNodes = Object.entries(this.schema.nodes).reduce((nodes, [name, node]) => ({ ...nodes,\n      [name]: (attrs = {}) => nodeIsActive(this.state, node, attrs)\n    }), {});\n  }\n\n  getMarkAttrs(type = null) {\n    return this.activeMarkAttrs[type];\n  }\n\n  getNodeAttrs(type = null) {\n    return { ...getNodeAttrs(this.state, this.schema.nodes[type])\n    };\n  }\n\n  get isActive() {\n    return Object.entries({ ...this.activeMarks,\n      ...this.activeNodes\n    }).reduce((types, [name, value]) => ({ ...types,\n      [name]: (attrs = {}) => value(attrs)\n    }), {});\n  }\n\n  registerPlugin(plugin = null, handlePlugins) {\n    const plugins = typeof handlePlugins === 'function' ? handlePlugins(plugin, this.state.plugins) : [plugin, ...this.state.plugins];\n    const newState = this.state.reconfigure({\n      plugins\n    });\n    this.view.updateState(newState);\n  }\n\n  unregisterPlugin(name = null) {\n    if (!name || !this.view.docView) {\n      return;\n    }\n\n    const newState = this.state.reconfigure({\n      plugins: this.state.plugins.filter(plugin => !plugin.key.startsWith(\"\".concat(name, \"$\")))\n    });\n    this.view.updateState(newState);\n  }\n\n  destroy() {\n    if (!this.view) {\n      return;\n    }\n\n    this.view.destroy();\n  }\n\n}\n\nvar EditorContent = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    }\n  },\n  watch: {\n    editor: {\n      immediate: true,\n\n      handler(editor) {\n        if (editor && editor.element) {\n          this.$nextTick(() => {\n            this.$el.appendChild(editor.element.firstChild);\n            editor.setParentComponent(this);\n          });\n        }\n      }\n\n    }\n  },\n\n  render(createElement) {\n    return createElement('div');\n  },\n\n  beforeDestroy() {\n    this.editor.element = this.$el;\n  }\n\n};\n\nclass Menu {\n  constructor({\n    options\n  }) {\n    this.options = options;\n    this.preventHide = false; // the mousedown event is fired before blur so we can prevent it\n\n    this.mousedownHandler = this.handleClick.bind(this);\n    this.options.element.addEventListener('mousedown', this.mousedownHandler, {\n      capture: true\n    });\n\n    this.blurHandler = () => {\n      if (this.preventHide) {\n        this.preventHide = false;\n        return;\n      }\n\n      this.options.editor.emit('menubar:focusUpdate', false);\n    };\n\n    this.options.editor.on('blur', this.blurHandler);\n  }\n\n  handleClick() {\n    this.preventHide = true;\n  }\n\n  destroy() {\n    this.options.element.removeEventListener('mousedown', this.mousedownHandler);\n    this.options.editor.off('blur', this.blurHandler);\n  }\n\n}\n\nfunction MenuBar (options) {\n  return new Plugin({\n    key: new PluginKey('menu_bar'),\n\n    view(editorView) {\n      return new Menu({\n        editorView,\n        options\n      });\n    }\n\n  });\n}\n\nvar EditorMenuBar = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    }\n  },\n\n  data() {\n    return {\n      focused: false\n    };\n  },\n\n  watch: {\n    editor: {\n      immediate: true,\n\n      handler(editor) {\n        if (editor) {\n          this.$nextTick(() => {\n            editor.registerPlugin(MenuBar({\n              editor,\n              element: this.$el\n            }));\n            this.focused = editor.focused;\n            editor.on('focus', () => {\n              this.focused = true;\n            });\n            editor.on('menubar:focusUpdate', focused => {\n              this.focused = focused;\n            });\n          });\n        }\n      }\n\n    }\n  },\n\n  render() {\n    if (!this.editor) {\n      return null;\n    }\n\n    return this.$scopedSlots.default({\n      focused: this.focused,\n      focus: this.editor.focus,\n      commands: this.editor.commands,\n      isActive: this.editor.isActive,\n      getMarkAttrs: this.editor.getMarkAttrs.bind(this.editor),\n      getNodeAttrs: this.editor.getNodeAttrs.bind(this.editor)\n    });\n  }\n\n};\n\nfunction textRange(node, from, to) {\n  const range = document.createRange();\n  range.setEnd(node, to == null ? node.nodeValue.length : to);\n  range.setStart(node, from || 0);\n  return range;\n}\n\nfunction singleRect(object, bias) {\n  const rects = object.getClientRects();\n  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1];\n}\n\nfunction coordsAtPos(view, pos, end = false) {\n  const {\n    node,\n    offset\n  } = view.docView.domFromPos(pos);\n  let side;\n  let rect;\n\n  if (node.nodeType === 3) {\n    if (end && offset < node.nodeValue.length) {\n      rect = singleRect(textRange(node, offset - 1, offset), -1);\n      side = 'right';\n    } else if (offset < node.nodeValue.length) {\n      rect = singleRect(textRange(node, offset, offset + 1), -1);\n      side = 'left';\n    }\n  } else if (node.firstChild) {\n    if (offset < node.childNodes.length) {\n      const child = node.childNodes[offset];\n      rect = singleRect(child.nodeType === 3 ? textRange(child) : child, -1);\n      side = 'left';\n    }\n\n    if ((!rect || rect.top === rect.bottom) && offset) {\n      const child = node.childNodes[offset - 1];\n      rect = singleRect(child.nodeType === 3 ? textRange(child) : child, 1);\n      side = 'right';\n    }\n  } else {\n    rect = node.getBoundingClientRect();\n    side = 'left';\n  }\n\n  const x = rect[side];\n  return {\n    top: rect.top,\n    bottom: rect.bottom,\n    left: x,\n    right: x\n  };\n}\n\nclass Menu$1 {\n  constructor({\n    options,\n    editorView\n  }) {\n    this.options = { ...{\n        element: null,\n        keepInBounds: true,\n        onUpdate: () => false\n      },\n      ...options\n    };\n    this.editorView = editorView;\n    this.isActive = false;\n    this.left = 0;\n    this.bottom = 0;\n    this.top = 0;\n    this.preventHide = false; // the mousedown event is fired before blur so we can prevent it\n\n    this.mousedownHandler = this.handleClick.bind(this);\n    this.options.element.addEventListener('mousedown', this.mousedownHandler, {\n      capture: true\n    });\n\n    this.focusHandler = ({\n      view\n    }) => {\n      this.update(view);\n    };\n\n    this.options.editor.on('focus', this.focusHandler);\n\n    this.blurHandler = ({\n      event\n    }) => {\n      if (this.preventHide) {\n        this.preventHide = false;\n        return;\n      }\n\n      this.hide(event);\n    };\n\n    this.options.editor.on('blur', this.blurHandler);\n  }\n\n  handleClick() {\n    this.preventHide = true;\n  }\n\n  update(view, lastState) {\n    const {\n      state\n    } = view;\n\n    if (view.composing) {\n      return;\n    } // Don't do anything if the document/selection didn't change\n\n\n    if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {\n      return;\n    } // Hide the tooltip if the selection is empty\n\n\n    if (state.selection.empty) {\n      this.hide();\n      return;\n    } // Otherwise, reposition it and update its content\n\n\n    const {\n      from,\n      to\n    } = state.selection; // These are in screen coordinates\n    // We can't use EditorView.cordsAtPos here because it can't handle linebreaks correctly\n    // See: https://github.com/ProseMirror/prosemirror-view/pull/47\n\n    const start = coordsAtPos(view, from);\n    const end = coordsAtPos(view, to, true); // The box in which the tooltip is positioned, to use as base\n\n    const parent = this.options.element.offsetParent;\n\n    if (!parent) {\n      this.hide();\n      return;\n    }\n\n    const box = parent.getBoundingClientRect();\n    const el = this.options.element.getBoundingClientRect(); // Find a center-ish x position from the selection endpoints (when\n    // crossing lines, end may be more to the left)\n\n    const left = (start.left + end.left) / 2 - box.left; // Keep the menuBubble in the bounding box of the offsetParent i\n\n    this.left = Math.round(this.options.keepInBounds ? Math.min(box.width - el.width / 2, Math.max(left, el.width / 2)) : left);\n    this.bottom = Math.round(box.bottom - start.top);\n    this.top = Math.round(end.bottom - box.top);\n    this.isActive = true;\n    this.sendUpdate();\n  }\n\n  sendUpdate() {\n    this.options.onUpdate({\n      isActive: this.isActive,\n      left: this.left,\n      bottom: this.bottom,\n      top: this.top\n    });\n  }\n\n  hide(event) {\n    if (event && event.relatedTarget && this.options.element.parentNode && this.options.element.parentNode.contains(event.relatedTarget)) {\n      return;\n    }\n\n    this.isActive = false;\n    this.sendUpdate();\n  }\n\n  destroy() {\n    this.options.element.removeEventListener('mousedown', this.mousedownHandler);\n    this.options.editor.off('focus', this.focusHandler);\n    this.options.editor.off('blur', this.blurHandler);\n  }\n\n}\n\nfunction MenuBubble (options) {\n  return new Plugin({\n    key: new PluginKey('menu_bubble'),\n\n    view(editorView) {\n      return new Menu$1({\n        editorView,\n        options\n      });\n    }\n\n  });\n}\n\nvar EditorMenuBubble = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    },\n    keepInBounds: {\n      default: true,\n      type: Boolean\n    }\n  },\n\n  data() {\n    return {\n      menu: {\n        isActive: false,\n        left: 0,\n        bottom: 0\n      }\n    };\n  },\n\n  watch: {\n    editor: {\n      immediate: true,\n\n      handler(editor) {\n        if (editor) {\n          this.$nextTick(() => {\n            editor.registerPlugin(MenuBubble({\n              editor,\n              element: this.$el,\n              keepInBounds: this.keepInBounds,\n              onUpdate: menu => {\n                // the second check ensures event is fired only once\n                if (menu.isActive && this.menu.isActive === false) {\n                  this.$emit('show', menu);\n                } else if (!menu.isActive && this.menu.isActive === true) {\n                  this.$emit('hide', menu);\n                }\n\n                this.menu = menu;\n              }\n            }));\n          });\n        }\n      }\n\n    }\n  },\n\n  render() {\n    if (!this.editor) {\n      return null;\n    }\n\n    return this.$scopedSlots.default({\n      focused: this.editor.view.focused,\n      focus: this.editor.focus,\n      commands: this.editor.commands,\n      isActive: this.editor.isActive,\n      getMarkAttrs: this.editor.getMarkAttrs.bind(this.editor),\n      getNodeAttrs: this.editor.getNodeAttrs.bind(this.editor),\n      menu: this.menu\n    });\n  },\n\n  beforeDestroy() {\n    this.editor.unregisterPlugin('menu_bubble');\n  }\n\n};\n\nclass Menu$2 {\n  constructor({\n    options,\n    editorView\n  }) {\n    this.options = { ...{\n        resizeObserver: true,\n        element: null,\n        onUpdate: () => false\n      },\n      ...options\n    };\n    this.preventHide = false;\n    this.editorView = editorView;\n    this.isActive = false;\n    this.top = 0; // the mousedown event is fired before blur so we can prevent it\n\n    this.mousedownHandler = this.handleClick.bind(this);\n    this.options.element.addEventListener('mousedown', this.mousedownHandler, {\n      capture: true\n    });\n\n    this.focusHandler = ({\n      view\n    }) => {\n      this.update(view);\n    };\n\n    this.options.editor.on('focus', this.focusHandler);\n\n    this.blurHandler = ({\n      event\n    }) => {\n      if (this.preventHide) {\n        this.preventHide = false;\n        return;\n      }\n\n      this.hide(event);\n    };\n\n    this.options.editor.on('blur', this.blurHandler); // sometimes we have to update the position\n    // because of a loaded images for example\n\n    if (this.options.resizeObserver && window.ResizeObserver) {\n      this.resizeObserver = new ResizeObserver(() => {\n        if (this.isActive) {\n          this.update(this.editorView);\n        }\n      });\n      this.resizeObserver.observe(this.editorView.dom);\n    }\n  }\n\n  handleClick() {\n    this.preventHide = true;\n  }\n\n  update(view, lastState) {\n    const {\n      state\n    } = view; // Don't do anything if the document/selection didn't change\n\n    if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {\n      return;\n    }\n\n    if (!state.selection.empty) {\n      this.hide();\n      return;\n    }\n\n    const currentDom = view.domAtPos(state.selection.anchor);\n    const isActive = currentDom.node.innerHTML === '<br>' && currentDom.node.tagName === 'P' && currentDom.node.parentNode === view.dom;\n\n    if (!isActive) {\n      this.hide();\n      return;\n    }\n\n    const parent = this.options.element.offsetParent;\n\n    if (!parent) {\n      this.hide();\n      return;\n    }\n\n    const editorBoundings = parent.getBoundingClientRect();\n    const cursorBoundings = view.coordsAtPos(state.selection.anchor);\n    const top = cursorBoundings.top - editorBoundings.top;\n    this.isActive = true;\n    this.top = top;\n    this.sendUpdate();\n  }\n\n  sendUpdate() {\n    this.options.onUpdate({\n      isActive: this.isActive,\n      top: this.top\n    });\n  }\n\n  hide(event) {\n    if (event && event.relatedTarget && this.options.element.parentNode && this.options.element.parentNode.contains(event.relatedTarget)) {\n      return;\n    }\n\n    this.isActive = false;\n    this.sendUpdate();\n  }\n\n  destroy() {\n    this.options.element.removeEventListener('mousedown', this.mousedownHandler);\n\n    if (this.resizeObserver) {\n      this.resizeObserver.unobserve(this.editorView.dom);\n    }\n\n    this.options.editor.off('focus', this.focusHandler);\n    this.options.editor.off('blur', this.blurHandler);\n  }\n\n}\n\nfunction FloatingMenu (options) {\n  return new Plugin({\n    key: new PluginKey('floating_menu'),\n\n    view(editorView) {\n      return new Menu$2({\n        editorView,\n        options\n      });\n    }\n\n  });\n}\n\nvar EditorFloatingMenu = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    }\n  },\n\n  data() {\n    return {\n      menu: {\n        isActive: false,\n        left: 0,\n        bottom: 0\n      }\n    };\n  },\n\n  watch: {\n    editor: {\n      immediate: true,\n\n      handler(editor) {\n        if (editor) {\n          this.$nextTick(() => {\n            editor.registerPlugin(FloatingMenu({\n              editor,\n              element: this.$el,\n              onUpdate: menu => {\n                // the second check ensures event is fired only once\n                if (menu.isActive && this.menu.isActive === false) {\n                  this.$emit('show', menu);\n                } else if (!menu.isActive && this.menu.isActive === true) {\n                  this.$emit('hide', menu);\n                }\n\n                this.menu = menu;\n              }\n            }));\n          });\n        }\n      }\n\n    }\n  },\n\n  render() {\n    if (!this.editor) {\n      return null;\n    }\n\n    return this.$scopedSlots.default({\n      focused: this.editor.view.focused,\n      focus: this.editor.focus,\n      commands: this.editor.commands,\n      isActive: this.editor.isActive,\n      getMarkAttrs: this.editor.getMarkAttrs.bind(this.editor),\n      getNodeAttrs: this.editor.getNodeAttrs.bind(this.editor),\n      menu: this.menu\n    });\n  },\n\n  beforeDestroy() {\n    this.editor.unregisterPlugin('floating_menu');\n  }\n\n};\n\nexport { Doc, Editor, EditorContent, EditorFloatingMenu, EditorMenuBar, EditorMenuBubble, Extension, Mark, Node, Paragraph, Text };\n","import {Plugin} from \"prosemirror-state\"\n\n// ::- Input rules are regular expressions describing a piece of text\n// that, when typed, causes something to happen. This might be\n// changing two dashes into an emdash, wrapping a paragraph starting\n// with `\"> \"` into a blockquote, or something entirely different.\nexport class InputRule {\n  // :: (RegExp, union<string, (state: EditorState, match: [string], start: number, end: number) → ?Transaction>)\n  // Create an input rule. The rule applies when the user typed\n  // something and the text directly in front of the cursor matches\n  // `match`, which should end with `$`.\n  //\n  // The `handler` can be a string, in which case the matched text, or\n  // the first matched group in the regexp, is replaced by that\n  // string.\n  //\n  // Or a it can be a function, which will be called with the match\n  // array produced by\n  // [`RegExp.exec`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp/exec),\n  // as well as the start and end of the matched range, and which can\n  // return a [transaction](#state.Transaction) that describes the\n  // rule's effect, or null to indicate the input was not handled.\n  constructor(match, handler) {\n    this.match = match\n    this.handler = typeof handler == \"string\" ? stringHandler(handler) : handler\n  }\n}\n\nfunction stringHandler(string) {\n  return function(state, match, start, end) {\n    let insert = string\n    if (match[1]) {\n      let offset = match[0].lastIndexOf(match[1])\n      insert += match[0].slice(offset + match[1].length)\n      start += offset\n      let cutOff = start - end\n      if (cutOff > 0) {\n        insert = match[0].slice(offset - cutOff, offset) + insert\n        start = end\n      }\n    }\n    return state.tr.insertText(insert, start, end)\n  }\n}\n\nconst MAX_MATCH = 500\n\n// :: (config: {rules: [InputRule]}) → Plugin\n// Create an input rules plugin. When enabled, it will cause text\n// input that matches any of the given rules to trigger the rule's\n// action.\nexport function inputRules({rules}) {\n  let plugin = new Plugin({\n    state: {\n      init() { return null },\n      apply(tr, prev) {\n        let stored = tr.getMeta(this)\n        if (stored) return stored\n        return tr.selectionSet || tr.docChanged ? null : prev\n      }\n    },\n\n    props: {\n      handleTextInput(view, from, to, text) {\n        return run(view, from, to, text, rules, plugin)\n      },\n      handleDOMEvents: {\n        compositionend: (view) => {\n          setTimeout(() => {\n            let {$cursor} = view.state.selection\n            if ($cursor) run(view, $cursor.pos, $cursor.pos, \"\", rules, plugin)\n          })\n        }\n      }\n    },\n\n    isInputRules: true\n  })\n  return plugin\n}\n\nfunction run(view, from, to, text, rules, plugin) {\n  if (view.composing) return false\n  let state = view.state, $from = state.doc.resolve(from)\n  if ($from.parent.type.spec.code) return false\n  let textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset,\n                                            null, \"\\ufffc\") + text\n  for (let i = 0; i < rules.length; i++) {\n    let match = rules[i].match.exec(textBefore)\n    let tr = match && rules[i].handler(state, match, from - (match[0].length - text.length), to)\n    if (!tr) continue\n    view.dispatch(tr.setMeta(plugin, {transform: tr, from, to, text}))\n    return true\n  }\n  return false\n}\n\n// :: (EditorState, ?(Transaction)) → bool\n// This is a command that will undo an input rule, if applying such a\n// rule was the last thing that the user did.\nexport function undoInputRule(state, dispatch) {\n  let plugins = state.plugins\n  for (let i = 0; i < plugins.length; i++) {\n    let plugin = plugins[i], undoable\n    if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {\n      if (dispatch) {\n        let tr = state.tr, toUndo = undoable.transform\n        for (let j = toUndo.steps.length - 1; j >= 0; j--)\n          tr.step(toUndo.steps[j].invert(toUndo.docs[j]))\n        if (undoable.text) {\n          let marks = tr.doc.resolve(undoable.from).marks()\n          tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks))\n        } else {\n          tr.delete(undoable.from, undoable.to)\n        }\n        dispatch(tr)\n      }\n      return true\n    }\n  }\n  return false\n}\n","import {InputRule} from \"./inputrules\"\n\n// :: InputRule Converts double dashes to an emdash.\nexport const emDash = new InputRule(/--$/, \"—\")\n// :: InputRule Converts three dots to an ellipsis character.\nexport const ellipsis = new InputRule(/\\.\\.\\.$/, \"…\")\n// :: InputRule “Smart” opening double quotes.\nexport const openDoubleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(\")$/, \"“\")\n// :: InputRule “Smart” closing double quotes.\nexport const closeDoubleQuote = new InputRule(/\"$/, \"”\")\n// :: InputRule “Smart” opening single quotes.\nexport const openSingleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(')$/, \"‘\")\n// :: InputRule “Smart” closing single quotes.\nexport const closeSingleQuote = new InputRule(/'$/, \"’\")\n\n// :: [InputRule] Smart-quote related input rules.\nexport const smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote]\n","import {InputRule} from \"./inputrules\"\nimport {findWrapping, canJoin} from \"prosemirror-transform\"\n\n// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>, ?([string], Node) → bool) → InputRule\n// Build an input rule for automatically wrapping a textblock when a\n// given string is typed. The `regexp` argument is\n// directly passed through to the `InputRule` constructor. You'll\n// probably want the regexp to start with `^`, so that the pattern can\n// only occur at the start of a textblock.\n//\n// `nodeType` is the type of node to wrap in. If it needs attributes,\n// you can either pass them directly, or pass a function that will\n// compute them from the regular expression match.\n//\n// By default, if there's a node with the same type above the newly\n// wrapped node, the rule will try to [join](#transform.Transform.join) those\n// two nodes. You can pass a join predicate, which takes a regular\n// expression match and the node before the wrapped node, and can\n// return a boolean to indicate whether a join should happen.\nexport function wrappingInputRule(regexp, nodeType, getAttrs, joinPredicate) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    let attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs\n    let tr = state.tr.delete(start, end)\n    let $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && findWrapping(range, nodeType, attrs)\n    if (!wrapping) return null\n    tr.wrap(range, wrapping)\n    let before = tr.doc.resolve(start - 1).nodeBefore\n    if (before && before.type == nodeType && canJoin(tr.doc, start - 1) &&\n        (!joinPredicate || joinPredicate(match, before)))\n      tr.join(start - 1)\n    return tr\n  })\n}\n\n// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>) → InputRule\n// Build an input rule that changes the type of a textblock when the\n// matched text is typed into it. You'll usually want to start your\n// regexp with `^` to that it is only matched at the start of a\n// textblock. The optional `getAttrs` parameter can be used to compute\n// the new node's attributes, and works the same as in the\n// `wrappingInputRule` function.\nexport function textblockTypeInputRule(regexp, nodeType, getAttrs) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    let $start = state.doc.resolve(start)\n    let attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs\n    if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType)) return null\n    return state.tr\n      .delete(start, end)\n      .setBlockType(start, start, nodeType, attrs)\n  })\n}\n","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"Directives/Tooltip\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Directives/Tooltip\"] = factory();\n\telse\n\t\troot[\"NextcloudVue\"] = root[\"NextcloudVue\"] || {}, root[\"NextcloudVue\"][\"Directives/Tooltip\"] = factory();\n})(window, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/dist/\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 13);\n","\"use strict\";\n\n/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n*/\n// css base code, injected by the css-loader\n// eslint-disable-next-line func-names\nmodule.exports = function (useSourceMap) {\n  var list = []; // return the list of modules as css string\n\n  list.toString = function toString() {\n    return this.map(function (item) {\n      var content = cssWithMappingToString(item, useSourceMap);\n\n      if (item[2]) {\n        return \"@media \".concat(item[2], \" {\").concat(content, \"}\");\n      }\n\n      return content;\n    }).join('');\n  }; // import a list of modules into the list\n  // eslint-disable-next-line func-names\n\n\n  list.i = function (modules, mediaQuery, dedupe) {\n    if (typeof modules === 'string') {\n      // eslint-disable-next-line no-param-reassign\n      modules = [[null, modules, '']];\n    }\n\n    var alreadyImportedModules = {};\n\n    if (dedupe) {\n      for (var i = 0; i < this.length; i++) {\n        // eslint-disable-next-line prefer-destructuring\n        var id = this[i][0];\n\n        if (id != null) {\n          alreadyImportedModules[id] = true;\n        }\n      }\n    }\n\n    for (var _i = 0; _i < modules.length; _i++) {\n      var item = [].concat(modules[_i]);\n\n      if (dedupe && alreadyImportedModules[item[0]]) {\n        // eslint-disable-next-line no-continue\n        continue;\n      }\n\n      if (mediaQuery) {\n        if (!item[2]) {\n          item[2] = mediaQuery;\n        } else {\n          item[2] = \"\".concat(mediaQuery, \" and \").concat(item[2]);\n        }\n      }\n\n      list.push(item);\n    }\n  };\n\n  return list;\n};\n\nfunction cssWithMappingToString(item, useSourceMap) {\n  var content = item[1] || ''; // eslint-disable-next-line prefer-destructuring\n\n  var cssMapping = item[3];\n\n  if (!cssMapping) {\n    return content;\n  }\n\n  if (useSourceMap && typeof btoa === 'function') {\n    var sourceMapping = toComment(cssMapping);\n    var sourceURLs = cssMapping.sources.map(function (source) {\n      return \"/*# sourceURL=\".concat(cssMapping.sourceRoot || '').concat(source, \" */\");\n    });\n    return [content].concat(sourceURLs).concat([sourceMapping]).join('\\n');\n  }\n\n  return [content].join('\\n');\n} // Adapted from convert-source-map (MIT)\n\n\nfunction toComment(sourceMap) {\n  // eslint-disable-next-line no-undef\n  var base64 = btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap))));\n  var data = \"sourceMappingURL=data:application/json;charset=utf-8;base64,\".concat(base64);\n  return \"/*# \".concat(data, \" */\");\n}","/**\n * @copyright Copyright (c) 2019 Julius Härtl <jus@bitgrid.net>\n *\n * @author Julius Härtl <jus@bitgrid.net>\n * @author John Molakvoæ <skjnldsv@protonmail.com>\n *\n * @license GNU AGPL version 3 or any later version\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http://www.gnu.org/licenses/>.\n *\n */\nimport { VTooltip } from 'v-tooltip'\nimport './index.scss'\n\n// force scope the tooltip and use .vue-tooltip\n// instead of .tooltip to avoid server compatibility\n// issues and the use of !important\nVTooltip.options.defaultTemplate = `<div class=\"vue-tooltip\" role=\"tooltip\" data-v-${SCOPE_VERSION}><div class=\"tooltip-arrow\"></div><div class=\"tooltip-inner\"></div></div>`\nVTooltip.options.defaultHtml = false\n\nexport default VTooltip\n","/**\n * Translates the list format produced by css-loader into something\n * easier to manipulate.\n */\nexport default function listToStyles (parentId, list) {\n  var styles = []\n  var newStyles = {}\n  for (var i = 0; i < list.length; i++) {\n    var item = list[i]\n    var id = item[0]\n    var css = item[1]\n    var media = item[2]\n    var sourceMap = item[3]\n    var part = {\n      id: parentId + ':' + i,\n      css: css,\n      media: media,\n      sourceMap: sourceMap\n    }\n    if (!newStyles[id]) {\n      styles.push(newStyles[id] = { id: id, parts: [part] })\n    } else {\n      newStyles[id].parts.push(part)\n    }\n  }\n  return styles\n}\n","/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n  Modified by Evan You @yyx990803\n*/\n\nimport listToStyles from './listToStyles'\n\nvar hasDocument = typeof document !== 'undefined'\n\nif (typeof DEBUG !== 'undefined' && DEBUG) {\n  if (!hasDocument) {\n    throw new Error(\n    'vue-style-loader cannot be used in a non-browser environment. ' +\n    \"Use { target: 'node' } in your Webpack config to indicate a server-rendering environment.\"\n  ) }\n}\n\n/*\ntype StyleObject = {\n  id: number;\n  parts: Array<StyleObjectPart>\n}\n\ntype StyleObjectPart = {\n  css: string;\n  media: string;\n  sourceMap: ?string\n}\n*/\n\nvar stylesInDom = {/*\n  [id: number]: {\n    id: number,\n    refs: number,\n    parts: Array<(obj?: StyleObjectPart) => void>\n  }\n*/}\n\nvar head = hasDocument && (document.head || document.getElementsByTagName('head')[0])\nvar singletonElement = null\nvar singletonCounter = 0\nvar isProduction = false\nvar noop = function () {}\nvar options = null\nvar ssrIdKey = 'data-vue-ssr-id'\n\n// Force single-tag solution on IE6-9, which has a hard limit on the # of <style>\n// tags it will allow on a page\nvar isOldIE = typeof navigator !== 'undefined' && /msie [6-9]\\b/.test(navigator.userAgent.toLowerCase())\n\nexport default function addStylesClient (parentId, list, _isProduction, _options) {\n  isProduction = _isProduction\n\n  options = _options || {}\n\n  var styles = listToStyles(parentId, list)\n  addStylesToDom(styles)\n\n  return function update (newList) {\n    var mayRemove = []\n    for (var i = 0; i < styles.length; i++) {\n      var item = styles[i]\n      var domStyle = stylesInDom[item.id]\n      domStyle.refs--\n      mayRemove.push(domStyle)\n    }\n    if (newList) {\n      styles = listToStyles(parentId, newList)\n      addStylesToDom(styles)\n    } else {\n      styles = []\n    }\n    for (var i = 0; i < mayRemove.length; i++) {\n      var domStyle = mayRemove[i]\n      if (domStyle.refs === 0) {\n        for (var j = 0; j < domStyle.parts.length; j++) {\n          domStyle.parts[j]()\n        }\n        delete stylesInDom[domStyle.id]\n      }\n    }\n  }\n}\n\nfunction addStylesToDom (styles /* Array<StyleObject> */) {\n  for (var i = 0; i < styles.length; i++) {\n    var item = styles[i]\n    var domStyle = stylesInDom[item.id]\n    if (domStyle) {\n      domStyle.refs++\n      for (var j = 0; j < domStyle.parts.length; j++) {\n        domStyle.parts[j](item.parts[j])\n      }\n      for (; j < item.parts.length; j++) {\n        domStyle.parts.push(addStyle(item.parts[j]))\n      }\n      if (domStyle.parts.length > item.parts.length) {\n        domStyle.parts.length = item.parts.length\n      }\n    } else {\n      var parts = []\n      for (var j = 0; j < item.parts.length; j++) {\n        parts.push(addStyle(item.parts[j]))\n      }\n      stylesInDom[item.id] = { id: item.id, refs: 1, parts: parts }\n    }\n  }\n}\n\nfunction createStyleElement () {\n  var styleElement = document.createElement('style')\n  styleElement.type = 'text/css'\n  head.appendChild(styleElement)\n  return styleElement\n}\n\nfunction addStyle (obj /* StyleObjectPart */) {\n  var update, remove\n  var styleElement = document.querySelector('style[' + ssrIdKey + '~=\"' + obj.id + '\"]')\n\n  if (styleElement) {\n    if (isProduction) {\n      // has SSR styles and in production mode.\n      // simply do nothing.\n      return noop\n    } else {\n      // has SSR styles but in dev mode.\n      // for some reason Chrome can't handle source map in server-rendered\n      // style tags - source maps in <style> only works if the style tag is\n      // created and inserted dynamically. So we remove the server rendered\n      // styles and inject new ones.\n      styleElement.parentNode.removeChild(styleElement)\n    }\n  }\n\n  if (isOldIE) {\n    // use singleton mode for IE9.\n    var styleIndex = singletonCounter++\n    styleElement = singletonElement || (singletonElement = createStyleElement())\n    update = applyToSingletonTag.bind(null, styleElement, styleIndex, false)\n    remove = applyToSingletonTag.bind(null, styleElement, styleIndex, true)\n  } else {\n    // use multi-style-tag mode in all other cases\n    styleElement = createStyleElement()\n    update = applyToTag.bind(null, styleElement)\n    remove = function () {\n      styleElement.parentNode.removeChild(styleElement)\n    }\n  }\n\n  update(obj)\n\n  return function updateStyle (newObj /* StyleObjectPart */) {\n    if (newObj) {\n      if (newObj.css === obj.css &&\n          newObj.media === obj.media &&\n          newObj.sourceMap === obj.sourceMap) {\n        return\n      }\n      update(obj = newObj)\n    } else {\n      remove()\n    }\n  }\n}\n\nvar replaceText = (function () {\n  var textStore = []\n\n  return function (index, replacement) {\n    textStore[index] = replacement\n    return textStore.filter(Boolean).join('\\n')\n  }\n})()\n\nfunction applyToSingletonTag (styleElement, index, remove, obj) {\n  var css = remove ? '' : obj.css\n\n  if (styleElement.styleSheet) {\n    styleElement.styleSheet.cssText = replaceText(index, css)\n  } else {\n    var cssNode = document.createTextNode(css)\n    var childNodes = styleElement.childNodes\n    if (childNodes[index]) styleElement.removeChild(childNodes[index])\n    if (childNodes.length) {\n      styleElement.insertBefore(cssNode, childNodes[index])\n    } else {\n      styleElement.appendChild(cssNode)\n    }\n  }\n}\n\nfunction applyToTag (styleElement, obj) {\n  var css = obj.css\n  var media = obj.media\n  var sourceMap = obj.sourceMap\n\n  if (media) {\n    styleElement.setAttribute('media', media)\n  }\n  if (options.ssrId) {\n    styleElement.setAttribute(ssrIdKey, obj.id)\n  }\n\n  if (sourceMap) {\n    // https://developer.chrome.com/devtools/docs/javascript-debugging\n    // this makes source maps inside style tags work properly in Chrome\n    css += '\\n/*# sourceURL=' + sourceMap.sources[0] + ' */'\n    // http://stackoverflow.com/a/26603875\n    css += '\\n/*# sourceMappingURL=data:application/json;base64,' + btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap)))) + ' */'\n  }\n\n  if (styleElement.styleSheet) {\n    styleElement.styleSheet.cssText = css\n  } else {\n    while (styleElement.firstChild) {\n      styleElement.removeChild(styleElement.firstChild)\n    }\n    styleElement.appendChild(document.createTextNode(css))\n  }\n}\n","module.exports = require(\"v-tooltip\");","// style-loader: Adds some css to the DOM by adding a <style> tag\n\n// load the styles\nvar content = require(\"!!../../../node_modules/css-loader/dist/cjs.js!../../../node_modules/resolve-url-loader/index.js!../../../node_modules/sass-loader/dist/cjs.js??ref--1-3!./index.scss\");\nif(typeof content === 'string') content = [[module.id, content, '']];\nif(content.locals) module.exports = content.locals;\n// add the styles to the DOM\nvar add = require(\"!../../../node_modules/vue-style-loader/lib/addStylesClient.js\").default\nvar update = add(\"941c791e\", content, true, {});","// Imports\nvar ___CSS_LOADER_API_IMPORT___ = require(\"../../../node_modules/css-loader/dist/runtime/api.js\");\nexports = ___CSS_LOADER_API_IMPORT___(false);\n// Module\nexports.push([module.id, \".vue-tooltip[data-v-e1f55ce]{position:absolute;z-index:100000;right:auto;left:auto;display:block;margin:0;margin-top:-3px;padding:10px 0;text-align:left;text-align:start;white-space:normal;text-decoration:none;letter-spacing:normal;word-spacing:normal;text-transform:none;word-wrap:normal;word-break:normal;opacity:0;text-shadow:none;font-family:'Nunito', 'Open Sans', Frutiger, Calibri, 'Myriad Pro', Myriad, sans-serif;font-size:12px;font-weight:normal;font-style:normal;line-height:1.6;line-break:auto;filter:drop-shadow(0 1px 10px var(--color-box-shadow))}.vue-tooltip[data-v-e1f55ce][x-placement^='top'] .tooltip-arrow{bottom:0;margin-top:0;margin-bottom:0;border-width:10px 10px 0 10px;border-right-color:transparent;border-bottom-color:transparent;border-left-color:transparent}.vue-tooltip[data-v-e1f55ce][x-placement^='bottom'] .tooltip-arrow{top:0;margin-top:0;margin-bottom:0;border-width:0 10px 10px 10px;border-top-color:transparent;border-right-color:transparent;border-left-color:transparent}.vue-tooltip[data-v-e1f55ce][x-placement^='right'] .tooltip-arrow{right:100%;margin-right:0;margin-left:0;border-width:10px 10px 10px 0;border-top-color:transparent;border-bottom-color:transparent;border-left-color:transparent}.vue-tooltip[data-v-e1f55ce][x-placement^='left'] .tooltip-arrow{left:100%;margin-right:0;margin-left:0;border-width:10px 0 10px 10px;border-top-color:transparent;border-right-color:transparent;border-bottom-color:transparent}.vue-tooltip[data-v-e1f55ce][aria-hidden='true']{visibility:hidden;transition:opacity .15s, visibility .15s;opacity:0}.vue-tooltip[data-v-e1f55ce][aria-hidden='false']{visibility:visible;transition:opacity .15s;opacity:1}.vue-tooltip[data-v-e1f55ce] .tooltip-inner{max-width:350px;padding:5px 8px;text-align:center;color:var(--color-main-text);border-radius:var(--border-radius);background-color:var(--color-main-background)}.vue-tooltip[data-v-e1f55ce] .tooltip-arrow{position:absolute;z-index:1;width:0;height:0;margin:0;border-style:solid;border-color:var(--color-main-background)}\\n\", \"\"]);\n// Exports\nmodule.exports = exports;\n","var GOOD_LEAF_SIZE = 200;\n\n// :: class<T> A rope sequence is a persistent sequence data structure\n// that supports appending, prepending, and slicing without doing a\n// full copy. It is represented as a mostly-balanced tree.\nvar RopeSequence = function RopeSequence () {};\n\nRopeSequence.prototype.append = function append (other) {\n  if (!other.length) { return this }\n  other = RopeSequence.from(other);\n\n  return (!this.length && other) ||\n    (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||\n    (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||\n    this.appendInner(other)\n};\n\n// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Prepend an array or other rope to this one, returning a new rope.\nRopeSequence.prototype.prepend = function prepend (other) {\n  if (!other.length) { return this }\n  return RopeSequence.from(other).append(this)\n};\n\nRopeSequence.prototype.appendInner = function appendInner (other) {\n  return new Append(this, other)\n};\n\n// :: (?number, ?number) → RopeSequence<T>\n// Create a rope repesenting a sub-sequence of this rope.\nRopeSequence.prototype.slice = function slice (from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  if (from >= to) { return RopeSequence.empty }\n  return this.sliceInner(Math.max(0, from), Math.min(this.length, to))\n};\n\n// :: (number) → T\n// Retrieve the element at the given position from this rope.\nRopeSequence.prototype.get = function get (i) {\n  if (i < 0 || i >= this.length) { return undefined }\n  return this.getInner(i)\n};\n\n// :: ((element: T, index: number) → ?bool, ?number, ?number)\n// Call the given function for each element between the given\n// indices. This tends to be more efficient than looping over the\n// indices and calling `get`, because it doesn't have to descend the\n// tree for every element.\nRopeSequence.prototype.forEach = function forEach (f, from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  if (from <= to)\n    { this.forEachInner(f, from, to, 0); }\n  else\n    { this.forEachInvertedInner(f, from, to, 0); }\n};\n\n// :: ((element: T, index: number) → U, ?number, ?number) → [U]\n// Map the given functions over the elements of the rope, producing\n// a flat array.\nRopeSequence.prototype.map = function map (f, from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  var result = [];\n  this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);\n  return result\n};\n\n// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Create a rope representing the given array, or return the rope\n// itself if a rope was given.\nRopeSequence.from = function from (values) {\n  if (values instanceof RopeSequence) { return values }\n  return values && values.length ? new Leaf(values) : RopeSequence.empty\n};\n\nvar Leaf = /*@__PURE__*/(function (RopeSequence) {\n  function Leaf(values) {\n    RopeSequence.call(this);\n    this.values = values;\n  }\n\n  if ( RopeSequence ) Leaf.__proto__ = RopeSequence;\n  Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n  Leaf.prototype.constructor = Leaf;\n\n  var prototypeAccessors = { length: { configurable: true },depth: { configurable: true } };\n\n  Leaf.prototype.flatten = function flatten () {\n    return this.values\n  };\n\n  Leaf.prototype.sliceInner = function sliceInner (from, to) {\n    if (from == 0 && to == this.length) { return this }\n    return new Leaf(this.values.slice(from, to))\n  };\n\n  Leaf.prototype.getInner = function getInner (i) {\n    return this.values[i]\n  };\n\n  Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {\n    for (var i = from; i < to; i++)\n      { if (f(this.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    for (var i = from - 1; i >= to; i--)\n      { if (f(this.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.leafAppend = function leafAppend (other) {\n    if (this.length + other.length <= GOOD_LEAF_SIZE)\n      { return new Leaf(this.values.concat(other.flatten())) }\n  };\n\n  Leaf.prototype.leafPrepend = function leafPrepend (other) {\n    if (this.length + other.length <= GOOD_LEAF_SIZE)\n      { return new Leaf(other.flatten().concat(this.values)) }\n  };\n\n  prototypeAccessors.length.get = function () { return this.values.length };\n\n  prototypeAccessors.depth.get = function () { return 0 };\n\n  Object.defineProperties( Leaf.prototype, prototypeAccessors );\n\n  return Leaf;\n}(RopeSequence));\n\n// :: RopeSequence\n// The empty rope sequence.\nRopeSequence.empty = new Leaf([]);\n\nvar Append = /*@__PURE__*/(function (RopeSequence) {\n  function Append(left, right) {\n    RopeSequence.call(this);\n    this.left = left;\n    this.right = right;\n    this.length = left.length + right.length;\n    this.depth = Math.max(left.depth, right.depth) + 1;\n  }\n\n  if ( RopeSequence ) Append.__proto__ = RopeSequence;\n  Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n  Append.prototype.constructor = Append;\n\n  Append.prototype.flatten = function flatten () {\n    return this.left.flatten().concat(this.right.flatten())\n  };\n\n  Append.prototype.getInner = function getInner (i) {\n    return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)\n  };\n\n  Append.prototype.forEachInner = function forEachInner (f, from, to, start) {\n    var leftLen = this.left.length;\n    if (from < leftLen &&\n        this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)\n      { return false }\n    if (to > leftLen &&\n        this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)\n      { return false }\n  };\n\n  Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    var leftLen = this.left.length;\n    if (from > leftLen &&\n        this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)\n      { return false }\n    if (to < leftLen &&\n        this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)\n      { return false }\n  };\n\n  Append.prototype.sliceInner = function sliceInner (from, to) {\n    if (from == 0 && to == this.length) { return this }\n    var leftLen = this.left.length;\n    if (to <= leftLen) { return this.left.slice(from, to) }\n    if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }\n    return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))\n  };\n\n  Append.prototype.leafAppend = function leafAppend (other) {\n    var inner = this.right.leafAppend(other);\n    if (inner) { return new Append(this.left, inner) }\n  };\n\n  Append.prototype.leafPrepend = function leafPrepend (other) {\n    var inner = this.left.leafPrepend(other);\n    if (inner) { return new Append(inner, this.right) }\n  };\n\n  Append.prototype.appendInner = function appendInner (other) {\n    if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)\n      { return new Append(this.left, new Append(this.right, other)) }\n    return new Append(this, other)\n  };\n\n  return Append;\n}(RopeSequence));\n\nvar ropeSequence = RopeSequence;\n\nexport default ropeSequence;\n","import RopeSequence from \"rope-sequence\"\nimport {Mapping} from \"prosemirror-transform\"\nimport {Plugin, PluginKey} from \"prosemirror-state\"\n\n// ProseMirror's history isn't simply a way to roll back to a previous\n// state, because ProseMirror supports applying changes without adding\n// them to the history (for example during collaboration).\n//\n// To this end, each 'Branch' (one for the undo history and one for\n// the redo history) keeps an array of 'Items', which can optionally\n// hold a step (an actual undoable change), and always hold a position\n// map (which is needed to move changes below them to apply to the\n// current document).\n//\n// An item that has both a step and a selection bookmark is the start\n// of an 'event' — a group of changes that will be undone or redone at\n// once. (It stores only the bookmark, since that way we don't have to\n// provide a document until the selection is actually applied, which\n// is useful when compressing.)\n\n// Used to schedule history compression\nconst max_empty_items = 500\n\nclass Branch {\n  constructor(items, eventCount) {\n    this.items = items\n    this.eventCount = eventCount\n  }\n\n  // : (EditorState, bool) → ?{transform: Transform, selection: ?SelectionBookmark, remaining: Branch}\n  // Pop the latest event off the branch's history and apply it\n  // to a document transform.\n  popEvent(state, preserveItems) {\n    if (this.eventCount == 0) return null\n\n    let end = this.items.length\n    for (;; end--) {\n      let next = this.items.get(end - 1)\n      if (next.selection) { --end; break }\n    }\n\n    let remap, mapFrom\n    if (preserveItems) {\n      remap = this.remapping(end, this.items.length)\n      mapFrom = remap.maps.length\n    }\n    let transform = state.tr\n    let selection, remaining\n    let addAfter = [], addBefore = []\n\n    this.items.forEach((item, i) => {\n      if (!item.step) {\n        if (!remap) {\n          remap = this.remapping(end, i + 1)\n          mapFrom = remap.maps.length\n        }\n        mapFrom--\n        addBefore.push(item)\n        return\n      }\n\n      if (remap) {\n        addBefore.push(new Item(item.map))\n        let step = item.step.map(remap.slice(mapFrom)), map\n\n        if (step && transform.maybeStep(step).doc) {\n          map = transform.mapping.maps[transform.mapping.maps.length - 1]\n          addAfter.push(new Item(map, null, null, addAfter.length + addBefore.length))\n        }\n        mapFrom--\n        if (map) remap.appendMap(map, mapFrom)\n      } else {\n        transform.maybeStep(item.step)\n      }\n\n      if (item.selection) {\n        selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection\n        remaining = new Branch(this.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this.eventCount - 1)\n        return false\n      }\n    }, this.items.length, 0)\n\n    return {remaining, transform, selection}\n  }\n\n  // : (Transform, ?SelectionBookmark, Object) → Branch\n  // Create a new branch with the given transform added.\n  addTransform(transform, selection, histOptions, preserveItems) {\n    let newItems = [], eventCount = this.eventCount\n    let oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null\n\n    for (let i = 0; i < transform.steps.length; i++) {\n      let step = transform.steps[i].invert(transform.docs[i])\n      let item = new Item(transform.mapping.maps[i], step, selection), merged\n      if (merged = lastItem && lastItem.merge(item)) {\n        item = merged\n        if (i) newItems.pop()\n        else oldItems = oldItems.slice(0, oldItems.length - 1)\n      }\n      newItems.push(item)\n      if (selection) {\n        eventCount++\n        selection = null\n      }\n      if (!preserveItems) lastItem = item\n    }\n    let overflow = eventCount - histOptions.depth\n    if (overflow > DEPTH_OVERFLOW) {\n      oldItems = cutOffEvents(oldItems, overflow)\n      eventCount -= overflow\n    }\n    return new Branch(oldItems.append(newItems), eventCount)\n  }\n\n  remapping(from, to) {\n    let maps = new Mapping\n    this.items.forEach((item, i) => {\n      let mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from\n          ? maps.maps.length - item.mirrorOffset : null\n      maps.appendMap(item.map, mirrorPos)\n    }, from, to)\n    return maps\n  }\n\n  addMaps(array) {\n    if (this.eventCount == 0) return this\n    return new Branch(this.items.append(array.map(map => new Item(map))), this.eventCount)\n  }\n\n  // : (Transform, number)\n  // When the collab module receives remote changes, the history has\n  // to know about those, so that it can adjust the steps that were\n  // rebased on top of the remote changes, and include the position\n  // maps for the remote changes in its array of items.\n  rebased(rebasedTransform, rebasedCount) {\n    if (!this.eventCount) return this\n\n    let rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount)\n\n    let mapping = rebasedTransform.mapping\n    let newUntil = rebasedTransform.steps.length\n    let eventCount = this.eventCount\n    this.items.forEach(item => { if (item.selection) eventCount-- }, start)\n\n    let iRebased = rebasedCount\n    this.items.forEach(item => {\n      let pos = mapping.getMirror(--iRebased)\n      if (pos == null) return\n      newUntil = Math.min(newUntil, pos)\n      let map = mapping.maps[pos]\n      if (item.step) {\n        let step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos])\n        let selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos))\n        if (selection) eventCount++\n        rebasedItems.push(new Item(map, step, selection))\n      } else {\n        rebasedItems.push(new Item(map))\n      }\n    }, start)\n\n    let newMaps = []\n    for (let i = rebasedCount; i < newUntil; i++)\n      newMaps.push(new Item(mapping.maps[i]))\n    let items = this.items.slice(0, start).append(newMaps).append(rebasedItems)\n    let branch = new Branch(items, eventCount)\n\n    if (branch.emptyItemCount() > max_empty_items)\n      branch = branch.compress(this.items.length - rebasedItems.length)\n    return branch\n  }\n\n  emptyItemCount() {\n    let count = 0\n    this.items.forEach(item => { if (!item.step) count++ })\n    return count\n  }\n\n  // Compressing a branch means rewriting it to push the air (map-only\n  // items) out. During collaboration, these naturally accumulate\n  // because each remote change adds one. The `upto` argument is used\n  // to ensure that only the items below a given level are compressed,\n  // because `rebased` relies on a clean, untouched set of items in\n  // order to associate old items with rebased steps.\n  compress(upto = this.items.length) {\n    let remap = this.remapping(0, upto), mapFrom = remap.maps.length\n    let items = [], events = 0\n    this.items.forEach((item, i) => {\n      if (i >= upto) {\n        items.push(item)\n        if (item.selection) events++\n      } else if (item.step) {\n        let step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap()\n        mapFrom--\n        if (map) remap.appendMap(map, mapFrom)\n        if (step) {\n          let selection = item.selection && item.selection.map(remap.slice(mapFrom))\n          if (selection) events++\n          let newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1\n          if (merged = items.length && items[last].merge(newItem))\n            items[last] = merged\n          else\n            items.push(newItem)\n        }\n      } else if (item.map) {\n        mapFrom--\n      }\n    }, this.items.length, 0)\n    return new Branch(RopeSequence.from(items.reverse()), events)\n  }\n}\n\nBranch.empty = new Branch(RopeSequence.empty, 0)\n\nfunction cutOffEvents(items, n) {\n  let cutPoint\n  items.forEach((item, i) => {\n    if (item.selection && (n-- == 0)) {\n      cutPoint = i\n      return false\n    }\n  })\n  return items.slice(cutPoint)\n}\n\nclass Item {\n  constructor(map, step, selection, mirrorOffset) {\n    // The (forward) step map for this item.\n    this.map = map\n    // The inverted step\n    this.step = step\n    // If this is non-null, this item is the start of a group, and\n    // this selection is the starting selection for the group (the one\n    // that was active before the first step was applied)\n    this.selection = selection\n    // If this item is the inverse of a previous mapping on the stack,\n    // this points at the inverse's offset\n    this.mirrorOffset = mirrorOffset\n  }\n\n  merge(other) {\n    if (this.step && other.step && !other.selection) {\n      let step = other.step.merge(this.step)\n      if (step) return new Item(step.getMap().invert(), step, this.selection)\n    }\n  }\n}\n\n// The value of the state field that tracks undo/redo history for that\n// state. Will be stored in the plugin state when the history plugin\n// is active.\nexport class HistoryState {\n  constructor(done, undone, prevRanges, prevTime) {\n    this.done = done\n    this.undone = undone\n    this.prevRanges = prevRanges\n    this.prevTime = prevTime\n  }\n}\n\nconst DEPTH_OVERFLOW = 20\n\n// : (HistoryState, EditorState, Transaction, Object)\n// Record a transformation in undo history.\nfunction applyTransaction(history, state, tr, options) {\n  let historyTr = tr.getMeta(historyKey), rebased\n  if (historyTr) return historyTr.historyState\n\n  if (tr.getMeta(closeHistoryKey)) history = new HistoryState(history.done, history.undone, null, 0)\n\n  let appended = tr.getMeta(\"appendedTransaction\")\n\n  if (tr.steps.length == 0) {\n    return history\n  } else if (appended && appended.getMeta(historyKey)) {\n    if (appended.getMeta(historyKey).redo)\n      return new HistoryState(history.done.addTransform(tr, null, options, mustPreserveItems(state)),\n                              history.undone, rangesFor(tr.mapping.maps[tr.steps.length - 1]), history.prevTime)\n    else\n      return new HistoryState(history.done, history.undone.addTransform(tr, null, options, mustPreserveItems(state)),\n                              null, history.prevTime)\n  } else if (tr.getMeta(\"addToHistory\") !== false && !(appended && appended.getMeta(\"addToHistory\") === false)) {\n    // Group transforms that occur in quick succession into one event.\n    let newGroup = history.prevTime == 0 || !appended && (history.prevTime < (tr.time || 0) - options.newGroupDelay ||\n                                                          !isAdjacentTo(tr, history.prevRanges))\n    let prevRanges = appended ? mapRanges(history.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps[tr.steps.length - 1])\n    return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : null,\n                                                      options, mustPreserveItems(state)),\n                            Branch.empty, prevRanges, tr.time)\n  } else if (rebased = tr.getMeta(\"rebased\")) {\n    // Used by the collab module to tell the history that some of its\n    // content has been rebased.\n    return new HistoryState(history.done.rebased(tr, rebased),\n                            history.undone.rebased(tr, rebased),\n                            mapRanges(history.prevRanges, tr.mapping), history.prevTime)\n  } else {\n    return new HistoryState(history.done.addMaps(tr.mapping.maps),\n                            history.undone.addMaps(tr.mapping.maps),\n                            mapRanges(history.prevRanges, tr.mapping), history.prevTime)\n  }\n}\n\nfunction isAdjacentTo(transform, prevRanges) {\n  if (!prevRanges) return false\n  if (!transform.docChanged) return true\n  let adjacent = false\n  transform.mapping.maps[0].forEach((start, end) => {\n    for (let i = 0; i < prevRanges.length; i += 2)\n      if (start <= prevRanges[i + 1] && end >= prevRanges[i])\n        adjacent = true\n  })\n  return adjacent\n}\n\nfunction rangesFor(map) {\n  let result = []\n  map.forEach((_from, _to, from, to) => result.push(from, to))\n  return result\n}\n\nfunction mapRanges(ranges, mapping) {\n  if (!ranges) return null\n  let result = []\n  for (let i = 0; i < ranges.length; i += 2) {\n    let from = mapping.map(ranges[i], 1), to = mapping.map(ranges[i + 1], -1)\n    if (from <= to) result.push(from, to)\n  }\n  return result\n}\n\n// : (HistoryState, EditorState, (tr: Transaction), bool)\n// Apply the latest event from one branch to the document and shift the event\n// onto the other branch.\nfunction histTransaction(history, state, dispatch, redo) {\n  let preserveItems = mustPreserveItems(state), histOptions = historyKey.get(state).spec.config\n  let pop = (redo ? history.undone : history.done).popEvent(state, preserveItems)\n  if (!pop) return\n\n  let selection = pop.selection.resolve(pop.transform.doc)\n  let added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(),\n                                                                  histOptions, preserveItems)\n\n  let newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0)\n  dispatch(pop.transform.setSelection(selection).setMeta(historyKey, {redo, historyState: newHist}).scrollIntoView())\n}\n\nlet cachedPreserveItems = false, cachedPreserveItemsPlugins = null\n// Check whether any plugin in the given state has a\n// `historyPreserveItems` property in its spec, in which case we must\n// preserve steps exactly as they came in, so that they can be\n// rebased.\nfunction mustPreserveItems(state) {\n  let plugins = state.plugins\n  if (cachedPreserveItemsPlugins != plugins) {\n    cachedPreserveItems = false\n    cachedPreserveItemsPlugins = plugins\n    for (let i = 0; i < plugins.length; i++) if (plugins[i].spec.historyPreserveItems) {\n      cachedPreserveItems = true\n      break\n    }\n  }\n  return cachedPreserveItems\n}\n\n// :: (Transaction) → Transaction\n// Set a flag on the given transaction that will prevent further steps\n// from being appended to an existing history event (so that they\n// require a separate undo command to undo).\nexport function closeHistory(tr) {\n  return tr.setMeta(closeHistoryKey, true)\n}\n\nconst historyKey = new PluginKey(\"history\")\nconst closeHistoryKey = new PluginKey(\"closeHistory\")\n\n// :: (?Object) → Plugin\n// Returns a plugin that enables the undo history for an editor. The\n// plugin will track undo and redo stacks, which can be used with the\n// [`undo`](#history.undo) and [`redo`](#history.redo) commands.\n//\n// You can set an `\"addToHistory\"` [metadata\n// property](#state.Transaction.setMeta) of `false` on a transaction\n// to prevent it from being rolled back by undo.\n//\n//   config::-\n//   Supports the following configuration options:\n//\n//     depth:: ?number\n//     The amount of history events that are collected before the\n//     oldest events are discarded. Defaults to 100.\n//\n//     newGroupDelay:: ?number\n//     The delay between changes after which a new group should be\n//     started. Defaults to 500 (milliseconds). Note that when changes\n//     aren't adjacent, a new group is always started.\nexport function history(config) {\n  config = {depth: config && config.depth || 100,\n            newGroupDelay: config && config.newGroupDelay || 500}\n  return new Plugin({\n    key: historyKey,\n\n    state: {\n      init() {\n        return new HistoryState(Branch.empty, Branch.empty, null, 0)\n      },\n      apply(tr, hist, state) {\n        return applyTransaction(hist, state, tr, config)\n      }\n    },\n\n    config\n  })\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// A command function that undoes the last change, if any.\nexport function undo(state, dispatch) {\n  let hist = historyKey.getState(state)\n  if (!hist || hist.done.eventCount == 0) return false\n  if (dispatch) histTransaction(hist, state, dispatch, false)\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// A command function that redoes the last undone change, if any.\nexport function redo(state, dispatch) {\n  let hist = historyKey.getState(state)\n  if (!hist || hist.undone.eventCount == 0) return false\n  if (dispatch) histTransaction(hist, state, dispatch, true)\n  return true\n}\n\n// :: (EditorState) → number\n// The amount of undoable events available in a given state.\nexport function undoDepth(state) {\n  let hist = historyKey.getState(state)\n  return hist ? hist.done.eventCount : 0\n}\n\n// :: (EditorState) → number\n// The amount of redoable events available in a given editor state.\nexport function redoDepth(state) {\n  let hist = historyKey.getState(state)\n  return hist ? hist.undone.eventCount : 0\n}\n","\n    /*!\n    * tiptap-extensions v1.33.1\n    * (c) 2020 überdosis GbR (limited liability)\n    * @license MIT\n    */\n  \nimport { Node, Plugin, PluginKey, Mark, Extension } from 'tiptap';\nimport { toggleWrap, wrappingInputRule, toggleList, toggleBlockType, setBlockType, textblockTypeInputRule, chainCommands, exitCode, nodeInputRule, splitListItem, sinkListItem, liftListItem, insertText, replaceText, splitToDefaultListItem, toggleMark, markInputRule, markPasteRule, updateMark, removeMark, pasteRule } from 'tiptap-commands';\nimport low from 'lowlight/lib/core';\nimport { DecorationSet, Decoration } from 'prosemirror-view';\nimport { findBlockNodes, createTable } from 'prosemirror-utils';\nimport { Fragment } from 'prosemirror-model';\nimport { Plugin as Plugin$1, PluginKey as PluginKey$1, TextSelection } from 'prosemirror-state';\nimport { tableNodes, addColumnBefore, addColumnAfter, deleteColumn, addRowBefore, addRowAfter, deleteRow, deleteTable, mergeCells, splitCell, toggleHeaderColumn, toggleHeaderRow, toggleHeaderCell, setCellAttr, fixTables, goToNextCell, columnResizing, tableEditing } from 'prosemirror-tables';\nimport { getMarkAttrs, nodeEqualsType } from 'tiptap-utils';\nimport { Step } from 'prosemirror-transform';\nimport { sendableSteps, getVersion, receiveTransaction, collab } from 'prosemirror-collab';\nimport { history, undo, redo, undoDepth, redoDepth } from 'prosemirror-history';\n\nclass Blockquote extends Node {\n  get name() {\n    return 'blockquote';\n  }\n\n  get schema() {\n    return {\n      content: 'block*',\n      group: 'block',\n      defining: true,\n      draggable: false,\n      parseDOM: [{\n        tag: 'blockquote'\n      }],\n      toDOM: () => ['blockquote', 0]\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => toggleWrap(type);\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Ctrl->': toggleWrap(type)\n    };\n  }\n\n  inputRules({\n    type\n  }) {\n    return [wrappingInputRule(/^\\s*>\\s$/, type)];\n  }\n\n}\n\nclass BulletList extends Node {\n  get name() {\n    return 'bullet_list';\n  }\n\n  get schema() {\n    return {\n      content: 'list_item+',\n      group: 'block',\n      parseDOM: [{\n        tag: 'ul'\n      }],\n      toDOM: () => ['ul', 0]\n    };\n  }\n\n  commands({\n    type,\n    schema\n  }) {\n    return () => toggleList(type, schema.nodes.list_item);\n  }\n\n  keys({\n    type,\n    schema\n  }) {\n    return {\n      'Shift-Ctrl-8': toggleList(type, schema.nodes.list_item)\n    };\n  }\n\n  inputRules({\n    type\n  }) {\n    return [wrappingInputRule(/^\\s*([-+*])\\s$/, type)];\n  }\n\n}\n\nclass CodeBlock extends Node {\n  get name() {\n    return 'code_block';\n  }\n\n  get schema() {\n    return {\n      content: 'text*',\n      marks: '',\n      group: 'block',\n      code: true,\n      defining: true,\n      draggable: false,\n      parseDOM: [{\n        tag: 'pre',\n        preserveWhitespace: 'full'\n      }],\n      toDOM: () => ['pre', ['code', 0]]\n    };\n  }\n\n  commands({\n    type,\n    schema\n  }) {\n    return () => toggleBlockType(type, schema.nodes.paragraph);\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Shift-Ctrl-\\\\': setBlockType(type)\n    };\n  }\n\n  inputRules({\n    type\n  }) {\n    return [textblockTypeInputRule(/^```$/, type)];\n  }\n\n}\n\nfunction getDecorations({\n  doc,\n  name\n}) {\n  const decorations = [];\n  const blocks = findBlockNodes(doc).filter(item => item.node.type.name === name);\n\n  const flatten = list => list.reduce((a, b) => a.concat(Array.isArray(b) ? flatten(b) : b), []);\n\n  function parseNodes(nodes, className = []) {\n    return nodes.map(node => {\n      const classes = [...className, ...(node.properties ? node.properties.className : [])];\n\n      if (node.children) {\n        return parseNodes(node.children, classes);\n      }\n\n      return {\n        text: node.value,\n        classes\n      };\n    });\n  }\n\n  blocks.forEach(block => {\n    let startPos = block.pos + 1;\n    const nodes = low.highlightAuto(block.node.textContent).value;\n    flatten(parseNodes(nodes)).map(node => {\n      const from = startPos;\n      const to = from + node.text.length;\n      startPos = to;\n      return { ...node,\n        from,\n        to\n      };\n    }).forEach(node => {\n      const decoration = Decoration.inline(node.from, node.to, {\n        class: node.classes.join(' ')\n      });\n      decorations.push(decoration);\n    });\n  });\n  return DecorationSet.create(doc, decorations);\n}\n\nfunction HighlightPlugin({\n  name\n}) {\n  return new Plugin({\n    name: new PluginKey('highlight'),\n    state: {\n      init: (_, {\n        doc\n      }) => getDecorations({\n        doc,\n        name\n      }),\n      apply: (transaction, decorationSet, oldState, newState) => {\n        // TODO: find way to cache decorations\n        // https://discuss.prosemirror.net/t/how-to-update-multiple-inline-decorations-on-node-change/1493\n        const oldNodeName = oldState.selection.$head.parent.type.name;\n        const newNodeName = newState.selection.$head.parent.type.name;\n        const oldNodes = findBlockNodes(oldState.doc).filter(item => item.node.type.name === name);\n        const newNodes = findBlockNodes(newState.doc).filter(item => item.node.type.name === name); // Apply decorations if selection includes named node, or transaction changes named node.\n\n        if (transaction.docChanged && ([oldNodeName, newNodeName].includes(name) || newNodes.length !== oldNodes.length)) {\n          return getDecorations({\n            doc: transaction.doc,\n            name\n          });\n        }\n\n        return decorationSet.map(transaction.mapping, transaction.doc);\n      }\n    },\n    props: {\n      decorations(state) {\n        return this.getState(state);\n      }\n\n    }\n  });\n}\n\nclass CodeBlockHighlight extends Node {\n  constructor(options = {}) {\n    super(options);\n\n    try {\n      Object.entries(this.options.languages).forEach(([name, mapping]) => {\n        low.registerLanguage(name, mapping);\n      });\n    } catch (err) {\n      throw new Error('Invalid syntax highlight definitions: define at least one highlight.js language mapping');\n    }\n  }\n\n  get name() {\n    return 'code_block';\n  }\n\n  get defaultOptions() {\n    return {\n      languages: {}\n    };\n  }\n\n  get schema() {\n    return {\n      content: 'text*',\n      marks: '',\n      group: 'block',\n      code: true,\n      defining: true,\n      draggable: false,\n      parseDOM: [{\n        tag: 'pre',\n        preserveWhitespace: 'full'\n      }],\n      toDOM: () => ['pre', ['code', 0]]\n    };\n  }\n\n  commands({\n    type,\n    schema\n  }) {\n    return () => toggleBlockType(type, schema.nodes.paragraph);\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Shift-Ctrl-\\\\': setBlockType(type)\n    };\n  }\n\n  inputRules({\n    type\n  }) {\n    return [textblockTypeInputRule(/^```$/, type)];\n  }\n\n  get plugins() {\n    return [HighlightPlugin({\n      name: this.name\n    })];\n  }\n\n}\n\nclass HardBreak extends Node {\n  get name() {\n    return 'hard_break';\n  }\n\n  get schema() {\n    return {\n      inline: true,\n      group: 'inline',\n      selectable: false,\n      parseDOM: [{\n        tag: 'br'\n      }],\n      toDOM: () => ['br']\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => chainCommands(exitCode, (state, dispatch) => {\n      dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());\n      return true;\n    });\n  }\n\n  keys({\n    type\n  }) {\n    const command = chainCommands(exitCode, (state, dispatch) => {\n      dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());\n      return true;\n    });\n    return {\n      'Mod-Enter': command,\n      'Shift-Enter': command\n    };\n  }\n\n}\n\nclass Heading extends Node {\n  get name() {\n    return 'heading';\n  }\n\n  get defaultOptions() {\n    return {\n      levels: [1, 2, 3, 4, 5, 6]\n    };\n  }\n\n  get schema() {\n    return {\n      attrs: {\n        level: {\n          default: 1\n        }\n      },\n      content: 'inline*',\n      group: 'block',\n      defining: true,\n      draggable: false,\n      parseDOM: this.options.levels.map(level => ({\n        tag: \"h\".concat(level),\n        attrs: {\n          level\n        }\n      })),\n      toDOM: node => [\"h\".concat(node.attrs.level), 0]\n    };\n  }\n\n  commands({\n    type,\n    schema\n  }) {\n    return attrs => toggleBlockType(type, schema.nodes.paragraph, attrs);\n  }\n\n  keys({\n    type\n  }) {\n    return this.options.levels.reduce((items, level) => ({ ...items,\n      ...{\n        [\"Shift-Ctrl-\".concat(level)]: setBlockType(type, {\n          level\n        })\n      }\n    }), {});\n  }\n\n  inputRules({\n    type\n  }) {\n    return this.options.levels.map(level => textblockTypeInputRule(new RegExp(\"^(#{1,\".concat(level, \"})\\\\s$\")), type, () => ({\n      level\n    })));\n  }\n\n}\n\nclass HorizontalRule extends Node {\n  get name() {\n    return 'horizontal_rule';\n  }\n\n  get schema() {\n    return {\n      group: 'block',\n      parseDOM: [{\n        tag: 'hr'\n      }],\n      toDOM: () => ['hr']\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => (state, dispatch) => dispatch(state.tr.replaceSelectionWith(type.create()));\n  }\n\n  inputRules({\n    type\n  }) {\n    return [nodeInputRule(/^(?:---|___\\s|\\*\\*\\*\\s)$/, type)];\n  }\n\n}\n\n/**\n * Matches following attributes in Markdown-typed image: [, alt, src, title]\n *\n * Example:\n * ![Lorem](image.jpg) -> [, \"Lorem\", \"image.jpg\"]\n * ![](image.jpg \"Ipsum\") -> [, \"\", \"image.jpg\", \"Ipsum\"]\n * ![Lorem](image.jpg \"Ipsum\") -> [, \"Lorem\", \"image.jpg\", \"Ipsum\"]\n */\n\nconst IMAGE_INPUT_REGEX = /!\\[(.+|:?)]\\((\\S+)(?:(?:\\s+)[\"'](\\S+)[\"'])?\\)/;\nclass Image extends Node {\n  get name() {\n    return 'image';\n  }\n\n  get schema() {\n    return {\n      inline: true,\n      attrs: {\n        src: {},\n        alt: {\n          default: null\n        },\n        title: {\n          default: null\n        }\n      },\n      group: 'inline',\n      draggable: true,\n      parseDOM: [{\n        tag: 'img[src]',\n        getAttrs: dom => ({\n          src: dom.getAttribute('src'),\n          title: dom.getAttribute('title'),\n          alt: dom.getAttribute('alt')\n        })\n      }],\n      toDOM: node => ['img', node.attrs]\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return attrs => (state, dispatch) => {\n      const {\n        selection\n      } = state;\n      const position = selection.$cursor ? selection.$cursor.pos : selection.$to.pos;\n      const node = type.create(attrs);\n      const transaction = state.tr.insert(position, node);\n      dispatch(transaction);\n    };\n  }\n\n  inputRules({\n    type\n  }) {\n    return [nodeInputRule(IMAGE_INPUT_REGEX, type, match => {\n      const [, alt, src, title] = match;\n      return {\n        src,\n        alt,\n        title\n      };\n    })];\n  }\n\n  get plugins() {\n    return [new Plugin({\n      props: {\n        handleDOMEvents: {\n          drop(view, event) {\n            const hasFiles = event.dataTransfer && event.dataTransfer.files && event.dataTransfer.files.length;\n\n            if (!hasFiles) {\n              return;\n            }\n\n            const images = Array.from(event.dataTransfer.files).filter(file => /image/i.test(file.type));\n\n            if (images.length === 0) {\n              return;\n            }\n\n            event.preventDefault();\n            const {\n              schema\n            } = view.state;\n            const coordinates = view.posAtCoords({\n              left: event.clientX,\n              top: event.clientY\n            });\n            images.forEach(image => {\n              const reader = new FileReader();\n\n              reader.onload = readerEvent => {\n                const node = schema.nodes.image.create({\n                  src: readerEvent.target.result\n                });\n                const transaction = view.state.tr.insert(coordinates.pos, node);\n                view.dispatch(transaction);\n              };\n\n              reader.readAsDataURL(image);\n            });\n          }\n\n        }\n      }\n    })];\n  }\n\n}\n\nclass ListItem extends Node {\n  get name() {\n    return 'list_item';\n  }\n\n  get schema() {\n    return {\n      content: 'paragraph block*',\n      defining: true,\n      draggable: false,\n      parseDOM: [{\n        tag: 'li'\n      }],\n      toDOM: () => ['li', 0]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      Enter: splitListItem(type),\n      Tab: sinkListItem(type),\n      'Shift-Tab': liftListItem(type)\n    };\n  }\n\n}\n\nfunction triggerCharacter({\n  char = '@',\n  allowSpaces = false,\n  startOfLine = false\n}) {\n  return $position => {\n    // cancel if top level node\n    if ($position.depth <= 0) {\n      return false;\n    } // Matching expressions used for later\n\n\n    const escapedChar = \"\\\\\".concat(char);\n    const suffix = new RegExp(\"\\\\s\".concat(escapedChar, \"$\"));\n    const prefix = startOfLine ? '^' : '';\n    const regexp = allowSpaces ? new RegExp(\"\".concat(prefix).concat(escapedChar, \".*?(?=\\\\s\").concat(escapedChar, \"|$)\"), 'gm') : new RegExp(\"\".concat(prefix, \"(?:^)?\").concat(escapedChar, \"[^\\\\s\").concat(escapedChar, \"]*\"), 'gm'); // Lookup the boundaries of the current node\n\n    const textFrom = $position.before();\n    const textTo = $position.end();\n    const text = $position.doc.textBetween(textFrom, textTo, '\\0', '\\0');\n    let match = regexp.exec(text);\n    let position;\n\n    while (match !== null) {\n      // JavaScript doesn't have lookbehinds; this hacks a check that first character is \" \"\n      // or the line beginning\n      const matchPrefix = match.input.slice(Math.max(0, match.index - 1), match.index);\n\n      if (/^[\\s\\0]?$/.test(matchPrefix)) {\n        // The absolute position of the match in the document\n        const from = match.index + $position.start();\n        let to = from + match[0].length; // Edge case handling; if spaces are allowed and we're directly in between\n        // two triggers\n\n        if (allowSpaces && suffix.test(text.slice(to - 1, to + 1))) {\n          match[0] += ' ';\n          to += 1;\n        } // If the $position is located within the matched substring, return that range\n\n\n        if (from < $position.pos && to >= $position.pos) {\n          position = {\n            range: {\n              from,\n              to\n            },\n            query: match[0].slice(char.length),\n            text: match[0]\n          };\n        }\n      }\n\n      match = regexp.exec(text);\n    }\n\n    return position;\n  };\n}\n\nfunction SuggestionsPlugin({\n  matcher = {\n    char: '@',\n    allowSpaces: false,\n    startOfLine: false\n  },\n  appendText = null,\n  suggestionClass = 'suggestion',\n  command = () => false,\n  items = [],\n  onEnter = () => false,\n  onChange = () => false,\n  onExit = () => false,\n  onKeyDown = () => false,\n  onFilter = (searchItems, query) => {\n    if (!query) {\n      return searchItems;\n    }\n\n    return searchItems.filter(item => JSON.stringify(item).toLowerCase().includes(query.toLowerCase()));\n  }\n}) {\n  return new Plugin$1({\n    key: new PluginKey$1('suggestions'),\n\n    view() {\n      return {\n        update: async (view, prevState) => {\n          const prev = this.key.getState(prevState);\n          const next = this.key.getState(view.state); // See how the state changed\n\n          const moved = prev.active && next.active && prev.range.from !== next.range.from;\n          const started = !prev.active && next.active;\n          const stopped = prev.active && !next.active;\n          const changed = !started && !stopped && prev.query !== next.query;\n          const handleStart = started || moved;\n          const handleChange = changed && !moved;\n          const handleExit = stopped || moved; // Cancel when suggestion isn't active\n\n          if (!handleStart && !handleChange && !handleExit) {\n            return;\n          }\n\n          const state = handleExit ? prev : next;\n          const decorationNode = document.querySelector(\"[data-decoration-id=\\\"\".concat(state.decorationId, \"\\\"]\")); // build a virtual node for popper.js or tippy.js\n          // this can be used for building popups without a DOM node\n\n          const virtualNode = decorationNode ? {\n            getBoundingClientRect() {\n              return decorationNode.getBoundingClientRect();\n            },\n\n            clientWidth: decorationNode.clientWidth,\n            clientHeight: decorationNode.clientHeight\n          } : null;\n          const props = {\n            view,\n            range: state.range,\n            query: state.query,\n            text: state.text,\n            decorationNode,\n            virtualNode,\n            items: handleChange || handleStart ? await onFilter(Array.isArray(items) ? items : await items(), state.query) : [],\n            command: ({\n              range,\n              attrs\n            }) => {\n              command({\n                range,\n                attrs,\n                schema: view.state.schema\n              })(view.state, view.dispatch, view);\n\n              if (appendText) {\n                insertText(appendText)(view.state, view.dispatch, view);\n              }\n            }\n          }; // Trigger the hooks when necessary\n\n          if (handleExit) {\n            onExit(props);\n          }\n\n          if (handleChange) {\n            onChange(props);\n          }\n\n          if (handleStart) {\n            onEnter(props);\n          }\n        }\n      };\n    },\n\n    state: {\n      // Initialize the plugin's internal state.\n      init() {\n        return {\n          active: false,\n          range: {},\n          query: null,\n          text: null\n        };\n      },\n\n      // Apply changes to the plugin state from a view transaction.\n      apply(tr, prev) {\n        const {\n          selection\n        } = tr;\n        const next = { ...prev\n        }; // We can only be suggesting if there is no selection\n\n        if (selection.from === selection.to) {\n          // Reset active state if we just left the previous suggestion range\n          if (selection.from < prev.range.from || selection.from > prev.range.to) {\n            next.active = false;\n          } // Try to match against where our cursor currently is\n\n\n          const $position = selection.$from;\n          const match = triggerCharacter(matcher)($position);\n          const decorationId = (Math.random() + 1).toString(36).substr(2, 5); // If we found a match, update the current state to show it\n\n          if (match) {\n            next.active = true;\n            next.decorationId = prev.decorationId ? prev.decorationId : decorationId;\n            next.range = match.range;\n            next.query = match.query;\n            next.text = match.text;\n          } else {\n            next.active = false;\n          }\n        } else {\n          next.active = false;\n        } // Make sure to empty the range if suggestion is inactive\n\n\n        if (!next.active) {\n          next.decorationId = null;\n          next.range = {};\n          next.query = null;\n          next.text = null;\n        }\n\n        return next;\n      }\n\n    },\n    props: {\n      // Call the keydown hook if suggestion is active.\n      handleKeyDown(view, event) {\n        const {\n          active,\n          range\n        } = this.getState(view.state);\n        if (!active) return false;\n        return onKeyDown({\n          view,\n          event,\n          range\n        });\n      },\n\n      // Setup decorator on the currently active suggestion.\n      decorations(editorState) {\n        const {\n          active,\n          range,\n          decorationId\n        } = this.getState(editorState);\n        if (!active) return null;\n        return DecorationSet.create(editorState.doc, [Decoration.inline(range.from, range.to, {\n          nodeName: 'span',\n          class: suggestionClass,\n          'data-decoration-id': decorationId\n        })]);\n      }\n\n    }\n  });\n}\n\nclass Mention extends Node {\n  get name() {\n    return 'mention';\n  }\n\n  get defaultOptions() {\n    return {\n      matcher: {\n        char: '@',\n        allowSpaces: false,\n        startOfLine: false\n      },\n      mentionClass: 'mention',\n      suggestionClass: 'mention-suggestion'\n    };\n  }\n\n  getLabel(dom) {\n    return dom.innerText.split(this.options.matcher.char).join('');\n  }\n\n  get schema() {\n    return {\n      attrs: {\n        id: {},\n        label: {}\n      },\n      group: 'inline',\n      inline: true,\n      content: 'inline*',\n      selectable: false,\n      atom: true,\n      toDOM: node => ['span', {\n        class: this.options.mentionClass,\n        'data-mention-id': node.attrs.id\n      }, \"\".concat(this.options.matcher.char).concat(node.attrs.label)],\n      parseDOM: [{\n        tag: 'span[data-mention-id]',\n        getAttrs: dom => {\n          const id = dom.getAttribute('data-mention-id');\n          const label = this.getLabel(dom);\n          return {\n            id,\n            label\n          };\n        },\n        getContent: (dom, schema) => {\n          const label = this.getLabel(dom);\n          return Fragment.fromJSON(schema, [{\n            type: 'text',\n            text: \"\".concat(this.options.matcher.char).concat(label)\n          }]);\n        }\n      }]\n    };\n  }\n\n  commands({\n    schema\n  }) {\n    return attrs => replaceText(null, schema.nodes[this.name], attrs);\n  }\n\n  get plugins() {\n    return [SuggestionsPlugin({\n      command: ({\n        range,\n        attrs,\n        schema\n      }) => replaceText(range, schema.nodes[this.name], attrs),\n      appendText: ' ',\n      matcher: this.options.matcher,\n      items: this.options.items,\n      onEnter: this.options.onEnter,\n      onChange: this.options.onChange,\n      onExit: this.options.onExit,\n      onKeyDown: this.options.onKeyDown,\n      onFilter: this.options.onFilter,\n      suggestionClass: this.options.suggestionClass\n    })];\n  }\n\n}\n\nclass OrderedList extends Node {\n  get name() {\n    return 'ordered_list';\n  }\n\n  get schema() {\n    return {\n      attrs: {\n        order: {\n          default: 1\n        }\n      },\n      content: 'list_item+',\n      group: 'block',\n      parseDOM: [{\n        tag: 'ol',\n        getAttrs: dom => ({\n          order: dom.hasAttribute('start') ? +dom.getAttribute('start') : 1\n        })\n      }],\n      toDOM: node => node.attrs.order === 1 ? ['ol', 0] : ['ol', {\n        start: node.attrs.order\n      }, 0]\n    };\n  }\n\n  commands({\n    type,\n    schema\n  }) {\n    return () => toggleList(type, schema.nodes.list_item);\n  }\n\n  keys({\n    type,\n    schema\n  }) {\n    return {\n      'Shift-Ctrl-9': toggleList(type, schema.nodes.list_item)\n    };\n  }\n\n  inputRules({\n    type\n  }) {\n    return [wrappingInputRule(/^(\\d+)\\.\\s$/, type, match => ({\n      order: +match[1]\n    }), (match, node) => node.childCount + node.attrs.order === +match[1])];\n  }\n\n}\n\nvar TableNodes = tableNodes({\n  tableGroup: 'block',\n  cellContent: 'block+',\n  cellAttributes: {\n    background: {\n      default: null,\n\n      getFromDOM(dom) {\n        return dom.style.backgroundColor || null;\n      },\n\n      setDOMAttr(value, attrs) {\n        if (value) {\n          const style = {\n            style: \"\".concat(attrs.style || '', \"background-color: \").concat(value, \";\")\n          };\n          Object.assign(attrs, style);\n        }\n      }\n\n    }\n  }\n});\n\nclass Table extends Node {\n  get name() {\n    return 'table';\n  }\n\n  get defaultOptions() {\n    return {\n      resizable: false\n    };\n  }\n\n  get schema() {\n    return TableNodes.table;\n  }\n\n  commands({\n    schema\n  }) {\n    return {\n      createTable: ({\n        rowsCount,\n        colsCount,\n        withHeaderRow\n      }) => (state, dispatch) => {\n        const offset = state.tr.selection.anchor + 1;\n        const nodes = createTable(schema, rowsCount, colsCount, withHeaderRow);\n        const tr = state.tr.replaceSelectionWith(nodes).scrollIntoView();\n        const resolvedPos = tr.doc.resolve(offset);\n        tr.setSelection(TextSelection.near(resolvedPos));\n        dispatch(tr);\n      },\n      addColumnBefore: () => addColumnBefore,\n      addColumnAfter: () => addColumnAfter,\n      deleteColumn: () => deleteColumn,\n      addRowBefore: () => addRowBefore,\n      addRowAfter: () => addRowAfter,\n      deleteRow: () => deleteRow,\n      deleteTable: () => deleteTable,\n      toggleCellMerge: () => (state, dispatch) => {\n        if (mergeCells(state, dispatch)) {\n          return;\n        }\n\n        splitCell(state, dispatch);\n      },\n      mergeCells: () => mergeCells,\n      splitCell: () => splitCell,\n      toggleHeaderColumn: () => toggleHeaderColumn,\n      toggleHeaderRow: () => toggleHeaderRow,\n      toggleHeaderCell: () => toggleHeaderCell,\n      setCellAttr: () => setCellAttr,\n      fixTables: () => fixTables\n    };\n  }\n\n  keys() {\n    return {\n      Tab: goToNextCell(1),\n      'Shift-Tab': goToNextCell(-1)\n    };\n  }\n\n  get plugins() {\n    return [...(this.options.resizable ? [columnResizing()] : []), tableEditing()];\n  }\n\n}\n\nclass TableHeader extends Node {\n  get name() {\n    return 'table_header';\n  }\n\n  get schema() {\n    return TableNodes.table_header;\n  }\n\n}\n\nclass TableCell extends Node {\n  get name() {\n    return 'table_cell';\n  }\n\n  get schema() {\n    return TableNodes.table_cell;\n  }\n\n}\n\nclass TableRow extends Node {\n  get name() {\n    return 'table_row';\n  }\n\n  get schema() {\n    return TableNodes.table_row;\n  }\n\n}\n\nclass TodoItem extends Node {\n  get name() {\n    return 'todo_item';\n  }\n\n  get defaultOptions() {\n    return {\n      nested: false\n    };\n  }\n\n  get view() {\n    return {\n      props: ['node', 'updateAttrs', 'view'],\n      methods: {\n        onChange() {\n          this.updateAttrs({\n            done: !this.node.attrs.done\n          });\n        }\n\n      },\n      template: \"\\n        <li :data-type=\\\"node.type.name\\\" :data-done=\\\"node.attrs.done.toString()\\\" data-drag-handle>\\n          <span class=\\\"todo-checkbox\\\" contenteditable=\\\"false\\\" @click=\\\"onChange\\\"></span>\\n          <div class=\\\"todo-content\\\" ref=\\\"content\\\" :contenteditable=\\\"view.editable.toString()\\\"></div>\\n        </li>\\n      \"\n    };\n  }\n\n  get schema() {\n    return {\n      attrs: {\n        done: {\n          default: false\n        }\n      },\n      draggable: true,\n      content: this.options.nested ? '(paragraph|todo_list)+' : 'paragraph+',\n      toDOM: node => {\n        const {\n          done\n        } = node.attrs;\n        return ['li', {\n          'data-type': this.name,\n          'data-done': done.toString()\n        }, ['span', {\n          class: 'todo-checkbox',\n          contenteditable: 'false'\n        }], ['div', {\n          class: 'todo-content'\n        }, 0]];\n      },\n      parseDOM: [{\n        priority: 51,\n        tag: \"[data-type=\\\"\".concat(this.name, \"\\\"]\"),\n        getAttrs: dom => ({\n          done: dom.getAttribute('data-done') === 'true'\n        })\n      }]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      Enter: splitToDefaultListItem(type),\n      Tab: this.options.nested ? sinkListItem(type) : () => {},\n      'Shift-Tab': liftListItem(type)\n    };\n  }\n\n}\n\nclass TodoList extends Node {\n  get name() {\n    return 'todo_list';\n  }\n\n  get schema() {\n    return {\n      group: 'block',\n      content: 'todo_item+',\n      toDOM: () => ['ul', {\n        'data-type': this.name\n      }, 0],\n      parseDOM: [{\n        priority: 51,\n        tag: \"[data-type=\\\"\".concat(this.name, \"\\\"]\")\n      }]\n    };\n  }\n\n  commands({\n    type,\n    schema\n  }) {\n    return () => toggleList(type, schema.nodes.todo_item);\n  }\n\n  inputRules({\n    type\n  }) {\n    return [wrappingInputRule(/^\\s*(\\[ \\])\\s$/, type)];\n  }\n\n}\n\nclass Bold extends Mark {\n  get name() {\n    return 'bold';\n  }\n\n  get schema() {\n    return {\n      parseDOM: [{\n        tag: 'strong'\n      }, {\n        tag: 'b',\n        getAttrs: node => node.style.fontWeight !== 'normal' && null\n      }, {\n        style: 'font-weight',\n        getAttrs: value => /^(bold(er)?|[5-9]\\d{2,})$/.test(value) && null\n      }],\n      toDOM: () => ['strong', 0]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Mod-b': toggleMark(type)\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => toggleMark(type);\n  }\n\n  inputRules({\n    type\n  }) {\n    return [markInputRule(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)$/, type)];\n  }\n\n  pasteRules({\n    type\n  }) {\n    return [markPasteRule(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)/g, type)];\n  }\n\n}\n\nclass Code extends Mark {\n  get name() {\n    return 'code';\n  }\n\n  get schema() {\n    return {\n      excludes: '_',\n      parseDOM: [{\n        tag: 'code'\n      }],\n      toDOM: () => ['code', 0]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Mod-`': toggleMark(type)\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => toggleMark(type);\n  }\n\n  inputRules({\n    type\n  }) {\n    return [markInputRule(/(?:`)([^`]+)(?:`)$/, type)];\n  }\n\n  pasteRules({\n    type\n  }) {\n    return [markPasteRule(/(?:`)([^`]+)(?:`)/g, type)];\n  }\n\n}\n\nclass Italic extends Mark {\n  get name() {\n    return 'italic';\n  }\n\n  get schema() {\n    return {\n      parseDOM: [{\n        tag: 'i'\n      }, {\n        tag: 'em'\n      }, {\n        style: 'font-style=italic'\n      }],\n      toDOM: () => ['em', 0]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Mod-i': toggleMark(type)\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => toggleMark(type);\n  }\n\n  inputRules({\n    type\n  }) {\n    return [markInputRule(/(?:^|[^_])(_([^_]+)_)$/, type), markInputRule(/(?:^|[^*])(\\*([^*]+)\\*)$/, type)];\n  }\n\n  pasteRules({\n    type\n  }) {\n    return [markPasteRule(/_([^_]+)_/g, type), markPasteRule(/\\*([^*]+)\\*/g, type)];\n  }\n\n}\n\nclass Link extends Mark {\n  get name() {\n    return 'link';\n  }\n\n  get defaultOptions() {\n    return {\n      openOnClick: true,\n      target: null\n    };\n  }\n\n  get schema() {\n    return {\n      attrs: {\n        href: {\n          default: null\n        },\n        target: {\n          default: null\n        }\n      },\n      inclusive: false,\n      parseDOM: [{\n        tag: 'a[href]',\n        getAttrs: dom => ({\n          href: dom.getAttribute('href'),\n          target: dom.getAttribute('target')\n        })\n      }],\n      toDOM: node => ['a', { ...node.attrs,\n        rel: 'noopener noreferrer nofollow',\n        target: this.options.target\n      }, 0]\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return attrs => {\n      if (attrs.href) {\n        return updateMark(type, attrs);\n      }\n\n      return removeMark(type);\n    };\n  }\n\n  pasteRules({\n    type\n  }) {\n    return [pasteRule(/https?:\\/\\/(www\\.)?[-a-zA-Z0-9@:%._+~#=]{1,256}\\.[a-zA-Z]{2,}\\b([-a-zA-Z0-9@:%_+.~#?&//=,]*)/gi, type, url => ({\n      href: url\n    }))];\n  }\n\n  get plugins() {\n    if (!this.options.openOnClick) {\n      return [];\n    }\n\n    return [new Plugin({\n      props: {\n        handleClick: (view, pos, event) => {\n          const {\n            schema\n          } = view.state;\n          const attrs = getMarkAttrs(view.state, schema.marks.link);\n\n          if (attrs.href && event.target instanceof HTMLAnchorElement) {\n            event.stopPropagation();\n            window.open(attrs.href, attrs.target);\n          }\n        }\n      }\n    })];\n  }\n\n}\n\nclass Strike extends Mark {\n  get name() {\n    return 'strike';\n  }\n\n  get schema() {\n    return {\n      parseDOM: [{\n        tag: 's'\n      }, {\n        tag: 'del'\n      }, {\n        tag: 'strike'\n      }, {\n        style: 'text-decoration',\n        getAttrs: value => value === 'line-through'\n      }],\n      toDOM: () => ['s', 0]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Mod-d': toggleMark(type)\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => toggleMark(type);\n  }\n\n  inputRules({\n    type\n  }) {\n    return [markInputRule(/~([^~]+)~$/, type)];\n  }\n\n  pasteRules({\n    type\n  }) {\n    return [markPasteRule(/~([^~]+)~/g, type)];\n  }\n\n}\n\nclass Underline extends Mark {\n  get name() {\n    return 'underline';\n  }\n\n  get schema() {\n    return {\n      parseDOM: [{\n        tag: 'u'\n      }, {\n        style: 'text-decoration',\n        getAttrs: value => value === 'underline'\n      }],\n      toDOM: () => ['u', 0]\n    };\n  }\n\n  keys({\n    type\n  }) {\n    return {\n      'Mod-u': toggleMark(type)\n    };\n  }\n\n  commands({\n    type\n  }) {\n    return () => toggleMark(type);\n  }\n\n}\n\nclass Collaboration extends Extension {\n  get name() {\n    return 'collaboration';\n  }\n\n  init() {\n    this.getSendableSteps = this.debounce(state => {\n      const sendable = sendableSteps(state);\n\n      if (sendable) {\n        this.options.onSendable({\n          editor: this.editor,\n          sendable: {\n            version: sendable.version,\n            steps: sendable.steps.map(step => step.toJSON()),\n            clientID: sendable.clientID\n          }\n        });\n      }\n    }, this.options.debounce);\n    this.editor.on('transaction', ({\n      state\n    }) => {\n      this.getSendableSteps(state);\n    });\n  }\n\n  get defaultOptions() {\n    return {\n      version: 0,\n      clientID: Math.floor(Math.random() * 0xFFFFFFFF),\n      debounce: 250,\n      onSendable: () => {},\n      update: ({\n        steps,\n        version\n      }) => {\n        const {\n          state,\n          view,\n          schema\n        } = this.editor;\n\n        if (getVersion(state) > version) {\n          return;\n        }\n\n        view.dispatch(receiveTransaction(state, steps.map(item => Step.fromJSON(schema, item.step)), steps.map(item => item.clientID)));\n      }\n    };\n  }\n\n  get plugins() {\n    return [collab({\n      version: this.options.version,\n      clientID: this.options.clientID\n    })];\n  }\n\n  debounce(fn, delay) {\n    let timeout;\n    return function (...args) {\n      if (timeout) {\n        clearTimeout(timeout);\n      }\n\n      timeout = setTimeout(() => {\n        fn(...args);\n        timeout = null;\n      }, delay);\n    };\n  }\n\n}\n\nclass Focus extends Extension {\n  get name() {\n    return 'focus';\n  }\n\n  get defaultOptions() {\n    return {\n      className: 'has-focus',\n      nested: false\n    };\n  }\n\n  get plugins() {\n    return [new Plugin({\n      props: {\n        decorations: ({\n          doc,\n          plugins,\n          selection\n        }) => {\n          const editablePlugin = plugins.find(plugin => plugin.key.startsWith('editable$'));\n          const editable = editablePlugin.props.editable();\n          const active = editable && this.options.className;\n          const {\n            focused\n          } = this.editor;\n          const {\n            anchor\n          } = selection;\n          const decorations = [];\n\n          if (!active || !focused) {\n            return false;\n          }\n\n          doc.descendants((node, pos) => {\n            const hasAnchor = anchor >= pos && anchor <= pos + node.nodeSize;\n\n            if (hasAnchor && !node.isText) {\n              const decoration = Decoration.node(pos, pos + node.nodeSize, {\n                class: this.options.className\n              });\n              decorations.push(decoration);\n            }\n\n            return this.options.nested;\n          });\n          return DecorationSet.create(doc, decorations);\n        }\n      }\n    })];\n  }\n\n}\n\nclass History extends Extension {\n  get name() {\n    return 'history';\n  }\n\n  get defaultOptions() {\n    return {\n      depth: '',\n      newGroupDelay: ''\n    };\n  }\n\n  keys() {\n    const keymap = {\n      'Mod-z': undo,\n      'Mod-y': redo,\n      'Shift-Mod-z': redo,\n      // Russian language\n      'Mod-я': undo,\n      'Shift-Mod-я': redo\n    };\n    return keymap;\n  }\n\n  get plugins() {\n    return [history({\n      depth: this.options.depth,\n      newGroupDelay: this.options.newGroupDelay\n    })];\n  }\n\n  commands() {\n    return {\n      undo: () => undo,\n      redo: () => redo,\n      undoDepth: () => undoDepth,\n      redoDepth: () => redoDepth\n    };\n  }\n\n}\n\nclass Placeholder extends Extension {\n  get name() {\n    return 'placeholder';\n  }\n\n  get defaultOptions() {\n    return {\n      emptyEditorClass: 'is-editor-empty',\n      emptyNodeClass: 'is-empty',\n      emptyNodeText: 'Write something …',\n      showOnlyWhenEditable: true,\n      showOnlyCurrent: true\n    };\n  }\n\n  get plugins() {\n    return [new Plugin({\n      props: {\n        decorations: ({\n          doc,\n          plugins,\n          selection\n        }) => {\n          const editablePlugin = plugins.find(plugin => plugin.key.startsWith('editable$'));\n          const editable = editablePlugin.props.editable();\n          const active = editable || !this.options.showOnlyWhenEditable;\n          const {\n            anchor\n          } = selection;\n          const decorations = [];\n          const isEditorEmpty = doc.textContent.length === 0;\n\n          if (!active) {\n            return false;\n          }\n\n          doc.descendants((node, pos) => {\n            const hasAnchor = anchor >= pos && anchor <= pos + node.nodeSize;\n            const isNodeEmpty = node.content.size === 0;\n\n            if ((hasAnchor || !this.options.showOnlyCurrent) && isNodeEmpty) {\n              const classes = [this.options.emptyNodeClass];\n\n              if (isEditorEmpty) {\n                classes.push(this.options.emptyEditorClass);\n              }\n\n              const decoration = Decoration.node(pos, pos + node.nodeSize, {\n                class: classes.join(' '),\n                'data-empty-text': typeof this.options.emptyNodeText === 'function' ? this.options.emptyNodeText(node) : this.options.emptyNodeText\n              });\n              decorations.push(decoration);\n            }\n\n            return false;\n          });\n          return DecorationSet.create(doc, decorations);\n        }\n      }\n    })];\n  }\n\n}\n\nclass Search extends Extension {\n  constructor(options = {}) {\n    super(options);\n    this.results = [];\n    this.searchTerm = null;\n    this._updating = false;\n  }\n\n  get name() {\n    return 'search';\n  }\n\n  get defaultOptions() {\n    return {\n      autoSelectNext: true,\n      findClass: 'find',\n      searching: false,\n      caseSensitive: false,\n      disableRegex: true,\n      alwaysSearch: false\n    };\n  }\n\n  commands() {\n    return {\n      find: attrs => this.find(attrs),\n      replace: attrs => this.replace(attrs),\n      replaceAll: attrs => this.replaceAll(attrs),\n      clearSearch: () => this.clear()\n    };\n  }\n\n  get findRegExp() {\n    return RegExp(this.searchTerm, !this.options.caseSensitive ? 'gui' : 'gu');\n  }\n\n  get decorations() {\n    return this.results.map(deco => Decoration.inline(deco.from, deco.to, {\n      class: this.options.findClass\n    }));\n  }\n\n  _search(doc) {\n    this.results = [];\n    const mergedTextNodes = [];\n    let index = 0;\n\n    if (!this.searchTerm) {\n      return;\n    }\n\n    doc.descendants((node, pos) => {\n      if (node.isText) {\n        if (mergedTextNodes[index]) {\n          mergedTextNodes[index] = {\n            text: mergedTextNodes[index].text + node.text,\n            pos: mergedTextNodes[index].pos\n          };\n        } else {\n          mergedTextNodes[index] = {\n            text: node.text,\n            pos\n          };\n        }\n      } else {\n        index += 1;\n      }\n    });\n    mergedTextNodes.forEach(({\n      text,\n      pos\n    }) => {\n      const search = this.findRegExp;\n      let m; // eslint-disable-next-line no-cond-assign\n\n      while (m = search.exec(text)) {\n        if (m[0] === '') {\n          break;\n        }\n\n        this.results.push({\n          from: pos + m.index,\n          to: pos + m.index + m[0].length\n        });\n      }\n    });\n  }\n\n  replace(replace) {\n    return (state, dispatch) => {\n      const firstResult = this.results[0];\n\n      if (!firstResult) {\n        return;\n      }\n\n      const {\n        from,\n        to\n      } = this.results[0];\n      dispatch(state.tr.insertText(replace, from, to));\n      this.editor.commands.find(this.searchTerm);\n    };\n  }\n\n  rebaseNextResult(replace, index, lastOffset = 0) {\n    const nextIndex = index + 1;\n\n    if (!this.results[nextIndex]) {\n      return null;\n    }\n\n    const {\n      from: currentFrom,\n      to: currentTo\n    } = this.results[index];\n    const offset = currentTo - currentFrom - replace.length + lastOffset;\n    const {\n      from,\n      to\n    } = this.results[nextIndex];\n    this.results[nextIndex] = {\n      to: to - offset,\n      from: from - offset\n    };\n    return offset;\n  }\n\n  replaceAll(replace) {\n    return ({\n      tr\n    }, dispatch) => {\n      let offset;\n\n      if (!this.results.length) {\n        return;\n      }\n\n      this.results.forEach(({\n        from,\n        to\n      }, index) => {\n        tr.insertText(replace, from, to);\n        offset = this.rebaseNextResult(replace, index, offset);\n      });\n      dispatch(tr);\n      this.editor.commands.find(this.searchTerm);\n    };\n  }\n\n  find(searchTerm) {\n    return (state, dispatch) => {\n      this.searchTerm = this.options.disableRegex ? searchTerm.replace(/[-/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&') : searchTerm;\n      this.updateView(state, dispatch);\n    };\n  }\n\n  clear() {\n    return (state, dispatch) => {\n      this.searchTerm = null;\n      this.updateView(state, dispatch);\n    };\n  }\n\n  updateView({\n    tr\n  }, dispatch) {\n    this._updating = true;\n    dispatch(tr);\n    this._updating = false;\n  }\n\n  createDeco(doc) {\n    this._search(doc);\n\n    return this.decorations ? DecorationSet.create(doc, this.decorations) : [];\n  }\n\n  get plugins() {\n    return [new Plugin({\n      state: {\n        init() {\n          return DecorationSet.empty;\n        },\n\n        apply: (tr, old) => {\n          if (this._updating || this.options.searching || tr.docChanged && this.options.alwaysSearch) {\n            return this.createDeco(tr.doc);\n          }\n\n          if (tr.docChanged) {\n            return old.map(tr.mapping, tr.doc);\n          }\n\n          return old;\n        }\n      },\n      props: {\n        decorations(state) {\n          return this.getState(state);\n        }\n\n      }\n    })];\n  }\n\n}\n\nclass TrailingNode extends Extension {\n  get name() {\n    return 'trailing_node';\n  }\n\n  get defaultOptions() {\n    return {\n      node: 'paragraph',\n      notAfter: ['paragraph']\n    };\n  }\n\n  get plugins() {\n    const plugin = new PluginKey(this.name);\n    const disabledNodes = Object.entries(this.editor.schema.nodes).map(([, value]) => value).filter(node => this.options.notAfter.includes(node.name));\n    return [new Plugin({\n      key: plugin,\n      view: () => ({\n        update: view => {\n          const {\n            state\n          } = view;\n          const insertNodeAtEnd = plugin.getState(state);\n\n          if (!insertNodeAtEnd) {\n            return;\n          }\n\n          const {\n            doc,\n            schema,\n            tr\n          } = state;\n          const type = schema.nodes[this.options.node];\n          const transaction = tr.insert(doc.content.size, type.create());\n          view.dispatch(transaction);\n        }\n      }),\n      state: {\n        init: (_, state) => {\n          const lastNode = state.tr.doc.lastChild;\n          return !nodeEqualsType({\n            node: lastNode,\n            types: disabledNodes\n          });\n        },\n        apply: (tr, value) => {\n          if (!tr.docChanged) {\n            return value;\n          }\n\n          const lastNode = tr.doc.lastChild;\n          return !nodeEqualsType({\n            node: lastNode,\n            types: disabledNodes\n          });\n        }\n      }\n    })];\n  }\n\n}\n\nexport { Blockquote, Bold, BulletList, Code, CodeBlock, CodeBlockHighlight, Collaboration, Focus, HardBreak, Heading, HighlightPlugin as Highlight, History, HorizontalRule, Image, Italic, Link, ListItem, Mention, OrderedList, Placeholder, Search, Strike, SuggestionsPlugin as Suggestions, Table, TableCell, TableHeader, TableRow, TodoItem, TodoList, TrailingNode, Underline };\n","const result = {}\nexport default result\n\nif (typeof navigator != \"undefined\" && typeof document != \"undefined\") {\n  const ie_edge = /Edge\\/(\\d+)/.exec(navigator.userAgent)\n  const ie_upto10 = /MSIE \\d/.test(navigator.userAgent)\n  const ie_11up = /Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(navigator.userAgent)\n\n  result.mac = /Mac/.test(navigator.platform)\n  let ie = result.ie = !!(ie_upto10 || ie_11up || ie_edge)\n  result.ie_version = ie_upto10 ? document.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : null\n  result.gecko = !ie && /gecko\\/(\\d+)/i.test(navigator.userAgent)\n  result.gecko_version = result.gecko && +(/Firefox\\/(\\d+)/.exec(navigator.userAgent) || [0, 0])[1]\n  let chrome = !ie && /Chrome\\/(\\d+)/.exec(navigator.userAgent)\n  result.chrome = !!chrome\n  result.chrome_version = chrome && +chrome[1]\n  result.ios = !ie && /AppleWebKit/.test(navigator.userAgent) && /Mobile\\/\\w+/.test(navigator.userAgent)\n  result.android = /Android \\d/.test(navigator.userAgent)\n  result.webkit = \"webkitFontSmoothing\" in document.documentElement.style\n  result.safari = /Apple Computer/.test(navigator.vendor)\n  result.webkit_version = result.webkit && +(/\\bAppleWebKit\\/(\\d+)/.exec(navigator.userAgent) || [0, 0])[1]\n}\n","import browser from \"./browser\"\n\nexport const domIndex = function(node) {\n  for (var index = 0;; index++) {\n    node = node.previousSibling\n    if (!node) return index\n  }\n}\n\nexport const parentNode = function(node) {\n  let parent = node.parentNode\n  return parent && parent.nodeType == 11 ? parent.host : parent\n}\n\nlet reusedRange = null\n\n// Note that this will always return the same range, because DOM range\n// objects are every expensive, and keep slowing down subsequent DOM\n// updates, for some reason.\nexport const textRange = function(node, from, to) {\n  let range = reusedRange || (reusedRange = document.createRange())\n  range.setEnd(node, to == null ? node.nodeValue.length : to)\n  range.setStart(node, from || 0)\n  return range\n}\n\n// Scans forward and backward through DOM positions equivalent to the\n// given one to see if the two are in the same place (i.e. after a\n// text node vs at the end of that text node)\nexport const isEquivalentPosition = function(node, off, targetNode, targetOff) {\n  return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||\n                        scanFor(node, off, targetNode, targetOff, 1))\n}\n\nconst atomElements = /^(img|br|input|textarea|hr)$/i\n\nfunction scanFor(node, off, targetNode, targetOff, dir) {\n  for (;;) {\n    if (node == targetNode && off == targetOff) return true\n    if (off == (dir < 0 ? 0 : nodeSize(node))) {\n      let parent = node.parentNode\n      if (parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName) || node.contentEditable == \"false\")\n        return false\n      off = domIndex(node) + (dir < 0 ? 0 : 1)\n      node = parent\n    } else if (node.nodeType == 1) {\n      node = node.childNodes[off + (dir < 0 ? -1 : 0)]\n      if (node.contentEditable == \"false\") return false\n      off = dir < 0 ? nodeSize(node) : 0\n    } else {\n      return false\n    }\n  }\n}\n\nexport function nodeSize(node) {\n  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length\n}\n\nexport function isOnEdge(node, offset, parent) {\n  for (let atStart = offset == 0, atEnd = offset == nodeSize(node); atStart || atEnd;) {\n    if (node == parent) return true\n    let index = domIndex(node)\n    node = node.parentNode\n    if (!node) return false\n    atStart = atStart && index == 0\n    atEnd = atEnd && index == nodeSize(node)\n  }\n}\n\nfunction hasBlockDesc(dom) {\n  let desc\n  for (let cur = dom; cur; cur = cur.parentNode) if (desc = cur.pmViewDesc) break\n  return desc && desc.node && desc.node.isBlock && (desc.dom == dom || desc.contentDOM == dom)\n}\n\n// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523\n// (isCollapsed inappropriately returns true in shadow dom)\nexport const selectionCollapsed = function(domSel) {\n  let collapsed = domSel.isCollapsed\n  if (collapsed && browser.chrome && domSel.rangeCount && !domSel.getRangeAt(0).collapsed)\n    collapsed = false\n  return collapsed\n}\n\nexport function keyEvent(keyCode, key) {\n  let event = document.createEvent(\"Event\")\n  event.initEvent(\"keydown\", true, true)\n  event.keyCode = keyCode\n  event.key = event.code = key\n  return event\n}\n","import {nodeSize, textRange, parentNode, domIndex} from \"./dom\"\nimport browser from \"./browser\"\n\nfunction windowRect(doc) {\n  return {left: 0, right: doc.documentElement.clientWidth,\n          top: 0, bottom: doc.documentElement.clientHeight}\n}\n\nfunction getSide(value, side) {\n  return typeof value == \"number\" ? value : value[side]\n}\n\nfunction clientRect(node) {\n  let rect = node.getBoundingClientRect()\n  // Make sure scrollbar width isn't included in the rectangle\n  return {left: rect.left, right: rect.left + node.clientWidth,\n          top: rect.top, bottom: rect.top + node.clientHeight}\n}\n\nexport function scrollRectIntoView(view, rect, startDOM) {\n  let scrollThreshold = view.someProp(\"scrollThreshold\") || 0, scrollMargin = view.someProp(\"scrollMargin\") || 5\n  let doc = view.dom.ownerDocument\n  for (let parent = startDOM || view.dom;; parent = parentNode(parent)) {\n    if (!parent) break\n    if (parent.nodeType != 1) continue\n    let atTop = parent == doc.body || parent.nodeType != 1\n    let bounding = atTop ? windowRect(doc) : clientRect(parent)\n    let moveX = 0, moveY = 0\n    if (rect.top < bounding.top + getSide(scrollThreshold, \"top\"))\n      moveY = -(bounding.top - rect.top + getSide(scrollMargin, \"top\"))\n    else if (rect.bottom > bounding.bottom - getSide(scrollThreshold, \"bottom\"))\n      moveY = rect.bottom - bounding.bottom + getSide(scrollMargin, \"bottom\")\n    if (rect.left < bounding.left + getSide(scrollThreshold, \"left\"))\n      moveX = -(bounding.left - rect.left + getSide(scrollMargin, \"left\"))\n    else if (rect.right > bounding.right - getSide(scrollThreshold, \"right\"))\n      moveX = rect.right - bounding.right + getSide(scrollMargin, \"right\")\n    if (moveX || moveY) {\n      if (atTop) {\n        doc.defaultView.scrollBy(moveX, moveY)\n      } else {\n        let startX = parent.scrollLeft, startY = parent.scrollTop\n        if (moveY) parent.scrollTop += moveY\n        if (moveX) parent.scrollLeft += moveX\n        let dX = parent.scrollLeft - startX, dY = parent.scrollTop - startY\n        rect = {left: rect.left - dX, top: rect.top - dY, right: rect.right - dX, bottom: rect.bottom - dY}\n      }\n    }\n    if (atTop) break\n  }\n}\n\n// Store the scroll position of the editor's parent nodes, along with\n// the top position of an element near the top of the editor, which\n// will be used to make sure the visible viewport remains stable even\n// when the size of the content above changes.\nexport function storeScrollPos(view) {\n  let rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top)\n  let refDOM, refTop\n  for (let x = (rect.left + rect.right) / 2, y = startY + 1;\n       y < Math.min(innerHeight, rect.bottom); y += 5) {\n    let dom = view.root.elementFromPoint(x, y)\n    if (dom == view.dom || !view.dom.contains(dom)) continue\n    let localRect = dom.getBoundingClientRect()\n    if (localRect.top >= startY - 20) {\n      refDOM = dom\n      refTop = localRect.top\n      break\n    }\n  }\n  return {refDOM, refTop, stack: scrollStack(view.dom)}\n}\n\nfunction scrollStack(dom) {\n  let stack = [], doc = dom.ownerDocument\n  for (; dom; dom = parentNode(dom)) {\n    stack.push({dom, top: dom.scrollTop, left: dom.scrollLeft})\n    if (dom == doc) break\n  }\n  return stack\n}\n\n// Reset the scroll position of the editor's parent nodes to that what\n// it was before, when storeScrollPos was called.\nexport function resetScrollPos({refDOM, refTop, stack}) {\n  let newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0\n  restoreScrollStack(stack, newRefTop == 0 ? 0 : newRefTop - refTop)\n}\n\nfunction restoreScrollStack(stack, dTop) {\n  for (let i = 0; i < stack.length; i++) {\n    let {dom, top, left} = stack[i]\n    if (dom.scrollTop != top + dTop) dom.scrollTop = top + dTop\n    if (dom.scrollLeft != left) dom.scrollLeft = left\n  }\n}\n\nlet preventScrollSupported = null\n// Feature-detects support for .focus({preventScroll: true}), and uses\n// a fallback kludge when not supported.\nexport function focusPreventScroll(dom) {\n  if (dom.setActive) return dom.setActive() // in IE\n  if (preventScrollSupported) return dom.focus(preventScrollSupported)\n\n  let stored = scrollStack(dom)\n  dom.focus(preventScrollSupported == null ? {\n    get preventScroll() {\n      preventScrollSupported = {preventScroll: true}\n      return true\n    }\n  } : undefined)\n  if (!preventScrollSupported) {\n    preventScrollSupported = false\n    restoreScrollStack(stored, 0)\n  }\n}\n\nfunction findOffsetInNode(node, coords) {\n  let closest, dxClosest = 2e8, coordsClosest, offset = 0\n  let rowBot = coords.top, rowTop = coords.top\n  for (let child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {\n    let rects\n    if (child.nodeType == 1) rects = child.getClientRects()\n    else if (child.nodeType == 3) rects = textRange(child).getClientRects()\n    else continue\n\n    for (let i = 0; i < rects.length; i++) {\n      let rect = rects[i]\n      if (rect.top <= rowBot && rect.bottom >= rowTop) {\n        rowBot = Math.max(rect.bottom, rowBot)\n        rowTop = Math.min(rect.top, rowTop)\n        let dx = rect.left > coords.left ? rect.left - coords.left\n            : rect.right < coords.left ? coords.left - rect.right : 0\n        if (dx < dxClosest) {\n          closest = child\n          dxClosest = dx\n          coordsClosest = dx && closest.nodeType == 3 ? {left: rect.right < coords.left ? rect.right : rect.left, top: coords.top} : coords\n          if (child.nodeType == 1 && dx)\n            offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0)\n          continue\n        }\n      }\n      if (!closest && (coords.left >= rect.right && coords.top >= rect.top ||\n                       coords.left >= rect.left && coords.top >= rect.bottom))\n        offset = childIndex + 1\n    }\n  }\n  if (closest && closest.nodeType == 3) return findOffsetInText(closest, coordsClosest)\n  if (!closest || (dxClosest && closest.nodeType == 1)) return {node, offset}\n  return findOffsetInNode(closest, coordsClosest)\n}\n\nfunction findOffsetInText(node, coords) {\n  let len = node.nodeValue.length\n  let range = document.createRange()\n  for (let i = 0; i < len; i++) {\n    range.setEnd(node, i + 1)\n    range.setStart(node, i)\n    let rect = singleRect(range, 1)\n    if (rect.top == rect.bottom) continue\n    if (inRect(coords, rect))\n      return {node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0)}\n  }\n  return {node, offset: 0}\n}\n\nfunction inRect(coords, rect) {\n  return coords.left >= rect.left - 1 && coords.left <= rect.right + 1&&\n    coords.top >= rect.top - 1 && coords.top <= rect.bottom + 1\n}\n\nfunction targetKludge(dom, coords) {\n  let parent = dom.parentNode\n  if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left)\n    return parent\n  return dom\n}\n\nfunction posFromElement(view, elt, coords) {\n  let {node, offset} = findOffsetInNode(elt, coords), bias = -1\n  if (node.nodeType == 1 && !node.firstChild) {\n    let rect = node.getBoundingClientRect()\n    bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1\n  }\n  return view.docView.posFromDOM(node, offset, bias)\n}\n\nfunction posFromCaret(view, node, offset, coords) {\n  // Browser (in caretPosition/RangeFromPoint) will agressively\n  // normalize towards nearby inline nodes. Since we are interested in\n  // positions between block nodes too, we first walk up the hierarchy\n  // of nodes to see if there are block nodes that the coordinates\n  // fall outside of. If so, we take the position before/after that\n  // block. If not, we call `posFromDOM` on the raw node/offset.\n  let outside = -1\n  for (let cur = node;;) {\n    if (cur == view.dom) break\n    let desc = view.docView.nearestDesc(cur, true)\n    if (!desc) return null\n    if (desc.node.isBlock && desc.parent) {\n      let rect = desc.dom.getBoundingClientRect()\n      if (rect.left > coords.left || rect.top > coords.top) outside = desc.posBefore\n      else if (rect.right < coords.left || rect.bottom < coords.top) outside = desc.posAfter\n      else break\n    }\n    cur = desc.dom.parentNode\n  }\n  return outside > -1 ? outside : view.docView.posFromDOM(node, offset)\n}\n\nfunction elementFromPoint(element, coords, box) {\n  let len = element.childNodes.length\n  if (len && box.top < box.bottom) {\n    for (let startI = Math.max(0, Math.min(len - 1, Math.floor(len * (coords.top - box.top) / (box.bottom - box.top)) - 2)), i = startI;;) {\n      let child = element.childNodes[i]\n      if (child.nodeType == 1) {\n        let rects = child.getClientRects()\n        for (let j = 0; j < rects.length; j++) {\n          let rect = rects[j]\n          if (inRect(coords, rect)) return elementFromPoint(child, coords, rect)\n        }\n      }\n      if ((i = (i + 1) % len) == startI) break\n    }\n  }\n  return element\n}\n\n// Given an x,y position on the editor, get the position in the document.\nexport function posAtCoords(view, coords) {\n  let root = view.root, node, offset\n  if (root.caretPositionFromPoint) {\n    try { // Firefox throws for this call in hard-to-predict circumstances (#994)\n      let pos = root.caretPositionFromPoint(coords.left, coords.top)\n      if (pos) ({offsetNode: node, offset} = pos)\n    } catch (_) {}\n  }\n  if (!node && root.caretRangeFromPoint) {\n    let range = root.caretRangeFromPoint(coords.left, coords.top)\n    if (range) ({startContainer: node, startOffset: offset} = range)\n  }\n\n  let elt = root.elementFromPoint(coords.left, coords.top + 1), pos\n  if (!elt || !view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) {\n    let box = view.dom.getBoundingClientRect()\n    if (!inRect(coords, box)) return null\n    elt = elementFromPoint(view.dom, coords, box)\n    if (!elt) return null\n  }\n  // Safari's caretRangeFromPoint returns nonsense when on a draggable element\n  if (browser.safari && elt.draggable) node = offset = null\n  elt = targetKludge(elt, coords)\n  if (node) {\n    if (browser.gecko && node.nodeType == 1) {\n      // Firefox will sometimes return offsets into <input> nodes, which\n      // have no actual children, from caretPositionFromPoint (#953)\n      offset = Math.min(offset, node.childNodes.length)\n      // It'll also move the returned position before image nodes,\n      // even if those are behind it.\n      if (offset < node.childNodes.length) {\n        let next = node.childNodes[offset], box\n        if (next.nodeName == \"IMG\" && (box = next.getBoundingClientRect()).right <= coords.left &&\n            box.bottom > coords.top)\n          offset++\n      }\n    }\n    // Suspiciously specific kludge to work around caret*FromPoint\n    // never returning a position at the end of the document\n    if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 &&\n        coords.top > node.lastChild.getBoundingClientRect().bottom)\n      pos = view.state.doc.content.size\n    // Ignore positions directly after a BR, since caret*FromPoint\n    // 'round up' positions that would be more accurately placed\n    // before the BR node.\n    else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != \"BR\")\n      pos = posFromCaret(view, node, offset, coords)\n  }\n  if (pos == null) pos = posFromElement(view, elt, coords)\n\n  let desc = view.docView.nearestDesc(elt, true)\n  return {pos, inside: desc ? desc.posAtStart - desc.border : -1}\n}\n\nfunction singleRect(object, bias) {\n  let rects = object.getClientRects()\n  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1]\n}\n\nconst BIDI = /[\\u0590-\\u05f4\\u0600-\\u06ff\\u0700-\\u08ac]/\n\n// : (EditorView, number, number) → {left: number, top: number, right: number, bottom: number}\n// Given a position in the document model, get a bounding box of the\n// character at that position, relative to the window.\nexport function coordsAtPos(view, pos, side) {\n  let {node, offset} = view.docView.domFromPos(pos)\n  let $pos = view.state.doc.resolve(pos), inline = $pos.parent.inlineContent\n\n  // These browsers support querying empty text ranges. Prefer that in\n  // bidi context.\n  let supportEmptyRange = browser.webkit || browser.gecko\n  if (node.nodeType == 3 && supportEmptyRange && BIDI.test(node.nodeValue)) {\n    let rect = singleRect(textRange(node, offset, offset), side)\n    // Firefox returns bad results (the position before the space)\n    // when querying a position directly after line-broken\n    // whitespace. Detect this situation and and kludge around it\n    if (browser.gecko && offset && /\\s/.test(node.nodeValue[offset - 1]) && offset < node.nodeValue.length) {\n      let rectBefore = singleRect(textRange(node, offset - 1, offset - 1), -1)\n      if (rectBefore.top == rect.top) {\n        let rectAfter = singleRect(textRange(node, offset, offset + 1), -1)\n        if (rectAfter.top != rect.top)\n          return flattenV(rectAfter, rectAfter.left < rectBefore.left)\n      }\n    }\n    return rect\n  }\n\n  // Move up the DOM as far as possible when in inline context.\n  if (inline) {\n    let parent = $pos.depth ? view.docView.domAfterPos($pos.before()) : view.dom\n    while (side < 0 && !offset && node != parent) {\n      offset = domIndex(node)\n      node = node.parentNode\n    }\n    while (side >= 0 && offset == nodeSize(node) && node != parent) {\n      offset = domIndex(node) + 1\n      node = node.parentNode\n    }\n  }\n\n  if (node.nodeType == 3) {\n    if (side < 0) return flattenV(singleRect(textRange(node, offset - 1, offset), 1), false)\n    return flattenV(singleRect(textRange(node, offset, offset + 1), -1), true)\n  }\n\n  // Return a horizontal line in block context\n  if (!inline) {\n    if (offset && (side < 0 || offset == nodeSize(node))) {\n      let before = node.childNodes[offset - 1]\n      if (before.nodeType == 1) return flattenH(before.getBoundingClientRect(), false)\n    }\n    if (offset < nodeSize(node)) {\n      let after = node.childNodes[offset]\n      if (after.nodeType == 1) return flattenH(after.getBoundingClientRect(), true)\n    }\n    return flattenH(node.getBoundingClientRect(), side >= 0)\n  }\n\n  // Inline, not in text node (this is not Bidi-safe)\n  if (offset && (side < 0 || offset == nodeSize(node))) {\n    let before = node.childNodes[offset - 1]\n    let target = before.nodeType == 3 ? textRange(before, nodeSize(before) - (supportEmptyRange ? 0 : 1))\n        // BR nodes tend to only return the rectangle before them\n        : before.nodeType == 1 && before.nodeName != \"BR\" ? before : null\n    if (target) return flattenV(singleRect(target, 1), false)\n  }\n  if (offset < nodeSize(node)) {\n    let after = node.childNodes[offset]\n    let target = after.nodeType == 3 ? textRange(after, 0, (supportEmptyRange ? 0 : 1))\n        : after.nodeType == 1 ? after : null\n    if (target) return flattenV(singleRect(target, -1), true)\n  }\n  // All else failed, just try to get a rectangle for the target node\n  return flattenV(singleRect(node.nodeType == 3 ? textRange(node) : node, -side), side >= 0)\n}\n\nfunction flattenV(rect, left) {\n  if (rect.width == 0) return rect\n  let x = left ? rect.left : rect.right\n  return {top: rect.top, bottom: rect.bottom, left: x, right: x}\n}\n\nfunction flattenH(rect, top) {\n  if (rect.height == 0) return rect\n  let y = top ? rect.top : rect.bottom\n  return {top: y, bottom: y, left: rect.left, right: rect.right}\n}\n\nfunction withFlushedState(view, state, f) {\n  let viewState = view.state, active = view.root.activeElement\n  if (viewState != state) view.updateState(state)\n  if (active != view.dom) view.focus()\n  try {\n    return f()\n  } finally {\n    if (viewState != state) view.updateState(viewState)\n    if (active != view.dom && active) active.focus()\n  }\n}\n\n// : (EditorView, number, number)\n// Whether vertical position motion in a given direction\n// from a position would leave a text block.\nfunction endOfTextblockVertical(view, state, dir) {\n  let sel = state.selection\n  let $pos = dir == \"up\" ? sel.$anchor.min(sel.$head) : sel.$anchor.max(sel.$head)\n  return withFlushedState(view, state, () => {\n    let {node: dom} = view.docView.domFromPos($pos.pos)\n    for (;;) {\n      let nearest = view.docView.nearestDesc(dom, true)\n      if (!nearest) break\n      if (nearest.node.isBlock) { dom = nearest.dom; break }\n      dom = nearest.dom.parentNode\n    }\n    let coords = coordsAtPos(view, $pos.pos, 1)\n    for (let child = dom.firstChild; child; child = child.nextSibling) {\n      let boxes\n      if (child.nodeType == 1) boxes = child.getClientRects()\n      else if (child.nodeType == 3) boxes = textRange(child, 0, child.nodeValue.length).getClientRects()\n      else continue\n      for (let i = 0; i < boxes.length; i++) {\n        let box = boxes[i]\n        if (box.bottom > box.top && (dir == \"up\" ? box.bottom < coords.top + 1 : box.top > coords.bottom - 1))\n          return false\n      }\n    }\n    return true\n  })\n}\n\nconst maybeRTL = /[\\u0590-\\u08ac]/\n\nfunction endOfTextblockHorizontal(view, state, dir) {\n  let {$head} = state.selection\n  if (!$head.parent.isTextblock) return false\n  let offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size\n  let sel = getSelection()\n  // If the textblock is all LTR, or the browser doesn't support\n  // Selection.modify (Edge), fall back to a primitive approach\n  if (!maybeRTL.test($head.parent.textContent) || !sel.modify)\n    return dir == \"left\" || dir == \"backward\" ? atStart : atEnd\n\n  return withFlushedState(view, state, () => {\n    // This is a huge hack, but appears to be the best we can\n    // currently do: use `Selection.modify` to move the selection by\n    // one character, and see if that moves the cursor out of the\n    // textblock (or doesn't move it at all, when at the start/end of\n    // the document).\n    let oldRange = sel.getRangeAt(0), oldNode = sel.focusNode, oldOff = sel.focusOffset\n    let oldBidiLevel = sel.caretBidiLevel // Only for Firefox\n    sel.modify(\"move\", dir, \"character\")\n    let parentDOM = $head.depth ? view.docView.domAfterPos($head.before()) : view.dom\n    let result = !parentDOM.contains(sel.focusNode.nodeType == 1 ? sel.focusNode : sel.focusNode.parentNode) ||\n        (oldNode == sel.focusNode && oldOff == sel.focusOffset)\n    // Restore the previous selection\n    sel.removeAllRanges()\n    sel.addRange(oldRange)\n    if (oldBidiLevel != null) sel.caretBidiLevel = oldBidiLevel\n    return result\n  })\n}\n\nlet cachedState = null, cachedDir = null, cachedResult = false\nexport function endOfTextblock(view, state, dir) {\n  if (cachedState == state && cachedDir == dir) return cachedResult\n  cachedState = state; cachedDir = dir\n  return cachedResult = dir == \"up\" || dir == \"down\"\n    ? endOfTextblockVertical(view, state, dir)\n    : endOfTextblockHorizontal(view, state, dir)\n}\n","import {DOMSerializer, Fragment, Mark} from \"prosemirror-model\"\nimport {TextSelection} from \"prosemirror-state\"\n\nimport {domIndex, isEquivalentPosition, nodeSize} from \"./dom\"\nimport browser from \"./browser\"\n\n// NodeView:: interface\n//\n// By default, document nodes are rendered using the result of the\n// [`toDOM`](#model.NodeSpec.toDOM) method of their spec, and managed\n// entirely by the editor. For some use cases, such as embedded\n// node-specific editing interfaces, you want more control over\n// the behavior of a node's in-editor representation, and need to\n// [define](#view.EditorProps.nodeViews) a custom node view.\n//\n// Mark views only support `dom` and `contentDOM`, and don't support\n// any of the node view methods.\n//\n// Objects returned as node views must conform to this interface.\n//\n//   dom:: ?dom.Node\n//   The outer DOM node that represents the document node. When not\n//   given, the default strategy is used to create a DOM node.\n//\n//   contentDOM:: ?dom.Node\n//   The DOM node that should hold the node's content. Only meaningful\n//   if the node view also defines a `dom` property and if its node\n//   type is not a leaf node type. When this is present, ProseMirror\n//   will take care of rendering the node's children into it. When it\n//   is not present, the node view itself is responsible for rendering\n//   (or deciding not to render) its child nodes.\n//\n//   update:: ?(node: Node, decorations: [Decoration]) → bool\n//   When given, this will be called when the view is updating itself.\n//   It will be given a node (possibly of a different type), and an\n//   array of active decorations (which are automatically drawn, and\n//   the node view may ignore if it isn't interested in them), and\n//   should return true if it was able to update to that node, and\n//   false otherwise. If the node view has a `contentDOM` property (or\n//   no `dom` property), updating its child nodes will be handled by\n//   ProseMirror.\n//\n//   selectNode:: ?()\n//   Can be used to override the way the node's selected status (as a\n//   node selection) is displayed.\n//\n//   deselectNode:: ?()\n//   When defining a `selectNode` method, you should also provide a\n//   `deselectNode` method to remove the effect again.\n//\n//   setSelection:: ?(anchor: number, head: number, root: dom.Document)\n//   This will be called to handle setting the selection inside the\n//   node. The `anchor` and `head` positions are relative to the start\n//   of the node. By default, a DOM selection will be created between\n//   the DOM positions corresponding to those positions, but if you\n//   override it you can do something else.\n//\n//   stopEvent:: ?(event: dom.Event) → bool\n//   Can be used to prevent the editor view from trying to handle some\n//   or all DOM events that bubble up from the node view. Events for\n//   which this returns true are not handled by the editor.\n//\n//   ignoreMutation:: ?(dom.MutationRecord) → bool\n//   Called when a DOM\n//   [mutation](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver)\n//   or a selection change happens within the view. When the change is\n//   a selection change, the record will have a `type` property of\n//   `\"selection\"` (which doesn't occur for native mutation records).\n//   Return false if the editor should re-read the selection or\n//   re-parse the range around the mutation, true if it can safely be\n//   ignored.\n//\n//   destroy:: ?()\n//   Called when the node view is removed from the editor or the whole\n//   editor is destroyed.\n\n// View descriptions are data structures that describe the DOM that is\n// used to represent the editor's content. They are used for:\n//\n// - Incremental redrawing when the document changes\n//\n// - Figuring out what part of the document a given DOM position\n//   corresponds to\n//\n// - Wiring in custom implementations of the editing interface for a\n//   given node\n//\n// They form a doubly-linked mutable tree, starting at `view.docView`.\n\nconst NOT_DIRTY = 0, CHILD_DIRTY = 1, CONTENT_DIRTY = 2, NODE_DIRTY = 3\n\n// Superclass for the various kinds of descriptions. Defines their\n// basic structure and shared methods.\nclass ViewDesc {\n  // : (?ViewDesc, [ViewDesc], dom.Node, ?dom.Node)\n  constructor(parent, children, dom, contentDOM) {\n    this.parent = parent\n    this.children = children\n    this.dom = dom\n    // An expando property on the DOM node provides a link back to its\n    // description.\n    dom.pmViewDesc = this\n    // This is the node that holds the child views. It may be null for\n    // descs that don't have children.\n    this.contentDOM = contentDOM\n    this.dirty = NOT_DIRTY\n  }\n\n  // Used to check whether a given description corresponds to a\n  // widget/mark/node.\n  matchesWidget() { return false }\n  matchesMark() { return false }\n  matchesNode() { return false }\n  matchesHack() { return false }\n\n  get beforePosition() { return false }\n\n  // : () → ?ParseRule\n  // When parsing in-editor content (in domchange.js), we allow\n  // descriptions to determine the parse rules that should be used to\n  // parse them.\n  parseRule() { return null }\n\n  // : (dom.Event) → bool\n  // Used by the editor's event handler to ignore events that come\n  // from certain descs.\n  stopEvent() { return false }\n\n  // The size of the content represented by this desc.\n  get size() {\n    let size = 0\n    for (let i = 0; i < this.children.length; i++) size += this.children[i].size\n    return size\n  }\n\n  // For block nodes, this represents the space taken up by their\n  // start/end tokens.\n  get border() { return 0 }\n\n  destroy() {\n    this.parent = null\n    if (this.dom.pmViewDesc == this) this.dom.pmViewDesc = null\n    for (let i = 0; i < this.children.length; i++)\n      this.children[i].destroy()\n  }\n\n  posBeforeChild(child) {\n    for (let i = 0, pos = this.posAtStart; i < this.children.length; i++) {\n      let cur = this.children[i]\n      if (cur == child) return pos\n      pos += cur.size\n    }\n  }\n\n  get posBefore() {\n    return this.parent.posBeforeChild(this)\n  }\n\n  get posAtStart() {\n    return this.parent ? this.parent.posBeforeChild(this) + this.border : 0\n  }\n\n  get posAfter() {\n    return this.posBefore + this.size\n  }\n\n  get posAtEnd() {\n    return this.posAtStart + this.size - 2 * this.border\n  }\n\n  // : (dom.Node, number, ?number) → number\n  localPosFromDOM(dom, offset, bias) {\n    // If the DOM position is in the content, use the child desc after\n    // it to figure out a position.\n    if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {\n      if (bias < 0) {\n        let domBefore, desc\n        if (dom == this.contentDOM) {\n          domBefore = dom.childNodes[offset - 1]\n        } else {\n          while (dom.parentNode != this.contentDOM) dom = dom.parentNode\n          domBefore = dom.previousSibling\n        }\n        while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this)) domBefore = domBefore.previousSibling\n        return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart\n      } else {\n        let domAfter, desc\n        if (dom == this.contentDOM) {\n          domAfter = dom.childNodes[offset]\n        } else {\n          while (dom.parentNode != this.contentDOM) dom = dom.parentNode\n          domAfter = dom.nextSibling\n        }\n        while (domAfter && !((desc = domAfter.pmViewDesc) && desc.parent == this)) domAfter = domAfter.nextSibling\n        return domAfter ? this.posBeforeChild(desc) : this.posAtEnd\n      }\n    }\n    // Otherwise, use various heuristics, falling back on the bias\n    // parameter, to determine whether to return the position at the\n    // start or at the end of this view desc.\n    let atEnd\n    if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {\n      atEnd = dom.compareDocumentPosition(this.contentDOM) & 2\n    } else if (this.dom.firstChild) {\n      if (offset == 0) for (let search = dom;; search = search.parentNode) {\n        if (search == this.dom) { atEnd = false; break }\n        if (search.parentNode.firstChild != search) break\n      }\n      if (atEnd == null && offset == dom.childNodes.length) for (let search = dom;; search = search.parentNode) {\n        if (search == this.dom) { atEnd = true; break }\n        if (search.parentNode.lastChild != search) break\n      }\n    }\n    return (atEnd == null ? bias > 0 : atEnd) ? this.posAtEnd : this.posAtStart\n  }\n\n  // Scan up the dom finding the first desc that is a descendant of\n  // this one.\n  nearestDesc(dom, onlyNodes) {\n    for (let first = true, cur = dom; cur; cur = cur.parentNode) {\n      let desc = this.getDesc(cur)\n      if (desc && (!onlyNodes || desc.node)) {\n        // If dom is outside of this desc's nodeDOM, don't count it.\n        if (first && desc.nodeDOM &&\n            !(desc.nodeDOM.nodeType == 1 ? desc.nodeDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode) : desc.nodeDOM == dom))\n          first = false\n        else\n          return desc\n      }\n    }\n  }\n\n  getDesc(dom) {\n    let desc = dom.pmViewDesc\n    for (let cur = desc; cur; cur = cur.parent) if (cur == this) return desc\n  }\n\n  posFromDOM(dom, offset, bias) {\n    for (let scan = dom; scan; scan = scan.parentNode) {\n      let desc = this.getDesc(scan)\n      if (desc) return desc.localPosFromDOM(dom, offset, bias)\n    }\n    return -1\n  }\n\n  // : (number) → ?NodeViewDesc\n  // Find the desc for the node after the given pos, if any. (When a\n  // parent node overrode rendering, there might not be one.)\n  descAt(pos) {\n    for (let i = 0, offset = 0; i < this.children.length; i++) {\n      let child = this.children[i], end = offset + child.size\n      if (offset == pos && end != offset) {\n        while (!child.border && child.children.length) child = child.children[0]\n        return child\n      }\n      if (pos < end) return child.descAt(pos - offset - child.border)\n      offset = end\n    }\n  }\n\n  // : (number) → {node: dom.Node, offset: number}\n  domFromPos(pos) {\n    if (!this.contentDOM) return {node: this.dom, offset: 0}\n    for (let offset = 0, i = 0;; i++) {\n      if (offset == pos) {\n        while (i < this.children.length && (this.children[i].beforePosition || this.children[i].dom.parentNode != this.contentDOM)) i++\n        return {node: this.contentDOM,\n                offset: i == this.children.length ? this.contentDOM.childNodes.length : domIndex(this.children[i].dom)}\n      }\n      if (i == this.children.length) throw new Error(\"Invalid position \" + pos)\n      let child = this.children[i], end = offset + child.size\n      if (pos < end) return child.domFromPos(pos - offset - child.border)\n      offset = end\n    }\n  }\n\n  // Used to find a DOM range in a single parent for a given changed\n  // range.\n  parseRange(from, to, base = 0) {\n    if (this.children.length == 0)\n      return {node: this.contentDOM, from, to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length}\n\n    let fromOffset = -1, toOffset = -1\n    for (let offset = base, i = 0;; i++) {\n      let child = this.children[i], end = offset + child.size\n      if (fromOffset == -1 && from <= end) {\n        let childBase = offset + child.border\n        // FIXME maybe descend mark views to parse a narrower range?\n        if (from >= childBase && to <= end - child.border && child.node &&\n            child.contentDOM && this.contentDOM.contains(child.contentDOM))\n          return child.parseRange(from, to, childBase)\n\n        from = offset\n        for (let j = i; j > 0; j--) {\n          let prev = this.children[j - 1]\n          if (prev.size && prev.dom.parentNode == this.contentDOM && !prev.emptyChildAt(1)) {\n            fromOffset = domIndex(prev.dom) + 1\n            break\n          }\n          from -= prev.size\n        }\n        if (fromOffset == -1) fromOffset = 0\n      }\n      if (fromOffset > -1 && (end > to || i == this.children.length - 1)) {\n        to = end\n        for (let j = i + 1; j < this.children.length; j++) {\n          let next = this.children[j]\n          if (next.size && next.dom.parentNode == this.contentDOM && !next.emptyChildAt(-1)) {\n            toOffset = domIndex(next.dom)\n            break\n          }\n          to += next.size\n        }\n        if (toOffset == -1) toOffset = this.contentDOM.childNodes.length\n        break\n      }\n      offset = end\n    }\n    return {node: this.contentDOM, from, to, fromOffset, toOffset}\n  }\n\n  emptyChildAt(side) {\n    if (this.border || !this.contentDOM || !this.children.length) return false\n    let child = this.children[side < 0 ? 0 : this.children.length - 1]\n    return child.size == 0 || child.emptyChildAt(side)\n  }\n\n  // : (number) → dom.Node\n  domAfterPos(pos) {\n    let {node, offset} = this.domFromPos(pos)\n    if (node.nodeType != 1 || offset == node.childNodes.length)\n      throw new RangeError(\"No node after pos \" + pos)\n    return node.childNodes[offset]\n  }\n\n  // : (number, number, dom.Document)\n  // View descs are responsible for setting any selection that falls\n  // entirely inside of them, so that custom implementations can do\n  // custom things with the selection. Note that this falls apart when\n  // a selection starts in such a node and ends in another, in which\n  // case we just use whatever domFromPos produces as a best effort.\n  setSelection(anchor, head, root, force) {\n    // If the selection falls entirely in a child, give it to that child\n    let from = Math.min(anchor, head), to = Math.max(anchor, head)\n    for (let i = 0, offset = 0; i < this.children.length; i++) {\n      let child = this.children[i], end = offset + child.size\n      if (from > offset && to < end)\n        return child.setSelection(anchor - offset - child.border, head - offset - child.border, root, force)\n      offset = end\n    }\n\n    let anchorDOM = this.domFromPos(anchor), headDOM = this.domFromPos(head)\n    let domSel = root.getSelection()\n\n    let brKludge = false\n    // On Firefox, using Selection.collapse to put the cursor after a\n    // BR node for some reason doesn't always work (#1073). On Safari,\n    // the cursor sometimes inexplicable visually lags behind its\n    // reported position in such situations (#1092).\n    if ((browser.gecko || browser.safari) && anchor == head) {\n      let prev = anchorDOM.node.childNodes[anchorDOM.offset - 1]\n      brKludge = prev && (prev.nodeName == \"BR\" || prev.contentEditable == \"false\")\n    }\n\n    if (!(force || brKludge && browser.safari) &&\n        isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset) &&\n        isEquivalentPosition(headDOM.node, headDOM.offset, domSel.focusNode, domSel.focusOffset))\n      return\n\n    // Selection.extend can be used to create an 'inverted' selection\n    // (one where the focus is before the anchor), but not all\n    // browsers support it yet.\n    let domSelExtended = false\n    if ((domSel.extend || anchor == head) && !brKludge) {\n      domSel.collapse(anchorDOM.node, anchorDOM.offset)\n      try {\n        if (anchor != head) domSel.extend(headDOM.node, headDOM.offset)\n        domSelExtended = true\n      } catch (err) {\n        // In some cases with Chrome the selection is empty after calling\n        // collapse, even when it should be valid. This appears to be a bug, but\n        // it is difficult to isolate. If this happens fallback to the old path\n        // without using extend.\n        if (!(err instanceof DOMException)) throw err\n        // declare global: DOMException\n      }\n    }\n    if (!domSelExtended) {\n      if (anchor > head) { let tmp = anchorDOM; anchorDOM = headDOM; headDOM = tmp }\n      let range = document.createRange()\n      range.setEnd(headDOM.node, headDOM.offset)\n      range.setStart(anchorDOM.node, anchorDOM.offset)\n      domSel.removeAllRanges()\n      domSel.addRange(range)\n    }\n  }\n\n  // : (dom.MutationRecord) → bool\n  ignoreMutation(mutation) {\n    return !this.contentDOM && mutation.type != \"selection\"\n  }\n\n  get contentLost() {\n    return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM)\n  }\n\n  // Remove a subtree of the element tree that has been touched\n  // by a DOM change, so that the next update will redraw it.\n  markDirty(from, to) {\n    for (let offset = 0, i = 0; i < this.children.length; i++) {\n      let child = this.children[i], end = offset + child.size\n      if (offset == end ? from <= end && to >= offset : from < end && to > offset) {\n        let startInside = offset + child.border, endInside = end - child.border\n        if (from >= startInside && to <= endInside) {\n          this.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY\n          if (from == startInside && to == endInside &&\n              (child.contentLost || child.dom.parentNode != this.contentDOM)) child.dirty = NODE_DIRTY\n          else child.markDirty(from - startInside, to - startInside)\n          return\n        } else {\n          child.dirty = NODE_DIRTY\n        }\n      }\n      offset = end\n    }\n    this.dirty = CONTENT_DIRTY\n  }\n\n  markParentsDirty() {\n    let level = 1\n    for (let node = this.parent; node; node = node.parent, level++) {\n      let dirty = level == 1 ? CONTENT_DIRTY : CHILD_DIRTY\n      if (node.dirty < dirty) node.dirty = dirty\n    }\n  }\n}\n\n// Reused array to avoid allocating fresh arrays for things that will\n// stay empty anyway.\nconst nothing = []\n\n// A widget desc represents a widget decoration, which is a DOM node\n// drawn between the document nodes.\nclass WidgetViewDesc extends ViewDesc {\n  // : (ViewDesc, Decoration)\n  constructor(parent, widget, view, pos) {\n    let self, dom = widget.type.toDOM\n    if (typeof dom == \"function\") dom = dom(view, () => {\n      if (!self) return pos\n      if (self.parent) return self.parent.posBeforeChild(self)\n    })\n    if (!widget.type.spec.raw) {\n      if (dom.nodeType != 1) {\n        let wrap = document.createElement(\"span\")\n        wrap.appendChild(dom)\n        dom = wrap\n      }\n      dom.contentEditable = false\n      dom.classList.add(\"ProseMirror-widget\")\n    }\n    super(parent, nothing, dom, null)\n    this.widget = widget\n    self = this\n  }\n\n  get beforePosition() {\n    return this.widget.type.side < 0\n  }\n\n  matchesWidget(widget) {\n    return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type)\n  }\n\n  parseRule() { return {ignore: true} }\n\n  stopEvent(event) {\n    let stop = this.widget.spec.stopEvent\n    return stop ? stop(event) : false\n  }\n\n  ignoreMutation(mutation) {\n    return mutation.type != \"selection\" || this.widget.spec.ignoreSelection\n  }\n}\n\nclass CompositionViewDesc extends ViewDesc {\n  constructor(parent, dom, textDOM, text) {\n    super(parent, nothing, dom, null)\n    this.textDOM = textDOM\n    this.text = text\n  }\n\n  get size() { return this.text.length }\n\n  localPosFromDOM(dom, offset) {\n    if (dom != this.textDOM) return this.posAtStart + (offset ? this.size : 0)\n    return this.posAtStart + offset\n  }\n\n  domFromPos(pos) {\n    return {node: this.textDOM, offset: pos}\n  }\n\n  ignoreMutation(mut) {\n    return mut.type === 'characterData' && mut.target.nodeValue == mut.oldValue\n   }\n}\n\n// A mark desc represents a mark. May have multiple children,\n// depending on how the mark is split. Note that marks are drawn using\n// a fixed nesting order, for simplicity and predictability, so in\n// some cases they will be split more often than would appear\n// necessary.\nclass MarkViewDesc extends ViewDesc {\n  // : (ViewDesc, Mark, dom.Node)\n  constructor(parent, mark, dom, contentDOM) {\n    super(parent, [], dom, contentDOM)\n    this.mark = mark\n  }\n\n  static create(parent, mark, inline, view) {\n    let custom = view.nodeViews[mark.type.name]\n    let spec = custom && custom(mark, view, inline)\n    if (!spec || !spec.dom)\n      spec = DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline))\n    return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom)\n  }\n\n  parseRule() { return {mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM} }\n\n  matchesMark(mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark) }\n\n  markDirty(from, to) {\n    super.markDirty(from, to)\n    // Move dirty info to nearest node view\n    if (this.dirty != NOT_DIRTY) {\n      let parent = this.parent\n      while (!parent.node) parent = parent.parent\n      if (parent.dirty < this.dirty) parent.dirty = this.dirty\n      this.dirty = NOT_DIRTY\n    }\n  }\n\n  slice(from, to, view) {\n    let copy = MarkViewDesc.create(this.parent, this.mark, true, view)\n    let nodes = this.children, size = this.size\n    if (to < size) nodes = replaceNodes(nodes, to, size, view)\n    if (from > 0) nodes = replaceNodes(nodes, 0, from, view)\n    for (let i = 0; i < nodes.length; i++) nodes[i].parent = copy\n    copy.children = nodes\n    return copy\n  }\n}\n\n// Node view descs are the main, most common type of view desc, and\n// correspond to an actual node in the document. Unlike mark descs,\n// they populate their child array themselves.\nclass NodeViewDesc extends ViewDesc {\n  // : (?ViewDesc, Node, [Decoration], DecorationSet, dom.Node, ?dom.Node, EditorView)\n  constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {\n    super(parent, node.isLeaf ? nothing : [], dom, contentDOM)\n    this.nodeDOM = nodeDOM\n    this.node = node\n    this.outerDeco = outerDeco\n    this.innerDeco = innerDeco\n    if (contentDOM) this.updateChildren(view, pos)\n  }\n\n  // By default, a node is rendered using the `toDOM` method from the\n  // node type spec. But client code can use the `nodeViews` spec to\n  // supply a custom node view, which can influence various aspects of\n  // the way the node works.\n  //\n  // (Using subclassing for this was intentionally decided against,\n  // since it'd require exposing a whole slew of finnicky\n  // implementation details to the user code that they probably will\n  // never need.)\n  static create(parent, node, outerDeco, innerDeco, view, pos) {\n    let custom = view.nodeViews[node.type.name], descObj\n    let spec = custom && custom(node, view, () => {\n      // (This is a function that allows the custom view to find its\n      // own position)\n      if (!descObj) return pos\n      if (descObj.parent) return descObj.parent.posBeforeChild(descObj)\n    }, outerDeco)\n\n    let dom = spec && spec.dom, contentDOM = spec && spec.contentDOM\n    if (node.isText) {\n      if (!dom) dom = document.createTextNode(node.text)\n      else if (dom.nodeType != 3) throw new RangeError(\"Text must be rendered as a DOM text node\")\n    } else if (!dom) {\n      ;({dom, contentDOM} = DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)))\n    }\n    if (!contentDOM && !node.isText && dom.nodeName != \"BR\") { // Chrome gets confused by <br contenteditable=false>\n      if (!dom.hasAttribute(\"contenteditable\")) dom.contentEditable = false\n      if (node.type.spec.draggable) dom.draggable = true\n    }\n\n    let nodeDOM = dom\n    dom = applyOuterDeco(dom, outerDeco, node)\n\n    if (spec)\n      return descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM,\n                                              spec, view, pos + 1)\n    else if (node.isText)\n      return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view)\n    else\n      return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos + 1)\n  }\n\n  parseRule() {\n    // Experimental kludge to allow opt-in re-parsing of nodes\n    if (this.node.type.spec.reparseInView) return null\n    // FIXME the assumption that this can always return the current\n    // attrs means that if the user somehow manages to change the\n    // attrs in the dom, that won't be picked up. Not entirely sure\n    // whether this is a problem\n    let rule = {node: this.node.type.name, attrs: this.node.attrs}\n    if (this.node.type.spec.code) rule.preserveWhitespace = \"full\"\n    if (this.contentDOM && !this.contentLost) rule.contentElement = this.contentDOM\n    else rule.getContent = () => this.contentDOM ? Fragment.empty : this.node.content\n    return rule\n  }\n\n  matchesNode(node, outerDeco, innerDeco) {\n    return this.dirty == NOT_DIRTY && node.eq(this.node) &&\n      sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco)\n  }\n\n  get size() { return this.node.nodeSize }\n\n  get border() { return this.node.isLeaf ? 0 : 1 }\n\n  // Syncs `this.children` to match `this.node.content` and the local\n  // decorations, possibly introducing nesting for marks. Then, in a\n  // separate step, syncs the DOM inside `this.contentDOM` to\n  // `this.children`.\n  updateChildren(view, pos) {\n    let inline = this.node.inlineContent, off = pos\n    let composition = inline && view.composing && this.localCompositionNode(view, pos)\n    let updater = new ViewTreeUpdater(this, composition && composition.node)\n    iterDeco(this.node, this.innerDeco, (widget, i, insideNode) => {\n      if (widget.spec.marks)\n        updater.syncToMarks(widget.spec.marks, inline, view)\n      else if (widget.type.side >= 0 && !insideNode)\n        updater.syncToMarks(i == this.node.childCount ? Mark.none : this.node.child(i).marks, inline, view)\n      // If the next node is a desc matching this widget, reuse it,\n      // otherwise insert the widget as a new view desc.\n      updater.placeWidget(widget, view, off)\n    }, (child, outerDeco, innerDeco, i) => {\n      // Make sure the wrapping mark descs match the node's marks.\n      updater.syncToMarks(child.marks, inline, view)\n      // Either find an existing desc that exactly matches this node,\n      // and drop the descs before it.\n      updater.findNodeMatch(child, outerDeco, innerDeco, i) ||\n        // Or try updating the next desc to reflect this node.\n        updater.updateNextNode(child, outerDeco, innerDeco, view, i) ||\n        // Or just add it as a new desc.\n        updater.addNode(child, outerDeco, innerDeco, view, off)\n      off += child.nodeSize\n    })\n    // Drop all remaining descs after the current position.\n    updater.syncToMarks(nothing, inline, view)\n    if (this.node.isTextblock) updater.addTextblockHacks()\n    updater.destroyRest()\n\n    // Sync the DOM if anything changed\n    if (updater.changed || this.dirty == CONTENT_DIRTY) {\n      // May have to protect focused DOM from being changed if a composition is active\n      if (composition) this.protectLocalComposition(view, composition)\n      renderDescs(this.contentDOM, this.children, view)\n      if (browser.ios) iosHacks(this.dom)\n    }\n  }\n\n  localCompositionNode(view, pos) {\n    // Only do something if both the selection and a focused text node\n    // are inside of this node, and the node isn't already part of a\n    // view that's a child of this view\n    let {from, to} = view.state.selection\n    if (!(view.state.selection instanceof TextSelection) || from < pos || to > pos + this.node.content.size) return\n    let sel = view.root.getSelection()\n    let textNode = nearbyTextNode(sel.focusNode, sel.focusOffset)\n    if (!textNode || !this.dom.contains(textNode.parentNode)) return\n\n    // Find the text in the focused node in the node, stop if it's not\n    // there (may have been modified through other means, in which\n    // case it should overwritten)\n    let text = textNode.nodeValue\n    let textPos = findTextInFragment(this.node.content, text, from - pos, to - pos)\n\n    return textPos < 0 ? null : {node: textNode, pos: textPos, text}\n  }\n\n  protectLocalComposition(view, {node, pos, text}) {\n    // The node is already part of a local view desc, leave it there\n    if (this.getDesc(node)) return\n\n    // Create a composition view for the orphaned nodes\n    let topNode = node\n    for (;; topNode = topNode.parentNode) {\n      if (topNode.parentNode == this.contentDOM) break\n      while (topNode.previousSibling) topNode.parentNode.removeChild(topNode.previousSibling)\n      while (topNode.nextSibling) topNode.parentNode.removeChild(topNode.nextSibling)\n      if (topNode.pmViewDesc) topNode.pmViewDesc = null\n    }\n    let desc = new CompositionViewDesc(this, topNode, node, text)\n    view.compositionNodes.push(desc)\n\n    // Patch up this.children to contain the composition view\n    this.children = replaceNodes(this.children, pos, pos + text.length, view, desc)\n  }\n\n  // : (Node, [Decoration], DecorationSet, EditorView) → bool\n  // If this desc be updated to match the given node decoration,\n  // do so and return true.\n  update(node, outerDeco, innerDeco, view) {\n    if (this.dirty == NODE_DIRTY ||\n        !node.sameMarkup(this.node)) return false\n    this.updateInner(node, outerDeco, innerDeco, view)\n    return true\n  }\n\n  updateInner(node, outerDeco, innerDeco, view) {\n    this.updateOuterDeco(outerDeco)\n    this.node = node\n    this.innerDeco = innerDeco\n    if (this.contentDOM) this.updateChildren(view, this.posAtStart)\n    this.dirty = NOT_DIRTY\n  }\n\n  updateOuterDeco(outerDeco) {\n    if (sameOuterDeco(outerDeco, this.outerDeco)) return\n    let needsWrap = this.nodeDOM.nodeType != 1\n    let oldDOM = this.dom\n    this.dom = patchOuterDeco(this.dom, this.nodeDOM,\n                              computeOuterDeco(this.outerDeco, this.node, needsWrap),\n                              computeOuterDeco(outerDeco, this.node, needsWrap))\n    if (this.dom != oldDOM) {\n      oldDOM.pmViewDesc = null\n      this.dom.pmViewDesc = this\n    }\n    this.outerDeco = outerDeco\n  }\n\n  // Mark this node as being the selected node.\n  selectNode() {\n    this.nodeDOM.classList.add(\"ProseMirror-selectednode\")\n    if (this.contentDOM || !this.node.type.spec.draggable) this.dom.draggable = true\n  }\n\n  // Remove selected node marking from this node.\n  deselectNode() {\n    this.nodeDOM.classList.remove(\"ProseMirror-selectednode\")\n    if (this.contentDOM || !this.node.type.spec.draggable) this.dom.removeAttribute(\"draggable\")\n  }\n}\n\n// Create a view desc for the top-level document node, to be exported\n// and used by the view class.\nexport function docViewDesc(doc, outerDeco, innerDeco, dom, view) {\n  applyOuterDeco(dom, outerDeco, doc)\n  return new NodeViewDesc(null, doc, outerDeco, innerDeco, dom, dom, dom, view, 0)\n}\n\nclass TextViewDesc extends NodeViewDesc {\n  constructor(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {\n    super(parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view)\n  }\n\n  parseRule() {\n    let skip = this.nodeDOM.parentNode\n    while (skip && skip != this.dom && !skip.pmIsDeco) skip = skip.parentNode\n    return {skip: skip || true}\n  }\n\n  update(node, outerDeco, _, view) {\n    if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) ||\n        !node.sameMarkup(this.node)) return false\n    this.updateOuterDeco(outerDeco)\n    if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue) {\n      this.nodeDOM.nodeValue = node.text\n      if (view.trackWrites == this.nodeDOM) view.trackWrites = null\n    }\n    this.node = node\n    this.dirty = NOT_DIRTY\n    return true\n  }\n\n  inParent() {\n    let parentDOM = this.parent.contentDOM\n    for (let n = this.nodeDOM; n; n = n.parentNode) if (n == parentDOM) return true\n    return false\n  }\n\n  domFromPos(pos) {\n    return {node: this.nodeDOM, offset: pos}\n  }\n\n  localPosFromDOM(dom, offset, bias) {\n    if (dom == this.nodeDOM) return this.posAtStart + Math.min(offset, this.node.text.length)\n    return super.localPosFromDOM(dom, offset, bias)\n  }\n\n  ignoreMutation(mutation) {\n    return mutation.type != \"characterData\" && mutation.type != \"selection\"\n  }\n\n  slice(from, to, view) {\n    let node = this.node.cut(from, to), dom = document.createTextNode(node.text)\n    return new TextViewDesc(this.parent, node, this.outerDeco, this.innerDeco, dom, dom, view)\n  }\n}\n\n// A dummy desc used to tag trailing BR or span nodes created to work\n// around contentEditable terribleness.\nclass BRHackViewDesc extends ViewDesc {\n  parseRule() { return {ignore: true} }\n  matchesHack() { return this.dirty == NOT_DIRTY }\n}\n\n// A separate subclass is used for customized node views, so that the\n// extra checks only have to be made for nodes that are actually\n// customized.\nclass CustomNodeViewDesc extends NodeViewDesc {\n  // : (?ViewDesc, Node, [Decoration], DecorationSet, dom.Node, ?dom.Node, NodeView, EditorView)\n  constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view, pos) {\n    super(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos)\n    this.spec = spec\n  }\n\n  // A custom `update` method gets to decide whether the update goes\n  // through. If it does, and there's a `contentDOM` node, our logic\n  // updates the children.\n  update(node, outerDeco, innerDeco, view) {\n    if (this.dirty == NODE_DIRTY) return false\n    if (this.spec.update) {\n      let result = this.spec.update(node, outerDeco)\n      if (result) this.updateInner(node, outerDeco, innerDeco, view)\n      return result\n    } else if (!this.contentDOM && !node.isLeaf) {\n      return false\n    } else {\n      return super.update(node, outerDeco, innerDeco, view)\n    }\n  }\n\n  selectNode() {\n    this.spec.selectNode ? this.spec.selectNode() : super.selectNode()\n  }\n\n  deselectNode() {\n    this.spec.deselectNode ? this.spec.deselectNode() : super.deselectNode()\n  }\n\n  setSelection(anchor, head, root, force) {\n    this.spec.setSelection ? this.spec.setSelection(anchor, head, root)\n      : super.setSelection(anchor, head, root, force)\n  }\n\n  destroy() {\n    if (this.spec.destroy) this.spec.destroy()\n    super.destroy()\n  }\n\n  stopEvent(event) {\n    return this.spec.stopEvent ? this.spec.stopEvent(event) : false\n  }\n\n  ignoreMutation(mutation) {\n    return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : super.ignoreMutation(mutation)\n  }\n}\n\n// : (dom.Node, [ViewDesc])\n// Sync the content of the given DOM node with the nodes associated\n// with the given array of view descs, recursing into mark descs\n// because this should sync the subtree for a whole node at a time.\nfunction renderDescs(parentDOM, descs, view) {\n  let dom = parentDOM.firstChild, written = false\n  for (let i = 0; i < descs.length; i++) {\n    let desc = descs[i], childDOM = desc.dom\n    if (childDOM.parentNode == parentDOM) {\n      while (childDOM != dom) { dom = rm(dom); written = true }\n      dom = dom.nextSibling\n    } else {\n      written = true\n      parentDOM.insertBefore(childDOM, dom)\n    }\n    if (desc instanceof MarkViewDesc) {\n      let pos = dom ? dom.previousSibling : parentDOM.lastChild\n      renderDescs(desc.contentDOM, desc.children, view)\n      dom = pos ? pos.nextSibling : parentDOM.firstChild\n    }\n  }\n  while (dom) { dom = rm(dom); written = true }\n  if (written && view.trackWrites == parentDOM) view.trackWrites = null\n}\n\nfunction OuterDecoLevel(nodeName) {\n  if (nodeName) this.nodeName = nodeName\n}\nOuterDecoLevel.prototype = Object.create(null)\n\nconst noDeco = [new OuterDecoLevel]\n\nfunction computeOuterDeco(outerDeco, node, needsWrap) {\n  if (outerDeco.length == 0) return noDeco\n\n  let top = needsWrap ? noDeco[0] : new OuterDecoLevel, result = [top]\n\n  for (let i = 0; i < outerDeco.length; i++) {\n    let attrs = outerDeco[i].type.attrs, cur = top\n    if (!attrs) continue\n    if (attrs.nodeName)\n      result.push(cur = new OuterDecoLevel(attrs.nodeName))\n\n    for (let name in attrs) {\n      let val = attrs[name]\n      if (val == null) continue\n      if (needsWrap && result.length == 1)\n        result.push(cur = top = new OuterDecoLevel(node.isInline ? \"span\" : \"div\"))\n      if (name == \"class\") cur.class = (cur.class ? cur.class + \" \" : \"\") + val\n      else if (name == \"style\") cur.style = (cur.style ? cur.style + \";\" : \"\") + val\n      else if (name != \"nodeName\") cur[name] = val\n    }\n  }\n\n  return result\n}\n\nfunction patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {\n  // Shortcut for trivial case\n  if (prevComputed == noDeco && curComputed == noDeco) return nodeDOM\n\n  let curDOM = nodeDOM\n  for (let i = 0; i < curComputed.length; i++) {\n    let deco = curComputed[i], prev = prevComputed[i]\n    if (i) {\n      let parent\n      if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&\n          (parent = curDOM.parentNode) && parent.tagName.toLowerCase() == deco.nodeName) {\n        curDOM = parent\n      } else {\n        parent = document.createElement(deco.nodeName)\n        parent.pmIsDeco = true\n        parent.appendChild(curDOM)\n        prev = noDeco[0]\n        curDOM = parent\n      }\n    }\n    patchAttributes(curDOM, prev || noDeco[0], deco)\n  }\n  return curDOM\n}\n\nfunction patchAttributes(dom, prev, cur) {\n  for (let name in prev)\n    if (name != \"class\" && name != \"style\" && name != \"nodeName\" && !(name in cur))\n      dom.removeAttribute(name)\n  for (let name in cur)\n    if (name != \"class\" && name != \"style\" && name != \"nodeName\" && cur[name] != prev[name])\n      dom.setAttribute(name, cur[name])\n  if (prev.class != cur.class) {\n    let prevList = prev.class ? prev.class.split(\" \") : nothing\n    let curList = cur.class ? cur.class.split(\" \") : nothing\n    for (let i = 0; i < prevList.length; i++) if (curList.indexOf(prevList[i]) == -1)\n      dom.classList.remove(prevList[i])\n    for (let i = 0; i < curList.length; i++) if (prevList.indexOf(curList[i]) == -1)\n      dom.classList.add(curList[i])\n  }\n  if (prev.style != cur.style) {\n    if (prev.style) {\n      let prop = /\\s*([\\w\\-\\xa1-\\uffff]+)\\s*:(?:\"(?:\\\\.|[^\"])*\"|'(?:\\\\.|[^'])*'|\\(.*?\\)|[^;])*/g, m\n      while (m = prop.exec(prev.style))\n        dom.style.removeProperty(m[1])\n    }\n    if (cur.style)\n      dom.style.cssText += cur.style\n  }\n}\n\nfunction applyOuterDeco(dom, deco, node) {\n  return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1))\n}\n\n// : ([Decoration], [Decoration]) → bool\nfunction sameOuterDeco(a, b) {\n  if (a.length != b.length) return false\n  for (let i = 0; i < a.length; i++) if (!a[i].type.eq(b[i].type)) return false\n  return true\n}\n\n// Remove a DOM node and return its next sibling.\nfunction rm(dom) {\n  let next = dom.nextSibling\n  dom.parentNode.removeChild(dom)\n  return next\n}\n\n// Helper class for incrementally updating a tree of mark descs and\n// the widget and node descs inside of them.\nclass ViewTreeUpdater {\n  // : (NodeViewDesc)\n  constructor(top, lockedNode) {\n    this.top = top\n    this.lock = lockedNode\n    // Index into `this.top`'s child array, represents the current\n    // update position.\n    this.index = 0\n    // When entering a mark, the current top and index are pushed\n    // onto this.\n    this.stack = []\n    // Tracks whether anything was changed\n    this.changed = false\n\n    let pre = preMatch(top.node.content, top.children)\n    this.preMatched = pre.nodes\n    this.preMatchOffset = pre.offset\n  }\n\n  getPreMatch(index) {\n    return index >= this.preMatchOffset ? this.preMatched[index - this.preMatchOffset] : null\n  }\n\n  // Destroy and remove the children between the given indices in\n  // `this.top`.\n  destroyBetween(start, end) {\n    if (start == end) return\n    for (let i = start; i < end; i++) this.top.children[i].destroy()\n    this.top.children.splice(start, end - start)\n    this.changed = true\n  }\n\n  // Destroy all remaining children in `this.top`.\n  destroyRest() {\n    this.destroyBetween(this.index, this.top.children.length)\n  }\n\n  // : ([Mark], EditorView)\n  // Sync the current stack of mark descs with the given array of\n  // marks, reusing existing mark descs when possible.\n  syncToMarks(marks, inline, view) {\n    let keep = 0, depth = this.stack.length >> 1\n    let maxKeep = Math.min(depth, marks.length)\n    while (keep < maxKeep &&\n           (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1]).matchesMark(marks[keep]) && marks[keep].type.spec.spanning !== false)\n      keep++\n\n    while (keep < depth) {\n      this.destroyRest()\n      this.top.dirty = NOT_DIRTY\n      this.index = this.stack.pop()\n      this.top = this.stack.pop()\n      depth--\n    }\n    while (depth < marks.length) {\n      this.stack.push(this.top, this.index + 1)\n      let found = -1\n      for (let i = this.index; i < Math.min(this.index + 3, this.top.children.length); i++) {\n        if (this.top.children[i].matchesMark(marks[depth])) { found = i; break }\n      }\n      if (found > -1) {\n        if (found > this.index) {\n          this.changed = true\n          this.destroyBetween(this.index, found)\n        }\n        this.top = this.top.children[this.index]\n      } else {\n        let markDesc = MarkViewDesc.create(this.top, marks[depth], inline, view)\n        this.top.children.splice(this.index, 0, markDesc)\n        this.top = markDesc\n        this.changed = true\n      }\n      this.index = 0\n      depth++\n    }\n  }\n\n  // : (Node, [Decoration], DecorationSet) → bool\n  // Try to find a node desc matching the given data. Skip over it and\n  // return true when successful.\n  findNodeMatch(node, outerDeco, innerDeco, index) {\n    let found = -1, preMatch = index < 0 ? undefined : this.getPreMatch(index), children = this.top.children\n    if (preMatch && preMatch.matchesNode(node, outerDeco, innerDeco)) {\n      found = children.indexOf(preMatch)\n    } else {\n      for (let i = this.index, e = Math.min(children.length, i + 5); i < e; i++) {\n        let child = children[i]\n        if (child.matchesNode(node, outerDeco, innerDeco) && this.preMatched.indexOf(child) < 0) {\n          found = i\n          break\n        }\n      }\n    }\n    if (found < 0) return false\n    this.destroyBetween(this.index, found)\n    this.index++\n    return true\n  }\n\n  // : (Node, [Decoration], DecorationSet, EditorView, Fragment, number) → bool\n  // Try to update the next node, if any, to the given data. Checks\n  // pre-matches to avoid overwriting nodes that could still be used.\n  updateNextNode(node, outerDeco, innerDeco, view, index) {\n    for (let i = this.index; i < this.top.children.length; i++) {\n      let next = this.top.children[i]\n      if (next instanceof NodeViewDesc) {\n        let preMatch = this.preMatched.indexOf(next)\n        if (preMatch > -1 && preMatch + this.preMatchOffset != index) return false\n        let nextDOM = next.dom\n\n        // Can't update if nextDOM is or contains this.lock, except if\n        // it's a text node whose content already matches the new text\n        // and whose decorations match the new ones.\n        let locked = this.lock && (nextDOM == this.lock || nextDOM.nodeType == 1 && nextDOM.contains(this.lock.parentNode)) &&\n            !(node.isText && next.node && next.node.isText && next.nodeDOM.nodeValue == node.text &&\n              next.dirty != NODE_DIRTY && sameOuterDeco(outerDeco, next.outerDeco))\n        if (!locked && next.update(node, outerDeco, innerDeco, view)) {\n          this.destroyBetween(this.index, i)\n          if (next.dom != nextDOM) this.changed = true\n          this.index++\n          return true\n        }\n        break\n      }\n    }\n    return false\n  }\n\n  // : (Node, [Decoration], DecorationSet, EditorView)\n  // Insert the node as a newly created node desc.\n  addNode(node, outerDeco, innerDeco, view, pos) {\n    this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos))\n    this.changed = true\n  }\n\n  placeWidget(widget, view, pos) {\n    let next = this.index < this.top.children.length ? this.top.children[this.index] : null\n    if (next && next.matchesWidget(widget) && (widget == next.widget || !next.widget.type.toDOM.parentNode)) {\n      this.index++\n    } else {\n      let desc = new WidgetViewDesc(this.top, widget, view, pos)\n      this.top.children.splice(this.index++, 0, desc)\n      this.changed = true\n    }\n  }\n\n  // Make sure a textblock looks and behaves correctly in\n  // contentEditable.\n  addTextblockHacks() {\n    let lastChild = this.top.children[this.index - 1]\n    while (lastChild instanceof MarkViewDesc) lastChild = lastChild.children[lastChild.children.length - 1]\n\n    if (!lastChild || // Empty textblock\n        !(lastChild instanceof TextViewDesc) ||\n        /\\n$/.test(lastChild.node.text)) {\n      if (this.index < this.top.children.length && this.top.children[this.index].matchesHack()) {\n        this.index++\n      } else {\n        let dom = document.createElement(\"br\")\n        this.top.children.splice(this.index++, 0, new BRHackViewDesc(this.top, nothing, dom, null))\n        this.changed = true\n      }\n    }\n  }\n}\n\n// : (Fragment, [ViewDesc]) → [ViewDesc]\n// Iterate from the end of the fragment and array of descs to find\n// directly matching ones, in order to avoid overeagerly reusing\n// those for other nodes. Returns an array whose positions correspond\n// to node positions in the fragment, and whose elements are either\n// descs matched to the child at that index, or empty.\nfunction preMatch(frag, descs) {\n  let result = [], end = frag.childCount\n  for (let i = descs.length - 1; end > 0 && i >= 0; i--) {\n    let desc = descs[i], node = desc.node\n    if (!node) continue\n    if (node != frag.child(end - 1)) break\n    result.push(desc)\n    --end\n  }\n  return {nodes: result.reverse(), offset: end}\n}\n\nfunction compareSide(a, b) { return a.type.side - b.type.side }\n\n// : (ViewDesc, DecorationSet, (Decoration, number), (Node, [Decoration], DecorationSet, number))\n// This function abstracts iterating over the nodes and decorations in\n// a fragment. Calls `onNode` for each node, with its local and child\n// decorations. Splits text nodes when there is a decoration starting\n// or ending inside of them. Calls `onWidget` for each widget.\nfunction iterDeco(parent, deco, onWidget, onNode) {\n  let locals = deco.locals(parent), offset = 0\n  // Simple, cheap variant for when there are no local decorations\n  if (locals.length == 0) {\n    for (let i = 0; i < parent.childCount; i++) {\n      let child = parent.child(i)\n      onNode(child, locals, deco.forChild(offset, child), i)\n      offset += child.nodeSize\n    }\n    return\n  }\n\n  let decoIndex = 0, active = [], restNode = null\n  for (let parentIndex = 0;;) {\n    if (decoIndex < locals.length && locals[decoIndex].to == offset) {\n      let widget = locals[decoIndex++], widgets\n      while (decoIndex < locals.length && locals[decoIndex].to == offset)\n        (widgets || (widgets = [widget])).push(locals[decoIndex++])\n      if (widgets) {\n        widgets.sort(compareSide)\n        for (let i = 0; i < widgets.length; i++) onWidget(widgets[i], parentIndex, !!restNode)\n      } else {\n        onWidget(widget, parentIndex, !!restNode)\n      }\n    }\n\n    let child, index\n    if (restNode) {\n      index = -1\n      child = restNode\n      restNode = null\n    } else if (parentIndex < parent.childCount) {\n      index = parentIndex\n      child = parent.child(parentIndex++)\n    } else {\n      break\n    }\n\n    for (let i = 0; i < active.length; i++) if (active[i].to <= offset) active.splice(i--, 1)\n    while (decoIndex < locals.length && locals[decoIndex].from <= offset && locals[decoIndex].to > offset)\n      active.push(locals[decoIndex++])\n\n    let end = offset + child.nodeSize\n    if (child.isText) {\n      let cutAt = end\n      if (decoIndex < locals.length && locals[decoIndex].from < cutAt) cutAt = locals[decoIndex].from\n      for (let i = 0; i < active.length; i++) if (active[i].to < cutAt) cutAt = active[i].to\n      if (cutAt < end) {\n        restNode = child.cut(cutAt - offset)\n        child = child.cut(0, cutAt - offset)\n        end = cutAt\n        index = -1\n      }\n    }\n\n    let outerDeco = !active.length ? nothing\n        : child.isInline && !child.isLeaf ? active.filter(d => !d.inline)\n        : active.slice()\n    onNode(child, outerDeco, deco.forChild(offset, child), index)\n    offset = end\n  }\n}\n\n// List markers in Mobile Safari will mysteriously disappear\n// sometimes. This works around that.\nfunction iosHacks(dom) {\n  if (dom.nodeName == \"UL\" || dom.nodeName == \"OL\") {\n    let oldCSS = dom.style.cssText\n    dom.style.cssText = oldCSS + \"; list-style: square !important\"\n    window.getComputedStyle(dom).listStyle\n    dom.style.cssText = oldCSS\n  }\n}\n\nfunction nearbyTextNode(node, offset) {\n  for (;;) {\n    if (node.nodeType == 3) return node\n    if (node.nodeType == 1 && offset > 0) {\n      if (node.childNodes.length > offset && node.childNodes[offset].nodeType == 3)\n        return node.childNodes[offset]\n      node = node.childNodes[offset - 1]\n      offset = nodeSize(node)\n    } else if (node.nodeType == 1 && offset < node.childNodes.length) {\n      node = node.childNodes[offset]\n      offset = 0\n    } else {\n      return null\n    }\n  }\n}\n\n// Find a piece of text in an inline fragment, overlapping from-to\nfunction findTextInFragment(frag, text, from, to) {\n  for (let i = 0, pos = 0; i < frag.childCount && pos <= to;) {\n    let child = frag.child(i++), childStart = pos\n    pos += child.nodeSize\n    if (!child.isText) continue\n    let str = child.text\n    while (i < frag.childCount) {\n      let next = frag.child(i++)\n      pos += next.nodeSize\n      if (!next.isText) break\n      str += next.text\n    }\n    if (pos >= from) {\n      let found = str.lastIndexOf(text, to - childStart)\n      if (found >= 0 && found + text.length + childStart >= from)\n        return childStart + found\n    }\n  }\n  return -1\n}\n\n// Replace range from-to in an array of view descs with replacement\n// (may be null to just delete). This goes very much against the grain\n// of the rest of this code, which tends to create nodes with the\n// right shape in one go, rather than messing with them after\n// creation, but is necessary in the composition hack.\nfunction replaceNodes(nodes, from, to, view, replacement) {\n  let result = []\n  for (let i = 0, off = 0; i < nodes.length; i++) {\n    let child = nodes[i], start = off, end = off += child.size\n    if (start >= to || end <= from) {\n      result.push(child)\n    } else {\n      if (start < from) result.push(child.slice(0, from - start, view))\n      if (replacement) {\n        result.push(replacement)\n        replacement = null\n      }\n      if (end > to) result.push(child.slice(to - start, child.size, view))\n    }\n  }\n  return result\n}\n","import {Selection, NodeSelection, TextSelection} from \"prosemirror-state\"\nimport browser from \"./browser\"\nimport {domIndex, selectionCollapsed} from \"./dom\"\nimport {selectionToDOM} from \"./selection\"\n\nfunction moveSelectionBlock(state, dir) {\n  let {$anchor, $head} = state.selection\n  let $side = dir > 0 ? $anchor.max($head) : $anchor.min($head)\n  let $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null\n  return $start && Selection.findFrom($start, dir)\n}\n\nfunction apply(view, sel) {\n  view.dispatch(view.state.tr.setSelection(sel).scrollIntoView())\n  return true\n}\n\nfunction selectHorizontally(view, dir, mods) {\n  let sel = view.state.selection\n  if (sel instanceof TextSelection) {\n    if (!sel.empty || mods.indexOf(\"s\") > -1) {\n      return false\n    } else if (view.endOfTextblock(dir > 0 ? \"right\" : \"left\")) {\n      let next = moveSelectionBlock(view.state, dir)\n      if (next && (next instanceof NodeSelection)) return apply(view, next)\n      return false\n    } else if (!(browser.mac && mods.indexOf(\"m\") > -1)) {\n      let $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc\n      if (!node || node.isText) return false\n      let nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos\n      if (!(node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM)) return false\n      if (NodeSelection.isSelectable(node)) {\n        return apply(view, new NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head))\n      } else if (browser.webkit) {\n        // Chrome and Safari will introduce extra pointless cursor\n        // positions around inline uneditable nodes, so we have to\n        // take over and move the cursor past them (#937)\n        return apply(view, new TextSelection(view.state.doc.resolve(dir < 0 ? nodePos : nodePos + node.nodeSize)))\n      } else {\n        return false\n      }\n    }\n  } else if (sel instanceof NodeSelection && sel.node.isInline) {\n    return apply(view, new TextSelection(dir > 0 ? sel.$to : sel.$from))\n  } else {\n    let next = moveSelectionBlock(view.state, dir)\n    if (next) return apply(view, next)\n    return false\n  }\n}\n\nfunction nodeLen(node) {\n  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length\n}\n\nfunction isIgnorable(dom) {\n  let desc = dom.pmViewDesc\n  return desc && desc.size == 0 && (dom.nextSibling || dom.nodeName != \"BR\")\n}\n\n// Make sure the cursor isn't directly after one or more ignored\n// nodes, which will confuse the browser's cursor motion logic.\nfunction skipIgnoredNodesLeft(view) {\n  let sel = view.root.getSelection()\n  let node = sel.focusNode, offset = sel.focusOffset\n  if (!node) return\n  let moveNode, moveOffset, force = false\n  // Gecko will do odd things when the selection is directly in front\n  // of a non-editable node, so in that case, move it into the next\n  // node if possible. Issue prosemirror/prosemirror#832.\n  if (browser.gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset])) force = true\n  for (;;) {\n    if (offset > 0) {\n      if (node.nodeType != 1) {\n        break\n      } else {\n        let before = node.childNodes[offset - 1]\n        if (isIgnorable(before)) {\n          moveNode = node\n          moveOffset = --offset\n        } else if (before.nodeType == 3) {\n          node = before\n          offset = node.nodeValue.length\n        } else break\n      }\n    } else if (isBlockNode(node)) {\n      break\n    } else {\n      let prev = node.previousSibling\n      while (prev && isIgnorable(prev)) {\n        moveNode = node.parentNode\n        moveOffset = domIndex(prev)\n        prev = prev.previousSibling\n      }\n      if (!prev) {\n        node = node.parentNode\n        if (node == view.dom) break\n        offset = 0\n      } else {\n        node = prev\n        offset = nodeLen(node)\n      }\n    }\n  }\n  if (force) setSelFocus(view, sel, node, offset)\n  else if (moveNode) setSelFocus(view, sel, moveNode, moveOffset)\n}\n\n// Make sure the cursor isn't directly before one or more ignored\n// nodes.\nfunction skipIgnoredNodesRight(view) {\n  let sel = view.root.getSelection()\n  let node = sel.focusNode, offset = sel.focusOffset\n  if (!node) return\n  let len = nodeLen(node)\n  let moveNode, moveOffset\n  for (;;) {\n    if (offset < len) {\n      if (node.nodeType != 1) break\n      let after = node.childNodes[offset]\n      if (isIgnorable(after)) {\n        moveNode = node\n        moveOffset = ++offset\n      }\n      else break\n    } else if (isBlockNode(node)) {\n      break\n    } else {\n      let next = node.nextSibling\n      while (next && isIgnorable(next)) {\n        moveNode = next.parentNode\n        moveOffset = domIndex(next) + 1\n        next = next.nextSibling\n      }\n      if (!next) {\n        node = node.parentNode\n        if (node == view.dom) break\n        offset = len = 0\n      } else {\n        node = next\n        offset = 0\n        len = nodeLen(node)\n      }\n    }\n  }\n  if (moveNode) setSelFocus(view, sel, moveNode, moveOffset)\n}\n\nfunction isBlockNode(dom) {\n  let desc = dom.pmViewDesc\n  return desc && desc.node && desc.node.isBlock\n}\n\nfunction setSelFocus(view, sel, node, offset) {\n  if (selectionCollapsed(sel)) {\n    let range = document.createRange()\n    range.setEnd(node, offset)\n    range.setStart(node, offset)\n    sel.removeAllRanges()\n    sel.addRange(range)\n  } else if (sel.extend) {\n    sel.extend(node, offset)\n  }\n  view.domObserver.setCurSelection()\n  let {state} = view\n  // If no state update ends up happening, reset the selection.\n  setTimeout(() => {\n    if (view.state == state) selectionToDOM(view)\n  }, 50)\n}\n\n// : (EditorState, number)\n// Check whether vertical selection motion would involve node\n// selections. If so, apply it (if not, the result is left to the\n// browser)\nfunction selectVertically(view, dir, mods) {\n  let sel = view.state.selection\n  if (sel instanceof TextSelection && !sel.empty || mods.indexOf(\"s\") > -1) return false\n  if (browser.mac && mods.indexOf(\"m\") > -1) return false\n  let {$from, $to} = sel\n\n  if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? \"up\" : \"down\")) {\n    let next = moveSelectionBlock(view.state, dir)\n    if (next && (next instanceof NodeSelection))\n      return apply(view, next)\n  }\n  if (!$from.parent.inlineContent) {\n    let beyond = Selection.findFrom(dir < 0 ? $from : $to, dir)\n    return beyond ? apply(view, beyond) : true\n  }\n  return false\n}\n\nfunction stopNativeHorizontalDelete(view, dir) {\n  if (!(view.state.selection instanceof TextSelection)) return true\n  let {$head, $anchor, empty} = view.state.selection\n  if (!$head.sameParent($anchor)) return true\n  if (!empty) return false\n  if (view.endOfTextblock(dir > 0 ? \"forward\" : \"backward\")) return true\n  let nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter)\n  if (nextNode && !nextNode.isText) {\n    let tr = view.state.tr\n    if (dir < 0) tr.delete($head.pos - nextNode.nodeSize, $head.pos)\n    else tr.delete($head.pos, $head.pos + nextNode.nodeSize)\n    view.dispatch(tr)\n    return true\n  }\n  return false\n}\n\nfunction switchEditable(view, node, state) {\n  view.domObserver.stop()\n  node.contentEditable = state\n  view.domObserver.start()\n}\n\n// Issue #867 / #1090 / https://bugs.chromium.org/p/chromium/issues/detail?id=903821\n// In which Safari (and at some point in the past, Chrome) does really\n// wrong things when the down arrow is pressed when the cursor is\n// directly at the start of a textblock and has an uneditable node\n// after it\nfunction safariDownArrowBug(view) {\n  if (!browser.safari || view.state.selection.$head.parentOffset > 0) return\n  let {focusNode, focusOffset} = view.root.getSelection()\n  if (focusNode && focusNode.nodeType == 1 && focusOffset == 0 &&\n      focusNode.firstChild && focusNode.firstChild.contentEditable == \"false\") {\n    let child = focusNode.firstChild\n    switchEditable(view, child, true)\n    setTimeout(() => switchEditable(view, child, false), 20)\n  }\n}\n\n// A backdrop key mapping used to make sure we always suppress keys\n// that have a dangerous default effect, even if the commands they are\n// bound to return false, and to make sure that cursor-motion keys\n// find a cursor (as opposed to a node selection) when pressed. For\n// cursor-motion keys, the code in the handlers also takes care of\n// block selections.\n\nfunction getMods(event) {\n  let result = \"\"\n  if (event.ctrlKey) result += \"c\"\n  if (event.metaKey) result += \"m\"\n  if (event.altKey) result += \"a\"\n  if (event.shiftKey) result += \"s\"\n  return result\n}\n\nexport function captureKeyDown(view, event) {\n  let code = event.keyCode, mods = getMods(event)\n  if (code == 8 || (browser.mac && code == 72 && mods == \"c\")) { // Backspace, Ctrl-h on Mac\n    return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodesLeft(view)\n  } else if (code == 46 || (browser.mac && code == 68 && mods == \"c\")) { // Delete, Ctrl-d on Mac\n    return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodesRight(view)\n  } else if (code == 13 || code == 27) { // Enter, Esc\n    return true\n  } else if (code == 37) { // Left arrow\n    return selectHorizontally(view, -1, mods) || skipIgnoredNodesLeft(view)\n  } else if (code == 39) { // Right arrow\n    return selectHorizontally(view, 1, mods) || skipIgnoredNodesRight(view)\n  } else if (code == 38) { // Up arrow\n    return selectVertically(view, -1, mods) || skipIgnoredNodesLeft(view)\n  } else if (code == 40) { // Down arrow\n    return safariDownArrowBug(view) || selectVertically(view, 1, mods) || skipIgnoredNodesRight(view)\n  } else if (mods == (browser.mac ? \"m\" : \"c\") &&\n             (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]\n    return true\n  }\n  return false\n}\n","import {Fragment, DOMParser} from \"prosemirror-model\"\nimport {Selection, TextSelection} from \"prosemirror-state\"\n\nimport {selectionBetween, selectionFromDOM, selectionToDOM} from \"./selection\"\nimport {selectionCollapsed, keyEvent} from \"./dom\"\nimport browser from \"./browser\"\n\n// Note that all referencing and parsing is done with the\n// start-of-operation selection and document, since that's the one\n// that the DOM represents. If any changes came in in the meantime,\n// the modification is mapped over those before it is applied, in\n// readDOMChange.\n\nfunction parseBetween(view, from_, to_) {\n  let {node: parent, fromOffset, toOffset, from, to} = view.docView.parseRange(from_, to_)\n\n  let domSel = view.root.getSelection(), find = null, anchor = domSel.anchorNode\n  if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {\n    find = [{node: anchor, offset: domSel.anchorOffset}]\n    if (!selectionCollapsed(domSel))\n      find.push({node: domSel.focusNode, offset: domSel.focusOffset})\n  }\n  // Work around issue in Chrome where backspacing sometimes replaces\n  // the deleted content with a random BR node (issues #799, #831)\n  if (browser.chrome && view.lastKeyCode === 8) {\n    for (let off = toOffset; off > fromOffset; off--) {\n      let node = parent.childNodes[off - 1], desc = node.pmViewDesc\n      if (node.nodeType == \"BR\" && !desc) { toOffset = off; break }\n      if (!desc || desc.size) break\n    }\n  }\n  let startDoc = view.state.doc\n  let parser = view.someProp(\"domParser\") || DOMParser.fromSchema(view.state.schema)\n  let $from = startDoc.resolve(from)\n\n  let sel = null, doc = parser.parse(parent, {\n    topNode: $from.parent,\n    topMatch: $from.parent.contentMatchAt($from.index()),\n    topOpen: true,\n    from: fromOffset,\n    to: toOffset,\n    preserveWhitespace: $from.parent.type.spec.code ? \"full\" : true,\n    editableContent: true,\n    findPositions: find,\n    ruleFromNode,\n    context: $from\n  })\n  if (find && find[0].pos != null) {\n    let anchor = find[0].pos, head = find[1] && find[1].pos\n    if (head == null) head = anchor\n    sel = {anchor: anchor + from, head: head + from}\n  }\n  return {doc, sel, from, to}\n}\n\nfunction ruleFromNode(dom) {\n  let desc = dom.pmViewDesc\n  if (desc) {\n    return desc.parseRule()\n  } else if (dom.nodeName == \"BR\" && dom.parentNode) {\n    // Safari replaces the list item or table cell with a BR\n    // directly in the list node (?!) if you delete the last\n    // character in a list item or table cell (#708, #862)\n    if (browser.safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName)) {\n      let skip = document.createElement(\"div\")\n      skip.appendChild(document.createElement(\"li\"))\n      return {skip}\n    } else if (dom.parentNode.lastChild == dom || browser.safari && /^(tr|table)$/i.test(dom.parentNode.nodeName)) {\n      return {ignore: true}\n    }\n  } else if (dom.nodeName == \"IMG\" && dom.getAttribute(\"mark-placeholder\")) {\n    return {ignore: true}\n  }\n}\n\nexport function readDOMChange(view, from, to, typeOver, addedNodes) {\n  if (from < 0) {\n    let origin = view.lastSelectionTime > Date.now() - 50 ? view.lastSelectionOrigin : null\n    let newSel = selectionFromDOM(view, origin)\n    if (newSel && !view.state.selection.eq(newSel)) {\n      let tr = view.state.tr.setSelection(newSel)\n      if (origin == \"pointer\") tr.setMeta(\"pointer\", true)\n      else if (origin == \"key\") tr.scrollIntoView()\n      view.dispatch(tr)\n    }\n    return\n  }\n\n  let $before = view.state.doc.resolve(from)\n  let shared = $before.sharedDepth(to)\n  from = $before.before(shared + 1)\n  to = view.state.doc.resolve(to).after(shared + 1)\n\n  let sel = view.state.selection\n  let parse = parseBetween(view, from, to)\n\n  let doc = view.state.doc, compare = doc.slice(parse.from, parse.to)\n  let preferredPos, preferredSide\n  // Prefer anchoring to end when Backspace is pressed\n  if (view.lastKeyCode === 8 && Date.now() - 100 < view.lastKeyCodeTime) {\n    preferredPos = view.state.selection.to\n    preferredSide = \"end\"\n  } else {\n    preferredPos = view.state.selection.from\n    preferredSide = \"start\"\n  }\n  view.lastKeyCode = null\n\n  let change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide)\n  if (!change) {\n    if (typeOver && sel instanceof TextSelection && !sel.empty && sel.$head.sameParent(sel.$anchor) &&\n        !view.composing && !(parse.sel && parse.sel.anchor != parse.sel.head)) {\n      change = {start: sel.from, endA: sel.to, endB: sel.to}\n    } else {\n      if (parse.sel) {\n        let sel = resolveSelection(view, view.state.doc, parse.sel)\n        if (sel && !sel.eq(view.state.selection)) view.dispatch(view.state.tr.setSelection(sel))\n      }\n      return\n    }\n  }\n  view.domChangeCount++\n  // Handle the case where overwriting a selection by typing matches\n  // the start or end of the selected content, creating a change\n  // that's smaller than what was actually overwritten.\n  if (view.state.selection.from < view.state.selection.to &&\n      change.start == change.endB &&\n      view.state.selection instanceof TextSelection) {\n    if (change.start > view.state.selection.from && change.start <= view.state.selection.from + 2) {\n      change.start = view.state.selection.from\n    } else if (change.endA < view.state.selection.to && change.endA >= view.state.selection.to - 2) {\n      change.endB += (view.state.selection.to - change.endA)\n      change.endA = view.state.selection.to\n    }\n  }\n\n  // IE11 will insert a non-breaking space _ahead_ of the space after\n  // the cursor space when adding a space before another space. When\n  // that happened, adjust the change to cover the space instead.\n  if (browser.ie && browser.ie_version <= 11 && change.endB == change.start + 1 &&\n      change.endA == change.start && change.start > parse.from &&\n      parse.doc.textBetween(change.start - parse.from - 1, change.start - parse.from + 1) == \" \\u00a0\") {\n    change.start--\n    change.endA--\n    change.endB--\n  }\n\n  let $from = parse.doc.resolveNoCache(change.start - parse.from)\n  let $to = parse.doc.resolveNoCache(change.endB - parse.from)\n  let inlineChange = $from.sameParent($to) && $from.parent.inlineContent\n  let nextSel\n  // If this looks like the effect of pressing Enter (or was recorded\n  // as being an iOS enter press), just dispatch an Enter key instead.\n  if (((browser.ios && view.lastIOSEnter > Date.now() - 225 &&\n        (!inlineChange || addedNodes.some(n => n.nodeName == \"DIV\" || n.nodeName == \"P\"))) ||\n       (!inlineChange && $from.pos < parse.doc.content.size &&\n        (nextSel = Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&\n        nextSel.head == $to.pos)) &&\n      view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")))) {\n    view.lastIOSEnter = 0\n    return\n  }\n  // Same for backspace\n  if (view.state.selection.anchor > change.start &&\n      looksLikeJoin(doc, change.start, change.endA, $from, $to) &&\n      view.someProp(\"handleKeyDown\", f => f(view, keyEvent(8, \"Backspace\")))) {\n    if (browser.android && browser.chrome) view.domObserver.suppressSelectionUpdates() // #820\n    return\n  }\n\n  // This tries to detect Android virtual keyboard\n  // enter-and-pick-suggestion action. That sometimes (see issue\n  // #1059) first fires a DOM mutation, before moving the selection to\n  // the newly created block. And then, because ProseMirror cleans up\n  // the DOM selection, it gives up moving the selection entirely,\n  // leaving the cursor in the wrong place. When that happens, we drop\n  // the new paragraph from the initial change, and fire a simulated\n  // enter key afterwards.\n  if (browser.android && !inlineChange && $from.start() != $to.start() && $to.parentOffset == 0 && $from.depth == $to.depth &&\n      parse.sel && parse.sel.anchor == parse.sel.head && parse.sel.head == change.endA) {\n    change.endB -= 2\n    $to = parse.doc.resolveNoCache(change.endB - parse.from)\n    setTimeout(() => {\n      view.someProp(\"handleKeyDown\", function (f) { return f(view, keyEvent(13, \"Enter\")); })\n    }, 20)\n  }\n\n  let chFrom = change.start, chTo = change.endA\n\n  let tr, storedMarks, markChange, $from1\n  if (inlineChange) {\n    if ($from.pos == $to.pos) { // Deletion\n      // IE11 sometimes weirdly moves the DOM selection around after\n      // backspacing out the first element in a textblock\n      if (browser.ie && browser.ie_version <= 11 && $from.parentOffset == 0) {\n        view.domObserver.suppressSelectionUpdates()\n        setTimeout(() => selectionToDOM(view), 20)\n      }\n      tr = view.state.tr.delete(chFrom, chTo)\n      storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA))\n    } else if ( // Adding or removing a mark\n      change.endA == change.endB && ($from1 = doc.resolve(change.start)) &&\n      (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset),\n                                 $from1.parent.content.cut($from1.parentOffset, change.endA - $from1.start())))\n    ) {\n      tr = view.state.tr\n      if (markChange.type == \"add\") tr.addMark(chFrom, chTo, markChange.mark)\n      else tr.removeMark(chFrom, chTo, markChange.mark)\n    } else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {\n      // Both positions in the same text node -- simply insert text\n      let text = $from.parent.textBetween($from.parentOffset, $to.parentOffset)\n      if (view.someProp(\"handleTextInput\", f => f(view, chFrom, chTo, text))) return\n      tr = view.state.tr.insertText(text, chFrom, chTo)\n    }\n  }\n\n  if (!tr)\n    tr = view.state.tr.replace(chFrom, chTo, parse.doc.slice(change.start - parse.from, change.endB - parse.from))\n  if (parse.sel) {\n    let sel = resolveSelection(view, tr.doc, parse.sel)\n    // Chrome Android will sometimes, during composition, report the\n    // selection in the wrong place. If it looks like that is\n    // happening, don't update the selection.\n    // Edge just doesn't move the cursor forward when you start typing\n    // in an empty block or between br nodes.\n    if (sel && !(browser.chrome && browser.android && view.composing && sel.empty &&\n                   (sel.head == chFrom || sel.head == tr.mapping.map(chTo) - 1) ||\n                 browser.ie && sel.empty && sel.head == chFrom))\n      tr.setSelection(sel)\n  }\n  if (storedMarks) tr.ensureMarks(storedMarks)\n  view.dispatch(tr.scrollIntoView())\n}\n\nfunction resolveSelection(view, doc, parsedSel) {\n  if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size) return null\n  return selectionBetween(view, doc.resolve(parsedSel.anchor), doc.resolve(parsedSel.head))\n}\n\n// : (Fragment, Fragment) → ?{mark: Mark, type: string}\n// Given two same-length, non-empty fragments of inline content,\n// determine whether the first could be created from the second by\n// removing or adding a single mark type.\nfunction isMarkChange(cur, prev) {\n  let curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks\n  let added = curMarks, removed = prevMarks, type, mark, update\n  for (let i = 0; i < prevMarks.length; i++) added = prevMarks[i].removeFromSet(added)\n  for (let i = 0; i < curMarks.length; i++) removed = curMarks[i].removeFromSet(removed)\n  if (added.length == 1 && removed.length == 0) {\n    mark = added[0]\n    type = \"add\"\n    update = node => node.mark(mark.addToSet(node.marks))\n  } else if (added.length == 0 && removed.length == 1) {\n    mark = removed[0]\n    type = \"remove\"\n    update = node => node.mark(mark.removeFromSet(node.marks))\n  } else {\n    return null\n  }\n  let updated = []\n  for (let i = 0; i < prev.childCount; i++) updated.push(update(prev.child(i)))\n  if (Fragment.from(updated).eq(cur)) return {mark, type}\n}\n\nfunction looksLikeJoin(old, start, end, $newStart, $newEnd) {\n  if (!$newStart.parent.isTextblock ||\n      // The content must have shrunk\n      end - start <= $newEnd.pos - $newStart.pos ||\n      // newEnd must point directly at or after the end of the block that newStart points into\n      skipClosingAndOpening($newStart, true, false) < $newEnd.pos)\n    return false\n\n  let $start = old.resolve(start)\n  // Start must be at the end of a block\n  if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock)\n    return false\n  let $next = old.resolve(skipClosingAndOpening($start, true, true))\n  // The next textblock must start before end and end near it\n  if (!$next.parent.isTextblock || $next.pos > end ||\n      skipClosingAndOpening($next, true, false) < end)\n    return false\n\n  // The fragments after the join point must match\n  return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content)\n}\n\nfunction skipClosingAndOpening($pos, fromEnd, mayOpen) {\n  let depth = $pos.depth, end = fromEnd ? $pos.end() : $pos.pos\n  while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {\n    depth--\n    end++\n    fromEnd = false\n  }\n  if (mayOpen) {\n    let next = $pos.node(depth).maybeChild($pos.indexAfter(depth))\n    while (next && !next.isLeaf) {\n      next = next.firstChild\n      end++\n    }\n  }\n  return end\n}\n\nfunction findDiff(a, b, pos, preferredPos, preferredSide) {\n  let start = a.findDiffStart(b, pos)\n  if (start == null) return null\n  let {a: endA, b: endB} = a.findDiffEnd(b, pos + a.size, pos + b.size)\n  if (preferredSide == \"end\") {\n    let adjust = Math.max(0, start - Math.min(endA, endB))\n    preferredPos -= endA + adjust - start\n  }\n  if (endA < start && a.size < b.size) {\n    let move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0\n    start -= move\n    endB = start + (endB - endA)\n    endA = start\n  } else if (endB < start) {\n    let move = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0\n    start -= move\n    endA = start + (endA - endB)\n    endB = start\n  }\n  return {start, endA, endB}\n}\n","import {Slice, Fragment, DOMParser, DOMSerializer} from \"prosemirror-model\"\n\nexport function serializeForClipboard(view, slice) {\n  let context = [], {content, openStart, openEnd} = slice\n  while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {\n    openStart--\n    openEnd--\n    let node = content.firstChild\n    context.push(node.type.name, node.attrs != node.type.defaultAttrs ? node.attrs : null)\n    content = node.content\n  }\n\n  let serializer = view.someProp(\"clipboardSerializer\") || DOMSerializer.fromSchema(view.state.schema)\n  let doc = detachedDoc(), wrap = doc.createElement(\"div\")\n  wrap.appendChild(serializer.serializeFragment(content, {document: doc}))\n\n  let firstChild = wrap.firstChild, needsWrap\n  while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {\n    for (let i = needsWrap.length - 1; i >= 0; i--) {\n      let wrapper = doc.createElement(needsWrap[i])\n      while (wrap.firstChild) wrapper.appendChild(wrap.firstChild)\n      wrap.appendChild(wrapper)\n    }\n    firstChild = wrap.firstChild\n  }\n\n  if (firstChild && firstChild.nodeType == 1)\n    firstChild.setAttribute(\"data-pm-slice\", `${openStart} ${openEnd} ${JSON.stringify(context)}`)\n\n  let text = view.someProp(\"clipboardTextSerializer\", f => f(slice)) ||\n      slice.content.textBetween(0, slice.content.size, \"\\n\\n\")\n\n  return {dom: wrap, text}\n}\n\n// : (EditorView, string, string, ?bool, ResolvedPos) → ?Slice\n// Read a slice of content from the clipboard (or drop data).\nexport function parseFromClipboard(view, text, html, plainText, $context) {\n  let dom, inCode = $context.parent.type.spec.code, slice\n  if (!html && !text) return null\n  let asText = text && (plainText || inCode || !html)\n  if (asText) {\n    view.someProp(\"transformPastedText\", f => { text = f(text, inCode || plainText) })\n    if (inCode) return new Slice(Fragment.from(view.state.schema.text(text)), 0, 0)\n    let parsed = view.someProp(\"clipboardTextParser\", f => f(text, $context, plainText))\n    if (parsed) {\n      slice = parsed\n    } else {\n      dom = document.createElement(\"div\")\n      text.trim().split(/(?:\\r\\n?|\\n)+/).forEach(block => {\n        dom.appendChild(document.createElement(\"p\")).textContent = block\n      })\n    }\n  } else {\n    view.someProp(\"transformPastedHTML\", f => { html = f(html) })\n    dom = readHTML(html)\n  }\n\n  let contextNode = dom && dom.querySelector(\"[data-pm-slice]\")\n  let sliceData = contextNode && /^(\\d+) (\\d+) (.*)/.exec(contextNode.getAttribute(\"data-pm-slice\"))\n  if (!slice) {\n    let parser = view.someProp(\"clipboardParser\") || view.someProp(\"domParser\") || DOMParser.fromSchema(view.state.schema)\n    slice = parser.parseSlice(dom, {preserveWhitespace: !!(asText || sliceData), context: $context})\n  }\n  if (sliceData)\n    slice = addContext(closeSlice(slice, +sliceData[1], +sliceData[2]), sliceData[3])\n  else // HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent\n    slice = Slice.maxOpen(normalizeSiblings(slice.content, $context), false)\n\n  view.someProp(\"transformPasted\", f => { slice = f(slice) })\n  return slice\n}\n\n// Takes a slice parsed with parseSlice, which means there hasn't been\n// any content-expression checking done on the top nodes, tries to\n// find a parent node in the current context that might fit the nodes,\n// and if successful, rebuilds the slice so that it fits into that parent.\n//\n// This addresses the problem that Transform.replace expects a\n// coherent slice, and will fail to place a set of siblings that don't\n// fit anywhere in the schema.\nfunction normalizeSiblings(fragment, $context) {\n  if (fragment.childCount < 2) return fragment\n  for (let d = $context.depth; d >= 0; d--) {\n    let parent = $context.node(d)\n    let match = parent.contentMatchAt($context.index(d))\n    let lastWrap, result = []\n    fragment.forEach(node => {\n      if (!result) return\n      let wrap = match.findWrapping(node.type), inLast\n      if (!wrap) return result = null\n      if (inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0)) {\n        result[result.length - 1] = inLast\n      } else {\n        if (result.length) result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length)\n        let wrapped = withWrappers(node, wrap)\n        result.push(wrapped)\n        match = match.matchType(wrapped.type, wrapped.attrs)\n        lastWrap = wrap\n      }\n    })\n    if (result) return Fragment.from(result)\n  }\n  return fragment\n}\n\nfunction withWrappers(node, wrap, from = 0) {\n  for (let i = wrap.length - 1; i >= from; i--)\n    node = wrap[i].create(null, Fragment.from(node))\n  return node\n}\n\n// Used to group adjacent nodes wrapped in similar parents by\n// normalizeSiblings into the same parent node\nfunction addToSibling(wrap, lastWrap, node, sibling, depth) {\n  if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {\n    let inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1)\n    if (inner) return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner))\n    let match = sibling.contentMatchAt(sibling.childCount)\n    if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1]))\n      return sibling.copy(sibling.content.append(Fragment.from(withWrappers(node, wrap, depth + 1))))\n  }\n}\n\nfunction closeRight(node, depth) {\n  if (depth == 0) return node\n  let fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1))\n  let fill = node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true)\n  return node.copy(fragment.append(fill))\n}\n\nfunction closeRange(fragment, side, from, to, depth, openEnd) {\n  let node = side < 0 ? fragment.firstChild : fragment.lastChild, inner = node.content\n  if (depth < to - 1) inner = closeRange(inner, side, from, to, depth + 1, openEnd)\n  if (depth >= from)\n    inner = side < 0 ? node.contentMatchAt(0).fillBefore(inner, fragment.childCount > 1 || openEnd <= depth).append(inner)\n      : inner.append(node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true))\n  return fragment.replaceChild(side < 0 ? 0 : fragment.childCount - 1, node.copy(inner))\n}\n\nfunction closeSlice(slice, openStart, openEnd) {\n  if (openStart < slice.openStart)\n    slice = new Slice(closeRange(slice.content, -1, openStart, slice.openStart, 0, slice.openEnd), openStart, slice.openEnd)\n  if (openEnd < slice.openEnd)\n    slice = new Slice(closeRange(slice.content, 1, openEnd, slice.openEnd, 0, 0), slice.openStart, openEnd)\n  return slice\n}\n\n// Trick from jQuery -- some elements must be wrapped in other\n// elements for innerHTML to work. I.e. if you do `div.innerHTML =\n// \"<td>..</td>\"` the table cells are ignored.\nconst wrapMap = {\n  thead: [\"table\"],\n  tbody: [\"table\"],\n  tfoot: [\"table\"],\n  caption: [\"table\"],\n  colgroup: [\"table\"],\n  col: [\"table\", \"colgroup\"],\n  tr: [\"table\", \"tbody\"],\n  td: [\"table\", \"tbody\", \"tr\"],\n  th: [\"table\", \"tbody\", \"tr\"]\n}\n\nlet _detachedDoc = null\nfunction detachedDoc() {\n  return _detachedDoc || (_detachedDoc = document.implementation.createHTMLDocument(\"title\"))\n}\n\nfunction readHTML(html) {\n  let metas = /(\\s*<meta [^>]*>)*/.exec(html)\n  if (metas) html = html.slice(metas[0].length)\n  let elt = detachedDoc().createElement(\"div\")\n  let firstTag = /(?:<meta [^>]*>)*<([a-z][^>\\s]+)/i.exec(html), wrap, depth = 0\n  if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()]) {\n    html = wrap.map(n => \"<\" + n + \">\").join(\"\") + html + wrap.map(n => \"</\" + n + \">\").reverse().join(\"\")\n    depth = wrap.length\n  }\n  elt.innerHTML = html\n  for (let i = 0; i < depth; i++) elt = elt.firstChild\n  return elt\n}\n\nfunction addContext(slice, context) {\n  if (!slice.size) return slice\n  let schema = slice.content.firstChild.type.schema, array\n  try { array = JSON.parse(context) }\n  catch(e) { return slice }\n  let {content, openStart, openEnd} = slice\n  for (let i = array.length - 2; i >= 0; i -= 2) {\n    let type = schema.nodes[array[i]]\n    if (!type || type.hasRequiredAttrs()) break\n    content = Fragment.from(type.create(array[i + 1], content))\n    openStart++; openEnd++\n  }\n  return new Slice(content, openStart, openEnd)\n}\n","import browser from \"./browser\"\nimport {domIndex, isEquivalentPosition} from \"./dom\"\nimport {hasFocusAndSelection, hasSelection, selectionToDOM} from \"./selection\"\n\nconst observeOptions = {\n  childList: true,\n  characterData: true,\n  characterDataOldValue: true,\n  attributes: true,\n  attributeOldValue: true,\n  subtree: true\n}\n// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified\nconst useCharData = browser.ie && browser.ie_version <= 11\n\nclass SelectionState {\n  constructor() {\n    this.anchorNode = this.anchorOffset = this.focusNode = this.focusOffset = null\n  }\n\n  set(sel) {\n    this.anchorNode = sel.anchorNode; this.anchorOffset = sel.anchorOffset\n    this.focusNode = sel.focusNode; this.focusOffset = sel.focusOffset\n  }\n\n  eq(sel) {\n    return sel.anchorNode == this.anchorNode && sel.anchorOffset == this.anchorOffset &&\n      sel.focusNode == this.focusNode && sel.focusOffset == this.focusOffset\n  }\n}\n\nexport class DOMObserver {\n  constructor(view, handleDOMChange) {\n    this.view = view\n    this.handleDOMChange = handleDOMChange\n    this.queue = []\n    this.flushingSoon = -1\n    this.observer = window.MutationObserver &&\n      new window.MutationObserver(mutations => {\n        for (let i = 0; i < mutations.length; i++) this.queue.push(mutations[i])\n        // IE11 will sometimes (on backspacing out a single character\n        // text node after a BR node) call the observer callback\n        // before actually updating the DOM, which will cause\n        // ProseMirror to miss the change (see #930)\n        if (browser.ie && browser.ie_version <= 11 && mutations.some(\n          m => m.type == \"childList\" && m.removedNodes.length ||\n               m.type == \"characterData\" && m.oldValue.length > m.target.nodeValue.length))\n          this.flushSoon()\n        else\n          this.flush()\n      })\n    this.currentSelection = new SelectionState\n    if (useCharData) {\n      this.onCharData = e => {\n        this.queue.push({target: e.target, type: \"characterData\", oldValue: e.prevValue})\n        this.flushSoon()\n      }\n    }\n    this.onSelectionChange = this.onSelectionChange.bind(this)\n    this.suppressingSelectionUpdates = false\n  }\n\n  flushSoon() {\n    if (this.flushingSoon < 0)\n      this.flushingSoon = window.setTimeout(() => { this.flushingSoon = -1; this.flush() }, 20)\n  }\n\n  forceFlush() {\n    if (this.flushingSoon > -1) {\n      window.clearTimeout(this.flushingSoon)\n      this.flushingSoon = -1\n      this.flush()\n    }\n  }\n\n  start() {\n    if (this.observer)\n      this.observer.observe(this.view.dom, observeOptions)\n    if (useCharData)\n      this.view.dom.addEventListener(\"DOMCharacterDataModified\", this.onCharData)\n    this.connectSelection()\n  }\n\n  stop() {\n    if (this.observer) {\n      let take = this.observer.takeRecords()\n      if (take.length) {\n        for (let i = 0; i < take.length; i++) this.queue.push(take[i])\n        window.setTimeout(() => this.flush(), 20)\n      }\n      this.observer.disconnect()\n    }\n    if (useCharData) this.view.dom.removeEventListener(\"DOMCharacterDataModified\", this.onCharData)\n    this.disconnectSelection()\n  }\n\n  connectSelection() {\n    this.view.dom.ownerDocument.addEventListener(\"selectionchange\", this.onSelectionChange)\n  }\n\n  disconnectSelection() {\n    this.view.dom.ownerDocument.removeEventListener(\"selectionchange\", this.onSelectionChange)\n  }\n\n  suppressSelectionUpdates() {\n    this.suppressingSelectionUpdates = true\n    setTimeout(() => this.suppressingSelectionUpdates = false, 50)\n  }\n\n  onSelectionChange() {\n    if (!hasFocusAndSelection(this.view)) return\n    if (this.suppressingSelectionUpdates) return selectionToDOM(this.view)\n    // Deletions on IE11 fire their events in the wrong order, giving\n    // us a selection change event before the DOM changes are\n    // reported.\n    if (browser.ie && browser.ie_version <= 11 && !this.view.state.selection.empty) {\n      let sel = this.view.root.getSelection()\n      // Selection.isCollapsed isn't reliable on IE\n      if (sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset))\n        return this.flushSoon()\n    }\n    this.flush()\n  }\n\n  setCurSelection() {\n    this.currentSelection.set(this.view.root.getSelection())\n  }\n\n  ignoreSelectionChange(sel) {\n    if (sel.rangeCount == 0) return true\n    let container = sel.getRangeAt(0).commonAncestorContainer\n    let desc = this.view.docView.nearestDesc(container)\n    if (desc && desc.ignoreMutation({type: \"selection\", target: container.nodeType == 3 ? container.parentNode : container})) {\n      this.setCurSelection()\n      return true\n    }\n  }\n\n  flush() {\n    if (!this.view.docView || this.flushingSoon > -1) return\n    let mutations = this.observer ? this.observer.takeRecords() : []\n    if (this.queue.length) {\n      mutations = this.queue.concat(mutations)\n      this.queue.length = 0\n    }\n\n    let sel = this.view.root.getSelection()\n    let newSel = !this.suppressingSelectionUpdates && !this.currentSelection.eq(sel) && hasSelection(this.view) && !this.ignoreSelectionChange(sel)\n\n    let from = -1, to = -1, typeOver = false, added = []\n    if (this.view.editable) {\n      for (let i = 0; i < mutations.length; i++) {\n        let result = this.registerMutation(mutations[i], added)\n        if (result) {\n          from = from < 0 ? result.from : Math.min(result.from, from)\n          to = to < 0 ? result.to : Math.max(result.to, to)\n          if (result.typeOver) typeOver = true\n        }\n      }\n    }\n\n    if (browser.gecko && added.length > 1) {\n      let brs = added.filter(n => n.nodeName == \"BR\")\n      if (brs.length == 2) {\n        let [a, b] = brs\n        if (a.parentNode && a.parentNode.parentNode == b.parentNode) b.remove()\n        else a.remove()\n      }\n    }\n\n    if (from > -1 || newSel) {\n      if (from > -1) {\n        this.view.docView.markDirty(from, to)\n        checkCSS(this.view)\n      }\n      this.handleDOMChange(from, to, typeOver, added)\n      if (this.view.docView.dirty) this.view.updateState(this.view.state)\n      else if (!this.currentSelection.eq(sel)) selectionToDOM(this.view)\n    }\n  }\n\n  registerMutation(mut, added) {\n    // Ignore mutations inside nodes that were already noted as inserted\n    if (added.indexOf(mut.target) > -1) return null\n    let desc = this.view.docView.nearestDesc(mut.target)\n    if (mut.type == \"attributes\" &&\n        (desc == this.view.docView || mut.attributeName == \"contenteditable\" ||\n         // Firefox sometimes fires spurious events for null/empty styles\n         (mut.attributeName == \"style\" && !mut.oldValue && !mut.target.getAttribute(\"style\"))))\n      return null\n    if (!desc || desc.ignoreMutation(mut)) return null\n\n    if (mut.type == \"childList\") {\n      let prev = mut.previousSibling, next = mut.nextSibling\n      if (browser.ie && browser.ie_version <= 11 && mut.addedNodes.length) {\n        // IE11 gives us incorrect next/prev siblings for some\n        // insertions, so if there are added nodes, recompute those\n        for (let i = 0; i < mut.addedNodes.length; i++) {\n          let {previousSibling, nextSibling} = mut.addedNodes[i]\n          if (!previousSibling || Array.prototype.indexOf.call(mut.addedNodes, previousSibling) < 0) prev = previousSibling\n          if (!nextSibling || Array.prototype.indexOf.call(mut.addedNodes, nextSibling) < 0) next = nextSibling\n        }\n      }\n      let fromOffset = prev && prev.parentNode == mut.target\n          ? domIndex(prev) + 1 : 0\n      let from = desc.localPosFromDOM(mut.target, fromOffset, -1)\n      let toOffset = next && next.parentNode == mut.target\n          ? domIndex(next) : mut.target.childNodes.length\n      for (let i = 0; i < mut.addedNodes.length; i++) added.push(mut.addedNodes[i])\n      let to = desc.localPosFromDOM(mut.target, toOffset, 1)\n      return {from, to}\n    } else if (mut.type == \"attributes\") {\n      return {from: desc.posAtStart - desc.border, to: desc.posAtEnd + desc.border}\n    } else { // \"characterData\"\n      return {\n        from: desc.posAtStart,\n        to: desc.posAtEnd,\n        // An event was generated for a text change that didn't change\n        // any text. Mark the dom change to fall back to assuming the\n        // selection was typed over with an identical value if it can't\n        // find another change.\n        typeOver: mut.target.nodeValue == mut.oldValue\n      }\n    }\n  }\n}\n\nlet cssChecked = false\n\nfunction checkCSS(view) {\n  if (cssChecked) return\n  cssChecked = true\n  if (getComputedStyle(view.dom).whiteSpace == \"normal\")\n    console[\"warn\"](\"ProseMirror expects the CSS white-space property to be set, preferably to 'pre-wrap'. It is recommended to load style/prosemirror.css from the prosemirror-view package.\")\n}\n","// This file defines a number of helpers for wiring up user input to\n// table-related functionality.\n\nimport {Slice, Fragment} from \"prosemirror-model\"\nimport {Selection, TextSelection} from \"prosemirror-state\"\nimport {keydownHandler} from \"prosemirror-keymap\"\n\nimport {key, nextCell, cellAround, inSameTable,\n        isInTable, selectionCell} from \"./util\"\nimport {CellSelection} from \"./cellselection\"\nimport {TableMap} from \"./tablemap\"\nimport {pastedCells, fitSlice, clipCells, insertCells} from \"./copypaste\"\nimport {tableNodeTypes} from \"./schema\"\n\nexport const handleKeyDown = keydownHandler({\n  \"ArrowLeft\": arrow(\"horiz\", -1),\n  \"ArrowRight\": arrow(\"horiz\", 1),\n  \"ArrowUp\": arrow(\"vert\", -1),\n  \"ArrowDown\": arrow(\"vert\", 1),\n\n  \"Shift-ArrowLeft\": shiftArrow(\"horiz\", -1),\n  \"Shift-ArrowRight\": shiftArrow(\"horiz\", 1),\n  \"Shift-ArrowUp\": shiftArrow(\"vert\", -1),\n  \"Shift-ArrowDown\": shiftArrow(\"vert\", 1),\n\n  \"Backspace\": deleteCellSelection,\n  \"Mod-Backspace\": deleteCellSelection,\n  \"Delete\": deleteCellSelection,\n  \"Mod-Delete\": deleteCellSelection\n})\n\nfunction maybeSetSelection(state, dispatch, selection) {\n  if (selection.eq(state.selection)) return false\n  if (dispatch) dispatch(state.tr.setSelection(selection).scrollIntoView())\n  return true\n}\n\nfunction arrow(axis, dir) {\n  return (state, dispatch, view) => {\n    let sel = state.selection\n    if (sel instanceof CellSelection) {\n      return maybeSetSelection(state, dispatch, Selection.near(sel.$headCell, dir))\n    }\n    if (axis != \"horiz\" && !sel.empty) return false\n    let end = atEndOfCell(view, axis, dir)\n    if (end == null) return false\n    if (axis == \"horiz\") {\n      return maybeSetSelection(state, dispatch, Selection.near(state.doc.resolve(sel.head + dir), dir))\n    } else {\n      let $cell = state.doc.resolve(end), $next = nextCell($cell, axis, dir), newSel\n      if ($next) newSel = Selection.near($next, 1)\n      else if (dir < 0) newSel = Selection.near(state.doc.resolve($cell.before(-1)), -1)\n      else newSel = Selection.near(state.doc.resolve($cell.after(-1)), 1)\n      return maybeSetSelection(state, dispatch, newSel)\n    }\n  }\n}\n\nfunction shiftArrow(axis, dir) {\n  return (state, dispatch, view) => {\n    let sel = state.selection\n    if (!(sel instanceof CellSelection)) {\n      let end = atEndOfCell(view, axis, dir)\n      if (end == null) return false\n      sel = new CellSelection(state.doc.resolve(end))\n    }\n    let $head = nextCell(sel.$headCell, axis, dir)\n    if (!$head) return false\n    return maybeSetSelection(state, dispatch, new CellSelection(sel.$anchorCell, $head))\n  }\n}\n\nfunction deleteCellSelection(state, dispatch) {\n  let sel = state.selection\n  if (!(sel instanceof CellSelection)) return false\n  if (dispatch) {\n    let tr = state.tr, baseContent = tableNodeTypes(state.schema).cell.createAndFill().content\n    sel.forEachCell((cell, pos) => {\n      if (!cell.content.eq(baseContent))\n        tr.replace(tr.mapping.map(pos + 1), tr.mapping.map(pos + cell.nodeSize - 1),\n                   new Slice(baseContent, 0, 0))\n    })\n    if (tr.docChanged) dispatch(tr)\n  }\n  return true\n}\n\nexport function handleTripleClick(view, pos) {\n  let doc = view.state.doc, $cell = cellAround(doc.resolve(pos))\n  if (!$cell) return false\n  view.dispatch(view.state.tr.setSelection(new CellSelection($cell)))\n  return true\n}\n\nexport function handlePaste(view, _, slice) {\n  if (!isInTable(view.state)) return false\n  let cells = pastedCells(slice), sel = view.state.selection\n  if (sel instanceof CellSelection) {\n    if (!cells) cells = {width: 1, height: 1, rows: [Fragment.from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]}\n    let table = sel.$anchorCell.node(-1), start = sel.$anchorCell.start(-1)\n    let rect = TableMap.get(table).rectBetween(sel.$anchorCell.pos - start, sel.$headCell.pos - start)\n    cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top)\n    insertCells(view.state, view.dispatch, start, rect, cells)\n    return true\n  } else if (cells) {\n    let $cell = selectionCell(view.state), start = $cell.start(-1)\n    insertCells(view.state, view.dispatch, start, TableMap.get($cell.node(-1)).findCell($cell.pos - start), cells)\n    return true\n  } else {\n    return false\n  }\n}\n\nexport function handleMouseDown(view, startEvent) {\n  if (startEvent.ctrlKey || startEvent.metaKey) return\n\n  let startDOMCell = domInCell(view, startEvent.target), $anchor\n  if (startEvent.shiftKey && (view.state.selection instanceof CellSelection)) {\n    // Adding to an existing cell selection\n    setCellSelection(view.state.selection.$anchorCell, startEvent)\n    startEvent.preventDefault()\n  } else if (startEvent.shiftKey && startDOMCell &&\n             ($anchor = cellAround(view.state.selection.$anchor)) != null &&\n             cellUnderMouse(view, startEvent).pos != $anchor.pos) {\n    // Adding to a selection that starts in another cell (causing a\n    // cell selection to be created).\n    setCellSelection($anchor, startEvent)\n    startEvent.preventDefault()\n  } else if (!startDOMCell) {\n    // Not in a cell, let the default behavior happen.\n    return\n  }\n\n  // Create and dispatch a cell selection between the given anchor and\n  // the position under the mouse.\n  function setCellSelection($anchor, event) {\n    let $head = cellUnderMouse(view, event)\n    let starting = key.getState(view.state) == null\n    if (!$head || !inSameTable($anchor, $head)) {\n      if (starting) $head = $anchor\n      else return\n    }\n    let selection = new CellSelection($anchor, $head)\n    if (starting || !view.state.selection.eq(selection)) {\n      let tr = view.state.tr.setSelection(selection)\n      if (starting) tr.setMeta(key, $anchor.pos)\n      view.dispatch(tr)\n    }\n  }\n\n  // Stop listening to mouse motion events.\n  function stop() {\n    view.root.removeEventListener(\"mouseup\", stop)\n    view.root.removeEventListener(\"dragstart\", stop)\n    view.root.removeEventListener(\"mousemove\", move)\n    if (key.getState(view.state) != null) view.dispatch(view.state.tr.setMeta(key, -1))\n  }\n\n  function move(event) {\n    let anchor = key.getState(view.state), $anchor\n    if (anchor != null) {\n      // Continuing an existing cross-cell selection\n      $anchor = view.state.doc.resolve(anchor)\n    } else if (domInCell(view, event.target) != startDOMCell) {\n      // Moving out of the initial cell -- start a new cell selection\n      $anchor = cellUnderMouse(view, startEvent)\n      if (!$anchor) return stop()\n    }\n    if ($anchor) setCellSelection($anchor, event)\n  }\n  view.root.addEventListener(\"mouseup\", stop)\n  view.root.addEventListener(\"dragstart\", stop)\n  view.root.addEventListener(\"mousemove\", move)\n}\n\n// Check whether the cursor is at the end of a cell (so that further\n// motion would move out of the cell)\nfunction atEndOfCell(view, axis, dir) {\n  if (!(view.state.selection instanceof TextSelection)) return null\n  let {$head} = view.state.selection\n  for (let d = $head.depth - 1; d >= 0; d--) {\n    let parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d)\n    if (index != (dir < 0 ? 0 : parent.childCount)) return null\n    if (parent.type.spec.tableRole == \"cell\" || parent.type.spec.tableRole == \"header_cell\") {\n      let cellPos = $head.before(d)\n      let dirStr = axis == \"vert\" ? (dir > 0 ? \"down\" : \"up\") : (dir > 0 ? \"right\" : \"left\")\n      return view.endOfTextblock(dirStr) ? cellPos : null\n    }\n  }\n  return null\n}\n\nfunction domInCell(view, dom) {\n  for (; dom && dom != view.dom; dom = dom.parentNode)\n    if (dom.nodeName == \"TD\" || dom.nodeName == \"TH\") return dom\n}\n\nfunction cellUnderMouse(view, event) {\n  let mousePos = view.posAtCoords({left: event.clientX, top: event.clientY})\n  if (!mousePos) return null\n  return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null\n}\n","function compareObjs(a, b) {\n  if (a == b) return true\n  for (let p in a) if (a[p] !== b[p]) return false\n  for (let p in b) if (!(p in a)) return false\n  return true\n}\n\nclass WidgetType {\n  constructor(toDOM, spec) {\n    this.spec = spec || noSpec\n    this.side = this.spec.side || 0\n    this.toDOM = toDOM\n  }\n\n  map(mapping, span, offset, oldOffset) {\n    let {pos, deleted} = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1)\n    return deleted ? null : new Decoration(pos - offset, pos - offset, this)\n  }\n\n  valid() { return true }\n\n  eq(other) {\n    return this == other ||\n      (other instanceof WidgetType &&\n       (this.spec.key && this.spec.key == other.spec.key ||\n        this.toDOM == other.toDOM && compareObjs(this.spec, other.spec)))\n  }\n}\n\nclass InlineType {\n  constructor(attrs, spec) {\n    this.spec = spec || noSpec\n    this.attrs = attrs\n  }\n\n  map(mapping, span, offset, oldOffset) {\n    let from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset\n    let to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset\n    return from >= to ? null : new Decoration(from, to, this)\n  }\n\n  valid(_, span) { return span.from < span.to }\n\n  eq(other) {\n    return this == other ||\n      (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&\n       compareObjs(this.spec, other.spec))\n  }\n\n  static is(span) { return span.type instanceof InlineType }\n}\n\nclass NodeType {\n  constructor(attrs, spec) {\n    this.spec = spec || noSpec\n    this.attrs = attrs\n  }\n\n  map(mapping, span, offset, oldOffset) {\n    let from = mapping.mapResult(span.from + oldOffset, 1)\n    if (from.deleted) return null\n    let to = mapping.mapResult(span.to + oldOffset, -1)\n    if (to.deleted || to.pos <= from.pos) return null\n    return new Decoration(from.pos - offset, to.pos - offset, this)\n  }\n\n  valid(node, span) {\n    let {index, offset} = node.content.findIndex(span.from)\n    return offset == span.from && offset + node.child(index).nodeSize == span.to\n  }\n\n  eq(other) {\n    return this == other ||\n      (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&\n       compareObjs(this.spec, other.spec))\n  }\n}\n\n// ::- Decoration objects can be provided to the view through the\n// [`decorations` prop](#view.EditorProps.decorations). They come in\n// several variants—see the static members of this class for details.\nexport class Decoration {\n  constructor(from, to, type) {\n    // :: number\n    // The start position of the decoration.\n    this.from = from\n    // :: number\n    // The end position. Will be the same as `from` for [widget\n    // decorations](#view.Decoration^widget).\n    this.to = to\n    this.type = type\n  }\n\n  copy(from, to) {\n    return new Decoration(from, to, this.type)\n  }\n\n  eq(other, offset = 0) {\n    return this.type.eq(other.type) && this.from + offset == other.from && this.to + offset == other.to\n  }\n\n  map(mapping, offset, oldOffset) {\n    return this.type.map(mapping, this, offset, oldOffset)\n  }\n\n  // :: (number, union<(view: EditorView, getPos: () → number) → dom.Node, dom.Node>, ?Object) → Decoration\n  // Creates a widget decoration, which is a DOM node that's shown in\n  // the document at the given position. It is recommended that you\n  // delay rendering the widget by passing a function that will be\n  // called when the widget is actually drawn in a view, but you can\n  // also directly pass a DOM node. `getPos` can be used to find the\n  // widget's current document position.\n  //\n  //   spec::- These options are supported:\n  //\n  //     side:: ?number\n  //     Controls which side of the document position this widget is\n  //     associated with. When negative, it is drawn before a cursor\n  //     at its position, and content inserted at that position ends\n  //     up after the widget. When zero (the default) or positive, the\n  //     widget is drawn after the cursor and content inserted there\n  //     ends up before the widget.\n  //\n  //     When there are multiple widgets at a given position, their\n  //     `side` values determine the order in which they appear. Those\n  //     with lower values appear first. The ordering of widgets with\n  //     the same `side` value is unspecified.\n  //\n  //     When `marks` is null, `side` also determines the marks that\n  //     the widget is wrapped in—those of the node before when\n  //     negative, those of the node after when positive.\n  //\n  //     marks:: ?[Mark]\n  //     The precise set of marks to draw around the widget.\n  //\n  //     stopEvent:: ?(event: dom.Event) → bool\n  //     Can be used to control which DOM events, when they bubble out\n  //     of this widget, the editor view should ignore.\n  //\n  //     ignoreSelection:: ?bool\n  //     When set (defaults to false), selection changes inside the\n  //     widget are ignored, and don't cause ProseMirror to try and\n  //     re-sync the selection with its selection state.\n  //\n  //     key:: ?string\n  //     When comparing decorations of this type (in order to decide\n  //     whether it needs to be redrawn), ProseMirror will by default\n  //     compare the widget DOM node by identity. If you pass a key,\n  //     that key will be compared instead, which can be useful when\n  //     you generate decorations on the fly and don't want to store\n  //     and reuse DOM nodes. Make sure that any widgets with the same\n  //     key are interchangeable—if widgets differ in, for example,\n  //     the behavior of some event handler, they should get\n  //     different keys.\n  static widget(pos, toDOM, spec) {\n    return new Decoration(pos, pos, new WidgetType(toDOM, spec))\n  }\n\n  // :: (number, number, DecorationAttrs, ?Object) → Decoration\n  // Creates an inline decoration, which adds the given attributes to\n  // each inline node between `from` and `to`.\n  //\n  //   spec::- These options are recognized:\n  //\n  //     inclusiveStart:: ?bool\n  //     Determines how the left side of the decoration is\n  //     [mapped](#transform.Position_Mapping) when content is\n  //     inserted directly at that position. By default, the decoration\n  //     won't include the new content, but you can set this to `true`\n  //     to make it inclusive.\n  //\n  //     inclusiveEnd:: ?bool\n  //     Determines how the right side of the decoration is mapped.\n  //     See\n  //     [`inclusiveStart`](#view.Decoration^inline^spec.inclusiveStart).\n  static inline(from, to, attrs, spec) {\n    return new Decoration(from, to, new InlineType(attrs, spec))\n  }\n\n  // :: (number, number, DecorationAttrs, ?Object) → Decoration\n  // Creates a node decoration. `from` and `to` should point precisely\n  // before and after a node in the document. That node, and only that\n  // node, will receive the given attributes.\n  //\n  //   spec::-\n  //\n  //   Optional information to store with the decoration. It\n  //   is also used when comparing decorators for equality.\n  static node(from, to, attrs, spec) {\n    return new Decoration(from, to, new NodeType(attrs, spec))\n  }\n\n  // :: Object\n  // The spec provided when creating this decoration. Can be useful\n  // if you've stored extra information in that object.\n  get spec() { return this.type.spec }\n\n  get inline() { return this.type instanceof InlineType }\n}\n\n// DecorationAttrs:: interface\n// A set of attributes to add to a decorated node. Most properties\n// simply directly correspond to DOM attributes of the same name,\n// which will be set to the property's value. These are exceptions:\n//\n//   class:: ?string\n//   A CSS class name or a space-separated set of class names to be\n//   _added_ to the classes that the node already had.\n//\n//   style:: ?string\n//   A string of CSS to be _added_ to the node's existing `style` property.\n//\n//   nodeName:: ?string\n//   When non-null, the target node is wrapped in a DOM element of\n//   this type (and the other attributes are applied to this element).\n\nconst none = [], noSpec = {}\n\n// ::- A collection of [decorations](#view.Decoration), organized in\n// such a way that the drawing algorithm can efficiently use and\n// compare them. This is a persistent data structure—it is not\n// modified, updates create a new value.\nexport class DecorationSet {\n  constructor(local, children) {\n    this.local = local && local.length ? local : none\n    this.children = children && children.length ? children : none\n  }\n\n  // :: (Node, [Decoration]) → DecorationSet\n  // Create a set of decorations, using the structure of the given\n  // document.\n  static create(doc, decorations) {\n    return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty\n  }\n\n  // :: (?number, ?number, ?(spec: Object) → bool) → [Decoration]\n  // Find all decorations in this set which touch the given range\n  // (including decorations that start or end directly at the\n  // boundaries) and match the given predicate on their spec. When\n  // `start` and `end` are omitted, all decorations in the set are\n  // considered. When `predicate` isn't given, all decorations are\n  // assumed to match.\n  find(start, end, predicate) {\n    let result = []\n    this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate)\n    return result\n  }\n\n  findInner(start, end, result, offset, predicate) {\n    for (let i = 0; i < this.local.length; i++) {\n      let span = this.local[i]\n      if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec)))\n        result.push(span.copy(span.from + offset, span.to + offset))\n    }\n    for (let i = 0; i < this.children.length; i += 3) {\n      if (this.children[i] < end && this.children[i + 1] > start) {\n        let childOff = this.children[i] + 1\n        this.children[i + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate)\n      }\n    }\n  }\n\n  // :: (Mapping, Node, ?Object) → DecorationSet\n  // Map the set of decorations in response to a change in the\n  // document.\n  //\n  //   options::- An optional set of options.\n  //\n  //     onRemove:: ?(decorationSpec: Object)\n  //     When given, this function will be called for each decoration\n  //     that gets dropped as a result of the mapping, passing the\n  //     spec of that decoration.\n  map(mapping, doc, options) {\n    if (this == empty || mapping.maps.length == 0) return this\n    return this.mapInner(mapping, doc, 0, 0, options || noSpec)\n  }\n\n  mapInner(mapping, node, offset, oldOffset, options) {\n    let newLocal\n    for (let i = 0; i < this.local.length; i++) {\n      let mapped = this.local[i].map(mapping, offset, oldOffset)\n      if (mapped && mapped.type.valid(node, mapped)) (newLocal || (newLocal = [])).push(mapped)\n      else if (options.onRemove) options.onRemove(this.local[i].spec)\n    }\n\n    if (this.children.length)\n      return mapChildren(this.children, newLocal, mapping, node, offset, oldOffset, options)\n    else\n      return newLocal ? new DecorationSet(newLocal.sort(byPos)) : empty\n  }\n\n  // :: (Node, [Decoration]) → DecorationSet\n  // Add the given array of decorations to the ones in the set,\n  // producing a new set. Needs access to the current document to\n  // create the appropriate tree structure.\n  add(doc, decorations) {\n    if (!decorations.length) return this\n    if (this == empty) return DecorationSet.create(doc, decorations)\n    return this.addInner(doc, decorations, 0)\n  }\n\n  addInner(doc, decorations, offset) {\n    let children, childIndex = 0\n    doc.forEach((childNode, childOffset) => {\n      let baseOffset = childOffset + offset, found\n      if (!(found = takeSpansForNode(decorations, childNode, baseOffset))) return\n\n      if (!children) children = this.children.slice()\n      while (childIndex < children.length && children[childIndex] < childOffset) childIndex += 3\n      if (children[childIndex] == childOffset)\n        children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1)\n      else\n        children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec))\n      childIndex += 3\n    })\n\n    let local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset)\n    return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local,\n                             children || this.children)\n  }\n\n  // :: ([Decoration]) → DecorationSet\n  // Create a new set that contains the decorations in this set, minus\n  // the ones in the given array.\n  remove(decorations) {\n    if (decorations.length == 0 || this == empty) return this\n    return this.removeInner(decorations, 0)\n  }\n\n  removeInner(decorations, offset) {\n    let children = this.children, local = this.local\n    for (let i = 0; i < children.length; i += 3) {\n      let found, from = children[i] + offset, to = children[i + 1] + offset\n      for (let j = 0, span; j < decorations.length; j++) if (span = decorations[j]) {\n        if (span.from > from && span.to < to) {\n          decorations[j] = null\n          ;(found || (found = [])).push(span)\n        }\n      }\n      if (!found) continue\n      if (children == this.children) children = this.children.slice()\n      let removed = children[i + 2].removeInner(found, from + 1)\n      if (removed != empty) {\n        children[i + 2] = removed\n      } else {\n        children.splice(i, 3)\n        i -= 3\n      }\n    }\n    if (local.length) for (let i = 0, span; i < decorations.length; i++) if (span = decorations[i]) {\n      for (let j = 0; j < local.length; j++) if (local[j].eq(span, offset)) {\n        if (local == this.local) local = this.local.slice()\n        local.splice(j--, 1)\n      }\n    }\n    if (children == this.children && local == this.local) return this\n    return local.length || children.length ? new DecorationSet(local, children) : empty\n  }\n\n  forChild(offset, node) {\n    if (this == empty) return this\n    if (node.isLeaf) return DecorationSet.empty\n\n    let child, local\n    for (let i = 0; i < this.children.length; i += 3) if (this.children[i] >= offset) {\n      if (this.children[i] == offset) child = this.children[i + 2]\n      break\n    }\n    let start = offset + 1, end = start + node.content.size\n    for (let i = 0; i < this.local.length; i++) {\n      let dec = this.local[i]\n      if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {\n        let from = Math.max(start, dec.from) - start, to = Math.min(end, dec.to) - start\n        if (from < to) (local || (local = [])).push(dec.copy(from, to))\n      }\n    }\n    if (local) {\n      let localSet = new DecorationSet(local.sort(byPos))\n      return child ? new DecorationGroup([localSet, child]) : localSet\n    }\n    return child || empty\n  }\n\n  eq(other) {\n    if (this == other) return true\n    if (!(other instanceof DecorationSet) ||\n        this.local.length != other.local.length ||\n        this.children.length != other.children.length) return false\n    for (let i = 0; i < this.local.length; i++)\n      if (!this.local[i].eq(other.local[i])) return false\n    for (let i = 0; i < this.children.length; i += 3)\n      if (this.children[i] != other.children[i] ||\n          this.children[i + 1] != other.children[i + 1] ||\n          !this.children[i + 2].eq(other.children[i + 2])) return false\n    return true\n  }\n\n  locals(node) {\n    return removeOverlap(this.localsInner(node))\n  }\n\n  localsInner(node) {\n    if (this == empty) return none\n    if (node.inlineContent || !this.local.some(InlineType.is)) return this.local\n    let result = []\n    for (let i = 0; i < this.local.length; i++) {\n      if (!(this.local[i].type instanceof InlineType))\n        result.push(this.local[i])\n    }\n    return result\n  }\n}\n\nconst empty = new DecorationSet()\n\n// :: DecorationSet\n// The empty set of decorations.\nDecorationSet.empty = empty\n\nDecorationSet.removeOverlap = removeOverlap\n\n// :- An abstraction that allows the code dealing with decorations to\n// treat multiple DecorationSet objects as if it were a single object\n// with (a subset of) the same interface.\nclass DecorationGroup {\n  constructor(members) {\n    this.members = members\n  }\n\n  forChild(offset, child) {\n    if (child.isLeaf) return DecorationSet.empty\n    let found = []\n    for (let i = 0; i < this.members.length; i++) {\n      let result = this.members[i].forChild(offset, child)\n      if (result == empty) continue\n      if (result instanceof DecorationGroup) found = found.concat(result.members)\n      else found.push(result)\n    }\n    return DecorationGroup.from(found)\n  }\n\n  eq(other) {\n    if (!(other instanceof DecorationGroup) ||\n        other.members.length != this.members.length) return false\n    for (let i = 0; i < this.members.length; i++)\n      if (!this.members[i].eq(other.members[i])) return false\n    return true\n  }\n\n  locals(node) {\n    let result, sorted = true\n    for (let i = 0; i < this.members.length; i++) {\n      let locals = this.members[i].localsInner(node)\n      if (!locals.length) continue\n      if (!result) {\n        result = locals\n      } else {\n        if (sorted) {\n          result = result.slice()\n          sorted = false\n        }\n        for (let j = 0; j < locals.length; j++) result.push(locals[j])\n      }\n    }\n    return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none\n  }\n\n  // : ([DecorationSet]) → union<DecorationSet, DecorationGroup>\n  // Create a group for the given array of decoration sets, or return\n  // a single set when possible.\n  static from(members) {\n    switch (members.length) {\n      case 0: return empty\n      case 1: return members[0]\n      default: return new DecorationGroup(members)\n    }\n  }\n}\n\nfunction mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {\n  let children = oldChildren.slice()\n\n  // Mark the children that are directly touched by changes, and\n  // move those that are after the changes.\n  let shift = (oldStart, oldEnd, newStart, newEnd) => {\n    for (let i = 0; i < children.length; i += 3) {\n      let end = children[i + 1], dSize\n      if (end == -1 || oldStart > end + oldOffset) continue\n      if (oldEnd >= children[i] + oldOffset) {\n        children[i + 1] = -1\n      } else if (newStart >= offset && (dSize = (newEnd - newStart) - (oldEnd - oldStart))) {\n        children[i] += dSize\n        children[i + 1] += dSize\n      }\n    }\n  }\n  for (let i = 0; i < mapping.maps.length; i++) mapping.maps[i].forEach(shift)\n\n  // Find the child nodes that still correspond to a single node,\n  // recursively call mapInner on them and update their positions.\n  let mustRebuild = false\n  for (let i = 0; i < children.length; i += 3) if (children[i + 1] == -1) { // Touched nodes\n    let from = mapping.map(oldChildren[i] + oldOffset), fromLocal = from - offset\n    if (fromLocal < 0 || fromLocal >= node.content.size) {\n      mustRebuild = true\n      continue\n    }\n    // Must read oldChildren because children was tagged with -1\n    let to = mapping.map(oldChildren[i + 1] + oldOffset, -1), toLocal = to - offset\n    let {index, offset: childOffset} = node.content.findIndex(fromLocal)\n    let childNode = node.maybeChild(index)\n    if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {\n      let mapped = children[i + 2].mapInner(mapping, childNode, from + 1, oldChildren[i] + oldOffset + 1, options)\n      if (mapped != empty) {\n        children[i] = fromLocal\n        children[i + 1] = toLocal\n        children[i + 2] = mapped\n      } else {\n        children[i + 1] = -2\n        mustRebuild = true\n      }\n    } else {\n      mustRebuild = true\n    }\n  }\n\n  // Remaining children must be collected and rebuilt into the appropriate structure\n  if (mustRebuild) {\n    let decorations = mapAndGatherRemainingDecorations(children, oldChildren, newLocal || [], mapping,\n                                                       offset, oldOffset, options)\n    let built = buildTree(decorations, node, 0, options)\n    newLocal = built.local\n    for (let i = 0; i < children.length; i += 3) if (children[i + 1] < 0) {\n      children.splice(i, 3)\n      i -= 3\n    }\n    for (let i = 0, j = 0; i < built.children.length; i += 3) {\n      let from = built.children[i]\n      while (j < children.length && children[j] < from) j += 3\n      children.splice(j, 0, built.children[i], built.children[i + 1], built.children[i + 2])\n    }\n  }\n\n  return new DecorationSet(newLocal && newLocal.sort(byPos), children)\n}\n\nfunction moveSpans(spans, offset) {\n  if (!offset || !spans.length) return spans\n  let result = []\n  for (let i = 0; i < spans.length; i++) {\n    let span = spans[i]\n    result.push(new Decoration(span.from + offset, span.to + offset, span.type))\n  }\n  return result\n}\n\nfunction mapAndGatherRemainingDecorations(children, oldChildren, decorations, mapping, offset, oldOffset, options) {\n  // Gather all decorations from the remaining marked children\n  function gather(set, oldOffset) {\n    for (let i = 0; i < set.local.length; i++) {\n      let mapped = set.local[i].map(mapping, offset, oldOffset)\n      if (mapped) decorations.push(mapped)\n      else if (options.onRemove) options.onRemove(set.local[i].spec)\n    }\n    for (let i = 0; i < set.children.length; i += 3)\n      gather(set.children[i + 2], set.children[i] + oldOffset + 1)\n  }\n  for (let i = 0; i < children.length; i += 3) if (children[i + 1] == -1)\n    gather(children[i + 2], oldChildren[i] + oldOffset + 1)\n\n  return decorations\n}\n\nfunction takeSpansForNode(spans, node, offset) {\n  if (node.isLeaf) return null\n  let end = offset + node.nodeSize, found = null\n  for (let i = 0, span; i < spans.length; i++) {\n    if ((span = spans[i]) && span.from > offset && span.to < end) {\n      ;(found || (found = [])).push(span)\n      spans[i] = null\n    }\n  }\n  return found\n}\n\nfunction withoutNulls(array) {\n  let result = []\n  for (let i = 0; i < array.length; i++)\n    if (array[i] != null) result.push(array[i])\n  return result\n}\n\n// : ([Decoration], Node, number) → DecorationSet\n// Build up a tree that corresponds to a set of decorations. `offset`\n// is a base offset that should be subtractet from the `from` and `to`\n// positions in the spans (so that we don't have to allocate new spans\n// for recursive calls).\nfunction buildTree(spans, node, offset, options) {\n  let children = [], hasNulls = false\n  node.forEach((childNode, localStart) => {\n    let found = takeSpansForNode(spans, childNode, localStart + offset)\n    if (found) {\n      hasNulls = true\n      let subtree = buildTree(found, childNode, offset + localStart + 1, options)\n      if (subtree != empty)\n        children.push(localStart, localStart + childNode.nodeSize, subtree)\n    }\n  })\n  let locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos)\n  for (let i = 0; i < locals.length; i++) if (!locals[i].type.valid(node, locals[i])) {\n    if (options.onRemove) options.onRemove(locals[i].spec)\n    locals.splice(i--, 1)\n  }\n  return locals.length || children.length ? new DecorationSet(locals, children) : empty\n}\n\n// : (Decoration, Decoration) → number\n// Used to sort decorations so that ones with a low start position\n// come first, and within a set with the same start position, those\n// with an smaller end position come first.\nfunction byPos(a, b) {\n  return a.from - b.from || a.to - b.to\n}\n\n// : ([Decoration]) → [Decoration]\n// Scan a sorted array of decorations for partially overlapping spans,\n// and split those so that only fully overlapping spans are left (to\n// make subsequent rendering easier). Will return the input array if\n// no partially overlapping spans are found (the common case).\nfunction removeOverlap(spans) {\n  let working = spans\n  for (let i = 0; i < working.length - 1; i++) {\n    let span = working[i]\n    if (span.from != span.to) for (let j = i + 1; j < working.length; j++) {\n      let next = working[j]\n      if (next.from == span.from) {\n        if (next.to != span.to) {\n          if (working == spans) working = spans.slice()\n          // Followed by a partially overlapping larger span. Split that\n          // span.\n          working[j] = next.copy(next.from, span.to)\n          insertAhead(working, j + 1, next.copy(span.to, next.to))\n        }\n        continue\n      } else {\n        if (next.from < span.to) {\n          if (working == spans) working = spans.slice()\n          // The end of this one overlaps with a subsequent span. Split\n          // this one.\n          working[i] = span.copy(span.from, next.from)\n          insertAhead(working, j, span.copy(next.from, span.to))\n        }\n        break\n      }\n    }\n  }\n  return working\n}\n\nfunction insertAhead(array, i, deco) {\n  while (i < array.length && byPos(deco, array[i]) > 0) i++\n  array.splice(i, 0, deco)\n}\n\n// : (EditorView) → union<DecorationSet, DecorationGroup>\n// Get the decorations associated with the current props of a view.\nexport function viewDecorations(view) {\n  let found = []\n  view.someProp(\"decorations\", f => {\n    let result = f(view.state)\n    if (result && result != empty) found.push(result)\n  })\n  if (view.cursorWrapper)\n    found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco]))\n  return DecorationGroup.from(found)\n}\n","import { NodeSelection, Selection } from 'prosemirror-state';\nimport { Fragment } from 'prosemirror-model';\nimport { findParentNodeOfType, findPositionOfNodeBefore } from './selection';\nimport {\n  cloneTr,\n  isNodeSelection,\n  replaceNodeAtPos,\n  removeNodeAtPos,\n  canInsert,\n  isEmptyParagraph\n} from './helpers';\n\n// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction\n// Returns a new transaction that removes a node of a given `nodeType`. It will return an original transaction if parent node hasn't been found.\n//\n// ```javascript\n// dispatch(\n//   removeParentNodeOfType(schema.nodes.table)(tr)\n// );\n// ```\nexport const removeParentNodeOfType = nodeType => tr => {\n  const parent = findParentNodeOfType(nodeType)(tr.selection);\n  if (parent) {\n    return removeNodeAtPos(parent.pos)(tr);\n  }\n  return tr;\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction\n// Returns a new transaction that replaces parent node of a given `nodeType` with the given `content`. It will return an original transaction if either parent node hasn't been found or replacing is not possible.\n//\n// ```javascript\n// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));\n//\n// dispatch(\n//  replaceParentNodeOfType(schema.nodes.table, node)(tr)\n// );\n// ```\nexport const replaceParentNodeOfType = (nodeType, content) => tr => {\n  if (!Array.isArray(nodeType)) {\n    nodeType = [nodeType];\n  }\n  for (let i = 0, count = nodeType.length; i < count; i++) {\n    const parent = findParentNodeOfType(nodeType[i])(tr.selection);\n    if (parent) {\n      const newTr = replaceNodeAtPos(parent.pos, content)(tr);\n      if (newTr !== tr) {\n        return newTr;\n      }\n    }\n  }\n  return tr;\n};\n\n// :: (tr: Transaction) → Transaction\n// Returns a new transaction that removes selected node. It will return an original transaction if current selection is not a `NodeSelection`.\n//\n// ```javascript\n// dispatch(\n//   removeSelectedNode(tr)\n// );\n// ```\nexport const removeSelectedNode = tr => {\n  if (isNodeSelection(tr.selection)) {\n    const from = tr.selection.$from.pos;\n    const to = tr.selection.$to.pos;\n    return cloneTr(tr.delete(from, to));\n  }\n  return tr;\n};\n\n// :: (content: union<ProseMirrorNode, ProseMirrorFragment>) → (tr: Transaction) → Transaction\n// Returns a new transaction that replaces selected node with a given `node`, keeping NodeSelection on the new `node`.\n// It will return the original transaction if either current selection is not a NodeSelection or replacing is not possible.\n//\n// ```javascript\n// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));\n// dispatch(\n//   replaceSelectedNode(node)(tr)\n// );\n// ```\nexport const replaceSelectedNode = content => tr => {\n  if (isNodeSelection(tr.selection)) {\n    const { $from, $to } = tr.selection;\n    if (\n      (content instanceof Fragment &&\n        $from.parent.canReplace($from.index(), $from.indexAfter(), content)) ||\n      $from.parent.canReplaceWith(\n        $from.index(),\n        $from.indexAfter(),\n        content.type\n      )\n    ) {\n      return cloneTr(\n        tr\n          .replaceWith($from.pos, $to.pos, content)\n          // restore node selection\n          .setSelection(new NodeSelection(tr.doc.resolve($from.pos)))\n      );\n    }\n  }\n  return tr;\n};\n\n// :: (position: number, dir: ?number) → (tr: Transaction) → Transaction\n// Returns a new transaction that tries to find a valid cursor selection starting at the given `position`\n// and searching back if `dir` is negative, and forward if positive.\n// If a valid cursor position hasn't been found, it will return the original transaction.\n//\n// ```javascript\n// dispatch(\n//   setTextSelection(5)(tr)\n// );\n// ```\nexport const setTextSelection = (position, dir = 1) => tr => {\n  const nextSelection = Selection.findFrom(tr.doc.resolve(position), dir, true);\n  if (nextSelection) {\n    return tr.setSelection(nextSelection);\n  }\n  return tr;\n};\n\nconst isSelectableNode = node => node.type && node.type.spec.selectable;\nconst shouldSelectNode = node => isSelectableNode(node) && node.type.isLeaf;\n\nconst setSelection = (node, pos, tr) => {\n  if (shouldSelectNode(node)) {\n    return tr.setSelection(new NodeSelection(tr.doc.resolve(pos)));\n  }\n  return setTextSelection(pos)(tr);\n};\n\n// :: (content: union<ProseMirrorNode, Fragment>, position: ?number, tryToReplace?: boolean) → (tr: Transaction) → Transaction\n// Returns a new transaction that inserts a given `content` at the current cursor position, or at a given `position`, if it is allowed by schema. If schema restricts such nesting, it will try to find an appropriate place for a given node in the document, looping through parent nodes up until the root document node.\n// If `tryToReplace` is true and current selection is a NodeSelection, it will replace selected node with inserted content if its allowed by schema.\n// If cursor is inside of an empty paragraph, it will try to replace that paragraph with the given content. If insertion is successful and inserted node has content, it will set cursor inside of that content.\n// It will return an original transaction if the place for insertion hasn't been found.\n//\n// ```javascript\n// const node = schema.nodes.extension.createChecked({});\n// dispatch(\n//   safeInsert(node)(tr)\n// );\n// ```\nexport const safeInsert = (content, position, tryToReplace) => tr => {\n  const hasPosition = typeof position === 'number';\n  const { $from } = tr.selection;\n  const $insertPos = hasPosition\n    ? tr.doc.resolve(position)\n    : isNodeSelection(tr.selection)\n    ? tr.doc.resolve($from.pos + 1)\n    : $from;\n  const { parent } = $insertPos;\n\n  // try to replace selected node\n  if (isNodeSelection(tr.selection) && tryToReplace) {\n    const oldTr = tr;\n    tr = replaceSelectedNode(content)(tr);\n    if (oldTr !== tr) {\n      return tr;\n    }\n  }\n\n  // try to replace an empty paragraph\n  if (isEmptyParagraph(parent)) {\n    const oldTr = tr;\n    tr = replaceParentNodeOfType(parent.type, content)(tr);\n    if (oldTr !== tr) {\n      const pos = isSelectableNode(content)\n        ? // for selectable node, selection position would be the position of the replaced parent\n          $insertPos.before($insertPos.depth)\n        : $insertPos.pos;\n      return setSelection(content, pos, tr);\n    }\n  }\n\n  // given node is allowed at the current cursor position\n  if (canInsert($insertPos, content)) {\n    tr.insert($insertPos.pos, content);\n    const pos = hasPosition\n      ? $insertPos.pos\n      : isSelectableNode(content)\n      ? // for atom nodes selection position after insertion is the previous pos\n        tr.selection.$anchor.pos - 1\n      : tr.selection.$anchor.pos;\n    return cloneTr(setSelection(content, pos, tr));\n  }\n\n  // looking for a place in the doc where the node is allowed\n  for (let i = $insertPos.depth; i > 0; i--) {\n    const pos = $insertPos.after(i);\n    const $pos = tr.doc.resolve(pos);\n    if (canInsert($pos, content)) {\n      tr.insert(pos, content);\n      return cloneTr(setSelection(content, pos, tr));\n    }\n  }\n  return tr;\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>, type: ?union<NodeType, null>, attrs: ?union<Object, null>, marks?: [Mark]) → (tr: Transaction) → Transaction\n// Returns a transaction that changes the type, attributes, and/or marks of the parent node of a given `nodeType`.\n//\n// ```javascript\n// const node = schema.nodes.extension.createChecked({});\n// dispatch(\n//   setParentNodeMarkup(schema.nodes.panel, null, { panelType })(tr);\n// );\n// ```\nexport const setParentNodeMarkup = (nodeType, type, attrs, marks) => tr => {\n  const parent = findParentNodeOfType(nodeType)(tr.selection);\n  if (parent) {\n    return cloneTr(\n      tr.setNodeMarkup(\n        parent.pos,\n        type,\n        Object.assign({}, parent.node.attrs, attrs),\n        marks\n      )\n    );\n  }\n  return tr;\n};\n\n// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction\n// Returns a new transaction that sets a `NodeSelection` on a parent node of a `given nodeType`.\n//\n// ```javascript\n// dispatch(\n//   selectParentNodeOfType([tableCell, tableHeader])(state.tr)\n// );\n// ```\nexport const selectParentNodeOfType = nodeType => tr => {\n  if (!isNodeSelection(tr.selection)) {\n    const parent = findParentNodeOfType(nodeType)(tr.selection);\n    if (parent) {\n      return cloneTr(tr.setSelection(NodeSelection.create(tr.doc, parent.pos)));\n    }\n  }\n  return tr;\n};\n\n// :: (tr: Transaction) → Transaction\n// Returns a new transaction that deletes previous node.\n//\n// ```javascript\n// dispatch(\n//   removeNodeBefore(state.tr)\n// );\n// ```\nexport const removeNodeBefore = tr => {\n  const position = findPositionOfNodeBefore(tr.selection);\n  if (typeof position === 'number') {\n    return removeNodeAtPos(position)(tr);\n  }\n  return tr;\n};\n","import { NodeSelection } from 'prosemirror-state';\nimport { Fragment, Node as PMNode } from 'prosemirror-model';\nimport { TableMap } from 'prosemirror-tables';\nimport { setTextSelection } from './transforms';\nimport { findParentNodeClosestToPos } from './selection';\n\n// :: (selection: Selection) → boolean\n// Checks if current selection is a `NodeSelection`.\n//\n// ```javascript\n// if (isNodeSelection(tr.selection)) {\n//   // ...\n// }\n// ```\nexport const isNodeSelection = selection => {\n  return selection instanceof NodeSelection;\n};\n\n// (nodeType: union<NodeType, [NodeType]>) → boolean\n// Checks if the type a given `node` equals to a given `nodeType`.\nexport const equalNodeType = (nodeType, node) => {\n  return (\n    (Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1) ||\n    node.type === nodeType\n  );\n};\n\n// (tr: Transaction) → Transaction\n// Creates a new transaction object from a given transaction\nexport const cloneTr = tr => {\n  return Object.assign(Object.create(tr), tr).setTime(Date.now());\n};\n\n// (position: number, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction\n// Returns a `replace` transaction that replaces a node at a given position with the given `content`.\n// It will return the original transaction if replacing is not possible.\n// `position` should point at the position immediately before the node.\nexport const replaceNodeAtPos = (position, content) => tr => {\n  const node = tr.doc.nodeAt(position);\n  const $pos = tr.doc.resolve(position);\n  if (canReplace($pos, content)) {\n    tr = tr.replaceWith(position, position + node.nodeSize, content);\n    const start = tr.selection.$from.pos - 1;\n    // put cursor inside of the inserted node\n    tr = setTextSelection(Math.max(start, 0), -1)(tr);\n    // move cursor to the start of the node\n    tr = setTextSelection(tr.selection.$from.start())(tr);\n    return cloneTr(tr);\n  }\n  return tr;\n};\n\n// ($pos: ResolvedPos, doc: ProseMirrorNode, content: union<ProseMirrorNode, Fragment>, ) → boolean\n// Checks if replacing a node at a given `$pos` inside of the `doc` node with the given `content` is possible.\nexport const canReplace = ($pos, content) => {\n  const node = $pos.node($pos.depth);\n  return (\n    node &&\n    node.type.validContent(\n      content instanceof Fragment ? content : Fragment.from(content)\n    )\n  );\n};\n\n// (position: number) → (tr: Transaction) → Transaction\n// Returns a `delete` transaction that removes a node at a given position with the given `node`.\n// `position` should point at the position immediately before the node.\nexport const removeNodeAtPos = position => tr => {\n  const node = tr.doc.nodeAt(position);\n  return cloneTr(tr.delete(position, position + node.nodeSize));\n};\n\n// (schema: Schema) → {[key: string]: NodeType}\n// Returns a map where keys are tableRoles and values are NodeTypes.\nexport const tableNodeTypes = schema => {\n  if (schema.cached.tableNodeTypes) {\n    return schema.cached.tableNodeTypes;\n  }\n  const roles = {};\n  Object.keys(schema.nodes).forEach(type => {\n    const nodeType = schema.nodes[type];\n    if (nodeType.spec.tableRole) {\n      roles[nodeType.spec.tableRole] = nodeType;\n    }\n  });\n  schema.cached.tableNodeTypes = roles;\n  return roles;\n};\n\n// :: ($pos: ResolvedPos, content: union<ProseMirrorNode, Fragment>) → boolean\n// Checks if a given `content` can be inserted at the given `$pos`\n//\n// ```javascript\n// const { selection: { $from } } = state;\n// const node = state.schema.nodes.atom.createChecked();\n// if (canInsert($from, node)) {\n//   // ...\n// }\n// ```\nexport const canInsert = ($pos, content) => {\n  const index = $pos.index();\n\n  if (content instanceof Fragment) {\n    return $pos.parent.canReplace(index, index, content);\n  } else if (content instanceof PMNode) {\n    return $pos.parent.canReplaceWith(index, index, content.type);\n  }\n  return false;\n};\n\n// (node: ProseMirrorNode) → boolean\n// Checks if a given `node` is an empty paragraph\nexport const isEmptyParagraph = node => {\n  return !node || (node.type.name === 'paragraph' && node.nodeSize === 2);\n};\n\n// ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}\n// Iterates over parent nodes, returning a table node closest to a given `$pos`.\n//\n// ```javascript\n// const table = findTableClosestToPos(state.doc.resolve(10));\n// ```\nexport const findTableClosestToPos = $pos => {\n  const predicate = node =>\n    node.type.spec.tableRole && /table/i.test(node.type.spec.tableRole);\n  return findParentNodeClosestToPos($pos, predicate);\n};\n\nexport const createCell = (cellType, cellContent = null) => {\n  if (cellContent) {\n    return cellType.createChecked(null, cellContent);\n  }\n\n  return cellType.createAndFill();\n};\n\n// (rect: {left: number, right: number, top: number, bottom: number}) → (selection: Selection) → boolean\n// Checks if a given CellSelection rect is selected\nexport const isRectSelected = rect => selection => {\n  const map = TableMap.get(selection.$anchorCell.node(-1));\n  const start = selection.$anchorCell.start(-1);\n  const cells = map.cellsInRect(rect);\n  const selectedCells = map.cellsInRect(\n    map.rectBetween(\n      selection.$anchorCell.pos - start,\n      selection.$headCell.pos - start\n    )\n  );\n\n  for (let i = 0, count = cells.length; i < count; i++) {\n    if (selectedCells.indexOf(cells[i]) === -1) {\n      return false;\n    }\n  }\n\n  return true;\n};\n\n// This function transposes an array of array flipping the columns for rows,\n// transposition is a familiar algebra concept;\n// you can get more details here:\n// https://en.wikipedia.org/wiki/Transpose\n//\n// ```javascript\n//\n//  const arr = [\n//    ['a1', 'a2', 'a3'],\n//    ['b1', 'b2', 'b3'],\n//    ['c1', 'c2', 'c3'],\n//    ['d1', 'd2', 'd3'],\n//  ];\n//\n//  const result = transpose(arr);\n//\n//  result === [\n//    ['a1', 'b1', 'c1', 'd1'],\n//    ['a2', 'b2', 'c2', 'd2'],\n//    ['a3', 'b3', 'c3', 'd3'],\n//  ]\n// ```\nexport const transpose = array => {\n  return array[0].map((_, i) => {\n    return array.map(column => column[i]);\n  });\n};\n\n// :: (tableNode: Node) -> Array<Node>\n// This function will transform the table node\n// into a matrix of rows and columns respecting merged cells,\n// for example this table will be convert to the below:\n//\n// ```\n//  ____________________________\n// |      |      |             |\n// |  A1  |  B1  |     C1      |\n// |______|______|______ ______|\n// |      |             |      |\n// |  A2  |     B2      |      |\n// |______|______ ______|      |\n// |      |      |      |  D1  |\n// |  A3  |  B3  |  C2  |      |\n// |______|______|______|______|\n// ```\n//\n//\n// ```javascript\n// array = [\n//   [A1, B1, C1, null],\n//   [A2, B2, null, D1],\n//   [A3. B3, C2, null],\n// ]\n// ```\nexport const convertTableNodeToArrayOfRows = tableNode => {\n  const map = TableMap.get(tableNode);\n  const rows = [];\n  for (let rowIndex = 0; rowIndex < map.height; rowIndex++) {\n    const rowCells = [];\n    const seen = {};\n\n    for (let colIndex = 0; colIndex < map.width; colIndex++) {\n      const cellPos = map.map[rowIndex * map.width + colIndex];\n      const cell = tableNode.nodeAt(cellPos);\n      const rect = map.findCell(cellPos);\n      if (seen[cellPos] || rect.top !== rowIndex) {\n        rowCells.push(null);\n        continue;\n      }\n      seen[cellPos] = true;\n\n      rowCells.push(cell);\n    }\n\n    rows.push(rowCells);\n  }\n\n  return rows;\n};\n\n// :: (tableNode: Node, tableArray: Array<Node>) -> Node\n// This function will transform a matrix of nodes\n// into table node respecting merged cells and rows configurations,\n// for example this array will be convert to the table below:\n//\n// ```javascript\n// array = [\n//   [A1, B1, C1, null],\n//   [A2, B2, null, D1],\n//   [A3. B3, C2, null],\n// ]\n// ```\n//\n// ```\n//  ____________________________\n// |      |      |             |\n// |  A1  |  B1  |     C1      |\n// |______|______|______ ______|\n// |      |             |      |\n// |  A2  |     B2      |      |\n// |______|______ ______|      |\n// |      |      |      |  D1  |\n// |  A3  |  B3  |  C2  |      |\n// |______|______|______|______|\n// ```\n//\nexport const convertArrayOfRowsToTableNode = (tableNode, arrayOfNodes) => {\n  const rowsPM = [];\n  const map = TableMap.get(tableNode);\n  for (let rowIndex = 0; rowIndex < map.height; rowIndex++) {\n    const row = tableNode.child(rowIndex);\n    const rowCells = [];\n\n    for (let colIndex = 0; colIndex < map.width; colIndex++) {\n      if (!arrayOfNodes[rowIndex][colIndex]) {\n        continue;\n      }\n      const cellPos = map.map[rowIndex * map.width + colIndex];\n\n      const cell = arrayOfNodes[rowIndex][colIndex];\n      const oldCell = tableNode.nodeAt(cellPos);\n      const newCell = oldCell.type.createChecked(\n        Object.assign({}, cell.attrs),\n        cell.content,\n        cell.marks\n      );\n      rowCells.push(newCell);\n    }\n\n    rowsPM.push(row.type.createChecked(row.attrs, rowCells, row.marks));\n  }\n\n  const newTable = tableNode.type.createChecked(\n    tableNode.attrs,\n    rowsPM,\n    tableNode.marks\n  );\n\n  return newTable;\n};\n\nexport const moveTableColumn = (\n  table,\n  indexesOrigin,\n  indexesTarget,\n  direction\n) => {\n  let rows = transpose(convertTableNodeToArrayOfRows(table.node));\n\n  rows = moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, direction);\n  rows = transpose(rows);\n\n  return convertArrayOfRowsToTableNode(table.node, rows);\n};\n\nexport const moveTableRow = (\n  table,\n  indexesOrigin,\n  indexesTarget,\n  direction\n) => {\n  let rows = convertTableNodeToArrayOfRows(table.node);\n\n  rows = moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, direction);\n\n  return convertArrayOfRowsToTableNode(table.node, rows);\n};\n\nconst moveRowInArrayOfRows = (\n  rows,\n  indexesOrigin,\n  indexesTarget,\n  directionOverride\n) => {\n  let direction = indexesOrigin[0] > indexesTarget[0] ? -1 : 1;\n\n  const rowsExtracted = rows.splice(indexesOrigin[0], indexesOrigin.length);\n  const positionOffset = rowsExtracted.length % 2 === 0 ? 1 : 0;\n  let target;\n\n  if (directionOverride === -1 && direction === 1) {\n    target = indexesTarget[0] - 1;\n  } else if (directionOverride === 1 && direction === -1) {\n    target = indexesTarget[indexesTarget.length - 1] - positionOffset + 1;\n  } else {\n    target =\n      direction === -1\n        ? indexesTarget[0]\n        : indexesTarget[indexesTarget.length - 1] - positionOffset;\n  }\n\n  rows.splice.apply(rows, [target, 0].concat(rowsExtracted));\n  return rows;\n};\n\nexport const checkInvalidMovements = (\n  originIndex,\n  targetIndex,\n  targets,\n  type\n) => {\n  const direction = originIndex > targetIndex ? -1 : 1;\n  const errorMessage = `Target position is invalid, you can't move the ${type} ${originIndex} to ${targetIndex}, the target can't be split. You could use tryToFit option.`;\n\n  if (direction === 1) {\n    if (targets.slice(0, targets.length - 1).indexOf(targetIndex) !== -1) {\n      throw new Error(errorMessage);\n    }\n  } else {\n    if (targets.slice(1).indexOf(targetIndex) !== -1) {\n      throw new Error(errorMessage);\n    }\n  }\n\n  return true;\n};\n","import {\n  CellSelection,\n  TableMap,\n  addColumn,\n  addRow,\n  removeColumn,\n  removeRow\n} from 'prosemirror-tables';\nimport { Selection } from 'prosemirror-state';\nimport { findParentNode, findParentNodeClosestToPos } from './selection';\nimport { setTextSelection, safeInsert } from './transforms';\nimport {\n  cloneTr,\n  tableNodeTypes,\n  findTableClosestToPos,\n  createCell,\n  isRectSelected,\n  moveTableRow,\n  moveTableColumn,\n  checkInvalidMovements\n} from './helpers';\n\n// :: (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}\n// Iterates over parent nodes, returning the closest table node.\n//\n// ```javascript\n// const table = findTable(selection);\n// ```\nexport const findTable = selection =>\n  findParentNode(\n    node => node.type.spec.tableRole && node.type.spec.tableRole === 'table'\n  )(selection);\n\n// :: (selection: Selection) → boolean\n// Checks if current selection is a `CellSelection`.\n//\n// ```javascript\n// if (isCellSelection(selection)) {\n//   // ...\n// }\n// ```\nexport const isCellSelection = selection => {\n  return selection instanceof CellSelection;\n};\n\n// :: (selection: Selection) → ?{left: number, right: number, top: number, bottom: number}\n// Get the selection rectangle. Returns `undefined` if selection is not a CellSelection.\n//\n// ```javascript\n// const rect = getSelectionRect(selection);\n// ```\nexport const getSelectionRect = selection => {\n  if (!isCellSelection(selection)) {\n    return;\n  }\n  const start = selection.$anchorCell.start(-1);\n  const map = TableMap.get(selection.$anchorCell.node(-1));\n  return map.rectBetween(\n    selection.$anchorCell.pos - start,\n    selection.$headCell.pos - start\n  );\n};\n\n// :: (columnIndex: number) → (selection: Selection) → boolean\n// Checks if entire column at index `columnIndex` is selected.\n//\n// ```javascript\n// const className = isColumnSelected(i)(selection) ? 'selected' : '';\n// ```\nexport const isColumnSelected = columnIndex => selection => {\n  if (isCellSelection(selection)) {\n    const map = TableMap.get(selection.$anchorCell.node(-1));\n    return isRectSelected({\n      left: columnIndex,\n      right: columnIndex + 1,\n      top: 0,\n      bottom: map.height\n    })(selection);\n  }\n\n  return false;\n};\n\n// :: (rowIndex: number) → (selection: Selection) → boolean\n// Checks if entire row at index `rowIndex` is selected.\n//\n// ```javascript\n// const className = isRowSelected(i)(selection) ? 'selected' : '';\n// ```\nexport const isRowSelected = rowIndex => selection => {\n  if (isCellSelection(selection)) {\n    const map = TableMap.get(selection.$anchorCell.node(-1));\n    return isRectSelected({\n      left: 0,\n      right: map.width,\n      top: rowIndex,\n      bottom: rowIndex + 1\n    })(selection);\n  }\n\n  return false;\n};\n\n// :: (selection: Selection) → boolean\n// Checks if entire table is selected\n//\n// ```javascript\n// const className = isTableSelected(selection) ? 'selected' : '';\n// ```\nexport const isTableSelected = selection => {\n  if (isCellSelection(selection)) {\n    const map = TableMap.get(selection.$anchorCell.node(-1));\n    return isRectSelected({\n      left: 0,\n      right: map.width,\n      top: 0,\n      bottom: map.height\n    })(selection);\n  }\n\n  return false;\n};\n\n// :: (columnIndex: union<number, [number]>) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]\n// Returns an array of cells in a column(s), where `columnIndex` could be a column index or an array of column indexes.\n//\n// ```javascript\n// const cells = getCellsInColumn(i)(selection); // [{node, pos}, {node, pos}]\n// ```\nexport const getCellsInColumn = columnIndex => selection => {\n  const table = findTable(selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    const indexes = Array.isArray(columnIndex)\n      ? columnIndex\n      : Array.from([columnIndex]);\n    return indexes.reduce((acc, index) => {\n      if (index >= 0 && index <= map.width - 1) {\n        const cells = map.cellsInRect({\n          left: index,\n          right: index + 1,\n          top: 0,\n          bottom: map.height\n        });\n        return acc.concat(\n          cells.map(nodePos => {\n            const node = table.node.nodeAt(nodePos);\n            const pos = nodePos + table.start;\n            return { pos, start: pos + 1, node };\n          })\n        );\n      }\n    }, []);\n  }\n};\n\n// :: (rowIndex: union<number, [number]>) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]\n// Returns an array of cells in a row(s), where `rowIndex` could be a row index or an array of row indexes.\n//\n// ```javascript\n// const cells = getCellsInRow(i)(selection); // [{node, pos}, {node, pos}]\n// ```\nexport const getCellsInRow = rowIndex => selection => {\n  const table = findTable(selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    const indexes = Array.isArray(rowIndex) ? rowIndex : Array.from([rowIndex]);\n    return indexes.reduce((acc, index) => {\n      if (index >= 0 && index <= map.height - 1) {\n        const cells = map.cellsInRect({\n          left: 0,\n          right: map.width,\n          top: index,\n          bottom: index + 1\n        });\n        return acc.concat(\n          cells.map(nodePos => {\n            const node = table.node.nodeAt(nodePos);\n            const pos = nodePos + table.start;\n            return { pos, start: pos + 1, node };\n          })\n        );\n      }\n    }, []);\n  }\n};\n\n// :: (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]\n// Returns an array of all cells in a table.\n//\n// ```javascript\n// const cells = getCellsInTable(selection); // [{node, pos}, {node, pos}]\n// ```\nexport const getCellsInTable = selection => {\n  const table = findTable(selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    const cells = map.cellsInRect({\n      left: 0,\n      right: map.width,\n      top: 0,\n      bottom: map.height\n    });\n    return cells.map(nodePos => {\n      const node = table.node.nodeAt(nodePos);\n      const pos = nodePos + table.start;\n      return { pos, start: pos + 1, node };\n    });\n  }\n};\n\nconst select = type => (index, expand) => tr => {\n  const table = findTable(tr.selection);\n  const isRowSelection = type === 'row';\n  if (table) {\n    const map = TableMap.get(table.node);\n\n    // Check if the index is valid\n    if (index >= 0 && index < (isRowSelection ? map.height : map.width)) {\n      let left = isRowSelection ? 0 : index;\n      let top = isRowSelection ? index : 0;\n      let right = isRowSelection ? map.width : index + 1;\n      let bottom = isRowSelection ? index + 1 : map.height;\n\n      if (expand) {\n        const cell = findCellClosestToPos(tr.selection.$from);\n        if (!cell) {\n          return tr;\n        }\n\n        const selRect = map.findCell(cell.pos - table.start);\n        if (isRowSelection) {\n          top = Math.min(top, selRect.top);\n          bottom = Math.max(bottom, selRect.bottom);\n        } else {\n          left = Math.min(left, selRect.left);\n          right = Math.max(right, selRect.right);\n        }\n      }\n\n      const cellsInFirstRow = map.cellsInRect({\n        left,\n        top,\n        right: isRowSelection ? right : left + 1,\n        bottom: isRowSelection ? top + 1 : bottom\n      });\n\n      const cellsInLastRow =\n        bottom - top === 1\n          ? cellsInFirstRow\n          : map.cellsInRect({\n              left: isRowSelection ? left : right - 1,\n              top: isRowSelection ? bottom - 1 : top,\n              right,\n              bottom\n            });\n\n      const head = table.start + cellsInFirstRow[0];\n      const anchor = table.start + cellsInLastRow[cellsInLastRow.length - 1];\n      const $head = tr.doc.resolve(head);\n      const $anchor = tr.doc.resolve(anchor);\n\n      return cloneTr(tr.setSelection(new CellSelection($anchor, $head)));\n    }\n  }\n  return tr;\n};\n\n// :: (columnIndex: number, expand: ?boolean) → (tr: Transaction) → Transaction\n// Returns a new transaction that creates a `CellSelection` on a column at index `columnIndex`.\n// Use the optional `expand` param to extend from current selection.\n//\n// ```javascript\n// dispatch(\n//   selectColumn(i)(state.tr)\n// );\n// ```\nexport const selectColumn = select('column');\n\n// :: (rowIndex: number, expand: ?boolean) → (tr: Transaction) → Transaction\n// Returns a new transaction that creates a `CellSelection` on a column at index `rowIndex`.\n// Use the optional `expand` param to extend from current selection.\n//\n// ```javascript\n// dispatch(\n//   selectRow(i)(state.tr)\n// );\n// ```\nexport const selectRow = select('row');\n\n// :: (selection: Selection) → (tr: Transaction) → Transaction\n// Returns a new transaction that creates a `CellSelection` on the entire table.\n//\n// ```javascript\n// dispatch(\n//   selectTable(i)(state.tr)\n// );\n// ```\nexport const selectTable = tr => {\n  const table = findTable(tr.selection);\n  if (table) {\n    const { map } = TableMap.get(table.node);\n    if (map && map.length) {\n      const head = table.start + map[0];\n      const anchor = table.start + map[map.length - 1];\n      const $head = tr.doc.resolve(head);\n      const $anchor = tr.doc.resolve(anchor);\n\n      return cloneTr(tr.setSelection(new CellSelection($anchor, $head)));\n    }\n  }\n  return tr;\n};\n\n// :: (cell: {pos: number, node: ProseMirrorNode}, schema: Schema) → (tr: Transaction) → Transaction\n// Returns a new transaction that clears the content of a given `cell`.\n//\n// ```javascript\n// const $pos = state.doc.resolve(13);\n// dispatch(\n//   emptyCell(findCellClosestToPos($pos), state.schema)(state.tr)\n// );\n// ```\nexport const emptyCell = (cell, schema) => tr => {\n  if (cell) {\n    const { content } = tableNodeTypes(schema).cell.createAndFill();\n    if (!cell.node.content.eq(content)) {\n      tr.replaceWith(cell.pos + 1, cell.pos + cell.node.nodeSize, content);\n      return cloneTr(tr);\n    }\n  }\n  return tr;\n};\n\n// :: (columnIndex: number) → (tr: Transaction) → Transaction\n// Returns a new transaction that adds a new column at index `columnIndex`.\n//\n// ```javascript\n// dispatch(\n//   addColumnAt(i)(state.tr)\n// );\n// ```\nexport const addColumnAt = columnIndex => tr => {\n  const table = findTable(tr.selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    if (columnIndex >= 0 && columnIndex <= map.width) {\n      return cloneTr(\n        addColumn(\n          tr,\n          {\n            map,\n            tableStart: table.start,\n            table: table.node\n          },\n          columnIndex\n        )\n      );\n    }\n  }\n  return tr;\n};\n\n// :: (originRowIndex: number, targetRowIndex: targetColumnIndex, options?: MovementOptions) → (tr: Transaction) → Transaction\n// Returns a new transaction that moves the origin row to the target index;\n//\n// by default \"tryToFit\" is false, that means if you try to move a row to a place\n// where we will need to split a row with merged cells it'll throw an exception, for example:\n//\n// ```\n//      ____________________________\n//     |      |      |             |\n//  0  |  A1  |  B1  |     C1      |\n//     |______|______|______ ______|\n//     |      |             |      |\n//  1  |  A2  |     B2      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D1  |\n//  2  |  A3  |  B3  |  C2  |      |\n//     |______|______|______|______|\n// ```\n//\n// if you try to move the row 0 to the row index 1 with tryToFit false,\n// it'll throw an exception since you can't split the row 1;\n// but if \"tryToFit\" is true, it'll move the row using the current direction.\n//\n// We defined current direction using the target and origin values\n// if the origin is greater than the target, that means the course is `bottom-to-top`,\n// so the `tryToFit` logic will use this direction to determine\n// if we should move the column to the right or the left.\n//\n// for example, if you call the function using `moveRow(0, 1, { tryToFit: true })`\n// the result will be:\n// ```\n//      ____________________________\n//     |      |             |      |\n//  0  |  A2  |     B2      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D1  |\n//  1  |  A3  |  B3  |  C2  |      |\n//     |______|______|______|______|\n//     |      |      |             |\n//  2  |  A1  |  B1  |     C1      |\n//     |______|______|______ ______|\n// ```\n//\n// since we could put the row zero on index one,\n// we pushed to the best place to fit the row index 0,\n// in this case, row index 2.\n//\n//\n// -------- HOW TO OVERRIDE DIRECTION --------\n//\n// If you set \"tryToFit\" to \"true\", it will try to figure out the best direction\n// place to fit using the origin and target index, for example:\n//\n//\n// ```\n//      ____________________________\n//     |      |      |             |\n//  0  |  A1  |  B1  |     C1      |\n//     |______|______|______ ______|\n//     |      |             |      |\n//  1  |  A2  |     B2      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D1  |\n//  2  |  A3  |  B3  |  C2  |      |\n//     |______|______|______|______|\n//     |      |             |      |\n//  3  |  A4  |     B4      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D2  |\n//  4  |  A5  |  B5  |  C3  |      |\n//     |______|______|______|______|\n// ```\n//\n//\n// If you try to move the row 0 to row index 4 with \"tryToFit\" enabled, by default,\n// the code will put it on after the merged rows,\n// but you can override it using the \"direction\" option.\n//\n// -1: Always put the origin before the target\n// ```\n//      ____________________________\n//     |      |             |      |\n//  0  |  A2  |     B2      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D1  |\n//  1  |  A3  |  B3  |  C2  |      |\n//     |______|______|______|______|\n//     |      |      |             |\n//  2  |  A1  |  B1  |     C1      |\n//     |______|______|______ ______|\n//     |      |             |      |\n//  3  |  A4  |     B4      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D2  |\n//  4  |  A5  |  B5  |  C3  |      |\n//     |______|______|______|______|\n// ```\n//\n//  0: Automatically decide the best place to fit\n// ```\n//      ____________________________\n//     |      |             |      |\n//  0  |  A2  |     B2      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D1  |\n//  1  |  A3  |  B3  |  C2  |      |\n//     |______|______|______|______|\n//     |      |             |      |\n//  2  |  A4  |     B4      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D2  |\n//  3  |  A5  |  B5  |  C3  |      |\n//     |______|______|______|______|\n//     |      |      |             |\n//  4  |  A1  |  B1  |     C1      |\n//     |______|______|______ ______|\n// ```\n//\n//  1: Always put the origin after the target\n// ```\n//      ____________________________\n//     |      |             |      |\n//  0  |  A2  |     B2      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D1  |\n//  1  |  A3  |  B3  |  C2  |      |\n//     |______|______|______|______|\n//     |      |             |      |\n//  2  |  A4  |     B4      |      |\n//     |______|______ ______|      |\n//     |      |      |      |  D2  |\n//  3  |  A5  |  B5  |  C3  |      |\n//     |______|______|______|______|\n//     |      |      |             |\n//  4  |  A1  |  B1  |     C1      |\n//     |______|______|______ ______|\n// ```\n//\n// ```javascript\n// dispatch(\n//   moveRow(x, y, options)(state.tr)\n// );\n// ```\nexport const moveRow = (originRowIndex, targetRowIndex, opts) => tr => {\n  const defaultOptions = { tryToFit: false, direction: 0 };\n  const options = Object.assign(defaultOptions, opts);\n  const table = findTable(tr.selection);\n  if (!table) {\n    return tr;\n  }\n\n  const { indexes: indexesOriginRow } = getSelectionRangeInRow(originRowIndex)(\n    tr\n  );\n  const { indexes: indexesTargetRow } = getSelectionRangeInRow(targetRowIndex)(\n    tr\n  );\n\n  if (indexesOriginRow.indexOf(targetRowIndex) > -1) {\n    return tr;\n  }\n\n  if (!options.tryToFit && indexesTargetRow.length > 1) {\n    checkInvalidMovements(\n      originRowIndex,\n      targetRowIndex,\n      indexesTargetRow,\n      'row'\n    );\n  }\n\n  const newTable = moveTableRow(\n    table,\n    indexesOriginRow,\n    indexesTargetRow,\n    options.direction\n  );\n\n  return cloneTr(tr).replaceWith(\n    table.pos,\n    table.pos + table.node.nodeSize,\n    newTable\n  );\n};\n\n// :: (originColumnIndex: number, targetColumnIndex: targetColumnIndex, options?: MovementOptions) → (tr: Transaction) → Transaction\n// Returns a new transaction that moves the origin column to the target index;\n//\n// by default \"tryToFit\" is false, that means if you try to move a column to a place\n// where we will need to split a column with merged cells it'll throw an exception, for example:\n//\n// ```\n//    0      1         2\n//  ____________________________\n// |      |      |             |\n// |  A1  |  B1  |     C1      |\n// |______|______|______ ______|\n// |      |             |      |\n// |  A2  |     B2      |      |\n// |______|______ ______|      |\n// |      |      |      |  D1  |\n// |  A3  |  B3  |  C2  |      |\n// |______|______|______|______|\n// ```\n//\n//\n// if you try to move the column 0 to the column index 1 with tryToFit false,\n// it'll throw an exception since you can't split the column 1;\n// but if \"tryToFit\" is true, it'll move the column using the current direction.\n//\n// We defined current direction using the target and origin values\n// if the origin is greater than the target, that means the course is `right-to-left`,\n// so the `tryToFit` logic will use this direction to determine\n// if we should move the column to the right or the left.\n//\n// for example, if you call the function using `moveColumn(0, 1, { tryToFit: true })`\n// the result will be:\n//\n// ```\n//    0       1             2\n// _____________________ _______\n// |      |             |      |\n// |  B1  |     C1      |  A1  |\n// |______|______ ______|______|\n// |             |      |      |\n// |     B2      |      |  A2  |\n// |______ ______|      |______|\n// |      |      |  D1  |      |\n// |  B3  |  C2  |      |  A3  |\n// |______|______|______|______|\n// ```\n//\n// since we could put the column zero on index one,\n// we pushed to the best place to fit the column 0, in this case, column index 2.\n//\n// -------- HOW TO OVERRIDE DIRECTION --------\n//\n// If you set \"tryToFit\" to \"true\", it will try to figure out the best direction\n// place to fit using the origin and target index, for example:\n//\n//\n// ```\n//     0      1       2     3      4      5       6\n//   _________________________________________________\n//  |      |      |             |      |             |\n//  |  A1  |  B1  |     C1      |  E1  |     F1      |\n//  |______|______|______ ______|______|______ ______|\n//  |      |             |      |             |      |\n//  |  A2  |     B2      |      |     E2      |      |\n//  |______|______ ______|      |______ ______|      |\n//  |      |      |      |  D1  |      |      |  G2  |\n//  |  A3  |  B3  |  C3  |      |  E3  |  F3  |      |\n//  |______|______|______|______|______|______|______|\n// ```\n//\n//\n// If you try to move the column 0 to column index 5 with \"tryToFit\" enabled, by default,\n// the code will put it on after the merged columns,\n// but you can override it using the \"direction\" option.\n//\n// -1: Always put the origin before the target\n//\n// ```\n//     0      1       2     3      4      5       6\n//   _________________________________________________\n//  |      |             |      |      |             |\n//  |  B1  |     C1      |  A1  |  E1  |     F1      |\n//  |______|______ ______|______|______|______ ______|\n//  |             |      |      |             |      |\n//  |     B2      |      |  A2  |     E2      |      |\n//  |______ ______|      |______|______ ______|      |\n//  |      |      |  D1  |      |      |      |  G2  |\n//  |  B3  |  C3  |      |  A3  |  E3  |  F3  |      |\n//  |______|______|______|______|______|______|______|\n// ```\n//\n//  0: Automatically decide the best place to fit\n//\n// ```\n//     0      1       2     3      4      5       6\n//   _________________________________________________\n//  |      |             |      |             |      |\n//  |  B1  |     C1      |  E1  |     F1      |  A1  |\n//  |______|______ ______|______|______ ______|______|\n//  |             |      |             |      |      |\n//  |     B2      |      |     E2      |      |  A2  |\n//  |______ ______|      |______ ______|      |______|\n//  |      |      |  D1  |      |      |  G2  |      |\n//  |  B3  |  C3  |      |  E3  |  F3  |      |  A3  |\n//  |______|______|______|______|______|______|______|\n// ```\n//\n//  1: Always put the origin after the target\n//\n// ```\n//     0      1       2     3      4      5       6\n//   _________________________________________________\n//  |      |             |      |             |      |\n//  |  B1  |     C1      |  E1  |     F1      |  A1  |\n//  |______|______ ______|______|______ ______|______|\n//  |             |      |             |      |      |\n//  |     B2      |      |     E2      |      |  A2  |\n//  |______ ______|      |______ ______|      |______|\n//  |      |      |  D1  |      |      |  G2  |      |\n//  |  B3  |  C3  |      |  E3  |  F3  |      |  A3  |\n//  |______|______|______|______|______|______|______|\n// ```\n//\n// ```javascript\n// dispatch(\n//   moveColumn(x, y, options)(state.tr)\n// );\n// ```\nexport const moveColumn = (\n  originColumnIndex,\n  targetColumnIndex,\n  opts\n) => tr => {\n  const defaultOptions = { tryToFit: false, direction: 0 };\n  const options = Object.assign(defaultOptions, opts);\n  const table = findTable(tr.selection);\n  if (!table) {\n    return tr;\n  }\n\n  const { indexes: indexesOriginColumn } = getSelectionRangeInColumn(\n    originColumnIndex\n  )(tr);\n  const { indexes: indexesTargetColumn } = getSelectionRangeInColumn(\n    targetColumnIndex\n  )(tr);\n\n  if (indexesOriginColumn.indexOf(targetColumnIndex) > -1) {\n    return tr;\n  }\n\n  if (!options.tryToFit && indexesTargetColumn.length > 1) {\n    checkInvalidMovements(\n      originColumnIndex,\n      targetColumnIndex,\n      indexesTargetColumn,\n      'column'\n    );\n  }\n\n  const newTable = moveTableColumn(\n    table,\n    indexesOriginColumn,\n    indexesTargetColumn,\n    options.direction\n  );\n\n  return cloneTr(tr).replaceWith(\n    table.pos,\n    table.pos + table.node.nodeSize,\n    newTable\n  );\n};\n\n// :: (rowIndex: number, clonePreviousRow?: boolean) → (tr: Transaction) → Transaction\n// Returns a new transaction that adds a new row at index `rowIndex`. Optionally clone the previous row.\n//\n// ```javascript\n// dispatch(\n//   addRowAt(i)(state.tr)\n// );\n// ```\n//\n// ```javascript\n// dispatch(\n//   addRowAt(i, true)(state.tr)\n// );\n// ```\nexport const addRowAt = (rowIndex, clonePreviousRow) => tr => {\n  const table = findTable(tr.selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    const cloneRowIndex = rowIndex - 1;\n\n    if (clonePreviousRow && cloneRowIndex >= 0) {\n      return cloneTr(cloneRowAt(cloneRowIndex)(tr));\n    }\n\n    if (rowIndex >= 0 && rowIndex <= map.height) {\n      return cloneTr(\n        addRow(\n          tr,\n          {\n            map,\n            tableStart: table.start,\n            table: table.node\n          },\n          rowIndex\n        )\n      );\n    }\n  }\n  return tr;\n};\n\n// :: (cloneRowIndex: number) → (tr: Transaction) → Transaction\n// Returns a new transaction that adds a new row after `cloneRowIndex`, cloning the row attributes at `cloneRowIndex`.\n//\n// ```javascript\n// dispatch(\n//   cloneRowAt(i)(state.tr)\n// );\n// ```\nexport const cloneRowAt = rowIndex => tr => {\n  const table = findTable(tr.selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n\n    if (rowIndex >= 0 && rowIndex <= map.height) {\n      const tableNode = table.node;\n      const tableNodes = tableNodeTypes(tableNode.type.schema);\n\n      let rowPos = table.start;\n      for (let i = 0; i < rowIndex + 1; i++) {\n        rowPos += tableNode.child(i).nodeSize;\n      }\n\n      const cloneRow = tableNode.child(rowIndex);\n      // Re-create the same nodes with same attrs, dropping the node content.\n      let cells = [];\n      let rowWidth = 0;\n      cloneRow.forEach(cell => {\n        // If we're copying a row with rowspan somewhere, we dont want to copy that cell\n        // We'll increment its span below.\n        if (cell.attrs.rowspan === 1) {\n          rowWidth += cell.attrs.colspan;\n          cells.push(\n            tableNodes[cell.type.spec.tableRole].createAndFill(\n              cell.attrs,\n              cell.marks\n            )\n          );\n        }\n      });\n\n      // If a higher row spans past our clone row, bump the higher row to cover this new row too.\n      if (rowWidth < map.width) {\n        let rowSpanCells = [];\n        for (let i = rowIndex; i >= 0; i--) {\n          let foundCells = filterCellsInRow(i, (cell, tr) => {\n            const rowspan = cell.node.attrs.rowspan;\n            const spanRange = i + rowspan;\n            return rowspan > 1 && spanRange > rowIndex;\n          })(tr);\n          rowSpanCells.push(...foundCells);\n        }\n\n        if (rowSpanCells.length) {\n          rowSpanCells.forEach(cell => {\n            tr = setCellAttrs(cell, {\n              rowspan: cell.node.attrs.rowspan + 1\n            })(tr);\n          });\n        }\n      }\n\n      return safeInsert(tableNodes.row.create(cloneRow.attrs, cells), rowPos)(\n        tr\n      );\n    }\n  }\n  return tr;\n};\n\n// :: (columnIndex: number) → (tr: Transaction) → Transaction\n// Returns a new transaction that removes a column at index `columnIndex`. If there is only one column left, it will remove the entire table.\n//\n// ```javascript\n// dispatch(\n//   removeColumnAt(i)(state.tr)\n// );\n// ```\nexport const removeColumnAt = columnIndex => tr => {\n  const table = findTable(tr.selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    if (columnIndex === 0 && map.width === 1) {\n      return removeTable(tr);\n    } else if (columnIndex >= 0 && columnIndex <= map.width) {\n      removeColumn(\n        tr,\n        {\n          map,\n          tableStart: table.start,\n          table: table.node\n        },\n        columnIndex\n      );\n      return cloneTr(tr);\n    }\n  }\n  return tr;\n};\n\n// :: (rowIndex: number) → (tr: Transaction) → Transaction\n// Returns a new transaction that removes a row at index `rowIndex`. If there is only one row left, it will remove the entire table.\n//\n// ```javascript\n// dispatch(\n//   removeRowAt(i)(state.tr)\n// );\n// ```\nexport const removeRowAt = rowIndex => tr => {\n  const table = findTable(tr.selection);\n  if (table) {\n    const map = TableMap.get(table.node);\n    if (rowIndex === 0 && map.height === 1) {\n      return removeTable(tr);\n    } else if (rowIndex >= 0 && rowIndex <= map.height) {\n      removeRow(\n        tr,\n        {\n          map,\n          tableStart: table.start,\n          table: table.node\n        },\n        rowIndex\n      );\n      return cloneTr(tr);\n    }\n  }\n  return tr;\n};\n\n// :: (tr: Transaction) → Transaction\n// Returns a new transaction that removes a table node if the cursor is inside of it.\n//\n// ```javascript\n// dispatch(\n//   removeTable(state.tr)\n// );\n// ```\nexport const removeTable = tr => {\n  const { $from } = tr.selection;\n  for (let depth = $from.depth; depth > 0; depth--) {\n    let node = $from.node(depth);\n    if (node.type.spec.tableRole === 'table') {\n      return cloneTr(tr.delete($from.before(depth), $from.after(depth)));\n    }\n  }\n  return tr;\n};\n\n// :: (tr: Transaction) → Transaction\n// Returns a new transaction that removes selected columns.\n//\n// ```javascript\n// dispatch(\n//   removeSelectedColumns(state.tr)\n// );\n// ```\nexport const removeSelectedColumns = tr => {\n  const { selection } = tr;\n  if (isTableSelected(selection)) {\n    return removeTable(tr);\n  }\n  if (isCellSelection(selection)) {\n    const table = findTable(selection);\n    if (table) {\n      const map = TableMap.get(table.node);\n      const rect = map.rectBetween(\n        selection.$anchorCell.pos - table.start,\n        selection.$headCell.pos - table.start\n      );\n\n      if (rect.left == 0 && rect.right == map.width) {\n        return false;\n      }\n\n      const pmTableRect = Object.assign({}, rect, {\n        map,\n        table: table.node,\n        tableStart: table.start\n      });\n\n      for (let i = pmTableRect.right - 1; ; i--) {\n        removeColumn(tr, pmTableRect, i);\n        if (i === pmTableRect.left) {\n          break;\n        }\n        pmTableRect.table = pmTableRect.tableStart\n          ? tr.doc.nodeAt(pmTableRect.tableStart - 1)\n          : tr.doc;\n        pmTableRect.map = TableMap.get(pmTableRect.table);\n      }\n      return cloneTr(tr);\n    }\n  }\n  return tr;\n};\n\n// :: (tr: Transaction) → Transaction\n// Returns a new transaction that removes selected rows.\n//\n// ```javascript\n// dispatch(\n//   removeSelectedRows(state.tr)\n// );\n// ```\nexport const removeSelectedRows = tr => {\n  const { selection } = tr;\n  if (isTableSelected(selection)) {\n    return removeTable(tr);\n  }\n  if (isCellSelection(selection)) {\n    const table = findTable(selection);\n    if (table) {\n      const map = TableMap.get(table.node);\n      const rect = map.rectBetween(\n        selection.$anchorCell.pos - table.start,\n        selection.$headCell.pos - table.start\n      );\n\n      if (rect.top == 0 && rect.bottom == map.height) {\n        return false;\n      }\n\n      const pmTableRect = Object.assign({}, rect, {\n        map,\n        table: table.node,\n        tableStart: table.start\n      });\n\n      for (let i = pmTableRect.bottom - 1; ; i--) {\n        removeRow(tr, pmTableRect, i);\n        if (i === pmTableRect.top) {\n          break;\n        }\n        pmTableRect.table = pmTableRect.tableStart\n          ? tr.doc.nodeAt(pmTableRect.tableStart - 1)\n          : tr.doc;\n        pmTableRect.map = TableMap.get(pmTableRect.table);\n      }\n\n      return cloneTr(tr);\n    }\n  }\n  return tr;\n};\n\n// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction\n// Returns a new transaction that removes a column closest to a given `$pos`.\n//\n// ```javascript\n// dispatch(\n//   removeColumnClosestToPos(state.doc.resolve(3))(state.tr)\n// );\n// ```\nexport const removeColumnClosestToPos = $pos => tr => {\n  const rect = findCellRectClosestToPos($pos);\n  if (rect) {\n    return removeColumnAt(rect.left)(setTextSelection($pos.pos)(tr));\n  }\n  return tr;\n};\n\n// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction\n// Returns a new transaction that removes a row closest to a given `$pos`.\n//\n// ```javascript\n// dispatch(\n//   removeRowClosestToPos(state.doc.resolve(3))(state.tr)\n// );\n// ```\nexport const removeRowClosestToPos = $pos => tr => {\n  const rect = findCellRectClosestToPos($pos);\n  if (rect) {\n    return removeRowAt(rect.top)(setTextSelection($pos.pos)(tr));\n  }\n  return tr;\n};\n\n// :: (columnIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction\n// Returns a new transaction that maps a given `cellTransform` function to each cell in a column at a given `columnIndex`.\n// It will set the selection into the last cell of the column if `setCursorToLastCell` param is set to `true`.\n//\n// ```javascript\n// dispatch(\n//   forEachCellInColumn(0, (cell, tr) => emptyCell(cell, state.schema)(tr))(state.tr)\n// );\n// ```\nexport const forEachCellInColumn = (\n  columnIndex,\n  cellTransform,\n  setCursorToLastCell\n) => tr => {\n  const cells = getCellsInColumn(columnIndex)(tr.selection);\n  if (cells) {\n    for (let i = cells.length - 1; i >= 0; i--) {\n      tr = cellTransform(cells[i], tr);\n    }\n    if (setCursorToLastCell) {\n      const $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));\n      tr.setSelection(Selection.near($pos));\n    }\n    return cloneTr(tr);\n  }\n  return tr;\n};\n\n// :: (rowIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction\n// Returns a new transaction that maps a given `cellTransform` function to each cell in a row at a given `rowIndex`.\n// It will set the selection into the last cell of the row if `setCursorToLastCell` param is set to `true`.\n//\n// ```javascript\n// dispatch(\n//   forEachCellInRow(0, (cell, tr) => setCellAttrs(cell, { background: 'red' })(tr))(state.tr)\n// );\n// ```\nexport const forEachCellInRow = (\n  rowIndex,\n  cellTransform,\n  setCursorToLastCell\n) => tr => {\n  const cells = getCellsInRow(rowIndex)(tr.selection);\n  if (cells) {\n    for (let i = cells.length - 1; i >= 0; i--) {\n      tr = cellTransform(cells[i], tr);\n    }\n    if (setCursorToLastCell) {\n      const $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));\n      tr.setSelection(Selection.near($pos));\n    }\n  }\n  return tr;\n};\n\n// :: (cell: {pos: number, start: number, node: ProseMirrorNode}, attrs: Object) → (tr: Transaction) → Transaction\n// Returns a new transaction that sets given `attrs` to a given `cell`.\n//\n// ```javascript\n// dispatch(\n//   setCellAttrs(findCellClosestToPos($pos), { background: 'blue' })(tr);\n// );\n// ```\nexport const setCellAttrs = (cell, attrs) => tr => {\n  if (cell) {\n    tr.setNodeMarkup(cell.pos, null, Object.assign({}, cell.node.attrs, attrs));\n    return cloneTr(tr);\n  }\n  return tr;\n};\n\n// :: (schema: Schema, rowsCount: ?number, colsCount: ?number, withHeaderRow: ?boolean, cellContent: ?Node) → Node\n// Returns a table node of a given size.\n// `withHeaderRow` defines whether the first row of the table will be a header row.\n// `cellContent` defines the content of each cell.\n//\n// ```javascript\n// const table = createTable(state.schema); // 3x3 table node\n// dispatch(\n//   tr.replaceSelectionWith(table).scrollIntoView()\n// );\n// ```\nexport const createTable = (\n  schema,\n  rowsCount = 3,\n  colsCount = 3,\n  withHeaderRow = true,\n  cellContent = null\n) => {\n  const {\n    cell: tableCell,\n    header_cell: tableHeader,\n    row: tableRow,\n    table\n  } = tableNodeTypes(schema);\n\n  const cells = [];\n  const headerCells = [];\n  for (let i = 0; i < colsCount; i++) {\n    cells.push(createCell(tableCell, cellContent));\n\n    if (withHeaderRow) {\n      headerCells.push(createCell(tableHeader, cellContent));\n    }\n  }\n\n  const rows = [];\n  for (let i = 0; i < rowsCount; i++) {\n    rows.push(\n      tableRow.createChecked(\n        null,\n        withHeaderRow && i === 0 ? headerCells : cells\n      )\n    );\n  }\n\n  return table.createChecked(null, rows);\n};\n\n// :: ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}\n// Iterates over parent nodes, returning a table cell or a table header node closest to a given `$pos`.\n//\n// ```javascript\n// const cell = findCellClosestToPos(state.selection.$from);\n// ```\nexport const findCellClosestToPos = $pos => {\n  const predicate = node =>\n    node.type.spec.tableRole && /cell/i.test(node.type.spec.tableRole);\n  return findParentNodeClosestToPos($pos, predicate);\n};\n\n// :: ($pos: ResolvedPos) → ?{left: number, top: number, right: number, bottom: number}\n// Returns the rectangle spanning a cell closest to a given `$pos`.\n//\n// ```javascript\n// dispatch(\n//   findCellRectClosestToPos(state.selection.$from)\n// );\n// ```\nexport const findCellRectClosestToPos = $pos => {\n  const cell = findCellClosestToPos($pos);\n  if (cell) {\n    const table = findTableClosestToPos($pos);\n    const map = TableMap.get(table.node);\n    const cellPos = cell.pos - table.start;\n    return map.rectBetween(cellPos, cellPos);\n  }\n};\n\nconst filterCellsInRow = (rowIndex, predicate) => tr => {\n  let foundCells = [];\n  const cells = getCellsInRow(rowIndex)(tr.selection);\n  if (cells) {\n    for (let j = cells.length - 1; j >= 0; j--) {\n      if (predicate(cells[j], tr)) {\n        foundCells.push(cells[j]);\n      }\n    }\n  }\n\n  return foundCells;\n};\n\n// :: (columnIndex: number) → (tr: Transaction) → {$anchor: ResolvedPos, $head: ResolvedPos, indexes: [number]}\n// Returns a range of rectangular selection spanning all merged cells around a column at index `columnIndex`.\n//\n// ```javascript\n// const range = getSelectionRangeInColumn(3)(state.tr);\n// ```\nexport const getSelectionRangeInColumn = columnIndex => tr => {\n  let startIndex = columnIndex;\n  let endIndex = columnIndex;\n\n  // looking for selection start column (startIndex)\n  for (let i = columnIndex; i >= 0; i--) {\n    const cells = getCellsInColumn(i)(tr.selection);\n    if (cells) {\n      cells.forEach(cell => {\n        let maybeEndIndex = cell.node.attrs.colspan + i - 1;\n        if (maybeEndIndex >= startIndex) {\n          startIndex = i;\n        }\n        if (maybeEndIndex > endIndex) {\n          endIndex = maybeEndIndex;\n        }\n      });\n    }\n  }\n  // looking for selection end column (endIndex)\n  for (let i = columnIndex; i <= endIndex; i++) {\n    const cells = getCellsInColumn(i)(tr.selection);\n    if (cells) {\n      cells.forEach(cell => {\n        let maybeEndIndex = cell.node.attrs.colspan + i - 1;\n        if (cell.node.attrs.colspan > 1 && maybeEndIndex > endIndex) {\n          endIndex = maybeEndIndex;\n        }\n      });\n    }\n  }\n\n  // filter out columns without cells (where all rows have colspan > 1 in the same column)\n  const indexes = [];\n  for (let i = startIndex; i <= endIndex; i++) {\n    const maybeCells = getCellsInColumn(i)(tr.selection);\n    if (maybeCells && maybeCells.length) {\n      indexes.push(i);\n    }\n  }\n  startIndex = indexes[0];\n  endIndex = indexes[indexes.length - 1];\n\n  const firstSelectedColumnCells = getCellsInColumn(startIndex)(tr.selection);\n  const firstRowCells = getCellsInRow(0)(tr.selection);\n  const $anchor = tr.doc.resolve(\n    firstSelectedColumnCells[firstSelectedColumnCells.length - 1].pos\n  );\n\n  let headCell;\n  for (let i = endIndex; i >= startIndex; i--) {\n    const columnCells = getCellsInColumn(i)(tr.selection);\n    if (columnCells && columnCells.length) {\n      for (let j = firstRowCells.length - 1; j >= 0; j--) {\n        if (firstRowCells[j].pos === columnCells[0].pos) {\n          headCell = columnCells[0];\n          break;\n        }\n      }\n      if (headCell) {\n        break;\n      }\n    }\n  }\n\n  const $head = tr.doc.resolve(headCell.pos);\n  return { $anchor, $head, indexes };\n};\n\n// :: (rowIndex: number) → (tr: Transaction) → {$anchor: ResolvedPos, $head: ResolvedPos, indexes: [number]}\n// Returns a range of rectangular selection spanning all merged cells around a row at index `rowIndex`.\n//\n// ```javascript\n// const range = getSelectionRangeInRow(3)(state.tr);\n// ```\nexport const getSelectionRangeInRow = rowIndex => tr => {\n  let startIndex = rowIndex;\n  let endIndex = rowIndex;\n  // looking for selection start row (startIndex)\n  for (let i = rowIndex; i >= 0; i--) {\n    const cells = getCellsInRow(i)(tr.selection);\n    cells.forEach(cell => {\n      let maybeEndIndex = cell.node.attrs.rowspan + i - 1;\n      if (maybeEndIndex >= startIndex) {\n        startIndex = i;\n      }\n      if (maybeEndIndex > endIndex) {\n        endIndex = maybeEndIndex;\n      }\n    });\n  }\n  // looking for selection end row (endIndex)\n  for (let i = rowIndex; i <= endIndex; i++) {\n    const cells = getCellsInRow(i)(tr.selection);\n    cells.forEach(cell => {\n      let maybeEndIndex = cell.node.attrs.rowspan + i - 1;\n      if (cell.node.attrs.rowspan > 1 && maybeEndIndex > endIndex) {\n        endIndex = maybeEndIndex;\n      }\n    });\n  }\n\n  // filter out rows without cells (where all columns have rowspan > 1 in the same row)\n  const indexes = [];\n  for (let i = startIndex; i <= endIndex; i++) {\n    const maybeCells = getCellsInRow(i)(tr.selection);\n    if (maybeCells && maybeCells.length) {\n      indexes.push(i);\n    }\n  }\n  startIndex = indexes[0];\n  endIndex = indexes[indexes.length - 1];\n\n  const firstSelectedRowCells = getCellsInRow(startIndex)(tr.selection);\n  const firstColumnCells = getCellsInColumn(0)(tr.selection);\n  const $anchor = tr.doc.resolve(\n    firstSelectedRowCells[firstSelectedRowCells.length - 1].pos\n  );\n\n  let headCell;\n  for (let i = endIndex; i >= startIndex; i--) {\n    const rowCells = getCellsInRow(i)(tr.selection);\n    if (rowCells && rowCells.length) {\n      for (let j = firstColumnCells.length - 1; j >= 0; j--) {\n        if (firstColumnCells[j].pos === rowCells[0].pos) {\n          headCell = rowCells[0];\n          break;\n        }\n      }\n      if (headCell) {\n        break;\n      }\n    }\n  }\n\n  const $head = tr.doc.resolve(headCell.pos);\n  return { $anchor, $head, indexes };\n};\n","import {findWrapping, liftTarget, canSplit, ReplaceAroundStep} from \"prosemirror-transform\"\nimport {Slice, Fragment, NodeRange} from \"prosemirror-model\"\n\nconst olDOM = [\"ol\", 0], ulDOM = [\"ul\", 0], liDOM = [\"li\", 0]\n\n// :: NodeSpec\n// An ordered list [node spec](#model.NodeSpec). Has a single\n// attribute, `order`, which determines the number at which the list\n// starts counting, and defaults to 1. Represented as an `<ol>`\n// element.\nexport const orderedList = {\n  attrs: {order: {default: 1}},\n  parseDOM: [{tag: \"ol\", getAttrs(dom) {\n    return {order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1}\n  }}],\n  toDOM(node) {\n    return node.attrs.order == 1 ? olDOM : [\"ol\", {start: node.attrs.order}, 0]\n  }\n}\n\n// :: NodeSpec\n// A bullet list node spec, represented in the DOM as `<ul>`.\nexport const bulletList = {\n  parseDOM: [{tag: \"ul\"}],\n  toDOM() { return ulDOM }\n}\n\n// :: NodeSpec\n// A list item (`<li>`) spec.\nexport const listItem = {\n  parseDOM: [{tag: \"li\"}],\n  toDOM() { return liDOM },\n  defining: true\n}\n\nfunction add(obj, props) {\n  let copy = {}\n  for (let prop in obj) copy[prop] = obj[prop]\n  for (let prop in props) copy[prop] = props[prop]\n  return copy\n}\n\n// :: (OrderedMap<NodeSpec>, string, ?string) → OrderedMap<NodeSpec>\n// Convenience function for adding list-related node types to a map\n// specifying the nodes for a schema. Adds\n// [`orderedList`](#schema-list.orderedList) as `\"ordered_list\"`,\n// [`bulletList`](#schema-list.bulletList) as `\"bullet_list\"`, and\n// [`listItem`](#schema-list.listItem) as `\"list_item\"`.\n//\n// `itemContent` determines the content expression for the list items.\n// If you want the commands defined in this module to apply to your\n// list structure, it should have a shape like `\"paragraph block*\"` or\n// `\"paragraph (ordered_list | bullet_list)*\"`. `listGroup` can be\n// given to assign a group name to the list node types, for example\n// `\"block\"`.\nexport function addListNodes(nodes, itemContent, listGroup) {\n  return nodes.append({\n    ordered_list: add(orderedList, {content: \"list_item+\", group: listGroup}),\n    bullet_list: add(bulletList, {content: \"list_item+\", group: listGroup}),\n    list_item: add(listItem, {content: itemContent})\n  })\n}\n\n// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Returns a command function that wraps the selection in a list with\n// the given type an attributes. If `dispatch` is null, only return a\n// value to indicate whether this is possible, but don't actually\n// perform the change.\nexport function wrapInList(listType, attrs) {\n  return function(state, dispatch) {\n    let {$from, $to} = state.selection\n    let range = $from.blockRange($to), doJoin = false, outerRange = range\n    if (!range) return false\n    // This is at the top of an existing list item\n    if (range.depth >= 2 && $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {\n      // Don't do anything if this is the top of the list\n      if ($from.index(range.depth - 1) == 0) return false\n      let $insert = state.doc.resolve(range.start - 2)\n      outerRange = new NodeRange($insert, $insert, range.depth)\n      if (range.endIndex < range.parent.childCount)\n        range = new NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth)\n      doJoin = true\n    }\n    let wrap = findWrapping(outerRange, listType, attrs, range)\n    if (!wrap) return false\n    if (dispatch) dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView())\n    return true\n  }\n}\n\nfunction doWrapInList(tr, range, wrappers, joinBefore, listType) {\n  let content = Fragment.empty\n  for (let i = wrappers.length - 1; i >= 0; i--)\n    content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content))\n\n  tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end,\n                                new Slice(content, 0, 0), wrappers.length, true))\n\n  let found = 0\n  for (let i = 0; i < wrappers.length; i++) if (wrappers[i].type == listType) found = i + 1\n  let splitDepth = wrappers.length - found\n\n  let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent\n  for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {\n    if (!first && canSplit(tr.doc, splitPos, splitDepth)) {\n      tr.split(splitPos, splitDepth)\n      splitPos += 2 * splitDepth\n    }\n    splitPos += parent.child(i).nodeSize\n  }\n  return tr\n}\n\n// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Build a command that splits a non-empty textblock at the top level\n// of a list item by also splitting that list item.\nexport function splitListItem(itemType) {\n  return function(state, dispatch) {\n    let {$from, $to, node} = state.selection\n    if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to)) return false\n    let grandParent = $from.node(-1)\n    if (grandParent.type != itemType) return false\n    if ($from.parent.content.size == 0 && $from.node(-1).childCount == $from.indexAfter(-1)) {\n      // In an empty block. If this is a nested list, the wrapping\n      // list item should be split. Otherwise, bail out and let next\n      // command handle lifting.\n      if ($from.depth == 2 || $from.node(-3).type != itemType ||\n          $from.index(-2) != $from.node(-2).childCount - 1) return false\n      if (dispatch) {\n        let wrap = Fragment.empty, keepItem = $from.index(-1) > 0\n        // Build a fragment containing empty versions of the structure\n        // from the outer list item to the parent node of the cursor\n        for (let d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--)\n          wrap = Fragment.from($from.node(d).copy(wrap))\n        // Add a second list item with an empty default start node\n        wrap = wrap.append(Fragment.from(itemType.createAndFill()))\n        let tr = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new Slice(wrap, keepItem ? 3 : 2, 2))\n        tr.setSelection(state.selection.constructor.near(tr.doc.resolve($from.pos + (keepItem ? 3 : 2))))\n        dispatch(tr.scrollIntoView())\n      }\n      return true\n    }\n    let nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null\n    let tr = state.tr.delete($from.pos, $to.pos)\n    let types = nextType && [null, {type: nextType}]\n    if (!canSplit(tr.doc, $from.pos, 2, types)) return false\n    if (dispatch) dispatch(tr.split($from.pos, 2, types).scrollIntoView())\n    return true\n  }\n}\n\n// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Create a command to lift the list item around the selection up into\n// a wrapping list.\nexport function liftListItem(itemType) {\n  return function(state, dispatch) {\n    let {$from, $to} = state.selection\n    let range = $from.blockRange($to, node => node.childCount && node.firstChild.type == itemType)\n    if (!range) return false\n    if (!dispatch) return true\n    if ($from.node(range.depth - 1).type == itemType) // Inside a parent list\n      return liftToOuterList(state, dispatch, itemType, range)\n    else // Outer list node\n      return liftOutOfList(state, dispatch, range)\n  }\n}\n\nfunction liftToOuterList(state, dispatch, itemType, range) {\n  let tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth)\n  if (end < endOfList) {\n    // There are siblings after the lifted items, which must become\n    // children of the last item\n    tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList,\n                                  new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true))\n    range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth)\n  }\n  dispatch(tr.lift(range, liftTarget(range)).scrollIntoView())\n  return true\n}\n\nfunction liftOutOfList(state, dispatch, range) {\n  let tr = state.tr, list = range.parent\n  // Merge the list items into a single big item\n  for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {\n    pos -= list.child(i).nodeSize\n    tr.delete(pos - 1, pos + 1)\n  }\n  let $start = tr.doc.resolve(range.start), item = $start.nodeAfter\n  let atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount\n  let parent = $start.node(-1), indexBefore = $start.index(-1)\n  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1,\n                         item.content.append(atEnd ? Fragment.empty : Fragment.from(list))))\n    return false\n  let start = $start.pos, end = start + item.nodeSize\n  // Strip off the surrounding list. At the sides where we're not at\n  // the end of the list, the existing list is closed. At sides where\n  // this is the end, it is overwritten to its end.\n  tr.step(new ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1,\n                                new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty)))\n                                          .append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))),\n                                          atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1))\n  dispatch(tr.scrollIntoView())\n  return true\n}\n\n// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Create a command to sink the list item around the selection down\n// into an inner list.\nexport function sinkListItem(itemType) {\n  return function(state, dispatch) {\n    let {$from, $to} = state.selection\n    let range = $from.blockRange($to, node => node.childCount && node.firstChild.type == itemType)\n    if (!range) return false\n    let startIndex = range.startIndex\n    if (startIndex == 0) return false\n    let parent = range.parent, nodeBefore = parent.child(startIndex - 1)\n    if (nodeBefore.type != itemType) return false\n\n    if (dispatch) {\n      let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type\n      let inner = Fragment.from(nestedBefore ? itemType.create() : null)\n      let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))),\n                            nestedBefore ? 3 : 1, 0)\n      let before = range.start, after = range.end\n      dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after,\n                                                   before, after, slice, 1, true))\n               .scrollIntoView())\n    }\n    return true\n  }\n}\n","\n    /*!\n    * tiptap-commands v1.14.6\n    * (c) 2020 überdosis GbR (limited liability)\n    * @license MIT\n    */\n  \nimport { setBlockType, lift, wrapIn } from 'prosemirror-commands';\nexport { autoJoin, baseKeymap, chainCommands, createParagraphNear, deleteSelection, exitCode, joinBackward, joinDown, joinForward, joinUp, lift, liftEmptyBlock, macBaseKeymap, newlineInCode, pcBaseKeymap, selectAll, selectNodeBackward, selectNodeForward, selectParentNode, setBlockType, splitBlock, splitBlockKeepMarks, toggleMark, wrapIn } from 'prosemirror-commands';\nimport { liftListItem, wrapInList } from 'prosemirror-schema-list';\nexport { addListNodes, liftListItem, sinkListItem, splitListItem, wrapInList } from 'prosemirror-schema-list';\nimport { InputRule } from 'prosemirror-inputrules';\nexport { textblockTypeInputRule, wrappingInputRule } from 'prosemirror-inputrules';\nimport { Plugin } from 'prosemirror-state';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { getMarkRange, nodeIsActive } from 'tiptap-utils';\nimport { findParentNode } from 'prosemirror-utils';\n\nfunction insertText (text = '') {\n  return (state, dispatch) => {\n    const {\n      $from\n    } = state.selection;\n    const {\n      pos\n    } = $from.pos;\n    dispatch(state.tr.insertText(text, pos));\n    return true;\n  };\n}\n\nfunction getMarksBetween(start, end, state) {\n  let marks = [];\n  state.doc.nodesBetween(start, end, (node, pos) => {\n    marks = [...marks, ...node.marks.map(mark => ({\n      start: pos,\n      end: pos + node.nodeSize,\n      mark\n    }))];\n  });\n  return marks;\n}\n\nfunction markInputRule (regexp, markType, getAttrs) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    const attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n    const {\n      tr\n    } = state;\n    const m = match.length - 1;\n    let markEnd = end;\n    let markStart = start;\n\n    if (match[m]) {\n      const matchStart = start + match[0].indexOf(match[m - 1]);\n      const matchEnd = matchStart + match[m - 1].length - 1;\n      const textStart = matchStart + match[m - 1].lastIndexOf(match[m]);\n      const textEnd = textStart + match[m].length;\n      const excludedMarks = getMarksBetween(start, end, state).filter(item => {\n        const {\n          excluded\n        } = item.mark.type;\n        return excluded.find(type => type.name === markType.name);\n      }).filter(item => item.end > matchStart);\n\n      if (excludedMarks.length) {\n        return false;\n      }\n\n      if (textEnd < matchEnd) {\n        tr.delete(textEnd, matchEnd);\n      }\n\n      if (textStart > matchStart) {\n        tr.delete(matchStart, textStart);\n      }\n\n      markStart = matchStart;\n      markEnd = markStart + match[m].length;\n    }\n\n    tr.addMark(markStart, markEnd, markType.create(attrs));\n    tr.removeStoredMark(markType);\n    return tr;\n  });\n}\n\nfunction nodeInputRule (regexp, type, getAttrs) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    const attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n    const {\n      tr\n    } = state;\n\n    if (match[0]) {\n      tr.replaceWith(start - 1, end, type.create(attrs));\n    }\n\n    return tr;\n  });\n}\n\nfunction pasteRule (regexp, type, getAttrs) {\n  const handler = fragment => {\n    const nodes = [];\n    fragment.forEach(child => {\n      if (child.isText) {\n        const {\n          text\n        } = child;\n        let pos = 0;\n        let match;\n\n        do {\n          match = regexp.exec(text);\n\n          if (match) {\n            const start = match.index;\n            const end = start + match[0].length;\n            const attrs = getAttrs instanceof Function ? getAttrs(match[0]) : getAttrs;\n\n            if (start > 0) {\n              nodes.push(child.cut(pos, start));\n            }\n\n            nodes.push(child.cut(start, end).mark(type.create(attrs).addToSet(child.marks)));\n            pos = end;\n          }\n        } while (match);\n\n        if (pos < text.length) {\n          nodes.push(child.cut(pos));\n        }\n      } else {\n        nodes.push(child.copy(handler(child.content)));\n      }\n    });\n    return Fragment.fromArray(nodes);\n  };\n\n  return new Plugin({\n    props: {\n      transformPasted: slice => new Slice(handler(slice.content), slice.openStart, slice.openEnd)\n    }\n  });\n}\n\nfunction markPasteRule (regexp, type, getAttrs) {\n  const handler = (fragment, parent) => {\n    const nodes = [];\n    fragment.forEach(child => {\n      if (child.isText) {\n        const {\n          text,\n          marks\n        } = child;\n        let pos = 0;\n        let match;\n        const isLink = !!marks.filter(x => x.type.name === 'link')[0]; // eslint-disable-next-line\n\n        while (!isLink && (match = regexp.exec(text)) !== null) {\n          if (parent && parent.type.allowsMarkType(type) && match[1]) {\n            const start = match.index;\n            const end = start + match[0].length;\n            const textStart = start + match[0].indexOf(match[1]);\n            const textEnd = textStart + match[1].length;\n            const attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs; // adding text before markdown to nodes\n\n            if (start > 0) {\n              nodes.push(child.cut(pos, start));\n            } // adding the markdown part to nodes\n\n\n            nodes.push(child.cut(textStart, textEnd).mark(type.create(attrs).addToSet(child.marks)));\n            pos = end;\n          }\n        } // adding rest of text to nodes\n\n\n        if (pos < text.length) {\n          nodes.push(child.cut(pos));\n        }\n      } else {\n        nodes.push(child.copy(handler(child.content, child)));\n      }\n    });\n    return Fragment.fromArray(nodes);\n  };\n\n  return new Plugin({\n    props: {\n      transformPasted: slice => new Slice(handler(slice.content), slice.openStart, slice.openEnd)\n    }\n  });\n}\n\nfunction removeMark (type) {\n  return (state, dispatch) => {\n    const {\n      tr,\n      selection\n    } = state;\n    let {\n      from,\n      to\n    } = selection;\n    const {\n      $from,\n      empty\n    } = selection;\n\n    if (empty) {\n      const range = getMarkRange($from, type);\n      from = range.from;\n      to = range.to;\n    }\n\n    tr.removeMark(from, to, type);\n    return dispatch(tr);\n  };\n}\n\nfunction replaceText (range = null, type, attrs = {}) {\n  return (state, dispatch) => {\n    const {\n      $from,\n      $to\n    } = state.selection;\n    const index = $from.index();\n    const from = range ? range.from : $from.pos;\n    const to = range ? range.to : $to.pos;\n\n    if (!$from.parent.canReplaceWith(index, index, type)) {\n      return false;\n    }\n\n    if (dispatch) {\n      dispatch(state.tr.replaceWith(from, to, type.create(attrs)));\n    }\n\n    return true;\n  };\n}\n\nfunction setInlineBlockType (type, attrs = {}) {\n  return (state, dispatch) => {\n    const {\n      $from\n    } = state.selection;\n    const index = $from.index();\n\n    if (!$from.parent.canReplaceWith(index, index, type)) {\n      return false;\n    }\n\n    if (dispatch) {\n      dispatch(state.tr.replaceSelectionWith(type.create(attrs)));\n    }\n\n    return true;\n  };\n}\n\n// see https://github.com/ProseMirror/prosemirror-transform/blob/main/src/structure.js\n// Since this piece of code was \"borrowed\" from prosemirror, ESLint rules are ignored.\n\n/* eslint-disable max-len, no-plusplus, no-undef, eqeqeq */\n\nfunction canSplit(doc, pos, depth = 1, typesAfter) {\n  const $pos = doc.resolve(pos);\n  const base = $pos.depth - depth;\n  const innerType = typesAfter && typesAfter[typesAfter.length - 1] || $pos.parent;\n  if (base < 0 || $pos.parent.type.spec.isolating || !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) || !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount))) return false;\n\n  for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n    const node = $pos.node(d);\n    const index = $pos.index(d);\n    if (node.type.spec.isolating) return false;\n    let rest = node.content.cutByIndex(index, node.childCount);\n    const after = typesAfter && typesAfter[i] || node;\n    if (after != node) rest = rest.replaceChild(0, after.type.create(after.attrs));\n    /* Change starts from here */\n    // if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n    //   return false\n\n    if (!node.canReplace(index + 1, node.childCount)) return false;\n    /* Change ends here */\n  }\n\n  const index = $pos.indexAfter(base);\n  const baseType = typesAfter && typesAfter[0];\n  return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);\n} // this is a copy of splitListItem\n// see https://github.com/ProseMirror/prosemirror-schema-list/blob/main/src/schema-list.js\n\n\nfunction splitToDefaultListItem(itemType) {\n  return function (state, dispatch) {\n    const {\n      $from,\n      $to,\n      node\n    } = state.selection;\n    if (node && node.isBlock || $from.depth < 2 || !$from.sameParent($to)) return false;\n    const grandParent = $from.node(-1);\n    if (grandParent.type != itemType) return false;\n\n    if ($from.parent.content.size == 0) {\n      // In an empty block. If this is a nested list, the wrapping\n      // list item should be split. Otherwise, bail out and let next\n      // command handle lifting.\n      if ($from.depth == 2 || $from.node(-3).type != itemType || $from.index(-2) != $from.node(-2).childCount - 1) return false;\n\n      if (dispatch) {\n        let wrap = Fragment.empty;\n        const keepItem = $from.index(-1) > 0; // Build a fragment containing empty versions of the structure\n        // from the outer list item to the parent node of the cursor\n\n        for (let d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--) wrap = Fragment.from($from.node(d).copy(wrap)); // Add a second list item with an empty default start node\n\n\n        wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n        const tr = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new Slice(wrap, keepItem ? 3 : 2, 2));\n        tr.setSelection(state.selection.constructor.near(tr.doc.resolve($from.pos + (keepItem ? 3 : 2))));\n        dispatch(tr.scrollIntoView());\n      }\n\n      return true;\n    }\n\n    const nextType = $to.pos == $from.end() ? grandParent.contentMatchAt($from.indexAfter(-1)).defaultType : null;\n    const tr = state.tr.delete($from.pos, $to.pos);\n    /* Change starts from here */\n    // let types = nextType && [null, {type: nextType}]\n\n    let types = nextType && [{\n      type: itemType\n    }, {\n      type: nextType\n    }];\n    if (!types) types = [{\n      type: itemType\n    }, null];\n    /* Change ends here */\n\n    if (!canSplit(tr.doc, $from.pos, 2, types)) return false;\n    if (dispatch) dispatch(tr.split($from.pos, 2, types).scrollIntoView());\n    return true;\n  };\n}\n/* eslint-enable max-len, no-plusplus, no-undef, eqeqeq */\n\nfunction toggleBlockType (type, toggletype, attrs = {}) {\n  return (state, dispatch, view) => {\n    const isActive = nodeIsActive(state, type, attrs);\n\n    if (isActive) {\n      return setBlockType(toggletype)(state, dispatch, view);\n    }\n\n    return setBlockType(type, attrs)(state, dispatch, view);\n  };\n}\n\nfunction isList(node, schema) {\n  return node.type === schema.nodes.bullet_list || node.type === schema.nodes.ordered_list || node.type === schema.nodes.todo_list;\n}\n\nfunction toggleList(listType, itemType) {\n  return (state, dispatch, view) => {\n    const {\n      schema,\n      selection\n    } = state;\n    const {\n      $from,\n      $to\n    } = selection;\n    const range = $from.blockRange($to);\n\n    if (!range) {\n      return false;\n    }\n\n    const parentList = findParentNode(node => isList(node, schema))(selection);\n\n    if (range.depth >= 1 && parentList && range.depth - parentList.depth <= 1) {\n      if (parentList.node.type === listType) {\n        return liftListItem(itemType)(state, dispatch, view);\n      }\n\n      if (isList(parentList.node, schema) && listType.validContent(parentList.node.content)) {\n        const {\n          tr\n        } = state;\n        tr.setNodeMarkup(parentList.pos, listType);\n\n        if (dispatch) {\n          dispatch(tr);\n        }\n\n        return false;\n      }\n    }\n\n    return wrapInList(listType)(state, dispatch, view);\n  };\n}\n\nfunction toggleWrap (type, attrs = {}) {\n  return (state, dispatch, view) => {\n    const isActive = nodeIsActive(state, type, attrs);\n\n    if (isActive) {\n      return lift(state, dispatch);\n    }\n\n    return wrapIn(type, attrs)(state, dispatch, view);\n  };\n}\n\nfunction updateMark (type, attrs) {\n  return (state, dispatch) => {\n    const {\n      tr,\n      selection,\n      doc\n    } = state;\n    const {\n      ranges,\n      empty\n    } = selection;\n\n    if (empty) {\n      const {\n        from,\n        to\n      } = getMarkRange(selection.$from, type);\n\n      if (doc.rangeHasMark(from, to, type)) {\n        tr.removeMark(from, to, type);\n      }\n\n      tr.addMark(from, to, type.create(attrs));\n    } else {\n      ranges.forEach(ref$1 => {\n        const {\n          $to,\n          $from\n        } = ref$1;\n\n        if (doc.rangeHasMark($from.pos, $to.pos, type)) {\n          tr.removeMark($from.pos, $to.pos, type);\n        }\n\n        tr.addMark($from.pos, $to.pos, type.create(attrs));\n      });\n    }\n\n    return dispatch(tr);\n  };\n}\n\nexport { insertText, markInputRule, markPasteRule, nodeInputRule, pasteRule, removeMark, replaceText, setInlineBlockType, splitToDefaultListItem, toggleBlockType, toggleList, toggleWrap, updateMark };\n","import {Plugin, PluginKey, TextSelection} from \"prosemirror-state\"\n\nclass Rebaseable {\n  constructor(step, inverted, origin) {\n    this.step = step\n    this.inverted = inverted\n    this.origin = origin\n  }\n}\n\n// : ([Rebaseable], [Step], Transform) → [Rebaseable]\n// Undo a given set of steps, apply a set of other steps, and then\n// redo them.\nexport function rebaseSteps(steps, over, transform) {\n  for (let i = steps.length - 1; i >= 0; i--) transform.step(steps[i].inverted)\n  for (let i = 0; i < over.length; i++) transform.step(over[i])\n  let result = []\n  for (let i = 0, mapFrom = steps.length; i < steps.length; i++) {\n    let mapped = steps[i].step.map(transform.mapping.slice(mapFrom))\n    mapFrom--\n    if (mapped && !transform.maybeStep(mapped).failed) {\n      transform.mapping.setMirror(mapFrom, transform.steps.length - 1)\n      result.push(new Rebaseable(mapped, mapped.invert(transform.docs[transform.docs.length - 1]), steps[i].origin))\n    }\n  }\n  return result\n}\n\n// This state field accumulates changes that have to be sent to the\n// central authority in the collaborating group and makes it possible\n// to integrate changes made by peers into our local document. It is\n// defined by the plugin, and will be available as the `collab` field\n// in the resulting editor state.\nclass CollabState {\n  constructor(version, unconfirmed) {\n    // : number\n    // The version number of the last update received from the central\n    // authority. Starts at 0 or the value of the `version` property\n    // in the option object, for the editor's value when the option\n    // was enabled.\n    this.version = version\n\n    // : [Rebaseable]\n    // The local steps that havent been successfully sent to the\n    // server yet.\n    this.unconfirmed = unconfirmed\n  }\n}\n\nfunction unconfirmedFrom(transform) {\n  let result = []\n  for (let i = 0; i < transform.steps.length; i++)\n    result.push(new Rebaseable(transform.steps[i],\n                               transform.steps[i].invert(transform.docs[i]),\n                               transform))\n  return result\n}\n\nconst collabKey = new PluginKey(\"collab\")\n\n// :: (?Object) → Plugin\n//\n// Creates a plugin that enables the collaborative editing framework\n// for the editor.\n//\n//   config::- An optional set of options\n//\n//     version:: ?number\n//     The starting version number of the collaborative editing.\n//     Defaults to 0.\n//\n//     clientID:: ?union<number, string>\n//     This client's ID, used to distinguish its changes from those of\n//     other clients. Defaults to a random 32-bit number.\nexport function collab(config = {}) {\n  config = {version: config.version || 0,\n            clientID: config.clientID == null ? Math.floor(Math.random() * 0xFFFFFFFF) : config.clientID}\n\n  return new Plugin({\n    key: collabKey,\n\n    state: {\n      init: () => new CollabState(config.version, []),\n      apply(tr, collab) {\n        let newState = tr.getMeta(collabKey)\n        if (newState)\n          return newState\n        if (tr.docChanged)\n          return new CollabState(collab.version, collab.unconfirmed.concat(unconfirmedFrom(tr)))\n        return collab\n      }\n    },\n\n    config,\n    // This is used to notify the history plugin to not merge steps,\n    // so that the history can be rebased.\n    historyPreserveItems: true\n  })\n}\n\n// :: (state: EditorState, steps: [Step], clientIDs: [union<number, string>], options: ?Object) → Transaction\n// Create a transaction that represents a set of new steps received from\n// the authority. Applying this transaction moves the state forward to\n// adjust to the authority's view of the document.\n//\n//   options::- Additional options.\n//\n//     mapSelectionBackward:: ?boolean\n//     When enabled (the default is `false`), if the current selection\n//     is a [text selection](#state.TextSelection), its sides are\n//     mapped with a negative bias for this transaction, so that\n//     content inserted at the cursor ends up after the cursor. Users\n//     usually prefer this, but it isn't done by default for reasons\n//     of backwards compatibility.\nexport function receiveTransaction(state, steps, clientIDs, options) {\n  // Pushes a set of steps (received from the central authority) into\n  // the editor state (which should have the collab plugin enabled).\n  // Will recognize its own changes, and confirm unconfirmed steps as\n  // appropriate. Remaining unconfirmed steps will be rebased over\n  // remote steps.\n  let collabState = collabKey.getState(state)\n  let version = collabState.version + steps.length\n  let ourID = collabKey.get(state).spec.config.clientID\n\n  // Find out which prefix of the steps originated with us\n  let ours = 0\n  while (ours < clientIDs.length && clientIDs[ours] == ourID) ++ours\n  let unconfirmed = collabState.unconfirmed.slice(ours)\n  steps = ours ? steps.slice(ours) : steps\n\n  // If all steps originated with us, we're done.\n  if (!steps.length)\n    return state.tr.setMeta(collabKey, new CollabState(version, unconfirmed))\n\n  let nUnconfirmed = unconfirmed.length\n  let tr = state.tr\n  if (nUnconfirmed) {\n    unconfirmed = rebaseSteps(unconfirmed, steps, tr)\n  } else {\n    for (let i = 0; i < steps.length; i++) tr.step(steps[i])\n    unconfirmed = []\n  }\n\n  let newCollabState = new CollabState(version, unconfirmed)\n  if (options && options.mapSelectionBackward && state.selection instanceof TextSelection) {\n    tr.setSelection(TextSelection.between(tr.doc.resolve(tr.mapping.map(state.selection.anchor, -1)),\n                                          tr.doc.resolve(tr.mapping.map(state.selection.head, -1)), -1))\n    tr.updated &= ~1\n  }\n  return tr.setMeta(\"rebased\", nUnconfirmed).setMeta(\"addToHistory\", false).setMeta(collabKey, newCollabState)\n}\n\n// :: (state: EditorState) → ?{version: number, steps: [Step], clientID: union<number, string>, origins: [Transaction]}\n// Provides data describing the editor's unconfirmed steps, which need\n// to be sent to the central authority. Returns null when there is\n// nothing to send.\n//\n// `origins` holds the _original_ transactions that produced each\n// steps. This can be useful for looking up time stamps and other\n// metadata for the steps, but note that the steps may have been\n// rebased, whereas the origin transactions are still the old,\n// unchanged objects.\nexport function sendableSteps(state) {\n  let collabState = collabKey.getState(state)\n  if (collabState.unconfirmed.length == 0) return null\n  return {\n    version: collabState.version,\n    steps: collabState.unconfirmed.map(s => s.step),\n    clientID: collabKey.get(state).spec.config.clientID,\n    get origins() { return this._origins || (this._origins = collabState.unconfirmed.map(s => s.origin)) }\n  }\n}\n\n// :: (EditorState) → number\n// Get the version up to which the collab plugin has synced with the\n// central authority.\nexport function getVersion(state) {\n  return collabKey.getState(state).version\n}\n","\n    /*!\n    * tiptap-utils v1.10.4\n    * (c) 2020 überdosis GbR (limited liability)\n    * @license MIT\n    */\n  \nimport { findSelectedNodeOfType, findParentNode } from 'prosemirror-utils';\n\nfunction getMarkAttrs(state, type) {\n  const {\n    from,\n    to\n  } = state.selection;\n  let marks = [];\n  state.doc.nodesBetween(from, to, node => {\n    marks = [...marks, ...node.marks];\n  });\n  const mark = marks.find(markItem => markItem.type.name === type.name);\n\n  if (mark) {\n    return mark.attrs;\n  }\n\n  return {};\n}\n\nfunction getNodeAttrs(state, type) {\n  const {\n    from,\n    to\n  } = state.selection;\n  let nodes = [];\n  state.doc.nodesBetween(from, to, node => {\n    nodes = [...nodes, node];\n  });\n  const node = nodes.reverse().find(nodeItem => nodeItem.type.name === type.name);\n\n  if (node) {\n    return node.attrs;\n  }\n\n  return {};\n}\n\nfunction getMarkRange($pos = null, type = null) {\n  if (!$pos || !type) {\n    return false;\n  }\n\n  const start = $pos.parent.childAfter($pos.parentOffset);\n\n  if (!start.node) {\n    return false;\n  }\n\n  const link = start.node.marks.find(mark => mark.type === type);\n\n  if (!link) {\n    return false;\n  }\n\n  let startIndex = $pos.index();\n  let startPos = $pos.start() + start.offset;\n  let endIndex = startIndex + 1;\n  let endPos = startPos + start.node.nodeSize;\n\n  while (startIndex > 0 && link.isInSet($pos.parent.child(startIndex - 1).marks)) {\n    startIndex -= 1;\n    startPos -= $pos.parent.child(startIndex).nodeSize;\n  }\n\n  while (endIndex < $pos.parent.childCount && link.isInSet($pos.parent.child(endIndex).marks)) {\n    endPos += $pos.parent.child(endIndex).nodeSize;\n    endIndex += 1;\n  }\n\n  return {\n    from: startPos,\n    to: endPos\n  };\n}\n\nfunction markIsActive(state, type) {\n  const {\n    from,\n    $from,\n    to,\n    empty\n  } = state.selection;\n\n  if (empty) {\n    return !!type.isInSet(state.storedMarks || $from.marks());\n  }\n\n  return !!state.doc.rangeHasMark(from, to, type);\n}\n\nfunction nodeEqualsType({\n  types,\n  node\n}) {\n  return Array.isArray(types) && types.includes(node.type) || node.type === types;\n}\n\nfunction nodeIsActive(state, type, attrs = {}) {\n  const predicate = node => node.type === type;\n\n  const node = findSelectedNodeOfType(type)(state.selection) || findParentNode(predicate)(state.selection);\n\n  if (!Object.keys(attrs).length || !node) {\n    return !!node;\n  }\n\n  return node.node.hasMarkup(type, { ...node.node.attrs,\n    ...attrs\n  });\n}\n\nexport { getMarkAttrs, getMarkRange, getNodeAttrs, markIsActive, nodeEqualsType, nodeIsActive };\n","module.exports=/[!-#%-\\*,-\\/:;\\?@\\[-\\]_\\{\\}\\xA1\\xA7\\xAB\\xB6\\xB7\\xBB\\xBF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u09FD\\u0A76\\u0AF0\\u0C84\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166D\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2308-\\u230B\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E4E\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA8FC\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]|\\uD800[\\uDD00-\\uDD02\\uDF9F\\uDFD0]|\\uD801\\uDD6F|\\uD802[\\uDC57\\uDD1F\\uDD3F\\uDE50-\\uDE58\\uDE7F\\uDEF0-\\uDEF6\\uDF39-\\uDF3F\\uDF99-\\uDF9C]|\\uD803[\\uDF55-\\uDF59]|\\uD804[\\uDC47-\\uDC4D\\uDCBB\\uDCBC\\uDCBE-\\uDCC1\\uDD40-\\uDD43\\uDD74\\uDD75\\uDDC5-\\uDDC8\\uDDCD\\uDDDB\\uDDDD-\\uDDDF\\uDE38-\\uDE3D\\uDEA9]|\\uD805[\\uDC4B-\\uDC4F\\uDC5B\\uDC5D\\uDCC6\\uDDC1-\\uDDD7\\uDE41-\\uDE43\\uDE60-\\uDE6C\\uDF3C-\\uDF3E]|\\uD806[\\uDC3B\\uDE3F-\\uDE46\\uDE9A-\\uDE9C\\uDE9E-\\uDEA2]|\\uD807[\\uDC41-\\uDC45\\uDC70\\uDC71\\uDEF7\\uDEF8]|\\uD809[\\uDC70-\\uDC74]|\\uD81A[\\uDE6E\\uDE6F\\uDEF5\\uDF37-\\uDF3B\\uDF44]|\\uD81B[\\uDE97-\\uDE9A]|\\uD82F\\uDC9F|\\uD836[\\uDE87-\\uDE8B]|\\uD83A[\\uDD5E\\uDD5F]/","/**\n * class Ruler\n *\n * Helper class, used by [[MarkdownIt#core]], [[MarkdownIt#block]] and\n * [[MarkdownIt#inline]] to manage sequences of functions (rules):\n *\n * - keep rules in defined order\n * - assign the name to each rule\n * - enable/disable rules\n * - add/replace rules\n * - allow assign rules to additional named chains (in the same)\n * - cacheing lists of active rules\n *\n * You will not need use this class directly until write plugins. For simple\n * rules control use [[MarkdownIt.disable]], [[MarkdownIt.enable]] and\n * [[MarkdownIt.use]].\n **/\n'use strict';\n\n\n/**\n * new Ruler()\n **/\nfunction Ruler() {\n  // List of added rules. Each element is:\n  //\n  // {\n  //   name: XXX,\n  //   enabled: Boolean,\n  //   fn: Function(),\n  //   alt: [ name2, name3 ]\n  // }\n  //\n  this.__rules__ = [];\n\n  // Cached rule chains.\n  //\n  // First level - chain name, '' for default.\n  // Second level - diginal anchor for fast filtering by charcodes.\n  //\n  this.__cache__ = null;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n// Helper methods, should not be used directly\n\n\n// Find rule index by name\n//\nRuler.prototype.__find__ = function (name) {\n  for (var i = 0; i < this.__rules__.length; i++) {\n    if (this.__rules__[i].name === name) {\n      return i;\n    }\n  }\n  return -1;\n};\n\n\n// Build rules lookup cache\n//\nRuler.prototype.__compile__ = function () {\n  var self = this;\n  var chains = [ '' ];\n\n  // collect unique names\n  self.__rules__.forEach(function (rule) {\n    if (!rule.enabled) { return; }\n\n    rule.alt.forEach(function (altName) {\n      if (chains.indexOf(altName) < 0) {\n        chains.push(altName);\n      }\n    });\n  });\n\n  self.__cache__ = {};\n\n  chains.forEach(function (chain) {\n    self.__cache__[chain] = [];\n    self.__rules__.forEach(function (rule) {\n      if (!rule.enabled) { return; }\n\n      if (chain && rule.alt.indexOf(chain) < 0) { return; }\n\n      self.__cache__[chain].push(rule.fn);\n    });\n  });\n};\n\n\n/**\n * Ruler.at(name, fn [, options])\n * - name (String): rule name to replace.\n * - fn (Function): new rule function.\n * - options (Object): new rule options (not mandatory).\n *\n * Replace rule by name with new function & options. Throws error if name not\n * found.\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * Replace existing typographer replacement rule with new one:\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.core.ruler.at('replacements', function replace(state) {\n *   //...\n * });\n * ```\n **/\nRuler.prototype.at = function (name, fn, options) {\n  var index = this.__find__(name);\n  var opt = options || {};\n\n  if (index === -1) { throw new Error('Parser rule not found: ' + name); }\n\n  this.__rules__[index].fn = fn;\n  this.__rules__[index].alt = opt.alt || [];\n  this.__cache__ = null;\n};\n\n\n/**\n * Ruler.before(beforeName, ruleName, fn [, options])\n * - beforeName (String): new rule will be added before this one.\n * - ruleName (String): name of added rule.\n * - fn (Function): rule function.\n * - options (Object): rule options (not mandatory).\n *\n * Add new rule to chain before one with given name. See also\n * [[Ruler.after]], [[Ruler.push]].\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.block.ruler.before('paragraph', 'my_rule', function replace(state) {\n *   //...\n * });\n * ```\n **/\nRuler.prototype.before = function (beforeName, ruleName, fn, options) {\n  var index = this.__find__(beforeName);\n  var opt = options || {};\n\n  if (index === -1) { throw new Error('Parser rule not found: ' + beforeName); }\n\n  this.__rules__.splice(index, 0, {\n    name: ruleName,\n    enabled: true,\n    fn: fn,\n    alt: opt.alt || []\n  });\n\n  this.__cache__ = null;\n};\n\n\n/**\n * Ruler.after(afterName, ruleName, fn [, options])\n * - afterName (String): new rule will be added after this one.\n * - ruleName (String): name of added rule.\n * - fn (Function): rule function.\n * - options (Object): rule options (not mandatory).\n *\n * Add new rule to chain after one with given name. See also\n * [[Ruler.before]], [[Ruler.push]].\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.inline.ruler.after('text', 'my_rule', function replace(state) {\n *   //...\n * });\n * ```\n **/\nRuler.prototype.after = function (afterName, ruleName, fn, options) {\n  var index = this.__find__(afterName);\n  var opt = options || {};\n\n  if (index === -1) { throw new Error('Parser rule not found: ' + afterName); }\n\n  this.__rules__.splice(index + 1, 0, {\n    name: ruleName,\n    enabled: true,\n    fn: fn,\n    alt: opt.alt || []\n  });\n\n  this.__cache__ = null;\n};\n\n/**\n * Ruler.push(ruleName, fn [, options])\n * - ruleName (String): name of added rule.\n * - fn (Function): rule function.\n * - options (Object): rule options (not mandatory).\n *\n * Push new rule to the end of chain. See also\n * [[Ruler.before]], [[Ruler.after]].\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.core.ruler.push('my_rule', function replace(state) {\n *   //...\n * });\n * ```\n **/\nRuler.prototype.push = function (ruleName, fn, options) {\n  var opt = options || {};\n\n  this.__rules__.push({\n    name: ruleName,\n    enabled: true,\n    fn: fn,\n    alt: opt.alt || []\n  });\n\n  this.__cache__ = null;\n};\n\n\n/**\n * Ruler.enable(list [, ignoreInvalid]) -> Array\n * - list (String|Array): list of rule names to enable.\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Enable rules with given names. If any rule name not found - throw Error.\n * Errors can be disabled by second param.\n *\n * Returns list of found rule names (if no exception happened).\n *\n * See also [[Ruler.disable]], [[Ruler.enableOnly]].\n **/\nRuler.prototype.enable = function (list, ignoreInvalid) {\n  if (!Array.isArray(list)) { list = [ list ]; }\n\n  var result = [];\n\n  // Search by name and enable\n  list.forEach(function (name) {\n    var idx = this.__find__(name);\n\n    if (idx < 0) {\n      if (ignoreInvalid) { return; }\n      throw new Error('Rules manager: invalid rule name ' + name);\n    }\n    this.__rules__[idx].enabled = true;\n    result.push(name);\n  }, this);\n\n  this.__cache__ = null;\n  return result;\n};\n\n\n/**\n * Ruler.enableOnly(list [, ignoreInvalid])\n * - list (String|Array): list of rule names to enable (whitelist).\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Enable rules with given names, and disable everything else. If any rule name\n * not found - throw Error. Errors can be disabled by second param.\n *\n * See also [[Ruler.disable]], [[Ruler.enable]].\n **/\nRuler.prototype.enableOnly = function (list, ignoreInvalid) {\n  if (!Array.isArray(list)) { list = [ list ]; }\n\n  this.__rules__.forEach(function (rule) { rule.enabled = false; });\n\n  this.enable(list, ignoreInvalid);\n};\n\n\n/**\n * Ruler.disable(list [, ignoreInvalid]) -> Array\n * - list (String|Array): list of rule names to disable.\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Disable rules with given names. If any rule name not found - throw Error.\n * Errors can be disabled by second param.\n *\n * Returns list of found rule names (if no exception happened).\n *\n * See also [[Ruler.enable]], [[Ruler.enableOnly]].\n **/\nRuler.prototype.disable = function (list, ignoreInvalid) {\n  if (!Array.isArray(list)) { list = [ list ]; }\n\n  var result = [];\n\n  // Search by name and disable\n  list.forEach(function (name) {\n    var idx = this.__find__(name);\n\n    if (idx < 0) {\n      if (ignoreInvalid) { return; }\n      throw new Error('Rules manager: invalid rule name ' + name);\n    }\n    this.__rules__[idx].enabled = false;\n    result.push(name);\n  }, this);\n\n  this.__cache__ = null;\n  return result;\n};\n\n\n/**\n * Ruler.getRules(chainName) -> Array\n *\n * Return array of active functions (rules) for given chain name. It analyzes\n * rules configuration, compiles caches if not exists and returns result.\n *\n * Default chain name is `''` (empty string). It can't be skipped. That's\n * done intentionally, to keep signature monomorphic for high speed.\n **/\nRuler.prototype.getRules = function (chainName) {\n  if (this.__cache__ === null) {\n    this.__compile__();\n  }\n\n  // Chain can be empty, if rules disabled. But we still have to return Array.\n  return this.__cache__[chainName] || [];\n};\n\nmodule.exports = Ruler;\n","// Token class\n\n'use strict';\n\n\n/**\n * class Token\n **/\n\n/**\n * new Token(type, tag, nesting)\n *\n * Create new token and fill passed properties.\n **/\nfunction Token(type, tag, nesting) {\n  /**\n   * Token#type -> String\n   *\n   * Type of the token (string, e.g. \"paragraph_open\")\n   **/\n  this.type     = type;\n\n  /**\n   * Token#tag -> String\n   *\n   * html tag name, e.g. \"p\"\n   **/\n  this.tag      = tag;\n\n  /**\n   * Token#attrs -> Array\n   *\n   * Html attributes. Format: `[ [ name1, value1 ], [ name2, value2 ] ]`\n   **/\n  this.attrs    = null;\n\n  /**\n   * Token#map -> Array\n   *\n   * Source map info. Format: `[ line_begin, line_end ]`\n   **/\n  this.map      = null;\n\n  /**\n   * Token#nesting -> Number\n   *\n   * Level change (number in {-1, 0, 1} set), where:\n   *\n   * -  `1` means the tag is opening\n   * -  `0` means the tag is self-closing\n   * - `-1` means the tag is closing\n   **/\n  this.nesting  = nesting;\n\n  /**\n   * Token#level -> Number\n   *\n   * nesting level, the same as `state.level`\n   **/\n  this.level    = 0;\n\n  /**\n   * Token#children -> Array\n   *\n   * An array of child nodes (inline and img tokens)\n   **/\n  this.children = null;\n\n  /**\n   * Token#content -> String\n   *\n   * In a case of self-closing tag (code, html, fence, etc.),\n   * it has contents of this tag.\n   **/\n  this.content  = '';\n\n  /**\n   * Token#markup -> String\n   *\n   * '*' or '_' for emphasis, fence string for fence, etc.\n   **/\n  this.markup   = '';\n\n  /**\n   * Token#info -> String\n   *\n   * fence infostring\n   **/\n  this.info     = '';\n\n  /**\n   * Token#meta -> Object\n   *\n   * A place for plugins to store an arbitrary data\n   **/\n  this.meta     = null;\n\n  /**\n   * Token#block -> Boolean\n   *\n   * True for block-level tokens, false for inline tokens.\n   * Used in renderer to calculate line breaks\n   **/\n  this.block    = false;\n\n  /**\n   * Token#hidden -> Boolean\n   *\n   * If it's true, ignore this element when rendering. Used for tight lists\n   * to hide paragraphs.\n   **/\n  this.hidden   = false;\n}\n\n\n/**\n * Token.attrIndex(name) -> Number\n *\n * Search attribute index by name.\n **/\nToken.prototype.attrIndex = function attrIndex(name) {\n  var attrs, i, len;\n\n  if (!this.attrs) { return -1; }\n\n  attrs = this.attrs;\n\n  for (i = 0, len = attrs.length; i < len; i++) {\n    if (attrs[i][0] === name) { return i; }\n  }\n  return -1;\n};\n\n\n/**\n * Token.attrPush(attrData)\n *\n * Add `[ name, value ]` attribute to list. Init attrs if necessary\n **/\nToken.prototype.attrPush = function attrPush(attrData) {\n  if (this.attrs) {\n    this.attrs.push(attrData);\n  } else {\n    this.attrs = [ attrData ];\n  }\n};\n\n\n/**\n * Token.attrSet(name, value)\n *\n * Set `name` attribute to `value`. Override old value if exists.\n **/\nToken.prototype.attrSet = function attrSet(name, value) {\n  var idx = this.attrIndex(name),\n      attrData = [ name, value ];\n\n  if (idx < 0) {\n    this.attrPush(attrData);\n  } else {\n    this.attrs[idx] = attrData;\n  }\n};\n\n\n/**\n * Token.attrGet(name)\n *\n * Get the value of attribute `name`, or null if it does not exist.\n **/\nToken.prototype.attrGet = function attrGet(name) {\n  var idx = this.attrIndex(name), value = null;\n  if (idx >= 0) {\n    value = this.attrs[idx][1];\n  }\n  return value;\n};\n\n\n/**\n * Token.attrJoin(name, value)\n *\n * Join value to existing attribute via space. Or create new attribute if not\n * exists. Useful to operate with token classes.\n **/\nToken.prototype.attrJoin = function attrJoin(name, value) {\n  var idx = this.attrIndex(name);\n\n  if (idx < 0) {\n    this.attrPush([ name, value ]);\n  } else {\n    this.attrs[idx][1] = this.attrs[idx][1] + ' ' + value;\n  }\n};\n\n\nmodule.exports = Token;\n","export var base = {\n  8: \"Backspace\",\n  9: \"Tab\",\n  10: \"Enter\",\n  12: \"NumLock\",\n  13: \"Enter\",\n  16: \"Shift\",\n  17: \"Control\",\n  18: \"Alt\",\n  20: \"CapsLock\",\n  27: \"Escape\",\n  32: \" \",\n  33: \"PageUp\",\n  34: \"PageDown\",\n  35: \"End\",\n  36: \"Home\",\n  37: \"ArrowLeft\",\n  38: \"ArrowUp\",\n  39: \"ArrowRight\",\n  40: \"ArrowDown\",\n  44: \"PrintScreen\",\n  45: \"Insert\",\n  46: \"Delete\",\n  59: \";\",\n  61: \"=\",\n  91: \"Meta\",\n  92: \"Meta\",\n  106: \"*\",\n  107: \"+\",\n  108: \",\",\n  109: \"-\",\n  110: \".\",\n  111: \"/\",\n  144: \"NumLock\",\n  145: \"ScrollLock\",\n  160: \"Shift\",\n  161: \"Shift\",\n  162: \"Control\",\n  163: \"Control\",\n  164: \"Alt\",\n  165: \"Alt\",\n  173: \"-\",\n  186: \";\",\n  187: \"=\",\n  188: \",\",\n  189: \"-\",\n  190: \".\",\n  191: \"/\",\n  192: \"`\",\n  219: \"[\",\n  220: \"\\\\\",\n  221: \"]\",\n  222: \"'\",\n  229: \"q\"\n}\n\nexport var shift = {\n  48: \")\",\n  49: \"!\",\n  50: \"@\",\n  51: \"#\",\n  52: \"$\",\n  53: \"%\",\n  54: \"^\",\n  55: \"&\",\n  56: \"*\",\n  57: \"(\",\n  59: \":\",\n  61: \"+\",\n  173: \"_\",\n  186: \":\",\n  187: \"+\",\n  188: \"<\",\n  189: \"_\",\n  190: \">\",\n  191: \"?\",\n  192: \"~\",\n  219: \"{\",\n  220: \"|\",\n  221: \"}\",\n  222: \"\\\"\",\n  229: \"Q\"\n}\n\nvar chrome = typeof navigator != \"undefined\" && /Chrome\\/(\\d+)/.exec(navigator.userAgent)\nvar safari = typeof navigator != \"undefined\" && /Apple Computer/.test(navigator.vendor)\nvar gecko = typeof navigator != \"undefined\" && /Gecko\\/\\d+/.test(navigator.userAgent)\nvar mac = typeof navigator != \"undefined\" && /Mac/.test(navigator.platform)\nvar ie = typeof navigator != \"undefined\" && /MSIE \\d|Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(navigator.userAgent)\nvar brokenModifierNames = chrome && (mac || +chrome[1] < 57) || gecko && mac\n\n// Fill in the digit keys\nfor (var i = 0; i < 10; i++) base[48 + i] = base[96 + i] = String(i)\n\n// The function keys\nfor (var i = 1; i <= 24; i++) base[i + 111] = \"F\" + i\n\n// And the alphabetic keys\nfor (var i = 65; i <= 90; i++) {\n  base[i] = String.fromCharCode(i + 32)\n  shift[i] = String.fromCharCode(i)\n}\n\n// For each code that doesn't have a shift-equivalent, copy the base name\nfor (var code in base) if (!shift.hasOwnProperty(code)) shift[code] = base[code]\n\nexport function keyName(event) {\n  // Don't trust event.key in Chrome when there are modifiers until\n  // they fix https://bugs.chromium.org/p/chromium/issues/detail?id=633838\n  var ignoreKey = brokenModifierNames && (event.ctrlKey || event.altKey || event.metaKey) ||\n    (safari || ie) && event.shiftKey && event.key && event.key.length == 1\n  var name = (!ignoreKey && event.key) ||\n    (event.shiftKey ? shift : base)[event.keyCode] ||\n    event.key || \"Unidentified\"\n  // Edge sometimes produces wrong names (Issue #3)\n  if (name == \"Esc\") name = \"Escape\"\n  if (name == \"Del\") name = \"Delete\"\n  // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/\n  if (name == \"Left\") name = \"ArrowLeft\"\n  if (name == \"Up\") name = \"ArrowUp\"\n  if (name == \"Right\") name = \"ArrowRight\"\n  if (name == \"Down\") name = \"ArrowDown\"\n  return name\n}\n","import {base, keyName} from \"w3c-keyname\"\nimport {Plugin} from \"prosemirror-state\"\n\n// declare global: navigator\n\nconst mac = typeof navigator != \"undefined\" ? /Mac/.test(navigator.platform) : false\n\nfunction normalizeKeyName(name) {\n  let parts = name.split(/-(?!$)/), result = parts[parts.length - 1]\n  if (result == \"Space\") result = \" \"\n  let alt, ctrl, shift, meta\n  for (let i = 0; i < parts.length - 1; i++) {\n    let mod = parts[i]\n    if (/^(cmd|meta|m)$/i.test(mod)) meta = true\n    else if (/^a(lt)?$/i.test(mod)) alt = true\n    else if (/^(c|ctrl|control)$/i.test(mod)) ctrl = true\n    else if (/^s(hift)?$/i.test(mod)) shift = true\n    else if (/^mod$/i.test(mod)) { if (mac) meta = true; else ctrl = true }\n    else throw new Error(\"Unrecognized modifier name: \" + mod)\n  }\n  if (alt) result = \"Alt-\" + result\n  if (ctrl) result = \"Ctrl-\" + result\n  if (meta) result = \"Meta-\" + result\n  if (shift) result = \"Shift-\" + result\n  return result\n}\n\nfunction normalize(map) {\n  let copy = Object.create(null)\n  for (let prop in map) copy[normalizeKeyName(prop)] = map[prop]\n  return copy\n}\n\nfunction modifiers(name, event, shift) {\n  if (event.altKey) name = \"Alt-\" + name\n  if (event.ctrlKey) name = \"Ctrl-\" + name\n  if (event.metaKey) name = \"Meta-\" + name\n  if (shift !== false && event.shiftKey) name = \"Shift-\" + name\n  return name\n}\n\n// :: (Object) → Plugin\n// Create a keymap plugin for the given set of bindings.\n//\n// Bindings should map key names to [command](#commands)-style\n// functions, which will be called with `(EditorState, dispatch,\n// EditorView)` arguments, and should return true when they've handled\n// the key. Note that the view argument isn't part of the command\n// protocol, but can be used as an escape hatch if a binding needs to\n// directly interact with the UI.\n//\n// Key names may be strings like `\"Shift-Ctrl-Enter\"`—a key\n// identifier prefixed with zero or more modifiers. Key identifiers\n// are based on the strings that can appear in\n// [`KeyEvent.key`](https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).\n// Use lowercase letters to refer to letter keys (or uppercase letters\n// if you want shift to be held). You may use `\"Space\"` as an alias\n// for the `\" \"` name.\n//\n// Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or\n// `a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or\n// `Meta-`) are recognized. For characters that are created by holding\n// shift, the `Shift-` prefix is implied, and should not be added\n// explicitly.\n//\n// You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on\n// other platforms.\n//\n// You can add multiple keymap plugins to an editor. The order in\n// which they appear determines their precedence (the ones early in\n// the array get to dispatch first).\nexport function keymap(bindings) {\n  return new Plugin({props: {handleKeyDown: keydownHandler(bindings)}})\n}\n\n// :: (Object) → (view: EditorView, event: dom.Event) → bool\n// Given a set of bindings (using the same format as\n// [`keymap`](#keymap.keymap), return a [keydown\n// handler](#view.EditorProps.handleKeyDown) that handles them.\nexport function keydownHandler(bindings) {\n  let map = normalize(bindings)\n  return function(view, event) {\n    let name = keyName(event), isChar = name.length == 1 && name != \" \", baseName\n    let direct = map[modifiers(name, event, !isChar)]\n    if (direct && direct(view.state, view.dispatch, view)) return true\n    if (isChar && (event.shiftKey || event.altKey || event.metaKey || name.charCodeAt(0) > 127) &&\n        (baseName = base[event.keyCode]) && baseName != name) {\n      // Try falling back to the keyCode when there's a modifier\n      // active or the character produced isn't ASCII, and our table\n      // produces a different name from the the keyCode. See #668,\n      // #1060\n      let fromCode = map[modifiers(baseName, event, true)]\n      if (fromCode && fromCode(view.state, view.dispatch, view)) return true\n    } else if (isChar && event.shiftKey) {\n      // Otherwise, if shift is active, also try the binding with the\n      // Shift- prefix enabled. See #997\n      let withShift = map[modifiers(name, event, true)]\n      if (withShift && withShift(view.state, view.dispatch, view)) return true\n    }\n    return false\n  }\n}\n","/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param  {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n  var str = '' + string;\n  var match = matchHtmlRegExp.exec(str);\n\n  if (!match) {\n    return str;\n  }\n\n  var escape;\n  var html = '';\n  var index = 0;\n  var lastIndex = 0;\n\n  for (index = match.index; index < str.length; index++) {\n    switch (str.charCodeAt(index)) {\n      case 34: // \"\n        escape = '&quot;';\n        break;\n      case 38: // &\n        escape = '&amp;';\n        break;\n      case 39: // '\n        escape = '&#39;';\n        break;\n      case 60: // <\n        escape = '&lt;';\n        break;\n      case 62: // >\n        escape = '&gt;';\n        break;\n      default:\n        continue;\n    }\n\n    if (lastIndex !== index) {\n      html += str.substring(lastIndex, index);\n    }\n\n    lastIndex = index + 1;\n    html += escape;\n  }\n\n  return lastIndex !== index\n    ? html + str.substring(lastIndex, index)\n    : html;\n}\n","// Because working with row and column-spanning cells is not quite\n// trivial, this code builds up a descriptive structure for a given\n// table node. The structures are cached with the (persistent) table\n// nodes as key, so that they only have to be recomputed when the\n// content of the table changes.\n//\n// This does mean that they have to store table-relative, not\n// document-relative positions. So code that uses them will typically\n// compute the start position of the table and offset positions passed\n// to or gotten from this structure by that amount.\n\nlet readFromCache, addToCache\n// Prefer using a weak map to cache table maps. Fall back on a\n// fixed-size cache if that's not supported.\nif (typeof WeakMap != \"undefined\") {\n  let cache = new WeakMap\n  readFromCache = key => cache.get(key)\n  addToCache = (key, value) => {\n    cache.set(key, value)\n    return value\n  }\n} else {\n  let cache = [], cacheSize = 10, cachePos = 0\n  readFromCache = key => {\n    for (let i = 0; i < cache.length; i += 2)\n      if (cache[i] == key) return cache[i + 1]\n  }\n  addToCache = (key, value) => {\n    if (cachePos == cacheSize) cachePos = 0\n    cache[cachePos++] = key\n    return cache[cachePos++] = value\n  }\n}\n\nexport class Rect {\n  constructor(left, top, right, bottom) {\n    this.left = left; this.top = top; this.right = right; this.bottom = bottom\n  }\n}\n\n// ::- A table map describes the structore of a given table. To avoid\n// recomputing them all the time, they are cached per table node. To\n// be able to do that, positions saved in the map are relative to the\n// start of the table, rather than the start of the document.\nexport class TableMap {\n  constructor(width, height, map, problems) {\n    // :: number The width of the table\n    this.width = width\n    // :: number The table's height\n    this.height = height\n    // :: [number] A width * height array with the start position of\n    // the cell covering that part of the table in each slot\n    this.map = map\n    // An optional array of problems (cell overlap or non-rectangular\n    // shape) for the table, used by the table normalizer.\n    this.problems = problems\n  }\n\n  // :: (number) → Rect\n  // Find the dimensions of the cell at the given position.\n  findCell(pos) {\n    for (let i = 0; i < this.map.length; i++) {\n      let curPos = this.map[i]\n      if (curPos != pos) continue\n      let left = i % this.width, top = (i / this.width) | 0\n      let right = left + 1, bottom = top + 1\n      for (let j = 1; right < this.width && this.map[i + j] == curPos; j++) right++\n      for (let j = 1; bottom < this.height && this.map[i + (this.width * j)] == curPos; j++) bottom++\n      return new Rect(left, top, right, bottom)\n    }\n    throw new RangeError(\"No cell with offset \" + pos + \" found\")\n  }\n\n  // :: (number) → number\n  // Find the left side of the cell at the given position.\n  colCount(pos) {\n    for (let i = 0; i < this.map.length; i++)\n      if (this.map[i] == pos) return i % this.width\n    throw new RangeError(\"No cell with offset \" + pos + \" found\")\n  }\n\n  // :: (number, string, number) → ?number\n  // Find the next cell in the given direction, starting from the cell\n  // at `pos`, if any.\n  nextCell(pos, axis, dir) {\n    let {left, right, top, bottom} = this.findCell(pos)\n    if (axis == \"horiz\") {\n      if (dir < 0 ? left == 0 : right == this.width) return null\n      return this.map[top * this.width + (dir < 0 ? left - 1 : right)]\n    } else {\n      if (dir < 0 ? top == 0 : bottom == this.height) return null\n      return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)]\n    }\n  }\n\n  // :: (number, number) → Rect\n  // Get the rectangle spanning the two given cells.\n  rectBetween(a, b) {\n    let {left: leftA, right: rightA, top: topA, bottom: bottomA} = this.findCell(a)\n    let {left: leftB, right: rightB, top: topB, bottom: bottomB} = this.findCell(b)\n    return new Rect(Math.min(leftA, leftB), Math.min(topA, topB),\n                    Math.max(rightA, rightB), Math.max(bottomA, bottomB))\n  }\n\n  // :: (Rect) → [number]\n  // Return the position of all cells that have the top left corner in\n  // the given rectangle.\n  cellsInRect(rect) {\n    let result = [], seen = {}\n    for (let row = rect.top; row < rect.bottom; row++) {\n      for (let col = rect.left; col < rect.right; col++) {\n        let index = row * this.width + col, pos = this.map[index]\n        if (seen[pos]) continue\n        seen[pos] = true\n        if ((col != rect.left || !col || this.map[index - 1] != pos) &&\n            (row != rect.top || !row || this.map[index - this.width] != pos))\n          result.push(pos)\n      }\n    }\n    return result\n  }\n\n  // :: (number, number, Node) → number\n  // Return the position at which the cell at the given row and column\n  // starts, or would start, if a cell started there.\n  positionAt(row, col, table) {\n    for (let i = 0, rowStart = 0;; i++) {\n      let rowEnd = rowStart + table.child(i).nodeSize\n      if (i == row) {\n        let index = col + row * this.width, rowEndIndex = (row + 1) * this.width\n        // Skip past cells from previous rows (via rowspan)\n        while (index < rowEndIndex && this.map[index] < rowStart) index++\n        return index == rowEndIndex ? rowEnd - 1 : this.map[index]\n      }\n      rowStart = rowEnd\n    }\n  }\n\n  // :: (Node) → TableMap\n  // Find the table map for the given table node.\n  static get(table) {\n    return readFromCache(table) || addToCache(table, computeMap(table))\n  }\n}\n\n// Compute a table map.\nfunction computeMap(table) {\n  if (table.type.spec.tableRole != \"table\") throw new RangeError(\"Not a table node: \" + table.type.name)\n  let width = findWidth(table), height = table.childCount\n  let map = [], mapPos = 0, problems = null, colWidths = []\n  for (let i = 0, e = width * height; i < e; i++) map[i] = 0\n\n  for (let row = 0, pos = 0; row < height; row++) {\n    let rowNode = table.child(row)\n    pos++\n    for (let i = 0;; i++) {\n      while (mapPos < map.length && map[mapPos] != 0) mapPos++\n      if (i == rowNode.childCount) break\n      let cellNode = rowNode.child(i), {colspan, rowspan, colwidth} = cellNode.attrs\n      for (let h = 0; h < rowspan; h++) {\n        if (h + row >= height) {\n          (problems || (problems = [])).push({type: \"overlong_rowspan\", pos, n: rowspan - h})\n          break\n        }\n        let start = mapPos + (h * width)\n        for (let w = 0; w < colspan; w++) {\n          if (map[start + w] == 0)\n            map[start + w] = pos\n          else\n            (problems || (problems = [])).push({type: \"collision\", row, pos, n: colspan - w})\n          let colW = colwidth && colwidth[w]\n          if (colW) {\n            let widthIndex = ((start + w) % width) * 2, prev = colWidths[widthIndex]\n            if (prev == null || (prev != colW && colWidths[widthIndex + 1] == 1)) {\n              colWidths[widthIndex] = colW\n              colWidths[widthIndex + 1] = 1\n            } else if (prev == colW) {\n              colWidths[widthIndex + 1]++\n            }\n          }\n        }\n      }\n      mapPos += colspan\n      pos += cellNode.nodeSize\n    }\n    let expectedPos = (row + 1) * width, missing = 0\n    while (mapPos < expectedPos) if (map[mapPos++] == 0) missing++\n    if (missing) (problems || (problems = [])).push({type: \"missing\", row, n: missing})\n    pos++\n  }\n\n  let tableMap = new TableMap(width, height, map, problems), badWidths = false\n\n  // For columns that have defined widths, but whose widths disagree\n  // between rows, fix up the cells whose width doesn't match the\n  // computed one.\n  for (let i = 0; !badWidths && i < colWidths.length; i += 2)\n    if (colWidths[i] != null && colWidths[i + 1] < height) badWidths = true\n  if (badWidths) findBadColWidths(tableMap, colWidths, table)\n\n  return tableMap\n}\n\nfunction findWidth(table) {\n  let width = -1, hasRowSpan = false\n  for (let row = 0; row < table.childCount; row++) {\n    let rowNode = table.child(row), rowWidth = 0\n    if (hasRowSpan) for (let j = 0; j < row; j++) {\n      let prevRow = table.child(j)\n      for (let i = 0; i < prevRow.childCount; i++) {\n        let cell = prevRow.child(i)\n        if (j + cell.attrs.rowspan > row) rowWidth += cell.attrs.colspan\n      }\n    }\n    for (let i = 0; i < rowNode.childCount; i++) {\n      let cell = rowNode.child(i)\n      rowWidth += cell.attrs.colspan\n      if (cell.attrs.rowspan > 1) hasRowSpan = true\n    }\n    if (width == -1)\n      width = rowWidth\n    else if (width != rowWidth)\n      width = Math.max(width, rowWidth)\n  }\n  return width\n}\n\nfunction findBadColWidths(map, colWidths, table) {\n  if (!map.problems) map.problems = []\n  for (let i = 0, seen = {}; i < map.map.length; i++) {\n    let pos = map.map[i]\n    if (seen[pos]) continue\n    seen[pos] = true\n    let node = table.nodeAt(pos), updated = null\n    for (let j = 0; j < node.attrs.colspan; j++) {\n      let col = (i + j) % map.width, colWidth = colWidths[col * 2]\n      if (colWidth != null && (!node.attrs.colwidth || node.attrs.colwidth[j] != colWidth))\n        (updated || (updated = freshColWidth(node.attrs)))[j] = colWidth\n    }\n    if (updated) map.problems.unshift({type: \"colwidth mismatch\", pos, colwidth: updated})\n  }\n}\n\nfunction freshColWidth(attrs) {\n  if (attrs.colwidth) return attrs.colwidth.slice()\n  let result = []\n  for (let i = 0; i < attrs.colspan; i++) result.push(0)\n  return result\n}\n","// Various helper function for working with tables\n\nimport {PluginKey} from \"prosemirror-state\"\n\nimport {TableMap} from \"./tablemap\"\nimport {tableNodeTypes} from \"./schema\";\n\nexport const key = new PluginKey(\"selectingCells\")\n\nexport function cellAround($pos) {\n  for (let d = $pos.depth - 1; d > 0; d--)\n    if ($pos.node(d).type.spec.tableRole == \"row\") return $pos.node(0).resolve($pos.before(d + 1))\n  return null\n}\n\nexport function cellWrapping($pos) {\n  for (let d = $pos.depth; d > 0; d--) { // Sometimes the cell can be in the same depth.\n    const role = $pos.node(d).type.spec.tableRole;\n    if (role === \"cell\" || role === 'header_cell') return $pos.node(d)\n  }\n  return null\n}\n\nexport function isInTable(state) {\n  let $head = state.selection.$head\n  for (let d = $head.depth; d > 0; d--) if ($head.node(d).type.spec.tableRole == \"row\") return true\n  return false\n}\n\nexport function selectionCell(state) {\n  let sel = state.selection\n  if (sel.$anchorCell) {\n    return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;\n  } else if (sel.node && sel.node.type.spec.tableRole == \"cell\") {\n    return sel.$anchor\n  }\n  return cellAround(sel.$head) || cellNear(sel.$head)\n}\n\nfunction cellNear($pos) {\n  for (let after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {\n    let role = after.type.spec.tableRole\n    if (role == \"cell\" || role == \"header_cell\") return $pos.doc.resolve(pos)\n  }\n  for (let before = $pos.nodeBefore, pos = $pos.pos; before; before = before.lastChild, pos--) {\n    let role = before.type.spec.tableRole\n    if (role == \"cell\" || role == \"header_cell\") return $pos.doc.resolve(pos - before.nodeSize)\n  }\n}\n\nexport function pointsAtCell($pos) {\n  return $pos.parent.type.spec.tableRole == \"row\" && $pos.nodeAfter\n}\n\nexport function moveCellForward($pos) {\n  return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize)\n}\n\nexport function inSameTable($a, $b) {\n  return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1)\n}\n\nexport function findCell($pos) {\n  return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1))\n}\n\nexport function colCount($pos) {\n  return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1))\n}\n\nexport function nextCell($pos, axis, dir) {\n  let start = $pos.start(-1), map = TableMap.get($pos.node(-1))\n  let moved = map.nextCell($pos.pos - start, axis, dir)\n  return moved == null ? null : $pos.node(0).resolve(start + moved)\n}\n\nexport function setAttr(attrs, name, value) {\n  let result = {}\n  for (let prop in attrs) result[prop] = attrs[prop]\n  result[name] = value\n  return result\n}\n\nexport function removeColSpan(attrs, pos, n=1) {\n  let result = setAttr(attrs, \"colspan\", attrs.colspan - n)\n  if (result.colwidth) {\n    result.colwidth = result.colwidth.slice()\n    result.colwidth.splice(pos, n)\n    if (!result.colwidth.some(w => w > 0)) result.colwidth = null\n  }\n  return result\n}\n\nexport function addColSpan(attrs, pos, n=1) {\n  let result = setAttr(attrs, \"colspan\", attrs.colspan + n)\n  if (result.colwidth) {\n    result.colwidth = result.colwidth.slice()\n    for (let i = 0; i < n; i++) result.colwidth.splice(pos, 0, 0)\n  }\n  return result\n}\n\nexport function columnIsHeader(map, table, col) {\n  let headerCell = tableNodeTypes(table.type.schema).header_cell\n  for (let row = 0; row < map.height; row++)\n    if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)\n      return false\n  return true\n}\n","// This file defines a ProseMirror selection subclass that models\n// table cell selections. The table plugin needs to be active to wire\n// in the user interaction part of table selections (so that you\n// actually get such selections when you select across cells).\n\nimport {Selection, TextSelection, NodeSelection, SelectionRange} from \"prosemirror-state\"\nimport {Decoration, DecorationSet} from \"prosemirror-view\"\nimport {Fragment, Slice} from \"prosemirror-model\"\n\n\nimport {inSameTable, pointsAtCell, setAttr, removeColSpan} from \"./util\"\nimport {TableMap} from \"./tablemap\"\n\n// ::- A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)\n// subclass that represents a cell selection spanning part of a table.\n// With the plugin enabled, these will be created when the user\n// selects across cells, and will be drawn by giving selected cells a\n// `selectedCell` CSS class.\nexport class CellSelection extends Selection {\n  // :: (ResolvedPos, ?ResolvedPos)\n  // A table selection is identified by its anchor and head cells. The\n  // positions given to this constructor should point _before_ two\n  // cells in the same table. They may be the same, to select a single\n  // cell.\n  constructor($anchorCell, $headCell = $anchorCell) {\n    let table = $anchorCell.node(-1), map = TableMap.get(table), start = $anchorCell.start(-1)\n    let rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start)\n    let doc = $anchorCell.node(0)\n    let cells = map.cellsInRect(rect).filter(p => p != $headCell.pos - start)\n    // Make the head cell the first range, so that it counts as the\n    // primary part of the selection\n    cells.unshift($headCell.pos - start)\n    let ranges = cells.map(pos => {\n      let cell = table.nodeAt(pos), from = pos + start + 1\n      return new SelectionRange(doc.resolve(from), doc.resolve(from + cell.content.size))\n    })\n    super(ranges[0].$from, ranges[0].$to, ranges)\n    // :: ResolvedPos\n    // A resolved position pointing _in front of_ the anchor cell (the one\n    // that doesn't move when extending the selection).\n    this.$anchorCell = $anchorCell\n    // :: ResolvedPos\n    // A resolved position pointing in front of the head cell (the one\n    // moves when extending the selection).\n    this.$headCell = $headCell\n  }\n\n  map(doc, mapping) {\n    let $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos))\n    let $headCell = doc.resolve(mapping.map(this.$headCell.pos))\n    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {\n      let tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1)\n      if (tableChanged && this.isRowSelection())\n        return CellSelection.rowSelection($anchorCell, $headCell)\n      else if (tableChanged && this.isColSelection())\n        return CellSelection.colSelection($anchorCell, $headCell)\n      else\n        return new CellSelection($anchorCell, $headCell)\n    }\n    return TextSelection.between($anchorCell, $headCell)\n  }\n\n  // :: () → Slice\n  // Returns a rectangular slice of table rows containing the selected\n  // cells.\n  content() {\n    let table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1)\n    let rect = map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start)\n    let seen = {}, rows = []\n    for (let row = rect.top; row < rect.bottom; row++) {\n      let rowContent = []\n      for (let index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {\n        let pos = map.map[index]\n        if (!seen[pos]) {\n          seen[pos] = true\n          let cellRect = map.findCell(pos), cell = table.nodeAt(pos)\n          let extraLeft = rect.left - cellRect.left, extraRight = cellRect.right - rect.right\n          if (extraLeft > 0 || extraRight > 0) {\n            let attrs = cell.attrs\n            if (extraLeft > 0) attrs = removeColSpan(attrs, 0, extraLeft)\n            if (extraRight > 0) attrs = removeColSpan(attrs, attrs.colspan - extraRight, extraRight)\n            if (cellRect.left < rect.left) cell = cell.type.createAndFill(attrs)\n            else cell = cell.type.create(attrs, cell.content)\n          }\n          if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {\n            let attrs = setAttr(cell.attrs, \"rowspan\", Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top))\n            if (cellRect.top < rect.top) cell = cell.type.createAndFill(attrs)\n            else cell = cell.type.create(attrs, cell.content)\n          }\n          rowContent.push(cell)\n        }\n      }\n      rows.push(table.child(row).copy(Fragment.from(rowContent)))\n    }\n\n    const fragment = this.isColSelection() && this.isRowSelection() ? table : rows;\n    return new Slice(Fragment.from(fragment), 1, 1)\n  }\n\n  replace(tr, content = Slice.empty) {\n    let mapFrom = tr.steps.length, ranges = this.ranges\n    for (let i = 0; i < ranges.length; i++) {\n      let {$from, $to} = ranges[i], mapping = tr.mapping.slice(mapFrom)\n      tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content)\n    }\n    let sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1)\n    if (sel) tr.setSelection(sel)\n  }\n\n  replaceWith(tr, node) {\n    this.replace(tr, new Slice(Fragment.from(node), 0, 0))\n  }\n\n  forEachCell(f) {\n    let table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1)\n    let cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start))\n    for (let i = 0; i < cells.length; i++)\n      f(table.nodeAt(cells[i]), start + cells[i])\n  }\n\n  // :: () → bool\n  // True if this selection goes all the way from the top to the\n  // bottom of the table.\n  isColSelection() {\n    let anchorTop = this.$anchorCell.index(-1), headTop = this.$headCell.index(-1)\n    if (Math.min(anchorTop, headTop) > 0) return false\n    let anchorBot = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan,\n        headBot = headTop + this.$headCell.nodeAfter.attrs.rowspan\n    return Math.max(anchorBot, headBot) == this.$headCell.node(-1).childCount\n  }\n\n  // :: (ResolvedPos, ?ResolvedPos) → CellSelection\n  // Returns the smallest column selection that covers the given anchor\n  // and head cell.\n  static colSelection($anchorCell, $headCell = $anchorCell) {\n    let map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1)\n    let anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start)\n    let doc = $anchorCell.node(0)\n    if (anchorRect.top <= headRect.top) {\n      if (anchorRect.top > 0)\n        $anchorCell = doc.resolve(start + map.map[anchorRect.left])\n      if (headRect.bottom < map.height)\n        $headCell = doc.resolve(start + map.map[map.width * (map.height - 1) + headRect.right - 1])\n    } else {\n      if (headRect.top > 0)\n        $headCell = doc.resolve(start + map.map[headRect.left])\n      if (anchorRect.bottom < map.height)\n        $anchorCell = doc.resolve(start + map.map[map.width * (map.height - 1) + anchorRect.right - 1])\n    }\n    return new CellSelection($anchorCell, $headCell)\n  }\n\n  // :: () → bool\n  // True if this selection goes all the way from the left to the\n  // right of the table.\n  isRowSelection() {\n    let map = TableMap.get(this.$anchorCell.node(-1)), start = this.$anchorCell.start(-1)\n    let anchorLeft = map.colCount(this.$anchorCell.pos - start),\n        headLeft = map.colCount(this.$headCell.pos - start)\n    if (Math.min(anchorLeft, headLeft) > 0) return false\n    let anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan,\n        headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan\n    return Math.max(anchorRight, headRight) == map.width\n  }\n\n  eq(other) {\n    return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos &&\n      other.$headCell.pos == this.$headCell.pos\n  }\n\n  // :: (ResolvedPos, ?ResolvedPos) → CellSelection\n  // Returns the smallest row selection that covers the given anchor\n  // and head cell.\n  static rowSelection($anchorCell, $headCell = $anchorCell) {\n    let map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1)\n    let anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start)\n    let doc = $anchorCell.node(0)\n    if (anchorRect.left <= headRect.left) {\n      if (anchorRect.left > 0)\n        $anchorCell = doc.resolve(start + map.map[anchorRect.top * map.width])\n      if (headRect.right < map.width)\n        $headCell = doc.resolve(start + map.map[map.width * (headRect.top + 1) - 1])\n    } else {\n      if (headRect.left > 0)\n        $headCell = doc.resolve(start + map.map[headRect.top * map.width])\n      if (anchorRect.right < map.width)\n        $anchorCell = doc.resolve(start + map.map[map.width * (anchorRect.top + 1) - 1])\n    }\n    return new CellSelection($anchorCell, $headCell)\n  }\n\n  toJSON() {\n    return {type: \"cell\", anchor: this.$anchorCell.pos, head: this.$headCell.pos}\n  }\n\n  static fromJSON(doc, json) {\n    return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head))\n  }\n\n  // :: (Node, number, ?number) → CellSelection\n  static create(doc, anchorCell, headCell = anchorCell) {\n    return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell))\n  }\n\n  getBookmark() { return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos) }\n}\n\nCellSelection.prototype.visible = false\n\nSelection.jsonID(\"cell\", CellSelection)\n\nclass CellBookmark {\n  constructor(anchor, head) {\n    this.anchor = anchor\n    this.head = head\n  }\n  map(mapping) {\n    return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head))\n  }\n  resolve(doc) {\n    let $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head)\n    if ($anchorCell.parent.type.spec.tableRole == \"row\" &&\n        $headCell.parent.type.spec.tableRole == \"row\" &&\n        $anchorCell.index() < $anchorCell.parent.childCount &&\n        $headCell.index() < $headCell.parent.childCount &&\n        inSameTable($anchorCell, $headCell))\n      return new CellSelection($anchorCell, $headCell)\n    else\n      return Selection.near($headCell, 1)\n  }\n}\n\nexport function drawCellSelection(state) {\n  if (!(state.selection instanceof CellSelection)) return null\n  let cells = []\n  state.selection.forEachCell((node, pos) => {\n    cells.push(Decoration.node(pos, pos + node.nodeSize, {class: \"selectedCell\"}))\n  })\n  return DecorationSet.create(state.doc, cells)\n}\n\nfunction isCellBoundarySelection({$from, $to}) {\n  if ($from.pos == $to.pos || $from.pos < $from.pos - 6) return false // Cheap elimination\n  let afterFrom = $from.pos, beforeTo = $to.pos, depth = $from.depth\n  for (; depth >= 0; depth--, afterFrom++)\n    if ($from.after(depth + 1) < $from.end(depth)) break\n  for (let d = $to.depth; d >= 0; d--, beforeTo--)\n    if ($to.before(d + 1) > $to.start(d)) break\n  return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole)\n}\n\nfunction isTextSelectionAcrossCells({$from, $to}) {\n  let fromCellBoundaryNode;\n  let toCellBoundaryNode;\n\n  for (let i = $from.depth; i > 0; i--) {\n    let node = $from.node(i);\n    if (node.type.spec.tableRole === 'cell' || node.type.spec.tableRole === 'header_cell') {\n      fromCellBoundaryNode = node;\n      break;\n    }\n  }\n\n  for (let i = $to.depth; i > 0; i--) {\n    let node = $to.node(i);\n    if (node.type.spec.tableRole === 'cell' || node.type.spec.tableRole === 'header_cell') {\n      toCellBoundaryNode = node;\n      break;\n    }\n  }\n\n  return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0\n}\n\nexport function normalizeSelection(state, tr, allowTableNodeSelection) {\n  let sel = (tr || state).selection, doc = (tr || state).doc, normalize, role\n  if (sel instanceof NodeSelection && (role = sel.node.type.spec.tableRole)) {\n    if (role == \"cell\" || role == \"header_cell\") {\n      normalize = CellSelection.create(doc, sel.from)\n    } else if (role == \"row\") {\n      let $cell = doc.resolve(sel.from + 1)\n      normalize = CellSelection.rowSelection($cell, $cell)\n    } else if (!allowTableNodeSelection) {\n      let map = TableMap.get(sel.node), start = sel.from + 1\n      let lastCell = start + map.map[map.width * map.height - 1]\n      normalize = CellSelection.create(doc, start + 1, lastCell)\n    }\n  } else if (sel instanceof TextSelection && isCellBoundarySelection(sel)) {\n    normalize = TextSelection.create(doc, sel.from)\n  } else if (sel instanceof TextSelection && isTextSelectionAcrossCells(sel)) {\n    normalize = TextSelection.create(doc, sel.$from.start(), sel.$from.end());\n  }\n  if (normalize)\n    (tr || (tr = state.tr)).setSelection(normalize)\n  return tr\n}\n","// Utilities used for copy/paste handling.\n//\n// This module handles pasting cell content into tables, or pasting\n// anything into a cell selection, as replacing a block of cells with\n// the content of the selection. When pasting cells into a cell, that\n// involves placing the block of pasted content so that its top left\n// aligns with the selection cell, optionally extending the table to\n// the right or bottom to make sure it is large enough. Pasting into a\n// cell selection is different, here the cells in the selection are\n// clipped to the selection's rectangle, optionally repeating the\n// pasted cells when they are smaller than the selection.\n\nimport {Slice, Fragment} from \"prosemirror-model\"\nimport {Transform} from \"prosemirror-transform\"\n\nimport {setAttr, removeColSpan} from \"./util\"\nimport {TableMap} from \"./tablemap\"\nimport {CellSelection} from \"./cellselection\"\nimport {tableNodeTypes} from \"./schema\"\n\n// Utilities to help with copying and pasting table cells\n\n// : (Slice) → ?{width: number, height: number, rows: [Fragment]}\n// Get a rectangular area of cells from a slice, or null if the outer\n// nodes of the slice aren't table cells or rows.\nexport function pastedCells(slice) {\n  if (!slice.size) return null\n  let {content, openStart, openEnd} = slice\n  while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.firstChild.type.spec.tableRole == \"table\")) {\n    openStart--\n    openEnd--\n    content = content.firstChild.content\n  }\n  let first = content.firstChild, role = first.type.spec.tableRole\n  let schema = first.type.schema, rows = []\n  if (role == \"row\") {\n    for (let i = 0; i < content.childCount; i++) {\n      let cells = content.child(i).content\n      let left = i ? 0 : Math.max(0, openStart - 1)\n      let right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1)\n      if (left || right) cells = fitSlice(tableNodeTypes(schema).row, new Slice(cells, left, right)).content\n      rows.push(cells)\n    }\n  } else if (role == \"cell\" || role == \"header_cell\") {\n    rows.push(openStart || openEnd ? fitSlice(tableNodeTypes(schema).row, new Slice(content, openStart, openEnd)).content : content)\n  } else {\n    return null\n  }\n  return ensureRectangular(schema, rows)\n}\n\n// : (Schema, [Fragment]) → {width: number, height: number, rows: [Fragment]}\n// Compute the width and height of a set of cells, and make sure each\n// row has the same number of cells.\nfunction ensureRectangular(schema, rows) {\n  let widths = []\n  for (let i = 0; i < rows.length; i++) {\n    let row = rows[i]\n    for (let j = row.childCount - 1; j >= 0; j--) {\n      let {rowspan, colspan} = row.child(j).attrs\n      for (let r = i; r < i + rowspan; r++)\n        widths[r] = (widths[r] || 0) + colspan\n    }\n  }\n  let width = 0\n  for (let r = 0; r < widths.length; r++) width = Math.max(width, widths[r])\n  for (let r = 0; r < widths.length; r++) {\n    if (r >= rows.length) rows.push(Fragment.empty)\n    if (widths[r] < width) {\n      let empty = tableNodeTypes(schema).cell.createAndFill(), cells = []\n      for (let i = widths[r]; i < width; i++) cells.push(empty)\n      rows[r] = rows[r].append(Fragment.from(cells))\n    }\n  }\n  return {height: rows.length, width, rows}\n}\n\nexport function fitSlice(nodeType, slice) {\n  let node = nodeType.createAndFill()\n  let tr = new Transform(node).replace(0, node.content.size, slice)\n  return tr.doc\n}\n\n// : ({width: number, height: number, rows: [Fragment]}, number, number) → {width: number, height: number, rows: [Fragment]}\n// Clip or extend (repeat) the given set of cells to cover the given\n// width and height. Will clip rowspan/colspan cells at the edges when\n// they stick out.\nexport function clipCells({width, height, rows}, newWidth, newHeight) {\n  if (width != newWidth) {\n    let added = [], newRows = []\n    for (let row = 0; row < rows.length; row++) {\n      let frag = rows[row], cells = []\n      for (let col = added[row] || 0, i = 0; col < newWidth; i++) {\n        let cell = frag.child(i % frag.childCount)\n        if (col + cell.attrs.colspan > newWidth)\n          cell = cell.type.create(removeColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content)\n        cells.push(cell)\n        col += cell.attrs.colspan\n        for (let j = 1; j < cell.attrs.rowspan; j++)\n          added[row + j] = (added[row + j] || 0) + cell.attrs.colspan\n      }\n      newRows.push(Fragment.from(cells))\n    }\n    rows = newRows\n    width = newWidth\n  }\n\n  if (height != newHeight) {\n    let newRows = []\n    for (let row = 0, i = 0; row < newHeight; row++, i++) {\n      let cells = [], source = rows[i % height]\n      for (let j = 0; j < source.childCount; j++) {\n        let cell = source.child(j)\n        if (row + cell.attrs.rowspan > newHeight)\n          cell = cell.type.create(setAttr(cell.attrs, \"rowspan\", Math.max(1, newHeight - cell.attrs.rowspan)), cell.content)\n        cells.push(cell)\n      }\n      newRows.push(Fragment.from(cells))\n    }\n    rows = newRows\n    height = newHeight\n  }\n\n  return {width, height, rows}\n}\n\n// Make sure a table has at least the given width and height. Return\n// true if something was changed.\nfunction growTable(tr, map, table, start, width, height, mapFrom) {\n  let schema = tr.doc.type.schema, types = tableNodeTypes(schema), empty, emptyHead\n  if (width > map.width) {\n    for (let row = 0, rowEnd = 0; row < map.height; row++) {\n      let rowNode = table.child(row)\n      rowEnd += rowNode.nodeSize\n      let cells = [], add\n      if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)\n        add = empty || (empty = types.cell.createAndFill())\n      else\n        add = emptyHead || (emptyHead = types.header_cell.createAndFill())\n      for (let i = map.width; i < width; i++) cells.push(add)\n      tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells)\n    }\n  }\n  if (height > map.height) {\n    let cells = []\n    for (let i = 0, start = (map.height - 1) * map.width; i < Math.max(map.width, width); i++) {\n      let header = i >= map.width ? false :\n          table.nodeAt(map.map[start + i]).type == types.header_cell\n      cells.push(header\n                 ? (emptyHead || (emptyHead = types.header_cell.createAndFill()))\n                 : (empty || (empty = types.cell.createAndFill())))\n    }\n\n    let emptyRow = types.row.create(null, Fragment.from(cells)), rows = []\n    for (let i = map.height; i < height; i++) rows.push(emptyRow)\n    tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows)\n  }\n  return !!(empty || emptyHead)\n}\n\n// Make sure the given line (left, top) to (right, top) doesn't cross\n// any rowspan cells by splitting cells that cross it. Return true if\n// something changed.\nfunction isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {\n  if (top == 0 || top == map.height) return false\n  let found = false\n  for (let col = left; col < right; col++) {\n    let index = top * map.width + col, pos = map.map[index]\n    if (map.map[index - map.width] == pos) {\n      found = true\n      let cell = table.nodeAt(pos)\n      let {top: cellTop, left: cellLeft} = map.findCell(pos)\n      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, setAttr(cell.attrs, \"rowspan\", top - cellTop))\n      tr.insert(tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),\n                cell.type.createAndFill(setAttr(cell.attrs, \"rowspan\", (cellTop + cell.attrs.rowspan) - top)))\n      col += cell.attrs.colspan - 1\n    }\n  }\n  return found\n}\n\n// Make sure the given line (left, top) to (left, bottom) doesn't\n// cross any colspan cells by splitting cells that cross it. Return\n// true if something changed.\nfunction isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {\n  if (left == 0 || left == map.width) return false\n  let found = false\n  for (let row = top; row < bottom; row++) {\n    let index = row * map.width + left, pos = map.map[index]\n    if (map.map[index - 1] == pos) {\n      found = true\n      let cell = table.nodeAt(pos), cellLeft = map.colCount(pos)\n      let updatePos = tr.mapping.slice(mapFrom).map(pos + start)\n      tr.setNodeMarkup(updatePos, null, removeColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)))\n      tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(removeColSpan(cell.attrs, 0, left - cellLeft)))\n      row += cell.attrs.rowspan - 1\n    }\n  }\n  return found\n}\n\n// Insert the given set of cells (as returned by `pastedCells`) into a\n// table, at the position pointed at by rect.\nexport function insertCells(state, dispatch, tableStart, rect, cells) {\n  let table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc, map = TableMap.get(table)\n  let {top, left} = rect\n  let right = left + cells.width, bottom = top + cells.height\n  let tr = state.tr, mapFrom = 0\n  function recomp() {\n    table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc\n    map = TableMap.get(table)\n    mapFrom = tr.mapping.maps.length\n  }\n  // Prepare the table to be large enough and not have any cells\n  // crossing the boundaries of the rectangle that we want to\n  // insert into. If anything about it changes, recompute the table\n  // map so that subsequent operations can see the current shape.\n  if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) recomp()\n  if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom)) recomp()\n  if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)) recomp()\n  if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom)) recomp()\n  if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom)) recomp()\n\n  for (let row = top; row < bottom; row++) {\n    let from = map.positionAt(row, left, table), to = map.positionAt(row, right, table)\n    tr.replace(tr.mapping.slice(mapFrom).map(from + tableStart), tr.mapping.slice(mapFrom).map(to + tableStart),\n               new Slice(cells.rows[row - top], 0, 0))\n  }\n  recomp()\n  tr.setSelection(new CellSelection(tr.doc.resolve(tableStart + map.positionAt(top, left, table)),\n                                    tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))))\n  dispatch(tr)\n}\n","// This file defines helpers for normalizing tables, making sure no\n// cells overlap (which can happen, if you have the wrong col- and\n// rowspans) and that each row has the same width. Uses the problems\n// reported by `TableMap`.\n\nimport {PluginKey} from \"prosemirror-state\"\nimport {TableMap} from \"./tablemap\"\nimport {setAttr, removeColSpan} from \"./util\"\nimport {tableNodeTypes} from \"./schema\"\nimport {key} from \"./util\"\n\nexport const fixTablesKey = new PluginKey(\"fix-tables\")\n\n// Helper for iterating through the nodes in a document that changed\n// compared to the given previous document. Useful for avoiding\n// duplicate work on each transaction.\nfunction changedDescendants(old, cur, offset, f) {\n  let oldSize = old.childCount, curSize = cur.childCount\n  outer: for (let i = 0, j = 0; i < curSize; i++) {\n    let child = cur.child(i)\n    for (let scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {\n      if (old.child(scan) == child) {\n        j = scan + 1\n        offset += child.nodeSize\n        continue outer\n      }\n    }\n    f(child, offset)\n    if (j < oldSize && old.child(j).sameMarkup(child))\n      changedDescendants(old.child(j), child, offset + 1, f)\n    else\n      child.nodesBetween(0, child.content.size, f, offset + 1)\n    offset += child.nodeSize\n  }\n}\n\n// :: (EditorState, ?EditorState) → ?Transaction\n// Inspect all tables in the given state's document and return a\n// transaction that fixes them, if necessary. If `oldState` was\n// provided, that is assumed to hold a previous, known-good state,\n// which will be used to avoid re-scanning unchanged parts of the\n// document.\nexport function fixTables(state, oldState) {\n  let tr, check = (node, pos) => {\n    if (node.type.spec.tableRole == \"table\") tr = fixTable(state, node, pos, tr)\n  }\n  if (!oldState) state.doc.descendants(check)\n  else if (oldState.doc != state.doc) changedDescendants(oldState.doc, state.doc, 0, check)\n  return tr\n}\n\n// : (EditorState, Node, number, ?Transaction) → ?Transaction\n// Fix the given table, if necessary. Will append to the transaction\n// it was given, if non-null, or create a new one if necessary.\nexport function fixTable(state, table, tablePos, tr) {\n  let map = TableMap.get(table)\n  if (!map.problems) return tr\n  if (!tr) tr = state.tr\n\n  // Track which rows we must add cells to, so that we can adjust that\n  // when fixing collisions.\n  let mustAdd = []\n  for (let i = 0; i < map.height; i++) mustAdd.push(0)\n  for (let i = 0; i < map.problems.length; i++) {\n    let prob = map.problems[i]\n    if (prob.type == \"collision\") {\n      let cell = table.nodeAt(prob.pos)\n      for (let j = 0; j < cell.attrs.rowspan; j++) mustAdd[prob.row + j] += prob.n\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, removeColSpan(cell.attrs, cell.attrs.colspan - prob.n, prob.n))\n    } else if (prob.type == \"missing\") {\n      mustAdd[prob.row] += prob.n\n    } else if (prob.type == \"overlong_rowspan\") {\n      let cell = table.nodeAt(prob.pos)\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell.attrs, \"rowspan\", cell.attrs.rowspan - prob.n))\n    } else if (prob.type == \"colwidth mismatch\") {\n      let cell = table.nodeAt(prob.pos)\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell.attrs, \"colwidth\", prob.colwidth))\n    }\n  }\n  let first, last\n  for (let i = 0; i < mustAdd.length; i++) if (mustAdd[i]) {\n    if (first == null) first = i\n    last = i\n  }\n  // Add the necessary cells, using a heuristic for whether to add the\n  // cells at the start or end of the rows (if it looks like a 'bite'\n  // was taken out of the table, add cells at the start of the row\n  // after the bite. Otherwise add them at the end).\n  for (let i = 0, pos = tablePos + 1; i < map.height; i++) {\n    let row = table.child(i)\n    let end = pos + row.nodeSize\n    let add = mustAdd[i]\n    if (add > 0) {\n      let tableNodeType = 'cell';\n      if (row.firstChild) {\n        tableNodeType = row.firstChild.type.spec.tableRole\n      }\n      let nodes = []\n      for (let j = 0; j < add; j++)\n        nodes.push(tableNodeTypes(state.schema)[tableNodeType].createAndFill())\n      let side = (i == 0 || first == i - 1) && last == i ? pos + 1 : end - 1\n      tr.insert(tr.mapping.map(side), nodes)\n    }\n    pos = end\n  }\n  return tr.setMeta(fixTablesKey, { fixTables: true })\n}\n","export class TableView {\n  constructor(node, cellMinWidth) {\n    this.node = node\n    this.cellMinWidth = cellMinWidth\n    this.dom = document.createElement(\"div\")\n    this.dom.className = \"tableWrapper\"\n    this.table = this.dom.appendChild(document.createElement(\"table\"))\n    this.colgroup = this.table.appendChild(document.createElement(\"colgroup\"))\n    updateColumns(node, this.colgroup, this.table, cellMinWidth)\n    this.contentDOM = this.table.appendChild(document.createElement(\"tbody\"))\n  }\n\n  update(node) {\n    if (node.type != this.node.type) return false\n    this.node = node\n    updateColumns(node, this.colgroup, this.table, this.cellMinWidth)\n    return true\n  }\n\n  ignoreMutation(record) {\n    return record.type == \"attributes\" && (record.target == this.table || this.colgroup.contains(record.target))\n  }\n}\n\nexport function updateColumns(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {\n  let totalWidth = 0, fixedWidth = true\n  let nextDOM = colgroup.firstChild, row = node.firstChild\n  for (let i = 0, col = 0; i < row.childCount; i++) {\n    let {colspan, colwidth} = row.child(i).attrs\n    for (let j = 0; j < colspan; j++, col++) {\n      let hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j]\n      let cssWidth = hasWidth ? hasWidth + \"px\" : \"\"\n      totalWidth += hasWidth || cellMinWidth\n      if (!hasWidth) fixedWidth = false\n      if (!nextDOM) {\n        colgroup.appendChild(document.createElement(\"col\")).style.width = cssWidth\n      } else {\n        if (nextDOM.style.width != cssWidth) nextDOM.style.width = cssWidth\n        nextDOM = nextDOM.nextSibling\n      }\n    }\n  }\n\n  while (nextDOM) {\n    let after = nextDOM.nextSibling\n    nextDOM.parentNode.removeChild(nextDOM)\n    nextDOM = after\n  }\n\n  if (fixedWidth) {\n    table.style.width = totalWidth + \"px\"\n    table.style.minWidth = \"\"\n  } else {\n    table.style.width = \"\"\n    table.style.minWidth = totalWidth + \"px\"\n  }\n}\n","import {Plugin, PluginKey} from \"prosemirror-state\"\nimport {Decoration, DecorationSet} from \"prosemirror-view\"\nimport {cellAround, pointsAtCell, setAttr} from \"./util\"\nimport {TableMap} from \"./tablemap\"\nimport {TableView, updateColumns} from \"./tableview\"\nimport {tableNodeTypes} from \"./schema\"\n\nexport const key = new PluginKey(\"tableColumnResizing\")\n\nexport function columnResizing({ handleWidth = 5, cellMinWidth = 25, View = TableView, lastColumnResizable = true } = {}) {\n  let plugin = new Plugin({\n    key,\n    state: {\n      init(_, state) {\n        this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] =\n          (node, view) => new View(node, cellMinWidth, view)\n        return new ResizeState(-1, false)\n      },\n      apply(tr, prev) {\n        return prev.apply(tr)\n      }\n    },\n    props: {\n      attributes(state) {\n        let pluginState = key.getState(state)\n        return pluginState.activeHandle > -1 ? {class: \"resize-cursor\"} : null\n      },\n\n      handleDOMEvents: {\n        mousemove(view, event) { handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) },\n        mouseleave(view) { handleMouseLeave(view) },\n        mousedown(view, event) { handleMouseDown(view, event, cellMinWidth) }\n      },\n\n      decorations(state) {\n        let pluginState = key.getState(state)\n        if (pluginState.activeHandle > -1) return handleDecorations(state, pluginState.activeHandle)\n      },\n\n      nodeViews: {}\n    }\n  })\n  return plugin\n}\n\nclass ResizeState {\n  constructor(activeHandle, dragging) {\n    this.activeHandle = activeHandle\n    this.dragging = dragging\n  }\n\n  apply(tr) {\n    let state = this, action = tr.getMeta(key)\n    if (action && action.setHandle != null)\n      return new ResizeState(action.setHandle, null)\n    if (action && action.setDragging !== undefined)\n      return new ResizeState(state.activeHandle, action.setDragging)\n    if (state.activeHandle > -1 && tr.docChanged) {\n      let handle = tr.mapping.map(state.activeHandle, -1)\n      if (!pointsAtCell(tr.doc.resolve(handle))) handle = null\n      state = new ResizeState(handle, state.dragging)\n    }\n    return state\n  }\n}\n\nfunction handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {\n  let pluginState = key.getState(view.state)\n\n  if (!pluginState.dragging) {\n    let target = domCellAround(event.target), cell = -1\n    if (target) {\n      let {left, right} = target.getBoundingClientRect()\n      if (event.clientX - left <= handleWidth)\n        cell = edgeCell(view, event, \"left\")\n      else if (right - event.clientX <= handleWidth)\n        cell = edgeCell(view, event, \"right\")\n    }\n\n    if (cell != pluginState.activeHandle) {\n      if (!lastColumnResizable && cell !== -1) {\n        let $cell = view.state.doc.resolve(cell)\n        let table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1)\n        let col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1\n\n        if (col == map.width - 1) {\n          return\n        }\n      }\n\n      updateHandle(view, cell)\n    }\n  }\n}\n\nfunction handleMouseLeave(view) {\n  let pluginState = key.getState(view.state)\n  if (pluginState.activeHandle > -1 && !pluginState.dragging) updateHandle(view, -1)\n}\n\nfunction handleMouseDown(view, event, cellMinWidth) {\n  let pluginState = key.getState(view.state)\n  if (pluginState.activeHandle == -1 || pluginState.dragging) return false\n\n  let cell = view.state.doc.nodeAt(pluginState.activeHandle)\n  let width = currentColWidth(view, pluginState.activeHandle, cell.attrs)\n  view.dispatch(view.state.tr.setMeta(key, {setDragging: {startX: event.clientX, startWidth: width}}))\n\n  function finish(event) {\n    window.removeEventListener(\"mouseup\", finish)\n    window.removeEventListener(\"mousemove\", move)\n    let pluginState = key.getState(view.state)\n    if (pluginState.dragging) {\n      updateColumnWidth(view, pluginState.activeHandle, draggedWidth(pluginState.dragging, event, cellMinWidth))\n      view.dispatch(view.state.tr.setMeta(key, {setDragging: null}))\n    }\n  }\n  function move(event) {\n    if (!event.which) return finish(event)\n    let pluginState = key.getState(view.state)\n    let dragged = draggedWidth(pluginState.dragging, event, cellMinWidth)\n    displayColumnWidth(view, pluginState.activeHandle, dragged, cellMinWidth)\n  }\n\n  window.addEventListener(\"mouseup\", finish)\n  window.addEventListener(\"mousemove\", move)\n  event.preventDefault()\n  return true\n}\n\nfunction currentColWidth(view, cellPos, {colspan, colwidth}) {\n  let width = colwidth && colwidth[colwidth.length - 1]\n  if (width) return width\n  let dom = view.domAtPos(cellPos)\n  let node = dom.node.childNodes[dom.offset]\n  let domWidth = node.offsetWidth, parts = colspan\n  if (colwidth) for (let i = 0; i < colspan; i++) if (colwidth[i]) {\n    domWidth -= colwidth[i]\n    parts--\n  }\n  return domWidth / parts\n}\n\nfunction domCellAround(target) {\n  while (target && target.nodeName != \"TD\" && target.nodeName != \"TH\")\n    target = target.classList.contains(\"ProseMirror\") ? null : target.parentNode\n  return target\n}\n\nfunction edgeCell(view, event, side) {\n  let found = view.posAtCoords({left: event.clientX, top: event.clientY})\n  if (!found) return -1\n  let {pos} = found\n  let $cell = cellAround(view.state.doc.resolve(pos))\n  if (!$cell) return -1\n  if (side == \"right\") return $cell.pos\n  let map = TableMap.get($cell.node(-1)), start = $cell.start(-1)\n  let index = map.map.indexOf($cell.pos - start)\n  return index % map.width == 0 ? -1 : start + map.map[index - 1]\n}\n\nfunction draggedWidth(dragging, event, cellMinWidth) {\n  let offset = event.clientX - dragging.startX\n  return Math.max(cellMinWidth, dragging.startWidth + offset)\n}\n\nfunction updateHandle(view, value) {\n  view.dispatch(view.state.tr.setMeta(key, {setHandle: value}))\n}\n\nfunction updateColumnWidth(view, cell, width) {\n  let $cell = view.state.doc.resolve(cell)\n  let table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1)\n  let col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1\n  let tr = view.state.tr\n  for (let row = 0; row < map.height; row++) {\n    let mapIndex = row * map.width + col\n    // Rowspanning cell that has already been handled\n    if (row && map.map[mapIndex] == map.map[mapIndex - map.width]) continue\n    let pos = map.map[mapIndex], {attrs} = table.nodeAt(pos)\n    let index = attrs.colspan == 1 ? 0 : col - map.colCount(pos)\n    if (attrs.colwidth && attrs.colwidth[index] == width) continue\n    let colwidth = attrs.colwidth ? attrs.colwidth.slice() : zeroes(attrs.colspan)\n    colwidth[index] = width\n    tr.setNodeMarkup(start + pos, null, setAttr(attrs, \"colwidth\", colwidth))\n  }\n  if (tr.docChanged) view.dispatch(tr)\n}\n\nfunction displayColumnWidth(view, cell, width, cellMinWidth) {\n  let $cell = view.state.doc.resolve(cell)\n  let table = $cell.node(-1), start = $cell.start(-1)\n  let col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1\n  let dom = view.domAtPos($cell.start(-1)).node\n  while (dom.nodeName != \"TABLE\") dom = dom.parentNode\n  updateColumns(table, dom.firstChild, dom, cellMinWidth, col, width)\n}\n\nfunction zeroes(n) {\n  let result = []\n  for (let i = 0; i < n; i++) result.push(0)\n  return result\n}\n\nfunction handleDecorations(state, cell) {\n  let decorations = []\n  let $cell = state.doc.resolve(cell)\n  let table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1)\n  let col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan\n  for (let row = 0; row < map.height; row++) {\n    let index = col + row * map.width - 1\n    // For positions that are have either a different cell or the end\n    // of the table to their right, and either the top of the table or\n    // a different cell above them, add a decoration\n    if ((col == map.width || map.map[index] != map.map[index + 1]) &&\n        (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])) {\n      let cellPos = map.map[index]\n      let pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1\n      let dom = document.createElement(\"div\")\n      dom.className = \"column-resize-handle\"\n      decorations.push(Decoration.widget(pos, dom))\n    }\n  }\n  return DecorationSet.create(state.doc, decorations)\n}\n","'use strict';\n\n\nmodule.exports = require('./lib/');\n","// HTML5 entities map: { name -> utf16string }\n//\n'use strict';\n\n/*eslint quotes:0*/\nmodule.exports = require('entities/maps/entities.json');\n","'use strict';\n\n\nmodule.exports.encode = require('./encode');\nmodule.exports.decode = require('./decode');\nmodule.exports.format = require('./format');\nmodule.exports.parse  = require('./parse');\n","module.exports=/[\\0-\\uD7FF\\uE000-\\uFFFF]|[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/","module.exports=/[\\0-\\x1F\\x7F-\\x9F]/","module.exports=/[ \\xA0\\u1680\\u2000-\\u200A\\u2028\\u2029\\u202F\\u205F\\u3000]/","// Regexps to match html elements\n\n'use strict';\n\nvar attr_name     = '[a-zA-Z_:][a-zA-Z0-9:._-]*';\n\nvar unquoted      = '[^\"\\'=<>`\\\\x00-\\\\x20]+';\nvar single_quoted = \"'[^']*'\";\nvar double_quoted = '\"[^\"]*\"';\n\nvar attr_value  = '(?:' + unquoted + '|' + single_quoted + '|' + double_quoted + ')';\n\nvar attribute   = '(?:\\\\s+' + attr_name + '(?:\\\\s*=\\\\s*' + attr_value + ')?)';\n\nvar open_tag    = '<[A-Za-z][A-Za-z0-9\\\\-]*' + attribute + '*\\\\s*\\\\/?>';\n\nvar close_tag   = '<\\\\/[A-Za-z][A-Za-z0-9\\\\-]*\\\\s*>';\nvar comment     = '<!---->|<!--(?:-?[^>-])(?:-?[^-])*-->';\nvar processing  = '<[?].*?[?]>';\nvar declaration = '<![A-Z]+\\\\s+[^>]*>';\nvar cdata       = '<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?\\\\]\\\\]>';\n\nvar HTML_TAG_RE = new RegExp('^(?:' + open_tag + '|' + close_tag + '|' + comment +\n                        '|' + processing + '|' + declaration + '|' + cdata + ')');\nvar HTML_OPEN_CLOSE_TAG_RE = new RegExp('^(?:' + open_tag + '|' + close_tag + ')');\n\nmodule.exports.HTML_TAG_RE = HTML_TAG_RE;\nmodule.exports.HTML_OPEN_CLOSE_TAG_RE = HTML_OPEN_CLOSE_TAG_RE;\n","// ~~strike through~~\n//\n'use strict';\n\n\n// Insert each marker as a separate text token, and add it to delimiter list\n//\nmodule.exports.tokenize = function strikethrough(state, silent) {\n  var i, scanned, token, len, ch,\n      start = state.pos,\n      marker = state.src.charCodeAt(start);\n\n  if (silent) { return false; }\n\n  if (marker !== 0x7E/* ~ */) { return false; }\n\n  scanned = state.scanDelims(state.pos, true);\n  len = scanned.length;\n  ch = String.fromCharCode(marker);\n\n  if (len < 2) { return false; }\n\n  if (len % 2) {\n    token         = state.push('text', '', 0);\n    token.content = ch;\n    len--;\n  }\n\n  for (i = 0; i < len; i += 2) {\n    token         = state.push('text', '', 0);\n    token.content = ch + ch;\n\n    state.delimiters.push({\n      marker: marker,\n      jump:   i,\n      token:  state.tokens.length - 1,\n      level:  state.level,\n      end:    -1,\n      open:   scanned.can_open,\n      close:  scanned.can_close\n    });\n  }\n\n  state.pos += scanned.length;\n\n  return true;\n};\n\n\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function strikethrough(state) {\n  var i, j,\n      startDelim,\n      endDelim,\n      token,\n      loneMarkers = [],\n      delimiters = state.delimiters,\n      max = state.delimiters.length;\n\n  for (i = 0; i < max; i++) {\n    startDelim = delimiters[i];\n\n    if (startDelim.marker !== 0x7E/* ~ */) {\n      continue;\n    }\n\n    if (startDelim.end === -1) {\n      continue;\n    }\n\n    endDelim = delimiters[startDelim.end];\n\n    token         = state.tokens[startDelim.token];\n    token.type    = 's_open';\n    token.tag     = 's';\n    token.nesting = 1;\n    token.markup  = '~~';\n    token.content = '';\n\n    token         = state.tokens[endDelim.token];\n    token.type    = 's_close';\n    token.tag     = 's';\n    token.nesting = -1;\n    token.markup  = '~~';\n    token.content = '';\n\n    if (state.tokens[endDelim.token - 1].type === 'text' &&\n        state.tokens[endDelim.token - 1].content === '~') {\n\n      loneMarkers.push(endDelim.token - 1);\n    }\n  }\n\n  // If a marker sequence has an odd number of characters, it's splitted\n  // like this: `~~~~~` -> `~` + `~~` + `~~`, leaving one marker at the\n  // start of the sequence.\n  //\n  // So, we have to move all those markers after subsequent s_close tags.\n  //\n  while (loneMarkers.length) {\n    i = loneMarkers.pop();\n    j = i + 1;\n\n    while (j < state.tokens.length && state.tokens[j].type === 's_close') {\n      j++;\n    }\n\n    j--;\n\n    if (i !== j) {\n      token = state.tokens[j];\n      state.tokens[j] = state.tokens[i];\n      state.tokens[i] = token;\n    }\n  }\n};\n","// Process *this* and _that_\n//\n'use strict';\n\n\n// Insert each marker as a separate text token, and add it to delimiter list\n//\nmodule.exports.tokenize = function emphasis(state, silent) {\n  var i, scanned, token,\n      start = state.pos,\n      marker = state.src.charCodeAt(start);\n\n  if (silent) { return false; }\n\n  if (marker !== 0x5F /* _ */ && marker !== 0x2A /* * */) { return false; }\n\n  scanned = state.scanDelims(state.pos, marker === 0x2A);\n\n  for (i = 0; i < scanned.length; i++) {\n    token         = state.push('text', '', 0);\n    token.content = String.fromCharCode(marker);\n\n    state.delimiters.push({\n      // Char code of the starting marker (number).\n      //\n      marker: marker,\n\n      // Total length of these series of delimiters.\n      //\n      length: scanned.length,\n\n      // An amount of characters before this one that's equivalent to\n      // current one. In plain English: if this delimiter does not open\n      // an emphasis, neither do previous `jump` characters.\n      //\n      // Used to skip sequences like \"*****\" in one step, for 1st asterisk\n      // value will be 0, for 2nd it's 1 and so on.\n      //\n      jump:   i,\n\n      // A position of the token this delimiter corresponds to.\n      //\n      token:  state.tokens.length - 1,\n\n      // Token level.\n      //\n      level:  state.level,\n\n      // If this delimiter is matched as a valid opener, `end` will be\n      // equal to its position, otherwise it's `-1`.\n      //\n      end:    -1,\n\n      // Boolean flags that determine if this delimiter could open or close\n      // an emphasis.\n      //\n      open:   scanned.can_open,\n      close:  scanned.can_close\n    });\n  }\n\n  state.pos += scanned.length;\n\n  return true;\n};\n\n\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function emphasis(state) {\n  var i,\n      startDelim,\n      endDelim,\n      token,\n      ch,\n      isStrong,\n      delimiters = state.delimiters,\n      max = state.delimiters.length;\n\n  for (i = max - 1; i >= 0; i--) {\n    startDelim = delimiters[i];\n\n    if (startDelim.marker !== 0x5F/* _ */ && startDelim.marker !== 0x2A/* * */) {\n      continue;\n    }\n\n    // Process only opening markers\n    if (startDelim.end === -1) {\n      continue;\n    }\n\n    endDelim = delimiters[startDelim.end];\n\n    // If the previous delimiter has the same marker and is adjacent to this one,\n    // merge those into one strong delimiter.\n    //\n    // `<em><em>whatever</em></em>` -> `<strong>whatever</strong>`\n    //\n    isStrong = i > 0 &&\n               delimiters[i - 1].end === startDelim.end + 1 &&\n               delimiters[i - 1].token === startDelim.token - 1 &&\n               delimiters[startDelim.end + 1].token === endDelim.token + 1 &&\n               delimiters[i - 1].marker === startDelim.marker;\n\n    ch = String.fromCharCode(startDelim.marker);\n\n    token         = state.tokens[startDelim.token];\n    token.type    = isStrong ? 'strong_open' : 'em_open';\n    token.tag     = isStrong ? 'strong' : 'em';\n    token.nesting = 1;\n    token.markup  = isStrong ? ch + ch : ch;\n    token.content = '';\n\n    token         = state.tokens[endDelim.token];\n    token.type    = isStrong ? 'strong_close' : 'em_close';\n    token.tag     = isStrong ? 'strong' : 'em';\n    token.nesting = -1;\n    token.markup  = isStrong ? ch + ch : ch;\n    token.content = '';\n\n    if (isStrong) {\n      state.tokens[delimiters[i - 1].token].content = '';\n      state.tokens[delimiters[startDelim.end + 1].token].content = '';\n      i--;\n    }\n  }\n};\n","/* globals __webpack_amd_options__ */\nmodule.exports = __webpack_amd_options__;\n","'use strict'\n\nvar high = require('highlight.js/lib/core')\nvar fault = require('fault')\n\nexports.highlight = highlight\nexports.highlightAuto = highlightAuto\nexports.registerLanguage = registerLanguage\nexports.listLanguages = listLanguages\nexports.registerAlias = registerAlias\n\nEmitter.prototype.addText = text\nEmitter.prototype.addKeyword = addKeyword\nEmitter.prototype.addSublanguage = addSublanguage\nEmitter.prototype.openNode = open\nEmitter.prototype.closeNode = close\nEmitter.prototype.closeAllNodes = noop\nEmitter.prototype.finalize = noop\nEmitter.prototype.toHTML = toHtmlNoop\n\nvar defaultPrefix = 'hljs-'\n\n// Highlighting `value` in the language `name`.\nfunction highlight(name, value, options) {\n  var before = high.configure({})\n  var settings = options || {}\n  var prefix = settings.prefix\n  var result\n\n  if (typeof name !== 'string') {\n    throw fault('Expected `string` for name, got `%s`', name)\n  }\n\n  if (!high.getLanguage(name)) {\n    throw fault('Unknown language: `%s` is not registered', name)\n  }\n\n  if (typeof value !== 'string') {\n    throw fault('Expected `string` for value, got `%s`', value)\n  }\n\n  if (prefix === null || prefix === undefined) {\n    prefix = defaultPrefix\n  }\n\n  high.configure({__emitter: Emitter, classPrefix: prefix})\n\n  result = high.highlight(name, value, true)\n\n  high.configure(before || {})\n\n  /* istanbul ignore if - Highlight.js seems to use this (currently) for broken\n   * grammars, so let’s keep it in there just to be sure. */\n  if (result.errorRaised) {\n    throw result.errorRaised\n  }\n\n  return {\n    relevance: result.relevance,\n    language: result.language,\n    value: result.emitter.rootNode.children\n  }\n}\n\nfunction highlightAuto(value, options) {\n  var settings = options || {}\n  var subset = settings.subset || high.listLanguages()\n  var prefix = settings.prefix\n  var length = subset.length\n  var index = -1\n  var result\n  var secondBest\n  var current\n  var name\n\n  if (prefix === null || prefix === undefined) {\n    prefix = defaultPrefix\n  }\n\n  if (typeof value !== 'string') {\n    throw fault('Expected `string` for value, got `%s`', value)\n  }\n\n  secondBest = {relevance: 0, language: null, value: []}\n  result = {relevance: 0, language: null, value: []}\n\n  while (++index < length) {\n    name = subset[index]\n\n    if (!high.getLanguage(name)) {\n      continue\n    }\n\n    current = highlight(name, value, options)\n    current.language = name\n\n    if (current.relevance > secondBest.relevance) {\n      secondBest = current\n    }\n\n    if (current.relevance > result.relevance) {\n      secondBest = result\n      result = current\n    }\n  }\n\n  if (secondBest.language) {\n    result.secondBest = secondBest\n  }\n\n  return result\n}\n\n// Register a language.\nfunction registerLanguage(name, syntax) {\n  high.registerLanguage(name, syntax)\n}\n\n// Get a list of all registered languages.\nfunction listLanguages() {\n  return high.listLanguages()\n}\n\n// Register more aliases for an already registered language.\nfunction registerAlias(name, alias) {\n  var map = name\n  var key\n\n  if (alias) {\n    map = {}\n    map[name] = alias\n  }\n\n  for (key in map) {\n    high.registerAliases(map[key], {languageName: key})\n  }\n}\n\nfunction Emitter(options) {\n  this.options = options\n  this.rootNode = {children: []}\n  this.stack = [this.rootNode]\n}\n\nfunction addKeyword(value, name) {\n  this.openNode(name)\n  this.addText(value)\n  this.closeNode()\n}\n\nfunction addSublanguage(other, name) {\n  var stack = this.stack\n  var current = stack[stack.length - 1]\n  var results = other.rootNode.children\n  var node = name\n    ? {\n        type: 'element',\n        tagName: 'span',\n        properties: {className: [name]},\n        children: results\n      }\n    : results\n\n  current.children = current.children.concat(node)\n}\n\nfunction text(value) {\n  var stack = this.stack\n  var current\n  var tail\n\n  if (value === '') return\n\n  current = stack[stack.length - 1]\n  tail = current.children[current.children.length - 1]\n\n  if (tail && tail.type === 'text') {\n    tail.value += value\n  } else {\n    current.children.push({type: 'text', value: value})\n  }\n}\n\nfunction open(name) {\n  var stack = this.stack\n  var className = this.options.classPrefix + name\n  var current = stack[stack.length - 1]\n  var child = {\n    type: 'element',\n    tagName: 'span',\n    properties: {className: [className]},\n    children: []\n  }\n\n  current.children.push(child)\n  stack.push(child)\n}\n\nfunction close() {\n  this.stack.pop()\n}\n\nfunction toHtmlNoop() {\n  return ''\n}\n\nfunction noop() {}\n","// https://github.com/substack/deep-freeze/blob/master/index.js\n/** @param {any} obj */\nfunction deepFreeze(obj) {\n  Object.freeze(obj);\n\n  var objIsFunction = typeof obj === 'function';\n\n  Object.getOwnPropertyNames(obj).forEach(function(prop) {\n    if (Object.hasOwnProperty.call(obj, prop)\n    && obj[prop] !== null\n    && (typeof obj[prop] === \"object\" || typeof obj[prop] === \"function\")\n    // IE11 fix: https://github.com/highlightjs/highlight.js/issues/2318\n    // TODO: remove in the future\n    && (objIsFunction ? prop !== 'caller' && prop !== 'callee' && prop !== 'arguments' : true)\n    && !Object.isFrozen(obj[prop])) {\n      deepFreeze(obj[prop]);\n    }\n  });\n\n  return obj;\n}\n\nclass Response {\n  /**\n   * @param {CompiledMode} mode\n   */\n  constructor(mode) {\n    // eslint-disable-next-line no-undefined\n    if (mode.data === undefined) mode.data = {};\n\n    this.data = mode.data;\n  }\n\n  ignoreMatch() {\n    this.ignore = true;\n  }\n}\n\n/**\n * @param {string} value\n * @returns {string}\n */\nfunction escapeHTML(value) {\n  return value\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#x27;');\n}\n\n/**\n * performs a shallow merge of multiple objects into one\n *\n * @template T\n * @param {T} original\n * @param {Record<string,any>[]} objects\n * @returns {T} a single new object\n */\nfunction inherit(original, ...objects) {\n  /** @type Record<string,any> */\n  var result = {};\n\n  for (const key in original) {\n    result[key] = original[key];\n  }\n  objects.forEach(function(obj) {\n    for (const key in obj) {\n      result[key] = obj[key];\n    }\n  });\n  return /** @type {T} */ (result);\n}\n\n/* Stream merging */\n\n/**\n * @typedef Event\n * @property {'start'|'stop'} event\n * @property {number} offset\n * @property {Node} node\n */\n\n/**\n * @param {Node} node\n */\nfunction tag(node) {\n  return node.nodeName.toLowerCase();\n}\n\n/**\n * @param {Node} node\n */\nfunction nodeStream(node) {\n  /** @type Event[] */\n  var result = [];\n  (function _nodeStream(node, offset) {\n    for (var child = node.firstChild; child; child = child.nextSibling) {\n      if (child.nodeType === 3) {\n        offset += child.nodeValue.length;\n      } else if (child.nodeType === 1) {\n        result.push({\n          event: 'start',\n          offset: offset,\n          node: child\n        });\n        offset = _nodeStream(child, offset);\n        // Prevent void elements from having an end tag that would actually\n        // double them in the output. There are more void elements in HTML\n        // but we list only those realistically expected in code display.\n        if (!tag(child).match(/br|hr|img|input/)) {\n          result.push({\n            event: 'stop',\n            offset: offset,\n            node: child\n          });\n        }\n      }\n    }\n    return offset;\n  })(node, 0);\n  return result;\n}\n\n/**\n * @param {any} original - the original stream\n * @param {any} highlighted - stream of the highlighted source\n * @param {string} value - the original source itself\n */\nfunction mergeStreams(original, highlighted, value) {\n  var processed = 0;\n  var result = '';\n  var nodeStack = [];\n\n  function selectStream() {\n    if (!original.length || !highlighted.length) {\n      return original.length ? original : highlighted;\n    }\n    if (original[0].offset !== highlighted[0].offset) {\n      return (original[0].offset < highlighted[0].offset) ? original : highlighted;\n    }\n\n    /*\n    To avoid starting the stream just before it should stop the order is\n    ensured that original always starts first and closes last:\n\n    if (event1 == 'start' && event2 == 'start')\n      return original;\n    if (event1 == 'start' && event2 == 'stop')\n      return highlighted;\n    if (event1 == 'stop' && event2 == 'start')\n      return original;\n    if (event1 == 'stop' && event2 == 'stop')\n      return highlighted;\n\n    ... which is collapsed to:\n    */\n    return highlighted[0].event === 'start' ? original : highlighted;\n  }\n\n  /**\n   * @param {Node} node\n   */\n  function open(node) {\n    /** @param {Attr} attr */\n    function attributeString(attr) {\n      return ' ' + attr.nodeName + '=\"' + escapeHTML(attr.value) + '\"';\n    }\n    // @ts-ignore\n    result += '<' + tag(node) + [].map.call(node.attributes, attributeString).join('') + '>';\n  }\n\n  /**\n   * @param {Node} node\n   */\n  function close(node) {\n    result += '</' + tag(node) + '>';\n  }\n\n  /**\n   * @param {Event} event\n   */\n  function render(event) {\n    (event.event === 'start' ? open : close)(event.node);\n  }\n\n  while (original.length || highlighted.length) {\n    var stream = selectStream();\n    result += escapeHTML(value.substring(processed, stream[0].offset));\n    processed = stream[0].offset;\n    if (stream === original) {\n      /*\n      On any opening or closing tag of the original markup we first close\n      the entire highlighted node stack, then render the original tag along\n      with all the following original tags at the same offset and then\n      reopen all the tags on the highlighted stack.\n      */\n      nodeStack.reverse().forEach(close);\n      do {\n        render(stream.splice(0, 1)[0]);\n        stream = selectStream();\n      } while (stream === original && stream.length && stream[0].offset === processed);\n      nodeStack.reverse().forEach(open);\n    } else {\n      if (stream[0].event === 'start') {\n        nodeStack.push(stream[0].node);\n      } else {\n        nodeStack.pop();\n      }\n      render(stream.splice(0, 1)[0]);\n    }\n  }\n  return result + escapeHTML(value.substr(processed));\n}\n\nvar utils = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  escapeHTML: escapeHTML,\n  inherit: inherit,\n  nodeStream: nodeStream,\n  mergeStreams: mergeStreams\n});\n\n/**\n * @typedef {object} Renderer\n * @property {(text: string) => void} addText\n * @property {(node: Node) => void} openNode\n * @property {(node: Node) => void} closeNode\n * @property {() => string} value\n */\n\n/** @typedef {{kind?: string, sublanguage?: boolean}} Node */\n/** @typedef {{walk: (r: Renderer) => void}} Tree */\n/** */\n\nconst SPAN_CLOSE = '</span>';\n\n/**\n * Determines if a node needs to be wrapped in <span>\n *\n * @param {Node} node */\nconst emitsWrappingTags = (node) => {\n  return !!node.kind;\n};\n\n/** @type {Renderer} */\nclass HTMLRenderer {\n  /**\n   * Creates a new HTMLRenderer\n   *\n   * @param {Tree} parseTree - the parse tree (must support `walk` API)\n   * @param {{classPrefix: string}} options\n   */\n  constructor(parseTree, options) {\n    this.buffer = \"\";\n    this.classPrefix = options.classPrefix;\n    parseTree.walk(this);\n  }\n\n  /**\n   * Adds texts to the output stream\n   *\n   * @param {string} text */\n  addText(text) {\n    this.buffer += escapeHTML(text);\n  }\n\n  /**\n   * Adds a node open to the output stream (if needed)\n   *\n   * @param {Node} node */\n  openNode(node) {\n    if (!emitsWrappingTags(node)) return;\n\n    let className = node.kind;\n    if (!node.sublanguage) {\n      className = `${this.classPrefix}${className}`;\n    }\n    this.span(className);\n  }\n\n  /**\n   * Adds a node close to the output stream (if needed)\n   *\n   * @param {Node} node */\n  closeNode(node) {\n    if (!emitsWrappingTags(node)) return;\n\n    this.buffer += SPAN_CLOSE;\n  }\n\n  /**\n   * returns the accumulated buffer\n  */\n  value() {\n    return this.buffer;\n  }\n\n  // helpers\n\n  /**\n   * Builds a span element\n   *\n   * @param {string} className */\n  span(className) {\n    this.buffer += `<span class=\"${className}\">`;\n  }\n}\n\n/** @typedef {{kind?: string, sublanguage?: boolean, children: Node[]} | string} Node */\n/** @typedef {{kind?: string, sublanguage?: boolean, children: Node[]} } DataNode */\n/**  */\n\nclass TokenTree {\n  constructor() {\n    /** @type DataNode */\n    this.rootNode = { children: [] };\n    this.stack = [this.rootNode];\n  }\n\n  get top() {\n    return this.stack[this.stack.length - 1];\n  }\n\n  get root() { return this.rootNode; }\n\n  /** @param {Node} node */\n  add(node) {\n    this.top.children.push(node);\n  }\n\n  /** @param {string} kind */\n  openNode(kind) {\n    /** @type Node */\n    const node = { kind, children: [] };\n    this.add(node);\n    this.stack.push(node);\n  }\n\n  closeNode() {\n    if (this.stack.length > 1) {\n      return this.stack.pop();\n    }\n    // eslint-disable-next-line no-undefined\n    return undefined;\n  }\n\n  closeAllNodes() {\n    while (this.closeNode());\n  }\n\n  toJSON() {\n    return JSON.stringify(this.rootNode, null, 4);\n  }\n\n  /**\n   * @typedef { import(\"./html_renderer\").Renderer } Renderer\n   * @param {Renderer} builder\n   */\n  walk(builder) {\n    // this does not\n    return this.constructor._walk(builder, this.rootNode);\n    // this works\n    // return TokenTree._walk(builder, this.rootNode);\n  }\n\n  /**\n   * @param {Renderer} builder\n   * @param {Node} node\n   */\n  static _walk(builder, node) {\n    if (typeof node === \"string\") {\n      builder.addText(node);\n    } else if (node.children) {\n      builder.openNode(node);\n      node.children.forEach((child) => this._walk(builder, child));\n      builder.closeNode(node);\n    }\n    return builder;\n  }\n\n  /**\n   * @param {Node} node\n   */\n  static _collapse(node) {\n    if (typeof node === \"string\") return;\n    if (!node.children) return;\n\n    if (node.children.every(el => typeof el === \"string\")) {\n      // node.text = node.children.join(\"\");\n      // delete node.children;\n      node.children = [node.children.join(\"\")];\n    } else {\n      node.children.forEach((child) => {\n        TokenTree._collapse(child);\n      });\n    }\n  }\n}\n\n/**\n  Currently this is all private API, but this is the minimal API necessary\n  that an Emitter must implement to fully support the parser.\n\n  Minimal interface:\n\n  - addKeyword(text, kind)\n  - addText(text)\n  - addSublanguage(emitter, subLanguageName)\n  - finalize()\n  - openNode(kind)\n  - closeNode()\n  - closeAllNodes()\n  - toHTML()\n\n*/\n\n/**\n * @implements {Emitter}\n */\nclass TokenTreeEmitter extends TokenTree {\n  /**\n   * @param {*} options\n   */\n  constructor(options) {\n    super();\n    this.options = options;\n  }\n\n  /**\n   * @param {string} text\n   * @param {string} kind\n   */\n  addKeyword(text, kind) {\n    if (text === \"\") { return; }\n\n    this.openNode(kind);\n    this.addText(text);\n    this.closeNode();\n  }\n\n  /**\n   * @param {string} text\n   */\n  addText(text) {\n    if (text === \"\") { return; }\n\n    this.add(text);\n  }\n\n  /**\n   * @param {Emitter & {root: DataNode}} emitter\n   * @param {string} name\n   */\n  addSublanguage(emitter, name) {\n    /** @type DataNode */\n    const node = emitter.root;\n    node.kind = name;\n    node.sublanguage = true;\n    this.add(node);\n  }\n\n  toHTML() {\n    const renderer = new HTMLRenderer(this, this.options);\n    return renderer.value();\n  }\n\n  finalize() {\n    return true;\n  }\n}\n\n/**\n * @param {string} value\n * @returns {RegExp}\n * */\nfunction escape(value) {\n  return new RegExp(value.replace(/[-/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&'), 'm');\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction source(re) {\n  if (!re) return null;\n  if (typeof re === \"string\") return re;\n\n  return re.source;\n}\n\n/**\n * @param {...(RegExp | string) } args\n * @returns {string}\n */\nfunction concat(...args) {\n  const joined = args.map((x) => source(x)).join(\"\");\n  return joined;\n}\n\n/**\n * @param {RegExp} re\n * @returns {number}\n */\nfunction countMatchGroups(re) {\n  return (new RegExp(re.toString() + '|')).exec('').length - 1;\n}\n\n/**\n * Does lexeme start with a regular expression match at the beginning\n * @param {RegExp} re\n * @param {string} lexeme\n */\nfunction startsWith(re, lexeme) {\n  var match = re && re.exec(lexeme);\n  return match && match.index === 0;\n}\n\n// join logically computes regexps.join(separator), but fixes the\n// backreferences so they continue to match.\n// it also places each individual regular expression into it's own\n// match group, keeping track of the sequencing of those match groups\n// is currently an exercise for the caller. :-)\n/**\n * @param {(string | RegExp)[]} regexps\n * @param {string} separator\n * @returns {string}\n */\nfunction join(regexps, separator = \"|\") {\n  // backreferenceRe matches an open parenthesis or backreference. To avoid\n  // an incorrect parse, it additionally matches the following:\n  // - [...] elements, where the meaning of parentheses and escapes change\n  // - other escape sequences, so we do not misparse escape sequences as\n  //   interesting elements\n  // - non-matching or lookahead parentheses, which do not capture. These\n  //   follow the '(' with a '?'.\n  var backreferenceRe = /\\[(?:[^\\\\\\]]|\\\\.)*\\]|\\(\\??|\\\\([1-9][0-9]*)|\\\\./;\n  var numCaptures = 0;\n  var ret = '';\n  for (var i = 0; i < regexps.length; i++) {\n    numCaptures += 1;\n    var offset = numCaptures;\n    var re = source(regexps[i]);\n    if (i > 0) {\n      ret += separator;\n    }\n    ret += \"(\";\n    while (re.length > 0) {\n      var match = backreferenceRe.exec(re);\n      if (match == null) {\n        ret += re;\n        break;\n      }\n      ret += re.substring(0, match.index);\n      re = re.substring(match.index + match[0].length);\n      if (match[0][0] === '\\\\' && match[1]) {\n        // Adjust the backreference.\n        ret += '\\\\' + String(Number(match[1]) + offset);\n      } else {\n        ret += match[0];\n        if (match[0] === '(') {\n          numCaptures++;\n        }\n      }\n    }\n    ret += \")\";\n  }\n  return ret;\n}\n\n// Common regexps\nconst IDENT_RE = '[a-zA-Z]\\\\w*';\nconst UNDERSCORE_IDENT_RE = '[a-zA-Z_]\\\\w*';\nconst NUMBER_RE = '\\\\b\\\\d+(\\\\.\\\\d+)?';\nconst C_NUMBER_RE = '(-?)(\\\\b0[xX][a-fA-F0-9]+|(\\\\b\\\\d+(\\\\.\\\\d*)?|\\\\.\\\\d+)([eE][-+]?\\\\d+)?)'; // 0x..., 0..., decimal, float\nconst BINARY_NUMBER_RE = '\\\\b(0b[01]+)'; // 0b...\nconst RE_STARTERS_RE = '!|!=|!==|%|%=|&|&&|&=|\\\\*|\\\\*=|\\\\+|\\\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\\\?|\\\\[|\\\\{|\\\\(|\\\\^|\\\\^=|\\\\||\\\\|=|\\\\|\\\\||~';\n\n/**\n* @param { Partial<Mode> & {binary?: string | RegExp} } opts\n*/\nconst SHEBANG = (opts = {}) => {\n  const beginShebang = /^#![ ]*\\//;\n  if (opts.binary) {\n    opts.begin = concat(\n      beginShebang,\n      /.*\\b/,\n      opts.binary,\n      /\\b.*/);\n  }\n  return inherit({\n    className: 'meta',\n    begin: beginShebang,\n    end: /$/,\n    relevance: 0,\n    /** @type {ModeCallback} */\n    \"on:begin\": (m, resp) => {\n      if (m.index !== 0) resp.ignoreMatch();\n    }\n  }, opts);\n};\n\n// Common modes\nconst BACKSLASH_ESCAPE = {\n  begin: '\\\\\\\\[\\\\s\\\\S]', relevance: 0\n};\nconst APOS_STRING_MODE = {\n  className: 'string',\n  begin: '\\'',\n  end: '\\'',\n  illegal: '\\\\n',\n  contains: [BACKSLASH_ESCAPE]\n};\nconst QUOTE_STRING_MODE = {\n  className: 'string',\n  begin: '\"',\n  end: '\"',\n  illegal: '\\\\n',\n  contains: [BACKSLASH_ESCAPE]\n};\nconst PHRASAL_WORDS_MODE = {\n  begin: /\\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\\b/\n};\n/**\n * Creates a comment mode\n *\n * @param {string | RegExp} begin\n * @param {string | RegExp} end\n * @param {Mode | {}} [modeOptions]\n * @returns {Partial<Mode>}\n */\nconst COMMENT = function(begin, end, modeOptions = {}) {\n  var mode = inherit(\n    {\n      className: 'comment',\n      begin,\n      end,\n      contains: []\n    },\n    modeOptions\n  );\n  mode.contains.push(PHRASAL_WORDS_MODE);\n  mode.contains.push({\n    className: 'doctag',\n    begin: '(?:TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):',\n    relevance: 0\n  });\n  return mode;\n};\nconst C_LINE_COMMENT_MODE = COMMENT('//', '$');\nconst C_BLOCK_COMMENT_MODE = COMMENT('/\\\\*', '\\\\*/');\nconst HASH_COMMENT_MODE = COMMENT('#', '$');\nconst NUMBER_MODE = {\n  className: 'number',\n  begin: NUMBER_RE,\n  relevance: 0\n};\nconst C_NUMBER_MODE = {\n  className: 'number',\n  begin: C_NUMBER_RE,\n  relevance: 0\n};\nconst BINARY_NUMBER_MODE = {\n  className: 'number',\n  begin: BINARY_NUMBER_RE,\n  relevance: 0\n};\nconst CSS_NUMBER_MODE = {\n  className: 'number',\n  begin: NUMBER_RE + '(' +\n    '%|em|ex|ch|rem' +\n    '|vw|vh|vmin|vmax' +\n    '|cm|mm|in|pt|pc|px' +\n    '|deg|grad|rad|turn' +\n    '|s|ms' +\n    '|Hz|kHz' +\n    '|dpi|dpcm|dppx' +\n    ')?',\n  relevance: 0\n};\nconst REGEXP_MODE = {\n  // this outer rule makes sure we actually have a WHOLE regex and not simply\n  // an expression such as:\n  //\n  //     3 / something\n  //\n  // (which will then blow up when regex's `illegal` sees the newline)\n  begin: /(?=\\/[^/\\n]*\\/)/,\n  contains: [{\n    className: 'regexp',\n    begin: /\\//,\n    end: /\\/[gimuy]*/,\n    illegal: /\\n/,\n    contains: [\n      BACKSLASH_ESCAPE,\n      {\n        begin: /\\[/,\n        end: /\\]/,\n        relevance: 0,\n        contains: [BACKSLASH_ESCAPE]\n      }\n    ]\n  }]\n};\nconst TITLE_MODE = {\n  className: 'title',\n  begin: IDENT_RE,\n  relevance: 0\n};\nconst UNDERSCORE_TITLE_MODE = {\n  className: 'title',\n  begin: UNDERSCORE_IDENT_RE,\n  relevance: 0\n};\nconst METHOD_GUARD = {\n  // excludes method names from keyword processing\n  begin: '\\\\.\\\\s*' + UNDERSCORE_IDENT_RE,\n  relevance: 0\n};\n\n/**\n * Adds end same as begin mechanics to a mode\n *\n * Your mode must include at least a single () match group as that first match\n * group is what is used for comparison\n * @param {Partial<Mode>} mode\n */\nconst END_SAME_AS_BEGIN = function(mode) {\n  return Object.assign(mode,\n    {\n      /** @type {ModeCallback} */\n      'on:begin': (m, resp) => { resp.data._beginMatch = m[1]; },\n      /** @type {ModeCallback} */\n      'on:end': (m, resp) => { if (resp.data._beginMatch !== m[1]) resp.ignoreMatch(); }\n    });\n};\n\nvar MODES = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  IDENT_RE: IDENT_RE,\n  UNDERSCORE_IDENT_RE: UNDERSCORE_IDENT_RE,\n  NUMBER_RE: NUMBER_RE,\n  C_NUMBER_RE: C_NUMBER_RE,\n  BINARY_NUMBER_RE: BINARY_NUMBER_RE,\n  RE_STARTERS_RE: RE_STARTERS_RE,\n  SHEBANG: SHEBANG,\n  BACKSLASH_ESCAPE: BACKSLASH_ESCAPE,\n  APOS_STRING_MODE: APOS_STRING_MODE,\n  QUOTE_STRING_MODE: QUOTE_STRING_MODE,\n  PHRASAL_WORDS_MODE: PHRASAL_WORDS_MODE,\n  COMMENT: COMMENT,\n  C_LINE_COMMENT_MODE: C_LINE_COMMENT_MODE,\n  C_BLOCK_COMMENT_MODE: C_BLOCK_COMMENT_MODE,\n  HASH_COMMENT_MODE: HASH_COMMENT_MODE,\n  NUMBER_MODE: NUMBER_MODE,\n  C_NUMBER_MODE: C_NUMBER_MODE,\n  BINARY_NUMBER_MODE: BINARY_NUMBER_MODE,\n  CSS_NUMBER_MODE: CSS_NUMBER_MODE,\n  REGEXP_MODE: REGEXP_MODE,\n  TITLE_MODE: TITLE_MODE,\n  UNDERSCORE_TITLE_MODE: UNDERSCORE_TITLE_MODE,\n  METHOD_GUARD: METHOD_GUARD,\n  END_SAME_AS_BEGIN: END_SAME_AS_BEGIN\n});\n\n// keywords that should have no default relevance value\nvar COMMON_KEYWORDS = 'of and for in not or if then'.split(' ');\n\n// compilation\n\n/**\n * Compiles a language definition result\n *\n * Given the raw result of a language definition (Language), compiles this so\n * that it is ready for highlighting code.\n * @param {Language} language\n * @returns {CompiledLanguage}\n */\nfunction compileLanguage(language) {\n  /**\n   * Builds a regex with the case sensativility of the current language\n   *\n   * @param {RegExp | string} value\n   * @param {boolean} [global]\n   */\n  function langRe(value, global) {\n    return new RegExp(\n      source(value),\n      'm' + (language.case_insensitive ? 'i' : '') + (global ? 'g' : '')\n    );\n  }\n\n  /**\n    Stores multiple regular expressions and allows you to quickly search for\n    them all in a string simultaneously - returning the first match.  It does\n    this by creating a huge (a|b|c) regex - each individual item wrapped with ()\n    and joined by `|` - using match groups to track position.  When a match is\n    found checking which position in the array has content allows us to figure\n    out which of the original regexes / match groups triggered the match.\n\n    The match object itself (the result of `Regex.exec`) is returned but also\n    enhanced by merging in any meta-data that was registered with the regex.\n    This is how we keep track of which mode matched, and what type of rule\n    (`illegal`, `begin`, end, etc).\n  */\n  class MultiRegex {\n    constructor() {\n      this.matchIndexes = {};\n      // @ts-ignore\n      this.regexes = [];\n      this.matchAt = 1;\n      this.position = 0;\n    }\n\n    // @ts-ignore\n    addRule(re, opts) {\n      opts.position = this.position++;\n      // @ts-ignore\n      this.matchIndexes[this.matchAt] = opts;\n      this.regexes.push([opts, re]);\n      this.matchAt += countMatchGroups(re) + 1;\n    }\n\n    compile() {\n      if (this.regexes.length === 0) {\n        // avoids the need to check length every time exec is called\n        // @ts-ignore\n        this.exec = () => null;\n      }\n      const terminators = this.regexes.map(el => el[1]);\n      this.matcherRe = langRe(join(terminators), true);\n      this.lastIndex = 0;\n    }\n\n    /** @param {string} s */\n    exec(s) {\n      this.matcherRe.lastIndex = this.lastIndex;\n      const match = this.matcherRe.exec(s);\n      if (!match) { return null; }\n\n      // eslint-disable-next-line no-undefined\n      const i = match.findIndex((el, i) => i > 0 && el !== undefined);\n      // @ts-ignore\n      const matchData = this.matchIndexes[i];\n      // trim off any earlier non-relevant match groups (ie, the other regex\n      // match groups that make up the multi-matcher)\n      match.splice(0, i);\n\n      return Object.assign(match, matchData);\n    }\n  }\n\n  /*\n    Created to solve the key deficiently with MultiRegex - there is no way to\n    test for multiple matches at a single location.  Why would we need to do\n    that?  In the future a more dynamic engine will allow certain matches to be\n    ignored.  An example: if we matched say the 3rd regex in a large group but\n    decided to ignore it - we'd need to started testing again at the 4th\n    regex... but MultiRegex itself gives us no real way to do that.\n\n    So what this class creates MultiRegexs on the fly for whatever search\n    position they are needed.\n\n    NOTE: These additional MultiRegex objects are created dynamically.  For most\n    grammars most of the time we will never actually need anything more than the\n    first MultiRegex - so this shouldn't have too much overhead.\n\n    Say this is our search group, and we match regex3, but wish to ignore it.\n\n      regex1 | regex2 | regex3 | regex4 | regex5    ' ie, startAt = 0\n\n    What we need is a new MultiRegex that only includes the remaining\n    possibilities:\n\n      regex4 | regex5                               ' ie, startAt = 3\n\n    This class wraps all that complexity up in a simple API... `startAt` decides\n    where in the array of expressions to start doing the matching. It\n    auto-increments, so if a match is found at position 2, then startAt will be\n    set to 3.  If the end is reached startAt will return to 0.\n\n    MOST of the time the parser will be setting startAt manually to 0.\n  */\n  class ResumableMultiRegex {\n    constructor() {\n      // @ts-ignore\n      this.rules = [];\n      // @ts-ignore\n      this.multiRegexes = [];\n      this.count = 0;\n\n      this.lastIndex = 0;\n      this.regexIndex = 0;\n    }\n\n    // @ts-ignore\n    getMatcher(index) {\n      if (this.multiRegexes[index]) return this.multiRegexes[index];\n\n      const matcher = new MultiRegex();\n      this.rules.slice(index).forEach(([re, opts]) => matcher.addRule(re, opts));\n      matcher.compile();\n      this.multiRegexes[index] = matcher;\n      return matcher;\n    }\n\n    resumingScanAtSamePosition() {\n      return this.regexIndex !== 0;\n    }\n\n    considerAll() {\n      this.regexIndex = 0;\n    }\n\n    // @ts-ignore\n    addRule(re, opts) {\n      this.rules.push([re, opts]);\n      if (opts.type === \"begin\") this.count++;\n    }\n\n    /** @param {string} s */\n    exec(s) {\n      const m = this.getMatcher(this.regexIndex);\n      m.lastIndex = this.lastIndex;\n      let result = m.exec(s);\n\n      // The following is because we have no easy way to say \"resume scanning at the\n      // existing position but also skip the current rule ONLY\". What happens is\n      // all prior rules are also skipped which can result in matching the wrong\n      // thing. Example of matching \"booger\":\n\n      // our matcher is [string, \"booger\", number]\n      //\n      // ....booger....\n\n      // if \"booger\" is ignored then we'd really need a regex to scan from the\n      // SAME position for only: [string, number] but ignoring \"booger\" (if it\n      // was the first match), a simple resume would scan ahead who knows how\n      // far looking only for \"number\", ignoring potential string matches (or\n      // future \"booger\" matches that might be valid.)\n\n      // So what we do: We execute two matchers, one resuming at the same\n      // position, but the second full matcher starting at the position after:\n\n      //     /--- resume first regex match here (for [number])\n      //     |/---- full match here for [string, \"booger\", number]\n      //     vv\n      // ....booger....\n\n      // Which ever results in a match first is then used. So this 3-4 step\n      // process essentially allows us to say \"match at this position, excluding\n      // a prior rule that was ignored\".\n      //\n      // 1. Match \"booger\" first, ignore. Also proves that [string] does non match.\n      // 2. Resume matching for [number]\n      // 3. Match at index + 1 for [string, \"booger\", number]\n      // 4. If #2 and #3 result in matches, which came first?\n      if (this.resumingScanAtSamePosition()) {\n        if (result && result.index === this.lastIndex) ; else { // use the second matcher result\n          const m2 = this.getMatcher(0);\n          m2.lastIndex = this.lastIndex + 1;\n          result = m2.exec(s);\n        }\n      }\n\n      if (result) {\n        this.regexIndex += result.position + 1;\n        if (this.regexIndex === this.count) {\n          // wrap-around to considering all matches again\n          this.considerAll();\n        }\n      }\n\n      return result;\n    }\n  }\n\n  /**\n   * Given a mode, builds a huge ResumableMultiRegex that can be used to walk\n   * the content and find matches.\n   *\n   * @param {CompiledMode} mode\n   * @returns {ResumableMultiRegex}\n   */\n  function buildModeRegex(mode) {\n    const mm = new ResumableMultiRegex();\n\n    mode.contains.forEach(term => mm.addRule(term.begin, { rule: term, type: \"begin\" }));\n\n    if (mode.terminator_end) {\n      mm.addRule(mode.terminator_end, { type: \"end\" });\n    }\n    if (mode.illegal) {\n      mm.addRule(mode.illegal, { type: \"illegal\" });\n    }\n\n    return mm;\n  }\n\n  // TODO: We need negative look-behind support to do this properly\n  /**\n   * Skip a match if it has a preceding or trailing dot\n   *\n   * This is used for `beginKeywords` to prevent matching expressions such as\n   * `bob.keyword.do()`. The mode compiler automatically wires this up as a\n   * special _internal_ 'on:begin' callback for modes with `beginKeywords`\n   * @param {RegExpMatchArray} match\n   * @param {CallbackResponse} response\n   */\n  function skipIfhasPrecedingOrTrailingDot(match, response) {\n    const before = match.input[match.index - 1];\n    const after = match.input[match.index + match[0].length];\n    if (before === \".\" || after === \".\") {\n      response.ignoreMatch();\n    }\n  }\n\n  /** skip vs abort vs ignore\n   *\n   * @skip   - The mode is still entered and exited normally (and contains rules apply),\n   *           but all content is held and added to the parent buffer rather than being\n   *           output when the mode ends.  Mostly used with `sublanguage` to build up\n   *           a single large buffer than can be parsed by sublanguage.\n   *\n   *             - The mode begin ands ends normally.\n   *             - Content matched is added to the parent mode buffer.\n   *             - The parser cursor is moved forward normally.\n   *\n   * @abort  - A hack placeholder until we have ignore.  Aborts the mode (as if it\n   *           never matched) but DOES NOT continue to match subsequent `contains`\n   *           modes.  Abort is bad/suboptimal because it can result in modes\n   *           farther down not getting applied because an earlier rule eats the\n   *           content but then aborts.\n   *\n   *             - The mode does not begin.\n   *             - Content matched by `begin` is added to the mode buffer.\n   *             - The parser cursor is moved forward accordingly.\n   *\n   * @ignore - Ignores the mode (as if it never matched) and continues to match any\n   *           subsequent `contains` modes.  Ignore isn't technically possible with\n   *           the current parser implementation.\n   *\n   *             - The mode does not begin.\n   *             - Content matched by `begin` is ignored.\n   *             - The parser cursor is not moved forward.\n   */\n\n  /**\n   * Compiles an individual mode\n   *\n   * This can raise an error if the mode contains certain detectable known logic\n   * issues.\n   * @param {Mode} mode\n   * @param {CompiledMode | null} [parent]\n   * @returns {CompiledMode | never}\n   */\n  function compileMode(mode, parent) {\n    const cmode = /** @type CompiledMode */ (mode);\n    if (mode.compiled) return cmode;\n    mode.compiled = true;\n\n    // __beforeBegin is considered private API, internal use only\n    mode.__beforeBegin = null;\n\n    mode.keywords = mode.keywords || mode.beginKeywords;\n\n    let keywordPattern = null;\n    if (typeof mode.keywords === \"object\") {\n      keywordPattern = mode.keywords.$pattern;\n      delete mode.keywords.$pattern;\n    }\n\n    if (mode.keywords) {\n      mode.keywords = compileKeywords(mode.keywords, language.case_insensitive);\n    }\n\n    // both are not allowed\n    if (mode.lexemes && keywordPattern) {\n      throw new Error(\"ERR: Prefer `keywords.$pattern` to `mode.lexemes`, BOTH are not allowed. (see mode reference) \");\n    }\n\n    // `mode.lexemes` was the old standard before we added and now recommend\n    // using `keywords.$pattern` to pass the keyword pattern\n    cmode.keywordPatternRe = langRe(mode.lexemes || keywordPattern || /\\w+/, true);\n\n    if (parent) {\n      if (mode.beginKeywords) {\n        // for languages with keywords that include non-word characters checking for\n        // a word boundary is not sufficient, so instead we check for a word boundary\n        // or whitespace - this does no harm in any case since our keyword engine\n        // doesn't allow spaces in keywords anyways and we still check for the boundary\n        // first\n        mode.begin = '\\\\b(' + mode.beginKeywords.split(' ').join('|') + ')(?=\\\\b|\\\\s)';\n        mode.__beforeBegin = skipIfhasPrecedingOrTrailingDot;\n      }\n      if (!mode.begin) mode.begin = /\\B|\\b/;\n      cmode.beginRe = langRe(mode.begin);\n      if (mode.endSameAsBegin) mode.end = mode.begin;\n      if (!mode.end && !mode.endsWithParent) mode.end = /\\B|\\b/;\n      if (mode.end) cmode.endRe = langRe(mode.end);\n      cmode.terminator_end = source(mode.end) || '';\n      if (mode.endsWithParent && parent.terminator_end) {\n        cmode.terminator_end += (mode.end ? '|' : '') + parent.terminator_end;\n      }\n    }\n    if (mode.illegal) cmode.illegalRe = langRe(mode.illegal);\n    // eslint-disable-next-line no-undefined\n    if (mode.relevance === undefined) mode.relevance = 1;\n    if (!mode.contains) mode.contains = [];\n\n    mode.contains = [].concat(...mode.contains.map(function(c) {\n      return expandOrCloneMode(c === 'self' ? mode : c);\n    }));\n    mode.contains.forEach(function(c) { compileMode(/** @type Mode */ (c), cmode); });\n\n    if (mode.starts) {\n      compileMode(mode.starts, parent);\n    }\n\n    cmode.matcher = buildModeRegex(cmode);\n    return cmode;\n  }\n\n  // self is not valid at the top-level\n  if (language.contains && language.contains.includes('self')) {\n    throw new Error(\"ERR: contains `self` is not supported at the top-level of a language.  See documentation.\");\n  }\n  return compileMode(/** @type Mode */ (language));\n}\n\n/**\n * Determines if a mode has a dependency on it's parent or not\n *\n * If a mode does have a parent dependency then often we need to clone it if\n * it's used in multiple places so that each copy points to the correct parent,\n * where-as modes without a parent can often safely be re-used at the bottom of\n * a mode chain.\n *\n * @param {Mode | null} mode\n * @returns {boolean} - is there a dependency on the parent?\n * */\nfunction dependencyOnParent(mode) {\n  if (!mode) return false;\n\n  return mode.endsWithParent || dependencyOnParent(mode.starts);\n}\n\n/**\n * Expands a mode or clones it if necessary\n *\n * This is necessary for modes with parental dependenceis (see notes on\n * `dependencyOnParent`) and for nodes that have `variants` - which must then be\n * exploded into their own individual modes at compile time.\n *\n * @param {Mode} mode\n * @returns {Mode | Mode[]}\n * */\nfunction expandOrCloneMode(mode) {\n  if (mode.variants && !mode.cached_variants) {\n    mode.cached_variants = mode.variants.map(function(variant) {\n      return inherit(mode, { variants: null }, variant);\n    });\n  }\n\n  // EXPAND\n  // if we have variants then essentially \"replace\" the mode with the variants\n  // this happens in compileMode, where this function is called from\n  if (mode.cached_variants) {\n    return mode.cached_variants;\n  }\n\n  // CLONE\n  // if we have dependencies on parents then we need a unique\n  // instance of ourselves, so we can be reused with many\n  // different parents without issue\n  if (dependencyOnParent(mode)) {\n    return inherit(mode, { starts: mode.starts ? inherit(mode.starts) : null });\n  }\n\n  if (Object.isFrozen(mode)) {\n    return inherit(mode);\n  }\n\n  // no special dependency issues, just return ourselves\n  return mode;\n}\n\n/***********************************************\n  Keywords\n***********************************************/\n\n/**\n * Given raw keywords from a language definition, compile them.\n *\n * @param {string | Record<string,string>} rawKeywords\n * @param {boolean} caseInsensitive\n */\nfunction compileKeywords(rawKeywords, caseInsensitive) {\n  /** @type KeywordDict */\n  var compiledKeywords = {};\n\n  if (typeof rawKeywords === 'string') { // string\n    splitAndCompile('keyword', rawKeywords);\n  } else {\n    Object.keys(rawKeywords).forEach(function(className) {\n      splitAndCompile(className, rawKeywords[className]);\n    });\n  }\n  return compiledKeywords;\n\n  // ---\n\n  /**\n   * Compiles an individual list of keywords\n   *\n   * Ex: \"for if when while|5\"\n   *\n   * @param {string} className\n   * @param {string} keywordList\n   */\n  function splitAndCompile(className, keywordList) {\n    if (caseInsensitive) {\n      keywordList = keywordList.toLowerCase();\n    }\n    keywordList.split(' ').forEach(function(keyword) {\n      var pair = keyword.split('|');\n      compiledKeywords[pair[0]] = [className, scoreForKeyword(pair[0], pair[1])];\n    });\n  }\n}\n\n/**\n * Returns the proper score for a given keyword\n *\n * Also takes into account comment keywords, which will be scored 0 UNLESS\n * another score has been manually assigned.\n * @param {string} keyword\n * @param {string} [providedScore]\n */\nfunction scoreForKeyword(keyword, providedScore) {\n  // manual scores always win over common keywords\n  // so you can force a score of 1 if you really insist\n  if (providedScore) {\n    return Number(providedScore);\n  }\n\n  return commonKeyword(keyword) ? 0 : 1;\n}\n\n/**\n * Determines if a given keyword is common or not\n *\n * @param {string} keyword */\nfunction commonKeyword(keyword) {\n  return COMMON_KEYWORDS.includes(keyword.toLowerCase());\n}\n\nvar version = \"10.3.2\";\n\n// @ts-nocheck\n\nfunction hasValueOrEmptyAttribute(value) {\n  return Boolean(value || value === \"\");\n}\n\nconst Component = {\n  props: [\"language\", \"code\", \"autodetect\"],\n  data: function() {\n    return {\n      detectedLanguage: \"\",\n      unknownLanguage: false\n    };\n  },\n  computed: {\n    className() {\n      if (this.unknownLanguage) return \"\";\n\n      return \"hljs \" + this.detectedLanguage;\n    },\n    highlighted() {\n      // no idea what language to use, return raw code\n      if (!this.autoDetect && !hljs.getLanguage(this.language)) {\n        console.warn(`The language \"${this.language}\" you specified could not be found.`);\n        this.unknownLanguage = true;\n        return escapeHTML(this.code);\n      }\n\n      let result;\n      if (this.autoDetect) {\n        result = hljs.highlightAuto(this.code);\n        this.detectedLanguage = result.language;\n      } else {\n        result = hljs.highlight(this.language, this.code, this.ignoreIllegals);\n        this.detectectLanguage = this.language;\n      }\n      return result.value;\n    },\n    autoDetect() {\n      return !this.language || hasValueOrEmptyAttribute(this.autodetect);\n    },\n    ignoreIllegals() {\n      return true;\n    }\n  },\n  // this avoids needing to use a whole Vue compilation pipeline just\n  // to build Highlight.js\n  render(createElement) {\n    return createElement(\"pre\", {}, [\n      createElement(\"code\", {\n        class: this.className,\n        domProps: { innerHTML: this.highlighted }})\n    ]);\n  }\n  // template: `<pre><code :class=\"className\" v-html=\"highlighted\"></code></pre>`\n};\n\nconst VuePlugin = {\n  install(Vue) {\n    Vue.component('highlightjs', Component);\n  }\n};\n\n/*\nSyntax highlighting with language autodetection.\nhttps://highlightjs.org/\n*/\n\nconst escape$1 = escapeHTML;\nconst inherit$1 = inherit;\n\nconst { nodeStream: nodeStream$1, mergeStreams: mergeStreams$1 } = utils;\nconst NO_MATCH = Symbol(\"nomatch\");\n\n/**\n * @param {any} hljs - object that is extended (legacy)\n * @returns {HLJSApi}\n */\nconst HLJS = function(hljs) {\n  // Convenience variables for build-in objects\n  /** @type {unknown[]} */\n  var ArrayProto = [];\n\n  // Global internal variables used within the highlight.js library.\n  /** @type {Record<string, Language>} */\n  var languages = Object.create(null);\n  /** @type {Record<string, string>} */\n  var aliases = Object.create(null);\n  /** @type {HLJSPlugin[]} */\n  var plugins = [];\n\n  // safe/production mode - swallows more errors, tries to keep running\n  // even if a single syntax or parse hits a fatal error\n  var SAFE_MODE = true;\n  var fixMarkupRe = /(^(<[^>]+>|\\t|)+|\\n)/gm;\n  var LANGUAGE_NOT_FOUND = \"Could not find the language '{}', did you forget to load/include a language module?\";\n  /** @type {Language} */\n  const PLAINTEXT_LANGUAGE = { disableAutodetect: true, name: 'Plain text', contains: [] };\n\n  // Global options used when within external APIs. This is modified when\n  // calling the `hljs.configure` function.\n  /** @type HLJSOptions */\n  var options = {\n    noHighlightRe: /^(no-?highlight)$/i,\n    languageDetectRe: /\\blang(?:uage)?-([\\w-]+)\\b/i,\n    classPrefix: 'hljs-',\n    tabReplace: null,\n    useBR: false,\n    languages: null,\n    // beta configuration options, subject to change, welcome to discuss\n    // https://github.com/highlightjs/highlight.js/issues/1086\n    __emitter: TokenTreeEmitter\n  };\n\n  /* Utility functions */\n\n  /**\n   * Tests a language name to see if highlighting should be skipped\n   * @param {string} languageName\n   */\n  function shouldNotHighlight(languageName) {\n    return options.noHighlightRe.test(languageName);\n  }\n\n  /**\n   * @param {HighlightedHTMLElement} block - the HTML element to determine language for\n   */\n  function blockLanguage(block) {\n    var classes = block.className + ' ';\n\n    classes += block.parentNode ? block.parentNode.className : '';\n\n    // language-* takes precedence over non-prefixed class names.\n    const match = options.languageDetectRe.exec(classes);\n    if (match) {\n      var language = getLanguage(match[1]);\n      if (!language) {\n        console.warn(LANGUAGE_NOT_FOUND.replace(\"{}\", match[1]));\n        console.warn(\"Falling back to no-highlight mode for this block.\", block);\n      }\n      return language ? match[1] : 'no-highlight';\n    }\n\n    return classes\n      .split(/\\s+/)\n      .find((_class) => shouldNotHighlight(_class) || getLanguage(_class));\n  }\n\n  /**\n   * Core highlighting function.\n   *\n   * @param {string} languageName - the language to use for highlighting\n   * @param {string} code - the code to highlight\n   * @param {boolean} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n   * @param {Mode} [continuation] - current continuation mode, if any\n   *\n   * @returns {HighlightResult} Result - an object that represents the result\n   * @property {string} language - the language name\n   * @property {number} relevance - the relevance score\n   * @property {string} value - the highlighted HTML code\n   * @property {string} code - the original raw code\n   * @property {Mode} top - top of the current mode stack\n   * @property {boolean} illegal - indicates whether any illegal matches were found\n  */\n  function highlight(languageName, code, ignoreIllegals, continuation) {\n    /** @type {{ code: string, language: string, result?: any }} */\n    var context = {\n      code,\n      language: languageName\n    };\n    // the plugin can change the desired language or the code to be highlighted\n    // just be changing the object it was passed\n    fire(\"before:highlight\", context);\n\n    // a before plugin can usurp the result completely by providing it's own\n    // in which case we don't even need to call highlight\n    var result = context.result ?\n      context.result :\n      _highlight(context.language, context.code, ignoreIllegals, continuation);\n\n    result.code = context.code;\n    // the plugin can change anything in result to suite it\n    fire(\"after:highlight\", result);\n\n    return result;\n  }\n\n  /**\n   * private highlight that's used internally and does not fire callbacks\n   *\n   * @param {string} languageName - the language to use for highlighting\n   * @param {string} code - the code to highlight\n   * @param {boolean} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n   * @param {Mode} [continuation] - current continuation mode, if any\n  */\n  function _highlight(languageName, code, ignoreIllegals, continuation) {\n    var codeToHighlight = code;\n\n    /**\n     * Return keyword data if a match is a keyword\n     * @param {CompiledMode} mode - current mode\n     * @param {RegExpMatchArray} match - regexp match data\n     * @returns {KeywordData | false}\n     */\n    function keywordData(mode, match) {\n      var matchText = language.case_insensitive ? match[0].toLowerCase() : match[0];\n      return Object.prototype.hasOwnProperty.call(mode.keywords, matchText) && mode.keywords[matchText];\n    }\n\n    function processKeywords() {\n      if (!top.keywords) {\n        emitter.addText(modeBuffer);\n        return;\n      }\n\n      let lastIndex = 0;\n      top.keywordPatternRe.lastIndex = 0;\n      let match = top.keywordPatternRe.exec(modeBuffer);\n      let buf = \"\";\n\n      while (match) {\n        buf += modeBuffer.substring(lastIndex, match.index);\n        const data = keywordData(top, match);\n        if (data) {\n          const [kind, keywordRelevance] = data;\n          emitter.addText(buf);\n          buf = \"\";\n\n          relevance += keywordRelevance;\n          emitter.addKeyword(match[0], kind);\n        } else {\n          buf += match[0];\n        }\n        lastIndex = top.keywordPatternRe.lastIndex;\n        match = top.keywordPatternRe.exec(modeBuffer);\n      }\n      buf += modeBuffer.substr(lastIndex);\n      emitter.addText(buf);\n    }\n\n    function processSubLanguage() {\n      if (modeBuffer === \"\") return;\n      /** @type HighlightResult */\n      var result = null;\n\n      if (typeof top.subLanguage === 'string') {\n        if (!languages[top.subLanguage]) {\n          emitter.addText(modeBuffer);\n          return;\n        }\n        result = _highlight(top.subLanguage, modeBuffer, true, continuations[top.subLanguage]);\n        continuations[top.subLanguage] = result.top;\n      } else {\n        result = highlightAuto(modeBuffer, top.subLanguage.length ? top.subLanguage : null);\n      }\n\n      // Counting embedded language score towards the host language may be disabled\n      // with zeroing the containing mode relevance. Use case in point is Markdown that\n      // allows XML everywhere and makes every XML snippet to have a much larger Markdown\n      // score.\n      if (top.relevance > 0) {\n        relevance += result.relevance;\n      }\n      emitter.addSublanguage(result.emitter, result.language);\n    }\n\n    function processBuffer() {\n      if (top.subLanguage != null) {\n        processSubLanguage();\n      } else {\n        processKeywords();\n      }\n      modeBuffer = '';\n    }\n\n    /**\n     * @param {Mode} mode - new mode to start\n     */\n    function startNewMode(mode) {\n      if (mode.className) {\n        emitter.openNode(mode.className);\n      }\n      top = Object.create(mode, { parent: { value: top } });\n      return top;\n    }\n\n    /**\n     * @param {CompiledMode } mode - the mode to potentially end\n     * @param {RegExpMatchArray} match - the latest match\n     * @param {string} matchPlusRemainder - match plus remainder of content\n     * @returns {CompiledMode | void} - the next mode, or if void continue on in current mode\n     */\n    function endOfMode(mode, match, matchPlusRemainder) {\n      let matched = startsWith(mode.endRe, matchPlusRemainder);\n\n      if (matched) {\n        if (mode[\"on:end\"]) {\n          const resp = new Response(mode);\n          mode[\"on:end\"](match, resp);\n          if (resp.ignore) matched = false;\n        }\n\n        if (matched) {\n          while (mode.endsParent && mode.parent) {\n            mode = mode.parent;\n          }\n          return mode;\n        }\n      }\n      // even if on:end fires an `ignore` it's still possible\n      // that we might trigger the end node because of a parent mode\n      if (mode.endsWithParent) {\n        return endOfMode(mode.parent, match, matchPlusRemainder);\n      }\n    }\n\n    /**\n     * Handle matching but then ignoring a sequence of text\n     *\n     * @param {string} lexeme - string containing full match text\n     */\n    function doIgnore(lexeme) {\n      if (top.matcher.regexIndex === 0) {\n        // no more regexs to potentially match here, so we move the cursor forward one\n        // space\n        modeBuffer += lexeme[0];\n        return 1;\n      } else {\n        // no need to move the cursor, we still have additional regexes to try and\n        // match at this very spot\n        resumeScanAtSamePosition = true;\n        return 0;\n      }\n    }\n\n    /**\n     * Handle the start of a new potential mode match\n     *\n     * @param {EnhancedMatch} match - the current match\n     * @returns {number} how far to advance the parse cursor\n     */\n    function doBeginMatch(match) {\n      var lexeme = match[0];\n      var newMode = match.rule;\n\n      const resp = new Response(newMode);\n      // first internal before callbacks, then the public ones\n      const beforeCallbacks = [newMode.__beforeBegin, newMode[\"on:begin\"]];\n      for (const cb of beforeCallbacks) {\n        if (!cb) continue;\n        cb(match, resp);\n        if (resp.ignore) return doIgnore(lexeme);\n      }\n\n      if (newMode && newMode.endSameAsBegin) {\n        newMode.endRe = escape(lexeme);\n      }\n\n      if (newMode.skip) {\n        modeBuffer += lexeme;\n      } else {\n        if (newMode.excludeBegin) {\n          modeBuffer += lexeme;\n        }\n        processBuffer();\n        if (!newMode.returnBegin && !newMode.excludeBegin) {\n          modeBuffer = lexeme;\n        }\n      }\n      startNewMode(newMode);\n      // if (mode[\"after:begin\"]) {\n      //   let resp = new Response(mode);\n      //   mode[\"after:begin\"](match, resp);\n      // }\n      return newMode.returnBegin ? 0 : lexeme.length;\n    }\n\n    /**\n     * Handle the potential end of mode\n     *\n     * @param {RegExpMatchArray} match - the current match\n     */\n    function doEndMatch(match) {\n      var lexeme = match[0];\n      var matchPlusRemainder = codeToHighlight.substr(match.index);\n\n      var endMode = endOfMode(top, match, matchPlusRemainder);\n      if (!endMode) { return NO_MATCH; }\n\n      var origin = top;\n      if (origin.skip) {\n        modeBuffer += lexeme;\n      } else {\n        if (!(origin.returnEnd || origin.excludeEnd)) {\n          modeBuffer += lexeme;\n        }\n        processBuffer();\n        if (origin.excludeEnd) {\n          modeBuffer = lexeme;\n        }\n      }\n      do {\n        if (top.className) {\n          emitter.closeNode();\n        }\n        if (!top.skip && !top.subLanguage) {\n          relevance += top.relevance;\n        }\n        top = top.parent;\n      } while (top !== endMode.parent);\n      if (endMode.starts) {\n        if (endMode.endSameAsBegin) {\n          endMode.starts.endRe = endMode.endRe;\n        }\n        startNewMode(endMode.starts);\n      }\n      return origin.returnEnd ? 0 : lexeme.length;\n    }\n\n    function processContinuations() {\n      var list = [];\n      for (var current = top; current !== language; current = current.parent) {\n        if (current.className) {\n          list.unshift(current.className);\n        }\n      }\n      list.forEach(item => emitter.openNode(item));\n    }\n\n    /** @type {{type?: MatchType, index?: number, rule?: Mode}}} */\n    var lastMatch = {};\n\n    /**\n     *  Process an individual match\n     *\n     * @param {string} textBeforeMatch - text preceeding the match (since the last match)\n     * @param {EnhancedMatch} [match] - the match itself\n     */\n    function processLexeme(textBeforeMatch, match) {\n      var lexeme = match && match[0];\n\n      // add non-matched text to the current mode buffer\n      modeBuffer += textBeforeMatch;\n\n      if (lexeme == null) {\n        processBuffer();\n        return 0;\n      }\n\n      // we've found a 0 width match and we're stuck, so we need to advance\n      // this happens when we have badly behaved rules that have optional matchers to the degree that\n      // sometimes they can end up matching nothing at all\n      // Ref: https://github.com/highlightjs/highlight.js/issues/2140\n      if (lastMatch.type === \"begin\" && match.type === \"end\" && lastMatch.index === match.index && lexeme === \"\") {\n        // spit the \"skipped\" character that our regex choked on back into the output sequence\n        modeBuffer += codeToHighlight.slice(match.index, match.index + 1);\n        if (!SAFE_MODE) {\n          /** @type {AnnotatedError} */\n          const err = new Error('0 width match regex');\n          err.languageName = languageName;\n          err.badRule = lastMatch.rule;\n          throw err;\n        }\n        return 1;\n      }\n      lastMatch = match;\n\n      if (match.type === \"begin\") {\n        return doBeginMatch(match);\n      } else if (match.type === \"illegal\" && !ignoreIllegals) {\n        // illegal match, we do not continue processing\n        /** @type {AnnotatedError} */\n        const err = new Error('Illegal lexeme \"' + lexeme + '\" for mode \"' + (top.className || '<unnamed>') + '\"');\n        err.mode = top;\n        throw err;\n      } else if (match.type === \"end\") {\n        var processed = doEndMatch(match);\n        if (processed !== NO_MATCH) {\n          return processed;\n        }\n      }\n\n      // edge case for when illegal matches $ (end of line) which is technically\n      // a 0 width match but not a begin/end match so it's not caught by the\n      // first handler (when ignoreIllegals is true)\n      if (match.type === \"illegal\" && lexeme === \"\") {\n        // advance so we aren't stuck in an infinite loop\n        return 1;\n      }\n\n      // infinite loops are BAD, this is a last ditch catch all. if we have a\n      // decent number of iterations yet our index (cursor position in our\n      // parsing) still 3x behind our index then something is very wrong\n      // so we bail\n      if (iterations > 100000 && iterations > match.index * 3) {\n        const err = new Error('potential infinite loop, way more iterations than matches');\n        throw err;\n      }\n\n      /*\n      Why might be find ourselves here?  Only one occasion now.  An end match that was\n      triggered but could not be completed.  When might this happen?  When an `endSameasBegin`\n      rule sets the end rule to a specific match.  Since the overall mode termination rule that's\n      being used to scan the text isn't recompiled that means that any match that LOOKS like\n      the end (but is not, because it is not an exact match to the beginning) will\n      end up here.  A definite end match, but when `doEndMatch` tries to \"reapply\"\n      the end rule and fails to match, we wind up here, and just silently ignore the end.\n\n      This causes no real harm other than stopping a few times too many.\n      */\n\n      modeBuffer += lexeme;\n      return lexeme.length;\n    }\n\n    var language = getLanguage(languageName);\n    if (!language) {\n      console.error(LANGUAGE_NOT_FOUND.replace(\"{}\", languageName));\n      throw new Error('Unknown language: \"' + languageName + '\"');\n    }\n\n    var md = compileLanguage(language);\n    var result = '';\n    /** @type {CompiledMode} */\n    var top = continuation || md;\n    /** @type Record<string,Mode> */\n    var continuations = {}; // keep continuations for sub-languages\n    var emitter = new options.__emitter(options);\n    processContinuations();\n    var modeBuffer = '';\n    var relevance = 0;\n    var index = 0;\n    var iterations = 0;\n    var resumeScanAtSamePosition = false;\n\n    try {\n      top.matcher.considerAll();\n\n      for (;;) {\n        iterations++;\n        if (resumeScanAtSamePosition) {\n          // only regexes not matched previously will now be\n          // considered for a potential match\n          resumeScanAtSamePosition = false;\n        } else {\n          top.matcher.considerAll();\n        }\n        top.matcher.lastIndex = index;\n\n        const match = top.matcher.exec(codeToHighlight);\n        // console.log(\"match\", match[0], match.rule && match.rule.begin)\n\n        if (!match) break;\n\n        const beforeMatch = codeToHighlight.substring(index, match.index);\n        const processedCount = processLexeme(beforeMatch, match);\n        index = match.index + processedCount;\n      }\n      processLexeme(codeToHighlight.substr(index));\n      emitter.closeAllNodes();\n      emitter.finalize();\n      result = emitter.toHTML();\n\n      return {\n        relevance: relevance,\n        value: result,\n        language: languageName,\n        illegal: false,\n        emitter: emitter,\n        top: top\n      };\n    } catch (err) {\n      if (err.message && err.message.includes('Illegal')) {\n        return {\n          illegal: true,\n          illegalBy: {\n            msg: err.message,\n            context: codeToHighlight.slice(index - 100, index + 100),\n            mode: err.mode\n          },\n          sofar: result,\n          relevance: 0,\n          value: escape$1(codeToHighlight),\n          emitter: emitter\n        };\n      } else if (SAFE_MODE) {\n        return {\n          illegal: false,\n          relevance: 0,\n          value: escape$1(codeToHighlight),\n          emitter: emitter,\n          language: languageName,\n          top: top,\n          errorRaised: err\n        };\n      } else {\n        throw err;\n      }\n    }\n  }\n\n  /**\n   * returns a valid highlight result, without actually doing any actual work,\n   * auto highlight starts with this and it's possible for small snippets that\n   * auto-detection may not find a better match\n   * @param {string} code\n   * @returns {HighlightResult}\n   */\n  function justTextHighlightResult(code) {\n    const result = {\n      relevance: 0,\n      emitter: new options.__emitter(options),\n      value: escape$1(code),\n      illegal: false,\n      top: PLAINTEXT_LANGUAGE\n    };\n    result.emitter.addText(code);\n    return result;\n  }\n\n  /**\n  Highlighting with language detection. Accepts a string with the code to\n  highlight. Returns an object with the following properties:\n\n  - language (detected language)\n  - relevance (int)\n  - value (an HTML string with highlighting markup)\n  - second_best (object with the same structure for second-best heuristically\n    detected language, may be absent)\n\n    @param {string} code\n    @param {Array<string>} [languageSubset]\n    @returns {AutoHighlightResult}\n  */\n  function highlightAuto(code, languageSubset) {\n    languageSubset = languageSubset || options.languages || Object.keys(languages);\n    var result = justTextHighlightResult(code);\n    var secondBest = result;\n    languageSubset.filter(getLanguage).filter(autoDetection).forEach(function(name) {\n      var current = _highlight(name, code, false);\n      current.language = name;\n      if (current.relevance > secondBest.relevance) {\n        secondBest = current;\n      }\n      if (current.relevance > result.relevance) {\n        secondBest = result;\n        result = current;\n      }\n    });\n    if (secondBest.language) {\n      // second_best (with underscore) is the expected API\n      result.second_best = secondBest;\n    }\n    return result;\n  }\n\n  /**\n  Post-processing of the highlighted markup:\n\n  - replace TABs with something more useful\n  - replace real line-breaks with '<br>' for non-pre containers\n\n    @param {string} html\n    @returns {string}\n  */\n  function fixMarkup(html) {\n    if (!(options.tabReplace || options.useBR)) {\n      return html;\n    }\n\n    return html.replace(fixMarkupRe, match => {\n      if (match === '\\n') {\n        return options.useBR ? '<br>' : match;\n      } else if (options.tabReplace) {\n        return match.replace(/\\t/g, options.tabReplace);\n      }\n      return match;\n    });\n  }\n\n  /**\n   * Builds new class name for block given the language name\n   *\n   * @param {string} prevClassName\n   * @param {string} [currentLang]\n   * @param {string} [resultLang]\n   */\n  function buildClassName(prevClassName, currentLang, resultLang) {\n    var language = currentLang ? aliases[currentLang] : resultLang;\n    var result = [prevClassName.trim()];\n\n    if (!prevClassName.match(/\\bhljs\\b/)) {\n      result.push('hljs');\n    }\n\n    if (!prevClassName.includes(language)) {\n      result.push(language);\n    }\n\n    return result.join(' ').trim();\n  }\n\n  /**\n   * Applies highlighting to a DOM node containing code. Accepts a DOM node and\n   * two optional parameters for fixMarkup.\n   *\n   * @param {HighlightedHTMLElement} element - the HTML element to highlight\n  */\n  function highlightBlock(element) {\n    /** @type HTMLElement */\n    let node = null;\n    const language = blockLanguage(element);\n\n    if (shouldNotHighlight(language)) return;\n\n    fire(\"before:highlightBlock\",\n      { block: element, language: language });\n\n    if (options.useBR) {\n      node = document.createElement('div');\n      node.innerHTML = element.innerHTML.replace(/\\n/g, '').replace(/<br[ /]*>/g, '\\n');\n    } else {\n      node = element;\n    }\n    const text = node.textContent;\n    const result = language ? highlight(language, text, true) : highlightAuto(text);\n\n    const originalStream = nodeStream$1(node);\n    if (originalStream.length) {\n      const resultNode = document.createElement('div');\n      resultNode.innerHTML = result.value;\n      result.value = mergeStreams$1(originalStream, nodeStream$1(resultNode), text);\n    }\n    result.value = fixMarkup(result.value);\n\n    fire(\"after:highlightBlock\", { block: element, result: result });\n\n    element.innerHTML = result.value;\n    element.className = buildClassName(element.className, language, result.language);\n    element.result = {\n      language: result.language,\n      // TODO: remove with version 11.0\n      re: result.relevance,\n      relavance: result.relevance\n    };\n    if (result.second_best) {\n      element.second_best = {\n        language: result.second_best.language,\n        // TODO: remove with version 11.0\n        re: result.second_best.relevance,\n        relavance: result.second_best.relevance\n      };\n    }\n  }\n\n  /**\n   * Updates highlight.js global options with the passed options\n   *\n   * @param {{}} userOptions\n   */\n  function configure(userOptions) {\n    if (userOptions.useBR) {\n      console.warn(\"'useBR' option is deprecated and will be removed entirely in v11.0\");\n      console.warn(\"Please see https://github.com/highlightjs/highlight.js/issues/2559\");\n    }\n    options = inherit$1(options, userOptions);\n  }\n\n  /**\n   * Highlights to all <pre><code> blocks on a page\n   *\n   * @type {Function & {called?: boolean}}\n   */\n  const initHighlighting = () => {\n    if (initHighlighting.called) return;\n    initHighlighting.called = true;\n\n    var blocks = document.querySelectorAll('pre code');\n    ArrayProto.forEach.call(blocks, highlightBlock);\n  };\n\n  // Higlights all when DOMContentLoaded fires\n  function initHighlightingOnLoad() {\n    // @ts-ignore\n    window.addEventListener('DOMContentLoaded', initHighlighting, false);\n  }\n\n  /**\n   * Register a language grammar module\n   *\n   * @param {string} languageName\n   * @param {LanguageFn} languageDefinition\n   */\n  function registerLanguage(languageName, languageDefinition) {\n    var lang = null;\n    try {\n      lang = languageDefinition(hljs);\n    } catch (error) {\n      console.error(\"Language definition for '{}' could not be registered.\".replace(\"{}\", languageName));\n      // hard or soft error\n      if (!SAFE_MODE) { throw error; } else { console.error(error); }\n      // languages that have serious errors are replaced with essentially a\n      // \"plaintext\" stand-in so that the code blocks will still get normal\n      // css classes applied to them - and one bad language won't break the\n      // entire highlighter\n      lang = PLAINTEXT_LANGUAGE;\n    }\n    // give it a temporary name if it doesn't have one in the meta-data\n    if (!lang.name) lang.name = languageName;\n    languages[languageName] = lang;\n    lang.rawDefinition = languageDefinition.bind(null, hljs);\n\n    if (lang.aliases) {\n      registerAliases(lang.aliases, { languageName });\n    }\n  }\n\n  /**\n   * @returns {string[]} List of language internal names\n   */\n  function listLanguages() {\n    return Object.keys(languages);\n  }\n\n  /**\n    intended usage: When one language truly requires another\n\n    Unlike `getLanguage`, this will throw when the requested language\n    is not available.\n\n    @param {string} name - name of the language to fetch/require\n    @returns {Language | never}\n  */\n  function requireLanguage(name) {\n    var lang = getLanguage(name);\n    if (lang) { return lang; }\n\n    var err = new Error('The \\'{}\\' language is required, but not loaded.'.replace('{}', name));\n    throw err;\n  }\n\n  /**\n   * @param {string} name - name of the language to retrieve\n   * @returns {Language | undefined}\n   */\n  function getLanguage(name) {\n    name = (name || '').toLowerCase();\n    return languages[name] || languages[aliases[name]];\n  }\n\n  /**\n   *\n   * @param {string|string[]} aliasList - single alias or list of aliases\n   * @param {{languageName: string}} opts\n   */\n  function registerAliases(aliasList, { languageName }) {\n    if (typeof aliasList === 'string') {\n      aliasList = [aliasList];\n    }\n    aliasList.forEach(alias => { aliases[alias] = languageName; });\n  }\n\n  /**\n   * Determines if a given language has auto-detection enabled\n   * @param {string} name - name of the language\n   */\n  function autoDetection(name) {\n    var lang = getLanguage(name);\n    return lang && !lang.disableAutodetect;\n  }\n\n  /**\n   * @param {HLJSPlugin} plugin\n   */\n  function addPlugin(plugin) {\n    plugins.push(plugin);\n  }\n\n  /**\n   *\n   * @param {PluginEvent} event\n   * @param {any} args\n   */\n  function fire(event, args) {\n    var cb = event;\n    plugins.forEach(function(plugin) {\n      if (plugin[cb]) {\n        plugin[cb](args);\n      }\n    });\n  }\n\n  /**\n  Note: fixMarkup is deprecated and will be removed entirely in v11\n\n  @param {string} arg\n  @returns {string}\n  */\n  function deprecateFixMarkup(arg) {\n    console.warn(\"fixMarkup is deprecated and will be removed entirely in v11.0\");\n    console.warn(\"Please see https://github.com/highlightjs/highlight.js/issues/2534\");\n\n    return fixMarkup(arg);\n  }\n\n  /* Interface definition */\n  Object.assign(hljs, {\n    highlight,\n    highlightAuto,\n    fixMarkup: deprecateFixMarkup,\n    highlightBlock,\n    configure,\n    initHighlighting,\n    initHighlightingOnLoad,\n    registerLanguage,\n    listLanguages,\n    getLanguage,\n    registerAliases,\n    requireLanguage,\n    autoDetection,\n    inherit: inherit$1,\n    addPlugin,\n    // plugins for frameworks\n    vuePlugin: VuePlugin\n  });\n\n  hljs.debugMode = function() { SAFE_MODE = false; };\n  hljs.safeMode = function() { SAFE_MODE = true; };\n  hljs.versionString = version;\n\n  for (const key in MODES) {\n    // @ts-ignore\n    if (typeof MODES[key] === \"object\") {\n      // @ts-ignore\n      deepFreeze(MODES[key]);\n    }\n  }\n\n  // merge all the modes/regexs into our main object\n  Object.assign(hljs, MODES);\n\n  return hljs;\n};\n\n// export an \"instance\" of the highlighter\nvar highlight = HLJS({});\n\nmodule.exports = highlight;\n","'use strict'\n\nvar formatter = require('format')\n\nvar fault = create(Error)\n\nmodule.exports = fault\n\nfault.eval = create(EvalError)\nfault.range = create(RangeError)\nfault.reference = create(ReferenceError)\nfault.syntax = create(SyntaxError)\nfault.type = create(TypeError)\nfault.uri = create(URIError)\n\nfault.create = create\n\n// Create a new `EConstructor`, with the formatted `format` as a first argument.\nfunction create(EConstructor) {\n  FormattedError.displayName = EConstructor.displayName || EConstructor.name\n\n  return FormattedError\n\n  function FormattedError(format) {\n    if (format) {\n      format = formatter.apply(null, arguments)\n    }\n\n    return new EConstructor(format)\n  }\n}\n","//\n// format - printf-like string formatting for JavaScript\n// github.com/samsonjs/format\n// @_sjs\n//\n// Copyright 2010 - 2013 Sami Samhuri <sami@samhuri.net>\n//\n// MIT License\n// http://sjs.mit-license.org\n//\n\n;(function() {\n\n  //// Export the API\n  var namespace;\n\n  // CommonJS / Node module\n  if (typeof module !== 'undefined') {\n    namespace = module.exports = format;\n  }\n\n  // Browsers and other environments\n  else {\n    // Get the global object. Works in ES3, ES5, and ES5 strict mode.\n    namespace = (function(){ return this || (1,eval)('this') }());\n  }\n\n  namespace.format = format;\n  namespace.vsprintf = vsprintf;\n\n  if (typeof console !== 'undefined' && typeof console.log === 'function') {\n    namespace.printf = printf;\n  }\n\n  function printf(/* ... */) {\n    console.log(format.apply(null, arguments));\n  }\n\n  function vsprintf(fmt, replacements) {\n    return format.apply(null, [fmt].concat(replacements));\n  }\n\n  function format(fmt) {\n    var argIndex = 1 // skip initial format argument\n      , args = [].slice.call(arguments)\n      , i = 0\n      , n = fmt.length\n      , result = ''\n      , c\n      , escaped = false\n      , arg\n      , tmp\n      , leadingZero = false\n      , precision\n      , nextArg = function() { return args[argIndex++]; }\n      , slurpNumber = function() {\n          var digits = '';\n          while (/\\d/.test(fmt[i])) {\n            digits += fmt[i++];\n            c = fmt[i];\n          }\n          return digits.length > 0 ? parseInt(digits) : null;\n        }\n      ;\n    for (; i < n; ++i) {\n      c = fmt[i];\n      if (escaped) {\n        escaped = false;\n        if (c == '.') {\n          leadingZero = false;\n          c = fmt[++i];\n        }\n        else if (c == '0' && fmt[i + 1] == '.') {\n          leadingZero = true;\n          i += 2;\n          c = fmt[i];\n        }\n        else {\n          leadingZero = true;\n        }\n        precision = slurpNumber();\n        switch (c) {\n        case 'b': // number in binary\n          result += parseInt(nextArg(), 10).toString(2);\n          break;\n        case 'c': // character\n          arg = nextArg();\n          if (typeof arg === 'string' || arg instanceof String)\n            result += arg;\n          else\n            result += String.fromCharCode(parseInt(arg, 10));\n          break;\n        case 'd': // number in decimal\n          result += parseInt(nextArg(), 10);\n          break;\n        case 'f': // floating point number\n          tmp = String(parseFloat(nextArg()).toFixed(precision || 6));\n          result += leadingZero ? tmp : tmp.replace(/^0/, '');\n          break;\n        case 'j': // JSON\n          result += JSON.stringify(nextArg());\n          break;\n        case 'o': // number in octal\n          result += '0' + parseInt(nextArg(), 10).toString(8);\n          break;\n        case 's': // string\n          result += nextArg();\n          break;\n        case 'x': // lowercase hexadecimal\n          result += '0x' + parseInt(nextArg(), 10).toString(16);\n          break;\n        case 'X': // uppercase hexadecimal\n          result += '0x' + parseInt(nextArg(), 10).toString(16).toUpperCase();\n          break;\n        default:\n          result += c;\n          break;\n        }\n      } else if (c === '%') {\n        escaped = true;\n      } else {\n        result += c;\n      }\n    }\n    return result;\n  }\n\n}());\n","// Main parser class\n\n'use strict';\n\n\nvar utils        = require('./common/utils');\nvar helpers      = require('./helpers');\nvar Renderer     = require('./renderer');\nvar ParserCore   = require('./parser_core');\nvar ParserBlock  = require('./parser_block');\nvar ParserInline = require('./parser_inline');\nvar LinkifyIt    = require('linkify-it');\nvar mdurl        = require('mdurl');\nvar punycode     = require('punycode');\n\n\nvar config = {\n  'default': require('./presets/default'),\n  zero: require('./presets/zero'),\n  commonmark: require('./presets/commonmark')\n};\n\n////////////////////////////////////////////////////////////////////////////////\n//\n// This validator can prohibit more than really needed to prevent XSS. It's a\n// tradeoff to keep code simple and to be secure by default.\n//\n// If you need different setup - override validator method as you wish. Or\n// replace it with dummy function and use external sanitizer.\n//\n\nvar BAD_PROTO_RE = /^(vbscript|javascript|file|data):/;\nvar GOOD_DATA_RE = /^data:image\\/(gif|png|jpeg|webp);/;\n\nfunction validateLink(url) {\n  // url should be normalized at this point, and existing entities are decoded\n  var str = url.trim().toLowerCase();\n\n  return BAD_PROTO_RE.test(str) ? (GOOD_DATA_RE.test(str) ? true : false) : true;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\n\nvar RECODE_HOSTNAME_FOR = [ 'http:', 'https:', 'mailto:' ];\n\nfunction normalizeLink(url) {\n  var parsed = mdurl.parse(url, true);\n\n  if (parsed.hostname) {\n    // Encode hostnames in urls like:\n    // `http://host/`, `https://host/`, `mailto:user@host`, `//host/`\n    //\n    // We don't encode unknown schemas, because it's likely that we encode\n    // something we shouldn't (e.g. `skype:name` treated as `skype:host`)\n    //\n    if (!parsed.protocol || RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0) {\n      try {\n        parsed.hostname = punycode.toASCII(parsed.hostname);\n      } catch (er) { /**/ }\n    }\n  }\n\n  return mdurl.encode(mdurl.format(parsed));\n}\n\nfunction normalizeLinkText(url) {\n  var parsed = mdurl.parse(url, true);\n\n  if (parsed.hostname) {\n    // Encode hostnames in urls like:\n    // `http://host/`, `https://host/`, `mailto:user@host`, `//host/`\n    //\n    // We don't encode unknown schemas, because it's likely that we encode\n    // something we shouldn't (e.g. `skype:name` treated as `skype:host`)\n    //\n    if (!parsed.protocol || RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0) {\n      try {\n        parsed.hostname = punycode.toUnicode(parsed.hostname);\n      } catch (er) { /**/ }\n    }\n  }\n\n  return mdurl.decode(mdurl.format(parsed));\n}\n\n\n/**\n * class MarkdownIt\n *\n * Main parser/renderer class.\n *\n * ##### Usage\n *\n * ```javascript\n * // node.js, \"classic\" way:\n * var MarkdownIt = require('markdown-it'),\n *     md = new MarkdownIt();\n * var result = md.render('# markdown-it rulezz!');\n *\n * // node.js, the same, but with sugar:\n * var md = require('markdown-it')();\n * var result = md.render('# markdown-it rulezz!');\n *\n * // browser without AMD, added to \"window\" on script load\n * // Note, there are no dash.\n * var md = window.markdownit();\n * var result = md.render('# markdown-it rulezz!');\n * ```\n *\n * Single line rendering, without paragraph wrap:\n *\n * ```javascript\n * var md = require('markdown-it')();\n * var result = md.renderInline('__markdown-it__ rulezz!');\n * ```\n **/\n\n/**\n * new MarkdownIt([presetName, options])\n * - presetName (String): optional, `commonmark` / `zero`\n * - options (Object)\n *\n * Creates parser instanse with given config. Can be called without `new`.\n *\n * ##### presetName\n *\n * MarkdownIt provides named presets as a convenience to quickly\n * enable/disable active syntax rules and options for common use cases.\n *\n * - [\"commonmark\"](https://github.com/markdown-it/markdown-it/blob/master/lib/presets/commonmark.js) -\n *   configures parser to strict [CommonMark](http://commonmark.org/) mode.\n * - [default](https://github.com/markdown-it/markdown-it/blob/master/lib/presets/default.js) -\n *   similar to GFM, used when no preset name given. Enables all available rules,\n *   but still without html, typographer & autolinker.\n * - [\"zero\"](https://github.com/markdown-it/markdown-it/blob/master/lib/presets/zero.js) -\n *   all rules disabled. Useful to quickly setup your config via `.enable()`.\n *   For example, when you need only `bold` and `italic` markup and nothing else.\n *\n * ##### options:\n *\n * - __html__ - `false`. Set `true` to enable HTML tags in source. Be careful!\n *   That's not safe! You may need external sanitizer to protect output from XSS.\n *   It's better to extend features via plugins, instead of enabling HTML.\n * - __xhtmlOut__ - `false`. Set `true` to add '/' when closing single tags\n *   (`<br />`). This is needed only for full CommonMark compatibility. In real\n *   world you will need HTML output.\n * - __breaks__ - `false`. Set `true` to convert `\\n` in paragraphs into `<br>`.\n * - __langPrefix__ - `language-`. CSS language class prefix for fenced blocks.\n *   Can be useful for external highlighters.\n * - __linkify__ - `false`. Set `true` to autoconvert URL-like text to links.\n * - __typographer__  - `false`. Set `true` to enable [some language-neutral\n *   replacement](https://github.com/markdown-it/markdown-it/blob/master/lib/rules_core/replacements.js) +\n *   quotes beautification (smartquotes).\n * - __quotes__ - `“”‘’`, String or Array. Double + single quotes replacement\n *   pairs, when typographer enabled and smartquotes on. For example, you can\n *   use `'«»„“'` for Russian, `'„“‚‘'` for German, and\n *   `['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›']` for French (including nbsp).\n * - __highlight__ - `null`. Highlighter function for fenced code blocks.\n *   Highlighter `function (str, lang)` should return escaped HTML. It can also\n *   return empty string if the source was not changed and should be escaped\n *   externaly. If result starts with <pre... internal wrapper is skipped.\n *\n * ##### Example\n *\n * ```javascript\n * // commonmark mode\n * var md = require('markdown-it')('commonmark');\n *\n * // default mode\n * var md = require('markdown-it')();\n *\n * // enable everything\n * var md = require('markdown-it')({\n *   html: true,\n *   linkify: true,\n *   typographer: true\n * });\n * ```\n *\n * ##### Syntax highlighting\n *\n * ```js\n * var hljs = require('highlight.js') // https://highlightjs.org/\n *\n * var md = require('markdown-it')({\n *   highlight: function (str, lang) {\n *     if (lang && hljs.getLanguage(lang)) {\n *       try {\n *         return hljs.highlight(lang, str, true).value;\n *       } catch (__) {}\n *     }\n *\n *     return ''; // use external default escaping\n *   }\n * });\n * ```\n *\n * Or with full wrapper override (if you need assign class to `<pre>`):\n *\n * ```javascript\n * var hljs = require('highlight.js') // https://highlightjs.org/\n *\n * // Actual default values\n * var md = require('markdown-it')({\n *   highlight: function (str, lang) {\n *     if (lang && hljs.getLanguage(lang)) {\n *       try {\n *         return '<pre class=\"hljs\"><code>' +\n *                hljs.highlight(lang, str, true).value +\n *                '</code></pre>';\n *       } catch (__) {}\n *     }\n *\n *     return '<pre class=\"hljs\"><code>' + md.utils.escapeHtml(str) + '</code></pre>';\n *   }\n * });\n * ```\n *\n **/\nfunction MarkdownIt(presetName, options) {\n  if (!(this instanceof MarkdownIt)) {\n    return new MarkdownIt(presetName, options);\n  }\n\n  if (!options) {\n    if (!utils.isString(presetName)) {\n      options = presetName || {};\n      presetName = 'default';\n    }\n  }\n\n  /**\n   * MarkdownIt#inline -> ParserInline\n   *\n   * Instance of [[ParserInline]]. You may need it to add new rules when\n   * writing plugins. For simple rules control use [[MarkdownIt.disable]] and\n   * [[MarkdownIt.enable]].\n   **/\n  this.inline = new ParserInline();\n\n  /**\n   * MarkdownIt#block -> ParserBlock\n   *\n   * Instance of [[ParserBlock]]. You may need it to add new rules when\n   * writing plugins. For simple rules control use [[MarkdownIt.disable]] and\n   * [[MarkdownIt.enable]].\n   **/\n  this.block = new ParserBlock();\n\n  /**\n   * MarkdownIt#core -> Core\n   *\n   * Instance of [[Core]] chain executor. You may need it to add new rules when\n   * writing plugins. For simple rules control use [[MarkdownIt.disable]] and\n   * [[MarkdownIt.enable]].\n   **/\n  this.core = new ParserCore();\n\n  /**\n   * MarkdownIt#renderer -> Renderer\n   *\n   * Instance of [[Renderer]]. Use it to modify output look. Or to add rendering\n   * rules for new token types, generated by plugins.\n   *\n   * ##### Example\n   *\n   * ```javascript\n   * var md = require('markdown-it')();\n   *\n   * function myToken(tokens, idx, options, env, self) {\n   *   //...\n   *   return result;\n   * };\n   *\n   * md.renderer.rules['my_token'] = myToken\n   * ```\n   *\n   * See [[Renderer]] docs and [source code](https://github.com/markdown-it/markdown-it/blob/master/lib/renderer.js).\n   **/\n  this.renderer = new Renderer();\n\n  /**\n   * MarkdownIt#linkify -> LinkifyIt\n   *\n   * [linkify-it](https://github.com/markdown-it/linkify-it) instance.\n   * Used by [linkify](https://github.com/markdown-it/markdown-it/blob/master/lib/rules_core/linkify.js)\n   * rule.\n   **/\n  this.linkify = new LinkifyIt();\n\n  /**\n   * MarkdownIt#validateLink(url) -> Boolean\n   *\n   * Link validation function. CommonMark allows too much in links. By default\n   * we disable `javascript:`, `vbscript:`, `file:` schemas, and almost all `data:...` schemas\n   * except some embedded image types.\n   *\n   * You can change this behaviour:\n   *\n   * ```javascript\n   * var md = require('markdown-it')();\n   * // enable everything\n   * md.validateLink = function () { return true; }\n   * ```\n   **/\n  this.validateLink = validateLink;\n\n  /**\n   * MarkdownIt#normalizeLink(url) -> String\n   *\n   * Function used to encode link url to a machine-readable format,\n   * which includes url-encoding, punycode, etc.\n   **/\n  this.normalizeLink = normalizeLink;\n\n  /**\n   * MarkdownIt#normalizeLinkText(url) -> String\n   *\n   * Function used to decode link url to a human-readable format`\n   **/\n  this.normalizeLinkText = normalizeLinkText;\n\n\n  // Expose utils & helpers for easy acces from plugins\n\n  /**\n   * MarkdownIt#utils -> utils\n   *\n   * Assorted utility functions, useful to write plugins. See details\n   * [here](https://github.com/markdown-it/markdown-it/blob/master/lib/common/utils.js).\n   **/\n  this.utils = utils;\n\n  /**\n   * MarkdownIt#helpers -> helpers\n   *\n   * Link components parser functions, useful to write plugins. See details\n   * [here](https://github.com/markdown-it/markdown-it/blob/master/lib/helpers).\n   **/\n  this.helpers = utils.assign({}, helpers);\n\n\n  this.options = {};\n  this.configure(presetName);\n\n  if (options) { this.set(options); }\n}\n\n\n/** chainable\n * MarkdownIt.set(options)\n *\n * Set parser options (in the same format as in constructor). Probably, you\n * will never need it, but you can change options after constructor call.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')()\n *             .set({ html: true, breaks: true })\n *             .set({ typographer, true });\n * ```\n *\n * __Note:__ To achieve the best possible performance, don't modify a\n * `markdown-it` instance options on the fly. If you need multiple configurations\n * it's best to create multiple instances and initialize each with separate\n * config.\n **/\nMarkdownIt.prototype.set = function (options) {\n  utils.assign(this.options, options);\n  return this;\n};\n\n\n/** chainable, internal\n * MarkdownIt.configure(presets)\n *\n * Batch load of all options and compenent settings. This is internal method,\n * and you probably will not need it. But if you with - see available presets\n * and data structure [here](https://github.com/markdown-it/markdown-it/tree/master/lib/presets)\n *\n * We strongly recommend to use presets instead of direct config loads. That\n * will give better compatibility with next versions.\n **/\nMarkdownIt.prototype.configure = function (presets) {\n  var self = this, presetName;\n\n  if (utils.isString(presets)) {\n    presetName = presets;\n    presets = config[presetName];\n    if (!presets) { throw new Error('Wrong `markdown-it` preset \"' + presetName + '\", check name'); }\n  }\n\n  if (!presets) { throw new Error('Wrong `markdown-it` preset, can\\'t be empty'); }\n\n  if (presets.options) { self.set(presets.options); }\n\n  if (presets.components) {\n    Object.keys(presets.components).forEach(function (name) {\n      if (presets.components[name].rules) {\n        self[name].ruler.enableOnly(presets.components[name].rules);\n      }\n      if (presets.components[name].rules2) {\n        self[name].ruler2.enableOnly(presets.components[name].rules2);\n      }\n    });\n  }\n  return this;\n};\n\n\n/** chainable\n * MarkdownIt.enable(list, ignoreInvalid)\n * - list (String|Array): rule name or list of rule names to enable\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Enable list or rules. It will automatically find appropriate components,\n * containing rules with given names. If rule not found, and `ignoreInvalid`\n * not set - throws exception.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')()\n *             .enable(['sub', 'sup'])\n *             .disable('smartquotes');\n * ```\n **/\nMarkdownIt.prototype.enable = function (list, ignoreInvalid) {\n  var result = [];\n\n  if (!Array.isArray(list)) { list = [ list ]; }\n\n  [ 'core', 'block', 'inline' ].forEach(function (chain) {\n    result = result.concat(this[chain].ruler.enable(list, true));\n  }, this);\n\n  result = result.concat(this.inline.ruler2.enable(list, true));\n\n  var missed = list.filter(function (name) { return result.indexOf(name) < 0; });\n\n  if (missed.length && !ignoreInvalid) {\n    throw new Error('MarkdownIt. Failed to enable unknown rule(s): ' + missed);\n  }\n\n  return this;\n};\n\n\n/** chainable\n * MarkdownIt.disable(list, ignoreInvalid)\n * - list (String|Array): rule name or list of rule names to disable.\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * The same as [[MarkdownIt.enable]], but turn specified rules off.\n **/\nMarkdownIt.prototype.disable = function (list, ignoreInvalid) {\n  var result = [];\n\n  if (!Array.isArray(list)) { list = [ list ]; }\n\n  [ 'core', 'block', 'inline' ].forEach(function (chain) {\n    result = result.concat(this[chain].ruler.disable(list, true));\n  }, this);\n\n  result = result.concat(this.inline.ruler2.disable(list, true));\n\n  var missed = list.filter(function (name) { return result.indexOf(name) < 0; });\n\n  if (missed.length && !ignoreInvalid) {\n    throw new Error('MarkdownIt. Failed to disable unknown rule(s): ' + missed);\n  }\n  return this;\n};\n\n\n/** chainable\n * MarkdownIt.use(plugin, params)\n *\n * Load specified plugin with given params into current parser instance.\n * It's just a sugar to call `plugin(md, params)` with curring.\n *\n * ##### Example\n *\n * ```javascript\n * var iterator = require('markdown-it-for-inline');\n * var md = require('markdown-it')()\n *             .use(iterator, 'foo_replace', 'text', function (tokens, idx) {\n *               tokens[idx].content = tokens[idx].content.replace(/foo/g, 'bar');\n *             });\n * ```\n **/\nMarkdownIt.prototype.use = function (plugin /*, params, ... */) {\n  var args = [ this ].concat(Array.prototype.slice.call(arguments, 1));\n  plugin.apply(plugin, args);\n  return this;\n};\n\n\n/** internal\n * MarkdownIt.parse(src, env) -> Array\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * Parse input string and returns list of block tokens (special token type\n * \"inline\" will contain list of inline tokens). You should not call this\n * method directly, until you write custom renderer (for example, to produce\n * AST).\n *\n * `env` is used to pass data between \"distributed\" rules and return additional\n * metadata like reference info, needed for the renderer. It also can be used to\n * inject data in specific cases. Usually, you will be ok to pass `{}`,\n * and then pass updated object to renderer.\n **/\nMarkdownIt.prototype.parse = function (src, env) {\n  if (typeof src !== 'string') {\n    throw new Error('Input data should be a String');\n  }\n\n  var state = new this.core.State(src, this, env);\n\n  this.core.process(state);\n\n  return state.tokens;\n};\n\n\n/**\n * MarkdownIt.render(src [, env]) -> String\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * Render markdown string into html. It does all magic for you :).\n *\n * `env` can be used to inject additional metadata (`{}` by default).\n * But you will not need it with high probability. See also comment\n * in [[MarkdownIt.parse]].\n **/\nMarkdownIt.prototype.render = function (src, env) {\n  env = env || {};\n\n  return this.renderer.render(this.parse(src, env), this.options, env);\n};\n\n\n/** internal\n * MarkdownIt.parseInline(src, env) -> Array\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * The same as [[MarkdownIt.parse]] but skip all block rules. It returns the\n * block tokens list with the single `inline` element, containing parsed inline\n * tokens in `children` property. Also updates `env` object.\n **/\nMarkdownIt.prototype.parseInline = function (src, env) {\n  var state = new this.core.State(src, this, env);\n\n  state.inlineMode = true;\n  this.core.process(state);\n\n  return state.tokens;\n};\n\n\n/**\n * MarkdownIt.renderInline(src [, env]) -> String\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * Similar to [[MarkdownIt.render]] but for single paragraph content. Result\n * will NOT be wrapped into `<p>` tags.\n **/\nMarkdownIt.prototype.renderInline = function (src, env) {\n  env = env || {};\n\n  return this.renderer.render(this.parseInline(src, env), this.options, env);\n};\n\n\nmodule.exports = MarkdownIt;\n","\n'use strict';\n\n\nvar encodeCache = {};\n\n\n// Create a lookup array where anything but characters in `chars` string\n// and alphanumeric chars is percent-encoded.\n//\nfunction getEncodeCache(exclude) {\n  var i, ch, cache = encodeCache[exclude];\n  if (cache) { return cache; }\n\n  cache = encodeCache[exclude] = [];\n\n  for (i = 0; i < 128; i++) {\n    ch = String.fromCharCode(i);\n\n    if (/^[0-9a-z]$/i.test(ch)) {\n      // always allow unencoded alphanumeric characters\n      cache.push(ch);\n    } else {\n      cache.push('%' + ('0' + i.toString(16).toUpperCase()).slice(-2));\n    }\n  }\n\n  for (i = 0; i < exclude.length; i++) {\n    cache[exclude.charCodeAt(i)] = exclude[i];\n  }\n\n  return cache;\n}\n\n\n// Encode unsafe characters with percent-encoding, skipping already\n// encoded sequences.\n//\n//  - string       - string to encode\n//  - exclude      - list of characters to ignore (in addition to a-zA-Z0-9)\n//  - keepEscaped  - don't encode '%' in a correct escape sequence (default: true)\n//\nfunction encode(string, exclude, keepEscaped) {\n  var i, l, code, nextCode, cache,\n      result = '';\n\n  if (typeof exclude !== 'string') {\n    // encode(string, keepEscaped)\n    keepEscaped  = exclude;\n    exclude = encode.defaultChars;\n  }\n\n  if (typeof keepEscaped === 'undefined') {\n    keepEscaped = true;\n  }\n\n  cache = getEncodeCache(exclude);\n\n  for (i = 0, l = string.length; i < l; i++) {\n    code = string.charCodeAt(i);\n\n    if (keepEscaped && code === 0x25 /* % */ && i + 2 < l) {\n      if (/^[0-9a-f]{2}$/i.test(string.slice(i + 1, i + 3))) {\n        result += string.slice(i, i + 3);\n        i += 2;\n        continue;\n      }\n    }\n\n    if (code < 128) {\n      result += cache[code];\n      continue;\n    }\n\n    if (code >= 0xD800 && code <= 0xDFFF) {\n      if (code >= 0xD800 && code <= 0xDBFF && i + 1 < l) {\n        nextCode = string.charCodeAt(i + 1);\n        if (nextCode >= 0xDC00 && nextCode <= 0xDFFF) {\n          result += encodeURIComponent(string[i] + string[i + 1]);\n          i++;\n          continue;\n        }\n      }\n      result += '%EF%BF%BD';\n      continue;\n    }\n\n    result += encodeURIComponent(string[i]);\n  }\n\n  return result;\n}\n\nencode.defaultChars   = \";/?:@&=+$,-_.!~*'()#\";\nencode.componentChars = \"-_.!~*'()\";\n\n\nmodule.exports = encode;\n","\n'use strict';\n\n\n/* eslint-disable no-bitwise */\n\nvar decodeCache = {};\n\nfunction getDecodeCache(exclude) {\n  var i, ch, cache = decodeCache[exclude];\n  if (cache) { return cache; }\n\n  cache = decodeCache[exclude] = [];\n\n  for (i = 0; i < 128; i++) {\n    ch = String.fromCharCode(i);\n    cache.push(ch);\n  }\n\n  for (i = 0; i < exclude.length; i++) {\n    ch = exclude.charCodeAt(i);\n    cache[ch] = '%' + ('0' + ch.toString(16).toUpperCase()).slice(-2);\n  }\n\n  return cache;\n}\n\n\n// Decode percent-encoded string.\n//\nfunction decode(string, exclude) {\n  var cache;\n\n  if (typeof exclude !== 'string') {\n    exclude = decode.defaultChars;\n  }\n\n  cache = getDecodeCache(exclude);\n\n  return string.replace(/(%[a-f0-9]{2})+/gi, function(seq) {\n    var i, l, b1, b2, b3, b4, chr,\n        result = '';\n\n    for (i = 0, l = seq.length; i < l; i += 3) {\n      b1 = parseInt(seq.slice(i + 1, i + 3), 16);\n\n      if (b1 < 0x80) {\n        result += cache[b1];\n        continue;\n      }\n\n      if ((b1 & 0xE0) === 0xC0 && (i + 3 < l)) {\n        // 110xxxxx 10xxxxxx\n        b2 = parseInt(seq.slice(i + 4, i + 6), 16);\n\n        if ((b2 & 0xC0) === 0x80) {\n          chr = ((b1 << 6) & 0x7C0) | (b2 & 0x3F);\n\n          if (chr < 0x80) {\n            result += '\\ufffd\\ufffd';\n          } else {\n            result += String.fromCharCode(chr);\n          }\n\n          i += 3;\n          continue;\n        }\n      }\n\n      if ((b1 & 0xF0) === 0xE0 && (i + 6 < l)) {\n        // 1110xxxx 10xxxxxx 10xxxxxx\n        b2 = parseInt(seq.slice(i + 4, i + 6), 16);\n        b3 = parseInt(seq.slice(i + 7, i + 9), 16);\n\n        if ((b2 & 0xC0) === 0x80 && (b3 & 0xC0) === 0x80) {\n          chr = ((b1 << 12) & 0xF000) | ((b2 << 6) & 0xFC0) | (b3 & 0x3F);\n\n          if (chr < 0x800 || (chr >= 0xD800 && chr <= 0xDFFF)) {\n            result += '\\ufffd\\ufffd\\ufffd';\n          } else {\n            result += String.fromCharCode(chr);\n          }\n\n          i += 6;\n          continue;\n        }\n      }\n\n      if ((b1 & 0xF8) === 0xF0 && (i + 9 < l)) {\n        // 111110xx 10xxxxxx 10xxxxxx 10xxxxxx\n        b2 = parseInt(seq.slice(i + 4, i + 6), 16);\n        b3 = parseInt(seq.slice(i + 7, i + 9), 16);\n        b4 = parseInt(seq.slice(i + 10, i + 12), 16);\n\n        if ((b2 & 0xC0) === 0x80 && (b3 & 0xC0) === 0x80 && (b4 & 0xC0) === 0x80) {\n          chr = ((b1 << 18) & 0x1C0000) | ((b2 << 12) & 0x3F000) | ((b3 << 6) & 0xFC0) | (b4 & 0x3F);\n\n          if (chr < 0x10000 || chr > 0x10FFFF) {\n            result += '\\ufffd\\ufffd\\ufffd\\ufffd';\n          } else {\n            chr -= 0x10000;\n            result += String.fromCharCode(0xD800 + (chr >> 10), 0xDC00 + (chr & 0x3FF));\n          }\n\n          i += 9;\n          continue;\n        }\n      }\n\n      result += '\\ufffd';\n    }\n\n    return result;\n  });\n}\n\n\ndecode.defaultChars   = ';/?:@&=+$,#';\ndecode.componentChars = '';\n\n\nmodule.exports = decode;\n","\n'use strict';\n\n\nmodule.exports = function format(url) {\n  var result = '';\n\n  result += url.protocol || '';\n  result += url.slashes ? '//' : '';\n  result += url.auth ? url.auth + '@' : '';\n\n  if (url.hostname && url.hostname.indexOf(':') !== -1) {\n    // ipv6 address\n    result += '[' + url.hostname + ']';\n  } else {\n    result += url.hostname || '';\n  }\n\n  result += url.port ? ':' + url.port : '';\n  result += url.pathname || '';\n  result += url.search || '';\n  result += url.hash || '';\n\n  return result;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n//\n// Changes from joyent/node:\n//\n// 1. No leading slash in paths,\n//    e.g. in `url.parse('http://foo?bar')` pathname is ``, not `/`\n//\n// 2. Backslashes are not replaced with slashes,\n//    so `http:\\\\example.org\\` is treated like a relative path\n//\n// 3. Trailing colon is treated like a part of the path,\n//    i.e. in `http://example.org:foo` pathname is `:foo`\n//\n// 4. Nothing is URL-encoded in the resulting object,\n//    (in joyent/node some chars in auth and paths are encoded)\n//\n// 5. `url.parse()` does not have `parseQueryString` argument\n//\n// 6. Removed extraneous result properties: `host`, `path`, `query`, etc.,\n//    which can be constructed using other parts of the url.\n//\n\n\nfunction Url() {\n  this.protocol = null;\n  this.slashes = null;\n  this.auth = null;\n  this.port = null;\n  this.hostname = null;\n  this.hash = null;\n  this.search = null;\n  this.pathname = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n    portPattern = /:[0-9]*$/,\n\n    // Special case for a simple path URL\n    simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n    // RFC 2396: characters reserved for delimiting URLs.\n    // We actually just auto-escape these.\n    delims = [ '<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t' ],\n\n    // RFC 2396: characters not allowed for various reasons.\n    unwise = [ '{', '}', '|', '\\\\', '^', '`' ].concat(delims),\n\n    // Allowed by RFCs, but cause of XSS attacks.  Always escape these.\n    autoEscape = [ '\\'' ].concat(unwise),\n    // Characters that are never ever allowed in a hostname.\n    // Note that any invalid chars are also handled, but these\n    // are the ones that are *expected* to be seen, so we fast-path\n    // them.\n    nonHostChars = [ '%', '/', '?', ';', '#' ].concat(autoEscape),\n    hostEndingChars = [ '/', '?', '#' ],\n    hostnameMaxLen = 255,\n    hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n    hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n    // protocols that can allow \"unsafe\" and \"unwise\" chars.\n    /* eslint-disable no-script-url */\n    // protocols that never have a hostname.\n    hostlessProtocol = {\n      'javascript': true,\n      'javascript:': true\n    },\n    // protocols that always contain a // bit.\n    slashedProtocol = {\n      'http': true,\n      'https': true,\n      'ftp': true,\n      'gopher': true,\n      'file': true,\n      'http:': true,\n      'https:': true,\n      'ftp:': true,\n      'gopher:': true,\n      'file:': true\n    };\n    /* eslint-enable no-script-url */\n\nfunction urlParse(url, slashesDenoteHost) {\n  if (url && url instanceof Url) { return url; }\n\n  var u = new Url();\n  u.parse(url, slashesDenoteHost);\n  return u;\n}\n\nUrl.prototype.parse = function(url, slashesDenoteHost) {\n  var i, l, lowerProto, hec, slashes,\n      rest = url;\n\n  // trim before proceeding.\n  // This is to support parse stuff like \"  http://foo.com  \\n\"\n  rest = rest.trim();\n\n  if (!slashesDenoteHost && url.split('#').length === 1) {\n    // Try fast path regexp\n    var simplePath = simplePathPattern.exec(rest);\n    if (simplePath) {\n      this.pathname = simplePath[1];\n      if (simplePath[2]) {\n        this.search = simplePath[2];\n      }\n      return this;\n    }\n  }\n\n  var proto = protocolPattern.exec(rest);\n  if (proto) {\n    proto = proto[0];\n    lowerProto = proto.toLowerCase();\n    this.protocol = proto;\n    rest = rest.substr(proto.length);\n  }\n\n  // figure out if it's got a host\n  // user@server is *always* interpreted as a hostname, and url\n  // resolution will treat //foo/bar as host=foo,path=bar because that's\n  // how the browser resolves relative URLs.\n  if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n    slashes = rest.substr(0, 2) === '//';\n    if (slashes && !(proto && hostlessProtocol[proto])) {\n      rest = rest.substr(2);\n      this.slashes = true;\n    }\n  }\n\n  if (!hostlessProtocol[proto] &&\n      (slashes || (proto && !slashedProtocol[proto]))) {\n\n    // there's a hostname.\n    // the first instance of /, ?, ;, or # ends the host.\n    //\n    // If there is an @ in the hostname, then non-host chars *are* allowed\n    // to the left of the last @ sign, unless some host-ending character\n    // comes *before* the @-sign.\n    // URLs are obnoxious.\n    //\n    // ex:\n    // http://a@b@c/ => user:a@b host:c\n    // http://a@b?@c => user:a host:c path:/?@c\n\n    // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n    // Review our test case against browsers more comprehensively.\n\n    // find the first instance of any hostEndingChars\n    var hostEnd = -1;\n    for (i = 0; i < hostEndingChars.length; i++) {\n      hec = rest.indexOf(hostEndingChars[i]);\n      if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n        hostEnd = hec;\n      }\n    }\n\n    // at this point, either we have an explicit point where the\n    // auth portion cannot go past, or the last @ char is the decider.\n    var auth, atSign;\n    if (hostEnd === -1) {\n      // atSign can be anywhere.\n      atSign = rest.lastIndexOf('@');\n    } else {\n      // atSign must be in auth portion.\n      // http://a@b/c@d => host:b auth:a path:/c@d\n      atSign = rest.lastIndexOf('@', hostEnd);\n    }\n\n    // Now we have a portion which is definitely the auth.\n    // Pull that off.\n    if (atSign !== -1) {\n      auth = rest.slice(0, atSign);\n      rest = rest.slice(atSign + 1);\n      this.auth = auth;\n    }\n\n    // the host is the remaining to the left of the first non-host char\n    hostEnd = -1;\n    for (i = 0; i < nonHostChars.length; i++) {\n      hec = rest.indexOf(nonHostChars[i]);\n      if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n        hostEnd = hec;\n      }\n    }\n    // if we still have not hit it, then the entire thing is a host.\n    if (hostEnd === -1) {\n      hostEnd = rest.length;\n    }\n\n    if (rest[hostEnd - 1] === ':') { hostEnd--; }\n    var host = rest.slice(0, hostEnd);\n    rest = rest.slice(hostEnd);\n\n    // pull out port.\n    this.parseHost(host);\n\n    // we've indicated that there is a hostname,\n    // so even if it's empty, it has to be present.\n    this.hostname = this.hostname || '';\n\n    // if hostname begins with [ and ends with ]\n    // assume that it's an IPv6 address.\n    var ipv6Hostname = this.hostname[0] === '[' &&\n        this.hostname[this.hostname.length - 1] === ']';\n\n    // validate a little.\n    if (!ipv6Hostname) {\n      var hostparts = this.hostname.split(/\\./);\n      for (i = 0, l = hostparts.length; i < l; i++) {\n        var part = hostparts[i];\n        if (!part) { continue; }\n        if (!part.match(hostnamePartPattern)) {\n          var newpart = '';\n          for (var j = 0, k = part.length; j < k; j++) {\n            if (part.charCodeAt(j) > 127) {\n              // we replace non-ASCII char with a temporary placeholder\n              // we need this to make sure size of hostname is not\n              // broken by replacing non-ASCII by nothing\n              newpart += 'x';\n            } else {\n              newpart += part[j];\n            }\n          }\n          // we test again with ASCII char only\n          if (!newpart.match(hostnamePartPattern)) {\n            var validParts = hostparts.slice(0, i);\n            var notHost = hostparts.slice(i + 1);\n            var bit = part.match(hostnamePartStart);\n            if (bit) {\n              validParts.push(bit[1]);\n              notHost.unshift(bit[2]);\n            }\n            if (notHost.length) {\n              rest = notHost.join('.') + rest;\n            }\n            this.hostname = validParts.join('.');\n            break;\n          }\n        }\n      }\n    }\n\n    if (this.hostname.length > hostnameMaxLen) {\n      this.hostname = '';\n    }\n\n    // strip [ and ] from the hostname\n    // the host field still retains them, though\n    if (ipv6Hostname) {\n      this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n    }\n  }\n\n  // chop off from the tail first.\n  var hash = rest.indexOf('#');\n  if (hash !== -1) {\n    // got a fragment string.\n    this.hash = rest.substr(hash);\n    rest = rest.slice(0, hash);\n  }\n  var qm = rest.indexOf('?');\n  if (qm !== -1) {\n    this.search = rest.substr(qm);\n    rest = rest.slice(0, qm);\n  }\n  if (rest) { this.pathname = rest; }\n  if (slashedProtocol[lowerProto] &&\n      this.hostname && !this.pathname) {\n    this.pathname = '';\n  }\n\n  return this;\n};\n\nUrl.prototype.parseHost = function(host) {\n  var port = portPattern.exec(host);\n  if (port) {\n    port = port[0];\n    if (port !== ':') {\n      this.port = port.substr(1);\n    }\n    host = host.substr(0, host.length - port.length);\n  }\n  if (host) { this.hostname = host; }\n};\n\nmodule.exports = urlParse;\n","'use strict';\n\nexports.Any = require('./properties/Any/regex');\nexports.Cc  = require('./categories/Cc/regex');\nexports.Cf  = require('./categories/Cf/regex');\nexports.P   = require('./categories/P/regex');\nexports.Z   = require('./categories/Z/regex');\n","module.exports=/[\\xAD\\u0600-\\u0605\\u061C\\u06DD\\u070F\\u08E2\\u180E\\u200B-\\u200F\\u202A-\\u202E\\u2060-\\u2064\\u2066-\\u206F\\uFEFF\\uFFF9-\\uFFFB]|\\uD804[\\uDCBD\\uDCCD]|\\uD82F[\\uDCA0-\\uDCA3]|\\uD834[\\uDD73-\\uDD7A]|\\uDB40[\\uDC01\\uDC20-\\uDC7F]/","// Just a shortcut for bulk export\n'use strict';\n\n\nexports.parseLinkLabel       = require('./parse_link_label');\nexports.parseLinkDestination = require('./parse_link_destination');\nexports.parseLinkTitle       = require('./parse_link_title');\n","// Parse link label\n//\n// this function assumes that first character (\"[\") already matches;\n// returns the end of the label\n//\n'use strict';\n\nmodule.exports = function parseLinkLabel(state, start, disableNested) {\n  var level, found, marker, prevPos,\n      labelEnd = -1,\n      max = state.posMax,\n      oldPos = state.pos;\n\n  state.pos = start + 1;\n  level = 1;\n\n  while (state.pos < max) {\n    marker = state.src.charCodeAt(state.pos);\n    if (marker === 0x5D /* ] */) {\n      level--;\n      if (level === 0) {\n        found = true;\n        break;\n      }\n    }\n\n    prevPos = state.pos;\n    state.md.inline.skipToken(state);\n    if (marker === 0x5B /* [ */) {\n      if (prevPos === state.pos - 1) {\n        // increase level if we find text `[`, which is not a part of any token\n        level++;\n      } else if (disableNested) {\n        state.pos = oldPos;\n        return -1;\n      }\n    }\n  }\n\n  if (found) {\n    labelEnd = state.pos;\n  }\n\n  // restore old state\n  state.pos = oldPos;\n\n  return labelEnd;\n};\n","// Parse link destination\n//\n'use strict';\n\n\nvar isSpace     = require('../common/utils').isSpace;\nvar unescapeAll = require('../common/utils').unescapeAll;\n\n\nmodule.exports = function parseLinkDestination(str, pos, max) {\n  var code, level,\n      lines = 0,\n      start = pos,\n      result = {\n        ok: false,\n        pos: 0,\n        lines: 0,\n        str: ''\n      };\n\n  if (str.charCodeAt(pos) === 0x3C /* < */) {\n    pos++;\n    while (pos < max) {\n      code = str.charCodeAt(pos);\n      if (code === 0x0A /* \\n */ || isSpace(code)) { return result; }\n      if (code === 0x3E /* > */) {\n        result.pos = pos + 1;\n        result.str = unescapeAll(str.slice(start + 1, pos));\n        result.ok = true;\n        return result;\n      }\n      if (code === 0x5C /* \\ */ && pos + 1 < max) {\n        pos += 2;\n        continue;\n      }\n\n      pos++;\n    }\n\n    // no closing '>'\n    return result;\n  }\n\n  // this should be ... } else { ... branch\n\n  level = 0;\n  while (pos < max) {\n    code = str.charCodeAt(pos);\n\n    if (code === 0x20) { break; }\n\n    // ascii control characters\n    if (code < 0x20 || code === 0x7F) { break; }\n\n    if (code === 0x5C /* \\ */ && pos + 1 < max) {\n      pos += 2;\n      continue;\n    }\n\n    if (code === 0x28 /* ( */) {\n      level++;\n    }\n\n    if (code === 0x29 /* ) */) {\n      if (level === 0) { break; }\n      level--;\n    }\n\n    pos++;\n  }\n\n  if (start === pos) { return result; }\n  if (level !== 0) { return result; }\n\n  result.str = unescapeAll(str.slice(start, pos));\n  result.lines = lines;\n  result.pos = pos;\n  result.ok = true;\n  return result;\n};\n","// Parse link title\n//\n'use strict';\n\n\nvar unescapeAll = require('../common/utils').unescapeAll;\n\n\nmodule.exports = function parseLinkTitle(str, pos, max) {\n  var code,\n      marker,\n      lines = 0,\n      start = pos,\n      result = {\n        ok: false,\n        pos: 0,\n        lines: 0,\n        str: ''\n      };\n\n  if (pos >= max) { return result; }\n\n  marker = str.charCodeAt(pos);\n\n  if (marker !== 0x22 /* \" */ && marker !== 0x27 /* ' */ && marker !== 0x28 /* ( */) { return result; }\n\n  pos++;\n\n  // if opening marker is \"(\", switch it to closing marker \")\"\n  if (marker === 0x28) { marker = 0x29; }\n\n  while (pos < max) {\n    code = str.charCodeAt(pos);\n    if (code === marker) {\n      result.pos = pos + 1;\n      result.lines = lines;\n      result.str = unescapeAll(str.slice(start + 1, pos));\n      result.ok = true;\n      return result;\n    } else if (code === 0x0A) {\n      lines++;\n    } else if (code === 0x5C /* \\ */ && pos + 1 < max) {\n      pos++;\n      if (str.charCodeAt(pos) === 0x0A) {\n        lines++;\n      }\n    }\n\n    pos++;\n  }\n\n  return result;\n};\n","/**\n * class Renderer\n *\n * Generates HTML from parsed token stream. Each instance has independent\n * copy of rules. Those can be rewritten with ease. Also, you can add new\n * rules if you create plugin and adds new token types.\n **/\n'use strict';\n\n\nvar assign          = require('./common/utils').assign;\nvar unescapeAll     = require('./common/utils').unescapeAll;\nvar escapeHtml      = require('./common/utils').escapeHtml;\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nvar default_rules = {};\n\n\ndefault_rules.code_inline = function (tokens, idx, options, env, slf) {\n  var token = tokens[idx];\n\n  return  '<code' + slf.renderAttrs(token) + '>' +\n          escapeHtml(tokens[idx].content) +\n          '</code>';\n};\n\n\ndefault_rules.code_block = function (tokens, idx, options, env, slf) {\n  var token = tokens[idx];\n\n  return  '<pre' + slf.renderAttrs(token) + '><code>' +\n          escapeHtml(tokens[idx].content) +\n          '</code></pre>\\n';\n};\n\n\ndefault_rules.fence = function (tokens, idx, options, env, slf) {\n  var token = tokens[idx],\n      info = token.info ? unescapeAll(token.info).trim() : '',\n      langName = '',\n      highlighted, i, tmpAttrs, tmpToken;\n\n  if (info) {\n    langName = info.split(/\\s+/g)[0];\n  }\n\n  if (options.highlight) {\n    highlighted = options.highlight(token.content, langName) || escapeHtml(token.content);\n  } else {\n    highlighted = escapeHtml(token.content);\n  }\n\n  if (highlighted.indexOf('<pre') === 0) {\n    return highlighted + '\\n';\n  }\n\n  // If language exists, inject class gently, without modifying original token.\n  // May be, one day we will add .clone() for token and simplify this part, but\n  // now we prefer to keep things local.\n  if (info) {\n    i        = token.attrIndex('class');\n    tmpAttrs = token.attrs ? token.attrs.slice() : [];\n\n    if (i < 0) {\n      tmpAttrs.push([ 'class', options.langPrefix + langName ]);\n    } else {\n      tmpAttrs[i][1] += ' ' + options.langPrefix + langName;\n    }\n\n    // Fake token just to render attributes\n    tmpToken = {\n      attrs: tmpAttrs\n    };\n\n    return  '<pre><code' + slf.renderAttrs(tmpToken) + '>'\n          + highlighted\n          + '</code></pre>\\n';\n  }\n\n\n  return  '<pre><code' + slf.renderAttrs(token) + '>'\n        + highlighted\n        + '</code></pre>\\n';\n};\n\n\ndefault_rules.image = function (tokens, idx, options, env, slf) {\n  var token = tokens[idx];\n\n  // \"alt\" attr MUST be set, even if empty. Because it's mandatory and\n  // should be placed on proper position for tests.\n  //\n  // Replace content with actual value\n\n  token.attrs[token.attrIndex('alt')][1] =\n    slf.renderInlineAsText(token.children, options, env);\n\n  return slf.renderToken(tokens, idx, options);\n};\n\n\ndefault_rules.hardbreak = function (tokens, idx, options /*, env */) {\n  return options.xhtmlOut ? '<br />\\n' : '<br>\\n';\n};\ndefault_rules.softbreak = function (tokens, idx, options /*, env */) {\n  return options.breaks ? (options.xhtmlOut ? '<br />\\n' : '<br>\\n') : '\\n';\n};\n\n\ndefault_rules.text = function (tokens, idx /*, options, env */) {\n  return escapeHtml(tokens[idx].content);\n};\n\n\ndefault_rules.html_block = function (tokens, idx /*, options, env */) {\n  return tokens[idx].content;\n};\ndefault_rules.html_inline = function (tokens, idx /*, options, env */) {\n  return tokens[idx].content;\n};\n\n\n/**\n * new Renderer()\n *\n * Creates new [[Renderer]] instance and fill [[Renderer#rules]] with defaults.\n **/\nfunction Renderer() {\n\n  /**\n   * Renderer#rules -> Object\n   *\n   * Contains render rules for tokens. Can be updated and extended.\n   *\n   * ##### Example\n   *\n   * ```javascript\n   * var md = require('markdown-it')();\n   *\n   * md.renderer.rules.strong_open  = function () { return '<b>'; };\n   * md.renderer.rules.strong_close = function () { return '</b>'; };\n   *\n   * var result = md.renderInline(...);\n   * ```\n   *\n   * Each rule is called as independent static function with fixed signature:\n   *\n   * ```javascript\n   * function my_token_render(tokens, idx, options, env, renderer) {\n   *   // ...\n   *   return renderedHTML;\n   * }\n   * ```\n   *\n   * See [source code](https://github.com/markdown-it/markdown-it/blob/master/lib/renderer.js)\n   * for more details and examples.\n   **/\n  this.rules = assign({}, default_rules);\n}\n\n\n/**\n * Renderer.renderAttrs(token) -> String\n *\n * Render token attributes to string.\n **/\nRenderer.prototype.renderAttrs = function renderAttrs(token) {\n  var i, l, result;\n\n  if (!token.attrs) { return ''; }\n\n  result = '';\n\n  for (i = 0, l = token.attrs.length; i < l; i++) {\n    result += ' ' + escapeHtml(token.attrs[i][0]) + '=\"' + escapeHtml(token.attrs[i][1]) + '\"';\n  }\n\n  return result;\n};\n\n\n/**\n * Renderer.renderToken(tokens, idx, options) -> String\n * - tokens (Array): list of tokens\n * - idx (Numbed): token index to render\n * - options (Object): params of parser instance\n *\n * Default token renderer. Can be overriden by custom function\n * in [[Renderer#rules]].\n **/\nRenderer.prototype.renderToken = function renderToken(tokens, idx, options) {\n  var nextToken,\n      result = '',\n      needLf = false,\n      token = tokens[idx];\n\n  // Tight list paragraphs\n  if (token.hidden) {\n    return '';\n  }\n\n  // Insert a newline between hidden paragraph and subsequent opening\n  // block-level tag.\n  //\n  // For example, here we should insert a newline before blockquote:\n  //  - a\n  //    >\n  //\n  if (token.block && token.nesting !== -1 && idx && tokens[idx - 1].hidden) {\n    result += '\\n';\n  }\n\n  // Add token name, e.g. `<img`\n  result += (token.nesting === -1 ? '</' : '<') + token.tag;\n\n  // Encode attributes, e.g. `<img src=\"foo\"`\n  result += this.renderAttrs(token);\n\n  // Add a slash for self-closing tags, e.g. `<img src=\"foo\" /`\n  if (token.nesting === 0 && options.xhtmlOut) {\n    result += ' /';\n  }\n\n  // Check if we need to add a newline after this tag\n  if (token.block) {\n    needLf = true;\n\n    if (token.nesting === 1) {\n      if (idx + 1 < tokens.length) {\n        nextToken = tokens[idx + 1];\n\n        if (nextToken.type === 'inline' || nextToken.hidden) {\n          // Block-level tag containing an inline tag.\n          //\n          needLf = false;\n\n        } else if (nextToken.nesting === -1 && nextToken.tag === token.tag) {\n          // Opening tag + closing tag of the same type. E.g. `<li></li>`.\n          //\n          needLf = false;\n        }\n      }\n    }\n  }\n\n  result += needLf ? '>\\n' : '>';\n\n  return result;\n};\n\n\n/**\n * Renderer.renderInline(tokens, options, env) -> String\n * - tokens (Array): list on block tokens to renter\n * - options (Object): params of parser instance\n * - env (Object): additional data from parsed input (references, for example)\n *\n * The same as [[Renderer.render]], but for single token of `inline` type.\n **/\nRenderer.prototype.renderInline = function (tokens, options, env) {\n  var type,\n      result = '',\n      rules = this.rules;\n\n  for (var i = 0, len = tokens.length; i < len; i++) {\n    type = tokens[i].type;\n\n    if (typeof rules[type] !== 'undefined') {\n      result += rules[type](tokens, i, options, env, this);\n    } else {\n      result += this.renderToken(tokens, i, options);\n    }\n  }\n\n  return result;\n};\n\n\n/** internal\n * Renderer.renderInlineAsText(tokens, options, env) -> String\n * - tokens (Array): list on block tokens to renter\n * - options (Object): params of parser instance\n * - env (Object): additional data from parsed input (references, for example)\n *\n * Special kludge for image `alt` attributes to conform CommonMark spec.\n * Don't try to use it! Spec requires to show `alt` content with stripped markup,\n * instead of simple escaping.\n **/\nRenderer.prototype.renderInlineAsText = function (tokens, options, env) {\n  var result = '';\n\n  for (var i = 0, len = tokens.length; i < len; i++) {\n    if (tokens[i].type === 'text') {\n      result += tokens[i].content;\n    } else if (tokens[i].type === 'image') {\n      result += this.renderInlineAsText(tokens[i].children, options, env);\n    }\n  }\n\n  return result;\n};\n\n\n/**\n * Renderer.render(tokens, options, env) -> String\n * - tokens (Array): list on block tokens to renter\n * - options (Object): params of parser instance\n * - env (Object): additional data from parsed input (references, for example)\n *\n * Takes token stream and generates HTML. Probably, you will never need to call\n * this method directly.\n **/\nRenderer.prototype.render = function (tokens, options, env) {\n  var i, len, type,\n      result = '',\n      rules = this.rules;\n\n  for (i = 0, len = tokens.length; i < len; i++) {\n    type = tokens[i].type;\n\n    if (type === 'inline') {\n      result += this.renderInline(tokens[i].children, options, env);\n    } else if (typeof rules[type] !== 'undefined') {\n      result += rules[tokens[i].type](tokens, i, options, env, this);\n    } else {\n      result += this.renderToken(tokens, i, options, env);\n    }\n  }\n\n  return result;\n};\n\nmodule.exports = Renderer;\n","/** internal\n * class Core\n *\n * Top-level rules executor. Glues block/inline parsers and does intermediate\n * transformations.\n **/\n'use strict';\n\n\nvar Ruler  = require('./ruler');\n\n\nvar _rules = [\n  [ 'normalize',      require('./rules_core/normalize')      ],\n  [ 'block',          require('./rules_core/block')          ],\n  [ 'inline',         require('./rules_core/inline')         ],\n  [ 'linkify',        require('./rules_core/linkify')        ],\n  [ 'replacements',   require('./rules_core/replacements')   ],\n  [ 'smartquotes',    require('./rules_core/smartquotes')    ]\n];\n\n\n/**\n * new Core()\n **/\nfunction Core() {\n  /**\n   * Core#ruler -> Ruler\n   *\n   * [[Ruler]] instance. Keep configuration of core rules.\n   **/\n  this.ruler = new Ruler();\n\n  for (var i = 0; i < _rules.length; i++) {\n    this.ruler.push(_rules[i][0], _rules[i][1]);\n  }\n}\n\n\n/**\n * Core.process(state)\n *\n * Executes core chain rules.\n **/\nCore.prototype.process = function (state) {\n  var i, l, rules;\n\n  rules = this.ruler.getRules('');\n\n  for (i = 0, l = rules.length; i < l; i++) {\n    rules[i](state);\n  }\n};\n\nCore.prototype.State = require('./rules_core/state_core');\n\n\nmodule.exports = Core;\n","// Normalize input string\n\n'use strict';\n\n\nvar NEWLINES_RE  = /\\r[\\n\\u0085]?|[\\u2424\\u2028\\u0085]/g;\nvar NULL_RE      = /\\u0000/g;\n\n\nmodule.exports = function inline(state) {\n  var str;\n\n  // Normalize newlines\n  str = state.src.replace(NEWLINES_RE, '\\n');\n\n  // Replace NULL characters\n  str = str.replace(NULL_RE, '\\uFFFD');\n\n  state.src = str;\n};\n","'use strict';\n\n\nmodule.exports = function block(state) {\n  var token;\n\n  if (state.inlineMode) {\n    token          = new state.Token('inline', '', 0);\n    token.content  = state.src;\n    token.map      = [ 0, 1 ];\n    token.children = [];\n    state.tokens.push(token);\n  } else {\n    state.md.block.parse(state.src, state.md, state.env, state.tokens);\n  }\n};\n","'use strict';\n\nmodule.exports = function inline(state) {\n  var tokens = state.tokens, tok, i, l;\n\n  // Parse inlines\n  for (i = 0, l = tokens.length; i < l; i++) {\n    tok = tokens[i];\n    if (tok.type === 'inline') {\n      state.md.inline.parse(tok.content, state.md, state.env, tok.children);\n    }\n  }\n};\n","// Replace link-like texts with link nodes.\n//\n// Currently restricted by `md.validateLink()` to http/https/ftp\n//\n'use strict';\n\n\nvar arrayReplaceAt = require('../common/utils').arrayReplaceAt;\n\n\nfunction isLinkOpen(str) {\n  return /^<a[>\\s]/i.test(str);\n}\nfunction isLinkClose(str) {\n  return /^<\\/a\\s*>/i.test(str);\n}\n\n\nmodule.exports = function linkify(state) {\n  var i, j, l, tokens, token, currentToken, nodes, ln, text, pos, lastPos,\n      level, htmlLinkLevel, url, fullUrl, urlText,\n      blockTokens = state.tokens,\n      links;\n\n  if (!state.md.options.linkify) { return; }\n\n  for (j = 0, l = blockTokens.length; j < l; j++) {\n    if (blockTokens[j].type !== 'inline' ||\n        !state.md.linkify.pretest(blockTokens[j].content)) {\n      continue;\n    }\n\n    tokens = blockTokens[j].children;\n\n    htmlLinkLevel = 0;\n\n    // We scan from the end, to keep position when new tags added.\n    // Use reversed logic in links start/end match\n    for (i = tokens.length - 1; i >= 0; i--) {\n      currentToken = tokens[i];\n\n      // Skip content of markdown links\n      if (currentToken.type === 'link_close') {\n        i--;\n        while (tokens[i].level !== currentToken.level && tokens[i].type !== 'link_open') {\n          i--;\n        }\n        continue;\n      }\n\n      // Skip content of html tag links\n      if (currentToken.type === 'html_inline') {\n        if (isLinkOpen(currentToken.content) && htmlLinkLevel > 0) {\n          htmlLinkLevel--;\n        }\n        if (isLinkClose(currentToken.content)) {\n          htmlLinkLevel++;\n        }\n      }\n      if (htmlLinkLevel > 0) { continue; }\n\n      if (currentToken.type === 'text' && state.md.linkify.test(currentToken.content)) {\n\n        text = currentToken.content;\n        links = state.md.linkify.match(text);\n\n        // Now split string to nodes\n        nodes = [];\n        level = currentToken.level;\n        lastPos = 0;\n\n        for (ln = 0; ln < links.length; ln++) {\n\n          url = links[ln].url;\n          fullUrl = state.md.normalizeLink(url);\n          if (!state.md.validateLink(fullUrl)) { continue; }\n\n          urlText = links[ln].text;\n\n          // Linkifier might send raw hostnames like \"example.com\", where url\n          // starts with domain name. So we prepend http:// in those cases,\n          // and remove it afterwards.\n          //\n          if (!links[ln].schema) {\n            urlText = state.md.normalizeLinkText('http://' + urlText).replace(/^http:\\/\\//, '');\n          } else if (links[ln].schema === 'mailto:' && !/^mailto:/i.test(urlText)) {\n            urlText = state.md.normalizeLinkText('mailto:' + urlText).replace(/^mailto:/, '');\n          } else {\n            urlText = state.md.normalizeLinkText(urlText);\n          }\n\n          pos = links[ln].index;\n\n          if (pos > lastPos) {\n            token         = new state.Token('text', '', 0);\n            token.content = text.slice(lastPos, pos);\n            token.level   = level;\n            nodes.push(token);\n          }\n\n          token         = new state.Token('link_open', 'a', 1);\n          token.attrs   = [ [ 'href', fullUrl ] ];\n          token.level   = level++;\n          token.markup  = 'linkify';\n          token.info    = 'auto';\n          nodes.push(token);\n\n          token         = new state.Token('text', '', 0);\n          token.content = urlText;\n          token.level   = level;\n          nodes.push(token);\n\n          token         = new state.Token('link_close', 'a', -1);\n          token.level   = --level;\n          token.markup  = 'linkify';\n          token.info    = 'auto';\n          nodes.push(token);\n\n          lastPos = links[ln].lastIndex;\n        }\n        if (lastPos < text.length) {\n          token         = new state.Token('text', '', 0);\n          token.content = text.slice(lastPos);\n          token.level   = level;\n          nodes.push(token);\n        }\n\n        // replace current node\n        blockTokens[j].children = tokens = arrayReplaceAt(tokens, i, nodes);\n      }\n    }\n  }\n};\n","// Simple typographyc replacements\n//\n// (c) (C) → ©\n// (tm) (TM) → ™\n// (r) (R) → ®\n// +- → ±\n// (p) (P) -> §\n// ... → … (also ?.... → ?.., !.... → !..)\n// ???????? → ???, !!!!! → !!!, `,,` → `,`\n// -- → &ndash;, --- → &mdash;\n//\n'use strict';\n\n// TODO:\n// - fractionals 1/2, 1/4, 3/4 -> ½, ¼, ¾\n// - miltiplication 2 x 4 -> 2 × 4\n\nvar RARE_RE = /\\+-|\\.\\.|\\?\\?\\?\\?|!!!!|,,|--/;\n\n// Workaround for phantomjs - need regex without /g flag,\n// or root check will fail every second time\nvar SCOPED_ABBR_TEST_RE = /\\((c|tm|r|p)\\)/i;\n\nvar SCOPED_ABBR_RE = /\\((c|tm|r|p)\\)/ig;\nvar SCOPED_ABBR = {\n  c: '©',\n  r: '®',\n  p: '§',\n  tm: '™'\n};\n\nfunction replaceFn(match, name) {\n  return SCOPED_ABBR[name.toLowerCase()];\n}\n\nfunction replace_scoped(inlineTokens) {\n  var i, token, inside_autolink = 0;\n\n  for (i = inlineTokens.length - 1; i >= 0; i--) {\n    token = inlineTokens[i];\n\n    if (token.type === 'text' && !inside_autolink) {\n      token.content = token.content.replace(SCOPED_ABBR_RE, replaceFn);\n    }\n\n    if (token.type === 'link_open' && token.info === 'auto') {\n      inside_autolink--;\n    }\n\n    if (token.type === 'link_close' && token.info === 'auto') {\n      inside_autolink++;\n    }\n  }\n}\n\nfunction replace_rare(inlineTokens) {\n  var i, token, inside_autolink = 0;\n\n  for (i = inlineTokens.length - 1; i >= 0; i--) {\n    token = inlineTokens[i];\n\n    if (token.type === 'text' && !inside_autolink) {\n      if (RARE_RE.test(token.content)) {\n        token.content = token.content\n                    .replace(/\\+-/g, '±')\n                    // .., ..., ....... -> …\n                    // but ?..... & !..... -> ?.. & !..\n                    .replace(/\\.{2,}/g, '…').replace(/([?!])…/g, '$1..')\n                    .replace(/([?!]){4,}/g, '$1$1$1').replace(/,{2,}/g, ',')\n                    // em-dash\n                    .replace(/(^|[^-])---([^-]|$)/mg, '$1\\u2014$2')\n                    // en-dash\n                    .replace(/(^|\\s)--(\\s|$)/mg, '$1\\u2013$2')\n                    .replace(/(^|[^-\\s])--([^-\\s]|$)/mg, '$1\\u2013$2');\n      }\n    }\n\n    if (token.type === 'link_open' && token.info === 'auto') {\n      inside_autolink--;\n    }\n\n    if (token.type === 'link_close' && token.info === 'auto') {\n      inside_autolink++;\n    }\n  }\n}\n\n\nmodule.exports = function replace(state) {\n  var blkIdx;\n\n  if (!state.md.options.typographer) { return; }\n\n  for (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {\n\n    if (state.tokens[blkIdx].type !== 'inline') { continue; }\n\n    if (SCOPED_ABBR_TEST_RE.test(state.tokens[blkIdx].content)) {\n      replace_scoped(state.tokens[blkIdx].children);\n    }\n\n    if (RARE_RE.test(state.tokens[blkIdx].content)) {\n      replace_rare(state.tokens[blkIdx].children);\n    }\n\n  }\n};\n","// Convert straight quotation marks to typographic ones\n//\n'use strict';\n\n\nvar isWhiteSpace   = require('../common/utils').isWhiteSpace;\nvar isPunctChar    = require('../common/utils').isPunctChar;\nvar isMdAsciiPunct = require('../common/utils').isMdAsciiPunct;\n\nvar QUOTE_TEST_RE = /['\"]/;\nvar QUOTE_RE = /['\"]/g;\nvar APOSTROPHE = '\\u2019'; /* ’ */\n\n\nfunction replaceAt(str, index, ch) {\n  return str.substr(0, index) + ch + str.substr(index + 1);\n}\n\nfunction process_inlines(tokens, state) {\n  var i, token, text, t, pos, max, thisLevel, item, lastChar, nextChar,\n      isLastPunctChar, isNextPunctChar, isLastWhiteSpace, isNextWhiteSpace,\n      canOpen, canClose, j, isSingle, stack, openQuote, closeQuote;\n\n  stack = [];\n\n  for (i = 0; i < tokens.length; i++) {\n    token = tokens[i];\n\n    thisLevel = tokens[i].level;\n\n    for (j = stack.length - 1; j >= 0; j--) {\n      if (stack[j].level <= thisLevel) { break; }\n    }\n    stack.length = j + 1;\n\n    if (token.type !== 'text') { continue; }\n\n    text = token.content;\n    pos = 0;\n    max = text.length;\n\n    /*eslint no-labels:0,block-scoped-var:0*/\n    OUTER:\n    while (pos < max) {\n      QUOTE_RE.lastIndex = pos;\n      t = QUOTE_RE.exec(text);\n      if (!t) { break; }\n\n      canOpen = canClose = true;\n      pos = t.index + 1;\n      isSingle = (t[0] === \"'\");\n\n      // Find previous character,\n      // default to space if it's the beginning of the line\n      //\n      lastChar = 0x20;\n\n      if (t.index - 1 >= 0) {\n        lastChar = text.charCodeAt(t.index - 1);\n      } else {\n        for (j = i - 1; j >= 0; j--) {\n          if (tokens[j].type === 'softbreak' || tokens[j].type === 'hardbreak') break; // lastChar defaults to 0x20\n          if (tokens[j].type !== 'text') continue;\n\n          lastChar = tokens[j].content.charCodeAt(tokens[j].content.length - 1);\n          break;\n        }\n      }\n\n      // Find next character,\n      // default to space if it's the end of the line\n      //\n      nextChar = 0x20;\n\n      if (pos < max) {\n        nextChar = text.charCodeAt(pos);\n      } else {\n        for (j = i + 1; j < tokens.length; j++) {\n          if (tokens[j].type === 'softbreak' || tokens[j].type === 'hardbreak') break; // nextChar defaults to 0x20\n          if (tokens[j].type !== 'text') continue;\n\n          nextChar = tokens[j].content.charCodeAt(0);\n          break;\n        }\n      }\n\n      isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctChar(String.fromCharCode(lastChar));\n      isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctChar(String.fromCharCode(nextChar));\n\n      isLastWhiteSpace = isWhiteSpace(lastChar);\n      isNextWhiteSpace = isWhiteSpace(nextChar);\n\n      if (isNextWhiteSpace) {\n        canOpen = false;\n      } else if (isNextPunctChar) {\n        if (!(isLastWhiteSpace || isLastPunctChar)) {\n          canOpen = false;\n        }\n      }\n\n      if (isLastWhiteSpace) {\n        canClose = false;\n      } else if (isLastPunctChar) {\n        if (!(isNextWhiteSpace || isNextPunctChar)) {\n          canClose = false;\n        }\n      }\n\n      if (nextChar === 0x22 /* \" */ && t[0] === '\"') {\n        if (lastChar >= 0x30 /* 0 */ && lastChar <= 0x39 /* 9 */) {\n          // special case: 1\"\" - count first quote as an inch\n          canClose = canOpen = false;\n        }\n      }\n\n      if (canOpen && canClose) {\n        // treat this as the middle of the word\n        canOpen = false;\n        canClose = isNextPunctChar;\n      }\n\n      if (!canOpen && !canClose) {\n        // middle of word\n        if (isSingle) {\n          token.content = replaceAt(token.content, t.index, APOSTROPHE);\n        }\n        continue;\n      }\n\n      if (canClose) {\n        // this could be a closing quote, rewind the stack to get a match\n        for (j = stack.length - 1; j >= 0; j--) {\n          item = stack[j];\n          if (stack[j].level < thisLevel) { break; }\n          if (item.single === isSingle && stack[j].level === thisLevel) {\n            item = stack[j];\n\n            if (isSingle) {\n              openQuote = state.md.options.quotes[2];\n              closeQuote = state.md.options.quotes[3];\n            } else {\n              openQuote = state.md.options.quotes[0];\n              closeQuote = state.md.options.quotes[1];\n            }\n\n            // replace token.content *before* tokens[item.token].content,\n            // because, if they are pointing at the same token, replaceAt\n            // could mess up indices when quote length != 1\n            token.content = replaceAt(token.content, t.index, closeQuote);\n            tokens[item.token].content = replaceAt(\n              tokens[item.token].content, item.pos, openQuote);\n\n            pos += closeQuote.length - 1;\n            if (item.token === i) { pos += openQuote.length - 1; }\n\n            text = token.content;\n            max = text.length;\n\n            stack.length = j;\n            continue OUTER;\n          }\n        }\n      }\n\n      if (canOpen) {\n        stack.push({\n          token: i,\n          pos: t.index,\n          single: isSingle,\n          level: thisLevel\n        });\n      } else if (canClose && isSingle) {\n        token.content = replaceAt(token.content, t.index, APOSTROPHE);\n      }\n    }\n  }\n}\n\n\nmodule.exports = function smartquotes(state) {\n  /*eslint max-depth:0*/\n  var blkIdx;\n\n  if (!state.md.options.typographer) { return; }\n\n  for (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {\n\n    if (state.tokens[blkIdx].type !== 'inline' ||\n        !QUOTE_TEST_RE.test(state.tokens[blkIdx].content)) {\n      continue;\n    }\n\n    process_inlines(state.tokens[blkIdx].children, state);\n  }\n};\n","// Core state object\n//\n'use strict';\n\nvar Token = require('../token');\n\n\nfunction StateCore(src, md, env) {\n  this.src = src;\n  this.env = env;\n  this.tokens = [];\n  this.inlineMode = false;\n  this.md = md; // link to parser instance\n}\n\n// re-export Token class to use in core rules\nStateCore.prototype.Token = Token;\n\n\nmodule.exports = StateCore;\n","/** internal\n * class ParserBlock\n *\n * Block-level tokenizer.\n **/\n'use strict';\n\n\nvar Ruler           = require('./ruler');\n\n\nvar _rules = [\n  // First 2 params - rule name & source. Secondary array - list of rules,\n  // which can be terminated by this one.\n  [ 'table',      require('./rules_block/table'),      [ 'paragraph', 'reference' ] ],\n  [ 'code',       require('./rules_block/code') ],\n  [ 'fence',      require('./rules_block/fence'),      [ 'paragraph', 'reference', 'blockquote', 'list' ] ],\n  [ 'blockquote', require('./rules_block/blockquote'), [ 'paragraph', 'reference', 'blockquote', 'list' ] ],\n  [ 'hr',         require('./rules_block/hr'),         [ 'paragraph', 'reference', 'blockquote', 'list' ] ],\n  [ 'list',       require('./rules_block/list'),       [ 'paragraph', 'reference', 'blockquote' ] ],\n  [ 'reference',  require('./rules_block/reference') ],\n  [ 'heading',    require('./rules_block/heading'),    [ 'paragraph', 'reference', 'blockquote' ] ],\n  [ 'lheading',   require('./rules_block/lheading') ],\n  [ 'html_block', require('./rules_block/html_block'), [ 'paragraph', 'reference', 'blockquote' ] ],\n  [ 'paragraph',  require('./rules_block/paragraph') ]\n];\n\n\n/**\n * new ParserBlock()\n **/\nfunction ParserBlock() {\n  /**\n   * ParserBlock#ruler -> Ruler\n   *\n   * [[Ruler]] instance. Keep configuration of block rules.\n   **/\n  this.ruler = new Ruler();\n\n  for (var i = 0; i < _rules.length; i++) {\n    this.ruler.push(_rules[i][0], _rules[i][1], { alt: (_rules[i][2] || []).slice() });\n  }\n}\n\n\n// Generate tokens for input range\n//\nParserBlock.prototype.tokenize = function (state, startLine, endLine) {\n  var ok, i,\n      rules = this.ruler.getRules(''),\n      len = rules.length,\n      line = startLine,\n      hasEmptyLines = false,\n      maxNesting = state.md.options.maxNesting;\n\n  while (line < endLine) {\n    state.line = line = state.skipEmptyLines(line);\n    if (line >= endLine) { break; }\n\n    // Termination condition for nested calls.\n    // Nested calls currently used for blockquotes & lists\n    if (state.sCount[line] < state.blkIndent) { break; }\n\n    // If nesting level exceeded - skip tail to the end. That's not ordinary\n    // situation and we should not care about content.\n    if (state.level >= maxNesting) {\n      state.line = endLine;\n      break;\n    }\n\n    // Try all possible rules.\n    // On success, rule should:\n    //\n    // - update `state.line`\n    // - update `state.tokens`\n    // - return true\n\n    for (i = 0; i < len; i++) {\n      ok = rules[i](state, line, endLine, false);\n      if (ok) { break; }\n    }\n\n    // set state.tight if we had an empty line before current tag\n    // i.e. latest empty line should not count\n    state.tight = !hasEmptyLines;\n\n    // paragraph might \"eat\" one newline after it in nested lists\n    if (state.isEmpty(state.line - 1)) {\n      hasEmptyLines = true;\n    }\n\n    line = state.line;\n\n    if (line < endLine && state.isEmpty(line)) {\n      hasEmptyLines = true;\n      line++;\n      state.line = line;\n    }\n  }\n};\n\n\n/**\n * ParserBlock.parse(str, md, env, outTokens)\n *\n * Process input string and push block tokens into `outTokens`\n **/\nParserBlock.prototype.parse = function (src, md, env, outTokens) {\n  var state;\n\n  if (!src) { return; }\n\n  state = new this.State(src, md, env, outTokens);\n\n  this.tokenize(state, state.line, state.lineMax);\n};\n\n\nParserBlock.prototype.State = require('./rules_block/state_block');\n\n\nmodule.exports = ParserBlock;\n","// GFM table, non-standard\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nfunction getLine(state, line) {\n  var pos = state.bMarks[line] + state.blkIndent,\n      max = state.eMarks[line];\n\n  return state.src.substr(pos, max - pos);\n}\n\nfunction escapedSplit(str) {\n  var result = [],\n      pos = 0,\n      max = str.length,\n      ch,\n      escapes = 0,\n      lastPos = 0,\n      backTicked = false,\n      lastBackTick = 0;\n\n  ch  = str.charCodeAt(pos);\n\n  while (pos < max) {\n    if (ch === 0x60/* ` */) {\n      if (backTicked) {\n        // make \\` close code sequence, but not open it;\n        // the reason is: `\\` is correct code block\n        backTicked = false;\n        lastBackTick = pos;\n      } else if (escapes % 2 === 0) {\n        backTicked = true;\n        lastBackTick = pos;\n      }\n    } else if (ch === 0x7c/* | */ && (escapes % 2 === 0) && !backTicked) {\n      result.push(str.substring(lastPos, pos));\n      lastPos = pos + 1;\n    }\n\n    if (ch === 0x5c/* \\ */) {\n      escapes++;\n    } else {\n      escapes = 0;\n    }\n\n    pos++;\n\n    // If there was an un-closed backtick, go back to just after\n    // the last backtick, but as if it was a normal character\n    if (pos === max && backTicked) {\n      backTicked = false;\n      pos = lastBackTick + 1;\n    }\n\n    ch = str.charCodeAt(pos);\n  }\n\n  result.push(str.substring(lastPos));\n\n  return result;\n}\n\n\nmodule.exports = function table(state, startLine, endLine, silent) {\n  var ch, lineText, pos, i, nextLine, columns, columnCount, token,\n      aligns, t, tableLines, tbodyLines;\n\n  // should have at least two lines\n  if (startLine + 2 > endLine) { return false; }\n\n  nextLine = startLine + 1;\n\n  if (state.sCount[nextLine] < state.blkIndent) { return false; }\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[nextLine] - state.blkIndent >= 4) { return false; }\n\n  // first character of the second line should be '|', '-', ':',\n  // and no other characters are allowed but spaces;\n  // basically, this is the equivalent of /^[-:|][-:|\\s]*$/ regexp\n\n  pos = state.bMarks[nextLine] + state.tShift[nextLine];\n  if (pos >= state.eMarks[nextLine]) { return false; }\n\n  ch = state.src.charCodeAt(pos++);\n  if (ch !== 0x7C/* | */ && ch !== 0x2D/* - */ && ch !== 0x3A/* : */) { return false; }\n\n  while (pos < state.eMarks[nextLine]) {\n    ch = state.src.charCodeAt(pos);\n\n    if (ch !== 0x7C/* | */ && ch !== 0x2D/* - */ && ch !== 0x3A/* : */ && !isSpace(ch)) { return false; }\n\n    pos++;\n  }\n\n  lineText = getLine(state, startLine + 1);\n\n  columns = lineText.split('|');\n  aligns = [];\n  for (i = 0; i < columns.length; i++) {\n    t = columns[i].trim();\n    if (!t) {\n      // allow empty columns before and after table, but not in between columns;\n      // e.g. allow ` |---| `, disallow ` ---||--- `\n      if (i === 0 || i === columns.length - 1) {\n        continue;\n      } else {\n        return false;\n      }\n    }\n\n    if (!/^:?-+:?$/.test(t)) { return false; }\n    if (t.charCodeAt(t.length - 1) === 0x3A/* : */) {\n      aligns.push(t.charCodeAt(0) === 0x3A/* : */ ? 'center' : 'right');\n    } else if (t.charCodeAt(0) === 0x3A/* : */) {\n      aligns.push('left');\n    } else {\n      aligns.push('');\n    }\n  }\n\n  lineText = getLine(state, startLine).trim();\n  if (lineText.indexOf('|') === -1) { return false; }\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n  columns = escapedSplit(lineText.replace(/^\\||\\|$/g, ''));\n\n  // header row will define an amount of columns in the entire table,\n  // and align row shouldn't be smaller than that (the rest of the rows can)\n  columnCount = columns.length;\n  if (columnCount > aligns.length) { return false; }\n\n  if (silent) { return true; }\n\n  token     = state.push('table_open', 'table', 1);\n  token.map = tableLines = [ startLine, 0 ];\n\n  token     = state.push('thead_open', 'thead', 1);\n  token.map = [ startLine, startLine + 1 ];\n\n  token     = state.push('tr_open', 'tr', 1);\n  token.map = [ startLine, startLine + 1 ];\n\n  for (i = 0; i < columns.length; i++) {\n    token          = state.push('th_open', 'th', 1);\n    token.map      = [ startLine, startLine + 1 ];\n    if (aligns[i]) {\n      token.attrs  = [ [ 'style', 'text-align:' + aligns[i] ] ];\n    }\n\n    token          = state.push('inline', '', 0);\n    token.content  = columns[i].trim();\n    token.map      = [ startLine, startLine + 1 ];\n    token.children = [];\n\n    token          = state.push('th_close', 'th', -1);\n  }\n\n  token     = state.push('tr_close', 'tr', -1);\n  token     = state.push('thead_close', 'thead', -1);\n\n  token     = state.push('tbody_open', 'tbody', 1);\n  token.map = tbodyLines = [ startLine + 2, 0 ];\n\n  for (nextLine = startLine + 2; nextLine < endLine; nextLine++) {\n    if (state.sCount[nextLine] < state.blkIndent) { break; }\n\n    lineText = getLine(state, nextLine).trim();\n    if (lineText.indexOf('|') === -1) { break; }\n    if (state.sCount[nextLine] - state.blkIndent >= 4) { break; }\n    columns = escapedSplit(lineText.replace(/^\\||\\|$/g, ''));\n\n    token = state.push('tr_open', 'tr', 1);\n    for (i = 0; i < columnCount; i++) {\n      token          = state.push('td_open', 'td', 1);\n      if (aligns[i]) {\n        token.attrs  = [ [ 'style', 'text-align:' + aligns[i] ] ];\n      }\n\n      token          = state.push('inline', '', 0);\n      token.content  = columns[i] ? columns[i].trim() : '';\n      token.children = [];\n\n      token          = state.push('td_close', 'td', -1);\n    }\n    token = state.push('tr_close', 'tr', -1);\n  }\n  token = state.push('tbody_close', 'tbody', -1);\n  token = state.push('table_close', 'table', -1);\n\n  tableLines[1] = tbodyLines[1] = nextLine;\n  state.line = nextLine;\n  return true;\n};\n","// Code block (4 spaces padded)\n\n'use strict';\n\n\nmodule.exports = function code(state, startLine, endLine/*, silent*/) {\n  var nextLine, last, token;\n\n  if (state.sCount[startLine] - state.blkIndent < 4) { return false; }\n\n  last = nextLine = startLine + 1;\n\n  while (nextLine < endLine) {\n    if (state.isEmpty(nextLine)) {\n      nextLine++;\n      continue;\n    }\n\n    if (state.sCount[nextLine] - state.blkIndent >= 4) {\n      nextLine++;\n      last = nextLine;\n      continue;\n    }\n    break;\n  }\n\n  state.line = last;\n\n  token         = state.push('code_block', 'code', 0);\n  token.content = state.getLines(startLine, last, 4 + state.blkIndent, true);\n  token.map     = [ startLine, state.line ];\n\n  return true;\n};\n","// fences (``` lang, ~~~ lang)\n\n'use strict';\n\n\nmodule.exports = function fence(state, startLine, endLine, silent) {\n  var marker, len, params, nextLine, mem, token, markup,\n      haveEndMarker = false,\n      pos = state.bMarks[startLine] + state.tShift[startLine],\n      max = state.eMarks[startLine];\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  if (pos + 3 > max) { return false; }\n\n  marker = state.src.charCodeAt(pos);\n\n  if (marker !== 0x7E/* ~ */ && marker !== 0x60 /* ` */) {\n    return false;\n  }\n\n  // scan marker length\n  mem = pos;\n  pos = state.skipChars(pos, marker);\n\n  len = pos - mem;\n\n  if (len < 3) { return false; }\n\n  markup = state.src.slice(mem, pos);\n  params = state.src.slice(pos, max);\n\n  if (params.indexOf(String.fromCharCode(marker)) >= 0) { return false; }\n\n  // Since start is found, we can report success here in validation mode\n  if (silent) { return true; }\n\n  // search end of block\n  nextLine = startLine;\n\n  for (;;) {\n    nextLine++;\n    if (nextLine >= endLine) {\n      // unclosed block should be autoclosed by end of document.\n      // also block seems to be autoclosed by end of parent\n      break;\n    }\n\n    pos = mem = state.bMarks[nextLine] + state.tShift[nextLine];\n    max = state.eMarks[nextLine];\n\n    if (pos < max && state.sCount[nextLine] < state.blkIndent) {\n      // non-empty line with negative indent should stop the list:\n      // - ```\n      //  test\n      break;\n    }\n\n    if (state.src.charCodeAt(pos) !== marker) { continue; }\n\n    if (state.sCount[nextLine] - state.blkIndent >= 4) {\n      // closing fence should be indented less than 4 spaces\n      continue;\n    }\n\n    pos = state.skipChars(pos, marker);\n\n    // closing code fence must be at least as long as the opening one\n    if (pos - mem < len) { continue; }\n\n    // make sure tail has spaces only\n    pos = state.skipSpaces(pos);\n\n    if (pos < max) { continue; }\n\n    haveEndMarker = true;\n    // found!\n    break;\n  }\n\n  // If a fence has heading spaces, they should be removed from its inner block\n  len = state.sCount[startLine];\n\n  state.line = nextLine + (haveEndMarker ? 1 : 0);\n\n  token         = state.push('fence', 'code', 0);\n  token.info    = params;\n  token.content = state.getLines(startLine + 1, nextLine, len, true);\n  token.markup  = markup;\n  token.map     = [ startLine, state.line ];\n\n  return true;\n};\n","// Block quotes\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function blockquote(state, startLine, endLine, silent) {\n  var adjustTab,\n      ch,\n      i,\n      initial,\n      l,\n      lastLineEmpty,\n      lines,\n      nextLine,\n      offset,\n      oldBMarks,\n      oldBSCount,\n      oldIndent,\n      oldParentType,\n      oldSCount,\n      oldTShift,\n      spaceAfterMarker,\n      terminate,\n      terminatorRules,\n      token,\n      wasOutdented,\n      oldLineMax = state.lineMax,\n      pos = state.bMarks[startLine] + state.tShift[startLine],\n      max = state.eMarks[startLine];\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  // check the block quote marker\n  if (state.src.charCodeAt(pos++) !== 0x3E/* > */) { return false; }\n\n  // we know that it's going to be a valid blockquote,\n  // so no point trying to find the end of it in silent mode\n  if (silent) { return true; }\n\n  // skip spaces after \">\" and re-calculate offset\n  initial = offset = state.sCount[startLine] + pos - (state.bMarks[startLine] + state.tShift[startLine]);\n\n  // skip one optional space after '>'\n  if (state.src.charCodeAt(pos) === 0x20 /* space */) {\n    // ' >   test '\n    //     ^ -- position start of line here:\n    pos++;\n    initial++;\n    offset++;\n    adjustTab = false;\n    spaceAfterMarker = true;\n  } else if (state.src.charCodeAt(pos) === 0x09 /* tab */) {\n    spaceAfterMarker = true;\n\n    if ((state.bsCount[startLine] + offset) % 4 === 3) {\n      // '  >\\t  test '\n      //       ^ -- position start of line here (tab has width===1)\n      pos++;\n      initial++;\n      offset++;\n      adjustTab = false;\n    } else {\n      // ' >\\t  test '\n      //    ^ -- position start of line here + shift bsCount slightly\n      //         to make extra space appear\n      adjustTab = true;\n    }\n  } else {\n    spaceAfterMarker = false;\n  }\n\n  oldBMarks = [ state.bMarks[startLine] ];\n  state.bMarks[startLine] = pos;\n\n  while (pos < max) {\n    ch = state.src.charCodeAt(pos);\n\n    if (isSpace(ch)) {\n      if (ch === 0x09) {\n        offset += 4 - (offset + state.bsCount[startLine] + (adjustTab ? 1 : 0)) % 4;\n      } else {\n        offset++;\n      }\n    } else {\n      break;\n    }\n\n    pos++;\n  }\n\n  oldBSCount = [ state.bsCount[startLine] ];\n  state.bsCount[startLine] = state.sCount[startLine] + 1 + (spaceAfterMarker ? 1 : 0);\n\n  lastLineEmpty = pos >= max;\n\n  oldSCount = [ state.sCount[startLine] ];\n  state.sCount[startLine] = offset - initial;\n\n  oldTShift = [ state.tShift[startLine] ];\n  state.tShift[startLine] = pos - state.bMarks[startLine];\n\n  terminatorRules = state.md.block.ruler.getRules('blockquote');\n\n  oldParentType = state.parentType;\n  state.parentType = 'blockquote';\n  wasOutdented = false;\n\n  // Search the end of the block\n  //\n  // Block ends with either:\n  //  1. an empty line outside:\n  //     ```\n  //     > test\n  //\n  //     ```\n  //  2. an empty line inside:\n  //     ```\n  //     >\n  //     test\n  //     ```\n  //  3. another tag:\n  //     ```\n  //     > test\n  //      - - -\n  //     ```\n  for (nextLine = startLine + 1; nextLine < endLine; nextLine++) {\n    // check if it's outdented, i.e. it's inside list item and indented\n    // less than said list item:\n    //\n    // ```\n    // 1. anything\n    //    > current blockquote\n    // 2. checking this line\n    // ```\n    if (state.sCount[nextLine] < state.blkIndent) wasOutdented = true;\n\n    pos = state.bMarks[nextLine] + state.tShift[nextLine];\n    max = state.eMarks[nextLine];\n\n    if (pos >= max) {\n      // Case 1: line is not inside the blockquote, and this line is empty.\n      break;\n    }\n\n    if (state.src.charCodeAt(pos++) === 0x3E/* > */ && !wasOutdented) {\n      // This line is inside the blockquote.\n\n      // skip spaces after \">\" and re-calculate offset\n      initial = offset = state.sCount[nextLine] + pos - (state.bMarks[nextLine] + state.tShift[nextLine]);\n\n      // skip one optional space after '>'\n      if (state.src.charCodeAt(pos) === 0x20 /* space */) {\n        // ' >   test '\n        //     ^ -- position start of line here:\n        pos++;\n        initial++;\n        offset++;\n        adjustTab = false;\n        spaceAfterMarker = true;\n      } else if (state.src.charCodeAt(pos) === 0x09 /* tab */) {\n        spaceAfterMarker = true;\n\n        if ((state.bsCount[nextLine] + offset) % 4 === 3) {\n          // '  >\\t  test '\n          //       ^ -- position start of line here (tab has width===1)\n          pos++;\n          initial++;\n          offset++;\n          adjustTab = false;\n        } else {\n          // ' >\\t  test '\n          //    ^ -- position start of line here + shift bsCount slightly\n          //         to make extra space appear\n          adjustTab = true;\n        }\n      } else {\n        spaceAfterMarker = false;\n      }\n\n      oldBMarks.push(state.bMarks[nextLine]);\n      state.bMarks[nextLine] = pos;\n\n      while (pos < max) {\n        ch = state.src.charCodeAt(pos);\n\n        if (isSpace(ch)) {\n          if (ch === 0x09) {\n            offset += 4 - (offset + state.bsCount[nextLine] + (adjustTab ? 1 : 0)) % 4;\n          } else {\n            offset++;\n          }\n        } else {\n          break;\n        }\n\n        pos++;\n      }\n\n      lastLineEmpty = pos >= max;\n\n      oldBSCount.push(state.bsCount[nextLine]);\n      state.bsCount[nextLine] = state.sCount[nextLine] + 1 + (spaceAfterMarker ? 1 : 0);\n\n      oldSCount.push(state.sCount[nextLine]);\n      state.sCount[nextLine] = offset - initial;\n\n      oldTShift.push(state.tShift[nextLine]);\n      state.tShift[nextLine] = pos - state.bMarks[nextLine];\n      continue;\n    }\n\n    // Case 2: line is not inside the blockquote, and the last line was empty.\n    if (lastLineEmpty) { break; }\n\n    // Case 3: another tag found.\n    terminate = false;\n    for (i = 0, l = terminatorRules.length; i < l; i++) {\n      if (terminatorRules[i](state, nextLine, endLine, true)) {\n        terminate = true;\n        break;\n      }\n    }\n\n    if (terminate) {\n      // Quirk to enforce \"hard termination mode\" for paragraphs;\n      // normally if you call `tokenize(state, startLine, nextLine)`,\n      // paragraphs will look below nextLine for paragraph continuation,\n      // but if blockquote is terminated by another tag, they shouldn't\n      state.lineMax = nextLine;\n\n      if (state.blkIndent !== 0) {\n        // state.blkIndent was non-zero, we now set it to zero,\n        // so we need to re-calculate all offsets to appear as\n        // if indent wasn't changed\n        oldBMarks.push(state.bMarks[nextLine]);\n        oldBSCount.push(state.bsCount[nextLine]);\n        oldTShift.push(state.tShift[nextLine]);\n        oldSCount.push(state.sCount[nextLine]);\n        state.sCount[nextLine] -= state.blkIndent;\n      }\n\n      break;\n    }\n\n    oldBMarks.push(state.bMarks[nextLine]);\n    oldBSCount.push(state.bsCount[nextLine]);\n    oldTShift.push(state.tShift[nextLine]);\n    oldSCount.push(state.sCount[nextLine]);\n\n    // A negative indentation means that this is a paragraph continuation\n    //\n    state.sCount[nextLine] = -1;\n  }\n\n  oldIndent = state.blkIndent;\n  state.blkIndent = 0;\n\n  token        = state.push('blockquote_open', 'blockquote', 1);\n  token.markup = '>';\n  token.map    = lines = [ startLine, 0 ];\n\n  state.md.block.tokenize(state, startLine, nextLine);\n\n  token        = state.push('blockquote_close', 'blockquote', -1);\n  token.markup = '>';\n\n  state.lineMax = oldLineMax;\n  state.parentType = oldParentType;\n  lines[1] = state.line;\n\n  // Restore original tShift; this might not be necessary since the parser\n  // has already been here, but just to make sure we can do that.\n  for (i = 0; i < oldTShift.length; i++) {\n    state.bMarks[i + startLine] = oldBMarks[i];\n    state.tShift[i + startLine] = oldTShift[i];\n    state.sCount[i + startLine] = oldSCount[i];\n    state.bsCount[i + startLine] = oldBSCount[i];\n  }\n  state.blkIndent = oldIndent;\n\n  return true;\n};\n","// Horizontal rule\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function hr(state, startLine, endLine, silent) {\n  var marker, cnt, ch, token,\n      pos = state.bMarks[startLine] + state.tShift[startLine],\n      max = state.eMarks[startLine];\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  marker = state.src.charCodeAt(pos++);\n\n  // Check hr marker\n  if (marker !== 0x2A/* * */ &&\n      marker !== 0x2D/* - */ &&\n      marker !== 0x5F/* _ */) {\n    return false;\n  }\n\n  // markers can be mixed with spaces, but there should be at least 3 of them\n\n  cnt = 1;\n  while (pos < max) {\n    ch = state.src.charCodeAt(pos++);\n    if (ch !== marker && !isSpace(ch)) { return false; }\n    if (ch === marker) { cnt++; }\n  }\n\n  if (cnt < 3) { return false; }\n\n  if (silent) { return true; }\n\n  state.line = startLine + 1;\n\n  token        = state.push('hr', 'hr', 0);\n  token.map    = [ startLine, state.line ];\n  token.markup = Array(cnt + 1).join(String.fromCharCode(marker));\n\n  return true;\n};\n","// Lists\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\n// Search `[-+*][\\n ]`, returns next pos after marker on success\n// or -1 on fail.\nfunction skipBulletListMarker(state, startLine) {\n  var marker, pos, max, ch;\n\n  pos = state.bMarks[startLine] + state.tShift[startLine];\n  max = state.eMarks[startLine];\n\n  marker = state.src.charCodeAt(pos++);\n  // Check bullet\n  if (marker !== 0x2A/* * */ &&\n      marker !== 0x2D/* - */ &&\n      marker !== 0x2B/* + */) {\n    return -1;\n  }\n\n  if (pos < max) {\n    ch = state.src.charCodeAt(pos);\n\n    if (!isSpace(ch)) {\n      // \" -test \" - is not a list item\n      return -1;\n    }\n  }\n\n  return pos;\n}\n\n// Search `\\d+[.)][\\n ]`, returns next pos after marker on success\n// or -1 on fail.\nfunction skipOrderedListMarker(state, startLine) {\n  var ch,\n      start = state.bMarks[startLine] + state.tShift[startLine],\n      pos = start,\n      max = state.eMarks[startLine];\n\n  // List marker should have at least 2 chars (digit + dot)\n  if (pos + 1 >= max) { return -1; }\n\n  ch = state.src.charCodeAt(pos++);\n\n  if (ch < 0x30/* 0 */ || ch > 0x39/* 9 */) { return -1; }\n\n  for (;;) {\n    // EOL -> fail\n    if (pos >= max) { return -1; }\n\n    ch = state.src.charCodeAt(pos++);\n\n    if (ch >= 0x30/* 0 */ && ch <= 0x39/* 9 */) {\n\n      // List marker should have no more than 9 digits\n      // (prevents integer overflow in browsers)\n      if (pos - start >= 10) { return -1; }\n\n      continue;\n    }\n\n    // found valid marker\n    if (ch === 0x29/* ) */ || ch === 0x2e/* . */) {\n      break;\n    }\n\n    return -1;\n  }\n\n\n  if (pos < max) {\n    ch = state.src.charCodeAt(pos);\n\n    if (!isSpace(ch)) {\n      // \" 1.test \" - is not a list item\n      return -1;\n    }\n  }\n  return pos;\n}\n\nfunction markTightParagraphs(state, idx) {\n  var i, l,\n      level = state.level + 2;\n\n  for (i = idx + 2, l = state.tokens.length - 2; i < l; i++) {\n    if (state.tokens[i].level === level && state.tokens[i].type === 'paragraph_open') {\n      state.tokens[i + 2].hidden = true;\n      state.tokens[i].hidden = true;\n      i += 2;\n    }\n  }\n}\n\n\nmodule.exports = function list(state, startLine, endLine, silent) {\n  var ch,\n      contentStart,\n      i,\n      indent,\n      indentAfterMarker,\n      initial,\n      isOrdered,\n      itemLines,\n      l,\n      listLines,\n      listTokIdx,\n      markerCharCode,\n      markerValue,\n      max,\n      nextLine,\n      offset,\n      oldIndent,\n      oldLIndent,\n      oldParentType,\n      oldTShift,\n      oldTight,\n      pos,\n      posAfterMarker,\n      prevEmptyEnd,\n      start,\n      terminate,\n      terminatorRules,\n      token,\n      isTerminatingParagraph = false,\n      tight = true;\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  // limit conditions when list can interrupt\n  // a paragraph (validation mode only)\n  if (silent && state.parentType === 'paragraph') {\n    // Next list item should still terminate previous list item;\n    //\n    // This code can fail if plugins use blkIndent as well as lists,\n    // but I hope the spec gets fixed long before that happens.\n    //\n    if (state.tShift[startLine] >= state.blkIndent) {\n      isTerminatingParagraph = true;\n    }\n  }\n\n  // Detect list type and position after marker\n  if ((posAfterMarker = skipOrderedListMarker(state, startLine)) >= 0) {\n    isOrdered = true;\n    start = state.bMarks[startLine] + state.tShift[startLine];\n    markerValue = Number(state.src.substr(start, posAfterMarker - start - 1));\n\n    // If we're starting a new ordered list right after\n    // a paragraph, it should start with 1.\n    if (isTerminatingParagraph && markerValue !== 1) return false;\n\n  } else if ((posAfterMarker = skipBulletListMarker(state, startLine)) >= 0) {\n    isOrdered = false;\n\n  } else {\n    return false;\n  }\n\n  // If we're starting a new unordered list right after\n  // a paragraph, first line should not be empty.\n  if (isTerminatingParagraph) {\n    if (state.skipSpaces(posAfterMarker) >= state.eMarks[startLine]) return false;\n  }\n\n  // We should terminate list on style change. Remember first one to compare.\n  markerCharCode = state.src.charCodeAt(posAfterMarker - 1);\n\n  // For validation mode we can terminate immediately\n  if (silent) { return true; }\n\n  // Start list\n  listTokIdx = state.tokens.length;\n\n  if (isOrdered) {\n    token       = state.push('ordered_list_open', 'ol', 1);\n    if (markerValue !== 1) {\n      token.attrs = [ [ 'start', markerValue ] ];\n    }\n\n  } else {\n    token       = state.push('bullet_list_open', 'ul', 1);\n  }\n\n  token.map    = listLines = [ startLine, 0 ];\n  token.markup = String.fromCharCode(markerCharCode);\n\n  //\n  // Iterate list items\n  //\n\n  nextLine = startLine;\n  prevEmptyEnd = false;\n  terminatorRules = state.md.block.ruler.getRules('list');\n\n  oldParentType = state.parentType;\n  state.parentType = 'list';\n\n  while (nextLine < endLine) {\n    pos = posAfterMarker;\n    max = state.eMarks[nextLine];\n\n    initial = offset = state.sCount[nextLine] + posAfterMarker - (state.bMarks[startLine] + state.tShift[startLine]);\n\n    while (pos < max) {\n      ch = state.src.charCodeAt(pos);\n\n      if (ch === 0x09) {\n        offset += 4 - (offset + state.bsCount[nextLine]) % 4;\n      } else if (ch === 0x20) {\n        offset++;\n      } else {\n        break;\n      }\n\n      pos++;\n    }\n\n    contentStart = pos;\n\n    if (contentStart >= max) {\n      // trimming space in \"-    \\n  3\" case, indent is 1 here\n      indentAfterMarker = 1;\n    } else {\n      indentAfterMarker = offset - initial;\n    }\n\n    // If we have more than 4 spaces, the indent is 1\n    // (the rest is just indented code block)\n    if (indentAfterMarker > 4) { indentAfterMarker = 1; }\n\n    // \"  -  test\"\n    //  ^^^^^ - calculating total length of this thing\n    indent = initial + indentAfterMarker;\n\n    // Run subparser & write tokens\n    token        = state.push('list_item_open', 'li', 1);\n    token.markup = String.fromCharCode(markerCharCode);\n    token.map    = itemLines = [ startLine, 0 ];\n\n    oldIndent = state.blkIndent;\n    oldTight = state.tight;\n    oldTShift = state.tShift[startLine];\n    oldLIndent = state.sCount[startLine];\n    state.blkIndent = indent;\n    state.tight = true;\n    state.tShift[startLine] = contentStart - state.bMarks[startLine];\n    state.sCount[startLine] = offset;\n\n    if (contentStart >= max && state.isEmpty(startLine + 1)) {\n      // workaround for this case\n      // (list item is empty, list terminates before \"foo\"):\n      // ~~~~~~~~\n      //   -\n      //\n      //     foo\n      // ~~~~~~~~\n      state.line = Math.min(state.line + 2, endLine);\n    } else {\n      state.md.block.tokenize(state, startLine, endLine, true);\n    }\n\n    // If any of list item is tight, mark list as tight\n    if (!state.tight || prevEmptyEnd) {\n      tight = false;\n    }\n    // Item become loose if finish with empty line,\n    // but we should filter last element, because it means list finish\n    prevEmptyEnd = (state.line - startLine) > 1 && state.isEmpty(state.line - 1);\n\n    state.blkIndent = oldIndent;\n    state.tShift[startLine] = oldTShift;\n    state.sCount[startLine] = oldLIndent;\n    state.tight = oldTight;\n\n    token        = state.push('list_item_close', 'li', -1);\n    token.markup = String.fromCharCode(markerCharCode);\n\n    nextLine = startLine = state.line;\n    itemLines[1] = nextLine;\n    contentStart = state.bMarks[startLine];\n\n    if (nextLine >= endLine) { break; }\n\n    //\n    // Try to check if list is terminated or continued.\n    //\n    if (state.sCount[nextLine] < state.blkIndent) { break; }\n\n    // fail if terminating block found\n    terminate = false;\n    for (i = 0, l = terminatorRules.length; i < l; i++) {\n      if (terminatorRules[i](state, nextLine, endLine, true)) {\n        terminate = true;\n        break;\n      }\n    }\n    if (terminate) { break; }\n\n    // fail if list has another type\n    if (isOrdered) {\n      posAfterMarker = skipOrderedListMarker(state, nextLine);\n      if (posAfterMarker < 0) { break; }\n    } else {\n      posAfterMarker = skipBulletListMarker(state, nextLine);\n      if (posAfterMarker < 0) { break; }\n    }\n\n    if (markerCharCode !== state.src.charCodeAt(posAfterMarker - 1)) { break; }\n  }\n\n  // Finalize list\n  if (isOrdered) {\n    token = state.push('ordered_list_close', 'ol', -1);\n  } else {\n    token = state.push('bullet_list_close', 'ul', -1);\n  }\n  token.markup = String.fromCharCode(markerCharCode);\n\n  listLines[1] = nextLine;\n  state.line = nextLine;\n\n  state.parentType = oldParentType;\n\n  // mark paragraphs tight if needed\n  if (tight) {\n    markTightParagraphs(state, listTokIdx);\n  }\n\n  return true;\n};\n","'use strict';\n\n\nvar normalizeReference   = require('../common/utils').normalizeReference;\nvar isSpace              = require('../common/utils').isSpace;\n\n\nmodule.exports = function reference(state, startLine, _endLine, silent) {\n  var ch,\n      destEndPos,\n      destEndLineNo,\n      endLine,\n      href,\n      i,\n      l,\n      label,\n      labelEnd,\n      oldParentType,\n      res,\n      start,\n      str,\n      terminate,\n      terminatorRules,\n      title,\n      lines = 0,\n      pos = state.bMarks[startLine] + state.tShift[startLine],\n      max = state.eMarks[startLine],\n      nextLine = startLine + 1;\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  if (state.src.charCodeAt(pos) !== 0x5B/* [ */) { return false; }\n\n  // Simple check to quickly interrupt scan on [link](url) at the start of line.\n  // Can be useful on practice: https://github.com/markdown-it/markdown-it/issues/54\n  while (++pos < max) {\n    if (state.src.charCodeAt(pos) === 0x5D /* ] */ &&\n        state.src.charCodeAt(pos - 1) !== 0x5C/* \\ */) {\n      if (pos + 1 === max) { return false; }\n      if (state.src.charCodeAt(pos + 1) !== 0x3A/* : */) { return false; }\n      break;\n    }\n  }\n\n  endLine = state.lineMax;\n\n  // jump line-by-line until empty one or EOF\n  terminatorRules = state.md.block.ruler.getRules('reference');\n\n  oldParentType = state.parentType;\n  state.parentType = 'reference';\n\n  for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n    // this would be a code block normally, but after paragraph\n    // it's considered a lazy continuation regardless of what's there\n    if (state.sCount[nextLine] - state.blkIndent > 3) { continue; }\n\n    // quirk for blockquotes, this line should already be checked by that rule\n    if (state.sCount[nextLine] < 0) { continue; }\n\n    // Some tags can terminate paragraph without empty line.\n    terminate = false;\n    for (i = 0, l = terminatorRules.length; i < l; i++) {\n      if (terminatorRules[i](state, nextLine, endLine, true)) {\n        terminate = true;\n        break;\n      }\n    }\n    if (terminate) { break; }\n  }\n\n  str = state.getLines(startLine, nextLine, state.blkIndent, false).trim();\n  max = str.length;\n\n  for (pos = 1; pos < max; pos++) {\n    ch = str.charCodeAt(pos);\n    if (ch === 0x5B /* [ */) {\n      return false;\n    } else if (ch === 0x5D /* ] */) {\n      labelEnd = pos;\n      break;\n    } else if (ch === 0x0A /* \\n */) {\n      lines++;\n    } else if (ch === 0x5C /* \\ */) {\n      pos++;\n      if (pos < max && str.charCodeAt(pos) === 0x0A) {\n        lines++;\n      }\n    }\n  }\n\n  if (labelEnd < 0 || str.charCodeAt(labelEnd + 1) !== 0x3A/* : */) { return false; }\n\n  // [label]:   destination   'title'\n  //         ^^^ skip optional whitespace here\n  for (pos = labelEnd + 2; pos < max; pos++) {\n    ch = str.charCodeAt(pos);\n    if (ch === 0x0A) {\n      lines++;\n    } else if (isSpace(ch)) {\n      /*eslint no-empty:0*/\n    } else {\n      break;\n    }\n  }\n\n  // [label]:   destination   'title'\n  //            ^^^^^^^^^^^ parse this\n  res = state.md.helpers.parseLinkDestination(str, pos, max);\n  if (!res.ok) { return false; }\n\n  href = state.md.normalizeLink(res.str);\n  if (!state.md.validateLink(href)) { return false; }\n\n  pos = res.pos;\n  lines += res.lines;\n\n  // save cursor state, we could require to rollback later\n  destEndPos = pos;\n  destEndLineNo = lines;\n\n  // [label]:   destination   'title'\n  //                       ^^^ skipping those spaces\n  start = pos;\n  for (; pos < max; pos++) {\n    ch = str.charCodeAt(pos);\n    if (ch === 0x0A) {\n      lines++;\n    } else if (isSpace(ch)) {\n      /*eslint no-empty:0*/\n    } else {\n      break;\n    }\n  }\n\n  // [label]:   destination   'title'\n  //                          ^^^^^^^ parse this\n  res = state.md.helpers.parseLinkTitle(str, pos, max);\n  if (pos < max && start !== pos && res.ok) {\n    title = res.str;\n    pos = res.pos;\n    lines += res.lines;\n  } else {\n    title = '';\n    pos = destEndPos;\n    lines = destEndLineNo;\n  }\n\n  // skip trailing spaces until the rest of the line\n  while (pos < max) {\n    ch = str.charCodeAt(pos);\n    if (!isSpace(ch)) { break; }\n    pos++;\n  }\n\n  if (pos < max && str.charCodeAt(pos) !== 0x0A) {\n    if (title) {\n      // garbage at the end of the line after title,\n      // but it could still be a valid reference if we roll back\n      title = '';\n      pos = destEndPos;\n      lines = destEndLineNo;\n      while (pos < max) {\n        ch = str.charCodeAt(pos);\n        if (!isSpace(ch)) { break; }\n        pos++;\n      }\n    }\n  }\n\n  if (pos < max && str.charCodeAt(pos) !== 0x0A) {\n    // garbage at the end of the line\n    return false;\n  }\n\n  label = normalizeReference(str.slice(1, labelEnd));\n  if (!label) {\n    // CommonMark 0.20 disallows empty labels\n    return false;\n  }\n\n  // Reference can not terminate anything. This check is for safety only.\n  /*istanbul ignore if*/\n  if (silent) { return true; }\n\n  if (typeof state.env.references === 'undefined') {\n    state.env.references = {};\n  }\n  if (typeof state.env.references[label] === 'undefined') {\n    state.env.references[label] = { title: title, href: href };\n  }\n\n  state.parentType = oldParentType;\n\n  state.line = startLine + lines + 1;\n  return true;\n};\n","// heading (#, ##, ...)\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function heading(state, startLine, endLine, silent) {\n  var ch, level, tmp, token,\n      pos = state.bMarks[startLine] + state.tShift[startLine],\n      max = state.eMarks[startLine];\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  ch  = state.src.charCodeAt(pos);\n\n  if (ch !== 0x23/* # */ || pos >= max) { return false; }\n\n  // count heading level\n  level = 1;\n  ch = state.src.charCodeAt(++pos);\n  while (ch === 0x23/* # */ && pos < max && level <= 6) {\n    level++;\n    ch = state.src.charCodeAt(++pos);\n  }\n\n  if (level > 6 || (pos < max && !isSpace(ch))) { return false; }\n\n  if (silent) { return true; }\n\n  // Let's cut tails like '    ###  ' from the end of string\n\n  max = state.skipSpacesBack(max, pos);\n  tmp = state.skipCharsBack(max, 0x23, pos); // #\n  if (tmp > pos && isSpace(state.src.charCodeAt(tmp - 1))) {\n    max = tmp;\n  }\n\n  state.line = startLine + 1;\n\n  token        = state.push('heading_open', 'h' + String(level), 1);\n  token.markup = '########'.slice(0, level);\n  token.map    = [ startLine, state.line ];\n\n  token          = state.push('inline', '', 0);\n  token.content  = state.src.slice(pos, max).trim();\n  token.map      = [ startLine, state.line ];\n  token.children = [];\n\n  token        = state.push('heading_close', 'h' + String(level), -1);\n  token.markup = '########'.slice(0, level);\n\n  return true;\n};\n","// lheading (---, ===)\n\n'use strict';\n\n\nmodule.exports = function lheading(state, startLine, endLine/*, silent*/) {\n  var content, terminate, i, l, token, pos, max, level, marker,\n      nextLine = startLine + 1, oldParentType,\n      terminatorRules = state.md.block.ruler.getRules('paragraph');\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  oldParentType = state.parentType;\n  state.parentType = 'paragraph'; // use paragraph to match terminatorRules\n\n  // jump line-by-line until empty one or EOF\n  for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n    // this would be a code block normally, but after paragraph\n    // it's considered a lazy continuation regardless of what's there\n    if (state.sCount[nextLine] - state.blkIndent > 3) { continue; }\n\n    //\n    // Check for underline in setext header\n    //\n    if (state.sCount[nextLine] >= state.blkIndent) {\n      pos = state.bMarks[nextLine] + state.tShift[nextLine];\n      max = state.eMarks[nextLine];\n\n      if (pos < max) {\n        marker = state.src.charCodeAt(pos);\n\n        if (marker === 0x2D/* - */ || marker === 0x3D/* = */) {\n          pos = state.skipChars(pos, marker);\n          pos = state.skipSpaces(pos);\n\n          if (pos >= max) {\n            level = (marker === 0x3D/* = */ ? 1 : 2);\n            break;\n          }\n        }\n      }\n    }\n\n    // quirk for blockquotes, this line should already be checked by that rule\n    if (state.sCount[nextLine] < 0) { continue; }\n\n    // Some tags can terminate paragraph without empty line.\n    terminate = false;\n    for (i = 0, l = terminatorRules.length; i < l; i++) {\n      if (terminatorRules[i](state, nextLine, endLine, true)) {\n        terminate = true;\n        break;\n      }\n    }\n    if (terminate) { break; }\n  }\n\n  if (!level) {\n    // Didn't find valid underline\n    return false;\n  }\n\n  content = state.getLines(startLine, nextLine, state.blkIndent, false).trim();\n\n  state.line = nextLine + 1;\n\n  token          = state.push('heading_open', 'h' + String(level), 1);\n  token.markup   = String.fromCharCode(marker);\n  token.map      = [ startLine, state.line ];\n\n  token          = state.push('inline', '', 0);\n  token.content  = content;\n  token.map      = [ startLine, state.line - 1 ];\n  token.children = [];\n\n  token          = state.push('heading_close', 'h' + String(level), -1);\n  token.markup   = String.fromCharCode(marker);\n\n  state.parentType = oldParentType;\n\n  return true;\n};\n","// HTML block\n\n'use strict';\n\n\nvar block_names = require('../common/html_blocks');\nvar HTML_OPEN_CLOSE_TAG_RE = require('../common/html_re').HTML_OPEN_CLOSE_TAG_RE;\n\n// An array of opening and corresponding closing sequences for html tags,\n// last argument defines whether it can terminate a paragraph or not\n//\nvar HTML_SEQUENCES = [\n  [ /^<(script|pre|style)(?=(\\s|>|$))/i, /<\\/(script|pre|style)>/i, true ],\n  [ /^<!--/,        /-->/,   true ],\n  [ /^<\\?/,         /\\?>/,   true ],\n  [ /^<![A-Z]/,     />/,     true ],\n  [ /^<!\\[CDATA\\[/, /\\]\\]>/, true ],\n  [ new RegExp('^</?(' + block_names.join('|') + ')(?=(\\\\s|/?>|$))', 'i'), /^$/, true ],\n  [ new RegExp(HTML_OPEN_CLOSE_TAG_RE.source + '\\\\s*$'),  /^$/, false ]\n];\n\n\nmodule.exports = function html_block(state, startLine, endLine, silent) {\n  var i, nextLine, token, lineText,\n      pos = state.bMarks[startLine] + state.tShift[startLine],\n      max = state.eMarks[startLine];\n\n  // if it's indented more than 3 spaces, it should be a code block\n  if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n  if (!state.md.options.html) { return false; }\n\n  if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false; }\n\n  lineText = state.src.slice(pos, max);\n\n  for (i = 0; i < HTML_SEQUENCES.length; i++) {\n    if (HTML_SEQUENCES[i][0].test(lineText)) { break; }\n  }\n\n  if (i === HTML_SEQUENCES.length) { return false; }\n\n  if (silent) {\n    // true if this sequence can be a terminator, false otherwise\n    return HTML_SEQUENCES[i][2];\n  }\n\n  nextLine = startLine + 1;\n\n  // If we are here - we detected HTML block.\n  // Let's roll down till block end.\n  if (!HTML_SEQUENCES[i][1].test(lineText)) {\n    for (; nextLine < endLine; nextLine++) {\n      if (state.sCount[nextLine] < state.blkIndent) { break; }\n\n      pos = state.bMarks[nextLine] + state.tShift[nextLine];\n      max = state.eMarks[nextLine];\n      lineText = state.src.slice(pos, max);\n\n      if (HTML_SEQUENCES[i][1].test(lineText)) {\n        if (lineText.length !== 0) { nextLine++; }\n        break;\n      }\n    }\n  }\n\n  state.line = nextLine;\n\n  token         = state.push('html_block', '', 0);\n  token.map     = [ startLine, nextLine ];\n  token.content = state.getLines(startLine, nextLine, state.blkIndent, true);\n\n  return true;\n};\n","// List of valid html blocks names, accorting to commonmark spec\n// http://jgm.github.io/CommonMark/spec.html#html-blocks\n\n'use strict';\n\n\nmodule.exports = [\n  'address',\n  'article',\n  'aside',\n  'base',\n  'basefont',\n  'blockquote',\n  'body',\n  'caption',\n  'center',\n  'col',\n  'colgroup',\n  'dd',\n  'details',\n  'dialog',\n  'dir',\n  'div',\n  'dl',\n  'dt',\n  'fieldset',\n  'figcaption',\n  'figure',\n  'footer',\n  'form',\n  'frame',\n  'frameset',\n  'h1',\n  'h2',\n  'h3',\n  'h4',\n  'h5',\n  'h6',\n  'head',\n  'header',\n  'hr',\n  'html',\n  'iframe',\n  'legend',\n  'li',\n  'link',\n  'main',\n  'menu',\n  'menuitem',\n  'meta',\n  'nav',\n  'noframes',\n  'ol',\n  'optgroup',\n  'option',\n  'p',\n  'param',\n  'section',\n  'source',\n  'summary',\n  'table',\n  'tbody',\n  'td',\n  'tfoot',\n  'th',\n  'thead',\n  'title',\n  'tr',\n  'track',\n  'ul'\n];\n","// Paragraph\n\n'use strict';\n\n\nmodule.exports = function paragraph(state, startLine/*, endLine*/) {\n  var content, terminate, i, l, token, oldParentType,\n      nextLine = startLine + 1,\n      terminatorRules = state.md.block.ruler.getRules('paragraph'),\n      endLine = state.lineMax;\n\n  oldParentType = state.parentType;\n  state.parentType = 'paragraph';\n\n  // jump line-by-line until empty one or EOF\n  for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n    // this would be a code block normally, but after paragraph\n    // it's considered a lazy continuation regardless of what's there\n    if (state.sCount[nextLine] - state.blkIndent > 3) { continue; }\n\n    // quirk for blockquotes, this line should already be checked by that rule\n    if (state.sCount[nextLine] < 0) { continue; }\n\n    // Some tags can terminate paragraph without empty line.\n    terminate = false;\n    for (i = 0, l = terminatorRules.length; i < l; i++) {\n      if (terminatorRules[i](state, nextLine, endLine, true)) {\n        terminate = true;\n        break;\n      }\n    }\n    if (terminate) { break; }\n  }\n\n  content = state.getLines(startLine, nextLine, state.blkIndent, false).trim();\n\n  state.line = nextLine;\n\n  token          = state.push('paragraph_open', 'p', 1);\n  token.map      = [ startLine, state.line ];\n\n  token          = state.push('inline', '', 0);\n  token.content  = content;\n  token.map      = [ startLine, state.line ];\n  token.children = [];\n\n  token          = state.push('paragraph_close', 'p', -1);\n\n  state.parentType = oldParentType;\n\n  return true;\n};\n","// Parser state class\n\n'use strict';\n\nvar Token = require('../token');\nvar isSpace = require('../common/utils').isSpace;\n\n\nfunction StateBlock(src, md, env, tokens) {\n  var ch, s, start, pos, len, indent, offset, indent_found;\n\n  this.src = src;\n\n  // link to parser instance\n  this.md     = md;\n\n  this.env = env;\n\n  //\n  // Internal state vartiables\n  //\n\n  this.tokens = tokens;\n\n  this.bMarks = [];  // line begin offsets for fast jumps\n  this.eMarks = [];  // line end offsets for fast jumps\n  this.tShift = [];  // offsets of the first non-space characters (tabs not expanded)\n  this.sCount = [];  // indents for each line (tabs expanded)\n\n  // An amount of virtual spaces (tabs expanded) between beginning\n  // of each line (bMarks) and real beginning of that line.\n  //\n  // It exists only as a hack because blockquotes override bMarks\n  // losing information in the process.\n  //\n  // It's used only when expanding tabs, you can think about it as\n  // an initial tab length, e.g. bsCount=21 applied to string `\\t123`\n  // means first tab should be expanded to 4-21%4 === 3 spaces.\n  //\n  this.bsCount = [];\n\n  // block parser variables\n  this.blkIndent  = 0; // required block content indent\n                       // (for example, if we are in list)\n  this.line       = 0; // line index in src\n  this.lineMax    = 0; // lines count\n  this.tight      = false;  // loose/tight mode for lists\n  this.ddIndent   = -1; // indent of the current dd block (-1 if there isn't any)\n\n  // can be 'blockquote', 'list', 'root', 'paragraph' or 'reference'\n  // used in lists to determine if they interrupt a paragraph\n  this.parentType = 'root';\n\n  this.level = 0;\n\n  // renderer\n  this.result = '';\n\n  // Create caches\n  // Generate markers.\n  s = this.src;\n  indent_found = false;\n\n  for (start = pos = indent = offset = 0, len = s.length; pos < len; pos++) {\n    ch = s.charCodeAt(pos);\n\n    if (!indent_found) {\n      if (isSpace(ch)) {\n        indent++;\n\n        if (ch === 0x09) {\n          offset += 4 - offset % 4;\n        } else {\n          offset++;\n        }\n        continue;\n      } else {\n        indent_found = true;\n      }\n    }\n\n    if (ch === 0x0A || pos === len - 1) {\n      if (ch !== 0x0A) { pos++; }\n      this.bMarks.push(start);\n      this.eMarks.push(pos);\n      this.tShift.push(indent);\n      this.sCount.push(offset);\n      this.bsCount.push(0);\n\n      indent_found = false;\n      indent = 0;\n      offset = 0;\n      start = pos + 1;\n    }\n  }\n\n  // Push fake entry to simplify cache bounds checks\n  this.bMarks.push(s.length);\n  this.eMarks.push(s.length);\n  this.tShift.push(0);\n  this.sCount.push(0);\n  this.bsCount.push(0);\n\n  this.lineMax = this.bMarks.length - 1; // don't count last fake line\n}\n\n// Push new token to \"stream\".\n//\nStateBlock.prototype.push = function (type, tag, nesting) {\n  var token = new Token(type, tag, nesting);\n  token.block = true;\n\n  if (nesting < 0) { this.level--; }\n  token.level = this.level;\n  if (nesting > 0) { this.level++; }\n\n  this.tokens.push(token);\n  return token;\n};\n\nStateBlock.prototype.isEmpty = function isEmpty(line) {\n  return this.bMarks[line] + this.tShift[line] >= this.eMarks[line];\n};\n\nStateBlock.prototype.skipEmptyLines = function skipEmptyLines(from) {\n  for (var max = this.lineMax; from < max; from++) {\n    if (this.bMarks[from] + this.tShift[from] < this.eMarks[from]) {\n      break;\n    }\n  }\n  return from;\n};\n\n// Skip spaces from given position.\nStateBlock.prototype.skipSpaces = function skipSpaces(pos) {\n  var ch;\n\n  for (var max = this.src.length; pos < max; pos++) {\n    ch = this.src.charCodeAt(pos);\n    if (!isSpace(ch)) { break; }\n  }\n  return pos;\n};\n\n// Skip spaces from given position in reverse.\nStateBlock.prototype.skipSpacesBack = function skipSpacesBack(pos, min) {\n  if (pos <= min) { return pos; }\n\n  while (pos > min) {\n    if (!isSpace(this.src.charCodeAt(--pos))) { return pos + 1; }\n  }\n  return pos;\n};\n\n// Skip char codes from given position\nStateBlock.prototype.skipChars = function skipChars(pos, code) {\n  for (var max = this.src.length; pos < max; pos++) {\n    if (this.src.charCodeAt(pos) !== code) { break; }\n  }\n  return pos;\n};\n\n// Skip char codes reverse from given position - 1\nStateBlock.prototype.skipCharsBack = function skipCharsBack(pos, code, min) {\n  if (pos <= min) { return pos; }\n\n  while (pos > min) {\n    if (code !== this.src.charCodeAt(--pos)) { return pos + 1; }\n  }\n  return pos;\n};\n\n// cut lines range from source.\nStateBlock.prototype.getLines = function getLines(begin, end, indent, keepLastLF) {\n  var i, lineIndent, ch, first, last, queue, lineStart,\n      line = begin;\n\n  if (begin >= end) {\n    return '';\n  }\n\n  queue = new Array(end - begin);\n\n  for (i = 0; line < end; line++, i++) {\n    lineIndent = 0;\n    lineStart = first = this.bMarks[line];\n\n    if (line + 1 < end || keepLastLF) {\n      // No need for bounds check because we have fake entry on tail.\n      last = this.eMarks[line] + 1;\n    } else {\n      last = this.eMarks[line];\n    }\n\n    while (first < last && lineIndent < indent) {\n      ch = this.src.charCodeAt(first);\n\n      if (isSpace(ch)) {\n        if (ch === 0x09) {\n          lineIndent += 4 - (lineIndent + this.bsCount[line]) % 4;\n        } else {\n          lineIndent++;\n        }\n      } else if (first - lineStart < this.tShift[line]) {\n        // patched tShift masked characters to look like spaces (blockquotes, list markers)\n        lineIndent++;\n      } else {\n        break;\n      }\n\n      first++;\n    }\n\n    if (lineIndent > indent) {\n      // partially expanding tabs in code blocks, e.g '\\t\\tfoobar'\n      // with indent=2 becomes '  \\tfoobar'\n      queue[i] = new Array(lineIndent - indent + 1).join(' ') + this.src.slice(first, last);\n    } else {\n      queue[i] = this.src.slice(first, last);\n    }\n  }\n\n  return queue.join('');\n};\n\n// re-export Token class to use in block rules\nStateBlock.prototype.Token = Token;\n\n\nmodule.exports = StateBlock;\n","/** internal\n * class ParserInline\n *\n * Tokenizes paragraph content.\n **/\n'use strict';\n\n\nvar Ruler           = require('./ruler');\n\n\n////////////////////////////////////////////////////////////////////////////////\n// Parser rules\n\nvar _rules = [\n  [ 'text',            require('./rules_inline/text') ],\n  [ 'newline',         require('./rules_inline/newline') ],\n  [ 'escape',          require('./rules_inline/escape') ],\n  [ 'backticks',       require('./rules_inline/backticks') ],\n  [ 'strikethrough',   require('./rules_inline/strikethrough').tokenize ],\n  [ 'emphasis',        require('./rules_inline/emphasis').tokenize ],\n  [ 'link',            require('./rules_inline/link') ],\n  [ 'image',           require('./rules_inline/image') ],\n  [ 'autolink',        require('./rules_inline/autolink') ],\n  [ 'html_inline',     require('./rules_inline/html_inline') ],\n  [ 'entity',          require('./rules_inline/entity') ]\n];\n\nvar _rules2 = [\n  [ 'balance_pairs',   require('./rules_inline/balance_pairs') ],\n  [ 'strikethrough',   require('./rules_inline/strikethrough').postProcess ],\n  [ 'emphasis',        require('./rules_inline/emphasis').postProcess ],\n  [ 'text_collapse',   require('./rules_inline/text_collapse') ]\n];\n\n\n/**\n * new ParserInline()\n **/\nfunction ParserInline() {\n  var i;\n\n  /**\n   * ParserInline#ruler -> Ruler\n   *\n   * [[Ruler]] instance. Keep configuration of inline rules.\n   **/\n  this.ruler = new Ruler();\n\n  for (i = 0; i < _rules.length; i++) {\n    this.ruler.push(_rules[i][0], _rules[i][1]);\n  }\n\n  /**\n   * ParserInline#ruler2 -> Ruler\n   *\n   * [[Ruler]] instance. Second ruler used for post-processing\n   * (e.g. in emphasis-like rules).\n   **/\n  this.ruler2 = new Ruler();\n\n  for (i = 0; i < _rules2.length; i++) {\n    this.ruler2.push(_rules2[i][0], _rules2[i][1]);\n  }\n}\n\n\n// Skip single token by running all rules in validation mode;\n// returns `true` if any rule reported success\n//\nParserInline.prototype.skipToken = function (state) {\n  var ok, i, pos = state.pos,\n      rules = this.ruler.getRules(''),\n      len = rules.length,\n      maxNesting = state.md.options.maxNesting,\n      cache = state.cache;\n\n\n  if (typeof cache[pos] !== 'undefined') {\n    state.pos = cache[pos];\n    return;\n  }\n\n  if (state.level < maxNesting) {\n    for (i = 0; i < len; i++) {\n      // Increment state.level and decrement it later to limit recursion.\n      // It's harmless to do here, because no tokens are created. But ideally,\n      // we'd need a separate private state variable for this purpose.\n      //\n      state.level++;\n      ok = rules[i](state, true);\n      state.level--;\n\n      if (ok) { break; }\n    }\n  } else {\n    // Too much nesting, just skip until the end of the paragraph.\n    //\n    // NOTE: this will cause links to behave incorrectly in the following case,\n    //       when an amount of `[` is exactly equal to `maxNesting + 1`:\n    //\n    //       [[[[[[[[[[[[[[[[[[[[[foo]()\n    //\n    // TODO: remove this workaround when CM standard will allow nested links\n    //       (we can replace it by preventing links from being parsed in\n    //       validation mode)\n    //\n    state.pos = state.posMax;\n  }\n\n  if (!ok) { state.pos++; }\n  cache[pos] = state.pos;\n};\n\n\n// Generate tokens for input range\n//\nParserInline.prototype.tokenize = function (state) {\n  var ok, i,\n      rules = this.ruler.getRules(''),\n      len = rules.length,\n      end = state.posMax,\n      maxNesting = state.md.options.maxNesting;\n\n  while (state.pos < end) {\n    // Try all possible rules.\n    // On success, rule should:\n    //\n    // - update `state.pos`\n    // - update `state.tokens`\n    // - return true\n\n    if (state.level < maxNesting) {\n      for (i = 0; i < len; i++) {\n        ok = rules[i](state, false);\n        if (ok) { break; }\n      }\n    }\n\n    if (ok) {\n      if (state.pos >= end) { break; }\n      continue;\n    }\n\n    state.pending += state.src[state.pos++];\n  }\n\n  if (state.pending) {\n    state.pushPending();\n  }\n};\n\n\n/**\n * ParserInline.parse(str, md, env, outTokens)\n *\n * Process input string and push inline tokens into `outTokens`\n **/\nParserInline.prototype.parse = function (str, md, env, outTokens) {\n  var i, rules, len;\n  var state = new this.State(str, md, env, outTokens);\n\n  this.tokenize(state);\n\n  rules = this.ruler2.getRules('');\n  len = rules.length;\n\n  for (i = 0; i < len; i++) {\n    rules[i](state);\n  }\n};\n\n\nParserInline.prototype.State = require('./rules_inline/state_inline');\n\n\nmodule.exports = ParserInline;\n","// Skip text characters for text token, place those to pending buffer\n// and increment current pos\n\n'use strict';\n\n\n// Rule to skip pure text\n// '{}$%@~+=:' reserved for extentions\n\n// !, \", #, $, %, &, ', (, ), *, +, ,, -, ., /, :, ;, <, =, >, ?, @, [, \\, ], ^, _, `, {, |, }, or ~\n\n// !!!! Don't confuse with \"Markdown ASCII Punctuation\" chars\n// http://spec.commonmark.org/0.15/#ascii-punctuation-character\nfunction isTerminatorChar(ch) {\n  switch (ch) {\n    case 0x0A/* \\n */:\n    case 0x21/* ! */:\n    case 0x23/* # */:\n    case 0x24/* $ */:\n    case 0x25/* % */:\n    case 0x26/* & */:\n    case 0x2A/* * */:\n    case 0x2B/* + */:\n    case 0x2D/* - */:\n    case 0x3A/* : */:\n    case 0x3C/* < */:\n    case 0x3D/* = */:\n    case 0x3E/* > */:\n    case 0x40/* @ */:\n    case 0x5B/* [ */:\n    case 0x5C/* \\ */:\n    case 0x5D/* ] */:\n    case 0x5E/* ^ */:\n    case 0x5F/* _ */:\n    case 0x60/* ` */:\n    case 0x7B/* { */:\n    case 0x7D/* } */:\n    case 0x7E/* ~ */:\n      return true;\n    default:\n      return false;\n  }\n}\n\nmodule.exports = function text(state, silent) {\n  var pos = state.pos;\n\n  while (pos < state.posMax && !isTerminatorChar(state.src.charCodeAt(pos))) {\n    pos++;\n  }\n\n  if (pos === state.pos) { return false; }\n\n  if (!silent) { state.pending += state.src.slice(state.pos, pos); }\n\n  state.pos = pos;\n\n  return true;\n};\n\n// Alternative implementation, for memory.\n//\n// It costs 10% of performance, but allows extend terminators list, if place it\n// to `ParcerInline` property. Probably, will switch to it sometime, such\n// flexibility required.\n\n/*\nvar TERMINATOR_RE = /[\\n!#$%&*+\\-:<=>@[\\\\\\]^_`{}~]/;\n\nmodule.exports = function text(state, silent) {\n  var pos = state.pos,\n      idx = state.src.slice(pos).search(TERMINATOR_RE);\n\n  // first char is terminator -> empty text\n  if (idx === 0) { return false; }\n\n  // no terminator -> text till end of string\n  if (idx < 0) {\n    if (!silent) { state.pending += state.src.slice(pos); }\n    state.pos = state.src.length;\n    return true;\n  }\n\n  if (!silent) { state.pending += state.src.slice(pos, pos + idx); }\n\n  state.pos += idx;\n\n  return true;\n};*/\n","// Proceess '\\n'\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function newline(state, silent) {\n  var pmax, max, pos = state.pos;\n\n  if (state.src.charCodeAt(pos) !== 0x0A/* \\n */) { return false; }\n\n  pmax = state.pending.length - 1;\n  max = state.posMax;\n\n  // '  \\n' -> hardbreak\n  // Lookup in pending chars is bad practice! Don't copy to other rules!\n  // Pending string is stored in concat mode, indexed lookups will cause\n  // convertion to flat mode.\n  if (!silent) {\n    if (pmax >= 0 && state.pending.charCodeAt(pmax) === 0x20) {\n      if (pmax >= 1 && state.pending.charCodeAt(pmax - 1) === 0x20) {\n        state.pending = state.pending.replace(/ +$/, '');\n        state.push('hardbreak', 'br', 0);\n      } else {\n        state.pending = state.pending.slice(0, -1);\n        state.push('softbreak', 'br', 0);\n      }\n\n    } else {\n      state.push('softbreak', 'br', 0);\n    }\n  }\n\n  pos++;\n\n  // skip heading spaces for next line\n  while (pos < max && isSpace(state.src.charCodeAt(pos))) { pos++; }\n\n  state.pos = pos;\n  return true;\n};\n","// Process escaped chars and hardbreaks\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\nvar ESCAPED = [];\n\nfor (var i = 0; i < 256; i++) { ESCAPED.push(0); }\n\n'\\\\!\"#$%&\\'()*+,./:;<=>?@[]^_`{|}~-'\n  .split('').forEach(function (ch) { ESCAPED[ch.charCodeAt(0)] = 1; });\n\n\nmodule.exports = function escape(state, silent) {\n  var ch, pos = state.pos, max = state.posMax;\n\n  if (state.src.charCodeAt(pos) !== 0x5C/* \\ */) { return false; }\n\n  pos++;\n\n  if (pos < max) {\n    ch = state.src.charCodeAt(pos);\n\n    if (ch < 256 && ESCAPED[ch] !== 0) {\n      if (!silent) { state.pending += state.src[pos]; }\n      state.pos += 2;\n      return true;\n    }\n\n    if (ch === 0x0A) {\n      if (!silent) {\n        state.push('hardbreak', 'br', 0);\n      }\n\n      pos++;\n      // skip leading whitespaces from next line\n      while (pos < max) {\n        ch = state.src.charCodeAt(pos);\n        if (!isSpace(ch)) { break; }\n        pos++;\n      }\n\n      state.pos = pos;\n      return true;\n    }\n  }\n\n  if (!silent) { state.pending += '\\\\'; }\n  state.pos++;\n  return true;\n};\n","// Parse backticks\n\n'use strict';\n\nmodule.exports = function backtick(state, silent) {\n  var start, max, marker, matchStart, matchEnd, token,\n      pos = state.pos,\n      ch = state.src.charCodeAt(pos);\n\n  if (ch !== 0x60/* ` */) { return false; }\n\n  start = pos;\n  pos++;\n  max = state.posMax;\n\n  while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++; }\n\n  marker = state.src.slice(start, pos);\n\n  matchStart = matchEnd = pos;\n\n  while ((matchStart = state.src.indexOf('`', matchEnd)) !== -1) {\n    matchEnd = matchStart + 1;\n\n    while (matchEnd < max && state.src.charCodeAt(matchEnd) === 0x60/* ` */) { matchEnd++; }\n\n    if (matchEnd - matchStart === marker.length) {\n      if (!silent) {\n        token         = state.push('code_inline', 'code', 0);\n        token.markup  = marker;\n        token.content = state.src.slice(pos, matchStart)\n                                 .replace(/[ \\n]+/g, ' ')\n                                 .trim();\n      }\n      state.pos = matchEnd;\n      return true;\n    }\n  }\n\n  if (!silent) { state.pending += marker; }\n  state.pos += marker.length;\n  return true;\n};\n","// Process [link](<to> \"stuff\")\n\n'use strict';\n\nvar normalizeReference   = require('../common/utils').normalizeReference;\nvar isSpace              = require('../common/utils').isSpace;\n\n\nmodule.exports = function link(state, silent) {\n  var attrs,\n      code,\n      label,\n      labelEnd,\n      labelStart,\n      pos,\n      res,\n      ref,\n      title,\n      token,\n      href = '',\n      oldPos = state.pos,\n      max = state.posMax,\n      start = state.pos,\n      parseReference = true;\n\n  if (state.src.charCodeAt(state.pos) !== 0x5B/* [ */) { return false; }\n\n  labelStart = state.pos + 1;\n  labelEnd = state.md.helpers.parseLinkLabel(state, state.pos, true);\n\n  // parser failed to find ']', so it's not a valid link\n  if (labelEnd < 0) { return false; }\n\n  pos = labelEnd + 1;\n  if (pos < max && state.src.charCodeAt(pos) === 0x28/* ( */) {\n    //\n    // Inline link\n    //\n\n    // might have found a valid shortcut link, disable reference parsing\n    parseReference = false;\n\n    // [link](  <href>  \"title\"  )\n    //        ^^ skipping these spaces\n    pos++;\n    for (; pos < max; pos++) {\n      code = state.src.charCodeAt(pos);\n      if (!isSpace(code) && code !== 0x0A) { break; }\n    }\n    if (pos >= max) { return false; }\n\n    // [link](  <href>  \"title\"  )\n    //          ^^^^^^ parsing link destination\n    start = pos;\n    res = state.md.helpers.parseLinkDestination(state.src, pos, state.posMax);\n    if (res.ok) {\n      href = state.md.normalizeLink(res.str);\n      if (state.md.validateLink(href)) {\n        pos = res.pos;\n      } else {\n        href = '';\n      }\n    }\n\n    // [link](  <href>  \"title\"  )\n    //                ^^ skipping these spaces\n    start = pos;\n    for (; pos < max; pos++) {\n      code = state.src.charCodeAt(pos);\n      if (!isSpace(code) && code !== 0x0A) { break; }\n    }\n\n    // [link](  <href>  \"title\"  )\n    //                  ^^^^^^^ parsing link title\n    res = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);\n    if (pos < max && start !== pos && res.ok) {\n      title = res.str;\n      pos = res.pos;\n\n      // [link](  <href>  \"title\"  )\n      //                         ^^ skipping these spaces\n      for (; pos < max; pos++) {\n        code = state.src.charCodeAt(pos);\n        if (!isSpace(code) && code !== 0x0A) { break; }\n      }\n    } else {\n      title = '';\n    }\n\n    if (pos >= max || state.src.charCodeAt(pos) !== 0x29/* ) */) {\n      // parsing a valid shortcut link failed, fallback to reference\n      parseReference = true;\n    }\n    pos++;\n  }\n\n  if (parseReference) {\n    //\n    // Link reference\n    //\n    if (typeof state.env.references === 'undefined') { return false; }\n\n    if (pos < max && state.src.charCodeAt(pos) === 0x5B/* [ */) {\n      start = pos + 1;\n      pos = state.md.helpers.parseLinkLabel(state, pos);\n      if (pos >= 0) {\n        label = state.src.slice(start, pos++);\n      } else {\n        pos = labelEnd + 1;\n      }\n    } else {\n      pos = labelEnd + 1;\n    }\n\n    // covers label === '' and label === undefined\n    // (collapsed reference link and shortcut reference link respectively)\n    if (!label) { label = state.src.slice(labelStart, labelEnd); }\n\n    ref = state.env.references[normalizeReference(label)];\n    if (!ref) {\n      state.pos = oldPos;\n      return false;\n    }\n    href = ref.href;\n    title = ref.title;\n  }\n\n  //\n  // We found the end of the link, and know for a fact it's a valid link;\n  // so all that's left to do is to call tokenizer.\n  //\n  if (!silent) {\n    state.pos = labelStart;\n    state.posMax = labelEnd;\n\n    token        = state.push('link_open', 'a', 1);\n    token.attrs  = attrs = [ [ 'href', href ] ];\n    if (title) {\n      attrs.push([ 'title', title ]);\n    }\n\n    state.md.inline.tokenize(state);\n\n    token        = state.push('link_close', 'a', -1);\n  }\n\n  state.pos = pos;\n  state.posMax = max;\n  return true;\n};\n","// Process ![image](<src> \"title\")\n\n'use strict';\n\nvar normalizeReference   = require('../common/utils').normalizeReference;\nvar isSpace              = require('../common/utils').isSpace;\n\n\nmodule.exports = function image(state, silent) {\n  var attrs,\n      code,\n      content,\n      label,\n      labelEnd,\n      labelStart,\n      pos,\n      ref,\n      res,\n      title,\n      token,\n      tokens,\n      start,\n      href = '',\n      oldPos = state.pos,\n      max = state.posMax;\n\n  if (state.src.charCodeAt(state.pos) !== 0x21/* ! */) { return false; }\n  if (state.src.charCodeAt(state.pos + 1) !== 0x5B/* [ */) { return false; }\n\n  labelStart = state.pos + 2;\n  labelEnd = state.md.helpers.parseLinkLabel(state, state.pos + 1, false);\n\n  // parser failed to find ']', so it's not a valid link\n  if (labelEnd < 0) { return false; }\n\n  pos = labelEnd + 1;\n  if (pos < max && state.src.charCodeAt(pos) === 0x28/* ( */) {\n    //\n    // Inline link\n    //\n\n    // [link](  <href>  \"title\"  )\n    //        ^^ skipping these spaces\n    pos++;\n    for (; pos < max; pos++) {\n      code = state.src.charCodeAt(pos);\n      if (!isSpace(code) && code !== 0x0A) { break; }\n    }\n    if (pos >= max) { return false; }\n\n    // [link](  <href>  \"title\"  )\n    //          ^^^^^^ parsing link destination\n    start = pos;\n    res = state.md.helpers.parseLinkDestination(state.src, pos, state.posMax);\n    if (res.ok) {\n      href = state.md.normalizeLink(res.str);\n      if (state.md.validateLink(href)) {\n        pos = res.pos;\n      } else {\n        href = '';\n      }\n    }\n\n    // [link](  <href>  \"title\"  )\n    //                ^^ skipping these spaces\n    start = pos;\n    for (; pos < max; pos++) {\n      code = state.src.charCodeAt(pos);\n      if (!isSpace(code) && code !== 0x0A) { break; }\n    }\n\n    // [link](  <href>  \"title\"  )\n    //                  ^^^^^^^ parsing link title\n    res = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);\n    if (pos < max && start !== pos && res.ok) {\n      title = res.str;\n      pos = res.pos;\n\n      // [link](  <href>  \"title\"  )\n      //                         ^^ skipping these spaces\n      for (; pos < max; pos++) {\n        code = state.src.charCodeAt(pos);\n        if (!isSpace(code) && code !== 0x0A) { break; }\n      }\n    } else {\n      title = '';\n    }\n\n    if (pos >= max || state.src.charCodeAt(pos) !== 0x29/* ) */) {\n      state.pos = oldPos;\n      return false;\n    }\n    pos++;\n  } else {\n    //\n    // Link reference\n    //\n    if (typeof state.env.references === 'undefined') { return false; }\n\n    if (pos < max && state.src.charCodeAt(pos) === 0x5B/* [ */) {\n      start = pos + 1;\n      pos = state.md.helpers.parseLinkLabel(state, pos);\n      if (pos >= 0) {\n        label = state.src.slice(start, pos++);\n      } else {\n        pos = labelEnd + 1;\n      }\n    } else {\n      pos = labelEnd + 1;\n    }\n\n    // covers label === '' and label === undefined\n    // (collapsed reference link and shortcut reference link respectively)\n    if (!label) { label = state.src.slice(labelStart, labelEnd); }\n\n    ref = state.env.references[normalizeReference(label)];\n    if (!ref) {\n      state.pos = oldPos;\n      return false;\n    }\n    href = ref.href;\n    title = ref.title;\n  }\n\n  //\n  // We found the end of the link, and know for a fact it's a valid link;\n  // so all that's left to do is to call tokenizer.\n  //\n  if (!silent) {\n    content = state.src.slice(labelStart, labelEnd);\n\n    state.md.inline.parse(\n      content,\n      state.md,\n      state.env,\n      tokens = []\n    );\n\n    token          = state.push('image', 'img', 0);\n    token.attrs    = attrs = [ [ 'src', href ], [ 'alt', '' ] ];\n    token.children = tokens;\n    token.content  = content;\n\n    if (title) {\n      attrs.push([ 'title', title ]);\n    }\n  }\n\n  state.pos = pos;\n  state.posMax = max;\n  return true;\n};\n","// Process autolinks '<protocol:...>'\n\n'use strict';\n\n\n/*eslint max-len:0*/\nvar EMAIL_RE    = /^<([a-zA-Z0-9.!#$%&'*+\\/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)>/;\nvar AUTOLINK_RE = /^<([a-zA-Z][a-zA-Z0-9+.\\-]{1,31}):([^<>\\x00-\\x20]*)>/;\n\n\nmodule.exports = function autolink(state, silent) {\n  var tail, linkMatch, emailMatch, url, fullUrl, token,\n      pos = state.pos;\n\n  if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false; }\n\n  tail = state.src.slice(pos);\n\n  if (tail.indexOf('>') < 0) { return false; }\n\n  if (AUTOLINK_RE.test(tail)) {\n    linkMatch = tail.match(AUTOLINK_RE);\n\n    url = linkMatch[0].slice(1, -1);\n    fullUrl = state.md.normalizeLink(url);\n    if (!state.md.validateLink(fullUrl)) { return false; }\n\n    if (!silent) {\n      token         = state.push('link_open', 'a', 1);\n      token.attrs   = [ [ 'href', fullUrl ] ];\n      token.markup  = 'autolink';\n      token.info    = 'auto';\n\n      token         = state.push('text', '', 0);\n      token.content = state.md.normalizeLinkText(url);\n\n      token         = state.push('link_close', 'a', -1);\n      token.markup  = 'autolink';\n      token.info    = 'auto';\n    }\n\n    state.pos += linkMatch[0].length;\n    return true;\n  }\n\n  if (EMAIL_RE.test(tail)) {\n    emailMatch = tail.match(EMAIL_RE);\n\n    url = emailMatch[0].slice(1, -1);\n    fullUrl = state.md.normalizeLink('mailto:' + url);\n    if (!state.md.validateLink(fullUrl)) { return false; }\n\n    if (!silent) {\n      token         = state.push('link_open', 'a', 1);\n      token.attrs   = [ [ 'href', fullUrl ] ];\n      token.markup  = 'autolink';\n      token.info    = 'auto';\n\n      token         = state.push('text', '', 0);\n      token.content = state.md.normalizeLinkText(url);\n\n      token         = state.push('link_close', 'a', -1);\n      token.markup  = 'autolink';\n      token.info    = 'auto';\n    }\n\n    state.pos += emailMatch[0].length;\n    return true;\n  }\n\n  return false;\n};\n","// Process html tags\n\n'use strict';\n\n\nvar HTML_TAG_RE = require('../common/html_re').HTML_TAG_RE;\n\n\nfunction isLetter(ch) {\n  /*eslint no-bitwise:0*/\n  var lc = ch | 0x20; // to lower case\n  return (lc >= 0x61/* a */) && (lc <= 0x7a/* z */);\n}\n\n\nmodule.exports = function html_inline(state, silent) {\n  var ch, match, max, token,\n      pos = state.pos;\n\n  if (!state.md.options.html) { return false; }\n\n  // Check start\n  max = state.posMax;\n  if (state.src.charCodeAt(pos) !== 0x3C/* < */ ||\n      pos + 2 >= max) {\n    return false;\n  }\n\n  // Quick fail on second char\n  ch = state.src.charCodeAt(pos + 1);\n  if (ch !== 0x21/* ! */ &&\n      ch !== 0x3F/* ? */ &&\n      ch !== 0x2F/* / */ &&\n      !isLetter(ch)) {\n    return false;\n  }\n\n  match = state.src.slice(pos).match(HTML_TAG_RE);\n  if (!match) { return false; }\n\n  if (!silent) {\n    token         = state.push('html_inline', '', 0);\n    token.content = state.src.slice(pos, pos + match[0].length);\n  }\n  state.pos += match[0].length;\n  return true;\n};\n","// Process html entity - &#123;, &#xAF;, &quot;, ...\n\n'use strict';\n\nvar entities          = require('../common/entities');\nvar has               = require('../common/utils').has;\nvar isValidEntityCode = require('../common/utils').isValidEntityCode;\nvar fromCodePoint     = require('../common/utils').fromCodePoint;\n\n\nvar DIGITAL_RE = /^&#((?:x[a-f0-9]{1,8}|[0-9]{1,8}));/i;\nvar NAMED_RE   = /^&([a-z][a-z0-9]{1,31});/i;\n\n\nmodule.exports = function entity(state, silent) {\n  var ch, code, match, pos = state.pos, max = state.posMax;\n\n  if (state.src.charCodeAt(pos) !== 0x26/* & */) { return false; }\n\n  if (pos + 1 < max) {\n    ch = state.src.charCodeAt(pos + 1);\n\n    if (ch === 0x23 /* # */) {\n      match = state.src.slice(pos).match(DIGITAL_RE);\n      if (match) {\n        if (!silent) {\n          code = match[1][0].toLowerCase() === 'x' ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10);\n          state.pending += isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(0xFFFD);\n        }\n        state.pos += match[0].length;\n        return true;\n      }\n    } else {\n      match = state.src.slice(pos).match(NAMED_RE);\n      if (match) {\n        if (has(entities, match[1])) {\n          if (!silent) { state.pending += entities[match[1]]; }\n          state.pos += match[0].length;\n          return true;\n        }\n      }\n    }\n  }\n\n  if (!silent) { state.pending += '&'; }\n  state.pos++;\n  return true;\n};\n","// For each opening emphasis-like marker find a matching closing one\n//\n'use strict';\n\n\nmodule.exports = function link_pairs(state) {\n  var i, j, lastDelim, currDelim,\n      delimiters = state.delimiters,\n      max = state.delimiters.length;\n\n  for (i = 0; i < max; i++) {\n    lastDelim = delimiters[i];\n\n    if (!lastDelim.close) { continue; }\n\n    j = i - lastDelim.jump - 1;\n\n    while (j >= 0) {\n      currDelim = delimiters[j];\n\n      if (currDelim.open &&\n          currDelim.marker === lastDelim.marker &&\n          currDelim.end < 0 &&\n          currDelim.level === lastDelim.level) {\n\n        // typeofs are for backward compatibility with plugins\n        var odd_match = (currDelim.close || lastDelim.open) &&\n                        typeof currDelim.length !== 'undefined' &&\n                        typeof lastDelim.length !== 'undefined' &&\n                        (currDelim.length + lastDelim.length) % 3 === 0;\n\n        if (!odd_match) {\n          lastDelim.jump = i - j;\n          lastDelim.open = false;\n          currDelim.end  = i;\n          currDelim.jump = 0;\n          break;\n        }\n      }\n\n      j -= currDelim.jump + 1;\n    }\n  }\n};\n","// Merge adjacent text nodes into one, and re-calculate all token levels\n//\n'use strict';\n\n\nmodule.exports = function text_collapse(state) {\n  var curr, last,\n      level = 0,\n      tokens = state.tokens,\n      max = state.tokens.length;\n\n  for (curr = last = 0; curr < max; curr++) {\n    // re-calculate levels\n    level += tokens[curr].nesting;\n    tokens[curr].level = level;\n\n    if (tokens[curr].type === 'text' &&\n        curr + 1 < max &&\n        tokens[curr + 1].type === 'text') {\n\n      // collapse two adjacent text nodes\n      tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content;\n    } else {\n      if (curr !== last) { tokens[last] = tokens[curr]; }\n\n      last++;\n    }\n  }\n\n  if (curr !== last) {\n    tokens.length = last;\n  }\n};\n","// Inline parser state\n\n'use strict';\n\n\nvar Token          = require('../token');\nvar isWhiteSpace   = require('../common/utils').isWhiteSpace;\nvar isPunctChar    = require('../common/utils').isPunctChar;\nvar isMdAsciiPunct = require('../common/utils').isMdAsciiPunct;\n\n\nfunction StateInline(src, md, env, outTokens) {\n  this.src = src;\n  this.env = env;\n  this.md = md;\n  this.tokens = outTokens;\n\n  this.pos = 0;\n  this.posMax = this.src.length;\n  this.level = 0;\n  this.pending = '';\n  this.pendingLevel = 0;\n\n  this.cache = {};        // Stores { start: end } pairs. Useful for backtrack\n                          // optimization of pairs parse (emphasis, strikes).\n\n  this.delimiters = [];   // Emphasis-like delimiters\n}\n\n\n// Flush pending text\n//\nStateInline.prototype.pushPending = function () {\n  var token = new Token('text', '', 0);\n  token.content = this.pending;\n  token.level = this.pendingLevel;\n  this.tokens.push(token);\n  this.pending = '';\n  return token;\n};\n\n\n// Push new token to \"stream\".\n// If pending text exists - flush it as text token\n//\nStateInline.prototype.push = function (type, tag, nesting) {\n  if (this.pending) {\n    this.pushPending();\n  }\n\n  var token = new Token(type, tag, nesting);\n\n  if (nesting < 0) { this.level--; }\n  token.level = this.level;\n  if (nesting > 0) { this.level++; }\n\n  this.pendingLevel = this.level;\n  this.tokens.push(token);\n  return token;\n};\n\n\n// Scan a sequence of emphasis-like markers, and determine whether\n// it can start an emphasis sequence or end an emphasis sequence.\n//\n//  - start - position to scan from (it should point at a valid marker);\n//  - canSplitWord - determine if these markers can be found inside a word\n//\nStateInline.prototype.scanDelims = function (start, canSplitWord) {\n  var pos = start, lastChar, nextChar, count, can_open, can_close,\n      isLastWhiteSpace, isLastPunctChar,\n      isNextWhiteSpace, isNextPunctChar,\n      left_flanking = true,\n      right_flanking = true,\n      max = this.posMax,\n      marker = this.src.charCodeAt(start);\n\n  // treat beginning of the line as a whitespace\n  lastChar = start > 0 ? this.src.charCodeAt(start - 1) : 0x20;\n\n  while (pos < max && this.src.charCodeAt(pos) === marker) { pos++; }\n\n  count = pos - start;\n\n  // treat end of the line as a whitespace\n  nextChar = pos < max ? this.src.charCodeAt(pos) : 0x20;\n\n  isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctChar(String.fromCharCode(lastChar));\n  isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctChar(String.fromCharCode(nextChar));\n\n  isLastWhiteSpace = isWhiteSpace(lastChar);\n  isNextWhiteSpace = isWhiteSpace(nextChar);\n\n  if (isNextWhiteSpace) {\n    left_flanking = false;\n  } else if (isNextPunctChar) {\n    if (!(isLastWhiteSpace || isLastPunctChar)) {\n      left_flanking = false;\n    }\n  }\n\n  if (isLastWhiteSpace) {\n    right_flanking = false;\n  } else if (isLastPunctChar) {\n    if (!(isNextWhiteSpace || isNextPunctChar)) {\n      right_flanking = false;\n    }\n  }\n\n  if (!canSplitWord) {\n    can_open  = left_flanking  && (!right_flanking || isLastPunctChar);\n    can_close = right_flanking && (!left_flanking  || isNextPunctChar);\n  } else {\n    can_open  = left_flanking;\n    can_close = right_flanking;\n  }\n\n  return {\n    can_open:  can_open,\n    can_close: can_close,\n    length:    count\n  };\n};\n\n\n// re-export Token class to use in block rules\nStateInline.prototype.Token = Token;\n\n\nmodule.exports = StateInline;\n","'use strict';\n\n\n////////////////////////////////////////////////////////////////////////////////\n// Helpers\n\n// Merge objects\n//\nfunction assign(obj /*from1, from2, from3, ...*/) {\n  var sources = Array.prototype.slice.call(arguments, 1);\n\n  sources.forEach(function (source) {\n    if (!source) { return; }\n\n    Object.keys(source).forEach(function (key) {\n      obj[key] = source[key];\n    });\n  });\n\n  return obj;\n}\n\nfunction _class(obj) { return Object.prototype.toString.call(obj); }\nfunction isString(obj) { return _class(obj) === '[object String]'; }\nfunction isObject(obj) { return _class(obj) === '[object Object]'; }\nfunction isRegExp(obj) { return _class(obj) === '[object RegExp]'; }\nfunction isFunction(obj) { return _class(obj) === '[object Function]'; }\n\n\nfunction escapeRE(str) { return str.replace(/[.?*+^$[\\]\\\\(){}|-]/g, '\\\\$&'); }\n\n////////////////////////////////////////////////////////////////////////////////\n\n\nvar defaultOptions = {\n  fuzzyLink: true,\n  fuzzyEmail: true,\n  fuzzyIP: false\n};\n\n\nfunction isOptionsObj(obj) {\n  return Object.keys(obj || {}).reduce(function (acc, k) {\n    return acc || defaultOptions.hasOwnProperty(k);\n  }, false);\n}\n\n\nvar defaultSchemas = {\n  'http:': {\n    validate: function (text, pos, self) {\n      var tail = text.slice(pos);\n\n      if (!self.re.http) {\n        // compile lazily, because \"host\"-containing variables can change on tlds update.\n        self.re.http =  new RegExp(\n          '^\\\\/\\\\/' + self.re.src_auth + self.re.src_host_port_strict + self.re.src_path, 'i'\n        );\n      }\n      if (self.re.http.test(tail)) {\n        return tail.match(self.re.http)[0].length;\n      }\n      return 0;\n    }\n  },\n  'https:':  'http:',\n  'ftp:':    'http:',\n  '//':      {\n    validate: function (text, pos, self) {\n      var tail = text.slice(pos);\n\n      if (!self.re.no_http) {\n      // compile lazily, because \"host\"-containing variables can change on tlds update.\n        self.re.no_http =  new RegExp(\n          '^' +\n          self.re.src_auth +\n          // Don't allow single-level domains, because of false positives like '//test'\n          // with code comments\n          '(?:localhost|(?:(?:' + self.re.src_domain + ')\\\\.)+' + self.re.src_domain_root + ')' +\n          self.re.src_port +\n          self.re.src_host_terminator +\n          self.re.src_path,\n\n          'i'\n        );\n      }\n\n      if (self.re.no_http.test(tail)) {\n        // should not be `://` & `///`, that protects from errors in protocol name\n        if (pos >= 3 && text[pos - 3] === ':') { return 0; }\n        if (pos >= 3 && text[pos - 3] === '/') { return 0; }\n        return tail.match(self.re.no_http)[0].length;\n      }\n      return 0;\n    }\n  },\n  'mailto:': {\n    validate: function (text, pos, self) {\n      var tail = text.slice(pos);\n\n      if (!self.re.mailto) {\n        self.re.mailto =  new RegExp(\n          '^' + self.re.src_email_name + '@' + self.re.src_host_strict, 'i'\n        );\n      }\n      if (self.re.mailto.test(tail)) {\n        return tail.match(self.re.mailto)[0].length;\n      }\n      return 0;\n    }\n  }\n};\n\n/*eslint-disable max-len*/\n\n// RE pattern for 2-character tlds (autogenerated by ./support/tlds_2char_gen.js)\nvar tlds_2ch_src_re = 'a[cdefgilmnoqrstuwxz]|b[abdefghijmnorstvwyz]|c[acdfghiklmnoruvwxyz]|d[ejkmoz]|e[cegrstu]|f[ijkmor]|g[abdefghilmnpqrstuwy]|h[kmnrtu]|i[delmnoqrst]|j[emop]|k[eghimnprwyz]|l[abcikrstuvy]|m[acdeghklmnopqrstuvwxyz]|n[acefgilopruz]|om|p[aefghklmnrstwy]|qa|r[eosuw]|s[abcdeghijklmnortuvxyz]|t[cdfghjklmnortvwz]|u[agksyz]|v[aceginu]|w[fs]|y[et]|z[amw]';\n\n// DON'T try to make PRs with changes. Extend TLDs with LinkifyIt.tlds() instead\nvar tlds_default = 'biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф'.split('|');\n\n/*eslint-enable max-len*/\n\n////////////////////////////////////////////////////////////////////////////////\n\nfunction resetScanCache(self) {\n  self.__index__ = -1;\n  self.__text_cache__   = '';\n}\n\nfunction createValidator(re) {\n  return function (text, pos) {\n    var tail = text.slice(pos);\n\n    if (re.test(tail)) {\n      return tail.match(re)[0].length;\n    }\n    return 0;\n  };\n}\n\nfunction createNormalizer() {\n  return function (match, self) {\n    self.normalize(match);\n  };\n}\n\n// Schemas compiler. Build regexps.\n//\nfunction compile(self) {\n\n  // Load & clone RE patterns.\n  var re = self.re = require('./lib/re')(self.__opts__);\n\n  // Define dynamic patterns\n  var tlds = self.__tlds__.slice();\n\n  self.onCompile();\n\n  if (!self.__tlds_replaced__) {\n    tlds.push(tlds_2ch_src_re);\n  }\n  tlds.push(re.src_xn);\n\n  re.src_tlds = tlds.join('|');\n\n  function untpl(tpl) { return tpl.replace('%TLDS%', re.src_tlds); }\n\n  re.email_fuzzy      = RegExp(untpl(re.tpl_email_fuzzy), 'i');\n  re.link_fuzzy       = RegExp(untpl(re.tpl_link_fuzzy), 'i');\n  re.link_no_ip_fuzzy = RegExp(untpl(re.tpl_link_no_ip_fuzzy), 'i');\n  re.host_fuzzy_test  = RegExp(untpl(re.tpl_host_fuzzy_test), 'i');\n\n  //\n  // Compile each schema\n  //\n\n  var aliases = [];\n\n  self.__compiled__ = {}; // Reset compiled data\n\n  function schemaError(name, val) {\n    throw new Error('(LinkifyIt) Invalid schema \"' + name + '\": ' + val);\n  }\n\n  Object.keys(self.__schemas__).forEach(function (name) {\n    var val = self.__schemas__[name];\n\n    // skip disabled methods\n    if (val === null) { return; }\n\n    var compiled = { validate: null, link: null };\n\n    self.__compiled__[name] = compiled;\n\n    if (isObject(val)) {\n      if (isRegExp(val.validate)) {\n        compiled.validate = createValidator(val.validate);\n      } else if (isFunction(val.validate)) {\n        compiled.validate = val.validate;\n      } else {\n        schemaError(name, val);\n      }\n\n      if (isFunction(val.normalize)) {\n        compiled.normalize = val.normalize;\n      } else if (!val.normalize) {\n        compiled.normalize = createNormalizer();\n      } else {\n        schemaError(name, val);\n      }\n\n      return;\n    }\n\n    if (isString(val)) {\n      aliases.push(name);\n      return;\n    }\n\n    schemaError(name, val);\n  });\n\n  //\n  // Compile postponed aliases\n  //\n\n  aliases.forEach(function (alias) {\n    if (!self.__compiled__[self.__schemas__[alias]]) {\n      // Silently fail on missed schemas to avoid errons on disable.\n      // schemaError(alias, self.__schemas__[alias]);\n      return;\n    }\n\n    self.__compiled__[alias].validate =\n      self.__compiled__[self.__schemas__[alias]].validate;\n    self.__compiled__[alias].normalize =\n      self.__compiled__[self.__schemas__[alias]].normalize;\n  });\n\n  //\n  // Fake record for guessed links\n  //\n  self.__compiled__[''] = { validate: null, normalize: createNormalizer() };\n\n  //\n  // Build schema condition\n  //\n  var slist = Object.keys(self.__compiled__)\n                      .filter(function (name) {\n                        // Filter disabled & fake schemas\n                        return name.length > 0 && self.__compiled__[name];\n                      })\n                      .map(escapeRE)\n                      .join('|');\n  // (?!_) cause 1.5x slowdown\n  self.re.schema_test   = RegExp('(^|(?!_)(?:[><\\uff5c]|' + re.src_ZPCc + '))(' + slist + ')', 'i');\n  self.re.schema_search = RegExp('(^|(?!_)(?:[><\\uff5c]|' + re.src_ZPCc + '))(' + slist + ')', 'ig');\n\n  self.re.pretest = RegExp(\n    '(' + self.re.schema_test.source + ')|(' + self.re.host_fuzzy_test.source + ')|@',\n    'i'\n  );\n\n  //\n  // Cleanup\n  //\n\n  resetScanCache(self);\n}\n\n/**\n * class Match\n *\n * Match result. Single element of array, returned by [[LinkifyIt#match]]\n **/\nfunction Match(self, shift) {\n  var start = self.__index__,\n      end   = self.__last_index__,\n      text  = self.__text_cache__.slice(start, end);\n\n  /**\n   * Match#schema -> String\n   *\n   * Prefix (protocol) for matched string.\n   **/\n  this.schema    = self.__schema__.toLowerCase();\n  /**\n   * Match#index -> Number\n   *\n   * First position of matched string.\n   **/\n  this.index     = start + shift;\n  /**\n   * Match#lastIndex -> Number\n   *\n   * Next position after matched string.\n   **/\n  this.lastIndex = end + shift;\n  /**\n   * Match#raw -> String\n   *\n   * Matched string.\n   **/\n  this.raw       = text;\n  /**\n   * Match#text -> String\n   *\n   * Notmalized text of matched string.\n   **/\n  this.text      = text;\n  /**\n   * Match#url -> String\n   *\n   * Normalized url of matched string.\n   **/\n  this.url       = text;\n}\n\nfunction createMatch(self, shift) {\n  var match = new Match(self, shift);\n\n  self.__compiled__[match.schema].normalize(match, self);\n\n  return match;\n}\n\n\n/**\n * class LinkifyIt\n **/\n\n/**\n * new LinkifyIt(schemas, options)\n * - schemas (Object): Optional. Additional schemas to validate (prefix/validator)\n * - options (Object): { fuzzyLink|fuzzyEmail|fuzzyIP: true|false }\n *\n * Creates new linkifier instance with optional additional schemas.\n * Can be called without `new` keyword for convenience.\n *\n * By default understands:\n *\n * - `http(s)://...` , `ftp://...`, `mailto:...` & `//...` links\n * - \"fuzzy\" links and emails (example.com, foo@bar.com).\n *\n * `schemas` is an object, where each key/value describes protocol/rule:\n *\n * - __key__ - link prefix (usually, protocol name with `:` at the end, `skype:`\n *   for example). `linkify-it` makes shure that prefix is not preceeded with\n *   alphanumeric char and symbols. Only whitespaces and punctuation allowed.\n * - __value__ - rule to check tail after link prefix\n *   - _String_ - just alias to existing rule\n *   - _Object_\n *     - _validate_ - validator function (should return matched length on success),\n *       or `RegExp`.\n *     - _normalize_ - optional function to normalize text & url of matched result\n *       (for example, for @twitter mentions).\n *\n * `options`:\n *\n * - __fuzzyLink__ - recognige URL-s without `http(s):` prefix. Default `true`.\n * - __fuzzyIP__ - allow IPs in fuzzy links above. Can conflict with some texts\n *   like version numbers. Default `false`.\n * - __fuzzyEmail__ - recognize emails without `mailto:` prefix.\n *\n **/\nfunction LinkifyIt(schemas, options) {\n  if (!(this instanceof LinkifyIt)) {\n    return new LinkifyIt(schemas, options);\n  }\n\n  if (!options) {\n    if (isOptionsObj(schemas)) {\n      options = schemas;\n      schemas = {};\n    }\n  }\n\n  this.__opts__           = assign({}, defaultOptions, options);\n\n  // Cache last tested result. Used to skip repeating steps on next `match` call.\n  this.__index__          = -1;\n  this.__last_index__     = -1; // Next scan position\n  this.__schema__         = '';\n  this.__text_cache__     = '';\n\n  this.__schemas__        = assign({}, defaultSchemas, schemas);\n  this.__compiled__       = {};\n\n  this.__tlds__           = tlds_default;\n  this.__tlds_replaced__  = false;\n\n  this.re = {};\n\n  compile(this);\n}\n\n\n/** chainable\n * LinkifyIt#add(schema, definition)\n * - schema (String): rule name (fixed pattern prefix)\n * - definition (String|RegExp|Object): schema definition\n *\n * Add new rule definition. See constructor description for details.\n **/\nLinkifyIt.prototype.add = function add(schema, definition) {\n  this.__schemas__[schema] = definition;\n  compile(this);\n  return this;\n};\n\n\n/** chainable\n * LinkifyIt#set(options)\n * - options (Object): { fuzzyLink|fuzzyEmail|fuzzyIP: true|false }\n *\n * Set recognition options for links without schema.\n **/\nLinkifyIt.prototype.set = function set(options) {\n  this.__opts__ = assign(this.__opts__, options);\n  return this;\n};\n\n\n/**\n * LinkifyIt#test(text) -> Boolean\n *\n * Searches linkifiable pattern and returns `true` on success or `false` on fail.\n **/\nLinkifyIt.prototype.test = function test(text) {\n  // Reset scan cache\n  this.__text_cache__ = text;\n  this.__index__      = -1;\n\n  if (!text.length) { return false; }\n\n  var m, ml, me, len, shift, next, re, tld_pos, at_pos;\n\n  // try to scan for link with schema - that's the most simple rule\n  if (this.re.schema_test.test(text)) {\n    re = this.re.schema_search;\n    re.lastIndex = 0;\n    while ((m = re.exec(text)) !== null) {\n      len = this.testSchemaAt(text, m[2], re.lastIndex);\n      if (len) {\n        this.__schema__     = m[2];\n        this.__index__      = m.index + m[1].length;\n        this.__last_index__ = m.index + m[0].length + len;\n        break;\n      }\n    }\n  }\n\n  if (this.__opts__.fuzzyLink && this.__compiled__['http:']) {\n    // guess schemaless links\n    tld_pos = text.search(this.re.host_fuzzy_test);\n    if (tld_pos >= 0) {\n      // if tld is located after found link - no need to check fuzzy pattern\n      if (this.__index__ < 0 || tld_pos < this.__index__) {\n        if ((ml = text.match(this.__opts__.fuzzyIP ? this.re.link_fuzzy : this.re.link_no_ip_fuzzy)) !== null) {\n\n          shift = ml.index + ml[1].length;\n\n          if (this.__index__ < 0 || shift < this.__index__) {\n            this.__schema__     = '';\n            this.__index__      = shift;\n            this.__last_index__ = ml.index + ml[0].length;\n          }\n        }\n      }\n    }\n  }\n\n  if (this.__opts__.fuzzyEmail && this.__compiled__['mailto:']) {\n    // guess schemaless emails\n    at_pos = text.indexOf('@');\n    if (at_pos >= 0) {\n      // We can't skip this check, because this cases are possible:\n      // 192.168.1.1@gmail.com, my.in@example.com\n      if ((me = text.match(this.re.email_fuzzy)) !== null) {\n\n        shift = me.index + me[1].length;\n        next  = me.index + me[0].length;\n\n        if (this.__index__ < 0 || shift < this.__index__ ||\n            (shift === this.__index__ && next > this.__last_index__)) {\n          this.__schema__     = 'mailto:';\n          this.__index__      = shift;\n          this.__last_index__ = next;\n        }\n      }\n    }\n  }\n\n  return this.__index__ >= 0;\n};\n\n\n/**\n * LinkifyIt#pretest(text) -> Boolean\n *\n * Very quick check, that can give false positives. Returns true if link MAY BE\n * can exists. Can be used for speed optimization, when you need to check that\n * link NOT exists.\n **/\nLinkifyIt.prototype.pretest = function pretest(text) {\n  return this.re.pretest.test(text);\n};\n\n\n/**\n * LinkifyIt#testSchemaAt(text, name, position) -> Number\n * - text (String): text to scan\n * - name (String): rule (schema) name\n * - position (Number): text offset to check from\n *\n * Similar to [[LinkifyIt#test]] but checks only specific protocol tail exactly\n * at given position. Returns length of found pattern (0 on fail).\n **/\nLinkifyIt.prototype.testSchemaAt = function testSchemaAt(text, schema, pos) {\n  // If not supported schema check requested - terminate\n  if (!this.__compiled__[schema.toLowerCase()]) {\n    return 0;\n  }\n  return this.__compiled__[schema.toLowerCase()].validate(text, pos, this);\n};\n\n\n/**\n * LinkifyIt#match(text) -> Array|null\n *\n * Returns array of found link descriptions or `null` on fail. We strongly\n * recommend to use [[LinkifyIt#test]] first, for best speed.\n *\n * ##### Result match description\n *\n * - __schema__ - link schema, can be empty for fuzzy links, or `//` for\n *   protocol-neutral  links.\n * - __index__ - offset of matched text\n * - __lastIndex__ - index of next char after mathch end\n * - __raw__ - matched text\n * - __text__ - normalized text\n * - __url__ - link, generated from matched text\n **/\nLinkifyIt.prototype.match = function match(text) {\n  var shift = 0, result = [];\n\n  // Try to take previous element from cache, if .test() called before\n  if (this.__index__ >= 0 && this.__text_cache__ === text) {\n    result.push(createMatch(this, shift));\n    shift = this.__last_index__;\n  }\n\n  // Cut head if cache was used\n  var tail = shift ? text.slice(shift) : text;\n\n  // Scan string until end reached\n  while (this.test(tail)) {\n    result.push(createMatch(this, shift));\n\n    tail = tail.slice(this.__last_index__);\n    shift += this.__last_index__;\n  }\n\n  if (result.length) {\n    return result;\n  }\n\n  return null;\n};\n\n\n/** chainable\n * LinkifyIt#tlds(list [, keepOld]) -> this\n * - list (Array): list of tlds\n * - keepOld (Boolean): merge with current list if `true` (`false` by default)\n *\n * Load (or merge) new tlds list. Those are user for fuzzy links (without prefix)\n * to avoid false positives. By default this algorythm used:\n *\n * - hostname with any 2-letter root zones are ok.\n * - biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф\n *   are ok.\n * - encoded (`xn--...`) root zones are ok.\n *\n * If list is replaced, then exact match for 2-chars root zones will be checked.\n **/\nLinkifyIt.prototype.tlds = function tlds(list, keepOld) {\n  list = Array.isArray(list) ? list : [ list ];\n\n  if (!keepOld) {\n    this.__tlds__ = list.slice();\n    this.__tlds_replaced__ = true;\n    compile(this);\n    return this;\n  }\n\n  this.__tlds__ = this.__tlds__.concat(list)\n                                  .sort()\n                                  .filter(function (el, idx, arr) {\n                                    return el !== arr[idx - 1];\n                                  })\n                                  .reverse();\n\n  compile(this);\n  return this;\n};\n\n/**\n * LinkifyIt#normalize(match)\n *\n * Default normalizer (if schema does not define it's own).\n **/\nLinkifyIt.prototype.normalize = function normalize(match) {\n\n  // Do minimal possible changes by default. Need to collect feedback prior\n  // to move forward https://github.com/markdown-it/linkify-it/issues/1\n\n  if (!match.schema) { match.url = 'http://' + match.url; }\n\n  if (match.schema === 'mailto:' && !/^mailto:/i.test(match.url)) {\n    match.url = 'mailto:' + match.url;\n  }\n};\n\n\n/**\n * LinkifyIt#onCompile()\n *\n * Override to modify basic RegExp-s.\n **/\nLinkifyIt.prototype.onCompile = function onCompile() {\n};\n\n\nmodule.exports = LinkifyIt;\n","'use strict';\n\n\nmodule.exports = function (opts) {\n  var re = {};\n\n  // Use direct extract instead of `regenerate` to reduse browserified size\n  re.src_Any = require('uc.micro/properties/Any/regex').source;\n  re.src_Cc  = require('uc.micro/categories/Cc/regex').source;\n  re.src_Z   = require('uc.micro/categories/Z/regex').source;\n  re.src_P   = require('uc.micro/categories/P/regex').source;\n\n  // \\p{\\Z\\P\\Cc\\CF} (white spaces + control + format + punctuation)\n  re.src_ZPCc = [ re.src_Z, re.src_P, re.src_Cc ].join('|');\n\n  // \\p{\\Z\\Cc} (white spaces + control)\n  re.src_ZCc = [ re.src_Z, re.src_Cc ].join('|');\n\n  // Experimental. List of chars, completely prohibited in links\n  // because can separate it from other part of text\n  var text_separators = '[><\\uff5c]';\n\n  // All possible word characters (everything without punctuation, spaces & controls)\n  // Defined via punctuation & spaces to save space\n  // Should be something like \\p{\\L\\N\\S\\M} (\\w but without `_`)\n  re.src_pseudo_letter       = '(?:(?!' + text_separators + '|' + re.src_ZPCc + ')' + re.src_Any + ')';\n  // The same as abothe but without [0-9]\n  // var src_pseudo_letter_non_d = '(?:(?![0-9]|' + src_ZPCc + ')' + src_Any + ')';\n\n  ////////////////////////////////////////////////////////////////////////////////\n\n  re.src_ip4 =\n\n    '(?:(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\\\.){3}(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)';\n\n  // Prohibit any of \"@/[]()\" in user/pass to avoid wrong domain fetch.\n  re.src_auth    = '(?:(?:(?!' + re.src_ZCc + '|[@/\\\\[\\\\]()]).)+@)?';\n\n  re.src_port =\n\n    '(?::(?:6(?:[0-4]\\\\d{3}|5(?:[0-4]\\\\d{2}|5(?:[0-2]\\\\d|3[0-5])))|[1-5]?\\\\d{1,4}))?';\n\n  re.src_host_terminator =\n\n    '(?=$|' + text_separators + '|' + re.src_ZPCc + ')(?!-|_|:\\\\d|\\\\.-|\\\\.(?!$|' + re.src_ZPCc + '))';\n\n  re.src_path =\n\n    '(?:' +\n      '[/?#]' +\n        '(?:' +\n          '(?!' + re.src_ZCc + '|' + text_separators + '|[()[\\\\]{}.,\"\\'?!\\\\-]).|' +\n          '\\\\[(?:(?!' + re.src_ZCc + '|\\\\]).)*\\\\]|' +\n          '\\\\((?:(?!' + re.src_ZCc + '|[)]).)*\\\\)|' +\n          '\\\\{(?:(?!' + re.src_ZCc + '|[}]).)*\\\\}|' +\n          '\\\\\"(?:(?!' + re.src_ZCc + '|[\"]).)+\\\\\"|' +\n          \"\\\\'(?:(?!\" + re.src_ZCc + \"|[']).)+\\\\'|\" +\n          \"\\\\'(?=\" + re.src_pseudo_letter + '|[-]).|' +  // allow `I'm_king` if no pair found\n          '\\\\.{2,4}[a-zA-Z0-9%/]|' + // github has ... in commit range links,\n                                     // google has .... in links (issue #66)\n                                     // Restrict to\n                                     // - english\n                                     // - percent-encoded\n                                     // - parts of file path\n                                     // until more examples found.\n          '\\\\.(?!' + re.src_ZCc + '|[.]).|' +\n          (opts && opts['---'] ?\n            '\\\\-(?!--(?:[^-]|$))(?:-*)|' // `---` => long dash, terminate\n            :\n            '\\\\-+|'\n          ) +\n          '\\\\,(?!' + re.src_ZCc + ').|' +      // allow `,,,` in paths\n          '\\\\!(?!' + re.src_ZCc + '|[!]).|' +\n          '\\\\?(?!' + re.src_ZCc + '|[?]).' +\n        ')+' +\n      '|\\\\/' +\n    ')?';\n\n  // Allow anything in markdown spec, forbid quote (\") at the first position\n  // because emails enclosed in quotes are far more common\n  re.src_email_name =\n\n    '[\\\\-;:&=\\\\+\\\\$,\\\\.a-zA-Z0-9_][\\\\-;:&=\\\\+\\\\$,\\\\\"\\\\.a-zA-Z0-9_]*';\n\n  re.src_xn =\n\n    'xn--[a-z0-9\\\\-]{1,59}';\n\n  // More to read about domain names\n  // http://serverfault.com/questions/638260/\n\n  re.src_domain_root =\n\n    // Allow letters & digits (http://test1)\n    '(?:' +\n      re.src_xn +\n      '|' +\n      re.src_pseudo_letter + '{1,63}' +\n    ')';\n\n  re.src_domain =\n\n    '(?:' +\n      re.src_xn +\n      '|' +\n      '(?:' + re.src_pseudo_letter + ')' +\n      '|' +\n      '(?:' + re.src_pseudo_letter + '(?:-|' + re.src_pseudo_letter + '){0,61}' + re.src_pseudo_letter + ')' +\n    ')';\n\n  re.src_host =\n\n    '(?:' +\n    // Don't need IP check, because digits are already allowed in normal domain names\n    //   src_ip4 +\n    // '|' +\n      '(?:(?:(?:' + re.src_domain + ')\\\\.)*' + re.src_domain/*_root*/ + ')' +\n    ')';\n\n  re.tpl_host_fuzzy =\n\n    '(?:' +\n      re.src_ip4 +\n    '|' +\n      '(?:(?:(?:' + re.src_domain + ')\\\\.)+(?:%TLDS%))' +\n    ')';\n\n  re.tpl_host_no_ip_fuzzy =\n\n    '(?:(?:(?:' + re.src_domain + ')\\\\.)+(?:%TLDS%))';\n\n  re.src_host_strict =\n\n    re.src_host + re.src_host_terminator;\n\n  re.tpl_host_fuzzy_strict =\n\n    re.tpl_host_fuzzy + re.src_host_terminator;\n\n  re.src_host_port_strict =\n\n    re.src_host + re.src_port + re.src_host_terminator;\n\n  re.tpl_host_port_fuzzy_strict =\n\n    re.tpl_host_fuzzy + re.src_port + re.src_host_terminator;\n\n  re.tpl_host_port_no_ip_fuzzy_strict =\n\n    re.tpl_host_no_ip_fuzzy + re.src_port + re.src_host_terminator;\n\n\n  ////////////////////////////////////////////////////////////////////////////////\n  // Main rules\n\n  // Rude test fuzzy links by host, for quick deny\n  re.tpl_host_fuzzy_test =\n\n    'localhost|www\\\\.|\\\\.\\\\d{1,3}\\\\.|(?:\\\\.(?:%TLDS%)(?:' + re.src_ZPCc + '|>|$))';\n\n  re.tpl_email_fuzzy =\n\n      '(^|' + text_separators + '|\"|\\\\(|' + re.src_ZCc + ')' +\n      '(' + re.src_email_name + '@' + re.tpl_host_fuzzy_strict + ')';\n\n  re.tpl_link_fuzzy =\n      // Fuzzy link can't be prepended with .:/\\- and non punctuation.\n      // but can start with > (markdown blockquote)\n      '(^|(?![.:/\\\\-_@])(?:[$+<=>^`|\\uff5c]|' + re.src_ZPCc + '))' +\n      '((?![$+<=>^`|\\uff5c])' + re.tpl_host_port_fuzzy_strict + re.src_path + ')';\n\n  re.tpl_link_no_ip_fuzzy =\n      // Fuzzy link can't be prepended with .:/\\- and non punctuation.\n      // but can start with > (markdown blockquote)\n      '(^|(?![.:/\\\\-_@])(?:[$+<=>^`|\\uff5c]|' + re.src_ZPCc + '))' +\n      '((?![$+<=>^`|\\uff5c])' + re.tpl_host_port_no_ip_fuzzy_strict + re.src_path + ')';\n\n  return re;\n};\n","/*! https://mths.be/punycode v1.4.1 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow new RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t    counter = 0,\n\t\t    length = string.length,\n\t\t    value,\n\t\t    extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t//  0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * https://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t    inputLength = input.length,\n\t\t    out,\n\t\t    i = 0,\n\t\t    n = initialN,\n\t\t    bias = initialBias,\n\t\t    basic,\n\t\t    j,\n\t\t    index,\n\t\t    oldi,\n\t\t    w,\n\t\t    k,\n\t\t    digit,\n\t\t    t,\n\t\t    /** Cached calculation results */\n\t\t    baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t    delta,\n\t\t    handledCPCount,\n\t\t    basicLength,\n\t\t    bias,\n\t\t    j,\n\t\t    m,\n\t\t    q,\n\t\t    k,\n\t\t    t,\n\t\t    currentValue,\n\t\t    output = [],\n\t\t    /** `inputLength` will hold the number of code points in `input`. */\n\t\t    inputLength,\n\t\t    /** Cached calculation results */\n\t\t    handledCPCountPlusOne,\n\t\t    baseMinusT,\n\t\t    qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.4.1',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) {\n\t\t\t// in Node.js, io.js, or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else {\n\t\t\t// in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\n","// markdown-it default options\n\n'use strict';\n\n\nmodule.exports = {\n  options: {\n    html:         false,        // Enable HTML tags in source\n    xhtmlOut:     false,        // Use '/' to close single tags (<br />)\n    breaks:       false,        // Convert '\\n' in paragraphs into <br>\n    langPrefix:   'language-',  // CSS language prefix for fenced blocks\n    linkify:      false,        // autoconvert URL-like texts to links\n\n    // Enable some language-neutral replacements + quotes beautification\n    typographer:  false,\n\n    // Double + single quotes replacement pairs, when typographer enabled,\n    // and smartquotes on. Could be either a String or an Array.\n    //\n    // For example, you can use '«»„“' for Russian, '„“‚‘' for German,\n    // and ['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›'] for French (including nbsp).\n    quotes: '\\u201c\\u201d\\u2018\\u2019', /* “”‘’ */\n\n    // Highlighter function. Should return escaped HTML,\n    // or '' if the source string is not changed and should be escaped externaly.\n    // If result starts with <pre... internal wrapper is skipped.\n    //\n    // function (/*str, lang*/) { return ''; }\n    //\n    highlight: null,\n\n    maxNesting:   100            // Internal protection, recursion limit\n  },\n\n  components: {\n\n    core: {},\n    block: {},\n    inline: {}\n  }\n};\n","// \"Zero\" preset, with nothing enabled. Useful for manual configuring of simple\n// modes. For example, to parse bold/italic only.\n\n'use strict';\n\n\nmodule.exports = {\n  options: {\n    html:         false,        // Enable HTML tags in source\n    xhtmlOut:     false,        // Use '/' to close single tags (<br />)\n    breaks:       false,        // Convert '\\n' in paragraphs into <br>\n    langPrefix:   'language-',  // CSS language prefix for fenced blocks\n    linkify:      false,        // autoconvert URL-like texts to links\n\n    // Enable some language-neutral replacements + quotes beautification\n    typographer:  false,\n\n    // Double + single quotes replacement pairs, when typographer enabled,\n    // and smartquotes on. Could be either a String or an Array.\n    //\n    // For example, you can use '«»„“' for Russian, '„“‚‘' for German,\n    // and ['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›'] for French (including nbsp).\n    quotes: '\\u201c\\u201d\\u2018\\u2019', /* “”‘’ */\n\n    // Highlighter function. Should return escaped HTML,\n    // or '' if the source string is not changed and should be escaped externaly.\n    // If result starts with <pre... internal wrapper is skipped.\n    //\n    // function (/*str, lang*/) { return ''; }\n    //\n    highlight: null,\n\n    maxNesting:   20            // Internal protection, recursion limit\n  },\n\n  components: {\n\n    core: {\n      rules: [\n        'normalize',\n        'block',\n        'inline'\n      ]\n    },\n\n    block: {\n      rules: [\n        'paragraph'\n      ]\n    },\n\n    inline: {\n      rules: [\n        'text'\n      ],\n      rules2: [\n        'balance_pairs',\n        'text_collapse'\n      ]\n    }\n  }\n};\n","// Commonmark default options\n\n'use strict';\n\n\nmodule.exports = {\n  options: {\n    html:         true,         // Enable HTML tags in source\n    xhtmlOut:     true,         // Use '/' to close single tags (<br />)\n    breaks:       false,        // Convert '\\n' in paragraphs into <br>\n    langPrefix:   'language-',  // CSS language prefix for fenced blocks\n    linkify:      false,        // autoconvert URL-like texts to links\n\n    // Enable some language-neutral replacements + quotes beautification\n    typographer:  false,\n\n    // Double + single quotes replacement pairs, when typographer enabled,\n    // and smartquotes on. Could be either a String or an Array.\n    //\n    // For example, you can use '«»„“' for Russian, '„“‚‘' for German,\n    // and ['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›'] for French (including nbsp).\n    quotes: '\\u201c\\u201d\\u2018\\u2019', /* “”‘’ */\n\n    // Highlighter function. Should return escaped HTML,\n    // or '' if the source string is not changed and should be escaped externaly.\n    // If result starts with <pre... internal wrapper is skipped.\n    //\n    // function (/*str, lang*/) { return ''; }\n    //\n    highlight: null,\n\n    maxNesting:   20            // Internal protection, recursion limit\n  },\n\n  components: {\n\n    core: {\n      rules: [\n        'normalize',\n        'block',\n        'inline'\n      ]\n    },\n\n    block: {\n      rules: [\n        'blockquote',\n        'code',\n        'fence',\n        'heading',\n        'hr',\n        'html_block',\n        'lheading',\n        'list',\n        'reference',\n        'paragraph'\n      ]\n    },\n\n    inline: {\n      rules: [\n        'autolink',\n        'backticks',\n        'emphasis',\n        'entity',\n        'escape',\n        'html_inline',\n        'image',\n        'link',\n        'newline',\n        'text'\n      ],\n      rules2: [\n        'balance_pairs',\n        'emphasis',\n        'text_collapse'\n      ]\n    }\n  }\n};\n","// Markdown-it plugin to render GitHub-style task lists; see\n//\n// https://github.com/blog/1375-task-lists-in-gfm-issues-pulls-comments\n// https://github.com/blog/1825-task-lists-in-all-markdown-documents\n\nvar disableCheckboxes = true;\nvar useLabelWrapper = false;\nvar useLabelAfter = false;\n\nmodule.exports = function(md, options) {\n\tif (options) {\n\t\tdisableCheckboxes = !options.enabled;\n\t\tuseLabelWrapper = !!options.label;\n\t\tuseLabelAfter = !!options.labelAfter;\n\t}\n\n\tmd.core.ruler.after('inline', 'github-task-lists', function(state) {\n\t\tvar tokens = state.tokens;\n\t\tfor (var i = 2; i < tokens.length; i++) {\n\t\t\tif (isTodoItem(tokens, i)) {\n\t\t\t\ttodoify(tokens[i], state.Token);\n\t\t\t\tattrSet(tokens[i-2], 'class', 'task-list-item' + (!disableCheckboxes ? ' enabled' : ''));\n\t\t\t\tattrSet(tokens[parentToken(tokens, i-2)], 'class', 'contains-task-list');\n\t\t\t}\n\t\t}\n\t});\n};\n\nfunction attrSet(token, name, value) {\n\tvar index = token.attrIndex(name);\n\tvar attr = [name, value];\n\n\tif (index < 0) {\n\t\ttoken.attrPush(attr);\n\t} else {\n\t\ttoken.attrs[index] = attr;\n\t}\n}\n\nfunction parentToken(tokens, index) {\n\tvar targetLevel = tokens[index].level - 1;\n\tfor (var i = index - 1; i >= 0; i--) {\n\t\tif (tokens[i].level === targetLevel) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\nfunction isTodoItem(tokens, index) {\n\treturn isInline(tokens[index]) &&\n\t       isParagraph(tokens[index - 1]) &&\n\t       isListItem(tokens[index - 2]) &&\n\t       startsWithTodoMarkdown(tokens[index]);\n}\n\nfunction todoify(token, TokenConstructor) {\n\ttoken.children.unshift(makeCheckbox(token, TokenConstructor));\n\ttoken.children[1].content = token.children[1].content.slice(3);\n\ttoken.content = token.content.slice(3);\n\n\tif (useLabelWrapper) {\n\t\tif (useLabelAfter) {\n\t\t\ttoken.children.pop();\n\n\t\t\t// Use large random number as id property of the checkbox.\n\t\t\tvar id = 'task-item-' + Math.ceil(Math.random() * (10000 * 1000) - 1000);\n\t\t\ttoken.children[0].content = token.children[0].content.slice(0, -1) + ' id=\"' + id + '\">';\n\t\t\ttoken.children.push(afterLabel(token.content, id, TokenConstructor));\n\t\t} else {\n\t\t\ttoken.children.unshift(beginLabel(TokenConstructor));\n\t\t\ttoken.children.push(endLabel(TokenConstructor));\n\t\t}\n\t}\n}\n\nfunction makeCheckbox(token, TokenConstructor) {\n\tvar checkbox = new TokenConstructor('html_inline', '', 0);\n\tvar disabledAttr = disableCheckboxes ? ' disabled=\"\" ' : '';\n\tif (token.content.indexOf('[ ] ') === 0) {\n\t\tcheckbox.content = '<input class=\"task-list-item-checkbox\"' + disabledAttr + 'type=\"checkbox\">';\n\t} else if (token.content.indexOf('[x] ') === 0 || token.content.indexOf('[X] ') === 0) {\n\t\tcheckbox.content = '<input class=\"task-list-item-checkbox\" checked=\"\"' + disabledAttr + 'type=\"checkbox\">';\n\t}\n\treturn checkbox;\n}\n\n// these next two functions are kind of hacky; probably should really be a\n// true block-level token with .tag=='label'\nfunction beginLabel(TokenConstructor) {\n\tvar token = new TokenConstructor('html_inline', '', 0);\n\ttoken.content = '<label>';\n\treturn token;\n}\n\nfunction endLabel(TokenConstructor) {\n\tvar token = new TokenConstructor('html_inline', '', 0);\n\ttoken.content = '</label>';\n\treturn token;\n}\n\nfunction afterLabel(content, id, TokenConstructor) {\n\tvar token = new TokenConstructor('html_inline', '', 0);\n\ttoken.content = '<label class=\"task-list-item-label\" for=\"' + id + '\">' + content + '</label>';\n\ttoken.attrs = [{for: id}];\n\treturn token;\n}\n\nfunction isInline(token) { return token.type === 'inline'; }\nfunction isParagraph(token) { return token.type === 'paragraph_open'; }\nfunction isListItem(token) { return token.type === 'list_item_open'; }\n\nfunction startsWithTodoMarkdown(token) {\n\t// leading whitespace in a list item is already trimmed off by markdown-it\n\treturn token.content.indexOf('[ ] ') === 0 || token.content.indexOf('[x] ') === 0 || token.content.indexOf('[X] ') === 0;\n}\n","/*\n * Copyright 2018 Google Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n * use this file except in compliance with the License. You may obtain a copy of\n * the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n * License for the specific language governing permissions and limitations under\n * the License.\n */\n\n'use strict';\n\n(function(scope) {\n  if (scope['Proxy']) {\n    return;\n  }\n  scope.Proxy = require('./proxy.js')();\n  scope.Proxy['revocable'] = scope.Proxy.revocable;\n})(\n  ('undefined' !== typeof process &&\n    '[object process]' === {}.toString.call(process)) ||\n  ('undefined' !== typeof navigator && navigator.product === 'ReactNative')\n    ? global\n    : self\n);\n\n","/*\n * Copyright 2016 Google Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n * use this file except in compliance with the License. You may obtain a copy of\n * the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n * License for the specific language governing permissions and limitations under\n * the License.\n */\n\nmodule.exports = function proxyPolyfill() {\n  let lastRevokeFn = null;\n  let ProxyPolyfill;\n\n  /**\n   * @param {*} o\n   * @return {boolean} whether this is probably a (non-null) Object\n   */\n  function isObject(o) {\n    return o ? (typeof o === 'object' || typeof o === 'function') : false;\n  }\n\n  function validateProto(proto) {\n    if (proto !== null && !isObject(proto)) {\n      throw new TypeError('Object prototype may only be an Object or null: ' + proto);\n    }\n  }\n\n  const $Object = Object;\n\n  // Closure assumes that `{__proto__: null} instanceof Object` is always true, hence why we check against a different name.\n  const canCreateNullProtoObjects = Boolean($Object.create) || !({ __proto__: null } instanceof $Object);\n  const objectCreate =\n    $Object.create ||\n    (canCreateNullProtoObjects\n      ? function create(proto) {\n          validateProto(proto);\n          return { __proto__: proto };\n        }\n      : function create(proto) {\n          validateProto(proto);\n          if (proto === null) {\n            throw new SyntaxError('Native Object.create is required to create objects with null prototype');\n          }\n\n          // nb. cast to convince Closure compiler that this is a constructor\n          var T = /** @type {!Function} */ (function T() {});\n          T.prototype = proto;\n          return new T();\n        });\n\n  const noop = function() { return null; };\n\n  const getProto =\n    $Object.getPrototypeOf ||\n    ([].__proto__ === Array.prototype\n      ? function getPrototypeOf(O) {\n          // If O.[[Prototype]] === null, then the __proto__ accessor won't exist,\n          // as it's inherited from `Object.prototype`\n          const proto = O.__proto__;\n          return isObject(proto) ? proto : null;\n        }\n      : noop);\n\n  /**\n   * @constructor\n   * @param {!Object} target\n   * @param {{apply, construct, get, set}} handler\n   */\n  ProxyPolyfill = function(target, handler) {\n    const newTarget = this && this instanceof ProxyPolyfill ? this.constructor : undefined;\n    if (newTarget === undefined) {\n      throw new TypeError(\"Constructor Proxy requires 'new'\");\n    }\n\n    if (!isObject(target) || !isObject(handler)) {\n      throw new TypeError('Cannot create proxy with a non-object as target or handler');\n    }\n\n    // Construct revoke function, and set lastRevokeFn so that Proxy.revocable can steal it.\n    // The caller might get the wrong revoke function if a user replaces or wraps scope.Proxy\n    // to call itself, but that seems unlikely especially when using the polyfill.\n    let throwRevoked = function() {};\n    lastRevokeFn = function() {\n      /** @suppress {checkTypes} */\n      target = null;  // clear ref\n      throwRevoked = function(trap) {\n        throw new TypeError(`Cannot perform '${trap}' on a proxy that has been revoked`);\n      };\n    };\n    setTimeout(function() {\n      lastRevokeFn = null;\n    }, 0);\n\n    // Fail on unsupported traps: Chrome doesn't do this, but ensure that users of the polyfill\n    // are a bit more careful. Copy the internal parts of handler to prevent user changes.\n    const unsafeHandler = handler;\n    handler = { 'get': null, 'set': null, 'apply': null, 'construct': null };\n    for (let k in unsafeHandler) {\n      if (!(k in handler)) {\n        throw new TypeError(`Proxy polyfill does not support trap '${k}'`);\n      }\n      handler[k] = unsafeHandler[k];\n    }\n    if (typeof unsafeHandler === 'function') {\n      // Allow handler to be a function (which has an 'apply' method). This matches what is\n      // probably a bug in native versions. It treats the apply call as a trap to be configured.\n      handler.apply = unsafeHandler.apply.bind(unsafeHandler);\n    }\n\n    // Define proxy as an object that extends target.[[Prototype]],\n    // or a Function (if either it's callable, or apply is set).\n    const proto = getProto(target);  // can return null in old browsers\n    let proxy;\n    let isMethod = false;\n    let isArray = false;\n    if (typeof target === 'function') {\n      proxy = function ProxyPolyfill() {\n        const usingNew = (this && this.constructor === proxy);\n        const args = Array.prototype.slice.call(arguments);\n        throwRevoked(usingNew ? 'construct' : 'apply');\n\n        // TODO(samthor): Closure compiler doesn't know about 'construct', attempts to rename it.\n        if (usingNew && handler['construct']) {\n          return handler['construct'].call(this, target, args);\n        } else if (!usingNew && handler.apply) {\n          return handler['apply'](target, this, args);\n        }\n\n        // since the target was a function, fallback to calling it directly.\n        if (usingNew) {\n          // inspired by answers to https://stackoverflow.com/q/1606797\n          args.unshift(target);  // pass class as first arg to constructor, although irrelevant\n          // nb. cast to convince Closure compiler that this is a constructor\n          const f = /** @type {!Function} */ (target.bind.apply(target, args));\n          return new f();\n        }\n        return target.apply(this, args);\n      };\n      isMethod = true;\n    } else if (target instanceof Array) {\n      proxy = [];\n      isArray = true;\n    } else {\n      proxy = (canCreateNullProtoObjects || proto !== null) ? objectCreate(proto) : {};\n    }\n\n    // Create default getters/setters. Create different code paths as handler.get/handler.set can't\n    // change after creation.\n    const getter = handler.get ? function(prop) {\n      throwRevoked('get');\n      return handler.get(this, prop, proxy);\n    } : function(prop) {\n      throwRevoked('get');\n      return this[prop];\n    };\n    const setter = handler.set ? function(prop, value) {\n      throwRevoked('set');\n      const status = handler.set(this, prop, value, proxy);\n      // TODO(samthor): If the calling code is in strict mode, throw TypeError.\n      // if (!status) {\n        // It's (sometimes) possible to work this out, if this code isn't strict- try to load the\n        // callee, and if it's available, that code is non-strict. However, this isn't exhaustive.\n      // }\n    } : function(prop, value) {\n      throwRevoked('set');\n      this[prop] = value;\n    };\n\n    // Clone direct properties (i.e., not part of a prototype).\n    const propertyNames = $Object.getOwnPropertyNames(target);\n    const propertyMap = {};\n    propertyNames.forEach(function(prop) {\n      if ((isMethod || isArray) && prop in proxy) {\n        return;  // ignore properties already here, e.g. 'bind', 'prototype' etc\n      }\n      const real = $Object.getOwnPropertyDescriptor(target, prop);\n      const desc = {\n        enumerable: Boolean(real.enumerable),\n        get: getter.bind(target, prop),\n        set: setter.bind(target, prop),\n      };\n      $Object.defineProperty(proxy, prop, desc);\n      propertyMap[prop] = true;\n    });\n\n    // Set the prototype, or clone all prototype methods (always required if a getter is provided).\n    // TODO(samthor): We don't allow prototype methods to be set. It's (even more) awkward.\n    // An alternative here would be to _just_ clone methods to keep behavior consistent.\n    let prototypeOk = true;\n    if (isMethod || isArray) {\n      // Arrays and methods are special: above, we instantiate boring versions of these then swap\n      // our their prototype later. So we only need to use setPrototypeOf in these cases. Some old\n      // engines support `Object.getPrototypeOf` but not `Object.setPrototypeOf`.\n      const setProto =\n        $Object.setPrototypeOf ||\n        ([].__proto__ === Array.prototype\n          ? function setPrototypeOf(O, proto) {\n              validateProto(proto);\n              O.__proto__ = proto;\n              return O;\n            }\n          : noop);\n      if (!(proto && setProto(proxy, proto))) {\n        prototypeOk = false;\n      }\n    }\n    if (handler.get || !prototypeOk) {\n      for (let k in target) {\n        if (propertyMap[k]) {\n          continue;\n        }\n        $Object.defineProperty(proxy, k, { get: getter.bind(target, k) });\n      }\n    }\n\n    // The Proxy polyfill cannot handle adding new properties. Seal the target and proxy.\n    $Object.seal(target);\n    $Object.seal(proxy);\n\n    return proxy;  // nb. if isMethod is true, proxy != this\n  };\n\n  ProxyPolyfill.revocable = function(target, handler) {\n    const p = new ProxyPolyfill(target, handler);\n    return { 'proxy': p, 'revoke': lastRevokeFn };\n  };\n\n  return ProxyPolyfill;\n}\n","import markdownit from \"markdown-it\"\nimport {schema} from \"./schema\"\nimport {Mark} from \"prosemirror-model\"\n\nfunction maybeMerge(a, b) {\n  if (a.isText && b.isText && Mark.sameSet(a.marks, b.marks))\n    return a.withText(a.text + b.text)\n}\n\n// Object used to track the context of a running parse.\nclass MarkdownParseState {\n  constructor(schema, tokenHandlers) {\n    this.schema = schema\n    this.stack = [{type: schema.topNodeType, content: []}]\n    this.marks = Mark.none\n    this.tokenHandlers = tokenHandlers\n  }\n\n  top() {\n    return this.stack[this.stack.length - 1]\n  }\n\n  push(elt) {\n    if (this.stack.length) this.top().content.push(elt)\n  }\n\n  // : (string)\n  // Adds the given text to the current position in the document,\n  // using the current marks as styling.\n  addText(text) {\n    if (!text) return\n    let nodes = this.top().content, last = nodes[nodes.length - 1]\n    let node = this.schema.text(text, this.marks), merged\n    if (last && (merged = maybeMerge(last, node))) nodes[nodes.length - 1] = merged\n    else nodes.push(node)\n  }\n\n  // : (Mark)\n  // Adds the given mark to the set of active marks.\n  openMark(mark) {\n    this.marks = mark.addToSet(this.marks)\n  }\n\n  // : (Mark)\n  // Removes the given mark from the set of active marks.\n  closeMark(mark) {\n    this.marks = mark.removeFromSet(this.marks)\n  }\n\n  parseTokens(toks) {\n    for (let i = 0; i < toks.length; i++) {\n      let tok = toks[i]\n      let handler = this.tokenHandlers[tok.type]\n      if (!handler)\n        throw new Error(\"Token type `\" + tok.type + \"` not supported by Markdown parser\")\n      handler(this, tok)\n    }\n  }\n\n  // : (NodeType, ?Object, ?[Node]) → ?Node\n  // Add a node at the current position.\n  addNode(type, attrs, content) {\n    let node = type.createAndFill(attrs, content, this.marks)\n    if (!node) return null\n    this.push(node)\n    return node\n  }\n\n  // : (NodeType, ?Object)\n  // Wrap subsequent content in a node of the given type.\n  openNode(type, attrs) {\n    this.stack.push({type: type, attrs: attrs, content: []})\n  }\n\n  // : () → ?Node\n  // Close and return the node that is currently on top of the stack.\n  closeNode() {\n    if (this.marks.length) this.marks = Mark.none\n    let info = this.stack.pop()\n    return this.addNode(info.type, info.attrs, info.content)\n  }\n}\n\nfunction attrs(spec, token) {\n  if (spec.getAttrs) return spec.getAttrs(token)\n  // For backwards compatibility when `attrs` is a Function\n  else if (spec.attrs instanceof Function) return spec.attrs(token)\n  else return spec.attrs\n}\n\n// Code content is represented as a single token with a `content`\n// property in Markdown-it.\nfunction noCloseToken(spec, type) {\n  return spec.noCloseToken || type == \"code_inline\" || type == \"code_block\" || type == \"fence\"\n}\n\nfunction withoutTrailingNewline(str) {\n  return str[str.length - 1] == \"\\n\" ? str.slice(0, str.length - 1) : str\n}\n\nfunction noOp() {}\n\nfunction tokenHandlers(schema, tokens) {\n  let handlers = Object.create(null)\n  for (let type in tokens) {\n    let spec = tokens[type]\n    if (spec.block) {\n      let nodeType = schema.nodeType(spec.block)\n      if (noCloseToken(spec, type)) {\n        handlers[type] = (state, tok) => {\n          state.openNode(nodeType, attrs(spec, tok))\n          state.addText(withoutTrailingNewline(tok.content))\n          state.closeNode()\n        }\n      } else {\n        handlers[type + \"_open\"] = (state, tok) => state.openNode(nodeType, attrs(spec, tok))\n        handlers[type + \"_close\"] = state => state.closeNode()\n      }\n    } else if (spec.node) {\n      let nodeType = schema.nodeType(spec.node)\n      handlers[type] = (state, tok) => state.addNode(nodeType, attrs(spec, tok))\n    } else if (spec.mark) {\n      let markType = schema.marks[spec.mark]\n      if (noCloseToken(spec, type)) {\n        handlers[type] = (state, tok) => {\n          state.openMark(markType.create(attrs(spec, tok)))\n          state.addText(withoutTrailingNewline(tok.content))\n          state.closeMark(markType)\n        }\n      } else {\n        handlers[type + \"_open\"] = (state, tok) => state.openMark(markType.create(attrs(spec, tok)))\n        handlers[type + \"_close\"] = state => state.closeMark(markType)\n      }\n    } else if (spec.ignore) {\n      if (noCloseToken(spec, type)) {\n        handlers[type] = noOp\n      } else {\n        handlers[type + '_open'] = noOp\n        handlers[type + '_close'] = noOp\n      }\n    } else {\n      throw new RangeError(\"Unrecognized parsing spec \" + JSON.stringify(spec))\n    }\n  }\n\n  handlers.text = (state, tok) => state.addText(tok.content)\n  handlers.inline = (state, tok) => state.parseTokens(tok.children)\n  handlers.softbreak = handlers.softbreak || (state => state.addText(\"\\n\"))\n\n  return handlers\n}\n\n// ::- A configuration of a Markdown parser. Such a parser uses\n// [markdown-it](https://github.com/markdown-it/markdown-it) to\n// tokenize a file, and then runs the custom rules it is given over\n// the tokens to create a ProseMirror document tree.\nexport class MarkdownParser {\n  // :: (Schema, MarkdownIt, Object)\n  // Create a parser with the given configuration. You can configure\n  // the markdown-it parser to parse the dialect you want, and provide\n  // a description of the ProseMirror entities those tokens map to in\n  // the `tokens` object, which maps token names to descriptions of\n  // what to do with them. Such a description is an object, and may\n  // have the following properties:\n  //\n  // **`node`**`: ?string`\n  //   : This token maps to a single node, whose type can be looked up\n  //     in the schema under the given name. Exactly one of `node`,\n  //     `block`, or `mark` must be set.\n  //\n  // **`block`**`: ?string`\n  //   : This token (unless `noCloseToken` is true) comes in `_open`\n  //     and `_close` variants (which are appended to the base token\n  //     name provides a the object property), and wraps a block of\n  //     content. The block should be wrapped in a node of the type\n  //     named to by the property's value. If the token does not have\n  //     `_open` or `_close`, use the `noCloseToken` option.\n  //\n  // **`mark`**`: ?string`\n  //   : This token (again, unless `noCloseToken` is true) also comes\n  //     in `_open` and `_close` variants, but should add a mark\n  //     (named by the value) to its content, rather than wrapping it\n  //     in a node.\n  //\n  // **`attrs`**`: ?Object`\n  //   : Attributes for the node or mark. When `getAttrs` is provided,\n  //     it takes precedence.\n  //\n  // **`getAttrs`**`: ?(MarkdownToken) → Object`\n  //   : A function used to compute the attributes for the node or mark\n  //     that takes a [markdown-it\n  //     token](https://markdown-it.github.io/markdown-it/#Token) and\n  //     returns an attribute object.\n  //\n  // **`noCloseToken`**`: ?boolean`\n  //   : Indicates that the [markdown-it\n  //     token](https://markdown-it.github.io/markdown-it/#Token) has\n  //     no `_open` or `_close` for the nodes. This defaults to `true`\n  //     for `code_inline`, `code_block` and `fence`.\n  //\n  // **`ignore`**`: ?bool`\n  //   : When true, ignore content for the matched token.\n  constructor(schema, tokenizer, tokens) {\n    // :: Object The value of the `tokens` object used to construct\n    // this parser. Can be useful to copy and modify to base other\n    // parsers on.\n    this.tokens = tokens\n    this.schema = schema\n    this.tokenizer = tokenizer\n    this.tokenHandlers = tokenHandlers(schema, tokens)\n  }\n\n  // :: (string) → Node\n  // Parse a string as [CommonMark](http://commonmark.org/) markup,\n  // and create a ProseMirror document as prescribed by this parser's\n  // rules.\n  parse(text) {\n    let state = new MarkdownParseState(this.schema, this.tokenHandlers), doc\n    state.parseTokens(this.tokenizer.parse(text, {}))\n    do { doc = state.closeNode() } while (state.stack.length)\n    return doc\n  }\n}\n\n// :: MarkdownParser\n// A parser parsing unextended [CommonMark](http://commonmark.org/),\n// without inline HTML, and producing a document in the basic schema.\nexport const defaultMarkdownParser = new MarkdownParser(schema, markdownit(\"commonmark\", {html: false}), {\n  blockquote: {block: \"blockquote\"},\n  paragraph: {block: \"paragraph\"},\n  list_item: {block: \"list_item\"},\n  bullet_list: {block: \"bullet_list\"},\n  ordered_list: {block: \"ordered_list\", getAttrs: tok => ({order: +tok.attrGet(\"start\") || 1})},\n  heading: {block: \"heading\", getAttrs: tok => ({level: +tok.tag.slice(1)})},\n  code_block: {block: \"code_block\", noCloseToken: true},\n  fence: {block: \"code_block\", getAttrs: tok => ({params: tok.info || \"\"}), noCloseToken: true},\n  hr: {node: \"horizontal_rule\"},\n  image: {node: \"image\", getAttrs: tok => ({\n    src: tok.attrGet(\"src\"),\n    title: tok.attrGet(\"title\") || null,\n    alt: tok.children[0] && tok.children[0].content || null\n  })},\n  hardbreak: {node: \"hard_break\"},\n\n  em: {mark: \"em\"},\n  strong: {mark: \"strong\"},\n  link: {mark: \"link\", getAttrs: tok => ({\n    href: tok.attrGet(\"href\"),\n    title: tok.attrGet(\"title\") || null\n  })},\n  code_inline: {mark: \"code\", noCloseToken: true}\n})\n","// ::- A specification for serializing a ProseMirror document as\n// Markdown/CommonMark text.\nexport class MarkdownSerializer {\n  // :: (Object<(state: MarkdownSerializerState, node: Node, parent: Node, index: number)>, Object)\n  // Construct a serializer with the given configuration. The `nodes`\n  // object should map node names in a given schema to function that\n  // take a serializer state and such a node, and serialize the node.\n  //\n  // The `marks` object should hold objects with `open` and `close`\n  // properties, which hold the strings that should appear before and\n  // after a piece of text marked that way, either directly or as a\n  // function that takes a serializer state and a mark, and returns a\n  // string. `open` and `close` can also be functions, which will be\n  // called as\n  //\n  //     (state: MarkdownSerializerState, mark: Mark,\n  //      parent: Fragment, index: number) → string\n  //\n  // Where `parent` and `index` allow you to inspect the mark's\n  // context to see which nodes it applies to.\n  //\n  // Mark information objects can also have a `mixable` property\n  // which, when `true`, indicates that the order in which the mark's\n  // opening and closing syntax appears relative to other mixable\n  // marks can be varied. (For example, you can say `**a *b***` and\n  // `*a **b***`, but not `` `a *b*` ``.)\n  //\n  // To disable character escaping in a mark, you can give it an\n  // `escape` property of `false`. Such a mark has to have the highest\n  // precedence (must always be the innermost mark).\n  //\n  // The `expelEnclosingWhitespace` mark property causes the\n  // serializer to move enclosing whitespace from inside the marks to\n  // outside the marks. This is necessary for emphasis marks as\n  // CommonMark does not permit enclosing whitespace inside emphasis\n  // marks, see: http://spec.commonmark.org/0.26/#example-330\n  constructor(nodes, marks) {\n    // :: Object<(MarkdownSerializerState, Node)> The node serializer\n    // functions for this serializer.\n    this.nodes = nodes\n    // :: Object The mark serializer info.\n    this.marks = marks\n  }\n\n  // :: (Node, ?Object) → string\n  // Serialize the content of the given node to\n  // [CommonMark](http://commonmark.org/).\n  serialize(content, options) {\n    let state = new MarkdownSerializerState(this.nodes, this.marks, options)\n    state.renderContent(content)\n    return state.out\n  }\n}\n\n// :: MarkdownSerializer\n// A serializer for the [basic schema](#schema).\nexport const defaultMarkdownSerializer = new MarkdownSerializer({\n  blockquote(state, node) {\n    state.wrapBlock(\"> \", null, node, () => state.renderContent(node))\n  },\n  code_block(state, node) {\n    state.write(\"```\" + (node.attrs.params || \"\") + \"\\n\")\n    state.text(node.textContent, false)\n    state.ensureNewLine()\n    state.write(\"```\")\n    state.closeBlock(node)\n  },\n  heading(state, node) {\n    state.write(state.repeat(\"#\", node.attrs.level) + \" \")\n    state.renderInline(node)\n    state.closeBlock(node)\n  },\n  horizontal_rule(state, node) {\n    state.write(node.attrs.markup || \"---\")\n    state.closeBlock(node)\n  },\n  bullet_list(state, node) {\n    state.renderList(node, \"  \", () => (node.attrs.bullet || \"*\") + \" \")\n  },\n  ordered_list(state, node) {\n    let start = node.attrs.order || 1\n    let maxW = String(start + node.childCount - 1).length\n    let space = state.repeat(\" \", maxW + 2)\n    state.renderList(node, space, i => {\n      let nStr = String(start + i)\n      return state.repeat(\" \", maxW - nStr.length) + nStr + \". \"\n    })\n  },\n  list_item(state, node) {\n    state.renderContent(node)\n  },\n  paragraph(state, node) {\n    state.renderInline(node)\n    state.closeBlock(node)\n  },\n\n  image(state, node) {\n    state.write(\"![\" + state.esc(node.attrs.alt || \"\") + \"](\" + state.esc(node.attrs.src) +\n                (node.attrs.title ? \" \" + state.quote(node.attrs.title) : \"\") + \")\")\n  },\n  hard_break(state, node, parent, index) {\n    for (let i = index + 1; i < parent.childCount; i++)\n      if (parent.child(i).type != node.type) {\n        state.write(\"\\\\\\n\")\n        return\n      }\n  },\n  text(state, node) {\n    state.text(node.text)\n  }\n}, {\n  em: {open: \"*\", close: \"*\", mixable: true, expelEnclosingWhitespace: true},\n  strong: {open: \"**\", close: \"**\", mixable: true, expelEnclosingWhitespace: true},\n  link: {\n    open(_state, mark, parent, index) {\n      return isPlainURL(mark, parent, index, 1) ? \"<\" : \"[\"\n    },\n    close(state, mark, parent, index) {\n      return isPlainURL(mark, parent, index, -1) ? \">\"\n        : \"](\" + state.esc(mark.attrs.href) + (mark.attrs.title ? \" \" + state.quote(mark.attrs.title) : \"\") + \")\"\n    }\n  },\n  code: {open(_state, _mark, parent, index) { return backticksFor(parent.child(index), -1) },\n         close(_state, _mark, parent, index) { return backticksFor(parent.child(index - 1), 1) },\n         escape: false}\n})\n\nfunction backticksFor(node, side) {\n  let ticks = /`+/g, m, len = 0\n  if (node.isText) while (m = ticks.exec(node.text)) len = Math.max(len, m[0].length)\n  let result = len > 0 && side > 0 ? \" `\" : \"`\"\n  for (let i = 0; i < len; i++) result += \"`\"\n  if (len > 0 && side < 0) result += \" \"\n  return result\n}\n\nfunction isPlainURL(link, parent, index, side) {\n  if (link.attrs.title || !/^\\w+:/.test(link.attrs.href)) return false\n  let content = parent.child(index + (side < 0 ? -1 : 0))\n  if (!content.isText || content.text != link.attrs.href || content.marks[content.marks.length - 1] != link) return false\n  if (index == (side < 0 ? 1 : parent.childCount - 1)) return true\n  let next = parent.child(index + (side < 0 ? -2 : 1))\n  return !link.isInSet(next.marks)\n}\n\n// ::- This is an object used to track state and expose\n// methods related to markdown serialization. Instances are passed to\n// node and mark serialization methods (see `toMarkdown`).\nexport class MarkdownSerializerState {\n  constructor(nodes, marks, options) {\n    this.nodes = nodes\n    this.marks = marks\n    this.delim = this.out = \"\"\n    this.closed = false\n    this.inTightList = false\n    // :: Object\n    // The options passed to the serializer.\n    //   tightLists:: ?bool\n    //   Whether to render lists in a tight style. This can be overridden\n    //   on a node level by specifying a tight attribute on the node.\n    //   Defaults to false.\n    this.options = options || {}\n    if (typeof this.options.tightLists == \"undefined\")\n      this.options.tightLists = false\n  }\n\n  flushClose(size) {\n    if (this.closed) {\n      if (!this.atBlank()) this.out += \"\\n\"\n      if (size == null) size = 2\n      if (size > 1) {\n        let delimMin = this.delim\n        let trim = /\\s+$/.exec(delimMin)\n        if (trim) delimMin = delimMin.slice(0, delimMin.length - trim[0].length)\n        for (let i = 1; i < size; i++)\n          this.out += delimMin + \"\\n\"\n      }\n      this.closed = false\n    }\n  }\n\n  // :: (string, ?string, Node, ())\n  // Render a block, prefixing each line with `delim`, and the first\n  // line in `firstDelim`. `node` should be the node that is closed at\n  // the end of the block, and `f` is a function that renders the\n  // content of the block.\n  wrapBlock(delim, firstDelim, node, f) {\n    let old = this.delim\n    this.write(firstDelim || delim)\n    this.delim += delim\n    f()\n    this.delim = old\n    this.closeBlock(node)\n  }\n\n  atBlank() {\n    return /(^|\\n)$/.test(this.out)\n  }\n\n  // :: ()\n  // Ensure the current content ends with a newline.\n  ensureNewLine() {\n    if (!this.atBlank()) this.out += \"\\n\"\n  }\n\n  // :: (?string)\n  // Prepare the state for writing output (closing closed paragraphs,\n  // adding delimiters, and so on), and then optionally add content\n  // (unescaped) to the output.\n  write(content) {\n    this.flushClose()\n    if (this.delim && this.atBlank())\n      this.out += this.delim\n    if (content) this.out += content\n  }\n\n  // :: (Node)\n  // Close the block for the given node.\n  closeBlock(node) {\n    this.closed = node\n  }\n\n  // :: (string, ?bool)\n  // Add the given text to the document. When escape is not `false`,\n  // it will be escaped.\n  text(text, escape) {\n    let lines = text.split(\"\\n\")\n    for (let i = 0; i < lines.length; i++) {\n      var startOfLine = this.atBlank() || this.closed\n      this.write()\n      this.out += escape !== false ? this.esc(lines[i], startOfLine) : lines[i]\n      if (i != lines.length - 1) this.out += \"\\n\"\n    }\n  }\n\n  // :: (Node)\n  // Render the given node as a block.\n  render(node, parent, index) {\n    if (typeof parent == \"number\") throw new Error(\"!\")\n    this.nodes[node.type.name](this, node, parent, index)\n  }\n\n  // :: (Node)\n  // Render the contents of `parent` as block nodes.\n  renderContent(parent) {\n    parent.forEach((node, _, i) => this.render(node, parent, i))\n  }\n\n  // :: (Node)\n  // Render the contents of `parent` as inline content.\n  renderInline(parent) {\n    let active = [], trailing = \"\"\n    let progress = (node, _, index) => {\n      let marks = node ? node.marks : []\n\n      // Remove marks from `hard_break` that are the last node inside\n      // that mark to prevent parser edge cases with new lines just\n      // before closing marks.\n      // (FIXME it'd be nice if we had a schema-agnostic way to\n      // identify nodes that serialize as hard breaks)\n      if (node && node.type.name === \"hard_break\")\n        marks = marks.filter(m => {\n          if (index + 1 == parent.childCount) return false\n          let next = parent.child(index + 1)\n          return m.isInSet(next.marks) && (!next.isText || /\\S/.test(next.text))\n        })\n\n      let leading = trailing\n      trailing = \"\"\n      // If whitespace has to be expelled from the node, adjust\n      // leading and trailing accordingly.\n      if (node && node.isText && marks.some(mark => {\n        let info = this.marks[mark.type.name]\n        return info && info.expelEnclosingWhitespace\n      })) {\n        let [_, lead, inner, trail] = /^(\\s*)(.*?)(\\s*)$/m.exec(node.text)\n        leading += lead\n        trailing = trail\n        if (lead || trail) {\n          node = inner ? node.withText(inner) : null\n          if (!node) marks = active\n        }\n      }\n\n      let inner = marks.length && marks[marks.length - 1], noEsc = inner && this.marks[inner.type.name].escape === false\n      let len = marks.length - (noEsc ? 1 : 0)\n\n      // Try to reorder 'mixable' marks, such as em and strong, which\n      // in Markdown may be opened and closed in different order, so\n      // that order of the marks for the token matches the order in\n      // active.\n      outer: for (let i = 0; i < len; i++) {\n        let mark = marks[i]\n        if (!this.marks[mark.type.name].mixable) break\n        for (let j = 0; j < active.length; j++) {\n          let other = active[j]\n          if (!this.marks[other.type.name].mixable) break\n          if (mark.eq(other)) {\n            if (i > j)\n              marks = marks.slice(0, j).concat(mark).concat(marks.slice(j, i)).concat(marks.slice(i + 1, len))\n            else if (j > i)\n              marks = marks.slice(0, i).concat(marks.slice(i + 1, j)).concat(mark).concat(marks.slice(j, len))\n            continue outer\n          }\n        }\n      }\n\n      // Find the prefix of the mark set that didn't change\n      let keep = 0\n      while (keep < Math.min(active.length, len) && marks[keep].eq(active[keep])) ++keep\n\n      // Close the marks that need to be closed\n      while (keep < active.length)\n        this.text(this.markString(active.pop(), false, parent, index), false)\n\n      // Output any previously expelled trailing whitespace outside the marks\n      if (leading) this.text(leading)\n\n      // Open the marks that need to be opened\n      if (node) {\n        while (active.length < len) {\n          let add = marks[active.length]\n          active.push(add)\n          this.text(this.markString(add, true, parent, index), false)\n        }\n\n        // Render the node. Special case code marks, since their content\n        // may not be escaped.\n        if (noEsc && node.isText)\n          this.text(this.markString(inner, true, parent, index) + node.text +\n                    this.markString(inner, false, parent, index + 1), false)\n        else\n          this.render(node, parent, index)\n      }\n    }\n    parent.forEach(progress)\n    progress(null, null, parent.childCount)\n  }\n\n  // :: (Node, string, (number) → string)\n  // Render a node's content as a list. `delim` should be the extra\n  // indentation added to all lines except the first in an item,\n  // `firstDelim` is a function going from an item index to a\n  // delimiter for the first line of the item.\n  renderList(node, delim, firstDelim) {\n    if (this.closed && this.closed.type == node.type)\n      this.flushClose(3)\n    else if (this.inTightList)\n      this.flushClose(1)\n\n    let isTight = typeof node.attrs.tight != \"undefined\" ? node.attrs.tight : this.options.tightLists\n    let prevTight = this.inTightList\n    this.inTightList = isTight\n    node.forEach((child, _, i) => {\n      if (i && isTight) this.flushClose(1)\n      this.wrapBlock(delim, firstDelim(i), node, () => this.render(child, node, i))\n    })\n    this.inTightList = prevTight\n  }\n\n  // :: (string, ?bool) → string\n  // Escape the given string so that it can safely appear in Markdown\n  // content. If `startOfLine` is true, also escape characters that\n  // has special meaning only at the start of the line.\n  esc(str, startOfLine) {\n    str = str.replace(/[`*\\\\~\\[\\]]/g, \"\\\\$&\")\n    if (startOfLine) str = str.replace(/^[:#\\-*+]/, \"\\\\$&\").replace(/^(\\d+)\\./, \"$1\\\\.\")\n    return str\n  }\n\n  quote(str) {\n    var wrap = str.indexOf('\"') == -1 ? '\"\"' : str.indexOf(\"'\") == -1 ? \"''\" : \"()\"\n    return wrap[0] + str + wrap[1]\n  }\n\n  // :: (string, number) → string\n  // Repeat the given string `n` times.\n  repeat(str, n) {\n    let out = \"\"\n    for (let i = 0; i < n; i++) out += str\n    return out\n  }\n\n  // : (Mark, bool, string?) → string\n  // Get the markdown string for a given opening or closing mark.\n  markString(mark, open, parent, index) {\n    let info = this.marks[mark.type.name]\n    let value = open ? info.open : info.close\n    return typeof value == \"string\" ? value : value(this, mark, parent, index)\n  }\n\n  // :: (string) → { leading: ?string, trailing: ?string }\n  // Get leading and trailing whitespace from a string. Values of\n  // leading or trailing property of the return object will be undefined\n  // if there is no match.\n  getEnclosingWhitespace(text) {\n    return {\n      leading: (text.match(/^(\\s+)/) || [])[0],\n      trailing: (text.match(/(\\s+)$/) || [])[0]\n    }\n  }\n}\n"],"sourceRoot":""}