{"version":3,"sources":["webpack:///./node_modules/fault/index.js","webpack:///./node_modules/highlight.js/lib/core.js","webpack:///./node_modules/prosemirror-gapcursor/dist/index.js","webpack:///./node_modules/prosemirror-dropcursor/dist/dropcursor.js","webpack:///./node_modules/prosemirror-history/dist/history.js","webpack:///./node_modules/prosemirror-collab/dist/collab.js","webpack:///./node_modules/lowlight/lib/core.js","webpack:///./src/views/administration/notifications/NotificationConfig.vue?285a","webpack:///./node_modules/w3c-keyname/index.js","webpack:///./node_modules/prosemirror-keymap/dist/keymap.js","webpack:///./node_modules/format/format.js","webpack:///./src/views/administration/notifications/NotificationConfig.vue?ae31","webpack:///./node_modules/tiptap-utils/dist/utils.esm.js","webpack:///./node_modules/tiptap-commands/dist/commands.esm.js","webpack:///./node_modules/tiptap/dist/tiptap.esm.js","webpack:///./node_modules/tiptap-extensions/dist/extensions.esm.js","webpack:///src/views/administration/notifications/NotificationConfig.vue","webpack:///./src/views/administration/notifications/NotificationConfig.vue?2e92","webpack:///./src/views/administration/notifications/NotificationConfig.vue?7cd3","webpack:///./node_modules/prosemirror-model/dist/index.js","webpack:///./node_modules/prosemirror-state/dist/index.js","webpack:///./node_modules/prosemirror-view/dist/index.js","webpack:///./node_modules/prosemirror-inputrules/dist/index.js","webpack:///./node_modules/prosemirror-schema-list/dist/schema-list.js","webpack:///./node_modules/prosemirror-utils/dist/index.js","webpack:///./node_modules/prosemirror-transform/dist/index.js","webpack:///./node_modules/rope-sequence/dist/index.js","webpack:///./node_modules/orderedmap/index.js","webpack:///./node_modules/prosemirror-commands/dist/commands.js","webpack:///./node_modules/prosemirror-tables/dist/index.js"],"names":["formatter","fault","create","Error","EConstructor","FormattedError","displayName","name","format","apply","arguments","module","exports","eval","EvalError","range","RangeError","reference","ReferenceError","syntax","SyntaxError","type","TypeError","uri","URIError","deepFreeze","obj","Map","clear","delete","set","Set","add","Object","freeze","getOwnPropertyNames","forEach","prop","isFrozen","deepFreezeEs6","_default","default","Response","mode","undefined","data","this","isMatchIgnored","escapeHTML","value","replace","inherit","original","objects","result","key","SPAN_CLOSE","emitsWrappingTags","node","kind","HTMLRenderer","parseTree","options","buffer","classPrefix","walk","text","className","sublanguage","span","TokenTree","rootNode","children","stack","length","top","push","pop","closeNode","JSON","stringify","builder","constructor","_walk","addText","openNode","child","every","el","join","_collapse","TokenTreeEmitter","super","emitter","root","renderer","escape","RegExp","source","re","concat","args","joined","map","x","either","countMatchGroups","toString","exec","startsWith","lexeme","match","index","BACKREF_RE","regexps","separator","numCaptures","regex","offset","out","substring","String","Number","MATCH_NOTHING_RE","IDENT_RE","UNDERSCORE_IDENT_RE","NUMBER_RE","C_NUMBER_RE","BINARY_NUMBER_RE","RE_STARTERS_RE","SHEBANG","opts","beginShebang","binary","begin","end","relevance","m","resp","ignoreMatch","BACKSLASH_ESCAPE","APOS_STRING_MODE","illegal","contains","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","REGEXP_MODE","TITLE_MODE","UNDERSCORE_TITLE_MODE","METHOD_GUARD","END_SAME_AS_BEGIN","assign","_beginMatch","MODES","__proto__","skipIfhasPrecedingDot","response","before","input","beginKeywords","parent","split","__beforeBegin","keywords","compileIllegal","_parent","Array","isArray","compileMatch","compileRelevance","COMMON_KEYWORDS","DEFAULT_KEYWORD_CLASSNAME","compileKeywords","rawKeywords","caseInsensitive","compiledKeywords","compileList","keys","keywordList","toLowerCase","keyword","pair","scoreForKeyword","providedScore","commonKeyword","includes","compileLanguage","language","plugins","langRe","global","case_insensitive","MultiRegex","matchIndexes","regexes","matchAt","position","terminators","matcherRe","lastIndex","s","i","findIndex","matchData","splice","ResumableMultiRegex","rules","multiRegexes","count","regexIndex","matcher","slice","addRule","compile","getMatcher","resumingScanAtSamePosition","m2","considerAll","buildModeRegex","mm","term","rule","terminatorEnd","compileMode","cmode","isCompiled","ext","compilerExtensions","keywordPattern","$pattern","lexemes","keywordPatternRe","beginRe","endSameAsBegin","endsWithParent","endRe","illegalRe","c","expandOrCloneMode","starts","classNameAliases","dependencyOnParent","variants","cachedVariants","variant","version","hasValueOrEmptyAttribute","Boolean","BuildVuePlugin","hljs","Component","props","detectedLanguage","unknownLanguage","computed","autoDetect","getLanguage","console","warn","code","highlightAuto","highlight","ignoreIllegals","autodetect","createElement","class","domProps","innerHTML","highlighted","VuePlugin","Vue","component","mergeHTMLPlugin","originalStream","nodeStream","resultNode","document","mergeStreams","tag","nodeName","_nodeStream","firstChild","nextSibling","nodeType","nodeValue","event","processed","nodeStack","selectStream","open","attributeString","attr","call","attributes","close","render","stream","reverse","substr","seenDeprecations","error","message","log","deprecated","escape$1","inherit$1","NO_MATCH","Symbol","HLJS","languages","aliases","SAFE_MODE","fixMarkupRe","LANGUAGE_NOT_FOUND","PLAINTEXT_LANGUAGE","disableAutodetect","noHighlightRe","languageDetectRe","tabReplace","useBR","__emitter","shouldNotHighlight","languageName","test","blockLanguage","block","classes","parentNode","find","_class","codeOrlanguageName","optionsOrCode","continuation","context","fire","_highlight","codeToHighlight","keywordData","matchText","prototype","hasOwnProperty","processKeywords","modeBuffer","buf","keywordRelevance","cssClass","addKeyword","processSubLanguage","subLanguage","continuations","addSublanguage","processBuffer","startNewMode","endOfMode","matchPlusRemainder","matched","endsParent","doIgnore","resumeScanAtSamePosition","doBeginMatch","newMode","beforeCallbacks","cb","skip","excludeBegin","returnBegin","doEndMatch","endMode","origin","returnEnd","excludeEnd","processContinuations","list","current","unshift","item","lastMatch","processLexeme","textBeforeMatch","err","badRule","iterations","md","beforeMatch","processedCount","closeAllNodes","finalize","toHTML","Math","floor","illegalBy","msg","sofar","errorRaised","justTextHighlightResult","languageSubset","plaintext","results","filter","autoDetection","sorted","sort","a","b","supersetOf","best","secondBest","second_best","fixMarkup","html","updateClassName","element","currentLang","resultLang","classList","brPlugin","TAB_REPLACE_RE","tabReplacePlugin","highlightElement","textContent","relavance","configure","userOptions","initHighlighting","called","blocks","querySelectorAll","initHighlightingOnLoad","wantsHighlight","highlightAll","readyState","boot","registerLanguage","languageDefinition","lang","error$1","rawDefinition","bind","registerAliases","unregisterLanguage","alias","listLanguages","requireLanguage","aliasList","upgradePluginAPI","plugin","addPlugin","deprecateFixMarkup","arg","deprecateHighlightBlock","window","addEventListener","highlightBlock","vuePlugin","debugMode","safeMode","versionString","defineProperty","prosemirrorKeymap","prosemirrorState","prosemirrorView","prosemirrorModel","GapCursor","Selection$$1","$pos","doc","mapping","resolve","head","valid","near","content","Slice","empty","eq","other","toJSON","pos","fromJSON","json","getBookmark","GapBookmark","anchor","isTextblock","closedBefore","closedAfter","override","spec","allowGapCursor","deflt","contentMatchAt","defaultType","findFrom","dir","mustMove","next","d","depth","indexAfter","childCount","maybeChild","$cur","lastChild","$cur$1","Selection","visible","jsonID","inlineContent","isAtom","isolating","after","gapCursor","Plugin","decorations","drawGapCursor","createSelectionBetween","_view","$anchor","$head","handleClick","handleKeyDown","keydownHandler","arrow","axis","dirStr","state","dispatch","view","sel","selection","$start","$to","$from","TextSelection","endOfTextblock","$found","tr","setSelection","someProp","editable","ref","posAtCoords","left","clientX","clientY","inside","NodeSelection","isSelectable","nodeAt","DecorationSet","Decoration","widget","prosemirrorTransform","dropCursor","editorView","DropCursorView","this$1","width","color","cursorPos","timeout","handlers","handler","e","dom","destroy","removeEventListener","update","prevState","updateOverlay","setCursor","removeChild","rect","nodeBefore","nodeAfter","nodeRect","nodeDOM","nodeSize","getBoundingClientRect","bottom","right","coords","coordsAtPos","offsetParent","appendChild","style","cssText","parentRect","body","getComputedStyle","pageXOffset","pageYOffset","height","scheduleRemoval","clearTimeout","setTimeout","dragover","target","dragging","dropPoint","dragend","drop","dragleave","relatedTarget","_interopDefault","ex","RopeSequence","max_empty_items","Branch","items","eventCount","cutOffEvents","n","cutPoint","popEvent","preserveItems","remap","mapFrom","get","remapping","maps","remaining","transform","addAfter","addBefore","step","Item","maybeStep","appendMap","append","addTransform","histOptions","newItems","oldItems","lastItem","steps","invert","docs","merged","merge","overflow","DEPTH_OVERFLOW","from","to","Mapping","mirrorPos","mirrorOffset","addMaps","array","rebased","rebasedTransform","rebasedCount","rebasedItems","start","max","newUntil","iRebased","getMirror","min","newMaps","branch","emptyItemCount","compress","upto","events","getMap","newItem","last","HistoryState","done","undone","prevRanges","prevTime","applyTransaction","history","historyTr","getMeta","historyKey","historyState","closeHistoryKey","appended","redo","mustPreserveItems","rangesFor","mapRanges","newGroup","time","newGroupDelay","isAdjacentTo","docChanged","adjacent","_from","_to","ranges","histTransaction","config","added","newHist","setMeta","scrollIntoView","cachedPreserveItems","cachedPreserveItemsPlugins","historyPreserveItems","closeHistory","PluginKey","init","hist","undo","getState","undoDepth","redoDepth","Rebaseable","inverted","rebaseSteps","over","i$1","i$2","mapped","failed","setMirror","CollabState","unconfirmed","unconfirmedFrom","collabKey","collab","clientID","random","newState","receiveTransaction","clientIDs","collabState","ourID","ours","nUnconfirmed","newCollabState","mapSelectionBackward","between","updated","sendableSteps","_origins","getVersion","high","registerAlias","Emitter","noop","toHtmlNoop","defaultPrefix","settings","prefix","subset","tagName","properties","tail","base","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","shift","48","49","50","51","52","53","54","55","56","57","chrome","navigator","userAgent","safari","vendor","gecko","mac","platform","brokenModifierNames","fromCharCode","keyName","ignoreKey","ctrlKey","altKey","metaKey","shiftKey","keyCode","normalizeKeyName","alt","ctrl","meta","parts","mod","normalize","copy","modifiers","keymap","bindings","baseName","isChar","direct","fromCode","namespace","printf","vsprintf","fmt","replacements","tmp","precision","argIndex","escaped","leadingZero","nextArg","slurpNumber","digits","parseInt","parseFloat","toFixed","toUpperCase","_vm","_h","$createElement","_c","_self","staticClass","on","$event","preventDefault","onSubmit","_e","directives","rawName","loading","expression","attrs","backToList","_v","_s","$t","_uid","notificationConfig","composing","$set","errors","has","first","editor","scopedSlots","_u","fn","commands","isActive","bold","italic","underline","bullet_list","ordered_list","heading","level","staticRenderFns","_toConsumableArray","arr","_arrayWithoutHoles","_iterableToArray","_nonIterableSpread","arr2","iter","iterator","getMarkAttrs","_state$selection","marks","nodesBetween","mark","markItem","getMarkRange","childAfter","parentOffset","link","startIndex","startPos","endIndex","endPos","isInSet","markIsActive","storedMarks","rangeHasMark","nodeIsActive","predicate","hasMarkup","getMarksBetween","markInputRule","regexp","markType","getAttrs","Function","markEnd","markStart","matchStart","indexOf","matchEnd","textStart","lastIndexOf","textEnd","excludedMarks","excluded","addMark","removeStoredMark","pasteRule","fragment","nodes","isText","cut","addToSet","fromArray","transformPasted","openStart","openEnd","markPasteRule","isLink","removeMark","toggleBlockType","toggletype","isList","schema","todo_list","toggleList","listType","itemType","blockRange","parentList","validContent","setNodeMarkup","updateMark","hasMark","_typeof","_classCallCheck","instance","Constructor","_defineProperties","descriptor","enumerable","configurable","writable","_createClass","protoProps","staticProps","_defineProperty","ownKeys","object","enumerableOnly","getOwnPropertySymbols","symbols","sym","getOwnPropertyDescriptor","_objectSpread2","getOwnPropertyDescriptors","defineProperties","_inherits","subClass","superClass","_setPrototypeOf","_getPrototypeOf","o","setPrototypeOf","getPrototypeOf","p","_assertThisInitialized","self","_possibleConstructorReturn","_slicedToArray","_arrayWithHoles","_iterableToArrayLimit","_nonIterableRest","_arr","_n","_d","_i","camelCase","str","word","ComponentView","_ref","extension","getPos","isNode","isMark","getMarkPos","captureEvents","createDOM","contentDOM","vm","$refs","_this","extend","selected","updateAttrs","propsData","$mount","$el","updateComponentProps","_this2","_props","originalSilent","silent","entries","_ref2","_ref3","newAttrs","transaction","mutation","_this3","stopEvent","draggable","dragHandle","closest","isValidDragHandle","once","isCopy","isPaste","isCut","isDrag","posAtDOM","resolvedPos","$destroy","_callbacks","_len","_key","callbacks","callback","Extension","defaultOptions","ExtensionManager","extensions","bindEditor","extensionKeymaps","nodeMarkKeymaps","excludedExtensions","allowedExtensions","extensionInputRules","inputRules","nodeMarkInputRules","reduce","allInputRules","extensionPasteRules","pasteRules","nodeMarkPasteRules","allPasteRules","_ref4","allCommands","focus","handle","_name","_value","_ref5","_ref6","commandName","commandValue","_ref7","Proxy","changed","_ref8","allPlugins","_ref9","injectCSS","css","_document","insertBefore","Mark","_Extension","minMax","Node","Doc","_Node","Paragraph","group","parseDOM","toDOM","Text","_Emitter","Editor","editorProps","autoFocus","topNode","emptyDocument","useBuiltInExtensions","disableInputRules","disablePasteRules","parseOptions","onInit","onTransaction","onUpdate","onFocus","onBlur","onPaste","onDrop","setOptions","focused","createExtensions","createNodes","createMarks","createSchema","createPlugins","keymaps","createKeymaps","createInputRules","createPasteRules","createView","createCommands","setActiveNodesAndMarks","emit","updateState","builtInExtensions","createDocument","Backspace","tabindex","handleDOMEvents","blur","nodeFromJSON","trim","fromSchema","parse","_this4","createState","handlePaste","handleDrop","_len2","_key2","dispatchTransaction","setProps","nodeViews","initNodeViews","_this5","nodeView","getHTML","getJSON","emitUpdate","size","_this6","_this$resolveSelectio","resolveSelection","_this$state","resolvedFrom","resolvedEnd","div","serializeFragment","_this$state2","replaceSelectionWith","setContent","_this7","activeMarks","activeMarkAttrs","activeNodes","reconfigure","docView","types","EditorContent","watch","immediate","$nextTick","setParentComponent","beforeDestroy","Menu","MenuBar","EditorMenuBar","registerPlugin","$scopedSlots","textRange","createRange","setEnd","setStart","singleRect","bias","rects","getClientRects","side","_view$docView$domFrom","domFromPos","childNodes","_child","Menu$1","keepInBounds","hide","lastState","box","round","sendUpdate","MenuBubble","BulletList","list_item","Heading","paragraph","levels","defining","ListItem","Enter","Tab","OrderedList","order","hasAttribute","getAttribute","tableGroup","cellContent","cellAttributes","background","getFromDOM","backgroundColor","setDOMAttr","_Mark","Bold","fontWeight","Italic","Link","href","url","inclusive","rel","HTMLAnchorElement","stopPropagation","Underline","components","PageTitle","id","methods","edit","put","then","title","catch","loadData","mounted","OrderedMap","findDiffStart","childA","childB","sameMarkup","j","inner","findDiffEnd","posA","posB","iA","iB","same","minSize","Fragment","prototypeAccessors$1","f","nodeStart","descendants","textBetween","blockSeparator","leafText","separated","isLeaf","isBlock","withText","cutByIndex","replaceChild","addToStart","addToEnd","found","otherPos","retIndex","curPos","cur","toStringInner","compareDeep","p$1","ReplaceError","placed","excludes","rank","removeFromSet","_","sameSet","setFrom","none","prototypeAccessors$2","removeRange","ref$1","indexTo","offsetTo","insertInto","dist","insert","canReplace","replaceOuter","prepareSliceForReplace","replaceThreeWay","replaceTwoWay","checkJoin","main","sub","compatibleContent","joinable","$before","$after","addNode","addRange","$end","textOffset","$along","extra","resolveNoCache","insertAt","removeBetween","maxOpen","openIsolating","n$1","ResolvedPos","path","prototypeAccessors$3","resolveDepth","val","dOff","marksAcross","isInline","sharedDepth","pred","NodeRange","sameParent","rem","resolveCached","resolveCache","cached","resolveCachePos","resolveCacheSize","prototypeAccessors$1$1","emptyAttrs","prototypeAccessors","defaultAttrs","includeParents","childBefore","toDebugString","wrapMarks","contentMatch","matchFragment","replacement","one","two","validEnd","allowsMarks","canReplaceWith","matchType","canAppend","defaultContentType","at","check","markFromJSON","TextNode","ContentMatch","wrapCache","prototypeAccessors$5","edgeCount","string","nodeTypes","TokenStream","expr","parseExpr","dfa","nfa","checkForDeadEnds","frag","hasRequiredAttrs","compatible","fillBefore","toEnd","seen","search","finished","tp","createAndFill","findWrapping","computeWrapping","active","via","edge","scan","inline","tokens","prototypeAccessors$1$3","exprs","parseExprSeq","eat","parseExprSubscript","parseExprAtom","parseExprRange","parseNum","resolveName","typeName","type$1","groups","connect","edges","loop","loop$1","next$1","next$2","cmp","nullFrom","labeled","explore","states","known","states$1","work","dead","defaults","attrName","hasDefault","computeAttrs","built","given","initAttrs","Attribute","tok","NodeType","markSet","prototypeAccessors$4","atom","ignore","isRequired","createChecked","allowsMarkType","allowedMarks","topType","prototypeAccessors$1$2","MarkType","Schema","contentExprCache","prop$1","contentExpr","markExpr","gatherMarks","prop$2","excl","topNodeType","wrappings","ok","mark$1","text$1","DOMParser","tags","styles","ParseContext","addAll","finish","parseSlice","matchTag","matches","namespaceURI","matchesContext","matchStyle","charCodeAt","schemaRules","priority","nextPriority","rules$1","name$1","domParser","blockTags","address","article","aside","blockquote","canvas","dd","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","OPT_PRESERVE_WS","OPT_PRESERVE_WS_FULL","OPT_OPEN_LEFT","wsOptionsFor","preserveWhitespace","NodeContext","solid","fill","wrap","parser","isOpen","pendingMarks","topContext","topOptions","topMatch","findPositions","needsBlock","prototypeAccessors$6","currentPos","normalizeList","prevItem","selector","msMatchesSelector","webkitMatchesSelector","mozMatchesSelector","parseStyles","addDOM","addTextNode","readStyles","addPendingMark","addElement","removePendingMark","domNodeBefore","previousSibling","insertNode","findInText","findInside","ruleFromNode","sync","oldNeedsBlock","leafFallback","addElementByRule","ownerDocument","createTextNode","enter","startIn","getContent","contentElement","querySelector","findAround","findAtPoint","findPlace","route","cx","enterInner","textblockFromContext","closeExtra","applyPendingMarks","preserveWS","topOpen","compareDocumentPosition","textNode","some","option","useRoot","minDepth","part","$context","DOMSerializer","gatherToDOM","createDocumentFragment","keep","rendered","spanning","markDOM","serializeMark","serializeNode","renderSpec","onContent","serializeNodeAndMarks","structure","setAttribute","innerContent","domSerializer","nodesFromSchema","marksFromSchema","classesById","SelectionRange","lastNode","lastParent","replaceRange","selectionToInsertionEnd","replaceWith","deleteRange","replaceRangeWith","textOnly","findSelectionIn","AllSelection","atStart","atEnd","cls","selectionClass","$cursor","ensureMarks","TextBookmark","dPos","mapResult","deleted","NodeBookmark","selectable","AllBookmark","startLen","ReplaceStep","ReplaceAroundStep","_newFrom","newTo","UPDATED_SEL","UPDATED_MARKS","UPDATED_SCROLL","Transaction","Transform$$1","Date","now","curSelection","curSelectionFor","selectionSet","storedMarksSet","isGeneric","scrolledIntoView","setStoredMarks","addStoredMark","addStep","setTime","replaceSelection","inheritMarks","deleteSelection","insertText","Transform","FieldDesc","desc","baseFields","_marks","_old","prev","Configuration","fields","pluginsByKey","EditorState","filterTransaction","rootTr","transactions","trs","applyInner","haveNew","appendTransaction","oldState","newInstance","field","applyListeners","$config","pluginFields","addApplyListener","removeApplyListener","bindProps","createKey","ie_edge","ie_upto10","ie_11up","ie","ie_version","documentMode","gecko_version","chrome_version","ios","android","webkit","documentElement","webkit_version","domIndex","host","isEquivalentPosition","off","targetNode","targetOff","scanFor","atomElements","hasBlockDesc","contentEditable","pmViewDesc","selectionCollapsed","domSel","collapsed","isCollapsed","rangeCount","getRangeAt","keyEvent","createEvent","initEvent","windowRect","win","innerWidth","innerHeight","getSide","scrollRectIntoView","startDOM","scrollThreshold","scrollMargin","defaultView","atTop","bounding","moveX","moveY","scrollBy","scrollTop","scrollLeft","storeScrollPos","refDOM","refTop","startY","y","elementFromPoint","localRect","dom$1","resetScrollPos","newRefTop","dTop","findOffsetInNode","coordsClosest","dxClosest","rowBot","rowTop","childIndex","dx","findOffsetInText","len","inRect","targetKludge","posFromElement","elt","posFromDOM","posFromCaret","outside","nearestDesc","posBefore","posAfter","startI","caretPositionFromPoint","pos$1","offsetNode","caretRangeFromPoint","assign$1","startContainer","startOffset","box$1","posAtStart","border","rectBefore","abs","rectAfter","flattenV","rect$1","flattenH","rect$2","target$1","rect$3","withFlushedState","viewState","activeElement","endOfTextblockVertical","nearest","boxes","maybeRTL","endOfTextblockHorizontal","getSelection","modify","oldRange","oldNode","focusNode","oldOff","focusOffset","oldBidiLevel","caretBidiLevel","parentDOM","domAfterPos","result$$1","removeAllRanges","cachedState","cachedDir","cachedResult","NOT_DIRTY","CHILD_DIRTY","CONTENT_DIRTY","NODE_DIRTY","ViewDesc","dirty","beforePosition","posAtEnd","contentLost","matchesWidget","matchesMark","matchesNode","matchesHack","parseRule","posBeforeChild","localPosFromDOM","domBefore","domAfter","desc$1","search$1","onlyNodes","getDesc","descAt","parseRange","fromOffset","toOffset","childBase","emptyChildAt","j$1","force","anchorDOM","headDOM","anchorNode","anchorOffset","collapse","ignoreMutation","_mutation","markDirty","startInside","endInside","markParentsDirty","nothing","WidgetViewDesc","raw","stop","CompositionViewDesc","textDOM","mut","oldValue","MarkViewDesc","custom","replaceNodes","NodeViewDesc","outerDeco","innerDeco","updateChildren","descObj","applyOuterDeco","CustomNodeViewDesc","TextViewDesc","reparseInView","sameOuterDeco","composition","localCompositionNode","updater","ViewTreeUpdater","iterDeco","syncToMarks","placeWidget","findNodeMatch","updateNextNode","addTextblockHacks","destroyRest","protectLocalComposition","renderChildren","renderDescs","is","iosHacks","nearbyTextNode","textPos","findTextInFragment","compositionNodes","updateInner","updateOuterDeco","needsWrap","oldDOM","patchOuterDeco","computeOuterDeco","selectNode","deselectNode","remove","docViewDesc","inParent","BRHackViewDesc","descs","childDOM","rm","OuterDecoLevel","noDeco","outerDOM","prevComputed","curComputed","curDOM","deco","patchAttributes","removeAttribute","prevList","curList","lockedNode","lock","preMatch","preMatched","preMatchOffset","compareSide","onWidget","onNode","locals","decoIndex","restNode","parentIndex","widgets","child$1","cutAt","i$3","forChild","oldCSS","listStyle","childPos","strStart","moveSelectionBlock","$side","selectHorizontally","mods","nodePos","nodeLen","isIgnorable","skipIgnoredNodesLeft","moveNode","moveOffset","isBlockNode","setSelFocus","skipIgnoredNodesRight","domObserver","setCurSelection","selectVertically","beyond","stopNativeHorizontalDelete","nextNode","switchEditable","chromeDownArrowBug","getMods","captureKeyDown","selectionFromDOM","inWidget","selectionBetween","selectionToDOM","takeFocus","syncNodeSelection","hasFocus","disconnectSelection","connectSelection","hasSelection","cursorWrapper","selectCursorWrapper","resetEditableFrom","resetEditableTo","brokenSelectBetweenUneditable","temporarilyEditableNear","removeClassOnSelectionChange","getPreMatch","destroyBetween","maxKeep","markDesc","nextDOM","locked","hideSelectionGuard","img","disabled","lastSelectedViewDesc","clearNodeSelection","hasFocusAndSelection","anchorInRightPlace","parseBetween","from_","to_","lastKeyCode","startDoc","editableContent","anchor$1","readDOMChange","typeOver","lastSelectionTime","lastSelectionOrigin","newSel","tr$1","shared","preferredPos","preferredSide","compare","lastKeyCodeTime","change","findDiff","sel$1","endA","endB","domChangeCount","nextSel","looksLikeJoin","suppressSelectionUpdates","markChange","$from1","chFrom","chTo","isMarkChange","sel$2","parsedSel","curMarks","prevMarks","removed","old","$newStart","$newEnd","skipClosingAndOpening","$next","fromEnd","mayOpen","adjust","move","move$1","serializeForClipboard","serializer","detachedDoc","wrapMap","wrapper","parseFromClipboard","plainText","inCode","asText","parsed","readHTML","contextNode","sliceData","addContext","closeSlice","normalizeSiblings","lastWrap","inLast","addToSibling","closeRight","wrapped","withWrappers","v","returned","sibling","closeRange","thead","colgroup","col","td","th","_detachedDoc","implementation","createHTMLDocument","metas","firstTag","observeOptions","childList","characterData","subtree","characterDataOldValue","useCharData","SelectionState","DOMObserver","handleDOMChange","queue","flushingSoon","observer","MutationObserver","mutations","removedNodes","flushSoon","flush","currentSelection","onCharData","prevValue","onSelectionChange","suppressingSelectionUpdates","observe","take","takeRecords","disconnect","ignoreSelectionChange","container","commonAncestorContainer","registerMutation","attributeName","addedNodes","editHandlers","initInput","mouseDown","lastClick","composingTimeout","compositionEndedAt","eventHandlers","eventBelongsToView","runCustomHandler","ensureListeners","setSelectionOrigin","destroyInput","currentHandlers","defaultPrevented","bubbles","dispatchEvent","eventCoords","isNear","click","dy","runHandlerOnContext","propName","updateSelection","selectClickedLeaf","selectClickedNode","selectedNode","selectAt","handleSingleClick","handleDoubleClick","handleTripleClick","defaultTripleClick","forceDOMFlush","endComposition","keydown","inOrNearComposition","keyup","keypress","charCode","selectNodeModifier","mousedown","flushed","MouseDown","targetPos","allowDefault","mightDrag","targetDesc","addAttr","setUneditable","up","timeStamp","touchdown","contextmenu","timeoutComposition","scheduleComposeEnd","delay","forceUpdate","captureCopy","selectNodeContents","compositionstart","compositionupdate","markCursor","compositionend","brokenClipboardAPI","sliceSingleNode","capturePaste","doPaste","singleNode","clipboardData","clearData","setData","paste","getData","files","Dragging","dragCopyModifier","dragstart","dataTransfer","dragenter","eventPos","$mouse","insertPos","beforeInsert","beforeinput","inputType","compareObjs","WidgetType","noSpec","oldOffset","InlineType","inclusiveStart","inclusiveEnd","local","buildTree","findInner","childOff","mapInner","newLocal","onRemove","mapChildren","byPos","addInner","childNode","childOffset","baseOffset","takeSpansForNode","moveSpans","withoutNulls","removeInner","span$1","dec","localSet","DecorationGroup","removeOverlap","localsInner","members","oldChildren","oldStart","oldEnd","newStart","newEnd","dSize","mustRebuild","fromLocal","toLocal","mapAndGatherRemainingDecorations","from$1","spans","gather","hasNulls","localStart","working","insertAhead","viewDecorations","EditorView","place","_root","mount","getEditable","updateCursorWrapper","buildNodeViews","computeDocDeco","pluginViews","updatePluginViews","contenteditable","selectionContext","needChromeSelectionForce","newContext","changedNodeViews","nA","nB","updateStateInner","reconfigured","redraw","scroll","scrollToSelection","updateDoc","updateSel","oldScrollPos","overflowAnchor","forceSelUpdate","startSelContext","destroyPluginViews","pluginView","setActive","preventScroll","domAtPos","__serializeForClipboard","__parseFromClipboard","__endComposition","InputRule","stringHandler","cutOff","MAX_MATCH","stored","handleTextInput","run","isInputRules","textBefore","undoInputRule","undoable","toUndo","emDash","ellipsis","openDoubleQuote","closeDoubleQuote","openSingleQuote","closeSingleQuote","smartQuotes","wrappingInputRule","joinPredicate","wrapping","canJoin","textblockTypeInputRule","setBlockType","olDOM","ulDOM","liDOM","orderedList","bulletList","listItem","addListNodes","itemContent","listGroup","wrapInList","doJoin","outerRange","$insert","doWrapInList","wrappers","joinBefore","splitDepth","splitPos","canSplit","splitListItem","grandParent","keepItem","nextType","liftListItem","liftToOuterList","liftOutOfList","endOfList","lift","liftTarget","indexBefore","sinkListItem","nestedBefore","prosemirrorTables","removeParentNodeOfType","findParentNodeOfType","removeNodeAtPos","replaceParentNodeOfType","newTr","replaceNodeAtPos","removeSelectedNode","isNodeSelection","cloneTr","replaceSelectedNode","_tr$selection","setTextSelection","nextSelection","isSelectableNode","shouldSelectNode","safeInsert","tryToReplace","hasPosition","$insertPos","oldTr","isEmptyParagraph","_oldTr","canInsert","_pos","_pos2","setParentNodeMarkup","selectParentNodeOfType","removeNodeBefore","findPositionOfNodeBefore","equalNodeType","tableNodeTypes","roles","tableRole","findTableClosestToPos","findParentNodeClosestToPos","createCell","cellType","isRectSelected","TableMap","$anchorCell","cells","cellsInRect","selectedCells","rectBetween","$headCell","transpose","column","convertTableNodeToArrayOfRows","tableNode","rows","rowIndex","rowCells","colIndex","cellPos","cell","findCell","convertArrayOfRowsToTableNode","arrayOfNodes","rowsPM","row","oldCell","newCell","newTable","moveTableColumn","indexesOrigin","indexesTarget","direction","moveRowInArrayOfRows","moveTableRow","directionOverride","rowsExtracted","positionOffset","checkInvalidMovements","originIndex","targetIndex","targets","errorMessage","findParentNode","findParentDomRef","findDomRefAtPos","hasParentNode","findParentNodeOfTypeClosestToPos","hasParentNodeOfType","findParentDomRefOfType","findSelectedNodeOfType","maybeSelection","TEXT_NODE","flatten","descend","findChildren","findTextNodes","findInlineNodes","findBlockNodes","findChildrenByAttr","findChildrenByType","findChildrenByMark","findTable","isCellSelection","CellSelection","getSelectionRect","isColumnSelected","columnIndex","isRowSelected","isTableSelected","getCellsInColumn","indexes","acc","getCellsInRow","getCellsInTable","select","expand","isRowSelection","findCellClosestToPos","selRect","cellsInFirstRow","cellsInLastRow","selectColumn","selectRow","selectTable","_TableMap$get","emptyCell","_tableNodeTypes$cell$","addColumnAt","addColumn","tableStart","moveRow","originRowIndex","targetRowIndex","tryToFit","_getSelectionRangeInR","getSelectionRangeInRow","indexesOriginRow","_getSelectionRangeInR2","indexesTargetRow","moveColumn","originColumnIndex","targetColumnIndex","_getSelectionRangeInC","getSelectionRangeInColumn","indexesOriginColumn","_getSelectionRangeInC2","indexesTargetColumn","addRowAt","clonePreviousRow","cloneRowIndex","cloneRowAt","addRow","tableNodes","rowPos","cloneRow","rowWidth","rowspan","colspan","rowSpanCells","_loop","foundCells","filterCellsInRow","spanRange","setCellAttrs","removeColumnAt","removeTable","removeColumn","removeRowAt","removeRow","removeSelectedColumns","pmTableRect","removeSelectedRows","removeColumnClosestToPos","findCellRectClosestToPos","removeRowClosestToPos","forEachCellInColumn","cellTransform","setCursorToLastCell","forEachCellInRow","createTable","rowsCount","colsCount","withHeaderRow","_tableNodeTypes","tableCell","tableHeader","header_cell","tableRow","headerCells","_i2","_loop2","maybeEndIndex","_loop3","maybeCells","firstSelectedColumnCells","firstRowCells","headCell","_i3","columnCells","_loop4","_loop5","firstSelectedRowCells","firstColumnCells","_i4","lower16","factor16","pow","makeRecover","recoverIndex","recoverOffset","MapResult","recover","StepMap","diff","assoc","_map","simple","oldIndex","newIndex","oldSize","newSize","touches","mirror","TransformError","mirrors","appendMapping","startSize","mirr","appendMappingInverted","totalSize","inverse","recoverables","rec","corr","mustOverride","stepsByID","Step","_doc","_mapping","_other","stepType","stepClass","StepResult","fail","fromReplace","Step$$1","contentBetween","slice$1","gapFrom","gapTo","gap","inserted","canCut","innerRange","around","findWrappingOutside","findWrappingInside","withAttrs","outer","lastType","innerMatch","canChangeType","typesAfter","innerType","index$1","rest","baseType","joinPoint","insertPoint","d$1","pass","mapFragment","gapStart","gapEnd","splitting","splitting$1","clearIncompatible","startM","endM","newNode","typeAfter","AddMarkStep","oldSlice","RemoveMarkStep","replaceStep","fitsTrivially","placeSlice","fittedLeft","fitLeft","fitted","fitRight","canMoveText","fittedAfter","fitLeftInner","placedBelow","placedHere","fitRightJoin","matchCount","toNode","joinable$1","toIndex","closed","fitRightClosed","fitRightSeparate","normalizeSlice","nodeRight","frontier","Frontier","removing","adding","newSet","toRemove","found$1","parentType","delSteps","allowed","closeNodeStart","closeNodeEnd","closeFragmentEnd","closeFragment","oldOpen","newOpen","coveredDepths","placeContent","single","w","ch","targetDepths","preferredTarget","preferredTargetIndex","leftNodes","preferredDepth","openDepth","targetDepth","startSteps","point","covered","GOOD_LEAF_SIZE","leafAppend","leafPrepend","appendInner","prepend","Append","sliceInner","getInner","forEachInner","forEachInvertedInner","values","Leaf","leftLen","newKey","without","subtract","joinBackward","$cut","findCutBefore","deleteBarrier","textblockAt","selectNodeBackward","joinForward","findCutAfter","selectNodeForward","joinUp","nodeSel","joinDown","newlineInCode","exitCode","above","createParagraphNear","liftEmptyBlock","splitBlock","can","splitBlockKeepMarks","selectParentNode","selectAll","joinMaybeClear","conn","joinAt","selAfter","wrapIn","applicable","markApplies","toggleMark","ref$2","$from$1","$to$1","wrapDispatchForJoin","isJoinable","autoJoin","command","chainCommands","backspace","del","pcBaseKeymap","macBaseKeymap","os","baseKeymap","readFromCache","addToCache","WeakMap","cache","cache$1","cacheSize","cachePos","Rect","problems","computeMap","findWidth","mapPos","colWidths","rowNode","cellNode","colwidth","h","colW","widthIndex","expectedPos","missing","tableMap","badWidths","findBadColWidths","hasRowSpan","prevRow","cell$1","colWidth","freshColWidth","colCount","nextCell","leftA","rightA","topA","bottomA","leftB","rightB","topB","bottomB","positionAt","rowStart","rowEnd","rowEndIndex","cellAround","cellWrapping","role","isInTable","selectionCell","cellNear","role$1","pointsAtCell","moveCellForward","inSameTable","$a","$b","moved","setAttr","rmColSpan","addColSpan","tableChanged","rowSelection","isColSelection","colSelection","rowContent","cellRect","extraLeft","extraRight","attrs$1","forEachCell","anchorTop","headTop","anchorBot","headBot","anchorRect","headRect","anchorLeft","headLeft","anchorRight","headRight","anchorCell","CellBookmark","drawCellSelection","isCellBoundarySelection","afterFrom","beforeTo","isTextSelectionAcrossCells","fromCellBoundaryNode","toCellBoundaryNode","node$1","normalizeSelection","allowTableNodeSelection","$cell","lastCell","getCellAttrs","extraAttrs","widthAttr","widths","getter","setter","cellAttrs","table_row","table_cell","table_header","pastedCells","fitSlice","ensureRectangular","r","r$1","r$2","clipCells","newWidth","newHeight","newRows","newRows$1","row$1","cells$1","growTable","emptyHead","start$1","emptyRow","isolateHorizontal","cellTop","cellLeft","isolateVertical","updatePos","insertCells","recomp","shiftArrow","deleteCellSelection","maybeSetSelection","atEndOfCell","baseContent","handleMouseDown","startEvent","startDOMCell","domInCell","setCellSelection","cellUnderMouse","starting","mousePos","fixTablesKey","changedDescendants","curSize","fixTables","fixTable","tablePos","mustAdd","prob","cell$2","tableNodeType","selectedRect","columnIsHeader","headerCell","refColumn","addColumnBefore","addColumnAfter","mapStart","deleteColumn","rowIsHeader","refRow","addRowBefore","addRowAfter","nextRow","newPos","deleteRow","isEmpty","cellsOverlapRectangle","indexTop","indexLeft","indexBottom","indexRight","mergeCells","mergedPos","mergedCell","splitCell","splitCellWithType","getCellType","baseAttrs","setCellAttr","deprecated_toggleHeader","isHeaderEnabledByType","cellPositions","toggleHeader","useDeprecatedLogic","isHeaderRowEnabled","isHeaderColumnEnabled","isHeaderEnabled","selectionStartsAt","cellsRect","newType","relativeCellPos","toggleHeaderRow","toggleHeaderColumn","toggleHeaderCell","findNextCell","rowNode$1","goToNextCell","deleteTable","TableView","cellMinWidth","updateColumns","overrideCol","overrideValue","totalWidth","fixedWidth","hasWidth","cssWidth","minWidth","record","key$1","columnResizing","handleWidth","View","lastColumnResizable","ResizeState","pluginState","activeHandle","mousemove","handleMouseMove","mouseleave","handleMouseLeave","handleMouseDown$1","handleDecorations","domCellAround","edgeCell","updateHandle","currentColWidth","updateColumnWidth","draggedWidth","setDragging","which","dragged","displayColumnWidth","startX","startWidth","domWidth","offsetWidth","setHandle","mapIndex","zeroes","tableEditing","action","tableEditingKey","columnResizingPluginKey","updateColumnsOnResize","__pastedCells","__insertCells","__clipCells"],"mappings":"kHAEA,IAAIA,EAAY,EAAQ,QAEpBC,EAAQC,EAAOC,OAcnB,SAASD,EAAOE,GAGd,OAFAC,EAAeC,YAAcF,EAAaE,aAAeF,EAAaG,KAE/DF,EAEP,SAASA,EAAeG,GAKtB,OAJIA,IACFA,EAASR,EAAUS,MAAM,KAAMC,YAG1B,IAAIN,EAAaI,IAtB5BG,EAAOC,QAAUX,EAEjBA,EAAMY,KAAOX,EAAOY,WACpBb,EAAMc,MAAQb,EAAOc,YACrBf,EAAMgB,UAAYf,EAAOgB,gBACzBjB,EAAMkB,OAASjB,EAAOkB,aACtBnB,EAAMoB,KAAOnB,EAAOoB,WACpBrB,EAAMsB,IAAMrB,EAAOsB,UAEnBvB,EAAMC,OAASA,G,mBCff,SAASuB,EAAWC,GAuBhB,OAtBIA,aAAeC,IACfD,EAAIE,MAAQF,EAAIG,OAASH,EAAII,IAAM,WAC/B,MAAM,IAAI3B,MAAM,qBAEbuB,aAAeK,MACtBL,EAAIM,IAAMN,EAAIE,MAAQF,EAAIG,OAAS,WAC/B,MAAM,IAAI1B,MAAM,sBAKxB8B,OAAOC,OAAOR,GAEdO,OAAOE,oBAAoBT,GAAKU,SAAQ,SAAU7B,GAC9C,IAAI8B,EAAOX,EAAInB,GAGI,iBAAR8B,GAAqBJ,OAAOK,SAASD,IAC5CZ,EAAWY,MAIZX,EAGX,IAAIa,EAAgBd,EAChBe,EAAWf,EACfc,EAAcE,QAAUD,EAGxB,MAAME,EAIJ,YAAYC,QAEQC,IAAdD,EAAKE,OAAoBF,EAAKE,KAAO,IAEzCC,KAAKD,KAAOF,EAAKE,KACjBC,KAAKC,gBAAiB,EAGxB,cACED,KAAKC,gBAAiB,GAQ1B,SAASC,EAAWC,GAClB,OAAOA,EACJC,QAAQ,KAAM,SACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,UACdA,QAAQ,KAAM,UAWnB,SAASC,EAAQC,KAAaC,GAE5B,MAAMC,EAASrB,OAAO/B,OAAO,MAE7B,IAAK,MAAMqD,KAAOH,EAChBE,EAAOC,GAAOH,EAASG,GAOzB,OALAF,EAAQjB,SAAQ,SAASV,GACvB,IAAK,MAAM6B,KAAO7B,EAChB4B,EAAOC,GAAO7B,EAAI6B,MAGE,EAe1B,MAAMC,EAAa,UAMbC,EAAqBC,KAChBA,EAAKC,KAIhB,MAAMC,EAOJ,YAAYC,EAAWC,GACrBhB,KAAKiB,OAAS,GACdjB,KAAKkB,YAAcF,EAAQE,YAC3BH,EAAUI,KAAKnB,MAOjB,QAAQoB,GACNpB,KAAKiB,QAAUf,EAAWkB,GAO5B,SAASR,GACP,IAAKD,EAAkBC,GAAO,OAE9B,IAAIS,EAAYT,EAAKC,KAChBD,EAAKU,cACRD,EAAY,GAAGrB,KAAKkB,cAAcG,KAEpCrB,KAAKuB,KAAKF,GAOZ,UAAUT,GACHD,EAAkBC,KAEvBZ,KAAKiB,QAAUP,GAMjB,QACE,OAAOV,KAAKiB,OASd,KAAKI,GACHrB,KAAKiB,QAAU,gBAAgBI,OAQnC,MAAMG,EACJ,cAEExB,KAAKyB,SAAW,CAAEC,SAAU,IAC5B1B,KAAK2B,MAAQ,CAAC3B,KAAKyB,UAGrB,UACE,OAAOzB,KAAK2B,MAAM3B,KAAK2B,MAAMC,OAAS,GAGxC,WAAa,OAAO5B,KAAKyB,SAGzB,IAAIb,GACFZ,KAAK6B,IAAIH,SAASI,KAAKlB,GAIzB,SAASC,GAEP,MAAMD,EAAO,CAAEC,OAAMa,SAAU,IAC/B1B,KAAKd,IAAI0B,GACTZ,KAAK2B,MAAMG,KAAKlB,GAGlB,YACE,GAAIZ,KAAK2B,MAAMC,OAAS,EACtB,OAAO5B,KAAK2B,MAAMI,MAMtB,gBACE,MAAO/B,KAAKgC,cAGd,SACE,OAAOC,KAAKC,UAAUlC,KAAKyB,SAAU,KAAM,GAO7C,KAAKU,GAEH,OAAOnC,KAAKoC,YAAYC,MAAMF,EAASnC,KAAKyB,UAS9C,aAAaU,EAASvB,GAQpB,MAPoB,kBAATA,EACTuB,EAAQG,QAAQ1B,GACPA,EAAKc,WACdS,EAAQI,SAAS3B,GACjBA,EAAKc,SAASpC,QAASkD,GAAUxC,KAAKqC,MAAMF,EAASK,IACrDL,EAAQH,UAAUpB,IAEbuB,EAMT,iBAAiBvB,GACK,kBAATA,GACNA,EAAKc,WAENd,EAAKc,SAASe,MAAMC,GAAoB,kBAAPA,GAGnC9B,EAAKc,SAAW,CAACd,EAAKc,SAASiB,KAAK,KAEpC/B,EAAKc,SAASpC,QAASkD,IACrBhB,EAAUoB,UAAUJ,OA0B5B,MAAMK,UAAyBrB,EAI7B,YAAYR,GACV8B,QACA9C,KAAKgB,QAAUA,EAOjB,WAAWI,EAAMP,GACF,KAATO,IAEJpB,KAAKuC,SAAS1B,GACdb,KAAKsC,QAAQlB,GACbpB,KAAKgC,aAMP,QAAQZ,GACO,KAATA,GAEJpB,KAAKd,IAAIkC,GAOX,eAAe2B,EAAStF,GAEtB,MAAMmD,EAAOmC,EAAQC,KACrBpC,EAAKC,KAAOpD,EACZmD,EAAKU,aAAc,EACnBtB,KAAKd,IAAI0B,GAGX,SACE,MAAMqC,EAAW,IAAInC,EAAad,KAAMA,KAAKgB,SAC7C,OAAOiC,EAAS9C,QAGlB,WACE,OAAO,GAQX,SAAS+C,EAAO/C,GACd,OAAO,IAAIgD,OAAOhD,EAAMC,QAAQ,wBAAyB,QAAS,KAOpE,SAASgD,EAAOC,GACd,OAAKA,EACa,kBAAPA,EAAwBA,EAE5BA,EAAGD,OAHM,KAUlB,SAASE,KAAUC,GACjB,MAAMC,EAASD,EAAKE,IAAKC,GAAMN,EAAOM,IAAIf,KAAK,IAC/C,OAAOa,EAUT,SAASG,KAAUJ,GACjB,MAAMC,EAAS,IAAMD,EAAKE,IAAKC,GAAMN,EAAOM,IAAIf,KAAK,KAAO,IAC5D,OAAOa,EAOT,SAASI,EAAiBP,GACxB,OAAO,IAAKF,OAAOE,EAAGQ,WAAa,KAAMC,KAAK,IAAIlC,OAAS,EAQ7D,SAASmC,EAAWV,EAAIW,GACtB,MAAMC,EAAQZ,GAAMA,EAAGS,KAAKE,GAC5B,OAAOC,GAAyB,IAAhBA,EAAMC,MAUxB,MAAMC,EAAa,iDAYnB,SAASxB,EAAKyB,EAASC,EAAY,KACjC,IAAIC,EAAc,EAElB,OAAOF,EAAQX,IAAKc,IAClBD,GAAe,EACf,MAAME,EAASF,EACf,IAAIjB,EAAKD,EAAOmB,GACZE,EAAM,GAEV,MAAOpB,EAAGzB,OAAS,EAAG,CACpB,MAAMqC,EAAQE,EAAWL,KAAKT,GAC9B,IAAKY,EAAO,CACVQ,GAAOpB,EACP,MAEFoB,GAAOpB,EAAGqB,UAAU,EAAGT,EAAMC,OAC7Bb,EAAKA,EAAGqB,UAAUT,EAAMC,MAAQD,EAAM,GAAGrC,QACrB,OAAhBqC,EAAM,GAAG,IAAeA,EAAM,GAEhCQ,GAAO,KAAOE,OAAOC,OAAOX,EAAM,IAAMO,IAExCC,GAAOR,EAAM,GACI,MAAbA,EAAM,IACRK,KAIN,OAAOG,IACNhB,IAAIJ,GAAM,IAAIA,MAAOV,KAAK0B,GAI/B,MAAMQ,EAAmB,OACnBC,EAAW,eACXC,EAAsB,gBACtBC,EAAY,oBACZC,EAAc,yEACdC,EAAmB,eACnBC,EAAiB,+IAKjBC,EAAU,CAACC,EAAO,MACtB,MAAMC,EAAe,YAQrB,OAPID,EAAKE,SACPF,EAAKG,MAAQlC,EACXgC,EACA,OACAD,EAAKE,OACL,SAEGlF,EAAQ,CACbgB,UAAW,OACXmE,MAAOF,EACPG,IAAK,IACLC,UAAW,EAEX,WAAY,CAACC,EAAGC,KACE,IAAZD,EAAEzB,OAAa0B,EAAKC,gBAEzBR,IAICS,EAAmB,CACvBN,MAAO,eAAgBE,UAAW,GAE9BK,EAAmB,CACvB1E,UAAW,SACXmE,MAAO,IACPC,IAAK,IACLO,QAAS,MACTC,SAAU,CAACH,IAEPI,EAAoB,CACxB7E,UAAW,SACXmE,MAAO,IACPC,IAAK,IACLO,QAAS,MACTC,SAAU,CAACH,IAEPK,EAAqB,CACzBX,MAAO,8IAUHY,EAAU,SAASZ,EAAOC,EAAKY,EAAc,IACjD,MAAMxG,EAAOQ,EACX,CACEgB,UAAW,UACXmE,QACAC,MACAQ,SAAU,IAEZI,GAQF,OANAxG,EAAKoG,SAASnE,KAAKqE,GACnBtG,EAAKoG,SAASnE,KAAK,CACjBT,UAAW,SACXmE,MAAO,6CACPE,UAAW,IAEN7F,GAEHyG,EAAsBF,EAAQ,KAAM,KACpCG,EAAuBH,EAAQ,OAAQ,QACvCI,EAAoBJ,EAAQ,IAAK,KACjCK,EAAc,CAClBpF,UAAW,SACXmE,MAAOR,EACPU,UAAW,GAEPgB,EAAgB,CACpBrF,UAAW,SACXmE,MAAOP,EACPS,UAAW,GAEPiB,EAAqB,CACzBtF,UAAW,SACXmE,MAAON,EACPQ,UAAW,GAEPkB,EAAkB,CACtBvF,UAAW,SACXmE,MAAOR,oGASPU,UAAW,GAEPmB,EAAc,CAOlBrB,MAAO,kBACPS,SAAU,CAAC,CACT5E,UAAW,SACXmE,MAAO,KACPC,IAAK,aACLO,QAAS,KACTC,SAAU,CACRH,EACA,CACEN,MAAO,KACPC,IAAK,KACLC,UAAW,EACXO,SAAU,CAACH,QAKbgB,EAAa,CACjBzF,UAAW,QACXmE,MAAOV,EACPY,UAAW,GAEPqB,EAAwB,CAC5B1F,UAAW,QACXmE,MAAOT,EACPW,UAAW,GAEPsB,EAAe,CAEnBxB,MAAO,UAAYT,EACnBW,UAAW,GAUPuB,EAAoB,SAASpH,GACjC,OAAOV,OAAO+H,OAAOrH,EACnB,CAEE,WAAY,CAAC8F,EAAGC,KAAWA,EAAK7F,KAAKoH,YAAcxB,EAAE,IAErD,SAAU,CAACA,EAAGC,KAAeA,EAAK7F,KAAKoH,cAAgBxB,EAAE,IAAIC,EAAKC,kBAIxE,IAAIuB,EAAqBjI,OAAOC,OAAO,CACnCiI,UAAW,KACXxC,iBAAkBA,EAClBC,SAAUA,EACVC,oBAAqBA,EACrBC,UAAWA,EACXC,YAAaA,EACbC,iBAAkBA,EAClBC,eAAgBA,EAChBC,QAASA,EACTU,iBAAkBA,EAClBC,iBAAkBA,EAClBG,kBAAmBA,EACnBC,mBAAoBA,EACpBC,QAASA,EACTE,oBAAqBA,EACrBC,qBAAsBA,EACtBC,kBAAmBA,EACnBC,YAAaA,EACbC,cAAeA,EACfC,mBAAoBA,EACpBC,gBAAiBA,EACjBC,YAAaA,EACbC,WAAYA,EACZC,sBAAuBA,EACvBC,aAAcA,EACdC,kBAAmBA,IA2BvB,SAASK,EAAsBrD,EAAOsD,GACpC,MAAMC,EAASvD,EAAMwD,MAAMxD,EAAMC,MAAQ,GAC1B,MAAXsD,GACFD,EAAS1B,cASb,SAAS6B,EAAc7H,EAAM8H,GACtBA,GACA9H,EAAK6H,gBAOV7H,EAAK2F,MAAQ,OAAS3F,EAAK6H,cAAcE,MAAM,KAAKjF,KAAK,KAAO,sBAChE9C,EAAKgI,cAAgBP,EACrBzH,EAAKiI,SAAWjI,EAAKiI,UAAYjI,EAAK6H,qBAC/B7H,EAAK6H,mBAKW5H,IAAnBD,EAAK6F,YAAyB7F,EAAK6F,UAAY,IAOrD,SAASqC,EAAelI,EAAMmI,GACvBC,MAAMC,QAAQrI,EAAKmG,WAExBnG,EAAKmG,QAAUrC,KAAU9D,EAAKmG,UAOhC,SAASmC,EAAatI,EAAMmI,GAC1B,GAAKnI,EAAKoE,MAAV,CACA,GAAIpE,EAAK2F,OAAS3F,EAAK4F,IAAK,MAAM,IAAIpI,MAAM,4CAE5CwC,EAAK2F,MAAQ3F,EAAKoE,aACXpE,EAAKoE,OAOd,SAASmE,EAAiBvI,EAAMmI,QAEPlI,IAAnBD,EAAK6F,YAAyB7F,EAAK6F,UAAY,GAIrD,MAAM2C,EAAkB,CACtB,KACA,MACA,MACA,KACA,MACA,KACA,KACA,OACA,SACA,OACA,SAGIC,EAA4B,UAQlC,SAASC,GAAgBC,EAAaC,EAAiBpH,EAAYiH,GAEjE,MAAMI,EAAmB,GAiBzB,MAb2B,kBAAhBF,EACTG,EAAYtH,EAAWmH,EAAYZ,MAAM,MAChCK,MAAMC,QAAQM,GACvBG,EAAYtH,EAAWmH,GAEvBrJ,OAAOyJ,KAAKJ,GAAalJ,SAAQ,SAAS+B,GAExClC,OAAO+H,OACLwB,EACAH,GAAgBC,EAAYnH,GAAYoH,EAAiBpH,OAIxDqH,EAYP,SAASC,EAAYtH,EAAWwH,GAC1BJ,IACFI,EAAcA,EAAYpF,IAAIC,GAAKA,EAAEoF,gBAEvCD,EAAYvJ,SAAQ,SAASyJ,GAC3B,MAAMC,EAAOD,EAAQnB,MAAM,KAC3Bc,EAAiBM,EAAK,IAAM,CAAC3H,EAAW4H,GAAgBD,EAAK,GAAIA,EAAK,SAa5E,SAASC,GAAgBF,EAASG,GAGhC,OAAIA,EACKtE,OAAOsE,GAGTC,GAAcJ,GAAW,EAAI,EAOtC,SAASI,GAAcJ,GACrB,OAAOV,EAAgBe,SAASL,EAAQD,eAc1C,SAASO,GAAgBC,GAAU,QAAEC,IAOnC,SAASC,EAAOrJ,EAAOsJ,GACrB,OAAO,IAAItG,OACTC,EAAOjD,GACP,KAAOmJ,EAASI,iBAAmB,IAAM,KAAOD,EAAS,IAAM,KAiBnE,MAAME,EACJ,cACE3J,KAAK4J,aAAe,GAEpB5J,KAAK6J,QAAU,GACf7J,KAAK8J,QAAU,EACf9J,KAAK+J,SAAW,EAIlB,QAAQ1G,EAAIgC,GACVA,EAAK0E,SAAW/J,KAAK+J,WAErB/J,KAAK4J,aAAa5J,KAAK8J,SAAWzE,EAClCrF,KAAK6J,QAAQ/H,KAAK,CAACuD,EAAMhC,IACzBrD,KAAK8J,SAAWlG,EAAiBP,GAAM,EAGzC,UAC8B,IAAxBrD,KAAK6J,QAAQjI,SAGf5B,KAAK8D,KAAO,IAAM,MAEpB,MAAMkG,EAAchK,KAAK6J,QAAQpG,IAAIf,GAAMA,EAAG,IAC9C1C,KAAKiK,UAAYT,EAAO7G,EAAKqH,IAAc,GAC3ChK,KAAKkK,UAAY,EAInB,KAAKC,GACHnK,KAAKiK,UAAUC,UAAYlK,KAAKkK,UAChC,MAAMjG,EAAQjE,KAAKiK,UAAUnG,KAAKqG,GAClC,IAAKlG,EAAS,OAAO,KAGrB,MAAMmG,EAAInG,EAAMoG,UAAU,CAAC3H,EAAI0H,IAAMA,EAAI,QAAYtK,IAAP4C,GAExC4H,EAAYtK,KAAK4J,aAAaQ,GAKpC,OAFAnG,EAAMsG,OAAO,EAAGH,GAETjL,OAAO+H,OAAOjD,EAAOqG,IAmChC,MAAME,EACJ,cAEExK,KAAKyK,MAAQ,GAEbzK,KAAK0K,aAAe,GACpB1K,KAAK2K,MAAQ,EAEb3K,KAAKkK,UAAY,EACjBlK,KAAK4K,WAAa,EAIpB,WAAW1G,GACT,GAAIlE,KAAK0K,aAAaxG,GAAQ,OAAOlE,KAAK0K,aAAaxG,GAEvD,MAAM2G,EAAU,IAAIlB,EAIpB,OAHA3J,KAAKyK,MAAMK,MAAM5G,GAAO5E,QAAQ,EAAE+D,EAAIgC,KAAUwF,EAAQE,QAAQ1H,EAAIgC,IACpEwF,EAAQG,UACRhL,KAAK0K,aAAaxG,GAAS2G,EACpBA,EAGT,6BACE,OAA2B,IAApB7K,KAAK4K,WAGd,cACE5K,KAAK4K,WAAa,EAIpB,QAAQvH,EAAIgC,GACVrF,KAAKyK,MAAM3I,KAAK,CAACuB,EAAIgC,IACH,UAAdA,EAAK9G,MAAkByB,KAAK2K,QAIlC,KAAKR,GACH,MAAMxE,EAAI3F,KAAKiL,WAAWjL,KAAK4K,YAC/BjF,EAAEuE,UAAYlK,KAAKkK,UACnB,IAAI1J,EAASmF,EAAE7B,KAAKqG,GAiCpB,GAAInK,KAAKkL,6BACP,GAAI1K,GAAUA,EAAO0D,QAAUlE,KAAKkK,eAAkB,CACpD,MAAMiB,EAAKnL,KAAKiL,WAAW,GAC3BE,EAAGjB,UAAYlK,KAAKkK,UAAY,EAChC1J,EAAS2K,EAAGrH,KAAKqG,GAYrB,OARI3J,IACFR,KAAK4K,YAAcpK,EAAOuJ,SAAW,EACjC/J,KAAK4K,aAAe5K,KAAK2K,OAE3B3K,KAAKoL,eAIF5K,GAWX,SAAS6K,EAAexL,GACtB,MAAMyL,EAAK,IAAId,EAWf,OATA3K,EAAKoG,SAAS3G,QAAQiM,GAAQD,EAAGP,QAAQQ,EAAK/F,MAAO,CAAEgG,KAAMD,EAAMhN,KAAM,WAErEsB,EAAK4L,eACPH,EAAGP,QAAQlL,EAAK4L,cAAe,CAAElN,KAAM,QAErCsB,EAAKmG,SACPsF,EAAGP,QAAQlL,EAAKmG,QAAS,CAAEzH,KAAM,YAG5B+M,EA0CT,SAASI,EAAY7L,EAAM8H,GACzB,MAAMgE,EAAkC,EACxC,GAAI9L,EAAK+L,WAAY,OAAOD,EAE5B,CAGExD,GACA7I,QAAQuM,GAAOA,EAAIhM,EAAM8H,IAE3B2B,EAASwC,mBAAmBxM,QAAQuM,GAAOA,EAAIhM,EAAM8H,IAGrD9H,EAAKgI,cAAgB,KAErB,CACEH,EAGAK,EAEAK,GACA9I,QAAQuM,GAAOA,EAAIhM,EAAM8H,IAE3B9H,EAAK+L,YAAa,EAElB,IAAIG,EAAiB,KAWrB,GAV6B,kBAAlBlM,EAAKiI,WACdiE,EAAiBlM,EAAKiI,SAASkE,gBACxBnM,EAAKiI,SAASkE,UAGnBnM,EAAKiI,WACPjI,EAAKiI,SAAWS,GAAgB1I,EAAKiI,SAAUwB,EAASI,mBAItD7J,EAAKoM,SAAWF,EAClB,MAAM,IAAI1O,MAAM,kGAgClB,OA3BA0O,EAAiBA,GAAkBlM,EAAKoM,SAAW,MACnDN,EAAMO,iBAAmB1C,EAAOuC,GAAgB,GAE5CpE,IACG9H,EAAK2F,QAAO3F,EAAK2F,MAAQ,SAC9BmG,EAAMQ,QAAU3C,EAAO3J,EAAK2F,OACxB3F,EAAKuM,iBAAgBvM,EAAK4F,IAAM5F,EAAK2F,OACpC3F,EAAK4F,KAAQ5F,EAAKwM,iBAAgBxM,EAAK4F,IAAM,SAC9C5F,EAAK4F,MAAKkG,EAAMW,MAAQ9C,EAAO3J,EAAK4F,MACxCkG,EAAMF,cAAgBrI,EAAOvD,EAAK4F,MAAQ,GACtC5F,EAAKwM,gBAAkB1E,EAAO8D,gBAChCE,EAAMF,gBAAkB5L,EAAK4F,IAAM,IAAM,IAAMkC,EAAO8D,gBAGtD5L,EAAKmG,UAAS2F,EAAMY,UAAY/C,EAAuC3J,EAAY,UAClFA,EAAKoG,WAAUpG,EAAKoG,SAAW,IAEpCpG,EAAKoG,SAAW,GAAG3C,UAAUzD,EAAKoG,SAASxC,KAAI,SAAS+I,GACtD,OAAOC,GAAwB,SAAND,EAAe3M,EAAO2M,OAEjD3M,EAAKoG,SAAS3G,SAAQ,SAASkN,GAAKd,EAA8B,EAAKC,MAEnE9L,EAAK6M,QACPhB,EAAY7L,EAAK6M,OAAQ/E,GAG3BgE,EAAMd,QAAUQ,EAAeM,GACxBA,EAMT,GAHKrC,EAASwC,qBAAoBxC,EAASwC,mBAAqB,IAG5DxC,EAASrD,UAAYqD,EAASrD,SAASmD,SAAS,QAClD,MAAM,IAAI/L,MAAM,6FAMlB,OAFAiM,EAASqD,iBAAmBtM,EAAQiJ,EAASqD,kBAAoB,IAE1DjB,EAA8B,GAcvC,SAASkB,GAAmB/M,GAC1B,QAAKA,IAEEA,EAAKwM,gBAAkBO,GAAmB/M,EAAK6M,SAaxD,SAASD,GAAkB5M,GAUzB,OATIA,EAAKgN,WAAahN,EAAKiN,iBACzBjN,EAAKiN,eAAiBjN,EAAKgN,SAASpJ,KAAI,SAASsJ,GAC/C,OAAO1M,EAAQR,EAAM,CAAEgN,SAAU,MAAQE,OAOzClN,EAAKiN,eACAjN,EAAKiN,eAOVF,GAAmB/M,GACdQ,EAAQR,EAAM,CAAE6M,OAAQ7M,EAAK6M,OAASrM,EAAQR,EAAK6M,QAAU,OAGlEvN,OAAOK,SAASK,GACXQ,EAAQR,GAIVA,EAGT,IAAImN,GAAU,SAId,SAASC,GAAyB9M,GAChC,OAAO+M,QAAQ/M,GAAmB,KAAVA,GAG1B,SAASgN,GAAeC,GACtB,MAAMC,EAAY,CAChBC,MAAO,CAAC,WAAY,OAAQ,cAC5BvN,KAAM,WACJ,MAAO,CACLwN,iBAAkB,GAClBC,iBAAiB,IAGrBC,SAAU,CACR,YACE,OAAIzN,KAAKwN,gBAAwB,GAE1B,QAAUxN,KAAKuN,kBAExB,cAEE,IAAKvN,KAAK0N,aAAeN,EAAKO,YAAY3N,KAAKsJ,UAG7C,OAFAsE,QAAQC,KAAK,iBAAiB7N,KAAKsJ,+CACnCtJ,KAAKwN,iBAAkB,EAChBtN,EAAWF,KAAK8N,MAGzB,IAAItN,EAAS,GAQb,OAPIR,KAAK0N,YACPlN,EAAS4M,EAAKW,cAAc/N,KAAK8N,MACjC9N,KAAKuN,iBAAmB/M,EAAO8I,WAE/B9I,EAAS4M,EAAKY,UAAUhO,KAAKsJ,SAAUtJ,KAAK8N,KAAM9N,KAAKiO,gBACvDjO,KAAKuN,iBAAmBvN,KAAKsJ,UAExB9I,EAAOL,OAEhB,aACE,OAAQH,KAAKsJ,UAAY2D,GAAyBjN,KAAKkO,aAEzD,iBACE,OAAO,IAKX,OAAOC,GACL,OAAOA,EAAc,MAAO,GAAI,CAC9BA,EAAc,OAAQ,CACpBC,MAAOpO,KAAKqB,UACZgN,SAAU,CAAEC,UAAWtO,KAAKuO,mBAO9BC,EAAY,CAChB,QAAQC,GACNA,EAAIC,UAAU,cAAerB,KAIjC,MAAO,CAAEA,YAAWmB,aAMtB,MAAMG,GAAkB,CACtB,yBAA0B,EAAGjM,KAAIlC,SAAQY,WACvC,MAAMwN,EAAiBC,GAAWnM,GAClC,IAAKkM,EAAehN,OAAQ,OAE5B,MAAMkN,EAAaC,SAASZ,cAAc,OAC1CW,EAAWR,UAAY9N,EAAOL,MAC9BK,EAAOL,MAAQ6O,GAAaJ,EAAgBC,GAAWC,GAAa1N,KAgBxE,SAAS6N,GAAIrO,GACX,OAAOA,EAAKsO,SAASpG,cAMvB,SAAS+F,GAAWjO,GAElB,MAAMJ,EAAS,GA0Bf,OAzBA,SAAU2O,EAAYvO,EAAM4D,GAC1B,IAAK,IAAIhC,EAAQ5B,EAAKwO,WAAY5M,EAAOA,EAAQA,EAAM6M,YAC9B,IAAnB7M,EAAM8M,SACR9K,GAAUhC,EAAM+M,UAAU3N,OACE,IAAnBY,EAAM8M,WACf9O,EAAOsB,KAAK,CACV0N,MAAO,QACPhL,OAAQA,EACR5D,KAAM4B,IAERgC,EAAS2K,EAAY3M,EAAOgC,GAIvByK,GAAIzM,GAAOyB,MAAM,oBACpBzD,EAAOsB,KAAK,CACV0N,MAAO,OACPhL,OAAQA,EACR5D,KAAM4B,KAKd,OAAOgC,EAvBT,CAwBG5D,EAAM,GACFJ,EAQT,SAASwO,GAAa1O,EAAUiO,EAAapO,GAC3C,IAAIsP,EAAY,EACZjP,EAAS,GACb,MAAMkP,EAAY,GAElB,SAASC,IACP,OAAKrP,EAASsB,QAAW2M,EAAY3M,OAGjCtB,EAAS,GAAGkE,SAAW+J,EAAY,GAAG/J,OAChClE,EAAS,GAAGkE,OAAS+J,EAAY,GAAG/J,OAAUlE,EAAWiO,EAkBnC,UAAzBA,EAAY,GAAGiB,MAAoBlP,EAAWiO,EArB5CjO,EAASsB,OAAStB,EAAWiO,EA2BxC,SAASqB,EAAKhP,GAEZ,SAASiP,EAAgBC,GACvB,MAAO,IAAMA,EAAKZ,SAAW,KAAOhP,EAAW4P,EAAK3P,OAAS,IAG/DK,GAAU,IAAMyO,GAAIrO,GAAQ,GAAG6C,IAAIsM,KAAKnP,EAAKoP,WAAYH,GAAiBlN,KAAK,IAAM,IAMvF,SAASsN,EAAMrP,GACbJ,GAAU,KAAOyO,GAAIrO,GAAQ,IAM/B,SAASsP,EAAOV,IACG,UAAhBA,EAAMA,MAAoBI,EAAOK,GAAOT,EAAM5O,MAGjD,MAAON,EAASsB,QAAU2M,EAAY3M,OAAQ,CAC5C,IAAIuO,EAASR,IAGb,GAFAnP,GAAUN,EAAWC,EAAMuE,UAAU+K,EAAWU,EAAO,GAAG3L,SAC1DiL,EAAYU,EAAO,GAAG3L,OAClB2L,IAAW7P,EAAU,CAOvBoP,EAAUU,UAAU9Q,QAAQ2Q,GAC5B,GACEC,EAAOC,EAAO5F,OAAO,EAAG,GAAG,IAC3B4F,EAASR,UACFQ,IAAW7P,GAAY6P,EAAOvO,QAAUuO,EAAO,GAAG3L,SAAWiL,GACtEC,EAAUU,UAAU9Q,QAAQsQ,OAEJ,UAApBO,EAAO,GAAGX,MACZE,EAAU5N,KAAKqO,EAAO,GAAGvP,MAEzB8O,EAAU3N,MAEZmO,EAAOC,EAAO5F,OAAO,EAAG,GAAG,IAG/B,OAAO/J,EAASN,EAAWC,EAAMkQ,OAAOZ,IAa1C,MAAMa,GAAmB,GAKnBC,GAASC,IACb5C,QAAQ2C,MAAMC,IAOV3C,GAAO,CAAC2C,KAAYjN,KACxBqK,QAAQ6C,IAAI,SAASD,KAAcjN,IAO/BmN,GAAa,CAAC1D,EAASwD,KACvBF,GAAiB,GAAGtD,KAAWwD,OAEnC5C,QAAQ6C,IAAI,oBAAoBzD,MAAYwD,KAC5CF,GAAiB,GAAGtD,KAAWwD,MAAa,IAQxCG,GAAWzQ,EACX0Q,GAAYvQ,EACZwQ,GAAWC,OAAO,WAMlBC,GAAO,SAAS3D,GAGpB,MAAM4D,EAAY7R,OAAO/B,OAAO,MAE1B6T,EAAU9R,OAAO/B,OAAO,MAExBmM,EAAU,GAIhB,IAAI2H,GAAY,EAChB,MAAMC,EAAc,yBACdC,EAAqB,sFAErBC,EAAqB,CAAEC,mBAAmB,EAAM7T,KAAM,aAAcwI,SAAU,IAKpF,IAAIjF,EAAU,CACZuQ,cAAe,qBACfC,iBAAkB,8BAClBtQ,YAAa,QACbuQ,WAAY,KACZC,OAAO,EACPV,UAAW,KAGXW,UAAW9O,GASb,SAAS+O,EAAmBC,GAC1B,OAAO7Q,EAAQuQ,cAAcO,KAAKD,GAMpC,SAASE,EAAcC,GACrB,IAAIC,EAAUD,EAAM3Q,UAAY,IAEhC4Q,GAAWD,EAAME,WAAaF,EAAME,WAAW7Q,UAAY,GAG3D,MAAM4C,EAAQjD,EAAQwQ,iBAAiB1N,KAAKmO,GAC5C,GAAIhO,EAAO,CACT,MAAMqF,EAAWqE,EAAY1J,EAAM,IAKnC,OAJKqF,IACHuE,GAAKuD,EAAmBhR,QAAQ,KAAM6D,EAAM,KAC5C4J,GAAK,oDAAqDmE,IAErD1I,EAAWrF,EAAM,GAAK,eAG/B,OAAOgO,EACJrK,MAAM,OACNuK,KAAMC,GAAWR,EAAmBQ,IAAWzE,EAAYyE,IAyBhE,SAASpE,EAAUqE,EAAoBC,EAAerE,EAAgBsE,GACpE,IAAIzE,EAAO,GACP+D,EAAe,GACU,kBAAlBS,GACTxE,EAAOuE,EACPpE,EAAiBqE,EAAcrE,eAC/B4D,EAAeS,EAAchJ,SAG7BiJ,OAAezS,IAGf4Q,GAAW,SAAU,uDACrBA,GAAW,SAAU,yGACrBmB,EAAeQ,EACfvE,EAAOwE,GAIT,MAAME,EAAU,CACd1E,OACAxE,SAAUuI,GAIZY,EAAK,mBAAoBD,GAIzB,MAAMhS,EAASgS,EAAQhS,OACnBgS,EAAQhS,OACRkS,EAAWF,EAAQlJ,SAAUkJ,EAAQ1E,KAAMG,EAAgBsE,GAM/D,OAJA/R,EAAOsN,KAAO0E,EAAQ1E,KAEtB2E,EAAK,kBAAmBjS,GAEjBA,EAYT,SAASkS,EAAWb,EAAcc,EAAiB1E,EAAgBsE,GAOjE,SAASK,EAAY/S,EAAMoE,GACzB,MAAM4O,EAAYvJ,EAASI,iBAAmBzF,EAAM,GAAG6E,cAAgB7E,EAAM,GAC7E,OAAO9E,OAAO2T,UAAUC,eAAehD,KAAKlQ,EAAKiI,SAAU+K,IAAchT,EAAKiI,SAAS+K,GAGzF,SAASG,IACP,IAAKnR,EAAIiG,SAEP,YADA/E,EAAQT,QAAQ2Q,GAIlB,IAAI/I,EAAY,EAChBrI,EAAIqK,iBAAiBhC,UAAY,EACjC,IAAIjG,EAAQpC,EAAIqK,iBAAiBpI,KAAKmP,GAClCC,EAAM,GAEV,MAAOjP,EAAO,CACZiP,GAAOD,EAAWvO,UAAUwF,EAAWjG,EAAMC,OAC7C,MAAMnE,EAAO6S,EAAY/Q,EAAKoC,GAC9B,GAAIlE,EAAM,CACR,MAAOc,EAAMsS,GAAoBpT,EAKjC,GAJAgD,EAAQT,QAAQ4Q,GAChBA,EAAM,GAENxN,GAAayN,EACTtS,EAAKkD,WAAW,KAGlBmP,GAAOjP,EAAM,OACR,CACL,MAAMmP,EAAW9J,EAASqD,iBAAiB9L,IAASA,EACpDkC,EAAQsQ,WAAWpP,EAAM,GAAImP,SAG/BF,GAAOjP,EAAM,GAEfiG,EAAYrI,EAAIqK,iBAAiBhC,UACjCjG,EAAQpC,EAAIqK,iBAAiBpI,KAAKmP,GAEpCC,GAAOD,EAAW5C,OAAOnG,GACzBnH,EAAQT,QAAQ4Q,GAGlB,SAASI,IACP,GAAmB,KAAfL,EAAmB,OAEvB,IAAIzS,EAAS,KAEb,GAA+B,kBAApBqB,EAAI0R,YAA0B,CACvC,IAAKvC,EAAUnP,EAAI0R,aAEjB,YADAxQ,EAAQT,QAAQ2Q,GAGlBzS,EAASkS,EAAW7Q,EAAI0R,YAAaN,GAAY,EAAMO,EAAc3R,EAAI0R,cACzEC,EAAc3R,EAAI0R,aAA4C/S,EAAU,SAExEA,EAASuN,EAAckF,EAAYpR,EAAI0R,YAAY3R,OAASC,EAAI0R,YAAc,MAO5E1R,EAAI6D,UAAY,IAClBA,GAAalF,EAAOkF,WAEtB3C,EAAQ0Q,eAAejT,EAAOuC,QAASvC,EAAO8I,UAGhD,SAASoK,IACgB,MAAnB7R,EAAI0R,YACND,IAEAN,IAEFC,EAAa,GAMf,SAASU,EAAa9T,GAKpB,OAJIA,EAAKwB,WACP0B,EAAQR,SAAS+G,EAASqD,iBAAiB9M,EAAKwB,YAAcxB,EAAKwB,WAErEQ,EAAM1C,OAAO/B,OAAOyC,EAAM,CAAE8H,OAAQ,CAAExH,MAAO0B,KACtCA,EAST,SAAS+R,EAAU/T,EAAMoE,EAAO4P,GAC9B,IAAIC,EAAU/P,EAAWlE,EAAKyM,MAAOuH,GAErC,GAAIC,EAAS,CACX,GAAIjU,EAAK,UAAW,CAClB,MAAM+F,EAAO,IAAIhG,EAASC,GAC1BA,EAAK,UAAUoE,EAAO2B,GAClBA,EAAK3F,iBAAgB6T,GAAU,GAGrC,GAAIA,EAAS,CACX,MAAOjU,EAAKkU,YAAclU,EAAK8H,OAC7B9H,EAAOA,EAAK8H,OAEd,OAAO9H,GAKX,GAAIA,EAAKwM,eACP,OAAOuH,EAAU/T,EAAK8H,OAAQ1D,EAAO4P,GASzC,SAASG,EAAShQ,GAChB,OAA+B,IAA3BnC,EAAIgJ,QAAQD,YAGdqI,GAAcjP,EAAO,GACd,IAIPiQ,GAA2B,EACpB,GAUX,SAASC,EAAajQ,GACpB,MAAMD,EAASC,EAAM,GACfkQ,EAAUlQ,EAAMuH,KAEhB5F,EAAO,IAAIhG,EAASuU,GAEpBC,EAAkB,CAACD,EAAQtM,cAAesM,EAAQ,aACxD,IAAK,MAAME,KAAMD,EACf,GAAKC,IACLA,EAAGpQ,EAAO2B,GACNA,EAAK3F,gBAAgB,OAAO+T,EAAShQ,GAuB3C,OApBImQ,GAAWA,EAAQ/H,iBACrB+H,EAAQ7H,MAAQpJ,EAAOc,IAGrBmQ,EAAQG,KACVrB,GAAcjP,GAEVmQ,EAAQI,eACVtB,GAAcjP,GAEhB0P,IACKS,EAAQK,aAAgBL,EAAQI,eACnCtB,EAAajP,IAGjB2P,EAAaQ,GAKNA,EAAQK,YAAc,EAAIxQ,EAAOpC,OAQ1C,SAAS6S,EAAWxQ,GAClB,MAAMD,EAASC,EAAM,GACf4P,EAAqBlB,EAAgBtC,OAAOpM,EAAMC,OAElDwQ,EAAUd,EAAU/R,EAAKoC,EAAO4P,GACtC,IAAKa,EAAW,OAAO7D,GAEvB,MAAM8D,EAAS9S,EACX8S,EAAOL,KACTrB,GAAcjP,GAER2Q,EAAOC,WAAaD,EAAOE,aAC/B5B,GAAcjP,GAEhB0P,IACIiB,EAAOE,aACT5B,EAAajP,IAGjB,GACMnC,EAAIR,WACN0B,EAAQf,YAELH,EAAIyS,MAASzS,EAAI0R,cACpB7N,GAAa7D,EAAI6D,WAEnB7D,EAAMA,EAAI8F,aACH9F,IAAQ6S,EAAQ/M,QAOzB,OANI+M,EAAQhI,SACNgI,EAAQtI,iBACVsI,EAAQhI,OAAOJ,MAAQoI,EAAQpI,OAEjCqH,EAAae,EAAQhI,SAEhBiI,EAAOC,UAAY,EAAI5Q,EAAOpC,OAGvC,SAASkT,IACP,MAAMC,EAAO,GACb,IAAK,IAAIC,EAAUnT,EAAKmT,IAAY1L,EAAU0L,EAAUA,EAAQrN,OAC1DqN,EAAQ3T,WACV0T,EAAKE,QAAQD,EAAQ3T,WAGzB0T,EAAKzV,QAAQ4V,GAAQnS,EAAQR,SAAS2S,IAIxC,IAAIC,EAAY,GAQhB,SAASC,EAAcC,EAAiBpR,GACtC,MAAMD,EAASC,GAASA,EAAM,GAK9B,GAFAgP,GAAcoC,EAEA,MAAVrR,EAEF,OADA0P,IACO,EAOT,GAAuB,UAAnByB,EAAU5W,MAAmC,QAAf0F,EAAM1F,MAAkB4W,EAAUjR,QAAUD,EAAMC,OAAoB,KAAXF,EAAe,CAG1G,GADAiP,GAAcN,EAAgB7H,MAAM7G,EAAMC,MAAOD,EAAMC,MAAQ,IAC1DgN,EAAW,CAEd,MAAMoE,EAAM,IAAIjY,MAAM,uBAGtB,MAFAiY,EAAIzD,aAAeA,EACnByD,EAAIC,QAAUJ,EAAU3J,KAClB8J,EAER,OAAO,EAIT,GAFAH,EAAYlR,EAEO,UAAfA,EAAM1F,KACR,OAAO2V,EAAajQ,GACf,GAAmB,YAAfA,EAAM1F,OAAuB0P,EAAgB,CAGtD,MAAMqH,EAAM,IAAIjY,MAAM,mBAAqB2G,EAAS,gBAAkBnC,EAAIR,WAAa,aAAe,KAEtG,MADAiU,EAAIzV,KAAOgC,EACLyT,EACD,GAAmB,QAAfrR,EAAM1F,KAAgB,CAC/B,MAAMkR,EAAYgF,EAAWxQ,GAC7B,GAAIwL,IAAcoB,GAChB,OAAOpB,EAOX,GAAmB,YAAfxL,EAAM1F,MAAiC,KAAXyF,EAE9B,OAAO,EAOT,GAAIwR,EAAa,KAAUA,EAA2B,EAAdvR,EAAMC,MAAW,CACvD,MAAMoR,EAAM,IAAIjY,MAAM,6DACtB,MAAMiY,EAgBR,OADArC,GAAcjP,EACPA,EAAOpC,OAGhB,MAAM0H,EAAWqE,EAAYkE,GAC7B,IAAKvI,EAEH,MADAiH,GAAMa,EAAmBhR,QAAQ,KAAMyR,IACjC,IAAIxU,MAAM,sBAAwBwU,EAAe,KAGzD,MAAM4D,EAAKpM,GAAgBC,EAAU,CAAEC,YACvC,IAAI/I,EAAS,GAETqB,EAAM0Q,GAAgBkD,EAE1B,MAAMjC,EAAgB,GAChBzQ,EAAU,IAAI/B,EAAQ2Q,UAAU3Q,GACtC8T,IACA,IAAI7B,EAAa,GACbvN,EAAY,EACZxB,EAAQ,EACRsR,EAAa,EACbvB,GAA2B,EAE/B,IAGE,IAFApS,EAAIgJ,QAAQO,gBAEH,CACPoK,IACIvB,EAGFA,GAA2B,EAE3BpS,EAAIgJ,QAAQO,cAEdvJ,EAAIgJ,QAAQX,UAAYhG,EAExB,MAAMD,EAAQpC,EAAIgJ,QAAQ/G,KAAK6O,GAG/B,IAAK1O,EAAO,MAEZ,MAAMyR,EAAc/C,EAAgBjO,UAAUR,EAAOD,EAAMC,OACrDyR,EAAiBP,EAAcM,EAAazR,GAClDC,EAAQD,EAAMC,MAAQyR,EAOxB,OALAP,EAAczC,EAAgBtC,OAAOnM,IACrCnB,EAAQ6S,gBACR7S,EAAQ8S,WACRrV,EAASuC,EAAQ+S,SAEV,CAGLpQ,UAAWqQ,KAAKC,MAAMtQ,GACtBvF,MAAOK,EACP8I,SAAUuI,EACV7L,SAAS,EACTjD,QAASA,EACTlB,IAAKA,GAEP,MAAOyT,GACP,GAAIA,EAAI9E,SAAW8E,EAAI9E,QAAQpH,SAAS,WACtC,MAAO,CACLpD,SAAS,EACTiQ,UAAW,CACTC,IAAKZ,EAAI9E,QACTgC,QAASG,EAAgB7H,MAAM5G,EAAQ,IAAKA,EAAQ,KACpDrE,KAAMyV,EAAIzV,MAEZsW,MAAO3V,EACPkF,UAAW,EACXvF,MAAOwQ,GAASgC,GAChB5P,QAASA,GAEN,GAAImO,EACT,MAAO,CACLlL,SAAS,EACTN,UAAW,EACXvF,MAAOwQ,GAASgC,GAChB5P,QAASA,EACTuG,SAAUuI,EACVhQ,IAAKA,EACLuU,YAAad,GAGf,MAAMA,GAYZ,SAASe,EAAwBvI,GAC/B,MAAMtN,EAAS,CACbkF,UAAW,EACX3C,QAAS,IAAI/B,EAAQ2Q,UAAU3Q,GAC/Bb,MAAOwQ,GAAS7C,GAChB9H,SAAS,EACTnE,IAAKwP,GAGP,OADA7Q,EAAOuC,QAAQT,QAAQwL,GAChBtN,EAiBT,SAASuN,EAAcD,EAAMwI,GAC3BA,EAAiBA,GAAkBtV,EAAQgQ,WAAa7R,OAAOyJ,KAAKoI,GACpE,MAAMuF,EAAYF,EAAwBvI,GAEpC0I,EAAUF,EAAeG,OAAO9I,GAAa8I,OAAOC,GAAejT,IAAIhG,GAC3EiV,EAAWjV,EAAMqQ,GAAM,IAEzB0I,EAAQvB,QAAQsB,GAEhB,MAAMI,EAASH,EAAQI,KAAK,CAACC,EAAGC,KAE9B,GAAID,EAAEnR,YAAcoR,EAAEpR,UAAW,OAAOoR,EAAEpR,UAAYmR,EAAEnR,UAIxD,GAAImR,EAAEvN,UAAYwN,EAAExN,SAAU,CAC5B,GAAIqE,EAAYkJ,EAAEvN,UAAUyN,aAAeD,EAAExN,SAC3C,OAAO,EACF,GAAIqE,EAAYmJ,EAAExN,UAAUyN,aAAeF,EAAEvN,SAClD,OAAQ,EAQZ,OAAO,KAGF0N,EAAMC,GAAcN,EAGrBnW,EAASwW,EAGf,OAFAxW,EAAO0W,YAAcD,EAEdzW,EAYT,SAAS2W,EAAUC,GACjB,OAAMpW,EAAQyQ,YAAczQ,EAAQ0Q,MAI7B0F,EAAKhX,QAAQ+Q,EAAalN,GACjB,OAAVA,EACKjD,EAAQ0Q,MAAQ,OAASzN,EACvBjD,EAAQyQ,WACVxN,EAAM7D,QAAQ,MAAOY,EAAQyQ,YAE/BxN,GATAmT,EAoBX,SAASC,EAAgBC,EAASC,EAAaC,GAC7C,MAAMlO,EAAWiO,EAActG,EAAQsG,GAAeC,EAEtDF,EAAQG,UAAUvY,IAAI,QAClBoK,GAAUgO,EAAQG,UAAUvY,IAAIoK,GAItC,MAAMoO,EAAW,CACf,0BAA2B,EAAGhV,SACxB1B,EAAQ0Q,QACVhP,EAAG4L,UAAY5L,EAAG4L,UAAUlO,QAAQ,MAAO,IAAIA,QAAQ,aAAc,QAGzE,yBAA0B,EAAGI,aACvBQ,EAAQ0Q,QACVlR,EAAOL,MAAQK,EAAOL,MAAMC,QAAQ,MAAO,WAK3CuX,EAAiB,mBAEjBC,EAAmB,CACvB,yBAA0B,EAAGpX,aACvBQ,EAAQyQ,aACVjR,EAAOL,MAAQK,EAAOL,MAAMC,QAAQuX,EAAiBhS,GACnDA,EAAEvF,QAAQ,MAAOY,EAAQyQ,gBAYjC,SAASoG,EAAiBP,GAExB,IAAI1W,EAAO,KACX,MAAM0I,EAAWyI,EAAcuF,GAE/B,GAAI1F,EAAmBtI,GAAW,OAGlCmJ,EAAK,0BACH,CAAE/P,GAAI4U,EAAShO,SAAUA,IAE3B1I,EAAO0W,EACP,MAAMlW,EAAOR,EAAKkX,YACZtX,EAAS8I,EAAW0E,EAAU5M,EAAM,CAAEkI,WAAU2E,gBAAgB,IAAUF,EAAc3M,GAG9FqR,EAAK,yBAA0B,CAAE/P,GAAI4U,EAAS9W,SAAQY,SAEtDkW,EAAQhJ,UAAY9N,EAAOL,MAC3BkX,EAAgBC,EAAShO,EAAU9I,EAAO8I,UAC1CgO,EAAQ9W,OAAS,CACf8I,SAAU9I,EAAO8I,SAEjBjG,GAAI7C,EAAOkF,UACXqS,UAAWvX,EAAOkF,WAEhBlF,EAAO0W,cACTI,EAAQJ,YAAc,CACpB5N,SAAU9I,EAAO0W,YAAY5N,SAE7BjG,GAAI7C,EAAO0W,YAAYxR,UACvBqS,UAAWvX,EAAO0W,YAAYxR,YAUpC,SAASsS,EAAUC,GACbA,EAAYvG,QACdhB,GAAW,SAAU,6CACrBA,GAAW,SAAU,uEAEvB1P,EAAU4P,GAAU5P,EAASiX,GAS/B,MAAMC,EAAmB,KACvB,GAAIA,EAAiBC,OAAQ,OAC7BD,EAAiBC,QAAS,EAE1BzH,GAAW,SAAU,kEAErB,MAAM0H,EAASrJ,SAASsJ,iBAAiB,YACzCD,EAAO9Y,QAAQuY,IAKjB,SAASS,IACP5H,GAAW,SAAU,wEACrB6H,GAAiB,EAGnB,IAAIA,GAAiB,EAKrB,SAASC,IAEP,GAA4B,YAAxBzJ,SAAS0J,WAEX,YADAF,GAAiB,GAInB,MAAMH,EAASrJ,SAASsJ,iBAAiB,YACzCD,EAAO9Y,QAAQuY,GAGjB,SAASa,IAEHH,GAAgBC,IActB,SAASG,EAAiB9G,EAAc+G,GACtC,IAAIC,EAAO,KACX,IACEA,EAAOD,EAAmBxL,GAC1B,MAAO0L,GAGP,GAFAvI,GAAM,wDAAwDnQ,QAAQ,KAAMyR,KAEvEX,EAAa,MAAM4H,EAAkBvI,GAAMuI,GAKhDD,EAAOxH,EAGJwH,EAAKpb,OAAMob,EAAKpb,KAAOoU,GAC5Bb,EAAUa,GAAgBgH,EAC1BA,EAAKE,cAAgBH,EAAmBI,KAAK,KAAM5L,GAE/CyL,EAAK5H,SACPgI,EAAgBJ,EAAK5H,QAAS,CAAEY,iBASpC,SAASqH,EAAmBrH,UACnBb,EAAUa,GACjB,IAAK,MAAMsH,KAASha,OAAOyJ,KAAKqI,GAC1BA,EAAQkI,KAAWtH,UACdZ,EAAQkI,GAQrB,SAASC,IACP,OAAOja,OAAOyJ,KAAKoI,GAYrB,SAASqI,EAAgB5b,GACvBiT,GAAW,SAAU,oDACrBA,GAAW,SAAU,oEAErB,MAAMmI,EAAOlL,EAAYlQ,GACzB,GAAIob,EAAQ,OAAOA,EAEnB,MAAMvD,EAAM,IAAIjY,MAAM,iDAAmD+C,QAAQ,KAAM3C,IACvF,MAAM6X,EAOR,SAAS3H,EAAYlQ,GAEnB,OADAA,GAAQA,GAAQ,IAAIqL,cACbkI,EAAUvT,IAASuT,EAAUC,EAAQxT,IAQ9C,SAASwb,EAAgBK,GAAW,aAAEzH,IACX,kBAAdyH,IACTA,EAAY,CAACA,IAEfA,EAAUha,QAAQ6Z,IAAWlI,EAAQkI,EAAMrQ,eAAiB+I,IAO9D,SAAS6E,EAAcjZ,GACrB,MAAMob,EAAOlL,EAAYlQ,GACzB,OAAOob,IAASA,EAAKvH,kBAQvB,SAASiI,EAAiBC,GAEpBA,EAAO,2BAA6BA,EAAO,6BAC7CA,EAAO,2BAA8BzZ,IACnCyZ,EAAO,yBACLra,OAAO+H,OAAO,CAAE8K,MAAOjS,EAAK2C,IAAM3C,MAIpCyZ,EAAO,0BAA4BA,EAAO,4BAC5CA,EAAO,0BAA6BzZ,IAClCyZ,EAAO,wBACLra,OAAO+H,OAAO,CAAE8K,MAAOjS,EAAK2C,IAAM3C,MAS1C,SAAS0Z,EAAUD,GACjBD,EAAiBC,GACjBjQ,EAAQzH,KAAK0X,GAQf,SAAS/G,EAAKjD,EAAOjM,GACnB,MAAM8Q,EAAK7E,EACXjG,EAAQjK,SAAQ,SAASka,GACnBA,EAAOnF,IACTmF,EAAOnF,GAAI9Q,MAWjB,SAASmW,EAAmBC,GAI1B,OAHAjJ,GAAW,SAAU,+CACrBA,GAAW,SAAU,sEAEdyG,EAAUwC,GAOnB,SAASC,EAAwBlX,GAI/B,OAHAgO,GAAW,SAAU,oDACrBA,GAAW,SAAU,oCAEdmH,EAAiBnV,GA3KJ,qBAAXmX,QAA0BA,OAAOC,kBAC1CD,OAAOC,iBAAiB,mBAAoBpB,GAAM,GA8KpDvZ,OAAO+H,OAAOkG,EAAM,CAClBY,YACAD,gBACAyK,eACArB,UAAWuC,EACX7B,mBAEAkC,eAAgBH,EAChB5B,YACAE,mBACAI,yBACAK,mBACAO,qBACAE,gBACAzL,cACAsL,kBACAI,kBACA3C,gBACArW,QAASuQ,GACT6I,YAEAO,UAAW7M,GAAeC,GAAMoB,YAGlCpB,EAAK6M,UAAY,WAAa/I,GAAY,GAC1C9D,EAAK8M,SAAW,WAAahJ,GAAY,GACzC9D,EAAK+M,cAAgBnN,GAErB,IAAK,MAAMvM,KAAO2G,EAEU,kBAAfA,EAAM3G,IAEfhB,EAAc2H,EAAM3G,IAWxB,OANAtB,OAAO+H,OAAOkG,EAAMhG,GAGpBgG,EAAKqM,UAAU/B,GACftK,EAAKqM,UAAU9K,IACfvB,EAAKqM,UAAU7B,GACRxK,GAIT,IAAIY,GAAY+C,GAAK,IAErBlT,EAAOC,QAAUkQ,I,oCCl9EjB7O,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIka,EAAoB,EAAQ,QAC5BC,EAAmB,EAAQ,QAC3BC,EAAkB,EAAQ,QAC1BC,EAAmB,EAAQ,QAI3BC,EAAa,SAAUC,GACzB,SAASD,EAAUE,GACjBD,EAAa3K,KAAK/P,KAAM2a,EAAMA,GAoEhC,OAjEKD,IAAeD,EAAUpT,UAAYqT,GAC1CD,EAAU3H,UAAY3T,OAAO/B,OAAQsd,GAAgBA,EAAa5H,WAClE2H,EAAU3H,UAAU1Q,YAAcqY,EAElCA,EAAU3H,UAAUrP,IAAM,SAAcmX,EAAKC,GAC3C,IAAIF,EAAOC,EAAIE,QAAQD,EAAQpX,IAAIzD,KAAK+a,OACxC,OAAON,EAAUO,MAAML,GAAQ,IAAIF,EAAUE,GAAQD,EAAaO,KAAKN,IAGzEF,EAAU3H,UAAUoI,QAAU,WAAsB,OAAOV,EAAiBW,MAAMC,OAElFX,EAAU3H,UAAUuI,GAAK,SAAaC,GACpC,OAAOA,aAAiBb,GAAaa,EAAMP,MAAQ/a,KAAK+a,MAG1DN,EAAU3H,UAAUyI,OAAS,WAC3B,MAAO,CAAChd,KAAM,YAAaid,IAAKxb,KAAK+a,OAGvCN,EAAUgB,SAAW,SAAmBb,EAAKc,GAC3C,GAAuB,iBAAZA,EAAKF,IAAmB,MAAM,IAAItd,WAAW,wCACxD,OAAO,IAAIuc,EAAUG,EAAIE,QAAQY,EAAKF,OAGxCf,EAAU3H,UAAU6I,YAAc,WAA0B,OAAO,IAAIC,EAAY5b,KAAK6b,SAExFpB,EAAUO,MAAQ,SAAgBL,GAChC,IAAIhT,EAASgT,EAAKhT,OAClB,GAAIA,EAAOmU,cAAgBC,EAAapB,KAAUqB,EAAYrB,GAAS,OAAO,EAC9E,IAAIsB,EAAWtU,EAAOpJ,KAAK2d,KAAKC,eAChC,GAAgB,MAAZF,EAAoB,OAAOA,EAC/B,IAAIG,EAAQzU,EAAO0U,eAAe1B,EAAKzW,SAASoY,YAChD,OAAOF,GAASA,EAAMN,aAGxBrB,EAAU8B,SAAW,SAAmB5B,EAAM6B,EAAKC,GACjD,IAAKA,GAAYhC,EAAUO,MAAML,GAAS,OAAOA,EAIjD,IAFA,IAAIa,EAAMb,EAAKa,IAAKkB,EAAO,KAElBC,EAAIhC,EAAKiC,OAAQD,IAAK,CAC7B,IAAIhV,EAASgT,EAAK/Z,KAAK+b,GACvB,GAAIH,EAAM,EAAI7B,EAAKkC,WAAWF,GAAKhV,EAAOmV,WAAanC,EAAKzW,MAAMyY,GAAK,EAAG,CACxED,EAAO/U,EAAOoV,WAAWP,EAAM,EAAI7B,EAAKkC,WAAWF,GAAKhC,EAAKzW,MAAMyY,GAAK,GACxE,MACK,GAAS,GAALA,EACT,OAAO,KAETnB,GAAOgB,EACP,IAAIQ,EAAOrC,EAAKC,IAAIE,QAAQU,GAC5B,GAAIf,EAAUO,MAAMgC,GAAS,OAAOA,EAItC,OAAS,CAEP,GADAN,EAAOF,EAAM,EAAIE,EAAKtN,WAAasN,EAAKO,WACnCP,EAAQ,MACblB,GAAOgB,EACP,IAAIU,EAASvC,EAAKC,IAAIE,QAAQU,GAC9B,GAAIf,EAAUO,MAAMkC,GAAW,OAAOA,EAGxC,OAAO,MAGFzC,EAtEO,CAuEdH,EAAiB6C,WAEnB1C,EAAU3H,UAAUsK,SAAU,EAE9B9C,EAAiB6C,UAAUE,OAAO,YAAa5C,GAE/C,IAAImB,EAAc,SAAqBJ,GACrCxb,KAAKwb,IAAMA,GAUb,SAASO,EAAapB,GACpB,IAAK,IAAIgC,EAAIhC,EAAKiC,MAAOD,GAAK,EAAGA,IAAK,CACpC,IAAIzY,EAAQyW,EAAKzW,MAAMyY,GAEvB,GAAa,GAATzY,EAEJ,IAAK,IAAIsD,EAASmT,EAAK/Z,KAAK+b,GAAGna,MAAM0B,EAAQ,IAAKsD,EAASA,EAAOyV,UAAW,CAC3E,GAA0B,GAArBzV,EAAOsV,aAAoBtV,EAAO8V,eAAkB9V,EAAO+V,QAAU/V,EAAOjJ,KAAK2d,KAAKsB,UAAa,OAAO,EAC/G,GAAIhW,EAAO8V,cAAiB,OAAO,GAIvC,OAAO,EAGT,SAAStB,EAAYrB,GACnB,IAAK,IAAIgC,EAAIhC,EAAKiC,MAAOD,GAAK,EAAGA,IAAK,CACpC,IAAIzY,EAAQyW,EAAKkC,WAAWF,GAAIhV,EAASgT,EAAK/Z,KAAK+b,GACnD,GAAIzY,GAASyD,EAAOmV,WACpB,IAAK,IAAIW,EAAQ9V,EAAOnF,MAAM0B,IAASuZ,EAAQA,EAAMrO,WAAY,CAC/D,GAAyB,GAApBqO,EAAMX,aAAoBW,EAAMH,eAAkBG,EAAMF,QAAUE,EAAMlf,KAAK2d,KAAKsB,UAAa,OAAO,EAC3G,GAAIC,EAAMH,cAAiB,OAAO,GAGtC,OAAO,EAhCT1B,EAAY9I,UAAUrP,IAAM,SAAcoX,GACxC,OAAO,IAAIe,EAAYf,EAAQpX,IAAIzD,KAAKwb,OAE1CI,EAAY9I,UAAUgI,QAAU,SAAkBF,GAChD,IAAID,EAAOC,EAAIE,QAAQ9a,KAAKwb,KAC5B,OAAOf,EAAUO,MAAML,GAAQ,IAAIF,EAAUE,GAAQL,EAAiB6C,UAAUlC,KAAKN,IAsCvF,IAAI+C,EAAY,WACd,OAAO,IAAIpD,EAAiBqD,OAAO,CACjCrQ,MAAO,CACLsQ,YAAaC,EAEbC,uBAAwB,SAAgCC,EAAOC,EAASC,GACtE,GAAID,EAAQxC,KAAOyC,EAAMzC,KAAOf,EAAUO,MAAMiD,GAAU,OAAO,IAAIxD,EAAUwD,IAGjFC,YAAaA,EACbC,cAAeA,MAKjBA,EAAgB9D,EAAkB+D,eAAe,CACnD,UAAaC,EAAM,SAAU,GAC7B,WAAcA,EAAM,QAAS,GAC7B,QAAWA,EAAM,QAAS,GAC1B,UAAaA,EAAM,OAAQ,KAG7B,SAASA,EAAMC,EAAM9B,GACnB,IAAI+B,EAAiB,QAARD,EAAkB9B,EAAM,EAAI,OAAS,KAASA,EAAM,EAAI,QAAU,OAC/E,OAAO,SAASgC,EAAOC,EAAUC,GAC/B,IAAIC,EAAMH,EAAMI,UACZC,EAASrC,EAAM,EAAImC,EAAIG,IAAMH,EAAII,MAAOtC,EAAWkC,EAAIvD,MAC3D,GAAIuD,aAAerE,EAAiB0E,cAAe,CACjD,IAAKN,EAAKO,eAAeV,GAAW,OAAO,EAC3C9B,GAAW,EACXoC,EAASL,EAAM5D,IAAIE,QAAQ0B,EAAM,EAAIqC,EAAOpB,QAAUoB,EAAOrX,UAE/D,IAAI0X,EAASzE,EAAU8B,SAASsC,EAAQrC,EAAKC,GAC7C,QAAKyC,IACDT,GAAYA,EAASD,EAAMW,GAAGC,aAAa,IAAI3E,EAAUyE,MACtD,IAIX,SAAShB,EAAYQ,EAAMlD,EAAKhM,GAC9B,GAAIkP,EAAKW,SAAS,YAAY,SAAUC,GAAY,OAAgC,IAAzBA,EAASZ,EAAKF,UAAwB,OAAO,EACxG,IAAI7D,EAAO+D,EAAKF,MAAM5D,IAAIE,QAAQU,GAClC,IAAKf,EAAUO,MAAML,GAAS,OAAO,EACrC,IAAI4E,EAAMb,EAAKc,YAAY,CAACC,KAAMjQ,EAAMkQ,QAAS7d,IAAK2N,EAAMmQ,UACxDC,EAASL,EAAIK,OACjB,QAAIA,GAAU,GAAKtF,EAAiBuF,cAAcC,aAAapB,EAAKF,MAAM5D,IAAImF,OAAOH,OACrFlB,EAAKD,SAASC,EAAKF,MAAMW,GAAGC,aAAa,IAAI3E,EAAUE,MAChD,GAGT,SAASkD,EAAcW,GACrB,KAAMA,EAAMI,qBAAqBnE,GAAc,OAAO,KACtD,IAAI7Z,EAAOmO,SAASZ,cAAc,OAElC,OADAvN,EAAKS,UAAY,wBACVkZ,EAAgByF,cAAc5iB,OAAOohB,EAAM5D,IAAK,CAACL,EAAgB0F,WAAWC,OAAO1B,EAAMI,UAAU7D,KAAMna,EAAM,CAACH,IAAK,gBAG9H3C,EAAQ4f,UAAYA,EACpB5f,EAAQ2c,UAAYA,G,oCC9LpBtb,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIma,EAAmB,EAAQ,QAC3B6F,EAAuB,EAAQ,QAiBnC,SAASC,EAAWpf,GAGlB,YAFiB,IAAZA,IAAqBA,EAAU,IAE7B,IAAIsZ,EAAiBqD,OAAO,CACjCe,KAAM,SAAc2B,GAAc,OAAO,IAAIC,EAAeD,EAAYrf,MAI5E,IAAIsf,EAAiB,SAAwBD,EAAYrf,GACvD,IAAIuf,EAASvgB,KAEbA,KAAKqgB,WAAaA,EAClBrgB,KAAKwgB,MAAQxf,EAAQwf,OAAS,EAC9BxgB,KAAKygB,MAAQzf,EAAQyf,OAAS,QAC9BzgB,KAAKoO,MAAQpN,EAAQoN,MACrBpO,KAAK0gB,UAAY,KACjB1gB,KAAKsX,QAAU,KACftX,KAAK2gB,QAAU,KAEf3gB,KAAK4gB,SAAW,CAAC,WAAY,UAAW,OAAQ,aAAand,KAAI,SAAUhG,GACzE,IAAIojB,EAAU,SAAUC,GAAK,OAAOP,EAAO9iB,GAAMqjB,IAEjD,OADAT,EAAWU,IAAIjH,iBAAiBrc,EAAMojB,GAC/B,CAACpjB,KAAMA,EAAMojB,QAASA,OAIjCP,EAAexN,UAAUkO,QAAU,WAC/B,IAAIT,EAASvgB,KAEfA,KAAK4gB,SAASthB,SAAQ,SAAUigB,GAC5B,IAAI9hB,EAAO8hB,EAAI9hB,KACXojB,EAAUtB,EAAIsB,QAElB,OAAON,EAAOF,WAAWU,IAAIE,oBAAoBxjB,EAAMojB,OAI7DP,EAAexN,UAAUoO,OAAS,SAAiBb,EAAYc,GACvC,MAAlBnhB,KAAK0gB,WAAqBS,EAAUvG,KAAOyF,EAAW7B,MAAM5D,KAAO5a,KAAKohB,iBAG9Ed,EAAexN,UAAUuO,UAAY,SAAoB7F,GACnDA,GAAOxb,KAAK0gB,YAChB1gB,KAAK0gB,UAAYlF,EACN,MAAPA,GACFxb,KAAKsX,QAAQpF,WAAWoP,YAAYthB,KAAKsX,SACzCtX,KAAKsX,QAAU,MAEftX,KAAKohB,kBAITd,EAAexN,UAAUsO,cAAgB,WACvC,IAA8DG,EAA1D5G,EAAO3a,KAAKqgB,WAAW7B,MAAM5D,IAAIE,QAAQ9a,KAAK0gB,WAClD,IAAK/F,EAAKhT,OAAO2V,cAAe,CAC9B,IAAI9V,EAASmT,EAAK6G,WAAY/D,EAAQ9C,EAAK8G,UAC3C,GAAIja,GAAUiW,EAAO,CACnB,IAAIiE,EAAW1hB,KAAKqgB,WAAWsB,QAAQ3hB,KAAK0gB,WAAalZ,EAAQA,EAAOoa,SAAW,IAAIC,wBACnFhgB,EAAM2F,EAASka,EAASI,OAASJ,EAAS7f,IAC1C2F,GAAUiW,IACV5b,GAAOA,EAAM7B,KAAKqgB,WAAWsB,QAAQ3hB,KAAK0gB,WAAWmB,wBAAwBhgB,KAAO,GACxF0f,EAAO,CAAC9B,KAAMiC,EAASjC,KAAMsC,MAAOL,EAASK,MAAOlgB,IAAKA,EAAM7B,KAAKwgB,MAAQ,EAAGsB,OAAQjgB,EAAM7B,KAAKwgB,MAAQ,IAG9G,IAAKe,EAAM,CACT,IAAIS,EAAShiB,KAAKqgB,WAAW4B,YAAYjiB,KAAK0gB,WAC9Ca,EAAO,CAAC9B,KAAMuC,EAAOvC,KAAOzf,KAAKwgB,MAAQ,EAAGuB,MAAOC,EAAOvC,KAAOzf,KAAKwgB,MAAQ,EAAG3e,IAAKmgB,EAAOngB,IAAKigB,OAAQE,EAAOF,QAGnH,IAAIna,EAAS3H,KAAKqgB,WAAWU,IAAImB,aAC5BliB,KAAKsX,UACRtX,KAAKsX,QAAU3P,EAAOwa,YAAYpT,SAASZ,cAAc,QACrDnO,KAAKoO,QAASpO,KAAKsX,QAAQjW,UAAYrB,KAAKoO,OAChDpO,KAAKsX,QAAQ8K,MAAMC,QAAU,4EAA8EriB,KAAKygB,OAElH,IAAI6B,GAAc3a,GAAUA,GAAUoH,SAASwT,MAA6C,UAArCC,iBAAiB7a,GAAQoC,SAC1E,CAAC0V,MAAOgD,YAAa5gB,KAAM6gB,aAAe/a,EAAOka,wBACvD7hB,KAAKsX,QAAQ8K,MAAM3C,KAAQ8B,EAAK9B,KAAO6C,EAAW7C,KAAQ,KAC1Dzf,KAAKsX,QAAQ8K,MAAMvgB,IAAO0f,EAAK1f,IAAMygB,EAAWzgB,IAAO,KACvD7B,KAAKsX,QAAQ8K,MAAM5B,MAASe,EAAKQ,MAAQR,EAAK9B,KAAQ,KACtDzf,KAAKsX,QAAQ8K,MAAMO,OAAUpB,EAAKO,OAASP,EAAK1f,IAAO,MAGzDye,EAAexN,UAAU8P,gBAAkB,SAA0BjC,GACjE,IAAIJ,EAASvgB,KAEf6iB,aAAa7iB,KAAK2gB,SAClB3gB,KAAK2gB,QAAUmC,YAAW,WAAc,OAAOvC,EAAOc,UAAU,QAAUV,IAG5EL,EAAexN,UAAUiQ,SAAW,SAAmBvT,GACrD,GAAKxP,KAAKqgB,WAAWf,SAArB,CACA,IAAI9D,EAAMxb,KAAKqgB,WAAWb,YAAY,CAACC,KAAMjQ,EAAMkQ,QAAS7d,IAAK2N,EAAMmQ,UACvE,GAAInE,EAAK,CACP,IAAIwH,EAASxH,EAAIA,IACbxb,KAAKqgB,WAAW4C,UAAYjjB,KAAKqgB,WAAW4C,SAASnY,QACvDkY,EAAS7C,EAAqB+C,UAAUljB,KAAKqgB,WAAW7B,MAAM5D,IAAKoI,EAAQhjB,KAAKqgB,WAAW4C,SAASnY,OACtF,MAAVkY,IAAkBA,EAASxH,EAAIA,MAErCxb,KAAKqhB,UAAU2B,GACfhjB,KAAK4iB,gBAAgB,QAIzBtC,EAAexN,UAAUqQ,QAAU,WACjCnjB,KAAK4iB,gBAAgB,KAGvBtC,EAAexN,UAAUsQ,KAAO,WAC9BpjB,KAAK4iB,gBAAgB,KAGvBtC,EAAexN,UAAUuQ,UAAY,SAAoB7T,GACnDA,EAAMwT,QAAUhjB,KAAKqgB,WAAWU,KAAQ/gB,KAAKqgB,WAAWU,IAAI9a,SAASuJ,EAAM8T,gBAC3EtjB,KAAKqhB,UAAU,OAGrBvjB,EAAQsiB,WAAaA,G,oCCvIrB,SAASmD,EAAiBC,GAAM,OAAQA,GAAqB,kBAAPA,GAAoB,YAAaA,EAAMA,EAAG,WAAaA,EAF7GrkB,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAItD,IAAIsjB,EAAeF,EAAgB,EAAQ,SACvCpD,EAAuB,EAAQ,QAC/B7F,EAAmB,EAAQ,QAmB3BoJ,EAAkB,IAElBC,EAAS,SAAgBC,EAAOC,GAClC7jB,KAAK4jB,MAAQA,EACb5jB,KAAK6jB,WAAaA,GA8LpB,SAASC,EAAaF,EAAOG,GAC3B,IAAIC,EAOJ,OANAJ,EAAMtkB,SAAQ,SAAU4V,EAAM9K,GAC5B,GAAI8K,EAAK0J,WAAqB,GAAPmF,IAErB,OADAC,EAAW5Z,GACJ,KAGJwZ,EAAM9Y,MAAMkZ,GAhMrBL,EAAO7Q,UAAUmR,SAAW,SAAmBzF,EAAO0F,GAClD,IAAI3D,EAASvgB,KAEf,GAAuB,GAAnBA,KAAK6jB,WAAmB,OAAO,KAGnC,IADA,IAMIM,EAAOC,EANP3e,EAAMzF,KAAK4jB,MAAMhiB,QACb6D,IAAO,CACb,IAAIiX,EAAO6D,EAAOqD,MAAMS,IAAI5e,EAAM,GAClC,GAAIiX,EAAKkC,UAAW,GAAInZ,EAAK,OAI3Bye,IACFC,EAAQnkB,KAAKskB,UAAU7e,EAAKzF,KAAK4jB,MAAMhiB,QACvCwiB,EAAUD,EAAMI,KAAK3iB,QAEvB,IACIgd,EAAW4F,EADXC,EAAYjG,EAAMW,GAElBuF,EAAW,GAAIC,EAAY,GAkC/B,OAhCA3kB,KAAK4jB,MAAMtkB,SAAQ,SAAU4V,EAAM9K,GACjC,IAAK8K,EAAK0P,KAOR,OANKT,IACHA,EAAQ5D,EAAO+D,UAAU7e,EAAK2E,EAAI,GAClCga,EAAUD,EAAMI,KAAK3iB,QAEvBwiB,SACAO,EAAU7iB,KAAKoT,GAIjB,GAAIiP,EAAO,CACTQ,EAAU7iB,KAAK,IAAI+iB,EAAK3P,EAAKzR,MAC7B,IAAgDA,EAA5CmhB,EAAO1P,EAAK0P,KAAKnhB,IAAI0gB,EAAMrZ,MAAMsZ,IAEjCQ,GAAQH,EAAUK,UAAUF,GAAMhK,MACpCnX,EAAMghB,EAAU5J,QAAQ0J,KAAKE,EAAU5J,QAAQ0J,KAAK3iB,OAAS,GAC7D8iB,EAAS5iB,KAAK,IAAI+iB,EAAKphB,EAAK,KAAM,KAAMihB,EAAS9iB,OAAS+iB,EAAU/iB,UAEtEwiB,IACI3gB,GAAO0gB,EAAMY,UAAUthB,EAAK2gB,QAEhCK,EAAUK,UAAU5P,EAAK0P,MAG3B,OAAI1P,EAAK0J,WACPA,EAAYuF,EAAQjP,EAAK0J,UAAUnb,IAAI0gB,EAAMrZ,MAAMsZ,IAAYlP,EAAK0J,UACpE4F,EAAY,IAAIb,EAAOpD,EAAOqD,MAAM9Y,MAAM,EAAGrF,GAAKuf,OAAOL,EAAUvU,UAAU9M,OAAOohB,IAAYnE,EAAOsD,WAAa,IAC7G,QAHT,IAKC7jB,KAAK4jB,MAAMhiB,OAAQ,GAEf,CAAC4iB,UAAWA,EAAWC,UAAWA,EAAW7F,UAAWA,IAKjE+E,EAAO7Q,UAAUmS,aAAe,SAAuBR,EAAW7F,EAAWsG,EAAahB,GAIxF,IAHA,IAAIiB,EAAW,GAAItB,EAAa7jB,KAAK6jB,WACjCuB,EAAWplB,KAAK4jB,MAAOyB,GAAYnB,GAAiBkB,EAASxjB,OAASwjB,EAASf,IAAIe,EAASxjB,OAAS,GAAK,KAErGwI,EAAI,EAAGA,EAAIqa,EAAUa,MAAM1jB,OAAQwI,IAAK,CAC/C,IAAIwa,EAAOH,EAAUa,MAAMlb,GAAGmb,OAAOd,EAAUe,KAAKpb,IAChD8K,EAAO,IAAI2P,EAAKJ,EAAU5J,QAAQ0J,KAAKna,GAAIwa,EAAMhG,GAAY6G,OAAS,GACtEA,EAASJ,GAAYA,EAASK,MAAMxQ,MACtCA,EAAOuQ,EACHrb,EAAK+a,EAASpjB,MACXqjB,EAAWA,EAASta,MAAM,EAAGsa,EAASxjB,OAAS,IAExDujB,EAASrjB,KAAKoT,GACV0J,IACFiF,IACAjF,EAAY,MAETsF,IAAiBmB,EAAWnQ,GAEnC,IAAIyQ,EAAW9B,EAAaqB,EAAYtI,MAKxC,OAJI+I,EAAWC,IACbR,EAAWtB,EAAasB,EAAUO,GAClC9B,GAAc8B,GAET,IAAIhC,EAAOyB,EAASJ,OAAOG,GAAWtB,IAG/CF,EAAO7Q,UAAUwR,UAAY,SAAoBuB,EAAMC,GACrD,IAAIvB,EAAO,IAAIpE,EAAqB4F,QAMpC,OALA/lB,KAAK4jB,MAAMtkB,SAAQ,SAAU4V,EAAM9K,GACjC,IAAI4b,EAAiC,MAArB9Q,EAAK+Q,cAAwB7b,EAAI8K,EAAK+Q,cAAgBJ,EAChEG,EAAYzB,EAAKA,KAAK3iB,OAASsT,EAAK+Q,aAAe,KACzD1B,EAAKQ,UAAU7P,EAAKzR,IAAKuiB,KACxBH,EAAMC,GACFvB,GAGTZ,EAAO7Q,UAAUoT,QAAU,SAAkBC,GAC3C,OAAuB,GAAnBnmB,KAAK6jB,WAA0B7jB,KAC5B,IAAI2jB,EAAO3jB,KAAK4jB,MAAMoB,OAAOmB,EAAM1iB,KAAI,SAAUA,GAAO,OAAO,IAAIohB,EAAKphB,OAAWzD,KAAK6jB,aAQjGF,EAAO7Q,UAAUsT,QAAU,SAAkBC,EAAkBC,GAC7D,IAAKtmB,KAAK6jB,WAAc,OAAO7jB,KAE/B,IAAIumB,EAAe,GAAIC,EAAQzQ,KAAK0Q,IAAI,EAAGzmB,KAAK4jB,MAAMhiB,OAAS0kB,GAE3DzL,EAAUwL,EAAiBxL,QAC3B6L,EAAWL,EAAiBf,MAAM1jB,OAClCiiB,EAAa7jB,KAAK6jB,WACtB7jB,KAAK4jB,MAAMtkB,SAAQ,SAAU4V,GAAYA,EAAK0J,WAAaiF,MAAmB2C,GAE9E,IAAIG,EAAWL,EACftmB,KAAK4jB,MAAMtkB,SAAQ,SAAU4V,GAC3B,IAAIsG,EAAMX,EAAQ+L,YAAYD,GAC9B,GAAW,MAAPnL,EAAJ,CACAkL,EAAW3Q,KAAK8Q,IAAIH,EAAUlL,GAC9B,IAAI/X,EAAMoX,EAAQ0J,KAAK/I,GACvB,GAAItG,EAAK0P,KAAM,CACb,IAAIA,EAAOyB,EAAiBf,MAAM9J,GAAK+J,OAAOc,EAAiBb,KAAKhK,IAChEoD,EAAY1J,EAAK0J,WAAa1J,EAAK0J,UAAUnb,IAAIoX,EAAQ/P,MAAM6b,EAAW,EAAGnL,IAC7EoD,GAAaiF,IACjB0C,EAAazkB,KAAK,IAAI+iB,EAAKphB,EAAKmhB,EAAMhG,SAEtC2H,EAAazkB,KAAK,IAAI+iB,EAAKphB,OAE5B+iB,GAGH,IADA,IAAIM,EAAU,GACL1c,EAAIkc,EAAclc,EAAIsc,EAAUtc,IACrC0c,EAAQhlB,KAAK,IAAI+iB,EAAKhK,EAAQ0J,KAAKna,KACvC,IAAIwZ,EAAQ5jB,KAAK4jB,MAAM9Y,MAAM,EAAG0b,GAAOxB,OAAO8B,GAAS9B,OAAOuB,GAC1DQ,EAAS,IAAIpD,EAAOC,EAAOC,GAI/B,OAFIkD,EAAOC,iBAAmBtD,IAC1BqD,EAASA,EAAOE,SAASjnB,KAAK4jB,MAAMhiB,OAAS2kB,EAAa3kB,SACvDmlB,GAGTpD,EAAO7Q,UAAUkU,eAAiB,WAChC,IAAIrc,EAAQ,EAEZ,OADA3K,KAAK4jB,MAAMtkB,SAAQ,SAAU4V,GAAaA,EAAK0P,MAAQja,OAChDA,GASTgZ,EAAO7Q,UAAUmU,SAAW,SAAmBC,QAC7B,IAATA,IAAkBA,EAAOlnB,KAAK4jB,MAAMhiB,QAE3C,IAAIuiB,EAAQnkB,KAAKskB,UAAU,EAAG4C,GAAO9C,EAAUD,EAAMI,KAAK3iB,OACtDgiB,EAAQ,GAAIuD,EAAS,EAsBzB,OArBAnnB,KAAK4jB,MAAMtkB,SAAQ,SAAU4V,EAAM9K,GACjC,GAAIA,GAAK8c,EACPtD,EAAM9hB,KAAKoT,GACPA,EAAK0J,WAAauI,SACjB,GAAIjS,EAAK0P,KAAM,CACpB,IAAIA,EAAO1P,EAAK0P,KAAKnhB,IAAI0gB,EAAMrZ,MAAMsZ,IAAW3gB,EAAMmhB,GAAQA,EAAKwC,SAGnE,GAFAhD,IACI3gB,GAAO0gB,EAAMY,UAAUthB,EAAK2gB,GAC5BQ,EAAM,CACR,IAAIhG,EAAY1J,EAAK0J,WAAa1J,EAAK0J,UAAUnb,IAAI0gB,EAAMrZ,MAAMsZ,IAC7DxF,GAAauI,IACjB,IAAuD1B,EAAnD4B,EAAU,IAAIxC,EAAKphB,EAAI8hB,SAAUX,EAAMhG,GAAoB0I,EAAO1D,EAAMhiB,OAAS,GACjF6jB,EAAS7B,EAAMhiB,QAAUgiB,EAAM0D,GAAM5B,MAAM2B,IAC3CzD,EAAM0D,GAAQ7B,EAEd7B,EAAM9hB,KAAKulB,SAERnS,EAAKzR,KACd2gB,MAEDpkB,KAAK4jB,MAAMhiB,OAAQ,GACf,IAAI+hB,EAAOF,EAAaoC,KAAKjC,EAAMxT,WAAY+W,IAGxDxD,EAAOvI,MAAQ,IAAIuI,EAAOF,EAAarI,MAAO,GAa9C,IAAIyJ,EAAO,SAAcphB,EAAKmhB,EAAMhG,EAAWqH,GAC7CjmB,KAAKyD,IAAMA,EACXzD,KAAK4kB,KAAOA,EACZ5kB,KAAK4e,UAAYA,EACjB5e,KAAKimB,aAAeA,GAGtBpB,EAAK/R,UAAU4S,MAAQ,SAAgBpK,GACrC,GAAItb,KAAK4kB,MAAQtJ,EAAMsJ,OAAStJ,EAAMsD,UAAW,CAC/C,IAAIgG,EAAOtJ,EAAMsJ,KAAKc,MAAM1lB,KAAK4kB,MACjC,GAAIA,EAAQ,OAAO,IAAIC,EAAKD,EAAKwC,SAAS7B,SAAUX,EAAM5kB,KAAK4e,aAOnE,IAAI2I,EAAe,SAAsBC,EAAMC,EAAQC,EAAYC,GACjE3nB,KAAKwnB,KAAOA,EACZxnB,KAAKynB,OAASA,EACdznB,KAAK0nB,WAAaA,EAClB1nB,KAAK2nB,SAAWA,GAGd/B,EAAiB,GAIrB,SAASgC,EAAiBC,EAASrJ,EAAOW,EAAIne,GAC5C,IAAwColB,EAApC0B,EAAY3I,EAAG4I,QAAQC,GAC3B,GAAIF,EAAa,OAAOA,EAAUG,aAE9B9I,EAAG4I,QAAQG,KAAoBL,EAAU,IAAIN,EAAaM,EAAQL,KAAMK,EAAQJ,OAAQ,KAAM,IAElG,IAAIU,EAAWhJ,EAAG4I,QAAQ,uBAE1B,GAAuB,GAAnB5I,EAAGmG,MAAM1jB,OACX,OAAOimB,EACF,GAAIM,GAAYA,EAASJ,QAAQC,GACtC,OAAIG,EAASJ,QAAQC,GAAYI,KACtB,IAAIb,EAAaM,EAAQL,KAAKvC,aAAa9F,EAAI,KAAMne,EAASqnB,EAAkB7J,IACjEqJ,EAAQJ,OAAQa,EAAUnJ,EAAGtE,QAAQ0J,KAAKpF,EAAGmG,MAAM1jB,OAAS,IAAKimB,EAAQF,UAExF,IAAIJ,EAAaM,EAAQL,KAAMK,EAAQJ,OAAOxC,aAAa9F,EAAI,KAAMne,EAASqnB,EAAkB7J,IACjF,KAAMqJ,EAAQF,UACnC,IAAmC,IAA/BxI,EAAG4I,QAAQ,iBAA+BI,IAAiD,IAArCA,EAASJ,QAAQ,gBAQ3E,OAAI3B,EAAUjH,EAAG4I,QAAQ,YAGvB,IAAIR,EAAaM,EAAQL,KAAKpB,QAAQjH,EAAIiH,GACzByB,EAAQJ,OAAOrB,QAAQjH,EAAIiH,GAC3BmC,EAAUV,EAAQH,WAAYvI,EAAGtE,SAAUgN,EAAQF,UAEpE,IAAIJ,EAAaM,EAAQL,KAAKtB,QAAQ/G,EAAGtE,QAAQ0J,MAChCsD,EAAQJ,OAAOvB,QAAQ/G,EAAGtE,QAAQ0J,MAClCgE,EAAUV,EAAQH,WAAYvI,EAAGtE,SAAUgN,EAAQF,UAf3E,IAAIa,EAAWX,EAAQF,UAAYxI,EAAGsJ,MAAQ,GAAKznB,EAAQ0nB,gBACtDP,IAAaQ,EAAaxJ,EAAI0I,EAAQH,YACvCA,EAAaS,EAAWI,EAAUV,EAAQH,WAAYvI,EAAGtE,SAAWyN,EAAUnJ,EAAGtE,QAAQ0J,KAAKpF,EAAGmG,MAAM1jB,OAAS,IACpH,OAAO,IAAI2lB,EAAaM,EAAQL,KAAKvC,aAAa9F,EAAIqJ,EAAWhK,EAAMI,UAAUjD,cAAgB,KAC/C3a,EAASqnB,EAAkB7J,IACrDmF,EAAOvI,MAAOsM,EAAYvI,EAAGsJ,MAczD,SAASE,EAAalE,EAAWiD,GAC/B,IAAKA,EAAc,OAAO,EAC1B,IAAKjD,EAAUmE,WAAc,OAAO,EACpC,IAAIC,GAAW,EAMf,OALApE,EAAU5J,QAAQ0J,KAAK,GAAGjlB,SAAQ,SAAUknB,EAAO/gB,GACjD,IAAK,IAAI2E,EAAI,EAAGA,EAAIsd,EAAW9lB,OAAQwI,GAAK,EACpCoc,GAASkB,EAAWtd,EAAI,IAAM3E,GAAOiiB,EAAWtd,KAClDye,GAAW,MAEZA,EAGT,SAASP,EAAU7kB,GACjB,IAAIjD,EAAS,GAEb,OADAiD,EAAInE,SAAQ,SAAUwpB,EAAOC,EAAKlD,EAAMC,GAAM,OAAOtlB,EAAOsB,KAAK+jB,EAAMC,MAChEtlB,EAGT,SAAS+nB,EAAUS,EAAQnO,GACzB,IAAKmO,EAAU,OAAO,KAEtB,IADA,IAAIxoB,EAAS,GACJ4J,EAAI,EAAGA,EAAI4e,EAAOpnB,OAAQwI,GAAK,EAAG,CACzC,IAAIyb,EAAOhL,EAAQpX,IAAIulB,EAAO5e,GAAI,GAAI0b,EAAKjL,EAAQpX,IAAIulB,EAAO5e,EAAI,IAAK,GACnEyb,GAAQC,GAAMtlB,EAAOsB,KAAK+jB,EAAMC,GAEtC,OAAOtlB,EAMT,SAASyoB,EAAgBpB,EAASrJ,EAAOC,EAAU2J,GACjD,IAAIlE,EAAgBmE,EAAkB7J,GAAQ0G,EAAc8C,EAAW3D,IAAI7F,GAAOtC,KAAKgN,OACnFnnB,GAAOqmB,EAAOP,EAAQJ,OAASI,EAAQL,MAAMvD,SAASzF,EAAO0F,GACjE,GAAKniB,EAAL,CAEA,IAAI6c,EAAY7c,EAAI6c,UAAU9D,QAAQ/Y,EAAI0iB,UAAU7J,KAChDuO,GAASf,EAAOP,EAAQL,KAAOK,EAAQJ,QAAQxC,aAAaljB,EAAI0iB,UAAWjG,EAAMI,UAAUjD,cAC/BuJ,EAAahB,GAEzEkF,EAAU,IAAI7B,EAAaa,EAAOe,EAAQpnB,EAAIyiB,UAAW4D,EAAOrmB,EAAIyiB,UAAY2E,EAAO,KAAM,GACjG1K,EAAS1c,EAAI0iB,UAAUrF,aAAaR,GAAWyK,QAAQrB,EAAY,CAACI,KAAMA,EAAMH,aAAcmB,IAAUE,mBAG1G,IAAIC,GAAsB,EACtBC,EAA6B,KAKjC,SAASnB,EAAkB7J,GACzB,IAAIjV,EAAUiV,EAAMjV,QACpB,GAAIigB,GAA8BjgB,EAAS,CACzCggB,GAAsB,EACtBC,EAA6BjgB,EAC7B,IAAK,IAAIa,EAAI,EAAGA,EAAIb,EAAQ3H,OAAQwI,IAAO,GAAIb,EAAQa,GAAG8R,KAAKuN,qBAAsB,CACnFF,GAAsB,EACtB,OAGJ,OAAOA,EAOT,SAASG,EAAavK,GACpB,OAAOA,EAAGkK,QAAQnB,GAAiB,GAGrC,IAAIF,EAAa,IAAI1N,EAAiBqP,UAAU,WAC5CzB,EAAkB,IAAI5N,EAAiBqP,UAAU,gBAsBrD,SAAS9B,EAAQqB,GAGf,OAFAA,EAAS,CAACtM,MAAOsM,GAAUA,EAAOtM,OAAS,IACjC8L,cAAeQ,GAAUA,EAAOR,eAAiB,KACpD,IAAIpO,EAAiBqD,OAAO,CACjCld,IAAKunB,EAELxJ,MAAO,CACLoL,KAAM,WACJ,OAAO,IAAIrC,EAAa5D,EAAOvI,MAAOuI,EAAOvI,MAAO,KAAM,IAE5Dzd,MAAO,SAAewhB,EAAI0K,EAAMrL,GAC9B,OAAOoJ,EAAiBiC,EAAMrL,EAAOW,EAAI+J,KAI7CA,OAAQA,IAMZ,SAASY,EAAKtL,EAAOC,GACnB,IAAIoL,EAAO7B,EAAW+B,SAASvL,GAC/B,SAAKqL,GAAgC,GAAxBA,EAAKrC,KAAK3D,cACnBpF,GAAYwK,EAAgBY,EAAMrL,EAAOC,GAAU,IAChD,GAKT,SAAS2J,EAAK5J,EAAOC,GACnB,IAAIoL,EAAO7B,EAAW+B,SAASvL,GAC/B,SAAKqL,GAAkC,GAA1BA,EAAKpC,OAAO5D,cACrBpF,GAAYwK,EAAgBY,EAAMrL,EAAOC,GAAU,IAChD,GAKT,SAASuL,EAAUxL,GACjB,IAAIqL,EAAO7B,EAAW+B,SAASvL,GAC/B,OAAOqL,EAAOA,EAAKrC,KAAK3D,WAAa,EAKvC,SAASoG,EAAUzL,GACjB,IAAIqL,EAAO7B,EAAW+B,SAASvL,GAC/B,OAAOqL,EAAOA,EAAKpC,OAAO5D,WAAa,EAGzC/lB,EAAQypB,aAAeA,EACvBzpB,EAAQ4rB,aAAeA,EACvB5rB,EAAQ+pB,QAAUA,EAClB/pB,EAAQgsB,KAAOA,EACfhsB,EAAQsqB,KAAOA,EACftqB,EAAQksB,UAAYA,EACpBlsB,EAAQmsB,UAAYA,G,oCC/bpB9qB,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIma,EAAmB,EAAQ,QAE3B4P,EAAa,SAAoBtF,EAAMuF,EAAUxV,GACnD3U,KAAK4kB,KAAOA,EACZ5kB,KAAKmqB,SAAWA,EAChBnqB,KAAK2U,OAASA,GAMhB,SAASyV,EAAY9E,EAAO+E,EAAM5F,GAChC,IAAK,IAAIra,EAAIkb,EAAM1jB,OAAS,EAAGwI,GAAK,EAAGA,IAAOqa,EAAUG,KAAKU,EAAMlb,GAAG+f,UACtE,IAAK,IAAIG,EAAM,EAAGA,EAAMD,EAAKzoB,OAAQ0oB,IAAS7F,EAAUG,KAAKyF,EAAKC,IAElE,IADA,IAAI9pB,EAAS,GACJ+pB,EAAM,EAAGnG,EAAUkB,EAAM1jB,OAAQ2oB,EAAMjF,EAAM1jB,OAAQ2oB,IAAO,CACnE,IAAIC,EAASlF,EAAMiF,GAAK3F,KAAKnhB,IAAIghB,EAAU5J,QAAQ/P,MAAMsZ,IACzDA,IACIoG,IAAW/F,EAAUK,UAAU0F,GAAQC,SACzChG,EAAU5J,QAAQ6P,UAAUtG,EAASK,EAAUa,MAAM1jB,OAAS,GAC9DpB,EAAOsB,KAAK,IAAIooB,EAAWM,EAAQA,EAAOjF,OAAOd,EAAUe,KAAKf,EAAUe,KAAK5jB,OAAS,IAAK0jB,EAAMiF,GAAK5V,UAG5G,OAAOnU,EAQT,IAAImqB,EAAc,SAAqB3d,EAAS4d,GAM9C5qB,KAAKgN,QAAUA,EAKfhN,KAAK4qB,YAAcA,GAGrB,SAASC,EAAgBpG,GAEvB,IADA,IAAIjkB,EAAS,GACJ4J,EAAI,EAAGA,EAAIqa,EAAUa,MAAM1jB,OAAQwI,IACxC5J,EAAOsB,KAAK,IAAIooB,EAAWzF,EAAUa,MAAMlb,GAClBqa,EAAUa,MAAMlb,GAAGmb,OAAOd,EAAUe,KAAKpb,IACzCqa,IAC7B,OAAOjkB,EAGT,IAAIsqB,EAAY,IAAIxQ,EAAiBqP,UAAU,UAgB/C,SAASoB,EAAO7B,GAMd,YALgB,IAAXA,IAAoBA,EAAS,IAElCA,EAAS,CAAClc,QAASkc,EAAOlc,SAAW,EAC3Bge,SAA6B,MAAnB9B,EAAO8B,SAAmBjV,KAAKC,MAAsB,WAAhBD,KAAKkV,UAAyB/B,EAAO8B,UAEvF,IAAI1Q,EAAiBqD,OAAO,CACjCld,IAAKqqB,EAELtM,MAAO,CACLoL,KAAM,WAAc,OAAO,IAAIe,EAAYzB,EAAOlc,QAAS,KAC3DrP,MAAO,SAAewhB,EAAI4L,GACxB,IAAIG,EAAW/L,EAAG4I,QAAQ+C,GAC1B,OAAII,IAEA/L,EAAGyJ,WACI,IAAI+B,EAAYI,EAAO/d,QAAS+d,EAAOH,YAAYtnB,OAAOunB,EAAgB1L,KAC9E4L,KAIX7B,OAAQA,EAGRO,sBAAsB,IAkB1B,SAAS0B,EAAmB3M,EAAO8G,EAAO8F,EAAWpqB,GAMnD,IAAIqqB,EAAcP,EAAUf,SAASvL,GACjCxR,EAAUqe,EAAYre,QAAUsY,EAAM1jB,OACtC0pB,EAAQR,EAAUzG,IAAI7F,GAAOtC,KAAKgN,OAAO8B,SAGzCO,EAAO,EACX,MAAOA,EAAOH,EAAUxpB,QAAUwpB,EAAUG,IAASD,IAAWC,EAChE,IAAIX,EAAcS,EAAYT,YAAY9f,MAAMygB,GAIhD,GAHAjG,EAAQiG,EAAOjG,EAAMxa,MAAMygB,GAAQjG,GAG9BA,EAAM1jB,OACP,OAAO4c,EAAMW,GAAGkK,QAAQyB,EAAW,IAAIH,EAAY3d,EAAS4d,IAEhE,IAAIY,EAAeZ,EAAYhpB,OAC3Bud,EAAKX,EAAMW,GACf,GAAIqM,EACFZ,EAAcR,EAAYQ,EAAatF,EAAOnG,OACzC,CACL,IAAK,IAAI/U,EAAI,EAAGA,EAAIkb,EAAM1jB,OAAQwI,IAAO+U,EAAGyF,KAAKU,EAAMlb,IACvDwgB,EAAc,GAGhB,IAAIa,EAAiB,IAAId,EAAY3d,EAAS4d,GAM9C,OALI5pB,GAAWA,EAAQ0qB,sBAAwBlN,EAAMI,qBAAqBtE,EAAiB0E,gBACzFG,EAAGC,aAAa9E,EAAiB0E,cAAc2M,QAAQxM,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAI+a,EAAMI,UAAU/C,QAAS,IACxEsD,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAI+a,EAAMI,UAAU7D,MAAO,KAAM,IACjGoE,EAAGyM,UAAW,GAETzM,EAAGkK,QAAQ,UAAWmC,GAAcnC,QAAQ,gBAAgB,GAAOA,QAAQyB,EAAWW,GAa/F,SAASI,EAAcrN,GACrB,IAAI6M,EAAcP,EAAUf,SAASvL,GACrC,OAAsC,GAAlC6M,EAAYT,YAAYhpB,OAAsB,KAC3C,CACLoL,QAASqe,EAAYre,QACrBsY,MAAO+F,EAAYT,YAAYnnB,KAAI,SAAU0G,GAAK,OAAOA,EAAEya,QAC3DoG,SAAUF,EAAUzG,IAAI7F,GAAOtC,KAAKgN,OAAO8B,SAC3C,cAAgB,OAAOhrB,KAAK8rB,WAAa9rB,KAAK8rB,SAAWT,EAAYT,YAAYnnB,KAAI,SAAU0G,GAAK,OAAOA,EAAEwK,aAOjH,SAASoX,EAAWvN,GAClB,OAAOsM,EAAUf,SAASvL,GAAOxR,QAGnClP,EAAQssB,YAAcA,EACtBtsB,EAAQitB,OAASA,EACjBjtB,EAAQqtB,mBAAqBA,EAC7BrtB,EAAQ+tB,cAAgBA,EACxB/tB,EAAQiuB,WAAaA,G,oCCxLrB,IAAIC,EAAO,EAAQ,QACf7uB,EAAQ,EAAQ,QAEpBW,EAAQkQ,UAAYA,EACpBlQ,EAAQiQ,cAAgBA,EACxBjQ,EAAQ6a,iBAAmBA,EAC3B7a,EAAQsb,cAAgBA,EACxBtb,EAAQmuB,cAAgBA,EAExBC,EAAQpZ,UAAUxQ,QAAUlB,EAC5B8qB,EAAQpZ,UAAUO,WAAaA,EAC/B6Y,EAAQpZ,UAAUW,eAAiBA,EACnCyY,EAAQpZ,UAAUvQ,SAAWqN,EAC7Bsc,EAAQpZ,UAAU9Q,UAAYiO,EAC9Bic,EAAQpZ,UAAU8C,cAAgBuW,EAClCD,EAAQpZ,UAAU+C,SAAWsW,EAC7BD,EAAQpZ,UAAUgD,OAASsW,EAE3B,IAAIC,EAAgB,QAGpB,SAASre,EAAUvQ,EAAM0C,EAAOa,GAC9B,IAGIR,EAHAgH,EAASwkB,EAAKhU,UAAU,IACxBsU,EAAWtrB,GAAW,GACtBurB,EAASD,EAASC,OAGtB,GAAoB,kBAAT9uB,EACT,MAAMN,EAAM,uCAAwCM,GAGtD,IAAKuuB,EAAKre,YAAYlQ,GACpB,MAAMN,EAAM,2CAA4CM,GAG1D,GAAqB,kBAAV0C,EACT,MAAMhD,EAAM,wCAAyCgD,GAevD,GAZe,OAAXosB,QAA8BzsB,IAAXysB,IACrBA,EAASF,GAGXL,EAAKhU,UAAU,CAACrG,UAAWua,EAAShrB,YAAaqrB,IAEjD/rB,EAASwrB,EAAKhe,UAAU7N,EAAO,CAACmJ,SAAU7L,EAAMwQ,gBAAgB,IAEhE+d,EAAKhU,UAAUxQ,GAAU,IAIrBhH,EAAO4V,YACT,MAAM5V,EAAO4V,YAGf,MAAO,CACL1Q,UAAWlF,EAAOkF,UAClB4D,SAAU9I,EAAO8I,SACjBnJ,MAAOK,EAAOuC,QAAQtB,SAASC,UAInC,SAASqM,EAAc5N,EAAOa,GAC5B,IAKIR,EACAyW,EACAjC,EACAvX,EARA6uB,EAAWtrB,GAAW,GACtBwrB,EAASF,EAASE,QAAUR,EAAK5S,gBACjCmT,EAASD,EAASC,OAClB3qB,EAAS4qB,EAAO5qB,OAChBsC,GAAS,EAUb,GAJe,OAAXqoB,QAA8BzsB,IAAXysB,IACrBA,EAASF,GAGU,kBAAVlsB,EACT,MAAMhD,EAAM,wCAAyCgD,GAGvD8W,EAAa,CAACvR,UAAW,EAAG4D,SAAU,KAAMnJ,MAAO,IACnDK,EAAS,CAACkF,UAAW,EAAG4D,SAAU,KAAMnJ,MAAO,IAE/C,QAAS+D,EAAQtC,EACfnE,EAAO+uB,EAAOtoB,GAET8nB,EAAKre,YAAYlQ,KAItBuX,EAAUhH,EAAUvQ,EAAM0C,EAAOa,GACjCgU,EAAQ1L,SAAW7L,EAEfuX,EAAQtP,UAAYuR,EAAWvR,YACjCuR,EAAajC,GAGXA,EAAQtP,UAAYlF,EAAOkF,YAC7BuR,EAAazW,EACbA,EAASwU,IAQb,OAJIiC,EAAW3N,WACb9I,EAAOyW,WAAaA,GAGfzW,EAIT,SAASmY,EAAiBlb,EAAMY,GAC9B2tB,EAAKrT,iBAAiBlb,EAAMY,GAI9B,SAAS+a,IACP,OAAO4S,EAAK5S,gBAId,SAAS6S,EAAcxuB,EAAM0b,GAC3B,IACI1Y,EADAgD,EAAMhG,EAQV,IAAKgD,KALD0Y,IACF1V,EAAM,GACNA,EAAIhG,GAAQ0b,GAGF1V,EACVuoB,EAAK/S,gBAAgBxV,EAAIhD,GAAM,CAACoR,aAAcpR,IAIlD,SAASyrB,EAAQlrB,GACfhB,KAAKgB,QAAUA,EACfhB,KAAKyB,SAAW,CAACC,SAAU,IAC3B1B,KAAK2B,MAAQ,CAAC3B,KAAKyB,UAGrB,SAAS4R,EAAWlT,EAAO1C,GACzBuC,KAAKuC,SAAS9E,GACduC,KAAKsC,QAAQnC,GACbH,KAAKgC,YAGP,SAASyR,EAAe6H,EAAO7d,GAC7B,IAAIkE,EAAQ3B,KAAK2B,MACbqT,EAAUrT,EAAMA,EAAMC,OAAS,GAC/B4U,EAAU8E,EAAM7Z,SAASC,SACzBd,EAAOnD,EACP,CACEc,KAAM,UACNkuB,QAAS,OACTC,WAAY,CAACrrB,UAAW,CAAC5D,IACzBiE,SAAU8U,GAEZA,EAEJxB,EAAQtT,SAAWsT,EAAQtT,SAAS4B,OAAO1C,GAG7C,SAASQ,EAAKjB,GACZ,IACI6U,EACA2X,EAFAhrB,EAAQ3B,KAAK2B,MAIH,KAAVxB,IAEJ6U,EAAUrT,EAAMA,EAAMC,OAAS,GAC/B+qB,EAAO3X,EAAQtT,SAASsT,EAAQtT,SAASE,OAAS,GAE9C+qB,GAAsB,SAAdA,EAAKpuB,KACfouB,EAAKxsB,OAASA,EAEd6U,EAAQtT,SAASI,KAAK,CAACvD,KAAM,OAAQ4B,MAAOA,KAIhD,SAASyP,EAAKnS,GACZ,IAAIkE,EAAQ3B,KAAK2B,MACbN,EAAYrB,KAAKgB,QAAQE,YAAczD,EACvCuX,EAAUrT,EAAMA,EAAMC,OAAS,GAC/BY,EAAQ,CACVjE,KAAM,UACNkuB,QAAS,OACTC,WAAY,CAACrrB,UAAW,CAACA,IACzBK,SAAU,IAGZsT,EAAQtT,SAASI,KAAKU,GACtBb,EAAMG,KAAKU,GAGb,SAASyN,IACPjQ,KAAK2B,MAAMI,MAGb,SAASqqB,IACP,MAAO,GAGT,SAASD,O,kCC9MT,W,qBC0FA,IA1FA,IAAIS,EAAO,CACTC,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,KAEHC,EAAQ,CACVC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJzC,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,KAGHY,EAA6B,oBAAbC,WAA4B,gBAAgBhtB,KAAKgtB,UAAUC,WAC3EC,EAA6B,oBAAbF,WAA4B,iBAAiBhf,KAAKgf,UAAUG,QAC5EC,EAA4B,oBAAbJ,WAA4B,aAAahf,KAAKgf,UAAUC,WACvEI,EAA0B,oBAAbL,WAA4B,MAAMhf,KAAKgf,UAAUM,UAC9DC,EAAsBR,IAAWM,IAAQN,EAAO,GAAK,KAAOK,GAASC,EAGhE/mB,EAAI,EAAGA,EAAI,GAAIA,IAAKwiB,EAAK,GAAKxiB,GAAKwiB,EAAK,GAAKxiB,GAAKzF,OAAOyF,GAGlE,IAASA,EAAI,EAAGA,GAAK,GAAIA,IAAKwiB,EAAKxiB,EAAI,KAAO,IAAMA,EAGpD,IAASA,EAAI,GAAIA,GAAK,GAAIA,IACxBwiB,EAAKxiB,GAAKzF,OAAO2sB,aAAalnB,EAAI,IAClC8lB,EAAM9lB,GAAKzF,OAAO2sB,aAAalnB,GAIjC,IAAK,IAAI0D,KAAQ8e,EAAWsD,EAAMnd,eAAejF,KAAOoiB,EAAMpiB,GAAQ8e,EAAK9e,IAE3E,SAASyjB,EAAQ/hB,GAGf,IAAIgiB,EAAYH,IAAwB7hB,EAAMiiB,SAAWjiB,EAAMkiB,QAAUliB,EAAMmiB,UAC7EX,GAAUxhB,EAAMoiB,UAAYpiB,EAAM/O,KAA2B,GAApB+O,EAAM/O,IAAImB,OACjDnE,GAAS+zB,GAAahiB,EAAM/O,MAC7B+O,EAAMoiB,SAAW1B,EAAQtD,GAAMpd,EAAMqiB,UACtCriB,EAAM/O,KAAO,eASf,MAPY,OAARhD,IAAeA,EAAO,UACd,OAARA,IAAeA,EAAO,UAEd,QAARA,IAAgBA,EAAO,aACf,MAARA,IAAcA,EAAO,WACb,SAARA,IAAiBA,EAAO,cAChB,QAARA,IAAgBA,EAAO,aACpBA,EAGTI,EAAOC,QAAUyzB,EACjBA,EAAQ3E,KAAOA,EACf2E,EAAQrB,MAAQA,G,oCCzHhB,SAAS3M,EAAiBC,GAAM,OAAQA,GAAqB,kBAAPA,GAAoB,YAAaA,EAAMA,EAAG,WAAaA,EAF7GrkB,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAItD,IAAIoxB,EAAUhO,EAAgB,EAAQ,SAClCjJ,EAAmB,EAAQ,QAI3B6W,EAA0B,oBAAbL,WAA2B,MAAMhf,KAAKgf,UAAUM,UAEjE,SAASU,EAAiBr0B,GACxB,IAEIs0B,EAAKC,EAAM9B,EAAO+B,EAFlBC,EAAQz0B,EAAKmK,MAAM,UAAWpH,EAAS0xB,EAAMA,EAAMtwB,OAAS,GAClD,SAAVpB,IAAqBA,EAAS,KAElC,IAAK,IAAI4J,EAAI,EAAGA,EAAI8nB,EAAMtwB,OAAS,EAAGwI,IAAK,CACzC,IAAI+nB,EAAMD,EAAM9nB,GAChB,GAAI,kBAAkB0H,KAAKqgB,GAAQF,GAAO,OACrC,GAAI,YAAYngB,KAAKqgB,GAAQJ,GAAM,OACnC,GAAI,sBAAsBjgB,KAAKqgB,GAAQH,GAAO,OAC9C,GAAI,cAAclgB,KAAKqgB,GAAQjC,GAAQ,MACvC,KAAI,SAASpe,KAAKqgB,GAChB,MAAM,IAAI90B,MAAM,+BAAiC80B,GADrBhB,EAAOc,GAAO,EAAeD,GAAO,GAOzE,OAJID,IAAOvxB,EAAS,OAASA,GACzBwxB,IAAQxxB,EAAS,QAAUA,GAC3ByxB,IAAQzxB,EAAS,QAAUA,GAC3B0vB,IAAS1vB,EAAS,SAAWA,GAC1BA,EAGT,SAAS4xB,EAAU3uB,GACjB,IAAI4uB,EAAOlzB,OAAO/B,OAAO,MACzB,IAAK,IAAImC,KAAQkE,EAAO4uB,EAAKP,EAAiBvyB,IAASkE,EAAIlE,GAC3D,OAAO8yB,EAGT,SAASC,EAAU70B,EAAM+R,EAAO0gB,GAK9B,OAJI1gB,EAAMkiB,SAAUj0B,EAAO,OAASA,GAChC+R,EAAMiiB,UAAWh0B,EAAO,QAAUA,GAClC+R,EAAMmiB,UAAWl0B,EAAO,QAAUA,IACxB,IAAVyyB,GAAmB1gB,EAAMoiB,WAAYn0B,EAAO,SAAWA,GACpDA,EAiCT,SAAS80B,EAAOC,GACd,OAAO,IAAIlY,EAAiBqD,OAAO,CAACrQ,MAAO,CAAC6Q,cAAeC,EAAeoU,MAO5E,SAASpU,EAAeoU,GACtB,IAAI/uB,EAAM2uB,EAAUI,GACpB,OAAO,SAAS9T,EAAMlP,GACpB,IAAqEijB,EAAjEh1B,EAAO8zB,EAAQ/hB,GAAQkjB,EAAwB,GAAfj1B,EAAKmE,QAAuB,KAARnE,EACpDk1B,EAASlvB,EAAI6uB,EAAU70B,EAAM+R,GAAQkjB,IACzC,GAAIC,GAAUA,EAAOjU,EAAKF,MAAOE,EAAKD,SAAUC,GAAS,OAAO,EAChE,GAAIgU,IAAWljB,EAAMoiB,UAAYpiB,EAAMkiB,QAAUliB,EAAMmiB,WAClDc,EAAWlB,EAAQ3E,KAAKpd,EAAMqiB,WAAaY,GAAYh1B,EAAM,CAChE,IAAIm1B,EAAWnvB,EAAI6uB,EAAUG,EAAUjjB,GAAO,IAC9C,GAAIojB,GAAYA,EAASlU,EAAKF,MAAOE,EAAKD,SAAUC,GAAS,OAAO,EAEtE,OAAO,GAIX5gB,EAAQy0B,OAASA,EACjBz0B,EAAQsgB,eAAiBA,G,wBC1FvB,WAGA,IAAIyU,EAoBJ,SAASC,IACPllB,QAAQ6C,IAAI/S,EAAOC,MAAM,KAAMC,YAGjC,SAASm1B,EAASC,EAAKC,GACrB,OAAOv1B,EAAOC,MAAM,KAAM,CAACq1B,GAAK1vB,OAAO2vB,IAGzC,SAASv1B,EAAOs1B,GAsBd,IArBA,IAKIxmB,EAEAmN,EACAuZ,EAEAC,EAVAC,EAAW,EACX7vB,EAAO,GAAGuH,MAAMiF,KAAKnS,WACrBwM,EAAI,EACJ2Z,EAAIiP,EAAIpxB,OACRpB,EAAS,GAET6yB,GAAU,EAGVC,GAAc,EAEdC,EAAU,WAAa,OAAOhwB,EAAK6vB,MACnCI,EAAc,WACZ,IAAIC,EAAS,GACb,MAAO,KAAK3hB,KAAKkhB,EAAI5oB,IACnBqpB,GAAUT,EAAI5oB,KACdoC,EAAIwmB,EAAI5oB,GAEV,OAAOqpB,EAAO7xB,OAAS,EAAI8xB,SAASD,GAAU,MAG7CrpB,EAAI2Z,IAAK3Z,EAEd,GADAoC,EAAIwmB,EAAI5oB,GACJipB,EAeF,OAdAA,GAAU,EACD,KAAL7mB,GACF8mB,GAAc,EACd9mB,EAAIwmB,IAAM5oB,IAEE,KAALoC,GAA0B,KAAdwmB,EAAI5oB,EAAI,IAC3BkpB,GAAc,EACdlpB,GAAK,EACLoC,EAAIwmB,EAAI5oB,IAGRkpB,GAAc,EAEhBH,EAAYK,IACJhnB,GACR,IAAK,IACHhM,GAAUkzB,SAASH,IAAW,IAAI1vB,SAAS,GAC3C,MACF,IAAK,IACH8V,EAAM4Z,IAEJ/yB,GADiB,kBAARmZ,GAAoBA,aAAehV,OAClCgV,EAEAhV,OAAO2sB,aAAaoC,SAAS/Z,EAAK,KAC9C,MACF,IAAK,IACHnZ,GAAUkzB,SAASH,IAAW,IAC9B,MACF,IAAK,IACHL,EAAMvuB,OAAOgvB,WAAWJ,KAAWK,QAAQT,GAAa,IACxD3yB,GAAU8yB,EAAcJ,EAAMA,EAAI9yB,QAAQ,KAAM,IAChD,MACF,IAAK,IACHI,GAAUyB,KAAKC,UAAUqxB,KACzB,MACF,IAAK,IACH/yB,GAAU,IAAMkzB,SAASH,IAAW,IAAI1vB,SAAS,GACjD,MACF,IAAK,IACHrD,GAAU+yB,IACV,MACF,IAAK,IACH/yB,GAAU,KAAOkzB,SAASH,IAAW,IAAI1vB,SAAS,IAClD,MACF,IAAK,IACHrD,GAAU,KAAOkzB,SAASH,IAAW,IAAI1vB,SAAS,IAAIgwB,cACtD,MACF,QACErzB,GAAUgM,EACV,UAEa,MAANA,EACT6mB,GAAU,EAEV7yB,GAAUgM,EAGd,OAAOhM,EA1GPqyB,EAAYh1B,EAAOC,QAAUJ,EAS/Bm1B,EAAUn1B,OAASA,EACnBm1B,EAAUE,SAAWA,EAEE,qBAAZnlB,SAAkD,oBAAhBA,QAAQ6C,MACnDoiB,EAAUC,OAASA,IApBtB,I,2CCXD,IAAI5iB,EAAS,WAAa,IAAI4jB,EAAI9zB,KAAS+zB,EAAGD,EAAIE,eAAmBC,EAAGH,EAAII,MAAMD,IAAIF,EAAG,OAAOE,EAAG,OAAO,CAACE,YAAY,mBAAmBC,GAAG,CAAC,OAAS,SAASC,GAAgC,OAAxBA,EAAOC,iBAAwBR,EAAIS,SAASF,MAAW,CAAEP,EAAW,QAAEG,EAAG,MAAM,CAACE,YAAY,WAAWL,EAAIU,KAAKP,EAAG,MAAM,CAACQ,WAAW,CAAC,CAACh3B,KAAK,OAAOi3B,QAAQ,SAASv0B,OAAQ2zB,EAAIa,QAASC,WAAW,cAAc,CAACX,EAAG,MAAM,CAACE,YAAY,YAAYU,MAAM,CAAC,KAAO,QAAQ,aAAa,kBAAkB,CAACZ,EAAG,SAAS,CAACE,YAAY,kBAAkBU,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQN,EAAIgB,aAAa,CAACb,EAAG,IAAI,CAACE,YAAY,mBAAmBL,EAAIiB,GAAG,aAAajB,EAAIkB,GAAGlB,EAAImB,GAAG,eAAe,gBAAgBhB,EAAG,aAAa,CAACY,MAAM,CAAC,MAAQf,EAAImB,GAAG,+BAA+BhB,EAAG,MAAM,CAACE,YAAY,YAAY,CAACF,EAAG,MAAM,CAACE,YAAY,qCAAqC,CAACF,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACL,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAImB,GAAG,mCAAmChB,EAAG,MAAM,CAACE,YAAY,aAAa,CAACF,EAAG,MAAM,CAACE,YAAY,OAAO,CAACF,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,QAAQ,CAACE,YAAY,4BAA4BU,MAAM,CAAC,IAAM,mBAAqBf,EAAIoB,OAAO,CAACpB,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAImB,GAAG,+BAA+BhB,EAAG,QAAQ,CAACQ,WAAW,CAAC,CAACh3B,KAAK,QAAQi3B,QAAQ,UAAUv0B,MAAO2zB,EAAIqB,mBAAmC,iBAAEP,WAAW,wCAAwCT,YAAY,eAAeU,MAAM,CAAC,KAAO,OAAO,SAAW,GAAG,GAAK,YAAcf,EAAIoB,KAAK,KAAO,YAAcpB,EAAIoB,KAAK,aAAapB,EAAImB,GAAG,4BAA4B5mB,SAAS,CAAC,MAASylB,EAAIqB,mBAAmC,kBAAGf,GAAG,CAAC,MAAQ,SAASC,GAAWA,EAAOrR,OAAOoS,WAAqBtB,EAAIuB,KAAKvB,EAAIqB,mBAAoB,mBAAoBd,EAAOrR,OAAO7iB,WAAY2zB,EAAIwB,OAAOC,IAAI,mBAAqBzB,EAAIoB,MAAOjB,EAAG,OAAO,CAACE,YAAY,eAAe,CAACL,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAIwB,OAAOE,MAAM,mBAAqB1B,EAAIoB,UAAUpB,EAAIU,SAASP,EAAG,MAAM,CAACE,YAAY,OAAO,CAACF,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,QAAQ,CAACY,MAAM,CAAC,IAAM,mBAAqBf,EAAIoB,OAAO,CAACpB,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAImB,GAAG,8CAA8ChB,EAAG,WAAW,CAACQ,WAAW,CAAC,CAACh3B,KAAK,QAAQi3B,QAAQ,UAAUv0B,MAAO2zB,EAAIqB,mBAA2B,SAAEP,WAAW,gCAAgCT,YAAY,eAAeU,MAAM,CAAC,SAAW,GAAG,aAAaf,EAAImB,GAAG,+BAA+B,KAAO,KAAK5mB,SAAS,CAAC,MAASylB,EAAIqB,mBAA2B,UAAGf,GAAG,CAAC,MAAQ,SAASC,GAAWA,EAAOrR,OAAOoS,WAAqBtB,EAAIuB,KAAKvB,EAAIqB,mBAAoB,WAAYd,EAAOrR,OAAO7iB,eAAe8zB,EAAG,MAAM,CAACE,YAAY,OAAO,CAACF,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,QAAQ,CAACE,YAAY,4BAA4BU,MAAM,CAAC,IAAM,UAAYf,EAAIoB,OAAO,CAACpB,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAImB,GAAG,kCAAkChB,EAAG,QAAQ,CAACQ,WAAW,CAAC,CAACh3B,KAAK,QAAQi3B,QAAQ,UAAUv0B,MAAO2zB,EAAIqB,mBAAiC,eAAEP,WAAW,sCAAsCT,YAAY,eAAeU,MAAM,CAAC,KAAO,OAAO,GAAK,UAAYf,EAAIoB,KAAK,KAAO,UAAYpB,EAAIoB,KAAK,aAAapB,EAAImB,GAAG,+BAA+B5mB,SAAS,CAAC,MAASylB,EAAIqB,mBAAiC,gBAAGf,GAAG,CAAC,MAAQ,SAASC,GAAWA,EAAOrR,OAAOoS,WAAqBtB,EAAIuB,KAAKvB,EAAIqB,mBAAoB,iBAAkBd,EAAOrR,OAAO7iB,WAAY2zB,EAAIwB,OAAOC,IAAI,UAAYzB,EAAIoB,MAAOjB,EAAG,OAAO,CAACE,YAAY,eAAe,CAACL,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAIwB,OAAOE,MAAM,UAAY1B,EAAIoB,UAAUpB,EAAIU,SAASP,EAAG,MAAM,CAACE,YAAY,OAAO,CAACF,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,QAAQ,CAACE,YAAY,4BAA4BU,MAAM,CAAC,IAAM,UAAYf,EAAIoB,OAAO,CAACpB,EAAIiB,GAAGjB,EAAIkB,GAAGlB,EAAImB,GAAG,kCAAkChB,EAAG,kBAAkB,CAACY,MAAM,CAAC,OAASf,EAAI2B,QAAQC,YAAY5B,EAAI6B,GAAG,CAAC,CAACl1B,IAAI,UAAUm1B,GAAG,SAASrW,GACzoH,IAAIsW,EAAWtW,EAAIsW,SACfC,EAAWvW,EAAIuW,SACnB,MAAO,CAAC7B,EAAG,MAAM,CAACE,YAAY,WAAW,CAACF,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASC,QAASlB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQyB,EAASE,OAAO,CAAC9B,EAAG,IAAI,CAACE,YAAY,kBAAkBF,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASE,UAAWnB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQyB,EAASG,SAAS,CAAC/B,EAAG,IAAI,CAACE,YAAY,oBAAoBF,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASG,aAAcpB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQyB,EAASI,YAAY,CAAChC,EAAG,IAAI,CAACE,YAAY,uBAAuBF,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASI,eAAgBrB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQyB,EAASK,cAAc,CAACjC,EAAG,IAAI,CAACE,YAAY,qBAAqBF,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASK,gBAAiBtB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQyB,EAASM,eAAe,CAAClC,EAAG,IAAI,CAACE,YAAY,qBAAqBF,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASM,QAAQ,CAAEC,MAAO,KAAOxB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAOwB,EAASO,QAAQ,CAAEC,MAAO,OAAQ,CAACvC,EAAIiB,GAAG,QAAQd,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASM,QAAQ,CAAEC,MAAO,KAAOxB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAOwB,EAASO,QAAQ,CAAEC,MAAO,OAAQ,CAACvC,EAAIiB,GAAG,QAAQd,EAAG,SAAS,CAACE,YAAY,kBAAkB/lB,MAAM,CAAE,YAAa0nB,EAASM,QAAQ,CAAEC,MAAO,KAAOxB,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAOwB,EAASO,QAAQ,CAAEC,MAAO,OAAQ,CAACvC,EAAIiB,GAAG,iBAAiBd,EAAG,iBAAiB,CAACE,YAAY,gBAAgBU,MAAM,CAAC,OAASf,EAAI2B,WAAW,SAASxB,EAAG,MAAM,CAACE,YAAY,yBAAyB,CAACF,EAAG,SAAS,CAACE,YAAY,sBAAsBU,MAAM,CAAC,KAAO,UAAUT,GAAG,CAAC,MAAQN,EAAIS,WAAW,CAACN,EAAG,IAAI,CAACE,YAAY,gBAAgBL,EAAIiB,GAAG,aAAajB,EAAIkB,GAAGlB,EAAImB,GAAG,yBAAyB,iBAAiB,MACl5DqB,EAAkB,G;;;;;;ACKtB,SAASC,EAAmBC,GAC1B,OAAOC,EAAmBD,IAAQE,EAAiBF,IAAQG,IAG7D,SAASF,EAAmBD,GAC1B,GAAIvuB,MAAMC,QAAQsuB,GAAM,CACtB,IAAK,IAAIpsB,EAAI,EAAGwsB,EAAO,IAAI3uB,MAAMuuB,EAAI50B,QAASwI,EAAIosB,EAAI50B,OAAQwI,IAAKwsB,EAAKxsB,GAAKosB,EAAIpsB,GAEjF,OAAOwsB,GAIX,SAASF,EAAiBG,GACxB,GAAI/lB,OAAOgmB,YAAY33B,OAAO03B,IAAkD,uBAAzC13B,OAAO2T,UAAUjP,SAASkM,KAAK8mB,GAAgC,OAAO5uB,MAAM4d,KAAKgR,GAG1H,SAASF,IACP,MAAM,IAAIn4B,UAAU,mDAGtB,SAASu4B,EAAavY,EAAOjgB,GAC3B,IAAIy4B,EAAmBxY,EAAMI,UACzBiH,EAAOmR,EAAiBnR,KACxBC,EAAKkR,EAAiBlR,GACtBmR,EAAQ,GACZzY,EAAM5D,IAAIsc,aAAarR,EAAMC,GAAI,SAAUllB,GACzCq2B,EAAQ,GAAG3zB,OAAOizB,EAAmBU,GAAQV,EAAmB31B,EAAKq2B,WAEvE,IAAIE,EAAOF,EAAM9kB,MAAK,SAAUilB,GAC9B,OAAOA,EAAS74B,KAAKd,OAASc,EAAKd,QAGrC,OAAI05B,EACKA,EAAKtC,MAGP,GAGT,SAASwC,IACP,IAAI1c,EAAO/c,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAC3EW,EAAOX,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAE/E,IAAK+c,IAASpc,EACZ,OAAO,EAGT,IAAIioB,EAAQ7L,EAAKhT,OAAO2vB,WAAW3c,EAAK4c,cAExC,IAAK/Q,EAAM5lB,KACT,OAAO,EAGT,IAAI42B,EAAOhR,EAAM5lB,KAAKq2B,MAAM9kB,MAAK,SAAUglB,GACzC,OAAOA,EAAK54B,OAASA,KAGvB,IAAKi5B,EACH,OAAO,EAGT,IAAIC,EAAa9c,EAAKzW,QAClBwzB,EAAW/c,EAAK6L,QAAUA,EAAMhiB,OAChCmzB,EAAWF,EAAa,EACxBG,EAASF,EAAWlR,EAAM5lB,KAAKghB,SAEnC,MAAO6V,EAAa,GAAKD,EAAKK,QAAQld,EAAKhT,OAAOnF,MAAMi1B,EAAa,GAAGR,OACtEQ,GAAc,EACdC,GAAY/c,EAAKhT,OAAOnF,MAAMi1B,GAAY7V,SAG5C,MAAO+V,EAAWhd,EAAKhT,OAAOmV,YAAc0a,EAAKK,QAAQld,EAAKhT,OAAOnF,MAAMm1B,GAAUV,OACnFW,GAAUjd,EAAKhT,OAAOnF,MAAMm1B,GAAU/V,SACtC+V,GAAY,EAGd,MAAO,CACL9R,KAAM6R,EACN5R,GAAI8R,GAIR,SAASE,EAAatZ,EAAOjgB,GAC3B,IAAIy4B,EAAmBxY,EAAMI,UACzBiH,EAAOmR,EAAiBnR,KACxB9G,EAAQiY,EAAiBjY,MACzB+G,EAAKkR,EAAiBlR,GACtB1K,EAAQ4b,EAAiB5b,MAE7B,OAAIA,IACO7c,EAAKs5B,QAAQrZ,EAAMuZ,aAAehZ,EAAMkY,WAG1CzY,EAAM5D,IAAIod,aAAanS,EAAMC,EAAIvnB,GAS5C,SAAS05B,EAAazZ,EAAOjgB,GAC3B,IAAIs2B,EAAQj3B,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAE5Es6B,EAAY,SAAmBt3B,GACjC,OAAOA,EAAKrC,OAASA,GAGnBqC,EAAO,oCAAuBrC,EAAvB,CAA6BigB,EAAMI,YAAc,4BAAesZ,EAAf,CAA0B1Z,EAAMI,WAE5F,OAAKzf,OAAOyJ,KAAKisB,GAAOjzB,QAAWhB,EAI5BA,EAAKA,KAAKu3B,UAAU55B,EAAMs2B,KAHtBj0B,E,4BC7Fb,SAAS,EAAmB41B,GAC1B,OAAO,EAAmBA,IAAQ,EAAiBA,IAAQ,IAG7D,SAAS,EAAmBA,GAC1B,GAAIvuB,MAAMC,QAAQsuB,GAAM,CACtB,IAAK,IAAIpsB,EAAI,EAAGwsB,EAAO,IAAI3uB,MAAMuuB,EAAI50B,QAASwI,EAAIosB,EAAI50B,OAAQwI,IAAKwsB,EAAKxsB,GAAKosB,EAAIpsB,GAEjF,OAAOwsB,GAIX,SAAS,EAAiBC,GACxB,GAAI/lB,OAAOgmB,YAAY33B,OAAO03B,IAAkD,uBAAzC13B,OAAO2T,UAAUjP,SAASkM,KAAK8mB,GAAgC,OAAO5uB,MAAM4d,KAAKgR,GAG1H,SAAS,IACP,MAAM,IAAIr4B,UAAU,mDAGtB,SAAS45B,EAAgB5R,EAAO/gB,EAAK+Y,GACnC,IAAIyY,EAAQ,GAUZ,OATAzY,EAAM5D,IAAIsc,aAAa1Q,EAAO/gB,GAAK,SAAU7E,EAAM4a,GACjDyb,EAAQ,GAAG3zB,OAAO,EAAmB2zB,GAAQ,EAAmBr2B,EAAKq2B,MAAMxzB,KAAI,SAAU0zB,GACvF,MAAO,CACL3Q,MAAOhL,EACP/V,IAAK+V,EAAM5a,EAAKghB,SAChBuV,KAAMA,WAILF,EAGT,SAASoB,EAAeC,EAAQC,EAAUC,GACxC,OAAO,IAAI,eAAUF,GAAQ,SAAU9Z,EAAOva,EAAOuiB,EAAO/gB,GAC1D,IAAIovB,EAAQ2D,aAAoBC,SAAWD,EAASv0B,GAASu0B,EACzDrZ,EAAKX,EAAMW,GACXxZ,EAAI1B,EAAMrC,OAAS,EACnB82B,EAAUjzB,EACVkzB,EAAYnS,EAEhB,GAAIviB,EAAM0B,GAAI,CACZ,IAAIizB,EAAapS,EAAQviB,EAAM,GAAG40B,QAAQ50B,EAAM0B,EAAI,IAChDmzB,EAAWF,EAAa30B,EAAM0B,EAAI,GAAG/D,OACrCm3B,EAAYH,EAAa30B,EAAM0B,EAAI,GAAGqzB,YAAY/0B,EAAM0B,IACxDszB,EAAUF,EAAY90B,EAAM0B,GAAG/D,OAC/Bs3B,EAAgBd,EAAgB5R,EAAO/gB,EAAK+Y,GAAO/H,QAAO,SAAUvB,GACtE,IAAIikB,EAAWjkB,EAAKiiB,KAAK54B,KAAK46B,SAC9B,OAAOA,EAAShnB,MAAK,SAAU5T,GAC7B,OAAOA,EAAKd,OAAS86B,EAAS96B,WAE/BgZ,QAAO,SAAUvB,GAClB,OAAOA,EAAKzP,IAAMmzB,KAGpB,GAAIM,EAAct3B,OAChB,OAAO,EAGLq3B,EAAUH,GACZ3Z,EAAGpgB,OAAOk6B,EAASH,GAGjBC,EAAYH,GACdzZ,EAAGpgB,OAAO65B,EAAYG,GAGxBJ,EAAYC,EACZF,EAAUC,EAAY10B,EAAM0B,GAAG/D,OAKjC,OAFAud,EAAGia,QAAQT,EAAWD,EAASH,EAASn7B,OAAOy3B,IAC/C1V,EAAGka,iBAAiBd,GACbpZ,KAiBX,SAASma,EAAWhB,EAAQ/5B,EAAMi6B,GAChC,IAAI3X,EAAU,SAASA,EAAQ0Y,GAC7B,IAAIC,EAAQ,GA+BZ,OA9BAD,EAASj6B,SAAQ,SAAUkD,GACzB,GAAIA,EAAMi3B,OAAQ,CAChB,IAEIx1B,EAFA7C,EAAOoB,EAAMpB,KACboa,EAAM,EAGV,GAGE,GAFAvX,EAAQq0B,EAAOx0B,KAAK1C,GAEhB6C,EAAO,CACT,IAAIuiB,EAAQviB,EAAMC,MACduB,EAAM+gB,EAAQviB,EAAM,GAAGrC,OACvBizB,EAAQ2D,aAAoBC,SAAWD,EAASv0B,EAAM,IAAMu0B,EAE5DhS,EAAQ,GACVgT,EAAM13B,KAAKU,EAAMk3B,IAAIle,EAAKgL,IAG5BgT,EAAM13B,KAAKU,EAAMk3B,IAAIlT,EAAO/gB,GAAK0xB,KAAK54B,EAAKnB,OAAOy3B,GAAO8E,SAASn3B,EAAMy0B,SACxEzb,EAAM/V,SAEDxB,GAELuX,EAAMpa,EAAKQ,QACb43B,EAAM13B,KAAKU,EAAMk3B,IAAIle,SAGvBge,EAAM13B,KAAKU,EAAM6vB,KAAKxR,EAAQre,EAAM0Y,cAGjC,cAAS0e,UAAUJ,IAG5B,OAAO,IAAI,YAAO,CAChBlsB,MAAO,CACLusB,gBAAiB,SAAyB/uB,GACxC,OAAO,IAAI,WAAM+V,EAAQ/V,EAAMoQ,SAAUpQ,EAAMgvB,UAAWhvB,EAAMivB,aAMxE,SAASC,EAAe1B,EAAQ/5B,EAAMi6B,GACpC,IAAI3X,EAAU,SAASA,EAAQ0Y,GAC7B,IAAIC,EAAQ,GAqCZ,OApCAD,EAASj6B,SAAQ,SAAUkD,GACzB,GAAIA,EAAMi3B,OAAQ,CAChB,IAGIx1B,EAHA7C,EAAOoB,EAAMpB,KACb61B,EAAQz0B,EAAMy0B,MACdzb,EAAM,EAENye,IAAWhD,EAAMxgB,QAAO,SAAU/S,GACpC,MAAuB,SAAhBA,EAAEnF,KAAKd,QACb,GAEH,OAAQw8B,GAA0C,QAA/Bh2B,EAAQq0B,EAAOx0B,KAAK1C,IACrC,GAAI6C,EAAM,GAAI,CACZ,IAAIuiB,EAAQviB,EAAMC,MACduB,EAAM+gB,EAAQviB,EAAM,GAAGrC,OACvBm3B,EAAYvS,EAAQviB,EAAM,GAAG40B,QAAQ50B,EAAM,IAC3Cg1B,EAAUF,EAAY90B,EAAM,GAAGrC,OAC/BizB,EAAQ2D,aAAoBC,SAAWD,EAASv0B,GAASu0B,EAEzDhS,EAAQ,GACVgT,EAAM13B,KAAKU,EAAMk3B,IAAIle,EAAKgL,IAI5BgT,EAAM13B,KAAKU,EAAMk3B,IAAIX,EAAWE,GAAS9B,KAAK54B,EAAKnB,OAAOy3B,GAAO8E,SAASn3B,EAAMy0B,SAChFzb,EAAM/V,EAKN+V,EAAMpa,EAAKQ,QACb43B,EAAM13B,KAAKU,EAAMk3B,IAAIle,SAGvBge,EAAM13B,KAAKU,EAAM6vB,KAAKxR,EAAQre,EAAM0Y,cAGjC,cAAS0e,UAAUJ,IAG5B,OAAO,IAAI,YAAO,CAChBlsB,MAAO,CACLusB,gBAAiB,SAAyB/uB,GACxC,OAAO,IAAI,WAAM+V,EAAQ/V,EAAMoQ,SAAUpQ,EAAMgvB,UAAWhvB,EAAMivB,aAMxE,SAASG,EAAY37B,GACnB,OAAO,SAAUigB,EAAOC,GACtB,IAAIU,EAAKX,EAAMW,GACXP,EAAYJ,EAAMI,UAClBiH,EAAOjH,EAAUiH,KACjBC,EAAKlH,EAAUkH,GACf/G,EAAQH,EAAUG,MAClB3D,EAAQwD,EAAUxD,MAEtB,GAAIA,EAAO,CACT,IAAInd,EAAQo5B,EAAatY,EAAOxgB,GAChCsnB,EAAO5nB,EAAM4nB,KACbC,EAAK7nB,EAAM6nB,GAIb,OADA3G,EAAG+a,WAAWrU,EAAMC,EAAIvnB,GACjBkgB,EAASU,IA+IpB,SAASgb,EAAiB57B,EAAM67B,GAC9B,IAAIvF,EAAQj3B,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAChF,OAAO,SAAU4gB,EAAOC,EAAUC,GAChC,IAAIoX,EAAWmC,EAAazZ,EAAOjgB,EAAMs2B,GAEzC,OAAIiB,EACK,0BAAasE,EAAb,CAAyB5b,EAAOC,EAAUC,GAG5C,0BAAangB,EAAMs2B,EAAnB,CAA0BrW,EAAOC,EAAUC,IAItD,SAAS2b,EAAOz5B,EAAM05B,GACpB,OAAO15B,EAAKrC,OAAS+7B,EAAOd,MAAMtD,aAAet1B,EAAKrC,OAAS+7B,EAAOd,MAAMrD,cAAgBv1B,EAAKrC,OAAS+7B,EAAOd,MAAMe,UAGzH,SAASC,EAAWC,EAAUC,GAC5B,OAAO,SAAUlc,EAAOC,EAAUC,GAChC,IAAI4b,EAAS9b,EAAM8b,OACf1b,EAAYJ,EAAMI,UAClBG,EAAQH,EAAUG,MAClBD,EAAMF,EAAUE,IAChB7gB,EAAQ8gB,EAAM4b,WAAW7b,GAE7B,IAAK7gB,EACH,OAAO,EAGT,IAAI28B,EAAa,6BAAe,SAAUh6B,GACxC,OAAOy5B,EAAOz5B,EAAM05B,KADL,CAEd1b,GAEH,GAAI3gB,EAAM2e,OAAS,GAAKge,GAAc38B,EAAM2e,MAAQge,EAAWhe,OAAS,EAAG,CACzE,GAAIge,EAAWh6B,KAAKrC,OAASk8B,EAC3B,OAAO,0BAAaC,EAAb,CAAuBlc,EAAOC,EAAUC,GAGjD,GAAI2b,EAAOO,EAAWh6B,KAAM05B,IAAWG,EAASI,aAAaD,EAAWh6B,KAAKsa,SAAU,CACrF,IAAIiE,EAAKX,EAAMW,GAOf,OANAA,EAAG2b,cAAcF,EAAWpf,IAAKif,GAE7Bhc,GACFA,EAASU,IAGJ,GAIX,OAAO,wBAAWsb,EAAX,CAAqBjc,EAAOC,EAAUC,IAgBjD,SAASqc,EAAYx8B,EAAMs2B,GACzB,OAAO,SAAUrW,EAAOC,GACtB,IAAIU,EAAKX,EAAMW,GACXP,EAAYJ,EAAMI,UAClBhE,EAAM4D,EAAM5D,IACZiL,EAAOjH,EAAUiH,KACjBC,EAAKlH,EAAUkH,GACf/G,EAAQH,EAAUG,MAClB3D,EAAQwD,EAAUxD,MAEtB,GAAIA,EAAO,CACT,IAAInd,EAAQo5B,EAAatY,EAAOxgB,GAChCsnB,EAAO5nB,EAAM4nB,KACbC,EAAK7nB,EAAM6nB,GAGb,IAAIkV,EAAUpgB,EAAIod,aAAanS,EAAMC,EAAIvnB,GAOzC,OALIy8B,GACF7b,EAAG+a,WAAWrU,EAAMC,EAAIvnB,GAG1B4gB,EAAGia,QAAQvT,EAAMC,EAAIvnB,EAAKnB,OAAOy3B,IAC1BpW,EAASU;;;;;MC3bpB,SAAS8b,EAAQr8B,GAWf,OATEq8B,EADoB,oBAAXnqB,QAAoD,kBAApBA,OAAOgmB,SACtC,SAAUl4B,GAClB,cAAcA,GAGN,SAAUA,GAClB,OAAOA,GAAyB,oBAAXkS,QAAyBlS,EAAIwD,cAAgB0O,QAAUlS,IAAQkS,OAAOgC,UAAY,gBAAkBlU,GAItHq8B,EAAQr8B,GAGjB,SAASs8B,EAAgBC,EAAUC,GACjC,KAAMD,aAAoBC,GACxB,MAAM,IAAI58B,UAAU,qCAIxB,SAAS68B,EAAkBrY,EAAQ1V,GACjC,IAAK,IAAIlD,EAAI,EAAGA,EAAIkD,EAAM1L,OAAQwI,IAAK,CACrC,IAAIkxB,EAAahuB,EAAMlD,GACvBkxB,EAAWC,WAAaD,EAAWC,aAAc,EACjDD,EAAWE,cAAe,EACtB,UAAWF,IAAYA,EAAWG,UAAW,GACjDt8B,OAAOib,eAAe4I,EAAQsY,EAAW76B,IAAK66B,IAIlD,SAASI,EAAaN,EAAaO,EAAYC,GAG7C,OAFID,GAAYN,EAAkBD,EAAYtoB,UAAW6oB,GACrDC,GAAaP,EAAkBD,EAAaQ,GACzCR,EAGT,SAASS,EAAgBj9B,EAAK6B,EAAKN,GAYjC,OAXIM,KAAO7B,EACTO,OAAOib,eAAexb,EAAK6B,EAAK,CAC9BN,MAAOA,EACPo7B,YAAY,EACZC,cAAc,EACdC,UAAU,IAGZ78B,EAAI6B,GAAON,EAGNvB,EAGT,SAASk9B,EAAQC,EAAQC,GACvB,IAAIpzB,EAAOzJ,OAAOyJ,KAAKmzB,GAEvB,GAAI58B,OAAO88B,sBAAuB,CAChC,IAAIC,EAAU/8B,OAAO88B,sBAAsBF,GACvCC,IAAgBE,EAAUA,EAAQzlB,QAAO,SAAU0lB,GACrD,OAAOh9B,OAAOi9B,yBAAyBL,EAAQI,GAAKZ,eAEtD3yB,EAAK9G,KAAKnE,MAAMiL,EAAMszB,GAGxB,OAAOtzB,EAGT,SAASyzB,EAAerZ,GACtB,IAAK,IAAI5Y,EAAI,EAAGA,EAAIxM,UAAUgE,OAAQwI,IAAK,CACzC,IAAIhH,EAAyB,MAAhBxF,UAAUwM,GAAaxM,UAAUwM,GAAK,GAE/CA,EAAI,EACN0xB,EAAQ14B,GAAQ,GAAM9D,SAAQ,SAAUmB,GACtCo7B,EAAgB7Y,EAAQviB,EAAK2C,EAAO3C,OAE7BtB,OAAOm9B,0BAChBn9B,OAAOo9B,iBAAiBvZ,EAAQ7jB,OAAOm9B,0BAA0Bl5B,IAEjE04B,EAAQ14B,GAAQ9D,SAAQ,SAAUmB,GAChCtB,OAAOib,eAAe4I,EAAQviB,EAAKtB,OAAOi9B,yBAAyBh5B,EAAQ3C,OAKjF,OAAOuiB,EAGT,SAASwZ,EAAUC,EAAUC,GAC3B,GAA0B,oBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIl+B,UAAU,sDAGtBi+B,EAAS3pB,UAAY3T,OAAO/B,OAAOs/B,GAAcA,EAAW5pB,UAAW,CACrE1Q,YAAa,CACXjC,MAAOs8B,EACPhB,UAAU,EACVD,cAAc,KAGdkB,GAAYC,EAAgBF,EAAUC,GAG5C,SAASE,EAAgBC,GAIvB,OAHAD,EAAkBz9B,OAAO29B,eAAiB39B,OAAO49B,eAAiB,SAAyBF,GACzF,OAAOA,EAAEx1B,WAAalI,OAAO49B,eAAeF,IAEvCD,EAAgBC,GAGzB,SAASF,EAAgBE,EAAGG,GAM1B,OALAL,EAAkBx9B,OAAO29B,gBAAkB,SAAyBD,EAAGG,GAErE,OADAH,EAAEx1B,UAAY21B,EACPH,GAGFF,EAAgBE,EAAGG,GAG5B,SAASC,EAAuBC,GAC9B,QAAa,IAATA,EACF,MAAM,IAAI9+B,eAAe,6DAG3B,OAAO8+B,EAGT,SAASC,EAA2BD,EAAMntB,GACxC,OAAIA,GAAyB,kBAATA,GAAqC,oBAATA,EAIzCktB,EAAuBC,GAHrBntB,EAMX,SAASqtB,EAAe5G,EAAKpsB,GAC3B,OAAOizB,GAAgB7G,IAAQ8G,GAAsB9G,EAAKpsB,IAAMmzB,KAGlE,SAAS,EAAmB/G,GAC1B,OAAO,EAAmBA,IAAQ,GAAiBA,IAAQ,KAG7D,SAAS,EAAmBA,GAC1B,GAAIvuB,MAAMC,QAAQsuB,GAAM,CACtB,IAAK,IAAIpsB,EAAI,EAAGwsB,EAAO,IAAI3uB,MAAMuuB,EAAI50B,QAASwI,EAAIosB,EAAI50B,OAAQwI,IAAKwsB,EAAKxsB,GAAKosB,EAAIpsB,GAEjF,OAAOwsB,GAIX,SAASyG,GAAgB7G,GACvB,GAAIvuB,MAAMC,QAAQsuB,GAAM,OAAOA,EAGjC,SAAS,GAAiBK,GACxB,GAAI/lB,OAAOgmB,YAAY33B,OAAO03B,IAAkD,uBAAzC13B,OAAO2T,UAAUjP,SAASkM,KAAK8mB,GAAgC,OAAO5uB,MAAM4d,KAAKgR,GAG1H,SAASyG,GAAsB9G,EAAKpsB,GAClC,GAAM0G,OAAOgmB,YAAY33B,OAAOq3B,IAAgD,uBAAxCr3B,OAAO2T,UAAUjP,SAASkM,KAAKymB,GAAvE,CAIA,IAAIgH,EAAO,GACPC,GAAK,EACLC,GAAK,EACLlJ,OAAK10B,EAET,IACE,IAAK,IAAiCk1B,EAA7B2I,EAAKnH,EAAI1lB,OAAOgmB,cAAmB2G,GAAMzI,EAAK2I,EAAGjhB,QAAQ8K,MAAOiW,GAAK,EAG5E,GAFAD,EAAK17B,KAAKkzB,EAAG70B,OAETiK,GAAKozB,EAAK57B,SAAWwI,EAAG,MAE9B,MAAOkL,GACPooB,GAAK,EACLlJ,EAAKlf,EACL,QACA,IACOmoB,GAAsB,MAAhBE,EAAG,WAAmBA,EAAG,YACpC,QACA,GAAID,EAAI,MAAMlJ,GAIlB,OAAOgJ,GAGT,SAAS,KACP,MAAM,IAAIh/B,UAAU,mDAGtB,SAAS++B,KACP,MAAM,IAAI/+B,UAAU,wDAGtB,SAASo/B,GAAWC,GAClB,OAAOA,EAAIz9B,QAAQ,uBAAuB,SAAU09B,EAAM55B,GACxD,OAAiB,IAAVA,EAAc45B,EAAKh1B,cAAgBg1B,EAAKjK,iBAC9CzzB,QAAQ,OAAQ,IAGrB,IAAI,GAEJ,WACE,SAAS29B,EAAcrvB,EAAWsvB,GAChC,IAAIvI,EAASuI,EAAKvI,OACdwI,EAAYD,EAAKC,UACjBt2B,EAASq2B,EAAKr2B,OACd/G,EAAOo9B,EAAKp9B,KACZ8d,EAAOsf,EAAKtf,KACZd,EAAcogB,EAAKpgB,YACnBsgB,EAASF,EAAKE,OAElBhD,EAAgBl7B,KAAM+9B,GAEtB/9B,KAAK0O,UAAYA,EACjB1O,KAAKy1B,OAASA,EACdz1B,KAAKi+B,UAAYA,EACjBj+B,KAAK2H,OAASA,EACd3H,KAAKY,KAAOA,EACZZ,KAAK0e,KAAOA,EACZ1e,KAAK4d,YAAcA,EACnB5d,KAAKm+B,SAAWn+B,KAAKY,KAAKq2B,MAC1Bj3B,KAAKo+B,QAAUp+B,KAAKm+B,OACpBn+B,KAAKk+B,OAASl+B,KAAKo+B,OAASp+B,KAAKq+B,WAAaH,EAC9Cl+B,KAAKs+B,eAAgB,EACrBt+B,KAAK+gB,IAAM/gB,KAAKu+B,YAChBv+B,KAAKw+B,WAAax+B,KAAKy+B,GAAGC,MAAMxjB,QA2KlC,OAxKAwgB,EAAaqC,EAAe,CAAC,CAC3Bt9B,IAAK,YACLN,MAAO,WACL,IAAIw+B,EAAQ3+B,KAERqN,EAAY,aAAIuxB,OAAO5+B,KAAK0O,WAC5BpB,EAAQ,CACVmoB,OAAQz1B,KAAKy1B,OACb70B,KAAMZ,KAAKY,KACX8d,KAAM1e,KAAK0e,KACXwf,OAAQ,WACN,OAAOS,EAAMT,UAEftgB,YAAa5d,KAAK4d,YAClBihB,UAAU,EACV79B,QAAShB,KAAKi+B,UAAUj9B,QACxB89B,YAAa,SAAqBjK,GAChC,OAAO8J,EAAMG,YAAYjK,KAY7B,MAR2C,oBAAhC70B,KAAKi+B,UAAU7e,eACxBpf,KAAKof,aAAepf,KAAKi+B,UAAU7e,cAGrCpf,KAAKy+B,GAAK,IAAIpxB,EAAU,CACtB1F,OAAQ3H,KAAK2H,OACbo3B,UAAWzxB,IACV0xB,SACIh/B,KAAKy+B,GAAGQ,MAEhB,CACDx+B,IAAK,SACLN,MAAO,SAAgBS,EAAMgd,GAC3B,OAAIhd,EAAKrC,OAASyB,KAAKY,KAAKrC,OAIxBqC,IAASZ,KAAKY,MAAQZ,KAAK4d,cAAgBA,IAI/C5d,KAAKY,KAAOA,EACZZ,KAAK4d,YAAcA,EACnB5d,KAAKk/B,qBAAqB,CACxBt+B,KAAMA,EACNgd,YAAaA,MAPN,KAWV,CACDnd,IAAK,uBACLN,MAAO,SAA8BmN,GACnC,IAAI6xB,EAASn/B,KAEb,GAAKA,KAAKy+B,GAAGW,OAAb,CAOA,IAAIC,EAAiB,aAAInW,OAAOoW,OAChC,aAAIpW,OAAOoW,QAAS,EACpBngC,OAAOogC,QAAQjyB,GAAOhO,SAAQ,SAAUkgC,GACtC,IAAIC,EAAQrC,EAAeoC,EAAO,GAC9B/+B,EAAMg/B,EAAM,GACZt/B,EAAQs/B,EAAM,GAElBN,EAAOV,GAAGW,OAAO3+B,GAAON,KAI1B,aAAI+oB,OAAOoW,OAASD,KAErB,CACD5+B,IAAK,cACLN,MAAO,SAAqB00B,GAC1B,GAAK70B,KAAK0e,KAAKY,SAAf,CAIA,IAAId,EAAQxe,KAAK0e,KAAKF,MAClBjgB,EAAOyB,KAAKY,KAAKrC,KACjBid,EAAMxb,KAAKk+B,SAEXwB,EAAWrD,EAAe,GAAIr8B,KAAKY,KAAKi0B,MAAO,GAAIA,GAEnD8K,EAAc3/B,KAAKo+B,OAAS5f,EAAMW,GAAG+a,WAAW1e,EAAIqK,KAAMrK,EAAIsK,GAAIvnB,GAAM66B,QAAQ5d,EAAIqK,KAAMrK,EAAIsK,GAAIvnB,EAAKnB,OAAOsiC,IAAalhB,EAAMW,GAAG2b,cAActf,EAAK,KAAMkkB,GACjK1/B,KAAK0e,KAAKD,SAASkhB,MAIpB,CACDl/B,IAAK,iBACLN,MAAO,SAAwBy/B,GAC7B,OAAK5/B,KAAKw+B,aAIFx+B,KAAKw+B,WAAWv4B,SAAS25B,EAAS5c,UAG3C,CACDviB,IAAK,YACLN,MAAO,SAAmBqP,GACxB,IAAIqwB,EAAS7/B,KAEb,GAAwC,oBAA7BA,KAAKi+B,UAAU6B,UACxB,OAAO9/B,KAAKi+B,UAAU6B,UAAUtwB,GAGlC,IAAIuwB,IAAc//B,KAAKi+B,UAAU3D,OAAOyF,UAExC,GAAIA,GAA4B,cAAfvwB,EAAMjR,KAAsB,CAC3C,IAAIyhC,EAAaxwB,EAAMwT,OAAOid,SAAWzwB,EAAMwT,OAAOid,QAAQ,sBAC1DC,EAAoBF,IAAehgC,KAAK+gB,MAAQif,GAAchgC,KAAK+gB,IAAI9a,SAAS+5B,IAEhFE,IACFlgC,KAAKs+B,eAAgB,EACrBvvB,SAAS+K,iBAAiB,WAAW,WACnC+lB,EAAOvB,eAAgB,IACtB,CACD6B,MAAM,KAKZ,IAAIC,EAAwB,SAAf5wB,EAAMjR,KACf8hC,EAAyB,UAAf7wB,EAAMjR,KAChB+hC,EAAuB,QAAf9wB,EAAMjR,KACdgiC,EAAS/wB,EAAMjR,KAAKwF,WAAW,SAA0B,SAAfyL,EAAMjR,KAEpD,QAAIwhC,GAAaQ,GAAUH,GAAUC,GAAWC,IAIzCtgC,KAAKs+B,gBAEb,CACD79B,IAAK,aACLN,MAAO,WACLH,KAAKk/B,qBAAqB,CACxBL,UAAU,MAGb,CACDp+B,IAAK,eACLN,MAAO,WACLH,KAAKk/B,qBAAqB,CACxBL,UAAU,MAGb,CACDp+B,IAAK,aACLN,MAAO,WACL,IAAIqb,EAAMxb,KAAK0e,KAAK8hB,SAASxgC,KAAK+gB,KAC9B0f,EAAczgC,KAAK0e,KAAKF,MAAM5D,IAAIE,QAAQU,GAC1Cvd,EAAQo5B,EAAaoJ,EAAazgC,KAAKY,KAAKrC,MAChD,OAAON,IAER,CACDwC,IAAK,UACLN,MAAO,WACLH,KAAKy+B,GAAGiC,eAIL3C,EAnMT,GAsMI7R,GAEJ,WACE,SAASA,IACPgP,EAAgBl7B,KAAMksB,GAgExB,OA7DAwP,EAAaxP,EAAS,CAAC,CACrBzrB,IAAK,KAELN,MAAO,SAAYqP,EAAOomB,GASxB,OARA51B,KAAK2gC,WAAa3gC,KAAK2gC,YAAc,GAEhC3gC,KAAK2gC,WAAWnxB,KACnBxP,KAAK2gC,WAAWnxB,GAAS,IAG3BxP,KAAK2gC,WAAWnxB,GAAO1N,KAAK8zB,GAErB51B,OAER,CACDS,IAAK,OACLN,MAAO,SAAcqP,GAGnB,IAFA,IAAImvB,EAAQ3+B,KAEH4gC,EAAOhjC,UAAUgE,OAAQ2B,EAAO,IAAI0E,MAAM24B,EAAO,EAAIA,EAAO,EAAI,GAAIC,EAAO,EAAGA,EAAOD,EAAMC,IAClGt9B,EAAKs9B,EAAO,GAAKjjC,UAAUijC,GAG7B7gC,KAAK2gC,WAAa3gC,KAAK2gC,YAAc,GACrC,IAAIG,EAAY9gC,KAAK2gC,WAAWnxB,GAQhC,OANIsxB,GACFA,EAAUxhC,SAAQ,SAAUyhC,GAC1B,OAAOA,EAASpjC,MAAMghC,EAAOp7B,MAI1BvD,OAKR,CACDS,IAAK,MACLN,MAAO,SAAaqP,EAAOomB,GACzB,GAAKh4B,UAAUgE,OAER,CAEL,IAAIk/B,EAAY9gC,KAAK2gC,WAAa3gC,KAAK2gC,WAAWnxB,GAAS,KAEvDsxB,IACElL,EACF51B,KAAK2gC,WAAWnxB,GAASsxB,EAAUrqB,QAAO,SAAUpC,GAClD,OAAOA,IAAOuhB,YAGT51B,KAAK2gC,WAAWnxB,SAX3BxP,KAAK2gC,WAAa,GAgBpB,OAAO3gC,SAIJksB,EAlET,GAqEI8U,GAEJ,WACE,SAASA,IACP,IAAIhgC,EAAUpD,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAElFs9B,EAAgBl7B,KAAMghC,GAEtBhhC,KAAKgB,QAAUq7B,EAAe,GAAIr8B,KAAKihC,eAAgB,GAAIjgC,GAwD7D,OArDA06B,EAAasF,EAAW,CAAC,CACvBvgC,IAAK,OACLN,MAAO,WACL,OAAO,OAER,CACDM,IAAK,aACLN,MAAO,WACL,IAAIs1B,EAAS73B,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KACjFoC,KAAKy1B,OAASA,IAEf,CACDh1B,IAAK,aACLN,MAAO,WACL,MAAO,KAER,CACDM,IAAK,aACLN,MAAO,WACL,MAAO,KAER,CACDM,IAAK,OACLN,MAAO,WACL,MAAO,KAER,CACDM,IAAK,OACL4jB,IAAK,WACH,OAAO,OAER,CACD5jB,IAAK,OACL4jB,IAAK,WACH,MAAO,cAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,OAAO,eAER,CACD5jB,IAAK,iBACL4jB,IAAK,WACH,MAAO,KAER,CACD5jB,IAAK,UACL4jB,IAAK,WACH,MAAO,OAIJ2c,EA9DT,GAiEI,GAEJ,WACE,SAASE,IACP,IAAIC,EAAavjC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GACjF63B,EAAS73B,UAAUgE,OAAS,EAAIhE,UAAU,QAAKkC,EAEnDo7B,EAAgBl7B,KAAMkhC,GAEtBC,EAAW7hC,SAAQ,SAAU2+B,GAC3BA,EAAUmD,WAAW3L,GACrBwI,EAAUrU,UAEZ5pB,KAAKmhC,WAAaA,EA0MpB,OAvMAzF,EAAawF,EAAkB,CAAC,CAC9BzgC,IAAK,UACLN,MAAO,SAAiB69B,GACtB,IAAI1D,EAAS0D,EAAK1D,OACd+G,EAAmBrhC,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GACtD,MAAO,CAAC,aAAa70B,SAAS60B,EAAU1/B,SACvCkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAUr1B,QAChBnF,KAAI,SAAUw6B,GACf,OAAOA,EAAUr1B,KAAK,CACpB0xB,OAAQA,OAGRgH,EAAkBthC,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GACrD,MAAO,CAAC,OAAQ,QAAQ70B,SAAS60B,EAAU1/B,SAC1CkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAUr1B,QAChBnF,KAAI,SAAUw6B,GACf,OAAOA,EAAUr1B,KAAK,CACpBrK,KAAM+7B,EAAO,GAAGh3B,OAAO26B,EAAU1/B,KAAM,MAAM0/B,EAAUxgC,MACvD68B,OAAQA,OAGZ,MAAO,GAAGh3B,OAAO,EAAmB+9B,GAAmB,EAAmBC,IAAkB79B,KAAI,SAAUmF,GACxG,OAAO,oBAAOA,QAGjB,CACDnI,IAAK,aACLN,MAAO,SAAoBq/B,GACzB,IAAIlF,EAASkF,EAAMlF,OACfiH,EAAqB/B,EAAM+B,mBAC/B,KAAMA,aAA8Bt5B,QAAUs5B,EAAoB,MAAO,GACzE,IAAIC,EAAoBD,aAA8Bt5B,MAAQjI,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GAC7F,OAAQsD,EAAmBn4B,SAAS60B,EAAUxgC,SAC3CuC,KAAKmhC,WACNM,EAAsBD,EAAkB/qB,QAAO,SAAUwnB,GAC3D,MAAO,CAAC,aAAa70B,SAAS60B,EAAU1/B,SACvCkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAUyD,cAChBj+B,KAAI,SAAUw6B,GACf,OAAOA,EAAUyD,WAAW,CAC1BpH,OAAQA,OAGRqH,EAAqBH,EAAkB/qB,QAAO,SAAUwnB,GAC1D,MAAO,CAAC,OAAQ,QAAQ70B,SAAS60B,EAAU1/B,SAC1CkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAUyD,cAChBj+B,KAAI,SAAUw6B,GACf,OAAOA,EAAUyD,WAAW,CAC1BnjC,KAAM+7B,EAAO,GAAGh3B,OAAO26B,EAAU1/B,KAAM,MAAM0/B,EAAUxgC,MACvD68B,OAAQA,OAGZ,MAAO,GAAGh3B,OAAO,EAAmBm+B,GAAsB,EAAmBE,IAAqBC,QAAO,SAAUC,EAAeH,GAChI,MAAO,GAAGp+B,OAAO,EAAmBu+B,GAAgB,EAAmBH,MACtE,MAEJ,CACDjhC,IAAK,aACLN,MAAO,SAAoBs/B,GACzB,IAAInF,EAASmF,EAAMnF,OACfiH,EAAqB9B,EAAM8B,mBAC/B,KAAMA,aAA8Bt5B,QAAUs5B,EAAoB,MAAO,GACzE,IAAIC,EAAoBD,aAA8Bt5B,MAAQjI,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GAC7F,OAAQsD,EAAmBn4B,SAAS60B,EAAUxgC,SAC3CuC,KAAKmhC,WACNW,EAAsBN,EAAkB/qB,QAAO,SAAUwnB,GAC3D,MAAO,CAAC,aAAa70B,SAAS60B,EAAU1/B,SACvCkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAU8D,cAChBt+B,KAAI,SAAUw6B,GACf,OAAOA,EAAU8D,WAAW,CAC1BzH,OAAQA,OAGR0H,EAAqBR,EAAkB/qB,QAAO,SAAUwnB,GAC1D,MAAO,CAAC,OAAQ,QAAQ70B,SAAS60B,EAAU1/B,SAC1CkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAU8D,cAChBt+B,KAAI,SAAUw6B,GACf,OAAOA,EAAU8D,WAAW,CAC1BxjC,KAAM+7B,EAAO,GAAGh3B,OAAO26B,EAAU1/B,KAAM,MAAM0/B,EAAUxgC,MACvD68B,OAAQA,OAGZ,MAAO,GAAGh3B,OAAO,EAAmBw+B,GAAsB,EAAmBE,IAAqBJ,QAAO,SAAUK,EAAeF,GAChI,MAAO,GAAGz+B,OAAO,EAAmB2+B,GAAgB,EAAmBF,MACtE,MAEJ,CACDthC,IAAK,WACLN,MAAO,SAAkB+hC,GACvB,IAAI5H,EAAS4H,EAAM5H,OACf5b,EAAOwjB,EAAMxjB,KACjB,OAAO1e,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GACtC,OAAOA,EAAUpI,YAChB+L,QAAO,SAAUO,EAAalE,GAC/B,IAAIxgC,EAAOwgC,EAAUxgC,KACjBc,EAAO0/B,EAAU1/B,KACjBs3B,EAAW,GACX11B,EAAQ89B,EAAUpI,SAASwG,EAAe,CAC5C/B,OAAQA,GACP,CAAC,OAAQ,QAAQlxB,SAAS7K,GAAQ,CACnCA,KAAM+7B,EAAO,GAAGh3B,OAAO/E,EAAM,MAAMd,IACjC,KAEAE,EAAQ,SAAe0W,EAAIwgB,GAC7B,QAAKnW,EAAKY,WAIVZ,EAAK0jB,QACE/tB,EAAGwgB,EAAHxgB,CAAUqK,EAAKF,MAAOE,EAAKD,SAAUC,KAG1C2jB,EAAS,SAAgBC,EAAOC,GAC9Bt6B,MAAMC,QAAQq6B,GAChB1M,EAASyM,GAAS,SAAUzN,GAC1B,OAAO0N,EAAOjjC,SAAQ,SAAUyhC,GAC9B,OAAOpjC,EAAMojC,EAAUlM,OAGA,oBAAX0N,IAChB1M,EAASyM,GAAS,SAAUzN,GAC1B,OAAOl3B,EAAM4kC,EAAQ1N,MAiB3B,MAZuB,WAAnBoG,EAAQ96B,GACVhB,OAAOogC,QAAQp/B,GAAOb,SAAQ,SAAUkjC,GACtC,IAAIC,EAAQrF,EAAeoF,EAAO,GAC9BE,EAAcD,EAAM,GACpBE,EAAeF,EAAM,GAEzBJ,EAAOK,EAAaC,MAGtBN,EAAO5kC,EAAM0C,GAGRk8B,EAAe,GAAI8F,EAAa,GAAItM,KAC1C,MAEJ,CACDp1B,IAAK,QACL4jB,IAAK,WACH,OAAOrkB,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GACtC,MAA0B,SAAnBA,EAAU1/B,QAChBqjC,QAAO,SAAUpI,EAAOoJ,GACzB,IAAInlC,EAAOmlC,EAAMnlC,KACb68B,EAASsI,EAAMtI,OACnB,OAAO+B,EAAe,GAAI7C,EAAOqC,EAAgB,GAAIp+B,EAAM68B,MAC1D,MAEJ,CACD75B,IAAK,UACL4jB,IAAK,WACH,IAAI3F,EAAO1e,KAAK0e,KAChB,OAAO1e,KAAKmhC,WAAWS,QAAO,SAAUpI,EAAOyE,GAC7C,OAAO5B,EAAe,GAAI7C,EAAOqC,EAAgB,GAAIoC,EAAUxgC,KAAM,IAAIolC,MAAM5E,EAAUj9B,QAAS,CAChGhC,IAAK,SAAaJ,EAAKW,EAAMY,GAC3B,IAAI2iC,EAAUlkC,EAAIW,KAAUY,EAO5B,OANAhB,OAAO+H,OAAOtI,EAAKi9B,EAAgB,GAAIt8B,EAAMY,IAEzC2iC,GACF7E,EAAU/c,OAAOxC,IAGZ,SAGV,MAEJ,CACDje,IAAK,QACL4jB,IAAK,WACH,OAAOrkB,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GACtC,MAA0B,SAAnBA,EAAU1/B,QAChBqjC,QAAO,SAAU3K,EAAO8L,GACzB,IAAItlC,EAAOslC,EAAMtlC,KACb68B,EAASyI,EAAMzI,OACnB,OAAO+B,EAAe,GAAIpF,EAAO4E,EAAgB,GAAIp+B,EAAM68B,MAC1D,MAEJ,CACD75B,IAAK,UACL4jB,IAAK,WACH,OAAOrkB,KAAKmhC,WAAW1qB,QAAO,SAAUwnB,GACtC,OAAOA,EAAU10B,WAChBq4B,QAAO,SAAUoB,EAAYC,GAC9B,IAAI15B,EAAU05B,EAAM15B,QACpB,MAAO,GAAGjG,OAAO,EAAmB0/B,GAAa,EAAmBz5B,MACnE,QAIA23B,EArNT,GAwNA,SAASgC,GAAWC,GAEhB,IAAI/gB,EAAQrT,SAASZ,cAAc,SACnCiU,EAAM7jB,KAAO,WACb6jB,EAAMtK,YAAcqrB,EACpB,IAAIC,EAAYr0B,SACZgM,EAAOqoB,EAAUroB,KACjB3L,EAAa2L,EAAK3L,WAElBA,EACF2L,EAAKsoB,aAAajhB,EAAOhT,GAEzB2L,EAAKoH,YAAYC,GAKvB,IAAIkhB,GAEJ,SAAUC,GAGR,SAASD,IACP,IAAItiC,EAAUpD,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAIlF,OAFAs9B,EAAgBl7B,KAAMsjC,GAEfnG,EAA2Bn9B,KAAM48B,EAAgB0G,GAAMvzB,KAAK/P,KAAMgB,IAyB3E,OAhCAw7B,EAAU8G,EAAMC,GAUhB7H,EAAa4H,EAAM,CAAC,CAClB7iC,IAAK,UACLN,MAAO,WACL,OAAO,eAER,CACDM,IAAK,OACL4jB,IAAK,WACH,MAAO,SAER,CACD5jB,IAAK,OACL4jB,IAAK,WACH,OAAO,OAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,OAAO,SAIJif,EAjCT,CAkCEtC,IAEF,SAASwC,KACP,IAAIrjC,EAAQvC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAC5EipB,EAAMjpB,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAC1E6oB,EAAM7oB,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAC9E,OAAOmY,KAAK8Q,IAAI9Q,KAAK0Q,IAAIiN,SAASvzB,EAAO,IAAK0mB,GAAMJ,GAGtD,IAAIgd,GAEJ,SAAUF,GAGR,SAASE,IACP,IAAIziC,EAAUpD,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAIlF,OAFAs9B,EAAgBl7B,KAAMyjC,GAEftG,EAA2Bn9B,KAAM48B,EAAgB6G,GAAM1zB,KAAK/P,KAAMgB,IAyB3E,OAhCAw7B,EAAUiH,EAAMF,GAUhB7H,EAAa+H,EAAM,CAAC,CAClBhjC,IAAK,UACLN,MAAO,WACL,OAAO,eAER,CACDM,IAAK,OACL4jB,IAAK,WACH,MAAO,SAER,CACD5jB,IAAK,OACL4jB,IAAK,WACH,OAAO,OAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,OAAO,SAIJof,EAjCT,CAkCEzC,IAEE0C,GAEJ,SAAUC,GAGR,SAASD,IAGP,OAFAxI,EAAgBl7B,KAAM0jC,GAEfvG,EAA2Bn9B,KAAM48B,EAAgB8G,GAAK/lC,MAAMqC,KAAMpC,YAiB3E,OAtBA4+B,EAAUkH,EAAKC,GAQfjI,EAAagI,EAAK,CAAC,CACjBjjC,IAAK,OACL4jB,IAAK,WACH,MAAO,QAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLnJ,QAAS,cAKRwoB,EAvBT,CAwBED,IAEE,GAEJ,SAAUE,GAGR,SAASC,IAGP,OAFA1I,EAAgBl7B,KAAM4jC,GAEfzG,EAA2Bn9B,KAAM48B,EAAgBgH,GAAWjmC,MAAMqC,KAAMpC,YAiCjF,OAtCA4+B,EAAUoH,EAAWD,GAQrBjI,EAAakI,EAAW,CAAC,CACvBnjC,IAAK,WACLN,MAAO,SAAkB69B,GACvB,IAAIz/B,EAAOy/B,EAAKz/B,KAChB,OAAO,WACL,OAAO,0BAAaA,MAGvB,CACDkC,IAAK,OACL4jB,IAAK,WACH,MAAO,cAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLnJ,QAAS,UACT2oB,MAAO,QACP9D,WAAW,EACX+D,SAAU,CAAC,CACT70B,IAAK,MAEP80B,MAAO,WACL,MAAO,CAAC,IAAK,SAMdH,EAvCT,CAwCEH,IAEEO,GAEJ,SAAUL,GAGR,SAASK,IAGP,OAFA9I,EAAgBl7B,KAAMgkC,GAEf7G,EAA2Bn9B,KAAM48B,EAAgBoH,GAAMrmC,MAAMqC,KAAMpC,YAiB5E,OAtBA4+B,EAAUwH,EAAML,GAQhBjI,EAAasI,EAAM,CAAC,CAClBvjC,IAAK,OACL4jB,IAAK,WACH,MAAO,SAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLwf,MAAO,cAKNG,EAvBT,CAwBEP,IAEEN,GAAM,+6BAEN,GAEJ,SAAUc,GAGR,SAASC,IACP,IAAIvF,EAEA39B,EAAUpD,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAoClF,OAlCAs9B,EAAgBl7B,KAAMkkC,GAEtBvF,EAAQxB,EAA2Bn9B,KAAM48B,EAAgBsH,GAAQn0B,KAAK/P,OACtE2+B,EAAMsC,eAAiB,CACrBkD,YAAa,GACb7kB,UAAU,EACV8kB,UAAW,KACXjD,WAAY,GACZjmB,QAAS,GACTmpB,QAAS,MACTC,cAAe,CACb/lC,KAAM,MACN2c,QAAS,CAAC,CACR3c,KAAM,eAGVgmC,sBAAsB,EACtBC,mBAAmB,EACnBC,mBAAmB,EACnBrkB,WAAY,GACZskB,aAAc,GACdxB,WAAW,EACXyB,OAAQ,aACRC,cAAe,aACfC,SAAU,aACVC,QAAS,aACTC,OAAQ,aACRC,QAAS,aACTC,OAAQ,cAEVtG,EAAMxX,OAAS,CAAC,OAAQ,cAAe,SAAU,QAAS,OAAQ,QAAS,QAE3EwX,EAAM/U,KAAK5oB,GAEJ29B,EAqgBT,OA9iBAnC,EAAU0H,EAAQD,GA4ClBvI,EAAawI,EAAQ,CAAC,CACpBzjC,IAAK,OACLN,MAAO,WACL,IAAIg/B,EAASn/B,KAETgB,EAAUpD,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAClFoC,KAAKklC,WAAW7I,EAAe,GAAIr8B,KAAKihC,eAAgB,GAAIjgC,IAC5DhB,KAAKmlC,SAAU,EACfnlC,KAAK4e,UAAY,CACfiH,KAAM,EACNC,GAAI,GAEN9lB,KAAKsX,QAAUvI,SAASZ,cAAc,OACtCnO,KAAKmhC,WAAanhC,KAAKolC,mBACvBplC,KAAKw5B,MAAQx5B,KAAKqlC,cAClBrlC,KAAKi3B,MAAQj3B,KAAKslC,cAClBtlC,KAAKs6B,OAASt6B,KAAKulC,eACnBvlC,KAAKuJ,QAAUvJ,KAAKwlC,gBACpBxlC,KAAKylC,QAAUzlC,KAAK0lC,gBACpB1lC,KAAK0hC,WAAa1hC,KAAK2lC,mBACvB3lC,KAAK+hC,WAAa/hC,KAAK4lC,mBACvB5lC,KAAK0e,KAAO1e,KAAK6lC,aACjB7lC,KAAK61B,SAAW71B,KAAK8lC,iBACrB9lC,KAAK+lC,yBAED/lC,KAAKgB,QAAQkiC,WACfA,GAAUC,IAGmB,OAA3BnjC,KAAKgB,QAAQojC,WACfpkC,KAAKoiC,MAAMpiC,KAAKgB,QAAQojC,WAG1BpkC,KAAKmnB,OAAO7nB,SAAQ,SAAU7B,GAC5B0hC,EAAO/K,GAAG32B,EAAM0hC,EAAOn+B,QAAQ48B,GAAU,MAAMt6B,OAAO7F,MAAW,iBAEnEuC,KAAKgmC,KAAK,OAAQ,CAChBtnB,KAAM1e,KAAK0e,KACXF,MAAOxe,KAAKwe,QAGdxe,KAAKmhC,WAAWziB,KAAO1e,KAAK0e,OAE7B,CACDje,IAAK,aACLN,MAAO,SAAoBa,GACzBhB,KAAKgB,QAAUq7B,EAAe,GAAIr8B,KAAKgB,QAAS,GAAIA,GAEhDhB,KAAK0e,MAAQ1e,KAAKwe,OACpBxe,KAAK0e,KAAKunB,YAAYjmC,KAAKwe,SAG9B,CACD/d,IAAK,mBACLN,MAAO,WACL,OAAO,IAAI,GAAiB,GAAGmD,OAAO,EAAmBtD,KAAKkmC,mBAAoB,EAAmBlmC,KAAKgB,QAAQmgC,aAAcnhC,QAEjI,CACDS,IAAK,gBACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAW53B,UAExB,CACD9I,IAAK,gBACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAWsE,QAAQ,CAC7BnL,OAAQt6B,KAAKs6B,WAGhB,CACD75B,IAAK,mBACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAWO,WAAW,CAChCpH,OAAQt6B,KAAKs6B,OACbiH,mBAAoBvhC,KAAKgB,QAAQwjC,sBAGpC,CACD/jC,IAAK,mBACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAWY,WAAW,CAChCzH,OAAQt6B,KAAKs6B,OACbiH,mBAAoBvhC,KAAKgB,QAAQyjC,sBAGpC,CACDhkC,IAAK,iBACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAWtL,SAAS,CAC9ByE,OAAQt6B,KAAKs6B,OACb5b,KAAM1e,KAAK0e,SAGd,CACDje,IAAK,cACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAW3H,QAExB,CACD/4B,IAAK,cACLN,MAAO,WACL,OAAOH,KAAKmhC,WAAWlK,QAExB,CACDx2B,IAAK,eACLN,MAAO,WACL,OAAO,IAAI,YAAO,CAChBkkC,QAASrkC,KAAKgB,QAAQqjC,QACtB7K,MAAOx5B,KAAKw5B,MACZvC,MAAOj3B,KAAKi3B,UAGf,CACDx2B,IAAK,cACLN,MAAO,WACL,IAAI0/B,EAAS7/B,KAEb,OAAO,iBAAY5C,OAAO,CACxBk9B,OAAQt6B,KAAKs6B,OACb1f,IAAK5a,KAAKmmC,eAAenmC,KAAKgB,QAAQka,SACtC3R,QAAS,GAAGjG,OAAO,EAAmBtD,KAAKuJ,SAAU,CAAC,wBAAW,CAC/DkB,MAAOzK,KAAK0hC,cACT,EAAmB1hC,KAAK+hC,YAAa,EAAmB/hC,KAAKylC,SAAU,CAAC,oBAAO,CAClFW,UAAW,qBACT,oBAAO,iBAAa,wBAAWpmC,KAAKgB,QAAQof,YAAa,yBAAa,IAAI,YAAO,CACnF3f,IAAK,IAAI,eAAU,YACnB6M,MAAO,CACLgS,SAAU,WACR,OAAOugB,EAAO7+B,QAAQse,aAGxB,IAAI,YAAO,CACbhS,MAAO,CACL0C,WAAY,CACVq2B,SAAU,GAEZC,gBAAiB,CACflE,MAAO,SAAe1jB,EAAMlP,GAC1BqwB,EAAOsF,SAAU,EAEjBtF,EAAOmG,KAAK,QAAS,CACnBx2B,MAAOA,EACPgP,MAAOE,EAAKF,MACZE,KAAMA,IAGR,IAAIihB,EAAcE,EAAOrhB,MAAMW,GAAGkK,QAAQ,WAAW,GAErDwW,EAAOnhB,KAAKD,SAASkhB,IAEvB4G,KAAM,SAAc7nB,EAAMlP,GACxBqwB,EAAOsF,SAAU,EAEjBtF,EAAOmG,KAAK,OAAQ,CAClBx2B,MAAOA,EACPgP,MAAOE,EAAKF,MACZE,KAAMA,IAGR,IAAIihB,EAAcE,EAAOrhB,MAAMW,GAAGkK,QAAQ,WAAW,GAErDwW,EAAOnhB,KAAKD,SAASkhB,QAIzB,IAAI,YAAO,CACbryB,MAAOtN,KAAKgB,QAAQmjC,oBAIzB,CACD1jC,IAAK,iBACLN,MAAO,SAAwB+a,GAC7B,IAAIwpB,EAAe9mC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAKoC,KAAKgB,QAAQ0jC,aAEpG,GAAgB,OAAZxpB,EACF,OAAOlb,KAAKs6B,OAAOkM,aAAaxmC,KAAKgB,QAAQsjC,eAG/C,GAAyB,WAArBrJ,EAAQ/f,GACV,IACE,OAAOlb,KAAKs6B,OAAOkM,aAAatrB,GAChC,MAAO3K,GAEP,OADA3C,QAAQC,KAAK,kCAAmC,gBAAiBqN,EAAS,SAAU3K,GAC7EvQ,KAAKs6B,OAAOkM,aAAaxmC,KAAKgB,QAAQsjC,eAIjD,GAAuB,kBAAZppB,EAAsB,CAC/B,IAAI5D,EAAUvI,SAASZ,cAAc,OAErC,OADAmJ,EAAQhJ,UAAY4M,EAAQurB,OACrB,eAAUC,WAAW1mC,KAAKs6B,QAAQqM,MAAMrvB,EAASotB,GAG1D,OAAO,IAER,CACDjkC,IAAK,aACLN,MAAO,WACL,IAAIymC,EAAS5mC,KAEb,OAAO,IAAI,gBAAWA,KAAKsX,QAAS,CAClCkH,MAAOxe,KAAK6mC,cACZC,YAAa,WACX,IAAK,IAAIlG,EAAOhjC,UAAUgE,OAAQ2B,EAAO,IAAI0E,MAAM24B,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/Et9B,EAAKs9B,GAAQjjC,UAAUijC,GAGzB+F,EAAOZ,KAAKroC,MAAMipC,EAAQ,CAAC,SAAStjC,OAAOC,KAE7CwjC,WAAY,WACV,IAAK,IAAIC,EAAQppC,UAAUgE,OAAQ2B,EAAO,IAAI0E,MAAM++B,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpF1jC,EAAK0jC,GAASrpC,UAAUqpC,GAG1BL,EAAOZ,KAAKroC,MAAMipC,EAAQ,CAAC,QAAQtjC,OAAOC,KAE5C2jC,oBAAqBlnC,KAAKknC,oBAAoBluB,KAAKhZ,UAGtD,CACDS,IAAK,qBACLN,MAAO,WACL,IAAIuO,EAAY9Q,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAE/E8Q,GAIL1O,KAAK0e,KAAKyoB,SAAS,CACjBC,UAAWpnC,KAAKqnC,cAAc,CAC5B1/B,OAAQ+G,EACRyyB,WAAY,GAAG79B,OAAO,EAAmBtD,KAAKkmC,mBAAoB,EAAmBlmC,KAAKgB,QAAQmgC,mBAIvG,CACD1gC,IAAK,gBACLN,MAAO,SAAuB69B,GAC5B,IAAIsJ,EAAStnC,KAET2H,EAASq2B,EAAKr2B,OACdw5B,EAAanD,EAAKmD,WACtB,OAAOA,EAAW1qB,QAAO,SAAUwnB,GACjC,MAAO,CAAC,OAAQ,QAAQ70B,SAAS60B,EAAU1/B,SAC1CkY,QAAO,SAAUwnB,GAClB,OAAOA,EAAUvf,QAChBkjB,QAAO,SAAUwF,EAAWnJ,GAC7B,IAAIsJ,EAAW,SAAkB3mC,EAAM8d,EAAMwf,EAAQtgB,GACnD,IAAIlP,EAAYuvB,EAAUvf,KAC1B,OAAO,IAAI,GAAchQ,EAAW,CAClC+mB,OAAQ6R,EACRrJ,UAAWA,EACXt2B,OAAQA,EACR/G,KAAMA,EACN8d,KAAMA,EACNwf,OAAQA,EACRtgB,YAAaA,KAIjB,OAAOye,EAAe,GAAI+K,EAAWvL,EAAgB,GAAIoC,EAAUxgC,KAAM8pC,MACxE,MAEJ,CACD9mC,IAAK,sBACLN,MAAO,SAA6Bw/B,GAClC,IAAIzU,EAAWlrB,KAAKwe,MAAM7gB,MAAMgiC,GAChC3/B,KAAK0e,KAAKunB,YAAY/a,GACtBlrB,KAAK4e,UAAY,CACfiH,KAAM7lB,KAAKwe,MAAMI,UAAUiH,KAC3BC,GAAI9lB,KAAKwe,MAAMI,UAAUkH,IAE3B9lB,KAAK+lC,yBACL/lC,KAAKgmC,KAAK,cAAe,CACvBwB,QAASxnC,KAAKwnC,QAAQxuB,KAAKhZ,MAC3BynC,QAASznC,KAAKynC,QAAQzuB,KAAKhZ,MAC3Bwe,MAAOxe,KAAKwe,MACZmhB,YAAaA,IAGVA,EAAY/W,aAAc+W,EAAY5X,QAAQ,kBAInD/nB,KAAK0nC,WAAW/H,KAEjB,CACDl/B,IAAK,aACLN,MAAO,SAAoBw/B,GACzB3/B,KAAKgmC,KAAK,SAAU,CAClBwB,QAASxnC,KAAKwnC,QAAQxuB,KAAKhZ,MAC3BynC,QAASznC,KAAKynC,QAAQzuB,KAAKhZ,MAC3Bwe,MAAOxe,KAAKwe,MACZmhB,YAAaA,MAGhB,CACDl/B,IAAK,mBACLN,MAAO,WACL,IAAI4J,EAAWnM,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAEnF,GAAIoC,KAAK4e,WAA0B,OAAb7U,EACpB,OAAO/J,KAAK4e,UAGd,GAAiB,UAAb7U,IAAqC,IAAbA,EAC1B,MAAO,CACL8b,KAAM,EACNC,GAAI,GAIR,GAAiB,QAAb/b,EAAoB,CACtB,IAAI6Q,EAAM5a,KAAKwe,MAAM5D,IACrB,MAAO,CACLiL,KAAMjL,EAAIM,QAAQysB,KAClB7hB,GAAIlL,EAAIM,QAAQysB,MAIpB,MAAO,CACL9hB,KAAM9b,EACN+b,GAAI/b,KAGP,CACDtJ,IAAK,QACLN,MAAO,WACL,IAAIynC,EAAS5nC,KAET+J,EAAWnM,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAEnF,KAAIoC,KAAK0e,KAAKymB,SAAwB,OAAbp7B,IAAkC,IAAbA,GAA9C,CAIA,IAAI89B,EAAwB7nC,KAAK8nC,iBAAiB/9B,GAC9C8b,EAAOgiB,EAAsBhiB,KAC7BC,EAAK+hB,EAAsB/hB,GAE/B9lB,KAAKof,aAAayG,EAAMC,GACxBhD,YAAW,WACT,OAAO8kB,EAAOlpB,KAAK0jB,UAClB,OAEJ,CACD3hC,IAAK,eACLN,MAAO,WACL,IAAI0lB,EAAOjoB,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAC3EkoB,EAAKloB,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EACzEmqC,EAAc/nC,KAAKwe,MACnB5D,EAAMmtB,EAAYntB,IAClBuE,EAAK4oB,EAAY5oB,GACjB6oB,EAAexE,GAAO3d,EAAM,EAAGjL,EAAIM,QAAQysB,MAC3CM,EAAczE,GAAO1d,EAAI,EAAGlL,EAAIM,QAAQysB,MACxC/oB,EAAY,mBAAcxhB,OAAOwd,EAAKotB,EAAcC,GACpDtI,EAAcxgB,EAAGC,aAAaR,GAClC5e,KAAK0e,KAAKD,SAASkhB,KAEpB,CACDl/B,IAAK,OACLN,MAAO,WACLH,KAAK0e,KAAKqC,IAAIwlB,SAEf,CACD9lC,IAAK,gBACLN,MAAO,WACL,OAAO8B,KAAK0kC,MAAM1kC,KAAKC,UAAU,CAC/Bs3B,MAAOx5B,KAAKmhC,WAAW3H,MACvBvC,MAAOj3B,KAAKmhC,WAAWlK,WAG1B,CACDx2B,IAAK,UACLN,MAAO,WACL,IAAI+nC,EAAMn5B,SAASZ,cAAc,OAC7BorB,EAAW,mBAAcmN,WAAW1mC,KAAKs6B,QAAQ6N,kBAAkBnoC,KAAKwe,MAAM5D,IAAIM,SAEtF,OADAgtB,EAAI/lB,YAAYoX,GACT2O,EAAI55B,YAEZ,CACD7N,IAAK,UACLN,MAAO,WACL,OAAOH,KAAKwe,MAAM5D,IAAIW,WAEvB,CACD9a,IAAK,aACLN,MAAO,WACL,IAAI+a,EAAUtd,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAC9E8pC,EAAa9pC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,IAAmBA,UAAU,GAC5E8mC,EAAe9mC,UAAUgE,OAAS,EAAIhE,UAAU,QAAKkC,EACrDsoC,EAAepoC,KAAKwe,MACpB5D,EAAMwtB,EAAaxtB,IACnBuE,EAAKipB,EAAajpB,GAClBpQ,EAAW/O,KAAKmmC,eAAejrB,EAASwpB,GACxC9lB,EAAY,mBAAcxhB,OAAOwd,EAAK,EAAGA,EAAIM,QAAQysB,MACrDhI,EAAcxgB,EAAGC,aAAaR,GAAWypB,qBAAqBt5B,GAAU,GAAOsa,QAAQ,iBAAkBqe,GAC7G1nC,KAAK0e,KAAKD,SAASkhB,KAEpB,CACDl/B,IAAK,eACLN,MAAO,WACL,IAAIunC,EAAa9pC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,IAAmBA,UAAU,GAChFoC,KAAKsoC,WAAWtoC,KAAKgB,QAAQsjC,cAAeoD,KAE7C,CACDjnC,IAAK,yBACLN,MAAO,WACL,IAAIooC,EAASvoC,KAEbA,KAAKwoC,YAAcrpC,OAAOogC,QAAQv/B,KAAKs6B,OAAOrD,OAAO2K,QAAO,SAAU3K,EAAOuI,GAC3E,IAAIC,EAAQrC,EAAeoC,EAAO,GAC9B/hC,EAAOgiC,EAAM,GACbtI,EAAOsI,EAAM,GAEjB,OAAOpD,EAAe,GAAIpF,EAAO4E,EAAgB,GAAIp+B,GAAM,WACzD,IAAIo3B,EAAQj3B,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAChF,OAAOk6B,EAAayQ,EAAO/pB,MAAO2Y,EAAMtC,SAEzC,IACH70B,KAAKyoC,gBAAkBtpC,OAAOogC,QAAQv/B,KAAKs6B,OAAOrD,OAAO2K,QAAO,SAAU3K,EAAOiL,GAC/E,IAAIM,EAAQpF,EAAe8E,EAAO,GAC9BzkC,EAAO+kC,EAAM,GACbrL,EAAOqL,EAAM,GAEjB,OAAOnG,EAAe,GAAIpF,EAAO4E,EAAgB,GAAIp+B,EAAMs5B,EAAawR,EAAO/pB,MAAO2Y,OACrF,IACHn3B,KAAK0oC,YAAcvpC,OAAOogC,QAAQv/B,KAAKs6B,OAAOd,OAAOoI,QAAO,SAAUpI,EAAOiJ,GAC3E,IAAIG,EAAQxF,EAAeqF,EAAO,GAC9BhlC,EAAOmlC,EAAM,GACbhiC,EAAOgiC,EAAM,GAEjB,OAAOvG,EAAe,GAAI7C,EAAOqC,EAAgB,GAAIp+B,GAAM,WACzD,IAAIo3B,EAAQj3B,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAChF,OAAOq6B,EAAasQ,EAAO/pB,MAAO5d,EAAMi0B,SAEzC,MAEJ,CACDp0B,IAAK,eACLN,MAAO,WACL,IAAI5B,EAAOX,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAC/E,OAAOoC,KAAKyoC,gBAAgBlqC,KAE7B,CACDkC,IAAK,iBACLN,MAAO,WACL,IAAIqZ,EAAS5b,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAEjF,GAAK4b,EAAL,CAIA,IAAI0R,EAAWlrB,KAAKwe,MAAMmqB,YAAY,CACpCp/B,QAASvJ,KAAKwe,MAAMjV,QAAQjG,OAAO,CAACkW,MAEtCxZ,KAAK0e,KAAKunB,YAAY/a,MAEvB,CACDzqB,IAAK,mBACLN,MAAO,WACL,IAAI1C,EAAOG,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAE/E,GAAKH,GAASuC,KAAK0e,KAAKkqB,QAAxB,CAIA,IAAI1d,EAAWlrB,KAAKwe,MAAMmqB,YAAY,CACpCp/B,QAASvJ,KAAKwe,MAAMjV,QAAQkN,QAAO,SAAU+C,GAC3C,OAAQA,EAAO/Y,IAAIsD,WAAW,GAAGT,OAAO7F,EAAM,WAGlDuC,KAAK0e,KAAKunB,YAAY/a,MAEvB,CACDzqB,IAAK,UACLN,MAAO,WACAH,KAAK0e,MAIV1e,KAAK0e,KAAKsC,YAEX,CACDvgB,IAAK,oBACL4jB,IAAK,WACH,OAAKrkB,KAAKgB,QAAQujC,qBAIX,CAAC,IAAIb,GAAO,IAAIM,GAAQ,IAAI,IAH1B,KAKV,CACDvjC,IAAK,QACL4jB,IAAK,WACH,OAAOrkB,KAAK0e,KAAO1e,KAAK0e,KAAKF,MAAQ,OAEtC,CACD/d,IAAK,WACL4jB,IAAK,WACH,OAAOllB,OAAOogC,QAAQlD,EAAe,GAAIr8B,KAAKwoC,YAAa,GAAIxoC,KAAK0oC,cAAc9G,QAAO,SAAUiH,EAAO9F,GACxG,IAAIE,EAAQ7F,EAAe2F,EAAO,GAC9BtlC,EAAOwlC,EAAM,GACb9iC,EAAQ8iC,EAAM,GAElB,OAAO5G,EAAe,GAAIwM,EAAOhN,EAAgB,GAAIp+B,GAAM,WACzD,IAAIo3B,EAAQj3B,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,GAChF,OAAOuC,EAAM00B,SAEd,QAIAqP,EA/iBT,CAgjBEhY,IAEE4c,GAAgB,CAClBx7B,MAAO,CACLmoB,OAAQ,CACN91B,QAAS,KACTpB,KAAMY,SAGV4pC,MAAO,CACLtT,OAAQ,CACNuT,WAAW,EACXnoB,QAAS,SAAiB4U,GACxB,IAAIkJ,EAAQ3+B,KAERy1B,GAAUA,EAAOne,SACnBtX,KAAKipC,WAAU,WACbtK,EAAMM,IAAI9c,YAAYsT,EAAOne,QAAQlI,YAErCqmB,EAAOyT,mBAAmBvK,SAMpCzuB,OAAQ,SAAgB/B,GACtB,OAAOA,EAAc,QAEvBg7B,cAAe,WACbnpC,KAAKy1B,OAAOne,QAAUtX,KAAKi/B,MAI3BmK,GAEJ,WACE,SAASA,EAAKpL,GACZ,IAAIh9B,EAAUg9B,EAAKh9B,QAEnBk6B,EAAgBl7B,KAAMopC,GAEtBppC,KAAKgB,QAAUA,EAEfhB,KAAKgB,QAAQsW,QAAQwC,iBAAiB,YAAa9Z,KAAKke,aAe1D,OAZAwd,EAAa0N,EAAM,CAAC,CAClB3oC,IAAK,cACLN,MAAO,SAAqBqP,GAC1BA,EAAM8kB,mBAEP,CACD7zB,IAAK,UACLN,MAAO,WACLH,KAAKgB,QAAQsW,QAAQ2J,oBAAoB,YAAajhB,KAAKke,iBAIxDkrB,EAvBT,GA0BA,SAASC,GAASroC,GAChB,OAAO,IAAI,YAAO,CAChBP,IAAK,IAAI,eAAU,YACnBie,KAAM,SAAc2B,GAClB,OAAO,IAAI+oB,GAAK,CACd/oB,WAAYA,EACZrf,QAASA,OAMjB,IAAIsoC,GAAgB,CAClBh8B,MAAO,CACLmoB,OAAQ,CACN91B,QAAS,KACTpB,KAAMY,SAGV4pC,MAAO,CACLtT,OAAQ,CACNuT,WAAW,EACXnoB,QAAS,SAAiB4U,GACxB,IAAIkJ,EAAQ3+B,KAERy1B,GACFz1B,KAAKipC,WAAU,WACbxT,EAAO8T,eAAeF,GAAQ,CAC5B5T,OAAQA,EACRne,QAASqnB,EAAMM,aAO3B/uB,OAAQ,WACN,OAAKlQ,KAAKy1B,OAIHz1B,KAAKwpC,aAAa7pC,QAAQ,CAC/BwlC,QAASnlC,KAAKy1B,OAAO/W,KAAKymB,QAC1B/C,MAAOpiC,KAAKy1B,OAAO2M,MACnBvM,SAAU71B,KAAKy1B,OAAOI,SACtBC,SAAU91B,KAAKy1B,OAAOK,SACtBiB,aAAc/2B,KAAKy1B,OAAOsB,aAAa/d,KAAKhZ,KAAKy1B,UAR1C,OAab,SAASgU,GAAU7oC,EAAMilB,EAAMC,GAC7B,IAAI7nB,EAAQ8Q,SAAS26B,cAGrB,OAFAzrC,EAAM0rC,OAAO/oC,EAAY,MAANklB,EAAallB,EAAK2O,UAAU3N,OAASkkB,GACxD7nB,EAAM2rC,SAAShpC,EAAMilB,GAAQ,GACtB5nB,EAGT,SAAS4rC,GAAW9N,EAAQ+N,GAC1B,IAAIC,EAAQhO,EAAOiO,iBACnB,OAAQD,EAAMnoC,OAA0CmoC,EAAMD,EAAO,EAAI,EAAIC,EAAMnoC,OAAS,GAArEm6B,EAAOla,wBAGhC,SAASI,GAAYvD,EAAMlD,GACzB,IAMIyuB,EACA1oB,EAPA9b,EAAM7H,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,IAAmBA,UAAU,GAErEssC,EAAwBxrB,EAAKkqB,QAAQuB,WAAW3uB,GAChD5a,EAAOspC,EAAsBtpC,KAC7B4D,EAAS0lC,EAAsB1lC,OAKnC,GAAsB,IAAlB5D,EAAK0O,SACH7J,GAAOjB,EAAS5D,EAAK2O,UAAU3N,QACjC2f,EAAOsoB,GAAWJ,GAAU7oC,EAAM4D,EAAS,EAAGA,IAAU,GACxDylC,EAAO,SACEzlC,EAAS5D,EAAK2O,UAAU3N,SACjC2f,EAAOsoB,GAAWJ,GAAU7oC,EAAM4D,EAAQA,EAAS,IAAK,GACxDylC,EAAO,aAEJ,GAAIrpC,EAAKwO,WAAY,CAC1B,GAAI5K,EAAS5D,EAAKwpC,WAAWxoC,OAAQ,CACnC,IAAIY,EAAQ5B,EAAKwpC,WAAW5lC,GAC5B+c,EAAOsoB,GAA8B,IAAnBrnC,EAAM8M,SAAiBm6B,GAAUjnC,GAASA,GAAQ,GACpEynC,EAAO,OAGT,KAAM1oB,GAAQA,EAAK1f,MAAQ0f,EAAKO,SAAWtd,EAAQ,CACjD,IAAI6lC,EAASzpC,EAAKwpC,WAAW5lC,EAAS,GACtC+c,EAAOsoB,GAA+B,IAApBQ,EAAO/6B,SAAiBm6B,GAAUY,GAAUA,EAAQ,GACtEJ,EAAO,cAGT1oB,EAAO3gB,EAAKihB,wBACZooB,EAAO,OAGT,IAAIvmC,EAAI6d,EAAK0oB,GACb,MAAO,CACLpoC,IAAK0f,EAAK1f,IACVigB,OAAQP,EAAKO,OACbrC,KAAM/b,EACNqe,MAAOre,GAIX,IAAI4mC,GAEJ,WACE,SAASlB,EAAKpL,GACZ,IAAIW,EAAQ3+B,KAERgB,EAAUg9B,EAAKh9B,QACfqf,EAAa2d,EAAK3d,WAEtB6a,EAAgBl7B,KAAMopC,GAEtBppC,KAAKgB,QAAUq7B,EAAe,GAAI,CAChC/kB,QAAS,KACTizB,cAAc,EACd1F,SAAU,WACR,OAAO,IAER,GAAI7jC,GACPhB,KAAKqgB,WAAaA,EAClBrgB,KAAK81B,UAAW,EAChB91B,KAAKyf,KAAO,EACZzf,KAAK8hB,OAAS,EACd9hB,KAAK6B,IAAM,EAEX7B,KAAKgB,QAAQsW,QAAQwC,iBAAiB,YAAa9Z,KAAKke,aACxDle,KAAKgB,QAAQy0B,OAAOrB,GAAG,SAAS,SAAUoL,GACxC,IAAI9gB,EAAO8gB,EAAM9gB,KAEjBigB,EAAMzd,OAAOxC,MAEf1e,KAAKgB,QAAQy0B,OAAOrB,GAAG,QAAQ,SAAUqL,GACvC,IAAIjwB,EAAQiwB,EAAMjwB,MAElBmvB,EAAM6L,KAAKh7B,MAqFf,OAjFAksB,EAAa0N,EAAM,CAAC,CAClB3oC,IAAK,cACLN,MAAO,SAAqBqP,GAC1BA,EAAM8kB,mBAEP,CACD7zB,IAAK,SACLN,MAAO,SAAgBue,EAAM+rB,GAC3B,IAAIjsB,EAAQE,EAAKF,MAEjB,IAAIE,EAAK0W,aAKLqV,GAAaA,EAAU7vB,IAAIS,GAAGmD,EAAM5D,MAAQ6vB,EAAU7rB,UAAUvD,GAAGmD,EAAMI,YAK7E,GAAIJ,EAAMI,UAAUxD,MAClBpb,KAAKwqC,WADP,CAMA,IAAIxT,EAAmBxY,EAAMI,UACzBiH,EAAOmR,EAAiBnR,KACxBC,EAAKkR,EAAiBlR,GAItBU,EAAQvE,GAAYvD,EAAMmH,GAC1BpgB,EAAMwc,GAAYvD,EAAMoH,GAAI,GAE5Bne,EAAS3H,KAAKgB,QAAQsW,QAAQ4K,aAElC,GAAKva,EAAL,CAKA,IAAI+iC,EAAM/iC,EAAOka,wBACbnf,EAAK1C,KAAKgB,QAAQsW,QAAQuK,wBAG1BpC,GAAQ+G,EAAM/G,KAAOha,EAAIga,MAAQ,EAAIirB,EAAIjrB,KAE7Czf,KAAKyf,KAAO1J,KAAK40B,MAAM3qC,KAAKgB,QAAQupC,aAAex0B,KAAK8Q,IAAI6jB,EAAIlqB,MAAQ9d,EAAG8d,MAAQ,EAAGzK,KAAK0Q,IAAIhH,EAAM/c,EAAG8d,MAAQ,IAAMf,GACtHzf,KAAK8hB,OAAS/L,KAAK40B,MAAMD,EAAI5oB,OAAS0E,EAAM3kB,KAC5C7B,KAAK6B,IAAMkU,KAAK40B,MAAMllC,EAAIqc,OAAS4oB,EAAI7oC,KACvC7B,KAAK81B,UAAW,EAChB91B,KAAK4qC,kBAdH5qC,KAAKwqC,UAgBR,CACD/pC,IAAK,aACLN,MAAO,WACLH,KAAKgB,QAAQ6jC,SAAS,CACpB/O,SAAU91B,KAAK81B,SACfrW,KAAMzf,KAAKyf,KACXqC,OAAQ9hB,KAAK8hB,OACbjgB,IAAK7B,KAAK6B,QAGb,CACDpB,IAAK,OACLN,MAAO,SAAcqP,GACfA,GAASA,EAAM8T,eAAiBtjB,KAAKgB,QAAQsW,QAAQpF,WAAWjM,SAASuJ,EAAM8T,iBAInFtjB,KAAK81B,UAAW,EAChB91B,KAAK4qC,gBAEN,CACDnqC,IAAK,UACLN,MAAO,WACLH,KAAKgB,QAAQsW,QAAQ2J,oBAAoB,YAAajhB,KAAKke,iBAIxDkrB,EApHT,GAuHA,SAASyB,GAAY7pC,GACnB,OAAO,IAAI,YAAO,CAChBP,IAAK,IAAI,eAAU,eACnBie,KAAM,SAAc2B,GAClB,OAAO,IAAIiqB,GAAO,CAChBjqB,WAAYA,EACZrf,QAASA,OAcLkM,Q,UA6LZ,I;;;;;;ACn+DA,SAAS,GAAgBiuB,EAAUC,GACjC,KAAMD,aAAoBC,GACxB,MAAM,IAAI58B,UAAU,qCAIxB,SAAS,GAAkBwkB,EAAQ1V,GACjC,IAAK,IAAIlD,EAAI,EAAGA,EAAIkD,EAAM1L,OAAQwI,IAAK,CACrC,IAAIkxB,EAAahuB,EAAMlD,GACvBkxB,EAAWC,WAAaD,EAAWC,aAAc,EACjDD,EAAWE,cAAe,EACtB,UAAWF,IAAYA,EAAWG,UAAW,GACjDt8B,OAAOib,eAAe4I,EAAQsY,EAAW76B,IAAK66B,IAIlD,SAAS,GAAaF,EAAaO,EAAYC,GAG7C,OAFID,GAAY,GAAkBP,EAAYtoB,UAAW6oB,GACrDC,GAAa,GAAkBR,EAAaQ,GACzCR,EAGT,SAAS,GAAgBx8B,EAAK6B,EAAKN,GAYjC,OAXIM,KAAO7B,EACTO,OAAOib,eAAexb,EAAK6B,EAAK,CAC9BN,MAAOA,EACPo7B,YAAY,EACZC,cAAc,EACdC,UAAU,IAGZ78B,EAAI6B,GAAON,EAGNvB,EAGT,SAAS,GAAQm9B,EAAQC,GACvB,IAAIpzB,EAAOzJ,OAAOyJ,KAAKmzB,GAEvB,GAAI58B,OAAO88B,sBAAuB,CAChC,IAAIC,EAAU/8B,OAAO88B,sBAAsBF,GACvCC,IAAgBE,EAAUA,EAAQzlB,QAAO,SAAU0lB,GACrD,OAAOh9B,OAAOi9B,yBAAyBL,EAAQI,GAAKZ,eAEtD3yB,EAAK9G,KAAKnE,MAAMiL,EAAMszB,GAGxB,OAAOtzB,EAGT,SAAS,GAAeoa,GACtB,IAAK,IAAI5Y,EAAI,EAAGA,EAAIxM,UAAUgE,OAAQwI,IAAK,CACzC,IAAIhH,EAAyB,MAAhBxF,UAAUwM,GAAaxM,UAAUwM,GAAK,GAE/CA,EAAI,EACN,GAAQhH,GAAQ,GAAM9D,SAAQ,SAAUmB,GACtC,GAAgBuiB,EAAQviB,EAAK2C,EAAO3C,OAE7BtB,OAAOm9B,0BAChBn9B,OAAOo9B,iBAAiBvZ,EAAQ7jB,OAAOm9B,0BAA0Bl5B,IAEjE,GAAQA,GAAQ9D,SAAQ,SAAUmB,GAChCtB,OAAOib,eAAe4I,EAAQviB,EAAKtB,OAAOi9B,yBAAyBh5B,EAAQ3C,OAKjF,OAAOuiB,EAGT,SAAS,GAAUyZ,EAAUC,GAC3B,GAA0B,oBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIl+B,UAAU,sDAGtBi+B,EAAS3pB,UAAY3T,OAAO/B,OAAOs/B,GAAcA,EAAW5pB,UAAW,CACrE1Q,YAAa,CACXjC,MAAOs8B,EACPhB,UAAU,EACVD,cAAc,KAGdkB,GAAY,GAAgBD,EAAUC,GAG5C,SAAS,GAAgBG,GAIvB,OAHA,GAAkB19B,OAAO29B,eAAiB39B,OAAO49B,eAAiB,SAAyBF,GACzF,OAAOA,EAAEx1B,WAAalI,OAAO49B,eAAeF,IAEvC,GAAgBA,GAGzB,SAAS,GAAgBA,EAAGG,GAM1B,OALA,GAAkB79B,OAAO29B,gBAAkB,SAAyBD,EAAGG,GAErE,OADAH,EAAEx1B,UAAY21B,EACPH,GAGF,GAAgBA,EAAGG,GAG5B,SAAS,GAAuBE,GAC9B,QAAa,IAATA,EACF,MAAM,IAAI9+B,eAAe,6DAG3B,OAAO8+B,EAGT,SAAS,GAA2BA,EAAMntB,GACxC,OAAIA,GAAyB,kBAATA,GAAqC,oBAATA,EAIzC,GAAuBmtB,GAHrBntB,EAoEX,IA4DI,GAEJ,SAAU4zB,GAGR,SAASmH,IAGP,OAFA,GAAgB9qC,KAAM8qC,GAEf,GAA2B9qC,KAAM,GAAgB8qC,GAAYntC,MAAMqC,KAAMpC,YAgDlF,OArDA,GAAUktC,EAAYnH,GAQtB,GAAamH,EAAY,CAAC,CACxBrqC,IAAK,WACLN,MAAO,SAAkB69B,GACvB,IAAIz/B,EAAOy/B,EAAKz/B,KACZ+7B,EAAS0D,EAAK1D,OAClB,OAAO,WACL,OAAOE,EAAWj8B,EAAM+7B,EAAOd,MAAMuR,cAGxC,CACDtqC,IAAK,OACLN,MAAO,SAAcq/B,GACnB,IAAIjhC,EAAOihC,EAAMjhC,KACb+7B,EAASkF,EAAMlF,OACnB,MAAO,CACL,eAAgBE,EAAWj8B,EAAM+7B,EAAOd,MAAMuR,cAGjD,CACDtqC,IAAK,aACLN,MAAO,SAAoBs/B,GACzB,IAAIlhC,EAAOkhC,EAAMlhC,KACjB,MAAO,CAAC,+BAAkB,iBAAkBA,MAE7C,CACDkC,IAAK,OACL4jB,IAAK,WACH,MAAO,gBAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLnJ,QAAS,aACT2oB,MAAO,QACPC,SAAU,CAAC,CACT70B,IAAK,OAEP80B,MAAO,WACL,MAAO,CAAC,KAAM,SAMf+G,EAtDT,CAuDErH,IAwJF,IAgJI,GAEJ,SAAUE,GAGR,SAASqH,IAGP,OAFA,GAAgBhrC,KAAMgrC,GAEf,GAA2BhrC,KAAM,GAAgBgrC,GAASrtC,MAAMqC,KAAMpC,YA0E/E,OA/EA,GAAUotC,EAASrH,GAQnB,GAAaqH,EAAS,CAAC,CACrBvqC,IAAK,WACLN,MAAO,SAAkB69B,GACvB,IAAIz/B,EAAOy/B,EAAKz/B,KACZ+7B,EAAS0D,EAAK1D,OAClB,OAAO,SAAUzF,GACf,OAAOsF,EAAgB57B,EAAM+7B,EAAOd,MAAMyR,UAAWpW,MAGxD,CACDp0B,IAAK,OACLN,MAAO,SAAcq/B,GACnB,IAAIjhC,EAAOihC,EAAMjhC,KACjB,OAAOyB,KAAKgB,QAAQkqC,OAAOtJ,QAAO,SAAUhe,EAAOyS,GACjD,OAAO,GAAe,GAAIzS,EAAO,GAAI,GAAgB,GAAI,cAActgB,OAAO+yB,GAAQ,0BAAa93B,EAAM,CACvG83B,MAAOA,QAER,MAEJ,CACD51B,IAAK,aACLN,MAAO,SAAoBs/B,GACzB,IAAIlhC,EAAOkhC,EAAMlhC,KACjB,OAAOyB,KAAKgB,QAAQkqC,OAAOznC,KAAI,SAAU4yB,GACvC,OAAO,oCAAuB,IAAIlzB,OAAO,SAASG,OAAO+yB,EAAO,WAAY93B,GAAM,WAChF,MAAO,CACL83B,MAAOA,WAKd,CACD51B,IAAK,OACL4jB,IAAK,WACH,MAAO,YAER,CACD5jB,IAAK,iBACL4jB,IAAK,WACH,MAAO,CACL6mB,OAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,MAG3B,CACDzqC,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLwQ,MAAO,CACLwB,MAAO,CACL12B,QAAS,IAGbub,QAAS,UACT2oB,MAAO,QACPsH,UAAU,EACVpL,WAAW,EACX+D,SAAU9jC,KAAKgB,QAAQkqC,OAAOznC,KAAI,SAAU4yB,GAC1C,MAAO,CACLpnB,IAAK,IAAI3L,OAAO+yB,GAChBxB,MAAO,CACLwB,MAAOA,OAIb0N,MAAO,SAAenjC,GACpB,MAAO,CAAC,IAAI0C,OAAO1C,EAAKi0B,MAAMwB,OAAQ,SAMvC2U,EAhFT,CAiFEvH,IA+LE,GAEJ,SAAUE,GAGR,SAASyH,IAGP,OAFA,GAAgBprC,KAAMorC,GAEf,GAA2BprC,KAAM,GAAgBorC,GAAUztC,MAAMqC,KAAMpC,YAmChF,OAxCA,GAAUwtC,EAAUzH,GAQpB,GAAayH,EAAU,CAAC,CACtB3qC,IAAK,OACLN,MAAO,SAAc69B,GACnB,IAAIz/B,EAAOy/B,EAAKz/B,KAChB,MAAO,CACL8sC,MAAO,2BAAc9sC,GACrB+sC,IAAK,0BAAa/sC,GAClB,YAAa,0BAAaA,MAG7B,CACDkC,IAAK,OACL4jB,IAAK,WACH,MAAO,cAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLnJ,QAAS,mBACTiwB,UAAU,EACVpL,WAAW,EACX+D,SAAU,CAAC,CACT70B,IAAK,OAEP80B,MAAO,WACL,MAAO,CAAC,KAAM,SAMfqH,EAzCT,CA0CE3H,IAwQF,IAoGI,GAEJ,SAAUE,GAGR,SAAS4H,IAGP,OAFA,GAAgBvrC,KAAMurC,GAEf,GAA2BvrC,KAAM,GAAgBurC,GAAa5tC,MAAMqC,KAAMpC,YAkEnF,OAvEA,GAAU2tC,EAAa5H,GAQvB,GAAa4H,EAAa,CAAC,CACzB9qC,IAAK,WACLN,MAAO,SAAkB69B,GACvB,IAAIz/B,EAAOy/B,EAAKz/B,KACZ+7B,EAAS0D,EAAK1D,OAClB,OAAO,WACL,OAAOE,EAAWj8B,EAAM+7B,EAAOd,MAAMuR,cAGxC,CACDtqC,IAAK,OACLN,MAAO,SAAcq/B,GACnB,IAAIjhC,EAAOihC,EAAMjhC,KACb+7B,EAASkF,EAAMlF,OACnB,MAAO,CACL,eAAgBE,EAAWj8B,EAAM+7B,EAAOd,MAAMuR,cAGjD,CACDtqC,IAAK,aACLN,MAAO,SAAoBs/B,GACzB,IAAIlhC,EAAOkhC,EAAMlhC,KACjB,MAAO,CAAC,+BAAkB,cAAeA,GAAM,SAAU0F,GACvD,MAAO,CACLunC,OAAQvnC,EAAM,OAEf,SAAUA,EAAOrD,GAClB,OAAOA,EAAKkc,WAAalc,EAAKi0B,MAAM2W,SAAWvnC,EAAM,SAGxD,CACDxD,IAAK,OACL4jB,IAAK,WACH,MAAO,iBAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLwQ,MAAO,CACL2W,MAAO,CACL7rC,QAAS,IAGbub,QAAS,aACT2oB,MAAO,QACPC,SAAU,CAAC,CACT70B,IAAK,KACLupB,SAAU,SAAkBzX,GAC1B,MAAO,CACLyqB,MAAOzqB,EAAI0qB,aAAa,UAAY1qB,EAAI2qB,aAAa,SAAW,MAItE3H,MAAO,SAAenjC,GACpB,OAA4B,IAArBA,EAAKi0B,MAAM2W,MAAc,CAAC,KAAM,GAAK,CAAC,KAAM,CACjDhlB,MAAO5lB,EAAKi0B,MAAM2W,OACjB,SAMJD,EAxET,CAyEE9H,IA2WE,IAzWa,yBAAW,CAC1BkI,WAAY,QACZC,YAAa,SACbC,eAAgB,CACdC,WAAY,CACVnsC,QAAS,KACTosC,WAAY,SAAoBhrB,GAC9B,OAAOA,EAAIqB,MAAM4pB,iBAAmB,MAEtCC,WAAY,SAAoB9rC,EAAO00B,GACrC,GAAI10B,EAAO,CACT,IAAIiiB,EAAQ,CACVA,MAAO,GAAG9e,OAAOuxB,EAAMzS,OAAS,GAAI,sBAAsB9e,OAAOnD,EAAO,MAE1EhB,OAAO+H,OAAO2tB,EAAOzS,SA6V/B,SAAU8pB,GAGR,SAASC,IAGP,OAFA,GAAgBnsC,KAAMmsC,GAEf,GAA2BnsC,KAAM,GAAgBmsC,GAAMxuC,MAAMqC,KAAMpC,YA4D5E,OAjEA,GAAUuuC,EAAMD,GAQhB,GAAaC,EAAM,CAAC,CAClB1rC,IAAK,OACLN,MAAO,SAAc69B,GACnB,IAAIz/B,EAAOy/B,EAAKz/B,KAChB,MAAO,CACL,QAAS,wBAAWA,MAGvB,CACDkC,IAAK,WACLN,MAAO,SAAkBq/B,GACvB,IAAIjhC,EAAOihC,EAAMjhC,KACjB,OAAO,WACL,OAAO,wBAAWA,MAGrB,CACDkC,IAAK,aACLN,MAAO,SAAoBs/B,GACzB,IAAIlhC,EAAOkhC,EAAMlhC,KACjB,MAAO,CAAC85B,EAAc,kCAAmC95B,MAE1D,CACDkC,IAAK,aACLN,MAAO,SAAoB+hC,GACzB,IAAI3jC,EAAO2jC,EAAM3jC,KACjB,MAAO,CAACy7B,EAAc,kCAAmCz7B,MAE1D,CACDkC,IAAK,OACL4jB,IAAK,WACH,MAAO,SAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLyf,SAAU,CAAC,CACT70B,IAAK,UACJ,CACDA,IAAK,IACLupB,SAAU,SAAkB53B,GAC1B,MAAiC,WAA1BA,EAAKwhB,MAAMgqB,YAA2B,OAE9C,CACDhqB,MAAO,cACPoW,SAAU,SAAkBr4B,GAC1B,MAAO,4BAA4B2R,KAAK3R,IAAU,QAGtD4jC,MAAO,WACL,MAAO,CAAC,SAAU,SAMnBoI,EAlET,CAmEE7I,KAgEE,GAEJ,SAAU4I,GAGR,SAASG,IAGP,OAFA,GAAgBrsC,KAAMqsC,GAEf,GAA2BrsC,KAAM,GAAgBqsC,GAAQ1uC,MAAMqC,KAAMpC,YAsD9E,OA3DA,GAAUyuC,EAAQH,GAQlB,GAAaG,EAAQ,CAAC,CACpB5rC,IAAK,OACLN,MAAO,SAAc69B,GACnB,IAAIz/B,EAAOy/B,EAAKz/B,KAChB,MAAO,CACL,QAAS,wBAAWA,MAGvB,CACDkC,IAAK,WACLN,MAAO,SAAkBq/B,GACvB,IAAIjhC,EAAOihC,EAAMjhC,KACjB,OAAO,WACL,OAAO,wBAAWA,MAGrB,CACDkC,IAAK,aACLN,MAAO,SAAoBs/B,GACzB,IAAIlhC,EAAOkhC,EAAMlhC,KACjB,MAAO,CAAC85B,EAAc,yBAA0B95B,GAAO85B,EAAc,2BAA4B95B,MAElG,CACDkC,IAAK,aACLN,MAAO,SAAoB+hC,GACzB,IAAI3jC,EAAO2jC,EAAM3jC,KACjB,MAAO,CAACy7B,EAAc,aAAcz7B,GAAOy7B,EAAc,eAAgBz7B,MAE1E,CACDkC,IAAK,OACL4jB,IAAK,WACH,MAAO,WAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLyf,SAAU,CAAC,CACT70B,IAAK,KACJ,CACDA,IAAK,MACJ,CACDmT,MAAO,sBAET2hB,MAAO,WACL,MAAO,CAAC,KAAM,SAMfsI,EA5DT,CA6DE/I,IAEE,GAEJ,SAAU4I,GAGR,SAASI,IAGP,OAFA,GAAgBtsC,KAAMssC,GAEf,GAA2BtsC,KAAM,GAAgBssC,GAAM3uC,MAAMqC,KAAMpC,YA0E5E,OA/EA,GAAU0uC,EAAMJ,GAQhB,GAAaI,EAAM,CAAC,CAClB7rC,IAAK,WACLN,MAAO,SAAkB69B,GACvB,IAAIz/B,EAAOy/B,EAAKz/B,KAChB,OAAO,SAAUs2B,GACf,OAAIA,EAAM0X,KACDxR,EAAWx8B,EAAMs2B,GAGnBqF,EAAW37B,MAGrB,CACDkC,IAAK,aACLN,MAAO,SAAoBq/B,GACzB,IAAIjhC,EAAOihC,EAAMjhC,KACjB,MAAO,CAAC+6B,EAAU,+FAAgG/6B,GAAM,SAAUiuC,GAChI,MAAO,CACLD,KAAMC,SAIX,CACD/rC,IAAK,OACL4jB,IAAK,WACH,MAAO,SAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLwQ,MAAO,CACL0X,KAAM,CACJ5sC,QAAS,OAGb8sC,WAAW,EACX3I,SAAU,CAAC,CACT70B,IAAK,UACLupB,SAAU,SAAkBzX,GAC1B,MAAO,CACLwrB,KAAMxrB,EAAI2qB,aAAa,YAI7B3H,MAAO,SAAenjC,GACpB,MAAO,CAAC,IAAK,GAAe,GAAIA,EAAKi0B,MAAO,CAC1C6X,IAAK,iCACH,OAIT,CACDjsC,IAAK,UACL4jB,IAAK,WACH,MAAO,CAAC,IAAI,YAAO,CACjB/W,MAAO,CACL4Q,YAAa,SAAqBQ,EAAMlD,EAAKhM,GAC3C,IAAI8qB,EAAS5b,EAAKF,MAAM8b,OACpBzF,EAAQkC,EAAarY,EAAKF,MAAO8b,EAAOrD,MAAMO,MAE9C3C,EAAM0X,MAAQ/8B,EAAMwT,kBAAkB2pB,oBACxCn9B,EAAMo9B,kBACN/yB,OAAOjK,KAAKilB,EAAM0X,gBAQvBD,EAhFT,CAiFEhJ,IAwEE,GAEJ,SAAU4I,GAGR,SAASW,IAGP,OAFA,GAAgB7sC,KAAM6sC,GAEf,GAA2B7sC,KAAM,GAAgB6sC,GAAWlvC,MAAMqC,KAAMpC,YA2CjF,OAhDA,GAAUivC,EAAWX,GAQrB,GAAaW,EAAW,CAAC,CACvBpsC,IAAK,OACLN,MAAO,SAAc69B,GACnB,IAAIz/B,EAAOy/B,EAAKz/B,KAChB,MAAO,CACL,QAAS,wBAAWA,MAGvB,CACDkC,IAAK,WACLN,MAAO,SAAkBq/B,GACvB,IAAIjhC,EAAOihC,EAAMjhC,KACjB,OAAO,WACL,OAAO,wBAAWA,MAGrB,CACDkC,IAAK,OACL4jB,IAAK,WACH,MAAO,cAER,CACD5jB,IAAK,SACL4jB,IAAK,WACH,MAAO,CACLyf,SAAU,CAAC,CACT70B,IAAK,KACJ,CACDmT,MAAO,kBACPoW,SAAU,SAAkBr4B,GAC1B,MAAiB,cAAVA,KAGX4jC,MAAO,WACL,MAAO,CAAC,IAAK,SAMd8I,EAjDT,CAkDEvJ,IC9+Da,IACfwJ,YACAC,iBACAjE,iBACAQ,kBAEAvpC,KANA,WAMA,WACA,OACAitC,QACA7X,+BACAR,WACAc,eACA0L,YACA,OACA,QAAA+J,iBACA,OACA,OACA,OACA,OACA,OACA,QAEAhwB,uBACA2pB,qBAAA,4BACA,WACA,cAGAnpB,QACAtE,UAGA61B,SACA1Y,SADA,WACA,WACA,6DAEA,gDACA,GACA,MACA,aAKAO,WAZA,WAaA,oDAGAoY,KAhBA,WAgBA,WACA,gBACA,WACAC,IAAA,mDACAC,MAAA,YACA,aACA,cACAC,oCACAjsC,+CACA2I,sBACA0W,kBAEA,kBAEA6sB,OAAA,YACA,aACA,cACAD,kCACAjsC,6CACA2I,sBACA0W,qBAIA8sB,SAxCA,WAwCA,WACA,gBACA,WACA,WACAlpB,IADA,kCACA,UACA+oB,MAAA,YACAlQ,yCAEAA,4DAEAA,gBAEAoQ,OAAA,YAEA,kBAIAE,QA1FA,WA2FA,8BACA,SACA,iBAGArE,cAhGA,WAiGA,wBC5M0X,M,yBCQtXz6B,GAAY,gBACd,GACAwB,EACAomB,GACA,EACA,KACA,WACA,MAIa,aAAA5nB,G,6CCff,SAAS6U,EAAiBC,GAAM,OAAQA,GAAqB,kBAAPA,GAAoB,YAAaA,EAAMA,EAAG,WAAaA,EAF7GrkB,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAItD,IAAIstC,EAAalqB,EAAgB,EAAQ,UAEzC,SAASmqB,EAAc72B,EAAGC,EAAG0E,GAC3B,IAAK,IAAIpR,EAAI,GAAIA,IAAK,CACpB,GAAIA,GAAKyM,EAAEiG,YAAc1S,GAAK0M,EAAEgG,WAC5B,OAAOjG,EAAEiG,YAAchG,EAAEgG,WAAa,KAAOtB,EAEjD,IAAImyB,EAAS92B,EAAErU,MAAM4H,GAAIwjC,EAAS92B,EAAEtU,MAAM4H,GAC1C,GAAIujC,GAAUC,EAAd,CAEA,IAAKD,EAAOE,WAAWD,GAAW,OAAOpyB,EAEzC,GAAImyB,EAAOlU,QAAUkU,EAAOvsC,MAAQwsC,EAAOxsC,KAAM,CAC/C,IAAK,IAAI0sC,EAAI,EAAGH,EAAOvsC,KAAK0sC,IAAMF,EAAOxsC,KAAK0sC,GAAIA,IAC9CtyB,IACJ,OAAOA,EAET,GAAImyB,EAAOzyB,QAAQysB,MAAQiG,EAAO1yB,QAAQysB,KAAM,CAC9C,IAAIoG,EAAQL,EAAcC,EAAOzyB,QAAS0yB,EAAO1yB,QAASM,EAAM,GAChE,GAAa,MAATuyB,EAAiB,OAAOA,EAE9BvyB,GAAOmyB,EAAO/rB,cAbUpG,GAAOmyB,EAAO/rB,UAiB1C,SAASosB,EAAYn3B,EAAGC,EAAGm3B,EAAMC,GAC/B,IAAK,IAAIC,EAAKt3B,EAAEiG,WAAYsxB,EAAKt3B,EAAEgG,aAAc,CAC/C,GAAU,GAANqxB,GAAiB,GAANC,EACX,OAAOD,GAAMC,EAAK,KAAO,CAACv3B,EAAGo3B,EAAMn3B,EAAGo3B,GAE1C,IAAIP,EAAS92B,EAAErU,QAAQ2rC,GAAKP,EAAS92B,EAAEtU,QAAQ4rC,GAAKzG,EAAOgG,EAAO/rB,SAClE,GAAI+rB,GAAUC,EAAd,CAKA,IAAKD,EAAOE,WAAWD,GAAW,MAAO,CAAC/2B,EAAGo3B,EAAMn3B,EAAGo3B,GAEtD,GAAIP,EAAOlU,QAAUkU,EAAOvsC,MAAQwsC,EAAOxsC,KAAM,CAC/C,IAAIitC,EAAO,EAAGC,EAAUv4B,KAAK8Q,IAAI8mB,EAAOvsC,KAAKQ,OAAQgsC,EAAOxsC,KAAKQ,QACjE,MAAOysC,EAAOC,GAAWX,EAAOvsC,KAAKusC,EAAOvsC,KAAKQ,OAASysC,EAAO,IAAMT,EAAOxsC,KAAKwsC,EAAOxsC,KAAKQ,OAASysC,EAAO,GAC7GA,IAAQJ,IAAQC,IAElB,MAAO,CAACr3B,EAAGo3B,EAAMn3B,EAAGo3B,GAEtB,GAAIP,EAAOzyB,QAAQysB,MAAQiG,EAAO1yB,QAAQysB,KAAM,CAC9C,IAAIoG,EAAQC,EAAYL,EAAOzyB,QAAS0yB,EAAO1yB,QAAS+yB,EAAO,EAAGC,EAAO,GACzE,GAAIH,EAAS,OAAOA,EAEtBE,GAAQtG,EAAMuG,GAAQvG,OAjBpBsG,GAAQtG,EAAMuG,GAAQvG,GA0B5B,IAAI4G,EAAW,SAAkBrzB,EAASysB,GACxC,IAAIpnB,EAASvgB,KAOb,GALAA,KAAKkb,QAAUA,EAIflb,KAAK2nC,KAAOA,GAAQ,EACR,MAARA,EAAgB,IAAK,IAAIv9B,EAAI,EAAGA,EAAI8Q,EAAQtZ,OAAQwI,IACpDmW,EAAOonB,MAAQzsB,EAAQ9Q,GAAGwX,UAG5B4sB,EAAuB,CAAEp/B,WAAY,GAAG6N,UAAW,GAAGH,WAAY,IAMtEyxB,EAASz7B,UAAUokB,aAAe,SAAuBrR,EAAMC,EAAI2oB,EAAGC,EAAW/mC,GAC7E,IAAI4Y,EAASvgB,UACM,IAAd0uC,IAAuBA,EAAY,GAE1C,IAAK,IAAItkC,EAAI,EAAGoR,EAAM,EAAGA,EAAMsK,EAAI1b,IAAK,CACtC,IAAI5H,EAAQ+d,EAAOrF,QAAQ9Q,GAAI3E,EAAM+V,EAAMhZ,EAAMof,SACjD,GAAInc,EAAMogB,IAAiD,IAAzC4oB,EAAEjsC,EAAOksC,EAAYlzB,EAAK7T,EAAQyC,IAAgB5H,EAAM0Y,QAAQysB,KAAM,CACtF,IAAInhB,EAAQhL,EAAM,EAClBhZ,EAAM00B,aAAanhB,KAAK0Q,IAAI,EAAGZ,EAAOW,GACnBzQ,KAAK8Q,IAAIrkB,EAAM0Y,QAAQysB,KAAM7hB,EAAKU,GAClCioB,EAAGC,EAAYloB,GAEpChL,EAAM/V,IAOV8oC,EAASz7B,UAAU67B,YAAc,SAAsBF,GACrDzuC,KAAKk3B,aAAa,EAAGl3B,KAAK2nC,KAAM8G,IAIlCF,EAASz7B,UAAU87B,YAAc,SAAsB/oB,EAAMC,EAAI+oB,EAAgBC,GAC/E,IAAI1tC,EAAO,GAAI2tC,GAAY,EAa3B,OAZA/uC,KAAKk3B,aAAarR,EAAMC,GAAI,SAAUllB,EAAM4a,GACtC5a,EAAK64B,QACPr4B,GAAQR,EAAKQ,KAAK0J,MAAMiL,KAAK0Q,IAAIZ,EAAMrK,GAAOA,EAAKsK,EAAKtK,GACxDuzB,GAAaF,GACJjuC,EAAKouC,QAAUF,GACxB1tC,GAAQ0tC,EACRC,GAAaF,IACHE,GAAanuC,EAAKquC,UAC5B7tC,GAAQytC,EACRE,GAAY,KAEb,GACI3tC,GAMTmtC,EAASz7B,UAAUkS,OAAS,SAAiB1J,GAC3C,IAAKA,EAAMqsB,KAAQ,OAAO3nC,KAC1B,IAAKA,KAAK2nC,KAAQ,OAAOrsB,EACzB,IAAIgM,EAAOtnB,KAAKid,UAAWuY,EAAQla,EAAMlM,WAAY8L,EAAUlb,KAAKkb,QAAQpQ,QAASV,EAAI,EAKzF,IAJIkd,EAAKmS,QAAUnS,EAAKumB,WAAWrY,KACjCta,EAAQA,EAAQtZ,OAAS,GAAK0lB,EAAK4nB,SAAS5nB,EAAKlmB,KAAOo0B,EAAMp0B,MAC9DgJ,EAAI,GAECA,EAAIkR,EAAMJ,QAAQtZ,OAAQwI,IAAO8Q,EAAQpZ,KAAKwZ,EAAMJ,QAAQ9Q,IACnE,OAAO,IAAImkC,EAASrzB,EAASlb,KAAK2nC,KAAOrsB,EAAMqsB,OAKjD4G,EAASz7B,UAAU4mB,IAAM,SAAc7T,EAAMC,GACzC,IAAIvF,EAASvgB,KAGf,GADU,MAAN8lB,IAAcA,EAAK9lB,KAAK2nC,MAChB,GAAR9hB,GAAaC,GAAM9lB,KAAK2nC,KAAQ,OAAO3nC,KAC3C,IAAIQ,EAAS,GAAImnC,EAAO,EACxB,GAAI7hB,EAAKD,EAAQ,IAAK,IAAIzb,EAAI,EAAGoR,EAAM,EAAGA,EAAMsK,EAAI1b,IAAK,CACvD,IAAI5H,EAAQ+d,EAAOrF,QAAQ9Q,GAAI3E,EAAM+V,EAAMhZ,EAAMof,SAC7Cnc,EAAMogB,KACJrK,EAAMqK,GAAQpgB,EAAMqgB,KAElBtjB,EADAA,EAAMi3B,OACEj3B,EAAMk3B,IAAI3jB,KAAK0Q,IAAI,EAAGZ,EAAOrK,GAAMzF,KAAK8Q,IAAIrkB,EAAMpB,KAAKQ,OAAQkkB,EAAKtK,IAEpEhZ,EAAMk3B,IAAI3jB,KAAK0Q,IAAI,EAAGZ,EAAOrK,EAAM,GAAIzF,KAAK8Q,IAAIrkB,EAAM0Y,QAAQysB,KAAM7hB,EAAKtK,EAAM,KAE7Fhb,EAAOsB,KAAKU,GACZmlC,GAAQnlC,EAAMof,UAEhBpG,EAAM/V,EAER,OAAO,IAAI8oC,EAAS/tC,EAAQmnC,IAG9B4G,EAASz7B,UAAUq8B,WAAa,SAAqBtpB,EAAMC,GACzD,OAAID,GAAQC,EAAayoB,EAASnzB,MACtB,GAARyK,GAAaC,GAAM9lB,KAAKkb,QAAQtZ,OAAiB5B,KAC9C,IAAIuuC,EAASvuC,KAAKkb,QAAQpQ,MAAM+a,EAAMC,KAM/CyoB,EAASz7B,UAAUs8B,aAAe,SAAuBlrC,EAAOtD,GAC9D,IAAIoU,EAAUhV,KAAKkb,QAAQhX,GAC3B,GAAI8Q,GAAWpU,EAAQ,OAAOZ,KAC9B,IAAIqyB,EAAOryB,KAAKkb,QAAQpQ,QACpB68B,EAAO3nC,KAAK2nC,KAAO/mC,EAAKghB,SAAW5M,EAAQ4M,SAE/C,OADAyQ,EAAKnuB,GAAStD,EACP,IAAI2tC,EAASlc,EAAMsV,IAM5B4G,EAASz7B,UAAUu8B,WAAa,SAAqBzuC,GACnD,OAAO,IAAI2tC,EAAS,CAAC3tC,GAAM0C,OAAOtD,KAAKkb,SAAUlb,KAAK2nC,KAAO/mC,EAAKghB,WAMpE2sB,EAASz7B,UAAUw8B,SAAW,SAAmB1uC,GAC/C,OAAO,IAAI2tC,EAASvuC,KAAKkb,QAAQ5X,OAAO1C,GAAOZ,KAAK2nC,KAAO/mC,EAAKghB,WAKlE2sB,EAASz7B,UAAUuI,GAAK,SAAaC,GACjC,IAAIiF,EAASvgB,KAEf,GAAIA,KAAKkb,QAAQtZ,QAAU0Z,EAAMJ,QAAQtZ,OAAU,OAAO,EAC1D,IAAK,IAAIwI,EAAI,EAAGA,EAAIpK,KAAKkb,QAAQtZ,OAAQwI,IACrC,IAAKmW,EAAOrF,QAAQ9Q,GAAGiR,GAAGC,EAAMJ,QAAQ9Q,IAAO,OAAO,EAC1D,OAAO,GAKTokC,EAAqBp/B,WAAWiV,IAAM,WAAc,OAAOrkB,KAAKkb,QAAQtZ,OAAS5B,KAAKkb,QAAQ,GAAK,MAInGszB,EAAqBvxB,UAAUoH,IAAM,WAAc,OAAOrkB,KAAKkb,QAAQtZ,OAAS5B,KAAKkb,QAAQlb,KAAKkb,QAAQtZ,OAAS,GAAK,MAIxH4sC,EAAqB1xB,WAAWuH,IAAM,WAAc,OAAOrkB,KAAKkb,QAAQtZ,QAKxE2sC,EAASz7B,UAAUtQ,MAAQ,SAAgB0B,GACzC,IAAIqrC,EAAQvvC,KAAKkb,QAAQhX,GACzB,IAAKqrC,EAAS,MAAM,IAAIrxC,WAAW,SAAWgG,EAAQ,qBAAuBlE,MAC7E,OAAOuvC,GAKThB,EAASz7B,UAAUiK,WAAa,SAAqB7Y,GACnD,OAAOlE,KAAKkb,QAAQhX,IAMtBqqC,EAASz7B,UAAUxT,QAAU,SAAkBmvC,GAG7C,IAFE,IAAIluB,EAASvgB,KAENoK,EAAI,EAAG4yB,EAAI,EAAG5yB,EAAIpK,KAAKkb,QAAQtZ,OAAQwI,IAAK,CACnD,IAAI5H,EAAQ+d,EAAOrF,QAAQ9Q,GAC3BqkC,EAAEjsC,EAAOw6B,EAAG5yB,GACZ4yB,GAAKx6B,EAAMof,WAOf2sB,EAASz7B,UAAU46B,cAAgB,SAA0BpyB,EAAOE,GAGlE,YAFe,IAARA,IAAiBA,EAAM,GAEvBkyB,EAAc1tC,KAAMsb,EAAOE,IAQpC+yB,EAASz7B,UAAUk7B,YAAc,SAAwB1yB,EAAOE,EAAKg0B,GAInE,YAHe,IAARh0B,IAAiBA,EAAMxb,KAAK2nC,WACf,IAAb6H,IAAsBA,EAAWl0B,EAAMqsB,MAEvCqG,EAAYhuC,KAAMsb,EAAOE,EAAKg0B,IAOvCjB,EAASz7B,UAAUzI,UAAY,SAAoBmR,EAAKmvB,GACpD,IAAIpqB,EAASvgB,KAGf,QAFiB,IAAV2qC,IAAmBA,GAAS,GAExB,GAAPnvB,EAAY,OAAOi0B,EAAS,EAAGj0B,GACnC,GAAIA,GAAOxb,KAAK2nC,KAAQ,OAAO8H,EAASzvC,KAAKkb,QAAQtZ,OAAQ4Z,GAC7D,GAAIA,EAAMxb,KAAK2nC,MAAQnsB,EAAM,EAAK,MAAM,IAAItd,WAAY,YAAcsd,EAAM,yBAA2B,KAAS,KAChH,IAAK,IAAIpR,EAAI,EAAGslC,EAAS,GAAItlC,IAAK,CAChC,IAAIulC,EAAMpvB,EAAO/d,MAAM4H,GAAI3E,EAAMiqC,EAASC,EAAI/tB,SAC9C,GAAInc,GAAO+V,EACT,OAAI/V,GAAO+V,GAAOmvB,EAAQ,EAAY8E,EAASrlC,EAAI,EAAG3E,GAC/CgqC,EAASrlC,EAAGslC,GAErBA,EAASjqC,IAMb8oC,EAASz7B,UAAUjP,SAAW,WAAuB,MAAO,IAAM7D,KAAK4vC,gBAAkB,KAEzFrB,EAASz7B,UAAU88B,cAAgB,WAA4B,OAAO5vC,KAAKkb,QAAQvY,KAAK,OAIxF4rC,EAASz7B,UAAUyI,OAAS,WAC1B,OAAOvb,KAAKkb,QAAQtZ,OAAS5B,KAAKkb,QAAQzX,KAAI,SAAUsgB,GAAK,OAAOA,EAAExI,YAAe,MAKvFgzB,EAAS9yB,SAAW,SAAmB6e,EAAQn6B,GAC7C,IAAKA,EAAS,OAAOouC,EAASnzB,MAC9B,IAAKnT,MAAMC,QAAQ/H,GAAU,MAAM,IAAIjC,WAAW,uCAClD,OAAO,IAAIqwC,EAASpuC,EAAMsD,IAAI62B,EAAOkM,gBAMvC+H,EAAS3U,UAAY,SAAoBzT,GACvC,IAAKA,EAAMvkB,OAAU,OAAO2sC,EAASnzB,MAErC,IADA,IAAI5X,EAAQmkC,EAAO,EACVv9B,EAAI,EAAGA,EAAI+b,EAAMvkB,OAAQwI,IAAK,CACrC,IAAIxJ,EAAOulB,EAAM/b,GACjBu9B,GAAQ/mC,EAAKghB,SACTxX,GAAKxJ,EAAK64B,QAAUtT,EAAM/b,EAAI,GAAGyjC,WAAWjtC,IACzC4C,IAAUA,EAAS2iB,EAAMrb,MAAM,EAAGV,IACvC5G,EAAOA,EAAO5B,OAAS,GAAKhB,EAAKsuC,SAAS1rC,EAAOA,EAAO5B,OAAS,GAAGR,KAAOR,EAAKQ,OACvEoC,GACTA,EAAO1B,KAAKlB,GAGhB,OAAO,IAAI2tC,EAAS/qC,GAAU2iB,EAAOwhB,IAQvC4G,EAAS1oB,KAAO,SAAe2T,GAC7B,IAAKA,EAAS,OAAO+U,EAASnzB,MAC9B,GAAIoe,aAAiB+U,EAAY,OAAO/U,EACxC,GAAIvxB,MAAMC,QAAQsxB,GAAU,OAAOx5B,KAAK45B,UAAUJ,GAClD,GAAIA,EAAM3E,MAAS,OAAO,IAAI0Z,EAAS,CAAC/U,GAAQA,EAAM5X,UACtD,MAAM,IAAI1jB,WAAW,mBAAqBs7B,EAAQ,kBAC5BA,EAAMtC,aAAe,mEAAqE,MAGlH/3B,OAAOo9B,iBAAkBgS,EAASz7B,UAAW07B,GAE7C,IAAIe,EAAQ,CAACrrC,MAAO,EAAGM,OAAQ,GAC/B,SAASirC,EAASvrC,EAAOM,GAGvB,OAFA+qC,EAAMrrC,MAAQA,EACdqrC,EAAM/qC,OAASA,EACR+qC,EAST,SAASM,EAAYh5B,EAAGC,GACtB,GAAID,IAAMC,EAAK,OAAO,EACtB,IAAMD,GAAiB,iBAALA,IACZC,GAAiB,iBAALA,EAAkB,OAAO,EAC3C,IAAIqP,EAAQle,MAAMC,QAAQ2O,GAC1B,GAAI5O,MAAMC,QAAQ4O,IAAMqP,EAAS,OAAO,EACxC,GAAIA,EAAO,CACT,GAAItP,EAAEjV,QAAUkV,EAAElV,OAAU,OAAO,EACnC,IAAK,IAAIwI,EAAI,EAAGA,EAAIyM,EAAEjV,OAAQwI,IAAO,IAAKylC,EAAYh5B,EAAEzM,GAAI0M,EAAE1M,IAAO,OAAO,MACvE,CACL,IAAK,IAAI4yB,KAAKnmB,EAAK,KAAMmmB,KAAKlmB,KAAO+4B,EAAYh5B,EAAEmmB,GAAIlmB,EAAEkmB,IAAO,OAAO,EACvE,IAAK,IAAI8S,KAAOh5B,EAAK,KAAMg5B,KAAOj5B,GAAM,OAAO,EAEjD,OAAO,EAfT03B,EAASnzB,MAAQ,IAAImzB,EAAS,GAAI,GAwBlC,IAAIjL,EAAO,SAAc/kC,EAAMs2B,GAG7B70B,KAAKzB,KAAOA,EAGZyB,KAAK60B,MAAQA,GAiHf,SAASkb,EAAav/B,GACpB,IAAI8E,EAAMjY,MAAM0S,KAAK/P,KAAMwQ,GAE3B,OADA8E,EAAIjO,UAAY0oC,EAAaj9B,UACtBwC,EA3GTguB,EAAKxwB,UAAU6mB,SAAW,SAAmB36B,GAI3C,IAHE,IAEEqzB,EAFE9R,EAASvgB,KAELgwC,GAAS,EACV5lC,EAAI,EAAGA,EAAIpL,EAAI4C,OAAQwI,IAAK,CACnC,IAAIkR,EAAQtc,EAAIoL,GAChB,GAAImW,EAAOlF,GAAGC,GAAU,OAAOtc,EAC/B,GAAIuhB,EAAOhiB,KAAK0xC,SAAS30B,EAAM/c,MACxB8zB,IAAQA,EAAOrzB,EAAI8L,MAAM,EAAGV,QAC5B,IAAIkR,EAAM/c,KAAK0xC,SAAS1vB,EAAOhiB,MACpC,OAAOS,GAEFgxC,GAAU10B,EAAM/c,KAAK2xC,KAAO3vB,EAAOhiB,KAAK2xC,OACtC7d,IAAQA,EAAOrzB,EAAI8L,MAAM,EAAGV,IACjCioB,EAAKvwB,KAAKye,GACVyvB,GAAS,GAEP3d,GAAQA,EAAKvwB,KAAKwZ,IAK1B,OAFK+W,IAAQA,EAAOrzB,EAAI8L,SACnBklC,GAAU3d,EAAKvwB,KAAK9B,MAClBqyB,GAMTiR,EAAKxwB,UAAUq9B,cAAgB,SAAwBnxC,GAGrD,IAFE,IAAIuhB,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpL,EAAI4C,OAAQwI,IAC5B,GAAImW,EAAOlF,GAAGrc,EAAIoL,IAChB,OAAOpL,EAAI8L,MAAM,EAAGV,GAAG9G,OAAOtE,EAAI8L,MAAMV,EAAI,IAClD,OAAOpL,GAKTskC,EAAKxwB,UAAU+kB,QAAU,SAAkB74B,GAGzC,IAFE,IAAIuhB,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpL,EAAI4C,OAAQwI,IAC5B,GAAImW,EAAOlF,GAAGrc,EAAIoL,IAAO,OAAO,EACpC,OAAO,GAMTk5B,EAAKxwB,UAAUuI,GAAK,SAAaC,GAC/B,OAAOtb,MAAQsb,GACZtb,KAAKzB,MAAQ+c,EAAM/c,MAAQsxC,EAAY7vC,KAAK60B,MAAOvZ,EAAMuZ,QAK9DyO,EAAKxwB,UAAUyI,OAAS,WACpB,IAAIgF,EAASvgB,KAEXpB,EAAM,CAACL,KAAMyB,KAAKzB,KAAKd,MAC3B,IAAK,IAAI2yC,KAAK7vB,EAAOsU,MAAO,CAC1Bj2B,EAAIi2B,MAAQtU,EAAOsU,MACnB,MAEF,OAAOj2B,GAIT0kC,EAAK7nB,SAAW,SAAmB6e,EAAQ5e,GACzC,IAAKA,EAAQ,MAAM,IAAIxd,WAAW,mCAClC,IAAIK,EAAO+7B,EAAOrD,MAAMvb,EAAKnd,MAC7B,IAAKA,EAAQ,MAAM,IAAIL,WAAY,yBAA4Bwd,EAAS,KAAI,mBAC5E,OAAOnd,EAAKnB,OAAOse,EAAKmZ,QAK1ByO,EAAK+M,QAAU,SAAkBx5B,EAAGC,GAClC,GAAID,GAAKC,EAAK,OAAO,EACrB,GAAID,EAAEjV,QAAUkV,EAAElV,OAAU,OAAO,EACnC,IAAK,IAAIwI,EAAI,EAAGA,EAAIyM,EAAEjV,OAAQwI,IAC1B,IAAKyM,EAAEzM,GAAGiR,GAAGvE,EAAE1M,IAAO,OAAO,EACjC,OAAO,GAMTk5B,EAAKgN,QAAU,SAAkBrZ,GAC/B,IAAKA,GAAyB,GAAhBA,EAAMr1B,OAAe,OAAO0hC,EAAKiN,KAC/C,GAAItZ,aAAiBqM,EAAQ,MAAO,CAACrM,GACrC,IAAI5E,EAAO4E,EAAMnsB,QAEjB,OADAunB,EAAKzb,MAAK,SAAUC,EAAGC,GAAK,OAAOD,EAAEtY,KAAK2xC,KAAOp5B,EAAEvY,KAAK2xC,QACjD7d,GAITiR,EAAKiN,KAAO,GAYZR,EAAaj9B,UAAY3T,OAAO/B,OAAOC,MAAMyV,WAC7Ci9B,EAAaj9B,UAAU1Q,YAAc2tC,EACrCA,EAAaj9B,UAAUrV,KAAO,eAK9B,IAAI0d,EAAQ,SAAeD,EAAS4e,EAAWC,GAE7C/5B,KAAKkb,QAAUA,EAEflb,KAAK85B,UAAYA,EAEjB95B,KAAK+5B,QAAUA,GAGbyW,EAAuB,CAAE7I,KAAM,IA6DnC,SAAS8I,EAAYv1B,EAAS2K,EAAMC,GAClC,IAAIvG,EAAMrE,EAAQ7Q,UAAUwb,GACxB3hB,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OACbhC,EAAQ0Y,EAAQ6B,WAAW7Y,GAC3BwsC,EAAQx1B,EAAQ7Q,UAAUyb,GAC1B6qB,EAAUD,EAAMxsC,MAChB0sC,EAAWF,EAAMlsC,OACrB,GAAIA,GAAUqhB,GAAQrjB,EAAMi3B,OAAQ,CAClC,GAAImX,GAAY9qB,IAAO5K,EAAQ1Y,MAAMmuC,GAASlX,OAAU,MAAM,IAAIv7B,WAAW,2BAC7E,OAAOgd,EAAQwe,IAAI,EAAG7T,GAAMb,OAAO9J,EAAQwe,IAAI5T,IAEjD,GAAI5hB,GAASysC,EAAW,MAAM,IAAIzyC,WAAW,2BAC7C,OAAOgd,EAAQk0B,aAAalrC,EAAO1B,EAAM6vB,KAAKoe,EAAYjuC,EAAM0Y,QAAS2K,EAAOrhB,EAAS,EAAGshB,EAAKthB,EAAS,KAG5G,SAASqsC,EAAW31B,EAAS41B,EAAMC,EAAQppC,GACzC,IAAI4X,EAAMrE,EAAQ7Q,UAAUymC,GACxB5sC,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OACbhC,EAAQ0Y,EAAQ6B,WAAW7Y,GAC/B,GAAIM,GAAUssC,GAAQtuC,EAAMi3B,OAC1B,OAAI9xB,IAAWA,EAAOqpC,WAAW9sC,EAAOA,EAAO6sC,GAAkB,KAC1D71B,EAAQwe,IAAI,EAAGoX,GAAM9rB,OAAO+rB,GAAQ/rB,OAAO9J,EAAQwe,IAAIoX,IAEhE,IAAI/C,EAAQ8C,EAAWruC,EAAM0Y,QAAS41B,EAAOtsC,EAAS,EAAGusC,GACzD,OAAOhD,GAAS7yB,EAAQk0B,aAAalrC,EAAO1B,EAAM6vB,KAAK0b,IAOzD,SAAS3tC,EAAQ2e,EAAOD,EAAKhU,GAC3B,GAAIA,EAAMgvB,UAAY/a,EAAMnC,MACxB,MAAM,IAAImzB,EAAa,mDAC3B,GAAIhxB,EAAMnC,MAAQ9R,EAAMgvB,WAAahb,EAAIlC,MAAQ9R,EAAMivB,QACnD,MAAM,IAAIgW,EAAa,4BAC3B,OAAOkB,EAAalyB,EAAOD,EAAKhU,EAAO,GAGzC,SAASmmC,EAAalyB,EAAOD,EAAKhU,EAAO8R,GACvC,IAAI1Y,EAAQ6a,EAAM7a,MAAM0Y,GAAQhc,EAAOme,EAAMne,KAAKgc,GAClD,GAAI1Y,GAAS4a,EAAI5a,MAAM0Y,IAAUA,EAAQmC,EAAMnC,MAAQ9R,EAAMgvB,UAAW,CACtE,IAAIiU,EAAQkD,EAAalyB,EAAOD,EAAKhU,EAAO8R,EAAQ,GACpD,OAAOhc,EAAKyxB,KAAKzxB,EAAKsa,QAAQk0B,aAAalrC,EAAO6pC,IAC7C,GAAKjjC,EAAMoQ,QAAQysB,KAEnB,IAAK78B,EAAMgvB,WAAchvB,EAAMivB,SAAWhb,EAAMnC,OAASA,GAASkC,EAAIlC,OAASA,EAG/E,CACL,IAAI2C,EAAM2xB,EAAuBpmC,EAAOiU,GACpCyH,EAAQjH,EAAIiH,MACZ/gB,EAAM8Z,EAAI9Z,IACd,OAAOwK,EAAMrP,EAAMuwC,EAAgBpyB,EAAOyH,EAAO/gB,EAAKqZ,EAAKlC,IAN3D,IAAIjV,EAASoX,EAAMpX,OAAQuT,EAAUvT,EAAOuT,QAC5C,OAAOjL,EAAMtI,EAAQuT,EAAQwe,IAAI,EAAG3a,EAAMwY,cAAcvS,OAAOla,EAAMoQ,SAAS8J,OAAO9J,EAAQwe,IAAI5a,EAAIyY,gBAHrG,OAAOtnB,EAAMrP,EAAMwwC,EAAcryB,EAAOD,EAAKlC,IAYjD,SAASy0B,EAAUC,EAAMC,GACvB,IAAKA,EAAIhzC,KAAKizC,kBAAkBF,EAAK/yC,MACjC,MAAM,IAAIwxC,EAAa,eAAiBwB,EAAIhzC,KAAKd,KAAO,SAAW6zC,EAAK/yC,KAAKd,MAGnF,SAASg0C,EAASC,EAASC,EAAQ/0B,GACjC,IAAIhc,EAAO8wC,EAAQ9wC,KAAKgc,GAExB,OADAy0B,EAAUzwC,EAAM+wC,EAAO/wC,KAAKgc,IACrBhc,EAGT,SAASgxC,EAAQpvC,EAAOwgB,GACtB,IAAIsE,EAAOtE,EAAOphB,OAAS,EACvB0lB,GAAQ,GAAK9kB,EAAMi3B,QAAUj3B,EAAMqrC,WAAW7qB,EAAOsE,IACrDtE,EAAOsE,GAAQ9kB,EAAM0sC,SAASlsB,EAAOsE,GAAMlmB,KAAOoB,EAAMpB,MAExD4hB,EAAOlhB,KAAKU,GAGlB,SAASqvC,EAAShzB,EAAQizB,EAAMl1B,EAAOoG,GACrC,IAAIpiB,GAAQkxC,GAAQjzB,GAAQje,KAAKgc,GAC7B6a,EAAa,EAAGE,EAAWma,EAAOA,EAAK5tC,MAAM0Y,GAAShc,EAAKkc,WAC3D+B,IACF4Y,EAAa5Y,EAAO3a,MAAM0Y,GACtBiC,EAAOjC,MAAQA,EACjB6a,IACS5Y,EAAOkzB,aAChBH,EAAQ/yB,EAAO4C,UAAWuB,GAC1ByU,MAGJ,IAAK,IAAIrtB,EAAIqtB,EAAYrtB,EAAIutB,EAAUvtB,IAAOwnC,EAAQhxC,EAAK4B,MAAM4H,GAAI4Y,GACjE8uB,GAAQA,EAAKl1B,OAASA,GAASk1B,EAAKC,YACpCH,EAAQE,EAAKtwB,WAAYwB,GAG/B,SAAS/S,EAAMrP,EAAMsa,GACnB,IAAKta,EAAKrC,KAAKs8B,aAAa3f,GACxB,MAAM,IAAI60B,EAAa,4BAA8BnvC,EAAKrC,KAAKd,MACnE,OAAOmD,EAAKyxB,KAAKnX,GAGnB,SAASi2B,EAAgBpyB,EAAOF,EAAQizB,EAAMhzB,EAAKlC,GACjD,IAAIkd,EAAY/a,EAAMnC,MAAQA,GAAS60B,EAAS1yB,EAAOF,EAAQjC,EAAQ,GACnEmd,EAAUjb,EAAIlC,MAAQA,GAAS60B,EAASK,EAAMhzB,EAAKlC,EAAQ,GAE3D1B,EAAU,GAad,OAZA22B,EAAS,KAAM9yB,EAAOnC,EAAO1B,GACzB4e,GAAaC,GAAWlb,EAAO3a,MAAM0Y,IAAUk1B,EAAK5tC,MAAM0Y,IAC5Dy0B,EAAUvX,EAAWC,GACrB6X,EAAQ3hC,EAAM6pB,EAAWqX,EAAgBpyB,EAAOF,EAAQizB,EAAMhzB,EAAKlC,EAAQ,IAAK1B,KAE5E4e,GACA8X,EAAQ3hC,EAAM6pB,EAAWsX,EAAcryB,EAAOF,EAAQjC,EAAQ,IAAK1B,GACvE22B,EAAShzB,EAAQizB,EAAMl1B,EAAO1B,GAC1B6e,GACA6X,EAAQ3hC,EAAM8pB,EAASqX,EAAcU,EAAMhzB,EAAKlC,EAAQ,IAAK1B,IAEnE22B,EAAS/yB,EAAK,KAAMlC,EAAO1B,GACpB,IAAIqzB,EAASrzB,GAGtB,SAASk2B,EAAcryB,EAAOD,EAAKlC,GACjC,IAAI1B,EAAU,GAEd,GADA22B,EAAS,KAAM9yB,EAAOnC,EAAO1B,GACzB6D,EAAMnC,MAAQA,EAAO,CACvB,IAAIre,EAAOkzC,EAAS1yB,EAAOD,EAAKlC,EAAQ,GACxCg1B,EAAQ3hC,EAAM1R,EAAM6yC,EAAcryB,EAAOD,EAAKlC,EAAQ,IAAK1B,GAG7D,OADA22B,EAAS/yB,EAAK,KAAMlC,EAAO1B,GACpB,IAAIqzB,EAASrzB,GAGtB,SAASg2B,EAAuBpmC,EAAOknC,GAGrC,IAFA,IAAIC,EAAQD,EAAOp1B,MAAQ9R,EAAMgvB,UAAWnyB,EAASqqC,EAAOpxC,KAAKqxC,GAC7DrxC,EAAO+G,EAAO0qB,KAAKvnB,EAAMoQ,SACpB9Q,EAAI6nC,EAAQ,EAAG7nC,GAAK,EAAGA,IAC5BxJ,EAAOoxC,EAAOpxC,KAAKwJ,GAAGioB,KAAKkc,EAAS1oB,KAAKjlB,IAC7C,MAAO,CAAC4lB,MAAO5lB,EAAKsxC,eAAepnC,EAAMgvB,UAAYmY,GAC7CxsC,IAAK7E,EAAKsxC,eAAetxC,EAAKsa,QAAQysB,KAAO78B,EAAMivB,QAAUkY,IAnMvEzB,EAAqB7I,KAAKtjB,IAAM,WAC9B,OAAOrkB,KAAKkb,QAAQysB,KAAO3nC,KAAK85B,UAAY95B,KAAK+5B,SAGnD5e,EAAMrI,UAAUq/B,SAAW,SAAmB32B,EAAK+d,GACjD,IAAIre,EAAU21B,EAAW7wC,KAAKkb,QAASM,EAAMxb,KAAK85B,UAAWP,EAAU,MACvE,OAAOre,GAAW,IAAIC,EAAMD,EAASlb,KAAK85B,UAAW95B,KAAK+5B,UAG5D5e,EAAMrI,UAAUs/B,cAAgB,SAAwBvsB,EAAMC,GAC5D,OAAO,IAAI3K,EAAMs1B,EAAYzwC,KAAKkb,QAAS2K,EAAO7lB,KAAK85B,UAAWhU,EAAK9lB,KAAK85B,WAAY95B,KAAK85B,UAAW95B,KAAK+5B,UAK/G5e,EAAMrI,UAAUuI,GAAK,SAAaC,GAChC,OAAOtb,KAAKkb,QAAQG,GAAGC,EAAMJ,UAAYlb,KAAK85B,WAAaxe,EAAMwe,WAAa95B,KAAK+5B,SAAWze,EAAMye,SAGtG5e,EAAMrI,UAAUjP,SAAW,WACzB,OAAO7D,KAAKkb,QAAU,IAAMlb,KAAK85B,UAAY,IAAM95B,KAAK+5B,QAAU,KAKpE5e,EAAMrI,UAAUyI,OAAS,WACvB,IAAKvb,KAAKkb,QAAQysB,KAAQ,OAAO,KACjC,IAAIjsB,EAAO,CAACR,QAASlb,KAAKkb,QAAQK,UAGlC,OAFIvb,KAAK85B,UAAY,IAAKpe,EAAKoe,UAAY95B,KAAK85B,WAC5C95B,KAAK+5B,QAAU,IAAKre,EAAKqe,QAAU/5B,KAAK+5B,SACrCre,GAKTP,EAAMM,SAAW,SAAmB6e,EAAQ5e,GAC1C,IAAKA,EAAQ,OAAOP,EAAMC,MAC1B,IAAI0e,EAAYpe,EAAKoe,WAAa,EAAGC,EAAUre,EAAKqe,SAAW,EAC/D,GAAwB,iBAAbD,GAA2C,iBAAXC,EACvC,MAAM,IAAI77B,WAAW,oCACzB,OAAO,IAAIid,EAAMozB,EAAS9yB,SAAS6e,EAAQ5e,EAAKR,SAAUQ,EAAKoe,WAAa,EAAGpe,EAAKqe,SAAW,IAMjG5e,EAAMk3B,QAAU,SAAkB9Y,EAAU+Y,QACjB,IAAlBA,IAA2BA,GAAc,GAGhD,IADA,IAAIxY,EAAY,EAAGC,EAAU,EACpBhW,EAAIwV,EAASnqB,WAAY2U,IAAMA,EAAEirB,SAAWsD,IAAkBvuB,EAAExlB,KAAK2d,KAAKsB,WAAYuG,EAAIA,EAAE3U,WAAc0qB,IACnH,IAAK,IAAIyY,EAAMhZ,EAAStc,UAAWs1B,IAAQA,EAAIvD,SAAWsD,IAAkBC,EAAIh0C,KAAK2d,KAAKsB,WAAY+0B,EAAMA,EAAIt1B,UAAa8c,IAC7H,OAAO,IAAI5e,EAAMoe,EAAUO,EAAWC,IAGxC56B,OAAOo9B,iBAAkBphB,EAAMrI,UAAW09B,GAiC1Cr1B,EAAMC,MAAQ,IAAID,EAAMozB,EAASnzB,MAAO,EAAG,GAsH3C,IAAIo3B,EAAc,SAAqBh3B,EAAKi3B,EAAMlb,GAEhDv3B,KAAKwb,IAAMA,EACXxb,KAAKyyC,KAAOA,EAKZzyC,KAAK4c,MAAQ61B,EAAK7wC,OAAS,EAAI,EAE/B5B,KAAKu3B,aAAeA,GAGlBmb,EAAuB,CAAE/qC,OAAQ,GAAGiT,IAAK,GAAGm3B,WAAY,GAAGtwB,UAAW,GAAGD,WAAY,IAEzFgxB,EAAY1/B,UAAU6/B,aAAe,SAAuBC,GAC1D,OAAW,MAAPA,EAAsB5yC,KAAK4c,MAC3Bg2B,EAAM,EAAY5yC,KAAK4c,MAAQg2B,EAC5BA,GAOTF,EAAqB/qC,OAAO0c,IAAM,WAAc,OAAOrkB,KAAKY,KAAKZ,KAAK4c,QAItE81B,EAAqB93B,IAAIyJ,IAAM,WAAc,OAAOrkB,KAAKY,KAAK,IAK9D4xC,EAAY1/B,UAAUlS,KAAO,SAAegc,GAAS,OAAO5c,KAAKyyC,KAAgC,EAA3BzyC,KAAK2yC,aAAa/1B,KAMxF41B,EAAY1/B,UAAU5O,MAAQ,SAAgB0Y,GAAS,OAAO5c,KAAKyyC,KAAgC,EAA3BzyC,KAAK2yC,aAAa/1B,GAAa,IAKvG41B,EAAY1/B,UAAU+J,WAAa,SAAqBD,GAEtD,OADAA,EAAQ5c,KAAK2yC,aAAa/1B,GACnB5c,KAAKkE,MAAM0Y,IAAUA,GAAS5c,KAAK4c,OAAU5c,KAAK+xC,WAAiB,EAAJ,IAMxES,EAAY1/B,UAAU0T,MAAQ,SAAgB5J,GAE5C,OADAA,EAAQ5c,KAAK2yC,aAAa/1B,GACV,GAATA,EAAa,EAAI5c,KAAKyyC,KAAa,EAAR71B,EAAY,GAAK,GAMrD41B,EAAY1/B,UAAUrN,IAAM,SAAcmX,GAExC,OADAA,EAAQ5c,KAAK2yC,aAAa/1B,GACnB5c,KAAKwmB,MAAM5J,GAAS5c,KAAKY,KAAKgc,GAAO1B,QAAQysB,MAOtD6K,EAAY1/B,UAAUtL,OAAS,SAAiBoV,GAE9C,GADAA,EAAQ5c,KAAK2yC,aAAa/1B,IACrBA,EAAS,MAAM,IAAI1e,WAAW,kDACnC,OAAO0e,GAAS5c,KAAK4c,MAAQ,EAAI5c,KAAKwb,IAAMxb,KAAKyyC,KAAa,EAAR71B,EAAY,IAMpE41B,EAAY1/B,UAAU2K,MAAQ,SAAgBb,GAE5C,GADAA,EAAQ5c,KAAK2yC,aAAa/1B,IACrBA,EAAS,MAAM,IAAI1e,WAAW,iDACnC,OAAO0e,GAAS5c,KAAK4c,MAAQ,EAAI5c,KAAKwb,IAAMxb,KAAKyyC,KAAa,EAAR71B,EAAY,GAAK5c,KAAKyyC,KAAa,EAAR71B,GAAWgF,UAO9F8wB,EAAqBX,WAAW1tB,IAAM,WAAc,OAAOrkB,KAAKwb,IAAMxb,KAAKyyC,KAAKzyC,KAAKyyC,KAAK7wC,OAAS,IAMnG8wC,EAAqBjxB,UAAU4C,IAAM,WACnC,IAAI1c,EAAS3H,KAAK2H,OAAQzD,EAAQlE,KAAKkE,MAAMlE,KAAK4c,OAClD,GAAI1Y,GAASyD,EAAOmV,WAAc,OAAO,KACzC,IAAI+1B,EAAO7yC,KAAKwb,IAAMxb,KAAKyyC,KAAKzyC,KAAKyyC,KAAK7wC,OAAS,GAAIY,EAAQmF,EAAOnF,MAAM0B,GAC5E,OAAO2uC,EAAOlrC,EAAOnF,MAAM0B,GAAOw1B,IAAImZ,GAAQrwC,GAOhDkwC,EAAqBlxB,WAAW6C,IAAM,WACpC,IAAIngB,EAAQlE,KAAKkE,MAAMlE,KAAK4c,OACxBi2B,EAAO7yC,KAAKwb,IAAMxb,KAAKyyC,KAAKzyC,KAAKyyC,KAAK7wC,OAAS,GACnD,OAAIixC,EAAe7yC,KAAK2H,OAAOnF,MAAM0B,GAAOw1B,IAAI,EAAGmZ,GACnC,GAAT3uC,EAAa,KAAOlE,KAAK2H,OAAOnF,MAAM0B,EAAQ,IAQvDsuC,EAAY1/B,UAAUmkB,MAAQ,WAC5B,IAAItvB,EAAS3H,KAAK2H,OAAQzD,EAAQlE,KAAKkE,QAGvC,GAA2B,GAAvByD,EAAOuT,QAAQysB,KAAa,OAAOrE,EAAKiN,KAG5C,GAAIvwC,KAAK+xC,WAAc,OAAOpqC,EAAOnF,MAAM0B,GAAO+yB,MAElD,IAAIqa,EAAO3pC,EAAOoV,WAAW7Y,EAAQ,GAAIoX,EAAQ3T,EAAOoV,WAAW7Y,GAGnE,IAAKotC,EAAM,CAAE,IAAIpe,EAAMoe,EAAMA,EAAOh2B,EAAOA,EAAQ4X,EAKnD,IADA,IAAI+D,EAAQqa,EAAKra,MACR7sB,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,KACO,IAAjC6sB,EAAM7sB,GAAG7L,KAAK2d,KAAKuwB,WAAyBnxB,GAAU2b,EAAM7sB,GAAGytB,QAAQvc,EAAM2b,SAC/EA,EAAQA,EAAM7sB,KAAK+lC,cAAclZ,IAEvC,OAAOA,GAUTub,EAAY1/B,UAAUggC,YAAc,SAAsBhB,GACxD,IAAIr0B,EAAQzd,KAAK2H,OAAOoV,WAAW/c,KAAKkE,SACxC,IAAKuZ,IAAUA,EAAMs1B,SAAY,OAAO,KAGxC,IADA,IAAI9b,EAAQxZ,EAAMwZ,MAAOva,EAAOo1B,EAAKnqC,OAAOoV,WAAW+0B,EAAK5tC,SACnDkG,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,KACO,IAAjC6sB,EAAM7sB,GAAG7L,KAAK2d,KAAKuwB,WAAyB/vB,GAASua,EAAM7sB,GAAGytB,QAAQnb,EAAKua,SAC7EA,EAAQA,EAAM7sB,KAAK+lC,cAAclZ,IACvC,OAAOA,GAMTub,EAAY1/B,UAAUkgC,YAAc,SAAsBx3B,GAGxD,IAFE,IAAI+E,EAASvgB,KAEN4c,EAAQ5c,KAAK4c,MAAOA,EAAQ,EAAGA,IACpC,GAAI2D,EAAOiG,MAAM5J,IAAUpB,GAAO+E,EAAO9a,IAAImX,IAAUpB,EAAO,OAAOoB,EACzE,OAAO,GAWT41B,EAAY1/B,UAAU6nB,WAAa,SAAqBrf,EAAO23B,GAC3D,IAAI1yB,EAASvgB,KAGf,QAFiB,IAAVsb,IAAmBA,EAAQtb,MAE9Bsb,EAAME,IAAMxb,KAAKwb,IAAO,OAAOF,EAAMqf,WAAW36B,MACpD,IAAK,IAAI2c,EAAI3c,KAAK4c,OAAS5c,KAAK2H,OAAO2V,eAAiBtd,KAAKwb,KAAOF,EAAME,IAAM,EAAI,GAAImB,GAAK,EAAGA,IAC5F,GAAIrB,EAAME,KAAO+E,EAAO9a,IAAIkX,MAAQs2B,GAAQA,EAAK1yB,EAAO3f,KAAK+b,KAC3D,OAAO,IAAIu2B,EAAU3yB,EAAQjF,EAAOqB,IAK5C61B,EAAY1/B,UAAUqgC,WAAa,SAAqB73B,GACtD,OAAOtb,KAAKwb,IAAMxb,KAAKu3B,cAAgBjc,EAAME,IAAMF,EAAMic,cAK3Dib,EAAY1/B,UAAU2T,IAAM,SAAcnL,GACxC,OAAOA,EAAME,IAAMxb,KAAKwb,IAAMF,EAAQtb,MAKxCwyC,EAAY1/B,UAAU+T,IAAM,SAAcvL,GACxC,OAAOA,EAAME,IAAMxb,KAAKwb,IAAMF,EAAQtb,MAGxCwyC,EAAY1/B,UAAUjP,SAAW,WAI/B,IAHE,IAAI0c,EAASvgB,KAEX69B,EAAM,GACDzzB,EAAI,EAAGA,GAAKpK,KAAK4c,MAAOxS,IAC7ByzB,IAAQA,EAAM,IAAM,IAAMtd,EAAO3f,KAAKwJ,GAAG7L,KAAKd,KAAO,IAAM8iB,EAAOrc,MAAMkG,EAAI,GAChF,OAAOyzB,EAAM,IAAM79B,KAAKu3B,cAG1Bib,EAAY13B,QAAU,SAAkBF,EAAKY,GAC3C,KAAMA,GAAO,GAAKA,GAAOZ,EAAIM,QAAQysB,MAAS,MAAM,IAAIzpC,WAAW,YAAcsd,EAAM,iBAGvF,IAFA,IAAIi3B,EAAO,GACPjsB,EAAQ,EAAG+Q,EAAe/b,EACrB5a,EAAOga,IAAO,CACrB,IAAI2E,EAAM3e,EAAKsa,QAAQ7Q,UAAUktB,GAC3BrzB,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OACf4uC,EAAM7b,EAAe/yB,EAEzB,GADAiuC,EAAK3wC,KAAKlB,EAAMsD,EAAOsiB,EAAQhiB,IAC1B4uC,EAAO,MAEZ,GADAxyC,EAAOA,EAAK4B,MAAM0B,GACdtD,EAAK64B,OAAU,MACnBlC,EAAe6b,EAAM,EACrB5sB,GAAShiB,EAAS,EAEpB,OAAO,IAAIguC,EAAYh3B,EAAKi3B,EAAMlb,IAGpCib,EAAYa,cAAgB,SAAwBz4B,EAAKY,GACvD,IAAK,IAAIpR,EAAI,EAAGA,EAAIkpC,EAAa1xC,OAAQwI,IAAK,CAC5C,IAAImpC,EAASD,EAAalpC,GAC1B,GAAImpC,EAAO/3B,KAAOA,GAAO+3B,EAAO34B,KAAOA,EAAO,OAAO24B,EAEvD,IAAI/yC,EAAS8yC,EAAaE,GAAmBhB,EAAY13B,QAAQF,EAAKY,GAEtE,OADAg4B,GAAmBA,EAAkB,GAAKC,EACnCjzC,GAGTrB,OAAOo9B,iBAAkBiW,EAAY1/B,UAAW4/B,GAEhD,IAAIY,EAAe,GACfE,EAAkB,EAClBC,EAAmB,GAInBP,EAAY,SAAmBn0B,EAAOD,EAAKlC,GAM7C5c,KAAK+e,MAAQA,EAGb/e,KAAK8e,IAAMA,EAEX9e,KAAK4c,MAAQA,GAGX82B,EAAyB,CAAEltB,MAAO,GAAG/gB,IAAK,GAAGkC,OAAQ,GAAG8vB,WAAY,GAAGE,SAAU,IAGrF+b,EAAuBltB,MAAMnC,IAAM,WAAc,OAAOrkB,KAAK+e,MAAMvX,OAAOxH,KAAK4c,MAAQ,IAEvF82B,EAAuBjuC,IAAI4e,IAAM,WAAc,OAAOrkB,KAAK8e,IAAIrB,MAAMzd,KAAK4c,MAAQ,IAGlF82B,EAAuB/rC,OAAO0c,IAAM,WAAc,OAAOrkB,KAAK+e,MAAMne,KAAKZ,KAAK4c,QAE9E82B,EAAuBjc,WAAWpT,IAAM,WAAc,OAAOrkB,KAAK+e,MAAM7a,MAAMlE,KAAK4c,QAEnF82B,EAAuB/b,SAAStT,IAAM,WAAc,OAAOrkB,KAAK8e,IAAIjC,WAAW7c,KAAK4c,QAEpFzd,OAAOo9B,iBAAkB2W,EAAUpgC,UAAW4gC,GAE9C,IAAIC,EAAax0C,OAAO/B,OAAO,MAc3BqmC,EAAO,SAAcllC,EAAMs2B,EAAO3Z,EAAS+b,GAG7Cj3B,KAAKzB,KAAOA,EAMZyB,KAAK60B,MAAQA,EAIb70B,KAAKkb,QAAUA,GAAWqzB,EAASnzB,MAKnCpb,KAAKi3B,MAAQA,GAASqM,EAAKiN,MAGzBqD,EAAqB,CAAEhyB,SAAU,GAAG9E,WAAY,GAAGhF,YAAa,GAAG1I,WAAY,GAAG6N,UAAW,GAAGgyB,QAAS,GAAGnzB,YAAa,GAAGwB,cAAe,GAAGy1B,SAAU,GAAGtZ,OAAQ,GAAGuV,OAAQ,GAAGzxB,OAAQ,IAW7Lq2B,EAAmBhyB,SAASyC,IAAM,WAAc,OAAOrkB,KAAKgvC,OAAS,EAAI,EAAIhvC,KAAKkb,QAAQysB,MAI1FiM,EAAmB92B,WAAWuH,IAAM,WAAc,OAAOrkB,KAAKkb,QAAQ4B,YAKtE2mB,EAAK3wB,UAAUtQ,MAAQ,SAAgB0B,GAAS,OAAOlE,KAAKkb,QAAQ1Y,MAAM0B,IAI1Eu/B,EAAK3wB,UAAUiK,WAAa,SAAqB7Y,GAAS,OAAOlE,KAAKkb,QAAQ6B,WAAW7Y,IAKzFu/B,EAAK3wB,UAAUxT,QAAU,SAAkBmvC,GAAKzuC,KAAKkb,QAAQ5b,QAAQmvC,IAUrEhL,EAAK3wB,UAAUokB,aAAe,SAAuBrR,EAAMC,EAAI2oB,EAAG/W,QAC5C,IAAbA,IAAsBA,EAAW,GAExC13B,KAAKkb,QAAQgc,aAAarR,EAAMC,EAAI2oB,EAAG/W,EAAU13B,OAMnDyjC,EAAK3wB,UAAU67B,YAAc,SAAsBF,GACjDzuC,KAAKk3B,aAAa,EAAGl3B,KAAKkb,QAAQysB,KAAM8G,IAM1CmF,EAAmB97B,YAAYuM,IAAM,WAAc,OAAOrkB,KAAK4uC,YAAY,EAAG5uC,KAAKkb,QAAQysB,KAAM,KAOjGlE,EAAK3wB,UAAU87B,YAAc,SAAsB/oB,EAAMC,EAAI+oB,EAAgBC,GAC3E,OAAO9uC,KAAKkb,QAAQ0zB,YAAY/oB,EAAMC,EAAI+oB,EAAgBC,IAM5D8E,EAAmBxkC,WAAWiV,IAAM,WAAc,OAAOrkB,KAAKkb,QAAQ9L,YAKtEwkC,EAAmB32B,UAAUoH,IAAM,WAAc,OAAOrkB,KAAKkb,QAAQ+B,WAIrEwmB,EAAK3wB,UAAUuI,GAAK,SAAaC,GAC/B,OAAOtb,MAAQsb,GAAUtb,KAAK6tC,WAAWvyB,IAAUtb,KAAKkb,QAAQG,GAAGC,EAAMJ,UAM3EuoB,EAAK3wB,UAAU+6B,WAAa,SAAqBvyB,GAC/C,OAAOtb,KAAKm4B,UAAU7c,EAAM/c,KAAM+c,EAAMuZ,MAAOvZ,EAAM2b,QAMvDwM,EAAK3wB,UAAUqlB,UAAY,SAAoB55B,EAAMs2B,EAAOoC,GAC1D,OAAOj3B,KAAKzB,MAAQA,GAClBsxC,EAAY7vC,KAAK60B,MAAOA,GAASt2B,EAAKs1C,cAAgBF,IACtDrQ,EAAK+M,QAAQrwC,KAAKi3B,MAAOA,GAASqM,EAAKiN,OAM3C9M,EAAK3wB,UAAUuf,KAAO,SAAenX,GAGnC,YAFmB,IAAZA,IAAqBA,EAAU,MAElCA,GAAWlb,KAAKkb,QAAkBlb,KAC/B,IAAIA,KAAKoC,YAAYpC,KAAKzB,KAAMyB,KAAK60B,MAAO3Z,EAASlb,KAAKi3B,QAMnEwM,EAAK3wB,UAAUqkB,KAAO,SAAeF,GACnC,OAAOA,GAASj3B,KAAKi3B,MAAQj3B,KAAO,IAAIA,KAAKoC,YAAYpC,KAAKzB,KAAMyB,KAAK60B,MAAO70B,KAAKkb,QAAS+b,IAOhGwM,EAAK3wB,UAAU4mB,IAAM,SAAc7T,EAAMC,GACvC,OAAY,GAARD,GAAaC,GAAM9lB,KAAKkb,QAAQysB,KAAe3nC,KAC5CA,KAAKqyB,KAAKryB,KAAKkb,QAAQwe,IAAI7T,EAAMC,KAM1C2d,EAAK3wB,UAAUhI,MAAQ,SAAgB+a,EAAMC,EAAIguB,GAI/C,QAHc,IAAPhuB,IAAgBA,EAAK9lB,KAAKkb,QAAQysB,WACf,IAAnBmM,IAA4BA,GAAiB,GAEhDjuB,GAAQC,EAAM,OAAO3K,EAAMC,MAE/B,IAAI2D,EAAQ/e,KAAK8a,QAAQ+K,GAAO/G,EAAM9e,KAAK8a,QAAQgL,GAC/ClJ,EAAQk3B,EAAiB,EAAI/0B,EAAMi0B,YAAYltB,GAC/CU,EAAQzH,EAAMyH,MAAM5J,GAAQhc,EAAOme,EAAMne,KAAKgc,GAC9C1B,EAAUta,EAAKsa,QAAQwe,IAAI3a,EAAMvD,IAAMgL,EAAO1H,EAAItD,IAAMgL,GAC5D,OAAO,IAAIrL,EAAMD,EAAS6D,EAAMnC,MAAQA,EAAOkC,EAAIlC,MAAQA,IAU7D6mB,EAAK3wB,UAAU1S,QAAU,SAAoBylB,EAAMC,EAAIhb,GACrD,OAAO1K,EAAQJ,KAAK8a,QAAQ+K,GAAO7lB,KAAK8a,QAAQgL,GAAKhb,IAKvD24B,EAAK3wB,UAAUiN,OAAS,SAAiBvE,GACvC,IAAK,IAAI5a,EAAOZ,OAAQ,CACtB,IAAIuf,EAAM3e,EAAKsa,QAAQ7Q,UAAUmR,GAC3BtX,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OAEnB,GADA5D,EAAOA,EAAKmc,WAAW7Y,IAClBtD,EAAQ,OAAO,KACpB,GAAI4D,GAAUgX,GAAO5a,EAAK64B,OAAU,OAAO74B,EAC3C4a,GAAOhX,EAAS,IAQpBi/B,EAAK3wB,UAAUwkB,WAAa,SAAqB9b,GAC/C,IAAI+D,EAAMvf,KAAKkb,QAAQ7Q,UAAUmR,GAC3BtX,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OACnB,MAAO,CAAC5D,KAAMZ,KAAKkb,QAAQ6B,WAAW7Y,GAAQA,MAAOA,EAAOM,OAAQA,IAOtEi/B,EAAK3wB,UAAUihC,YAAc,SAAsBv4B,GACjD,GAAW,GAAPA,EAAY,MAAO,CAAC5a,KAAM,KAAMsD,MAAO,EAAGM,OAAQ,GACtD,IAAI+a,EAAMvf,KAAKkb,QAAQ7Q,UAAUmR,GAC3BtX,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OACnB,GAAIA,EAASgX,EAAO,MAAO,CAAC5a,KAAMZ,KAAKkb,QAAQ1Y,MAAM0B,GAAQA,MAAOA,EAAOM,OAAQA,GACnF,IAAI5D,EAAOZ,KAAKkb,QAAQ1Y,MAAM0B,EAAQ,GACtC,MAAO,CAACtD,KAAMA,EAAMsD,MAAOA,EAAQ,EAAGM,OAAQA,EAAS5D,EAAKghB,WAM9D6hB,EAAK3wB,UAAUgI,QAAU,SAAkBU,GAAO,OAAOg3B,EAAYa,cAAcrzC,KAAMwb,IAEzFioB,EAAK3wB,UAAUo/B,eAAiB,SAAyB12B,GAAO,OAAOg3B,EAAY13B,QAAQ9a,KAAMwb,IAKjGioB,EAAK3wB,UAAUklB,aAAe,SAAuBnS,EAAMC,EAAIvnB,GAC7D,IAAIgxC,GAAQ,EAKZ,OAJIzpB,EAAKD,GAAQ7lB,KAAKk3B,aAAarR,EAAMC,GAAI,SAAUllB,GAErD,OADIrC,EAAKs5B,QAAQj3B,EAAKq2B,SAAUsY,GAAQ,IAChCA,KAEHA,GAKTqE,EAAmB3E,QAAQ5qB,IAAM,WAAc,OAAOrkB,KAAKzB,KAAK0wC,SAKhE2E,EAAmB93B,YAAYuI,IAAM,WAAc,OAAOrkB,KAAKzB,KAAKud,aAIpE83B,EAAmBt2B,cAAc+G,IAAM,WAAc,OAAOrkB,KAAKzB,KAAK+e,eAKtEs2B,EAAmBb,SAAS1uB,IAAM,WAAc,OAAOrkB,KAAKzB,KAAKw0C,UAIjEa,EAAmBna,OAAOpV,IAAM,WAAc,OAAOrkB,KAAKzB,KAAKk7B,QAI/Dma,EAAmB5E,OAAO3qB,IAAM,WAAc,OAAOrkB,KAAKzB,KAAKywC,QAQ/D4E,EAAmBr2B,OAAO8G,IAAM,WAAc,OAAOrkB,KAAKzB,KAAKgf,QAK/DkmB,EAAK3wB,UAAUjP,SAAW,WACxB,GAAI7D,KAAKzB,KAAK2d,KAAK83B,cAAiB,OAAOh0C,KAAKzB,KAAK2d,KAAK83B,cAAch0C,MACxE,IAAIvC,EAAOuC,KAAKzB,KAAKd,KAGrB,OAFIuC,KAAKkb,QAAQysB,OACblqC,GAAQ,IAAMuC,KAAKkb,QAAQ00B,gBAAkB,KAC1CqE,EAAUj0C,KAAKi3B,MAAOx5B,IAK/BgmC,EAAK3wB,UAAUuJ,eAAiB,SAAyBnY,GACvD,IAAID,EAAQjE,KAAKzB,KAAK21C,aAAaC,cAAcn0C,KAAKkb,QAAS,EAAGhX,GAClE,IAAKD,EAAS,MAAM,IAAI5G,MAAM,wDAC9B,OAAO4G,GASTw/B,EAAK3wB,UAAUk+B,WAAa,SAAqBnrB,EAAMC,EAAIsuB,EAAa5tB,EAAO/gB,GAC3E,IAAI8a,EAASvgB,UACQ,IAAhBo0C,IAAyBA,EAAc7F,EAASnzB,YACtC,IAAVoL,IAAmBA,EAAQ,QACnB,IAAR/gB,IAAiBA,EAAM2uC,EAAYt3B,YAE1C,IAAIu3B,EAAMr0C,KAAKqc,eAAewJ,GAAMsuB,cAAcC,EAAa5tB,EAAO/gB,GAClE6uC,EAAMD,GAAOA,EAAIF,cAAcn0C,KAAKkb,QAAS4K,GACjD,IAAKwuB,IAAQA,EAAIC,SAAY,OAAO,EACpC,IAAK,IAAInqC,EAAIoc,EAAOpc,EAAI3E,EAAK2E,IAAO,IAAKmW,EAAOhiB,KAAKi2C,YAAYJ,EAAY5xC,MAAM4H,GAAG6sB,OAAU,OAAO,EACvG,OAAO,GAMTwM,EAAK3wB,UAAU2hC,eAAiB,SAAyB5uB,EAAMC,EAAIvnB,EAAM04B,GACvE,GAAIA,IAAUj3B,KAAKzB,KAAKi2C,YAAYvd,GAAU,OAAO,EACrD,IAAIzQ,EAAQxmB,KAAKqc,eAAewJ,GAAM6uB,UAAUn2C,GAC5CkH,EAAM+gB,GAASA,EAAM2tB,cAAcn0C,KAAKkb,QAAS4K,GACrD,QAAOrgB,GAAMA,EAAI8uC,UAQnB9Q,EAAK3wB,UAAU6hC,UAAY,SAAoBr5B,GAC7C,OAAIA,EAAMJ,QAAQysB,KAAe3nC,KAAKgxC,WAAWhxC,KAAK8c,WAAY9c,KAAK8c,WAAYxB,EAAMJ,SAC3Elb,KAAKzB,KAAKizC,kBAAkBl2B,EAAM/c,OAIlDklC,EAAK3wB,UAAU8hC,mBAAqB,SAA6BC,GAC/D,OAAO70C,KAAKqc,eAAew4B,GAAIv4B,aAMjCmnB,EAAK3wB,UAAUgiC,MAAQ,WACrB,IAAK90C,KAAKzB,KAAKs8B,aAAa76B,KAAKkb,SAC7B,MAAM,IAAIhd,WAAY,4BAA+B8B,KAAKzB,KAAS,KAAI,KAAQyB,KAAKkb,QAAQrX,WAAWiH,MAAM,EAAG,KACpH9K,KAAKkb,QAAQ5b,SAAQ,SAAUsB,GAAQ,OAAOA,EAAKk0C,YAKrDrR,EAAK3wB,UAAUyI,OAAS,WACpB,IAAIgF,EAASvgB,KAEXpB,EAAM,CAACL,KAAMyB,KAAKzB,KAAKd,MAC3B,IAAK,IAAI2yC,KAAK7vB,EAAOsU,MAAO,CAC1Bj2B,EAAIi2B,MAAQtU,EAAOsU,MACnB,MAMF,OAJI70B,KAAKkb,QAAQysB,OACb/oC,EAAIsc,QAAUlb,KAAKkb,QAAQK,UAC3Bvb,KAAKi3B,MAAMr1B,SACXhD,EAAIq4B,MAAQj3B,KAAKi3B,MAAMxzB,KAAI,SAAUsgB,GAAK,OAAOA,EAAExI,aAChD3c,GAKT6kC,EAAKhoB,SAAW,SAAmB6e,EAAQ5e,GACzC,IAAKA,EAAQ,MAAM,IAAIxd,WAAW,mCAClC,IAAI+4B,EAAQ,KACZ,GAAIvb,EAAKub,MAAO,CACd,IAAKhvB,MAAMC,QAAQwT,EAAKub,OAAU,MAAM,IAAI/4B,WAAW,uCACvD+4B,EAAQvb,EAAKub,MAAMxzB,IAAI62B,EAAOya,cAEhC,GAAiB,QAAbr5B,EAAKnd,KAAgB,CACvB,GAAwB,iBAAbmd,EAAKta,KAAoB,MAAM,IAAIlD,WAAW,6BACzD,OAAOo8B,EAAOl5B,KAAKsa,EAAKta,KAAM61B,GAEhC,IAAI/b,EAAUqzB,EAAS9yB,SAAS6e,EAAQ5e,EAAKR,SAC7C,OAAOof,EAAOhrB,SAASoM,EAAKnd,MAAMnB,OAAOse,EAAKmZ,MAAO3Z,EAAS+b,IAGhE93B,OAAOo9B,iBAAkBkH,EAAK3wB,UAAW8gC,GAEzC,IAAIoB,EAAY,SAAUvR,GACxB,SAASuR,EAASz2C,EAAMs2B,EAAO3Z,EAAS+b,GAGtC,GAFAwM,EAAK1zB,KAAK/P,KAAMzB,EAAMs2B,EAAO,KAAMoC,IAE9B/b,EAAW,MAAM,IAAIhd,WAAW,oCAErC8B,KAAKoB,KAAO8Z,EAGTuoB,IAAOuR,EAAS3tC,UAAYo8B,GACjCuR,EAASliC,UAAY3T,OAAO/B,OAAQqmC,GAAQA,EAAK3wB,WACjDkiC,EAASliC,UAAU1Q,YAAc4yC,EAEjC,IAAIxG,EAAuB,CAAE12B,YAAa,GAAG8J,SAAU,IA0CvD,OAxCAozB,EAASliC,UAAUjP,SAAW,WAC5B,OAAI7D,KAAKzB,KAAK2d,KAAK83B,cAAwBh0C,KAAKzB,KAAK2d,KAAK83B,cAAch0C,MACjEi0C,EAAUj0C,KAAKi3B,MAAOh1B,KAAKC,UAAUlC,KAAKoB,QAGnDotC,EAAqB12B,YAAYuM,IAAM,WAAc,OAAOrkB,KAAKoB,MAEjE4zC,EAASliC,UAAU87B,YAAc,SAAsB/oB,EAAMC,GAAM,OAAO9lB,KAAKoB,KAAK0J,MAAM+a,EAAMC,IAEhG0oB,EAAqB5sB,SAASyC,IAAM,WAAc,OAAOrkB,KAAKoB,KAAKQ,QAEnEozC,EAASliC,UAAUqkB,KAAO,SAAeF,GACvC,OAAOA,GAASj3B,KAAKi3B,MAAQj3B,KAAO,IAAIg1C,EAASh1C,KAAKzB,KAAMyB,KAAK60B,MAAO70B,KAAKoB,KAAM61B,IAGrF+d,EAASliC,UAAUo8B,SAAW,SAAmB9tC,GAC/C,OAAIA,GAAQpB,KAAKoB,KAAepB,KACzB,IAAIg1C,EAASh1C,KAAKzB,KAAMyB,KAAK60B,MAAOzzB,EAAMpB,KAAKi3B,QAGxD+d,EAASliC,UAAU4mB,IAAM,SAAc7T,EAAMC,GAI3C,YAHc,IAATD,IAAkBA,EAAO,QAClB,IAAPC,IAAgBA,EAAK9lB,KAAKoB,KAAKQ,QAExB,GAARikB,GAAaC,GAAM9lB,KAAKoB,KAAKQ,OAAiB5B,KAC3CA,KAAKkvC,SAASlvC,KAAKoB,KAAK0J,MAAM+a,EAAMC,KAG7CkvB,EAASliC,UAAUuI,GAAK,SAAaC,GACnC,OAAOtb,KAAK6tC,WAAWvyB,IAAUtb,KAAKoB,MAAQka,EAAMla,MAGtD4zC,EAASliC,UAAUyI,OAAS,WAC1B,IAAIqR,EAAO6W,EAAK3wB,UAAUyI,OAAOxL,KAAK/P,MAEtC,OADA4sB,EAAKxrB,KAAOpB,KAAKoB,KACVwrB,GAGTztB,OAAOo9B,iBAAkByY,EAASliC,UAAW07B,GAEtCwG,EAvDM,CAwDbvR,GAEF,SAASwQ,EAAUhd,EAAO4G,GACxB,IAAK,IAAIzzB,EAAI6sB,EAAMr1B,OAAS,EAAGwI,GAAK,EAAGA,IACnCyzB,EAAM5G,EAAM7sB,GAAG7L,KAAKd,KAAO,IAAMogC,EAAM,IAC3C,OAAOA,EAOT,IAAIoX,EAAe,SAAsBV,GAGvCv0C,KAAKu0C,SAAWA,EAChBv0C,KAAK0c,KAAO,GACZ1c,KAAKk1C,UAAY,IAGfC,EAAuB,CAAE73B,cAAe,GAAGhB,YAAa,GAAG84B,UAAW,IAE1EH,EAAatO,MAAQ,SAAgB0O,EAAQC,GAC3C,IAAInlC,EAAS,IAAIolC,EAAYF,EAAQC,GACrC,GAAmB,MAAfnlC,EAAOuM,KAAgB,OAAOu4B,EAAa75B,MAC/C,IAAIo6B,EAAOC,EAAUtlC,GACjBA,EAAOuM,MAAQvM,EAAOmF,IAAI,4BAC9B,IAAIrR,EAAQyxC,GAAIC,EAAIH,IAEpB,OADAI,GAAiB3xC,EAAOkM,GACjBlM,GAMTgxC,EAAaniC,UAAU4hC,UAAY,SAAoBn2C,GAGrD,IAFE,IAAIgiB,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAK0c,KAAK9a,OAAQwI,GAAK,EACvC,GAAImW,EAAO7D,KAAKtS,IAAM7L,EAAQ,OAAOgiB,EAAO7D,KAAKtS,EAAI,GACzD,OAAO,MAMT6qC,EAAaniC,UAAUqhC,cAAgB,SAAwB0B,EAAMrvB,EAAO/gB,QACzD,IAAV+gB,IAAmBA,EAAQ,QACnB,IAAR/gB,IAAiBA,EAAMowC,EAAK/4B,YAGnC,IADA,IAAI6yB,EAAM3vC,KACDoK,EAAIoc,EAAOmpB,GAAOvlC,EAAI3E,EAAK2E,IAChCulC,EAAMA,EAAI+E,UAAUmB,EAAKrzC,MAAM4H,GAAG7L,MACtC,OAAOoxC,GAGTwF,EAAqB73B,cAAc+G,IAAM,WACvC,IAAImR,EAAQx1B,KAAK0c,KAAK,GACtB,QAAO8Y,GAAQA,EAAMud,UAMvBoC,EAAqB74B,YAAY+H,IAAM,WAGrC,IAFE,IAAI9D,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAK0c,KAAK9a,OAAQwI,GAAK,EAAG,CAC5C,IAAI7L,EAAOgiB,EAAO7D,KAAKtS,GACvB,IAAM7L,EAAKk7B,SAAUl7B,EAAKu3C,mBAAuB,OAAOv3C,IAI5D02C,EAAaniC,UAAUijC,WAAa,SAAqBz6B,GAGvD,IAFE,IAAIiF,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAK0c,KAAK9a,OAAQwI,GAAK,EACvC,IAAK,IAAI0jC,EAAI,EAAGA,EAAIxyB,EAAMoB,KAAK9a,OAAQksC,GAAK,EAC1C,GAAIvtB,EAAO7D,KAAKtS,IAAMkR,EAAMoB,KAAKoxB,GAAM,OAAO,EACpD,OAAO,GAUTmH,EAAaniC,UAAUkjC,WAAa,SAAqBv4B,EAAOw4B,EAAOxe,QACpD,IAAVwe,IAAmBA,GAAQ,QACZ,IAAfxe,IAAwBA,EAAa,GAE5C,IAAIye,EAAO,CAACl2C,MACZ,SAASm2C,EAAOlyC,EAAO4kC,GACrB,IAAIuN,EAAWnyC,EAAMkwC,cAAc12B,EAAOga,GAC1C,GAAI2e,KAAcH,GAASG,EAAS7B,UAChC,OAAOhG,EAAS1oB,KAAKgjB,EAAMplC,KAAI,SAAU4yC,GAAM,OAAOA,EAAGC,oBAE7D,IAAK,IAAIlsC,EAAI,EAAGA,EAAInG,EAAMyY,KAAK9a,OAAQwI,GAAK,EAAG,CAC7C,IAAI7L,EAAO0F,EAAMyY,KAAKtS,GAAIsS,EAAOzY,EAAMyY,KAAKtS,EAAI,GAChD,IAAM7L,EAAKk7B,SAAUl7B,EAAKu3C,qBAA8C,GAAvBI,EAAKrd,QAAQnc,GAAa,CACzEw5B,EAAKp0C,KAAK4a,GACV,IAAI6yB,EAAQ4G,EAAOz5B,EAAMmsB,EAAMvlC,OAAO/E,IACtC,GAAIgxC,EAAS,OAAOA,IAK1B,OAAO4G,EAAOn2C,KAAM,KAQtBi1C,EAAaniC,UAAUyjC,aAAe,SAAuBvzB,GAG3D,IAFE,IAAIzC,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAKk1C,UAAUtzC,OAAQwI,GAAK,EAC5C,GAAImW,EAAO20B,UAAU9qC,IAAM4Y,EAAU,OAAOzC,EAAO20B,UAAU9qC,EAAI,GACrE,IAAIqD,EAAWzN,KAAKw2C,gBAAgBxzB,GAEpC,OADAhjB,KAAKk1C,UAAUpzC,KAAKkhB,EAAQvV,GACrBA,GAGTwnC,EAAaniC,UAAU0jC,gBAAkB,SAA0BxzB,GACjE,IAAIkzB,EAAO/2C,OAAO/B,OAAO,MAAOq5C,EAAS,CAAC,CAACxyC,MAAOjE,KAAMzB,KAAM,KAAMm4C,IAAK,OACzE,MAAOD,EAAO70C,OAAQ,CACpB,IAAIoT,EAAUyhC,EAAOvmB,QAASjsB,EAAQ+Q,EAAQ/Q,MAC9C,GAAIA,EAAMywC,UAAU1xB,GAAS,CAE3B,IADA,IAAIxiB,EAAS,GACJ5B,EAAMoW,EAASpW,EAAIL,KAAMK,EAAMA,EAAI83C,IACxCl2C,EAAOsB,KAAKlD,EAAIL,MACpB,OAAOiC,EAAO4P,UAEhB,IAAK,IAAIhG,EAAI,EAAGA,EAAInG,EAAMyY,KAAK9a,OAAQwI,GAAK,EAAG,CAC7C,IAAI7L,EAAO0F,EAAMyY,KAAKtS,GACjB7L,EAAKywC,QAAWzwC,EAAKu3C,oBAAwBv3C,EAAKd,QAAQy4C,GAAWlhC,EAAQzW,OAAQ0F,EAAMyY,KAAKtS,EAAI,GAAGmqC,WAC1GkC,EAAO30C,KAAK,CAACmC,MAAO1F,EAAK21C,aAAc31C,KAAMA,EAAMm4C,IAAK1hC,IACxDkhC,EAAK33C,EAAKd,OAAQ,MAS1B03C,EAAqBC,UAAU/wB,IAAM,WACnC,OAAOrkB,KAAK0c,KAAK9a,QAAU,GAM7BqzC,EAAaniC,UAAU6jC,KAAO,SAAe5yB,GAC3C,IAAI3Z,EAAI2Z,GAAK,EACb,GAAI3Z,EAAIpK,KAAK0c,KAAK9a,OAAU,MAAM,IAAI1D,WAAY,cAAgB6lB,EAAI,iCACtE,MAAO,CAACxlB,KAAMyB,KAAK0c,KAAKtS,GAAIsS,KAAM1c,KAAK0c,KAAKtS,EAAI,KAGlD6qC,EAAaniC,UAAUjP,SAAW,WAChC,IAAIqyC,EAAO,GACX,SAASU,EAAKjxC,GACZuwC,EAAKp0C,KAAK6D,GACV,IAAK,IAAIyE,EAAI,EAAGA,EAAIzE,EAAE+W,KAAK9a,OAAQwI,GAAK,GACJ,GAA5B8rC,EAAKrd,QAAQlzB,EAAE+W,KAAKtS,KAAawsC,EAAKjxC,EAAE+W,KAAKtS,IAGvD,OADAwsC,EAAK52C,MACEk2C,EAAKzyC,KAAI,SAAUkC,EAAGyE,GAE3B,IADA,IAAI3F,EAAM2F,GAAKzE,EAAE4uC,SAAW,IAAM,KAAO,IAChCjqB,EAAM,EAAGA,EAAM3kB,EAAE+W,KAAK9a,OAAQ0oB,GAAO,EAC1C7lB,IAAQ6lB,EAAM,KAAO,IAAM3kB,EAAE+W,KAAK4N,GAAK7sB,KAAO,KAAOy4C,EAAKrd,QAAQlzB,EAAE+W,KAAK4N,EAAM,IACnF,OAAO7lB,KACN9B,KAAK,OAGVxD,OAAOo9B,iBAAkB0Y,EAAaniC,UAAWqiC,GAEjDF,EAAa75B,MAAQ,IAAI65B,GAAa,GAEtC,IAAIM,EAAc,SAAqBF,EAAQC,GAC7Ct1C,KAAKq1C,OAASA,EACdr1C,KAAKs1C,UAAYA,EACjBt1C,KAAK62C,OAAS,KACd72C,KAAKwb,IAAM,EACXxb,KAAK82C,OAASzB,EAAOztC,MAAM,kBACgB,IAAvC5H,KAAK82C,OAAO92C,KAAK82C,OAAOl1C,OAAS,IAAY5B,KAAK82C,OAAO/0C,MACvC,IAAlB/B,KAAK82C,OAAO,IAAY92C,KAAK82C,OAAO7hC,WAGtC8hC,EAAyB,CAAEr6B,KAAM,IAUrC,SAAS+4B,EAAUtlC,GACjB,IAAI6mC,EAAQ,GACZ,GAAKA,EAAMl1C,KAAKm1C,EAAa9mC,UACtBA,EAAO+mC,IAAI,MAClB,OAAuB,GAAhBF,EAAMp1C,OAAco1C,EAAM,GAAK,CAACz4C,KAAM,SAAUy4C,MAAOA,GAGhE,SAASC,EAAa9mC,GACpB,IAAI6mC,EAAQ,GACZ,GAAKA,EAAMl1C,KAAKq1C,EAAmBhnC,UAC5BA,EAAOuM,MAAuB,KAAfvM,EAAOuM,MAA8B,KAAfvM,EAAOuM,MACnD,OAAuB,GAAhBs6B,EAAMp1C,OAAco1C,EAAM,GAAK,CAACz4C,KAAM,MAAOy4C,MAAOA,GAG7D,SAASG,EAAmBhnC,GAE1B,IADA,IAAIqlC,EAAO4B,EAAcjnC,KAEvB,GAAIA,EAAO+mC,IAAI,KACX1B,EAAO,CAACj3C,KAAM,OAAQi3C,KAAMA,QAC3B,GAAIrlC,EAAO+mC,IAAI,KAChB1B,EAAO,CAACj3C,KAAM,OAAQi3C,KAAMA,QAC3B,GAAIrlC,EAAO+mC,IAAI,KAChB1B,EAAO,CAACj3C,KAAM,MAAOi3C,KAAMA,OAC1B,KAAIrlC,EAAO+mC,IAAI,KAEb,MADH1B,EAAO6B,EAAelnC,EAAQqlC,GAGpC,OAAOA,EAGT,SAAS8B,EAASnnC,GACZ,KAAK2B,KAAK3B,EAAOuM,OAASvM,EAAOmF,IAAI,yBAA2BnF,EAAOuM,KAAO,KAClF,IAAIlc,EAASoE,OAAOuL,EAAOuM,MAE3B,OADAvM,EAAOqL,MACAhb,EAGT,SAAS62C,EAAelnC,EAAQqlC,GAC9B,IAAI3uB,EAAMywB,EAASnnC,GAASsW,EAAMI,EAMlC,OALI1W,EAAO+mC,IAAI,OACazwB,EAAP,KAAftW,EAAOuM,KAAqB46B,EAASnnC,IAC3B,GAEXA,EAAO+mC,IAAI,MAAQ/mC,EAAOmF,IAAI,yBAC5B,CAAC/W,KAAM,QAASsoB,IAAKA,EAAKJ,IAAKA,EAAK+uB,KAAMA,GAGnD,SAAS+B,EAAYpnC,EAAQ1S,GAC3B,IAAIorC,EAAQ14B,EAAOmlC,UAAW/2C,EAAOsqC,EAAMprC,GAC3C,GAAIc,EAAQ,MAAO,CAACA,GACpB,IAAIiC,EAAS,GACb,IAAK,IAAIg3C,KAAY3O,EAAO,CAC1B,IAAI4O,EAAS5O,EAAM2O,GACfC,EAAOC,OAAO7e,QAAQp7B,IAAS,GAAK+C,EAAOsB,KAAK21C,GAGtD,OADqB,GAAjBj3C,EAAOoB,QAAeuO,EAAOmF,IAAI,0BAA4B7X,EAAO,WACjE+C,EAGT,SAAS42C,EAAcjnC,GACrB,GAAIA,EAAO+mC,IAAI,KAAM,CACnB,IAAI1B,EAAOC,EAAUtlC,GAErB,OADKA,EAAO+mC,IAAI,MAAQ/mC,EAAOmF,IAAI,yBAC5BkgC,EACF,IAAK,KAAK1jC,KAAK3B,EAAOuM,MAAO,CAClC,IAAIs6B,EAAQO,EAAYpnC,EAAQA,EAAOuM,MAAMjZ,KAAI,SAAUlF,GAGzD,OAFqB,MAAjB4R,EAAO0mC,OAAkB1mC,EAAO0mC,OAASt4C,EAAKw0C,SACzC5iC,EAAO0mC,QAAUt4C,EAAKw0C,UAAY5iC,EAAOmF,IAAI,mCAC/C,CAAC/W,KAAM,OAAQ4B,MAAO5B,MAG/B,OADA4R,EAAOqL,MACgB,GAAhBw7B,EAAMp1C,OAAco1C,EAAM,GAAK,CAACz4C,KAAM,SAAUy4C,MAAOA,GAE9D7mC,EAAOmF,IAAI,qBAAuBnF,EAAOuM,KAAO,KAiBpD,SAASi5B,EAAIH,GACX,IAAIG,EAAM,CAAC,IAEX,OADAgC,EAAQ3sC,EAAQwqC,EAAM,GAAI50C,KACnB+0C,EAEP,SAAS/0C,IAAS,OAAO+0C,EAAI7zC,KAAK,IAAM,EACxC,SAAS60C,EAAK9wB,EAAMC,EAAIva,GACtB,IAAIorC,EAAO,CAACprC,KAAMA,EAAMua,GAAIA,GAE5B,OADA6vB,EAAI9vB,GAAM/jB,KAAK60C,GACRA,EAET,SAASgB,EAAQC,EAAO9xB,GAAM8xB,EAAMt4C,SAAQ,SAAUq3C,GAAQ,OAAOA,EAAK7wB,GAAKA,KAE/E,SAAS9a,EAAQwqC,EAAM3vB,GACrB,GAAiB,UAAb2vB,EAAKj3C,KACP,OAAOi3C,EAAKwB,MAAMpV,QAAO,SAAUn9B,EAAK+wC,GAAQ,OAAO/wC,EAAInB,OAAO0H,EAAQwqC,EAAM3vB,MAAW,IACtF,GAAiB,OAAb2vB,EAAKj3C,KACd,IAAK,IAAI6L,EAAI,GAAIA,IAAK,CACpB,IAAIsS,EAAO1R,EAAQwqC,EAAKwB,MAAM5sC,GAAIyb,GAClC,GAAIzb,GAAKorC,EAAKwB,MAAMp1C,OAAS,EAAK,OAAO8a,EACzCi7B,EAAQj7B,EAAMmJ,EAAOjlB,SAElB,IAAiB,QAAb40C,EAAKj3C,KAAgB,CAC9B,IAAIs5C,EAAOj3C,IAGX,OAFA+1C,EAAK9wB,EAAMgyB,GACXF,EAAQ3sC,EAAQwqC,EAAKA,KAAMqC,GAAOA,GAC3B,CAAClB,EAAKkB,IACR,GAAiB,QAAbrC,EAAKj3C,KAAgB,CAC9B,IAAIu5C,EAASl3C,IAGb,OAFA+2C,EAAQ3sC,EAAQwqC,EAAKA,KAAM3vB,GAAOiyB,GAClCH,EAAQ3sC,EAAQwqC,EAAKA,KAAMsC,GAASA,GAC7B,CAACnB,EAAKmB,IACR,GAAiB,OAAbtC,EAAKj3C,KACd,MAAO,CAACo4C,EAAK9wB,IAAOviB,OAAO0H,EAAQwqC,EAAKA,KAAM3vB,IACzC,GAAiB,SAAb2vB,EAAKj3C,KAAiB,CAE/B,IADA,IAAIoxC,EAAM9pB,EACDyE,EAAM,EAAGA,EAAMkrB,EAAK3uB,IAAKyD,IAAO,CACvC,IAAIytB,EAASn3C,IACb+2C,EAAQ3sC,EAAQwqC,EAAKA,KAAM7F,GAAMoI,GACjCpI,EAAMoI,EAER,IAAiB,GAAbvC,EAAK/uB,IACPkxB,EAAQ3sC,EAAQwqC,EAAKA,KAAM7F,GAAMA,QAEjC,IAAK,IAAIplB,EAAMirB,EAAK3uB,IAAK0D,EAAMirB,EAAK/uB,IAAK8D,IAAO,CAC9C,IAAIytB,EAASp3C,IACb+1C,EAAKhH,EAAKqI,GACVL,EAAQ3sC,EAAQwqC,EAAKA,KAAM7F,GAAMqI,GACjCrI,EAAMqI,EAGV,MAAO,CAACrB,EAAKhH,IACR,GAAiB,QAAb6F,EAAKj3C,KACd,MAAO,CAACo4C,EAAK9wB,EAAM,KAAM2vB,EAAKr1C,UAKpC,SAAS83C,EAAIphC,EAAGC,GAAK,OAAOA,EAAID,EAKhC,SAASqhC,EAASvC,EAAK/0C,GACrB,IAAIJ,EAAS,GAEb,OADAo2C,EAAKh2C,GACEJ,EAAOoW,KAAKqhC,GAEnB,SAASrB,EAAKh2C,GACZ,IAAIg3C,EAAQjC,EAAI/0C,GAChB,GAAoB,GAAhBg3C,EAAMh2C,SAAgBg2C,EAAM,GAAGrsC,KAAQ,OAAOqrC,EAAKgB,EAAM,GAAG9xB,IAChEtlB,EAAOsB,KAAKlB,GACZ,IAAK,IAAIwJ,EAAI,EAAGA,EAAIwtC,EAAMh2C,OAAQwI,IAAK,CACrC,IAAImV,EAAMq4B,EAAMxtC,GACZmB,EAAOgU,EAAIhU,KACXua,EAAKvG,EAAIuG,GACRva,IAA+B,GAAvB/K,EAAOq4B,QAAQ/S,IAAa8wB,EAAK9wB,KASpD,SAAS4vB,GAAIC,GACX,IAAIwC,EAAUh5C,OAAO/B,OAAO,MAC5B,OAAOg7C,EAAQF,EAASvC,EAAK,IAE7B,SAASyC,EAAQC,GACf,IAAI5zC,EAAM,GACV4zC,EAAO/4C,SAAQ,SAAUsB,GACvB+0C,EAAI/0C,GAAMtB,SAAQ,SAAUigB,GAC1B,IAAIhU,EAAOgU,EAAIhU,KACXua,EAAKvG,EAAIuG,GAEb,GAAKva,EAAL,CACA,IAAI+sC,EAAQ7zC,EAAIo0B,QAAQttB,GAAOvM,EAAMs5C,GAAS,GAAK7zC,EAAI6zC,EAAQ,GAC/DJ,EAASvC,EAAK7vB,GAAIxmB,SAAQ,SAAUsB,GAC7B5B,GAAOyF,EAAI3C,KAAKyJ,EAAMvM,EAAM,KACP,GAAtBA,EAAI65B,QAAQj4B,IAAe5B,EAAI8C,KAAKlB,aAK9C,IADA,IAAI4d,EAAQ25B,EAAQE,EAAO11C,KAAK,MAAQ,IAAIsyC,EAAaoD,EAAOxf,QAAQ8c,EAAI/zC,OAAS,IAAM,GAClFwI,EAAI,EAAGA,EAAI3F,EAAI7C,OAAQwI,GAAK,EAAG,CACtC,IAAImuC,EAAW9zC,EAAI2F,EAAI,GAAGwM,KAAKqhC,GAC/Bz5B,EAAM9B,KAAK5a,KAAK2C,EAAI2F,GAAI+tC,EAAQI,EAAS51C,KAAK,OAASy1C,EAAQG,IAEjE,OAAO/5B,GAIX,SAASo3B,GAAiB3xC,EAAOkM,GAC/B,IAAK,IAAI/F,EAAI,EAAGouC,EAAO,CAACv0C,GAAQmG,EAAIouC,EAAK52C,OAAQwI,IAAK,CAEpD,IADA,IAAIoU,EAAQg6B,EAAKpuC,GAAIquC,GAAQj6B,EAAM+1B,SAAU/a,EAAQ,GAC5CsU,EAAI,EAAGA,EAAItvB,EAAM9B,KAAK9a,OAAQksC,GAAK,EAAG,CAC7C,IAAIltC,EAAO4d,EAAM9B,KAAKoxB,GAAIpxB,EAAO8B,EAAM9B,KAAKoxB,EAAI,GAChDtU,EAAM13B,KAAKlB,EAAKnD,OACZg7C,GAAU73C,EAAK64B,QAAU74B,EAAKk1C,qBAAuB2C,GAAO,IACrC,GAAvBD,EAAK3f,QAAQnc,IAAe87B,EAAK12C,KAAK4a,GAExC+7B,GAAQtoC,EAAOmF,IAAI,+BAAiCkkB,EAAM72B,KAAK,MAAQ,6BAQ/E,SAASkxC,GAAahf,GACpB,IAAI6jB,EAAWv5C,OAAO/B,OAAO,MAC7B,IAAK,IAAIu7C,KAAY9jB,EAAO,CAC1B,IAAI/kB,EAAO+kB,EAAM8jB,GACjB,IAAK7oC,EAAK8oC,WAAc,OAAO,KAC/BF,EAASC,GAAY7oC,EAAKnQ,QAE5B,OAAO+4C,EAGT,SAASG,GAAahkB,EAAO10B,GAC3B,IAAI24C,EAAQ35C,OAAO/B,OAAO,MAC1B,IAAK,IAAIK,KAAQo3B,EAAO,CACtB,IAAIkkB,EAAQ54C,GAASA,EAAM1C,GAC3B,QAAcqC,IAAVi5C,EAAqB,CACvB,IAAIjpC,EAAO+kB,EAAMp3B,GACjB,IAAIqS,EAAK8oC,WACF,MAAM,IAAI16C,WAAW,mCAAqCT,GAD1Cs7C,EAAQjpC,EAAKnQ,QAGtCm5C,EAAMr7C,GAAQs7C,EAEhB,OAAOD,EAGT,SAASE,GAAUnkB,GACjB,IAAIr0B,EAASrB,OAAO/B,OAAO,MAC3B,GAAIy3B,EAAS,IAAK,IAAIp3B,KAAQo3B,EAASr0B,EAAO/C,GAAQ,IAAIw7C,GAAUpkB,EAAMp3B,IAC1E,OAAO+C,EA/PTu2C,EAAuBr6B,KAAK2H,IAAM,WAAc,OAAOrkB,KAAK82C,OAAO92C,KAAKwb,MAExE+5B,EAAYziC,UAAUokC,IAAM,SAAcgC,GAAO,OAAOl5C,KAAK0c,MAAQw8B,IAAQl5C,KAAKwb,QAAS,IAE3F+5B,EAAYziC,UAAUwC,IAAM,SAAcuoB,GAAO,MAAM,IAAIv/B,YAAYu/B,EAAM,4BAA8B79B,KAAKq1C,OAAS,OAEzHl2C,OAAOo9B,iBAAkBgZ,EAAYziC,UAAWikC,GAgQhD,IAAIoC,GAAW,SAAkB17C,EAAM68B,EAAQpe,GAG7Clc,KAAKvC,KAAOA,EAIZuC,KAAKs6B,OAASA,EAIdt6B,KAAKkc,KAAOA,EAEZlc,KAAK03C,OAASx7B,EAAK2nB,MAAQ3nB,EAAK2nB,MAAMj8B,MAAM,KAAO,GACnD5H,KAAK60B,MAAQmkB,GAAU98B,EAAK2Y,OAE5B70B,KAAK6zC,aAAeA,GAAa7zC,KAAK60B,OAItC70B,KAAKk0C,aAAe,KAKpBl0C,KAAKo5C,QAAU,KAIfp5C,KAAKsd,cAAgB,KAIrBtd,KAAKivC,UAAY/yB,EAAK26B,QAAkB,QAARp5C,GAIhCuC,KAAKy5B,OAAiB,QAARh8B,GAGZ47C,GAAuB,CAAEtG,SAAU,GAAGj3B,YAAa,GAAGkzB,OAAQ,GAAGzxB,OAAQ,IAI7E87B,GAAqBtG,SAAS1uB,IAAM,WAAc,OAAQrkB,KAAKivC,SAK/DoK,GAAqBv9B,YAAYuI,IAAM,WAAc,OAAOrkB,KAAKivC,SAAWjvC,KAAKsd,eAIjF+7B,GAAqBrK,OAAO3qB,IAAM,WAAc,OAAOrkB,KAAKk0C,cAAgBe,EAAa75B,OAKzFi+B,GAAqB97B,OAAO8G,IAAM,WAAc,OAAOrkB,KAAKgvC,QAAUhvC,KAAKkc,KAAKo9B,MAEhFH,GAASrmC,UAAUgjC,iBAAmB,SAA2ByD,GAC7D,IAAIh5B,EAASvgB,KAEf,IAAK,IAAI+jB,KAAKxD,EAAOsU,MACjB,GAAItU,EAAOsU,MAAM9Q,GAAGy1B,cAAgBD,KAAYx1B,KAAKw1B,IAAY,OAAO,EAC5E,OAAO,GAGTJ,GAASrmC,UAAU0+B,kBAAoB,SAA4Bl2B,GACjE,OAAOtb,MAAQsb,GAAStb,KAAKk0C,aAAa6B,WAAWz6B,EAAM44B,eAG7DiF,GAASrmC,UAAU+lC,aAAe,SAAyBhkB,GACzD,OAAKA,GAAS70B,KAAK6zC,aAAuB7zC,KAAK6zC,aACjCgF,GAAa74C,KAAK60B,MAAOA,IAUzCskB,GAASrmC,UAAU1V,OAAS,SAAiBy3B,EAAO3Z,EAAS+b,GAC3D,GAAIj3B,KAAKy5B,OAAU,MAAM,IAAIp8B,MAAM,8CACnC,OAAO,IAAIomC,EAAKzjC,KAAMA,KAAK64C,aAAahkB,GAAQ0Z,EAAS1oB,KAAK3K,GAAUooB,EAAKgN,QAAQrZ,KAOvFkiB,GAASrmC,UAAU2mC,cAAgB,SAAwB5kB,EAAO3Z,EAAS+b,GAEzE,GADA/b,EAAUqzB,EAAS1oB,KAAK3K,IACnBlb,KAAK66B,aAAa3f,GACnB,MAAM,IAAIhd,WAAW,4BAA8B8B,KAAKvC,MAC5D,OAAO,IAAIgmC,EAAKzjC,KAAMA,KAAK64C,aAAahkB,GAAQ3Z,EAASooB,EAAKgN,QAAQrZ,KAUxEkiB,GAASrmC,UAAUwjC,cAAgB,SAAwBzhB,EAAO3Z,EAAS+b,GAGzE,GAFApC,EAAQ70B,KAAK64C,aAAahkB,GAC1B3Z,EAAUqzB,EAAS1oB,KAAK3K,GACpBA,EAAQysB,KAAM,CAChB,IAAIngC,EAASxH,KAAKk0C,aAAa8B,WAAW96B,GAC1C,IAAK1T,EAAU,OAAO,KACtB0T,EAAU1T,EAAOwd,OAAO9J,GAE1B,IAAIuC,EAAQzd,KAAKk0C,aAAaC,cAAcj5B,GAAS86B,WAAWzH,EAASnzB,OAAO,GAChF,OAAKqC,EACE,IAAIgmB,EAAKzjC,KAAM60B,EAAO3Z,EAAQ8J,OAAOvH,GAAQ6lB,EAAKgN,QAAQrZ,IAD5C,MAOvBkiB,GAASrmC,UAAU+nB,aAAe,SAAuB3f,GACrD,IAAIqF,EAASvgB,KAEXQ,EAASR,KAAKk0C,aAAaC,cAAcj5B,GAC7C,IAAK1a,IAAWA,EAAO+zC,SAAY,OAAO,EAC1C,IAAK,IAAInqC,EAAI,EAAGA,EAAI8Q,EAAQ4B,WAAY1S,IACpC,IAAKmW,EAAOi0B,YAAYt5B,EAAQ1Y,MAAM4H,GAAG6sB,OAAU,OAAO,EAC9D,OAAO,GAKTkiB,GAASrmC,UAAU4mC,eAAiB,SAAyBnhB,GAC3D,OAAuB,MAAhBv4B,KAAKo5C,SAAmBp5C,KAAKo5C,QAAQvgB,QAAQN,IAAa,GAKnE4gB,GAASrmC,UAAU0hC,YAAc,SAAsBvd,GACnD,IAAI1W,EAASvgB,KAEf,GAAoB,MAAhBA,KAAKo5C,QAAmB,OAAO,EACnC,IAAK,IAAIhvC,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,IAAO,IAAKmW,EAAOm5B,eAAeziB,EAAM7sB,GAAG7L,MAAS,OAAO,EAC7F,OAAO,GAKT46C,GAASrmC,UAAU6mC,aAAe,SAAuB1iB,GACrD,IAGE5E,EAHE9R,EAASvgB,KAEf,GAAoB,MAAhBA,KAAKo5C,QAAmB,OAAOniB,EAEnC,IAAK,IAAI7sB,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,IAC3BmW,EAAOm5B,eAAeziB,EAAM7sB,GAAG7L,MAEzB8zB,GACTA,EAAKvwB,KAAKm1B,EAAM7sB,IAFXioB,IAAQA,EAAO4E,EAAMnsB,MAAM,EAAGV,IAKvC,OAAQioB,EAAeA,EAAKzwB,OAASywB,EAAOiR,EAAKloB,MAAlC6b,GAGjBkiB,GAASnuC,QAAU,SAAkBwuB,EAAOc,GAC1C,IAAI95B,EAASrB,OAAO/B,OAAO,MAC3Bo8B,EAAMl6B,SAAQ,SAAU7B,EAAMye,GAAQ,OAAO1b,EAAO/C,GAAQ,IAAI07C,GAAS17C,EAAM68B,EAAQpe,MAEvF,IAAI09B,EAAUtf,EAAOpe,KAAKmoB,SAAW,MACrC,IAAK7jC,EAAOo5C,GAAY,MAAM,IAAI17C,WAAW,yCAA2C07C,EAAU,MAClG,IAAKp5C,EAAOY,KAAQ,MAAM,IAAIlD,WAAW,oCACzC,IAAK,IAAIkyC,KAAK5vC,EAAOY,KAAKyzB,MAAS,MAAM,IAAI32B,WAAW,iDAExD,OAAOsC,GAGTrB,OAAOo9B,iBAAkB4c,GAASrmC,UAAWumC,IAI7C,IAAIJ,GAAY,SAAmBj4C,GACjChB,KAAK44C,WAAaz5C,OAAO2T,UAAUC,eAAehD,KAAK/O,EAAS,WAChEhB,KAAKL,QAAUqB,EAAQrB,SAGrBk6C,GAAyB,CAAEL,WAAY,IAE3CK,GAAuBL,WAAWn1B,IAAM,WACtC,OAAQrkB,KAAK44C,YAGfz5C,OAAOo9B,iBAAkB0c,GAAUnmC,UAAW+mC,IAQ9C,IAAIC,GAAW,SAAkBr8C,EAAMyyC,EAAM5V,EAAQpe,GAGnDlc,KAAKvC,KAAOA,EAIZuC,KAAKs6B,OAASA,EAIdt6B,KAAKkc,KAAOA,EAEZlc,KAAK60B,MAAQmkB,GAAU98B,EAAK2Y,OAE5B70B,KAAKkwC,KAAOA,EACZlwC,KAAKm5B,SAAW,KAChB,IAAIuf,EAAW7E,GAAa7zC,KAAK60B,OACjC70B,KAAKm7B,SAAWud,GAAY,IAAIpV,EAAKtjC,KAAM04C,IAO7CoB,GAAShnC,UAAU1V,OAAS,SAAiBy3B,GAC3C,OAAKA,GAAS70B,KAAKm7B,SAAmBn7B,KAAKm7B,SACpC,IAAImI,EAAKtjC,KAAM64C,GAAa74C,KAAK60B,MAAOA,KAGjDilB,GAAS9uC,QAAU,SAAkBisB,EAAOqD,GAC1C,IAAI95B,EAASrB,OAAO/B,OAAO,MAAO8yC,EAAO,EAEzC,OADAjZ,EAAM33B,SAAQ,SAAU7B,EAAMye,GAAQ,OAAO1b,EAAO/C,GAAQ,IAAIq8C,GAASr8C,EAAMyyC,IAAQ5V,EAAQpe,MACxF1b,GAMTs5C,GAAShnC,UAAUq9B,cAAgB,SAAwBnxC,GAGzD,IAFE,IAAIuhB,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpL,EAAI4C,OAAQwI,IAC5B,GAAIpL,EAAIoL,GAAG7L,MAAQgiB,EACjB,OAAOvhB,EAAI8L,MAAM,EAAGV,GAAG9G,OAAOtE,EAAI8L,MAAMV,EAAI,IAClD,OAAOpL,GAKT86C,GAAShnC,UAAU+kB,QAAU,SAAkB74B,GAG7C,IAFE,IAAIuhB,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpL,EAAI4C,OAAQwI,IAC5B,GAAIpL,EAAIoL,GAAG7L,MAAQgiB,EAAU,OAAOvhB,EAAIoL,IAM9C0vC,GAAShnC,UAAUm9B,SAAW,SAAmB30B,GAC/C,OAAOtb,KAAKm5B,SAASN,QAAQvd,IAAU,GAwKzC,IAAIy+B,GAAS,SAAgB79B,GAC3B,IAAIqE,EAASvgB,KASb,IAAK,IAAIT,KADTS,KAAKkc,KAAO,GACKA,EAAQqE,EAAOrE,KAAK3c,GAAQ2c,EAAK3c,GAClDS,KAAKkc,KAAKsd,MAAQiU,EAAW5nB,KAAK3J,EAAKsd,OACvCx5B,KAAKkc,KAAK+a,MAAQwW,EAAW5nB,KAAK3J,EAAK+a,OAIvCj3B,KAAKw5B,MAAQ2f,GAASnuC,QAAQhL,KAAKkc,KAAKsd,MAAOx5B,MAI/CA,KAAKi3B,MAAQ6iB,GAAS9uC,QAAQhL,KAAKkc,KAAK+a,MAAOj3B,MAE/C,IAAIg6C,EAAmB76C,OAAO/B,OAAO,MACrC,IAAK,IAAI68C,KAAU15B,EAAOiZ,MAAO,CAC/B,GAAIygB,KAAU15B,EAAO0W,MACjB,MAAM,IAAI/4B,WAAW+7C,EAAS,sCAClC,IAAI17C,EAAOgiB,EAAOiZ,MAAMygB,GAASC,EAAc37C,EAAK2d,KAAKhB,SAAW,GAAIi/B,EAAW57C,EAAK2d,KAAK+a,MAC7F14B,EAAK21C,aAAe8F,EAAiBE,KAClCF,EAAiBE,GAAejF,EAAatO,MAAMuT,EAAa35B,EAAOiZ,QAC1Ej7B,EAAK+e,cAAgB/e,EAAK21C,aAAa52B,cACvC/e,EAAK66C,QAAsB,KAAZe,EAAkB,KAC/BA,EAAWC,GAAY75B,EAAQ45B,EAASvyC,MAAM,MAClC,IAAZuyC,GAAmB57C,EAAK+e,cAAqB,KAAL,GAE5C,IAAK,IAAI+8B,KAAU95B,EAAO0W,MAAO,CAC/B,IAAIwgB,EAASl3B,EAAO0W,MAAMojB,GAASC,EAAO7C,EAAOv7B,KAAK+zB,SACtDwH,EAAOte,SAAmB,MAARmhB,EAAe,CAAC7C,GAAkB,IAAR6C,EAAa,GAAKF,GAAY75B,EAAQ+5B,EAAK1yC,MAAM,MAG/F5H,KAAKwmC,aAAexmC,KAAKwmC,aAAaxtB,KAAKhZ,MAC3CA,KAAK+0C,aAAe/0C,KAAK+0C,aAAa/7B,KAAKhZ,MAK3CA,KAAKu6C,YAAcv6C,KAAKw5B,MAAMx5B,KAAKkc,KAAKmoB,SAAW,OAMnDrkC,KAAKuzC,OAASp0C,OAAO/B,OAAO,MAC5B4C,KAAKuzC,OAAOiH,UAAYr7C,OAAO/B,OAAO,OAsDxC,SAASg9C,GAAY9f,EAAQrD,GAE3B,IADA,IAAIsY,EAAQ,GACHnlC,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,IAAK,CACrC,IAAI3M,EAAOw5B,EAAM7sB,GAAI+sB,EAAOmD,EAAOrD,MAAMx5B,GAAOg9C,EAAKtjB,EACrD,GAAIA,EACFoY,EAAMztC,KAAKq1B,QAEX,IAAK,IAAI53B,KAAQ+6B,EAAOrD,MAAO,CAC7B,IAAIyjB,EAASpgB,EAAOrD,MAAM13B,IACd,KAAR9B,GAAgBi9C,EAAOx+B,KAAK2nB,OAAS6W,EAAOx+B,KAAK2nB,MAAMj8B,MAAM,KAAKixB,QAAQp7B,IAAS,IACnF8xC,EAAMztC,KAAK24C,EAAKC,GAGxB,IAAKD,EAAM,MAAM,IAAIn8C,YAAY,uBAAyB24B,EAAM7sB,GAAK,KAEvE,OAAOmlC,EA7DTwK,GAAOjnC,UAAUlS,KAAO,SAAerC,EAAMs2B,EAAO3Z,EAAS+b,GAC3D,GAAmB,iBAAR14B,EACPA,EAAOyB,KAAKsP,SAAS/Q,OACpB,MAAMA,aAAgB46C,IACvB,MAAM,IAAIj7C,WAAW,sBAAwBK,GAC5C,GAAIA,EAAK+7B,QAAUt6B,KACpB,MAAM,IAAI9B,WAAW,yCAA2CK,EAAKd,KAAO,KAEhF,OAAOc,EAAKk7C,cAAc5kB,EAAO3Z,EAAS+b,IAM5C8iB,GAAOjnC,UAAU1R,KAAO,SAAeu5C,EAAQ1jB,GAC7C,IAAI14B,EAAOyB,KAAKw5B,MAAMp4B,KACtB,OAAO,IAAI4zC,EAASz2C,EAAMA,EAAKs1C,aAAc8G,EAAQrX,EAAKgN,QAAQrZ,KAKpE8iB,GAAOjnC,UAAUqkB,KAAO,SAAe54B,EAAMs2B,GAE3C,MADmB,iBAARt2B,IAAoBA,EAAOyB,KAAKi3B,MAAM14B,IAC1CA,EAAKnB,OAAOy3B,IAMrBklB,GAAOjnC,UAAU0zB,aAAe,SAAuB9qB,GACrD,OAAO+nB,EAAKhoB,SAASzb,KAAM0b,IAM7Bq+B,GAAOjnC,UAAUiiC,aAAe,SAAuBr5B,GACrD,OAAO4nB,EAAK7nB,SAASzb,KAAM0b,IAG7Bq+B,GAAOjnC,UAAUxD,SAAW,SAAmB7R,GAC7C,IAAI8xC,EAAQvvC,KAAKw5B,MAAM/7B,GACvB,IAAK8xC,EAAS,MAAM,IAAIrxC,WAAW,sBAAwBT,GAC3D,OAAO8xC,GA2JT,IAAIqL,GAAY,SAAmBtgB,EAAQ7vB,GACzC,IAAI8V,EAASvgB,KAIbA,KAAKs6B,OAASA,EAIdt6B,KAAKyK,MAAQA,EACbzK,KAAK66C,KAAO,GACZ76C,KAAK86C,OAAS,GAEdrwC,EAAMnL,SAAQ,SAAUkM,GAClBA,EAAKyD,IAAOsR,EAAOs6B,KAAK/4C,KAAK0J,GACxBA,EAAK4W,OAAS7B,EAAOu6B,OAAOh5C,KAAK0J,OAM9CovC,GAAU9nC,UAAU6zB,MAAQ,SAAgB5lB,EAAK/f,QAC5B,IAAZA,IAAqBA,EAAU,IAEtC,IAAIwR,EAAU,IAAIuoC,GAAa/6C,KAAMgB,GAAS,GAE9C,OADAwR,EAAQwoC,OAAOj6B,EAAK,KAAM/f,EAAQ6kB,KAAM7kB,EAAQ8kB,IACzCtT,EAAQyoC,UAUjBL,GAAU9nC,UAAUooC,WAAa,SAAqBn6B,EAAK/f,QACtC,IAAZA,IAAqBA,EAAU,IAEtC,IAAIwR,EAAU,IAAIuoC,GAAa/6C,KAAMgB,GAAS,GAE9C,OADAwR,EAAQwoC,OAAOj6B,EAAK,KAAM/f,EAAQ6kB,KAAM7kB,EAAQ8kB,IACzC3K,EAAMk3B,QAAQ7/B,EAAQyoC,WAG/BL,GAAU9nC,UAAUqoC,SAAW,SAAmBp6B,EAAKvO,GAGrD,IAFE,IAAI+N,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAK66C,KAAKj5C,OAAQwI,IAAK,CACzC,IAAIoB,EAAO+U,EAAOs6B,KAAKzwC,GACvB,GAAIgxC,GAAQr6B,EAAKvV,EAAKyD,YACEnP,IAAnB0L,EAAKqnB,WAA2B9R,EAAIs6B,cAAgB7vC,EAAKqnB,cACxDrnB,EAAKgH,SAAWA,EAAQ8oC,eAAe9vC,EAAKgH,UAAW,CAC3D,GAAIhH,EAAKgtB,SAAU,CACjB,IAAIh4B,EAASgL,EAAKgtB,SAASzX,GAC3B,IAAe,IAAXvgB,EAAoB,SACxBgL,EAAKqpB,MAAQr0B,EAEf,OAAOgL,KAKbovC,GAAU9nC,UAAUyoC,WAAa,SAAqBh8C,EAAMY,EAAOqS,GAGjE,IAFE,IAAI+N,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAK86C,OAAOl5C,OAAQwI,IAAK,CAC3C,IAAIoB,EAAO+U,EAAOu6B,OAAO1wC,GACzB,KAAgC,GAA5BoB,EAAK4W,MAAMyW,QAAQt5B,IACnBiM,EAAKgH,UAAYA,EAAQ8oC,eAAe9vC,EAAKgH,UAI7ChH,EAAK4W,MAAMxgB,OAASrC,EAAKqC,SACc,IAAtC4J,EAAK4W,MAAMo5B,WAAWj8C,EAAKqC,SAAiB4J,EAAK4W,MAAMtX,MAAMvL,EAAKqC,OAAS,IAAMzB,IANtF,CAQA,GAAIqL,EAAKgtB,SAAU,CACjB,IAAIh4B,EAASgL,EAAKgtB,SAASr4B,GAC3B,IAAe,IAAXK,EAAoB,SACxBgL,EAAKqpB,MAAQr0B,EAEf,OAAOgL,KAKXovC,GAAUa,YAAc,SAAsBnhB,GAC5C,IAAI95B,EAAS,GACb,SAASuwC,EAAOvlC,GAEd,IADA,IAAIkwC,EAA4B,MAAjBlwC,EAAKkwC,SAAmB,GAAKlwC,EAAKkwC,SAAUtxC,EAAI,EACxDA,EAAI5J,EAAOoB,OAAQwI,IAAK,CAC7B,IAAIsS,EAAOlc,EAAO4J,GAAIuxC,EAAgC,MAAjBj/B,EAAKg/B,SAAmB,GAAKh/B,EAAKg/B,SACvE,GAAIC,EAAeD,EAAY,MAEjCl7C,EAAO+J,OAAOH,EAAG,EAAGoB,GAGtB,IAAIqsC,EAAO,SAAWp6C,GACpB,IAAIgN,EAAQ6vB,EAAOrD,MAAMx5B,GAAMye,KAAK4nB,SAChCr5B,GAASA,EAAMnL,SAAQ,SAAUkM,GACnCulC,EAAOvlC,EAAO6mB,GAAK7mB,IACnBA,EAAK2rB,KAAO15B,MAId,IAAK,IAAIA,KAAQ68B,EAAOrD,MAAO4gB,EAAMp6C,GACvC,IAAIq6C,EAAS,SAAWr6C,GACtB,IAAIm+C,EAAUthB,EAAOd,MAAMqiB,GAAQ3/B,KAAK4nB,SACpC8X,GAAWA,EAAQt8C,SAAQ,SAAUkM,GACvCulC,EAAOvlC,EAAO6mB,GAAK7mB,IACnBA,EAAK5K,KAAOi7C,MAId,IAAK,IAAIA,KAAUvhB,EAAOd,MAAOse,EAAQr6C,GAC3C,OAAO+C,GAOTo6C,GAAUlU,WAAa,SAAqBpM,GAC1C,OAAOA,EAAOiZ,OAAOuI,YAClBxhB,EAAOiZ,OAAOuI,UAAY,IAAIlB,GAAUtgB,EAAQsgB,GAAUa,YAAYnhB,MAI3E,IAAIyhB,GAAY,CACdC,SAAS,EAAMC,SAAS,EAAMC,OAAO,EAAMC,YAAY,EAAMC,QAAQ,EACrEC,IAAI,EAAMnU,KAAK,EAAMoU,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,EAAMxgB,GAAG,EAAMygB,KAAK,EAAMC,SAAS,EAAMC,OAAO,EAAMC,OAAO,EAAMC,IAAI,GAI7EC,GAAa,CACf/iC,MAAM,EAAMuiC,UAAU,EAAMvhB,QAAQ,EAAMgiB,QAAQ,EAAM37B,OAAO,EAAMirB,OAAO,GAI1E2Q,GAAW,CAACT,IAAI,EAAMM,IAAI,GAG1BI,GAAkB,EAClBC,GAAuB,EACvBC,GAAgB,EAEpB,SAASC,GAAaC,GACpB,OAAQA,EAAqBJ,GAAkB,IAA6B,SAAvBI,EAAgCH,GAAuB,GAG9G,IAAII,GAAc,SAAqB//C,EAAMs2B,EAAOoC,EAAOsnB,EAAOt6C,EAAOjD,GACvEhB,KAAKzB,KAAOA,EACZyB,KAAK60B,MAAQA,EACb70B,KAAKu+C,MAAQA,EACbv+C,KAAKiE,MAAQA,IAAUjD,EAAUm9C,GAAgB,KAAO5/C,EAAK21C,cAC7Dl0C,KAAKgB,QAAUA,EACfhB,KAAKkb,QAAU,GACflb,KAAKi3B,MAAQA,EACbj3B,KAAKwoC,YAAclF,EAAKiN,MAG1B+N,GAAYxrC,UAAUyjC,aAAe,SAAuB31C,GAC1D,IAAKZ,KAAKiE,MAAO,CACf,IAAKjE,KAAKzB,KAAQ,MAAO,GACzB,IAAIigD,EAAOx+C,KAAKzB,KAAK21C,aAAa8B,WAAWzH,EAAS1oB,KAAKjlB,IAC3D,IAAI49C,EAEG,CACL,IAAoCC,EAAhCj4B,EAAQxmB,KAAKzB,KAAK21C,aACtB,OAAIuK,EAAOj4B,EAAM+vB,aAAa31C,EAAKrC,QACjCyB,KAAKiE,MAAQuiB,EACNi4B,GAEA,KAPTz+C,KAAKiE,MAAQjE,KAAKzB,KAAK21C,aAAaC,cAAcqK,GAWtD,OAAOx+C,KAAKiE,MAAMsyC,aAAa31C,EAAKrC,OAGtC+/C,GAAYxrC,UAAUmoC,OAAS,SAAiBlhB,GAC9C,KAAM/5B,KAAKgB,QAAUi9C,IAAkB,CACrC,IAAkDt4C,EAA9C2hB,EAAOtnB,KAAKkb,QAAQlb,KAAKkb,QAAQtZ,OAAS,GAC1C0lB,GAAQA,EAAKmS,SAAW9zB,EAAI,oBAAoB7B,KAAKwjB,EAAKlmB,SACxDkmB,EAAKlmB,KAAKQ,QAAU+D,EAAE,GAAG/D,OAAU5B,KAAKkb,QAAQnZ,MAC7C/B,KAAKkb,QAAQlb,KAAKkb,QAAQtZ,OAAS,GAAK0lB,EAAK4nB,SAAS5nB,EAAKlmB,KAAK0J,MAAM,EAAGwc,EAAKlmB,KAAKQ,OAAS+D,EAAE,GAAG/D,UAG5G,IAAIsZ,EAAUqzB,EAAS1oB,KAAK7lB,KAAKkb,SAGjC,OAFK6e,GAAW/5B,KAAKiE,QACjBiX,EAAUA,EAAQ8J,OAAOhlB,KAAKiE,MAAM+xC,WAAWzH,EAASnzB,OAAO,KAC5Dpb,KAAKzB,KAAOyB,KAAKzB,KAAKnB,OAAO4C,KAAK60B,MAAO3Z,EAASlb,KAAKi3B,OAAS/b,GAGzE,IAAI6/B,GAAe,SAAsB2D,EAAQ19C,EAAS4O,GAExD5P,KAAK0+C,OAASA,EAEd1+C,KAAKgB,QAAUA,EACfhB,KAAK2+C,OAAS/uC,EACd5P,KAAK4+C,aAAe,GACpB,IAA+BC,EAA3Bxa,EAAUrjC,EAAQqjC,QAClBya,EAAaV,GAAap9C,EAAQq9C,qBAAuBzuC,EAAOuuC,GAAgB,GAEhFU,EADAxa,EACa,IAAIia,GAAYja,EAAQ9lC,KAAM8lC,EAAQxP,MAAOyO,EAAKiN,MAAM,EAC1CvvC,EAAQ+9C,UAAY1a,EAAQ9lC,KAAK21C,aAAc4K,GAE7D,IAAIR,GADZ1uC,EACwB,KAEA8uC,EAAOpkB,OAAOigB,YAFR,KAAMjX,EAAKiN,MAAM,EAAM,KAAMuO,GAGpE9+C,KAAKw5B,MAAQ,CAACqlB,GAEd7+C,KAAK4P,KAAO,EACZ5P,KAAKmS,KAAOnR,EAAQg+C,cACpBh/C,KAAKi/C,YAAa,GAGhBC,GAAuB,CAAEr9C,IAAK,GAAGs9C,WAAY,IAmYjD,SAASC,GAAcr+B,GACrB,IAAK,IAAIve,EAAQue,EAAI3R,WAAYiwC,EAAW,KAAM78C,EAAOA,EAAQA,EAAM6M,YAAa,CAClF,IAAI5R,EAAyB,GAAlB+E,EAAM8M,SAAgB9M,EAAM0M,SAASpG,cAAgB,KAC5DrL,GAAQugD,GAASjrC,eAAetV,IAAS4hD,GAC3CA,EAASl9B,YAAY3f,GACrBA,EAAQ68C,GACS,MAAR5hD,EACT4hD,EAAW78C,EACF/E,IACT4hD,EAAW,OAMjB,SAASjE,GAAQr6B,EAAKu+B,GACpB,OAAQv+B,EAAIq6B,SAAWr6B,EAAIw+B,mBAAqBx+B,EAAIy+B,uBAAyBz+B,EAAI0+B,oBAAoB1vC,KAAKgR,EAAKu+B,GAKjH,SAASI,GAAYt9B,GACnB,IAAuCzc,EAAnCtC,EAAK,6BAAiC7C,EAAS,GACnD,MAAOmF,EAAItC,EAAGS,KAAKse,GAAU5hB,EAAOsB,KAAK6D,EAAE,GAAIA,EAAE,GAAG8gC,QACpD,OAAOjmC,EAGT,SAAS6xB,GAAKzzB,GACZ,IAAIyzB,EAAO,GACX,IAAK,IAAI9yB,KAAQX,EAAOyzB,EAAK9yB,GAAQX,EAAIW,GACzC,OAAO8yB,EA/ZT6sB,GAAqBr9C,IAAIwiB,IAAM,WAC7B,OAAOrkB,KAAKw5B,MAAMx5B,KAAK4P,OAOzBmrC,GAAajoC,UAAU6sC,OAAS,SAAiB5+B,GAC7C,IAAIR,EAASvgB,KAEf,GAAoB,GAAhB+gB,EAAIzR,SACNtP,KAAK4/C,YAAY7+B,QACZ,GAAoB,GAAhBA,EAAIzR,SAAe,CAC5B,IAAI8S,EAAQrB,EAAI2qB,aAAa,SACzBzU,EAAQ7U,EAAQpiB,KAAK6/C,WAAWH,GAAYt9B,IAAU,KAC1D,GAAa,MAAT6U,EAAiB,IAAK,IAAI7sB,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,IAAOmW,EAAOu/B,eAAe7oB,EAAM7sB,IAE1F,GADApK,KAAK+/C,WAAWh/B,GACH,MAATkW,EAAiB,IAAK,IAAI3M,EAAM,EAAGA,EAAM2M,EAAMr1B,OAAQ0oB,IAAS/J,EAAOy/B,kBAAkB/oB,EAAM3M,MAIvGywB,GAAajoC,UAAU8sC,YAAc,SAAsB7+B,GACzD,IAAI5gB,EAAQ4gB,EAAIxR,UACZ1N,EAAM7B,KAAK6B,IACf,IAAKA,EAAItD,KAAOsD,EAAItD,KAAK+e,cAAgBzb,EAAIqZ,QAAQtZ,QAAUC,EAAIqZ,QAAQ,GAAG63B,WAAa,mBAAmBjhC,KAAK3R,GAAQ,CACzH,GAAM0B,EAAIb,QAAUi9C,GAaPp8C,EAAIb,QAAUk9C,KACzB/9C,EAAQA,EAAMC,QAAQ,YAAa,WATnC,GAJAD,EAAQA,EAAMC,QAAQ,oBAAqB,KAIvC,mBAAmB0R,KAAK3R,IAAUH,KAAK4P,MAAQ5P,KAAKw5B,MAAM53B,OAAS,EAAG,CACxE,IAAI4f,EAAa3f,EAAIqZ,QAAQrZ,EAAIqZ,QAAQtZ,OAAS,GAC9Cq+C,EAAgBl/B,EAAIm/B,kBACnB1+B,GACAy+B,GAA2C,MAA1BA,EAAc/wC,UAC/BsS,EAAWiY,QAAU,mBAAmB3nB,KAAK0P,EAAWpgB,SACzDjB,EAAQA,EAAM2K,MAAM,IAKxB3K,GAASH,KAAKmgD,WAAWngD,KAAK0+C,OAAOpkB,OAAOl5B,KAAKjB,IACrDH,KAAKogD,WAAWr/B,QAEhB/gB,KAAKqgD,WAAWt/B,IAOpBg6B,GAAajoC,UAAUitC,WAAa,SAAqBh/B,GACvD,IAAItjB,EAAOsjB,EAAI7R,SAASpG,cACpBk1C,GAASjrC,eAAetV,IAAS2hD,GAAcr+B,GACnD,IAAIvV,EAAQxL,KAAKgB,QAAQs/C,cAAgBtgD,KAAKgB,QAAQs/C,aAAav/B,IAAS/gB,KAAK0+C,OAAOvD,SAASp6B,EAAK/gB,MACtG,GAAIwL,EAAOA,EAAK+tC,OAASuE,GAAW/qC,eAAetV,GACjDuC,KAAKqgD,WAAWt/B,QACX,IAAKvV,GAAQA,EAAK8I,KAAM,CACzB9I,GAAQA,EAAK8I,KAAKhF,WAAYyR,EAAMvV,EAAK8I,MAC7C,IAAIisC,EAAM1+C,EAAM7B,KAAK6B,IAAK2+C,EAAgBxgD,KAAKi/C,WAC/C,GAAIlD,GAAUhpC,eAAetV,GAC3B8iD,GAAO,EACF1+C,EAAItD,OAAQyB,KAAKi/C,YAAa,QAC9B,IAAKl+B,EAAI3R,WAEd,YADApP,KAAKygD,aAAa1/B,GAGpB/gB,KAAKg7C,OAAOj6B,GACRw/B,GAAQvgD,KAAKugD,KAAK1+C,GACtB7B,KAAKi/C,WAAauB,OAElBxgD,KAAK0gD,iBAAiB3/B,EAAKvV,IAK/BuvC,GAAajoC,UAAU2tC,aAAe,SAAuB1/B,GACvC,MAAhBA,EAAI7R,UAAoBlP,KAAK6B,IAAItD,MAAQyB,KAAK6B,IAAItD,KAAK+e,eACvDtd,KAAK4/C,YAAY7+B,EAAI4/B,cAAcC,eAAe,QAMxD7F,GAAajoC,UAAU+sC,WAAa,SAAqB/E,GAIvD,IAHE,IAAIv6B,EAASvgB,KAEXi3B,EAAQqM,EAAKiN,KACRnmC,EAAI,EAAGA,EAAI0wC,EAAOl5C,OAAQwI,GAAK,EAAG,CACzC,IAAIoB,EAAO+U,EAAOm+B,OAAOnD,WAAWT,EAAO1wC,GAAI0wC,EAAO1wC,EAAI,GAAImW,GAC9D,GAAK/U,EAAL,CACA,GAAIA,EAAK+tC,OAAU,OAAO,KAC1BtiB,EAAQ1W,EAAOm+B,OAAOpkB,OAAOrD,MAAMzrB,EAAK2rB,MAAM/5B,OAAOoO,EAAKqpB,OAAO8E,SAAS1C,IAE5E,OAAOA,GAOT8jB,GAAajoC,UAAU4tC,iBAAmB,SAA2B3/B,EAAKvV,GACtE,IAEE+0C,EAAMjxC,EAAUipB,EAAUpB,EAFxB5W,EAASvgB,KAGXwL,EAAK5K,MACP0O,EAAWtP,KAAK0+C,OAAOpkB,OAAOd,MAAMhuB,EAAK5K,MACpC0O,EAAS0/B,OAEFhvC,KAAKmgD,WAAW7wC,EAASlS,OAAOoO,EAAKqpB,SAC/C70B,KAAKygD,aAAa1/B,GAFlBw/B,EAAOvgD,KAAK6gD,MAAMvxC,EAAU9D,EAAKqpB,MAAOrpB,EAAK6yC,sBAK/C9lB,EAAWv4B,KAAK0+C,OAAOpkB,OAAOrD,MAAMzrB,EAAK2rB,MACzCA,EAAOoB,EAASn7B,OAAOoO,EAAKqpB,OAC5B70B,KAAK8/C,eAAe3oB,IAEtB,IAAI2pB,EAAU9gD,KAAK6B,IAEnB,GAAIyN,GAAYA,EAAS0/B,OACvBhvC,KAAKqgD,WAAWt/B,QACX,GAAIvV,EAAKu1C,WACd/gD,KAAKqgD,WAAWt/B,GAChBvV,EAAKu1C,WAAWhgC,EAAK/gB,KAAK0+C,OAAOpkB,QAAQh7B,SAAQ,SAAUsB,GAAQ,OAAO2f,EAAO4/B,WAAWv/C,UACvF,CACL,IAAI49B,EAAahzB,EAAKw1C,eACG,iBAAdxiB,EAA0BA,EAAazd,EAAIkgC,cAAcziB,GACtC,mBAAdA,IAA4BA,EAAaA,EAAWzd,IAC/Dyd,IAAcA,EAAazd,GAChC/gB,KAAKkhD,WAAWngC,EAAKyd,GAAY,GACjCx+B,KAAKg7C,OAAOxc,EAAY+hB,GAEtBA,IAAQvgD,KAAKugD,KAAKO,GAAU9gD,KAAK4P,QACjCunB,GAAQn3B,KAAKggD,kBAAkB7oB,IAOrC4jB,GAAajoC,UAAUkoC,OAAS,SAAiBrzC,EAAQ44C,EAAM9oB,EAAYE,GAIzE,IAHE,IAAIpX,EAASvgB,KAEXkE,EAAQuzB,GAAc,EACjB1W,EAAM0W,EAAa9vB,EAAOyiC,WAAW3S,GAAc9vB,EAAOyH,WAC1D3J,EAAkB,MAAZkyB,EAAmB,KAAOhwB,EAAOyiC,WAAWzS,GACtD5W,GAAOtb,EAAKsb,EAAMA,EAAI1R,cAAenL,EACxCqc,EAAO4gC,YAAYx5C,EAAQzD,GAC3Bqc,EAAOo/B,OAAO5+B,GACVw/B,GAAQxE,GAAUhpC,eAAegO,EAAI7R,SAASpG,gBAC9CyX,EAAOggC,KAAKA,GAElBvgD,KAAKmhD,YAAYx5C,EAAQzD,IAM3B62C,GAAajoC,UAAUsuC,UAAY,SAAoBxgD,GAIrD,IAHE,IAEEygD,EAAOd,EAFLhgC,EAASvgB,KAGN4c,EAAQ5c,KAAK4P,KAAMgN,GAAS,EAAGA,IAAS,CAC/C,IAAI0kC,EAAK/gC,EAAOiZ,MAAM5c,GAClB2yB,EAAQ+R,EAAG/K,aAAa31C,GAC5B,GAAI2uC,KAAW8R,GAASA,EAAMz/C,OAAS2tC,EAAM3tC,UAC3Cy/C,EAAQ9R,EACRgR,EAAOe,GACF/R,EAAM3tC,QAAU,MAEvB,GAAI0/C,EAAG/C,MAAS,MAElB,IAAK8C,EAAS,OAAO,EACrBrhD,KAAKugD,KAAKA,GACV,IAAK,IAAIn2C,EAAI,EAAGA,EAAIi3C,EAAMz/C,OAAQwI,IAC9BmW,EAAOghC,WAAWF,EAAMj3C,GAAI,MAAM,GACtC,OAAO,GAKT2wC,GAAajoC,UAAUqtC,WAAa,SAAqBv/C,GACvD,GAAIA,EAAKmyC,UAAY/yC,KAAKi/C,aAAej/C,KAAK6B,IAAItD,KAAM,CACtD,IAAIyT,EAAQhS,KAAKwhD,uBACbxvC,GAAShS,KAAKuhD,WAAWvvC,GAE/B,GAAIhS,KAAKohD,UAAUxgD,GAAO,CACxBZ,KAAKyhD,aACL,IAAI5/C,EAAM7B,KAAK6B,IACf7B,KAAK0hD,kBAAkB7/C,GACnBA,EAAIoC,QAASpC,EAAIoC,MAAQpC,EAAIoC,MAAMywC,UAAU9zC,EAAKrC,OAEtD,IADA,IAAI04B,EAAQp1B,EAAI2mC,YACPp+B,EAAI,EAAGA,EAAIxJ,EAAKq2B,MAAMr1B,OAAQwI,IAC9BvI,EAAItD,OAAQsD,EAAItD,KAAKm7C,eAAe94C,EAAKq2B,MAAM7sB,GAAG7L,QACrD04B,EAAQr2B,EAAKq2B,MAAM7sB,GAAGuvB,SAAS1C,IAErC,OADAp1B,EAAIqZ,QAAQpZ,KAAKlB,EAAKu2B,KAAKF,KACpB,EAET,OAAO,GAGT8jB,GAAajoC,UAAU4uC,kBAAoB,SAA4B7/C,GAGrE,IAFE,IAAI0e,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAK4+C,aAAah9C,OAAQwI,IAAK,CACjD,IAAI+sB,EAAO5W,EAAOq+B,aAAax0C,GACzBvI,EAAItD,OAAQsD,EAAItD,KAAKm7C,eAAeviB,EAAK54B,OAAW44B,EAAKU,QAAQh2B,EAAI2mC,eACzE3mC,EAAI2mC,YAAcrR,EAAKwC,SAAS93B,EAAI2mC,aACpCjoB,EAAOq+B,aAAar0C,OAAOH,IAAK,MAQtC2wC,GAAajoC,UAAU+tC,MAAQ,SAAgBtiD,EAAMs2B,EAAO8sB,GAC1D,IAAIlH,EAAKz6C,KAAKohD,UAAU7iD,EAAKnB,OAAOy3B,IAKpC,OAJI4lB,IACFz6C,KAAK0hD,kBAAkB1hD,KAAK6B,KAC5B7B,KAAKuhD,WAAWhjD,EAAMs2B,GAAO,EAAM8sB,IAE9BlH,GAITM,GAAajoC,UAAUyuC,WAAa,SAAqBhjD,EAAMs2B,EAAO0pB,EAAOoD,GAC3E3hD,KAAKyhD,aACL,IAAI5/C,EAAM7B,KAAK6B,IACfA,EAAIoC,MAAQpC,EAAIoC,OAASpC,EAAIoC,MAAMywC,UAAUn2C,EAAMs2B,GACnD,IAAI7zB,EAAwB,MAAd2gD,EAAqB9/C,EAAIb,SAAWm9C,GAAgBC,GAAauD,GAC1E9/C,EAAIb,QAAUm9C,IAAwC,GAAtBt8C,EAAIqZ,QAAQtZ,SAAeZ,GAAWm9C,IAC3En+C,KAAKw5B,MAAM13B,KAAK,IAAIw8C,GAAY//C,EAAMs2B,EAAOhzB,EAAI2mC,YAAa+V,EAAO,KAAMv9C,IAC3EhB,KAAK4P,QAKPmrC,GAAajoC,UAAU2uC,WAAa,SAAqB1nB,GACrD,IAAIxZ,EAASvgB,KAEXoK,EAAIpK,KAAKw5B,MAAM53B,OAAS,EAC5B,GAAIwI,EAAIpK,KAAK4P,KAAM,CACjB,KAAOxF,EAAIpK,KAAK4P,KAAMxF,IAAOmW,EAAOiZ,MAAMpvB,EAAI,GAAG8Q,QAAQpZ,KAAKye,EAAOiZ,MAAMpvB,GAAG6wC,OAAOlhB,IACrF/5B,KAAKw5B,MAAM53B,OAAS5B,KAAK4P,KAAO,IAIpCmrC,GAAajoC,UAAUmoC,OAAS,WAG9B,OAFAj7C,KAAK4P,KAAO,EACZ5P,KAAKyhD,WAAWzhD,KAAK2+C,QACd3+C,KAAKw5B,MAAM,GAAGyhB,OAAOj7C,KAAK2+C,QAAU3+C,KAAKgB,QAAQ4gD,UAG1D7G,GAAajoC,UAAUytC,KAAO,SAAez6B,GAG3C,IAFE,IAAIvF,EAASvgB,KAENoK,EAAIpK,KAAK4P,KAAMxF,GAAK,EAAGA,IAAO,GAAImW,EAAOiZ,MAAMpvB,IAAM0b,EAE5D,YADAvF,EAAO3Q,KAAOxF,IAKlB2wC,GAAajoC,UAAUgtC,eAAiB,SAAyB3oB,GAC/Dn3B,KAAK4+C,aAAa98C,KAAKq1B,IAGzB4jB,GAAajoC,UAAUktC,kBAAoB,SAA4B7oB,GACrE,IAAIoY,EAAQvvC,KAAK4+C,aAAa5lB,YAAY7B,GAC1C,GAAIoY,GAAS,EACXvvC,KAAK4+C,aAAar0C,OAAOglC,EAAO,OAC3B,CACL,IAAI1tC,EAAM7B,KAAK6B,IACfA,EAAI2mC,YAAcrR,EAAKgZ,cAActuC,EAAI2mC,eAI7C0W,GAAqBC,WAAW96B,IAAM,WAClC,IAAI9D,EAASvgB,KAEfA,KAAKyhD,aAEL,IADA,IAAIjmC,EAAM,EACDpR,EAAIpK,KAAK4P,KAAMxF,GAAK,EAAGA,IAAK,CAEnC,IADA,IAAI8Q,EAAUqF,EAAOiZ,MAAMpvB,GAAG8Q,QACrB4yB,EAAI5yB,EAAQtZ,OAAS,EAAGksC,GAAK,EAAGA,IACrCtyB,GAAON,EAAQ4yB,GAAGlsB,SAClBxX,GAAKoR,IAEX,OAAOA,GAGTu/B,GAAajoC,UAAUquC,YAAc,SAAsBx5C,EAAQnD,GAC/D,IAAI+b,EAASvgB,KAEf,GAAIA,KAAKmS,KAAQ,IAAK,IAAI/H,EAAI,EAAGA,EAAIpK,KAAKmS,KAAKvQ,OAAQwI,IACjDmW,EAAOpO,KAAK/H,GAAGxJ,MAAQ+G,GAAU4Y,EAAOpO,KAAK/H,GAAG5F,QAAUA,IAC1D+b,EAAOpO,KAAK/H,GAAGoR,IAAM+E,EAAO4+B,aAIpCpE,GAAajoC,UAAUutC,WAAa,SAAqB14C,GACrD,IAAI4Y,EAASvgB,KAEf,GAAIA,KAAKmS,KAAQ,IAAK,IAAI/H,EAAI,EAAGA,EAAIpK,KAAKmS,KAAKvQ,OAAQwI,IAC3B,MAAtBmW,EAAOpO,KAAK/H,GAAGoR,KAAkC,GAAnB7T,EAAO2H,UAAiB3H,EAAO1B,SAASsa,EAAOpO,KAAK/H,GAAGxJ,QACrF2f,EAAOpO,KAAK/H,GAAGoR,IAAM+E,EAAO4+B,aAIpCpE,GAAajoC,UAAUouC,WAAa,SAAqBv5C,EAAQuT,EAAS1T,GACtE,IAAI+Y,EAASvgB,KAEf,GAAI2H,GAAUuT,GAAWlb,KAAKmS,KAAQ,IAAK,IAAI/H,EAAI,EAAGA,EAAIpK,KAAKmS,KAAKvQ,OAAQwI,IAC1E,GAA0B,MAAtBmW,EAAOpO,KAAK/H,GAAGoR,KAAkC,GAAnB7T,EAAO2H,UAAiB3H,EAAO1B,SAASsa,EAAOpO,KAAK/H,GAAGxJ,MAAO,CAC9F,IAAI4a,EAAMN,EAAQ2mC,wBAAwBthC,EAAOpO,KAAK/H,GAAGxJ,MACrD4a,GAAOhU,EAAS,EAAI,KACpB+Y,EAAOpO,KAAK/H,GAAGoR,IAAM+E,EAAO4+B,cAKtCpE,GAAajoC,UAAUstC,WAAa,SAAqB0B,GACrD,IAAIvhC,EAASvgB,KAEf,GAAIA,KAAKmS,KAAQ,IAAK,IAAI/H,EAAI,EAAGA,EAAIpK,KAAKmS,KAAKvQ,OAAQwI,IACjDmW,EAAOpO,KAAK/H,GAAGxJ,MAAQkhD,IACvBvhC,EAAOpO,KAAK/H,GAAGoR,IAAM+E,EAAO4+B,YAAc2C,EAASvyC,UAAU3N,OAAS2e,EAAOpO,KAAK/H,GAAG5F,UAO7Fu2C,GAAajoC,UAAUwoC,eAAiB,SAAyB9oC,GAC7D,IAAI+N,EAASvgB,KAEf,GAAIwS,EAAQqmB,QAAQ,MAAQ,EACxB,OAAOrmB,EAAQ5K,MAAM,YAAYm6C,KAAK/hD,KAAKs7C,eAAgBt7C,MAE/D,IAAIkyB,EAAQ1f,EAAQ5K,MAAM,KACtBo6C,EAAShiD,KAAKgB,QAAQwR,QACtByvC,GAAWjiD,KAAK2+C,UAAYqD,GAAUA,EAAOr6C,OAAOpJ,MAAQyB,KAAKw5B,MAAM,GAAGj7B,MAC1E2jD,IAAaF,EAASA,EAAOplC,MAAQ,EAAI,IAAMqlC,EAAU,EAAI,GAC7Dh+C,EAAQ,SAAUmG,EAAGwS,GACvB,KAAOxS,GAAK,EAAGA,IAAK,CAClB,IAAI+3C,EAAOjwB,EAAM9nB,GACjB,GAAY,IAAR+3C,EAAY,CACd,GAAI/3C,GAAK8nB,EAAMtwB,OAAS,GAAU,GAALwI,EAAU,SACvC,KAAOwS,GAASslC,EAAUtlC,IACtB,GAAI3Y,EAAMmG,EAAI,EAAGwS,GAAU,OAAO,EACtC,OAAO,EAEP,IAAIF,EAAOE,EAAQ,GAAe,GAATA,GAAcqlC,EAAW1hC,EAAOiZ,MAAM5c,GAAOre,KAChEyjD,GAAUplC,GAASslC,EAAWF,EAAOphD,KAAKgc,EAAQslC,GAAU3jD,KAC5D,KACN,IAAKme,GAASA,EAAKjf,MAAQ0kD,IAAsC,GAA9BzlC,EAAKg7B,OAAO7e,QAAQspB,GACnD,OAAO,EACXvlC,IAGJ,OAAO,GAET,OAAO3Y,EAAMiuB,EAAMtwB,OAAS,EAAG5B,KAAK4P,OAGtCmrC,GAAajoC,UAAU0uC,qBAAuB,WAC1C,IAAIjhC,EAASvgB,KAEXoiD,EAAWpiD,KAAKgB,QAAQwR,QAC5B,GAAI4vC,EAAY,IAAK,IAAIzlC,EAAIylC,EAASxlC,MAAOD,GAAK,EAAGA,IAAK,CACxD,IAAIP,EAAQgmC,EAASxhD,KAAK+b,GAAGN,eAAe+lC,EAASvlC,WAAWF,IAAIL,YACpE,GAAIF,GAASA,EAAMN,aAAeM,EAAMy3B,aAAgB,OAAOz3B,EAEjE,IAAK,IAAI3e,KAAQ8iB,EAAOm+B,OAAOpkB,OAAOd,MAAO,CAC3C,IAAIj7B,EAAOgiB,EAAOm+B,OAAOpkB,OAAOd,MAAM/7B,GACtC,GAAIc,EAAKud,aAAevd,EAAKs1C,aAAgB,OAAOt1C,IAIxDY,OAAOo9B,iBAAkBwe,GAAajoC,UAAWosC,IA0DjD,IAAImD,GAAgB,SAAuB7oB,EAAOvC,GAGhDj3B,KAAKw5B,MAAQA,GAAS,GAGtBx5B,KAAKi3B,MAAQA,GAAS,IAuJxB,SAASqrB,GAAY1jD,GACnB,IAAI4B,EAAS,GACb,IAAK,IAAI/C,KAAQmB,EAAK,CACpB,IAAImlC,EAAQnlC,EAAInB,GAAMye,KAAK6nB,MACvBA,IAASvjC,EAAO/C,GAAQsmC,GAE9B,OAAOvjC,EAGT,SAASoa,GAAI5Z,GAEX,OAAOA,EAAQ+N,UAAY8K,OAAO9K,SA1JpCszC,GAAcvvC,UAAUq1B,kBAAoB,SAA4B5O,EAAUv4B,EAASgiB,GACvF,IAAIzC,EAASvgB,UACI,IAAZgB,IAAqBA,EAAU,IAEjCgiB,IAAUA,EAASpI,GAAI5Z,GAASuhD,0BAErC,IAAI1gD,EAAMmhB,EAAQyzB,EAAS,KA4B3B,OA3BAld,EAASj6B,SAAQ,SAAUsB,GACzB,GAAI61C,GAAU71C,EAAKq2B,MAAMr1B,OAAQ,CAC1B60C,IAAUA,EAAS,IACxB,IAAI+L,EAAO,EAAGC,EAAW,EACzB,MAAOD,EAAO/L,EAAO70C,QAAU6gD,EAAW7hD,EAAKq2B,MAAMr1B,OAAQ,CAC3D,IAAI8a,EAAO9b,EAAKq2B,MAAMwrB,GACtB,GAAKliC,EAAO0W,MAAMva,EAAKne,KAAKd,MAA5B,CACA,IAAKif,EAAKrB,GAAGo7B,EAAO+L,MAAsC,IAA5B9lC,EAAKne,KAAK2d,KAAKwmC,SAAsB,MACnEF,GAAQ,EAAGC,SAF0BA,IAIvC,MAAOD,EAAO/L,EAAO70C,OACnBC,EAAM40C,EAAO10C,MACb00C,EAAO10C,MAET,MAAO0gD,EAAW7hD,EAAKq2B,MAAMr1B,OAAQ,CACnC,IAAI1C,EAAM0B,EAAKq2B,MAAMwrB,KACjBE,EAAUpiC,EAAOqiC,cAAc1jD,EAAK0B,EAAKmyC,SAAU/xC,GACnD2hD,IACFlM,EAAO30C,KAAK5C,EAAK2C,GACjBA,EAAIsgB,YAAYwgC,EAAQ5hC,KACxBlf,EAAM8gD,EAAQnkB,YAAcmkB,EAAQ5hC,MAI1Clf,EAAIsgB,YAAY5B,EAAOsiC,cAAcjiD,EAAMI,OAGtCgiB,GASTq/B,GAAcvvC,UAAU+vC,cAAgB,SAAwBjiD,EAAMI,QACjD,IAAZA,IAAqBA,EAAU,IAEtC,IAAIue,EACA8iC,GAAcS,WAAWloC,GAAI5Z,GAAUhB,KAAKw5B,MAAM54B,EAAKrC,KAAKd,MAAMmD,IAChEmgB,EAAMxB,EAAIwB,IACVyd,EAAajf,EAAIif,WACvB,GAAIA,EAAY,CACd,GAAI59B,EAAKouC,OACL,MAAM,IAAI9wC,WAAW,gDACrB8C,EAAQ+hD,UACR/hD,EAAQ+hD,UAAUniD,EAAM49B,EAAYx9B,GAEpChB,KAAKmoC,kBAAkBvnC,EAAKsa,QAASla,EAASw9B,GAEpD,OAAOzd,GAGTshC,GAAcvvC,UAAUkwC,sBAAwB,SAAgCpiD,EAAMI,GAClF,IAAIuf,EAASvgB,UACI,IAAZgB,IAAqBA,EAAU,IAGtC,IADA,IAAI+f,EAAM/gB,KAAK6iD,cAAcjiD,EAAMI,GAC1BoJ,EAAIxJ,EAAKq2B,MAAMr1B,OAAS,EAAGwI,GAAK,EAAGA,IAAK,CAC/C,IAAIq0C,EAAOl+B,EAAOqiC,cAAchiD,EAAKq2B,MAAM7sB,GAAIxJ,EAAKmyC,SAAU/xC,GAC1Dy9C,KACDA,EAAKjgB,YAAcigB,EAAK19B,KAAKoB,YAAYpB,GAC1CA,EAAM09B,EAAK19B,KAGf,OAAOA,GAGTshC,GAAcvvC,UAAU8vC,cAAgB,SAAwBzrB,EAAM0f,EAAQ71C,QACzD,IAAZA,IAAqBA,EAAU,IAEtC,IAAI+iC,EAAQ/jC,KAAKi3B,MAAME,EAAK54B,KAAKd,MACjC,OAAOsmC,GAASse,GAAcS,WAAWloC,GAAI5Z,GAAU+iC,EAAM5M,EAAM0f,KAOrEwL,GAAcS,WAAa,SAAqBloC,EAAKqoC,GACnD,GAAwB,iBAAbA,EACP,MAAO,CAACliC,IAAKnG,EAAIgmC,eAAeqC,IACpC,GAA0B,MAAtBA,EAAU3zC,SACV,MAAO,CAACyR,IAAKkiC,GACjB,IAAIliC,EAAMnG,EAAIzM,cAAc80C,EAAU,IAAKzkB,EAAa,KACpD3J,EAAQouB,EAAU,GAAIz8B,EAAQ,EAClC,GAAIqO,GAAyB,iBAATA,GAAuC,MAAlBA,EAAMvlB,WAAqBrH,MAAMC,QAAQ2sB,GAEhF,IAAK,IAAIp3B,KADT+oB,EAAQ,EACSqO,EACI,MAAfA,EAAMp3B,IAAiBsjB,EAAImiC,aAAazlD,EAAMo3B,EAAMp3B,IAG5D,IAAK,IAAI2M,EAAIoc,EAAOpc,EAAI64C,EAAUrhD,OAAQwI,IAAK,CAC7C,IAAI5H,EAAQygD,EAAU74C,GACtB,GAAc,IAAV5H,EAAa,CACf,GAAI4H,EAAI64C,EAAUrhD,OAAS,GAAKwI,EAAIoc,EAChC,MAAM,IAAItoB,WAAW,0DACzB,MAAO,CAAC6iB,IAAKA,EAAKyd,WAAYzd,GAE9B,IAAIxB,EAAM8iC,GAAcS,WAAWloC,EAAKpY,GAClCurC,EAAQxuB,EAAIwB,IACZoiC,EAAe5jC,EAAIif,WAEzB,GADAzd,EAAIoB,YAAY4rB,GACZoV,EAAc,CAChB,GAAI3kB,EAAc,MAAM,IAAItgC,WAAW,0BACvCsgC,EAAa2kB,GAInB,MAAO,CAACpiC,IAAKA,EAAKyd,WAAYA,IAMhC6jB,GAAc3b,WAAa,SAAqBpM,GAC9C,OAAOA,EAAOiZ,OAAO6P,gBAClB9oB,EAAOiZ,OAAO6P,cAAgB,IAAIf,GAAcriD,KAAKqjD,gBAAgB/oB,GAASt6B,KAAKsjD,gBAAgBhpB,MAMxG+nB,GAAcgB,gBAAkB,SAA0B/oB,GACxD,IAAI95B,EAAS8hD,GAAYhoB,EAAOd,OAEhC,OADKh5B,EAAOY,OAAQZ,EAAOY,KAAO,SAAUR,GAAQ,OAAOA,EAAKQ,OACzDZ,GAKT6hD,GAAciB,gBAAkB,SAA0BhpB,GACxD,OAAOgoB,GAAYhoB,EAAOrD,QAiB5Bn5B,EAAQ2lC,KAAOA,EACf3lC,EAAQ00C,YAAcA,EACtB10C,EAAQo1C,UAAYA,EACpBp1C,EAAQywC,SAAWA,EACnBzwC,EAAQqd,MAAQA,EAChBrd,EAAQiyC,aAAeA,EACvBjyC,EAAQwlC,KAAOA,EACfxlC,EAAQi8C,OAASA,GACjBj8C,EAAQq7C,SAAWA,GACnBr7C,EAAQg8C,SAAWA,GACnBh8C,EAAQm3C,aAAeA,EACvBn3C,EAAQ88C,UAAYA,GACpB98C,EAAQukD,cAAgBA,I,oCC/2GxBljD,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIqa,EAAmB,EAAQ,QAC3B2F,EAAuB,EAAQ,QAE/BojC,EAAcpkD,OAAO/B,OAAO,MAI5B+f,EAAY,SAAmBa,EAASC,EAAO+K,GAGjDhpB,KAAKgpB,OAASA,GAAU,CAAC,IAAIw6B,EAAexlC,EAAQ6I,IAAI5I,GAAQD,EAAQyI,IAAIxI,KAI5Eje,KAAKge,QAAUA,EAIfhe,KAAKie,MAAQA,GAGX21B,EAAqB,CAAE/3B,OAAQ,GAAGd,KAAM,GAAG8K,KAAM,GAAGC,GAAI,GAAG/G,MAAO,GAAGD,IAAK,GAAG1D,MAAO,IAIxFw4B,EAAmB/3B,OAAOwI,IAAM,WAAc,OAAOrkB,KAAKge,QAAQxC,KAIlEo4B,EAAmB74B,KAAKsJ,IAAM,WAAc,OAAOrkB,KAAKie,MAAMzC,KAI9Do4B,EAAmB/tB,KAAKxB,IAAM,WAAc,OAAOrkB,KAAK+e,MAAMvD,KAI9Do4B,EAAmB9tB,GAAGzB,IAAM,WAAc,OAAOrkB,KAAK8e,IAAItD,KAI1Do4B,EAAmB70B,MAAMsF,IAAM,WAC7B,OAAOrkB,KAAKgpB,OAAO,GAAGjK,OAKxB60B,EAAmB90B,IAAIuF,IAAM,WAC3B,OAAOrkB,KAAKgpB,OAAO,GAAGlK,KAKxB80B,EAAmBx4B,MAAMiJ,IAAM,WAE7B,IADA,IAAI2E,EAAShpB,KAAKgpB,OACT5e,EAAI,EAAGA,EAAI4e,EAAOpnB,OAAQwI,IAC/B,GAAI4e,EAAO5e,GAAG2U,MAAMvD,KAAOwN,EAAO5e,GAAG0U,IAAItD,IAAO,OAAO,EAC3D,OAAO,GAYT2B,EAAUrK,UAAUoI,QAAU,WAC5B,OAAOlb,KAAK+e,MAAMne,KAAK,GAAGkK,MAAM9K,KAAK6lB,KAAM7lB,KAAK8lB,IAAI,IAMtD3I,EAAUrK,UAAU1S,QAAU,SAAkB+e,EAAIjE,QAC/B,IAAZA,IAAqBA,EAAUV,EAAiBW,MAAMC,OAM7D,IADA,IAAIqoC,EAAWvoC,EAAQA,QAAQ+B,UAAWymC,EAAa,KAC9Ct5C,EAAI,EAAGA,EAAI8Q,EAAQ6e,QAAS3vB,IACnCs5C,EAAaD,EACbA,EAAWA,EAASxmC,UAItB,IADA,IAAImH,EAAUjF,EAAGmG,MAAM1jB,OAAQonB,EAAShpB,KAAKgpB,OACpCsB,EAAM,EAAGA,EAAMtB,EAAOpnB,OAAQ0oB,IAAO,CAC5C,IAAI/K,EAAMyJ,EAAOsB,GACXvL,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACVjE,EAAUsE,EAAGtE,QAAQ/P,MAAMsZ,GACjCjF,EAAGwkC,aAAa9oC,EAAQpX,IAAIsb,EAAMvD,KAAMX,EAAQpX,IAAIqb,EAAItD,KAAM8O,EAAM9P,EAAiBW,MAAMC,MAAQF,GACxF,GAAPoP,GACAs5B,EAAwBzkC,EAAIiF,GAAUq/B,EAAWA,EAAS1Q,SAAW2Q,GAAcA,EAAW5nC,cAAgB,EAAI,KAO1HqB,EAAUrK,UAAU+wC,YAAc,SAAsB1kC,EAAIve,GAE1D,IADA,IAAIwjB,EAAUjF,EAAGmG,MAAM1jB,OAAQonB,EAAShpB,KAAKgpB,OACpC5e,EAAI,EAAGA,EAAI4e,EAAOpnB,OAAQwI,IAAK,CACtC,IAAImV,EAAMyJ,EAAO5e,GACX2U,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACVjE,EAAUsE,EAAGtE,QAAQ/P,MAAMsZ,GAC7ByB,EAAOhL,EAAQpX,IAAIsb,EAAMvD,KAAMsK,EAAKjL,EAAQpX,IAAIqb,EAAItD,KACpDpR,EACF+U,EAAG2kC,YAAYj+B,EAAMC,IAErB3G,EAAG4kC,iBAAiBl+B,EAAMC,EAAIllB,GAC9BgjD,EAAwBzkC,EAAIiF,EAASxjB,EAAKmyC,UAAY,EAAI,MAiBhE51B,EAAUZ,SAAW,SAAmB5B,EAAM6B,EAAKwnC,GACjD,IAAIjW,EAAQpzB,EAAKhT,OAAO2V,cAAgB,IAAI0B,EAAcrE,GACpDspC,EAAgBtpC,EAAK/Z,KAAK,GAAI+Z,EAAKhT,OAAQgT,EAAKa,IAAKb,EAAKzW,QAASsY,EAAKwnC,GAC9E,GAAIjW,EAAS,OAAOA,EAEpB,IAAK,IAAInxB,EAAQjC,EAAKiC,MAAQ,EAAGA,GAAS,EAAGA,IAAS,CACpD,IAAI2yB,EAAQ/yB,EAAM,EACZynC,EAAgBtpC,EAAK/Z,KAAK,GAAI+Z,EAAK/Z,KAAKgc,GAAQjC,EAAKnT,OAAOoV,EAAQ,GAAIjC,EAAKzW,MAAM0Y,GAAQJ,EAAKwnC,GAChGC,EAAgBtpC,EAAK/Z,KAAK,GAAI+Z,EAAK/Z,KAAKgc,GAAQjC,EAAK8C,MAAMb,EAAQ,GAAIjC,EAAKzW,MAAM0Y,GAAS,EAAGJ,EAAKwnC,GACzG,GAAIzU,EAAS,OAAOA,IAQxBpyB,EAAUlC,KAAO,SAAeN,EAAMmvB,GAGpC,YAFgB,IAATA,IAAkBA,EAAO,GAEzB9pC,KAAKuc,SAAS5B,EAAMmvB,IAAS9pC,KAAKuc,SAAS5B,GAAOmvB,IAAS,IAAIoa,EAAavpC,EAAK/Z,KAAK,KAQ/Fuc,EAAUgnC,QAAU,SAAkBvpC,GACpC,OAAOqpC,EAAgBrpC,EAAKA,EAAK,EAAG,EAAG,IAAM,IAAIspC,EAAatpC,IAMhEuC,EAAUinC,MAAQ,SAAgBxpC,GAChC,OAAOqpC,EAAgBrpC,EAAKA,EAAKA,EAAIM,QAAQysB,KAAM/sB,EAAIkC,YAAa,IAAM,IAAIonC,EAAatpC,IAM7FuC,EAAU1B,SAAW,SAAmBb,EAAKc,GAC3C,IAAKA,IAASA,EAAKnd,KAAQ,MAAM,IAAIL,WAAW,wCAChD,IAAImmD,EAAMd,EAAY7nC,EAAKnd,MAC3B,IAAK8lD,EAAO,MAAM,IAAInmD,WAAY,qBAAwBwd,EAAS,KAAI,YACvE,OAAO2oC,EAAI5oC,SAASb,EAAKc,IAQ3ByB,EAAUE,OAAS,SAAiB2vB,EAAIsX,GACtC,GAAItX,KAAMuW,EAAe,MAAM,IAAIrlD,WAAW,sCAAwC8uC,GAGtF,OAFAuW,EAAYvW,GAAMsX,EAClBA,EAAexxC,UAAUuK,OAAS2vB,EAC3BsX,GAWTnnC,EAAUrK,UAAU6I,YAAc,WAChC,OAAOqD,EAAc2M,QAAQ3rB,KAAKge,QAAShe,KAAKie,OAAOtC,eAGzDxc,OAAOo9B,iBAAkBpf,EAAUrK,UAAW8gC,GAM9Cz2B,EAAUrK,UAAUsK,SAAU,EAiB9B,IAAIomC,EAAiB,SAAwBzkC,EAAOD,GAGlD9e,KAAK+e,MAAQA,EAGb/e,KAAK8e,IAAMA,GAOTE,EAAiB,SAAU7B,GAC7B,SAAS6B,EAAchB,EAASC,QACf,IAAVA,IAAmBA,EAAQD,GAEhCb,EAAUpN,KAAK/P,KAAMge,EAASC,GAG3Bd,IAAY6B,EAAc3X,UAAY8V,GAC3C6B,EAAclM,UAAY3T,OAAO/B,OAAQ+f,GAAaA,EAAUrK,WAChEkM,EAAclM,UAAU1Q,YAAc4c,EAEtC,IAAIwvB,EAAuB,CAAE+V,QAAS,IA+EtC,OA1EA/V,EAAqB+V,QAAQlgC,IAAM,WAAc,OAAOrkB,KAAKge,QAAQxC,KAAOxb,KAAKie,MAAMzC,IAAMxb,KAAKie,MAAQ,MAE1Ge,EAAclM,UAAUrP,IAAM,SAAcmX,EAAKC,GAC/C,IAAIoD,EAAQrD,EAAIE,QAAQD,EAAQpX,IAAIzD,KAAK+a,OACzC,IAAKkD,EAAMtW,OAAO2V,cAAiB,OAAOH,EAAUlC,KAAKgD,GACzD,IAAID,EAAUpD,EAAIE,QAAQD,EAAQpX,IAAIzD,KAAK6b,SAC3C,OAAO,IAAImD,EAAchB,EAAQrW,OAAO2V,cAAgBU,EAAUC,EAAOA,IAG3Ee,EAAclM,UAAU1S,QAAU,SAAkB+e,EAAIjE,GAItD,QAHiB,IAAZA,IAAqBA,EAAUV,EAAiBW,MAAMC,OAE3D+B,EAAUrK,UAAU1S,QAAQ2P,KAAK/P,KAAMmf,EAAIjE,GACvCA,GAAWV,EAAiBW,MAAMC,MAAO,CAC3C,IAAI6b,EAAQj3B,KAAK+e,MAAM+zB,YAAY9yC,KAAK8e,KACpCmY,GAAS9X,EAAGqlC,YAAYvtB,KAIhCjY,EAAclM,UAAUuI,GAAK,SAAaC,GACxC,OAAOA,aAAiB0D,GAAiB1D,EAAMO,QAAU7b,KAAK6b,QAAUP,EAAMP,MAAQ/a,KAAK+a,MAG7FiE,EAAclM,UAAU6I,YAAc,WACpC,OAAO,IAAI8oC,EAAazkD,KAAK6b,OAAQ7b,KAAK+a,OAG5CiE,EAAclM,UAAUyI,OAAS,WAC/B,MAAO,CAAChd,KAAM,OAAQsd,OAAQ7b,KAAK6b,OAAQd,KAAM/a,KAAK+a,OAGxDiE,EAAcvD,SAAW,SAAmBb,EAAKc,GAC/C,GAA0B,iBAAfA,EAAKG,QAA0C,iBAAbH,EAAKX,KAC9C,MAAM,IAAI7c,WAAW,4CACzB,OAAO,IAAI8gB,EAAcpE,EAAIE,QAAQY,EAAKG,QAASjB,EAAIE,QAAQY,EAAKX,QAKtEiE,EAAc5hB,OAAS,SAAiBwd,EAAKiB,EAAQd,QACrC,IAATA,IAAkBA,EAAOc,GAE9B,IAAImC,EAAUpD,EAAIE,QAAQe,GAC1B,OAAO,IAAI7b,KAAKge,EAASjD,GAAQc,EAASmC,EAAUpD,EAAIE,QAAQC,KAUlEiE,EAAc2M,QAAU,SAAkB3N,EAASC,EAAO6rB,GACxD,IAAI4a,EAAO1mC,EAAQxC,IAAMyC,EAAMzC,IAE/B,GADKsuB,IAAQ4a,IAAQ5a,EAAO4a,GAAQ,EAAI,GAAK,IACxCzmC,EAAMtW,OAAO2V,cAAe,CAC/B,IAAIiyB,EAAQpyB,EAAUZ,SAAS0B,EAAO6rB,GAAM,IAAS3sB,EAAUZ,SAAS0B,GAAQ6rB,GAAM,GACtF,IAAIyF,EACG,OAAOpyB,EAAUlC,KAAKgD,EAAO6rB,GADvB7rB,EAAQsxB,EAAMtxB,MAW7B,OARKD,EAAQrW,OAAO2V,gBACN,GAARonC,EACF1mC,EAAUC,GAEVD,GAAWb,EAAUZ,SAASyB,GAAU8rB,GAAM,IAAS3sB,EAAUZ,SAASyB,EAAS8rB,GAAM,IAAO9rB,QAC3FA,EAAQxC,IAAMyC,EAAMzC,KAASkpC,EAAO,IAAM1mC,EAAUC,KAGtD,IAAIe,EAAchB,EAASC,IAGpC9e,OAAOo9B,iBAAkBvd,EAAclM,UAAW07B,GAE3CxvB,EA1FW,CA2FlB7B,GAEFA,EAAUE,OAAO,OAAQ2B,GAEzB,IAAIylC,EAAe,SAAsB5oC,EAAQd,GAC/C/a,KAAK6b,OAASA,EACd7b,KAAK+a,KAAOA,GAEd0pC,EAAa3xC,UAAUrP,IAAM,SAAcoX,GACzC,OAAO,IAAI4pC,EAAa5pC,EAAQpX,IAAIzD,KAAK6b,QAAShB,EAAQpX,IAAIzD,KAAK+a,QAErE0pC,EAAa3xC,UAAUgI,QAAU,SAAkBF,GACjD,OAAOoE,EAAc2M,QAAQ/Q,EAAIE,QAAQ9a,KAAK6b,QAASjB,EAAIE,QAAQ9a,KAAK+a,QAQ1E,IAAI8E,EAAiB,SAAU1C,GAC7B,SAAS0C,EAAclF,GACrB,IAAI/Z,EAAO+Z,EAAK8G,UACZqwB,EAAOn3B,EAAK/Z,KAAK,GAAGka,QAAQH,EAAKa,IAAM5a,EAAKghB,UAChDzE,EAAUpN,KAAK/P,KAAM2a,EAAMm3B,GAE3B9xC,KAAKY,KAAOA,EAiDd,OA9CKuc,IAAY0C,EAAcxY,UAAY8V,GAC3C0C,EAAc/M,UAAY3T,OAAO/B,OAAQ+f,GAAaA,EAAUrK,WAChE+M,EAAc/M,UAAU1Q,YAAcyd,EAEtCA,EAAc/M,UAAUrP,IAAM,SAAcmX,EAAKC,GAC/C,IAAI0E,EAAM1E,EAAQ8pC,UAAU3kD,KAAK6b,QAC7B+oC,EAAUrlC,EAAIqlC,QACdppC,EAAM+D,EAAI/D,IACVb,EAAOC,EAAIE,QAAQU,GACvB,OAAIopC,EAAkBznC,EAAUlC,KAAKN,GAC9B,IAAIkF,EAAclF,IAG3BkF,EAAc/M,UAAUoI,QAAU,WAChC,OAAO,IAAIV,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAK7lB,KAAKY,MAAO,EAAG,IAGlFif,EAAc/M,UAAUuI,GAAK,SAAaC,GACxC,OAAOA,aAAiBuE,GAAiBvE,EAAMO,QAAU7b,KAAK6b,QAGhEgE,EAAc/M,UAAUyI,OAAS,WAC/B,MAAO,CAAChd,KAAM,OAAQsd,OAAQ7b,KAAK6b,SAGrCgE,EAAc/M,UAAU6I,YAAc,WAA0B,OAAO,IAAIkpC,EAAa7kD,KAAK6b,SAE7FgE,EAAcpE,SAAW,SAAmBb,EAAKc,GAC/C,GAA0B,iBAAfA,EAAKG,OACZ,MAAM,IAAI3d,WAAW,4CACzB,OAAO,IAAI2hB,EAAcjF,EAAIE,QAAQY,EAAKG,UAK5CgE,EAAcziB,OAAS,SAAiBwd,EAAKiL,GAC3C,OAAO,IAAI7lB,KAAK4a,EAAIE,QAAQ+K,KAM9BhG,EAAcC,aAAe,SAAuBlf,GAClD,OAAQA,EAAK64B,SAAwC,IAA9B74B,EAAKrC,KAAK2d,KAAK4oC,YAGjCjlC,EAvDW,CAwDlB1C,GAEF0C,EAAc/M,UAAUsK,SAAU,EAElCD,EAAUE,OAAO,OAAQwC,GAEzB,IAAIglC,EAAe,SAAsBhpC,GACvC7b,KAAK6b,OAASA,GAEhBgpC,EAAa/xC,UAAUrP,IAAM,SAAcoX,GACzC,IAAI0E,EAAM1E,EAAQ8pC,UAAU3kD,KAAK6b,QAC3B+oC,EAAUrlC,EAAIqlC,QACdppC,EAAM+D,EAAI/D,IAChB,OAAOopC,EAAU,IAAIH,EAAajpC,EAAKA,GAAO,IAAIqpC,EAAarpC,IAEjEqpC,EAAa/xC,UAAUgI,QAAU,SAAkBF,GACjD,IAAID,EAAOC,EAAIE,QAAQ9a,KAAK6b,QAASjb,EAAO+Z,EAAK8G,UACjD,OAAI7gB,GAAQif,EAAcC,aAAalf,GAAgB,IAAIif,EAAclF,GAClEwC,EAAUlC,KAAKN,IAOxB,IAAIupC,EAAgB,SAAU/mC,GAC5B,SAAS+mC,EAAatpC,GACpBuC,EAAUpN,KAAK/P,KAAM4a,EAAIE,QAAQ,GAAIF,EAAIE,QAAQF,EAAIM,QAAQysB,OAiB/D,OAdKxqB,IAAY+mC,EAAa78C,UAAY8V,GAC1C+mC,EAAapxC,UAAY3T,OAAO/B,OAAQ+f,GAAaA,EAAUrK,WAC/DoxC,EAAapxC,UAAU1Q,YAAc8hD,EAErCA,EAAapxC,UAAUyI,OAAS,WAAqB,MAAO,CAAChd,KAAM,QAEnE2lD,EAAazoC,SAAW,SAAmBb,GAAO,OAAO,IAAIspC,EAAatpC,IAE1EspC,EAAapxC,UAAUrP,IAAM,SAAcmX,GAAO,OAAO,IAAIspC,EAAatpC,IAE1EspC,EAAapxC,UAAUuI,GAAK,SAAaC,GAAS,OAAOA,aAAiB4oC,GAE1EA,EAAapxC,UAAU6I,YAAc,WAA0B,OAAOopC,GAE/Db,EAnBU,CAoBjB/mC,GAEFA,EAAUE,OAAO,MAAO6mC,GAExB,IAAIa,EAAc,CAChBthD,IAAK,WAAiB,OAAOzD,MAC7B8a,QAAS,SAAiBF,GAAO,OAAO,IAAIspC,EAAatpC,KAQ3D,SAASqpC,EAAgBrpC,EAAKha,EAAM4a,EAAKtX,EAAOsY,EAAKpb,GACnD,GAAIR,EAAK0c,cAAiB,OAAO0B,EAAc5hB,OAAOwd,EAAKY,GAC3D,IAAK,IAAIpR,EAAIlG,GAASsY,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAIpS,EAAIxJ,EAAKkc,WAAa1S,GAAK,EAAGA,GAAKoS,EAAK,CACxF,IAAIha,EAAQ5B,EAAK4B,MAAM4H,GACvB,GAAK5H,EAAM+a,QAGJ,IAAKnc,GAAQye,EAAcC,aAAatd,GAC7C,OAAOqd,EAAcziB,OAAOwd,EAAKY,GAAOgB,EAAM,EAAIha,EAAMof,SAAW,QAJlD,CACjB,IAAImsB,EAAQkW,EAAgBrpC,EAAKpY,EAAOgZ,EAAMgB,EAAKA,EAAM,EAAIha,EAAMsa,WAAa,EAAGN,EAAKpb,GACxF,GAAI2sC,EAAS,OAAOA,EAItBvyB,GAAOhZ,EAAMof,SAAWpF,GAI5B,SAASonC,EAAwBzkC,EAAI6lC,EAAUlb,GAC7C,IAAIxiB,EAAOnI,EAAGmG,MAAM1jB,OAAS,EAC7B,KAAI0lB,EAAO09B,GAAX,CACA,IAAIpgC,EAAOzF,EAAGmG,MAAMgC,GACpB,GAAM1C,aAAgBzE,EAAqB8kC,aAAergC,aAAgBzE,EAAqB+kC,kBAA/F,CACA,IAAiCz/C,EAA7BhC,EAAM0b,EAAGtE,QAAQ0J,KAAK+C,GAC1B7jB,EAAInE,SAAQ,SAAUwpB,EAAOC,EAAKo8B,EAAUC,GAAoB,MAAP3/C,IAAeA,EAAM2/C,MAC9EjmC,EAAGC,aAAajC,EAAUlC,KAAKkE,EAAGvE,IAAIE,QAAQrV,GAAMqkC,MAGtD,IAAIub,EAAc,EACdC,EAAgB,EAChBC,EAAiB,EAmBjBC,EAAe,SAAUC,GAC3B,SAASD,EAAYhnC,GACnBinC,EAAa11C,KAAK/P,KAAMwe,EAAM5D,KAI9B5a,KAAKyoB,KAAOi9B,KAAKC,MACjB3lD,KAAK4lD,aAAepnC,EAAMI,UAE1B5e,KAAK6lD,gBAAkB,EAGvB7lD,KAAK+3B,YAAcvZ,EAAMuZ,YAGzB/3B,KAAK4rB,QAAU,EAEf5rB,KAAKiyB,KAAO9yB,OAAO/B,OAAO,MAGvBqoD,IAAeD,EAAYn+C,UAAYo+C,GAC5CD,EAAY1yC,UAAY3T,OAAO/B,OAAQqoD,GAAgBA,EAAa3yC,WACpE0yC,EAAY1yC,UAAU1Q,YAAcojD,EAEpC,IAAI5R,EAAqB,CAAEh1B,UAAW,GAAGknC,aAAc,GAAGC,eAAgB,GAAGC,UAAW,GAAGC,iBAAkB,IA0K7G,OAnKArS,EAAmBh1B,UAAUyF,IAAM,WAKjC,OAJIrkB,KAAK6lD,gBAAkB7lD,KAAKslB,MAAM1jB,SACpC5B,KAAK4lD,aAAe5lD,KAAK4lD,aAAaniD,IAAIzD,KAAK4a,IAAK5a,KAAK6a,QAAQ/P,MAAM9K,KAAK6lD,kBAC5E7lD,KAAK6lD,gBAAkB7lD,KAAKslB,MAAM1jB,QAE7B5B,KAAK4lD,cAMdJ,EAAY1yC,UAAUsM,aAAe,SAAuBR,GAC1D,GAAIA,EAAUG,MAAMnE,KAAO5a,KAAK4a,IAC5B,MAAM,IAAI1c,WAAW,uEAKzB,OAJA8B,KAAK4lD,aAAehnC,EACpB5e,KAAK6lD,gBAAkB7lD,KAAKslB,MAAM1jB,OAClC5B,KAAK4rB,SAAW5rB,KAAK4rB,QAAUy5B,IAAgBC,EAC/CtlD,KAAK+3B,YAAc,KACZ/3B,MAKT4zC,EAAmBkS,aAAazhC,IAAM,WACpC,OAAQrkB,KAAK4rB,QAAUy5B,GAAe,GAKxCG,EAAY1yC,UAAUozC,eAAiB,SAAyBjvB,GAG9D,OAFAj3B,KAAK+3B,YAAcd,EACnBj3B,KAAK4rB,SAAW05B,EACTtlD,MAOTwlD,EAAY1yC,UAAU0xC,YAAc,SAAsBvtB,GAGxD,OAFKzc,EAAiB8oB,KAAK+M,QAAQrwC,KAAK+3B,aAAe/3B,KAAK4e,UAAUG,MAAMkY,QAASA,IACjFj3B,KAAKkmD,eAAejvB,GACjBj3B,MAKTwlD,EAAY1yC,UAAUqzC,cAAgB,SAAwBhvB,GAC5D,OAAOn3B,KAAKwkD,YAAYrtB,EAAKwC,SAAS35B,KAAK+3B,aAAe/3B,KAAK4e,UAAUX,MAAMgZ,WAKjFuuB,EAAY1yC,UAAUumB,iBAAmB,SAA2BlC,GAClE,OAAOn3B,KAAKwkD,YAAYrtB,EAAKgZ,cAAcnwC,KAAK+3B,aAAe/3B,KAAK4e,UAAUX,MAAMgZ,WAKtF2c,EAAmBmS,eAAe1hC,IAAM,WACtC,OAAQrkB,KAAK4rB,QAAU05B,GAAiB,GAG1CE,EAAY1yC,UAAUszC,QAAU,SAAkBxhC,EAAMhK,GACtD6qC,EAAa3yC,UAAUszC,QAAQr2C,KAAK/P,KAAM4kB,EAAMhK,GAChD5a,KAAK4rB,QAAU5rB,KAAK4rB,SAAW05B,EAC/BtlD,KAAK+3B,YAAc,MAKrBytB,EAAY1yC,UAAUuzC,QAAU,SAAkB59B,GAEhD,OADAzoB,KAAKyoB,KAAOA,EACLzoB,MAKTwlD,EAAY1yC,UAAUwzC,iBAAmB,SAA2Bx7C,GAElE,OADA9K,KAAK4e,UAAUxe,QAAQJ,KAAM8K,GACtB9K,MAOTwlD,EAAY1yC,UAAUu1B,qBAAuB,SAA+BznC,EAAM2lD,GAChF,IAAI3nC,EAAY5e,KAAK4e,UAIrB,OAHqB,IAAjB2nC,IACA3lD,EAAOA,EAAKu2B,KAAKn3B,KAAK+3B,cAAgBnZ,EAAUxD,MAAQwD,EAAUG,MAAMkY,QAAWrY,EAAUG,MAAM+zB,YAAYl0B,EAAUE,MAAQtE,EAAiB8oB,KAAKiN,QAC3J3xB,EAAUilC,YAAY7jD,KAAMY,GACrBZ,MAKTwlD,EAAY1yC,UAAU0zC,gBAAkB,WAEtC,OADAxmD,KAAK4e,UAAUxe,QAAQJ,MAChBA,MAMTwlD,EAAY1yC,UAAU2zC,WAAa,SAAqBrlD,EAAMykB,EAAMC,QACtD,IAAPA,IAAgBA,EAAKD,GAE1B,IAAIyU,EAASt6B,KAAK4a,IAAIrc,KAAK+7B,OAC3B,GAAY,MAARzU,EACF,OAAKzkB,EACEpB,KAAKqoC,qBAAqB/N,EAAOl5B,KAAKA,IAAO,GADhCpB,KAAKwmD,kBAGzB,IAAKplD,EAAQ,OAAOpB,KAAK8jD,YAAYj+B,EAAMC,GAC3C,IAAImR,EAAQj3B,KAAK+3B,YACjB,IAAKd,EAAO,CACV,IAAIlY,EAAQ/e,KAAK4a,IAAIE,QAAQ+K,GAC7BoR,EAAQnR,GAAMD,EAAO9G,EAAMkY,QAAUlY,EAAM+zB,YAAY9yC,KAAK4a,IAAIE,QAAQgL,IAI1E,OAFA9lB,KAAK+jD,iBAAiBl+B,EAAMC,EAAIwU,EAAOl5B,KAAKA,EAAM61B,IAC7Cj3B,KAAK4e,UAAUxD,OAASpb,KAAKof,aAAajC,EAAUlC,KAAKjb,KAAK4e,UAAUE,MACtE9e,MAOXwlD,EAAY1yC,UAAUuW,QAAU,SAAkB5oB,EAAKN,GAErD,OADAH,KAAKiyB,KAAmB,iBAAPxxB,EAAkBA,EAAMA,EAAIA,KAAON,EAC7CH,MAKTwlD,EAAY1yC,UAAUiV,QAAU,SAAkBtnB,GAChD,OAAOT,KAAKiyB,KAAmB,iBAAPxxB,EAAkBA,EAAMA,EAAIA,MAMtDmzC,EAAmBoS,UAAU3hC,IAAM,WACjC,IAAI9D,EAASvgB,KAEb,IAAK,IAAIowC,KAAK7vB,EAAO0R,KAAQ,OAAO,EACpC,OAAO,GAMTuzB,EAAY1yC,UAAUwW,eAAiB,WAErC,OADAtpB,KAAK4rB,SAAW25B,EACTvlD,MAGT4zC,EAAmBqS,iBAAiB5hC,IAAM,WACxC,OAAQrkB,KAAK4rB,QAAU25B,GAAkB,GAG3CpmD,OAAOo9B,iBAAkBipB,EAAY1yC,UAAW8gC,GAEzC4R,EAlMS,CAmMhBrlC,EAAqBumC,WAEvB,SAAS1tC,EAAKy1B,EAAGvR,GACf,OAAQA,GAASuR,EAAQA,EAAEz1B,KAAKkkB,GAAXuR,EAGvB,IAAIkY,EAAY,SAAmBlpD,EAAMmpD,EAAM1pB,GAC7Cl9B,KAAKvC,KAAOA,EACZuC,KAAK4pB,KAAO5Q,EAAK4tC,EAAKh9B,KAAMsT,GAC5Bl9B,KAAKrC,MAAQqb,EAAK4tC,EAAKjpD,MAAOu/B,IAG5B2pB,EAAa,CACf,IAAIF,EAAU,MAAO,CACnB/8B,KAAM,SAAcV,GAAU,OAAOA,EAAOtO,KAAOsO,EAAOoR,OAAOigB,YAAYjE,iBAC7E34C,MAAO,SAAewhB,GAAM,OAAOA,EAAGvE,OAGxC,IAAI+rC,EAAU,YAAa,CACzB/8B,KAAM,SAAcV,EAAQiS,GAAY,OAAOjS,EAAOtK,WAAazB,EAAUgnC,QAAQhpB,EAASvgB,MAC9Fjd,MAAO,SAAewhB,GAAM,OAAOA,EAAGP,aAGxC,IAAI+nC,EAAU,cAAe,CAC3B/8B,KAAM,SAAcV,GAAU,OAAOA,EAAO6O,aAAe,MAC3Dp6B,MAAO,SAAewhB,EAAI2nC,EAAQC,EAAMvoC,GAAS,OAAOA,EAAMI,UAAU2lC,QAAUplC,EAAG4Y,YAAc,QAGrG,IAAI4uB,EAAU,oBAAqB,CACjC/8B,KAAM,WAAkB,OAAO,GAC/BjsB,MAAO,SAAewhB,EAAI6nC,GAAQ,OAAO7nC,EAAG8mC,iBAAmBe,EAAO,EAAIA,MAM1EC,EAAgB,SAAuB3sB,EAAQ/wB,GACjD,IAAIgX,EAASvgB,KAEbA,KAAKs6B,OAASA,EACdt6B,KAAKknD,OAASL,EAAWvjD,SACzBtD,KAAKuJ,QAAU,GACfvJ,KAAKmnD,aAAehoD,OAAO/B,OAAO,MAC9BmM,GAAWA,EAAQjK,SAAQ,SAAUka,GACvC,GAAI+G,EAAO4mC,aAAa3tC,EAAO/Y,KAC3B,MAAM,IAAIvC,WAAW,iDAAmDsb,EAAO/Y,IAAM,KACzF8f,EAAOhX,QAAQzH,KAAK0X,GACpB+G,EAAO4mC,aAAa3tC,EAAO/Y,KAAO+Y,EAC9BA,EAAO0C,KAAKsC,OACZ+B,EAAO2mC,OAAOplD,KAAK,IAAI6kD,EAAUntC,EAAO/Y,IAAK+Y,EAAO0C,KAAKsC,MAAOhF,QAWpE4tC,EAAc,SAAqBl+B,GACrClpB,KAAKkpB,OAASA,GAGZslB,EAAuB,CAAElU,OAAQ,GAAG/wB,QAAS,GAAG4V,GAAI,IAcxDqvB,EAAqBlU,OAAOjW,IAAM,WAChC,OAAOrkB,KAAKkpB,OAAOoR,QAKrBkU,EAAqBjlC,QAAQ8a,IAAM,WACjC,OAAOrkB,KAAKkpB,OAAO3f,SAKrB69C,EAAYt0C,UAAUnV,MAAQ,SAAgBwhB,GAC5C,OAAOnf,KAAK4nB,iBAAiBzI,GAAIX,OAInC4oC,EAAYt0C,UAAUu0C,kBAAoB,SAA4BloC,EAAIo6B,GACtE,IAAIh5B,EAASvgB,UACG,IAAXu5C,IAAoBA,GAAU,GAErC,IAAK,IAAInvC,EAAI,EAAGA,EAAIpK,KAAKkpB,OAAO3f,QAAQ3H,OAAQwI,IAAO,GAAIA,GAAKmvC,EAAQ,CACtE,IAAI//B,EAAS+G,EAAO2I,OAAO3f,QAAQa,GACnC,GAAIoP,EAAO0C,KAAKmrC,oBAAsB7tC,EAAO0C,KAAKmrC,kBAAkBt3C,KAAKyJ,EAAQ2F,EAAIoB,GACjF,OAAO,EAEb,OAAO,GAST6mC,EAAYt0C,UAAU8U,iBAAmB,SAA2B0/B,GAChE,IAAI/mC,EAASvgB,KAEf,IAAKA,KAAKqnD,kBAAkBC,GAAW,MAAO,CAAC9oC,MAAOxe,KAAMunD,aAAc,IAMnE,IAJP,IAAIC,EAAM,CAACF,GAASp8B,EAAWlrB,KAAKynD,WAAWH,GAASpR,EAAO,OAI/C,CAEd,IADA,IAAIwR,GAAU,EACLt9C,EAAI,EAAGA,EAAIpK,KAAKkpB,OAAO3f,QAAQ3H,OAAQwI,IAAK,CACnD,IAAIoP,EAAS+G,EAAO2I,OAAO3f,QAAQa,GACnC,GAAIoP,EAAO0C,KAAKyrC,kBAAmB,CACjC,IAAI5jC,EAAImyB,EAAOA,EAAK9rC,GAAG2Z,EAAI,EAAG6jC,EAAW1R,EAAOA,EAAK9rC,GAAGoU,MAAQ+B,EAC5DpB,EAAK4E,EAAIyjC,EAAI5lD,QACb4X,EAAO0C,KAAKyrC,kBAAkB53C,KAAKyJ,EAAQuK,EAAIyjC,EAAI18C,MAAMiZ,GAAKyjC,EAAKI,EAAU18B,GACjF,GAAI/L,GAAM+L,EAASm8B,kBAAkBloC,EAAI/U,GAAI,CAE3C,GADA+U,EAAGkK,QAAQ,sBAAuBi+B,IAC7BpR,EAAM,CACTA,EAAO,GACP,IAAK,IAAIpI,EAAI,EAAGA,EAAI9tC,KAAKkpB,OAAO3f,QAAQ3H,OAAQksC,IAC5CoI,EAAKp0C,KAAKgsC,EAAI1jC,EAAI,CAACoU,MAAO0M,EAAUnH,EAAGyjC,EAAI5lD,QAAU,CAAC4c,MAAO+B,EAAQwD,EAAG,IAE9EyjC,EAAI1lD,KAAKqd,GACT+L,EAAWA,EAASu8B,WAAWtoC,GAC/BuoC,GAAU,EAERxR,IAAQA,EAAK9rC,GAAK,CAACoU,MAAO0M,EAAUnH,EAAGyjC,EAAI5lD,UAGnD,IAAK8lD,EAAW,MAAO,CAAClpC,MAAO0M,EAAUq8B,aAAcC,KAK3DJ,EAAYt0C,UAAU20C,WAAa,SAAqBtoC,GACpD,IAAIoB,EAASvgB,KAEf,IAAKmf,EAAG3X,OAAO6T,GAAGrb,KAAK4a,KAAQ,MAAM,IAAI1c,WAAW,qCAEpD,IADA,IAAI2pD,EAAc,IAAIT,EAAYpnD,KAAKkpB,QAASg+B,EAASlnD,KAAKkpB,OAAOg+B,OAC5D98C,EAAI,EAAGA,EAAI88C,EAAOtlD,OAAQwI,IAAK,CACtC,IAAI09C,EAAQZ,EAAO98C,GACnBy9C,EAAYC,EAAMrqD,MAAQqqD,EAAMnqD,MAAMwhB,EAAIoB,EAAOunC,EAAMrqD,MAAO8iB,EAAQsnC,GAExE,IAAK,IAAIv9B,EAAM,EAAGA,EAAMy9B,EAAenmD,OAAQ0oB,IAASy9B,EAAez9B,GAAK/J,EAAQpB,EAAI0oC,GACxF,OAAOA,GAKTrZ,EAAqBrvB,GAAGkF,IAAM,WAAc,OAAO,IAAImhC,EAAYxlD,OAqBnEonD,EAAYhqD,OAAS,SAAiB8rB,GAGpC,IAFA,IAAI8+B,EAAU,IAAIf,EAAc/9B,EAAOoR,QAAUpR,EAAOtO,IAAIrc,KAAK+7B,OAAQpR,EAAO3f,SAC5E4xB,EAAW,IAAIisB,EAAYY,GACtB59C,EAAI,EAAGA,EAAI49C,EAAQd,OAAOtlD,OAAQwI,IACvC+wB,EAAS6sB,EAAQd,OAAO98C,GAAG3M,MAAQuqD,EAAQd,OAAO98C,GAAGwf,KAAKV,EAAQiS,GACtE,OAAOA,GAkBTisB,EAAYt0C,UAAU61B,YAAc,SAAsBzf,GAKxD,IAJE,IAAI3I,EAASvgB,KAEXgoD,EAAU,IAAIf,EAAc/9B,EAAOoR,QAAUt6B,KAAKs6B,OAAQpR,EAAO3f,SACjE29C,EAASc,EAAQd,OAAQ/rB,EAAW,IAAIisB,EAAYY,GAC/C59C,EAAI,EAAGA,EAAI88C,EAAOtlD,OAAQwI,IAAK,CACtC,IAAI3M,EAAOypD,EAAO98C,GAAG3M,KACrB09B,EAAS19B,GAAQ8iB,EAAOxN,eAAetV,GAAQ8iB,EAAO9iB,GAAQypD,EAAO98C,GAAGwf,KAAKV,EAAQiS,GAEvF,OAAOA,GASTisB,EAAYt0C,UAAUyI,OAAS,SAAiB0sC,GAC5C,IAAI1nC,EAASvgB,KAEXQ,EAAS,CAACoa,IAAK5a,KAAK4a,IAAIW,SAAUqD,UAAW5e,KAAK4e,UAAUrD,UAEhE,GADIvb,KAAK+3B,cAAev3B,EAAOu3B,YAAc/3B,KAAK+3B,YAAYt0B,KAAI,SAAUkC,GAAK,OAAOA,EAAE4V,aACtF0sC,GAAuC,iBAAhBA,EAA4B,IAAK,IAAI1oD,KAAQ0oD,EAAc,CACpF,GAAY,OAAR1oD,GAAyB,aAARA,EACjB,MAAM,IAAIrB,WAAW,sDACzB,IAAIsb,EAASyuC,EAAa1oD,GAAOif,EAAQhF,EAAO0C,KAAKsC,MACjDA,GAASA,EAAMjD,SAAU/a,EAAOjB,GAAQif,EAAMjD,OAAOxL,KAAKyJ,EAAQ+G,EAAO/G,EAAO/Y,OAEtF,OAAOD,GAiBT4mD,EAAY3rC,SAAW,SAAmByN,EAAQxN,EAAMusC,GACtD,IAAKvsC,EAAQ,MAAM,IAAIxd,WAAW,0CAClC,IAAKgrB,EAAOoR,OAAU,MAAM,IAAIp8B,WAAW,0CAC3C,IAAI8pD,EAAU,IAAIf,EAAc/9B,EAAOoR,OAAQpR,EAAO3f,SAClD4xB,EAAW,IAAIisB,EAAYY,GAqB/B,OApBAA,EAAQd,OAAO5nD,SAAQ,SAAUwoD,GAC/B,GAAkB,OAAdA,EAAMrqD,KACR09B,EAASvgB,IAAMJ,EAAiBipB,KAAKhoB,SAASyN,EAAOoR,OAAQ5e,EAAKd,UAC7D,GAAkB,aAAdktC,EAAMrqD,KACf09B,EAASvc,UAAYzB,EAAU1B,SAAS0f,EAASvgB,IAAKc,EAAKkD,gBACtD,GAAkB,eAAdkpC,EAAMrqD,KACXie,EAAKqc,cAAeoD,EAASpD,YAAcrc,EAAKqc,YAAYt0B,IAAIylB,EAAOoR,OAAOya,mBAC7E,CACL,GAAIkT,EAAgB,IAAK,IAAI1oD,KAAQ0oD,EAAc,CACjD,IAAIzuC,EAASyuC,EAAa1oD,GAAOif,EAAQhF,EAAO0C,KAAKsC,MACrD,GAAIhF,EAAO/Y,KAAOqnD,EAAMrqD,MAAQ+gB,GAASA,EAAM/C,UAC3Ctc,OAAO2T,UAAUC,eAAehD,KAAK2L,EAAMnc,GAG7C,YADA47B,EAAS2sB,EAAMrqD,MAAQ+gB,EAAM/C,SAAS1L,KAAKyJ,EAAQ0P,EAAQxN,EAAKnc,GAAO47B,IAI3EA,EAAS2sB,EAAMrqD,MAAQqqD,EAAMl+B,KAAKV,EAAQiS,OAGvCA,GASTisB,EAAYc,iBAAmB,SAA2BzZ,GACxDsZ,EAAejmD,KAAK2sC,IAEtB2Y,EAAYe,oBAAsB,SAA8B1Z,GAC9D,IAAIc,EAAQwY,EAAelvB,QAAQ4V,GAC/Bc,GAAS,GAAKwY,EAAex9C,OAAOglC,EAAO,IAGjDpwC,OAAOo9B,iBAAkB6qB,EAAYt0C,UAAW07B,GAEhD,IAAIuZ,EAAiB,GAoDrB,SAASK,EAAUxpD,EAAKs+B,EAAMla,GAC5B,IAAK,IAAIzjB,KAAQX,EAAK,CACpB,IAAIg0C,EAAMh0C,EAAIW,GACVqzC,aAAena,SAAYma,EAAMA,EAAI55B,KAAKkkB,GAC7B,mBAAR39B,IAA6BqzC,EAAMwV,EAAUxV,EAAK1V,EAAM,KACjEla,EAAOzjB,GAAQqzC,EAEjB,OAAO5vB,EAMT,IAAIrF,EAAS,SAAgBzB,GAG3Blc,KAAKsN,MAAQ,GACT4O,EAAK5O,OAAS86C,EAAUlsC,EAAK5O,MAAOtN,KAAMA,KAAKsN,OAGnDtN,KAAKkc,KAAOA,EACZlc,KAAKS,IAAMyb,EAAKzb,IAAMyb,EAAKzb,IAAIA,IAAM4nD,EAAU,WAKjD1qC,EAAO7K,UAAUiX,SAAW,SAAmBvL,GAAS,OAAOA,EAAMxe,KAAKS,MA4B1E,IAAImI,EAAOzJ,OAAO/B,OAAO,MAEzB,SAASirD,EAAU5qD,GACjB,OAAIA,KAAQmL,EAAenL,EAAO,OAAQmL,EAAKnL,IAC/CmL,EAAKnL,GAAQ,EACNA,EAAO,KAOhB,IAAIksB,EAAY,SAAmBlsB,QACrB,IAATA,IAAkBA,EAAO,OAC7BuC,KAAKS,IAAM4nD,EAAU5qD,IAKtBksB,EAAU7W,UAAUuR,IAAM,SAAc7F,GAAS,OAAOA,EAAM0K,OAAOi+B,aAAannD,KAAKS,MAIvFkpB,EAAU7W,UAAUiX,SAAW,SAAmBvL,GAAS,OAAOA,EAAMxe,KAAKS,MAE7E3C,EAAQqf,UAAYA,EACpBrf,EAAQ0lD,eAAiBA,EACzB1lD,EAAQkhB,cAAgBA,EACxBlhB,EAAQ+hB,cAAgBA,EACxB/hB,EAAQomD,aAAeA,EACvBpmD,EAAQ0nD,YAAcA,EACtB1nD,EAAQspD,YAAcA,EACtBtpD,EAAQ6f,OAASA,EACjB7f,EAAQ6rB,UAAYA,G,oCC1nCpBxqB,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIma,EAAmB,EAAQ,QAC3BE,EAAmB,EAAQ,QAC3B2F,EAAuB,EAAQ,QAE/B3f,EAAS,GACb,GAAwB,oBAAbswB,WAA+C,oBAAZ/hB,SAAyB,CACrE,IAAIu5C,EAAU,cAAcxkD,KAAKgtB,UAAUC,WACvCw3B,EAAY,UAAUz2C,KAAKgf,UAAUC,WACrCy3B,EAAU,wCAAwC1kD,KAAKgtB,UAAUC,WAErEvwB,EAAO2wB,IAAM,MAAMrf,KAAKgf,UAAUM,UAClC,IAAIq3B,EAAKjoD,EAAOioD,MAAQF,GAAaC,GAAWF,GAChD9nD,EAAOkoD,WAAaH,EAAYx5C,SAAS45C,cAAgB,EAAIH,GAAWA,EAAQ,GAAKF,GAAWA,EAAQ,GAAK,KAC7G9nD,EAAO0wB,OAASu3B,GAAM,gBAAgB32C,KAAKgf,UAAUC,WACrDvwB,EAAOooD,cAAgBpoD,EAAO0wB,SAAW,iBAAiBptB,KAAKgtB,UAAUC,YAAc,CAAC,EAAG,IAAI,GAC/F,IAAIF,GAAU43B,GAAM,gBAAgB3kD,KAAKgtB,UAAUC,WACnDvwB,EAAOqwB,SAAWA,EAClBrwB,EAAOqoD,eAAiBh4B,IAAWA,EAAO,GAC1CrwB,EAAOsoD,KAAOL,GAAM,cAAc32C,KAAKgf,UAAUC,YAAc,cAAcjf,KAAKgf,UAAUC,WAC5FvwB,EAAOuoD,QAAU,aAAaj3C,KAAKgf,UAAUC,WAC7CvwB,EAAOwoD,QAAUP,GAAM,qBAAsB15C,SAASk6C,gBAAgB7mC,MACtE5hB,EAAOwwB,OAAS,iBAAiBlf,KAAKgf,UAAUG,QAChDzwB,EAAO0oD,eAAiB1oD,EAAOwoD,UAAY,uBAAuBllD,KAAKgtB,UAAUC,YAAc,CAAC,EAAG,IAAI,GAGzG,IAAIo4B,EAAW,SAASvoD,GACtB,IAAK,IAAIsD,EAAQ,GAAIA,IAEnB,GADAtD,EAAOA,EAAKs/C,iBACPt/C,EAAQ,OAAOsD,GAIpBgO,EAAa,SAAStR,GACxB,IAAI+G,EAAS/G,EAAKsR,WAClB,OAAOvK,GAA6B,IAAnBA,EAAO2H,SAAiB3H,EAAOyhD,KAAOzhD,GAGrD8hC,EAAY,SAAS7oC,EAAMilB,EAAMC,GACnC,IAAI7nB,EAAQ8Q,SAAS26B,cAGrB,OAFAzrC,EAAM0rC,OAAO/oC,EAAY,MAANklB,EAAallB,EAAK2O,UAAU3N,OAASkkB,GACxD7nB,EAAM2rC,SAAShpC,EAAMilB,GAAQ,GACtB5nB,GAMLorD,EAAuB,SAASzoD,EAAM0oD,EAAKC,EAAYC,GACzD,OAAOD,IAAeE,EAAQ7oD,EAAM0oD,EAAKC,EAAYC,GAAY,IAC3CC,EAAQ7oD,EAAM0oD,EAAKC,EAAYC,EAAW,KAG9DE,EAAe,gCAEnB,SAASD,EAAQ7oD,EAAM0oD,EAAKC,EAAYC,EAAWhtC,GACjD,OAAS,CACP,GAAI5b,GAAQ2oD,GAAcD,GAAOE,EAAa,OAAO,EACrD,GAAIF,IAAQ9sC,EAAM,EAAI,EAAIoF,EAAShhB,IAAQ,CACzC,IAAI+G,EAAS/G,EAAKsR,WAClB,GAAuB,GAAnBvK,EAAO2H,UAAiBq6C,EAAa/oD,IAAS8oD,EAAa53C,KAAKlR,EAAKsO,WAAqC,SAAxBtO,EAAKgpD,gBACvF,OAAO,EACXN,EAAMH,EAASvoD,IAAS4b,EAAM,EAAI,EAAI,GACtC5b,EAAO+G,MACF,IAAqB,GAAjB/G,EAAK0O,SAId,OAAO,EAHP1O,EAAOA,EAAKwpC,WAAWkf,GAAO9sC,EAAM,GAAK,EAAI,IAC7C8sC,EAAM9sC,EAAM,EAAIoF,EAAShhB,GAAQ,IAOvC,SAASghB,EAAShhB,GAChB,OAAwB,GAAjBA,EAAK0O,SAAgB1O,EAAK2O,UAAU3N,OAAShB,EAAKwpC,WAAWxoC,OAGtE,SAAS+nD,EAAa5oC,GAEpB,IADA,IAAI6lC,EACKjX,EAAM5uB,EAAK4uB,EAAKA,EAAMA,EAAIz9B,WAAc,GAAI00C,EAAOjX,EAAIka,WAAc,MAC9E,OAAOjD,GAAQA,EAAKhmD,MAAQgmD,EAAKhmD,KAAKquC,UAAY2X,EAAK7lC,KAAOA,GAAO6lC,EAAKpoB,YAAczd,GAK1F,IAAI+oC,EAAqB,SAASC,GAChC,IAAIC,EAAYD,EAAOE,YAGvB,OAFID,GAAaxpD,EAAOqwB,QAAUk5B,EAAOG,aAAeH,EAAOI,WAAW,GAAGH,YACzEA,GAAY,GACTA,GAGT,SAASI,EAASv4B,EAASpxB,GACzB,IAAI+O,EAAQT,SAASs7C,YAAY,SAIjC,OAHA76C,EAAM86C,UAAU,WAAW,GAAM,GACjC96C,EAAMqiB,QAAUA,EAChBriB,EAAM/O,IAAM+O,EAAM1B,KAAOrN,EAClB+O,EAGT,SAAS+6C,EAAWC,GAClB,MAAO,CAAC/qC,KAAM,EAAGsC,MAAOyoC,EAAIC,WACpB5oD,IAAK,EAAGigB,OAAQ0oC,EAAIE,aAG9B,SAASC,EAAQxqD,EAAO8pC,GACtB,MAAuB,iBAAT9pC,EAAoBA,EAAQA,EAAM8pC,GAGlD,SAAS2gB,EAAmBlsC,EAAM6C,EAAMspC,GAGtC,IAFA,IAAIC,EAAkBpsC,EAAKW,SAAS,oBAAsB,EAAG0rC,EAAersC,EAAKW,SAAS,iBAAmB,EACzGzE,EAAM8D,EAAKqC,IAAI4/B,cAAe6J,EAAM5vC,EAAIowC,YACnCrjD,EAASkjD,GAAYnsC,EAAKqC,KAAMpZ,EAASuK,EAAWvK,GAAS,CACpE,IAAKA,EAAU,MACf,GAAuB,GAAnBA,EAAO2H,SAAX,CACA,IAAI27C,EAAQtjD,GAAUiT,EAAI2H,MAA2B,GAAnB5a,EAAO2H,SACrC47C,EAAWD,EAAQV,EAAWC,GAAO7iD,EAAOka,wBAC5CspC,EAAQ,EAAGC,EAAQ,EAiBvB,GAhBI7pC,EAAK1f,IAAMqpD,EAASrpD,IAAM8oD,EAAQG,EAAiB,OACnDM,IAAUF,EAASrpD,IAAM0f,EAAK1f,IAAM8oD,EAAQI,EAAc,QACrDxpC,EAAKO,OAASopC,EAASppC,OAAS6oC,EAAQG,EAAiB,YAC9DM,EAAQ7pC,EAAKO,OAASopC,EAASppC,OAAS6oC,EAAQI,EAAc,WAC9DxpC,EAAK9B,KAAOyrC,EAASzrC,KAAOkrC,EAAQG,EAAiB,QACrDK,IAAUD,EAASzrC,KAAO8B,EAAK9B,KAAOkrC,EAAQI,EAAc,SACvDxpC,EAAKQ,MAAQmpC,EAASnpC,MAAQ4oC,EAAQG,EAAiB,WAC5DK,EAAQ5pC,EAAKQ,MAAQmpC,EAASnpC,MAAQ4oC,EAAQI,EAAc,WAC5DI,GAASC,KACPH,EACFT,EAAIa,SAASF,EAAOC,IAEhBA,IAASzjD,EAAO2jD,WAAaF,GAC7BD,IAASxjD,EAAO4jD,YAAcJ,KAGlCF,EAAS,QAQjB,SAASO,EAAe9sC,GAItB,IAHA,IAEI+sC,EAAQC,EAFRnqC,EAAO7C,EAAKqC,IAAIc,wBAAyB8pC,EAAS51C,KAAK0Q,IAAI,EAAGlF,EAAK1f,KACnE+Y,EAAM8D,EAAKqC,IAAI4/B,cAEVj9C,GAAK6d,EAAK9B,KAAO8B,EAAKQ,OAAS,EAAG6pC,EAAID,EAAS,EACnDC,EAAI71C,KAAK8Q,IAAI6jC,YAAanpC,EAAKO,QAAS8pC,GAAK,EAAG,CACnD,IAAI7qC,EAAMrC,EAAK1b,KAAK6oD,iBAAiBnoD,EAAGkoD,GACxC,GAAI7qC,GAAOrC,EAAKqC,KAAQrC,EAAKqC,IAAI9a,SAAS8a,GAA1C,CACA,IAAI+qC,EAAY/qC,EAAIc,wBACpB,GAAIiqC,EAAUjqD,KAAO8pD,EAAS,GAAI,CAChCF,EAAS1qC,EACT2qC,EAASI,EAAUjqD,IACnB,QAIJ,IADA,IAAIF,EAAQ,GACHoqD,EAAQrtC,EAAKqC,IAAKgrC,EAAOA,EAAQ75C,EAAW65C,GAEnD,GADApqD,EAAMG,KAAK,CAACif,IAAKgrC,EAAOlqD,IAAKkqD,EAAMT,UAAW7rC,KAAMssC,EAAMR,aACtDQ,GAASnxC,EAAI2H,KAAQ,MAE3B,MAAO,CAACkpC,OAAQA,EAAQC,OAAQA,EAAQ/pD,MAAOA,GAKjD,SAASqqD,EAAezsC,GAOtB,IANA,IAAIksC,EAASlsC,EAAIksC,OACbC,EAASnsC,EAAImsC,OACb/pD,EAAQ4d,EAAI5d,MAEZsqD,EAAYR,EAASA,EAAO5pC,wBAAwBhgB,IAAM,EAC1DqqD,EAAoB,GAAbD,EAAiB,EAAIA,EAAYP,EACnCthD,EAAI,EAAGA,EAAIzI,EAAMC,OAAQwI,IAAK,CACrC,IAAIsmC,EAAQ/uC,EAAMyI,GACd2W,EAAM2vB,EAAM3vB,IACZlf,EAAM6uC,EAAM7uC,IACZ4d,EAAOixB,EAAMjxB,KACbsB,EAAIuqC,WAAazpD,EAAMqqD,IAAQnrC,EAAIuqC,UAAYzpD,EAAMqqD,GACrDnrC,EAAIwqC,YAAc9rC,IAAQsB,EAAIwqC,WAAa9rC,IAInD,SAAS0sC,EAAiBvrD,EAAMohB,GAG9B,IAFA,IAAIie,EAA0BmsB,EAAjBC,EAAY,IAAoB7nD,EAAS,EAClD8nD,EAAStqC,EAAOngB,IAAK0qD,EAASvqC,EAAOngB,IAChCW,EAAQ5B,EAAKwO,WAAYo9C,EAAa,EAAGhqD,EAAOA,EAAQA,EAAM6M,YAAam9C,IAAc,CAChG,IAAIziB,OAAQ,EACZ,GAAsB,GAAlBvnC,EAAM8M,SAAiBy6B,EAAQvnC,EAAMwnC,qBACpC,IAAsB,GAAlBxnC,EAAM8M,SACR,SADyBy6B,EAAQN,EAAUjnC,GAAOwnC,iBAGzD,IAAK,IAAI5/B,EAAI,EAAGA,EAAI2/B,EAAMnoC,OAAQwI,IAAK,CACrC,IAAImX,EAAOwoB,EAAM3/B,GACjB,GAAImX,EAAK1f,KAAOyqD,GAAU/qC,EAAKO,QAAUyqC,EAAQ,CAC/CD,EAASv2C,KAAK0Q,IAAIlF,EAAKO,OAAQwqC,GAC/BC,EAASx2C,KAAK8Q,IAAItF,EAAK1f,IAAK0qD,GAC5B,IAAIE,EAAKlrC,EAAK9B,KAAOuC,EAAOvC,KAAO8B,EAAK9B,KAAOuC,EAAOvC,KAChD8B,EAAKQ,MAAQC,EAAOvC,KAAOuC,EAAOvC,KAAO8B,EAAKQ,MAAQ,EAC5D,GAAI0qC,EAAKJ,EAAW,CAClBpsB,EAAUz9B,EACV6pD,EAAYI,EACZL,EAAgBK,GAA0B,GAApBxsB,EAAQ3wB,SAAgB,CAACmQ,KAAM8B,EAAKQ,MAAQC,EAAOvC,KAAO8B,EAAKQ,MAAQR,EAAK9B,KAAM5d,IAAKmgB,EAAOngB,KAAOmgB,EACrG,GAAlBxf,EAAM8M,UAAiBm9C,IACvBjoD,EAASgoD,GAAcxqC,EAAOvC,OAAS8B,EAAK9B,KAAO8B,EAAKQ,OAAS,EAAI,EAAI,IAC7E,WAGCke,IAAYje,EAAOvC,MAAQ8B,EAAKQ,OAASC,EAAOngB,KAAO0f,EAAK1f,KAChDmgB,EAAOvC,MAAQ8B,EAAK9B,MAAQuC,EAAOngB,KAAO0f,EAAKO,UAC5Dtd,EAASgoD,EAAa,IAG9B,OAAIvsB,GAA+B,GAApBA,EAAQ3wB,SAAwBo9C,EAAiBzsB,EAASmsB,IACpEnsB,GAAYosB,GAAiC,GAApBpsB,EAAQ3wB,SAAyB,CAAC1O,KAAMA,EAAM4D,OAAQA,GAC7E2nD,EAAiBlsB,EAASmsB,GAGnC,SAASM,EAAiB9rD,EAAMohB,GAG9B,IAFA,IAAI2qC,EAAM/rD,EAAK2O,UAAU3N,OACrB3D,EAAQ8Q,SAAS26B,cACZt/B,EAAI,EAAGA,EAAIuiD,EAAKviD,IAAK,CAC5BnM,EAAM0rC,OAAO/oC,EAAMwJ,EAAI,GACvBnM,EAAM2rC,SAAShpC,EAAMwJ,GACrB,IAAImX,EAAOsoB,EAAW5rC,EAAO,GAC7B,GAAIsjB,EAAK1f,KAAO0f,EAAKO,QACjB8qC,EAAO5qC,EAAQT,GACf,MAAO,CAAC3gB,KAAMA,EAAM4D,OAAQ4F,GAAK4X,EAAOvC,OAAS8B,EAAK9B,KAAO8B,EAAKQ,OAAS,EAAI,EAAI,IAEzF,MAAO,CAACnhB,KAAMA,EAAM4D,OAAQ,GAG9B,SAASooD,EAAO5qC,EAAQT,GACtB,OAAOS,EAAOvC,MAAQ8B,EAAK9B,KAAO,GAAKuC,EAAOvC,MAAQ8B,EAAKQ,MAAQ,GACjEC,EAAOngB,KAAO0f,EAAK1f,IAAM,GAAKmgB,EAAOngB,KAAO0f,EAAKO,OAAS,EAG9D,SAAS+qC,EAAa9rC,EAAKiB,GACzB,IAAIra,EAASoZ,EAAI7O,WACjB,OAAIvK,GAAU,QAAQmK,KAAKnK,EAAOuH,WAAa8S,EAAOvC,KAAOsB,EAAIc,wBAAwBpC,KAC9E9X,EACJoZ,EAGT,SAAS+rC,EAAepuC,EAAMquC,EAAK/qC,GACjC,IAAIzC,EAAM4sC,EAAiBY,EAAK/qC,GAC5BphB,EAAO2e,EAAI3e,KACX4D,EAAS+a,EAAI/a,OACbslC,GAAQ,EACZ,GAAqB,GAAjBlpC,EAAK0O,WAAkB1O,EAAKwO,WAAY,CAC1C,IAAImS,EAAO3gB,EAAKihB,wBAChBioB,EAAOvoB,EAAK9B,MAAQ8B,EAAKQ,OAASC,EAAOvC,MAAQ8B,EAAK9B,KAAO8B,EAAKQ,OAAS,EAAI,GAAK,EAEtF,OAAOrD,EAAKkqB,QAAQokB,WAAWpsD,EAAM4D,EAAQslC,GAG/C,SAASmjB,EAAavuC,EAAM9d,EAAM4D,EAAQwd,GAQxC,IADA,IAAIkrC,GAAW,EACNvd,EAAM/uC,IAAQ,CACrB,GAAI+uC,GAAOjxB,EAAKqC,IAAO,MACvB,IAAI6lC,EAAOloC,EAAKkqB,QAAQukB,YAAYxd,GAAK,GACzC,IAAKiX,EAAQ,OAAO,KACpB,GAAIA,EAAKhmD,KAAKquC,SAAW2X,EAAKj/C,OAAQ,CACpC,IAAI4Z,EAAOqlC,EAAK7lC,IAAIc,wBACpB,GAAIN,EAAK9B,KAAOuC,EAAOvC,MAAQ8B,EAAK1f,IAAMmgB,EAAOngB,IAAOqrD,EAAUtG,EAAKwG,cAClE,MAAI7rC,EAAKQ,MAAQC,EAAOvC,MAAQ8B,EAAKO,OAASE,EAAOngB,KACnD,MAD0DqrD,EAAUtG,EAAKyG,UAGlF1d,EAAMiX,EAAK7lC,IAAI7O,WAEjB,OAAOg7C,GAAW,EAAIA,EAAUxuC,EAAKkqB,QAAQokB,WAAWpsD,EAAM4D,GAGhE,SAASqnD,EAAiBv0C,EAAS0K,EAAQ0oB,GACzC,IAAIiiB,EAAMr1C,EAAQ8yB,WAAWxoC,OAC7B,GAAI+qD,GAAOjiB,EAAI7oC,IAAM6oC,EAAI5oB,OACvB,IAAK,IAAIwrC,EAASv3C,KAAK0Q,IAAI,EAAG1Q,KAAK8Q,IAAI8lC,EAAM,EAAG52C,KAAKC,MAAM22C,GAAO3qC,EAAOngB,IAAM6oC,EAAI7oC,MAAQ6oC,EAAI5oB,OAAS4oB,EAAI7oC,MAAQ,IAAKuI,EAAIkjD,IAAU,CACrI,IAAI9qD,EAAQ8U,EAAQ8yB,WAAWhgC,GAC/B,GAAsB,GAAlB5H,EAAM8M,SAER,IADA,IAAIy6B,EAAQvnC,EAAMwnC,iBACT8D,EAAI,EAAGA,EAAI/D,EAAMnoC,OAAQksC,IAAK,CACrC,IAAIvsB,EAAOwoB,EAAM+D,GACjB,GAAI8e,EAAO5qC,EAAQT,GAAS,OAAOsqC,EAAiBrpD,EAAOwf,EAAQT,GAGvE,IAAKnX,GAAKA,EAAI,GAAKuiD,IAAQW,EAAU,MAGzC,OAAOh2C,EAIT,SAASkI,EAAYd,EAAMsD,GACzB,IAAsBphB,EAAM4D,EAAxBxB,EAAO0b,EAAK1b,KAChB,GAAIA,EAAKuqD,uBAAwB,CAC/B,IACiBrmD,EADbsmD,EAAQxqD,EAAKuqD,uBAAuBvrC,EAAOvC,KAAMuC,EAAOngB,KAC5D,GAAI2rD,EACAtmD,EAASsmD,EAAO5sD,EAAOsG,EAAOumD,WAAYjpD,EAAS0C,EAAO1C,OAEhE,IAAK5D,GAAQoC,EAAK0qD,oBAAqB,CACrC,IACiBC,EADb1vD,EAAQ+E,EAAK0qD,oBAAoB1rC,EAAOvC,KAAMuC,EAAOngB,KACzD,GAAI5D,EACA0vD,EAAW1vD,EAAO2C,EAAO+sD,EAASC,eAAgBppD,EAASmpD,EAASE,YAG1E,IAA8DryC,EAA1DuxC,EAAM/pD,EAAK6oD,iBAAiB7pC,EAAOvC,KAAMuC,EAAOngB,IAAM,GAC1D,IAAKkrD,IAAQruC,EAAKqC,IAAI9a,SAAyB,GAAhB8mD,EAAIz9C,SAAgBy9C,EAAI76C,WAAa66C,GAAM,CACxE,IAAIriB,EAAMhsB,EAAKqC,IAAIc,wBACnB,IAAK+qC,EAAO5qC,EAAQ0oB,GAAQ,OAAO,KAEnC,GADAqiB,EAAMlB,EAAiBntC,EAAKqC,IAAKiB,EAAQ0oB,IACpCqiB,EAAO,OAAO,KAGrB,GADAA,EAAMF,EAAaE,EAAK/qC,GACpBphB,EAAM,CACR,GAAIJ,EAAO0wB,OAA0B,GAAjBtwB,EAAK0O,WAGvB9K,EAASuR,KAAK8Q,IAAIriB,EAAQ5D,EAAKwpC,WAAWxoC,QAGtC4C,EAAS5D,EAAKwpC,WAAWxoC,QAAQ,CACnC,IAAoCksD,EAAhCpxC,EAAO9b,EAAKwpC,WAAW5lC,GACN,OAAjBkY,EAAKxN,WAAsB4+C,EAAQpxC,EAAKmF,yBAAyBE,OAASC,EAAOvC,MACjFquC,EAAMhsC,OAASE,EAAOngB,KACtB2C,IAKJ5D,GAAQ8d,EAAKqC,KAAOvc,GAAU5D,EAAKwpC,WAAWxoC,OAAS,GAAgC,GAA3BhB,EAAKqc,UAAU3N,UAC3E0S,EAAOngB,IAAMjB,EAAKqc,UAAU4E,wBAAwBC,OACpDtG,EAAMkD,EAAKF,MAAM5D,IAAIM,QAAQysB,KAId,GAAVnjC,GAAgC,GAAjB5D,EAAK0O,UAAyD,MAAxC1O,EAAKwpC,WAAW5lC,EAAS,GAAG0K,WACtEsM,EAAMyxC,EAAavuC,EAAM9d,EAAM4D,EAAQwd,IAElC,MAAPxG,IAAeA,EAAMsxC,EAAepuC,EAAMquC,EAAK/qC,IAEnD,IAAI4kC,EAAOloC,EAAKkqB,QAAQukB,YAAYJ,GAAK,GACzC,MAAO,CAACvxC,IAAKA,EAAKoE,OAAQgnC,EAAOA,EAAKmH,WAAanH,EAAKoH,QAAU,GAGpE,SAASnkB,EAAW9N,EAAQ+N,GAC1B,IAAIC,EAAQhO,EAAOiO,iBACnB,OAAQD,EAAMnoC,OAA0CmoC,EAAMD,EAAO,EAAI,EAAIC,EAAMnoC,OAAS,GAArEm6B,EAAOla,wBAMhC,SAASI,EAAYvD,EAAMlD,GACzB,IAAI+D,EAAMb,EAAKkqB,QAAQuB,WAAW3uB,GAC9B5a,EAAO2e,EAAI3e,KACX4D,EAAS+a,EAAI/a,OAGjB,GAAqB,GAAjB5D,EAAK0O,WAAkB9O,EAAOqwB,QAAUrwB,EAAO0wB,OAAQ,CACzD,IAAI3P,EAAOsoB,EAAWJ,EAAU7oC,EAAM4D,EAAQA,GAAS,GAIvD,GAAIhE,EAAO0wB,OAAS1sB,GAAU,KAAKsN,KAAKlR,EAAK2O,UAAU/K,EAAS,KAAOA,EAAS5D,EAAK2O,UAAU3N,OAAQ,CACrG,IAAIqsD,EAAapkB,EAAWJ,EAAU7oC,EAAM4D,EAAS,EAAGA,EAAS,IAAK,GACtE,GAAIuR,KAAKm4C,IAAID,EAAWxuC,KAAO8B,EAAK9B,MAAQ,GAAKwuC,EAAWpsD,KAAO0f,EAAK1f,IAAK,CAC3E,IAAIssD,EAAYtkB,EAAWJ,EAAU7oC,EAAM4D,EAAQA,EAAS,IAAK,GACjE,OAAO4pD,EAASD,EAAWA,EAAU1uC,KAAOwuC,EAAWxuC,OAG3D,OAAO8B,EAGT,GAAqB,GAAjB3gB,EAAK0O,WAAkBoP,EAAKF,MAAM5D,IAAIE,QAAQU,GAAK7T,OAAO2V,cAAe,CAE3E,IAAgB+wC,EAAZxsD,GAAM,EACV,GAAI2C,EAAS5D,EAAKwpC,WAAWxoC,OAAQ,CACnC,IAAI6b,EAAQ7c,EAAKwpC,WAAW5lC,GACN,GAAlBiZ,EAAMnO,WAAiB++C,EAAS5wC,EAAMoE,yBAE5C,IAAKwsC,GAAU7pD,EAAQ,CACrB,IAAIgD,EAAS5G,EAAKwpC,WAAW5lC,EAAS,GACf,GAAnBgD,EAAO8H,WAAiB++C,EAAS7mD,EAAOqa,wBAAyBhgB,GAAM,GAE7E,OAAOysD,EAASD,GAAUztD,EAAKihB,wBAAyBhgB,GAS1D,IAAK,IAAI2a,GAAO,EAAGA,EAAM,EAAGA,GAAO,EACjC,GAAIA,EAAM,GAAKhY,EAAQ,CACrB,IAAIwiD,OAAO,EAAUhkC,EAA0B,GAAjBpiB,EAAK0O,SAAgBm6B,EAAU7oC,EAAM4D,EAAS,EAAGA,GACxB,IAAhDwiD,EAAOpmD,EAAKwpC,WAAW5lC,EAAS,IAAI8K,SAAgBm6B,EAAUud,GAC9C,GAAjBA,EAAK13C,UAAkC,MAAjB03C,EAAK93C,SAAmB83C,EAAO,KAC3D,GAAIhkC,EAAQ,CACV,IAAIurC,EAAS1kB,EAAW7mB,EAAQ,GAChC,GAAIurC,EAAO1sD,IAAM0sD,EAAOzsC,OAAU,OAAOssC,EAASG,GAAQ,SAEvD,GAAI/xC,EAAM,GAAKhY,EAASod,EAAShhB,GAAO,CAC7C,IAAI8b,OAAO,EAAU8xC,EAA4B,GAAjB5tD,EAAK0O,SAAgBm6B,EAAU7oC,EAAM4D,EAAQA,EAAS,GACnC,IAA5CkY,EAAO9b,EAAKwpC,WAAW5lC,IAAS8K,SAAgBm6B,EAAU/sB,GAC1C,GAAjBA,EAAKpN,SAAgBoN,EAAO,KAClC,GAAI8xC,EAAU,CACZ,IAAIC,EAAS5kB,EAAW2kB,GAAW,GACnC,GAAIC,EAAO5sD,IAAM4sD,EAAO3sC,OAAU,OAAOssC,EAASK,GAAQ,IAKhE,OAAOL,EAASvkB,EAA4B,GAAjBjpC,EAAK0O,SAAgBm6B,EAAU7oC,GAAQA,EAAM,IAAI,GAG9E,SAASwtD,EAAS7sC,EAAM9B,GACtB,GAAkB,GAAd8B,EAAKf,MAAc,OAAOe,EAC9B,IAAI7d,EAAI+b,EAAO8B,EAAK9B,KAAO8B,EAAKQ,MAChC,MAAO,CAAClgB,IAAK0f,EAAK1f,IAAKigB,OAAQP,EAAKO,OAAQrC,KAAM/b,EAAGqe,MAAOre,GAG9D,SAAS4qD,EAAS/sC,EAAM1f,GACtB,GAAmB,GAAf0f,EAAKoB,OAAe,OAAOpB,EAC/B,IAAIqqC,EAAI/pD,EAAM0f,EAAK1f,IAAM0f,EAAKO,OAC9B,MAAO,CAACjgB,IAAK+pD,EAAG9pC,OAAQ8pC,EAAGnsC,KAAM8B,EAAK9B,KAAMsC,MAAOR,EAAKQ,OAG1D,SAAS2sC,EAAiBhwC,EAAMF,EAAOiwB,GACrC,IAAIkgB,EAAYjwC,EAAKF,MAAOi4B,EAAS/3B,EAAK1b,KAAK4rD,cAC3CD,GAAanwC,GAASE,EAAKunB,YAAYznB,GACvCi4B,GAAU/3B,EAAKqC,KAAOrC,EAAK0jB,QAC/B,IACE,OAAOqM,IACP,QACIkgB,GAAanwC,GAASE,EAAKunB,YAAY0oB,GACvClY,GAAU/3B,EAAKqC,KAAO01B,EAAOrU,SAOrC,SAASysB,EAAuBnwC,EAAMF,EAAOhC,GAC3C,IAAImC,EAAMH,EAAMI,UACZjE,EAAc,MAAP6B,EAAcmC,EAAIX,QAAQ6I,IAAIlI,EAAIV,OAASU,EAAIX,QAAQyI,IAAI9H,EAAIV,OAC1E,OAAOywC,EAAiBhwC,EAAMF,GAAO,WAGnC,IAFA,IAAIe,EAAMb,EAAKkqB,QAAQuB,WAAWxvB,EAAKa,KACnCuF,EAAMxB,EAAI3e,OACL,CACP,IAAIkuD,EAAUpwC,EAAKkqB,QAAQukB,YAAYpsC,GAAK,GAC5C,IAAK+tC,EAAW,MAChB,GAAIA,EAAQluD,KAAKquC,QAAS,CAAEluB,EAAM+tC,EAAQ/tC,IAAK,MAC/CA,EAAM+tC,EAAQ/tC,IAAI7O,WAGpB,IADA,IAAI8P,EAASC,EAAYvD,EAAM/D,EAAKa,KAC3BhZ,EAAQue,EAAI3R,WAAY5M,EAAOA,EAAQA,EAAM6M,YAAa,CACjE,IAAI0/C,OAAQ,EACZ,GAAsB,GAAlBvsD,EAAM8M,SAAiBy/C,EAAQvsD,EAAMwnC,qBACpC,IAAsB,GAAlBxnC,EAAM8M,SACR,SADyBy/C,EAAQtlB,EAAUjnC,EAAO,EAAGA,EAAM+M,UAAU3N,QAAQooC,iBAEpF,IAAK,IAAI5/B,EAAI,EAAGA,EAAI2kD,EAAMntD,OAAQwI,IAAK,CACrC,IAAIsgC,EAAMqkB,EAAM3kD,GAChB,GAAIsgC,EAAI5oB,OAAS4oB,EAAI7oC,MAAe,MAAP2a,EAAckuB,EAAI5oB,OAASE,EAAOngB,IAAM,EAAI6oC,EAAI7oC,IAAMmgB,EAAOF,OAAS,GAC/F,OAAO,GAGf,OAAO,KAIX,IAAIktC,EAAW,kBAEf,SAASC,EAAyBvwC,EAAMF,EAAOhC,GAC7C,IAAI+C,EAAMf,EAAMI,UACZX,EAAQsB,EAAItB,MAChB,IAAKA,EAAMtW,OAAOmU,YAAe,OAAO,EACxC,IAAItX,EAASyZ,EAAMsZ,aAAc4sB,GAAW3/C,EAAQ4/C,EAAQ5/C,GAAUyZ,EAAMtW,OAAOuT,QAAQysB,KACvFhpB,EAAMuwC,eAGV,OAAKF,EAASl9C,KAAKmM,EAAMtW,OAAOmQ,cAAiB6G,EAAIwwC,OAG9CT,EAAiBhwC,EAAMF,GAAO,WAMnC,IAAI4wC,EAAWzwC,EAAIwrC,WAAW,GAAIkF,EAAU1wC,EAAI2wC,UAAWC,EAAS5wC,EAAI6wC,YACpEC,EAAe9wC,EAAI+wC,eACvB/wC,EAAIwwC,OAAO,OAAQ3yC,EAAK,aACxB,IAAImzC,EAAY1xC,EAAMrB,MAAQ8B,EAAKkqB,QAAQgnB,YAAY3xC,EAAMzW,UAAYkX,EAAKqC,IAC1E8uC,GAAaF,EAAU1pD,SAAmC,GAA1B0Y,EAAI2wC,UAAUhgD,SAAgBqP,EAAI2wC,UAAY3wC,EAAI2wC,UAAUp9C,aAC3Fm9C,GAAW1wC,EAAI2wC,WAAaC,GAAU5wC,EAAI6wC,YAK/C,OAHA7wC,EAAImxC,kBACJnxC,EAAIkzB,SAASud,GACO,MAAhBK,IAAwB9wC,EAAI+wC,eAAiBD,GAC1CI,KAlBS,QAAPrzC,GAAwB,YAAPA,EAAoB2nC,EAAUC,EAsB5D,IAAI2L,EAAc,KACdC,EAAY,KACZC,GAAe,EACnB,SAAShxC,EAAeP,EAAMF,EAAOhC,GACnC,OAAIuzC,GAAevxC,GAASwxC,GAAaxzC,EAAcyzC,GACvDF,EAAcvxC,EAAOwxC,EAAYxzC,EAC1ByzC,EAAsB,MAAPzzC,GAAsB,QAAPA,EACjCqyC,EAAuBnwC,EAAMF,EAAOhC,GACpCyyC,EAAyBvwC,EAAMF,EAAOhC,IAmF5C,IAAI0zC,EAAY,EACZC,EAAc,EACdC,EAAgB,EAChBC,EAAa,EAIbC,EAAW,SAAkB3oD,EAAQjG,EAAUqf,EAAKyd,GACtDx+B,KAAK2H,OAASA,EACd3H,KAAK0B,SAAWA,EAChB1B,KAAK+gB,IAAMA,EAGXA,EAAI8oC,WAAa7pD,KAGjBA,KAAKw+B,WAAaA,EAClBx+B,KAAKuwD,MAAQL,GAGX1hB,EAAuB,CAAEgiB,eAAgB,GAAG7oB,KAAM,GAAGqmB,OAAQ,GAAGZ,UAAW,GAAGW,WAAY,GAAGV,SAAU,GAAGoD,SAAU,GAAGC,YAAa,IAIxIJ,EAASx9C,UAAU69C,cAAgB,WAA4B,OAAO,GACtEL,EAASx9C,UAAU89C,YAAc,WAA0B,OAAO,GAClEN,EAASx9C,UAAU+9C,YAAc,WAA0B,OAAO,GAClEP,EAASx9C,UAAUg+C,YAAc,WAA0B,OAAO,GAElEtiB,EAAqBgiB,eAAensC,IAAM,WAAc,OAAO,GAM/DisC,EAASx9C,UAAUi+C,UAAY,WAAwB,OAAO,MAK9DT,EAASx9C,UAAUgtB,UAAY,WAAwB,OAAO,GAG9D0O,EAAqB7G,KAAKtjB,IAAM,WAI9B,IAHE,IAAI9D,EAASvgB,KAEX2nC,EAAO,EACFv9B,EAAI,EAAGA,EAAIpK,KAAK0B,SAASE,OAAQwI,IAAOu9B,GAAQpnB,EAAO7e,SAAS0I,GAAGu9B,KAC5E,OAAOA,GAKT6G,EAAqBwf,OAAO3pC,IAAM,WAAc,OAAO,GAEvDisC,EAASx9C,UAAUkO,QAAU,WACzB,IAAIT,EAASvgB,KAEfA,KAAK2H,OAAS,KACV3H,KAAK+gB,IAAI8oC,YAAc7pD,OAAQA,KAAK+gB,IAAI8oC,WAAa,MACzD,IAAK,IAAIz/C,EAAI,EAAGA,EAAIpK,KAAK0B,SAASE,OAAQwI,IACtCmW,EAAO7e,SAAS0I,GAAG4W,WAGzBsvC,EAASx9C,UAAUk+C,eAAiB,SAAyBxuD,GAG3D,IAFE,IAAI+d,EAASvgB,KAENoK,EAAI,EAAGoR,EAAMxb,KAAK+tD,WAAY3jD,EAAIpK,KAAK0B,SAASE,OAAQwI,IAAK,CACpE,IAAIulC,EAAMpvB,EAAO7e,SAAS0I,GAC1B,GAAIulC,GAAOntC,EAAS,OAAOgZ,EAC3BA,GAAOm0B,EAAIhI,OAIf6G,EAAqB4e,UAAU/oC,IAAM,WACnC,OAAOrkB,KAAK2H,OAAOqpD,eAAehxD,OAGpCwuC,EAAqBuf,WAAW1pC,IAAM,WACpC,OAAOrkB,KAAK2H,OAAS3H,KAAK2H,OAAOqpD,eAAehxD,MAAQA,KAAKguD,OAAS,GAGxExf,EAAqB6e,SAAShpC,IAAM,WAClC,OAAOrkB,KAAKotD,UAAYptD,KAAK2nC,MAG/B6G,EAAqBiiB,SAASpsC,IAAM,WAClC,OAAOrkB,KAAK+tD,WAAa/tD,KAAK2nC,KAAO,EAAI3nC,KAAKguD,QAIhDsC,EAASx9C,UAAUm+C,gBAAkB,SAA0BlwC,EAAKvc,EAAQslC,GACxE,IA8BEsa,EA9BE7jC,EAASvgB,KAIf,GAAIA,KAAKw+B,YAAcx+B,KAAKw+B,WAAWv4B,SAAyB,GAAhB8a,EAAIzR,SAAgByR,EAAMA,EAAI7O,YAAa,CACzF,GAAI43B,EAAO,EAAG,CACZ,IAAIonB,EAAWtK,EACf,GAAI7lC,GAAO/gB,KAAKw+B,WACd0yB,EAAYnwC,EAAIqpB,WAAW5lC,EAAS,OAC/B,CACL,MAAOuc,EAAI7O,YAAclS,KAAKw+B,WAAczd,EAAMA,EAAI7O,WACtDg/C,EAAYnwC,EAAIm/B,gBAElB,MAAOgR,MAAgBtK,EAAOsK,EAAUrH,aAAejD,EAAKj/C,QAAU3H,MAASkxD,EAAYA,EAAUhR,gBACrG,OAAOgR,EAAYlxD,KAAKgxD,eAAepK,GAAQA,EAAKjf,KAAO3nC,KAAK+tD,WAEhE,IAAIoD,EAAUC,EACd,GAAIrwC,GAAO/gB,KAAKw+B,WACd2yB,EAAWpwC,EAAIqpB,WAAW5lC,OACrB,CACL,MAAOuc,EAAI7O,YAAclS,KAAKw+B,WAAczd,EAAMA,EAAI7O,WACtDi/C,EAAWpwC,EAAI1R,YAEjB,MAAO8hD,MAAeC,EAASD,EAAStH,aAAeuH,EAAOzpD,QAAU3H,MAASmxD,EAAWA,EAAS9hD,YACrG,OAAO8hD,EAAWnxD,KAAKgxD,eAAeI,GAAUpxD,KAAKywD,SAOzD,GAAIzwD,KAAKw+B,YAAcx+B,KAAKw+B,YAAcx+B,KAAK+gB,KAAO/gB,KAAK+gB,IAAI9a,SAASjG,KAAKw+B,YAC3E4lB,EAAuD,EAA/CrjC,EAAI8gC,wBAAwB7hD,KAAKw+B,iBACpC,GAAIx+B,KAAK+gB,IAAI3R,WAAY,CAC9B,GAAc,GAAV5K,EAAe,IAAK,IAAI2xC,EAASp1B,GAAMo1B,EAASA,EAAOjkC,WAAY,CACrE,GAAIikC,GAAU51B,EAAOQ,IAAK,CAAEqjC,GAAQ,EAAO,MAC3C,GAAIjO,EAAOjkC,WAAW9C,YAAc+mC,EAAU,MAEhD,GAAa,MAATiO,GAAiB5/C,GAAUuc,EAAIqpB,WAAWxoC,OAAU,IAAK,IAAIyvD,EAAWtwC,GAAMswC,EAAWA,EAASn/C,WAAY,CAChH,GAAIm/C,GAAY9wC,EAAOQ,IAAK,CAAEqjC,GAAQ,EAAM,MAC5C,GAAIiN,EAASn/C,WAAW+K,WAAao0C,EAAY,OAGrD,OAAiB,MAATjN,EAAgBta,EAAO,EAAIsa,GAASpkD,KAAKywD,SAAWzwD,KAAK+tD,YAKnEuC,EAASx9C,UAAUq6C,YAAc,SAAsBpsC,EAAKuwC,GAG1D,IAFE,IAAI/wC,EAASvgB,KAENw1B,GAAQ,EAAMma,EAAM5uB,EAAK4uB,EAAKA,EAAMA,EAAIz9B,WAAY,CAC3D,IAAI00C,EAAOrmC,EAAOgxC,QAAQ5hB,GAC1B,GAAIiX,KAAU0K,GAAa1K,EAAKhmD,MAAO,CAErC,IAAI40B,IAASoxB,EAAKjlC,UAAsC,GAAzBilC,EAAKjlC,QAAQrS,SAAgBs3C,EAAKjlC,QAAQ1b,SAAS8a,GAAO6lC,EAAKjlC,SAAWZ,GAClG,OAAO6lC,EADmGpxB,GAAQ,KAM/H86B,EAASx9C,UAAUy+C,QAAU,SAAkBxwC,GAI7C,IAHE,IAAIR,EAASvgB,KAEX4mD,EAAO7lC,EAAI8oC,WACNla,EAAMiX,EAAMjX,EAAKA,EAAMA,EAAIhoC,OAAU,GAAIgoC,GAAOpvB,EAAU,OAAOqmC,GAG5E0J,EAASx9C,UAAUk6C,WAAa,SAAqBjsC,EAAKvc,EAAQslC,GAGhE,IAFE,IAAIvpB,EAASvgB,KAEN42C,EAAO71B,GAAM61B,EAAOA,EAAK1kC,WAAY,CAC5C,IAAI00C,EAAOrmC,EAAOgxC,QAAQ3a,GAC1B,GAAIgQ,EAAQ,OAAOA,EAAKqK,gBAAgBlwC,EAAKvc,EAAQslC,KAOzDwmB,EAASx9C,UAAU0+C,OAAS,SAAiBh2C,GAG3C,IAFE,IAAI+E,EAASvgB,KAENoK,EAAI,EAAG5F,EAAS,EAAG4F,EAAIpK,KAAK0B,SAASE,OAAQwI,IAAK,CACzD,IAAI5H,EAAQ+d,EAAO7e,SAAS0I,GAAI3E,EAAMjB,EAAShC,EAAMmlC,KACrD,GAAInjC,GAAUgX,GAAO/V,GAAOjB,EAAQ,CAClC,OAAQhC,EAAMwrD,QAAUxrD,EAAMd,SAASE,OAAUY,EAAQA,EAAMd,SAAS,GACxE,OAAOc,EAET,GAAIgZ,EAAM/V,EAAO,OAAOjD,EAAMgvD,OAAOh2C,EAAMhX,EAAShC,EAAMwrD,QAC1DxpD,EAASiB,IAKb6qD,EAASx9C,UAAUq3B,WAAa,SAAqB3uB,GACjD,IAAI+E,EAASvgB,KAEf,IAAKA,KAAKw+B,WAAc,MAAO,CAAC59B,KAAMZ,KAAK+gB,IAAKvc,OAAQ,GACxD,IAAK,IAAIA,EAAS,EAAG4F,EAAI,GAAIA,IAAK,CAChC,GAAI5F,GAAUgX,EAAK,CACjB,MAAOpR,EAAIpK,KAAK0B,SAASE,SAAW5B,KAAK0B,SAAS0I,GAAGomD,gBAAkBxwD,KAAK0B,SAAS0I,GAAG2W,IAAI7O,YAAclS,KAAKw+B,YAAep0B,IAC9H,MAAO,CAACxJ,KAAM2f,EAAOie,WACbh6B,OAAQ4F,GAAKmW,EAAO7e,SAASE,OAAS2e,EAAOie,WAAW4L,WAAWxoC,OAASunD,EAAS5oC,EAAO7e,SAAS0I,GAAG2W,MAElH,GAAI3W,GAAKmW,EAAO7e,SAASE,OAAU,MAAM,IAAIvE,MAAM,oBAAsBme,GACzE,IAAIhZ,EAAQ+d,EAAO7e,SAAS0I,GAAI3E,EAAMjB,EAAShC,EAAMmlC,KACrD,GAAInsB,EAAM/V,EAAO,OAAOjD,EAAM2nC,WAAW3uB,EAAMhX,EAAShC,EAAMwrD,QAC9DxpD,EAASiB,IAMb6qD,EAASx9C,UAAU2+C,WAAa,SAAqB5rC,EAAMC,EAAI8G,GAC3D,IAAIrM,EAASvgB,KAGf,QAFgB,IAAT4sB,IAAkBA,EAAO,GAEJ,GAAxB5sB,KAAK0B,SAASE,OACd,MAAO,CAAChB,KAAMZ,KAAKw+B,WAAY3Y,KAAMA,EAAMC,GAAIA,EAAI4rC,WAAY,EAAGC,SAAU3xD,KAAKw+B,WAAW4L,WAAWxoC,QAG3G,IADA,IAAI8vD,GAAc,EAAGC,GAAY,EACxBntD,EAASooB,EAAMxiB,EAAI,GAAIA,IAAK,CACnC,IAAI5H,EAAQ+d,EAAO7e,SAAS0I,GAAI3E,EAAMjB,EAAShC,EAAMmlC,KACrD,IAAmB,GAAf+pB,GAAoB7rC,GAAQpgB,EAAK,CACnC,IAAImsD,EAAYptD,EAAShC,EAAMwrD,OAE/B,GAAInoC,GAAQ+rC,GAAa9rC,GAAMrgB,EAAMjD,EAAMwrD,QAAUxrD,EAAM5B,MACvD4B,EAAMg8B,YAAcje,EAAOie,WAAWv4B,SAASzD,EAAMg8B,YACrD,OAAOh8B,EAAMivD,WAAW5rC,EAAMC,EAAI8rC,GAEtC/rC,EAAOrhB,EACP,IAAK,IAAIspC,EAAI1jC,EAAG0jC,EAAI,EAAGA,IAAK,CAC1B,IAAIkZ,EAAOzmC,EAAO7e,SAASosC,EAAI,GAC/B,GAAIkZ,EAAKrf,MAAQqf,EAAKjmC,IAAI7O,YAAcqO,EAAOie,aAAewoB,EAAK6K,aAAa,GAAI,CAClFH,EAAavI,EAASnC,EAAKjmC,KAAO,EAClC,MAEF8E,GAAQmhC,EAAKrf,MAEI,GAAf+pB,IAAoBA,EAAa,GAEvC,GAAIA,GAAc,GAAK5rC,GAAMrgB,EAAK,CAChCqgB,EAAKrgB,EACL,IAAK,IAAIqsD,EAAM1nD,EAAI,EAAG0nD,EAAM9xD,KAAK0B,SAASE,OAAQkwD,IAAO,CACvD,IAAIp1C,EAAO6D,EAAO7e,SAASowD,GAC3B,GAAIp1C,EAAKirB,MAAQjrB,EAAKqE,IAAI7O,YAAcqO,EAAOie,aAAe9hB,EAAKm1C,cAAc,GAAI,CACnFF,EAAWxI,EAASzsC,EAAKqE,KACzB,MAEF+E,GAAMpJ,EAAKirB,MAEI,GAAbgqB,IAAkBA,EAAWpxC,EAAOie,WAAW4L,WAAWxoC,QAC9D,MAEF4C,EAASiB,EAEX,MAAO,CAAC7E,KAAMZ,KAAKw+B,WAAY3Y,KAAMA,EAAMC,GAAIA,EAAI4rC,WAAYA,EAAYC,SAAUA,IAGvFrB,EAASx9C,UAAU++C,aAAe,SAAuB5nB,GACvD,GAAIjqC,KAAKguD,SAAWhuD,KAAKw+B,aAAex+B,KAAK0B,SAASE,OAAU,OAAO,EACvE,IAAIY,EAAQxC,KAAK0B,SAASuoC,EAAO,EAAI,EAAIjqC,KAAK0B,SAASE,OAAS,GAChE,OAAqB,GAAdY,EAAMmlC,MAAanlC,EAAMqvD,aAAa5nB,IAI/CqmB,EAASx9C,UAAU88C,YAAc,SAAsBp0C,GACrD,IAAI+D,EAAMvf,KAAKmqC,WAAW3uB,GACpB5a,EAAO2e,EAAI3e,KACX4D,EAAS+a,EAAI/a,OACnB,GAAqB,GAAjB5D,EAAK0O,UAAiB9K,GAAU5D,EAAKwpC,WAAWxoC,OAChD,MAAM,IAAI1D,WAAW,qBAAuBsd,GAChD,OAAO5a,EAAKwpC,WAAW5lC,IASzB8rD,EAASx9C,UAAUsM,aAAe,SAAuBvD,EAAQd,EAAM/X,EAAM+uD,GAK3E,IAJE,IAAIxxC,EAASvgB,KAGX6lB,EAAO9P,KAAK8Q,IAAIhL,EAAQd,GAAO+K,EAAK/P,KAAK0Q,IAAI5K,EAAQd,GAChD3Q,EAAI,EAAG5F,EAAS,EAAG4F,EAAIpK,KAAK0B,SAASE,OAAQwI,IAAK,CACzD,IAAI5H,EAAQ+d,EAAO7e,SAAS0I,GAAI3E,EAAMjB,EAAShC,EAAMmlC,KACrD,GAAI9hB,EAAOrhB,GAAUshB,EAAKrgB,EACtB,OAAOjD,EAAM4c,aAAavD,EAASrX,EAAShC,EAAMwrD,OAAQjzC,EAAOvW,EAAShC,EAAMwrD,OAAQhrD,EAAM+uD,GAClGvtD,EAASiB,EAGX,IAAIusD,EAAYhyD,KAAKmqC,WAAWtuB,GAASo2C,EAAUjyD,KAAKmqC,WAAWpvB,GAC/DgvC,EAAS/mD,EAAKksD,eAAgBjxD,EAAQ8Q,SAAS26B,cACnD,GAAKqoB,IACD1I,EAAqB2I,EAAUpxD,KAAMoxD,EAAUxtD,OAAQulD,EAAOmI,WAAYnI,EAAOoI,gBACjF9I,EAAqB4I,EAAQrxD,KAAMqxD,EAAQztD,OAAQulD,EAAOuF,UAAWvF,EAAOyF,aAFhF,CAQA,GAAIzF,EAAOnrB,OACT3gC,EAAM0rC,OAAOqoB,EAAUpxD,KAAMoxD,EAAUxtD,QACvCvG,EAAMm0D,UAAS,OACV,CACL,GAAIv2C,EAASd,EAAM,CAAE,IAAImY,EAAM8+B,EAAWA,EAAYC,EAASA,EAAU/+B,EACzEj1B,EAAM0rC,OAAOsoB,EAAQrxD,KAAMqxD,EAAQztD,QACnCvG,EAAM2rC,SAASooB,EAAUpxD,KAAMoxD,EAAUxtD,QAE3CulD,EAAO+F,kBACP/F,EAAOlY,SAAS5zC,GACZ8rD,EAAOnrB,QACPmrB,EAAOnrB,OAAOqzB,EAAQrxD,KAAMqxD,EAAQztD,UAI1C8rD,EAASx9C,UAAUu/C,eAAiB,SAAyBC,GAC3D,OAAQtyD,KAAKw+B,YAGfgQ,EAAqBkiB,YAAYrsC,IAAM,WACrC,OAAOrkB,KAAKw+B,YAAcx+B,KAAKw+B,YAAcx+B,KAAK+gB,MAAQ/gB,KAAK+gB,IAAI9a,SAASjG,KAAKw+B,aAKnF8xB,EAASx9C,UAAUy/C,UAAY,SAAoB1sC,EAAMC,GAGvD,IAFE,IAAIvF,EAASvgB,KAENwE,EAAS,EAAG4F,EAAI,EAAGA,EAAIpK,KAAK0B,SAASE,OAAQwI,IAAK,CACzD,IAAI5H,EAAQ+d,EAAO7e,SAAS0I,GAAI3E,EAAMjB,EAAShC,EAAMmlC,KACrD,GAAInjC,GAAUiB,EAAMogB,GAAQpgB,GAAOqgB,GAAMthB,EAASqhB,EAAOpgB,GAAOqgB,EAAKthB,EAAQ,CAC3E,IAAIguD,EAAchuD,EAAShC,EAAMwrD,OAAQyE,EAAYhtD,EAAMjD,EAAMwrD,OACjE,GAAInoC,GAAQ2sC,GAAe1sC,GAAM2sC,EAK/B,OAJAlyC,EAAOgwC,MAAQ1qC,GAAQrhB,GAAUshB,GAAMrgB,EAAM2qD,EAAgBD,OACzDtqC,GAAQ2sC,GAAe1sC,GAAM2sC,IAC5BjwD,EAAMkuD,aAAeluD,EAAMue,IAAI7O,YAAcqO,EAAOie,WAClDh8B,EAAM+vD,UAAU1sC,EAAO2sC,EAAa1sC,EAAK0sC,GADwBhwD,EAAM+tD,MAAQF,GAItF7tD,EAAM+tD,MAAQF,EAGlB7rD,EAASiB,EAEXzF,KAAKuwD,MAAQH,GAGfE,EAASx9C,UAAU4/C,iBAAmB,WAEpC,IADA,IAAIr8B,EAAQ,EACHz1B,EAAOZ,KAAK2H,OAAQ/G,EAAMA,EAAOA,EAAK+G,OAAQ,CACrD,IAAI4oD,EAAiB,GAATl6B,EAAa+5B,EAAgBD,EACrCvvD,EAAK2vD,MAAQA,IAAS3vD,EAAK2vD,MAAQA,KAI3CpxD,OAAOo9B,iBAAkB+zB,EAASx9C,UAAW07B,GAI7C,IAAImkB,EAAU,GAIVC,GAAkB,SAAUtC,GAC9B,SAASsC,EAAejrD,EAAQuY,EAAQxB,EAAMlD,GAC5C,IAAI0hB,EAAMnc,EAAMb,EAAO3hB,KAAKwlC,MAK5B,GAJkB,mBAAPhjB,IAAqBA,EAAMA,EAAIrC,GAAM,WAC9C,OAAKwe,EACDA,EAAKv1B,OAAiBu1B,EAAKv1B,OAAOqpD,eAAe9zB,QAArD,EADoB1hB,OAGjB0E,EAAO3hB,KAAK2d,KAAK22C,IAAK,CACzB,GAAoB,GAAhB9xC,EAAIzR,SAAe,CACrB,IAAImvC,EAAO1vC,SAASZ,cAAc,QAClCswC,EAAKt8B,YAAYpB,GACjBA,EAAM09B,EAER19B,EAAI6oC,iBAAkB,EACtB7oC,EAAItJ,UAAUvY,IAAI,sBAEpBoxD,EAASvgD,KAAK/P,KAAM2H,EAAQgrD,EAAS5xC,EAAK,MAC1C/gB,KAAKkgB,OAASA,EACdgd,EAAOl9B,KAGJswD,IAAWsC,EAAevrD,UAAYipD,GAC3CsC,EAAe9/C,UAAY3T,OAAO/B,OAAQkzD,GAAYA,EAASx9C,WAC/D8/C,EAAe9/C,UAAU1Q,YAAcwwD,EAEvC,IAAIpkB,EAAuB,CAAEgiB,eAAgB,IAmB7C,OAjBAhiB,EAAqBgiB,eAAensC,IAAM,WACxC,OAAOrkB,KAAKkgB,OAAO3hB,KAAK0rC,KAAO,GAGjC2oB,EAAe9/C,UAAU69C,cAAgB,SAAwBzwC,GAC/D,OAAOlgB,KAAKuwD,OAASL,GAAahwC,EAAO3hB,KAAK8c,GAAGrb,KAAKkgB,OAAO3hB,OAG/Dq0D,EAAe9/C,UAAUi+C,UAAY,WAAwB,MAAO,CAACxX,QAAQ,IAE7EqZ,EAAe9/C,UAAUgtB,UAAY,SAAoBtwB,GACvD,IAAIsjD,EAAO9yD,KAAKkgB,OAAOhE,KAAK4jB,UAC5B,QAAOgzB,GAAOA,EAAKtjD,IAGrBrQ,OAAOo9B,iBAAkBq2B,EAAe9/C,UAAW07B,GAE5CokB,EA5CY,CA6CnBtC,GAEEyC,GAAuB,SAAUzC,GACnC,SAASyC,EAAoBprD,EAAQoZ,EAAKiyC,EAAS5xD,GACjDkvD,EAASvgD,KAAK/P,KAAM2H,EAAQgrD,EAAS5xC,EAAK,MAC1C/gB,KAAKgzD,QAAUA,EACfhzD,KAAKoB,KAAOA,EAGTkvD,IAAWyC,EAAoB1rD,UAAYipD,GAChDyC,EAAoBjgD,UAAY3T,OAAO/B,OAAQkzD,GAAYA,EAASx9C,WACpEigD,EAAoBjgD,UAAU1Q,YAAc2wD,EAE5C,IAAIviB,EAAuB,CAAE7I,KAAM,IAmBnC,OAjBA6I,EAAqB7I,KAAKtjB,IAAM,WAAc,OAAOrkB,KAAKoB,KAAKQ,QAE/DmxD,EAAoBjgD,UAAUm+C,gBAAkB,SAA0BlwC,EAAKvc,GAC7E,OAAIuc,GAAO/gB,KAAKgzD,QAAkBhzD,KAAK+tD,YAAcvpD,EAASxE,KAAK2nC,KAAO,GACnE3nC,KAAK+tD,WAAavpD,GAG3BuuD,EAAoBjgD,UAAUq3B,WAAa,SAAqB3uB,GAC9D,MAAO,CAAC5a,KAAMZ,KAAKgzD,QAASxuD,OAAQgX,IAGtCu3C,EAAoBjgD,UAAUu/C,eAAiB,SAAyBY,GACtE,MAAoB,kBAAbA,EAAI10D,MAA4B00D,EAAIjwC,OAAOzT,WAAa0jD,EAAIC,UAGrE/zD,OAAOo9B,iBAAkBw2B,EAAoBjgD,UAAW09B,GAEjDuiB,EA9BiB,CA+BxBzC,GAOE6C,GAAgB,SAAU7C,GAC5B,SAAS6C,EAAaxrD,EAAQwvB,EAAMpW,EAAKyd,GACvC8xB,EAASvgD,KAAK/P,KAAM2H,EAAQ,GAAIoZ,EAAKyd,GACrCx+B,KAAKm3B,KAAOA,EAwCd,OArCKm5B,IAAW6C,EAAa9rD,UAAYipD,GACzC6C,EAAargD,UAAY3T,OAAO/B,OAAQkzD,GAAYA,EAASx9C,WAC7DqgD,EAAargD,UAAU1Q,YAAc+wD,EAErCA,EAAa/1D,OAAS,SAAiBuK,EAAQwvB,EAAM0f,EAAQn4B,GAC3D,IAAI00C,EAAS10C,EAAK0oB,UAAUjQ,EAAK54B,KAAKd,MAClCye,EAAOk3C,GAAUA,EAAOj8B,EAAMzY,EAAMm4B,GAGxC,OAFK36B,GAASA,EAAK6E,MACf7E,EAAO1B,EAAiB6nC,cAAcS,WAAW/zC,SAAUooB,EAAK54B,KAAK2d,KAAK6nB,MAAM5M,EAAM0f,KACnF,IAAIsc,EAAaxrD,EAAQwvB,EAAMjb,EAAK6E,IAAK7E,EAAKsiB,YAActiB,EAAK6E,MAG1EoyC,EAAargD,UAAUi+C,UAAY,WAAwB,MAAO,CAAC55B,KAAMn3B,KAAKm3B,KAAK54B,KAAKd,KAAMo3B,MAAO70B,KAAKm3B,KAAKtC,MAAOmsB,eAAgBhhD,KAAKw+B,aAE3I20B,EAAargD,UAAU89C,YAAc,SAAsBz5B,GAAQ,OAAOn3B,KAAKuwD,OAASF,GAAcrwD,KAAKm3B,KAAK9b,GAAG8b,IAEnHg8B,EAAargD,UAAUy/C,UAAY,SAAoB1sC,EAAMC,GAG3D,GAFAwqC,EAASx9C,UAAUy/C,UAAUxiD,KAAK/P,KAAM6lB,EAAMC,GAE1C9lB,KAAKuwD,OAASL,EAAW,CAC3B,IAAIvoD,EAAS3H,KAAK2H,OAClB,OAAQA,EAAO/G,KAAQ+G,EAASA,EAAOA,OACnCA,EAAO4oD,MAAQvwD,KAAKuwD,QAAS5oD,EAAO4oD,MAAQvwD,KAAKuwD,OACrDvwD,KAAKuwD,MAAQL,IAIjBiD,EAAargD,UAAUhI,MAAQ,SAAgB+a,EAAMC,EAAIpH,GACvD,IAAI2T,EAAO8gC,EAAa/1D,OAAO4C,KAAK2H,OAAQ3H,KAAKm3B,MAAM,EAAMzY,GACzD8a,EAAQx5B,KAAK0B,SAAUimC,EAAO3nC,KAAK2nC,KACnC7hB,EAAK6hB,IAAQnO,EAAQ65B,GAAa75B,EAAO1T,EAAI6hB,EAAMjpB,IACnDmH,EAAO,IAAK2T,EAAQ65B,GAAa75B,EAAO,EAAG3T,EAAMnH,IACrD,IAAK,IAAItU,EAAI,EAAGA,EAAIovB,EAAM53B,OAAQwI,IAAOovB,EAAMpvB,GAAGzC,OAAS0qB,EAE3D,OADAA,EAAK3wB,SAAW83B,EACTnH,GAGF8gC,EA3CU,CA4CjB7C,GAKEgD,GAAgB,SAAUhD,GAC5B,SAASgD,EAAa3rD,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKyd,EAAY7c,EAASjD,EAAMlD,GACxF80C,EAASvgD,KAAK/P,KAAM2H,EAAQ/G,EAAKouC,OAAS2jB,EAAU,GAAI5xC,EAAKyd,GAC7Dx+B,KAAK2hB,QAAUA,EACf3hB,KAAKY,KAAOA,EACZZ,KAAKuzD,UAAYA,EACjBvzD,KAAKwzD,UAAYA,EACbh1B,GAAcx+B,KAAKyzD,eAAe/0C,EAAMlD,GAGzC80C,IAAWgD,EAAajsD,UAAYipD,GACzCgD,EAAaxgD,UAAY3T,OAAO/B,OAAQkzD,GAAYA,EAASx9C,WAC7DwgD,EAAaxgD,UAAU1Q,YAAckxD,EAErC,IAAI5gB,EAAuB,CAAE/K,KAAM,GAAGqmB,OAAQ,IAiN9C,OAtMAsF,EAAal2D,OAAS,SAAiBuK,EAAQ/G,EAAM2yD,EAAWC,EAAW90C,EAAMlD,GAC/E,IAA6Ck4C,EAAzCN,EAAS10C,EAAK0oB,UAAUxmC,EAAKrC,KAAKd,MAClCye,EAAOk3C,GAAUA,EAAOxyD,EAAM8d,GAAM,WAGtC,OAAKg1C,EACDA,EAAQ/rD,OAAiB+rD,EAAQ/rD,OAAOqpD,eAAe0C,QAA3D,EADuBl4C,IAEtB+3C,GAECxyC,EAAM7E,GAAQA,EAAK6E,IAAKyd,EAAatiB,GAAQA,EAAKsiB,WACtD,GAAI59B,EAAK64B,OACP,GAAK1Y,GACA,GAAoB,GAAhBA,EAAIzR,SAAiB,MAAM,IAAIpR,WAAW,iDADvC6iB,EAAMhS,SAAS6xC,eAAehgD,EAAKQ,WAE1C,IAAK2f,EAAK,CACf,IAAI7Z,EACFA,EAASsT,EAAiB6nC,cAAcS,WAAW/zC,SAAUnO,EAAKrC,KAAK2d,KAAK6nB,MAAMnjC,IAAQmgB,EAAM7Z,EAAO6Z,IAAKyd,EAAat3B,EAAOs3B,WAE/HA,GAAe59B,EAAK64B,QAA0B,MAAhB1Y,EAAI7R,WAChC6R,EAAI0qB,aAAa,qBAAsB1qB,EAAI6oC,iBAAkB,GAC9DhpD,EAAKrC,KAAK2d,KAAK6jB,YAAahf,EAAIgf,WAAY,IAGlD,IAAIpe,EAAUZ,EAGd,OAFAA,EAAM4yC,GAAe5yC,EAAKwyC,EAAW3yD,GAEjCsb,EACOw3C,EAAU,IAAIE,GAAmBjsD,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKyd,EAAY7c,EACvDzF,EAAMwC,EAAMlD,EAAM,GACnD5a,EAAK64B,OACH,IAAIo6B,GAAalsD,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKY,EAASjD,GAEnE,IAAI40C,EAAa3rD,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKyd,EAAY7c,EAASjD,EAAMlD,EAAM,IAGxG83C,EAAaxgD,UAAUi+C,UAAY,WACjC,IAAIxwC,EAASvgB,KAGb,GAAIA,KAAKY,KAAKrC,KAAK2d,KAAK43C,cAAiB,OAAO,KAKhD,IAAItoD,EAAO,CAAC5K,KAAMZ,KAAKY,KAAKrC,KAAKd,KAAMo3B,MAAO70B,KAAKY,KAAKi0B,OAIxD,OAHI70B,KAAKY,KAAKrC,KAAK2d,KAAKpO,OAAQtC,EAAK6yC,mBAAqB,QACtDr+C,KAAKw+B,aAAex+B,KAAK0wD,YAAellD,EAAKw1C,eAAiBhhD,KAAKw+B,WAChEhzB,EAAKu1C,WAAa,WAAc,OAAOxgC,EAAOie,WAAahkB,EAAiB+zB,SAASnzB,MAAQmF,EAAO3f,KAAKsa,SACzG1P,GAGT8nD,EAAaxgD,UAAU+9C,YAAc,SAAsBjwD,EAAM2yD,EAAWC,GAC1E,OAAOxzD,KAAKuwD,OAASL,GAAatvD,EAAKya,GAAGrb,KAAKY,OAC7CmzD,GAAcR,EAAWvzD,KAAKuzD,YAAcC,EAAUn4C,GAAGrb,KAAKwzD,YAGlE9gB,EAAqB/K,KAAKtjB,IAAM,WAAc,OAAOrkB,KAAKY,KAAKghB,UAE/D8wB,EAAqBsb,OAAO3pC,IAAM,WAAc,OAAOrkB,KAAKY,KAAKouC,OAAS,EAAI,GAM9EskB,EAAaxgD,UAAU2gD,eAAiB,SAAyB/0C,EAAMlD,GACrE,IAAI+E,EAASvgB,KAET62C,EAAS72C,KAAKY,KAAK0c,cAAegsC,EAAM9tC,EACxCw4C,EAAcnd,GAAUn4B,EAAK0W,WAAap1B,KAAKi0D,qBAAqBv1C,EAAMlD,GAC1E04C,EAAU,IAAIC,GAAgBn0D,KAAMg0D,GAAeA,EAAYpzD,MACnEwzD,GAASp0D,KAAKY,KAAMZ,KAAKwzD,WAAW,SAAUtzC,EAAQ9V,GAChD8V,EAAOhE,KAAK+a,MACZi9B,EAAQG,YAAYn0C,EAAOhE,KAAK+a,MAAO4f,EAAQn4B,GAC1CwB,EAAO3hB,KAAK0rC,MAAQ,GACzBiqB,EAAQG,YAAYjqD,GAAKmW,EAAO3f,KAAKkc,WAAatC,EAAiB8oB,KAAKiN,KAAOhwB,EAAO3f,KAAK4B,MAAM4H,GAAG6sB,MAAO4f,EAAQn4B,GAGvHw1C,EAAQI,YAAYp0C,EAAQxB,EAAM4qC,MACjC,SAAU9mD,EAAO+wD,EAAWC,EAAWppD,GAExC8pD,EAAQG,YAAY7xD,EAAMy0B,MAAO4f,EAAQn4B,GAGzCw1C,EAAQK,cAAc/xD,EAAO+wD,EAAWC,EAAWppD,IAEjD8pD,EAAQM,eAAehyD,EAAO+wD,EAAWC,EAAW90C,EAAMtU,IAE1D8pD,EAAQtiB,QAAQpvC,EAAO+wD,EAAWC,EAAW90C,EAAM4qC,GACrDA,GAAO9mD,EAAMof,YAGfsyC,EAAQG,YAAY1B,EAAS9b,EAAQn4B,GACjC1e,KAAKY,KAAKkb,aAAeo4C,EAAQO,oBACrCP,EAAQQ,eAGJR,EAAQpxB,SAAW9iC,KAAKuwD,OAASH,KAE/B4D,GAAeh0D,KAAK20D,wBAAwBj2C,EAAMs1C,GACtDh0D,KAAK40D,mBAITtB,EAAaxgD,UAAU8hD,eAAiB,WACtCC,GAAY70D,KAAKw+B,WAAYx+B,KAAK0B,SAAU4xD,EAAawB,IACrDt0D,EAAOsoD,KAAOiM,GAAS/0D,KAAK+gB,MAGlCuyC,EAAaxgD,UAAUmhD,qBAAuB,SAA+Bv1C,EAAMlD,GAIjF,IAAI+D,EAAMb,EAAKF,MAAMI,UACjBiH,EAAOtG,EAAIsG,KACXC,EAAKvG,EAAIuG,GACb,OAAMpH,EAAKF,MAAMI,qBAAqBtE,EAAiB0E,gBAAkB6G,EAAOrK,GAAOsK,EAAKtK,EAAMxb,KAAKY,KAAKsa,QAAQysB,MAApH,CACA,IAAIhpB,EAAMD,EAAK1b,KAAKksD,eAChBpN,EAAWkT,GAAer2C,EAAI2wC,UAAW3wC,EAAI6wC,aACjD,GAAK1N,GAAa9hD,KAAK+gB,IAAI9a,SAAS67C,EAAS5vC,YAA7C,CAKA,IAAI9Q,EAAO0gD,EAASvyC,UAChB0lD,EAAUC,GAAmBl1D,KAAKY,KAAKsa,QAAS9Z,EAAMykB,EAAOrK,EAAKsK,EAAKtK,GAE3E,OAAOy5C,EAAU,EAAI,KAAO,CAACr0D,KAAMkhD,EAAUtmC,IAAKy5C,EAAS7zD,KAAMA,MAGnEkyD,EAAaxgD,UAAU6hD,wBAA0B,SAAkCj2C,EAAMa,GACvF,IAAIgB,EAASvgB,KACTY,EAAO2e,EAAI3e,KACX4a,EAAM+D,EAAI/D,IACVpa,EAAOme,EAAIne,KAGf,IAAIpB,KAAKuxD,QAAQ3wD,GAAjB,CAIA,IADA,IAAIyjC,EAAUzjC,GACNyjC,EAAUA,EAAQnyB,WAAY,CACpC,GAAImyB,EAAQnyB,YAAcqO,EAAOie,WAAc,MAC/C,MAAO6F,EAAQ6b,gBAAmB7b,EAAQnyB,WAAWoP,YAAY+iB,EAAQ6b,iBACzE,MAAO7b,EAAQh1B,YAAeg1B,EAAQnyB,WAAWoP,YAAY+iB,EAAQh1B,aACjEg1B,EAAQwlB,aAAcxlB,EAAQwlB,WAAa,MAEjD,IAAIjD,EAAO,IAAImM,GAAoB/yD,KAAMqkC,EAASzjC,EAAMQ,GACxDsd,EAAKy2C,iBAAiBrzD,KAAK8kD,GAG3B5mD,KAAK0B,SAAW2xD,GAAarzD,KAAK0B,SAAU8Z,EAAKA,EAAMpa,EAAKQ,OAAQ8c,EAAMkoC,KAM5E0M,EAAaxgD,UAAUoO,OAAS,SAAiBtgB,EAAM2yD,EAAWC,EAAW90C,GAC3E,QAAI1e,KAAKuwD,OAASF,IACbzvD,EAAKitC,WAAW7tC,KAAKY,SAC1BZ,KAAKo1D,YAAYx0D,EAAM2yD,EAAWC,EAAW90C,IACtC,IAGT40C,EAAaxgD,UAAUsiD,YAAc,SAAsBx0D,EAAM2yD,EAAWC,EAAW90C,GACrF1e,KAAKq1D,gBAAgB9B,GACrBvzD,KAAKY,KAAOA,EACZZ,KAAKwzD,UAAYA,EACbxzD,KAAKw+B,YAAcx+B,KAAKyzD,eAAe/0C,EAAM1e,KAAK+tD,YACtD/tD,KAAKuwD,MAAQL,GAGfoD,EAAaxgD,UAAUuiD,gBAAkB,SAA0B9B,GACjE,IAAIQ,GAAcR,EAAWvzD,KAAKuzD,WAAlC,CACA,IAAI+B,EAAqC,GAAzBt1D,KAAK2hB,QAAQrS,SACzBimD,EAASv1D,KAAK+gB,IAClB/gB,KAAK+gB,IAAMy0C,GAAex1D,KAAK+gB,IAAK/gB,KAAK2hB,QACf8zC,GAAiBz1D,KAAKuzD,UAAWvzD,KAAKY,KAAM00D,GAC5CG,GAAiBlC,EAAWvzD,KAAKY,KAAM00D,IAC7Dt1D,KAAK+gB,KAAOw0C,IACdA,EAAO1L,WAAa,KACpB7pD,KAAK+gB,IAAI8oC,WAAa7pD,MAExBA,KAAKuzD,UAAYA,IAInBD,EAAaxgD,UAAU4iD,WAAa,WAClC11D,KAAK2hB,QAAQlK,UAAUvY,IAAI,6BACvBc,KAAKw+B,YAAex+B,KAAKY,KAAKrC,KAAK2d,KAAK6jB,YAAa//B,KAAK+gB,IAAIgf,WAAY,IAIhFuzB,EAAaxgD,UAAU6iD,aAAe,WACpC31D,KAAK2hB,QAAQlK,UAAUm+C,OAAO,6BAC1B51D,KAAKw+B,YAAex+B,KAAKY,KAAKrC,KAAK2d,KAAK6jB,YAAa//B,KAAK+gB,IAAIgf,WAAY,IAGhF5gC,OAAOo9B,iBAAkB+2B,EAAaxgD,UAAW4/B,GAE1C4gB,EA/NU,CAgOjBhD,GAIF,SAASuF,GAAYj7C,EAAK24C,EAAWC,EAAWzyC,EAAKrC,GAEnD,OADAi1C,GAAe5yC,EAAKwyC,EAAW34C,GACxB,IAAI04C,GAAa,KAAM14C,EAAK24C,EAAWC,EAAWzyC,EAAKA,EAAKA,EAAKrC,EAAM,GAGhF,IAAIm1C,GAAgB,SAAUP,GAC5B,SAASO,EAAalsD,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKY,EAASjD,GACtE40C,EAAavjD,KAAK/P,KAAM2H,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAK,KAAMY,EAASjD,GA8ClF,OA3CK40C,IAAeO,EAAaxsD,UAAYisD,GAC7CO,EAAa/gD,UAAY3T,OAAO/B,OAAQk2D,GAAgBA,EAAaxgD,WACrE+gD,EAAa/gD,UAAU1Q,YAAcyxD,EAErCA,EAAa/gD,UAAUi+C,UAAY,WACjC,MAAO,CAACz8C,KAAMtU,KAAK2hB,QAAQzP,aAAc,IAG3C2hD,EAAa/gD,UAAUoO,OAAS,SAAiBtgB,EAAM2yD,GACrD,QAAIvzD,KAAKuwD,OAASF,GAAerwD,KAAKuwD,OAASL,IAAclwD,KAAK81D,aAC7Dl1D,EAAKitC,WAAW7tC,KAAKY,SAC1BZ,KAAKq1D,gBAAgB9B,GAChBvzD,KAAKuwD,OAASL,GAAatvD,EAAKQ,MAAQpB,KAAKY,KAAKQ,MAASR,EAAKQ,MAAQpB,KAAK2hB,QAAQpS,YACtFvP,KAAK2hB,QAAQpS,UAAY3O,EAAKQ,MAClCpB,KAAKY,KAAOA,EACZZ,KAAKuwD,MAAQL,GACN,IAGT2D,EAAa/gD,UAAUgjD,SAAW,WAEhC,IADA,IAAInG,EAAY3vD,KAAK2H,OAAO62B,WACnBza,EAAI/jB,KAAK2hB,QAASoC,EAAGA,EAAIA,EAAE7R,WAAc,GAAI6R,GAAK4rC,EAAa,OAAO,EAC/E,OAAO,GAGTkE,EAAa/gD,UAAUq3B,WAAa,SAAqB3uB,GACvD,MAAO,CAAC5a,KAAMZ,KAAK2hB,QAASnd,OAAQgX,IAGtCq4C,EAAa/gD,UAAUm+C,gBAAkB,SAA0BlwC,EAAKvc,EAAQslC,GAC9E,OAAI/oB,GAAO/gB,KAAK2hB,QAAkB3hB,KAAK+tD,WAAah4C,KAAK8Q,IAAIriB,EAAQxE,KAAKY,KAAKQ,KAAKQ,QAC7E0xD,EAAaxgD,UAAUm+C,gBAAgBlhD,KAAK/P,KAAM+gB,EAAKvc,EAAQslC,IAGxE+pB,EAAa/gD,UAAUu/C,eAAiB,SAAyBzyB,GAC/D,MAAwB,iBAAjBA,EAASrhC,MAA4C,aAAjBqhC,EAASrhC,MAGtDs1D,EAAa/gD,UAAUhI,MAAQ,SAAgB+a,EAAMC,EAAIpH,GACvD,IAAI9d,EAAOZ,KAAKY,KAAK84B,IAAI7T,EAAMC,GAAK/E,EAAMhS,SAAS6xC,eAAehgD,EAAKQ,MACvE,OAAO,IAAIyyD,EAAa7zD,KAAK2H,OAAQ/G,EAAMZ,KAAKuzD,UAAWvzD,KAAKwzD,UAAWzyC,EAAKA,EAAKrC,IAGhFm1C,EAhDU,CAiDjBP,IAIEyC,GAAkB,SAAUzF,GAC9B,SAASyF,IACPzF,EAAS3yD,MAAMqC,KAAMpC,WAUvB,OAPK0yD,IAAWyF,EAAe1uD,UAAYipD,GAC3CyF,EAAejjD,UAAY3T,OAAO/B,OAAQkzD,GAAYA,EAASx9C,WAC/DijD,EAAejjD,UAAU1Q,YAAc2zD,EAEvCA,EAAejjD,UAAUi+C,UAAY,WAAwB,MAAO,CAACxX,QAAQ,IAC7Ewc,EAAejjD,UAAUg+C,YAAc,WAA0B,OAAO9wD,KAAKuwD,OAASL,GAE/E6F,EAZY,CAanBzF,GAKEsD,GAAsB,SAAUN,GAClC,SAASM,EAAmBjsD,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKyd,EAAY7c,EAASzF,EAAMwC,EAAMlD,GACpG83C,EAAavjD,KAAK/P,KAAM2H,EAAQ/G,EAAM2yD,EAAWC,EAAWzyC,EAAKyd,EAAY7c,EAASjD,EAAMlD,GAC5Fxb,KAAKkc,KAAOA,EAiDd,OA9CKo3C,IAAeM,EAAmBvsD,UAAYisD,GACnDM,EAAmB9gD,UAAY3T,OAAO/B,OAAQk2D,GAAgBA,EAAaxgD,WAC3E8gD,EAAmB9gD,UAAU1Q,YAAcwxD,EAK3CA,EAAmB9gD,UAAUoO,OAAS,SAAiBtgB,EAAM2yD,EAAWC,EAAW90C,GACjF,GAAI1e,KAAKuwD,OAASF,EAAc,OAAO,EACvC,GAAIrwD,KAAKkc,KAAKgF,OAAQ,CACpB,IAAI2uC,EAAY7vD,KAAKkc,KAAKgF,OAAOtgB,EAAM2yD,GAEvC,OADI1D,GAAa7vD,KAAKo1D,YAAYx0D,EAAM2yD,EAAWC,EAAW90C,GACvDmxC,EACF,SAAK7vD,KAAKw+B,aAAe59B,EAAKouC,SAG5BskB,EAAaxgD,UAAUoO,OAAOnR,KAAK/P,KAAMY,EAAM2yD,EAAWC,EAAW90C,IAIhFk1C,EAAmB9gD,UAAU4iD,WAAa,WACxC11D,KAAKkc,KAAKw5C,WAAa11D,KAAKkc,KAAKw5C,aAAepC,EAAaxgD,UAAU4iD,WAAW3lD,KAAK/P,OAGzF4zD,EAAmB9gD,UAAU6iD,aAAe,WAC1C31D,KAAKkc,KAAKy5C,aAAe31D,KAAKkc,KAAKy5C,eAAiBrC,EAAaxgD,UAAU6iD,aAAa5lD,KAAK/P,OAG/F4zD,EAAmB9gD,UAAUsM,aAAe,SAAuBvD,EAAQd,EAAM/X,EAAM+uD,GACrF/xD,KAAKkc,KAAKkD,aAAepf,KAAKkc,KAAKkD,aAAavD,EAAQd,EAAM/X,GAC1DswD,EAAaxgD,UAAUsM,aAAarP,KAAK/P,KAAM6b,EAAQd,EAAM/X,EAAM+uD,IAGzE6B,EAAmB9gD,UAAUkO,QAAU,WACjChhB,KAAKkc,KAAK8E,SAAWhhB,KAAKkc,KAAK8E,UACnCsyC,EAAaxgD,UAAUkO,QAAQjR,KAAK/P,OAGtC4zD,EAAmB9gD,UAAUgtB,UAAY,SAAoBtwB,GAC3D,QAAOxP,KAAKkc,KAAK4jB,WAAY9/B,KAAKkc,KAAK4jB,UAAUtwB,IAGnDokD,EAAmB9gD,UAAUu/C,eAAiB,SAAyBzyB,GACrE,OAAO5/B,KAAKkc,KAAKm2C,eAAiBryD,KAAKkc,KAAKm2C,eAAezyB,GAAY0zB,EAAaxgD,UAAUu/C,eAAetiD,KAAK/P,KAAM4/B,IAGnHg0B,EApDgB,CAqDvBN,IAMF,SAASuB,GAAYlF,EAAWqG,GAE9B,IADA,IAAIj1C,EAAM4uC,EAAUvgD,WACXhF,EAAI,EAAGA,EAAI4rD,EAAMp0D,OAAQwI,IAAK,CACrC,IAAIw8C,EAAOoP,EAAM5rD,GAAI6rD,EAAWrP,EAAK7lC,IACrC,GAAIk1C,EAAS/jD,YAAcy9C,EAAW,CACpC,MAAOsG,GAAYl1C,EAAOA,EAAMm1C,GAAGn1C,GACnCA,EAAMA,EAAI1R,iBAEVsgD,EAAUtsB,aAAa4yB,EAAUl1C,GAEnC,GAAI6lC,aAAgBuM,GAAc,CAChC,IAAI33C,EAAMuF,EAAMA,EAAIm/B,gBAAkByP,EAAU1yC,UAChD43C,GAAYjO,EAAKpoB,WAAYooB,EAAKllD,UAClCqf,EAAMvF,EAAMA,EAAInM,YAAcsgD,EAAUvgD,YAG5C,MAAO2R,EAAOA,EAAMm1C,GAAGn1C,GAGzB,SAASo1C,GAAejnD,GAClBA,IAAYlP,KAAKkP,SAAWA,GAElCinD,GAAerjD,UAAY3T,OAAO/B,OAAO,MAEzC,IAAIg5D,GAAS,CAAC,IAAID,IAElB,SAASV,GAAiBlC,EAAW3yD,EAAM00D,GACzC,GAAwB,GAApB/B,EAAU3xD,OAAe,OAAOw0D,GAIpC,IAFA,IAAIv0D,EAAMyzD,EAAYc,GAAO,GAAK,IAAID,GAAgBtG,EAAY,CAAChuD,GAE1DuI,EAAI,EAAGA,EAAImpD,EAAU3xD,OAAQwI,IAAK,CACzC,IAAIyqB,EAAQ0+B,EAAUnpD,GAAG7L,KAAKs2B,MAAO8a,EAAM9tC,EAC3C,GAAKgzB,EAIL,IAAK,IAAIp3B,KAHLo3B,EAAM3lB,UACN2gD,EAAU/tD,KAAK6tC,EAAM,IAAIwmB,GAAethC,EAAM3lB,WAEjC2lB,EAAO,CACtB,IAAI+d,EAAM/d,EAAMp3B,GACL,MAAPm1C,IACA0iB,GAAiC,GAApBzF,EAAUjuD,QACvBiuD,EAAU/tD,KAAK6tC,EAAM9tC,EAAM,IAAIs0D,GAAev1D,EAAKmyC,SAAW,OAAS,QAC/D,SAARt1C,EAAmBkyC,EAAIvhC,OAASuhC,EAAIvhC,MAAQuhC,EAAIvhC,MAAQ,IAAM,IAAMwkC,EACvD,SAARn1C,EAAmBkyC,EAAIvtB,OAASutB,EAAIvtB,MAAQutB,EAAIvtB,MAAQ,IAAM,IAAMwwB,EAC5D,YAARn1C,IAAsBkyC,EAAIlyC,GAAQm1C,KAI/C,OAAOid,EAGT,SAAS2F,GAAea,EAAU10C,EAAS20C,EAAcC,GAEvD,GAAID,GAAgBF,IAAUG,GAAeH,GAAU,OAAOz0C,EAG9D,IADA,IAAI60C,EAAS70C,EACJvX,EAAI,EAAGA,EAAImsD,EAAY30D,OAAQwI,IAAK,CAC3C,IAAIqsD,EAAOF,EAAYnsD,GAAI48C,EAAOsP,EAAalsD,GAC/C,GAAIA,EAAG,CACL,IAAIzC,OAAS,EACTq/C,GAAQA,EAAK93C,UAAYunD,EAAKvnD,UAAYsnD,GAAUH,IACnD1uD,EAASga,EAAQzP,aAAevK,EAAO8kB,QAAQ3jB,eAAiB2tD,EAAKvnD,WAGxEvH,EAASoH,SAASZ,cAAcsoD,EAAKvnD,UACrCvH,EAAOwa,YAAYq0C,IAHnBA,EAAS7uD,EAOb+uD,GAAgBF,EAAQxP,GAAQoP,GAAO,GAAIK,GAE7C,OAAOD,EAGT,SAASE,GAAgB31C,EAAKimC,EAAMrX,GAClC,IAAK,IAAIlyC,KAAQupD,EACD,SAARvpD,GAA2B,SAARA,GAA2B,YAARA,GAAwBA,KAAQkyC,GACxE5uB,EAAI41C,gBAAgBl5D,GAC1B,IAAK,IAAIo+C,KAAUlM,EACD,SAAVkM,GAA+B,SAAVA,GAA+B,YAAVA,GAAwBlM,EAAIkM,IAAWmL,EAAKnL,IACxF96B,EAAImiC,aAAarH,EAAQlM,EAAIkM,IACnC,GAAImL,EAAK54C,OAASuhC,EAAIvhC,MAAO,CAG3B,IAFA,IAAIwoD,EAAW5P,EAAK54C,MAAQ44C,EAAK54C,MAAMxG,MAAM,KAAO+qD,EAChDkE,EAAUlnB,EAAIvhC,MAAQuhC,EAAIvhC,MAAMxG,MAAM,KAAO+qD,EACxCvoD,EAAI,EAAGA,EAAIwsD,EAASh1D,OAAQwI,KAA4C,GAAjCysD,EAAQh+B,QAAQ+9B,EAASxsD,KACrE2W,EAAItJ,UAAUm+C,OAAOgB,EAASxsD,IAClC,IAAK,IAAIkgB,EAAM,EAAGA,EAAMusC,EAAQj1D,OAAQ0oB,KAAgD,GAAnCssC,EAAS/9B,QAAQg+B,EAAQvsC,KAC1EvJ,EAAItJ,UAAUvY,IAAI23D,EAAQvsC,IAEhC,GAAI08B,EAAK5kC,OAASutB,EAAIvtB,MAAO,CAC3B,GAAI4kC,EAAK5kC,MAAO,CACd,IAA4Fzc,EAAxFpG,EAAO,gFACX,MAAOoG,EAAIpG,EAAKuE,KAAKkjD,EAAK5kC,OACtBrB,EAAIqB,MAAMzc,EAAE,GAAGmD,eAAiB,GAElC6mC,EAAIvtB,QACJrB,EAAIqB,MAAMC,SAAWstB,EAAIvtB,QAIjC,SAASuxC,GAAe5yC,EAAK01C,EAAM71D,GACjC,OAAO40D,GAAez0C,EAAKA,EAAKq1C,GAAQX,GAAiBgB,EAAM71D,EAAsB,GAAhBmgB,EAAIzR,WAI3E,SAASykD,GAAcl9C,EAAGC,GACxB,GAAID,EAAEjV,QAAUkV,EAAElV,OAAU,OAAO,EACnC,IAAK,IAAIwI,EAAI,EAAGA,EAAIyM,EAAEjV,OAAQwI,IAAO,IAAKyM,EAAEzM,GAAG7L,KAAK8c,GAAGvE,EAAE1M,GAAG7L,MAAS,OAAO,EAC5E,OAAO,EAIT,SAAS23D,GAAGn1C,GACV,IAAIrE,EAAOqE,EAAI1R,YAEf,OADA0R,EAAI7O,WAAWoP,YAAYP,GACpBrE,EAKT,IAAIy3C,GAAkB,SAAyBtyD,EAAKi1D,GAClD92D,KAAK6B,IAAMA,EACX7B,KAAK+2D,KAAOD,EAGZ92D,KAAKkE,MAAQ,EAGblE,KAAK2B,MAAQ,GAEb3B,KAAK8iC,SAAU,EAEf,IAAI2a,EAAMuZ,GAASn1D,EAAIjB,KAAKsa,QAASrZ,EAAIH,UACzC1B,KAAKi3D,WAAaxZ,EAAIjkB,MACtBx5B,KAAKk3D,eAAiBzZ,EAAIj5C,QA6J5B,SAASwyD,GAASnhB,EAAMmgB,GAEtB,IADA,IAAInG,EAAY,GAAIpqD,EAAMowC,EAAK/4B,WACtB1S,EAAI4rD,EAAMp0D,OAAS,EAAG6D,EAAM,GAAK2E,GAAK,EAAGA,IAAK,CACrD,IAAIw8C,EAAOoP,EAAM5rD,GAAIxJ,EAAOgmD,EAAKhmD,KACjC,GAAKA,EAAL,CACA,GAAIA,GAAQi1C,EAAKrzC,MAAMiD,EAAM,GAAM,MACnCoqD,EAAU/tD,KAAK8kD,KACbnhD,GAEJ,MAAO,CAAC+zB,MAAOq2B,EAAUz/C,UAAW5L,OAAQiB,GAG9C,SAAS0xD,GAAYtgD,EAAGC,GAAK,OAAOD,EAAEtY,KAAK0rC,KAAOnzB,EAAEvY,KAAK0rC,KAOzD,SAASmqB,GAASzsD,EAAQ8uD,EAAMW,EAAUC,GACxC,IAAIC,EAASb,EAAKa,OAAO3vD,GAASnD,EAAS,EAE3C,GAAqB,GAAjB8yD,EAAO11D,OAUX,IADA,IAAI21D,EAAY,EAAG9gB,EAAS,GAAI+gB,EAAW,KAClCC,EAAc,IAAK,CAC1B,GAAIF,EAAYD,EAAO11D,QAAU01D,EAAOC,GAAWzxC,IAAMthB,EAAQ,CAC/D,IAAI0b,EAASo3C,EAAOC,KAAcG,OAAU,EAC5C,MAAOH,EAAYD,EAAO11D,QAAU01D,EAAOC,GAAWzxC,IAAMthB,GACvDkzD,IAAYA,EAAU,CAACx3C,KAAUpe,KAAKw1D,EAAOC,MAClD,GAAIG,EAAS,CACXA,EAAQ9gD,KAAKugD,IACb,IAAK,IAAI7sC,EAAM,EAAGA,EAAMotC,EAAQ91D,OAAQ0oB,IAAS8sC,EAASM,EAAQptC,GAAMmtC,QAExEL,EAASl3C,EAAQu3C,GAIrB,IAAIE,OAAU,EAAUzzD,OAAQ,EAChC,GAAIszD,EACFtzD,GAAS,EACTyzD,EAAUH,EACVA,EAAW,SACN,MAAIC,EAAc9vD,EAAOmV,YAI9B,MAHA5Y,EAAQuzD,EACRE,EAAUhwD,EAAOnF,MAAMi1D,KAKzB,IAAK,IAAIltC,EAAM,EAAGA,EAAMksB,EAAO70C,OAAQ2oB,IAAaksB,EAAOlsB,GAAKzE,IAAMthB,GAAUiyC,EAAOlsC,OAAOggB,IAAO,GACrG,MAAOgtC,EAAYD,EAAO11D,QAAU01D,EAAOC,GAAW1xC,MAAQrhB,EAAUiyC,EAAO30C,KAAKw1D,EAAOC,MAE3F,IAAI9xD,EAAMjB,EAASmzD,EAAQ/1C,SAC3B,GAAI+1C,EAAQl+B,OAAQ,CAClB,IAAIm+B,EAAQnyD,EACR8xD,EAAYD,EAAO11D,QAAU01D,EAAOC,GAAW1xC,KAAO+xC,IAASA,EAAQN,EAAOC,GAAW1xC,MAC7F,IAAK,IAAIgyC,EAAM,EAAGA,EAAMphB,EAAO70C,OAAQi2D,IAAaphB,EAAOohB,GAAK/xC,GAAK8xC,IAASA,EAAQnhB,EAAOohB,GAAK/xC,IAC9F8xC,EAAQnyD,IACV+xD,EAAWG,EAAQj+B,IAAIk+B,EAAQpzD,GAC/BmzD,EAAUA,EAAQj+B,IAAI,EAAGk+B,EAAQpzD,GACjCiB,EAAMmyD,EACN1zD,GAAS,GAIbmzD,EAAOM,EAASlhB,EAAO70C,OAAS60C,EAAO3rC,QAAU6nD,EAAS8D,EAAKqB,SAAStzD,EAAQmzD,GAAUzzD,GAC1FM,EAASiB,OAnDT,IAAK,IAAI2E,EAAI,EAAGA,EAAIzC,EAAOmV,WAAY1S,IAAK,CAC1C,IAAI5H,EAAQmF,EAAOnF,MAAM4H,GACzBitD,EAAO70D,EAAO80D,EAAQb,EAAKqB,SAAStzD,EAAQhC,GAAQ4H,GACpD5F,GAAUhC,EAAMof,UAsDtB,SAASmzC,GAASh0C,GAChB,GAAoB,MAAhBA,EAAI7R,UAAoC,MAAhB6R,EAAI7R,SAAkB,CAChD,IAAI6oD,EAASh3C,EAAIqB,MAAMC,QACvBtB,EAAIqB,MAAMC,QAAU01C,EAAS,kCAC7Bl+C,OAAO2I,iBAAiBzB,GAAKi3C,UAC7Bj3C,EAAIqB,MAAMC,QAAU01C,GAIxB,SAAS/C,GAAep0D,EAAM4D,GAC5B,OAAS,CACP,GAAqB,GAAjB5D,EAAK0O,SAAiB,OAAO1O,EACjC,GAAqB,GAAjBA,EAAK0O,UAAiB9K,EAAS,EAAG,CACpC,GAAI5D,EAAKwpC,WAAWxoC,OAAS4C,GAA8C,GAApC5D,EAAKwpC,WAAW5lC,GAAQ8K,SAC3D,OAAO1O,EAAKwpC,WAAW5lC,GAC3B5D,EAAOA,EAAKwpC,WAAW5lC,EAAS,GAChCA,EAASod,EAAShhB,OACb,MAAqB,GAAjBA,EAAK0O,UAAiB9K,EAAS5D,EAAKwpC,WAAWxoC,QAIxD,OAAO,KAHPhB,EAAOA,EAAKwpC,WAAW5lC,GACvBA,EAAS,IAQf,SAAS0wD,GAAmBrf,EAAMz0C,EAAMykB,EAAMC,GAC5C,IAAK,IAAI+X,EAAM,GAAIzzB,EAAI,EAAG6tD,EAAW,EAAG7tD,EAAIyrC,EAAK/4B,WAAY1S,IAAK,CAChE,IAAI5H,EAAQqzC,EAAKrzC,MAAM4H,GAAI3E,EAAMwyD,EAAWz1D,EAAMof,SAClD,GAAIpf,EAAMi3B,QAER,GADAoE,GAAOr7B,EAAMpB,KACTqE,GAAOqgB,EAAI,CACb,IAAIoyC,EAAWzyD,EAAMo4B,EAAIj8B,OAAQ2tC,EAAQ1R,EAAI7E,YAAY53B,GACzD,MAAOmuC,GAAS,GAAK2oB,EAAW3oB,EAAQ1pB,EAAQ0pB,EAAQ1R,EAAI7E,YAAY53B,EAAMmuC,EAAQ,GACtF,GAAIA,GAAS,GAAK2oB,EAAW3oB,EAAQnuC,EAAKQ,QAAUkkB,EAClD,OAAOoyC,EAAW3oB,EACb,GAAI9pC,EAAMqgB,EACf,YAIJ+X,EAAM,GAERo6B,EAAWxyD,EAEb,OAAQ,EAQV,SAAS4tD,GAAa75B,EAAO3T,EAAMC,EAAIpH,EAAM01B,GAE3C,IADA,IAAIyb,EAAY,GACPzlD,EAAI,EAAGk/C,EAAM,EAAGl/C,EAAIovB,EAAM53B,OAAQwI,IAAK,CAC9C,IAAI5H,EAAQg3B,EAAMpvB,GAAIoc,EAAQ8iC,EAAK7jD,EAAM6jD,GAAO9mD,EAAMmlC,KAClDnhB,GAASV,GAAMrgB,GAAOogB,EACxBgqC,EAAU/tD,KAAKU,IAEXgkB,EAAQX,GAAQgqC,EAAU/tD,KAAKU,EAAMsI,MAAM,EAAG+a,EAAOW,EAAO9H,IAC5D01B,IACFyb,EAAU/tD,KAAKsyC,GACfA,EAAc,MAEZ3uC,EAAMqgB,GAAM+pC,EAAU/tD,KAAKU,EAAMsI,MAAMgb,EAAKU,EAAOhkB,EAAMmlC,KAAMjpB,KAGvE,OAAOmxC,EAGT,SAASsI,GAAmB35C,EAAOhC,GACjC,IAAI+C,EAAMf,EAAMI,UACZZ,EAAUuB,EAAIvB,QACdC,EAAQsB,EAAItB,MACZm6C,EAAQ57C,EAAM,EAAIwB,EAAQyI,IAAIxI,GAASD,EAAQ6I,IAAI5I,GACnDY,EAAUu5C,EAAMzwD,OAAO2V,cAAwB86C,EAAMx7C,MAAQ4B,EAAM5D,IAAIE,QAAQ0B,EAAM,EAAI47C,EAAM36C,QAAU26C,EAAM5wD,UAAY,KAApF4wD,EAC3C,OAAOv5C,GAAUvE,EAAiB6C,UAAUZ,SAASsC,EAAQrC,GAG/D,SAAS7e,GAAM+gB,EAAMC,GAEnB,OADAD,EAAKD,SAASC,EAAKF,MAAMW,GAAGC,aAAaT,GAAK2K,mBACvC,EAGT,SAAS+uC,GAAmB35C,EAAMlC,EAAK87C,GACrC,IAAI35C,EAAMD,EAAKF,MAAMI,UACrB,GAAID,aAAerE,EAAiB0E,cAAe,CACjD,IAAKL,EAAIvD,OAASk9C,EAAKz/B,QAAQ,MAAQ,EACrC,OAAO,EACF,GAAIna,EAAKO,eAAezC,EAAM,EAAI,QAAU,QAAS,CAC1D,IAAIE,EAAOy7C,GAAmBz5C,EAAKF,MAAOhC,GAC1C,SAAIE,GAASA,aAAgBpC,EAAiBuF,gBAAyBliB,GAAM+gB,EAAMhC,GAGnF,IAAsGkqC,EAAlG3oC,EAAQU,EAAIV,MAAOrd,EAAOqd,EAAM8zB,WAAa,KAAOv1B,EAAM,EAAIyB,EAAMuD,WAAavD,EAAMwD,UAC3F,IAAK7gB,GAAQA,EAAK64B,OAAU,OAAO,EACnC,IAAI8+B,EAAU/7C,EAAM,EAAIyB,EAAMzC,IAAM5a,EAAKghB,SAAW3D,EAAMzC,IAC1D,SAAM5a,EAAK2c,SAAWqpC,EAAOloC,EAAKkqB,QAAQ4oB,OAAO+G,MAAc3R,EAAKpoB,cAChElkB,EAAiBuF,cAAcC,aAAalf,GACvCjD,GAAM+gB,EAAM,IAAIpE,EAAiBuF,cAAcrD,EAAM,EAAIkC,EAAKF,MAAM5D,IAAIE,QAAQmD,EAAMzC,IAAM5a,EAAKghB,UAAY3D,MAC3Gzd,EAAOwoD,QAITrrD,GAAM+gB,EAAM,IAAIpE,EAAiB0E,cAAcN,EAAKF,MAAM5D,IAAIE,QAAQ0B,EAAM,EAAI+7C,EAAUA,EAAU33D,EAAKghB,aAK/G,GAAIjD,aAAerE,EAAiBuF,eAAiBlB,EAAI/d,KAAKmyC,SACnE,OAAOp1C,GAAM+gB,EAAM,IAAIpE,EAAiB0E,cAAcxC,EAAM,EAAImC,EAAIG,IAAMH,EAAII,QAE9E,IAAIg5B,EAASogB,GAAmBz5C,EAAKF,MAAOhC,GAC5C,QAAIu7B,GAAiBp6C,GAAM+gB,EAAMq5B,GAKrC,SAASygB,GAAQ53D,GACf,OAAwB,GAAjBA,EAAK0O,SAAgB1O,EAAK2O,UAAU3N,OAAShB,EAAKwpC,WAAWxoC,OAGtE,SAAS62D,GAAY13C,GACnB,IAAI6lC,EAAO7lC,EAAI8oC,WACf,OAAOjD,GAAqB,GAAbA,EAAKjf,OAAc5mB,EAAI1R,aAA+B,MAAhB0R,EAAI7R,UAK3D,SAASwpD,GAAqBh6C,GAC5B,IAAIC,EAAMD,EAAK1b,KAAKksD,eAChBtuD,EAAO+d,EAAI2wC,UAAW9qD,EAASma,EAAI6wC,YACvC,GAAK5uD,EAAL,CACA,IAAI+3D,EAAUC,EAAY7G,GAAQ,EAKlC,IADIvxD,EAAO0wB,OAA0B,GAAjBtwB,EAAK0O,UAAiB9K,EAASg0D,GAAQ53D,IAAS63D,GAAY73D,EAAKwpC,WAAW5lC,MAAYutD,GAAQ,KAElH,GAAIvtD,EAAS,EAAG,CACd,GAAqB,GAAjB5D,EAAK0O,SACP,MAEA,IAAI9H,EAAS5G,EAAKwpC,WAAW5lC,EAAS,GACtC,GAAIi0D,GAAYjxD,GACdmxD,EAAW/3D,EACXg4D,IAAep0D,MACV,IAAuB,GAAnBgD,EAAO8H,SAGT,MAFP1O,EAAO4G,EACPhD,EAAS5D,EAAK2O,UAAU3N,YAGvB,IAAIi3D,GAAYj4D,GACrB,MAEA,IAAIomD,EAAOpmD,EAAKs/C,gBAChB,MAAO8G,GAAQyR,GAAYzR,GACzB2R,EAAW/3D,EAAKsR,WAChB0mD,EAAazP,EAASnC,GACtBA,EAAOA,EAAK9G,gBAEd,GAAK8G,EAKHpmD,EAAOomD,EACPxiD,EAASg0D,GAAQ53D,OANR,CAET,GADAA,EAAOA,EAAKsR,WACRtR,GAAQ8d,EAAKqC,IAAO,MACxBvc,EAAS,GAOXutD,EAAS+G,GAAYp6C,EAAMC,EAAK/d,EAAM4D,GACjCm0D,GAAYG,GAAYp6C,EAAMC,EAAKg6C,EAAUC,IAKxD,SAASG,GAAsBr6C,GAC7B,IAAIC,EAAMD,EAAK1b,KAAKksD,eAChBtuD,EAAO+d,EAAI2wC,UAAW9qD,EAASma,EAAI6wC,YACvC,GAAK5uD,EAAL,CAGA,IAFA,IACI+3D,EAAUC,EADVjM,EAAM6L,GAAQ53D,KAGhB,GAAI4D,EAASmoD,EAAK,CAChB,GAAqB,GAAjB/rD,EAAK0O,SAAiB,MAC1B,IAAImO,EAAQ7c,EAAKwpC,WAAW5lC,GAC5B,IAAIi0D,GAAYh7C,GAIT,MAHLk7C,EAAW/3D,EACXg4D,IAAep0D,MAGZ,IAAIq0D,GAAYj4D,GACrB,MAEA,IAAI8b,EAAO9b,EAAKyO,YAChB,MAAOqN,GAAQ+7C,GAAY/7C,GACzBi8C,EAAWj8C,EAAKxK,WAChB0mD,EAAazP,EAASzsC,GAAQ,EAC9BA,EAAOA,EAAKrN,YAEd,GAAKqN,EAKH9b,EAAO8b,EACPlY,EAAS,EACTmoD,EAAM6L,GAAQ53D,OAPL,CAET,GADAA,EAAOA,EAAKsR,WACRtR,GAAQ8d,EAAKqC,IAAO,MACxBvc,EAASmoD,EAAM,GAQjBgM,GAAYG,GAAYp6C,EAAMC,EAAKg6C,EAAUC,IAGnD,SAASC,GAAY93C,GACnB,IAAI6lC,EAAO7lC,EAAI8oC,WACf,OAAOjD,GAAQA,EAAKhmD,MAAQgmD,EAAKhmD,KAAKquC,QAGxC,SAAS6pB,GAAYp6C,EAAMC,EAAK/d,EAAM4D,GACpC,GAAIslD,EAAmBnrC,GAAM,CAC3B,IAAI1gB,EAAQ8Q,SAAS26B,cACrBzrC,EAAM0rC,OAAO/oC,EAAM4D,GACnBvG,EAAM2rC,SAAShpC,EAAM4D,GACrBma,EAAImxC,kBACJnxC,EAAIkzB,SAAS5zC,QACJ0gB,EAAIigB,QACbjgB,EAAIigB,OAAOh+B,EAAM4D,GAEnBka,EAAKs6C,YAAYC,kBAOnB,SAASC,GAAiBx6C,EAAMlC,EAAK87C,GACnC,IAAI35C,EAAMD,EAAKF,MAAMI,UACrB,GAAID,aAAerE,EAAiB0E,gBAAkBL,EAAIvD,OAASk9C,EAAKz/B,QAAQ,MAAQ,EAAK,OAAO,EACpG,IAAI9Z,EAAQJ,EAAII,MACZD,EAAMH,EAAIG,IAEd,IAAKC,EAAMpX,OAAO2V,eAAiBoB,EAAKO,eAAezC,EAAM,EAAI,KAAO,QAAS,CAC/E,IAAIE,EAAOy7C,GAAmBz5C,EAAKF,MAAOhC,GAC1C,GAAIE,GAASA,aAAgBpC,EAAiBuF,cAC1C,OAAOliB,GAAM+gB,EAAMhC,GAEzB,IAAKqC,EAAMpX,OAAO2V,cAAe,CAC/B,IAAI67C,EAAS7+C,EAAiB6C,UAAUZ,SAASC,EAAM,EAAIuC,EAAQD,EAAKtC,GACxE,OAAO28C,GAASx7D,GAAM+gB,EAAMy6C,GAE9B,OAAO,EAGT,SAASC,GAA2B16C,EAAMlC,GACxC,KAAMkC,EAAKF,MAAMI,qBAAqBtE,EAAiB0E,eAAkB,OAAO,EAChF,IAAIO,EAAMb,EAAKF,MAAMI,UACjBX,EAAQsB,EAAItB,MACZD,EAAUuB,EAAIvB,QACd5C,EAAQmE,EAAInE,MAChB,IAAK6C,EAAMk1B,WAAWn1B,GAAY,OAAO,EACzC,IAAK5C,EAAS,OAAO,EACrB,GAAIsD,EAAKO,eAAezC,EAAM,EAAI,UAAY,YAAe,OAAO,EACpE,IAAI68C,GAAYp7C,EAAM8zB,aAAev1B,EAAM,EAAIyB,EAAMuD,WAAavD,EAAMwD,WACxE,GAAI43C,IAAaA,EAAS5/B,OAAQ,CAChC,IAAIta,EAAKT,EAAKF,MAAMW,GAIpB,OAHI3C,EAAM,EAAK2C,EAAGpgB,OAAOkf,EAAMzC,IAAM69C,EAASz3C,SAAU3D,EAAMzC,KACvD2D,EAAGpgB,OAAOkf,EAAMzC,IAAKyC,EAAMzC,IAAM69C,EAASz3C,UACjDlD,EAAKD,SAASU,IACP,EAET,OAAO,EAGT,SAASm6C,GAAe56C,EAAM9d,EAAM4d,GAClCE,EAAKs6C,YAAYlG,OACjBlyD,EAAKgpD,gBAAkBprC,EACvBE,EAAKs6C,YAAYxyC,QAOnB,SAAS+yC,GAAmB76C,GAC1B,GAAKle,EAAOqwB,UAAUnS,EAAKF,MAAMI,UAAUX,MAAMsZ,aAAe,GAAhE,CACA,IAAIhY,EAAMb,EAAK1b,KAAKksD,eAChBI,EAAY/vC,EAAI+vC,UAChBE,EAAcjwC,EAAIiwC,YACtB,GAAIF,GAAmC,GAAtBA,EAAUhgD,UAAgC,GAAfkgD,GACxCF,EAAUlgD,YAAsD,SAAxCkgD,EAAUlgD,WAAWw6C,gBAA4B,CAC3E,IAAIpnD,EAAQ8sD,EAAUlgD,WACtBkqD,GAAe56C,EAAMlc,GAAO,GAC5BsgB,YAAW,WAAc,OAAOw2C,GAAe56C,EAAMlc,GAAO,KAAW,MAW3E,SAASg3D,GAAQhqD,GACf,IAAIqgD,EAAY,GAKhB,OAJIrgD,EAAMiiB,UAAWo+B,GAAa,KAC9BrgD,EAAMmiB,UAAWk+B,GAAa,KAC9BrgD,EAAMkiB,SAAUm+B,GAAa,KAC7BrgD,EAAMoiB,WAAYi+B,GAAa,KAC5BA,EAGT,SAAS4J,GAAe/6C,EAAMlP,GAC5B,IAAI1B,EAAO0B,EAAMqiB,QAASymC,EAAOkB,GAAQhqD,GACzC,OAAY,GAAR1B,GAActN,EAAO2wB,KAAe,IAARrjB,GAAsB,KAARwqD,EACrCc,GAA2B16C,GAAO,IAAMg6C,GAAqBh6C,GACnD,IAAR5Q,GAAetN,EAAO2wB,KAAe,IAARrjB,GAAsB,KAARwqD,EAC7Cc,GAA2B16C,EAAM,IAAMq6C,GAAsBr6C,GACnD,IAAR5Q,GAAsB,IAARA,IAEN,IAARA,EACFuqD,GAAmB35C,GAAO,EAAG45C,IAASI,GAAqBh6C,GACjD,IAAR5Q,EACFuqD,GAAmB35C,EAAM,EAAG45C,IAASS,GAAsBr6C,GACjD,IAAR5Q,EACForD,GAAiBx6C,GAAO,EAAG45C,IAASI,GAAqBh6C,GAC/C,IAAR5Q,EACFyrD,GAAmB76C,IAASw6C,GAAiBx6C,EAAM,EAAG45C,IAASS,GAAsBr6C,GACnF45C,IAAS93D,EAAO2wB,IAAM,IAAM,OACnB,IAARrjB,GAAsB,IAARA,GAAsB,IAARA,GAAsB,IAARA,IAMxD,SAAS4rD,GAAiBh7C,EAAM/J,GAC9B,IAG+BqJ,EAASY,EAHpCmrC,EAASrrC,EAAK1b,KAAKksD,eAAgBt0C,EAAM8D,EAAKF,MAAM5D,IACpDuyC,EAAczuC,EAAKkqB,QAAQukB,YAAYpD,EAAOuF,WAAYqK,EAAWxM,GAAmC,GAApBA,EAAYxlB,KAChG5sB,EAAO2D,EAAKkqB,QAAQokB,WAAWjD,EAAOuF,UAAWvF,EAAOyF,aACxDvxC,EAAQrD,EAAIE,QAAQC,GACxB,GAAI+uC,EAAmBC,GAAS,CAC9B/rC,EAAUC,EACV,MAAOkvC,IAAgBA,EAAYvsD,KAAQusD,EAAcA,EAAYxlD,OACrE,GAAIwlD,GAAeA,EAAYvsD,KAAK2c,QAAUjD,EAAiBuF,cAAcC,aAAaqtC,EAAYvsD,OAASusD,EAAYxlD,OAAQ,CACjI,IAAI6T,EAAM2xC,EAAYC,UACtBxuC,EAAY,IAAItE,EAAiBuF,cAAc9E,GAAQS,EAAMyC,EAAQrD,EAAIE,QAAQU,UAGnFwC,EAAUpD,EAAIE,QAAQ4D,EAAKkqB,QAAQokB,WAAWjD,EAAOmI,WAAYnI,EAAOoI,eAG1E,IAAKvzC,EAAW,CACd,IAAIkrB,EAAiB,WAAVn1B,GAAwB+J,EAAKF,MAAMI,UAAU7D,KAAOkD,EAAMzC,MAAQm+C,EAAY,GAAK,EAC9F/6C,EAAYg7C,GAAiBl7C,EAAMV,EAASC,EAAO6rB,GAErD,OAAOlrB,EAGT,SAASi7C,GAAen7C,EAAMo7C,EAAW/H,GACvC,IAAIpzC,EAAMD,EAAKF,MAAMI,UAGrB,GAFAm7C,GAAkBr7C,EAAMC,GAEpBD,EAAKY,WAAaZ,EAAKs7C,WAAY,CACrC,IAAKF,EAAa,OAEdt5D,EAAO0wB,OAAS1wB,EAAOooD,eAAiB,KAC1ClqC,EAAKs6C,YAAYiB,sBACjBv7C,EAAKqC,IAAIqhB,QACT1jB,EAAKs6C,YAAYkB,yBAEd,IAAKx7C,EAAKY,YAAc66C,GAAaz7C,KAAS3P,SAAS6/C,cAAc3oD,SAASyY,EAAKqC,QAAU+4C,EAClG,OAKF,GAFAp7C,EAAKs6C,YAAYiB,sBAEbv7C,EAAK07C,cACPC,GAAoB37C,OACf,CACL,IAEI47C,EAAmBC,EAFnB1+C,EAAS8C,EAAI9C,OACbd,EAAO4D,EAAI5D,MAEXy/C,IAAmC77C,aAAerE,EAAiB0E,gBAChEL,EAAII,MAAMpX,OAAO2V,gBAClBg9C,EAAoBG,GAAwB/7C,EAAMC,EAAIkH,OACrDlH,EAAIvD,OAAUuD,EAAII,MAAMpX,OAAO2V,gBAChCi9C,EAAkBE,GAAwB/7C,EAAMC,EAAImH,MAE1DpH,EAAKkqB,QAAQxpB,aAAavD,EAAQd,EAAM2D,EAAK1b,KAAM+uD,GAC/CyI,KACEF,IAAqBA,EAAkB1Q,gBAAkB,SACzD2Q,IAAmBA,EAAgB3Q,gBAAkB,UAEvDjrC,EAAIvB,QACNsB,EAAKqC,IAAItJ,UAAUm+C,OAAO,6BACjB/5C,GAAUd,IACnB2D,EAAKqC,IAAItJ,UAAUvY,IAAI,6BACnB,sBAAuB6P,UAAY2rD,GAA6Bh8C,IAIxEA,EAAKs6C,YAAYC,kBACjBv6C,EAAKs6C,YAAYkB,mBAhoBnB/F,GAAgBrhD,UAAU6nD,YAAc,SAAsBz2D,GAC5D,OAAOA,GAASlE,KAAKk3D,eAAiBl3D,KAAKi3D,WAAW/yD,EAAQlE,KAAKk3D,gBAAkB,MAKvF/C,GAAgBrhD,UAAU8nD,eAAiB,SAAyBp0C,EAAO/gB,GACvE,IAAI8a,EAASvgB,KAEf,GAAIwmB,GAAS/gB,EAAb,CACA,IAAK,IAAI2E,EAAIoc,EAAOpc,EAAI3E,EAAK2E,IAAOmW,EAAO1e,IAAIH,SAAS0I,GAAG4W,UAC3DhhB,KAAK6B,IAAIH,SAAS6I,OAAOic,EAAO/gB,EAAM+gB,GACtCxmB,KAAK8iC,SAAU,IAIjBqxB,GAAgBrhD,UAAU4hD,YAAc,WACtC10D,KAAK46D,eAAe56D,KAAKkE,MAAOlE,KAAK6B,IAAIH,SAASE,SAMpDuyD,GAAgBrhD,UAAUuhD,YAAc,SAAsBp9B,EAAO4f,EAAQn4B,GACzE,IAAI6B,EAASvgB,KAEXwiD,EAAO,EAAG5lC,EAAQ5c,KAAK2B,MAAMC,QAAU,EACvCi5D,EAAU9kD,KAAK8Q,IAAIjK,EAAOqa,EAAMr1B,QACpC,MAAO4gD,EAAOqY,IACNrY,GAAQ5lC,EAAQ,EAAI5c,KAAK6B,IAAM7B,KAAK2B,MAAO6gD,EAAO,GAAM,IAAIoO,YAAY35B,EAAMurB,MAA6C,IAAnCvrB,EAAMurB,GAAMjkD,KAAK2d,KAAKwmC,SAClHF,IAEJ,MAAOA,EAAO5lC,EACZ2D,EAAOm0C,cACPn0C,EAAO1e,IAAI0uD,MAAQL,EACnB3vC,EAAOrc,MAAQqc,EAAO5e,MAAMI,MAC5Bwe,EAAO1e,IAAM0e,EAAO5e,MAAMI,MAC1B6a,IAEF,MAAOA,EAAQqa,EAAMr1B,OAAQ,CAC3B2e,EAAO5e,MAAMG,KAAKye,EAAO1e,IAAK0e,EAAOrc,MAAQ,GAE7C,IADA,IAAIqrC,GAAS,EACJnlC,EAAIpK,KAAKkE,MAAOkG,EAAI2L,KAAK8Q,IAAI7mB,KAAKkE,MAAQ,EAAGlE,KAAK6B,IAAIH,SAASE,QAASwI,IAC/E,GAAImW,EAAO1e,IAAIH,SAAS0I,GAAGwmD,YAAY35B,EAAMra,IAAS,CAAE2yB,EAAQnlC,EAAG,MAErE,GAAImlC,GAAS,EACPA,EAAQhvB,EAAOrc,QACjBqc,EAAOuiB,SAAU,EACjBviB,EAAOq6C,eAAer6C,EAAOrc,MAAOqrC,IAEtChvB,EAAO1e,IAAM0e,EAAO1e,IAAIH,SAAS6e,EAAOrc,WACnC,CACL,IAAI42D,EAAW3H,GAAa/1D,OAAOmjB,EAAO1e,IAAKo1B,EAAMra,GAAQi6B,EAAQn4B,GACrE6B,EAAO1e,IAAIH,SAAS6I,OAAOgW,EAAOrc,MAAO,EAAG42D,GAC5Cv6C,EAAO1e,IAAMi5D,EACbv6C,EAAOuiB,SAAU,EAEnBviB,EAAOrc,MAAQ,EACf0Y,MAOJu3C,GAAgBrhD,UAAUyhD,cAAgB,SAAwB3zD,EAAM2yD,EAAWC,EAAWtvD,GAC1F,IAAIqc,EAASvgB,KAEXuvC,GAAS,EAAGynB,EAAW9yD,EAAQ,OAAIpE,EAAYE,KAAK26D,YAAYz2D,GAAQxC,EAAW1B,KAAK6B,IAAIH,SAChG,GAAIs1D,GAAYA,EAASnG,YAAYjwD,EAAM2yD,EAAWC,GACpDjkB,EAAQ7tC,EAASm3B,QAAQm+B,QAEzB,IAAK,IAAI5sD,EAAIpK,KAAKkE,MAAO4c,EAAI/K,KAAK8Q,IAAInlB,EAASE,OAAQwI,EAAI,GAAIA,EAAI0W,EAAG1W,IAAK,CACzE,IAAI5H,EAAQd,EAAS0I,GACrB,GAAI5H,EAAMquD,YAAYjwD,EAAM2yD,EAAWC,IAAcjzC,EAAO02C,WAAWp+B,QAAQr2B,GAAS,EAAG,CACzF+sC,EAAQnlC,EACR,OAIN,QAAImlC,EAAQ,KACZvvC,KAAK46D,eAAe56D,KAAKkE,MAAOqrC,GAChCvvC,KAAKkE,SACE,IAMTiwD,GAAgBrhD,UAAU0hD,eAAiB,SAAyB5zD,EAAM2yD,EAAWC,EAAW90C,EAAMxa,GACpG,GAAIlE,KAAKkE,OAASlE,KAAK6B,IAAIH,SAASE,OAAU,OAAO,EACrD,IAAI8a,EAAO1c,KAAK6B,IAAIH,SAAS1B,KAAKkE,OAClC,GAAIwY,aAAgB42C,GAAc,CAChC,IAAI0D,EAAWh3D,KAAKi3D,WAAWp+B,QAAQnc,GACvC,GAAIs6C,GAAY,GAAKA,EAAWh3D,KAAKk3D,gBAAkBhzD,EAAS,OAAO,EACvE,IAAI62D,EAAUr+C,EAAKqE,IAKfi6C,EAASh7D,KAAK+2D,OAASgE,GAAW/6D,KAAK+2D,MAA4B,GAApBgE,EAAQzrD,UAAiByrD,EAAQ90D,SAASjG,KAAK+2D,KAAK7kD,gBACjGtR,EAAK64B,QAAU/c,EAAK9b,MAAQ8b,EAAK9b,KAAK64B,QAAU/c,EAAKiF,QAAQpS,WAAa3O,EAAKQ,MAC/Esb,EAAK6zC,OAASF,GAAc0D,GAAcR,EAAW72C,EAAK62C,YAChE,IAAKyH,GAAUt+C,EAAKwE,OAAOtgB,EAAM2yD,EAAWC,EAAW90C,GAGrD,OAFIhC,EAAKqE,KAAOg6C,IAAW/6D,KAAK8iC,SAAU,GAC1C9iC,KAAKkE,SACE,EAGX,OAAO,GAKTiwD,GAAgBrhD,UAAU8+B,QAAU,SAAkBhxC,EAAM2yD,EAAWC,EAAW90C,EAAMlD,GACtFxb,KAAK6B,IAAIH,SAAS6I,OAAOvK,KAAKkE,QAAS,EAAGovD,GAAal2D,OAAO4C,KAAK6B,IAAKjB,EAAM2yD,EAAWC,EAAW90C,EAAMlD,IAC1Gxb,KAAK8iC,SAAU,GAGjBqxB,GAAgBrhD,UAAUwhD,YAAc,SAAsBp0C,EAAQxB,EAAMlD,GAC1E,GAAIxb,KAAKkE,MAAQlE,KAAK6B,IAAIH,SAASE,QAAU5B,KAAK6B,IAAIH,SAAS1B,KAAKkE,OAAOysD,cAAczwC,GACvFlgB,KAAKkE,YACA,CACL,IAAI0iD,EAAO,IAAIgM,GAAe5yD,KAAK6B,IAAKqe,EAAQxB,EAAMlD,GACtDxb,KAAK6B,IAAIH,SAAS6I,OAAOvK,KAAKkE,QAAS,EAAG0iD,GAC1C5mD,KAAK8iC,SAAU,IAMnBqxB,GAAgBrhD,UAAU2hD,kBAAoB,WAC5C,IAAIx3C,EAAYjd,KAAK6B,IAAIH,SAAS1B,KAAKkE,MAAQ,GAC/C,MAAO+Y,aAAqBk2C,GAAgBl2C,EAAYA,EAAUvb,SAASub,EAAUvb,SAASE,OAAS,GAEvG,IAAKqb,KACCA,aAAqB42C,KACvB,MAAM/hD,KAAKmL,EAAUrc,KAAKQ,MAC5B,GAAIpB,KAAKkE,MAAQlE,KAAK6B,IAAIH,SAASE,QAAU5B,KAAK6B,IAAIH,SAAS1B,KAAKkE,OAAO4sD,cACzE9wD,KAAKkE,YACA,CACL,IAAI6c,EAAMhS,SAASZ,cAAc,MACjCnO,KAAK6B,IAAIH,SAAS6I,OAAOvK,KAAKkE,QAAS,EAAG,IAAI6xD,GAAe/1D,KAAK6B,IAAK8wD,EAAS5xC,EAAK,OACrF/gB,KAAK8iC,SAAU,IAwfrB,IAAI03B,GAAgCh6D,EAAOwwB,QAAUxwB,EAAOqwB,QAAUrwB,EAAOqoD,eAAiB,GAE9F,SAAS4R,GAAwB/7C,EAAMlD,GACrC,IAAI+D,EAAMb,EAAKkqB,QAAQuB,WAAW3uB,GAC9B5a,EAAO2e,EAAI3e,KACX4D,EAAS+a,EAAI/a,OACbiZ,EAAQjZ,EAAS5D,EAAKwpC,WAAWxoC,OAAShB,EAAKwpC,WAAW5lC,GAAU,KACpEgD,EAAShD,EAAS5D,EAAKwpC,WAAW5lC,EAAS,GAAK,KACpD,KAAMiZ,GAAkC,SAAzBA,EAAMmsC,oBAAiCpiD,GAAoC,SAA1BA,EAAOoiD,iBAA6B,CAClG,GAAInsC,EAEF,OADAA,EAAMmsC,gBAAkB,OACjBnsC,EACF,GAAIjW,EAET,OADAA,EAAOoiD,gBAAkB,OAClBpiD,GAKb,SAASkzD,GAA6Bh8C,GACpC,IAAI9D,EAAM8D,EAAKqC,IAAI4/B,cACnB/lC,EAAIqG,oBAAoB,kBAAmBvC,EAAKu8C,oBAChD,IAAIlR,EAASrrC,EAAK1b,KAAKksD,eACnBtuD,EAAOmpD,EAAOmI,WAAY1tD,EAASulD,EAAOoI,aAC9Cv3C,EAAId,iBAAiB,kBAAmB4E,EAAKu8C,mBAAqB,WAC5DlR,EAAOmI,YAActxD,GAAQmpD,EAAOoI,cAAgB3tD,IACtDoW,EAAIqG,oBAAoB,kBAAmBvC,EAAKu8C,oBAChDv8C,EAAKqC,IAAItJ,UAAUm+C,OAAO,gCAKhC,SAASyE,GAAoB37C,GAC3B,IAAIqrC,EAASrrC,EAAK1b,KAAKksD,eAAgBjxD,EAAQ8Q,SAAS26B,cACpD9oC,EAAO8d,EAAK07C,cAAcr5C,IAAKm6C,EAAuB,OAAjBt6D,EAAKsO,SAC1CgsD,EAAOj9D,EAAM0rC,OAAO/oC,EAAKsR,WAAYi3C,EAASvoD,GAAQ,GACnD3C,EAAM0rC,OAAO/oC,EAAM,GAC1B3C,EAAMm0D,UAAS,GACfrI,EAAO+F,kBACP/F,EAAOlY,SAAS5zC,IAMXi9D,IAAQx8C,EAAKF,MAAMI,UAAUxB,SAAW5c,EAAOioD,IAAMjoD,EAAOkoD,YAAc,KAC7E9nD,EAAKu6D,UAAW,EAChBv6D,EAAKu6D,UAAW,GAIpB,SAASpB,GAAkBr7C,EAAMC,GAC/B,GAAIA,aAAerE,EAAiBuF,cAAe,CACjD,IAAI+mC,EAAOloC,EAAKkqB,QAAQ4oB,OAAO7yC,EAAIkH,MAC/B+gC,GAAQloC,EAAK08C,uBACfC,GAAmB38C,GACfkoC,GAAQA,EAAK8O,aACjBh3C,EAAK08C,qBAAuBxU,QAG9ByU,GAAmB38C,GAKvB,SAAS28C,GAAmB38C,GACtBA,EAAK08C,uBACH18C,EAAK08C,qBAAqBzzD,QAC1B+W,EAAK08C,qBAAqBzF,eAC9Bj3C,EAAK08C,qBAAuB,MAIhC,SAASxB,GAAiBl7C,EAAMV,EAASC,EAAO6rB,GAC9C,OAAOprB,EAAKW,SAAS,0BAA0B,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMV,EAASC,OACjF3D,EAAiB0E,cAAc2M,QAAQ3N,EAASC,EAAO6rB,GAG9D,SAASwxB,GAAqB58C,GAC5B,QAAIA,EAAKY,UAAYZ,EAAK1b,KAAK4rD,eAAiBlwC,EAAKqC,MAC9Co5C,GAAaz7C,GAGtB,SAASy7C,GAAaz7C,GACpB,IAAIC,EAAMD,EAAK1b,KAAKksD,eACpB,IAAKvwC,EAAIuzC,WAAc,OAAO,EAC9B,IAIE,OAAOxzC,EAAKqC,IAAI9a,SAAoC,GAA3B0Y,EAAIuzC,WAAW5iD,SAAgBqP,EAAIuzC,WAAWhgD,WAAayM,EAAIuzC,cACrFxzC,EAAKY,UAAYZ,EAAKqC,IAAI9a,SAAmC,GAA1B0Y,EAAI2wC,UAAUhgD,SAAgBqP,EAAI2wC,UAAUp9C,WAAayM,EAAI2wC,YACnG,MAAMlf,GACN,OAAO,GAIX,SAASmrB,GAAmB78C,GAC1B,IAAIszC,EAAYtzC,EAAKkqB,QAAQuB,WAAWzrB,EAAKF,MAAMI,UAAU/C,QACzDkuC,EAASrrC,EAAK1b,KAAKksD,eACvB,OAAO7F,EAAqB2I,EAAUpxD,KAAMoxD,EAAUxtD,OAAQulD,EAAOmI,WAAYnI,EAAOoI,cAS1F,SAASqJ,GAAa98C,EAAM+8C,EAAOC,GACjC,IAAIn8C,EAAMb,EAAKkqB,QAAQ6oB,WAAWgK,EAAOC,GACrC/zD,EAAS4X,EAAI3e,KACb8wD,EAAanyC,EAAImyC,WACjBC,EAAWpyC,EAAIoyC,SACf9rC,EAAOtG,EAAIsG,KACXC,EAAKvG,EAAIuG,GAETikC,EAASrrC,EAAK1b,KAAKksD,eAAgB/8C,EAAO,KAAM0J,EAASkuC,EAAOmI,WAQpE,GAPIr2C,GAAU6C,EAAKqC,IAAI9a,SAA4B,GAAnB4V,EAAOvM,SAAgBuM,EAASA,EAAO3J,cACrEC,EAAO,CAAC,CAACvR,KAAMib,EAAQrX,OAAQulD,EAAOoI,eACjCrI,EAAmBC,IACpB53C,EAAKrQ,KAAK,CAAClB,KAAMmpD,EAAOuF,UAAW9qD,OAAQulD,EAAOyF,eAIpDhvD,EAAOqwB,QAA+B,IAArBnS,EAAKi9C,YACxB,IAAK,IAAIrS,EAAMqI,EAAUrI,EAAMoI,EAAYpI,IAAO,CAChD,IAAI1oD,EAAO+G,EAAOyiC,WAAWkf,EAAM,GAAI1C,EAAOhmD,EAAKipD,WACnD,GAAqB,MAAjBjpD,EAAK0O,WAAqBs3C,EAAM,CAAE+K,EAAWrI,EAAK,MACtD,IAAK1C,GAAQA,EAAKjf,KAAQ,MAG9B,IAAIi0B,EAAWl9C,EAAKF,MAAM5D,IACtB8jC,EAAShgC,EAAKW,SAAS,cAAgB7E,EAAiBogC,UAAUlU,WAAWhoB,EAAKF,MAAM8b,QACxFvb,EAAQ68C,EAAS9gD,QAAQ+K,GAEzBlH,EAAM,KAAM/D,EAAM8jC,EAAO/X,MAAMh/B,EAAQ,CACzC08B,QAAStlB,EAAMpX,OACfo3C,SAAUhgC,EAAMpX,OAAO0U,eAAe0C,EAAM7a,SAC5C09C,SAAS,EACT/7B,KAAM6rC,EACN5rC,GAAI6rC,EACJtT,oBAAoBt/B,EAAMpX,OAAOpJ,KAAK2d,KAAKpO,MAAO,OAClD+tD,iBAAiB,EACjB7c,cAAe7sC,EACfmuC,aAAcA,GAAa5B,EAAQ3/B,GACnCvM,QAASuM,IAEX,GAAI5M,GAAuB,MAAfA,EAAK,GAAGqJ,IAAa,CAC/B,IAAIsgD,EAAW3pD,EAAK,GAAGqJ,IAAKT,EAAO5I,EAAK,IAAMA,EAAK,GAAGqJ,IAC1C,MAART,IAAgBA,EAAO+gD,GAC3Bn9C,EAAM,CAAC9C,OAAQigD,EAAWj2C,EAAM9K,KAAMA,EAAO8K,GAE/C,MAAO,CAACjL,IAAKA,EAAK+D,IAAKA,EAAKkH,KAAMA,EAAMC,GAAIA,GAG9C,SAASw6B,GAAa5B,EAAQlsC,GAC5B,OAAO,SAAUuO,GACf,IAAI6lC,EAAO7lC,EAAI8oC,WACf,GAAIjD,EACF,OAAOA,EAAKmK,YACP,GAAoB,MAAhBhwC,EAAI7R,UAAoB6R,EAAI7O,WAAY,CAIjD,GAAI1R,EAAOwwB,QAAU,aAAalf,KAAKiP,EAAI7O,WAAWhD,UAClD,OAAOwvC,EAAOvD,SAASpsC,SAASZ,cAAc,MAAOqE,GACpD,GAAIuO,EAAI7O,WAAW+K,WAAa8D,GAAOvgB,EAAOwwB,QAAU,gBAAgBlf,KAAKiP,EAAI7O,WAAWhD,UAC7F,MAAO,CAACqqC,QAAQ,QACf,GAAoB,OAAhBx4B,EAAI7R,UAAqB6R,EAAI2qB,aAAa,oBACnD,MAAO,CAAC6N,QAAQ,IAKtB,SAASwiB,GAAcr9C,EAAMmH,EAAMC,EAAIk2C,GACrC,GAAIn2C,EAAO,EAAX,CACE,IAAIlR,EAAS+J,EAAKu9C,kBAAoBvW,KAAKC,MAAQ,GAAKjnC,EAAKw9C,oBAAsB,KAC/EC,EAASzC,GAAiBh7C,EAAM/J,GACpC,IAAK+J,EAAKF,MAAMI,UAAUvD,GAAG8gD,GAAS,CACpC,IAAIC,EAAO19C,EAAKF,MAAMW,GAAGC,aAAa+8C,GACxB,WAAVxnD,EAAuBynD,EAAK/yC,QAAQ,WAAW,GAChC,OAAV1U,GAAmBynD,EAAK9yC,iBACjC5K,EAAKD,SAAS29C,QAPlB,CAYA,IAAI1qB,EAAUhzB,EAAKF,MAAM5D,IAAIE,QAAQ+K,GACjCw2C,EAAS3qB,EAAQsB,YAAYltB,GACjCD,EAAO6rB,EAAQlqC,OAAO60D,EAAS,GAC/Bv2C,EAAKpH,EAAKF,MAAM5D,IAAIE,QAAQgL,GAAIrI,MAAM4+C,EAAS,GAE/C,IAIIC,EAAcC,EAJd59C,EAAMD,EAAKF,MAAMI,UACjB+nB,EAAQ60B,GAAa98C,EAAMmH,EAAMC,GAEjClL,EAAM8D,EAAKF,MAAM5D,IAAK4hD,EAAU5hD,EAAI9P,MAAM67B,EAAM9gB,KAAM8gB,EAAM7gB,IAGvC,IAArBpH,EAAKi9C,aAAqBjW,KAAKC,MAAQ,IAAMjnC,EAAK+9C,iBACpDH,EAAe59C,EAAKF,MAAMI,UAAUkH,GACpCy2C,EAAgB,QAEhBD,EAAe59C,EAAKF,MAAMI,UAAUiH,KACpC02C,EAAgB,SAElB79C,EAAKi9C,YAAc,KAEnB,IAAIe,EAASC,GAASH,EAAQthD,QAASyrB,EAAM/rB,IAAIM,QAASyrB,EAAM9gB,KAAMy2C,EAAcC,GACpF,IAAKG,EAAQ,CACX,KAAIV,GAAYr9C,aAAerE,EAAiB0E,gBAAkBL,EAAIvD,OAASuD,EAAIV,MAAMk1B,WAAWx0B,EAAIX,WACnGU,EAAK0W,WAAeuR,EAAMhoB,KAAOgoB,EAAMhoB,IAAI9C,QAAU8qB,EAAMhoB,IAAI5D,KAE7D,CACL,GAAI4rB,EAAMhoB,IAAK,CACb,IAAIi+C,EAAQ90B,GAAiBppB,EAAMA,EAAKF,MAAM5D,IAAK+rB,EAAMhoB,KACrDi+C,IAAUA,EAAMvhD,GAAGqD,EAAKF,MAAMI,YAAcF,EAAKD,SAASC,EAAKF,MAAMW,GAAGC,aAAaw9C,IAE3F,OANAF,EAAS,CAACl2C,MAAO7H,EAAIkH,KAAMg3C,KAAMl+C,EAAImH,GAAIg3C,KAAMn+C,EAAImH,IASvDpH,EAAKq+C,iBAIDr+C,EAAKF,MAAMI,UAAUiH,KAAOnH,EAAKF,MAAMI,UAAUkH,IACjD42C,EAAOl2C,OAASk2C,EAAOI,MACvBp+C,EAAKF,MAAMI,qBAAqBtE,EAAiB0E,gBAC/C09C,EAAOl2C,MAAQ9H,EAAKF,MAAMI,UAAUiH,MAAQ62C,EAAOl2C,OAAS9H,EAAKF,MAAMI,UAAUiH,KAAO,EAC1F62C,EAAOl2C,MAAQ9H,EAAKF,MAAMI,UAAUiH,KAC3B62C,EAAOG,KAAOn+C,EAAKF,MAAMI,UAAUkH,IAAM42C,EAAOG,MAAQn+C,EAAKF,MAAMI,UAAUkH,GAAK,IAC3F42C,EAAOI,MAASp+C,EAAKF,MAAMI,UAAUkH,GAAK42C,EAAOG,KACjDH,EAAOG,KAAOn+C,EAAKF,MAAMI,UAAUkH,KAOnCtlB,EAAOioD,IAAMjoD,EAAOkoD,YAAc,IAAMgU,EAAOI,MAAQJ,EAAOl2C,MAAQ,GACtEk2C,EAAOG,MAAQH,EAAOl2C,OAASk2C,EAAOl2C,MAAQmgB,EAAM9gB,MACmC,MAAvF8gB,EAAM/rB,IAAIg0B,YAAY8tB,EAAOl2C,MAAQmgB,EAAM9gB,KAAO,EAAG62C,EAAOl2C,MAAQmgB,EAAM9gB,KAAO,KACnF62C,EAAOl2C,QACPk2C,EAAOG,OACPH,EAAOI,QAGT,IAEIE,EAFAj+C,EAAQ4nB,EAAM/rB,IAAIs3B,eAAewqB,EAAOl2C,MAAQmgB,EAAM9gB,MACtD/G,EAAM6nB,EAAM/rB,IAAIs3B,eAAewqB,EAAOI,KAAOn2B,EAAM9gB,MAIvD,MAAK9G,EAAMo0B,WAAWr0B,IAAQC,EAAMvD,IAAMmrB,EAAM/rB,IAAIM,QAAQysB,OACvDq1B,EAAU1iD,EAAiB6C,UAAUZ,SAASoqB,EAAM/rB,IAAIE,QAAQiE,EAAMvD,IAAM,GAAI,GAAG,KACpFwhD,EAAQjiD,MAAQ+D,EAAItD,KACpBkD,EAAKW,SAAS,iBAAiB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAM0rC,EAAS,GAAI,cAG9E,GAAI1rC,EAAKF,MAAMI,UAAU/C,OAAS6gD,EAAOl2C,OACrCy2C,GAAcriD,EAAK8hD,EAAOl2C,MAAOk2C,EAAOG,KAAM99C,EAAOD,IACrDJ,EAAKW,SAAS,iBAAiB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAM0rC,EAAS,EAAG,iBACvE5pD,EAAOuoD,SAAWvoD,EAAOqwB,QAAUnS,EAAKs6C,YAAYkE,+BAH1D,CAOA,IAEI/9C,EAAI4Y,EAAaolC,EAAYC,EAF7BC,EAASX,EAAOl2C,MAAO82C,EAAOZ,EAAOG,KAGzC,GAAI99C,EAAMo0B,WAAWr0B,IAAQC,EAAMpX,OAAO2V,cACxC,GAAIyB,EAAMvD,KAAOsD,EAAItD,IAGfhb,EAAOioD,IAAMjoD,EAAOkoD,YAAc,IAA4B,GAAtB3pC,EAAMwY,eAChD7Y,EAAKs6C,YAAYkE,2BACjBp6C,YAAW,WAAc,OAAO+2C,GAAen7C,KAAU,KAE3DS,EAAKT,EAAKF,MAAMW,GAAGpgB,OAAOs+D,EAAQC,GAClCvlC,EAAcnd,EAAIE,QAAQ4hD,EAAOl2C,OAAOssB,YAAYl4B,EAAIE,QAAQ4hD,EAAOG,YAClE,GACLH,EAAOG,MAAQH,EAAOI,OAASM,EAASxiD,EAAIE,QAAQ4hD,EAAOl2C,UAC1D22C,EAAaI,GAAax+C,EAAMpX,OAAOuT,QAAQwe,IAAI3a,EAAMwY,aAAczY,EAAIyY,cACjD6lC,EAAOz1D,OAAOuT,QAAQwe,IAAI0jC,EAAO7lC,aAAcmlC,EAAOG,KAAOO,EAAO52C,WAE/FrH,EAAKT,EAAKF,MAAMW,GACO,OAAnBg+C,EAAW5+D,KAAiB4gB,EAAGia,QAAQikC,EAAQC,EAAMH,EAAWhmC,MAC7DhY,EAAG+a,WAAWmjC,EAAQC,EAAMH,EAAWhmC,WACzC,GAAIpY,EAAMpX,OAAOnF,MAAMuc,EAAM7a,SAASu1B,QAAU1a,EAAM7a,SAAW4a,EAAI5a,SAAW4a,EAAIizB,WAAa,EAAI,GAAI,CAE9G,IAAI3wC,EAAO2d,EAAMpX,OAAOinC,YAAY7vB,EAAMwY,aAAczY,EAAIyY,cAC5D,GAAI7Y,EAAKW,SAAS,mBAAmB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAM2+C,EAAQC,EAAMl8D,MAAa,OAC9F+d,EAAKT,EAAKF,MAAMW,GAAGsnC,WAAWrlD,EAAMi8D,EAAQC,GAMhD,GAFKn+C,IACDA,EAAKT,EAAKF,MAAMW,GAAG/e,QAAQi9D,EAAQC,EAAM32B,EAAM/rB,IAAI9P,MAAM4xD,EAAOl2C,MAAQmgB,EAAM9gB,KAAM62C,EAAOI,KAAOn2B,EAAM9gB,QACxG8gB,EAAMhoB,IAAK,CACb,IAAI6+C,EAAQ11B,GAAiBppB,EAAMS,EAAGvE,IAAK+rB,EAAMhoB,KAC7C6+C,GAASr+C,EAAGC,aAAao+C,GAE3BzlC,GAAe5Y,EAAGqlC,YAAYzsB,GAClCrZ,EAAKD,SAASU,EAAGmK,oBAGnB,SAASwe,GAAiBppB,EAAM9D,EAAK6iD,GACnC,OAAI1nD,KAAK0Q,IAAIg3C,EAAU5hD,OAAQ4hD,EAAU1iD,MAAQH,EAAIM,QAAQysB,KAAe,KACrEiyB,GAAiBl7C,EAAM9D,EAAIE,QAAQ2iD,EAAU5hD,QAASjB,EAAIE,QAAQ2iD,EAAU1iD,OAOrF,SAASwiD,GAAa5tB,EAAKqX,GAGzB,IAFA,IAC2CzoD,EAAM44B,EAAMjW,EADnDw8C,EAAW/tB,EAAIvgC,WAAW6nB,MAAO0mC,EAAY3W,EAAK53C,WAAW6nB,MAC7D9N,EAAQu0C,EAAUE,EAAUD,EACvBvzD,EAAI,EAAGA,EAAIuzD,EAAU/7D,OAAQwI,IAAO+e,EAAQw0C,EAAUvzD,GAAG+lC,cAAchnB,GAChF,IAAK,IAAImB,EAAM,EAAGA,EAAMozC,EAAS97D,OAAQ0oB,IAASszC,EAAUF,EAASpzC,GAAK6lB,cAAcytB,GACxF,GAAoB,GAAhBz0C,EAAMvnB,QAAiC,GAAlBg8D,EAAQh8D,OAC/Bu1B,EAAOhO,EAAM,GACb5qB,EAAO,MACP2iB,EAAS,SAAUtgB,GAAQ,OAAOA,EAAKu2B,KAAKA,EAAKwC,SAAS/4B,EAAKq2B,aAC1D,IAAoB,GAAhB9N,EAAMvnB,QAAiC,GAAlBg8D,EAAQh8D,OAKtC,OAAO,KAJPu1B,EAAOymC,EAAQ,GACfr/D,EAAO,SACP2iB,EAAS,SAAUtgB,GAAQ,OAAOA,EAAKu2B,KAAKA,EAAKgZ,cAAcvvC,EAAKq2B,SAKtE,IADA,IAAIrL,EAAU,GACLrB,EAAM,EAAGA,EAAMy8B,EAAKlqC,WAAYyN,IAASqB,EAAQ9pB,KAAKof,EAAO8lC,EAAKxkD,MAAM+nB,KACjF,GAAI/P,EAAiB+zB,SAAS1oB,KAAK+F,GAASvQ,GAAGs0B,GAAQ,MAAO,CAACxY,KAAMA,EAAM54B,KAAMA,GAGnF,SAAS0+D,GAAcY,EAAKr3C,EAAO/gB,EAAKq4D,EAAWC,GACjD,IAAKD,EAAUn2D,OAAOmU,aAElBrW,EAAM+gB,GAASu3C,EAAQviD,IAAMsiD,EAAUtiD,KAEvCwiD,GAAsBF,GAAW,GAAM,GAASC,EAAQviD,IACxD,OAAO,EAEX,IAAIqD,EAASg/C,EAAI/iD,QAAQ0L,GAEzB,GAAI3H,EAAO0Y,aAAe1Y,EAAOlX,OAAOuT,QAAQysB,OAAS9oB,EAAOlX,OAAOmU,YACnE,OAAO,EACX,IAAImiD,EAAQJ,EAAI/iD,QAAQkjD,GAAsBn/C,GAAQ,GAAM,IAE5D,SAAKo/C,EAAMt2D,OAAOmU,aAAemiD,EAAMziD,IAAM/V,GACzCu4D,GAAsBC,GAAO,GAAM,GAASx4D,IAIzCq4D,EAAUn2D,OAAOuT,QAAQwe,IAAIokC,EAAUvmC,cAAclc,GAAG4iD,EAAMt2D,OAAOuT,SAG9E,SAAS8iD,GAAsBrjD,EAAMujD,EAASC,GAC5C,IAAIvhD,EAAQjC,EAAKiC,MAAOnX,EAAMy4D,EAAUvjD,EAAKlV,MAAQkV,EAAKa,IAC1D,MAAOoB,EAAQ,IAAMshD,GAAWvjD,EAAKkC,WAAWD,IAAUjC,EAAK/Z,KAAKgc,GAAOE,YACzEF,IACAnX,IACAy4D,GAAU,EAEZ,GAAIC,EAAS,CACX,IAAIzhD,EAAO/B,EAAK/Z,KAAKgc,GAAOG,WAAWpC,EAAKkC,WAAWD,IACvD,MAAOF,IAASA,EAAKsyB,OACnBtyB,EAAOA,EAAKtN,WACZ3J,IAGJ,OAAOA,EAGT,SAASk3D,GAAS9lD,EAAGC,EAAG0E,EAAK8gD,EAAcC,GACzC,IAAI/1C,EAAQ3P,EAAE62B,cAAc52B,EAAG0E,GAC/B,GAAa,MAATgL,EAAiB,OAAO,KAC5B,IAAIjH,EAAM1I,EAAEm3B,YAAYl3B,EAAG0E,EAAM3E,EAAE8wB,KAAMnsB,EAAM1E,EAAE6wB,MAC7Ck1B,EAAOt9C,EAAI1I,EACXimD,EAAOv9C,EAAIzI,EACf,GAAqB,OAAjBylD,EAAwB,CAC1B,IAAI6B,EAASroD,KAAK0Q,IAAI,EAAGD,EAAQzQ,KAAK8Q,IAAIg2C,EAAMC,IAChDR,GAAgBO,EAAOuB,EAAS53C,EAElC,GAAIq2C,EAAOr2C,GAAS3P,EAAE8wB,KAAO7wB,EAAE6wB,KAAM,CACnC,IAAI02B,EAAO/B,GAAgB91C,GAAS81C,GAAgBO,EAAOr2C,EAAQ81C,EAAe,EAClF91C,GAAS63C,EACTvB,EAAOt2C,GAASs2C,EAAOD,GACvBA,EAAOr2C,OACF,GAAIs2C,EAAOt2C,EAAO,CACvB,IAAI83C,EAAShC,GAAgB91C,GAAS81C,GAAgBQ,EAAOt2C,EAAQ81C,EAAe,EACpF91C,GAAS83C,EACTzB,EAAOr2C,GAASq2C,EAAOC,GACvBA,EAAOt2C,EAET,MAAO,CAACA,MAAOA,EAAOq2C,KAAMA,EAAMC,KAAMA,GAG1C,SAASyB,GAAsB7/C,EAAM5T,GACnC,IAAI0H,EAAU,GACV0I,EAAUpQ,EAAMoQ,QAChB4e,EAAYhvB,EAAMgvB,UAClBC,EAAUjvB,EAAMivB,QACpB,MAAOD,EAAY,GAAKC,EAAU,GAA2B,GAAtB7e,EAAQ4B,YAAoD,GAAjC5B,EAAQ9L,WAAW0N,WAAiB,CACpGgd,IACAC,IACA,IAAIn5B,EAAOsa,EAAQ9L,WACnBoD,EAAQ1Q,KAAKlB,EAAKrC,KAAKd,KAAMmD,EAAKrC,KAAKu3C,mBAAqBl1C,EAAKi0B,MAAQ,MACzE3Z,EAAUta,EAAKsa,QAGjB,IAAIsjD,EAAa9/C,EAAKW,SAAS,wBAA0B7E,EAAiB6nC,cAAc3b,WAAWhoB,EAAKF,MAAM8b,QAC1G1f,EAAM6jD,KAAehgB,EAAO7jC,EAAIzM,cAAc,OAClDswC,EAAKt8B,YAAYq8C,EAAWr2B,kBAAkBjtB,EAAS,CAACnM,SAAU6L,KAElE,IAAkC06C,EAA9BlmD,EAAaqvC,EAAKrvC,WACtB,MAAOA,GAAqC,GAAvBA,EAAWE,WAAkBgmD,EAAYoJ,GAAQtvD,EAAWF,SAASpG,gBAAiB,CACzG,IAAK,IAAIsB,EAAIkrD,EAAU1zD,OAAS,EAAGwI,GAAK,EAAGA,IAAK,CAC9C,IAAIu0D,EAAU/jD,EAAIzM,cAAcmnD,EAAUlrD,IAC1C,MAAOq0C,EAAKrvC,WAAcuvD,EAAQx8C,YAAYs8B,EAAKrvC,YACnDqvC,EAAKt8B,YAAYw8C,GAEnBvvD,EAAaqvC,EAAKrvC,WAGhBA,GAAqC,GAAvBA,EAAWE,UACzBF,EAAW8zC,aAAa,gBAAkBppB,EAAY,IAAMC,EAAU,IAAO93B,KAAKC,UAAUsQ,IAEhG,IAAIpR,EAAOsd,EAAKW,SAAS,2BAA2B,SAAUovB,GAAK,OAAOA,EAAE3jC,OACxEA,EAAMoQ,QAAQ0zB,YAAY,EAAG9jC,EAAMoQ,QAAQysB,KAAM,QAErD,MAAO,CAAC5mB,IAAK09B,EAAMr9C,KAAMA,GAK3B,SAASw9D,GAAmBlgD,EAAMtd,EAAMgW,EAAMynD,EAAWzc,GACvD,IAAIrhC,EAA8CjW,EAAzCg0D,EAAS1c,EAASz6C,OAAOpJ,KAAK2d,KAAKpO,KAC5C,IAAKsJ,IAAShW,EAAQ,OAAO,KAC7B,IAAI29D,EAAS39D,IAASy9D,GAAaC,IAAW1nD,GAC9C,GAAI2nD,EAAQ,CAEV,GADArgD,EAAKW,SAAS,uBAAuB,SAAUovB,GAAKrtC,EAAOqtC,EAAErtC,MACzD09D,EAAU,OAAO,IAAItkD,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAKnH,EAAKF,MAAM8b,OAAOl5B,KAAKA,IAAQ,EAAG,GACjH,IAAI49D,EAAStgD,EAAKW,SAAS,uBAAuB,SAAUovB,GAAK,OAAOA,EAAErtC,EAAMghD,MAC5E4c,EACFl0D,EAAQk0D,GAERj+C,EAAMhS,SAASZ,cAAc,OAC7B/M,EAAKqlC,OAAO7+B,MAAM,iBAAiBtI,SAAQ,SAAU0S,GACnD+O,EAAIoB,YAAYpT,SAASZ,cAAc,MAAM2J,YAAc9F,WAI/D0M,EAAKW,SAAS,uBAAuB,SAAUovB,GAAKr3B,EAAOq3B,EAAEr3B,MAC7D2J,EAAMk+C,GAAS7nD,GAGjB,IAAI8nD,EAAcn+C,GAAOA,EAAIkgC,cAAc,mBACvCke,EAAYD,GAAe,oBAAoBp7D,KAAKo7D,EAAYxzB,aAAa,kBACjF,IAAK5gC,EAAO,CACV,IAAI4zC,EAAShgC,EAAKW,SAAS,oBAAsBX,EAAKW,SAAS,cAAgB7E,EAAiBogC,UAAUlU,WAAWhoB,EAAKF,MAAM8b,QAChIxvB,EAAQ4zC,EAAOxD,WAAWn6B,EAAK,CAACs9B,sBAAuB0gB,IAAUI,GAAY3sD,QAAS4vC,IAQxF,OALIt3C,EADAq0D,EACQC,GAAWC,GAAWv0D,GAAQq0D,EAAU,IAAKA,EAAU,IAAKA,EAAU,IAEtE3kD,EAAiBW,MAAMk3B,QAAQitB,GAAkBx0D,EAAMoQ,QAASknC,IAAW,GAEvF1jC,EAAKW,SAAS,mBAAmB,SAAUovB,GAAK3jC,EAAQ2jC,EAAE3jC,MACnDA,EAWT,SAASw0D,GAAkB/lC,EAAU6oB,GACnC,GAAI7oB,EAASzc,WAAa,EAAK,OAAOyc,EAsBtC,IArBA,IAAIse,EAAO,SAAWl7B,GACpB,IAAIhV,EAASy6C,EAASxhD,KAAK+b,GACvB1Y,EAAQ0D,EAAO0U,eAAe+lC,EAASl+C,MAAMyY,IAC7C4iD,OAAW,EAAU/+D,EAAS,GAelC,GAdA+4B,EAASj6B,SAAQ,SAAUsB,GACzB,GAAKJ,EAAL,CACA,IAA0Cg/D,EAAtC/gB,EAAOx6C,EAAMsyC,aAAa31C,EAAKrC,MACnC,IAAKkgD,EAAQ,OAAOj+C,EAAS,KAC7B,GAAIg/D,EAASh/D,EAAOoB,QAAU29D,EAAS39D,QAAU69D,GAAahhB,EAAM8gB,EAAU3+D,EAAMJ,EAAOA,EAAOoB,OAAS,GAAI,GAC7GpB,EAAOA,EAAOoB,OAAS,GAAK49D,MACvB,CACDh/D,EAAOoB,SAAUpB,EAAOA,EAAOoB,OAAS,GAAK89D,GAAWl/D,EAAOA,EAAOoB,OAAS,GAAI29D,EAAS39D,SAChG,IAAI+9D,EAAUC,GAAah/D,EAAM69C,GACjCj+C,EAAOsB,KAAK69D,GACZ17D,EAAQA,EAAMywC,UAAUirB,EAAQphE,KAAMohE,EAAQ9qC,OAC9C0qC,EAAW9gB,OAGXj+C,EAAU,MAAO,CAAEq/D,EAAGrlD,EAAiB+zB,SAAS1oB,KAAKrlB,KAGlDmc,EAAIylC,EAASxlC,MAAOD,GAAK,EAAGA,IAAK,CACxC,IAAImjD,EAAWjoB,EAAMl7B,GAErB,GAAKmjD,EAAW,OAAOA,EAASD,EAElC,OAAOtmC,EAGT,SAASqmC,GAAah/D,EAAM69C,EAAM54B,QAClB,IAATA,IAAkBA,EAAO,GAE9B,IAAK,IAAIzb,EAAIq0C,EAAK78C,OAAS,EAAGwI,GAAKyb,EAAMzb,IACrCxJ,EAAO69C,EAAKr0C,GAAGhN,OAAO,KAAMod,EAAiB+zB,SAAS1oB,KAAKjlB,IAC/D,OAAOA,EAKT,SAAS6+D,GAAahhB,EAAM8gB,EAAU3+D,EAAMm/D,EAASnjD,GACnD,GAAIA,EAAQ6hC,EAAK78C,QAAUgb,EAAQ2iD,EAAS39D,QAAU68C,EAAK7hC,IAAU2iD,EAAS3iD,GAAQ,CACpF,IAAImxB,EAAQ0xB,GAAahhB,EAAM8gB,EAAU3+D,EAAMm/D,EAAQ9iD,UAAWL,EAAQ,GAC1E,GAAImxB,EAAS,OAAOgyB,EAAQ1tC,KAAK0tC,EAAQ7kD,QAAQk0B,aAAa2wB,EAAQjjD,WAAa,EAAGixB,IACtF,IAAI9pC,EAAQ87D,EAAQ1jD,eAAe0jD,EAAQjjD,YAC3C,GAAI7Y,EAAMywC,UAAU93B,GAAS6hC,EAAK78C,OAAS,EAAIhB,EAAKrC,KAAOkgD,EAAK7hC,EAAQ,IACpE,OAAOmjD,EAAQ1tC,KAAK0tC,EAAQ7kD,QAAQ8J,OAAOxK,EAAiB+zB,SAAS1oB,KAAK+5C,GAAah/D,EAAM69C,EAAM7hC,EAAQ,OAInH,SAAS8iD,GAAW9+D,EAAMgc,GACxB,GAAa,GAATA,EAAc,OAAOhc,EACzB,IAAI24B,EAAW34B,EAAKsa,QAAQk0B,aAAaxuC,EAAKkc,WAAa,EAAG4iD,GAAW9+D,EAAKqc,UAAWL,EAAQ,IAC7F4hC,EAAO59C,EAAKyb,eAAezb,EAAKkc,YAAYk5B,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,GAC5F,OAAOxa,EAAKyxB,KAAKkH,EAASvU,OAAOw5B,IAGnC,SAASwhB,GAAWzmC,EAAU0Q,EAAMpkB,EAAMC,EAAIlJ,EAAOmd,GACnD,IAAIn5B,EAAOqpC,EAAO,EAAI1Q,EAASnqB,WAAamqB,EAAStc,UAAW8wB,EAAQntC,EAAKsa,QAK7E,OAJI0B,EAAQkJ,EAAK,IAAKioB,EAAQiyB,GAAWjyB,EAAO9D,EAAMpkB,EAAMC,EAAIlJ,EAAQ,EAAGmd,IACvEnd,GAASiJ,IACTkoB,EAAQ9D,EAAO,EAAIrpC,EAAKyb,eAAe,GAAG25B,WAAWjI,EAAOxU,EAASzc,WAAa,GAAKid,GAAWnd,GAAOoI,OAAO+oB,GAC9GA,EAAM/oB,OAAOpkB,EAAKyb,eAAezb,EAAKkc,YAAYk5B,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,KAC7Fme,EAAS6V,aAAanF,EAAO,EAAI,EAAI1Q,EAASzc,WAAa,EAAGlc,EAAKyxB,KAAK0b,IAGjF,SAASsxB,GAAWv0D,EAAOgvB,EAAWC,GAKpC,OAJID,EAAYhvB,EAAMgvB,YAClBhvB,EAAQ,IAAI0P,EAAiBW,MAAM6kD,GAAWl1D,EAAMoQ,SAAU,EAAG4e,EAAWhvB,EAAMgvB,UAAW,EAAGhvB,EAAMivB,SAAUD,EAAWhvB,EAAMivB,UACjIA,EAAUjvB,EAAMivB,UAChBjvB,EAAQ,IAAI0P,EAAiBW,MAAM6kD,GAAWl1D,EAAMoQ,QAAS,EAAG6e,EAASjvB,EAAMivB,QAAS,EAAG,GAAIjvB,EAAMgvB,UAAWC,IAC7GjvB,EAMT,IAAI4zD,GAAU,CAACuB,MAAO,CAAC,SAAUC,SAAU,CAAC,SAAUC,IAAK,CAAC,QAAS,YACpDhhD,GAAI,CAAC,QAAS,SAAUihD,GAAI,CAAC,QAAS,QAAS,MAAOC,GAAI,CAAC,QAAS,QAAS,OAE1FC,GAAe,KACnB,SAAS7B,KACP,OAAO6B,KAAiBA,GAAevxD,SAASwxD,eAAeC,mBAAmB,UAGpF,SAASvB,GAAS7nD,GAChB,IAAIqpD,EAAQ,qBAAqB38D,KAAKsT,GAClCqpD,IAASrpD,EAAOA,EAAKtM,MAAM21D,EAAM,GAAG7+D,SACxC,IAC+D68C,EAD3DsO,EAAM0R,KAActwD,cAAc,OAClCuyD,EAAW,oCAAoC58D,KAAKsT,GAAawF,EAAQ,GACzE6hC,EAAOiiB,GAAYhC,GAAQgC,EAAS,GAAG53D,kBACzCsO,EAAOqnC,EAAKh7C,KAAI,SAAUsgB,GAAK,MAAO,IAAMA,EAAI,OAAQphB,KAAK,IAAMyU,EAAOqnC,EAAKh7C,KAAI,SAAUsgB,GAAK,MAAO,KAAOA,EAAI,OAAQ3T,UAAUzN,KAAK,IAC3Iia,EAAQ6hC,EAAK78C,QAEfmrD,EAAIz+C,UAAY8I,EAChB,IAAK,IAAIhN,EAAI,EAAGA,EAAIwS,EAAOxS,IAAO2iD,EAAMA,EAAI39C,WAC5C,OAAO29C,EAGT,SAASqS,GAAWt0D,EAAO0H,GACzB,IAAK1H,EAAM68B,KAAQ,OAAO78B,EAC1B,IAAmDqb,EAA/CmU,EAASxvB,EAAMoQ,QAAQ9L,WAAW7Q,KAAK+7B,OAC3C,IAAMnU,EAAQlkB,KAAK0kC,MAAMn0B,GACzB,MAAMsO,GAAK,OAAOhW,EAIlB,IAHA,IAAIoQ,EAAUpQ,EAAMoQ,QAChB4e,EAAYhvB,EAAMgvB,UAClBC,EAAUjvB,EAAMivB,QACX3vB,EAAI+b,EAAMvkB,OAAS,EAAGwI,GAAK,EAAGA,GAAK,EAAG,CAC7C,IAAI7L,EAAO+7B,EAAOd,MAAMrT,EAAM/b,IAC9B,IAAK7L,GAAQA,EAAKu3C,mBAAsB,MACxC56B,EAAUV,EAAiB+zB,SAAS1oB,KAAKtnB,EAAKnB,OAAO+oB,EAAM/b,EAAI,GAAI8Q,IACnE4e,IAAaC,IAEf,OAAO,IAAIvf,EAAiBW,MAAMD,EAAS4e,EAAWC,GAGxD,IAAI4mC,GAAiB,CAACC,WAAW,EAAMC,eAAe,EAAM7wD,YAAY,EAAM8wD,SAAS,EAAMC,uBAAuB,GAEhHC,GAAcxgE,EAAOioD,IAAMjoD,EAAOkoD,YAAc,GAEhDuY,GAAiB,WACnBjhE,KAAKkyD,WAAalyD,KAAKmyD,aAAenyD,KAAKsvD,UAAYtvD,KAAKwvD,YAAc,MAG5EyR,GAAenuD,UAAU9T,IAAM,SAAc2f,GAC3C3e,KAAKkyD,WAAavzC,EAAIuzC,WAAYlyD,KAAKmyD,aAAexzC,EAAIwzC,aAC1DnyD,KAAKsvD,UAAY3wC,EAAI2wC,UAAWtvD,KAAKwvD,YAAc7wC,EAAI6wC,aAGzDyR,GAAenuD,UAAUuI,GAAK,SAAasD,GACzC,OAAOA,EAAIuzC,YAAclyD,KAAKkyD,YAAcvzC,EAAIwzC,cAAgBnyD,KAAKmyD,cACnExzC,EAAI2wC,WAAatvD,KAAKsvD,WAAa3wC,EAAI6wC,aAAexvD,KAAKwvD,aAG/D,IAAI0R,GAAc,SAAqBxiD,EAAMyiD,GAC3C,IAAI5gD,EAASvgB,KAEbA,KAAK0e,KAAOA,EACZ1e,KAAKmhE,gBAAkBA,EACvBnhE,KAAKohE,MAAQ,GACbphE,KAAKqhE,cAAe,EACpBrhE,KAAKshE,SAAWznD,OAAO0nD,kBACrB,IAAI1nD,OAAO0nD,kBAAiB,SAAUC,GACpC,IAAK,IAAIp3D,EAAI,EAAGA,EAAIo3D,EAAU5/D,OAAQwI,IAAOmW,EAAO6gD,MAAMt/D,KAAK0/D,EAAUp3D,IAKrE5J,EAAOioD,IAAMjoD,EAAOkoD,YAAc,IAAM8Y,EAAUzf,MACpD,SAAUp8C,GAAK,MAAiB,aAAVA,EAAEpH,MAAuBoH,EAAE87D,aAAa7/D,QAC/C,iBAAV+D,EAAEpH,MAA2BoH,EAAEutD,SAAStxD,OAAS+D,EAAEqd,OAAOzT,UAAU3N,UACvE2e,EAAOmhD,YAEPnhD,EAAOohD,WAEf3hE,KAAK4hE,iBAAmB,IAAIX,GACxBD,KACFhhE,KAAK6hE,WAAa,SAAU/gD,GAC1BP,EAAO6gD,MAAMt/D,KAAK,CAACkhB,OAAQlC,EAAEkC,OAAQzkB,KAAM,gBAAiB20D,SAAUpyC,EAAEghD,YACxEvhD,EAAOmhD,cAGX1hE,KAAK+hE,kBAAoB/hE,KAAK+hE,kBAAkB/oD,KAAKhZ,MACrDA,KAAKgiE,6BAA8B,GAGrCd,GAAYpuD,UAAU4uD,UAAY,WAC9B,IAAInhD,EAASvgB,KAEVA,KAAKqhE,eACRrhE,KAAKqhE,cAAe,EACpBxnD,OAAOiJ,YAAW,WAAcvC,EAAO8gD,cAAe,EAAO9gD,EAAOohD,UAAY,MAIpFT,GAAYpuD,UAAU0T,MAAQ,WACxBxmB,KAAKshE,UACLthE,KAAKshE,SAASW,QAAQjiE,KAAK0e,KAAKqC,IAAK4/C,IACrCK,IACAhhE,KAAK0e,KAAKqC,IAAIjH,iBAAiB,2BAA4B9Z,KAAK6hE,YACpE7hE,KAAKk6D,oBAGPgH,GAAYpuD,UAAUggD,KAAO,WACzB,IAAIvyC,EAASvgB,KAEf,GAAIA,KAAKshE,SAAU,CACjB,IAAIY,EAAOliE,KAAKshE,SAASa,cACzB,GAAID,EAAKtgE,OAAQ,CACf,IAAK,IAAIwI,EAAI,EAAGA,EAAI83D,EAAKtgE,OAAQwI,IAAOmW,EAAO6gD,MAAMt/D,KAAKogE,EAAK93D,IAC/DyP,OAAOiJ,YAAW,WAAc,OAAOvC,EAAOohD,UAAY,IAE5D3hE,KAAKshE,SAASc,aAEZpB,IAAehhE,KAAK0e,KAAKqC,IAAIE,oBAAoB,2BAA4BjhB,KAAK6hE,YACtF7hE,KAAKi6D,uBAGPiH,GAAYpuD,UAAUonD,iBAAmB,WACvCl6D,KAAK0e,KAAKqC,IAAI4/B,cAAc7mC,iBAAiB,kBAAmB9Z,KAAK+hE,oBAGvEb,GAAYpuD,UAAUmnD,oBAAsB,WAC1Cj6D,KAAK0e,KAAKqC,IAAI4/B,cAAc1/B,oBAAoB,kBAAmBjhB,KAAK+hE,oBAG1Eb,GAAYpuD,UAAUoqD,yBAA2B,WAC7C,IAAI38C,EAASvgB,KAEfA,KAAKgiE,6BAA8B,EACnCl/C,YAAW,WAAc,OAAOvC,EAAOyhD,6BAA8B,IAAU,KAGjFd,GAAYpuD,UAAUivD,kBAAoB,WACxC,GAAKzG,GAAqBt7D,KAAK0e,MAA/B,CACA,GAAI1e,KAAKgiE,4BAA+B,OAAOnI,GAAe75D,KAAK0e,MAInE,GAAIle,EAAOioD,IAAMjoD,EAAOkoD,YAAc,KAAO1oD,KAAK0e,KAAKF,MAAMI,UAAUxD,MAAO,CAC5E,IAAIuD,EAAM3e,KAAK0e,KAAK1b,KAAKksD,eAEzB,GAAIvwC,EAAI2wC,WAAajG,EAAqB1qC,EAAI2wC,UAAW3wC,EAAI6wC,YAAa7wC,EAAIuzC,WAAYvzC,EAAIwzC,cAC1F,OAAOnyD,KAAK0hE,YAElB1hE,KAAK2hE,UAGPT,GAAYpuD,UAAUmmD,gBAAkB,WACtCj5D,KAAK4hE,iBAAiB5iE,IAAIgB,KAAK0e,KAAK1b,KAAKksD,iBAG3CgS,GAAYpuD,UAAUuvD,sBAAwB,SAAgC1jD,GAC5E,GAAsB,GAAlBA,EAAIurC,WAAmB,OAAO,EAClC,IAAIoY,EAAY3jD,EAAIwrC,WAAW,GAAGoY,wBAC9B3b,EAAO5mD,KAAK0e,KAAKkqB,QAAQukB,YAAYmV,GACzC,OAAO1b,GAAQA,EAAKyL,eAAe,CAAC9zD,KAAM,YAAaykB,OAA8B,GAAtBs/C,EAAUhzD,SAAgBgzD,EAAUpwD,WAAaowD,KAGlHpB,GAAYpuD,UAAU6uD,MAAQ,WAC1B,IAAIphD,EAASvgB,KAEf,GAAKA,KAAK0e,KAAKkqB,UAAW5oC,KAAKqhE,aAA/B,CACA,IAAIG,EAAYxhE,KAAKshE,SAAWthE,KAAKshE,SAASa,cAAgB,GAC1DniE,KAAKohE,MAAMx/D,SACb4/D,EAAYxhE,KAAKohE,MAAM99D,OAAOk+D,GAC9BxhE,KAAKohE,MAAMx/D,OAAS,GAGtB,IAAI+c,EAAM3e,KAAK0e,KAAK1b,KAAKksD,eACrBiN,GAAUn8D,KAAKgiE,8BAAgChiE,KAAK4hE,iBAAiBvmD,GAAGsD,IAAQw7C,GAAan6D,KAAK0e,QAAU1e,KAAKqiE,sBAAsB1jD,GAEvIkH,GAAQ,EAAGC,GAAM,EAAGk2C,GAAW,EACnC,GAAIh8D,KAAK0e,KAAKY,SACZ,IAAK,IAAIlV,EAAI,EAAGA,EAAIo3D,EAAU5/D,OAAQwI,IAAK,CACzC,IAAIylD,EAAYtvC,EAAOiiD,iBAAiBhB,EAAUp3D,IAC9CylD,IACFhqC,EAAOA,EAAO,EAAIgqC,EAAUhqC,KAAO9P,KAAK8Q,IAAIgpC,EAAUhqC,KAAMA,GAC5DC,EAAKA,EAAK,EAAI+pC,EAAU/pC,GAAK/P,KAAK0Q,IAAIopC,EAAU/pC,GAAIA,GAChD+pC,EAAUmM,WAAaz7C,EAAO7B,KAAK0W,YAAa4mC,GAAW,KAIjEn2C,GAAQ,GAAKs2C,KACXt2C,GAAQ,GAAK7lB,KAAK0e,KAAKkqB,QAAQ2pB,UAAU1sC,EAAMC,GACnD9lB,KAAKmhE,gBAAgBt7C,EAAMC,EAAIk2C,GAC3Bh8D,KAAK0e,KAAKkqB,QAAQ2nB,MAASvwD,KAAK0e,KAAKunB,YAAYjmC,KAAK0e,KAAKF,OACrDxe,KAAK4hE,iBAAiBvmD,GAAGsD,IAAQk7C,GAAe75D,KAAK0e,SAInEwiD,GAAYpuD,UAAU0vD,iBAAmB,SAA2BvP,GAClE,IAAIrM,EAAO5mD,KAAK0e,KAAKkqB,QAAQukB,YAAY8F,EAAIjwC,QAC7C,GAAgB,cAAZiwC,EAAI10D,OACHqoD,GAAQ5mD,KAAK0e,KAAKkqB,SAAgC,mBAArBqqB,EAAIwP,eAEX,SAArBxP,EAAIwP,gBAA6BxP,EAAIC,WAAaD,EAAIjwC,OAAO0oB,aAAa,UAC5E,OAAO,KACX,IAAKkb,GAAQA,EAAKyL,eAAeY,GAAQ,OAAO,KAEhD,GAAgB,aAAZA,EAAI10D,KAAqB,CAC3B,IAAIyoD,EAAOiM,EAAI/S,gBAAiBxjC,EAAOu2C,EAAI5jD,YAC3C,GAAI7O,EAAOioD,IAAMjoD,EAAOkoD,YAAc,IAAMuK,EAAIyP,WAAW9gE,OAGzD,IAAK,IAAIwI,EAAI,EAAGA,EAAI6oD,EAAIyP,WAAW9gE,OAAQwI,IAAK,CAC9C,IAAImV,EAAM0zC,EAAIyP,WAAWt4D,GACnB81C,EAAkB3gC,EAAI2gC,gBACtB7wC,EAAckQ,EAAIlQ,cACnB6wC,GAAmBj4C,MAAM6K,UAAU+lB,QAAQ9oB,KAAKkjD,EAAIyP,WAAYxiB,GAAmB,KAAK8G,EAAO9G,KAC/F7wC,GAAepH,MAAM6K,UAAU+lB,QAAQ9oB,KAAKkjD,EAAIyP,WAAYrzD,GAAe,KAAKqN,EAAOrN,GAGhG,IAAIqiD,EAAa1K,GAAQA,EAAK90C,YAAc+gD,EAAIjwC,OAC1CmmC,EAASnC,GAAQ,EAAI,EACvBnhC,EAAO+gC,EAAKqK,gBAAgBgC,EAAIjwC,OAAQ0uC,GAAa,GACrDC,EAAWj1C,GAAQA,EAAKxK,YAAc+gD,EAAIjwC,OACxCmmC,EAASzsC,GAAQu2C,EAAIjwC,OAAOonB,WAAWxoC,OACzCkkB,EAAK8gC,EAAKqK,gBAAgBgC,EAAIjwC,OAAQ2uC,EAAU,GACpD,MAAO,CAAC9rC,KAAMA,EAAMC,GAAIA,GACnB,MAAgB,cAAZmtC,EAAI10D,KACN,CAACsnB,KAAM+gC,EAAKmH,WAAanH,EAAKoH,OAAQloC,GAAI8gC,EAAK6J,SAAW7J,EAAKoH,QAE/D,CACLnoC,KAAM+gC,EAAKmH,WACXjoC,GAAI8gC,EAAK6J,SAKTuL,SAAU/I,EAAIjwC,OAAOzT,WAAa0jD,EAAIC,WAO5C,IAAItyC,GAAW,GACX+hD,GAAe,GAEnB,SAASC,GAAUlkD,GACjBA,EAAKkT,UAAW,EAChBlT,EAAKmkD,UAAY,KACjBnkD,EAAKi9C,YAAc,KACnBj9C,EAAK+9C,gBAAkB,EACvB/9C,EAAKokD,UAAY,CAACr6C,KAAM,EAAG/kB,EAAG,EAAGkoD,EAAG,EAAGrtD,KAAM,IAC7CmgB,EAAKw9C,oBAAsB,KAC3Bx9C,EAAKu9C,kBAAoB,EAEzBv9C,EAAK0W,WAAY,EACjB1W,EAAKqkD,iBAAmB,KACxBrkD,EAAKy2C,iBAAmB,GACxBz2C,EAAKskD,oBAAsB,IAE3BtkD,EAAKs6C,YAAc,IAAIkI,GAAYxiD,GAAM,SAAUmH,EAAMC,EAAIk2C,GAAY,OAAOD,GAAcr9C,EAAMmH,EAAMC,EAAIk2C,MAC9Gt9C,EAAKs6C,YAAYxyC,QAEjB9H,EAAKq+C,eAAiB,EAEtBr+C,EAAKukD,cAAgB9jE,OAAO/B,OAAO,MACnC,IAAIy6C,EAAO,SAAWroC,GACpB,IAAIqR,EAAUD,GAASpR,GACvBkP,EAAKqC,IAAIjH,iBAAiBtK,EAAOkP,EAAKukD,cAAczzD,GAAS,SAAUA,IACjE0zD,GAAmBxkD,EAAMlP,IAAW2zD,GAAiBzkD,EAAMlP,KAC1DkP,EAAKY,UAAc9P,EAAMjR,QAAQokE,IAClC9hD,EAAQnC,EAAMlP,MAItB,IAAK,IAAIA,KAASoR,GAAUi3B,EAAMroC,GAI9BhP,EAAOwwB,QAAUtS,EAAKqC,IAAIjH,iBAAiB,SAAS,WAAc,OAAO,QAE7EspD,GAAgB1kD,GAGlB,SAAS2kD,GAAmB3kD,EAAM/J,GAChC+J,EAAKw9C,oBAAsBvnD,EAC3B+J,EAAKu9C,kBAAoBvW,KAAKC,MAGhC,SAAS2d,GAAa5kD,GAEpB,IAAK,IAAIngB,KADTmgB,EAAKs6C,YAAYlG,OACAp0C,EAAKukD,cAClBvkD,EAAKqC,IAAIE,oBAAoB1iB,EAAMmgB,EAAKukD,cAAc1kE,IAC1DskB,aAAanE,EAAKqkD,kBAGpB,SAASK,GAAgB1kD,GACvBA,EAAKW,SAAS,mBAAmB,SAAUkkD,GACzC,IAAK,IAAIhlE,KAAQglE,EAAwB7kD,EAAKukD,cAAc1kE,IACxDmgB,EAAKqC,IAAIjH,iBAAiBvb,EAAMmgB,EAAKukD,cAAc1kE,GAAQ,SAAUiR,GAAS,OAAO2zD,GAAiBzkD,EAAMlP,QAIpH,SAAS2zD,GAAiBzkD,EAAMlP,GAC9B,OAAOkP,EAAKW,SAAS,mBAAmB,SAAUuB,GAChD,IAAIC,EAAUD,EAASpR,EAAMjR,MAC7B,QAAOsiB,IAAUA,EAAQnC,EAAMlP,IAAUA,EAAMg0D,qBAInD,SAASN,GAAmBxkD,EAAMlP,GAChC,IAAKA,EAAMi0D,QAAW,OAAO,EAC7B,GAAIj0D,EAAMg0D,iBAAoB,OAAO,EACrC,IAAK,IAAI5iE,EAAO4O,EAAMwT,OAAQpiB,GAAQ8d,EAAKqC,IAAKngB,EAAOA,EAAKsR,WACxD,IAAKtR,GAAyB,IAAjBA,EAAK0O,UACf1O,EAAKipD,YAAcjpD,EAAKipD,WAAW/pB,UAAUtwB,GAC9C,OAAO,EACb,OAAO,EAGT,SAASk0D,GAAchlD,EAAMlP,GACtB2zD,GAAiBzkD,EAAMlP,KAAUoR,GAASpR,EAAMjR,QAChDmgB,EAAKY,UAAc9P,EAAMjR,QAAQokE,IAClC/hD,GAASpR,EAAMjR,MAAMmgB,EAAMlP,GAoCjC,SAASm0D,GAAYn0D,GAAS,MAAO,CAACiQ,KAAMjQ,EAAMkQ,QAAS7d,IAAK2N,EAAMmQ,SAEtE,SAASikD,GAAOp0D,EAAOq0D,GACrB,IAAIpX,EAAKoX,EAAMngE,EAAI8L,EAAMkQ,QAASokD,EAAKD,EAAMjY,EAAIp8C,EAAMmQ,QACvD,OAAO8sC,EAAKA,EAAKqX,EAAKA,EAAK,IAG7B,SAASC,GAAoBrlD,EAAMslD,EAAUxoD,EAAKoE,EAAQpQ,GACxD,IAAe,GAAXoQ,EAAgB,OAAO,EAQ3B,IAPA,IAAIjF,EAAO+D,EAAKF,MAAM5D,IAAIE,QAAQ8E,GAC9Bi4B,EAAO,SAAWztC,GACpB,GAAIsU,EAAKW,SAAS2kD,GAAU,SAAUv1B,GAAK,OAAOrkC,EAAIuQ,EAAKiC,MAAQ6xB,EAAE/vB,EAAMlD,EAAKb,EAAK8G,UAAW9G,EAAKnT,OAAO4C,GAAIoF,GAAO,GACrEi/B,EAAE/vB,EAAMlD,EAAKb,EAAK/Z,KAAKwJ,GAAIuQ,EAAKnT,OAAO4C,GAAIoF,GAAO,MAChG,MAAO,CAAEqwD,GAAG,IAGTz1D,EAAIuQ,EAAKiC,MAAQ,EAAGxS,EAAI,EAAGA,IAAK,CACvC,IAAI01D,EAAWjoB,EAAMztC,GAErB,GAAK01D,EAAW,OAAOA,EAASD,EAElC,OAAO,EAGT,SAASoE,GAAgBvlD,EAAME,EAAWjK,GACnC+J,EAAKymB,SAAWzmB,EAAK0jB,QAC1B,IAAIjjB,EAAKT,EAAKF,MAAMW,GAAGC,aAAaR,GACtB,WAAVjK,GAAuBwK,EAAGkK,QAAQ,WAAW,GACjD3K,EAAKD,SAASU,GAGhB,SAAS+kD,GAAkBxlD,EAAMkB,GAC/B,IAAe,GAAXA,EAAgB,OAAO,EAC3B,IAAIjF,EAAO+D,EAAKF,MAAM5D,IAAIE,QAAQ8E,GAAShf,EAAO+Z,EAAK8G,UACvD,SAAI7gB,GAAQA,EAAK2c,QAAUjD,EAAiBuF,cAAcC,aAAalf,MACrEqjE,GAAgBvlD,EAAM,IAAIpE,EAAiBuF,cAAclF,GAAO,YACzD,GAKX,SAASwpD,GAAkBzlD,EAAMkB,GAC/B,IAAe,GAAXA,EAAgB,OAAO,EAC3B,IAAgCwkD,EAAcC,EAA1C1lD,EAAMD,EAAKF,MAAMI,UACjBD,aAAerE,EAAiBuF,gBAAiBukD,EAAezlD,EAAI/d,MAGxE,IADA,IAAI+Z,EAAO+D,EAAKF,MAAM5D,IAAIE,QAAQ8E,GACzBxV,EAAIuQ,EAAKiC,MAAQ,EAAGxS,EAAI,EAAGA,IAAK,CACvC,IAAIxJ,EAAOwJ,EAAIuQ,EAAKiC,MAAQjC,EAAK8G,UAAY9G,EAAK/Z,KAAKwJ,GACvD,GAAIkQ,EAAiBuF,cAAcC,aAAalf,GAAO,CAGjDyjE,EAFAD,GAAgBzlD,EAAII,MAAMnC,MAAQ,GAClCxS,GAAKuU,EAAII,MAAMnC,OAASjC,EAAKnT,OAAOmX,EAAII,MAAMnC,MAAQ,IAAM+B,EAAII,MAAMvD,IAC3Db,EAAKnT,OAAOmX,EAAII,MAAMnC,OAEtBjC,EAAKnT,OAAO4C,GAC3B,OAIJ,OAAgB,MAAZi6D,IACFJ,GAAgBvlD,EAAMpE,EAAiBuF,cAAcziB,OAAOshB,EAAKF,MAAM5D,IAAKypD,GAAW,YAChF,GAMX,SAASC,GAAkB5lD,EAAMlD,EAAKoE,EAAQpQ,EAAOkmD,GACnD,OAAOqO,GAAoBrlD,EAAM,gBAAiBlD,EAAKoE,EAAQpQ,IAC7DkP,EAAKW,SAAS,eAAe,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMlD,EAAKhM,QAC/DkmD,EAAayO,GAAkBzlD,EAAMkB,GAAUskD,GAAkBxlD,EAAMkB,IAG5E,SAAS2kD,GAAkB7lD,EAAMlD,EAAKoE,EAAQpQ,GAC5C,OAAOu0D,GAAoBrlD,EAAM,sBAAuBlD,EAAKoE,EAAQpQ,IACnEkP,EAAKW,SAAS,qBAAqB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMlD,EAAKhM,MAG1E,SAASg1D,GAAkB9lD,EAAMlD,EAAKoE,EAAQpQ,GAC5C,OAAOu0D,GAAoBrlD,EAAM,sBAAuBlD,EAAKoE,EAAQpQ,IACnEkP,EAAKW,SAAS,qBAAqB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMlD,EAAKhM,OACtEi1D,GAAmB/lD,EAAMkB,GAG7B,SAAS6kD,GAAmB/lD,EAAMkB,GAChC,IAAIhF,EAAM8D,EAAKF,MAAM5D,IACrB,IAAe,GAAXgF,EACF,QAAIhF,EAAI0C,gBACN2mD,GAAgBvlD,EAAMpE,EAAiB0E,cAAc5hB,OAAOwd,EAAK,EAAGA,EAAIM,QAAQysB,MAAO,YAChF,GAMX,IADA,IAAIhtB,EAAOC,EAAIE,QAAQ8E,GACdxV,EAAIuQ,EAAKiC,MAAQ,EAAGxS,EAAI,EAAGA,IAAK,CACvC,IAAIxJ,EAAOwJ,EAAIuQ,EAAKiC,MAAQjC,EAAK8G,UAAY9G,EAAK/Z,KAAKwJ,GACnDmuD,EAAU59C,EAAKnT,OAAO4C,GAC1B,GAAIxJ,EAAK0c,cACL2mD,GAAgBvlD,EAAMpE,EAAiB0E,cAAc5hB,OAAOwd,EAAK29C,EAAU,EAAGA,EAAU,EAAI33D,EAAKsa,QAAQysB,MAAO,eAC/G,KAAIrtB,EAAiBuF,cAAcC,aAAalf,GAGjD,SAFAqjE,GAAgBvlD,EAAMpE,EAAiBuF,cAAcziB,OAAOwd,EAAK29C,GAAU,WAG/E,OAAO,GAIX,SAASmM,GAAchmD,GACrB,OAAOimD,GAAejmD,GA9IxBikD,GAAaiC,QAAU,SAAUlmD,EAAMlP,GACrCkP,EAAKkT,SAA4B,IAAjBpiB,EAAMqiB,SAAiBriB,EAAMoiB,SACzCizC,GAAoBnmD,EAAMlP,KAC9BkP,EAAKi9C,YAAcnsD,EAAMqiB,QACzBnT,EAAK+9C,gBAAkB/W,KAAKC,MACxBjnC,EAAKW,SAAS,iBAAiB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMlP,OAAciqD,GAAe/6C,EAAMlP,GAChGA,EAAM8kB,iBAEN+uC,GAAmB3kD,EAAM,SAG/BikD,GAAamC,MAAQ,SAAUpmD,EAAMoC,GAClB,IAAbA,EAAE+Q,UAAiBnT,EAAKkT,UAAW,IAGzC+wC,GAAaoC,SAAW,SAAUrmD,EAAMlP,GACtC,KAAIq1D,GAAoBnmD,EAAMlP,KAAWA,EAAMw1D,UAC3Cx1D,EAAMiiB,UAAYjiB,EAAMkiB,QAAUlxB,EAAO2wB,KAAO3hB,EAAMmiB,SAE1D,GAAIjT,EAAKW,SAAS,kBAAkB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMlP,MAChEA,EAAM8kB,qBADR,CAKA,IAAI3V,EAAMD,EAAKF,MAAMI,UACrB,KAAMD,aAAerE,EAAiB0E,iBAAmBL,EAAII,MAAMo0B,WAAWx0B,EAAIG,KAAM,CACtF,IAAI1d,EAAOuD,OAAO2sB,aAAa9hB,EAAMw1D,UAChCtmD,EAAKW,SAAS,mBAAmB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMC,EAAII,MAAMvD,IAAKmD,EAAIG,IAAItD,IAAKpa,OAC5Fsd,EAAKD,SAASC,EAAKF,MAAMW,GAAGsnC,WAAWrlD,GAAMkoB,kBACjD9Z,EAAM8kB,oBAoHV,IAAI2wC,GAAqBzkE,EAAO2wB,IAAM,UAAY,UAElDvQ,GAASskD,UAAY,SAAUxmD,EAAMlP,GACnCkP,EAAKkT,SAAWpiB,EAAMoiB,SACtB,IAAIuzC,EAAUT,GAAchmD,GACxBinC,EAAMD,KAAKC,MAAOpnD,EAAO,cACzBonD,EAAMjnC,EAAKokD,UAAUr6C,KAAO,KAAOm7C,GAAOp0D,EAAOkP,EAAKokD,aAAetzD,EAAMy1D,MAClD,eAAvBvmD,EAAKokD,UAAUvkE,KAAyBA,EAAO,cACnB,eAAvBmgB,EAAKokD,UAAUvkE,OAAyBA,EAAO,gBAE1DmgB,EAAKokD,UAAY,CAACr6C,KAAMk9B,EAAKjiD,EAAG8L,EAAMkQ,QAASksC,EAAGp8C,EAAMmQ,QAASphB,KAAMA,GAEvE,IAAIid,EAAMkD,EAAKc,YAAYmkD,GAAYn0D,IAClCgM,IAEO,eAARjd,EACAmgB,EAAKmkD,UAAY,IAAIuC,GAAU1mD,EAAMlD,EAAKhM,EAAO21D,IACnC,eAAR5mE,EAAwBgmE,GAAoBC,IAAmB9lD,EAAMlD,EAAIA,IAAKA,EAAIoE,OAAQpQ,GAChGA,EAAM8kB,iBAEN+uC,GAAmB3kD,EAAM,aAG/B,IAAI0mD,GAAY,SAAmB1mD,EAAMlD,EAAKhM,EAAO21D,GACnD,IAUI5b,EAAY8b,EAVZ9kD,EAASvgB,KAWb,GATAA,KAAK0e,KAAOA,EACZ1e,KAAK47D,SAAWl9C,EAAKF,MAAM5D,IAC3B5a,KAAKwb,IAAMA,EACXxb,KAAKwP,MAAQA,EACbxP,KAAKmlE,QAAUA,EACfnlE,KAAK01D,WAAalmD,EAAMy1D,IACxBjlE,KAAKslE,aAAe91D,EAAMoiB,SAGtBpW,EAAIoE,QAAU,EAChB2pC,EAAa7qC,EAAKF,MAAM5D,IAAImF,OAAOvE,EAAIoE,QACvCylD,EAAY7pD,EAAIoE,WACX,CACL,IAAIjF,EAAO+D,EAAKF,MAAM5D,IAAIE,QAAQU,EAAIA,KACtC+tC,EAAa5uC,EAAKhT,OAClB09D,EAAY1qD,EAAKiC,MAAQjC,EAAKnT,SAAW,EAG3CxH,KAAKulE,UAAY,KAEjB,IAAIviD,EAASmiD,EAAU,KAAO31D,EAAMwT,OAChCwiD,EAAaxiD,EAAStE,EAAKkqB,QAAQukB,YAAYnqC,GAAQ,GAAQ,KACnEhjB,KAAKgjB,OAASwiD,EAAaA,EAAWzkD,IAAM,MAExCwoC,EAAWhrD,KAAK2d,KAAK6jB,YAAiD,IAApCwpB,EAAWhrD,KAAK2d,KAAK4oC,YACvDpmC,EAAKF,MAAMI,qBAAqBtE,EAAiBuF,eAAiBwlD,GAAa3mD,EAAKF,MAAMI,UAAUiH,QACpG7lB,KAAKulE,UAAY,CAAC3kE,KAAM2oD,EACR/tC,IAAK6pD,EACLI,QAASzlE,KAAKgjB,SAAWhjB,KAAKgjB,OAAO+c,UACrC2lC,cAAe1lE,KAAKgjB,QAAUxiB,EAAO0wB,QAAUlxB,KAAKgjB,OAAOyoB,aAAa,qBAExFzrC,KAAKgjB,QAAUhjB,KAAKulE,YAAcvlE,KAAKulE,UAAUE,SAAWzlE,KAAKulE,UAAUG,iBAC7E1lE,KAAK0e,KAAKs6C,YAAYlG,OAClB9yD,KAAKulE,UAAUE,UAAWzlE,KAAKgjB,OAAO+c,WAAY,GAClD//B,KAAKulE,UAAUG,eACf5iD,YAAW,WAAc,OAAOvC,EAAOyC,OAAOkgC,aAAa,kBAAmB,WAAa,IAC/FljD,KAAK0e,KAAKs6C,YAAYxyC,SAGxB9H,EAAK1b,KAAK8W,iBAAiB,UAAW9Z,KAAK2lE,GAAK3lE,KAAK2lE,GAAG3sD,KAAKhZ,OAC7D0e,EAAK1b,KAAK8W,iBAAiB,YAAa9Z,KAAKq+D,KAAOr+D,KAAKq+D,KAAKrlD,KAAKhZ,OACnEqjE,GAAmB3kD,EAAM,YA2D3B,SAASmmD,GAAoBnmD,EAAMlP,GACjC,QAAIkP,EAAK0W,cAWL50B,EAAOwwB,QAAUjb,KAAKm4C,IAAI1+C,EAAMo2D,UAAYlnD,EAAKskD,oBAAsB,OACzEtkD,EAAKskD,oBAAsB,KACpB,GAtEXoC,GAAUtyD,UAAU0U,KAAO,WACzBxnB,KAAK0e,KAAK1b,KAAKie,oBAAoB,UAAWjhB,KAAK2lE,IACnD3lE,KAAK0e,KAAK1b,KAAKie,oBAAoB,YAAajhB,KAAKq+D,MACjDr+D,KAAKulE,WAAavlE,KAAKgjB,SACzBhjB,KAAK0e,KAAKs6C,YAAYlG,OAClB9yD,KAAKulE,UAAUE,UAAWzlE,KAAKgjB,OAAO+c,WAAY,GAClD//B,KAAKulE,UAAUG,eAAiB1lE,KAAKgjB,OAAO2zC,gBAAgB,mBAChE32D,KAAK0e,KAAKs6C,YAAYxyC,SAExBxmB,KAAK0e,KAAKmkD,UAAY,MAGxBuC,GAAUtyD,UAAU6yD,GAAK,SAAan2D,GAGpC,GAFAxP,KAAKwnB,OAEAxnB,KAAK0e,KAAKqC,IAAI9a,SAAkC,GAAzBuJ,EAAMwT,OAAO1T,SAAgBE,EAAMwT,OAAO9Q,WAAa1C,EAAMwT,QAAzF,CAGA,IAAIxH,EAAMxb,KAAKwb,IACXxb,KAAK0e,KAAKF,MAAM5D,KAAO5a,KAAK47D,WAAYpgD,EAAMxb,KAAK0e,KAAKc,YAAYmkD,GAAYn0D,KAEhFxP,KAAKslE,eAAiB9pD,EACxB6nD,GAAmBrjE,KAAK0e,KAAM,WACrB4lD,GAAkBtkE,KAAK0e,KAAMlD,EAAIA,IAAKA,EAAIoE,OAAQpQ,EAAOxP,KAAK01D,YACvElmD,EAAM8kB,kBACGt0B,KAAKmlE,WAQJ3kE,EAAOqwB,QAAY7wB,KAAK0e,KAAKF,MAAMI,qBAAqBtE,EAAiB0E,eACxExD,EAAIA,KAAOxb,KAAK0e,KAAKF,MAAMI,UAAUiH,MAAQrK,EAAIA,KAAOxb,KAAK0e,KAAKF,MAAMI,UAAUkH,IAI7Fu9C,GAAmBrjE,KAAK0e,KAAM,YAH9BulD,GAAgBjkE,KAAK0e,KAAMpE,EAAiB6C,UAAUlC,KAAKjb,KAAK0e,KAAKF,MAAM5D,IAAIE,QAAQU,EAAIA,MAAO,WAClGhM,EAAM8kB,oBAMV8wC,GAAUtyD,UAAUurD,KAAO,SAAe7uD,IACnCxP,KAAKslE,eAAiBvvD,KAAKm4C,IAAIluD,KAAKwP,MAAM9L,EAAI8L,EAAMkQ,SAAW,GACzC3J,KAAKm4C,IAAIluD,KAAKwP,MAAMo8C,EAAIp8C,EAAMmQ,SAAW,KAChE3f,KAAKslE,cAAe,GACxBjC,GAAmBrjE,KAAK0e,KAAM,YAGhCkC,GAASilD,UAAY,SAAUnnD,GAC7BgmD,GAAchmD,GACd2kD,GAAmB3kD,EAAM,YAG3BkC,GAASklD,YAAc,SAAUpnD,GAAQ,OAAOgmD,GAAchmD,IAsB9D,IAAIqnD,GAAqBvlE,EAAOuoD,QAAU,KAAQ,EA6ClD,SAASid,GAAmBtnD,EAAMunD,GAChCpjD,aAAanE,EAAKqkD,kBACdkD,GAAS,IAAKvnD,EAAKqkD,iBAAmBjgD,YAAW,WAAc,OAAO6hD,GAAejmD,KAAUunD,IAGrG,SAAStB,GAAejmD,EAAMwnD,GAC5BxnD,EAAK0W,WAAY,EACjB,MAAO1W,EAAKy2C,iBAAiBvzD,OAAS,EAAK8c,EAAKy2C,iBAAiBpzD,MAAM2wD,mBACvE,SAAIwT,IAAexnD,EAAKkqB,QAAQ2nB,SAC9B7xC,EAAKunB,YAAYvnB,EAAKF,QACf,GAKX,SAAS2nD,GAAYznD,EAAMqC,GAGzB,IAAInG,EAAM8D,EAAKqC,IAAI4/B,cACflC,EAAO7jC,EAAI2H,KAAKJ,YAAYvH,EAAIzM,cAAc,QAClDswC,EAAKt8B,YAAYpB,GACjB09B,EAAKr8B,MAAMC,QAAU,6CACrB,IAAI1D,EAAMuwC,eAAgBjxD,EAAQ2c,EAAI8uB,cACtCzrC,EAAMmoE,mBAAmBrlD,GAIzBrC,EAAKqC,IAAIwlB,OACT5nB,EAAImxC,kBACJnxC,EAAIkzB,SAAS5zC,GACb6kB,YAAW,WACTlI,EAAI2H,KAAKjB,YAAYm9B,GACrB//B,EAAK0jB,UACJ,IA5ELugC,GAAa0D,iBAAmB1D,GAAa2D,kBAAoB,SAAU5nD,GACzE,IAAKA,EAAK0W,UAAW,CACnB1W,EAAKs6C,YAAY2I,QACjB,IAAInjD,EAAQE,EAAKF,MACb7D,EAAO6D,EAAMI,UAAUG,MAC3B,GAAIP,EAAMI,UAAUxD,QACfoD,EAAMuZ,cAAiBpd,EAAKo3B,YAAcp3B,EAAK4c,cAAgB5c,EAAK6G,WAAWyV,MAAM8qB,MAAK,SAAUp8C,GAAK,OAAiC,IAA1BA,EAAEpH,KAAK2d,KAAKuwB,cAE/H/tB,EAAK6nD,WAAa7nD,EAAKF,MAAMuZ,aAAepd,EAAKsc,QACjD0tC,GAAejmD,GAAM,GACrBA,EAAK6nD,WAAa,UAMlB,GAJA5B,GAAejmD,GAIXle,EAAO0wB,OAAS1S,EAAMI,UAAUxD,OAAST,EAAK4c,eAAiB5c,EAAKo3B,YAAcp3B,EAAK6G,WAAWyV,MAAMr1B,OAE1G,IADA,IAAI+c,EAAMD,EAAK1b,KAAKksD,eACXtuD,EAAO+d,EAAI2wC,UAAW9qD,EAASma,EAAI6wC,YAAa5uD,GAAyB,GAAjBA,EAAK0O,UAA2B,GAAV9K,GAAc,CACnG,IAAIgD,EAAShD,EAAS,EAAI5D,EAAKqc,UAAYrc,EAAKwpC,WAAW5lC,EAAS,GACpE,GAAuB,GAAnBgD,EAAO8H,SAAe,CACxBqP,EAAIyzC,SAAS5qD,EAAQA,EAAO+H,UAAU3N,QACtC,MAEAhB,EAAO4G,EACPhD,GAAU,EAKlBka,EAAK0W,WAAY,EAEnB4wC,GAAmBtnD,EAAMqnD,KAG3BpD,GAAa6D,eAAiB,SAAU9nD,EAAMlP,GACxCkP,EAAK0W,YACP1W,EAAK0W,WAAY,EACjB1W,EAAKskD,mBAAqBxzD,EAAMo2D,UAChCI,GAAmBtnD,EAAM,MA2C7B,IAAI+nD,GAAsBjmE,EAAOioD,IAAMjoD,EAAOkoD,WAAa,IACpDloD,EAAOsoD,KAAOtoD,EAAO0oD,eAAiB,IAuB7C,SAASwd,GAAgB57D,GACvB,OAA0B,GAAnBA,EAAMgvB,WAAmC,GAAjBhvB,EAAMivB,SAA4C,GAA5BjvB,EAAMoQ,QAAQ4B,WAAkBhS,EAAMoQ,QAAQ9L,WAAa,KAGlH,SAASu3D,GAAajoD,EAAMoC,GAC1B,IAAIlG,EAAM8D,EAAKqC,IAAI4/B,cACfke,EAAYngD,EAAKkT,UAAYlT,EAAKF,MAAMI,UAAUG,MAAMpX,OAAOpJ,KAAK2d,KAAKpO,KACzEkV,EAASpI,EAAI2H,KAAKJ,YAAYvH,EAAIzM,cAAc0wD,EAAY,WAAa,QACxEA,IAAa77C,EAAO4mC,gBAAkB,QAC3C5mC,EAAOZ,MAAMC,QAAU,6CACvBW,EAAOof,QACPtf,YAAW,WACTpE,EAAK0jB,QACLxnB,EAAI2H,KAAKjB,YAAY0B,GACjB67C,EAAa+H,GAAQloD,EAAMsE,EAAO7iB,MAAO,KAAM2gB,GAC5C8lD,GAAQloD,EAAMsE,EAAOlL,YAAakL,EAAO1U,UAAWwS,KAC1D,IAGL,SAAS8lD,GAAQloD,EAAMtd,EAAMgW,EAAM0J,GACjC,IAAIhW,EAAQ8zD,GAAmBlgD,EAAMtd,EAAMgW,EAAMsH,EAAKkT,SAAUlT,EAAKF,MAAMI,UAAUG,OACrF,GAAIL,EAAKW,SAAS,eAAe,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMoC,EAAGhW,GAAS0P,EAAiBW,MAAMC,YAAetQ,EAAS,OAAO,EAEjI,IAAI+7D,EAAaH,GAAgB57D,GAC7BqU,EAAK0nD,EAAanoD,EAAKF,MAAMW,GAAGkpB,qBAAqBw+B,EAAYnoD,EAAKkT,UAAYlT,EAAKF,MAAMW,GAAGmnC,iBAAiBx7C,GAErH,OADA4T,EAAKD,SAASU,EAAGmK,iBAAiBD,QAAQ,SAAS,GAAMA,QAAQ,UAAW,WACrE,EA/CTzI,GAASyR,KAAOswC,GAAajpC,IAAM,SAAUhb,EAAMoC,GACjD,IAAInC,EAAMD,EAAKF,MAAMI,UAAW8a,EAAgB,OAAV5Y,EAAEviB,KACxC,IAAIogB,EAAIvD,MAAR,CAGA,IAAIrb,EAAO0mE,GAAqB,KAAO3lD,EAAEgmD,cACrCh8D,EAAQ6T,EAAIzD,UACZqE,EAAMg/C,GAAsB7/C,EAAM5T,GAClCiW,EAAMxB,EAAIwB,IACV3f,EAAOme,EAAIne,KACXrB,GACF+gB,EAAEwT,iBACFv0B,EAAKgnE,YACLhnE,EAAKinE,QAAQ,YAAajmD,EAAIzS,WAC9BvO,EAAKinE,QAAQ,aAAc5lE,IAE3B+kE,GAAYznD,EAAMqC,GAEhB2Y,GAAOhb,EAAKD,SAASC,EAAKF,MAAMW,GAAGqnC,kBAAkBl9B,iBAAiBD,QAAQ,UAAW,UAgC/Fs5C,GAAasE,MAAQ,SAAUvoD,EAAMoC,GACnC,IAAI/gB,EAAO0mE,GAAqB,KAAO3lD,EAAEgmD,cACrC/mE,IAAS6mE,GAAQloD,EAAM3e,EAAKmnE,QAAQ,cAAennE,EAAKmnE,QAAQ,aAAcpmD,IAAM/gB,EAAKonE,MAAMvlE,OAAS,GACxGkf,EAAEwT,iBAEFqyC,GAAajoD,EAAMoC,IAGzB,IAAIsmD,GAAW,SAAkBt8D,EAAOuzD,GACtCr+D,KAAK8K,MAAQA,EACb9K,KAAKq+D,KAAOA,GAGVgJ,GAAmB7mE,EAAO2wB,IAAM,SAAW,UAqH/C,IAAK,IAAI5xB,MAnHTqhB,GAAS0mD,UAAY,SAAU5oD,EAAMoC,GACnC,IAAI+hD,EAAYnkD,EAAKmkD,UAErB,GADIA,GAAaA,EAAUr7C,OACtB1G,EAAEymD,aAAP,CAEA,IAAI5oD,EAAMD,EAAKF,MAAMI,UACjBpD,EAAMmD,EAAIvD,MAAQ,KAAOsD,EAAKc,YAAYmkD,GAAY7iD,IAC1D,GAAItF,GAAOA,EAAIA,KAAOmD,EAAIkH,MAAQrK,EAAIA,MAAQmD,aAAerE,EAAiBuF,cAAgBlB,EAAImH,GAAK,EAAGnH,EAAImH,UAEvG,GAAI+8C,GAAaA,EAAU0C,UAChC7mD,EAAKD,SAASC,EAAKF,MAAMW,GAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAOshB,EAAKF,MAAM5D,IAAKioD,EAAU0C,UAAU/pD,YAC9G,GAAIsF,EAAEkC,QAA+B,GAArBlC,EAAEkC,OAAO1T,SAAe,CAC7C,IAAIs3C,EAAOloC,EAAKkqB,QAAQukB,YAAYrsC,EAAEkC,QAAQ,GAC9C,IAAK4jC,IAASA,EAAKhmD,KAAKrC,KAAK2d,KAAK6jB,WAAa6mB,GAAQloC,EAAKkqB,QAAW,OACvElqB,EAAKD,SAASC,EAAKF,MAAMW,GAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAOshB,EAAKF,MAAM5D,IAAKgsC,EAAKwG,aAEtG,IAAItiD,EAAQ4T,EAAKF,MAAMI,UAAU1D,UAC7BqE,EAAMg/C,GAAsB7/C,EAAM5T,GAClCiW,EAAMxB,EAAIwB,IACV3f,EAAOme,EAAIne,KACf0f,EAAEymD,aAAaR,YACfjmD,EAAEymD,aAAaP,QAAQP,GAAqB,OAAS,YAAa1lD,EAAIzS,WACjEm4D,IAAsB3lD,EAAEymD,aAAaP,QAAQ,aAAc5lE,GAChEsd,EAAKuE,SAAW,IAAImkD,GAASt8D,GAAQgW,EAAEumD,OAGzCzmD,GAASuC,QAAU,SAAUzE,GAC3B7E,OAAOiJ,YAAW,WAAc,OAAOpE,EAAKuE,SAAW,OAAS,KAGlE0/C,GAAa5/C,SAAW4/C,GAAa6E,UAAY,SAAUp3B,EAAGtvB,GAAK,OAAOA,EAAEwT,kBAE5EquC,GAAav/C,KAAO,SAAU1E,EAAMoC,GAClC,IAAImC,EAAWvE,EAAKuE,SAGpB,GAFAvE,EAAKuE,SAAW,KAEXnC,EAAEymD,aAAP,CAEA,IAAIE,EAAW/oD,EAAKc,YAAYmkD,GAAY7iD,IAC5C,GAAK2mD,EAAL,CACA,IAAIC,EAAShpD,EAAKF,MAAM5D,IAAIE,QAAQ2sD,EAASjsD,KAC7C,GAAKksD,EAAL,CACA,IAAI58D,EAAQmY,GAAYA,EAASnY,OAC7B8zD,GAAmBlgD,EAAMoC,EAAEymD,aAAaL,QAAQT,GAAqB,OAAS,cAC3DA,GAAqB,KAAO3lD,EAAEymD,aAAaL,QAAQ,cAAc,EAAOQ,GAC/F,GAAK58D,IAELgW,EAAEwT,kBACE5V,EAAKW,SAAS,cAAc,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAMoC,EAAGhW,EAAOmY,GAAYA,EAASo7C,UAA7F,CACA,IAAIsJ,EAAY78D,EAAQqV,EAAqB+C,UAAUxE,EAAKF,MAAM5D,IAAK8sD,EAAOlsD,IAAK1Q,GAAS48D,EAAOlsD,IAClF,MAAbmsD,IAAqBA,EAAYD,EAAOlsD,KAE5C,IAAI2D,EAAKT,EAAKF,MAAMW,GAChB8D,GAAYA,EAASo7C,MAAQl/C,EAAGqnC,kBAEpC,IAAIhrC,EAAM2D,EAAGtE,QAAQpX,IAAIkkE,GACrBxpC,EAA4B,GAAnBrzB,EAAMgvB,WAAmC,GAAjBhvB,EAAMivB,SAA4C,GAA5BjvB,EAAMoQ,QAAQ4B,WACrE8qD,EAAezoD,EAAGvE,IAKtB,GAJIujB,EACAhf,EAAG4kC,iBAAiBvoC,EAAKA,EAAK1Q,EAAMoQ,QAAQ9L,YAE5C+P,EAAGwkC,aAAanoC,EAAKA,EAAK1Q,IAC1BqU,EAAGvE,IAAIS,GAAGusD,GAAd,CAEA,IAAIjtD,EAAOwE,EAAGvE,IAAIE,QAAQU,GACtB2iB,GAAU7jB,EAAiBuF,cAAcC,aAAahV,EAAMoQ,QAAQ9L,aACpEuL,EAAK8G,WAAa9G,EAAK8G,UAAUosB,WAAW/iC,EAAMoQ,QAAQ9L,YAC1D+P,EAAGC,aAAa,IAAI9E,EAAiBuF,cAAclF,IAEnDwE,EAAGC,aAAaw6C,GAAiBl7C,EAAM/D,EAAMwE,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAIkkE,MAC/EjpD,EAAK0jB,QACL1jB,EAAKD,SAASU,EAAGkK,QAAQ,UAAW,eAGtCzI,GAASwhB,MAAQ,SAAU1jB,GACpBA,EAAKymB,UACRzmB,EAAKs6C,YAAYlG,OACjBp0C,EAAKqC,IAAItJ,UAAUvY,IAAI,uBACvBwf,EAAKs6C,YAAYxyC,QACjB9H,EAAKymB,SAAU,IAInBvkB,GAAS2lB,KAAO,SAAU7nB,GACpBA,EAAKymB,UACPzmB,EAAKs6C,YAAYlG,OACjBp0C,EAAKqC,IAAItJ,UAAUm+C,OAAO,uBAC1Bl3C,EAAKs6C,YAAYxyC,QACjB9H,EAAKymB,SAAU,IAInBvkB,GAASinD,YAAc,SAAUnpD,EAAMlP,GAMrC,GAAIhP,EAAOqwB,QAAUrwB,EAAOuoD,SAA8B,yBAAnBv5C,EAAMs4D,UAAsC,CACjF,IAAI/K,EAAiBr+C,EAAKq+C,eAC1Bj6C,YAAW,WACT,GAAIpE,EAAKq+C,gBAAkBA,IAE3Br+C,EAAKqC,IAAIwlB,OACT7nB,EAAK0jB,SACD1jB,EAAKW,SAAS,iBAAiB,SAAUovB,GAAK,OAAOA,EAAE/vB,EAAM0rC,EAAS,EAAG,kBAA7E,CACA,IAAI7qC,EAAMb,EAAKF,MAAMI,UACjB2lC,EAAUhlC,EAAIglC,QAEdA,GAAWA,EAAQ/oC,IAAM,GAAKkD,EAAKD,SAASC,EAAKF,MAAMW,GAAGpgB,OAAOwlD,EAAQ/oC,IAAM,EAAG+oC,EAAQ/oC,KAAK8N,qBAClG,MAKUq5C,GAAgB/hD,GAASrhB,IAAQojE,GAAapjE,IAE/D,SAASwoE,GAAYlxD,EAAGC,GACtB,GAAID,GAAKC,EAAK,OAAO,EACrB,IAAK,IAAIkmB,KAAKnmB,EAAK,GAAIA,EAAEmmB,KAAOlmB,EAAEkmB,GAAM,OAAO,EAC/C,IAAK,IAAI8S,KAAOh5B,EAAK,KAAMg5B,KAAOj5B,GAAM,OAAO,EAC/C,OAAO,EAGT,IAAImxD,GAAa,SAAoBjkC,EAAO7nB,GAC1Clc,KAAKkc,KAAOA,GAAQ+rD,GACpBjoE,KAAKiqC,KAAOjqC,KAAKkc,KAAK+tB,MAAQ,EAC9BjqC,KAAK+jC,MAAQA,GAGfikC,GAAWl1D,UAAUrP,IAAM,SAAcoX,EAAStZ,EAAMiD,EAAQ0jE,GAC9D,IAAI3oD,EAAM1E,EAAQ8pC,UAAUpjD,EAAKskB,KAAOqiD,EAAWloE,KAAKiqC,KAAO,GAAK,EAAI,GAClEzuB,EAAM+D,EAAI/D,IACVopC,EAAUrlC,EAAIqlC,QACpB,OAAOA,EAAU,KAAO,IAAI3kC,GAAWzE,EAAMhX,EAAQgX,EAAMhX,EAAQxE,OAGrEgoE,GAAWl1D,UAAUkI,MAAQ,WAAoB,OAAO,GAExDgtD,GAAWl1D,UAAUuI,GAAK,SAAaC,GACrC,OAAOtb,MAAQsb,GACZA,aAAiB0sD,KAChBhoE,KAAKkc,KAAKzb,KAAOT,KAAKkc,KAAKzb,KAAO6a,EAAMY,KAAKzb,KAC7CT,KAAK+jC,OAASzoB,EAAMyoB,OAASgkC,GAAY/nE,KAAKkc,KAAMZ,EAAMY,QAGhE,IAAIisD,GAAa,SAAoBtzC,EAAO3Y,GAC1Clc,KAAKkc,KAAOA,GAAQ+rD,GACpBjoE,KAAK60B,MAAQA,GAGfszC,GAAWr1D,UAAUrP,IAAM,SAAcoX,EAAStZ,EAAMiD,EAAQ0jE,GAC9D,IAAIriD,EAAOhL,EAAQpX,IAAIlC,EAAKskB,KAAOqiD,EAAWloE,KAAKkc,KAAKksD,gBAAkB,EAAI,GAAK5jE,EAC/EshB,EAAKjL,EAAQpX,IAAIlC,EAAKukB,GAAKoiD,EAAWloE,KAAKkc,KAAKmsD,aAAe,GAAK,GAAK7jE,EAC7E,OAAOqhB,GAAQC,EAAK,KAAO,IAAI7F,GAAW4F,EAAMC,EAAI9lB,OAGtDmoE,GAAWr1D,UAAUkI,MAAQ,SAAgBo1B,EAAG7uC,GAAQ,OAAOA,EAAKskB,KAAOtkB,EAAKukB,IAEhFqiD,GAAWr1D,UAAUuI,GAAK,SAAaC,GACrC,OAAOtb,MAAQsb,GACZA,aAAiB6sD,IAAcJ,GAAY/nE,KAAK60B,MAAOvZ,EAAMuZ,QAC7DkzC,GAAY/nE,KAAKkc,KAAMZ,EAAMY,OAGlCisD,GAAWrT,GAAK,SAAavzD,GAAQ,OAAOA,EAAKhD,gBAAgB4pE,IAEjE,IAAIhvB,GAAW,SAAkBtkB,EAAO3Y,GACtClc,KAAKkc,KAAOA,GAAQ+rD,GACpBjoE,KAAK60B,MAAQA,GAGfskB,GAASrmC,UAAUrP,IAAM,SAAcoX,EAAStZ,EAAMiD,EAAQ0jE,GAC5D,IAAIriD,EAAOhL,EAAQ8pC,UAAUpjD,EAAKskB,KAAOqiD,EAAW,GACpD,GAAIriD,EAAK++B,QAAW,OAAO,KAC3B,IAAI9+B,EAAKjL,EAAQ8pC,UAAUpjD,EAAKukB,GAAKoiD,GAAY,GACjD,OAAIpiD,EAAG8+B,SAAW9+B,EAAGtK,KAAOqK,EAAKrK,IAAc,KACxC,IAAIyE,GAAW4F,EAAKrK,IAAMhX,EAAQshB,EAAGtK,IAAMhX,EAAQxE,OAG5Dm5C,GAASrmC,UAAUkI,MAAQ,SAAgBpa,EAAMW,GAC/C,IAAIge,EAAM3e,EAAKsa,QAAQ7Q,UAAU9I,EAAKskB,MAChC3hB,EAAQqb,EAAIrb,MACZM,EAAS+a,EAAI/a,OACnB,OAAOA,GAAUjD,EAAKskB,MAAQrhB,EAAS5D,EAAK4B,MAAM0B,GAAO0d,UAAYrgB,EAAKukB,IAG5EqzB,GAASrmC,UAAUuI,GAAK,SAAaC,GACnC,OAAOtb,MAAQsb,GACZA,aAAiB69B,IAAY4uB,GAAY/nE,KAAK60B,MAAOvZ,EAAMuZ,QAC3DkzC,GAAY/nE,KAAKkc,KAAMZ,EAAMY,OAMlC,IAAI+D,GAAa,SAAoB4F,EAAMC,EAAIvnB,GAG7CyB,KAAK6lB,KAAOA,EAIZ7lB,KAAK8lB,GAAKA,EACV9lB,KAAKzB,KAAOA,GAGViyC,GAAuB,CAAEt0B,KAAM,IAEnC+D,GAAWnN,UAAUuf,KAAO,SAAexM,EAAMC,GAC/C,OAAO,IAAI7F,GAAW4F,EAAMC,EAAI9lB,KAAKzB,OAGvC0hB,GAAWnN,UAAUuI,GAAK,SAAaC,GACrC,OAAOtb,KAAKzB,KAAK8c,GAAGC,EAAM/c,OAASyB,KAAK6lB,MAAQvK,EAAMuK,MAAQ7lB,KAAK8lB,IAAMxK,EAAMwK,IAGjF7F,GAAWnN,UAAUrP,IAAM,SAAcoX,EAASrW,EAAQ0jE,GACxD,OAAOloE,KAAKzB,KAAKkF,IAAIoX,EAAS7a,KAAMwE,EAAQ0jE,IA+C9CjoD,GAAWC,OAAS,SAAiB1E,EAAKuoB,EAAO7nB,GAC/C,OAAO,IAAI+D,GAAWzE,EAAKA,EAAK,IAAIwsD,GAAWjkC,EAAO7nB,KAoBxD+D,GAAW42B,OAAS,SAAiBhxB,EAAMC,EAAI+O,EAAO3Y,GACpD,OAAO,IAAI+D,GAAW4F,EAAMC,EAAI,IAAIqiD,GAAWtzC,EAAO3Y,KAYxD+D,GAAWrf,KAAO,SAAeilB,EAAMC,EAAI+O,EAAO3Y,GAChD,OAAO,IAAI+D,GAAW4F,EAAMC,EAAI,IAAIqzB,GAAStkB,EAAO3Y,KAMtDs0B,GAAqBt0B,KAAKmI,IAAM,WAAc,OAAOrkB,KAAKzB,KAAK2d,MAE/D/c,OAAOo9B,iBAAkBtc,GAAWnN,UAAW09B,IAkB/C,IAAID,GAAO,GACP03B,GAAS,GAMTjoD,GAAgB,SAAuBsoD,EAAO5mE,GAChD1B,KAAKsoE,MAAQA,GAASA,EAAM1mE,OAAS0mE,EAAQ/3B,GAC7CvwC,KAAK0B,SAAWA,GAAYA,EAASE,OAASF,EAAW6uC,IAM3DvwB,GAAc5iB,OAAS,SAAiBwd,EAAKgD,GAC3C,OAAOA,EAAYhc,OAAS2mE,GAAU3qD,EAAahD,EAAK,EAAGqtD,IAAU7sD,IAUvE4E,GAAclN,UAAUX,KAAO,SAAeqU,EAAO/gB,EAAKyyB,GACxD,IAAI13B,EAAS,GAEb,OADAR,KAAKwoE,UAAmB,MAAThiD,EAAgB,EAAIA,EAAc,MAAP/gB,EAAc,IAAMA,EAAKjF,EAAQ,EAAG03B,GACvE13B,GAGTwf,GAAclN,UAAU01D,UAAY,SAAoBhiD,EAAO/gB,EAAKjF,EAAQgE,EAAQ0zB,GAGlF,IAFE,IAAI3X,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAKsoE,MAAM1mE,OAAQwI,IAAK,CAC1C,IAAI7I,EAAOgf,EAAO+nD,MAAMl+D,GACpB7I,EAAKskB,MAAQpgB,GAAOlE,EAAKukB,IAAMU,KAAW0R,GAAaA,EAAU32B,EAAK2a,QACtE1b,EAAOsB,KAAKP,EAAK8wB,KAAK9wB,EAAKskB,KAAOrhB,EAAQjD,EAAKukB,GAAKthB,IAE1D,IAAK,IAAI8lB,EAAM,EAAGA,EAAMtqB,KAAK0B,SAASE,OAAQ0oB,GAAO,EACnD,GAAI/J,EAAO7e,SAAS4oB,GAAO7kB,GAAO8a,EAAO7e,SAAS4oB,EAAM,GAAK9D,EAAO,CAClE,IAAIiiD,EAAWloD,EAAO7e,SAAS4oB,GAAO,EACtC/J,EAAO7e,SAAS4oB,EAAM,GAAGk+C,UAAUhiD,EAAQiiD,EAAUhjE,EAAMgjE,EAAUjoE,EAAQgE,EAASikE,EAAUvwC,KAetGlY,GAAclN,UAAUrP,IAAM,SAAcoX,EAASD,EAAK5Z,GACxD,OAAIhB,MAAQob,IAAgC,GAAvBP,EAAQ0J,KAAK3iB,OAAsB5B,KACjDA,KAAK0oE,SAAS7tD,EAASD,EAAK,EAAG,EAAG5Z,GAAWinE,KAGtDjoD,GAAclN,UAAU41D,SAAW,SAAmB7tD,EAASja,EAAM4D,EAAQ0jE,EAAWlnE,GAItF,IAHE,IAEE2nE,EAFEpoD,EAASvgB,KAGNoK,EAAI,EAAGA,EAAIpK,KAAKsoE,MAAM1mE,OAAQwI,IAAK,CAC1C,IAAIogB,EAASjK,EAAO+nD,MAAMl+D,GAAG3G,IAAIoX,EAASrW,EAAQ0jE,GAC9C19C,GAAUA,EAAOjsB,KAAKyc,MAAMpa,EAAM4pB,IAAYm+C,IAAaA,EAAW,KAAK7mE,KAAK0oB,GAC3ExpB,EAAQ4nE,UAAY5nE,EAAQ4nE,SAASroD,EAAO+nD,MAAMl+D,GAAG8R,MAGhE,OAAIlc,KAAK0B,SAASE,OACPinE,GAAY7oE,KAAK0B,SAAUinE,EAAU9tD,EAASja,EAAM4D,EAAQ0jE,EAAWlnE,GAEvE2nE,EAAW,IAAI3oD,GAAc2oD,EAAS/xD,KAAKkyD,KAAU1tD,IAOlE4E,GAAclN,UAAU5T,IAAM,SAAc0b,EAAKgD,GAC/C,OAAKA,EAAYhc,OACb5B,MAAQob,GAAgB4E,GAAc5iB,OAAOwd,EAAKgD,GAC/C5d,KAAK+oE,SAASnuD,EAAKgD,EAAa,GAFL5d,MAKpCggB,GAAclN,UAAUi2D,SAAW,SAAmBnuD,EAAKgD,EAAapZ,GACpE,IAEE9C,EAFE6e,EAASvgB,KAEDwsD,EAAa,EAC3B5xC,EAAItb,SAAQ,SAAU0pE,EAAWC,GAC/B,IAAuC15B,EAAnC25B,EAAaD,EAAczkE,EAC/B,GAAM+qC,EAAQ45B,GAAiBvrD,EAAaorD,EAAWE,GAAvD,CAEKxnE,IAAYA,EAAW6e,EAAO7e,SAASoJ,SAC5C,MAAO0hD,EAAa9qD,EAASE,QAAUF,EAAS8qD,GAAcyc,EAAezc,GAAc,EACvF9qD,EAAS8qD,IAAeyc,EACxBvnE,EAAS8qD,EAAa,GAAK9qD,EAAS8qD,EAAa,GAAGuc,SAASC,EAAWz5B,EAAO25B,EAAa,GAE5FxnE,EAAS6I,OAAOiiD,EAAY,EAAGyc,EAAaA,EAAcD,EAAUpnD,SAAU2mD,GAAUh5B,EAAOy5B,EAAWE,EAAa,EAAGjB,KAC9Hzb,GAAc,MAGhB,IAAI8b,EAAQc,GAAU5c,EAAa6c,GAAazrD,GAAeA,GAAcpZ,GAC7E,OAAO,IAAIwb,GAAcsoD,EAAM1mE,OAAS5B,KAAKsoE,MAAMhlE,OAAOglE,GAAO1xD,KAAKkyD,IAAS9oE,KAAKsoE,MAC3D5mE,GAAY1B,KAAK0B,WAM5Cse,GAAclN,UAAU8iD,OAAS,SAAiBh4C,GAChD,OAA0B,GAAtBA,EAAYhc,QAAe5B,MAAQob,GAAgBpb,KAChDA,KAAKspE,YAAY1rD,EAAa,IAGvCoC,GAAclN,UAAUw2D,YAAc,SAAsB1rD,EAAapZ,GAIvE,IAHE,IAAI+b,EAASvgB,KAEX0B,EAAW1B,KAAK0B,SAAU4mE,EAAQtoE,KAAKsoE,MAClCl+D,EAAI,EAAGA,EAAI1I,EAASE,OAAQwI,GAAK,EAAG,CAE3C,IADA,IAAImlC,OAAQ,EAAU1pB,EAAOnkB,EAAS0I,GAAK5F,EAAQshB,EAAKpkB,EAAS0I,EAAI,GAAK5F,EACjEspC,EAAI,EAAGvsC,OAAO,EAAUusC,EAAIlwB,EAAYhc,OAAQksC,KAAWvsC,EAAOqc,EAAYkwB,KACjFvsC,EAAKskB,KAAOA,GAAQtkB,EAAKukB,GAAKA,IAChClI,EAAYkwB,GAAK,MACfyB,IAAUA,EAAQ,KAAKztC,KAAKP,IAGlC,GAAKguC,EAAL,CACI7tC,GAAY6e,EAAO7e,WAAYA,EAAW6e,EAAO7e,SAASoJ,SAC9D,IAAI8yD,EAAUl8D,EAAS0I,EAAI,GAAGk/D,YAAY/5B,EAAO1pB,EAAO,GACpD+3C,GAAWxiD,GACb1Z,EAAS0I,EAAI,GAAKwzD,GAElBl8D,EAAS6I,OAAOH,EAAG,GACnBA,GAAK,IAGT,GAAIk+D,EAAM1mE,OAAU,IAAK,IAAI0oB,EAAM,EAAGi/C,OAAS,EAAUj/C,EAAM1M,EAAYhc,OAAQ0oB,IAAS,GAAIi/C,EAAS3rD,EAAY0M,GACnH,IAAK,IAAIwnC,EAAM,EAAGA,EAAMwW,EAAM1mE,OAAQkwD,IAAawW,EAAMxW,GAAKvzD,KAAK8c,GAAGkuD,EAAOhrE,QACvE+pE,GAAS/nD,EAAO+nD,QAASA,EAAQ/nD,EAAO+nD,MAAMx9D,SAClDw9D,EAAM/9D,OAAOunD,IAAO,IAGxB,OAAIpwD,GAAY1B,KAAK0B,UAAY4mE,GAAStoE,KAAKsoE,MAAgBtoE,KACxDsoE,EAAM1mE,QAAUF,EAASE,OAAS,IAAIoe,GAAcsoD,EAAO5mE,GAAY0Z,IAGhF4E,GAAclN,UAAUglD,SAAW,SAAmBtzD,EAAQ5D,GAC1D,IAKE4B,EAAO8lE,EALL/nD,EAASvgB,KAEf,GAAIA,MAAQob,GAAS,OAAOpb,KAC5B,GAAIY,EAAKouC,OAAU,OAAOhvB,GAAc5E,MAGxC,IAAK,IAAIhR,EAAI,EAAGA,EAAIpK,KAAK0B,SAASE,OAAQwI,GAAK,EAAK,GAAImW,EAAO7e,SAAS0I,IAAM5F,EAAQ,CAChF+b,EAAO7e,SAAS0I,IAAM5F,IAAUhC,EAAQ+d,EAAO7e,SAAS0I,EAAI,IAChE,MAGF,IADA,IAAIoc,EAAQhiB,EAAS,EAAGiB,EAAM+gB,EAAQ5lB,EAAKsa,QAAQysB,KAC1Crd,EAAM,EAAGA,EAAMtqB,KAAKsoE,MAAM1mE,OAAQ0oB,IAAO,CAChD,IAAIk/C,EAAMjpD,EAAO+nD,MAAMh+C,GACvB,GAAIk/C,EAAI3jD,KAAOpgB,GAAO+jE,EAAI1jD,GAAKU,GAAUgjD,EAAIjrE,gBAAgB4pE,GAAa,CACxE,IAAItiD,EAAO9P,KAAK0Q,IAAID,EAAOgjD,EAAI3jD,MAAQW,EAAOV,EAAK/P,KAAK8Q,IAAIphB,EAAK+jE,EAAI1jD,IAAMU,EACvEX,EAAOC,IAAOwiD,IAAUA,EAAQ,KAAKxmE,KAAK0nE,EAAIn3C,KAAKxM,EAAMC,KAGjE,GAAIwiD,EAAO,CACT,IAAImB,EAAW,IAAIzpD,GAAcsoD,EAAM1xD,KAAKkyD,KAC5C,OAAOtmE,EAAQ,IAAIknE,GAAgB,CAACD,EAAUjnE,IAAUinE,EAE1D,OAAOjnE,GAAS4Y,IAGlB4E,GAAclN,UAAUuI,GAAK,SAAaC,GACtC,IAAIiF,EAASvgB,KAEf,GAAIA,MAAQsb,EAAS,OAAO,EAC5B,KAAMA,aAAiB0E,KACnBhgB,KAAKsoE,MAAM1mE,QAAU0Z,EAAMgtD,MAAM1mE,QACjC5B,KAAK0B,SAASE,QAAU0Z,EAAM5Z,SAASE,OAAU,OAAO,EAC5D,IAAK,IAAIwI,EAAI,EAAGA,EAAIpK,KAAKsoE,MAAM1mE,OAAQwI,IACnC,IAAKmW,EAAO+nD,MAAMl+D,GAAGiR,GAAGC,EAAMgtD,MAAMl+D,IAAO,OAAO,EACtD,IAAK,IAAIkgB,EAAM,EAAGA,EAAMtqB,KAAK0B,SAASE,OAAQ0oB,GAAO,EACjD,GAAI/J,EAAO7e,SAAS4oB,IAAQhP,EAAM5Z,SAAS4oB,IACzC/J,EAAO7e,SAAS4oB,EAAM,IAAMhP,EAAM5Z,SAAS4oB,EAAM,KAChD/J,EAAO7e,SAAS4oB,EAAM,GAAGjP,GAAGC,EAAM5Z,SAAS4oB,EAAM,IAAO,OAAO,EACtE,OAAO,GAGTtK,GAAclN,UAAUwkD,OAAS,SAAiB12D,GAChD,OAAO+oE,GAAc3pE,KAAK4pE,YAAYhpE,KAGxCof,GAAclN,UAAU82D,YAAc,SAAsBhpE,GACxD,IAAI2f,EAASvgB,KAEf,GAAIA,MAAQob,GAAS,OAAOm1B,GAC5B,GAAI3vC,EAAK0c,gBAAkBtd,KAAKsoE,MAAMvmB,KAAKomB,GAAWrT,IAAO,OAAO90D,KAAKsoE,MAEzE,IADA,IAAI9nE,EAAS,GACJ4J,EAAI,EAAGA,EAAIpK,KAAKsoE,MAAM1mE,OAAQwI,IAC/BmW,EAAO+nD,MAAMl+D,GAAG7L,gBAAgB4pE,IAClC3nE,EAAOsB,KAAKye,EAAO+nD,MAAMl+D,IAE/B,OAAO5J,GAGT,IAAI4a,GAAQ,IAAI4E,GAIhBA,GAAc5E,MAAQA,GAEtB4E,GAAc2pD,cAAgBA,GAK9B,IAAID,GAAkB,SAAyBG,GAC7C7pE,KAAK6pE,QAAUA,GA0DjB,SAAShB,GAAYiB,EAAanB,EAAU9tD,EAASja,EAAM4D,EAAQ0jE,EAAWlnE,GAiB5E,IAhBA,IAAIU,EAAWooE,EAAYh/D,QAIvBolB,EAAQ,SAAU65C,EAAUC,EAAQC,EAAUC,GAChD,IAAK,IAAI9/D,EAAI,EAAGA,EAAI1I,EAASE,OAAQwI,GAAK,EAAG,CAC3C,IAAI3E,EAAM/D,EAAS0I,EAAI,GAAI+/D,OAAQ,GACvB,GAAR1kE,GAAaskE,EAAWtkE,EAAMyiE,IAC9B8B,GAAUtoE,EAAS0I,GAAK89D,EAC1BxmE,EAAS0I,EAAI,IAAM,GACV+/D,EAASD,EAASD,GAAaD,EAASD,IAAa7B,EAAY1jE,MAC1E9C,EAAS0I,IAAM+/D,EACfzoE,EAAS0I,EAAI,IAAM+/D,MAIhB//D,EAAI,EAAGA,EAAIyQ,EAAQ0J,KAAK3iB,OAAQwI,IAAOyQ,EAAQ0J,KAAKna,GAAG9K,QAAQ4wB,GAKxE,IADA,IAAIk6C,GAAc,EACT9/C,EAAM,EAAGA,EAAM5oB,EAASE,OAAQ0oB,GAAO,EAAK,IAA0B,GAAtB5oB,EAAS4oB,EAAM,GAAU,CAChF,IAAIzE,EAAOhL,EAAQpX,IAAI/B,EAAS4oB,GAAO49C,GAAYmC,EAAYxkD,EAAOrhB,EACtE,GAAI6lE,EAAY,GAAKA,GAAazpE,EAAKsa,QAAQysB,KAAM,CACnDyiC,GAAc,EACd,SAGF,IAAItkD,EAAKjL,EAAQpX,IAAIqmE,EAAYx/C,EAAM,GAAK49C,GAAY,GAAIoC,EAAUxkD,EAAKthB,EACvE+a,EAAM3e,EAAKsa,QAAQ7Q,UAAUggE,GAC7BnmE,EAAQqb,EAAIrb,MACZ+kE,EAAc1pD,EAAI/a,OAClBwkE,EAAYpoE,EAAKmc,WAAW7Y,GAChC,GAAI8kE,GAAaC,GAAeoB,GAAapB,EAAcD,EAAUpnD,UAAY0oD,EAAS,CACxF,IAAI9/C,EAAS9oB,EAAS4oB,EAAM,GAAGo+C,SAAS7tD,EAASmuD,EAAWnjD,EAAO,EAAGnkB,EAAS4oB,GAAO49C,EAAY,EAAGlnE,GACjGwpB,GAAUpP,IACZ1Z,EAAS4oB,GAAO+/C,EAChB3oE,EAAS4oB,EAAM,GAAKggD,EACpB5oE,EAAS4oB,EAAM,GAAKE,IAEpB9oB,EAAS4oB,EAAM,IAAM,EACrB8/C,GAAc,QAGhBA,GAAc,EAKlB,GAAIA,EAAa,CACf,IAAIxsD,EAAc2sD,GAAiC7oE,EAAUooE,EAAanB,GAAY,GAAI9tD,EACvCrW,EAAQ0jE,EAAWlnE,GAClE83C,EAAQyvB,GAAU3qD,EAAahd,EAAM,EAAGI,GAC5C2nE,EAAW7vB,EAAMwvB,MACjB,IAAK,IAAI/9C,EAAM,EAAGA,EAAM7oB,EAASE,OAAQ2oB,GAAO,EAAS7oB,EAAS6oB,EAAM,GAAK,IAC3E7oB,EAAS6I,OAAOggB,EAAK,GACrBA,GAAO,GAET,IAAK,IAAIstC,EAAM,EAAG/pB,EAAI,EAAG+pB,EAAM/e,EAAMp3C,SAASE,OAAQi2D,GAAO,EAAG,CAC9D,IAAI2S,EAAS1xB,EAAMp3C,SAASm2D,GAC5B,MAAO/pB,EAAIpsC,EAASE,QAAUF,EAASosC,GAAK08B,EAAU18B,GAAK,EAC3DpsC,EAAS6I,OAAOujC,EAAG,EAAGgL,EAAMp3C,SAASm2D,GAAM/e,EAAMp3C,SAASm2D,EAAM,GAAI/e,EAAMp3C,SAASm2D,EAAM,KAI7F,OAAO,IAAI73C,GAAc2oD,GAAYA,EAAS/xD,KAAKkyD,IAAQpnE,GAG7D,SAAS0nE,GAAUqB,EAAOjmE,GACxB,IAAKA,IAAWimE,EAAM7oE,OAAU,OAAO6oE,EAEvC,IADA,IAAIjqE,EAAS,GACJ4J,EAAI,EAAGA,EAAIqgE,EAAM7oE,OAAQwI,IAAK,CACrC,IAAI7I,EAAOkpE,EAAMrgE,GACjB5J,EAAOsB,KAAK,IAAIme,GAAW1e,EAAKskB,KAAOrhB,EAAQjD,EAAKukB,GAAKthB,EAAQjD,EAAKhD,OAExE,OAAOiC,EAGT,SAAS+pE,GAAiC7oE,EAAUooE,EAAalsD,EAAa/C,EAASrW,EAAQ0jE,EAAWlnE,GAExG,SAAS0pE,EAAO1rE,EAAKkpE,GACnB,IAAK,IAAI99D,EAAI,EAAGA,EAAIpL,EAAIspE,MAAM1mE,OAAQwI,IAAK,CACzC,IAAIogB,EAASxrB,EAAIspE,MAAMl+D,GAAG3G,IAAIoX,EAASrW,EAAQ0jE,GAC3C19C,EAAU5M,EAAY9b,KAAK0oB,GACtBxpB,EAAQ4nE,UAAY5nE,EAAQ4nE,SAAS5pE,EAAIspE,MAAMl+D,GAAG8R,MAE7D,IAAK,IAAIoO,EAAM,EAAGA,EAAMtrB,EAAI0C,SAASE,OAAQ0oB,GAAO,EAChDogD,EAAO1rE,EAAI0C,SAAS4oB,EAAM,GAAItrB,EAAI0C,SAAS4oB,GAAO49C,EAAY,GAEpE,IAAK,IAAI99D,EAAI,EAAGA,EAAI1I,EAASE,OAAQwI,GAAK,GAA6B,GAApB1I,EAAS0I,EAAI,IAC5DsgE,EAAOhpE,EAAS0I,EAAI,GAAI0/D,EAAY1/D,GAAK89D,EAAY,GAEzD,OAAOtqD,EAGT,SAASurD,GAAiBsB,EAAO7pE,EAAM4D,GACrC,GAAI5D,EAAKouC,OAAU,OAAO,KAE1B,IADA,IAAIvpC,EAAMjB,EAAS5D,EAAKghB,SAAU2tB,EAAQ,KACjCnlC,EAAI,EAAG7I,OAAO,EAAU6I,EAAIqgE,EAAM7oE,OAAQwI,KAC5C7I,EAAOkpE,EAAMrgE,KAAO7I,EAAKskB,KAAOrhB,GAAUjD,EAAKukB,GAAKrgB,KACtD8pC,IAAUA,EAAQ,KAAKztC,KAAKP,GAC7BkpE,EAAMrgE,GAAK,MAGf,OAAOmlC,EAGT,SAAS85B,GAAaljD,GAEpB,IADA,IAAI3lB,EAAS,GACJ4J,EAAI,EAAGA,EAAI+b,EAAMvkB,OAAQwI,IACd,MAAZ+b,EAAM/b,IAAc5J,EAAOsB,KAAKqkB,EAAM/b,IAC9C,OAAO5J,EAQT,SAAS+nE,GAAUkC,EAAO7pE,EAAM4D,EAAQxD,GACtC,IAAIU,EAAW,GAAIipE,GAAW,EAC9B/pE,EAAKtB,SAAQ,SAAU0pE,EAAW4B,GAChC,IAAIr7B,EAAQ45B,GAAiBsB,EAAOzB,EAAW4B,EAAapmE,GAC5D,GAAI+qC,EAAO,CACTo7B,GAAW,EACX,IAAI7J,EAAUyH,GAAUh5B,EAAOy5B,EAAWxkE,EAASomE,EAAa,EAAG5pE,GAC/D8/D,GAAW1lD,IACX1Z,EAASI,KAAK8oE,EAAYA,EAAa5B,EAAUpnD,SAAUk/C,OAInE,IADA,IAAIxJ,EAAS8R,GAAUuB,EAAWtB,GAAaoB,GAASA,GAAQjmE,GAAQoS,KAAKkyD,IACpE1+D,EAAI,EAAGA,EAAIktD,EAAO11D,OAAQwI,IAAYktD,EAAOltD,GAAG7L,KAAKyc,MAAMpa,EAAM02D,EAAOltD,MAC3EpJ,EAAQ4nE,UAAY5nE,EAAQ4nE,SAAStR,EAAOltD,GAAG8R,MACnDo7C,EAAO/sD,OAAOH,IAAK,IAErB,OAAOktD,EAAO11D,QAAUF,EAASE,OAAS,IAAIoe,GAAcs3C,EAAQ51D,GAAY0Z,GAOlF,SAAS0tD,GAAMjyD,EAAGC,GAChB,OAAOD,EAAEgP,KAAO/O,EAAE+O,MAAQhP,EAAEiP,GAAKhP,EAAEgP,GAQrC,SAAS6jD,GAAcc,GAErB,IADA,IAAII,EAAUJ,EACLrgE,EAAI,EAAGA,EAAIygE,EAAQjpE,OAAS,EAAGwI,IAAK,CAC3C,IAAI7I,EAAOspE,EAAQzgE,GACnB,GAAI7I,EAAKskB,MAAQtkB,EAAKukB,GAAM,IAAK,IAAIgoB,EAAI1jC,EAAI,EAAG0jC,EAAI+8B,EAAQjpE,OAAQksC,IAAK,CACvE,IAAIpxB,EAAOmuD,EAAQ/8B,GACnB,GAAIpxB,EAAKmJ,MAAQtkB,EAAKskB,KAAtB,CAUMnJ,EAAKmJ,KAAOtkB,EAAKukB,KACf+kD,GAAWJ,IAASI,EAAUJ,EAAM3/D,SAGxC+/D,EAAQzgE,GAAK7I,EAAK8wB,KAAK9wB,EAAKskB,KAAMnJ,EAAKmJ,MACvCilD,GAAYD,EAAS/8B,EAAGvsC,EAAK8wB,KAAK3V,EAAKmJ,KAAMtkB,EAAKukB,MAEpD,MAhBIpJ,EAAKoJ,IAAMvkB,EAAKukB,KACd+kD,GAAWJ,IAASI,EAAUJ,EAAM3/D,SAGxC+/D,EAAQ/8B,GAAKpxB,EAAK2V,KAAK3V,EAAKmJ,KAAMtkB,EAAKukB,IACvCglD,GAAYD,EAAS/8B,EAAI,EAAGpxB,EAAK2V,KAAK9wB,EAAKukB,GAAIpJ,EAAKoJ,OAe5D,OAAO+kD,EAGT,SAASC,GAAY3kD,EAAO/b,EAAGqsD,GAC7B,MAAOrsD,EAAI+b,EAAMvkB,QAAUknE,GAAMrS,EAAMtwC,EAAM/b,IAAM,EAAKA,IACxD+b,EAAM5b,OAAOH,EAAG,EAAGqsD,GAKrB,SAASsU,GAAgBrsD,GACvB,IAAI6wB,EAAQ,GAOZ,OANA7wB,EAAKW,SAAS,eAAe,SAAUovB,GACrC,IAAIjuC,EAASiuC,EAAE/vB,EAAKF,OAChBhe,GAAUA,GAAU4a,IAASm0B,EAAMztC,KAAKtB,MAE1Cke,EAAK07C,eACL7qB,EAAMztC,KAAKke,GAAc5iB,OAAOshB,EAAKF,MAAM5D,IAAK,CAAC8D,EAAK07C,cAAc3D,QACjEiT,GAAgB7jD,KAAK0pB,GA5P9Bm6B,GAAgB52D,UAAUglD,SAAW,SAAmBtzD,EAAQhC,GAC5D,IAAI+d,EAASvgB,KAEf,GAAIwC,EAAMwsC,OAAU,OAAOhvB,GAAc5E,MAEzC,IADA,IAAIm0B,EAAQ,GACHnlC,EAAI,EAAGA,EAAIpK,KAAK6pE,QAAQjoE,OAAQwI,IAAK,CAC5C,IAAI5J,EAAS+f,EAAOspD,QAAQz/D,GAAG0tD,SAAStzD,EAAQhC,GAC5ChC,GAAU4a,KACV5a,aAAkBkpE,GAAmBn6B,EAAQA,EAAMjsC,OAAO9C,EAAOqpE,SAC9Dt6B,EAAMztC,KAAKtB,IAEpB,OAAOkpE,GAAgB7jD,KAAK0pB,IAG9Bm6B,GAAgB52D,UAAUuI,GAAK,SAAaC,GACxC,IAAIiF,EAASvgB,KAEf,KAAMsb,aAAiBouD,KACnBpuD,EAAMuuD,QAAQjoE,QAAU5B,KAAK6pE,QAAQjoE,OAAU,OAAO,EAC1D,IAAK,IAAIwI,EAAI,EAAGA,EAAIpK,KAAK6pE,QAAQjoE,OAAQwI,IACrC,IAAKmW,EAAOspD,QAAQz/D,GAAGiR,GAAGC,EAAMuuD,QAAQz/D,IAAO,OAAO,EAC1D,OAAO,GAGTs/D,GAAgB52D,UAAUwkD,OAAS,SAAiB12D,GAIlD,IAHE,IAEEJ,EAFE+f,EAASvgB,KAEH2W,GAAS,EACZvM,EAAI,EAAGA,EAAIpK,KAAK6pE,QAAQjoE,OAAQwI,IAAK,CAC5C,IAAIktD,EAAS/2C,EAAOspD,QAAQz/D,GAAGw/D,YAAYhpE,GAC3C,GAAK02D,EAAO11D,OACZ,GAAKpB,EAEE,CACDmW,IACFnW,EAASA,EAAOsK,QAChB6L,GAAS,GAEX,IAAK,IAAIm3B,EAAI,EAAGA,EAAIwpB,EAAO11D,OAAQksC,IAAOttC,EAAOsB,KAAKw1D,EAAOxpB,SAN7DttC,EAAS82D,EASb,OAAO92D,EAASmpE,GAAchzD,EAASnW,EAASA,EAAOoW,KAAKkyD,KAAUv4B,IAMxEm5B,GAAgB7jD,KAAO,SAAegkD,GACpC,OAAQA,EAAQjoE,QACd,KAAK,EAAG,OAAOwZ,GACf,KAAK,EAAG,OAAOyuD,EAAQ,GACvB,QAAS,OAAO,IAAIH,GAAgBG,KA+MxC,IAAImB,GAAa,SAAoBC,EAAO39D,GAC1CtN,KAAKo/B,OAAS9xB,EAGdtN,KAAKwe,MAAQlR,EAAMkR,MAEnBxe,KAAKye,SAAWze,KAAKye,SAASzF,KAAKhZ,MAEnCA,KAAKkrE,MAAQ,KACblrE,KAAKmlC,SAAU,EAKfnlC,KAAK+gB,IAAOkqD,GAASA,EAAME,OAAUp8D,SAASZ,cAAc,OACxD88D,IACEA,EAAM9oD,YAAe8oD,EAAM9oD,YAAYniB,KAAK+gB,KACvCkqD,EAAMttE,MAASstE,EAAMjrE,KAAK+gB,KAC1BkqD,EAAME,QAASnrE,KAAKwtC,SAAU,IAKzCxtC,KAAKsf,SAAW8rD,GAAYprE,MAC5BA,KAAKumE,WAAa,KAClBvmE,KAAKo6D,cAAgB,KACrBiR,GAAoBrrE,MACpBA,KAAKonC,UAAYkkC,GAAetrE,MAChCA,KAAK4oC,QAAUitB,GAAY71D,KAAKwe,MAAM5D,IAAK2wD,GAAevrE,MAAO+qE,GAAgB/qE,MAAOA,KAAK+gB,IAAK/gB,MAElGA,KAAKo7D,qBAAuB,KAK5Bp7D,KAAKijB,SAAW,KAEhB2/C,GAAU5iE,MAEVA,KAAKwrE,YAAc,GACnBxrE,KAAKyrE,qBAGH73B,GAAqB,CAAEtmC,MAAO,GAAGtK,KAAM,IAsT3C,SAASuoE,GAAe7sD,GACtB,IAAImW,EAAQ11B,OAAO/B,OAAO,MAc1B,OAbAy3B,EAAMzmB,MAAQ,cACdymB,EAAM62C,gBAAkB/mE,OAAO+Z,EAAKY,UAEpCZ,EAAKW,SAAS,cAAc,SAAUlf,GAEpC,GADoB,mBAATA,IAAuBA,EAAQA,EAAMue,EAAKF,QACjDre,EAAS,IAAK,IAAI2P,KAAQ3P,EAChB,SAAR2P,EACA+kB,EAAMzmB,OAAS,IAAMjO,EAAM2P,GACrB+kB,EAAM/kB,IAAiB,mBAARA,GAAqC,YAARA,IAClD+kB,EAAM/kB,GAAQnL,OAAOxE,EAAM2P,QAI5B,CAACmQ,GAAWrf,KAAK,EAAG8d,EAAKF,MAAM5D,IAAIM,QAAQysB,KAAM9S,IAG1D,SAASw2C,GAAoB3sD,GAC3B,IAAIa,EAAMb,EAAKF,MAAMI,UACjBX,EAAQsB,EAAItB,MACZD,EAAUuB,EAAIvB,QACdZ,EAAUmC,EAAInC,QAClB,GAAIsB,EAAK6nD,WAAY,CACnB,IAAIxlD,EAAMhS,SAASZ,cAAc,OACjC4S,EAAImiC,aAAa,mBAAoB,QACrCxkC,EAAK07C,cAAgB,CAACr5C,IAAKA,EAAK01C,KAAMx2C,GAAWC,OAAOjC,EAAMzC,IAAKuF,EAAK,CAAC8xC,KAAK,EAAM57B,MAAOvY,EAAK6nD,mBAC3F,GAAInpD,GAAWa,EAAMzC,KAAOwC,EAAQxC,IACzCkD,EAAK07C,cAAgB,SAChB,CACL,IAAIrO,GACCrtC,EAAK07C,eAAiB17C,EAAK07C,cAAcr5C,IAAIqpB,WAAWxoC,QAC3DmqD,EAAQh9C,SAASZ,cAAc,OAC/B49C,EAAM3pC,MAAMrY,SAAW,WACvBgiD,EAAM3pC,MAAM3C,KAAO,aACVf,EAAK07C,cAAc3D,KAAKj7C,KAAOyC,EAAMzC,MAC9CuwC,EAAQrtC,EAAK07C,cAAcr5C,KAEzBgrC,IACArtC,EAAK07C,cAAgB,CAACr5C,IAAKgrC,EAAO0K,KAAMx2C,GAAWC,OAAOjC,EAAMzC,IAAKuwC,EAAO,CAAC8G,KAAK,OAI1F,SAASuY,GAAY1sD,GACnB,OAAQA,EAAKW,SAAS,YAAY,SAAUlf,GAAS,OAA6B,IAAtBA,EAAMue,EAAKF,UAGzE,SAASmtD,GAAiB3oE,GACxB,IAAIuc,EAAMvc,EAAKksD,eACX1qD,EAAS+a,EAAIiwC,YACb5uD,EAAO2e,EAAI+vC,UACf,OAAK1uD,GAAyB,GAAjBA,EAAK0O,SACX,CAAC1O,EAAM4D,EACW,GAAjB5D,EAAK0O,SAAgB1O,EAAKwpC,WAAW5lC,EAAS,GAAK,KAClC,GAAjB5D,EAAK0O,SAAgB1O,EAAKwpC,WAAW5lC,GAAU,MAHb,KAM5C,SAASonE,GAAyBp5D,EAASxP,GACzC,IAAI6oE,EAAaF,GAAiB3oE,GAClC,IAAK6oE,GAAwC,GAA1BA,EAAW,GAAGv8D,SAAiB,OAAO,EACzD,IAAK,IAAIlF,EAAI,EAAGA,EAAIoI,EAAQ5Q,OAAQwI,IAAO,GAAIyhE,EAAWzhE,IAAMoI,EAAQpI,GAAM,OAAO,EACrF,OAAO,EAGT,SAASkhE,GAAe5sD,GACtB,IAAImxC,EAAY,GAKhB,OAJAnxC,EAAKW,SAAS,aAAa,SAAUzgB,GACnC,IAAK,IAAIW,KAAQX,EAAYO,OAAO2T,UAAUC,eAAehD,KAAK8/C,EAAWtwD,KACzEswD,EAAUtwD,GAAQX,EAAIW,OAErBswD,EAGT,SAASic,GAAiBj1D,EAAGC,GAC3B,IAAIi1D,EAAK,EAAGC,EAAK,EACjB,IAAK,IAAIzsE,KAAQsX,EAAG,CAClB,GAAIA,EAAEtX,IAASuX,EAAEvX,GAAS,OAAO,EACjCwsE,IAEF,IAAK,IAAI37B,KAAKt5B,EAAKk1D,IACnB,OAAOD,GAAMC,EA7Xfp4B,GAAmBtmC,MAAM+W,IAAM,WAC3B,IAAI9D,EAASvgB,KAEf,GAAIA,KAAKo/B,OAAO5gB,OAASxe,KAAKwe,MAAO,CACnC,IAAIwoC,EAAOhnD,KAAKo/B,OAEhB,IAAK,IAAI3hC,KADTuC,KAAKo/B,OAAS,GACG4nB,EAAQzmC,EAAO6e,OAAO3hC,GAAQupD,EAAKvpD,GACpDuC,KAAKo/B,OAAO5gB,MAAQxe,KAAKwe,MAE3B,OAAOxe,KAAKo/B,QAMd4rC,GAAWl4D,UAAUoO,OAAS,SAAiB5T,GACzCA,EAAMg5B,iBAAmBtmC,KAAKo/B,OAAOkH,iBAAmB88B,GAAgBpjE,MAC5EA,KAAKo/B,OAAS9xB,EACdtN,KAAKisE,iBAAiB3+D,EAAMkR,OAAO,IAOrCwsD,GAAWl4D,UAAUq0B,SAAW,SAAmB75B,GAC/C,IAAIiT,EAASvgB,KAEX4rB,EAAU,GACd,IAAK,IAAInuB,KAAQ8iB,EAAO6e,OAAUxT,EAAQnuB,GAAQ8iB,EAAO6e,OAAO3hC,GAEhE,IAAK,IAAIo+C,KADTjwB,EAAQpN,MAAQxe,KAAKwe,MACFlR,EAASse,EAAQiwB,GAAUvuC,EAAMuuC,GACpD77C,KAAKkhB,OAAO0K,IAMdo/C,GAAWl4D,UAAUmzB,YAAc,SAAsBznB,GACvDxe,KAAKisE,iBAAiBztD,EAAOxe,KAAKwe,MAAMjV,SAAWiV,EAAMjV,UAG3DyhE,GAAWl4D,UAAUm5D,iBAAmB,SAA2BztD,EAAO0tD,GACtE,IAAI3rD,EAASvgB,KAEXgnD,EAAOhnD,KAAKwe,MAAO2tD,GAAS,EAEhC,GADAnsE,KAAKwe,MAAQA,EACT0tD,EAAc,CAChB,IAAI9kC,EAAYkkC,GAAetrE,MAC3B8rE,GAAiB1kC,EAAWpnC,KAAKonC,aACnCpnC,KAAKonC,UAAYA,EACjB+kC,GAAS,GAEX/I,GAAgBpjE,MAGlBA,KAAKsf,SAAW8rD,GAAYprE,MAC5BqrE,GAAoBrrE,MACpB,IAAIwzD,EAAYuX,GAAgB/qE,MAAOuzD,EAAYgY,GAAevrE,MAE9DosE,EAASF,EAAe,QACtB1tD,EAAM6tD,kBAAoBrlB,EAAKqlB,kBAAoB,eAAiB,WACtEC,EAAYH,IAAWnsE,KAAK4oC,QAAQioB,YAAYryC,EAAM5D,IAAK24C,EAAWC,GACtE+Y,EAAYD,IAAc9tD,EAAMI,UAAUvD,GAAG2rC,EAAKpoC,WAClD4tD,EAAyB,YAAVJ,GAAwBG,GAA8C,MAAjCvsE,KAAK+gB,IAAIqB,MAAMqqD,gBAA0BjhB,EAAexrD,MAEhH,GAAIusE,EAAW,CACbvsE,KAAKg5D,YAAYlG,OACjB,IAAI4Z,GAAiB,EACrB,GAAIJ,EAAW,CAKb,IAAIK,EAAkBnsE,EAAOqwB,QAAU86C,GAAiB3rE,KAAKgD,OACzDmpE,GAAWnsE,KAAK4oC,QAAQ1nB,OAAO1C,EAAM5D,IAAK24C,EAAWC,EAAWxzD,QAClEA,KAAK4oC,QAAQ5nB,UACbhhB,KAAK4oC,QAAUitB,GAAYr3C,EAAM5D,IAAK24C,EAAWC,EAAWxzD,KAAK+gB,IAAK/gB,OAEpE2sE,IACAD,GAAkB1sE,KAAKo1B,WAAaw2C,GAAyBe,EAAiB3sE,KAAKgD,OAInFxC,EAAOioD,IAAMjoD,EAAOkoD,YAAc,KAAO1B,EAAKpoC,UAAUxD,OAASoD,EAAMI,UAAUxD,OACjFoD,EAAM5D,IAAIM,QAAQysB,KAAOqf,EAAKpsC,IAAIM,QAAQysB,OAC1C+kC,GAAiB,GAMnBA,KACE1sE,KAAK6iE,WAAa7iE,KAAKg5D,YAAY4I,iBAAiBvmD,GAAGrb,KAAKgD,KAAKksD,iBAAmBqM,GAAmBv7D,OAC3G65D,GAAe75D,MAAM,EAAO0sE,IAE5B3S,GAAkB/5D,KAAMwe,EAAMI,WAC9B5e,KAAKg5D,YAAYC,mBAEnBj5D,KAAKg5D,YAAYxyC,QAKnB,GAFAxmB,KAAKyrE,kBAAkBzkB,GAET,SAAVolB,EACFpsE,KAAK+gB,IAAIuqC,UAAY,OAChB,GAAc,gBAAV8gB,EAA0B,CACnC,IAAIvhB,EAAW7qD,KAAKgD,KAAKksD,eAAeI,UACpCtvD,KAAKqf,SAAS,2BAA2B,SAAUovB,GAAK,OAAOA,EAAEluB,QAE5D/B,EAAMI,qBAAqBtE,EAAiBuF,cACjD+qC,EAAmB5qD,KAAMA,KAAK4oC,QAAQgnB,YAAYpxC,EAAMI,UAAUiH,MAAMhE,wBAAyBgpC,GAEjGD,EAAmB5qD,KAAMA,KAAKiiB,YAAYzD,EAAMI,UAAU7D,MAAO8vC,SAC5D2hB,GACTxgB,EAAewgB,IAInBxB,GAAWl4D,UAAU85D,mBAAqB,WACxC,IAAIluD,EACJ,MAAOA,EAAO1e,KAAKwrE,YAAYzpE,MAAa2c,EAAKsC,SAAWtC,EAAKsC,WAGnEgqD,GAAWl4D,UAAU24D,kBAAoB,SAA4BtqD,GACjE,IAAIZ,EAASvgB,KAEf,GAAKmhB,GAAaA,EAAU5X,SAAWvJ,KAAKwe,MAAMjV,QAOhD,IAAK,IAAI+gB,EAAM,EAAGA,EAAMtqB,KAAKwrE,YAAY5pE,OAAQ0oB,IAAO,CACtD,IAAIuiD,EAAatsD,EAAOirD,YAAYlhD,GAChCuiD,EAAW3rD,QAAU2rD,EAAW3rD,OAAOX,EAAQY,OATI,CACzDnhB,KAAK4sE,qBACL,IAAK,IAAIxiE,EAAI,EAAGA,EAAIpK,KAAKwe,MAAMjV,QAAQ3H,OAAQwI,IAAK,CAClD,IAAIoP,EAAS+G,EAAO/B,MAAMjV,QAAQa,GAC9BoP,EAAO0C,KAAKwC,MAAQ6B,EAAOirD,YAAY1pE,KAAK0X,EAAO0C,KAAKwC,KAAK6B,OAiBvEyqD,GAAWl4D,UAAUuM,SAAW,SAAmB2kD,EAAUv1B,GAC3D,IAAiDtuC,EAA7CZ,EAAOS,KAAKo/B,QAAUp/B,KAAKo/B,OAAO4kC,GACtC,GAAY,MAARzkE,IAAiBY,EAAQsuC,EAAIA,EAAElvC,GAAQA,GAAS,OAAOY,EAC3D,IAAIoJ,EAAUvJ,KAAKwe,MAAMjV,QACzB,GAAIA,EAAW,IAAK,IAAIa,EAAI,EAAGA,EAAIb,EAAQ3H,OAAQwI,IAAK,CACtD,IAAI6vC,EAAS1wC,EAAQa,GAAGkD,MAAM02D,GAC9B,GAAc,MAAV/pB,IAAmB95C,EAAQsuC,EAAIA,EAAEwL,GAAUA,GAAW,OAAO95C,IAMrE6qE,GAAWl4D,UAAUknD,SAAW,WAC9B,OAAOh6D,KAAKgD,KAAK4rD,eAAiB5uD,KAAK+gB,KAKzCiqD,GAAWl4D,UAAUsvB,MAAQ,WAC3BpiC,KAAKg5D,YAAYlG,OACjB+G,GAAe75D,MAAM,GACjBA,KAAKsf,WACHtf,KAAK+gB,IAAI+rD,UAAa9sE,KAAK+gB,IAAI+rD,YAC5B9sE,KAAK+gB,IAAIqhB,MAAM,CAAC2qC,eAAe,KAExC/sE,KAAKg5D,YAAYxyC,SAQnBotB,GAAmB5wC,KAAKqhB,IAAM,WAC1B,IAAI9D,EAASvgB,KAEXuzC,EAASvzC,KAAKkrE,MAClB,GAAc,MAAV33B,EAAkB,IAAK,IAAI4C,EAASn2C,KAAK+gB,IAAI7O,WAAYikC,EAAQA,EAASA,EAAOjkC,WACnF,GAAuB,GAAnBikC,EAAO7mC,UAAqC,IAAnB6mC,EAAO7mC,UAAkB6mC,EAAOiT,KACzD,OAAO7oC,EAAO2qD,MAAQ/0B,EAE5B,OAAO5C,GAAUxkC,UAWnBi8D,GAAWl4D,UAAU0M,YAAc,SAAwBwC,GACzD,OAAOxC,EAAYxf,KAAMgiB,IAO3BgpD,GAAWl4D,UAAUmP,YAAc,SAAwBzG,GACzD,OAAOyG,EAAYjiB,KAAMwb,IAQ3BwvD,GAAWl4D,UAAUk6D,SAAW,SAAmBxxD,GACjD,OAAOxb,KAAK4oC,QAAQuB,WAAW3uB,IAYjCwvD,GAAWl4D,UAAU6O,QAAU,SAAkBnG,GAC/C,IAAIorC,EAAO5mD,KAAK4oC,QAAQ4oB,OAAOh2C,GAC/B,OAAOorC,EAAOA,EAAKjlC,QAAU,MAY/BqpD,GAAWl4D,UAAU0tB,SAAW,SAAmB5/B,EAAM4D,EAAQslC,QAC/C,IAATA,IAAkBA,GAAQ,GAEjC,IAAItuB,EAAMxb,KAAK4oC,QAAQokB,WAAWpsD,EAAM4D,EAAQslC,GAChD,GAAW,MAAPtuB,EAAe,MAAM,IAAItd,WAAW,sCACxC,OAAOsd,GAUTwvD,GAAWl4D,UAAUmM,eAAiB,SAA2BzC,EAAKgC,GACpE,OAAOS,EAAejf,KAAMwe,GAASxe,KAAKwe,MAAOhC,IAMnDwuD,GAAWl4D,UAAUkO,QAAU,WACxBhhB,KAAK4oC,UACV06B,GAAatjE,MACbA,KAAK4sE,qBACD5sE,KAAKwtC,SACPxtC,KAAK4oC,QAAQ1nB,OAAOlhB,KAAKwe,MAAM5D,IAAK,GAAImwD,GAAgB/qE,MAAOA,MAC/DA,KAAK+gB,IAAIjJ,YAAc,IACd9X,KAAK+gB,IAAI7O,YAClBlS,KAAK+gB,IAAI7O,WAAWoP,YAAYthB,KAAK+gB,KAEvC/gB,KAAK4oC,QAAQ5nB,UACbhhB,KAAK4oC,QAAU,OAIjBoiC,GAAWl4D,UAAU4wD,cAAgB,SAA0Bl0D,GAC7D,OAAOk0D,GAAc1jE,KAAMwP,IAW7Bw7D,GAAWl4D,UAAU2L,SAAW,SAAmBU,GACjD,IAAI+nB,EAAsBlnC,KAAKo/B,OAAO8H,oBAClCA,EAAuBA,EAAoBn3B,KAAK/P,KAAMmf,GACnDnf,KAAKimC,YAAYjmC,KAAKwe,MAAM7gB,MAAMwhB,KAG3ChgB,OAAOo9B,iBAAkByuC,GAAWl4D,UAAW8gC,IAuQ/C91C,EAAQktE,WAAaA,GACrBltE,EAAQmiB,WAAaA,GACrBniB,EAAQkiB,cAAgBA,GACxBliB,EAAQmvE,wBAA0B1O,GAClCzgE,EAAQovE,qBAAuBtO,GAC/B9gE,EAAQqvE,iBAAmBxI,I,oCCl4J3BxlE,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIma,EAAmB,EAAQ,QAC3B6F,EAAuB,EAAQ,QAM/BitD,EAAY,SAAmBnpE,EAAO4c,GACxC7gB,KAAKiE,MAAQA,EACbjE,KAAK6gB,QAA4B,iBAAXA,EAAsBwsD,EAAcxsD,GAAWA,GAGvE,SAASwsD,EAAch4B,GACrB,OAAO,SAAS72B,EAAOva,EAAOuiB,EAAO/gB,GACnC,IAAIsrC,EAASsE,EACb,GAAIpxC,EAAM,GAAI,CACZ,IAAIO,EAASP,EAAM,GAAG+0B,YAAY/0B,EAAM,IACxC8sC,GAAU9sC,EAAM,GAAG6G,MAAMtG,EAASP,EAAM,GAAGrC,QAC3C4kB,GAAShiB,EACT,IAAI8oE,EAAS9mD,EAAQ/gB,EACjB6nE,EAAS,IACXv8B,EAAS9sC,EAAM,GAAG6G,MAAMtG,EAAS8oE,EAAQ9oE,GAAUusC,EACnDvqB,EAAQ/gB,GAGZ,OAAO+Y,EAAMW,GAAGsnC,WAAW1V,EAAQvqB,EAAO/gB,IAI9C,IAAI8nE,EAAY,IAMhB,SAAS7rC,EAAWniB,GAClB,IAAI9U,EAAQ8U,EAAI9U,MAEZ+O,EAAS,IAAIc,EAAiBqD,OAAO,CACvCa,MAAO,CACLoL,KAAM,WAAkB,OAAO,MAC/BjsB,MAAO,SAAewhB,EAAI6nC,GACxB,IAAIwmB,EAASruD,EAAG4I,QAAQ/nB,MACxB,OAAIwtE,IACGruD,EAAG2mC,cAAgB3mC,EAAGyJ,WAAa,KAAOo+B,KAIrD15C,MAAO,CACLmgE,gBAAiB,SAAyB/uD,EAAMmH,EAAMC,EAAI1kB,GACxD,OAAOssE,EAAIhvD,EAAMmH,EAAMC,EAAI1kB,EAAMqJ,EAAO+O,IAE1C8sB,gBAAiB,CACfkgC,eAAgB,SAAU9nD,GACxBoE,YAAW,WACT,IAAIvD,EAAMb,EAAKF,MAAMI,UACjB2lC,EAAUhlC,EAAIglC,QACdA,GAAWmpB,EAAIhvD,EAAM6lC,EAAQ/oC,IAAK+oC,EAAQ/oC,IAAK,GAAI/Q,EAAO+O,SAMtEm0D,cAAc,IAEhB,OAAOn0D,EAGT,SAASk0D,EAAIhvD,EAAMmH,EAAMC,EAAI1kB,EAAMqJ,EAAO+O,GACxC,GAAIkF,EAAK0W,UAAa,OAAO,EAC7B,IAAI5W,EAAQE,EAAKF,MAAOO,EAAQP,EAAM5D,IAAIE,QAAQ+K,GAClD,GAAI9G,EAAMpX,OAAOpJ,KAAK2d,KAAKpO,KAAQ,OAAO,EAG1C,IAFA,IAAI8/D,EAAa7uD,EAAMpX,OAAOinC,YAAY74B,KAAK0Q,IAAI,EAAG1H,EAAMwY,aAAeg2C,GAAYxuD,EAAMwY,aACnD,KAAM,KAAYn2B,EACnDgJ,EAAI,EAAGA,EAAIK,EAAM7I,OAAQwI,IAAK,CACrC,IAAInG,EAAQwG,EAAML,GAAGnG,MAAMH,KAAK8pE,GAC5BzuD,EAAKlb,GAASwG,EAAML,GAAGyW,QAAQrC,EAAOva,EAAO4hB,GAAQ5hB,EAAM,GAAGrC,OAASR,EAAKQ,QAASkkB,GACzF,GAAK3G,EAEL,OADAT,EAAKD,SAASU,EAAGkK,QAAQ7P,EAAQ,CAACiL,UAAWtF,EAAI0G,KAAMA,EAAMC,GAAIA,EAAI1kB,KAAMA,MACpE,EAET,OAAO,EAMT,SAASysE,EAAcrvD,EAAOC,GAE5B,IADA,IAAIlV,EAAUiV,EAAMjV,QACXa,EAAI,EAAGA,EAAIb,EAAQ3H,OAAQwI,IAAK,CACvC,IAAIoP,EAASjQ,EAAQa,GAAI0jE,OAAW,EACpC,GAAIt0D,EAAO0C,KAAKyxD,eAAiBG,EAAWt0D,EAAOuQ,SAASvL,IAAS,CACnE,GAAIC,EAAU,CAEZ,IADA,IAAIU,EAAKX,EAAMW,GAAI4uD,EAASD,EAASrpD,UAC5BqpB,EAAIigC,EAAOzoD,MAAM1jB,OAAS,EAAGksC,GAAK,EAAGA,IAC1C3uB,EAAGyF,KAAKmpD,EAAOzoD,MAAMwoB,GAAGvoB,OAAOwoD,EAAOvoD,KAAKsoB,KAC/C,IAAI7W,EAAQ9X,EAAGvE,IAAIE,QAAQgzD,EAASjoD,MAAMoR,QAC1CxY,EAASU,EAAG0kC,YAAYiqB,EAASjoD,KAAMioD,EAAShoD,GAAItH,EAAM8b,OAAOl5B,KAAK0sE,EAAS1sE,KAAM61B,KAEvF,OAAO,GAGX,OAAO,EAIT,IAAI+2C,EAAS,IAAIZ,EAAU,MAAO,KAE9Ba,EAAW,IAAIb,EAAU,UAAW,KAEpCc,EAAkB,IAAId,EAAU,uCAAwC,KAExEe,EAAmB,IAAIf,EAAU,KAAM,KAEvCgB,EAAkB,IAAIhB,EAAU,uCAAwC,KAExEiB,EAAmB,IAAIjB,EAAU,KAAM,KAGvCkB,EAAc,CAACJ,EAAiBC,EAAkBC,EAAiBC,GAkBvE,SAASE,EAAkBj2C,EAAQhpB,EAAUkpB,EAAUg2C,GACrD,OAAO,IAAIpB,EAAU90C,GAAQ,SAAU9Z,EAAOva,EAAOuiB,EAAO/gB,GAC1D,IAAIovB,EAAQ2D,aAAoBC,SAAWD,EAASv0B,GAASu0B,EACzDrZ,EAAKX,EAAMW,GAAGpgB,OAAOynB,EAAO/gB,GAC5BoZ,EAASM,EAAGvE,IAAIE,QAAQ0L,GAAQvoB,EAAQ4gB,EAAO8b,aAAc8zC,EAAWxwE,GAASkiB,EAAqBo2B,aAAat4C,EAAOqR,EAAUulB,GACxI,IAAK45C,EAAY,OAAO,KACxBtvD,EAAGs/B,KAAKxgD,EAAOwwE,GACf,IAAIjnE,EAAS2X,EAAGvE,IAAIE,QAAQ0L,EAAQ,GAAGhF,WAIvC,OAHIha,GAAUA,EAAOjJ,MAAQ+Q,GAAY6Q,EAAqBuuD,QAAQvvD,EAAGvE,IAAK4L,EAAQ,MAChFgoD,GAAiBA,EAAcvqE,EAAOuD,KACxC2X,EAAGxc,KAAK6jB,EAAQ,GACbrH,KAWX,SAASwvD,EAAuBr2C,EAAQhpB,EAAUkpB,GAChD,OAAO,IAAI40C,EAAU90C,GAAQ,SAAU9Z,EAAOva,EAAOuiB,EAAO/gB,GAC1D,IAAIoZ,EAASL,EAAM5D,IAAIE,QAAQ0L,GAC3BqO,EAAQ2D,aAAoBC,SAAWD,EAASv0B,GAASu0B,EAC7D,OAAK3Z,EAAOje,MAAM,GAAG6zC,eAAe51B,EAAO3a,OAAO,GAAI2a,EAAOhC,YAAY,GAAIvN,GACtEkP,EAAMW,GACVpgB,OAAOynB,EAAO/gB,GACdmpE,aAAapoD,EAAOA,EAAOlX,EAAUulB,GAHyD,QAOrG/2B,EAAQsvE,UAAYA,EACpBtvE,EAAQ4jC,WAAaA,EACrB5jC,EAAQ+vE,cAAgBA,EACxB/vE,EAAQkwE,OAASA,EACjBlwE,EAAQmwE,SAAWA,EACnBnwE,EAAQowE,gBAAkBA,EAC1BpwE,EAAQqwE,iBAAmBA,EAC3BrwE,EAAQswE,gBAAkBA,EAC1BtwE,EAAQuwE,iBAAmBA,EAC3BvwE,EAAQwwE,YAAcA,EACtBxwE,EAAQywE,kBAAoBA,EAC5BzwE,EAAQ6wE,uBAAyBA,G,oCCvLjCxvE,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIggB,EAAuB,EAAQ,QAC/B3F,EAAmB,EAAQ,QAE3Bq0D,EAAQ,CAAC,KAAM,GACfC,EAAQ,CAAC,KAAM,GACfC,EAAQ,CAAC,KAAM,GAOfC,EAAc,CAChBn6C,MAAO,CAAC2W,MAAO,CAAC7rC,QAAS,IACzBmkC,SAAU,CAAC,CAAC70B,IAAK,KAAMupB,SAAU,SAAkBzX,GACjD,MAAO,CAACyqB,MAAOzqB,EAAI0qB,aAAa,UAAY1qB,EAAI2qB,aAAa,SAAW,MAE1E3H,MAAO,SAAenjC,GACpB,OAA2B,GAApBA,EAAKi0B,MAAM2W,MAAaqjC,EAAQ,CAAC,KAAM,CAACroD,MAAO5lB,EAAKi0B,MAAM2W,OAAQ,KAMzEyjC,EAAa,CACfnrC,SAAU,CAAC,CAAC70B,IAAK,OACjB80B,MAAO,WAAmB,OAAO+qC,IAK/BI,EAAW,CACbprC,SAAU,CAAC,CAAC70B,IAAK,OACjB80B,MAAO,WAAmB,OAAOgrC,GACjC5jC,UAAU,GAGZ,SAASjsC,EAAIN,EAAK0O,GAChB,IAAI+kB,EAAO,GACX,IAAK,IAAI9yB,KAAQX,EAAOyzB,EAAK9yB,GAAQX,EAAIW,GACzC,IAAK,IAAI06C,KAAU3sC,EAAS+kB,EAAK4nB,GAAU3sC,EAAM2sC,GACjD,OAAO5nB,EAgBT,SAAS88C,EAAa31C,EAAO41C,EAAaC,GACxC,OAAO71C,EAAMxU,OAAO,CAClBmR,aAAcj3B,EAAI8vE,EAAa,CAAC9zD,QAAS,aAAc2oB,MAAOwrC,IAC9Dn5C,YAAah3B,EAAI+vE,EAAY,CAAC/zD,QAAS,aAAc2oB,MAAOwrC,IAC5DtkC,UAAW7rC,EAAIgwE,EAAU,CAACh0D,QAASk0D,MASvC,SAASE,EAAW70C,EAAU5F,GAC5B,OAAO,SAASrW,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACV7gB,EAAQ8gB,EAAM4b,WAAW7b,GAAMywD,GAAS,EAAOC,EAAavxE,EAChE,IAAKA,EAAS,OAAO,EAErB,GAAIA,EAAM2e,OAAS,GAAKmC,EAAMne,KAAK3C,EAAM2e,MAAQ,GAAGre,KAAKizC,kBAAkB/W,IAAiC,GAApBx8B,EAAMw5B,WAAiB,CAE7G,GAAoC,GAAhC1Y,EAAM7a,MAAMjG,EAAM2e,MAAQ,GAAW,OAAO,EAChD,IAAI6yD,EAAUjxD,EAAM5D,IAAIE,QAAQ7c,EAAMuoB,MAAQ,GAC9CgpD,EAAa,IAAIh1D,EAAiB04B,UAAUu8B,EAASA,EAASxxE,EAAM2e,OAChE3e,EAAM05B,SAAW15B,EAAM0J,OAAOmV,aAC9B7e,EAAQ,IAAIuc,EAAiB04B,UAAUn0B,EAAOP,EAAM5D,IAAIE,QAAQgE,EAAIrZ,IAAIxH,EAAM2e,QAAS3e,EAAM2e,QACjG2yD,GAAS,EAEX,IAAI9wB,EAAOt+B,EAAqBo2B,aAAai5B,EAAY/0C,EAAU5F,EAAO52B,GAC1E,QAAKwgD,IACDhgC,GAAYA,EAASixD,EAAalxD,EAAMW,GAAIlhB,EAAOwgD,EAAM8wB,EAAQ90C,GAAUnR,mBACxE,IAIX,SAASomD,EAAavwD,EAAIlhB,EAAO0xE,EAAUC,EAAYn1C,GAErD,IADA,IAAIvf,EAAUV,EAAiB+zB,SAASnzB,MAC/BhR,EAAIulE,EAAS/tE,OAAS,EAAGwI,GAAK,EAAGA,IACtC8Q,EAAUV,EAAiB+zB,SAAS1oB,KAAK8pD,EAASvlE,GAAG7L,KAAKnB,OAAOuyE,EAASvlE,GAAGyqB,MAAO3Z,IAExFiE,EAAGyF,KAAK,IAAIzE,EAAqB+kC,kBAAkBjnD,EAAMuoB,OAASopD,EAAa,EAAI,GAAI3xE,EAAMwH,IAAKxH,EAAMuoB,MAAOvoB,EAAMwH,IACvF,IAAI+U,EAAiBW,MAAMD,EAAS,EAAG,GAAIy0D,EAAS/tE,QAAQ,IAG1F,IADA,IAAI2tC,EAAQ,EACHjlB,EAAM,EAAGA,EAAMqlD,EAAS/tE,OAAQ0oB,IAAaqlD,EAASrlD,GAAK/rB,MAAQk8B,IAAY8U,EAAQjlB,EAAM,GAItG,IAHA,IAAIulD,EAAaF,EAAS/tE,OAAS2tC,EAE/BugC,EAAW7xE,EAAMuoB,MAAQmpD,EAAS/tE,QAAUguE,EAAa,EAAI,GAAIjoE,EAAS1J,EAAM0J,OAC3E4iB,EAAMtsB,EAAMw5B,WAAY3W,EAAI7iB,EAAM05B,SAAUnC,GAAQ,EAAMjL,EAAMzJ,EAAGyJ,IAAOiL,GAAQ,GACpFA,GAASrV,EAAqB4vD,SAAS5wD,EAAGvE,IAAKk1D,EAAUD,KAC5D1wD,EAAGvX,MAAMkoE,EAAUD,GACnBC,GAAY,EAAID,GAElBC,GAAYnoE,EAAOnF,MAAM+nB,GAAK3I,SAEhC,OAAOzC,EAMT,SAAS6wD,EAAct1C,GACrB,OAAO,SAASlc,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACVle,EAAO2e,EAAI3e,KACf,GAAKA,GAAQA,EAAKquC,SAAYlwB,EAAMnC,MAAQ,IAAMmC,EAAMo0B,WAAWr0B,GAAQ,OAAO,EAClF,IAAImxD,EAAclxD,EAAMne,MAAM,GAC9B,GAAIqvE,EAAY1xE,MAAQm8B,EAAY,OAAO,EAC3C,GAAiC,GAA7B3b,EAAMpX,OAAOuT,QAAQysB,KAAW,CAIlC,GAAmB,GAAf5oB,EAAMnC,OAAcmC,EAAMne,MAAM,GAAGrC,MAAQm8B,GAC3C3b,EAAM7a,OAAO,IAAM6a,EAAMne,MAAM,GAAGkc,WAAa,EAAK,OAAO,EAC/D,GAAI2B,EAAU,CAIZ,IAHA,IAAIggC,EAAOjkC,EAAiB+zB,SAASnzB,MAAO80D,EAAWnxD,EAAM7a,OAAO,GAAK,EAGhEyY,EAAIoC,EAAMnC,OAASszD,EAAW,EAAI,GAAIvzD,GAAKoC,EAAMnC,MAAQ,EAAGD,IACjE8hC,EAAOjkC,EAAiB+zB,SAAS1oB,KAAK9G,EAAMne,KAAK+b,GAAG0V,KAAKosB,IAE7DA,EAAOA,EAAKz5B,OAAOxK,EAAiB+zB,SAAS1oB,KAAK6U,EAAS4b,kBAC3D,IAAI8lB,EAAO59C,EAAMW,GAAG/e,QAAQ2e,EAAMvX,OAAO0oE,EAAW,MAAQ,GAAInxD,EAAMtB,OAAO,GAAI,IAAIjD,EAAiBW,MAAMsjC,EAAMyxB,EAAW,EAAI,EAAG,IACpI9T,EAAKh9C,aAAaZ,EAAMI,UAAUxc,YAAY6Y,KAAKmhD,EAAKxhD,IAAIE,QAAQiE,EAAMvD,KAAO00D,EAAW,EAAI,MAChGzxD,EAAS29C,EAAK9yC,kBAEhB,OAAO,EAET,IAAI6mD,EAAWrxD,EAAItD,KAAOuD,EAAMtZ,MAAQwqE,EAAY5zD,eAAe,GAAGC,YAAc,KAChF6C,EAAKX,EAAMW,GAAGpgB,OAAOggB,EAAMvD,IAAKsD,EAAItD,KACpCqtB,EAAQsnC,GAAY,CAAC,KAAM,CAAC5xE,KAAM4xE,IACtC,QAAKhwD,EAAqB4vD,SAAS5wD,EAAGvE,IAAKmE,EAAMvD,IAAK,EAAGqtB,KACrDpqB,GAAYA,EAASU,EAAGvX,MAAMmX,EAAMvD,IAAK,EAAGqtB,GAAOvf,mBAChD,IAOX,SAAS8mD,EAAa11C,GACpB,OAAO,SAASlc,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACV7gB,EAAQ8gB,EAAM4b,WAAW7b,GAAK,SAAUle,GAAQ,OAAOA,EAAKkc,YAAclc,EAAKwO,WAAW7Q,MAAQm8B,KACtG,QAAKz8B,KACAwgB,IACDM,EAAMne,KAAK3C,EAAM2e,MAAQ,GAAGre,MAAQm8B,EAC7B21C,EAAgB7xD,EAAOC,EAAUic,EAAUz8B,GAE3CqyE,EAAc9xD,EAAOC,EAAUxgB,MAI9C,SAASoyE,EAAgB7xD,EAAOC,EAAUic,EAAUz8B,GAClD,IAAIkhB,EAAKX,EAAMW,GAAI1Z,EAAMxH,EAAMwH,IAAK8qE,EAAYtyE,EAAM6gB,IAAIrZ,IAAIxH,EAAM2e,OASpE,OARInX,EAAM8qE,IAGRpxD,EAAGyF,KAAK,IAAIzE,EAAqB+kC,kBAAkBz/C,EAAM,EAAG8qE,EAAW9qE,EAAK8qE,EAC9C,IAAI/1D,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAK6U,EAASt9B,OAAO,KAAMa,EAAM0J,OAAO0qB,SAAU,EAAG,GAAI,GAAG,IAC/Ip0B,EAAQ,IAAIuc,EAAiB04B,UAAU/zB,EAAGvE,IAAIE,QAAQ7c,EAAM8gB,MAAMvD,KAAM2D,EAAGvE,IAAIE,QAAQy1D,GAAYtyE,EAAM2e,QAE3G6B,EAASU,EAAGqxD,KAAKvyE,EAAOkiB,EAAqBswD,WAAWxyE,IAAQqrB,mBACzD,EAGT,SAASgnD,EAAc9xD,EAAOC,EAAUxgB,GAGtC,IAFA,IAAIkhB,EAAKX,EAAMW,GAAIpK,EAAO9W,EAAM0J,OAEvB6T,EAAMvd,EAAMwH,IAAK2E,EAAInM,EAAM05B,SAAW,EAAG7W,EAAI7iB,EAAMw5B,WAAYrtB,EAAI0W,EAAG1W,IAC7EoR,GAAOzG,EAAKvS,MAAM4H,GAAGwX,SACrBzC,EAAGpgB,OAAOyc,EAAM,EAAGA,EAAM,GAE3B,IAAIqD,EAASM,EAAGvE,IAAIE,QAAQ7c,EAAMuoB,OAAQtR,EAAO2J,EAAO4C,UACpD0iC,EAA8B,GAApBlmD,EAAMw5B,WAAiB2sB,EAAQnmD,EAAM05B,UAAY5iB,EAAK+H,WAChEnV,EAASkX,EAAOje,MAAM,GAAI8vE,EAAc7xD,EAAO3a,OAAO,GAC1D,IAAKyD,EAAOqpC,WAAW0/B,GAAevsB,EAAU,EAAI,GAAIusB,EAAc,EAC/Cx7D,EAAKgG,QAAQ8J,OAAOo/B,EAAQ5pC,EAAiB+zB,SAASnzB,MAAQZ,EAAiB+zB,SAAS1oB,KAAK9Q,KAChH,OAAO,EACX,IAAIyR,EAAQ3H,EAAOrD,IAAK/V,EAAM+gB,EAAQtR,EAAK0M,SAS3C,OALAzC,EAAGyF,KAAK,IAAIzE,EAAqB+kC,kBAAkB1+B,GAAS29B,EAAU,EAAI,GAAI1+C,GAAO2+C,EAAQ,EAAI,GAAI59B,EAAQ,EAAG/gB,EAAM,EACxF,IAAI+U,EAAiBW,OAAOgpC,EAAU3pC,EAAiB+zB,SAASnzB,MAAQZ,EAAiB+zB,SAAS1oB,KAAK9Q,EAAKsd,KAAK7X,EAAiB+zB,SAASnzB,SAChI4J,OAAOo/B,EAAQ5pC,EAAiB+zB,SAASnzB,MAAQZ,EAAiB+zB,SAAS1oB,KAAK9Q,EAAKsd,KAAK7X,EAAiB+zB,SAASnzB,SACrH+oC,EAAU,EAAI,EAAGC,EAAQ,EAAI,GAAID,EAAU,EAAI,IACvF1lC,EAASU,EAAGmK,mBACL,EAMT,SAASqnD,EAAaj2C,GACpB,OAAO,SAASlc,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACV7gB,EAAQ8gB,EAAM4b,WAAW7b,GAAK,SAAUle,GAAQ,OAAOA,EAAKkc,YAAclc,EAAKwO,WAAW7Q,MAAQm8B,KACtG,IAAKz8B,EAAS,OAAO,EACrB,IAAIw5B,EAAax5B,EAAMw5B,WACvB,GAAkB,GAAdA,EAAmB,OAAO,EAC9B,IAAI9vB,EAAS1J,EAAM0J,OAAQ6Z,EAAa7Z,EAAOnF,MAAMi1B,EAAa,GAClE,GAAIjW,EAAWjjB,MAAQm8B,EAAY,OAAO,EAE1C,GAAIjc,EAAU,CACZ,IAAImyD,EAAepvD,EAAWvE,WAAauE,EAAWvE,UAAU1e,MAAQoJ,EAAOpJ,KAC3EwvC,EAAQvzB,EAAiB+zB,SAAS1oB,KAAK+qD,EAAel2C,EAASt9B,SAAW,MAC1E0N,EAAQ,IAAI0P,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAK6U,EAASt9B,OAAO,KAAMod,EAAiB+zB,SAAS1oB,KAAKle,EAAOpJ,KAAKnB,OAAO,KAAM2wC,MAC9H6iC,EAAe,EAAI,EAAG,GACxCppE,EAASvJ,EAAMuoB,MAAO/I,EAAQxf,EAAMwH,IACxCgZ,EAASD,EAAMW,GAAGyF,KAAK,IAAIzE,EAAqB+kC,kBAAkB19C,GAAUopE,EAAe,EAAI,GAAInzD,EACtDjW,EAAQiW,EAAO3S,EAAO,GAAG,IAC5Dwe,kBAEZ,OAAO,GAIXxrB,EAAQkxE,YAAcA,EACtBlxE,EAAQmxE,WAAaA,EACrBnxE,EAAQoxE,SAAWA,EACnBpxE,EAAQqxE,aAAeA,EACvBrxE,EAAQwxE,WAAaA,EACrBxxE,EAAQkyE,cAAgBA,EACxBlyE,EAAQsyE,aAAeA,EACvBtyE,EAAQ6yE,aAAeA,G,6DC5PvBxxE,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIma,EAAmB,EAAQ,QAC3BE,EAAmB,EAAQ,QAC3Bq2D,EAAoB,EAAQ,QAU5BC,EAAyB,SAAgCxhE,GAC3D,OAAO,SAAU6P,GACf,IAAIxX,EAASopE,EAAqBzhE,EAArByhE,CAA+B5xD,EAAGP,WAC/C,OAAIjX,EACKqpE,EAAgBrpE,EAAO6T,IAAvBw1D,CAA4B7xD,GAE9BA,IAcP8xD,EAA0B,SAAiC3hE,EAAU4L,GACvE,OAAO,SAAUiE,GACVlX,MAAMC,QAAQoH,KACjBA,EAAW,CAACA,IAEd,IAAK,IAAIlF,EAAI,EAAGO,EAAQ2E,EAAS1N,OAAQwI,EAAIO,EAAOP,IAAK,CACvD,IAAIzC,EAASopE,EAAqBzhE,EAASlF,GAA9B2mE,CAAkC5xD,EAAGP,WAClD,GAAIjX,EAAQ,CACV,IAAIupE,EAAQC,EAAiBxpE,EAAO6T,IAAKN,EAA7Bi2D,CAAsChyD,GAClD,GAAI+xD,IAAU/xD,EACZ,OAAO+xD,GAIb,OAAO/xD,IAYPiyD,EAAqB,SAA4BjyD,GACnD,GAAIkyD,EAAgBlyD,EAAGP,WAAY,CACjC,IAAIiH,EAAO1G,EAAGP,UAAUG,MAAMvD,IAC1BsK,EAAK3G,EAAGP,UAAUE,IAAItD,IAC1B,OAAO81D,EAAQnyD,EAAGpgB,OAAO8mB,EAAMC,IAEjC,OAAO3G,GAaLoyD,EAAsB,SAA6Br2D,GACrD,OAAO,SAAUiE,GACf,GAAIkyD,EAAgBlyD,EAAGP,WAAY,CACjC,IAAI4yD,EAAgBryD,EAAGP,UACnBG,EAAQyyD,EAAczyD,MACtBD,EAAM0yD,EAAc1yD,IAExB,GAAI5D,aAAmBV,EAAiB+zB,UAAYxvB,EAAMpX,OAAOqpC,WAAWjyB,EAAM7a,QAAS6a,EAAMlC,aAAc3B,IAAY6D,EAAMpX,OAAO8sC,eAAe11B,EAAM7a,QAAS6a,EAAMlC,aAAc3B,EAAQ3c,MAChM,OAAO+yE,EAAQnyD,EAAG0kC,YAAY9kC,EAAMvD,IAAKsD,EAAItD,IAAKN,GAEjDkE,aAAa,IAAI9E,EAAiBuF,cAAcV,EAAGvE,IAAIE,QAAQiE,EAAMvD,QAG1E,OAAO2D,IAcPsyD,EAAmB,SAA0B1nE,GAC/C,IAAIyS,EAAM5e,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAC9E,OAAO,SAAUuhB,GACf,IAAIuyD,EAAgBp3D,EAAiB6C,UAAUZ,SAAS4C,EAAGvE,IAAIE,QAAQ/Q,GAAWyS,GAAK,GACvF,OAAIk1D,EACKvyD,EAAGC,aAAasyD,GAElBvyD,IAIPwyD,EAAmB,SAA0B/wE,GAC/C,OAAOA,EAAKrC,MAAQqC,EAAKrC,KAAK2d,KAAK4oC,YAEjC8sB,EAAmB,SAA0BhxE,GAC/C,OAAO+wE,EAAiB/wE,IAASA,EAAKrC,KAAKywC,QAGzC5vB,EAAe,SAAsBxe,EAAM4a,EAAK2D,GAClD,OAAIyyD,EAAiBhxE,GACZue,EAAGC,aAAa,IAAI9E,EAAiBuF,cAAcV,EAAGvE,IAAIE,QAAQU,KAEpEi2D,EAAiBj2D,EAAjBi2D,CAAsBtyD,IAe3B0yD,EAAa,SAAoB32D,EAASnR,EAAU+nE,GACtD,OAAO,SAAU3yD,GACf,IAAI4yD,EAAkC,kBAAbhoE,EACrBgV,EAAQI,EAAGP,UAAUG,MAErBizD,EAAaD,EAAc5yD,EAAGvE,IAAIE,QAAQ/Q,GAAYsnE,EAAgBlyD,EAAGP,WAAaO,EAAGvE,IAAIE,QAAQiE,EAAMvD,IAAM,GAAKuD,EACtHpX,EAASqqE,EAAWrqE,OAIxB,GAAI0pE,EAAgBlyD,EAAGP,YAAckzD,EAAc,CACjD,IAAIG,EAAQ9yD,EAEZ,GADAA,EAAKoyD,EAAoBr2D,EAApBq2D,CAA6BpyD,GAC9B8yD,IAAU9yD,EACZ,OAAOA,EAKX,GAAI+yD,EAAiBvqE,GAAS,CAC5B,IAAIwqE,EAAShzD,EAEb,GADAA,EAAK8xD,EAAwBtpE,EAAOpJ,KAAM2c,EAArC+1D,CAA8C9xD,GAC/CgzD,IAAWhzD,EAAI,CACjB,IAAI3D,EAAMm2D,EAAiBz2D,GAC3B82D,EAAWxqE,OAAOwqE,EAAWp1D,OAASo1D,EAAWx2D,IACjD,OAAO4D,EAAalE,EAASM,EAAK2D,IAKtC,GAAIizD,EAAUJ,EAAY92D,GAAU,CAClCiE,EAAG4xB,OAAOihC,EAAWx2D,IAAKN,GAC1B,IAAIm3D,EAAON,EAAcC,EAAWx2D,IAAMm2D,EAAiBz2D,GAC3DiE,EAAGP,UAAUZ,QAAQxC,IAAM,EAAI2D,EAAGP,UAAUZ,QAAQxC,IACpD,OAAO81D,EAAQlyD,EAAalE,EAASm3D,EAAMlzD,IAI7C,IAAK,IAAI/U,EAAI4nE,EAAWp1D,MAAOxS,EAAI,EAAGA,IAAK,CACzC,IAAIkoE,EAAQN,EAAWv0D,MAAMrT,GACzBuQ,EAAOwE,EAAGvE,IAAIE,QAAQw3D,GAC1B,GAAIF,EAAUz3D,EAAMO,GAElB,OADAiE,EAAG4xB,OAAOuhC,EAAOp3D,GACVo2D,EAAQlyD,EAAalE,EAASo3D,EAAOnzD,IAGhD,OAAOA,IAaPozD,EAAsB,SAA6BjjE,EAAU/Q,EAAMs2B,EAAOoC,GAC5E,OAAO,SAAU9X,GACf,IAAIxX,EAASopE,EAAqBzhE,EAArByhE,CAA+B5xD,EAAGP,WAC/C,OAAIjX,EACK2pE,EAAQnyD,EAAG2b,cAAcnzB,EAAO6T,IAAKjd,EAAMY,OAAO+H,OAAO,GAAIS,EAAO/G,KAAKi0B,MAAOA,GAAQoC,IAE1F9X,IAYPqzD,EAAyB,SAAgCljE,GAC3D,OAAO,SAAU6P,GACf,IAAKkyD,EAAgBlyD,EAAGP,WAAY,CAClC,IAAIjX,EAASopE,EAAqBzhE,EAArByhE,CAA+B5xD,EAAGP,WAC/C,GAAIjX,EACF,OAAO2pE,EAAQnyD,EAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAO+hB,EAAGvE,IAAKjT,EAAO6T,OAGxF,OAAO2D,IAYPszD,EAAmB,SAA0BtzD,GAC/C,IAAIpV,EAAW2oE,EAAyBvzD,EAAGP,WAC3C,MAAwB,kBAAb7U,EACFinE,EAAgBjnE,EAAhBinE,CAA0B7xD,GAE5BA,GAWLkyD,EAAkB,SAAyBzyD,GAC7C,OAAOA,aAAqBtE,EAAiBuF,eAK3C8yD,EAAgB,SAAuBrjE,EAAU1O,GACnD,OAAOqH,MAAMC,QAAQoH,IAAaA,EAASupB,QAAQj4B,EAAKrC,OAAS,GAAKqC,EAAKrC,OAAS+Q,GAKlFgiE,EAAU,SAAiBnyD,GAC7B,OAAOhgB,OAAO+H,OAAO/H,OAAO/B,OAAO+hB,GAAKA,GAAIknC,QAAQX,KAAKC,QAOvDwrB,EAAmB,SAA0BpnE,EAAUmR,GACzD,OAAO,SAAUiE,GACf,IAAIve,EAAOue,EAAGvE,IAAImF,OAAOhW,GACrB4Q,EAAOwE,EAAGvE,IAAIE,QAAQ/Q,GAC1B,GAAIinC,EAAWr2B,EAAMO,GAAU,CAC7BiE,EAAKA,EAAG0kC,YAAY95C,EAAUA,EAAWnJ,EAAKghB,SAAU1G,GACxD,IAAIsL,EAAQrH,EAAGP,UAAUG,MAAMvD,IAAM,EAKrC,OAHA2D,EAAKsyD,EAAiB17D,KAAK0Q,IAAID,EAAO,IAAK,EAAtCirD,CAAyCtyD,GAE9CA,EAAKsyD,EAAiBtyD,EAAGP,UAAUG,MAAMyH,QAApCirD,CAA6CtyD,GAC3CmyD,EAAQnyD,GAEjB,OAAOA,IAMP6xB,EAAa,SAAoBr2B,EAAMO,GACzC,IAAIta,EAAO+Z,EAAK/Z,KAAK+Z,EAAKiC,OAC1B,OAAOhc,GAAQA,EAAKrC,KAAKs8B,aAAa3f,aAAmBV,EAAiB+zB,SAAWrzB,EAAUV,EAAiB+zB,SAAS1oB,KAAK3K,KAM5H81D,EAAkB,SAAyBjnE,GAC7C,OAAO,SAAUoV,GACf,IAAIve,EAAOue,EAAGvE,IAAImF,OAAOhW,GACzB,OAAOunE,EAAQnyD,EAAGpgB,OAAOgL,EAAUA,EAAWnJ,EAAKghB,aAMnDgxD,EAAiB,SAAwBt4C,GAC3C,GAAIA,EAAOiZ,OAAOq/B,eAChB,OAAOt4C,EAAOiZ,OAAOq/B,eAEvB,IAAIC,EAAQ,GAQZ,OAPA1zE,OAAOyJ,KAAK0xB,EAAOd,OAAOl6B,SAAQ,SAAUf,GAC1C,IAAI+Q,EAAWgrB,EAAOd,MAAMj7B,GACxB+Q,EAAS4M,KAAK42D,YAChBD,EAAMvjE,EAAS4M,KAAK42D,WAAaxjE,MAGrCgrB,EAAOiZ,OAAOq/B,eAAiBC,EACxBA,GAaLT,EAAY,SAAmBz3D,EAAMO,GACvC,IAAIhX,EAAQyW,EAAKzW,QAEjB,OAAIgX,aAAmBV,EAAiB+zB,SAC/B5zB,EAAKhT,OAAOqpC,WAAW9sC,EAAOA,EAAOgX,GACnCA,aAAmBV,EAAiBipB,MACtC9oB,EAAKhT,OAAO8sC,eAAevwC,EAAOA,EAAOgX,EAAQ3c,OAOxD2zE,EAAmB,SAA0BtxE,GAC/C,OAAQA,GAA2B,cAAnBA,EAAKrC,KAAKd,MAA0C,IAAlBmD,EAAKghB,UASrDmxD,EAAwB,SAA+Bp4D,GACzD,IAAIud,EAAY,SAAmBt3B,GACjC,OAAOA,EAAKrC,KAAK2d,KAAK42D,WAAa,SAAShhE,KAAKlR,EAAKrC,KAAK2d,KAAK42D,YAElE,OAAOE,EAA2Br4D,EAAMud,IAGtC+6C,EAAa,SAAoBC,GACnC,IAAItnC,EAAchuC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAEtF,OAAIguC,EACKsnC,EAASz5B,cAAc,KAAM7N,GAG/BsnC,EAAS58B,iBAKd68B,EAAiB,SAAwB5xD,GAC3C,OAAO,SAAU3C,GAMf,IALA,IAAInb,EAAMotE,EAAkBuC,SAAS/uD,IAAIzF,EAAUy0D,YAAYzyE,MAAM,IACjE4lB,EAAQ5H,EAAUy0D,YAAY7sD,OAAO,GACrC8sD,EAAQ7vE,EAAI8vE,YAAYhyD,GACxBiyD,EAAgB/vE,EAAI8vE,YAAY9vE,EAAIgwE,YAAY70D,EAAUy0D,YAAY73D,IAAMgL,EAAO5H,EAAU80D,UAAUl4D,IAAMgL,IAExGpc,EAAI,EAAGO,EAAQ2oE,EAAM1xE,OAAQwI,EAAIO,EAAOP,IAC/C,IAAyC,IAArCopE,EAAc36C,QAAQy6C,EAAMlpE,IAC9B,OAAO,EAIX,OAAO,IA0BPupE,EAAY,SAAmBxtD,GACjC,OAAOA,EAAM,GAAG1iB,KAAI,SAAU2sC,EAAGhmC,GAC/B,OAAO+b,EAAM1iB,KAAI,SAAUmwE,GACzB,OAAOA,EAAOxpE,UA+BhBypE,EAAgC,SAAuCC,GAGzE,IAFA,IAAIrwE,EAAMotE,EAAkBuC,SAAS/uD,IAAIyvD,GACrCC,EAAO,GACFC,EAAW,EAAGA,EAAWvwE,EAAIkf,OAAQqxD,IAAY,CAIxD,IAHA,IAAIC,EAAW,GACX/9B,EAAO,GAEFg+B,EAAW,EAAGA,EAAWzwE,EAAI+c,MAAO0zD,IAAY,CACvD,IAAIC,EAAU1wE,EAAIA,IAAIuwE,EAAWvwE,EAAI+c,MAAQ0zD,GACzCE,EAAON,EAAU/zD,OAAOo0D,GACxB5yD,EAAO9d,EAAI4wE,SAASF,GACpBj+B,EAAKi+B,IAAY5yD,EAAK1f,MAAQmyE,EAChCC,EAASnyE,KAAK,OAGhBo0C,EAAKi+B,IAAW,EAEhBF,EAASnyE,KAAKsyE,IAGhBL,EAAKjyE,KAAKmyE,GAGZ,OAAOF,GA6BLO,EAAgC,SAAuCR,EAAWS,GAGpF,IAFA,IAAIC,EAAS,GACT/wE,EAAMotE,EAAkBuC,SAAS/uD,IAAIyvD,GAChCE,EAAW,EAAGA,EAAWvwE,EAAIkf,OAAQqxD,IAAY,CAIxD,IAHA,IAAIS,EAAMX,EAAUtxE,MAAMwxE,GACtBC,EAAW,GAENC,EAAW,EAAGA,EAAWzwE,EAAI+c,MAAO0zD,IAC3C,GAAKK,EAAaP,GAAUE,GAA5B,CAGA,IAAIC,EAAU1wE,EAAIA,IAAIuwE,EAAWvwE,EAAI+c,MAAQ0zD,GAEzCE,EAAOG,EAAaP,GAAUE,GAC9BQ,EAAUZ,EAAU/zD,OAAOo0D,GAC3BQ,EAAUD,EAAQn2E,KAAKk7C,cAAct6C,OAAO+H,OAAO,GAAIktE,EAAKv/C,OAAQu/C,EAAKl5D,QAASk5D,EAAKn9C,OAC3Fg9C,EAASnyE,KAAK6yE,GAGhBH,EAAO1yE,KAAK2yE,EAAIl2E,KAAKk7C,cAAcg7B,EAAI5/C,MAAOo/C,EAAUQ,EAAIx9C,QAG9D,IAAI29C,EAAWd,EAAUv1E,KAAKk7C,cAAcq6B,EAAUj/C,MAAO2/C,EAAQV,EAAU78C,OAE/E,OAAO29C,GAGLC,EAAkB,SAAyBl3B,EAAOm3B,EAAeC,EAAeC,GAClF,IAAIjB,EAAOJ,EAAUE,EAA8Bl2B,EAAM/8C,OAKzD,OAHAmzE,EAAOkB,EAAqBlB,EAAMe,EAAeC,EAAeC,GAChEjB,EAAOJ,EAAUI,GAEVO,EAA8B32B,EAAM/8C,KAAMmzE,IAG/CmB,EAAe,SAAsBv3B,EAAOm3B,EAAeC,EAAeC,GAC5E,IAAIjB,EAAOF,EAA8Bl2B,EAAM/8C,MAI/C,OAFAmzE,EAAOkB,EAAqBlB,EAAMe,EAAeC,EAAeC,GAEzDV,EAA8B32B,EAAM/8C,KAAMmzE,IAG/CkB,EAAuB,SAA8BlB,EAAMe,EAAeC,EAAeI,GAC3F,IAAIH,EAAYF,EAAc,GAAKC,EAAc,IAAM,EAAI,EAEvDK,EAAgBrB,EAAKxpE,OAAOuqE,EAAc,GAAIA,EAAclzE,QAC5DyzE,EAAiBD,EAAcxzE,OAAS,IAAM,EAAI,EAAI,EACtDohB,OAAS,EAWb,OAREA,GADyB,IAAvBmyD,GAA0C,IAAdH,EACrBD,EAAc,GAAK,EACG,IAAtBI,IAA0C,IAAfH,EAC3BD,EAAcA,EAAcnzE,OAAS,GAAKyzE,EAAiB,GAE5C,IAAfL,EAAmBD,EAAc,GAAKA,EAAcA,EAAcnzE,OAAS,GAAKyzE,EAG3FtB,EAAKxpE,OAAO5M,MAAMo2E,EAAM,CAAC/wD,EAAQ,GAAG1f,OAAO8xE,IACpCrB,GAGLuB,EAAwB,SAA+BC,EAAaC,EAAaC,EAASl3E,GAC5F,IAAIy2E,EAAYO,EAAcC,GAAe,EAAI,EAC7CE,EAAe,kDAAqDn3E,EAAO,IAAMg3E,EAAc,OAASC,EAAc,8DAE1H,GAAkB,IAAdR,GACF,IAAmE,IAA/DS,EAAQ3qE,MAAM,EAAG2qE,EAAQ7zE,OAAS,GAAGi3B,QAAQ28C,GAC/C,MAAM,IAAIn4E,MAAMq4E,QAGlB,IAA+C,IAA3CD,EAAQ3qE,MAAM,GAAG+tB,QAAQ28C,GAC3B,MAAM,IAAIn4E,MAAMq4E,GAIpB,OAAO,GAULC,EAAiB,SAAwBz9C,GAC3C,OAAO,SAAU8F,GACf,IAAIjf,EAAQif,EAAKjf,MACjB,OAAOi0D,EAA2Bj0D,EAAOmZ,KAWzC86C,EAA6B,SAAoCr4D,EAAMud,GACzE,IAAK,IAAI9tB,EAAIuQ,EAAKiC,MAAOxS,EAAI,EAAGA,IAAK,CACnC,IAAIxJ,EAAO+Z,EAAK/Z,KAAKwJ,GACrB,GAAI8tB,EAAUt3B,GACZ,MAAO,CACL4a,IAAKpR,EAAI,EAAIuQ,EAAKnT,OAAO4C,GAAK,EAC9Boc,MAAO7L,EAAK6L,MAAMpc,GAClBwS,MAAOxS,EACPxJ,KAAMA,KAcVg1E,EAAmB,SAA0B19C,EAAW80C,GAC1D,OAAO,SAAUpuD,GACf,IAAIjX,EAASguE,EAAez9C,EAAfy9C,CAA0B/2D,GACvC,GAAIjX,EACF,OAAOkuE,EAAgBluE,EAAO6T,IAAKwxD,KAarC8I,EAAgB,SAAuB59C,GACzC,OAAO,SAAUtZ,GACf,QAAS+2D,EAAez9C,EAAfy9C,CAA0B/2D,KAUnCmyD,EAAuB,SAA8BzhE,GACvD,OAAO,SAAUsP,GACf,OAAO+2D,GAAe,SAAU/0E,GAC9B,OAAO+xE,EAAcrjE,EAAU1O,KAD1B+0E,CAEJ/2D,KAUHm3D,EAAmC,SAA0Cp7D,EAAMrL,GACrF,OAAO0jE,EAA2Br4D,GAAM,SAAU/Z,GAChD,OAAO+xE,EAAcrjE,EAAU1O,OAY/Bo1E,EAAsB,SAA6B1mE,GACrD,OAAO,SAAUsP,GACf,OAAOk3D,GAAc,SAAUl1E,GAC7B,OAAO+xE,EAAcrjE,EAAU1O,KAD1Bk1E,CAEJl3D,KAWHq3D,EAAyB,SAAgC3mE,EAAU09D,GACrE,OAAO,SAAUpuD,GACf,OAAOg3D,GAAiB,SAAUh1E,GAChC,OAAO+xE,EAAcrjE,EAAU1O,KAC9BosE,EAFI4I,CAEMh3D,KAebs3D,EAAyB,SAAgC5mE,GAC3D,OAAO,SAAUsP,GACf,GAAIyyD,EAAgBzyD,GAAY,CAC9B,IAAIhe,EAAOge,EAAUhe,KACjBme,EAAQH,EAAUG,MAEtB,GAAI4zD,EAAcrjE,EAAU1O,GAC1B,MAAO,CAAEA,KAAMA,EAAM4a,IAAKuD,EAAMvD,IAAKoB,MAAOmC,EAAMnC,UAYtD81D,EAA2B,SAAkC9zD,GAC/D,IAAI4C,EAAa5C,EAAUG,MAAMyC,WAE7B20D,EAAiB77D,EAAiB6C,UAAUZ,SAASqC,EAAUG,OAAQ,GAC3E,GAAIo3D,GAAkB30D,EAAY,CAEhC,IAAI7Z,EAASopE,EAAqBvvD,EAAWjjB,KAAhCwyE,CAAsCoF,GACnD,OAAIxuE,EACKA,EAAO6T,IAET26D,EAAep3D,MAAMvD,MAW5Bq6D,EAAkB,SAAyB9rE,EAAUijE,GACvD,IAAIjsD,EAAMisD,EAASjjE,GACfnJ,EAAOmgB,EAAIngB,KAAKwpC,WAAWrpB,EAAIvc,QAEnC,OAAIuc,EAAIngB,KAAK0O,WAAam0B,KAAK2yC,UACtBr1D,EAAIngB,KAAKsR,WAGbtR,GAAQA,EAAK0O,WAAam0B,KAAK2yC,UAI7Bx1E,EAHEmgB,EAAIngB,MAYXy1E,EAAU,SAAiBz1E,GAC7B,IAAI01E,IAAU14E,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,KAAmBA,UAAU,GAE7E,IAAKgD,EACH,MAAM,IAAIvD,MAAM,4BAElB,IAAImD,EAAS,GAOb,OANAI,EAAK+tC,aAAY,SAAUnsC,EAAOgZ,GAEhC,GADAhb,EAAOsB,KAAK,CAAElB,KAAM4B,EAAOgZ,IAAKA,KAC3B86D,EACH,OAAO,KAGJ91E,GASL+1E,EAAe,SAAsB31E,EAAMs3B,EAAWo+C,GACxD,IAAK11E,EACH,MAAM,IAAIvD,MAAM,4BACX,IAAK66B,EACV,MAAM,IAAI76B,MAAM,iCAElB,OAAOg5E,EAAQz1E,EAAM01E,GAAS7/D,QAAO,SAAUjU,GAC7C,OAAO01B,EAAU11B,EAAM5B,UAUvB41E,EAAgB,SAAuB51E,EAAM01E,GAC/C,OAAOC,EAAa31E,GAAM,SAAU4B,GAClC,OAAOA,EAAMi3B,SACZ68C,IASDG,EAAkB,SAAyB71E,EAAM01E,GACnD,OAAOC,EAAa31E,GAAM,SAAU4B,GAClC,OAAOA,EAAMuwC,WACZujC,IASDI,EAAiB,SAAwB91E,EAAM01E,GACjD,OAAOC,EAAa31E,GAAM,SAAU4B,GAClC,OAAOA,EAAMysC,UACZqnC,IASDK,EAAqB,SAA4B/1E,EAAMs3B,EAAWo+C,GACpE,OAAOC,EAAa31E,GAAM,SAAU4B,GAClC,QAAS01B,EAAU11B,EAAMqyB,SACxByhD,IASDM,GAAqB,SAA4Bh2E,EAAM0O,EAAUgnE,GACnE,OAAOC,EAAa31E,GAAM,SAAU4B,GAClC,OAAOA,EAAMjE,OAAS+Q,IACrBgnE,IASDO,GAAqB,SAA4Bj2E,EAAM23B,EAAU+9C,GACnE,OAAOC,EAAa31E,GAAM,SAAU4B,GAClC,OAAO+1B,EAASV,QAAQr1B,EAAMy0B,SAC7Bq/C,IAWDrwE,GAAW,SAAkBrF,EAAM0O,GACrC,QAASsnE,GAAmBh2E,EAAM0O,GAAU1N,QAG9C,SAAS20B,GAAmBC,GAAO,GAAIvuB,MAAMC,QAAQsuB,GAAM,CAAE,IAAK,IAAIpsB,EAAI,EAAGwsB,EAAO3uB,MAAMuuB,EAAI50B,QAASwI,EAAIosB,EAAI50B,OAAQwI,IAAOwsB,EAAKxsB,GAAKosB,EAAIpsB,GAAM,OAAOwsB,EAAe,OAAO3uB,MAAM4d,KAAK2Q,GAQ1L,IAAIsgD,GAAY,SAAmBl4D,GACjC,OAAO+2D,GAAe,SAAU/0E,GAC9B,OAAOA,EAAKrC,KAAK2d,KAAK42D,WAA0C,UAA7BlyE,EAAKrC,KAAK2d,KAAK42D,YAD7C6C,CAEJ/2D,IAWDm4D,GAAkB,SAAyBn4D,GAC7C,OAAOA,aAAqBiyD,EAAkBmG,eAS5CC,GAAmB,SAA0Br4D,GAC/C,GAAKm4D,GAAgBn4D,GAArB,CAGA,IAAI4H,EAAQ5H,EAAUy0D,YAAY7sD,OAAO,GACrC/iB,EAAMotE,EAAkBuC,SAAS/uD,IAAIzF,EAAUy0D,YAAYzyE,MAAM,IACrE,OAAO6C,EAAIgwE,YAAY70D,EAAUy0D,YAAY73D,IAAMgL,EAAO5H,EAAU80D,UAAUl4D,IAAMgL,KASlF0wD,GAAmB,SAA0BC,GAC/C,OAAO,SAAUv4D,GACf,GAAIm4D,GAAgBn4D,GAAY,CAC9B,IAAInb,EAAMotE,EAAkBuC,SAAS/uD,IAAIzF,EAAUy0D,YAAYzyE,MAAM,IACrE,OAAOuyE,EAAe,CACpB1zD,KAAM03D,EACNp1D,MAAOo1D,EAAc,EACrBt1E,IAAK,EACLigB,OAAQre,EAAIkf,QAJPwwD,CAKJv0D,GAGL,OAAO,IAUPw4D,GAAgB,SAAuBpD,GACzC,OAAO,SAAUp1D,GACf,GAAIm4D,GAAgBn4D,GAAY,CAC9B,IAAInb,EAAMotE,EAAkBuC,SAAS/uD,IAAIzF,EAAUy0D,YAAYzyE,MAAM,IACrE,OAAOuyE,EAAe,CACpB1zD,KAAM,EACNsC,MAAOte,EAAI+c,MACX3e,IAAKmyE,EACLlyD,OAAQkyD,EAAW,GAJdb,CAKJv0D,GAGL,OAAO,IAUPy4D,GAAkB,SAAyBz4D,GAC7C,GAAIm4D,GAAgBn4D,GAAY,CAC9B,IAAInb,EAAMotE,EAAkBuC,SAAS/uD,IAAIzF,EAAUy0D,YAAYzyE,MAAM,IACrE,OAAOuyE,EAAe,CACpB1zD,KAAM,EACNsC,MAAOte,EAAI+c,MACX3e,IAAK,EACLigB,OAAQre,EAAIkf,QAJPwwD,CAKJv0D,GAGL,OAAO,GASL04D,GAAmB,SAA0BH,GAC/C,OAAO,SAAUv4D,GACf,IAAI++B,EAAQm5B,GAAUl4D,GACtB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3C22E,EAAUtvE,MAAMC,QAAQivE,GAAeA,EAAclvE,MAAM4d,KAAK,CAACsxD,IACrE,OAAOI,EAAQ31C,QAAO,SAAU41C,EAAKtzE,GACnC,GAAIA,GAAS,GAAKA,GAAST,EAAI+c,MAAQ,EAAG,CACxC,IAAI8yD,EAAQ7vE,EAAI8vE,YAAY,CAC1B9zD,KAAMvb,EACN6d,MAAO7d,EAAQ,EACfrC,IAAK,EACLigB,OAAQre,EAAIkf,SAEd,OAAO60D,EAAIl0E,OAAOgwE,EAAM7vE,KAAI,SAAU80D,GACpC,IAAI33D,EAAO+8C,EAAM/8C,KAAKmf,OAAOw4C,GACzB/8C,EAAM+8C,EAAU5a,EAAMn3B,MAC1B,MAAO,CAAEhL,IAAKA,EAAKgL,MAAOhL,EAAM,EAAG5a,KAAMA,UAG5C,OAWL62E,GAAgB,SAAuBzD,GACzC,OAAO,SAAUp1D,GACf,IAAI++B,EAAQm5B,GAAUl4D,GACtB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3C22E,EAAUtvE,MAAMC,QAAQ8rE,GAAYA,EAAW/rE,MAAM4d,KAAK,CAACmuD,IAC/D,OAAOuD,EAAQ31C,QAAO,SAAU41C,EAAKtzE,GACnC,GAAIA,GAAS,GAAKA,GAAST,EAAIkf,OAAS,EAAG,CACzC,IAAI2wD,EAAQ7vE,EAAI8vE,YAAY,CAC1B9zD,KAAM,EACNsC,MAAOte,EAAI+c,MACX3e,IAAKqC,EACL4d,OAAQ5d,EAAQ,IAElB,OAAOszE,EAAIl0E,OAAOgwE,EAAM7vE,KAAI,SAAU80D,GACpC,IAAI33D,EAAO+8C,EAAM/8C,KAAKmf,OAAOw4C,GACzB/8C,EAAM+8C,EAAU5a,EAAMn3B,MAC1B,MAAO,CAAEhL,IAAKA,EAAKgL,MAAOhL,EAAM,EAAG5a,KAAMA,UAG5C,OAWL82E,GAAkB,SAAyB94D,GAC7C,IAAI++B,EAAQm5B,GAAUl4D,GACtB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3C0yE,EAAQ7vE,EAAI8vE,YAAY,CAC1B9zD,KAAM,EACNsC,MAAOte,EAAI+c,MACX3e,IAAK,EACLigB,OAAQre,EAAIkf,SAEd,OAAO2wD,EAAM7vE,KAAI,SAAU80D,GACzB,IAAI33D,EAAO+8C,EAAM/8C,KAAKmf,OAAOw4C,GACzB/8C,EAAM+8C,EAAU5a,EAAMn3B,MAC1B,MAAO,CAAEhL,IAAKA,EAAKgL,MAAOhL,EAAM,EAAG5a,KAAMA,QAK3C+2E,GAAS,SAAgBp5E,GAC3B,OAAO,SAAU2F,EAAO0zE,GACtB,OAAO,SAAUz4D,GACf,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACrBi5D,EAA0B,QAATt5E,EACrB,GAAIo/C,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAG/C,GAAIsD,GAAS,GAAKA,GAAS2zE,EAAiBp0E,EAAIkf,OAASlf,EAAI+c,OAAQ,CACnE,IAAIf,EAAOo4D,EAAiB,EAAI3zE,EAC5BrC,EAAMg2E,EAAiB3zE,EAAQ,EAC/B6d,EAAQ81D,EAAiBp0E,EAAI+c,MAAQtc,EAAQ,EAC7C4d,EAAS+1D,EAAiB3zE,EAAQ,EAAIT,EAAIkf,OAE9C,GAAIi1D,EAAQ,CACV,IAAIxD,EAAO0D,GAAqB34D,EAAGP,UAAUG,OAC7C,IAAKq1D,EACH,OAAOj1D,EAGT,IAAI44D,EAAUt0E,EAAI4wE,SAASD,EAAK54D,IAAMmiC,EAAMn3B,OACxCqxD,GACFh2E,EAAMkU,KAAK8Q,IAAIhlB,EAAKk2E,EAAQl2E,KAC5BigB,EAAS/L,KAAK0Q,IAAI3E,EAAQi2D,EAAQj2D,UAElCrC,EAAO1J,KAAK8Q,IAAIpH,EAAMs4D,EAAQt4D,MAC9BsC,EAAQhM,KAAK0Q,IAAI1E,EAAOg2D,EAAQh2D,QAIpC,IAAIi2D,EAAkBv0E,EAAI8vE,YAAY,CACpC9zD,KAAMA,EACN5d,IAAKA,EACLkgB,MAAO81D,EAAiB91D,EAAQtC,EAAO,EACvCqC,OAAQ+1D,EAAiBh2E,EAAM,EAAIigB,IAGjCm2D,EAAiBn2D,EAASjgB,IAAQ,EAAIm2E,EAAkBv0E,EAAI8vE,YAAY,CAC1E9zD,KAAMo4D,EAAiBp4D,EAAOsC,EAAQ,EACtClgB,IAAKg2E,EAAiB/1D,EAAS,EAAIjgB,EACnCkgB,MAAOA,EACPD,OAAQA,IAGN/G,EAAO4iC,EAAMn3B,MAAQwxD,EAAgB,GACrCn8D,EAAS8hC,EAAMn3B,MAAQyxD,EAAeA,EAAer2E,OAAS,GAC9Dqc,EAAQkB,EAAGvE,IAAIE,QAAQC,GACvBiD,EAAUmB,EAAGvE,IAAIE,QAAQe,GAE7B,OAAOy1D,EAAQnyD,EAAGC,aAAa,IAAIyxD,EAAkBmG,cAAch5D,EAASC,MAGhF,OAAOkB,KAcT+4D,GAAeP,GAAO,UAWtBQ,GAAYR,GAAO,OAUnBS,GAAc,SAAqBj5D,GACrC,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACzB,GAAI++B,EAAO,CACT,IAAI06B,EAAgBxH,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MACrD6C,EAAM40E,EAAc50E,IAExB,GAAIA,GAAOA,EAAI7B,OAAQ,CACrB,IAAImZ,EAAO4iC,EAAMn3B,MAAQ/iB,EAAI,GACzBoY,EAAS8hC,EAAMn3B,MAAQ/iB,EAAIA,EAAI7B,OAAS,GACxCqc,EAAQkB,EAAGvE,IAAIE,QAAQC,GACvBiD,EAAUmB,EAAGvE,IAAIE,QAAQe,GAE7B,OAAOy1D,EAAQnyD,EAAGC,aAAa,IAAIyxD,EAAkBmG,cAAch5D,EAASC,MAGhF,OAAOkB,GAYLm5D,GAAY,SAAmBlE,EAAM95C,GACvC,OAAO,SAAUnb,GACf,GAAIi1D,EAAM,CACR,IAAImE,EAAwB3F,EAAet4C,GAAQ85C,KAAK99B,gBACpDp7B,EAAUq9D,EAAsBr9D,QAEpC,IAAKk5D,EAAKxzE,KAAKsa,QAAQG,GAAGH,GAExB,OADAiE,EAAG0kC,YAAYuwB,EAAK54D,IAAM,EAAG44D,EAAK54D,IAAM44D,EAAKxzE,KAAKghB,SAAU1G,GACrDo2D,EAAQnyD,GAGnB,OAAOA,IAYPq5D,GAAc,SAAqBrB,GACrC,OAAO,SAAUh4D,GACf,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACzB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC/C,GAAIu2E,GAAe,GAAKA,GAAe1zE,EAAI+c,MACzC,OAAO8wD,EAAQT,EAAkB4H,UAAUt5D,EAAI,CAC7C1b,IAAKA,EACLi1E,WAAY/6B,EAAMn3B,MAClBm3B,MAAOA,EAAM/8C,MACZu2E,IAGP,OAAOh4D,IAmJPw5D,GAAU,SAAiBC,EAAgBC,EAAgBxzE,GAC7D,OAAO,SAAU8Z,GACf,IAAI8hB,EAAiB,CAAE63C,UAAU,EAAO9D,UAAW,GAC/Ch0E,EAAU7B,OAAO+H,OAAO+5B,EAAgB57B,GACxCs4C,EAAQm5B,GAAU33D,EAAGP,WACzB,IAAK++B,EACH,OAAOx+B,EAGT,IAAI45D,EAAwBC,GAAuBJ,EAAvBI,CAAuC75D,GAC/D85D,EAAmBF,EAAsBxB,QAEzC2B,EAAyBF,GAAuBH,EAAvBG,CAAuC75D,GAChEg6D,EAAmBD,EAAuB3B,QAE9C,GAAI0B,EAAiBpgD,QAAQggD,IAAmB,EAC9C,OAAO15D,GAGJne,EAAQ83E,UAAYK,EAAiBv3E,OAAS,GACjD0zE,EAAsBsD,EAAgBC,EAAgBM,EAAkB,OAG1E,IAAIvE,EAAWM,EAAav3B,EAAOs7B,EAAkBE,EAAkBn4E,EAAQg0E,WAE/E,OAAO1D,EAAQnyD,GAAI0kC,YAAYlG,EAAMniC,IAAKmiC,EAAMniC,IAAMmiC,EAAM/8C,KAAKghB,SAAUgzD,KAoI3EwE,GAAa,SAAoBC,EAAmBC,EAAmBj0E,GACzE,OAAO,SAAU8Z,GACf,IAAI8hB,EAAiB,CAAE63C,UAAU,EAAO9D,UAAW,GAC/Ch0E,EAAU7B,OAAO+H,OAAO+5B,EAAgB57B,GACxCs4C,EAAQm5B,GAAU33D,EAAGP,WACzB,IAAK++B,EACH,OAAOx+B,EAGT,IAAIo6D,EAAwBC,GAA0BH,EAA1BG,CAA6Cr6D,GACrEs6D,EAAsBF,EAAsBhC,QAE5CmC,EAAyBF,GAA0BF,EAA1BE,CAA6Cr6D,GACtEw6D,EAAsBD,EAAuBnC,QAEjD,GAAIkC,EAAoB5gD,QAAQygD,IAAsB,EACpD,OAAOn6D,GAGJne,EAAQ83E,UAAYa,EAAoB/3E,OAAS,GACpD0zE,EAAsB+D,EAAmBC,EAAmBK,EAAqB,UAGnF,IAAI/E,EAAWC,EAAgBl3B,EAAO87B,EAAqBE,EAAqB34E,EAAQg0E,WAExF,OAAO1D,EAAQnyD,GAAI0kC,YAAYlG,EAAMniC,IAAKmiC,EAAMniC,IAAMmiC,EAAM/8C,KAAKghB,SAAUgzD,KAkB3EgF,GAAW,SAAkB5F,EAAU6F,GACzC,OAAO,SAAU16D,GACf,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACzB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3Ck5E,EAAgB9F,EAAW,EAE/B,GAAI6F,GAAoBC,GAAiB,EACvC,OAAOxI,EAAQyI,GAAWD,EAAXC,CAA0B56D,IAG3C,GAAI60D,GAAY,GAAKA,GAAYvwE,EAAIkf,OACnC,OAAO2uD,EAAQT,EAAkBmJ,OAAO76D,EAAI,CAC1C1b,IAAKA,EACLi1E,WAAY/6B,EAAMn3B,MAClBm3B,MAAOA,EAAM/8C,MACZozE,IAGP,OAAO70D,IAYP46D,GAAa,SAAoB/F,GACnC,OAAO,SAAU70D,GACf,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACzB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAE/C,GAAIozE,GAAY,GAAKA,GAAYvwE,EAAIkf,OAAQ,CAK3C,IAJA,IAAImxD,EAAYn2B,EAAM/8C,KAClBq5E,EAAarH,EAAekB,EAAUv1E,KAAK+7B,QAE3C4/C,EAASv8B,EAAMn3B,MACVpc,EAAI,EAAGA,EAAI4pE,EAAW,EAAG5pE,IAChC8vE,GAAUpG,EAAUtxE,MAAM4H,GAAGwX,SAG/B,IAAIu4D,EAAWrG,EAAUtxE,MAAMwxE,GAE3BV,EAAQ,GACR8G,EAAW,EAWf,GAVAD,EAAS76E,SAAQ,SAAU80E,GAGE,IAAvBA,EAAKv/C,MAAMwlD,UACbD,GAAYhG,EAAKv/C,MAAMylD,QACvBhH,EAAMxxE,KAAKm4E,EAAW7F,EAAK71E,KAAK2d,KAAK42D,WAAWx8B,cAAc89B,EAAKv/C,MAAOu/C,EAAKn9C,YAK/EmjD,EAAW32E,EAAI+c,MAAO,CAYxB,IAXA,IAAI+5D,EAAe,GAEfC,EAAQ,SAAe78C,GACzB,IAAI88C,EAAaC,GAAiB/8C,GAAI,SAAUy2C,EAAMj1D,GACpD,IAAIk7D,EAAUjG,EAAKxzE,KAAKi0B,MAAMwlD,QAC1BM,EAAYh9C,EAAK08C,EACrB,OAAOA,EAAU,GAAKM,EAAY3G,IAHnB0G,CAIdv7D,GACHo7D,EAAaz4E,KAAKnE,MAAM48E,EAAchkD,GAAmBkkD,KAGlD98C,EAAKq2C,EAAUr2C,GAAM,EAAGA,IAC/B68C,EAAM78C,GAGJ48C,EAAa34E,QACf24E,EAAaj7E,SAAQ,SAAU80E,GAC7Bj1D,EAAKy7D,GAAaxG,EAAM,CACtBiG,QAASjG,EAAKxzE,KAAKi0B,MAAMwlD,QAAU,GADhCO,CAEFz7D,MAKT,OAAO0yD,EAAWoI,EAAWxF,IAAIr3E,OAAO+8E,EAAStlD,MAAOy+C,GAAQ4G,EAAzDrI,CAAiE1yD,IAG5E,OAAOA,IAYP07D,GAAiB,SAAwB1D,GAC3C,OAAO,SAAUh4D,GACf,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACzB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC/C,GAAoB,IAAhBu2E,GAAmC,IAAd1zE,EAAI+c,MAC3B,OAAOs6D,GAAY37D,GACd,GAAIg4D,GAAe,GAAKA,GAAe1zE,EAAI+c,MAMhD,OALAqwD,EAAkBkK,aAAa57D,EAAI,CACjC1b,IAAKA,EACLi1E,WAAY/6B,EAAMn3B,MAClBm3B,MAAOA,EAAM/8C,MACZu2E,GACI7F,EAAQnyD,GAGnB,OAAOA,IAYP67D,GAAc,SAAqBhH,GACrC,OAAO,SAAU70D,GACf,IAAIw+B,EAAQm5B,GAAU33D,EAAGP,WACzB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC/C,GAAiB,IAAbozE,GAAiC,IAAfvwE,EAAIkf,OACxB,OAAOm4D,GAAY37D,GACd,GAAI60D,GAAY,GAAKA,GAAYvwE,EAAIkf,OAM1C,OALAkuD,EAAkBoK,UAAU97D,EAAI,CAC9B1b,IAAKA,EACLi1E,WAAY/6B,EAAMn3B,MAClBm3B,MAAOA,EAAM/8C,MACZozE,GACI1C,EAAQnyD,GAGnB,OAAOA,IAYP27D,GAAc,SAAqB37D,GAGrC,IAFA,IAAIJ,EAAQI,EAAGP,UAAUG,MAEhBnC,EAAQmC,EAAMnC,MAAOA,EAAQ,EAAGA,IAAS,CAChD,IAAIhc,EAAOme,EAAMne,KAAKgc,GACtB,GAAiC,UAA7Bhc,EAAKrC,KAAK2d,KAAK42D,UACjB,OAAOxB,EAAQnyD,EAAGpgB,OAAOggB,EAAMvX,OAAOoV,GAAQmC,EAAMtB,MAAMb,KAG9D,OAAOuC,GAWL+7D,GAAwB,SAA+B/7D,GACzD,IAAIP,EAAYO,EAAGP,UAEnB,GAAIy4D,GAAgBz4D,GAClB,OAAOk8D,GAAY37D,GAErB,GAAI43D,GAAgBn4D,GAAY,CAC9B,IAAI++B,EAAQm5B,GAAUl4D,GACtB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3C2gB,EAAO9d,EAAIgwE,YAAY70D,EAAUy0D,YAAY73D,IAAMmiC,EAAMn3B,MAAO5H,EAAU80D,UAAUl4D,IAAMmiC,EAAMn3B,OAEpG,GAAiB,GAAbjF,EAAK9B,MAAa8B,EAAKQ,OAASte,EAAI+c,MACtC,OAAO,EAST,IANA,IAAI26D,EAAch8E,OAAO+H,OAAO,GAAIqa,EAAM,CACxC9d,IAAKA,EACLk6C,MAAOA,EAAM/8C,KACb83E,WAAY/6B,EAAMn3B,QAGXpc,EAAI+wE,EAAYp5D,MAAQ,GAAI3X,IAAK,CAExC,GADAymE,EAAkBkK,aAAa57D,EAAIg8D,EAAa/wE,GAC5CA,IAAM+wE,EAAY17D,KACpB,MAEF07D,EAAYx9B,MAAQw9B,EAAYzC,WAAav5D,EAAGvE,IAAImF,OAAOo7D,EAAYzC,WAAa,GAAKv5D,EAAGvE,IAC5FugE,EAAY13E,IAAMotE,EAAkBuC,SAAS/uD,IAAI82D,EAAYx9B,OAE/D,OAAO2zB,EAAQnyD,IAGnB,OAAOA,GAWLi8D,GAAqB,SAA4Bj8D,GACnD,IAAIP,EAAYO,EAAGP,UAEnB,GAAIy4D,GAAgBz4D,GAClB,OAAOk8D,GAAY37D,GAErB,GAAI43D,GAAgBn4D,GAAY,CAC9B,IAAI++B,EAAQm5B,GAAUl4D,GACtB,GAAI++B,EAAO,CACT,IAAIl6C,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3C2gB,EAAO9d,EAAIgwE,YAAY70D,EAAUy0D,YAAY73D,IAAMmiC,EAAMn3B,MAAO5H,EAAU80D,UAAUl4D,IAAMmiC,EAAMn3B,OAEpG,GAAgB,GAAZjF,EAAK1f,KAAY0f,EAAKO,QAAUre,EAAIkf,OACtC,OAAO,EAST,IANA,IAAIw4D,EAAch8E,OAAO+H,OAAO,GAAIqa,EAAM,CACxC9d,IAAKA,EACLk6C,MAAOA,EAAM/8C,KACb83E,WAAY/6B,EAAMn3B,QAGXpc,EAAI+wE,EAAYr5D,OAAS,GAAI1X,IAAK,CAEzC,GADAymE,EAAkBoK,UAAU97D,EAAIg8D,EAAa/wE,GACzCA,IAAM+wE,EAAYt5E,IACpB,MAEFs5E,EAAYx9B,MAAQw9B,EAAYzC,WAAav5D,EAAGvE,IAAImF,OAAOo7D,EAAYzC,WAAa,GAAKv5D,EAAGvE,IAC5FugE,EAAY13E,IAAMotE,EAAkBuC,SAAS/uD,IAAI82D,EAAYx9B,OAG/D,OAAO2zB,EAAQnyD,IAGnB,OAAOA,GAWLk8D,GAA2B,SAAkC1gE,GAC/D,OAAO,SAAUwE,GACf,IAAIoC,EAAO+5D,GAAyB3gE,GACpC,OAAI4G,EACKs5D,GAAet5D,EAAK9B,KAApBo7D,CAA0BpJ,EAAiB92D,EAAKa,IAAtBi2D,CAA2BtyD,IAEvDA,IAYPo8D,GAAwB,SAA+B5gE,GACzD,OAAO,SAAUwE,GACf,IAAIoC,EAAO+5D,GAAyB3gE,GACpC,OAAI4G,EACKy5D,GAAYz5D,EAAK1f,IAAjBm5E,CAAsBvJ,EAAiB92D,EAAKa,IAAtBi2D,CAA2BtyD,IAEnDA,IAaPq8D,GAAsB,SAA6BrE,EAAasE,EAAeC,GACjF,OAAO,SAAUv8D,GACf,IAAIm0D,EAAQgE,GAAiBH,EAAjBG,CAA8Bn4D,EAAGP,WAC7C,GAAI00D,EAAO,CACT,IAAK,IAAIlpE,EAAIkpE,EAAM1xE,OAAS,EAAGwI,GAAK,EAAGA,IACrC+U,EAAKs8D,EAAcnI,EAAMlpE,GAAI+U,GAE/B,GAAIu8D,EAAqB,CACvB,IAAI/gE,EAAOwE,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAI6vE,EAAMA,EAAM1xE,OAAS,GAAG4Z,MACjE2D,EAAGC,aAAa9E,EAAiB6C,UAAUlC,KAAKN,IAElD,OAAO22D,EAAQnyD,GAEjB,OAAOA,IAaPw8D,GAAmB,SAA0B3H,EAAUyH,EAAeC,GACxE,OAAO,SAAUv8D,GACf,IAAIm0D,EAAQmE,GAAczD,EAAdyD,CAAwBt4D,EAAGP,WACvC,GAAI00D,EAAO,CACT,IAAK,IAAIlpE,EAAIkpE,EAAM1xE,OAAS,EAAGwI,GAAK,EAAGA,IACrC+U,EAAKs8D,EAAcnI,EAAMlpE,GAAI+U,GAE/B,GAAIu8D,EAAqB,CACvB,IAAI/gE,EAAOwE,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAI6vE,EAAMA,EAAM1xE,OAAS,GAAG4Z,MACjE2D,EAAGC,aAAa9E,EAAiB6C,UAAUlC,KAAKN,KAGpD,OAAOwE,IAYPy7D,GAAe,SAAsBxG,EAAMv/C,GAC7C,OAAO,SAAU1V,GACf,OAAIi1D,GACFj1D,EAAG2b,cAAcs5C,EAAK54D,IAAK,KAAMrc,OAAO+H,OAAO,GAAIktE,EAAKxzE,KAAKi0B,MAAOA,IAC7Dy8C,EAAQnyD,IAEVA,IAePy8D,GAAc,SAAqBthD,GAcrC,IAbA,IAAIuhD,EAAYj+E,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAChFk+E,EAAYl+E,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,EAChFm+E,IAAgBn+E,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,KAAmBA,UAAU,GAC/EguC,EAAchuC,UAAUgE,OAAS,QAAsB9B,IAAjBlC,UAAU,GAAmBA,UAAU,GAAK,KAElFo+E,EAAkBpJ,EAAet4C,GACjC2hD,EAAYD,EAAgB5H,KAC5B8H,EAAcF,EAAgBG,YAC9BC,EAAWJ,EAAgBvH,IAC3B92B,EAAQq+B,EAAgBr+B,MAExB21B,EAAQ,GACR+I,EAAc,GACTjyE,EAAI,EAAGA,EAAI0xE,EAAW1xE,IAC7BkpE,EAAMxxE,KAAKmxE,EAAWgJ,EAAWrwC,IAE7BmwC,GACFM,EAAYv6E,KAAKmxE,EAAWiJ,EAAatwC,IAK7C,IADA,IAAImoC,EAAO,GACFuI,EAAM,EAAGA,EAAMT,EAAWS,IACjCvI,EAAKjyE,KAAKs6E,EAAS3iC,cAAc,KAAMsiC,GAAyB,IAARO,EAAYD,EAAc/I,IAGpF,OAAO31B,EAAMlE,cAAc,KAAMs6B,IAS/B+D,GAAuB,SAA8Bn9D,GACvD,IAAIud,EAAY,SAAmBt3B,GACjC,OAAOA,EAAKrC,KAAK2d,KAAK42D,WAAa,QAAQhhE,KAAKlR,EAAKrC,KAAK2d,KAAK42D,YAEjE,OAAOE,EAA2Br4D,EAAMud,IAWtCojD,GAA2B,SAAkC3gE,GAC/D,IAAIy5D,EAAO0D,GAAqBn9D,GAChC,GAAIy5D,EAAM,CACR,IAAIz2B,EAAQo1B,EAAsBp4D,GAC9BlX,EAAMotE,EAAkBuC,SAAS/uD,IAAIs5B,EAAM/8C,MAC3CuzE,EAAUC,EAAK54D,IAAMmiC,EAAMn3B,MAC/B,OAAO/iB,EAAIgwE,YAAYU,EAASA,KAIhCuG,GAAmB,SAA0B1G,EAAU97C,GACzD,OAAO,SAAU/Y,GACf,IAAIs7D,EAAa,GACbnH,EAAQmE,GAAczD,EAAdyD,CAAwBt4D,EAAGP,WACvC,GAAI00D,EACF,IAAK,IAAIxlC,EAAIwlC,EAAM1xE,OAAS,EAAGksC,GAAK,EAAGA,IACjC5V,EAAUo7C,EAAMxlC,GAAI3uB,IACtBs7D,EAAW34E,KAAKwxE,EAAMxlC,IAK5B,OAAO2sC,IAUPjB,GAA4B,SAAmCrC,GACjE,OAAO,SAAUh4D,GAqBf,IApBA,IAAIsY,EAAa0/C,EACbx/C,EAAWw/C,EAIXoF,EAAS,SAAgBnyE,GAC3B,IAAIkpE,EAAQgE,GAAiBltE,EAAjBktE,CAAoBn4D,EAAGP,WAC/B00D,GACFA,EAAMh0E,SAAQ,SAAU80E,GACtB,IAAIoI,EAAgBpI,EAAKxzE,KAAKi0B,MAAMylD,QAAUlwE,EAAI,EAC9CoyE,GAAiB/kD,IACnBA,EAAartB,GAEXoyE,EAAgB7kD,IAClBA,EAAW6kD,OAMVpyE,EAAI+sE,EAAa/sE,GAAK,EAAGA,IAChCmyE,EAAOnyE,GAIT,IAAIqyE,EAAS,SAAgBryE,GAC3B,IAAIkpE,EAAQgE,GAAiBltE,EAAjBktE,CAAoBn4D,EAAGP,WAC/B00D,GACFA,EAAMh0E,SAAQ,SAAU80E,GACtB,IAAIoI,EAAgBpI,EAAKxzE,KAAKi0B,MAAMylD,QAAUlwE,EAAI,EAC9CgqE,EAAKxzE,KAAKi0B,MAAMylD,QAAU,GAAKkC,EAAgB7kD,IACjDA,EAAW6kD,OAMnB,IAASpyE,EAAI+sE,EAAa/sE,GAAKutB,EAAUvtB,IACvCqyE,EAAOryE,GAIT,IAAImtE,EAAU,GACd,IAASntE,EAAIqtB,EAAYrtB,GAAKutB,EAAUvtB,IAAK,CAC3C,IAAIsyE,EAAapF,GAAiBltE,EAAjBktE,CAAoBn4D,EAAGP,WACpC89D,GAAcA,EAAW96E,QAC3B21E,EAAQz1E,KAAKsI,GAGjBqtB,EAAa8/C,EAAQ,GACrB5/C,EAAW4/C,EAAQA,EAAQ31E,OAAS,GAOpC,IALA,IAAI+6E,EAA2BrF,GAAiB7/C,EAAjB6/C,CAA6Bn4D,EAAGP,WAC3Dg+D,EAAgBnF,GAAc,EAAdA,CAAiBt4D,EAAGP,WACpCZ,EAAUmB,EAAGvE,IAAIE,QAAQ6hE,EAAyBA,EAAyB/6E,OAAS,GAAG4Z,KAEvFqhE,OAAW,EACNC,EAAMnlD,EAAUmlD,GAAOrlD,EAAYqlD,IAAO,CACjD,IAAIC,EAAczF,GAAiBwF,EAAjBxF,CAAsBn4D,EAAGP,WAC3C,GAAIm+D,GAAeA,EAAYn7E,OAAQ,CACrC,IAAK,IAAIksC,EAAI8uC,EAAch7E,OAAS,EAAGksC,GAAK,EAAGA,IAC7C,GAAI8uC,EAAc9uC,GAAGtyB,MAAQuhE,EAAY,GAAGvhE,IAAK,CAC/CqhE,EAAWE,EAAY,GACvB,MAGJ,GAAIF,EACF,OAKN,IAAI5+D,EAAQkB,EAAGvE,IAAIE,QAAQ+hE,EAASrhE,KACpC,MAAO,CAAEwC,QAASA,EAASC,MAAOA,EAAOs5D,QAASA,KAUlDyB,GAAyB,SAAgChF,GAC3D,OAAO,SAAU70D,GAkBf,IAjBA,IAAIsY,EAAau8C,EACbr8C,EAAWq8C,EAGXgJ,EAAS,SAAgB5yE,GAC3B,IAAIkpE,EAAQmE,GAAcrtE,EAAdqtE,CAAiBt4D,EAAGP,WAChC00D,EAAMh0E,SAAQ,SAAU80E,GACtB,IAAIoI,EAAgBpI,EAAKxzE,KAAKi0B,MAAMwlD,QAAUjwE,EAAI,EAC9CoyE,GAAiB/kD,IACnBA,EAAartB,GAEXoyE,EAAgB7kD,IAClBA,EAAW6kD,OAKRpyE,EAAI4pE,EAAU5pE,GAAK,EAAGA,IAC7B4yE,EAAO5yE,GAIT,IAAI6yE,EAAS,SAAgB7yE,GAC3B,IAAIkpE,EAAQmE,GAAcrtE,EAAdqtE,CAAiBt4D,EAAGP,WAChC00D,EAAMh0E,SAAQ,SAAU80E,GACtB,IAAIoI,EAAgBpI,EAAKxzE,KAAKi0B,MAAMwlD,QAAUjwE,EAAI,EAC9CgqE,EAAKxzE,KAAKi0B,MAAMwlD,QAAU,GAAKmC,EAAgB7kD,IACjDA,EAAW6kD,OAKjB,IAASpyE,EAAI4pE,EAAU5pE,GAAKutB,EAAUvtB,IACpC6yE,EAAO7yE,GAIT,IAAImtE,EAAU,GACd,IAASntE,EAAIqtB,EAAYrtB,GAAKutB,EAAUvtB,IAAK,CAC3C,IAAIsyE,EAAajF,GAAcrtE,EAAdqtE,CAAiBt4D,EAAGP,WACjC89D,GAAcA,EAAW96E,QAC3B21E,EAAQz1E,KAAKsI,GAGjBqtB,EAAa8/C,EAAQ,GACrB5/C,EAAW4/C,EAAQA,EAAQ31E,OAAS,GAOpC,IALA,IAAIs7E,EAAwBzF,GAAchgD,EAAdggD,CAA0Bt4D,EAAGP,WACrDu+D,EAAmB7F,GAAiB,EAAjBA,CAAoBn4D,EAAGP,WAC1CZ,EAAUmB,EAAGvE,IAAIE,QAAQoiE,EAAsBA,EAAsBt7E,OAAS,GAAG4Z,KAEjFqhE,OAAW,EACNO,EAAMzlD,EAAUylD,GAAO3lD,EAAY2lD,IAAO,CACjD,IAAInJ,EAAWwD,GAAc2F,EAAd3F,CAAmBt4D,EAAGP,WACrC,GAAIq1D,GAAYA,EAASryE,OAAQ,CAC/B,IAAK,IAAIksC,EAAIqvC,EAAiBv7E,OAAS,EAAGksC,GAAK,EAAGA,IAChD,GAAIqvC,EAAiBrvC,GAAGtyB,MAAQy4D,EAAS,GAAGz4D,IAAK,CAC/CqhE,EAAW5I,EAAS,GACpB,MAGJ,GAAI4I,EACF,OAKN,IAAI5+D,EAAQkB,EAAGvE,IAAIE,QAAQ+hE,EAASrhE,KACpC,MAAO,CAAEwC,QAASA,EAASC,MAAOA,EAAOs5D,QAASA,KAItDz5E,EAAQuzE,gBAAkBA,EAC1BvzE,EAAQs0E,UAAYA,EACpBt0E,EAAQ+1E,8BAAgCA,EACxC/1E,EAAQw2E,8BAAgCA,EACxCx2E,EAAQ63E,eAAiBA,EACzB73E,EAAQk1E,2BAA6BA,EACrCl1E,EAAQ83E,iBAAmBA,EAC3B93E,EAAQg4E,cAAgBA,EACxBh4E,EAAQizE,qBAAuBA,EAC/BjzE,EAAQi4E,iCAAmCA,EAC3Cj4E,EAAQk4E,oBAAsBA,EAC9Bl4E,EAAQm4E,uBAAyBA,EACjCn4E,EAAQo4E,uBAAyBA,EACjCp4E,EAAQ40E,yBAA2BA,EACnC50E,EAAQ+3E,gBAAkBA,EAC1B/3E,EAAQu4E,QAAUA,EAClBv4E,EAAQy4E,aAAeA,EACvBz4E,EAAQ04E,cAAgBA,EACxB14E,EAAQ24E,gBAAkBA,EAC1B34E,EAAQ44E,eAAiBA,EACzB54E,EAAQ64E,mBAAqBA,EAC7B74E,EAAQ84E,mBAAqBA,GAC7B94E,EAAQ+4E,mBAAqBA,GAC7B/4E,EAAQmI,SAAWA,GACnBnI,EAAQg5E,UAAYA,GACpBh5E,EAAQi5E,gBAAkBA,GAC1Bj5E,EAAQm5E,iBAAmBA,GAC3Bn5E,EAAQo5E,iBAAmBA,GAC3Bp5E,EAAQs5E,cAAgBA,GACxBt5E,EAAQu5E,gBAAkBA,GAC1Bv5E,EAAQw5E,iBAAmBA,GAC3Bx5E,EAAQ25E,cAAgBA,GACxB35E,EAAQ45E,gBAAkBA,GAC1B55E,EAAQo6E,aAAeA,GACvBp6E,EAAQq6E,UAAYA,GACpBr6E,EAAQs6E,YAAcA,GACtBt6E,EAAQw6E,UAAYA,GACpBx6E,EAAQ06E,YAAcA,GACtB16E,EAAQ66E,QAAUA,GAClB76E,EAAQs7E,WAAaA,GACrBt7E,EAAQ87E,SAAWA,GACnB97E,EAAQi8E,WAAaA,GACrBj8E,EAAQ+8E,eAAiBA,GACzB/8E,EAAQk9E,YAAcA,GACtBl9E,EAAQg9E,YAAcA,GACtBh9E,EAAQo9E,sBAAwBA,GAChCp9E,EAAQs9E,mBAAqBA,GAC7Bt9E,EAAQu9E,yBAA2BA,GACnCv9E,EAAQy9E,sBAAwBA,GAChCz9E,EAAQ09E,oBAAsBA,GAC9B19E,EAAQ69E,iBAAmBA,GAC3B79E,EAAQ88E,aAAeA,GACvB98E,EAAQ89E,YAAcA,GACtB99E,EAAQg6E,qBAAuBA,GAC/Bh6E,EAAQw9E,yBAA2BA,GACnCx9E,EAAQ07E,0BAA4BA,GACpC17E,EAAQk7E,uBAAyBA,GACjCl7E,EAAQgzE,uBAAyBA,EACjChzE,EAAQmzE,wBAA0BA,EAClCnzE,EAAQszE,mBAAqBA,EAC7BtzE,EAAQyzE,oBAAsBA,EAC9BzzE,EAAQ2zE,iBAAmBA,EAC3B3zE,EAAQ+zE,WAAaA,EACrB/zE,EAAQy0E,oBAAsBA,EAC9Bz0E,EAAQ00E,uBAAyBA,EACjC10E,EAAQ20E,iBAAmBA,G,kCCztE3BtzE,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIqa,EAAmB,EAAQ,QA8B3B6iE,EAAU,MACVC,EAAWvnE,KAAKwnE,IAAI,EAAG,IAE3B,SAASC,EAAYt5E,EAAOM,GAAU,OAAON,EAAQM,EAAS84E,EAC9D,SAASG,EAAat9E,GAAS,OAAOA,EAAQk9E,EAC9C,SAASK,EAAcv9E,GAAS,OAAQA,GAASA,EAAQk9E,IAAYC,EAIrE,IAAIK,EAAY,SAAmBniE,EAAKopC,EAASg5B,QAC9B,IAAZh5B,IAAqBA,GAAU,QACnB,IAAZg5B,IAAqBA,EAAU,MAGpC59E,KAAKwb,IAAMA,EAGXxb,KAAK4kD,QAAUA,EACf5kD,KAAK49E,QAAUA,GAQbC,EAAU,SAAiB70D,EAAQmB,QACnB,IAAbA,IAAsBA,GAAW,GAEtCnqB,KAAKgpB,OAASA,EACdhpB,KAAKmqB,SAAWA,GAGlB0zD,EAAQ/qE,UAAU8qE,QAAU,SAAkBz9E,GAC1C,IAAIogB,EAASvgB,KAEX89E,EAAO,EAAG55E,EAAQu5E,EAAat9E,GACnC,IAAKH,KAAKmqB,SAAY,IAAK,IAAI/f,EAAI,EAAGA,EAAIlG,EAAOkG,IAC7C0zE,GAAQv9D,EAAOyI,OAAW,EAAJ5e,EAAQ,GAAKmW,EAAOyI,OAAW,EAAJ5e,EAAQ,GAC7D,OAAOpK,KAAKgpB,OAAe,EAAR9kB,GAAa45E,EAAOJ,EAAcv9E,IAIvD09E,EAAQ/qE,UAAU6xC,UAAY,SAAoBnpC,EAAKuiE,GAEtD,YADgB,IAAVA,IAAmBA,EAAQ,GAC1B/9E,KAAKg+E,KAAKxiE,EAAKuiE,GAAO,IAG9BF,EAAQ/qE,UAAUrP,IAAM,SAAc+X,EAAKuiE,GAE1C,YADgB,IAAVA,IAAmBA,EAAQ,GAC1B/9E,KAAKg+E,KAAKxiE,EAAKuiE,GAAO,IAE9BF,EAAQ/qE,UAAUkrE,KAAO,SAAexiE,EAAKuiE,EAAOE,GAIlD,IAHE,IAAI19D,EAASvgB,KAEX89E,EAAO,EAAGI,EAAWl+E,KAAKmqB,SAAW,EAAI,EAAGg0D,EAAWn+E,KAAKmqB,SAAW,EAAI,EACtE/f,EAAI,EAAGA,EAAIpK,KAAKgpB,OAAOpnB,OAAQwI,GAAK,EAAG,CAC9C,IAAIoc,EAAQjG,EAAOyI,OAAO5e,IAAMmW,EAAO4J,SAAW2zD,EAAO,GACzD,GAAIt3D,EAAQhL,EAAO,MACnB,IAAI4iE,EAAU79D,EAAOyI,OAAO5e,EAAI8zE,GAAWG,EAAU99D,EAAOyI,OAAO5e,EAAI+zE,GAAW14E,EAAM+gB,EAAQ43D,EAChG,GAAI5iE,GAAO/V,EAAK,CACd,IAAIwkC,EAAQm0C,EAAkB5iE,GAAOgL,GAAS,EAAIhL,GAAO/V,EAAM,EAAIs4E,EAA7CA,EAClBv9E,EAASgmB,EAAQs3D,GAAQ7zC,EAAO,EAAI,EAAIo0C,GAC5C,GAAIJ,EAAU,OAAOz9E,EACrB,IAAIo9E,EAAUJ,EAAYpzE,EAAI,EAAGoR,EAAMgL,GACvC,OAAO,IAAIm3D,EAAUn9E,EAAQu9E,EAAQ,EAAIviE,GAAOgL,EAAQhL,GAAO/V,EAAKm4E,GAEtEE,GAAQO,EAAUD,EAEpB,OAAOH,EAASziE,EAAMsiE,EAAO,IAAIH,EAAUniE,EAAMsiE,IAGnDD,EAAQ/qE,UAAUwrE,QAAU,SAAkB9iE,EAAKoiE,GAKjD,IAJE,IAAIr9D,EAASvgB,KAEX89E,EAAO,EAAG55E,EAAQu5E,EAAaG,GAC/BM,EAAWl+E,KAAKmqB,SAAW,EAAI,EAAGg0D,EAAWn+E,KAAKmqB,SAAW,EAAI,EAC5D/f,EAAI,EAAGA,EAAIpK,KAAKgpB,OAAOpnB,OAAQwI,GAAK,EAAG,CAC9C,IAAIoc,EAAQjG,EAAOyI,OAAO5e,IAAMmW,EAAO4J,SAAW2zD,EAAO,GACzD,GAAIt3D,EAAQhL,EAAO,MACnB,IAAI4iE,EAAU79D,EAAOyI,OAAO5e,EAAI8zE,GAAWz4E,EAAM+gB,EAAQ43D,EACzD,GAAI5iE,GAAO/V,GAAO2E,GAAa,EAARlG,EAAa,OAAO,EAC3C45E,GAAQv9D,EAAOyI,OAAO5e,EAAI+zE,GAAYC,EAExC,OAAO,GAMTP,EAAQ/qE,UAAUxT,QAAU,SAAkBmvC,GAI5C,IAHE,IAAIluB,EAASvgB,KAEXk+E,EAAWl+E,KAAKmqB,SAAW,EAAI,EAAGg0D,EAAWn+E,KAAKmqB,SAAW,EAAI,EAC5D/f,EAAI,EAAG0zE,EAAO,EAAG1zE,EAAIpK,KAAKgpB,OAAOpnB,OAAQwI,GAAK,EAAG,CACxD,IAAIoc,EAAQjG,EAAOyI,OAAO5e,GAAI2/D,EAAWvjD,GAASjG,EAAO4J,SAAW2zD,EAAO,GAAI7T,EAAWzjD,GAASjG,EAAO4J,SAAW,EAAI2zD,GACrHM,EAAU79D,EAAOyI,OAAO5e,EAAI8zE,GAAWG,EAAU99D,EAAOyI,OAAO5e,EAAI+zE,GACvE1vC,EAAEs7B,EAAUA,EAAWqU,EAASnU,EAAUA,EAAWoU,GACrDP,GAAQO,EAAUD,IAOtBP,EAAQ/qE,UAAUyS,OAAS,WACzB,OAAO,IAAIs4D,EAAQ79E,KAAKgpB,QAAShpB,KAAKmqB,WAGxC0zD,EAAQ/qE,UAAUjP,SAAW,WAC3B,OAAQ7D,KAAKmqB,SAAW,IAAM,IAAMloB,KAAKC,UAAUlC,KAAKgpB,SAO1D60D,EAAQr5E,OAAS,SAAiBuf,GAChC,OAAY,GAALA,EAAS85D,EAAQziE,MAAQ,IAAIyiE,EAAQ95D,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,KAG1E85D,EAAQziE,MAAQ,IAAIyiE,EAAQ,IAS5B,IAAI93D,EAAU,SAAiBxB,EAAMg6D,EAAQ14D,EAAMC,GAGjD9lB,KAAKukB,KAAOA,GAAQ,GAIpBvkB,KAAK6lB,KAAOA,GAAQ,EAGpB7lB,KAAK8lB,GAAW,MAANA,EAAa9lB,KAAKukB,KAAK3iB,OAASkkB,EAC1C9lB,KAAKu+E,OAASA,GA4HhB,SAASC,EAAehuE,GACtB,IAAI8E,EAAMjY,MAAM0S,KAAK/P,KAAMwQ,GAE3B,OADA8E,EAAIjO,UAAYm3E,EAAe1rE,UACxBwC,EA1HTyQ,EAAQjT,UAAUhI,MAAQ,SAAgB+a,EAAMC,GAI9C,YAHgB,IAATD,IAAkBA,EAAO,QAClB,IAAPC,IAAgBA,EAAK9lB,KAAKukB,KAAK3iB,QAE/B,IAAImkB,EAAQ/lB,KAAKukB,KAAMvkB,KAAKu+E,OAAQ14D,EAAMC,IAGnDC,EAAQjT,UAAUuf,KAAO,WACvB,OAAO,IAAItM,EAAQ/lB,KAAKukB,KAAKzZ,QAAS9K,KAAKu+E,QAAUv+E,KAAKu+E,OAAOzzE,QAAS9K,KAAK6lB,KAAM7lB,KAAK8lB,KAO5FC,EAAQjT,UAAUiS,UAAY,SAAoBthB,EAAKg7E,GACrDz+E,KAAK8lB,GAAK9lB,KAAKukB,KAAKziB,KAAK2B,GACV,MAAXg7E,GAAmBz+E,KAAK0qB,UAAU1qB,KAAKukB,KAAK3iB,OAAS,EAAG68E,IAM9D14D,EAAQjT,UAAU4rE,cAAgB,SAAwB7jE,GAGxD,IAFE,IAAI0F,EAASvgB,KAENoK,EAAI,EAAGu0E,EAAY3+E,KAAKukB,KAAK3iB,OAAQwI,EAAIyQ,EAAQ0J,KAAK3iB,OAAQwI,IAAK,CAC1E,IAAIw0E,EAAO/jE,EAAQ+L,UAAUxc,GAC7BmW,EAAOwE,UAAUlK,EAAQ0J,KAAKna,GAAY,MAARw0E,GAAgBA,EAAOx0E,EAAIu0E,EAAYC,EAAO,QAQpF74D,EAAQjT,UAAU8T,UAAY,SAAoB7C,GAC9C,IAAIxD,EAASvgB,KAEf,GAAIA,KAAKu+E,OAAU,IAAK,IAAIn0E,EAAI,EAAGA,EAAIpK,KAAKu+E,OAAO38E,OAAQwI,IACvD,GAAImW,EAAOg+D,OAAOn0E,IAAM2Z,EAAK,OAAOxD,EAAOg+D,OAAOn0E,GAAKA,EAAI,GAAK,EAAI,KAG1E2b,EAAQjT,UAAU4X,UAAY,SAAoB3G,EAAGpe,GAC9C3F,KAAKu+E,SAAUv+E,KAAKu+E,OAAS,IAClCv+E,KAAKu+E,OAAOz8E,KAAKiiB,EAAGpe,IAKtBogB,EAAQjT,UAAU+rE,sBAAwB,SAAgChkE,GAGxE,IAFE,IAAI0F,EAASvgB,KAENoK,EAAIyQ,EAAQ0J,KAAK3iB,OAAS,EAAGk9E,EAAY9+E,KAAKukB,KAAK3iB,OAASiZ,EAAQ0J,KAAK3iB,OAAQwI,GAAK,EAAGA,IAAK,CACrG,IAAIw0E,EAAO/jE,EAAQ+L,UAAUxc,GAC7BmW,EAAOwE,UAAUlK,EAAQ0J,KAAKna,GAAGmb,SAAkB,MAARq5D,GAAgBA,EAAOx0E,EAAI00E,EAAYF,EAAO,EAAI,QAMjG74D,EAAQjT,UAAUyS,OAAS,WACzB,IAAIw5D,EAAU,IAAIh5D,EAElB,OADAg5D,EAAQF,sBAAsB7+E,MACvB++E,GAKTh5D,EAAQjT,UAAUrP,IAAM,SAAc+X,EAAKuiE,GACvC,IAAIx9D,EAASvgB,KAGf,QAFiB,IAAV+9E,IAAmBA,EAAQ,GAE9B/9E,KAAKu+E,OAAU,OAAOv+E,KAAKg+E,KAAKxiE,EAAKuiE,GAAO,GAChD,IAAK,IAAI3zE,EAAIpK,KAAK6lB,KAAMzb,EAAIpK,KAAK8lB,GAAI1b,IACjCoR,EAAM+E,EAAOgE,KAAKna,GAAG3G,IAAI+X,EAAKuiE,GAClC,OAAOviE,GAMTuK,EAAQjT,UAAU6xC,UAAY,SAAoBnpC,EAAKuiE,GAEtD,YADgB,IAAVA,IAAmBA,EAAQ,GAC1B/9E,KAAKg+E,KAAKxiE,EAAKuiE,GAAO,IAE9Bh4D,EAAQjT,UAAUkrE,KAAO,SAAexiE,EAAKuiE,EAAOE,GAKlD,IAJE,IAAI19D,EAASvgB,KAEX4kD,GAAU,EAAOo6B,EAAe,KAE3B50E,EAAIpK,KAAK6lB,KAAMzb,EAAIpK,KAAK8lB,GAAI1b,IAAK,CACxC,IAAI3G,EAAM8c,EAAOgE,KAAKna,GAAI60E,EAAMD,GAAgBA,EAAa50E,GAC7D,GAAW,MAAP60E,GAAex7E,EAAI66E,QAAQ9iE,EAAKyjE,GAClCzjE,EAAM/X,EAAIm6E,QAAQqB,OADpB,CAKA,IAAIz+E,EAASiD,EAAIkhD,UAAUnpC,EAAKuiE,GAChC,GAAsB,MAAlBv9E,EAAOo9E,QAAiB,CAC1B,IAAIsB,EAAO3+D,EAAOqG,UAAUxc,GAC5B,GAAY,MAAR80E,GAAgBA,EAAO90E,GAAK80E,EAAO3+D,EAAOuF,GAAI,CAChD,GAAItlB,EAAOokD,QAAS,CAClBx6C,EAAI80E,EACJ1jE,EAAM+E,EAAOgE,KAAK26D,GAAMtB,QAAQp9E,EAAOo9E,SACvC,UAECoB,IAAiBA,EAAe7/E,OAAO/B,OAAO,QAAQ8hF,GAAQ1+E,EAAOo9E,SAKxEp9E,EAAOokD,UAAWA,GAAU,GAChCppC,EAAMhb,EAAOgb,KAGf,OAAOyiE,EAASziE,EAAM,IAAImiE,EAAUniE,EAAKopC,IAS3C45B,EAAe1rE,UAAY3T,OAAO/B,OAAOC,MAAMyV,WAC/C0rE,EAAe1rE,UAAU1Q,YAAco8E,EACvCA,EAAe1rE,UAAUrV,KAAO,iBAOhC,IAAIipD,EAAY,SAAmB9rC,GAIjC5a,KAAK4a,IAAMA,EAGX5a,KAAKslB,MAAQ,GAGbtlB,KAAKwlB,KAAO,GAGZxlB,KAAK6a,QAAU,IAAIkL,GAGjB6tB,EAAqB,CAAEpsC,OAAQ,GAAGohB,WAAY,IAuClD,SAASu2D,IAAiB,MAAM,IAAI9hF,MAAM,eApC1Cu2C,EAAmBpsC,OAAO6c,IAAM,WAAc,OAAOrkB,KAAKwlB,KAAK5jB,OAAS5B,KAAKwlB,KAAK,GAAKxlB,KAAK4a,KAK5F8rC,EAAU5zC,UAAU8R,KAAO,SAAemX,GACxC,IAAIv7B,EAASR,KAAK8kB,UAAUiX,GAC5B,GAAIv7B,EAAOiqB,OAAU,MAAM,IAAI+zD,EAAeh+E,EAAOiqB,QACrD,OAAOzqB,MAMT0mD,EAAU5zC,UAAUgS,UAAY,SAAoBF,GAClD,IAAIpkB,EAASokB,EAAKjnB,MAAMqC,KAAK4a,KAE7B,OADKpa,EAAOiqB,QAAUzqB,KAAKomD,QAAQxhC,EAAMpkB,EAAOoa,KACzCpa,GAMTozC,EAAmBhrB,WAAWvE,IAAM,WAClC,OAAOrkB,KAAKslB,MAAM1jB,OAAS,GAG7B8kD,EAAU5zC,UAAUszC,QAAU,SAAkBxhC,EAAMhK,GACpD5a,KAAKwlB,KAAK1jB,KAAK9B,KAAK4a,KACpB5a,KAAKslB,MAAMxjB,KAAK8iB,GAChB5kB,KAAK6a,QAAQkK,UAAUH,EAAKwC,UAC5BpnB,KAAK4a,IAAMA,GAGbzb,OAAOo9B,iBAAkBmqB,EAAU5zC,UAAW8gC,GAI9C,IAAIwrC,EAAYjgF,OAAO/B,OAAO,MAW1BiiF,EAAO,aAEXA,EAAKvsE,UAAUnV,MAAQ,SAAgB2hF,GAAQ,OAAOH,KAMtDE,EAAKvsE,UAAUsU,OAAS,WAAqB,OAAOy2D,EAAQziE,OAK5DikE,EAAKvsE,UAAUyS,OAAS,SAAiB+5D,GAAQ,OAAOH,KAMxDE,EAAKvsE,UAAUrP,IAAM,SAAc87E,GAAY,OAAOJ,KAMtDE,EAAKvsE,UAAU4S,MAAQ,SAAgB85D,GAAU,OAAO,MAOxDH,EAAKvsE,UAAUyI,OAAS,WAAqB,OAAO4jE,KAKpDE,EAAK5jE,SAAW,SAAmB6e,EAAQ5e,GACzC,IAAKA,IAASA,EAAK+jE,SAAY,MAAM,IAAIvhF,WAAW,mCACpD,IAAIK,EAAO6gF,EAAU1jE,EAAK+jE,UAC1B,IAAKlhF,EAAQ,MAAM,IAAIL,WAAY,gBAAmBwd,EAAa,SAAI,YACvE,OAAOnd,EAAKkd,SAAS6e,EAAQ5e,IAQ/B2jE,EAAKhiE,OAAS,SAAiB2vB,EAAI0yC,GACjC,GAAI1yC,KAAMoyC,EAAa,MAAM,IAAIlhF,WAAW,iCAAmC8uC,GAG/E,OAFAoyC,EAAUpyC,GAAM0yC,EAChBA,EAAU5sE,UAAUuK,OAAS2vB,EACtB0yC,GAKT,IAAIC,EAAa,SAAoB/kE,EAAK6P,GAExCzqB,KAAK4a,IAAMA,EAEX5a,KAAKyqB,OAASA,GAKhBk1D,EAAWllC,GAAK,SAAa7/B,GAAO,OAAO,IAAI+kE,EAAW/kE,EAAK,OAI/D+kE,EAAWC,KAAO,SAAepvE,GAAW,OAAO,IAAImvE,EAAW,KAAMnvE,IAMxEmvE,EAAWE,YAAc,SAAsBjlE,EAAKiL,EAAMC,EAAIhb,GAC5D,IACE,OAAO60E,EAAWllC,GAAG7/B,EAAIxa,QAAQylB,EAAMC,EAAIhb,IAC3C,MAAOgW,GACP,GAAIA,aAAatG,EAAiBu1B,aAAgB,OAAO4vC,EAAWC,KAAK9+D,EAAEtQ,SAC3E,MAAMsQ,IAKV,IAAImkC,EAAe,SAAU66B,GAC3B,SAAS76B,EAAYp/B,EAAMC,EAAIhb,EAAOm4C,GACpC68B,EAAQ/vE,KAAK/P,MACbA,KAAK6lB,KAAOA,EACZ7lB,KAAK8lB,GAAKA,EACV9lB,KAAK8K,MAAQA,EACb9K,KAAKijD,YAAcA,EAwDrB,OArDK68B,IAAU76B,EAAY59C,UAAYy4E,GACvC76B,EAAYnyC,UAAY3T,OAAO/B,OAAQ0iF,GAAWA,EAAQhtE,WAC1DmyC,EAAYnyC,UAAU1Q,YAAc6iD,EAEpCA,EAAYnyC,UAAUnV,MAAQ,SAAgBid,GAC5C,OAAI5a,KAAKijD,WAAa88B,EAAenlE,EAAK5a,KAAK6lB,KAAM7lB,KAAK8lB,IAC/C65D,EAAWC,KAAK,6CACpBD,EAAWE,YAAYjlE,EAAK5a,KAAK6lB,KAAM7lB,KAAK8lB,GAAI9lB,KAAK8K,QAG9Dm6C,EAAYnyC,UAAUsU,OAAS,WAC7B,OAAO,IAAIy2D,EAAQ,CAAC79E,KAAK6lB,KAAM7lB,KAAK8lB,GAAK9lB,KAAK6lB,KAAM7lB,KAAK8K,MAAM68B,QAGjEsd,EAAYnyC,UAAUyS,OAAS,SAAiB3K,GAC9C,OAAO,IAAIqqC,EAAYjlD,KAAK6lB,KAAM7lB,KAAK6lB,KAAO7lB,KAAK8K,MAAM68B,KAAM/sB,EAAI9P,MAAM9K,KAAK6lB,KAAM7lB,KAAK8lB,MAG3Fm/B,EAAYnyC,UAAUrP,IAAM,SAAcoX,GACxC,IAAIgL,EAAOhL,EAAQ8pC,UAAU3kD,KAAK6lB,KAAM,GAAIC,EAAKjL,EAAQ8pC,UAAU3kD,KAAK8lB,IAAK,GAC7E,OAAID,EAAK++B,SAAW9+B,EAAG8+B,QAAkB,KAClC,IAAIK,EAAYp/B,EAAKrK,IAAKzF,KAAK0Q,IAAIZ,EAAKrK,IAAKsK,EAAGtK,KAAMxb,KAAK8K,QAGpEm6C,EAAYnyC,UAAU4S,MAAQ,SAAgBpK,GAC5C,KAAMA,aAAiB2pC,IAAgB3pC,EAAM2nC,WAAajjD,KAAKijD,UAAa,OAAO,KAEnF,GAAIjjD,KAAK6lB,KAAO7lB,KAAK8K,MAAM68B,MAAQrsB,EAAMuK,MAAS7lB,KAAK8K,MAAMivB,SAAYze,EAAMxQ,MAAMgvB,UAI9E,IAAIxe,EAAMwK,IAAM9lB,KAAK6lB,MAAS7lB,KAAK8K,MAAMgvB,WAAcxe,EAAMxQ,MAAMivB,QAKxE,OAAO,KAJP,IAAIimD,EAAUhgF,KAAK8K,MAAM68B,KAAOrsB,EAAMxQ,MAAM68B,MAAQ,EAAIntB,EAAiBW,MAAMC,MACzE,IAAIZ,EAAiBW,MAAMG,EAAMxQ,MAAMoQ,QAAQ8J,OAAOhlB,KAAK8K,MAAMoQ,SAAUI,EAAMxQ,MAAMgvB,UAAW95B,KAAK8K,MAAMivB,SACnH,OAAO,IAAIkrB,EAAY3pC,EAAMuK,KAAM7lB,KAAK8lB,GAAIk6D,EAAShgF,KAAKijD,WAN1D,IAAIn4C,EAAQ9K,KAAK8K,MAAM68B,KAAOrsB,EAAMxQ,MAAM68B,MAAQ,EAAIntB,EAAiBW,MAAMC,MACvE,IAAIZ,EAAiBW,MAAMnb,KAAK8K,MAAMoQ,QAAQ8J,OAAO1J,EAAMxQ,MAAMoQ,SAAUlb,KAAK8K,MAAMgvB,UAAWxe,EAAMxQ,MAAMivB,SACnH,OAAO,IAAIkrB,EAAYjlD,KAAK6lB,KAAM7lB,KAAK8lB,IAAMxK,EAAMwK,GAAKxK,EAAMuK,MAAO/a,EAAO9K,KAAKijD,YAUrFgC,EAAYnyC,UAAUyI,OAAS,WAC7B,IAAIG,EAAO,CAAC+jE,SAAU,UAAW55D,KAAM7lB,KAAK6lB,KAAMC,GAAI9lB,KAAK8lB,IAG3D,OAFI9lB,KAAK8K,MAAM68B,OAAQjsB,EAAK5Q,MAAQ9K,KAAK8K,MAAMyQ,UAC3Cvb,KAAKijD,YAAavnC,EAAKunC,WAAY,GAChCvnC,GAGTupC,EAAYxpC,SAAW,SAAmB6e,EAAQ5e,GAChD,GAAwB,iBAAbA,EAAKmK,MAAsC,iBAAXnK,EAAKoK,GAC5C,MAAM,IAAI5nB,WAAW,0CACzB,OAAO,IAAI+mD,EAAYvpC,EAAKmK,KAAMnK,EAAKoK,GAAItL,EAAiBW,MAAMM,SAAS6e,EAAQ5e,EAAK5Q,SAAU4Q,EAAKunC,YAGlGgC,EA9DS,CA+DhBo6B,GAEFA,EAAKhiE,OAAO,UAAW4nC,GAKvB,IAAIC,EAAqB,SAAU46B,GACjC,SAAS56B,EAAkBr/B,EAAMC,EAAIm6D,EAASC,EAAOp1E,EAAOimC,EAAQkS,GAClE68B,EAAQ/vE,KAAK/P,MACbA,KAAK6lB,KAAOA,EACZ7lB,KAAK8lB,GAAKA,EACV9lB,KAAKigF,QAAUA,EACfjgF,KAAKkgF,MAAQA,EACblgF,KAAK8K,MAAQA,EACb9K,KAAK+wC,OAASA,EACd/wC,KAAKijD,YAAcA,EAwDrB,OArDK68B,IAAU56B,EAAkB79C,UAAYy4E,GAC7C56B,EAAkBpyC,UAAY3T,OAAO/B,OAAQ0iF,GAAWA,EAAQhtE,WAChEoyC,EAAkBpyC,UAAU1Q,YAAc8iD,EAE1CA,EAAkBpyC,UAAUnV,MAAQ,SAAgBid,GAClD,GAAI5a,KAAKijD,YAAc88B,EAAenlE,EAAK5a,KAAK6lB,KAAM7lB,KAAKigF,UACpCF,EAAenlE,EAAK5a,KAAKkgF,MAAOlgF,KAAK8lB,KACxD,OAAO65D,EAAWC,KAAK,iDAE3B,IAAIO,EAAMvlE,EAAI9P,MAAM9K,KAAKigF,QAASjgF,KAAKkgF,OACvC,GAAIC,EAAIrmD,WAAaqmD,EAAIpmD,QACrB,OAAO4lD,EAAWC,KAAK,2BAC3B,IAAIQ,EAAWpgF,KAAK8K,MAAMqnC,SAASnyC,KAAK+wC,OAAQovC,EAAIjlE,SACpD,OAAKklE,EACET,EAAWE,YAAYjlE,EAAK5a,KAAK6lB,KAAM7lB,KAAK8lB,GAAIs6D,GAD/BT,EAAWC,KAAK,gCAI1C16B,EAAkBpyC,UAAUsU,OAAS,WACnC,OAAO,IAAIy2D,EAAQ,CAAC79E,KAAK6lB,KAAM7lB,KAAKigF,QAAUjgF,KAAK6lB,KAAM7lB,KAAK+wC,OAC1C/wC,KAAKkgF,MAAOlgF,KAAK8lB,GAAK9lB,KAAKkgF,MAAOlgF,KAAK8K,MAAM68B,KAAO3nC,KAAK+wC,UAG/EmU,EAAkBpyC,UAAUyS,OAAS,SAAiB3K,GACpD,IAAIulE,EAAMngF,KAAKkgF,MAAQlgF,KAAKigF,QAC5B,OAAO,IAAI/6B,EAAkBllD,KAAK6lB,KAAM7lB,KAAK6lB,KAAO7lB,KAAK8K,MAAM68B,KAAOw4C,EACzCngF,KAAK6lB,KAAO7lB,KAAK+wC,OAAQ/wC,KAAK6lB,KAAO7lB,KAAK+wC,OAASovC,EACnDvlE,EAAI9P,MAAM9K,KAAK6lB,KAAM7lB,KAAK8lB,IAAIssB,cAAcpyC,KAAKigF,QAAUjgF,KAAK6lB,KAAM7lB,KAAKkgF,MAAQlgF,KAAK6lB,MACxF7lB,KAAKigF,QAAUjgF,KAAK6lB,KAAM7lB,KAAKijD,YAG9DiC,EAAkBpyC,UAAUrP,IAAM,SAAcoX,GAC9C,IAAIgL,EAAOhL,EAAQ8pC,UAAU3kD,KAAK6lB,KAAM,GAAIC,EAAKjL,EAAQ8pC,UAAU3kD,KAAK8lB,IAAK,GACzEm6D,EAAUplE,EAAQpX,IAAIzD,KAAKigF,SAAU,GAAIC,EAAQrlE,EAAQpX,IAAIzD,KAAKkgF,MAAO,GAC7E,OAAKr6D,EAAK++B,SAAW9+B,EAAG8+B,SAAYq7B,EAAUp6D,EAAKrK,KAAO0kE,EAAQp6D,EAAGtK,IAAc,KAC5E,IAAI0pC,EAAkBr/B,EAAKrK,IAAKsK,EAAGtK,IAAKykE,EAASC,EAAOlgF,KAAK8K,MAAO9K,KAAK+wC,OAAQ/wC,KAAKijD,YAG/FiC,EAAkBpyC,UAAUyI,OAAS,WACnC,IAAIG,EAAO,CAAC+jE,SAAU,gBAAiB55D,KAAM7lB,KAAK6lB,KAAMC,GAAI9lB,KAAK8lB,GACrDm6D,QAASjgF,KAAKigF,QAASC,MAAOlgF,KAAKkgF,MAAOnvC,OAAQ/wC,KAAK+wC,QAGnE,OAFI/wC,KAAK8K,MAAM68B,OAAQjsB,EAAK5Q,MAAQ9K,KAAK8K,MAAMyQ,UAC3Cvb,KAAKijD,YAAavnC,EAAKunC,WAAY,GAChCvnC,GAGTwpC,EAAkBzpC,SAAW,SAAmB6e,EAAQ5e,GACtD,GAAwB,iBAAbA,EAAKmK,MAAsC,iBAAXnK,EAAKoK,IACrB,iBAAhBpK,EAAKukE,SAA4C,iBAAdvkE,EAAKwkE,OAA2C,iBAAfxkE,EAAKq1B,OAChF,MAAM,IAAI7yC,WAAW,gDACzB,OAAO,IAAIgnD,EAAkBxpC,EAAKmK,KAAMnK,EAAKoK,GAAIpK,EAAKukE,QAASvkE,EAAKwkE,MACvC1lE,EAAiBW,MAAMM,SAAS6e,EAAQ5e,EAAK5Q,OAAQ4Q,EAAKq1B,SAAUr1B,EAAKunC,YAGjGiC,EAjEe,CAkEtBm6B,GAIF,SAASU,EAAenlE,EAAKiL,EAAMC,GACjC,IAAI/G,EAAQnE,EAAIE,QAAQ+K,GAAOirB,EAAOhrB,EAAKD,EAAMjJ,EAAQmC,EAAMnC,MAC/D,MAAOk0B,EAAO,GAAKl0B,EAAQ,GAAKmC,EAAMlC,WAAWD,IAAUmC,EAAMne,KAAKgc,GAAOE,WAC3EF,IACAk0B,IAEF,GAAIA,EAAO,EAAG,CACZ,IAAIp0B,EAAOqC,EAAMne,KAAKgc,GAAOG,WAAWgC,EAAMlC,WAAWD,IACzD,MAAOk0B,EAAO,EAAG,CACf,IAAKp0B,GAAQA,EAAKsyB,OAAU,OAAO,EACnCtyB,EAAOA,EAAKtN,WACZ0hC,KAGJ,OAAO,EAGT,SAASuvC,EAAOz/E,EAAM4lB,EAAO/gB,GAC3B,OAAiB,GAAT+gB,GAAc5lB,EAAKowC,WAAWxqB,EAAO5lB,EAAKkc,eAC/CrX,GAAO7E,EAAKkc,YAAclc,EAAKowC,WAAW,EAAGvrC,IAOlD,SAASgrE,EAAWxyE,GAGlB,IAFA,IAAI0J,EAAS1J,EAAM0J,OACfuT,EAAUvT,EAAOuT,QAAQi0B,WAAWlxC,EAAMw5B,WAAYx5B,EAAM05B,UACvD/a,EAAQ3e,EAAM2e,SAAUA,EAAO,CACtC,IAAIhc,EAAO3C,EAAM8gB,MAAMne,KAAKgc,GACxB1Y,EAAQjG,EAAM8gB,MAAM7a,MAAM0Y,GAAQ+a,EAAW15B,EAAM6gB,IAAIjC,WAAWD,GACtE,GAAIA,EAAQ3e,EAAM2e,OAAShc,EAAKowC,WAAW9sC,EAAOyzB,EAAUzc,GACxD,OAAO0B,EACX,GAAa,GAATA,GAAchc,EAAKrC,KAAK2d,KAAKsB,YAAc6iE,EAAOz/E,EAAMsD,EAAOyzB,GAAa,OAiDpF,SAAS4e,EAAat4C,EAAOqR,EAAUulB,EAAOyrD,QACxB,IAAfA,IAAwBA,EAAariF,GAE1C,IAAIsiF,EAASC,EAAoBviF,EAAOqR,GACpCy+B,EAAQwyC,GAAUE,EAAmBH,EAAYhxE,GACrD,OAAKy+B,EACEwyC,EAAO98E,IAAIi9E,GAAWp9E,OAAO,CAAC/E,KAAM+Q,EAAUulB,MAAOA,IAAQvxB,OAAOyqC,EAAMtqC,IAAIi9E,IADhE,KAIvB,SAASA,EAAUniF,GAAQ,MAAO,CAACA,KAAMA,EAAMs2B,MAAO,MAEtD,SAAS2rD,EAAoBviF,EAAOM,GAClC,IAAIoJ,EAAS1J,EAAM0J,OACf8vB,EAAax5B,EAAMw5B,WACnBE,EAAW15B,EAAM05B,SACjB4oD,EAAS54E,EAAO0U,eAAeob,GAAY8e,aAAah4C,GAC5D,IAAKgiF,EAAU,OAAO,KACtB,IAAII,EAAQJ,EAAO3+E,OAAS2+E,EAAO,GAAKhiF,EACxC,OAAOoJ,EAAO8sC,eAAehd,EAAYE,EAAUgpD,GAASJ,EAAS,KAGvE,SAASE,EAAmBxiF,EAAOM,GACjC,IAAIoJ,EAAS1J,EAAM0J,OACf8vB,EAAax5B,EAAMw5B,WACnBE,EAAW15B,EAAM05B,SACjBoW,EAAQpmC,EAAOnF,MAAMi1B,GACrB7X,EAASrhB,EAAK21C,aAAaqC,aAAaxI,EAAMxvC,MAClD,IAAKqhB,EAAU,OAAO,KAGtB,IAFA,IAAIghE,EAAWhhE,EAAOhe,OAASge,EAAOA,EAAOhe,OAAS,GAAKrD,EACvDsiF,EAAaD,EAAS1sC,aACjB9pC,EAAIqtB,EAAYopD,GAAcz2E,EAAIutB,EAAUvtB,IACjDy2E,EAAaA,EAAWnsC,UAAU/sC,EAAOnF,MAAM4H,GAAG7L,MACtD,OAAKsiF,GAAeA,EAAWtsC,SACxB30B,EAD2C,KAwCpD,SAASkhE,EAAclmE,EAAKY,EAAKjd,GAC/B,IAAIoc,EAAOC,EAAIE,QAAQU,GAAMtX,EAAQyW,EAAKzW,QAC1C,OAAOyW,EAAKhT,OAAO8sC,eAAevwC,EAAOA,EAAQ,EAAG3F,GAuBtD,SAASwxE,EAASn1D,EAAKY,EAAKoB,EAAOmkE,QAClB,IAAVnkE,IAAmBA,EAAQ,GAEhC,IAAIjC,EAAOC,EAAIE,QAAQU,GAAMoR,EAAOjS,EAAKiC,MAAQA,EAC7CokE,EAAaD,GAAcA,EAAWA,EAAWn/E,OAAS,IAAO+Y,EAAKhT,OAC1E,GAAIilB,EAAO,GAAKjS,EAAKhT,OAAOpJ,KAAK2d,KAAKsB,YACjC7C,EAAKhT,OAAOqpC,WAAWr2B,EAAKzW,QAASyW,EAAKhT,OAAOmV,cACjDkkE,EAAUziF,KAAKs8B,aAAalgB,EAAKhT,OAAOuT,QAAQi0B,WAAWx0B,EAAKzW,QAASyW,EAAKhT,OAAOmV,aACtF,OAAO,EACX,IAAK,IAAIH,EAAIhC,EAAKiC,MAAQ,EAAGxS,EAAIwS,EAAQ,EAAGD,EAAIiQ,EAAMjQ,IAAKvS,IAAK,CAC9D,IAAIxJ,EAAO+Z,EAAK/Z,KAAK+b,GAAIskE,EAAUtmE,EAAKzW,MAAMyY,GAC9C,GAAI/b,EAAKrC,KAAK2d,KAAKsB,UAAa,OAAO,EACvC,IAAI0jE,EAAOtgF,EAAKsa,QAAQi0B,WAAW8xC,EAASrgF,EAAKkc,YAC7CW,EAASsjE,GAAcA,EAAW32E,IAAOxJ,EAE7C,GADI6c,GAAS7c,IAAQsgF,EAAOA,EAAK9xC,aAAa,EAAG3xB,EAAMlf,KAAKnB,OAAOqgB,EAAMoX,UACpEj0B,EAAKowC,WAAWiwC,EAAU,EAAGrgF,EAAKkc,cAAgBW,EAAMlf,KAAKs8B,aAAaqmD,GAC3E,OAAO,EAEb,IAAIh9E,EAAQyW,EAAKkC,WAAW+P,GACxBu0D,EAAWJ,GAAcA,EAAW,GACxC,OAAOpmE,EAAK/Z,KAAKgsB,GAAM6nB,eAAevwC,EAAOA,EAAOi9E,EAAWA,EAAS5iF,KAAOoc,EAAK/Z,KAAKgsB,EAAO,GAAGruB,MAwBrG,SAASmwE,EAAQ9zD,EAAKY,GACpB,IAAIb,EAAOC,EAAIE,QAAQU,GAAMtX,EAAQyW,EAAKzW,QAC1C,OAAOutC,EAAS92B,EAAK6G,WAAY7G,EAAK8G,YACpC9G,EAAKhT,OAAOqpC,WAAW9sC,EAAOA,EAAQ,GAG1C,SAASutC,EAAS56B,EAAGC,GACnB,OAAOD,GAAKC,IAAMD,EAAEm4B,QAAUn4B,EAAE89B,UAAU79B,GAO5C,SAASsqE,EAAUxmE,EAAKY,EAAKgB,QACd,IAARA,IAAiBA,GAAO,GAG7B,IADA,IAAI7B,EAAOC,EAAIE,QAAQU,GACdmB,EAAIhC,EAAKiC,OAAQD,IAAK,CAC7B,IAAInV,OAAS,EAAUiW,OAAQ,EAW/B,GAVId,GAAKhC,EAAKiC,OACZpV,EAASmT,EAAK6G,WACd/D,EAAQ9C,EAAK8G,WACJjF,EAAM,GACfhV,EAASmT,EAAK/Z,KAAK+b,EAAI,GACvBc,EAAQ9C,EAAK/Z,KAAK+b,GAAGI,WAAWpC,EAAKzW,MAAMyY,GAAK,KAEhDnV,EAASmT,EAAK/Z,KAAK+b,GAAGI,WAAWpC,EAAKzW,MAAMyY,GAAK,GACjDc,EAAQ9C,EAAK/Z,KAAK+b,EAAI,IAEpBnV,IAAWA,EAAOsU,aAAe21B,EAASjqC,EAAQiW,GAAU,OAAOjC,EACvE,GAAS,GAALmB,EAAU,MACdnB,EAAMgB,EAAM,EAAI7B,EAAKnT,OAAOmV,GAAKhC,EAAK8C,MAAMd,IAmBhD,SAAS0kE,EAAYzmE,EAAKY,EAAKlM,GAC7B,IAAIqL,EAAOC,EAAIE,QAAQU,GACvB,GAAIb,EAAKhT,OAAO8sC,eAAe95B,EAAKzW,QAASyW,EAAKzW,QAASoL,GAAa,OAAOkM,EAE/E,GAAyB,GAArBb,EAAK4c,aACL,IAAK,IAAI5a,EAAIhC,EAAKiC,MAAQ,EAAGD,GAAK,EAAGA,IAAK,CAC1C,IAAIzY,EAAQyW,EAAKzW,MAAMyY,GACvB,GAAIhC,EAAK/Z,KAAK+b,GAAG83B,eAAevwC,EAAOA,EAAOoL,GAAa,OAAOqL,EAAKnT,OAAOmV,EAAI,GAClF,GAAIzY,EAAQ,EAAK,OAAO,KAE5B,GAAIyW,EAAK4c,cAAgB5c,EAAKhT,OAAOuT,QAAQysB,KACzC,IAAK,IAAI25C,EAAM3mE,EAAKiC,MAAQ,EAAG0kE,GAAO,EAAGA,IAAO,CAChD,IAAIL,EAAUtmE,EAAKkC,WAAWykE,GAC9B,GAAI3mE,EAAK/Z,KAAK0gF,GAAK7sC,eAAewsC,EAASA,EAAS3xE,GAAa,OAAOqL,EAAK8C,MAAM6jE,EAAM,GACzF,GAAIL,EAAUtmE,EAAK/Z,KAAK0gF,GAAKxkE,WAAc,OAAO,MASxD,SAASoG,EAAUtI,EAAKY,EAAK1Q,GAC3B,IAAI6P,EAAOC,EAAIE,QAAQU,GACvB,IAAK1Q,EAAMoQ,QAAQysB,KAAQ,OAAOnsB,EAElC,IADA,IAAIN,EAAUpQ,EAAMoQ,QACX9Q,EAAI,EAAGA,EAAIU,EAAMgvB,UAAW1vB,IAAO8Q,EAAUA,EAAQ9L,WAAW8L,QACzE,IAAK,IAAIqmE,EAAO,EAAGA,IAA4B,GAAnBz2E,EAAMgvB,WAAkBhvB,EAAM68B,KAAO,EAAI,GAAI45C,IACvE,IAAK,IAAI5kE,EAAIhC,EAAKiC,MAAOD,GAAK,EAAGA,IAAK,CACpC,IAAImtB,EAAOntB,GAAKhC,EAAKiC,MAAQ,EAAIjC,EAAKa,MAAQb,EAAK6L,MAAM7J,EAAI,GAAKhC,EAAKlV,IAAIkX,EAAI,IAAM,GAAK,EAAI,EAC1FgrD,EAAYhtD,EAAKzW,MAAMyY,IAAMmtB,EAAO,EAAI,EAAI,GAChD,GAAY,GAARy3C,EACE5mE,EAAK/Z,KAAK+b,GAAGq0B,WAAW22B,EAAWA,EAAWzsD,GAC9CP,EAAK/Z,KAAK+b,GAAGN,eAAesrD,GAAWpxB,aAAar7B,EAAQ9L,WAAW7Q,MACzE,OAAe,GAARurC,EAAYnvB,EAAKa,IAAMsuB,EAAO,EAAInvB,EAAKnT,OAAOmV,EAAI,GAAKhC,EAAK8C,MAAMd,EAAI,GAGrF,OAAO,KAGT,SAAS6kE,EAAYjoD,EAAUkV,EAAG9mC,GAEhC,IADA,IAAI6iB,EAAS,GACJpgB,EAAI,EAAGA,EAAImvB,EAASzc,WAAY1S,IAAK,CAC5C,IAAI5H,EAAQ+2B,EAAS/2B,MAAM4H,GACvB5H,EAAM0Y,QAAQysB,OAAQnlC,EAAQA,EAAM6vB,KAAKmvD,EAAYh/E,EAAM0Y,QAASuzB,EAAGjsC,KACvEA,EAAMuwC,WAAYvwC,EAAQisC,EAAEjsC,EAAOmF,EAAQyC,IAC/CogB,EAAO1oB,KAAKU,GAEd,OAAOgY,EAAiB+zB,SAAS3U,UAAUpP,GAtU7C60D,EAAKhiE,OAAO,gBAAiB6nC,GA8C7BwB,EAAU5zC,UAAU09D,KAAO,SAASvyE,EAAO+kB,GASzC,IARA,IAAIjE,EAAQ9gB,EAAM8gB,MACdD,EAAM7gB,EAAM6gB,IACZlC,EAAQ3e,EAAM2e,MAEd6kE,EAAW1iE,EAAMvX,OAAOoV,EAAQ,GAAI8kE,EAAS5iE,EAAIrB,MAAMb,EAAQ,GAC/D4J,EAAQi7D,EAAUh8E,EAAMi8E,EAExBl6E,EAASgT,EAAiB+zB,SAASnzB,MAAO0e,EAAY,EACjDnd,EAAIC,EAAO+kE,GAAY,EAAOhlE,EAAIqG,EAAQrG,IAC3CglE,GAAa5iE,EAAM7a,MAAMyY,GAAK,GAClCglE,GAAY,EACZn6E,EAASgT,EAAiB+zB,SAAS1oB,KAAK9G,EAAMne,KAAK+b,GAAG0V,KAAK7qB,IAC3DsyB,KAEAtT,IAGJ,IADA,IAAI/I,EAAQjD,EAAiB+zB,SAASnzB,MAAO2e,EAAU,EAC9CunD,EAAM1kE,EAAOglE,GAAc,EAAON,EAAMt+D,EAAQs+D,IACjDM,GAAe9iE,EAAIrB,MAAM6jE,EAAM,GAAKxiE,EAAIrZ,IAAI67E,IAChDM,GAAc,EACdnkE,EAAQjD,EAAiB+zB,SAAS1oB,KAAK/G,EAAIle,KAAK0gF,GAAKjvD,KAAK5U,IAC1Dsc,KAEAt0B,IAGJ,OAAOzF,KAAK4kB,KAAK,IAAIsgC,EAAkB1+B,EAAO/gB,EAAKg8E,EAAUC,EACtB,IAAIlnE,EAAiBW,MAAM3T,EAAOwd,OAAOvH,GAAQqc,EAAWC,GAC5DvyB,EAAOmgC,KAAO7N,GAAW,KAkDlE4sB,EAAU5zC,UAAU2rC,KAAO,SAASxgD,EAAO0xE,GAEzC,IADA,IAAIz0D,EAAUV,EAAiB+zB,SAASnzB,MAC/BhR,EAAIulE,EAAS/tE,OAAS,EAAGwI,GAAK,EAAGA,IACtC8Q,EAAUV,EAAiB+zB,SAAS1oB,KAAK8pD,EAASvlE,GAAG7L,KAAKnB,OAAOuyE,EAASvlE,GAAGyqB,MAAO3Z,IAExF,IAAIsL,EAAQvoB,EAAMuoB,MAAO/gB,EAAMxH,EAAMwH,IACrC,OAAOzF,KAAK4kB,KAAK,IAAIsgC,EAAkB1+B,EAAO/gB,EAAK+gB,EAAO/gB,EAAK,IAAI+U,EAAiBW,MAAMD,EAAS,EAAG,GAAIy0D,EAAS/tE,QAAQ,KAM7H8kD,EAAU5zC,UAAU87D,aAAe,SAAS/oD,EAAMC,EAAIvnB,EAAMs2B,GAC1D,IAAItU,EAASvgB,KAGb,QAFY,IAAP8lB,IAAgBA,EAAKD,IAErBtnB,EAAKud,YAAe,MAAM,IAAI5d,WAAW,oDAC9C,IAAIkmB,EAAUpkB,KAAKslB,MAAM1jB,OAYzB,OAXA5B,KAAK4a,IAAIsc,aAAarR,EAAMC,GAAI,SAAUllB,EAAM4a,GAC9C,GAAI5a,EAAKkb,cAAgBlb,EAAKu3B,UAAU55B,EAAMs2B,IAAUisD,EAAcvgE,EAAO3F,IAAK2F,EAAO1F,QAAQ/P,MAAMsZ,GAAS3gB,IAAI+X,GAAMjd,GAAO,CAE/HgiB,EAAOshE,kBAAkBthE,EAAO1F,QAAQ/P,MAAMsZ,GAAS3gB,IAAI+X,EAAK,GAAIjd,GACpE,IAAIsc,EAAU0F,EAAO1F,QAAQ/P,MAAMsZ,GAC/B09D,EAASjnE,EAAQpX,IAAI+X,EAAK,GAAIumE,EAAOlnE,EAAQpX,IAAI+X,EAAM5a,EAAKghB,SAAU,GAG1E,OAFArB,EAAOqE,KAAK,IAAIsgC,EAAkB48B,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EACnC,IAAIvnE,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAKtnB,EAAKnB,OAAOy3B,EAAO,KAAMj0B,EAAKq2B,QAAS,EAAG,GAAI,GAAG,KACpI,MAGJj3B,MAWT0mD,EAAU5zC,UAAUgoB,cAAgB,SAAStf,EAAKjd,EAAMs2B,EAAOoC,GAC7D,IAAIr2B,EAAOZ,KAAK4a,IAAImF,OAAOvE,GAC3B,IAAK5a,EAAQ,MAAM,IAAI1C,WAAW,6BAC7BK,IAAQA,EAAOqC,EAAKrC,MACzB,IAAIyjF,EAAUzjF,EAAKnB,OAAOy3B,EAAO,KAAMoC,GAASr2B,EAAKq2B,OACrD,GAAIr2B,EAAKouC,OACL,OAAOhvC,KAAK6jD,YAAYroC,EAAKA,EAAM5a,EAAKghB,SAAUogE,GAEtD,IAAKzjF,EAAKs8B,aAAaj6B,EAAKsa,SACxB,MAAM,IAAIhd,WAAW,iCAAmCK,EAAKd,MAEjE,OAAOuC,KAAK4kB,KAAK,IAAIsgC,EAAkB1pC,EAAKA,EAAM5a,EAAKghB,SAAUpG,EAAM,EAAGA,EAAM5a,EAAKghB,SAAW,EACzD,IAAIpH,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAKm8D,GAAU,EAAG,GAAI,GAAG,KAkCvHt7B,EAAU5zC,UAAUlL,MAAQ,SAAS4T,EAAKoB,EAAOmkE,QAChC,IAAVnkE,IAAmBA,EAAQ,GAGhC,IADA,IAAIjC,EAAO3a,KAAK4a,IAAIE,QAAQU,GAAMhU,EAASgT,EAAiB+zB,SAASnzB,MAAOqC,EAAQjD,EAAiB+zB,SAASnzB,MACrGuB,EAAIhC,EAAKiC,MAAOkE,EAAInG,EAAKiC,MAAQA,EAAOxS,EAAIwS,EAAQ,EAAGD,EAAImE,EAAGnE,IAAKvS,IAAK,CAC/E5C,EAASgT,EAAiB+zB,SAAS1oB,KAAKlL,EAAK/Z,KAAK+b,GAAG0V,KAAK7qB,IAC1D,IAAIy6E,EAAYlB,GAAcA,EAAW32E,GACzCqT,EAAQjD,EAAiB+zB,SAAS1oB,KAAKo8D,EAAYA,EAAU1jF,KAAKnB,OAAO6kF,EAAUptD,MAAOpX,GAAS9C,EAAK/Z,KAAK+b,GAAG0V,KAAK5U,IAEvH,OAAOzd,KAAK4kB,KAAK,IAAIqgC,EAAYzpC,EAAKA,EAAK,IAAIhB,EAAiBW,MAAM3T,EAAOwd,OAAOvH,GAAQb,EAAOA,IAAQ,KA6C7G8pC,EAAU5zC,UAAUnQ,KAAO,SAAS6Y,EAAKoB,QACxB,IAAVA,IAAmBA,EAAQ,GAEhC,IAAIgI,EAAO,IAAIqgC,EAAYzpC,EAAMoB,EAAOpB,EAAMoB,EAAOpC,EAAiBW,MAAMC,OAAO,GACnF,OAAOpb,KAAK4kB,KAAKA,IA6DnB,IAAIs9D,EAAe,SAAUpC,GAC3B,SAASoC,EAAYr8D,EAAMC,EAAIqR,GAC7B2oD,EAAQ/vE,KAAK/P,MACbA,KAAK6lB,KAAOA,EACZ7lB,KAAK8lB,GAAKA,EACV9lB,KAAKm3B,KAAOA,EAgDd,OA7CK2oD,IAAUoC,EAAY76E,UAAYy4E,GACvCoC,EAAYpvE,UAAY3T,OAAO/B,OAAQ0iF,GAAWA,EAAQhtE,WAC1DovE,EAAYpvE,UAAU1Q,YAAc8/E,EAEpCA,EAAYpvE,UAAUnV,MAAQ,SAAgBid,GAC5C,IAAI2F,EAASvgB,KAETmiF,EAAWvnE,EAAI9P,MAAM9K,KAAK6lB,KAAM7lB,KAAK8lB,IAAK/G,EAAQnE,EAAIE,QAAQ9a,KAAK6lB,MACnEle,EAASoX,EAAMne,KAAKme,EAAMi0B,YAAYhzC,KAAK8lB,KAC3Chb,EAAQ,IAAI0P,EAAiBW,MAAMqmE,EAAYW,EAASjnE,SAAS,SAAUta,EAAM+G,GACnF,OAAKA,EAAOpJ,KAAKm7C,eAAen5B,EAAO4W,KAAK54B,MACrCqC,EAAKu2B,KAAK5W,EAAO4W,KAAKwC,SAAS/4B,EAAKq2B,QADiBr2B,IAE3D+G,GAASw6E,EAASroD,UAAWqoD,EAASpoD,SACzC,OAAO4lD,EAAWE,YAAYjlE,EAAK5a,KAAK6lB,KAAM7lB,KAAK8lB,GAAIhb,IAGzDo3E,EAAYpvE,UAAUyS,OAAS,WAC7B,OAAO,IAAI68D,EAAepiF,KAAK6lB,KAAM7lB,KAAK8lB,GAAI9lB,KAAKm3B,OAGrD+qD,EAAYpvE,UAAUrP,IAAM,SAAcoX,GACxC,IAAIgL,EAAOhL,EAAQ8pC,UAAU3kD,KAAK6lB,KAAM,GAAIC,EAAKjL,EAAQ8pC,UAAU3kD,KAAK8lB,IAAK,GAC7E,OAAID,EAAK++B,SAAW9+B,EAAG8+B,SAAW/+B,EAAKrK,KAAOsK,EAAGtK,IAAc,KACxD,IAAI0mE,EAAYr8D,EAAKrK,IAAKsK,EAAGtK,IAAKxb,KAAKm3B,OAGhD+qD,EAAYpvE,UAAU4S,MAAQ,SAAgBpK,GAC5C,GAAIA,aAAiB4mE,GACjB5mE,EAAM6b,KAAK9b,GAAGrb,KAAKm3B,OACnBn3B,KAAK6lB,MAAQvK,EAAMwK,IAAM9lB,KAAK8lB,IAAMxK,EAAMuK,KAC1C,OAAO,IAAIq8D,EAAYnsE,KAAK8Q,IAAI7mB,KAAK6lB,KAAMvK,EAAMuK,MAC5B9P,KAAK0Q,IAAIzmB,KAAK8lB,GAAIxK,EAAMwK,IAAK9lB,KAAKm3B,OAG7D+qD,EAAYpvE,UAAUyI,OAAS,WAC7B,MAAO,CAACkkE,SAAU,UAAWtoD,KAAMn3B,KAAKm3B,KAAK5b,SACrCsK,KAAM7lB,KAAK6lB,KAAMC,GAAI9lB,KAAK8lB,KAGpCo8D,EAAYzmE,SAAW,SAAmB6e,EAAQ5e,GAChD,GAAwB,iBAAbA,EAAKmK,MAAsC,iBAAXnK,EAAKoK,GAC5C,MAAM,IAAI5nB,WAAW,0CACzB,OAAO,IAAIgkF,EAAYxmE,EAAKmK,KAAMnK,EAAKoK,GAAIwU,EAAOya,aAAar5B,EAAKyb,QAG/D+qD,EArDS,CAsDhB7C,GAEFA,EAAKhiE,OAAO,UAAW6kE,GAGvB,IAAIE,EAAkB,SAAUtC,GAC9B,SAASsC,EAAev8D,EAAMC,EAAIqR,GAChC2oD,EAAQ/vE,KAAK/P,MACbA,KAAK6lB,KAAOA,EACZ7lB,KAAK8lB,GAAKA,EACV9lB,KAAKm3B,KAAOA,EA8Cd,OA3CK2oD,IAAUsC,EAAe/6E,UAAYy4E,GAC1CsC,EAAetvE,UAAY3T,OAAO/B,OAAQ0iF,GAAWA,EAAQhtE,WAC7DsvE,EAAetvE,UAAU1Q,YAAcggF,EAEvCA,EAAetvE,UAAUnV,MAAQ,SAAgBid,GAC/C,IAAI2F,EAASvgB,KAETmiF,EAAWvnE,EAAI9P,MAAM9K,KAAK6lB,KAAM7lB,KAAK8lB,IACrChb,EAAQ,IAAI0P,EAAiBW,MAAMqmE,EAAYW,EAASjnE,SAAS,SAAUta,GAC7E,OAAOA,EAAKu2B,KAAK5W,EAAO4W,KAAKgZ,cAAcvvC,EAAKq2B,WAC9CkrD,EAASroD,UAAWqoD,EAASpoD,SACjC,OAAO4lD,EAAWE,YAAYjlE,EAAK5a,KAAK6lB,KAAM7lB,KAAK8lB,GAAIhb,IAGzDs3E,EAAetvE,UAAUyS,OAAS,WAChC,OAAO,IAAI28D,EAAYliF,KAAK6lB,KAAM7lB,KAAK8lB,GAAI9lB,KAAKm3B,OAGlDirD,EAAetvE,UAAUrP,IAAM,SAAcoX,GAC3C,IAAIgL,EAAOhL,EAAQ8pC,UAAU3kD,KAAK6lB,KAAM,GAAIC,EAAKjL,EAAQ8pC,UAAU3kD,KAAK8lB,IAAK,GAC7E,OAAID,EAAK++B,SAAW9+B,EAAG8+B,SAAW/+B,EAAKrK,KAAOsK,EAAGtK,IAAc,KACxD,IAAI4mE,EAAev8D,EAAKrK,IAAKsK,EAAGtK,IAAKxb,KAAKm3B,OAGnDirD,EAAetvE,UAAU4S,MAAQ,SAAgBpK,GAC/C,GAAIA,aAAiB8mE,GACjB9mE,EAAM6b,KAAK9b,GAAGrb,KAAKm3B,OACnBn3B,KAAK6lB,MAAQvK,EAAMwK,IAAM9lB,KAAK8lB,IAAMxK,EAAMuK,KAC1C,OAAO,IAAIu8D,EAAersE,KAAK8Q,IAAI7mB,KAAK6lB,KAAMvK,EAAMuK,MAC5B9P,KAAK0Q,IAAIzmB,KAAK8lB,GAAIxK,EAAMwK,IAAK9lB,KAAKm3B,OAGhEirD,EAAetvE,UAAUyI,OAAS,WAChC,MAAO,CAACkkE,SAAU,aAActoD,KAAMn3B,KAAKm3B,KAAK5b,SACxCsK,KAAM7lB,KAAK6lB,KAAMC,GAAI9lB,KAAK8lB,KAGpCs8D,EAAe3mE,SAAW,SAAmB6e,EAAQ5e,GACnD,GAAwB,iBAAbA,EAAKmK,MAAsC,iBAAXnK,EAAKoK,GAC5C,MAAM,IAAI5nB,WAAW,6CACzB,OAAO,IAAIkkF,EAAe1mE,EAAKmK,KAAMnK,EAAKoK,GAAIwU,EAAOya,aAAar5B,EAAKyb,QAGlEirD,EAnDY,CAoDnB/C,GAqHF,SAASgD,EAAYznE,EAAKiL,EAAMC,EAAIhb,GAIlC,QAHY,IAAPgb,IAAgBA,EAAKD,QACX,IAAV/a,IAAmBA,EAAQ0P,EAAiBW,MAAMC,OAEnDyK,GAAQC,IAAOhb,EAAM68B,KAAQ,OAAO,KAExC,IAAI5oB,EAAQnE,EAAIE,QAAQ+K,GAAO/G,EAAMlE,EAAIE,QAAQgL,GAEjD,GAAIw8D,EAAcvjE,EAAOD,EAAKhU,GAAU,OAAO,IAAIm6C,EAAYp/B,EAAMC,EAAIhb,GACzE,IAAIklC,EAASuyC,EAAWxjE,EAAOjU,GAE3B03E,EAAaC,EAAQ1jE,EAAOixB,GAC5B0yC,EAASC,EAAS5jE,EAAOD,EAAK0jE,GAClC,IAAKE,EAAU,OAAO,KACtB,GAAIF,EAAW76C,MAAQ+6C,EAAO/6C,MAAQi7C,EAAY7jE,EAAOD,EAAK0jE,GAAa,CACzE,IAAI7lE,EAAImC,EAAIlC,MAAOa,EAAQqB,EAAIrB,MAAMd,GACrC,MAAOA,EAAI,GAAKc,GAASqB,EAAIrZ,MAAMkX,KAAQc,EAC3C,IAAIolE,EAAcF,EAAS5jE,EAAOnE,EAAIE,QAAQ2C,GAAQ+kE,GACtD,GAAIK,EACA,OAAO,IAAI39B,EAAkBr/B,EAAMpI,EAAOqI,EAAIhH,EAAIrZ,MAAOo9E,EAAaL,EAAW76C,MAEvF,OAAO+6C,EAAO/6C,MAAQ9hB,GAAQC,EAAK,IAAIm/B,EAAYp/B,EAAMC,EAAI48D,GAAU,KAoCzE,SAASI,EAAa/jE,EAAOnC,EAAOozB,EAAQ+yC,GAC1C,IAAI7nE,EAAUV,EAAiB+zB,SAASnzB,MAAO2e,EAAU,EAAGipD,EAAahzC,EAAOpzB,GAChF,GAAImC,EAAMnC,MAAQA,EAAO,CACvB,IAAImxB,EAAQ+0C,EAAa/jE,EAAOnC,EAAQ,EAAGozB,EAAQ+yC,GAAeC,GAClEjpD,EAAUgU,EAAMhU,QAAU,EAC1B7e,EAAUV,EAAiB+zB,SAAS1oB,KAAK9G,EAAMne,KAAKgc,EAAQ,GAAGyV,KAAK0b,EAAM7yB,UAY5E,OATI8nE,IACF9nE,EAAUA,EAAQ8J,OAAOg+D,EAAW9nE,SACpC6e,EAAUipD,EAAWjpD,SAEnBgpD,IACF7nE,EAAUA,EAAQ8J,OAAOjG,EAAMne,KAAKgc,GAAOP,eAAe0C,EAAMlC,WAAWD,IAAQo5B,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,IAC/H2e,EAAU,GAGL,CAAC7e,QAASA,EAAS6e,QAASA,GAGrC,SAAS0oD,EAAQ1jE,EAAOixB,GACtB,IAAIzwB,EAAMujE,EAAa/jE,EAAO,EAAGixB,GAAQ,GACrC90B,EAAUqE,EAAIrE,QACd6e,EAAUxa,EAAIwa,QAClB,OAAO,IAAIvf,EAAiBW,MAAMD,EAAS6D,EAAMnC,MAAOmd,GAAW,GAGrE,SAASkpD,EAAa/nE,EAASvT,EAAQoX,EAAOD,EAAKlC,EAAOkd,EAAWC,GACnE,IAAI91B,EAAO0G,EAAQuQ,EAAQ4B,WAAYomE,EAAav4E,GAASovB,EAAU,EAAI,EAAI,GAC3E7nB,EAAa4nB,EAAY,EAAInyB,EAASoX,EAAMne,KAAKgc,GAEjD3Y,EADA61B,EAAY,EACJ5nB,EAAWmK,eAAe6mE,GACpB,GAATv4E,GAAcovB,EAAU,EACrB7nB,EAAWmK,eAAeyd,EAAY/a,EAAM7a,MAAM0Y,GAASmC,EAAMlC,WAAWD,IAE5E1K,EAAWmK,eAAe0C,EAAMlC,WAAWD,IAClDu3B,cAAcj5B,EAASvQ,EAAQ,GAAKmvB,EAAY,EAAI,EAAGopD,GAE5D,IAAIC,EAASrkE,EAAIle,KAAKgc,GACtB,GAAImd,EAAU,GAAKnd,EAAQkC,EAAIlC,MAAO,CACpC,IAAIa,EAAQ0lE,EAAOjoE,QAAQi0B,WAAWrwB,EAAIjC,WAAWD,IAAQyyB,WAAWn0B,EAAQ+B,WAC5EmmE,EAAan/E,EAAM+xC,WAAWv4B,GAAO,GAIzC,GAFI2lE,GAAcA,EAAWz7C,MAAQ7N,EAAY,GAAc,GAATnvB,IAAcy4E,EAAa,MAE7EA,EAAY,CACd,IAAIr1C,EAAQk1C,EAAa/nE,EAAQ+B,UAAU/B,QAASA,EAAQ+B,UAAW8B,EAAOD,EACrDlC,EAAQ,EAAY,GAATjS,EAAamvB,EAAY,GAAK,EAAGC,EAAU,GAC/E,GAAIgU,EAAO,CACT,IAAIzmB,EAAOpM,EAAQ+B,UAAUoV,KAAK0b,GAClC,OAAIq1C,EAAWz7C,KACJzsB,EAAQi0B,WAAW,EAAGxkC,EAAQ,GAAGqa,OAAOo+D,GAAY9zC,SAAShoB,GAE7DpM,EAAQk0B,aAAazkC,EAAQ,EAAG2c,KAI7CyS,EAAU,IACV91B,EAAQA,EAAMywC,WAAoB,GAAT/pC,GAAcmvB,EAAY,EAAI/a,EAAMne,KAAKgc,EAAQ,GAAK1B,EAAQ+B,WAAW1e,OAItG,IAAI8kF,EAAUvkE,EAAI5a,MAAM0Y,GACxB,GAAIymE,GAAWF,EAAOrmE,aAAeqmE,EAAO5kF,KAAKizC,kBAAkB7pC,EAAOpJ,MAAS,OAAO,KAE1F,IADA,IAAIkzC,EAAWxtC,EAAM+xC,WAAWmtC,EAAOjoE,SAAS,EAAMmoE,GAC7Cj5E,EAAIi5E,EAAS5xC,GAAYrnC,EAAI+4E,EAAOjoE,QAAQ4B,WAAY1S,IACxD8H,EAAW3T,KAAKi2C,YAAY2uC,EAAOjoE,QAAQ1Y,MAAM4H,GAAG6sB,SAAUwa,EAAW,MAClF,IAAKA,EAAY,OAAO,KAExB,GAAI1X,EAAU,EAAG,CACf,IAAIupD,EAASC,EAAeroE,EAAQ+B,UAAW8c,EAAU,EAAGhb,EAAOnC,EAAQ,EACtC,GAATjS,EAAamvB,EAAY,GAAK,GAC1D5e,EAAUA,EAAQk0B,aAAazkC,EAAQ,EAAG24E,GAK5C,OAHApoE,EAAUA,EAAQ8J,OAAOysB,GACrB3yB,EAAIlC,MAAQA,IACZ1B,EAAUA,EAAQo0B,SAASk0C,EAAiB1kE,EAAKlC,EAAQ,KACtD1B,EAGT,SAASqoE,EAAe3iF,EAAMm5B,EAAShb,EAAOnC,EAAOkd,GACnD,IAAI71B,EAAOiX,EAAUta,EAAKsa,QAASvQ,EAAQuQ,EAAQ4B,WAOnD,GALI7Y,EADA61B,GAAa,EACL/a,EAAMne,KAAKgc,GAAOP,eAAe0C,EAAMlC,WAAWD,IACzDu3B,cAAcj5B,EAAS4e,EAAY,EAAI,EAAI,EAAGnvB,GAEvC/J,EAAKyb,eAAe1R,GAE5BovB,EAAU,EAAG,CACf,IAAIupD,EAASC,EAAeroE,EAAQ+B,UAAW8c,EAAU,EAAGhb,EAAOnC,EAAQ,EACtC,GAATjS,EAAamvB,EAAY,GAAK,GAC1D5e,EAAUA,EAAQk0B,aAAazkC,EAAQ,EAAG24E,GAG5C,OAAO1iF,EAAKyxB,KAAKnX,EAAQ8J,OAAO/gB,EAAM+xC,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,KAGpF,SAASooE,EAAiB1kE,EAAKlC,GAC7B,IAAIhc,EAAOke,EAAIle,KAAKgc,GAChB4hC,EAAO59C,EAAKyb,eAAe,GAAG25B,WAAWp1C,EAAKsa,SAAS,EAAM4D,EAAI5a,MAAM0Y,IAE3E,OADIkC,EAAIlC,MAAQA,IAAS4hC,EAAOA,EAAKlP,SAASk0C,EAAiB1kE,EAAKlC,EAAQ,KACrEhc,EAAKyxB,KAAKmsB,GAGnB,SAASilC,EAAevoE,EAAS4e,EAAWC,GAC1C,MAAOD,EAAY,GAAKC,EAAU,GAA2B,GAAtB7e,EAAQ4B,WAC7C5B,EAAUA,EAAQ9L,WAAW8L,QAC7B4e,IACAC,IAEF,OAAO,IAAIvf,EAAiBW,MAAMD,EAAS4e,EAAWC,GAIxD,SAAS4oD,EAAS5jE,EAAOD,EAAKhU,GAC5B,IAAI43E,EAASO,EAAan4E,EAAMoQ,QAAS6D,EAAMne,KAAK,GAAIme,EAAOD,EAAK,EAAGhU,EAAMgvB,UAAWhvB,EAAMivB,SAC9F,OAAK2oD,EACEe,EAAef,EAAQ53E,EAAMgvB,UAAWhb,EAAIlC,OAD7B,KAIxB,SAAS0lE,EAAcvjE,EAAOD,EAAKhU,GACjC,OAAQA,EAAMgvB,YAAchvB,EAAMivB,SAAWhb,EAAMyH,SAAW1H,EAAI0H,SAChEzH,EAAMpX,OAAOqpC,WAAWjyB,EAAM7a,QAAS4a,EAAI5a,QAAS4G,EAAMoQ,SAG9D,SAAS0nE,EAAY7jE,EAAOD,EAAKhU,GAC/B,IAAKgU,EAAInX,OAAOmU,YAAe,OAAO,EAEtC,IAKI7X,EALA0D,EAASmD,EAAMivB,QAAU2pD,EAAU54E,EAAMoQ,QAASpQ,EAAMivB,SACtDhb,EAAMne,KAAKme,EAAMnC,OAAS9R,EAAMgvB,UAAYhvB,EAAMivB,UACxD,IAAKpyB,EAAOmU,YAAe,OAAO,EAClC,IAAK,IAAI1R,EAAI0U,EAAI5a,QAASkG,EAAI0U,EAAInX,OAAOmV,WAAY1S,IACjD,IAAKzC,EAAOpJ,KAAKi2C,YAAY11B,EAAInX,OAAOnF,MAAM4H,GAAG6sB,OAAU,OAAO,EAStE,OAPInsB,EAAMivB,QACR91B,EAAQ0D,EAAO0U,eAAe1U,EAAOmV,aAErC7Y,EAAQ0D,EAAO0U,eAAe1U,EAAOmV,YACjChS,EAAM68B,OAAQ1jC,EAAQA,EAAMkwC,cAAcrpC,EAAMoQ,QAASpQ,EAAMgvB,UAAY,EAAI,KAErF71B,EAAQA,EAAMkwC,cAAcr1B,EAAInX,OAAOuT,QAAS4D,EAAI5a,SAC7CD,GAASA,EAAMswC,SAGxB,SAASmvC,EAAUxoE,EAAS0B,GAC1B,IAAK,IAAIxS,EAAI,EAAGA,EAAIwS,EAAOxS,IAAO8Q,EAAUA,EAAQ+B,UAAU/B,QAC9D,OAAOA,EAAQ+B,UAkBjB,SAASslE,EAAWxjE,EAAOjU,GAEzB,IADA,IAAI64E,EAAW,IAAIC,EAAS7kE,GACnBwiE,EAAO,EAAGz2E,EAAM68B,MAAQ45C,GAAQ,EAAGA,IAAQ,CAClD,IAAIphF,EAAQwjF,EAASpB,WAAWz3E,EAAMoQ,QAASpQ,EAAMgvB,UAAWhvB,EAAMivB,QAASwnD,GACnE,GAARA,GAAaphF,GAAS2K,GAAS3K,EAAMwnC,OAAQ45C,EAAO,GACxDz2E,EAAQ3K,EAEV,MAAOwjF,EAAS/zE,KAAKhO,OAAU+hF,EAAS3hF,YACxC,OAAO2hF,EAAS3zC,OAxVlBqvC,EAAKhiE,OAAO,aAAc+kE,GAI1B17B,EAAU5zC,UAAUsmB,QAAU,SAASvT,EAAMC,EAAIqR,GAC/C,IAAI5W,EAASvgB,KAET49D,EAAU,GAAIz0C,EAAQ,GAAI06D,EAAW,KAAMC,EAAS,KA0BxD,OAzBA9jF,KAAK4a,IAAIsc,aAAarR,EAAMC,GAAI,SAAUllB,EAAM4a,EAAK7T,GACnD,GAAK/G,EAAKmyC,SAAV,CACA,IAAI9b,EAAQr2B,EAAKq2B,MACjB,IAAKE,EAAKU,QAAQZ,IAAUtvB,EAAOpJ,KAAKm7C,eAAeviB,EAAK54B,MAAO,CAIjE,IAHA,IAAIioB,EAAQzQ,KAAK0Q,IAAIjL,EAAKqK,GAAOpgB,EAAMsQ,KAAK8Q,IAAIrL,EAAM5a,EAAKghB,SAAUkE,GACjEi+D,EAAS5sD,EAAKwC,SAAS1C,GAElB7sB,EAAI,EAAGA,EAAI6sB,EAAMr1B,OAAQwI,IAC3B6sB,EAAM7sB,GAAGytB,QAAQksD,KAChBF,GAAYA,EAAS/9D,IAAMU,GAASq9D,EAAS1sD,KAAK9b,GAAG4b,EAAM7sB,IAC3Dy5E,EAAS/9D,GAAKrgB,EAEdm4D,EAAQ97D,KAAK+hF,EAAW,IAAIzB,EAAe57D,EAAO/gB,EAAKwxB,EAAM7sB,MAIjE05E,GAAUA,EAAOh+D,IAAMU,EACvBs9D,EAAOh+D,GAAKrgB,EAEZ0jB,EAAMrnB,KAAKgiF,EAAS,IAAI5B,EAAY17D,EAAO/gB,EAAK0xB,SAIxDymC,EAAQt+D,SAAQ,SAAU6K,GAAK,OAAOoW,EAAOqE,KAAKza,MAClDgf,EAAM7pB,SAAQ,SAAU6K,GAAK,OAAOoW,EAAOqE,KAAKza,MACzCnK,MAQT0mD,EAAU5zC,UAAUonB,WAAa,SAASrU,EAAMC,EAAIqR,GAClD,IAAI5W,EAASvgB,UACC,IAATm3B,IAAkBA,EAAO,MAE9B,IAAIrjB,EAAU,GAAI8Q,EAAO,EA+BzB,OA9BA5kB,KAAK4a,IAAIsc,aAAarR,EAAMC,GAAI,SAAUllB,EAAM4a,GAC9C,GAAK5a,EAAKmyC,SAAV,CACAnuB,IACA,IAAIo/D,EAAW,KACf,GAAI7sD,aAAgB3c,EAAiBs/B,SAAU,CAC7C,IAAIvK,EAAQpY,EAAKU,QAAQj3B,EAAKq2B,OAC1BsY,IAASy0C,EAAW,CAACz0C,SAChBpY,EACLA,EAAKU,QAAQj3B,EAAKq2B,SAAU+sD,EAAW,CAAC7sD,IAE5C6sD,EAAWpjF,EAAKq2B,MAElB,GAAI+sD,GAAYA,EAASpiF,OAEvB,IADA,IAAI6D,EAAMsQ,KAAK8Q,IAAIrL,EAAM5a,EAAKghB,SAAUkE,GAC/B1b,EAAI,EAAGA,EAAI45E,EAASpiF,OAAQwI,IAAK,CAExC,IADA,IAAIgY,EAAQ4hE,EAAS55E,GAAI65E,OAAU,EAC1Bn2C,EAAI,EAAGA,EAAIh6B,EAAQlS,OAAQksC,IAAK,CACvC,IAAInoC,EAAImO,EAAQg6B,GACZnoC,EAAEif,MAAQA,EAAO,GAAKxC,EAAM/G,GAAGvH,EAAQg6B,GAAG1rB,SAAU6hE,EAAUt+E,GAEhEs+E,GACFA,EAAQn+D,GAAKrgB,EACbw+E,EAAQr/D,KAAOA,GAEf9Q,EAAQhS,KAAK,CAACsgB,MAAOA,EAAOyD,KAAM9P,KAAK0Q,IAAIjL,EAAKqK,GAAOC,GAAIrgB,EAAKmf,KAAMA,SAK9E9Q,EAAQxU,SAAQ,SAAUqG,GAAK,OAAO4a,EAAOqE,KAAK,IAAIw9D,EAAez8E,EAAEkgB,KAAMlgB,EAAEmgB,GAAIngB,EAAEyc,WAC9EpiB,MAQT0mD,EAAU5zC,UAAU+uE,kBAAoB,SAASrmE,EAAK0oE,EAAYjgF,GAChE,IAAIsc,EAASvgB,UACE,IAAViE,IAAmBA,EAAQigF,EAAWhwC,cAI3C,IAFA,IAAItzC,EAAOZ,KAAK4a,IAAImF,OAAOvE,GACvB2oE,EAAW,GAAIx0C,EAAMn0B,EAAM,EACtBpR,EAAI,EAAGA,EAAIxJ,EAAKkc,WAAY1S,IAAK,CACxC,IAAI5H,EAAQ5B,EAAK4B,MAAM4H,GAAI3E,EAAMkqC,EAAMntC,EAAMof,SACzCwiE,EAAUngF,EAAMywC,UAAUlyC,EAAMjE,KAAMiE,EAAMqyB,OAChD,GAAKuvD,EAEE,CACLngF,EAAQmgF,EACR,IAAK,IAAIt2C,EAAI,EAAGA,EAAItrC,EAAMy0B,MAAMr1B,OAAQksC,IAAYo2C,EAAWxqC,eAAel3C,EAAMy0B,MAAM6W,GAAGvvC,OACzFgiB,EAAOqE,KAAK,IAAIw9D,EAAezyC,EAAKlqC,EAAKjD,EAAMy0B,MAAM6W,UAJzDq2C,EAASriF,KAAK,IAAImjD,EAAYtV,EAAKlqC,EAAK+U,EAAiBW,MAAMC,QAMjEu0B,EAAMlqC,EAER,IAAKxB,EAAMswC,SAAU,CACnB,IAAIiK,EAAOv6C,EAAM+xC,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,GAC7Dpb,KAAKI,QAAQuvC,EAAKA,EAAK,IAAIn1B,EAAiBW,MAAMqjC,EAAM,EAAG,IAE7D,IAAK,IAAIl0B,EAAM65D,EAASviF,OAAS,EAAG0oB,GAAO,EAAGA,IAAS/J,EAAOqE,KAAKu/D,EAAS75D,IAC5E,OAAOtqB,MAmCT0mD,EAAU5zC,UAAU1S,QAAU,SAASylB,EAAMC,EAAIhb,QACnC,IAAPgb,IAAgBA,EAAKD,QACX,IAAV/a,IAAmBA,EAAQ0P,EAAiBW,MAAMC,OAEvD,IAAIwJ,EAAOy9D,EAAYriF,KAAK4a,IAAKiL,EAAMC,EAAIhb,GAE3C,OADI8Z,GAAQ5kB,KAAK4kB,KAAKA,GACf5kB,MAMT0mD,EAAU5zC,UAAU+wC,YAAc,SAASh+B,EAAMC,EAAI5K,GACnD,OAAOlb,KAAKI,QAAQylB,EAAMC,EAAI,IAAItL,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAK3K,GAAU,EAAG,KAKvGwrC,EAAU5zC,UAAU/T,OAAS,SAAS8mB,EAAMC,GAC1C,OAAO9lB,KAAKI,QAAQylB,EAAMC,EAAItL,EAAiBW,MAAMC,QAKvDsrC,EAAU5zC,UAAUi+B,OAAS,SAASv1B,EAAKN,GACzC,OAAOlb,KAAK6jD,YAAYroC,EAAKA,EAAKN,IAuLpC,IAAI0oE,EAAW,SAAkBjpE,GAC/B,IAAI4F,EAASvgB,KAGbA,KAAK4P,KAAO,GACZ,IAAK,IAAI+M,EAAI,EAAGA,GAAKhC,EAAKiC,MAAOD,IAAK,CACpC,IAAIhV,EAASgT,EAAK/Z,KAAK+b,GAAI1Y,EAAQ0D,EAAO0U,eAAe1B,EAAKkC,WAAWF,IACzE4D,EAAO3Q,KAAK9N,KAAK,CAAC6F,OAAQA,EAAQ1D,MAAOA,EAAOiX,QAASV,EAAiB+zB,SAASnzB,MAAOujD,SAAS,EAAO5kC,QAAS,EAAGnd,MAAOD,IAE/H3c,KAAKgwC,OAAS,IAiIhB,SAASq0C,EAAezjF,EAAMk5B,EAAWC,GACvC,IAAI7e,EAAUta,EAAKsa,QACnB,GAAI4e,EAAY,EAAG,CACjB,IAAItE,EAAQ6uD,EAAezjF,EAAKwO,WAAY0qB,EAAY,EAAsB,GAAnBl5B,EAAKkc,WAAkBid,EAAU,EAAI,GAChG7e,EAAUta,EAAKsa,QAAQk0B,aAAa,EAAG5Z,GAEzC,IAAIgpB,EAAO59C,EAAKrC,KAAK21C,aAAa8B,WAAW96B,EAAoB,GAAX6e,GACtD,OAAOn5B,EAAKyxB,KAAKmsB,EAAKx5B,OAAO9J,IAG/B,SAASopE,EAAa1jF,EAAMgc,GAC1B,IAAI1B,EAAUta,EAAKsa,QACnB,GAAI0B,EAAQ,EAAG,CACb,IAAI0K,EAAOg9D,EAAa1jF,EAAKqc,UAAWL,EAAQ,GAChD1B,EAAUta,EAAKsa,QAAQk0B,aAAaxuC,EAAKkc,WAAa,EAAGwK,GAE3D,IAAIk3B,EAAO59C,EAAKyb,eAAezb,EAAKkc,YAAYk5B,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,GAC5F,OAAOxa,EAAKyxB,KAAKnX,EAAQ8J,OAAOw5B,IAGlC,SAAS+lC,EAAiBhrD,EAAU3c,GAClC,OAAOA,EAAQ2c,EAAS6V,aAAa7V,EAASzc,WAAa,EAAGwnE,EAAa/qD,EAAStc,UAAWL,IAAU2c,EA6F3G,SAASirD,GAAcjrD,EAAU3c,EAAO6nE,EAASC,EAAS/8E,GACxD,GAAIiV,EAAQ6nE,EAAS,CACnB,IAAIjvD,EAAQ+D,EAASnqB,WACrBmqB,EAAWA,EAAS6V,aAAa,EAAG5Z,EAAMnD,KAAKmyD,GAAchvD,EAAMta,QAAS0B,EAAQ,EAAG6nE,EAASC,EAASlvD,KAE3G,GAAI5Y,EAAQ8nE,EAAS,CACnB,IAAIzgF,EAAQ0D,EAAO0U,eAAe,GAC9BmK,EAAQviB,EAAM+xC,WAAWzc,GAAUvU,OAAOuU,GAC9CA,EAAW/S,EAAMxB,OAAO/gB,EAAMkwC,cAAc3tB,GAAOwvB,WAAWx7B,EAAiB+zB,SAASnzB,OAAO,IAEjG,OAAOme,EA4CT,SAASorD,GAAc5lE,EAAOD,GAE5B,IADA,IAAIte,EAAS,GAAI0hD,EAAWnsC,KAAK8Q,IAAI9H,EAAMnC,MAAOkC,EAAIlC,OAC7CD,EAAIulC,EAAUvlC,GAAK,EAAGA,IAAK,CAClC,IAAI6J,EAAQzH,EAAMyH,MAAM7J,GACxB,GAAI6J,EAAQzH,EAAMvD,KAAOuD,EAAMnC,MAAQD,IACnCmC,EAAIrZ,IAAIkX,GAAKmC,EAAItD,KAAOsD,EAAIlC,MAAQD,IACpCoC,EAAMne,KAAK+b,GAAGpe,KAAK2d,KAAKsB,WACxBsB,EAAIle,KAAK+b,GAAGpe,KAAK2d,KAAKsB,UAAa,MACnCgJ,GAAS1H,EAAI0H,MAAM7J,IAAMnc,EAAOsB,KAAK6a,GAE3C,OAAOnc,EAzSTojF,EAAS9wE,UAAUyvE,WAAa,SAAqBhpD,EAAUO,EAAWC,EAASwnD,EAAM55E,GACvF,GAAImyB,EAAY,EAAG,CACjB,IAAItE,EAAQ+D,EAASnqB,WACjB2+B,EAAQ/tC,KAAKuiF,WAAW/sD,EAAMta,QAASnF,KAAK0Q,IAAI,EAAGqT,EAAY,GACvCC,GAAkC,GAAvBR,EAASzc,WAAkBid,EAAU,EAAI,EACpDwnD,EAAM/rD,GAC9BuY,EAAM7yB,SAAWsa,EAAMta,UACrB6yB,EAAM7yB,QAAQysB,MAChBpO,EAAWA,EAAS6V,aAAa,EAAG5Z,EAAMnD,KAAK0b,EAAM7yB,UACrD4e,EAAYiU,EAAMjU,UAAY,IAEH,GAAvBP,EAASzc,aAAmBid,EAAU,GAC1CR,EAAWA,EAAS4V,WAAW,GAC/BrV,EAAY,IAIlB,IAAIt5B,EAASR,KAAK4kF,aAAarrD,EAAUO,EAAWC,EAASwnD,EAAM55E,GACnE,GAAI45E,EAAO,GAAK/gF,EAAOmnC,MAAqB,GAAb7N,EAAgB,CAC7C,IAAIt3B,EAAQhC,EAAO0a,QAAQ9L,WAAYy1E,EAAsC,GAA7BrkF,EAAO0a,QAAQ4B,WAC/D9c,KAAK4kF,aAAapiF,EAAM0Y,QAAS,EAAG6e,GAAW8qD,EAAS9qD,EAAU,EAAI,EAAGwnD,EAAM/+E,GAC/EhC,EAASqkF,EAASrqE,EAAiB+zB,SAASnzB,MAAQ,IAAIZ,EAAiBW,MAAM3a,EAAO0a,QAAQi0B,WAAW,GAAI,EAAGpV,GAElH,OAAOv5B,GAGTojF,EAAS9wE,UAAU8xE,aAAe,SAAuBrrD,EAAUO,EAAWC,EAASwnD,EAAM55E,GAK3F,IAJE,IAAI4Y,EAASvgB,KAEXoK,EAAI,EAEDA,EAAImvB,EAASzc,WAAY1S,IAAK,CAGnC,IAFA,IAAI5H,EAAQ+2B,EAAS/2B,MAAM4H,GAAI4lC,GAAS,EAAO1oB,EAAOld,GAAKmvB,EAASzc,WAAa,EAExEH,EAAI3c,KAAK4P,KAAKhO,OAAS,EAAG+a,GAAK,EAAGA,IAAK,CAC9C,IAAI/M,EAAO2Q,EAAO3Q,KAAK+M,GAAI8hC,OAAO,EAKlC,GAAI8iC,EAAO,IAAM9iC,EAAO7uC,EAAK3L,MAAMsyC,aAAa/zC,EAAMjE,UAChDoJ,IAAU82C,EAAK78C,QAAU68C,EAAKA,EAAK78C,OAAS,IAAM+F,EAAOpJ,MAAO,CACpE,MAAOyB,KAAK4P,KAAKhO,OAAS,EAAI+a,EAAK4D,EAAOve,YAC1C,IAAK,IAAI8iF,EAAI,EAAGA,EAAIrmC,EAAK78C,OAAQkjF,IAC/Bl1E,EAAK3L,MAAQ2L,EAAK3L,MAAMywC,UAAU+J,EAAKqmC,IACvCnoE,IACA/M,EAAO,CAACjI,OAAQ82C,EAAKqmC,GAAG1nF,SAChB6G,MAAOw6C,EAAKqmC,GAAG5wC,aACfh5B,QAASV,EAAiB+zB,SAASnzB,MAAOujD,SAAS,EAAM5kC,QAAS,EAAGnd,MAAOD,EAAImoE,GACxFvkE,EAAO3Q,KAAK9N,KAAK8N,GAKrB,IAAI3L,EAAQ2L,EAAK3L,MAAMywC,UAAUlyC,EAAMjE,MACvC,IAAK0F,EAAO,CACV,IAAIu6C,EAAO5uC,EAAK3L,MAAM+xC,WAAWx7B,EAAiB+zB,SAAS1oB,KAAKrjB,IAChE,IAAIg8C,EAMG,IAAI72C,GAAUiI,EAAK3L,MAAMywC,UAAU/sC,EAAOpJ,MAG/C,MAEA,SAVA,IAAK,IAAIuvC,EAAI,EAAGA,EAAI0Q,EAAK1hC,WAAYgxB,IAAK,CACxC,IAAIi3C,EAAKvmC,EAAKh8C,MAAMsrC,GACpBvtB,EAAOqxB,QAAQhiC,EAAMm1E,EAAI,GACzB9gF,EAAQ2L,EAAK3L,MAAMkwC,cAAc4wC,IAavC,MAAO/kF,KAAK4P,KAAKhO,OAAS,EAAI+a,EAAK4D,EAAOve,YAE1CQ,EAAQA,EAAM20B,KAAKvnB,EAAKjI,OAAOpJ,KAAKo7C,aAAan3C,EAAMy0B,QACnD6C,IACFt3B,EAAQ6hF,EAAe7hF,EAAOs3B,EAAWxS,EAAOyS,EAAU,GAC1DD,EAAY,GAGdvZ,EAAOqxB,QAAQhiC,EAAMpN,EAAO8kB,EAAOyS,EAAU,GAC7CnqB,EAAK3L,MAAQA,EACTqjB,IAAQyS,EAAU,GACtBiW,GAAS,EACT,MAIF,IAAKA,EAAU,MAUjB,OALIhwC,KAAK4P,KAAKhO,OAAS,IAClBwI,EAAI,GAAKA,GAAKmvB,EAASzc,YACvBnV,GAAU3H,KAAK4P,KAAK5P,KAAK4P,KAAKhO,OAAS,GAAG+F,OAAOpJ,MAAQoJ,EAAOpJ,OACjEyB,KAAKgC,YAEF,IAAIwY,EAAiBW,MAAMoe,EAAS4V,WAAW/kC,GAAI0vB,EAAWC,IAGvE6pD,EAAS9wE,UAAU8+B,QAAU,SAAkBhiC,EAAMhP,EAAMm5B,GACzDnqB,EAAKsL,QAAUqpE,EAAiB30E,EAAKsL,QAAStL,EAAKmqB,SAASuV,SAAS1uC,GACrEgP,EAAKmqB,QAAUA,GAGjB6pD,EAAS9wE,UAAU9Q,UAAY,WAC7B,IAAI4N,EAAO5P,KAAK4P,KAAK7N,MACI,GAArB6N,EAAKsL,QAAQysB,OAEN/3B,EAAK+uD,QACd3+D,KAAK4xC,QAAQ5xC,KAAK4P,KAAK5P,KAAK4P,KAAKhO,OAAS,GAAIgO,EAAKjI,OAAO0qB,KAAKziB,EAAKsL,SAAUtL,EAAKmqB,QAAU,GAE7F/5B,KAAKgwC,OAAOpgC,EAAKgN,OAAS,CAACA,MAAOhN,EAAKgN,MAAO1B,QAAStL,EAAKsL,QAAS6e,QAASnqB,EAAKmqB,WA4CvF2sB,EAAU5zC,UAAU6wC,aAAe,SAAS99B,EAAMC,EAAIhb,GACpD,IAAIyV,EAASvgB,KAEb,IAAK8K,EAAM68B,KAAQ,OAAO3nC,KAAK8jD,YAAYj+B,EAAMC,GAEjD,IAAI/G,EAAQ/e,KAAK4a,IAAIE,QAAQ+K,GAAO/G,EAAM9e,KAAK4a,IAAIE,QAAQgL,GAC3D,GAAIw8D,EAAcvjE,EAAOD,EAAKhU,GAC1B,OAAO9K,KAAK4kB,KAAK,IAAIqgC,EAAYp/B,EAAMC,EAAIhb,IAE/C,IAAIk6E,EAAeL,GAAc5lE,EAAO/e,KAAK4a,IAAIE,QAAQgL,IAEZ,GAAzCk/D,EAAaA,EAAapjF,OAAS,IAAWojF,EAAajjF,MAG/D,IAAIkjF,IAAoBlmE,EAAMnC,MAAQ,GACtCooE,EAAa/vE,QAAQgwE,GAKrB,IAAK,IAAItoE,EAAIoC,EAAMnC,MAAOpB,EAAMuD,EAAMvD,IAAM,EAAGmB,EAAI,EAAGA,IAAKnB,IAAO,CAChE,IAAIU,EAAO6C,EAAMne,KAAK+b,GAAGpe,KAAK2d,KAC9B,GAAIA,EAAKivB,UAAYjvB,EAAKsB,UAAa,MACnCwnE,EAAansD,QAAQlc,IAAM,EAAKsoE,EAAkBtoE,EAC7CoC,EAAMvX,OAAOmV,IAAMnB,GAAOwpE,EAAaz6E,OAAO,EAAG,GAAIoS,GAOhE,IAHA,IAAIuoE,EAAuBF,EAAansD,QAAQosD,GAE5CE,EAAY,GAAIC,EAAiBt6E,EAAMgvB,UAClC5e,EAAUpQ,EAAMoQ,QAAS9Q,EAAI,GAAIA,IAAK,CAC7C,IAAIxJ,EAAOsa,EAAQ9L,WAEnB,GADA+1E,EAAUrjF,KAAKlB,GACXwJ,GAAKU,EAAMgvB,UAAa,MAC5B5e,EAAUta,EAAKsa,QAIbkqE,EAAiB,GAAKD,EAAUC,EAAiB,GAAG7mF,KAAK2d,KAAKivB,UAC9DpsB,EAAMne,KAAKskF,GAAsB3mF,MAAQ4mF,EAAUC,EAAiB,GAAG7mF,KACvE6mF,GAAkB,EACbA,GAAkB,GAAKD,EAAUC,EAAiB,GAAGtpE,aAAeqpE,EAAUC,EAAiB,GAAG7mF,KAAK2d,KAAKivB,UAC5GpsB,EAAMne,KAAKskF,GAAsB3mF,MAAQ4mF,EAAUC,EAAiB,GAAG7mF,OAC5E6mF,GAAkB,GAEtB,IAAK,IAAIt3C,EAAIhjC,EAAMgvB,UAAWgU,GAAK,EAAGA,IAAK,CACzC,IAAIu3C,GAAav3C,EAAIs3C,EAAiB,IAAMt6E,EAAMgvB,UAAY,GAC1DiX,EAASo0C,EAAUE,GACvB,GAAKt0C,EACL,IAAK,IAAIzmB,EAAM,EAAGA,EAAM06D,EAAapjF,OAAQ0oB,IAAO,CAGlD,IAAIg7D,EAAcN,GAAc16D,EAAM46D,GAAwBF,EAAapjF,QAASg2E,GAAS,EACzF0N,EAAc,IAAK1N,GAAS,EAAO0N,GAAeA,GACtD,IAAI39E,EAASoX,EAAMne,KAAK0kF,EAAc,GAAIphF,EAAQ6a,EAAM7a,MAAMohF,EAAc,GAC5E,GAAI39E,EAAO8sC,eAAevwC,EAAOA,EAAO6sC,EAAOxyC,KAAMwyC,EAAO9Z,OACxD,OAAO1W,EAAOngB,QAAQ2e,EAAMvX,OAAO89E,GAAc1N,EAAS94D,EAAIrB,MAAM6nE,GAAex/D,EACjE,IAAItL,EAAiBW,MAAMqpE,GAAc15E,EAAMoQ,QAAS,EAAGpQ,EAAMgvB,UAAWurD,GAClEA,EAAWv6E,EAAMivB,WAKrD,IADA,IAAIwrD,EAAavlF,KAAKslB,MAAM1jB,OACnB2oB,EAAMy6D,EAAapjF,OAAS,EAAG2oB,GAAO,EAAGA,IAAO,CAEvD,GADAhK,EAAOngB,QAAQylB,EAAMC,EAAIhb,GACrByV,EAAO+E,MAAM1jB,OAAS2jF,EAAc,MACxC,IAAI3oE,EAAQooE,EAAaz6D,GACrBA,EAAM,IACV1E,EAAO9G,EAAMvX,OAAOoV,GAAQkJ,EAAKhH,EAAIrB,MAAMb,IAE7C,OAAO5c,MAwBT0mD,EAAU5zC,UAAUixC,iBAAmB,SAASl+B,EAAMC,EAAIllB,GACxD,IAAKA,EAAKmyC,UAAYltB,GAAQC,GAAM9lB,KAAK4a,IAAIE,QAAQ+K,GAAMle,OAAOuT,QAAQysB,KAAM,CAC9E,IAAI69C,EAAQnE,EAAYrhF,KAAK4a,IAAKiL,EAAMjlB,EAAKrC,MAChC,MAATinF,IAAiB3/D,EAAOC,EAAK0/D,GAEnC,OAAOxlF,KAAK2jD,aAAa99B,EAAMC,EAAI,IAAItL,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAKjlB,GAAO,EAAG,KAMzG8lD,EAAU5zC,UAAUgxC,YAAc,SAASj+B,EAAMC,GAK/C,IAJA,IAAIvF,EAASvgB,KAET+e,EAAQ/e,KAAK4a,IAAIE,QAAQ+K,GAAO/G,EAAM9e,KAAK4a,IAAIE,QAAQgL,GACvD2/D,EAAUd,GAAc5lE,EAAOD,GAC1B1U,EAAI,EAAGA,EAAIq7E,EAAQ7jF,OAAQwI,IAAK,CACvC,IAAIwS,EAAQ6oE,EAAQr7E,GAAIkd,EAAOld,GAAKq7E,EAAQ7jF,OAAS,EACrD,GAAK0lB,GAAiB,GAAT1K,GAAemC,EAAMne,KAAKgc,GAAOre,KAAK21C,aAAaK,SAC5D,OAAOh0B,EAAOxhB,OAAOggB,EAAMyH,MAAM5J,GAAQkC,EAAIrZ,IAAImX,IACrD,GAAIA,EAAQ,IAAM0K,GAAQvI,EAAMne,KAAKgc,EAAQ,GAAGo0B,WAAWjyB,EAAM7a,MAAM0Y,EAAQ,GAAIkC,EAAIjC,WAAWD,EAAQ,KACtG,OAAO2D,EAAOxhB,OAAOggB,EAAMvX,OAAOoV,GAAQkC,EAAIrB,MAAMb,IAE1D,IAAK,IAAID,EAAI,EAAGA,GAAKoC,EAAMnC,MAAOD,IAChC,GAAIkJ,EAAO9G,EAAMyH,MAAM7J,IAAMoC,EAAMnC,MAAQD,GAAKmJ,EAAK/G,EAAMtZ,IAAIkX,GAC3D,OAAO4D,EAAOxhB,OAAOggB,EAAMvX,OAAOmV,GAAImJ,GAE5C,OAAO9lB,KAAKjB,OAAO8mB,EAAMC,IAmB3BhoB,EAAQ4oD,UAAYA,EACpB5oD,EAAQ0gF,eAAiBA,EACzB1gF,EAAQuhF,KAAOA,EACfvhF,EAAQ6hF,WAAaA,EACrB7hF,EAAQsjF,UAAYA,EACpBtjF,EAAQ4wE,QAAUA,EAClB5wE,EAAQiyE,SAAWA,EACnBjyE,EAAQujF,YAAcA,EACtBvjF,EAAQolB,UAAYA,EACpBplB,EAAQ2yE,WAAaA,EACrB3yE,EAAQy4C,aAAeA,EACvBz4C,EAAQ+/E,QAAUA,EAClB//E,EAAQ6/E,UAAYA,EACpB7/E,EAAQioB,QAAUA,EAClBjoB,EAAQokF,YAAcA,EACtBpkF,EAAQskF,eAAiBA,EACzBtkF,EAAQmnD,YAAcA,EACtBnnD,EAAQonD,kBAAoBA,EAC5BpnD,EAAQukF,YAAcA,G,mBCzsDtB,IAAIqD,EAAiB,IAKjBjiE,EAAe,aAEnBA,EAAa3Q,UAAUkS,OAAS,SAAiB1J,GAC/C,OAAKA,EAAM1Z,QACX0Z,EAAQmI,EAAaoC,KAAKvK,IAEjBtb,KAAK4B,QAAU0Z,GACrBA,EAAM1Z,OAAS8jF,GAAkB1lF,KAAK2lF,WAAWrqE,IACjDtb,KAAK4B,OAAS8jF,GAAkBpqE,EAAMsqE,YAAY5lF,OACnDA,KAAK6lF,YAAYvqE,IANStb,MAW9ByjB,EAAa3Q,UAAUgzE,QAAU,SAAkBxqE,GACjD,OAAKA,EAAM1Z,OACJ6hB,EAAaoC,KAAKvK,GAAO0J,OAAOhlB,MADXA,MAI9ByjB,EAAa3Q,UAAU+yE,YAAc,SAAsBvqE,GACzD,OAAO,IAAIyqE,EAAO/lF,KAAMsb,IAK1BmI,EAAa3Q,UAAUhI,MAAQ,SAAgB+a,EAAMC,GAInD,YAHgB,IAATD,IAAkBA,EAAO,QAClB,IAAPC,IAAgBA,EAAK9lB,KAAK4B,QAE7BikB,GAAQC,EAAarC,EAAarI,MAC/Bpb,KAAKgmF,WAAWjwE,KAAK0Q,IAAI,EAAGZ,GAAO9P,KAAK8Q,IAAI7mB,KAAK4B,OAAQkkB,KAKlErC,EAAa3Q,UAAUuR,IAAM,SAAcja,GACzC,KAAIA,EAAI,GAAKA,GAAKpK,KAAK4B,QACvB,OAAO5B,KAAKimF,SAAS77E,IAQvBqZ,EAAa3Q,UAAUxT,QAAU,SAAkBmvC,EAAG5oB,EAAMC,QAC1C,IAATD,IAAkBA,EAAO,QAClB,IAAPC,IAAgBA,EAAK9lB,KAAK4B,QAE7BikB,GAAQC,EACR9lB,KAAKkmF,aAAaz3C,EAAG5oB,EAAMC,EAAI,GAE/B9lB,KAAKmmF,qBAAqB13C,EAAG5oB,EAAMC,EAAI,IAM7CrC,EAAa3Q,UAAUrP,IAAM,SAAcgrC,EAAG5oB,EAAMC,QAClC,IAATD,IAAkBA,EAAO,QAClB,IAAPC,IAAgBA,EAAK9lB,KAAK4B,QAEjC,IAAIpB,EAAS,GAEb,OADAR,KAAKV,SAAQ,SAAUytD,EAAK3iD,GAAK,OAAO5J,EAAOsB,KAAK2sC,EAAEse,EAAK3iD,MAAQyb,EAAMC,GAClEtlB,GAMTijB,EAAaoC,KAAO,SAAeugE,GACjC,OAAIA,aAAkB3iE,EAAuB2iE,EACtCA,GAAUA,EAAOxkF,OAAS,IAAIykF,EAAKD,GAAU3iE,EAAarI,OAGnE,IAAIirE,EAAQ,SAAU5iE,GACpB,SAAS4iE,EAAKD,GACZ3iE,EAAa1T,KAAK/P,MAClBA,KAAKomF,OAASA,EAGX3iE,IAAe4iE,EAAKh/E,UAAYoc,GACrC4iE,EAAKvzE,UAAY3T,OAAO/B,OAAQqmB,GAAgBA,EAAa3Q,WAC7DuzE,EAAKvzE,UAAU1Q,YAAcikF,EAE7B,IAAIzyC,EAAqB,CAAEhyC,OAAQ,GAAGgb,MAAO,IA6C7C,OA3CAypE,EAAKvzE,UAAUujE,QAAU,WACvB,OAAOr2E,KAAKomF,QAGdC,EAAKvzE,UAAUkzE,WAAa,SAAqBngE,EAAMC,GACrD,OAAY,GAARD,GAAaC,GAAM9lB,KAAK4B,OAAiB5B,KACtC,IAAIqmF,EAAKrmF,KAAKomF,OAAOt7E,MAAM+a,EAAMC,KAG1CugE,EAAKvzE,UAAUmzE,SAAW,SAAmB77E,GAC3C,OAAOpK,KAAKomF,OAAOh8E,IAGrBi8E,EAAKvzE,UAAUozE,aAAe,SAAuBz3C,EAAG5oB,EAAMC,EAAIU,GAGhE,IAFA,IAAIjG,EAASvgB,KAEJoK,EAAIyb,EAAMzb,EAAI0b,EAAI1b,IACvB,IAAuC,IAAnCqkC,EAAEluB,EAAO6lE,OAAOh8E,GAAIoc,EAAQpc,GAAgB,OAAO,GAG7Di8E,EAAKvzE,UAAUqzE,qBAAuB,SAA+B13C,EAAG5oB,EAAMC,EAAIU,GAGhF,IAFA,IAAIjG,EAASvgB,KAEJoK,EAAIyb,EAAO,EAAGzb,GAAK0b,EAAI1b,IAC5B,IAAuC,IAAnCqkC,EAAEluB,EAAO6lE,OAAOh8E,GAAIoc,EAAQpc,GAAgB,OAAO,GAG7Di8E,EAAKvzE,UAAU6yE,WAAa,SAAqBrqE,GAC/C,GAAItb,KAAK4B,OAAS0Z,EAAM1Z,QAAU8jF,EAC9B,OAAO,IAAIW,EAAKrmF,KAAKomF,OAAO9iF,OAAOgY,EAAM+6D,aAG/CgQ,EAAKvzE,UAAU8yE,YAAc,SAAsBtqE,GACjD,GAAItb,KAAK4B,OAAS0Z,EAAM1Z,QAAU8jF,EAC9B,OAAO,IAAIW,EAAK/qE,EAAM+6D,UAAU/yE,OAAOtD,KAAKomF,UAGlDxyC,EAAmBhyC,OAAOyiB,IAAM,WAAc,OAAOrkB,KAAKomF,OAAOxkF,QAEjEgyC,EAAmBh3B,MAAMyH,IAAM,WAAc,OAAO,GAEpDllB,OAAOo9B,iBAAkB8pD,EAAKvzE,UAAW8gC,GAElCyyC,EAvDE,CAwDT5iE,GAIFA,EAAarI,MAAQ,IAAIirE,EAAK,IAE9B,IAAIN,EAAU,SAAUtiE,GACtB,SAASsiE,EAAOtmE,EAAMsC,GACpB0B,EAAa1T,KAAK/P,MAClBA,KAAKyf,KAAOA,EACZzf,KAAK+hB,MAAQA,EACb/hB,KAAK4B,OAAS6d,EAAK7d,OAASmgB,EAAMngB,OAClC5B,KAAK4c,MAAQ7G,KAAK0Q,IAAIhH,EAAK7C,MAAOmF,EAAMnF,OAAS,EA2DnD,OAxDK6G,IAAesiE,EAAO1+E,UAAYoc,GACvCsiE,EAAOjzE,UAAY3T,OAAO/B,OAAQqmB,GAAgBA,EAAa3Q,WAC/DizE,EAAOjzE,UAAU1Q,YAAc2jF,EAE/BA,EAAOjzE,UAAUujE,QAAU,WACzB,OAAOr2E,KAAKyf,KAAK42D,UAAU/yE,OAAOtD,KAAK+hB,MAAMs0D,YAG/C0P,EAAOjzE,UAAUmzE,SAAW,SAAmB77E,GAC7C,OAAOA,EAAIpK,KAAKyf,KAAK7d,OAAS5B,KAAKyf,KAAK4E,IAAIja,GAAKpK,KAAK+hB,MAAMsC,IAAIja,EAAIpK,KAAKyf,KAAK7d,SAGhFmkF,EAAOjzE,UAAUozE,aAAe,SAAuBz3C,EAAG5oB,EAAMC,EAAIU,GAClE,IAAI8/D,EAAUtmF,KAAKyf,KAAK7d,OACxB,QAAIikB,EAAOygE,IAC2D,IAAlEtmF,KAAKyf,KAAKymE,aAAaz3C,EAAG5oB,EAAM9P,KAAK8Q,IAAIf,EAAIwgE,GAAU9/D,QAEvDV,EAAKwgE,IAC6G,IAAlHtmF,KAAK+hB,MAAMmkE,aAAaz3C,EAAG14B,KAAK0Q,IAAIZ,EAAOygE,EAAS,GAAIvwE,KAAK8Q,IAAI7mB,KAAK4B,OAAQkkB,GAAMwgE,EAAS9/D,EAAQ8/D,UADzG,IAKFP,EAAOjzE,UAAUqzE,qBAAuB,SAA+B13C,EAAG5oB,EAAMC,EAAIU,GAClF,IAAI8/D,EAAUtmF,KAAKyf,KAAK7d,OACxB,QAAIikB,EAAOygE,IACkG,IAAzGtmF,KAAK+hB,MAAMokE,qBAAqB13C,EAAG5oB,EAAOygE,EAASvwE,KAAK0Q,IAAIX,EAAIwgE,GAAWA,EAAS9/D,EAAQ8/D,QAE5FxgE,EAAKwgE,IACqE,IAA1EtmF,KAAKyf,KAAK0mE,qBAAqB13C,EAAG14B,KAAK8Q,IAAIhB,EAAMygE,GAAUxgE,EAAIU,UADnE,IAKFu/D,EAAOjzE,UAAUkzE,WAAa,SAAqBngE,EAAMC,GACvD,GAAY,GAARD,GAAaC,GAAM9lB,KAAK4B,OAAU,OAAO5B,KAC7C,IAAIsmF,EAAUtmF,KAAKyf,KAAK7d,OACxB,OAAIkkB,GAAMwgE,EAAkBtmF,KAAKyf,KAAK3U,MAAM+a,EAAMC,GAC9CD,GAAQygE,EAAkBtmF,KAAK+hB,MAAMjX,MAAM+a,EAAOygE,EAASxgE,EAAKwgE,GAC7DtmF,KAAKyf,KAAK3U,MAAM+a,EAAMygE,GAASthE,OAAOhlB,KAAK+hB,MAAMjX,MAAM,EAAGgb,EAAKwgE,KAGxEP,EAAOjzE,UAAU6yE,WAAa,SAAqBrqE,GACjD,IAAIyyB,EAAQ/tC,KAAK+hB,MAAM4jE,WAAWrqE,GAClC,GAAIyyB,EAAS,OAAO,IAAIg4C,EAAO/lF,KAAKyf,KAAMsuB,IAG5Cg4C,EAAOjzE,UAAU8yE,YAAc,SAAsBtqE,GACnD,IAAIyyB,EAAQ/tC,KAAKyf,KAAKmmE,YAAYtqE,GAClC,GAAIyyB,EAAS,OAAO,IAAIg4C,EAAOh4C,EAAO/tC,KAAK+hB,QAG7CgkE,EAAOjzE,UAAU+yE,YAAc,SAAsBvqE,GACnD,OAAItb,KAAKyf,KAAK7C,OAAS7G,KAAK0Q,IAAIzmB,KAAK+hB,MAAMnF,MAAOtB,EAAMsB,OAAS,EACtD,IAAImpE,EAAO/lF,KAAKyf,KAAM,IAAIsmE,EAAO/lF,KAAK+hB,MAAOzG,IACjD,IAAIyqE,EAAO/lF,KAAMsb,IAGnByqE,EAjEI,CAkEXtiE,GAEF5lB,EAAOC,QAAU2lB,G,oBChNjB,SAASgqB,EAAWvyB,GAClBlb,KAAKkb,QAAUA,EAGjBuyB,EAAW36B,UAAY,CACrB1Q,YAAaqrC,EAEbt7B,KAAM,SAAS1R,GACb,IAAK,IAAI2J,EAAI,EAAGA,EAAIpK,KAAKkb,QAAQtZ,OAAQwI,GAAK,EAC5C,GAAIpK,KAAKkb,QAAQ9Q,KAAO3J,EAAK,OAAO2J,EACtC,OAAQ,GAMVia,IAAK,SAAS5jB,GACZ,IAAI8uC,EAAQvvC,KAAKmS,KAAK1R,GACtB,OAAiB,GAAV8uC,OAAczvC,EAAYE,KAAKkb,QAAQq0B,EAAQ,IAOxDruB,OAAQ,SAASzgB,EAAKN,EAAOomF,GAC3B,IAAIrpD,EAAOqpD,GAAUA,GAAU9lF,EAAMT,KAAK41D,OAAO2wB,GAAUvmF,KACvDuvC,EAAQrS,EAAK/qB,KAAK1R,GAAMya,EAAUgiB,EAAKhiB,QAAQpQ,QAOnD,OANc,GAAVykC,EACFr0B,EAAQpZ,KAAKykF,GAAU9lF,EAAKN,IAE5B+a,EAAQq0B,EAAQ,GAAKpvC,EACjBomF,IAAQrrE,EAAQq0B,GAASg3C,IAExB,IAAI94C,EAAWvyB,IAKxB06C,OAAQ,SAASn1D,GACf,IAAI8uC,EAAQvvC,KAAKmS,KAAK1R,GACtB,IAAc,GAAV8uC,EAAa,OAAOvvC,KACxB,IAAIkb,EAAUlb,KAAKkb,QAAQpQ,QAE3B,OADAoQ,EAAQ3Q,OAAOglC,EAAO,GACf,IAAI9B,EAAWvyB,IAKxBm0B,WAAY,SAAS5uC,EAAKN,GACxB,OAAO,IAAIstC,EAAW,CAAChtC,EAAKN,GAAOmD,OAAOtD,KAAK41D,OAAOn1D,GAAKya,WAK7Do0B,SAAU,SAAS7uC,EAAKN,GACtB,IAAI+a,EAAUlb,KAAK41D,OAAOn1D,GAAKya,QAAQpQ,QAEvC,OADAoQ,EAAQpZ,KAAKrB,EAAKN,GACX,IAAIstC,EAAWvyB,IAMxByJ,UAAW,SAASsmD,EAAOxqE,EAAKN,GAC9B,IAAIqmF,EAAUxmF,KAAK41D,OAAOn1D,GAAMya,EAAUsrE,EAAQtrE,QAAQpQ,QACtDykC,EAAQi3C,EAAQr0E,KAAK84D,GAEzB,OADA/vD,EAAQ3Q,QAAiB,GAAVglC,EAAcr0B,EAAQtZ,OAAS2tC,EAAO,EAAG9uC,EAAKN,GACtD,IAAIstC,EAAWvyB,IAMxB5b,QAAS,SAASmvC,GAChB,IAAK,IAAIrkC,EAAI,EAAGA,EAAIpK,KAAKkb,QAAQtZ,OAAQwI,GAAK,EAC5CqkC,EAAEzuC,KAAKkb,QAAQ9Q,GAAIpK,KAAKkb,QAAQ9Q,EAAI,KAMxC07E,QAAS,SAASriF,GAEhB,OADAA,EAAMgqC,EAAW5nB,KAAKpiB,GACjBA,EAAIkkC,KACF,IAAI8F,EAAWhqC,EAAIyX,QAAQ5X,OAAOtD,KAAKymF,SAAShjF,GAAKyX,UADtClb,MAOxBglB,OAAQ,SAASvhB,GAEf,OADAA,EAAMgqC,EAAW5nB,KAAKpiB,GACjBA,EAAIkkC,KACF,IAAI8F,EAAWztC,KAAKymF,SAAShjF,GAAKyX,QAAQ5X,OAAOG,EAAIyX,UADtClb,MAOxBymF,SAAU,SAAShjF,GACjB,IAAIjD,EAASR,KACbyD,EAAMgqC,EAAW5nB,KAAKpiB,GACtB,IAAK,IAAI2G,EAAI,EAAGA,EAAI3G,EAAIyX,QAAQtZ,OAAQwI,GAAK,EAC3C5J,EAASA,EAAOo1D,OAAOnyD,EAAIyX,QAAQ9Q,IACrC,OAAO5J,GAKT,WACE,OAAOR,KAAKkb,QAAQtZ,QAAU,IAQlC6rC,EAAW5nB,KAAO,SAAS1lB,GACzB,GAAIA,aAAiBstC,EAAY,OAAOttC,EACxC,IAAI+a,EAAU,GACd,GAAI/a,EAAO,IAAK,IAAIZ,KAAQY,EAAO+a,EAAQpZ,KAAKvC,EAAMY,EAAMZ,IAC5D,OAAO,IAAIkuC,EAAWvyB,IAGxBrd,EAAOC,QAAU2vC,G,kCC9HjBtuC,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAAIggB,EAAuB,EAAQ,QAC/B3F,EAAmB,EAAQ,QAC3BF,EAAmB,EAAQ,QAI/B,SAASksC,EAAgBhoC,EAAOC,GAC9B,OAAID,EAAMI,UAAUxD,QAChBqD,GAAYA,EAASD,EAAMW,GAAGqnC,kBAAkBl9B,mBAC7C,GAWT,SAASo9D,EAAaloE,EAAOC,EAAUC,GACrC,IAAIa,EAAMf,EAAMI,UACZ2lC,EAAUhlC,EAAIglC,QAClB,IAAKA,IAAY7lC,GAAQA,EAAKO,eAAe,WAAYT,GACjC+lC,EAAQhtB,aAAe,GAC3C,OAAO,EAEX,IAAIovD,EAAOC,EAAcriC,GAGzB,IAAKoiC,EAAM,CACT,IAAI1oF,EAAQsmD,EAAQ5pB,aAAc3X,EAAS/kB,GAASkiB,EAAqBswD,WAAWxyE,GACpF,OAAc,MAAV+kB,IACAvE,GAAYA,EAASD,EAAMW,GAAGqxD,KAAKvyE,EAAO+kB,GAAQsG,mBAC/C,GAGT,IAAI9hB,EAASm/E,EAAKnlE,WAElB,IAAKha,EAAOjJ,KAAK2d,KAAKsB,WAAaqpE,EAAcroE,EAAOmoE,EAAMloE,GAC1D,OAAO,EAIX,GAAmC,GAA/B8lC,EAAQ58C,OAAOuT,QAAQysB,OACtBm/C,EAAYt/E,EAAQ,QAAU8S,EAAiBuF,cAAcC,aAAatY,IAAU,CACvF,GAAIiX,EAAU,CACZ,IAAIU,EAAKX,EAAMW,GAAG2kC,YAAYS,EAAQ/8C,SAAU+8C,EAAQ9mC,SACxD0B,EAAGC,aAAa0nE,EAAYt/E,EAAQ,OAAS8S,EAAiB6C,UAAUZ,SAAS4C,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAIkjF,EAAKnrE,KAAM,KAAM,GAC9GlB,EAAiBuF,cAAcziB,OAAO+hB,EAAGvE,IAAK+rE,EAAKnrE,IAAMhU,EAAOoa,WAClFnD,EAASU,EAAGmK,kBAEd,OAAO,EAIT,SAAI9hB,EAAO+V,QAAUopE,EAAK/pE,OAAS2nC,EAAQ3nC,MAAQ,KAC7C6B,GAAYA,EAASD,EAAMW,GAAGpgB,OAAO4nF,EAAKnrE,IAAMhU,EAAOoa,SAAU+kE,EAAKnrE,KAAK8N,mBACxE,GAMX,SAASw9D,EAAYlmF,EAAMqpC,GACzB,KAAOrpC,EAAMA,EAAgB,SAARqpC,EAAkBrpC,EAAKwO,WAAaxO,EAAKqc,UAC1D,GAAIrc,EAAKkb,YAAe,OAAO,EACnC,OAAO,EAUT,SAASirE,EAAmBvoE,EAAOC,EAAUC,GAC3C,IAAIa,EAAMf,EAAMI,UACZ2lC,EAAUhlC,EAAIglC,QAClB,IAAKA,IAAY7lC,GAAQA,EAAKO,eAAe,WAAYT,GACjC+lC,EAAQhtB,aAAe,GAC3C,OAAO,EAEX,IAAIovD,EAAOC,EAAcriC,GAAU3jD,EAAO+lF,GAAQA,EAAKnlE,WACvD,SAAK5gB,IAAS0Z,EAAiBuF,cAAcC,aAAalf,MACtD6d,GACAA,EAASD,EAAMW,GAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAOohB,EAAM5D,IAAK+rE,EAAKnrE,IAAM5a,EAAKghB,WAAW0H,mBACxG,GAGT,SAASs9D,EAAcjsE,GACrB,IAAKA,EAAKhT,OAAOpJ,KAAK2d,KAAKsB,UAAa,IAAK,IAAIpT,EAAIuQ,EAAKiC,MAAQ,EAAGxS,GAAK,EAAGA,IAAK,CAChF,GAAIuQ,EAAKzW,MAAMkG,GAAK,EAAK,OAAOuQ,EAAKC,IAAIE,QAAQH,EAAKnT,OAAO4C,EAAI,IACjE,GAAIuQ,EAAK/Z,KAAKwJ,GAAG7L,KAAK2d,KAAKsB,UAAa,MAE1C,OAAO,KAST,SAASwpE,EAAYxoE,EAAOC,EAAUC,GACpC,IAAIa,EAAMf,EAAMI,UACZ2lC,EAAUhlC,EAAIglC,QAClB,IAAKA,IAAY7lC,GAAQA,EAAKO,eAAe,UAAWT,GAChC+lC,EAAQhtB,aAAegtB,EAAQ58C,OAAOuT,QAAQysB,MAClE,OAAO,EAEX,IAAIg/C,EAAOM,EAAa1iC,GAGxB,IAAKoiC,EAAQ,OAAO,EAEpB,IAAIlpE,EAAQkpE,EAAKllE,UAEjB,GAAIolE,EAAcroE,EAAOmoE,EAAMloE,GAAa,OAAO,EAInD,GAAmC,GAA/B8lC,EAAQ58C,OAAOuT,QAAQysB,OACtBm/C,EAAYrpE,EAAO,UAAYnD,EAAiBuF,cAAcC,aAAarC,IAAS,CACvF,GAAIgB,EAAU,CACZ,IAAIU,EAAKX,EAAMW,GAAG2kC,YAAYS,EAAQ/8C,SAAU+8C,EAAQ9mC,SACxD0B,EAAGC,aAAa0nE,EAAYrpE,EAAO,SAAWnD,EAAiB6C,UAAUZ,SAAS4C,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQpX,IAAIkjF,EAAKnrE,MAAO,GAC1GlB,EAAiBuF,cAAcziB,OAAO+hB,EAAGvE,IAAKuE,EAAGtE,QAAQpX,IAAIkjF,EAAKnrE,OACpFiD,EAASU,EAAGmK,kBAEd,OAAO,EAIT,SAAI7L,EAAMF,QAAUopE,EAAK/pE,OAAS2nC,EAAQ3nC,MAAQ,KAC5C6B,GAAYA,EAASD,EAAMW,GAAGpgB,OAAO4nF,EAAKnrE,IAAKmrE,EAAKnrE,IAAMiC,EAAMmE,UAAU0H,mBACvE,GAaX,SAAS49D,EAAkB1oE,EAAOC,EAAUC,GAC1C,IAAIa,EAAMf,EAAMI,UACZ2lC,EAAUhlC,EAAIglC,QAClB,IAAKA,IAAY7lC,GAAQA,EAAKO,eAAe,UAAWT,GAChC+lC,EAAQhtB,aAAegtB,EAAQ58C,OAAOuT,QAAQysB,MAClE,OAAO,EAEX,IAAIg/C,EAAOM,EAAa1iC,GAAU3jD,EAAO+lF,GAAQA,EAAKllE,UACtD,SAAK7gB,IAAS0Z,EAAiBuF,cAAcC,aAAalf,MACtD6d,GACAA,EAASD,EAAMW,GAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAOohB,EAAM5D,IAAK+rE,EAAKnrE,MAAM8N,mBACxF,GAGT,SAAS29D,EAAatsE,GACpB,IAAKA,EAAKhT,OAAOpJ,KAAK2d,KAAKsB,UAAa,IAAK,IAAIpT,EAAIuQ,EAAKiC,MAAQ,EAAGxS,GAAK,EAAGA,IAAK,CAChF,IAAIzC,EAASgT,EAAK/Z,KAAKwJ,GACvB,GAAIuQ,EAAKzW,MAAMkG,GAAK,EAAIzC,EAAOmV,WAAc,OAAOnC,EAAKC,IAAIE,QAAQH,EAAK8C,MAAMrT,EAAI,IACpF,GAAIzC,EAAOpJ,KAAK2d,KAAKsB,UAAa,MAEpC,OAAO,KAOT,SAAS2pE,EAAO3oE,EAAOC,GACrB,IAAoF+mE,EAAhF7mE,EAAMH,EAAMI,UAAWwoE,EAAUzoE,aAAerE,EAAiBuF,cACrE,GAAIunE,EAAS,CACX,GAAIzoE,EAAI/d,KAAKkb,cAAgBqE,EAAqBuuD,QAAQlwD,EAAM5D,IAAK+D,EAAIkH,MAAS,OAAO,EACzF2/D,EAAQ7mE,EAAIkH,UAGZ,GADA2/D,EAAQrlE,EAAqBihE,UAAU5iE,EAAM5D,IAAK+D,EAAIkH,MAAO,GAChD,MAAT2/D,EAAiB,OAAO,EAE9B,GAAI/mE,EAAU,CACZ,IAAIU,EAAKX,EAAMW,GAAGxc,KAAK6iF,GACnB4B,GAAWjoE,EAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAO+hB,EAAGvE,IAAK4qE,EAAQhnE,EAAM5D,IAAIE,QAAQ0qE,GAAOhkE,WAAWI,WACzHnD,EAASU,EAAGmK,kBAEd,OAAO,EAMT,SAAS+9D,EAAS7oE,EAAOC,GACvB,IAA2B+mE,EAAvB7mE,EAAMH,EAAMI,UAChB,GAAID,aAAerE,EAAiBuF,cAAe,CACjD,GAAIlB,EAAI/d,KAAKkb,cAAgBqE,EAAqBuuD,QAAQlwD,EAAM5D,IAAK+D,EAAImH,IAAO,OAAO,EACvF0/D,EAAQ7mE,EAAImH,QAGZ,GADA0/D,EAAQrlE,EAAqBihE,UAAU5iE,EAAM5D,IAAK+D,EAAImH,GAAI,GAC7C,MAAT0/D,EAAiB,OAAO,EAI9B,OAFI/mE,GACAA,EAASD,EAAMW,GAAGxc,KAAK6iF,GAAOl8D,mBAC3B,EAMT,SAASknD,EAAKhyD,EAAOC,GACnB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACV7gB,EAAQ8gB,EAAM4b,WAAW7b,GAAMkE,EAAS/kB,GAASkiB,EAAqBswD,WAAWxyE,GACrF,OAAc,MAAV+kB,IACAvE,GAAYA,EAASD,EAAMW,GAAGqxD,KAAKvyE,EAAO+kB,GAAQsG,mBAC/C,GAOT,SAASg+D,EAAc9oE,EAAOC,GAC5B,IAAIc,EAAMf,EAAMI,UACZX,EAAQsB,EAAItB,MACZD,EAAUuB,EAAIvB,QAClB,SAAKC,EAAMtW,OAAOpJ,KAAK2d,KAAKpO,OAASmQ,EAAMk1B,WAAWn1B,MAClDS,GAAYA,EAASD,EAAMW,GAAGsnC,WAAW,MAAMn9B,mBAC5C,GAOT,SAASi+D,EAAS/oE,EAAOC,GACvB,IAAIc,EAAMf,EAAMI,UACZX,EAAQsB,EAAItB,MACZD,EAAUuB,EAAIvB,QAClB,IAAKC,EAAMtW,OAAOpJ,KAAK2d,KAAKpO,OAASmQ,EAAMk1B,WAAWn1B,GAAY,OAAO,EACzE,IAAIwpE,EAAQvpE,EAAMrd,MAAM,GAAI6c,EAAQQ,EAAMpB,YAAY,GAAIte,EAAOipF,EAAMnrE,eAAeoB,GAAOnB,YAC7F,IAAKkrE,EAAM/yC,eAAeh3B,EAAOA,EAAOlf,GAAS,OAAO,EACxD,GAAIkgB,EAAU,CACZ,IAAIjD,EAAMyC,EAAMR,QAAS0B,EAAKX,EAAMW,GAAG0kC,YAAYroC,EAAKA,EAAKjd,EAAK+3C,iBAClEn3B,EAAGC,aAAa9E,EAAiB6C,UAAUlC,KAAKkE,EAAGvE,IAAIE,QAAQU,GAAM,IACrEiD,EAASU,EAAGmK,kBAEd,OAAO,EAMT,SAASm+D,EAAoBjpE,EAAOC,GAClC,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACd,GAAIC,EAAMpX,OAAO2V,eAAiBwB,EAAInX,OAAO2V,cAAiB,OAAO,EACrE,IAAI/e,EAAOwgB,EAAMpX,OAAO0U,eAAeyC,EAAIjC,cAAcP,YACzD,IAAK/d,IAASA,EAAKud,YAAe,OAAO,EACzC,GAAI2C,EAAU,CACZ,IAAIwrB,IAASlrB,EAAMwY,cAAgBzY,EAAI5a,QAAU4a,EAAInX,OAAOmV,WAAaiC,EAAQD,GAAKtD,IAClF2D,EAAKX,EAAMW,GAAG4xB,OAAO9G,EAAM1rC,EAAK+3C,iBACpCn3B,EAAGC,aAAa9E,EAAiB0E,cAAc5hB,OAAO+hB,EAAGvE,IAAKqvB,EAAO,IACrExrB,EAASU,EAAGmK,kBAEd,OAAO,EAMT,SAASo+D,EAAelpE,EAAOC,GAC7B,IAAIc,EAAMf,EAAMI,UACZ2lC,EAAUhlC,EAAIglC,QAClB,IAAKA,GAAWA,EAAQ58C,OAAOuT,QAAQysB,KAAQ,OAAO,EACtD,GAAI4c,EAAQ3nC,MAAQ,GAAK2nC,EAAQ9mC,SAAW8mC,EAAQ9+C,KAAK,GAAI,CAC3D,IAAI+B,EAAS+8C,EAAQ/8C,SACrB,GAAI2Y,EAAqB4vD,SAASvxD,EAAM5D,IAAKpT,GAE3C,OADIiX,GAAYA,EAASD,EAAMW,GAAGvX,MAAMJ,GAAQ8hB,mBACzC,EAGX,IAAIrrB,EAAQsmD,EAAQ5pB,aAAc3X,EAAS/kB,GAASkiB,EAAqBswD,WAAWxyE,GACpF,OAAc,MAAV+kB,IACAvE,GAAYA,EAASD,EAAMW,GAAGqxD,KAAKvyE,EAAO+kB,GAAQsG,mBAC/C,GAMT,SAASq+D,EAAWnpE,EAAOC,GACzB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACd,GAAIN,EAAMI,qBAAqBtE,EAAiBuF,eAAiBrB,EAAMI,UAAUhe,KAAKquC,QACpF,SAAKlwB,EAAMwY,eAAiBpX,EAAqB4vD,SAASvxD,EAAM5D,IAAKmE,EAAMvD,QACvEiD,GAAYA,EAASD,EAAMW,GAAGvX,MAAMmX,EAAMvD,KAAK8N,mBAC5C,GAGT,IAAKvK,EAAMpX,OAAOsnC,QAAW,OAAO,EAEpC,GAAIxwB,EAAU,CACZ,IAAI2lC,EAAQtlC,EAAIyY,cAAgBzY,EAAInX,OAAOuT,QAAQysB,KAC/CxoB,EAAKX,EAAMW,GACXX,EAAMI,qBAAqBtE,EAAiB0E,eAAiBG,EAAGqnC,kBACpE,IAAIpqC,EAAuB,GAAf2C,EAAMnC,MAAa,KAAOmC,EAAMne,MAAM,GAAGyb,eAAe0C,EAAMlC,YAAY,IAAIP,YACtFusB,EAAQub,GAAShoC,EAAQ,CAAC,CAAC7d,KAAM6d,IAAU,KAC3CwrE,EAAMznE,EAAqB4vD,SAAS5wD,EAAGvE,IAAKuE,EAAGtE,QAAQpX,IAAIsb,EAAMvD,KAAM,EAAGqtB,GACzEA,GAAU++C,IAAOznE,EAAqB4vD,SAAS5wD,EAAGvE,IAAKuE,EAAGtE,QAAQpX,IAAIsb,EAAMvD,KAAM,EAAGY,GAAS,CAAC,CAAC7d,KAAM6d,OACzGysB,EAAQ,CAAC,CAACtqC,KAAM6d,IAChBwrE,GAAM,GAEJA,IACFzoE,EAAGvX,MAAMuX,EAAGtE,QAAQpX,IAAIsb,EAAMvD,KAAM,EAAGqtB,GAClCub,GAAUrlC,EAAMwY,cAAgBxY,EAAMpX,OAAOpJ,MAAQ6d,IACtD2C,EAAMne,MAAM,GAAGowC,WAAWjyB,EAAM7a,OAAO,GAAI6a,EAAMlC,YAAY,GAAIrC,EAAiB+zB,SAAS1oB,KAAKzJ,EAAMhf,SAAU2hB,EAAMpX,UACtHwX,EAAG2b,cAAc3b,EAAGtE,QAAQpX,IAAIsb,EAAMvX,UAAW4U,IAEvDqC,EAASU,EAAGmK,kBAEd,OAAO,EAMT,SAASu+D,EAAoBrpE,EAAOC,GAClC,OAAOkpE,EAAWnpE,EAAOC,GAAY,SAAWU,GAC9C,IAAI8X,EAAQzY,EAAMuZ,aAAgBvZ,EAAMI,UAAUE,IAAIyY,cAAgB/Y,EAAMI,UAAUG,MAAMkY,QACxFA,GAAS9X,EAAGqlC,YAAYvtB,GAC5BxY,EAASU,KAOb,SAAS2oE,EAAiBtpE,EAAOC,GAC/B,IAGIjD,EAHA+D,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZ+G,EAAKvG,EAAIuG,GAETuoB,EAAOtvB,EAAMi0B,YAAYltB,GAC7B,OAAY,GAARuoB,IACJ7yB,EAAMuD,EAAMvX,OAAO6mC,GACf5vB,GAAYA,EAASD,EAAMW,GAAGC,aAAa9E,EAAiBuF,cAAcziB,OAAOohB,EAAM5D,IAAKY,MACzF,GAKT,SAASusE,EAAUvpE,EAAOC,GAExB,OADIA,GAAYA,EAASD,EAAMW,GAAGC,aAAa,IAAI9E,EAAiB4pC,aAAa1lC,EAAM5D,QAChF,EAGT,SAASotE,EAAexpE,EAAO7D,EAAM8D,GACnC,IAAIjX,EAASmT,EAAK6G,WAAY/D,EAAQ9C,EAAK8G,UAAWvd,EAAQyW,EAAKzW,QACnE,SAAKsD,GAAWiW,GAAUjW,EAAOjJ,KAAKizC,kBAAkB/zB,EAAMlf,UACzDiJ,EAAO0T,QAAQysB,MAAQhtB,EAAKhT,OAAOqpC,WAAW9sC,EAAQ,EAAGA,IACxDua,GAAYA,EAASD,EAAMW,GAAGpgB,OAAO4b,EAAKa,IAAMhU,EAAOoa,SAAUjH,EAAKa,KAAK8N,mBACxE,MAEJ3O,EAAKhT,OAAOqpC,WAAW9sC,EAAOA,EAAQ,KAAQuZ,EAAM3B,cAAeqE,EAAqBuuD,QAAQlwD,EAAM5D,IAAKD,EAAKa,QAEjHiD,GACAA,EAASD,EAAMW,GACP0iE,kBAAkBlnE,EAAKa,IAAKhU,EAAOjJ,KAAMiJ,EAAO6U,eAAe7U,EAAOsV,aACtEna,KAAKgY,EAAKa,KACV8N,mBACL,IAGT,SAASu9D,EAAcroE,EAAOmoE,EAAMloE,GAClC,IAAsDwpE,EAAMhkF,EAAxDuD,EAASm/E,EAAKnlE,WAAY/D,EAAQkpE,EAAKllE,UAC3C,GAAIja,EAAOjJ,KAAK2d,KAAKsB,WAAaC,EAAMlf,KAAK2d,KAAKsB,UAAa,OAAO,EACtE,GAAIwqE,EAAexpE,EAAOmoE,EAAMloE,GAAa,OAAO,EAEpD,GAAIkoE,EAAKh/E,OAAOqpC,WAAW21C,EAAKziF,QAASyiF,EAAKziF,QAAU,KACnD+jF,GAAQhkF,EAAQuD,EAAO6U,eAAe7U,EAAOsV,aAAay5B,aAAa94B,EAAMlf,QAC9E0F,EAAMywC,UAAUuzC,EAAK,IAAMxqE,EAAMlf,MAAMg2C,SAAU,CACnD,GAAI91B,EAAU,CAEZ,IADA,IAAIhZ,EAAMkhF,EAAKnrE,IAAMiC,EAAMmE,SAAU68B,EAAOjkC,EAAiB+zB,SAASnzB,MAC7DhR,EAAI69E,EAAKrmF,OAAS,EAAGwI,GAAK,EAAGA,IAClCq0C,EAAOjkC,EAAiB+zB,SAAS1oB,KAAKoiE,EAAK79E,GAAGhN,OAAO,KAAMqhD,IAC/DA,EAAOjkC,EAAiB+zB,SAAS1oB,KAAKre,EAAO6qB,KAAKosB,IAClD,IAAIt/B,EAAKX,EAAMW,GAAGyF,KAAK,IAAIzE,EAAqB+kC,kBAAkByhC,EAAKnrE,IAAM,EAAG/V,EAAKkhF,EAAKnrE,IAAK/V,EAAK,IAAI+U,EAAiBW,MAAMsjC,EAAM,EAAG,GAAIwpC,EAAKrmF,QAAQ,IACrJsmF,EAASziF,EAAM,EAAIwiF,EAAKrmF,OACxBue,EAAqBuuD,QAAQvvD,EAAGvE,IAAKstE,IAAW/oE,EAAGxc,KAAKulF,GAC5DzpE,EAASU,EAAGmK,kBAEd,OAAO,EAGT,IAAI6+D,EAAW7tE,EAAiB6C,UAAUZ,SAASoqE,EAAM,GACrD1oF,EAAQkqF,GAAYA,EAASppE,MAAM4b,WAAWwtD,EAASrpE,KAAMkE,EAAS/kB,GAASkiB,EAAqBswD,WAAWxyE,GACnH,OAAc,MAAV+kB,GAAkBA,GAAU2jE,EAAK/pE,QAC/B6B,GAAYA,EAASD,EAAMW,GAAGqxD,KAAKvyE,EAAO+kB,GAAQsG,mBAC/C,GAWX,SAAS8+D,EAAO94E,EAAUulB,GACxB,OAAO,SAASrW,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZG,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACV7gB,EAAQ8gB,EAAM4b,WAAW7b,GAAM2vD,EAAWxwE,GAASkiB,EAAqBo2B,aAAat4C,EAAOqR,EAAUulB,GAC1G,QAAK45C,IACDhwD,GAAYA,EAASD,EAAMW,GAAGs/B,KAAKxgD,EAAOwwE,GAAUnlD,mBACjD,IAOX,SAASslD,EAAat/D,EAAUulB,GAC9B,OAAO,SAASrW,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZiH,EAAOtG,EAAIsG,KACXC,EAAKvG,EAAIuG,GACTuiE,GAAa,EAWjB,OAVA7pE,EAAM5D,IAAIsc,aAAarR,EAAMC,GAAI,SAAUllB,EAAM4a,GAC/C,GAAI6sE,EAAc,OAAO,EACzB,GAAKznF,EAAKkb,cAAelb,EAAKu3B,UAAU7oB,EAAUulB,GAClD,GAAIj0B,EAAKrC,MAAQ+Q,EACf+4E,GAAa,MACR,CACL,IAAI1tE,EAAO6D,EAAM5D,IAAIE,QAAQU,GAAMtX,EAAQyW,EAAKzW,QAChDmkF,EAAa1tE,EAAKhT,OAAO8sC,eAAevwC,EAAOA,EAAQ,EAAGoL,SAGzD+4E,IACD5pE,GAAYA,EAASD,EAAMW,GAAGyvD,aAAa/oD,EAAMC,EAAIxW,EAAUulB,GAAOvL,mBACnE,IAIX,SAASg/D,EAAY1tE,EAAKoO,EAAQzqB,GAahC,IAZA,IAAIs5C,EAAO,SAAWztC,GACpB,IAAImV,EAAMyJ,EAAO5e,GACb2U,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACV8oE,EAAqB,GAAf7oE,EAAMnC,OAAahC,EAAIrc,KAAKm7C,eAAen7C,GAKrD,GAJAqc,EAAIsc,aAAanY,EAAMvD,IAAKsD,EAAItD,KAAK,SAAU5a,GAC7C,GAAIgnF,EAAO,OAAO,EAClBA,EAAMhnF,EAAK0c,eAAiB1c,EAAKrC,KAAKm7C,eAAen7C,MAEnDqpF,EAAO,MAAO,CAAE/nB,GAAG,IAGhBz1D,EAAI,EAAGA,EAAI4e,EAAOpnB,OAAQwI,IAAK,CACtC,IAAI01D,EAAWjoB,EAAMztC,GAErB,GAAK01D,EAAW,OAAOA,EAASD,EAElC,OAAO,EAWT,SAAS0oB,EAAWhwD,EAAU1D,GAC5B,OAAO,SAASrW,EAAOC,GACrB,IAAIc,EAAMf,EAAMI,UACZxD,EAAQmE,EAAInE,MACZmpC,EAAUhlC,EAAIglC,QACdv7B,EAASzJ,EAAIyJ,OACjB,GAAK5N,IAAUmpC,IAAa+jC,EAAY9pE,EAAM5D,IAAKoO,EAAQuP,GAAa,OAAO,EAC/E,GAAI9Z,EACF,GAAI8lC,EACEhsB,EAASV,QAAQrZ,EAAMuZ,aAAewsB,EAAQttB,SAC9CxY,EAASD,EAAMW,GAAGka,iBAAiBd,IAEnC9Z,EAASD,EAAMW,GAAGgnC,cAAc5tB,EAASn7B,OAAOy3B,SAC/C,CAEL,IADA,IAAIU,GAAM,EAAOpW,EAAKX,EAAMW,GACnB/U,EAAI,GAAImrB,GAAOnrB,EAAI4e,EAAOpnB,OAAQwI,IAAK,CAC9C,IAAIsmC,EAAQ1nB,EAAO5e,GACf2U,EAAQ2xB,EAAM3xB,MACdD,EAAM4xB,EAAM5xB,IAChByW,EAAM/W,EAAM5D,IAAIod,aAAajZ,EAAMvD,IAAKsD,EAAItD,IAAK+c,GAEnD,IAAK,IAAIjO,EAAM,EAAGA,EAAMtB,EAAOpnB,OAAQ0oB,IAAO,CAC5C,IAAIk+D,EAAQx/D,EAAOsB,GACfm+D,EAAUD,EAAMzpE,MAChB2pE,EAAQF,EAAM1pE,IACdyW,EAAOpW,EAAG+a,WAAWuuD,EAAQjtE,IAAKktE,EAAMltE,IAAK+c,GAC1CpZ,EAAGia,QAAQqvD,EAAQjtE,IAAKktE,EAAMltE,IAAK+c,EAASn7B,OAAOy3B,IAE5DpW,EAASU,EAAGmK,kBAGhB,OAAO,GAIX,SAASq/D,EAAoBlqE,EAAUmqE,GACrC,OAAO,SAAUzpE,GACf,IAAKA,EAAG6mC,UAAa,OAAOvnC,EAASU,GAGrC,IADA,IAAI6J,EAAS,GACJ5e,EAAI,EAAGA,EAAI+U,EAAGtE,QAAQ0J,KAAK3iB,OAAQwI,IAAK,CAE/C,IADA,IAAI3G,EAAM0b,EAAGtE,QAAQ0J,KAAKna,GACjB0jC,EAAI,EAAGA,EAAI9kB,EAAOpnB,OAAQksC,IAC/B9kB,EAAO8kB,GAAKrqC,EAAIA,IAAIulB,EAAO8kB,IAC/BrqC,EAAInE,SAAQ,SAAU01B,EAAIR,EAAI3O,EAAMC,GAAM,OAAOkD,EAAOlnB,KAAK+jB,EAAMC,MAMrE,IADA,IAAI2rB,EAAW,GACNnnB,EAAM,EAAGA,EAAMtB,EAAOpnB,OAAQ0oB,GAAO,EAG5C,IAFA,IAAIzE,EAAOmD,EAAOsB,GAAMxE,EAAKkD,EAAOsB,EAAM,GACtCvL,EAAQI,EAAGvE,IAAIE,QAAQ+K,GAAOjJ,EAAQmC,EAAMi0B,YAAYltB,GAAKne,EAASoX,EAAMne,KAAKgc,GAC5E1Y,EAAQ6a,EAAMlC,WAAWD,GAAQpB,EAAMuD,EAAMtB,MAAMb,EAAQ,GAAIpB,GAAOsK,IAAM5hB,EAAO,CAC1F,IAAIuZ,EAAQ9V,EAAOoV,WAAW7Y,GAC9B,IAAKuZ,EAAS,MACd,GAAIvZ,IAAmC,GAA1ButC,EAAS5Y,QAAQrd,GAAY,CACxC,IAAIhU,EAASG,EAAOnF,MAAM0B,EAAQ,GAC9BsD,EAAOjJ,MAAQkf,EAAMlf,MAAQqqF,EAAWphF,EAAQiW,IAChDg0B,EAAS3vC,KAAK0Z,GAEpBA,GAAOiC,EAAMmE,SAIjB6vB,EAAS76B,MAAK,SAAUC,EAAGC,GAAK,OAAOD,EAAIC,KAC3C,IAAK,IAAIyT,EAAMknB,EAAS7vC,OAAS,EAAG2oB,GAAO,EAAGA,IACxCpK,EAAqBuuD,QAAQvvD,EAAGvE,IAAK62B,EAASlnB,KAASpL,EAAGxc,KAAK8uC,EAASlnB,IAE9E9L,EAASU,IAWb,SAAS0pE,EAASC,EAASF,GACzB,GAAI3gF,MAAMC,QAAQ0gF,GAAa,CAC7B,IAAI//C,EAAQ+/C,EACZA,EAAa,SAAUhoF,GAAQ,OAAOioC,EAAMhQ,QAAQj4B,EAAKrC,KAAKd,OAAS,GAEzE,OAAO,SAAU+gB,EAAOC,GAAY,OAAOqqE,EAAQtqE,EAAOC,GAAYkqE,EAAoBlqE,EAAUmqE,KAMtG,SAASG,IACP,IAAIlzD,EAAW,GAAI82B,EAAM/uD,UAAUgE,OACnC,MAAQ+qD,IAAQ92B,EAAU82B,GAAQ/uD,UAAW+uD,GAE7C,OAAO,SAASnuC,EAAOC,EAAUC,GAC/B,IAAK,IAAItU,EAAI,EAAGA,EAAIyrB,EAASj0B,OAAQwI,IACjC,GAAIyrB,EAASzrB,GAAGoU,EAAOC,EAAUC,GAAS,OAAO,EACrD,OAAO,GAIX,IAAIsqE,EAAYD,EAAcviC,EAAiBkgC,EAAcK,GACzDkC,EAAMF,EAAcviC,EAAiBwgC,EAAaE,GAalDgC,EAAe,CACjB,MAASH,EAAczB,EAAeG,EAAqBC,EAAgBC,GAC3E,YAAaJ,EACb,UAAayB,EACb,gBAAiBA,EACjB,OAAUC,EACV,aAAcA,EACd,QAASlB,GAQPoB,EAAgB,CAClB,SAAUD,EAAa,aACvB,gBAAiBA,EAAa,iBAC9B,SAAUA,EAAa,UACvB,qBAAsBA,EAAa,cACnC,aAAcA,EAAa,cAC3B,QAASA,EAAa,eAExB,IAAK,IAAIzoF,KAAOyoF,EAAgBC,EAAc1oF,GAAOyoF,EAAazoF,GAGlE,IAAI0wB,EAA0B,oBAAbL,UAA2B,MAAMhf,KAAKgf,UAAUM,UACxC,oBAANg4D,IAAqC,UAAjBA,GAAGh4D,WAMtCi4D,EAAal4D,EAAMg4D,EAAgBD,EAEvCprF,EAAQ0oD,gBAAkBA,EAC1B1oD,EAAQ4oF,aAAeA,EACvB5oF,EAAQipF,mBAAqBA,EAC7BjpF,EAAQkpF,YAAcA,EACtBlpF,EAAQopF,kBAAoBA,EAC5BppF,EAAQqpF,OAASA,EACjBrpF,EAAQupF,SAAWA,EACnBvpF,EAAQ0yE,KAAOA,EACf1yE,EAAQwpF,cAAgBA,EACxBxpF,EAAQypF,SAAWA,EACnBzpF,EAAQ2pF,oBAAsBA,EAC9B3pF,EAAQ4pF,eAAiBA,EACzB5pF,EAAQ6pF,WAAaA,EACrB7pF,EAAQ+pF,oBAAsBA,EAC9B/pF,EAAQgqF,iBAAmBA,EAC3BhqF,EAAQiqF,UAAYA,EACpBjqF,EAAQsqF,OAASA,EACjBtqF,EAAQ8wE,aAAeA,EACvB9wE,EAAQyqF,WAAaA,EACrBzqF,EAAQ+qF,SAAWA,EACnB/qF,EAAQirF,cAAgBA,EACxBjrF,EAAQorF,aAAeA,EACvBprF,EAAQqrF,cAAgBA,EACxBrrF,EAAQurF,WAAaA,G,kCCppBrBlqF,OAAOib,eAAetc,EAAS,aAAc,CAAEqC,OAAO,IAEtD,IAiBImpF,EAAeC,EAjBfjvE,EAAmB,EAAQ,QAC3BC,EAAkB,EAAQ,QAC1BC,EAAmB,EAAQ,QAC3B2F,EAAuB,EAAQ,QAC/B9F,EAAoB,EAAQ,QAgBhC,GAAsB,oBAAXmvE,QAAwB,CACjC,IAAIC,EAAQ,IAAID,QAChBF,EAAgB,SAAU7oF,GAAO,OAAOgpF,EAAMplE,IAAI5jB,IAClD8oF,EAAa,SAAU9oF,EAAKN,GAE1B,OADAspF,EAAMzqF,IAAIyB,EAAKN,GACRA,OAEJ,CACL,IAAIupF,EAAU,GAAIC,EAAY,GAAIC,EAAW,EAC7CN,EAAgB,SAAU7oF,GACxB,IAAK,IAAI2J,EAAI,EAAGA,EAAIs/E,EAAQ9nF,OAAQwI,GAAK,EACrC,GAAIs/E,EAAQt/E,IAAM3J,EAAO,OAAOipF,EAAQt/E,EAAI,IAElDm/E,EAAa,SAAU9oF,EAAKN,GAG1B,OAFIypF,GAAYD,IAAaC,EAAW,GACxCF,EAAQE,KAAcnpF,EACfipF,EAAQE,KAAczpF,GAIjC,IAAI0pF,EAAO,SAAcpqE,EAAM5d,EAAKkgB,EAAOD,GACzC9hB,KAAKyf,KAAOA,EAAMzf,KAAK6B,IAAMA,EAAK7B,KAAK+hB,MAAQA,EAAO/hB,KAAK8hB,OAASA,GAOlEsxD,EAAW,SAAkB5yD,EAAOmC,EAAQlf,EAAKqmF,GAEnD9pF,KAAKwgB,MAAQA,EAEbxgB,KAAK2iB,OAASA,EAGd3iB,KAAKyD,IAAMA,EAGXzD,KAAK8pF,SAAWA,GA8GlB,SAASC,EAAWpsC,GAClB,GAAiC,SAA7BA,EAAMp/C,KAAK2d,KAAK42D,UAAwB,MAAM,IAAI50E,WAAW,qBAAuBy/C,EAAMp/C,KAAKd,MAGnG,IAFA,IAAI+iB,EAAQwpE,EAAUrsC,GAAQh7B,EAASg7B,EAAM7gC,WACzCrZ,EAAM,GAAIwmF,EAAS,EAAGH,EAAW,KAAMI,EAAY,GAC9C9/E,EAAI,EAAG0W,EAAIN,EAAQmC,EAAQvY,EAAI0W,EAAG1W,IAAO3G,EAAI2G,GAAK,EAE3D,IAAK,IAAIqqE,EAAM,EAAGj5D,EAAM,EAAGi5D,EAAM9xD,EAAQ8xD,IAAO,CAC9C,IAAI0V,EAAUxsC,EAAMn7C,MAAMiyE,GAC1Bj5D,IACA,IAAK,IAAI8O,EAAM,GAAIA,IAAO,CACxB,MAAO2/D,EAASxmF,EAAI7B,QAAyB,GAAf6B,EAAIwmF,GAAgBA,IAClD,GAAI3/D,GAAO6/D,EAAQrtE,WAAc,MAMjC,IALA,IAAIstE,EAAWD,EAAQ3nF,MAAM8nB,GACzB/K,EAAM6qE,EAASv1D,MACfylD,EAAU/6D,EAAI+6D,QACdD,EAAU96D,EAAI86D,QACdgQ,EAAW9qE,EAAI8qE,SACVC,EAAI,EAAGA,EAAIjQ,EAASiQ,IAAK,CAChC,GAAIA,EAAI7V,GAAO9xD,EAAQ,EACpBmnE,IAAaA,EAAW,KAAKhoF,KAAK,CAACvD,KAAM,mBAAoBid,IAAKA,EAAKuI,EAAGs2D,EAAUiQ,IACrF,MAGF,IADA,IAAI9jE,EAAQyjE,EAAUK,EAAI9pE,EACjBskE,EAAI,EAAGA,EAAIxK,EAASwK,IAAK,CACV,GAAlBrhF,EAAI+iB,EAAQs+D,GACZrhF,EAAI+iB,EAAQs+D,GAAKtpE,GAEhBsuE,IAAaA,EAAW,KAAKhoF,KAAK,CAACvD,KAAM,YAAak2E,IAAKA,EAAKj5D,IAAKA,EAAKuI,EAAGu2D,EAAUwK,IAC5F,IAAIyF,EAAOF,GAAYA,EAASvF,GAChC,GAAIyF,EAAM,CACR,IAAIC,GAAehkE,EAAQs+D,GAAKtkE,EAAS,EAAGwmC,EAAOkjC,EAAUM,GACjD,MAARxjC,GAAiBA,GAAQujC,GAAqC,GAA7BL,EAAUM,EAAa,IAC1DN,EAAUM,GAAcD,EACxBL,EAAUM,EAAa,GAAK,GACnBxjC,GAAQujC,GACjBL,EAAUM,EAAa,OAK/BP,GAAU3P,EACV9+D,GAAO4uE,EAASxoE,SAElB,IAAI6oE,GAAehW,EAAM,GAAKj0D,EAAOkqE,EAAU,EAC/C,MAAOT,EAASQ,EAAoC,GAAjBhnF,EAAIwmF,MAAkBS,IACrDA,IAAYZ,IAAaA,EAAW,KAAKhoF,KAAK,CAACvD,KAAM,UAAWk2E,IAAKA,EAAK1wD,EAAG2mE,IACjFlvE,IAQF,IALA,IAAImvE,EAAW,IAAIvX,EAAS5yD,EAAOmC,EAAQlf,EAAKqmF,GAAWc,GAAY,EAK9DrgE,EAAM,GAAIqgE,GAAargE,EAAM2/D,EAAUtoF,OAAQ2oB,GAAO,EACrC,MAAlB2/D,EAAU3/D,IAAgB2/D,EAAU3/D,EAAM,GAAK5H,IAAUioE,GAAY,GAG7E,OAFIA,GAAaC,EAAiBF,EAAUT,EAAWvsC,GAEhDgtC,EAGT,SAASX,EAAUrsC,GAEjB,IADA,IAAIn9B,GAAS,EAAGsqE,GAAa,EACpBrW,EAAM,EAAGA,EAAM92B,EAAM7gC,WAAY23D,IAAO,CAC/C,IAAI0V,EAAUxsC,EAAMn7C,MAAMiyE,GAAM2F,EAAW,EAC3C,GAAI0Q,EAAc,IAAK,IAAIh9C,EAAI,EAAGA,EAAI2mC,EAAK3mC,IAEzC,IADA,IAAIi9C,EAAUptC,EAAMn7C,MAAMsrC,GACjB1jC,EAAI,EAAGA,EAAI2gF,EAAQjuE,WAAY1S,IAAK,CAC3C,IAAIgqE,EAAO2W,EAAQvoF,MAAM4H,GACrB0jC,EAAIsmC,EAAKv/C,MAAMwlD,QAAU5F,IAAO2F,GAAYhG,EAAKv/C,MAAMylD,SAG/D,IAAK,IAAIhwD,EAAM,EAAGA,EAAM6/D,EAAQrtE,WAAYwN,IAAO,CACjD,IAAI0gE,EAASb,EAAQ3nF,MAAM8nB,GAC3B8vD,GAAY4Q,EAAOn2D,MAAMylD,QACrB0Q,EAAOn2D,MAAMwlD,QAAU,IAAKyQ,GAAa,IAEjC,GAAVtqE,EACAA,EAAQ45D,EACH55D,GAAS45D,IACd55D,EAAQzK,KAAK0Q,IAAIjG,EAAO45D,IAE9B,OAAO55D,EAGT,SAASqqE,EAAiBpnF,EAAKymF,EAAWvsC,GACnCl6C,EAAIqmF,WAAYrmF,EAAIqmF,SAAW,IACpC,IAAK,IAAI1/E,EAAI,EAAG8rC,EAAO,GAAI9rC,EAAI3G,EAAIA,IAAI7B,OAAQwI,IAAK,CAClD,IAAIoR,EAAM/X,EAAIA,IAAI2G,GAClB,IAAI8rC,EAAK16B,GAAT,CACA06B,EAAK16B,IAAO,EAEZ,IADA,IAAI5a,EAAO+8C,EAAM59B,OAAOvE,GAAMoQ,EAAU,KAC/BkiB,EAAI,EAAGA,EAAIltC,EAAKi0B,MAAMylD,QAASxsC,IAAK,CAC3C,IAAIqyB,GAAO/1D,EAAI0jC,GAAKrqC,EAAI+c,MAAOyqE,EAAWf,EAAgB,EAAN/pB,GACpC,MAAZ8qB,GAAsBrqF,EAAKi0B,MAAMw1D,UAAYzpF,EAAKi0B,MAAMw1D,SAASv8C,IAAMm9C,KACtEr/D,IAAYA,EAAUs/D,EAActqF,EAAKi0B,SAASiZ,GAAKm9C,GAE1Dr/D,GAAWnoB,EAAIqmF,SAAS70E,QAAQ,CAAC1W,KAAM,oBAAqBid,IAAKA,EAAK6uE,SAAUz+D,MAIxF,SAASs/D,EAAcr2D,GACrB,GAAIA,EAAMw1D,SAAY,OAAOx1D,EAAMw1D,SAASv/E,QAE5C,IADA,IAAItK,EAAS,GACJ4J,EAAI,EAAGA,EAAIyqB,EAAMylD,QAASlwE,IAAO5J,EAAOsB,KAAK,GACtD,OAAOtB,EAlNT4yE,EAAStgE,UAAUuhE,SAAW,SAAmB74D,GAG/C,IAFE,IAAI+E,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAKyD,IAAI7B,OAAQwI,IAAK,CACxC,IAAIslC,EAASnvB,EAAO9c,IAAI2G,GACxB,GAAIslC,GAAUl0B,EAAd,CAGA,IAFA,IAAIiE,EAAOrV,EAAImW,EAAOC,MAAO3e,EAAOuI,EAAImW,EAAOC,MAAS,EACpDuB,EAAQtC,EAAO,EAAGqC,EAASjgB,EAAM,EAC5BisC,EAAI,EAAG/rB,EAAQ/hB,KAAKwgB,OAASxgB,KAAKyD,IAAI2G,EAAI0jC,IAAM4B,EAAQ5B,IAAO/rB,IACxE,IAAK,IAAI+vC,EAAM,EAAGhwC,EAAS9hB,KAAK2iB,QAAU3iB,KAAKyD,IAAI2G,EAAKpK,KAAKwgB,MAAQsxC,IAASpiB,EAAQoiB,IAAShwC,IAC/F,OAAO,IAAI+nE,EAAKpqE,EAAM5d,EAAKkgB,EAAOD,IAEpC,MAAM,IAAI5jB,WAAW,uBAAyBsd,EAAM,WAKtD43D,EAAStgE,UAAUq4E,SAAW,SAAmB3vE,GAG/C,IAFE,IAAI+E,EAASvgB,KAENoK,EAAI,EAAGA,EAAIpK,KAAKyD,IAAI7B,OAAQwI,IACjC,GAAImW,EAAO9c,IAAI2G,IAAMoR,EAAO,OAAOpR,EAAImW,EAAOC,MAClD,MAAM,IAAItiB,WAAW,uBAAyBsd,EAAM,WAMtD43D,EAAStgE,UAAUs4E,SAAW,SAAmB5vE,EAAK8C,EAAM9B,GAC1D,IAAI+C,EAAMvf,KAAKq0E,SAAS74D,GAClBiE,EAAOF,EAAIE,KACXsC,EAAQxC,EAAIwC,MACZlgB,EAAM0d,EAAI1d,IACVigB,EAASvC,EAAIuC,OACnB,MAAY,SAARxD,GACE9B,EAAM,EAAY,GAARiD,EAAYsC,GAAS/hB,KAAKwgB,OAAgB,KACjDxgB,KAAKyD,IAAI5B,EAAM7B,KAAKwgB,OAAShE,EAAM,EAAIiD,EAAO,EAAIsC,KAErDvF,EAAM,EAAW,GAAP3a,EAAWigB,GAAU9hB,KAAK2iB,QAAiB,KAClD3iB,KAAKyD,IAAIgc,EAAOzf,KAAKwgB,OAAShE,EAAM,EAAI3a,EAAM,EAAIigB,KAM7DsxD,EAAStgE,UAAU2gE,YAAc,SAAsB58D,EAAGC,GACxD,IAAIyI,EAAMvf,KAAKq0E,SAASx9D,GAClBw0E,EAAQ9rE,EAAIE,KACZ6rE,EAAS/rE,EAAIwC,MACbwpE,EAAOhsE,EAAI1d,IACX2pF,EAAUjsE,EAAIuC,OAChB4uB,EAAQ1wC,KAAKq0E,SAASv9D,GACpB20E,EAAQ/6C,EAAMjxB,KACdisE,EAASh7C,EAAM3uB,MACf4pE,EAAOj7C,EAAM7uC,IACb+pF,EAAUl7C,EAAM5uB,OACtB,OAAO,IAAI+nE,EAAK9zE,KAAK8Q,IAAIwkE,EAAOI,GAAQ11E,KAAK8Q,IAAI0kE,EAAMI,GACvC51E,KAAK0Q,IAAI6kE,EAAQI,GAAS31E,KAAK0Q,IAAI+kE,EAASI,KAM9DxY,EAAStgE,UAAUygE,YAAc,SAAsBhyD,GAIrD,IAHE,IAAIhB,EAASvgB,KAEXQ,EAAS,GAAI01C,EAAO,GACfu+B,EAAMlzD,EAAK1f,IAAK4yE,EAAMlzD,EAAKO,OAAQ2yD,IAC1C,IAAK,IAAItU,EAAM5+C,EAAK9B,KAAM0gD,EAAM5+C,EAAKQ,MAAOo+C,IAAO,CACjD,IAAIj8D,EAAQuwE,EAAMl0D,EAAOC,MAAQ2/C,EAAK3kD,EAAM+E,EAAO9c,IAAIS,GACnDgyC,EAAK16B,KACT06B,EAAK16B,IAAO,EACP2kD,GAAO5+C,EAAK9B,MAAS0gD,GAAO5/C,EAAO9c,IAAIS,EAAQ,IAAMsX,GACrDi5D,GAAOlzD,EAAK1f,KAAQ4yE,GAAOl0D,EAAO9c,IAAIS,EAAQqc,EAAOC,QAAUhF,GAChEhb,EAAOsB,KAAK0Z,IAGpB,OAAOhb,GAMT4yE,EAAStgE,UAAU+4E,WAAa,SAAqBpX,EAAKtU,EAAKxiB,GAG7D,IAFE,IAAIp9B,EAASvgB,KAENoK,EAAI,EAAG0hF,EAAW,GAAI1hF,IAAK,CAClC,IAAI2hF,EAASD,EAAWnuC,EAAMn7C,MAAM4H,GAAGwX,SACvC,GAAIxX,GAAKqqE,EAAK,CACZ,IAAIvwE,EAAQi8D,EAAMsU,EAAMl0D,EAAOC,MAAOwrE,GAAevX,EAAM,GAAKl0D,EAAOC,MAEvE,MAAOtc,EAAQ8nF,GAAehsF,KAAKyD,IAAIS,GAAS4nF,EAAY5nF,IAC5D,OAAOA,GAAS8nF,EAAcD,EAAS,EAAIxrE,EAAO9c,IAAIS,GAExD4nF,EAAWC,IAMf3Y,EAAS/uD,IAAM,SAAcs5B,GAC3B,OAAO2rC,EAAc3rC,IAAU4rC,EAAW5rC,EAAOosC,EAAWpsC,KAkH9D,IAAIl9C,EAAM,IAAI6Z,EAAiBqP,UAAU,kBAEzC,SAASsiE,EAAWtxE,GAClB,IAAK,IAAIgC,EAAIhC,EAAKiC,MAAQ,EAAGD,EAAI,EAAGA,IAChC,GAAwC,OAApChC,EAAK/Z,KAAK+b,GAAGpe,KAAK2d,KAAK42D,UAAsB,OAAOn4D,EAAK/Z,KAAK,GAAGka,QAAQH,EAAKnT,OAAOmV,EAAI,IACjG,OAAO,KAGT,SAASuvE,EAAavxE,GACpB,IAAK,IAAIgC,EAAIhC,EAAKiC,MAAOD,EAAI,EAAGA,IAAK,CACnC,IAAIwvE,EAAOxxE,EAAK/Z,KAAK+b,GAAGpe,KAAK2d,KAAK42D,UAClC,GAAa,SAATqZ,GAA4B,gBAATA,EAA0B,OAAOxxE,EAAK/Z,KAAK+b,GAEpE,OAAO,KAGT,SAASyvE,EAAU5tE,GAEjB,IADA,IAAIP,EAAQO,EAAMI,UAAUX,MACnBtB,EAAIsB,EAAMrB,MAAOD,EAAI,EAAGA,IAAO,GAAyC,OAArCsB,EAAMrd,KAAK+b,GAAGpe,KAAK2d,KAAK42D,UAAsB,OAAO,EACjG,OAAO,EAGT,SAASuZ,EAAc7tE,GACrB,IAAIG,EAAMH,EAAMI,UAChB,OAAID,EAAI00D,YACC10D,EAAI00D,YAAY73D,IAAMmD,EAAI+0D,UAAUl4D,IAAMmD,EAAI00D,YAAc10D,EAAI+0D,UAC9D/0D,EAAI/d,MAAwC,QAAhC+d,EAAI/d,KAAKrC,KAAK2d,KAAK42D,UACjCn0D,EAAIX,QAENiuE,EAAWttE,EAAIV,QAAUquE,EAAS3tE,EAAIV,OAG/C,SAASquE,EAAS3xE,GAChB,IAAK,IAAI8C,EAAQ9C,EAAK8G,UAAWjG,EAAMb,EAAKa,IAAKiC,EAAOA,EAAQA,EAAMrO,WAAYoM,IAAO,CACvF,IAAI2wE,EAAO1uE,EAAMlf,KAAK2d,KAAK42D,UAC3B,GAAY,QAARqZ,GAA0B,eAARA,EAAyB,OAAOxxE,EAAKC,IAAIE,QAAQU,GAEzE,IAAK,IAAIhU,EAASmT,EAAK6G,WAAYgsC,EAAQ7yC,EAAKa,IAAKhU,EAAQA,EAASA,EAAOyV,UAAWuwC,IAAS,CAC/F,IAAI++B,EAAS/kF,EAAOjJ,KAAK2d,KAAK42D,UAC9B,GAAc,QAAVyZ,GAA8B,eAAVA,EAA2B,OAAO5xE,EAAKC,IAAIE,QAAQ0yC,EAAQhmD,EAAOoa,WAI9F,SAAS4qE,EAAa7xE,GACpB,MAA0C,OAAnCA,EAAKhT,OAAOpJ,KAAK2d,KAAK42D,WAAsBn4D,EAAK8G,UAG1D,SAASgrE,EAAgB9xE,GACvB,OAAOA,EAAK/Z,KAAK,GAAGka,QAAQH,EAAKa,IAAMb,EAAK8G,UAAUG,UAGxD,SAAS8qE,EAAYC,EAAIC,GACvB,OAAOD,EAAG/vE,OAASgwE,EAAGhwE,OAAS+vE,EAAGnxE,KAAOoxE,EAAGpmE,OAAO,IAAMmmE,EAAGnxE,KAAOoxE,EAAGnnF,KAAK,GAG7E,SAAS4uE,EAAS15D,GAChB,OAAOy4D,EAAS/uD,IAAI1J,EAAK/Z,MAAM,IAAIyzE,SAAS15D,EAAKa,IAAMb,EAAK6L,OAAO,IAGrE,SAAS2kE,EAASxwE,GAChB,OAAOy4D,EAAS/uD,IAAI1J,EAAK/Z,MAAM,IAAIuqF,SAASxwE,EAAKa,IAAMb,EAAK6L,OAAO,IAGrE,SAAS4kE,EAASzwE,EAAM2D,EAAM9B,GAC5B,IAAIgK,EAAQ7L,EAAK6L,OAAO,GAAI/iB,EAAM2vE,EAAS/uD,IAAI1J,EAAK/Z,MAAM,IACtDisF,EAAQppF,EAAI2nF,SAASzwE,EAAKa,IAAMgL,EAAOlI,EAAM9B,GACjD,OAAgB,MAATqwE,EAAgB,KAAOlyE,EAAK/Z,KAAK,GAAGka,QAAQ0L,EAAQqmE,GAG7D,SAASC,EAAQj4D,EAAOp3B,EAAM0C,GAC5B,IAAIK,EAAS,GACb,IAAK,IAAIjB,KAAQs1B,EAASr0B,EAAOjB,GAAQs1B,EAAMt1B,GAE/C,OADAiB,EAAO/C,GAAQ0C,EACRK,EAGT,SAASusF,EAAUl4D,EAAOrZ,EAAKuI,QAClB,IAANA,IAAeA,EAAE,GAEtB,IAAIvjB,EAASssF,EAAQj4D,EAAO,UAAWA,EAAMylD,QAAUv2D,GAMvD,OALIvjB,EAAO6pF,WACT7pF,EAAO6pF,SAAW7pF,EAAO6pF,SAASv/E,QAClCtK,EAAO6pF,SAAS9/E,OAAOiR,EAAKuI,GACvBvjB,EAAO6pF,SAAStoC,MAAK,SAAU+iC,GAAK,OAAOA,EAAI,OAAStkF,EAAO6pF,SAAW,OAE1E7pF,EAGT,SAASwsF,EAAWn4D,EAAOrZ,EAAKuI,QACnB,IAANA,IAAeA,EAAE,GAEtB,IAAIvjB,EAASssF,EAAQj4D,EAAO,UAAWA,EAAMylD,QAAUv2D,GACvD,GAAIvjB,EAAO6pF,SAAU,CACnB7pF,EAAO6pF,SAAW7pF,EAAO6pF,SAASv/E,QAClC,IAAK,IAAIV,EAAI,EAAGA,EAAI2Z,EAAG3Z,IAAO5J,EAAO6pF,SAAS9/E,OAAOiR,EAAK,EAAG,GAE/D,OAAOhb,EAUT,IAAIw2E,EAAiB,SAAU75D,GAC7B,SAAS65D,EAAc3D,EAAaK,QACf,IAAdA,IAAuBA,EAAYL,GAExC,IAAI11B,EAAQ01B,EAAYzyE,MAAM,GAAI6C,EAAM2vE,EAAS/uD,IAAIs5B,GAAQn3B,EAAQ6sD,EAAY7sD,OAAO,GACpFjF,EAAO9d,EAAIgwE,YAAYJ,EAAY73D,IAAMgL,EAAOktD,EAAUl4D,IAAMgL,GAChE5L,EAAMy4D,EAAYzyE,KAAK,GACvB0yE,EAAQ7vE,EAAI8vE,YAAYhyD,GAAM9K,QAAO,SAAUumB,GAAK,OAAOA,GAAK02C,EAAUl4D,IAAMgL,KAGpF8sD,EAAMr+D,QAAQy+D,EAAUl4D,IAAMgL,GAC9B,IAAIwC,EAASsqD,EAAM7vE,KAAI,SAAU+X,GAC/B,IAAI44D,EAAOz2B,EAAM59B,OAAOvE,GAAMqK,EAAOrK,EAAMgL,EAAQ,EACnD,OAAO,IAAIlM,EAAiBkpC,eAAe5oC,EAAIE,QAAQ+K,GAAOjL,EAAIE,QAAQ+K,EAAOuuD,EAAKl5D,QAAQysB,UAEhGxqB,EAAUpN,KAAK/P,KAAMgpB,EAAO,GAAGjK,MAAOiK,EAAO,GAAGlK,IAAKkK,GAIrDhpB,KAAKqzE,YAAcA,EAInBrzE,KAAK0zE,UAAYA,EAiLnB,OA9KKv2D,IAAY65D,EAAc3vE,UAAY8V,GAC3C65D,EAAclkE,UAAY3T,OAAO/B,OAAQ+f,GAAaA,EAAUrK,WAChEkkE,EAAclkE,UAAU1Q,YAAc40E,EAEtCA,EAAclkE,UAAUrP,IAAM,SAAcmX,EAAKC,GAC/C,IAAIw4D,EAAcz4D,EAAIE,QAAQD,EAAQpX,IAAIzD,KAAKqzE,YAAY73D,MACvDk4D,EAAY94D,EAAIE,QAAQD,EAAQpX,IAAIzD,KAAK0zE,UAAUl4D,MACvD,GAAIgxE,EAAanZ,IAAgBmZ,EAAa9Y,IAAcgZ,EAAYrZ,EAAaK,GAAY,CAC/F,IAAIuZ,EAAejtF,KAAKqzE,YAAYzyE,MAAM,IAAMyyE,EAAYzyE,MAAM,GAClE,OAAIqsF,GAAgBjtF,KAAK63E,iBACdb,EAAckW,aAAa7Z,EAAaK,GAC1CuZ,GAAgBjtF,KAAKmtF,iBACnBnW,EAAcoW,aAAa/Z,EAAaK,GAExC,IAAIsD,EAAc3D,EAAaK,GAE5C,OAAOp5D,EAAiB0E,cAAc2M,QAAQ0nD,EAAaK,IAM7DsD,EAAclkE,UAAUoI,QAAU,WAIhC,IAHA,IAAIyiC,EAAQ39C,KAAKqzE,YAAYzyE,MAAM,GAAI6C,EAAM2vE,EAAS/uD,IAAIs5B,GAAQn3B,EAAQxmB,KAAKqzE,YAAY7sD,OAAO,GAC9FjF,EAAO9d,EAAIgwE,YAAYzzE,KAAKqzE,YAAY73D,IAAMgL,EAAOxmB,KAAK0zE,UAAUl4D,IAAMgL,GAC1E0vB,EAAO,GAAI69B,EAAO,GACbU,EAAMlzD,EAAK1f,IAAK4yE,EAAMlzD,EAAKO,OAAQ2yD,IAAO,CAEjD,IADA,IAAI4Y,EAAa,GACRnpF,EAAQuwE,EAAMhxE,EAAI+c,MAAQe,EAAK9B,KAAM0gD,EAAM5+C,EAAK9B,KAAM0gD,EAAM5+C,EAAKQ,MAAOo+C,IAAOj8D,IAAS,CAC/F,IAAIsX,EAAM/X,EAAIA,IAAIS,GAClB,IAAKgyC,EAAK16B,GAAM,CACd06B,EAAK16B,IAAO,EACZ,IAAI8xE,EAAW7pF,EAAI4wE,SAAS74D,GAAM44D,EAAOz2B,EAAM59B,OAAOvE,GAClD+xE,EAAYhsE,EAAK9B,KAAO6tE,EAAS7tE,KAAM+tE,EAAaF,EAASvrE,MAAQR,EAAKQ,MAC9E,GAAIwrE,EAAY,GAAKC,EAAa,EAAG,CACnC,IAAI34D,EAAQu/C,EAAKv/C,MACb04D,EAAY,IAAK14D,EAAQk4D,EAAUl4D,EAAO,EAAG04D,IAC7CC,EAAa,IAAK34D,EAAQk4D,EAAUl4D,EAAOA,EAAMylD,QAAUkT,EAAYA,IAC1CpZ,EAA7BkZ,EAAS7tE,KAAO8B,EAAK9B,KAAe20D,EAAK71E,KAAK+3C,cAAczhB,GAClDu/C,EAAK71E,KAAKnB,OAAOy3B,EAAOu/C,EAAKl5D,SAE7C,GAAIoyE,EAASzrF,IAAM0f,EAAK1f,KAAOyrF,EAASxrE,OAASP,EAAKO,OAAQ,CAC5D,IAAI2rE,EAAUX,EAAQ1Y,EAAKv/C,MAAO,UAAW9e,KAAK8Q,IAAIymE,EAASxrE,OAAQP,EAAKO,QAAU/L,KAAK0Q,IAAI6mE,EAASzrF,IAAK0f,EAAK1f,MACnFuyE,EAA3BkZ,EAASzrF,IAAM0f,EAAK1f,IAAcuyE,EAAK71E,KAAK+3C,cAAcm3C,GAChDrZ,EAAK71E,KAAKnB,OAAOqwF,EAASrZ,EAAKl5D,SAE/CmyE,EAAWvrF,KAAKsyE,IAGpBL,EAAKjyE,KAAK67C,EAAMn7C,MAAMiyE,GAAKpiD,KAAK7X,EAAiB+zB,SAAS1oB,KAAKwnE,KAGjE,IAAI9zD,EAAWv5B,KAAKmtF,kBAAoBntF,KAAK63E,iBAAmBl6B,EAAQo2B,EACxE,OAAO,IAAIv5D,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAK0T,GAAW,EAAG,IAGjFy9C,EAAclkE,UAAU1S,QAAU,SAAkB+e,EAAIjE,QACrC,IAAZA,IAAqBA,EAAUV,EAAiBW,MAAMC,OAG3D,IADA,IAAIgJ,EAAUjF,EAAGmG,MAAM1jB,OAAQonB,EAAShpB,KAAKgpB,OACpC5e,EAAI,EAAGA,EAAI4e,EAAOpnB,OAAQwI,IAAK,CACtC,IAAImV,EAAMyJ,EAAO5e,GACb2U,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IACVjE,EAAUsE,EAAGtE,QAAQ/P,MAAMsZ,GAC/BjF,EAAG/e,QAAQya,EAAQpX,IAAIsb,EAAMvD,KAAMX,EAAQpX,IAAIqb,EAAItD,KAAMpR,EAAIoQ,EAAiBW,MAAMC,MAAQF,GAE9F,IAAIyD,EAAMxB,EAAUZ,SAAS4C,EAAGvE,IAAIE,QAAQqE,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAIzD,KAAK8lB,MAAO,GAClFnH,GAAOQ,EAAGC,aAAaT,IAG7Bq4D,EAAclkE,UAAU+wC,YAAc,SAAsB1kC,EAAIve,GAC9DZ,KAAKI,QAAQ+e,EAAI,IAAI3E,EAAiBW,MAAMX,EAAiB+zB,SAAS1oB,KAAKjlB,GAAO,EAAG,KAGvFo2E,EAAclkE,UAAU46E,YAAc,SAAsBj/C,GAG1D,IAFA,IAAIkP,EAAQ39C,KAAKqzE,YAAYzyE,MAAM,GAAI6C,EAAM2vE,EAAS/uD,IAAIs5B,GAAQn3B,EAAQxmB,KAAKqzE,YAAY7sD,OAAO,GAC9F8sD,EAAQ7vE,EAAI8vE,YAAY9vE,EAAIgwE,YAAYzzE,KAAKqzE,YAAY73D,IAAMgL,EAAOxmB,KAAK0zE,UAAUl4D,IAAMgL,IACtFpc,EAAI,EAAGA,EAAIkpE,EAAM1xE,OAAQwI,IAC9BqkC,EAAEkP,EAAM59B,OAAOuzD,EAAMlpE,IAAKoc,EAAQ8sD,EAAMlpE,KAM9C4sE,EAAclkE,UAAUq6E,eAAiB,WACvC,IAAIQ,EAAY3tF,KAAKqzE,YAAYnvE,OAAO,GAAI0pF,EAAU5tF,KAAK0zE,UAAUxvE,OAAO,GAC5E,GAAI6R,KAAK8Q,IAAI8mE,EAAWC,GAAW,EAAK,OAAO,EAC/C,IAAIC,EAAYF,EAAY3tF,KAAKqzE,YAAY5xD,UAAUoT,MAAMwlD,QACzDyT,EAAUF,EAAU5tF,KAAK0zE,UAAUjyD,UAAUoT,MAAMwlD,QACvD,OAAOtkE,KAAK0Q,IAAIonE,EAAWC,IAAY9tF,KAAK0zE,UAAU9yE,MAAM,GAAGkc,YAMjEk6D,EAAcoW,aAAe,SAAuB/Z,EAAaK,QAC5C,IAAdA,IAAuBA,EAAYL,GAExC,IAAI5vE,EAAM2vE,EAAS/uD,IAAIgvD,EAAYzyE,MAAM,IAAK4lB,EAAQ6sD,EAAY7sD,OAAO,GACrEunE,EAAatqF,EAAI4wE,SAAShB,EAAY73D,IAAMgL,GAAQwnE,EAAWvqF,EAAI4wE,SAASX,EAAUl4D,IAAMgL,GAC5F5L,EAAMy4D,EAAYzyE,KAAK,GAY3B,OAXImtF,EAAWlsF,KAAOmsF,EAASnsF,KACzBksF,EAAWlsF,IAAM,IACjBwxE,EAAcz4D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIsqF,EAAWtuE,QACrDuuE,EAASlsE,OAASre,EAAIkf,SACtB+wD,EAAY94D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIA,EAAI+c,OAAS/c,EAAIkf,OAAS,GAAKqrE,EAASjsE,MAAQ,OAExFisE,EAASnsF,IAAM,IACf6xE,EAAY94D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIuqF,EAASvuE,QACjDsuE,EAAWjsE,OAASre,EAAIkf,SACxB0wD,EAAcz4D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIA,EAAI+c,OAAS/c,EAAIkf,OAAS,GAAKorE,EAAWhsE,MAAQ,MAE3F,IAAIi1D,EAAc3D,EAAaK,IAMxCsD,EAAclkE,UAAU+kE,eAAiB,WACvC,IAAIp0E,EAAM2vE,EAAS/uD,IAAIrkB,KAAKqzE,YAAYzyE,MAAM,IAAK4lB,EAAQxmB,KAAKqzE,YAAY7sD,OAAO,GAC/EynE,EAAaxqF,EAAI0nF,SAASnrF,KAAKqzE,YAAY73D,IAAMgL,GACjD0nE,EAAWzqF,EAAI0nF,SAASnrF,KAAK0zE,UAAUl4D,IAAMgL,GACjD,GAAIzQ,KAAK8Q,IAAIonE,EAAYC,GAAY,EAAK,OAAO,EACjD,IAAIC,EAAcF,EAAajuF,KAAKqzE,YAAY5xD,UAAUoT,MAAMylD,QAC5D8T,EAAYF,EAAWluF,KAAK0zE,UAAUjyD,UAAUoT,MAAMylD,QAC1D,OAAOvkE,KAAK0Q,IAAI0nE,EAAaC,IAAc3qF,EAAI+c,OAGjDw2D,EAAclkE,UAAUuI,GAAK,SAAaC,GACxC,OAAOA,aAAiB07D,GAAiB17D,EAAM+3D,YAAY73D,KAAOxb,KAAKqzE,YAAY73D,KACjFF,EAAMo4D,UAAUl4D,KAAOxb,KAAK0zE,UAAUl4D,KAM1Cw7D,EAAckW,aAAe,SAAuB7Z,EAAaK,QAC5C,IAAdA,IAAuBA,EAAYL,GAExC,IAAI5vE,EAAM2vE,EAAS/uD,IAAIgvD,EAAYzyE,MAAM,IAAK4lB,EAAQ6sD,EAAY7sD,OAAO,GACrEunE,EAAatqF,EAAI4wE,SAAShB,EAAY73D,IAAMgL,GAAQwnE,EAAWvqF,EAAI4wE,SAASX,EAAUl4D,IAAMgL,GAC5F5L,EAAMy4D,EAAYzyE,KAAK,GAY3B,OAXImtF,EAAWtuE,MAAQuuE,EAASvuE,MAC1BsuE,EAAWtuE,KAAO,IAClB4zD,EAAcz4D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIsqF,EAAWlsF,IAAM4B,EAAI+c,SAC/DwtE,EAASjsE,MAAQte,EAAI+c,QACrBkzD,EAAY94D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIA,EAAI+c,OAASwtE,EAASnsF,IAAM,GAAK,OAEzEmsF,EAASvuE,KAAO,IAChBi0D,EAAY94D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIuqF,EAASnsF,IAAM4B,EAAI+c,SAC3DutE,EAAWhsE,MAAQte,EAAI+c,QACvB6yD,EAAcz4D,EAAIE,QAAQ0L,EAAQ/iB,EAAIA,IAAIA,EAAI+c,OAASutE,EAAWlsF,IAAM,GAAK,MAE5E,IAAIm1E,EAAc3D,EAAaK,IAGxCsD,EAAclkE,UAAUyI,OAAS,WAC/B,MAAO,CAAChd,KAAM,OAAQsd,OAAQ7b,KAAKqzE,YAAY73D,IAAKT,KAAM/a,KAAK0zE,UAAUl4D,MAG3Ew7D,EAAcv7D,SAAW,SAAmBb,EAAKc,GAC/C,OAAO,IAAIs7D,EAAcp8D,EAAIE,QAAQY,EAAKG,QAASjB,EAAIE,QAAQY,EAAKX,QAItEi8D,EAAc55E,OAAS,SAAiBwd,EAAKyzE,EAAYxR,GAGvD,YAFkB,IAAbA,IAAsBA,EAAWwR,GAE/B,IAAIrX,EAAcp8D,EAAIE,QAAQuzE,GAAazzE,EAAIE,QAAQ+hE,KAGhE7F,EAAclkE,UAAU6I,YAAc,WAA0B,OAAO,IAAI2yE,EAAatuF,KAAKqzE,YAAY73D,IAAKxb,KAAK0zE,UAAUl4D,MAEtHw7D,EAxMW,CAyMlB18D,EAAiB6C,WAEnB65D,EAAclkE,UAAUsK,SAAU,EAElC9C,EAAiB6C,UAAUE,OAAO,OAAQ25D,GAE1C,IAAIsX,EAAe,SAAsBzyE,EAAQd,GAC/C/a,KAAK6b,OAASA,EACd7b,KAAK+a,KAAOA,GAiBd,SAASwzE,EAAkB/vE,GACzB,KAAMA,EAAMI,qBAAqBo4D,GAAkB,OAAO,KAC1D,IAAI1D,EAAQ,GAIZ,OAHA90D,EAAMI,UAAU8uE,aAAY,SAAU9sF,EAAM4a,GAC1C83D,EAAMxxE,KAAKyY,EAAgB0F,WAAWrf,KAAK4a,EAAKA,EAAM5a,EAAKghB,SAAU,CAACxT,MAAO,qBAExEmM,EAAgByF,cAAc5iB,OAAOohB,EAAM5D,IAAK04D,GAGzD,SAASkb,EAAwBjvE,GAC/B,IAAIR,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IAEd,GAAIC,EAAMvD,KAAOsD,EAAItD,KAAOuD,EAAMvD,IAAMuD,EAAMvD,IAAM,EAAK,OAAO,EAEhE,IADA,IAAIizE,EAAY1vE,EAAMvD,IAAKkzE,EAAW5vE,EAAItD,IAAKoB,EAAQmC,EAAMnC,MACtDA,GAAS,EAAGA,IAAS6xE,IACxB,GAAI1vE,EAAMtB,MAAMb,EAAQ,GAAKmC,EAAMtZ,IAAImX,GAAU,MACrD,IAAK,IAAID,EAAImC,EAAIlC,MAAOD,GAAK,EAAGA,IAAK+xE,IACjC,GAAI5vE,EAAItX,OAAOmV,EAAI,GAAKmC,EAAI0H,MAAM7J,GAAM,MAC5C,OAAO8xE,GAAaC,GAAY,YAAY58E,KAAKiN,EAAMne,KAAKgc,GAAOre,KAAK2d,KAAK42D,WAG/E,SAAS6b,EAA2BpvE,GAOlC,IANA,IAGIqvE,EACAC,EAJA9vE,EAAQQ,EAAIR,MACZD,EAAMS,EAAIT,IAKL1U,EAAI2U,EAAMnC,MAAOxS,EAAI,EAAGA,IAAK,CACpC,IAAIxJ,EAAOme,EAAMne,KAAKwJ,GACtB,GAAiC,SAA7BxJ,EAAKrC,KAAK2d,KAAK42D,WAAqD,gBAA7BlyE,EAAKrC,KAAK2d,KAAK42D,UAA6B,CACrF8b,EAAuBhuF,EACvB,OAIJ,IAAK,IAAI0pB,EAAMxL,EAAIlC,MAAO0N,EAAM,EAAGA,IAAO,CACxC,IAAIwkE,EAAShwE,EAAIle,KAAK0pB,GACtB,GAAmC,SAA/BwkE,EAAOvwF,KAAK2d,KAAK42D,WAAuD,gBAA/Bgc,EAAOvwF,KAAK2d,KAAK42D,UAA6B,CACzF+b,EAAqBC,EACrB,OAIJ,OAAOF,IAAyBC,GAA2C,IAArB/vE,EAAIyY,aAG5D,SAASw3D,EAAmBvwE,EAAOW,EAAI6vE,GACrC,IAA4D58D,EAAW+5D,EAAnExtE,GAAOQ,GAAMX,GAAOI,UAAWhE,GAAOuE,GAAMX,GAAO5D,IACvD,GAAI+D,aAAerE,EAAiBuF,gBAAkBssE,EAAOxtE,EAAI/d,KAAKrC,KAAK2d,KAAK42D,YAC9E,GAAY,QAARqZ,GAA0B,eAARA,EACpB/5D,EAAY4kD,EAAc55E,OAAOwd,EAAK+D,EAAIkH,WACrC,GAAY,OAARsmE,EAAe,CACxB,IAAI8C,EAAQr0E,EAAIE,QAAQ6D,EAAIkH,KAAO,GACnCuM,EAAY4kD,EAAckW,aAAa+B,EAAOA,QACzC,IAAKD,EAAyB,CACnC,IAAIvrF,EAAM2vE,EAAS/uD,IAAI1F,EAAI/d,MAAO4lB,EAAQ7H,EAAIkH,KAAO,EACjDqpE,EAAW1oE,EAAQ/iB,EAAIA,IAAIA,EAAI+c,MAAQ/c,EAAIkf,OAAS,GACxDyP,EAAY4kD,EAAc55E,OAAOwd,EAAK4L,EAAQ,EAAG0oE,SAE1CvwE,aAAerE,EAAiB0E,eAAiBwvE,EAAwB7vE,GAClFyT,EAAY9X,EAAiB0E,cAAc5hB,OAAOwd,EAAK+D,EAAIkH,MAClDlH,aAAerE,EAAiB0E,eAAiB2vE,EAA2BhwE,KACrFyT,EAAY9X,EAAiB0E,cAAc5hB,OAAOwd,EAAK+D,EAAII,MAAMyH,QAAS7H,EAAII,MAAMtZ,QAItF,OAFI2sB,IACCjT,IAAOA,EAAKX,EAAMW,KAAKC,aAAagT,GAClCjT,EAKT,SAASgwE,EAAapuE,EAAKquE,GACzB,IAAIC,EAAYtuE,EAAI2qB,aAAa,iBAC7B4jD,EAASD,GAAa,eAAev9E,KAAKu9E,GAAaA,EAAUznF,MAAM,KAAKnE,KAAI,SAAU0G,GAAK,OAAOvF,OAAOuF,MAAS,KACtHmwE,EAAU11E,OAAOmc,EAAI2qB,aAAa,YAAc,GAChDlrC,EAAS,CACX85E,QAASA,EACTD,QAASz1E,OAAOmc,EAAI2qB,aAAa,YAAc,GAC/C2+C,SAAUiF,GAAUA,EAAO1tF,QAAU04E,EAAUgV,EAAS,MAE1D,IAAK,IAAI/vF,KAAQ6vF,EAAY,CAC3B,IAAIG,EAASH,EAAW7vF,GAAMwsC,WAC1B5rC,EAAQovF,GAAUA,EAAOxuE,GAChB,MAAT5gB,IAAiBK,EAAOjB,GAAQY,GAEtC,OAAOK,EAGT,SAASo6E,EAAah6E,EAAMwuF,GAC1B,IAAIv6D,EAAQ,GAKZ,IAAK,IAAIt1B,KAJiB,GAAtBqB,EAAKi0B,MAAMylD,UAAgBzlD,EAAMylD,QAAU15E,EAAKi0B,MAAMylD,SAChC,GAAtB15E,EAAKi0B,MAAMwlD,UAAgBxlD,EAAMwlD,QAAUz5E,EAAKi0B,MAAMwlD,SACtDz5E,EAAKi0B,MAAMw1D,WACXx1D,EAAM,iBAAmBj0B,EAAKi0B,MAAMw1D,SAAS1nF,KAAK,MACrCysF,EAAY,CAC3B,IAAII,EAASJ,EAAW7vF,GAAM0sC,WAC1BujD,GAAUA,EAAO5uF,EAAKi0B,MAAMt1B,GAAOs1B,GAEzC,OAAOA,EAiCT,SAASolD,EAAWj5E,GAClB,IAAIouF,EAAapuF,EAAQ6qC,gBAAkB,GACvC4jD,EAAY,CACdnV,QAAS,CAAC36E,QAAS,GACnB06E,QAAS,CAAC16E,QAAS,GACnB0qF,SAAU,CAAC1qF,QAAS,OAEtB,IAAK,IAAIJ,KAAQ6vF,EACbK,EAAUlwF,GAAQ,CAACI,QAASyvF,EAAW7vF,GAAMI,SAEjD,MAAO,CACLg+C,MAAO,CACLziC,QAAS,aACT43D,UAAW,QACXt1D,WAAW,EACXqmB,MAAO7iC,EAAQ2qC,WACf7H,SAAU,CAAC,CAAC70B,IAAK,UACjB80B,MAAO,WAAmB,MAAO,CAAC,QAAS,CAAC,QAAS,MAEvD2rD,UAAW,CACTx0E,QAAS,+BACT43D,UAAW,MACXhvC,SAAU,CAAC,CAAC70B,IAAK,OACjB80B,MAAO,WAAmB,MAAO,CAAC,KAAM,KAE1C4rD,WAAY,CACVz0E,QAASla,EAAQ4qC,YACjB/W,MAAO46D,EACP3c,UAAW,OACXt1D,WAAW,EACXsmB,SAAU,CAAC,CAAC70B,IAAK,KAAMupB,SAAU,SAAUzX,GAAO,OAAOouE,EAAapuE,EAAKquE,MAC3ErrD,MAAO,SAAenjC,GAAQ,MAAO,CAAC,KAAMg6E,EAAah6E,EAAMwuF,GAAa,KAE9EQ,aAAc,CACZ10E,QAASla,EAAQ4qC,YACjB/W,MAAO46D,EACP3c,UAAW,cACXt1D,WAAW,EACXsmB,SAAU,CAAC,CAAC70B,IAAK,KAAMupB,SAAU,SAAUzX,GAAO,OAAOouE,EAAapuE,EAAKquE,MAC3ErrD,MAAO,SAAenjC,GAAQ,MAAO,CAAC,KAAMg6E,EAAah6E,EAAMwuF,GAAa,MAKlF,SAASxc,EAAet4C,GACtB,IAAI95B,EAAS85B,EAAOiZ,OAAOq/B,eAC3B,IAAKpyE,EAEH,IAAK,IAAI/C,KADT+C,EAAS85B,EAAOiZ,OAAOq/B,eAAiB,GACvBt4C,EAAOd,MAAO,CAC7B,IAAIj7B,EAAO+7B,EAAOd,MAAM/7B,GAAO0uF,EAAO5tF,EAAK2d,KAAK42D,UAC5CqZ,IAAQ3rF,EAAO2rF,GAAQ5tF,GAG/B,OAAOiC,EAUT,SAASqvF,EAAY/kF,GACnB,IAAKA,EAAM68B,KAAQ,OAAO,KAC1B,IAAIzsB,EAAUpQ,EAAMoQ,QAChB4e,EAAYhvB,EAAMgvB,UAClBC,EAAUjvB,EAAMivB,QACpB,MAA6B,GAAtB7e,EAAQ4B,aAAoBgd,EAAY,GAAKC,EAAU,GAA+C,SAA1C7e,EAAQ9L,WAAW7Q,KAAK2d,KAAK42D,WAC9Fh5C,IACAC,IACA7e,EAAUA,EAAQ9L,WAAW8L,QAE/B,IAAIsa,EAAQta,EAAQ9L,WAAY+8E,EAAO32D,EAAMj3B,KAAK2d,KAAK42D,UACnDx4C,EAAS9E,EAAMj3B,KAAK+7B,OAAQy5C,EAAO,GACvC,GAAY,OAARoY,EACF,IAAK,IAAI/hF,EAAI,EAAGA,EAAI8Q,EAAQ4B,WAAY1S,IAAK,CAC3C,IAAIkpE,EAAQp4D,EAAQ1Y,MAAM4H,GAAG8Q,QACzBuE,EAAOrV,EAAI,EAAI2L,KAAK0Q,IAAI,EAAGqT,EAAY,GACvC/X,EAAQ3X,EAAI8Q,EAAQ4B,WAAa,EAAI,EAAI/G,KAAK0Q,IAAI,EAAGsT,EAAU,IAC/Dta,GAAQsC,KAASuxD,EAAQwc,EAASld,EAAet4C,GAAQm6C,IAAK,IAAIj6D,EAAiBW,MAAMm4D,EAAO7zD,EAAMsC,IAAQ7G,SAClH64D,EAAKjyE,KAAKwxE,OAEP,IAAY,QAAR6Y,GAA0B,eAARA,EAG3B,OAAO,KAFPpY,EAAKjyE,KAAKg4B,GAAaC,EAAU+1D,EAASld,EAAet4C,GAAQm6C,IAAK,IAAIj6D,EAAiBW,MAAMD,EAAS4e,EAAWC,IAAU7e,QAAUA,GAI3I,OAAO60E,EAAkBz1D,EAAQy5C,GAMnC,SAASgc,EAAkBz1D,EAAQy5C,GAEjC,IADA,IAAIub,EAAS,GACJllF,EAAI,EAAGA,EAAI2pE,EAAKnyE,OAAQwI,IAE/B,IADA,IAAIqqE,EAAMV,EAAK3pE,GACN0jC,EAAI2mC,EAAI33D,WAAa,EAAGgxB,GAAK,EAAGA,IAIvC,IAHA,IAAIvuB,EAAMk1D,EAAIjyE,MAAMsrC,GAAGjZ,MACnBwlD,EAAU96D,EAAI86D,QACdC,EAAU/6D,EAAI+6D,QACT0V,EAAI5lF,EAAG4lF,EAAI5lF,EAAIiwE,EAAS2V,IAC7BV,EAAOU,IAAMV,EAAOU,IAAM,GAAK1V,EAIvC,IADA,IAAI95D,EAAQ,EACHyvE,EAAM,EAAGA,EAAMX,EAAO1tF,OAAQquF,IAASzvE,EAAQzK,KAAK0Q,IAAIjG,EAAO8uE,EAAOW,IAC/E,IAAK,IAAIC,EAAM,EAAGA,EAAMZ,EAAO1tF,OAAQsuF,IAErC,GADIA,GAAOnc,EAAKnyE,QAAUmyE,EAAKjyE,KAAK0Y,EAAiB+zB,SAASnzB,OAC1Dk0E,EAAOY,GAAO1vE,EAAO,CAEvB,IADA,IAAIpF,EAAQw3D,EAAet4C,GAAQ85C,KAAK99B,gBAAiBg9B,EAAQ,GACxDhpD,EAAMglE,EAAOY,GAAM5lE,EAAM9J,EAAO8J,IAASgpD,EAAMxxE,KAAKsZ,GAC7D24D,EAAKmc,GAAOnc,EAAKmc,GAAKlrE,OAAOxK,EAAiB+zB,SAAS1oB,KAAKytD,IAGhE,MAAO,CAAC3wD,OAAQoxD,EAAKnyE,OAAQ4e,MAAOA,EAAOuzD,KAAMA,GAGnD,SAAS+b,EAASxgF,EAAUxE,GAC1B,IAAIlK,EAAO0O,EAASgnC,gBAChBn3B,EAAK,IAAIgB,EAAqBumC,UAAU9lD,GAAMR,QAAQ,EAAGQ,EAAKsa,QAAQysB,KAAM78B,GAChF,OAAOqU,EAAGvE,IAOZ,SAASu1E,EAAU5wE,EAAK6wE,EAAUC,GAChC,IAAI7vE,EAAQjB,EAAIiB,MACZmC,EAASpD,EAAIoD,OACboxD,EAAOx0D,EAAIw0D,KAEf,GAAIvzD,GAAS4vE,EAAU,CAErB,IADA,IAAIjnE,EAAQ,GAAImnE,EAAU,GACjB7b,EAAM,EAAGA,EAAMV,EAAKnyE,OAAQ6yE,IAAO,CAE1C,IADA,IAAI5+B,EAAOk+B,EAAKU,GAAMnB,EAAQ,GACrBnT,EAAMh3C,EAAMsrD,IAAQ,EAAGrqE,EAAI,EAAG+1D,EAAMiwB,EAAUhmF,IAAK,CAC1D,IAAIgqE,EAAOv+B,EAAKrzC,MAAM4H,EAAIyrC,EAAK/4B,YAC3BqjD,EAAMiU,EAAKv/C,MAAMylD,QAAU8V,IAC3Bhc,EAAOA,EAAK71E,KAAKnB,OAAO2vF,EAAU3Y,EAAKv/C,MAAOu/C,EAAKv/C,MAAMylD,QAASna,EAAMiU,EAAKv/C,MAAMylD,QAAU8V,GAAWhc,EAAKl5D,UACjHo4D,EAAMxxE,KAAKsyE,GACXjU,GAAOiU,EAAKv/C,MAAMylD,QAClB,IAAK,IAAIxsC,EAAI,EAAGA,EAAIsmC,EAAKv/C,MAAMwlD,QAASvsC,IACpC3kB,EAAMsrD,EAAM3mC,IAAM3kB,EAAMsrD,EAAM3mC,IAAM,GAAKsmC,EAAKv/C,MAAMylD,QAE1DgW,EAAQxuF,KAAK0Y,EAAiB+zB,SAAS1oB,KAAKytD,IAE9CS,EAAOuc,EACP9vE,EAAQ4vE,EAGV,GAAIztE,GAAU0tE,EAAW,CAEvB,IADA,IAAIE,EAAY,GACPC,EAAQ,EAAGlmE,EAAM,EAAGkmE,EAAQH,EAAWG,IAASlmE,IAAO,CAE9D,IADA,IAAImmE,EAAU,GAAIrtF,EAAS2wE,EAAKzpD,EAAM3H,GAC7BmvC,EAAM,EAAGA,EAAM1uD,EAAO0Z,WAAYg1C,IAAO,CAChD,IAAIk5B,EAAS5nF,EAAOZ,MAAMsvD,GACtB0+B,EAAQxF,EAAOn2D,MAAMwlD,QAAUgW,IAC/BrF,EAASA,EAAOzsF,KAAKnB,OAAO0vF,EAAQ9B,EAAOn2D,MAAO,UAAWw7D,EAAYrF,EAAOn2D,MAAMwlD,SAAU2Q,EAAO9vE,UAC3Gu1E,EAAQ3uF,KAAKkpF,GAEfuF,EAAUzuF,KAAK0Y,EAAiB+zB,SAAS1oB,KAAK4qE,IAEhD1c,EAAOwc,EACP5tE,EAAS0tE,EAGX,MAAO,CAAC7vE,MAAOA,EAAOmC,OAAQA,EAAQoxD,KAAMA,GAK9C,SAAS2c,EAAUvxE,EAAI1b,EAAKk6C,EAAOn3B,EAAOhG,EAAOmC,EAAQyB,GACvD,IAAiEhJ,EAAOu1E,EAApEr2D,EAASnb,EAAGvE,IAAIrc,KAAK+7B,OAAQuO,EAAQ+pC,EAAet4C,GACxD,GAAI9Z,EAAQ/c,EAAI+c,MACd,IAAK,IAAIi0D,EAAM,EAAGsX,EAAS,EAAGtX,EAAMhxE,EAAIkf,OAAQ8xD,IAAO,CACrD,IAAI0V,EAAUxsC,EAAMn7C,MAAMiyE,GAC1BsX,GAAU5B,EAAQvoE,SAClB,IAAI0xD,EAAQ,GAAIp0E,OAAM,EAElBA,EADqB,MAArBirF,EAAQltE,WAAqBktE,EAAQltE,UAAU1e,MAAQsqC,EAAMurC,KACvDh5D,IAAUA,EAAQytB,EAAMurC,KAAK99B,iBAE7Bq6C,IAAcA,EAAY9nD,EAAMszC,YAAY7lC,iBACtD,IAAK,IAAIlsC,EAAI3G,EAAI+c,MAAOpW,EAAIoW,EAAOpW,IAAOkpE,EAAMxxE,KAAK5C,GACrDigB,EAAG4xB,OAAO5xB,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAIsoF,EAAS,EAAIvlE,GAAQ8sD,GAGjE,GAAI3wD,EAASlf,EAAIkf,OAAQ,CAEvB,IADA,IAAI8tE,EAAU,GACLnmE,EAAM,EAAGsmE,GAAWntF,EAAIkf,OAAS,GAAKlf,EAAI+c,MAAO8J,EAAMvU,KAAK0Q,IAAIhjB,EAAI+c,MAAOA,GAAQ8J,IAAO,CACjG,IAAI4yB,IAAS5yB,GAAO7mB,EAAI+c,QACpBm9B,EAAM59B,OAAOtc,EAAIA,IAAImtF,EAAUtmE,IAAM/rB,MAAQsqC,EAAMszC,YACvDsU,EAAQ3uF,KAAKo7C,EACCyzC,IAAcA,EAAY9nD,EAAMszC,YAAY7lC,iBAC5Cl7B,IAAUA,EAAQytB,EAAMurC,KAAK99B,kBAI7C,IADA,IAAIu6C,EAAWhoD,EAAM4rC,IAAIr3E,OAAO,KAAMod,EAAiB+zB,SAAS1oB,KAAK4qE,IAAW1c,EAAO,GAC9ExpD,EAAM9mB,EAAIkf,OAAQ4H,EAAM5H,EAAQ4H,IAASwpD,EAAKjyE,KAAK+uF,GAC5D1xE,EAAG4xB,OAAO5xB,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAI+iB,EAAQm3B,EAAM/7B,SAAW,GAAImyD,GAEvE,SAAU34D,IAASu1E,GAMrB,SAASG,EAAkB3xE,EAAI1b,EAAKk6C,EAAOn3B,EAAO/G,EAAMsC,EAAOlgB,EAAKuiB,GAClE,GAAW,GAAPviB,GAAYA,GAAO4B,EAAIkf,OAAU,OAAO,EAE5C,IADA,IAAI4sB,GAAQ,EACH4wB,EAAM1gD,EAAM0gD,EAAMp+C,EAAOo+C,IAAO,CACvC,IAAIj8D,EAAQrC,EAAM4B,EAAI+c,MAAQ2/C,EAAK3kD,EAAM/X,EAAIA,IAAIS,GACjD,GAAIT,EAAIA,IAAIS,EAAQT,EAAI+c,QAAUhF,EAAK,CACrC+zB,GAAQ,EACR,IAAI6kC,EAAOz2B,EAAM59B,OAAOvE,GACpB+D,EAAM9b,EAAI4wE,SAAS74D,GACnBu1E,EAAUxxE,EAAI1d,IACdmvF,EAAWzxE,EAAIE,KACnBN,EAAG2b,cAAc3b,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAI+X,EAAMgL,GAAQ,KAAMsmE,EAAQ1Y,EAAKv/C,MAAO,UAAWhzB,EAAMkvF,IACxG5xE,EAAG4xB,OAAO5xB,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAIA,EAAIooF,WAAWhqF,EAAKmvF,EAAUrzC,IAC5Dy2B,EAAK71E,KAAK+3C,cAAcw2C,EAAQ1Y,EAAKv/C,MAAO,UAAYk8D,EAAU3c,EAAKv/C,MAAMwlD,QAAWx4E,KAClGs+D,GAAOiU,EAAKv/C,MAAMylD,QAAU,GAGhC,OAAO/qC,EAMT,SAAS0hD,EAAgB9xE,EAAI1b,EAAKk6C,EAAOn3B,EAAO3kB,EAAKigB,EAAQrC,EAAM2E,GACjE,GAAY,GAAR3E,GAAaA,GAAQhc,EAAI+c,MAAS,OAAO,EAE7C,IADA,IAAI+uB,GAAQ,EACHklC,EAAM5yE,EAAK4yE,EAAM3yD,EAAQ2yD,IAAO,CACvC,IAAIvwE,EAAQuwE,EAAMhxE,EAAI+c,MAAQf,EAAMjE,EAAM/X,EAAIA,IAAIS,GAClD,GAAIT,EAAIA,IAAIS,EAAQ,IAAMsX,EAAK,CAC7B+zB,GAAQ,EACR,IAAI6kC,EAAOz2B,EAAM59B,OAAOvE,GAAMw1E,EAAWvtF,EAAI0nF,SAAS3vE,GAClD01E,EAAY/xE,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAI+X,EAAMgL,GACpDrH,EAAG2b,cAAco2D,EAAW,KAAMnE,EAAU3Y,EAAKv/C,MAAOpV,EAAOuxE,EAAU5c,EAAKv/C,MAAMylD,SAAW76D,EAAOuxE,KACtG7xE,EAAG4xB,OAAOmgD,EAAY9c,EAAKxyD,SAAUwyD,EAAK71E,KAAK+3C,cAAcy2C,EAAU3Y,EAAKv/C,MAAO,EAAGpV,EAAOuxE,KAC7Fvc,GAAOL,EAAKv/C,MAAMwlD,QAAU,GAGhC,OAAO9qC,EAKT,SAAS4hD,EAAY3yE,EAAOC,EAAUi6D,EAAYn3D,EAAM+xD,GACtD,IAAI31B,EAAQ+6B,EAAal6D,EAAM5D,IAAImF,OAAO24D,EAAa,GAAKl6D,EAAM5D,IAAKnX,EAAM2vE,EAAS/uD,IAAIs5B,GACtF97C,EAAM0f,EAAK1f,IACX4d,EAAO8B,EAAK9B,KACZsC,EAAQtC,EAAO6zD,EAAM9yD,MAAOsB,EAASjgB,EAAMyxE,EAAM3wD,OACjDxD,EAAKX,EAAMW,GAAIiF,EAAU,EAC7B,SAASgtE,IACPzzC,EAAQ+6B,EAAav5D,EAAGvE,IAAImF,OAAO24D,EAAa,GAAKv5D,EAAGvE,IACxDnX,EAAM2vE,EAAS/uD,IAAIs5B,GACnBv5B,EAAUjF,EAAGtE,QAAQ0J,KAAK3iB,OAMxB8uF,EAAUvxE,EAAI1b,EAAKk6C,EAAO+6B,EAAY32D,EAAOD,EAAQsC,IAAYgtE,IACjEN,EAAkB3xE,EAAI1b,EAAKk6C,EAAO+6B,EAAYj5D,EAAMsC,EAAOlgB,EAAKuiB,IAAYgtE,IAC5EN,EAAkB3xE,EAAI1b,EAAKk6C,EAAO+6B,EAAYj5D,EAAMsC,EAAOD,EAAQsC,IAAYgtE,IAC/EH,EAAgB9xE,EAAI1b,EAAKk6C,EAAO+6B,EAAY72E,EAAKigB,EAAQrC,EAAM2E,IAAYgtE,IAC3EH,EAAgB9xE,EAAI1b,EAAKk6C,EAAO+6B,EAAY72E,EAAKigB,EAAQC,EAAOqC,IAAYgtE,IAEhF,IAAK,IAAI3c,EAAM5yE,EAAK4yE,EAAM3yD,EAAQ2yD,IAAO,CACvC,IAAI5uD,EAAOpiB,EAAIooF,WAAWpX,EAAKh1D,EAAMk+B,GAAQ73B,EAAKriB,EAAIooF,WAAWpX,EAAK1yD,EAAO47B,GAC7Ex+B,EAAG/e,QAAQ+e,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAIoiB,EAAO6yD,GAAav5D,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAIqiB,EAAK4yD,GACrF,IAAIl+D,EAAiBW,MAAMm4D,EAAMS,KAAKU,EAAM5yE,GAAM,EAAG,IAElEuvF,IACAjyE,EAAGC,aAAa,IAAI43D,EAAc73D,EAAGvE,IAAIE,QAAQ49D,EAAaj1E,EAAIooF,WAAWhqF,EAAK4d,EAAMk+B,IACtDx+B,EAAGvE,IAAIE,QAAQ49D,EAAaj1E,EAAIooF,WAAW/pE,EAAS,EAAGC,EAAQ,EAAG47B,MACpGl/B,EAASU,GA5aXmvE,EAAax7E,UAAUrP,IAAM,SAAcoX,GACzC,OAAO,IAAIyzE,EAAazzE,EAAQpX,IAAIzD,KAAK6b,QAAShB,EAAQpX,IAAIzD,KAAK+a,QAErEuzE,EAAax7E,UAAUgI,QAAU,SAAkBF,GACjD,IAAIy4D,EAAcz4D,EAAIE,QAAQ9a,KAAK6b,QAAS63D,EAAY94D,EAAIE,QAAQ9a,KAAK+a,MACzE,MAA8C,OAA1Cs4D,EAAY1rE,OAAOpJ,KAAK2d,KAAK42D,WACW,OAAxCY,EAAU/rE,OAAOpJ,KAAK2d,KAAK42D,WAC3BO,EAAYnvE,QAAUmvE,EAAY1rE,OAAOmV,YACzC42D,EAAUxvE,QAAUwvE,EAAU/rE,OAAOmV,YACrC4vE,EAAYrZ,EAAaK,GAClB,IAAIsD,EAAc3D,EAAaK,GAE/Bp5D,EAAiB6C,UAAUlC,KAAKy4D,EAAW,IAqaxD,IAAIv1D,EAAgB9D,EAAkB+D,eAAe,CACnD,UAAaC,GAAM,SAAU,GAC7B,WAAcA,GAAM,QAAS,GAC7B,QAAWA,GAAM,QAAS,GAC1B,UAAaA,GAAM,OAAQ,GAE3B,kBAAmBgzE,GAAW,SAAU,GACxC,mBAAoBA,GAAW,QAAS,GACxC,gBAAiBA,GAAW,QAAS,GACrC,kBAAmBA,GAAW,OAAQ,GAEtC,UAAaC,GACb,gBAAiBA,GACjB,OAAUA,GACV,aAAcA,KAGhB,SAASC,GAAkB/yE,EAAOC,EAAUG,GAC1C,OAAIA,EAAUvD,GAAGmD,EAAMI,aACnBH,GAAYA,EAASD,EAAMW,GAAGC,aAAaR,GAAW0K,mBACnD,GAGT,SAASjL,GAAMC,EAAM9B,GACnB,OAAO,SAAUgC,EAAOC,EAAUC,GAChC,IAAIC,EAAMH,EAAMI,UAChB,GAAID,aAAeq4D,EACjB,OAAOua,GAAkB/yE,EAAOC,EAAUnE,EAAiB6C,UAAUlC,KAAK0D,EAAI+0D,UAAWl3D,IAE3F,GAAY,SAAR8B,IAAoBK,EAAIvD,MAAS,OAAO,EAC5C,IAAI3V,EAAM+rF,GAAY9yE,EAAMJ,EAAM9B,GAClC,GAAW,MAAP/W,EAAe,OAAO,EAC1B,GAAY,SAAR6Y,EACF,OAAOizE,GAAkB/yE,EAAOC,EAAUnE,EAAiB6C,UAAUlC,KAAKuD,EAAM5D,IAAIE,QAAQ6D,EAAI5D,KAAOyB,GAAMA,IAE7G,IAAwE2/C,EAApE8yB,EAAQzwE,EAAM5D,IAAIE,QAAQrV,GAAMw4D,EAAQmtB,EAAS6D,EAAO3wE,EAAM9B,GAIlE,OAHa2/C,EAAT8B,EAAkB3jD,EAAiB6C,UAAUlC,KAAKgjD,EAAO,GACpDzhD,EAAM,EAAclC,EAAiB6C,UAAUlC,KAAKuD,EAAM5D,IAAIE,QAAQm0E,EAAMznF,QAAQ,KAAM,GACnF8S,EAAiB6C,UAAUlC,KAAKuD,EAAM5D,IAAIE,QAAQm0E,EAAMxxE,OAAO,IAAK,GAC7E8zE,GAAkB/yE,EAAOC,EAAU09C,IAKhD,SAASk1B,GAAW/yE,EAAM9B,GACxB,OAAO,SAAUgC,EAAOC,EAAUC,GAChC,IAAIC,EAAMH,EAAMI,UAChB,KAAMD,aAAeq4D,GAAgB,CACnC,IAAIvxE,EAAM+rF,GAAY9yE,EAAMJ,EAAM9B,GAClC,GAAW,MAAP/W,EAAe,OAAO,EAC1BkZ,EAAM,IAAIq4D,EAAcx4D,EAAM5D,IAAIE,QAAQrV,IAE5C,IAAIwY,EAAQmtE,EAASzsE,EAAI+0D,UAAWp1D,EAAM9B,GAC1C,QAAKyB,GACEszE,GAAkB/yE,EAAOC,EAAU,IAAIu4D,EAAcr4D,EAAI00D,YAAap1D,KAIjF,SAASqzE,GAAoB9yE,EAAOC,GAClC,IAAIE,EAAMH,EAAMI,UAChB,KAAMD,aAAeq4D,GAAkB,OAAO,EAC9C,GAAIv4D,EAAU,CACZ,IAAIU,EAAKX,EAAMW,GAAIsyE,EAAc7e,EAAep0D,EAAM8b,QAAQ85C,KAAK99B,gBAAgBp7B,QACnFyD,EAAI+uE,aAAY,SAAUtZ,EAAM54D,GACzB44D,EAAKl5D,QAAQG,GAAGo2E,IACjBtyE,EAAG/e,QAAQ+e,EAAGtE,QAAQpX,IAAI+X,EAAM,GAAI2D,EAAGtE,QAAQpX,IAAI+X,EAAM44D,EAAKxyD,SAAW,GAChE,IAAIpH,EAAiBW,MAAMs2E,EAAa,EAAG,OAEtDtyE,EAAGyJ,YAAcnK,EAASU,GAEhC,OAAO,EAGT,SAASqlD,GAAkB9lD,EAAMlD,GAC/B,IAAIZ,EAAM8D,EAAKF,MAAM5D,IAAKq0E,EAAQhD,EAAWrxE,EAAIE,QAAQU,IACzD,QAAKyzE,IACLvwE,EAAKD,SAASC,EAAKF,MAAMW,GAAGC,aAAa,IAAI43D,EAAciY,MACpD,GAGT,SAASnoD,GAAYpoB,EAAM0xB,EAAGtlC,GAC5B,IAAKshF,EAAU1tE,EAAKF,OAAU,OAAO,EACrC,IAAI80D,EAAQuc,EAAY/kF,GAAQ6T,EAAMD,EAAKF,MAAMI,UACjD,GAAID,aAAeq4D,EAAe,CAC3B1D,IAASA,EAAQ,CAAC9yD,MAAO,EAAGmC,OAAQ,EAAGoxD,KAAM,CAACv5D,EAAiB+zB,SAAS1oB,KAAKiqE,EAASld,EAAel0D,EAAKF,MAAM8b,QAAQ85C,KAAMtpE,OACnI,IAAI6yC,EAAQh/B,EAAI00D,YAAYzyE,MAAM,GAAI4lB,EAAQ7H,EAAI00D,YAAY7sD,OAAO,GACjEjF,EAAO6xD,EAAS/uD,IAAIs5B,GAAO81B,YAAY90D,EAAI00D,YAAY73D,IAAMgL,EAAO7H,EAAI+0D,UAAUl4D,IAAMgL,GAG5F,OAFA8sD,EAAQ6c,EAAU7c,EAAO/xD,EAAKQ,MAAQR,EAAK9B,KAAM8B,EAAKO,OAASP,EAAK1f,KACpEsvF,EAAYzyE,EAAKF,MAAOE,EAAKD,SAAU+H,EAAOjF,EAAM+xD,IAC7C,EACF,GAAIA,EAAO,CAChB,IAAI2b,EAAQ5C,EAAc3tE,EAAKF,OAAQoyE,EAAU3B,EAAMzoE,OAAO,GAE9D,OADA2qE,EAAYzyE,EAAKF,MAAOE,EAAKD,SAAUmyE,EAASxd,EAAS/uD,IAAI4qE,EAAMruF,MAAM,IAAIyzE,SAAS4a,EAAMzzE,IAAMo1E,GAAUtd,IACrG,EAEP,OAAO,EAIX,SAASoe,GAAgBhzE,EAAMizE,GAC7B,IAAIA,EAAWlgE,UAAWkgE,EAAWhgE,QAArC,CAEA,IAAuD3T,EAAnD4zE,EAAeC,GAAUnzE,EAAMizE,EAAW3uE,QAC9C,GAAI2uE,EAAW//D,UAAalT,EAAKF,MAAMI,qBAAqBo4D,EAE1D8a,EAAiBpzE,EAAKF,MAAMI,UAAUy0D,YAAase,GACnDA,EAAWr9D,sBACN,GAAIq9D,EAAW//D,UAAYggE,GACiC,OAAvD5zE,EAAUiuE,EAAWvtE,EAAKF,MAAMI,UAAUZ,WAC3C+zE,GAAerzE,EAAMizE,GAAYn2E,KAAOwC,EAAQxC,IAGzDs2E,EAAiB9zE,EAAS2zE,GAC1BA,EAAWr9D,sBACN,IAAKs9D,EAEV,OAwCFlzE,EAAK1b,KAAK8W,iBAAiB,UAAWg5C,GACtCp0C,EAAK1b,KAAK8W,iBAAiB,YAAag5C,GACxCp0C,EAAK1b,KAAK8W,iBAAiB,YAAaukD,GArCxC,SAASyzB,EAAiB9zE,EAASxO,GACjC,IAAIyO,EAAQ8zE,GAAerzE,EAAMlP,GAC7BwiF,EAAuC,MAA5BvxF,EAAIspB,SAASrL,EAAKF,OACjC,IAAKP,IAAUyuE,EAAY1uE,EAASC,GAAQ,CAC1C,IAAI+zE,EACG,OADS/zE,EAAQD,EAG1B,IAAIY,EAAY,IAAIo4D,EAAch5D,EAASC,GAC3C,GAAI+zE,IAAatzE,EAAKF,MAAMI,UAAUvD,GAAGuD,GAAY,CACnD,IAAIO,EAAKT,EAAKF,MAAMW,GAAGC,aAAaR,GAChCozE,GAAY7yE,EAAGkK,QAAQ5oB,EAAKud,EAAQxC,KACxCkD,EAAKD,SAASU,IAKlB,SAAS2zC,IACPp0C,EAAK1b,KAAKie,oBAAoB,UAAW6xC,GACzCp0C,EAAK1b,KAAKie,oBAAoB,YAAa6xC,GAC3Cp0C,EAAK1b,KAAKie,oBAAoB,YAAao9C,GACX,MAA5B59D,EAAIspB,SAASrL,EAAKF,QAAkBE,EAAKD,SAASC,EAAKF,MAAMW,GAAGkK,QAAQ5oB,GAAM,IAGpF,SAAS49D,EAAK7uD,GACZ,IAAuCwO,EAAnCnC,EAASpb,EAAIspB,SAASrL,EAAKF,OAC/B,GAAc,MAAV3C,EAEFmC,EAAUU,EAAKF,MAAM5D,IAAIE,QAAQe,QAC5B,GAAIg2E,GAAUnzE,EAAMlP,EAAMwT,SAAW4uE,IAE1C5zE,EAAU+zE,GAAerzE,EAAMizE,IAC1B3zE,GAAW,OAAO80C,IAErB90C,GAAW8zE,EAAiB9zE,EAASxO,IAS7C,SAASgiF,GAAY9yE,EAAMJ,EAAM9B,GAC/B,KAAMkC,EAAKF,MAAMI,qBAAqBtE,EAAiB0E,eAAkB,OAAO,KAGhF,IAFA,IAAIO,EAAMb,EAAKF,MAAMI,UACjBX,EAAQsB,EAAItB,MACPtB,EAAIsB,EAAMrB,MAAQ,EAAGD,GAAK,EAAGA,IAAK,CACzC,IAAIhV,EAASsW,EAAMrd,KAAK+b,GAAIzY,EAAQsY,EAAM,EAAIyB,EAAM/Z,MAAMyY,GAAKsB,EAAMpB,WAAWF,GAChF,GAAIzY,IAAUsY,EAAM,EAAI,EAAI7U,EAAOmV,YAAe,OAAO,KACzD,GAAkC,QAA9BnV,EAAOpJ,KAAK2d,KAAK42D,WAAqD,eAA9BnrE,EAAOpJ,KAAK2d,KAAK42D,UAA4B,CACvF,IAAIqB,EAAUl2D,EAAMzW,OAAOmV,GACvB4B,EAAiB,QAARD,EAAkB9B,EAAM,EAAI,OAAS,KAASA,EAAM,EAAI,QAAU,OAC/E,OAAOkC,EAAKO,eAAeV,GAAU41D,EAAU,MAGnD,OAAO,KAGT,SAAS0d,GAAUnzE,EAAMqC,GACvB,KAAOA,GAAOA,GAAOrC,EAAKqC,IAAKA,EAAMA,EAAI7O,WACrC,GAAoB,MAAhB6O,EAAI7R,UAAoC,MAAhB6R,EAAI7R,SAAoB,OAAO6R,EAGjE,SAASgxE,GAAerzE,EAAMlP,GAC5B,IAAIyiF,EAAWvzE,EAAKc,YAAY,CAACC,KAAMjQ,EAAMkQ,QAAS7d,IAAK2N,EAAMmQ,UACjE,OAAKsyE,GACEA,EAAWhG,EAAWvtE,EAAKF,MAAM5D,IAAIE,QAAQm3E,EAASz2E,MADrC,KAM1B,IAAI02E,GAAe,IAAI53E,EAAiBqP,UAAU,cAKlD,SAASwoE,GAAmBt0B,EAAKluB,EAAKnrC,EAAQiqC,GAC5C,IAAI2vC,EAAUvgB,EAAI/gD,WAAYs1E,EAAUziD,EAAI7yB,WAC5C6jE,EAAO,IAAK,IAAIv2E,EAAI,EAAG0jC,EAAI,EAAG1jC,EAAIgoF,EAAShoF,IAAK,CAE9C,IADA,IAAI5H,EAAQmtC,EAAIntC,MAAM4H,GACbwsC,EAAO9I,EAAGhtB,EAAI/K,KAAK8Q,IAAIu3D,EAASh0E,EAAI,GAAIwsC,EAAO91B,EAAG81B,IACzD,GAAIinB,EAAIr7D,MAAMo0C,IAASp0C,EAAO,CAC5BsrC,EAAI8I,EAAO,EACXpyC,GAAUhC,EAAMof,SAChB,SAAS++D,EAGblyC,EAAEjsC,EAAOgC,GACLspC,EAAIswC,GAAWvgB,EAAIr7D,MAAMsrC,GAAGD,WAAWrrC,GACvC2vF,GAAmBt0B,EAAIr7D,MAAMsrC,GAAItrC,EAAOgC,EAAS,EAAGiqC,GAEpDjsC,EAAM00B,aAAa,EAAG10B,EAAM0Y,QAAQysB,KAAM8G,EAAGjqC,EAAS,GAC1DA,GAAUhC,EAAMof,UAUpB,SAASywE,GAAU7zE,EAAOopC,GACxB,IAAIzoC,EAAI21B,EAAQ,SAAUl0C,EAAM4a,GACE,SAA5B5a,EAAKrC,KAAK2d,KAAK42D,YAAwB3zD,EAAKmzE,GAAS9zE,EAAO5d,EAAM4a,EAAK2D,KAI7E,OAFKyoC,EACIA,EAAShtC,KAAO4D,EAAM5D,KAAOu3E,GAAmBvqC,EAAShtC,IAAK4D,EAAM5D,IAAK,EAAGk6B,GADpEt2B,EAAM5D,IAAI+zB,YAAYmG,GAEhC31B,EAMT,SAASmzE,GAAS9zE,EAAOm/B,EAAO40C,EAAUpzE,GACxC,IAAI1b,EAAM2vE,EAAS/uD,IAAIs5B,GACvB,IAAKl6C,EAAIqmF,SAAY,OAAO3qE,EACvBA,IAAMA,EAAKX,EAAMW,IAKtB,IADA,IAkBIqW,EAAOlO,EAlBPkrE,EAAU,GACLpoF,EAAI,EAAGA,EAAI3G,EAAIkf,OAAQvY,IAAOooF,EAAQ1wF,KAAK,GACpD,IAAK,IAAIwoB,EAAM,EAAGA,EAAM7mB,EAAIqmF,SAASloF,OAAQ0oB,IAAO,CAClD,IAAImoE,EAAOhvF,EAAIqmF,SAASx/D,GACxB,GAAiB,aAAbmoE,EAAKl0F,KAAqB,CAE5B,IADA,IAAI61E,EAAOz2B,EAAM59B,OAAO0yE,EAAKj3E,KACpBsyB,EAAI,EAAGA,EAAIsmC,EAAKv/C,MAAMwlD,QAASvsC,IAAO0kD,EAAQC,EAAKhe,IAAM3mC,IAAM2kD,EAAK1uE,EAC7E5E,EAAG2b,cAAc3b,EAAGtE,QAAQpX,IAAI8uF,EAAW,EAAIE,EAAKj3E,KAAM,KAAMuxE,EAAU3Y,EAAKv/C,MAAOu/C,EAAKv/C,MAAMylD,QAAUmY,EAAK1uE,EAAG0uE,EAAK1uE,SACnH,GAAiB,WAAb0uE,EAAKl0F,KACdi0F,EAAQC,EAAKhe,MAAQge,EAAK1uE,OACrB,GAAiB,oBAAb0uE,EAAKl0F,KAA4B,CAC1C,IAAIysF,EAASrtC,EAAM59B,OAAO0yE,EAAKj3E,KAC/B2D,EAAG2b,cAAc3b,EAAGtE,QAAQpX,IAAI8uF,EAAW,EAAIE,EAAKj3E,KAAM,KAAMsxE,EAAQ9B,EAAOn2D,MAAO,UAAWm2D,EAAOn2D,MAAMwlD,QAAUoY,EAAK1uE,SACxH,GAAiB,qBAAb0uE,EAAKl0F,KAA6B,CAC3C,IAAIm0F,EAAS/0C,EAAM59B,OAAO0yE,EAAKj3E,KAC/B2D,EAAG2b,cAAc3b,EAAGtE,QAAQpX,IAAI8uF,EAAW,EAAIE,EAAKj3E,KAAM,KAAMsxE,EAAQ4F,EAAO79D,MAAO,WAAY49D,EAAKpI,YAI3G,IAAK,IAAI9/D,EAAM,EAAGA,EAAMioE,EAAQ5wF,OAAQ2oB,IAAaioE,EAAQjoE,KAC9C,MAATiL,IAAiBA,EAAQjL,GAC7BjD,EAAOiD,GAMT,IAAK,IAAIstC,EAAM,EAAGr8C,EAAM+2E,EAAW,EAAG16B,EAAMp0D,EAAIkf,OAAQk1C,IAAO,CAC7D,IAAI4c,EAAM92B,EAAMn7C,MAAMq1D,GAClBpyD,EAAM+V,EAAMi5D,EAAI7yD,SAChB1iB,EAAMszF,EAAQ36B,GAClB,GAAI34D,EAAM,EAAG,CACX,IAAIyzF,EAAgB,OAChBle,EAAIrlE,aACNujF,EAAgBle,EAAIrlE,WAAW7Q,KAAK2d,KAAK42D,WAG3C,IADA,IAAIt5C,EAAQ,GACHs4B,EAAM,EAAGA,EAAM5yD,EAAK4yD,IACzBt4B,EAAM13B,KAAK8wE,EAAep0D,EAAM8b,QAAQq4D,GAAer8C,iBAC3D,IAAIrM,EAAe,GAAP4tB,GAAYriC,GAASqiC,EAAM,GAAMvwC,GAAQuwC,EAAgBpyD,EAAM,EAAhB+V,EAAM,EACjE2D,EAAG4xB,OAAO5xB,EAAGtE,QAAQpX,IAAIwmC,GAAOzQ,GAElChe,EAAM/V,EAER,OAAO0Z,EAAGkK,QAAQ6oE,GAAc,CAAEG,WAAW,IAQ/C,SAASO,GAAap0E,GACpB,IAEI+C,EAFA5C,EAAMH,EAAMI,UAAWjE,EAAO0xE,EAAc7tE,GAC5Cm/B,EAAQhjC,EAAK/Z,MAAM,GAAI83E,EAAa/9D,EAAK6L,OAAO,GAAI/iB,EAAM2vE,EAAS/uD,IAAIs5B,GAS3E,OANIp8B,EADA5C,aAAeq4D,EACRvzE,EAAIgwE,YAAY90D,EAAI00D,YAAY73D,IAAMk9D,EAAY/5D,EAAI+0D,UAAUl4D,IAAMk9D,GAEtEj1E,EAAI4wE,SAAS15D,EAAKa,IAAMk9D,GACnCn3D,EAAKm3D,WAAaA,EAClBn3D,EAAK9d,IAAMA,EACX8d,EAAKo8B,MAAQA,EACNp8B,EAGT,SAASsxE,GAAepvF,EAAKk6C,EAAOwiB,GAElC,IADA,IAAI2yB,EAAalgB,EAAej1B,EAAMp/C,KAAK+7B,QAAQ6hD,YAC1C1H,EAAM,EAAGA,EAAMhxE,EAAIkf,OAAQ8xD,IAChC,GAAI92B,EAAM59B,OAAOtc,EAAIA,IAAI08D,EAAMsU,EAAMhxE,EAAI+c,QAAQjiB,MAAQu0F,EACvD,OAAO,EACb,OAAO,EAIT,SAASra,GAAUt5D,EAAII,EAAK4gD,GAC1B,IAAI18D,EAAM8b,EAAI9b,IACVi1E,EAAan5D,EAAIm5D,WACjB/6B,EAAQp+B,EAAIo+B,MAEZo1C,EAAY5yB,EAAM,GAAK,EAAI,EAC3B0yB,GAAepvF,EAAKk6C,EAAOwiB,EAAM4yB,KACjCA,EAAmB,GAAP5yB,GAAYA,GAAO18D,EAAI+c,MAAQ,KAAO,GAEtD,IAAK,IAAIi0D,EAAM,EAAGA,EAAMhxE,EAAIkf,OAAQ8xD,IAAO,CACzC,IAAIvwE,EAAQuwE,EAAMhxE,EAAI+c,MAAQ2/C,EAE9B,GAAIA,EAAM,GAAKA,EAAM18D,EAAI+c,OAAS/c,EAAIA,IAAIS,EAAQ,IAAMT,EAAIA,IAAIS,GAAQ,CACtE,IAAIsX,EAAM/X,EAAIA,IAAIS,GAAQkwE,EAAOz2B,EAAM59B,OAAOvE,GAC9C2D,EAAG2b,cAAc3b,EAAGtE,QAAQpX,IAAIi1E,EAAal9D,GAAM,KAClCwxE,EAAW5Y,EAAKv/C,MAAOsrC,EAAM18D,EAAI0nF,SAAS3vE,KAE3Di5D,GAAOL,EAAKv/C,MAAMwlD,QAAU,MACvB,CACL,IAAI97E,EAAoB,MAAbw0F,EAAoBngB,EAAej1B,EAAMp/C,KAAK+7B,QAAQ85C,KAC3Dz2B,EAAM59B,OAAOtc,EAAIA,IAAIS,EAAQ6uF,IAAYx0F,KAC3CivD,EAAQ/pD,EAAIooF,WAAWpX,EAAKtU,EAAKxiB,GACrCx+B,EAAG4xB,OAAO5xB,EAAGtE,QAAQpX,IAAIi1E,EAAalrB,GAAQjvD,EAAK+3C,kBAGvD,OAAOn3B,EAKT,SAAS6zE,GAAgBx0E,EAAOC,GAC9B,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAI8C,EAAOqxE,GAAap0E,GACxBC,EAASg6D,GAAUj6D,EAAMW,GAAIoC,EAAMA,EAAK9B,OAE1C,OAAO,EAKT,SAASwzE,GAAez0E,EAAOC,GAC7B,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAI8C,EAAOqxE,GAAap0E,GACxBC,EAASg6D,GAAUj6D,EAAMW,GAAIoC,EAAMA,EAAKQ,QAE1C,OAAO,EAGT,SAASg5D,GAAa57D,EAAII,EAAK4gD,GAM7B,IALA,IAAI18D,EAAM8b,EAAI9b,IACVk6C,EAAQp+B,EAAIo+B,MACZ+6B,EAAan5D,EAAIm5D,WAEjBwa,EAAW/zE,EAAGtE,QAAQ0J,KAAK3iB,OACtB6yE,EAAM,EAAGA,EAAMhxE,EAAIkf,QAAS,CACnC,IAAIze,EAAQuwE,EAAMhxE,EAAI+c,MAAQ2/C,EAAK3kD,EAAM/X,EAAIA,IAAIS,GAAQkwE,EAAOz2B,EAAM59B,OAAOvE,GAE7E,GAAK2kD,EAAM,GAAK18D,EAAIA,IAAIS,EAAQ,IAAMsX,GAAS2kD,EAAM18D,EAAI+c,MAAQ,GAAK/c,EAAIA,IAAIS,EAAQ,IAAMsX,EAC1F2D,EAAG2b,cAAc3b,EAAGtE,QAAQ/P,MAAMooF,GAAUzvF,IAAIi1E,EAAal9D,GAAM,KAClDuxE,EAAU3Y,EAAKv/C,MAAOsrC,EAAM18D,EAAI0nF,SAAS3vE,SACrD,CACL,IAAIgL,EAAQrH,EAAGtE,QAAQ/P,MAAMooF,GAAUzvF,IAAIi1E,EAAal9D,GACxD2D,EAAGpgB,OAAOynB,EAAOA,EAAQ4tD,EAAKxyD,UAEhC6yD,GAAOL,EAAKv/C,MAAMwlD,SAMtB,SAAS8Y,GAAa30E,EAAOC,GAC3B,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAI8C,EAAOqxE,GAAap0E,GAAQW,EAAKX,EAAMW,GAC3C,GAAiB,GAAboC,EAAK9B,MAAa8B,EAAKQ,OAASR,EAAK9d,IAAI+c,MAAS,OAAO,EAC7D,IAAK,IAAIpW,EAAImX,EAAKQ,MAAQ,GAAI3X,IAAK,CAEjC,GADA2wE,GAAa57D,EAAIoC,EAAMnX,GACnBA,GAAKmX,EAAK9B,KAAQ,MACtB8B,EAAKo8B,MAAQp8B,EAAKm3D,WAAav5D,EAAGvE,IAAImF,OAAOwB,EAAKm3D,WAAa,GAAKv5D,EAAGvE,IACvE2G,EAAK9d,IAAM2vE,EAAS/uD,IAAI9C,EAAKo8B,OAE/Bl/B,EAASU,GAEX,OAAO,EAGT,SAASi0E,GAAY3vF,EAAKk6C,EAAO82B,GAE/B,IADA,IAAIqe,EAAalgB,EAAej1B,EAAMp/C,KAAK+7B,QAAQ6hD,YAC1Chc,EAAM,EAAGA,EAAM18D,EAAI+c,MAAO2/C,IAC/B,GAAIxiB,EAAM59B,OAAOtc,EAAIA,IAAI08D,EAAMsU,EAAMhxE,EAAI+c,QAAQjiB,MAAQu0F,EACvD,OAAO,EACb,OAAO,EAGT,SAAS9Y,GAAO76D,EAAII,EAAKk1D,GAMvB,IALA,IAAIhxE,EAAM8b,EAAI9b,IACVi1E,EAAan5D,EAAIm5D,WACjB/6B,EAAQp+B,EAAIo+B,MAEZu8B,EAASxB,EACJtuE,EAAI,EAAGA,EAAIqqE,EAAKrqE,IAAO8vE,GAAUv8B,EAAMn7C,MAAM4H,GAAGwX,SACzD,IAAI0xD,EAAQ,GAAI+f,EAAS5e,EAAM,GAAK,EAAI,EACpC2e,GAAY3vF,EAAKk6C,EAAO82B,EAAM4e,KAC9BA,EAAgB,GAAP5e,GAAYA,GAAOhxE,EAAIkf,OAAS,KAAO,GACpD,IAAK,IAAIw9C,EAAM,EAAGj8D,EAAQT,EAAI+c,MAAQi0D,EAAKtU,EAAM18D,EAAI+c,MAAO2/C,IAAOj8D,IAEjE,GAAIuwE,EAAM,GAAKA,EAAMhxE,EAAIkf,QAAUlf,EAAIA,IAAIS,IAAUT,EAAIA,IAAIS,EAAQT,EAAI+c,OAAQ,CAC/E,IAAIhF,EAAM/X,EAAIA,IAAIS,GAAQ2wB,EAAQ8oB,EAAM59B,OAAOvE,GAAKqZ,MACpD1V,EAAG2b,cAAc49C,EAAal9D,EAAK,KAAMsxE,EAAQj4D,EAAO,UAAWA,EAAMwlD,QAAU,IACnFla,GAAOtrC,EAAMylD,QAAU,MAClB,CACL,IAAI/7E,EAAiB,MAAV80F,EAAiBzgB,EAAej1B,EAAMp/C,KAAK+7B,QAAQ85C,KACxDz2B,EAAM59B,OAAOtc,EAAIA,IAAIS,EAAQmvF,EAAS5vF,EAAI+c,QAAQjiB,KACxD+0E,EAAMxxE,KAAKvD,EAAK+3C,iBAIpB,OADAn3B,EAAG4xB,OAAOmpC,EAAQtH,EAAej1B,EAAMp/C,KAAK+7B,QAAQm6C,IAAIr3E,OAAO,KAAMk2E,IAC9Dn0D,EAKT,SAASm0E,GAAa90E,EAAOC,GAC3B,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAI8C,EAAOqxE,GAAap0E,GACxBC,EAASu7D,GAAOx7D,EAAMW,GAAIoC,EAAMA,EAAK1f,MAEvC,OAAO,EAKT,SAAS0xF,GAAY/0E,EAAOC,GAC1B,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAI8C,EAAOqxE,GAAap0E,GACxBC,EAASu7D,GAAOx7D,EAAMW,GAAIoC,EAAMA,EAAKO,SAEvC,OAAO,EAGT,SAASm5D,GAAU97D,EAAII,EAAKk1D,GAM1B,IALA,IAAIhxE,EAAM8b,EAAI9b,IACVk6C,EAAQp+B,EAAIo+B,MACZ+6B,EAAan5D,EAAIm5D,WAEjBwB,EAAS,EACJ9vE,EAAI,EAAGA,EAAIqqE,EAAKrqE,IAAO8vE,GAAUv8B,EAAMn7C,MAAM4H,GAAGwX,SACzD,IAAI4xE,EAAUtZ,EAASv8B,EAAMn7C,MAAMiyE,GAAK7yD,SAEpCwC,EAAUjF,EAAGtE,QAAQ0J,KAAK3iB,OAC9Bud,EAAGpgB,OAAOm7E,EAASxB,EAAY8a,EAAU9a,GAEzC,IAAK,IAAIvY,EAAM,EAAGj8D,EAAQuwE,EAAMhxE,EAAI+c,MAAO2/C,EAAM18D,EAAI+c,MAAO2/C,IAAOj8D,IAAS,CAC1E,IAAIsX,EAAM/X,EAAIA,IAAIS,GAClB,GAAIuwE,EAAM,GAAKj5D,GAAO/X,EAAIA,IAAIS,EAAQT,EAAI+c,OAAQ,CAEhD,IAAIqU,EAAQ8oB,EAAM59B,OAAOvE,GAAKqZ,MAC9B1V,EAAG2b,cAAc3b,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAI+X,EAAMk9D,GAAa,KAAMoU,EAAQj4D,EAAO,UAAWA,EAAMwlD,QAAU,IAClHla,GAAOtrC,EAAMylD,QAAU,OAClB,GAAI7F,EAAMhxE,EAAI+c,OAAShF,GAAO/X,EAAIA,IAAIS,EAAQT,EAAI+c,OAAQ,CAE/D,IAAI4zD,EAAOz2B,EAAM59B,OAAOvE,GACpB6W,EAAO+hD,EAAK71E,KAAKnB,OAAO0vF,EAAQ1Y,EAAKv/C,MAAO,UAAWu/C,EAAKv/C,MAAMwlD,QAAU,GAAIjG,EAAKl5D,SACrFu4E,EAAShwF,EAAIooF,WAAWpX,EAAM,EAAGtU,EAAKxiB,GAC1Cx+B,EAAG4xB,OAAO5xB,EAAGtE,QAAQ/P,MAAMsZ,GAAS3gB,IAAIi1E,EAAa+a,GAASphE,GAC9D8tC,GAAOiU,EAAKv/C,MAAMylD,QAAU,IAOlC,SAASoZ,GAAUl1E,EAAOC,GACxB,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAI8C,EAAOqxE,GAAap0E,GAAQW,EAAKX,EAAMW,GAC3C,GAAgB,GAAZoC,EAAK1f,KAAY0f,EAAKO,QAAUP,EAAK9d,IAAIkf,OAAU,OAAO,EAC9D,IAAK,IAAIvY,EAAImX,EAAKO,OAAS,GAAI1X,IAAK,CAElC,GADA6wE,GAAU97D,EAAIoC,EAAMnX,GAChBA,GAAKmX,EAAK1f,IAAO,MACrB0f,EAAKo8B,MAAQp8B,EAAKm3D,WAAav5D,EAAGvE,IAAImF,OAAOwB,EAAKm3D,WAAa,GAAKv5D,EAAGvE,IACvE2G,EAAK9d,IAAM2vE,EAAS/uD,IAAI9C,EAAKo8B,OAE/Bl/B,EAASU,GAEX,OAAO,EAGT,SAASw0E,GAAQvf,GACf,IAAI5nE,EAAI4nE,EAAKl5D,QACb,OAAuB,GAAhB1O,EAAEsQ,YAAmBtQ,EAAE4C,WAAW0M,aAA0C,GAA3BtP,EAAE4C,WAAW0N,WAGvE,SAAS82E,GAAsBr0E,EAAKgC,GAOlC,IANA,IAAIf,EAAQjB,EAAIiB,MACZmC,EAASpD,EAAIoD,OACblf,EAAM8b,EAAI9b,IAEVowF,EAAWtyE,EAAK1f,IAAM2e,EAAQe,EAAK9B,KAAMq0E,EAAYD,EACrDE,GAAexyE,EAAKO,OAAS,GAAKtB,EAAQe,EAAK9B,KAAMu0E,EAAaH,GAAYtyE,EAAKQ,MAAQR,EAAK9B,KAAO,GAClGrV,EAAImX,EAAK1f,IAAKuI,EAAImX,EAAKO,OAAQ1X,IAAK,CAC3C,GAAImX,EAAK9B,KAAO,GAAKhc,EAAIqwF,IAAcrwF,EAAIqwF,EAAY,IACnDvyE,EAAKQ,MAAQvB,GAAS/c,EAAIuwF,IAAevwF,EAAIuwF,EAAa,GAAM,OAAO,EAC3EF,GAAatzE,EAAOwzE,GAAcxzE,EAEpC,IAAK,IAAI8J,EAAM/I,EAAK9B,KAAM6K,EAAM/I,EAAKQ,MAAOuI,IAAO,CACjD,GAAI/I,EAAK1f,IAAM,GAAK4B,EAAIowF,IAAapwF,EAAIowF,EAAWrzE,IAChDe,EAAKO,OAASa,GAAUlf,EAAIswF,IAAgBtwF,EAAIswF,EAAcvzE,GAAU,OAAO,EACnFqzE,IAAYE,IAEd,OAAO,EAMT,SAASE,GAAWz1E,EAAOC,GACzB,IAAIE,EAAMH,EAAMI,UAChB,KAAMD,aAAeq4D,IAAkBr4D,EAAI00D,YAAY73D,KAAOmD,EAAI+0D,UAAUl4D,IAAO,OAAO,EAC1F,IAAI+F,EAAOqxE,GAAap0E,GACpB/a,EAAM8d,EAAK9d,IACf,GAAImwF,GAAsBnwF,EAAK8d,GAAS,OAAO,EAC/C,GAAI9C,EAAU,CAEZ,IADA,IAAyEy1E,EAAWC,EAAhFh1E,EAAKX,EAAMW,GAAI+2B,EAAO,GAAIh7B,EAAUV,EAAiB+zB,SAASnzB,MACzDq5D,EAAMlzD,EAAK1f,IAAK4yE,EAAMlzD,EAAKO,OAAQ2yD,IAC1C,IAAK,IAAItU,EAAM5+C,EAAK9B,KAAM0gD,EAAM5+C,EAAKQ,MAAOo+C,IAAO,CACjD,IAAIgU,EAAU1wE,EAAIA,IAAIgxE,EAAMhxE,EAAI+c,MAAQ2/C,GAAMiU,EAAO7yD,EAAKo8B,MAAM59B,OAAOo0D,GACvE,IAAIj+B,EAAKi+B,GAET,GADAj+B,EAAKi+B,IAAW,EACC,MAAb+f,EACFA,EAAY/f,EACZggB,EAAa/f,MACR,CACAuf,GAAQvf,KAASl5D,EAAUA,EAAQ8J,OAAOovD,EAAKl5D,UACpD,IAAIsP,EAASrL,EAAGtE,QAAQpX,IAAI0wE,EAAU5yD,EAAKm3D,YAC3Cv5D,EAAGpgB,OAAOyrB,EAAQA,EAAS4pD,EAAKxyD,WAOtC,GAHAzC,EAAG2b,cAAco5D,EAAY3yE,EAAKm3D,WAAY,KAC7BoU,EAAQE,EAAWmH,EAAWt/D,MAAOs/D,EAAWt/D,MAAMylD,QAAU/4D,EAAKQ,MAAQR,EAAK9B,KAAQ00E,EAAWt/D,MAAMylD,SACnG,UAAW/4D,EAAKO,OAASP,EAAK1f,MACnDqZ,EAAQysB,KAAM,CAChB,IAAIliC,EAAMyuF,EAAY,EAAIC,EAAWj5E,QAAQysB,KACzCnhB,EAAQmtE,GAAQQ,GAAcD,EAAY,EAAIzuF,EAClD0Z,EAAG0kC,YAAYr9B,EAAQjF,EAAKm3D,WAAYjzE,EAAM8b,EAAKm3D,WAAYx9D,GAEjEiE,EAAGC,aAAa,IAAI43D,EAAc73D,EAAGvE,IAAIE,QAAQo5E,EAAY3yE,EAAKm3D,cAClEj6D,EAASU,GAEX,OAAO,EAKT,SAASi1E,GAAU51E,EAAOC,GACxB,IAAI62B,EAAYs9B,EAAep0D,EAAM8b,QACrC,OAAO+5D,IAAkB,SAAU90E,GACjC,IAAI3e,EAAO2e,EAAI3e,KAEf,OAAO00C,EAAU10C,EAAKrC,KAAK2d,KAAK42D,aAH3BuhB,CAIJ71E,EAAOC,GAMZ,SAAS41E,GAAkBC,GACzB,OAAO,SAAU91E,EAAOC,GACtB,IACI2rE,EAAUjW,EADVx1D,EAAMH,EAAMI,UAEhB,GAAMD,aAAeq4D,EAId,CACL,GAAIr4D,EAAI00D,YAAY73D,KAAOmD,EAAI+0D,UAAUl4D,IAAO,OAAO,EACvD4uE,EAAWzrE,EAAI00D,YAAY5xD,UAC3B0yD,EAAUx1D,EAAI00D,YAAY73D,QAPS,CAEnC,GADA4uE,EAAW8B,EAAavtE,EAAII,QACvBqrE,EAAY,OAAO,EACxBjW,EAAU8X,EAAWttE,EAAII,OAAOvD,IAMlC,GAA8B,GAA1B4uE,EAASv1D,MAAMylD,SAA0C,GAA1B8P,EAASv1D,MAAMwlD,QAAe,OAAO,EACxE,GAAI57D,EAAU,CACZ,IAAI81E,EAAYnK,EAASv1D,MAAOA,EAAQ,GAAIw1D,EAAWkK,EAAUlK,SAC7DkK,EAAUla,QAAU,IAAKka,EAAYzH,EAAQyH,EAAW,UAAW,IACnEA,EAAUja,QAAU,IAAKia,EAAYzH,EAAQyH,EAAW,UAAW,IAEvE,IADA,IAGIrF,EAHA3tE,EAAOqxE,GAAap0E,GAAQW,EAAKX,EAAMW,GAClC/U,EAAI,EAAGA,EAAImX,EAAKQ,MAAQR,EAAK9B,KAAMrV,IACxCyqB,EAAM/yB,KAAKuoF,EAAWyC,EAAQyH,EAAW,WAAYlK,GAAYA,EAASjgF,GAAK,CAACigF,EAASjgF,IAAM,MAAQmqF,GAE3G,IAAK,IAAI9f,EAAMlzD,EAAK1f,IAAK4yE,EAAMlzD,EAAKO,OAAQ2yD,IAAO,CACjD,IAAIj5D,EAAM+F,EAAK9d,IAAIooF,WAAWpX,EAAKlzD,EAAK9B,KAAM8B,EAAKo8B,OAC/C82B,GAAOlzD,EAAK1f,MAAO2Z,GAAO4uE,EAASxoE,UACvC,IAAK,IAAIu+C,EAAM5+C,EAAK9B,KAAM6K,EAAM,EAAG61C,EAAM5+C,EAAKQ,MAAOo+C,IAAO71C,IACtD61C,GAAO5+C,EAAK9B,MAAQg1D,GAAOlzD,EAAK1f,KACpCsd,EAAG4xB,OAAOm+C,EAAW/vE,EAAGtE,QAAQpX,IAAI+X,EAAM+F,EAAKm3D,WAAY,GAAI4b,EAAY,CAAE1zF,KAAMwpF,EAAU3V,IAAKA,EAAKtU,IAAKA,IAAM7pB,cAAczhB,EAAMvK,KAG1InL,EAAG2b,cAAcq5C,EAASmgB,EAAY,CAAE1zF,KAAMwpF,EAAU3V,IAAKlzD,EAAK1f,IAAKs+D,IAAK5+C,EAAK9B,OAAQoV,EAAM,IAC3FlW,aAAeq4D,GACf73D,EAAGC,aAAa,IAAI43D,EAAc73D,EAAGvE,IAAIE,QAAQ6D,EAAI00D,YAAY73D,KACjC0zE,GAAY/vE,EAAGvE,IAAIE,QAAQo0E,KAC/DzwE,EAASU,GAEX,OAAO,GAQX,SAASq1E,GAAY/2F,EAAM0C,GACzB,OAAO,SAASqe,EAAOC,GACrB,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,IAAIywE,EAAQ5C,EAAc7tE,GAC1B,GAAIywE,EAAMxtE,UAAUoT,MAAMp3B,KAAU0C,EAAS,OAAO,EACpD,GAAIse,EAAU,CACZ,IAAIU,EAAKX,EAAMW,GACXX,EAAMI,qBAAqBo4D,EAC3Bx4D,EAAMI,UAAU8uE,aAAY,SAAU9sF,EAAM4a,GACxC5a,EAAKi0B,MAAMp3B,KAAU0C,GACrBgf,EAAG2b,cAActf,EAAK,KAAMsxE,EAAQlsF,EAAKi0B,MAAOp3B,EAAM0C,OAG1Dgf,EAAG2b,cAAcm0D,EAAMzzE,IAAK,KAAMsxE,EAAQmC,EAAMxtE,UAAUoT,MAAOp3B,EAAM0C,IAC3Ese,EAASU,GAEX,OAAO,GAIX,SAASs1E,GAAwBl2F,GAC/B,OAAO,SAASigB,EAAOC,GACrB,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CAMZ,IALA,IAAIoqB,EAAQ+pC,EAAep0D,EAAM8b,QAC7B/Y,EAAOqxE,GAAap0E,GAAQW,EAAKX,EAAMW,GACvCm0D,EAAQ/xD,EAAK9d,IAAI8vE,YAAoB,UAARh1E,EAAmB,IAAIsrF,EAAKtoE,EAAK9B,KAAM,EAAG8B,EAAKQ,MAAOR,EAAK9d,IAAIkf,QACvD,OAARpkB,EAAgB,IAAIsrF,EAAK,EAAGtoE,EAAK1f,IAAK0f,EAAK9d,IAAI+c,MAAOe,EAAKO,QAAUP,GAClGiY,EAAQ85C,EAAM7vE,KAAI,SAAU+X,GAAO,OAAO+F,EAAKo8B,MAAM59B,OAAOvE,MACvDpR,EAAI,EAAGA,EAAIkpE,EAAM1xE,OAAQwI,IAC1BovB,EAAMpvB,GAAG7L,MAAQsqC,EAAMszC,aACzBh9D,EAAG2b,cAAcvZ,EAAKm3D,WAAapF,EAAMlpE,GAAIy+B,EAAMurC,KAAM56C,EAAMpvB,GAAGyqB,OACxE,GAAuB,GAAnB1V,EAAGmG,MAAM1jB,OAAe,IAAK,IAAI0oB,EAAM,EAAGA,EAAMgpD,EAAM1xE,OAAQ0oB,IAC9DnL,EAAG2b,cAAcvZ,EAAKm3D,WAAapF,EAAMhpD,GAAMue,EAAMszC,YAAa3iD,EAAMlP,GAAKuK,OACjFpW,EAASU,GAEX,OAAO,GAIX,SAASu1E,GAAsBn2F,EAAMgjB,EAAMsnB,GASzC,IAPA,IAAI8rD,EAAgBpzE,EAAK9d,IAAI8vE,YAAY,CACvC9zD,KAAM,EACN5d,IAAK,EACLkgB,MAAe,OAARxjB,EAAgBgjB,EAAK9d,IAAI+c,MAAQ,EACxCsB,OAAgB,UAARvjB,EAAmBgjB,EAAK9d,IAAIkf,OAAS,IAGtCvY,EAAI,EAAGA,EAAIuqF,EAAc/yF,OAAQwI,IAAK,CAC7C,IAAIgqE,EAAO7yD,EAAKo8B,MAAM59B,OAAO40E,EAAcvqF,IAC3C,GAAIgqE,GAAQA,EAAK71E,OAASsqC,EAAMszC,YAC9B,OAAO,EAIX,OAAO,EAMT,SAASyY,GAAar2F,EAAMyC,GAG1B,OAFAA,EAAUA,GAAW,CAAE6zF,oBAAoB,GAEvC7zF,EAAQ6zF,mBACDJ,GAAwBl2F,GAE5B,SAASigB,EAAOC,GACrB,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,GAAIC,EAAU,CACZ,IAAIoqB,EAAQ+pC,EAAep0D,EAAM8b,QAC7B/Y,EAAOqxE,GAAap0E,GAAQW,EAAKX,EAAMW,GAEvC21E,EAAqBJ,GAAsB,MAAOnzE,EAAMsnB,GACxDksD,EAAwBL,GAAsB,SAAUnzE,EAAMsnB,GAE9DmsD,EAA2B,WAATz2F,EAAoBu2F,EACX,QAATv2F,GAAoBw2F,EAEtCE,EAAoBD,EAAkB,EAAI,EAE1CE,EAAoB,UAAR32F,EAAmB,IAAIsrF,EAAK,EAAGoL,EAAmB,EAAG1zE,EAAK9d,IAAIkf,QACtD,OAARpkB,EAAgB,IAAIsrF,EAAKoL,EAAmB,EAAG1zE,EAAK9d,IAAI+c,MAAO,GAAKe,EAEhF4zE,EAAkB,UAAR52F,EAAmBw2F,EAAwBlsD,EAAMurC,KAAOvrC,EAAMszC,YACtD,OAAR59E,EAAgBu2F,EAAqBjsD,EAAMurC,KAAOvrC,EAAMszC,YAActzC,EAAMurC,KAE1F7yD,EAAK9d,IAAI8vE,YAAY2hB,GAAW51F,SAAQ,SAAU81F,GAChD,IAAIjhB,EAAUihB,EAAkB7zE,EAAKm3D,WACjCtE,EAAOj1D,EAAGvE,IAAImF,OAAOo0D,GAErBC,GACFj1D,EAAG2b,cAAcq5C,EAASghB,EAAS/gB,EAAKv/C,UAI5CpW,EAASU,GAEX,OAAO,GAMX,IAAIk2E,GAAkBT,GAAa,MAAO,CAAEC,oBAAoB,IAI5DS,GAAqBV,GAAa,SAAU,CAAEC,oBAAoB,IAIlEU,GAAmBX,GAAa,OAAQ,CAAEC,oBAAoB,IAElE,SAASW,GAAavG,EAAOzyE,GAC3B,GAAIA,EAAM,EAAG,CACX,IAAIhV,EAASynF,EAAMztE,WACnB,GAAIha,EAAU,OAAOynF,EAAMzzE,IAAMhU,EAAOoa,SACxC,IAAK,IAAI6yD,EAAMwa,EAAM/qF,OAAO,GAAK,EAAG6nF,EAASkD,EAAMznF,SAAUitE,GAAO,EAAGA,IAAO,CAC5E,IAAI0V,EAAU8E,EAAMruF,MAAM,GAAG4B,MAAMiyE,GACnC,GAAI0V,EAAQrtE,WAAc,OAAOivE,EAAS,EAAI5B,EAAQltE,UAAU2E,SAChEmqE,GAAU5B,EAAQvoE,cAEf,CACL,GAAIqtE,EAAM/qF,QAAU+qF,EAAMtnF,OAAOmV,WAAa,EAAK,OAAOmyE,EAAMzzE,IAAMyzE,EAAMxtE,UAAUG,SAEtF,IADA,IAAI+7B,EAAQsxC,EAAMruF,MAAM,GACf4vF,EAAQvB,EAAMpyE,YAAY,GAAIivE,EAAWmD,EAAMxxE,QAAS+yE,EAAQ7yC,EAAM7gC,WAAY0zE,IAAS,CAClG,IAAIiF,EAAY93C,EAAMn7C,MAAMguF,GAC5B,GAAIiF,EAAU34E,WAAc,OAAOgvE,EAAW,EAC9CA,GAAY2J,EAAU7zE,WAQ5B,SAAS8zE,GAAa1gB,GACpB,OAAO,SAASx2D,EAAOC,GACrB,IAAK2tE,EAAU5tE,GAAU,OAAO,EAChC,IAAI41D,EAAOohB,GAAanJ,EAAc7tE,GAAQw2D,GAC9C,GAAY,MAARZ,EAAJ,CACA,GAAI31D,EAAU,CACZ,IAAIwwE,EAAQzwE,EAAM5D,IAAIE,QAAQs5D,GAC9B31D,EAASD,EAAMW,GAAGC,aAAa9E,EAAiB0E,cAAc2M,QAAQsjE,EAAOxC,EAAgBwC,KAAS3lE,kBAExG,OAAO,IAMX,SAASqsE,GAAYn3E,EAAOC,GAE1B,IADA,IAAI9D,EAAO6D,EAAMI,UAAUZ,QAClBrB,EAAIhC,EAAKiC,MAAOD,EAAI,EAAGA,IAAK,CACnC,IAAI/b,EAAO+Z,EAAK/Z,KAAK+b,GACrB,GAAgC,SAA5B/b,EAAKrC,KAAK2d,KAAK42D,UAEjB,OADIr0D,GAAYA,EAASD,EAAMW,GAAGpgB,OAAO4b,EAAKnT,OAAOmV,GAAIhC,EAAK8C,MAAMd,IAAI2M,mBACjE,EAGX,OAAO,EAGT,IAAIssE,GAAY,SAAmBh1F,EAAMi1F,GACvC71F,KAAKY,KAAOA,EACZZ,KAAK61F,aAAeA,EACpB71F,KAAK+gB,IAAMhS,SAASZ,cAAc,OAClCnO,KAAK+gB,IAAI1f,UAAY,eACrBrB,KAAK29C,MAAQ39C,KAAK+gB,IAAIoB,YAAYpT,SAASZ,cAAc,UACzDnO,KAAKkgE,SAAWlgE,KAAK29C,MAAMx7B,YAAYpT,SAASZ,cAAc,aAC9D2nF,GAAcl1F,EAAMZ,KAAKkgE,SAAUlgE,KAAK29C,MAAOk4C,GAC/C71F,KAAKw+B,WAAax+B,KAAK29C,MAAMx7B,YAAYpT,SAASZ,cAAc,WAclE,SAAS2nF,GAAcl1F,EAAMs/D,EAAUviB,EAAOk4C,EAAcE,EAAaC,GAGvE,IAFA,IAAIC,EAAa,EAAGC,GAAa,EAC7Bn7B,EAAUmF,EAAS9wD,WAAYqlE,EAAM7zE,EAAKwO,WACrChF,EAAI,EAAG+1D,EAAM,EAAG/1D,EAAIqqE,EAAI33D,WAAY1S,IAI3C,IAHA,IAAImV,EAAMk1D,EAAIjyE,MAAM4H,GAAGyqB,MACnBylD,EAAU/6D,EAAI+6D,QACd+P,EAAW9qE,EAAI8qE,SACVv8C,EAAI,EAAGA,EAAIwsC,EAASxsC,IAAKqyB,IAAO,CACvC,IAAIg2B,EAAWJ,GAAe51B,EAAM61B,EAAgB3L,GAAYA,EAASv8C,GACrEsoD,EAAWD,EAAWA,EAAW,KAAO,GAC5CF,GAAcE,GAAYN,EACrBM,IAAYD,GAAa,GACzBn7B,GAGCA,EAAQ34C,MAAM5B,OAAS41E,IAAYr7B,EAAQ34C,MAAM5B,MAAQ41E,GAC7Dr7B,EAAUA,EAAQ1rD,aAHlB6wD,EAAS/9C,YAAYpT,SAASZ,cAAc,QAAQiU,MAAM5B,MAAQ41E,EAQxE,MAAOr7B,EAAS,CACd,IAAIt9C,EAAQs9C,EAAQ1rD,YACpB0rD,EAAQ7oD,WAAWoP,YAAYy5C,GAC/BA,EAAUt9C,EAGRy4E,GACFv4C,EAAMv7B,MAAM5B,MAAQy1E,EAAa,KACjCt4C,EAAMv7B,MAAMi0E,SAAW,KAEvB14C,EAAMv7B,MAAM5B,MAAQ,GACpBm9B,EAAMv7B,MAAMi0E,SAAWJ,EAAa,MA3CxCL,GAAU9iF,UAAUoO,OAAS,SAAiBtgB,GAC5C,OAAIA,EAAKrC,MAAQyB,KAAKY,KAAKrC,OAC3ByB,KAAKY,KAAOA,EACZk1F,GAAcl1F,EAAMZ,KAAKkgE,SAAUlgE,KAAK29C,MAAO39C,KAAK61F,eAC7C,IAGTD,GAAU9iF,UAAUu/C,eAAiB,SAAyBikC,GAC5D,MAAsB,cAAfA,EAAO/3F,OAAyB+3F,EAAOtzE,QAAUhjB,KAAK29C,OAAS39C,KAAKkgE,SAASj6D,SAASqwF,EAAOtzE,UAuCtG,IAAIuzE,GAAQ,IAAIj8E,EAAiBqP,UAAU,uBAE3C,SAAS6sE,GAAej3E,QACT,IAARA,IAAiBA,EAAM,IAC5B,IAAIk3E,EAAcl3E,EAAIk3E,iBAAkC,IAAhBA,IAAyBA,EAAc,GAC/E,IAAIZ,EAAet2E,EAAIs2E,kBAAoC,IAAjBA,IAA0BA,EAAe,IACnF,IAAIa,EAAOn3E,EAAIm3E,UAAoB,IAATA,IAAkBA,EAAOd,IACnD,IAAIe,EAAsBp3E,EAAIo3E,yBAAkD,IAAxBA,IAAiCA,GAAsB,GAE/G,IAAIn9E,EAAS,IAAIc,EAAiBqD,OAAO,CACvCld,IAAK81F,GACL/3E,MAAO,CACLoL,KAAM,SAAcwmB,EAAG5xB,GAGrB,OAFAxe,KAAKkc,KAAK5O,MAAM85B,UAAUwrC,EAAep0D,EAAM8b,QAAQqjB,MAAMlgD,MAC3D,SAAUmD,EAAM8d,GAAQ,OAAO,IAAIg4E,EAAK91F,EAAMi1F,EAAcn3E,IACvD,IAAIk4E,IAAa,GAAG,IAE7Bj5F,MAAO,SAAewhB,EAAI6nC,GACxB,OAAOA,EAAKrpD,MAAMwhB,KAGtB7R,MAAO,CACL0C,WAAY,SAAoBwO,GAC9B,IAAIq4E,EAAcN,GAAMxsE,SAASvL,GACjC,OAAOq4E,EAAYC,cAAgB,EAAI,CAAC1oF,MAAO,iBAAmB,MAGpEk4B,gBAAiB,CACfywD,UAAW,SAAmBr4E,EAAMlP,GAASwnF,GAAgBt4E,EAAMlP,EAAOinF,EAAaZ,EAAcc,IACrGM,WAAY,SAAoBv4E,GAAQw4E,GAAiBx4E,IACzDwmD,UAAW,SAAmBxmD,EAAMlP,GAAS2nF,GAAkBz4E,EAAMlP,EAAOqmF,KAG9Ej4E,YAAa,SAAqBY,GAChC,IAAIq4E,EAAcN,GAAMxsE,SAASvL,GACjC,GAAIq4E,EAAYC,cAAgB,EAAK,OAAOM,GAAkB54E,EAAOq4E,EAAYC,eAGnF1vD,UAAW,MAGf,OAAO5tB,EAGT,IAAIo9E,GAAc,SAAqBE,EAAc7zE,GACnDjjB,KAAK82F,aAAeA,EACpB92F,KAAKijB,SAAWA,GAiBlB,SAAS+zE,GAAgBt4E,EAAMlP,EAAOinF,EAAaZ,EAAcc,GAC/D,IAAIE,EAAcN,GAAMxsE,SAASrL,EAAKF,OAEtC,IAAKq4E,EAAY5zE,SAAU,CACzB,IAAID,EAASq0E,GAAc7nF,EAAMwT,QAASoxD,GAAQ,EAClD,GAAIpxD,EAAQ,CACV,IAAIzD,EAAMyD,EAAOnB,wBACbpC,EAAOF,EAAIE,KACXsC,EAAQxC,EAAIwC,MACZvS,EAAMkQ,QAAUD,GAAQg3E,EACxBriB,EAAOkjB,GAAS54E,EAAMlP,EAAO,QACxBuS,EAAQvS,EAAMkQ,SAAW+2E,IAC9BriB,EAAOkjB,GAAS54E,EAAMlP,EAAO,UAGnC,GAAI4kE,GAAQyiB,EAAYC,aAAc,CACpC,IAAKH,IAAiC,IAAVviB,EAAa,CACvC,IAAI6a,EAAQvwE,EAAKF,MAAM5D,IAAIE,QAAQs5D,GAC/Bz2B,EAAQsxC,EAAMruF,MAAM,GAAI6C,EAAM2vE,EAAS/uD,IAAIs5B,GAAQn3B,EAAQyoE,EAAMzoE,OAAO,GACxE25C,EAAM18D,EAAI0nF,SAAS8D,EAAMzzE,IAAMgL,GAASyoE,EAAMxtE,UAAUoT,MAAMylD,QAAU,EAE5E,GAAIna,GAAO18D,EAAI+c,MAAQ,EACrB,OAIJ+2E,GAAa74E,EAAM01D,KAKzB,SAAS8iB,GAAiBx4E,GACxB,IAAIm4E,EAAcN,GAAMxsE,SAASrL,EAAKF,OAClCq4E,EAAYC,cAAgB,IAAMD,EAAY5zE,UAAYs0E,GAAa74E,GAAO,GAGpF,SAASy4E,GAAkBz4E,EAAMlP,EAAOqmF,GACtC,IAAIgB,EAAcN,GAAMxsE,SAASrL,EAAKF,OACtC,IAAiC,GAA7Bq4E,EAAYC,cAAsBD,EAAY5zE,SAAY,OAAO,EAErE,IAAImxD,EAAO11D,EAAKF,MAAM5D,IAAImF,OAAO82E,EAAYC,cACzCt2E,EAAQg3E,GAAgB94E,EAAMm4E,EAAYC,aAAc1iB,EAAKv/C,OAGjE,SAASomB,EAAOzrC,GACdqK,OAAOoH,oBAAoB,UAAWg6B,GACtCphC,OAAOoH,oBAAoB,YAAao9C,GACxC,IAAIw4B,EAAcN,GAAMxsE,SAASrL,EAAKF,OAClCq4E,EAAY5zE,WACdw0E,GAAkB/4E,EAAMm4E,EAAYC,aAAcY,GAAab,EAAY5zE,SAAUzT,EAAOqmF,IAC5Fn3E,EAAKD,SAASC,EAAKF,MAAMW,GAAGkK,QAAQktE,GAAO,CAACoB,YAAa,SAG7D,SAASt5B,EAAK7uD,GACZ,IAAKA,EAAMooF,MAAS,OAAO38C,EAAOzrC,GAClC,IAAIqnF,EAAcN,GAAMxsE,SAASrL,EAAKF,OAClCq5E,EAAUH,GAAab,EAAY5zE,SAAUzT,EAAOqmF,GACxDiC,GAAmBp5E,EAAMm4E,EAAYC,aAAce,EAAShC,GAM9D,OArBAn3E,EAAKD,SAASC,EAAKF,MAAMW,GAAGkK,QAAQktE,GAAO,CAACoB,YAAa,CAACI,OAAQvoF,EAAMkQ,QAASs4E,WAAYx3E,MAkB7F3G,OAAOC,iBAAiB,UAAWmhC,GACnCphC,OAAOC,iBAAiB,YAAaukD,GACrC7uD,EAAM8kB,kBACC,EAGT,SAASkjE,GAAgB94E,EAAMy1D,EAAS50D,GACtC,IAAI+6D,EAAU/6D,EAAI+6D,QACd+P,EAAW9qE,EAAI8qE,SAEf7pE,EAAQ6pE,GAAYA,EAASA,EAASzoF,OAAS,GACnD,GAAI4e,EAAS,OAAOA,EACpB,IAAIO,EAAMrC,EAAKsuD,SAASmH,GACpBvzE,EAAOmgB,EAAIngB,KAAKwpC,WAAWrpB,EAAIvc,QAC/ByzF,EAAWr3F,EAAKs3F,YAAahmE,EAAQooD,EACzC,GAAI+P,EAAY,IAAK,IAAIjgF,EAAI,EAAGA,EAAIkwE,EAASlwE,IAAWigF,EAASjgF,KAC/D6tF,GAAY5N,EAASjgF,GACrB8nB,KAEF,OAAO+lE,EAAW/lE,EAGpB,SAASmlE,GAAcr0E,GACrB,MAAOA,GAA6B,MAAnBA,EAAO9T,UAAuC,MAAnB8T,EAAO9T,SAC/C8T,EAASA,EAAOvL,UAAUxR,SAAS,eAAiB,KAAO+c,EAAO9Q,WACtE,OAAO8Q,EAGT,SAASs0E,GAAS54E,EAAMlP,EAAOy6B,GAC7B,IAAI1qB,EAAMb,EAAKc,YAAY,CAACC,KAAMjQ,EAAMkQ,QAAS7d,IAAK2N,EAAMmQ,UACxDnE,EAAM+D,EAAI/D,IACVyzE,EAAQhD,EAAWvtE,EAAKF,MAAM5D,IAAIE,QAAQU,IAC9C,IAAKyzE,EAAS,OAAQ,EACtB,GAAY,SAARhlD,EAAmB,OAAOglD,EAAMzzE,IACpC,IAAI/X,EAAM2vE,EAAS/uD,IAAI4qE,EAAMruF,MAAM,IAAK4lB,EAAQyoE,EAAMzoE,OAAO,GACzDtiB,EAAQT,EAAIA,IAAIo1B,QAAQo2D,EAAMzzE,IAAMgL,GACxC,OAAOtiB,EAAQT,EAAI+c,OAAS,GAAK,EAAIgG,EAAQ/iB,EAAIA,IAAIS,EAAQ,GAG/D,SAASwzF,GAAaz0E,EAAUzT,EAAOqmF,GACrC,IAAIrxF,EAASgL,EAAMkQ,QAAUuD,EAAS80E,OACtC,OAAOhiF,KAAK0Q,IAAIovE,EAAc5yE,EAAS+0E,WAAaxzF,GAGtD,SAAS+yF,GAAa74E,EAAMve,GAC1Bue,EAAKD,SAASC,EAAKF,MAAMW,GAAGkK,QAAQktE,GAAO,CAAC4B,UAAWh4F,KAGzD,SAASs3F,GAAkB/4E,EAAM01D,EAAM5zD,GAKrC,IAJA,IAAIyuE,EAAQvwE,EAAKF,MAAM5D,IAAIE,QAAQs5D,GAC/Bz2B,EAAQsxC,EAAMruF,MAAM,GAAI6C,EAAM2vE,EAAS/uD,IAAIs5B,GAAQn3B,EAAQyoE,EAAMzoE,OAAO,GACxE25C,EAAM18D,EAAI0nF,SAAS8D,EAAMzzE,IAAMgL,GAASyoE,EAAMxtE,UAAUoT,MAAMylD,QAAU,EACxEn7D,EAAKT,EAAKF,MAAMW,GACXs1D,EAAM,EAAGA,EAAMhxE,EAAIkf,OAAQ8xD,IAAO,CACzC,IAAI2jB,EAAW3jB,EAAMhxE,EAAI+c,MAAQ2/C,EAEjC,IAAIsU,GAAOhxE,EAAIA,IAAI20F,IAAa30F,EAAIA,IAAI20F,EAAW30F,EAAI+c,OAAvD,CACA,IAAIhF,EAAM/X,EAAIA,IAAI20F,GACd74E,EAAMo+B,EAAM59B,OAAOvE,GACnBqZ,EAAQtV,EAAIsV,MACZ3wB,EAAyB,GAAjB2wB,EAAMylD,QAAe,EAAIna,EAAM18D,EAAI0nF,SAAS3vE,GACxD,IAAIqZ,EAAMw1D,UAAYx1D,EAAMw1D,SAASnmF,IAAUsc,EAA/C,CACA,IAAI6pE,EAAWx1D,EAAMw1D,SAAWx1D,EAAMw1D,SAASv/E,QAAUutF,GAAOxjE,EAAMylD,SACtE+P,EAASnmF,GAASsc,EAClBrB,EAAG2b,cAActU,EAAQhL,EAAK,KAAMsxE,EAAQj4D,EAAO,WAAYw1D,MAE7DlrE,EAAGyJ,YAAclK,EAAKD,SAASU,GAGrC,SAAS24E,GAAmBp5E,EAAM01D,EAAM5zD,EAAOq1E,GAC7C,IAAI5G,EAAQvwE,EAAKF,MAAM5D,IAAIE,QAAQs5D,GAC/Bz2B,EAAQsxC,EAAMruF,MAAM,GAAI4lB,EAAQyoE,EAAMzoE,OAAO,GAC7C25C,EAAMiT,EAAS/uD,IAAIs5B,GAAOwtC,SAAS8D,EAAMzzE,IAAMgL,GAASyoE,EAAMxtE,UAAUoT,MAAMylD,QAAU,EACxFv5D,EAAMrC,EAAKsuD,SAASiiB,EAAMzoE,OAAO,IAAI5lB,KACzC,MAAuB,SAAhBmgB,EAAI7R,SAAuB6R,EAAMA,EAAI7O,WAC5C4jF,GAAcn4C,EAAO58B,EAAI3R,WAAY2R,EAAK80E,EAAc11B,EAAK3/C,GAG/D,SAAS63E,GAAOt0E,GAEd,IADA,IAAIvjB,EAAS,GACJ4J,EAAI,EAAGA,EAAI2Z,EAAG3Z,IAAO5J,EAAOsB,KAAK,GAC1C,OAAOtB,EAGT,SAAS42F,GAAkB54E,EAAO41D,GAKhC,IAJA,IAAIx2D,EAAc,GACdqxE,EAAQzwE,EAAM5D,IAAIE,QAAQs5D,GAC1Bz2B,EAAQsxC,EAAMruF,MAAM,GAAI6C,EAAM2vE,EAAS/uD,IAAIs5B,GAAQn3B,EAAQyoE,EAAMzoE,OAAO,GACxE25C,EAAM18D,EAAI0nF,SAAS8D,EAAMzzE,IAAMgL,GAASyoE,EAAMxtE,UAAUoT,MAAMylD,QACzD7F,EAAM,EAAGA,EAAMhxE,EAAIkf,OAAQ8xD,IAAO,CACzC,IAAIvwE,EAAQi8D,EAAMsU,EAAMhxE,EAAI+c,MAAQ,EAIpC,IAAK2/C,GAAO18D,EAAI+c,OAAS/c,EAAIA,IAAIS,IAAUT,EAAIA,IAAIS,EAAQ,MAC/C,GAAPuwE,GAAYhxE,EAAIA,IAAIS,EAAQ,IAAMT,EAAIA,IAAIS,EAAQ,EAAIT,EAAI+c,QAAS,CACtE,IAAI2zD,EAAU1wE,EAAIA,IAAIS,GAClBsX,EAAMgL,EAAQ2tD,EAAUx2B,EAAM59B,OAAOo0D,GAASvyD,SAAW,EACzDb,EAAMhS,SAASZ,cAAc,OACjC4S,EAAI1f,UAAY,uBAChBuc,EAAY9b,KAAKyY,EAAgB0F,WAAWC,OAAO1E,EAAKuF,KAG5D,OAAOxG,EAAgByF,cAAc5iB,OAAOohB,EAAM5D,IAAKgD,GAiBzD,SAAS06E,GAAa/4E,QACP,IAARA,IAAiBA,EAAM,IAC5B,IAAIyvE,EAA0BzvE,EAAIyvE,wBAElC,YAF4F,IAA5BA,IAAqCA,GAA0B,GAExH,IAAI10E,EAAiBqD,OAAO,CACjCld,IAAKA,EAKL+d,MAAO,CACLoL,KAAM,WAAkB,OAAO,MAC/BjsB,MAAO,SAAewhB,EAAIwwB,GACxB,IAAI3wC,EAAMmgB,EAAG4I,QAAQtnB,GACrB,GAAW,MAAPzB,EAAe,OAAe,GAARA,EAAY,KAAOA,EAC7C,GAAW,MAAP2wC,IAAgBxwB,EAAGyJ,WAAc,OAAO+mB,EAC5C,IAAIpwB,EAAMJ,EAAGtE,QAAQ8pC,UAAUhV,GAC3BiV,EAAUrlC,EAAIqlC,QACdppC,EAAM+D,EAAI/D,IACd,OAAOopC,EAAU,KAAOppC,IAI5BlO,MAAO,CACLsQ,YAAa2wE,EAEbjoD,gBAAiB,CACf4+B,UAAWwsB,IAGb5zE,uBAAwB,SAAgCY,GACtD,GAAgC,MAA5Bje,EAAIspB,SAASrL,EAAKF,OAAkB,OAAOE,EAAKF,MAAMI,WAG5D4lD,kBAAmBA,GAEnBrmD,cAAeA,EAEf2oB,YAAaA,IAGf6gB,kBAAmB,SAA2BvX,EAAGwX,EAAUppC,GACzD,OAAOuwE,EAAmBvwE,EAAO6zE,GAAU7zE,EAAOopC,GAAWonC,MA5OnE4H,GAAY9jF,UAAUnV,MAAQ,SAAgBwhB,GAC5C,IAAIX,EAAQxe,KAAMu4F,EAASp5E,EAAG4I,QAAQwuE,IACtC,GAAIgC,GAA8B,MAApBA,EAAOJ,UACjB,OAAO,IAAIvB,GAAY2B,EAAOJ,UAAW,MAC7C,GAAII,QAAiCz4F,IAAvBy4F,EAAOZ,YACjB,OAAO,IAAIf,GAAYp4E,EAAMs4E,aAAcyB,EAAOZ,aACtD,GAAIn5E,EAAMs4E,cAAgB,GAAK33E,EAAGyJ,WAAY,CAC5C,IAAIyZ,EAASljB,EAAGtE,QAAQpX,IAAI+a,EAAMs4E,cAAe,GAC5CtK,EAAartE,EAAGvE,IAAIE,QAAQunB,MAAYA,EAAS,MACtD7jB,EAAQ,IAAIo4E,GAAYv0D,EAAQ7jB,EAAMyE,UAExC,OAAOzE,GAsOT1gB,EAAQw6F,aAAeA,GACvBx6F,EAAQu0F,UAAYA,GACpBv0F,EAAQgpC,YAAcA,GACtBhpC,EAAQo0F,aAAeA,GACvBp0F,EAAQ06F,gBAAkB/3F,EAC1B3C,EAAQmuF,WAAaA,EACrBnuF,EAAQsuF,UAAYA,EACpBtuF,EAAQuuF,cAAgBA,EACxBvuF,EAAQ2uF,gBAAkBA,EAC1B3uF,EAAQ4uF,YAAcA,EACtB5uF,EAAQu2E,SAAWA,EACnBv2E,EAAQqtF,SAAWA,EACnBrtF,EAAQstF,SAAWA,EACnBttF,EAAQm8E,WAAaA,EACrBn8E,EAAQk5E,cAAgBA,EACxBl5E,EAAQs1E,SAAWA,EACnBt1E,EAAQ04F,eAAiBA,GACzB14F,EAAQ26F,wBAA0BlC,GAClCz4F,EAAQ46F,sBAAwB5C,GAChCh4F,EAAQ66F,cAAgB9I,EACxB/xF,EAAQ86F,cAAgBzH,EACxBrzF,EAAQ+6F,YAAc1I,EACtBryF,EAAQ26E,UAAYA,GACpB36E,EAAQk1F,gBAAkBA,GAC1Bl1F,EAAQm1F,eAAiBA,GACzBn1F,EAAQi9E,aAAeA,GACvBj9E,EAAQq1F,aAAeA,GACvBr1F,EAAQk8E,OAASA,GACjBl8E,EAAQw1F,aAAeA,GACvBx1F,EAAQy1F,YAAcA,GACtBz1F,EAAQm9E,UAAYA,GACpBn9E,EAAQ41F,UAAYA,GACpB51F,EAAQm2F,WAAaA,GACrBn2F,EAAQs2F,UAAYA,GACpBt2F,EAAQu2F,kBAAoBA,GAC5Bv2F,EAAQ02F,YAAcA,GACtB12F,EAAQ82F,aAAeA,GACvB92F,EAAQu3F,gBAAkBA,GAC1Bv3F,EAAQw3F,mBAAqBA,GAC7Bx3F,EAAQy3F,iBAAmBA,GAC3Bz3F,EAAQ43F,aAAeA,GACvB53F,EAAQ63F,YAAcA","file":"js/chunk-6eeebbdc.365bb388.js","sourcesContent":["'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","function deepFreeze(obj) {\n    if (obj instanceof Map) {\n        obj.clear = obj.delete = obj.set = function () {\n            throw new Error('map is read-only');\n        };\n    } else if (obj instanceof Set) {\n        obj.add = obj.clear = obj.delete = function () {\n            throw new Error('set is read-only');\n        };\n    }\n\n    // Freeze self\n    Object.freeze(obj);\n\n    Object.getOwnPropertyNames(obj).forEach(function (name) {\n        var prop = obj[name];\n\n        // Freeze prop if it is an object\n        if (typeof prop == 'object' && !Object.isFrozen(prop)) {\n            deepFreeze(prop);\n        }\n    });\n\n    return obj;\n}\n\nvar deepFreezeEs6 = deepFreeze;\nvar _default = deepFreeze;\ndeepFreezeEs6.default = _default;\n\n/** @implements CallbackResponse */\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    this.isMatchIgnored = false;\n  }\n\n  ignoreMatch() {\n    this.isMatchIgnored = 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  const result = Object.create(null);\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/**\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 * Any of the passed expresssions may match\n *\n * Creates a huge this | this | that | that match\n * @param {(RegExp | string)[] } args\n * @returns {string}\n */\nfunction either(...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  const match = re && re.exec(lexeme);\n  return match && match.index === 0;\n}\n\n// BACKREF_RE 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 '?'.\nconst BACKREF_RE = /\\[(?:[^\\\\\\]]|\\\\.)*\\]|\\(\\??|\\\\([1-9][0-9]*)|\\\\./;\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  let numCaptures = 0;\n\n  return regexps.map((regex) => {\n    numCaptures += 1;\n    const offset = numCaptures;\n    let re = source(regex);\n    let out = '';\n\n    while (re.length > 0) {\n      const match = BACKREF_RE.exec(re);\n      if (!match) {\n        out += re;\n        break;\n      }\n      out += 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        out += '\\\\' + String(Number(match[1]) + offset);\n      } else {\n        out += match[0];\n        if (match[0] === '(') {\n          numCaptures++;\n        }\n      }\n    }\n    return out;\n  }).map(re => `(${re})`).join(separator);\n}\n\n// Common regexps\nconst MATCH_NOTHING_RE = /\\b\\B/;\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  const 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    MATCH_NOTHING_RE: MATCH_NOTHING_RE,\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// Grammar extensions / plugins\n// See: https://github.com/highlightjs/highlight.js/issues/2833\n\n// Grammar extensions allow \"syntactic sugar\" to be added to the grammar modes\n// without requiring any underlying changes to the compiler internals.\n\n// `compileMatch` being the perfect small example of now allowing a grammar\n// author to write `match` when they desire to match a single expression rather\n// than being forced to use `begin`.  The extension then just moves `match` into\n// `begin` when it runs.  Ie, no features have been added, but we've just made\n// the experience of writing (and reading grammars) a little bit nicer.\n\n// ------\n\n// TODO: We need negative look-behind support to do this properly\n/**\n * Skip a match if it has a preceding 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 */\nfunction skipIfhasPrecedingDot(match, response) {\n  const before = match.input[match.index - 1];\n  if (before === \".\") {\n    response.ignoreMatch();\n  }\n}\n\n\n/**\n * `beginKeywords` syntactic sugar\n * @type {CompilerExt}\n */\nfunction beginKeywords(mode, parent) {\n  if (!parent) return;\n  if (!mode.beginKeywords) return;\n\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 = skipIfhasPrecedingDot;\n  mode.keywords = mode.keywords || mode.beginKeywords;\n  delete mode.beginKeywords;\n\n  // prevents double relevance, the keywords themselves provide\n  // relevance, the mode doesn't need to double it\n  // eslint-disable-next-line no-undefined\n  if (mode.relevance === undefined) mode.relevance = 0;\n}\n\n/**\n * Allow `illegal` to contain an array of illegal values\n * @type {CompilerExt}\n */\nfunction compileIllegal(mode, _parent) {\n  if (!Array.isArray(mode.illegal)) return;\n\n  mode.illegal = either(...mode.illegal);\n}\n\n/**\n * `match` to match a single expression for readability\n * @type {CompilerExt}\n */\nfunction compileMatch(mode, _parent) {\n  if (!mode.match) return;\n  if (mode.begin || mode.end) throw new Error(\"begin & end are not supported with match\");\n\n  mode.begin = mode.match;\n  delete mode.match;\n}\n\n/**\n * provides the default 1 relevance to all modes\n * @type {CompilerExt}\n */\nfunction compileRelevance(mode, _parent) {\n  // eslint-disable-next-line no-undefined\n  if (mode.relevance === undefined) mode.relevance = 1;\n}\n\n// keywords that should have no default relevance value\nconst COMMON_KEYWORDS = [\n  'of',\n  'and',\n  'for',\n  'in',\n  'not',\n  'or',\n  'if',\n  'then',\n  'parent', // common variable name\n  'list', // common variable name\n  'value' // common variable name\n];\n\nconst DEFAULT_KEYWORD_CLASSNAME = \"keyword\";\n\n/**\n * Given raw keywords from a language definition, compile them.\n *\n * @param {string | Record<string,string|string[]> | Array<string>} rawKeywords\n * @param {boolean} caseInsensitive\n */\nfunction compileKeywords(rawKeywords, caseInsensitive, className = DEFAULT_KEYWORD_CLASSNAME) {\n  /** @type KeywordDict */\n  const compiledKeywords = {};\n\n  // input can be a string of keywords, an array of keywords, or a object with\n  // named keys representing className (which can then point to a string or array)\n  if (typeof rawKeywords === 'string') {\n    compileList(className, rawKeywords.split(\" \"));\n  } else if (Array.isArray(rawKeywords)) {\n    compileList(className, rawKeywords);\n  } else {\n    Object.keys(rawKeywords).forEach(function(className) {\n      // collapse all our objects back into the parent object\n      Object.assign(\n        compiledKeywords,\n        compileKeywords(rawKeywords[className], caseInsensitive, className)\n      );\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 {Array<string>} keywordList\n   */\n  function compileList(className, keywordList) {\n    if (caseInsensitive) {\n      keywordList = keywordList.map(x => x.toLowerCase());\n    }\n    keywordList.forEach(function(keyword) {\n      const 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\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 * @param {{plugins: HLJSPlugin[]}} opts\n * @returns {CompiledLanguage}\n */\nfunction compileLanguage(language, { plugins }) {\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.terminatorEnd) {\n      mm.addRule(mode.terminatorEnd, { type: \"end\" });\n    }\n    if (mode.illegal) {\n      mm.addRule(mode.illegal, { type: \"illegal\" });\n    }\n\n    return mm;\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.isCompiled) return cmode;\n\n    [\n      // do this early so compiler extensions generally don't have to worry about\n      // the distinction between match/begin\n      compileMatch\n    ].forEach(ext => ext(mode, parent));\n\n    language.compilerExtensions.forEach(ext => ext(mode, parent));\n\n    // __beforeBegin is considered private API, internal use only\n    mode.__beforeBegin = null;\n\n    [\n      beginKeywords,\n      // do this later so compiler extensions that come earlier have access to the\n      // raw array if they wanted to perhaps manipulate it, etc.\n      compileIllegal,\n      // default to 1 relevance if not specified\n      compileRelevance\n    ].forEach(ext => ext(mode, parent));\n\n    mode.isCompiled = true;\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    keywordPattern = keywordPattern || mode.lexemes || /\\w+/;\n    cmode.keywordPatternRe = langRe(keywordPattern, true);\n\n    if (parent) {\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.terminatorEnd = source(mode.end) || '';\n      if (mode.endsWithParent && parent.terminatorEnd) {\n        cmode.terminatorEnd += (mode.end ? '|' : '') + parent.terminatorEnd;\n      }\n    }\n    if (mode.illegal) cmode.illegalRe = langRe(/** @type {RegExp | string} */ (mode.illegal));\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  if (!language.compilerExtensions) language.compilerExtensions = [];\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\n  // we need a null object, which inherit will guarantee\n  language.classNameAliases = inherit(language.classNameAliases || {});\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.cachedVariants) {\n    mode.cachedVariants = 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.cachedVariants) {\n    return mode.cachedVariants;\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\nvar version = \"10.7.3\";\n\n// @ts-nocheck\n\nfunction hasValueOrEmptyAttribute(value) {\n  return Boolean(value || value === \"\");\n}\n\nfunction BuildVuePlugin(hljs) {\n  const 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.detectedLanguage = 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    }\n    // template: `<pre><code :class=\"className\" v-html=\"highlighted\"></code></pre>`\n  };\n\n  const VuePlugin = {\n    install(Vue) {\n      Vue.component('highlightjs', Component);\n    }\n  };\n\n  return { Component, VuePlugin };\n}\n\n/* plugin itself */\n\n/** @type {HLJSPlugin} */\nconst mergeHTMLPlugin = {\n  \"after:highlightElement\": ({ el, result, text }) => {\n    const originalStream = nodeStream(el);\n    if (!originalStream.length) return;\n\n    const resultNode = document.createElement('div');\n    resultNode.innerHTML = result.value;\n    result.value = mergeStreams(originalStream, nodeStream(resultNode), text);\n  }\n};\n\n/* Stream merging support functions */\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  const result = [];\n  (function _nodeStream(node, offset) {\n    for (let 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  let processed = 0;\n  let result = '';\n  const 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    let 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\n/*\n\nFor the reasoning behind this please see:\nhttps://github.com/highlightjs/highlight.js/issues/2880#issuecomment-747275419\n\n*/\n\n/**\n * @type {Record<string, boolean>}\n */\nconst seenDeprecations = {};\n\n/**\n * @param {string} message\n */\nconst error = (message) => {\n  console.error(message);\n};\n\n/**\n * @param {string} message\n * @param {any} args\n */\nconst warn = (message, ...args) => {\n  console.log(`WARN: ${message}`, ...args);\n};\n\n/**\n * @param {string} version\n * @param {string} message\n */\nconst deprecated = (version, message) => {\n  if (seenDeprecations[`${version}/${message}`]) return;\n\n  console.log(`Deprecated as of ${version}. ${message}`);\n  seenDeprecations[`${version}/${message}`] = true;\n};\n\n/*\nSyntax highlighting with language autodetection.\nhttps://highlightjs.org/\n*/\n\nconst escape$1 = escapeHTML;\nconst inherit$1 = inherit;\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  // Global internal variables used within the highlight.js library.\n  /** @type {Record<string, Language>} */\n  const languages = Object.create(null);\n  /** @type {Record<string, string>} */\n  const aliases = Object.create(null);\n  /** @type {HLJSPlugin[]} */\n  const 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  let SAFE_MODE = true;\n  const fixMarkupRe = /(^(<[^>]+>|\\t|)+|\\n)/gm;\n  const 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  let 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    let 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      const language = getLanguage(match[1]);\n      if (!language) {\n        warn(LANGUAGE_NOT_FOUND.replace(\"{}\", match[1]));\n        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   * OLD API\n   * highlight(lang, code, ignoreIllegals, continuation)\n   *\n   * NEW API\n   * highlight(code, {lang, ignoreIllegals})\n   *\n   * @param {string} codeOrlanguageName - the language to use for highlighting\n   * @param {string | HighlightOptions} optionsOrCode - the code to highlight\n   * @param {boolean} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n   * @param {CompiledMode} [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 {CompiledMode} top - top of the current mode stack\n   * @property {boolean} illegal - indicates whether any illegal matches were found\n  */\n  function highlight(codeOrlanguageName, optionsOrCode, ignoreIllegals, continuation) {\n    let code = \"\";\n    let languageName = \"\";\n    if (typeof optionsOrCode === \"object\") {\n      code = codeOrlanguageName;\n      ignoreIllegals = optionsOrCode.ignoreIllegals;\n      languageName = optionsOrCode.language;\n      // continuation not supported at all via the new API\n      // eslint-disable-next-line no-undefined\n      continuation = undefined;\n    } else {\n      // old API\n      deprecated(\"10.7.0\", \"highlight(lang, code, ...args) has been deprecated.\");\n      deprecated(\"10.7.0\", \"Please use highlight(code, options) instead.\\nhttps://github.com/highlightjs/highlight.js/issues/2277\");\n      languageName = codeOrlanguageName;\n      code = optionsOrCode;\n    }\n\n    /** @type {BeforeHighlightContext} */\n    const 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    const 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} codeToHighlight - the code to highlight\n   * @param {boolean?} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n   * @param {CompiledMode?} [continuation] - current continuation mode, if any\n   * @returns {HighlightResult} - result of the highlight operation\n  */\n  function _highlight(languageName, codeToHighlight, ignoreIllegals, continuation) {\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      const 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          if (kind.startsWith(\"_\")) {\n            // _ implied for relevance only, do not highlight\n            // by applying a class name\n            buf += match[0];\n          } else {\n            const cssClass = language.classNameAliases[kind] || kind;\n            emitter.addKeyword(match[0], cssClass);\n          }\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      let 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] = /** @type {CompiledMode} */ (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(language.classNameAliases[mode.className] || 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.isMatchIgnored) 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      const lexeme = match[0];\n      const 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.isMatchIgnored) 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      const lexeme = match[0];\n      const matchPlusRemainder = codeToHighlight.substr(match.index);\n\n      const endMode = endOfMode(top, match, matchPlusRemainder);\n      if (!endMode) { return NO_MATCH; }\n\n      const 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      const list = [];\n      for (let 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    let 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      const 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        const 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    const language = getLanguage(languageName);\n    if (!language) {\n      error(LANGUAGE_NOT_FOUND.replace(\"{}\", languageName));\n      throw new Error('Unknown language: \"' + languageName + '\"');\n    }\n\n    const md = compileLanguage(language, { plugins });\n    let result = '';\n    /** @type {CompiledMode} */\n    let top = continuation || md;\n    /** @type Record<string,CompiledMode> */\n    const continuations = {}; // keep continuations for sub-languages\n    const emitter = new options.__emitter(options);\n    processContinuations();\n    let modeBuffer = '';\n    let relevance = 0;\n    let index = 0;\n    let iterations = 0;\n    let 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        // avoid possible breakage with v10 clients expecting\n        // this to always be an integer\n        relevance: Math.floor(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    const plaintext = justTextHighlightResult(code);\n\n    const results = languageSubset.filter(getLanguage).filter(autoDetection).map(name =>\n      _highlight(name, code, false)\n    );\n    results.unshift(plaintext); // plaintext is always an option\n\n    const sorted = results.sort((a, b) => {\n      // sort base on relevance\n      if (a.relevance !== b.relevance) return b.relevance - a.relevance;\n\n      // always award the tie to the base language\n      // ie if C++ and Arduino are tied, it's more likely to be C++\n      if (a.language && b.language) {\n        if (getLanguage(a.language).supersetOf === b.language) {\n          return 1;\n        } else if (getLanguage(b.language).supersetOf === a.language) {\n          return -1;\n        }\n      }\n\n      // otherwise say they are equal, which has the effect of sorting on\n      // relevance while preserving the original ordering - which is how ties\n      // have historically been settled, ie the language that comes first always\n      // wins in the case of a tie\n      return 0;\n    });\n\n    const [best, secondBest] = sorted;\n\n    /** @type {AutoHighlightResult} */\n    const result = best;\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 {HTMLElement} element\n   * @param {string} [currentLang]\n   * @param {string} [resultLang]\n   */\n  function updateClassName(element, currentLang, resultLang) {\n    const language = currentLang ? aliases[currentLang] : resultLang;\n\n    element.classList.add(\"hljs\");\n    if (language) element.classList.add(language);\n  }\n\n  /** @type {HLJSPlugin} */\n  const brPlugin = {\n    \"before:highlightElement\": ({ el }) => {\n      if (options.useBR) {\n        el.innerHTML = el.innerHTML.replace(/\\n/g, '').replace(/<br[ /]*>/g, '\\n');\n      }\n    },\n    \"after:highlightElement\": ({ result }) => {\n      if (options.useBR) {\n        result.value = result.value.replace(/\\n/g, \"<br>\");\n      }\n    }\n  };\n\n  const TAB_REPLACE_RE = /^(<[^>]+>|\\t)+/gm;\n  /** @type {HLJSPlugin} */\n  const tabReplacePlugin = {\n    \"after:highlightElement\": ({ result }) => {\n      if (options.tabReplace) {\n        result.value = result.value.replace(TAB_REPLACE_RE, (m) =>\n          m.replace(/\\t/g, options.tabReplace)\n        );\n      }\n    }\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 highlightElement(element) {\n    /** @type HTMLElement */\n    let node = null;\n    const language = blockLanguage(element);\n\n    if (shouldNotHighlight(language)) return;\n\n    // support for v10 API\n    fire(\"before:highlightElement\",\n      { el: element, language: language });\n\n    node = element;\n    const text = node.textContent;\n    const result = language ? highlight(text, { language, ignoreIllegals: true }) : highlightAuto(text);\n\n    // support for v10 API\n    fire(\"after:highlightElement\", { el: element, result, text });\n\n    element.innerHTML = result.value;\n    updateClassName(element, 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 {Partial<HLJSOptions>} userOptions\n   */\n  function configure(userOptions) {\n    if (userOptions.useBR) {\n      deprecated(\"10.3.0\", \"'useBR' will be removed entirely in v11.0\");\n      deprecated(\"10.3.0\", \"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  // TODO: remove v12, deprecated\n  const initHighlighting = () => {\n    if (initHighlighting.called) return;\n    initHighlighting.called = true;\n\n    deprecated(\"10.6.0\", \"initHighlighting() is deprecated.  Use highlightAll() instead.\");\n\n    const blocks = document.querySelectorAll('pre code');\n    blocks.forEach(highlightElement);\n  };\n\n  // Higlights all when DOMContentLoaded fires\n  // TODO: remove v12, deprecated\n  function initHighlightingOnLoad() {\n    deprecated(\"10.6.0\", \"initHighlightingOnLoad() is deprecated.  Use highlightAll() instead.\");\n    wantsHighlight = true;\n  }\n\n  let wantsHighlight = false;\n\n  /**\n   * auto-highlights all pre>code elements on the page\n   */\n  function highlightAll() {\n    // if we are called too early in the loading process\n    if (document.readyState === \"loading\") {\n      wantsHighlight = true;\n      return;\n    }\n\n    const blocks = document.querySelectorAll('pre code');\n    blocks.forEach(highlightElement);\n  }\n\n  function boot() {\n    // if a highlight was requested before DOM was loaded, do now\n    if (wantsHighlight) highlightAll();\n  }\n\n  // make sure we are in the browser environment\n  if (typeof window !== 'undefined' && window.addEventListener) {\n    window.addEventListener('DOMContentLoaded', boot, 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    let lang = null;\n    try {\n      lang = languageDefinition(hljs);\n    } catch (error$1) {\n      error(\"Language definition for '{}' could not be registered.\".replace(\"{}\", languageName));\n      // hard or soft error\n      if (!SAFE_MODE) { throw error$1; } else { error(error$1); }\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   * Remove a language grammar module\n   *\n   * @param {string} languageName\n   */\n  function unregisterLanguage(languageName) {\n    delete languages[languageName];\n    for (const alias of Object.keys(aliases)) {\n      if (aliases[alias] === languageName) {\n        delete aliases[alias];\n      }\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    deprecated(\"10.4.0\", \"requireLanguage will be removed entirely in v11.\");\n    deprecated(\"10.4.0\", \"Please see https://github.com/highlightjs/highlight.js/pull/2844\");\n\n    const lang = getLanguage(name);\n    if (lang) { return lang; }\n\n    const 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.toLowerCase()] = 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    const lang = getLanguage(name);\n    return lang && !lang.disableAutodetect;\n  }\n\n  /**\n   * Upgrades the old highlightBlock plugins to the new\n   * highlightElement API\n   * @param {HLJSPlugin} plugin\n   */\n  function upgradePluginAPI(plugin) {\n    // TODO: remove with v12\n    if (plugin[\"before:highlightBlock\"] && !plugin[\"before:highlightElement\"]) {\n      plugin[\"before:highlightElement\"] = (data) => {\n        plugin[\"before:highlightBlock\"](\n          Object.assign({ block: data.el }, data)\n        );\n      };\n    }\n    if (plugin[\"after:highlightBlock\"] && !plugin[\"after:highlightElement\"]) {\n      plugin[\"after:highlightElement\"] = (data) => {\n        plugin[\"after:highlightBlock\"](\n          Object.assign({ block: data.el }, data)\n        );\n      };\n    }\n  }\n\n  /**\n   * @param {HLJSPlugin} plugin\n   */\n  function addPlugin(plugin) {\n    upgradePluginAPI(plugin);\n    plugins.push(plugin);\n  }\n\n  /**\n   *\n   * @param {PluginEvent} event\n   * @param {any} args\n   */\n  function fire(event, args) {\n    const 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    deprecated(\"10.2.0\", \"fixMarkup will be removed entirely in v11.0\");\n    deprecated(\"10.2.0\", \"Please see https://github.com/highlightjs/highlight.js/issues/2534\");\n\n    return fixMarkup(arg);\n  }\n\n  /**\n   *\n   * @param {HighlightedHTMLElement} el\n   */\n  function deprecateHighlightBlock(el) {\n    deprecated(\"10.7.0\", \"highlightBlock will be removed entirely in v12.0\");\n    deprecated(\"10.7.0\", \"Please use highlightElement now.\");\n\n    return highlightElement(el);\n  }\n\n  /* Interface definition */\n  Object.assign(hljs, {\n    highlight,\n    highlightAuto,\n    highlightAll,\n    fixMarkup: deprecateFixMarkup,\n    highlightElement,\n    // TODO: Remove with v12 API\n    highlightBlock: deprecateHighlightBlock,\n    configure,\n    initHighlighting,\n    initHighlightingOnLoad,\n    registerLanguage,\n    unregisterLanguage,\n    listLanguages,\n    getLanguage,\n    registerAliases,\n    requireLanguage,\n    autoDetection,\n    inherit: inherit$1,\n    addPlugin,\n    // plugins for frameworks\n    vuePlugin: BuildVuePlugin(hljs).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      deepFreezeEs6(MODES[key]);\n    }\n  }\n\n  // merge all the modes/regexs into our main object\n  Object.assign(hljs, MODES);\n\n  // built-in plugins, likely to be moved out of core in the future\n  hljs.addPlugin(brPlugin); // slated to be removed in v11\n  hljs.addPlugin(mergeHTMLPlugin);\n  hljs.addPlugin(tabReplacePlugin);\n  return hljs;\n};\n\n// export an \"instance\" of the highlighter\nvar highlight = HLJS({});\n\nmodule.exports = highlight;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorKeymap = require('prosemirror-keymap');\nvar prosemirrorState = require('prosemirror-state');\nvar prosemirrorView = require('prosemirror-view');\nvar prosemirrorModel = require('prosemirror-model');\n\n// ::- Gap cursor selections are represented using this class. Its\n// `$anchor` and `$head` properties both point at the cursor position.\nvar GapCursor = (function (Selection$$1) {\n  function GapCursor($pos) {\n    Selection$$1.call(this, $pos, $pos);\n  }\n\n  if ( Selection$$1 ) GapCursor.__proto__ = Selection$$1;\n  GapCursor.prototype = Object.create( Selection$$1 && Selection$$1.prototype );\n  GapCursor.prototype.constructor = GapCursor;\n\n  GapCursor.prototype.map = function map (doc, mapping) {\n    var $pos = doc.resolve(mapping.map(this.head));\n    return GapCursor.valid($pos) ? new GapCursor($pos) : Selection$$1.near($pos)\n  };\n\n  GapCursor.prototype.content = function content () { return prosemirrorModel.Slice.empty };\n\n  GapCursor.prototype.eq = function eq (other) {\n    return other instanceof GapCursor && other.head == this.head\n  };\n\n  GapCursor.prototype.toJSON = function toJSON () {\n    return {type: \"gapcursor\", pos: this.head}\n  };\n\n  GapCursor.fromJSON = function 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  GapCursor.prototype.getBookmark = function getBookmark () { return new GapBookmark(this.anchor) };\n\n  GapCursor.valid = function valid ($pos) {\n    var parent = $pos.parent;\n    if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos)) { return false }\n    var override = parent.type.spec.allowGapCursor;\n    if (override != null) { return override }\n    var deflt = parent.contentMatchAt($pos.index()).defaultType;\n    return deflt && deflt.isTextblock\n  };\n\n  GapCursor.findFrom = function findFrom ($pos, dir, mustMove) {\n    if (!mustMove && GapCursor.valid($pos)) { return $pos }\n\n    var pos = $pos.pos, next = null;\n    // Scan up from this position\n    for (var d = $pos.depth;; d--) {\n      var parent = $pos.node(d);\n      if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {\n        next = parent.maybeChild(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);\n        break\n      } else if (d == 0) {\n        return null\n      }\n      pos += dir;\n      var $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      next = dir > 0 ? next.firstChild : next.lastChild;\n      if (!next) { break }\n      pos += dir;\n      var $cur$1 = $pos.doc.resolve(pos);\n      if (GapCursor.valid($cur$1)) { return $cur$1 }\n    }\n\n    return null\n  };\n\n  return GapCursor;\n}(prosemirrorState.Selection));\n\nGapCursor.prototype.visible = false;\n\nprosemirrorState.Selection.jsonID(\"gapcursor\", GapCursor);\n\nvar GapBookmark = function GapBookmark(pos) {\n  this.pos = pos;\n};\nGapBookmark.prototype.map = function map (mapping) {\n  return new GapBookmark(mapping.map(this.pos))\n};\nGapBookmark.prototype.resolve = function resolve (doc) {\n  var $pos = doc.resolve(this.pos);\n  return GapCursor.valid($pos) ? new GapCursor($pos) : prosemirrorState.Selection.near($pos)\n};\n\nfunction closedBefore($pos) {\n  for (var d = $pos.depth; d >= 0; d--) {\n    var 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 (var 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 (var d = $pos.depth; d >= 0; d--) {\n    var index = $pos.indexAfter(d), parent = $pos.node(d);\n    if (index == parent.childCount) { continue }\n    for (var 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\n// :: () → Plugin\n// Create a gap cursor plugin. When enabled, this will capture clicks\n// near and arrow-key-motion past places that don't have a normally\n// selectable position nearby, and create a gap cursor selection for\n// them. The cursor is drawn as an element with class\n// `ProseMirror-gapcursor`. You can either include\n// `style/gapcursor.css` from the package's directory or add your own\n// styles to make it visible.\nvar gapCursor = function() {\n  return new prosemirrorState.Plugin({\n    props: {\n      decorations: drawGapCursor,\n\n      createSelectionBetween: function createSelectionBetween(_view, $anchor, $head) {\n        if ($anchor.pos == $head.pos && GapCursor.valid($head)) { return new GapCursor($head) }\n      },\n\n      handleClick: handleClick,\n      handleKeyDown: handleKeyDown\n    }\n  })\n};\n\nvar handleKeyDown = prosemirrorKeymap.keydownHandler({\n  \"ArrowLeft\": arrow(\"horiz\", -1),\n  \"ArrowRight\": arrow(\"horiz\", 1),\n  \"ArrowUp\": arrow(\"vert\", -1),\n  \"ArrowDown\": arrow(\"vert\", 1)\n});\n\nfunction arrow(axis, dir) {\n  var dirStr = axis == \"vert\" ? (dir > 0 ? \"down\" : \"up\") : (dir > 0 ? \"right\" : \"left\");\n  return function(state, dispatch, view) {\n    var sel = state.selection;\n    var $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;\n    if (sel instanceof prosemirrorState.TextSelection) {\n      if (!view.endOfTextblock(dirStr)) { return false }\n      mustMove = false;\n      $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());\n    }\n    var $found = GapCursor.findFrom($start, dir, mustMove);\n    if (!$found) { return false }\n    if (dispatch) { dispatch(state.tr.setSelection(new GapCursor($found))); }\n    return true\n  }\n}\n\nfunction handleClick(view, pos, event) {\n  if (view.someProp(\"editable\", function (editable) { return editable(view.state) === false; })) { return false }\n  var $pos = view.state.doc.resolve(pos);\n  if (!GapCursor.valid($pos)) { return false }\n  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});\n  var inside = ref.inside;\n  if (inside > -1 && prosemirrorState.NodeSelection.isSelectable(view.state.doc.nodeAt(inside))) { return false }\n  view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));\n  return true\n}\n\nfunction drawGapCursor(state) {\n  if (!(state.selection instanceof GapCursor)) { return null }\n  var node = document.createElement(\"div\");\n  node.className = \"ProseMirror-gapcursor\";\n  return prosemirrorView.DecorationSet.create(state.doc, [prosemirrorView.Decoration.widget(state.selection.head, node, {key: \"gapcursor\"})])\n}\n\nexports.gapCursor = gapCursor;\nexports.GapCursor = GapCursor;\n//# sourceMappingURL=index.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorState = require('prosemirror-state');\nvar prosemirrorTransform = require('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.\nfunction dropCursor(options) {\n  if ( options === void 0 ) options = {};\n\n  return new prosemirrorState.Plugin({\n    view: function view(editorView) { return new DropCursorView(editorView, options) }\n  })\n}\n\nvar DropCursorView = function DropCursorView(editorView, options) {\n  var this$1 = this;\n\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(function (name) {\n    var handler = function (e) { return this$1[name](e); };\n    editorView.dom.addEventListener(name, handler);\n    return {name: name, handler: handler}\n  });\n};\n\nDropCursorView.prototype.destroy = function destroy () {\n    var this$1 = this;\n\n  this.handlers.forEach(function (ref) {\n      var name = ref.name;\n      var handler = ref.handler;\n\n      return this$1.editorView.dom.removeEventListener(name, handler);\n    });\n};\n\nDropCursorView.prototype.update = function update (editorView, prevState) {\n  if (this.cursorPos != null && prevState.doc != editorView.state.doc) { this.updateOverlay(); }\n};\n\nDropCursorView.prototype.setCursor = function 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\nDropCursorView.prototype.updateOverlay = function updateOverlay () {\n  var $pos = this.editorView.state.doc.resolve(this.cursorPos), rect;\n  if (!$pos.parent.inlineContent) {\n    var before = $pos.nodeBefore, after = $pos.nodeAfter;\n    if (before || after) {\n      var nodeRect = this.editorView.nodeDOM(this.cursorPos - (before ?before.nodeSize : 0)).getBoundingClientRect();\n      var 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    var 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  var 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  var 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\nDropCursorView.prototype.scheduleRemoval = function scheduleRemoval (timeout) {\n    var this$1 = this;\n\n  clearTimeout(this.timeout);\n  this.timeout = setTimeout(function () { return this$1.setCursor(null); }, timeout);\n};\n\nDropCursorView.prototype.dragover = function dragover (event) {\n  if (!this.editorView.editable) { return }\n  var pos = this.editorView.posAtCoords({left: event.clientX, top: event.clientY});\n  if (pos) {\n    var target = pos.pos;\n    if (this.editorView.dragging && this.editorView.dragging.slice) {\n      target = prosemirrorTransform.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\nDropCursorView.prototype.dragend = function dragend () {\n  this.scheduleRemoval(20);\n};\n\nDropCursorView.prototype.drop = function drop () {\n  this.scheduleRemoval(20);\n};\n\nDropCursorView.prototype.dragleave = function dragleave (event) {\n  if (event.target == this.editorView.dom || !this.editorView.dom.contains(event.relatedTarget))\n    { this.setCursor(null); }\n};\n\nexports.dropCursor = dropCursor;\n//# sourceMappingURL=dropcursor.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar RopeSequence = _interopDefault(require('rope-sequence'));\nvar prosemirrorTransform = require('prosemirror-transform');\nvar prosemirrorState = require('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\nvar max_empty_items = 500;\n\nvar Branch = function Branch(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.\nBranch.prototype.popEvent = function popEvent (state, preserveItems) {\n    var this$1 = this;\n\n  if (this.eventCount == 0) { return null }\n\n  var end = this.items.length;\n  for (;; end--) {\n    var next = this$1.items.get(end - 1);\n    if (next.selection) { --end; break }\n  }\n\n  var remap, mapFrom;\n  if (preserveItems) {\n    remap = this.remapping(end, this.items.length);\n    mapFrom = remap.maps.length;\n  }\n  var transform = state.tr;\n  var selection, remaining;\n  var addAfter = [], addBefore = [];\n\n  this.items.forEach(function (item, i) {\n    if (!item.step) {\n      if (!remap) {\n        remap = this$1.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      var 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$1.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this$1.eventCount - 1);\n      return false\n    }\n  }, this.items.length, 0);\n\n  return {remaining: remaining, transform: transform, selection: selection}\n};\n\n// : (Transform, ?SelectionBookmark, Object) → Branch\n// Create a new branch with the given transform added.\nBranch.prototype.addTransform = function addTransform (transform, selection, histOptions, preserveItems) {\n  var newItems = [], eventCount = this.eventCount;\n  var oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;\n\n  for (var i = 0; i < transform.steps.length; i++) {\n    var step = transform.steps[i].invert(transform.docs[i]);\n    var item = new Item(transform.mapping.maps[i], step, selection), merged = (void 0);\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  var 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\nBranch.prototype.remapping = function remapping (from, to) {\n  var maps = new prosemirrorTransform.Mapping;\n  this.items.forEach(function (item, i) {\n    var mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from\n        ? mirrorPos = maps.maps.length - item.mirrorOffset : null;\n    maps.appendMap(item.map, mirrorPos);\n  }, from, to);\n  return maps\n};\n\nBranch.prototype.addMaps = function addMaps (array) {\n  if (this.eventCount == 0) { return this }\n  return new Branch(this.items.append(array.map(function (map) { return 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.\nBranch.prototype.rebased = function rebased (rebasedTransform, rebasedCount) {\n  if (!this.eventCount) { return this }\n\n  var rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);\n\n  var mapping = rebasedTransform.mapping;\n  var newUntil = rebasedTransform.steps.length;\n  var eventCount = this.eventCount;\n  this.items.forEach(function (item) { if (item.selection) { eventCount--; } }, start);\n\n  var iRebased = rebasedCount;\n  this.items.forEach(function (item) {\n    var pos = mapping.getMirror(--iRebased);\n    if (pos == null) { return }\n    newUntil = Math.min(newUntil, pos);\n    var map = mapping.maps[pos];\n    if (item.step) {\n      var step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);\n      var 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  var newMaps = [];\n  for (var i = rebasedCount; i < newUntil; i++)\n    { newMaps.push(new Item(mapping.maps[i])); }\n  var items = this.items.slice(0, start).append(newMaps).append(rebasedItems);\n  var 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\nBranch.prototype.emptyItemCount = function emptyItemCount () {\n  var count = 0;\n  this.items.forEach(function (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.\nBranch.prototype.compress = function compress (upto) {\n    if ( upto === void 0 ) upto = this.items.length;\n\n  var remap = this.remapping(0, upto), mapFrom = remap.maps.length;\n  var items = [], events = 0;\n  this.items.forEach(function (item, i) {\n    if (i >= upto) {\n      items.push(item);\n      if (item.selection) { events++; }\n    } else if (item.step) {\n      var step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();\n      mapFrom--;\n      if (map) { remap.appendMap(map, mapFrom); }\n      if (step) {\n        var selection = item.selection && item.selection.map(remap.slice(mapFrom));\n        if (selection) { events++; }\n        var 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\nBranch.empty = new Branch(RopeSequence.empty, 0);\n\nfunction cutOffEvents(items, n) {\n  var cutPoint;\n  items.forEach(function (item, i) {\n    if (item.selection && (n-- == 0)) {\n      cutPoint = i;\n      return false\n    }\n  });\n  return items.slice(cutPoint)\n}\n\nvar Item = function Item(map, step, selection, mirrorOffset) {\n  this.map = map;\n  this.step = step;\n  this.selection = selection;\n  this.mirrorOffset = mirrorOffset;\n};\n\nItem.prototype.merge = function merge (other) {\n  if (this.step && other.step && !other.selection) {\n    var step = other.step.merge(this.step);\n    if (step) { return new Item(step.getMap().invert(), step, this.selection) }\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.\nvar HistoryState = function HistoryState(done, undone, prevRanges, prevTime) {\n  this.done = done;\n  this.undone = undone;\n  this.prevRanges = prevRanges;\n  this.prevTime = prevTime;\n};\n\nvar DEPTH_OVERFLOW = 20;\n\n// : (HistoryState, EditorState, Transaction, Object)\n// Record a transformation in undo history.\nfunction applyTransaction(history, state, tr, options) {\n  var 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  var 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    var newGroup = history.prevTime < (tr.time || 0) - options.newGroupDelay ||\n        !appended && !isAdjacentTo(tr, history.prevRanges);\n    var 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  var adjacent = false;\n  transform.mapping.maps[0].forEach(function (start, end) {\n    for (var 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  var result = [];\n  map.forEach(function (_from, _to, from, to) { return result.push(from, to); });\n  return result\n}\n\nfunction mapRanges(ranges, mapping) {\n  if (!ranges) { return null }\n  var result = [];\n  for (var i = 0; i < ranges.length; i += 2) {\n    var 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  var preserveItems = mustPreserveItems(state), histOptions = historyKey.get(state).spec.config;\n  var pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);\n  if (!pop) { return }\n\n  var selection = pop.selection.resolve(pop.transform.doc);\n  var added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(),\n                                                                  histOptions, preserveItems);\n\n  var newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0);\n  dispatch(pop.transform.setSelection(selection).setMeta(historyKey, {redo: redo, historyState: newHist}).scrollIntoView());\n}\n\nvar cachedPreserveItems = false;\nvar 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  var plugins = state.plugins;\n  if (cachedPreserveItemsPlugins != plugins) {\n    cachedPreserveItems = false;\n    cachedPreserveItemsPlugins = plugins;\n    for (var 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).\nfunction closeHistory(tr) {\n  return tr.setMeta(closeHistoryKey, true)\n}\n\nvar historyKey = new prosemirrorState.PluginKey(\"history\");\nvar closeHistoryKey = new prosemirrorState.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.\nfunction history(config) {\n  config = {depth: config && config.depth || 100,\n            newGroupDelay: config && config.newGroupDelay || 500};\n  return new prosemirrorState.Plugin({\n    key: historyKey,\n\n    state: {\n      init: function init() {\n        return new HistoryState(Branch.empty, Branch.empty, null, 0)\n      },\n      apply: function apply(tr, hist, state) {\n        return applyTransaction(hist, state, tr, config)\n      }\n    },\n\n    config: config\n  })\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// A command function that undoes the last change, if any.\nfunction undo(state, dispatch) {\n  var 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.\nfunction redo(state, dispatch) {\n  var 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.\nfunction undoDepth(state) {\n  var 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.\nfunction redoDepth(state) {\n  var hist = historyKey.getState(state);\n  return hist ? hist.undone.eventCount : 0\n}\n\nexports.HistoryState = HistoryState;\nexports.closeHistory = closeHistory;\nexports.history = history;\nexports.undo = undo;\nexports.redo = redo;\nexports.undoDepth = undoDepth;\nexports.redoDepth = redoDepth;\n//# sourceMappingURL=history.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorState = require('prosemirror-state');\n\nvar Rebaseable = function Rebaseable(step, inverted, origin) {\n  this.step = step;\n  this.inverted = inverted;\n  this.origin = origin;\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.\nfunction rebaseSteps(steps, over, transform) {\n  for (var i = steps.length - 1; i >= 0; i--) { transform.step(steps[i].inverted); }\n  for (var i$1 = 0; i$1 < over.length; i$1++) { transform.step(over[i$1]); }\n  var result = [];\n  for (var i$2 = 0, mapFrom = steps.length; i$2 < steps.length; i$2++) {\n    var mapped = steps[i$2].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$2].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.\nvar CollabState = function CollabState(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\nfunction unconfirmedFrom(transform) {\n  var result = [];\n  for (var 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\nvar collabKey = new prosemirrorState.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.\nfunction collab(config) {\n  if ( config === void 0 ) config = {};\n\n  config = {version: config.version || 0,\n            clientID: config.clientID == null ? Math.floor(Math.random() * 0xFFFFFFFF) : config.clientID};\n\n  return new prosemirrorState.Plugin({\n    key: collabKey,\n\n    state: {\n      init: function () { return new CollabState(config.version, []); },\n      apply: function apply(tr, collab) {\n        var 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: 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.\nfunction 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  var collabState = collabKey.getState(state);\n  var version = collabState.version + steps.length;\n  var ourID = collabKey.get(state).spec.config.clientID;\n\n  // Find out which prefix of the steps originated with us\n  var ours = 0;\n  while (ours < clientIDs.length && clientIDs[ours] == ourID) { ++ours; }\n  var 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  var nUnconfirmed = unconfirmed.length;\n  var tr = state.tr;\n  if (nUnconfirmed) {\n    unconfirmed = rebaseSteps(unconfirmed, steps, tr);\n  } else {\n    for (var i = 0; i < steps.length; i++) { tr.step(steps[i]); }\n    unconfirmed = [];\n  }\n\n  var newCollabState = new CollabState(version, unconfirmed);\n  if (options && options.mapSelectionBackward && state.selection instanceof prosemirrorState.TextSelection) {\n    tr.setSelection(prosemirrorState.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.\nfunction sendableSteps(state) {\n  var collabState = collabKey.getState(state);\n  if (collabState.unconfirmed.length == 0) { return null }\n  return {\n    version: collabState.version,\n    steps: collabState.unconfirmed.map(function (s) { return s.step; }),\n    clientID: collabKey.get(state).spec.config.clientID,\n    get origins() { return this._origins || (this._origins = collabState.unconfirmed.map(function (s) { return 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.\nfunction getVersion(state) {\n  return collabKey.getState(state).version\n}\n\nexports.rebaseSteps = rebaseSteps;\nexports.collab = collab;\nexports.receiveTransaction = receiveTransaction;\nexports.sendableSteps = sendableSteps;\nexports.getVersion = getVersion;\n//# sourceMappingURL=collab.js.map\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(value, {language: name, ignoreIllegals: 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","export * from \"-!../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--6-oneOf-1-0!../../../../node_modules/css-loader/index.js??ref--6-oneOf-1-1!../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../node_modules/postcss-loader/src/index.js??ref--6-oneOf-1-2!../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./NotificationConfig.vue?vue&type=style&index=0&id=63d14958&prod&scoped=true&lang=css&\"","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}\nvar 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 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\nfunction 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 && 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\nmodule.exports = keyName\nkeyName.base = base\nkeyName.shift = shift\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar keyName = _interopDefault(require('w3c-keyname'));\nvar prosemirrorState = require('prosemirror-state');\n\n// declare global: navigator\n\nvar mac = typeof navigator != \"undefined\" ? /Mac/.test(navigator.platform) : false;\n\nfunction normalizeKeyName(name) {\n  var parts = name.split(/-(?!$)/), result = parts[parts.length - 1];\n  if (result == \"Space\") { result = \" \"; }\n  var alt, ctrl, shift, meta;\n  for (var i = 0; i < parts.length - 1; i++) {\n    var 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  var copy = Object.create(null);\n  for (var 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).\nfunction keymap(bindings) {\n  return new prosemirrorState.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) handles them.\nfunction keydownHandler(bindings) {\n  var map = normalize(bindings);\n  return function(view, event) {\n    var name = keyName(event), isChar = name.length == 1 && name != \" \", baseName;\n    var 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) &&\n        (baseName = keyName.base[event.keyCode]) && baseName != name) {\n      var fromCode = map[modifiers(baseName, event, true)];\n      if (fromCode && fromCode(view.state, view.dispatch, view)) { return true }\n    }\n    return false\n  }\n}\n\nexports.keymap = keymap;\nexports.keydownHandler = keydownHandler;\n//# sourceMappingURL=keymap.js.map\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","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('form',{staticClass:\"col-md-8 mx-auto\",on:{\"submit\":function($event){$event.preventDefault();return _vm.onSubmit($event)}}},[(_vm.loading)?_c('div',{staticClass:\"loader\"}):_vm._e(),_c('div',{directives:[{name:\"show\",rawName:\"v-show\",value:(!_vm.loading),expression:\"!loading\"}]},[_c('div',{staticClass:\"btn-group\",attrs:{\"role\":\"group\",\"aria-label\":\"Basic example\"}},[_c('button',{staticClass:\"btn btn-primary\",attrs:{\"type\":\"button\"},on:{\"click\":_vm.backToList}},[_c('i',{staticClass:\"fas fa-th-list\"}),_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.$t('backToList'))+\"\\n\\t\\t\\t\")])]),_c('page-title',{attrs:{\"title\":_vm.$t('notificationConfig.title')}}),_c('div',{staticClass:\"card row\"},[_c('div',{staticClass:\"card-header bg-primary text-white\"},[_c('div',{staticClass:\"card-title h5 m-0\"},[_vm._v(_vm._s(_vm.$t('notificationConfig.config')))])]),_c('div',{staticClass:\"card-body\"},[_c('div',{staticClass:\"row\"},[_c('div',{staticClass:\"form-group col-12\"},[_c('label',{staticClass:\"font-weight-bold required\",attrs:{\"for\":'notificationType' + _vm._uid}},[_vm._v(_vm._s(_vm.$t('notificationConfig.type')))]),_c('input',{directives:[{name:\"model\",rawName:\"v-model\",value:(_vm.notificationConfig.notificationType),expression:\"notificationConfig.notificationType\"}],staticClass:\"form-control\",attrs:{\"type\":\"text\",\"readonly\":\"\",\"id\":'eventType' + _vm._uid,\"name\":'eventType' + _vm._uid,\"data-vv-as\":_vm.$t('notificationConfig.type')},domProps:{\"value\":(_vm.notificationConfig.notificationType)},on:{\"input\":function($event){if($event.target.composing){ return; }_vm.$set(_vm.notificationConfig, \"notificationType\", $event.target.value)}}}),(_vm.errors.has('notificationType' + _vm._uid))?_c('span',{staticClass:\"text-danger\"},[_vm._v(_vm._s(_vm.errors.first('notificationType' + _vm._uid)))]):_vm._e()])]),_c('div',{staticClass:\"row\"},[_c('div',{staticClass:\"form-group col-12\"},[_c('label',{attrs:{\"for\":'notificationType' + _vm._uid}},[_vm._v(_vm._s(_vm.$t('notificationConfig.keywordsDescription')))]),_c('textarea',{directives:[{name:\"model\",rawName:\"v-model\",value:(_vm.notificationConfig.keywords),expression:\"notificationConfig.keywords\"}],staticClass:\"form-control\",attrs:{\"readonly\":\"\",\"data-vv-as\":_vm.$t('notificationConfig.keywords'),\"rows\":\"8\"},domProps:{\"value\":(_vm.notificationConfig.keywords)},on:{\"input\":function($event){if($event.target.composing){ return; }_vm.$set(_vm.notificationConfig, \"keywords\", $event.target.value)}}})])]),_c('div',{staticClass:\"row\"},[_c('div',{staticClass:\"form-group col-12\"},[_c('label',{staticClass:\"font-weight-bold required\",attrs:{\"for\":'subject' + _vm._uid}},[_vm._v(_vm._s(_vm.$t('notificationConfig.subject')))]),_c('input',{directives:[{name:\"model\",rawName:\"v-model\",value:(_vm.notificationConfig.messageSubject),expression:\"notificationConfig.messageSubject\"}],staticClass:\"form-control\",attrs:{\"type\":\"text\",\"id\":'subject' + _vm._uid,\"name\":'subject' + _vm._uid,\"data-vv-as\":_vm.$t('notificationConfig.subject')},domProps:{\"value\":(_vm.notificationConfig.messageSubject)},on:{\"input\":function($event){if($event.target.composing){ return; }_vm.$set(_vm.notificationConfig, \"messageSubject\", $event.target.value)}}}),(_vm.errors.has('subject' + _vm._uid))?_c('span',{staticClass:\"text-danger\"},[_vm._v(_vm._s(_vm.errors.first('subject' + _vm._uid)))]):_vm._e()])]),_c('div',{staticClass:\"row\"},[_c('div',{staticClass:\"form-group col-12\"},[_c('label',{staticClass:\"font-weight-bold required\",attrs:{\"for\":'content' + _vm._uid}},[_vm._v(_vm._s(_vm.$t('notificationConfig.content')))]),_c('editor-menu-bar',{attrs:{\"editor\":_vm.editor},scopedSlots:_vm._u([{key:\"default\",fn:function(ref){\nvar commands = ref.commands;\nvar isActive = ref.isActive;\nreturn [_c('div',{staticClass:\"menubar\"},[_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.bold() },attrs:{\"type\":\"button\"},on:{\"click\":commands.bold}},[_c('i',{staticClass:\"fas fa-bold\"})]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.italic() },attrs:{\"type\":\"button\"},on:{\"click\":commands.italic}},[_c('i',{staticClass:\"fas fa-italic\"})]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.underline() },attrs:{\"type\":\"button\"},on:{\"click\":commands.underline}},[_c('i',{staticClass:\"fas fa-underline\"})]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.bullet_list() },attrs:{\"type\":\"button\"},on:{\"click\":commands.bullet_list}},[_c('i',{staticClass:\"fas fa-list-ul\"})]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.ordered_list() },attrs:{\"type\":\"button\"},on:{\"click\":commands.ordered_list}},[_c('i',{staticClass:\"fas fa-list-ol\"})]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.heading({ level: 1 }) },attrs:{\"type\":\"button\"},on:{\"click\":function($event){return commands.heading({ level: 1 })}}},[_vm._v(\"H1\")]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.heading({ level: 2 }) },attrs:{\"type\":\"button\"},on:{\"click\":function($event){return commands.heading({ level: 2 })}}},[_vm._v(\"H2\")]),_c('button',{staticClass:\"menubar__button\",class:{ 'is-active': isActive.heading({ level: 3 }) },attrs:{\"type\":\"button\"},on:{\"click\":function($event){return commands.heading({ level: 3 })}}},[_vm._v(\"H3\")])])]}}])}),_c('editor-content',{staticClass:\"editorContent\",attrs:{\"editor\":_vm.editor}})],1)])])]),_c('div',{staticClass:\"text-center mt-2 mb-5\"},[_c('button',{staticClass:\"btn btn-primary btn\",attrs:{\"type\":\"button\"},on:{\"click\":_vm.onSubmit}},[_c('i',{staticClass:\"fas fa-save\"}),_vm._v(\"\\n\\t\\t\\t\\t\"+_vm._s(_vm.$t('buttons.save.btnText'))+\"\\n\\t\\t\\t\")])])],1)])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\n    /*!\n    * tiptap-utils v1.8.0\n    * (c) 2019 Scrumpy UG (limited liability)\n    * @license MIT\n    */\n  \nimport { findSelectedNodeOfType, findParentNode } from 'prosemirror-utils';\n\nfunction _toConsumableArray(arr) {\n  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread();\n}\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) {\n    for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];\n\n    return arr2;\n  }\n}\n\nfunction _iterableToArray(iter) {\n  if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter);\n}\n\nfunction _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance\");\n}\n\nfunction getMarkAttrs(state, type) {\n  var _state$selection = state.selection,\n      from = _state$selection.from,\n      to = _state$selection.to;\n  var marks = [];\n  state.doc.nodesBetween(from, to, function (node) {\n    marks = [].concat(_toConsumableArray(marks), _toConsumableArray(node.marks));\n  });\n  var mark = marks.find(function (markItem) {\n    return markItem.type.name === type.name;\n  });\n\n  if (mark) {\n    return mark.attrs;\n  }\n\n  return {};\n}\n\nfunction getMarkRange() {\n  var $pos = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n  var type = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n\n  if (!$pos || !type) {\n    return false;\n  }\n\n  var start = $pos.parent.childAfter($pos.parentOffset);\n\n  if (!start.node) {\n    return false;\n  }\n\n  var link = start.node.marks.find(function (mark) {\n    return mark.type === type;\n  });\n\n  if (!link) {\n    return false;\n  }\n\n  var startIndex = $pos.index();\n  var startPos = $pos.start() + start.offset;\n  var endIndex = startIndex + 1;\n  var 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  var _state$selection = state.selection,\n      from = _state$selection.from,\n      $from = _state$selection.$from,\n      to = _state$selection.to,\n      empty = _state$selection.empty;\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(_ref) {\n  var types = _ref.types,\n      node = _ref.node;\n  return Array.isArray(types) && types.includes(node.type) || node.type === types;\n}\n\nfunction nodeIsActive(state, type) {\n  var attrs = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n\n  var predicate = function predicate(node) {\n    return node.type === type;\n  };\n\n  var 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, attrs);\n}\n\nexport { getMarkAttrs, getMarkRange, markIsActive, nodeEqualsType, nodeIsActive };\n","\n    /*!\n    * tiptap-commands v1.12.1\n    * (c) 2019 Scrumpy UG (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 () {\n  var text = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : '';\n  return function (state, dispatch) {\n    var $from = state.selection.$from;\n    var pos = $from.pos.pos;\n    dispatch(state.tr.insertText(text, pos));\n    return true;\n  };\n}\n\nfunction _toConsumableArray(arr) {\n  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread();\n}\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) {\n    for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];\n\n    return arr2;\n  }\n}\n\nfunction _iterableToArray(iter) {\n  if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter);\n}\n\nfunction _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance\");\n}\n\nfunction getMarksBetween(start, end, state) {\n  var marks = [];\n  state.doc.nodesBetween(start, end, function (node, pos) {\n    marks = [].concat(_toConsumableArray(marks), _toConsumableArray(node.marks.map(function (mark) {\n      return {\n        start: pos,\n        end: pos + node.nodeSize,\n        mark: mark\n      };\n    })));\n  });\n  return marks;\n}\n\nfunction markInputRule (regexp, markType, getAttrs) {\n  return new InputRule(regexp, function (state, match, start, end) {\n    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n    var tr = state.tr;\n    var m = match.length - 1;\n    var markEnd = end;\n    var markStart = start;\n\n    if (match[m]) {\n      var matchStart = start + match[0].indexOf(match[m - 1]);\n      var matchEnd = matchStart + match[m - 1].length;\n      var textStart = matchStart + match[m - 1].lastIndexOf(match[m]);\n      var textEnd = textStart + match[m].length;\n      var excludedMarks = getMarksBetween(start, end, state).filter(function (item) {\n        var excluded = item.mark.type.excluded;\n        return excluded.find(function (type) {\n          return type.name === markType.name;\n        });\n      }).filter(function (item) {\n        return item.end > matchStart;\n      });\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, function (state, match, start, end) {\n    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n    var tr = state.tr;\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  var handler = function handler(fragment) {\n    var nodes = [];\n    fragment.forEach(function (child) {\n      if (child.isText) {\n        var text = child.text;\n        var pos = 0;\n        var match;\n\n        do {\n          match = regexp.exec(text);\n\n          if (match) {\n            var start = match.index;\n            var end = start + match[0].length;\n            var 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: function transformPasted(slice) {\n        return new Slice(handler(slice.content), slice.openStart, slice.openEnd);\n      }\n    }\n  });\n}\n\nfunction markPasteRule (regexp, type, getAttrs) {\n  var handler = function handler(fragment) {\n    var nodes = [];\n    fragment.forEach(function (child) {\n      if (child.isText) {\n        var text = child.text,\n            marks = child.marks;\n        var pos = 0;\n        var match;\n        var isLink = !!marks.filter(function (x) {\n          return x.type.name === 'link';\n        })[0]; // eslint-disable-next-line\n\n        while (!isLink && (match = regexp.exec(text)) !== null) {\n          if (match[1]) {\n            var start = match.index;\n            var end = start + match[0].length;\n            var textStart = start + match[0].indexOf(match[1]);\n            var textEnd = textStart + match[1].length;\n            var 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)));\n      }\n    });\n    return Fragment.fromArray(nodes);\n  };\n\n  return new Plugin({\n    props: {\n      transformPasted: function transformPasted(slice) {\n        return new Slice(handler(slice.content), slice.openStart, slice.openEnd);\n      }\n    }\n  });\n}\n\nfunction removeMark (type) {\n  return function (state, dispatch) {\n    var tr = state.tr,\n        selection = state.selection;\n    var from = selection.from,\n        to = selection.to;\n    var $from = selection.$from,\n        empty = selection.empty;\n\n    if (empty) {\n      var 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 () {\n  var range = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n  var type = arguments.length > 1 ? arguments[1] : undefined;\n  var attrs = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  return function (state, dispatch) {\n    var _state$selection = state.selection,\n        $from = _state$selection.$from,\n        $to = _state$selection.$to;\n    var index = $from.index();\n    var from = range ? range.from : $from.pos;\n    var 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) {\n  var attrs = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return function (state, dispatch) {\n    var $from = state.selection.$from;\n    var 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/master/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) {\n  var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;\n  var typesAfter = arguments.length > 3 ? arguments[3] : undefined;\n  var $pos = doc.resolve(pos);\n  var base = $pos.depth - depth;\n  var 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 (var d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n    var node = $pos.node(d);\n\n    var _index = $pos.index(d);\n\n    if (node.type.spec.isolating) return false;\n    var rest = node.content.cutByIndex(_index, node.childCount);\n    var 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  var index = $pos.indexAfter(base);\n  var 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/master/src/schema-list.js\n\n\nfunction splitToDefaultListItem(itemType) {\n  return function (state, dispatch) {\n    var _state$selection = state.selection,\n        $from = _state$selection.$from,\n        $to = _state$selection.$to,\n        node = _state$selection.node;\n    if (node && node.isBlock || $from.depth < 2 || !$from.sameParent($to)) return false;\n    var 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        var wrap = Fragment.empty;\n        var 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 (var 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\n\n        wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n\n        var _tr = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new Slice(wrap, keepItem ? 3 : 2, 2));\n\n        _tr.setSelection(state.selection.constructor.near(_tr.doc.resolve($from.pos + (keepItem ? 3 : 2))));\n\n        dispatch(_tr.scrollIntoView());\n      }\n\n      return true;\n    }\n\n    var nextType = $to.pos == $from.end() ? grandParent.contentMatchAt($from.indexAfter(-1)).defaultType : null;\n    var tr = state.tr.delete($from.pos, $to.pos);\n    /* Change starts from here */\n    // let types = nextType && [null, {type: nextType}]\n\n    var 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) {\n  var attrs = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  return function (state, dispatch, view) {\n    var 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 function (state, dispatch, view) {\n    var schema = state.schema,\n        selection = state.selection;\n    var $from = selection.$from,\n        $to = selection.$to;\n    var range = $from.blockRange($to);\n\n    if (!range) {\n      return false;\n    }\n\n    var parentList = findParentNode(function (node) {\n      return isList(node, schema);\n    })(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        var tr = state.tr;\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) {\n  return function (state, dispatch, view) {\n    var isActive = nodeIsActive(state, type);\n\n    if (isActive) {\n      return lift(state, dispatch);\n    }\n\n    return wrapIn(type)(state, dispatch, view);\n  };\n}\n\nfunction updateMark (type, attrs) {\n  return function (state, dispatch) {\n    var tr = state.tr,\n        selection = state.selection,\n        doc = state.doc;\n    var from = selection.from,\n        to = selection.to;\n    var $from = selection.$from,\n        empty = selection.empty;\n\n    if (empty) {\n      var range = getMarkRange($from, type);\n      from = range.from;\n      to = range.to;\n    }\n\n    var hasMark = doc.rangeHasMark(from, to, type);\n\n    if (hasMark) {\n      tr.removeMark(from, to, type);\n    }\n\n    tr.addMark(from, to, type.create(attrs));\n    return dispatch(tr);\n  };\n}\n\nexport { insertText, markInputRule, markPasteRule, nodeInputRule, pasteRule, removeMark, replaceText, setInlineBlockType, splitToDefaultListItem, toggleBlockType, toggleList, toggleWrap, updateMark };\n","\n    /*!\n    * tiptap v1.26.0\n    * (c) 2019 Scrumpy UG (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, getMarkAttrs, markIsActive, nodeIsActive } from 'tiptap-utils';\nimport Vue from 'vue';\nimport { setBlockType } from 'tiptap-commands';\n\nfunction _typeof(obj) {\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function (obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function (obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}\n\nfunction _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\n\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}\n\nfunction _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    if (enumerableOnly) symbols = symbols.filter(function (sym) {\n      return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n    });\n    keys.push.apply(keys, symbols);\n  }\n\n  return keys;\n}\n\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n\n    if (i % 2) {\n      ownKeys(source, true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(source).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n\n  return target;\n}\n\nfunction _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) _setPrototypeOf(subClass, superClass);\n}\n\nfunction _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}\n\nfunction _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}\n\nfunction _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}\n\nfunction _possibleConstructorReturn(self, call) {\n  if (call && (typeof call === \"object\" || typeof call === \"function\")) {\n    return call;\n  }\n\n  return _assertThisInitialized(self);\n}\n\nfunction _slicedToArray(arr, i) {\n  return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest();\n}\n\nfunction _toConsumableArray(arr) {\n  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread();\n}\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) {\n    for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];\n\n    return arr2;\n  }\n}\n\nfunction _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}\n\nfunction _iterableToArray(iter) {\n  if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter);\n}\n\nfunction _iterableToArrayLimit(arr, i) {\n  if (!(Symbol.iterator in Object(arr) || Object.prototype.toString.call(arr) === \"[object Arguments]\")) {\n    return;\n  }\n\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n  var _e = undefined;\n\n  try {\n    for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {\n      _arr.push(_s.value);\n\n      if (i && _arr.length === i) break;\n    }\n  } catch (err) {\n    _d = true;\n    _e = err;\n  } finally {\n    try {\n      if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n    } finally {\n      if (_d) throw _e;\n    }\n  }\n\n  return _arr;\n}\n\nfunction _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance\");\n}\n\nfunction _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance\");\n}\n\nfunction camelCase (str) {\n  return str.replace(/(?:^\\w|[A-Z]|\\b\\w)/g, function (word, index) {\n    return index === 0 ? word.toLowerCase() : word.toUpperCase();\n  }).replace(/\\s+/g, '');\n}\n\nvar ComponentView =\n/*#__PURE__*/\nfunction () {\n  function ComponentView(component, _ref) {\n    var editor = _ref.editor,\n        extension = _ref.extension,\n        parent = _ref.parent,\n        node = _ref.node,\n        view = _ref.view,\n        decorations = _ref.decorations,\n        getPos = _ref.getPos;\n\n    _classCallCheck(this, ComponentView);\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  _createClass(ComponentView, [{\n    key: \"createDOM\",\n    value: function createDOM() {\n      var _this = this;\n\n      var Component = Vue.extend(this.component);\n      var props = {\n        editor: this.editor,\n        node: this.node,\n        view: this.view,\n        getPos: function getPos() {\n          return _this.getPos();\n        },\n        decorations: this.decorations,\n        selected: false,\n        options: this.extension.options,\n        updateAttrs: function updateAttrs(attrs) {\n          return _this.updateAttrs(attrs);\n        }\n      };\n\n      if (typeof this.extension.setSelection === 'function') {\n        this.setSelection = this.extension.setSelection;\n      }\n\n      this.vm = new Component({\n        parent: this.parent,\n        propsData: props\n      }).$mount();\n      return this.vm.$el;\n    }\n  }, {\n    key: \"update\",\n    value: function 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: node,\n        decorations: decorations\n      });\n      return true;\n    }\n  }, {\n    key: \"updateComponentProps\",\n    value: function updateComponentProps(props) {\n      var _this2 = this;\n\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      var originalSilent = Vue.config.silent;\n      Vue.config.silent = true;\n      Object.entries(props).forEach(function (_ref2) {\n        var _ref3 = _slicedToArray(_ref2, 2),\n            key = _ref3[0],\n            value = _ref3[1];\n\n        _this2.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    key: \"updateAttrs\",\n    value: function updateAttrs(attrs) {\n      if (!this.view.editable) {\n        return;\n      }\n\n      var state = this.view.state;\n      var type = this.node.type;\n      var pos = this.getPos();\n\n      var newAttrs = _objectSpread2({}, this.node.attrs, {}, attrs);\n\n      var 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    key: \"ignoreMutation\",\n    value: function ignoreMutation(mutation) {\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    key: \"stopEvent\",\n    value: function stopEvent(event) {\n      var _this3 = this;\n\n      if (typeof this.extension.stopEvent === 'function') {\n        return this.extension.stopEvent(event);\n      }\n\n      var draggable = !!this.extension.schema.draggable; // support a custom drag handle\n\n      if (draggable && event.type === 'mousedown') {\n        var dragHandle = event.target.closest && event.target.closest('[data-drag-handle]');\n        var isValidDragHandle = dragHandle && (this.dom === dragHandle || this.dom.contains(dragHandle));\n\n        if (isValidDragHandle) {\n          this.captureEvents = false;\n          document.addEventListener('dragend', function () {\n            _this3.captureEvents = true;\n          }, {\n            once: true\n          });\n        }\n      }\n\n      var isCopy = event.type === 'copy';\n      var isPaste = event.type === 'paste';\n      var isCut = event.type === 'cut';\n      var 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    key: \"selectNode\",\n    value: function selectNode() {\n      this.updateComponentProps({\n        selected: true\n      });\n    }\n  }, {\n    key: \"deselectNode\",\n    value: function deselectNode() {\n      this.updateComponentProps({\n        selected: false\n      });\n    }\n  }, {\n    key: \"getMarkPos\",\n    value: function getMarkPos() {\n      var pos = this.view.posAtDOM(this.dom);\n      var resolvedPos = this.view.state.doc.resolve(pos);\n      var range = getMarkRange(resolvedPos, this.node.type);\n      return range;\n    }\n  }, {\n    key: \"destroy\",\n    value: function destroy() {\n      this.vm.$destroy();\n    }\n  }]);\n\n  return ComponentView;\n}();\n\nvar Emitter =\n/*#__PURE__*/\nfunction () {\n  function Emitter() {\n    _classCallCheck(this, Emitter);\n  }\n\n  _createClass(Emitter, [{\n    key: \"on\",\n    // Add an event listener for given event\n    value: function 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    key: \"emit\",\n    value: function emit(event) {\n      var _this = this;\n\n      for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n        args[_key - 1] = arguments[_key];\n      }\n\n      this._callbacks = this._callbacks || {};\n      var callbacks = this._callbacks[event];\n\n      if (callbacks) {\n        callbacks.forEach(function (callback) {\n          return callback.apply(_this, args);\n        });\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    key: \"off\",\n    value: function off(event, fn) {\n      if (!arguments.length) {\n        this._callbacks = {};\n      } else {\n        // event listeners for the given event\n        var callbacks = this._callbacks ? this._callbacks[event] : null;\n\n        if (callbacks) {\n          if (fn) {\n            this._callbacks[event] = callbacks.filter(function (cb) {\n              return cb !== fn;\n            }); // remove specific handler\n          } else {\n            delete this._callbacks[event]; // remove all handlers\n          }\n        }\n      }\n\n      return this;\n    }\n  }]);\n\n  return Emitter;\n}();\n\nvar Extension =\n/*#__PURE__*/\nfunction () {\n  function Extension() {\n    var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n\n    _classCallCheck(this, Extension);\n\n    this.options = _objectSpread2({}, this.defaultOptions, {}, options);\n  }\n\n  _createClass(Extension, [{\n    key: \"init\",\n    value: function init() {\n      return null;\n    }\n  }, {\n    key: \"bindEditor\",\n    value: function bindEditor() {\n      var editor = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n      this.editor = editor;\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules() {\n      return [];\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules() {\n      return [];\n    }\n  }, {\n    key: \"keys\",\n    value: function keys() {\n      return {};\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return null;\n    }\n  }, {\n    key: \"type\",\n    get: function get() {\n      return 'extension';\n    }\n  }, {\n    key: \"update\",\n    get: function get() {\n      return function () {};\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {};\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [];\n    }\n  }]);\n\n  return Extension;\n}();\n\nvar ExtensionManager =\n/*#__PURE__*/\nfunction () {\n  function ExtensionManager() {\n    var extensions = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];\n    var editor = arguments.length > 1 ? arguments[1] : undefined;\n\n    _classCallCheck(this, ExtensionManager);\n\n    extensions.forEach(function (extension) {\n      extension.bindEditor(editor);\n      extension.init();\n    });\n    this.extensions = extensions;\n  }\n\n  _createClass(ExtensionManager, [{\n    key: \"keymaps\",\n    value: function keymaps(_ref) {\n      var schema = _ref.schema;\n      var extensionKeymaps = this.extensions.filter(function (extension) {\n        return ['extension'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.keys;\n      }).map(function (extension) {\n        return extension.keys({\n          schema: schema\n        });\n      });\n      var nodeMarkKeymaps = this.extensions.filter(function (extension) {\n        return ['node', 'mark'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.keys;\n      }).map(function (extension) {\n        return extension.keys({\n          type: schema[\"\".concat(extension.type, \"s\")][extension.name],\n          schema: schema\n        });\n      });\n      return [].concat(_toConsumableArray(extensionKeymaps), _toConsumableArray(nodeMarkKeymaps)).map(function (keys) {\n        return keymap(keys);\n      });\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref2) {\n      var schema = _ref2.schema,\n          excludedExtensions = _ref2.excludedExtensions;\n      if (!(excludedExtensions instanceof Array) && excludedExtensions) return [];\n      var allowedExtensions = excludedExtensions instanceof Array ? this.extensions.filter(function (extension) {\n        return !excludedExtensions.includes(extension.name);\n      }) : this.extensions;\n      var extensionInputRules = allowedExtensions.filter(function (extension) {\n        return ['extension'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.inputRules;\n      }).map(function (extension) {\n        return extension.inputRules({\n          schema: schema\n        });\n      });\n      var nodeMarkInputRules = allowedExtensions.filter(function (extension) {\n        return ['node', 'mark'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.inputRules;\n      }).map(function (extension) {\n        return extension.inputRules({\n          type: schema[\"\".concat(extension.type, \"s\")][extension.name],\n          schema: schema\n        });\n      });\n      return [].concat(_toConsumableArray(extensionInputRules), _toConsumableArray(nodeMarkInputRules)).reduce(function (allInputRules, inputRules) {\n        return [].concat(_toConsumableArray(allInputRules), _toConsumableArray(inputRules));\n      }, []);\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules(_ref3) {\n      var schema = _ref3.schema,\n          excludedExtensions = _ref3.excludedExtensions;\n      if (!(excludedExtensions instanceof Array) && excludedExtensions) return [];\n      var allowedExtensions = excludedExtensions instanceof Array ? this.extensions.filter(function (extension) {\n        return !excludedExtensions.includes(extension.name);\n      }) : this.extensions;\n      var extensionPasteRules = allowedExtensions.filter(function (extension) {\n        return ['extension'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.pasteRules;\n      }).map(function (extension) {\n        return extension.pasteRules({\n          schema: schema\n        });\n      });\n      var nodeMarkPasteRules = allowedExtensions.filter(function (extension) {\n        return ['node', 'mark'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.pasteRules;\n      }).map(function (extension) {\n        return extension.pasteRules({\n          type: schema[\"\".concat(extension.type, \"s\")][extension.name],\n          schema: schema\n        });\n      });\n      return [].concat(_toConsumableArray(extensionPasteRules), _toConsumableArray(nodeMarkPasteRules)).reduce(function (allPasteRules, pasteRules) {\n        return [].concat(_toConsumableArray(allPasteRules), _toConsumableArray(pasteRules));\n      }, []);\n    }\n  }, {\n    key: \"commands\",\n    value: function commands(_ref4) {\n      var schema = _ref4.schema,\n          view = _ref4.view;\n      return this.extensions.filter(function (extension) {\n        return extension.commands;\n      }).reduce(function (allCommands, extension) {\n        var name = extension.name,\n            type = extension.type;\n        var commands = {};\n        var value = extension.commands(_objectSpread2({\n          schema: schema\n        }, ['node', 'mark'].includes(type) ? {\n          type: schema[\"\".concat(type, \"s\")][name]\n        } : {}));\n\n        var apply = function 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        var handle = function handle(_name, _value) {\n          if (Array.isArray(_value)) {\n            commands[_name] = function (attrs) {\n              return _value.forEach(function (callback) {\n                return apply(callback, attrs);\n              });\n            };\n          } else if (typeof _value === 'function') {\n            commands[_name] = function (attrs) {\n              return apply(_value, attrs);\n            };\n          }\n        };\n\n        if (_typeof(value) === 'object') {\n          Object.entries(value).forEach(function (_ref5) {\n            var _ref6 = _slicedToArray(_ref5, 2),\n                commandName = _ref6[0],\n                commandValue = _ref6[1];\n\n            handle(commandName, commandValue);\n          });\n        } else {\n          handle(name, value);\n        }\n\n        return _objectSpread2({}, allCommands, {}, commands);\n      }, {});\n    }\n  }, {\n    key: \"nodes\",\n    get: function get() {\n      return this.extensions.filter(function (extension) {\n        return extension.type === 'node';\n      }).reduce(function (nodes, _ref7) {\n        var name = _ref7.name,\n            schema = _ref7.schema;\n        return _objectSpread2({}, nodes, _defineProperty({}, name, schema));\n      }, {});\n    }\n  }, {\n    key: \"options\",\n    get: function get() {\n      var view = this.view;\n      return this.extensions.reduce(function (nodes, extension) {\n        return _objectSpread2({}, nodes, _defineProperty({}, extension.name, new Proxy(extension.options, {\n          set: function set(obj, prop, value) {\n            var changed = obj[prop] !== value;\n            Object.assign(obj, _defineProperty({}, prop, value));\n\n            if (changed) {\n              extension.update(view);\n            }\n\n            return true;\n          }\n        })));\n      }, {});\n    }\n  }, {\n    key: \"marks\",\n    get: function get() {\n      return this.extensions.filter(function (extension) {\n        return extension.type === 'mark';\n      }).reduce(function (marks, _ref8) {\n        var name = _ref8.name,\n            schema = _ref8.schema;\n        return _objectSpread2({}, marks, _defineProperty({}, name, schema));\n      }, {});\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return this.extensions.filter(function (extension) {\n        return extension.plugins;\n      }).reduce(function (allPlugins, _ref9) {\n        var plugins = _ref9.plugins;\n        return [].concat(_toConsumableArray(allPlugins), _toConsumableArray(plugins));\n      }, []);\n    }\n  }]);\n\n  return ExtensionManager;\n}();\n\nfunction injectCSS (css) {\n  if (process.env.NODE_ENV !== 'test') {\n    var style = document.createElement('style');\n    style.type = 'text/css';\n    style.textContent = css;\n    var _document = document,\n        head = _document.head;\n    var firstChild = head.firstChild;\n\n    if (firstChild) {\n      head.insertBefore(style, firstChild);\n    } else {\n      head.appendChild(style);\n    }\n  }\n}\n\nvar Mark =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(Mark, _Extension);\n\n  function Mark() {\n    var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n\n    _classCallCheck(this, Mark);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Mark).call(this, options));\n  }\n\n  _createClass(Mark, [{\n    key: \"command\",\n    value: function command() {\n      return function () {};\n    }\n  }, {\n    key: \"type\",\n    get: function get() {\n      return 'mark';\n    }\n  }, {\n    key: \"view\",\n    get: function get() {\n      return null;\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return null;\n    }\n  }]);\n\n  return Mark;\n}(Extension);\n\nfunction minMax() {\n  var value = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;\n  var min = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var max = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n  return Math.min(Math.max(parseInt(value, 10), min), max);\n}\n\nvar Node =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(Node, _Extension);\n\n  function Node() {\n    var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n\n    _classCallCheck(this, Node);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Node).call(this, options));\n  }\n\n  _createClass(Node, [{\n    key: \"command\",\n    value: function command() {\n      return function () {};\n    }\n  }, {\n    key: \"type\",\n    get: function get() {\n      return 'node';\n    }\n  }, {\n    key: \"view\",\n    get: function get() {\n      return null;\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return null;\n    }\n  }]);\n\n  return Node;\n}(Extension);\n\nvar Doc =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Doc, _Node);\n\n  function Doc() {\n    _classCallCheck(this, Doc);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Doc).apply(this, arguments));\n  }\n\n  _createClass(Doc, [{\n    key: \"name\",\n    get: function get() {\n      return 'doc';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        content: 'block+'\n      };\n    }\n  }]);\n\n  return Doc;\n}(Node);\n\nvar Paragraph =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Paragraph, _Node);\n\n  function Paragraph() {\n    _classCallCheck(this, Paragraph);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Paragraph).apply(this, arguments));\n  }\n\n  _createClass(Paragraph, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type;\n      return function () {\n        return setBlockType(type);\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'paragraph';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        content: 'inline*',\n        group: 'block',\n        draggable: false,\n        parseDOM: [{\n          tag: 'p'\n        }],\n        toDOM: function toDOM() {\n          return ['p', 0];\n        }\n      };\n    }\n  }]);\n\n  return Paragraph;\n}(Node);\n\nvar Text =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Text, _Node);\n\n  function Text() {\n    _classCallCheck(this, Text);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Text).apply(this, arguments));\n  }\n\n  _createClass(Text, [{\n    key: \"name\",\n    get: function get() {\n      return 'text';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        group: 'inline'\n      };\n    }\n  }]);\n\n  return Text;\n}(Node);\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\nvar Editor =\n/*#__PURE__*/\nfunction (_Emitter) {\n  _inherits(Editor, _Emitter);\n\n  function Editor() {\n    var _this;\n\n    var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n\n    _classCallCheck(this, Editor);\n\n    _this = _possibleConstructorReturn(this, _getPrototypeOf(Editor).call(this));\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      parseOptions: {},\n      injectCSS: true,\n      onInit: function onInit() {},\n      onTransaction: function onTransaction() {},\n      onUpdate: function onUpdate() {},\n      onFocus: function onFocus() {},\n      onBlur: function onBlur() {},\n      onPaste: function onPaste() {},\n      onDrop: function onDrop() {}\n    };\n    _this.events = ['init', 'transaction', 'update', 'focus', 'blur', 'paste', 'drop'];\n\n    _this.init(options);\n\n    return _this;\n  }\n\n  _createClass(Editor, [{\n    key: \"init\",\n    value: function init() {\n      var _this2 = this;\n\n      var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n      this.setOptions(_objectSpread2({}, this.defaultOptions, {}, options));\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(function (name) {\n        _this2.on(name, _this2.options[camelCase(\"on \".concat(name))] || function () {});\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    key: \"setOptions\",\n    value: function setOptions(options) {\n      this.options = _objectSpread2({}, this.options, {}, options);\n\n      if (this.view && this.state) {\n        this.view.updateState(this.state);\n      }\n    }\n  }, {\n    key: \"createExtensions\",\n    value: function createExtensions() {\n      return new ExtensionManager([].concat(_toConsumableArray(this.builtInExtensions), _toConsumableArray(this.options.extensions)), this);\n    }\n  }, {\n    key: \"createPlugins\",\n    value: function createPlugins() {\n      return this.extensions.plugins;\n    }\n  }, {\n    key: \"createKeymaps\",\n    value: function createKeymaps() {\n      return this.extensions.keymaps({\n        schema: this.schema\n      });\n    }\n  }, {\n    key: \"createInputRules\",\n    value: function createInputRules() {\n      return this.extensions.inputRules({\n        schema: this.schema,\n        excludedExtensions: this.options.disableInputRules\n      });\n    }\n  }, {\n    key: \"createPasteRules\",\n    value: function createPasteRules() {\n      return this.extensions.pasteRules({\n        schema: this.schema,\n        excludedExtensions: this.options.disablePasteRules\n      });\n    }\n  }, {\n    key: \"createCommands\",\n    value: function createCommands() {\n      return this.extensions.commands({\n        schema: this.schema,\n        view: this.view\n      });\n    }\n  }, {\n    key: \"createNodes\",\n    value: function createNodes() {\n      return this.extensions.nodes;\n    }\n  }, {\n    key: \"createMarks\",\n    value: function createMarks() {\n      return this.extensions.marks;\n    }\n  }, {\n    key: \"createSchema\",\n    value: function createSchema() {\n      return new Schema({\n        topNode: this.options.topNode,\n        nodes: this.nodes,\n        marks: this.marks\n      });\n    }\n  }, {\n    key: \"createState\",\n    value: function createState() {\n      var _this3 = this;\n\n      return EditorState.create({\n        schema: this.schema,\n        doc: this.createDocument(this.options.content),\n        plugins: [].concat(_toConsumableArray(this.plugins), [inputRules({\n          rules: this.inputRules\n        })], _toConsumableArray(this.pasteRules), _toConsumableArray(this.keymaps), [keymap({\n          Backspace: undoInputRule\n        }), keymap(baseKeymap), dropCursor(this.options.dropCursor), gapCursor(), new Plugin({\n          key: new PluginKey('editable'),\n          props: {\n            editable: function editable() {\n              return _this3.options.editable;\n            }\n          }\n        }), new Plugin({\n          props: {\n            attributes: {\n              tabindex: 0\n            },\n            handleDOMEvents: {\n              focus: function focus(view, event) {\n                _this3.focused = true;\n\n                _this3.emit('focus', {\n                  event: event,\n                  state: view.state,\n                  view: view\n                });\n\n                var transaction = _this3.state.tr.setMeta('focused', true);\n\n                _this3.view.dispatch(transaction);\n              },\n              blur: function blur(view, event) {\n                _this3.focused = false;\n\n                _this3.emit('blur', {\n                  event: event,\n                  state: view.state,\n                  view: view\n                });\n\n                var transaction = _this3.state.tr.setMeta('focused', false);\n\n                _this3.view.dispatch(transaction);\n              }\n            }\n          }\n        }), new Plugin({\n          props: this.options.editorProps\n        })])\n      });\n    }\n  }, {\n    key: \"createDocument\",\n    value: function createDocument(content) {\n      var parseOptions = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : this.options.parseOptions;\n\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        var element = document.createElement('div');\n        element.innerHTML = content.trim();\n        return DOMParser.fromSchema(this.schema).parse(element, parseOptions);\n      }\n\n      return false;\n    }\n  }, {\n    key: \"createView\",\n    value: function createView() {\n      var _this4 = this;\n\n      return new EditorView(this.element, {\n        state: this.createState(),\n        handlePaste: function handlePaste() {\n          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n            args[_key] = arguments[_key];\n          }\n\n          _this4.emit.apply(_this4, ['paste'].concat(args));\n        },\n        handleDrop: function handleDrop() {\n          for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n            args[_key2] = arguments[_key2];\n          }\n\n          _this4.emit.apply(_this4, ['drop'].concat(args));\n        },\n        dispatchTransaction: this.dispatchTransaction.bind(this)\n      });\n    }\n  }, {\n    key: \"setParentComponent\",\n    value: function setParentComponent() {\n      var component = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\n      if (!component) {\n        return;\n      }\n\n      this.view.setProps({\n        nodeViews: this.initNodeViews({\n          parent: component,\n          extensions: [].concat(_toConsumableArray(this.builtInExtensions), _toConsumableArray(this.options.extensions))\n        })\n      });\n    }\n  }, {\n    key: \"initNodeViews\",\n    value: function initNodeViews(_ref) {\n      var _this5 = this;\n\n      var parent = _ref.parent,\n          extensions = _ref.extensions;\n      return extensions.filter(function (extension) {\n        return ['node', 'mark'].includes(extension.type);\n      }).filter(function (extension) {\n        return extension.view;\n      }).reduce(function (nodeViews, extension) {\n        var nodeView = function nodeView(node, view, getPos, decorations) {\n          var component = extension.view;\n          return new ComponentView(component, {\n            editor: _this5,\n            extension: extension,\n            parent: parent,\n            node: node,\n            view: view,\n            getPos: getPos,\n            decorations: decorations\n          });\n        };\n\n        return _objectSpread2({}, nodeViews, _defineProperty({}, extension.name, nodeView));\n      }, {});\n    }\n  }, {\n    key: \"dispatchTransaction\",\n    value: function dispatchTransaction(transaction) {\n      var 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: transaction\n      });\n\n      if (!transaction.docChanged || transaction.getMeta('preventUpdate')) {\n        return;\n      }\n\n      this.emitUpdate(transaction);\n    }\n  }, {\n    key: \"emitUpdate\",\n    value: function emitUpdate(transaction) {\n      this.emit('update', {\n        getHTML: this.getHTML.bind(this),\n        getJSON: this.getJSON.bind(this),\n        state: this.state,\n        transaction: transaction\n      });\n    }\n  }, {\n    key: \"resolveSelection\",\n    value: function resolveSelection() {\n      var position = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\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        var doc = this.state.doc;\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    key: \"focus\",\n    value: function focus() {\n      var _this6 = this;\n\n      var position = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\n      if (this.view.focused && position === null || position === false) {\n        return;\n      }\n\n      var _this$resolveSelectio = this.resolveSelection(position),\n          from = _this$resolveSelectio.from,\n          to = _this$resolveSelectio.to;\n\n      this.setSelection(from, to);\n      setTimeout(function () {\n        return _this6.view.focus();\n      }, 10);\n    }\n  }, {\n    key: \"setSelection\",\n    value: function setSelection() {\n      var from = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;\n      var to = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var _this$state = this.state,\n          doc = _this$state.doc,\n          tr = _this$state.tr;\n      var resolvedFrom = minMax(from, 0, doc.content.size);\n      var resolvedEnd = minMax(to, 0, doc.content.size);\n      var selection = TextSelection.create(doc, resolvedFrom, resolvedEnd);\n      var transaction = tr.setSelection(selection);\n      this.view.dispatch(transaction);\n    }\n  }, {\n    key: \"blur\",\n    value: function blur() {\n      this.view.dom.blur();\n    }\n  }, {\n    key: \"getSchemaJSON\",\n    value: function getSchemaJSON() {\n      return JSON.parse(JSON.stringify({\n        nodes: this.extensions.nodes,\n        marks: this.extensions.marks\n      }));\n    }\n  }, {\n    key: \"getHTML\",\n    value: function getHTML() {\n      var div = document.createElement('div');\n      var fragment = DOMSerializer.fromSchema(this.schema).serializeFragment(this.state.doc.content);\n      div.appendChild(fragment);\n      return div.innerHTML;\n    }\n  }, {\n    key: \"getJSON\",\n    value: function getJSON() {\n      return this.state.doc.toJSON();\n    }\n  }, {\n    key: \"setContent\",\n    value: function setContent() {\n      var content = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n      var emitUpdate = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n      var parseOptions = arguments.length > 2 ? arguments[2] : undefined;\n      var _this$state2 = this.state,\n          doc = _this$state2.doc,\n          tr = _this$state2.tr;\n      var document = this.createDocument(content, parseOptions);\n      var selection = TextSelection.create(doc, 0, doc.content.size);\n      var transaction = tr.setSelection(selection).replaceSelectionWith(document, false).setMeta('preventUpdate', !emitUpdate);\n      this.view.dispatch(transaction);\n    }\n  }, {\n    key: \"clearContent\",\n    value: function clearContent() {\n      var emitUpdate = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;\n      this.setContent(this.options.emptyDocument, emitUpdate);\n    }\n  }, {\n    key: \"setActiveNodesAndMarks\",\n    value: function setActiveNodesAndMarks() {\n      var _this7 = this;\n\n      this.activeMarks = Object.entries(this.schema.marks).reduce(function (marks, _ref2) {\n        var _ref3 = _slicedToArray(_ref2, 2),\n            name = _ref3[0],\n            mark = _ref3[1];\n\n        return _objectSpread2({}, marks, _defineProperty({}, name, function () {\n          var attrs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n          return markIsActive(_this7.state, mark, attrs);\n        }));\n      }, {});\n      this.activeMarkAttrs = Object.entries(this.schema.marks).reduce(function (marks, _ref4) {\n        var _ref5 = _slicedToArray(_ref4, 2),\n            name = _ref5[0],\n            mark = _ref5[1];\n\n        return _objectSpread2({}, marks, _defineProperty({}, name, getMarkAttrs(_this7.state, mark)));\n      }, {});\n      this.activeNodes = Object.entries(this.schema.nodes).reduce(function (nodes, _ref6) {\n        var _ref7 = _slicedToArray(_ref6, 2),\n            name = _ref7[0],\n            node = _ref7[1];\n\n        return _objectSpread2({}, nodes, _defineProperty({}, name, function () {\n          var attrs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n          return nodeIsActive(_this7.state, node, attrs);\n        }));\n      }, {});\n    }\n  }, {\n    key: \"getMarkAttrs\",\n    value: function getMarkAttrs() {\n      var type = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n      return this.activeMarkAttrs[type];\n    }\n  }, {\n    key: \"registerPlugin\",\n    value: function registerPlugin() {\n      var plugin = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\n      if (!plugin) {\n        return;\n      }\n\n      var newState = this.state.reconfigure({\n        plugins: this.state.plugins.concat([plugin])\n      });\n      this.view.updateState(newState);\n    }\n  }, {\n    key: \"unregisterPlugin\",\n    value: function unregisterPlugin() {\n      var name = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\n      if (!name || !this.view.docView) {\n        return;\n      }\n\n      var newState = this.state.reconfigure({\n        plugins: this.state.plugins.filter(function (plugin) {\n          return !plugin.key.startsWith(\"\".concat(name, \"$\"));\n        })\n      });\n      this.view.updateState(newState);\n    }\n  }, {\n    key: \"destroy\",\n    value: function destroy() {\n      if (!this.view) {\n        return;\n      }\n\n      this.view.destroy();\n    }\n  }, {\n    key: \"builtInExtensions\",\n    get: function get() {\n      if (!this.options.useBuiltInExtensions) {\n        return [];\n      }\n\n      return [new Doc(), new Text(), new Paragraph()];\n    }\n  }, {\n    key: \"state\",\n    get: function get() {\n      return this.view ? this.view.state : null;\n    }\n  }, {\n    key: \"isActive\",\n    get: function get() {\n      return Object.entries(_objectSpread2({}, this.activeMarks, {}, this.activeNodes)).reduce(function (types, _ref8) {\n        var _ref9 = _slicedToArray(_ref8, 2),\n            name = _ref9[0],\n            value = _ref9[1];\n\n        return _objectSpread2({}, types, _defineProperty({}, name, function () {\n          var attrs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n          return value(attrs);\n        }));\n      }, {});\n    }\n  }]);\n\n  return Editor;\n}(Emitter);\n\nvar EditorContent = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    }\n  },\n  watch: {\n    editor: {\n      immediate: true,\n      handler: function handler(editor) {\n        var _this = this;\n\n        if (editor && editor.element) {\n          this.$nextTick(function () {\n            _this.$el.appendChild(editor.element.firstChild);\n\n            editor.setParentComponent(_this);\n          });\n        }\n      }\n    }\n  },\n  render: function render(createElement) {\n    return createElement('div');\n  },\n  beforeDestroy: function beforeDestroy() {\n    this.editor.element = this.$el;\n  }\n};\n\nvar Menu =\n/*#__PURE__*/\nfunction () {\n  function Menu(_ref) {\n    var options = _ref.options;\n\n    _classCallCheck(this, Menu);\n\n    this.options = options; // the mousedown event is fired before blur so we can prevent it\n\n    this.options.element.addEventListener('mousedown', this.handleClick);\n  }\n\n  _createClass(Menu, [{\n    key: \"handleClick\",\n    value: function handleClick(event) {\n      event.preventDefault();\n    }\n  }, {\n    key: \"destroy\",\n    value: function destroy() {\n      this.options.element.removeEventListener('mousedown', this.handleClick);\n    }\n  }]);\n\n  return Menu;\n}();\n\nfunction MenuBar (options) {\n  return new Plugin({\n    key: new PluginKey('menu_bar'),\n    view: function view(editorView) {\n      return new Menu({\n        editorView: editorView,\n        options: options\n      });\n    }\n  });\n}\n\nvar EditorMenuBar = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    }\n  },\n  watch: {\n    editor: {\n      immediate: true,\n      handler: function handler(editor) {\n        var _this = this;\n\n        if (editor) {\n          this.$nextTick(function () {\n            editor.registerPlugin(MenuBar({\n              editor: editor,\n              element: _this.$el\n            }));\n          });\n        }\n      }\n    }\n  },\n  render: function 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    });\n  }\n};\n\nfunction textRange(node, from, to) {\n  var 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  var rects = object.getClientRects();\n  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1];\n}\n\nfunction coordsAtPos(view, pos) {\n  var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n\n  var _view$docView$domFrom = view.docView.domFromPos(pos),\n      node = _view$docView$domFrom.node,\n      offset = _view$docView$domFrom.offset;\n\n  var side;\n  var 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      var 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      var _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  var x = rect[side];\n  return {\n    top: rect.top,\n    bottom: rect.bottom,\n    left: x,\n    right: x\n  };\n}\n\nvar Menu$1 =\n/*#__PURE__*/\nfunction () {\n  function Menu(_ref) {\n    var _this = this;\n\n    var options = _ref.options,\n        editorView = _ref.editorView;\n\n    _classCallCheck(this, Menu);\n\n    this.options = _objectSpread2({}, {\n      element: null,\n      keepInBounds: true,\n      onUpdate: function onUpdate() {\n        return false;\n      }\n    }, {}, options);\n    this.editorView = editorView;\n    this.isActive = false;\n    this.left = 0;\n    this.bottom = 0;\n    this.top = 0; // the mousedown event is fired before blur so we can prevent it\n\n    this.options.element.addEventListener('mousedown', this.handleClick);\n    this.options.editor.on('focus', function (_ref2) {\n      var view = _ref2.view;\n\n      _this.update(view);\n    });\n    this.options.editor.on('blur', function (_ref3) {\n      var event = _ref3.event;\n\n      _this.hide(event);\n    });\n  }\n\n  _createClass(Menu, [{\n    key: \"handleClick\",\n    value: function handleClick(event) {\n      event.preventDefault();\n    }\n  }, {\n    key: \"update\",\n    value: function update(view, lastState) {\n      var state = view.state;\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      var _state$selection = state.selection,\n          from = _state$selection.from,\n          to = _state$selection.to; // 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      var start = coordsAtPos(view, from);\n      var end = coordsAtPos(view, to, true); // The box in which the tooltip is positioned, to use as base\n\n      var parent = this.options.element.offsetParent;\n\n      if (!parent) {\n        this.hide();\n        return;\n      }\n\n      var box = parent.getBoundingClientRect();\n      var 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      var 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    key: \"sendUpdate\",\n    value: function 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    key: \"hide\",\n    value: function hide(event) {\n      if (event && event.relatedTarget && this.options.element.parentNode.contains(event.relatedTarget)) {\n        return;\n      }\n\n      this.isActive = false;\n      this.sendUpdate();\n    }\n  }, {\n    key: \"destroy\",\n    value: function destroy() {\n      this.options.element.removeEventListener('mousedown', this.handleClick);\n    }\n  }]);\n\n  return Menu;\n}();\n\nfunction MenuBubble (options) {\n  return new Plugin({\n    key: new PluginKey('menu_bubble'),\n    view: function view(editorView) {\n      return new Menu$1({\n        editorView: editorView,\n        options: options\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  data: function data() {\n    return {\n      menu: {\n        isActive: false,\n        left: 0,\n        bottom: 0\n      }\n    };\n  },\n  watch: {\n    editor: {\n      immediate: true,\n      handler: function handler(editor) {\n        var _this = this;\n\n        if (editor) {\n          this.$nextTick(function () {\n            editor.registerPlugin(MenuBubble({\n              editor: editor,\n              element: _this.$el,\n              keepInBounds: _this.keepInBounds,\n              onUpdate: function 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  render: function 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      menu: this.menu\n    });\n  },\n  beforeDestroy: function beforeDestroy() {\n    this.editor.unregisterPlugin('menu_bubble');\n  }\n};\n\nvar Menu$2 =\n/*#__PURE__*/\nfunction () {\n  function Menu(_ref) {\n    var _this = this;\n\n    var options = _ref.options,\n        editorView = _ref.editorView;\n\n    _classCallCheck(this, Menu);\n\n    this.options = _objectSpread2({}, {\n      resizeObserver: true,\n      element: null,\n      onUpdate: function onUpdate() {\n        return false;\n      }\n    }, {}, options);\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.options.element.addEventListener('mousedown', this.handleClick);\n    this.options.editor.on('focus', function (_ref2) {\n      var view = _ref2.view;\n\n      _this.update(view);\n    });\n    this.options.editor.on('blur', function (_ref3) {\n      var event = _ref3.event;\n\n      _this.hide(event);\n    }); // 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(function () {\n        if (_this.isActive) {\n          _this.update(_this.editorView);\n        }\n      });\n      this.resizeObserver.observe(this.editorView.dom);\n    }\n  }\n\n  _createClass(Menu, [{\n    key: \"handleClick\",\n    value: function handleClick(event) {\n      event.preventDefault();\n    }\n  }, {\n    key: \"update\",\n    value: function update(view, lastState) {\n      var state = view.state; // 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      var currentDom = view.domAtPos(state.selection.anchor);\n      var 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      var parent = this.options.element.offsetParent;\n\n      if (!parent) {\n        this.hide();\n        return;\n      }\n\n      var editorBoundings = parent.getBoundingClientRect();\n      var cursorBoundings = view.coordsAtPos(state.selection.anchor);\n      var top = cursorBoundings.top - editorBoundings.top;\n      this.isActive = true;\n      this.top = top;\n      this.sendUpdate();\n    }\n  }, {\n    key: \"sendUpdate\",\n    value: function sendUpdate() {\n      this.options.onUpdate({\n        isActive: this.isActive,\n        top: this.top\n      });\n    }\n  }, {\n    key: \"hide\",\n    value: function hide(event) {\n      if (event && event.relatedTarget && this.options.element.parentNode.contains(event.relatedTarget)) {\n        return;\n      }\n\n      this.isActive = false;\n      this.sendUpdate();\n    }\n  }, {\n    key: \"destroy\",\n    value: function destroy() {\n      this.options.element.removeEventListener('mousedown', this.handleClick);\n\n      if (this.resizeObserver) {\n        this.resizeObserver.unobserve(this.editorView.dom);\n      }\n    }\n  }]);\n\n  return Menu;\n}();\n\nfunction FloatingMenu (options) {\n  return new Plugin({\n    key: new PluginKey('floating_menu'),\n    view: function view(editorView) {\n      return new Menu$2({\n        editorView: editorView,\n        options: options\n      });\n    }\n  });\n}\n\nvar EditorFloatingMenu = {\n  props: {\n    editor: {\n      default: null,\n      type: Object\n    }\n  },\n  data: function data() {\n    return {\n      menu: {\n        isActive: false,\n        left: 0,\n        bottom: 0\n      }\n    };\n  },\n  watch: {\n    editor: {\n      immediate: true,\n      handler: function handler(editor) {\n        var _this = this;\n\n        if (editor) {\n          this.$nextTick(function () {\n            editor.registerPlugin(FloatingMenu({\n              editor: editor,\n              element: _this.$el,\n              onUpdate: function onUpdate(menu) {\n                _this.menu = menu;\n              }\n            }));\n          });\n        }\n      }\n    }\n  },\n  render: function 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      menu: this.menu\n    });\n  },\n  beforeDestroy: function beforeDestroy() {\n    this.editor.unregisterPlugin('floating_menu');\n  }\n};\n\nexport { Doc, Editor, EditorContent, EditorFloatingMenu, EditorMenuBar, EditorMenuBubble, Extension, Mark, Node, Paragraph, Text };\n","\n    /*!\n    * tiptap-extensions v1.28.0\n    * (c) 2019 Scrumpy UG (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 { 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 { undo, redo, history } from 'prosemirror-history';\n\nfunction _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\n\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}\n\nfunction _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    if (enumerableOnly) symbols = symbols.filter(function (sym) {\n      return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n    });\n    keys.push.apply(keys, symbols);\n  }\n\n  return keys;\n}\n\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n\n    if (i % 2) {\n      ownKeys(source, true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(source).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n\n  return target;\n}\n\nfunction _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) _setPrototypeOf(subClass, superClass);\n}\n\nfunction _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}\n\nfunction _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}\n\nfunction _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}\n\nfunction _possibleConstructorReturn(self, call) {\n  if (call && (typeof call === \"object\" || typeof call === \"function\")) {\n    return call;\n  }\n\n  return _assertThisInitialized(self);\n}\n\nfunction _slicedToArray(arr, i) {\n  return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest();\n}\n\nfunction _toConsumableArray(arr) {\n  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread();\n}\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) {\n    for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];\n\n    return arr2;\n  }\n}\n\nfunction _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}\n\nfunction _iterableToArray(iter) {\n  if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter);\n}\n\nfunction _iterableToArrayLimit(arr, i) {\n  if (!(Symbol.iterator in Object(arr) || Object.prototype.toString.call(arr) === \"[object Arguments]\")) {\n    return;\n  }\n\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n  var _e = undefined;\n\n  try {\n    for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {\n      _arr.push(_s.value);\n\n      if (i && _arr.length === i) break;\n    }\n  } catch (err) {\n    _d = true;\n    _e = err;\n  } finally {\n    try {\n      if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n    } finally {\n      if (_d) throw _e;\n    }\n  }\n\n  return _arr;\n}\n\nfunction _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance\");\n}\n\nfunction _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance\");\n}\n\nvar Blockquote =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Blockquote, _Node);\n\n  function Blockquote() {\n    _classCallCheck(this, Blockquote);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Blockquote).apply(this, arguments));\n  }\n\n  _createClass(Blockquote, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type,\n          schema = _ref.schema;\n      return function () {\n        return toggleWrap(type, schema.nodes.paragraph);\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys(_ref2) {\n      var type = _ref2.type;\n      return {\n        'Ctrl->': toggleWrap(type)\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [wrappingInputRule(/^\\s*>\\s$/, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'blockquote';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        content: 'block*',\n        group: 'block',\n        defining: true,\n        draggable: false,\n        parseDOM: [{\n          tag: 'blockquote'\n        }],\n        toDOM: function toDOM() {\n          return ['blockquote', 0];\n        }\n      };\n    }\n  }]);\n\n  return Blockquote;\n}(Node);\n\nvar BulletList =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(BulletList, _Node);\n\n  function BulletList() {\n    _classCallCheck(this, BulletList);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(BulletList).apply(this, arguments));\n  }\n\n  _createClass(BulletList, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type,\n          schema = _ref.schema;\n      return function () {\n        return toggleList(type, schema.nodes.list_item);\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys(_ref2) {\n      var type = _ref2.type,\n          schema = _ref2.schema;\n      return {\n        'Shift-Ctrl-8': toggleList(type, schema.nodes.list_item)\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [wrappingInputRule(/^\\s*([-+*])\\s$/, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'bullet_list';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        content: 'list_item+',\n        group: 'block',\n        parseDOM: [{\n          tag: 'ul'\n        }],\n        toDOM: function toDOM() {\n          return ['ul', 0];\n        }\n      };\n    }\n  }]);\n\n  return BulletList;\n}(Node);\n\nvar CodeBlock =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(CodeBlock, _Node);\n\n  function CodeBlock() {\n    _classCallCheck(this, CodeBlock);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(CodeBlock).apply(this, arguments));\n  }\n\n  _createClass(CodeBlock, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type,\n          schema = _ref.schema;\n      return function () {\n        return toggleBlockType(type, schema.nodes.paragraph);\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys(_ref2) {\n      var type = _ref2.type;\n      return {\n        'Shift-Ctrl-\\\\': setBlockType(type)\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [textblockTypeInputRule(/^```$/, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'code_block';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\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: function toDOM() {\n          return ['pre', ['code', 0]];\n        }\n      };\n    }\n  }]);\n\n  return CodeBlock;\n}(Node);\n\nfunction getDecorations(_ref) {\n  var doc = _ref.doc,\n      name = _ref.name;\n  var decorations = [];\n  var blocks = findBlockNodes(doc).filter(function (item) {\n    return item.node.type.name === name;\n  });\n\n  var flatten = function flatten(list) {\n    return list.reduce(function (a, b) {\n      return a.concat(Array.isArray(b) ? flatten(b) : b);\n    }, []);\n  };\n\n  function parseNodes(nodes) {\n    var className = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n    return nodes.map(function (node) {\n      var classes = [].concat(_toConsumableArray(className), _toConsumableArray(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: classes\n      };\n    });\n  }\n\n  blocks.forEach(function (block) {\n    var startPos = block.pos + 1;\n    var nodes = low.highlightAuto(block.node.textContent).value;\n    flatten(parseNodes(nodes)).map(function (node) {\n      var from = startPos;\n      var to = from + node.text.length;\n      startPos = to;\n      return _objectSpread2({}, node, {\n        from: from,\n        to: to\n      });\n    }).forEach(function (node) {\n      var 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(_ref2) {\n  var name = _ref2.name;\n  return new Plugin({\n    name: new PluginKey('highlight'),\n    state: {\n      init: function init(_, _ref3) {\n        var doc = _ref3.doc;\n        return getDecorations({\n          doc: doc,\n          name: name\n        });\n      },\n      apply: function apply(transaction, decorationSet, oldState, state) {\n        // TODO: find way to cache decorations\n        // see: https://discuss.prosemirror.net/t/how-to-update-multiple-inline-decorations-on-node-change/1493\n        var nodeName = state.selection.$head.parent.type.name;\n        var previousNodeName = oldState.selection.$head.parent.type.name;\n\n        if (transaction.docChanged && [nodeName, previousNodeName].includes(name)) {\n          return getDecorations({\n            doc: transaction.doc,\n            name: name\n          });\n        }\n\n        return decorationSet.map(transaction.mapping, transaction.doc);\n      }\n    },\n    props: {\n      decorations: function decorations(state) {\n        return this.getState(state);\n      }\n    }\n  });\n}\n\nvar CodeBlockHighlight =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(CodeBlockHighlight, _Node);\n\n  function CodeBlockHighlight() {\n    var _this;\n\n    var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n\n    _classCallCheck(this, CodeBlockHighlight);\n\n    _this = _possibleConstructorReturn(this, _getPrototypeOf(CodeBlockHighlight).call(this, options));\n\n    try {\n      Object.entries(_this.options.languages).forEach(function (_ref) {\n        var _ref2 = _slicedToArray(_ref, 2),\n            name = _ref2[0],\n            mapping = _ref2[1];\n\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    return _this;\n  }\n\n  _createClass(CodeBlockHighlight, [{\n    key: \"commands\",\n    value: function commands(_ref3) {\n      var type = _ref3.type,\n          schema = _ref3.schema;\n      return function () {\n        return toggleBlockType(type, schema.nodes.paragraph);\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys(_ref4) {\n      var type = _ref4.type;\n      return {\n        'Shift-Ctrl-\\\\': setBlockType(type)\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref5) {\n      var type = _ref5.type;\n      return [textblockTypeInputRule(/^```$/, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'code_block';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        languages: {}\n      };\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\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: function toDOM() {\n          return ['pre', ['code', 0]];\n        }\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [HighlightPlugin({\n        name: this.name\n      })];\n    }\n  }]);\n\n  return CodeBlockHighlight;\n}(Node);\n\nvar HardBreak =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(HardBreak, _Node);\n\n  function HardBreak() {\n    _classCallCheck(this, HardBreak);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(HardBreak).apply(this, arguments));\n  }\n\n  _createClass(HardBreak, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      var command = chainCommands(exitCode, function (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    key: \"name\",\n    get: function get() {\n      return 'hard_break';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        inline: true,\n        group: 'inline',\n        selectable: false,\n        parseDOM: [{\n          tag: 'br'\n        }],\n        toDOM: function toDOM() {\n          return ['br'];\n        }\n      };\n    }\n  }]);\n\n  return HardBreak;\n}(Node);\n\nvar Heading =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Heading, _Node);\n\n  function Heading() {\n    _classCallCheck(this, Heading);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Heading).apply(this, arguments));\n  }\n\n  _createClass(Heading, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type,\n          schema = _ref.schema;\n      return function (attrs) {\n        return toggleBlockType(type, schema.nodes.paragraph, attrs);\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys(_ref2) {\n      var type = _ref2.type;\n      return this.options.levels.reduce(function (items, level) {\n        return _objectSpread2({}, items, {}, _defineProperty({}, \"Shift-Ctrl-\".concat(level), setBlockType(type, {\n          level: level\n        })));\n      }, {});\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return this.options.levels.map(function (level) {\n        return textblockTypeInputRule(new RegExp(\"^(#{1,\".concat(level, \"})\\\\s$\")), type, function () {\n          return {\n            level: level\n          };\n        });\n      });\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'heading';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        levels: [1, 2, 3, 4, 5, 6]\n      };\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\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(function (level) {\n          return {\n            tag: \"h\".concat(level),\n            attrs: {\n              level: level\n            }\n          };\n        }),\n        toDOM: function toDOM(node) {\n          return [\"h\".concat(node.attrs.level), 0];\n        }\n      };\n    }\n  }]);\n\n  return Heading;\n}(Node);\n\nvar HorizontalRule =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(HorizontalRule, _Node);\n\n  function HorizontalRule() {\n    _classCallCheck(this, HorizontalRule);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(HorizontalRule).apply(this, arguments));\n  }\n\n  _createClass(HorizontalRule, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type;\n      return function () {\n        return function (state, dispatch) {\n          return dispatch(state.tr.replaceSelectionWith(type.create()));\n        };\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref2) {\n      var type = _ref2.type;\n      return [nodeInputRule(/^(?:---|___\\s|\\*\\*\\*\\s)$/, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'horizontal_rule';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        group: 'block',\n        parseDOM: [{\n          tag: 'hr'\n        }],\n        toDOM: function toDOM() {\n          return ['hr'];\n        }\n      };\n    }\n  }]);\n\n  return HorizontalRule;\n}(Node);\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\nvar IMAGE_INPUT_REGEX = /!\\[(.+|:?)\\]\\((\\S+)(?:(?:\\s+)[\"'](\\S+)[\"'])?\\)/;\n\nvar Image =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Image, _Node);\n\n  function Image() {\n    _classCallCheck(this, Image);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Image).apply(this, arguments));\n  }\n\n  _createClass(Image, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type;\n      return function (attrs) {\n        return function (state, dispatch) {\n          var selection = state.selection;\n          var position = selection.$cursor ? selection.$cursor.pos : selection.$to.pos;\n          var node = type.create(attrs);\n          var transaction = state.tr.insert(position, node);\n          dispatch(transaction);\n        };\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref2) {\n      var type = _ref2.type;\n      return [nodeInputRule(IMAGE_INPUT_REGEX, type, function (match) {\n        var _match = _slicedToArray(match, 4),\n            alt = _match[1],\n            src = _match[2],\n            title = _match[3];\n\n        return {\n          src: src,\n          alt: alt,\n          title: title\n        };\n      })];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'image';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\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: function getAttrs(dom) {\n            return {\n              src: dom.getAttribute('src'),\n              title: dom.getAttribute('title'),\n              alt: dom.getAttribute('alt')\n            };\n          }\n        }],\n        toDOM: function toDOM(node) {\n          return ['img', node.attrs];\n        }\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [new Plugin({\n        props: {\n          handleDOMEvents: {\n            drop: function drop(view, event) {\n              var hasFiles = event.dataTransfer && event.dataTransfer.files && event.dataTransfer.files.length;\n\n              if (!hasFiles) {\n                return;\n              }\n\n              var images = Array.from(event.dataTransfer.files).filter(function (file) {\n                return /image/i.test(file.type);\n              });\n\n              if (images.length === 0) {\n                return;\n              }\n\n              event.preventDefault();\n              var schema = view.state.schema;\n              var coordinates = view.posAtCoords({\n                left: event.clientX,\n                top: event.clientY\n              });\n              images.forEach(function (image) {\n                var reader = new FileReader();\n\n                reader.onload = function (readerEvent) {\n                  var node = schema.nodes.image.create({\n                    src: readerEvent.target.result\n                  });\n                  var 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  return Image;\n}(Node);\n\nvar ListItem =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(ListItem, _Node);\n\n  function ListItem() {\n    _classCallCheck(this, ListItem);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(ListItem).apply(this, arguments));\n  }\n\n  _createClass(ListItem, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        Enter: splitListItem(type),\n        Tab: sinkListItem(type),\n        'Shift-Tab': liftListItem(type)\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'list_item';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        content: 'paragraph block*',\n        defining: true,\n        draggable: false,\n        parseDOM: [{\n          tag: 'li'\n        }],\n        toDOM: function toDOM() {\n          return ['li', 0];\n        }\n      };\n    }\n  }]);\n\n  return ListItem;\n}(Node);\n\nfunction triggerCharacter(_ref) {\n  var _ref$char = _ref.char,\n      char = _ref$char === void 0 ? '@' : _ref$char,\n      _ref$allowSpaces = _ref.allowSpaces,\n      allowSpaces = _ref$allowSpaces === void 0 ? false : _ref$allowSpaces,\n      _ref$startOfLine = _ref.startOfLine,\n      startOfLine = _ref$startOfLine === void 0 ? false : _ref$startOfLine;\n  return function ($position) {\n    // cancel if top level node\n    if ($position.depth <= 0) {\n      return false;\n    } // Matching expressions used for later\n\n\n    var escapedChar = \"\\\\\".concat(char);\n    var suffix = new RegExp(\"\\\\s\".concat(escapedChar, \"$\"));\n    var prefix = startOfLine ? '^' : '';\n    var 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    var textFrom = $position.before();\n    var textTo = $position.end();\n    var text = $position.doc.textBetween(textFrom, textTo, '\\0', '\\0');\n    var match = regexp.exec(text);\n    var 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      var 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        var from = match.index + $position.start();\n        var 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: from,\n              to: 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(_ref2) {\n  var _ref2$matcher = _ref2.matcher,\n      matcher = _ref2$matcher === void 0 ? {\n    char: '@',\n    allowSpaces: false,\n    startOfLine: false\n  } : _ref2$matcher,\n      _ref2$appendText = _ref2.appendText,\n      appendText = _ref2$appendText === void 0 ? null : _ref2$appendText,\n      _ref2$suggestionClass = _ref2.suggestionClass,\n      suggestionClass = _ref2$suggestionClass === void 0 ? 'suggestion' : _ref2$suggestionClass,\n      _ref2$command = _ref2.command,\n      _command = _ref2$command === void 0 ? function () {\n    return false;\n  } : _ref2$command,\n      _ref2$items = _ref2.items,\n      items = _ref2$items === void 0 ? [] : _ref2$items,\n      _ref2$onEnter = _ref2.onEnter,\n      onEnter = _ref2$onEnter === void 0 ? function () {\n    return false;\n  } : _ref2$onEnter,\n      _ref2$onChange = _ref2.onChange,\n      onChange = _ref2$onChange === void 0 ? function () {\n    return false;\n  } : _ref2$onChange,\n      _ref2$onExit = _ref2.onExit,\n      onExit = _ref2$onExit === void 0 ? function () {\n    return false;\n  } : _ref2$onExit,\n      _ref2$onKeyDown = _ref2.onKeyDown,\n      onKeyDown = _ref2$onKeyDown === void 0 ? function () {\n    return false;\n  } : _ref2$onKeyDown,\n      _ref2$onFilter = _ref2.onFilter,\n      onFilter = _ref2$onFilter === void 0 ? function (searchItems, query) {\n    if (!query) {\n      return searchItems;\n    }\n\n    return searchItems.filter(function (item) {\n      return JSON.stringify(item).toLowerCase().includes(query.toLowerCase());\n    });\n  } : _ref2$onFilter;\n\n  return new Plugin$1({\n    key: new PluginKey$1('suggestions'),\n    view: function view() {\n      var _this = this;\n\n      return {\n        update: function update(view, prevState) {\n          var prev = _this.key.getState(prevState);\n\n          var next = _this.key.getState(view.state); // See how the state changed\n\n\n          var moved = prev.active && next.active && prev.range.from !== next.range.from;\n          var started = !prev.active && next.active;\n          var stopped = prev.active && !next.active;\n          var changed = !started && !stopped && prev.query !== next.query;\n          var handleStart = started || moved;\n          var handleChange = changed && !moved;\n          var handleExit = stopped || moved; // Cancel when suggestion isn't active\n\n          if (!handleStart && !handleChange && !handleExit) {\n            return;\n          }\n\n          var state = handleExit ? prev : next;\n          var 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          var virtualNode = decorationNode ? {\n            getBoundingClientRect: function getBoundingClientRect() {\n              return decorationNode.getBoundingClientRect();\n            },\n            clientWidth: decorationNode.clientWidth,\n            clientHeight: decorationNode.clientHeight\n          } : null;\n          var props = {\n            view: view,\n            range: state.range,\n            query: state.query,\n            text: state.text,\n            decorationNode: decorationNode,\n            virtualNode: virtualNode,\n            items: onFilter(Array.isArray(items) ? items : items(), state.query),\n            command: function command(_ref3) {\n              var range = _ref3.range,\n                  attrs = _ref3.attrs;\n\n              _command({\n                range: range,\n                attrs: 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    state: {\n      // Initialize the plugin's internal state.\n      init: function init() {\n        return {\n          active: false,\n          range: {},\n          query: null,\n          text: null\n        };\n      },\n      // Apply changes to the plugin state from a view transaction.\n      apply: function apply(tr, prev) {\n        var selection = tr.selection;\n\n        var next = _objectSpread2({}, prev); // We can only be suggesting if there is no selection\n\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          var $position = selection.$from;\n          var match = triggerCharacter(matcher)($position);\n          var 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    props: {\n      // Call the keydown hook if suggestion is active.\n      handleKeyDown: function handleKeyDown(view, event) {\n        var _this$getState = this.getState(view.state),\n            active = _this$getState.active,\n            range = _this$getState.range;\n\n        if (!active) return false;\n        return onKeyDown({\n          view: view,\n          event: event,\n          range: range\n        });\n      },\n      // Setup decorator on the currently active suggestion.\n      decorations: function decorations(editorState) {\n        var _this$getState2 = this.getState(editorState),\n            active = _this$getState2.active,\n            range = _this$getState2.range,\n            decorationId = _this$getState2.decorationId;\n\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\nvar Mention =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Mention, _Node);\n\n  function Mention() {\n    _classCallCheck(this, Mention);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Mention).apply(this, arguments));\n  }\n\n  _createClass(Mention, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var _this = this;\n\n      var schema = _ref.schema;\n      return function (attrs) {\n        return replaceText(null, schema.nodes[_this.name], attrs);\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'mention';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        matcher: {\n          char: '@',\n          allowSpaces: false,\n          startOfLine: false\n        },\n        mentionClass: 'mention',\n        suggestionClass: 'mention-suggestion'\n      };\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      var _this2 = this;\n\n      return {\n        attrs: {\n          id: {},\n          label: {}\n        },\n        group: 'inline',\n        inline: true,\n        selectable: false,\n        atom: true,\n        toDOM: function toDOM(node) {\n          return ['span', {\n            class: _this2.options.mentionClass,\n            'data-mention-id': node.attrs.id\n          }, \"\".concat(_this2.options.matcher.char).concat(node.attrs.label)];\n        },\n        parseDOM: [{\n          tag: 'span[data-mention-id]',\n          getAttrs: function getAttrs(dom) {\n            var id = dom.getAttribute('data-mention-id');\n            var label = dom.innerText.split(_this2.options.matcher.char).join('');\n            return {\n              id: id,\n              label: label\n            };\n          }\n        }]\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      var _this3 = this;\n\n      return [SuggestionsPlugin({\n        command: function command(_ref2) {\n          var range = _ref2.range,\n              attrs = _ref2.attrs,\n              schema = _ref2.schema;\n          return replaceText(range, schema.nodes[_this3.name], attrs);\n        },\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  return Mention;\n}(Node);\n\nvar OrderedList =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(OrderedList, _Node);\n\n  function OrderedList() {\n    _classCallCheck(this, OrderedList);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(OrderedList).apply(this, arguments));\n  }\n\n  _createClass(OrderedList, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type,\n          schema = _ref.schema;\n      return function () {\n        return toggleList(type, schema.nodes.list_item);\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys(_ref2) {\n      var type = _ref2.type,\n          schema = _ref2.schema;\n      return {\n        'Shift-Ctrl-9': toggleList(type, schema.nodes.list_item)\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [wrappingInputRule(/^(\\d+)\\.\\s$/, type, function (match) {\n        return {\n          order: +match[1]\n        };\n      }, function (match, node) {\n        return node.childCount + node.attrs.order === +match[1];\n      })];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'ordered_list';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\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: function getAttrs(dom) {\n            return {\n              order: dom.hasAttribute('start') ? +dom.getAttribute('start') : 1\n            };\n          }\n        }],\n        toDOM: function toDOM(node) {\n          return node.attrs.order === 1 ? ['ol', 0] : ['ol', {\n            start: node.attrs.order\n          }, 0];\n        }\n      };\n    }\n  }]);\n\n  return OrderedList;\n}(Node);\n\nvar TableNodes = tableNodes({\n  tableGroup: 'block',\n  cellContent: 'block+',\n  cellAttributes: {\n    background: {\n      default: null,\n      getFromDOM: function getFromDOM(dom) {\n        return dom.style.backgroundColor || null;\n      },\n      setDOMAttr: function setDOMAttr(value, attrs) {\n        if (value) {\n          var style = {\n            style: \"\".concat(attrs.style || '', \"background-color: \").concat(value, \";\")\n          };\n          Object.assign(attrs, style);\n        }\n      }\n    }\n  }\n});\n\nvar Table =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(Table, _Node);\n\n  function Table() {\n    _classCallCheck(this, Table);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Table).apply(this, arguments));\n  }\n\n  _createClass(Table, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var schema = _ref.schema;\n      return {\n        createTable: function createTable$1(_ref2) {\n          var rowsCount = _ref2.rowsCount,\n              colsCount = _ref2.colsCount,\n              withHeaderRow = _ref2.withHeaderRow;\n          return function (state, dispatch) {\n            var nodes = createTable(schema, rowsCount, colsCount, withHeaderRow);\n\n            var tr = state.tr.replaceSelectionWith(nodes).scrollIntoView(); // get selection for first cell\n\n            var resolvedPos = tr.doc.resolve(tr.selection.anchor - nodes.content.size);\n            tr.setSelection(TextSelection.near(resolvedPos));\n            dispatch(tr);\n          };\n        },\n        addColumnBefore: function addColumnBefore$1() {\n          return addColumnBefore;\n        },\n        addColumnAfter: function addColumnAfter$1() {\n          return addColumnAfter;\n        },\n        deleteColumn: function deleteColumn$1() {\n          return deleteColumn;\n        },\n        addRowBefore: function addRowBefore$1() {\n          return addRowBefore;\n        },\n        addRowAfter: function addRowAfter$1() {\n          return addRowAfter;\n        },\n        deleteRow: function deleteRow$1() {\n          return deleteRow;\n        },\n        deleteTable: function deleteTable$1() {\n          return deleteTable;\n        },\n        toggleCellMerge: function toggleCellMerge() {\n          return function (state, dispatch) {\n            if (mergeCells(state, dispatch)) {\n              return;\n            }\n\n            splitCell(state, dispatch);\n          };\n        },\n        mergeCells: function mergeCells$1() {\n          return mergeCells;\n        },\n        splitCell: function splitCell$1() {\n          return splitCell;\n        },\n        toggleHeaderColumn: function toggleHeaderColumn$1() {\n          return toggleHeaderColumn;\n        },\n        toggleHeaderRow: function toggleHeaderRow$1() {\n          return toggleHeaderRow;\n        },\n        toggleHeaderCell: function toggleHeaderCell$1() {\n          return toggleHeaderCell;\n        },\n        setCellAttr: function setCellAttr$1() {\n          return setCellAttr;\n        },\n        fixTables: function fixTables$1() {\n          return fixTables;\n        }\n      };\n    }\n  }, {\n    key: \"keys\",\n    value: function keys() {\n      return {\n        Tab: goToNextCell(1),\n        'Shift-Tab': goToNextCell(-1)\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'table';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        resizable: false\n      };\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return TableNodes.table;\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [].concat(_toConsumableArray(this.options.resizable ? [columnResizing()] : []), [tableEditing()]);\n    }\n  }]);\n\n  return Table;\n}(Node);\n\nvar TableHeader =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(TableHeader, _Node);\n\n  function TableHeader() {\n    _classCallCheck(this, TableHeader);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(TableHeader).apply(this, arguments));\n  }\n\n  _createClass(TableHeader, [{\n    key: \"name\",\n    get: function get() {\n      return 'table_header';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return TableNodes.table_header;\n    }\n  }]);\n\n  return TableHeader;\n}(Node);\n\nvar TableCell =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(TableCell, _Node);\n\n  function TableCell() {\n    _classCallCheck(this, TableCell);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(TableCell).apply(this, arguments));\n  }\n\n  _createClass(TableCell, [{\n    key: \"name\",\n    get: function get() {\n      return 'table_cell';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return TableNodes.table_cell;\n    }\n  }]);\n\n  return TableCell;\n}(Node);\n\nvar TableRow =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(TableRow, _Node);\n\n  function TableRow() {\n    _classCallCheck(this, TableRow);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(TableRow).apply(this, arguments));\n  }\n\n  _createClass(TableRow, [{\n    key: \"name\",\n    get: function get() {\n      return 'table_row';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return TableNodes.table_row;\n    }\n  }]);\n\n  return TableRow;\n}(Node);\n\nvar TodoItem =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(TodoItem, _Node);\n\n  function TodoItem() {\n    _classCallCheck(this, TodoItem);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(TodoItem).apply(this, arguments));\n  }\n\n  _createClass(TodoItem, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        Enter: splitToDefaultListItem(type),\n        Tab: this.options.nested ? sinkListItem(type) : function () {},\n        'Shift-Tab': liftListItem(type)\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'todo_item';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        nested: false\n      };\n    }\n  }, {\n    key: \"view\",\n    get: function get() {\n      return {\n        props: ['node', 'updateAttrs', 'view'],\n        methods: {\n          onChange: function onChange() {\n            this.updateAttrs({\n              done: !this.node.attrs.done\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    key: \"schema\",\n    get: function get() {\n      var _this = this;\n\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: function toDOM(node) {\n          var done = node.attrs.done;\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: function getAttrs(dom) {\n            return {\n              done: dom.getAttribute('data-done') === 'true'\n            };\n          }\n        }]\n      };\n    }\n  }]);\n\n  return TodoItem;\n}(Node);\n\nvar TodoList =\n/*#__PURE__*/\nfunction (_Node) {\n  _inherits(TodoList, _Node);\n\n  function TodoList() {\n    _classCallCheck(this, TodoList);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(TodoList).apply(this, arguments));\n  }\n\n  _createClass(TodoList, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type,\n          schema = _ref.schema;\n      return function () {\n        return toggleList(type, schema.nodes.todo_item);\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref2) {\n      var type = _ref2.type;\n      return [wrappingInputRule(/^\\s*(\\[ \\])\\s$/, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'todo_list';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      var _this = this;\n\n      return {\n        group: 'block',\n        content: 'todo_item+',\n        toDOM: function toDOM() {\n          return ['ul', {\n            'data-type': _this.name\n          }, 0];\n        },\n        parseDOM: [{\n          priority: 51,\n          tag: \"[data-type=\\\"\".concat(this.name, \"\\\"]\")\n        }]\n      };\n    }\n  }]);\n\n  return TodoList;\n}(Node);\n\nvar Bold =\n/*#__PURE__*/\nfunction (_Mark) {\n  _inherits(Bold, _Mark);\n\n  function Bold() {\n    _classCallCheck(this, Bold);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Bold).apply(this, arguments));\n  }\n\n  _createClass(Bold, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        'Mod-b': toggleMark(type)\n      };\n    }\n  }, {\n    key: \"commands\",\n    value: function commands(_ref2) {\n      var type = _ref2.type;\n      return function () {\n        return toggleMark(type);\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [markInputRule(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)$/, type)];\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules(_ref4) {\n      var type = _ref4.type;\n      return [markPasteRule(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)/g, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'bold';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        parseDOM: [{\n          tag: 'strong'\n        }, {\n          tag: 'b',\n          getAttrs: function getAttrs(node) {\n            return node.style.fontWeight !== 'normal' && null;\n          }\n        }, {\n          style: 'font-weight',\n          getAttrs: function getAttrs(value) {\n            return /^(bold(er)?|[5-9]\\d{2,})$/.test(value) && null;\n          }\n        }],\n        toDOM: function toDOM() {\n          return ['strong', 0];\n        }\n      };\n    }\n  }]);\n\n  return Bold;\n}(Mark);\n\nvar Code =\n/*#__PURE__*/\nfunction (_Mark) {\n  _inherits(Code, _Mark);\n\n  function Code() {\n    _classCallCheck(this, Code);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Code).apply(this, arguments));\n  }\n\n  _createClass(Code, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        'Mod-`': toggleMark(type)\n      };\n    }\n  }, {\n    key: \"commands\",\n    value: function commands(_ref2) {\n      var type = _ref2.type;\n      return function () {\n        return toggleMark(type);\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [markInputRule(/(?:`)([^`]+)(?:`)$/, type)];\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules(_ref4) {\n      var type = _ref4.type;\n      return [markPasteRule(/(?:`)([^`]+)(?:`)/g, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'code';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        excludes: '_',\n        parseDOM: [{\n          tag: 'code'\n        }],\n        toDOM: function toDOM() {\n          return ['code', 0];\n        }\n      };\n    }\n  }]);\n\n  return Code;\n}(Mark);\n\nvar Italic =\n/*#__PURE__*/\nfunction (_Mark) {\n  _inherits(Italic, _Mark);\n\n  function Italic() {\n    _classCallCheck(this, Italic);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Italic).apply(this, arguments));\n  }\n\n  _createClass(Italic, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        'Mod-i': toggleMark(type)\n      };\n    }\n  }, {\n    key: \"commands\",\n    value: function commands(_ref2) {\n      var type = _ref2.type;\n      return function () {\n        return toggleMark(type);\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [markInputRule(/(?:^|[^_])(_([^_]+)_)$/, type), markInputRule(/(?:^|[^*])(\\*([^*]+)\\*)$/, type)];\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules(_ref4) {\n      var type = _ref4.type;\n      return [markPasteRule(/_([^_]+)_/g, type), markPasteRule(/\\*([^*]+)\\*/g, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'italic';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        parseDOM: [{\n          tag: 'i'\n        }, {\n          tag: 'em'\n        }, {\n          style: 'font-style=italic'\n        }],\n        toDOM: function toDOM() {\n          return ['em', 0];\n        }\n      };\n    }\n  }]);\n\n  return Italic;\n}(Mark);\n\nvar Link =\n/*#__PURE__*/\nfunction (_Mark) {\n  _inherits(Link, _Mark);\n\n  function Link() {\n    _classCallCheck(this, Link);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Link).apply(this, arguments));\n  }\n\n  _createClass(Link, [{\n    key: \"commands\",\n    value: function commands(_ref) {\n      var type = _ref.type;\n      return function (attrs) {\n        if (attrs.href) {\n          return updateMark(type, attrs);\n        }\n\n        return removeMark(type);\n      };\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules(_ref2) {\n      var type = _ref2.type;\n      return [pasteRule(/https?:\\/\\/(www\\.)?[-a-zA-Z0-9@:%._+~#=]{2,256}\\.[a-zA-Z]{2,}\\b([-a-zA-Z0-9@:%_+.~#?&//=]*)/g, type, function (url) {\n        return {\n          href: url\n        };\n      })];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'link';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        attrs: {\n          href: {\n            default: null\n          }\n        },\n        inclusive: false,\n        parseDOM: [{\n          tag: 'a[href]',\n          getAttrs: function getAttrs(dom) {\n            return {\n              href: dom.getAttribute('href')\n            };\n          }\n        }],\n        toDOM: function toDOM(node) {\n          return ['a', _objectSpread2({}, node.attrs, {\n            rel: 'noopener noreferrer nofollow'\n          }), 0];\n        }\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [new Plugin({\n        props: {\n          handleClick: function handleClick(view, pos, event) {\n            var schema = view.state.schema;\n            var attrs = getMarkAttrs(view.state, schema.marks.link);\n\n            if (attrs.href && event.target instanceof HTMLAnchorElement) {\n              event.stopPropagation();\n              window.open(attrs.href);\n            }\n          }\n        }\n      })];\n    }\n  }]);\n\n  return Link;\n}(Mark);\n\nvar Strike =\n/*#__PURE__*/\nfunction (_Mark) {\n  _inherits(Strike, _Mark);\n\n  function Strike() {\n    _classCallCheck(this, Strike);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Strike).apply(this, arguments));\n  }\n\n  _createClass(Strike, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        'Mod-d': toggleMark(type)\n      };\n    }\n  }, {\n    key: \"commands\",\n    value: function commands(_ref2) {\n      var type = _ref2.type;\n      return function () {\n        return toggleMark(type);\n      };\n    }\n  }, {\n    key: \"inputRules\",\n    value: function inputRules(_ref3) {\n      var type = _ref3.type;\n      return [markInputRule(/~([^~]+)~$/, type)];\n    }\n  }, {\n    key: \"pasteRules\",\n    value: function pasteRules(_ref4) {\n      var type = _ref4.type;\n      return [markPasteRule(/~([^~]+)~/g, type)];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'strike';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        parseDOM: [{\n          tag: 's'\n        }, {\n          tag: 'del'\n        }, {\n          tag: 'strike'\n        }, {\n          style: 'text-decoration',\n          getAttrs: function getAttrs(value) {\n            return value === 'line-through';\n          }\n        }],\n        toDOM: function toDOM() {\n          return ['s', 0];\n        }\n      };\n    }\n  }]);\n\n  return Strike;\n}(Mark);\n\nvar Underline =\n/*#__PURE__*/\nfunction (_Mark) {\n  _inherits(Underline, _Mark);\n\n  function Underline() {\n    _classCallCheck(this, Underline);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Underline).apply(this, arguments));\n  }\n\n  _createClass(Underline, [{\n    key: \"keys\",\n    value: function keys(_ref) {\n      var type = _ref.type;\n      return {\n        'Mod-u': toggleMark(type)\n      };\n    }\n  }, {\n    key: \"commands\",\n    value: function commands(_ref2) {\n      var type = _ref2.type;\n      return function () {\n        return toggleMark(type);\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'underline';\n    }\n  }, {\n    key: \"schema\",\n    get: function get() {\n      return {\n        parseDOM: [{\n          tag: 'u'\n        }, {\n          style: 'text-decoration',\n          getAttrs: function getAttrs(value) {\n            return value === 'underline';\n          }\n        }],\n        toDOM: function toDOM() {\n          return ['u', 0];\n        }\n      };\n    }\n  }]);\n\n  return Underline;\n}(Mark);\n\nvar Collaboration =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(Collaboration, _Extension);\n\n  function Collaboration() {\n    _classCallCheck(this, Collaboration);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Collaboration).apply(this, arguments));\n  }\n\n  _createClass(Collaboration, [{\n    key: \"init\",\n    value: function init() {\n      var _this = this;\n\n      this.getSendableSteps = this.debounce(function (state) {\n        var 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(function (step) {\n                return step.toJSON();\n              }),\n              clientID: sendable.clientID\n            }\n          });\n        }\n      }, this.options.debounce);\n      this.editor.on('transaction', function (_ref) {\n        var state = _ref.state;\n\n        _this.getSendableSteps(state);\n      });\n    }\n  }, {\n    key: \"debounce\",\n    value: function debounce(fn, delay) {\n      var timeout;\n      return function () {\n        for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n          args[_key] = arguments[_key];\n        }\n\n        if (timeout) {\n          clearTimeout(timeout);\n        }\n\n        timeout = setTimeout(function () {\n          fn.apply(void 0, args);\n          timeout = null;\n        }, delay);\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'collaboration';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      var _this2 = this;\n\n      return {\n        version: 0,\n        clientID: Math.floor(Math.random() * 0xFFFFFFFF),\n        debounce: 250,\n        onSendable: function onSendable() {},\n        update: function update(_ref2) {\n          var steps = _ref2.steps,\n              version = _ref2.version;\n          var _this2$editor = _this2.editor,\n              state = _this2$editor.state,\n              view = _this2$editor.view,\n              schema = _this2$editor.schema;\n\n          if (getVersion(state) > version) {\n            return;\n          }\n\n          view.dispatch(receiveTransaction(state, steps.map(function (item) {\n            return Step.fromJSON(schema, item.step);\n          }), steps.map(function (item) {\n            return item.clientID;\n          })));\n        }\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [collab({\n        version: this.options.version,\n        clientID: this.options.clientID\n      })];\n    }\n  }]);\n\n  return Collaboration;\n}(Extension);\n\nvar Focus =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(Focus, _Extension);\n\n  function Focus() {\n    _classCallCheck(this, Focus);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Focus).apply(this, arguments));\n  }\n\n  _createClass(Focus, [{\n    key: \"name\",\n    get: function get() {\n      return 'focus';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        className: 'has-focus',\n        nested: false\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      var _this = this;\n\n      return [new Plugin({\n        props: {\n          decorations: function decorations(_ref) {\n            var doc = _ref.doc,\n                plugins = _ref.plugins,\n                selection = _ref.selection;\n            var editablePlugin = plugins.find(function (plugin) {\n              return plugin.key.startsWith('editable$');\n            });\n            var editable = editablePlugin.props.editable();\n            var active = editable && _this.options.className;\n            var focused = _this.editor.focused;\n            var anchor = selection.anchor;\n            var decorations = [];\n\n            if (!active || !focused) {\n              return false;\n            }\n\n            doc.descendants(function (node, pos) {\n              var hasAnchor = anchor >= pos && anchor <= pos + node.nodeSize;\n\n              if (hasAnchor && !node.isText) {\n                var 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  return Focus;\n}(Extension);\n\nvar History =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(History, _Extension);\n\n  function History() {\n    _classCallCheck(this, History);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(History).apply(this, arguments));\n  }\n\n  _createClass(History, [{\n    key: \"keys\",\n    value: function keys() {\n      var keymap = {\n        'Mod-z': undo,\n        'Mod-y': redo,\n        'Shift-Mod-z': redo\n      };\n      return keymap;\n    }\n  }, {\n    key: \"commands\",\n    value: function commands() {\n      return {\n        undo: function undo$1() {\n          return undo;\n        },\n        redo: function redo$1() {\n          return redo;\n        }\n      };\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'history';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        depth: '',\n        newGroupDelay: ''\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      return [history({\n        depth: this.options.depth,\n        newGroupDelay: this.options.newGroupDelay\n      })];\n    }\n  }]);\n\n  return History;\n}(Extension);\n\nvar Placeholder =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(Placeholder, _Extension);\n\n  function Placeholder() {\n    _classCallCheck(this, Placeholder);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(Placeholder).apply(this, arguments));\n  }\n\n  _createClass(Placeholder, [{\n    key: \"name\",\n    get: function get() {\n      return 'placeholder';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        emptyNodeClass: 'is-empty',\n        emptyNodeText: 'Write something …',\n        showOnlyWhenEditable: true,\n        showOnlyCurrent: true\n      };\n    }\n  }, {\n    key: \"update\",\n    get: function get() {\n      return function (view) {\n        view.updateState(view.state);\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      var _this = this;\n\n      return [new Plugin({\n        props: {\n          decorations: function decorations(_ref) {\n            var doc = _ref.doc,\n                plugins = _ref.plugins,\n                selection = _ref.selection;\n            var editablePlugin = plugins.find(function (plugin) {\n              return plugin.key.startsWith('editable$');\n            });\n            var editable = editablePlugin.props.editable();\n            var active = editable || !_this.options.showOnlyWhenEditable;\n            var anchor = selection.anchor;\n            var decorations = [];\n\n            if (!active) {\n              return false;\n            }\n\n            doc.descendants(function (node, pos) {\n              var hasAnchor = anchor >= pos && anchor <= pos + node.nodeSize;\n              var isEmpty = node.content.size === 0;\n\n              if ((hasAnchor || !_this.options.showOnlyCurrent) && isEmpty) {\n                var decoration = Decoration.node(pos, pos + node.nodeSize, {\n                  class: _this.options.emptyNodeClass,\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  return Placeholder;\n}(Extension);\n\nvar Search =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(Search, _Extension);\n\n  function Search() {\n    var _this;\n\n    var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n\n    _classCallCheck(this, Search);\n\n    _this = _possibleConstructorReturn(this, _getPrototypeOf(Search).call(this, options));\n    _this.results = [];\n    _this.searchTerm = null;\n    _this._updating = false;\n    return _this;\n  }\n\n  _createClass(Search, [{\n    key: \"commands\",\n    value: function commands() {\n      var _this2 = this;\n\n      return {\n        find: function find(attrs) {\n          return _this2.find(attrs);\n        },\n        replace: function replace(attrs) {\n          return _this2.replace(attrs);\n        },\n        replaceAll: function replaceAll(attrs) {\n          return _this2.replaceAll(attrs);\n        },\n        clearSearch: function clearSearch() {\n          return _this2.clear();\n        }\n      };\n    }\n  }, {\n    key: \"_search\",\n    value: function _search(doc) {\n      var _this3 = this;\n\n      this.results = [];\n      var mergedTextNodes = [];\n      var index = 0;\n\n      if (!this.searchTerm) {\n        return;\n      }\n\n      doc.descendants(function (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: pos\n            };\n          }\n        } else {\n          index += 1;\n        }\n      });\n      mergedTextNodes.forEach(function (_ref) {\n        var text = _ref.text,\n            pos = _ref.pos;\n        var search = _this3.findRegExp;\n        var m; // eslint-disable-next-line no-cond-assign\n\n        while (m = search.exec(text)) {\n          if (m[0] === '') {\n            break;\n          }\n\n          _this3.results.push({\n            from: pos + m.index,\n            to: pos + m.index + m[0].length\n          });\n        }\n      });\n    }\n  }, {\n    key: \"replace\",\n    value: function replace(_replace) {\n      var _this4 = this;\n\n      return function (state, dispatch) {\n        var firstResult = _this4.results[0];\n\n        if (!firstResult) {\n          return;\n        }\n\n        var _this4$results$ = _this4.results[0],\n            from = _this4$results$.from,\n            to = _this4$results$.to;\n        dispatch(state.tr.insertText(_replace, from, to));\n\n        _this4.editor.commands.find(_this4.searchTerm);\n      };\n    }\n  }, {\n    key: \"rebaseNextResult\",\n    value: function rebaseNextResult(replace, index) {\n      var lastOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n      var nextIndex = index + 1;\n\n      if (!this.results[nextIndex]) {\n        return null;\n      }\n\n      var _this$results$index = this.results[index],\n          currentFrom = _this$results$index.from,\n          currentTo = _this$results$index.to;\n      var offset = currentTo - currentFrom - replace.length + lastOffset;\n      var _this$results$nextInd = this.results[nextIndex],\n          from = _this$results$nextInd.from,\n          to = _this$results$nextInd.to;\n      this.results[nextIndex] = {\n        to: to - offset,\n        from: from - offset\n      };\n      return offset;\n    }\n  }, {\n    key: \"replaceAll\",\n    value: function replaceAll(replace) {\n      var _this5 = this;\n\n      return function (_ref2, dispatch) {\n        var tr = _ref2.tr;\n        var offset;\n\n        if (!_this5.results.length) {\n          return;\n        }\n\n        _this5.results.forEach(function (_ref3, index) {\n          var from = _ref3.from,\n              to = _ref3.to;\n          tr.insertText(replace, from, to);\n          offset = _this5.rebaseNextResult(replace, index, offset);\n        });\n\n        dispatch(tr);\n\n        _this5.editor.commands.find(_this5.searchTerm);\n      };\n    }\n  }, {\n    key: \"find\",\n    value: function find(searchTerm) {\n      var _this6 = this;\n\n      return function (state, dispatch) {\n        _this6.searchTerm = _this6.options.disableRegex ? searchTerm.replace(/[-/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&') : searchTerm;\n\n        _this6.updateView(state, dispatch);\n      };\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      var _this7 = this;\n\n      return function (state, dispatch) {\n        _this7.searchTerm = null;\n\n        _this7.updateView(state, dispatch);\n      };\n    }\n  }, {\n    key: \"updateView\",\n    value: function updateView(_ref4, dispatch) {\n      var tr = _ref4.tr;\n      this._updating = true;\n      dispatch(tr);\n      this._updating = false;\n    }\n  }, {\n    key: \"createDeco\",\n    value: function createDeco(doc) {\n      this._search(doc);\n\n      return this.decorations ? DecorationSet.create(doc, this.decorations) : [];\n    }\n  }, {\n    key: \"name\",\n    get: function get() {\n      return 'search';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        autoSelectNext: true,\n        findClass: 'find',\n        searching: false,\n        caseSensitive: false,\n        disableRegex: true,\n        alwaysSearch: false\n      };\n    }\n  }, {\n    key: \"findRegExp\",\n    get: function get() {\n      return RegExp(this.searchTerm, !this.options.caseSensitive ? 'gui' : 'gu');\n    }\n  }, {\n    key: \"decorations\",\n    get: function get() {\n      var _this8 = this;\n\n      return this.results.map(function (deco) {\n        return Decoration.inline(deco.from, deco.to, {\n          class: _this8.options.findClass\n        });\n      });\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      var _this9 = this;\n\n      return [new Plugin({\n        state: {\n          init: function init() {\n            return DecorationSet.empty;\n          },\n          apply: function apply(tr, old) {\n            if (_this9._updating || _this9.options.searching || tr.docChanged && _this9.options.alwaysSearch) {\n              return _this9.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: function decorations(state) {\n            return this.getState(state);\n          }\n        }\n      })];\n    }\n  }]);\n\n  return Search;\n}(Extension);\n\nvar TrailingNode =\n/*#__PURE__*/\nfunction (_Extension) {\n  _inherits(TrailingNode, _Extension);\n\n  function TrailingNode() {\n    _classCallCheck(this, TrailingNode);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(TrailingNode).apply(this, arguments));\n  }\n\n  _createClass(TrailingNode, [{\n    key: \"name\",\n    get: function get() {\n      return 'trailing_node';\n    }\n  }, {\n    key: \"defaultOptions\",\n    get: function get() {\n      return {\n        node: 'paragraph',\n        notAfter: ['paragraph']\n      };\n    }\n  }, {\n    key: \"plugins\",\n    get: function get() {\n      var _this = this;\n\n      var plugin = new PluginKey(this.name);\n      var disabledNodes = Object.entries(this.editor.schema.nodes).map(function (_ref) {\n        var _ref2 = _slicedToArray(_ref, 2),\n            value = _ref2[1];\n\n        return value;\n      }).filter(function (node) {\n        return _this.options.notAfter.includes(node.name);\n      });\n      return [new Plugin({\n        key: plugin,\n        view: function view() {\n          return {\n            update: function update(view) {\n              var state = view.state;\n              var insertNodeAtEnd = plugin.getState(state);\n\n              if (!insertNodeAtEnd) {\n                return;\n              }\n\n              var doc = state.doc,\n                  schema = state.schema,\n                  tr = state.tr;\n              var type = schema.nodes[_this.options.node];\n              var transaction = tr.insert(doc.content.size, type.create());\n              view.dispatch(transaction);\n            }\n          };\n        },\n        state: {\n          init: function init(_, state) {\n            var lastNode = state.tr.doc.lastChild;\n            return !nodeEqualsType({\n              node: lastNode,\n              types: disabledNodes\n            });\n          },\n          apply: function apply(tr, value) {\n            if (!tr.docChanged) {\n              return value;\n            }\n\n            var lastNode = tr.doc.lastChild;\n            return !nodeEqualsType({\n              node: lastNode,\n              types: disabledNodes\n            });\n          }\n        }\n      })];\n    }\n  }]);\n\n  return TrailingNode;\n}(Extension);\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","<template>\r\n\t<form class=\"col-md-8 mx-auto\" @submit.prevent=\"onSubmit\">\r\n\t\t<div class=\"loader\" v-if=\"loading\"></div>\r\n\t\t<div v-show=\"!loading\">\r\n\t\t\t<div class=\"btn-group\" role=\"group\" aria-label=\"Basic example\">\r\n\t\t\t\t<button type=\"button\" class=\"btn btn-primary\" @click=\"backToList\">\r\n\t\t\t\t\t<i class=\"fas fa-th-list\"></i>\r\n\t\t\t\t\t{{ $t('backToList') }}\r\n\t\t\t\t</button>\r\n\t\t\t</div>\r\n\t\t\t<page-title :title=\"$t('notificationConfig.title')\"></page-title>\r\n\t\t\t<div class=\"card row\">\r\n\t\t\t\t<div class=\"card-header bg-primary text-white\">\r\n\t\t\t\t\t<div class=\"card-title h5 m-0\">{{ $t('notificationConfig.config') }}</div>\r\n\t\t\t\t</div>\r\n\t\t\t\t<div class=\"card-body\">\r\n\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t<div class=\"form-group col-12\">\r\n\t\t\t\t\t\t\t<label :for=\"'notificationType' + _uid\" class=\"font-weight-bold required\">{{ $t('notificationConfig.type') }}</label>\r\n\t\t\t\t\t\t\t<input\r\n\t\t\t\t\t\t\t\ttype=\"text\"\r\n\t\t\t\t\t\t\t\tclass=\"form-control\"\r\n\t\t\t\t\t\t\t\treadonly\r\n\t\t\t\t\t\t\t\t:id=\"'eventType' + _uid\"\r\n\t\t\t\t\t\t\t\t:name=\"'eventType' + _uid\"\r\n\t\t\t\t\t\t\t\tv-model=\"notificationConfig.notificationType\"\r\n\t\t\t\t\t\t\t\t:data-vv-as=\"$t('notificationConfig.type')\"\r\n\t\t\t\t\t\t\t/>\r\n\t\t\t\t\t\t\t<span class=\"text-danger\" v-if=\"errors.has('notificationType' + _uid)\">{{ errors.first('notificationType' + _uid) }}</span>\r\n\t\t\t\t\t\t</div>\r\n\t\t\t\t\t</div>\r\n\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t<div class=\"form-group col-12\">\r\n\t\t\t\t\t\t\t<label :for=\"'notificationType' + _uid\">{{ $t('notificationConfig.keywordsDescription') }}</label>\r\n\t\t\t\t\t\t\t<textarea class=\"form-control\" readonly v-model=\"notificationConfig.keywords\" :data-vv-as=\"$t('notificationConfig.keywords')\" rows=\"8\"></textarea>\r\n\t\t\t\t\t\t</div>\r\n\t\t\t\t\t</div>\r\n\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t<div class=\"form-group col-12\">\r\n\t\t\t\t\t\t\t<label :for=\"'subject' + _uid\" class=\"font-weight-bold required\">{{ $t('notificationConfig.subject') }}</label>\r\n\t\t\t\t\t\t\t<input\r\n\t\t\t\t\t\t\t\ttype=\"text\"\r\n\t\t\t\t\t\t\t\tclass=\"form-control\"\r\n\t\t\t\t\t\t\t\t:id=\"'subject' + _uid\"\r\n\t\t\t\t\t\t\t\t:name=\"'subject' + _uid\"\r\n\t\t\t\t\t\t\t\tv-model=\"notificationConfig.messageSubject\"\r\n\t\t\t\t\t\t\t\t:data-vv-as=\"$t('notificationConfig.subject')\"\r\n\t\t\t\t\t\t\t/>\r\n\t\t\t\t\t\t\t<span class=\"text-danger\" v-if=\"errors.has('subject' + _uid)\">{{ errors.first('subject' + _uid) }}</span>\r\n\t\t\t\t\t\t</div>\r\n\t\t\t\t\t</div>\r\n\r\n\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t<div class=\"form-group col-12\">\r\n\t\t\t\t\t\t\t<label :for=\"'content' + _uid\" class=\"font-weight-bold required\">{{ $t('notificationConfig.content') }}</label>\r\n\t\t\t\t\t\t\t<editor-menu-bar :editor=\"editor\" v-slot=\"{ commands, isActive }\">\r\n\t\t\t\t\t\t\t\t<div class=\"menubar\">\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.bold() }\" @click=\"commands.bold\">\r\n\t\t\t\t\t\t\t\t\t\t<i class=\"fas fa-bold\"></i>\r\n\t\t\t\t\t\t\t\t\t</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.italic() }\" @click=\"commands.italic\">\r\n\t\t\t\t\t\t\t\t\t\t<i class=\"fas fa-italic\"></i>\r\n\t\t\t\t\t\t\t\t\t</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.underline() }\" @click=\"commands.underline\">\r\n\t\t\t\t\t\t\t\t\t\t<i class=\"fas fa-underline\"></i>\r\n\t\t\t\t\t\t\t\t\t</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.bullet_list() }\" @click=\"commands.bullet_list\">\r\n\t\t\t\t\t\t\t\t\t\t<i class=\"fas fa-list-ul\"></i>\r\n\t\t\t\t\t\t\t\t\t</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.ordered_list() }\" @click=\"commands.ordered_list\">\r\n\t\t\t\t\t\t\t\t\t\t<i class=\"fas fa-list-ol\"></i>\r\n\t\t\t\t\t\t\t\t\t</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.heading({ level: 1 }) }\" @click=\"commands.heading({ level: 1 })\">H1</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.heading({ level: 2 }) }\" @click=\"commands.heading({ level: 2 })\">H2</button>\r\n\r\n\t\t\t\t\t\t\t\t\t<button type=\"button\" class=\"menubar__button\" :class=\"{ 'is-active': isActive.heading({ level: 3 }) }\" @click=\"commands.heading({ level: 3 })\">H3</button>\r\n\t\t\t\t\t\t\t\t</div>\r\n\t\t\t\t\t\t\t</editor-menu-bar>\r\n\t\t\t\t\t\t\t<editor-content :editor=\"editor\" class=\"editorContent\" />\r\n\t\t\t\t\t\t</div>\r\n\t\t\t\t\t</div>\r\n\t\t\t\t</div>\r\n\t\t\t</div>\r\n\r\n\t\t\t<div class=\"text-center mt-2 mb-5\">\r\n\t\t\t\t<button type=\"button\" class=\"btn btn-primary btn\" @click=\"onSubmit\">\r\n\t\t\t\t\t<i class=\"fas fa-save\"></i>\r\n\t\t\t\t\t{{ $t('buttons.save.btnText') }}\r\n\t\t\t\t</button>\r\n\t\t\t</div>\r\n\t\t</div>\r\n\t</form>\r\n</template>\r\n\r\n<script>\r\nimport { NotificationConfig } from '../../../models/models';\r\nimport PageTitle from '../../../components/common/PageTitle';\r\n\r\nimport { Editor, EditorContent, EditorMenuBar } from 'tiptap';\r\nimport { Heading, OrderedList, BulletList, ListItem, Bold, Italic, Link, Underline } from 'tiptap-extensions';\r\n\r\nexport default {\r\n\tcomponents: {\r\n\t\tPageTitle,\r\n\t\tEditorContent,\r\n\t\tEditorMenuBar\r\n\t},\r\n\tdata() {\r\n\t\treturn {\r\n\t\t\tid: null,\r\n\t\t\tnotificationConfig: new NotificationConfig(),\r\n\t\t\tloading: false,\r\n\t\t\teditor: new Editor({\r\n\t\t\t\textensions: [\r\n\t\t\t\t\tnew BulletList(),\r\n\t\t\t\t\tnew Heading({ levels: [1, 2, 3] }),\r\n\t\t\t\t\tnew ListItem(),\r\n\t\t\t\t\tnew OrderedList(),\r\n\t\t\t\t\tnew Link(),\r\n\t\t\t\t\tnew Bold(),\r\n\t\t\t\t\tnew Italic(),\r\n\t\t\t\t\tnew Underline()\r\n\t\t\t\t],\r\n\t\t\t\tcontent: 'Message body',\r\n\t\t\t\tonUpdate: ({ getJSON, getHTML }) => {\r\n\t\t\t\t\tthis.json = getJSON();\r\n\t\t\t\t\tthis.html = getHTML();\r\n\t\t\t\t}\r\n\t\t\t}),\r\n\t\t\tjson: '',\r\n\t\t\thtml: ''\r\n\t\t};\r\n\t},\r\n\tmethods: {\r\n\t\tonSubmit() {\r\n\t\t\tthis.notificationConfig.messageContent = this.editor.getHTML();\r\n\r\n\t\t\tthis.$validator.validateAll().then(result => {\r\n\t\t\t\tif (result) {\r\n\t\t\t\t\tif (this.id) {\r\n\t\t\t\t\t\tthis.edit();\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t},\r\n\t\tbackToList() {\r\n\t\t\tthis.$router.push('/administration/notifications');\r\n\t\t},\r\n\r\n\t\tedit() {\r\n\t\t\tthis.loading = true;\r\n\t\t\tthis.$http\r\n\t\t\t\t.put('/api/notificationConfig', this.notificationConfig)\r\n\t\t\t\t.then(result => {\r\n\t\t\t\t\tthis.loading = false;\r\n\t\t\t\t\tthis.$vs.notify({\r\n\t\t\t\t\t\ttitle: this.$t('notifications.success'), // TODO:\r\n\t\t\t\t\t\ttext: this.$t('notifications.successfulSavedData'), // TODO:\r\n\t\t\t\t\t\tposition: 'top-center',\r\n\t\t\t\t\t\tcolor: 'success'\r\n\t\t\t\t\t});\r\n\t\t\t\t\tthis.backToList();\r\n\t\t\t\t})\r\n\t\t\t\t.catch(error => {\r\n\t\t\t\t\tthis.loading = false;\r\n\t\t\t\t\tthis.$vs.notify({\r\n\t\t\t\t\t\ttitle: this.$t('notifications.error'), // TODO:\r\n\t\t\t\t\t\ttext: this.$t('notifications.errorDataNotSaved'), // TODO:\r\n\t\t\t\t\t\tposition: 'top-center',\r\n\t\t\t\t\t\tcolor: 'danger'\r\n\t\t\t\t\t});\r\n\t\t\t\t});\r\n\t\t},\r\n\t\tloadData() {\r\n\t\t\tthis.loading = true;\r\n\t\t\tvar self = this;\r\n\t\t\tthis.$http\r\n\t\t\t\t.get(`/api/notificationConfig/${this.id}`)\r\n\t\t\t\t.then(result => {\r\n\t\t\t\t\tself.notificationConfig = new NotificationConfig(result.data);\r\n\r\n\t\t\t\t\tself.editor.setContent(self.notificationConfig.messageContent, true);\r\n\r\n\t\t\t\t\tself.loading = false;\r\n\t\t\t\t})\r\n\t\t\t\t.catch(error => {\r\n\t\t\t\t\t// TODO: Notify\r\n\t\t\t\t\tthis.loading = false;\r\n\t\t\t\t});\r\n\t\t}\r\n\t},\r\n\tmounted() {\r\n\t\tthis.id = this.$route.params.id;\r\n\t\tif (this.id) {\r\n\t\t\tthis.loadData();\r\n\t\t}\r\n\t},\r\n\tbeforeDestroy() {\r\n\t\tthis.editor.destroy();\r\n\t}\r\n};\r\n</script>\r\n\r\n<style scoped>\r\n.menubar__button {\r\n\tmargin-right: 10px;\r\n}\r\n\r\n.menubar {\r\n\tmargin-bottom: 10px;\r\n}\r\n\r\n/*div .editorContent {\r\n        line-height: 1px;\r\n        margin-top: 20px;\r\n    }*/\r\n</style>\r\n","import mod from \"-!../../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../../node_modules/thread-loader/dist/cjs.js!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./NotificationConfig.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../../node_modules/thread-loader/dist/cjs.js!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./NotificationConfig.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./NotificationConfig.vue?vue&type=template&id=63d14958&scoped=true&\"\nimport script from \"./NotificationConfig.vue?vue&type=script&lang=js&\"\nexport * from \"./NotificationConfig.vue?vue&type=script&lang=js&\"\nimport style0 from \"./NotificationConfig.vue?vue&type=style&index=0&id=63d14958&prod&scoped=true&lang=css&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n  script,\n  render,\n  staticRenderFns,\n  false,\n  null,\n  \"63d14958\",\n  null\n  \n)\n\nexport default component.exports","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar OrderedMap = _interopDefault(require('orderedmap'));\n\nfunction findDiffStart(a, b, pos) {\n  for (var i = 0;; i++) {\n    if (i == a.childCount || i == b.childCount)\n      { return a.childCount == b.childCount ? null : pos }\n\n    var 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 (var j = 0; childA.text[j] == childB.text[j]; j++)\n        { pos++; }\n      return pos\n    }\n    if (childA.content.size || childB.content.size) {\n      var inner = findDiffStart(childA.content, childB.content, pos + 1);\n      if (inner != null) { return inner }\n    }\n    pos += childA.nodeSize;\n  }\n}\n\nfunction findDiffEnd(a, b, posA, posB) {\n  for (var iA = a.childCount, iB = b.childCount;;) {\n    if (iA == 0 || iB == 0)\n      { return iA == iB ? null : {a: posA, b: posB} }\n\n    var 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      var 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      var inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);\n      if (inner) { return inner }\n    }\n    posA -= size; posB -= size;\n  }\n}\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.\nvar Fragment = function Fragment(content, size) {\n  var this$1 = this;\n\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 (var i = 0; i < content.length; i++)\n    { this$1.size += content[i].nodeSize; } }\n};\n\nvar prototypeAccessors$1 = { firstChild: {},lastChild: {},childCount: {} };\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`.\nFragment.prototype.nodesBetween = function nodesBetween (from, to, f, nodeStart, parent) {\n    var this$1 = this;\n    if ( nodeStart === void 0 ) nodeStart = 0;\n\n  for (var i = 0, pos = 0; pos < to; i++) {\n    var child = this$1.content[i], end = pos + child.nodeSize;\n    if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {\n      var 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.\nFragment.prototype.descendants = function descendants (f) {\n  this.nodesBetween(0, this.size, f);\n};\n\n// : (number, number, ?string, ?string) → string\nFragment.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {\n  var text = \"\", separated = true;\n  this.nodesBetween(from, to, function (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.\nFragment.prototype.append = function append (other) {\n  if (!other.size) { return this }\n  if (!this.size) { return other }\n  var 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.\nFragment.prototype.cut = function cut (from, to) {\n    var this$1 = this;\n\n  if (to == null) { to = this.size; }\n  if (from == 0 && to == this.size) { return this }\n  var result = [], size = 0;\n  if (to > from) { for (var i = 0, pos = 0; pos < to; i++) {\n    var child = this$1.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\nFragment.prototype.cutByIndex = function 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.\nFragment.prototype.replaceChild = function replaceChild (index, node) {\n  var current = this.content[index];\n  if (current == node) { return this }\n  var copy = this.content.slice();\n  var 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.\nFragment.prototype.addToStart = function 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.\nFragment.prototype.addToEnd = function 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.\nFragment.prototype.eq = function eq (other) {\n    var this$1 = this;\n\n  if (this.content.length != other.content.length) { return false }\n  for (var i = 0; i < this.content.length; i++)\n    { if (!this$1.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.\nprototypeAccessors$1.firstChild.get = function () { return this.content.length ? this.content[0] : null };\n\n// :: ?Node\n// The last child of the fragment, or `null` if it is empty.\nprototypeAccessors$1.lastChild.get = function () { return this.content.length ? this.content[this.content.length - 1] : null };\n\n// :: number\n// The number of child nodes in this fragment.\nprototypeAccessors$1.childCount.get = function () { 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.\nFragment.prototype.child = function child (index) {\n  var 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.\nFragment.prototype.maybeChild = function 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.\nFragment.prototype.forEach = function forEach (f) {\n    var this$1 = this;\n\n  for (var i = 0, p = 0; i < this.content.length; i++) {\n    var child = this$1.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.\nFragment.prototype.findDiffStart = function findDiffStart$1 (other, pos) {\n    if ( pos === void 0 ) pos = 0;\n\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.\nFragment.prototype.findDiffEnd = function findDiffEnd$1 (other, pos, otherPos) {\n    if ( pos === void 0 ) pos = this.size;\n    if ( otherPos === void 0 ) otherPos = other.size;\n\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.)\nFragment.prototype.findIndex = function findIndex (pos, round) {\n    var this$1 = this;\n    if ( round === void 0 ) round = -1;\n\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 (var i = 0, curPos = 0;; i++) {\n    var cur = this$1.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.\nFragment.prototype.toString = function toString () { return \"<\" + this.toStringInner() + \">\" };\n\nFragment.prototype.toStringInner = function toStringInner () { return this.content.join(\", \") };\n\n// :: () → ?Object\n// Create a JSON-serializeable representation of this fragment.\nFragment.prototype.toJSON = function toJSON () {\n  return this.content.length ? this.content.map(function (n) { return n.toJSON(); }) : null\n};\n\n// :: (Schema, ?Object) → Fragment\n// Deserialize a fragment from its JSON representation.\nFragment.fromJSON = function 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.\nFragment.fromArray = function fromArray (array) {\n  if (!array.length) { return Fragment.empty }\n  var joined, size = 0;\n  for (var i = 0; i < array.length; i++) {\n    var 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.\nFragment.from = function 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\nObject.defineProperties( Fragment.prototype, prototypeAccessors$1 );\n\nvar 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\nfunction compareDeep(a, b) {\n  if (a === b) { return true }\n  if (!(a && typeof a == \"object\") ||\n      !(b && typeof b == \"object\")) { return false }\n  var 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 (var i = 0; i < a.length; i++) { if (!compareDeep(a[i], b[i])) { return false } }\n  } else {\n    for (var p in a) { if (!(p in b) || !compareDeep(a[p], b[p])) { return false } }\n    for (var p$1 in b) { if (!(p$1 in a)) { return false } }\n  }\n  return true\n}\n\n// ::- A mark is a piece of information that can be attached to a node,\n// such as it being emphasized, in code font, or a link. It has a type\n// and optionally a set of attributes that provide further information\n// (such as the target of the link). Marks are created through a\n// `Schema`, which controls which types exist and which\n// attributes they have.\nvar Mark = function Mark(type, attrs) {\n  // :: MarkType\n  // The type of this mark.\n  this.type = type;\n  // :: Object\n  // The attributes associated with this mark.\n  this.attrs = attrs;\n};\n\n// :: ([Mark]) → [Mark]\n// Given a set of marks, create a new set which contains this one as\n// well, in the right position. If this mark is already in the set,\n// the set itself is returned. If any marks that are set to be\n// [exclusive](#model.MarkSpec.excludes) with this mark are present,\n// those are replaced by this one.\nMark.prototype.addToSet = function addToSet (set) {\n    var this$1 = this;\n\n  var copy, placed = false;\n  for (var i = 0; i < set.length; i++) {\n    var other = set[i];\n    if (this$1.eq(other)) { return set }\n    if (this$1.type.excludes(other.type)) {\n      if (!copy) { copy = set.slice(0, i); }\n    } else if (other.type.excludes(this$1.type)) {\n      return set\n    } else {\n      if (!placed && other.type.rank > this$1.type.rank) {\n        if (!copy) { copy = set.slice(0, i); }\n        copy.push(this$1);\n        placed = true;\n      }\n      if (copy) { copy.push(other); }\n    }\n  }\n  if (!copy) { copy = set.slice(); }\n  if (!placed) { copy.push(this); }\n  return copy\n};\n\n// :: ([Mark]) → [Mark]\n// Remove this mark from the given set, returning a new set. If this\n// mark is not in the set, the set itself is returned.\nMark.prototype.removeFromSet = function removeFromSet (set) {\n    var this$1 = this;\n\n  for (var i = 0; i < set.length; i++)\n    { if (this$1.eq(set[i]))\n      { return set.slice(0, i).concat(set.slice(i + 1)) } }\n  return set\n};\n\n// :: ([Mark]) → bool\n// Test whether this mark is in the given set of marks.\nMark.prototype.isInSet = function isInSet (set) {\n    var this$1 = this;\n\n  for (var i = 0; i < set.length; i++)\n    { if (this$1.eq(set[i])) { return true } }\n  return false\n};\n\n// :: (Mark) → bool\n// Test whether this mark has the same type and attributes as\n// another mark.\nMark.prototype.eq = function eq (other) {\n  return this == other ||\n    (this.type == other.type && compareDeep(this.attrs, other.attrs))\n};\n\n// :: () → Object\n// Convert this mark to a JSON-serializeable representation.\nMark.prototype.toJSON = function toJSON () {\n    var this$1 = this;\n\n  var obj = {type: this.type.name};\n  for (var _ in this$1.attrs) {\n    obj.attrs = this$1.attrs;\n    break\n  }\n  return obj\n};\n\n// :: (Schema, Object) → Mark\nMark.fromJSON = function fromJSON (schema, json) {\n  if (!json) { throw new RangeError(\"Invalid input for Mark.fromJSON\") }\n  var type = schema.marks[json.type];\n  if (!type) { throw new RangeError((\"There is no mark type \" + (json.type) + \" in this schema\")) }\n  return type.create(json.attrs)\n};\n\n// :: ([Mark], [Mark]) → bool\n// Test whether two sets of marks are identical.\nMark.sameSet = function sameSet (a, b) {\n  if (a == b) { return true }\n  if (a.length != b.length) { return false }\n  for (var i = 0; i < a.length; i++)\n    { if (!a[i].eq(b[i])) { return false } }\n  return true\n};\n\n// :: (?union<Mark, [Mark]>) → [Mark]\n// Create a properly sorted mark set from null, a single mark, or an\n// unsorted array of marks.\nMark.setFrom = function setFrom (marks) {\n  if (!marks || marks.length == 0) { return Mark.none }\n  if (marks instanceof Mark) { return [marks] }\n  var copy = marks.slice();\n  copy.sort(function (a, b) { return a.type.rank - b.type.rank; });\n  return copy\n};\n\n// :: [Mark] The empty set of marks.\nMark.none = [];\n\n// ReplaceError:: class extends Error\n// Error type raised by [`Node.replace`](#model.Node.replace) when\n// given an invalid replacement.\n\nfunction ReplaceError(message) {\n  var err = Error.call(this, message);\n  err.__proto__ = ReplaceError.prototype;\n  return err\n}\n\nReplaceError.prototype = Object.create(Error.prototype);\nReplaceError.prototype.constructor = ReplaceError;\nReplaceError.prototype.name = \"ReplaceError\";\n\n// ::- A slice represents a piece cut out of a larger document. It\n// stores not only a fragment, but also the depth up to which nodes on\n// both side are ‘open’ (cut through).\nvar Slice = function Slice(content, openStart, openEnd) {\n  // :: Fragment The slice's content.\n  this.content = content;\n  // :: number The open depth at the start.\n  this.openStart = openStart;\n  // :: number The open depth at the end.\n  this.openEnd = openEnd;\n};\n\nvar prototypeAccessors$2 = { size: {} };\n\n// :: number\n// The size this slice would add when inserted into a document.\nprototypeAccessors$2.size.get = function () {\n  return this.content.size - this.openStart - this.openEnd\n};\n\nSlice.prototype.insertAt = function insertAt (pos, fragment) {\n  var content = insertInto(this.content, pos + this.openStart, fragment, null);\n  return content && new Slice(content, this.openStart, this.openEnd)\n};\n\nSlice.prototype.removeBetween = function removeBetween (from, to) {\n  return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)\n};\n\n// :: (Slice) → bool\n// Tests whether this slice is equal to another slice.\nSlice.prototype.eq = function eq (other) {\n  return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd\n};\n\nSlice.prototype.toString = function toString () {\n  return this.content + \"(\" + this.openStart + \",\" + this.openEnd + \")\"\n};\n\n// :: () → ?Object\n// Convert a slice to a JSON-serializable representation.\nSlice.prototype.toJSON = function toJSON () {\n  if (!this.content.size) { return null }\n  var json = {content: this.content.toJSON()};\n  if (this.openStart > 0) { json.openStart = this.openStart; }\n  if (this.openEnd > 0) { json.openEnd = this.openEnd; }\n  return json\n};\n\n// :: (Schema, ?Object) → Slice\n// Deserialize a slice from its JSON representation.\nSlice.fromJSON = function fromJSON (schema, json) {\n  if (!json) { return Slice.empty }\n  var openStart = json.openStart || 0, openEnd = json.openEnd || 0;\n  if (typeof openStart != \"number\" || typeof openEnd != \"number\")\n    { throw new RangeError(\"Invalid input for Slice.fromJSON\") }\n  return new Slice(Fragment.fromJSON(schema, json.content), json.openStart || 0, json.openEnd || 0)\n};\n\n// :: (Fragment, ?bool) → Slice\n// Create a slice from a fragment by taking the maximum possible\n// open value on both side of the fragment.\nSlice.maxOpen = function maxOpen (fragment, openIsolating) {\n    if ( openIsolating === void 0 ) openIsolating=true;\n\n  var openStart = 0, openEnd = 0;\n  for (var n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) { openStart++; }\n  for (var n$1 = fragment.lastChild; n$1 && !n$1.isLeaf && (openIsolating || !n$1.type.spec.isolating); n$1 = n$1.lastChild) { openEnd++; }\n  return new Slice(fragment, openStart, openEnd)\n};\n\nObject.defineProperties( Slice.prototype, prototypeAccessors$2 );\n\nfunction removeRange(content, from, to) {\n  var ref = content.findIndex(from);\n  var index = ref.index;\n  var offset = ref.offset;\n  var child = content.maybeChild(index);\n  var ref$1 = content.findIndex(to);\n  var indexTo = ref$1.index;\n  var offsetTo = ref$1.offset;\n  if (offset == from || child.isText) {\n    if (offsetTo != to && !content.child(indexTo).isText) { throw new RangeError(\"Removing non-flat range\") }\n    return content.cut(0, from).append(content.cut(to))\n  }\n  if (index != indexTo) { throw new RangeError(\"Removing non-flat range\") }\n  return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))\n}\n\nfunction insertInto(content, dist, insert, parent) {\n  var ref = content.findIndex(dist);\n  var index = ref.index;\n  var offset = ref.offset;\n  var child = content.maybeChild(index);\n  if (offset == dist || child.isText) {\n    if (parent && !parent.canReplace(index, index, insert)) { return null }\n    return content.cut(0, dist).append(insert).append(content.cut(dist))\n  }\n  var inner = insertInto(child.content, dist - offset - 1, insert);\n  return inner && content.replaceChild(index, child.copy(inner))\n}\n\n// :: Slice\n// The empty slice.\nSlice.empty = new Slice(Fragment.empty, 0, 0);\n\nfunction replace($from, $to, slice) {\n  if (slice.openStart > $from.depth)\n    { throw new ReplaceError(\"Inserted content deeper than insertion position\") }\n  if ($from.depth - slice.openStart != $to.depth - slice.openEnd)\n    { throw new ReplaceError(\"Inconsistent open depths\") }\n  return replaceOuter($from, $to, slice, 0)\n}\n\nfunction replaceOuter($from, $to, slice, depth) {\n  var index = $from.index(depth), node = $from.node(depth);\n  if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {\n    var inner = replaceOuter($from, $to, slice, depth + 1);\n    return node.copy(node.content.replaceChild(index, inner))\n  } else if (!slice.content.size) {\n    return close(node, replaceTwoWay($from, $to, depth))\n  } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case\n    var parent = $from.parent, content = parent.content;\n    return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))\n  } else {\n    var ref = prepareSliceForReplace(slice, $from);\n    var start = ref.start;\n    var end = ref.end;\n    return close(node, replaceThreeWay($from, start, end, $to, depth))\n  }\n}\n\nfunction checkJoin(main, sub) {\n  if (!sub.type.compatibleContent(main.type))\n    { throw new ReplaceError(\"Cannot join \" + sub.type.name + \" onto \" + main.type.name) }\n}\n\nfunction joinable($before, $after, depth) {\n  var node = $before.node(depth);\n  checkJoin(node, $after.node(depth));\n  return node\n}\n\nfunction addNode(child, target) {\n  var last = target.length - 1;\n  if (last >= 0 && child.isText && child.sameMarkup(target[last]))\n    { target[last] = child.withText(target[last].text + child.text); }\n  else\n    { target.push(child); }\n}\n\nfunction addRange($start, $end, depth, target) {\n  var node = ($end || $start).node(depth);\n  var startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;\n  if ($start) {\n    startIndex = $start.index(depth);\n    if ($start.depth > depth) {\n      startIndex++;\n    } else if ($start.textOffset) {\n      addNode($start.nodeAfter, target);\n      startIndex++;\n    }\n  }\n  for (var i = startIndex; i < endIndex; i++) { addNode(node.child(i), target); }\n  if ($end && $end.depth == depth && $end.textOffset)\n    { addNode($end.nodeBefore, target); }\n}\n\nfunction close(node, content) {\n  if (!node.type.validContent(content))\n    { throw new ReplaceError(\"Invalid content for node \" + node.type.name) }\n  return node.copy(content)\n}\n\nfunction replaceThreeWay($from, $start, $end, $to, depth) {\n  var openStart = $from.depth > depth && joinable($from, $start, depth + 1);\n  var openEnd = $to.depth > depth && joinable($end, $to, depth + 1);\n\n  var content = [];\n  addRange(null, $from, depth, content);\n  if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {\n    checkJoin(openStart, openEnd);\n    addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);\n  } else {\n    if (openStart)\n      { addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content); }\n    addRange($start, $end, depth, content);\n    if (openEnd)\n      { addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content); }\n  }\n  addRange($to, null, depth, content);\n  return new Fragment(content)\n}\n\nfunction replaceTwoWay($from, $to, depth) {\n  var content = [];\n  addRange(null, $from, depth, content);\n  if ($from.depth > depth) {\n    var type = joinable($from, $to, depth + 1);\n    addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);\n  }\n  addRange($to, null, depth, content);\n  return new Fragment(content)\n}\n\nfunction prepareSliceForReplace(slice, $along) {\n  var extra = $along.depth - slice.openStart, parent = $along.node(extra);\n  var node = parent.copy(slice.content);\n  for (var i = extra - 1; i >= 0; i--)\n    { node = $along.node(i).copy(Fragment.from(node)); }\n  return {start: node.resolveNoCache(slice.openStart + extra),\n          end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}\n}\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`.\nvar ResolvedPos = function ResolvedPos(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\nvar prototypeAccessors$3 = { parent: {},doc: {},textOffset: {},nodeAfter: {},nodeBefore: {} };\n\nResolvedPos.prototype.resolveDepth = function 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.\nprototypeAccessors$3.parent.get = function () { return this.node(this.depth) };\n\n// :: Node\n// The root node in which the position was resolved.\nprototypeAccessors$3.doc.get = function () { 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`.\nResolvedPos.prototype.node = function 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 2 and `p.index(1)` is 3.\nResolvedPos.prototype.index = function 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.\nResolvedPos.prototype.indexAfter = function 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.\nResolvedPos.prototype.start = function 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.\nResolvedPos.prototype.end = function 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.\nResolvedPos.prototype.before = function 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`.\nResolvedPos.prototype.after = function 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.\nprototypeAccessors$3.textOffset.get = function () { 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.\nprototypeAccessors$3.nodeAfter.get = function () {\n  var parent = this.parent, index = this.index(this.depth);\n  if (index == parent.childCount) { return null }\n  var 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.\nprototypeAccessors$3.nodeBefore.get = function () {\n  var index = this.index(this.depth);\n  var 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// :: () → [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.\nResolvedPos.prototype.marks = function marks () {\n  var 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  var 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) { var 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  var 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).\nResolvedPos.prototype.marksAcross = function marksAcross ($end) {\n  var after = this.parent.maybeChild(this.index());\n  if (!after || !after.isInline) { return null }\n\n  var 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.\nResolvedPos.prototype.sharedDepth = function sharedDepth (pos) {\n    var this$1 = this;\n\n  for (var depth = this.depth; depth > 0; depth--)\n    { if (this$1.start(depth) <= pos && this$1.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.\nResolvedPos.prototype.blockRange = function blockRange (other, pred) {\n    var this$1 = this;\n    if ( other === void 0 ) other = this;\n\n  if (other.pos < this.pos) { return other.blockRange(this) }\n  for (var d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)\n    { if (other.pos <= this$1.end(d) && (!pred || pred(this$1.node(d))))\n      { return new NodeRange(this$1, other, d) } }\n};\n\n// :: (ResolvedPos) → bool\n// Query whether the given position shares the same parent node.\nResolvedPos.prototype.sameParent = function 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.\nResolvedPos.prototype.max = function 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.\nResolvedPos.prototype.min = function min (other) {\n  return other.pos < this.pos ? other : this\n};\n\nResolvedPos.prototype.toString = function toString () {\n    var this$1 = this;\n\n  var str = \"\";\n  for (var i = 1; i <= this.depth; i++)\n    { str += (str ? \"/\" : \"\") + this$1.node(i).type.name + \"_\" + this$1.index(i - 1); }\n  return str + \":\" + this.parentOffset\n};\n\nResolvedPos.resolve = function resolve (doc, pos) {\n  if (!(pos >= 0 && pos <= doc.content.size)) { throw new RangeError(\"Position \" + pos + \" out of range\") }\n  var path = [];\n  var start = 0, parentOffset = pos;\n  for (var node = doc;;) {\n    var ref = node.content.findIndex(parentOffset);\n      var index = ref.index;\n      var offset = ref.offset;\n    var 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\nResolvedPos.resolveCached = function resolveCached (doc, pos) {\n  for (var i = 0; i < resolveCache.length; i++) {\n    var cached = resolveCache[i];\n    if (cached.pos == pos && cached.doc == doc) { return cached }\n  }\n  var result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);\n  resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;\n  return result\n};\n\nObject.defineProperties( ResolvedPos.prototype, prototypeAccessors$3 );\n\nvar resolveCache = [];\nvar resolveCachePos = 0;\nvar resolveCacheSize = 12;\n\n// ::- Represents a flat range of content, i.e. one that starts and\n// ends in the same node.\nvar NodeRange = function NodeRange($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\nvar prototypeAccessors$1$1 = { start: {},end: {},parent: {},startIndex: {},endIndex: {} };\n\n// :: number The position at the start of the range.\nprototypeAccessors$1$1.start.get = function () { return this.$from.before(this.depth + 1) };\n// :: number The position at the end of the range.\nprototypeAccessors$1$1.end.get = function () { return this.$to.after(this.depth + 1) };\n\n// :: Node The parent node that the range points into.\nprototypeAccessors$1$1.parent.get = function () { return this.$from.node(this.depth) };\n// :: number The start index of the range in the parent node.\nprototypeAccessors$1$1.startIndex.get = function () { return this.$from.index(this.depth) };\n// :: number The end index of the range in the parent node.\nprototypeAccessors$1$1.endIndex.get = function () { return this.$to.indexAfter(this.depth) };\n\nObject.defineProperties( NodeRange.prototype, prototypeAccessors$1$1 );\n\nvar emptyAttrs = Object.create(null);\n\n// ::- This class represents a node in the tree that makes up a\n// ProseMirror document. So a document is an instance of `Node`, with\n// children that are also instances of `Node`.\n//\n// Nodes are persistent data structures. Instead of changing them, you\n// create new ones with the content you want. Old ones keep pointing\n// at the old document shape. This is made cheaper by sharing\n// structure between the old and new data as much as possible, which a\n// tree shape like this (without back pointers) makes easy.\n//\n// **Do not** directly mutate the properties of a `Node` object. See\n// [the guide](/docs/guide/#doc) for more information.\nvar Node = function Node(type, attrs, content, marks) {\n  // :: NodeType\n  // The type of node that this is.\n  this.type = type;\n\n  // :: Object\n  // An object mapping attribute names to values. The kind of\n  // attributes allowed and required are\n  // [determined](#model.NodeSpec.attrs) by the node type.\n  this.attrs = attrs;\n\n  // :: Fragment\n  // A container holding the node's children.\n  this.content = content || Fragment.empty;\n\n  // :: [Mark]\n  // The marks (things like whether it is emphasized or part of a\n  // link) applied to this node.\n  this.marks = marks || Mark.none;\n};\n\nvar prototypeAccessors = { nodeSize: {},childCount: {},textContent: {},firstChild: {},lastChild: {},isBlock: {},isTextblock: {},inlineContent: {},isInline: {},isText: {},isLeaf: {},isAtom: {} };\n\n// text:: ?string\n// For text nodes, this contains the node's text content.\n\n// :: number\n// The size of this node, as defined by the integer-based [indexing\n// scheme](/docs/guide/#doc.indexing). For text nodes, this is the\n// amount of characters. For other leaf nodes, it is one. For\n// non-leaf nodes, it is the size of the content plus two (the start\n// and end token).\nprototypeAccessors.nodeSize.get = function () { return this.isLeaf ? 1 : 2 + this.content.size };\n\n// :: number\n// The number of children that the node has.\nprototypeAccessors.childCount.get = function () { return this.content.childCount };\n\n// :: (number) → Node\n// Get the child node at the given index. Raises an error when the\n// index is out of range.\nNode.prototype.child = function child (index) { return this.content.child(index) };\n\n// :: (number) → ?Node\n// Get the child node at the given index, if it exists.\nNode.prototype.maybeChild = function maybeChild (index) { return this.content.maybeChild(index) };\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.\nNode.prototype.forEach = function forEach (f) { this.content.forEach(f); };\n\n// :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)\n// Invoke a callback for all descendant nodes recursively between\n// the given two positions that are relative to start of this node's\n// content. The callback is invoked with the node, its\n// parent-relative position, its parent node, and its child index.\n// When the callback returns false for a given node, that node's\n// children will not be recursed over. The last parameter can be\n// used to specify a starting position to count from.\nNode.prototype.nodesBetween = function nodesBetween (from, to, f, startPos) {\n    if ( startPos === void 0 ) startPos = 0;\n\n  this.content.nodesBetween(from, to, f, startPos, this);\n};\n\n// :: ((node: Node, pos: number, parent: Node) → ?bool)\n// Call the given callback for every descendant node. Doesn't\n// descend into a node when the callback returns `false`.\nNode.prototype.descendants = function descendants (f) {\n  this.nodesBetween(0, this.content.size, f);\n};\n\n// :: string\n// Concatenates all the text nodes found in this fragment and its\n// children.\nprototypeAccessors.textContent.get = function () { return this.textBetween(0, this.content.size, \"\") };\n\n// :: (number, number, ?string, ?string) → string\n// Get all text between positions `from` and `to`. When\n// `blockSeparator` is given, it will be inserted whenever a new\n// block node is started. When `leafText` is given, it'll be\n// inserted for every non-text leaf node encountered.\nNode.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {\n  return this.content.textBetween(from, to, blockSeparator, leafText)\n};\n\n// :: ?Node\n// Returns this node's first child, or `null` if there are no\n// children.\nprototypeAccessors.firstChild.get = function () { return this.content.firstChild };\n\n// :: ?Node\n// Returns this node's last child, or `null` if there are no\n// children.\nprototypeAccessors.lastChild.get = function () { return this.content.lastChild };\n\n// :: (Node) → bool\n// Test whether two nodes represent the same piece of document.\nNode.prototype.eq = function eq (other) {\n  return this == other || (this.sameMarkup(other) && this.content.eq(other.content))\n};\n\n// :: (Node) → bool\n// Compare the markup (type, attributes, and marks) of this node to\n// those of another. Returns `true` if both have the same markup.\nNode.prototype.sameMarkup = function sameMarkup (other) {\n  return this.hasMarkup(other.type, other.attrs, other.marks)\n};\n\n// :: (NodeType, ?Object, ?[Mark]) → bool\n// Check whether this node's markup correspond to the given type,\n// attributes, and marks.\nNode.prototype.hasMarkup = function hasMarkup (type, attrs, marks) {\n  return this.type == type &&\n    compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&\n    Mark.sameSet(this.marks, marks || Mark.none)\n};\n\n// :: (?Fragment) → Node\n// Create a new node with the same markup as this node, containing\n// the given content (or empty, if no content is given).\nNode.prototype.copy = function copy (content) {\n    if ( content === void 0 ) content = null;\n\n  if (content == this.content) { return this }\n  return new this.constructor(this.type, this.attrs, content, this.marks)\n};\n\n// :: ([Mark]) → Node\n// Create a copy of this node, with the given set of marks instead\n// of the node's own marks.\nNode.prototype.mark = function mark (marks) {\n  return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)\n};\n\n// :: (number, ?number) → Node\n// Create a copy of this node with only the content between the\n// given positions. If `to` is not given, it defaults to the end of\n// the node.\nNode.prototype.cut = function cut (from, to) {\n  if (from == 0 && to == this.content.size) { return this }\n  return this.copy(this.content.cut(from, to))\n};\n\n// :: (number, ?number) → Slice\n// Cut out the part of the document between the given positions, and\n// return it as a `Slice` object.\nNode.prototype.slice = function slice (from, to, includeParents) {\n    if ( to === void 0 ) to = this.content.size;\n    if ( includeParents === void 0 ) includeParents = false;\n\n  if (from == to) { return Slice.empty }\n\n  var $from = this.resolve(from), $to = this.resolve(to);\n  var depth = includeParents ? 0 : $from.sharedDepth(to);\n  var start = $from.start(depth), node = $from.node(depth);\n  var content = node.content.cut($from.pos - start, $to.pos - start);\n  return new Slice(content, $from.depth - depth, $to.depth - depth)\n};\n\n// :: (number, number, Slice) → Node\n// Replace the part of the document between the given positions with\n// the given slice. The slice must 'fit', meaning its open sides\n// must be able to connect to the surrounding content, and its\n// content nodes must be valid children for the node they are placed\n// into. If any of this is violated, an error of type\n// [`ReplaceError`](#model.ReplaceError) is thrown.\nNode.prototype.replace = function replace$1 (from, to, slice) {\n  return replace(this.resolve(from), this.resolve(to), slice)\n};\n\n// :: (number) → ?Node\n// Find the node directly after the given position.\nNode.prototype.nodeAt = function nodeAt (pos) {\n  for (var node = this;;) {\n    var ref = node.content.findIndex(pos);\n      var index = ref.index;\n      var offset = ref.offset;\n    node = node.maybeChild(index);\n    if (!node) { return null }\n    if (offset == pos || node.isText) { return node }\n    pos -= offset + 1;\n  }\n};\n\n// :: (number) → {node: ?Node, index: number, offset: number}\n// Find the (direct) child node after the given offset, if any,\n// and return it along with its index and offset relative to this\n// node.\nNode.prototype.childAfter = function childAfter (pos) {\n  var ref = this.content.findIndex(pos);\n    var index = ref.index;\n    var offset = ref.offset;\n  return {node: this.content.maybeChild(index), index: index, offset: offset}\n};\n\n// :: (number) → {node: ?Node, index: number, offset: number}\n// Find the (direct) child node before the given offset, if any,\n// and return it along with its index and offset relative to this\n// node.\nNode.prototype.childBefore = function childBefore (pos) {\n  if (pos == 0) { return {node: null, index: 0, offset: 0} }\n  var ref = this.content.findIndex(pos);\n    var index = ref.index;\n    var offset = ref.offset;\n  if (offset < pos) { return {node: this.content.child(index), index: index, offset: offset} }\n  var node = this.content.child(index - 1);\n  return {node: node, index: index - 1, offset: offset - node.nodeSize}\n};\n\n// :: (number) → ResolvedPos\n// Resolve the given position in the document, returning an\n// [object](#model.ResolvedPos) with information about its context.\nNode.prototype.resolve = function resolve (pos) { return ResolvedPos.resolveCached(this, pos) };\n\nNode.prototype.resolveNoCache = function resolveNoCache (pos) { return ResolvedPos.resolve(this, pos) };\n\n// :: (number, number, MarkType) → bool\n// Test whether a mark of the given type occurs in this document\n// between the two given positions.\nNode.prototype.rangeHasMark = function rangeHasMark (from, to, type) {\n  var found = false;\n  if (to > from) { this.nodesBetween(from, to, function (node) {\n    if (type.isInSet(node.marks)) { found = true; }\n    return !found\n  }); }\n  return found\n};\n\n// :: bool\n// True when this is a block (non-inline node)\nprototypeAccessors.isBlock.get = function () { return this.type.isBlock };\n\n// :: bool\n// True when this is a textblock node, a block node with inline\n// content.\nprototypeAccessors.isTextblock.get = function () { return this.type.isTextblock };\n\n// :: bool\n// True when this node allows inline content.\nprototypeAccessors.inlineContent.get = function () { return this.type.inlineContent };\n\n// :: bool\n// True when this is an inline node (a text node or a node that can\n// appear among text).\nprototypeAccessors.isInline.get = function () { return this.type.isInline };\n\n// :: bool\n// True when this is a text node.\nprototypeAccessors.isText.get = function () { return this.type.isText };\n\n// :: bool\n// True when this is a leaf node.\nprototypeAccessors.isLeaf.get = function () { return this.type.isLeaf };\n\n// :: bool\n// True when this is an atom, i.e. when it does not have directly\n// editable content. This is usually the same as `isLeaf`, but can\n// be configured with the [`atom` property](#model.NodeSpec.atom) on\n// a node's spec (typically used when the node is displayed as an\n// uneditable [node view](#view.NodeView)).\nprototypeAccessors.isAtom.get = function () { return this.type.isAtom };\n\n// :: () → string\n// Return a string representation of this node for debugging\n// purposes.\nNode.prototype.toString = function toString () {\n  if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }\n  var name = this.type.name;\n  if (this.content.size)\n    { name += \"(\" + this.content.toStringInner() + \")\"; }\n  return wrapMarks(this.marks, name)\n};\n\n// :: (number) → ContentMatch\n// Get the content match in this node at the given index.\nNode.prototype.contentMatchAt = function contentMatchAt (index) {\n  var match = this.type.contentMatch.matchFragment(this.content, 0, index);\n  if (!match) { throw new Error(\"Called contentMatchAt on a node with invalid content\") }\n  return match\n};\n\n// :: (number, number, ?Fragment, ?number, ?number) → bool\n// Test whether replacing the range between `from` and `to` (by\n// child index) with the given replacement fragment (which defaults\n// to the empty fragment) would leave the node's content valid. You\n// can optionally pass `start` and `end` indices into the\n// replacement fragment.\nNode.prototype.canReplace = function canReplace (from, to, replacement, start, end) {\n    var this$1 = this;\n    if ( replacement === void 0 ) replacement = Fragment.empty;\n    if ( start === void 0 ) start = 0;\n    if ( end === void 0 ) end = replacement.childCount;\n\n  var one = this.contentMatchAt(from).matchFragment(replacement, start, end);\n  var two = one && one.matchFragment(this.content, to);\n  if (!two || !two.validEnd) { return false }\n  for (var i = start; i < end; i++) { if (!this$1.type.allowsMarks(replacement.child(i).marks)) { return false } }\n  return true\n};\n\n// :: (number, number, NodeType, ?[Mark]) → bool\n// Test whether replacing the range `from` to `to` (by index) with a\n// node of the given type would leave the node's content valid.\nNode.prototype.canReplaceWith = function canReplaceWith (from, to, type, marks) {\n  if (marks && !this.type.allowsMarks(marks)) { return false }\n  var start = this.contentMatchAt(from).matchType(type);\n  var end = start && start.matchFragment(this.content, to);\n  return end ? end.validEnd : false\n};\n\n// :: (Node) → bool\n// Test whether the given node's content could be appended to this\n// node. If that node is empty, this will only return true if there\n// is at least one node type that can appear in both nodes (to avoid\n// merging completely incompatible nodes).\nNode.prototype.canAppend = function canAppend (other) {\n  if (other.content.size) { return this.canReplace(this.childCount, this.childCount, other.content) }\n  else { return this.type.compatibleContent(other.type) }\n};\n\n// Unused. Left for backwards compatibility.\nNode.prototype.defaultContentType = function defaultContentType (at) {\n  return this.contentMatchAt(at).defaultType\n};\n\n// :: ()\n// Check whether this node and its descendants conform to the\n// schema, and raise error when they do not.\nNode.prototype.check = function check () {\n  if (!this.type.validContent(this.content))\n    { throw new RangeError((\"Invalid content for node \" + (this.type.name) + \": \" + (this.content.toString().slice(0, 50)))) }\n  this.content.forEach(function (node) { return node.check(); });\n};\n\n// :: () → Object\n// Return a JSON-serializeable representation of this node.\nNode.prototype.toJSON = function toJSON () {\n    var this$1 = this;\n\n  var obj = {type: this.type.name};\n  for (var _ in this$1.attrs) {\n    obj.attrs = this$1.attrs;\n    break\n  }\n  if (this.content.size)\n    { obj.content = this.content.toJSON(); }\n  if (this.marks.length)\n    { obj.marks = this.marks.map(function (n) { return n.toJSON(); }); }\n  return obj\n};\n\n// :: (Schema, Object) → Node\n// Deserialize a node from its JSON representation.\nNode.fromJSON = function fromJSON (schema, json) {\n  if (!json) { throw new RangeError(\"Invalid input for Node.fromJSON\") }\n  var marks = null;\n  if (json.marks) {\n    if (!Array.isArray(json.marks)) { throw new RangeError(\"Invalid mark data for Node.fromJSON\") }\n    marks = json.marks.map(schema.markFromJSON);\n  }\n  if (json.type == \"text\") {\n    if (typeof json.text != \"string\") { throw new RangeError(\"Invalid text node in JSON\") }\n    return schema.text(json.text, marks)\n  }\n  var content = Fragment.fromJSON(schema, json.content);\n  return schema.nodeType(json.type).create(json.attrs, content, marks)\n};\n\nObject.defineProperties( Node.prototype, prototypeAccessors );\n\nvar TextNode = (function (Node) {\n  function TextNode(type, attrs, content, marks) {\n    Node.call(this, type, attrs, null, marks);\n\n    if (!content) { throw new RangeError(\"Empty text nodes are not allowed\") }\n\n    this.text = content;\n  }\n\n  if ( Node ) TextNode.__proto__ = Node;\n  TextNode.prototype = Object.create( Node && Node.prototype );\n  TextNode.prototype.constructor = TextNode;\n\n  var prototypeAccessors$1 = { textContent: {},nodeSize: {} };\n\n  TextNode.prototype.toString = function toString () {\n    if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }\n    return wrapMarks(this.marks, JSON.stringify(this.text))\n  };\n\n  prototypeAccessors$1.textContent.get = function () { return this.text };\n\n  TextNode.prototype.textBetween = function textBetween (from, to) { return this.text.slice(from, to) };\n\n  prototypeAccessors$1.nodeSize.get = function () { return this.text.length };\n\n  TextNode.prototype.mark = function mark (marks) {\n    return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)\n  };\n\n  TextNode.prototype.withText = function withText (text) {\n    if (text == this.text) { return this }\n    return new TextNode(this.type, this.attrs, text, this.marks)\n  };\n\n  TextNode.prototype.cut = function cut (from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.text.length;\n\n    if (from == 0 && to == this.text.length) { return this }\n    return this.withText(this.text.slice(from, to))\n  };\n\n  TextNode.prototype.eq = function eq (other) {\n    return this.sameMarkup(other) && this.text == other.text\n  };\n\n  TextNode.prototype.toJSON = function toJSON () {\n    var base = Node.prototype.toJSON.call(this);\n    base.text = this.text;\n    return base\n  };\n\n  Object.defineProperties( TextNode.prototype, prototypeAccessors$1 );\n\n  return TextNode;\n}(Node));\n\nfunction wrapMarks(marks, str) {\n  for (var i = marks.length - 1; i >= 0; i--)\n    { str = marks[i].type.name + \"(\" + str + \")\"; }\n  return str\n}\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.\nvar ContentMatch = function ContentMatch(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\nvar prototypeAccessors$5 = { inlineContent: {},defaultType: {},edgeCount: {} };\n\nContentMatch.parse = function parse (string, nodeTypes) {\n  var stream = new TokenStream(string, nodeTypes);\n  if (stream.next == null) { return ContentMatch.empty }\n  var expr = parseExpr(stream);\n  if (stream.next) { stream.err(\"Unexpected trailing text\"); }\n  var 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.\nContentMatch.prototype.matchType = function matchType (type) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.next.length; i += 2)\n    { if (this$1.next[i] == type) { return this$1.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.\nContentMatch.prototype.matchFragment = function matchFragment (frag, start, end) {\n    if ( start === void 0 ) start = 0;\n    if ( end === void 0 ) end = frag.childCount;\n\n  var cur = this;\n  for (var i = start; cur && i < end; i++)\n    { cur = cur.matchType(frag.child(i).type); }\n  return cur\n};\n\nprototypeAccessors$5.inlineContent.get = function () {\n  var 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.\nprototypeAccessors$5.defaultType.get = function () {\n    var this$1 = this;\n\n  for (var i = 0; i < this.next.length; i += 2) {\n    var type = this$1.next[i];\n    if (!(type.isText || type.hasRequiredAttrs())) { return type }\n  }\n};\n\nContentMatch.prototype.compatible = function compatible (other) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.next.length; i += 2)\n    { for (var j = 0; j < other.next.length; j += 2)\n      { if (this$1.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.\nContentMatch.prototype.fillBefore = function fillBefore (after, toEnd, startIndex) {\n    if ( toEnd === void 0 ) toEnd = false;\n    if ( startIndex === void 0 ) startIndex = 0;\n\n  var seen = [this];\n  function search(match, types) {\n    var finished = match.matchFragment(after, startIndex);\n    if (finished && (!toEnd || finished.validEnd))\n      { return Fragment.from(types.map(function (tp) { return tp.createAndFill(); })) }\n\n    for (var i = 0; i < match.next.length; i += 2) {\n      var type = match.next[i], next = match.next[i + 1];\n      if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {\n        seen.push(next);\n        var 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.\nContentMatch.prototype.findWrapping = function findWrapping (target) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.wrapCache.length; i += 2)\n    { if (this$1.wrapCache[i] == target) { return this$1.wrapCache[i + 1] } }\n  var computed = this.computeWrapping(target);\n  this.wrapCache.push(target, computed);\n  return computed\n};\n\nContentMatch.prototype.computeWrapping = function computeWrapping (target) {\n  var seen = Object.create(null), active = [{match: this, type: null, via: null}];\n  while (active.length) {\n    var current = active.shift(), match = current.match;\n    if (match.matchType(target)) {\n      var result = [];\n      for (var obj = current; obj.type; obj = obj.via)\n        { result.push(obj.type); }\n      return result.reverse()\n    }\n    for (var i = 0; i < match.next.length; i += 2) {\n      var 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: 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.\nprototypeAccessors$5.edgeCount.get = function () {\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.\nContentMatch.prototype.edge = function edge (n) {\n  var 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\nContentMatch.prototype.toString = function toString () {\n  var seen = [];\n  function scan(m) {\n    seen.push(m);\n    for (var 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(function (m, i) {\n    var out = i + (m.validEnd ? \"*\" : \" \") + \" \";\n    for (var i$1 = 0; i$1 < m.next.length; i$1 += 2)\n      { out += (i$1 ? \", \" : \"\") + m.next[i$1].name + \"->\" + seen.indexOf(m.next[i$1 + 1]); }\n    return out\n  }).join(\"\\n\")\n};\n\nObject.defineProperties( ContentMatch.prototype, prototypeAccessors$5 );\n\nContentMatch.empty = new ContentMatch(true);\n\nvar TokenStream = function TokenStream(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\nvar prototypeAccessors$1$3 = { next: {} };\n\nprototypeAccessors$1$3.next.get = function () { return this.tokens[this.pos] };\n\nTokenStream.prototype.eat = function eat (tok) { return this.next == tok && (this.pos++ || true) };\n\nTokenStream.prototype.err = function err (str) { throw new SyntaxError(str + \" (in content expression '\" + this.string + \"')\") };\n\nObject.defineProperties( TokenStream.prototype, prototypeAccessors$1$3 );\n\nfunction parseExpr(stream) {\n  var exprs = [];\n  do { exprs.push(parseExprSeq(stream)); }\n  while (stream.eat(\"|\"))\n  return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs: exprs}\n}\n\nfunction parseExprSeq(stream) {\n  var 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: exprs}\n}\n\nfunction parseExprSubscript(stream) {\n  var expr = parseExprAtom(stream);\n  for (;;) {\n    if (stream.eat(\"+\"))\n      { expr = {type: \"plus\", expr: expr}; }\n    else if (stream.eat(\"*\"))\n      { expr = {type: \"star\", expr: expr}; }\n    else if (stream.eat(\"?\"))\n      { expr = {type: \"opt\", expr: 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  var result = Number(stream.next);\n  stream.pos++;\n  return result\n}\n\nfunction parseExprRange(stream, expr) {\n  var 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: min, max: max, expr: expr}\n}\n\nfunction resolveName(stream, name) {\n  var types = stream.nodeTypes, type = types[name];\n  if (type) { return [type] }\n  var result = [];\n  for (var typeName in types) {\n    var type$1 = types[typeName];\n    if (type$1.groups.indexOf(name) > -1) { result.push(type$1); }\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    var expr = parseExpr(stream);\n    if (!stream.eat(\")\")) { stream.err(\"Missing closing paren\"); }\n    return expr\n  } else if (!/\\W/.test(stream.next)) {\n    var exprs = resolveName(stream, stream.next).map(function (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: 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  var 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    var edge = {term: term, to: to};\n    nfa[from].push(edge);\n    return edge\n  }\n  function connect(edges, to) { edges.forEach(function (edge) { return edge.to = to; }); }\n\n  function compile(expr, from) {\n    if (expr.type == \"choice\") {\n      return expr.exprs.reduce(function (out, expr) { return out.concat(compile(expr, from)); }, [])\n    } else if (expr.type == \"seq\") {\n      for (var i = 0;; i++) {\n        var 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      var loop = node();\n      edge(from, loop);\n      connect(compile(expr.expr, loop), loop);\n      return [edge(loop)]\n    } else if (expr.type == \"plus\") {\n      var loop$1 = node();\n      connect(compile(expr.expr, from), loop$1);\n      connect(compile(expr.expr, loop$1), loop$1);\n      return [edge(loop$1)]\n    } else if (expr.type == \"opt\") {\n      return [edge(from)].concat(compile(expr.expr, from))\n    } else if (expr.type == \"range\") {\n      var cur = from;\n      for (var i$1 = 0; i$1 < expr.min; i$1++) {\n        var next$1 = node();\n        connect(compile(expr.expr, cur), next$1);\n        cur = next$1;\n      }\n      if (expr.max == -1) {\n        connect(compile(expr.expr, cur), cur);\n      } else {\n        for (var i$2 = expr.min; i$2 < expr.max; i$2++) {\n          var next$2 = node();\n          edge(cur, next$2);\n          connect(compile(expr.expr, cur), next$2);\n          cur = next$2;\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  var result = [];\n  scan(node);\n  return result.sort(cmp)\n\n  function scan(node) {\n    var edges = nfa[node];\n    if (edges.length == 1 && !edges[0].term) { return scan(edges[0].to) }\n    result.push(node);\n    for (var i = 0; i < edges.length; i++) {\n      var ref = edges[i];\n      var term = ref.term;\n      var to = ref.to;\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  var labeled = Object.create(null);\n  return explore(nullFrom(nfa, 0))\n\n  function explore(states) {\n    var out = [];\n    states.forEach(function (node) {\n      nfa[node].forEach(function (ref) {\n        var term = ref.term;\n        var to = ref.to;\n\n        if (!term) { return }\n        var known = out.indexOf(term), set = known > -1 && out[known + 1];\n        nullFrom(nfa, to).forEach(function (node) {\n          if (!set) { out.push(term, set = []); }\n          if (set.indexOf(node) == -1) { set.push(node); }\n        });\n      });\n    });\n    var state = labeled[states.join(\",\")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);\n    for (var i = 0; i < out.length; i += 2) {\n      var states$1 = out[i + 1].sort(cmp);\n      state.next.push(out[i], labeled[states$1.join(\",\")] || explore(states$1));\n    }\n    return state\n  }\n}\n\nfunction checkForDeadEnds(match, stream) {\n  for (var i = 0, work = [match]; i < work.length; i++) {\n    var state = work[i], dead = !state.validEnd, nodes = [];\n    for (var j = 0; j < state.next.length; j += 2) {\n      var 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\"); }\n  }\n}\n\n// For node types where all attrs have a default value (or which don't\n// have any attributes), build up a single reusable default attribute\n// object, and use it for all nodes that don't specify specific\n// attributes.\nfunction defaultAttrs(attrs) {\n  var defaults = Object.create(null);\n  for (var attrName in attrs) {\n    var attr = attrs[attrName];\n    if (!attr.hasDefault) { return null }\n    defaults[attrName] = attr.default;\n  }\n  return defaults\n}\n\nfunction computeAttrs(attrs, value) {\n  var built = Object.create(null);\n  for (var name in attrs) {\n    var given = value && value[name];\n    if (given === undefined) {\n      var attr = attrs[name];\n      if (attr.hasDefault) { given = attr.default; }\n      else { throw new RangeError(\"No value supplied for attribute \" + name) }\n    }\n    built[name] = given;\n  }\n  return built\n}\n\nfunction initAttrs(attrs) {\n  var result = Object.create(null);\n  if (attrs) { for (var name in attrs) { result[name] = new Attribute(attrs[name]); } }\n  return result\n}\n\n// ::- Node types are objects allocated once per `Schema` and used to\n// [tag](#model.Node.type) `Node` instances. They contain information\n// about the node type, such as its name and what kind of node it\n// represents.\nvar NodeType = function NodeType(name, schema, spec) {\n  // :: string\n  // The name the node type has in this schema.\n  this.name = name;\n\n  // :: Schema\n  // A link back to the `Schema` the node type belongs to.\n  this.schema = schema;\n\n  // :: NodeSpec\n  // The spec that this type is based on\n  this.spec = spec;\n\n  this.groups = spec.group ? spec.group.split(\" \") : [];\n  this.attrs = initAttrs(spec.attrs);\n\n  this.defaultAttrs = defaultAttrs(this.attrs);\n\n  // :: ContentMatch\n  // The starting match of the node type's content expression.\n  this.contentMatch = null;\n\n  // : ?[MarkType]\n  // The set of marks allowed in this node. `null` means all marks\n  // are allowed.\n  this.markSet = null;\n\n  // :: bool\n  // True if this node type has inline content.\n  this.inlineContent = null;\n\n  // :: bool\n  // True if this is a block type\n  this.isBlock = !(spec.inline || name == \"text\");\n\n  // :: bool\n  // True if this is the text node type.\n  this.isText = name == \"text\";\n};\n\nvar prototypeAccessors$4 = { isInline: {},isTextblock: {},isLeaf: {},isAtom: {} };\n\n// :: bool\n// True if this is an inline type.\nprototypeAccessors$4.isInline.get = function () { return !this.isBlock };\n\n// :: bool\n// True if this is a textblock type, a block that contains inline\n// content.\nprototypeAccessors$4.isTextblock.get = function () { return this.isBlock && this.inlineContent };\n\n// :: bool\n// True for node types that allow no content.\nprototypeAccessors$4.isLeaf.get = function () { return this.contentMatch == ContentMatch.empty };\n\n// :: bool\n// True when this node is an atom, i.e. when it does not have\n// directly editable content.\nprototypeAccessors$4.isAtom.get = function () { return this.isLeaf || this.spec.atom };\n\nNodeType.prototype.hasRequiredAttrs = function hasRequiredAttrs (ignore) {\n    var this$1 = this;\n\n  for (var n in this$1.attrs)\n    { if (this$1.attrs[n].isRequired && (!ignore || !(n in ignore))) { return true } }\n  return false\n};\n\nNodeType.prototype.compatibleContent = function compatibleContent (other) {\n  return this == other || this.contentMatch.compatible(other.contentMatch)\n};\n\nNodeType.prototype.computeAttrs = function computeAttrs$1 (attrs) {\n  if (!attrs && this.defaultAttrs) { return this.defaultAttrs }\n  else { return computeAttrs(this.attrs, attrs) }\n};\n\n// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n// Create a `Node` of this type. The given attributes are\n// checked and defaulted (you can pass `null` to use the type's\n// defaults entirely, if no required attributes exist). `content`\n// may be a `Fragment`, a node, an array of nodes, or\n// `null`. Similarly `marks` may be `null` to default to the empty\n// set of marks.\nNodeType.prototype.create = function create (attrs, content, marks) {\n  if (this.isText) { throw new Error(\"NodeType.create can't construct text nodes\") }\n  return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))\n};\n\n// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n// Like [`create`](#model.NodeType.create), but check the given content\n// against the node type's content restrictions, and throw an error\n// if it doesn't match.\nNodeType.prototype.createChecked = function createChecked (attrs, content, marks) {\n  content = Fragment.from(content);\n  if (!this.validContent(content))\n    { throw new RangeError(\"Invalid content for node \" + this.name) }\n  return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))\n};\n\n// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → ?Node\n// Like [`create`](#model.NodeType.create), but see if it is necessary to\n// add nodes to the start or end of the given fragment to make it\n// fit the node. If no fitting wrapping can be found, return null.\n// Note that, due to the fact that required nodes can always be\n// created, this will always succeed if you pass null or\n// `Fragment.empty` as content.\nNodeType.prototype.createAndFill = function createAndFill (attrs, content, marks) {\n  attrs = this.computeAttrs(attrs);\n  content = Fragment.from(content);\n  if (content.size) {\n    var before = this.contentMatch.fillBefore(content);\n    if (!before) { return null }\n    content = before.append(content);\n  }\n  var after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true);\n  if (!after) { return null }\n  return new Node(this, attrs, content.append(after), Mark.setFrom(marks))\n};\n\n// :: (Fragment) → bool\n// Returns true if the given fragment is valid content for this node\n// type with the given attributes.\nNodeType.prototype.validContent = function validContent (content) {\n    var this$1 = this;\n\n  var result = this.contentMatch.matchFragment(content);\n  if (!result || !result.validEnd) { return false }\n  for (var i = 0; i < content.childCount; i++)\n    { if (!this$1.allowsMarks(content.child(i).marks)) { return false } }\n  return true\n};\n\n// :: (MarkType) → bool\n// Check whether the given mark type is allowed in this node.\nNodeType.prototype.allowsMarkType = function allowsMarkType (markType) {\n  return this.markSet == null || this.markSet.indexOf(markType) > -1\n};\n\n// :: ([Mark]) → bool\n// Test whether the given set of marks are allowed in this node.\nNodeType.prototype.allowsMarks = function allowsMarks (marks) {\n    var this$1 = this;\n\n  if (this.markSet == null) { return true }\n  for (var i = 0; i < marks.length; i++) { if (!this$1.allowsMarkType(marks[i].type)) { return false } }\n  return true\n};\n\n// :: ([Mark]) → [Mark]\n// Removes the marks that are not allowed in this node from the given set.\nNodeType.prototype.allowedMarks = function allowedMarks (marks) {\n    var this$1 = this;\n\n  if (this.markSet == null) { return marks }\n  var copy;\n  for (var i = 0; i < marks.length; i++) {\n    if (!this$1.allowsMarkType(marks[i].type)) {\n      if (!copy) { copy = marks.slice(0, i); }\n    } else if (copy) {\n      copy.push(marks[i]);\n    }\n  }\n  return !copy ? marks : copy.length ? copy : Mark.empty\n};\n\nNodeType.compile = function compile (nodes, schema) {\n  var result = Object.create(null);\n  nodes.forEach(function (name, spec) { return result[name] = new NodeType(name, schema, spec); });\n\n  var topType = schema.spec.topNode || \"doc\";\n  if (!result[topType]) { throw new RangeError(\"Schema is missing its top node type ('\" + topType + \"')\") }\n  if (!result.text) { throw new RangeError(\"Every schema needs a 'text' type\") }\n  for (var _ in result.text.attrs) { throw new RangeError(\"The text node type should not have attributes\") }\n\n  return result\n};\n\nObject.defineProperties( NodeType.prototype, prototypeAccessors$4 );\n\n// Attribute descriptors\n\nvar Attribute = function Attribute(options) {\n  this.hasDefault = Object.prototype.hasOwnProperty.call(options, \"default\");\n  this.default = options.default;\n};\n\nvar prototypeAccessors$1$2 = { isRequired: {} };\n\nprototypeAccessors$1$2.isRequired.get = function () {\n  return !this.hasDefault\n};\n\nObject.defineProperties( Attribute.prototype, prototypeAccessors$1$2 );\n\n// Marks\n\n// ::- Like nodes, marks (which are associated with nodes to signify\n// things like emphasis or being part of a link) are\n// [tagged](#model.Mark.type) with type objects, which are\n// instantiated once per `Schema`.\nvar MarkType = function MarkType(name, rank, schema, spec) {\n  // :: string\n  // The name of the mark type.\n  this.name = name;\n\n  // :: Schema\n  // The schema that this mark type instance is part of.\n  this.schema = schema;\n\n  // :: MarkSpec\n  // The spec on which the type is based.\n  this.spec = spec;\n\n  this.attrs = initAttrs(spec.attrs);\n\n  this.rank = rank;\n  this.excluded = null;\n  var defaults = defaultAttrs(this.attrs);\n  this.instance = defaults && new Mark(this, defaults);\n};\n\n// :: (?Object) → Mark\n// Create a mark of this type. `attrs` may be `null` or an object\n// containing only some of the mark's attributes. The others, if\n// they have defaults, will be added.\nMarkType.prototype.create = function create (attrs) {\n  if (!attrs && this.instance) { return this.instance }\n  return new Mark(this, computeAttrs(this.attrs, attrs))\n};\n\nMarkType.compile = function compile (marks, schema) {\n  var result = Object.create(null), rank = 0;\n  marks.forEach(function (name, spec) { return result[name] = new MarkType(name, rank++, schema, spec); });\n  return result\n};\n\n// :: ([Mark]) → [Mark]\n// When there is a mark of this type in the given set, a new set\n// without it is returned. Otherwise, the input set is returned.\nMarkType.prototype.removeFromSet = function removeFromSet (set) {\n    var this$1 = this;\n\n  for (var i = 0; i < set.length; i++)\n    { if (set[i].type == this$1)\n      { return set.slice(0, i).concat(set.slice(i + 1)) } }\n  return set\n};\n\n// :: ([Mark]) → ?Mark\n// Tests whether there is a mark of this type in the given set.\nMarkType.prototype.isInSet = function isInSet (set) {\n    var this$1 = this;\n\n  for (var i = 0; i < set.length; i++)\n    { if (set[i].type == this$1) { return set[i] } }\n};\n\n// :: (MarkType) → bool\n// Queries whether a given mark type is\n// [excluded](#model.MarkSpec.excludes) by this one.\nMarkType.prototype.excludes = function excludes (other) {\n  return this.excluded.indexOf(other) > -1\n};\n\n// SchemaSpec:: interface\n// An object describing a schema, as passed to the [`Schema`](#model.Schema)\n// constructor.\n//\n//   nodes:: union<Object<NodeSpec>, OrderedMap<NodeSpec>>\n//   The node types in this schema. Maps names to\n//   [`NodeSpec`](#model.NodeSpec) objects that describe the node type\n//   associated with that name. Their order is significant—it\n//   determines which [parse rules](#model.NodeSpec.parseDOM) take\n//   precedence by default, and which nodes come first in a given\n//   [group](#model.NodeSpec.group).\n//\n//   marks:: ?union<Object<MarkSpec>, OrderedMap<MarkSpec>>\n//   The mark types that exist in this schema. The order in which they\n//   are provided determines the order in which [mark\n//   sets](#model.Mark.addToSet) are sorted and in which [parse\n//   rules](#model.MarkSpec.parseDOM) are tried.\n//\n//   topNode:: ?string\n//   The name of the default top-level node for the schema. Defaults\n//   to `\"doc\"`.\n\n// NodeSpec:: interface\n//\n//   content:: ?string\n//   The content expression for this node, as described in the [schema\n//   guide](/docs/guide/#schema.content_expressions). When not given,\n//   the node does not allow any content.\n//\n//   marks:: ?string\n//   The marks that are allowed inside of this node. May be a\n//   space-separated string referring to mark names or groups, `\"_\"`\n//   to explicitly allow all marks, or `\"\"` to disallow marks. When\n//   not given, nodes with inline content default to allowing all\n//   marks, other nodes default to not allowing marks.\n//\n//   group:: ?string\n//   The group or space-separated groups to which this node belongs,\n//   which can be referred to in the content expressions for the\n//   schema.\n//\n//   inline:: ?bool\n//   Should be set to true for inline nodes. (Implied for text nodes.)\n//\n//   atom:: ?bool\n//   Can be set to true to indicate that, though this isn't a [leaf\n//   node](#model.NodeType.isLeaf), it doesn't have directly editable\n//   content and should be treated as a single unit in the view.\n//\n//   attrs:: ?Object<AttributeSpec>\n//   The attributes that nodes of this type get.\n//\n//   selectable:: ?bool\n//   Controls whether nodes of this type can be selected as a [node\n//   selection](#state.NodeSelection). Defaults to true for non-text\n//   nodes.\n//\n//   draggable:: ?bool\n//   Determines whether nodes of this type can be dragged without\n//   being selected. Defaults to false.\n//\n//   code:: ?bool\n//   Can be used to indicate that this node contains code, which\n//   causes some commands to behave differently.\n//\n//   defining:: ?bool\n//   Determines whether this node is considered an important parent\n//   node during replace operations (such as paste). Non-defining (the\n//   default) nodes get dropped when their entire content is replaced,\n//   whereas defining nodes persist and wrap the inserted content.\n//   Likewise, in _inserted_ content the defining parents of the\n//   content are preserved when possible. Typically,\n//   non-default-paragraph textblock types, and possibly list items,\n//   are marked as defining.\n//\n//   isolating:: ?bool\n//   When enabled (default is false), the sides of nodes of this type\n//   count as boundaries that regular editing operations, like\n//   backspacing or lifting, won't cross. An example of a node that\n//   should probably have this enabled is a table cell.\n//\n//   toDOM:: ?(node: Node) → DOMOutputSpec\n//   Defines the default way a node of this type should be serialized\n//   to DOM/HTML (as used by\n//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).\n//   Should return a DOM node or an [array\n//   structure](#model.DOMOutputSpec) that describes one, with an\n//   optional number zero (“hole”) in it to indicate where the node's\n//   content should be inserted.\n//\n//   For text nodes, the default is to create a text DOM node. Though\n//   it is possible to create a serializer where text is rendered\n//   differently, this is not supported inside the editor, so you\n//   shouldn't override that in your text node spec.\n//\n//   parseDOM:: ?[ParseRule]\n//   Associates DOM parser information with this node, which can be\n//   used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to\n//   automatically derive a parser. The `node` field in the rules is\n//   implied (the name of this node will be filled in automatically).\n//   If you supply your own parser, you do not need to also specify\n//   parsing rules in your schema.\n//\n//   toDebugString:: ?(node: Node) -> string\n//   Defines the default way a node of this type should be serialized\n//   to a string representation for debugging (e.g. in error messages).\n\n// MarkSpec:: interface\n//\n//   attrs:: ?Object<AttributeSpec>\n//   The attributes that marks of this type get.\n//\n//   inclusive:: ?bool\n//   Whether this mark should be active when the cursor is positioned\n//   at its end (or at its start when that is also the start of the\n//   parent node). Defaults to true.\n//\n//   excludes:: ?string\n//   Determines which other marks this mark can coexist with. Should\n//   be a space-separated strings naming other marks or groups of marks.\n//   When a mark is [added](#model.Mark.addToSet) to a set, all marks\n//   that it excludes are removed in the process. If the set contains\n//   any mark that excludes the new mark but is not, itself, excluded\n//   by the new mark, the mark can not be added an the set. You can\n//   use the value `\"_\"` to indicate that the mark excludes all\n//   marks in the schema.\n//\n//   Defaults to only being exclusive with marks of the same type. You\n//   can set it to an empty string (or any string not containing the\n//   mark's own name) to allow multiple marks of a given type to\n//   coexist (as long as they have different attributes).\n//\n//   group:: ?string\n//   The group or space-separated groups to which this mark belongs.\n//\n//   spanning:: ?bool\n//   Determines whether marks of this type can span multiple adjacent\n//   nodes when serialized to DOM/HTML. Defaults to true.\n//\n//   toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec\n//   Defines the default way marks of this type should be serialized\n//   to DOM/HTML. When the resulting spec contains a hole, that is\n//   where the marked content is placed. Otherwise, it is appended to\n//   the top node.\n//\n//   parseDOM:: ?[ParseRule]\n//   Associates DOM parser information with this mark (see the\n//   corresponding [node spec field](#model.NodeSpec.parseDOM)). The\n//   `mark` field in the rules is implied.\n\n// AttributeSpec:: interface\n//\n// Used to [define](#model.NodeSpec.attrs) attributes on nodes or\n// marks.\n//\n//   default:: ?any\n//   The default value for this attribute, to use when no explicit\n//   value is provided. Attributes that have no default must be\n//   provided whenever a node or mark of a type that has them is\n//   created.\n\n// ::- A document schema. Holds [node](#model.NodeType) and [mark\n// type](#model.MarkType) objects for the nodes and marks that may\n// occur in conforming documents, and provides functionality for\n// creating and deserializing such documents.\nvar Schema = function Schema(spec) {\n  var this$1 = this;\n\n  // :: SchemaSpec\n  // The [spec](#model.SchemaSpec) on which the schema is based,\n  // with the added guarantee that its `nodes` and `marks`\n  // properties are\n  // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances\n  // (not raw objects).\n  this.spec = {};\n  for (var prop in spec) { this$1.spec[prop] = spec[prop]; }\n  this.spec.nodes = OrderedMap.from(spec.nodes);\n  this.spec.marks = OrderedMap.from(spec.marks);\n\n  // :: Object<NodeType>\n  // An object mapping the schema's node names to node type objects.\n  this.nodes = NodeType.compile(this.spec.nodes, this);\n\n  // :: Object<MarkType>\n  // A map from mark names to mark type objects.\n  this.marks = MarkType.compile(this.spec.marks, this);\n\n  var contentExprCache = Object.create(null);\n  for (var prop$1 in this$1.nodes) {\n    if (prop$1 in this$1.marks)\n      { throw new RangeError(prop$1 + \" can not be both a node and a mark\") }\n    var type = this$1.nodes[prop$1], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n    type.contentMatch = contentExprCache[contentExpr] ||\n      (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this$1.nodes));\n    type.inlineContent = type.contentMatch.inlineContent;\n    type.markSet = markExpr == \"_\" ? null :\n      markExpr ? gatherMarks(this$1, markExpr.split(\" \")) :\n      markExpr == \"\" || !type.inlineContent ? [] : null;\n  }\n  for (var prop$2 in this$1.marks) {\n    var type$1 = this$1.marks[prop$2], excl = type$1.spec.excludes;\n    type$1.excluded = excl == null ? [type$1] : excl == \"\" ? [] : gatherMarks(this$1, excl.split(\" \"));\n  }\n\n  this.nodeFromJSON = this.nodeFromJSON.bind(this);\n  this.markFromJSON = this.markFromJSON.bind(this);\n\n  // :: NodeType\n  // The type of the [default top node](#model.SchemaSpec.topNode)\n  // for this schema.\n  this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n\n  // :: Object\n  // An object for storing whatever values modules may want to\n  // compute and cache per schema. (If you want to store something\n  // in it, try to use property names unlikely to clash.)\n  this.cached = Object.create(null);\n  this.cached.wrappings = Object.create(null);\n};\n\n// :: (union<string, NodeType>, ?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n// Create a node in this schema. The `type` may be a string or a\n// `NodeType` instance. Attributes will be extended\n// with defaults, `content` may be a `Fragment`,\n// `null`, a `Node`, or an array of nodes.\nSchema.prototype.node = function node (type, attrs, content, marks) {\n  if (typeof type == \"string\")\n    { type = this.nodeType(type); }\n  else if (!(type instanceof NodeType))\n    { throw new RangeError(\"Invalid node type: \" + type) }\n  else if (type.schema != this)\n    { throw new RangeError(\"Node type from different schema used (\" + type.name + \")\") }\n\n  return type.createChecked(attrs, content, marks)\n};\n\n// :: (string, ?[Mark]) → Node\n// Create a text node in the schema. Empty text nodes are not\n// allowed.\nSchema.prototype.text = function text (text$1, marks) {\n  var type = this.nodes.text;\n  return new TextNode(type, type.defaultAttrs, text$1, Mark.setFrom(marks))\n};\n\n// :: (union<string, MarkType>, ?Object) → Mark\n// Create a mark with the given type and attributes.\nSchema.prototype.mark = function mark (type, attrs) {\n  if (typeof type == \"string\") { type = this.marks[type]; }\n  return type.create(attrs)\n};\n\n// :: (Object) → Node\n// Deserialize a node from its JSON representation. This method is\n// bound.\nSchema.prototype.nodeFromJSON = function nodeFromJSON (json) {\n  return Node.fromJSON(this, json)\n};\n\n// :: (Object) → Mark\n// Deserialize a mark from its JSON representation. This method is\n// bound.\nSchema.prototype.markFromJSON = function markFromJSON (json) {\n  return Mark.fromJSON(this, json)\n};\n\nSchema.prototype.nodeType = function nodeType (name) {\n  var found = this.nodes[name];\n  if (!found) { throw new RangeError(\"Unknown node type: \" + name) }\n  return found\n};\n\nfunction gatherMarks(schema, marks) {\n  var found = [];\n  for (var i = 0; i < marks.length; i++) {\n    var name = marks[i], mark = schema.marks[name], ok = mark;\n    if (mark) {\n      found.push(mark);\n    } else {\n      for (var prop in schema.marks) {\n        var mark$1 = schema.marks[prop];\n        if (name == \"_\" || (mark$1.spec.group && mark$1.spec.group.split(\" \").indexOf(name) > -1))\n          { found.push(ok = mark$1); }\n      }\n    }\n    if (!ok) { throw new SyntaxError(\"Unknown mark type: '\" + marks[i] + \"'\") }\n  }\n  return found\n}\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//   propery'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//   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).\nvar DOMParser = function DOMParser(schema, rules) {\n  var this$1 = this;\n\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(function (rule) {\n    if (rule.tag) { this$1.tags.push(rule); }\n    else if (rule.style) { this$1.styles.push(rule); }\n  });\n};\n\n// :: (dom.Node, ?ParseOptions) → Node\n// Parse a document from the content of a DOM node.\nDOMParser.prototype.parse = function parse (dom, options) {\n    if ( options === void 0 ) options = {};\n\n  var 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.\nDOMParser.prototype.parseSlice = function parseSlice (dom, options) {\n    if ( options === void 0 ) options = {};\n\n  var context = new ParseContext(this, options, true);\n  context.addAll(dom, null, options.from, options.to);\n  return Slice.maxOpen(context.finish())\n};\n\nDOMParser.prototype.matchTag = function matchTag (dom, context) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.tags.length; i++) {\n    var rule = this$1.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        var result = rule.getAttrs(dom);\n        if (result === false) { continue }\n        rule.attrs = result;\n      }\n      return rule\n    }\n  }\n};\n\nDOMParser.prototype.matchStyle = function matchStyle (prop, value, context) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.styles.length; i++) {\n    var rule = this$1.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      var result = rule.getAttrs(value);\n      if (result === false) { continue }\n      rule.attrs = result;\n    }\n    return rule\n  }\n};\n\n// : (Schema) → [ParseRule]\nDOMParser.schemaRules = function schemaRules (schema) {\n  var result = [];\n  function insert(rule) {\n    var priority = rule.priority == null ? 50 : rule.priority, i = 0;\n    for (; i < result.length; i++) {\n      var 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  var loop = function ( name ) {\n    var rules = schema.marks[name].spec.parseDOM;\n    if (rules) { rules.forEach(function (rule) {\n      insert(rule = copy(rule));\n      rule.mark = name;\n    }); }\n  };\n\n    for (var name in schema.marks) loop( name );\n  var loop$1 = function ( name ) {\n    var rules$1 = schema.nodes[name$1].spec.parseDOM;\n    if (rules$1) { rules$1.forEach(function (rule) {\n      insert(rule = copy(rule));\n      rule.node = name$1;\n    }); }\n  };\n\n    for (var name$1 in schema.nodes) loop$1( name );\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).\nDOMParser.fromSchema = function fromSchema (schema) {\n  return schema.cached.domParser ||\n    (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))\n};\n\n// : Object<bool> The block-level tags in HTML5\nvar 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.\nvar ignoreTags = {\n  head: true, noscript: true, object: true, script: true, style: true, title: true\n};\n\n// : Object<bool> List tags.\nvar listTags = {ol: true, ul: true};\n\n// Using a bitfield for node context options\nvar OPT_PRESERVE_WS = 1;\nvar OPT_PRESERVE_WS_FULL = 2;\nvar OPT_OPEN_LEFT = 4;\n\nfunction wsOptionsFor(preserveWhitespace) {\n  return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === \"full\" ? OPT_PRESERVE_WS_FULL : 0)\n}\n\nvar NodeContext = function NodeContext(type, attrs, marks, 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  this.marks = marks;\n  this.activeMarks = Mark.none;\n};\n\nNodeContext.prototype.findWrapping = function findWrapping (node) {\n  if (!this.match) {\n    if (!this.type) { return [] }\n    var fill = this.type.contentMatch.fillBefore(Fragment.from(node));\n    if (fill) {\n      this.match = this.type.contentMatch.matchFragment(fill);\n    } else {\n      var 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\nNodeContext.prototype.finish = function finish (openEnd) {\n  if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace\n    var 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  var 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\nvar ParseContext = function ParseContext(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  this.pendingMarks = [];\n  var topNode = options.topNode, topContext;\n  var topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0);\n  if (topNode)\n    { topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, true,\n                                 options.topMatch || topNode.type.contentMatch, topOptions); }\n  else if (open)\n    { topContext = new NodeContext(null, null, Mark.none, true, null, topOptions); }\n  else\n    { topContext = new NodeContext(parser.schema.topNodeType, null, 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\nvar prototypeAccessors$6 = { top: {},currentPos: {} };\n\nprototypeAccessors$6.top.get = function () {\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`.\nParseContext.prototype.addDOM = function addDOM (dom) {\n    var this$1 = this;\n\n  if (dom.nodeType == 3) {\n    this.addTextNode(dom);\n  } else if (dom.nodeType == 1) {\n    var style = dom.getAttribute(\"style\");\n    var marks = style ? this.readStyles(parseStyles(style)) : null;\n    if (marks != null) { for (var i = 0; i < marks.length; i++) { this$1.addPendingMark(marks[i]); } }\n    this.addElement(dom);\n    if (marks != null) { for (var i$1 = 0; i$1 < marks.length; i$1++) { this$1.removePendingMark(marks[i$1]); } }\n  }\n};\n\nParseContext.prototype.addTextNode = function addTextNode (dom) {\n  var value = dom.nodeValue;\n  var 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        var nodeBefore = top.content[top.content.length - 1];\n        var 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.\nParseContext.prototype.addElement = function addElement (dom) {\n  var name = dom.nodeName.toLowerCase();\n  if (listTags.hasOwnProperty(name)) { normalizeList(dom); }\n  var 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) {\n    if (rule && rule.skip.nodeType) { dom = rule.skip; }\n    var 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\nParseContext.prototype.leafFallback = function 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.\nParseContext.prototype.readStyles = function readStyles (styles) {\n    var this$1 = this;\n\n  var marks = Mark.none;\n  for (var i = 0; i < styles.length; i += 2) {\n    var rule = this$1.parser.matchStyle(styles[i], styles[i + 1], this$1);\n    if (!rule) { continue }\n    if (rule.ignore) { return null }\n    marks = this$1.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.\nParseContext.prototype.addElementByRule = function addElementByRule (dom, rule) {\n    var this$1 = this;\n\n  var 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  var 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(function (node) { return this$1.insertNode(node); });\n  } else {\n    var 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); }\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.\nParseContext.prototype.addAll = function addAll (parent, sync, startIndex, endIndex) {\n    var this$1 = this;\n\n  var index = startIndex || 0;\n  for (var dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,\n           end = endIndex == null ? null : parent.childNodes[endIndex];\n       dom != end; dom = dom.nextSibling, ++index) {\n    this$1.findAtPoint(parent, index);\n    this$1.addDOM(dom);\n    if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))\n      { this$1.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.\nParseContext.prototype.findPlace = function findPlace (node) {\n    var this$1 = this;\n\n  var route, sync;\n  for (var depth = this.open; depth >= 0; depth--) {\n    var cx = this$1.nodes[depth];\n    var 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 (var i = 0; i < route.length; i++)\n    { this$1.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.\nParseContext.prototype.insertNode = function insertNode (node) {\n  if (node.isInline && this.needsBlock && !this.top.type) {\n    var block = this.textblockFromContext();\n    if (block) { this.enterInner(block); }\n  }\n  if (this.findPlace(node)) {\n    this.closeExtra();\n    var top = this.top;\n    this.applyPendingMarks(top);\n    if (top.match) { top.match = top.match.matchType(node.type); }\n    var marks = top.activeMarks;\n    for (var 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\nParseContext.prototype.applyPendingMarks = function applyPendingMarks (top) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.pendingMarks.length; i++) {\n    var mark = this$1.pendingMarks[i];\n    if ((!top.type || top.type.allowsMarkType(mark.type)) && !mark.isInSet(top.activeMarks)) {\n      top.activeMarks = mark.addToSet(top.activeMarks);\n      this$1.pendingMarks.splice(i--, 1);\n    }\n  }\n};\n\n// : (NodeType, ?Object) → bool\n// Try to start a node of the given type, adjusting the context when\n// necessary.\nParseContext.prototype.enter = function enter (type, attrs, preserveWS) {\n  var ok = this.findPlace(type.create(attrs));\n  if (ok) {\n    this.applyPendingMarks(this.top);\n    this.enterInner(type, attrs, true, preserveWS);\n  }\n  return ok\n};\n\n// Open a node of the given type\nParseContext.prototype.enterInner = function enterInner (type, attrs, solid, preserveWS) {\n  this.closeExtra();\n  var top = this.top;\n  top.match = top.match && top.match.matchType(type, attrs);\n  var 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, solid, null, options));\n  this.open++;\n};\n\n// Make sure all nodes above this.open are finished and added to\n// their parents\nParseContext.prototype.closeExtra = function closeExtra (openEnd) {\n    var this$1 = this;\n\n  var i = this.nodes.length - 1;\n  if (i > this.open) {\n    for (; i > this.open; i--) { this$1.nodes[i - 1].content.push(this$1.nodes[i].finish(openEnd)); }\n    this.nodes.length = this.open + 1;\n  }\n};\n\nParseContext.prototype.finish = function finish () {\n  this.open = 0;\n  this.closeExtra(this.isOpen);\n  return this.nodes[0].finish(this.isOpen || this.options.topOpen)\n};\n\nParseContext.prototype.sync = function sync (to) {\n    var this$1 = this;\n\n  for (var i = this.open; i >= 0; i--) { if (this$1.nodes[i] == to) {\n    this$1.open = i;\n    return\n  } }\n};\n\nParseContext.prototype.addPendingMark = function addPendingMark (mark) {\n  this.pendingMarks.push(mark);\n};\n\nParseContext.prototype.removePendingMark = function removePendingMark (mark) {\n  var found = this.pendingMarks.lastIndexOf(mark);\n  if (found > -1) {\n    this.pendingMarks.splice(found, 1);\n  } else {\n    var top = this.top;\n    top.activeMarks = mark.removeFromSet(top.activeMarks);\n  }\n};\n\nprototypeAccessors$6.currentPos.get = function () {\n    var this$1 = this;\n\n  this.closeExtra();\n  var pos = 0;\n  for (var i = this.open; i >= 0; i--) {\n    var content = this$1.nodes[i].content;\n    for (var j = content.length - 1; j >= 0; j--)\n      { pos += content[j].nodeSize; }\n    if (i) { pos++; }\n  }\n  return pos\n};\n\nParseContext.prototype.findAtPoint = function findAtPoint (parent, offset) {\n    var this$1 = this;\n\n  if (this.find) { for (var i = 0; i < this.find.length; i++) {\n    if (this$1.find[i].node == parent && this$1.find[i].offset == offset)\n      { this$1.find[i].pos = this$1.currentPos; }\n  } }\n};\n\nParseContext.prototype.findInside = function findInside (parent) {\n    var this$1 = this;\n\n  if (this.find) { for (var i = 0; i < this.find.length; i++) {\n    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node))\n      { this$1.find[i].pos = this$1.currentPos; }\n  } }\n};\n\nParseContext.prototype.findAround = function findAround (parent, content, before) {\n    var this$1 = this;\n\n  if (parent != content && this.find) { for (var i = 0; i < this.find.length; i++) {\n    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node)) {\n      var pos = content.compareDocumentPosition(this$1.find[i].node);\n      if (pos & (before ? 2 : 4))\n        { this$1.find[i].pos = this$1.currentPos; }\n    }\n  } }\n};\n\nParseContext.prototype.findInText = function findInText (textNode) {\n    var this$1 = this;\n\n  if (this.find) { for (var i = 0; i < this.find.length; i++) {\n    if (this$1.find[i].node == textNode)\n      { this$1.find[i].pos = this$1.currentPos - (textNode.nodeValue.length - this$1.find[i].offset); }\n  } }\n};\n\n// : (string) → bool\n// Determines whether the given [context\n// string](#ParseRule.context) matches this context.\nParseContext.prototype.matchesContext = function matchesContext (context) {\n    var this$1 = this;\n\n  if (context.indexOf(\"|\") > -1)\n    { return context.split(/\\s*\\|\\s*/).some(this.matchesContext, this) }\n\n  var parts = context.split(\"/\");\n  var option = this.options.context;\n  var useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);\n  var minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);\n  var match = function (i, depth) {\n    for (; i >= 0; i--) {\n      var 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        var next = depth > 0 || (depth == 0 && useRoot) ? this$1.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\nParseContext.prototype.textblockFromContext = function textblockFromContext () {\n    var this$1 = this;\n\n  var $context = this.options.context;\n  if ($context) { for (var d = $context.depth; d >= 0; d--) {\n    var deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;\n    if (deflt && deflt.isTextblock && deflt.defaultAttrs) { return deflt }\n  } }\n  for (var name in this$1.parser.schema.nodes) {\n    var type = this$1.parser.schema.nodes[name];\n    if (type.isTextblock && type.defaultAttrs) { return type }\n  }\n};\n\nObject.defineProperties( ParseContext.prototype, prototypeAccessors$6 );\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 (var child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {\n    var 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  var 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  var copy = {};\n  for (var prop in obj) { copy[prop] = obj[prop]; }\n  return copy\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, 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. If the second\n// element is plain object, it is interpreted as a set of attributes\n// for the element. Any elements after that (including the 2nd if it's\n// not an attribute object) are interpreted as children of the DOM\n// elements, and must either be valid `DOMOutputSpec` values, or the\n// 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.\nvar DOMSerializer = function DOMSerializer(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.\nDOMSerializer.prototype.serializeFragment = function serializeFragment (fragment, options, target) {\n    var this$1 = this;\n    if ( options === void 0 ) options = {};\n\n  if (!target) { target = doc(options).createDocumentFragment(); }\n\n  var top = target, active = null;\n  fragment.forEach(function (node) {\n    if (active || node.marks.length) {\n      if (!active) { active = []; }\n      var keep = 0, rendered = 0;\n      while (keep < active.length && rendered < node.marks.length) {\n        var next = node.marks[rendered];\n        if (!this$1.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        var add = node.marks[rendered++];\n        var markDOM = this$1.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$1.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).\nDOMSerializer.prototype.serializeNode = function serializeNode (node, options) {\n    if ( options === void 0 ) options = {};\n\n  var ref =\n      DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));\n    var dom = ref.dom;\n    var contentDOM = ref.contentDOM;\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\nDOMSerializer.prototype.serializeNodeAndMarks = function serializeNodeAndMarks (node, options) {\n    var this$1 = this;\n    if ( options === void 0 ) options = {};\n\n  var dom = this.serializeNode(node, options);\n  for (var i = node.marks.length - 1; i >= 0; i--) {\n    var wrap = this$1.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\nDOMSerializer.prototype.serializeMark = function serializeMark (mark, inline, options) {\n    if ( options === void 0 ) options = {};\n\n  var 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.\nDOMSerializer.renderSpec = function renderSpec (doc, structure) {\n  if (typeof structure == \"string\")\n    { return {dom: doc.createTextNode(structure)} }\n  if (structure.nodeType != null)\n    { return {dom: structure} }\n  var dom = doc.createElement(structure[0]), contentDOM = null;\n  var attrs = structure[1], start = 1;\n  if (attrs && typeof attrs == \"object\" && attrs.nodeType == null && !Array.isArray(attrs)) {\n    start = 2;\n    for (var name in attrs) {\n      if (attrs[name] != null) { dom.setAttribute(name, attrs[name]); }\n    }\n  }\n  for (var i = start; i < structure.length; i++) {\n    var 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: dom, contentDOM: dom}\n    } else {\n      var ref = DOMSerializer.renderSpec(doc, child);\n        var inner = ref.dom;\n        var innerContent = ref.contentDOM;\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: dom, contentDOM: 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.\nDOMSerializer.fromSchema = function 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.\nDOMSerializer.nodesFromSchema = function nodesFromSchema (schema) {\n  var result = gatherToDOM(schema.nodes);\n  if (!result.text) { result.text = function (node) { return 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.\nDOMSerializer.marksFromSchema = function marksFromSchema (schema) {\n  return gatherToDOM(schema.marks)\n};\n\nfunction gatherToDOM(obj) {\n  var result = {};\n  for (var name in obj) {\n    var 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\nexports.Node = Node;\nexports.ResolvedPos = ResolvedPos;\nexports.NodeRange = NodeRange;\nexports.Fragment = Fragment;\nexports.Slice = Slice;\nexports.ReplaceError = ReplaceError;\nexports.Mark = Mark;\nexports.Schema = Schema;\nexports.NodeType = NodeType;\nexports.MarkType = MarkType;\nexports.ContentMatch = ContentMatch;\nexports.DOMParser = DOMParser;\nexports.DOMSerializer = DOMSerializer;\n//# sourceMappingURL=index.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorModel = require('prosemirror-model');\nvar prosemirrorTransform = require('prosemirror-transform');\n\nvar classesById = Object.create(null);\n\n// ::- Superclass for editor selections. Every selection type should\n// extend this. Should not be instantiated directly.\nvar Selection = function Selection($anchor, $head, ranges) {\n  // :: [SelectionRange]\n  // The ranges covered by the selection.\n  this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];\n  // :: ResolvedPos\n  // The resolved anchor of the selection (the side that stays in\n  // place when the selection is modified).\n  this.$anchor = $anchor;\n  // :: ResolvedPos\n  // The resolved head of the selection (the side that moves when\n  // the selection is modified).\n  this.$head = $head;\n};\n\nvar prototypeAccessors = { anchor: {},head: {},from: {},to: {},$from: {},$to: {},empty: {} };\n\n// :: number\n// The selection's anchor, as an unresolved position.\nprototypeAccessors.anchor.get = function () { return this.$anchor.pos };\n\n// :: number\n// The selection's head.\nprototypeAccessors.head.get = function () { return this.$head.pos };\n\n// :: number\n// The lower bound of the selection's main range.\nprototypeAccessors.from.get = function () { return this.$from.pos };\n\n// :: number\n// The upper bound of the selection's main range.\nprototypeAccessors.to.get = function () { return this.$to.pos };\n\n// :: ResolvedPos\n// The resolved lowerbound of the selection's main range.\nprototypeAccessors.$from.get = function () {\n  return this.ranges[0].$from\n};\n\n// :: ResolvedPos\n// The resolved upper bound of the selection's main range.\nprototypeAccessors.$to.get = function () {\n  return this.ranges[0].$to\n};\n\n// :: bool\n// Indicates whether the selection contains any content.\nprototypeAccessors.empty.get = function () {\n  var ranges = this.ranges;\n  for (var i = 0; i < ranges.length; i++)\n    { if (ranges[i].$from.pos != ranges[i].$to.pos) { return false } }\n  return true\n};\n\n// eq:: (Selection) → bool\n// Test whether the selection is the same as another selection.\n\n// map:: (doc: Node, mapping: Mappable) → Selection\n// Map this selection through a [mappable](#transform.Mappable) thing. `doc`\n// should be the new document to which we are mapping.\n\n// :: () → Slice\n// Get the content of this selection as a slice.\nSelection.prototype.content = function content () {\n  return this.$from.node(0).slice(this.from, this.to, true)\n};\n\n// :: (Transaction, ?Slice)\n// Replace the selection with a slice or, if no slice is given,\n// delete the selection. Will append to the given transaction.\nSelection.prototype.replace = function replace (tr, content) {\n    if ( content === void 0 ) content = prosemirrorModel.Slice.empty;\n\n  // Put the new selection at the position after the inserted\n  // content. When that ended in an inline node, search backwards,\n  // to get the position after that node. If not, search forward.\n  var lastNode = content.content.lastChild, lastParent = null;\n  for (var i = 0; i < content.openEnd; i++) {\n    lastParent = lastNode;\n    lastNode = lastNode.lastChild;\n  }\n\n  var mapFrom = tr.steps.length, ranges = this.ranges;\n  for (var i$1 = 0; i$1 < ranges.length; i$1++) {\n    var ref = ranges[i$1];\n      var $from = ref.$from;\n      var $to = ref.$to;\n      var mapping = tr.mapping.slice(mapFrom);\n    tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i$1 ? prosemirrorModel.Slice.empty : content);\n    if (i$1 == 0)\n      { selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1); }\n  }\n};\n\n// :: (Transaction, Node)\n// Replace the selection with the given node, appending the changes\n// to the given transaction.\nSelection.prototype.replaceWith = function replaceWith (tr, node) {\n  var mapFrom = tr.steps.length, ranges = this.ranges;\n  for (var i = 0; i < ranges.length; i++) {\n    var ref = ranges[i];\n      var $from = ref.$from;\n      var $to = ref.$to;\n      var mapping = tr.mapping.slice(mapFrom);\n    var from = mapping.map($from.pos), to = mapping.map($to.pos);\n    if (i) {\n      tr.deleteRange(from, to);\n    } else {\n      tr.replaceRangeWith(from, to, node);\n      selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);\n    }\n  }\n};\n\n// toJSON:: () → Object\n// Convert the selection to a JSON representation. When implementing\n// this for a custom selection class, make sure to give the object a\n// `type` property whose value matches the ID under which you\n// [registered](#state.Selection^jsonID) your class.\n\n// :: (ResolvedPos, number, ?bool) → ?Selection\n// Find a valid cursor or leaf node selection starting at the given\n// position and searching back if `dir` is negative, and forward if\n// positive. When `textOnly` is true, only consider cursor\n// selections. Will return null when no valid selection position is\n// found.\nSelection.findFrom = function findFrom ($pos, dir, textOnly) {\n  var inner = $pos.parent.inlineContent ? new TextSelection($pos)\n      : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);\n  if (inner) { return inner }\n\n  for (var depth = $pos.depth - 1; depth >= 0; depth--) {\n    var found = dir < 0\n        ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)\n        : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);\n    if (found) { return found }\n  }\n};\n\n// :: (ResolvedPos, ?number) → Selection\n// Find a valid cursor or leaf node selection near the given\n// position. Searches forward first by default, but if `bias` is\n// negative, it will search backwards first.\nSelection.near = function near ($pos, bias) {\n    if ( bias === void 0 ) bias = 1;\n\n  return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0))\n};\n\n// :: (Node) → Selection\n// Find the cursor or leaf node selection closest to the start of\n// the given document. Will return an\n// [`AllSelection`](#state.AllSelection) if no valid position\n// exists.\nSelection.atStart = function atStart (doc) {\n  return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc)\n};\n\n// :: (Node) → Selection\n// Find the cursor or leaf node selection closest to the end of the\n// given document.\nSelection.atEnd = function atEnd (doc) {\n  return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc)\n};\n\n// :: (Node, Object) → Selection\n// Deserialize the JSON representation of a selection. Must be\n// implemented for custom classes (as a static class method).\nSelection.fromJSON = function fromJSON (doc, json) {\n  if (!json || !json.type) { throw new RangeError(\"Invalid input for Selection.fromJSON\") }\n  var cls = classesById[json.type];\n  if (!cls) { throw new RangeError((\"No selection type \" + (json.type) + \" defined\")) }\n  return cls.fromJSON(doc, json)\n};\n\n// :: (string, constructor<Selection>)\n// To be able to deserialize selections from JSON, custom selection\n// classes must register themselves with an ID string, so that they\n// can be disambiguated. Try to pick something that's unlikely to\n// clash with classes from other modules.\nSelection.jsonID = function jsonID (id, selectionClass) {\n  if (id in classesById) { throw new RangeError(\"Duplicate use of selection JSON ID \" + id) }\n  classesById[id] = selectionClass;\n  selectionClass.prototype.jsonID = id;\n  return selectionClass\n};\n\n// :: () → SelectionBookmark\n// Get a [bookmark](#state.SelectionBookmark) for this selection,\n// which is a value that can be mapped without having access to a\n// current document, and later resolved to a real selection for a\n// given document again. (This is used mostly by the history to\n// track and restore old selections.) The default implementation of\n// this method just converts the selection to a text selection and\n// returns the bookmark for that.\nSelection.prototype.getBookmark = function getBookmark () {\n  return TextSelection.between(this.$anchor, this.$head).getBookmark()\n};\n\nObject.defineProperties( Selection.prototype, prototypeAccessors );\n\n// :: bool\n// Controls whether, when a selection of this type is active in the\n// browser, the selected range should be visible to the user. Defaults\n// to `true`.\nSelection.prototype.visible = true;\n\n// SelectionBookmark:: interface\n// A lightweight, document-independent representation of a selection.\n// You can define a custom bookmark type for a custom selection class\n// to make the history handle it well.\n//\n//   map:: (mapping: Mapping) → SelectionBookmark\n//   Map the bookmark through a set of changes.\n//\n//   resolve:: (doc: Node) → Selection\n//   Resolve the bookmark to a real selection again. This may need to\n//   do some error checking and may fall back to a default (usually\n//   [`TextSelection.between`](#state.TextSelection^between)) if\n//   mapping made the bookmark invalid.\n\n// ::- Represents a selected range in a document.\nvar SelectionRange = function SelectionRange($from, $to) {\n  // :: ResolvedPos\n  // The lower bound of the range.\n  this.$from = $from;\n  // :: ResolvedPos\n  // The upper bound of the range.\n  this.$to = $to;\n};\n\n// ::- A text selection represents a classical editor selection, with\n// a head (the moving side) and anchor (immobile side), both of which\n// point into textblock nodes. It can be empty (a regular cursor\n// position).\nvar TextSelection = (function (Selection) {\n  function TextSelection($anchor, $head) {\n    if ( $head === void 0 ) $head = $anchor;\n\n    Selection.call(this, $anchor, $head);\n  }\n\n  if ( Selection ) TextSelection.__proto__ = Selection;\n  TextSelection.prototype = Object.create( Selection && Selection.prototype );\n  TextSelection.prototype.constructor = TextSelection;\n\n  var prototypeAccessors$1 = { $cursor: {} };\n\n  // :: ?ResolvedPos\n  // Returns a resolved position if this is a cursor selection (an\n  // empty text selection), and null otherwise.\n  prototypeAccessors$1.$cursor.get = function () { return this.$anchor.pos == this.$head.pos ? this.$head : null };\n\n  TextSelection.prototype.map = function map (doc, mapping) {\n    var $head = doc.resolve(mapping.map(this.head));\n    if (!$head.parent.inlineContent) { return Selection.near($head) }\n    var $anchor = doc.resolve(mapping.map(this.anchor));\n    return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head)\n  };\n\n  TextSelection.prototype.replace = function replace (tr, content) {\n    if ( content === void 0 ) content = prosemirrorModel.Slice.empty;\n\n    Selection.prototype.replace.call(this, tr, content);\n    if (content == prosemirrorModel.Slice.empty) {\n      var marks = this.$from.marksAcross(this.$to);\n      if (marks) { tr.ensureMarks(marks); }\n    }\n  };\n\n  TextSelection.prototype.eq = function eq (other) {\n    return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head\n  };\n\n  TextSelection.prototype.getBookmark = function getBookmark () {\n    return new TextBookmark(this.anchor, this.head)\n  };\n\n  TextSelection.prototype.toJSON = function toJSON () {\n    return {type: \"text\", anchor: this.anchor, head: this.head}\n  };\n\n  TextSelection.fromJSON = function fromJSON (doc, json) {\n    if (typeof json.anchor != \"number\" || typeof json.head != \"number\")\n      { throw new RangeError(\"Invalid input for TextSelection.fromJSON\") }\n    return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head))\n  };\n\n  // :: (Node, number, ?number) → TextSelection\n  // Create a text selection from non-resolved positions.\n  TextSelection.create = function create (doc, anchor, head) {\n    if ( head === void 0 ) head = anchor;\n\n    var $anchor = doc.resolve(anchor);\n    return new this($anchor, head == anchor ? $anchor : doc.resolve(head))\n  };\n\n  // :: (ResolvedPos, ResolvedPos, ?number) → Selection\n  // Return a text selection that spans the given positions or, if\n  // they aren't text positions, find a text selection near them.\n  // `bias` determines whether the method searches forward (default)\n  // or backwards (negative number) first. Will fall back to calling\n  // [`Selection.near`](#state.Selection^near) when the document\n  // doesn't contain a valid text position.\n  TextSelection.between = function between ($anchor, $head, bias) {\n    var dPos = $anchor.pos - $head.pos;\n    if (!bias || dPos) { bias = dPos >= 0 ? 1 : -1; }\n    if (!$head.parent.inlineContent) {\n      var found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);\n      if (found) { $head = found.$head; }\n      else { return Selection.near($head, bias) }\n    }\n    if (!$anchor.parent.inlineContent) {\n      if (dPos == 0) {\n        $anchor = $head;\n      } else {\n        $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;\n        if (($anchor.pos < $head.pos) != (dPos < 0)) { $anchor = $head; }\n      }\n    }\n    return new TextSelection($anchor, $head)\n  };\n\n  Object.defineProperties( TextSelection.prototype, prototypeAccessors$1 );\n\n  return TextSelection;\n}(Selection));\n\nSelection.jsonID(\"text\", TextSelection);\n\nvar TextBookmark = function TextBookmark(anchor, head) {\n  this.anchor = anchor;\n  this.head = head;\n};\nTextBookmark.prototype.map = function map (mapping) {\n  return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head))\n};\nTextBookmark.prototype.resolve = function resolve (doc) {\n  return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head))\n};\n\n// ::- A node selection is a selection that points at a single node.\n// All nodes marked [selectable](#model.NodeSpec.selectable) can be\n// the target of a node selection. In such a selection, `from` and\n// `to` point directly before and after the selected node, `anchor`\n// equals `from`, and `head` equals `to`..\nvar NodeSelection = (function (Selection) {\n  function NodeSelection($pos) {\n    var node = $pos.nodeAfter;\n    var $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n    Selection.call(this, $pos, $end);\n    // :: Node The selected node.\n    this.node = node;\n  }\n\n  if ( Selection ) NodeSelection.__proto__ = Selection;\n  NodeSelection.prototype = Object.create( Selection && Selection.prototype );\n  NodeSelection.prototype.constructor = NodeSelection;\n\n  NodeSelection.prototype.map = function map (doc, mapping) {\n    var ref = mapping.mapResult(this.anchor);\n    var deleted = ref.deleted;\n    var pos = ref.pos;\n    var $pos = doc.resolve(pos);\n    if (deleted) { return Selection.near($pos) }\n    return new NodeSelection($pos)\n  };\n\n  NodeSelection.prototype.content = function content () {\n    return new prosemirrorModel.Slice(prosemirrorModel.Fragment.from(this.node), 0, 0)\n  };\n\n  NodeSelection.prototype.eq = function eq (other) {\n    return other instanceof NodeSelection && other.anchor == this.anchor\n  };\n\n  NodeSelection.prototype.toJSON = function toJSON () {\n    return {type: \"node\", anchor: this.anchor}\n  };\n\n  NodeSelection.prototype.getBookmark = function getBookmark () { return new NodeBookmark(this.anchor) };\n\n  NodeSelection.fromJSON = function fromJSON (doc, json) {\n    if (typeof json.anchor != \"number\")\n      { throw new RangeError(\"Invalid input for NodeSelection.fromJSON\") }\n    return new NodeSelection(doc.resolve(json.anchor))\n  };\n\n  // :: (Node, number) → NodeSelection\n  // Create a node selection from non-resolved positions.\n  NodeSelection.create = function create (doc, from) {\n    return new this(doc.resolve(from))\n  };\n\n  // :: (Node) → bool\n  // Determines whether the given node may be selected as a node\n  // selection.\n  NodeSelection.isSelectable = function isSelectable (node) {\n    return !node.isText && node.type.spec.selectable !== false\n  };\n\n  return NodeSelection;\n}(Selection));\n\nNodeSelection.prototype.visible = false;\n\nSelection.jsonID(\"node\", NodeSelection);\n\nvar NodeBookmark = function NodeBookmark(anchor) {\n  this.anchor = anchor;\n};\nNodeBookmark.prototype.map = function map (mapping) {\n  var ref = mapping.mapResult(this.anchor);\n    var deleted = ref.deleted;\n    var pos = ref.pos;\n  return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos)\n};\nNodeBookmark.prototype.resolve = function resolve (doc) {\n  var $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;\n  if (node && NodeSelection.isSelectable(node)) { return new NodeSelection($pos) }\n  return Selection.near($pos)\n};\n\n// ::- A selection type that represents selecting the whole document\n// (which can not necessarily be expressed with a text selection, when\n// there are for example leaf block nodes at the start or end of the\n// document).\nvar AllSelection = (function (Selection) {\n  function AllSelection(doc) {\n    Selection.call(this, doc.resolve(0), doc.resolve(doc.content.size));\n  }\n\n  if ( Selection ) AllSelection.__proto__ = Selection;\n  AllSelection.prototype = Object.create( Selection && Selection.prototype );\n  AllSelection.prototype.constructor = AllSelection;\n\n  AllSelection.prototype.toJSON = function toJSON () { return {type: \"all\"} };\n\n  AllSelection.fromJSON = function fromJSON (doc) { return new AllSelection(doc) };\n\n  AllSelection.prototype.map = function map (doc) { return new AllSelection(doc) };\n\n  AllSelection.prototype.eq = function eq (other) { return other instanceof AllSelection };\n\n  AllSelection.prototype.getBookmark = function getBookmark () { return AllBookmark };\n\n  return AllSelection;\n}(Selection));\n\nSelection.jsonID(\"all\", AllSelection);\n\nvar AllBookmark = {\n  map: function map() { return this },\n  resolve: function resolve(doc) { return new AllSelection(doc) }\n};\n\n// FIXME we'll need some awareness of text direction when scanning for selections\n\n// Try to find a selection inside the given node. `pos` points at the\n// position where the search starts. When `text` is true, only return\n// text selections.\nfunction findSelectionIn(doc, node, pos, index, dir, text) {\n  if (node.inlineContent) { return TextSelection.create(doc, pos) }\n  for (var i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n    var child = node.child(i);\n    if (!child.isAtom) {\n      var inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);\n      if (inner) { return inner }\n    } else if (!text && NodeSelection.isSelectable(child)) {\n      return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0))\n    }\n    pos += child.nodeSize * dir;\n  }\n}\n\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n  var last = tr.steps.length - 1;\n  if (last < startLen) { return }\n  var step = tr.steps[last];\n  if (!(step instanceof prosemirrorTransform.ReplaceStep || step instanceof prosemirrorTransform.ReplaceAroundStep)) { return }\n  var map = tr.mapping.maps[last], end;\n  map.forEach(function (_from, _to, _newFrom, newTo) { if (end == null) { end = newTo; } });\n  tr.setSelection(Selection.near(tr.doc.resolve(end), bias));\n}\n\nvar UPDATED_SEL = 1;\nvar UPDATED_MARKS = 2;\nvar 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\"`.\nvar Transaction = (function (Transform$$1) {\n  function Transaction(state) {\n    Transform$$1.call(this, 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  if ( Transform$$1 ) Transaction.__proto__ = Transform$$1;\n  Transaction.prototype = Object.create( Transform$$1 && Transform$$1.prototype );\n  Transaction.prototype.constructor = Transaction;\n\n  var prototypeAccessors = { selection: {},selectionSet: {},storedMarksSet: {},isGeneric: {},scrolledIntoView: {} };\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  prototypeAccessors.selection.get = function () {\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  Transaction.prototype.setSelection = function 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  prototypeAccessors.selectionSet.get = function () {\n    return (this.updated & UPDATED_SEL) > 0\n  };\n\n  // :: (?[Mark]) → Transaction\n  // Set the current stored marks.\n  Transaction.prototype.setStoredMarks = function 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  Transaction.prototype.ensureMarks = function ensureMarks (marks) {\n    if (!prosemirrorModel.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  Transaction.prototype.addStoredMark = function 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  Transaction.prototype.removeStoredMark = function 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  prototypeAccessors.storedMarksSet.get = function () {\n    return (this.updated & UPDATED_MARKS) > 0\n  };\n\n  Transaction.prototype.addStep = function addStep (step, doc) {\n    Transform$$1.prototype.addStep.call(this, 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  Transaction.prototype.setTime = function setTime (time) {\n    this.time = time;\n    return this\n  };\n\n  // :: (Slice) → Transaction\n  // Replace the current selection with the given slice.\n  Transaction.prototype.replaceSelection = function 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  Transaction.prototype.replaceSelectionWith = function replaceSelectionWith (node, inheritMarks) {\n    var selection = this.selection;\n    if (inheritMarks !== false)\n      { node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || prosemirrorModel.Mark.none))); }\n    selection.replaceWith(this, node);\n    return this\n  };\n\n  // :: () → Transaction\n  // Delete the selection.\n  Transaction.prototype.deleteSelection = function 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  Transaction.prototype.insertText = function insertText (text, from, to) {\n    if ( to === void 0 ) to = from;\n\n    var 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      var marks = this.storedMarks;\n      if (!marks) {\n        var $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  Transaction.prototype.setMeta = function 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  Transaction.prototype.getMeta = function 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  prototypeAccessors.isGeneric.get = function () {\n    var this$1 = this;\n\n    for (var _ in this$1.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  Transaction.prototype.scrollIntoView = function scrollIntoView () {\n    this.updated |= UPDATED_SCROLL;\n    return this\n  };\n\n  prototypeAccessors.scrolledIntoView.get = function () {\n    return (this.updated & UPDATED_SCROLL) > 0\n  };\n\n  Object.defineProperties( Transaction.prototype, prototypeAccessors );\n\n  return Transaction;\n}(prosemirrorTransform.Transform));\n\nfunction bind(f, self) {\n  return !self || !f ? f : f.bind(self)\n}\n\nvar FieldDesc = function FieldDesc(name, desc, self) {\n  this.name = name;\n  this.init = bind(desc.init, self);\n  this.apply = bind(desc.apply, self);\n};\n\nvar baseFields = [\n  new FieldDesc(\"doc\", {\n    init: function init(config) { return config.doc || config.schema.topNodeType.createAndFill() },\n    apply: function apply(tr) { return tr.doc }\n  }),\n\n  new FieldDesc(\"selection\", {\n    init: function init(config, instance) { return config.selection || Selection.atStart(instance.doc) },\n    apply: function apply(tr) { return tr.selection }\n  }),\n\n  new FieldDesc(\"storedMarks\", {\n    init: function init(config) { return config.storedMarks || null },\n    apply: function apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }\n  }),\n\n  new FieldDesc(\"scrollToSelection\", {\n    init: function init() { return 0 },\n    apply: function 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.\nvar Configuration = function Configuration(schema, plugins) {\n  var this$1 = this;\n\n  this.schema = schema;\n  this.fields = baseFields.concat();\n  this.plugins = [];\n  this.pluginsByKey = Object.create(null);\n  if (plugins) { plugins.forEach(function (plugin) {\n    if (this$1.pluginsByKey[plugin.key])\n      { throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\") }\n    this$1.plugins.push(plugin);\n    this$1.pluginsByKey[plugin.key] = plugin;\n    if (plugin.spec.state)\n      { this$1.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin)); }\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.\nvar EditorState = function EditorState(config) {\n  this.config = config;\n};\n\nvar prototypeAccessors$1 = { schema: {},plugins: {},tr: {} };\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.\nprototypeAccessors$1.schema.get = function () {\n  return this.config.schema\n};\n\n// :: [Plugin]\n// The plugins that are active in this state.\nprototypeAccessors$1.plugins.get = function () {\n  return this.config.plugins\n};\n\n// :: (Transaction) → EditorState\n// Apply the given transaction to produce a new state.\nEditorState.prototype.apply = function apply (tr) {\n  return this.applyTransaction(tr).state\n};\n\n// : (Transaction) → bool\nEditorState.prototype.filterTransaction = function filterTransaction (tr, ignore) {\n    var this$1 = this;\n    if ( ignore === void 0 ) ignore = -1;\n\n  for (var i = 0; i < this.config.plugins.length; i++) { if (i != ignore) {\n    var plugin = this$1.config.plugins[i];\n    if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this$1))\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.\nEditorState.prototype.applyTransaction = function applyTransaction (rootTr) {\n    var this$1 = this;\n\n  if (!this.filterTransaction(rootTr)) { return {state: this, transactions: []} }\n\n  var 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    var haveNew = false;\n    for (var i = 0; i < this.config.plugins.length; i++) {\n      var plugin = this$1.config.plugins[i];\n      if (plugin.spec.appendTransaction) {\n        var n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this$1;\n        var 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 (var j = 0; j < this.config.plugins.length; j++)\n              { seen.push(j < i ? {state: newState, n: trs.length} : {state: this$1, 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\nEditorState.prototype.applyInner = function applyInner (tr) {\n    var this$1 = this;\n\n  if (!tr.before.eq(this.doc)) { throw new RangeError(\"Applying a mismatched transaction\") }\n  var newInstance = new EditorState(this.config), fields = this.config.fields;\n  for (var i = 0; i < fields.length; i++) {\n    var field = fields[i];\n    newInstance[field.name] = field.apply(tr, this$1[field.name], this$1, newInstance);\n  }\n  for (var i$1 = 0; i$1 < applyListeners.length; i$1++) { applyListeners[i$1](this$1, tr, newInstance); }\n  return newInstance\n};\n\n// :: Transaction\n// Start a [transaction](#state.Transaction) from this state.\nprototypeAccessors$1.tr.get = function () { 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.\nEditorState.create = function create (config) {\n  var $config = new Configuration(config.schema || config.doc.type.schema, config.plugins);\n  var instance = new EditorState($config);\n  for (var 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.\nEditorState.prototype.reconfigure = function reconfigure (config) {\n    var this$1 = this;\n\n  var $config = new Configuration(config.schema || this.schema, config.plugins);\n  var fields = $config.fields, instance = new EditorState($config);\n  for (var i = 0; i < fields.length; i++) {\n    var name = fields[i].name;\n    instance[name] = this$1.hasOwnProperty(name) ? this$1[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.\nEditorState.prototype.toJSON = function toJSON (pluginFields) {\n    var this$1 = this;\n\n  var result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()};\n  if (this.storedMarks) { result.storedMarks = this.storedMarks.map(function (m) { return m.toJSON(); }); }\n  if (pluginFields && typeof pluginFields == 'object') { for (var prop in pluginFields) {\n    if (prop == \"doc\" || prop == \"selection\")\n      { throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\") }\n    var plugin = pluginFields[prop], state = plugin.spec.state;\n    if (state && state.toJSON) { result[prop] = state.toJSON.call(plugin, this$1[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.\nEditorState.fromJSON = function 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  var $config = new Configuration(config.schema, config.plugins);\n  var instance = new EditorState($config);\n  $config.fields.forEach(function (field) {\n    if (field.name == \"doc\") {\n      instance.doc = prosemirrorModel.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 (var prop in pluginFields) {\n        var 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)\nEditorState.addApplyListener = function addApplyListener (f) {\n  applyListeners.push(f);\n};\nEditorState.removeApplyListener = function removeApplyListener (f) {\n  var found = applyListeners.indexOf(f);\n  if (found > -1) { applyListeners.splice(found, 1); }\n};\n\nObject.defineProperties( EditorState.prototype, prototypeAccessors$1 );\n\nvar applyListeners = [];\n\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 (var prop in obj) {\n    var 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.\nvar Plugin = function Plugin(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.\nPlugin.prototype.getState = function getState (state) { return state[this.key] };\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\nvar 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.\nvar PluginKey = function PluginKey(name) {\nif ( name === void 0 ) name = \"key\";\n this.key = createKey(name); };\n\n// :: (EditorState) → ?Plugin\n// Get the active plugin with this key, if any, from an editor\n// state.\nPluginKey.prototype.get = function get (state) { return state.config.pluginsByKey[this.key] };\n\n// :: (EditorState) → ?any\n// Get the plugin's state from an editor state.\nPluginKey.prototype.getState = function getState (state) { return state[this.key] };\n\nexports.Selection = Selection;\nexports.SelectionRange = SelectionRange;\nexports.TextSelection = TextSelection;\nexports.NodeSelection = NodeSelection;\nexports.AllSelection = AllSelection;\nexports.Transaction = Transaction;\nexports.EditorState = EditorState;\nexports.Plugin = Plugin;\nexports.PluginKey = PluginKey;\n//# sourceMappingURL=index.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorState = require('prosemirror-state');\nvar prosemirrorModel = require('prosemirror-model');\nvar prosemirrorTransform = require('prosemirror-transform');\n\nvar result = {};\nif (typeof navigator != \"undefined\" && typeof document != \"undefined\") {\n  var ie_edge = /Edge\\/(\\d+)/.exec(navigator.userAgent);\n  var ie_upto10 = /MSIE \\d/.test(navigator.userAgent);\n  var ie_11up = /Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(navigator.userAgent);\n\n  result.mac = /Mac/.test(navigator.platform);\n  var 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  var 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 = !ie && 'WebkitAppearance' 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\nvar domIndex = function(node) {\n  for (var index = 0;; index++) {\n    node = node.previousSibling;\n    if (!node) { return index }\n  }\n};\n\nvar parentNode = function(node) {\n  var parent = node.parentNode;\n  return parent && parent.nodeType == 11 ? parent.host : parent\n};\n\nvar textRange = function(node, from, to) {\n  var range = 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)\nvar isEquivalentPosition = function(node, off, targetNode, targetOff) {\n  return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||\n                        scanFor(node, off, targetNode, targetOff, 1))\n};\n\nvar 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      var 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      off = dir < 0 ? nodeSize(node) : 0;\n    } else {\n      return false\n    }\n  }\n}\n\nfunction nodeSize(node) {\n  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length\n}\n\nfunction hasBlockDesc(dom) {\n  var desc;\n  for (var 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)\nvar selectionCollapsed = function(domSel) {\n  var collapsed = domSel.isCollapsed;\n  if (collapsed && result.chrome && domSel.rangeCount && !domSel.getRangeAt(0).collapsed)\n    { collapsed = false; }\n  return collapsed\n};\n\nfunction keyEvent(keyCode, key) {\n  var 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\nfunction windowRect(win) {\n  return {left: 0, right: win.innerWidth,\n          top: 0, bottom: win.innerHeight}\n}\n\nfunction getSide(value, side) {\n  return typeof value == \"number\" ? value : value[side]\n}\n\nfunction scrollRectIntoView(view, rect, startDOM) {\n  var scrollThreshold = view.someProp(\"scrollThreshold\") || 0, scrollMargin = view.someProp(\"scrollMargin\") || 5;\n  var doc = view.dom.ownerDocument, win = doc.defaultView;\n  for (var parent = startDOM || view.dom;; parent = parentNode(parent)) {\n    if (!parent) { break }\n    if (parent.nodeType != 1) { continue }\n    var atTop = parent == doc.body || parent.nodeType != 1;\n    var bounding = atTop ? windowRect(win) : parent.getBoundingClientRect();\n    var 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        win.scrollBy(moveX, moveY);\n      } else {\n        if (moveY) { parent.scrollTop += moveY; }\n        if (moveX) { parent.scrollLeft += moveX; }\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.\nfunction storeScrollPos(view) {\n  var rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top);\n  var doc = view.dom.ownerDocument;\n  var refDOM, refTop;\n  for (var x = (rect.left + rect.right) / 2, y = startY + 1;\n       y < Math.min(innerHeight, rect.bottom); y += 5) {\n    var dom = view.root.elementFromPoint(x, y);\n    if (dom == view.dom || !view.dom.contains(dom)) { continue }\n    var localRect = dom.getBoundingClientRect();\n    if (localRect.top >= startY - 20) {\n      refDOM = dom;\n      refTop = localRect.top;\n      break\n    }\n  }\n  var stack = [];\n  for (var dom$1 = view.dom; dom$1; dom$1 = parentNode(dom$1)) {\n    stack.push({dom: dom$1, top: dom$1.scrollTop, left: dom$1.scrollLeft});\n    if (dom$1 == doc.body) { break }\n  }\n  return {refDOM: refDOM, refTop: refTop, stack: 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.\nfunction resetScrollPos(ref) {\n  var refDOM = ref.refDOM;\n  var refTop = ref.refTop;\n  var stack = ref.stack;\n\n  var newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;\n  var dTop = newRefTop == 0 ? 0 : newRefTop - refTop;\n  for (var i = 0; i < stack.length; i++) {\n    var ref$1 = stack[i];\n    var dom = ref$1.dom;\n    var top = ref$1.top;\n    var left = ref$1.left;\n    if (dom.scrollTop != top + dTop) { dom.scrollTop = top + dTop; }\n    if (dom.scrollLeft != left) { dom.scrollLeft = left; }\n  }\n}\n\nfunction findOffsetInNode(node, coords) {\n  var closest, dxClosest = 2e8, coordsClosest, offset = 0;\n  var rowBot = coords.top, rowTop = coords.top;\n  for (var child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {\n    var rects = (void 0);\n    if (child.nodeType == 1) { rects = child.getClientRects(); }\n    else if (child.nodeType == 3) { rects = textRange(child).getClientRects(); }\n    else { continue }\n\n    for (var i = 0; i < rects.length; i++) {\n      var 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        var 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: node, offset: offset} }\n  return findOffsetInNode(closest, coordsClosest)\n}\n\nfunction findOffsetInText(node, coords) {\n  var len = node.nodeValue.length;\n  var range = document.createRange();\n  for (var i = 0; i < len; i++) {\n    range.setEnd(node, i + 1);\n    range.setStart(node, i);\n    var rect = singleRect(range, 1);\n    if (rect.top == rect.bottom) { continue }\n    if (inRect(coords, rect))\n      { return {node: node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0)} }\n  }\n  return {node: 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  var 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  var ref = findOffsetInNode(elt, coords);\n  var node = ref.node;\n  var offset = ref.offset;\n  var bias = -1;\n  if (node.nodeType == 1 && !node.firstChild) {\n    var 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  var outside = -1;\n  for (var cur = node;;) {\n    if (cur == view.dom) { break }\n    var desc = view.docView.nearestDesc(cur, true);\n    if (!desc) { return null }\n    if (desc.node.isBlock && desc.parent) {\n      var 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  var len = element.childNodes.length;\n  if (len && box.top < box.bottom) {\n    for (var startI = Math.max(0, Math.min(len - 1, Math.floor(len * (coords.top - box.top) / (box.bottom - box.top)) - 2)), i = startI;;) {\n      var child = element.childNodes[i];\n      if (child.nodeType == 1) {\n        var rects = child.getClientRects();\n        for (var j = 0; j < rects.length; j++) {\n          var 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.\nfunction posAtCoords(view, coords) {\n  var root = view.root, node, offset;\n  if (root.caretPositionFromPoint) {\n    var pos$1 = root.caretPositionFromPoint(coords.left, coords.top);\n    if (pos$1) { var assign;\n      ((assign = pos$1, node = assign.offsetNode, offset = assign.offset)); }\n  }\n  if (!node && root.caretRangeFromPoint) {\n    var range = root.caretRangeFromPoint(coords.left, coords.top);\n    if (range) { var assign$1;\n      ((assign$1 = range, node = assign$1.startContainer, offset = assign$1.startOffset)); }\n  }\n\n  var elt = root.elementFromPoint(coords.left, coords.top + 1), pos;\n  if (!elt || !view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) {\n    var 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  elt = targetKludge(elt, coords);\n  if (node) {\n    if (result.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        var next = node.childNodes[offset], box$1;\n        if (next.nodeName == \"IMG\" && (box$1 = next.getBoundingClientRect()).right <= coords.left &&\n            box$1.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  var desc = view.docView.nearestDesc(elt, true);\n  return {pos: pos, inside: desc ? desc.posAtStart - desc.border : -1}\n}\n\nfunction singleRect(object, bias) {\n  var rects = object.getClientRects();\n  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1]\n}\n\n// : (EditorView, 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.\nfunction coordsAtPos(view, pos) {\n  var ref = view.docView.domFromPos(pos);\n  var node = ref.node;\n  var offset = ref.offset;\n\n  // These browsers support querying empty text ranges\n  if (node.nodeType == 3 && (result.chrome || result.gecko)) {\n    var rect = singleRect(textRange(node, offset, offset), 0);\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 (result.gecko && offset && /\\s/.test(node.nodeValue[offset - 1]) && offset < node.nodeValue.length) {\n      var rectBefore = singleRect(textRange(node, offset - 1, offset - 1), -1);\n      if (Math.abs(rectBefore.left - rect.left) < 1 && rectBefore.top == rect.top) {\n        var rectAfter = singleRect(textRange(node, offset, offset + 1), -1);\n        return flattenV(rectAfter, rectAfter.left < rectBefore.left)\n      }\n    }\n    return rect\n  }\n\n  if (node.nodeType == 1 && !view.state.doc.resolve(pos).parent.inlineContent) {\n    // Return a horizontal line in block context\n    var top = true, rect$1;\n    if (offset < node.childNodes.length) {\n      var after = node.childNodes[offset];\n      if (after.nodeType == 1) { rect$1 = after.getBoundingClientRect(); }\n    }\n    if (!rect$1 && offset) {\n      var before = node.childNodes[offset - 1];\n      if (before.nodeType == 1) { rect$1 = before.getBoundingClientRect(); top = false; }\n    }\n    return flattenH(rect$1 || node.getBoundingClientRect(), top)\n  }\n\n  // Not Firefox/Chrome, or not in a text node, so we have to use\n  // actual element/character rectangles to get a solution (this part\n  // is not very bidi-safe)\n  //\n  // Try the left side first, fall back to the right one if that\n  // doesn't work.\n  for (var dir = -1; dir < 2; dir += 2) {\n    if (dir < 0 && offset) {\n      var prev = (void 0), target = node.nodeType == 3 ? textRange(node, offset - 1, offset)\n          : (prev = node.childNodes[offset - 1]).nodeType == 3 ? textRange(prev)\n          : prev.nodeType == 1 && prev.nodeName != \"BR\" ? prev : null; // BR nodes tend to only return the rectangle before them\n      if (target) {\n        var rect$2 = singleRect(target, 1);\n        if (rect$2.top < rect$2.bottom) { return flattenV(rect$2, false) }\n      }\n    } else if (dir > 0 && offset < nodeSize(node)) {\n      var next = (void 0), target$1 = node.nodeType == 3 ? textRange(node, offset, offset + 1)\n          : (next = node.childNodes[offset]).nodeType == 3 ? textRange(next)\n          : next.nodeType == 1 ? next : null;\n      if (target$1) {\n        var rect$3 = singleRect(target$1, -1);\n        if (rect$3.top < rect$3.bottom) { return flattenV(rect$3, true) }\n      }\n    }\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, 0), false)\n}\n\nfunction flattenV(rect, left) {\n  if (rect.width == 0) { return rect }\n  var 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  var 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  var 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.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  var sel = state.selection;\n  var $pos = dir == \"up\" ? sel.$anchor.min(sel.$head) : sel.$anchor.max(sel.$head);\n  return withFlushedState(view, state, function () {\n    var ref = view.docView.domFromPos($pos.pos);\n    var dom = ref.node;\n    for (;;) {\n      var 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    var coords = coordsAtPos(view, $pos.pos);\n    for (var child = dom.firstChild; child; child = child.nextSibling) {\n      var boxes = (void 0);\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 (var i = 0; i < boxes.length; i++) {\n        var 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\nvar maybeRTL = /[\\u0590-\\u08ac]/;\n\nfunction endOfTextblockHorizontal(view, state, dir) {\n  var ref = state.selection;\n  var $head = ref.$head;\n  if (!$head.parent.isTextblock) { return false }\n  var offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size;\n  var 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, function () {\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    var oldRange = sel.getRangeAt(0), oldNode = sel.focusNode, oldOff = sel.focusOffset;\n    var oldBidiLevel = sel.caretBidiLevel; // Only for Firefox\n    sel.modify(\"move\", dir, \"character\");\n    var parentDOM = $head.depth ? view.docView.domAfterPos($head.before()) : view.dom;\n    var result$$1 = !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$$1\n  })\n}\n\nvar cachedState = null;\nvar cachedDir = null;\nvar cachedResult = false;\nfunction 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\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// 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\nvar NOT_DIRTY = 0;\nvar CHILD_DIRTY = 1;\nvar CONTENT_DIRTY = 2;\nvar NODE_DIRTY = 3;\n\n// Superclass for the various kinds of descriptions. Defines their\n// basic structure and shared methods.\nvar ViewDesc = function ViewDesc(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\nvar prototypeAccessors$1 = { beforePosition: {},size: {},border: {},posBefore: {},posAtStart: {},posAfter: {},posAtEnd: {},contentLost: {} };\n\n// Used to check whether a given description corresponds to a\n// widget/mark/node.\nViewDesc.prototype.matchesWidget = function matchesWidget () { return false };\nViewDesc.prototype.matchesMark = function matchesMark () { return false };\nViewDesc.prototype.matchesNode = function matchesNode () { return false };\nViewDesc.prototype.matchesHack = function matchesHack () { return false };\n\nprototypeAccessors$1.beforePosition.get = function () { 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.\nViewDesc.prototype.parseRule = function 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.\nViewDesc.prototype.stopEvent = function stopEvent () { return false };\n\n// The size of the content represented by this desc.\nprototypeAccessors$1.size.get = function () {\n    var this$1 = this;\n\n  var size = 0;\n  for (var i = 0; i < this.children.length; i++) { size += this$1.children[i].size; }\n  return size\n};\n\n// For block nodes, this represents the space taken up by their\n// start/end tokens.\nprototypeAccessors$1.border.get = function () { return 0 };\n\nViewDesc.prototype.destroy = function destroy () {\n    var this$1 = this;\n\n  this.parent = null;\n  if (this.dom.pmViewDesc == this) { this.dom.pmViewDesc = null; }\n  for (var i = 0; i < this.children.length; i++)\n    { this$1.children[i].destroy(); }\n};\n\nViewDesc.prototype.posBeforeChild = function posBeforeChild (child) {\n    var this$1 = this;\n\n  for (var i = 0, pos = this.posAtStart; i < this.children.length; i++) {\n    var cur = this$1.children[i];\n    if (cur == child) { return pos }\n    pos += cur.size;\n  }\n};\n\nprototypeAccessors$1.posBefore.get = function () {\n  return this.parent.posBeforeChild(this)\n};\n\nprototypeAccessors$1.posAtStart.get = function () {\n  return this.parent ? this.parent.posBeforeChild(this) + this.border : 0\n};\n\nprototypeAccessors$1.posAfter.get = function () {\n  return this.posBefore + this.size\n};\n\nprototypeAccessors$1.posAtEnd.get = function () {\n  return this.posAtStart + this.size - 2 * this.border\n};\n\n// : (dom.Node, number, ?number) → number\nViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {\n    var this$1 = this;\n\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      var 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      var domAfter, desc$1;\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$1 = domAfter.pmViewDesc) && desc$1.parent == this)) { domAfter = domAfter.nextSibling; }\n      return domAfter ? this.posBeforeChild(desc$1) : 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  var 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 (var search = dom;; search = search.parentNode) {\n      if (search == this$1.dom) { atEnd = false; break }\n      if (search.parentNode.firstChild != search) { break }\n    } }\n    if (atEnd == null && offset == dom.childNodes.length) { for (var search$1 = dom;; search$1 = search$1.parentNode) {\n      if (search$1 == this$1.dom) { atEnd = true; break }\n      if (search$1.parentNode.lastChild != search$1) { 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.\nViewDesc.prototype.nearestDesc = function nearestDesc (dom, onlyNodes) {\n    var this$1 = this;\n\n  for (var first = true, cur = dom; cur; cur = cur.parentNode) {\n    var desc = this$1.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 && !(desc.nodeDOM.nodeType == 1 ? desc.nodeDOM.contains(dom) : desc.nodeDOM == dom)) { first = false; }\n      else { return desc }\n    }\n  }\n};\n\nViewDesc.prototype.getDesc = function getDesc (dom) {\n    var this$1 = this;\n\n  var desc = dom.pmViewDesc;\n  for (var cur = desc; cur; cur = cur.parent) { if (cur == this$1) { return desc } }\n};\n\nViewDesc.prototype.posFromDOM = function posFromDOM (dom, offset, bias) {\n    var this$1 = this;\n\n  for (var scan = dom;; scan = scan.parentNode) {\n    var desc = this$1.getDesc(scan);\n    if (desc) { return desc.localPosFromDOM(dom, offset, bias) }\n  }\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.)\nViewDesc.prototype.descAt = function descAt (pos) {\n    var this$1 = this;\n\n  for (var i = 0, offset = 0; i < this.children.length; i++) {\n    var child = this$1.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}\nViewDesc.prototype.domFromPos = function domFromPos (pos) {\n    var this$1 = this;\n\n  if (!this.contentDOM) { return {node: this.dom, offset: 0} }\n  for (var 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$1.contentDOM,\n              offset: i == this$1.children.length ? this$1.contentDOM.childNodes.length : domIndex(this$1.children[i].dom)}\n    }\n    if (i == this$1.children.length) { throw new Error(\"Invalid position \" + pos) }\n    var child = this$1.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.\nViewDesc.prototype.parseRange = function parseRange (from, to, base) {\n    var this$1 = this;\n    if ( base === void 0 ) base = 0;\n\n  if (this.children.length == 0)\n    { return {node: this.contentDOM, from: from, to: to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length} }\n\n  var fromOffset = -1, toOffset = -1;\n  for (var offset = base, i = 0;; i++) {\n    var child = this$1.children[i], end = offset + child.size;\n    if (fromOffset == -1 && from <= end) {\n      var 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$1.contentDOM.contains(child.contentDOM))\n        { return child.parseRange(from, to, childBase) }\n\n      from = offset;\n      for (var j = i; j > 0; j--) {\n        var prev = this$1.children[j - 1];\n        if (prev.size && prev.dom.parentNode == this$1.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 && to <= end) {\n      to = end;\n      for (var j$1 = i + 1; j$1 < this.children.length; j$1++) {\n        var next = this$1.children[j$1];\n        if (next.size && next.dom.parentNode == this$1.contentDOM && !next.emptyChildAt(-1)) {\n          toOffset = domIndex(next.dom);\n          break\n        }\n        to += next.size;\n      }\n      if (toOffset == -1) { toOffset = this$1.contentDOM.childNodes.length; }\n      break\n    }\n    offset = end;\n  }\n  return {node: this.contentDOM, from: from, to: to, fromOffset: fromOffset, toOffset: toOffset}\n};\n\nViewDesc.prototype.emptyChildAt = function emptyChildAt (side) {\n  if (this.border || !this.contentDOM || !this.children.length) { return false }\n  var child = this.children[side < 0 ? 0 : this.children.length - 1];\n  return child.size == 0 || child.emptyChildAt(side)\n};\n\n// : (number) → dom.Node\nViewDesc.prototype.domAfterPos = function domAfterPos (pos) {\n  var ref = this.domFromPos(pos);\n    var node = ref.node;\n    var offset = ref.offset;\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.\nViewDesc.prototype.setSelection = function setSelection (anchor, head, root, force) {\n    var this$1 = this;\n\n  // If the selection falls entirely in a child, give it to that child\n  var from = Math.min(anchor, head), to = Math.max(anchor, head);\n  for (var i = 0, offset = 0; i < this.children.length; i++) {\n    var child = this$1.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  var anchorDOM = this.domFromPos(anchor), headDOM = this.domFromPos(head);\n  var domSel = root.getSelection(), range = document.createRange();\n  if (!force &&\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  if (domSel.extend) {\n    range.setEnd(anchorDOM.node, anchorDOM.offset);\n    range.collapse(false);\n  } else {\n    if (anchor > head) { var tmp = anchorDOM; anchorDOM = headDOM; headDOM = tmp; }\n    range.setEnd(headDOM.node, headDOM.offset);\n    range.setStart(anchorDOM.node, anchorDOM.offset);\n  }\n  domSel.removeAllRanges();\n  domSel.addRange(range);\n  if (domSel.extend)\n    { domSel.extend(headDOM.node, headDOM.offset); }\n};\n\n// : (dom.MutationRecord) → bool\nViewDesc.prototype.ignoreMutation = function ignoreMutation (_mutation) {\n  return !this.contentDOM\n};\n\nprototypeAccessors$1.contentLost.get = function () {\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.\nViewDesc.prototype.markDirty = function markDirty (from, to) {\n    var this$1 = this;\n\n  for (var offset = 0, i = 0; i < this.children.length; i++) {\n    var child = this$1.children[i], end = offset + child.size;\n    if (offset == end ? from <= end && to >= offset : from < end && to > offset) {\n      var startInside = offset + child.border, endInside = end - child.border;\n      if (from >= startInside && to <= endInside) {\n        this$1.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;\n        if (from == startInside && to == endInside &&\n            (child.contentLost || child.dom.parentNode != this$1.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\nViewDesc.prototype.markParentsDirty = function markParentsDirty () {\n  var level = 1;\n  for (var node = this.parent; node; node = node.parent) {\n    var dirty = level == 1 ? CONTENT_DIRTY : CHILD_DIRTY;\n    if (node.dirty < dirty) { node.dirty = dirty; }\n  }\n};\n\nObject.defineProperties( ViewDesc.prototype, prototypeAccessors$1 );\n\n// Reused array to avoid allocating fresh arrays for things that will\n// stay empty anyway.\nvar nothing = [];\n\n// A widget desc represents a widget decoration, which is a DOM node\n// drawn between the document nodes.\nvar WidgetViewDesc = (function (ViewDesc) {\n  function WidgetViewDesc(parent, widget, view, pos) {\n    var self, dom = widget.type.toDOM;\n    if (typeof dom == \"function\") { dom = dom(view, function () {\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        var wrap = document.createElement(\"span\");\n        wrap.appendChild(dom);\n        dom = wrap;\n      }\n      dom.contentEditable = false;\n      dom.classList.add(\"ProseMirror-widget\");\n    }\n    ViewDesc.call(this, parent, nothing, dom, null);\n    this.widget = widget;\n    self = this;\n  }\n\n  if ( ViewDesc ) WidgetViewDesc.__proto__ = ViewDesc;\n  WidgetViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );\n  WidgetViewDesc.prototype.constructor = WidgetViewDesc;\n\n  var prototypeAccessors$1 = { beforePosition: {} };\n\n  prototypeAccessors$1.beforePosition.get = function () {\n    return this.widget.type.side < 0\n  };\n\n  WidgetViewDesc.prototype.matchesWidget = function matchesWidget (widget) {\n    return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type)\n  };\n\n  WidgetViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };\n\n  WidgetViewDesc.prototype.stopEvent = function stopEvent (event) {\n    var stop = this.widget.spec.stopEvent;\n    return stop ? stop(event) : false\n  };\n\n  Object.defineProperties( WidgetViewDesc.prototype, prototypeAccessors$1 );\n\n  return WidgetViewDesc;\n}(ViewDesc));\n\nvar CompositionViewDesc = (function (ViewDesc) {\n  function CompositionViewDesc(parent, dom, textDOM, text) {\n    ViewDesc.call(this, parent, nothing, dom, null);\n    this.textDOM = textDOM;\n    this.text = text;\n  }\n\n  if ( ViewDesc ) CompositionViewDesc.__proto__ = ViewDesc;\n  CompositionViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );\n  CompositionViewDesc.prototype.constructor = CompositionViewDesc;\n\n  var prototypeAccessors$2 = { size: {} };\n\n  prototypeAccessors$2.size.get = function () { return this.text.length };\n\n  CompositionViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset) {\n    if (dom != this.textDOM) { return this.posAtStart + (offset ? this.size : 0) }\n    return this.posAtStart + offset\n  };\n\n  CompositionViewDesc.prototype.domFromPos = function domFromPos (pos) {\n    return {node: this.textDOM, offset: pos}\n  };\n\n  CompositionViewDesc.prototype.ignoreMutation = function ignoreMutation (mut) {\n    return mut.type === 'characterData' && mut.target.nodeValue == mut.oldValue\n   };\n\n  Object.defineProperties( CompositionViewDesc.prototype, prototypeAccessors$2 );\n\n  return CompositionViewDesc;\n}(ViewDesc));\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.\nvar MarkViewDesc = (function (ViewDesc) {\n  function MarkViewDesc(parent, mark, dom, contentDOM) {\n    ViewDesc.call(this, parent, [], dom, contentDOM);\n    this.mark = mark;\n  }\n\n  if ( ViewDesc ) MarkViewDesc.__proto__ = ViewDesc;\n  MarkViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );\n  MarkViewDesc.prototype.constructor = MarkViewDesc;\n\n  MarkViewDesc.create = function create (parent, mark, inline, view) {\n    var custom = view.nodeViews[mark.type.name];\n    var spec = custom && custom(mark, view, inline);\n    if (!spec || !spec.dom)\n      { spec = prosemirrorModel.DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline)); }\n    return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom)\n  };\n\n  MarkViewDesc.prototype.parseRule = function parseRule () { return {mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM} };\n\n  MarkViewDesc.prototype.matchesMark = function matchesMark (mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark) };\n\n  MarkViewDesc.prototype.markDirty = function markDirty (from, to) {\n    ViewDesc.prototype.markDirty.call(this, from, to);\n    // Move dirty info to nearest node view\n    if (this.dirty != NOT_DIRTY) {\n      var 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  MarkViewDesc.prototype.slice = function slice (from, to, view) {\n    var copy = MarkViewDesc.create(this.parent, this.mark, true, view);\n    var 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 (var i = 0; i < nodes.length; i++) { nodes[i].parent = copy; }\n    copy.children = nodes;\n    return copy\n  };\n\n  return MarkViewDesc;\n}(ViewDesc));\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.\nvar NodeViewDesc = (function (ViewDesc) {\n  function NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {\n    ViewDesc.call(this, 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  if ( ViewDesc ) NodeViewDesc.__proto__ = ViewDesc;\n  NodeViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );\n  NodeViewDesc.prototype.constructor = NodeViewDesc;\n\n  var prototypeAccessors$3 = { size: {},border: {} };\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  NodeViewDesc.create = function create (parent, node, outerDeco, innerDeco, view, pos) {\n    var custom = view.nodeViews[node.type.name], descObj;\n    var spec = custom && custom(node, view, function () {\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    var 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      var assign;\n      ((assign = prosemirrorModel.DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)), dom = assign.dom, contentDOM = assign.contentDOM));\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    var 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  NodeViewDesc.prototype.parseRule = function parseRule () {\n    var this$1 = this;\n\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    var 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 = function () { return this$1.contentDOM ? prosemirrorModel.Fragment.empty : this$1.node.content; }; }\n    return rule\n  };\n\n  NodeViewDesc.prototype.matchesNode = function 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  prototypeAccessors$3.size.get = function () { return this.node.nodeSize };\n\n  prototypeAccessors$3.border.get = function () { 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  NodeViewDesc.prototype.updateChildren = function updateChildren (view, pos) {\n    var this$1 = this;\n\n    var inline = this.node.inlineContent, off = pos;\n    var composition = inline && view.composing && this.localCompositionNode(view, pos);\n    var updater = new ViewTreeUpdater(this, composition && composition.node);\n    iterDeco(this.node, this.innerDeco, function (widget, i) {\n      if (widget.spec.marks)\n        { updater.syncToMarks(widget.spec.marks, inline, view); }\n      else if (widget.type.side >= 0)\n        { updater.syncToMarks(i == this$1.node.childCount ? prosemirrorModel.Mark.none : this$1.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    }, function (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      this.renderChildren();\n    }\n  };\n\n  NodeViewDesc.prototype.renderChildren = function renderChildren () {\n    renderDescs(this.contentDOM, this.children, NodeViewDesc.is);\n    if (result.ios) { iosHacks(this.dom); }\n  };\n\n  NodeViewDesc.prototype.localCompositionNode = function 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    var ref = view.state.selection;\n    var from = ref.from;\n    var to = ref.to;\n    if (!(view.state.selection instanceof prosemirrorState.TextSelection) || from < pos || to > pos + this.node.content.size) { return }\n    var sel = view.root.getSelection();\n    var 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    var text = textNode.nodeValue;\n    var textPos = findTextInFragment(this.node.content, text, from - pos, to - pos);\n\n    return textPos < 0 ? null : {node: textNode, pos: textPos, text: text}\n  };\n\n  NodeViewDesc.prototype.protectLocalComposition = function protectLocalComposition (view, ref) {\n    var this$1 = this;\n    var node = ref.node;\n    var pos = ref.pos;\n    var text = ref.text;\n\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    var topNode = node;\n    for (;; topNode = topNode.parentNode) {\n      if (topNode.parentNode == this$1.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    var 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  NodeViewDesc.prototype.update = function 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  NodeViewDesc.prototype.updateInner = function 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  NodeViewDesc.prototype.updateOuterDeco = function updateOuterDeco (outerDeco) {\n    if (sameOuterDeco(outerDeco, this.outerDeco)) { return }\n    var needsWrap = this.nodeDOM.nodeType != 1;\n    var 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  NodeViewDesc.prototype.selectNode = function 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  NodeViewDesc.prototype.deselectNode = function deselectNode () {\n    this.nodeDOM.classList.remove(\"ProseMirror-selectednode\");\n    if (this.contentDOM || !this.node.type.spec.draggable) { this.dom.draggable = false; }\n  };\n\n  Object.defineProperties( NodeViewDesc.prototype, prototypeAccessors$3 );\n\n  return NodeViewDesc;\n}(ViewDesc));\n\n// Create a view desc for the top-level document node, to be exported\n// and used by the view class.\nfunction 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\nvar TextViewDesc = (function (NodeViewDesc) {\n  function TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {\n    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view);\n  }\n\n  if ( NodeViewDesc ) TextViewDesc.__proto__ = NodeViewDesc;\n  TextViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );\n  TextViewDesc.prototype.constructor = TextViewDesc;\n\n  TextViewDesc.prototype.parseRule = function parseRule () {\n    return {skip: this.nodeDOM.parentNode || true}\n  };\n\n  TextViewDesc.prototype.update = function update (node, outerDeco) {\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    this.node = node;\n    this.dirty = NOT_DIRTY;\n    return true\n  };\n\n  TextViewDesc.prototype.inParent = function inParent () {\n    var parentDOM = this.parent.contentDOM;\n    for (var n = this.nodeDOM; n; n = n.parentNode) { if (n == parentDOM) { return true } }\n    return false\n  };\n\n  TextViewDesc.prototype.domFromPos = function domFromPos (pos) {\n    return {node: this.nodeDOM, offset: pos}\n  };\n\n  TextViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {\n    if (dom == this.nodeDOM) { return this.posAtStart + Math.min(offset, this.node.text.length) }\n    return NodeViewDesc.prototype.localPosFromDOM.call(this, dom, offset, bias)\n  };\n\n  TextViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {\n    return mutation.type != \"characterData\" && mutation.type != \"selection\"\n  };\n\n  TextViewDesc.prototype.slice = function slice (from, to, view) {\n    var 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  return TextViewDesc;\n}(NodeViewDesc));\n\n// A dummy desc used to tag trailing BR or span nodes created to work\n// around contentEditable terribleness.\nvar BRHackViewDesc = (function (ViewDesc) {\n  function BRHackViewDesc () {\n    ViewDesc.apply(this, arguments);\n  }\n\n  if ( ViewDesc ) BRHackViewDesc.__proto__ = ViewDesc;\n  BRHackViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );\n  BRHackViewDesc.prototype.constructor = BRHackViewDesc;\n\n  BRHackViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };\n  BRHackViewDesc.prototype.matchesHack = function matchesHack () { return this.dirty == NOT_DIRTY };\n\n  return BRHackViewDesc;\n}(ViewDesc));\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.\nvar CustomNodeViewDesc = (function (NodeViewDesc) {\n  function CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view, pos) {\n    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos);\n    this.spec = spec;\n  }\n\n  if ( NodeViewDesc ) CustomNodeViewDesc.__proto__ = NodeViewDesc;\n  CustomNodeViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );\n  CustomNodeViewDesc.prototype.constructor = CustomNodeViewDesc;\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  CustomNodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {\n    if (this.dirty == NODE_DIRTY) { return false }\n    if (this.spec.update) {\n      var result$$1 = this.spec.update(node, outerDeco);\n      if (result$$1) { this.updateInner(node, outerDeco, innerDeco, view); }\n      return result$$1\n    } else if (!this.contentDOM && !node.isLeaf) {\n      return false\n    } else {\n      return NodeViewDesc.prototype.update.call(this, node, outerDeco, innerDeco, view)\n    }\n  };\n\n  CustomNodeViewDesc.prototype.selectNode = function selectNode () {\n    this.spec.selectNode ? this.spec.selectNode() : NodeViewDesc.prototype.selectNode.call(this);\n  };\n\n  CustomNodeViewDesc.prototype.deselectNode = function deselectNode () {\n    this.spec.deselectNode ? this.spec.deselectNode() : NodeViewDesc.prototype.deselectNode.call(this);\n  };\n\n  CustomNodeViewDesc.prototype.setSelection = function setSelection (anchor, head, root, force) {\n    this.spec.setSelection ? this.spec.setSelection(anchor, head, root)\n      : NodeViewDesc.prototype.setSelection.call(this, anchor, head, root, force);\n  };\n\n  CustomNodeViewDesc.prototype.destroy = function destroy () {\n    if (this.spec.destroy) { this.spec.destroy(); }\n    NodeViewDesc.prototype.destroy.call(this);\n  };\n\n  CustomNodeViewDesc.prototype.stopEvent = function stopEvent (event) {\n    return this.spec.stopEvent ? this.spec.stopEvent(event) : false\n  };\n\n  CustomNodeViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {\n    return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : NodeViewDesc.prototype.ignoreMutation.call(this, mutation)\n  };\n\n  return CustomNodeViewDesc;\n}(NodeViewDesc));\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) {\n  var dom = parentDOM.firstChild;\n  for (var i = 0; i < descs.length; i++) {\n    var desc = descs[i], childDOM = desc.dom;\n    if (childDOM.parentNode == parentDOM) {\n      while (childDOM != dom) { dom = rm(dom); }\n      dom = dom.nextSibling;\n    } else {\n      parentDOM.insertBefore(childDOM, dom);\n    }\n    if (desc instanceof MarkViewDesc) {\n      var pos = dom ? dom.previousSibling : parentDOM.lastChild;\n      renderDescs(desc.contentDOM, desc.children);\n      dom = pos ? pos.nextSibling : parentDOM.firstChild;\n    }\n  }\n  while (dom) { dom = rm(dom); }\n}\n\nfunction OuterDecoLevel(nodeName) {\n  if (nodeName) { this.nodeName = nodeName; }\n}\nOuterDecoLevel.prototype = Object.create(null);\n\nvar noDeco = [new OuterDecoLevel];\n\nfunction computeOuterDeco(outerDeco, node, needsWrap) {\n  if (outerDeco.length == 0) { return noDeco }\n\n  var top = needsWrap ? noDeco[0] : new OuterDecoLevel, result$$1 = [top];\n\n  for (var i = 0; i < outerDeco.length; i++) {\n    var attrs = outerDeco[i].type.attrs, cur = top;\n    if (!attrs) { continue }\n    if (attrs.nodeName)\n      { result$$1.push(cur = new OuterDecoLevel(attrs.nodeName)); }\n\n    for (var name in attrs) {\n      var val = attrs[name];\n      if (val == null) { continue }\n      if (needsWrap && result$$1.length == 1)\n        { result$$1.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$$1\n}\n\nfunction patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {\n  // Shortcut for trivial case\n  if (prevComputed == noDeco && curComputed == noDeco) { return nodeDOM }\n\n  var curDOM = nodeDOM;\n  for (var i = 0; i < curComputed.length; i++) {\n    var deco = curComputed[i], prev = prevComputed[i];\n    if (i) {\n      var parent = (void 0);\n      if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&\n          (parent = nodeDOM.parentNode) && parent.tagName.toLowerCase() == deco.nodeName) {\n        curDOM = parent;\n      } else {\n        parent = document.createElement(deco.nodeName);\n        parent.appendChild(curDOM);\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 (var name in prev)\n    { if (name != \"class\" && name != \"style\" && name != \"nodeName\" && !(name in cur))\n      { dom.removeAttribute(name); } }\n  for (var name$1 in cur)\n    { if (name$1 != \"class\" && name$1 != \"style\" && name$1 != \"nodeName\" && cur[name$1] != prev[name$1])\n      { dom.setAttribute(name$1, cur[name$1]); } }\n  if (prev.class != cur.class) {\n    var prevList = prev.class ? prev.class.split(\" \") : nothing;\n    var curList = cur.class ? cur.class.split(\" \") : nothing;\n    for (var i = 0; i < prevList.length; i++) { if (curList.indexOf(prevList[i]) == -1)\n      { dom.classList.remove(prevList[i]); } }\n    for (var i$1 = 0; i$1 < curList.length; i$1++) { if (prevList.indexOf(curList[i$1]) == -1)\n      { dom.classList.add(curList[i$1]); } }\n  }\n  if (prev.style != cur.style) {\n    if (prev.style) {\n      var prop = /\\s*([\\w\\-\\xa1-\\uffff]+)\\s*:(?:\"(?:\\\\.|[^\"])*\"|'(?:\\\\.|[^'])*'|\\(.*?\\)|[^;])*/g, m;\n      while (m = prop.exec(prev.style))\n        { dom.style[m[1].toLowerCase()] = \"\"; }\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 (var 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  var 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.\nvar ViewTreeUpdater = function ViewTreeUpdater(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  var pre = preMatch(top.node.content, top.children);\n  this.preMatched = pre.nodes;\n  this.preMatchOffset = pre.offset;\n};\n\nViewTreeUpdater.prototype.getPreMatch = function 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`.\nViewTreeUpdater.prototype.destroyBetween = function destroyBetween (start, end) {\n    var this$1 = this;\n\n  if (start == end) { return }\n  for (var i = start; i < end; i++) { this$1.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`.\nViewTreeUpdater.prototype.destroyRest = function 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.\nViewTreeUpdater.prototype.syncToMarks = function syncToMarks (marks, inline, view) {\n    var this$1 = this;\n\n  var keep = 0, depth = this.stack.length >> 1;\n  var 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$1.destroyRest();\n    this$1.top.dirty = NOT_DIRTY;\n    this$1.index = this$1.stack.pop();\n    this$1.top = this$1.stack.pop();\n    depth--;\n  }\n  while (depth < marks.length) {\n    this$1.stack.push(this$1.top, this$1.index + 1);\n    var found = -1;\n    for (var i = this.index; i < Math.min(this.index + 3, this.top.children.length); i++) {\n      if (this$1.top.children[i].matchesMark(marks[depth])) { found = i; break }\n    }\n    if (found > -1) {\n      if (found > this$1.index) {\n        this$1.changed = true;\n        this$1.destroyBetween(this$1.index, found);\n      }\n      this$1.top = this$1.top.children[this$1.index];\n    } else {\n      var markDesc = MarkViewDesc.create(this$1.top, marks[depth], inline, view);\n      this$1.top.children.splice(this$1.index, 0, markDesc);\n      this$1.top = markDesc;\n      this$1.changed = true;\n    }\n    this$1.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.\nViewTreeUpdater.prototype.findNodeMatch = function findNodeMatch (node, outerDeco, innerDeco, index) {\n    var this$1 = this;\n\n  var 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 (var i = this.index, e = Math.min(children.length, i + 5); i < e; i++) {\n      var child = children[i];\n      if (child.matchesNode(node, outerDeco, innerDeco) && this$1.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.\nViewTreeUpdater.prototype.updateNextNode = function updateNextNode (node, outerDeco, innerDeco, view, index) {\n  if (this.index == this.top.children.length) { return false }\n  var next = this.top.children[this.index];\n  if (next instanceof NodeViewDesc) {\n    var preMatch = this.preMatched.indexOf(next);\n    if (preMatch > -1 && preMatch + this.preMatchOffset != index) { return false }\n    var 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    var 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      if (next.dom != nextDOM) { this.changed = true; }\n      this.index++;\n      return true\n    }\n  }\n  return false\n};\n\n// : (Node, [Decoration], DecorationSet, EditorView)\n// Insert the node as a newly created node desc.\nViewTreeUpdater.prototype.addNode = function 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\nViewTreeUpdater.prototype.placeWidget = function placeWidget (widget, view, pos) {\n  if (this.index < this.top.children.length && this.top.children[this.index].matchesWidget(widget)) {\n    this.index++;\n  } else {\n    var 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.\nViewTreeUpdater.prototype.addTextblockHacks = function addTextblockHacks () {\n  var 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      var 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// : (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  var result$$1 = [], end = frag.childCount;\n  for (var i = descs.length - 1; end > 0 && i >= 0; i--) {\n    var desc = descs[i], node = desc.node;\n    if (!node) { continue }\n    if (node != frag.child(end - 1)) { break }\n    result$$1.push(desc);\n    --end;\n  }\n  return {nodes: result$$1.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  var locals = deco.locals(parent), offset = 0;\n  // Simple, cheap variant for when there are no local decorations\n  if (locals.length == 0) {\n    for (var i = 0; i < parent.childCount; i++) {\n      var child = parent.child(i);\n      onNode(child, locals, deco.forChild(offset, child), i);\n      offset += child.nodeSize;\n    }\n    return\n  }\n\n  var decoIndex = 0, active = [], restNode = null;\n  for (var parentIndex = 0;;) {\n    if (decoIndex < locals.length && locals[decoIndex].to == offset) {\n      var widget = locals[decoIndex++], widgets = (void 0);\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 (var i$1 = 0; i$1 < widgets.length; i$1++) { onWidget(widgets[i$1], parentIndex); }\n      } else {\n        onWidget(widget, parentIndex);\n      }\n    }\n\n    var child$1 = (void 0), index = (void 0);\n    if (restNode) {\n      index = -1;\n      child$1 = restNode;\n      restNode = null;\n    } else if (parentIndex < parent.childCount) {\n      index = parentIndex;\n      child$1 = parent.child(parentIndex++);\n    } else {\n      break\n    }\n\n    for (var i$2 = 0; i$2 < active.length; i$2++) { if (active[i$2].to <= offset) { active.splice(i$2--, 1); } }\n    while (decoIndex < locals.length && locals[decoIndex].from == offset) { active.push(locals[decoIndex++]); }\n\n    var end = offset + child$1.nodeSize;\n    if (child$1.isText) {\n      var cutAt = end;\n      if (decoIndex < locals.length && locals[decoIndex].from < cutAt) { cutAt = locals[decoIndex].from; }\n      for (var i$3 = 0; i$3 < active.length; i$3++) { if (active[i$3].to < cutAt) { cutAt = active[i$3].to; } }\n      if (cutAt < end) {\n        restNode = child$1.cut(cutAt - offset);\n        child$1 = child$1.cut(0, cutAt - offset);\n        end = cutAt;\n        index = -1;\n      }\n    }\n\n    onNode(child$1, active.length ? active.slice() : nothing, deco.forChild(offset, child$1), 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    var 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 (var str = \"\", i = 0, childPos = 0; i < frag.childCount; i++) {\n    var child = frag.child(i), end = childPos + child.nodeSize;\n    if (child.isText) {\n      str += child.text;\n      if (end >= to) {\n        var strStart = end - str.length, found = str.lastIndexOf(text);\n        while (found > -1 && strStart + found > from) { found = str.lastIndexOf(text, found - 1); }\n        if (found > -1 && strStart + found + text.length >= to) {\n          return strStart + found\n        } else if (end > to) {\n          break\n        }\n      }\n    } else {\n      str = \"\";\n    }\n    childPos = end;\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  var result$$1 = [];\n  for (var i = 0, off = 0; i < nodes.length; i++) {\n    var child = nodes[i], start = off, end = off += child.size;\n    if (start >= to || end <= from) {\n      result$$1.push(child);\n    } else {\n      if (start < from) { result$$1.push(child.slice(0, from - start, view)); }\n      if (replacement) {\n        result$$1.push(replacement);\n        replacement = null;\n      }\n      if (end > to) { result$$1.push(child.slice(to - start, child.size, view)); }\n    }\n  }\n  return result$$1\n}\n\nfunction moveSelectionBlock(state, dir) {\n  var ref = state.selection;\n  var $anchor = ref.$anchor;\n  var $head = ref.$head;\n  var $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);\n  var $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null;\n  return $start && prosemirrorState.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  var sel = view.state.selection;\n  if (sel instanceof prosemirrorState.TextSelection) {\n    if (!sel.empty || mods.indexOf(\"s\") > -1) {\n      return false\n    } else if (view.endOfTextblock(dir > 0 ? \"right\" : \"left\")) {\n      var next = moveSelectionBlock(view.state, dir);\n      if (next && (next instanceof prosemirrorState.NodeSelection)) { return apply(view, next) }\n      return false\n    } else {\n      var $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc;\n      if (!node || node.isText) { return false }\n      var nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;\n      if (!(node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM)) { return false }\n      if (prosemirrorState.NodeSelection.isSelectable(node)) {\n        return apply(view, new prosemirrorState.NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head))\n      } else if (result.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 prosemirrorState.TextSelection(view.state.doc.resolve(dir < 0 ? nodePos : nodePos + node.nodeSize)))\n      } else {\n        return false\n      }\n    }\n  } else if (sel instanceof prosemirrorState.NodeSelection && sel.node.isInline) {\n    return apply(view, new prosemirrorState.TextSelection(dir > 0 ? sel.$to : sel.$from))\n  } else {\n    var next$1 = moveSelectionBlock(view.state, dir);\n    if (next$1) { return apply(view, next$1) }\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  var 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  var sel = view.root.getSelection();\n  var node = sel.focusNode, offset = sel.focusOffset;\n  if (!node) { return }\n  var 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 (result.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        var 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      var 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  var sel = view.root.getSelection();\n  var node = sel.focusNode, offset = sel.focusOffset;\n  if (!node) { return }\n  var len = nodeLen(node);\n  var moveNode, moveOffset;\n  for (;;) {\n    if (offset < len) {\n      if (node.nodeType != 1) { break }\n      var 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      var 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  var desc = dom.pmViewDesc;\n  return desc && desc.node && desc.node.isBlock\n}\n\nfunction setSelFocus(view, sel, node, offset) {\n  if (selectionCollapsed(sel)) {\n    var 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}\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  var sel = view.state.selection;\n  if (sel instanceof prosemirrorState.TextSelection && !sel.empty || mods.indexOf(\"s\") > -1) { return false }\n  var $from = sel.$from;\n  var $to = sel.$to;\n\n  if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? \"up\" : \"down\")) {\n    var next = moveSelectionBlock(view.state, dir);\n    if (next && (next instanceof prosemirrorState.NodeSelection))\n      { return apply(view, next) }\n  }\n  if (!$from.parent.inlineContent) {\n    var beyond = prosemirrorState.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 prosemirrorState.TextSelection)) { return true }\n  var ref = view.state.selection;\n  var $head = ref.$head;\n  var $anchor = ref.$anchor;\n  var empty = ref.empty;\n  if (!$head.sameParent($anchor)) { return true }\n  if (!empty) { return false }\n  if (view.endOfTextblock(dir > 0 ? \"forward\" : \"backward\")) { return true }\n  var nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);\n  if (nextNode && !nextNode.isText) {\n    var 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 / https://bugs.chromium.org/p/chromium/issues/detail?id=903821\n// In which Chrome does really wrong things when the down arrow is\n// pressed when the cursor is directly at the start of a textblock and\n// has an uneditable node after it\nfunction chromeDownArrowBug(view) {\n  if (!result.chrome || view.state.selection.$head.parentOffset > 0) { return }\n  var ref = view.root.getSelection();\n  var focusNode = ref.focusNode;\n  var focusOffset = ref.focusOffset;\n  if (focusNode && focusNode.nodeType == 1 && focusOffset == 0 &&\n      focusNode.firstChild && focusNode.firstChild.contentEditable == \"false\") {\n    var child = focusNode.firstChild;\n    switchEditable(view, child, true);\n    setTimeout(function () { return 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  var result$$1 = \"\";\n  if (event.ctrlKey) { result$$1 += \"c\"; }\n  if (event.metaKey) { result$$1 += \"m\"; }\n  if (event.altKey) { result$$1 += \"a\"; }\n  if (event.shiftKey) { result$$1 += \"s\"; }\n  return result$$1\n}\n\nfunction captureKeyDown(view, event) {\n  var code = event.keyCode, mods = getMods(event);\n  if (code == 8 || (result.mac && code == 72 && mods == \"c\")) { // Backspace, Ctrl-h on Mac\n    return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodesLeft(view)\n  } else if (code == 46 || (result.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 chromeDownArrowBug(view) || selectVertically(view, 1, mods) || skipIgnoredNodesRight(view)\n  } else if (mods == (result.mac ? \"m\" : \"c\") &&\n             (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]\n    return true\n  }\n  return false\n}\n\nfunction selectionFromDOM(view, origin) {\n  var domSel = view.root.getSelection(), doc = view.state.doc;\n  var nearestDesc = view.docView.nearestDesc(domSel.focusNode), inWidget = nearestDesc && nearestDesc.size == 0;\n  var head = view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset);\n  var $head = doc.resolve(head), $anchor, selection;\n  if (selectionCollapsed(domSel)) {\n    $anchor = $head;\n    while (nearestDesc && !nearestDesc.node) { nearestDesc = nearestDesc.parent; }\n    if (nearestDesc && nearestDesc.node.isAtom && prosemirrorState.NodeSelection.isSelectable(nearestDesc.node) && nearestDesc.parent) {\n      var pos = nearestDesc.posBefore;\n      selection = new prosemirrorState.NodeSelection(head == pos ? $head : doc.resolve(pos));\n    }\n  } else {\n    $anchor = doc.resolve(view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset));\n  }\n\n  if (!selection) {\n    var bias = origin == \"pointer\" || (view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;\n    selection = selectionBetween(view, $anchor, $head, bias);\n  }\n  return selection\n}\n\nfunction selectionToDOM(view, takeFocus, force) {\n  var sel = view.state.selection;\n  syncNodeSelection(view, sel);\n\n  if (view.editable && !view.hasFocus()) {\n    if (!takeFocus) { return }\n    // See https://bugzilla.mozilla.org/show_bug.cgi?id=921444\n    if (result.gecko && result.gecko_version <= 55) {\n      view.domObserver.disconnectSelection();\n      view.dom.focus();\n      view.domObserver.connectSelection();\n    }\n  } else if (!view.editable && !(hasSelection(view) && document.activeElement.contains(view.dom)) && !takeFocus) {\n    return\n  }\n\n  view.domObserver.disconnectSelection();\n\n  if (view.cursorWrapper) {\n    selectCursorWrapper(view);\n  } else {\n    var anchor = sel.anchor;\n    var head = sel.head;\n    var resetEditableFrom, resetEditableTo;\n    if (brokenSelectBetweenUneditable && !(sel instanceof prosemirrorState.TextSelection)) {\n      if (!sel.$from.parent.inlineContent)\n        { resetEditableFrom = temporarilyEditableNear(view, sel.from); }\n      if (!sel.empty && !sel.$from.parent.inlineContent)\n        { resetEditableTo = temporarilyEditableNear(view, sel.to); }\n    }\n    view.docView.setSelection(anchor, head, view.root, force);\n    if (brokenSelectBetweenUneditable) {\n      if (resetEditableFrom) { resetEditableFrom.contentEditable = \"false\"; }\n      if (resetEditableTo) { resetEditableTo.contentEditable = \"false\"; }\n    }\n    if (sel.visible) {\n      view.dom.classList.remove(\"ProseMirror-hideselection\");\n    } else if (anchor != head) {\n      view.dom.classList.add(\"ProseMirror-hideselection\");\n      if (\"onselectionchange\" in document) { removeClassOnSelectionChange(view); }\n    }\n  }\n\n  view.domObserver.setCurSelection();\n  view.domObserver.connectSelection();\n}\n\n// Kludge to work around Webkit not allowing a selection to start/end\n// between non-editable block nodes. We briefly make something\n// editable, set the selection, then set it uneditable again.\n\nvar brokenSelectBetweenUneditable = result.safari || result.chrome && result.chrome_version < 63;\n\nfunction temporarilyEditableNear(view, pos) {\n  var ref = view.docView.domFromPos(pos);\n  var node = ref.node;\n  var offset = ref.offset;\n  var after = offset < node.childNodes.length ? node.childNodes[offset] : null;\n  var before = offset ? node.childNodes[offset - 1] : null;\n  if ((!after || after.contentEditable == \"false\") && (!before || before.contentEditable == \"false\")) {\n    if (after) {\n      after.contentEditable = \"true\";\n      return after\n    } else if (before) {\n      before.contentEditable = \"true\";\n      return before\n    }\n  }\n}\n\nfunction removeClassOnSelectionChange(view) {\n  var doc = view.dom.ownerDocument;\n  doc.removeEventListener(\"selectionchange\", view.hideSelectionGuard);\n  var domSel = view.root.getSelection();\n  var node = domSel.anchorNode, offset = domSel.anchorOffset;\n  doc.addEventListener(\"selectionchange\", view.hideSelectionGuard = function () {\n    if (domSel.anchorNode != node || domSel.anchorOffset != offset) {\n      doc.removeEventListener(\"selectionchange\", view.hideSelectionGuard);\n      view.dom.classList.remove(\"ProseMirror-hideselection\");\n    }\n  });\n}\n\nfunction selectCursorWrapper(view) {\n  var domSel = view.root.getSelection(), range = document.createRange();\n  var node = view.cursorWrapper.dom, img = node.nodeName == \"IMG\";\n  if (img) { range.setEnd(node.parentNode, domIndex(node) + 1); }\n  else { range.setEnd(node, 0); }\n  range.collapse(false);\n  domSel.removeAllRanges();\n  domSel.addRange(range);\n  // Kludge to kill 'control selection' in IE11 when selecting an\n  // invisible cursor wrapper, since that would result in those weird\n  // resize handles and a selection that considers the absolutely\n  // positioned wrapper, rather than the root editable node, the\n  // focused element.\n  if (!img && !view.state.selection.visible && result.ie && result.ie_version <= 11) {\n    node.disabled = true;\n    node.disabled = false;\n  }\n}\n\nfunction syncNodeSelection(view, sel) {\n  if (sel instanceof prosemirrorState.NodeSelection) {\n    var desc = view.docView.descAt(sel.from);\n    if (desc != view.lastSelectedViewDesc) {\n      clearNodeSelection(view);\n      if (desc) { desc.selectNode(); }\n      view.lastSelectedViewDesc = desc;\n    }\n  } else {\n    clearNodeSelection(view);\n  }\n}\n\n// Clear all DOM statefulness of the last node selection.\nfunction clearNodeSelection(view) {\n  if (view.lastSelectedViewDesc) {\n    if (view.lastSelectedViewDesc.parent)\n      { view.lastSelectedViewDesc.deselectNode(); }\n    view.lastSelectedViewDesc = null;\n  }\n}\n\nfunction selectionBetween(view, $anchor, $head, bias) {\n  return view.someProp(\"createSelectionBetween\", function (f) { return f(view, $anchor, $head); })\n    || prosemirrorState.TextSelection.between($anchor, $head, bias)\n}\n\nfunction hasFocusAndSelection(view) {\n  if (view.editable && view.root.activeElement != view.dom) { return false }\n  return hasSelection(view)\n}\n\nfunction hasSelection(view) {\n  var sel = view.root.getSelection();\n  if (!sel.anchorNode) { return false }\n  try {\n    // Firefox will raise 'permission denied' errors when accessing\n    // properties of `sel.anchorNode` when it's in a generated CSS\n    // element.\n    return view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode) &&\n      (view.editable || view.dom.contains(sel.focusNode.nodeType == 3 ? sel.focusNode.parentNode : sel.focusNode))\n  } catch(_) {\n    return false\n  }\n}\n\nfunction anchorInRightPlace(view) {\n  var anchorDOM = view.docView.domFromPos(view.state.selection.anchor);\n  var domSel = view.root.getSelection();\n  return isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset)\n}\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  var ref = view.docView.parseRange(from_, to_);\n  var parent = ref.node;\n  var fromOffset = ref.fromOffset;\n  var toOffset = ref.toOffset;\n  var from = ref.from;\n  var to = ref.to;\n\n  var 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 (result.chrome && view.lastKeyCode === 8) {\n    for (var off = toOffset; off > fromOffset; off--) {\n      var 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  var startDoc = view.state.doc;\n  var parser = view.someProp(\"domParser\") || prosemirrorModel.DOMParser.fromSchema(view.state.schema);\n  var $from = startDoc.resolve(from);\n\n  var 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: ruleFromNode(parser, $from),\n    context: $from\n  });\n  if (find && find[0].pos != null) {\n    var anchor$1 = find[0].pos, head = find[1] && find[1].pos;\n    if (head == null) { head = anchor$1; }\n    sel = {anchor: anchor$1 + from, head: head + from};\n  }\n  return {doc: doc, sel: sel, from: from, to: to}\n}\n\nfunction ruleFromNode(parser, context) {\n  return function (dom) {\n    var 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 (result.safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName))\n        { return parser.matchTag(document.createElement(\"li\"), context) }\n      else if (dom.parentNode.lastChild == dom || result.safari && /^(tr|table)$/i.test(dom.parentNode.nodeName))\n        { return {ignore: true} }\n    } else if (dom.nodeName == \"IMG\" && dom.getAttribute(\"mark-placeholder\")) {\n      return {ignore: true}\n    }\n  }\n}\n\nfunction readDOMChange(view, from, to, typeOver) {\n  if (from < 0) {\n    var origin = view.lastSelectionTime > Date.now() - 50 ? view.lastSelectionOrigin : null;\n    var newSel = selectionFromDOM(view, origin);\n    if (!view.state.selection.eq(newSel)) {\n      var tr$1 = view.state.tr.setSelection(newSel);\n      if (origin == \"pointer\") { tr$1.setMeta(\"pointer\", true); }\n      else if (origin == \"key\") { tr$1.scrollIntoView(); }\n      view.dispatch(tr$1);\n    }\n    return\n  }\n\n  var $before = view.state.doc.resolve(from);\n  var shared = $before.sharedDepth(to);\n  from = $before.before(shared + 1);\n  to = view.state.doc.resolve(to).after(shared + 1);\n\n  var sel = view.state.selection;\n  var parse = parseBetween(view, from, to);\n\n  var doc = view.state.doc, compare = doc.slice(parse.from, parse.to);\n  var 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  var change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);\n  if (!change) {\n    if (typeOver && sel instanceof prosemirrorState.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        var sel$1 = resolveSelection(view, view.state.doc, parse.sel);\n        if (sel$1 && !sel$1.eq(view.state.selection)) { view.dispatch(view.state.tr.setSelection(sel$1)); }\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 prosemirrorState.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 (result.ie && result.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  var $from = parse.doc.resolveNoCache(change.start - parse.from);\n  var $to = parse.doc.resolveNoCache(change.endB - parse.from);\n  var nextSel;\n  // If this looks like the effect of pressing Enter, just dispatch an\n  // Enter key instead.\n  if (!$from.sameParent($to) && $from.pos < parse.doc.content.size &&\n      (nextSel = prosemirrorState.Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&\n      nextSel.head == $to.pos &&\n      view.someProp(\"handleKeyDown\", function (f) { return f(view, keyEvent(13, \"Enter\")); }))\n    { return }\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\", function (f) { return f(view, keyEvent(8, \"Backspace\")); })) {\n    if (result.android && result.chrome) { view.domObserver.suppressSelectionUpdates(); } // #820\n    return\n  }\n\n  var chFrom = change.start, chTo = change.endA;\n\n  var tr, storedMarks, markChange, $from1;\n  if ($from.sameParent($to) && $from.parent.inlineContent) {\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 (result.ie && result.ie_version <= 11 && $from.parentOffset == 0) {\n        view.domObserver.suppressSelectionUpdates();\n        setTimeout(function () { return 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      var text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);\n      if (view.someProp(\"handleTextInput\", function (f) { return 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    var sel$2 = resolveSelection(view, tr.doc, parse.sel);\n    if (sel$2) { tr.setSelection(sel$2); }\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  var curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks;\n  var added = curMarks, removed = prevMarks, type, mark, update;\n  for (var i = 0; i < prevMarks.length; i++) { added = prevMarks[i].removeFromSet(added); }\n  for (var i$1 = 0; i$1 < curMarks.length; i$1++) { removed = curMarks[i$1].removeFromSet(removed); }\n  if (added.length == 1 && removed.length == 0) {\n    mark = added[0];\n    type = \"add\";\n    update = function (node) { return node.mark(mark.addToSet(node.marks)); };\n  } else if (added.length == 0 && removed.length == 1) {\n    mark = removed[0];\n    type = \"remove\";\n    update = function (node) { return node.mark(mark.removeFromSet(node.marks)); };\n  } else {\n    return null\n  }\n  var updated = [];\n  for (var i$2 = 0; i$2 < prev.childCount; i$2++) { updated.push(update(prev.child(i$2))); }\n  if (prosemirrorModel.Fragment.from(updated).eq(cur)) { return {mark: mark, type: 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  var $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  var $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  var 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    var 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  var start = a.findDiffStart(b, pos);\n  if (start == null) { return null }\n  var ref = a.findDiffEnd(b, pos + a.size, pos + b.size);\n  var endA = ref.a;\n  var endB = ref.b;\n  if (preferredSide == \"end\") {\n    var adjust = Math.max(0, start - Math.min(endA, endB));\n    preferredPos -= endA + adjust - start;\n  }\n  if (endA < start && a.size < b.size) {\n    var 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    var move$1 = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;\n    start -= move$1;\n    endA = start + (endA - endB);\n    endB = start;\n  }\n  return {start: start, endA: endA, endB: endB}\n}\n\nfunction serializeForClipboard(view, slice) {\n  var context = [];\n  var content = slice.content;\n  var openStart = slice.openStart;\n  var openEnd = slice.openEnd;\n  while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {\n    openStart--;\n    openEnd--;\n    var node = content.firstChild;\n    context.push(node.type.name, node.type.hasRequiredAttrs() ? node.attrs : null);\n    content = node.content;\n  }\n\n  var serializer = view.someProp(\"clipboardSerializer\") || prosemirrorModel.DOMSerializer.fromSchema(view.state.schema);\n  var doc = detachedDoc(), wrap = doc.createElement(\"div\");\n  wrap.appendChild(serializer.serializeFragment(content, {document: doc}));\n\n  var firstChild = wrap.firstChild, needsWrap;\n  while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {\n    for (var i = needsWrap.length - 1; i >= 0; i--) {\n      var 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  var text = view.someProp(\"clipboardTextSerializer\", function (f) { return f(slice); }) ||\n      slice.content.textBetween(0, slice.content.size, \"\\n\\n\");\n\n  return {dom: wrap, text: text}\n}\n\n// : (EditorView, string, string, ?bool, ResolvedPos) → ?Slice\n// Read a slice of content from the clipboard (or drop data).\nfunction parseFromClipboard(view, text, html, plainText, $context) {\n  var dom, inCode = $context.parent.type.spec.code, slice;\n  if (!html && !text) { return null }\n  var asText = text && (plainText || inCode || !html);\n  if (asText) {\n    view.someProp(\"transformPastedText\", function (f) { text = f(text); });\n    if (inCode) { return new prosemirrorModel.Slice(prosemirrorModel.Fragment.from(view.state.schema.text(text)), 0, 0) }\n    var parsed = view.someProp(\"clipboardTextParser\", function (f) { return f(text, $context); });\n    if (parsed) {\n      slice = parsed;\n    } else {\n      dom = document.createElement(\"div\");\n      text.trim().split(/(?:\\r\\n?|\\n)+/).forEach(function (block) {\n        dom.appendChild(document.createElement(\"p\")).textContent = block;\n      });\n    }\n  } else {\n    view.someProp(\"transformPastedHTML\", function (f) { html = f(html); });\n    dom = readHTML(html);\n  }\n\n  var contextNode = dom && dom.querySelector(\"[data-pm-slice]\");\n  var sliceData = contextNode && /^(\\d+) (\\d+) (.*)/.exec(contextNode.getAttribute(\"data-pm-slice\"));\n  if (!slice) {\n    var parser = view.someProp(\"clipboardParser\") || view.someProp(\"domParser\") || prosemirrorModel.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 = prosemirrorModel.Slice.maxOpen(normalizeSiblings(slice.content, $context), false); }\n\n  view.someProp(\"transformPasted\", function (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  var loop = function ( d ) {\n    var parent = $context.node(d);\n    var match = parent.contentMatchAt($context.index(d));\n    var lastWrap = (void 0), result = [];\n    fragment.forEach(function (node) {\n      if (!result) { return }\n      var 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        var 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 { v: prosemirrorModel.Fragment.from(result) } }\n  };\n\n  for (var d = $context.depth; d >= 0; d--) {\n    var returned = loop( d );\n\n    if ( returned ) return returned.v;\n  }\n  return fragment\n}\n\nfunction withWrappers(node, wrap, from) {\n  if ( from === void 0 ) from = 0;\n\n  for (var i = wrap.length - 1; i >= from; i--)\n    { node = wrap[i].create(null, prosemirrorModel.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    var inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);\n    if (inner) { return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner)) }\n    var 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(prosemirrorModel.Fragment.from(withWrappers(node, wrap, depth + 1)))) }\n  }\n}\n\nfunction closeRight(node, depth) {\n  if (depth == 0) { return node }\n  var fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));\n  var fill = node.contentMatchAt(node.childCount).fillBefore(prosemirrorModel.Fragment.empty, true);\n  return node.copy(fragment.append(fill))\n}\n\nfunction closeRange(fragment, side, from, to, depth, openEnd) {\n  var 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(prosemirrorModel.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 prosemirrorModel.Slice(closeRange(slice.content, -1, openStart, slice.openStart, 0, slice.openEnd), openStart, slice.openEnd); }\n  if (openEnd < slice.openEnd)\n    { slice = new prosemirrorModel.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.\nvar wrapMap = {thead: [\"table\"], colgroup: [\"table\"], col: [\"table\", \"colgroup\"],\n                 tr: [\"table\", \"tbody\"], td: [\"table\", \"tbody\", \"tr\"], th: [\"table\", \"tbody\", \"tr\"]};\n\nvar _detachedDoc = null;\nfunction detachedDoc() {\n  return _detachedDoc || (_detachedDoc = document.implementation.createHTMLDocument(\"title\"))\n}\n\nfunction readHTML(html) {\n  var metas = /(\\s*<meta [^>]*>)*/.exec(html);\n  if (metas) { html = html.slice(metas[0].length); }\n  var elt = detachedDoc().createElement(\"div\");\n  var firstTag = /(?:<meta [^>]*>)*<([a-z][^>\\s]+)/i.exec(html), wrap, depth = 0;\n  if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()]) {\n    html = wrap.map(function (n) { return \"<\" + n + \">\"; }).join(\"\") + html + wrap.map(function (n) { return \"</\" + n + \">\"; }).reverse().join(\"\");\n    depth = wrap.length;\n  }\n  elt.innerHTML = html;\n  for (var i = 0; i < depth; i++) { elt = elt.firstChild; }\n  return elt\n}\n\nfunction addContext(slice, context) {\n  if (!slice.size) { return slice }\n  var schema = slice.content.firstChild.type.schema, array;\n  try { array = JSON.parse(context); }\n  catch(e) { return slice }\n  var content = slice.content;\n  var openStart = slice.openStart;\n  var openEnd = slice.openEnd;\n  for (var i = array.length - 2; i >= 0; i -= 2) {\n    var type = schema.nodes[array[i]];\n    if (!type || type.hasRequiredAttrs()) { break }\n    content = prosemirrorModel.Fragment.from(type.create(array[i + 1], content));\n    openStart++; openEnd++;\n  }\n  return new prosemirrorModel.Slice(content, openStart, openEnd)\n}\n\nvar observeOptions = {childList: true, characterData: true, attributes: true, subtree: true, characterDataOldValue: true};\n// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified\nvar useCharData = result.ie && result.ie_version <= 11;\n\nvar SelectionState = function SelectionState() {\n  this.anchorNode = this.anchorOffset = this.focusNode = this.focusOffset = null;\n};\n\nSelectionState.prototype.set = function set (sel) {\n  this.anchorNode = sel.anchorNode; this.anchorOffset = sel.anchorOffset;\n  this.focusNode = sel.focusNode; this.focusOffset = sel.focusOffset;\n};\n\nSelectionState.prototype.eq = function eq (sel) {\n  return sel.anchorNode == this.anchorNode && sel.anchorOffset == this.anchorOffset &&\n    sel.focusNode == this.focusNode && sel.focusOffset == this.focusOffset\n};\n\nvar DOMObserver = function DOMObserver(view, handleDOMChange) {\n  var this$1 = this;\n\n  this.view = view;\n  this.handleDOMChange = handleDOMChange;\n  this.queue = [];\n  this.flushingSoon = false;\n  this.observer = window.MutationObserver &&\n    new window.MutationObserver(function (mutations) {\n      for (var i = 0; i < mutations.length; i++) { this$1.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 (result.ie && result.ie_version <= 11 && mutations.some(\n        function (m) { return m.type == \"childList\" && m.removedNodes.length ||\n             m.type == \"characterData\" && m.oldValue.length > m.target.nodeValue.length; }))\n        { this$1.flushSoon(); }\n      else\n        { this$1.flush(); }\n    });\n  this.currentSelection = new SelectionState;\n  if (useCharData) {\n    this.onCharData = function (e) {\n      this$1.queue.push({target: e.target, type: \"characterData\", oldValue: e.prevValue});\n      this$1.flushSoon();\n    };\n  }\n  this.onSelectionChange = this.onSelectionChange.bind(this);\n  this.suppressingSelectionUpdates = false;\n};\n\nDOMObserver.prototype.flushSoon = function flushSoon () {\n    var this$1 = this;\n\n  if (!this.flushingSoon) {\n    this.flushingSoon = true;\n    window.setTimeout(function () { this$1.flushingSoon = false; this$1.flush(); }, 20);\n  }\n};\n\nDOMObserver.prototype.start = function 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\nDOMObserver.prototype.stop = function stop () {\n    var this$1 = this;\n\n  if (this.observer) {\n    var take = this.observer.takeRecords();\n    if (take.length) {\n      for (var i = 0; i < take.length; i++) { this$1.queue.push(take[i]); }\n      window.setTimeout(function () { return this$1.flush(); }, 20);\n    }\n    this.observer.disconnect();\n  }\n  if (useCharData) { this.view.dom.removeEventListener(\"DOMCharacterDataModified\", this.onCharData); }\n  this.disconnectSelection();\n};\n\nDOMObserver.prototype.connectSelection = function connectSelection () {\n  this.view.dom.ownerDocument.addEventListener(\"selectionchange\", this.onSelectionChange);\n};\n\nDOMObserver.prototype.disconnectSelection = function disconnectSelection () {\n  this.view.dom.ownerDocument.removeEventListener(\"selectionchange\", this.onSelectionChange);\n};\n\nDOMObserver.prototype.suppressSelectionUpdates = function suppressSelectionUpdates () {\n    var this$1 = this;\n\n  this.suppressingSelectionUpdates = true;\n  setTimeout(function () { return this$1.suppressingSelectionUpdates = false; }, 50);\n};\n\nDOMObserver.prototype.onSelectionChange = function 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 (result.ie && result.ie_version <= 11 && !this.view.state.selection.empty) {\n    var 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\nDOMObserver.prototype.setCurSelection = function setCurSelection () {\n  this.currentSelection.set(this.view.root.getSelection());\n};\n\nDOMObserver.prototype.ignoreSelectionChange = function ignoreSelectionChange (sel) {\n  if (sel.rangeCount == 0) { return true }\n  var container = sel.getRangeAt(0).commonAncestorContainer;\n  var desc = this.view.docView.nearestDesc(container);\n  return desc && desc.ignoreMutation({type: \"selection\", target: container.nodeType == 3 ? container.parentNode : container})\n};\n\nDOMObserver.prototype.flush = function flush () {\n    var this$1 = this;\n\n  if (!this.view.docView || this.flushingSoon) { return }\n  var 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  var sel = this.view.root.getSelection();\n  var newSel = !this.suppressingSelectionUpdates && !this.currentSelection.eq(sel) && hasSelection(this.view) && !this.ignoreSelectionChange(sel);\n\n  var from = -1, to = -1, typeOver = false;\n  if (this.view.editable) {\n    for (var i = 0; i < mutations.length; i++) {\n      var result$$1 = this$1.registerMutation(mutations[i]);\n      if (result$$1) {\n        from = from < 0 ? result$$1.from : Math.min(result$$1.from, from);\n        to = to < 0 ? result$$1.to : Math.max(result$$1.to, to);\n        if (result$$1.typeOver && !this$1.view.composing) { typeOver = true; }\n      }\n    }\n  }\n  if (from > -1 || newSel) {\n    if (from > -1) { this.view.docView.markDirty(from, to); }\n    this.handleDOMChange(from, to, typeOver);\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\nDOMObserver.prototype.registerMutation = function registerMutation (mut) {\n  var 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    var prev = mut.previousSibling, next = mut.nextSibling;\n    if (result.ie && result.ie_version <= 11 && mut.addedNodes.length) {\n      // IE11 gives us incorrect next/prev siblings for some\n      // insertions, to if there are added nodes, recompute those\n      for (var i = 0; i < mut.addedNodes.length; i++) {\n        var ref = mut.addedNodes[i];\n          var previousSibling = ref.previousSibling;\n          var nextSibling = ref.nextSibling;\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    var fromOffset = prev && prev.parentNode == mut.target\n        ? domIndex(prev) + 1 : 0;\n    var from = desc.localPosFromDOM(mut.target, fromOffset, -1);\n    var toOffset = next && next.parentNode == mut.target\n        ? domIndex(next) : mut.target.childNodes.length;\n    var to = desc.localPosFromDOM(mut.target, toOffset, 1);\n    return {from: from, to: 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// A collection of DOM events that occur within the editor, and callback functions\n// to invoke when the event fires.\nvar handlers = {};\nvar editHandlers = {};\n\nfunction initInput(view) {\n  view.shiftKey = false;\n  view.mouseDown = null;\n  view.lastKeyCode = null;\n  view.lastKeyCodeTime = 0;\n  view.lastClick = {time: 0, x: 0, y: 0, type: \"\"};\n  view.lastSelectionOrigin = null;\n  view.lastSelectionTime = 0;\n\n  view.composing = false;\n  view.composingTimeout = null;\n  view.compositionNodes = [];\n  view.compositionEndedAt = -2e8;\n\n  view.domObserver = new DOMObserver(view, function (from, to, typeOver) { return readDOMChange(view, from, to, typeOver); });\n  view.domObserver.start();\n  // Used by hacks like the beforeinput handler to check whether anything happened in the DOM\n  view.domChangeCount = 0;\n\n  view.eventHandlers = Object.create(null);\n  var loop = function ( event ) {\n    var handler = handlers[event];\n    view.dom.addEventListener(event, view.eventHandlers[event] = function (event) {\n      if (eventBelongsToView(view, event) && !runCustomHandler(view, event) &&\n          (view.editable || !(event.type in editHandlers)))\n        { handler(view, event); }\n    });\n  };\n\n  for (var event in handlers) loop( event );\n  // On Safari, for reasons beyond my understanding, adding an input\n  // event handler makes an issue where the composition vanishes when\n  // you press enter go away.\n  if (result.safari) { view.dom.addEventListener(\"input\", function () { return null; }); }\n\n  ensureListeners(view);\n}\n\nfunction setSelectionOrigin(view, origin) {\n  view.lastSelectionOrigin = origin;\n  view.lastSelectionTime = Date.now();\n}\n\nfunction destroyInput(view) {\n  view.domObserver.stop();\n  for (var type in view.eventHandlers)\n    { view.dom.removeEventListener(type, view.eventHandlers[type]); }\n  clearTimeout(view.composingTimeout);\n}\n\nfunction ensureListeners(view) {\n  view.someProp(\"handleDOMEvents\", function (currentHandlers) {\n    for (var type in currentHandlers) { if (!view.eventHandlers[type])\n      { view.dom.addEventListener(type, view.eventHandlers[type] = function (event) { return runCustomHandler(view, event); }); } }\n  });\n}\n\nfunction runCustomHandler(view, event) {\n  return view.someProp(\"handleDOMEvents\", function (handlers) {\n    var handler = handlers[event.type];\n    return handler ? handler(view, event) || event.defaultPrevented : false\n  })\n}\n\nfunction eventBelongsToView(view, event) {\n  if (!event.bubbles) { return true }\n  if (event.defaultPrevented) { return false }\n  for (var node = event.target; node != view.dom; node = node.parentNode)\n    { if (!node || node.nodeType == 11 ||\n        (node.pmViewDesc && node.pmViewDesc.stopEvent(event)))\n      { return false } }\n  return true\n}\n\nfunction dispatchEvent(view, event) {\n  if (!runCustomHandler(view, event) && handlers[event.type] &&\n      (view.editable || !(event.type in editHandlers)))\n    { handlers[event.type](view, event); }\n}\n\neditHandlers.keydown = function (view, event) {\n  view.shiftKey = event.keyCode == 16 || event.shiftKey;\n  if (inOrNearComposition(view, event)) { return }\n  view.lastKeyCode = event.keyCode;\n  view.lastKeyCodeTime = Date.now();\n  if (view.someProp(\"handleKeyDown\", function (f) { return f(view, event); }) || captureKeyDown(view, event))\n    { event.preventDefault(); }\n  else\n    { setSelectionOrigin(view, \"key\"); }\n};\n\neditHandlers.keyup = function (view, e) {\n  if (e.keyCode == 16) { view.shiftKey = false; }\n};\n\neditHandlers.keypress = function (view, event) {\n  if (inOrNearComposition(view, event) || !event.charCode ||\n      event.ctrlKey && !event.altKey || result.mac && event.metaKey) { return }\n\n  if (view.someProp(\"handleKeyPress\", function (f) { return f(view, event); })) {\n    event.preventDefault();\n    return\n  }\n\n  var sel = view.state.selection;\n  if (!(sel instanceof prosemirrorState.TextSelection) || !sel.$from.sameParent(sel.$to)) {\n    var text = String.fromCharCode(event.charCode);\n    if (!view.someProp(\"handleTextInput\", function (f) { return f(view, sel.$from.pos, sel.$to.pos, text); }))\n      { view.dispatch(view.state.tr.insertText(text).scrollIntoView()); }\n    event.preventDefault();\n  }\n};\n\nfunction eventCoords(event) { return {left: event.clientX, top: event.clientY} }\n\nfunction isNear(event, click) {\n  var dx = click.x - event.clientX, dy = click.y - event.clientY;\n  return dx * dx + dy * dy < 100\n}\n\nfunction runHandlerOnContext(view, propName, pos, inside, event) {\n  if (inside == -1) { return false }\n  var $pos = view.state.doc.resolve(inside);\n  var loop = function ( i ) {\n    if (view.someProp(propName, function (f) { return i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true)\n                                                    : f(view, pos, $pos.node(i), $pos.before(i), event, false); }))\n      { return { v: true } }\n  };\n\n  for (var i = $pos.depth + 1; i > 0; i--) {\n    var returned = loop( i );\n\n    if ( returned ) return returned.v;\n  }\n  return false\n}\n\nfunction updateSelection(view, selection, origin) {\n  if (!view.focused) { view.focus(); }\n  var tr = view.state.tr.setSelection(selection);\n  if (origin == \"pointer\") { tr.setMeta(\"pointer\", true); }\n  view.dispatch(tr);\n}\n\nfunction selectClickedLeaf(view, inside) {\n  if (inside == -1) { return false }\n  var $pos = view.state.doc.resolve(inside), node = $pos.nodeAfter;\n  if (node && node.isAtom && prosemirrorState.NodeSelection.isSelectable(node)) {\n    updateSelection(view, new prosemirrorState.NodeSelection($pos), \"pointer\");\n    return true\n  }\n  return false\n}\n\nfunction selectClickedNode(view, inside) {\n  if (inside == -1) { return false }\n  var sel = view.state.selection, selectedNode, selectAt;\n  if (sel instanceof prosemirrorState.NodeSelection) { selectedNode = sel.node; }\n\n  var $pos = view.state.doc.resolve(inside);\n  for (var i = $pos.depth + 1; i > 0; i--) {\n    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);\n    if (prosemirrorState.NodeSelection.isSelectable(node)) {\n      if (selectedNode && sel.$from.depth > 0 &&\n          i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos)\n        { selectAt = $pos.before(sel.$from.depth); }\n      else\n        { selectAt = $pos.before(i); }\n      break\n    }\n  }\n\n  if (selectAt != null) {\n    updateSelection(view, prosemirrorState.NodeSelection.create(view.state.doc, selectAt), \"pointer\");\n    return true\n  } else {\n    return false\n  }\n}\n\nfunction handleSingleClick(view, pos, inside, event, selectNode) {\n  return runHandlerOnContext(view, \"handleClickOn\", pos, inside, event) ||\n    view.someProp(\"handleClick\", function (f) { return f(view, pos, event); }) ||\n    (selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside))\n}\n\nfunction handleDoubleClick(view, pos, inside, event) {\n  return runHandlerOnContext(view, \"handleDoubleClickOn\", pos, inside, event) ||\n    view.someProp(\"handleDoubleClick\", function (f) { return f(view, pos, event); })\n}\n\nfunction handleTripleClick(view, pos, inside, event) {\n  return runHandlerOnContext(view, \"handleTripleClickOn\", pos, inside, event) ||\n    view.someProp(\"handleTripleClick\", function (f) { return f(view, pos, event); }) ||\n    defaultTripleClick(view, inside)\n}\n\nfunction defaultTripleClick(view, inside) {\n  var doc = view.state.doc;\n  if (inside == -1) {\n    if (doc.inlineContent) {\n      updateSelection(view, prosemirrorState.TextSelection.create(doc, 0, doc.content.size), \"pointer\");\n      return true\n    }\n    return false\n  }\n\n  var $pos = doc.resolve(inside);\n  for (var i = $pos.depth + 1; i > 0; i--) {\n    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);\n    var nodePos = $pos.before(i);\n    if (node.inlineContent)\n      { updateSelection(view, prosemirrorState.TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size), \"pointer\"); }\n    else if (prosemirrorState.NodeSelection.isSelectable(node))\n      { updateSelection(view, prosemirrorState.NodeSelection.create(doc, nodePos), \"pointer\"); }\n    else\n      { continue }\n    return true\n  }\n}\n\nfunction forceDOMFlush(view) {\n  return endComposition(view)\n}\n\nvar selectNodeModifier = result.mac ? \"metaKey\" : \"ctrlKey\";\n\nhandlers.mousedown = function (view, event) {\n  view.shiftKey = event.shiftKey;\n  var flushed = forceDOMFlush(view);\n  var now = Date.now(), type = \"singleClick\";\n  if (now - view.lastClick.time < 500 && isNear(event, view.lastClick) && !event[selectNodeModifier]) {\n    if (view.lastClick.type == \"singleClick\") { type = \"doubleClick\"; }\n    else if (view.lastClick.type == \"doubleClick\") { type = \"tripleClick\"; }\n  }\n  view.lastClick = {time: now, x: event.clientX, y: event.clientY, type: type};\n\n  var pos = view.posAtCoords(eventCoords(event));\n  if (!pos) { return }\n\n  if (type == \"singleClick\")\n    { view.mouseDown = new MouseDown(view, pos, event, flushed); }\n  else if ((type == \"doubleClick\" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event))\n    { event.preventDefault(); }\n  else\n    { setSelectionOrigin(view, \"pointer\"); }\n};\n\nvar MouseDown = function MouseDown(view, pos, event, flushed) {\n  var this$1 = this;\n\n  this.view = view;\n  this.startDoc = view.state.doc;\n  this.pos = pos;\n  this.event = event;\n  this.flushed = flushed;\n  this.selectNode = event[selectNodeModifier];\n  this.allowDefault = event.shiftKey;\n\n  var targetNode, targetPos;\n  if (pos.inside > -1) {\n    targetNode = view.state.doc.nodeAt(pos.inside);\n    targetPos = pos.inside;\n  } else {\n    var $pos = view.state.doc.resolve(pos.pos);\n    targetNode = $pos.parent;\n    targetPos = $pos.depth ? $pos.before() : 0;\n  }\n\n  this.mightDrag = null;\n\n  var target = flushed ? null : event.target;\n  var targetDesc = target ? view.docView.nearestDesc(target, true) : null;\n  this.target = targetDesc ? targetDesc.dom : null;\n\n  if (targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||\n      view.state.selection instanceof prosemirrorState.NodeSelection && targetPos == view.state.selection.from)\n    { this.mightDrag = {node: targetNode,\n                      pos: targetPos,\n                      addAttr: this.target && !this.target.draggable,\n                      setUneditable: this.target && result.gecko && !this.target.hasAttribute(\"contentEditable\")}; }\n\n  if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {\n    this.view.domObserver.stop();\n    if (this.mightDrag.addAttr) { this.target.draggable = true; }\n    if (this.mightDrag.setUneditable)\n      { setTimeout(function () { return this$1.target.setAttribute(\"contentEditable\", \"false\"); }, 20); }\n    this.view.domObserver.start();\n  }\n\n  view.root.addEventListener(\"mouseup\", this.up = this.up.bind(this));\n  view.root.addEventListener(\"mousemove\", this.move = this.move.bind(this));\n  setSelectionOrigin(view, \"pointer\");\n};\n\nMouseDown.prototype.done = function done () {\n  this.view.root.removeEventListener(\"mouseup\", this.up);\n  this.view.root.removeEventListener(\"mousemove\", this.move);\n  if (this.mightDrag && this.target) {\n    this.view.domObserver.stop();\n    if (this.mightDrag.addAttr) { this.target.draggable = false; }\n    if (this.mightDrag.setUneditable) { this.target.removeAttribute(\"contentEditable\"); }\n    this.view.domObserver.start();\n  }\n  this.view.mouseDown = null;\n};\n\nMouseDown.prototype.up = function up (event) {\n  this.done();\n\n  if (!this.view.dom.contains(event.target.nodeType == 3 ? event.target.parentNode : event.target))\n    { return }\n\n  var pos = this.pos;\n  if (this.view.state.doc != this.startDoc) { pos = this.view.posAtCoords(eventCoords(event)); }\n\n  if (this.allowDefault || !pos) {\n    setSelectionOrigin(this.view, \"pointer\");\n  } else if (handleSingleClick(this.view, pos.pos, pos.inside, event, this.selectNode)) {\n    event.preventDefault();\n  } else if (this.flushed ||\n             // Chrome will sometimes treat a node selection as a\n             // cursor, but still report that the node is selected\n             // when asked through getSelection. You'll then get a\n             // situation where clicking at the point where that\n             // (hidden) cursor is doesn't change the selection, and\n             // thus doesn't get a reaction from ProseMirror. This\n             // works around that.\n             (result.chrome && !(this.view.state.selection instanceof prosemirrorState.TextSelection) &&\n              (pos.pos == this.view.state.selection.from || pos.pos == this.view.state.selection.to))) {\n    updateSelection(this.view, prosemirrorState.Selection.near(this.view.state.doc.resolve(pos.pos)), \"pointer\");\n    event.preventDefault();\n  } else {\n    setSelectionOrigin(this.view, \"pointer\");\n  }\n};\n\nMouseDown.prototype.move = function move (event) {\n  if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 ||\n                             Math.abs(this.event.y - event.clientY) > 4))\n    { this.allowDefault = true; }\n  setSelectionOrigin(this.view, \"pointer\");\n};\n\nhandlers.touchdown = function (view) {\n  forceDOMFlush(view);\n  setSelectionOrigin(view, \"pointer\");\n};\n\nhandlers.contextmenu = function (view) { return forceDOMFlush(view); };\n\nfunction inOrNearComposition(view, event) {\n  if (view.composing) { return true }\n  // See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/.\n  // On Japanese input method editors (IMEs), the Enter key is used to confirm character\n  // selection. On Safari, when Enter is pressed, compositionend and keydown events are\n  // emitted. The keydown event triggers newline insertion, which we don't want.\n  // This method returns true if the keydown event should be ignored.\n  // We only ignore it once, as pressing Enter a second time *should* insert a newline.\n  // Furthermore, the keydown event timestamp must be close to the compositionEndedAt timestamp.\n  // This guards against the case where compositionend is triggered without the keyboard\n  // (e.g. character confirmation may be done with the mouse), and keydown is triggered\n  // afterwards- we wouldn't want to ignore the keydown event in this case.\n  if (result.safari && Math.abs(event.timeStamp - view.compositionEndedAt) < 500) {\n    view.compositionEndedAt = -2e8;\n    return true\n  }\n  return false\n}\n\n// Drop active composition after 5 seconds of inactivity on Android\nvar timeoutComposition = result.android ? 5000 : -1;\n\neditHandlers.compositionstart = editHandlers.compositionupdate = function (view) {\n  if (!view.composing) {\n    view.domObserver.flush();\n    var state = view.state;\n    var $pos = state.selection.$from;\n    if (state.selection.empty &&\n        (state.storedMarks || (!$pos.textOffset && $pos.parentOffset && $pos.nodeBefore.marks.some(function (m) { return m.type.spec.inclusive === false; })))) {\n      // Need to wrap the cursor in mark nodes different from the ones in the DOM context\n      view.markCursor = view.state.storedMarks || $pos.marks();\n      endComposition(view, true);\n      view.markCursor = null;\n    } else {\n      endComposition(view);\n      // In firefox, if the cursor is after but outside a marked node,\n      // the inserted text won't inherit the marks. So this moves it\n      // inside if necessary.\n      if (result.gecko && state.selection.empty && $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.length) {\n        var sel = view.root.getSelection();\n        for (var node = sel.focusNode, offset = sel.focusOffset; node && node.nodeType == 1 && offset != 0;) {\n          var before = offset < 0 ? node.lastChild : node.childNodes[offset - 1];\n          if (before.nodeType == 3) {\n            sel.collapse(before, before.nodeValue.length);\n            break\n          } else {\n            node = before;\n            offset = -1;\n          }\n        }\n      }\n    }\n    view.composing = true;\n  }\n  scheduleComposeEnd(view, timeoutComposition);\n};\n\neditHandlers.compositionend = function (view, event) {\n  if (view.composing) {\n    view.composing = false;\n    view.compositionEndedAt = event.timeStamp;\n    scheduleComposeEnd(view, 20);\n  }\n};\n\nfunction scheduleComposeEnd(view, delay) {\n  clearTimeout(view.composingTimeout);\n  if (delay > -1) { view.composingTimeout = setTimeout(function () { return endComposition(view); }, delay); }\n}\n\nfunction endComposition(view, forceUpdate) {\n  view.composing = false;\n  while (view.compositionNodes.length > 0) { view.compositionNodes.pop().markParentsDirty(); }\n  if (forceUpdate || view.docView.dirty) {\n    view.updateState(view.state);\n    return true\n  }\n  return false\n}\n\nfunction captureCopy(view, dom) {\n  // The extra wrapper is somehow necessary on IE/Edge to prevent the\n  // content from being mangled when it is put onto the clipboard\n  var doc = view.dom.ownerDocument;\n  var wrap = doc.body.appendChild(doc.createElement(\"div\"));\n  wrap.appendChild(dom);\n  wrap.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n  var sel = getSelection(), range = doc.createRange();\n  range.selectNodeContents(dom);\n  // Done because IE will fire a selectionchange moving the selection\n  // to its start when removeAllRanges is called and the editor still\n  // has focus (which will mess up the editor's selection state).\n  view.dom.blur();\n  sel.removeAllRanges();\n  sel.addRange(range);\n  setTimeout(function () {\n    doc.body.removeChild(wrap);\n    view.focus();\n  }, 50);\n}\n\n// This is very crude, but unfortunately both these browsers _pretend_\n// that they have a clipboard API—all the objects and methods are\n// there, they just don't work, and they are hard to test.\nvar brokenClipboardAPI = (result.ie && result.ie_version < 15) ||\n      (result.ios && result.webkit_version < 604);\n\nhandlers.copy = editHandlers.cut = function (view, e) {\n  var sel = view.state.selection, cut = e.type == \"cut\";\n  if (sel.empty) { return }\n\n  // IE and Edge's clipboard interface is completely broken\n  var data = brokenClipboardAPI ? null : e.clipboardData;\n  var slice = sel.content();\n  var ref = serializeForClipboard(view, slice);\n  var dom = ref.dom;\n  var text = ref.text;\n  if (data) {\n    e.preventDefault();\n    data.clearData();\n    data.setData(\"text/html\", dom.innerHTML);\n    data.setData(\"text/plain\", text);\n  } else {\n    captureCopy(view, dom);\n  }\n  if (cut) { view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta(\"uiEvent\", \"cut\")); }\n};\n\nfunction sliceSingleNode(slice) {\n  return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null\n}\n\nfunction capturePaste(view, e) {\n  var doc = view.dom.ownerDocument;\n  var plainText = view.shiftKey || view.state.selection.$from.parent.type.spec.code;\n  var target = doc.body.appendChild(doc.createElement(plainText ? \"textarea\" : \"div\"));\n  if (!plainText) { target.contentEditable = \"true\"; }\n  target.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n  target.focus();\n  setTimeout(function () {\n    view.focus();\n    doc.body.removeChild(target);\n    if (plainText) { doPaste(view, target.value, null, e); }\n    else { doPaste(view, target.textContent, target.innerHTML, e); }\n  }, 50);\n}\n\nfunction doPaste(view, text, html, e) {\n  var slice = parseFromClipboard(view, text, html, view.shiftKey, view.state.selection.$from);\n  if (view.someProp(\"handlePaste\", function (f) { return f(view, e, slice || prosemirrorModel.Slice.empty); }) || !slice) { return true }\n\n  var singleNode = sliceSingleNode(slice);\n  var tr = singleNode ? view.state.tr.replaceSelectionWith(singleNode, view.shiftKey) : view.state.tr.replaceSelection(slice);\n  view.dispatch(tr.scrollIntoView().setMeta(\"paste\", true).setMeta(\"uiEvent\", \"paste\"));\n  return true\n}\n\neditHandlers.paste = function (view, e) {\n  var data = brokenClipboardAPI ? null : e.clipboardData;\n  if (data && (doPaste(view, data.getData(\"text/plain\"), data.getData(\"text/html\"), e) || data.files.length > 0))\n    { e.preventDefault(); }\n  else\n    { capturePaste(view, e); }\n};\n\nvar Dragging = function Dragging(slice, move) {\n  this.slice = slice;\n  this.move = move;\n};\n\nvar dragCopyModifier = result.mac ? \"altKey\" : \"ctrlKey\";\n\nhandlers.dragstart = function (view, e) {\n  var mouseDown = view.mouseDown;\n  if (mouseDown) { mouseDown.done(); }\n  if (!e.dataTransfer) { return }\n\n  var sel = view.state.selection;\n  var pos = sel.empty ? null : view.posAtCoords(eventCoords(e));\n  if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof prosemirrorState.NodeSelection ? sel.to - 1: sel.to)) {\n    // In selection\n  } else if (mouseDown && mouseDown.mightDrag) {\n    view.dispatch(view.state.tr.setSelection(prosemirrorState.NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos)));\n  } else if (e.target && e.target.nodeType == 1) {\n    var desc = view.docView.nearestDesc(e.target, true);\n    if (!desc || !desc.node.type.spec.draggable || desc == view.docView) { return }\n    view.dispatch(view.state.tr.setSelection(prosemirrorState.NodeSelection.create(view.state.doc, desc.posBefore)));\n  }\n  var slice = view.state.selection.content();\n  var ref = serializeForClipboard(view, slice);\n  var dom = ref.dom;\n  var text = ref.text;\n  e.dataTransfer.clearData();\n  e.dataTransfer.setData(brokenClipboardAPI ? \"Text\" : \"text/html\", dom.innerHTML);\n  if (!brokenClipboardAPI) { e.dataTransfer.setData(\"text/plain\", text); }\n  view.dragging = new Dragging(slice, !e[dragCopyModifier]);\n};\n\nhandlers.dragend = function (view) {\n  window.setTimeout(function () { return view.dragging = null; }, 50);\n};\n\neditHandlers.dragover = editHandlers.dragenter = function (_, e) { return e.preventDefault(); };\n\neditHandlers.drop = function (view, e) {\n  var dragging = view.dragging;\n  view.dragging = null;\n\n  if (!e.dataTransfer) { return }\n\n  var eventPos = view.posAtCoords(eventCoords(e));\n  if (!eventPos) { return }\n  var $mouse = view.state.doc.resolve(eventPos.pos);\n  if (!$mouse) { return }\n  var slice = dragging && dragging.slice ||\n      parseFromClipboard(view, e.dataTransfer.getData(brokenClipboardAPI ? \"Text\" : \"text/plain\"),\n                         brokenClipboardAPI ? null : e.dataTransfer.getData(\"text/html\"), false, $mouse);\n  if (!slice) { return }\n\n  e.preventDefault();\n  if (view.someProp(\"handleDrop\", function (f) { return f(view, e, slice, dragging && dragging.move); })) { return }\n  var insertPos = slice ? prosemirrorTransform.dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;\n  if (insertPos == null) { insertPos = $mouse.pos; }\n\n  var tr = view.state.tr;\n  if (dragging && dragging.move) { tr.deleteSelection(); }\n\n  var pos = tr.mapping.map(insertPos);\n  var isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;\n  var beforeInsert = tr.doc;\n  if (isNode)\n    { tr.replaceRangeWith(pos, pos, slice.content.firstChild); }\n  else\n    { tr.replaceRange(pos, pos, slice); }\n  if (tr.doc.eq(beforeInsert)) { return }\n\n  var $pos = tr.doc.resolve(pos);\n  if (isNode && prosemirrorState.NodeSelection.isSelectable(slice.content.firstChild) &&\n      $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild))\n    { tr.setSelection(new prosemirrorState.NodeSelection($pos)); }\n  else\n    { tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(tr.mapping.map(insertPos)))); }\n  view.focus();\n  view.dispatch(tr.setMeta(\"uiEvent\", \"drop\"));\n};\n\nhandlers.focus = function (view) {\n  if (!view.focused) {\n    view.domObserver.stop();\n    view.dom.classList.add(\"ProseMirror-focused\");\n    view.domObserver.start();\n    view.focused = true;\n  }\n};\n\nhandlers.blur = function (view) {\n  if (view.focused) {\n    view.domObserver.stop();\n    view.dom.classList.remove(\"ProseMirror-focused\");\n    view.domObserver.start();\n    view.focused = false;\n  }\n};\n\nhandlers.beforeinput = function (view, event) {\n  // We should probably do more with beforeinput events, but support\n  // is so spotty that I'm still waiting to see where they are going.\n\n  // Very specific hack to deal with backspace sometimes failing on\n  // Chrome Android when after an uneditable node.\n  if (result.chrome && result.android && event.inputType == \"deleteContentBackward\") {\n    var domChangeCount = view.domChangeCount;\n    setTimeout(function () {\n      if (view.domChangeCount != domChangeCount) { return } // Event already had some effect\n      // This bug tends to close the virtual keyboard, so we refocus\n      view.dom.blur();\n      view.focus();\n      if (view.someProp(\"handleKeyDown\", function (f) { return f(view, keyEvent(8, \"Backspace\")); })) { return }\n      var ref = view.state.selection;\n      var $cursor = ref.$cursor;\n      // Crude approximation of backspace behavior when no command handled it\n      if ($cursor && $cursor.pos > 0) { view.dispatch(view.state.tr.delete($cursor.pos - 1, $cursor.pos).scrollIntoView()); }\n    }, 50);\n  }\n};\n\n// Make sure all handlers get registered\nfor (var prop in editHandlers) { handlers[prop] = editHandlers[prop]; }\n\nfunction compareObjs(a, b) {\n  if (a == b) { return true }\n  for (var p in a) { if (a[p] !== b[p]) { return false } }\n  for (var p$1 in b) { if (!(p$1 in a)) { return false } }\n  return true\n}\n\nvar WidgetType = function WidgetType(toDOM, spec) {\n  this.spec = spec || noSpec;\n  this.side = this.spec.side || 0;\n  this.toDOM = toDOM;\n};\n\nWidgetType.prototype.map = function map (mapping, span, offset, oldOffset) {\n  var ref = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);\n    var pos = ref.pos;\n    var deleted = ref.deleted;\n  return deleted ? null : new Decoration(pos - offset, pos - offset, this)\n};\n\nWidgetType.prototype.valid = function valid () { return true };\n\nWidgetType.prototype.eq = function 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\nvar InlineType = function InlineType(attrs, spec) {\n  this.spec = spec || noSpec;\n  this.attrs = attrs;\n};\n\nInlineType.prototype.map = function map (mapping, span, offset, oldOffset) {\n  var from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;\n  var to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;\n  return from >= to ? null : new Decoration(from, to, this)\n};\n\nInlineType.prototype.valid = function valid (_, span) { return span.from < span.to };\n\nInlineType.prototype.eq = function eq (other) {\n  return this == other ||\n    (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&\n     compareObjs(this.spec, other.spec))\n};\n\nInlineType.is = function is (span) { return span.type instanceof InlineType };\n\nvar NodeType = function NodeType(attrs, spec) {\n  this.spec = spec || noSpec;\n  this.attrs = attrs;\n};\n\nNodeType.prototype.map = function map (mapping, span, offset, oldOffset) {\n  var from = mapping.mapResult(span.from + oldOffset, 1);\n  if (from.deleted) { return null }\n  var 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\nNodeType.prototype.valid = function valid (node, span) {\n  var ref = node.content.findIndex(span.from);\n    var index = ref.index;\n    var offset = ref.offset;\n  return offset == span.from && offset + node.child(index).nodeSize == span.to\n};\n\nNodeType.prototype.eq = function eq (other) {\n  return this == other ||\n    (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&\n     compareObjs(this.spec, other.spec))\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.\nvar Decoration = function Decoration(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\nvar prototypeAccessors$2 = { spec: {} };\n\nDecoration.prototype.copy = function copy (from, to) {\n  return new Decoration(from, to, this.type)\n};\n\nDecoration.prototype.eq = function eq (other) {\n  return this.type.eq(other.type) && this.from == other.from && this.to == other.to\n};\n\nDecoration.prototype.map = function 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//   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.\nDecoration.widget = function 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).\nDecoration.inline = function 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.\nDecoration.node = function 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.\nprototypeAccessors$2.spec.get = function () { return this.type.spec };\n\nObject.defineProperties( Decoration.prototype, prototypeAccessors$2 );\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\nvar none = [];\nvar 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.\nvar DecorationSet = function DecorationSet(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.\nDecorationSet.create = function 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.\nDecorationSet.prototype.find = function find (start, end, predicate) {\n  var result = [];\n  this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);\n  return result\n};\n\nDecorationSet.prototype.findInner = function findInner (start, end, result, offset, predicate) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.local.length; i++) {\n    var span = this$1.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 (var i$1 = 0; i$1 < this.children.length; i$1 += 3) {\n    if (this$1.children[i$1] < end && this$1.children[i$1 + 1] > start) {\n      var childOff = this$1.children[i$1] + 1;\n      this$1.children[i$1 + 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.\nDecorationSet.prototype.map = function 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\nDecorationSet.prototype.mapInner = function mapInner (mapping, node, offset, oldOffset, options) {\n    var this$1 = this;\n\n  var newLocal;\n  for (var i = 0; i < this.local.length; i++) {\n    var mapped = this$1.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$1.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.\nDecorationSet.prototype.add = function 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\nDecorationSet.prototype.addInner = function addInner (doc, decorations, offset) {\n    var this$1 = this;\n\n  var children, childIndex = 0;\n  doc.forEach(function (childNode, childOffset) {\n    var baseOffset = childOffset + offset, found;\n    if (!(found = takeSpansForNode(decorations, childNode, baseOffset))) { return }\n\n    if (!children) { children = this$1.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  var 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.\nDecorationSet.prototype.remove = function remove (decorations) {\n  if (decorations.length == 0 || this == empty) { return this }\n  return this.removeInner(decorations, 0)\n};\n\nDecorationSet.prototype.removeInner = function removeInner (decorations, offset) {\n    var this$1 = this;\n\n  var children = this.children, local = this.local;\n  for (var i = 0; i < children.length; i += 3) {\n    var found = (void 0), from = children[i] + offset, to = children[i + 1] + offset;\n    for (var j = 0, span = (void 0); 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$1.children) { children = this$1.children.slice(); }\n    var 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 (var i$1 = 0, span$1 = (void 0); i$1 < decorations.length; i$1++) { if (span$1 = decorations[i$1]) {\n    for (var j$1 = 0; j$1 < local.length; j$1++) { if (local[j$1].type.eq(span$1.type)) {\n      if (local == this$1.local) { local = this$1.local.slice(); }\n      local.splice(j$1--, 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\nDecorationSet.prototype.forChild = function forChild (offset, node) {\n    var this$1 = this;\n\n  if (this == empty) { return this }\n  if (node.isLeaf) { return DecorationSet.empty }\n\n  var child, local;\n  for (var i = 0; i < this.children.length; i += 3) { if (this$1.children[i] >= offset) {\n    if (this$1.children[i] == offset) { child = this$1.children[i + 2]; }\n    break\n  } }\n  var start = offset + 1, end = start + node.content.size;\n  for (var i$1 = 0; i$1 < this.local.length; i$1++) {\n    var dec = this$1.local[i$1];\n    if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {\n      var 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    var localSet = new DecorationSet(local.sort(byPos));\n    return child ? new DecorationGroup([localSet, child]) : localSet\n  }\n  return child || empty\n};\n\nDecorationSet.prototype.eq = function eq (other) {\n    var this$1 = this;\n\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 (var i = 0; i < this.local.length; i++)\n    { if (!this$1.local[i].eq(other.local[i])) { return false } }\n  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3)\n    { if (this$1.children[i$1] != other.children[i$1] ||\n        this$1.children[i$1 + 1] != other.children[i$1 + 1] ||\n        !this$1.children[i$1 + 2].eq(other.children[i$1 + 2])) { return false } }\n  return true\n};\n\nDecorationSet.prototype.locals = function locals (node) {\n  return removeOverlap(this.localsInner(node))\n};\n\nDecorationSet.prototype.localsInner = function localsInner (node) {\n    var this$1 = this;\n\n  if (this == empty) { return none }\n  if (node.inlineContent || !this.local.some(InlineType.is)) { return this.local }\n  var result = [];\n  for (var i = 0; i < this.local.length; i++) {\n    if (!(this$1.local[i].type instanceof InlineType))\n      { result.push(this$1.local[i]); }\n  }\n  return result\n};\n\nvar 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.\nvar DecorationGroup = function DecorationGroup(members) {\n  this.members = members;\n};\n\nDecorationGroup.prototype.forChild = function forChild (offset, child) {\n    var this$1 = this;\n\n  if (child.isLeaf) { return DecorationSet.empty }\n  var found = [];\n  for (var i = 0; i < this.members.length; i++) {\n    var result = this$1.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\nDecorationGroup.prototype.eq = function eq (other) {\n    var this$1 = this;\n\n  if (!(other instanceof DecorationGroup) ||\n      other.members.length != this.members.length) { return false }\n  for (var i = 0; i < this.members.length; i++)\n    { if (!this$1.members[i].eq(other.members[i])) { return false } }\n  return true\n};\n\nDecorationGroup.prototype.locals = function locals (node) {\n    var this$1 = this;\n\n  var result, sorted = true;\n  for (var i = 0; i < this.members.length; i++) {\n    var locals = this$1.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 (var 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.\nDecorationGroup.from = function 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\nfunction mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {\n  var children = oldChildren.slice();\n\n  // Mark the children that are directly touched by changes, and\n  // move those that are after the changes.\n  var shift = function (oldStart, oldEnd, newStart, newEnd) {\n    for (var i = 0; i < children.length; i += 3) {\n      var end = children[i + 1], dSize = (void 0);\n      if (end == -1 || oldStart > end + oldOffset) { continue }\n      if (oldEnd >= children[i] + oldOffset) {\n        children[i + 1] = -1;\n      } else if (dSize = (newEnd - newStart) - (oldEnd - oldStart) + (oldOffset - offset)) {\n        children[i] += dSize;\n        children[i + 1] += dSize;\n      }\n    }\n  };\n  for (var 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  var mustRebuild = false;\n  for (var i$1 = 0; i$1 < children.length; i$1 += 3) { if (children[i$1 + 1] == -1) { // Touched nodes\n    var from = mapping.map(children[i$1] + 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    var to = mapping.map(oldChildren[i$1 + 1] + oldOffset, -1), toLocal = to - offset;\n    var ref = node.content.findIndex(fromLocal);\n    var index = ref.index;\n    var childOffset = ref.offset;\n    var childNode = node.maybeChild(index);\n    if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {\n      var mapped = children[i$1 + 2].mapInner(mapping, childNode, from + 1, children[i$1] + oldOffset + 1, options);\n      if (mapped != empty) {\n        children[i$1] = fromLocal;\n        children[i$1 + 1] = toLocal;\n        children[i$1 + 2] = mapped;\n      } else {\n        children[i$1 + 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    var decorations = mapAndGatherRemainingDecorations(children, oldChildren, newLocal || [], mapping,\n                                                       offset, oldOffset, options);\n    var built = buildTree(decorations, node, 0, options);\n    newLocal = built.local;\n    for (var i$2 = 0; i$2 < children.length; i$2 += 3) { if (children[i$2 + 1] < 0) {\n      children.splice(i$2, 3);\n      i$2 -= 3;\n    } }\n    for (var i$3 = 0, j = 0; i$3 < built.children.length; i$3 += 3) {\n      var from$1 = built.children[i$3];\n      while (j < children.length && children[j] < from$1) { j += 3; }\n      children.splice(j, 0, built.children[i$3], built.children[i$3 + 1], built.children[i$3 + 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  var result = [];\n  for (var i = 0; i < spans.length; i++) {\n    var 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 (var i = 0; i < set.local.length; i++) {\n      var 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 (var i$1 = 0; i$1 < set.children.length; i$1 += 3)\n      { gather(set.children[i$1 + 2], set.children[i$1] + oldOffset + 1); }\n  }\n  for (var 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  var end = offset + node.nodeSize, found = null;\n  for (var i = 0, span = (void 0); 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  var result = [];\n  for (var 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  var children = [], hasNulls = false;\n  node.forEach(function (childNode, localStart) {\n    var found = takeSpansForNode(spans, childNode, localStart + offset);\n    if (found) {\n      hasNulls = true;\n      var subtree = buildTree(found, childNode, offset + localStart + 1, options);\n      if (subtree != empty)\n        { children.push(localStart, localStart + childNode.nodeSize, subtree); }\n    }\n  });\n  var locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);\n  for (var 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  var working = spans;\n  for (var i = 0; i < working.length - 1; i++) {\n    var span = working[i];\n    if (span.from != span.to) { for (var j = i + 1; j < working.length; j++) {\n      var 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.\nfunction viewDecorations(view) {\n  var found = [];\n  view.someProp(\"decorations\", function (f) {\n    var 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\n// ::- An editor view manages the DOM structure that represents an\n// editable document. Its state and behavior are determined by its\n// [props](#view.DirectEditorProps).\nvar EditorView = function EditorView(place, props) {\n  this._props = props;\n  // :: EditorState\n  // The view's current [state](#state.EditorState).\n  this.state = props.state;\n\n  this.dispatch = this.dispatch.bind(this);\n\n  this._root = null;\n  this.focused = false;\n\n  // :: dom.Element\n  // An editable DOM node containing the document. (You probably\n  // should not directly interfere with its content.)\n  this.dom = (place && place.mount) || document.createElement(\"div\");\n  if (place) {\n    if (place.appendChild) { place.appendChild(this.dom); }\n    else if (place.apply) { place(this.dom); }\n    else if (place.mount) { this.mounted = true; }\n  }\n\n  // :: bool\n  // Indicates whether the editor is currently [editable](#view.EditorProps.editable).\n  this.editable = getEditable(this);\n  this.markCursor = null;\n  this.cursorWrapper = null;\n  updateCursorWrapper(this);\n  this.nodeViews = buildNodeViews(this);\n  this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);\n\n  this.lastSelectedViewDesc = null;\n  // :: ?{slice: Slice, move: bool}\n  // When editor content is being dragged, this object contains\n  // information about the dragged slice and whether it is being\n  // copied or moved. At any other time, it is null.\n  this.dragging = null;\n\n  initInput(this);\n\n  this.pluginViews = [];\n  this.updatePluginViews();\n};\n\nvar prototypeAccessors = { props: {},root: {} };\n\n// composing:: boolean\n// Holds `true` when a\n// [composition](https://developer.mozilla.org/en-US/docs/Mozilla/IME_handling_guide)\n// is active.\n\n// :: DirectEditorProps\n// The view's current [props](#view.EditorProps).\nprototypeAccessors.props.get = function () {\n    var this$1 = this;\n\n  if (this._props.state != this.state) {\n    var prev = this._props;\n    this._props = {};\n    for (var name in prev) { this$1._props[name] = prev[name]; }\n    this._props.state = this.state;\n  }\n  return this._props\n};\n\n// :: (DirectEditorProps)\n// Update the view's props. Will immediately cause an update to\n// the DOM.\nEditorView.prototype.update = function update (props) {\n  if (props.handleDOMEvents != this._props.handleDOMEvents) { ensureListeners(this); }\n  this._props = props;\n  this.updateStateInner(props.state, true);\n};\n\n// :: (DirectEditorProps)\n// Update the view by updating existing props object with the object\n// given as argument. Equivalent to `view.update(Object.assign({},\n// view.props, props))`.\nEditorView.prototype.setProps = function setProps (props) {\n    var this$1 = this;\n\n  var updated = {};\n  for (var name in this$1._props) { updated[name] = this$1._props[name]; }\n  updated.state = this.state;\n  for (var name$1 in props) { updated[name$1] = props[name$1]; }\n  this.update(updated);\n};\n\n// :: (EditorState)\n// Update the editor's `state` prop, without touching any of the\n// other props.\nEditorView.prototype.updateState = function updateState (state) {\n  this.updateStateInner(state, this.state.plugins != state.plugins);\n};\n\nEditorView.prototype.updateStateInner = function updateStateInner (state, reconfigured) {\n    var this$1 = this;\n\n  var prev = this.state, redraw = false;\n  this.state = state;\n  if (reconfigured) {\n    var nodeViews = buildNodeViews(this);\n    if (changedNodeViews(nodeViews, this.nodeViews)) {\n      this.nodeViews = nodeViews;\n      redraw = true;\n    }\n    ensureListeners(this);\n  }\n\n  this.editable = getEditable(this);\n  updateCursorWrapper(this);\n  var innerDeco = viewDecorations(this), outerDeco = computeDocDeco(this);\n\n  var scroll = reconfigured ? \"reset\"\n      : state.scrollToSelection > prev.scrollToSelection ? \"to selection\" : \"preserve\";\n  var updateDoc = redraw || !this.docView.matchesNode(state.doc, outerDeco, innerDeco);\n  var updateSel = updateDoc || !state.selection.eq(prev.selection);\n  var oldScrollPos = scroll == \"preserve\" && updateSel && this.dom.style.overflowAnchor == null && storeScrollPos(this);\n\n  if (updateSel) {\n    this.domObserver.stop();\n    var forceSelUpdate = false;\n    if (updateDoc) {\n      // Work around an issue in Chrome where changing the DOM\n      // around the active selection puts it into a broken state\n      // where the thing the user sees differs from the selection\n      // reported by the Selection object (#710)\n      var startSelContext = result.chrome && selectionContext(this.root);\n      if (redraw || !this.docView.update(state.doc, outerDeco, innerDeco, this)) {\n        this.docView.destroy();\n        this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);\n      }\n      if (startSelContext)\n        { forceSelUpdate = !this.composing && needChromeSelectionForce(startSelContext, this.root); }\n      // IE11 will sometimes _report_ the selection as being in the\n      // right place but actually draw/use a different selection\n      // after a deletion (#973).\n      if (result.ie && result.ie_version <= 11 && !prev.selection.empty && state.selection.empty &&\n          state.doc.content.size < prev.doc.content.size)\n        { forceSelUpdate = true; }\n    }\n    // Work around for an issue where an update arriving right between\n    // a DOM selection change and the \"selectionchange\" event for it\n    // can cause a spurious DOM selection update, disrupting mouse\n    // drag selection.\n    if (forceSelUpdate ||\n        !(this.mouseDown && this.domObserver.currentSelection.eq(this.root.getSelection()) && anchorInRightPlace(this))) {\n      selectionToDOM(this, false, forceSelUpdate);\n    } else {\n      syncNodeSelection(this, state.selection);\n      this.domObserver.setCurSelection();\n    }\n    this.domObserver.start();\n  }\n\n  this.updatePluginViews(prev);\n\n  if (scroll == \"reset\") {\n    this.dom.scrollTop = 0;\n  } else if (scroll == \"to selection\") {\n    var startDOM = this.root.getSelection().focusNode;\n    if (this.someProp(\"handleScrollToSelection\", function (f) { return f(this$1); }))\n      {} // Handled\n    else if (state.selection instanceof prosemirrorState.NodeSelection)\n      { scrollRectIntoView(this, this.docView.domAfterPos(state.selection.from).getBoundingClientRect(), startDOM); }\n    else\n      { scrollRectIntoView(this, this.coordsAtPos(state.selection.head), startDOM); }\n  } else if (oldScrollPos) {\n    resetScrollPos(oldScrollPos);\n  }\n};\n\nEditorView.prototype.destroyPluginViews = function destroyPluginViews () {\n  var view;\n  while (view = this.pluginViews.pop()) { if (view.destroy) { view.destroy(); } }\n};\n\nEditorView.prototype.updatePluginViews = function updatePluginViews (prevState) {\n    var this$1 = this;\n\n  if (!prevState || prevState.plugins != this.state.plugins) {\n    this.destroyPluginViews();\n    for (var i = 0; i < this.state.plugins.length; i++) {\n      var plugin = this$1.state.plugins[i];\n      if (plugin.spec.view) { this$1.pluginViews.push(plugin.spec.view(this$1)); }\n    }\n  } else {\n    for (var i$1 = 0; i$1 < this.pluginViews.length; i$1++) {\n      var pluginView = this$1.pluginViews[i$1];\n      if (pluginView.update) { pluginView.update(this$1, prevState); }\n    }\n  }\n};\n\n// :: (string, ?(prop: *) → *) → *\n// Goes over the values of a prop, first those provided directly,\n// then those from plugins (in order), and calls `f` every time a\n// non-undefined value is found. When `f` returns a truthy value,\n// that is immediately returned. When `f` isn't provided, it is\n// treated as the identity function (the prop value is returned\n// directly).\nEditorView.prototype.someProp = function someProp (propName, f) {\n  var prop = this._props && this._props[propName], value;\n  if (prop != null && (value = f ? f(prop) : prop)) { return value }\n  var plugins = this.state.plugins;\n  if (plugins) { for (var i = 0; i < plugins.length; i++) {\n    var prop$1 = plugins[i].props[propName];\n    if (prop$1 != null && (value = f ? f(prop$1) : prop$1)) { return value }\n  } }\n};\n\n// :: () → bool\n// Query whether the view has focus.\nEditorView.prototype.hasFocus = function hasFocus () {\n  return this.root.activeElement == this.dom\n};\n\n// :: ()\n// Focus the editor.\nEditorView.prototype.focus = function focus () {\n  this.domObserver.stop();\n  selectionToDOM(this, true);\n  if (this.editable) {\n    if (this.dom.setActive) { this.dom.setActive(); } // for IE\n    else { this.dom.focus({preventScroll: true}); }\n  }\n  this.domObserver.start();\n};\n\n// :: union<dom.Document, dom.DocumentFragment>\n// Get the document root in which the editor exists. This will\n// usually be the top-level `document`, but might be a [shadow\n// DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)\n// root if the editor is inside one.\nprototypeAccessors.root.get = function () {\n    var this$1 = this;\n\n  var cached = this._root;\n  if (cached == null) { for (var search = this.dom.parentNode; search; search = search.parentNode) {\n    if (search.nodeType == 9 || (search.nodeType == 11 && search.host))\n      { return this$1._root = search }\n  } }\n  return cached || document\n};\n\n// :: ({left: number, top: number}) → ?{pos: number, inside: number}\n// Given a pair of viewport coordinates, return the document\n// position that corresponds to them. May return null if the given\n// coordinates aren't inside of the editor. When an object is\n// returned, its `pos` property is the position nearest to the\n// coordinates, and its `inside` property holds the position of the\n// inner node that the position falls inside of, or -1 if it is at\n// the top level, not in any node.\nEditorView.prototype.posAtCoords = function posAtCoords$1 (coords) {\n  return posAtCoords(this, coords)\n};\n\n// :: (number) → {left: number, right: number, top: number, bottom: number}\n// Returns the viewport rectangle at a given document position. `left`\n// and `right` will be the same number, as this returns a flat\n// cursor-ish rectangle.\nEditorView.prototype.coordsAtPos = function coordsAtPos$1 (pos) {\n  return coordsAtPos(this, pos)\n};\n\n// :: (number) → {node: dom.Node, offset: number}\n// Find the DOM position that corresponds to the given document\n// position. Note that you should **not** mutate the editor's\n// internal DOM, only inspect it (and even that is usually not\n// necessary).\nEditorView.prototype.domAtPos = function domAtPos (pos) {\n  return this.docView.domFromPos(pos)\n};\n\n// :: (number) → ?dom.Node\n// Find the DOM node that represents the document node after the\n// given position. May return `null` when the position doesn't point\n// in front of a node or if the node is inside an opaque node view.\n//\n// This is intended to be able to call things like\n// `getBoundingClientRect` on that DOM node. Do **not** mutate the\n// editor DOM directly, or add styling this way, since that will be\n// immediately overriden by the editor as it redraws the node.\nEditorView.prototype.nodeDOM = function nodeDOM (pos) {\n  var desc = this.docView.descAt(pos);\n  return desc ? desc.nodeDOM : null\n};\n\n// :: (dom.Node, number, ?number) → number\n// Find the document position that corresponds to a given DOM\n// position. (Whenever possible, it is preferable to inspect the\n// document structure directly, rather than poking around in the\n// DOM, but sometimes—for example when interpreting an event\n// target—you don't have a choice.)\n//\n// The `bias` parameter can be used to influence which side of a DOM\n// node to use when the position is inside a leaf node.\nEditorView.prototype.posAtDOM = function posAtDOM (node, offset, bias) {\n    if ( bias === void 0 ) bias = -1;\n\n  var pos = this.docView.posFromDOM(node, offset, bias);\n  if (pos == null) { throw new RangeError(\"DOM position not inside the editor\") }\n  return pos\n};\n\n// :: (union<\"up\", \"down\", \"left\", \"right\", \"forward\", \"backward\">, ?EditorState) → bool\n// Find out whether the selection is at the end of a textblock when\n// moving in a given direction. When, for example, given `\"left\"`,\n// it will return true if moving left from the current cursor\n// position would leave that position's parent textblock. Will apply\n// to the view's current state by default, but it is possible to\n// pass a different state.\nEditorView.prototype.endOfTextblock = function endOfTextblock$1 (dir, state) {\n  return endOfTextblock(this, state || this.state, dir)\n};\n\n// :: ()\n// Removes the editor from the DOM and destroys all [node\n// views](#view.NodeView).\nEditorView.prototype.destroy = function destroy () {\n  if (!this.docView) { return }\n  destroyInput(this);\n  this.destroyPluginViews();\n  if (this.mounted) {\n    this.docView.update(this.state.doc, [], viewDecorations(this), this);\n    this.dom.textContent = \"\";\n  } else if (this.dom.parentNode) {\n    this.dom.parentNode.removeChild(this.dom);\n  }\n  this.docView.destroy();\n  this.docView = null;\n};\n\n// Used for testing.\nEditorView.prototype.dispatchEvent = function dispatchEvent$1 (event) {\n  return dispatchEvent(this, event)\n};\n\n// :: (Transaction)\n// Dispatch a transaction. Will call\n// [`dispatchTransaction`](#view.DirectEditorProps.dispatchTransaction)\n// when given, and otherwise defaults to applying the transaction to\n// the current state and calling\n// [`updateState`](#view.EditorView.updateState) with the result.\n// This method is bound to the view instance, so that it can be\n// easily passed around.\nEditorView.prototype.dispatch = function dispatch (tr) {\n  var dispatchTransaction = this._props.dispatchTransaction;\n  if (dispatchTransaction) { dispatchTransaction.call(this, tr); }\n  else { this.updateState(this.state.apply(tr)); }\n};\n\nObject.defineProperties( EditorView.prototype, prototypeAccessors );\n\nfunction computeDocDeco(view) {\n  var attrs = Object.create(null);\n  attrs.class = \"ProseMirror\";\n  attrs.contenteditable = String(view.editable);\n\n  view.someProp(\"attributes\", function (value) {\n    if (typeof value == \"function\") { value = value(view.state); }\n    if (value) { for (var attr in value) {\n      if (attr == \"class\")\n        { attrs.class += \" \" + value[attr]; }\n      else if (!attrs[attr] && attr != \"contenteditable\" && attr != \"nodeName\")\n        { attrs[attr] = String(value[attr]); }\n    } }\n  });\n\n  return [Decoration.node(0, view.state.doc.content.size, attrs)]\n}\n\nfunction updateCursorWrapper(view) {\n  var ref = view.state.selection;\n  var $head = ref.$head;\n  var $anchor = ref.$anchor;\n  var visible = ref.visible;\n  if (view.markCursor) {\n    var dom = document.createElement(\"img\");\n    dom.setAttribute(\"mark-placeholder\", \"true\");\n    view.cursorWrapper = {dom: dom, deco: Decoration.widget($head.pos, dom, {raw: true, marks: view.markCursor})};\n  } else if (visible || $head.pos != $anchor.pos) {\n    view.cursorWrapper = null;\n  } else {\n    var dom$1;\n    if (!view.cursorWrapper || view.cursorWrapper.dom.childNodes.length) {\n      dom$1 = document.createElement(\"div\");\n      dom$1.style.position = \"absolute\";\n      dom$1.style.left = \"-100000px\";\n    } else if (view.cursorWrapper.deco.pos != $head.pos) {\n      dom$1 = view.cursorWrapper.dom;\n    }\n    if (dom$1)\n      { view.cursorWrapper = {dom: dom$1, deco: Decoration.widget($head.pos, dom$1, {raw: true})}; }\n  }\n}\n\nfunction getEditable(view) {\n  return !view.someProp(\"editable\", function (value) { return value(view.state) === false; })\n}\n\nfunction selectionContext(root) {\n  var ref = root.getSelection();\n  var offset = ref.focusOffset;\n  var node = ref.focusNode;\n  if (!node || node.nodeType == 3) { return null }\n  return [node, offset,\n          node.nodeType == 1 ? node.childNodes[offset - 1] : null,\n          node.nodeType == 1 ? node.childNodes[offset] : null]\n}\n\nfunction needChromeSelectionForce(context, root) {\n  var newContext = selectionContext(root);\n  if (!newContext || newContext[0].nodeType == 3) { return false }\n  for (var i = 0; i < context.length; i++) { if (newContext[i] != context[i]) { return true } }\n  return false\n}\n\nfunction buildNodeViews(view) {\n  var result$$1 = {};\n  view.someProp(\"nodeViews\", function (obj) {\n    for (var prop in obj) { if (!Object.prototype.hasOwnProperty.call(result$$1, prop))\n      { result$$1[prop] = obj[prop]; } }\n  });\n  return result$$1\n}\n\nfunction changedNodeViews(a, b) {\n  var nA = 0, nB = 0;\n  for (var prop in a) {\n    if (a[prop] != b[prop]) { return true }\n    nA++;\n  }\n  for (var _ in b) { nB++; }\n  return nA != nB\n}\n\n// EditorProps:: interface\n//\n// Props are configuration values that can be passed to an editor view\n// or included in a plugin. This interface lists the supported props.\n//\n// The various event-handling functions may all return `true` to\n// indicate that they handled the given event. The view will then take\n// care to call `preventDefault` on the event, except with\n// `handleDOMEvents`, where the handler itself is responsible for that.\n//\n// How a prop is resolved depends on the prop. Handler functions are\n// called one at a time, starting with the base props and then\n// searching through the plugins (in order of appearance) until one of\n// them returns true. For some props, the first plugin that yields a\n// value gets precedence.\n//\n//   handleDOMEvents:: ?Object<(view: EditorView, event: dom.Event) → bool>\n//   Can be an object mapping DOM event type names to functions that\n//   handle them. Such functions will be called before any handling\n//   ProseMirror does of events fired on the editable DOM element.\n//   Contrary to the other event handling props, when returning true\n//   from such a function, you are responsible for calling\n//   `preventDefault` yourself (or not, if you want to allow the\n//   default behavior).\n//\n//   handleKeyDown:: ?(view: EditorView, event: dom.KeyboardEvent) → bool\n//   Called when the editor receives a `keydown` event.\n//\n//   handleKeyPress:: ?(view: EditorView, event: dom.KeyboardEvent) → bool\n//   Handler for `keypress` events.\n//\n//   handleTextInput:: ?(view: EditorView, from: number, to: number, text: string) → bool\n//   Whenever the user directly input text, this handler is called\n//   before the input is applied. If it returns `true`, the default\n//   behavior of actually inserting the text is suppressed.\n//\n//   handleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool\n//   Called for each node around a click, from the inside out. The\n//   `direct` flag will be true for the inner node.\n//\n//   handleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool\n//   Called when the editor is clicked, after `handleClickOn` handlers\n//   have been called.\n//\n//   handleDoubleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool\n//   Called for each node around a double click.\n//\n//   handleDoubleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool\n//   Called when the editor is double-clicked, after `handleDoubleClickOn`.\n//\n//   handleTripleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool\n//   Called for each node around a triple click.\n//\n//   handleTripleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool\n//   Called when the editor is triple-clicked, after `handleTripleClickOn`.\n//\n//   handlePaste:: ?(view: EditorView, event: dom.Event, slice: Slice) → bool\n//   Can be used to override the behavior of pasting. `slice` is the\n//   pasted content parsed by the editor, but you can directly access\n//   the event to get at the raw content.\n//\n//   handleDrop:: ?(view: EditorView, event: dom.Event, slice: Slice, moved: bool) → bool\n//   Called when something is dropped on the editor. `moved` will be\n//   true if this drop moves from the current selection (which should\n//   thus be deleted).\n//\n//   handleScrollToSelection:: ?(view: EditorView) → bool\n//   Called when the view, after updating its state, tries to scroll\n//   the selection into view. A handler function may return false to\n//   indicate that it did not handle the scrolling and further\n//   handlers or the default behavior should be tried.\n//\n//   createSelectionBetween:: ?(view: EditorView, anchor: ResolvedPos, head: ResolvedPos) → ?Selection\n//   Can be used to override the way a selection is created when\n//   reading a DOM selection between the given anchor and head.\n//\n//   domParser:: ?DOMParser\n//   The [parser](#model.DOMParser) to use when reading editor changes\n//   from the DOM. Defaults to calling\n//   [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) on the\n//   editor's schema.\n//\n//   transformPastedHTML:: ?(html: string) → string\n//   Can be used to transform pasted HTML text, _before_ it is parsed,\n//   for example to clean it up.\n//\n//   clipboardParser:: ?DOMParser\n//   The [parser](#model.DOMParser) to use when reading content from\n//   the clipboard. When not given, the value of the\n//   [`domParser`](#view.EditorProps.domParser) prop is used.\n//\n//   transformPastedText:: ?(text: string) → string\n//   Transform pasted plain text.\n//\n//   clipboardTextParser:: ?(text: string, $context: ResolvedPos) → Slice\n//   A function to parse text from the clipboard into a document\n//   slice. Called after\n//   [`transformPastedText`](#view.EditorProps.transformPastedText).\n//   The default behavior is to split the text into lines, wrap them\n//   in `<p>` tags, and call\n//   [`clipboardParser`](#view.EditorProps.clipboardParser) on it.\n//\n//   transformPasted:: ?(Slice) → Slice\n//   Can be used to transform pasted content before it is applied to\n//   the document.\n//\n//   nodeViews:: ?Object<(node: Node, view: EditorView, getPos: () → number, decorations: [Decoration]) → NodeView>\n//   Allows you to pass custom rendering and behavior logic for nodes\n//   and marks. Should map node and mark names to constructor\n//   functions that produce a [`NodeView`](#view.NodeView) object\n//   implementing the node's display behavior. For nodes, the third\n//   argument `getPos` is a function that can be called to get the\n//   node's current position, which can be useful when creating\n//   transactions to update it. For marks, the third argument is a\n//   boolean that indicates whether the mark's content is inline.\n//\n//   `decorations` is an array of node or inline decorations that are\n//   active around the node. They are automatically drawn in the\n//   normal way, and you will usually just want to ignore this, but\n//   they can also be used as a way to provide context information to\n//   the node view without adding it to the document itself.\n//\n//   clipboardSerializer:: ?DOMSerializer\n//   The DOM serializer to use when putting content onto the\n//   clipboard. If not given, the result of\n//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)\n//   will be used.\n//\n//   clipboardTextSerializer:: ?(Slice) → string\n//   A function that will be called to get the text for the current\n//   selection when copying text to the clipboard. By default, the\n//   editor will use [`textBetween`](#model.Node.textBetween) on the\n//   selected range.\n//\n//   decorations:: ?(state: EditorState) → ?DecorationSet\n//   A set of [document decorations](#view.Decoration) to show in the\n//   view.\n//\n//   editable:: ?(state: EditorState) → bool\n//   When this returns false, the content of the view is not directly\n//   editable.\n//\n//   attributes:: ?union<Object<string>, (EditorState) → ?Object<string>>\n//   Control the DOM attributes of the editable element. May be either\n//   an object or a function going from an editor state to an object.\n//   By default, the element will get a class `\"ProseMirror\"`, and\n//   will have its `contentEditable` attribute determined by the\n//   [`editable` prop](#view.EditorProps.editable). Additional classes\n//   provided here will be added to the class. For other attributes,\n//   the value provided first (as in\n//   [`someProp`](#view.EditorView.someProp)) will be used.\n//\n//   scrollThreshold:: ?union<number, {top: number, right: number, bottom: number, left: number}>\n//   Determines the distance (in pixels) between the cursor and the\n//   end of the visible viewport at which point, when scrolling the\n//   cursor into view, scrolling takes place. Defaults to 0.\n//\n//   scrollMargin:: ?union<number, {top: number, right: number, bottom: number, left: number}>\n//   Determines the extra space (in pixels) that is left above or\n//   below the cursor when it is scrolled into view. Defaults to 5.\n\n// DirectEditorProps:: interface extends EditorProps\n//\n// The props object given directly to the editor view supports two\n// fields that can't be used in plugins:\n//\n//   state:: EditorState\n//   The current state of the editor.\n//\n//   dispatchTransaction:: ?(tr: Transaction)\n//   The callback over which to send transactions (state updates)\n//   produced by the view. If you specify this, you probably want to\n//   make sure this ends up calling the view's\n//   [`updateState`](#view.EditorView.updateState) method with a new\n//   state that has the transaction\n//   [applied](#state.EditorState.apply). The callback will be bound to have\n//   the view instance as its `this` binding.\n\nexports.EditorView = EditorView;\nexports.Decoration = Decoration;\nexports.DecorationSet = DecorationSet;\nexports.__serializeForClipboard = serializeForClipboard;\nexports.__parseFromClipboard = parseFromClipboard;\nexports.__endComposition = endComposition;\n//# sourceMappingURL=index.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorState = require('prosemirror-state');\nvar prosemirrorTransform = require('prosemirror-transform');\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.\nvar InputRule = function InputRule(match, handler) {\n  this.match = match;\n  this.handler = typeof handler == \"string\" ? stringHandler(handler) : handler;\n};\n\nfunction stringHandler(string) {\n  return function(state, match, start, end) {\n    var insert = string;\n    if (match[1]) {\n      var offset = match[0].lastIndexOf(match[1]);\n      insert += match[0].slice(offset + match[1].length);\n      start += offset;\n      var 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\nvar 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.\nfunction inputRules(ref) {\n  var rules = ref.rules;\n\n  var plugin = new prosemirrorState.Plugin({\n    state: {\n      init: function init() { return null },\n      apply: function apply(tr, prev) {\n        var stored = tr.getMeta(this);\n        if (stored) { return stored }\n        return tr.selectionSet || tr.docChanged ? null : prev\n      }\n    },\n\n    props: {\n      handleTextInput: function handleTextInput(view, from, to, text) {\n        return run(view, from, to, text, rules, plugin)\n      },\n      handleDOMEvents: {\n        compositionend: function (view) {\n          setTimeout(function () {\n            var ref = view.state.selection;\n            var $cursor = ref.$cursor;\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  var state = view.state, $from = state.doc.resolve(from);\n  if ($from.parent.type.spec.code) { return false }\n  var textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset,\n                                            null, \"\\ufffc\") + text;\n  for (var i = 0; i < rules.length; i++) {\n    var match = rules[i].match.exec(textBefore);\n    var 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: from, to: to, text: 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.\nfunction undoInputRule(state, dispatch) {\n  var plugins = state.plugins;\n  for (var i = 0; i < plugins.length; i++) {\n    var plugin = plugins[i], undoable = (void 0);\n    if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {\n      if (dispatch) {\n        var tr = state.tr, toUndo = undoable.transform;\n        for (var j = toUndo.steps.length - 1; j >= 0; j--)\n          { tr.step(toUndo.steps[j].invert(toUndo.docs[j])); }\n        var marks = tr.doc.resolve(undoable.from).marks();\n        dispatch(tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks)));\n      }\n      return true\n    }\n  }\n  return false\n}\n\n// :: InputRule Converts double dashes to an emdash.\nvar emDash = new InputRule(/--$/, \"—\");\n// :: InputRule Converts three dots to an ellipsis character.\nvar ellipsis = new InputRule(/\\.\\.\\.$/, \"…\");\n// :: InputRule “Smart” opening double quotes.\nvar openDoubleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(\")$/, \"“\");\n// :: InputRule “Smart” closing double quotes.\nvar closeDoubleQuote = new InputRule(/\"$/, \"”\");\n// :: InputRule “Smart” opening single quotes.\nvar openSingleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(')$/, \"‘\");\n// :: InputRule “Smart” closing single quotes.\nvar closeSingleQuote = new InputRule(/'$/, \"’\");\n\n// :: [InputRule] Smart-quote related input rules.\nvar smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];\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.\nfunction wrappingInputRule(regexp, nodeType, getAttrs, joinPredicate) {\n  return new InputRule(regexp, function (state, match, start, end) {\n    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n    var tr = state.tr.delete(start, end);\n    var $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && prosemirrorTransform.findWrapping(range, nodeType, attrs);\n    if (!wrapping) { return null }\n    tr.wrap(range, wrapping);\n    var before = tr.doc.resolve(start - 1).nodeBefore;\n    if (before && before.type == nodeType && prosemirrorTransform.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.\nfunction textblockTypeInputRule(regexp, nodeType, getAttrs) {\n  return new InputRule(regexp, function (state, match, start, end) {\n    var $start = state.doc.resolve(start);\n    var 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\nexports.InputRule = InputRule;\nexports.inputRules = inputRules;\nexports.undoInputRule = undoInputRule;\nexports.emDash = emDash;\nexports.ellipsis = ellipsis;\nexports.openDoubleQuote = openDoubleQuote;\nexports.closeDoubleQuote = closeDoubleQuote;\nexports.openSingleQuote = openSingleQuote;\nexports.closeSingleQuote = closeSingleQuote;\nexports.smartQuotes = smartQuotes;\nexports.wrappingInputRule = wrappingInputRule;\nexports.textblockTypeInputRule = textblockTypeInputRule;\n//# sourceMappingURL=index.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorTransform = require('prosemirror-transform');\nvar prosemirrorModel = require('prosemirror-model');\n\nvar olDOM = [\"ol\", 0];\nvar ulDOM = [\"ul\", 0];\nvar 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.\nvar orderedList = {\n  attrs: {order: {default: 1}},\n  parseDOM: [{tag: \"ol\", getAttrs: function getAttrs(dom) {\n    return {order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1}\n  }}],\n  toDOM: function 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>`.\nvar bulletList = {\n  parseDOM: [{tag: \"ul\"}],\n  toDOM: function toDOM() { return ulDOM }\n};\n\n// :: NodeSpec\n// A list item (`<li>`) spec.\nvar listItem = {\n  parseDOM: [{tag: \"li\"}],\n  toDOM: function toDOM() { return liDOM },\n  defining: true\n};\n\nfunction add(obj, props) {\n  var copy = {};\n  for (var prop in obj) { copy[prop] = obj[prop]; }\n  for (var prop$1 in props) { copy[prop$1] = props[prop$1]; }\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\"`.\nfunction 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.\nfunction wrapInList(listType, attrs) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var $from = ref.$from;\n    var $to = ref.$to;\n    var 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      var $insert = state.doc.resolve(range.start - 2);\n      outerRange = new prosemirrorModel.NodeRange($insert, $insert, range.depth);\n      if (range.endIndex < range.parent.childCount)\n        { range = new prosemirrorModel.NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth); }\n      doJoin = true;\n    }\n    var wrap = prosemirrorTransform.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  var content = prosemirrorModel.Fragment.empty;\n  for (var i = wrappers.length - 1; i >= 0; i--)\n    { content = prosemirrorModel.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }\n\n  tr.step(new prosemirrorTransform.ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end,\n                                new prosemirrorModel.Slice(content, 0, 0), wrappers.length, true));\n\n  var found = 0;\n  for (var i$1 = 0; i$1 < wrappers.length; i$1++) { if (wrappers[i$1].type == listType) { found = i$1 + 1; } }\n  var splitDepth = wrappers.length - found;\n\n  var splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;\n  for (var i$2 = range.startIndex, e = range.endIndex, first = true; i$2 < e; i$2++, first = false) {\n    if (!first && prosemirrorTransform.canSplit(tr.doc, splitPos, splitDepth)) {\n      tr.split(splitPos, splitDepth);\n      splitPos += 2 * splitDepth;\n    }\n    splitPos += parent.child(i$2).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.\nfunction splitListItem(itemType) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var $from = ref.$from;\n    var $to = ref.$to;\n    var node = ref.node;\n    if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to)) { return false }\n    var grandParent = $from.node(-1);\n    if (grandParent.type != itemType) { return false }\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 ||\n          $from.index(-2) != $from.node(-2).childCount - 1) { return false }\n      if (dispatch) {\n        var wrap = prosemirrorModel.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 (var d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--)\n          { wrap = prosemirrorModel.Fragment.from($from.node(d).copy(wrap)); }\n        // Add a second list item with an empty default start node\n        wrap = wrap.append(prosemirrorModel.Fragment.from(itemType.createAndFill()));\n        var tr$1 = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new prosemirrorModel.Slice(wrap, keepItem ? 3 : 2, 2));\n        tr$1.setSelection(state.selection.constructor.near(tr$1.doc.resolve($from.pos + (keepItem ? 3 : 2))));\n        dispatch(tr$1.scrollIntoView());\n      }\n      return true\n    }\n    var nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null;\n    var tr = state.tr.delete($from.pos, $to.pos);\n    var types = nextType && [null, {type: nextType}];\n    if (!prosemirrorTransform.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.\nfunction liftListItem(itemType) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var $from = ref.$from;\n    var $to = ref.$to;\n    var range = $from.blockRange($to, function (node) { return 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  var 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 prosemirrorTransform.ReplaceAroundStep(end - 1, endOfList, end, endOfList,\n                                  new prosemirrorModel.Slice(prosemirrorModel.Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));\n    range = new prosemirrorModel.NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);\n  }\n  dispatch(tr.lift(range, prosemirrorTransform.liftTarget(range)).scrollIntoView());\n  return true\n}\n\nfunction liftOutOfList(state, dispatch, range) {\n  var tr = state.tr, list = range.parent;\n  // Merge the list items into a single big item\n  for (var 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  var $start = tr.doc.resolve(range.start), item = $start.nodeAfter;\n  var atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;\n  var parent = $start.node(-1), indexBefore = $start.index(-1);\n  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1,\n                         item.content.append(atEnd ? prosemirrorModel.Fragment.empty : prosemirrorModel.Fragment.from(list))))\n    { return false }\n  var 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 prosemirrorTransform.ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1,\n                                new prosemirrorModel.Slice((atStart ? prosemirrorModel.Fragment.empty : prosemirrorModel.Fragment.from(list.copy(prosemirrorModel.Fragment.empty)))\n                                          .append(atEnd ? prosemirrorModel.Fragment.empty : prosemirrorModel.Fragment.from(list.copy(prosemirrorModel.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.\nfunction sinkListItem(itemType) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var $from = ref.$from;\n    var $to = ref.$to;\n    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });\n    if (!range) { return false }\n    var startIndex = range.startIndex;\n    if (startIndex == 0) { return false }\n    var parent = range.parent, nodeBefore = parent.child(startIndex - 1);\n    if (nodeBefore.type != itemType) { return false }\n\n    if (dispatch) {\n      var nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;\n      var inner = prosemirrorModel.Fragment.from(nestedBefore ? itemType.create() : null);\n      var slice = new prosemirrorModel.Slice(prosemirrorModel.Fragment.from(itemType.create(null, prosemirrorModel.Fragment.from(parent.type.create(null, inner)))),\n                            nestedBefore ? 3 : 1, 0);\n      var before = range.start, after = range.end;\n      dispatch(state.tr.step(new prosemirrorTransform.ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after,\n                                                   before, after, slice, 1, true))\n               .scrollIntoView());\n    }\n    return true\n  }\n}\n\nexports.orderedList = orderedList;\nexports.bulletList = bulletList;\nexports.listItem = listItem;\nexports.addListNodes = addListNodes;\nexports.wrapInList = wrapInList;\nexports.splitListItem = splitListItem;\nexports.liftListItem = liftListItem;\nexports.sinkListItem = sinkListItem;\n//# sourceMappingURL=schema-list.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorState = require('prosemirror-state');\nvar prosemirrorModel = require('prosemirror-model');\nvar prosemirrorTables = require('prosemirror-tables');\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// ```\nvar removeParentNodeOfType = function removeParentNodeOfType(nodeType) {\n  return function (tr) {\n    var parent = findParentNodeOfType(nodeType)(tr.selection);\n    if (parent) {\n      return removeNodeAtPos(parent.pos)(tr);\n    }\n    return tr;\n  };\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// ```\nvar replaceParentNodeOfType = function replaceParentNodeOfType(nodeType, content) {\n  return function (tr) {\n    if (!Array.isArray(nodeType)) {\n      nodeType = [nodeType];\n    }\n    for (var i = 0, count = nodeType.length; i < count; i++) {\n      var parent = findParentNodeOfType(nodeType[i])(tr.selection);\n      if (parent) {\n        var newTr = replaceNodeAtPos(parent.pos, content)(tr);\n        if (newTr !== tr) {\n          return newTr;\n        }\n      }\n    }\n    return tr;\n  };\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// ```\nvar removeSelectedNode = function removeSelectedNode(tr) {\n  if (isNodeSelection(tr.selection)) {\n    var from = tr.selection.$from.pos;\n    var 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// ```\nvar replaceSelectedNode = function replaceSelectedNode(content) {\n  return function (tr) {\n    if (isNodeSelection(tr.selection)) {\n      var _tr$selection = tr.selection,\n          $from = _tr$selection.$from,\n          $to = _tr$selection.$to;\n\n      if (content instanceof prosemirrorModel.Fragment && $from.parent.canReplace($from.index(), $from.indexAfter(), content) || $from.parent.canReplaceWith($from.index(), $from.indexAfter(), content.type)) {\n        return cloneTr(tr.replaceWith($from.pos, $to.pos, content)\n        // restore node selection\n        .setSelection(new prosemirrorState.NodeSelection(tr.doc.resolve($from.pos))));\n      }\n    }\n    return tr;\n  };\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// ```\nvar setTextSelection = function setTextSelection(position) {\n  var dir = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return function (tr) {\n    var nextSelection = prosemirrorState.Selection.findFrom(tr.doc.resolve(position), dir, true);\n    if (nextSelection) {\n      return tr.setSelection(nextSelection);\n    }\n    return tr;\n  };\n};\n\nvar isSelectableNode = function isSelectableNode(node) {\n  return node.type && node.type.spec.selectable;\n};\nvar shouldSelectNode = function shouldSelectNode(node) {\n  return isSelectableNode(node) && node.type.isLeaf;\n};\n\nvar setSelection = function setSelection(node, pos, tr) {\n  if (shouldSelectNode(node)) {\n    return tr.setSelection(new prosemirrorState.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// ```\nvar safeInsert = function safeInsert(content, position, tryToReplace) {\n  return function (tr) {\n    var hasPosition = typeof position === 'number';\n    var $from = tr.selection.$from;\n\n    var $insertPos = hasPosition ? tr.doc.resolve(position) : isNodeSelection(tr.selection) ? tr.doc.resolve($from.pos + 1) : $from;\n    var parent = $insertPos.parent;\n\n    // try to replace selected node\n\n    if (isNodeSelection(tr.selection) && tryToReplace) {\n      var 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      var _oldTr = tr;\n      tr = replaceParentNodeOfType(parent.type, content)(tr);\n      if (_oldTr !== tr) {\n        var pos = isSelectableNode(content) ? // for selectable node, selection position would be the position of the replaced parent\n        $insertPos.before($insertPos.depth) : $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      var _pos = hasPosition ? $insertPos.pos : isSelectableNode(content) ? // for atom nodes selection position after insertion is the previous pos\n      tr.selection.$anchor.pos - 1 : 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 (var i = $insertPos.depth; i > 0; i--) {\n      var _pos2 = $insertPos.after(i);\n      var $pos = tr.doc.resolve(_pos2);\n      if (canInsert($pos, content)) {\n        tr.insert(_pos2, content);\n        return cloneTr(setSelection(content, _pos2, tr));\n      }\n    }\n    return tr;\n  };\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// ```\nvar setParentNodeMarkup = function setParentNodeMarkup(nodeType, type, attrs, marks) {\n  return function (tr) {\n    var parent = findParentNodeOfType(nodeType)(tr.selection);\n    if (parent) {\n      return cloneTr(tr.setNodeMarkup(parent.pos, type, Object.assign({}, parent.node.attrs, attrs), marks));\n    }\n    return tr;\n  };\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// ```\nvar selectParentNodeOfType = function selectParentNodeOfType(nodeType) {\n  return function (tr) {\n    if (!isNodeSelection(tr.selection)) {\n      var parent = findParentNodeOfType(nodeType)(tr.selection);\n      if (parent) {\n        return cloneTr(tr.setSelection(prosemirrorState.NodeSelection.create(tr.doc, parent.pos)));\n      }\n    }\n    return tr;\n  };\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// ```\nvar removeNodeBefore = function removeNodeBefore(tr) {\n  var position = findPositionOfNodeBefore(tr.selection);\n  if (typeof position === 'number') {\n    return removeNodeAtPos(position)(tr);\n  }\n  return tr;\n};\n\n// :: (selection: Selection) → boolean\n// Checks if current selection is a `NodeSelection`.\n//\n// ```javascript\n// if (isNodeSelection(tr.selection)) {\n//   // ...\n// }\n// ```\nvar isNodeSelection = function isNodeSelection(selection) {\n  return selection instanceof prosemirrorState.NodeSelection;\n};\n\n// (nodeType: union<NodeType, [NodeType]>) → boolean\n// Checks if the type a given `node` equals to a given `nodeType`.\nvar equalNodeType = function equalNodeType(nodeType, node) {\n  return Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1 || node.type === nodeType;\n};\n\n// (tr: Transaction) → Transaction\n// Creates a new transaction object from a given transaction\nvar cloneTr = function 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.\nvar replaceNodeAtPos = function replaceNodeAtPos(position, content) {\n  return function (tr) {\n    var node = tr.doc.nodeAt(position);\n    var $pos = tr.doc.resolve(position);\n    if (canReplace($pos, content)) {\n      tr = tr.replaceWith(position, position + node.nodeSize, content);\n      var 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\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.\nvar canReplace = function canReplace($pos, content) {\n  var node = $pos.node($pos.depth);\n  return node && node.type.validContent(content instanceof prosemirrorModel.Fragment ? content : prosemirrorModel.Fragment.from(content));\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.\nvar removeNodeAtPos = function removeNodeAtPos(position) {\n  return function (tr) {\n    var node = tr.doc.nodeAt(position);\n    return cloneTr(tr.delete(position, position + node.nodeSize));\n  };\n};\n\n// (schema: Schema) → {[key: string]: NodeType}\n// Returns a map where keys are tableRoles and values are NodeTypes.\nvar tableNodeTypes = function tableNodeTypes(schema) {\n  if (schema.cached.tableNodeTypes) {\n    return schema.cached.tableNodeTypes;\n  }\n  var roles = {};\n  Object.keys(schema.nodes).forEach(function (type) {\n    var 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// ```\nvar canInsert = function canInsert($pos, content) {\n  var index = $pos.index();\n\n  if (content instanceof prosemirrorModel.Fragment) {\n    return $pos.parent.canReplace(index, index, content);\n  } else if (content instanceof prosemirrorModel.Node) {\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\nvar isEmptyParagraph = function 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// ```\nvar findTableClosestToPos = function findTableClosestToPos($pos) {\n  var predicate = function predicate(node) {\n    return node.type.spec.tableRole && /table/i.test(node.type.spec.tableRole);\n  };\n  return findParentNodeClosestToPos($pos, predicate);\n};\n\nvar createCell = function createCell(cellType) {\n  var cellContent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n\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\nvar isRectSelected = function isRectSelected(rect) {\n  return function (selection) {\n    var map = prosemirrorTables.TableMap.get(selection.$anchorCell.node(-1));\n    var start = selection.$anchorCell.start(-1);\n    var cells = map.cellsInRect(rect);\n    var selectedCells = map.cellsInRect(map.rectBetween(selection.$anchorCell.pos - start, selection.$headCell.pos - start));\n\n    for (var 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\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// ```\nvar transpose = function transpose(array) {\n  return array[0].map(function (_, i) {\n    return array.map(function (column) {\n      return column[i];\n    });\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// ```\nvar convertTableNodeToArrayOfRows = function convertTableNodeToArrayOfRows(tableNode) {\n  var map = prosemirrorTables.TableMap.get(tableNode);\n  var rows = [];\n  for (var rowIndex = 0; rowIndex < map.height; rowIndex++) {\n    var rowCells = [];\n    var seen = {};\n\n    for (var colIndex = 0; colIndex < map.width; colIndex++) {\n      var cellPos = map.map[rowIndex * map.width + colIndex];\n      var cell = tableNode.nodeAt(cellPos);\n      var 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//\nvar convertArrayOfRowsToTableNode = function convertArrayOfRowsToTableNode(tableNode, arrayOfNodes) {\n  var rowsPM = [];\n  var map = prosemirrorTables.TableMap.get(tableNode);\n  for (var rowIndex = 0; rowIndex < map.height; rowIndex++) {\n    var row = tableNode.child(rowIndex);\n    var rowCells = [];\n\n    for (var colIndex = 0; colIndex < map.width; colIndex++) {\n      if (!arrayOfNodes[rowIndex][colIndex]) {\n        continue;\n      }\n      var cellPos = map.map[rowIndex * map.width + colIndex];\n\n      var cell = arrayOfNodes[rowIndex][colIndex];\n      var oldCell = tableNode.nodeAt(cellPos);\n      var newCell = oldCell.type.createChecked(Object.assign({}, cell.attrs), cell.content, cell.marks);\n      rowCells.push(newCell);\n    }\n\n    rowsPM.push(row.type.createChecked(row.attrs, rowCells, row.marks));\n  }\n\n  var newTable = tableNode.type.createChecked(tableNode.attrs, rowsPM, tableNode.marks);\n\n  return newTable;\n};\n\nvar moveTableColumn = function moveTableColumn(table, indexesOrigin, indexesTarget, direction) {\n  var 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\nvar moveTableRow = function moveTableRow(table, indexesOrigin, indexesTarget, direction) {\n  var rows = convertTableNodeToArrayOfRows(table.node);\n\n  rows = moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, direction);\n\n  return convertArrayOfRowsToTableNode(table.node, rows);\n};\n\nvar moveRowInArrayOfRows = function moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, directionOverride) {\n  var direction = indexesOrigin[0] > indexesTarget[0] ? -1 : 1;\n\n  var rowsExtracted = rows.splice(indexesOrigin[0], indexesOrigin.length);\n  var positionOffset = rowsExtracted.length % 2 === 0 ? 1 : 0;\n  var target = void 0;\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 = direction === -1 ? indexesTarget[0] : indexesTarget[indexesTarget.length - 1] - positionOffset;\n  }\n\n  rows.splice.apply(rows, [target, 0].concat(rowsExtracted));\n  return rows;\n};\n\nvar checkInvalidMovements = function checkInvalidMovements(originIndex, targetIndex, targets, type) {\n  var direction = originIndex > targetIndex ? -1 : 1;\n  var 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\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// ```\nvar findParentNode = function findParentNode(predicate) {\n  return function (_ref) {\n    var $from = _ref.$from;\n    return findParentNodeClosestToPos($from, predicate);\n  };\n};\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// ```\nvar findParentNodeClosestToPos = function findParentNodeClosestToPos($pos, predicate) {\n  for (var i = $pos.depth; i > 0; i--) {\n    var 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: 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// ```\nvar findParentDomRef = function findParentDomRef(predicate, domAtPos) {\n  return function (selection) {\n    var parent = findParentNode(predicate)(selection);\n    if (parent) {\n      return findDomRefAtPos(parent.pos, domAtPos);\n    }\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// ```\nvar hasParentNode = function hasParentNode(predicate) {\n  return function (selection) {\n    return !!findParentNode(predicate)(selection);\n  };\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// ```\nvar findParentNodeOfType = function findParentNodeOfType(nodeType) {\n  return function (selection) {\n    return findParentNode(function (node) {\n      return equalNodeType(nodeType, node);\n    })(selection);\n  };\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// ```\nvar findParentNodeOfTypeClosestToPos = function findParentNodeOfTypeClosestToPos($pos, nodeType) {\n  return findParentNodeClosestToPos($pos, function (node) {\n    return 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// ```\nvar hasParentNodeOfType = function hasParentNodeOfType(nodeType) {\n  return function (selection) {\n    return hasParentNode(function (node) {\n      return equalNodeType(nodeType, node);\n    })(selection);\n  };\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// ```\nvar findParentDomRefOfType = function findParentDomRefOfType(nodeType, domAtPos) {\n  return function (selection) {\n    return findParentDomRef(function (node) {\n      return equalNodeType(nodeType, node);\n    }, domAtPos)(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// ```\nvar findSelectedNodeOfType = function findSelectedNodeOfType(nodeType) {\n  return function (selection) {\n    if (isNodeSelection(selection)) {\n      var node = selection.node,\n          $from = selection.$from;\n\n      if (equalNodeType(nodeType, node)) {\n        return { node: node, pos: $from.pos, depth: $from.depth };\n      }\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// ```\nvar findPositionOfNodeBefore = function findPositionOfNodeBefore(selection) {\n  var nodeBefore = selection.$from.nodeBefore;\n\n  var maybeSelection = prosemirrorState.Selection.findFrom(selection.$from, -1);\n  if (maybeSelection && nodeBefore) {\n    // leaf node\n    var 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// ```\nvar findDomRefAtPos = function findDomRefAtPos(position, domAtPos) {\n  var dom = domAtPos(position);\n  var 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\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// ```\nvar flatten = function flatten(node) {\n  var descend = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n\n  if (!node) {\n    throw new Error('Invalid \"node\" parameter');\n  }\n  var result = [];\n  node.descendants(function (child, pos) {\n    result.push({ node: child, pos: 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// ```\nvar findChildren = function 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(function (child) {\n    return predicate(child.node);\n  });\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// ```\nvar findTextNodes = function findTextNodes(node, descend) {\n  return findChildren(node, function (child) {\n    return child.isText;\n  }, 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// ```\nvar findInlineNodes = function findInlineNodes(node, descend) {\n  return findChildren(node, function (child) {\n    return child.isInline;\n  }, 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// ```\nvar findBlockNodes = function findBlockNodes(node, descend) {\n  return findChildren(node, function (child) {\n    return child.isBlock;\n  }, 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// ```\nvar findChildrenByAttr = function findChildrenByAttr(node, predicate, descend) {\n  return findChildren(node, function (child) {\n    return !!predicate(child.attrs);\n  }, 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// ```\nvar findChildrenByType = function findChildrenByType(node, nodeType, descend) {\n  return findChildren(node, function (child) {\n    return child.type === nodeType;\n  }, 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// ```\nvar findChildrenByMark = function findChildrenByMark(node, markType, descend) {\n  return findChildren(node, function (child) {\n    return markType.isInSet(child.marks);\n  }, 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// ```\nvar contains = function contains(node, nodeType) {\n  return !!findChildrenByType(node, nodeType).length;\n};\n\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\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// ```\nvar findTable = function findTable(selection) {\n  return findParentNode(function (node) {\n    return node.type.spec.tableRole && node.type.spec.tableRole === 'table';\n  })(selection);\n};\n\n// :: (selection: Selection) → boolean\n// Checks if current selection is a `CellSelection`.\n//\n// ```javascript\n// if (isCellSelection(selection)) {\n//   // ...\n// }\n// ```\nvar isCellSelection = function isCellSelection(selection) {\n  return selection instanceof prosemirrorTables.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// ```\nvar getSelectionRect = function getSelectionRect(selection) {\n  if (!isCellSelection(selection)) {\n    return;\n  }\n  var start = selection.$anchorCell.start(-1);\n  var map = prosemirrorTables.TableMap.get(selection.$anchorCell.node(-1));\n  return map.rectBetween(selection.$anchorCell.pos - start, selection.$headCell.pos - start);\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// ```\nvar isColumnSelected = function isColumnSelected(columnIndex) {\n  return function (selection) {\n    if (isCellSelection(selection)) {\n      var map = prosemirrorTables.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\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// ```\nvar isRowSelected = function isRowSelected(rowIndex) {\n  return function (selection) {\n    if (isCellSelection(selection)) {\n      var map = prosemirrorTables.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\n// :: (selection: Selection) → boolean\n// Checks if entire table is selected\n//\n// ```javascript\n// const className = isTableSelected(selection) ? 'selected' : '';\n// ```\nvar isTableSelected = function isTableSelected(selection) {\n  if (isCellSelection(selection)) {\n    var map = prosemirrorTables.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// ```\nvar getCellsInColumn = function getCellsInColumn(columnIndex) {\n  return function (selection) {\n    var table = findTable(selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      var indexes = Array.isArray(columnIndex) ? columnIndex : Array.from([columnIndex]);\n      return indexes.reduce(function (acc, index) {\n        if (index >= 0 && index <= map.width - 1) {\n          var cells = map.cellsInRect({\n            left: index,\n            right: index + 1,\n            top: 0,\n            bottom: map.height\n          });\n          return acc.concat(cells.map(function (nodePos) {\n            var node = table.node.nodeAt(nodePos);\n            var pos = nodePos + table.start;\n            return { pos: pos, start: pos + 1, node: 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// ```\nvar getCellsInRow = function getCellsInRow(rowIndex) {\n  return function (selection) {\n    var table = findTable(selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      var indexes = Array.isArray(rowIndex) ? rowIndex : Array.from([rowIndex]);\n      return indexes.reduce(function (acc, index) {\n        if (index >= 0 && index <= map.height - 1) {\n          var cells = map.cellsInRect({\n            left: 0,\n            right: map.width,\n            top: index,\n            bottom: index + 1\n          });\n          return acc.concat(cells.map(function (nodePos) {\n            var node = table.node.nodeAt(nodePos);\n            var pos = nodePos + table.start;\n            return { pos: pos, start: pos + 1, node: 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// ```\nvar getCellsInTable = function getCellsInTable(selection) {\n  var table = findTable(selection);\n  if (table) {\n    var map = prosemirrorTables.TableMap.get(table.node);\n    var cells = map.cellsInRect({\n      left: 0,\n      right: map.width,\n      top: 0,\n      bottom: map.height\n    });\n    return cells.map(function (nodePos) {\n      var node = table.node.nodeAt(nodePos);\n      var pos = nodePos + table.start;\n      return { pos: pos, start: pos + 1, node: node };\n    });\n  }\n};\n\nvar select = function select(type) {\n  return function (index, expand) {\n    return function (tr) {\n      var table = findTable(tr.selection);\n      var isRowSelection = type === 'row';\n      if (table) {\n        var map = prosemirrorTables.TableMap.get(table.node);\n\n        // Check if the index is valid\n        if (index >= 0 && index < (isRowSelection ? map.height : map.width)) {\n          var left = isRowSelection ? 0 : index;\n          var top = isRowSelection ? index : 0;\n          var right = isRowSelection ? map.width : index + 1;\n          var bottom = isRowSelection ? index + 1 : map.height;\n\n          if (expand) {\n            var cell = findCellClosestToPos(tr.selection.$from);\n            if (!cell) {\n              return tr;\n            }\n\n            var 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          var cellsInFirstRow = map.cellsInRect({\n            left: left,\n            top: top,\n            right: isRowSelection ? right : left + 1,\n            bottom: isRowSelection ? top + 1 : bottom\n          });\n\n          var cellsInLastRow = bottom - top === 1 ? cellsInFirstRow : map.cellsInRect({\n            left: isRowSelection ? left : right - 1,\n            top: isRowSelection ? bottom - 1 : top,\n            right: right,\n            bottom: bottom\n          });\n\n          var head = table.start + cellsInFirstRow[0];\n          var anchor = table.start + cellsInLastRow[cellsInLastRow.length - 1];\n          var $head = tr.doc.resolve(head);\n          var $anchor = tr.doc.resolve(anchor);\n\n          return cloneTr(tr.setSelection(new prosemirrorTables.CellSelection($anchor, $head)));\n        }\n      }\n      return tr;\n    };\n  };\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// ```\nvar 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// ```\nvar 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// ```\nvar selectTable = function selectTable(tr) {\n  var table = findTable(tr.selection);\n  if (table) {\n    var _TableMap$get = prosemirrorTables.TableMap.get(table.node),\n        map = _TableMap$get.map;\n\n    if (map && map.length) {\n      var head = table.start + map[0];\n      var anchor = table.start + map[map.length - 1];\n      var $head = tr.doc.resolve(head);\n      var $anchor = tr.doc.resolve(anchor);\n\n      return cloneTr(tr.setSelection(new prosemirrorTables.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// ```\nvar emptyCell = function emptyCell(cell, schema) {\n  return function (tr) {\n    if (cell) {\n      var _tableNodeTypes$cell$ = tableNodeTypes(schema).cell.createAndFill(),\n          content = _tableNodeTypes$cell$.content;\n\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\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// ```\nvar addColumnAt = function addColumnAt(columnIndex) {\n  return function (tr) {\n    var table = findTable(tr.selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      if (columnIndex >= 0 && columnIndex <= map.width) {\n        return cloneTr(prosemirrorTables.addColumn(tr, {\n          map: map,\n          tableStart: table.start,\n          table: table.node\n        }, columnIndex));\n      }\n    }\n    return tr;\n  };\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// ```\nvar moveRow = function moveRow(originRowIndex, targetRowIndex, opts) {\n  return function (tr) {\n    var defaultOptions = { tryToFit: false, direction: 0 };\n    var options = Object.assign(defaultOptions, opts);\n    var table = findTable(tr.selection);\n    if (!table) {\n      return tr;\n    }\n\n    var _getSelectionRangeInR = getSelectionRangeInRow(originRowIndex)(tr),\n        indexesOriginRow = _getSelectionRangeInR.indexes;\n\n    var _getSelectionRangeInR2 = getSelectionRangeInRow(targetRowIndex)(tr),\n        indexesTargetRow = _getSelectionRangeInR2.indexes;\n\n    if (indexesOriginRow.indexOf(targetRowIndex) > -1) {\n      return tr;\n    }\n\n    if (!options.tryToFit && indexesTargetRow.length > 1) {\n      checkInvalidMovements(originRowIndex, targetRowIndex, indexesTargetRow, 'row');\n    }\n\n    var newTable = moveTableRow(table, indexesOriginRow, indexesTargetRow, options.direction);\n\n    return cloneTr(tr).replaceWith(table.pos, table.pos + table.node.nodeSize, 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// ```\nvar moveColumn = function moveColumn(originColumnIndex, targetColumnIndex, opts) {\n  return function (tr) {\n    var defaultOptions = { tryToFit: false, direction: 0 };\n    var options = Object.assign(defaultOptions, opts);\n    var table = findTable(tr.selection);\n    if (!table) {\n      return tr;\n    }\n\n    var _getSelectionRangeInC = getSelectionRangeInColumn(originColumnIndex)(tr),\n        indexesOriginColumn = _getSelectionRangeInC.indexes;\n\n    var _getSelectionRangeInC2 = getSelectionRangeInColumn(targetColumnIndex)(tr),\n        indexesTargetColumn = _getSelectionRangeInC2.indexes;\n\n    if (indexesOriginColumn.indexOf(targetColumnIndex) > -1) {\n      return tr;\n    }\n\n    if (!options.tryToFit && indexesTargetColumn.length > 1) {\n      checkInvalidMovements(originColumnIndex, targetColumnIndex, indexesTargetColumn, 'column');\n    }\n\n    var newTable = moveTableColumn(table, indexesOriginColumn, indexesTargetColumn, options.direction);\n\n    return cloneTr(tr).replaceWith(table.pos, table.pos + table.node.nodeSize, 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// ```\nvar addRowAt = function addRowAt(rowIndex, clonePreviousRow) {\n  return function (tr) {\n    var table = findTable(tr.selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      var 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(prosemirrorTables.addRow(tr, {\n          map: map,\n          tableStart: table.start,\n          table: table.node\n        }, rowIndex));\n      }\n    }\n    return tr;\n  };\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// ```\nvar cloneRowAt = function cloneRowAt(rowIndex) {\n  return function (tr) {\n    var table = findTable(tr.selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n\n      if (rowIndex >= 0 && rowIndex <= map.height) {\n        var tableNode = table.node;\n        var tableNodes = tableNodeTypes(tableNode.type.schema);\n\n        var rowPos = table.start;\n        for (var i = 0; i < rowIndex + 1; i++) {\n          rowPos += tableNode.child(i).nodeSize;\n        }\n\n        var cloneRow = tableNode.child(rowIndex);\n        // Re-create the same nodes with same attrs, dropping the node content.\n        var cells = [];\n        var rowWidth = 0;\n        cloneRow.forEach(function (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(tableNodes[cell.type.spec.tableRole].createAndFill(cell.attrs, cell.marks));\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          var rowSpanCells = [];\n\n          var _loop = function _loop(_i) {\n            var foundCells = filterCellsInRow(_i, function (cell, tr) {\n              var rowspan = cell.node.attrs.rowspan;\n              var spanRange = _i + rowspan;\n              return rowspan > 1 && spanRange > rowIndex;\n            })(tr);\n            rowSpanCells.push.apply(rowSpanCells, _toConsumableArray(foundCells));\n          };\n\n          for (var _i = rowIndex; _i >= 0; _i--) {\n            _loop(_i);\n          }\n\n          if (rowSpanCells.length) {\n            rowSpanCells.forEach(function (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)(tr);\n      }\n    }\n    return tr;\n  };\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// ```\nvar removeColumnAt = function removeColumnAt(columnIndex) {\n  return function (tr) {\n    var table = findTable(tr.selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      if (columnIndex === 0 && map.width === 1) {\n        return removeTable(tr);\n      } else if (columnIndex >= 0 && columnIndex <= map.width) {\n        prosemirrorTables.removeColumn(tr, {\n          map: map,\n          tableStart: table.start,\n          table: table.node\n        }, columnIndex);\n        return cloneTr(tr);\n      }\n    }\n    return tr;\n  };\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// ```\nvar removeRowAt = function removeRowAt(rowIndex) {\n  return function (tr) {\n    var table = findTable(tr.selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      if (rowIndex === 0 && map.height === 1) {\n        return removeTable(tr);\n      } else if (rowIndex >= 0 && rowIndex <= map.height) {\n        prosemirrorTables.removeRow(tr, {\n          map: map,\n          tableStart: table.start,\n          table: table.node\n        }, rowIndex);\n        return cloneTr(tr);\n      }\n    }\n    return tr;\n  };\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// ```\nvar removeTable = function removeTable(tr) {\n  var $from = tr.selection.$from;\n\n  for (var depth = $from.depth; depth > 0; depth--) {\n    var 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// ```\nvar removeSelectedColumns = function removeSelectedColumns(tr) {\n  var selection = tr.selection;\n\n  if (isTableSelected(selection)) {\n    return removeTable(tr);\n  }\n  if (isCellSelection(selection)) {\n    var table = findTable(selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);\n\n      if (rect.left == 0 && rect.right == map.width) {\n        return false;\n      }\n\n      var pmTableRect = Object.assign({}, rect, {\n        map: map,\n        table: table.node,\n        tableStart: table.start\n      });\n\n      for (var i = pmTableRect.right - 1;; i--) {\n        prosemirrorTables.removeColumn(tr, pmTableRect, i);\n        if (i === pmTableRect.left) {\n          break;\n        }\n        pmTableRect.table = pmTableRect.tableStart ? tr.doc.nodeAt(pmTableRect.tableStart - 1) : tr.doc;\n        pmTableRect.map = prosemirrorTables.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// ```\nvar removeSelectedRows = function removeSelectedRows(tr) {\n  var selection = tr.selection;\n\n  if (isTableSelected(selection)) {\n    return removeTable(tr);\n  }\n  if (isCellSelection(selection)) {\n    var table = findTable(selection);\n    if (table) {\n      var map = prosemirrorTables.TableMap.get(table.node);\n      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);\n\n      if (rect.top == 0 && rect.bottom == map.height) {\n        return false;\n      }\n\n      var pmTableRect = Object.assign({}, rect, {\n        map: map,\n        table: table.node,\n        tableStart: table.start\n      });\n\n      for (var i = pmTableRect.bottom - 1;; i--) {\n        prosemirrorTables.removeRow(tr, pmTableRect, i);\n        if (i === pmTableRect.top) {\n          break;\n        }\n        pmTableRect.table = pmTableRect.tableStart ? tr.doc.nodeAt(pmTableRect.tableStart - 1) : tr.doc;\n        pmTableRect.map = prosemirrorTables.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// ```\nvar removeColumnClosestToPos = function removeColumnClosestToPos($pos) {\n  return function (tr) {\n    var rect = findCellRectClosestToPos($pos);\n    if (rect) {\n      return removeColumnAt(rect.left)(setTextSelection($pos.pos)(tr));\n    }\n    return tr;\n  };\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// ```\nvar removeRowClosestToPos = function removeRowClosestToPos($pos) {\n  return function (tr) {\n    var rect = findCellRectClosestToPos($pos);\n    if (rect) {\n      return removeRowAt(rect.top)(setTextSelection($pos.pos)(tr));\n    }\n    return tr;\n  };\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// ```\nvar forEachCellInColumn = function forEachCellInColumn(columnIndex, cellTransform, setCursorToLastCell) {\n  return function (tr) {\n    var cells = getCellsInColumn(columnIndex)(tr.selection);\n    if (cells) {\n      for (var i = cells.length - 1; i >= 0; i--) {\n        tr = cellTransform(cells[i], tr);\n      }\n      if (setCursorToLastCell) {\n        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));\n        tr.setSelection(prosemirrorState.Selection.near($pos));\n      }\n      return cloneTr(tr);\n    }\n    return tr;\n  };\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// ```\nvar forEachCellInRow = function forEachCellInRow(rowIndex, cellTransform, setCursorToLastCell) {\n  return function (tr) {\n    var cells = getCellsInRow(rowIndex)(tr.selection);\n    if (cells) {\n      for (var i = cells.length - 1; i >= 0; i--) {\n        tr = cellTransform(cells[i], tr);\n      }\n      if (setCursorToLastCell) {\n        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));\n        tr.setSelection(prosemirrorState.Selection.near($pos));\n      }\n    }\n    return tr;\n  };\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// ```\nvar setCellAttrs = function setCellAttrs(cell, attrs) {\n  return function (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\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// ```\nvar createTable = function createTable(schema) {\n  var rowsCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 3;\n  var colsCount = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 3;\n  var withHeaderRow = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n  var cellContent = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : null;\n\n  var _tableNodeTypes = tableNodeTypes(schema),\n      tableCell = _tableNodeTypes.cell,\n      tableHeader = _tableNodeTypes.header_cell,\n      tableRow = _tableNodeTypes.row,\n      table = _tableNodeTypes.table;\n\n  var cells = [];\n  var headerCells = [];\n  for (var 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  var rows = [];\n  for (var _i2 = 0; _i2 < rowsCount; _i2++) {\n    rows.push(tableRow.createChecked(null, withHeaderRow && _i2 === 0 ? headerCells : cells));\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// ```\nvar findCellClosestToPos = function findCellClosestToPos($pos) {\n  var predicate = function predicate(node) {\n    return node.type.spec.tableRole && /cell/i.test(node.type.spec.tableRole);\n  };\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// ```\nvar findCellRectClosestToPos = function findCellRectClosestToPos($pos) {\n  var cell = findCellClosestToPos($pos);\n  if (cell) {\n    var table = findTableClosestToPos($pos);\n    var map = prosemirrorTables.TableMap.get(table.node);\n    var cellPos = cell.pos - table.start;\n    return map.rectBetween(cellPos, cellPos);\n  }\n};\n\nvar filterCellsInRow = function filterCellsInRow(rowIndex, predicate) {\n  return function (tr) {\n    var foundCells = [];\n    var cells = getCellsInRow(rowIndex)(tr.selection);\n    if (cells) {\n      for (var 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\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// ```\nvar getSelectionRangeInColumn = function getSelectionRangeInColumn(columnIndex) {\n  return function (tr) {\n    var startIndex = columnIndex;\n    var endIndex = columnIndex;\n\n    // looking for selection start column (startIndex)\n\n    var _loop2 = function _loop2(i) {\n      var cells = getCellsInColumn(i)(tr.selection);\n      if (cells) {\n        cells.forEach(function (cell) {\n          var 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\n    for (var i = columnIndex; i >= 0; i--) {\n      _loop2(i);\n    }\n    // looking for selection end column (endIndex)\n\n    var _loop3 = function _loop3(i) {\n      var cells = getCellsInColumn(i)(tr.selection);\n      if (cells) {\n        cells.forEach(function (cell) {\n          var 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    for (var i = columnIndex; i <= endIndex; i++) {\n      _loop3(i);\n    }\n\n    // filter out columns without cells (where all rows have colspan > 1 in the same column)\n    var indexes = [];\n    for (var i = startIndex; i <= endIndex; i++) {\n      var 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    var firstSelectedColumnCells = getCellsInColumn(startIndex)(tr.selection);\n    var firstRowCells = getCellsInRow(0)(tr.selection);\n    var $anchor = tr.doc.resolve(firstSelectedColumnCells[firstSelectedColumnCells.length - 1].pos);\n\n    var headCell = void 0;\n    for (var _i3 = endIndex; _i3 >= startIndex; _i3--) {\n      var columnCells = getCellsInColumn(_i3)(tr.selection);\n      if (columnCells && columnCells.length) {\n        for (var 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    var $head = tr.doc.resolve(headCell.pos);\n    return { $anchor: $anchor, $head: $head, indexes: indexes };\n  };\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// ```\nvar getSelectionRangeInRow = function getSelectionRangeInRow(rowIndex) {\n  return function (tr) {\n    var startIndex = rowIndex;\n    var endIndex = rowIndex;\n    // looking for selection start row (startIndex)\n\n    var _loop4 = function _loop4(i) {\n      var cells = getCellsInRow(i)(tr.selection);\n      cells.forEach(function (cell) {\n        var 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\n    for (var i = rowIndex; i >= 0; i--) {\n      _loop4(i);\n    }\n    // looking for selection end row (endIndex)\n\n    var _loop5 = function _loop5(i) {\n      var cells = getCellsInRow(i)(tr.selection);\n      cells.forEach(function (cell) {\n        var maybeEndIndex = cell.node.attrs.rowspan + i - 1;\n        if (cell.node.attrs.rowspan > 1 && maybeEndIndex > endIndex) {\n          endIndex = maybeEndIndex;\n        }\n      });\n    };\n\n    for (var i = rowIndex; i <= endIndex; i++) {\n      _loop5(i);\n    }\n\n    // filter out rows without cells (where all columns have rowspan > 1 in the same row)\n    var indexes = [];\n    for (var i = startIndex; i <= endIndex; i++) {\n      var 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    var firstSelectedRowCells = getCellsInRow(startIndex)(tr.selection);\n    var firstColumnCells = getCellsInColumn(0)(tr.selection);\n    var $anchor = tr.doc.resolve(firstSelectedRowCells[firstSelectedRowCells.length - 1].pos);\n\n    var headCell = void 0;\n    for (var _i4 = endIndex; _i4 >= startIndex; _i4--) {\n      var rowCells = getCellsInRow(_i4)(tr.selection);\n      if (rowCells && rowCells.length) {\n        for (var 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    var $head = tr.doc.resolve(headCell.pos);\n    return { $anchor: $anchor, $head: $head, indexes: indexes };\n  };\n};\n\nexports.isNodeSelection = isNodeSelection;\nexports.canInsert = canInsert;\nexports.convertTableNodeToArrayOfRows = convertTableNodeToArrayOfRows;\nexports.convertArrayOfRowsToTableNode = convertArrayOfRowsToTableNode;\nexports.findParentNode = findParentNode;\nexports.findParentNodeClosestToPos = findParentNodeClosestToPos;\nexports.findParentDomRef = findParentDomRef;\nexports.hasParentNode = hasParentNode;\nexports.findParentNodeOfType = findParentNodeOfType;\nexports.findParentNodeOfTypeClosestToPos = findParentNodeOfTypeClosestToPos;\nexports.hasParentNodeOfType = hasParentNodeOfType;\nexports.findParentDomRefOfType = findParentDomRefOfType;\nexports.findSelectedNodeOfType = findSelectedNodeOfType;\nexports.findPositionOfNodeBefore = findPositionOfNodeBefore;\nexports.findDomRefAtPos = findDomRefAtPos;\nexports.flatten = flatten;\nexports.findChildren = findChildren;\nexports.findTextNodes = findTextNodes;\nexports.findInlineNodes = findInlineNodes;\nexports.findBlockNodes = findBlockNodes;\nexports.findChildrenByAttr = findChildrenByAttr;\nexports.findChildrenByType = findChildrenByType;\nexports.findChildrenByMark = findChildrenByMark;\nexports.contains = contains;\nexports.findTable = findTable;\nexports.isCellSelection = isCellSelection;\nexports.getSelectionRect = getSelectionRect;\nexports.isColumnSelected = isColumnSelected;\nexports.isRowSelected = isRowSelected;\nexports.isTableSelected = isTableSelected;\nexports.getCellsInColumn = getCellsInColumn;\nexports.getCellsInRow = getCellsInRow;\nexports.getCellsInTable = getCellsInTable;\nexports.selectColumn = selectColumn;\nexports.selectRow = selectRow;\nexports.selectTable = selectTable;\nexports.emptyCell = emptyCell;\nexports.addColumnAt = addColumnAt;\nexports.moveRow = moveRow;\nexports.moveColumn = moveColumn;\nexports.addRowAt = addRowAt;\nexports.cloneRowAt = cloneRowAt;\nexports.removeColumnAt = removeColumnAt;\nexports.removeRowAt = removeRowAt;\nexports.removeTable = removeTable;\nexports.removeSelectedColumns = removeSelectedColumns;\nexports.removeSelectedRows = removeSelectedRows;\nexports.removeColumnClosestToPos = removeColumnClosestToPos;\nexports.removeRowClosestToPos = removeRowClosestToPos;\nexports.forEachCellInColumn = forEachCellInColumn;\nexports.forEachCellInRow = forEachCellInRow;\nexports.setCellAttrs = setCellAttrs;\nexports.createTable = createTable;\nexports.findCellClosestToPos = findCellClosestToPos;\nexports.findCellRectClosestToPos = findCellRectClosestToPos;\nexports.getSelectionRangeInColumn = getSelectionRangeInColumn;\nexports.getSelectionRangeInRow = getSelectionRangeInRow;\nexports.removeParentNodeOfType = removeParentNodeOfType;\nexports.replaceParentNodeOfType = replaceParentNodeOfType;\nexports.removeSelectedNode = removeSelectedNode;\nexports.replaceSelectedNode = replaceSelectedNode;\nexports.setTextSelection = setTextSelection;\nexports.safeInsert = safeInsert;\nexports.setParentNodeMarkup = setParentNodeMarkup;\nexports.selectParentNodeOfType = selectParentNodeOfType;\nexports.removeNodeBefore = removeNodeBefore;\n//# sourceMappingURL=index.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorModel = require('prosemirror-model');\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\nvar lower16 = 0xffff;\nvar 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.\nvar MapResult = function MapResult(pos, deleted, recover) {\n  if ( deleted === void 0 ) deleted = false;\n  if ( recover === void 0 ) recover = null;\n\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// :: 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.\nvar StepMap = function StepMap(ranges, inverted) {\n  if ( inverted === void 0 ) inverted = false;\n\n  this.ranges = ranges;\n  this.inverted = inverted;\n};\n\nStepMap.prototype.recover = function recover (value) {\n    var this$1 = this;\n\n  var diff = 0, index = recoverIndex(value);\n  if (!this.inverted) { for (var i = 0; i < index; i++)\n    { diff += this$1.ranges[i * 3 + 2] - this$1.ranges[i * 3 + 1]; } }\n  return this.ranges[index * 3] + diff + recoverOffset(value)\n};\n\n// : (number, ?number) → MapResult\nStepMap.prototype.mapResult = function mapResult (pos, assoc) {\n  if ( assoc === void 0 ) assoc = 1;\n return this._map(pos, assoc, false) };\n\n// : (number, ?number) → number\nStepMap.prototype.map = function map (pos, assoc) {\n  if ( assoc === void 0 ) assoc = 1;\n return this._map(pos, assoc, true) };\n\nStepMap.prototype._map = function _map (pos, assoc, simple) {\n    var this$1 = this;\n\n  var diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n  for (var i = 0; i < this.ranges.length; i += 3) {\n    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);\n    if (start > pos) { break }\n    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex], end = start + oldSize;\n    if (pos <= end) {\n      var side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;\n      var result = start + diff + (side < 0 ? 0 : newSize);\n      if (simple) { return result }\n      var recover = 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\nStepMap.prototype.touches = function touches (pos, recover) {\n    var this$1 = this;\n\n  var diff = 0, index = recoverIndex(recover);\n  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n  for (var i = 0; i < this.ranges.length; i += 3) {\n    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);\n    if (start > pos) { break }\n    var oldSize = this$1.ranges[i + oldIndex], end = start + oldSize;\n    if (pos <= end && i == index * 3) { return true }\n    diff += this$1.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.\nStepMap.prototype.forEach = function forEach (f) {\n    var this$1 = this;\n\n  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n  for (var i = 0, diff = 0; i < this.ranges.length; i += 3) {\n    var start = this$1.ranges[i], oldStart = start - (this$1.inverted ? diff : 0), newStart = start + (this$1.inverted ? 0 : diff);\n    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.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.\nStepMap.prototype.invert = function invert () {\n  return new StepMap(this.ranges, !this.inverted)\n};\n\nStepMap.prototype.toString = function 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.\nStepMap.offset = function offset (n) {\n  return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, 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.)\nvar Mapping = function Mapping(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.\nMapping.prototype.slice = function slice (from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.maps.length;\n\n  return new Mapping(this.maps, this.mirror, from, to)\n};\n\nMapping.prototype.copy = function 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.\nMapping.prototype.appendMap = function 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).\nMapping.prototype.appendMapping = function appendMapping (mapping) {\n    var this$1 = this;\n\n  for (var i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n    var mirr = mapping.getMirror(i);\n    this$1.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`).\nMapping.prototype.getMirror = function getMirror (n) {\n    var this$1 = this;\n\n  if (this.mirror) { for (var i = 0; i < this.mirror.length; i++)\n    { if (this$1.mirror[i] == n) { return this$1.mirror[i + (i % 2 ? -1 : 1)] } } }\n};\n\nMapping.prototype.setMirror = function 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.\nMapping.prototype.appendMappingInverted = function appendMappingInverted (mapping) {\n    var this$1 = this;\n\n  for (var i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n    var mirr = mapping.getMirror(i);\n    this$1.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.\nMapping.prototype.invert = function invert () {\n  var inverse = new Mapping;\n  inverse.appendMappingInverted(this);\n  return inverse\n};\n\n// : (number, ?number) → number\n// Map a position through this mapping.\nMapping.prototype.map = function map (pos, assoc) {\n    var this$1 = this;\n    if ( assoc === void 0 ) assoc = 1;\n\n  if (this.mirror) { return this._map(pos, assoc, true) }\n  for (var i = this.from; i < this.to; i++)\n    { pos = this$1.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.\nMapping.prototype.mapResult = function mapResult (pos, assoc) {\n  if ( assoc === void 0 ) assoc = 1;\n return this._map(pos, assoc, false) };\n\nMapping.prototype._map = function _map (pos, assoc, simple) {\n    var this$1 = this;\n\n  var deleted = false, recoverables = null;\n\n  for (var i = this.from; i < this.to; i++) {\n    var map = this$1.maps[i], rec = recoverables && recoverables[i];\n    if (rec != null && map.touches(pos, rec)) {\n      pos = map.recover(rec);\n      continue\n    }\n\n    var result = map.mapResult(pos, assoc);\n    if (result.recover != null) {\n      var corr = this$1.getMirror(i);\n      if (corr != null && corr > i && corr < this$1.to) {\n        if (result.deleted) {\n          i = corr;\n          pos = this$1.maps[corr].recover(result.recover);\n          continue\n        } else {\n          (recoverables || (recoverables = Object.create(null)))[corr] = result.recover;\n        }\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\nfunction TransformError(message) {\n  var 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.\nvar Transform = function Transform(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\nvar prototypeAccessors = { before: {},docChanged: {} };\n\n// :: Node The starting document.\nprototypeAccessors.before.get = function () { 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.\nTransform.prototype.step = function step (object) {\n  var 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.\nTransform.prototype.maybeStep = function maybeStep (step) {\n  var 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).\nprototypeAccessors.docChanged.get = function () {\n  return this.steps.length > 0\n};\n\nTransform.prototype.addStep = function 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\nObject.defineProperties( Transform.prototype, prototypeAccessors );\n\nfunction mustOverride() { throw new Error(\"Override me\") }\n\nvar 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).\nvar Step = function Step () {};\n\nStep.prototype.apply = function 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.\nStep.prototype.getMap = function 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.\nStep.prototype.invert = function 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.\nStep.prototype.map = function 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.\nStep.prototype.merge = function 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.\nStep.prototype.toJSON = function 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.\nStep.fromJSON = function fromJSON (schema, json) {\n  if (!json || !json.stepType) { throw new RangeError(\"Invalid input for Step.fromJSON\") }\n  var 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.\nStep.jsonID = function 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// ::- The result of [applying](#transform.Step.apply) a step. Contains either a\n// new document or a failure value.\nvar StepResult = function StepResult(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.\nStepResult.ok = function ok (doc) { return new StepResult(doc, null) };\n\n// :: (string) → StepResult\n// Create a failed step result.\nStepResult.fail = function 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`.\nStepResult.fromReplace = function fromReplace (doc, from, to, slice) {\n  try {\n    return StepResult.ok(doc.replace(from, to, slice))\n  } catch (e) {\n    if (e instanceof prosemirrorModel.ReplaceError) { return StepResult.fail(e.message) }\n    throw e\n  }\n};\n\n// ::- Replace a part of the document with a slice of new content.\nvar ReplaceStep = (function (Step$$1) {\n  function ReplaceStep(from, to, slice, structure) {\n    Step$$1.call(this);\n    this.from = from;\n    this.to = to;\n    this.slice = slice;\n    this.structure = !!structure;\n  }\n\n  if ( Step$$1 ) ReplaceStep.__proto__ = Step$$1;\n  ReplaceStep.prototype = Object.create( Step$$1 && Step$$1.prototype );\n  ReplaceStep.prototype.constructor = ReplaceStep;\n\n  ReplaceStep.prototype.apply = function 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  ReplaceStep.prototype.getMap = function getMap () {\n    return new StepMap([this.from, this.to - this.from, this.slice.size])\n  };\n\n  ReplaceStep.prototype.invert = function invert (doc) {\n    return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))\n  };\n\n  ReplaceStep.prototype.map = function map (mapping) {\n    var 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  ReplaceStep.prototype.merge = function 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      var slice = this.slice.size + other.slice.size == 0 ? prosemirrorModel.Slice.empty\n          : new prosemirrorModel.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      var slice$1 = this.slice.size + other.slice.size == 0 ? prosemirrorModel.Slice.empty\n          : new prosemirrorModel.Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);\n      return new ReplaceStep(other.from, this.to, slice$1, this.structure)\n    } else {\n      return null\n    }\n  };\n\n  ReplaceStep.prototype.toJSON = function toJSON () {\n    var 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  ReplaceStep.fromJSON = function 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, prosemirrorModel.Slice.fromJSON(schema, json.slice), !!json.structure)\n  };\n\n  return ReplaceStep;\n}(Step));\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.\nvar ReplaceAroundStep = (function (Step$$1) {\n  function ReplaceAroundStep(from, to, gapFrom, gapTo, slice, insert, structure) {\n    Step$$1.call(this);\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  if ( Step$$1 ) ReplaceAroundStep.__proto__ = Step$$1;\n  ReplaceAroundStep.prototype = Object.create( Step$$1 && Step$$1.prototype );\n  ReplaceAroundStep.prototype.constructor = ReplaceAroundStep;\n\n  ReplaceAroundStep.prototype.apply = function 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    var gap = doc.slice(this.gapFrom, this.gapTo);\n    if (gap.openStart || gap.openEnd)\n      { return StepResult.fail(\"Gap is not a flat range\") }\n    var 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  ReplaceAroundStep.prototype.getMap = function 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  ReplaceAroundStep.prototype.invert = function invert (doc) {\n    var 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  ReplaceAroundStep.prototype.map = function map (mapping) {\n    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n    var 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  ReplaceAroundStep.prototype.toJSON = function toJSON () {\n    var 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  ReplaceAroundStep.fromJSON = function 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                                 prosemirrorModel.Slice.fromJSON(schema, json.slice), json.insert, !!json.structure)\n  };\n\n  return ReplaceAroundStep;\n}(Step));\n\nStep.jsonID(\"replaceAround\", ReplaceAroundStep);\n\nfunction contentBetween(doc, from, to) {\n  var $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    var 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\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.\nfunction liftTarget(range) {\n  var parent = range.parent;\n  var content = parent.content.cutByIndex(range.startIndex, range.endIndex);\n  for (var depth = range.depth;; --depth) {\n    var node = range.$from.node(depth);\n    var 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  var $from = range.$from;\n  var $to = range.$to;\n  var depth = range.depth;\n\n  var gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);\n  var start = gapStart, end = gapEnd;\n\n  var before = prosemirrorModel.Fragment.empty, openStart = 0;\n  for (var d = depth, splitting = false; d > target; d--)\n    { if (splitting || $from.index(d) > 0) {\n      splitting = true;\n      before = prosemirrorModel.Fragment.from($from.node(d).copy(before));\n      openStart++;\n    } else {\n      start--;\n    } }\n  var after = prosemirrorModel.Fragment.empty, openEnd = 0;\n  for (var d$1 = depth, splitting$1 = false; d$1 > target; d$1--)\n    { if (splitting$1 || $to.after(d$1 + 1) < $to.end(d$1)) {\n      splitting$1 = true;\n      after = prosemirrorModel.Fragment.from($to.node(d$1).copy(after));\n      openEnd++;\n    } else {\n      end++;\n    } }\n\n  return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,\n                                         new prosemirrorModel.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`.\nfunction findWrapping(range, nodeType, attrs, innerRange) {\n  if ( innerRange === void 0 ) innerRange = range;\n\n  var around = findWrappingOutside(range, nodeType);\n  var inner = around && findWrappingInside(innerRange, nodeType);\n  if (!inner) { return null }\n  return around.map(withAttrs).concat({type: nodeType, attrs: attrs}).concat(inner.map(withAttrs))\n}\n\nfunction withAttrs(type) { return {type: type, attrs: null} }\n\nfunction findWrappingOutside(range, type) {\n  var parent = range.parent;\n  var startIndex = range.startIndex;\n  var endIndex = range.endIndex;\n  var around = parent.contentMatchAt(startIndex).findWrapping(type);\n  if (!around) { return null }\n  var outer = around.length ? around[0] : type;\n  return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null\n}\n\nfunction findWrappingInside(range, type) {\n  var parent = range.parent;\n  var startIndex = range.startIndex;\n  var endIndex = range.endIndex;\n  var inner = parent.child(startIndex);\n  var inside = type.contentMatch.findWrapping(inner.type);\n  if (!inside) { return null }\n  var lastType = inside.length ? inside[inside.length - 1] : type;\n  var innerMatch = lastType.contentMatch;\n  for (var 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  var content = prosemirrorModel.Fragment.empty;\n  for (var i = wrappers.length - 1; i >= 0; i--)\n    { content = prosemirrorModel.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }\n\n  var start = range.start, end = range.end;\n  return this.step(new ReplaceAroundStep(start, end, start, end, new prosemirrorModel.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, type, attrs) {\n  var this$1 = this;\n  if ( to === void 0 ) to = from;\n\n  if (!type.isTextblock) { throw new RangeError(\"Type given to setBlockType should be a textblock\") }\n  var mapFrom = this.steps.length;\n  this.doc.nodesBetween(from, to, function (node, pos) {\n    if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this$1.doc, this$1.mapping.slice(mapFrom).map(pos), type)) {\n      // Ensure all markup that isn't allowed in the new node type is cleared\n      this$1.clearIncompatible(this$1.mapping.slice(mapFrom).map(pos, 1), type);\n      var mapping = this$1.mapping.slice(mapFrom);\n      var startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);\n      this$1.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,\n                                      new prosemirrorModel.Slice(prosemirrorModel.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  var $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  var node = this.doc.nodeAt(pos);\n  if (!node) { throw new RangeError(\"No node at given position\") }\n  if (!type) { type = node.type; }\n  var 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 prosemirrorModel.Slice(prosemirrorModel.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.\nfunction canSplit(doc, pos, depth, typesAfter) {\n  if ( depth === void 0 ) depth = 1;\n\n  var $pos = doc.resolve(pos), base = $pos.depth - depth;\n  var 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 (var d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n    var node = $pos.node(d), index$1 = $pos.index(d);\n    if (node.type.spec.isolating) { return false }\n    var rest = node.content.cutByIndex(index$1, node.childCount);\n    var after = (typesAfter && typesAfter[i]) || node;\n    if (after != node) { rest = rest.replaceChild(0, after.type.create(after.attrs)); }\n    if (!node.canReplace(index$1 + 1, node.childCount) || !after.type.validContent(rest))\n      { return false }\n  }\n  var index = $pos.indexAfter(base);\n  var 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, typesAfter) {\n  if ( depth === void 0 ) depth = 1;\n\n  var $pos = this.doc.resolve(pos), before = prosemirrorModel.Fragment.empty, after = prosemirrorModel.Fragment.empty;\n  for (var d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n    before = prosemirrorModel.Fragment.from($pos.node(d).copy(before));\n    var typeAfter = typesAfter && typesAfter[i];\n    after = prosemirrorModel.Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));\n  }\n  return this.step(new ReplaceStep(pos, pos, new prosemirrorModel.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.\nfunction canJoin(doc, pos) {\n  var $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.\nfunction joinPoint(doc, pos, dir) {\n  if ( dir === void 0 ) dir = -1;\n\n  var $pos = doc.resolve(pos);\n  for (var d = $pos.depth;; d--) {\n    var before = (void 0), after = (void 0);\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      after = $pos.node(d).maybeChild($pos.index(d) + 1);\n    } else {\n      before = $pos.node(d).maybeChild($pos.index(d) - 1);\n      after = $pos.node(d + 1);\n    }\n    if (before && !before.isTextblock && joinable(before, after)) { 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) {\n  if ( depth === void 0 ) depth = 1;\n\n  var step = new ReplaceStep(pos - depth, pos + depth, prosemirrorModel.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.\nfunction insertPoint(doc, pos, nodeType) {\n  var $pos = doc.resolve(pos);\n  if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) { return pos }\n\n  if ($pos.parentOffset == 0)\n    { for (var d = $pos.depth - 1; d >= 0; d--) {\n      var 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 (var d$1 = $pos.depth - 1; d$1 >= 0; d$1--) {\n      var index$1 = $pos.indexAfter(d$1);\n      if ($pos.node(d$1).canReplaceWith(index$1, index$1, nodeType)) { return $pos.after(d$1 + 1) }\n      if (index$1 < $pos.node(d$1).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.\nfunction dropPoint(doc, pos, slice) {\n  var $pos = doc.resolve(pos);\n  if (!slice.content.size) { return pos }\n  var content = slice.content;\n  for (var i = 0; i < slice.openStart; i++) { content = content.firstChild.content; }\n  for (var pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n    for (var d = $pos.depth; d >= 0; d--) {\n      var bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;\n      var 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\nfunction mapFragment(fragment, f, parent) {\n  var mapped = [];\n  for (var i = 0; i < fragment.childCount; i++) {\n    var 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 prosemirrorModel.Fragment.fromArray(mapped)\n}\n\n// ::- Add a mark to all inline content between two positions.\nvar AddMarkStep = (function (Step$$1) {\n  function AddMarkStep(from, to, mark) {\n    Step$$1.call(this);\n    this.from = from;\n    this.to = to;\n    this.mark = mark;\n  }\n\n  if ( Step$$1 ) AddMarkStep.__proto__ = Step$$1;\n  AddMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );\n  AddMarkStep.prototype.constructor = AddMarkStep;\n\n  AddMarkStep.prototype.apply = function apply (doc) {\n    var this$1 = this;\n\n    var oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);\n    var parent = $from.node($from.sharedDepth(this.to));\n    var slice = new prosemirrorModel.Slice(mapFragment(oldSlice.content, function (node, parent) {\n      if (!parent.type.allowsMarkType(this$1.mark.type)) { return node }\n      return node.mark(this$1.mark.addToSet(node.marks))\n    }, parent), oldSlice.openStart, oldSlice.openEnd);\n    return StepResult.fromReplace(doc, this.from, this.to, slice)\n  };\n\n  AddMarkStep.prototype.invert = function invert () {\n    return new RemoveMarkStep(this.from, this.to, this.mark)\n  };\n\n  AddMarkStep.prototype.map = function map (mapping) {\n    var 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  AddMarkStep.prototype.merge = function 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  AddMarkStep.prototype.toJSON = function toJSON () {\n    return {stepType: \"addMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to}\n  };\n\n  AddMarkStep.fromJSON = function 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  return AddMarkStep;\n}(Step));\n\nStep.jsonID(\"addMark\", AddMarkStep);\n\n// ::- Remove a mark from all inline content between two positions.\nvar RemoveMarkStep = (function (Step$$1) {\n  function RemoveMarkStep(from, to, mark) {\n    Step$$1.call(this);\n    this.from = from;\n    this.to = to;\n    this.mark = mark;\n  }\n\n  if ( Step$$1 ) RemoveMarkStep.__proto__ = Step$$1;\n  RemoveMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );\n  RemoveMarkStep.prototype.constructor = RemoveMarkStep;\n\n  RemoveMarkStep.prototype.apply = function apply (doc) {\n    var this$1 = this;\n\n    var oldSlice = doc.slice(this.from, this.to);\n    var slice = new prosemirrorModel.Slice(mapFragment(oldSlice.content, function (node) {\n      return node.mark(this$1.mark.removeFromSet(node.marks))\n    }), oldSlice.openStart, oldSlice.openEnd);\n    return StepResult.fromReplace(doc, this.from, this.to, slice)\n  };\n\n  RemoveMarkStep.prototype.invert = function invert () {\n    return new AddMarkStep(this.from, this.to, this.mark)\n  };\n\n  RemoveMarkStep.prototype.map = function map (mapping) {\n    var 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  RemoveMarkStep.prototype.merge = function 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  RemoveMarkStep.prototype.toJSON = function toJSON () {\n    return {stepType: \"removeMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to}\n  };\n\n  RemoveMarkStep.fromJSON = function 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  return RemoveMarkStep;\n}(Step));\n\nStep.jsonID(\"removeMark\", RemoveMarkStep);\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  var this$1 = this;\n\n  var removed = [], added = [], removing = null, adding = null;\n  this.doc.nodesBetween(from, to, function (node, pos, parent) {\n    if (!node.isInline) { return }\n    var marks = node.marks;\n    if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n      var start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);\n      var newSet = mark.addToSet(marks);\n\n      for (var 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(function (s) { return this$1.step(s); });\n  added.forEach(function (s) { return this$1.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) {\n  var this$1 = this;\n  if ( mark === void 0 ) mark = null;\n\n  var matched = [], step = 0;\n  this.doc.nodesBetween(from, to, function (node, pos) {\n    if (!node.isInline) { return }\n    step++;\n    var toRemove = null;\n    if (mark instanceof prosemirrorModel.MarkType) {\n      var 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      var end = Math.min(pos + node.nodeSize, to);\n      for (var i = 0; i < toRemove.length; i++) {\n        var style = toRemove[i], found$1 = (void 0);\n        for (var j = 0; j < matched.length; j++) {\n          var m = matched[j];\n          if (m.step == step - 1 && style.eq(matched[j].style)) { found$1 = m; }\n        }\n        if (found$1) {\n          found$1.to = end;\n          found$1.step = step;\n        } else {\n          matched.push({style: style, from: Math.max(pos, from), to: end, step: step});\n        }\n      }\n    }\n  });\n  matched.forEach(function (m) { return this$1.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) {\n  var this$1 = this;\n  if ( match === void 0 ) match = parentType.contentMatch;\n\n  var node = this.doc.nodeAt(pos);\n  var delSteps = [], cur = pos + 1;\n  for (var i = 0; i < node.childCount; i++) {\n    var child = node.child(i), end = cur + child.nodeSize;\n    var allowed = match.matchType(child.type, child.attrs);\n    if (!allowed) {\n      delSteps.push(new ReplaceStep(cur, end, prosemirrorModel.Slice.empty));\n    } else {\n      match = allowed;\n      for (var j = 0; j < child.marks.length; j++) { if (!parentType.allowsMarkType(child.marks[j].type))\n        { this$1.step(new RemoveMarkStep(cur, end, child.marks[j])); } }\n    }\n    cur = end;\n  }\n  if (!match.validEnd) {\n    var fill = match.fillBefore(prosemirrorModel.Fragment.empty, true);\n    this.replace(cur, cur, new prosemirrorModel.Slice(fill, 0, 0));\n  }\n  for (var i$1 = delSteps.length - 1; i$1 >= 0; i$1--) { this$1.step(delSteps[i$1]); }\n  return this\n};\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).\nfunction replaceStep(doc, from, to, slice) {\n  if ( to === void 0 ) to = from;\n  if ( slice === void 0 ) slice = prosemirrorModel.Slice.empty;\n\n  if (from == to && !slice.size) { return null }\n\n  var $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  var placed = placeSlice($from, slice);\n\n  var fittedLeft = fitLeft($from, placed);\n  var fitted = fitRight($from, $to, fittedLeft);\n  if (!fitted) { return null }\n  if (fittedLeft.size != fitted.size && canMoveText($from, $to, fittedLeft)) {\n    var d = $to.depth, after = $to.after(d);\n    while (d > 1 && after == $to.end(--d)) { ++after; }\n    var fittedAfter = fitRight($from, doc.resolve(after), fittedLeft);\n    if (fittedAfter)\n      { return new ReplaceAroundStep(from, after, to, $to.end(), fittedAfter, fittedLeft.size) }\n  }\n  return fitted.size || from != to ? new ReplaceStep(from, to, fitted) : null\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, slice) {\n  if ( to === void 0 ) to = from;\n  if ( slice === void 0 ) slice = prosemirrorModel.Slice.empty;\n\n  var 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 prosemirrorModel.Slice(prosemirrorModel.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, prosemirrorModel.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\n\n\nfunction fitLeftInner($from, depth, placed, placedBelow) {\n  var content = prosemirrorModel.Fragment.empty, openEnd = 0, placedHere = placed[depth];\n  if ($from.depth > depth) {\n    var inner = fitLeftInner($from, depth + 1, placed, placedBelow || placedHere);\n    openEnd = inner.openEnd + 1;\n    content = prosemirrorModel.Fragment.from($from.node(depth + 1).copy(inner.content));\n  }\n\n  if (placedHere) {\n    content = content.append(placedHere.content);\n    openEnd = placedHere.openEnd;\n  }\n  if (placedBelow) {\n    content = content.append($from.node(depth).contentMatchAt($from.indexAfter(depth)).fillBefore(prosemirrorModel.Fragment.empty, true));\n    openEnd = 0;\n  }\n\n  return {content: content, openEnd: openEnd}\n}\n\nfunction fitLeft($from, placed) {\n  var ref = fitLeftInner($from, 0, placed, false);\n  var content = ref.content;\n  var openEnd = ref.openEnd;\n  return new prosemirrorModel.Slice(content, $from.depth, openEnd || 0)\n}\n\nfunction fitRightJoin(content, parent, $from, $to, depth, openStart, openEnd) {\n  var match, count = content.childCount, matchCount = count - (openEnd > 0 ? 1 : 0);\n  var parentNode = openStart < 0 ? parent : $from.node(depth);\n  if (openStart < 0)\n    { match = parentNode.contentMatchAt(matchCount); }\n  else if (count == 1 && openEnd > 0)\n    { match = parentNode.contentMatchAt(openStart ? $from.index(depth) : $from.indexAfter(depth)); }\n  else\n    { match = parentNode.contentMatchAt($from.indexAfter(depth))\n      .matchFragment(content, count > 0 && openStart ? 1 : 0, matchCount); }\n\n  var toNode = $to.node(depth);\n  if (openEnd > 0 && depth < $to.depth) {\n    var after = toNode.content.cutByIndex($to.indexAfter(depth)).addToStart(content.lastChild);\n    var joinable$1 = match.fillBefore(after, true);\n    // Can't insert content if there's a single node stretched across this gap\n    if (joinable$1 && joinable$1.size && openStart > 0 && count == 1) { joinable$1 = null; }\n\n    if (joinable$1) {\n      var inner = fitRightJoin(content.lastChild.content, content.lastChild, $from, $to,\n                               depth + 1, count == 1 ? openStart - 1 : -1, openEnd - 1);\n      if (inner) {\n        var last = content.lastChild.copy(inner);\n        if (joinable$1.size)\n          { return content.cutByIndex(0, count - 1).append(joinable$1).addToEnd(last) }\n        else\n          { return content.replaceChild(count - 1, last) }\n      }\n    }\n  }\n  if (openEnd > 0)\n    { match = match.matchType((count == 1 && openStart > 0 ? $from.node(depth + 1) : content.lastChild).type); }\n\n  // If we're here, the next level can't be joined, so we see what\n  // happens if we leave it open.\n  var toIndex = $to.index(depth);\n  if (toIndex == toNode.childCount && !toNode.type.compatibleContent(parent.type)) { return null }\n  var joinable = match.fillBefore(toNode.content, true, toIndex);\n  for (var i = toIndex; joinable && i < toNode.content.childCount; i++)\n    { if (!parentNode.type.allowsMarks(toNode.content.child(i).marks)) { joinable = null; } }\n  if (!joinable) { return null }\n\n  if (openEnd > 0) {\n    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,\n                                count == 1 ? openStart - 1 : -1);\n    content = content.replaceChild(count - 1, closed);\n  }\n  content = content.append(joinable);\n  if ($to.depth > depth)\n    { content = content.addToEnd(fitRightSeparate($to, depth + 1)); }\n  return content\n}\n\nfunction fitRightClosed(node, openEnd, $from, depth, openStart) {\n  var match, content = node.content, count = content.childCount;\n  if (openStart >= 0)\n    { match = $from.node(depth).contentMatchAt($from.indexAfter(depth))\n      .matchFragment(content, openStart > 0 ? 1 : 0, count); }\n  else\n    { match = node.contentMatchAt(count); }\n\n  if (openEnd > 0) {\n    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,\n                                count == 1 ? openStart - 1 : -1);\n    content = content.replaceChild(count - 1, closed);\n  }\n\n  return node.copy(content.append(match.fillBefore(prosemirrorModel.Fragment.empty, true)))\n}\n\nfunction fitRightSeparate($to, depth) {\n  var node = $to.node(depth);\n  var fill = node.contentMatchAt(0).fillBefore(node.content, true, $to.index(depth));\n  if ($to.depth > depth) { fill = fill.addToEnd(fitRightSeparate($to, depth + 1)); }\n  return node.copy(fill)\n}\n\nfunction normalizeSlice(content, openStart, openEnd) {\n  while (openStart > 0 && openEnd > 0 && content.childCount == 1) {\n    content = content.firstChild.content;\n    openStart--;\n    openEnd--;\n  }\n  return new prosemirrorModel.Slice(content, openStart, openEnd)\n}\n\n// : (ResolvedPos, ResolvedPos, number, Slice) → Slice\nfunction fitRight($from, $to, slice) {\n  var fitted = fitRightJoin(slice.content, $from.node(0), $from, $to, 0, slice.openStart, slice.openEnd);\n  if (!fitted) { return null }\n  return normalizeSlice(fitted, slice.openStart, $to.depth)\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\nfunction canMoveText($from, $to, slice) {\n  if (!$to.parent.isTextblock) { return false }\n\n  var parent = slice.openEnd ? nodeRight(slice.content, slice.openEnd)\n      : $from.node($from.depth - (slice.openStart - slice.openEnd));\n  if (!parent.isTextblock) { return false }\n  for (var i = $to.index(); i < $to.parent.childCount; i++)\n    { if (!parent.type.allowsMarks($to.parent.child(i).marks)) { return false } }\n  var match;\n  if (slice.openEnd) {\n    match = parent.contentMatchAt(parent.childCount);\n  } else {\n    match = parent.contentMatchAt(parent.childCount);\n    if (slice.size) { match = match.matchFragment(slice.content, slice.openStart ? 1 : 0); }\n  }\n  match = match.matchFragment($to.parent.content, $to.index());\n  return match && match.validEnd\n}\n\nfunction nodeRight(content, depth) {\n  for (var i = 1; i < depth; i++) { content = content.lastChild.content; }\n  return content.lastChild\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// So placeSlice splits up a slice into a number of sub-slices,\n// along with information on where they can be placed on the given\n// left-side edge. It works by walking the open side of the slice,\n// from the inside out, and trying to find a landing spot for each\n// element, by simultaneously scanning over the gap side. When no\n// place is found for an open node's content, it is left in that node.\n\n// : (ResolvedPos, Slice) → [{content: Fragment, openEnd: number, depth: number}]\nfunction placeSlice($from, slice) {\n  var frontier = new Frontier($from);\n  for (var pass = 1; slice.size && pass <= 3; pass++) {\n    var value = frontier.placeSlice(slice.content, slice.openStart, slice.openEnd, pass);\n    if (pass == 3 && value != slice && value.size) { pass = 0; } // Restart if the 3rd pass made progress but left content\n    slice = value;\n  }\n  while (frontier.open.length) { frontier.closeNode(); }\n  return frontier.placed\n}\n\n// Helper class that models the open side of the insert position,\n// keeping track of the content match and already inserted content\n// at each depth.\nvar Frontier = function Frontier($pos) {\n  var this$1 = this;\n\n  // : [{parent: Node, match: ContentMatch, content: Fragment, wrapper: bool, openEnd: number, depth: number}]\n  this.open = [];\n  for (var d = 0; d <= $pos.depth; d++) {\n    var parent = $pos.node(d), match = parent.contentMatchAt($pos.indexAfter(d));\n    this$1.open.push({parent: parent, match: match, content: prosemirrorModel.Fragment.empty, wrapper: false, openEnd: 0, depth: d});\n  }\n  this.placed = [];\n};\n\n// : (Fragment, number, number, number, ?Node) → Slice\n// Tries to place the content of the given slice, and returns a\n// slice containing unplaced content.\n//\n// pass 1: try to fit directly\n// pass 2: allow wrapper nodes to be introduced\n// pass 3: allow unwrapping of nodes that aren't open\nFrontier.prototype.placeSlice = function placeSlice (fragment, openStart, openEnd, pass, parent) {\n  if (openStart > 0) {\n    var first = fragment.firstChild;\n    var inner = this.placeSlice(first.content, Math.max(0, openStart - 1),\n                                openEnd && fragment.childCount == 1 ? openEnd - 1 : 0,\n                                pass, first);\n    if (inner.content != first.content) {\n      if (inner.content.size) {\n        fragment = fragment.replaceChild(0, first.copy(inner.content));\n        openStart = inner.openStart + 1;\n      } else {\n        if (fragment.childCount == 1) { openEnd = 0; }\n        fragment = fragment.cutByIndex(1);\n        openStart = 0;\n      }\n    }\n  }\n  var result = this.placeContent(fragment, openStart, openEnd, pass, parent);\n  if (pass > 2 && result.size && openStart == 0) {\n    var child = result.content.firstChild, single = result.content.childCount == 1;\n    this.placeContent(child.content, 0, openEnd && single ? openEnd - 1 : 0, pass, child);\n    result = single ? prosemirrorModel.Fragment.empty : new prosemirrorModel.Slice(result.content.cutByIndex(1), 0, openEnd);\n  }\n  return result\n};\n\nFrontier.prototype.placeContent = function placeContent (fragment, openStart, openEnd, pass, parent) {\n    var this$1 = this;\n\n  var i = 0;\n  // Go over the fragment's children\n  for (; i < fragment.childCount; i++) {\n    var child = fragment.child(i), placed = false, last = i == fragment.childCount - 1;\n    // Try each open node in turn, starting from the innermost\n    for (var d = this.open.length - 1; d >= 0; d--) {\n      var open = this$1.open[d], wrap = (void 0);\n\n      // If pass > 1, it is allowed to wrap the node to help find a\n      // fit, so if findWrapping returns something, we add open\n      // nodes to the frontier for that wrapping.\n      if (pass > 1 && (wrap = open.match.findWrapping(child.type)) &&\n          !(parent && wrap.length && wrap[wrap.length - 1] == parent.type)) {\n        while (this.open.length - 1 > d) { this$1.closeNode(); }\n        for (var w = 0; w < wrap.length; w++) {\n          open.match = open.match.matchType(wrap[w]);\n          d++;\n          open = {parent: wrap[w].create(),\n                  match: wrap[w].contentMatch,\n                  content: prosemirrorModel.Fragment.empty, wrapper: true, openEnd: 0, depth: d + w};\n          this$1.open.push(open);\n        }\n      }\n\n      // See if the child fits here\n      var match = open.match.matchType(child.type);\n      if (!match) {\n        var fill = open.match.fillBefore(prosemirrorModel.Fragment.from(child));\n        if (fill) {\n          for (var j = 0; j < fill.childCount; j++) {\n            var ch = fill.child(j);\n            this$1.addNode(open, ch, 0);\n            match = open.match.matchFragment(ch);\n          }\n        } else if (parent && open.match.matchType(parent.type)) {\n          // Don't continue looking further up if the parent node\n          // would fit here.\n          break\n        } else {\n          continue\n        }\n      }\n\n      // Close open nodes above this one, since we're starting to\n      // add to this.\n      while (this.open.length - 1 > d) { this$1.closeNode(); }\n      // Strip marks from the child or close its start when necessary\n      child = child.mark(open.parent.type.allowedMarks(child.marks));\n      if (openStart) {\n        child = closeNodeStart(child, openStart, last ? openEnd : 0);\n        openStart = 0;\n      }\n      // Add the child to this open node and adjust its metadata\n      this$1.addNode(open, child, last ? openEnd : 0);\n      open.match = match;\n      if (last) { openEnd = 0; }\n      placed = true;\n      break\n    }\n    // As soon as we've failed to place a node we stop looking at\n    // later nodes\n    if (!placed) { break }\n  }\n  // Close the current open node if it's not the the root and we\n  // either placed up to the end of the node or the the current\n  // slice depth's node type matches the open node's type\n  if (this.open.length > 1 &&\n      (i > 0 && i == fragment.childCount ||\n       parent && this.open[this.open.length - 1].parent.type == parent.type))\n    { this.closeNode(); }\n\n  return new prosemirrorModel.Slice(fragment.cutByIndex(i), openStart, openEnd)\n};\n\nFrontier.prototype.addNode = function addNode (open, node, openEnd) {\n  open.content = closeFragmentEnd(open.content, open.openEnd).addToEnd(node);\n  open.openEnd = openEnd;\n};\n\nFrontier.prototype.closeNode = function closeNode () {\n  var open = this.open.pop();\n  if (open.content.size == 0) {\n    // Nothing here\n  } else if (open.wrapper) {\n    this.addNode(this.open[this.open.length - 1], open.parent.copy(open.content), open.openEnd + 1);\n  } else {\n    this.placed[open.depth] = {depth: open.depth, content: open.content, openEnd: open.openEnd};\n  }\n};\n\nfunction closeNodeStart(node, openStart, openEnd) {\n  var content = node.content;\n  if (openStart > 1) {\n    var first = closeNodeStart(node.firstChild, openStart - 1, node.childCount == 1 ? openEnd - 1 : 0);\n    content = node.content.replaceChild(0, first);\n  }\n  var fill = node.type.contentMatch.fillBefore(content, openEnd == 0);\n  return node.copy(fill.append(content))\n}\n\nfunction closeNodeEnd(node, depth) {\n  var content = node.content;\n  if (depth > 1) {\n    var last = closeNodeEnd(node.lastChild, depth - 1);\n    content = node.content.replaceChild(node.childCount - 1, last);\n  }\n  var fill = node.contentMatchAt(node.childCount).fillBefore(prosemirrorModel.Fragment.empty, true);\n  return node.copy(content.append(fill))\n}\n\nfunction closeFragmentEnd(fragment, depth) {\n  return depth ? fragment.replaceChild(fragment.childCount - 1, closeNodeEnd(fragment.lastChild, depth)) : fragment\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  var this$1 = this;\n\n  if (!slice.size) { return this.deleteRange(from, to) }\n\n  var $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  var 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  var 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 (var d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n    var 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  var preferredTargetIndex = targetDepths.indexOf(preferredTarget);\n\n  var leftNodes = [], preferredDepth = slice.openStart;\n  for (var content = slice.content, i = 0;; i++) {\n    var 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 (var j = slice.openStart; j >= 0; j--) {\n    var openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);\n    var insert = leftNodes[openDepth];\n    if (!insert) { continue }\n    for (var i$1 = 0; i$1 < targetDepths.length; i$1++) {\n      // Loop over possible expansion levels, starting with the\n      // preferred one\n      var targetDepth = targetDepths[(i$1 + preferredTargetIndex) % targetDepths.length], expand = true;\n      if (targetDepth < 0) { expand = false; targetDepth = -targetDepth; }\n      var parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);\n      if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n        { return this$1.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,\n                            new prosemirrorModel.Slice(closeFragment(slice.content, 0, slice.openStart, openDepth),\n                                      openDepth, slice.openEnd)) }\n    }\n  }\n\n  var startSteps = this.steps.length;\n  for (var i$2 = targetDepths.length - 1; i$2 >= 0; i$2--) {\n    this$1.replace(from, to, slice);\n    if (this$1.steps.length > startSteps) { break }\n    var depth = targetDepths[i$2];\n    if (i$2 < 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    var first = fragment.firstChild;\n    fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));\n  }\n  if (depth > newOpen) {\n    var match = parent.contentMatchAt(0);\n    var start = match.fillBefore(fragment).append(fragment);\n    fragment = start.append(match.matchFragment(start).fillBefore(prosemirrorModel.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    var point = insertPoint(this.doc, from, node.type);\n    if (point != null) { from = to = point; }\n  }\n  return this.replaceRange(from, to, new prosemirrorModel.Slice(prosemirrorModel.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  var this$1 = this;\n\n  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);\n  var covered = coveredDepths($from, $to);\n  for (var i = 0; i < covered.length; i++) {\n    var depth = covered[i], last = i == covered.length - 1;\n    if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n      { return this$1.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$1.delete($from.before(depth), $to.after(depth)) }\n  }\n  for (var d = 1; d <= $from.depth; d++) {\n    if (from - $from.start(d) == $from.depth - d && to > $from.end(d))\n      { return this$1.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  var result = [], minDepth = Math.min($from.depth, $to.depth);\n  for (var d = minDepth; d >= 0; d--) {\n    var 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\nexports.Transform = Transform;\nexports.TransformError = TransformError;\nexports.Step = Step;\nexports.StepResult = StepResult;\nexports.joinPoint = joinPoint;\nexports.canJoin = canJoin;\nexports.canSplit = canSplit;\nexports.insertPoint = insertPoint;\nexports.dropPoint = dropPoint;\nexports.liftTarget = liftTarget;\nexports.findWrapping = findWrapping;\nexports.StepMap = StepMap;\nexports.MapResult = MapResult;\nexports.Mapping = Mapping;\nexports.AddMarkStep = AddMarkStep;\nexports.RemoveMarkStep = RemoveMarkStep;\nexports.ReplaceStep = ReplaceStep;\nexports.ReplaceAroundStep = ReplaceAroundStep;\nexports.replaceStep = replaceStep;\n//# sourceMappingURL=index.js.map\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 = (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: {},depth: {} };\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    var this$1 = this;\n\n    for (var i = from; i < to; i++)\n      { if (f(this$1.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    var this$1 = this;\n\n    for (var i = from - 1; i >= to; i--)\n      { if (f(this$1.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 = (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\nmodule.exports = RopeSequence\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\nmodule.exports = OrderedMap\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorTransform = require('prosemirror-transform');\nvar prosemirrorModel = require('prosemirror-model');\nvar prosemirrorState = require('prosemirror-state');\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Delete the selection, if there is one.\nfunction deleteSelection(state, dispatch) {\n  if (state.selection.empty) { return false }\n  if (dispatch) { dispatch(state.tr.deleteSelection().scrollIntoView()); }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool\n// If the selection is empty and at the start of a textblock, try to\n// reduce the distance between that block and the one before it—if\n// there's a block directly before it that can be joined, join them.\n// If not, try to move the selected block closer to the next one in\n// the document structure by lifting it out of its parent or moving it\n// into a parent of the previous block. Will use the view for accurate\n// (bidi-aware) start-of-textblock detection if given.\nfunction joinBackward(state, dispatch, view) {\n  var ref = state.selection;\n  var $cursor = ref.$cursor;\n  if (!$cursor || (view ? !view.endOfTextblock(\"backward\", state)\n                        : $cursor.parentOffset > 0))\n    { return false }\n\n  var $cut = findCutBefore($cursor);\n\n  // If there is no node before this, try to lift\n  if (!$cut) {\n    var range = $cursor.blockRange(), target = range && prosemirrorTransform.liftTarget(range);\n    if (target == null) { return false }\n    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }\n    return true\n  }\n\n  var before = $cut.nodeBefore;\n  // Apply the joining algorithm\n  if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))\n    { return true }\n\n  // If the node below has no content and the node above is\n  // selectable, delete the node below and select the one above.\n  if ($cursor.parent.content.size == 0 &&\n      (textblockAt(before, \"end\") || prosemirrorState.NodeSelection.isSelectable(before))) {\n    if (dispatch) {\n      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());\n      tr.setSelection(textblockAt(before, \"end\") ? prosemirrorState.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)\n                      : prosemirrorState.NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));\n      dispatch(tr.scrollIntoView());\n    }\n    return true\n  }\n\n  // If the node before is an atom, delete it\n  if (before.isAtom && $cut.depth == $cursor.depth - 1) {\n    if (dispatch) { dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView()); }\n    return true\n  }\n\n  return false\n}\n\nfunction textblockAt(node, side) {\n  for (; node; node = (side == \"start\" ? node.firstChild : node.lastChild))\n    { if (node.isTextblock) { return true } }\n  return false\n}\n\n// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool\n// When the selection is empty and at the start of a textblock, select\n// the node before that textblock, if possible. This is intended to be\n// bound to keys like backspace, after\n// [`joinBackward`](#commands.joinBackward) or other deleting\n// commands, as a fall-back behavior when the schema doesn't allow\n// deletion at the selected point.\nfunction selectNodeBackward(state, dispatch, view) {\n  var ref = state.selection;\n  var $cursor = ref.$cursor;\n  if (!$cursor || (view ? !view.endOfTextblock(\"backward\", state)\n                        : $cursor.parentOffset > 0))\n    { return false }\n\n  var $cut = findCutBefore($cursor), node = $cut && $cut.nodeBefore;\n  if (!node || !prosemirrorState.NodeSelection.isSelectable(node)) { return false }\n  if (dispatch)\n    { dispatch(state.tr.setSelection(prosemirrorState.NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView()); }\n  return true\n}\n\nfunction findCutBefore($pos) {\n  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {\n    if ($pos.index(i) > 0) { return $pos.doc.resolve($pos.before(i + 1)) }\n    if ($pos.node(i).type.spec.isolating) { break }\n  } }\n  return null\n}\n\n// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool\n// If the selection is empty and the cursor is at the end of a\n// textblock, try to reduce or remove the boundary between that block\n// and the one after it, either by joining them or by moving the other\n// block closer to this one in the tree structure. Will use the view\n// for accurate start-of-textblock detection if given.\nfunction joinForward(state, dispatch, view) {\n  var ref = state.selection;\n  var $cursor = ref.$cursor;\n  if (!$cursor || (view ? !view.endOfTextblock(\"forward\", state)\n                        : $cursor.parentOffset < $cursor.parent.content.size))\n    { return false }\n\n  var $cut = findCutAfter($cursor);\n\n  // If there is no node after this, there's nothing to do\n  if (!$cut) { return false }\n\n  var after = $cut.nodeAfter;\n  // Try the joining algorithm\n  if (deleteBarrier(state, $cut, dispatch)) { return true }\n\n  // If the node above has no content and the node below is\n  // selectable, delete the node above and select the one below.\n  if ($cursor.parent.content.size == 0 &&\n      (textblockAt(after, \"start\") || prosemirrorState.NodeSelection.isSelectable(after))) {\n    if (dispatch) {\n      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());\n      tr.setSelection(textblockAt(after, \"start\") ? prosemirrorState.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)\n                      : prosemirrorState.NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));\n      dispatch(tr.scrollIntoView());\n    }\n    return true\n  }\n\n  // If the next node is an atom, delete it\n  if (after.isAtom && $cut.depth == $cursor.depth - 1) {\n    if (dispatch) { dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView()); }\n    return true\n  }\n\n  return false\n}\n\n// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool\n// When the selection is empty and at the end of a textblock, select\n// the node coming after that textblock, if possible. This is intended\n// to be bound to keys like delete, after\n// [`joinForward`](#commands.joinForward) and similar deleting\n// commands, to provide a fall-back behavior when the schema doesn't\n// allow deletion at the selected point.\nfunction selectNodeForward(state, dispatch, view) {\n  var ref = state.selection;\n  var $cursor = ref.$cursor;\n  if (!$cursor || (view ? !view.endOfTextblock(\"forward\", state)\n                        : $cursor.parentOffset < $cursor.parent.content.size))\n    { return false }\n\n  var $cut = findCutAfter($cursor), node = $cut && $cut.nodeAfter;\n  if (!node || !prosemirrorState.NodeSelection.isSelectable(node)) { return false }\n  if (dispatch)\n    { dispatch(state.tr.setSelection(prosemirrorState.NodeSelection.create(state.doc, $cut.pos)).scrollIntoView()); }\n  return true\n}\n\nfunction findCutAfter($pos) {\n  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {\n    var parent = $pos.node(i);\n    if ($pos.index(i) + 1 < parent.childCount) { return $pos.doc.resolve($pos.after(i + 1)) }\n    if (parent.type.spec.isolating) { break }\n  } }\n  return null\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Join the selected block or, if there is a text selection, the\n// closest ancestor block of the selection that can be joined, with\n// the sibling above it.\nfunction joinUp(state, dispatch) {\n  var sel = state.selection, nodeSel = sel instanceof prosemirrorState.NodeSelection, point;\n  if (nodeSel) {\n    if (sel.node.isTextblock || !prosemirrorTransform.canJoin(state.doc, sel.from)) { return false }\n    point = sel.from;\n  } else {\n    point = prosemirrorTransform.joinPoint(state.doc, sel.from, -1);\n    if (point == null) { return false }\n  }\n  if (dispatch) {\n    var tr = state.tr.join(point);\n    if (nodeSel) { tr.setSelection(prosemirrorState.NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize)); }\n    dispatch(tr.scrollIntoView());\n  }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Join the selected block, or the closest ancestor of the selection\n// that can be joined, with the sibling after it.\nfunction joinDown(state, dispatch) {\n  var sel = state.selection, point;\n  if (sel instanceof prosemirrorState.NodeSelection) {\n    if (sel.node.isTextblock || !prosemirrorTransform.canJoin(state.doc, sel.to)) { return false }\n    point = sel.to;\n  } else {\n    point = prosemirrorTransform.joinPoint(state.doc, sel.to, 1);\n    if (point == null) { return false }\n  }\n  if (dispatch)\n    { dispatch(state.tr.join(point).scrollIntoView()); }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Lift the selected block, or the closest ancestor block of the\n// selection that can be lifted, out of its parent node.\nfunction lift(state, dispatch) {\n  var ref = state.selection;\n  var $from = ref.$from;\n  var $to = ref.$to;\n  var range = $from.blockRange($to), target = range && prosemirrorTransform.liftTarget(range);\n  if (target == null) { return false }\n  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// If the selection is in a node whose type has a truthy\n// [`code`](#model.NodeSpec.code) property in its spec, replace the\n// selection with a newline character.\nfunction newlineInCode(state, dispatch) {\n  var ref = state.selection;\n  var $head = ref.$head;\n  var $anchor = ref.$anchor;\n  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }\n  if (dispatch) { dispatch(state.tr.insertText(\"\\n\").scrollIntoView()); }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// When the selection is in a node with a truthy\n// [`code`](#model.NodeSpec.code) property in its spec, create a\n// default block after the code block, and move the cursor there.\nfunction exitCode(state, dispatch) {\n  var ref = state.selection;\n  var $head = ref.$head;\n  var $anchor = ref.$anchor;\n  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }\n  var above = $head.node(-1), after = $head.indexAfter(-1), type = above.contentMatchAt(after).defaultType;\n  if (!above.canReplaceWith(after, after, type)) { return false }\n  if (dispatch) {\n    var pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());\n    tr.setSelection(prosemirrorState.Selection.near(tr.doc.resolve(pos), 1));\n    dispatch(tr.scrollIntoView());\n  }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// If a block node is selected, create an empty paragraph before (if\n// it is its parent's first child) or after it.\nfunction createParagraphNear(state, dispatch) {\n  var ref = state.selection;\n  var $from = ref.$from;\n  var $to = ref.$to;\n  if ($from.parent.inlineContent || $to.parent.inlineContent) { return false }\n  var type = $from.parent.contentMatchAt($to.indexAfter()).defaultType;\n  if (!type || !type.isTextblock) { return false }\n  if (dispatch) {\n    var side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;\n    var tr = state.tr.insert(side, type.createAndFill());\n    tr.setSelection(prosemirrorState.TextSelection.create(tr.doc, side + 1));\n    dispatch(tr.scrollIntoView());\n  }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// If the cursor is in an empty textblock that can be lifted, lift the\n// block.\nfunction liftEmptyBlock(state, dispatch) {\n  var ref = state.selection;\n  var $cursor = ref.$cursor;\n  if (!$cursor || $cursor.parent.content.size) { return false }\n  if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {\n    var before = $cursor.before();\n    if (prosemirrorTransform.canSplit(state.doc, before)) {\n      if (dispatch) { dispatch(state.tr.split(before).scrollIntoView()); }\n      return true\n    }\n  }\n  var range = $cursor.blockRange(), target = range && prosemirrorTransform.liftTarget(range);\n  if (target == null) { return false }\n  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Split the parent block of the selection. If the selection is a text\n// selection, also delete its content.\nfunction splitBlock(state, dispatch) {\n  var ref = state.selection;\n  var $from = ref.$from;\n  var $to = ref.$to;\n  if (state.selection instanceof prosemirrorState.NodeSelection && state.selection.node.isBlock) {\n    if (!$from.parentOffset || !prosemirrorTransform.canSplit(state.doc, $from.pos)) { return false }\n    if (dispatch) { dispatch(state.tr.split($from.pos).scrollIntoView()); }\n    return true\n  }\n\n  if (!$from.parent.isBlock) { return false }\n\n  if (dispatch) {\n    var atEnd = $to.parentOffset == $to.parent.content.size;\n    var tr = state.tr;\n    if (state.selection instanceof prosemirrorState.TextSelection) { tr.deleteSelection(); }\n    var deflt = $from.depth == 0 ? null : $from.node(-1).contentMatchAt($from.indexAfter(-1)).defaultType;\n    var types = atEnd && deflt ? [{type: deflt}] : null;\n    var can = prosemirrorTransform.canSplit(tr.doc, tr.mapping.map($from.pos), 1, types);\n    if (!types && !can && prosemirrorTransform.canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt && [{type: deflt}])) {\n      types = [{type: deflt}];\n      can = true;\n    }\n    if (can) {\n      tr.split(tr.mapping.map($from.pos), 1, types);\n      if (!atEnd && !$from.parentOffset && $from.parent.type != deflt &&\n          $from.node(-1).canReplace($from.index(-1), $from.indexAfter(-1), prosemirrorModel.Fragment.from(deflt.create(), $from.parent)))\n        { tr.setNodeMarkup(tr.mapping.map($from.before()), deflt); }\n    }\n    dispatch(tr.scrollIntoView());\n  }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Acts like [`splitBlock`](#commands.splitBlock), but without\n// resetting the set of active marks at the cursor.\nfunction splitBlockKeepMarks(state, dispatch) {\n  return splitBlock(state, dispatch && (function (tr) {\n    var marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());\n    if (marks) { tr.ensureMarks(marks); }\n    dispatch(tr);\n  }))\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Move the selection to the node wrapping the current selection, if\n// any. (Will not select the document node.)\nfunction selectParentNode(state, dispatch) {\n  var ref = state.selection;\n  var $from = ref.$from;\n  var to = ref.to;\n  var pos;\n  var same = $from.sharedDepth(to);\n  if (same == 0) { return false }\n  pos = $from.before(same);\n  if (dispatch) { dispatch(state.tr.setSelection(prosemirrorState.NodeSelection.create(state.doc, pos))); }\n  return true\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Select the whole document.\nfunction selectAll(state, dispatch) {\n  if (dispatch) { dispatch(state.tr.setSelection(new prosemirrorState.AllSelection(state.doc))); }\n  return true\n}\n\nfunction joinMaybeClear(state, $pos, dispatch) {\n  var before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();\n  if (!before || !after || !before.type.compatibleContent(after.type)) { return false }\n  if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {\n    if (dispatch) { dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView()); }\n    return true\n  }\n  if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || prosemirrorTransform.canJoin(state.doc, $pos.pos)))\n    { return false }\n  if (dispatch)\n    { dispatch(state.tr\n             .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))\n             .join($pos.pos)\n             .scrollIntoView()); }\n  return true\n}\n\nfunction deleteBarrier(state, $cut, dispatch) {\n  var before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;\n  if (before.type.spec.isolating || after.type.spec.isolating) { return false }\n  if (joinMaybeClear(state, $cut, dispatch)) { return true }\n\n  if ($cut.parent.canReplace($cut.index(), $cut.index() + 1) &&\n      (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&\n      match.matchType(conn[0] || after.type).validEnd) {\n    if (dispatch) {\n      var end = $cut.pos + after.nodeSize, wrap = prosemirrorModel.Fragment.empty;\n      for (var i = conn.length - 1; i >= 0; i--)\n        { wrap = prosemirrorModel.Fragment.from(conn[i].create(null, wrap)); }\n      wrap = prosemirrorModel.Fragment.from(before.copy(wrap));\n      var tr = state.tr.step(new prosemirrorTransform.ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new prosemirrorModel.Slice(wrap, 1, 0), conn.length, true));\n      var joinAt = end + 2 * conn.length;\n      if (prosemirrorTransform.canJoin(tr.doc, joinAt)) { tr.join(joinAt); }\n      dispatch(tr.scrollIntoView());\n    }\n    return true\n  }\n\n  var selAfter = prosemirrorState.Selection.findFrom($cut, 1);\n  var range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && prosemirrorTransform.liftTarget(range);\n  if (target != null && target >= $cut.depth) {\n    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }\n    return true\n  }\n\n  return false\n}\n\n// Parameterized commands\n\n// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Wrap the selection in a node of the given type with the given\n// attributes.\nfunction wrapIn(nodeType, attrs) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var $from = ref.$from;\n    var $to = ref.$to;\n    var range = $from.blockRange($to), wrapping = range && prosemirrorTransform.findWrapping(range, nodeType, attrs);\n    if (!wrapping) { return false }\n    if (dispatch) { dispatch(state.tr.wrap(range, wrapping).scrollIntoView()); }\n    return true\n  }\n}\n\n// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Returns a command that tries to set the selected textblocks to the\n// given node type with the given attributes.\nfunction setBlockType(nodeType, attrs) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var from = ref.from;\n    var to = ref.to;\n    var applicable = false;\n    state.doc.nodesBetween(from, to, function (node, pos) {\n      if (applicable) { return false }\n      if (!node.isTextblock || node.hasMarkup(nodeType, attrs)) { return }\n      if (node.type == nodeType) {\n        applicable = true;\n      } else {\n        var $pos = state.doc.resolve(pos), index = $pos.index();\n        applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);\n      }\n    });\n    if (!applicable) { return false }\n    if (dispatch) { dispatch(state.tr.setBlockType(from, to, nodeType, attrs).scrollIntoView()); }\n    return true\n  }\n}\n\nfunction markApplies(doc, ranges, type) {\n  var loop = function ( i ) {\n    var ref = ranges[i];\n    var $from = ref.$from;\n    var $to = ref.$to;\n    var can = $from.depth == 0 ? doc.type.allowsMarkType(type) : false;\n    doc.nodesBetween($from.pos, $to.pos, function (node) {\n      if (can) { return false }\n      can = node.inlineContent && node.type.allowsMarkType(type);\n    });\n    if (can) { return { v: true } }\n  };\n\n  for (var i = 0; i < ranges.length; i++) {\n    var returned = loop( i );\n\n    if ( returned ) return returned.v;\n  }\n  return false\n}\n\n// :: (MarkType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool\n// Create a command function that toggles the given mark with the\n// given attributes. Will return `false` when the current selection\n// doesn't support that mark. This will remove the mark if any marks\n// of that type exist in the selection, or add it otherwise. If the\n// selection is empty, this applies to the [stored\n// marks](#state.EditorState.storedMarks) instead of a range of the\n// document.\nfunction toggleMark(markType, attrs) {\n  return function(state, dispatch) {\n    var ref = state.selection;\n    var empty = ref.empty;\n    var $cursor = ref.$cursor;\n    var ranges = ref.ranges;\n    if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType)) { return false }\n    if (dispatch) {\n      if ($cursor) {\n        if (markType.isInSet(state.storedMarks || $cursor.marks()))\n          { dispatch(state.tr.removeStoredMark(markType)); }\n        else\n          { dispatch(state.tr.addStoredMark(markType.create(attrs))); }\n      } else {\n        var has = false, tr = state.tr;\n        for (var i = 0; !has && i < ranges.length; i++) {\n          var ref$1 = ranges[i];\n          var $from = ref$1.$from;\n          var $to = ref$1.$to;\n          has = state.doc.rangeHasMark($from.pos, $to.pos, markType);\n        }\n        for (var i$1 = 0; i$1 < ranges.length; i$1++) {\n          var ref$2 = ranges[i$1];\n          var $from$1 = ref$2.$from;\n          var $to$1 = ref$2.$to;\n          if (has) { tr.removeMark($from$1.pos, $to$1.pos, markType); }\n          else { tr.addMark($from$1.pos, $to$1.pos, markType.create(attrs)); }\n        }\n        dispatch(tr.scrollIntoView());\n      }\n    }\n    return true\n  }\n}\n\nfunction wrapDispatchForJoin(dispatch, isJoinable) {\n  return function (tr) {\n    if (!tr.isGeneric) { return dispatch(tr) }\n\n    var ranges = [];\n    for (var i = 0; i < tr.mapping.maps.length; i++) {\n      var map = tr.mapping.maps[i];\n      for (var j = 0; j < ranges.length; j++)\n        { ranges[j] = map.map(ranges[j]); }\n      map.forEach(function (_s, _e, from, to) { return ranges.push(from, to); });\n    }\n\n    // Figure out which joinable points exist inside those ranges,\n    // by checking all node boundaries in their parent nodes.\n    var joinable = [];\n    for (var i$1 = 0; i$1 < ranges.length; i$1 += 2) {\n      var from = ranges[i$1], to = ranges[i$1 + 1];\n      var $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);\n      for (var index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {\n        var after = parent.maybeChild(index);\n        if (!after) { break }\n        if (index && joinable.indexOf(pos) == -1) {\n          var before = parent.child(index - 1);\n          if (before.type == after.type && isJoinable(before, after))\n            { joinable.push(pos); }\n        }\n        pos += after.nodeSize;\n      }\n    }\n    // Join the joinable points\n    joinable.sort(function (a, b) { return a - b; });\n    for (var i$2 = joinable.length - 1; i$2 >= 0; i$2--) {\n      if (prosemirrorTransform.canJoin(tr.doc, joinable[i$2])) { tr.join(joinable[i$2]); }\n    }\n    dispatch(tr);\n  }\n}\n\n// :: ((state: EditorState, ?(tr: Transaction)) → bool, union<(before: Node, after: Node) → bool, [string]>) → (state: EditorState, ?(tr: Transaction)) → bool\n// Wrap a command so that, when it produces a transform that causes\n// two joinable nodes to end up next to each other, those are joined.\n// Nodes are considered joinable when they are of the same type and\n// when the `isJoinable` predicate returns true for them or, if an\n// array of strings was passed, if their node type name is in that\n// array.\nfunction autoJoin(command, isJoinable) {\n  if (Array.isArray(isJoinable)) {\n    var types = isJoinable;\n    isJoinable = function (node) { return types.indexOf(node.type.name) > -1; };\n  }\n  return function (state, dispatch) { return command(state, dispatch && wrapDispatchForJoin(dispatch, isJoinable)); }\n}\n\n// :: (...[(EditorState, ?(tr: Transaction), ?EditorView) → bool]) → (EditorState, ?(tr: Transaction), ?EditorView) → bool\n// Combine a number of command functions into a single function (which\n// calls them one by one until one returns true).\nfunction chainCommands() {\n  var commands = [], len = arguments.length;\n  while ( len-- ) commands[ len ] = arguments[ len ];\n\n  return function(state, dispatch, view) {\n    for (var i = 0; i < commands.length; i++)\n      { if (commands[i](state, dispatch, view)) { return true } }\n    return false\n  }\n}\n\nvar backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);\nvar del = chainCommands(deleteSelection, joinForward, selectNodeForward);\n\n// :: Object\n// A basic keymap containing bindings not specific to any schema.\n// Binds the following keys (when multiple commands are listed, they\n// are chained with [`chainCommands`](#commands.chainCommands)):\n//\n// * **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`\n// * **Mod-Enter** to `exitCode`\n// * **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`\n// * **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n// * **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n// * **Mod-a** to `selectAll`\nvar pcBaseKeymap = {\n  \"Enter\": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),\n  \"Mod-Enter\": exitCode,\n  \"Backspace\": backspace,\n  \"Mod-Backspace\": backspace,\n  \"Delete\": del,\n  \"Mod-Delete\": del,\n  \"Mod-a\": selectAll\n};\n\n// :: Object\n// A copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,\n// **Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and\n// **Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like\n// Ctrl-Delete.\nvar macBaseKeymap = {\n  \"Ctrl-h\": pcBaseKeymap[\"Backspace\"],\n  \"Alt-Backspace\": pcBaseKeymap[\"Mod-Backspace\"],\n  \"Ctrl-d\": pcBaseKeymap[\"Delete\"],\n  \"Ctrl-Alt-Backspace\": pcBaseKeymap[\"Mod-Delete\"],\n  \"Alt-Delete\": pcBaseKeymap[\"Mod-Delete\"],\n  \"Alt-d\": pcBaseKeymap[\"Mod-Delete\"]\n};\nfor (var key in pcBaseKeymap) { macBaseKeymap[key] = pcBaseKeymap[key]; }\n\n// declare global: os, navigator\nvar mac = typeof navigator != \"undefined\" ? /Mac/.test(navigator.platform)\n          : typeof os != \"undefined\" ? os.platform() == \"darwin\" : false;\n\n// :: Object\n// Depending on the detected platform, this will hold\n// [`pcBasekeymap`](#commands.pcBaseKeymap) or\n// [`macBaseKeymap`](#commands.macBaseKeymap).\nvar baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;\n\nexports.deleteSelection = deleteSelection;\nexports.joinBackward = joinBackward;\nexports.selectNodeBackward = selectNodeBackward;\nexports.joinForward = joinForward;\nexports.selectNodeForward = selectNodeForward;\nexports.joinUp = joinUp;\nexports.joinDown = joinDown;\nexports.lift = lift;\nexports.newlineInCode = newlineInCode;\nexports.exitCode = exitCode;\nexports.createParagraphNear = createParagraphNear;\nexports.liftEmptyBlock = liftEmptyBlock;\nexports.splitBlock = splitBlock;\nexports.splitBlockKeepMarks = splitBlockKeepMarks;\nexports.selectParentNode = selectParentNode;\nexports.selectAll = selectAll;\nexports.wrapIn = wrapIn;\nexports.setBlockType = setBlockType;\nexports.toggleMark = toggleMark;\nexports.autoJoin = autoJoin;\nexports.chainCommands = chainCommands;\nexports.pcBaseKeymap = pcBaseKeymap;\nexports.macBaseKeymap = macBaseKeymap;\nexports.baseKeymap = baseKeymap;\n//# sourceMappingURL=commands.js.map\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar prosemirrorState = require('prosemirror-state');\nvar prosemirrorView = require('prosemirror-view');\nvar prosemirrorModel = require('prosemirror-model');\nvar prosemirrorTransform = require('prosemirror-transform');\nvar prosemirrorKeymap = require('prosemirror-keymap');\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\nvar 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  var cache = new WeakMap;\n  readFromCache = function (key) { return cache.get(key); };\n  addToCache = function (key, value) {\n    cache.set(key, value);\n    return value\n  };\n} else {\n  var cache$1 = [], cacheSize = 10, cachePos = 0;\n  readFromCache = function (key) {\n    for (var i = 0; i < cache$1.length; i += 2)\n      { if (cache$1[i] == key) { return cache$1[i + 1] } }\n  };\n  addToCache = function (key, value) {\n    if (cachePos == cacheSize) { cachePos = 0; }\n    cache$1[cachePos++] = key;\n    return cache$1[cachePos++] = value\n  };\n}\n\nvar Rect = function Rect(left, top, right, bottom) {\n  this.left = left; this.top = top; this.right = right; this.bottom = bottom;\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.\nvar TableMap = function TableMap(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.\nTableMap.prototype.findCell = function findCell (pos) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.map.length; i++) {\n    var curPos = this$1.map[i];\n    if (curPos != pos) { continue }\n    var left = i % this$1.width, top = (i / this$1.width) | 0;\n    var right = left + 1, bottom = top + 1;\n    for (var j = 1; right < this.width && this.map[i + j] == curPos; j++) { right++; }\n    for (var j$1 = 1; bottom < this.height && this.map[i + (this.width * j$1)] == curPos; j$1++) { 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.\nTableMap.prototype.colCount = function colCount (pos) {\n    var this$1 = this;\n\n  for (var i = 0; i < this.map.length; i++)\n    { if (this$1.map[i] == pos) { return i % this$1.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.\nTableMap.prototype.nextCell = function nextCell (pos, axis, dir) {\n  var ref = this.findCell(pos);\n    var left = ref.left;\n    var right = ref.right;\n    var top = ref.top;\n    var bottom = ref.bottom;\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.\nTableMap.prototype.rectBetween = function rectBetween (a, b) {\n  var ref = this.findCell(a);\n    var leftA = ref.left;\n    var rightA = ref.right;\n    var topA = ref.top;\n    var bottomA = ref.bottom;\n  var ref$1 = this.findCell(b);\n    var leftB = ref$1.left;\n    var rightB = ref$1.right;\n    var topB = ref$1.top;\n    var bottomB = ref$1.bottom;\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.\nTableMap.prototype.cellsInRect = function cellsInRect (rect) {\n    var this$1 = this;\n\n  var result = [], seen = {};\n  for (var row = rect.top; row < rect.bottom; row++) {\n    for (var col = rect.left; col < rect.right; col++) {\n      var index = row * this$1.width + col, pos = this$1.map[index];\n      if (seen[pos]) { continue }\n      seen[pos] = true;\n      if ((col != rect.left || !col || this$1.map[index - 1] != pos) &&\n          (row != rect.top || !row || this$1.map[index - this$1.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.\nTableMap.prototype.positionAt = function positionAt (row, col, table) {\n    var this$1 = this;\n\n  for (var i = 0, rowStart = 0;; i++) {\n    var rowEnd = rowStart + table.child(i).nodeSize;\n    if (i == row) {\n      var index = col + row * this$1.width, rowEndIndex = (row + 1) * this$1.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$1.map[index]\n    }\n    rowStart = rowEnd;\n  }\n};\n\n// :: (Node) → TableMap\n// Find the table map for the given table node.\nTableMap.get = function get (table) {\n  return readFromCache(table) || addToCache(table, computeMap(table))\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  var width = findWidth(table), height = table.childCount;\n  var map = [], mapPos = 0, problems = null, colWidths = [];\n  for (var i = 0, e = width * height; i < e; i++) { map[i] = 0; }\n\n  for (var row = 0, pos = 0; row < height; row++) {\n    var rowNode = table.child(row);\n    pos++;\n    for (var i$1 = 0;; i$1++) {\n      while (mapPos < map.length && map[mapPos] != 0) { mapPos++; }\n      if (i$1 == rowNode.childCount) { break }\n      var cellNode = rowNode.child(i$1);\n      var ref = cellNode.attrs;\n      var colspan = ref.colspan;\n      var rowspan = ref.rowspan;\n      var colwidth = ref.colwidth;\n      for (var h = 0; h < rowspan; h++) {\n        if (h + row >= height) {\n          (problems || (problems = [])).push({type: \"overlong_rowspan\", pos: pos, n: rowspan - h});\n          break\n        }\n        var start = mapPos + (h * width);\n        for (var 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: row, pos: pos, n: colspan - w}); }\n          var colW = colwidth && colwidth[w];\n          if (colW) {\n            var 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    var expectedPos = (row + 1) * width, missing = 0;\n    while (mapPos < expectedPos) { if (map[mapPos++] == 0) { missing++; } }\n    if (missing) { (problems || (problems = [])).push({type: \"missing\", row: row, n: missing}); }\n    pos++;\n  }\n\n  var 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 (var i$2 = 0; !badWidths && i$2 < colWidths.length; i$2 += 2)\n    { if (colWidths[i$2] != null && colWidths[i$2 + 1] < height) { badWidths = true; } }\n  if (badWidths) { findBadColWidths(tableMap, colWidths, table); }\n\n  return tableMap\n}\n\nfunction findWidth(table) {\n  var width = -1, hasRowSpan = false;\n  for (var row = 0; row < table.childCount; row++) {\n    var rowNode = table.child(row), rowWidth = 0;\n    if (hasRowSpan) { for (var j = 0; j < row; j++) {\n      var prevRow = table.child(j);\n      for (var i = 0; i < prevRow.childCount; i++) {\n        var cell = prevRow.child(i);\n        if (j + cell.attrs.rowspan > row) { rowWidth += cell.attrs.colspan; }\n      }\n    } }\n    for (var i$1 = 0; i$1 < rowNode.childCount; i$1++) {\n      var cell$1 = rowNode.child(i$1);\n      rowWidth += cell$1.attrs.colspan;\n      if (cell$1.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 (var i = 0, seen = {}; i < map.map.length; i++) {\n    var pos = map.map[i];\n    if (seen[pos]) { continue }\n    seen[pos] = true;\n    var node = table.nodeAt(pos), updated = null;\n    for (var j = 0; j < node.attrs.colspan; j++) {\n      var 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: pos, colwidth: updated}); }\n  }\n}\n\nfunction freshColWidth(attrs) {\n  if (attrs.colwidth) { return attrs.colwidth.slice() }\n  var result = [];\n  for (var i = 0; i < attrs.colspan; i++) { result.push(0); }\n  return result\n}\n\n// Various helper function for working with tables\n\nvar key = new prosemirrorState.PluginKey(\"selectingCells\");\n\nfunction cellAround($pos) {\n  for (var 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\nfunction cellWrapping($pos) {\n  for (var d = $pos.depth; d > 0; d--) { // Sometimes the cell can be in the same depth.\n    var role = $pos.node(d).type.spec.tableRole;\n    if (role === \"cell\" || role === 'header_cell') { return $pos.node(d) }\n  }\n  return null\n}\n\nfunction isInTable(state) {\n  var $head = state.selection.$head;\n  for (var d = $head.depth; d > 0; d--) { if ($head.node(d).type.spec.tableRole == \"row\") { return true } }\n  return false\n}\n\nfunction selectionCell(state) {\n  var 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 (var after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {\n    var role = after.type.spec.tableRole;\n    if (role == \"cell\" || role == \"header_cell\") { return $pos.doc.resolve(pos) }\n  }\n  for (var before = $pos.nodeBefore, pos$1 = $pos.pos; before; before = before.lastChild, pos$1--) {\n    var role$1 = before.type.spec.tableRole;\n    if (role$1 == \"cell\" || role$1 == \"header_cell\") { return $pos.doc.resolve(pos$1 - before.nodeSize) }\n  }\n}\n\nfunction pointsAtCell($pos) {\n  return $pos.parent.type.spec.tableRole == \"row\" && $pos.nodeAfter\n}\n\nfunction moveCellForward($pos) {\n  return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize)\n}\n\nfunction inSameTable($a, $b) {\n  return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1)\n}\n\nfunction findCell($pos) {\n  return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1))\n}\n\nfunction colCount($pos) {\n  return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1))\n}\n\nfunction nextCell($pos, axis, dir) {\n  var start = $pos.start(-1), map = TableMap.get($pos.node(-1));\n  var moved = map.nextCell($pos.pos - start, axis, dir);\n  return moved == null ? null : $pos.node(0).resolve(start + moved)\n}\n\nfunction setAttr(attrs, name, value) {\n  var result = {};\n  for (var prop in attrs) { result[prop] = attrs[prop]; }\n  result[name] = value;\n  return result\n}\n\nfunction rmColSpan(attrs, pos, n) {\n  if ( n === void 0 ) n=1;\n\n  var 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(function (w) { return w > 0; })) { result.colwidth = null; }\n  }\n  return result\n}\n\nfunction addColSpan(attrs, pos, n) {\n  if ( n === void 0 ) n=1;\n\n  var result = setAttr(attrs, \"colspan\", attrs.colspan + n);\n  if (result.colwidth) {\n    result.colwidth = result.colwidth.slice();\n    for (var i = 0; i < n; i++) { result.colwidth.splice(pos, 0, 0); }\n  }\n  return result\n}\n\n// This file defines a ProseMirror selection subclass that models\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.\nvar CellSelection = (function (Selection) {\n  function CellSelection($anchorCell, $headCell) {\n    if ( $headCell === void 0 ) $headCell = $anchorCell;\n\n    var table = $anchorCell.node(-1), map = TableMap.get(table), start = $anchorCell.start(-1);\n    var rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start);\n    var doc = $anchorCell.node(0);\n    var cells = map.cellsInRect(rect).filter(function (p) { return 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    var ranges = cells.map(function (pos) {\n      var cell = table.nodeAt(pos), from = pos + start + 1;\n      return new prosemirrorState.SelectionRange(doc.resolve(from), doc.resolve(from + cell.content.size))\n    });\n    Selection.call(this, 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  if ( Selection ) CellSelection.__proto__ = Selection;\n  CellSelection.prototype = Object.create( Selection && Selection.prototype );\n  CellSelection.prototype.constructor = CellSelection;\n\n  CellSelection.prototype.map = function map (doc, mapping) {\n    var $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));\n    var $headCell = doc.resolve(mapping.map(this.$headCell.pos));\n    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {\n      var 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 prosemirrorState.TextSelection.between($anchorCell, $headCell)\n  };\n\n  // :: () → Slice\n  // Returns a rectangular slice of table rows containing the selected\n  // cells.\n  CellSelection.prototype.content = function content () {\n    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);\n    var rect = map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start);\n    var seen = {}, rows = [];\n    for (var row = rect.top; row < rect.bottom; row++) {\n      var rowContent = [];\n      for (var index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {\n        var pos = map.map[index];\n        if (!seen[pos]) {\n          seen[pos] = true;\n          var cellRect = map.findCell(pos), cell = table.nodeAt(pos);\n          var extraLeft = rect.left - cellRect.left, extraRight = cellRect.right - rect.right;\n          if (extraLeft > 0 || extraRight > 0) {\n            var attrs = cell.attrs;\n            if (extraLeft > 0) { attrs = rmColSpan(attrs, 0, extraLeft); }\n            if (extraRight > 0) { attrs = rmColSpan(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            var attrs$1 = 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$1); }\n            else { cell = cell.type.create(attrs$1, cell.content); }\n          }\n          rowContent.push(cell);\n        }\n      }\n      rows.push(table.child(row).copy(prosemirrorModel.Fragment.from(rowContent)));\n    }\n\n    var fragment = this.isColSelection() && this.isRowSelection() ? table : rows;\n    return new prosemirrorModel.Slice(prosemirrorModel.Fragment.from(fragment), 1, 1)\n  };\n\n  CellSelection.prototype.replace = function replace (tr, content) {\n    if ( content === void 0 ) content = prosemirrorModel.Slice.empty;\n\n    var mapFrom = tr.steps.length, ranges = this.ranges;\n    for (var i = 0; i < ranges.length; i++) {\n      var ref = ranges[i];\n      var $from = ref.$from;\n      var $to = ref.$to;\n      var mapping = tr.mapping.slice(mapFrom);\n      tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? prosemirrorModel.Slice.empty : content);\n    }\n    var sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1);\n    if (sel) { tr.setSelection(sel); }\n  };\n\n  CellSelection.prototype.replaceWith = function replaceWith (tr, node) {\n    this.replace(tr, new prosemirrorModel.Slice(prosemirrorModel.Fragment.from(node), 0, 0));\n  };\n\n  CellSelection.prototype.forEachCell = function forEachCell (f) {\n    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);\n    var cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start));\n    for (var 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  CellSelection.prototype.isColSelection = function isColSelection () {\n    var anchorTop = this.$anchorCell.index(-1), headTop = this.$headCell.index(-1);\n    if (Math.min(anchorTop, headTop) > 0) { return false }\n    var 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  CellSelection.colSelection = function colSelection ($anchorCell, $headCell) {\n    if ( $headCell === void 0 ) $headCell = $anchorCell;\n\n    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);\n    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);\n    var 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  CellSelection.prototype.isRowSelection = function isRowSelection () {\n    var map = TableMap.get(this.$anchorCell.node(-1)), start = this.$anchorCell.start(-1);\n    var 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    var 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  CellSelection.prototype.eq = function 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  CellSelection.rowSelection = function rowSelection ($anchorCell, $headCell) {\n    if ( $headCell === void 0 ) $headCell = $anchorCell;\n\n    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);\n    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);\n    var 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  CellSelection.prototype.toJSON = function toJSON () {\n    return {type: \"cell\", anchor: this.$anchorCell.pos, head: this.$headCell.pos}\n  };\n\n  CellSelection.fromJSON = function fromJSON (doc, json) {\n    return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head))\n  };\n\n  // :: (Node, number, ?number) → CellSelection\n  CellSelection.create = function create (doc, anchorCell, headCell) {\n    if ( headCell === void 0 ) headCell = anchorCell;\n\n    return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell))\n  };\n\n  CellSelection.prototype.getBookmark = function getBookmark () { return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos) };\n\n  return CellSelection;\n}(prosemirrorState.Selection));\n\nCellSelection.prototype.visible = false;\n\nprosemirrorState.Selection.jsonID(\"cell\", CellSelection);\n\nvar CellBookmark = function CellBookmark(anchor, head) {\n  this.anchor = anchor;\n  this.head = head;\n};\nCellBookmark.prototype.map = function map (mapping) {\n  return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head))\n};\nCellBookmark.prototype.resolve = function resolve (doc) {\n  var $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 prosemirrorState.Selection.near($headCell, 1) }\n};\n\nfunction drawCellSelection(state) {\n  if (!(state.selection instanceof CellSelection)) { return null }\n  var cells = [];\n  state.selection.forEachCell(function (node, pos) {\n    cells.push(prosemirrorView.Decoration.node(pos, pos + node.nodeSize, {class: \"selectedCell\"}));\n  });\n  return prosemirrorView.DecorationSet.create(state.doc, cells)\n}\n\nfunction isCellBoundarySelection(ref) {\n  var $from = ref.$from;\n  var $to = ref.$to;\n\n  if ($from.pos == $to.pos || $from.pos < $from.pos - 6) { return false } // Cheap elimination\n  var 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 (var 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(ref) {\n  var $from = ref.$from;\n  var $to = ref.$to;\n\n  var fromCellBoundaryNode;\n  var toCellBoundaryNode;\n\n  for (var i = $from.depth; i > 0; i--) {\n    var 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 (var i$1 = $to.depth; i$1 > 0; i$1--) {\n    var node$1 = $to.node(i$1);\n    if (node$1.type.spec.tableRole === 'cell' || node$1.type.spec.tableRole === 'header_cell') {\n      toCellBoundaryNode = node$1;\n      break;\n    }\n  }\n\n  return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0\n}\n\nfunction normalizeSelection(state, tr, allowTableNodeSelection) {\n  var sel = (tr || state).selection, doc = (tr || state).doc, normalize, role;\n  if (sel instanceof prosemirrorState.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      var $cell = doc.resolve(sel.from + 1);\n      normalize = CellSelection.rowSelection($cell, $cell);\n    } else if (!allowTableNodeSelection) {\n      var map = TableMap.get(sel.node), start = sel.from + 1;\n      var lastCell = start + map.map[map.width * map.height - 1];\n      normalize = CellSelection.create(doc, start + 1, lastCell);\n    }\n  } else if (sel instanceof prosemirrorState.TextSelection && isCellBoundarySelection(sel)) {\n    normalize = prosemirrorState.TextSelection.create(doc, sel.from);\n  } else if (sel instanceof prosemirrorState.TextSelection && isTextSelectionAcrossCells(sel)) {\n    normalize = prosemirrorState.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\n// Helper for creating a schema that supports tables.\n\nfunction getCellAttrs(dom, extraAttrs) {\n  var widthAttr = dom.getAttribute(\"data-colwidth\");\n  var widths = widthAttr && /^\\d+(,\\d+)*$/.test(widthAttr) ? widthAttr.split(\",\").map(function (s) { return Number(s); }) : null;\n  var colspan = Number(dom.getAttribute(\"colspan\") || 1);\n  var result = {\n    colspan: colspan,\n    rowspan: Number(dom.getAttribute(\"rowspan\") || 1),\n    colwidth: widths && widths.length == colspan ? widths : null\n  };\n  for (var prop in extraAttrs) {\n    var getter = extraAttrs[prop].getFromDOM;\n    var value = getter && getter(dom);\n    if (value != null) { result[prop] = value; }\n  }\n  return result\n}\n\nfunction setCellAttrs(node, extraAttrs) {\n  var attrs = {};\n  if (node.attrs.colspan != 1) { attrs.colspan = node.attrs.colspan; }\n  if (node.attrs.rowspan != 1) { attrs.rowspan = node.attrs.rowspan; }\n  if (node.attrs.colwidth)\n    { attrs[\"data-colwidth\"] = node.attrs.colwidth.join(\",\"); }\n  for (var prop in extraAttrs) {\n    var setter = extraAttrs[prop].setDOMAttr;\n    if (setter) { setter(node.attrs[prop], attrs); }\n  }\n  return attrs\n}\n\n// :: (Object) → Object\n//\n// This function creates a set of [node\n// specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for\n// `table`, `table_row`, and `table_cell` nodes types as used by this\n// module. The result can then be added to the set of nodes when\n// creating a a schema.\n//\n//   options::- The following options are understood:\n//\n//     tableGroup:: ?string\n//     A group name (something like `\"block\"`) to add to the table\n//     node type.\n//\n//     cellContent:: string\n//     The content expression for table cells.\n//\n//     cellAttributes:: ?Object\n//     Additional attributes to add to cells. Maps attribute names to\n//     objects with the following properties:\n//\n//       default:: any\n//       The attribute's default value.\n//\n//       getFromDOM:: ?(dom.Node) → any\n//       A function to read the attribute's value from a DOM node.\n//\n//       setDOMAttr:: ?(value: any, attrs: Object)\n//       A function to add the attribute's value to an attribute\n//       object that's used to render the cell's DOM.\nfunction tableNodes(options) {\n  var extraAttrs = options.cellAttributes || {};\n  var cellAttrs = {\n    colspan: {default: 1},\n    rowspan: {default: 1},\n    colwidth: {default: null}\n  };\n  for (var prop in extraAttrs)\n    { cellAttrs[prop] = {default: extraAttrs[prop].default}; }\n\n  return {\n    table: {\n      content: \"table_row+\",\n      tableRole: \"table\",\n      isolating: true,\n      group: options.tableGroup,\n      parseDOM: [{tag: \"table\"}],\n      toDOM: function toDOM() { return [\"table\", [\"tbody\", 0]] }\n    },\n    table_row: {\n      content: \"(table_cell | table_header)*\",\n      tableRole: \"row\",\n      parseDOM: [{tag: \"tr\"}],\n      toDOM: function toDOM() { return [\"tr\", 0] }\n    },\n    table_cell: {\n      content: options.cellContent,\n      attrs: cellAttrs,\n      tableRole: \"cell\",\n      isolating: true,\n      parseDOM: [{tag: \"td\", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],\n      toDOM: function toDOM(node) { return [\"td\", setCellAttrs(node, extraAttrs), 0] }\n    },\n    table_header: {\n      content: options.cellContent,\n      attrs: cellAttrs,\n      tableRole: \"header_cell\",\n      isolating: true,\n      parseDOM: [{tag: \"th\", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],\n      toDOM: function toDOM(node) { return [\"th\", setCellAttrs(node, extraAttrs), 0] }\n    }\n  }\n}\n\nfunction tableNodeTypes(schema) {\n  var result = schema.cached.tableNodeTypes;\n  if (!result) {\n    result = schema.cached.tableNodeTypes = {};\n    for (var name in schema.nodes) {\n      var type = schema.nodes[name], role = type.spec.tableRole;\n      if (role) { result[role] = type; }\n    }\n  }\n  return result\n}\n\n// Utilities used for copy/paste handling.\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.\nfunction pastedCells(slice) {\n  if (!slice.size) { return null }\n  var content = slice.content;\n  var openStart = slice.openStart;\n  var openEnd = slice.openEnd;\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  var first = content.firstChild, role = first.type.spec.tableRole;\n  var schema = first.type.schema, rows = [];\n  if (role == \"row\") {\n    for (var i = 0; i < content.childCount; i++) {\n      var cells = content.child(i).content;\n      var left = i ? 0 : Math.max(0, openStart - 1);\n      var right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);\n      if (left || right) { cells = fitSlice(tableNodeTypes(schema).row, new prosemirrorModel.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 prosemirrorModel.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  var widths = [];\n  for (var i = 0; i < rows.length; i++) {\n    var row = rows[i];\n    for (var j = row.childCount - 1; j >= 0; j--) {\n      var ref = row.child(j).attrs;\n      var rowspan = ref.rowspan;\n      var colspan = ref.colspan;\n      for (var r = i; r < i + rowspan; r++)\n        { widths[r] = (widths[r] || 0) + colspan; }\n    }\n  }\n  var width = 0;\n  for (var r$1 = 0; r$1 < widths.length; r$1++) { width = Math.max(width, widths[r$1]); }\n  for (var r$2 = 0; r$2 < widths.length; r$2++) {\n    if (r$2 >= rows.length) { rows.push(prosemirrorModel.Fragment.empty); }\n    if (widths[r$2] < width) {\n      var empty = tableNodeTypes(schema).cell.createAndFill(), cells = [];\n      for (var i$1 = widths[r$2]; i$1 < width; i$1++) { cells.push(empty); }\n      rows[r$2] = rows[r$2].append(prosemirrorModel.Fragment.from(cells));\n    }\n  }\n  return {height: rows.length, width: width, rows: rows}\n}\n\nfunction fitSlice(nodeType, slice) {\n  var node = nodeType.createAndFill();\n  var tr = new prosemirrorTransform.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.\nfunction clipCells(ref, newWidth, newHeight) {\n  var width = ref.width;\n  var height = ref.height;\n  var rows = ref.rows;\n\n  if (width != newWidth) {\n    var added = [], newRows = [];\n    for (var row = 0; row < rows.length; row++) {\n      var frag = rows[row], cells = [];\n      for (var col = added[row] || 0, i = 0; col < newWidth; i++) {\n        var cell = frag.child(i % frag.childCount);\n        if (col + cell.attrs.colspan > newWidth)\n          { cell = cell.type.create(rmColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content); }\n        cells.push(cell);\n        col += cell.attrs.colspan;\n        for (var j = 1; j < cell.attrs.rowspan; j++)\n          { added[row + j] = (added[row + j] || 0) + cell.attrs.colspan; }\n      }\n      newRows.push(prosemirrorModel.Fragment.from(cells));\n    }\n    rows = newRows;\n    width = newWidth;\n  }\n\n  if (height != newHeight) {\n    var newRows$1 = [];\n    for (var row$1 = 0, i$1 = 0; row$1 < newHeight; row$1++, i$1++) {\n      var cells$1 = [], source = rows[i$1 % height];\n      for (var j$1 = 0; j$1 < source.childCount; j$1++) {\n        var cell$1 = source.child(j$1);\n        if (row$1 + cell$1.attrs.rowspan > newHeight)\n          { cell$1 = cell$1.type.create(setAttr(cell$1.attrs, \"rowspan\", newHeight - cell$1.attrs.rowspan), cell$1.content); }\n        cells$1.push(cell$1);\n      }\n      newRows$1.push(prosemirrorModel.Fragment.from(cells$1));\n    }\n    rows = newRows$1;\n    height = newHeight;\n  }\n\n  return {width: width, height: height, rows: 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  var schema = tr.doc.type.schema, types = tableNodeTypes(schema), empty, emptyHead;\n  if (width > map.width) {\n    for (var row = 0, rowEnd = 0; row < map.height; row++) {\n      var rowNode = table.child(row);\n      rowEnd += rowNode.nodeSize;\n      var cells = [], add = (void 0);\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 (var 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    var cells$1 = [];\n    for (var i$1 = 0, start$1 = (map.height - 1) * map.width; i$1 < Math.max(map.width, width); i$1++) {\n      var header = i$1 >= map.width ? false :\n          table.nodeAt(map.map[start$1 + i$1]).type == types.header_cell;\n      cells$1.push(header\n                 ? (emptyHead || (emptyHead = types.header_cell.createAndFill()))\n                 : (empty || (empty = types.cell.createAndFill())));\n    }\n\n    var emptyRow = types.row.create(null, prosemirrorModel.Fragment.from(cells$1)), rows = [];\n    for (var i$2 = map.height; i$2 < height; i$2++) { 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  var found = false;\n  for (var col = left; col < right; col++) {\n    var index = top * map.width + col, pos = map.map[index];\n    if (map.map[index - map.width] == pos) {\n      found = true;\n      var cell = table.nodeAt(pos);\n      var ref = map.findCell(pos);\n      var cellTop = ref.top;\n      var cellLeft = ref.left;\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  var found = false;\n  for (var row = top; row < bottom; row++) {\n    var index = row * map.width + left, pos = map.map[index];\n    if (map.map[index - 1] == pos) {\n      found = true;\n      var cell = table.nodeAt(pos), cellLeft = map.colCount(pos);\n      var updatePos = tr.mapping.slice(mapFrom).map(pos + start);\n      tr.setNodeMarkup(updatePos, null, rmColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)));\n      tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(rmColSpan(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.\nfunction insertCells(state, dispatch, tableStart, rect, cells) {\n  var table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc, map = TableMap.get(table);\n  var top = rect.top;\n  var left = rect.left;\n  var right = left + cells.width, bottom = top + cells.height;\n  var 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 (var row = top; row < bottom; row++) {\n    var 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 prosemirrorModel.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\n// This file defines a number of helpers for wiring up user input to\n\nvar handleKeyDown = prosemirrorKeymap.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 function (state, dispatch, view) {\n    var sel = state.selection;\n    if (sel instanceof CellSelection) {\n      return maybeSetSelection(state, dispatch, prosemirrorState.Selection.near(sel.$headCell, dir))\n    }\n    if (axis != \"horiz\" && !sel.empty) { return false }\n    var end = atEndOfCell(view, axis, dir);\n    if (end == null) { return false }\n    if (axis == \"horiz\") {\n      return maybeSetSelection(state, dispatch, prosemirrorState.Selection.near(state.doc.resolve(sel.head + dir), dir))\n    } else {\n      var $cell = state.doc.resolve(end), $next = nextCell($cell, axis, dir), newSel;\n      if ($next) { newSel = prosemirrorState.Selection.near($next, 1); }\n      else if (dir < 0) { newSel = prosemirrorState.Selection.near(state.doc.resolve($cell.before(-1)), -1); }\n      else { newSel = prosemirrorState.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 function (state, dispatch, view) {\n    var sel = state.selection;\n    if (!(sel instanceof CellSelection)) {\n      var end = atEndOfCell(view, axis, dir);\n      if (end == null) { return false }\n      sel = new CellSelection(state.doc.resolve(end));\n    }\n    var $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  var sel = state.selection;\n  if (!(sel instanceof CellSelection)) { return false }\n  if (dispatch) {\n    var tr = state.tr, baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;\n    sel.forEachCell(function (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 prosemirrorModel.Slice(baseContent, 0, 0)); }\n    });\n    if (tr.docChanged) { dispatch(tr); }\n  }\n  return true\n}\n\nfunction handleTripleClick(view, pos) {\n  var 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\nfunction handlePaste(view, _, slice) {\n  if (!isInTable(view.state)) { return false }\n  var cells = pastedCells(slice), sel = view.state.selection;\n  if (sel instanceof CellSelection) {\n    if (!cells) { cells = {width: 1, height: 1, rows: [prosemirrorModel.Fragment.from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]}; }\n    var table = sel.$anchorCell.node(-1), start = sel.$anchorCell.start(-1);\n    var 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    var $cell = selectionCell(view.state), start$1 = $cell.start(-1);\n    insertCells(view.state, view.dispatch, start$1, TableMap.get($cell.node(-1)).findCell($cell.pos - start$1), cells);\n    return true\n  } else {\n    return false\n  }\n}\n\nfunction handleMouseDown(view, startEvent) {\n  if (startEvent.ctrlKey || startEvent.metaKey) { return }\n\n  var 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    var $head = cellUnderMouse(view, event);\n    var starting = key.getState(view.state) == null;\n    if (!$head || !inSameTable($anchor, $head)) {\n      if (starting) { $head = $anchor; }\n      else { return }\n    }\n    var selection = new CellSelection($anchor, $head);\n    if (starting || !view.state.selection.eq(selection)) {\n      var 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    var 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 prosemirrorState.TextSelection)) { return null }\n  var ref = view.state.selection;\n  var $head = ref.$head;\n  for (var d = $head.depth - 1; d >= 0; d--) {\n    var 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      var cellPos = $head.before(d);\n      var 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  var 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\n// This file defines helpers for normalizing tables, making sure no\n\nvar fixTablesKey = new prosemirrorState.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  var oldSize = old.childCount, curSize = cur.childCount;\n  outer: for (var i = 0, j = 0; i < curSize; i++) {\n    var child = cur.child(i);\n    for (var 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.\nfunction fixTables(state, oldState) {\n  var tr, check = function (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.\nfunction fixTable(state, table, tablePos, tr) {\n  var 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  var mustAdd = [];\n  for (var i = 0; i < map.height; i++) { mustAdd.push(0); }\n  for (var i$1 = 0; i$1 < map.problems.length; i$1++) {\n    var prob = map.problems[i$1];\n    if (prob.type == \"collision\") {\n      var cell = table.nodeAt(prob.pos);\n      for (var j = 0; j < cell.attrs.rowspan; j++) { mustAdd[prob.row + j] += prob.n; }\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, rmColSpan(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      var cell$1 = table.nodeAt(prob.pos);\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$1.attrs, \"rowspan\", cell$1.attrs.rowspan - prob.n));\n    } else if (prob.type == \"colwidth mismatch\") {\n      var cell$2 = table.nodeAt(prob.pos);\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$2.attrs, \"colwidth\", prob.colwidth));\n    }\n  }\n  var first, last;\n  for (var i$2 = 0; i$2 < mustAdd.length; i$2++) { if (mustAdd[i$2]) {\n    if (first == null) { first = i$2; }\n    last = i$2;\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 (var i$3 = 0, pos = tablePos + 1; i$3 < map.height; i$3++) {\n    var row = table.child(i$3);\n    var end = pos + row.nodeSize;\n    var add = mustAdd[i$3];\n    if (add > 0) {\n      var tableNodeType = 'cell';\n      if (row.firstChild) {\n        tableNodeType = row.firstChild.type.spec.tableRole;\n      }\n      var nodes = [];\n      for (var j$1 = 0; j$1 < add; j$1++)\n        { nodes.push(tableNodeTypes(state.schema)[tableNodeType].createAndFill()); }\n      var side = (i$3 == 0 || first == i$3 - 1) && last == i$3 ? 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\n// This file defines a number of table-related commands.\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.\nfunction selectedRect(state) {\n  var sel = state.selection, $pos = selectionCell(state);\n  var table = $pos.node(-1), tableStart = $pos.start(-1), map = TableMap.get(table);\n  var 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\nfunction columnIsHeader(map, table, col) {\n  var headerCell = tableNodeTypes(table.type.schema).header_cell;\n  for (var 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\n// Add a column at the given position in a table.\nfunction addColumn(tr, ref, col) {\n  var map = ref.map;\n  var tableStart = ref.tableStart;\n  var table = ref.table;\n\n  var refColumn = col > 0 ? -1 : 0;\n  if (columnIsHeader(map, table, col + refColumn))\n    { refColumn = col == 0 || col == map.width ? null : 0; }\n\n  for (var row = 0; row < map.height; row++) {\n    var 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      var 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      var type = refColumn == null ? tableNodeTypes(table.type.schema).cell\n          : table.nodeAt(map.map[index + refColumn]).type;\n      var pos$1 = map.positionAt(row, col, table);\n      tr.insert(tr.mapping.map(tableStart + pos$1), 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.\nfunction addColumnBefore(state, dispatch) {\n  if (!isInTable(state)) { return false }\n  if (dispatch) {\n    var 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.\nfunction addColumnAfter(state, dispatch) {\n  if (!isInTable(state)) { return false }\n  if (dispatch) {\n    var rect = selectedRect(state);\n    dispatch(addColumn(state.tr, rect, rect.right));\n  }\n  return true\n}\n\nfunction removeColumn(tr, ref, col) {\n  var map = ref.map;\n  var table = ref.table;\n  var tableStart = ref.tableStart;\n\n  var mapStart = tr.mapping.maps.length;\n  for (var row = 0; row < map.height;) {\n    var 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                       rmColSpan(cell.attrs, col - map.colCount(pos)));\n    } else {\n      var 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.\nfunction deleteColumn(state, dispatch) {\n  if (!isInTable(state)) { return false }\n  if (dispatch) {\n    var rect = selectedRect(state), tr = state.tr;\n    if (rect.left == 0 && rect.right == rect.map.width) { return false }\n    for (var 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\nfunction rowIsHeader(map, table, row) {\n  var headerCell = tableNodeTypes(table.type.schema).header_cell;\n  for (var 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\nfunction addRow(tr, ref, row) {\n  var map = ref.map;\n  var tableStart = ref.tableStart;\n  var table = ref.table;\n\n  var rowPos = tableStart;\n  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }\n  var cells = [], refRow = row > 0 ? -1 : 0;\n  if (rowIsHeader(map, table, row + refRow))\n    { refRow = row == 0 || row == map.height ? null : 0; }\n  for (var 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      var 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      var 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.\nfunction addRowBefore(state, dispatch) {\n  if (!isInTable(state)) { return false }\n  if (dispatch) {\n    var 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.\nfunction addRowAfter(state, dispatch) {\n  if (!isInTable(state)) { return false }\n  if (dispatch) {\n    var rect = selectedRect(state);\n    dispatch(addRow(state.tr, rect, rect.bottom));\n  }\n  return true\n}\n\nfunction removeRow(tr, ref, row) {\n  var map = ref.map;\n  var table = ref.table;\n  var tableStart = ref.tableStart;\n\n  var rowPos = 0;\n  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }\n  var nextRow = rowPos + table.child(row).nodeSize;\n\n  var mapFrom = tr.mapping.maps.length;\n  tr.delete(rowPos + tableStart, nextRow + tableStart);\n\n  for (var col = 0, index = row * map.width; col < map.width; col++, index++) {\n    var 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      var 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      var cell = table.nodeAt(pos);\n      var copy = cell.type.create(setAttr(cell.attrs, \"rowspan\", cell.attrs.rowspan - 1), cell.content);\n      var 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.\nfunction deleteRow(state, dispatch) {\n  if (!isInTable(state)) { return false }\n  if (dispatch) {\n    var rect = selectedRect(state), tr = state.tr;\n    if (rect.top == 0 && rect.bottom == rect.map.height) { return false }\n    for (var 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  var c = cell.content;\n  return c.childCount == 1 && c.firstChild.isTextblock && c.firstChild.childCount == 0\n}\n\nfunction cellsOverlapRectangle(ref, rect) {\n  var width = ref.width;\n  var height = ref.height;\n  var map = ref.map;\n\n  var indexTop = rect.top * width + rect.left, indexLeft = indexTop;\n  var indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1);\n  for (var 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 (var i$1 = rect.left; i$1 < rect.right; i$1++) {\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.\nfunction mergeCells(state, dispatch) {\n  var sel = state.selection;\n  if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos) { return false }\n  var rect = selectedRect(state);\n  var map = rect.map;\n  if (cellsOverlapRectangle(map, rect)) { return false }\n  if (dispatch) {\n    var tr = state.tr, seen = {}, content = prosemirrorModel.Fragment.empty, mergedPos, mergedCell;\n    for (var row = rect.top; row < rect.bottom; row++) {\n      for (var col = rect.left; col < rect.right; col++) {\n        var 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          var 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      var end = mergedPos + 1 + mergedCell.content.size;\n      var 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.\nfunction splitCell(state, dispatch) {\n  var nodeTypes = tableNodeTypes(state.schema);\n  return splitCellWithType(function (ref) {\n    var node = ref.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.\nfunction splitCellWithType(getCellType) {\n  return function (state, dispatch) {\n    var sel = state.selection;\n    var 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      var 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      var rect = selectedRect(state), tr = state.tr;\n      for (var i = 0; i < rect.right - rect.left; i++)\n        { attrs.push(colwidth ? setAttr(baseAttrs, \"colwidth\", colwidth && colwidth[i] ? [colwidth[i]] : null) : baseAttrs); }\n      var lastCell;\n      for (var row = rect.top; row < rect.bottom; row++) {\n        var pos = rect.map.positionAt(row, rect.left, rect.table);\n        if (row == rect.top) { pos += cellNode.nodeSize; }\n        for (var col = rect.left, i$1 = 0; col < rect.right; col++, i$1++) {\n          if (col == rect.left && row == rect.top) { continue }\n          tr.insert(lastCell = tr.mapping.map(pos + rect.tableStart, 1), getCellType({ node: cellNode, row: row, col: col}).createAndFill(attrs[i$1]));\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.\nfunction setCellAttr(name, value) {\n  return function(state, dispatch) {\n    if (!isInTable(state)) { return false }\n    var $cell = selectionCell(state);\n    if ($cell.nodeAfter.attrs[name] === value) { return false }\n    if (dispatch) {\n      var tr = state.tr;\n      if (state.selection instanceof CellSelection)\n        { state.selection.forEachCell(function (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      var types = tableNodeTypes(state.schema);\n      var rect = selectedRect(state), tr = state.tr;\n      var 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      var nodes = cells.map(function (pos) { return rect.table.nodeAt(pos); });\n      for (var 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 (var i$1 = 0; i$1 < cells.length; i$1++) // No headers removed, add instead\n        { tr.setNodeMarkup(rect.tableStart + cells[i$1], types.header_cell, nodes[i$1].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  var 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 (var i = 0; i < cellPositions.length; i++) {\n    var 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.\nfunction 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      var types = tableNodeTypes(state.schema);\n      var rect = selectedRect(state), tr = state.tr;\n\n      var isHeaderRowEnabled = isHeaderEnabledByType(\"row\", rect, types);\n      var isHeaderColumnEnabled = isHeaderEnabledByType(\"column\", rect, types);\n\n      var isHeaderEnabled = type === \"column\" ? isHeaderRowEnabled :\n                            type === \"row\"    ? isHeaderColumnEnabled : false;\n\n      var selectionStartsAt = isHeaderEnabled ? 1 : 0;\n\n      var 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      var 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(function (relativeCellPos) {\n        var cellPos = relativeCellPos + rect.tableStart;\n        var 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.\nvar toggleHeaderRow = toggleHeader(\"row\", { useDeprecatedLogic: true });\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected column contains header cells.\nvar toggleHeaderColumn = toggleHeader(\"column\", { useDeprecatedLogic: true });\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected cells are header cells.\nvar toggleHeaderCell = toggleHeader(\"cell\", { useDeprecatedLogic: true });\n\nfunction findNextCell($cell, dir) {\n  if (dir < 0) {\n    var before = $cell.nodeBefore;\n    if (before) { return $cell.pos - before.nodeSize }\n    for (var row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {\n      var 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    var table = $cell.node(-1);\n    for (var row$1 = $cell.indexAfter(-1), rowStart = $cell.after(); row$1 < table.childCount; row$1++) {\n      var rowNode$1 = table.child(row$1);\n      if (rowNode$1.childCount) { return rowStart + 1 }\n      rowStart += rowNode$1.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.\nfunction goToNextCell(direction) {\n  return function(state, dispatch) {\n    if (!isInTable(state)) { return false }\n    var cell = findNextCell(selectionCell(state), direction);\n    if (cell == null) { return }\n    if (dispatch) {\n      var $cell = state.doc.resolve(cell);\n      dispatch(state.tr.setSelection(prosemirrorState.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.\nfunction deleteTable(state, dispatch) {\n  var $pos = state.selection.$anchor;\n  for (var d = $pos.depth; d > 0; d--) {\n    var 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\nvar TableView = function TableView(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\nTableView.prototype.update = function 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\nTableView.prototype.ignoreMutation = function ignoreMutation (record) {\n  return record.type == \"attributes\" && (record.target == this.table || this.colgroup.contains(record.target))\n};\n\nfunction updateColumns(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {\n  var totalWidth = 0, fixedWidth = true;\n  var nextDOM = colgroup.firstChild, row = node.firstChild;\n  for (var i = 0, col = 0; i < row.childCount; i++) {\n    var ref = row.child(i).attrs;\n    var colspan = ref.colspan;\n    var colwidth = ref.colwidth;\n    for (var j = 0; j < colspan; j++, col++) {\n      var hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j];\n      var 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    var 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\nvar key$1 = new prosemirrorState.PluginKey(\"tableColumnResizing\");\n\nfunction columnResizing(ref) {\n  if ( ref === void 0 ) ref = {};\n  var handleWidth = ref.handleWidth; if ( handleWidth === void 0 ) handleWidth = 5;\n  var cellMinWidth = ref.cellMinWidth; if ( cellMinWidth === void 0 ) cellMinWidth = 25;\n  var View = ref.View; if ( View === void 0 ) View = TableView;\n  var lastColumnResizable = ref.lastColumnResizable; if ( lastColumnResizable === void 0 ) lastColumnResizable = true;\n\n  var plugin = new prosemirrorState.Plugin({\n    key: key$1,\n    state: {\n      init: function init(_, state) {\n        this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] =\n          function (node, view) { return new View(node, cellMinWidth, view); };\n        return new ResizeState(-1, false)\n      },\n      apply: function apply(tr, prev) {\n        return prev.apply(tr)\n      }\n    },\n    props: {\n      attributes: function attributes(state) {\n        var pluginState = key$1.getState(state);\n        return pluginState.activeHandle > -1 ? {class: \"resize-cursor\"} : null\n      },\n\n      handleDOMEvents: {\n        mousemove: function mousemove(view, event) { handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable); },\n        mouseleave: function mouseleave(view) { handleMouseLeave(view); },\n        mousedown: function mousedown(view, event) { handleMouseDown$1(view, event, cellMinWidth); }\n      },\n\n      decorations: function decorations(state) {\n        var pluginState = key$1.getState(state);\n        if (pluginState.activeHandle > -1) { return handleDecorations(state, pluginState.activeHandle) }\n      },\n\n      nodeViews: {}\n    }\n  });\n  return plugin\n}\n\nvar ResizeState = function ResizeState(activeHandle, dragging) {\n  this.activeHandle = activeHandle;\n  this.dragging = dragging;\n};\n\nResizeState.prototype.apply = function apply (tr) {\n  var state = this, action = tr.getMeta(key$1);\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    var 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\nfunction handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {\n  var pluginState = key$1.getState(view.state);\n\n  if (!pluginState.dragging) {\n    var target = domCellAround(event.target), cell = -1;\n    if (target) {\n      var ref = target.getBoundingClientRect();\n      var left = ref.left;\n      var right = ref.right;\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        var $cell = view.state.doc.resolve(cell);\n        var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);\n        var 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  var pluginState = key$1.getState(view.state);\n  if (pluginState.activeHandle > -1 && !pluginState.dragging) { updateHandle(view, -1); }\n}\n\nfunction handleMouseDown$1(view, event, cellMinWidth) {\n  var pluginState = key$1.getState(view.state);\n  if (pluginState.activeHandle == -1 || pluginState.dragging) { return false }\n\n  var cell = view.state.doc.nodeAt(pluginState.activeHandle);\n  var width = currentColWidth(view, pluginState.activeHandle, cell.attrs);\n  view.dispatch(view.state.tr.setMeta(key$1, {setDragging: {startX: event.clientX, startWidth: width}}));\n\n  function finish(event) {\n    window.removeEventListener(\"mouseup\", finish);\n    window.removeEventListener(\"mousemove\", move);\n    var pluginState = key$1.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$1, {setDragging: null}));\n    }\n  }\n  function move(event) {\n    if (!event.which) { return finish(event) }\n    var pluginState = key$1.getState(view.state);\n    var 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, ref) {\n  var colspan = ref.colspan;\n  var colwidth = ref.colwidth;\n\n  var width = colwidth && colwidth[colwidth.length - 1];\n  if (width) { return width }\n  var dom = view.domAtPos(cellPos);\n  var node = dom.node.childNodes[dom.offset];\n  var domWidth = node.offsetWidth, parts = colspan;\n  if (colwidth) { for (var 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  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});\n  var pos = ref.pos;\n  var $cell = cellAround(view.state.doc.resolve(pos));\n  if (!$cell) { return -1 }\n  if (side == \"right\") { return $cell.pos }\n  var map = TableMap.get($cell.node(-1)), start = $cell.start(-1);\n  var 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  var 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$1, {setHandle: value}));\n}\n\nfunction updateColumnWidth(view, cell, width) {\n  var $cell = view.state.doc.resolve(cell);\n  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);\n  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;\n  var tr = view.state.tr;\n  for (var row = 0; row < map.height; row++) {\n    var 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    var pos = map.map[mapIndex];\n    var ref = table.nodeAt(pos);\n    var attrs = ref.attrs;\n    var index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);\n    if (attrs.colwidth && attrs.colwidth[index] == width) { continue }\n    var 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  var $cell = view.state.doc.resolve(cell);\n  var table = $cell.node(-1), start = $cell.start(-1);\n  var col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;\n  var 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  var result = [];\n  for (var i = 0; i < n; i++) { result.push(0); }\n  return result\n}\n\nfunction handleDecorations(state, cell) {\n  var decorations = [];\n  var $cell = state.doc.resolve(cell);\n  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);\n  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;\n  for (var row = 0; row < map.height; row++) {\n    var 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      var cellPos = map.map[index];\n      var pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;\n      var dom = document.createElement(\"div\");\n      dom.className = \"column-resize-handle\";\n      decorations.push(prosemirrorView.Decoration.widget(pos, dom));\n    }\n  }\n  return prosemirrorView.DecorationSet.create(state.doc, decorations)\n}\n\n// This file defines a plugin that handles the drawing of cell\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.\nfunction tableEditing(ref) {\n  if ( ref === void 0 ) ref = {};\n  var allowTableNodeSelection = ref.allowTableNodeSelection; if ( allowTableNodeSelection === void 0 ) allowTableNodeSelection = false;\n\n  return new prosemirrorState.Plugin({\n    key: key,\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: function init() { return null },\n      apply: function apply(tr, cur) {\n        var set = tr.getMeta(key);\n        if (set != null) { return set == -1 ? null : set }\n        if (cur == null || !tr.docChanged) { return cur }\n        var ref = tr.mapping.mapResult(cur);\n        var deleted = ref.deleted;\n        var pos = ref.pos;\n        return deleted ? null : pos\n      }\n    },\n\n    props: {\n      decorations: drawCellSelection,\n\n      handleDOMEvents: {\n        mousedown: handleMouseDown\n      },\n\n      createSelectionBetween: function createSelectionBetween(view) {\n        if (key.getState(view.state) != null) { return view.state.selection }\n      },\n\n      handleTripleClick: handleTripleClick,\n\n      handleKeyDown: handleKeyDown,\n\n      handlePaste: handlePaste\n    },\n\n    appendTransaction: function appendTransaction(_, oldState, state) {\n      return normalizeSelection(state, fixTables(state, oldState), allowTableNodeSelection)\n    }\n  })\n}\n\nexports.tableEditing = tableEditing;\nexports.fixTables = fixTables;\nexports.handlePaste = handlePaste;\nexports.fixTablesKey = fixTablesKey;\nexports.tableEditingKey = key;\nexports.cellAround = cellAround;\nexports.isInTable = isInTable;\nexports.selectionCell = selectionCell;\nexports.moveCellForward = moveCellForward;\nexports.inSameTable = inSameTable;\nexports.findCell = findCell;\nexports.colCount = colCount;\nexports.nextCell = nextCell;\nexports.tableNodes = tableNodes;\nexports.CellSelection = CellSelection;\nexports.TableMap = TableMap;\nexports.columnResizing = columnResizing;\nexports.columnResizingPluginKey = key$1;\nexports.updateColumnsOnResize = updateColumns;\nexports.__pastedCells = pastedCells;\nexports.__insertCells = insertCells;\nexports.__clipCells = clipCells;\nexports.addColumn = addColumn;\nexports.addColumnBefore = addColumnBefore;\nexports.addColumnAfter = addColumnAfter;\nexports.removeColumn = removeColumn;\nexports.deleteColumn = deleteColumn;\nexports.addRow = addRow;\nexports.addRowBefore = addRowBefore;\nexports.addRowAfter = addRowAfter;\nexports.removeRow = removeRow;\nexports.deleteRow = deleteRow;\nexports.mergeCells = mergeCells;\nexports.splitCell = splitCell;\nexports.splitCellWithType = splitCellWithType;\nexports.setCellAttr = setCellAttr;\nexports.toggleHeader = toggleHeader;\nexports.toggleHeaderRow = toggleHeaderRow;\nexports.toggleHeaderColumn = toggleHeaderColumn;\nexports.toggleHeaderCell = toggleHeaderCell;\nexports.goToNextCell = goToNextCell;\nexports.deleteTable = deleteTable;\n//# sourceMappingURL=index.js.map\n"],"sourceRoot":""}