{"version":3,"sources":["webpack:///./node_modules/prosemirror-model/dist/index.js","webpack:///./node_modules/prosemirror-state/dist/index.js","webpack:///./node_modules/prosemirror-schema-list/dist/index.js","webpack:///./node_modules/prosemirror-transform/dist/index.js","webpack:///./node_modules/prosemirror-keymap/dist/index.js"],"names":["findDiffStart","a","b","pos","i","childCount","childA","child","childB","sameMarkup","isText","text","j","content","size","inner","nodeSize","findDiffEnd","posA","posB","iA","iB","same","minSize","Math","min","length","Fragment","this","from","to","f","nodeStart","parent","end","start","nodesBetween","max","blockSeparator","leafText","separated","node","slice","isLeaf","type","spec","isBlock","other","last","lastChild","first","firstChild","withText","push","result","cut","empty","index","current","copy","concat","eq","found","RangeError","p","otherPos","round","retIndex","curPos","cur","toStringInner","join","map","n","toJSON","schema","value","Array","isArray","nodeFromJSON","array","joined","nodes","fromArray","attrs","offset","compareDeep","Mark","set","placed","excludes","rank","obj","name","_","json","marks","create","none","sort","ReplaceError","Error","Slice","openStart","openEnd","fragment","insertInto","removeRange","fromJSON","openIsolating","isolating","findIndex","maybeChild","indexTo","offsetTo","append","replaceChild","dist","insert","canReplace","replace","$from","$to","depth","replaceOuter","prepareSliceForReplace","close","replaceThreeWay","parentOffset","replaceTwoWay","checkJoin","main","sub","compatibleContent","joinable","$before","$after","addNode","target","addRange","$start","$end","startIndex","endIndex","textOffset","nodeAfter","nodeBefore","validContent","$along","extra","resolveNoCache","ResolvedPos","path","val","resolveDepth","dOff","tmp","inclusive","isInSet","removeFromSet","after","isInline","next","pred","blockRange","d","inlineContent","NodeRange","str","doc","rem","resolveCache","cached","resolveCachePos","resolve","resolveCacheSize","before","indexAfter","emptyAttrs","Object","Node","forEach","startPos","textBetween","hasMarkup","defaultAttrs","sameSet","includeParents","sharedDepth","resolveCached","isTextblock","isAtom","toDebugString","wrapMarks","match","contentMatch","matchFragment","replacement","one","contentMatchAt","two","validEnd","allowsMarks","matchType","toString","addToSet","m","check","markFromJSON","nodeType","prototype","undefined","TextNode","super","JSON","stringify","base","ContentMatch","wrapCache","string","nodeTypes","stream","TokenStream","expr","parseExpr","err","dfa","nfa","checkForDeadEnds","frag","hasRequiredAttrs","toEnd","seen","search","types","finished","tp","createAndFill","indexOf","computed","computeWrapping","active","via","shift","reverse","scan","out","inline","tokens","split","pop","tok","SyntaxError","exprs","parseExprSeq","eat","parseExprSubscript","parseExprAtom","parseExprRange","parseNum","test","Number","resolveName","typeName","groups","connect","compile","edge","term","edges","reduce","loop","cmp","nullFrom","labeled","explore","states","state","work","dead","defaults","attrName","attr","hasDefault","default","computeAttrs","built","given","initAttrs","Attribute","NodeType","markSet","group","atom","whitespace","code","isRequired","compatible","setFrom","fillBefore","matched","markType","allowsMarkType","topType","topNode","options","hasOwnProperty","call","MarkType","excluded","instance","Schema","contentExprCache","prop","contentExpr","markExpr","parse","gatherMarks","excl","bind","topNodeType","wrappings","createChecked","mark","ok","DOMParser","rules","tags","styles","rule","tag","style","normalizeLists","some","r","dom","context","ParseContext","addAll","finish","maxOpen","matches","namespace","namespaceURI","matchesContext","getAttrs","charCodeAt","priority","nextPriority","splice","parseDOM","domParser","schemaRules","blockTags","address","article","aside","blockquote","canvas","dd","div","dl","fieldset","figcaption","figure","footer","form","h1","h2","h3","h4","h5","h6","header","hgroup","hr","li","noscript","ol","output","pre","section","table","tfoot","ul","ignoreTags","head","object","script","title","listTags","OPT_PRESERVE_WS","OPT_PRESERVE_WS_FULL","OPT_OPEN_LEFT","wsOptionsFor","preserveWhitespace","NodeContext","pendingMarks","solid","activeMarks","stashMarks","fill","wrap","findWrapping","exec","nextType","pending","markMayApply","parentNode","nodeName","toLowerCase","parser","isOpen","open","topContext","topOptions","topMatch","find","findPositions","needsBlock","addTextNode","getAttribute","readStyles","parseStyles","top","addPendingMark","addElement","removePendingMark","nodeValue","inlineContext","domNodeBefore","previousSibling","insertNode","findInText","findInside","matchAfter","ruleID","normalizeList","ruleFromNode","matchTag","ignore","ignoreFallback","skip","closeParent","sync","oldNeedsBlock","leafFallback","addElementByRule","consuming","ownerDocument","createTextNode","findPlace","matchStyle","continueAfter","enter","startIn","getContent","contentDOM","contentElement","querySelector","findAround","childNodes","nextSibling","findAtPoint","addDOM","route","cx","enterInner","block","textblockFromContext","closeExtra","applyPending","preserveWS","topOpen","currentPos","contains","compareDocumentPosition","textNode","parts","option","useRoot","minDepth","part","$context","deflt","defaultType","findSameMarkInSet","upto","level","lastIndexOf","stashMark","popFromStashMark","prevItem","appendChild","selector","msMatchesSelector","webkitMatchesSelector","mozMatchesSelector","re","trim","edgeCount","DOMSerializer","createDocumentFragment","keep","rendered","spanning","add","markDOM","serializeMark","serializeNodeInner","renderSpec","serializeFragment","toDOM","structure","xmlNS","tagName","space","createElementNS","createElement","setAttributeNS","setAttribute","innerContent","domSerializer","nodesFromSchema","marksFromSchema","gatherToDOM","document","window","classesById","Selection","$anchor","$head","ranges","SelectionRange","tr","lastNode","lastParent","mapFrom","steps","mapping","replaceRange","selectionToInsertionEnd","deleteRange","replaceRangeWith","$pos","dir","textOnly","TextSelection","findSelectionIn","bias","findFrom","AllSelection","cls","id","selectionClass","jsonID","between","getBookmark","visible","warnedAboutTextSelection","checkTextSelection","console","near","anchor","marksAcross","ensureMarks","TextBookmark","dPos","NodeSelection","deleted","mapResult","NodeBookmark","selectable","isSelectable","delete","sel","atStart","selection","setSelection","AllBookmark","startLen","step","maps","_from","_to","_newFrom","newTo","UPDATED_SEL","UPDATED_MARKS","UPDATED_SCROLL","Transaction","curSelectionFor","updated","meta","time","Date","now","curSelection","storedMarks","setStoredMarks","addStep","inheritMarks","replaceWith","replaceSelectionWith","deleteSelection","key","self","FieldDesc","desc","init","apply","baseFields","config","_marks","_old","$cursor","prev","scrolledIntoView","Configuration","plugins","pluginsByKey","fields","plugin","EditorState","applyTransaction","filterTransaction","rootTr","transactions","trs","newState","applyInner","haveNew","appendTransaction","oldState","setMeta","newInstance","field","$config","pluginFields","bindProps","Function","Plugin","props","createKey","keys","PluginKey","wrapInList","listType","dispatch","range","doJoin","outerRange","$insert","doWrapInList","scrollIntoView","wrappers","joinBefore","splitDepth","splitPos","e","liftListItem","itemType","liftToOuterList","liftOutOfList","endOfList","lift","list","item","atEnd","indexBefore","sinkListItem","nestedBefore","lower16","factor16","pow","makeRecover","recoverIndex","recoverOffset","DEL_BEFORE","DEL_AFTER","DEL_ACROSS","DEL_SIDE","MapResult","delInfo","recover","StepMap","inverted","diff","assoc","_map","simple","oldIndex","newIndex","oldSize","newSize","side","del","oldStart","newStart","Mapping","mirror","mirrors","setMirror","startSize","mirr","getMirror","appendMap","totalSize","invert","inverse","appendMappingInverted","corr","stepsByID","Step","stepType","stepClass","StepResult","failed","message","fail","mapFragment","mapped","AddMarkStep","oldSlice","fromReplace","RemoveMarkStep","AddNodeMarkStep","nodeAt","newSet","RemoveNodeMarkStep","deletedAfter","ReplaceStep","contentBetween","deletedAcross","ReplaceAroundStep","gapFrom","gapTo","gap","inserted","insertAt","removeBetween","addMark","removing","adding","removed","added","s","removeMark","toRemove","clearIncompatible","parentType","delSteps","allowed","canCut","liftTarget","cutByIndex","gapStart","gapEnd","splitting","innerRange","around","findWrappingOutside","findWrappingInside","withAttrs","outer","canReplaceWith","inside","lastType","innerMatch","setBlockType","canChangeType","startM","endM","setNodeMarkup","newNode","canSplit","typesAfter","innerType","rest","baseType","typeAfter","canJoin","canAppend","joinPoint","insertPoint","dropPoint","pass","insertPos","fits","wrapping","replaceStep","fitsTrivially","Fitter","fit","unplaced","frontier","findFittable","placeNodes","openMore","dropNode","moveInline","mustMoveInline","placedSize","sliceDepth","contentAt","frontierDepth","inject","openAtEnd","dropFromFragment","closeFrontierNode","openFrontierNode","taken","openEndCount","closeNodeStart","allowedMarks","addToFragment","contentAfterFits","findCloseLevel","dropInner","move","count","invalidMarks","definesContent","defining","definingForContent","targetDepths","coveredDepths","preferredTarget","unshift","definingAsContext","preferredTargetIndex","leftNodes","preferredDepth","def","openDepth","targetDepth","expand","closeFragment","startSteps","oldOpen","newOpen","point","covered","AttrStep","TransformError","__proto__","constructor","Transform","docs","maybeStep","getMap","mac","navigator","platform","normalizeKeyName","alt","ctrl","mod","normalize","modifiers","event","altKey","ctrlKey","metaKey","shiftKey","keymap","bindings","handleKeyDown","keydownHandler","view","baseName","isChar","direct","keyCode","fromCode","withShift"],"mappings":"2LAAA,uWAEA,SAASA,EAAcC,EAAGC,EAAGC,GACzB,IAAK,IAAIC,EAAI,GAAIA,IAAK,CAClB,GAAIA,GAAKH,EAAEI,YAAcD,GAAKF,EAAEG,WAC5B,OAAOJ,EAAEI,YAAcH,EAAEG,WAAa,KAAOF,EACjD,IAAIG,EAASL,EAAEM,MAAMH,GAAII,EAASN,EAAEK,MAAMH,GAC1C,GAAIE,GAAUE,EAAd,CAIA,IAAKF,EAAOG,WAAWD,GACnB,OAAOL,EACX,GAAIG,EAAOI,QAAUJ,EAAOK,MAAQH,EAAOG,KAAM,CAC7C,IAAK,IAAIC,EAAI,EAAGN,EAAOK,KAAKC,IAAMJ,EAAOG,KAAKC,GAAIA,IAC9CT,IACJ,OAAOA,EAEX,GAAIG,EAAOO,QAAQC,MAAQN,EAAOK,QAAQC,KAAM,CAC5C,IAAIC,EAAQf,EAAcM,EAAOO,QAASL,EAAOK,QAASV,EAAM,GAChE,GAAa,MAATY,EACA,OAAOA,EAEfZ,GAAOG,EAAOU,cAfVb,GAAOG,EAAOU,UAkB1B,SAASC,EAAYhB,EAAGC,EAAGgB,EAAMC,GAC7B,IAAK,IAAIC,EAAKnB,EAAEI,WAAYgB,EAAKnB,EAAEG,aAAc,CAC7C,GAAU,GAANe,GAAiB,GAANC,EACX,OAAOD,GAAMC,EAAK,KAAO,CAAEpB,EAAGiB,EAAMhB,EAAGiB,GAC3C,IAAIb,EAASL,EAAEM,QAAQa,GAAKZ,EAASN,EAAEK,QAAQc,GAAKP,EAAOR,EAAOU,SAClE,GAAIV,GAAUE,EAAd,CAKA,IAAKF,EAAOG,WAAWD,GACnB,MAAO,CAAEP,EAAGiB,EAAMhB,EAAGiB,GACzB,GAAIb,EAAOI,QAAUJ,EAAOK,MAAQH,EAAOG,KAAM,CAC7C,IAAIW,EAAO,EAAGC,EAAUC,KAAKC,IAAInB,EAAOK,KAAKe,OAAQlB,EAAOG,KAAKe,QACjE,MAAOJ,EAAOC,GAAWjB,EAAOK,KAAKL,EAAOK,KAAKe,OAASJ,EAAO,IAAMd,EAAOG,KAAKH,EAAOG,KAAKe,OAASJ,EAAO,GAC3GA,IACAJ,IACAC,IAEJ,MAAO,CAAElB,EAAGiB,EAAMhB,EAAGiB,GAEzB,GAAIb,EAAOO,QAAQC,MAAQN,EAAOK,QAAQC,KAAM,CAC5C,IAAIC,EAAQE,EAAYX,EAAOO,QAASL,EAAOK,QAASK,EAAO,EAAGC,EAAO,GACzE,GAAIJ,EACA,OAAOA,EAEfG,GAAQJ,EACRK,GAAQL,OArBJI,GAAQJ,EACRK,GAAQL,GA+BpB,MAAMa,EAIF,YAIAd,EAASC,GAGL,GAFAc,KAAKf,QAAUA,EACfe,KAAKd,KAAOA,GAAQ,EACR,MAARA,EACA,IAAK,IAAIV,EAAI,EAAGA,EAAIS,EAAQa,OAAQtB,IAChCwB,KAAKd,MAAQD,EAAQT,GAAGY,SAOpC,aAAaa,EAAMC,EAAIC,EAAGC,EAAY,EAAGC,GACrC,IAAK,IAAI7B,EAAI,EAAGD,EAAM,EAAGA,EAAM2B,EAAI1B,IAAK,CACpC,IAAIG,EAAQqB,KAAKf,QAAQT,GAAI8B,EAAM/B,EAAMI,EAAMS,SAC/C,GAAIkB,EAAML,IAAyD,IAAjDE,EAAExB,EAAOyB,EAAY7B,EAAK8B,GAAU,KAAM7B,IAAgBG,EAAMM,QAAQC,KAAM,CAC5F,IAAIqB,EAAQhC,EAAM,EAClBI,EAAM6B,aAAaZ,KAAKa,IAAI,EAAGR,EAAOM,GAAQX,KAAKC,IAAIlB,EAAMM,QAAQC,KAAMgB,EAAKK,GAAQJ,EAAGC,EAAYG,GAE3GhC,EAAM+B,GAQd,YAAYH,GACRH,KAAKQ,aAAa,EAAGR,KAAKd,KAAMiB,GAMpC,YAAYF,EAAMC,EAAIQ,EAAgBC,GAClC,IAAI5B,EAAO,GAAI6B,GAAY,EAoB3B,OAnBAZ,KAAKQ,aAAaP,EAAMC,EAAI,CAACW,EAAMtC,KAC3BsC,EAAK/B,QACLC,GAAQ8B,EAAK9B,KAAK+B,MAAMlB,KAAKa,IAAIR,EAAM1B,GAAOA,EAAK2B,EAAK3B,GACxDqC,GAAaF,GAERG,EAAKE,QACNJ,EACA5B,GAA4B,oBAAb4B,EAA0BA,EAASE,GAAQF,EAErDE,EAAKG,KAAKC,KAAKN,WACpB5B,GAAQ8B,EAAKG,KAAKC,KAAKN,SAASE,IAEpCD,GAAaF,IAEPE,GAAaC,EAAKK,UACxBnC,GAAQ2B,EACRE,GAAY,IAEjB,GACI7B,EAMX,OAAOoC,GACH,IAAKA,EAAMjC,KACP,OAAOc,KACX,IAAKA,KAAKd,KACN,OAAOiC,EACX,IAAIC,EAAOpB,KAAKqB,UAAWC,EAAQH,EAAMI,WAAYtC,EAAUe,KAAKf,QAAQ6B,QAAStC,EAAI,EAKzF,IAJI4C,EAAKtC,QAAUsC,EAAKvC,WAAWyC,KAC/BrC,EAAQA,EAAQa,OAAS,GAAKsB,EAAKI,SAASJ,EAAKrC,KAAOuC,EAAMvC,MAC9DP,EAAI,GAEDA,EAAI2C,EAAMlC,QAAQa,OAAQtB,IAC7BS,EAAQwC,KAAKN,EAAMlC,QAAQT,IAC/B,OAAO,IAAIuB,EAASd,EAASe,KAAKd,KAAOiC,EAAMjC,MAKnD,IAAIe,EAAMC,EAAKF,KAAKd,MAChB,GAAY,GAARe,GAAaC,GAAMF,KAAKd,KACxB,OAAOc,KACX,IAAI0B,EAAS,GAAIxC,EAAO,EACxB,GAAIgB,EAAKD,EACL,IAAK,IAAIzB,EAAI,EAAGD,EAAM,EAAGA,EAAM2B,EAAI1B,IAAK,CACpC,IAAIG,EAAQqB,KAAKf,QAAQT,GAAI8B,EAAM/B,EAAMI,EAAMS,SAC3CkB,EAAML,KACF1B,EAAM0B,GAAQK,EAAMJ,KAEhBvB,EADAA,EAAMG,OACEH,EAAMgD,IAAI/B,KAAKa,IAAI,EAAGR,EAAO1B,GAAMqB,KAAKC,IAAIlB,EAAMI,KAAKe,OAAQI,EAAK3B,IAEpEI,EAAMgD,IAAI/B,KAAKa,IAAI,EAAGR,EAAO1B,EAAM,GAAIqB,KAAKC,IAAIlB,EAAMM,QAAQC,KAAMgB,EAAK3B,EAAM,KAE/FmD,EAAOD,KAAK9C,GACZO,GAAQP,EAAMS,UAElBb,EAAM+B,EAEd,OAAO,IAAIP,EAAS2B,EAAQxC,GAKhC,WAAWe,EAAMC,GACb,OAAID,GAAQC,EACDH,EAAS6B,MACR,GAAR3B,GAAaC,GAAMF,KAAKf,QAAQa,OACzBE,KACJ,IAAID,EAASC,KAAKf,QAAQ6B,MAAMb,EAAMC,IAMjD,aAAa2B,EAAOhB,GAChB,IAAIiB,EAAU9B,KAAKf,QAAQ4C,GAC3B,GAAIC,GAAWjB,EACX,OAAOb,KACX,IAAI+B,EAAO/B,KAAKf,QAAQ6B,QACpB5B,EAAOc,KAAKd,KAAO2B,EAAKzB,SAAW0C,EAAQ1C,SAE/C,OADA2C,EAAKF,GAAShB,EACP,IAAId,EAASgC,EAAM7C,GAM9B,WAAW2B,GACP,OAAO,IAAId,EAAS,CAACc,GAAMmB,OAAOhC,KAAKf,SAAUe,KAAKd,KAAO2B,EAAKzB,UAMtE,SAASyB,GACL,OAAO,IAAId,EAASC,KAAKf,QAAQ+C,OAAOnB,GAAOb,KAAKd,KAAO2B,EAAKzB,UAKpE,GAAG+B,GACC,GAAInB,KAAKf,QAAQa,QAAUqB,EAAMlC,QAAQa,OACrC,OAAO,EACX,IAAK,IAAItB,EAAI,EAAGA,EAAIwB,KAAKf,QAAQa,OAAQtB,IACrC,IAAKwB,KAAKf,QAAQT,GAAGyD,GAAGd,EAAMlC,QAAQT,IAClC,OAAO,EACf,OAAO,EAKX,iBAAmB,OAAOwB,KAAKf,QAAQa,OAASE,KAAKf,QAAQ,GAAK,KAIlE,gBAAkB,OAAOe,KAAKf,QAAQa,OAASE,KAAKf,QAAQe,KAAKf,QAAQa,OAAS,GAAK,KAIvF,iBAAmB,OAAOE,KAAKf,QAAQa,OAKvC,MAAM+B,GACF,IAAIK,EAAQlC,KAAKf,QAAQ4C,GACzB,IAAKK,EACD,MAAM,IAAIC,WAAW,SAAWN,EAAQ,qBAAuB7B,MACnE,OAAOkC,EAKX,WAAWL,GACP,OAAO7B,KAAKf,QAAQ4C,IAAU,KAMlC,QAAQ1B,GACJ,IAAK,IAAI3B,EAAI,EAAG4D,EAAI,EAAG5D,EAAIwB,KAAKf,QAAQa,OAAQtB,IAAK,CACjD,IAAIG,EAAQqB,KAAKf,QAAQT,GACzB2B,EAAExB,EAAOyD,EAAG5D,GACZ4D,GAAKzD,EAAMS,UAOnB,cAAc+B,EAAO5C,EAAM,GACvB,OAAOH,EAAc4B,KAAMmB,EAAO5C,GAQtC,YAAY4C,EAAO5C,EAAMyB,KAAKd,KAAMmD,EAAWlB,EAAMjC,MACjD,OAAOG,EAAYW,KAAMmB,EAAO5C,EAAK8D,GAOzC,UAAU9D,EAAK+D,GAAQ,GACnB,GAAW,GAAP/D,EACA,OAAOgE,EAAS,EAAGhE,GACvB,GAAIA,GAAOyB,KAAKd,KACZ,OAAOqD,EAASvC,KAAKf,QAAQa,OAAQvB,GACzC,GAAIA,EAAMyB,KAAKd,MAAQX,EAAM,EACzB,MAAM,IAAI4D,WAAW,YAAY5D,0BAA4ByB,SACjE,IAAK,IAAIxB,EAAI,EAAGgE,EAAS,GAAIhE,IAAK,CAC9B,IAAIiE,EAAMzC,KAAKrB,MAAMH,GAAI8B,EAAMkC,EAASC,EAAIrD,SAC5C,GAAIkB,GAAO/B,EACP,OAAI+B,GAAO/B,GAAO+D,EAAQ,EACfC,EAAS/D,EAAI,EAAG8B,GACpBiC,EAAS/D,EAAGgE,GAEvBA,EAASlC,GAMjB,WAAa,MAAO,IAAMN,KAAK0C,gBAAkB,IAIjD,gBAAkB,OAAO1C,KAAKf,QAAQ0D,KAAK,MAI3C,SACI,OAAO3C,KAAKf,QAAQa,OAASE,KAAKf,QAAQ2D,IAAIC,GAAKA,EAAEC,UAAY,KAKrE,gBAAgBC,EAAQC,GACpB,IAAKA,EACD,OAAOjD,EAAS6B,MACpB,IAAKqB,MAAMC,QAAQF,GACf,MAAM,IAAIb,WAAW,uCACzB,OAAO,IAAIpC,EAASiD,EAAMJ,IAAIG,EAAOI,eAMzC,iBAAiBC,GACb,IAAKA,EAAMtD,OACP,OAAOC,EAAS6B,MACpB,IAAIyB,EAAQnE,EAAO,EACnB,IAAK,IAAIV,EAAI,EAAGA,EAAI4E,EAAMtD,OAAQtB,IAAK,CACnC,IAAIqC,EAAOuC,EAAM5E,GACjBU,GAAQ2B,EAAKzB,SACTZ,GAAKqC,EAAK/B,QAAUsE,EAAM5E,EAAI,GAAGK,WAAWgC,IACvCwC,IACDA,EAASD,EAAMtC,MAAM,EAAGtC,IAC5B6E,EAAOA,EAAOvD,OAAS,GAAKe,EACvBW,SAAS6B,EAAOA,EAAOvD,OAAS,GAAGf,KAAO8B,EAAK9B,OAE/CsE,GACLA,EAAO5B,KAAKZ,GAGpB,OAAO,IAAId,EAASsD,GAAUD,EAAOlE,GAQzC,YAAYoE,GACR,IAAKA,EACD,OAAOvD,EAAS6B,MACpB,GAAI0B,aAAiBvD,EACjB,OAAOuD,EACX,GAAIL,MAAMC,QAAQI,GACd,OAAOtD,KAAKuD,UAAUD,GAC1B,GAAIA,EAAME,MACN,OAAO,IAAIzD,EAAS,CAACuD,GAAQA,EAAMlE,UACvC,MAAM,IAAI+C,WAAW,mBAAqBmB,EAAQ,kBAC7CA,EAAM9C,aAAe,mEAAqE,MAQvGT,EAAS6B,MAAQ,IAAI7B,EAAS,GAAI,GAClC,MAAMmC,EAAQ,CAAEL,MAAO,EAAG4B,OAAQ,GAClC,SAASlB,EAASV,EAAO4B,GAGrB,OAFAvB,EAAML,MAAQA,EACdK,EAAMuB,OAASA,EACRvB,EAGX,SAASwB,EAAYrF,EAAGC,GACpB,GAAID,IAAMC,EACN,OAAO,EACX,IAAMD,GAAiB,iBAALA,IACZC,GAAiB,iBAALA,EACd,OAAO,EACX,IAAI8E,EAAQH,MAAMC,QAAQ7E,GAC1B,GAAI4E,MAAMC,QAAQ5E,IAAM8E,EACpB,OAAO,EACX,GAAIA,EAAO,CACP,GAAI/E,EAAEyB,QAAUxB,EAAEwB,OACd,OAAO,EACX,IAAK,IAAItB,EAAI,EAAGA,EAAIH,EAAEyB,OAAQtB,IAC1B,IAAKkF,EAAYrF,EAAEG,GAAIF,EAAEE,IACrB,OAAO,MAEd,CACD,IAAK,IAAI4D,KAAK/D,EACV,KAAM+D,KAAK9D,KAAOoF,EAAYrF,EAAE+D,GAAI9D,EAAE8D,IAClC,OAAO,EACf,IAAK,IAAIA,KAAK9D,EACV,KAAM8D,KAAK/D,GACP,OAAO,EAEnB,OAAO,EAWX,MAAMsF,EAIF,YAIA3C,EAIAwC,GACIxD,KAAKgB,KAAOA,EACZhB,KAAKwD,MAAQA,EASjB,SAASI,GACL,IAAI7B,EAAM8B,GAAS,EACnB,IAAK,IAAIrF,EAAI,EAAGA,EAAIoF,EAAI9D,OAAQtB,IAAK,CACjC,IAAI2C,EAAQyC,EAAIpF,GAChB,GAAIwB,KAAKiC,GAAGd,GACR,OAAOyC,EACX,GAAI5D,KAAKgB,KAAK8C,SAAS3C,EAAMH,MACpBe,IACDA,EAAO6B,EAAI9C,MAAM,EAAGtC,QAEvB,IAAI2C,EAAMH,KAAK8C,SAAS9D,KAAKgB,MAC9B,OAAO4C,GAGFC,GAAU1C,EAAMH,KAAK+C,KAAO/D,KAAKgB,KAAK+C,OAClChC,IACDA,EAAO6B,EAAI9C,MAAM,EAAGtC,IACxBuD,EAAKN,KAAKzB,MACV6D,GAAS,GAET9B,GACAA,EAAKN,KAAKN,IAOtB,OAJKY,IACDA,EAAO6B,EAAI9C,SACV+C,GACD9B,EAAKN,KAAKzB,MACP+B,EAMX,cAAc6B,GACV,IAAK,IAAIpF,EAAI,EAAGA,EAAIoF,EAAI9D,OAAQtB,IAC5B,GAAIwB,KAAKiC,GAAG2B,EAAIpF,IACZ,OAAOoF,EAAI9C,MAAM,EAAGtC,GAAGwD,OAAO4B,EAAI9C,MAAMtC,EAAI,IACpD,OAAOoF,EAKX,QAAQA,GACJ,IAAK,IAAIpF,EAAI,EAAGA,EAAIoF,EAAI9D,OAAQtB,IAC5B,GAAIwB,KAAKiC,GAAG2B,EAAIpF,IACZ,OAAO,EACf,OAAO,EAMX,GAAG2C,GACC,OAAOnB,MAAQmB,GACVnB,KAAKgB,MAAQG,EAAMH,MAAQ0C,EAAY1D,KAAKwD,MAAOrC,EAAMqC,OAKlE,SACI,IAAIQ,EAAM,CAAEhD,KAAMhB,KAAKgB,KAAKiD,MAC5B,IAAK,IAAIC,KAAKlE,KAAKwD,MAAO,CACtBQ,EAAIR,MAAQxD,KAAKwD,MACjB,MAEJ,OAAOQ,EAKX,gBAAgBjB,EAAQoB,GACpB,IAAKA,EACD,MAAM,IAAIhC,WAAW,mCACzB,IAAInB,EAAO+B,EAAOqB,MAAMD,EAAKnD,MAC7B,IAAKA,EACD,MAAM,IAAImB,WAAW,yBAAyBgC,EAAKnD,uBACvD,OAAOA,EAAKqD,OAAOF,EAAKX,OAK5B,eAAenF,EAAGC,GACd,GAAID,GAAKC,EACL,OAAO,EACX,GAAID,EAAEyB,QAAUxB,EAAEwB,OACd,OAAO,EACX,IAAK,IAAItB,EAAI,EAAGA,EAAIH,EAAEyB,OAAQtB,IAC1B,IAAKH,EAAEG,GAAGyD,GAAG3D,EAAEE,IACX,OAAO,EACf,OAAO,EAMX,eAAe4F,GACX,IAAKA,GAASnB,MAAMC,QAAQkB,IAA0B,GAAhBA,EAAMtE,OACxC,OAAO6D,EAAKW,KAChB,GAAIF,aAAiBT,EACjB,MAAO,CAACS,GACZ,IAAIrC,EAAOqC,EAAMtD,QAEjB,OADAiB,EAAKwC,KAAK,CAAClG,EAAGC,IAAMD,EAAE2C,KAAK+C,KAAOzF,EAAE0C,KAAK+C,MAClChC,GAMf4B,EAAKW,KAAO,GAMZ,MAAME,UAAqBC,OAkB3B,MAAMC,EAaF,YAIAzF,EAIA0F,EAIAC,GACI5E,KAAKf,QAAUA,EACfe,KAAK2E,UAAYA,EACjB3E,KAAK4E,QAAUA,EAKnB,WACI,OAAO5E,KAAKf,QAAQC,KAAOc,KAAK2E,UAAY3E,KAAK4E,QAKrD,SAASrG,EAAKsG,GACV,IAAI5F,EAAU6F,EAAW9E,KAAKf,QAASV,EAAMyB,KAAK2E,UAAWE,GAC7D,OAAO5F,GAAW,IAAIyF,EAAMzF,EAASe,KAAK2E,UAAW3E,KAAK4E,SAK9D,cAAc3E,EAAMC,GAChB,OAAO,IAAIwE,EAAMK,EAAY/E,KAAKf,QAASgB,EAAOD,KAAK2E,UAAWzE,EAAKF,KAAK2E,WAAY3E,KAAK2E,UAAW3E,KAAK4E,SAKjH,GAAGzD,GACC,OAAOnB,KAAKf,QAAQgD,GAAGd,EAAMlC,UAAYe,KAAK2E,WAAaxD,EAAMwD,WAAa3E,KAAK4E,SAAWzD,EAAMyD,QAKxG,WACI,OAAO5E,KAAKf,QAAU,IAAMe,KAAK2E,UAAY,IAAM3E,KAAK4E,QAAU,IAKtE,SACI,IAAK5E,KAAKf,QAAQC,KACd,OAAO,KACX,IAAIiF,EAAO,CAAElF,QAASe,KAAKf,QAAQ6D,UAKnC,OAJI9C,KAAK2E,UAAY,IACjBR,EAAKQ,UAAY3E,KAAK2E,WACtB3E,KAAK4E,QAAU,IACfT,EAAKS,QAAU5E,KAAK4E,SACjBT,EAKX,gBAAgBpB,EAAQoB,GACpB,IAAKA,EACD,OAAOO,EAAM9C,MACjB,IAAI+C,EAAYR,EAAKQ,WAAa,EAAGC,EAAUT,EAAKS,SAAW,EAC/D,GAAwB,iBAAbD,GAA2C,iBAAXC,EACvC,MAAM,IAAIzC,WAAW,oCACzB,OAAO,IAAIuC,EAAM3E,EAASiF,SAASjC,EAAQoB,EAAKlF,SAAU0F,EAAWC,GAMzE,eAAeC,EAAUI,GAAgB,GACrC,IAAIN,EAAY,EAAGC,EAAU,EAC7B,IAAK,IAAI/B,EAAIgC,EAAStD,WAAYsB,IAAMA,EAAE9B,SAAWkE,IAAkBpC,EAAE7B,KAAKC,KAAKiE,WAAYrC,EAAIA,EAAEtB,WACjGoD,IACJ,IAAK,IAAI9B,EAAIgC,EAASxD,UAAWwB,IAAMA,EAAE9B,SAAWkE,IAAkBpC,EAAE7B,KAAKC,KAAKiE,WAAYrC,EAAIA,EAAExB,UAChGuD,IACJ,OAAO,IAAIF,EAAMG,EAAUF,EAAWC,IAO9C,SAASG,EAAY9F,EAASgB,EAAMC,GAChC,IAAI,MAAE2B,EAAK,OAAE4B,GAAWxE,EAAQkG,UAAUlF,GAAOtB,EAAQM,EAAQmG,WAAWvD,IACtEA,MAAOwD,EAAS5B,OAAQ6B,GAAarG,EAAQkG,UAAUjF,GAC7D,GAAIuD,GAAUxD,GAAQtB,EAAMG,OAAQ,CAChC,GAAIwG,GAAYpF,IAAOjB,EAAQN,MAAM0G,GAASvG,OAC1C,MAAM,IAAIqD,WAAW,2BACzB,OAAOlD,EAAQ0C,IAAI,EAAG1B,GAAMsF,OAAOtG,EAAQ0C,IAAIzB,IAEnD,GAAI2B,GAASwD,EACT,MAAM,IAAIlD,WAAW,2BACzB,OAAOlD,EAAQuG,aAAa3D,EAAOlD,EAAMoD,KAAKgD,EAAYpG,EAAMM,QAASgB,EAAOwD,EAAS,EAAGvD,EAAKuD,EAAS,KAE9G,SAASqB,EAAW7F,EAASwG,EAAMC,EAAQrF,GACvC,IAAI,MAAEwB,EAAK,OAAE4B,GAAWxE,EAAQkG,UAAUM,GAAO9G,EAAQM,EAAQmG,WAAWvD,GAC5E,GAAI4B,GAAUgC,GAAQ9G,EAAMG,OACxB,OAAIuB,IAAWA,EAAOsF,WAAW9D,EAAOA,EAAO6D,GACpC,KACJzG,EAAQ0C,IAAI,EAAG8D,GAAMF,OAAOG,GAAQH,OAAOtG,EAAQ0C,IAAI8D,IAElE,IAAItG,EAAQ2F,EAAWnG,EAAMM,QAASwG,EAAOhC,EAAS,EAAGiC,GACzD,OAAOvG,GAASF,EAAQuG,aAAa3D,EAAOlD,EAAMoD,KAAK5C,IAE3D,SAASyG,EAAQC,EAAOC,EAAKhF,GACzB,GAAIA,EAAM6D,UAAYkB,EAAME,MACxB,MAAM,IAAIvB,EAAa,mDAC3B,GAAIqB,EAAME,MAAQjF,EAAM6D,WAAamB,EAAIC,MAAQjF,EAAM8D,QACnD,MAAM,IAAIJ,EAAa,4BAC3B,OAAOwB,EAAaH,EAAOC,EAAKhF,EAAO,GAE3C,SAASkF,EAAaH,EAAOC,EAAKhF,EAAOiF,GACrC,IAAIlE,EAAQgE,EAAMhE,MAAMkE,GAAQlF,EAAOgF,EAAMhF,KAAKkF,GAClD,GAAIlE,GAASiE,EAAIjE,MAAMkE,IAAUA,EAAQF,EAAME,MAAQjF,EAAM6D,UAAW,CACpE,IAAIxF,EAAQ6G,EAAaH,EAAOC,EAAKhF,EAAOiF,EAAQ,GACpD,OAAOlF,EAAKkB,KAAKlB,EAAK5B,QAAQuG,aAAa3D,EAAO1C,IAEjD,GAAK2B,EAAM7B,QAAQC,KAGnB,IAAK4B,EAAM6D,WAAc7D,EAAM8D,SAAWiB,EAAME,OAASA,GAASD,EAAIC,OAASA,EAI/E,CACD,IAAI,MAAExF,EAAK,IAAED,GAAQ2F,EAAuBnF,EAAO+E,GACnD,OAAOK,EAAMrF,EAAMsF,EAAgBN,EAAOtF,EAAOD,EAAKwF,EAAKC,IAN4B,CACvF,IAAI1F,EAASwF,EAAMxF,OAAQpB,EAAUoB,EAAOpB,QAC5C,OAAOiH,EAAM7F,EAAQpB,EAAQ0C,IAAI,EAAGkE,EAAMO,cAAcb,OAAOzE,EAAM7B,SAASsG,OAAOtG,EAAQ0C,IAAImE,EAAIM,iBAJrG,OAAOF,EAAMrF,EAAMwF,EAAcR,EAAOC,EAAKC,IAWrD,SAASO,EAAUC,EAAMC,GACrB,IAAKA,EAAIxF,KAAKyF,kBAAkBF,EAAKvF,MACjC,MAAM,IAAIwD,EAAa,eAAiBgC,EAAIxF,KAAKiD,KAAO,SAAWsC,EAAKvF,KAAKiD,MAErF,SAASyC,EAASC,EAASC,EAAQb,GAC/B,IAAIlF,EAAO8F,EAAQ9F,KAAKkF,GAExB,OADAO,EAAUzF,EAAM+F,EAAO/F,KAAKkF,IACrBlF,EAEX,SAASgG,EAAQlI,EAAOmI,GACpB,IAAI1F,EAAO0F,EAAOhH,OAAS,EACvBsB,GAAQ,GAAKzC,EAAMG,QAAUH,EAAME,WAAWiI,EAAO1F,IACrD0F,EAAO1F,GAAQzC,EAAM6C,SAASsF,EAAO1F,GAAMrC,KAAOJ,EAAMI,MAExD+H,EAAOrF,KAAK9C,GAEpB,SAASoI,EAASC,EAAQC,EAAMlB,EAAOe,GACnC,IAAIjG,GAAQoG,GAAQD,GAAQnG,KAAKkF,GAC7BmB,EAAa,EAAGC,EAAWF,EAAOA,EAAKpF,MAAMkE,GAASlF,EAAKpC,WAC3DuI,IACAE,EAAaF,EAAOnF,MAAMkE,GACtBiB,EAAOjB,MAAQA,EACfmB,IAEKF,EAAOI,aACZP,EAAQG,EAAOK,UAAWP,GAC1BI,MAGR,IAAK,IAAI1I,EAAI0I,EAAY1I,EAAI2I,EAAU3I,IACnCqI,EAAQhG,EAAKlC,MAAMH,GAAIsI,GACvBG,GAAQA,EAAKlB,OAASA,GAASkB,EAAKG,YACpCP,EAAQI,EAAKK,WAAYR,GAEjC,SAASZ,EAAMrF,EAAM5B,GACjB,IAAK4B,EAAKG,KAAKuG,aAAatI,GACxB,MAAM,IAAIuF,EAAa,4BAA8B3D,EAAKG,KAAKiD,MACnE,OAAOpD,EAAKkB,KAAK9C,GAErB,SAASkH,EAAgBN,EAAOmB,EAAQC,EAAMnB,EAAKC,GAC/C,IAAIpB,EAAYkB,EAAME,MAAQA,GAASW,EAASb,EAAOmB,EAAQjB,EAAQ,GACnEnB,EAAUkB,EAAIC,MAAQA,GAASW,EAASO,EAAMnB,EAAKC,EAAQ,GAC3D9G,EAAU,GAcd,OAbA8H,EAAS,KAAMlB,EAAOE,EAAO9G,GACzB0F,GAAaC,GAAWoC,EAAOnF,MAAMkE,IAAUkB,EAAKpF,MAAMkE,IAC1DO,EAAU3B,EAAWC,GACrBiC,EAAQX,EAAMvB,EAAWwB,EAAgBN,EAAOmB,EAAQC,EAAMnB,EAAKC,EAAQ,IAAK9G,KAG5E0F,GACAkC,EAAQX,EAAMvB,EAAW0B,EAAcR,EAAOmB,EAAQjB,EAAQ,IAAK9G,GACvE8H,EAASC,EAAQC,EAAMlB,EAAO9G,GAC1B2F,GACAiC,EAAQX,EAAMtB,EAASyB,EAAcY,EAAMnB,EAAKC,EAAQ,IAAK9G,IAErE8H,EAASjB,EAAK,KAAMC,EAAO9G,GACpB,IAAIc,EAASd,GAExB,SAASoH,EAAcR,EAAOC,EAAKC,GAC/B,IAAI9G,EAAU,GAEd,GADA8H,EAAS,KAAMlB,EAAOE,EAAO9G,GACzB4G,EAAME,MAAQA,EAAO,CACrB,IAAI/E,EAAO0F,EAASb,EAAOC,EAAKC,EAAQ,GACxCc,EAAQX,EAAMlF,EAAMqF,EAAcR,EAAOC,EAAKC,EAAQ,IAAK9G,GAG/D,OADA8H,EAASjB,EAAK,KAAMC,EAAO9G,GACpB,IAAIc,EAASd,GAExB,SAASgH,EAAuBnF,EAAO0G,GACnC,IAAIC,EAAQD,EAAOzB,MAAQjF,EAAM6D,UAAWtE,EAASmH,EAAO3G,KAAK4G,GAC7D5G,EAAOR,EAAO0B,KAAKjB,EAAM7B,SAC7B,IAAK,IAAIT,EAAIiJ,EAAQ,EAAGjJ,GAAK,EAAGA,IAC5BqC,EAAO2G,EAAO3G,KAAKrC,GAAGuD,KAAKhC,EAASE,KAAKY,IAC7C,MAAO,CAAEN,MAAOM,EAAK6G,eAAe5G,EAAM6D,UAAY8C,GAClDnH,IAAKO,EAAK6G,eAAe7G,EAAK5B,QAAQC,KAAO4B,EAAM8D,QAAU6C,IA1HrE/C,EAAM9C,MAAQ,IAAI8C,EAAM3E,EAAS6B,MAAO,EAAG,GAuI3C,MAAM+F,EAIF,YAIApJ,EAIAqJ,EAIAxB,GACIpG,KAAKzB,IAAMA,EACXyB,KAAK4H,KAAOA,EACZ5H,KAAKoG,aAAeA,EACpBpG,KAAK+F,MAAQ6B,EAAK9H,OAAS,EAAI,EAKnC,aAAa+H,GACT,OAAW,MAAPA,EACO7H,KAAK+F,MACZ8B,EAAM,EACC7H,KAAK+F,MAAQ8B,EACjBA,EAOX,aAAe,OAAO7H,KAAKa,KAAKb,KAAK+F,OAIrC,UAAY,OAAO/F,KAAKa,KAAK,GAK7B,KAAKkF,GAAS,OAAO/F,KAAK4H,KAAgC,EAA3B5H,KAAK8H,aAAa/B,IAMjD,MAAMA,GAAS,OAAO/F,KAAK4H,KAAgC,EAA3B5H,KAAK8H,aAAa/B,GAAa,GAK/D,WAAWA,GAEP,OADAA,EAAQ/F,KAAK8H,aAAa/B,GACnB/F,KAAK6B,MAAMkE,IAAUA,GAAS/F,KAAK+F,OAAU/F,KAAKoH,WAAiB,EAAJ,GAM1E,MAAMrB,GAEF,OADAA,EAAQ/F,KAAK8H,aAAa/B,GACV,GAATA,EAAa,EAAI/F,KAAK4H,KAAa,EAAR7B,EAAY,GAAK,EAMvD,IAAIA,GAEA,OADAA,EAAQ/F,KAAK8H,aAAa/B,GACnB/F,KAAKO,MAAMwF,GAAS/F,KAAKa,KAAKkF,GAAO9G,QAAQC,KAOxD,OAAO6G,GAEH,GADAA,EAAQ/F,KAAK8H,aAAa/B,IACrBA,EACD,MAAM,IAAI5D,WAAW,kDACzB,OAAO4D,GAAS/F,KAAK+F,MAAQ,EAAI/F,KAAKzB,IAAMyB,KAAK4H,KAAa,EAAR7B,EAAY,GAMtE,MAAMA,GAEF,GADAA,EAAQ/F,KAAK8H,aAAa/B,IACrBA,EACD,MAAM,IAAI5D,WAAW,iDACzB,OAAO4D,GAAS/F,KAAK+F,MAAQ,EAAI/F,KAAKzB,IAAMyB,KAAK4H,KAAa,EAAR7B,EAAY,GAAK/F,KAAK4H,KAAa,EAAR7B,GAAW3G,SAOhG,iBAAmB,OAAOY,KAAKzB,IAAMyB,KAAK4H,KAAK5H,KAAK4H,KAAK9H,OAAS,GAMlE,gBACI,IAAIO,EAASL,KAAKK,OAAQwB,EAAQ7B,KAAK6B,MAAM7B,KAAK+F,OAClD,GAAIlE,GAASxB,EAAO5B,WAChB,OAAO,KACX,IAAIsJ,EAAO/H,KAAKzB,IAAMyB,KAAK4H,KAAK5H,KAAK4H,KAAK9H,OAAS,GAAInB,EAAQ0B,EAAO1B,MAAMkD,GAC5E,OAAOkG,EAAO1H,EAAO1B,MAAMkD,GAAOF,IAAIoG,GAAQpJ,EAOlD,iBACI,IAAIkD,EAAQ7B,KAAK6B,MAAM7B,KAAK+F,OACxBgC,EAAO/H,KAAKzB,IAAMyB,KAAK4H,KAAK5H,KAAK4H,KAAK9H,OAAS,GACnD,OAAIiI,EACO/H,KAAKK,OAAO1B,MAAMkD,GAAOF,IAAI,EAAGoG,GAC3B,GAATlG,EAAa,KAAO7B,KAAKK,OAAO1B,MAAMkD,EAAQ,GAMzD,WAAWA,EAAOkE,GACdA,EAAQ/F,KAAK8H,aAAa/B,GAC1B,IAAIlF,EAAOb,KAAK4H,KAAa,EAAR7B,GAAYxH,EAAe,GAATwH,EAAa,EAAI/F,KAAK4H,KAAa,EAAR7B,EAAY,GAAK,EACnF,IAAK,IAAIvH,EAAI,EAAGA,EAAIqD,EAAOrD,IACvBD,GAAOsC,EAAKlC,MAAMH,GAAGY,SACzB,OAAOb,EAQX,QACI,IAAI8B,EAASL,KAAKK,OAAQwB,EAAQ7B,KAAK6B,QAEvC,GAA2B,GAAvBxB,EAAOpB,QAAQC,KACf,OAAOyE,EAAKW,KAEhB,GAAItE,KAAKoH,WACL,OAAO/G,EAAO1B,MAAMkD,GAAOuC,MAC/B,IAAImC,EAAOlG,EAAO+E,WAAWvD,EAAQ,GAAIV,EAAQd,EAAO+E,WAAWvD,GAGnE,IAAK0E,EAAM,CACP,IAAIyB,EAAMzB,EACVA,EAAOpF,EACPA,EAAQ6G,EAIZ,IAAI5D,EAAQmC,EAAKnC,MACjB,IAAK,IAAI5F,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,KACO,IAAjC4F,EAAM5F,GAAGwC,KAAKC,KAAKgH,WAAyB9G,GAAUiD,EAAM5F,GAAG0J,QAAQ/G,EAAMiD,SAC7EA,EAAQA,EAAM5F,KAAK2J,cAAc/D,IACzC,OAAOA,EAUX,YAAY6C,GACR,IAAImB,EAAQpI,KAAKK,OAAO+E,WAAWpF,KAAK6B,SACxC,IAAKuG,IAAUA,EAAMC,SACjB,OAAO,KACX,IAAIjE,EAAQgE,EAAMhE,MAAOkE,EAAOrB,EAAK5G,OAAO+E,WAAW6B,EAAKpF,SAC5D,IAAK,IAAIrD,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,KACO,IAAjC4F,EAAM5F,GAAGwC,KAAKC,KAAKgH,WAAyBK,GAASlE,EAAM5F,GAAG0J,QAAQI,EAAKlE,SAC3EA,EAAQA,EAAM5F,KAAK2J,cAAc/D,IACzC,OAAOA,EAMX,YAAY7F,GACR,IAAK,IAAIwH,EAAQ/F,KAAK+F,MAAOA,EAAQ,EAAGA,IACpC,GAAI/F,KAAKO,MAAMwF,IAAUxH,GAAOyB,KAAKM,IAAIyF,IAAUxH,EAC/C,OAAOwH,EACf,OAAO,EAWX,WAAW5E,EAAQnB,KAAMuI,GACrB,GAAIpH,EAAM5C,IAAMyB,KAAKzB,IACjB,OAAO4C,EAAMqH,WAAWxI,MAC5B,IAAK,IAAIyI,EAAIzI,KAAK+F,OAAS/F,KAAKK,OAAOqI,eAAiB1I,KAAKzB,KAAO4C,EAAM5C,IAAM,EAAI,GAAIkK,GAAK,EAAGA,IAC5F,GAAItH,EAAM5C,KAAOyB,KAAKM,IAAImI,MAAQF,GAAQA,EAAKvI,KAAKa,KAAK4H,KACrD,OAAO,IAAIE,EAAU3I,KAAMmB,EAAOsH,GAC1C,OAAO,KAKX,WAAWtH,GACP,OAAOnB,KAAKzB,IAAMyB,KAAKoG,cAAgBjF,EAAM5C,IAAM4C,EAAMiF,aAK7D,IAAIjF,GACA,OAAOA,EAAM5C,IAAMyB,KAAKzB,IAAM4C,EAAQnB,KAK1C,IAAImB,GACA,OAAOA,EAAM5C,IAAMyB,KAAKzB,IAAM4C,EAAQnB,KAK1C,WACI,IAAI4I,EAAM,GACV,IAAK,IAAIpK,EAAI,EAAGA,GAAKwB,KAAK+F,MAAOvH,IAC7BoK,IAAQA,EAAM,IAAM,IAAM5I,KAAKa,KAAKrC,GAAGwC,KAAKiD,KAAO,IAAMjE,KAAK6B,MAAMrD,EAAI,GAC5E,OAAOoK,EAAM,IAAM5I,KAAKoG,aAK5B,eAAeyC,EAAKtK,GAChB,KAAMA,GAAO,GAAKA,GAAOsK,EAAI5J,QAAQC,MACjC,MAAM,IAAIiD,WAAW,YAAc5D,EAAM,iBAC7C,IAAIqJ,EAAO,GACPrH,EAAQ,EAAG6F,EAAe7H,EAC9B,IAAK,IAAIsC,EAAOgI,IAAO,CACnB,IAAI,MAAEhH,EAAK,OAAE4B,GAAW5C,EAAK5B,QAAQkG,UAAUiB,GAC3C0C,EAAM1C,EAAe3C,EAEzB,GADAmE,EAAKnG,KAAKZ,EAAMgB,EAAOtB,EAAQkD,IAC1BqF,EACD,MAEJ,GADAjI,EAAOA,EAAKlC,MAAMkD,GACdhB,EAAK/B,OACL,MACJsH,EAAe0C,EAAM,EACrBvI,GAASkD,EAAS,EAEtB,OAAO,IAAIkE,EAAYpJ,EAAKqJ,EAAMxB,GAKtC,qBAAqByC,EAAKtK,GACtB,IAAK,IAAIC,EAAI,EAAGA,EAAIuK,EAAajJ,OAAQtB,IAAK,CAC1C,IAAIwK,EAASD,EAAavK,GAC1B,GAAIwK,EAAOzK,KAAOA,GAAOyK,EAAOH,KAAOA,EACnC,OAAOG,EAEf,IAAItH,EAASqH,EAAaE,GAAmBtB,EAAYuB,QAAQL,EAAKtK,GAEtE,OADA0K,GAAmBA,EAAkB,GAAKE,EACnCzH,GAGf,IAAIqH,EAAe,GAAIE,EAAkB,EAAGE,EAAmB,GAK/D,MAAMR,EAMF,YAOA9C,EAKAC,EAIAC,GACI/F,KAAK6F,MAAQA,EACb7F,KAAK8F,IAAMA,EACX9F,KAAK+F,MAAQA,EAKjB,YAAc,OAAO/F,KAAK6F,MAAMuD,OAAOpJ,KAAK+F,MAAQ,GAIpD,UAAY,OAAO/F,KAAK8F,IAAIsC,MAAMpI,KAAK+F,MAAQ,GAI/C,aAAe,OAAO/F,KAAK6F,MAAMhF,KAAKb,KAAK+F,OAI3C,iBAAmB,OAAO/F,KAAK6F,MAAMhE,MAAM7B,KAAK+F,OAIhD,eAAiB,OAAO/F,KAAK8F,IAAIuD,WAAWrJ,KAAK+F,QAGrD,MAAMuD,EAAaC,OAAOlF,OAAO,MAejC,MAAMmF,EAIF,YAIAxI,EAMAwC,EAEAvE,EAKAmF,EAAQT,EAAKW,MACTtE,KAAKgB,KAAOA,EACZhB,KAAKwD,MAAQA,EACbxD,KAAKoE,MAAQA,EACbpE,KAAKf,QAAUA,GAAWc,EAAS6B,MASvC,eAAiB,OAAO5B,KAAKe,OAAS,EAAI,EAAIf,KAAKf,QAAQC,KAI3D,iBAAmB,OAAOc,KAAKf,QAAQR,WAKvC,MAAMoD,GAAS,OAAO7B,KAAKf,QAAQN,MAAMkD,GAIzC,WAAWA,GAAS,OAAO7B,KAAKf,QAAQmG,WAAWvD,GAKnD,QAAQ1B,GAAKH,KAAKf,QAAQwK,QAAQtJ,GAUlC,aAAaF,EAAMC,EAAIC,EAAGuJ,EAAW,GACjC1J,KAAKf,QAAQuB,aAAaP,EAAMC,EAAIC,EAAGuJ,EAAU1J,MAMrD,YAAYG,GACRH,KAAKQ,aAAa,EAAGR,KAAKf,QAAQC,KAAMiB,GAM5C,kBACI,OAAQH,KAAKe,QAAUf,KAAKgB,KAAKC,KAAKN,SAChCX,KAAKgB,KAAKC,KAAKN,SAASX,MACxBA,KAAK2J,YAAY,EAAG3J,KAAKf,QAAQC,KAAM,IASjD,YAAYe,EAAMC,EAAIQ,EAAgBC,GAClC,OAAOX,KAAKf,QAAQ0K,YAAY1J,EAAMC,EAAIQ,EAAgBC,GAM9D,iBAAmB,OAAOX,KAAKf,QAAQsC,WAKvC,gBAAkB,OAAOvB,KAAKf,QAAQoC,UAItC,GAAGF,GACC,OAAOnB,MAAQmB,GAAUnB,KAAKnB,WAAWsC,IAAUnB,KAAKf,QAAQgD,GAAGd,EAAMlC,SAM7E,WAAWkC,GACP,OAAOnB,KAAK4J,UAAUzI,EAAMH,KAAMG,EAAMqC,MAAOrC,EAAMiD,OAMzD,UAAUpD,EAAMwC,EAAOY,GACnB,OAAOpE,KAAKgB,MAAQA,GAChB0C,EAAY1D,KAAKwD,MAAOA,GAASxC,EAAK6I,cAAgBP,IACtD3F,EAAKmG,QAAQ9J,KAAKoE,MAAOA,GAAST,EAAKW,MAM/C,KAAKrF,EAAU,MACX,OAAIA,GAAWe,KAAKf,QACTe,KACJ,IAAIwJ,EAAKxJ,KAAKgB,KAAMhB,KAAKwD,MAAOvE,EAASe,KAAKoE,OAMzD,KAAKA,GACD,OAAOA,GAASpE,KAAKoE,MAAQpE,KAAO,IAAIwJ,EAAKxJ,KAAKgB,KAAMhB,KAAKwD,MAAOxD,KAAKf,QAASmF,GAOtF,IAAInE,EAAMC,EAAKF,KAAKf,QAAQC,MACxB,OAAY,GAARe,GAAaC,GAAMF,KAAKf,QAAQC,KACzBc,KACJA,KAAK+B,KAAK/B,KAAKf,QAAQ0C,IAAI1B,EAAMC,IAM5C,MAAMD,EAAMC,EAAKF,KAAKf,QAAQC,KAAM6K,GAAiB,GACjD,GAAI9J,GAAQC,EACR,OAAOwE,EAAM9C,MACjB,IAAIiE,EAAQ7F,KAAKkJ,QAAQjJ,GAAO6F,EAAM9F,KAAKkJ,QAAQhJ,GAC/C6F,EAAQgE,EAAiB,EAAIlE,EAAMmE,YAAY9J,GAC/CK,EAAQsF,EAAMtF,MAAMwF,GAAQlF,EAAOgF,EAAMhF,KAAKkF,GAC9C9G,EAAU4B,EAAK5B,QAAQ0C,IAAIkE,EAAMtH,IAAMgC,EAAOuF,EAAIvH,IAAMgC,GAC5D,OAAO,IAAImE,EAAMzF,EAAS4G,EAAME,MAAQA,EAAOD,EAAIC,MAAQA,GAU/D,QAAQ9F,EAAMC,EAAIY,GACd,OAAO8E,EAAQ5F,KAAKkJ,QAAQjJ,GAAOD,KAAKkJ,QAAQhJ,GAAKY,GAKzD,OAAOvC,GACH,IAAK,IAAIsC,EAAOb,OAAQ,CACpB,IAAI,MAAE6B,EAAK,OAAE4B,GAAW5C,EAAK5B,QAAQkG,UAAU5G,GAE/C,GADAsC,EAAOA,EAAKuE,WAAWvD,IAClBhB,EACD,OAAO,KACX,GAAI4C,GAAUlF,GAAOsC,EAAK/B,OACtB,OAAO+B,EACXtC,GAAOkF,EAAS,GAQxB,WAAWlF,GACP,IAAI,MAAEsD,EAAK,OAAE4B,GAAWzD,KAAKf,QAAQkG,UAAU5G,GAC/C,MAAO,CAAEsC,KAAMb,KAAKf,QAAQmG,WAAWvD,GAAQA,QAAO4B,UAO1D,YAAYlF,GACR,GAAW,GAAPA,EACA,MAAO,CAAEsC,KAAM,KAAMgB,MAAO,EAAG4B,OAAQ,GAC3C,IAAI,MAAE5B,EAAK,OAAE4B,GAAWzD,KAAKf,QAAQkG,UAAU5G,GAC/C,GAAIkF,EAASlF,EACT,MAAO,CAAEsC,KAAMb,KAAKf,QAAQN,MAAMkD,GAAQA,QAAO4B,UACrD,IAAI5C,EAAOb,KAAKf,QAAQN,MAAMkD,EAAQ,GACtC,MAAO,CAAEhB,OAAMgB,MAAOA,EAAQ,EAAG4B,OAAQA,EAAS5C,EAAKzB,UAM3D,QAAQb,GAAO,OAAOoJ,EAAYsC,cAAcjK,KAAMzB,GAItD,eAAeA,GAAO,OAAOoJ,EAAYuB,QAAQlJ,KAAMzB,GAKvD,aAAa0B,EAAMC,EAAIc,GACnB,IAAIkB,GAAQ,EAOZ,OANIhC,EAAKD,GACLD,KAAKQ,aAAaP,EAAMC,EAAIW,IACpBG,EAAKkH,QAAQrH,EAAKuD,SAClBlC,GAAQ,IACJA,IAETA,EAKX,cAAgB,OAAOlC,KAAKgB,KAAKE,QAKjC,kBAAoB,OAAOlB,KAAKgB,KAAKkJ,YAIrC,oBAAsB,OAAOlK,KAAKgB,KAAK0H,cAKvC,eAAiB,OAAO1I,KAAKgB,KAAKqH,SAIlC,aAAe,OAAOrI,KAAKgB,KAAKlC,OAIhC,aAAe,OAAOkB,KAAKgB,KAAKD,OAQhC,aAAe,OAAOf,KAAKgB,KAAKmJ,OAKhC,WACI,GAAInK,KAAKgB,KAAKC,KAAKmJ,cACf,OAAOpK,KAAKgB,KAAKC,KAAKmJ,cAAcpK,MACxC,IAAIiE,EAAOjE,KAAKgB,KAAKiD,KAGrB,OAFIjE,KAAKf,QAAQC,OACb+E,GAAQ,IAAMjE,KAAKf,QAAQyD,gBAAkB,KAC1C2H,EAAUrK,KAAKoE,MAAOH,GAKjC,eAAepC,GACX,IAAIyI,EAAQtK,KAAKgB,KAAKuJ,aAAaC,cAAcxK,KAAKf,QAAS,EAAG4C,GAClE,IAAKyI,EACD,MAAM,IAAI7F,MAAM,wDACpB,OAAO6F,EASX,WAAWrK,EAAMC,EAAIuK,EAAc1K,EAAS6B,MAAOrB,EAAQ,EAAGD,EAAMmK,EAAYhM,YAC5E,IAAIiM,EAAM1K,KAAK2K,eAAe1K,GAAMuK,cAAcC,EAAalK,EAAOD,GAClEsK,EAAMF,GAAOA,EAAIF,cAAcxK,KAAKf,QAASiB,GACjD,IAAK0K,IAAQA,EAAIC,SACb,OAAO,EACX,IAAK,IAAIrM,EAAI+B,EAAO/B,EAAI8B,EAAK9B,IACzB,IAAKwB,KAAKgB,KAAK8J,YAAYL,EAAY9L,MAAMH,GAAG4F,OAC5C,OAAO,EACf,OAAO,EAMX,eAAenE,EAAMC,EAAIc,EAAMoD,GAC3B,GAAIA,IAAUpE,KAAKgB,KAAK8J,YAAY1G,GAChC,OAAO,EACX,IAAI7D,EAAQP,KAAK2K,eAAe1K,GAAM8K,UAAU/J,GAC5CV,EAAMC,GAASA,EAAMiK,cAAcxK,KAAKf,QAASiB,GACrD,QAAOI,GAAMA,EAAIuK,SAQrB,UAAU1J,GACN,OAAIA,EAAMlC,QAAQC,KACPc,KAAK2F,WAAW3F,KAAKvB,WAAYuB,KAAKvB,WAAY0C,EAAMlC,SAExDe,KAAKgB,KAAKyF,kBAAkBtF,EAAMH,MAMjD,QACI,IAAKhB,KAAKgB,KAAKuG,aAAavH,KAAKf,SAC7B,MAAM,IAAIkD,WAAW,4BAA4BnC,KAAKgB,KAAKiD,SAASjE,KAAKf,QAAQ+L,WAAWlK,MAAM,EAAG,OACzG,IAAIiB,EAAO4B,EAAKW,KAChB,IAAK,IAAI9F,EAAI,EAAGA,EAAIwB,KAAKoE,MAAMtE,OAAQtB,IACnCuD,EAAO/B,KAAKoE,MAAM5F,GAAGyM,SAASlJ,GAClC,IAAK4B,EAAKmG,QAAQ/H,EAAM/B,KAAKoE,OACzB,MAAM,IAAIjC,WAAW,wCAAwCnC,KAAKgB,KAAKiD,SAASjE,KAAKoE,MAAMxB,IAAIsI,GAAKA,EAAElK,KAAKiD,SAC/GjE,KAAKf,QAAQwK,QAAQ5I,GAAQA,EAAKsK,SAKtC,SACI,IAAInH,EAAM,CAAEhD,KAAMhB,KAAKgB,KAAKiD,MAC5B,IAAK,IAAIC,KAAKlE,KAAKwD,MAAO,CACtBQ,EAAIR,MAAQxD,KAAKwD,MACjB,MAMJ,OAJIxD,KAAKf,QAAQC,OACb8E,EAAI/E,QAAUe,KAAKf,QAAQ6D,UAC3B9C,KAAKoE,MAAMtE,SACXkE,EAAII,MAAQpE,KAAKoE,MAAMxB,IAAIC,GAAKA,EAAEC,WAC/BkB,EAKX,gBAAgBjB,EAAQoB,GACpB,IAAKA,EACD,MAAM,IAAIhC,WAAW,mCACzB,IAAIiC,EAAQ,KACZ,GAAID,EAAKC,MAAO,CACZ,IAAKnB,MAAMC,QAAQiB,EAAKC,OACpB,MAAM,IAAIjC,WAAW,uCACzBiC,EAAQD,EAAKC,MAAMxB,IAAIG,EAAOqI,cAElC,GAAiB,QAAbjH,EAAKnD,KAAgB,CACrB,GAAwB,iBAAbmD,EAAKpF,KACZ,MAAM,IAAIoD,WAAW,6BACzB,OAAOY,EAAOhE,KAAKoF,EAAKpF,KAAMqF,GAElC,IAAInF,EAAUc,EAASiF,SAASjC,EAAQoB,EAAKlF,SAC7C,OAAO8D,EAAOsI,SAASlH,EAAKnD,MAAMqD,OAAOF,EAAKX,MAAOvE,EAASmF,IAGtEoF,EAAK8B,UAAUvM,UAAOwM,EACtB,MAAMC,UAAiBhC,EAInB,YAAYxI,EAAMwC,EAAOvE,EAASmF,GAE9B,GADAqH,MAAMzK,EAAMwC,EAAO,KAAMY,IACpBnF,EACD,MAAM,IAAIkD,WAAW,oCACzBnC,KAAKjB,KAAOE,EAEhB,WACI,OAAIe,KAAKgB,KAAKC,KAAKmJ,cACRpK,KAAKgB,KAAKC,KAAKmJ,cAAcpK,MACjCqK,EAAUrK,KAAKoE,MAAOsH,KAAKC,UAAU3L,KAAKjB,OAErD,kBAAoB,OAAOiB,KAAKjB,KAChC,YAAYkB,EAAMC,GAAM,OAAOF,KAAKjB,KAAK+B,MAAMb,EAAMC,GACrD,eAAiB,OAAOF,KAAKjB,KAAKe,OAClC,KAAKsE,GACD,OAAOA,GAASpE,KAAKoE,MAAQpE,KAAO,IAAIwL,EAASxL,KAAKgB,KAAMhB,KAAKwD,MAAOxD,KAAKjB,KAAMqF,GAEvF,SAASrF,GACL,OAAIA,GAAQiB,KAAKjB,KACNiB,KACJ,IAAIwL,EAASxL,KAAKgB,KAAMhB,KAAKwD,MAAOzE,EAAMiB,KAAKoE,OAE1D,IAAInE,EAAO,EAAGC,EAAKF,KAAKjB,KAAKe,QACzB,OAAY,GAARG,GAAaC,GAAMF,KAAKjB,KAAKe,OACtBE,KACJA,KAAKwB,SAASxB,KAAKjB,KAAK+B,MAAMb,EAAMC,IAE/C,GAAGiB,GACC,OAAOnB,KAAKnB,WAAWsC,IAAUnB,KAAKjB,MAAQoC,EAAMpC,KAExD,SACI,IAAI6M,EAAOH,MAAM3I,SAEjB,OADA8I,EAAK7M,KAAOiB,KAAKjB,KACV6M,GAGf,SAASvB,EAAUjG,EAAOwE,GACtB,IAAK,IAAIpK,EAAI4F,EAAMtE,OAAS,EAAGtB,GAAK,EAAGA,IACnCoK,EAAMxE,EAAM5F,GAAGwC,KAAKiD,KAAO,IAAM2E,EAAM,IAC3C,OAAOA,EASX,MAAMiD,EAIF,YAIAhB,GACI7K,KAAK6K,SAAWA,EAIhB7K,KAAKsI,KAAO,GAIZtI,KAAK8L,UAAY,GAKrB,aAAaC,EAAQC,GACjB,IAAIC,EAAS,IAAIC,EAAYH,EAAQC,GACrC,GAAmB,MAAfC,EAAO3D,KACP,OAAOuD,EAAajK,MACxB,IAAIuK,EAAOC,EAAUH,GACjBA,EAAO3D,MACP2D,EAAOI,IAAI,4BACf,IAAI/B,EAAQgC,EAAIC,EAAIJ,IAEpB,OADAK,EAAiBlC,EAAO2B,GACjB3B,EAMX,UAAUtJ,GACN,IAAK,IAAIxC,EAAI,EAAGA,EAAIwB,KAAKsI,KAAKxI,OAAQtB,IAClC,GAAIwB,KAAKsI,KAAK9J,GAAGwC,MAAQA,EACrB,OAAOhB,KAAKsI,KAAK9J,GAAG8J,KAC5B,OAAO,KAMX,cAAcmE,EAAMlM,EAAQ,EAAGD,EAAMmM,EAAKhO,YACtC,IAAIgE,EAAMzC,KACV,IAAK,IAAIxB,EAAI+B,EAAOkC,GAAOjE,EAAI8B,EAAK9B,IAChCiE,EAAMA,EAAIsI,UAAU0B,EAAK9N,MAAMH,GAAGwC,MACtC,OAAOyB,EAKX,oBACI,OAAOzC,KAAKsI,KAAKxI,QAAUE,KAAKsI,KAAK,GAAGtH,KAAKqH,SAMjD,kBACI,IAAK,IAAI7J,EAAI,EAAGA,EAAIwB,KAAKsI,KAAKxI,OAAQtB,IAAK,CACvC,IAAI,KAAEwC,GAAShB,KAAKsI,KAAK9J,GACzB,IAAMwC,EAAKlC,SAAUkC,EAAK0L,mBACtB,OAAO1L,EAEf,OAAO,KAKX,WAAWG,GACP,IAAK,IAAI3C,EAAI,EAAGA,EAAIwB,KAAKsI,KAAKxI,OAAQtB,IAClC,IAAK,IAAIQ,EAAI,EAAGA,EAAImC,EAAMmH,KAAKxI,OAAQd,IACnC,GAAIgB,KAAKsI,KAAK9J,GAAGwC,MAAQG,EAAMmH,KAAKtJ,GAAGgC,KACnC,OAAO,EACnB,OAAO,EAUX,WAAWoH,EAAOuE,GAAQ,EAAOzF,EAAa,GAC1C,IAAI0F,EAAO,CAAC5M,MACZ,SAAS6M,EAAOvC,EAAOwC,GACnB,IAAIC,EAAWzC,EAAME,cAAcpC,EAAOlB,GAC1C,GAAI6F,KAAcJ,GAASI,EAASlC,UAChC,OAAO9K,EAASE,KAAK6M,EAAMlK,IAAIoK,GAAMA,EAAGC,kBAC5C,IAAK,IAAIzO,EAAI,EAAGA,EAAI8L,EAAMhC,KAAKxI,OAAQtB,IAAK,CACxC,IAAI,KAAEwC,EAAI,KAAEsH,GAASgC,EAAMhC,KAAK9J,GAChC,IAAMwC,EAAKlC,SAAUkC,EAAK0L,qBAA8C,GAAvBE,EAAKM,QAAQ5E,GAAa,CACvEsE,EAAKnL,KAAK6G,GACV,IAAIpG,EAAQ2K,EAAOvE,EAAMwE,EAAM9K,OAAOhB,IACtC,GAAIkB,EACA,OAAOA,GAGnB,OAAO,KAEX,OAAO2K,EAAO7M,KAAM,IAQxB,aAAa8G,GACT,IAAK,IAAItI,EAAI,EAAGA,EAAIwB,KAAK8L,UAAUhM,OAAQtB,GAAK,EAC5C,GAAIwB,KAAK8L,UAAUtN,IAAMsI,EACrB,OAAO9G,KAAK8L,UAAUtN,EAAI,GAClC,IAAI2O,EAAWnN,KAAKoN,gBAAgBtG,GAEpC,OADA9G,KAAK8L,UAAUrK,KAAKqF,EAAQqG,GACrBA,EAKX,gBAAgBrG,GACZ,IAAI8F,EAAOrD,OAAOlF,OAAO,MAAOgJ,EAAS,CAAC,CAAE/C,MAAOtK,KAAMgB,KAAM,KAAMsM,IAAK,OAC1E,MAAOD,EAAOvN,OAAQ,CAClB,IAAIgC,EAAUuL,EAAOE,QAASjD,EAAQxI,EAAQwI,MAC9C,GAAIA,EAAMS,UAAUjE,GAAS,CACzB,IAAIpF,EAAS,GACb,IAAK,IAAIsC,EAAMlC,EAASkC,EAAIhD,KAAMgD,EAAMA,EAAIsJ,IACxC5L,EAAOD,KAAKuC,EAAIhD,MACpB,OAAOU,EAAO8L,UAElB,IAAK,IAAIhP,EAAI,EAAGA,EAAI8L,EAAMhC,KAAKxI,OAAQtB,IAAK,CACxC,IAAI,KAAEwC,EAAI,KAAEsH,GAASgC,EAAMhC,KAAK9J,GAC3BwC,EAAKD,QAAWC,EAAK0L,oBAAwB1L,EAAKiD,QAAQ2I,GAAW9K,EAAQd,OAAQsH,EAAKuC,WAC3FwC,EAAO5L,KAAK,CAAE6I,MAAOtJ,EAAKuJ,aAAcvJ,OAAMsM,IAAKxL,IACnD8K,EAAK5L,EAAKiD,OAAQ,IAI9B,OAAO,KAMX,gBACI,OAAOjE,KAAKsI,KAAKxI,OAMrB,KAAK+C,GACD,GAAIA,GAAK7C,KAAKsI,KAAKxI,OACf,MAAM,IAAIqC,WAAW,cAAcU,kCACvC,OAAO7C,KAAKsI,KAAKzF,GAKrB,WACI,IAAI+J,EAAO,GACX,SAASa,EAAKvC,GACV0B,EAAKnL,KAAKyJ,GACV,IAAK,IAAI1M,EAAI,EAAGA,EAAI0M,EAAE5C,KAAKxI,OAAQtB,KACM,GAAjCoO,EAAKM,QAAQhC,EAAE5C,KAAK9J,GAAG8J,OACvBmF,EAAKvC,EAAE5C,KAAK9J,GAAG8J,MAG3B,OADAmF,EAAKzN,MACE4M,EAAKhK,IAAI,CAACsI,EAAG1M,KAChB,IAAIkP,EAAMlP,GAAK0M,EAAEL,SAAW,IAAM,KAAO,IACzC,IAAK,IAAIrM,EAAI,EAAGA,EAAI0M,EAAE5C,KAAKxI,OAAQtB,IAC/BkP,IAAQlP,EAAI,KAAO,IAAM0M,EAAE5C,KAAK9J,GAAGwC,KAAKiD,KAAO,KAAO2I,EAAKM,QAAQhC,EAAE5C,KAAK9J,GAAG8J,MACjF,OAAOoF,IACR/K,KAAK,OAMhBkJ,EAAajK,MAAQ,IAAIiK,GAAa,GACtC,MAAMK,EACF,YAAYH,EAAQC,GAChBhM,KAAK+L,OAASA,EACd/L,KAAKgM,UAAYA,EACjBhM,KAAK2N,OAAS,KACd3N,KAAKzB,IAAM,EACXyB,KAAK4N,OAAS7B,EAAO8B,MAAM,kBACgB,IAAvC7N,KAAK4N,OAAO5N,KAAK4N,OAAO9N,OAAS,IACjCE,KAAK4N,OAAOE,MACM,IAAlB9N,KAAK4N,OAAO,IACZ5N,KAAK4N,OAAOL,QAEpB,WAAa,OAAOvN,KAAK4N,OAAO5N,KAAKzB,KACrC,IAAIwP,GAAO,OAAO/N,KAAKsI,MAAQyF,IAAQ/N,KAAKzB,QAAS,GACrD,IAAIqK,GAAO,MAAM,IAAIoF,YAAYpF,EAAM,4BAA8B5I,KAAK+L,OAAS,OAEvF,SAASK,EAAUH,GACf,IAAIgC,EAAQ,GACZ,GACIA,EAAMxM,KAAKyM,EAAajC,UACnBA,EAAOkC,IAAI,MACpB,OAAuB,GAAhBF,EAAMnO,OAAcmO,EAAM,GAAK,CAAEjN,KAAM,SAAUiN,SAE5D,SAASC,EAAajC,GAClB,IAAIgC,EAAQ,GACZ,GACIA,EAAMxM,KAAK2M,EAAmBnC,UACzBA,EAAO3D,MAAuB,KAAf2D,EAAO3D,MAA8B,KAAf2D,EAAO3D,MACrD,OAAuB,GAAhB2F,EAAMnO,OAAcmO,EAAM,GAAK,CAAEjN,KAAM,MAAOiN,SAEzD,SAASG,EAAmBnC,GACxB,IAAIE,EAAOkC,EAAcpC,GACzB,OACI,GAAIA,EAAOkC,IAAI,KACXhC,EAAO,CAAEnL,KAAM,OAAQmL,aACtB,GAAIF,EAAOkC,IAAI,KAChBhC,EAAO,CAAEnL,KAAM,OAAQmL,aACtB,GAAIF,EAAOkC,IAAI,KAChBhC,EAAO,CAAEnL,KAAM,MAAOmL,YACrB,KAAIF,EAAOkC,IAAI,KAGhB,MAFAhC,EAAOmC,EAAerC,EAAQE,GAItC,OAAOA,EAEX,SAASoC,EAAStC,GACV,KAAKuC,KAAKvC,EAAO3D,OACjB2D,EAAOI,IAAI,yBAA2BJ,EAAO3D,KAAO,KACxD,IAAI5G,EAAS+M,OAAOxC,EAAO3D,MAE3B,OADA2D,EAAO1N,MACAmD,EAEX,SAAS4M,EAAerC,EAAQE,GAC5B,IAAItM,EAAM0O,EAAStC,GAASxL,EAAMZ,EASlC,OARIoM,EAAOkC,IAAI,OAEP1N,EADe,KAAfwL,EAAO3D,KACDiG,EAAStC,IAER,GAEVA,EAAOkC,IAAI,MACZlC,EAAOI,IAAI,yBACR,CAAErL,KAAM,QAASnB,MAAKY,MAAK0L,QAEtC,SAASuC,EAAYzC,EAAQhI,GACzB,IAAI6I,EAAQb,EAAOD,UAAWhL,EAAO8L,EAAM7I,GAC3C,GAAIjD,EACA,MAAO,CAACA,GACZ,IAAIU,EAAS,GACb,IAAK,IAAIiN,KAAY7B,EAAO,CACxB,IAAI9L,EAAO8L,EAAM6B,GACb3N,EAAK4N,OAAO1B,QAAQjJ,IAAS,GAC7BvC,EAAOD,KAAKT,GAIpB,OAFqB,GAAjBU,EAAO5B,QACPmM,EAAOI,IAAI,0BAA4BpI,EAAO,WAC3CvC,EAEX,SAAS2M,EAAcpC,GACnB,GAAIA,EAAOkC,IAAI,KAAM,CACjB,IAAIhC,EAAOC,EAAUH,GAGrB,OAFKA,EAAOkC,IAAI,MACZlC,EAAOI,IAAI,yBACRF,EAEN,IAAK,KAAKqC,KAAKvC,EAAO3D,MAAO,CAC9B,IAAI2F,EAAQS,EAAYzC,EAAQA,EAAO3D,MAAM1F,IAAI5B,IACxB,MAAjBiL,EAAO0B,OACP1B,EAAO0B,OAAS3M,EAAKqH,SAChB4D,EAAO0B,QAAU3M,EAAKqH,UAC3B4D,EAAOI,IAAI,mCACR,CAAErL,KAAM,OAAQgC,MAAOhC,KAGlC,OADAiL,EAAO1N,MACgB,GAAhB0P,EAAMnO,OAAcmO,EAAM,GAAK,CAAEjN,KAAM,SAAUiN,SAGxDhC,EAAOI,IAAI,qBAAuBJ,EAAO3D,KAAO,KAaxD,SAASiE,EAAIJ,GACT,IAAII,EAAM,CAAC,IAEX,OADAsC,EAAQC,EAAQ3C,EAAM,GAAItL,KACnB0L,EACP,SAAS1L,IAAS,OAAO0L,EAAI9K,KAAK,IAAM,EACxC,SAASsN,EAAK9O,EAAMC,EAAI8O,GACpB,IAAID,EAAO,CAAEC,OAAM9O,MAEnB,OADAqM,EAAItM,GAAMwB,KAAKsN,GACRA,EAEX,SAASF,EAAQI,EAAO/O,GACpB+O,EAAMxF,QAAQsF,GAAQA,EAAK7O,GAAKA,GAEpC,SAAS4O,EAAQ3C,EAAMlM,GACnB,GAAiB,UAAbkM,EAAKnL,KACL,OAAOmL,EAAK8B,MAAMiB,OAAO,CAACxB,EAAKvB,IAASuB,EAAI1L,OAAO8M,EAAQ3C,EAAMlM,IAAQ,IAExE,GAAiB,OAAbkM,EAAKnL,KAQT,IAAiB,QAAbmL,EAAKnL,KAAgB,CAC1B,IAAImO,EAAOtO,IAGX,OAFAkO,EAAK9O,EAAMkP,GACXN,EAAQC,EAAQ3C,EAAKA,KAAMgD,GAAOA,GAC3B,CAACJ,EAAKI,IAEZ,GAAiB,QAAbhD,EAAKnL,KAAgB,CAC1B,IAAImO,EAAOtO,IAGX,OAFAgO,EAAQC,EAAQ3C,EAAKA,KAAMlM,GAAOkP,GAClCN,EAAQC,EAAQ3C,EAAKA,KAAMgD,GAAOA,GAC3B,CAACJ,EAAKI,IAEZ,GAAiB,OAAbhD,EAAKnL,KACV,MAAO,CAAC+N,EAAK9O,IAAO+B,OAAO8M,EAAQ3C,EAAKA,KAAMlM,IAE7C,GAAiB,SAAbkM,EAAKnL,KAAiB,CAC3B,IAAIyB,EAAMxC,EACV,IAAK,IAAIzB,EAAI,EAAGA,EAAI2N,EAAKtM,IAAKrB,IAAK,CAC/B,IAAI8J,EAAOzH,IACXgO,EAAQC,EAAQ3C,EAAKA,KAAM1J,GAAM6F,GACjC7F,EAAM6F,EAEV,IAAiB,GAAb6D,EAAK1L,IACLoO,EAAQC,EAAQ3C,EAAKA,KAAM1J,GAAMA,QAGjC,IAAK,IAAIjE,EAAI2N,EAAKtM,IAAKrB,EAAI2N,EAAK1L,IAAKjC,IAAK,CACtC,IAAI8J,EAAOzH,IACXkO,EAAKtM,EAAK6F,GACVuG,EAAQC,EAAQ3C,EAAKA,KAAM1J,GAAM6F,GACjC7F,EAAM6F,EAGd,MAAO,CAACyG,EAAKtM,IAEZ,GAAiB,QAAb0J,EAAKnL,KACV,MAAO,CAAC+N,EAAK9O,OAAMsL,EAAWY,EAAKnJ,QAGnC,MAAM,IAAIyB,MAAM,qBA9ChB,IAAK,IAAIjG,EAAI,GAAIA,IAAK,CAClB,IAAI8J,EAAOwG,EAAQ3C,EAAK8B,MAAMzP,GAAIyB,GAClC,GAAIzB,GAAK2N,EAAK8B,MAAMnO,OAAS,EACzB,OAAOwI,EACXuG,EAAQvG,EAAMrI,EAAOY,OA8CrC,SAASuO,EAAI/Q,EAAGC,GAAK,OAAOA,EAAID,EAIhC,SAASgR,EAAS9C,EAAK1L,GACnB,IAAIa,EAAS,GAEb,OADA+L,EAAK5M,GACEa,EAAO6C,KAAK6K,GACnB,SAAS3B,EAAK5M,GACV,IAAIoO,EAAQ1C,EAAI1L,GAChB,GAAoB,GAAhBoO,EAAMnP,SAAgBmP,EAAM,GAAGD,KAC/B,OAAOvB,EAAKwB,EAAM,GAAG/O,IACzBwB,EAAOD,KAAKZ,GACZ,IAAK,IAAIrC,EAAI,EAAGA,EAAIyQ,EAAMnP,OAAQtB,IAAK,CACnC,IAAI,KAAEwQ,EAAI,GAAE9O,GAAO+O,EAAMzQ,GACpBwQ,IAA+B,GAAvBtN,EAAOwL,QAAQhN,IACxBuN,EAAKvN,KAOrB,SAASoM,EAAIC,GACT,IAAI+C,EAAU/F,OAAOlF,OAAO,MAC5B,OAAOkL,EAAQF,EAAS9C,EAAK,IAC7B,SAASgD,EAAQC,GACb,IAAI9B,EAAM,GACV8B,EAAO/F,QAAQ5I,IACX0L,EAAI1L,GAAM4I,QAAQ,EAAGuF,OAAM9O,SACvB,IAAK8O,EACD,OACJ,IAAIpL,EACJ,IAAK,IAAIpF,EAAI,EAAGA,EAAIkP,EAAI5N,OAAQtB,IACxBkP,EAAIlP,GAAG,IAAMwQ,IACbpL,EAAM8J,EAAIlP,GAAG,IACrB6Q,EAAS9C,EAAKrM,GAAIuJ,QAAQ5I,IACjB+C,GACD8J,EAAIjM,KAAK,CAACuN,EAAMpL,EAAM,MACA,GAAtBA,EAAIsJ,QAAQrM,IACZ+C,EAAInC,KAAKZ,SAIzB,IAAI4O,EAAQH,EAAQE,EAAO7M,KAAK,MAAQ,IAAIkJ,EAAa2D,EAAOtC,QAAQX,EAAIzM,OAAS,IAAM,GAC3F,IAAK,IAAItB,EAAI,EAAGA,EAAIkP,EAAI5N,OAAQtB,IAAK,CACjC,IAAIgR,EAAS9B,EAAIlP,GAAG,GAAG+F,KAAK6K,GAC5BK,EAAMnH,KAAK7G,KAAK,CAAET,KAAM0M,EAAIlP,GAAG,GAAI8J,KAAMgH,EAAQE,EAAO7M,KAAK,OAAS4M,EAAQC,KAElF,OAAOC,GAGf,SAASjD,EAAiBlC,EAAO2B,GAC7B,IAAK,IAAIzN,EAAI,EAAGkR,EAAO,CAACpF,GAAQ9L,EAAIkR,EAAK5P,OAAQtB,IAAK,CAClD,IAAIiR,EAAQC,EAAKlR,GAAImR,GAAQF,EAAM5E,SAAUvH,EAAQ,GACrD,IAAK,IAAItE,EAAI,EAAGA,EAAIyQ,EAAMnH,KAAKxI,OAAQd,IAAK,CACxC,IAAI,KAAEgC,EAAI,KAAEsH,GAASmH,EAAMnH,KAAKtJ,GAChCsE,EAAM7B,KAAKT,EAAKiD,OACZ0L,GAAU3O,EAAKlC,QAAUkC,EAAK0L,qBAC9BiD,GAAO,IACgB,GAAvBD,EAAKxC,QAAQ5E,IACboH,EAAKjO,KAAK6G,GAEdqH,GACA1D,EAAOI,IAAI,+BAAiC/I,EAAMX,KAAK,MAAQ,mFAQ3E,SAASkH,EAAarG,GAClB,IAAIoM,EAAWrG,OAAOlF,OAAO,MAC7B,IAAK,IAAIwL,KAAYrM,EAAO,CACxB,IAAIsM,EAAOtM,EAAMqM,GACjB,IAAKC,EAAKC,WACN,OAAO,KACXH,EAASC,GAAYC,EAAKE,QAE9B,OAAOJ,EAEX,SAASK,EAAazM,EAAOR,GACzB,IAAIkN,EAAQ3G,OAAOlF,OAAO,MAC1B,IAAK,IAAIJ,KAAQT,EAAO,CACpB,IAAI2M,EAAQnN,GAASA,EAAMiB,GAC3B,QAAcsH,IAAV4E,EAAqB,CACrB,IAAIL,EAAOtM,EAAMS,GACjB,IAAI6L,EAAKC,WAGL,MAAM,IAAI5N,WAAW,mCAAqC8B,GAF1DkM,EAAQL,EAAKE,QAIrBE,EAAMjM,GAAQkM,EAElB,OAAOD,EAEX,SAASE,EAAU5M,GACf,IAAI9B,EAAS6H,OAAOlF,OAAO,MAC3B,GAAIb,EACA,IAAK,IAAIS,KAAQT,EACb9B,EAAOuC,GAAQ,IAAIoM,EAAU7M,EAAMS,IAC3C,OAAOvC,EAQX,MAAM4O,EAIF,YAIArM,EAIAlB,EAIA9B,GACIjB,KAAKiE,KAAOA,EACZjE,KAAK+C,OAASA,EACd/C,KAAKiB,KAAOA,EAKZjB,KAAKuQ,QAAU,KACfvQ,KAAK4O,OAAS3N,EAAKuP,MAAQvP,EAAKuP,MAAM3C,MAAM,KAAO,GACnD7N,KAAKwD,MAAQ4M,EAAUnP,EAAKuC,OAC5BxD,KAAK6J,aAAeA,EAAa7J,KAAKwD,OACtCxD,KAAKuK,aAAe,KACpBvK,KAAK0I,cAAgB,KACrB1I,KAAKkB,UAAYD,EAAK0M,QAAkB,QAAR1J,GAChCjE,KAAKlB,OAAiB,QAARmF,EAKlB,eAAiB,OAAQjE,KAAKkB,QAK9B,kBAAoB,OAAOlB,KAAKkB,SAAWlB,KAAK0I,cAIhD,aAAe,OAAO1I,KAAKuK,cAAgBsB,EAAajK,MAKxD,aAAe,OAAO5B,KAAKe,UAAYf,KAAKiB,KAAKwP,KAIjD,iBACI,OAAOzQ,KAAKiB,KAAKyP,aAAe1Q,KAAKiB,KAAK0P,KAAO,MAAQ,UAK7D,mBACI,IAAK,IAAI9N,KAAK7C,KAAKwD,MACf,GAAIxD,KAAKwD,MAAMX,GAAG+N,WACd,OAAO,EACf,OAAO,EAMX,kBAAkBzP,GACd,OAAOnB,MAAQmB,GAASnB,KAAKuK,aAAasG,WAAW1P,EAAMoJ,cAK/D,aAAa/G,GACT,OAAKA,GAASxD,KAAK6J,aACR7J,KAAK6J,aAELoG,EAAajQ,KAAKwD,MAAOA,GAUxC,OAAOA,EAAQ,KAAMvE,EAASmF,GAC1B,GAAIpE,KAAKlB,OACL,MAAM,IAAI2F,MAAM,8CACpB,OAAO,IAAI+E,EAAKxJ,KAAMA,KAAKiQ,aAAazM,GAAQzD,EAASE,KAAKhB,GAAU0E,EAAKmN,QAAQ1M,IAOzF,cAAcZ,EAAQ,KAAMvE,EAASmF,GAEjC,GADAnF,EAAUc,EAASE,KAAKhB,IACnBe,KAAKuH,aAAatI,GACnB,MAAM,IAAIkD,WAAW,4BAA8BnC,KAAKiE,MAC5D,OAAO,IAAIuF,EAAKxJ,KAAMA,KAAKiQ,aAAazM,GAAQvE,EAAS0E,EAAKmN,QAAQ1M,IAU1E,cAAcZ,EAAQ,KAAMvE,EAASmF,GAGjC,GAFAZ,EAAQxD,KAAKiQ,aAAazM,GAC1BvE,EAAUc,EAASE,KAAKhB,GACpBA,EAAQC,KAAM,CACd,IAAIkK,EAASpJ,KAAKuK,aAAawG,WAAW9R,GAC1C,IAAKmK,EACD,OAAO,KACXnK,EAAUmK,EAAO7D,OAAOtG,GAE5B,IAAI+R,EAAUhR,KAAKuK,aAAaC,cAAcvL,GAC1CmJ,EAAQ4I,GAAWA,EAAQD,WAAWhR,EAAS6B,OAAO,GAC1D,OAAKwG,EAEE,IAAIoB,EAAKxJ,KAAMwD,EAAOvE,EAAQsG,OAAO6C,GAAQzE,EAAKmN,QAAQ1M,IADtD,KAOf,aAAanF,GACT,IAAIyC,EAAS1B,KAAKuK,aAAaC,cAAcvL,GAC7C,IAAKyC,IAAWA,EAAOmJ,SACnB,OAAO,EACX,IAAK,IAAIrM,EAAI,EAAGA,EAAIS,EAAQR,WAAYD,IACpC,IAAKwB,KAAK8K,YAAY7L,EAAQN,MAAMH,GAAG4F,OACnC,OAAO,EACf,OAAO,EAKX,eAAe6M,GACX,OAAuB,MAAhBjR,KAAKuQ,SAAmBvQ,KAAKuQ,QAAQrD,QAAQ+D,IAAa,EAKrE,YAAY7M,GACR,GAAoB,MAAhBpE,KAAKuQ,QACL,OAAO,EACX,IAAK,IAAI/R,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,IAC9B,IAAKwB,KAAKkR,eAAe9M,EAAM5F,GAAGwC,MAC9B,OAAO,EACf,OAAO,EAKX,aAAaoD,GACT,GAAoB,MAAhBpE,KAAKuQ,QACL,OAAOnM,EACX,IAAIrC,EACJ,IAAK,IAAIvD,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,IACzBwB,KAAKkR,eAAe9M,EAAM5F,GAAGwC,MAIzBe,GACLA,EAAKN,KAAK2C,EAAM5F,IAJXuD,IACDA,EAAOqC,EAAMtD,MAAM,EAAGtC,IAMlC,OAAQuD,EAAeA,EAAKjC,OAASiC,EAAO4B,EAAKW,KAAlCF,EAKnB,eAAed,EAAOP,GAClB,IAAIrB,EAAS6H,OAAOlF,OAAO,MAC3Bf,EAAMmG,QAAQ,CAACxF,EAAMhD,IAASS,EAAOuC,GAAQ,IAAIqM,EAASrM,EAAMlB,EAAQ9B,IACxE,IAAIkQ,EAAUpO,EAAO9B,KAAKmQ,SAAW,MACrC,IAAK1P,EAAOyP,GACR,MAAM,IAAIhP,WAAW,yCAA2CgP,EAAU,MAC9E,IAAKzP,EAAO3C,KACR,MAAM,IAAIoD,WAAW,oCACzB,IAAK,IAAI+B,KAAKxC,EAAO3C,KAAKyE,MACtB,MAAM,IAAIrB,WAAW,iDACzB,OAAOT,GAIf,MAAM2O,EACF,YAAYgB,GACRrR,KAAK+P,WAAaxG,OAAO+B,UAAUgG,eAAeC,KAAKF,EAAS,WAChErR,KAAKgQ,QAAUqB,EAAQrB,QAE3B,iBACI,OAAQhQ,KAAK+P,YAUrB,MAAMyB,EAIF,YAIAvN,EAIAF,EAIAhB,EAIA9B,GACIjB,KAAKiE,KAAOA,EACZjE,KAAK+D,KAAOA,EACZ/D,KAAK+C,OAASA,EACd/C,KAAKiB,KAAOA,EACZjB,KAAKwD,MAAQ4M,EAAUnP,EAAKuC,OAC5BxD,KAAKyR,SAAW,KAChB,IAAI7B,EAAW/F,EAAa7J,KAAKwD,OACjCxD,KAAK0R,SAAW9B,EAAW,IAAIjM,EAAK3D,KAAM4P,GAAY,KAO1D,OAAOpM,EAAQ,MACX,OAAKA,GAASxD,KAAK0R,SACR1R,KAAK0R,SACT,IAAI/N,EAAK3D,KAAMiQ,EAAajQ,KAAKwD,MAAOA,IAKnD,eAAeY,EAAOrB,GAClB,IAAIrB,EAAS6H,OAAOlF,OAAO,MAAON,EAAO,EAEzC,OADAK,EAAMqF,QAAQ,CAACxF,EAAMhD,IAASS,EAAOuC,GAAQ,IAAIuN,EAASvN,EAAMF,IAAQhB,EAAQ9B,IACzES,EAMX,cAAckC,GACV,IAAK,IAAIpF,EAAI,EAAGA,EAAIoF,EAAI9D,OAAQtB,IACxBoF,EAAIpF,GAAGwC,MAAQhB,OACf4D,EAAMA,EAAI9C,MAAM,EAAGtC,GAAGwD,OAAO4B,EAAI9C,MAAMtC,EAAI,IAC3CA,KAER,OAAOoF,EAKX,QAAQA,GACJ,IAAK,IAAIpF,EAAI,EAAGA,EAAIoF,EAAI9D,OAAQtB,IAC5B,GAAIoF,EAAIpF,GAAGwC,MAAQhB,KACf,OAAO4D,EAAIpF,GAMvB,SAAS2C,GACL,OAAOnB,KAAKyR,SAASvE,QAAQ/L,IAAU,GAY/C,MAAMwQ,GAIF,YAAY1Q,GAMRjB,KAAKgJ,OAASO,OAAOlF,OAAO,MAC5BrE,KAAKiB,KAAO,CACRqC,MAAO,OAAWrD,KAAKgB,EAAKqC,OAC5Bc,MAAO,OAAWnE,KAAKgB,EAAKmD,OAAS,IACrCgN,QAASnQ,EAAKmQ,SAElBpR,KAAKsD,MAAQgN,EAASxB,QAAQ9O,KAAKiB,KAAKqC,MAAOtD,MAC/CA,KAAKoE,MAAQoN,EAAS1C,QAAQ9O,KAAKiB,KAAKmD,MAAOpE,MAC/C,IAAI4R,EAAmBrI,OAAOlF,OAAO,MACrC,IAAK,IAAIwN,KAAQ7R,KAAKsD,MAAO,CACzB,GAAIuO,KAAQ7R,KAAKoE,MACb,MAAM,IAAIjC,WAAW0P,EAAO,sCAChC,IAAI7Q,EAAOhB,KAAKsD,MAAMuO,GAAOC,EAAc9Q,EAAKC,KAAKhC,SAAW,GAAI8S,EAAW/Q,EAAKC,KAAKmD,MACzFpD,EAAKuJ,aAAeqH,EAAiBE,KAChCF,EAAiBE,GAAejG,EAAamG,MAAMF,EAAa9R,KAAKsD,QAC1EtC,EAAK0H,cAAgB1H,EAAKuJ,aAAa7B,cACvC1H,EAAKuP,QAAsB,KAAZwB,EAAkB,KAC7BA,EAAWE,GAAYjS,KAAM+R,EAASlE,MAAM,MAC5B,IAAZkE,GAAmB/Q,EAAK0H,cAAqB,KAAL,GAEpD,IAAK,IAAImJ,KAAQ7R,KAAKoE,MAAO,CACzB,IAAIpD,EAAOhB,KAAKoE,MAAMyN,GAAOK,EAAOlR,EAAKC,KAAK6C,SAC9C9C,EAAKyQ,SAAmB,MAARS,EAAe,CAAClR,GAAgB,IAARkR,EAAa,GAAKD,GAAYjS,KAAMkS,EAAKrE,MAAM,MAE3F7N,KAAKmD,aAAenD,KAAKmD,aAAagP,KAAKnS,MAC3CA,KAAKoL,aAAepL,KAAKoL,aAAa+G,KAAKnS,MAC3CA,KAAKoS,YAAcpS,KAAKsD,MAAMtD,KAAKiB,KAAKmQ,SAAW,OACnDpR,KAAKgJ,OAAOqJ,UAAY9I,OAAOlF,OAAO,MAQ1C,KAAKrD,EAAMwC,EAAQ,KAAMvE,EAASmF,GAC9B,GAAmB,iBAARpD,EACPA,EAAOhB,KAAKqL,SAASrK,OACpB,MAAMA,aAAgBsP,GACvB,MAAM,IAAInO,WAAW,sBAAwBnB,GAC5C,GAAIA,EAAK+B,QAAU/C,KACpB,MAAM,IAAImC,WAAW,yCAA2CnB,EAAKiD,KAAO,KAChF,OAAOjD,EAAKsR,cAAc9O,EAAOvE,EAASmF,GAM9C,KAAKrF,EAAMqF,GACP,IAAIpD,EAAOhB,KAAKsD,MAAMvE,KACtB,OAAO,IAAIyM,EAASxK,EAAMA,EAAK6I,aAAc9K,EAAM4E,EAAKmN,QAAQ1M,IAKpE,KAAKpD,EAAMwC,GAGP,MAFmB,iBAARxC,IACPA,EAAOhB,KAAKoE,MAAMpD,IACfA,EAAKqD,OAAOb,GAMvB,aAAaW,GACT,OAAOqF,EAAKxE,SAAShF,KAAMmE,GAM/B,aAAaA,GACT,OAAOR,EAAKqB,SAAShF,KAAMmE,GAK/B,SAASF,GACL,IAAI/B,EAAQlC,KAAKsD,MAAMW,GACvB,IAAK/B,EACD,MAAM,IAAIC,WAAW,sBAAwB8B,GACjD,OAAO/B,GAGf,SAAS+P,GAAYlP,EAAQqB,GACzB,IAAIlC,EAAQ,GACZ,IAAK,IAAI1D,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,IAAK,CACnC,IAAIyF,EAAOG,EAAM5F,GAAI+T,EAAOxP,EAAOqB,MAAMH,GAAOuO,EAAKD,EACrD,GAAIA,EACArQ,EAAMT,KAAK8Q,QAGX,IAAK,IAAIV,KAAQ9O,EAAOqB,MAAO,CAC3B,IAAImO,EAAOxP,EAAOqB,MAAMyN,IACZ,KAAR5N,GAAgBsO,EAAKtR,KAAKuP,OAAS+B,EAAKtR,KAAKuP,MAAM3C,MAAM,KAAKX,QAAQjJ,IAAS,IAC/E/B,EAAMT,KAAK+Q,EAAKD,GAG5B,IAAKC,EACD,MAAM,IAAIxE,YAAY,uBAAyB5J,EAAM5F,GAAK,KAElE,OAAO0D,EAQX,MAAMuQ,GAKF,YAIA1P,EAKA2P,GACI1S,KAAK+C,OAASA,EACd/C,KAAK0S,MAAQA,EAIb1S,KAAK2S,KAAO,GAIZ3S,KAAK4S,OAAS,GACdF,EAAMjJ,QAAQoJ,IACNA,EAAKC,IACL9S,KAAK2S,KAAKlR,KAAKoR,GACVA,EAAKE,OACV/S,KAAK4S,OAAOnR,KAAKoR,KAGzB7S,KAAKgT,gBAAkBhT,KAAK2S,KAAKM,KAAKC,IAClC,IAAK,aAAa1E,KAAK0E,EAAEJ,OAASI,EAAErS,KAChC,OAAO,EACX,IAAIA,EAAOkC,EAAOO,MAAM4P,EAAErS,MAC1B,OAAOA,EAAK0J,aAAaQ,UAAUlK,KAM3C,MAAMsS,EAAK9B,EAAU,IACjB,IAAI+B,EAAU,IAAIC,GAAarT,KAAMqR,GAAS,GAE9C,OADA+B,EAAQE,OAAOH,EAAK9B,EAAQpR,KAAMoR,EAAQnR,IACnCkT,EAAQG,SAUnB,WAAWJ,EAAK9B,EAAU,IACtB,IAAI+B,EAAU,IAAIC,GAAarT,KAAMqR,GAAS,GAE9C,OADA+B,EAAQE,OAAOH,EAAK9B,EAAQpR,KAAMoR,EAAQnR,IACnCwE,EAAM8O,QAAQJ,EAAQG,UAKjC,SAASJ,EAAKC,EAAShL,GACnB,IAAK,IAAI5J,EAAI4J,EAAQpI,KAAK2S,KAAKzF,QAAQ9E,GAAS,EAAI,EAAG5J,EAAIwB,KAAK2S,KAAK7S,OAAQtB,IAAK,CAC9E,IAAIqU,EAAO7S,KAAK2S,KAAKnU,GACrB,GAAIiV,GAAQN,EAAKN,EAAKC,YACEvH,IAAnBsH,EAAKa,WAA2BP,EAAIQ,cAAgBd,EAAKa,cACxDb,EAAKO,SAAWA,EAAQQ,eAAef,EAAKO,UAAW,CACzD,GAAIP,EAAKgB,SAAU,CACf,IAAInS,EAASmR,EAAKgB,SAASV,GAC3B,IAAe,IAAXzR,EACA,SACJmR,EAAKrP,MAAQ9B,QAAU6J,EAE3B,OAAOsH,IAOnB,WAAWhB,EAAM7O,EAAOoQ,EAAShL,GAC7B,IAAK,IAAI5J,EAAI4J,EAAQpI,KAAK4S,OAAO1F,QAAQ9E,GAAS,EAAI,EAAG5J,EAAIwB,KAAK4S,OAAO9S,OAAQtB,IAAK,CAClF,IAAIqU,EAAO7S,KAAK4S,OAAOpU,GAAIuU,EAAQF,EAAKE,MACxC,KAA2B,GAAvBA,EAAM7F,QAAQ2E,IACdgB,EAAKO,UAAYA,EAAQQ,eAAef,EAAKO,UAI7CL,EAAMjT,OAAS+R,EAAK/R,SACkB,IAAjCiT,EAAMe,WAAWjC,EAAK/R,SAAiBiT,EAAMjS,MAAM+Q,EAAK/R,OAAS,IAAMkD,IANhF,CAQA,GAAI6P,EAAKgB,SAAU,CACf,IAAInS,EAASmR,EAAKgB,SAAS7Q,GAC3B,IAAe,IAAXtB,EACA,SACJmR,EAAKrP,MAAQ9B,QAAU6J,EAE3B,OAAOsH,IAMf,mBAAmB9P,GACf,IAAIrB,EAAS,GACb,SAASgE,EAAOmN,GACZ,IAAIkB,EAA4B,MAAjBlB,EAAKkB,SAAmB,GAAKlB,EAAKkB,SAAUvV,EAAI,EAC/D,KAAOA,EAAIkD,EAAO5B,OAAQtB,IAAK,CAC3B,IAAI8J,EAAO5G,EAAOlD,GAAIwV,EAAgC,MAAjB1L,EAAKyL,SAAmB,GAAKzL,EAAKyL,SACvE,GAAIC,EAAeD,EACf,MAERrS,EAAOuS,OAAOzV,EAAG,EAAGqU,GAExB,IAAK,IAAI5O,KAAQlB,EAAOqB,MAAO,CAC3B,IAAIsO,EAAQ3P,EAAOqB,MAAMH,GAAMhD,KAAKiT,SAChCxB,GACAA,EAAMjJ,QAAQoJ,IACVnN,EAAOmN,EAAO9Q,GAAK8Q,IACnBA,EAAKN,KAAOtO,IAGxB,IAAK,IAAIA,KAAQlB,EAAOO,MAAO,CAC3B,IAAIoP,EAAQ3P,EAAOO,MAAMW,GAAMhD,KAAKiT,SAChCxB,GACAA,EAAMjJ,QAAQoJ,IACVnN,EAAOmN,EAAO9Q,GAAK8Q,IACnBA,EAAKhS,KAAOoD,IAGxB,OAAOvC,EAOX,kBAAkBqB,GACd,OAAOA,EAAOiG,OAAOmL,YAChBpR,EAAOiG,OAAOmL,UAAY,IAAI1B,GAAU1P,EAAQ0P,GAAU2B,YAAYrR,MAGnF,MAAMsR,GAAY,CACdC,SAAS,EAAMC,SAAS,EAAMC,OAAO,EAAMC,YAAY,EAAMC,QAAQ,EACrEC,IAAI,EAAMC,KAAK,EAAMC,IAAI,EAAMC,UAAU,EAAMC,YAAY,EAAMC,QAAQ,EACzEC,QAAQ,EAAMC,MAAM,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EACtEC,IAAI,EAAMC,QAAQ,EAAMC,QAAQ,EAAMC,IAAI,EAAMC,IAAI,EAAMC,UAAU,EAAMC,IAAI,EAC9EC,QAAQ,EAAM3T,GAAG,EAAM4T,KAAK,EAAMC,SAAS,EAAMC,OAAO,EAAMC,OAAO,EAAMC,IAAI,GAE7EC,GAAa,CACfC,MAAM,EAAMT,UAAU,EAAMU,QAAQ,EAAMC,QAAQ,EAAMzD,OAAO,EAAM0D,OAAO,GAE1EC,GAAW,CAAEZ,IAAI,EAAMM,IAAI,GAE3BO,GAAkB,EAAGC,GAAuB,EAAGC,GAAgB,EACrE,SAASC,GAAa9V,EAAM+V,EAAoBnL,GAC5C,OAA0B,MAAtBmL,GACQA,EAAqBJ,GAAkB,IACnB,SAAvBI,EAAgCH,GAAuB,GACzD5V,GAA2B,OAAnBA,EAAK0P,WAAsBiG,GAAkBC,GAAuBhL,GAAQiL,GAE/F,MAAMG,GACF,YAAYhW,EAAMwC,EAElBY,EAEA6S,EAAcC,EAAO5M,EAAO+G,GACxBrR,KAAKgB,KAAOA,EACZhB,KAAKwD,MAAQA,EACbxD,KAAKoE,MAAQA,EACbpE,KAAKiX,aAAeA,EACpBjX,KAAKkX,MAAQA,EACblX,KAAKqR,QAAUA,EACfrR,KAAKf,QAAU,GAEfe,KAAKmX,YAAcxT,EAAKW,KAExBtE,KAAKoX,WAAa,GAClBpX,KAAKsK,MAAQA,IAAU+G,EAAUwF,GAAgB,KAAO7V,EAAKuJ,cAEjE,aAAa1J,GACT,IAAKb,KAAKsK,MAAO,CACb,IAAKtK,KAAKgB,KACN,MAAO,GACX,IAAIqW,EAAOrX,KAAKgB,KAAKuJ,aAAawG,WAAWhR,EAASE,KAAKY,IAC3D,IAAIwW,EAGC,CACD,IAAoCC,EAAhC/W,EAAQP,KAAKgB,KAAKuJ,aACtB,OAAI+M,EAAO/W,EAAMgX,aAAa1W,EAAKG,QAC/BhB,KAAKsK,MAAQ/J,EACN+W,GAGA,KATXtX,KAAKsK,MAAQtK,KAAKgB,KAAKuJ,aAAaC,cAAc6M,GAa1D,OAAOrX,KAAKsK,MAAMiN,aAAa1W,EAAKG,MAExC,OAAO4D,GACH,KAAM5E,KAAKqR,QAAUsF,IAAkB,CACnC,IAAkDzL,EAA9C9J,EAAOpB,KAAKf,QAAQe,KAAKf,QAAQa,OAAS,GAC9C,GAAIsB,GAAQA,EAAKtC,SAAWoM,EAAI,oBAAoBsM,KAAKpW,EAAKrC,OAAQ,CAClE,IAAIA,EAAOqC,EACPA,EAAKrC,KAAKe,QAAUoL,EAAE,GAAGpL,OACzBE,KAAKf,QAAQ6O,MAEb9N,KAAKf,QAAQe,KAAKf,QAAQa,OAAS,GAAKf,EAAKyC,SAASzC,EAAKA,KAAK+B,MAAM,EAAG/B,EAAKA,KAAKe,OAASoL,EAAE,GAAGpL,UAG7G,IAAIb,EAAUc,EAASE,KAAKD,KAAKf,SAGjC,OAFK2F,GAAW5E,KAAKsK,QACjBrL,EAAUA,EAAQsG,OAAOvF,KAAKsK,MAAMyG,WAAWhR,EAAS6B,OAAO,KAC5D5B,KAAKgB,KAAOhB,KAAKgB,KAAKqD,OAAOrE,KAAKwD,MAAOvE,EAASe,KAAKoE,OAASnF,EAE3E,iBAAiBsT,GACb,IAAK,IAAI/T,EAAIwB,KAAKoX,WAAWtX,OAAS,EAAGtB,GAAK,EAAGA,IAC7C,GAAI+T,EAAKtQ,GAAGjC,KAAKoX,WAAW5Y,IACxB,OAAOwB,KAAKoX,WAAWnD,OAAOzV,EAAG,GAAG,GAEhD,aAAaiZ,GACT,IAAK,IAAIjZ,EAAI,EAAGkZ,EAAU1X,KAAKiX,aAAczY,EAAIkZ,EAAQ5X,OAAQtB,IAAK,CAClE,IAAI+T,EAAOmF,EAAQlZ,IACdwB,KAAKgB,KAAOhB,KAAKgB,KAAKkQ,eAAeqB,EAAKvR,MAAQ2W,GAAapF,EAAKvR,KAAMyW,MAC1ElF,EAAKrK,QAAQlI,KAAKmX,eACnBnX,KAAKmX,YAAc5E,EAAKtH,SAASjL,KAAKmX,aACtCnX,KAAKiX,aAAe1E,EAAKpK,cAAcnI,KAAKiX,gBAIxD,cAAcpW,GACV,OAAIb,KAAKgB,KACEhB,KAAKgB,KAAK0H,cACjB1I,KAAKf,QAAQa,OACNE,KAAKf,QAAQ,GAAGoJ,SACpBxH,EAAK+W,aAAevD,GAAU/C,eAAezQ,EAAK+W,WAAWC,SAASC,gBAGrF,MAAMzE,GACF,YAEA0E,EAEA1G,EAAS2G,GACLhY,KAAK+X,OAASA,EACd/X,KAAKqR,QAAUA,EACfrR,KAAKgY,OAASA,EACdhY,KAAKiY,KAAO,EACZ,IAA+BC,EAA3B9G,EAAUC,EAAQD,QAClB+G,EAAarB,GAAa,KAAMzF,EAAQ0F,mBAAoB,IAAMiB,EAASnB,GAAgB,GAE3FqB,EADA9G,EACa,IAAI4F,GAAY5F,EAAQpQ,KAAMoQ,EAAQ5N,MAAOG,EAAKW,KAAMX,EAAKW,MAAM,EAAM+M,EAAQ+G,UAAYhH,EAAQpQ,KAAKuJ,aAAc4N,GAExH,IAAInB,GADZgB,EACwB,KAEAD,EAAOhV,OAAOqP,YAFR,KAAMzO,EAAKW,KAAMX,EAAKW,MAAM,EAAM,KAAM6T,GAG/EnY,KAAKsD,MAAQ,CAAC4U,GACdlY,KAAKqY,KAAOhH,EAAQiH,cACpBtY,KAAKuY,YAAa,EAEtB,UACI,OAAOvY,KAAKsD,MAAMtD,KAAKiY,MAK3B,OAAO9E,GACH,GAAoB,GAAhBA,EAAI9H,SACJrL,KAAKwY,YAAYrF,QAEhB,GAAoB,GAAhBA,EAAI9H,SAAe,CACxB,IAAI0H,EAAQI,EAAIsF,aAAa,SACzBrU,EAAQ2O,EAAQ/S,KAAK0Y,WAAWC,GAAY5F,IAAU,KAAM6F,EAAM5Y,KAAK4Y,IAC3E,GAAa,MAATxU,EACA,IAAK,IAAI5F,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,IAC9BwB,KAAK6Y,eAAezU,EAAM5F,IAElC,GADAwB,KAAK8Y,WAAW3F,GACH,MAAT/O,EACA,IAAK,IAAI5F,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,IAC9BwB,KAAK+Y,kBAAkB3U,EAAM5F,GAAIoa,IAGjD,YAAYzF,GACR,IAAInQ,EAAQmQ,EAAI6F,UACZJ,EAAM5Y,KAAK4Y,IACf,GAAIA,EAAIvH,QAAUuF,IACdgC,EAAIK,cAAc9F,IAClB,mBAAmB3E,KAAKxL,GAAQ,CAChC,GAAM4V,EAAIvH,QAAUsF,GAkBhB3T,EAJO4V,EAAIvH,QAAUuF,GAIb5T,EAAM4C,QAAQ,SAAU,MAHxB5C,EAAM4C,QAAQ,YAAa,UAVnC,GAJA5C,EAAQA,EAAM4C,QAAQ,oBAAqB,KAIvC,mBAAmB4I,KAAKxL,IAAUhD,KAAKiY,MAAQjY,KAAKsD,MAAMxD,OAAS,EAAG,CACtE,IAAIwH,EAAasR,EAAI3Z,QAAQ2Z,EAAI3Z,QAAQa,OAAS,GAC9CoZ,EAAgB/F,EAAIgG,kBACnB7R,GACA4R,GAA2C,MAA1BA,EAAcrB,UAC/BvQ,EAAWxI,QAAU,mBAAmB0P,KAAKlH,EAAWvI,SACzDiE,EAAQA,EAAMlC,MAAM,IAS5BkC,GACAhD,KAAKoZ,WAAWpZ,KAAK+X,OAAOhV,OAAOhE,KAAKiE,IAC5ChD,KAAKqZ,WAAWlG,QAGhBnT,KAAKsZ,WAAWnG,GAKxB,WAAWA,EAAKoG,GACZ,IAAuCC,EAAnCvV,EAAOkP,EAAI0E,SAASC,cACpBpB,GAASpF,eAAerN,IAASjE,KAAK+X,OAAO/E,gBAC7CyG,GAActG,GAClB,IAAIN,EAAQ7S,KAAKqR,QAAQqI,cAAgB1Z,KAAKqR,QAAQqI,aAAavG,KAC9DqG,EAASxZ,KAAK+X,OAAO4B,SAASxG,EAAKnT,KAAMuZ,IAC9C,GAAI1G,EAAOA,EAAK+G,OAASvD,GAAW/E,eAAerN,GAC/CjE,KAAKsZ,WAAWnG,GAChBnT,KAAK6Z,eAAe1G,QAEnB,IAAKN,GAAQA,EAAKiH,MAAQjH,EAAKkH,YAAa,CACzClH,GAAQA,EAAKkH,YACb/Z,KAAKiY,KAAOrY,KAAKa,IAAI,EAAGT,KAAKiY,KAAO,GAC/BpF,GAAQA,EAAKiH,KAAKzO,WACvB8H,EAAMN,EAAKiH,MACf,IAAIE,EAAMpB,EAAM5Y,KAAK4Y,IAAKqB,EAAgBja,KAAKuY,WAC/C,GAAIlE,GAAU/C,eAAerN,GACzB+V,GAAO,EACFpB,EAAI5X,OACLhB,KAAKuY,YAAa,QAErB,IAAKpF,EAAI5R,WAEV,YADAvB,KAAKka,aAAa/G,GAGtBnT,KAAKsT,OAAOH,GACR6G,GACAha,KAAKga,KAAKpB,GACd5Y,KAAKuY,WAAa0B,OAGlBja,KAAKma,iBAAiBhH,EAAKN,GAAyB,IAAnBA,EAAKuH,UAAsBZ,OAASjO,GAI7E,aAAa4H,GACW,MAAhBA,EAAI0E,UAAoB7X,KAAK4Y,IAAI5X,MAAQhB,KAAK4Y,IAAI5X,KAAK0H,eACvD1I,KAAKwY,YAAYrF,EAAIkH,cAAcC,eAAe,OAG1D,eAAenH,GAES,MAAhBA,EAAI0E,UAAsB7X,KAAK4Y,IAAI5X,MAAShB,KAAK4Y,IAAI5X,KAAK0H,eAC1D1I,KAAKua,UAAUva,KAAK+X,OAAOhV,OAAOhE,KAAK,MAK/C,WAAW6T,GACP,IAAIxO,EAAQT,EAAKW,KACjByO,EAAO,IAAK,IAAIvU,EAAI,EAAGA,EAAIoU,EAAO9S,OAAQtB,GAAK,EAC3C,IAAK,IAAI4J,OAAQmD,IAAa,CAC1B,IAAIsH,EAAO7S,KAAK+X,OAAOyC,WAAW5H,EAAOpU,GAAIoU,EAAOpU,EAAI,GAAIwB,KAAMoI,GAClE,IAAKyK,EACD,SAASE,EACb,GAAIF,EAAK+G,OACL,OAAO,KAEX,GADAxV,EAAQpE,KAAK+X,OAAOhV,OAAOqB,MAAMyO,EAAKN,MAAMlO,OAAOwO,EAAKrP,OAAOyH,SAAS7G,IACjD,IAAnByO,EAAKuH,UAGL,MAFAhS,EAAQyK,EAKpB,OAAOzO,EAKX,iBAAiB+O,EAAKN,EAAM4H,GACxB,IAAIT,EAAM3O,EAAUkH,EACpB,GAAIM,EAAKhS,KACLwK,EAAWrL,KAAK+X,OAAOhV,OAAOO,MAAMuP,EAAKhS,MACpCwK,EAAStK,OAGJf,KAAKoZ,WAAW/N,EAAShH,OAAOwO,EAAKrP,SAC3CxD,KAAKka,aAAa/G,GAHlB6G,EAAOha,KAAK0a,MAAMrP,EAAUwH,EAAKrP,OAAS,KAAMqP,EAAKkE,wBAMxD,CACD,IAAI9F,EAAWjR,KAAK+X,OAAOhV,OAAOqB,MAAMyO,EAAKN,MAC7CA,EAAOtB,EAAS5M,OAAOwO,EAAKrP,OAC5BxD,KAAK6Y,eAAetG,GAExB,IAAIoI,EAAU3a,KAAK4Y,IACnB,GAAIvN,GAAYA,EAAStK,OACrBf,KAAKsZ,WAAWnG,QAEf,GAAIsH,EACLza,KAAK8Y,WAAW3F,EAAKsH,QAEpB,GAAI5H,EAAK+H,WACV5a,KAAKsZ,WAAWnG,GAChBN,EAAK+H,WAAWzH,EAAKnT,KAAK+X,OAAOhV,QAAQ0G,QAAQ5I,GAAQb,KAAKoZ,WAAWvY,QAExE,CACD,IAAIga,EAAa1H,EACiB,iBAAvBN,EAAKiI,eACZD,EAAa1H,EAAI4H,cAAclI,EAAKiI,gBACD,mBAAvBjI,EAAKiI,eACjBD,EAAahI,EAAKiI,eAAe3H,GAC5BN,EAAKiI,iBACVD,EAAahI,EAAKiI,gBACtB9a,KAAKgb,WAAW7H,EAAK0H,GAAY,GACjC7a,KAAKsT,OAAOuH,GAEZb,GAAQha,KAAKga,KAAKW,IAClB3a,KAAKiY,OACL1F,GACAvS,KAAK+Y,kBAAkBxG,EAAMoI,GAKrC,OAAOta,EAAQ6G,EAAYC,GACvB,IAAItF,EAAQqF,GAAc,EAC1B,IAAK,IAAIiM,EAAMjM,EAAa7G,EAAO4a,WAAW/T,GAAc7G,EAAOkB,WAAYjB,EAAkB,MAAZ6G,EAAmB,KAAO9G,EAAO4a,WAAW9T,GAAWgM,GAAO7S,EAAK6S,EAAMA,EAAI+H,cAAerZ,EAC7K7B,KAAKmb,YAAY9a,EAAQwB,GACzB7B,KAAKob,OAAOjI,GAEhBnT,KAAKmb,YAAY9a,EAAQwB,GAK7B,UAAUhB,GACN,IAAIwa,EAAOrB,EACX,IAAK,IAAIjU,EAAQ/F,KAAKiY,KAAMlS,GAAS,EAAGA,IAAS,CAC7C,IAAIuV,EAAKtb,KAAKsD,MAAMyC,GAChB7D,EAAQoZ,EAAG/D,aAAa1W,GAC5B,GAAIqB,KAAWmZ,GAASA,EAAMvb,OAASoC,EAAMpC,UACzCub,EAAQnZ,EACR8X,EAAOsB,GACFpZ,EAAMpC,QACP,MAER,GAAIwb,EAAGpE,MACH,MAER,IAAKmE,EACD,OAAO,EACXrb,KAAKga,KAAKA,GACV,IAAK,IAAIxb,EAAI,EAAGA,EAAI6c,EAAMvb,OAAQtB,IAC9BwB,KAAKub,WAAWF,EAAM7c,GAAI,MAAM,GACpC,OAAO,EAGX,WAAWqC,GACP,GAAIA,EAAKwH,UAAYrI,KAAKuY,aAAevY,KAAK4Y,IAAI5X,KAAM,CACpD,IAAIwa,EAAQxb,KAAKyb,uBACbD,GACAxb,KAAKub,WAAWC,GAExB,GAAIxb,KAAKua,UAAU1Z,GAAO,CACtBb,KAAK0b,aACL,IAAI9C,EAAM5Y,KAAK4Y,IACfA,EAAI+C,aAAa9a,EAAKG,MAClB4X,EAAItO,QACJsO,EAAItO,MAAQsO,EAAItO,MAAMS,UAAUlK,EAAKG,OACzC,IAAIoD,EAAQwU,EAAIzB,YAChB,IAAK,IAAI3Y,EAAI,EAAGA,EAAIqC,EAAKuD,MAAMtE,OAAQtB,IAC9Boa,EAAI5X,OAAQ4X,EAAI5X,KAAKkQ,eAAerQ,EAAKuD,MAAM5F,GAAGwC,QACnDoD,EAAQvD,EAAKuD,MAAM5F,GAAGyM,SAAS7G,IAEvC,OADAwU,EAAI3Z,QAAQwC,KAAKZ,EAAK0R,KAAKnO,KACpB,EAEX,OAAO,EAIX,MAAMpD,EAAMwC,EAAOoY,GACf,IAAIpJ,EAAKxS,KAAKua,UAAUvZ,EAAKqD,OAAOb,IAGpC,OAFIgP,GACAxS,KAAKub,WAAWva,EAAMwC,GAAO,EAAMoY,GAChCpJ,EAGX,WAAWxR,EAAMwC,EAAQ,KAAM0T,GAAQ,EAAO0E,GAC1C5b,KAAK0b,aACL,IAAI9C,EAAM5Y,KAAK4Y,IACfA,EAAI+C,aAAa3a,GACjB4X,EAAItO,MAAQsO,EAAItO,OAASsO,EAAItO,MAAMS,UAAU/J,GAC7C,IAAIqQ,EAAUyF,GAAa9V,EAAM4a,EAAYhD,EAAIvH,SAC5CuH,EAAIvH,QAAUwF,IAAwC,GAAtB+B,EAAI3Z,QAAQa,SAC7CuR,GAAWwF,IACf7W,KAAKsD,MAAM7B,KAAK,IAAIuV,GAAYhW,EAAMwC,EAAOoV,EAAIzB,YAAayB,EAAI3B,aAAcC,EAAO,KAAM7F,IAC7FrR,KAAKiY,OAIT,WAAWrT,GAAU,GACjB,IAAIpG,EAAIwB,KAAKsD,MAAMxD,OAAS,EAC5B,GAAItB,EAAIwB,KAAKiY,KAAM,CACf,KAAOzZ,EAAIwB,KAAKiY,KAAMzZ,IAClBwB,KAAKsD,MAAM9E,EAAI,GAAGS,QAAQwC,KAAKzB,KAAKsD,MAAM9E,GAAG+U,OAAO3O,IACxD5E,KAAKsD,MAAMxD,OAASE,KAAKiY,KAAO,GAGxC,SAGI,OAFAjY,KAAKiY,KAAO,EACZjY,KAAK0b,WAAW1b,KAAKgY,QACdhY,KAAKsD,MAAM,GAAGiQ,OAAOvT,KAAKgY,QAAUhY,KAAKqR,QAAQwK,SAE5D,KAAK3b,GACD,IAAK,IAAI1B,EAAIwB,KAAKiY,KAAMzZ,GAAK,EAAGA,IAC5B,GAAIwB,KAAKsD,MAAM9E,IAAM0B,EAEjB,OADAF,KAAKiY,KAAOzZ,GACL,EAEf,OAAO,EAEX,iBACIwB,KAAK0b,aACL,IAAInd,EAAM,EACV,IAAK,IAAIC,EAAIwB,KAAKiY,KAAMzZ,GAAK,EAAGA,IAAK,CACjC,IAAIS,EAAUe,KAAKsD,MAAM9E,GAAGS,QAC5B,IAAK,IAAID,EAAIC,EAAQa,OAAS,EAAGd,GAAK,EAAGA,IACrCT,GAAOU,EAAQD,GAAGI,SAClBZ,GACAD,IAER,OAAOA,EAEX,YAAY8B,EAAQoD,GAChB,GAAIzD,KAAKqY,KACL,IAAK,IAAI7Z,EAAI,EAAGA,EAAIwB,KAAKqY,KAAKvY,OAAQtB,IAC9BwB,KAAKqY,KAAK7Z,GAAGqC,MAAQR,GAAUL,KAAKqY,KAAK7Z,GAAGiF,QAAUA,IACtDzD,KAAKqY,KAAK7Z,GAAGD,IAAMyB,KAAK8b,YAGxC,WAAWzb,GACP,GAAIL,KAAKqY,KACL,IAAK,IAAI7Z,EAAI,EAAGA,EAAIwB,KAAKqY,KAAKvY,OAAQtB,IACV,MAApBwB,KAAKqY,KAAK7Z,GAAGD,KAAkC,GAAnB8B,EAAOgL,UAAiBhL,EAAO0b,SAAS/b,KAAKqY,KAAK7Z,GAAGqC,QACjFb,KAAKqY,KAAK7Z,GAAGD,IAAMyB,KAAK8b,YAGxC,WAAWzb,EAAQpB,EAASmK,GACxB,GAAI/I,GAAUpB,GAAWe,KAAKqY,KAC1B,IAAK,IAAI7Z,EAAI,EAAGA,EAAIwB,KAAKqY,KAAKvY,OAAQtB,IAClC,GAAwB,MAApBwB,KAAKqY,KAAK7Z,GAAGD,KAAkC,GAAnB8B,EAAOgL,UAAiBhL,EAAO0b,SAAS/b,KAAKqY,KAAK7Z,GAAGqC,MAAO,CACxF,IAAItC,EAAMU,EAAQ+c,wBAAwBhc,KAAKqY,KAAK7Z,GAAGqC,MACnDtC,GAAO6K,EAAS,EAAI,KACpBpJ,KAAKqY,KAAK7Z,GAAGD,IAAMyB,KAAK8b,aAI5C,WAAWG,GACP,GAAIjc,KAAKqY,KACL,IAAK,IAAI7Z,EAAI,EAAGA,EAAIwB,KAAKqY,KAAKvY,OAAQtB,IAC9BwB,KAAKqY,KAAK7Z,GAAGqC,MAAQob,IACrBjc,KAAKqY,KAAK7Z,GAAGD,IAAMyB,KAAK8b,YAAcG,EAASjD,UAAUlZ,OAASE,KAAKqY,KAAK7Z,GAAGiF,SAI/F,eAAe2P,GACX,GAAIA,EAAQlG,QAAQ,MAAQ,EACxB,OAAOkG,EAAQvF,MAAM,YAAYoF,KAAKjT,KAAK4T,eAAgB5T,MAC/D,IAAIkc,EAAQ9I,EAAQvF,MAAM,KACtBsO,EAASnc,KAAKqR,QAAQ+B,QACtBgJ,GAAWpc,KAAKgY,UAAYmE,GAAUA,EAAO9b,OAAOW,MAAQhB,KAAKsD,MAAM,GAAGtC,MAC1Eqb,IAAaF,EAASA,EAAOpW,MAAQ,EAAI,IAAMqW,EAAU,EAAI,GAC7D9R,EAAQ,CAAC9L,EAAGuH,KACZ,KAAOvH,GAAK,EAAGA,IAAK,CAChB,IAAI8d,EAAOJ,EAAM1d,GACjB,GAAY,IAAR8d,EAAY,CACZ,GAAI9d,GAAK0d,EAAMpc,OAAS,GAAU,GAALtB,EACzB,SACJ,KAAOuH,GAASsW,EAAUtW,IACtB,GAAIuE,EAAM9L,EAAI,EAAGuH,GACb,OAAO,EACf,OAAO,EAEN,CACD,IAAIuC,EAAOvC,EAAQ,GAAe,GAATA,GAAcqW,EAAWpc,KAAKsD,MAAMyC,GAAO/E,KAC9Dmb,GAAUpW,GAASsW,EAAWF,EAAOtb,KAAKkF,EAAQsW,GAAUrb,KACxD,KACV,IAAKsH,GAASA,EAAKrE,MAAQqY,IAAsC,GAA9BhU,EAAKsG,OAAO1B,QAAQoP,GACnD,OAAO,EACXvW,KAGR,OAAO,GAEX,OAAOuE,EAAM4R,EAAMpc,OAAS,EAAGE,KAAKiY,MAExC,uBACI,IAAIsE,EAAWvc,KAAKqR,QAAQ+B,QAC5B,GAAImJ,EACA,IAAK,IAAI9T,EAAI8T,EAASxW,MAAO0C,GAAK,EAAGA,IAAK,CACtC,IAAI+T,EAAQD,EAAS1b,KAAK4H,GAAGkC,eAAe4R,EAASlT,WAAWZ,IAAIgU,YACpE,GAAID,GAASA,EAAMtS,aAAesS,EAAM3S,aACpC,OAAO2S,EAEnB,IAAK,IAAIvY,KAAQjE,KAAK+X,OAAOhV,OAAOO,MAAO,CACvC,IAAItC,EAAOhB,KAAK+X,OAAOhV,OAAOO,MAAMW,GACpC,GAAIjD,EAAKkJ,aAAelJ,EAAK6I,aACzB,OAAO7I,GAGnB,eAAeuR,GACX,IAAIrQ,EAAQwa,GAAkBnK,EAAMvS,KAAK4Y,IAAI3B,cACzC/U,GACAlC,KAAK4Y,IAAIxB,WAAW3V,KAAKS,GAC7BlC,KAAK4Y,IAAI3B,aAAe1E,EAAKtH,SAASjL,KAAK4Y,IAAI3B,cAEnD,kBAAkB1E,EAAMoK,GACpB,IAAK,IAAI5W,EAAQ/F,KAAKiY,KAAMlS,GAAS,EAAGA,IAAS,CAC7C,IAAI6W,EAAQ5c,KAAKsD,MAAMyC,GACnB7D,EAAQ0a,EAAM3F,aAAa4F,YAAYtK,GAC3C,GAAIrQ,GAAS,EACT0a,EAAM3F,aAAe1E,EAAKpK,cAAcyU,EAAM3F,kBAE7C,CACD2F,EAAMzF,YAAc5E,EAAKpK,cAAcyU,EAAMzF,aAC7C,IAAI2F,EAAYF,EAAMG,iBAAiBxK,GACnCuK,GAAaF,EAAM5b,MAAQ4b,EAAM5b,KAAKkQ,eAAe4L,EAAU9b,QAC/D4b,EAAMzF,YAAc2F,EAAU7R,SAAS2R,EAAMzF,cAErD,GAAIyF,GAASD,EACT,QAOhB,SAASlD,GAActG,GACnB,IAAK,IAAIxU,EAAQwU,EAAI5R,WAAYyb,EAAW,KAAMre,EAAOA,EAAQA,EAAMuc,YAAa,CAChF,IAAIjX,EAAyB,GAAlBtF,EAAM0M,SAAgB1M,EAAMkZ,SAASC,cAAgB,KAC5D7T,GAAQyS,GAASpF,eAAerN,IAAS+Y,GACzCA,EAASC,YAAYte,GACrBA,EAAQqe,GAEK,MAAR/Y,EACL+Y,EAAWre,EAENsF,IACL+Y,EAAW,OAKvB,SAASvJ,GAAQN,EAAK+J,GAClB,OAAQ/J,EAAIM,SAAWN,EAAIgK,mBAAqBhK,EAAIiK,uBAAyBjK,EAAIkK,oBAAoB9L,KAAK4B,EAAK+J,GAGnH,SAASvE,GAAY5F,GACjB,IAAuC7H,EAAnCoS,EAAK,6BAAiC5b,EAAS,GACnD,MAAOwJ,EAAIoS,EAAG9F,KAAKzE,GACfrR,EAAOD,KAAKyJ,EAAE,GAAIA,EAAE,GAAGqS,QAC3B,OAAO7b,EAEX,SAASK,GAAKiC,GACV,IAAIjC,EAAO,GACX,IAAK,IAAI8P,KAAQ7N,EACbjC,EAAK8P,GAAQ7N,EAAI6N,GACrB,OAAO9P,EAKX,SAAS4V,GAAa1G,EAAU5F,GAC5B,IAAI/H,EAAQ+H,EAAStI,OAAOO,MAC5B,IAAK,IAAIW,KAAQX,EAAO,CACpB,IAAIjD,EAASiD,EAAMW,GACnB,IAAK5D,EAAO6Q,eAAeD,GACvB,SACJ,IAAIrE,EAAO,GAAIa,EAAQnD,IACnBsC,EAAKnL,KAAK6I,GACV,IAAK,IAAI9L,EAAI,EAAGA,EAAI8L,EAAMkT,UAAWhf,IAAK,CACtC,IAAI,KAAEwC,EAAI,KAAEsH,GAASgC,EAAMyE,KAAKvQ,GAChC,GAAIwC,GAAQqK,EACR,OAAO,EACX,GAAIuB,EAAKM,QAAQ5E,GAAQ,GAAKmF,EAAKnF,GAC/B,OAAO,IAGnB,GAAImF,EAAKpN,EAAOkK,cACZ,OAAO,GAGnB,SAASmS,GAAkBnK,EAAM3O,GAC7B,IAAK,IAAIpF,EAAI,EAAGA,EAAIoF,EAAI9D,OAAQtB,IAC5B,GAAI+T,EAAKtQ,GAAG2B,EAAIpF,IACZ,OAAOoF,EAAIpF,GAQvB,MAAMif,GAUF,YAIAna,EAIAc,GACIpE,KAAKsD,MAAQA,EACbtD,KAAKoE,MAAQA,EAQjB,kBAAkBS,EAAUwM,EAAU,GAAIvK,GACjCA,IACDA,EAAS+B,GAAIwI,GAASqM,0BAC1B,IAAI9E,EAAM9R,EAAQuG,EAAS,GA6B3B,OA5BAxI,EAAS4E,QAAQ5I,IACb,GAAIwM,EAAOvN,QAAUe,EAAKuD,MAAMtE,OAAQ,CACpC,IAAI6d,EAAO,EAAGC,EAAW,EACzB,MAAOD,EAAOtQ,EAAOvN,QAAU8d,EAAW/c,EAAKuD,MAAMtE,OAAQ,CACzD,IAAIwI,EAAOzH,EAAKuD,MAAMwZ,GACtB,GAAK5d,KAAKoE,MAAMkE,EAAKtH,KAAKiD,MAA1B,CAIA,IAAKqE,EAAKrG,GAAGoL,EAAOsQ,GAAM,MAAmC,IAA5BrV,EAAKtH,KAAKC,KAAK4c,SAC5C,MACJF,IACAC,SANIA,IAQR,MAAOD,EAAOtQ,EAAOvN,OACjB8Y,EAAMvL,EAAOS,MAAM,GACvB,MAAO8P,EAAW/c,EAAKuD,MAAMtE,OAAQ,CACjC,IAAIge,EAAMjd,EAAKuD,MAAMwZ,KACjBG,EAAU/d,KAAKge,cAAcF,EAAKjd,EAAKwH,SAAUgJ,GACjD0M,IACA1Q,EAAO5L,KAAK,CAACqc,EAAKlF,IAClBA,EAAIqE,YAAYc,EAAQ5K,KACxByF,EAAMmF,EAAQlD,YAAckD,EAAQ5K,MAIhDyF,EAAIqE,YAAYjd,KAAKie,mBAAmBpd,EAAMwQ,MAE3CvK,EAKX,mBAAmBjG,EAAMwQ,GACrB,IAAI,IAAE8B,EAAG,WAAE0H,GAAe4C,GAAcS,WAAWrV,GAAIwI,GAAUrR,KAAKsD,MAAMzC,EAAKG,KAAKiD,MAAMpD,IAC5F,GAAIga,EAAY,CACZ,GAAIha,EAAKE,OACL,MAAM,IAAIoB,WAAW,gDACzBnC,KAAKme,kBAAkBtd,EAAK5B,QAASoS,EAASwJ,GAElD,OAAO1H,EASX,cAActS,EAAMwQ,EAAU,IAC1B,IAAI8B,EAAMnT,KAAKie,mBAAmBpd,EAAMwQ,GACxC,IAAK,IAAI7S,EAAIqC,EAAKuD,MAAMtE,OAAS,EAAGtB,GAAK,EAAGA,IAAK,CAC7C,IAAI8Y,EAAOtX,KAAKge,cAAcnd,EAAKuD,MAAM5F,GAAIqC,EAAKwH,SAAUgJ,GACxDiG,KACCA,EAAKuD,YAAcvD,EAAKnE,KAAK8J,YAAY9J,GAC1CA,EAAMmE,EAAKnE,KAGnB,OAAOA,EAKX,cAAcZ,EAAM5E,EAAQ0D,EAAU,IAClC,IAAI+M,EAAQpe,KAAKoE,MAAMmO,EAAKvR,KAAKiD,MACjC,OAAOma,GAASX,GAAcS,WAAWrV,GAAIwI,GAAU+M,EAAM7L,EAAM5E,IAOvE,kBAAkB9E,EAAKwV,EAAWC,EAAQ,MACtC,GAAwB,iBAAbD,EACP,MAAO,CAAElL,IAAKtK,EAAIyR,eAAe+D,IACrC,GAA0B,MAAtBA,EAAUhT,SACV,MAAO,CAAE8H,IAAKkL,GAClB,GAAIA,EAAUlL,KAAiC,MAA1BkL,EAAUlL,IAAI9H,SAC/B,OAAOgT,EACX,IAKIxD,EALA0D,EAAUF,EAAU,GAAIG,EAAQD,EAAQrR,QAAQ,KAChDsR,EAAQ,IACRF,EAAQC,EAAQzd,MAAM,EAAG0d,GACzBD,EAAUA,EAAQzd,MAAM0d,EAAQ,IAGpC,IAAIrL,EAAOmL,EAAQzV,EAAI4V,gBAAgBH,EAAOC,GAAW1V,EAAI6V,cAAcH,GACvE/a,EAAQ6a,EAAU,GAAI9d,EAAQ,EAClC,GAAIiD,GAAyB,iBAATA,GAAuC,MAAlBA,EAAM6H,WAAqBpI,MAAMC,QAAQM,GAAQ,CACtFjD,EAAQ,EACR,IAAK,IAAI0D,KAAQT,EACb,GAAmB,MAAfA,EAAMS,GAAe,CACrB,IAAIua,EAAQva,EAAKiJ,QAAQ,KACrBsR,EAAQ,EACRrL,EAAIwL,eAAe1a,EAAKnD,MAAM,EAAG0d,GAAQva,EAAKnD,MAAM0d,EAAQ,GAAIhb,EAAMS,IAEtEkP,EAAIyL,aAAa3a,EAAMT,EAAMS,KAG7C,IAAK,IAAIzF,EAAI+B,EAAO/B,EAAI6f,EAAUve,OAAQtB,IAAK,CAC3C,IAAIG,EAAQ0f,EAAU7f,GACtB,GAAc,IAAVG,EAAa,CACb,GAAIH,EAAI6f,EAAUve,OAAS,GAAKtB,EAAI+B,EAChC,MAAM,IAAI4B,WAAW,0DACzB,MAAO,CAAEgR,MAAK0H,WAAY1H,GAEzB,CACD,IAAMA,IAAKhU,EAAO0b,WAAYgE,GAAiBpB,GAAcS,WAAWrV,EAAKlK,EAAO2f,GAEpF,GADAnL,EAAI8J,YAAY9d,GACZ0f,EAAc,CACd,GAAIhE,EACA,MAAM,IAAI1Y,WAAW,0BACzB0Y,EAAagE,IAIzB,MAAO,CAAE1L,MAAK0H,cAMlB,kBAAkB9X,GACd,OAAOA,EAAOiG,OAAO8V,gBAChB/b,EAAOiG,OAAO8V,cAAgB,IAAIrB,GAAczd,KAAK+e,gBAAgBhc,GAAS/C,KAAKgf,gBAAgBjc,KAM5G,uBAAuBA,GACnB,IAAIrB,EAASud,GAAYlc,EAAOO,OAGhC,OAFK5B,EAAO3C,OACR2C,EAAO3C,KAAO8B,GAAQA,EAAK9B,MACxB2C,EAKX,uBAAuBqB,GACnB,OAAOkc,GAAYlc,EAAOqB,QAGlC,SAAS6a,GAAYjb,GACjB,IAAItC,EAAS,GACb,IAAK,IAAIuC,KAAQD,EAAK,CAClB,IAAIoa,EAAQpa,EAAIC,GAAMhD,KAAKmd,MACvBA,IACA1c,EAAOuC,GAAQma,GAEvB,OAAO1c,EAEX,SAASmH,GAAIwI,GACT,OAAOA,EAAQ6N,UAAYC,OAAOD,W,oCCvyGtC,0QAGA,MAAME,EAAc7V,OAAOlF,OAAO,MAKlC,MAAMgb,EAMF,YAKAC,EAKAC,EAAOC,GACHxf,KAAKsf,QAAUA,EACftf,KAAKuf,MAAQA,EACbvf,KAAKwf,OAASA,GAAU,CAAC,IAAIC,EAAeH,EAAQzf,IAAI0f,GAAQD,EAAQ7e,IAAI8e,KAKhF,aAAe,OAAOvf,KAAKsf,QAAQ/gB,IAInC,WAAa,OAAOyB,KAAKuf,MAAMhhB,IAI/B,WAAa,OAAOyB,KAAK6F,MAAMtH,IAI/B,SAAW,OAAOyB,KAAK8F,IAAIvH,IAI3B,YACI,OAAOyB,KAAKwf,OAAO,GAAG3Z,MAK1B,UACI,OAAO7F,KAAKwf,OAAO,GAAG1Z,IAK1B,YACI,IAAI0Z,EAASxf,KAAKwf,OAClB,IAAK,IAAIhhB,EAAI,EAAGA,EAAIghB,EAAO1f,OAAQtB,IAC/B,GAAIghB,EAAOhhB,GAAGqH,MAAMtH,KAAOihB,EAAOhhB,GAAGsH,IAAIvH,IACrC,OAAO,EACf,OAAO,EAKX,UACI,OAAOyB,KAAK6F,MAAMgD,IAAI/H,MAAMd,KAAKC,KAAMD,KAAKE,IAAI,GAMpD,QAAQwf,EAAIzgB,EAAU,OAAM2C,OAIxB,IAAI+d,EAAW1gB,EAAQA,QAAQoC,UAAWue,EAAa,KACvD,IAAK,IAAIphB,EAAI,EAAGA,EAAIS,EAAQ2F,QAASpG,IACjCohB,EAAaD,EACbA,EAAWA,EAASte,UAExB,IAAIwe,EAAUH,EAAGI,MAAMhgB,OAAQ0f,EAASxf,KAAKwf,OAC7C,IAAK,IAAIhhB,EAAI,EAAGA,EAAIghB,EAAO1f,OAAQtB,IAAK,CACpC,IAAI,MAAEqH,EAAK,IAAEC,GAAQ0Z,EAAOhhB,GAAIuhB,EAAUL,EAAGK,QAAQjf,MAAM+e,GAC3DH,EAAGM,aAAaD,EAAQnd,IAAIiD,EAAMtH,KAAMwhB,EAAQnd,IAAIkD,EAAIvH,KAAMC,EAAI,OAAMoD,MAAQ3C,GACvE,GAALT,GACAyhB,EAAwBP,EAAIG,GAAUF,EAAWA,EAAStX,SAAWuX,GAAcA,EAAW1V,cAAgB,EAAI,IAO9H,YAAYwV,EAAI7e,GACZ,IAAIgf,EAAUH,EAAGI,MAAMhgB,OAAQ0f,EAASxf,KAAKwf,OAC7C,IAAK,IAAIhhB,EAAI,EAAGA,EAAIghB,EAAO1f,OAAQtB,IAAK,CACpC,IAAI,MAAEqH,EAAK,IAAEC,GAAQ0Z,EAAOhhB,GAAIuhB,EAAUL,EAAGK,QAAQjf,MAAM+e,GACvD5f,EAAO8f,EAAQnd,IAAIiD,EAAMtH,KAAM2B,EAAK6f,EAAQnd,IAAIkD,EAAIvH,KACpDC,EACAkhB,EAAGQ,YAAYjgB,EAAMC,IAGrBwf,EAAGS,iBAAiBlgB,EAAMC,EAAIW,GAC9Bof,EAAwBP,EAAIG,EAAShf,EAAKwH,UAAY,EAAI,KAWtE,gBAAgB+X,EAAMC,EAAKC,GAAW,GAClC,IAAInhB,EAAQihB,EAAK/f,OAAOqI,cAAgB,IAAI6X,EAAcH,GACpDI,EAAgBJ,EAAKvf,KAAK,GAAIuf,EAAK/f,OAAQ+f,EAAK7hB,IAAK6hB,EAAKve,QAASwe,EAAKC,GAC9E,GAAInhB,EACA,OAAOA,EACX,IAAK,IAAI4G,EAAQqa,EAAKra,MAAQ,EAAGA,GAAS,EAAGA,IAAS,CAClD,IAAI7D,EAAQme,EAAM,EACZG,EAAgBJ,EAAKvf,KAAK,GAAIuf,EAAKvf,KAAKkF,GAAQqa,EAAKhX,OAAOrD,EAAQ,GAAIqa,EAAKve,MAAMkE,GAAQsa,EAAKC,GAChGE,EAAgBJ,EAAKvf,KAAK,GAAIuf,EAAKvf,KAAKkF,GAAQqa,EAAKhY,MAAMrC,EAAQ,GAAIqa,EAAKve,MAAMkE,GAAS,EAAGsa,EAAKC,GACzG,GAAIpe,EACA,OAAOA,EAEf,OAAO,KAOX,YAAYke,EAAMK,EAAO,GACrB,OAAOzgB,KAAK0gB,SAASN,EAAMK,IAASzgB,KAAK0gB,SAASN,GAAOK,IAAS,IAAIE,EAAaP,EAAKvf,KAAK,IAQjG,eAAegI,GACX,OAAO2X,EAAgB3X,EAAKA,EAAK,EAAG,EAAG,IAAM,IAAI8X,EAAa9X,GAMlE,aAAaA,GACT,OAAO2X,EAAgB3X,EAAKA,EAAKA,EAAI5J,QAAQC,KAAM2J,EAAIpK,YAAa,IAAM,IAAIkiB,EAAa9X,GAM/F,gBAAgBA,EAAK1E,GACjB,IAAKA,IAASA,EAAKnD,KACf,MAAM,IAAImB,WAAW,wCACzB,IAAIye,EAAMxB,EAAYjb,EAAKnD,MAC3B,IAAK4f,EACD,MAAM,IAAIze,WAAW,qBAAqBgC,EAAKnD,gBACnD,OAAO4f,EAAI5b,SAAS6D,EAAK1E,GAQ7B,cAAc0c,EAAIC,GACd,GAAID,KAAMzB,EACN,MAAM,IAAIjd,WAAW,sCAAwC0e,GAGjE,OAFAzB,EAAYyB,GAAMC,EAClBA,EAAexV,UAAUyV,OAASF,EAC3BC,EAWX,cACI,OAAOP,EAAcS,QAAQhhB,KAAKsf,QAAStf,KAAKuf,OAAO0B,eAG/D5B,EAAU/T,UAAU4V,SAAU,EAI9B,MAAMzB,EAIF,YAIA5Z,EAIAC,GACI9F,KAAK6F,MAAQA,EACb7F,KAAK8F,IAAMA,GAGnB,IAAIqb,GAA2B,EAC/B,SAASC,EAAmBhB,GACnBe,GAA6Bf,EAAK/f,OAAOqI,gBAC1CyY,GAA2B,EAC3BE,QAAQ,QAAQ,wEAA0EjB,EAAK/f,OAAOW,KAAKiD,KAAO,MAS1H,MAAMsc,UAAsBlB,EAIxB,YAAYC,EAASC,EAAQD,GACzB8B,EAAmB9B,GACnB8B,EAAmB7B,GACnB9T,MAAM6T,EAASC,GAMnB,cAAgB,OAAOvf,KAAKsf,QAAQ/gB,KAAOyB,KAAKuf,MAAMhhB,IAAMyB,KAAKuf,MAAQ,KACzE,IAAI1W,EAAKkX,GACL,IAAIR,EAAQ1W,EAAIK,QAAQ6W,EAAQnd,IAAI5C,KAAKsW,OACzC,IAAKiJ,EAAMlf,OAAOqI,cACd,OAAO2W,EAAUiC,KAAK/B,GAC1B,IAAID,EAAUzW,EAAIK,QAAQ6W,EAAQnd,IAAI5C,KAAKuhB,SAC3C,OAAO,IAAIhB,EAAcjB,EAAQjf,OAAOqI,cAAgB4W,EAAUC,EAAOA,GAE7E,QAAQG,EAAIzgB,EAAU,OAAM2C,OAExB,GADA6J,MAAM7F,QAAQ8Z,EAAIzgB,GACdA,GAAW,OAAM2C,MAAO,CACxB,IAAIwC,EAAQpE,KAAK6F,MAAM2b,YAAYxhB,KAAK8F,KACpC1B,GACAsb,EAAG+B,YAAYrd,IAG3B,GAAGjD,GACC,OAAOA,aAAiBof,GAAiBpf,EAAMogB,QAAUvhB,KAAKuhB,QAAUpgB,EAAMmV,MAAQtW,KAAKsW,KAE/F,cACI,OAAO,IAAIoL,EAAa1hB,KAAKuhB,OAAQvhB,KAAKsW,MAE9C,SACI,MAAO,CAAEtV,KAAM,OAAQugB,OAAQvhB,KAAKuhB,OAAQjL,KAAMtW,KAAKsW,MAK3D,gBAAgBzN,EAAK1E,GACjB,GAA0B,iBAAfA,EAAKod,QAA0C,iBAAbpd,EAAKmS,KAC9C,MAAM,IAAInU,WAAW,4CACzB,OAAO,IAAIoe,EAAc1X,EAAIK,QAAQ/E,EAAKod,QAAS1Y,EAAIK,QAAQ/E,EAAKmS,OAKxE,cAAczN,EAAK0Y,EAAQjL,EAAOiL,GAC9B,IAAIjC,EAAUzW,EAAIK,QAAQqY,GAC1B,OAAO,IAAIvhB,KAAKsf,EAAShJ,GAAQiL,EAASjC,EAAUzW,EAAIK,QAAQoN,IAUpE,eAAegJ,EAASC,EAAOkB,GAC3B,IAAIkB,EAAOrC,EAAQ/gB,IAAMghB,EAAMhhB,IAG/B,GAFKkiB,IAAQkB,IACTlB,EAAOkB,GAAQ,EAAI,GAAK,IACvBpC,EAAMlf,OAAOqI,cAAe,CAC7B,IAAIxG,EAAQmd,EAAUqB,SAASnB,EAAOkB,GAAM,IAASpB,EAAUqB,SAASnB,GAAQkB,GAAM,GACtF,IAAIve,EAGA,OAAOmd,EAAUiC,KAAK/B,EAAOkB,GAF7BlB,EAAQrd,EAAMqd,MActB,OAVKD,EAAQjf,OAAOqI,gBACJ,GAARiZ,EACArC,EAAUC,GAGVD,GAAWD,EAAUqB,SAASpB,GAAUmB,GAAM,IAASpB,EAAUqB,SAASpB,EAASmB,GAAM,IAAOnB,QAC3FA,EAAQ/gB,IAAMghB,EAAMhhB,KAASojB,EAAO,IACrCrC,EAAUC,KAGf,IAAIgB,EAAcjB,EAASC,IAG1CF,EAAU0B,OAAO,OAAQR,GACzB,MAAMmB,EACF,YAAYH,EAAQjL,GAChBtW,KAAKuhB,OAASA,EACdvhB,KAAKsW,KAAOA,EAEhB,IAAIyJ,GACA,OAAO,IAAI2B,EAAa3B,EAAQnd,IAAI5C,KAAKuhB,QAASxB,EAAQnd,IAAI5C,KAAKsW,OAEvE,QAAQzN,GACJ,OAAO0X,EAAcS,QAAQnY,EAAIK,QAAQlJ,KAAKuhB,QAAS1Y,EAAIK,QAAQlJ,KAAKsW,QAUhF,MAAMsL,UAAsBvC,EAKxB,YAAYe,GACR,IAAIvf,EAAOuf,EAAK/Y,UACZJ,EAAOmZ,EAAKvf,KAAK,GAAGqI,QAAQkX,EAAK7hB,IAAMsC,EAAKzB,UAChDqM,MAAM2U,EAAMnZ,GACZjH,KAAKa,KAAOA,EAEhB,IAAIgI,EAAKkX,GACL,IAAI,QAAE8B,EAAO,IAAEtjB,GAAQwhB,EAAQ+B,UAAU9hB,KAAKuhB,QAC1CnB,EAAOvX,EAAIK,QAAQ3K,GACvB,OAAIsjB,EACOxC,EAAUiC,KAAKlB,GACnB,IAAIwB,EAAcxB,GAE7B,UACI,OAAO,IAAI,OAAM,OAASngB,KAAKD,KAAKa,MAAO,EAAG,GAElD,GAAGM,GACC,OAAOA,aAAiBygB,GAAiBzgB,EAAMogB,QAAUvhB,KAAKuhB,OAElE,SACI,MAAO,CAAEvgB,KAAM,OAAQugB,OAAQvhB,KAAKuhB,QAExC,cAAgB,OAAO,IAAIQ,EAAa/hB,KAAKuhB,QAI7C,gBAAgB1Y,EAAK1E,GACjB,GAA0B,iBAAfA,EAAKod,OACZ,MAAM,IAAIpf,WAAW,4CACzB,OAAO,IAAIyf,EAAc/Y,EAAIK,QAAQ/E,EAAKod,SAK9C,cAAc1Y,EAAK5I,GACf,OAAO,IAAI2hB,EAAc/Y,EAAIK,QAAQjJ,IAMzC,oBAAoBY,GAChB,OAAQA,EAAK/B,SAAwC,IAA9B+B,EAAKG,KAAKC,KAAK+gB,YAG9CJ,EAActW,UAAU4V,SAAU,EAClC7B,EAAU0B,OAAO,OAAQa,GACzB,MAAMG,EACF,YAAYR,GACRvhB,KAAKuhB,OAASA,EAElB,IAAIxB,GACA,IAAI,QAAE8B,EAAO,IAAEtjB,GAAQwhB,EAAQ+B,UAAU9hB,KAAKuhB,QAC9C,OAAOM,EAAU,IAAIH,EAAanjB,EAAKA,GAAO,IAAIwjB,EAAaxjB,GAEnE,QAAQsK,GACJ,IAAIuX,EAAOvX,EAAIK,QAAQlJ,KAAKuhB,QAAS1gB,EAAOuf,EAAK/Y,UACjD,OAAIxG,GAAQ+gB,EAAcK,aAAaphB,GAC5B,IAAI+gB,EAAcxB,GACtBf,EAAUiC,KAAKlB,IAS9B,MAAMO,UAAqBtB,EAIvB,YAAYxW,GACR4C,MAAM5C,EAAIK,QAAQ,GAAIL,EAAIK,QAAQL,EAAI5J,QAAQC,OAElD,QAAQwgB,EAAIzgB,EAAU,OAAM2C,OACxB,GAAI3C,GAAW,OAAM2C,MAAO,CACxB8d,EAAGwC,OAAO,EAAGxC,EAAG7W,IAAI5J,QAAQC,MAC5B,IAAIijB,EAAM9C,EAAU+C,QAAQ1C,EAAG7W,KAC1BsZ,EAAIlgB,GAAGyd,EAAG2C,YACX3C,EAAG4C,aAAaH,QAGpB1W,MAAM7F,QAAQ8Z,EAAIzgB,GAG1B,SAAW,MAAO,CAAE+B,KAAM,OAI1B,gBAAgB6H,GAAO,OAAO,IAAI8X,EAAa9X,GAC/C,IAAIA,GAAO,OAAO,IAAI8X,EAAa9X,GACnC,GAAG1H,GAAS,OAAOA,aAAiBwf,EACpC,cAAgB,OAAO4B,GAE3BlD,EAAU0B,OAAO,MAAOJ,GACxB,MAAM4B,EAAc,CAChB,MAAQ,OAAOviB,MACf,QAAQ6I,GAAO,OAAO,IAAI8X,EAAa9X,KAM3C,SAAS2X,EAAgB3X,EAAKhI,EAAMtC,EAAKsD,EAAOwe,EAAKthB,GAAO,GACxD,GAAI8B,EAAK6H,cACL,OAAO6X,EAAclc,OAAOwE,EAAKtK,GACrC,IAAK,IAAIC,EAAIqD,GAASwe,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAI7hB,EAAIqC,EAAKpC,WAAaD,GAAK,EAAGA,GAAK6hB,EAAK,CACtF,IAAI1hB,EAAQkC,EAAKlC,MAAMH,GACvB,GAAKG,EAAMwL,QAKN,IAAKpL,GAAQ6iB,EAAcK,aAAatjB,GACzC,OAAOijB,EAAcvd,OAAOwE,EAAKtK,GAAO8hB,EAAM,EAAI1hB,EAAMS,SAAW,QANpD,CACf,IAAID,EAAQqhB,EAAgB3X,EAAKlK,EAAOJ,EAAM8hB,EAAKA,EAAM,EAAI1hB,EAAMF,WAAa,EAAG4hB,EAAKthB,GACxF,GAAII,EACA,OAAOA,EAKfZ,GAAOI,EAAMS,SAAWihB,EAE5B,OAAO,KAEX,SAASJ,EAAwBP,EAAI8C,EAAU/B,GAC3C,IAAIrf,EAAOse,EAAGI,MAAMhgB,OAAS,EAC7B,GAAIsB,EAAOohB,EACP,OACJ,IAAIC,EAAO/C,EAAGI,MAAM1e,GACpB,KAAMqhB,aAAgB,QAAeA,aAAgB,QACjD,OACJ,IAAiCniB,EAA7BsC,EAAM8c,EAAGK,QAAQ2C,KAAKthB,GAC1BwB,EAAI6G,QAAQ,CAACkZ,EAAOC,EAAKC,EAAUC,KAAuB,MAAPxiB,IAC/CA,EAAMwiB,KACVpD,EAAG4C,aAAajD,EAAUiC,KAAK5B,EAAG7W,IAAIK,QAAQ5I,GAAMmgB,IAGxD,MAAMsC,EAAc,EAAGC,EAAgB,EAAGC,EAAiB,EAoB3D,MAAMC,UAAoB,OAItB,YAAYzT,GACRhE,MAAMgE,EAAM5G,KAEZ7I,KAAKmjB,gBAAkB,EAGvBnjB,KAAKojB,QAAU,EAEfpjB,KAAKqjB,KAAO9Z,OAAOlF,OAAO,MAC1BrE,KAAKsjB,KAAOC,KAAKC,MACjBxjB,KAAKyjB,aAAehU,EAAM4S,UAC1BriB,KAAK0jB,YAAcjU,EAAMiU,YAQ7B,gBAKI,OAJI1jB,KAAKmjB,gBAAkBnjB,KAAK8f,MAAMhgB,SAClCE,KAAKyjB,aAAezjB,KAAKyjB,aAAa7gB,IAAI5C,KAAK6I,IAAK7I,KAAK+f,QAAQjf,MAAMd,KAAKmjB,kBAC5EnjB,KAAKmjB,gBAAkBnjB,KAAK8f,MAAMhgB,QAE/BE,KAAKyjB,aAMhB,aAAapB,GACT,GAAIA,EAAUxc,MAAMgD,KAAO7I,KAAK6I,IAC5B,MAAM,IAAI1G,WAAW,uEAKzB,OAJAnC,KAAKyjB,aAAepB,EACpBriB,KAAKmjB,gBAAkBnjB,KAAK8f,MAAMhgB,OAClCE,KAAKojB,SAAWpjB,KAAKojB,QAAUL,IAAgBC,EAC/ChjB,KAAK0jB,YAAc,KACZ1jB,KAKX,mBACI,OAAQA,KAAKojB,QAAUL,GAAe,EAK1C,eAAe3e,GAGX,OAFApE,KAAK0jB,YAActf,EACnBpE,KAAKojB,SAAWJ,EACThjB,KAOX,YAAYoE,GAGR,OAFK,OAAK0F,QAAQ9J,KAAK0jB,aAAe1jB,KAAKqiB,UAAUxc,MAAMzB,QAASA,IAChEpE,KAAK2jB,eAAevf,GACjBpE,KAKX,cAAcuS,GACV,OAAOvS,KAAKyhB,YAAYlP,EAAKtH,SAASjL,KAAK0jB,aAAe1jB,KAAKqiB,UAAU9C,MAAMnb,UAKnF,iBAAiBmO,GACb,OAAOvS,KAAKyhB,YAAYlP,EAAKpK,cAAcnI,KAAK0jB,aAAe1jB,KAAKqiB,UAAU9C,MAAMnb,UAKxF,qBACI,OAAQpE,KAAKojB,QAAUJ,GAAiB,EAK5C,QAAQP,EAAM5Z,GACV4C,MAAMmY,QAAQnB,EAAM5Z,GACpB7I,KAAKojB,QAAUpjB,KAAKojB,SAAWJ,EAC/BhjB,KAAK0jB,YAAc,KAKvB,QAAQJ,GAEJ,OADAtjB,KAAKsjB,KAAOA,EACLtjB,KAKX,iBAAiBc,GAEb,OADAd,KAAKqiB,UAAUzc,QAAQ5F,KAAMc,GACtBd,KAOX,qBAAqBa,EAAMgjB,GAAe,GACtC,IAAIxB,EAAYriB,KAAKqiB,UAIrB,OAHIwB,IACAhjB,EAAOA,EAAK0R,KAAKvS,KAAK0jB,cAAgBrB,EAAUzgB,MAAQygB,EAAUxc,MAAMzB,QAAWie,EAAUxc,MAAM2b,YAAYa,EAAUvc,MAAQ,OAAKxB,QAC1I+d,EAAUyB,YAAY9jB,KAAMa,GACrBb,KAKX,kBAEI,OADAA,KAAKqiB,UAAUzc,QAAQ5F,MAChBA,KAMX,WAAWjB,EAAMkB,EAAMC,GACnB,IAAI6C,EAAS/C,KAAK6I,IAAI7H,KAAK+B,OAC3B,GAAY,MAAR9C,EACA,OAAKlB,EAEEiB,KAAK+jB,qBAAqBhhB,EAAOhE,KAAKA,IAAO,GADzCiB,KAAKgkB,kBAGf,CAID,GAHU,MAAN9jB,IACAA,EAAKD,GACTC,EAAW,MAANA,EAAaD,EAAOC,GACpBnB,EACD,OAAOiB,KAAKkgB,YAAYjgB,EAAMC,GAClC,IAAIkE,EAAQpE,KAAK0jB,YACjB,IAAKtf,EAAO,CACR,IAAIyB,EAAQ7F,KAAK6I,IAAIK,QAAQjJ,GAC7BmE,EAAQlE,GAAMD,EAAO4F,EAAMzB,QAAUyB,EAAM2b,YAAYxhB,KAAK6I,IAAIK,QAAQhJ,IAK5E,OAHAF,KAAKmgB,iBAAiBlgB,EAAMC,EAAI6C,EAAOhE,KAAKA,EAAMqF,IAC7CpE,KAAKqiB,UAAUzgB,OAChB5B,KAAKsiB,aAAajD,EAAUiC,KAAKthB,KAAKqiB,UAAUvc,MAC7C9F,MAOf,QAAQikB,EAAKjhB,GAET,OADAhD,KAAKqjB,KAAmB,iBAAPY,EAAkBA,EAAMA,EAAIA,KAAOjhB,EAC7ChD,KAKX,QAAQikB,GACJ,OAAOjkB,KAAKqjB,KAAmB,iBAAPY,EAAkBA,EAAMA,EAAIA,KAMxD,gBACI,IAAK,IAAI/f,KAAKlE,KAAKqjB,KACf,OAAO,EACX,OAAO,EAMX,iBAEI,OADArjB,KAAKojB,SAAWH,EACTjjB,KAKX,uBACI,OAAQA,KAAKojB,QAAUH,GAAkB,GAIjD,SAAS9Q,EAAKhS,EAAG+jB,GACb,OAAQA,GAAS/jB,EAAQA,EAAEgS,KAAK+R,GAAX/jB,EAEzB,MAAMgkB,EACF,YAAYlgB,EAAMmgB,EAAMF,GACpBlkB,KAAKiE,KAAOA,EACZjE,KAAKqkB,KAAOlS,EAAKiS,EAAKC,KAAMH,GAC5BlkB,KAAKskB,MAAQnS,EAAKiS,EAAKE,MAAOJ,IAGtC,MAAMK,EAAa,CACf,IAAIJ,EAAU,MAAO,CACjB,KAAKK,GAAU,OAAOA,EAAO3b,KAAO2b,EAAOzhB,OAAOqP,YAAYnF,iBAC9D,MAAMyS,GAAM,OAAOA,EAAG7W,OAE1B,IAAIsb,EAAU,YAAa,CACvB,KAAKK,EAAQ9S,GAAY,OAAO8S,EAAOnC,WAAahD,EAAU+C,QAAQ1Q,EAAS7I,MAC/E,MAAM6W,GAAM,OAAOA,EAAG2C,aAE1B,IAAI8B,EAAU,cAAe,CACzB,KAAKK,GAAU,OAAOA,EAAOd,aAAe,MAC5C,MAAMhE,EAAI+E,EAAQC,EAAMjV,GAAS,OAAOA,EAAM4S,UAAUsC,QAAUjF,EAAGgE,YAAc,QAEvF,IAAIS,EAAU,oBAAqB,CAC/B,OAAS,OAAO,GAChB,MAAMzE,EAAIkF,GAAQ,OAAOlF,EAAGmF,iBAAmBD,EAAO,EAAIA,MAKlE,MAAME,EACF,YAAY/hB,EAAQgiB,GAChB/kB,KAAK+C,OAASA,EACd/C,KAAK+kB,QAAU,GACf/kB,KAAKglB,aAAezb,OAAOlF,OAAO,MAClCrE,KAAKilB,OAASV,EAAWzjB,QACrBikB,GACAA,EAAQtb,QAAQyb,IACZ,GAAIllB,KAAKglB,aAAaE,EAAOjB,KACzB,MAAM,IAAI9hB,WAAW,iDAAmD+iB,EAAOjB,IAAM,KACzFjkB,KAAK+kB,QAAQtjB,KAAKyjB,GAClBllB,KAAKglB,aAAaE,EAAOjB,KAAOiB,EAC5BA,EAAOjkB,KAAKwO,OACZzP,KAAKilB,OAAOxjB,KAAK,IAAI0iB,EAAUe,EAAOjB,IAAKiB,EAAOjkB,KAAKwO,MAAOyV,OAalF,MAAMC,EAIF,YAIAX,GACIxkB,KAAKwkB,OAASA,EAKlB,aACI,OAAOxkB,KAAKwkB,OAAOzhB,OAKvB,cACI,OAAO/C,KAAKwkB,OAAOO,QAKvB,MAAMrF,GACF,OAAO1f,KAAKolB,iBAAiB1F,GAAIjQ,MAKrC,kBAAkBiQ,EAAI9F,GAAS,GAC3B,IAAK,IAAIpb,EAAI,EAAGA,EAAIwB,KAAKwkB,OAAOO,QAAQjlB,OAAQtB,IAC5C,GAAIA,GAAKob,EAAQ,CACb,IAAIsL,EAASllB,KAAKwkB,OAAOO,QAAQvmB,GACjC,GAAI0mB,EAAOjkB,KAAKokB,oBAAsBH,EAAOjkB,KAAKokB,kBAAkB9T,KAAK2T,EAAQxF,EAAI1f,MACjF,OAAO,EAEnB,OAAO,EASX,iBAAiBslB,GACb,IAAKtlB,KAAKqlB,kBAAkBC,GACxB,MAAO,CAAE7V,MAAOzP,KAAMulB,aAAc,IACxC,IAAIC,EAAM,CAACF,GAASG,EAAWzlB,KAAK0lB,WAAWJ,GAAS1Y,EAAO,KAI/D,OAAS,CACL,IAAI+Y,GAAU,EACd,IAAK,IAAInnB,EAAI,EAAGA,EAAIwB,KAAKwkB,OAAOO,QAAQjlB,OAAQtB,IAAK,CACjD,IAAI0mB,EAASllB,KAAKwkB,OAAOO,QAAQvmB,GACjC,GAAI0mB,EAAOjkB,KAAK2kB,kBAAmB,CAC/B,IAAI/iB,EAAI+J,EAAOA,EAAKpO,GAAGqE,EAAI,EAAGgjB,EAAWjZ,EAAOA,EAAKpO,GAAGiR,MAAQzP,KAC5D0f,EAAK7c,EAAI2iB,EAAI1lB,QACbolB,EAAOjkB,KAAK2kB,kBAAkBrU,KAAK2T,EAAQriB,EAAI2iB,EAAI1kB,MAAM+B,GAAK2iB,EAAKK,EAAUJ,GACjF,GAAI/F,GAAM+F,EAASJ,kBAAkB3F,EAAIlhB,GAAI,CAEzC,GADAkhB,EAAGoG,QAAQ,sBAAuBR,IAC7B1Y,EAAM,CACPA,EAAO,GACP,IAAK,IAAI5N,EAAI,EAAGA,EAAIgB,KAAKwkB,OAAOO,QAAQjlB,OAAQd,IAC5C4N,EAAKnL,KAAKzC,EAAIR,EAAI,CAAEiR,MAAOgW,EAAU5iB,EAAG2iB,EAAI1lB,QAAW,CAAE2P,MAAOzP,KAAM6C,EAAG,IAEjF2iB,EAAI/jB,KAAKie,GACT+F,EAAWA,EAASC,WAAWhG,GAC/BiG,GAAU,EAEV/Y,IACAA,EAAKpO,GAAK,CAAEiR,MAAOgW,EAAU5iB,EAAG2iB,EAAI1lB,UAGhD,IAAK6lB,EACD,MAAO,CAAElW,MAAOgW,EAAUF,aAAcC,IAMpD,WAAW9F,GACP,IAAKA,EAAGtW,OAAOnH,GAAGjC,KAAK6I,KACnB,MAAM,IAAI1G,WAAW,qCACzB,IAAI4jB,EAAc,IAAIZ,EAAYnlB,KAAKwkB,QAASS,EAASjlB,KAAKwkB,OAAOS,OACrE,IAAK,IAAIzmB,EAAI,EAAGA,EAAIymB,EAAOnlB,OAAQtB,IAAK,CACpC,IAAIwnB,EAAQf,EAAOzmB,GACnBunB,EAAYC,EAAM/hB,MAAQ+hB,EAAM1B,MAAM5E,EAAI1f,KAAKgmB,EAAM/hB,MAAOjE,KAAM+lB,GAEtE,OAAOA,EAKX,SAAW,OAAO,IAAI7C,EAAYljB,MAIlC,cAAcwkB,GACV,IAAIyB,EAAU,IAAInB,EAAcN,EAAO3b,IAAM2b,EAAO3b,IAAI7H,KAAK+B,OAASyhB,EAAOzhB,OAAQyhB,EAAOO,SACxFrT,EAAW,IAAIyT,EAAYc,GAC/B,IAAK,IAAIznB,EAAI,EAAGA,EAAIynB,EAAQhB,OAAOnlB,OAAQtB,IACvCkT,EAASuU,EAAQhB,OAAOzmB,GAAGyF,MAAQgiB,EAAQhB,OAAOzmB,GAAG6lB,KAAKG,EAAQ9S,GACtE,OAAOA,EAUX,YAAY8S,GACR,IAAIyB,EAAU,IAAInB,EAAc9kB,KAAK+C,OAAQyhB,EAAOO,SAChDE,EAASgB,EAAQhB,OAAQvT,EAAW,IAAIyT,EAAYc,GACxD,IAAK,IAAIznB,EAAI,EAAGA,EAAIymB,EAAOnlB,OAAQtB,IAAK,CACpC,IAAIyF,EAAOghB,EAAOzmB,GAAGyF,KACrByN,EAASzN,GAAQjE,KAAKsR,eAAerN,GAAQjE,KAAKiE,GAAQghB,EAAOzmB,GAAG6lB,KAAKG,EAAQ9S,GAErF,OAAOA,EASX,OAAOwU,GACH,IAAIxkB,EAAS,CAAEmH,IAAK7I,KAAK6I,IAAI/F,SAAUuf,UAAWriB,KAAKqiB,UAAUvf,UAGjE,GAFI9C,KAAK0jB,cACLhiB,EAAOgiB,YAAc1jB,KAAK0jB,YAAY9gB,IAAIsI,GAAKA,EAAEpI,WACjDojB,GAAuC,iBAAhBA,EACvB,IAAK,IAAIrU,KAAQqU,EAAc,CAC3B,GAAY,OAARrU,GAAyB,aAARA,EACjB,MAAM,IAAI1P,WAAW,sDACzB,IAAI+iB,EAASgB,EAAarU,GAAOpC,EAAQyV,EAAOjkB,KAAKwO,MACjDA,GAASA,EAAM3M,SACfpB,EAAOmQ,GAAQpC,EAAM3M,OAAOyO,KAAK2T,EAAQllB,KAAKklB,EAAOjB,OAEjE,OAAOviB,EASX,gBAAgB8iB,EAAQrgB,EAAM+hB,GAC1B,IAAK/hB,EACD,MAAM,IAAIhC,WAAW,0CACzB,IAAKqiB,EAAOzhB,OACR,MAAM,IAAIZ,WAAW,0CACzB,IAAI8jB,EAAU,IAAInB,EAAcN,EAAOzhB,OAAQyhB,EAAOO,SAClDrT,EAAW,IAAIyT,EAAYc,GAyB/B,OAxBAA,EAAQhB,OAAOxb,QAAQuc,IACnB,GAAkB,OAAdA,EAAM/hB,KACNyN,EAAS7I,IAAM,OAAK7D,SAASwf,EAAOzhB,OAAQoB,EAAK0E,UAEhD,GAAkB,aAAdmd,EAAM/hB,KACXyN,EAAS2Q,UAAYhD,EAAUra,SAAS0M,EAAS7I,IAAK1E,EAAKke,gBAE1D,GAAkB,eAAd2D,EAAM/hB,KACPE,EAAKuf,cACLhS,EAASgS,YAAcvf,EAAKuf,YAAY9gB,IAAI4hB,EAAOzhB,OAAOqI,mBAE7D,CACD,GAAI8a,EACA,IAAK,IAAIrU,KAAQqU,EAAc,CAC3B,IAAIhB,EAASgB,EAAarU,GAAOpC,EAAQyV,EAAOjkB,KAAKwO,MACrD,GAAIyV,EAAOjB,KAAO+B,EAAM/hB,MAAQwL,GAASA,EAAMzK,UAC3CuE,OAAO+B,UAAUgG,eAAeC,KAAKpN,EAAM0N,GAE3C,YADAH,EAASsU,EAAM/hB,MAAQwL,EAAMzK,SAASuM,KAAK2T,EAAQV,EAAQrgB,EAAK0N,GAAOH,IAInFA,EAASsU,EAAM/hB,MAAQ+hB,EAAM3B,KAAKG,EAAQ9S,MAG3CA,GAIf,SAASyU,EAAUniB,EAAKkgB,EAAMpd,GAC1B,IAAK,IAAI+K,KAAQ7N,EAAK,CAClB,IAAI6D,EAAM7D,EAAI6N,GACVhK,aAAeue,SACfve,EAAMA,EAAIsK,KAAK+R,GACF,mBAARrS,IACLhK,EAAMse,EAAUte,EAAKqc,EAAM,KAC/Bpd,EAAO+K,GAAQhK,EAEnB,OAAOf,EAOX,MAAMuf,EAIF,YAIAplB,GACIjB,KAAKiB,KAAOA,EAIZjB,KAAKsmB,MAAQ,GACTrlB,EAAKqlB,OACLH,EAAUllB,EAAKqlB,MAAOtmB,KAAMA,KAAKsmB,OACrCtmB,KAAKikB,IAAMhjB,EAAKgjB,IAAMhjB,EAAKgjB,IAAIA,IAAMsC,EAAU,UAKnD,SAAS9W,GAAS,OAAOA,EAAMzP,KAAKikB,MAExC,MAAMuC,EAAOjd,OAAOlF,OAAO,MAC3B,SAASkiB,EAAUtiB,GACf,OAAIA,KAAQuiB,EACDviB,EAAO,OAAQuiB,EAAKviB,IAC/BuiB,EAAKviB,GAAQ,EACNA,EAAO,KAQlB,MAAMwiB,EAIF,YAAYxiB,EAAO,OAASjE,KAAKikB,IAAMsC,EAAUtiB,GAKjD,IAAIwL,GAAS,OAAOA,EAAM+U,OAAOQ,aAAahlB,KAAKikB,KAInD,SAASxU,GAAS,OAAOA,EAAMzP,KAAKikB,Q,oCCp+BxC,4IAsEA,SAASyC,EAAWC,EAAUnjB,EAAQ,MAClC,OAAO,SAAUiM,EAAOmX,GACpB,IAAI,MAAE/gB,EAAK,IAAEC,GAAQ2J,EAAM4S,UACvBwE,EAAQhhB,EAAM2C,WAAW1C,GAAMghB,GAAS,EAAOC,EAAaF,EAChE,IAAKA,EACD,OAAO,EAEX,GAAIA,EAAM9gB,OAAS,GAAKF,EAAMhF,KAAKgmB,EAAM9gB,MAAQ,GAAG/E,KAAKyF,kBAAkBkgB,IAAiC,GAApBE,EAAM3f,WAAiB,CAE3G,GAAoC,GAAhCrB,EAAMhE,MAAMglB,EAAM9gB,MAAQ,GAC1B,OAAO,EACX,IAAIihB,EAAUvX,EAAM5G,IAAIK,QAAQ2d,EAAMtmB,MAAQ,GAC9CwmB,EAAa,IAAI,OAAUC,EAASA,EAASH,EAAM9gB,OAC/C8gB,EAAM1f,SAAW0f,EAAMxmB,OAAO5B,aAC9BooB,EAAQ,IAAI,OAAUhhB,EAAO4J,EAAM5G,IAAIK,QAAQpD,EAAIxF,IAAIumB,EAAM9gB,QAAS8gB,EAAM9gB,QAChF+gB,GAAS,EAEb,IAAIxP,EAAO,eAAayP,EAAYJ,EAAUnjB,EAAOqjB,GACrD,QAAKvP,IAEDsP,GACAA,EAASK,EAAaxX,EAAMiQ,GAAImH,EAAOvP,EAAMwP,EAAQH,GAAUO,mBAC5D,IAGf,SAASD,EAAavH,EAAImH,EAAOM,EAAUC,EAAYT,GACnD,IAAI1nB,EAAU,OAAS2C,MACvB,IAAK,IAAIpD,EAAI2oB,EAASrnB,OAAS,EAAGtB,GAAK,EAAGA,IACtCS,EAAU,OAASgB,KAAKknB,EAAS3oB,GAAGwC,KAAKqD,OAAO8iB,EAAS3oB,GAAGgF,MAAOvE,IACvEygB,EAAG+C,KAAK,IAAI,OAAkBoE,EAAMtmB,OAAS6mB,EAAa,EAAI,GAAIP,EAAMvmB,IAAKumB,EAAMtmB,MAAOsmB,EAAMvmB,IAAK,IAAI,OAAMrB,EAAS,EAAG,GAAIkoB,EAASrnB,QAAQ,IAChJ,IAAIoC,EAAQ,EACZ,IAAK,IAAI1D,EAAI,EAAGA,EAAI2oB,EAASrnB,OAAQtB,IAC7B2oB,EAAS3oB,GAAGwC,MAAQ2lB,IACpBzkB,EAAQ1D,EAAI,GACpB,IAAI6oB,EAAaF,EAASrnB,OAASoC,EAC/BolB,EAAWT,EAAMtmB,MAAQ4mB,EAASrnB,QAAUsnB,EAAa,EAAI,GAAI/mB,EAASwmB,EAAMxmB,OACpF,IAAK,IAAI7B,EAAIqoB,EAAM3f,WAAYqgB,EAAIV,EAAM1f,SAAU7F,GAAQ,EAAM9C,EAAI+oB,EAAG/oB,IAAK8C,GAAQ,GAC5EA,GAAS,eAASoe,EAAG7W,IAAKye,EAAUD,KACrC3H,EAAG7R,MAAMyZ,EAAUD,GACnBC,GAAY,EAAID,GAEpBC,GAAYjnB,EAAO1B,MAAMH,GAAGY,SAEhC,OAAOsgB,EA6DX,SAAS8H,EAAaC,GAClB,OAAO,SAAUhY,EAAOmX,GACpB,IAAI,MAAE/gB,EAAK,IAAEC,GAAQ2J,EAAM4S,UACvBwE,EAAQhhB,EAAM2C,WAAW1C,EAAKjF,GAAQA,EAAKpC,WAAa,GAAKoC,EAAKU,WAAWP,MAAQymB,GACzF,QAAKZ,KAEAD,IAED/gB,EAAMhF,KAAKgmB,EAAM9gB,MAAQ,GAAG/E,MAAQymB,EAC7BC,EAAgBjY,EAAOmX,EAAUa,EAAUZ,GAE3Cc,EAAclY,EAAOmX,EAAUC,MAGlD,SAASa,EAAgBjY,EAAOmX,EAAUa,EAAUZ,GAChD,IAAInH,EAAKjQ,EAAMiQ,GAAIpf,EAAMumB,EAAMvmB,IAAKsnB,EAAYf,EAAM/gB,IAAIxF,IAAIumB,EAAM9gB,OAChEzF,EAAMsnB,IAGNlI,EAAG+C,KAAK,IAAI,OAAkBniB,EAAM,EAAGsnB,EAAWtnB,EAAKsnB,EAAW,IAAI,OAAM,OAAS3nB,KAAKwnB,EAASpjB,OAAO,KAAMwiB,EAAMxmB,OAAO0B,SAAU,EAAG,GAAI,GAAG,IACjJ8kB,EAAQ,IAAI,OAAUnH,EAAG7W,IAAIK,QAAQ2d,EAAMhhB,MAAMtH,KAAMmhB,EAAG7W,IAAIK,QAAQ0e,GAAYf,EAAM9gB,QAE5F,MAAMe,EAAS,eAAW+f,GAC1B,GAAc,MAAV/f,EACA,OAAO,EACX4Y,EAAGmI,KAAKhB,EAAO/f,GACf,IAAIsB,EAAQsX,EAAGK,QAAQnd,IAAItC,GAAM,GAAK,EAItC,OAHI,eAAQof,EAAG7W,IAAKT,IAChBsX,EAAG/c,KAAKyF,GACZwe,EAASlH,EAAGwH,mBACL,EAEX,SAASS,EAAclY,EAAOmX,EAAUC,GACpC,IAAInH,EAAKjQ,EAAMiQ,GAAIoI,EAAOjB,EAAMxmB,OAEhC,IAAK,IAAI9B,EAAMsoB,EAAMvmB,IAAK9B,EAAIqoB,EAAM1f,SAAW,EAAGogB,EAAIV,EAAM3f,WAAY1I,EAAI+oB,EAAG/oB,IAC3ED,GAAOupB,EAAKnpB,MAAMH,GAAGY,SACrBsgB,EAAGwC,OAAO3jB,EAAM,EAAGA,EAAM,GAE7B,IAAIyI,EAAS0Y,EAAG7W,IAAIK,QAAQ2d,EAAMtmB,OAAQwnB,EAAO/gB,EAAOK,UACxD,GAAIqY,EAAGK,QAAQnd,IAAIikB,EAAMvmB,MAAQumB,EAAMtmB,MAAQyG,EAAOK,UAAUjI,SAC5D,OAAO,EACX,IAAIgjB,EAA8B,GAApByE,EAAM3f,WAAiB8gB,EAAQnB,EAAM1f,UAAY2gB,EAAKrpB,WAChE4B,EAAS2G,EAAOnG,MAAM,GAAIonB,EAAcjhB,EAAOnF,OAAO,GAC1D,IAAKxB,EAAOsF,WAAWsiB,GAAe7F,EAAU,EAAI,GAAI6F,EAAc,EAAGF,EAAK9oB,QAAQsG,OAAOyiB,EAAQ,OAASpmB,MAAQ,OAAS3B,KAAK6nB,KAChI,OAAO,EACX,IAAIvnB,EAAQyG,EAAOzI,IAAK+B,EAAMC,EAAQwnB,EAAK3oB,SAO3C,OAHAsgB,EAAG+C,KAAK,IAAI,OAAkBliB,GAAS6hB,EAAU,EAAI,GAAI9hB,GAAO0nB,EAAQ,EAAI,GAAIznB,EAAQ,EAAGD,EAAM,EAAG,IAAI,QAAO8hB,EAAU,OAASxgB,MAAQ,OAAS3B,KAAK6nB,EAAK/lB,KAAK,OAASH,SACtK2D,OAAOyiB,EAAQ,OAASpmB,MAAQ,OAAS3B,KAAK6nB,EAAK/lB,KAAK,OAASH,SAAUwgB,EAAU,EAAI,EAAG4F,EAAQ,EAAI,GAAI5F,EAAU,EAAI,IAC/HwE,EAASlH,EAAGwH,mBACL,EAMX,SAASgB,EAAaT,GAClB,OAAO,SAAUhY,EAAOmX,GACpB,IAAI,MAAE/gB,EAAK,IAAEC,GAAQ2J,EAAM4S,UACvBwE,EAAQhhB,EAAM2C,WAAW1C,EAAKjF,GAAQA,EAAKpC,WAAa,GAAKoC,EAAKU,WAAWP,MAAQymB,GACzF,IAAKZ,EACD,OAAO,EACX,IAAI3f,EAAa2f,EAAM3f,WACvB,GAAkB,GAAdA,EACA,OAAO,EACX,IAAI7G,EAASwmB,EAAMxmB,OAAQiH,EAAajH,EAAO1B,MAAMuI,EAAa,GAClE,GAAII,EAAWtG,MAAQymB,EACnB,OAAO,EACX,GAAIb,EAAU,CACV,IAAIuB,EAAe7gB,EAAWjG,WAAaiG,EAAWjG,UAAUL,MAAQX,EAAOW,KAC3E7B,EAAQ,OAASc,KAAKkoB,EAAeV,EAASpjB,SAAW,MACzDvD,EAAQ,IAAI,OAAM,OAASb,KAAKwnB,EAASpjB,OAAO,KAAM,OAASpE,KAAKI,EAAOW,KAAKqD,OAAO,KAAMlF,MAAWgpB,EAAe,EAAI,EAAG,GAC9H/e,EAASyd,EAAMtmB,MAAO6H,EAAQye,EAAMvmB,IACxCsmB,EAASnX,EAAMiQ,GAAG+C,KAAK,IAAI,OAAkBrZ,GAAU+e,EAAe,EAAI,GAAI/f,EAAOgB,EAAQhB,EAAOtH,EAAO,GAAG,IACzGomB,kBAET,OAAO,K,kCC7Pf,qWAWA,MAAMkB,EAAU,MACVC,EAAWzoB,KAAK0oB,IAAI,EAAG,IAC7B,SAASC,EAAY1mB,EAAO4B,GAAU,OAAO5B,EAAQ4B,EAAS4kB,EAC9D,SAASG,EAAaxlB,GAAS,OAAOA,EAAQolB,EAC9C,SAASK,EAAczlB,GAAS,OAAQA,GAASA,EAAQolB,IAAYC,EACrE,MAAMK,EAAa,EAAGC,EAAY,EAAGC,EAAa,EAAGC,EAAW,EAKhE,MAAMC,EAIF,YAIAvqB,EAIAwqB,EAIAC,GACIhpB,KAAKzB,IAAMA,EACXyB,KAAK+oB,QAAUA,EACf/oB,KAAKgpB,QAAUA,EAOnB,cAAgB,OAAQhpB,KAAK+oB,QAAUF,GAAY,EAInD,oBAAsB,OAAQ7oB,KAAK+oB,SAAWL,EAAaE,IAAe,EAI1E,mBAAqB,OAAQ5oB,KAAK+oB,SAAWJ,EAAYC,IAAe,EAMxE,oBAAsB,OAAQ5oB,KAAK+oB,QAAUH,GAAc,GAQ/D,MAAMK,EAMF,YAIAzJ,EAIA0J,GAAW,GAGP,GAFAlpB,KAAKwf,OAASA,EACdxf,KAAKkpB,SAAWA,GACX1J,EAAO1f,QAAUmpB,EAAQrnB,MAC1B,OAAOqnB,EAAQrnB,MAKvB,QAAQoB,GACJ,IAAImmB,EAAO,EAAGtnB,EAAQ2mB,EAAaxlB,GACnC,IAAKhD,KAAKkpB,SACN,IAAK,IAAI1qB,EAAI,EAAGA,EAAIqD,EAAOrD,IACvB2qB,GAAQnpB,KAAKwf,OAAW,EAAJhhB,EAAQ,GAAKwB,KAAKwf,OAAW,EAAJhhB,EAAQ,GAC7D,OAAOwB,KAAKwf,OAAe,EAAR3d,GAAasnB,EAAOV,EAAczlB,GAEzD,UAAUzE,EAAK6qB,EAAQ,GAAK,OAAOppB,KAAKqpB,KAAK9qB,EAAK6qB,GAAO,GACzD,IAAI7qB,EAAK6qB,EAAQ,GAAK,OAAOppB,KAAKqpB,KAAK9qB,EAAK6qB,GAAO,GAInD,KAAK7qB,EAAK6qB,EAAOE,GACb,IAAIH,EAAO,EAAGI,EAAWvpB,KAAKkpB,SAAW,EAAI,EAAGM,EAAWxpB,KAAKkpB,SAAW,EAAI,EAC/E,IAAK,IAAI1qB,EAAI,EAAGA,EAAIwB,KAAKwf,OAAO1f,OAAQtB,GAAK,EAAG,CAC5C,IAAI+B,EAAQP,KAAKwf,OAAOhhB,IAAMwB,KAAKkpB,SAAWC,EAAO,GACrD,GAAI5oB,EAAQhC,EACR,MACJ,IAAIkrB,EAAUzpB,KAAKwf,OAAOhhB,EAAI+qB,GAAWG,EAAU1pB,KAAKwf,OAAOhhB,EAAIgrB,GAAWlpB,EAAMC,EAAQkpB,EAC5F,GAAIlrB,GAAO+B,EAAK,CACZ,IAAIqpB,EAAQF,EAAkBlrB,GAAOgC,GAAS,EAAIhC,GAAO+B,EAAM,EAAI8oB,EAA7CA,EAClB1nB,EAASnB,EAAQ4oB,GAAQQ,EAAO,EAAI,EAAID,GAC5C,GAAIJ,EACA,OAAO5nB,EACX,IAAIsnB,EAAUzqB,IAAQ6qB,EAAQ,EAAI7oB,EAAQD,GAAO,KAAOioB,EAAY/pB,EAAI,EAAGD,EAAMgC,GAC7EqpB,EAAMrrB,GAAOgC,EAAQooB,EAAYpqB,GAAO+B,EAAMooB,EAAaE,EAG/D,OAFIQ,EAAQ,EAAI7qB,GAAOgC,EAAQhC,GAAO+B,KAClCspB,GAAOf,GACJ,IAAIC,EAAUpnB,EAAQkoB,EAAKZ,GAEtCG,GAAQO,EAAUD,EAEtB,OAAOH,EAAS/qB,EAAM4qB,EAAO,IAAIL,EAAUvqB,EAAM4qB,EAAM,EAAG,MAK9D,QAAQ5qB,EAAKyqB,GACT,IAAIG,EAAO,EAAGtnB,EAAQ2mB,EAAaQ,GAC/BO,EAAWvpB,KAAKkpB,SAAW,EAAI,EAAGM,EAAWxpB,KAAKkpB,SAAW,EAAI,EACrE,IAAK,IAAI1qB,EAAI,EAAGA,EAAIwB,KAAKwf,OAAO1f,OAAQtB,GAAK,EAAG,CAC5C,IAAI+B,EAAQP,KAAKwf,OAAOhhB,IAAMwB,KAAKkpB,SAAWC,EAAO,GACrD,GAAI5oB,EAAQhC,EACR,MACJ,IAAIkrB,EAAUzpB,KAAKwf,OAAOhhB,EAAI+qB,GAAWjpB,EAAMC,EAAQkpB,EACvD,GAAIlrB,GAAO+B,GAAO9B,GAAa,EAARqD,EACnB,OAAO,EACXsnB,GAAQnpB,KAAKwf,OAAOhhB,EAAIgrB,GAAYC,EAExC,OAAO,EAMX,QAAQtpB,GACJ,IAAIopB,EAAWvpB,KAAKkpB,SAAW,EAAI,EAAGM,EAAWxpB,KAAKkpB,SAAW,EAAI,EACrE,IAAK,IAAI1qB,EAAI,EAAG2qB,EAAO,EAAG3qB,EAAIwB,KAAKwf,OAAO1f,OAAQtB,GAAK,EAAG,CACtD,IAAI+B,EAAQP,KAAKwf,OAAOhhB,GAAIqrB,EAAWtpB,GAASP,KAAKkpB,SAAWC,EAAO,GAAIW,EAAWvpB,GAASP,KAAKkpB,SAAW,EAAIC,GAC/GM,EAAUzpB,KAAKwf,OAAOhhB,EAAI+qB,GAAWG,EAAU1pB,KAAKwf,OAAOhhB,EAAIgrB,GACnErpB,EAAE0pB,EAAUA,EAAWJ,EAASK,EAAUA,EAAWJ,GACrDP,GAAQO,EAAUD,GAO1B,SACI,OAAO,IAAIR,EAAQjpB,KAAKwf,QAASxf,KAAKkpB,UAK1C,WACI,OAAQlpB,KAAKkpB,SAAW,IAAM,IAAMxd,KAAKC,UAAU3L,KAAKwf,QAO5D,cAAc3c,GACV,OAAY,GAALA,EAASomB,EAAQrnB,MAAQ,IAAIqnB,EAAQpmB,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,KAMhFomB,EAAQrnB,MAAQ,IAAIqnB,EAAQ,IAS5B,MAAMc,EAIF,YAIArH,EAAO,GAIPsH,EAKA/pB,EAAO,EAIPC,EAAKwiB,EAAK5iB,QACNE,KAAK0iB,KAAOA,EACZ1iB,KAAKgqB,OAASA,EACdhqB,KAAKC,KAAOA,EACZD,KAAKE,GAAKA,EAKd,MAAMD,EAAO,EAAGC,EAAKF,KAAK0iB,KAAK5iB,QAC3B,OAAO,IAAIiqB,EAAQ/pB,KAAK0iB,KAAM1iB,KAAKgqB,OAAQ/pB,EAAMC,GAKrD,OACI,OAAO,IAAI6pB,EAAQ/pB,KAAK0iB,KAAK5hB,QAASd,KAAKgqB,QAAUhqB,KAAKgqB,OAAOlpB,QAASd,KAAKC,KAAMD,KAAKE,IAO9F,UAAU0C,EAAKqnB,GACXjqB,KAAKE,GAAKF,KAAK0iB,KAAKjhB,KAAKmB,GACV,MAAXqnB,GACAjqB,KAAKkqB,UAAUlqB,KAAK0iB,KAAK5iB,OAAS,EAAGmqB,GAM7C,cAAclK,GACV,IAAK,IAAIvhB,EAAI,EAAG2rB,EAAYnqB,KAAK0iB,KAAK5iB,OAAQtB,EAAIuhB,EAAQ2C,KAAK5iB,OAAQtB,IAAK,CACxE,IAAI4rB,EAAOrK,EAAQsK,UAAU7rB,GAC7BwB,KAAKsqB,UAAUvK,EAAQ2C,KAAKlkB,GAAY,MAAR4rB,GAAgBA,EAAO5rB,EAAI2rB,EAAYC,OAAO7e,IAQtF,UAAU1I,GACN,GAAI7C,KAAKgqB,OACL,IAAK,IAAIxrB,EAAI,EAAGA,EAAIwB,KAAKgqB,OAAOlqB,OAAQtB,IACpC,GAAIwB,KAAKgqB,OAAOxrB,IAAMqE,EAClB,OAAO7C,KAAKgqB,OAAOxrB,GAAKA,EAAI,GAAK,EAAI,IAKrD,UAAUqE,EAAGqI,GACJlL,KAAKgqB,SACNhqB,KAAKgqB,OAAS,IAClBhqB,KAAKgqB,OAAOvoB,KAAKoB,EAAGqI,GAKxB,sBAAsB6U,GAClB,IAAK,IAAIvhB,EAAIuhB,EAAQ2C,KAAK5iB,OAAS,EAAGyqB,EAAYvqB,KAAK0iB,KAAK5iB,OAASigB,EAAQ2C,KAAK5iB,OAAQtB,GAAK,EAAGA,IAAK,CACnG,IAAI4rB,EAAOrK,EAAQsK,UAAU7rB,GAC7BwB,KAAKsqB,UAAUvK,EAAQ2C,KAAKlkB,GAAGgsB,SAAkB,MAARJ,GAAgBA,EAAO5rB,EAAI+rB,EAAYH,EAAO,OAAI7e,IAMnG,SACI,IAAIkf,EAAU,IAAIV,EAElB,OADAU,EAAQC,sBAAsB1qB,MACvByqB,EAKX,IAAIlsB,EAAK6qB,EAAQ,GACb,GAAIppB,KAAKgqB,OACL,OAAOhqB,KAAKqpB,KAAK9qB,EAAK6qB,GAAO,GACjC,IAAK,IAAI5qB,EAAIwB,KAAKC,KAAMzB,EAAIwB,KAAKE,GAAI1B,IACjCD,EAAMyB,KAAK0iB,KAAKlkB,GAAGoE,IAAIrE,EAAK6qB,GAChC,OAAO7qB,EAMX,UAAUA,EAAK6qB,EAAQ,GAAK,OAAOppB,KAAKqpB,KAAK9qB,EAAK6qB,GAAO,GAIzD,KAAK7qB,EAAK6qB,EAAOE,GACb,IAAIP,EAAU,EACd,IAAK,IAAIvqB,EAAIwB,KAAKC,KAAMzB,EAAIwB,KAAKE,GAAI1B,IAAK,CACtC,IAAIoE,EAAM5C,KAAK0iB,KAAKlkB,GAAIkD,EAASkB,EAAIkf,UAAUvjB,EAAK6qB,GACpD,GAAsB,MAAlB1nB,EAAOsnB,QAAiB,CACxB,IAAI2B,EAAO3qB,KAAKqqB,UAAU7rB,GAC1B,GAAY,MAARmsB,GAAgBA,EAAOnsB,GAAKmsB,EAAO3qB,KAAKE,GAAI,CAC5C1B,EAAImsB,EACJpsB,EAAMyB,KAAK0iB,KAAKiI,GAAM3B,QAAQtnB,EAAOsnB,SACrC,UAGRD,GAAWrnB,EAAOqnB,QAClBxqB,EAAMmD,EAAOnD,IAEjB,OAAO+qB,EAAS/qB,EAAM,IAAIuqB,EAAUvqB,EAAKwqB,EAAS,OAI1D,MAAM6B,EAAYrhB,OAAOlF,OAAO,MAYhC,MAAMwmB,EAMF,SAAW,OAAO5B,EAAQrnB,MAM1B,MAAMT,GAAS,OAAO,KAKtB,gBAAgB4B,EAAQoB,GACpB,IAAKA,IAASA,EAAK2mB,SACf,MAAM,IAAI3oB,WAAW,mCACzB,IAAInB,EAAO4pB,EAAUzmB,EAAK2mB,UAC1B,IAAK9pB,EACD,MAAM,IAAImB,WAAW,gBAAgBgC,EAAK2mB,oBAC9C,OAAO9pB,EAAKgE,SAASjC,EAAQoB,GAQjC,cAAc0c,EAAIkK,GACd,GAAIlK,KAAM+J,EACN,MAAM,IAAIzoB,WAAW,iCAAmC0e,GAG5D,OAFA+J,EAAU/J,GAAMkK,EAChBA,EAAUzf,UAAUyV,OAASF,EACtBkK,GAOf,MAAMC,EAIF,YAIAniB,EAIAoiB,GACIjrB,KAAK6I,IAAMA,EACX7I,KAAKirB,OAASA,EAKlB,UAAUpiB,GAAO,OAAO,IAAImiB,EAAWniB,EAAK,MAI5C,YAAYqiB,GAAW,OAAO,IAAIF,EAAW,KAAME,GAMnD,mBAAmBriB,EAAK5I,EAAMC,EAAIY,GAC9B,IACI,OAAOkqB,EAAWxY,GAAG3J,EAAIjD,QAAQ3F,EAAMC,EAAIY,IAE/C,MAAOymB,GACH,GAAIA,aAAa,OACb,OAAOyD,EAAWG,KAAK5D,EAAE2D,SAC7B,MAAM3D,IAKlB,SAAS6D,EAAYvmB,EAAU1E,EAAGE,GAC9B,IAAIgrB,EAAS,GACb,IAAK,IAAI7sB,EAAI,EAAGA,EAAIqG,EAASpG,WAAYD,IAAK,CAC1C,IAAIG,EAAQkG,EAASlG,MAAMH,GACvBG,EAAMM,QAAQC,OACdP,EAAQA,EAAMoD,KAAKqpB,EAAYzsB,EAAMM,QAASkB,EAAGxB,KACjDA,EAAM0J,WACN1J,EAAQwB,EAAExB,EAAO0B,EAAQ7B,IAC7B6sB,EAAO5pB,KAAK9C,GAEhB,OAAO,OAAS4E,UAAU8nB,GAK9B,MAAMC,UAAoBT,EAItB,YAIA5qB,EAIAC,EAIAqS,GACI9G,QACAzL,KAAKC,KAAOA,EACZD,KAAKE,GAAKA,EACVF,KAAKuS,KAAOA,EAEhB,MAAM1J,GACF,IAAI0iB,EAAW1iB,EAAI/H,MAAMd,KAAKC,KAAMD,KAAKE,IAAK2F,EAAQgD,EAAIK,QAAQlJ,KAAKC,MACnEI,EAASwF,EAAMhF,KAAKgF,EAAMmE,YAAYhK,KAAKE,KAC3CY,EAAQ,IAAI,OAAMsqB,EAAYG,EAAStsB,QAAS,CAAC4B,EAAMR,IAClDQ,EAAKsJ,QAAW9J,EAAOW,KAAKkQ,eAAelR,KAAKuS,KAAKvR,MAEnDH,EAAK0R,KAAKvS,KAAKuS,KAAKtH,SAASpK,EAAKuD,QAD9BvD,EAEZR,GAASkrB,EAAS5mB,UAAW4mB,EAAS3mB,SACzC,OAAOomB,EAAWQ,YAAY3iB,EAAK7I,KAAKC,KAAMD,KAAKE,GAAIY,GAE3D,SACI,OAAO,IAAI2qB,EAAezrB,KAAKC,KAAMD,KAAKE,GAAIF,KAAKuS,MAEvD,IAAIwN,GACA,IAAI9f,EAAO8f,EAAQ+B,UAAU9hB,KAAKC,KAAM,GAAIC,EAAK6f,EAAQ+B,UAAU9hB,KAAKE,IAAK,GAC7E,OAAID,EAAK4hB,SAAW3hB,EAAG2hB,SAAW5hB,EAAK1B,KAAO2B,EAAG3B,IACtC,KACJ,IAAI+sB,EAAYrrB,EAAK1B,IAAK2B,EAAG3B,IAAKyB,KAAKuS,MAElD,MAAMpR,GACF,OAAIA,aAAiBmqB,GACjBnqB,EAAMoR,KAAKtQ,GAAGjC,KAAKuS,OACnBvS,KAAKC,MAAQkB,EAAMjB,IAAMF,KAAKE,IAAMiB,EAAMlB,KACnC,IAAIqrB,EAAY1rB,KAAKC,IAAIG,KAAKC,KAAMkB,EAAMlB,MAAOL,KAAKa,IAAIT,KAAKE,GAAIiB,EAAMjB,IAAKF,KAAKuS,MACvF,KAEX,SACI,MAAO,CAAEuY,SAAU,UAAWvY,KAAMvS,KAAKuS,KAAKzP,SAC1C7C,KAAMD,KAAKC,KAAMC,GAAIF,KAAKE,IAKlC,gBAAgB6C,EAAQoB,GACpB,GAAwB,iBAAbA,EAAKlE,MAAsC,iBAAXkE,EAAKjE,GAC5C,MAAM,IAAIiC,WAAW,0CACzB,OAAO,IAAImpB,EAAYnnB,EAAKlE,KAAMkE,EAAKjE,GAAI6C,EAAOqI,aAAajH,EAAKoO,QAG5EsY,EAAK9J,OAAO,UAAWuK,GAIvB,MAAMG,UAAuBZ,EAIzB,YAIA5qB,EAIAC,EAIAqS,GACI9G,QACAzL,KAAKC,KAAOA,EACZD,KAAKE,GAAKA,EACVF,KAAKuS,KAAOA,EAEhB,MAAM1J,GACF,IAAI0iB,EAAW1iB,EAAI/H,MAAMd,KAAKC,KAAMD,KAAKE,IACrCY,EAAQ,IAAI,OAAMsqB,EAAYG,EAAStsB,QAAS4B,GACzCA,EAAK0R,KAAKvS,KAAKuS,KAAKpK,cAActH,EAAKuD,QAC/CyE,GAAM0iB,EAAS5mB,UAAW4mB,EAAS3mB,SACtC,OAAOomB,EAAWQ,YAAY3iB,EAAK7I,KAAKC,KAAMD,KAAKE,GAAIY,GAE3D,SACI,OAAO,IAAIwqB,EAAYtrB,KAAKC,KAAMD,KAAKE,GAAIF,KAAKuS,MAEpD,IAAIwN,GACA,IAAI9f,EAAO8f,EAAQ+B,UAAU9hB,KAAKC,KAAM,GAAIC,EAAK6f,EAAQ+B,UAAU9hB,KAAKE,IAAK,GAC7E,OAAID,EAAK4hB,SAAW3hB,EAAG2hB,SAAW5hB,EAAK1B,KAAO2B,EAAG3B,IACtC,KACJ,IAAIktB,EAAexrB,EAAK1B,IAAK2B,EAAG3B,IAAKyB,KAAKuS,MAErD,MAAMpR,GACF,OAAIA,aAAiBsqB,GACjBtqB,EAAMoR,KAAKtQ,GAAGjC,KAAKuS,OACnBvS,KAAKC,MAAQkB,EAAMjB,IAAMF,KAAKE,IAAMiB,EAAMlB,KACnC,IAAIwrB,EAAe7rB,KAAKC,IAAIG,KAAKC,KAAMkB,EAAMlB,MAAOL,KAAKa,IAAIT,KAAKE,GAAIiB,EAAMjB,IAAKF,KAAKuS,MAC1F,KAEX,SACI,MAAO,CAAEuY,SAAU,aAAcvY,KAAMvS,KAAKuS,KAAKzP,SAC7C7C,KAAMD,KAAKC,KAAMC,GAAIF,KAAKE,IAKlC,gBAAgB6C,EAAQoB,GACpB,GAAwB,iBAAbA,EAAKlE,MAAsC,iBAAXkE,EAAKjE,GAC5C,MAAM,IAAIiC,WAAW,6CACzB,OAAO,IAAIspB,EAAetnB,EAAKlE,KAAMkE,EAAKjE,GAAI6C,EAAOqI,aAAajH,EAAKoO,QAG/EsY,EAAK9J,OAAO,aAAc0K,GAI1B,MAAMC,UAAwBb,EAI1B,YAIAtsB,EAIAgU,GACI9G,QACAzL,KAAKzB,IAAMA,EACXyB,KAAKuS,KAAOA,EAEhB,MAAM1J,GACF,IAAIhI,EAAOgI,EAAI8iB,OAAO3rB,KAAKzB,KAC3B,IAAKsC,EACD,OAAOmqB,EAAWG,KAAK,mCAC3B,IAAI/H,EAAUviB,EAAKG,KAAKqD,OAAOxD,EAAK2C,MAAO,KAAMxD,KAAKuS,KAAKtH,SAASpK,EAAKuD,QACzE,OAAO4mB,EAAWQ,YAAY3iB,EAAK7I,KAAKzB,IAAKyB,KAAKzB,IAAM,EAAG,IAAI,OAAM,OAAS0B,KAAKmjB,GAAU,EAAGviB,EAAKE,OAAS,EAAI,IAEtH,OAAO8H,GACH,IAAIhI,EAAOgI,EAAI8iB,OAAO3rB,KAAKzB,KAC3B,GAAIsC,EAAM,CACN,IAAI+qB,EAAS5rB,KAAKuS,KAAKtH,SAASpK,EAAKuD,OACrC,GAAIwnB,EAAO9rB,QAAUe,EAAKuD,MAAMtE,OAAQ,CACpC,IAAK,IAAItB,EAAI,EAAGA,EAAIqC,EAAKuD,MAAMtE,OAAQtB,IACnC,IAAKqC,EAAKuD,MAAM5F,GAAG0J,QAAQ0jB,GACvB,OAAO,IAAIF,EAAgB1rB,KAAKzB,IAAKsC,EAAKuD,MAAM5F,IACxD,OAAO,IAAIktB,EAAgB1rB,KAAKzB,IAAKyB,KAAKuS,OAGlD,OAAO,IAAIsZ,EAAmB7rB,KAAKzB,IAAKyB,KAAKuS,MAEjD,IAAIwN,GACA,IAAIxhB,EAAMwhB,EAAQ+B,UAAU9hB,KAAKzB,IAAK,GACtC,OAAOA,EAAIutB,aAAe,KAAO,IAAIJ,EAAgBntB,EAAIA,IAAKyB,KAAKuS,MAEvE,SACI,MAAO,CAAEuY,SAAU,cAAevsB,IAAKyB,KAAKzB,IAAKgU,KAAMvS,KAAKuS,KAAKzP,UAKrE,gBAAgBC,EAAQoB,GACpB,GAAuB,iBAAZA,EAAK5F,IACZ,MAAM,IAAI4D,WAAW,8CACzB,OAAO,IAAIupB,EAAgBvnB,EAAK5F,IAAKwE,EAAOqI,aAAajH,EAAKoO,QAGtEsY,EAAK9J,OAAO,cAAe2K,GAI3B,MAAMG,UAA2BhB,EAI7B,YAIAtsB,EAIAgU,GACI9G,QACAzL,KAAKzB,IAAMA,EACXyB,KAAKuS,KAAOA,EAEhB,MAAM1J,GACF,IAAIhI,EAAOgI,EAAI8iB,OAAO3rB,KAAKzB,KAC3B,IAAKsC,EACD,OAAOmqB,EAAWG,KAAK,mCAC3B,IAAI/H,EAAUviB,EAAKG,KAAKqD,OAAOxD,EAAK2C,MAAO,KAAMxD,KAAKuS,KAAKpK,cAActH,EAAKuD,QAC9E,OAAO4mB,EAAWQ,YAAY3iB,EAAK7I,KAAKzB,IAAKyB,KAAKzB,IAAM,EAAG,IAAI,OAAM,OAAS0B,KAAKmjB,GAAU,EAAGviB,EAAKE,OAAS,EAAI,IAEtH,OAAO8H,GACH,IAAIhI,EAAOgI,EAAI8iB,OAAO3rB,KAAKzB,KAC3B,OAAKsC,GAASb,KAAKuS,KAAKrK,QAAQrH,EAAKuD,OAE9B,IAAIsnB,EAAgB1rB,KAAKzB,IAAKyB,KAAKuS,MAD/BvS,KAGf,IAAI+f,GACA,IAAIxhB,EAAMwhB,EAAQ+B,UAAU9hB,KAAKzB,IAAK,GACtC,OAAOA,EAAIutB,aAAe,KAAO,IAAID,EAAmBttB,EAAIA,IAAKyB,KAAKuS,MAE1E,SACI,MAAO,CAAEuY,SAAU,iBAAkBvsB,IAAKyB,KAAKzB,IAAKgU,KAAMvS,KAAKuS,KAAKzP,UAKxE,gBAAgBC,EAAQoB,GACpB,GAAuB,iBAAZA,EAAK5F,IACZ,MAAM,IAAI4D,WAAW,iDACzB,OAAO,IAAI0pB,EAAmB1nB,EAAK5F,IAAKwE,EAAOqI,aAAajH,EAAKoO,QAGzEsY,EAAK9J,OAAO,iBAAkB8K,GAK9B,MAAME,UAAoBlB,EAUtB,YAIA5qB,EAIAC,EAIAY,EAIAud,GAAY,GACR5S,QACAzL,KAAKC,KAAOA,EACZD,KAAKE,GAAKA,EACVF,KAAKc,MAAQA,EACbd,KAAKqe,UAAYA,EAErB,MAAMxV,GACF,OAAI7I,KAAKqe,WAAa2N,EAAenjB,EAAK7I,KAAKC,KAAMD,KAAKE,IAC/C8qB,EAAWG,KAAK,6CACpBH,EAAWQ,YAAY3iB,EAAK7I,KAAKC,KAAMD,KAAKE,GAAIF,KAAKc,OAEhE,SACI,OAAO,IAAImoB,EAAQ,CAACjpB,KAAKC,KAAMD,KAAKE,GAAKF,KAAKC,KAAMD,KAAKc,MAAM5B,OAEnE,OAAO2J,GACH,OAAO,IAAIkjB,EAAY/rB,KAAKC,KAAMD,KAAKC,KAAOD,KAAKc,MAAM5B,KAAM2J,EAAI/H,MAAMd,KAAKC,KAAMD,KAAKE,KAE7F,IAAI6f,GACA,IAAI9f,EAAO8f,EAAQ+B,UAAU9hB,KAAKC,KAAM,GAAIC,EAAK6f,EAAQ+B,UAAU9hB,KAAKE,IAAK,GAC7E,OAAID,EAAKgsB,eAAiB/rB,EAAG+rB,cAClB,KACJ,IAAIF,EAAY9rB,EAAK1B,IAAKqB,KAAKa,IAAIR,EAAK1B,IAAK2B,EAAG3B,KAAMyB,KAAKc,OAEtE,MAAMK,GACF,KAAMA,aAAiB4qB,IAAgB5qB,EAAMkd,WAAare,KAAKqe,UAC3D,OAAO,KACX,GAAIre,KAAKC,KAAOD,KAAKc,MAAM5B,MAAQiC,EAAMlB,MAASD,KAAKc,MAAM8D,SAAYzD,EAAML,MAAM6D,UAKhF,IAAIxD,EAAMjB,IAAMF,KAAKC,MAASD,KAAKc,MAAM6D,WAAcxD,EAAML,MAAM8D,QAMpE,OAAO,KANsE,CAC7E,IAAI9D,EAAQd,KAAKc,MAAM5B,KAAOiC,EAAML,MAAM5B,MAAQ,EAAI,OAAM0C,MACtD,IAAI,OAAMT,EAAML,MAAM7B,QAAQsG,OAAOvF,KAAKc,MAAM7B,SAAUkC,EAAML,MAAM6D,UAAW3E,KAAKc,MAAM8D,SAClG,OAAO,IAAImnB,EAAY5qB,EAAMlB,KAAMD,KAAKE,GAAIY,EAAOd,KAAKqe,YARoC,CAC5F,IAAIvd,EAAQd,KAAKc,MAAM5B,KAAOiC,EAAML,MAAM5B,MAAQ,EAAI,OAAM0C,MACtD,IAAI,OAAM5B,KAAKc,MAAM7B,QAAQsG,OAAOpE,EAAML,MAAM7B,SAAUe,KAAKc,MAAM6D,UAAWxD,EAAML,MAAM8D,SAClG,OAAO,IAAImnB,EAAY/rB,KAAKC,KAAMD,KAAKE,IAAMiB,EAAMjB,GAAKiB,EAAMlB,MAAOa,EAAOd,KAAKqe,YAWzF,SACI,IAAIla,EAAO,CAAE2mB,SAAU,UAAW7qB,KAAMD,KAAKC,KAAMC,GAAIF,KAAKE,IAK5D,OAJIF,KAAKc,MAAM5B,OACXiF,EAAKrD,MAAQd,KAAKc,MAAMgC,UACxB9C,KAAKqe,YACLla,EAAKka,WAAY,GACdla,EAKX,gBAAgBpB,EAAQoB,GACpB,GAAwB,iBAAbA,EAAKlE,MAAsC,iBAAXkE,EAAKjE,GAC5C,MAAM,IAAIiC,WAAW,0CACzB,OAAO,IAAI4pB,EAAY5nB,EAAKlE,KAAMkE,EAAKjE,GAAI,OAAM8E,SAASjC,EAAQoB,EAAKrD,SAAUqD,EAAKka,YAG9FwM,EAAK9J,OAAO,UAAWgL,GAMvB,MAAMG,UAA0BrB,EAO5B,YAIA5qB,EAIAC,EAIAisB,EAIAC,EAIAtrB,EAKA4E,EAIA2Y,GAAY,GACR5S,QACAzL,KAAKC,KAAOA,EACZD,KAAKE,GAAKA,EACVF,KAAKmsB,QAAUA,EACfnsB,KAAKosB,MAAQA,EACbpsB,KAAKc,MAAQA,EACbd,KAAK0F,OAASA,EACd1F,KAAKqe,UAAYA,EAErB,MAAMxV,GACF,GAAI7I,KAAKqe,YAAc2N,EAAenjB,EAAK7I,KAAKC,KAAMD,KAAKmsB,UACvDH,EAAenjB,EAAK7I,KAAKosB,MAAOpsB,KAAKE,KACrC,OAAO8qB,EAAWG,KAAK,iDAC3B,IAAIkB,EAAMxjB,EAAI/H,MAAMd,KAAKmsB,QAASnsB,KAAKosB,OACvC,GAAIC,EAAI1nB,WAAa0nB,EAAIznB,QACrB,OAAOomB,EAAWG,KAAK,2BAC3B,IAAImB,EAAWtsB,KAAKc,MAAMyrB,SAASvsB,KAAK0F,OAAQ2mB,EAAIptB,SACpD,OAAKqtB,EAEEtB,EAAWQ,YAAY3iB,EAAK7I,KAAKC,KAAMD,KAAKE,GAAIosB,GAD5CtB,EAAWG,KAAK,+BAG/B,SACI,OAAO,IAAIlC,EAAQ,CAACjpB,KAAKC,KAAMD,KAAKmsB,QAAUnsB,KAAKC,KAAMD,KAAK0F,OAC1D1F,KAAKosB,MAAOpsB,KAAKE,GAAKF,KAAKosB,MAAOpsB,KAAKc,MAAM5B,KAAOc,KAAK0F,SAEjE,OAAOmD,GACH,IAAIwjB,EAAMrsB,KAAKosB,MAAQpsB,KAAKmsB,QAC5B,OAAO,IAAID,EAAkBlsB,KAAKC,KAAMD,KAAKC,KAAOD,KAAKc,MAAM5B,KAAOmtB,EAAKrsB,KAAKC,KAAOD,KAAK0F,OAAQ1F,KAAKC,KAAOD,KAAK0F,OAAS2mB,EAAKxjB,EAAI/H,MAAMd,KAAKC,KAAMD,KAAKE,IAAIssB,cAAcxsB,KAAKmsB,QAAUnsB,KAAKC,KAAMD,KAAKosB,MAAQpsB,KAAKC,MAAOD,KAAKmsB,QAAUnsB,KAAKC,KAAMD,KAAKqe,WAErQ,IAAI0B,GACA,IAAI9f,EAAO8f,EAAQ+B,UAAU9hB,KAAKC,KAAM,GAAIC,EAAK6f,EAAQ+B,UAAU9hB,KAAKE,IAAK,GACzEisB,EAAUpM,EAAQnd,IAAI5C,KAAKmsB,SAAU,GAAIC,EAAQrM,EAAQnd,IAAI5C,KAAKosB,MAAO,GAC7E,OAAKnsB,EAAKgsB,eAAiB/rB,EAAG+rB,eAAkBE,EAAUlsB,EAAK1B,KAAO6tB,EAAQlsB,EAAG3B,IACtE,KACJ,IAAI2tB,EAAkBjsB,EAAK1B,IAAK2B,EAAG3B,IAAK4tB,EAASC,EAAOpsB,KAAKc,MAAOd,KAAK0F,OAAQ1F,KAAKqe,WAEjG,SACI,IAAIla,EAAO,CAAE2mB,SAAU,gBAAiB7qB,KAAMD,KAAKC,KAAMC,GAAIF,KAAKE,GAC9DisB,QAASnsB,KAAKmsB,QAASC,MAAOpsB,KAAKosB,MAAO1mB,OAAQ1F,KAAK0F,QAK3D,OAJI1F,KAAKc,MAAM5B,OACXiF,EAAKrD,MAAQd,KAAKc,MAAMgC,UACxB9C,KAAKqe,YACLla,EAAKka,WAAY,GACdla,EAKX,gBAAgBpB,EAAQoB,GACpB,GAAwB,iBAAbA,EAAKlE,MAAsC,iBAAXkE,EAAKjE,IACrB,iBAAhBiE,EAAKgoB,SAA4C,iBAAdhoB,EAAKioB,OAA2C,iBAAfjoB,EAAKuB,OAChF,MAAM,IAAIvD,WAAW,gDACzB,OAAO,IAAI+pB,EAAkB/nB,EAAKlE,KAAMkE,EAAKjE,GAAIiE,EAAKgoB,QAAShoB,EAAKioB,MAAO,OAAMpnB,SAASjC,EAAQoB,EAAKrD,OAAQqD,EAAKuB,SAAUvB,EAAKka,YAI3I,SAAS2N,EAAenjB,EAAK5I,EAAMC,GAC/B,IAAI2F,EAAQgD,EAAIK,QAAQjJ,GAAOwF,EAAOvF,EAAKD,EAAM8F,EAAQF,EAAME,MAC/D,MAAON,EAAO,GAAKM,EAAQ,GAAKF,EAAMwD,WAAWtD,IAAUF,EAAMhF,KAAKkF,GAAOtH,WACzEsH,IACAN,IAEJ,GAAIA,EAAO,EAAG,CACV,IAAI6C,EAAOzC,EAAMhF,KAAKkF,GAAOX,WAAWS,EAAMwD,WAAWtD,IACzD,MAAON,EAAO,EAAG,CACb,IAAK6C,GAAQA,EAAKvH,OACd,OAAO,EACXuH,EAAOA,EAAK/G,WACZkE,KAGR,OAAO,EAGX,SAASgnB,EAAQ/M,EAAIzf,EAAMC,EAAIqS,GAC3B,IACIma,EAAUC,EADVC,EAAU,GAAIC,EAAQ,GAE1BnN,EAAG7W,IAAIrI,aAAaP,EAAMC,EAAI,CAACW,EAAMtC,EAAK8B,KACtC,IAAKQ,EAAKwH,SACN,OACJ,IAAIjE,EAAQvD,EAAKuD,MACjB,IAAKmO,EAAKrK,QAAQ9D,IAAU/D,EAAOW,KAAKkQ,eAAeqB,EAAKvR,MAAO,CAC/D,IAAIT,EAAQX,KAAKa,IAAIlC,EAAK0B,GAAOK,EAAMV,KAAKC,IAAItB,EAAMsC,EAAKzB,SAAUc,GACjE0rB,EAASrZ,EAAKtH,SAAS7G,GAC3B,IAAK,IAAI5F,EAAI,EAAGA,EAAI4F,EAAMtE,OAAQtB,IACzB4F,EAAM5F,GAAG0J,QAAQ0jB,KACdc,GAAYA,EAASxsB,IAAMK,GAASmsB,EAASna,KAAKtQ,GAAGmC,EAAM5F,IAC3DkuB,EAASxsB,GAAKI,EAEdssB,EAAQnrB,KAAKirB,EAAW,IAAIjB,EAAelrB,EAAOD,EAAK8D,EAAM5F,MAGrEmuB,GAAUA,EAAOzsB,IAAMK,EACvBosB,EAAOzsB,GAAKI,EAEZusB,EAAMprB,KAAKkrB,EAAS,IAAIrB,EAAY/qB,EAAOD,EAAKiS,OAG5Dqa,EAAQnjB,QAAQqjB,GAAKpN,EAAG+C,KAAKqK,IAC7BD,EAAMpjB,QAAQqjB,GAAKpN,EAAG+C,KAAKqK,IAE/B,SAASC,EAAWrN,EAAIzf,EAAMC,EAAIqS,GAC9B,IAAIvB,EAAU,GAAIyR,EAAO,EACzB/C,EAAG7W,IAAIrI,aAAaP,EAAMC,EAAI,CAACW,EAAMtC,KACjC,IAAKsC,EAAKwH,SACN,OACJoa,IACA,IAAIuK,EAAW,KACf,GAAIza,aAAgB,OAAU,CAC1B,IAAsBrQ,EAAlB0B,EAAM/C,EAAKuD,MACf,MAAOlC,EAAQqQ,EAAKrK,QAAQtE,IACvBopB,IAAaA,EAAW,KAAKvrB,KAAKS,GACnC0B,EAAM1B,EAAMiG,cAAcvE,QAGzB2O,EACDA,EAAKrK,QAAQrH,EAAKuD,SAClB4oB,EAAW,CAACza,IAGhBya,EAAWnsB,EAAKuD,MAEpB,GAAI4oB,GAAYA,EAASltB,OAAQ,CAC7B,IAAIQ,EAAMV,KAAKC,IAAItB,EAAMsC,EAAKzB,SAAUc,GACxC,IAAK,IAAI1B,EAAI,EAAGA,EAAIwuB,EAASltB,OAAQtB,IAAK,CACtC,IAAyB0D,EAArB6Q,EAAQia,EAASxuB,GACrB,IAAK,IAAIQ,EAAI,EAAGA,EAAIgS,EAAQlR,OAAQd,IAAK,CACrC,IAAIkM,EAAI8F,EAAQhS,GACZkM,EAAEuX,MAAQA,EAAO,GAAK1P,EAAM9Q,GAAG+O,EAAQhS,GAAG+T,SAC1C7Q,EAAQgJ,GAEZhJ,GACAA,EAAMhC,GAAKI,EACX4B,EAAMugB,KAAOA,GAGbzR,EAAQvP,KAAK,CAAEsR,QAAO9S,KAAML,KAAKa,IAAIlC,EAAK0B,GAAOC,GAAII,EAAKmiB,aAK1EzR,EAAQvH,QAAQyB,GAAKwU,EAAG+C,KAAK,IAAIgJ,EAAevgB,EAAEjL,KAAMiL,EAAEhL,GAAIgL,EAAE6H,SAEpE,SAASka,EAAkBvN,EAAInhB,EAAK2uB,EAAY5iB,EAAQ4iB,EAAW3iB,cAC/D,IAAI1J,EAAO6e,EAAG7W,IAAI8iB,OAAOptB,GACrB4uB,EAAW,GAAI1qB,EAAMlE,EAAM,EAC/B,IAAK,IAAIC,EAAI,EAAGA,EAAIqC,EAAKpC,WAAYD,IAAK,CACtC,IAAIG,EAAQkC,EAAKlC,MAAMH,GAAI8B,EAAMmC,EAAM9D,EAAMS,SACzCguB,EAAU9iB,EAAMS,UAAUpM,EAAMqC,MACpC,GAAKosB,EAGA,CACD9iB,EAAQ8iB,EACR,IAAK,IAAIpuB,EAAI,EAAGA,EAAIL,EAAMyF,MAAMtE,OAAQd,IAC/BkuB,EAAWhc,eAAevS,EAAMyF,MAAMpF,GAAGgC,OAC1C0e,EAAG+C,KAAK,IAAIgJ,EAAehpB,EAAKnC,EAAK3B,EAAMyF,MAAMpF,UANzDmuB,EAAS1rB,KAAK,IAAIsqB,EAAYtpB,EAAKnC,EAAK,OAAMsB,QAQlDa,EAAMnC,EAEV,IAAKgK,EAAMO,SAAU,CACjB,IAAIwM,EAAO/M,EAAMyG,WAAW,OAASnP,OAAO,GAC5C8d,EAAG9Z,QAAQnD,EAAKA,EAAK,IAAI,OAAM4U,EAAM,EAAG,IAE5C,IAAK,IAAI7Y,EAAI2uB,EAASrtB,OAAS,EAAGtB,GAAK,EAAGA,IACtCkhB,EAAG+C,KAAK0K,EAAS3uB,IAGzB,SAAS6uB,EAAOxsB,EAAMN,EAAOD,GACzB,OAAiB,GAATC,GAAcM,EAAK8E,WAAWpF,EAAOM,EAAKpC,eAC7C6B,GAAOO,EAAKpC,YAAcoC,EAAK8E,WAAW,EAAGrF,IAOtD,SAASgtB,EAAWzG,GAChB,IAAIxmB,EAASwmB,EAAMxmB,OACfpB,EAAUoB,EAAOpB,QAAQsuB,WAAW1G,EAAM3f,WAAY2f,EAAM1f,UAChE,IAAK,IAAIpB,EAAQ8gB,EAAM9gB,SAAUA,EAAO,CACpC,IAAIlF,EAAOgmB,EAAMhhB,MAAMhF,KAAKkF,GACxBlE,EAAQglB,EAAMhhB,MAAMhE,MAAMkE,GAAQoB,EAAW0f,EAAM/gB,IAAIuD,WAAWtD,GACtE,GAAIA,EAAQ8gB,EAAM9gB,OAASlF,EAAK8E,WAAW9D,EAAOsF,EAAUlI,GACxD,OAAO8G,EACX,GAAa,GAATA,GAAclF,EAAKG,KAAKC,KAAKiE,YAAcmoB,EAAOxsB,EAAMgB,EAAOsF,GAC/D,MAER,OAAO,KAEX,SAAS0gB,EAAKnI,EAAImH,EAAO/f,GACrB,IAAI,MAAEjB,EAAK,IAAEC,EAAG,MAAEC,GAAU8gB,EACxB2G,EAAW3nB,EAAMuD,OAAOrD,EAAQ,GAAI0nB,EAAS3nB,EAAIsC,MAAMrC,EAAQ,GAC/DxF,EAAQitB,EAAUltB,EAAMmtB,EACxBrkB,EAAS,OAASxH,MAAO+C,EAAY,EACzC,IAAK,IAAI8D,EAAI1C,EAAO2nB,GAAY,EAAOjlB,EAAI3B,EAAQ2B,IAC3CilB,GAAa7nB,EAAMhE,MAAM4G,GAAK,GAC9BilB,GAAY,EACZtkB,EAAS,OAASnJ,KAAK4F,EAAMhF,KAAK4H,GAAG1G,KAAKqH,IAC1CzE,KAGApE,IAER,IAAI6H,EAAQ,OAASxG,MAAOgD,EAAU,EACtC,IAAK,IAAI6D,EAAI1C,EAAO2nB,GAAY,EAAOjlB,EAAI3B,EAAQ2B,IAC3CilB,GAAa5nB,EAAIsC,MAAMK,EAAI,GAAK3C,EAAIxF,IAAImI,IACxCilB,GAAY,EACZtlB,EAAQ,OAASnI,KAAK6F,EAAIjF,KAAK4H,GAAG1G,KAAKqG,IACvCxD,KAGAtE,IAERof,EAAG+C,KAAK,IAAIyJ,EAAkB3rB,EAAOD,EAAKktB,EAAUC,EAAQ,IAAI,OAAMrkB,EAAO7D,OAAO6C,GAAQzD,EAAWC,GAAUwE,EAAOlK,KAAOyF,GAAW,IAU9I,SAAS4S,EAAasP,EAAOxb,EAAU7H,EAAQ,KAAMmqB,EAAa9G,GAC9D,IAAI+G,EAASC,EAAoBhH,EAAOxb,GACpClM,EAAQyuB,GAAUE,EAAmBH,EAAYtiB,GACrD,OAAKlM,EAEEyuB,EAAOhrB,IAAImrB,GACb/rB,OAAO,CAAEhB,KAAMqK,EAAU7H,UAASxB,OAAO7C,EAAMyD,IAAImrB,IAF7C,KAIf,SAASA,EAAU/sB,GAAQ,MAAO,CAAEA,OAAMwC,MAAO,MACjD,SAASqqB,EAAoBhH,EAAO7lB,GAChC,IAAI,OAAEX,EAAM,WAAE6G,EAAU,SAAEC,GAAa0f,EACnC+G,EAASvtB,EAAOsK,eAAezD,GAAYqQ,aAAavW,GAC5D,IAAK4sB,EACD,OAAO,KACX,IAAII,EAAQJ,EAAO9tB,OAAS8tB,EAAO,GAAK5sB,EACxC,OAAOX,EAAO4tB,eAAe/mB,EAAYC,EAAU6mB,GAASJ,EAAS,KAEzE,SAASE,EAAmBjH,EAAO7lB,GAC/B,IAAI,OAAEX,EAAM,WAAE6G,EAAU,SAAEC,GAAa0f,EACnC1nB,EAAQkB,EAAO1B,MAAMuI,GACrBgnB,EAASltB,EAAKuJ,aAAagN,aAAapY,EAAM6B,MAClD,IAAKktB,EACD,OAAO,KACX,IAAIC,EAAWD,EAAOpuB,OAASouB,EAAOA,EAAOpuB,OAAS,GAAKkB,EACvDotB,EAAaD,EAAS5jB,aAC1B,IAAK,IAAI/L,EAAI0I,EAAYknB,GAAc5vB,EAAI2I,EAAU3I,IACjD4vB,EAAaA,EAAWrjB,UAAU1K,EAAO1B,MAAMH,GAAGwC,MACtD,OAAKotB,GAAeA,EAAWvjB,SAExBqjB,EADI,KAGf,SAAS5W,EAAKoI,EAAImH,EAAOM,GACrB,IAAIloB,EAAU,OAAS2C,MACvB,IAAK,IAAIpD,EAAI2oB,EAASrnB,OAAS,EAAGtB,GAAK,EAAGA,IAAK,CAC3C,GAAIS,EAAQC,KAAM,CACd,IAAIoL,EAAQ6c,EAAS3oB,GAAGwC,KAAKuJ,aAAaC,cAAcvL,GACxD,IAAKqL,IAAUA,EAAMO,SACjB,MAAM,IAAI1I,WAAW,0FAE7BlD,EAAU,OAASgB,KAAKknB,EAAS3oB,GAAGwC,KAAKqD,OAAO8iB,EAAS3oB,GAAGgF,MAAOvE,IAEvE,IAAIsB,EAAQsmB,EAAMtmB,MAAOD,EAAMumB,EAAMvmB,IACrCof,EAAG+C,KAAK,IAAIyJ,EAAkB3rB,EAAOD,EAAKC,EAAOD,EAAK,IAAI,OAAMrB,EAAS,EAAG,GAAIkoB,EAASrnB,QAAQ,IAErG,SAASuuB,EAAa3O,EAAIzf,EAAMC,EAAIc,EAAMwC,GACtC,IAAKxC,EAAKkJ,YACN,MAAM,IAAI/H,WAAW,oDACzB,IAAI0d,EAAUH,EAAGI,MAAMhgB,OACvB4f,EAAG7W,IAAIrI,aAAaP,EAAMC,EAAI,CAACW,EAAMtC,KACjC,GAAIsC,EAAKqJ,cAAgBrJ,EAAK+I,UAAU5I,EAAMwC,IAAU8qB,EAAc5O,EAAG7W,IAAK6W,EAAGK,QAAQjf,MAAM+e,GAASjd,IAAIrE,GAAMyC,GAAO,CAErH0e,EAAGuN,kBAAkBvN,EAAGK,QAAQjf,MAAM+e,GAASjd,IAAIrE,EAAK,GAAIyC,GAC5D,IAAI+e,EAAUL,EAAGK,QAAQjf,MAAM+e,GAC3B0O,EAASxO,EAAQnd,IAAIrE,EAAK,GAAIiwB,EAAOzO,EAAQnd,IAAIrE,EAAMsC,EAAKzB,SAAU,GAE1E,OADAsgB,EAAG+C,KAAK,IAAIyJ,EAAkBqC,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EAAG,IAAI,OAAM,OAASvuB,KAAKe,EAAKqD,OAAOb,EAAO,KAAM3C,EAAKuD,QAAS,EAAG,GAAI,GAAG,KACpI,KAInB,SAASkqB,EAAczlB,EAAKtK,EAAKyC,GAC7B,IAAIof,EAAOvX,EAAIK,QAAQ3K,GAAMsD,EAAQue,EAAKve,QAC1C,OAAOue,EAAK/f,OAAO4tB,eAAepsB,EAAOA,EAAQ,EAAGb,GAMxD,SAASytB,EAAc/O,EAAInhB,EAAKyC,EAAMwC,EAAOY,GACzC,IAAIvD,EAAO6e,EAAG7W,IAAI8iB,OAAOptB,GACzB,IAAKsC,EACD,MAAM,IAAIsB,WAAW,6BACpBnB,IACDA,EAAOH,EAAKG,MAChB,IAAI0tB,EAAU1tB,EAAKqD,OAAOb,EAAO,KAAMY,GAASvD,EAAKuD,OACrD,GAAIvD,EAAKE,OACL,OAAO2e,EAAGoE,YAAYvlB,EAAKA,EAAMsC,EAAKzB,SAAUsvB,GACpD,IAAK1tB,EAAKuG,aAAa1G,EAAK5B,SACxB,MAAM,IAAIkD,WAAW,iCAAmCnB,EAAKiD,MACjEyb,EAAG+C,KAAK,IAAIyJ,EAAkB3tB,EAAKA,EAAMsC,EAAKzB,SAAUb,EAAM,EAAGA,EAAMsC,EAAKzB,SAAW,EAAG,IAAI,OAAM,OAASa,KAAKyuB,GAAU,EAAG,GAAI,GAAG,IAK1I,SAASC,EAAS9lB,EAAKtK,EAAKwH,EAAQ,EAAG6oB,GACnC,IAAIxO,EAAOvX,EAAIK,QAAQ3K,GAAMqN,EAAOwU,EAAKra,MAAQA,EAC7C8oB,EAAaD,GAAcA,EAAWA,EAAW9uB,OAAS,IAAOsgB,EAAK/f,OAC1E,GAAIuL,EAAO,GAAKwU,EAAK/f,OAAOW,KAAKC,KAAKiE,YACjCkb,EAAK/f,OAAOsF,WAAWya,EAAKve,QAASue,EAAK/f,OAAO5B,cACjDowB,EAAU7tB,KAAKuG,aAAa6Y,EAAK/f,OAAOpB,QAAQsuB,WAAWnN,EAAKve,QAASue,EAAK/f,OAAO5B,aACtF,OAAO,EACX,IAAK,IAAIgK,EAAI2X,EAAKra,MAAQ,EAAGvH,EAAIuH,EAAQ,EAAG0C,EAAImD,EAAMnD,IAAKjK,IAAK,CAC5D,IAAIqC,EAAOuf,EAAKvf,KAAK4H,GAAI5G,EAAQue,EAAKve,MAAM4G,GAC5C,GAAI5H,EAAKG,KAAKC,KAAKiE,UACf,OAAO,EACX,IAAI4pB,EAAOjuB,EAAK5B,QAAQsuB,WAAW1rB,EAAOhB,EAAKpC,YAC3C2J,EAASwmB,GAAcA,EAAWpwB,IAAOqC,EAG7C,GAFIuH,GAASvH,IACTiuB,EAAOA,EAAKtpB,aAAa,EAAG4C,EAAMpH,KAAKqD,OAAO+D,EAAM5E,UACnD3C,EAAK8E,WAAW9D,EAAQ,EAAGhB,EAAKpC,cAAgB2J,EAAMpH,KAAKuG,aAAaunB,GACzE,OAAO,EAEf,IAAIjtB,EAAQue,EAAK/W,WAAWuC,GACxBmjB,EAAWH,GAAcA,EAAW,GACxC,OAAOxO,EAAKvf,KAAK+K,GAAMqiB,eAAepsB,EAAOA,EAAOktB,EAAWA,EAAS/tB,KAAOof,EAAKvf,KAAK+K,EAAO,GAAG5K,MAEvG,SAAS6M,EAAM6R,EAAInhB,EAAKwH,EAAQ,EAAG6oB,GAC/B,IAAIxO,EAAOV,EAAG7W,IAAIK,QAAQ3K,GAAM6K,EAAS,OAASxH,MAAOwG,EAAQ,OAASxG,MAC1E,IAAK,IAAI6G,EAAI2X,EAAKra,MAAOwhB,EAAInH,EAAKra,MAAQA,EAAOvH,EAAIuH,EAAQ,EAAG0C,EAAI8e,EAAG9e,IAAKjK,IAAK,CAC7E4K,EAAS,OAASnJ,KAAKmgB,EAAKvf,KAAK4H,GAAG1G,KAAKqH,IACzC,IAAI4lB,EAAYJ,GAAcA,EAAWpwB,GACzC4J,EAAQ,OAASnI,KAAK+uB,EAAYA,EAAUhuB,KAAKqD,OAAO2qB,EAAUxrB,MAAO4E,GAASgY,EAAKvf,KAAK4H,GAAG1G,KAAKqG,IAExGsX,EAAG+C,KAAK,IAAIsJ,EAAYxtB,EAAKA,EAAK,IAAI,OAAM6K,EAAO7D,OAAO6C,GAAQrC,EAAOA,IAAQ,IAMrF,SAASkpB,EAAQpmB,EAAKtK,GAClB,IAAI6hB,EAAOvX,EAAIK,QAAQ3K,GAAMsD,EAAQue,EAAKve,QAC1C,OAAO6E,EAAS0Z,EAAK9Y,WAAY8Y,EAAK/Y,YAClC+Y,EAAK/f,OAAOsF,WAAW9D,EAAOA,EAAQ,GAE9C,SAAS6E,EAASrI,EAAGC,GACjB,SAAUD,IAAKC,GAAMD,EAAE0C,SAAU1C,EAAE6wB,UAAU5wB,IAOjD,SAAS6wB,EAAUtmB,EAAKtK,EAAK8hB,GAAM,GAC/B,IAAID,EAAOvX,EAAIK,QAAQ3K,GACvB,IAAK,IAAIkK,EAAI2X,EAAKra,OAAQ0C,IAAK,CAC3B,IAAIW,EAAQhB,EAAOvG,EAAQue,EAAKve,MAAM4G,GActC,GAbIA,GAAK2X,EAAKra,OACVqD,EAASgX,EAAK9Y,WACdc,EAAQgY,EAAK/Y,WAERgZ,EAAM,GACXjX,EAASgX,EAAKvf,KAAK4H,EAAI,GACvB5G,IACAuG,EAAQgY,EAAKvf,KAAK4H,GAAGrD,WAAWvD,KAGhCuH,EAASgX,EAAKvf,KAAK4H,GAAGrD,WAAWvD,EAAQ,GACzCuG,EAAQgY,EAAKvf,KAAK4H,EAAI,IAEtBW,IAAWA,EAAOc,aAAexD,EAAS0C,EAAQhB,IAClDgY,EAAKvf,KAAK4H,GAAG9C,WAAW9D,EAAOA,EAAQ,GACvC,OAAOtD,EACX,GAAS,GAALkK,EACA,MACJlK,EAAM8hB,EAAM,EAAID,EAAKhX,OAAOX,GAAK2X,EAAKhY,MAAMK,IAGpD,SAAS9F,EAAK+c,EAAInhB,EAAKwH,GACnB,IAAI0c,EAAO,IAAIsJ,EAAYxtB,EAAMwH,EAAOxH,EAAMwH,EAAO,OAAMnE,OAAO,GAClE8d,EAAG+C,KAAKA,GAQZ,SAAS2M,EAAYvmB,EAAKtK,EAAK8M,GAC3B,IAAI+U,EAAOvX,EAAIK,QAAQ3K,GACvB,GAAI6hB,EAAK/f,OAAO4tB,eAAe7N,EAAKve,QAASue,EAAKve,QAASwJ,GACvD,OAAO9M,EACX,GAAyB,GAArB6hB,EAAKha,aACL,IAAK,IAAIqC,EAAI2X,EAAKra,MAAQ,EAAG0C,GAAK,EAAGA,IAAK,CACtC,IAAI5G,EAAQue,EAAKve,MAAM4G,GACvB,GAAI2X,EAAKvf,KAAK4H,GAAGwlB,eAAepsB,EAAOA,EAAOwJ,GAC1C,OAAO+U,EAAKhX,OAAOX,EAAI,GAC3B,GAAI5G,EAAQ,EACR,OAAO,KAEnB,GAAIue,EAAKha,cAAgBga,EAAK/f,OAAOpB,QAAQC,KACzC,IAAK,IAAIuJ,EAAI2X,EAAKra,MAAQ,EAAG0C,GAAK,EAAGA,IAAK,CACtC,IAAI5G,EAAQue,EAAK/W,WAAWZ,GAC5B,GAAI2X,EAAKvf,KAAK4H,GAAGwlB,eAAepsB,EAAOA,EAAOwJ,GAC1C,OAAO+U,EAAKhY,MAAMK,EAAI,GAC1B,GAAI5G,EAAQue,EAAKvf,KAAK4H,GAAGhK,WACrB,OAAO,KAEnB,OAAO,KAQX,SAAS4wB,EAAUxmB,EAAKtK,EAAKuC,GACzB,IAAIsf,EAAOvX,EAAIK,QAAQ3K,GACvB,IAAKuC,EAAM7B,QAAQC,KACf,OAAOX,EACX,IAAIU,EAAU6B,EAAM7B,QACpB,IAAK,IAAIT,EAAI,EAAGA,EAAIsC,EAAM6D,UAAWnG,IACjCS,EAAUA,EAAQsC,WAAWtC,QACjC,IAAK,IAAIqwB,EAAO,EAAGA,IAA4B,GAAnBxuB,EAAM6D,WAAkB7D,EAAM5B,KAAO,EAAI,GAAIowB,IACrE,IAAK,IAAI7mB,EAAI2X,EAAKra,MAAO0C,GAAK,EAAGA,IAAK,CAClC,IAAIgY,EAAOhY,GAAK2X,EAAKra,MAAQ,EAAIqa,EAAK7hB,MAAQ6hB,EAAK7f,MAAMkI,EAAI,GAAK2X,EAAK9f,IAAImI,EAAI,IAAM,GAAK,EAAI,EAC1F8mB,EAAYnP,EAAKve,MAAM4G,IAAMgY,EAAO,EAAI,EAAI,GAC5CpgB,EAAS+f,EAAKvf,KAAK4H,GAAI+mB,GAAO,EAClC,GAAY,GAARF,EACAE,EAAOnvB,EAAOsF,WAAW4pB,EAAWA,EAAWtwB,OAE9C,CACD,IAAIwwB,EAAWpvB,EAAOsK,eAAe4kB,GAAWhY,aAAatY,EAAQsC,WAAWP,MAChFwuB,EAAOC,GAAYpvB,EAAO4tB,eAAesB,EAAWA,EAAWE,EAAS,IAE5E,GAAID,EACA,OAAe,GAAR/O,EAAYL,EAAK7hB,IAAMkiB,EAAO,EAAIL,EAAKhX,OAAOX,EAAI,GAAK2X,EAAKhY,MAAMK,EAAI,GAGzF,OAAO,KASX,SAASinB,EAAY7mB,EAAK5I,EAAMC,EAAKD,EAAMa,EAAQ,OAAMc,OACrD,GAAI3B,GAAQC,IAAOY,EAAM5B,KACrB,OAAO,KACX,IAAI2G,EAAQgD,EAAIK,QAAQjJ,GAAO6F,EAAM+C,EAAIK,QAAQhJ,GAEjD,OAAIyvB,EAAc9pB,EAAOC,EAAKhF,GACnB,IAAIirB,EAAY9rB,EAAMC,EAAIY,GAC9B,IAAI8uB,EAAO/pB,EAAOC,EAAKhF,GAAO+uB,MAEzC,SAASF,EAAc9pB,EAAOC,EAAKhF,GAC/B,OAAQA,EAAM6D,YAAc7D,EAAM8D,SAAWiB,EAAMtF,SAAWuF,EAAIvF,SAC9DsF,EAAMxF,OAAOsF,WAAWE,EAAMhE,QAASiE,EAAIjE,QAASf,EAAM7B,SAtZlE4rB,EAAK9J,OAAO,gBAAiBmL,GA4a7B,MAAM0D,EACF,YAAY/pB,EAAOC,EAAKgqB,GACpB9vB,KAAK6F,MAAQA,EACb7F,KAAK8F,IAAMA,EACX9F,KAAK8vB,SAAWA,EAChB9vB,KAAK+vB,SAAW,GAChB/vB,KAAK6D,OAAS,OAASjC,MACvB,IAAK,IAAIpD,EAAI,EAAGA,GAAKqH,EAAME,MAAOvH,IAAK,CACnC,IAAIqC,EAAOgF,EAAMhF,KAAKrC,GACtBwB,KAAK+vB,SAAStuB,KAAK,CACfT,KAAMH,EAAKG,KACXsJ,MAAOzJ,EAAK8J,eAAe9E,EAAMwD,WAAW7K,MAGpD,IAAK,IAAIA,EAAIqH,EAAME,MAAOvH,EAAI,EAAGA,IAC7BwB,KAAK6D,OAAS,OAAS5D,KAAK4F,EAAMhF,KAAKrC,GAAGuD,KAAK/B,KAAK6D,SAE5D,YAAc,OAAO7D,KAAK+vB,SAASjwB,OAAS,EAC5C,MAII,MAAOE,KAAK8vB,SAAS5wB,KAAM,CACvB,IAAI2wB,EAAM7vB,KAAKgwB,eACXH,EACA7vB,KAAKiwB,WAAWJ,GAEhB7vB,KAAKkwB,YAAclwB,KAAKmwB,WAOhC,IAAIC,EAAapwB,KAAKqwB,iBAAkBC,EAAatwB,KAAK6D,OAAO3E,KAAOc,KAAK+F,MAAQ/F,KAAK6F,MAAME,MAC5FF,EAAQ7F,KAAK6F,MAAOC,EAAM9F,KAAKkG,MAAMkqB,EAAa,EAAIpwB,KAAK8F,IAAMD,EAAMgD,IAAIK,QAAQknB,IACvF,IAAKtqB,EACD,OAAO,KAEX,IAAI7G,EAAUe,KAAK6D,OAAQc,EAAYkB,EAAME,MAAOnB,EAAUkB,EAAIC,MAClE,MAAOpB,GAAaC,GAAiC,GAAtB3F,EAAQR,WACnCQ,EAAUA,EAAQsC,WAAWtC,QAC7B0F,IACAC,IAEJ,IAAI9D,EAAQ,IAAI,OAAM7B,EAAS0F,EAAWC,GAC1C,OAAIwrB,GAAc,EACP,IAAIlE,EAAkBrmB,EAAMtH,IAAK6xB,EAAYpwB,KAAK8F,IAAIvH,IAAKyB,KAAK8F,IAAIxF,MAAOQ,EAAOwvB,GACzFxvB,EAAM5B,MAAQ2G,EAAMtH,KAAOyB,KAAK8F,IAAIvH,IAC7B,IAAIwtB,EAAYlmB,EAAMtH,IAAKuH,EAAIvH,IAAKuC,GACxC,KAKX,eAGI,IAAK,IAAIwuB,EAAO,EAAGA,GAAQ,EAAGA,IAC1B,IAAK,IAAIiB,EAAavwB,KAAK8vB,SAASnrB,UAAW4rB,GAAc,EAAGA,IAAc,CAC1E,IAAI1rB,EAAUxE,EAAS,KACnBkwB,GACAlwB,EAASmwB,GAAUxwB,KAAK8vB,SAAS7wB,QAASsxB,EAAa,GAAGhvB,WAC1DsD,EAAWxE,EAAOpB,SAGlB4F,EAAW7E,KAAK8vB,SAAS7wB,QAE7B,IAAIqC,EAAQuD,EAAStD,WACrB,IAAK,IAAIkvB,EAAgBzwB,KAAK+F,MAAO0qB,GAAiB,EAAGA,IAAiB,CACtE,IAAoDnZ,GAAhD,KAAEtW,EAAI,MAAEsJ,GAAUtK,KAAK+vB,SAASU,GAAsBC,EAAS,KAInE,GAAY,GAARpB,IAAchuB,EAAQgJ,EAAMS,UAAUzJ,EAAMN,QAAU0vB,EAASpmB,EAAMyG,WAAW,OAAS9Q,KAAKqB,IAAQ,IACpGjB,GAAUW,EAAKyF,kBAAkBpG,EAAOW,OAC1C,MAAO,CAAEuvB,aAAYE,gBAAepwB,SAAQqwB,UAG3C,GAAY,GAARpB,GAAahuB,IAAUgW,EAAOhN,EAAMiN,aAAajW,EAAMN,OAC5D,MAAO,CAAEuvB,aAAYE,gBAAepwB,SAAQiX,QAGhD,GAAIjX,GAAUiK,EAAMS,UAAU1K,EAAOW,MACjC,QAKpB,WACI,IAAI,QAAE/B,EAAO,UAAE0F,EAAS,QAAEC,GAAY5E,KAAK8vB,SACvC3wB,EAAQqxB,GAAUvxB,EAAS0F,GAC/B,SAAKxF,EAAMV,YAAcU,EAAMoC,WAAWR,UAE1Cf,KAAK8vB,SAAW,IAAI,OAAM7wB,EAAS0F,EAAY,EAAG/E,KAAKa,IAAImE,EAASzF,EAAMD,KAAOyF,GAAa1F,EAAQC,KAAO0F,EAAUD,EAAY,EAAI,KAChI,GAEX,WACI,IAAI,QAAE1F,EAAO,UAAE0F,EAAS,QAAEC,GAAY5E,KAAK8vB,SACvC3wB,EAAQqxB,GAAUvxB,EAAS0F,GAC/B,GAAIxF,EAAMV,YAAc,GAAKkG,EAAY,EAAG,CACxC,IAAIgsB,EAAY1xB,EAAQC,KAAOyF,GAAaA,EAAYxF,EAAMD,KAC9Dc,KAAK8vB,SAAW,IAAI,OAAMc,EAAiB3xB,EAAS0F,EAAY,EAAG,GAAIA,EAAY,EAAGgsB,EAAYhsB,EAAY,EAAIC,QAGlH5E,KAAK8vB,SAAW,IAAI,OAAMc,EAAiB3xB,EAAS0F,EAAW,GAAIA,EAAWC,GAMtF,YAAW,WAAE2rB,EAAU,cAAEE,EAAa,OAAEpwB,EAAM,OAAEqwB,EAAM,KAAEpZ,IACpD,MAAOtX,KAAK+F,MAAQ0qB,EAChBzwB,KAAK6wB,oBACT,GAAIvZ,EACA,IAAK,IAAI9Y,EAAI,EAAGA,EAAI8Y,EAAKxX,OAAQtB,IAC7BwB,KAAK8wB,iBAAiBxZ,EAAK9Y,IACnC,IAAIsC,EAAQd,KAAK8vB,SAAUjrB,EAAWxE,EAASA,EAAOpB,QAAU6B,EAAM7B,QAClE0F,EAAY7D,EAAM6D,UAAY4rB,EAC9BQ,EAAQ,EAAGjT,EAAM,IACjB,MAAExT,EAAK,KAAEtJ,GAAShB,KAAK+vB,SAASU,GACpC,GAAIC,EAAQ,CACR,IAAK,IAAIlyB,EAAI,EAAGA,EAAIkyB,EAAOjyB,WAAYD,IACnCsf,EAAIrc,KAAKivB,EAAO/xB,MAAMH,IAC1B8L,EAAQA,EAAME,cAAckmB,GAKhC,IAAIM,EAAgBnsB,EAAS3F,KAAOqxB,GAAezvB,EAAM7B,QAAQC,KAAO4B,EAAM8D,SAG9E,MAAOmsB,EAAQlsB,EAASpG,WAAY,CAChC,IAAI6J,EAAOzD,EAASlG,MAAMoyB,GAAQtd,EAAUnJ,EAAMS,UAAUzC,EAAKtH,MACjE,IAAKyS,EACD,MACJsd,KACIA,EAAQ,GAAkB,GAAbpsB,GAAkB2D,EAAKrJ,QAAQC,QAC5CoL,EAAQmJ,EACRqK,EAAIrc,KAAKwvB,GAAe3oB,EAAKiK,KAAKvR,EAAKkwB,aAAa5oB,EAAKlE,QAAkB,GAAT2sB,EAAapsB,EAAY,EAAGosB,GAASlsB,EAASpG,WAAauyB,GAAgB,KAGrJ,IAAIrkB,EAAQokB,GAASlsB,EAASpG,WACzBkO,IACDqkB,GAAgB,GACpBhxB,KAAK6D,OAASstB,EAAcnxB,KAAK6D,OAAQ4sB,EAAe,OAASxwB,KAAK6d,IACtE9d,KAAK+vB,SAASU,GAAenmB,MAAQA,EAGjCqC,GAASqkB,EAAe,GAAK3wB,GAAUA,EAAOW,MAAQhB,KAAK+vB,SAAS/vB,KAAK+F,OAAO/E,MAAQhB,KAAK+vB,SAASjwB,OAAS,GAC/GE,KAAK6wB,oBAET,IAAK,IAAIryB,EAAI,EAAGiE,EAAMoC,EAAUrG,EAAIwyB,EAAcxyB,IAAK,CACnD,IAAIqC,EAAO4B,EAAIpB,UACfrB,KAAK+vB,SAAStuB,KAAK,CAAET,KAAMH,EAAKG,KAAMsJ,MAAOzJ,EAAK8J,eAAe9J,EAAKpC,cACtEgE,EAAM5B,EAAK5B,QAKfe,KAAK8vB,SAAYnjB,EACG,GAAd4jB,EAAkB,OAAM3uB,MACpB,IAAI,OAAMgvB,EAAiB9vB,EAAM7B,QAASsxB,EAAa,EAAG,GAAIA,EAAa,EAAGS,EAAe,EAAIlwB,EAAM8D,QAAU2rB,EAAa,GAF/G,IAAI,OAAMK,EAAiB9vB,EAAM7B,QAASsxB,EAAYQ,GAAQjwB,EAAM6D,UAAW7D,EAAM8D,SAIlH,iBACI,IAAK5E,KAAK8F,IAAIzF,OAAO6J,YACjB,OAAQ,EACZ,IAAqC0S,EAAjChE,EAAM5Y,KAAK+vB,SAAS/vB,KAAK+F,OAC7B,IAAK6S,EAAI5X,KAAKkJ,cAAgBknB,GAAiBpxB,KAAK8F,IAAK9F,KAAK8F,IAAIC,MAAO6S,EAAI5X,KAAM4X,EAAItO,OAAO,IACzFtK,KAAK8F,IAAIC,OAAS/F,KAAK+F,QAAU6W,EAAQ5c,KAAKqxB,eAAerxB,KAAK8F,OAAS8W,EAAM7W,OAAS/F,KAAK+F,MAChG,OAAQ,EACZ,IAAI,MAAEA,GAAU/F,KAAK8F,IAAKsC,EAAQpI,KAAK8F,IAAIsC,MAAMrC,GACjD,MAAOA,EAAQ,GAAKqC,GAASpI,KAAK8F,IAAIxF,MAAMyF,KACtCqC,EACN,OAAOA,EAEX,eAAetC,GACX2H,EAAM,IAAK,IAAIjP,EAAIoB,KAAKC,IAAIG,KAAK+F,MAAOD,EAAIC,OAAQvH,GAAK,EAAGA,IAAK,CAC7D,IAAI,MAAE8L,EAAK,KAAEtJ,GAAShB,KAAK+vB,SAASvxB,GAChC8yB,EAAY9yB,EAAIsH,EAAIC,OAASD,EAAIxF,IAAI9B,EAAI,IAAMsH,EAAIvH,KAAOuH,EAAIC,OAASvH,EAAI,IAC3EqxB,EAAMuB,GAAiBtrB,EAAKtH,EAAGwC,EAAMsJ,EAAOgnB,GAChD,GAAKzB,EAAL,CAEA,IAAK,IAAIpnB,EAAIjK,EAAI,EAAGiK,GAAK,EAAGA,IAAK,CAC7B,IAAI,MAAE6B,EAAK,KAAEtJ,GAAShB,KAAK+vB,SAAStnB,GAChCgL,EAAU2d,GAAiBtrB,EAAK2C,EAAGzH,EAAMsJ,GAAO,GACpD,IAAKmJ,GAAWA,EAAQhV,WACpB,SAASgP,EAEjB,MAAO,CAAE1H,MAAOvH,EAAGqxB,MAAK0B,KAAMD,EAAYxrB,EAAI+C,IAAIK,QAAQpD,EAAIsC,MAAM5J,EAAI,IAAMsH,KAGtF,MAAMA,GACF,IAAII,EAAQlG,KAAKqxB,eAAevrB,GAChC,IAAKI,EACD,OAAO,KACX,MAAOlG,KAAK+F,MAAQG,EAAMH,MACtB/F,KAAK6wB,oBACL3qB,EAAM2pB,IAAIpxB,aACVuB,KAAK6D,OAASstB,EAAcnxB,KAAK6D,OAAQqC,EAAMH,MAAOG,EAAM2pB,MAChE/pB,EAAMI,EAAMqrB,KACZ,IAAK,IAAI9oB,EAAIvC,EAAMH,MAAQ,EAAG0C,GAAK3C,EAAIC,MAAO0C,IAAK,CAC/C,IAAI5H,EAAOiF,EAAIjF,KAAK4H,GAAIqV,EAAMjd,EAAKG,KAAKuJ,aAAawG,WAAWlQ,EAAK5B,SAAS,EAAM6G,EAAIjE,MAAM4G,IAC9FzI,KAAK8wB,iBAAiBjwB,EAAKG,KAAMH,EAAK2C,MAAOsa,GAEjD,OAAOhY,EAEX,iBAAiB9E,EAAMwC,EAAQ,KAAMvE,GACjC,IAAI2Z,EAAM5Y,KAAK+vB,SAAS/vB,KAAK+F,OAC7B6S,EAAItO,MAAQsO,EAAItO,MAAMS,UAAU/J,GAChChB,KAAK6D,OAASstB,EAAcnxB,KAAK6D,OAAQ7D,KAAK+F,MAAO,OAAS9F,KAAKe,EAAKqD,OAAOb,EAAOvE,KACtFe,KAAK+vB,SAAStuB,KAAK,CAAET,OAAMsJ,MAAOtJ,EAAKuJ,eAE3C,oBACI,IAAI0N,EAAOjY,KAAK+vB,SAASjiB,MACrBgQ,EAAM7F,EAAK3N,MAAMyG,WAAW,OAASnP,OAAO,GAC5Ckc,EAAIrf,aACJuB,KAAK6D,OAASstB,EAAcnxB,KAAK6D,OAAQ7D,KAAK+vB,SAASjwB,OAAQge,KAG3E,SAAS8S,EAAiB/rB,EAAUkB,EAAOyrB,GACvC,OAAa,GAATzrB,EACOlB,EAAS0oB,WAAWiE,EAAO3sB,EAASpG,YACxCoG,EAASW,aAAa,EAAGX,EAAStD,WAAWQ,KAAK6uB,EAAiB/rB,EAAStD,WAAWtC,QAAS8G,EAAQ,EAAGyrB,KAEtH,SAASL,EAActsB,EAAUkB,EAAO9G,GACpC,OAAa,GAAT8G,EACOlB,EAASU,OAAOtG,GACpB4F,EAASW,aAAaX,EAASpG,WAAa,EAAGoG,EAASxD,UAAUU,KAAKovB,EAActsB,EAASxD,UAAUpC,QAAS8G,EAAQ,EAAG9G,KAEvI,SAASuxB,GAAU3rB,EAAUkB,GACzB,IAAK,IAAIvH,EAAI,EAAGA,EAAIuH,EAAOvH,IACvBqG,EAAWA,EAAStD,WAAWtC,QACnC,OAAO4F,EAEX,SAASosB,GAAepwB,EAAM8D,EAAWC,GACrC,GAAID,GAAa,EACb,OAAO9D,EACX,IAAI4L,EAAO5L,EAAK5B,QAQhB,OAPI0F,EAAY,IACZ8H,EAAOA,EAAKjH,aAAa,EAAGyrB,GAAexkB,EAAKlL,WAAYoD,EAAY,EAAsB,GAAnB8H,EAAKhO,WAAkBmG,EAAU,EAAI,KAChHD,EAAY,IACZ8H,EAAO5L,EAAKG,KAAKuJ,aAAawG,WAAWtE,GAAMlH,OAAOkH,GAClD7H,GAAW,IACX6H,EAAOA,EAAKlH,OAAO1E,EAAKG,KAAKuJ,aAAaC,cAAciC,GAAMsE,WAAW,OAASnP,OAAO,MAE1Ff,EAAKkB,KAAK0K,GAErB,SAAS2kB,GAAiBtrB,EAAKC,EAAO/E,EAAMsJ,EAAO2N,GAC/C,IAAIpX,EAAOiF,EAAIjF,KAAKkF,GAAQlE,EAAQoW,EAAOnS,EAAIuD,WAAWtD,GAASD,EAAIjE,MAAMkE,GAC7E,GAAIlE,GAAShB,EAAKpC,aAAeuC,EAAKyF,kBAAkB5F,EAAKG,MACzD,OAAO,KACX,IAAI6uB,EAAMvlB,EAAMyG,WAAWlQ,EAAK5B,SAAS,EAAM4C,GAC/C,OAAOguB,IAAQ4B,GAAazwB,EAAMH,EAAK5B,QAAS4C,GAASguB,EAAM,KAEnE,SAAS4B,GAAazwB,EAAM6D,EAAUtE,GAClC,IAAK,IAAI/B,EAAI+B,EAAO/B,EAAIqG,EAASpG,WAAYD,IACzC,IAAKwC,EAAK8J,YAAYjG,EAASlG,MAAMH,GAAG4F,OACpC,OAAO,EACf,OAAO,EAEX,SAASstB,GAAe1wB,GACpB,OAAOA,EAAKC,KAAK0wB,UAAY3wB,EAAKC,KAAK2wB,mBAE3C,SAAS5R,GAAaN,EAAIzf,EAAMC,EAAIY,GAChC,IAAKA,EAAM5B,KACP,OAAOwgB,EAAGQ,YAAYjgB,EAAMC,GAChC,IAAI2F,EAAQ6Z,EAAG7W,IAAIK,QAAQjJ,GAAO6F,EAAM4Z,EAAG7W,IAAIK,QAAQhJ,GACvD,GAAIyvB,EAAc9pB,EAAOC,EAAKhF,GAC1B,OAAO4e,EAAG+C,KAAK,IAAIsJ,EAAY9rB,EAAMC,EAAIY,IAC7C,IAAI+wB,EAAeC,GAAcjsB,EAAO6Z,EAAG7W,IAAIK,QAAQhJ,IAEV,GAAzC2xB,EAAaA,EAAa/xB,OAAS,IACnC+xB,EAAa/jB,MAGjB,IAAIikB,IAAoBlsB,EAAME,MAAQ,GACtC8rB,EAAaG,QAAQD,GAKrB,IAAK,IAAItpB,EAAI5C,EAAME,MAAOxH,EAAMsH,EAAMtH,IAAM,EAAGkK,EAAI,EAAGA,IAAKlK,IAAO,CAC9D,IAAI0C,EAAO4E,EAAMhF,KAAK4H,GAAGzH,KAAKC,KAC9B,GAAIA,EAAK0wB,UAAY1wB,EAAKgxB,mBAAqBhxB,EAAKiE,UAChD,MACA2sB,EAAa3kB,QAAQzE,IAAM,EAC3BspB,EAAkBtpB,EACb5C,EAAMuD,OAAOX,IAAMlK,GACxBszB,EAAa5d,OAAO,EAAG,GAAIxL,GAInC,IAAIypB,EAAuBL,EAAa3kB,QAAQ6kB,GAC5CI,EAAY,GAAIC,EAAiBtxB,EAAM6D,UAC3C,IAAK,IAAI1F,EAAU6B,EAAM7B,QAAST,EAAI,GAAIA,IAAK,CAC3C,IAAIqC,EAAO5B,EAAQsC,WAEnB,GADA4wB,EAAU1wB,KAAKZ,GACXrC,GAAKsC,EAAM6D,UACX,MACJ1F,EAAU4B,EAAK5B,QAInB,IAAK,IAAIwJ,EAAI2pB,EAAiB,EAAG3pB,GAAK,EAAGA,IAAK,CAC1C,IAAIzH,EAAOmxB,EAAU1pB,GAAGzH,KAAMqxB,EAAMX,GAAe1wB,GACnD,GAAIqxB,GAAOxsB,EAAMhF,KAAKqxB,GAAsBlxB,MAAQA,EAChDoxB,EAAiB3pB,OAChB,GAAI4pB,IAAQrxB,EAAKkJ,YAClB,MAER,IAAK,IAAIlL,EAAI8B,EAAM6D,UAAW3F,GAAK,EAAGA,IAAK,CACvC,IAAIszB,GAAatzB,EAAIozB,EAAiB,IAAMtxB,EAAM6D,UAAY,GAC1De,EAASysB,EAAUG,GACvB,GAAK5sB,EAEL,IAAK,IAAIlH,EAAI,EAAGA,EAAIqzB,EAAa/xB,OAAQtB,IAAK,CAG1C,IAAI+zB,EAAcV,GAAcrzB,EAAI0zB,GAAwBL,EAAa/xB,QAAS0yB,GAAS,EACvFD,EAAc,IACdC,GAAS,EACTD,GAAeA,GAEnB,IAAIlyB,EAASwF,EAAMhF,KAAK0xB,EAAc,GAAI1wB,EAAQgE,EAAMhE,MAAM0wB,EAAc,GAC5E,GAAIlyB,EAAO4tB,eAAepsB,EAAOA,EAAO6D,EAAO1E,KAAM0E,EAAOtB,OACxD,OAAOsb,EAAG9Z,QAAQC,EAAMuD,OAAOmpB,GAAcC,EAAS1sB,EAAIsC,MAAMmqB,GAAeryB,EAAI,IAAI,OAAMuyB,GAAc3xB,EAAM7B,QAAS,EAAG6B,EAAM6D,UAAW2tB,GAAYA,EAAWxxB,EAAM8D,WAGvL,IAAI8tB,EAAahT,EAAGI,MAAMhgB,OAC1B,IAAK,IAAItB,EAAIqzB,EAAa/xB,OAAS,EAAGtB,GAAK,EAAGA,IAAK,CAE/C,GADAkhB,EAAG9Z,QAAQ3F,EAAMC,EAAIY,GACjB4e,EAAGI,MAAMhgB,OAAS4yB,EAClB,MACJ,IAAI3sB,EAAQ8rB,EAAarzB,GACrBuH,EAAQ,IAEZ9F,EAAO4F,EAAMuD,OAAOrD,GACpB7F,EAAK4F,EAAIsC,MAAMrC,KAGvB,SAAS0sB,GAAc5tB,EAAUkB,EAAO4sB,EAASC,EAASvyB,GACtD,GAAI0F,EAAQ4sB,EAAS,CACjB,IAAIrxB,EAAQuD,EAAStD,WACrBsD,EAAWA,EAASW,aAAa,EAAGlE,EAAMS,KAAK0wB,GAAcnxB,EAAMrC,QAAS8G,EAAQ,EAAG4sB,EAASC,EAAStxB,KAE7G,GAAIyE,EAAQ6sB,EAAS,CACjB,IAAItoB,EAAQjK,EAAOsK,eAAe,GAC9BpK,EAAQ+J,EAAMyG,WAAWlM,GAAUU,OAAOV,GAC9CA,EAAWtE,EAAMgF,OAAO+E,EAAME,cAAcjK,GAAOwQ,WAAW,OAASnP,OAAO,IAElF,OAAOiD,EAEX,SAASsb,GAAiBT,EAAIzf,EAAMC,EAAIW,GACpC,IAAKA,EAAKwH,UAAYpI,GAAQC,GAAMwf,EAAG7W,IAAIK,QAAQjJ,GAAMI,OAAOpB,QAAQC,KAAM,CAC1E,IAAI2zB,EAAQzD,EAAY1P,EAAG7W,IAAK5I,EAAMY,EAAKG,MAC9B,MAAT6xB,IACA5yB,EAAOC,EAAK2yB,GAEpBnT,EAAGM,aAAa/f,EAAMC,EAAI,IAAI,OAAM,OAASD,KAAKY,GAAO,EAAG,IAEhE,SAASqf,GAAYR,EAAIzf,EAAMC,GAC3B,IAAI2F,EAAQ6Z,EAAG7W,IAAIK,QAAQjJ,GAAO6F,EAAM4Z,EAAG7W,IAAIK,QAAQhJ,GACnD4yB,EAAUhB,GAAcjsB,EAAOC,GACnC,IAAK,IAAItH,EAAI,EAAGA,EAAIs0B,EAAQhzB,OAAQtB,IAAK,CACrC,IAAIuH,EAAQ+sB,EAAQt0B,GAAI4C,EAAO5C,GAAKs0B,EAAQhzB,OAAS,EACrD,GAAKsB,GAAiB,GAAT2E,GAAeF,EAAMhF,KAAKkF,GAAO/E,KAAKuJ,aAAaM,SAC5D,OAAO6U,EAAGwC,OAAOrc,EAAMtF,MAAMwF,GAAQD,EAAIxF,IAAIyF,IACjD,GAAIA,EAAQ,IAAM3E,GAAQyE,EAAMhF,KAAKkF,EAAQ,GAAGJ,WAAWE,EAAMhE,MAAMkE,EAAQ,GAAID,EAAIuD,WAAWtD,EAAQ,KACtG,OAAO2Z,EAAGwC,OAAOrc,EAAMuD,OAAOrD,GAAQD,EAAIsC,MAAMrC,IAExD,IAAK,IAAI0C,EAAI,EAAGA,GAAK5C,EAAME,OAAS0C,GAAK3C,EAAIC,MAAO0C,IAChD,GAAIxI,EAAO4F,EAAMtF,MAAMkI,IAAM5C,EAAME,MAAQ0C,GAAKvI,EAAK2F,EAAMvF,IAAImI,IAAM3C,EAAIxF,IAAImI,GAAKvI,GAAM4F,EAAIC,MAAQ0C,EAChG,OAAOiX,EAAGwC,OAAOrc,EAAMuD,OAAOX,GAAIvI,GAE1Cwf,EAAGwC,OAAOjiB,EAAMC,GAIpB,SAAS4xB,GAAcjsB,EAAOC,GAC1B,IAAIpE,EAAS,GAAI2a,EAAWzc,KAAKC,IAAIgG,EAAME,MAAOD,EAAIC,OACtD,IAAK,IAAI0C,EAAI4T,EAAU5T,GAAK,EAAGA,IAAK,CAChC,IAAIlI,EAAQsF,EAAMtF,MAAMkI,GACxB,GAAIlI,EAAQsF,EAAMtH,KAAOsH,EAAME,MAAQ0C,IACnC3C,EAAIxF,IAAImI,GAAK3C,EAAIvH,KAAOuH,EAAIC,MAAQ0C,IACpC5C,EAAMhF,KAAK4H,GAAGzH,KAAKC,KAAKiE,WACxBY,EAAIjF,KAAK4H,GAAGzH,KAAKC,KAAKiE,UACtB,OACA3E,GAASuF,EAAIvF,MAAMkI,IAClBA,GAAK5C,EAAME,OAAS0C,GAAK3C,EAAIC,OAASF,EAAMxF,OAAOqI,eAAiB5C,EAAIzF,OAAOqI,eAC5ED,GAAK3C,EAAIvF,MAAMkI,EAAI,IAAMlI,EAAQ,IACrCmB,EAAOD,KAAKgH,GAEpB,OAAO/G,EAMX,MAAMqxB,WAAiBlI,EAInB,YAIAtsB,EAIAuR,EAEA9M,GACIyI,QACAzL,KAAKzB,IAAMA,EACXyB,KAAK8P,KAAOA,EACZ9P,KAAKgD,MAAQA,EAEjB,MAAM6F,GACF,IAAIhI,EAAOgI,EAAI8iB,OAAO3rB,KAAKzB,KAC3B,IAAKsC,EACD,OAAOmqB,EAAWG,KAAK,wCAC3B,IAAI3nB,EAAQ+F,OAAOlF,OAAO,MAC1B,IAAK,IAAIJ,KAAQpD,EAAK2C,MAClBA,EAAMS,GAAQpD,EAAK2C,MAAMS,GAC7BT,EAAMxD,KAAK8P,MAAQ9P,KAAKgD,MACxB,IAAIogB,EAAUviB,EAAKG,KAAKqD,OAAOb,EAAO,KAAM3C,EAAKuD,OACjD,OAAO4mB,EAAWQ,YAAY3iB,EAAK7I,KAAKzB,IAAKyB,KAAKzB,IAAM,EAAG,IAAI,OAAM,OAAS0B,KAAKmjB,GAAU,EAAGviB,EAAKE,OAAS,EAAI,IAEtH,SACI,OAAOkoB,EAAQrnB,MAEnB,OAAOiH,GACH,OAAO,IAAIkqB,GAAS/yB,KAAKzB,IAAKyB,KAAK8P,KAAMjH,EAAI8iB,OAAO3rB,KAAKzB,KAAKiF,MAAMxD,KAAK8P,OAE7E,IAAIiQ,GACA,IAAIxhB,EAAMwhB,EAAQ+B,UAAU9hB,KAAKzB,IAAK,GACtC,OAAOA,EAAIutB,aAAe,KAAO,IAAIiH,GAASx0B,EAAIA,IAAKyB,KAAK8P,KAAM9P,KAAKgD,OAE3E,SACI,MAAO,CAAE8nB,SAAU,OAAQvsB,IAAKyB,KAAKzB,IAAKuR,KAAM9P,KAAK8P,KAAM9M,MAAOhD,KAAKgD,OAE3E,gBAAgBD,EAAQoB,GACpB,GAAuB,iBAAZA,EAAK5F,KAAuC,iBAAb4F,EAAK2L,KAC3C,MAAM,IAAI3N,WAAW,uCACzB,OAAO,IAAI4wB,GAAS5uB,EAAK5F,IAAK4F,EAAK2L,KAAM3L,EAAKnB,QAGtD6nB,EAAK9J,OAAO,OAAQgS,IAKpB,IAAIC,GAAiB,cAAcvuB,QAEnCuuB,GAAiB,SAASA,EAAe9H,GACrC,IAAI7e,EAAM5H,MAAM8M,KAAKvR,KAAMkrB,GAE3B,OADA7e,EAAI4mB,UAAYD,EAAe1nB,UACxBe,GAEX2mB,GAAe1nB,UAAY/B,OAAOlF,OAAOI,MAAM6G,WAC/C0nB,GAAe1nB,UAAU4nB,YAAcF,GACvCA,GAAe1nB,UAAUrH,KAAO,iBAQhC,MAAMkvB,GAIF,YAKAtqB,GACI7I,KAAK6I,IAAMA,EAIX7I,KAAK8f,MAAQ,GAIb9f,KAAKozB,KAAO,GAIZpzB,KAAK+f,QAAU,IAAIgK,EAKvB,aAAe,OAAO/pB,KAAKozB,KAAKtzB,OAASE,KAAKozB,KAAK,GAAKpzB,KAAK6I,IAK7D,KAAK4Z,GACD,IAAI/gB,EAAS1B,KAAKqzB,UAAU5Q,GAC5B,GAAI/gB,EAAOupB,OACP,MAAM,IAAI+H,GAAetxB,EAAOupB,QACpC,OAAOjrB,KAMX,UAAUyiB,GACN,IAAI/gB,EAAS+gB,EAAK6B,MAAMtkB,KAAK6I,KAG7B,OAFKnH,EAAOupB,QACRjrB,KAAK4jB,QAAQnB,EAAM/gB,EAAOmH,KACvBnH,EAMX,iBACI,OAAO1B,KAAK8f,MAAMhgB,OAAS,EAK/B,QAAQ2iB,EAAM5Z,GACV7I,KAAKozB,KAAK3xB,KAAKzB,KAAK6I,KACpB7I,KAAK8f,MAAMre,KAAKghB,GAChBziB,KAAK+f,QAAQuK,UAAU7H,EAAK6Q,UAC5BtzB,KAAK6I,IAAMA,EAMf,QAAQ5I,EAAMC,EAAKD,EAAMa,EAAQ,OAAMc,OACnC,IAAI6gB,EAAOiN,EAAY1vB,KAAK6I,IAAK5I,EAAMC,EAAIY,GAG3C,OAFI2hB,GACAziB,KAAKyiB,KAAKA,GACPziB,KAMX,YAAYC,EAAMC,EAAIjB,GAClB,OAAOe,KAAK4F,QAAQ3F,EAAMC,EAAI,IAAI,OAAM,OAASD,KAAKhB,GAAU,EAAG,IAKvE,OAAOgB,EAAMC,GACT,OAAOF,KAAK4F,QAAQ3F,EAAMC,EAAI,OAAM0B,OAKxC,OAAOrD,EAAKU,GACR,OAAOe,KAAK8jB,YAAYvlB,EAAKA,EAAKU,GAqBtC,aAAagB,EAAMC,EAAIY,GAEnB,OADAkf,GAAahgB,KAAMC,EAAMC,EAAIY,GACtBd,KAWX,iBAAiBC,EAAMC,EAAIW,GAEvB,OADAsf,GAAiBngB,KAAMC,EAAMC,EAAIW,GAC1Bb,KAMX,YAAYC,EAAMC,GAEd,OADAggB,GAAYlgB,KAAMC,EAAMC,GACjBF,KASX,KAAK6mB,EAAO/f,GAER,OADA+gB,EAAK7nB,KAAM6mB,EAAO/f,GACX9G,KAMX,KAAKzB,EAAKwH,EAAQ,GAEd,OADApD,EAAK3C,KAAMzB,EAAKwH,GACT/F,KAOX,KAAK6mB,EAAOM,GAER,OADA7P,EAAKtX,KAAM6mB,EAAOM,GACXnnB,KAMX,aAAaC,EAAMC,EAAKD,EAAMe,EAAMwC,EAAQ,MAExC,OADA6qB,EAAaruB,KAAMC,EAAMC,EAAIc,EAAMwC,GAC5BxD,KAMX,cAAczB,EAAKyC,EAAMwC,EAAQ,KAAMY,EAAQ,IAE3C,OADAqqB,EAAczuB,KAAMzB,EAAKyC,EAAMwC,EAAOY,GAC/BpE,KAKX,iBAAiBzB,EAAKuR,EAAM9M,GAExB,OADAhD,KAAKyiB,KAAK,IAAIsQ,GAASx0B,EAAKuR,EAAM9M,IAC3BhD,KAKX,YAAYzB,EAAKgU,GAEb,OADAvS,KAAKyiB,KAAK,IAAIiJ,EAAgBntB,EAAKgU,IAC5BvS,KAMX,eAAezB,EAAKgU,GAChB,KAAMA,aAAgB,QAAO,CACzB,IAAI1R,EAAOb,KAAK6I,IAAI8iB,OAAOptB,GAC3B,IAAKsC,EACD,MAAM,IAAIsB,WAAW,uBAAyB5D,GAElD,GADAgU,EAAOA,EAAKrK,QAAQrH,EAAKuD,QACpBmO,EACD,OAAOvS,KAGf,OADAA,KAAKyiB,KAAK,IAAIoJ,EAAmBttB,EAAKgU,IAC/BvS,KASX,MAAMzB,EAAKwH,EAAQ,EAAG6oB,GAElB,OADA/gB,EAAM7N,KAAMzB,EAAKwH,EAAO6oB,GACjB5uB,KAKX,QAAQC,EAAMC,EAAIqS,GAEd,OADAka,EAAQzsB,KAAMC,EAAMC,EAAIqS,GACjBvS,KAQX,WAAWC,EAAMC,EAAIqS,GAEjB,OADAwa,EAAW/sB,KAAMC,EAAMC,EAAIqS,GACpBvS,KAQX,kBAAkBzB,EAAK2uB,EAAY5iB,GAE/B,OADA2iB,EAAkBjtB,KAAMzB,EAAK2uB,EAAY5iB,GAClCtK,Q,kCC58Df,8DAGA,MAAMuzB,EAA0B,oBAAbC,WAA2B,qBAAqBhlB,KAAKglB,UAAUC,UAClF,SAASC,EAAiBzvB,GACtB,IAGI0vB,EAAKC,EAAMrmB,EAAO8V,EAHlBnH,EAAQjY,EAAK4J,MAAM,UAAWnM,EAASwa,EAAMA,EAAMpc,OAAS,GAClD,SAAV4B,IACAA,EAAS,KAEb,IAAK,IAAIlD,EAAI,EAAGA,EAAI0d,EAAMpc,OAAS,EAAGtB,IAAK,CACvC,IAAIq1B,EAAM3X,EAAM1d,GAChB,GAAI,kBAAkBgQ,KAAKqlB,GACvBxQ,GAAO,OACN,GAAI,YAAY7U,KAAKqlB,GACtBF,GAAM,OACL,GAAI,sBAAsBnlB,KAAKqlB,GAChCD,GAAO,OACN,GAAI,cAAcplB,KAAKqlB,GACxBtmB,GAAQ,MACP,KAAI,SAASiB,KAAKqlB,GAOnB,MAAM,IAAIpvB,MAAM,+BAAiCovB,GAN7CN,EACAlQ,GAAO,EAEPuQ,GAAO,GAanB,OARID,IACAjyB,EAAS,OAASA,GAClBkyB,IACAlyB,EAAS,QAAUA,GACnB2hB,IACA3hB,EAAS,QAAUA,GACnB6L,IACA7L,EAAS,SAAWA,GACjBA,EAEX,SAASoyB,EAAUlxB,GACf,IAAIb,EAAOwH,OAAOlF,OAAO,MACzB,IAAK,IAAIwN,KAAQjP,EACbb,EAAK2xB,EAAiB7hB,IAASjP,EAAIiP,GACvC,OAAO9P,EAEX,SAASgyB,EAAU9vB,EAAM+vB,EAAOzmB,GAS5B,OARIymB,EAAMC,SACNhwB,EAAO,OAASA,GAChB+vB,EAAME,UACNjwB,EAAO,QAAUA,GACjB+vB,EAAMG,UACNlwB,EAAO,QAAUA,IACP,IAAVsJ,GAAmBymB,EAAMI,WACzBnwB,EAAO,SAAWA,GACfA,EAiCX,SAASowB,EAAOC,GACZ,OAAO,IAAI,OAAO,CAAEhO,MAAO,CAAEiO,cAAeC,EAAeF,MAO/D,SAASE,EAAeF,GACpB,IAAI1xB,EAAMkxB,EAAUQ,GACpB,OAAO,SAAUG,EAAMT,GACnB,IAAqEU,EAAjEzwB,EAAO,eAAQ+vB,GAAQW,EAAwB,GAAf1wB,EAAKnE,QAAuB,KAARmE,EACpD2wB,EAAShyB,EAAImxB,EAAU9vB,EAAM+vB,GAAQW,IACzC,GAAIC,GAAUA,EAAOH,EAAKhlB,MAAOglB,EAAK7N,SAAU6N,GAC5C,OAAO,EACX,GAAIE,IAAWX,EAAMI,UAAYJ,EAAMC,QAAUD,EAAMG,SAAWlwB,EAAK6P,WAAW,GAAK,OAClF4gB,EAAW,OAAKV,EAAMa,WAAaH,GAAYzwB,EAAM,CAKtD,IAAI6wB,EAAWlyB,EAAImxB,EAAUW,EAAUV,GAAO,IAC9C,GAAIc,GAAYA,EAASL,EAAKhlB,MAAOglB,EAAK7N,SAAU6N,GAChD,OAAO,OAEV,GAAIE,GAAUX,EAAMI,SAAU,CAG/B,IAAIW,EAAYnyB,EAAImxB,EAAU9vB,EAAM+vB,GAAO,IAC3C,GAAIe,GAAaA,EAAUN,EAAKhlB,MAAOglB,EAAK7N,SAAU6N,GAClD,OAAO,EAEf,OAAO","file":"js/group-account~group-homework~group-lesson~group-profile~group-teacher-approval~a4660fb7.5354183b.js","sourcesContent":["import OrderedMap from 'orderedmap';\n\nfunction findDiffStart(a, b, pos) {\n    for (let i = 0;; i++) {\n        if (i == a.childCount || i == b.childCount)\n            return a.childCount == b.childCount ? null : pos;\n        let childA = a.child(i), childB = b.child(i);\n        if (childA == childB) {\n            pos += childA.nodeSize;\n            continue;\n        }\n        if (!childA.sameMarkup(childB))\n            return pos;\n        if (childA.isText && childA.text != childB.text) {\n            for (let j = 0; childA.text[j] == childB.text[j]; j++)\n                pos++;\n            return pos;\n        }\n        if (childA.content.size || childB.content.size) {\n            let inner = findDiffStart(childA.content, childB.content, pos + 1);\n            if (inner != null)\n                return inner;\n        }\n        pos += childA.nodeSize;\n    }\n}\nfunction findDiffEnd(a, b, posA, posB) {\n    for (let iA = a.childCount, iB = b.childCount;;) {\n        if (iA == 0 || iB == 0)\n            return iA == iB ? null : { a: posA, b: posB };\n        let childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;\n        if (childA == childB) {\n            posA -= size;\n            posB -= size;\n            continue;\n        }\n        if (!childA.sameMarkup(childB))\n            return { a: posA, b: posB };\n        if (childA.isText && childA.text != childB.text) {\n            let same = 0, minSize = Math.min(childA.text.length, childB.text.length);\n            while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {\n                same++;\n                posA--;\n                posB--;\n            }\n            return { a: posA, b: posB };\n        }\n        if (childA.content.size || childB.content.size) {\n            let inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);\n            if (inner)\n                return inner;\n        }\n        posA -= size;\n        posB -= size;\n    }\n}\n\n/**\nA fragment represents a node's collection of child nodes.\n\nLike nodes, fragments are persistent data structures, and you\nshould not mutate them or their content. Rather, you create new\ninstances whenever needed. The API tries to make this easy.\n*/\nclass Fragment {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    content, size) {\n        this.content = content;\n        this.size = size || 0;\n        if (size == null)\n            for (let i = 0; i < content.length; i++)\n                this.size += content[i].nodeSize;\n    }\n    /**\n    Invoke a callback for all descendant nodes between the given two\n    positions (relative to start of this fragment). Doesn't descend\n    into a node when the callback returns `false`.\n    */\n    nodesBetween(from, to, f, nodeStart = 0, parent) {\n        for (let i = 0, pos = 0; pos < to; i++) {\n            let child = this.content[i], end = pos + child.nodeSize;\n            if (end > from && f(child, nodeStart + pos, parent || null, i) !== false && child.content.size) {\n                let start = pos + 1;\n                child.nodesBetween(Math.max(0, from - start), Math.min(child.content.size, to - start), f, nodeStart + start);\n            }\n            pos = end;\n        }\n    }\n    /**\n    Call the given callback for every descendant node. `pos` will be\n    relative to the start of the fragment. The callback may return\n    `false` to prevent traversal of a given node's children.\n    */\n    descendants(f) {\n        this.nodesBetween(0, this.size, f);\n    }\n    /**\n    Extract the text between `from` and `to`. See the same method on\n    [`Node`](https://prosemirror.net/docs/ref/#model.Node.textBetween).\n    */\n    textBetween(from, to, blockSeparator, leafText) {\n        let text = \"\", separated = true;\n        this.nodesBetween(from, to, (node, pos) => {\n            if (node.isText) {\n                text += node.text.slice(Math.max(from, pos) - pos, to - pos);\n                separated = !blockSeparator;\n            }\n            else if (node.isLeaf) {\n                if (leafText) {\n                    text += typeof leafText === \"function\" ? leafText(node) : leafText;\n                }\n                else if (node.type.spec.leafText) {\n                    text += node.type.spec.leafText(node);\n                }\n                separated = !blockSeparator;\n            }\n            else if (!separated && node.isBlock) {\n                text += blockSeparator;\n                separated = true;\n            }\n        }, 0);\n        return text;\n    }\n    /**\n    Create a new fragment containing the combined content of this\n    fragment and the other.\n    */\n    append(other) {\n        if (!other.size)\n            return this;\n        if (!this.size)\n            return other;\n        let last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;\n        if (last.isText && last.sameMarkup(first)) {\n            content[content.length - 1] = last.withText(last.text + first.text);\n            i = 1;\n        }\n        for (; i < other.content.length; i++)\n            content.push(other.content[i]);\n        return new Fragment(content, this.size + other.size);\n    }\n    /**\n    Cut out the sub-fragment between the two given positions.\n    */\n    cut(from, to = this.size) {\n        if (from == 0 && to == this.size)\n            return this;\n        let result = [], size = 0;\n        if (to > from)\n            for (let i = 0, pos = 0; pos < to; i++) {\n                let child = this.content[i], end = pos + child.nodeSize;\n                if (end > from) {\n                    if (pos < from || end > to) {\n                        if (child.isText)\n                            child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos));\n                        else\n                            child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1));\n                    }\n                    result.push(child);\n                    size += child.nodeSize;\n                }\n                pos = end;\n            }\n        return new Fragment(result, size);\n    }\n    /**\n    @internal\n    */\n    cutByIndex(from, to) {\n        if (from == to)\n            return Fragment.empty;\n        if (from == 0 && to == this.content.length)\n            return this;\n        return new Fragment(this.content.slice(from, to));\n    }\n    /**\n    Create a new fragment in which the node at the given index is\n    replaced by the given node.\n    */\n    replaceChild(index, node) {\n        let current = this.content[index];\n        if (current == node)\n            return this;\n        let copy = this.content.slice();\n        let size = this.size + node.nodeSize - current.nodeSize;\n        copy[index] = node;\n        return new Fragment(copy, size);\n    }\n    /**\n    Create a new fragment by prepending the given node to this\n    fragment.\n    */\n    addToStart(node) {\n        return new Fragment([node].concat(this.content), this.size + node.nodeSize);\n    }\n    /**\n    Create a new fragment by appending the given node to this\n    fragment.\n    */\n    addToEnd(node) {\n        return new Fragment(this.content.concat(node), this.size + node.nodeSize);\n    }\n    /**\n    Compare this fragment to another one.\n    */\n    eq(other) {\n        if (this.content.length != other.content.length)\n            return false;\n        for (let i = 0; i < this.content.length; i++)\n            if (!this.content[i].eq(other.content[i]))\n                return false;\n        return true;\n    }\n    /**\n    The first child of the fragment, or `null` if it is empty.\n    */\n    get firstChild() { return this.content.length ? this.content[0] : null; }\n    /**\n    The last child of the fragment, or `null` if it is empty.\n    */\n    get lastChild() { return this.content.length ? this.content[this.content.length - 1] : null; }\n    /**\n    The number of child nodes in this fragment.\n    */\n    get childCount() { return this.content.length; }\n    /**\n    Get the child node at the given index. Raise an error when the\n    index is out of range.\n    */\n    child(index) {\n        let found = this.content[index];\n        if (!found)\n            throw new RangeError(\"Index \" + index + \" out of range for \" + this);\n        return found;\n    }\n    /**\n    Get the child node at the given index, if it exists.\n    */\n    maybeChild(index) {\n        return this.content[index] || null;\n    }\n    /**\n    Call `f` for every child node, passing the node, its offset\n    into this parent node, and its index.\n    */\n    forEach(f) {\n        for (let i = 0, p = 0; i < this.content.length; i++) {\n            let child = this.content[i];\n            f(child, p, i);\n            p += child.nodeSize;\n        }\n    }\n    /**\n    Find the first position at which this fragment and another\n    fragment differ, or `null` if they are the same.\n    */\n    findDiffStart(other, pos = 0) {\n        return findDiffStart(this, other, pos);\n    }\n    /**\n    Find the first position, searching from the end, at which this\n    fragment and the given fragment differ, or `null` if they are\n    the same. Since this position will not be the same in both\n    nodes, an object with two separate positions is returned.\n    */\n    findDiffEnd(other, pos = this.size, otherPos = other.size) {\n        return findDiffEnd(this, other, pos, otherPos);\n    }\n    /**\n    Find the index and inner offset corresponding to a given relative\n    position in this fragment. The result object will be reused\n    (overwritten) the next time the function is called. (Not public.)\n    */\n    findIndex(pos, round = -1) {\n        if (pos == 0)\n            return retIndex(0, pos);\n        if (pos == this.size)\n            return retIndex(this.content.length, pos);\n        if (pos > this.size || pos < 0)\n            throw new RangeError(`Position ${pos} outside of fragment (${this})`);\n        for (let i = 0, curPos = 0;; i++) {\n            let cur = this.child(i), end = curPos + cur.nodeSize;\n            if (end >= pos) {\n                if (end == pos || round > 0)\n                    return retIndex(i + 1, end);\n                return retIndex(i, curPos);\n            }\n            curPos = end;\n        }\n    }\n    /**\n    Return a debugging string that describes this fragment.\n    */\n    toString() { return \"<\" + this.toStringInner() + \">\"; }\n    /**\n    @internal\n    */\n    toStringInner() { return this.content.join(\", \"); }\n    /**\n    Create a JSON-serializeable representation of this fragment.\n    */\n    toJSON() {\n        return this.content.length ? this.content.map(n => n.toJSON()) : null;\n    }\n    /**\n    Deserialize a fragment from its JSON representation.\n    */\n    static fromJSON(schema, value) {\n        if (!value)\n            return Fragment.empty;\n        if (!Array.isArray(value))\n            throw new RangeError(\"Invalid input for Fragment.fromJSON\");\n        return new Fragment(value.map(schema.nodeFromJSON));\n    }\n    /**\n    Build a fragment from an array of nodes. Ensures that adjacent\n    text nodes with the same marks are joined together.\n    */\n    static fromArray(array) {\n        if (!array.length)\n            return Fragment.empty;\n        let joined, size = 0;\n        for (let i = 0; i < array.length; i++) {\n            let node = array[i];\n            size += node.nodeSize;\n            if (i && node.isText && array[i - 1].sameMarkup(node)) {\n                if (!joined)\n                    joined = array.slice(0, i);\n                joined[joined.length - 1] = node\n                    .withText(joined[joined.length - 1].text + node.text);\n            }\n            else if (joined) {\n                joined.push(node);\n            }\n        }\n        return new Fragment(joined || array, size);\n    }\n    /**\n    Create a fragment from something that can be interpreted as a\n    set of nodes. For `null`, it returns the empty fragment. For a\n    fragment, the fragment itself. For a node or array of nodes, a\n    fragment containing those nodes.\n    */\n    static from(nodes) {\n        if (!nodes)\n            return Fragment.empty;\n        if (nodes instanceof Fragment)\n            return nodes;\n        if (Array.isArray(nodes))\n            return this.fromArray(nodes);\n        if (nodes.attrs)\n            return new Fragment([nodes], nodes.nodeSize);\n        throw new RangeError(\"Can not convert \" + nodes + \" to a Fragment\" +\n            (nodes.nodesBetween ? \" (looks like multiple versions of prosemirror-model were loaded)\" : \"\"));\n    }\n}\n/**\nAn empty fragment. Intended to be reused whenever a node doesn't\ncontain anything (rather than allocating a new empty fragment for\neach leaf node).\n*/\nFragment.empty = new Fragment([], 0);\nconst found = { index: 0, offset: 0 };\nfunction retIndex(index, offset) {\n    found.index = index;\n    found.offset = offset;\n    return found;\n}\n\nfunction compareDeep(a, b) {\n    if (a === b)\n        return true;\n    if (!(a && typeof a == \"object\") ||\n        !(b && typeof b == \"object\"))\n        return false;\n    let array = Array.isArray(a);\n    if (Array.isArray(b) != array)\n        return false;\n    if (array) {\n        if (a.length != b.length)\n            return false;\n        for (let i = 0; i < a.length; i++)\n            if (!compareDeep(a[i], b[i]))\n                return false;\n    }\n    else {\n        for (let p in a)\n            if (!(p in b) || !compareDeep(a[p], b[p]))\n                return false;\n        for (let p in b)\n            if (!(p in a))\n                return false;\n    }\n    return true;\n}\n\n/**\nA mark is a piece of information that can be attached to a node,\nsuch as it being emphasized, in code font, or a link. It has a\ntype and optionally a set of attributes that provide further\ninformation (such as the target of the link). Marks are created\nthrough a `Schema`, which controls which types exist and which\nattributes they have.\n*/\nclass Mark {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The type of this mark.\n    */\n    type, \n    /**\n    The attributes associated with this mark.\n    */\n    attrs) {\n        this.type = type;\n        this.attrs = attrs;\n    }\n    /**\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](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) with this mark are present,\n    those are replaced by this one.\n    */\n    addToSet(set) {\n        let copy, placed = false;\n        for (let i = 0; i < set.length; i++) {\n            let other = set[i];\n            if (this.eq(other))\n                return set;\n            if (this.type.excludes(other.type)) {\n                if (!copy)\n                    copy = set.slice(0, i);\n            }\n            else if (other.type.excludes(this.type)) {\n                return set;\n            }\n            else {\n                if (!placed && other.type.rank > this.type.rank) {\n                    if (!copy)\n                        copy = set.slice(0, i);\n                    copy.push(this);\n                    placed = true;\n                }\n                if (copy)\n                    copy.push(other);\n            }\n        }\n        if (!copy)\n            copy = set.slice();\n        if (!placed)\n            copy.push(this);\n        return copy;\n    }\n    /**\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.\n    */\n    removeFromSet(set) {\n        for (let i = 0; i < set.length; i++)\n            if (this.eq(set[i]))\n                return set.slice(0, i).concat(set.slice(i + 1));\n        return set;\n    }\n    /**\n    Test whether this mark is in the given set of marks.\n    */\n    isInSet(set) {\n        for (let i = 0; i < set.length; i++)\n            if (this.eq(set[i]))\n                return true;\n        return false;\n    }\n    /**\n    Test whether this mark has the same type and attributes as\n    another mark.\n    */\n    eq(other) {\n        return this == other ||\n            (this.type == other.type && compareDeep(this.attrs, other.attrs));\n    }\n    /**\n    Convert this mark to a JSON-serializeable representation.\n    */\n    toJSON() {\n        let obj = { type: this.type.name };\n        for (let _ in this.attrs) {\n            obj.attrs = this.attrs;\n            break;\n        }\n        return obj;\n    }\n    /**\n    Deserialize a mark from JSON.\n    */\n    static fromJSON(schema, json) {\n        if (!json)\n            throw new RangeError(\"Invalid input for Mark.fromJSON\");\n        let type = schema.marks[json.type];\n        if (!type)\n            throw new RangeError(`There is no mark type ${json.type} in this schema`);\n        return type.create(json.attrs);\n    }\n    /**\n    Test whether two sets of marks are identical.\n    */\n    static sameSet(a, b) {\n        if (a == b)\n            return true;\n        if (a.length != b.length)\n            return false;\n        for (let i = 0; i < a.length; i++)\n            if (!a[i].eq(b[i]))\n                return false;\n        return true;\n    }\n    /**\n    Create a properly sorted mark set from null, a single mark, or an\n    unsorted array of marks.\n    */\n    static setFrom(marks) {\n        if (!marks || Array.isArray(marks) && marks.length == 0)\n            return Mark.none;\n        if (marks instanceof Mark)\n            return [marks];\n        let copy = marks.slice();\n        copy.sort((a, b) => a.type.rank - b.type.rank);\n        return copy;\n    }\n}\n/**\nThe empty set of marks.\n*/\nMark.none = [];\n\n/**\nError type raised by [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) when\ngiven an invalid replacement.\n*/\nclass ReplaceError extends Error {\n}\n/*\nReplaceError = function(this: any, message: string) {\n  let err = Error.call(this, message)\n  ;(err as any).__proto__ = ReplaceError.prototype\n  return err\n} as any\n\nReplaceError.prototype = Object.create(Error.prototype)\nReplaceError.prototype.constructor = ReplaceError\nReplaceError.prototype.name = \"ReplaceError\"\n*/\n/**\nA slice represents a piece cut out of a larger document. It\nstores not only a fragment, but also the depth up to which nodes on\nboth side are ‘open’ (cut through).\n*/\nclass Slice {\n    /**\n    Create a slice. When specifying a non-zero open depth, you must\n    make sure that there are nodes of at least that depth at the\n    appropriate side of the fragment—i.e. if the fragment is an\n    empty paragraph node, `openStart` and `openEnd` can't be greater\n    than 1.\n    \n    It is not necessary for the content of open nodes to conform to\n    the schema's content constraints, though it should be a valid\n    start/end/middle for such a node, depending on which sides are\n    open.\n    */\n    constructor(\n    /**\n    The slice's content.\n    */\n    content, \n    /**\n    The open depth at the start of the fragment.\n    */\n    openStart, \n    /**\n    The open depth at the end.\n    */\n    openEnd) {\n        this.content = content;\n        this.openStart = openStart;\n        this.openEnd = openEnd;\n    }\n    /**\n    The size this slice would add when inserted into a document.\n    */\n    get size() {\n        return this.content.size - this.openStart - this.openEnd;\n    }\n    /**\n    @internal\n    */\n    insertAt(pos, fragment) {\n        let content = insertInto(this.content, pos + this.openStart, fragment);\n        return content && new Slice(content, this.openStart, this.openEnd);\n    }\n    /**\n    @internal\n    */\n    removeBetween(from, to) {\n        return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd);\n    }\n    /**\n    Tests whether this slice is equal to another slice.\n    */\n    eq(other) {\n        return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd;\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return this.content + \"(\" + this.openStart + \",\" + this.openEnd + \")\";\n    }\n    /**\n    Convert a slice to a JSON-serializable representation.\n    */\n    toJSON() {\n        if (!this.content.size)\n            return null;\n        let json = { content: this.content.toJSON() };\n        if (this.openStart > 0)\n            json.openStart = this.openStart;\n        if (this.openEnd > 0)\n            json.openEnd = this.openEnd;\n        return json;\n    }\n    /**\n    Deserialize a slice from its JSON representation.\n    */\n    static fromJSON(schema, json) {\n        if (!json)\n            return Slice.empty;\n        let 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), openStart, openEnd);\n    }\n    /**\n    Create a slice from a fragment by taking the maximum possible\n    open value on both side of the fragment.\n    */\n    static maxOpen(fragment, openIsolating = true) {\n        let openStart = 0, openEnd = 0;\n        for (let n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild)\n            openStart++;\n        for (let n = fragment.lastChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.lastChild)\n            openEnd++;\n        return new Slice(fragment, openStart, openEnd);\n    }\n}\n/**\nThe empty slice.\n*/\nSlice.empty = new Slice(Fragment.empty, 0, 0);\nfunction removeRange(content, from, to) {\n    let { index, offset } = content.findIndex(from), child = content.maybeChild(index);\n    let { index: indexTo, offset: offsetTo } = content.findIndex(to);\n    if (offset == from || child.isText) {\n        if (offsetTo != to && !content.child(indexTo).isText)\n            throw new RangeError(\"Removing non-flat range\");\n        return content.cut(0, from).append(content.cut(to));\n    }\n    if (index != indexTo)\n        throw new RangeError(\"Removing non-flat range\");\n    return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)));\n}\nfunction insertInto(content, dist, insert, parent) {\n    let { index, offset } = content.findIndex(dist), child = content.maybeChild(index);\n    if (offset == dist || child.isText) {\n        if (parent && !parent.canReplace(index, index, insert))\n            return null;\n        return content.cut(0, dist).append(insert).append(content.cut(dist));\n    }\n    let inner = insertInto(child.content, dist - offset - 1, insert);\n    return inner && content.replaceChild(index, child.copy(inner));\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}\nfunction replaceOuter($from, $to, slice, depth) {\n    let index = $from.index(depth), node = $from.node(depth);\n    if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {\n        let inner = replaceOuter($from, $to, slice, depth + 1);\n        return node.copy(node.content.replaceChild(index, inner));\n    }\n    else if (!slice.content.size) {\n        return close(node, replaceTwoWay($from, $to, depth));\n    }\n    else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case\n        let parent = $from.parent, content = parent.content;\n        return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)));\n    }\n    else {\n        let { start, end } = prepareSliceForReplace(slice, $from);\n        return close(node, replaceThreeWay($from, start, end, $to, depth));\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}\nfunction joinable($before, $after, depth) {\n    let node = $before.node(depth);\n    checkJoin(node, $after.node(depth));\n    return node;\n}\nfunction addNode(child, target) {\n    let 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}\nfunction addRange($start, $end, depth, target) {\n    let node = ($end || $start).node(depth);\n    let 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        }\n        else if ($start.textOffset) {\n            addNode($start.nodeAfter, target);\n            startIndex++;\n        }\n    }\n    for (let i = startIndex; i < endIndex; i++)\n        addNode(node.child(i), target);\n    if ($end && $end.depth == depth && $end.textOffset)\n        addNode($end.nodeBefore, target);\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}\nfunction replaceThreeWay($from, $start, $end, $to, depth) {\n    let openStart = $from.depth > depth && joinable($from, $start, depth + 1);\n    let openEnd = $to.depth > depth && joinable($end, $to, depth + 1);\n    let 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    }\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}\nfunction replaceTwoWay($from, $to, depth) {\n    let content = [];\n    addRange(null, $from, depth, content);\n    if ($from.depth > depth) {\n        let 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}\nfunction prepareSliceForReplace(slice, $along) {\n    let extra = $along.depth - slice.openStart, parent = $along.node(extra);\n    let node = parent.copy(slice.content);\n    for (let 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/**\nYou can [_resolve_](https://prosemirror.net/docs/ref/#model.Node.resolve) a position to get more\ninformation about it. Objects of this class represent such a\nresolved position, providing various pieces of context\ninformation, and some helper methods.\n\nThroughout this interface, methods that take an optional `depth`\nparameter will interpret undefined as `this.depth` and negative\nnumbers as `this.depth + value`.\n*/\nclass ResolvedPos {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The position that was resolved.\n    */\n    pos, \n    /**\n    @internal\n    */\n    path, \n    /**\n    The offset this position has into its parent node.\n    */\n    parentOffset) {\n        this.pos = pos;\n        this.path = path;\n        this.parentOffset = parentOffset;\n        this.depth = path.length / 3 - 1;\n    }\n    /**\n    @internal\n    */\n    resolveDepth(val) {\n        if (val == null)\n            return this.depth;\n        if (val < 0)\n            return this.depth + val;\n        return val;\n    }\n    /**\n    The parent node that the position points into. Note that even if\n    a position points into a text node, that node is not considered\n    the parent—text nodes are ‘flat’ in this model, and have no content.\n    */\n    get parent() { return this.node(this.depth); }\n    /**\n    The root node in which the position was resolved.\n    */\n    get doc() { return this.node(0); }\n    /**\n    The ancestor node at the given level. `p.node(p.depth)` is the\n    same as `p.parent`.\n    */\n    node(depth) { return this.path[this.resolveDepth(depth) * 3]; }\n    /**\n    The index into the ancestor at the given level. If this points\n    at the 3rd node in the 2nd paragraph on the top level, for\n    example, `p.index(0)` is 1 and `p.index(1)` is 2.\n    */\n    index(depth) { return this.path[this.resolveDepth(depth) * 3 + 1]; }\n    /**\n    The index pointing after this position into the ancestor at the\n    given level.\n    */\n    indexAfter(depth) {\n        depth = this.resolveDepth(depth);\n        return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1);\n    }\n    /**\n    The (absolute) position at the start of the node at the given\n    level.\n    */\n    start(depth) {\n        depth = this.resolveDepth(depth);\n        return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1;\n    }\n    /**\n    The (absolute) position at the end of the node at the given\n    level.\n    */\n    end(depth) {\n        depth = this.resolveDepth(depth);\n        return this.start(depth) + this.node(depth).content.size;\n    }\n    /**\n    The (absolute) position directly before the wrapping node at the\n    given level, or, when `depth` is `this.depth + 1`, the original\n    position.\n    */\n    before(depth) {\n        depth = this.resolveDepth(depth);\n        if (!depth)\n            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    The (absolute) position directly after the wrapping node at the\n    given level, or the original position when `depth` is `this.depth + 1`.\n    */\n    after(depth) {\n        depth = this.resolveDepth(depth);\n        if (!depth)\n            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    When this position points into a text node, this returns the\n    distance between the position and the start of the text node.\n    Will be zero for positions that point between nodes.\n    */\n    get textOffset() { return this.pos - this.path[this.path.length - 1]; }\n    /**\n    Get the node directly after the position, if any. If the position\n    points into a text node, only the part of that node after the\n    position is returned.\n    */\n    get nodeAfter() {\n        let parent = this.parent, index = this.index(this.depth);\n        if (index == parent.childCount)\n            return null;\n        let dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);\n        return dOff ? parent.child(index).cut(dOff) : child;\n    }\n    /**\n    Get the node directly before the position, if any. If the\n    position points into a text node, only the part of that node\n    before the position is returned.\n    */\n    get nodeBefore() {\n        let index = this.index(this.depth);\n        let dOff = this.pos - this.path[this.path.length - 1];\n        if (dOff)\n            return this.parent.child(index).cut(0, dOff);\n        return index == 0 ? null : this.parent.child(index - 1);\n    }\n    /**\n    Get the position at the given index in the parent node at the\n    given depth (which defaults to `this.depth`).\n    */\n    posAtIndex(index, depth) {\n        depth = this.resolveDepth(depth);\n        let node = this.path[depth * 3], pos = depth == 0 ? 0 : this.path[depth * 3 - 1] + 1;\n        for (let i = 0; i < index; i++)\n            pos += node.child(i).nodeSize;\n        return pos;\n    }\n    /**\n    Get the marks at this position, factoring in the surrounding\n    marks' [`inclusive`](https://prosemirror.net/docs/ref/#model.MarkSpec.inclusive) property. If the\n    position is at the start of a non-empty node, the marks of the\n    node after it (if any) are returned.\n    */\n    marks() {\n        let parent = this.parent, index = this.index();\n        // In an empty parent, return the empty array\n        if (parent.content.size == 0)\n            return Mark.none;\n        // When inside a text node, just return the text node's marks\n        if (this.textOffset)\n            return parent.child(index).marks;\n        let main = parent.maybeChild(index - 1), other = parent.maybeChild(index);\n        // If the `after` flag is true of there is no node before, make\n        // the node after this position the main reference.\n        if (!main) {\n            let tmp = main;\n            main = other;\n            other = tmp;\n        }\n        // Use all marks in the main node, except those that have\n        // `inclusive` set to false and are not present in the other node.\n        let marks = main.marks;\n        for (var i = 0; i < marks.length; i++)\n            if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))\n                marks = marks[i--].removeFromSet(marks);\n        return marks;\n    }\n    /**\n    Get the marks after the current position, if any, except those\n    that are non-inclusive and not present at position `$end`. This\n    is mostly useful for getting the set of marks to preserve after a\n    deletion. Will return `null` if this position is at the end of\n    its parent node or its parent node isn't a textblock (in which\n    case no marks should be preserved).\n    */\n    marksAcross($end) {\n        let after = this.parent.maybeChild(this.index());\n        if (!after || !after.isInline)\n            return null;\n        let marks = after.marks, next = $end.parent.maybeChild($end.index());\n        for (var i = 0; i < marks.length; i++)\n            if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))\n                marks = marks[i--].removeFromSet(marks);\n        return marks;\n    }\n    /**\n    The depth up to which this position and the given (non-resolved)\n    position share the same parent nodes.\n    */\n    sharedDepth(pos) {\n        for (let depth = this.depth; depth > 0; depth--)\n            if (this.start(depth) <= pos && this.end(depth) >= pos)\n                return depth;\n        return 0;\n    }\n    /**\n    Returns a range based on the place where this position and the\n    given position diverge around block content. If both point into\n    the same textblock, for example, a range around that textblock\n    will be returned. If they point into different blocks, the range\n    around those blocks in their shared ancestor is returned. You can\n    pass in an optional predicate that will be called with a parent\n    node to see if a range into that parent is acceptable.\n    */\n    blockRange(other = this, pred) {\n        if (other.pos < this.pos)\n            return other.blockRange(this);\n        for (let d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)\n            if (other.pos <= this.end(d) && (!pred || pred(this.node(d))))\n                return new NodeRange(this, other, d);\n        return null;\n    }\n    /**\n    Query whether the given position shares the same parent node.\n    */\n    sameParent(other) {\n        return this.pos - this.parentOffset == other.pos - other.parentOffset;\n    }\n    /**\n    Return the greater of this and the given position.\n    */\n    max(other) {\n        return other.pos > this.pos ? other : this;\n    }\n    /**\n    Return the smaller of this and the given position.\n    */\n    min(other) {\n        return other.pos < this.pos ? other : this;\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let str = \"\";\n        for (let i = 1; i <= this.depth; i++)\n            str += (str ? \"/\" : \"\") + this.node(i).type.name + \"_\" + this.index(i - 1);\n        return str + \":\" + this.parentOffset;\n    }\n    /**\n    @internal\n    */\n    static resolve(doc, pos) {\n        if (!(pos >= 0 && pos <= doc.content.size))\n            throw new RangeError(\"Position \" + pos + \" out of range\");\n        let path = [];\n        let start = 0, parentOffset = pos;\n        for (let node = doc;;) {\n            let { index, offset } = node.content.findIndex(parentOffset);\n            let rem = parentOffset - offset;\n            path.push(node, index, start + offset);\n            if (!rem)\n                break;\n            node = node.child(index);\n            if (node.isText)\n                break;\n            parentOffset = rem - 1;\n            start += offset + 1;\n        }\n        return new ResolvedPos(pos, path, parentOffset);\n    }\n    /**\n    @internal\n    */\n    static resolveCached(doc, pos) {\n        for (let i = 0; i < resolveCache.length; i++) {\n            let cached = resolveCache[i];\n            if (cached.pos == pos && cached.doc == doc)\n                return cached;\n        }\n        let result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);\n        resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;\n        return result;\n    }\n}\nlet resolveCache = [], resolveCachePos = 0, resolveCacheSize = 12;\n/**\nRepresents a flat range of content, i.e. one that starts and\nends in the same node.\n*/\nclass NodeRange {\n    /**\n    Construct a node range. `$from` and `$to` should point into the\n    same node until at least the given `depth`, since a node range\n    denotes an adjacent set of nodes in a single parent node.\n    */\n    constructor(\n    /**\n    A resolved position along the start of the content. May have a\n    `depth` greater than this object's `depth` property, since\n    these are the positions that were used to compute the range,\n    not re-resolved positions directly at its boundaries.\n    */\n    $from, \n    /**\n    A position along the end of the content. See\n    caveat for [`$from`](https://prosemirror.net/docs/ref/#model.NodeRange.$from).\n    */\n    $to, \n    /**\n    The depth of the node that this range points into.\n    */\n    depth) {\n        this.$from = $from;\n        this.$to = $to;\n        this.depth = depth;\n    }\n    /**\n    The position at the start of the range.\n    */\n    get start() { return this.$from.before(this.depth + 1); }\n    /**\n    The position at the end of the range.\n    */\n    get end() { return this.$to.after(this.depth + 1); }\n    /**\n    The parent node that the range points into.\n    */\n    get parent() { return this.$from.node(this.depth); }\n    /**\n    The start index of the range in the parent node.\n    */\n    get startIndex() { return this.$from.index(this.depth); }\n    /**\n    The end index of the range in the parent node.\n    */\n    get endIndex() { return this.$to.indexAfter(this.depth); }\n}\n\nconst emptyAttrs = Object.create(null);\n/**\nThis class represents a node in the tree that makes up a\nProseMirror document. So a document is an instance of `Node`, with\nchildren that are also instances of `Node`.\n\nNodes are persistent data structures. Instead of changing them, you\ncreate new ones with the content you want. Old ones keep pointing\nat the old document shape. This is made cheaper by sharing\nstructure between the old and new data as much as possible, which a\ntree 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.\n*/\nclass Node {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The type of node that this is.\n    */\n    type, \n    /**\n    An object mapping attribute names to values. The kind of\n    attributes allowed and required are\n    [determined](https://prosemirror.net/docs/ref/#model.NodeSpec.attrs) by the node type.\n    */\n    attrs, \n    // A fragment holding the node's children.\n    content, \n    /**\n    The marks (things like whether it is emphasized or part of a\n    link) applied to this node.\n    */\n    marks = Mark.none) {\n        this.type = type;\n        this.attrs = attrs;\n        this.marks = marks;\n        this.content = content || Fragment.empty;\n    }\n    /**\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\n    start and end token).\n    */\n    get nodeSize() { return this.isLeaf ? 1 : 2 + this.content.size; }\n    /**\n    The number of children that the node has.\n    */\n    get childCount() { return this.content.childCount; }\n    /**\n    Get the child node at the given index. Raises an error when the\n    index is out of range.\n    */\n    child(index) { return this.content.child(index); }\n    /**\n    Get the child node at the given index, if it exists.\n    */\n    maybeChild(index) { return this.content.maybeChild(index); }\n    /**\n    Call `f` for every child node, passing the node, its offset\n    into this parent node, and its index.\n    */\n    forEach(f) { this.content.forEach(f); }\n    /**\n    Invoke a callback for all descendant nodes recursively between\n    the given two positions that are relative to start of this\n    node's 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.\n    */\n    nodesBetween(from, to, f, startPos = 0) {\n        this.content.nodesBetween(from, to, f, startPos, this);\n    }\n    /**\n    Call the given callback for every descendant node. Doesn't\n    descend into a node when the callback returns `false`.\n    */\n    descendants(f) {\n        this.nodesBetween(0, this.content.size, f);\n    }\n    /**\n    Concatenates all the text nodes found in this fragment and its\n    children.\n    */\n    get textContent() {\n        return (this.isLeaf && this.type.spec.leafText)\n            ? this.type.spec.leafText(this)\n            : this.textBetween(0, this.content.size, \"\");\n    }\n    /**\n    Get all text between positions `from` and `to`. When\n    `blockSeparator` is given, it will be inserted to separate text\n    from different block nodes. If `leafText` is given, it'll be\n    inserted for every non-text leaf node encountered, otherwise\n    [`leafText`](https://prosemirror.net/docs/ref/#model.NodeSpec^leafText) will be used.\n    */\n    textBetween(from, to, blockSeparator, leafText) {\n        return this.content.textBetween(from, to, blockSeparator, leafText);\n    }\n    /**\n    Returns this node's first child, or `null` if there are no\n    children.\n    */\n    get firstChild() { return this.content.firstChild; }\n    /**\n    Returns this node's last child, or `null` if there are no\n    children.\n    */\n    get lastChild() { return this.content.lastChild; }\n    /**\n    Test whether two nodes represent the same piece of document.\n    */\n    eq(other) {\n        return this == other || (this.sameMarkup(other) && this.content.eq(other.content));\n    }\n    /**\n    Compare the markup (type, attributes, and marks) of this node to\n    those of another. Returns `true` if both have the same markup.\n    */\n    sameMarkup(other) {\n        return this.hasMarkup(other.type, other.attrs, other.marks);\n    }\n    /**\n    Check whether this node's markup correspond to the given type,\n    attributes, and marks.\n    */\n    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    Create a new node with the same markup as this node, containing\n    the given content (or empty, if no content is given).\n    */\n    copy(content = null) {\n        if (content == this.content)\n            return this;\n        return new Node(this.type, this.attrs, content, this.marks);\n    }\n    /**\n    Create a copy of this node, with the given set of marks instead\n    of the node's own marks.\n    */\n    mark(marks) {\n        return marks == this.marks ? this : new Node(this.type, this.attrs, this.content, marks);\n    }\n    /**\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.\n    */\n    cut(from, to = this.content.size) {\n        if (from == 0 && to == this.content.size)\n            return this;\n        return this.copy(this.content.cut(from, to));\n    }\n    /**\n    Cut out the part of the document between the given positions, and\n    return it as a `Slice` object.\n    */\n    slice(from, to = this.content.size, includeParents = false) {\n        if (from == to)\n            return Slice.empty;\n        let $from = this.resolve(from), $to = this.resolve(to);\n        let depth = includeParents ? 0 : $from.sharedDepth(to);\n        let start = $from.start(depth), node = $from.node(depth);\n        let content = node.content.cut($from.pos - start, $to.pos - start);\n        return new Slice(content, $from.depth - depth, $to.depth - depth);\n    }\n    /**\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`](https://prosemirror.net/docs/ref/#model.ReplaceError) is thrown.\n    */\n    replace(from, to, slice) {\n        return replace(this.resolve(from), this.resolve(to), slice);\n    }\n    /**\n    Find the node directly after the given position.\n    */\n    nodeAt(pos) {\n        for (let node = this;;) {\n            let { index, offset } = node.content.findIndex(pos);\n            node = node.maybeChild(index);\n            if (!node)\n                return null;\n            if (offset == pos || node.isText)\n                return node;\n            pos -= offset + 1;\n        }\n    }\n    /**\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.\n    */\n    childAfter(pos) {\n        let { index, offset } = this.content.findIndex(pos);\n        return { node: this.content.maybeChild(index), index, offset };\n    }\n    /**\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.\n    */\n    childBefore(pos) {\n        if (pos == 0)\n            return { node: null, index: 0, offset: 0 };\n        let { index, offset } = this.content.findIndex(pos);\n        if (offset < pos)\n            return { node: this.content.child(index), index, offset };\n        let node = this.content.child(index - 1);\n        return { node, index: index - 1, offset: offset - node.nodeSize };\n    }\n    /**\n    Resolve the given position in the document, returning an\n    [object](https://prosemirror.net/docs/ref/#model.ResolvedPos) with information about its context.\n    */\n    resolve(pos) { return ResolvedPos.resolveCached(this, pos); }\n    /**\n    @internal\n    */\n    resolveNoCache(pos) { return ResolvedPos.resolve(this, pos); }\n    /**\n    Test whether a given mark or mark type occurs in this document\n    between the two given positions.\n    */\n    rangeHasMark(from, to, type) {\n        let found = false;\n        if (to > from)\n            this.nodesBetween(from, to, node => {\n                if (type.isInSet(node.marks))\n                    found = true;\n                return !found;\n            });\n        return found;\n    }\n    /**\n    True when this is a block (non-inline node)\n    */\n    get isBlock() { return this.type.isBlock; }\n    /**\n    True when this is a textblock node, a block node with inline\n    content.\n    */\n    get isTextblock() { return this.type.isTextblock; }\n    /**\n    True when this node allows inline content.\n    */\n    get inlineContent() { return this.type.inlineContent; }\n    /**\n    True when this is an inline node (a text node or a node that can\n    appear among text).\n    */\n    get isInline() { return this.type.isInline; }\n    /**\n    True when this is a text node.\n    */\n    get isText() { return this.type.isText; }\n    /**\n    True when this is a leaf node.\n    */\n    get isLeaf() { return this.type.isLeaf; }\n    /**\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](https://prosemirror.net/docs/ref/#model.NodeSpec.atom)\n    on a node's spec (typically used when the node is displayed as\n    an uneditable [node view](https://prosemirror.net/docs/ref/#view.NodeView)).\n    */\n    get isAtom() { return this.type.isAtom; }\n    /**\n    Return a string representation of this node for debugging\n    purposes.\n    */\n    toString() {\n        if (this.type.spec.toDebugString)\n            return this.type.spec.toDebugString(this);\n        let name = this.type.name;\n        if (this.content.size)\n            name += \"(\" + this.content.toStringInner() + \")\";\n        return wrapMarks(this.marks, name);\n    }\n    /**\n    Get the content match in this node at the given index.\n    */\n    contentMatchAt(index) {\n        let match = this.type.contentMatch.matchFragment(this.content, 0, index);\n        if (!match)\n            throw new Error(\"Called contentMatchAt on a node with invalid content\");\n        return match;\n    }\n    /**\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.\n    */\n    canReplace(from, to, replacement = Fragment.empty, start = 0, end = replacement.childCount) {\n        let one = this.contentMatchAt(from).matchFragment(replacement, start, end);\n        let two = one && one.matchFragment(this.content, to);\n        if (!two || !two.validEnd)\n            return false;\n        for (let i = start; i < end; i++)\n            if (!this.type.allowsMarks(replacement.child(i).marks))\n                return false;\n        return true;\n    }\n    /**\n    Test whether replacing the range `from` to `to` (by index) with\n    a node of the given type would leave the node's content valid.\n    */\n    canReplaceWith(from, to, type, marks) {\n        if (marks && !this.type.allowsMarks(marks))\n            return false;\n        let start = this.contentMatchAt(from).matchType(type);\n        let end = start && start.matchFragment(this.content, to);\n        return end ? end.validEnd : false;\n    }\n    /**\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).\n    */\n    canAppend(other) {\n        if (other.content.size)\n            return this.canReplace(this.childCount, this.childCount, other.content);\n        else\n            return this.type.compatibleContent(other.type);\n    }\n    /**\n    Check whether this node and its descendants conform to the\n    schema, and raise error when they do not.\n    */\n    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        let copy = Mark.none;\n        for (let i = 0; i < this.marks.length; i++)\n            copy = this.marks[i].addToSet(copy);\n        if (!Mark.sameSet(copy, this.marks))\n            throw new RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map(m => m.type.name)}`);\n        this.content.forEach(node => node.check());\n    }\n    /**\n    Return a JSON-serializeable representation of this node.\n    */\n    toJSON() {\n        let obj = { type: this.type.name };\n        for (let _ in this.attrs) {\n            obj.attrs = this.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(n => n.toJSON());\n        return obj;\n    }\n    /**\n    Deserialize a node from its JSON representation.\n    */\n    static fromJSON(schema, json) {\n        if (!json)\n            throw new RangeError(\"Invalid input for Node.fromJSON\");\n        let marks = null;\n        if (json.marks) {\n            if (!Array.isArray(json.marks))\n                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\")\n                throw new RangeError(\"Invalid text node in JSON\");\n            return schema.text(json.text, marks);\n        }\n        let content = Fragment.fromJSON(schema, json.content);\n        return schema.nodeType(json.type).create(json.attrs, content, marks);\n    }\n}\nNode.prototype.text = undefined;\nclass TextNode extends Node {\n    /**\n    @internal\n    */\n    constructor(type, attrs, content, marks) {\n        super(type, attrs, null, marks);\n        if (!content)\n            throw new RangeError(\"Empty text nodes are not allowed\");\n        this.text = content;\n    }\n    toString() {\n        if (this.type.spec.toDebugString)\n            return this.type.spec.toDebugString(this);\n        return wrapMarks(this.marks, JSON.stringify(this.text));\n    }\n    get textContent() { return this.text; }\n    textBetween(from, to) { return this.text.slice(from, to); }\n    get nodeSize() { return this.text.length; }\n    mark(marks) {\n        return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks);\n    }\n    withText(text) {\n        if (text == this.text)\n            return this;\n        return new TextNode(this.type, this.attrs, text, this.marks);\n    }\n    cut(from = 0, to = this.text.length) {\n        if (from == 0 && to == this.text.length)\n            return this;\n        return this.withText(this.text.slice(from, to));\n    }\n    eq(other) {\n        return this.sameMarkup(other) && this.text == other.text;\n    }\n    toJSON() {\n        let base = super.toJSON();\n        base.text = this.text;\n        return base;\n    }\n}\nfunction wrapMarks(marks, str) {\n    for (let i = marks.length - 1; i >= 0; i--)\n        str = marks[i].type.name + \"(\" + str + \")\";\n    return str;\n}\n\n/**\nInstances of this class represent a match state of a node type's\n[content expression](https://prosemirror.net/docs/ref/#model.NodeSpec.content), and can be used to\nfind out whether further content matches here, and whether a given\nposition is a valid end of the node.\n*/\nclass ContentMatch {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    True when this match state represents a valid end of the node.\n    */\n    validEnd) {\n        this.validEnd = validEnd;\n        /**\n        @internal\n        */\n        this.next = [];\n        /**\n        @internal\n        */\n        this.wrapCache = [];\n    }\n    /**\n    @internal\n    */\n    static parse(string, nodeTypes) {\n        let stream = new TokenStream(string, nodeTypes);\n        if (stream.next == null)\n            return ContentMatch.empty;\n        let expr = parseExpr(stream);\n        if (stream.next)\n            stream.err(\"Unexpected trailing text\");\n        let match = dfa(nfa(expr));\n        checkForDeadEnds(match, stream);\n        return match;\n    }\n    /**\n    Match a node type, returning a match after that node if\n    successful.\n    */\n    matchType(type) {\n        for (let i = 0; i < this.next.length; i++)\n            if (this.next[i].type == type)\n                return this.next[i].next;\n        return null;\n    }\n    /**\n    Try to match a fragment. Returns the resulting match when\n    successful.\n    */\n    matchFragment(frag, start = 0, end = frag.childCount) {\n        let cur = this;\n        for (let i = start; cur && i < end; i++)\n            cur = cur.matchType(frag.child(i).type);\n        return cur;\n    }\n    /**\n    @internal\n    */\n    get inlineContent() {\n        return this.next.length && this.next[0].type.isInline;\n    }\n    /**\n    Get the first matching node type at this match position that can\n    be generated.\n    */\n    get defaultType() {\n        for (let i = 0; i < this.next.length; i++) {\n            let { type } = this.next[i];\n            if (!(type.isText || type.hasRequiredAttrs()))\n                return type;\n        }\n        return null;\n    }\n    /**\n    @internal\n    */\n    compatible(other) {\n        for (let i = 0; i < this.next.length; i++)\n            for (let j = 0; j < other.next.length; j++)\n                if (this.next[i].type == other.next[j].type)\n                    return true;\n        return false;\n    }\n    /**\n    Try to match the given fragment, and if that fails, see if it can\n    be made to match by inserting nodes in front of it. When\n    successful, return a fragment of inserted nodes (which may be\n    empty if nothing had to be inserted). When `toEnd` is true, only\n    return a fragment if the resulting match goes to the end of the\n    content expression.\n    */\n    fillBefore(after, toEnd = false, startIndex = 0) {\n        let seen = [this];\n        function search(match, types) {\n            let finished = match.matchFragment(after, startIndex);\n            if (finished && (!toEnd || finished.validEnd))\n                return Fragment.from(types.map(tp => tp.createAndFill()));\n            for (let i = 0; i < match.next.length; i++) {\n                let { type, next } = match.next[i];\n                if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {\n                    seen.push(next);\n                    let found = search(next, types.concat(type));\n                    if (found)\n                        return found;\n                }\n            }\n            return null;\n        }\n        return search(this, []);\n    }\n    /**\n    Find a set of wrapping node types that would allow a node of the\n    given type to appear at this position. The result may be empty\n    (when it fits directly) and will be null when no such wrapping\n    exists.\n    */\n    findWrapping(target) {\n        for (let i = 0; i < this.wrapCache.length; i += 2)\n            if (this.wrapCache[i] == target)\n                return this.wrapCache[i + 1];\n        let computed = this.computeWrapping(target);\n        this.wrapCache.push(target, computed);\n        return computed;\n    }\n    /**\n    @internal\n    */\n    computeWrapping(target) {\n        let seen = Object.create(null), active = [{ match: this, type: null, via: null }];\n        while (active.length) {\n            let current = active.shift(), match = current.match;\n            if (match.matchType(target)) {\n                let result = [];\n                for (let obj = current; obj.type; obj = obj.via)\n                    result.push(obj.type);\n                return result.reverse();\n            }\n            for (let i = 0; i < match.next.length; i++) {\n                let { type, next } = match.next[i];\n                if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || next.validEnd)) {\n                    active.push({ match: type.contentMatch, type, via: current });\n                    seen[type.name] = true;\n                }\n            }\n        }\n        return null;\n    }\n    /**\n    The number of outgoing edges this node has in the finite\n    automaton that describes the content expression.\n    */\n    get edgeCount() {\n        return this.next.length;\n    }\n    /**\n    Get the _n_​th outgoing edge from this node in the finite\n    automaton that describes the content expression.\n    */\n    edge(n) {\n        if (n >= this.next.length)\n            throw new RangeError(`There's no ${n}th edge in this content match`);\n        return this.next[n];\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let seen = [];\n        function scan(m) {\n            seen.push(m);\n            for (let i = 0; i < m.next.length; i++)\n                if (seen.indexOf(m.next[i].next) == -1)\n                    scan(m.next[i].next);\n        }\n        scan(this);\n        return seen.map((m, i) => {\n            let out = i + (m.validEnd ? \"*\" : \" \") + \" \";\n            for (let i = 0; i < m.next.length; i++)\n                out += (i ? \", \" : \"\") + m.next[i].type.name + \"->\" + seen.indexOf(m.next[i].next);\n            return out;\n        }).join(\"\\n\");\n    }\n}\n/**\n@internal\n*/\nContentMatch.empty = new ContentMatch(true);\nclass TokenStream {\n    constructor(string, nodeTypes) {\n        this.string = string;\n        this.nodeTypes = nodeTypes;\n        this.inline = null;\n        this.pos = 0;\n        this.tokens = string.split(/\\s*(?=\\b|\\W|$)/);\n        if (this.tokens[this.tokens.length - 1] == \"\")\n            this.tokens.pop();\n        if (this.tokens[0] == \"\")\n            this.tokens.shift();\n    }\n    get next() { return this.tokens[this.pos]; }\n    eat(tok) { return this.next == tok && (this.pos++ || true); }\n    err(str) { throw new SyntaxError(str + \" (in content expression '\" + this.string + \"')\"); }\n}\nfunction parseExpr(stream) {\n    let exprs = [];\n    do {\n        exprs.push(parseExprSeq(stream));\n    } while (stream.eat(\"|\"));\n    return exprs.length == 1 ? exprs[0] : { type: \"choice\", exprs };\n}\nfunction parseExprSeq(stream) {\n    let exprs = [];\n    do {\n        exprs.push(parseExprSubscript(stream));\n    } while (stream.next && stream.next != \")\" && stream.next != \"|\");\n    return exprs.length == 1 ? exprs[0] : { type: \"seq\", exprs };\n}\nfunction parseExprSubscript(stream) {\n    let expr = parseExprAtom(stream);\n    for (;;) {\n        if (stream.eat(\"+\"))\n            expr = { type: \"plus\", expr };\n        else if (stream.eat(\"*\"))\n            expr = { type: \"star\", expr };\n        else if (stream.eat(\"?\"))\n            expr = { type: \"opt\", expr };\n        else if (stream.eat(\"{\"))\n            expr = parseExprRange(stream, expr);\n        else\n            break;\n    }\n    return expr;\n}\nfunction parseNum(stream) {\n    if (/\\D/.test(stream.next))\n        stream.err(\"Expected number, got '\" + stream.next + \"'\");\n    let result = Number(stream.next);\n    stream.pos++;\n    return result;\n}\nfunction parseExprRange(stream, expr) {\n    let min = parseNum(stream), max = min;\n    if (stream.eat(\",\")) {\n        if (stream.next != \"}\")\n            max = parseNum(stream);\n        else\n            max = -1;\n    }\n    if (!stream.eat(\"}\"))\n        stream.err(\"Unclosed braced range\");\n    return { type: \"range\", min, max, expr };\n}\nfunction resolveName(stream, name) {\n    let types = stream.nodeTypes, type = types[name];\n    if (type)\n        return [type];\n    let result = [];\n    for (let typeName in types) {\n        let type = types[typeName];\n        if (type.groups.indexOf(name) > -1)\n            result.push(type);\n    }\n    if (result.length == 0)\n        stream.err(\"No node type or group '\" + name + \"' found\");\n    return result;\n}\nfunction parseExprAtom(stream) {\n    if (stream.eat(\"(\")) {\n        let expr = parseExpr(stream);\n        if (!stream.eat(\")\"))\n            stream.err(\"Missing closing paren\");\n        return expr;\n    }\n    else if (!/\\W/.test(stream.next)) {\n        let exprs = resolveName(stream, stream.next).map(type => {\n            if (stream.inline == null)\n                stream.inline = type.isInline;\n            else if (stream.inline != type.isInline)\n                stream.err(\"Mixing inline and block content\");\n            return { type: \"name\", value: type };\n        });\n        stream.pos++;\n        return exprs.length == 1 ? exprs[0] : { type: \"choice\", exprs };\n    }\n    else {\n        stream.err(\"Unexpected token '\" + stream.next + \"'\");\n    }\n}\n/**\nConstruct an NFA from an expression as returned by the parser. The\nNFA is represented as an array of states, which are themselves\narrays of edges, which are `{term, to}` objects. The first state is\nthe entry state and the last node is the success state.\n\nNote that unlike typical NFAs, the edge ordering in this one is\nsignificant, in that it is used to contruct filler content when\nnecessary.\n*/\nfunction nfa(expr) {\n    let nfa = [[]];\n    connect(compile(expr, 0), node());\n    return nfa;\n    function node() { return nfa.push([]) - 1; }\n    function edge(from, to, term) {\n        let edge = { term, to };\n        nfa[from].push(edge);\n        return edge;\n    }\n    function connect(edges, to) {\n        edges.forEach(edge => edge.to = to);\n    }\n    function compile(expr, from) {\n        if (expr.type == \"choice\") {\n            return expr.exprs.reduce((out, expr) => out.concat(compile(expr, from)), []);\n        }\n        else if (expr.type == \"seq\") {\n            for (let i = 0;; i++) {\n                let next = compile(expr.exprs[i], from);\n                if (i == expr.exprs.length - 1)\n                    return next;\n                connect(next, from = node());\n            }\n        }\n        else if (expr.type == \"star\") {\n            let loop = node();\n            edge(from, loop);\n            connect(compile(expr.expr, loop), loop);\n            return [edge(loop)];\n        }\n        else if (expr.type == \"plus\") {\n            let loop = node();\n            connect(compile(expr.expr, from), loop);\n            connect(compile(expr.expr, loop), loop);\n            return [edge(loop)];\n        }\n        else if (expr.type == \"opt\") {\n            return [edge(from)].concat(compile(expr.expr, from));\n        }\n        else if (expr.type == \"range\") {\n            let cur = from;\n            for (let i = 0; i < expr.min; i++) {\n                let next = node();\n                connect(compile(expr.expr, cur), next);\n                cur = next;\n            }\n            if (expr.max == -1) {\n                connect(compile(expr.expr, cur), cur);\n            }\n            else {\n                for (let i = expr.min; i < expr.max; i++) {\n                    let next = node();\n                    edge(cur, next);\n                    connect(compile(expr.expr, cur), next);\n                    cur = next;\n                }\n            }\n            return [edge(cur)];\n        }\n        else if (expr.type == \"name\") {\n            return [edge(from, undefined, expr.value)];\n        }\n        else {\n            throw new Error(\"Unknown expr type\");\n        }\n    }\n}\nfunction cmp(a, b) { return b - a; }\n// Get the set of nodes reachable by null edges from `node`. Omit\n// nodes with only a single null-out-edge, since they may lead to\n// needless duplicated nodes.\nfunction nullFrom(nfa, node) {\n    let result = [];\n    scan(node);\n    return result.sort(cmp);\n    function scan(node) {\n        let edges = nfa[node];\n        if (edges.length == 1 && !edges[0].term)\n            return scan(edges[0].to);\n        result.push(node);\n        for (let i = 0; i < edges.length; i++) {\n            let { term, to } = edges[i];\n            if (!term && result.indexOf(to) == -1)\n                scan(to);\n        }\n    }\n}\n// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set\n// of state objects (`ContentMatch` instances) with transitions\n// between them.\nfunction dfa(nfa) {\n    let labeled = Object.create(null);\n    return explore(nullFrom(nfa, 0));\n    function explore(states) {\n        let out = [];\n        states.forEach(node => {\n            nfa[node].forEach(({ term, to }) => {\n                if (!term)\n                    return;\n                let set;\n                for (let i = 0; i < out.length; i++)\n                    if (out[i][0] == term)\n                        set = out[i][1];\n                nullFrom(nfa, to).forEach(node => {\n                    if (!set)\n                        out.push([term, set = []]);\n                    if (set.indexOf(node) == -1)\n                        set.push(node);\n                });\n            });\n        });\n        let state = labeled[states.join(\",\")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);\n        for (let i = 0; i < out.length; i++) {\n            let states = out[i][1].sort(cmp);\n            state.next.push({ type: out[i][0], next: labeled[states.join(\",\")] || explore(states) });\n        }\n        return state;\n    }\n}\nfunction checkForDeadEnds(match, stream) {\n    for (let i = 0, work = [match]; i < work.length; i++) {\n        let state = work[i], dead = !state.validEnd, nodes = [];\n        for (let j = 0; j < state.next.length; j++) {\n            let { type, next } = state.next[j];\n            nodes.push(type.name);\n            if (dead && !(type.isText || type.hasRequiredAttrs()))\n                dead = false;\n            if (work.indexOf(next) == -1)\n                work.push(next);\n        }\n        if (dead)\n            stream.err(\"Only non-generatable nodes (\" + nodes.join(\", \") + \") in a required position (see https://prosemirror.net/docs/guide/#generatable)\");\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    let defaults = Object.create(null);\n    for (let attrName in attrs) {\n        let attr = attrs[attrName];\n        if (!attr.hasDefault)\n            return null;\n        defaults[attrName] = attr.default;\n    }\n    return defaults;\n}\nfunction computeAttrs(attrs, value) {\n    let built = Object.create(null);\n    for (let name in attrs) {\n        let given = value && value[name];\n        if (given === undefined) {\n            let attr = attrs[name];\n            if (attr.hasDefault)\n                given = attr.default;\n            else\n                throw new RangeError(\"No value supplied for attribute \" + name);\n        }\n        built[name] = given;\n    }\n    return built;\n}\nfunction initAttrs(attrs) {\n    let result = Object.create(null);\n    if (attrs)\n        for (let name in attrs)\n            result[name] = new Attribute(attrs[name]);\n    return result;\n}\n/**\nNode types are objects allocated once per `Schema` and used to\n[tag](https://prosemirror.net/docs/ref/#model.Node.type) `Node` instances. They contain information\nabout the node type, such as its name and what kind of node it\nrepresents.\n*/\nclass NodeType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name the node type has in this schema.\n    */\n    name, \n    /**\n    A link back to the `Schema` the node type belongs to.\n    */\n    schema, \n    /**\n    The spec that this type is based on\n    */\n    spec) {\n        this.name = name;\n        this.schema = schema;\n        this.spec = spec;\n        /**\n        The set of marks allowed in this node. `null` means all marks\n        are allowed.\n        */\n        this.markSet = null;\n        this.groups = spec.group ? spec.group.split(\" \") : [];\n        this.attrs = initAttrs(spec.attrs);\n        this.defaultAttrs = defaultAttrs(this.attrs);\n        this.contentMatch = null;\n        this.inlineContent = null;\n        this.isBlock = !(spec.inline || name == \"text\");\n        this.isText = name == \"text\";\n    }\n    /**\n    True if this is an inline type.\n    */\n    get isInline() { return !this.isBlock; }\n    /**\n    True if this is a textblock type, a block that contains inline\n    content.\n    */\n    get isTextblock() { return this.isBlock && this.inlineContent; }\n    /**\n    True for node types that allow no content.\n    */\n    get isLeaf() { return this.contentMatch == ContentMatch.empty; }\n    /**\n    True when this node is an atom, i.e. when it does not have\n    directly editable content.\n    */\n    get isAtom() { return this.isLeaf || !!this.spec.atom; }\n    /**\n    The node type's [whitespace](https://prosemirror.net/docs/ref/#model.NodeSpec.whitespace) option.\n    */\n    get whitespace() {\n        return this.spec.whitespace || (this.spec.code ? \"pre\" : \"normal\");\n    }\n    /**\n    Tells you whether this node type has any required attributes.\n    */\n    hasRequiredAttrs() {\n        for (let n in this.attrs)\n            if (this.attrs[n].isRequired)\n                return true;\n        return false;\n    }\n    /**\n    Indicates whether this node allows some of the same content as\n    the given node type.\n    */\n    compatibleContent(other) {\n        return this == other || this.contentMatch.compatible(other.contentMatch);\n    }\n    /**\n    @internal\n    */\n    computeAttrs(attrs) {\n        if (!attrs && this.defaultAttrs)\n            return this.defaultAttrs;\n        else\n            return computeAttrs(this.attrs, attrs);\n    }\n    /**\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.\n    */\n    create(attrs = null, content, marks) {\n        if (this.isText)\n            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    Like [`create`](https://prosemirror.net/docs/ref/#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.\n    */\n    createChecked(attrs = null, 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    Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but see if it is\n    necessary to add nodes to the start or end of the given fragment\n    to make it fit the node. If no fitting wrapping can be found,\n    return null. Note that, due to the fact that required nodes can\n    always be created, this will always succeed if you pass null or\n    `Fragment.empty` as content.\n    */\n    createAndFill(attrs = null, content, marks) {\n        attrs = this.computeAttrs(attrs);\n        content = Fragment.from(content);\n        if (content.size) {\n            let before = this.contentMatch.fillBefore(content);\n            if (!before)\n                return null;\n            content = before.append(content);\n        }\n        let matched = this.contentMatch.matchFragment(content);\n        let after = matched && matched.fillBefore(Fragment.empty, true);\n        if (!after)\n            return null;\n        return new Node(this, attrs, content.append(after), Mark.setFrom(marks));\n    }\n    /**\n    Returns true if the given fragment is valid content for this node\n    type with the given attributes.\n    */\n    validContent(content) {\n        let result = this.contentMatch.matchFragment(content);\n        if (!result || !result.validEnd)\n            return false;\n        for (let i = 0; i < content.childCount; i++)\n            if (!this.allowsMarks(content.child(i).marks))\n                return false;\n        return true;\n    }\n    /**\n    Check whether the given mark type is allowed in this node.\n    */\n    allowsMarkType(markType) {\n        return this.markSet == null || this.markSet.indexOf(markType) > -1;\n    }\n    /**\n    Test whether the given set of marks are allowed in this node.\n    */\n    allowsMarks(marks) {\n        if (this.markSet == null)\n            return true;\n        for (let i = 0; i < marks.length; i++)\n            if (!this.allowsMarkType(marks[i].type))\n                return false;\n        return true;\n    }\n    /**\n    Removes the marks that are not allowed in this node from the given set.\n    */\n    allowedMarks(marks) {\n        if (this.markSet == null)\n            return marks;\n        let copy;\n        for (let i = 0; i < marks.length; i++) {\n            if (!this.allowsMarkType(marks[i].type)) {\n                if (!copy)\n                    copy = marks.slice(0, i);\n            }\n            else if (copy) {\n                copy.push(marks[i]);\n            }\n        }\n        return !copy ? marks : copy.length ? copy : Mark.none;\n    }\n    /**\n    @internal\n    */\n    static compile(nodes, schema) {\n        let result = Object.create(null);\n        nodes.forEach((name, spec) => result[name] = new NodeType(name, schema, spec));\n        let topType = schema.spec.topNode || \"doc\";\n        if (!result[topType])\n            throw new RangeError(\"Schema is missing its top node type ('\" + topType + \"')\");\n        if (!result.text)\n            throw new RangeError(\"Every schema needs a 'text' type\");\n        for (let _ in result.text.attrs)\n            throw new RangeError(\"The text node type should not have attributes\");\n        return result;\n    }\n}\n// Attribute descriptors\nclass Attribute {\n    constructor(options) {\n        this.hasDefault = Object.prototype.hasOwnProperty.call(options, \"default\");\n        this.default = options.default;\n    }\n    get isRequired() {\n        return !this.hasDefault;\n    }\n}\n// Marks\n/**\nLike nodes, marks (which are associated with nodes to signify\nthings like emphasis or being part of a link) are\n[tagged](https://prosemirror.net/docs/ref/#model.Mark.type) with type objects, which are\ninstantiated once per `Schema`.\n*/\nclass MarkType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name of the mark type.\n    */\n    name, \n    /**\n    @internal\n    */\n    rank, \n    /**\n    The schema that this mark type instance is part of.\n    */\n    schema, \n    /**\n    The spec on which the type is based.\n    */\n    spec) {\n        this.name = name;\n        this.rank = rank;\n        this.schema = schema;\n        this.spec = spec;\n        this.attrs = initAttrs(spec.attrs);\n        this.excluded = null;\n        let defaults = defaultAttrs(this.attrs);\n        this.instance = defaults ? new Mark(this, defaults) : null;\n    }\n    /**\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.\n    */\n    create(attrs = null) {\n        if (!attrs && this.instance)\n            return this.instance;\n        return new Mark(this, computeAttrs(this.attrs, attrs));\n    }\n    /**\n    @internal\n    */\n    static compile(marks, schema) {\n        let result = Object.create(null), rank = 0;\n        marks.forEach((name, spec) => result[name] = new MarkType(name, rank++, schema, spec));\n        return result;\n    }\n    /**\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.\n    */\n    removeFromSet(set) {\n        for (var i = 0; i < set.length; i++)\n            if (set[i].type == this) {\n                set = set.slice(0, i).concat(set.slice(i + 1));\n                i--;\n            }\n        return set;\n    }\n    /**\n    Tests whether there is a mark of this type in the given set.\n    */\n    isInSet(set) {\n        for (let i = 0; i < set.length; i++)\n            if (set[i].type == this)\n                return set[i];\n    }\n    /**\n    Queries whether a given mark type is\n    [excluded](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) by this one.\n    */\n    excludes(other) {\n        return this.excluded.indexOf(other) > -1;\n    }\n}\n/**\nA document schema. Holds [node](https://prosemirror.net/docs/ref/#model.NodeType) and [mark\ntype](https://prosemirror.net/docs/ref/#model.MarkType) objects for the nodes and marks that may\noccur in conforming documents, and provides functionality for\ncreating and deserializing such documents.\n\nWhen given, the type parameters provide the names of the nodes and\nmarks in this schema.\n*/\nclass Schema {\n    /**\n    Construct a schema from a schema [specification](https://prosemirror.net/docs/ref/#model.SchemaSpec).\n    */\n    constructor(spec) {\n        /**\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        */\n        this.cached = Object.create(null);\n        this.spec = {\n            nodes: OrderedMap.from(spec.nodes),\n            marks: OrderedMap.from(spec.marks || {}),\n            topNode: spec.topNode\n        };\n        this.nodes = NodeType.compile(this.spec.nodes, this);\n        this.marks = MarkType.compile(this.spec.marks, this);\n        let contentExprCache = Object.create(null);\n        for (let prop in this.nodes) {\n            if (prop in this.marks)\n                throw new RangeError(prop + \" can not be both a node and a mark\");\n            let type = this.nodes[prop], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n            type.contentMatch = contentExprCache[contentExpr] ||\n                (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\n            type.inlineContent = type.contentMatch.inlineContent;\n            type.markSet = markExpr == \"_\" ? null :\n                markExpr ? gatherMarks(this, markExpr.split(\" \")) :\n                    markExpr == \"\" || !type.inlineContent ? [] : null;\n        }\n        for (let prop in this.marks) {\n            let type = this.marks[prop], excl = type.spec.excludes;\n            type.excluded = excl == null ? [type] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"));\n        }\n        this.nodeFromJSON = this.nodeFromJSON.bind(this);\n        this.markFromJSON = this.markFromJSON.bind(this);\n        this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n        this.cached.wrappings = Object.create(null);\n    }\n    /**\n    Create a node in this schema. The `type` may be a string or a\n    `NodeType` instance. Attributes will be extended with defaults,\n    `content` may be a `Fragment`, `null`, a `Node`, or an array of\n    nodes.\n    */\n    node(type, attrs = null, 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        return type.createChecked(attrs, content, marks);\n    }\n    /**\n    Create a text node in the schema. Empty text nodes are not\n    allowed.\n    */\n    text(text, marks) {\n        let type = this.nodes.text;\n        return new TextNode(type, type.defaultAttrs, text, Mark.setFrom(marks));\n    }\n    /**\n    Create a mark with the given type and attributes.\n    */\n    mark(type, attrs) {\n        if (typeof type == \"string\")\n            type = this.marks[type];\n        return type.create(attrs);\n    }\n    /**\n    Deserialize a node from its JSON representation. This method is\n    bound.\n    */\n    nodeFromJSON(json) {\n        return Node.fromJSON(this, json);\n    }\n    /**\n    Deserialize a mark from its JSON representation. This method is\n    bound.\n    */\n    markFromJSON(json) {\n        return Mark.fromJSON(this, json);\n    }\n    /**\n    @internal\n    */\n    nodeType(name) {\n        let found = this.nodes[name];\n        if (!found)\n            throw new RangeError(\"Unknown node type: \" + name);\n        return found;\n    }\n}\nfunction gatherMarks(schema, marks) {\n    let found = [];\n    for (let i = 0; i < marks.length; i++) {\n        let name = marks[i], mark = schema.marks[name], ok = mark;\n        if (mark) {\n            found.push(mark);\n        }\n        else {\n            for (let prop in schema.marks) {\n                let mark = schema.marks[prop];\n                if (name == \"_\" || (mark.spec.group && mark.spec.group.split(\" \").indexOf(name) > -1))\n                    found.push(ok = mark);\n            }\n        }\n        if (!ok)\n            throw new SyntaxError(\"Unknown mark type: '\" + marks[i] + \"'\");\n    }\n    return found;\n}\n\n/**\nA DOM parser represents a strategy for parsing DOM content into a\nProseMirror document conforming to a given schema. Its behavior is\ndefined by an array of [rules](https://prosemirror.net/docs/ref/#model.ParseRule).\n*/\nclass DOMParser {\n    /**\n    Create a parser that targets the given schema, using the given\n    parsing rules.\n    */\n    constructor(\n    /**\n    The schema into which the parser parses.\n    */\n    schema, \n    /**\n    The set of [parse rules](https://prosemirror.net/docs/ref/#model.ParseRule) that the parser\n    uses, in order of precedence.\n    */\n    rules) {\n        this.schema = schema;\n        this.rules = rules;\n        /**\n        @internal\n        */\n        this.tags = [];\n        /**\n        @internal\n        */\n        this.styles = [];\n        rules.forEach(rule => {\n            if (rule.tag)\n                this.tags.push(rule);\n            else if (rule.style)\n                this.styles.push(rule);\n        });\n        // Only normalize list elements when lists in the schema can't directly contain themselves\n        this.normalizeLists = !this.tags.some(r => {\n            if (!/^(ul|ol)\\b/.test(r.tag) || !r.node)\n                return false;\n            let node = schema.nodes[r.node];\n            return node.contentMatch.matchType(node);\n        });\n    }\n    /**\n    Parse a document from the content of a DOM node.\n    */\n    parse(dom, options = {}) {\n        let context = new ParseContext(this, options, false);\n        context.addAll(dom, options.from, options.to);\n        return context.finish();\n    }\n    /**\n    Parses the content of the given DOM node, like\n    [`parse`](https://prosemirror.net/docs/ref/#model.DOMParser.parse), and takes the same set of\n    options. But unlike that method, which produces a whole node,\n    this one returns a slice that is open at the sides, meaning that\n    the schema constraints aren't applied to the start of nodes to\n    the left of the input and the end of nodes at the end.\n    */\n    parseSlice(dom, options = {}) {\n        let context = new ParseContext(this, options, true);\n        context.addAll(dom, options.from, options.to);\n        return Slice.maxOpen(context.finish());\n    }\n    /**\n    @internal\n    */\n    matchTag(dom, context, after) {\n        for (let i = after ? this.tags.indexOf(after) + 1 : 0; i < this.tags.length; i++) {\n            let rule = this.tags[i];\n            if (matches(dom, rule.tag) &&\n                (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&\n                (!rule.context || context.matchesContext(rule.context))) {\n                if (rule.getAttrs) {\n                    let result = rule.getAttrs(dom);\n                    if (result === false)\n                        continue;\n                    rule.attrs = result || undefined;\n                }\n                return rule;\n            }\n        }\n    }\n    /**\n    @internal\n    */\n    matchStyle(prop, value, context, after) {\n        for (let i = after ? this.styles.indexOf(after) + 1 : 0; i < this.styles.length; i++) {\n            let rule = this.styles[i], style = rule.style;\n            if (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                style.length > prop.length &&\n                    (style.charCodeAt(prop.length) != 61 || style.slice(prop.length + 1) != value))\n                continue;\n            if (rule.getAttrs) {\n                let result = rule.getAttrs(value);\n                if (result === false)\n                    continue;\n                rule.attrs = result || undefined;\n            }\n            return rule;\n        }\n    }\n    /**\n    @internal\n    */\n    static schemaRules(schema) {\n        let result = [];\n        function insert(rule) {\n            let priority = rule.priority == null ? 50 : rule.priority, i = 0;\n            for (; i < result.length; i++) {\n                let next = result[i], nextPriority = next.priority == null ? 50 : next.priority;\n                if (nextPriority < priority)\n                    break;\n            }\n            result.splice(i, 0, rule);\n        }\n        for (let name in schema.marks) {\n            let rules = schema.marks[name].spec.parseDOM;\n            if (rules)\n                rules.forEach(rule => {\n                    insert(rule = copy(rule));\n                    rule.mark = name;\n                });\n        }\n        for (let name in schema.nodes) {\n            let rules = schema.nodes[name].spec.parseDOM;\n            if (rules)\n                rules.forEach(rule => {\n                    insert(rule = copy(rule));\n                    rule.node = name;\n                });\n        }\n        return result;\n    }\n    /**\n    Construct a DOM parser using the parsing rules listed in a\n    schema's [node specs](https://prosemirror.net/docs/ref/#model.NodeSpec.parseDOM), reordered by\n    [priority](https://prosemirror.net/docs/ref/#model.ParseRule.priority).\n    */\n    static fromSchema(schema) {\n        return schema.cached.domParser ||\n            (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)));\n    }\n}\nconst blockTags = {\n    address: true, article: true, aside: true, blockquote: true, canvas: true,\n    dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,\n    footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,\n    h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,\n    output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true\n};\nconst ignoreTags = {\n    head: true, noscript: true, object: true, script: true, style: true, title: true\n};\nconst listTags = { ol: true, ul: true };\n// Using a bitfield for node context options\nconst OPT_PRESERVE_WS = 1, OPT_PRESERVE_WS_FULL = 2, OPT_OPEN_LEFT = 4;\nfunction wsOptionsFor(type, preserveWhitespace, base) {\n    if (preserveWhitespace != null)\n        return (preserveWhitespace ? OPT_PRESERVE_WS : 0) |\n            (preserveWhitespace === \"full\" ? OPT_PRESERVE_WS_FULL : 0);\n    return type && type.whitespace == \"pre\" ? OPT_PRESERVE_WS | OPT_PRESERVE_WS_FULL : base & ~OPT_OPEN_LEFT;\n}\nclass NodeContext {\n    constructor(type, attrs, \n    // Marks applied to this node itself\n    marks, \n    // Marks that can't apply here, but will be used in children if possible\n    pendingMarks, solid, match, options) {\n        this.type = type;\n        this.attrs = attrs;\n        this.marks = marks;\n        this.pendingMarks = pendingMarks;\n        this.solid = solid;\n        this.options = options;\n        this.content = [];\n        // Marks applied to the node's children\n        this.activeMarks = Mark.none;\n        // Nested Marks with same type\n        this.stashMarks = [];\n        this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);\n    }\n    findWrapping(node) {\n        if (!this.match) {\n            if (!this.type)\n                return [];\n            let fill = this.type.contentMatch.fillBefore(Fragment.from(node));\n            if (fill) {\n                this.match = this.type.contentMatch.matchFragment(fill);\n            }\n            else {\n                let start = this.type.contentMatch, wrap;\n                if (wrap = start.findWrapping(node.type)) {\n                    this.match = start;\n                    return wrap;\n                }\n                else {\n                    return null;\n                }\n            }\n        }\n        return this.match.findWrapping(node.type);\n    }\n    finish(openEnd) {\n        if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace\n            let last = this.content[this.content.length - 1], m;\n            if (last && last.isText && (m = /[ \\t\\r\\n\\u000c]+$/.exec(last.text))) {\n                let text = last;\n                if (last.text.length == m[0].length)\n                    this.content.pop();\n                else\n                    this.content[this.content.length - 1] = text.withText(text.text.slice(0, text.text.length - m[0].length));\n            }\n        }\n        let content = Fragment.from(this.content);\n        if (!openEnd && this.match)\n            content = content.append(this.match.fillBefore(Fragment.empty, true));\n        return this.type ? this.type.create(this.attrs, content, this.marks) : content;\n    }\n    popFromStashMark(mark) {\n        for (let i = this.stashMarks.length - 1; i >= 0; i--)\n            if (mark.eq(this.stashMarks[i]))\n                return this.stashMarks.splice(i, 1)[0];\n    }\n    applyPending(nextType) {\n        for (let i = 0, pending = this.pendingMarks; i < pending.length; i++) {\n            let mark = pending[i];\n            if ((this.type ? this.type.allowsMarkType(mark.type) : markMayApply(mark.type, nextType)) &&\n                !mark.isInSet(this.activeMarks)) {\n                this.activeMarks = mark.addToSet(this.activeMarks);\n                this.pendingMarks = mark.removeFromSet(this.pendingMarks);\n            }\n        }\n    }\n    inlineContext(node) {\n        if (this.type)\n            return this.type.inlineContent;\n        if (this.content.length)\n            return this.content[0].isInline;\n        return node.parentNode && !blockTags.hasOwnProperty(node.parentNode.nodeName.toLowerCase());\n    }\n}\nclass ParseContext {\n    constructor(\n    // The parser we are using.\n    parser, \n    // The options passed to this parse.\n    options, isOpen) {\n        this.parser = parser;\n        this.options = options;\n        this.isOpen = isOpen;\n        this.open = 0;\n        let topNode = options.topNode, topContext;\n        let topOptions = wsOptionsFor(null, options.preserveWhitespace, 0) | (isOpen ? OPT_OPEN_LEFT : 0);\n        if (topNode)\n            topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, Mark.none, true, options.topMatch || topNode.type.contentMatch, topOptions);\n        else if (isOpen)\n            topContext = new NodeContext(null, null, Mark.none, Mark.none, true, null, topOptions);\n        else\n            topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, Mark.none, true, null, topOptions);\n        this.nodes = [topContext];\n        this.find = options.findPositions;\n        this.needsBlock = false;\n    }\n    get top() {\n        return this.nodes[this.open];\n    }\n    // Add a DOM node to the content. Text is inserted as text node,\n    // otherwise, the node is passed to `addElement` or, if it has a\n    // `style` attribute, `addElementWithStyles`.\n    addDOM(dom) {\n        if (dom.nodeType == 3) {\n            this.addTextNode(dom);\n        }\n        else if (dom.nodeType == 1) {\n            let style = dom.getAttribute(\"style\");\n            let marks = style ? this.readStyles(parseStyles(style)) : null, top = this.top;\n            if (marks != null)\n                for (let i = 0; i < marks.length; i++)\n                    this.addPendingMark(marks[i]);\n            this.addElement(dom);\n            if (marks != null)\n                for (let i = 0; i < marks.length; i++)\n                    this.removePendingMark(marks[i], top);\n        }\n    }\n    addTextNode(dom) {\n        let value = dom.nodeValue;\n        let top = this.top;\n        if (top.options & OPT_PRESERVE_WS_FULL ||\n            top.inlineContext(dom) ||\n            /[^ \\t\\r\\n\\u000c]/.test(value)) {\n            if (!(top.options & OPT_PRESERVE_WS)) {\n                value = value.replace(/[ \\t\\r\\n\\u000c]+/g, \" \");\n                // If this starts with whitespace, and there is no node before it, or\n                // a hard break, or a text node that ends with whitespace, strip the\n                // leading space.\n                if (/^[ \\t\\r\\n\\u000c]/.test(value) && this.open == this.nodes.length - 1) {\n                    let nodeBefore = top.content[top.content.length - 1];\n                    let domNodeBefore = dom.previousSibling;\n                    if (!nodeBefore ||\n                        (domNodeBefore && domNodeBefore.nodeName == 'BR') ||\n                        (nodeBefore.isText && /[ \\t\\r\\n\\u000c]$/.test(nodeBefore.text)))\n                        value = value.slice(1);\n                }\n            }\n            else if (!(top.options & OPT_PRESERVE_WS_FULL)) {\n                value = value.replace(/\\r?\\n|\\r/g, \" \");\n            }\n            else {\n                value = value.replace(/\\r\\n?/g, \"\\n\");\n            }\n            if (value)\n                this.insertNode(this.parser.schema.text(value));\n            this.findInText(dom);\n        }\n        else {\n            this.findInside(dom);\n        }\n    }\n    // Try to find a handler for the given tag and use that to parse. If\n    // none is found, the element's content nodes are added directly.\n    addElement(dom, matchAfter) {\n        let name = dom.nodeName.toLowerCase(), ruleID;\n        if (listTags.hasOwnProperty(name) && this.parser.normalizeLists)\n            normalizeList(dom);\n        let rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) ||\n            (ruleID = this.parser.matchTag(dom, this, matchAfter));\n        if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {\n            this.findInside(dom);\n            this.ignoreFallback(dom);\n        }\n        else if (!rule || rule.skip || rule.closeParent) {\n            if (rule && rule.closeParent)\n                this.open = Math.max(0, this.open - 1);\n            else if (rule && rule.skip.nodeType)\n                dom = rule.skip;\n            let sync, top = this.top, oldNeedsBlock = this.needsBlock;\n            if (blockTags.hasOwnProperty(name)) {\n                sync = true;\n                if (!top.type)\n                    this.needsBlock = true;\n            }\n            else if (!dom.firstChild) {\n                this.leafFallback(dom);\n                return;\n            }\n            this.addAll(dom);\n            if (sync)\n                this.sync(top);\n            this.needsBlock = oldNeedsBlock;\n        }\n        else {\n            this.addElementByRule(dom, rule, rule.consuming === false ? ruleID : undefined);\n        }\n    }\n    // Called for leaf DOM nodes that would otherwise be ignored\n    leafFallback(dom) {\n        if (dom.nodeName == \"BR\" && this.top.type && this.top.type.inlineContent)\n            this.addTextNode(dom.ownerDocument.createTextNode(\"\\n\"));\n    }\n    // Called for ignored nodes\n    ignoreFallback(dom) {\n        // Ignored BR nodes should at least create an inline context\n        if (dom.nodeName == \"BR\" && (!this.top.type || !this.top.type.inlineContent))\n            this.findPlace(this.parser.schema.text(\"-\"));\n    }\n    // Run any style parser associated with the node's styles. Either\n    // return an array of marks, or null to indicate some of the styles\n    // had a rule with `ignore` set.\n    readStyles(styles) {\n        let marks = Mark.none;\n        style: for (let i = 0; i < styles.length; i += 2) {\n            for (let after = undefined;;) {\n                let rule = this.parser.matchStyle(styles[i], styles[i + 1], this, after);\n                if (!rule)\n                    continue style;\n                if (rule.ignore)\n                    return null;\n                marks = this.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks);\n                if (rule.consuming === false)\n                    after = rule;\n                else\n                    break;\n            }\n        }\n        return marks;\n    }\n    // Look up a handler for the given node. If none are found, return\n    // false. Otherwise, apply it, use its return value to drive the way\n    // the node's content is wrapped, and return true.\n    addElementByRule(dom, rule, continueAfter) {\n        let sync, nodeType, mark;\n        if (rule.node) {\n            nodeType = this.parser.schema.nodes[rule.node];\n            if (!nodeType.isLeaf) {\n                sync = this.enter(nodeType, rule.attrs || null, rule.preserveWhitespace);\n            }\n            else if (!this.insertNode(nodeType.create(rule.attrs))) {\n                this.leafFallback(dom);\n            }\n        }\n        else {\n            let markType = this.parser.schema.marks[rule.mark];\n            mark = markType.create(rule.attrs);\n            this.addPendingMark(mark);\n        }\n        let startIn = this.top;\n        if (nodeType && nodeType.isLeaf) {\n            this.findInside(dom);\n        }\n        else if (continueAfter) {\n            this.addElement(dom, continueAfter);\n        }\n        else if (rule.getContent) {\n            this.findInside(dom);\n            rule.getContent(dom, this.parser.schema).forEach(node => this.insertNode(node));\n        }\n        else {\n            let contentDOM = dom;\n            if (typeof rule.contentElement == \"string\")\n                contentDOM = dom.querySelector(rule.contentElement);\n            else if (typeof rule.contentElement == \"function\")\n                contentDOM = rule.contentElement(dom);\n            else if (rule.contentElement)\n                contentDOM = rule.contentElement;\n            this.findAround(dom, contentDOM, true);\n            this.addAll(contentDOM);\n        }\n        if (sync && this.sync(startIn))\n            this.open--;\n        if (mark)\n            this.removePendingMark(mark, startIn);\n    }\n    // Add all child nodes between `startIndex` and `endIndex` (or the\n    // whole node, if not given). If `sync` is passed, use it to\n    // synchronize after every block element.\n    addAll(parent, startIndex, endIndex) {\n        let index = startIndex || 0;\n        for (let dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild, end = endIndex == null ? null : parent.childNodes[endIndex]; dom != end; dom = dom.nextSibling, ++index) {\n            this.findAtPoint(parent, index);\n            this.addDOM(dom);\n        }\n        this.findAtPoint(parent, index);\n    }\n    // Try to find a way to fit the given node type into the current\n    // context. May add intermediate wrappers and/or leave non-solid\n    // nodes that we're in.\n    findPlace(node) {\n        let route, sync;\n        for (let depth = this.open; depth >= 0; depth--) {\n            let cx = this.nodes[depth];\n            let found = cx.findWrapping(node);\n            if (found && (!route || route.length > found.length)) {\n                route = found;\n                sync = cx;\n                if (!found.length)\n                    break;\n            }\n            if (cx.solid)\n                break;\n        }\n        if (!route)\n            return false;\n        this.sync(sync);\n        for (let i = 0; i < route.length; i++)\n            this.enterInner(route[i], null, false);\n        return true;\n    }\n    // Try to insert the given node, adjusting the context when needed.\n    insertNode(node) {\n        if (node.isInline && this.needsBlock && !this.top.type) {\n            let block = this.textblockFromContext();\n            if (block)\n                this.enterInner(block);\n        }\n        if (this.findPlace(node)) {\n            this.closeExtra();\n            let top = this.top;\n            top.applyPending(node.type);\n            if (top.match)\n                top.match = top.match.matchType(node.type);\n            let marks = top.activeMarks;\n            for (let i = 0; i < node.marks.length; i++)\n                if (!top.type || top.type.allowsMarkType(node.marks[i].type))\n                    marks = node.marks[i].addToSet(marks);\n            top.content.push(node.mark(marks));\n            return true;\n        }\n        return false;\n    }\n    // Try to start a node of the given type, adjusting the context when\n    // necessary.\n    enter(type, attrs, preserveWS) {\n        let ok = this.findPlace(type.create(attrs));\n        if (ok)\n            this.enterInner(type, attrs, true, preserveWS);\n        return ok;\n    }\n    // Open a node of the given type\n    enterInner(type, attrs = null, solid = false, preserveWS) {\n        this.closeExtra();\n        let top = this.top;\n        top.applyPending(type);\n        top.match = top.match && top.match.matchType(type);\n        let options = wsOptionsFor(type, preserveWS, top.options);\n        if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0)\n            options |= OPT_OPEN_LEFT;\n        this.nodes.push(new NodeContext(type, attrs, top.activeMarks, top.pendingMarks, solid, null, options));\n        this.open++;\n    }\n    // Make sure all nodes above this.open are finished and added to\n    // their parents\n    closeExtra(openEnd = false) {\n        let i = this.nodes.length - 1;\n        if (i > this.open) {\n            for (; i > this.open; i--)\n                this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd));\n            this.nodes.length = this.open + 1;\n        }\n    }\n    finish() {\n        this.open = 0;\n        this.closeExtra(this.isOpen);\n        return this.nodes[0].finish(this.isOpen || this.options.topOpen);\n    }\n    sync(to) {\n        for (let i = this.open; i >= 0; i--)\n            if (this.nodes[i] == to) {\n                this.open = i;\n                return true;\n            }\n        return false;\n    }\n    get currentPos() {\n        this.closeExtra();\n        let pos = 0;\n        for (let i = this.open; i >= 0; i--) {\n            let content = this.nodes[i].content;\n            for (let j = content.length - 1; j >= 0; j--)\n                pos += content[j].nodeSize;\n            if (i)\n                pos++;\n        }\n        return pos;\n    }\n    findAtPoint(parent, offset) {\n        if (this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].node == parent && this.find[i].offset == offset)\n                    this.find[i].pos = this.currentPos;\n            }\n    }\n    findInside(parent) {\n        if (this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node))\n                    this.find[i].pos = this.currentPos;\n            }\n    }\n    findAround(parent, content, before) {\n        if (parent != content && this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {\n                    let pos = content.compareDocumentPosition(this.find[i].node);\n                    if (pos & (before ? 2 : 4))\n                        this.find[i].pos = this.currentPos;\n                }\n            }\n    }\n    findInText(textNode) {\n        if (this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].node == textNode)\n                    this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset);\n            }\n    }\n    // Determines whether the given context string matches this context.\n    matchesContext(context) {\n        if (context.indexOf(\"|\") > -1)\n            return context.split(/\\s*\\|\\s*/).some(this.matchesContext, this);\n        let parts = context.split(\"/\");\n        let option = this.options.context;\n        let useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);\n        let minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);\n        let match = (i, depth) => {\n            for (; i >= 0; i--) {\n                let part = parts[i];\n                if (part == \"\") {\n                    if (i == parts.length - 1 || i == 0)\n                        continue;\n                    for (; depth >= minDepth; depth--)\n                        if (match(i - 1, depth))\n                            return true;\n                    return false;\n                }\n                else {\n                    let next = depth > 0 || (depth == 0 && useRoot) ? this.nodes[depth].type\n                        : option && depth >= minDepth ? option.node(depth - minDepth).type\n                            : null;\n                    if (!next || (next.name != part && next.groups.indexOf(part) == -1))\n                        return false;\n                    depth--;\n                }\n            }\n            return true;\n        };\n        return match(parts.length - 1, this.open);\n    }\n    textblockFromContext() {\n        let $context = this.options.context;\n        if ($context)\n            for (let d = $context.depth; d >= 0; d--) {\n                let deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;\n                if (deflt && deflt.isTextblock && deflt.defaultAttrs)\n                    return deflt;\n            }\n        for (let name in this.parser.schema.nodes) {\n            let type = this.parser.schema.nodes[name];\n            if (type.isTextblock && type.defaultAttrs)\n                return type;\n        }\n    }\n    addPendingMark(mark) {\n        let found = findSameMarkInSet(mark, this.top.pendingMarks);\n        if (found)\n            this.top.stashMarks.push(found);\n        this.top.pendingMarks = mark.addToSet(this.top.pendingMarks);\n    }\n    removePendingMark(mark, upto) {\n        for (let depth = this.open; depth >= 0; depth--) {\n            let level = this.nodes[depth];\n            let found = level.pendingMarks.lastIndexOf(mark);\n            if (found > -1) {\n                level.pendingMarks = mark.removeFromSet(level.pendingMarks);\n            }\n            else {\n                level.activeMarks = mark.removeFromSet(level.activeMarks);\n                let stashMark = level.popFromStashMark(mark);\n                if (stashMark && level.type && level.type.allowsMarkType(stashMark.type))\n                    level.activeMarks = stashMark.addToSet(level.activeMarks);\n            }\n            if (level == upto)\n                break;\n        }\n    }\n}\n// Kludge to work around directly nested list nodes produced by some\n// tools and allowed by browsers to mean that the nested list is\n// actually part of the list item above it.\nfunction normalizeList(dom) {\n    for (let child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {\n        let name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;\n        if (name && listTags.hasOwnProperty(name) && prevItem) {\n            prevItem.appendChild(child);\n            child = prevItem;\n        }\n        else if (name == \"li\") {\n            prevItem = child;\n        }\n        else if (name) {\n            prevItem = null;\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// Tokenize a style attribute into property/value pairs.\nfunction parseStyles(style) {\n    let re = /\\s*([\\w-]+)\\s*:\\s*([^;]+)/g, m, result = [];\n    while (m = re.exec(style))\n        result.push(m[1], m[2].trim());\n    return result;\n}\nfunction copy(obj) {\n    let copy = {};\n    for (let prop in obj)\n        copy[prop] = obj[prop];\n    return copy;\n}\n// Used when finding a mark at the top level of a fragment parse.\n// Checks whether it would be reasonable to apply a given mark type to\n// a given node, by looking at the way the mark occurs in the schema.\nfunction markMayApply(markType, nodeType) {\n    let nodes = nodeType.schema.nodes;\n    for (let name in nodes) {\n        let parent = nodes[name];\n        if (!parent.allowsMarkType(markType))\n            continue;\n        let seen = [], scan = (match) => {\n            seen.push(match);\n            for (let i = 0; i < match.edgeCount; i++) {\n                let { type, next } = match.edge(i);\n                if (type == nodeType)\n                    return true;\n                if (seen.indexOf(next) < 0 && scan(next))\n                    return true;\n            }\n        };\n        if (scan(parent.contentMatch))\n            return true;\n    }\n}\nfunction findSameMarkInSet(mark, set) {\n    for (let i = 0; i < set.length; i++) {\n        if (mark.eq(set[i]))\n            return set[i];\n    }\n}\n\n/**\nA DOM serializer knows how to convert ProseMirror nodes and\nmarks of various types to DOM nodes.\n*/\nclass DOMSerializer {\n    /**\n    Create a serializer. `nodes` should map node names to functions\n    that take a node and return a description of the corresponding\n    DOM. `marks` does the same for mark names, but also gets an\n    argument that tells it whether the mark's content is block or\n    inline content (for typical use, it'll always be inline). A mark\n    serializer may be `null` to indicate that marks of that type\n    should not be serialized.\n    */\n    constructor(\n    /**\n    The node serialization functions.\n    */\n    nodes, \n    /**\n    The mark serialization functions.\n    */\n    marks) {\n        this.nodes = nodes;\n        this.marks = marks;\n    }\n    /**\n    Serialize the content of this fragment to a DOM fragment. When\n    not in the browser, the `document` option, containing a DOM\n    document, should be passed so that the serializer can create\n    nodes.\n    */\n    serializeFragment(fragment, options = {}, target) {\n        if (!target)\n            target = doc(options).createDocumentFragment();\n        let top = target, active = [];\n        fragment.forEach(node => {\n            if (active.length || node.marks.length) {\n                let keep = 0, rendered = 0;\n                while (keep < active.length && rendered < node.marks.length) {\n                    let next = node.marks[rendered];\n                    if (!this.marks[next.type.name]) {\n                        rendered++;\n                        continue;\n                    }\n                    if (!next.eq(active[keep][0]) || next.type.spec.spanning === false)\n                        break;\n                    keep++;\n                    rendered++;\n                }\n                while (keep < active.length)\n                    top = active.pop()[1];\n                while (rendered < node.marks.length) {\n                    let add = node.marks[rendered++];\n                    let markDOM = this.serializeMark(add, node.isInline, options);\n                    if (markDOM) {\n                        active.push([add, top]);\n                        top.appendChild(markDOM.dom);\n                        top = markDOM.contentDOM || markDOM.dom;\n                    }\n                }\n            }\n            top.appendChild(this.serializeNodeInner(node, options));\n        });\n        return target;\n    }\n    /**\n    @internal\n    */\n    serializeNodeInner(node, options) {\n        let { dom, contentDOM } = DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));\n        if (contentDOM) {\n            if (node.isLeaf)\n                throw new RangeError(\"Content hole not allowed in a leaf node spec\");\n            this.serializeFragment(node.content, options, contentDOM);\n        }\n        return dom;\n    }\n    /**\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`](https://prosemirror.net/docs/ref/#model.DOMSerializer.serializeFragment) on\n    its [content](https://prosemirror.net/docs/ref/#model.Node.content).\n    */\n    serializeNode(node, options = {}) {\n        let dom = this.serializeNodeInner(node, options);\n        for (let i = node.marks.length - 1; i >= 0; i--) {\n            let wrap = this.serializeMark(node.marks[i], node.isInline, options);\n            if (wrap) {\n                (wrap.contentDOM || wrap.dom).appendChild(dom);\n                dom = wrap.dom;\n            }\n        }\n        return dom;\n    }\n    /**\n    @internal\n    */\n    serializeMark(mark, inline, options = {}) {\n        let toDOM = this.marks[mark.type.name];\n        return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline));\n    }\n    /**\n    Render an [output spec](https://prosemirror.net/docs/ref/#model.DOMOutputSpec) to a DOM node. If\n    the spec has a hole (zero) in it, `contentDOM` will point at the\n    node with the hole.\n    */\n    static renderSpec(doc, structure, xmlNS = null) {\n        if (typeof structure == \"string\")\n            return { dom: doc.createTextNode(structure) };\n        if (structure.nodeType != null)\n            return { dom: structure };\n        if (structure.dom && structure.dom.nodeType != null)\n            return structure;\n        let tagName = structure[0], space = tagName.indexOf(\" \");\n        if (space > 0) {\n            xmlNS = tagName.slice(0, space);\n            tagName = tagName.slice(space + 1);\n        }\n        let contentDOM;\n        let dom = (xmlNS ? doc.createElementNS(xmlNS, tagName) : doc.createElement(tagName));\n        let attrs = structure[1], start = 1;\n        if (attrs && typeof attrs == \"object\" && attrs.nodeType == null && !Array.isArray(attrs)) {\n            start = 2;\n            for (let name in attrs)\n                if (attrs[name] != null) {\n                    let space = name.indexOf(\" \");\n                    if (space > 0)\n                        dom.setAttributeNS(name.slice(0, space), name.slice(space + 1), attrs[name]);\n                    else\n                        dom.setAttribute(name, attrs[name]);\n                }\n        }\n        for (let i = start; i < structure.length; i++) {\n            let child = structure[i];\n            if (child === 0) {\n                if (i < structure.length - 1 || i > start)\n                    throw new RangeError(\"Content hole must be the only child of its parent node\");\n                return { dom, contentDOM: dom };\n            }\n            else {\n                let { dom: inner, contentDOM: innerContent } = DOMSerializer.renderSpec(doc, child, xmlNS);\n                dom.appendChild(inner);\n                if (innerContent) {\n                    if (contentDOM)\n                        throw new RangeError(\"Multiple content holes\");\n                    contentDOM = innerContent;\n                }\n            }\n        }\n        return { dom, contentDOM };\n    }\n    /**\n    Build a serializer using the [`toDOM`](https://prosemirror.net/docs/ref/#model.NodeSpec.toDOM)\n    properties in a schema's node and mark specs.\n    */\n    static fromSchema(schema) {\n        return schema.cached.domSerializer ||\n            (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)));\n    }\n    /**\n    Gather the serializers in a schema's node specs into an object.\n    This can be useful as a base to build a custom serializer from.\n    */\n    static nodesFromSchema(schema) {\n        let result = gatherToDOM(schema.nodes);\n        if (!result.text)\n            result.text = node => node.text;\n        return result;\n    }\n    /**\n    Gather the serializers in a schema's mark specs into an object.\n    */\n    static marksFromSchema(schema) {\n        return gatherToDOM(schema.marks);\n    }\n}\nfunction gatherToDOM(obj) {\n    let result = {};\n    for (let name in obj) {\n        let toDOM = obj[name].spec.toDOM;\n        if (toDOM)\n            result[name] = toDOM;\n    }\n    return result;\n}\nfunction doc(options) {\n    return options.document || window.document;\n}\n\nexport { ContentMatch, DOMParser, DOMSerializer, Fragment, Mark, MarkType, Node, NodeRange, NodeType, ReplaceError, ResolvedPos, Schema, Slice };\n","import { Slice, Fragment, Mark, Node } from 'prosemirror-model';\nimport { ReplaceStep, ReplaceAroundStep, Transform } from 'prosemirror-transform';\n\nconst classesById = Object.create(null);\n/**\nSuperclass for editor selections. Every selection type should\nextend this. Should not be instantiated directly.\n*/\nclass Selection {\n    /**\n    Initialize a selection with the head and anchor and ranges. If no\n    ranges are given, constructs a single range across `$anchor` and\n    `$head`.\n    */\n    constructor(\n    /**\n    The resolved anchor of the selection (the side that stays in\n    place when the selection is modified).\n    */\n    $anchor, \n    /**\n    The resolved head of the selection (the side that moves when\n    the selection is modified).\n    */\n    $head, ranges) {\n        this.$anchor = $anchor;\n        this.$head = $head;\n        this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];\n    }\n    /**\n    The selection's anchor, as an unresolved position.\n    */\n    get anchor() { return this.$anchor.pos; }\n    /**\n    The selection's head.\n    */\n    get head() { return this.$head.pos; }\n    /**\n    The lower bound of the selection's main range.\n    */\n    get from() { return this.$from.pos; }\n    /**\n    The upper bound of the selection's main range.\n    */\n    get to() { return this.$to.pos; }\n    /**\n    The resolved lower  bound of the selection's main range.\n    */\n    get $from() {\n        return this.ranges[0].$from;\n    }\n    /**\n    The resolved upper bound of the selection's main range.\n    */\n    get $to() {\n        return this.ranges[0].$to;\n    }\n    /**\n    Indicates whether the selection contains any content.\n    */\n    get empty() {\n        let ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++)\n            if (ranges[i].$from.pos != ranges[i].$to.pos)\n                return false;\n        return true;\n    }\n    /**\n    Get the content of this selection as a slice.\n    */\n    content() {\n        return this.$from.doc.slice(this.from, this.to, true);\n    }\n    /**\n    Replace the selection with a slice or, if no slice is given,\n    delete the selection. Will append to the given transaction.\n    */\n    replace(tr, content = Slice.empty) {\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        let lastNode = content.content.lastChild, lastParent = null;\n        for (let i = 0; i < content.openEnd; i++) {\n            lastParent = lastNode;\n            lastNode = lastNode.lastChild;\n        }\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);\n            if (i == 0)\n                selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1);\n        }\n    }\n    /**\n    Replace the selection with the given node, appending the changes\n    to the given transaction.\n    */\n    replaceWith(tr, node) {\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            let from = mapping.map($from.pos), to = mapping.map($to.pos);\n            if (i) {\n                tr.deleteRange(from, to);\n            }\n            else {\n                tr.replaceRangeWith(from, to, node);\n                selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);\n            }\n        }\n    }\n    /**\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.\n    */\n    static findFrom($pos, dir, textOnly = false) {\n        let inner = $pos.parent.inlineContent ? new TextSelection($pos)\n            : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);\n        if (inner)\n            return inner;\n        for (let depth = $pos.depth - 1; depth >= 0; depth--) {\n            let 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)\n                return found;\n        }\n        return null;\n    }\n    /**\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.\n    */\n    static near($pos, bias = 1) {\n        return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0));\n    }\n    /**\n    Find the cursor or leaf node selection closest to the start of\n    the given document. Will return an\n    [`AllSelection`](https://prosemirror.net/docs/ref/#state.AllSelection) if no valid position\n    exists.\n    */\n    static atStart(doc) {\n        return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc);\n    }\n    /**\n    Find the cursor or leaf node selection closest to the end of the\n    given document.\n    */\n    static atEnd(doc) {\n        return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc);\n    }\n    /**\n    Deserialize the JSON representation of a selection. Must be\n    implemented for custom classes (as a static class method).\n    */\n    static fromJSON(doc, json) {\n        if (!json || !json.type)\n            throw new RangeError(\"Invalid input for Selection.fromJSON\");\n        let cls = classesById[json.type];\n        if (!cls)\n            throw new RangeError(`No selection type ${json.type} defined`);\n        return cls.fromJSON(doc, json);\n    }\n    /**\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.\n    */\n    static jsonID(id, selectionClass) {\n        if (id in classesById)\n            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    Get a [bookmark](https://prosemirror.net/docs/ref/#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.\n    */\n    getBookmark() {\n        return TextSelection.between(this.$anchor, this.$head).getBookmark();\n    }\n}\nSelection.prototype.visible = true;\n/**\nRepresents a selected range in a document.\n*/\nclass SelectionRange {\n    /**\n    Create a range.\n    */\n    constructor(\n    /**\n    The lower bound of the range.\n    */\n    $from, \n    /**\n    The upper bound of the range.\n    */\n    $to) {\n        this.$from = $from;\n        this.$to = $to;\n    }\n}\nlet warnedAboutTextSelection = false;\nfunction checkTextSelection($pos) {\n    if (!warnedAboutTextSelection && !$pos.parent.inlineContent) {\n        warnedAboutTextSelection = true;\n        console[\"warn\"](\"TextSelection endpoint not pointing into a node with inline content (\" + $pos.parent.type.name + \")\");\n    }\n}\n/**\nA text selection represents a classical editor selection, with a\nhead (the moving side) and anchor (immobile side), both of which\npoint into textblock nodes. It can be empty (a regular cursor\nposition).\n*/\nclass TextSelection extends Selection {\n    /**\n    Construct a text selection between the given points.\n    */\n    constructor($anchor, $head = $anchor) {\n        checkTextSelection($anchor);\n        checkTextSelection($head);\n        super($anchor, $head);\n    }\n    /**\n    Returns a resolved position if this is a cursor selection (an\n    empty text selection), and null otherwise.\n    */\n    get $cursor() { return this.$anchor.pos == this.$head.pos ? this.$head : null; }\n    map(doc, mapping) {\n        let $head = doc.resolve(mapping.map(this.head));\n        if (!$head.parent.inlineContent)\n            return Selection.near($head);\n        let $anchor = doc.resolve(mapping.map(this.anchor));\n        return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head);\n    }\n    replace(tr, content = Slice.empty) {\n        super.replace(tr, content);\n        if (content == Slice.empty) {\n            let marks = this.$from.marksAcross(this.$to);\n            if (marks)\n                tr.ensureMarks(marks);\n        }\n    }\n    eq(other) {\n        return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head;\n    }\n    getBookmark() {\n        return new TextBookmark(this.anchor, this.head);\n    }\n    toJSON() {\n        return { type: \"text\", anchor: this.anchor, head: this.head };\n    }\n    /**\n    @internal\n    */\n    static 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    Create a text selection from non-resolved positions.\n    */\n    static create(doc, anchor, head = anchor) {\n        let $anchor = doc.resolve(anchor);\n        return new this($anchor, head == anchor ? $anchor : doc.resolve(head));\n    }\n    /**\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`](https://prosemirror.net/docs/ref/#state.Selection^near) when the document\n    doesn't contain a valid text position.\n    */\n    static between($anchor, $head, bias) {\n        let dPos = $anchor.pos - $head.pos;\n        if (!bias || dPos)\n            bias = dPos >= 0 ? 1 : -1;\n        if (!$head.parent.inlineContent) {\n            let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);\n            if (found)\n                $head = found.$head;\n            else\n                return Selection.near($head, bias);\n        }\n        if (!$anchor.parent.inlineContent) {\n            if (dPos == 0) {\n                $anchor = $head;\n            }\n            else {\n                $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;\n                if (($anchor.pos < $head.pos) != (dPos < 0))\n                    $anchor = $head;\n            }\n        }\n        return new TextSelection($anchor, $head);\n    }\n}\nSelection.jsonID(\"text\", TextSelection);\nclass TextBookmark {\n    constructor(anchor, head) {\n        this.anchor = anchor;\n        this.head = head;\n    }\n    map(mapping) {\n        return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head));\n    }\n    resolve(doc) {\n        return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head));\n    }\n}\n/**\nA node selection is a selection that points at a single node. All\nnodes marked [selectable](https://prosemirror.net/docs/ref/#model.NodeSpec.selectable) can be the\ntarget of a node selection. In such a selection, `from` and `to`\npoint directly before and after the selected node, `anchor` equals\n`from`, and `head` equals `to`..\n*/\nclass NodeSelection extends Selection {\n    /**\n    Create a node selection. Does not verify the validity of its\n    argument.\n    */\n    constructor($pos) {\n        let node = $pos.nodeAfter;\n        let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n        super($pos, $end);\n        this.node = node;\n    }\n    map(doc, mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        let $pos = doc.resolve(pos);\n        if (deleted)\n            return Selection.near($pos);\n        return new NodeSelection($pos);\n    }\n    content() {\n        return new Slice(Fragment.from(this.node), 0, 0);\n    }\n    eq(other) {\n        return other instanceof NodeSelection && other.anchor == this.anchor;\n    }\n    toJSON() {\n        return { type: \"node\", anchor: this.anchor };\n    }\n    getBookmark() { return new NodeBookmark(this.anchor); }\n    /**\n    @internal\n    */\n    static 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    Create a node selection from non-resolved positions.\n    */\n    static create(doc, from) {\n        return new NodeSelection(doc.resolve(from));\n    }\n    /**\n    Determines whether the given node may be selected as a node\n    selection.\n    */\n    static isSelectable(node) {\n        return !node.isText && node.type.spec.selectable !== false;\n    }\n}\nNodeSelection.prototype.visible = false;\nSelection.jsonID(\"node\", NodeSelection);\nclass NodeBookmark {\n    constructor(anchor) {\n        this.anchor = anchor;\n    }\n    map(mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos);\n    }\n    resolve(doc) {\n        let $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;\n        if (node && NodeSelection.isSelectable(node))\n            return new NodeSelection($pos);\n        return Selection.near($pos);\n    }\n}\n/**\nA selection type that represents selecting the whole document\n(which can not necessarily be expressed with a text selection, when\nthere are for example leaf block nodes at the start or end of the\ndocument).\n*/\nclass AllSelection extends Selection {\n    /**\n    Create an all-selection over the given document.\n    */\n    constructor(doc) {\n        super(doc.resolve(0), doc.resolve(doc.content.size));\n    }\n    replace(tr, content = Slice.empty) {\n        if (content == Slice.empty) {\n            tr.delete(0, tr.doc.content.size);\n            let sel = Selection.atStart(tr.doc);\n            if (!sel.eq(tr.selection))\n                tr.setSelection(sel);\n        }\n        else {\n            super.replace(tr, content);\n        }\n    }\n    toJSON() { return { type: \"all\" }; }\n    /**\n    @internal\n    */\n    static fromJSON(doc) { return new AllSelection(doc); }\n    map(doc) { return new AllSelection(doc); }\n    eq(other) { return other instanceof AllSelection; }\n    getBookmark() { return AllBookmark; }\n}\nSelection.jsonID(\"all\", AllSelection);\nconst AllBookmark = {\n    map() { return this; },\n    resolve(doc) { return new AllSelection(doc); }\n};\n// FIXME we'll need some awareness of text direction when scanning for selections\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 = false) {\n    if (node.inlineContent)\n        return TextSelection.create(doc, pos);\n    for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n        let child = node.child(i);\n        if (!child.isAtom) {\n            let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);\n            if (inner)\n                return inner;\n        }\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    return null;\n}\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n    let last = tr.steps.length - 1;\n    if (last < startLen)\n        return;\n    let step = tr.steps[last];\n    if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep))\n        return;\n    let map = tr.mapping.maps[last], end;\n    map.forEach((_from, _to, _newFrom, newTo) => { if (end == null)\n        end = newTo; });\n    tr.setSelection(Selection.near(tr.doc.resolve(end), bias));\n}\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4;\n/**\nAn editor state transaction, which can be applied to a state to\ncreate an updated state. Use\n[`EditorState.tr`](https://prosemirror.net/docs/ref/#state.EditorState.tr) to create an instance.\n\nTransactions track changes to the document (they are a subclass of\n[`Transform`](https://prosemirror.net/docs/ref/#transform.Transform)), but also other state changes,\nlike selection updates and adjustments of the set of [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks). In addition, you can store\nmetadata properties in a transaction, which are extra pieces of\ninformation that client code or plugins can use to describe what a\ntransaction represents, so that they can update their [own\nstate](https://prosemirror.net/docs/ref/#state.StateField) accordingly.\n\nThe [editor view](https://prosemirror.net/docs/ref/#view.EditorView) uses a few metadata properties:\nit will attach a property `\"pointer\"` with the value `true` to\nselection transactions directly caused by mouse or touch input, and\na `\"uiEvent\"` property of that may be `\"paste\"`, `\"cut\"`, or `\"drop\"`.\n*/\nclass Transaction extends Transform {\n    /**\n    @internal\n    */\n    constructor(state) {\n        super(state.doc);\n        // The step count for which the current selection is valid.\n        this.curSelectionFor = 0;\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        this.time = Date.now();\n        this.curSelection = state.selection;\n        this.storedMarks = state.storedMarks;\n    }\n    /**\n    The transaction's current selection. This defaults to the editor\n    selection [mapped](https://prosemirror.net/docs/ref/#state.Selection.map) through the steps in the\n    transaction, but can be overwritten with\n    [`setSelection`](https://prosemirror.net/docs/ref/#state.Transaction.setSelection).\n    */\n    get selection() {\n        if (this.curSelectionFor < this.steps.length) {\n            this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));\n            this.curSelectionFor = this.steps.length;\n        }\n        return this.curSelection;\n    }\n    /**\n    Update the transaction's current selection. Will determine the\n    selection that the editor gets when the transaction is applied.\n    */\n    setSelection(selection) {\n        if (selection.$from.doc != this.doc)\n            throw new RangeError(\"Selection passed to setSelection must point at the current document\");\n        this.curSelection = selection;\n        this.curSelectionFor = this.steps.length;\n        this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;\n        this.storedMarks = null;\n        return this;\n    }\n    /**\n    Whether the selection was explicitly updated by this transaction.\n    */\n    get selectionSet() {\n        return (this.updated & UPDATED_SEL) > 0;\n    }\n    /**\n    Set the current stored marks.\n    */\n    setStoredMarks(marks) {\n        this.storedMarks = marks;\n        this.updated |= UPDATED_MARKS;\n        return this;\n    }\n    /**\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    */\n    ensureMarks(marks) {\n        if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n            this.setStoredMarks(marks);\n        return this;\n    }\n    /**\n    Add a mark to the set of stored marks.\n    */\n    addStoredMark(mark) {\n        return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Remove a mark or mark type from the set of stored marks.\n    */\n    removeStoredMark(mark) {\n        return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Whether the stored marks were explicitly set for this transaction.\n    */\n    get storedMarksSet() {\n        return (this.updated & UPDATED_MARKS) > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        super.addStep(step, doc);\n        this.updated = this.updated & ~UPDATED_MARKS;\n        this.storedMarks = null;\n    }\n    /**\n    Update the timestamp for the transaction.\n    */\n    setTime(time) {\n        this.time = time;\n        return this;\n    }\n    /**\n    Replace the current selection with the given slice.\n    */\n    replaceSelection(slice) {\n        this.selection.replace(this, slice);\n        return this;\n    }\n    /**\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    */\n    replaceSelectionWith(node, inheritMarks = true) {\n        let selection = this.selection;\n        if (inheritMarks)\n            node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)));\n        selection.replaceWith(this, node);\n        return this;\n    }\n    /**\n    Delete the selection.\n    */\n    deleteSelection() {\n        this.selection.replace(this);\n        return this;\n    }\n    /**\n    Replace the given range, or the selection if no range is given,\n    with a text node containing the given string.\n    */\n    insertText(text, from, to) {\n        let schema = this.doc.type.schema;\n        if (from == null) {\n            if (!text)\n                return this.deleteSelection();\n            return this.replaceSelectionWith(schema.text(text), true);\n        }\n        else {\n            if (to == null)\n                to = from;\n            to = to == null ? from : to;\n            if (!text)\n                return this.deleteRange(from, to);\n            let marks = this.storedMarks;\n            if (!marks) {\n                let $from = this.doc.resolve(from);\n                marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));\n            }\n            this.replaceRangeWith(from, to, schema.text(text, marks));\n            if (!this.selection.empty)\n                this.setSelection(Selection.near(this.selection.$to));\n            return this;\n        }\n    }\n    /**\n    Store a metadata property in this transaction, keyed either by\n    name or by plugin.\n    */\n    setMeta(key, value) {\n        this.meta[typeof key == \"string\" ? key : key.key] = value;\n        return this;\n    }\n    /**\n    Retrieve a metadata property for a given name or plugin.\n    */\n    getMeta(key) {\n        return this.meta[typeof key == \"string\" ? key : key.key];\n    }\n    /**\n    Returns true if this transaction doesn't contain any metadata,\n    and can thus safely be extended.\n    */\n    get isGeneric() {\n        for (let _ in this.meta)\n            return false;\n        return true;\n    }\n    /**\n    Indicate that the editor should scroll the selection into view\n    when updated to the state produced by this transaction.\n    */\n    scrollIntoView() {\n        this.updated |= UPDATED_SCROLL;\n        return this;\n    }\n    /**\n    True when this transaction has had `scrollIntoView` called on it.\n    */\n    get scrolledIntoView() {\n        return (this.updated & UPDATED_SCROLL) > 0;\n    }\n}\n\nfunction bind(f, self) {\n    return !self || !f ? f : f.bind(self);\n}\nclass FieldDesc {\n    constructor(name, desc, self) {\n        this.name = name;\n        this.init = bind(desc.init, self);\n        this.apply = bind(desc.apply, self);\n    }\n}\nconst baseFields = [\n    new FieldDesc(\"doc\", {\n        init(config) { return config.doc || config.schema.topNodeType.createAndFill(); },\n        apply(tr) { return tr.doc; }\n    }),\n    new FieldDesc(\"selection\", {\n        init(config, instance) { return config.selection || Selection.atStart(instance.doc); },\n        apply(tr) { return tr.selection; }\n    }),\n    new FieldDesc(\"storedMarks\", {\n        init(config) { return config.storedMarks || null; },\n        apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null; }\n    }),\n    new FieldDesc(\"scrollToSelection\", {\n        init() { return 0; },\n        apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev; }\n    })\n];\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n    constructor(schema, plugins) {\n        this.schema = schema;\n        this.plugins = [];\n        this.pluginsByKey = Object.create(null);\n        this.fields = baseFields.slice();\n        if (plugins)\n            plugins.forEach(plugin => {\n                if (this.pluginsByKey[plugin.key])\n                    throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\");\n                this.plugins.push(plugin);\n                this.pluginsByKey[plugin.key] = plugin;\n                if (plugin.spec.state)\n                    this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin));\n            });\n    }\n}\n/**\nThe state of a ProseMirror editor is represented by an object of\nthis type. A state is a persistent data structure—it isn't\nupdated, but rather a new state value is computed from an old one\nusing the [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) method.\n\nA state holds a number of built-in fields, and plugins can\n[define](https://prosemirror.net/docs/ref/#state.PluginSpec.state) additional fields.\n*/\nclass EditorState {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    config) {\n        this.config = config;\n    }\n    /**\n    The schema of the state's document.\n    */\n    get schema() {\n        return this.config.schema;\n    }\n    /**\n    The plugins that are active in this state.\n    */\n    get plugins() {\n        return this.config.plugins;\n    }\n    /**\n    Apply the given transaction to produce a new state.\n    */\n    apply(tr) {\n        return this.applyTransaction(tr).state;\n    }\n    /**\n    @ignore\n    */\n    filterTransaction(tr, ignore = -1) {\n        for (let i = 0; i < this.config.plugins.length; i++)\n            if (i != ignore) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n                    return false;\n            }\n        return true;\n    }\n    /**\n    Verbose variant of [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) that\n    returns the precise transactions that were applied (which might\n    be influenced by the [transaction\n    hooks](https://prosemirror.net/docs/ref/#state.PluginSpec.filterTransaction) of\n    plugins) along with the new state.\n    */\n    applyTransaction(rootTr) {\n        if (!this.filterTransaction(rootTr))\n            return { state: this, transactions: [] };\n        let trs = [rootTr], newState = this.applyInner(rootTr), seen = null;\n        // This loop repeatedly gives plugins a chance to respond to\n        // transactions as new transactions are added, making sure to only\n        // pass the transactions the plugin did not see before.\n        for (;;) {\n            let haveNew = false;\n            for (let i = 0; i < this.config.plugins.length; i++) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.appendTransaction) {\n                    let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this;\n                    let tr = n < trs.length &&\n                        plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);\n                    if (tr && newState.filterTransaction(tr, i)) {\n                        tr.setMeta(\"appendedTransaction\", rootTr);\n                        if (!seen) {\n                            seen = [];\n                            for (let j = 0; j < this.config.plugins.length; j++)\n                                seen.push(j < i ? { state: newState, n: trs.length } : { state: this, n: 0 });\n                        }\n                        trs.push(tr);\n                        newState = newState.applyInner(tr);\n                        haveNew = true;\n                    }\n                    if (seen)\n                        seen[i] = { state: newState, n: trs.length };\n                }\n            }\n            if (!haveNew)\n                return { state: newState, transactions: trs };\n        }\n    }\n    /**\n    @internal\n    */\n    applyInner(tr) {\n        if (!tr.before.eq(this.doc))\n            throw new RangeError(\"Applying a mismatched transaction\");\n        let newInstance = new EditorState(this.config), fields = this.config.fields;\n        for (let i = 0; i < fields.length; i++) {\n            let field = fields[i];\n            newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);\n        }\n        return newInstance;\n    }\n    /**\n    Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.\n    */\n    get tr() { return new Transaction(this); }\n    /**\n    Create a new state.\n    */\n    static create(config) {\n        let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins);\n        let instance = new EditorState($config);\n        for (let i = 0; i < $config.fields.length; i++)\n            instance[$config.fields[i].name] = $config.fields[i].init(config, instance);\n        return instance;\n    }\n    /**\n    Create a new state based on this one, but with an adjusted set\n    of active plugins. State fields that exist in both sets of\n    plugins are kept unchanged. Those that no longer exist are\n    dropped, and those that are new are initialized using their\n    [`init`](https://prosemirror.net/docs/ref/#state.StateField.init) method, passing in the new\n    configuration object..\n    */\n    reconfigure(config) {\n        let $config = new Configuration(this.schema, config.plugins);\n        let fields = $config.fields, instance = new EditorState($config);\n        for (let i = 0; i < fields.length; i++) {\n            let name = fields[i].name;\n            instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);\n        }\n        return instance;\n    }\n    /**\n    Serialize this state to JSON. If you want to serialize the state\n    of plugins, pass an object mapping property names to use in the\n    resulting JSON object to plugin objects. The argument may also be\n    a string or number, in which case it is ignored, to support the\n    way `JSON.stringify` calls `toString` methods.\n    */\n    toJSON(pluginFields) {\n        let result = { doc: this.doc.toJSON(), selection: this.selection.toJSON() };\n        if (this.storedMarks)\n            result.storedMarks = this.storedMarks.map(m => m.toJSON());\n        if (pluginFields && typeof pluginFields == 'object')\n            for (let prop in pluginFields) {\n                if (prop == \"doc\" || prop == \"selection\")\n                    throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\");\n                let plugin = pluginFields[prop], state = plugin.spec.state;\n                if (state && state.toJSON)\n                    result[prop] = state.toJSON.call(plugin, this[plugin.key]);\n            }\n        return result;\n    }\n    /**\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    static fromJSON(config, json, pluginFields) {\n        if (!json)\n            throw new RangeError(\"Invalid input for EditorState.fromJSON\");\n        if (!config.schema)\n            throw new RangeError(\"Required config field 'schema' missing\");\n        let $config = new Configuration(config.schema, config.plugins);\n        let instance = new EditorState($config);\n        $config.fields.forEach(field => {\n            if (field.name == \"doc\") {\n                instance.doc = Node.fromJSON(config.schema, json.doc);\n            }\n            else if (field.name == \"selection\") {\n                instance.selection = Selection.fromJSON(instance.doc, json.selection);\n            }\n            else if (field.name == \"storedMarks\") {\n                if (json.storedMarks)\n                    instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON);\n            }\n            else {\n                if (pluginFields)\n                    for (let prop in pluginFields) {\n                        let plugin = pluginFields[prop], state = plugin.spec.state;\n                        if (plugin.key == field.name && state && state.fromJSON &&\n                            Object.prototype.hasOwnProperty.call(json, prop)) {\n                            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\nfunction bindProps(obj, self, target) {\n    for (let prop in obj) {\n        let val = obj[prop];\n        if (val instanceof Function)\n            val = val.bind(self);\n        else if (prop == \"handleDOMEvents\")\n            val = bindProps(val, self, {});\n        target[prop] = val;\n    }\n    return target;\n}\n/**\nPlugins bundle functionality that can be added to an editor.\nThey are part of the [editor state](https://prosemirror.net/docs/ref/#state.EditorState) and\nmay influence that state and the view that contains it.\n*/\nclass Plugin {\n    /**\n    Create a plugin.\n    */\n    constructor(\n    /**\n    The plugin's [spec object](https://prosemirror.net/docs/ref/#state.PluginSpec).\n    */\n    spec) {\n        this.spec = spec;\n        /**\n        The [props](https://prosemirror.net/docs/ref/#view.EditorProps) exported by this plugin.\n        */\n        this.props = {};\n        if (spec.props)\n            bindProps(spec.props, this, this.props);\n        this.key = spec.key ? spec.key.key : createKey(\"plugin\");\n    }\n    /**\n    Extract the plugin's state field from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\nconst keys = Object.create(null);\nfunction createKey(name) {\n    if (name in keys)\n        return name + \"$\" + ++keys[name];\n    keys[name] = 0;\n    return name + \"$\";\n}\n/**\nA key is used to [tag](https://prosemirror.net/docs/ref/#state.PluginSpec.key) plugins in a way\nthat makes it possible to find them, given an editor state.\nAssigning a key does mean only one plugin of that type can be\nactive in a state.\n*/\nclass PluginKey {\n    /**\n    Create a plugin key.\n    */\n    constructor(name = \"key\") { this.key = createKey(name); }\n    /**\n    Get the active plugin with this key, if any, from an editor\n    state.\n    */\n    get(state) { return state.config.pluginsByKey[this.key]; }\n    /**\n    Get the plugin's state from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\n\nexport { AllSelection, EditorState, NodeSelection, Plugin, PluginKey, Selection, SelectionRange, TextSelection, Transaction };\n","import { findWrapping, ReplaceAroundStep, canSplit, liftTarget, canJoin } from 'prosemirror-transform';\nimport { NodeRange, Fragment, Slice } from 'prosemirror-model';\nimport { Selection } from 'prosemirror-state';\n\nconst olDOM = [\"ol\", 0], ulDOM = [\"ul\", 0], liDOM = [\"li\", 0];\n/**\nAn ordered list [node spec](https://prosemirror.net/docs/ref/#model.NodeSpec). Has a single\nattribute, `order`, which determines the number at which the list\nstarts counting, and defaults to 1. Represented as an `<ol>`\nelement.\n*/\nconst orderedList = {\n    attrs: { order: { default: 1 } },\n    parseDOM: [{ tag: \"ol\", getAttrs(dom) {\n                return { order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1 };\n            } }],\n    toDOM(node) {\n        return node.attrs.order == 1 ? olDOM : [\"ol\", { start: node.attrs.order }, 0];\n    }\n};\n/**\nA bullet list node spec, represented in the DOM as `<ul>`.\n*/\nconst bulletList = {\n    parseDOM: [{ tag: \"ul\" }],\n    toDOM() { return ulDOM; }\n};\n/**\nA list item (`<li>`) spec.\n*/\nconst listItem = {\n    parseDOM: [{ tag: \"li\" }],\n    toDOM() { return liDOM; },\n    defining: true\n};\nfunction add(obj, props) {\n    let copy = {};\n    for (let prop in obj)\n        copy[prop] = obj[prop];\n    for (let prop in props)\n        copy[prop] = props[prop];\n    return copy;\n}\n/**\nConvenience function for adding list-related node types to a map\nspecifying the nodes for a schema. Adds\n[`orderedList`](https://prosemirror.net/docs/ref/#schema-list.orderedList) as `\"ordered_list\"`,\n[`bulletList`](https://prosemirror.net/docs/ref/#schema-list.bulletList) as `\"bullet_list\"`, and\n[`listItem`](https://prosemirror.net/docs/ref/#schema-list.listItem) as `\"list_item\"`.\n\n`itemContent` determines the content expression for the list items.\nIf you want the commands defined in this module to apply to your\nlist structure, it should have a shape like `\"paragraph block*\"` or\n`\"paragraph (ordered_list | bullet_list)*\"`. `listGroup` can be\ngiven to assign a group name to the list node types, for example\n`\"block\"`.\n*/\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/**\nReturns a command function that wraps the selection in a list with\nthe given type an attributes. If `dispatch` is null, only return a\nvalue to indicate whether this is possible, but don't actually\nperform the change.\n*/\nfunction wrapInList(listType, attrs = null) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to), doJoin = false, outerRange = range;\n        if (!range)\n            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)\n                return false;\n            let $insert = state.doc.resolve(range.start - 2);\n            outerRange = new NodeRange($insert, $insert, range.depth);\n            if (range.endIndex < range.parent.childCount)\n                range = new NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth);\n            doJoin = true;\n        }\n        let wrap = findWrapping(outerRange, listType, attrs, range);\n        if (!wrap)\n            return false;\n        if (dispatch)\n            dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView());\n        return true;\n    };\n}\nfunction doWrapInList(tr, range, wrappers, joinBefore, listType) {\n    let content = Fragment.empty;\n    for (let i = wrappers.length - 1; i >= 0; i--)\n        content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n    tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new Slice(content, 0, 0), wrappers.length, true));\n    let found = 0;\n    for (let i = 0; i < wrappers.length; i++)\n        if (wrappers[i].type == listType)\n            found = i + 1;\n    let splitDepth = wrappers.length - found;\n    let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;\n    for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {\n        if (!first && canSplit(tr.doc, splitPos, splitDepth)) {\n            tr.split(splitPos, splitDepth);\n            splitPos += 2 * splitDepth;\n        }\n        splitPos += parent.child(i).nodeSize;\n    }\n    return tr;\n}\n/**\nBuild a command that splits a non-empty textblock at the top level\nof a list item by also splitting that list item.\n*/\nfunction splitListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to, node } = state.selection;\n        if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to))\n            return false;\n        let grandParent = $from.node(-1);\n        if (grandParent.type != itemType)\n            return false;\n        if ($from.parent.content.size == 0 && $from.node(-1).childCount == $from.indexAfter(-1)) {\n            // In an empty block. If this is a nested list, the wrapping\n            // list item should be split. Otherwise, bail out and let next\n            // command handle lifting.\n            if ($from.depth == 3 || $from.node(-3).type != itemType ||\n                $from.index(-2) != $from.node(-2).childCount - 1)\n                return false;\n            if (dispatch) {\n                let wrap = Fragment.empty;\n                let depthBefore = $from.index(-1) ? 1 : $from.index(-2) ? 2 : 3;\n                // Build a fragment containing empty versions of the structure\n                // from the outer list item to the parent node of the cursor\n                for (let d = $from.depth - depthBefore; d >= $from.depth - 3; d--)\n                    wrap = Fragment.from($from.node(d).copy(wrap));\n                let depthAfter = $from.indexAfter(-1) < $from.node(-2).childCount ? 1\n                    : $from.indexAfter(-2) < $from.node(-3).childCount ? 2 : 3;\n                // Add a second list item with an empty default start node\n                wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n                let start = $from.before($from.depth - (depthBefore - 1));\n                let tr = state.tr.replace(start, $from.after(-depthAfter), new Slice(wrap, 4 - depthBefore, 0));\n                let sel = -1;\n                tr.doc.nodesBetween(start, tr.doc.content.size, (node, pos) => {\n                    if (sel > -1)\n                        return false;\n                    if (node.isTextblock && node.content.size == 0)\n                        sel = pos + 1;\n                });\n                if (sel > -1)\n                    tr.setSelection(Selection.near(tr.doc.resolve(sel)));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n        let nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null;\n        let tr = state.tr.delete($from.pos, $to.pos);\n        let types = nextType ? [null, { type: nextType }] : undefined;\n        if (!canSplit(tr.doc, $from.pos, 2, types))\n            return false;\n        if (dispatch)\n            dispatch(tr.split($from.pos, 2, types).scrollIntoView());\n        return true;\n    };\n}\n/**\nCreate a command to lift the list item around the selection up into\na wrapping list.\n*/\nfunction liftListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n        if (!range)\n            return false;\n        if (!dispatch)\n            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}\nfunction liftToOuterList(state, dispatch, itemType, range) {\n    let tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);\n    if (end < endOfList) {\n        // There are siblings after the lifted items, which must become\n        // children of the last item\n        tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList, new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));\n        range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);\n    }\n    const target = liftTarget(range);\n    if (target == null)\n        return false;\n    tr.lift(range, target);\n    let after = tr.mapping.map(end, -1) - 1;\n    if (canJoin(tr.doc, after))\n        tr.join(after);\n    dispatch(tr.scrollIntoView());\n    return true;\n}\nfunction liftOutOfList(state, dispatch, range) {\n    let tr = state.tr, list = range.parent;\n    // Merge the list items into a single big item\n    for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {\n        pos -= list.child(i).nodeSize;\n        tr.delete(pos - 1, pos + 1);\n    }\n    let $start = tr.doc.resolve(range.start), item = $start.nodeAfter;\n    if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize)\n        return false;\n    let atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;\n    let parent = $start.node(-1), indexBefore = $start.index(-1);\n    if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? Fragment.empty : Fragment.from(list))))\n        return false;\n    let start = $start.pos, end = start + item.nodeSize;\n    // Strip off the surrounding list. At the sides where we're not at\n    // the end of the list, the existing list is closed. At sides where\n    // this is the end, it is overwritten to its end.\n    tr.step(new ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1, new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty)))\n        .append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));\n    dispatch(tr.scrollIntoView());\n    return true;\n}\n/**\nCreate a command to sink the list item around the selection down\ninto an inner list.\n*/\nfunction sinkListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n        if (!range)\n            return false;\n        let startIndex = range.startIndex;\n        if (startIndex == 0)\n            return false;\n        let parent = range.parent, nodeBefore = parent.child(startIndex - 1);\n        if (nodeBefore.type != itemType)\n            return false;\n        if (dispatch) {\n            let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;\n            let inner = Fragment.from(nestedBefore ? itemType.create() : null);\n            let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);\n            let before = range.start, after = range.end;\n            dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true))\n                .scrollIntoView());\n        }\n        return true;\n    };\n}\n\nexport { addListNodes, bulletList, liftListItem, listItem, orderedList, sinkListItem, splitListItem, wrapInList };\n","import { ReplaceError, Slice, Fragment, MarkType, Mark } from 'prosemirror-model';\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.\nconst lower16 = 0xffff;\nconst factor16 = Math.pow(2, 16);\nfunction makeRecover(index, offset) { return index + offset * factor16; }\nfunction recoverIndex(value) { return value & lower16; }\nfunction recoverOffset(value) { return (value - (value & lower16)) / factor16; }\nconst DEL_BEFORE = 1, DEL_AFTER = 2, DEL_ACROSS = 4, DEL_SIDE = 8;\n/**\nAn object representing a mapped position with extra\ninformation.\n*/\nclass MapResult {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The mapped version of the position.\n    */\n    pos, \n    /**\n    @internal\n    */\n    delInfo, \n    /**\n    @internal\n    */\n    recover) {\n        this.pos = pos;\n        this.delInfo = delInfo;\n        this.recover = recover;\n    }\n    /**\n    Tells you whether the position was deleted, that is, whether the\n    step removed the token on the side queried (via the `assoc`)\n    argument from the document.\n    */\n    get deleted() { return (this.delInfo & DEL_SIDE) > 0; }\n    /**\n    Tells you whether the token before the mapped position was deleted.\n    */\n    get deletedBefore() { return (this.delInfo & (DEL_BEFORE | DEL_ACROSS)) > 0; }\n    /**\n    True when the token after the mapped position was deleted.\n    */\n    get deletedAfter() { return (this.delInfo & (DEL_AFTER | DEL_ACROSS)) > 0; }\n    /**\n    Tells whether any of the steps mapped through deletes across the\n    position (including both the token before and after the\n    position).\n    */\n    get deletedAcross() { return (this.delInfo & DEL_ACROSS) > 0; }\n}\n/**\nA map describing the deletions and insertions made by a step, which\ncan be used to find the correspondence between positions in the\npre-step version of a document and the same position in the\npost-step version.\n*/\nclass StepMap {\n    /**\n    Create a position map. The modifications to the document are\n    represented as an array of numbers, in which each group of three\n    represents a modified chunk as `[start, oldSize, newSize]`.\n    */\n    constructor(\n    /**\n    @internal\n    */\n    ranges, \n    /**\n    @internal\n    */\n    inverted = false) {\n        this.ranges = ranges;\n        this.inverted = inverted;\n        if (!ranges.length && StepMap.empty)\n            return StepMap.empty;\n    }\n    /**\n    @internal\n    */\n    recover(value) {\n        let diff = 0, index = recoverIndex(value);\n        if (!this.inverted)\n            for (let i = 0; i < index; i++)\n                diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];\n        return this.ranges[index * 3] + diff + recoverOffset(value);\n    }\n    mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n    map(pos, assoc = 1) { return this._map(pos, assoc, true); }\n    /**\n    @internal\n    */\n    _map(pos, assoc, simple) {\n        let diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i] - (this.inverted ? diff : 0);\n            if (start > pos)\n                break;\n            let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize;\n            if (pos <= end) {\n                let side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;\n                let result = start + diff + (side < 0 ? 0 : newSize);\n                if (simple)\n                    return result;\n                let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start);\n                let del = pos == start ? DEL_AFTER : pos == end ? DEL_BEFORE : DEL_ACROSS;\n                if (assoc < 0 ? pos != start : pos != end)\n                    del |= DEL_SIDE;\n                return new MapResult(result, del, recover);\n            }\n            diff += newSize - oldSize;\n        }\n        return simple ? pos + diff : new MapResult(pos + diff, 0, null);\n    }\n    /**\n    @internal\n    */\n    touches(pos, recover) {\n        let diff = 0, index = recoverIndex(recover);\n        let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i] - (this.inverted ? diff : 0);\n            if (start > pos)\n                break;\n            let oldSize = this.ranges[i + oldIndex], end = start + oldSize;\n            if (pos <= end && i == index * 3)\n                return true;\n            diff += this.ranges[i + newIndex] - oldSize;\n        }\n        return false;\n    }\n    /**\n    Calls the given function on each of the changed ranges included in\n    this map.\n    */\n    forEach(f) {\n        let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff);\n            let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex];\n            f(oldStart, oldStart + oldSize, newStart, newStart + newSize);\n            diff += newSize - oldSize;\n        }\n    }\n    /**\n    Create an inverted version of this map. The result can be used to\n    map positions in the post-step document to the pre-step document.\n    */\n    invert() {\n        return new StepMap(this.ranges, !this.inverted);\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return (this.inverted ? \"-\" : \"\") + JSON.stringify(this.ranges);\n    }\n    /**\n    Create a map that moves all positions by offset `n` (which may be\n    negative). This can be useful when applying steps meant for a\n    sub-document to a larger document, or vice-versa.\n    */\n    static offset(n) {\n        return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n]);\n    }\n}\n/**\nA StepMap that contains no changed ranges.\n*/\nStepMap.empty = new StepMap([]);\n/**\nA mapping represents a pipeline of zero or more [step\nmaps](https://prosemirror.net/docs/ref/#transform.StepMap). It has special provisions for losslessly\nhandling mapping positions through a series of steps in which some\nsteps are inverted versions of earlier steps. (This comes up when\n‘[rebasing](/docs/guide/#transform.rebasing)’ steps for\ncollaboration or history management.)\n*/\nclass Mapping {\n    /**\n    Create a new mapping with the given position maps.\n    */\n    constructor(\n    /**\n    The step maps in this mapping.\n    */\n    maps = [], \n    /**\n    @internal\n    */\n    mirror, \n    /**\n    The starting position in the `maps` array, used when `map` or\n    `mapResult` is called.\n    */\n    from = 0, \n    /**\n    The end position in the `maps` array.\n    */\n    to = maps.length) {\n        this.maps = maps;\n        this.mirror = mirror;\n        this.from = from;\n        this.to = to;\n    }\n    /**\n    Create a mapping that maps only through a part of this one.\n    */\n    slice(from = 0, to = this.maps.length) {\n        return new Mapping(this.maps, this.mirror, from, to);\n    }\n    /**\n    @internal\n    */\n    copy() {\n        return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to);\n    }\n    /**\n    Add a step map to the end of this mapping. If `mirrors` is\n    given, it should be the index of the step map that is the mirror\n    image of this one.\n    */\n    appendMap(map, mirrors) {\n        this.to = this.maps.push(map);\n        if (mirrors != null)\n            this.setMirror(this.maps.length - 1, mirrors);\n    }\n    /**\n    Add all the step maps in a given mapping to this one (preserving\n    mirroring information).\n    */\n    appendMapping(mapping) {\n        for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n            let mirr = mapping.getMirror(i);\n            this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);\n        }\n    }\n    /**\n    Finds the offset of the step map that mirrors the map at the\n    given offset, in this mapping (as per the second argument to\n    `appendMap`).\n    */\n    getMirror(n) {\n        if (this.mirror)\n            for (let i = 0; i < this.mirror.length; i++)\n                if (this.mirror[i] == n)\n                    return this.mirror[i + (i % 2 ? -1 : 1)];\n    }\n    /**\n    @internal\n    */\n    setMirror(n, m) {\n        if (!this.mirror)\n            this.mirror = [];\n        this.mirror.push(n, m);\n    }\n    /**\n    Append the inverse of the given mapping to this one.\n    */\n    appendMappingInverted(mapping) {\n        for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n            let mirr = mapping.getMirror(i);\n            this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);\n        }\n    }\n    /**\n    Create an inverted version of this mapping.\n    */\n    invert() {\n        let inverse = new Mapping;\n        inverse.appendMappingInverted(this);\n        return inverse;\n    }\n    /**\n    Map a position through this mapping.\n    */\n    map(pos, assoc = 1) {\n        if (this.mirror)\n            return this._map(pos, assoc, true);\n        for (let i = this.from; i < this.to; i++)\n            pos = this.maps[i].map(pos, assoc);\n        return pos;\n    }\n    /**\n    Map a position through this mapping, returning a mapping\n    result.\n    */\n    mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n    /**\n    @internal\n    */\n    _map(pos, assoc, simple) {\n        let delInfo = 0;\n        for (let i = this.from; i < this.to; i++) {\n            let map = this.maps[i], result = map.mapResult(pos, assoc);\n            if (result.recover != null) {\n                let corr = this.getMirror(i);\n                if (corr != null && corr > i && corr < this.to) {\n                    i = corr;\n                    pos = this.maps[corr].recover(result.recover);\n                    continue;\n                }\n            }\n            delInfo |= result.delInfo;\n            pos = result.pos;\n        }\n        return simple ? pos : new MapResult(pos, delInfo, null);\n    }\n}\n\nconst stepsByID = Object.create(null);\n/**\nA step object represents an atomic change. It generally applies\nonly to the document it was created for, since the positions\nstored in it will only make sense for that document.\n\nNew steps are defined by creating classes that extend `Step`,\noverriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`\nmethods, and registering your class with a unique\nJSON-serialization identifier using\n[`Step.jsonID`](https://prosemirror.net/docs/ref/#transform.Step^jsonID).\n*/\nclass Step {\n    /**\n    Get the step map that represents the changes made by this step,\n    and which can be used to transform between positions in the old\n    and the new document.\n    */\n    getMap() { return StepMap.empty; }\n    /**\n    Try to merge this step with another one, to be applied directly\n    after it. Returns the merged step when possible, null if the\n    steps can't be merged.\n    */\n    merge(other) { return null; }\n    /**\n    Deserialize a step from its JSON representation. Will call\n    through to the step class' own implementation of this method.\n    */\n    static fromJSON(schema, json) {\n        if (!json || !json.stepType)\n            throw new RangeError(\"Invalid input for Step.fromJSON\");\n        let type = stepsByID[json.stepType];\n        if (!type)\n            throw new RangeError(`No step type ${json.stepType} defined`);\n        return type.fromJSON(schema, json);\n    }\n    /**\n    To be able to serialize steps to JSON, each step needs a string\n    ID to attach to its JSON representation. Use this method to\n    register an ID for your step classes. Try to pick something\n    that's unlikely to clash with steps from other modules.\n    */\n    static jsonID(id, stepClass) {\n        if (id in stepsByID)\n            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/**\nThe result of [applying](https://prosemirror.net/docs/ref/#transform.Step.apply) a step. Contains either a\nnew document or a failure value.\n*/\nclass StepResult {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The transformed document, if successful.\n    */\n    doc, \n    /**\n    The failure message, if unsuccessful.\n    */\n    failed) {\n        this.doc = doc;\n        this.failed = failed;\n    }\n    /**\n    Create a successful step result.\n    */\n    static ok(doc) { return new StepResult(doc, null); }\n    /**\n    Create a failed step result.\n    */\n    static fail(message) { return new StepResult(null, message); }\n    /**\n    Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given\n    arguments. Create a successful result if it succeeds, and a\n    failed one if it throws a `ReplaceError`.\n    */\n    static fromReplace(doc, from, to, slice) {\n        try {\n            return StepResult.ok(doc.replace(from, to, slice));\n        }\n        catch (e) {\n            if (e instanceof ReplaceError)\n                return StepResult.fail(e.message);\n            throw e;\n        }\n    }\n}\n\nfunction mapFragment(fragment, f, parent) {\n    let mapped = [];\n    for (let i = 0; i < fragment.childCount; i++) {\n        let child = fragment.child(i);\n        if (child.content.size)\n            child = child.copy(mapFragment(child.content, f, child));\n        if (child.isInline)\n            child = f(child, parent, i);\n        mapped.push(child);\n    }\n    return Fragment.fromArray(mapped);\n}\n/**\nAdd a mark to all inline content between two positions.\n*/\nclass AddMarkStep extends Step {\n    /**\n    Create a mark step.\n    */\n    constructor(\n    /**\n    The start of the marked range.\n    */\n    from, \n    /**\n    The end of the marked range.\n    */\n    to, \n    /**\n    The mark to add.\n    */\n    mark) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);\n        let parent = $from.node($from.sharedDepth(this.to));\n        let slice = new Slice(mapFragment(oldSlice.content, (node, parent) => {\n            if (!node.isAtom || !parent.type.allowsMarkType(this.mark.type))\n                return node;\n            return node.mark(this.mark.addToSet(node.marks));\n        }, parent), oldSlice.openStart, oldSlice.openEnd);\n        return StepResult.fromReplace(doc, this.from, this.to, slice);\n    }\n    invert() {\n        return new RemoveMarkStep(this.from, this.to, this.mark);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deleted && to.deleted || from.pos >= to.pos)\n            return null;\n        return new AddMarkStep(from.pos, to.pos, this.mark);\n    }\n    merge(other) {\n        if (other instanceof AddMarkStep &&\n            other.mark.eq(this.mark) &&\n            this.from <= other.to && this.to >= other.from)\n            return new AddMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n        return null;\n    }\n    toJSON() {\n        return { stepType: \"addMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for AddMarkStep.fromJSON\");\n        return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"addMark\", AddMarkStep);\n/**\nRemove a mark from all inline content between two positions.\n*/\nclass RemoveMarkStep extends Step {\n    /**\n    Create a mark-removing step.\n    */\n    constructor(\n    /**\n    The start of the unmarked range.\n    */\n    from, \n    /**\n    The end of the unmarked range.\n    */\n    to, \n    /**\n    The mark to remove.\n    */\n    mark) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let oldSlice = doc.slice(this.from, this.to);\n        let slice = new Slice(mapFragment(oldSlice.content, node => {\n            return node.mark(this.mark.removeFromSet(node.marks));\n        }, doc), oldSlice.openStart, oldSlice.openEnd);\n        return StepResult.fromReplace(doc, this.from, this.to, slice);\n    }\n    invert() {\n        return new AddMarkStep(this.from, this.to, this.mark);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deleted && to.deleted || from.pos >= to.pos)\n            return null;\n        return new RemoveMarkStep(from.pos, to.pos, this.mark);\n    }\n    merge(other) {\n        if (other instanceof RemoveMarkStep &&\n            other.mark.eq(this.mark) &&\n            this.from <= other.to && this.to >= other.from)\n            return new RemoveMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n        return null;\n    }\n    toJSON() {\n        return { stepType: \"removeMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for RemoveMarkStep.fromJSON\");\n        return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"removeMark\", RemoveMarkStep);\n/**\nAdd a mark to a specific node.\n*/\nclass AddNodeMarkStep extends Step {\n    /**\n    Create a node mark step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The mark to add.\n    */\n    mark) {\n        super();\n        this.pos = pos;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at mark step's position\");\n        let updated = node.type.create(node.attrs, null, this.mark.addToSet(node.marks));\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    invert(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (node) {\n            let newSet = this.mark.addToSet(node.marks);\n            if (newSet.length == node.marks.length) {\n                for (let i = 0; i < node.marks.length; i++)\n                    if (!node.marks[i].isInSet(newSet))\n                        return new AddNodeMarkStep(this.pos, node.marks[i]);\n                return new AddNodeMarkStep(this.pos, this.mark);\n            }\n        }\n        return new RemoveNodeMarkStep(this.pos, this.mark);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new AddNodeMarkStep(pos.pos, this.mark);\n    }\n    toJSON() {\n        return { stepType: \"addNodeMark\", pos: this.pos, mark: this.mark.toJSON() };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for AddNodeMarkStep.fromJSON\");\n        return new AddNodeMarkStep(json.pos, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"addNodeMark\", AddNodeMarkStep);\n/**\nRemove a mark from a specific node.\n*/\nclass RemoveNodeMarkStep extends Step {\n    /**\n    Create a mark-removing step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The mark to remove.\n    */\n    mark) {\n        super();\n        this.pos = pos;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at mark step's position\");\n        let updated = node.type.create(node.attrs, null, this.mark.removeFromSet(node.marks));\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    invert(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node || !this.mark.isInSet(node.marks))\n            return this;\n        return new AddNodeMarkStep(this.pos, this.mark);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new RemoveNodeMarkStep(pos.pos, this.mark);\n    }\n    toJSON() {\n        return { stepType: \"removeNodeMark\", pos: this.pos, mark: this.mark.toJSON() };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for RemoveNodeMarkStep.fromJSON\");\n        return new RemoveNodeMarkStep(json.pos, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"removeNodeMark\", RemoveNodeMarkStep);\n\n/**\nReplace a part of the document with a slice of new content.\n*/\nclass ReplaceStep extends Step {\n    /**\n    The given `slice` should fit the 'gap' between `from` and\n    `to`—the depths must line up, and the surrounding nodes must be\n    able to be joined with the open sides of the slice. When\n    `structure` is true, the step will fail if the content between\n    from and to is not just a sequence of closing and then opening\n    tokens (this is to guard against rebased replace steps\n    overwriting something they weren't supposed to).\n    */\n    constructor(\n    /**\n    The start position of the replaced range.\n    */\n    from, \n    /**\n    The end position of the replaced range.\n    */\n    to, \n    /**\n    The slice to insert.\n    */\n    slice, \n    /**\n    @internal\n    */\n    structure = false) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.slice = slice;\n        this.structure = structure;\n    }\n    apply(doc) {\n        if (this.structure && contentBetween(doc, this.from, this.to))\n            return StepResult.fail(\"Structure replace would overwrite content\");\n        return StepResult.fromReplace(doc, this.from, this.to, this.slice);\n    }\n    getMap() {\n        return new StepMap([this.from, this.to - this.from, this.slice.size]);\n    }\n    invert(doc) {\n        return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to));\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deletedAcross && to.deletedAcross)\n            return null;\n        return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice);\n    }\n    merge(other) {\n        if (!(other instanceof ReplaceStep) || other.structure || this.structure)\n            return null;\n        if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {\n            let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n                : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);\n            return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure);\n        }\n        else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {\n            let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n                : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);\n            return new ReplaceStep(other.from, this.to, slice, this.structure);\n        }\n        else {\n            return null;\n        }\n    }\n    toJSON() {\n        let json = { stepType: \"replace\", from: this.from, to: this.to };\n        if (this.slice.size)\n            json.slice = this.slice.toJSON();\n        if (this.structure)\n            json.structure = true;\n        return json;\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for ReplaceStep.fromJSON\");\n        return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure);\n    }\n}\nStep.jsonID(\"replace\", ReplaceStep);\n/**\nReplace a part of the document with a slice of content, but\npreserve a range of the replaced content by moving it into the\nslice.\n*/\nclass ReplaceAroundStep extends Step {\n    /**\n    Create a replace-around step with the given range and gap.\n    `insert` should be the point in the slice into which the content\n    of the gap should be moved. `structure` has the same meaning as\n    it has in the [`ReplaceStep`](https://prosemirror.net/docs/ref/#transform.ReplaceStep) class.\n    */\n    constructor(\n    /**\n    The start position of the replaced range.\n    */\n    from, \n    /**\n    The end position of the replaced range.\n    */\n    to, \n    /**\n    The start of preserved range.\n    */\n    gapFrom, \n    /**\n    The end of preserved range.\n    */\n    gapTo, \n    /**\n    The slice to insert.\n    */\n    slice, \n    /**\n    The position in the slice where the preserved range should be\n    inserted.\n    */\n    insert, \n    /**\n    @internal\n    */\n    structure = false) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.gapFrom = gapFrom;\n        this.gapTo = gapTo;\n        this.slice = slice;\n        this.insert = insert;\n        this.structure = structure;\n    }\n    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        let gap = doc.slice(this.gapFrom, this.gapTo);\n        if (gap.openStart || gap.openEnd)\n            return StepResult.fail(\"Gap is not a flat range\");\n        let inserted = this.slice.insertAt(this.insert, gap.content);\n        if (!inserted)\n            return StepResult.fail(\"Content does not fit in gap\");\n        return StepResult.fromReplace(doc, this.from, this.to, inserted);\n    }\n    getMap() {\n        return new StepMap([this.from, this.gapFrom - this.from, this.insert,\n            this.gapTo, this.to - this.gapTo, this.slice.size - this.insert]);\n    }\n    invert(doc) {\n        let gap = this.gapTo - this.gapFrom;\n        return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap, this.from + this.insert, this.from + this.insert + gap, doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        let gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);\n        if ((from.deletedAcross && to.deletedAcross) || gapFrom < from.pos || gapTo > to.pos)\n            return null;\n        return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure);\n    }\n    toJSON() {\n        let json = { stepType: \"replaceAround\", from: this.from, to: this.to,\n            gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert };\n        if (this.slice.size)\n            json.slice = this.slice.toJSON();\n        if (this.structure)\n            json.structure = true;\n        return json;\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\" ||\n            typeof json.gapFrom != \"number\" || typeof json.gapTo != \"number\" || typeof json.insert != \"number\")\n            throw new RangeError(\"Invalid input for ReplaceAroundStep.fromJSON\");\n        return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo, Slice.fromJSON(schema, json.slice), json.insert, !!json.structure);\n    }\n}\nStep.jsonID(\"replaceAround\", ReplaceAroundStep);\nfunction contentBetween(doc, from, to) {\n    let $from = doc.resolve(from), dist = to - from, depth = $from.depth;\n    while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {\n        depth--;\n        dist--;\n    }\n    if (dist > 0) {\n        let next = $from.node(depth).maybeChild($from.indexAfter(depth));\n        while (dist > 0) {\n            if (!next || next.isLeaf)\n                return true;\n            next = next.firstChild;\n            dist--;\n        }\n    }\n    return false;\n}\n\nfunction addMark(tr, from, to, mark) {\n    let removed = [], added = [];\n    let removing, adding;\n    tr.doc.nodesBetween(from, to, (node, pos, parent) => {\n        if (!node.isInline)\n            return;\n        let marks = node.marks;\n        if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n            let start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);\n            let newSet = mark.addToSet(marks);\n            for (let i = 0; i < marks.length; i++) {\n                if (!marks[i].isInSet(newSet)) {\n                    if (removing && removing.to == start && removing.mark.eq(marks[i]))\n                        removing.to = end;\n                    else\n                        removed.push(removing = new RemoveMarkStep(start, end, marks[i]));\n                }\n            }\n            if (adding && adding.to == start)\n                adding.to = end;\n            else\n                added.push(adding = new AddMarkStep(start, end, mark));\n        }\n    });\n    removed.forEach(s => tr.step(s));\n    added.forEach(s => tr.step(s));\n}\nfunction removeMark(tr, from, to, mark) {\n    let matched = [], step = 0;\n    tr.doc.nodesBetween(from, to, (node, pos) => {\n        if (!node.isInline)\n            return;\n        step++;\n        let toRemove = null;\n        if (mark instanceof MarkType) {\n            let set = node.marks, found;\n            while (found = mark.isInSet(set)) {\n                (toRemove || (toRemove = [])).push(found);\n                set = found.removeFromSet(set);\n            }\n        }\n        else if (mark) {\n            if (mark.isInSet(node.marks))\n                toRemove = [mark];\n        }\n        else {\n            toRemove = node.marks;\n        }\n        if (toRemove && toRemove.length) {\n            let end = Math.min(pos + node.nodeSize, to);\n            for (let i = 0; i < toRemove.length; i++) {\n                let style = toRemove[i], found;\n                for (let j = 0; j < matched.length; j++) {\n                    let m = matched[j];\n                    if (m.step == step - 1 && style.eq(matched[j].style))\n                        found = m;\n                }\n                if (found) {\n                    found.to = end;\n                    found.step = step;\n                }\n                else {\n                    matched.push({ style, from: Math.max(pos, from), to: end, step });\n                }\n            }\n        }\n    });\n    matched.forEach(m => tr.step(new RemoveMarkStep(m.from, m.to, m.style)));\n}\nfunction clearIncompatible(tr, pos, parentType, match = parentType.contentMatch) {\n    let node = tr.doc.nodeAt(pos);\n    let delSteps = [], cur = pos + 1;\n    for (let i = 0; i < node.childCount; i++) {\n        let child = node.child(i), end = cur + child.nodeSize;\n        let allowed = match.matchType(child.type);\n        if (!allowed) {\n            delSteps.push(new ReplaceStep(cur, end, Slice.empty));\n        }\n        else {\n            match = allowed;\n            for (let j = 0; j < child.marks.length; j++)\n                if (!parentType.allowsMarkType(child.marks[j].type))\n                    tr.step(new RemoveMarkStep(cur, end, child.marks[j]));\n        }\n        cur = end;\n    }\n    if (!match.validEnd) {\n        let fill = match.fillBefore(Fragment.empty, true);\n        tr.replace(cur, cur, new Slice(fill, 0, 0));\n    }\n    for (let i = delSteps.length - 1; i >= 0; i--)\n        tr.step(delSteps[i]);\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/**\nTry to find a target depth to which the content in the given range\ncan be lifted. Will not go across\n[isolating](https://prosemirror.net/docs/ref/#model.NodeSpec.isolating) parent nodes.\n*/\nfunction liftTarget(range) {\n    let parent = range.parent;\n    let content = parent.content.cutByIndex(range.startIndex, range.endIndex);\n    for (let depth = range.depth;; --depth) {\n        let node = range.$from.node(depth);\n        let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);\n        if (depth < range.depth && node.canReplace(index, endIndex, content))\n            return depth;\n        if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex))\n            break;\n    }\n    return null;\n}\nfunction lift(tr, range, target) {\n    let { $from, $to, depth } = range;\n    let gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);\n    let start = gapStart, end = gapEnd;\n    let before = Fragment.empty, openStart = 0;\n    for (let d = depth, splitting = false; d > target; d--)\n        if (splitting || $from.index(d) > 0) {\n            splitting = true;\n            before = Fragment.from($from.node(d).copy(before));\n            openStart++;\n        }\n        else {\n            start--;\n        }\n    let after = Fragment.empty, openEnd = 0;\n    for (let d = depth, splitting = false; d > target; d--)\n        if (splitting || $to.after(d + 1) < $to.end(d)) {\n            splitting = true;\n            after = Fragment.from($to.node(d).copy(after));\n            openEnd++;\n        }\n        else {\n            end++;\n        }\n    tr.step(new ReplaceAroundStep(start, end, gapStart, gapEnd, new Slice(before.append(after), openStart, openEnd), before.size - openStart, true));\n}\n/**\nTry to find a valid way to wrap the content in the given range in a\nnode of the given type. May introduce extra nodes around and inside\nthe wrapper node, if necessary. Returns null if no valid wrapping\ncould be found. When `innerRange` is given, that range's content is\nused as the content to fit into the wrapping, instead of the\ncontent of `range`.\n*/\nfunction findWrapping(range, nodeType, attrs = null, innerRange = range) {\n    let around = findWrappingOutside(range, nodeType);\n    let inner = around && findWrappingInside(innerRange, nodeType);\n    if (!inner)\n        return null;\n    return around.map(withAttrs)\n        .concat({ type: nodeType, attrs }).concat(inner.map(withAttrs));\n}\nfunction withAttrs(type) { return { type, attrs: null }; }\nfunction findWrappingOutside(range, type) {\n    let { parent, startIndex, endIndex } = range;\n    let around = parent.contentMatchAt(startIndex).findWrapping(type);\n    if (!around)\n        return null;\n    let outer = around.length ? around[0] : type;\n    return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null;\n}\nfunction findWrappingInside(range, type) {\n    let { parent, startIndex, endIndex } = range;\n    let inner = parent.child(startIndex);\n    let inside = type.contentMatch.findWrapping(inner.type);\n    if (!inside)\n        return null;\n    let lastType = inside.length ? inside[inside.length - 1] : type;\n    let innerMatch = lastType.contentMatch;\n    for (let i = startIndex; innerMatch && i < endIndex; i++)\n        innerMatch = innerMatch.matchType(parent.child(i).type);\n    if (!innerMatch || !innerMatch.validEnd)\n        return null;\n    return inside;\n}\nfunction wrap(tr, range, wrappers) {\n    let content = Fragment.empty;\n    for (let i = wrappers.length - 1; i >= 0; i--) {\n        if (content.size) {\n            let match = wrappers[i].type.contentMatch.matchFragment(content);\n            if (!match || !match.validEnd)\n                throw new RangeError(\"Wrapper type given to Transform.wrap does not form valid content of its parent wrapper\");\n        }\n        content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n    }\n    let start = range.start, end = range.end;\n    tr.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true));\n}\nfunction setBlockType(tr, from, to, type, attrs) {\n    if (!type.isTextblock)\n        throw new RangeError(\"Type given to setBlockType should be a textblock\");\n    let mapFrom = tr.steps.length;\n    tr.doc.nodesBetween(from, to, (node, pos) => {\n        if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(tr.doc, tr.mapping.slice(mapFrom).map(pos), type)) {\n            // Ensure all markup that isn't allowed in the new node type is cleared\n            tr.clearIncompatible(tr.mapping.slice(mapFrom).map(pos, 1), type);\n            let mapping = tr.mapping.slice(mapFrom);\n            let startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);\n            tr.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1, new Slice(Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));\n            return false;\n        }\n    });\n}\nfunction canChangeType(doc, pos, type) {\n    let $pos = doc.resolve(pos), index = $pos.index();\n    return $pos.parent.canReplaceWith(index, index + 1, type);\n}\n/**\nChange the type, attributes, and/or marks of the node at `pos`.\nWhen `type` isn't given, the existing node type is preserved,\n*/\nfunction setNodeMarkup(tr, pos, type, attrs, marks) {\n    let node = tr.doc.nodeAt(pos);\n    if (!node)\n        throw new RangeError(\"No node at given position\");\n    if (!type)\n        type = node.type;\n    let newNode = type.create(attrs, null, marks || node.marks);\n    if (node.isLeaf)\n        return tr.replaceWith(pos, pos + node.nodeSize, newNode);\n    if (!type.validContent(node.content))\n        throw new RangeError(\"Invalid content for node type \" + type.name);\n    tr.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1, new Slice(Fragment.from(newNode), 0, 0), 1, true));\n}\n/**\nCheck whether splitting at the given position is allowed.\n*/\nfunction canSplit(doc, pos, depth = 1, typesAfter) {\n    let $pos = doc.resolve(pos), base = $pos.depth - depth;\n    let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;\n    if (base < 0 || $pos.parent.type.spec.isolating ||\n        !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||\n        !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))\n        return false;\n    for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n        let node = $pos.node(d), index = $pos.index(d);\n        if (node.type.spec.isolating)\n            return false;\n        let rest = node.content.cutByIndex(index, node.childCount);\n        let after = (typesAfter && typesAfter[i]) || node;\n        if (after != node)\n            rest = rest.replaceChild(0, after.type.create(after.attrs));\n        if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n            return false;\n    }\n    let index = $pos.indexAfter(base);\n    let baseType = typesAfter && typesAfter[0];\n    return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);\n}\nfunction split(tr, pos, depth = 1, typesAfter) {\n    let $pos = tr.doc.resolve(pos), before = Fragment.empty, after = Fragment.empty;\n    for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n        before = Fragment.from($pos.node(d).copy(before));\n        let typeAfter = typesAfter && typesAfter[i];\n        after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));\n    }\n    tr.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true));\n}\n/**\nTest whether the blocks before and after a given position can be\njoined.\n*/\nfunction canJoin(doc, pos) {\n    let $pos = doc.resolve(pos), index = $pos.index();\n    return joinable($pos.nodeBefore, $pos.nodeAfter) &&\n        $pos.parent.canReplace(index, index + 1);\n}\nfunction joinable(a, b) {\n    return !!(a && b && !a.isLeaf && a.canAppend(b));\n}\n/**\nFind an ancestor of the given position that can be joined to the\nblock before (or after if `dir` is positive). Returns the joinable\npoint, if any.\n*/\nfunction joinPoint(doc, pos, dir = -1) {\n    let $pos = doc.resolve(pos);\n    for (let d = $pos.depth;; d--) {\n        let before, after, index = $pos.index(d);\n        if (d == $pos.depth) {\n            before = $pos.nodeBefore;\n            after = $pos.nodeAfter;\n        }\n        else if (dir > 0) {\n            before = $pos.node(d + 1);\n            index++;\n            after = $pos.node(d).maybeChild(index);\n        }\n        else {\n            before = $pos.node(d).maybeChild(index - 1);\n            after = $pos.node(d + 1);\n        }\n        if (before && !before.isTextblock && joinable(before, after) &&\n            $pos.node(d).canReplace(index, index + 1))\n            return pos;\n        if (d == 0)\n            break;\n        pos = dir < 0 ? $pos.before(d) : $pos.after(d);\n    }\n}\nfunction join(tr, pos, depth) {\n    let step = new ReplaceStep(pos - depth, pos + depth, Slice.empty, true);\n    tr.step(step);\n}\n/**\nTry to find a point where a node of the given type can be inserted\nnear `pos`, by searching up the node hierarchy when `pos` itself\nisn't a valid place but is at the start or end of a node. Return\nnull if no position was found.\n*/\nfunction insertPoint(doc, pos, nodeType) {\n    let $pos = doc.resolve(pos);\n    if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType))\n        return pos;\n    if ($pos.parentOffset == 0)\n        for (let d = $pos.depth - 1; d >= 0; d--) {\n            let index = $pos.index(d);\n            if ($pos.node(d).canReplaceWith(index, index, nodeType))\n                return $pos.before(d + 1);\n            if (index > 0)\n                return null;\n        }\n    if ($pos.parentOffset == $pos.parent.content.size)\n        for (let d = $pos.depth - 1; d >= 0; d--) {\n            let index = $pos.indexAfter(d);\n            if ($pos.node(d).canReplaceWith(index, index, nodeType))\n                return $pos.after(d + 1);\n            if (index < $pos.node(d).childCount)\n                return null;\n        }\n    return null;\n}\n/**\nFinds a position at or around the given position where the given\nslice can be inserted. Will look at parent nodes' nearest boundary\nand try there, even if the original position wasn't directly at the\nstart or end of that node. Returns null when no position was found.\n*/\nfunction dropPoint(doc, pos, slice) {\n    let $pos = doc.resolve(pos);\n    if (!slice.content.size)\n        return pos;\n    let content = slice.content;\n    for (let i = 0; i < slice.openStart; i++)\n        content = content.firstChild.content;\n    for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n        for (let d = $pos.depth; d >= 0; d--) {\n            let bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;\n            let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);\n            let parent = $pos.node(d), fits = false;\n            if (pass == 1) {\n                fits = parent.canReplace(insertPos, insertPos, content);\n            }\n            else {\n                let wrapping = parent.contentMatchAt(insertPos).findWrapping(content.firstChild.type);\n                fits = wrapping && parent.canReplaceWith(insertPos, insertPos, wrapping[0]);\n            }\n            if (fits)\n                return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1);\n        }\n    }\n    return null;\n}\n\n/**\n‘Fit’ a slice into a given position in the document, producing a\n[step](https://prosemirror.net/docs/ref/#transform.Step) that inserts it. Will return null if\nthere's no meaningful way to insert the slice here, or inserting it\nwould be a no-op (an empty slice over an empty range).\n*/\nfunction replaceStep(doc, from, to = from, slice = Slice.empty) {\n    if (from == to && !slice.size)\n        return null;\n    let $from = doc.resolve(from), $to = doc.resolve(to);\n    // Optimization -- avoid work if it's obvious that it's not needed.\n    if (fitsTrivially($from, $to, slice))\n        return new ReplaceStep(from, to, slice);\n    return new Fitter($from, $to, slice).fit();\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// Algorithm for 'placing' the elements of a slice into a gap:\n//\n// We consider the content of each node that is open to the left to be\n// independently placeable. I.e. in <p(\"foo\"), p(\"bar\")>, when the\n// paragraph on the left is open, \"foo\" can be placed (somewhere on\n// the left side of the replacement gap) independently from p(\"bar\").\n//\n// This class tracks the state of the placement progress in the\n// following properties:\n//\n//  - `frontier` holds a stack of `{type, match}` objects that\n//    represent the open side of the replacement. It starts at\n//    `$from`, then moves forward as content is placed, and is finally\n//    reconciled with `$to`.\n//\n//  - `unplaced` is a slice that represents the content that hasn't\n//    been placed yet.\n//\n//  - `placed` is a fragment of placed content. Its open-start value\n//    is implicit in `$from`, and its open-end value in `frontier`.\nclass Fitter {\n    constructor($from, $to, unplaced) {\n        this.$from = $from;\n        this.$to = $to;\n        this.unplaced = unplaced;\n        this.frontier = [];\n        this.placed = Fragment.empty;\n        for (let i = 0; i <= $from.depth; i++) {\n            let node = $from.node(i);\n            this.frontier.push({\n                type: node.type,\n                match: node.contentMatchAt($from.indexAfter(i))\n            });\n        }\n        for (let i = $from.depth; i > 0; i--)\n            this.placed = Fragment.from($from.node(i).copy(this.placed));\n    }\n    get depth() { return this.frontier.length - 1; }\n    fit() {\n        // As long as there's unplaced content, try to place some of it.\n        // If that fails, either increase the open score of the unplaced\n        // slice, or drop nodes from it, and then try again.\n        while (this.unplaced.size) {\n            let fit = this.findFittable();\n            if (fit)\n                this.placeNodes(fit);\n            else\n                this.openMore() || this.dropNode();\n        }\n        // When there's inline content directly after the frontier _and_\n        // directly after `this.$to`, we must generate a `ReplaceAround`\n        // step that pulls that content into the node after the frontier.\n        // That means the fitting must be done to the end of the textblock\n        // node after `this.$to`, not `this.$to` itself.\n        let moveInline = this.mustMoveInline(), placedSize = this.placed.size - this.depth - this.$from.depth;\n        let $from = this.$from, $to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline));\n        if (!$to)\n            return null;\n        // If closing to `$to` succeeded, create a step\n        let content = this.placed, openStart = $from.depth, openEnd = $to.depth;\n        while (openStart && openEnd && content.childCount == 1) { // Normalize by dropping open parent nodes\n            content = content.firstChild.content;\n            openStart--;\n            openEnd--;\n        }\n        let slice = new Slice(content, openStart, openEnd);\n        if (moveInline > -1)\n            return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize);\n        if (slice.size || $from.pos != this.$to.pos) // Don't generate no-op steps\n            return new ReplaceStep($from.pos, $to.pos, slice);\n        return null;\n    }\n    // Find a position on the start spine of `this.unplaced` that has\n    // content that can be moved somewhere on the frontier. Returns two\n    // depths, one for the slice and one for the frontier.\n    findFittable() {\n        // Only try wrapping nodes (pass 2) after finding a place without\n        // wrapping failed.\n        for (let pass = 1; pass <= 2; pass++) {\n            for (let sliceDepth = this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {\n                let fragment, parent = null;\n                if (sliceDepth) {\n                    parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild;\n                    fragment = parent.content;\n                }\n                else {\n                    fragment = this.unplaced.content;\n                }\n                let first = fragment.firstChild;\n                for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {\n                    let { type, match } = this.frontier[frontierDepth], wrap, inject = null;\n                    // In pass 1, if the next node matches, or there is no next\n                    // node but the parents look compatible, we've found a\n                    // place.\n                    if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false))\n                        : parent && type.compatibleContent(parent.type)))\n                        return { sliceDepth, frontierDepth, parent, inject };\n                    // In pass 2, look for a set of wrapping nodes that make\n                    // `first` fit here.\n                    else if (pass == 2 && first && (wrap = match.findWrapping(first.type)))\n                        return { sliceDepth, frontierDepth, parent, wrap };\n                    // Don't continue looking further up if the parent node\n                    // would fit here.\n                    if (parent && match.matchType(parent.type))\n                        break;\n                }\n            }\n        }\n    }\n    openMore() {\n        let { content, openStart, openEnd } = this.unplaced;\n        let inner = contentAt(content, openStart);\n        if (!inner.childCount || inner.firstChild.isLeaf)\n            return false;\n        this.unplaced = new Slice(content, openStart + 1, Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0));\n        return true;\n    }\n    dropNode() {\n        let { content, openStart, openEnd } = this.unplaced;\n        let inner = contentAt(content, openStart);\n        if (inner.childCount <= 1 && openStart > 0) {\n            let openAtEnd = content.size - openStart <= openStart + inner.size;\n            this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1, openAtEnd ? openStart - 1 : openEnd);\n        }\n        else {\n            this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd);\n        }\n    }\n    // Move content from the unplaced slice at `sliceDepth` to the\n    // frontier node at `frontierDepth`. Close that frontier node when\n    // applicable.\n    placeNodes({ sliceDepth, frontierDepth, parent, inject, wrap }) {\n        while (this.depth > frontierDepth)\n            this.closeFrontierNode();\n        if (wrap)\n            for (let i = 0; i < wrap.length; i++)\n                this.openFrontierNode(wrap[i]);\n        let slice = this.unplaced, fragment = parent ? parent.content : slice.content;\n        let openStart = slice.openStart - sliceDepth;\n        let taken = 0, add = [];\n        let { match, type } = this.frontier[frontierDepth];\n        if (inject) {\n            for (let i = 0; i < inject.childCount; i++)\n                add.push(inject.child(i));\n            match = match.matchFragment(inject);\n        }\n        // Computes the amount of (end) open nodes at the end of the\n        // fragment. When 0, the parent is open, but no more. When\n        // negative, nothing is open.\n        let openEndCount = (fragment.size + sliceDepth) - (slice.content.size - slice.openEnd);\n        // Scan over the fragment, fitting as many child nodes as\n        // possible.\n        while (taken < fragment.childCount) {\n            let next = fragment.child(taken), matches = match.matchType(next.type);\n            if (!matches)\n                break;\n            taken++;\n            if (taken > 1 || openStart == 0 || next.content.size) { // Drop empty open nodes\n                match = matches;\n                add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0, taken == fragment.childCount ? openEndCount : -1));\n            }\n        }\n        let toEnd = taken == fragment.childCount;\n        if (!toEnd)\n            openEndCount = -1;\n        this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add));\n        this.frontier[frontierDepth].match = match;\n        // If the parent types match, and the entire node was moved, and\n        // it's not open, close this frontier node right away.\n        if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1)\n            this.closeFrontierNode();\n        // Add new frontier nodes for any open nodes at the end.\n        for (let i = 0, cur = fragment; i < openEndCount; i++) {\n            let node = cur.lastChild;\n            this.frontier.push({ type: node.type, match: node.contentMatchAt(node.childCount) });\n            cur = node.content;\n        }\n        // Update `this.unplaced`. Drop the entire node from which we\n        // placed it we got to its end, otherwise just drop the placed\n        // nodes.\n        this.unplaced = !toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)\n            : sliceDepth == 0 ? Slice.empty\n                : new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1), sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1);\n    }\n    mustMoveInline() {\n        if (!this.$to.parent.isTextblock)\n            return -1;\n        let top = this.frontier[this.depth], level;\n        if (!top.type.isTextblock || !contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||\n            (this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth))\n            return -1;\n        let { depth } = this.$to, after = this.$to.after(depth);\n        while (depth > 1 && after == this.$to.end(--depth))\n            ++after;\n        return after;\n    }\n    findCloseLevel($to) {\n        scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {\n            let { match, type } = this.frontier[i];\n            let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1));\n            let fit = contentAfterFits($to, i, type, match, dropInner);\n            if (!fit)\n                continue;\n            for (let d = i - 1; d >= 0; d--) {\n                let { match, type } = this.frontier[d];\n                let matches = contentAfterFits($to, d, type, match, true);\n                if (!matches || matches.childCount)\n                    continue scan;\n            }\n            return { depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to };\n        }\n    }\n    close($to) {\n        let close = this.findCloseLevel($to);\n        if (!close)\n            return null;\n        while (this.depth > close.depth)\n            this.closeFrontierNode();\n        if (close.fit.childCount)\n            this.placed = addToFragment(this.placed, close.depth, close.fit);\n        $to = close.move;\n        for (let d = close.depth + 1; d <= $to.depth; d++) {\n            let node = $to.node(d), add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d));\n            this.openFrontierNode(node.type, node.attrs, add);\n        }\n        return $to;\n    }\n    openFrontierNode(type, attrs = null, content) {\n        let top = this.frontier[this.depth];\n        top.match = top.match.matchType(type);\n        this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)));\n        this.frontier.push({ type, match: type.contentMatch });\n    }\n    closeFrontierNode() {\n        let open = this.frontier.pop();\n        let add = open.match.fillBefore(Fragment.empty, true);\n        if (add.childCount)\n            this.placed = addToFragment(this.placed, this.frontier.length, add);\n    }\n}\nfunction dropFromFragment(fragment, depth, count) {\n    if (depth == 0)\n        return fragment.cutByIndex(count, fragment.childCount);\n    return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)));\n}\nfunction addToFragment(fragment, depth, content) {\n    if (depth == 0)\n        return fragment.append(content);\n    return fragment.replaceChild(fragment.childCount - 1, fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)));\n}\nfunction contentAt(fragment, depth) {\n    for (let i = 0; i < depth; i++)\n        fragment = fragment.firstChild.content;\n    return fragment;\n}\nfunction closeNodeStart(node, openStart, openEnd) {\n    if (openStart <= 0)\n        return node;\n    let frag = node.content;\n    if (openStart > 1)\n        frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0));\n    if (openStart > 0) {\n        frag = node.type.contentMatch.fillBefore(frag).append(frag);\n        if (openEnd <= 0)\n            frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true));\n    }\n    return node.copy(frag);\n}\nfunction contentAfterFits($to, depth, type, match, open) {\n    let node = $to.node(depth), index = open ? $to.indexAfter(depth) : $to.index(depth);\n    if (index == node.childCount && !type.compatibleContent(node.type))\n        return null;\n    let fit = match.fillBefore(node.content, true, index);\n    return fit && !invalidMarks(type, node.content, index) ? fit : null;\n}\nfunction invalidMarks(type, fragment, start) {\n    for (let i = start; i < fragment.childCount; i++)\n        if (!type.allowsMarks(fragment.child(i).marks))\n            return true;\n    return false;\n}\nfunction definesContent(type) {\n    return type.spec.defining || type.spec.definingForContent;\n}\nfunction replaceRange(tr, from, to, slice) {\n    if (!slice.size)\n        return tr.deleteRange(from, to);\n    let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n    if (fitsTrivially($from, $to, slice))\n        return tr.step(new ReplaceStep(from, to, slice));\n    let targetDepths = coveredDepths($from, tr.doc.resolve(to));\n    // Can't replace the whole document, so remove 0 if it's present\n    if (targetDepths[targetDepths.length - 1] == 0)\n        targetDepths.pop();\n    // Negative numbers represent not expansion over the whole node at\n    // that depth, but replacing from $from.before(-D) to $to.pos.\n    let preferredTarget = -($from.depth + 1);\n    targetDepths.unshift(preferredTarget);\n    // This loop picks a preferred target depth, if one of the covering\n    // depths is not outside of a defining node, and adds negative\n    // depths for any depth that has $from at its start and does not\n    // cross a defining node.\n    for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n        let spec = $from.node(d).type.spec;\n        if (spec.defining || spec.definingAsContext || spec.isolating)\n            break;\n        if (targetDepths.indexOf(d) > -1)\n            preferredTarget = d;\n        else if ($from.before(d) == pos)\n            targetDepths.splice(1, 0, -d);\n    }\n    // Try to fit each possible depth of the slice into each possible\n    // target depth, starting with the preferred depths.\n    let preferredTargetIndex = targetDepths.indexOf(preferredTarget);\n    let leftNodes = [], preferredDepth = slice.openStart;\n    for (let content = slice.content, i = 0;; i++) {\n        let node = content.firstChild;\n        leftNodes.push(node);\n        if (i == slice.openStart)\n            break;\n        content = node.content;\n    }\n    // Back up preferredDepth to cover defining textblocks directly\n    // above it, possibly skipping a non-defining textblock.\n    for (let d = preferredDepth - 1; d >= 0; d--) {\n        let type = leftNodes[d].type, def = definesContent(type);\n        if (def && $from.node(preferredTargetIndex).type != type)\n            preferredDepth = d;\n        else if (def || !type.isTextblock)\n            break;\n    }\n    for (let j = slice.openStart; j >= 0; j--) {\n        let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);\n        let insert = leftNodes[openDepth];\n        if (!insert)\n            continue;\n        for (let i = 0; i < targetDepths.length; i++) {\n            // Loop over possible expansion levels, starting with the\n            // preferred one\n            let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length], expand = true;\n            if (targetDepth < 0) {\n                expand = false;\n                targetDepth = -targetDepth;\n            }\n            let parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);\n            if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n                return tr.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to, new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth), openDepth, slice.openEnd));\n        }\n    }\n    let startSteps = tr.steps.length;\n    for (let i = targetDepths.length - 1; i >= 0; i--) {\n        tr.replace(from, to, slice);\n        if (tr.steps.length > startSteps)\n            break;\n        let depth = targetDepths[i];\n        if (depth < 0)\n            continue;\n        from = $from.before(depth);\n        to = $to.after(depth);\n    }\n}\nfunction closeFragment(fragment, depth, oldOpen, newOpen, parent) {\n    if (depth < oldOpen) {\n        let first = fragment.firstChild;\n        fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));\n    }\n    if (depth > newOpen) {\n        let match = parent.contentMatchAt(0);\n        let start = match.fillBefore(fragment).append(fragment);\n        fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true));\n    }\n    return fragment;\n}\nfunction replaceRangeWith(tr, from, to, node) {\n    if (!node.isInline && from == to && tr.doc.resolve(from).parent.content.size) {\n        let point = insertPoint(tr.doc, from, node.type);\n        if (point != null)\n            from = to = point;\n    }\n    tr.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0));\n}\nfunction deleteRange(tr, from, to) {\n    let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n    let covered = coveredDepths($from, $to);\n    for (let i = 0; i < covered.length; i++) {\n        let depth = covered[i], last = i == covered.length - 1;\n        if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n            return tr.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 tr.delete($from.before(depth), $to.after(depth));\n    }\n    for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {\n        if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)\n            return tr.delete($from.before(d), to);\n    }\n    tr.delete(from, to);\n}\n// Returns an array of all depths for which $from - $to spans the\n// whole content of the nodes at that depth.\nfunction coveredDepths($from, $to) {\n    let result = [], minDepth = Math.min($from.depth, $to.depth);\n    for (let d = minDepth; d >= 0; d--) {\n        let start = $from.start(d);\n        if (start < $from.pos - ($from.depth - d) ||\n            $to.end(d) > $to.pos + ($to.depth - d) ||\n            $from.node(d).type.spec.isolating ||\n            $to.node(d).type.spec.isolating)\n            break;\n        if (start == $to.start(d) ||\n            (d == $from.depth && d == $to.depth && $from.parent.inlineContent && $to.parent.inlineContent &&\n                d && $to.start(d - 1) == start - 1))\n            result.push(d);\n    }\n    return result;\n}\n\n/**\nUpdate an attribute in a specific node.\n*/\nclass AttrStep extends Step {\n    /**\n    Construct an attribute step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The attribute to set.\n    */\n    attr, \n    // The attribute's new value.\n    value) {\n        super();\n        this.pos = pos;\n        this.attr = attr;\n        this.value = value;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at attribute step's position\");\n        let attrs = Object.create(null);\n        for (let name in node.attrs)\n            attrs[name] = node.attrs[name];\n        attrs[this.attr] = this.value;\n        let updated = node.type.create(attrs, null, node.marks);\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    getMap() {\n        return StepMap.empty;\n    }\n    invert(doc) {\n        return new AttrStep(this.pos, this.attr, doc.nodeAt(this.pos).attrs[this.attr]);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new AttrStep(pos.pos, this.attr, this.value);\n    }\n    toJSON() {\n        return { stepType: \"attr\", pos: this.pos, attr: this.attr, value: this.value };\n    }\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\" || typeof json.attr != \"string\")\n            throw new RangeError(\"Invalid input for AttrStep.fromJSON\");\n        return new AttrStep(json.pos, json.attr, json.value);\n    }\n}\nStep.jsonID(\"attr\", AttrStep);\n\n/**\n@internal\n*/\nlet TransformError = class extends Error {\n};\nTransformError = function TransformError(message) {\n    let err = Error.call(this, message);\n    err.__proto__ = TransformError.prototype;\n    return err;\n};\nTransformError.prototype = Object.create(Error.prototype);\nTransformError.prototype.constructor = TransformError;\nTransformError.prototype.name = \"TransformError\";\n/**\nAbstraction to build up and track an array of\n[steps](https://prosemirror.net/docs/ref/#transform.Step) representing a document transformation.\n\nMost transforming methods return the `Transform` object itself, so\nthat they can be chained.\n*/\nclass Transform {\n    /**\n    Create a transform that starts with the given document.\n    */\n    constructor(\n    /**\n    The current document (the result of applying the steps in the\n    transform).\n    */\n    doc) {\n        this.doc = doc;\n        /**\n        The steps in this transform.\n        */\n        this.steps = [];\n        /**\n        The documents before each of the steps.\n        */\n        this.docs = [];\n        /**\n        A mapping with the maps for each of the steps in this transform.\n        */\n        this.mapping = new Mapping;\n    }\n    /**\n    The starting document.\n    */\n    get before() { return this.docs.length ? this.docs[0] : this.doc; }\n    /**\n    Apply a new step in this transform, saving the result. Throws an\n    error when the step fails.\n    */\n    step(step) {\n        let result = this.maybeStep(step);\n        if (result.failed)\n            throw new TransformError(result.failed);\n        return this;\n    }\n    /**\n    Try to apply a step in this transformation, ignoring it if it\n    fails. Returns the step result.\n    */\n    maybeStep(step) {\n        let result = step.apply(this.doc);\n        if (!result.failed)\n            this.addStep(step, result.doc);\n        return result;\n    }\n    /**\n    True when the document has been changed (when there are any\n    steps).\n    */\n    get docChanged() {\n        return this.steps.length > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        this.docs.push(this.doc);\n        this.steps.push(step);\n        this.mapping.appendMap(step.getMap());\n        this.doc = doc;\n    }\n    /**\n    Replace the part of the document between `from` and `to` with the\n    given `slice`.\n    */\n    replace(from, to = from, slice = Slice.empty) {\n        let step = replaceStep(this.doc, from, to, slice);\n        if (step)\n            this.step(step);\n        return this;\n    }\n    /**\n    Replace the given range with the given content, which may be a\n    fragment, node, or array of nodes.\n    */\n    replaceWith(from, to, content) {\n        return this.replace(from, to, new Slice(Fragment.from(content), 0, 0));\n    }\n    /**\n    Delete the content between the given positions.\n    */\n    delete(from, to) {\n        return this.replace(from, to, Slice.empty);\n    }\n    /**\n    Insert the given content at the given position.\n    */\n    insert(pos, content) {\n        return this.replaceWith(pos, pos, content);\n    }\n    /**\n    Replace a range of the document with a given slice, using\n    `from`, `to`, and the slice's\n    [`openStart`](https://prosemirror.net/docs/ref/#model.Slice.openStart) property as hints, rather\n    than fixed start and end points. This method may grow the\n    replaced area or close open nodes in the slice in order to get a\n    fit that is more in line with WYSIWYG expectations, by dropping\n    fully covered parent nodes of the replaced region when they are\n    marked [non-defining as\n    context](https://prosemirror.net/docs/ref/#model.NodeSpec.definingAsContext), or including an\n    open parent node from the slice that _is_ marked as [defining\n    its content](https://prosemirror.net/docs/ref/#model.NodeSpec.definingForContent).\n    \n    This is the method, for example, to handle paste. The similar\n    [`replace`](https://prosemirror.net/docs/ref/#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.\n    */\n    replaceRange(from, to, slice) {\n        replaceRange(this, from, to, slice);\n        return this;\n    }\n    /**\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.\n    */\n    replaceRangeWith(from, to, node) {\n        replaceRangeWith(this, from, to, node);\n        return this;\n    }\n    /**\n    Delete the given range, expanding it to cover fully covered\n    parent nodes until a valid replace is found.\n    */\n    deleteRange(from, to) {\n        deleteRange(this, from, to);\n        return this;\n    }\n    /**\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`](https://prosemirror.net/docs/ref/#transform.liftTarget) to compute `target`, to make\n    sure the lift is valid.\n    */\n    lift(range, target) {\n        lift(this, range, target);\n        return this;\n    }\n    /**\n    Join the blocks around the given position. If depth is 2, their\n    last and first siblings are also joined, and so on.\n    */\n    join(pos, depth = 1) {\n        join(this, pos, depth);\n        return this;\n    }\n    /**\n    Wrap the given [range](https://prosemirror.net/docs/ref/#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`](https://prosemirror.net/docs/ref/#transform.findWrapping).\n    */\n    wrap(range, wrappers) {\n        wrap(this, range, wrappers);\n        return this;\n    }\n    /**\n    Set the type of all textblocks (partly) between `from` and `to` to\n    the given node type with the given attributes.\n    */\n    setBlockType(from, to = from, type, attrs = null) {\n        setBlockType(this, from, to, type, attrs);\n        return this;\n    }\n    /**\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,\n    */\n    setNodeMarkup(pos, type, attrs = null, marks = []) {\n        setNodeMarkup(this, pos, type, attrs, marks);\n        return this;\n    }\n    /**\n    Set a single attribute on a given node to a new value.\n    */\n    setNodeAttribute(pos, attr, value) {\n        this.step(new AttrStep(pos, attr, value));\n        return this;\n    }\n    /**\n    Add a mark to the node at position `pos`.\n    */\n    addNodeMark(pos, mark) {\n        this.step(new AddNodeMarkStep(pos, mark));\n        return this;\n    }\n    /**\n    Remove a mark (or a mark of the given type) from the node at\n    position `pos`.\n    */\n    removeNodeMark(pos, mark) {\n        if (!(mark instanceof Mark)) {\n            let node = this.doc.nodeAt(pos);\n            if (!node)\n                throw new RangeError(\"No node at position \" + pos);\n            mark = mark.isInSet(node.marks);\n            if (!mark)\n                return this;\n        }\n        this.step(new RemoveNodeMarkStep(pos, mark));\n        return this;\n    }\n    /**\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.\n    */\n    split(pos, depth = 1, typesAfter) {\n        split(this, pos, depth, typesAfter);\n        return this;\n    }\n    /**\n    Add the given mark to the inline content between `from` and `to`.\n    */\n    addMark(from, to, mark) {\n        addMark(this, from, to, mark);\n        return this;\n    }\n    /**\n    Remove marks from inline nodes between `from` and `to`. When\n    `mark` is a single mark, remove precisely that mark. When it is\n    a mark type, remove all marks of that type. When it is null,\n    remove all marks of any type.\n    */\n    removeMark(from, to, mark) {\n        removeMark(this, from, to, mark);\n        return this;\n    }\n    /**\n    Removes all marks and nodes from the content of the node at\n    `pos` that don't match the given new parent node type. Accepts\n    an optional starting [content match](https://prosemirror.net/docs/ref/#model.ContentMatch) as\n    third argument.\n    */\n    clearIncompatible(pos, parentType, match) {\n        clearIncompatible(this, pos, parentType, match);\n        return this;\n    }\n}\n\nexport { AddMarkStep, AddNodeMarkStep, AttrStep, MapResult, Mapping, RemoveMarkStep, RemoveNodeMarkStep, ReplaceAroundStep, ReplaceStep, Step, StepMap, StepResult, Transform, TransformError, canJoin, canSplit, dropPoint, findWrapping, insertPoint, joinPoint, liftTarget, replaceStep };\n","import { keyName, base } from 'w3c-keyname';\nimport { Plugin } from 'prosemirror-state';\n\nconst mac = typeof navigator != \"undefined\" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : false;\nfunction normalizeKeyName(name) {\n    let parts = name.split(/-(?!$)/), result = parts[parts.length - 1];\n    if (result == \"Space\")\n        result = \" \";\n    let alt, ctrl, shift, meta;\n    for (let i = 0; i < parts.length - 1; i++) {\n        let mod = parts[i];\n        if (/^(cmd|meta|m)$/i.test(mod))\n            meta = true;\n        else if (/^a(lt)?$/i.test(mod))\n            alt = true;\n        else if (/^(c|ctrl|control)$/i.test(mod))\n            ctrl = true;\n        else if (/^s(hift)?$/i.test(mod))\n            shift = true;\n        else if (/^mod$/i.test(mod)) {\n            if (mac)\n                meta = true;\n            else\n                ctrl = true;\n        }\n        else\n            throw new Error(\"Unrecognized modifier name: \" + mod);\n    }\n    if (alt)\n        result = \"Alt-\" + result;\n    if (ctrl)\n        result = \"Ctrl-\" + result;\n    if (meta)\n        result = \"Meta-\" + result;\n    if (shift)\n        result = \"Shift-\" + result;\n    return result;\n}\nfunction normalize(map) {\n    let copy = Object.create(null);\n    for (let prop in map)\n        copy[normalizeKeyName(prop)] = map[prop];\n    return copy;\n}\nfunction modifiers(name, event, shift) {\n    if (event.altKey)\n        name = \"Alt-\" + name;\n    if (event.ctrlKey)\n        name = \"Ctrl-\" + name;\n    if (event.metaKey)\n        name = \"Meta-\" + name;\n    if (shift !== false && event.shiftKey)\n        name = \"Shift-\" + name;\n    return name;\n}\n/**\nCreate a keymap plugin for the given set of bindings.\n\nBindings should map key names to [command](https://prosemirror.net/docs/ref/#commands)-style\nfunctions, which will be called with `(EditorState, dispatch,\nEditorView)` arguments, and should return true when they've handled\nthe key. Note that the view argument isn't part of the command\nprotocol, but can be used as an escape hatch if a binding needs to\ndirectly interact with the UI.\n\nKey names may be strings like `\"Shift-Ctrl-Enter\"`—a key\nidentifier prefixed with zero or more modifiers. Key identifiers\nare based on the strings that can appear in\n[`KeyEvent.key`](https:developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).\nUse lowercase letters to refer to letter keys (or uppercase letters\nif you want shift to be held). You may use `\"Space\"` as an alias\nfor the `\" \"` name.\n\nModifiers 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\nshift, the `Shift-` prefix is implied, and should not be added\nexplicitly.\n\nYou can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on\nother platforms.\n\nYou can add multiple keymap plugins to an editor. The order in\nwhich they appear determines their precedence (the ones early in\nthe array get to dispatch first).\n*/\nfunction keymap(bindings) {\n    return new Plugin({ props: { handleKeyDown: keydownHandler(bindings) } });\n}\n/**\nGiven a set of bindings (using the same format as\n[`keymap`](https://prosemirror.net/docs/ref/#keymap.keymap)), return a [keydown\nhandler](https://prosemirror.net/docs/ref/#view.EditorProps.handleKeyDown) that handles them.\n*/\nfunction keydownHandler(bindings) {\n    let map = normalize(bindings);\n    return function (view, event) {\n        let name = keyName(event), isChar = name.length == 1 && name != \" \", baseName;\n        let direct = map[modifiers(name, event, !isChar)];\n        if (direct && direct(view.state, view.dispatch, view))\n            return true;\n        if (isChar && (event.shiftKey || event.altKey || event.metaKey || name.charCodeAt(0) > 127) &&\n            (baseName = base[event.keyCode]) && baseName != name) {\n            // Try falling back to the keyCode when there's a modifier\n            // active or the character produced isn't ASCII, and our table\n            // produces a different name from the the keyCode. See #668,\n            // #1060\n            let fromCode = map[modifiers(baseName, event, true)];\n            if (fromCode && fromCode(view.state, view.dispatch, view))\n                return true;\n        }\n        else if (isChar && event.shiftKey) {\n            // Otherwise, if shift is active, also try the binding with the\n            // Shift- prefix enabled. See #997\n            let withShift = map[modifiers(name, event, true)];\n            if (withShift && withShift(view.state, view.dispatch, view))\n                return true;\n        }\n        return false;\n    };\n}\n\nexport { keydownHandler, keymap };\n"],"sourceRoot":""}